String {\\n\\n let sig_msg_frag = MAINNET_TRYTES.get(0..2187).unwrap();\\n\\n let extra_data_digest = MAINNET_TRYTES.get((2187 + 162)..(2187 + 162 + 81)).unwrap(); //copied bundle hash\\n\\n let addr_value_tag_timestamps = MAINNET_TRYTES.get(2187..(2187 + 162)).unwrap();\\n\\n let rest = MAINNET_TRYTES.get((2187 + 162 + 81)..).unwrap();\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 55,\n \"score\": 8.668801493830514\n },\n {\n \"content\": \"\\n\\n pub fn new() -> Self {\\n\\n let offsets = vec![\\n\\n (EXTRA_DATA_DIGEST.4 - 1, SIGNATURE_FRAGMENTS.5),\\n\\n (ADDRESS.4 - 1, EXTRA_DATA_DIGEST.5),\\n\\n (VALUE.4 - 1, ADDRESS.5),\\n\\n (ISSUANCE_TIMESTAMP.4 - 1, VALUE.5),\\n\\n (TIMELOCK_LOWER_BOUND.4 - 1, ISSUANCE_TIMESTAMP.5),\\n\\n (TIMELOCK_UPPER_BOUND.4 - 1, TIMELOCK_LOWER_BOUND.5),\\n\\n (BUNDLE_NONCE.4 - 1, TIMELOCK_UPPER_BOUND.5),\\n\\n (TRUNK_HASH.4 - 1, BUNDLE_NONCE.5),\\n\\n (BRANCH_HASH.4 - 1, TRUNK_HASH.5),\\n\\n (TAG.4 - 1, BRANCH_HASH.5),\\n\\n (ATTACHMENT_TIMESTAMP.4 - 1, TAG.5),\\n\\n (\\n\\n ATTACHMENT_TIMESTAMP_LOWER_BOUND.4 - 1,\\n\\n ATTACHMENT_TIMESTAMP.5,\\n\\n ),\\n\\n (\\n\\n ATTACHMENT_TIMESTAMP_UPPER_BOUND.4 - 1,\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 56,\n \"score\": 8.602009031295125\n },\n {\n \"content\": \" }\\n\\n\\n\\n // NOTE: make sure that ASCIIs are always valid\\n\\n String::from_utf8(ascii_chars).expect(\\\"couldn't create utf8 string\\\")\\n\\n //String::from_utf8_lossy(&ascii_chars[..]).to_string()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::super::tryte_string;\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_from_tryte_string() {\\n\\n let tryte_string = \\\"YEZNMEQWF\\\";\\n\\n let ascii_text = from_tryte_string(tryte_string);\\n\\n\\n\\n //println!(\\\"{}\\\", ascii_text);\\n\\n assert_eq!(\\\"Hello\\\", ascii_text);\\n\\n }\\n\",\n \"file_path\": \"src/convert/ascii.rs\",\n \"rank\": 58,\n \"score\": 8.347508552461573\n },\n {\n \"content\": \" let attachment_timestamp_upper_bound =\\n\\n number::i64_from_trytes_max11(&trytes[ATTACHMENT_TIMESTAMP_UPPER_BOUND.2..NONCE.2]);\\n\\n\\n\\n let nonce = tryte_string::from_trytes(&trytes[NONCE.2..TRANSACTION_SIZE_TRYTES]);\\n\\n\\n\\n Transaction {\\n\\n signature_fragments,\\n\\n extra_data_digest,\\n\\n address,\\n\\n value,\\n\\n issuance_timestamp,\\n\\n timelock_lower_bound,\\n\\n timelock_upper_bound,\\n\\n bundle_nonce,\\n\\n trunk,\\n\\n branch,\\n\\n tag,\\n\\n attachment_timestamp,\\n\\n attachment_timestamp_lower_bound,\\n\\n attachment_timestamp_upper_bound,\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 59,\n \"score\": 7.716657773571213\n },\n {\n \"content\": \" &trytes::from_tryte_string_to_fragment_trytes(&self.signature_fragments)\\n\\n [..SIGNATURE_FRAGMENTS.3],\\n\\n );\\n\\n\\n\\n trytes[EXTRA_DATA_DIGEST.2..ADDRESS.2]\\n\\n .copy_from_slice(&self.extra_data_digest.as_bytes()[..EXTRA_DATA_DIGEST.3]);\\n\\n\\n\\n trytes[ADDRESS.2..VALUE.2].copy_from_slice(&self.address.as_bytes()[..ADDRESS.3]);\\n\\n\\n\\n trytes[VALUE.2..ISSUANCE_TIMESTAMP.2].copy_from_slice(&from_i64_fixed27(self.value));\\n\\n\\n\\n trytes[ISSUANCE_TIMESTAMP.2..TIMELOCK_LOWER_BOUND.2]\\n\\n .copy_from_slice(&from_i64_fixed9(self.issuance_timestamp));\\n\\n\\n\\n trytes[TIMELOCK_LOWER_BOUND.2..TIMELOCK_UPPER_BOUND.2]\\n\\n .copy_from_slice(&from_i64_fixed9(self.timelock_lower_bound));\\n\\n\\n\\n trytes[TIMELOCK_UPPER_BOUND.2..BUNDLE_NONCE.2]\\n\\n .copy_from_slice(&from_i64_fixed9(self.timelock_upper_bound));\\n\\n\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 60,\n \"score\": 7.655247612637066\n },\n {\n \"content\": \" for _ in 0..1000 {\\n\\n let a = i64::from(rand::thread_rng().next_u32());\\n\\n let b = i64::from(rand::thread_rng().next_u32());\\n\\n let c = a - b;\\n\\n assert_eq!(c, i64_from_trytes_max11(&trytes::from_i64_fixed27(c)));\\n\\n }\\n\\n }\\n\\n\\n\\n //#[test]\\n\\n fn test_from_i64() {\\n\\n let trytes = String::from_utf8(from_i64(26, 10)).unwrap();\\n\\n println!(\\\"{}\\\", trytes);\\n\\n //TODO\\n\\n assert!(false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_to_long_value() {\\n\\n let number1 = i64_from_trits(&[1, 1, 1]);\\n\\n let number2 = i64_from_trits(&[-1, -1, -1]);\\n\\n let number1 = i64_from_trits(&[1, 1, 1]);\\n\\n assert_eq!(number1, 13);\\n\\n assert_eq!(number2, -13);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/convert/number.rs\",\n \"rank\": 62,\n \"score\": 7.304670730656227\n },\n {\n \"content\": \" pub trunk: String,\\n\\n pub branch: String,\\n\\n pub tag: String,\\n\\n pub attachment_timestamp: i64,\\n\\n pub attachment_timestamp_lower_bound: i64,\\n\\n pub attachment_timestamp_upper_bound: i64,\\n\\n pub nonce: String,\\n\\n}\\n\\n\\n\\nimpl Transaction {\\n\\n pub fn from_tx_bytes(bytes: &[u8]) -> Self {\\n\\n Transaction::from_tx_trytes(&trytes::from_tx_bytes_2enc9(bytes))\\n\\n }\\n\\n\\n\\n pub fn from_tryte_string(tryte_string: &str) -> Self {\\n\\n assert!(IS_TRYTES.is_match(tryte_string));\\n\\n let bytes = tryte_string.as_bytes();\\n\\n assert_eq!(bytes.len(), TRANSACTION_SIZE_TRYTES);\\n\\n\\n\\n let mut trytes = [0; TRANSACTION_SIZE_TRYTES];\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 63,\n \"score\": 7.2885169213294425\n },\n {\n \"content\": \" pub fn tag(mut self, tag: &str) -> Self {\\n\\n assert!(IS_TRYTES.is_match(tag));\\n\\n assert!(tag.len() <= TAG.3);\\n\\n\\n\\n self.tag = tryte_string::pad_right(tag, TAG.3);\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for Transaction {\\n\\n fn default() -> Self {\\n\\n let timestamp = time::get_unix_time_millis();\\n\\n\\n\\n Transaction {\\n\\n signature_fragments: TRYTE_NULL_STR.repeat(SIGNATURE_FRAGMENTS.3),\\n\\n extra_data_digest: TRYTE_NULL_STR.repeat(EXTRA_DATA_DIGEST.3),\\n\\n address: TRYTE_NULL_STR.repeat(ADDRESS.3),\\n\\n value: 0,\\n\\n issuance_timestamp: timestamp,\\n\\n timelock_lower_bound: 0,\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 64,\n \"score\": 7.160485662305307\n },\n {\n \"content\": \" trytes[..].copy_from_slice(&bytes[..]);\\n\\n\\n\\n Transaction::from_tx_trytes(&trytes)\\n\\n }\\n\\n\\n\\n pub fn from_tx_trytes(trytes: &TxTrytes) -> Self {\\n\\n let signature_fragments =\\n\\n tryte_string::from_trytes(&trytes[SIGNATURE_FRAGMENTS.2..EXTRA_DATA_DIGEST.2]);\\n\\n\\n\\n let extra_data_digest = tryte_string::from_trytes(&trytes[EXTRA_DATA_DIGEST.2..ADDRESS.2]);\\n\\n\\n\\n let address = tryte_string::from_trytes(&trytes[ADDRESS.2..VALUE.2]);\\n\\n\\n\\n let value = number::i64_from_trytes_max11(&trytes[VALUE.2..ISSUANCE_TIMESTAMP.2]);\\n\\n\\n\\n let issuance_timestamp =\\n\\n number::i64_from_trytes_max11(&trytes[ISSUANCE_TIMESTAMP.2..TIMELOCK_LOWER_BOUND.2]);\\n\\n\\n\\n let timelock_lower_bound =\\n\\n number::i64_from_trytes_max11(&trytes[TIMELOCK_LOWER_BOUND.2..TIMELOCK_UPPER_BOUND.2]);\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 65,\n \"score\": 7.023974494300544\n },\n {\n \"content\": \"use super::luts::*;\\n\\nuse super::trits::*;\\n\\nuse super::trytes::{self, *};\\n\\n\\n\",\n \"file_path\": \"src/convert/tryte_string.rs\",\n \"rank\": 66,\n \"score\": 6.887531976584618\n },\n {\n \"content\": \" [1, -1, -1], // P => -11\\n\\n [-1, 0, -1], // Q => -10\\n\\n [0, 0, -1], // R => -9\\n\\n [1, 0, -1], // S => -8\\n\\n [-1, 1, -1], // T => -7\\n\\n [0, 1, -1], // U => -6\\n\\n [1, 1, -1], // V => -5\\n\\n [-1, -1, 0], // W => -4\\n\\n [0, -1, 0], // X => -3\\n\\n [1, -1, 0], // Y => -2\\n\\n [-1, 0, 0], // Z => -1\\n\\n];\\n\\nlazy_static! {\\n\\n pub static ref ASCII_TO_TRIT_TRIPLET: HashMap<Tryte, [Trit; 3]> = [\\n\\n (57, [0, 0, 0]),\\n\\n (65, [1, 0, 0]),\\n\\n (66, [-1, 1, 0]),\\n\\n (67, [0, 1, 0]),\\n\\n (68, [1, 1, 0]),\\n\\n (69, [-1, -1, 1]),\\n\",\n \"file_path\": \"src/convert/luts.rs\",\n \"rank\": 67,\n \"score\": 6.699305816310833\n },\n {\n \"content\": \" trytes[BUNDLE_NONCE.2..TRUNK_HASH.2]\\n\\n .copy_from_slice(&self.bundle_nonce.as_bytes()[..BUNDLE_NONCE.3]);\\n\\n\\n\\n trytes[TRUNK_HASH.2..BRANCH_HASH.2].copy_from_slice(&self.trunk.as_bytes()[..TRUNK_HASH.3]);\\n\\n\\n\\n trytes[BRANCH_HASH.2..TAG.2].copy_from_slice(&self.branch.as_bytes()[..BRANCH_HASH.3]);\\n\\n\\n\\n trytes[TAG.2..ATTACHMENT_TIMESTAMP.2].copy_from_slice(&self.tag.as_bytes()[0..TAG.3]);\\n\\n\\n\\n trytes[ATTACHMENT_TIMESTAMP.2..ATTACHMENT_TIMESTAMP_LOWER_BOUND.2]\\n\\n .copy_from_slice(&from_i64_fixed9(self.attachment_timestamp));\\n\\n\\n\\n trytes[ATTACHMENT_TIMESTAMP_LOWER_BOUND.2..ATTACHMENT_TIMESTAMP_UPPER_BOUND.2]\\n\\n .copy_from_slice(&from_i64_fixed9(self.attachment_timestamp_lower_bound));\\n\\n\\n\\n trytes[ATTACHMENT_TIMESTAMP_UPPER_BOUND.2..NONCE.2]\\n\\n .copy_from_slice(&from_i64_fixed9(self.attachment_timestamp_upper_bound));\\n\\n\\n\\n trytes[NONCE.2..TRANSACTION_SIZE_TRYTES].copy_from_slice(&self.nonce.as_bytes()[..NONCE.3]);\\n\\n\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 68,\n \"score\": 6.655107806704852\n },\n {\n \"content\": \" transaction: Transaction::default(),\\n\\n }\\n\\n }\\n\\n pub fn value(mut self, value: i64) -> Self {\\n\\n assert!(value.abs() <= MAX_TOKEN_SUPPLY);\\n\\n\\n\\n self.transaction.value = value;\\n\\n self\\n\\n }\\n\\n pub fn trunk(mut self, trunk: &str) -> Self {\\n\\n assert!(IS_TRYTES.is_match(trunk));\\n\\n assert!(trunk.len() <= TRUNK_HASH.3);\\n\\n\\n\\n self.transaction.trunk = trunk.to_string();\\n\\n self\\n\\n }\\n\\n pub fn branch(mut self, branch: &str) -> Self {\\n\\n assert!(IS_TRYTES.is_match(branch));\\n\\n assert!(branch.len() <= BRANCH_HASH.3);\\n\\n\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 69,\n \"score\": 6.491646558964857\n },\n {\n \"content\": \"use structopt::StructOpt;\\n\\n\\n\\nmod algos;\\n\\nmod constants;\\n\\nmod convert;\\n\\nmod model;\\n\\nmod receiver;\\n\\nmod sender;\\n\\nmod time;\\n\\n\\n\\nuse crate::algos::*;\\n\\nuse crate::constants::{MAX_MESSAGE_LENGTH, MIN_MESSAGE_LENGTH};\\n\\n\\n\\n#[derive(Debug, StructOpt)]\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 71,\n \"score\": 6.222362172664296\n },\n {\n \"content\": \" timelock_upper_bound: 0,\\n\\n bundle_nonce: TRYTE_NULL_STR.repeat(BUNDLE_NONCE.3),\\n\\n trunk: TRYTE_NULL_STR.repeat(TRUNK_HASH.3),\\n\\n branch: TRYTE_NULL_STR.repeat(BRANCH_HASH.3),\\n\\n tag: TRYTE_NULL_STR.repeat(TAG.3),\\n\\n attachment_timestamp: timestamp,\\n\\n attachment_timestamp_lower_bound: 0,\\n\\n attachment_timestamp_upper_bound: 0,\\n\\n nonce: TRYTE_NULL_STR.repeat(NONCE.3),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct TransactionBuilder {\\n\\n transaction: Transaction,\\n\\n}\\n\\n\\n\\nimpl TransactionBuilder {\\n\\n pub fn default() -> Self {\\n\\n TransactionBuilder {\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 72,\n \"score\": 6.151770242865153\n },\n {\n \"content\": \"\\n\\n let timelock_upper_bound =\\n\\n number::i64_from_trytes_max11(&trytes[TIMELOCK_UPPER_BOUND.2..BUNDLE_NONCE.2]);\\n\\n\\n\\n let bundle_nonce = tryte_string::from_trytes(&trytes[BUNDLE_NONCE.2..TRUNK_HASH.2]);\\n\\n\\n\\n let trunk = tryte_string::from_trytes(&trytes[TRUNK_HASH.2..BRANCH_HASH.2]);\\n\\n\\n\\n let branch = tryte_string::from_trytes(&trytes[BRANCH_HASH.2..TAG.2]);\\n\\n\\n\\n let tag = tryte_string::from_trytes(&trytes[TAG.2..ATTACHMENT_TIMESTAMP.2]);\\n\\n\\n\\n let attachment_timestamp = number::i64_from_trytes_max11(\\n\\n &trytes[ATTACHMENT_TIMESTAMP.2..ATTACHMENT_TIMESTAMP_LOWER_BOUND.2],\\n\\n );\\n\\n\\n\\n let attachment_timestamp_lower_bound = number::i64_from_trytes_max11(\\n\\n &trytes[ATTACHMENT_TIMESTAMP_LOWER_BOUND.2..ATTACHMENT_TIMESTAMP_UPPER_BOUND.2],\\n\\n );\\n\\n\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 73,\n \"score\": 6.084539532222038\n },\n {\n \"content\": \"use crate::constants::*;\\n\\nuse crate::convert::bytes::TxBytes;\\n\\nuse crate::convert::luts::*;\\n\\nuse crate::convert::trytes::TxTrytes;\\n\\n\\n\\npub type Trit = i8;\\n\\npub type Trits243 = [i8; 243];\\n\\npub type TxTrits = [i8; TRANSACTION_SIZE_TRITS];\\n\\n\\n\",\n \"file_path\": \"src/convert/trits.rs\",\n \"rank\": 75,\n \"score\": 5.709727595494598\n },\n {\n \"content\": \" self.transaction.branch = branch.to_string();\\n\\n self\\n\\n }\\n\\n pub fn message(mut self, message: &str) -> Self {\\n\\n assert!(message.len() <= SIGNATURE_FRAGMENTS.3);\\n\\n\\n\\n self.transaction.signature_fragments =\\n\\n tryte_string::pad_right(&tryte_string::from_ascii(message), SIGNATURE_FRAGMENTS.3);\\n\\n self\\n\\n }\\n\\n pub fn tag(mut self, tag: &str) -> Self {\\n\\n assert!(IS_TRYTES.is_match(tag));\\n\\n assert!(tag.len() <= TAG.3);\\n\\n\\n\\n self.transaction.tag = tryte_string::pad_right(tag, TAG.3);\\n\\n self\\n\\n }\\n\\n pub fn build(self) -> Transaction {\\n\\n self.transaction\\n\\n }\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 76,\n \"score\": 5.534528231918671\n },\n {\n \"content\": \" let decompressed = trim_all\\n\\n .decompress(&compressed)\\n\\n .expect(\\\"error decompressing transactions bytes\\\");\\n\\n\\n\\n println!(\\\"decompressed = {}\\\", decompressed.len());\\n\\n\\n\\n let tx2 = Transaction::from_tx_bytes(&decompressed);\\n\\n\\n\\n assert_eq!(tx.as_tryte_string(), tx2.as_tryte_string());\\n\\n\\n\\n //use super::super::convert::ascii;\\n\\n //let msg = ascii::from_tryte_string(&tx2.signature_fragments);\\n\\n //println!(\\\"{}\\\", msg);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn bench_create_1000_compressions() {\\n\\n /*\\n\\n let start = Instant::now();\\n\\n for i in 0..1000 {\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 77,\n \"score\": 4.794858244850361\n },\n {\n \"content\": \"use rand::distributions::Alphanumeric;\\n\\nuse rand::{thread_rng, Rng};\\n\\n\\n\\nuse std::iter;\\n\\nuse std::net::UdpSocket;\\n\\nuse std::thread;\\n\\nuse std::time::{Duration, Instant};\\n\\n\\n\\nuse crate::algos::CompressionAlgo;\\n\\nuse crate::constants::MIN_MESSAGE_LENGTH;\\n\\nuse crate::model::transaction::*;\\n\\n\\n\\n// MODIFY THIS VALUE TO CHANGE PAUSE BETWEEN SENDS\\n\\nconst SLEEP_MS: u64 = 3000;\\n\\n\\n\",\n \"file_path\": \"src/sender.rs\",\n \"rank\": 78,\n \"score\": 4.658792731224414\n },\n {\n \"content\": \"}\\n\\n*/\\n\\n\\n\\n// NOTE: Only the first 33 trits (11 trytes) of the 27 trytes available are needed to represent the current\\n\\n// supply of IOTA tokens ((3^33-1)/2),\\n\\n//\\n\\n// This LUT is used to quickly convert from utf8 encoded tryte strings (9ABCDEFGHIJKLMNOPQRSTUVWXYZ)\\n\\n// to signed integers. For example let's say we have the tryte string AAAA99999999999999999999999 and\\n\\n// we want to decode it into a signed integer:\\n\\n// 'A' -> 65 -> (1 at index 0, 27 at index 1, 729 at index 2, ...).\\n\\n// With a total supply of (3^33-1)/2 this requires 11 trytes to represent any such positive or negative\\n\\n// number.\\n\\n// NOTE: Rust fmt is messing up this table down below\\n\\n#[allow(clippy::unreadable_literal)]\\n\\npub(crate) const TRYTE_AS_UTF8_TO_I64: [[i64; 91]; 11] = [\\n\\n [\\n\\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\n 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, -13, -12, -11, -10, -9, -8, -7,\\n\\n -6, -5, -4, -3, -2, -1,\\n\",\n \"file_path\": \"src/convert/luts.rs\",\n \"rank\": 79,\n \"score\": 4.226487363467786\n },\n {\n \"content\": \" nonce,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn as_bytes(&self) -> TxBytes {\\n\\n bytes::from_tx_trytes_2enc9(&self.as_trytes())\\n\\n }\\n\\n\\n\\n pub fn as_tryte_string(&self) -> String {\\n\\n tryte_string::from_trytes(&self.as_trytes())\\n\\n }\\n\\n\\n\\n pub fn as_trits(&self) -> TxTrits {\\n\\n trits::from_tx_trytes(&self.as_trytes())\\n\\n }\\n\\n\\n\\n pub fn as_trytes(&self) -> TxTrytes {\\n\\n let mut trytes = [0; TRANSACTION_SIZE_TRYTES];\\n\\n\\n\\n trytes[SIGNATURE_FRAGMENTS.2..EXTRA_DATA_DIGEST.2].copy_from_slice(\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 80,\n \"score\": 4.207072807208324\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn get_example_trytes() -> String {\\n\\n let sig_msg_frag = MAINNET_TRYTES.get(0..2187).unwrap();\\n\\n let extra_data_digest = MAINNET_TRYTES.get((2187 + 162)..(2187 + 162 + 81)).unwrap(); //copied bundle hash\\n\\n let addr_value_tag_timestamps = MAINNET_TRYTES.get(2187..(2187 + 162)).unwrap();\\n\\n let rest = MAINNET_TRYTES.get((2187 + 162 + 81)..).unwrap();\\n\\n\\n\\n format!(\\n\\n \\\"{}{}{}{}\\\",\\n\\n sig_msg_frag, extra_data_digest, addr_value_tag_timestamps, rest\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 81,\n \"score\": 4.126486634806776\n },\n {\n \"content\": \"\\n\\n format!(\\n\\n \\\"{}{}{}{}\\\",\\n\\n sig_msg_frag, extra_data_digest, addr_value_tag_timestamps, rest\\n\\n )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn lz4_compression_works() {\\n\\n let lz4 = Lz4::new(0);\\n\\n //let tx = TransactionBuilder::default().message(\\\"Hello\\\").build();\\n\\n let tx = Transaction::from_tryte_string(&get_example_trytes());\\n\\n let bytes = tx.as_bytes();\\n\\n\\n\\n let compressed = lz4\\n\\n .compress(&bytes)\\n\\n .expect(\\\"error compressing transaction bytes\\\");\\n\\n\\n\\n let decompressed = lz4\\n\\n .decompress(&compressed)\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 82,\n \"score\": 3.9686023900514886\n },\n {\n \"content\": \"# About\\n\\nThis tool creates IOTA transactions as specified by the Ict protocol, compresses them using one of several available compression algorithms, e.g. [lz4](https://en.wikipedia.org/wiki/LZ4_(compression_algorithm)) and then sends them via UDP to a receiving endpoint which then decompresses and deserializes them. Both endpoints measure timings for each compression/decompression and print that information to the terminal.\\n\\n\\n\\n# How to build it\\n\\n1. If you haven't already install Rust using `rustup`, Rust's toolchain manager. You can download it [here](https://www.rust-lang.org/tools/install).\\n\\n2. Clone this repository, cd into it, and build the project using `cargo build --release`.\\n\\n\\n\\n# How to run it\\n\\nOpen two terminals and change into the *release* directory respectively. Currently the following compression algorithms are supported:\\n\\n* LZ4 (fast standard compression algorithm)\\n\\n* TrimFrag (right-trims zero bytes of the signature message fragment)\\n\\n* TrimAll (right-trims zero bytes of each transaction field)\\n\\n\\n\\nRunning two endpoints sending lz4 compressed IOTA transactions can be as simple as typing: \\n\\n```Bash\\n\\n./itxc recv lz4 \\n\\n```\\n\\nin one terminal, and \\n\\n```Bash\\n\\n./itxc send lz4\\n\\n```\\n\\nin the other terminal. You can however, customize your test by adjusting the ports, changing the compression level for lz4, and choose a different payload size. If you want to see all options of a subcommand simply type:\\n\\n```Bash\\n\\n./itxc [SUBCOMMAND] --help\\n\\n```\\n\\n\\n\\n# Contact \\n\\nFeel free to contact me on the IOTA Discord server. My handle is /alex/#6323. Have fun :)\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 83,\n \"score\": 3.6381492389716725\n },\n {\n \"content\": \"use crate::algos::*;\\n\\nuse crate::constants::*;\\n\\nuse crate::convert::ascii;\\n\\nuse crate::model::transaction::*;\\n\\n\\n\\nuse std::net::UdpSocket;\\n\\nuse std::time::Instant;\\n\\n\\n\",\n \"file_path\": \"src/receiver.rs\",\n \"rank\": 84,\n \"score\": 3.4340686420441404\n },\n {\n \"content\": \" ATTACHMENT_TIMESTAMP_LOWER_BOUND.5,\\n\\n ),\\n\\n (NONCE.4 - 1, ATTACHMENT_TIMESTAMP_UPPER_BOUND.5),\\n\\n (TRANSACTION_SIZE_BYTES - 1, NONCE.5),\\n\\n ];\\n\\n\\n\\n Self { offsets }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl CompressionAlgo for TrimAll {\\n\\n fn compress(&self, bytes: &[u8]) -> Result<Vec<u8>, Box<Error>> {\\n\\n let mut kept_bytes_list = Vec::with_capacity(self.offsets.len());\\n\\n let mut kept_bytes = 0;\\n\\n\\n\\n for (last, length) in &self.offsets {\\n\\n let (last, length) = (*last, *length);\\n\\n\\n\\n let mut is_empty_field = true;\\n\\n\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 85,\n \"score\": 3.43173732975282\n },\n {\n \"content\": \"use std::error::Error;\\n\\nuse std::io::{Cursor, Read, Write};\\n\\n\\n\\nuse lz4::{Decoder, Encoder, EncoderBuilder};\\n\\n\\n\\nuse crate::constants::*;\\n\\n\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 86,\n \"score\": 3.2720376944846143\n },\n {\n \"content\": \" let trytes = from_tryte_string_to_fragment_trytes(\\\"ABC\\\");\\n\\n\\n\\n assert_eq!(2187, trytes.len());\\n\\n assert_eq!(65, trytes[0]);\\n\\n assert_eq!(66, trytes[1]);\\n\\n assert_eq!(67, trytes[2]);\\n\\n assert!(trytes.iter().skip(3).any(|t| *t == 57));\\n\\n }\\n\\n\\n\\n const MAINNET_TRYTES: &str = \\\"SEGQSWYCJHRLJYEGZLRYQAZPLVRAYIWGWJUMFFX99UZUKBQNFYAOQLOFARIKNEBKDRHJJWDJARXTNPHPAODJRSGJBVVYBVJHZALJWDCJHZRSACOVCVVAVHZVTPFTAJWVGFSVLSYXHNNXEGSMJHDBZKGFQNYJJJBAPDHFFGZ9POSOMWTDPGXI9KQRLMUVWNEQDANMXROVORJVALWVGDDJAFOOBXUKVCCIVXSSHZUCZV9XVBASLWX9NXPWGMGYCRD9ILQMKIGPBGGMKAIJKNALBLABATYFVIRBKTXTWNUZAUXRASB9EEIQHWBD9ZYUDBUPBSWXVYXQXECRCHQAYH9ZBUZBASPOIGBSGWJYFKFRITUBVMCYGCMAPTXOIWEVTUXSUOUPTUQOPMMPUTHXMOP9CW9THAZXEPMOMNEOBLUBPOAIOBEBERRZCIKHSTDWUSUPUWNJOCLNZDCEKWWAAJDPJXJEHHSYFN9MH9BGUDQ9CSZBIHRC9PSQJPGKH9ILZDWUWLEKWFKUFFFIMOQKRMKOYXEJHXLCEGCGGKHGJUHOXINSWCKRNMUNAJDCVLZGEBII9ASTYFTDYDZIZSNHIWHSQ9HODQMVNDKMKHCFDXIIGDIVJSBOOE9GRIXCD9ZUTWCUDKFTETSYSRBQABXCXZFOWQMQFXHYZWD9JZXUWHILMRNWXSGUMIIXZYCTWWHCWMSSTCNSQXQXMQPTM9MOQMIVDYNNARDCVNQEDTBKWOIOSKPKPOZHJGJJGNYWQWUWAZMBZJ9XEJMRVRYFQPJ9NOIIXEGIKMMN9DXYQUILRSCSJDIDN9DCTFGQIYWROZQIEQTKMRVLGGDGA9UVZPNRGSVTZYAPMWFUWDEUULSEEGAGITPJQ9DBEYEN9NVJPUWZTOTJHEQIXAPDOICBNNCJVDNM9YRNXMMPCOYHJDUFNCYTZGRCBZKOLHHUK9VOZWHEYQND9WUHDNGFTAS99MRCAU9QOYVUZKTIBDNAAPNEZBQPIRUFUMAWVTCXSXQQIYQPRFDUXCLJNMEIKVAINVCCZROEWEX9XVRM9IHLHQCKC9VLK9ZZWFBJUZKGJCSOPQPFVVAUDLKFJIJKMLZXFBMXLMWRSNDXRMMDLE9VBPUZB9SVLTMHA9DDDANOKIPY9ULDWAKOUDFEDHZDKMU9VMHUSFG9HRGZAZULEJJTEH9SLQDOMZTLVMBCXVNQPNKXRLBOUCCSBZRJCZIUFTFBKFVLKRBPDKLRLZSMMIQNMOZYFBGQFKUJYIJULGMVNFYJWPKPTSMYUHSUEXIPPPPPJTMDQLFFSFJFEPNUBDEDDBPGAOEJGQTHIWISLRDAABO9H9CSIAXPPJYCRFRCIH9TVBZKTCK9SPQZUYMUOKMZYOMPRHRGF9UAKZTZZG9VVVTIHMSNDREUOUOSLKUHTNFXTNSJVPVWCQXUDIMJIAMBPXUGBNDTBYPKYQYJJCDJSCTTWHOJKORLHGKRJMDCMRHSXHHMQBFJWZWHNUHZLYOAFQTRZFXDBYASYKWEVHKYDTJIAUKNCCEPSW9RITZXBOFKBAQOWHKTALQSCHARLUUGXISDMBVEUKOVXTKTEVKLGYVYHPNYWKNLCVETWIHHVTBWT9UPMTQWBZPRPRSISUBIBECVDNIZQULAGLONGVFLVZPBMHJND9CEVIXSYGFZAGGN9MQYOAKMENSEOGCUNKEJTDLEDCD9LGKYANHMZFSSDDZJKTKUJSFL9GYFDICTPJEPDSBXDQTARJQEWUVWDWSQPKIHPJONKHESSQH9FNQEO9WUCFDWPPPTIQPWCVDYTTWPLCJJVYNKE9ZEJNQBEJBMDBLNJKQDOQOHVS9VY9UPSU9KZVDFOESHNRRWBK9EZCYALAUYFGPCEWJQDXFENSNQEAUWDXJGOMCLQUQWMCPHOBZZ9SZJ9KZXSHDLPHPNYMVUJQSQETTN9SG9SIANJHWUYQXZXAJLYHCZYRGITZYQLAAYDVQVNKCDIYWAYBAFBMAYEAEAGMTJGJRSNHBHCEVIQRXEFVWJWOPU9FPDOWIFL9EWGHICRBNRITJDZNYACOGTUDBZYIYZZWAOCDBQFFNTTSTGKECWTVWZSPHX9HNRUYEAEWXENEIDLVVFMZFVPUNHMQPAIOKVIBDIHQIHFGRJOHHONPLGBSJUD9HHDTQQUZN9NVJYOAUMXMMOCNUFLZ9BAJSZMDMPQHPWSFVWOJQDPHV9DYSQPIBL9LYZHQKKOVF9TFVTTXQEUWFQSLGLVTGK99VSUEDXIBIWCQHDQQSQLDHZ9999999999999999999TRINITY99999999999999999999TNXSQ9D99A99999999B99999999MXKZAGDGKVADXOVCAXEQYZGOGQKDLKIUPYXIL9PXYBQXGYDEGNXTFURSWQYLJDFKEV9VVBBQLTLHIBTFYOGBHPUUHS9CKWSAPIMDIRNSUJ9CFPGKTUFAGQYVMFKOZSVAHIFJXWCFBZLICUWF9GNDZWCOWDUIIZ9999OXNRVXLBKJXEZMVABR9UQBVSTBDFSAJVRRNFEJRL9UFTOFPJHQMQKAJHDBIQAETS9OUVTQ9DSPAOZ9999TRINITY99999999999999999999LPZYMWQME999999999MMMMMMMMMDTIZE9999999999999999999999\\\";\\n\\n fn get_example_tx_tryte_string() -> String {\\n\\n let sig_msg_frag = MAINNET_TRYTES.get(0..2187).unwrap();\\n\\n let extra_data_digest = MAINNET_TRYTES.get((2187 + 162)..(2187 + 162 + 81)).unwrap(); //copied bundle hash\\n\\n let addr_value_tag_timestamps = MAINNET_TRYTES.get(2187..(2187 + 162)).unwrap();\\n\\n let rest = MAINNET_TRYTES.get((2187 + 162 + 81)..).unwrap();\\n\\n\\n\\n format!(\\n\\n \\\"{}{}{}{}\\\",\\n\\n sig_msg_frag, extra_data_digest, addr_value_tag_timestamps, rest\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/convert/trytes.rs\",\n \"rank\": 87,\n \"score\": 3.2525213404689204\n },\n {\n \"content\": \" #[test]\\n\\n fn test_pad_unpad_right() {\\n\\n assert_eq!(\\\"HELLO9WORLD\\\", unpad_right(&pad_right(\\\"HELLO9WORLD\\\", 100)));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_from_trits() {\\n\\n let tryte = from_trits(&[1, 1, 1]);\\n\\n\\n\\n assert_eq!(tryte, \\\"M\\\".to_string());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/convert/tryte_string.rs\",\n \"rank\": 88,\n \"score\": 3.1905600147868745\n },\n {\n \"content\": \" ($func:ident, $length:expr) => {\\n\\n pub fn $func(bytes: &[u8]) -> [Tryte; $length] {\\n\\n let mut trytes = [TRYTE_TO_ASCII[0]; $length];\\n\\n\\n\\n for i in 0..($length / 3) {\\n\\n let b0 = bytes[2 * i] as usize;\\n\\n let b1 = bytes[2 * i + 1] as usize;\\n\\n\\n\\n trytes[3 * i] = TRYTE_TO_ASCII[b0 / 8];\\n\\n trytes[3 * i + 1] = TRYTE_TO_ASCII[b1 / 8];\\n\\n trytes[3 * i + 2] = TRYTE_TO_ASCII[b0 % 8 + 8 * (b1 % 8)];\\n\\n }\\n\\n trytes\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nfrom_bytes_2enc9_fixed_size!(from_54_bytes_2enc9, 81);\\n\\nfrom_bytes_2enc9_fixed_size!(from_18_bytes_2enc9, 27);\\n\\nfrom_bytes_2enc9_fixed_size!(from_tx_bytes_2enc9, TRANSACTION_SIZE_TRYTES);\\n\\n\\n\",\n \"file_path\": \"src/convert/trytes.rs\",\n \"rank\": 89,\n \"score\": 3.1783530923538375\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_encode_decode_ascii() {\\n\\n assert_eq!(\\n\\n \\\"Hello\\\",\\n\\n from_tryte_string(&tryte_string::from_ascii(\\\"Hello\\\"))\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/convert/ascii.rs\",\n \"rank\": 90,\n \"score\": 2.9157925143611605\n },\n {\n \"content\": \"\\n\\n assert_eq!(0, trytes.len());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_from_tryte_string_to_fragment_trytes_with_empty_str() {\\n\\n /*\\n\\n println!(\\n\\n \\\"{}\\\",\\n\\n tryte_string::from_trytes(&from_tryte_string_to_fragment_trytes(\\\"\\\"))\\n\\n );\\n\\n */\\n\\n let trytes = from_tryte_string_to_fragment_trytes(\\\"\\\");\\n\\n\\n\\n assert_eq!(2187, trytes.len());\\n\\n assert!(trytes.iter().any(|t| *t == 57));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_from_tryte_string_to_fragment_trytes() {\\n\",\n \"file_path\": \"src/convert/trytes.rs\",\n \"rank\": 91,\n \"score\": 2.8793338671577544\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_pad_right() {\\n\\n let text = \\\"HELLO9WORLD\\\";\\n\\n let padded30 = pad_right(&text, 30);\\n\\n assert_eq!(\\\"HELLO9WORLD9999999999999999999\\\", padded30);\\n\\n\\n\\n let padded3 = pad_right(&text, 3);\\n\\n assert_eq!(\\\"HELLO9WORLD\\\", padded3);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_unpad_right() {\\n\\n let text = \\\"HELLO9WORLD99999999999999999999\\\";\\n\\n assert_eq!(\\\"HELLO9WORLD\\\", unpad_right(text));\\n\\n\\n\\n let nines = \\\"99999999\\\";\\n\\n assert_eq!(\\\"\\\", unpad_right(nines));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/convert/tryte_string.rs\",\n \"rank\": 92,\n \"score\": 2.8423657058863245\n },\n {\n \"content\": \" println!(\\\"{:?}\\\", trits);\\n\\n assert_eq!(33, trits.len());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_trits_from_trytes() {\\n\\n let trytes = \\\"HELLO9WORLD\\\";\\n\\n //let trits = trits_from_trytes(trytes);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/convert/trits.rs\",\n \"rank\": 93,\n \"score\": 2.840957101622336\n },\n {\n \"content\": \" } else {\\n\\n ETYRT_TO_ASCII[remainder as usize]\\n\\n };\\n\\n\\n\\n if number == 0 {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n trytes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/convert/trytes.rs\",\n \"rank\": 94,\n \"score\": 2.768141014336551\n },\n {\n \"content\": \" trytes\\n\\n }\\n\\n\\n\\n /*\\n\\n pub fn get_hash(&self) -> Trytes81 {\\n\\n trytes::from_trits_fixed81(&curl::curl_tx(\\n\\n self.as_trits(),\\n\\n CURL_ROUNDS_TRANSACTION_HASH,\\n\\n ))\\n\\n }\\n\\n */\\n\\n\\n\\n pub fn message(mut self, message: &str) -> Self {\\n\\n assert!(message.len() <= SIGNATURE_FRAGMENTS.3);\\n\\n\\n\\n self.signature_fragments =\\n\\n tryte_string::pad_right(&tryte_string::from_ascii(message), SIGNATURE_FRAGMENTS.3);\\n\\n self\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/model/transaction.rs\",\n \"rank\": 96,\n \"score\": 2.1757324725451106\n },\n {\n \"content\": \" for i in 0..length {\\n\\n if bytes[last - i] != 0 {\\n\\n kept_bytes_list.push((last + 1 - length, length - i));\\n\\n kept_bytes += length - i + 1; // +1 for the delimiter byte\\n\\n is_empty_field = false;\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n if is_empty_field {\\n\\n kept_bytes_list.push((last + 1 - length, 0));\\n\\n kept_bytes += 1;\\n\\n }\\n\\n }\\n\\n\\n\\n let mut compressed = vec![0; kept_bytes];\\n\\n\\n\\n let mut start = 0;\\n\\n for (offset, length) in kept_bytes_list {\\n\\n compressed[start..start + length].copy_from_slice(&bytes[offset..offset + length]);\\n\",\n \"file_path\": \"src/algos.rs\",\n \"rank\": 97,\n \"score\": 2.0904095256964186\n },\n {\n \"content\": \"use std::time::{SystemTime, UNIX_EPOCH};\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! sleep {\\n\\n ($ms:expr) => {\\n\\n thread::sleep(Duration::from_millis($ms));\\n\\n };\\n\\n}\\n\\n\\n\\n// NOTE: this should be u64\\n\",\n \"file_path\": \"src/time.rs\",\n \"rank\": 98,\n \"score\": 1.9686339205311234\n },\n {\n \"content\": \" algo: Algo,\\n\\n },\\n\\n\\n\\n #[structopt(\\n\\n name = \\\"recv\\\",\\n\\n about = \\\"Receive IOTA transactions from a sender endpoint.\\\"\\n\\n )]\\n\\n Recv {\\n\\n /// Receiving port.\\n\\n #[structopt(short, default_value = \\\"1338\\\")]\\n\\n recv_port: u16,\\n\\n\\n\\n #[structopt(subcommand)]\\n\\n algo: Algo,\\n\\n },\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 99,\n \"score\": 1.876083434274153\n }\n]","isConversational":false}}},{"rowIdx":3684,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"relm-examples/tests/references2.rs"},"repo_name":{"kind":"string","value":"RadicalZephyr/relm"},"commit":{"kind":"string","value":"925a738fb8299bd1497adaf0752919475cf9bc92"},"file_code":{"kind":"string","value":"/*\n * Copyright (c) 2020 Boucher, Antoni <bouanto@zoho.com>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\n\nuse std::cell::Cell;\n\nuse gtk::{prelude::BoxExt, prelude::ButtonExt, prelude::ContainerExt, prelude::WidgetExt};\nuse relm::{ContainerWidget, Widget, connect};\nuse relm_derive::Msg;\n\nthread_local! {\n static DROP_COUNT: Cell<i32> = Cell::new(0);\n}\n\nmacro_rules! assert_drop_count {\n ($value:expr) => {\n assert_eq!(DROP_COUNT.with(|drop_count| drop_count.get()), $value);\n };\n}\n\n#[derive(Msg)]\npub enum Msg {\n Quit,\n Add,\n Remove,\n}\n\npub struct RelmWidget {\n root: gtk::Window,\n vbox: gtk::Box,\n label: Option<relm::Component<LabelWidget>>,\n}\n\nimpl Widget for RelmWidget {\n type Root = gtk::Window;\n\n fn root(&self) -> Self::Root {\n self.root.clone()\n }\n\n fn view(relm: &relm::Relm<Self>, _model: Self::Model) -> Self {\n let root = gtk::Window::new(gtk::WindowType::Toplevel);\n root.set_size_request(400, 400);\n connect!(\n relm,\n root,\n connect_delete_event(_, _),\n return (Some(Msg::Quit), gtk::Inhibit(false))\n );\n\n let vbox = gtk::Box::new(gtk::Orientation::Vertical, 0);\n root.add(&vbox);\n\n let add_button = gtk::builders::ButtonBuilder::new().label(\"Add\").build();\n add_button.set_widget_name(\"add_button\");\n connect!(relm, add_button, connect_clicked(_), Msg::Add);\n vbox.pack_start(&add_button, false, false, 0);\n\n let remove_button = gtk::builders::ButtonBuilder::new().label(\"Remove\").build();\n remove_button.set_widget_name(\"remove_button\");\n connect!(relm, remove_button, connect_clicked(_), Msg::Remove);\n vbox.pack_start(&remove_button, false, false, 0);\n\n root.show_all();\n RelmWidget {\n root,\n vbox,\n label: None,\n }\n }\n}\n\nimpl relm::Update for RelmWidget {\n type Model = ();\n type ModelParam = ();\n type Msg = Msg;\n\n fn model(_relm: &relm::Relm<Self>, _param: ()) -> Self::Model {\n ()\n }\n\n fn update(&mut self, e: Msg) {\n match e {\n Msg::Quit => gtk::main_quit(),\n Msg::Add => {\n let vbox = self.vbox.clone();\n self.label.get_or_insert_with(|| {\n vbox.add_widget::<LabelWidget>(())\n });\n vbox.show_all();\n }\n Msg::Remove => {\n let vbox = self.vbox.clone();\n if let Some(label) = self.label.take() {\n vbox.remove_widget(label);\n }\n }\n }\n }\n}\n\npub struct Item {\n}\n\nimpl Drop for Item {\n fn drop(&mut self) {\n DROP_COUNT.with(|drop_count|\n drop_count.set(drop_count.get() + 1)\n );\n }\n}\n\npub struct LabelWidget {\n pub root: gtk::Label,\n pub item: Item,\n}\n\nimpl relm::Widget for LabelWidget {\n type Root = gtk::Label;\n\n fn root(&self) -> Self::Root {\n self.root.clone()\n }\n\n fn view(_relm: &relm::Relm<Self>, _model: Self::Model) -> Self {\n let root = gtk::builders::LabelBuilder::new().label(\"hello\").build();\n LabelWidget {\n root,\n item: Item {},\n }\n }\n}\n\nimpl relm::Update for LabelWidget {\n type Model = ();\n type ModelParam = ();\n type Msg = ();\n\n fn model(_relm: &relm::Relm<Self>, _param: ()) -> Self::Model {\n }\n\n fn update(&mut self, _e: ()) {\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::{RelmWidget, DROP_COUNT};\n\n use gtk_test::{click, find_widget_by_name};\n\n #[test]\n fn label_change() {\n gtk::init().expect(\"gtk init\");\n let component = relm::create_component::<RelmWidget>(());\n let root = component.widget();\n let add_button = find_widget_by_name(root, \"add_button\").expect(\"find button\");\n let remove_button = find_widget_by_name(root, \"remove_button\").expect(\"find button\");\n assert_drop_count!(0);\n\n click(&add_button);\n click(&remove_button);\n assert_drop_count!(1);\n\n click(&add_button);\n click(&remove_button);\n assert_drop_count!(2);\n }\n}\n"},"prefix":{"kind":"string","value":"/*\n * Copyright (c) 2020 Boucher, Antoni <bouanto@zoho.com>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\n\nuse std::cell::Cell;\n\nuse gtk::{prelude::BoxExt, prelude::ButtonExt, prelude::ContainerExt, prelude::WidgetExt};\nuse relm::{ContainerWidget, Widget, connect};\nuse relm_derive::Msg;\n\nthread_local! {\n static DROP_COUNT: Cell<i32> = Cell::new(0);\n}\n\nmacro_rules! assert_drop_count {\n ($value:expr) => {\n assert_eq!(DROP_COUNT.with(|drop_count| drop_count.get()), $value);\n };\n}\n\n#[derive(Msg)]\npub enum Msg {\n Quit,\n Add,\n Remove,\n}\n\npub struct RelmWidget {\n root: gtk::Window,\n vbox: gtk::Box,\n label: Option<relm::Component<LabelWidget>>,\n}\n\nimpl Widget for RelmWidget {\n type Root = gtk::Window;\n\n fn root(&self) -> Self::Root {\n self.root.clone()\n }\n\n"},"suffix":{"kind":"string","value":"ilder::new().label(\"Remove\").build();\n remove_button.set_widget_name(\"remove_button\");\n connect!(relm, remove_button, connect_clicked(_), Msg::Remove);\n vbox.pack_start(&remove_button, false, false, 0);\n\n root.show_all();\n RelmWidget {\n root,\n vbox,\n label: None,\n }\n }\n}\n\nimpl relm::Update for RelmWidget {\n type Model = ();\n type ModelParam = ();\n type Msg = Msg;\n\n fn model(_relm: &relm::Relm<Self>, _param: ()) -> Self::Model {\n ()\n }\n\n fn update(&mut self, e: Msg) {\n match e {\n Msg::Quit => gtk::main_quit(),\n Msg::Add => {\n let vbox = self.vbox.clone();\n self.label.get_or_insert_with(|| {\n vbox.add_widget::<LabelWidget>(())\n });\n vbox.show_all();\n }\n Msg::Remove => {\n let vbox = self.vbox.clone();\n if let Some(label) = self.label.take() {\n vbox.remove_widget(label);\n }\n }\n }\n }\n}\n\npub struct Item {\n}\n\nimpl Drop for Item {\n fn drop(&mut self) {\n DROP_COUNT.with(|drop_count|\n drop_count.set(drop_count.get() + 1)\n );\n }\n}\n\npub struct LabelWidget {\n pub root: gtk::Label,\n pub item: Item,\n}\n\nimpl relm::Widget for LabelWidget {\n type Root = gtk::Label;\n\n fn root(&self) -> Self::Root {\n self.root.clone()\n }\n\n fn view(_relm: &relm::Relm<Self>, _model: Self::Model) -> Self {\n let root = gtk::builders::LabelBuilder::new().label(\"hello\").build();\n LabelWidget {\n root,\n item: Item {},\n }\n }\n}\n\nimpl relm::Update for LabelWidget {\n type Model = ();\n type ModelParam = ();\n type Msg = ();\n\n fn model(_relm: &relm::Relm<Self>, _param: ()) -> Self::Model {\n }\n\n fn update(&mut self, _e: ()) {\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::{RelmWidget, DROP_COUNT};\n\n use gtk_test::{click, find_widget_by_name};\n\n #[test]\n fn label_change() {\n gtk::init().expect(\"gtk init\");\n let component = relm::create_component::<RelmWidget>(());\n let root = component.widget();\n let add_button = find_widget_by_name(root, \"add_button\").expect(\"find button\");\n let remove_button = find_widget_by_name(root, \"remove_button\").expect(\"find button\");\n assert_drop_count!(0);\n\n click(&add_button);\n click(&remove_button);\n assert_drop_count!(1);\n\n click(&add_button);\n click(&remove_button);\n assert_drop_count!(2);\n }\n}\n"},"middle":{"kind":"string","value":" fn view(relm: &relm::Relm<Self>, _model: Self::Model) -> Self {\n let root = gtk::Window::new(gtk::WindowType::Toplevel);\n root.set_size_request(400, 400);\n connect!(\n relm,\n root,\n connect_delete_event(_, _),\n return (Some(Msg::Quit), gtk::Inhibit(false))\n );\n\n let vbox = gtk::Box::new(gtk::Orientation::Vertical, 0);\n root.add(&vbox);\n\n let add_button = gtk::builders::ButtonBuilder::new().label(\"Add\").build();\n add_button.set_widget_name(\"add_button\");\n connect!(relm, add_button, connect_clicked(_), Msg::Add);\n vbox.pack_start(&add_button, false, false, 0);\n\n let remove_button = gtk::builders::ButtonBu"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// After `duration` ms, emit `msg`.\n\npub fn timeout<F: Fn() -> MSG + 'static, MSG: 'static>(stream: &StreamHandle<MSG>, duration: u32, constructor: F) {\n\n let stream = stream.clone();\n\n glib::timeout_add_local(std::time::Duration::from_millis(duration as u64), move || {\n\n let msg = constructor();\n\n stream.emit(msg);\n\n Continue(false)\n\n });\n\n}\n","file_path":"src/lib.rs","rank":0,"score":279921.1796681675},{"content":"/// Emit the `msg` every `duration` ms.\n\npub fn interval<F: Fn() -> MSG + 'static, MSG: 'static>(stream: &StreamHandle<MSG>, duration: u32, constructor: F) {\n\n let stream = stream.clone();\n\n glib::timeout_add_local(std::time::Duration::from_millis(duration as u64), move || {\n\n let msg = constructor();\n\n stream.emit(msg);\n\n Continue(true)\n\n });\n\n}\n\n\n","file_path":"src/lib.rs","rank":1,"score":279921.14299104526},{"content":"/// Initialize a widget for a test.\n\n///\n\n/// It is to be used this way:\n\n///\n\n/// ```\n\n/// # use gtk::{Window, WindowType};\n\n/// # use relm::{Relm, Update, Widget, WidgetTest};\n\n/// # use relm_derive::Msg;\n\n/// #\n\n/// # #[derive(Clone)]\n\n/// # struct Win {\n\n/// # window: Window,\n\n/// # }\n\n/// #\n\n/// # impl Update for Win {\n\n/// # type Model = ();\n\n/// # type ModelParam = ();\n\n/// # type Msg = Msg;\n\n/// #\n\n/// # fn model(_: &Relm<Self>, _: ()) -> () {\n\n/// # ()\n\n/// # }\n\n/// #\n\n/// # fn update(&mut self, event: Msg) {\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # impl WidgetTest for Win {\n\n/// # type Widgets = Win;\n\n/// #\n\n/// # fn get_widgets(&self) -> Self::Widgets {\n\n/// # self.clone()\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # impl Widget for Win {\n\n/// # type Root = Window;\n\n/// #\n\n/// # fn root(&self) -> Self::Root {\n\n/// # self.window.clone()\n\n/// # }\n\n/// #\n\n/// # fn view(relm: &Relm<Self>, _model: Self::Model) -> Self {\n\n/// # let window = Window::new(WindowType::Toplevel);\n\n/// #\n\n/// # Win {\n\n/// # window: window,\n\n/// # }\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # #[derive(Msg)]\n\n/// # enum Msg {}\n\n/// # fn main() {\n\n/// let (component, _, widgets) = relm::init_test::<Win>(()).expect(\"init_test failed\");\n\n/// # }\n\n/// ```\n\npub fn init_test<WIDGET>(model_param: WIDGET::ModelParam) ->\n\n Result<InitTestComponents<WIDGET>, glib::BoolError>\n\n where WIDGET: Widget + WidgetTest + 'static,\n\n WIDGET::Msg: DisplayVariant + 'static,\n\n{\n\n gtk::init()?;\n\n let main_context = glib::MainContext::default();\n\n let _context = main_context.acquire()?;\n\n let component = create_widget_test::<WIDGET>(model_param);\n\n Ok(component)\n\n}\n\n\n","file_path":"src/lib.rs","rank":2,"score":214226.83642761922},{"content":"/// Create a bare component, i.e. a component only implementing the Update trait, not the Widget\n\n/// trait.\n\npub fn execute<UPDATE>(model_param: UPDATE::ModelParam) -> EventStream<UPDATE::Msg>\n\nwhere UPDATE: Update + UpdateNew + 'static\n\n{\n\n let stream = EventStream::new();\n\n\n\n let relm = Relm::new(&stream);\n\n let model = UPDATE::model(&relm, model_param);\n\n let component = UPDATE::new(&relm, model);\n\n\n\n init_component::<UPDATE>(&stream, component, &relm);\n\n stream\n\n}\n\n\n","file_path":"src/state/mod.rs","rank":3,"score":210820.91864463242},{"content":"fn gen_container_impl(generator: &Generator, widget: &Widget, generic_types: &Generics) -> TokenStream {\n\n let where_clause = gen_where_clause(generic_types);\n\n let widget_type = gen_widget_type(widget);\n\n if generator.container_names.is_empty() {\n\n quote! {\n\n }\n\n }\n\n else if !generator.container_names.contains_key(&None) {\n\n panic!(\"Use of #[container=\\\"name\\\"] attribute without the default #[container].\");\n\n }\n\n else {\n\n let mut container_type = None;\n\n for (ident, &(_, ref typ)) in &generator.container_names {\n\n if ident.is_none() {\n\n container_type = Some(typ);\n\n }\n\n }\n\n let typ = container_type.expect(\"container type\");\n\n let &(ref name, _) = generator.container_names.get(&None).expect(\"default container\");\n\n let add_widget_method = gen_add_widget_method(&generator.container_names);\n","file_path":"relm-derive/src/gen/generator.rs","rank":4,"score":206000.24064687188},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/tests/generic-widget.rs","rank":5,"score":204775.38369985786},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/tests/multiple-widgets.rs","rank":6,"score":204775.38369985786},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/tests/multi-generic-widget.rs","rank":7,"score":201862.66217152015},{"content":"/// Initialize a widget.\n\npub fn init<WIDGET>(model_param: WIDGET::ModelParam) -> Result<Component<WIDGET>, glib::BoolError>\n\n where WIDGET: Widget + 'static,\n\n WIDGET::Msg: DisplayVariant + 'static\n\n{\n\n let (component, widget, relm) = create_widget::<WIDGET>(model_param);\n\n init_component::<WIDGET>(component.owned_stream(), widget, &relm);\n\n Ok(component)\n\n}\n\n\n","file_path":"src/lib.rs","rank":8,"score":198129.28607062175},{"content":"struct _EventStream<MSG> {\n\n events: VecDeque<MSG>,\n\n locked: bool,\n\n // We use an Rc here to be able to clone the function to call it so that we don't borrow the\n\n // stream while calling the function. Otherwise, calling an observer could trigger a\n\n // borrow_mut() which would result in a panic.\n\n observers: Vec<Rc<dyn Fn(&MSG)>>,\n\n}\n\n\n\nimpl<MSG> SourceFuncs for SourceData<MSG> {\n\n fn dispatch(&self) -> bool {\n\n let event = self.stream.borrow_mut().events.pop_front();\n\n if let (Some(event), Some(callback)) = (event, self.callback.borrow_mut().as_mut()) {\n\n callback(event);\n\n }\n\n true\n\n }\n\n\n\n fn prepare(&self) -> (bool, Option<u32>) {\n\n (!self.stream.borrow().events.is_empty(), None)\n\n }\n\n\n\n}\n\n\n","file_path":"src/core/mod.rs","rank":9,"score":197640.15488038774},{"content":"fn gen_widget_type(widget: &Widget) -> TokenStream {\n\n match widget.widget {\n\n Gtk(ref gtk_widget) => {\n\n let ident = gtk_widget.relm_name.as_ref().expect(\"as_ref failed\");\n\n quote! {\n\n #ident\n\n }\n\n },\n\n Relm(_) => {\n\n let path = &widget.typ;\n\n quote! {\n\n #path\n\n }\n\n },\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/generator.rs","rank":10,"score":197040.14212620223},{"content":"/// Create the specified relm `Widget` and run the main event loops.\n\n///\n\n/// ```\n\n/// # use gtk::{Window, WindowType};\n\n/// # use relm::{Relm, Update, Widget};\n\n/// # use relm_derive::Msg;\n\n/// #\n\n/// # struct Win {\n\n/// # window: Window,\n\n/// # }\n\n/// #\n\n/// # impl Update for Win {\n\n/// # type Model = ();\n\n/// # type ModelParam = ();\n\n/// # type Msg = Msg;\n\n/// #\n\n/// # fn model(_: &Relm<Self>, _: ()) -> () {\n\n/// # ()\n\n/// # }\n\n/// #\n\n/// # fn update(&mut self, event: Msg) {\n\n/// # }\n\n/// # }\n\n/// #\n\n/// # impl Widget for Win {\n\n/// # type Root = Window;\n\n/// #\n\n/// # fn root(&self) -> Self::Root {\n\n/// # self.window.clone()\n\n/// # }\n\n/// #\n\n/// # fn view(relm: &Relm<Self>, _model: Self::Model) -> Self {\n\n/// # let window = Window::new(WindowType::Toplevel);\n\n/// #\n\n/// # Win {\n\n/// # window: window,\n\n/// # }\n\n/// # }\n\n/// # }\n\n/// # #[derive(Msg)]\n\n/// # enum Msg {}\n\n/// # fn main() {\n\n/// # }\n\n/// #\n\n/// # fn run() {\n\n/// /// `Win` is a relm `Widget`.\n\n/// Win::run(()).expect(\"Win::run failed\");\n\n/// # }\n\n/// ```\n\npub fn run<WIDGET>(model_param: WIDGET::ModelParam) -> Result<(), glib::BoolError>\n\n where WIDGET: Widget + 'static,\n\n{\n\n let main_context = glib::MainContext::default();\n\n let _context = main_context.acquire()?;\n\n gtk::init()?;\n\n let _component = init::<WIDGET>(model_param)?;\n\n gtk::main();\n\n Ok(())\n\n}\n\n\n","file_path":"src/lib.rs","rank":11,"score":196773.48834057053},{"content":"pub fn double_click<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W) {\n\n wait_for_draw(widget, || {\n\n let observer = gtk_observer_new!(widget, connect_button_release_event, |_, _| {\n\n Inhibit(false)\n\n });\n\n let allocation = widget.allocation();\n\n mouse_move(widget, allocation.width() / 2, allocation.height() / 2);\n\n let mut enigo = Enigo::new();\n\n enigo.mouse_click(MouseButton::Left);\n\n observer.wait();\n\n\n\n let observer = gtk_observer_new!(widget, connect_button_release_event, |_, _| {\n\n Inhibit(false)\n\n });\n\n enigo.mouse_click(MouseButton::Left);\n\n observer.wait();\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":12,"score":194335.44724578207},{"content":"fn emit<MSG>(stream: &Rc<RefCell<_EventStream<MSG>>>, msg: MSG) {\n\n if !stream.borrow().locked {\n\n let len = stream.borrow().observers.len();\n\n for i in 0..len {\n\n let observer = stream.borrow().observers[i].clone();\n\n observer(&msg);\n\n }\n\n\n\n stream.borrow_mut().events.push_back(msg);\n\n }\n\n}\n\n\n\n/// A stream of messages to be used for widget/signal communication and inter-widget communication.\n\n/// EventStream cannot be send to another thread. Use a `Channel` `Sender` instead.\n\npub struct EventStream<MSG> {\n\n source: Source,\n\n source_id: Option<SourceId>,\n\n _phantom: PhantomData<*mut MSG>,\n\n}\n\n\n","file_path":"src/core/mod.rs","rank":13,"score":192784.3970550641},{"content":"/// Initialize a component by creating its subscriptions and dispatching the messages from the\n\n/// stream.\n\npub fn init_component<UPDATE>(stream: &EventStream<UPDATE::Msg>, mut component: UPDATE, relm: &Relm<UPDATE>)\n\n where UPDATE: Update + 'static,\n\n UPDATE::Msg: DisplayVariant + 'static,\n\n{\n\n component.subscriptions(relm);\n\n stream.set_callback(move |event| {\n\n update_component(&mut component, event);\n\n });\n\n}\n\n\n","file_path":"src/state/mod.rs","rank":14,"score":192367.2119483123},{"content":"// FIXME: remove when it's in gtk-test.\n\npub fn click<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt + IsA<W>>(widget: &W) {\n\n wait_for_draw(widget, || {\n\n let observer =\n\n if let Ok(tool_button) = widget.clone().dynamic_cast::<ToolButton>() {\n\n gtk_observer_new!(tool_button, connect_clicked, |_|)\n\n }\n\n else {\n\n gtk_observer_new!(widget, connect_button_press_event, |_, _| {\n\n Inhibit(false)\n\n })\n\n };\n\n let allocation = widget.allocation();\n\n mouse_move(widget, allocation.width() / 2, allocation.height() / 2);\n\n let mut enigo = Enigo::new();\n\n enigo.mouse_click(MouseButton::Left);\n\n observer.wait();\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":15,"score":189308.494187937},{"content":"fn get_msg_model_map(widget: &Widget, map: &mut MsgModelMap) {\n\n match widget.widget {\n\n Gtk(_) => (),\n\n Relm(ref relm_widget) => {\n\n for (name, expr) in &relm_widget.messages {\n\n let mut visitor = ModelVariableVisitor::new();\n\n visitor.visit_expr(&expr);\n\n let model_variables = visitor.idents;\n\n for var in model_variables {\n\n let set = map.entry(var).or_insert_with(HashSet::new);\n\n set.insert(Message {\n\n expr: expr.clone(),\n\n name: name.clone(),\n\n widget_name: widget.name.clone(),\n\n });\n\n }\n\n }\n\n },\n\n }\n\n}\n\n\n\n/*\n\n * The map maps model variable name to a vector of tuples (widget name, property name).\n\n */\n","file_path":"relm-derive/src/gen/mod.rs","rank":16,"score":189093.6294968522},{"content":"pub fn mouse_move_to<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt + IsA<W>>(widget: &W) {\n\n wait_for_draw(widget, || {\n\n let allocation = widget.allocation();\n\n mouse_move(widget, allocation.width() / 2, allocation.height() / 2);\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":17,"score":187483.78052513115},{"content":"fn gen_set_child_prop_calls(widget: &Widget, parent: Option<&Ident>, parent_widget_type: WidgetType,\n\n widget_type: WidgetType) -> Vec<TokenStream>\n\n{\n\n let widget_name = &widget.name;\n\n let mut child_properties = vec![];\n\n if let Some(parent) = parent {\n\n for (&(ref ident, ref key), value) in &widget.child_properties {\n\n let property_func = Ident::new(&format!(\"set_{}_{}\", ident, key), key.span());\n\n let parent =\n\n if parent_widget_type == IsGtk {\n\n quote! {\n\n #parent\n\n }\n\n }\n\n else {\n\n quote! {\n\n #parent.container\n\n }\n\n };\n\n let call =\n","file_path":"relm-derive/src/gen/generator.rs","rank":18,"score":186886.8263810463},{"content":"// FIXME: don't wait the observer for modifier keys like shift?\n\npub fn key_press<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, key: Key) {\n\n wait_for_draw(widget, || {\n\n let observer = gtk_observer_new!(widget, connect_key_press_event, |_, _| {\n\n Inhibit(false)\n\n });\n\n focus(widget);\n\n let mut enigo = Enigo::new();\n\n enigo.key_down(gdk_key_to_enigo_key(key));\n\n observer.wait();\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":19,"score":185726.3910640853},{"content":"pub fn key_release<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, key: Key) {\n\n wait_for_draw(widget, || {\n\n let observer = gtk_observer_new!(widget, connect_key_release_event, |_, _| {\n\n Inhibit(false)\n\n });\n\n focus(widget);\n\n let mut enigo = Enigo::new();\n\n enigo.key_up(gdk_key_to_enigo_key(key));\n\n observer.wait();\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":20,"score":185721.5756192275},{"content":"pub fn enter_keys<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, text: &str) {\n\n wait_for_draw(widget, || {\n\n focus(widget);\n\n let mut enigo = Enigo::new();\n\n for char in text.chars() {\n\n let observer = gtk_observer_new!(widget, connect_key_release_event, |_, _| {\n\n Inhibit(false)\n\n });\n\n enigo.key_sequence(&char.to_string());\n\n observer.wait();\n\n }\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":21,"score":185721.5756192275},{"content":"pub fn enter_key<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, key: Key) {\n\n wait_for_draw(widget, || {\n\n let observer = gtk_observer_new!(widget, connect_key_release_event, |_, _| {\n\n Inhibit(false)\n\n });\n\n focus(widget);\n\n let mut enigo = Enigo::new();\n\n enigo.key_click(gdk_key_to_enigo_key(key));\n\n observer.wait();\n\n\n\n wait_for_relm_events();\n\n });\n\n}\n\n\n","file_path":"relm-test/src/lib.rs","rank":22,"score":185721.5756192275},{"content":"fn update_component<COMPONENT>(component: &mut COMPONENT, event: COMPONENT::Msg)\n\n where COMPONENT: Update,\n\n{\n\n if cfg!(debug_assertions) {\n\n let time = SystemTime::now();\n\n let debug = event.display_variant();\n\n let debug =\n\n if debug.len() > 100 {\n\n format!(\"{}…\", &debug[..100])\n\n }\n\n else {\n\n debug.to_string()\n\n };\n\n component.update(event);\n\n if let Ok(duration) = time.elapsed() {\n\n let ms = duration.subsec_nanos() as u64 / 1_000_000 + duration.as_secs() * 1000;\n\n if ms >= 16 {\n\n log::warn!(\"The update function was slow to execute for message {}: {}ms\", debug, ms);\n\n }\n\n }\n\n }\n\n else {\n\n component.update(event)\n\n }\n\n}\n","file_path":"src/state/mod.rs","rank":23,"score":184797.2935654273},{"content":"fn gen_set_child_prop_calls(widget: &Widget) -> Option<ImplItem> {\n\n let mut tokens = quote! {};\n\n let widget_name = &widget.name;\n\n for (&(ref ident, ref key), value) in &widget.child_properties {\n\n let property_func = Ident::new(&format!(\"set_{}_{}\", ident, key), key.span());\n\n tokens = quote_spanned! { widget_name.span() =>\n\n #tokens\n\n parent.#property_func(&self.widgets.#widget_name, #value);\n\n };\n\n }\n\n if !widget.child_properties.is_empty() {\n\n Some(block_to_impl_item(quote_spanned! { widget_name.span() =>\n\n fn on_add<W: ::relm::IsA<::gtk::Widget> + ::relm::IsA<::relm::Object>>(&self, parent: W) {\n\n let parent: gtk::Box = ::relm::Cast::downcast(::relm::Cast::upcast::<::gtk::Widget>(parent))\n\n .expect(\"the parent of a widget with child properties must be a gtk::Box\");\n\n #tokens\n\n }\n\n }))\n\n }\n\n else {\n\n None\n\n }\n\n}\n","file_path":"relm-derive/src/gen/mod.rs","rank":24,"score":182554.52080909925},{"content":"pub fn gen(name: &Ident, widgets: &[Widget], driver: &mut Driver) -> Gen {\n\n let mut generator = Generator::new(driver);\n\n let mut widget_tokens = quote! {};\n\n for (index, widget) in widgets.iter().enumerate() {\n\n // Only show the first item as the following could be non-widget like a gtk::Gesture.\n\n let tokens = generator.widget(widget, None, IsGtk, index == 0);\n\n widget_tokens = quote! {\n\n #widget_tokens #tokens\n\n };\n\n }\n\n\n\n let driver = generator.driver.take().expect(\"driver\");\n\n let idents: Vec<_> = driver.widgets.keys().collect();\n\n let root_widget_name = &driver.root_widget.as_ref().expect(\"root_widget is None\");\n\n let component_names: Vec<_> = generator.widget_names.iter()\n\n .filter(|ident| generator.relm_components.contains_key(ident))\n\n .collect();\n\n\n\n let component_widgets: Vec<_> = generator.widget_names.iter()\n\n .filter(|ident| generator.relm_components.contains_key(ident) && ident != root_widget_name)\n","file_path":"relm-derive/src/gen/generator.rs","rank":25,"score":181939.39823851606},{"content":"#[proc_macro_derive(Msg)]\n\npub fn msg(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast: Item = parse(input).expect(\"msg > parse failed\");\n\n let gen = impl_msg(&ast, Ident::new(\"relm\", ast.span()));\n\n gen.into()\n\n}\n\n\n","file_path":"relm-derive/src/lib.rs","rank":26,"score":181492.09901412134},{"content":"fn add_model_param(model_fn: &mut ImplItem, model_param_type: &mut Option<ImplItem>) {\n\n let span = model_fn.span();\n\n if let Method(ImplItemMethod { ref mut sig, .. }) = *model_fn {\n\n let len = sig.inputs.len();\n\n if len == 0 || len == 1 {\n\n let type_tokens = quote_spanned! { span =>\n\n &::relm::Relm<Self>\n\n };\n\n let ty: Type = parse(type_tokens.into()).expect(\"Relm type\");\n\n let input: FnArg = parse(quote! { _: #ty }.into()).expect(\"wild arg\");\n\n sig.inputs.insert(0, input);\n\n if len == 0 {\n\n let input: FnArg = parse(quote! { _: () }.into()).expect(\"wild arg\");\n\n sig.inputs.push(input);\n\n }\n\n }\n\n if let Some(&Typed(PatType { ref ty, .. })) = sig.inputs.iter().nth(1) {\n\n *model_param_type = Some(block_to_impl_item(quote! {\n\n type ModelParam = #ty;\n\n }));\n\n }\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":27,"score":177950.57935018194},{"content":"type Callback<MSG> = Rc<RefCell<Option<Box<dyn FnMut(MSG)>>>>;\n\n\n","file_path":"src/core/mod.rs","rank":28,"score":177519.93011464758},{"content":"/// Trait to implement to manage widget's events.\n\npub trait Widget\n\n where Self: Update,\n\n Self::Root: Clone + IsA<Object> + IsA<gtk::Widget>,\n\n{\n\n /// The type of the root widget.\n\n type Root;\n\n\n\n /// Update the view after it is initially created.\n\n /// This method is only useful when using the `#[widget]` attribute, because when not using it,\n\n /// you can use the [`view()`](trait.Widget.html#tymethod.view) method instead.\n\n fn init_view(&mut self) {\n\n }\n\n\n\n /// Method called when the widget is added to its parent.\n\n /// This is currently only used to set the child properties of a widget as relm widget could\n\n /// have child properties and we don't know its parent when it is defined. Thus, we call\n\n /// on_add() when it is added to its parent to set the child properties.\n\n fn on_add<W: IsA<gtk::Widget> + IsA<Object>>(&self, _parent: W) {\n\n }\n\n\n","file_path":"src/widget.rs","rank":29,"score":168624.71905487753},{"content":"pub fn gen_widget(input: TokenStream) -> TokenStream {\n\n let mut driver = Driver::new();\n\n driver.gen_widget(input)\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":30,"score":165672.22448452725},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n vbox: gtk::EventBox,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/tests/relm-root.rs","rank":31,"score":165174.28054422047},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n entry: Entry,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/tests/key-events.rs","rank":32,"score":165086.00695577828},{"content":"#[derive(Clone, Copy, PartialEq)]\n\nenum WidgetType {\n\n IsGtk,\n\n IsRelm,\n\n}\n\n\n\npub struct Gen {\n\n pub view: TokenStream,\n\n pub relm_widgets: HashMap<Ident, Path>,\n\n pub relm_components: HashMap<Ident, Path>,\n\n pub streams_to_save: HashSet<Ident>,\n\n pub container_impl: TokenStream,\n\n}\n\n\n","file_path":"relm-derive/src/gen/generator.rs","rank":33,"score":164966.14325654096},{"content":"#[derive(Msg)]\n\nenum TextMsg {\n\n Change,\n\n}\n\n\n","file_path":"relm-examples/tests/multiple-widgets.rs","rank":34,"score":164839.98467267008},{"content":"#[derive(Msg)]\n\nenum CounterMsg {\n\n Decrement,\n\n Increment,\n\n}\n\n\n","file_path":"relm-examples/tests/multiple-widgets.rs","rank":35,"score":164839.98467267008},{"content":"/// Trait implemented by the generator to ease the creation of tests of relm widgets using the\n\n/// view! macro.\n\npub trait WidgetTest : Widget {\n\n /// Represents the structure holding all the `StreamHandle`s. Useful for tests.\n\n type Streams;\n\n /// Represents the structure holding all the widgets. Useful for tests.\n\n type Widgets;\n\n\n\n /// Get the structure containing all the `StreamHandle`s. Useful for tests.\n\n fn get_streams(&self) -> Self::Streams;\n\n\n\n /// Get the structure containing all the widgets. Useful for tests.\n\n fn get_widgets(&self) -> Self::Widgets;\n\n}\n","file_path":"src/widget.rs","rank":36,"score":164703.51831244573},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n MinusToggle,\n\n PlusToggle,\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/tests/checkboxes.rs","rank":37,"score":163753.7896746603},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Decrement,\n\n Increment,\n\n Quit,\n\n}\n\n\n\n// Create the structure that holds the widgets used in the view.\n","file_path":"relm-examples/examples/buttons.rs","rank":38,"score":163753.7896746603},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Decrement,\n\n Increment,\n\n Quit,\n\n}\n\n\n\n// Create the structure that holds the widgets used in the view.\n","file_path":"relm-examples/examples/glade.rs","rank":39,"score":163753.7896746603},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n // …\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/examples/readme.rs","rank":40,"score":163753.7896746603},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Quit,\n\n Tick,\n\n}\n\n\n","file_path":"relm-examples/examples/clock.rs","rank":41,"score":163753.7896746603},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n TextChange(String),\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/tests/communication.rs","rank":42,"score":163753.7896746603},{"content":"#[derive(Clone, Debug)]\n\nenum Msg {\n\n Clock,\n\n Decrement,\n\n Increment,\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/examples/core.rs","rank":43,"score":163749.04487182817},{"content":"enum IdentOrEventValue {\n\n MessageIdent(EventValueReturn, bool),\n\n MessageEventValue(Ident, EventValueReturn, bool),\n\n}\n\n\n","file_path":"relm-derive/src/gen/parser.rs","rank":44,"score":162906.9155523627},{"content":"#[derive(Msg)]\n\nenum CounterMsg {\n\n Decrement,\n\n Increment,\n\n}\n\n\n","file_path":"relm-examples/tests/multi-generic-widget.rs","rank":45,"score":162054.15040786224},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Decrement,\n\n Increment,\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/tests/model-param.rs","rank":46,"score":161708.94650657196},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n ItemSelect,\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/examples/tree-view.rs","rank":47,"score":161708.94650657196},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Decrement,\n\n Increment,\n\n Quit,\n\n}\n\n\n\n// Create the structure that holds the widgets used in the view.\n","file_path":"relm-examples/examples/glade_gladis.rs","rank":48,"score":161708.94650657196},{"content":"#[derive(Msg)]\n\nenum Msg {\n\n Change,\n\n Quit,\n\n}\n\n\n","file_path":"relm-examples/examples/text-fields.rs","rank":49,"score":161708.94650657196},{"content":"#[proc_macro_attribute]\n\npub fn widget(_attributes: proc_macro::TokenStream, input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast: Item = parse(input).expect(\"widget.parse failed\");\n\n let tokens = quote! {\n\n #ast\n\n };\n\n let expanded = gen_widget(tokens);\n\n expanded.into()\n\n}\n\n\n","file_path":"relm-derive/src/lib.rs","rank":50,"score":161397.76072084962},{"content":"struct EventValueParser {\n\n value_return: EventValueReturn,\n\n use_self: bool,\n\n}\n\n\n\nimpl Parse for EventValueParser {\n\n fn parse(input: ParseStream) -> Result<Self> {\n\n let tag = Tag::parse(input, \"return\");\n\n let lookahead = input.lookahead1();\n\n if tag.is_ok() {\n\n let value = Value::parse(input)?;\n\n Ok(EventValueParser {\n\n value_return: CallReturn(value.value),\n\n use_self: value.use_self,\n\n })\n\n }\n\n else if lookahead.peek(token::Paren) {\n\n let content;\n\n let _parens = parenthesized!(content in input);\n\n let value1: Value = content.parse()?;\n","file_path":"relm-derive/src/gen/parser.rs","rank":51,"score":160279.14423855877},{"content":"fn gen_event_metadata(event: &Event) -> TokenStream {\n\n if let CurrentWidget(CallReturn(_)) = event.value {\n\n quote! {\n\n return\n\n }\n\n }\n\n else {\n\n quote! {}\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/generator.rs","rank":52,"score":159866.54580038693},{"content":"#[derive(Msg)]\n\nenum CounterMsg<T> {\n\n Decrement,\n\n Increment(T),\n\n}\n\n\n","file_path":"relm-examples/tests/generic-widget.rs","rank":53,"score":159355.1690948694},{"content":"/// Create a new relm widget with `model_param` as initialization value.\n\nfn create_widget<WIDGET>(model_param: WIDGET::ModelParam)\n\n -> (Component<WIDGET>, WIDGET, Relm<WIDGET>)\n\n where WIDGET: Widget + 'static,\n\n WIDGET::Msg: DisplayVariant + 'static,\n\n{\n\n let stream = EventStream::new();\n\n\n\n let relm = Relm::new(&stream);\n\n let model = WIDGET::model(&relm, model_param);\n\n let mut widget = WIDGET::view(&relm, model);\n\n widget.init_view();\n\n\n\n let root = widget.root();\n\n (Component::new(stream, root), widget, relm)\n\n}\n\n\n","file_path":"src/lib.rs","rank":54,"score":157785.8484285975},{"content":"struct VBox {\n\n event_box: EventBox,\n\n vbox: gtk::Box,\n\n}\n\n\n\nimpl Container for VBox {\n\n type Container = gtk::Box;\n\n type Containers = ();\n\n\n\n fn container(&self) -> &Self::Container {\n\n &self.vbox\n\n }\n\n\n\n fn other_containers(&self) -> () {\n\n }\n\n}\n\n\n\nimpl Update for VBox {\n\n type Model = ();\n\n type ModelParam = ();\n","file_path":"relm-examples/tests/relm-root.rs","rank":55,"score":157664.08564824326},{"content":"fn add(values: Vec<f64>) -> Result<f64, String> {\n\n if values.len() != 2 {\n\n Err(\"add takes exactly two arguments\".to_string())\n\n } else {\n\n Ok(values.iter().sum())\n\n }\n\n}\n\n\n","file_path":"relm-examples/examples/7gui/7_cells/src/model/operations.rs","rank":56,"score":157182.12418698345},{"content":"fn create_widget_test<WIDGET>(model_param: WIDGET::ModelParam) -> (Component<WIDGET>, WIDGET::Streams, WIDGET::Widgets)\n\n where WIDGET: Widget + WidgetTest + 'static,\n\n WIDGET::Msg: DisplayVariant + 'static,\n\n{\n\n let (component, widget, relm) = create_widget::<WIDGET>(model_param);\n\n let widgets = widget.get_widgets();\n\n let streams = widget.get_streams();\n\n init_component::<WIDGET>(component.owned_stream(), widget, &relm);\n\n (component, streams, widgets)\n\n}\n\n\n","file_path":"src/lib.rs","rank":57,"score":155505.0385516247},{"content":"type InitTestComponents<WIDGET> = (Component<WIDGET>, <WIDGET as WidgetTest>::Streams, <WIDGET as WidgetTest>::Widgets);\n\n\n","file_path":"src/lib.rs","rank":58,"score":154882.24964094587},{"content":"fn gen_widget_ident(widget: &Widget) -> (TokenStream, Span) {\n\n match widget.widget {\n\n Gtk(ref gtk_widget) => {\n\n if let Some(Type::Path(TypePath { path: Path { ref segments, .. }, .. })) = gtk_widget.relm_name {\n\n let ident = &segments[0].ident;\n\n (quote! {\n\n #ident\n\n }, ident.span())\n\n }\n\n else {\n\n panic!(\"relm name should be a Path\");\n\n }\n\n },\n\n Relm(_) => {\n\n let path = &widget.typ;\n\n (quote! {\n\n #path\n\n }, path.span())\n\n },\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/generator.rs","rank":59,"score":153891.93297495003},{"content":"struct SourceData<MSG> {\n\n callback: Callback<MSG>,\n\n stream: Rc<RefCell<_EventStream<MSG>>>,\n\n}\n\n\n","file_path":"src/core/mod.rs","rank":60,"score":153805.99672481668},{"content":"struct ChannelData<MSG> {\n\n callback: Box<dyn FnMut(MSG)>,\n\n peeked_value: Option<MSG>,\n\n receiver: Receiver<MSG>,\n\n}\n\n\n\n/// A wrapper over a `std::sync::mpsc::Sender` to wakeup the glib event loop when sending a\n\n/// message.\n\npub struct Sender<MSG> {\n\n sender: mpsc::Sender<MSG>,\n\n}\n\n\n\nimpl<MSG> Clone for Sender<MSG> {\n\n fn clone(&self) -> Self {\n\n Self {\n\n sender: self.sender.clone(),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/core/mod.rs","rank":61,"score":153805.99672481668},{"content":"fn gen_construct_widget(widget: &Widget, gtk_widget: &GtkWidget) -> TokenStream {\n\n let struct_name = &widget.typ;\n\n\n\n let properties_count = gtk_widget.construct_properties.len() as u32;\n\n let mut values = vec![];\n\n let mut parameters = vec![];\n\n for (key, value) in gtk_widget.construct_properties.iter() {\n\n let mut remover = Transformer::new(MODEL_IDENT);\n\n let value = remover.fold_expr(value.clone());\n\n let key = key.to_string();\n\n values.push(quote_spanned! { struct_name.span() =>\n\n ::relm::ToValue::to_value(&#value)\n\n });\n\n let index = parameters.len();\n\n parameters.push(quote_spanned! { struct_name.span() =>\n\n ::relm::GParameter {\n\n name: ::relm::ToGlibPtr::to_glib_full(#key),\n\n value: ::std::ptr::read(::relm::ToGlibPtr::to_glib_none(&values[#index]).0),\n\n }\n\n });\n","file_path":"relm-derive/src/gen/generator.rs","rank":62,"score":152992.18713843983},{"content":"/// Trait to implement relm container widget.\n\npub trait Container: Widget {\n\n /// The type of the containing widget, i.e. where the child widgets will be added.\n\n type Container: Clone + IsA<gtk::Container> + IsA<Object> + IsA<gtk::Widget>;\n\n /// Type to contain the additional container widgets.\n\n // TODO: put that in yet another trait?\n\n type Containers: Clone;\n\n\n\n /// Add a relm widget to this container.\n\n /// Return the widget that will be send to Widget::on_add().\n\n fn add_widget<WIDGET: Widget>(container: &ContainerComponent<Self>, component: &Component<WIDGET>)\n\n -> gtk::Container\n\n {\n\n container.container.add(component.widget());\n\n container.container.clone().upcast()\n\n }\n\n\n\n /// Get the containing widget, i.e. the widget where the children will be added.\n\n fn container(&self) -> &Self::Container;\n\n\n\n /// Get additional container widgets.\n\n /// This is useful to create a multi-container.\n\n fn other_containers(&self) -> Self::Containers;\n\n}\n\n\n","file_path":"src/container.rs","rank":63,"score":152576.7797814074},{"content":"fn get_return_type(sig: Signature) -> Type {\n\n if let ReturnType::Type(_, ty) = sig.output {\n\n *ty\n\n }\n\n else {\n\n Type::Tuple(syn::TypeTuple {\n\n paren_token: syn::token::Paren::default(),\n\n elems: syn::punctuated::Punctuated::new()\n\n })\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":64,"score":146625.86868395132},{"content":"type ChildEvents = HashMap<(Ident, Ident), Event>;\n","file_path":"relm-derive/src/gen/parser.rs","rank":65,"score":145233.8620509262},{"content":"fn get_second_param_type(sig: &Signature) -> Type {\n\n if let Typed(PatType { ref ty, .. }) = sig.inputs[1] {\n\n *ty.clone()\n\n }\n\n else {\n\n panic!(\"Unexpected `(unknown)`, expecting Typed Type\"/*, sig.decl.inputs[1]*/); // TODO\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":66,"score":145198.83378222882},{"content":"/// Apply the operation with the given name to the values.\n\npub fn operate(function: &str, values: Vec<f64>) -> Result<f64, String> {\n\n match function {\n\n \"add\" => add(values),\n\n \"sub\" => sub(values),\n\n \"div\" => div(values),\n\n \"mul\" => mul(values),\n\n \"sum\" => sum(values),\n\n \"prod\" => prod(values),\n\n _ => Err(format!(\"Unknown function: {}\", function)),\n\n }\n\n}\n\n\n","file_path":"relm-examples/examples/7gui/7_cells/src/model/operations.rs","rank":67,"score":144024.25930046043},{"content":"fn get_properties_model_map(widget: &Widget, map: &mut PropertyModelMap) {\n\n match widget.widget {\n\n Gtk(_) => get_map(widget, map, false),\n\n Relm(_) => get_map(widget, map, true),\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":68,"score":141866.69698322087},{"content":"fn impl_msg(ast: &Item, krate: Ident) -> TokenStream {\n\n let display = derive_display_variant(ast, &krate);\n\n let into_option = derive_into_option(ast, &krate);\n\n\n\n quote! {\n\n #display\n\n #into_option\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/lib.rs","rank":69,"score":139419.74929765295},{"content":"fn gen_other_containers(generator: &Generator, widget_type: &TokenStream, widget_ident_span: Span) ->\n\n (TokenStream, TokenStream, TokenStream)\n\n{\n\n if generator.container_names.len() > 1 {\n\n let containers_ident = Ident::new(&format!(\"{}Containers\", widget_type), widget_ident_span);\n\n let mut names = vec![];\n\n let mut types = vec![];\n\n let mut values = vec![];\n\n for &(ref name, ref typ) in generator.container_names.values() {\n\n names.push(name.clone());\n\n let original_type = typ.clone();\n\n let typ =\n\n if typ.segments.len() > 1 {\n\n // GTK+ widget\n\n values.push(name.clone());\n\n quote! { #original_type }\n\n }\n\n else {\n\n // Relm widget\n\n values.push(Ident::new(&format!(\"{}\", name), name.span()));\n","file_path":"relm-derive/src/gen/generator.rs","rank":70,"score":138342.3205260401},{"content":"fn get_name(typ: &Type) -> Ident {\n\n if let Type::Path(TypePath { ref path, .. }) = *typ {\n\n let mut parts = vec![];\n\n for segment in &path.segments {\n\n parts.push(segment.ident.to_string());\n\n }\n\n Ident::new(&parts.join(\"::\"), typ.span())\n\n }\n\n else {\n\n panic!(\"Expected Path\")\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":71,"score":137277.7637938799},{"content":"fn get_map(widget: &Widget, map: &mut PropertyModelMap, is_relm: bool) {\n\n for (name, expr) in &widget.properties {\n\n let mut visitor = ModelVariableVisitor::new();\n\n visitor.visit_expr(&expr);\n\n let model_variables = visitor.idents;\n\n for var in model_variables {\n\n let set = map.entry(var).or_insert_with(HashSet::new);\n\n set.insert(Property {\n\n expr: expr.clone(),\n\n is_relm_widget: is_relm,\n\n name: name.clone(),\n\n widget_name: widget.name.clone(),\n\n });\n\n }\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/mod.rs","rank":72,"score":136820.3651228164},{"content":"pub fn dummy_ident(ident: &str) -> Ident {\n\n Ident::new(ident, Span::call_site())\n\n}\n","file_path":"relm-derive/src/gen/parser.rs","rank":73,"score":131595.40162554718},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n counter1: gtk::Box,\n\n counter2: gtk::Box,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/tests/generic-widget.rs","rank":74,"score":131057.33922348343},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n counter1: gtk::Box,\n\n counter2: gtk::Box,\n\n text: gtk::Box,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/tests/multiple-widgets.rs","rank":75,"score":131057.33922348343},{"content":"pub fn gen_where_clause(generics: &Generics) -> TokenStream {\n\n let where_clause = &generics.where_clause;\n\n // TODO: check that it is okay (vs what we did before).\n\n quote! {\n\n #where_clause\n\n }\n\n /*if generics.where_clause.predicates.is_empty() {\n\n quote! {\n\n }\n\n }\n\n else {\n\n let where_clause = &generics.where_clause;\n\n quote! {\n\n #where_clause\n\n }\n\n }*/\n\n}\n","file_path":"relm-derive/src/gen/generator.rs","rank":76,"score":130030.6003975882},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n counter1: <Counter<i32, i64> as Widget>::Root,\n\n counter2: gtk::Box,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/tests/multi-generic-widget.rs","rank":77,"score":129362.35099605},{"content":"/// Create a new relm widget without adding it to an existing widget.\n\n/// This is useful when a relm widget is at the root of another relm widget.\n\npub fn create_component<CHILDWIDGET>(model_param: CHILDWIDGET::ModelParam)\n\n -> Component<CHILDWIDGET>\n\n where CHILDWIDGET: Widget + 'static,\n\n CHILDWIDGET::Msg: DisplayVariant + 'static,\n\n{\n\n let (component, widget, child_relm) = create_widget::<CHILDWIDGET>(model_param);\n\n init_component::<CHILDWIDGET>(component.owned_stream(), widget, &child_relm);\n\n component\n\n}\n\n\n","file_path":"src/lib.rs","rank":78,"score":128589.50413755835},{"content":"/// Create a new relm container widget without adding it to an existing widget.\n\n/// This is useful when a relm widget is at the root of another relm widget.\n\npub fn create_container<CHILDWIDGET>(model_param: CHILDWIDGET::ModelParam)\n\n -> ContainerComponent<CHILDWIDGET>\n\n where CHILDWIDGET: Container + Widget + 'static,\n\n CHILDWIDGET::Msg: DisplayVariant + 'static,\n\n{\n\n let (component, widget, child_relm) = create_widget::<CHILDWIDGET>(model_param);\n\n let container = widget.container().clone();\n\n let containers = widget.other_containers();\n\n init_component::<CHILDWIDGET>(component.owned_stream(), widget, &child_relm);\n\n ContainerComponent::new(component, container, containers)\n\n}\n\n\n","file_path":"src/lib.rs","rank":79,"score":128589.39342632776},{"content":"#[derive(Msg)]\n\nenum CheckMsg {\n\n Check,\n\n Toggle,\n\n Uncheck,\n\n}\n\n\n","file_path":"relm-examples/tests/checkboxes.rs","rank":80,"score":124686.26900772189},{"content":"#[derive(Msg)]\n\nenum TextMsg {\n\n Change(glib::GString),\n\n}\n\n\n","file_path":"relm-examples/tests/communication.rs","rank":81,"score":124686.26900772189},{"content":"#[derive(Msg)]\n\nenum CounterMsg {\n\n Decrement,\n\n Increment,\n\n}\n\n\n","file_path":"relm-examples/tests/communication.rs","rank":82,"score":124686.26900772189},{"content":"pub fn new_source<T: SourceFuncs>(data: T) -> Source {\n\n unsafe {\n\n let mut funcs: GSourceFuncs = mem::zeroed();\n\n funcs.prepare = Some(prepare::<T>);\n\n funcs.check = Some(check::<T>);\n\n funcs.dispatch = Some(dispatch::<T>);\n\n funcs.finalize = Some(finalize::<T>);\n\n let mut funcs = Box::new(funcs);\n\n let source = g_source_new(&mut *funcs, mem::size_of::<SourceData<T>>() as u32);\n\n ptr::write(&mut (*(source as *mut SourceData<T>)).data, data);\n\n ptr::write(&mut (*(source as *mut SourceData<T>)).funcs, funcs);\n\n from_glib_full(source)\n\n }\n\n}\n\n\n","file_path":"src/core/source.rs","rank":83,"score":124304.66471746951},{"content":"pub fn source_get<T: SourceFuncs>(source: &Source) -> &T {\n\n unsafe { &( *(source.to_glib_none().0 as *const SourceData<T>) ).data }\n\n}\n\n\n\nunsafe extern \"C\" fn check<T: SourceFuncs>(source: *mut GSource) -> c_int {\n\n let object = source as *mut SourceData<T>;\n\n bool_to_int((*object).data.check())\n\n}\n\n\n\nunsafe extern \"C\" fn dispatch<T: SourceFuncs>(source: *mut GSource, _callback: GSourceFunc, _user_data: *mut libc::c_void)\n\n -> c_int\n\n{\n\n let object = source as *mut SourceData<T>;\n\n bool_to_int((*object).data.dispatch())\n\n}\n\n\n\nunsafe extern \"C\" fn finalize<T: SourceFuncs>(source: *mut GSource) {\n\n // TODO: needs a bomb to abort on panic\n\n let source = source as *mut SourceData<T>;\n\n ptr::read(&(*source).funcs);\n","file_path":"src/core/source.rs","rank":84,"score":124304.66471746951},{"content":"// There will be several widgets involved in this example, but this struct\n\n// will act as a container just for the widgets that we will be updating.\n\nstruct Widgets {\n\n clock_label: Label,\n\n counter_label: Label,\n\n}\n\n\n\n// This enum holds the various messages that will be passed between our\n\n// widgets. Note that we aren't deriving `Msg` because this example uses\n\n// the `core` module, which is the basic event-handling library that\n\n// `relm` depends on.\n","file_path":"relm-examples/examples/core.rs","rank":85,"score":123276.23016805618},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n counter1: gtk::Box,\n\n counter2: gtk::Box,\n\n dec_button: Button,\n\n label: Label,\n\n text: gtk::Box,\n\n window: Window,\n\n}\n\n\n\nimpl Update for Win {\n\n type Model = Model;\n\n type ModelParam = ();\n\n type Msg = Msg;\n\n\n\n fn model(_: &Relm<Self>, _: ()) -> Model {\n\n Model {\n\n counter: 0,\n\n }\n\n }\n\n\n","file_path":"relm-examples/tests/communication.rs","rank":86,"score":123266.57202037793},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n window: Window,\n\n inc_button: gtk::Button,\n\n dec_button: gtk::Button,\n\n label: Label,\n\n}\n\n\n","file_path":"relm-examples/tests/container.rs","rank":87,"score":123266.57202037793},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n minus_button: gtk::CheckButton,\n\n plus_button: gtk::CheckButton,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/tests/checkboxes.rs","rank":88,"score":123266.57202037793},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n counter_label: Label,\n\n minus_button: Button,\n\n plus_button: Button,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/examples/glade.rs","rank":89,"score":123266.57202037793},{"content":"#[derive(Clone)]\n\nstruct Widgets {\n\n counter_label: Label,\n\n minus_button: Button,\n\n plus_button: Button,\n\n window: Window,\n\n}\n\n\n","file_path":"relm-examples/examples/buttons.rs","rank":90,"score":123266.57202037793},{"content":"/// Extension trait for GTK+ containers to add and remove relm `Widget`s.\n\npub trait ContainerWidget {\n\n /// Add a relm `Container` to the current GTK+ container.\n\n ///\n\n /// # Note\n\n ///\n\n /// The returned `ContainerComponent` must be stored in a `Widget`. If it is not stored, a\n\n /// communication receiver will be droped which will cause events to be ignored for this\n\n /// widget.\n\n fn add_container<CHILDWIDGET>(&self, model_param: CHILDWIDGET::ModelParam)\n\n -> ContainerComponent<CHILDWIDGET>\n\n where CHILDWIDGET: Container + Widget + 'static,\n\n CHILDWIDGET::Msg: DisplayVariant + 'static,\n\n CHILDWIDGET::Root: IsA<gtk::Widget> + IsA<Object> + WidgetExt;\n\n\n\n /// Add a relm `Widget` to the current GTK+ container.\n\n ///\n\n /// # Note\n\n ///\n\n /// The returned `Component` must be stored in a `Widget`. If it is not stored, a communication\n\n /// receiver will be droped which will cause events to be ignored for this widget.\n","file_path":"src/container.rs","rank":91,"score":122978.97870499137},{"content":"fn main() {\n\n Win::run(()).expect(\"Win::run failed\");\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use gtk::prelude::{ButtonExt, LabelExt};\n\n\n\n use gtk_test::{assert_label, assert_text};\n\n use relm_test::click;\n\n\n\n use crate::Win;\n\n\n\n #[test]\n\n fn label_change() {\n\n let (_component, _, widgets) = relm::init_test::<Win>(()).expect(\"init_test failed\");\n\n let inc_button = &widgets.inc_button;\n\n let dec_button = &widgets.dec_button;\n\n let label = &widgets.label;\n\n\n","file_path":"relm-examples/tests/include.rs","rank":92,"score":122871.37508782223},{"content":"fn gen_add_widget_method(container_names: &HashMap<Option<String>, (Ident, Path)>) -> TokenStream {\n\n if container_names.len() > 1 {\n\n let span = container_names.values().next().expect(\"at least one container name\").0.span();\n\n let mut default_container = quote! {};\n\n let mut other_containers = quote! {};\n\n for (parent_id, &(ref name, _)) in container_names {\n\n if parent_id.is_none() {\n\n default_container = quote_spanned! { span =>\n\n ::gtk::prelude::ContainerExt::add(&container.container, widget.widget());\n\n ::relm::Cast::upcast(container.container.clone())\n\n };\n\n }\n\n else if other_containers.is_empty() {\n\n other_containers = quote_spanned! { span =>\n\n if WIDGET::parent_id() == Some(#parent_id) {\n\n ::gtk::prelude::ContainerExt::add(&container.containers.#name, widget.widget());\n\n ::relm::Cast::upcast(container.containers.#name.clone())\n\n }\n\n };\n\n }\n","file_path":"relm-derive/src/gen/generator.rs","rank":93,"score":122195.18717476827},{"content":"struct Value {\n\n value: Expr,\n\n use_self: bool,\n\n}\n\n\n\nimpl Parse for Value {\n\n fn parse(input: ParseStream) -> Result<Self> {\n\n let expr = Expr::parse(input)?;\n\n let use_self = expr_use_self(&expr);\n\n Ok(Value {\n\n value: expr,\n\n use_self,\n\n })\n\n }\n\n}\n\n\n","file_path":"relm-derive/src/gen/parser.rs","rank":94,"score":122160.2557125601},{"content":"struct Components {\n\n _vbox: Component<MyVBox>,\n\n}\n\n\n","file_path":"relm-examples/tests/relm-root.rs","rank":95,"score":122107.84335093459},{"content":"struct Button {\n\n button: gtk::Button,\n\n}\n\n\n\nimpl Update for Button {\n\n type Model = ();\n\n type ModelParam = ();\n\n type Msg = ();\n\n\n\n fn model(_: &Relm<Self>, _: ()) -> () {\n\n }\n\n\n\n fn update(&mut self, _msg: ()) {\n\n }\n\n}\n\n\n\nimpl Widget for Button {\n\n type Root = gtk::Button;\n\n\n\n fn root(&self) -> gtk::Button {\n","file_path":"relm-examples/tests/relm-root.rs","rank":96,"score":122107.84335093459},{"content":"struct Win {\n\n _components: Components,\n\n widgets: Widgets,\n\n}\n\n\n\nimpl Update for Win {\n\n type Model = ();\n\n type ModelParam = ();\n\n type Msg = Msg;\n\n\n\n fn model(_: &Relm<Self>, _: ()) -> () {\n\n }\n\n\n\n fn update(&mut self, event: Msg) {\n\n match event {\n\n Quit => gtk::main_quit(),\n\n }\n\n }\n\n}\n\n\n","file_path":"relm-examples/tests/relm-root.rs","rank":97,"score":122107.84335093459},{"content":"struct Win {\n\n model: Model,\n\n widgets: Widgets,\n\n}\n\n\n\nimpl Update for Win {\n\n type Model = Model;\n\n type ModelParam = ();\n\n type Msg = Msg;\n\n\n\n fn model(_relm: &Relm<Self>, _: ()) -> Model {\n\n Model {\n\n press_count: Rc::new(Cell::new(0)),\n\n }\n\n }\n\n\n\n fn update(&mut self, event: Msg) {\n\n match event {\n\n KeyPress => (),\n\n Press => {\n","file_path":"relm-examples/tests/key-events.rs","rank":98,"score":122019.56976249242},{"content":"#[derive(PartialEq)]\n\nenum SaveWidget {\n\n DontSave,\n\n Save,\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum EventValueReturn {\n\n CallReturn(Expr),\n\n Return(Box<(Expr, Expr)>),\n\n WithoutReturn(Expr),\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum EventValue {\n\n CurrentWidget(EventValueReturn),\n\n ForeignWidget(Ident, EventValueReturn),\n\n NoEventValue,\n\n}\n\n\n\n#[derive(Debug)]\n","file_path":"relm-derive/src/gen/parser.rs","rank":99,"score":121965.54178802531}],"string":"[\n {\n \"content\": \"/// After `duration` ms, emit `msg`.\\n\\npub fn timeout<F: Fn() -> MSG + 'static, MSG: 'static>(stream: &StreamHandle<MSG>, duration: u32, constructor: F) {\\n\\n let stream = stream.clone();\\n\\n glib::timeout_add_local(std::time::Duration::from_millis(duration as u64), move || {\\n\\n let msg = constructor();\\n\\n stream.emit(msg);\\n\\n Continue(false)\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 0,\n \"score\": 279921.1796681675\n },\n {\n \"content\": \"/// Emit the `msg` every `duration` ms.\\n\\npub fn interval<F: Fn() -> MSG + 'static, MSG: 'static>(stream: &StreamHandle<MSG>, duration: u32, constructor: F) {\\n\\n let stream = stream.clone();\\n\\n glib::timeout_add_local(std::time::Duration::from_millis(duration as u64), move || {\\n\\n let msg = constructor();\\n\\n stream.emit(msg);\\n\\n Continue(true)\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 1,\n \"score\": 279921.14299104526\n },\n {\n \"content\": \"/// Initialize a widget for a test.\\n\\n///\\n\\n/// It is to be used this way:\\n\\n///\\n\\n/// ```\\n\\n/// # use gtk::{Window, WindowType};\\n\\n/// # use relm::{Relm, Update, Widget, WidgetTest};\\n\\n/// # use relm_derive::Msg;\\n\\n/// #\\n\\n/// # #[derive(Clone)]\\n\\n/// # struct Win {\\n\\n/// # window: Window,\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Update for Win {\\n\\n/// # type Model = ();\\n\\n/// # type ModelParam = ();\\n\\n/// # type Msg = Msg;\\n\\n/// #\\n\\n/// # fn model(_: &Relm<Self>, _: ()) -> () {\\n\\n/// # ()\\n\\n/// # }\\n\\n/// #\\n\\n/// # fn update(&mut self, event: Msg) {\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl WidgetTest for Win {\\n\\n/// # type Widgets = Win;\\n\\n/// #\\n\\n/// # fn get_widgets(&self) -> Self::Widgets {\\n\\n/// # self.clone()\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Widget for Win {\\n\\n/// # type Root = Window;\\n\\n/// #\\n\\n/// # fn root(&self) -> Self::Root {\\n\\n/// # self.window.clone()\\n\\n/// # }\\n\\n/// #\\n\\n/// # fn view(relm: &Relm<Self>, _model: Self::Model) -> Self {\\n\\n/// # let window = Window::new(WindowType::Toplevel);\\n\\n/// #\\n\\n/// # Win {\\n\\n/// # window: window,\\n\\n/// # }\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # #[derive(Msg)]\\n\\n/// # enum Msg {}\\n\\n/// # fn main() {\\n\\n/// let (component, _, widgets) = relm::init_test::<Win>(()).expect(\\\"init_test failed\\\");\\n\\n/// # }\\n\\n/// ```\\n\\npub fn init_test<WIDGET>(model_param: WIDGET::ModelParam) ->\\n\\n Result<InitTestComponents<WIDGET>, glib::BoolError>\\n\\n where WIDGET: Widget + WidgetTest + 'static,\\n\\n WIDGET::Msg: DisplayVariant + 'static,\\n\\n{\\n\\n gtk::init()?;\\n\\n let main_context = glib::MainContext::default();\\n\\n let _context = main_context.acquire()?;\\n\\n let component = create_widget_test::<WIDGET>(model_param);\\n\\n Ok(component)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 2,\n \"score\": 214226.83642761922\n },\n {\n \"content\": \"/// Create a bare component, i.e. a component only implementing the Update trait, not the Widget\\n\\n/// trait.\\n\\npub fn execute<UPDATE>(model_param: UPDATE::ModelParam) -> EventStream<UPDATE::Msg>\\n\\nwhere UPDATE: Update + UpdateNew + 'static\\n\\n{\\n\\n let stream = EventStream::new();\\n\\n\\n\\n let relm = Relm::new(&stream);\\n\\n let model = UPDATE::model(&relm, model_param);\\n\\n let component = UPDATE::new(&relm, model);\\n\\n\\n\\n init_component::<UPDATE>(&stream, component, &relm);\\n\\n stream\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/state/mod.rs\",\n \"rank\": 3,\n \"score\": 210820.91864463242\n },\n {\n \"content\": \"fn gen_container_impl(generator: &Generator, widget: &Widget, generic_types: &Generics) -> TokenStream {\\n\\n let where_clause = gen_where_clause(generic_types);\\n\\n let widget_type = gen_widget_type(widget);\\n\\n if generator.container_names.is_empty() {\\n\\n quote! {\\n\\n }\\n\\n }\\n\\n else if !generator.container_names.contains_key(&None) {\\n\\n panic!(\\\"Use of #[container=\\\\\\\"name\\\\\\\"] attribute without the default #[container].\\\");\\n\\n }\\n\\n else {\\n\\n let mut container_type = None;\\n\\n for (ident, &(_, ref typ)) in &generator.container_names {\\n\\n if ident.is_none() {\\n\\n container_type = Some(typ);\\n\\n }\\n\\n }\\n\\n let typ = container_type.expect(\\\"container type\\\");\\n\\n let &(ref name, _) = generator.container_names.get(&None).expect(\\\"default container\\\");\\n\\n let add_widget_method = gen_add_widget_method(&generator.container_names);\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 4,\n \"score\": 206000.24064687188\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/generic-widget.rs\",\n \"rank\": 5,\n \"score\": 204775.38369985786\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multiple-widgets.rs\",\n \"rank\": 6,\n \"score\": 204775.38369985786\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multi-generic-widget.rs\",\n \"rank\": 7,\n \"score\": 201862.66217152015\n },\n {\n \"content\": \"/// Initialize a widget.\\n\\npub fn init<WIDGET>(model_param: WIDGET::ModelParam) -> Result<Component<WIDGET>, glib::BoolError>\\n\\n where WIDGET: Widget + 'static,\\n\\n WIDGET::Msg: DisplayVariant + 'static\\n\\n{\\n\\n let (component, widget, relm) = create_widget::<WIDGET>(model_param);\\n\\n init_component::<WIDGET>(component.owned_stream(), widget, &relm);\\n\\n Ok(component)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 8,\n \"score\": 198129.28607062175\n },\n {\n \"content\": \"struct _EventStream<MSG> {\\n\\n events: VecDeque<MSG>,\\n\\n locked: bool,\\n\\n // We use an Rc here to be able to clone the function to call it so that we don't borrow the\\n\\n // stream while calling the function. Otherwise, calling an observer could trigger a\\n\\n // borrow_mut() which would result in a panic.\\n\\n observers: Vec<Rc<dyn Fn(&MSG)>>,\\n\\n}\\n\\n\\n\\nimpl<MSG> SourceFuncs for SourceData<MSG> {\\n\\n fn dispatch(&self) -> bool {\\n\\n let event = self.stream.borrow_mut().events.pop_front();\\n\\n if let (Some(event), Some(callback)) = (event, self.callback.borrow_mut().as_mut()) {\\n\\n callback(event);\\n\\n }\\n\\n true\\n\\n }\\n\\n\\n\\n fn prepare(&self) -> (bool, Option<u32>) {\\n\\n (!self.stream.borrow().events.is_empty(), None)\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/mod.rs\",\n \"rank\": 9,\n \"score\": 197640.15488038774\n },\n {\n \"content\": \"fn gen_widget_type(widget: &Widget) -> TokenStream {\\n\\n match widget.widget {\\n\\n Gtk(ref gtk_widget) => {\\n\\n let ident = gtk_widget.relm_name.as_ref().expect(\\\"as_ref failed\\\");\\n\\n quote! {\\n\\n #ident\\n\\n }\\n\\n },\\n\\n Relm(_) => {\\n\\n let path = &widget.typ;\\n\\n quote! {\\n\\n #path\\n\\n }\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 10,\n \"score\": 197040.14212620223\n },\n {\n \"content\": \"/// Create the specified relm `Widget` and run the main event loops.\\n\\n///\\n\\n/// ```\\n\\n/// # use gtk::{Window, WindowType};\\n\\n/// # use relm::{Relm, Update, Widget};\\n\\n/// # use relm_derive::Msg;\\n\\n/// #\\n\\n/// # struct Win {\\n\\n/// # window: Window,\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Update for Win {\\n\\n/// # type Model = ();\\n\\n/// # type ModelParam = ();\\n\\n/// # type Msg = Msg;\\n\\n/// #\\n\\n/// # fn model(_: &Relm<Self>, _: ()) -> () {\\n\\n/// # ()\\n\\n/// # }\\n\\n/// #\\n\\n/// # fn update(&mut self, event: Msg) {\\n\\n/// # }\\n\\n/// # }\\n\\n/// #\\n\\n/// # impl Widget for Win {\\n\\n/// # type Root = Window;\\n\\n/// #\\n\\n/// # fn root(&self) -> Self::Root {\\n\\n/// # self.window.clone()\\n\\n/// # }\\n\\n/// #\\n\\n/// # fn view(relm: &Relm<Self>, _model: Self::Model) -> Self {\\n\\n/// # let window = Window::new(WindowType::Toplevel);\\n\\n/// #\\n\\n/// # Win {\\n\\n/// # window: window,\\n\\n/// # }\\n\\n/// # }\\n\\n/// # }\\n\\n/// # #[derive(Msg)]\\n\\n/// # enum Msg {}\\n\\n/// # fn main() {\\n\\n/// # }\\n\\n/// #\\n\\n/// # fn run() {\\n\\n/// /// `Win` is a relm `Widget`.\\n\\n/// Win::run(()).expect(\\\"Win::run failed\\\");\\n\\n/// # }\\n\\n/// ```\\n\\npub fn run<WIDGET>(model_param: WIDGET::ModelParam) -> Result<(), glib::BoolError>\\n\\n where WIDGET: Widget + 'static,\\n\\n{\\n\\n let main_context = glib::MainContext::default();\\n\\n let _context = main_context.acquire()?;\\n\\n gtk::init()?;\\n\\n let _component = init::<WIDGET>(model_param)?;\\n\\n gtk::main();\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 11,\n \"score\": 196773.48834057053\n },\n {\n \"content\": \"pub fn double_click<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W) {\\n\\n wait_for_draw(widget, || {\\n\\n let observer = gtk_observer_new!(widget, connect_button_release_event, |_, _| {\\n\\n Inhibit(false)\\n\\n });\\n\\n let allocation = widget.allocation();\\n\\n mouse_move(widget, allocation.width() / 2, allocation.height() / 2);\\n\\n let mut enigo = Enigo::new();\\n\\n enigo.mouse_click(MouseButton::Left);\\n\\n observer.wait();\\n\\n\\n\\n let observer = gtk_observer_new!(widget, connect_button_release_event, |_, _| {\\n\\n Inhibit(false)\\n\\n });\\n\\n enigo.mouse_click(MouseButton::Left);\\n\\n observer.wait();\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 12,\n \"score\": 194335.44724578207\n },\n {\n \"content\": \"fn emit<MSG>(stream: &Rc<RefCell<_EventStream<MSG>>>, msg: MSG) {\\n\\n if !stream.borrow().locked {\\n\\n let len = stream.borrow().observers.len();\\n\\n for i in 0..len {\\n\\n let observer = stream.borrow().observers[i].clone();\\n\\n observer(&msg);\\n\\n }\\n\\n\\n\\n stream.borrow_mut().events.push_back(msg);\\n\\n }\\n\\n}\\n\\n\\n\\n/// A stream of messages to be used for widget/signal communication and inter-widget communication.\\n\\n/// EventStream cannot be send to another thread. Use a `Channel` `Sender` instead.\\n\\npub struct EventStream<MSG> {\\n\\n source: Source,\\n\\n source_id: Option<SourceId>,\\n\\n _phantom: PhantomData<*mut MSG>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/mod.rs\",\n \"rank\": 13,\n \"score\": 192784.3970550641\n },\n {\n \"content\": \"/// Initialize a component by creating its subscriptions and dispatching the messages from the\\n\\n/// stream.\\n\\npub fn init_component<UPDATE>(stream: &EventStream<UPDATE::Msg>, mut component: UPDATE, relm: &Relm<UPDATE>)\\n\\n where UPDATE: Update + 'static,\\n\\n UPDATE::Msg: DisplayVariant + 'static,\\n\\n{\\n\\n component.subscriptions(relm);\\n\\n stream.set_callback(move |event| {\\n\\n update_component(&mut component, event);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/state/mod.rs\",\n \"rank\": 14,\n \"score\": 192367.2119483123\n },\n {\n \"content\": \"// FIXME: remove when it's in gtk-test.\\n\\npub fn click<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt + IsA<W>>(widget: &W) {\\n\\n wait_for_draw(widget, || {\\n\\n let observer =\\n\\n if let Ok(tool_button) = widget.clone().dynamic_cast::<ToolButton>() {\\n\\n gtk_observer_new!(tool_button, connect_clicked, |_|)\\n\\n }\\n\\n else {\\n\\n gtk_observer_new!(widget, connect_button_press_event, |_, _| {\\n\\n Inhibit(false)\\n\\n })\\n\\n };\\n\\n let allocation = widget.allocation();\\n\\n mouse_move(widget, allocation.width() / 2, allocation.height() / 2);\\n\\n let mut enigo = Enigo::new();\\n\\n enigo.mouse_click(MouseButton::Left);\\n\\n observer.wait();\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 15,\n \"score\": 189308.494187937\n },\n {\n \"content\": \"fn get_msg_model_map(widget: &Widget, map: &mut MsgModelMap) {\\n\\n match widget.widget {\\n\\n Gtk(_) => (),\\n\\n Relm(ref relm_widget) => {\\n\\n for (name, expr) in &relm_widget.messages {\\n\\n let mut visitor = ModelVariableVisitor::new();\\n\\n visitor.visit_expr(&expr);\\n\\n let model_variables = visitor.idents;\\n\\n for var in model_variables {\\n\\n let set = map.entry(var).or_insert_with(HashSet::new);\\n\\n set.insert(Message {\\n\\n expr: expr.clone(),\\n\\n name: name.clone(),\\n\\n widget_name: widget.name.clone(),\\n\\n });\\n\\n }\\n\\n }\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\\n/*\\n\\n * The map maps model variable name to a vector of tuples (widget name, property name).\\n\\n */\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 16,\n \"score\": 189093.6294968522\n },\n {\n \"content\": \"pub fn mouse_move_to<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt + IsA<W>>(widget: &W) {\\n\\n wait_for_draw(widget, || {\\n\\n let allocation = widget.allocation();\\n\\n mouse_move(widget, allocation.width() / 2, allocation.height() / 2);\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 17,\n \"score\": 187483.78052513115\n },\n {\n \"content\": \"fn gen_set_child_prop_calls(widget: &Widget, parent: Option<&Ident>, parent_widget_type: WidgetType,\\n\\n widget_type: WidgetType) -> Vec<TokenStream>\\n\\n{\\n\\n let widget_name = &widget.name;\\n\\n let mut child_properties = vec![];\\n\\n if let Some(parent) = parent {\\n\\n for (&(ref ident, ref key), value) in &widget.child_properties {\\n\\n let property_func = Ident::new(&format!(\\\"set_{}_{}\\\", ident, key), key.span());\\n\\n let parent =\\n\\n if parent_widget_type == IsGtk {\\n\\n quote! {\\n\\n #parent\\n\\n }\\n\\n }\\n\\n else {\\n\\n quote! {\\n\\n #parent.container\\n\\n }\\n\\n };\\n\\n let call =\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 18,\n \"score\": 186886.8263810463\n },\n {\n \"content\": \"// FIXME: don't wait the observer for modifier keys like shift?\\n\\npub fn key_press<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, key: Key) {\\n\\n wait_for_draw(widget, || {\\n\\n let observer = gtk_observer_new!(widget, connect_key_press_event, |_, _| {\\n\\n Inhibit(false)\\n\\n });\\n\\n focus(widget);\\n\\n let mut enigo = Enigo::new();\\n\\n enigo.key_down(gdk_key_to_enigo_key(key));\\n\\n observer.wait();\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 19,\n \"score\": 185726.3910640853\n },\n {\n \"content\": \"pub fn key_release<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, key: Key) {\\n\\n wait_for_draw(widget, || {\\n\\n let observer = gtk_observer_new!(widget, connect_key_release_event, |_, _| {\\n\\n Inhibit(false)\\n\\n });\\n\\n focus(widget);\\n\\n let mut enigo = Enigo::new();\\n\\n enigo.key_up(gdk_key_to_enigo_key(key));\\n\\n observer.wait();\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 20,\n \"score\": 185721.5756192275\n },\n {\n \"content\": \"pub fn enter_keys<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, text: &str) {\\n\\n wait_for_draw(widget, || {\\n\\n focus(widget);\\n\\n let mut enigo = Enigo::new();\\n\\n for char in text.chars() {\\n\\n let observer = gtk_observer_new!(widget, connect_key_release_event, |_, _| {\\n\\n Inhibit(false)\\n\\n });\\n\\n enigo.key_sequence(&char.to_string());\\n\\n observer.wait();\\n\\n }\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 21,\n \"score\": 185721.5756192275\n },\n {\n \"content\": \"pub fn enter_key<W: Clone + IsA<Object> + IsA<Widget> + WidgetExt>(widget: &W, key: Key) {\\n\\n wait_for_draw(widget, || {\\n\\n let observer = gtk_observer_new!(widget, connect_key_release_event, |_, _| {\\n\\n Inhibit(false)\\n\\n });\\n\\n focus(widget);\\n\\n let mut enigo = Enigo::new();\\n\\n enigo.key_click(gdk_key_to_enigo_key(key));\\n\\n observer.wait();\\n\\n\\n\\n wait_for_relm_events();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-test/src/lib.rs\",\n \"rank\": 22,\n \"score\": 185721.5756192275\n },\n {\n \"content\": \"fn update_component<COMPONENT>(component: &mut COMPONENT, event: COMPONENT::Msg)\\n\\n where COMPONENT: Update,\\n\\n{\\n\\n if cfg!(debug_assertions) {\\n\\n let time = SystemTime::now();\\n\\n let debug = event.display_variant();\\n\\n let debug =\\n\\n if debug.len() > 100 {\\n\\n format!(\\\"{}…\\\", &debug[..100])\\n\\n }\\n\\n else {\\n\\n debug.to_string()\\n\\n };\\n\\n component.update(event);\\n\\n if let Ok(duration) = time.elapsed() {\\n\\n let ms = duration.subsec_nanos() as u64 / 1_000_000 + duration.as_secs() * 1000;\\n\\n if ms >= 16 {\\n\\n log::warn!(\\\"The update function was slow to execute for message {}: {}ms\\\", debug, ms);\\n\\n }\\n\\n }\\n\\n }\\n\\n else {\\n\\n component.update(event)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/state/mod.rs\",\n \"rank\": 23,\n \"score\": 184797.2935654273\n },\n {\n \"content\": \"fn gen_set_child_prop_calls(widget: &Widget) -> Option<ImplItem> {\\n\\n let mut tokens = quote! {};\\n\\n let widget_name = &widget.name;\\n\\n for (&(ref ident, ref key), value) in &widget.child_properties {\\n\\n let property_func = Ident::new(&format!(\\\"set_{}_{}\\\", ident, key), key.span());\\n\\n tokens = quote_spanned! { widget_name.span() =>\\n\\n #tokens\\n\\n parent.#property_func(&self.widgets.#widget_name, #value);\\n\\n };\\n\\n }\\n\\n if !widget.child_properties.is_empty() {\\n\\n Some(block_to_impl_item(quote_spanned! { widget_name.span() =>\\n\\n fn on_add<W: ::relm::IsA<::gtk::Widget> + ::relm::IsA<::relm::Object>>(&self, parent: W) {\\n\\n let parent: gtk::Box = ::relm::Cast::downcast(::relm::Cast::upcast::<::gtk::Widget>(parent))\\n\\n .expect(\\\"the parent of a widget with child properties must be a gtk::Box\\\");\\n\\n #tokens\\n\\n }\\n\\n }))\\n\\n }\\n\\n else {\\n\\n None\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 24,\n \"score\": 182554.52080909925\n },\n {\n \"content\": \"pub fn gen(name: &Ident, widgets: &[Widget], driver: &mut Driver) -> Gen {\\n\\n let mut generator = Generator::new(driver);\\n\\n let mut widget_tokens = quote! {};\\n\\n for (index, widget) in widgets.iter().enumerate() {\\n\\n // Only show the first item as the following could be non-widget like a gtk::Gesture.\\n\\n let tokens = generator.widget(widget, None, IsGtk, index == 0);\\n\\n widget_tokens = quote! {\\n\\n #widget_tokens #tokens\\n\\n };\\n\\n }\\n\\n\\n\\n let driver = generator.driver.take().expect(\\\"driver\\\");\\n\\n let idents: Vec<_> = driver.widgets.keys().collect();\\n\\n let root_widget_name = &driver.root_widget.as_ref().expect(\\\"root_widget is None\\\");\\n\\n let component_names: Vec<_> = generator.widget_names.iter()\\n\\n .filter(|ident| generator.relm_components.contains_key(ident))\\n\\n .collect();\\n\\n\\n\\n let component_widgets: Vec<_> = generator.widget_names.iter()\\n\\n .filter(|ident| generator.relm_components.contains_key(ident) && ident != root_widget_name)\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 25,\n \"score\": 181939.39823851606\n },\n {\n \"content\": \"#[proc_macro_derive(Msg)]\\n\\npub fn msg(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast: Item = parse(input).expect(\\\"msg > parse failed\\\");\\n\\n let gen = impl_msg(&ast, Ident::new(\\\"relm\\\", ast.span()));\\n\\n gen.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/lib.rs\",\n \"rank\": 26,\n \"score\": 181492.09901412134\n },\n {\n \"content\": \"fn add_model_param(model_fn: &mut ImplItem, model_param_type: &mut Option<ImplItem>) {\\n\\n let span = model_fn.span();\\n\\n if let Method(ImplItemMethod { ref mut sig, .. }) = *model_fn {\\n\\n let len = sig.inputs.len();\\n\\n if len == 0 || len == 1 {\\n\\n let type_tokens = quote_spanned! { span =>\\n\\n &::relm::Relm<Self>\\n\\n };\\n\\n let ty: Type = parse(type_tokens.into()).expect(\\\"Relm type\\\");\\n\\n let input: FnArg = parse(quote! { _: #ty }.into()).expect(\\\"wild arg\\\");\\n\\n sig.inputs.insert(0, input);\\n\\n if len == 0 {\\n\\n let input: FnArg = parse(quote! { _: () }.into()).expect(\\\"wild arg\\\");\\n\\n sig.inputs.push(input);\\n\\n }\\n\\n }\\n\\n if let Some(&Typed(PatType { ref ty, .. })) = sig.inputs.iter().nth(1) {\\n\\n *model_param_type = Some(block_to_impl_item(quote! {\\n\\n type ModelParam = #ty;\\n\\n }));\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 27,\n \"score\": 177950.57935018194\n },\n {\n \"content\": \"type Callback<MSG> = Rc<RefCell<Option<Box<dyn FnMut(MSG)>>>>;\\n\\n\\n\",\n \"file_path\": \"src/core/mod.rs\",\n \"rank\": 28,\n \"score\": 177519.93011464758\n },\n {\n \"content\": \"/// Trait to implement to manage widget's events.\\n\\npub trait Widget\\n\\n where Self: Update,\\n\\n Self::Root: Clone + IsA<Object> + IsA<gtk::Widget>,\\n\\n{\\n\\n /// The type of the root widget.\\n\\n type Root;\\n\\n\\n\\n /// Update the view after it is initially created.\\n\\n /// This method is only useful when using the `#[widget]` attribute, because when not using it,\\n\\n /// you can use the [`view()`](trait.Widget.html#tymethod.view) method instead.\\n\\n fn init_view(&mut self) {\\n\\n }\\n\\n\\n\\n /// Method called when the widget is added to its parent.\\n\\n /// This is currently only used to set the child properties of a widget as relm widget could\\n\\n /// have child properties and we don't know its parent when it is defined. Thus, we call\\n\\n /// on_add() when it is added to its parent to set the child properties.\\n\\n fn on_add<W: IsA<gtk::Widget> + IsA<Object>>(&self, _parent: W) {\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/widget.rs\",\n \"rank\": 29,\n \"score\": 168624.71905487753\n },\n {\n \"content\": \"pub fn gen_widget(input: TokenStream) -> TokenStream {\\n\\n let mut driver = Driver::new();\\n\\n driver.gen_widget(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 30,\n \"score\": 165672.22448452725\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n vbox: gtk::EventBox,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/relm-root.rs\",\n \"rank\": 31,\n \"score\": 165174.28054422047\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n entry: Entry,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/key-events.rs\",\n \"rank\": 32,\n \"score\": 165086.00695577828\n },\n {\n \"content\": \"#[derive(Clone, Copy, PartialEq)]\\n\\nenum WidgetType {\\n\\n IsGtk,\\n\\n IsRelm,\\n\\n}\\n\\n\\n\\npub struct Gen {\\n\\n pub view: TokenStream,\\n\\n pub relm_widgets: HashMap<Ident, Path>,\\n\\n pub relm_components: HashMap<Ident, Path>,\\n\\n pub streams_to_save: HashSet<Ident>,\\n\\n pub container_impl: TokenStream,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 33,\n \"score\": 164966.14325654096\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum TextMsg {\\n\\n Change,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multiple-widgets.rs\",\n \"rank\": 34,\n \"score\": 164839.98467267008\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum CounterMsg {\\n\\n Decrement,\\n\\n Increment,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multiple-widgets.rs\",\n \"rank\": 35,\n \"score\": 164839.98467267008\n },\n {\n \"content\": \"/// Trait implemented by the generator to ease the creation of tests of relm widgets using the\\n\\n/// view! macro.\\n\\npub trait WidgetTest : Widget {\\n\\n /// Represents the structure holding all the `StreamHandle`s. Useful for tests.\\n\\n type Streams;\\n\\n /// Represents the structure holding all the widgets. Useful for tests.\\n\\n type Widgets;\\n\\n\\n\\n /// Get the structure containing all the `StreamHandle`s. Useful for tests.\\n\\n fn get_streams(&self) -> Self::Streams;\\n\\n\\n\\n /// Get the structure containing all the widgets. Useful for tests.\\n\\n fn get_widgets(&self) -> Self::Widgets;\\n\\n}\\n\",\n \"file_path\": \"src/widget.rs\",\n \"rank\": 36,\n \"score\": 164703.51831244573\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n MinusToggle,\\n\\n PlusToggle,\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/checkboxes.rs\",\n \"rank\": 37,\n \"score\": 163753.7896746603\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Decrement,\\n\\n Increment,\\n\\n Quit,\\n\\n}\\n\\n\\n\\n// Create the structure that holds the widgets used in the view.\\n\",\n \"file_path\": \"relm-examples/examples/buttons.rs\",\n \"rank\": 38,\n \"score\": 163753.7896746603\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Decrement,\\n\\n Increment,\\n\\n Quit,\\n\\n}\\n\\n\\n\\n// Create the structure that holds the widgets used in the view.\\n\",\n \"file_path\": \"relm-examples/examples/glade.rs\",\n \"rank\": 39,\n \"score\": 163753.7896746603\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n // …\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/readme.rs\",\n \"rank\": 40,\n \"score\": 163753.7896746603\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Quit,\\n\\n Tick,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/clock.rs\",\n \"rank\": 41,\n \"score\": 163753.7896746603\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n TextChange(String),\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/communication.rs\",\n \"rank\": 42,\n \"score\": 163753.7896746603\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nenum Msg {\\n\\n Clock,\\n\\n Decrement,\\n\\n Increment,\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/core.rs\",\n \"rank\": 43,\n \"score\": 163749.04487182817\n },\n {\n \"content\": \"enum IdentOrEventValue {\\n\\n MessageIdent(EventValueReturn, bool),\\n\\n MessageEventValue(Ident, EventValueReturn, bool),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/parser.rs\",\n \"rank\": 44,\n \"score\": 162906.9155523627\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum CounterMsg {\\n\\n Decrement,\\n\\n Increment,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multi-generic-widget.rs\",\n \"rank\": 45,\n \"score\": 162054.15040786224\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Decrement,\\n\\n Increment,\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/model-param.rs\",\n \"rank\": 46,\n \"score\": 161708.94650657196\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n ItemSelect,\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/tree-view.rs\",\n \"rank\": 47,\n \"score\": 161708.94650657196\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Decrement,\\n\\n Increment,\\n\\n Quit,\\n\\n}\\n\\n\\n\\n// Create the structure that holds the widgets used in the view.\\n\",\n \"file_path\": \"relm-examples/examples/glade_gladis.rs\",\n \"rank\": 48,\n \"score\": 161708.94650657196\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum Msg {\\n\\n Change,\\n\\n Quit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/text-fields.rs\",\n \"rank\": 49,\n \"score\": 161708.94650657196\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn widget(_attributes: proc_macro::TokenStream, input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast: Item = parse(input).expect(\\\"widget.parse failed\\\");\\n\\n let tokens = quote! {\\n\\n #ast\\n\\n };\\n\\n let expanded = gen_widget(tokens);\\n\\n expanded.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/lib.rs\",\n \"rank\": 50,\n \"score\": 161397.76072084962\n },\n {\n \"content\": \"struct EventValueParser {\\n\\n value_return: EventValueReturn,\\n\\n use_self: bool,\\n\\n}\\n\\n\\n\\nimpl Parse for EventValueParser {\\n\\n fn parse(input: ParseStream) -> Result<Self> {\\n\\n let tag = Tag::parse(input, \\\"return\\\");\\n\\n let lookahead = input.lookahead1();\\n\\n if tag.is_ok() {\\n\\n let value = Value::parse(input)?;\\n\\n Ok(EventValueParser {\\n\\n value_return: CallReturn(value.value),\\n\\n use_self: value.use_self,\\n\\n })\\n\\n }\\n\\n else if lookahead.peek(token::Paren) {\\n\\n let content;\\n\\n let _parens = parenthesized!(content in input);\\n\\n let value1: Value = content.parse()?;\\n\",\n \"file_path\": \"relm-derive/src/gen/parser.rs\",\n \"rank\": 51,\n \"score\": 160279.14423855877\n },\n {\n \"content\": \"fn gen_event_metadata(event: &Event) -> TokenStream {\\n\\n if let CurrentWidget(CallReturn(_)) = event.value {\\n\\n quote! {\\n\\n return\\n\\n }\\n\\n }\\n\\n else {\\n\\n quote! {}\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 52,\n \"score\": 159866.54580038693\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum CounterMsg<T> {\\n\\n Decrement,\\n\\n Increment(T),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/generic-widget.rs\",\n \"rank\": 53,\n \"score\": 159355.1690948694\n },\n {\n \"content\": \"/// Create a new relm widget with `model_param` as initialization value.\\n\\nfn create_widget<WIDGET>(model_param: WIDGET::ModelParam)\\n\\n -> (Component<WIDGET>, WIDGET, Relm<WIDGET>)\\n\\n where WIDGET: Widget + 'static,\\n\\n WIDGET::Msg: DisplayVariant + 'static,\\n\\n{\\n\\n let stream = EventStream::new();\\n\\n\\n\\n let relm = Relm::new(&stream);\\n\\n let model = WIDGET::model(&relm, model_param);\\n\\n let mut widget = WIDGET::view(&relm, model);\\n\\n widget.init_view();\\n\\n\\n\\n let root = widget.root();\\n\\n (Component::new(stream, root), widget, relm)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 54,\n \"score\": 157785.8484285975\n },\n {\n \"content\": \"struct VBox {\\n\\n event_box: EventBox,\\n\\n vbox: gtk::Box,\\n\\n}\\n\\n\\n\\nimpl Container for VBox {\\n\\n type Container = gtk::Box;\\n\\n type Containers = ();\\n\\n\\n\\n fn container(&self) -> &Self::Container {\\n\\n &self.vbox\\n\\n }\\n\\n\\n\\n fn other_containers(&self) -> () {\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Update for VBox {\\n\\n type Model = ();\\n\\n type ModelParam = ();\\n\",\n \"file_path\": \"relm-examples/tests/relm-root.rs\",\n \"rank\": 55,\n \"score\": 157664.08564824326\n },\n {\n \"content\": \"fn add(values: Vec<f64>) -> Result<f64, String> {\\n\\n if values.len() != 2 {\\n\\n Err(\\\"add takes exactly two arguments\\\".to_string())\\n\\n } else {\\n\\n Ok(values.iter().sum())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/7gui/7_cells/src/model/operations.rs\",\n \"rank\": 56,\n \"score\": 157182.12418698345\n },\n {\n \"content\": \"fn create_widget_test<WIDGET>(model_param: WIDGET::ModelParam) -> (Component<WIDGET>, WIDGET::Streams, WIDGET::Widgets)\\n\\n where WIDGET: Widget + WidgetTest + 'static,\\n\\n WIDGET::Msg: DisplayVariant + 'static,\\n\\n{\\n\\n let (component, widget, relm) = create_widget::<WIDGET>(model_param);\\n\\n let widgets = widget.get_widgets();\\n\\n let streams = widget.get_streams();\\n\\n init_component::<WIDGET>(component.owned_stream(), widget, &relm);\\n\\n (component, streams, widgets)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 57,\n \"score\": 155505.0385516247\n },\n {\n \"content\": \"type InitTestComponents<WIDGET> = (Component<WIDGET>, <WIDGET as WidgetTest>::Streams, <WIDGET as WidgetTest>::Widgets);\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 58,\n \"score\": 154882.24964094587\n },\n {\n \"content\": \"fn gen_widget_ident(widget: &Widget) -> (TokenStream, Span) {\\n\\n match widget.widget {\\n\\n Gtk(ref gtk_widget) => {\\n\\n if let Some(Type::Path(TypePath { path: Path { ref segments, .. }, .. })) = gtk_widget.relm_name {\\n\\n let ident = &segments[0].ident;\\n\\n (quote! {\\n\\n #ident\\n\\n }, ident.span())\\n\\n }\\n\\n else {\\n\\n panic!(\\\"relm name should be a Path\\\");\\n\\n }\\n\\n },\\n\\n Relm(_) => {\\n\\n let path = &widget.typ;\\n\\n (quote! {\\n\\n #path\\n\\n }, path.span())\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 59,\n \"score\": 153891.93297495003\n },\n {\n \"content\": \"struct SourceData<MSG> {\\n\\n callback: Callback<MSG>,\\n\\n stream: Rc<RefCell<_EventStream<MSG>>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/mod.rs\",\n \"rank\": 60,\n \"score\": 153805.99672481668\n },\n {\n \"content\": \"struct ChannelData<MSG> {\\n\\n callback: Box<dyn FnMut(MSG)>,\\n\\n peeked_value: Option<MSG>,\\n\\n receiver: Receiver<MSG>,\\n\\n}\\n\\n\\n\\n/// A wrapper over a `std::sync::mpsc::Sender` to wakeup the glib event loop when sending a\\n\\n/// message.\\n\\npub struct Sender<MSG> {\\n\\n sender: mpsc::Sender<MSG>,\\n\\n}\\n\\n\\n\\nimpl<MSG> Clone for Sender<MSG> {\\n\\n fn clone(&self) -> Self {\\n\\n Self {\\n\\n sender: self.sender.clone(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/mod.rs\",\n \"rank\": 61,\n \"score\": 153805.99672481668\n },\n {\n \"content\": \"fn gen_construct_widget(widget: &Widget, gtk_widget: &GtkWidget) -> TokenStream {\\n\\n let struct_name = &widget.typ;\\n\\n\\n\\n let properties_count = gtk_widget.construct_properties.len() as u32;\\n\\n let mut values = vec![];\\n\\n let mut parameters = vec![];\\n\\n for (key, value) in gtk_widget.construct_properties.iter() {\\n\\n let mut remover = Transformer::new(MODEL_IDENT);\\n\\n let value = remover.fold_expr(value.clone());\\n\\n let key = key.to_string();\\n\\n values.push(quote_spanned! { struct_name.span() =>\\n\\n ::relm::ToValue::to_value(&#value)\\n\\n });\\n\\n let index = parameters.len();\\n\\n parameters.push(quote_spanned! { struct_name.span() =>\\n\\n ::relm::GParameter {\\n\\n name: ::relm::ToGlibPtr::to_glib_full(#key),\\n\\n value: ::std::ptr::read(::relm::ToGlibPtr::to_glib_none(&values[#index]).0),\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 62,\n \"score\": 152992.18713843983\n },\n {\n \"content\": \"/// Trait to implement relm container widget.\\n\\npub trait Container: Widget {\\n\\n /// The type of the containing widget, i.e. where the child widgets will be added.\\n\\n type Container: Clone + IsA<gtk::Container> + IsA<Object> + IsA<gtk::Widget>;\\n\\n /// Type to contain the additional container widgets.\\n\\n // TODO: put that in yet another trait?\\n\\n type Containers: Clone;\\n\\n\\n\\n /// Add a relm widget to this container.\\n\\n /// Return the widget that will be send to Widget::on_add().\\n\\n fn add_widget<WIDGET: Widget>(container: &ContainerComponent<Self>, component: &Component<WIDGET>)\\n\\n -> gtk::Container\\n\\n {\\n\\n container.container.add(component.widget());\\n\\n container.container.clone().upcast()\\n\\n }\\n\\n\\n\\n /// Get the containing widget, i.e. the widget where the children will be added.\\n\\n fn container(&self) -> &Self::Container;\\n\\n\\n\\n /// Get additional container widgets.\\n\\n /// This is useful to create a multi-container.\\n\\n fn other_containers(&self) -> Self::Containers;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/container.rs\",\n \"rank\": 63,\n \"score\": 152576.7797814074\n },\n {\n \"content\": \"fn get_return_type(sig: Signature) -> Type {\\n\\n if let ReturnType::Type(_, ty) = sig.output {\\n\\n *ty\\n\\n }\\n\\n else {\\n\\n Type::Tuple(syn::TypeTuple {\\n\\n paren_token: syn::token::Paren::default(),\\n\\n elems: syn::punctuated::Punctuated::new()\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 64,\n \"score\": 146625.86868395132\n },\n {\n \"content\": \"type ChildEvents = HashMap<(Ident, Ident), Event>;\\n\",\n \"file_path\": \"relm-derive/src/gen/parser.rs\",\n \"rank\": 65,\n \"score\": 145233.8620509262\n },\n {\n \"content\": \"fn get_second_param_type(sig: &Signature) -> Type {\\n\\n if let Typed(PatType { ref ty, .. }) = sig.inputs[1] {\\n\\n *ty.clone()\\n\\n }\\n\\n else {\\n\\n panic!(\\\"Unexpected `(unknown)`, expecting Typed Type\\\"/*, sig.decl.inputs[1]*/); // TODO\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 66,\n \"score\": 145198.83378222882\n },\n {\n \"content\": \"/// Apply the operation with the given name to the values.\\n\\npub fn operate(function: &str, values: Vec<f64>) -> Result<f64, String> {\\n\\n match function {\\n\\n \\\"add\\\" => add(values),\\n\\n \\\"sub\\\" => sub(values),\\n\\n \\\"div\\\" => div(values),\\n\\n \\\"mul\\\" => mul(values),\\n\\n \\\"sum\\\" => sum(values),\\n\\n \\\"prod\\\" => prod(values),\\n\\n _ => Err(format!(\\\"Unknown function: {}\\\", function)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/7gui/7_cells/src/model/operations.rs\",\n \"rank\": 67,\n \"score\": 144024.25930046043\n },\n {\n \"content\": \"fn get_properties_model_map(widget: &Widget, map: &mut PropertyModelMap) {\\n\\n match widget.widget {\\n\\n Gtk(_) => get_map(widget, map, false),\\n\\n Relm(_) => get_map(widget, map, true),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 68,\n \"score\": 141866.69698322087\n },\n {\n \"content\": \"fn impl_msg(ast: &Item, krate: Ident) -> TokenStream {\\n\\n let display = derive_display_variant(ast, &krate);\\n\\n let into_option = derive_into_option(ast, &krate);\\n\\n\\n\\n quote! {\\n\\n #display\\n\\n #into_option\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/lib.rs\",\n \"rank\": 69,\n \"score\": 139419.74929765295\n },\n {\n \"content\": \"fn gen_other_containers(generator: &Generator, widget_type: &TokenStream, widget_ident_span: Span) ->\\n\\n (TokenStream, TokenStream, TokenStream)\\n\\n{\\n\\n if generator.container_names.len() > 1 {\\n\\n let containers_ident = Ident::new(&format!(\\\"{}Containers\\\", widget_type), widget_ident_span);\\n\\n let mut names = vec![];\\n\\n let mut types = vec![];\\n\\n let mut values = vec![];\\n\\n for &(ref name, ref typ) in generator.container_names.values() {\\n\\n names.push(name.clone());\\n\\n let original_type = typ.clone();\\n\\n let typ =\\n\\n if typ.segments.len() > 1 {\\n\\n // GTK+ widget\\n\\n values.push(name.clone());\\n\\n quote! { #original_type }\\n\\n }\\n\\n else {\\n\\n // Relm widget\\n\\n values.push(Ident::new(&format!(\\\"{}\\\", name), name.span()));\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 70,\n \"score\": 138342.3205260401\n },\n {\n \"content\": \"fn get_name(typ: &Type) -> Ident {\\n\\n if let Type::Path(TypePath { ref path, .. }) = *typ {\\n\\n let mut parts = vec![];\\n\\n for segment in &path.segments {\\n\\n parts.push(segment.ident.to_string());\\n\\n }\\n\\n Ident::new(&parts.join(\\\"::\\\"), typ.span())\\n\\n }\\n\\n else {\\n\\n panic!(\\\"Expected Path\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 71,\n \"score\": 137277.7637938799\n },\n {\n \"content\": \"fn get_map(widget: &Widget, map: &mut PropertyModelMap, is_relm: bool) {\\n\\n for (name, expr) in &widget.properties {\\n\\n let mut visitor = ModelVariableVisitor::new();\\n\\n visitor.visit_expr(&expr);\\n\\n let model_variables = visitor.idents;\\n\\n for var in model_variables {\\n\\n let set = map.entry(var).or_insert_with(HashSet::new);\\n\\n set.insert(Property {\\n\\n expr: expr.clone(),\\n\\n is_relm_widget: is_relm,\\n\\n name: name.clone(),\\n\\n widget_name: widget.name.clone(),\\n\\n });\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/mod.rs\",\n \"rank\": 72,\n \"score\": 136820.3651228164\n },\n {\n \"content\": \"pub fn dummy_ident(ident: &str) -> Ident {\\n\\n Ident::new(ident, Span::call_site())\\n\\n}\\n\",\n \"file_path\": \"relm-derive/src/gen/parser.rs\",\n \"rank\": 73,\n \"score\": 131595.40162554718\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n counter1: gtk::Box,\\n\\n counter2: gtk::Box,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/generic-widget.rs\",\n \"rank\": 74,\n \"score\": 131057.33922348343\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n counter1: gtk::Box,\\n\\n counter2: gtk::Box,\\n\\n text: gtk::Box,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multiple-widgets.rs\",\n \"rank\": 75,\n \"score\": 131057.33922348343\n },\n {\n \"content\": \"pub fn gen_where_clause(generics: &Generics) -> TokenStream {\\n\\n let where_clause = &generics.where_clause;\\n\\n // TODO: check that it is okay (vs what we did before).\\n\\n quote! {\\n\\n #where_clause\\n\\n }\\n\\n /*if generics.where_clause.predicates.is_empty() {\\n\\n quote! {\\n\\n }\\n\\n }\\n\\n else {\\n\\n let where_clause = &generics.where_clause;\\n\\n quote! {\\n\\n #where_clause\\n\\n }\\n\\n }*/\\n\\n}\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 76,\n \"score\": 130030.6003975882\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n counter1: <Counter<i32, i64> as Widget>::Root,\\n\\n counter2: gtk::Box,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/multi-generic-widget.rs\",\n \"rank\": 77,\n \"score\": 129362.35099605\n },\n {\n \"content\": \"/// Create a new relm widget without adding it to an existing widget.\\n\\n/// This is useful when a relm widget is at the root of another relm widget.\\n\\npub fn create_component<CHILDWIDGET>(model_param: CHILDWIDGET::ModelParam)\\n\\n -> Component<CHILDWIDGET>\\n\\n where CHILDWIDGET: Widget + 'static,\\n\\n CHILDWIDGET::Msg: DisplayVariant + 'static,\\n\\n{\\n\\n let (component, widget, child_relm) = create_widget::<CHILDWIDGET>(model_param);\\n\\n init_component::<CHILDWIDGET>(component.owned_stream(), widget, &child_relm);\\n\\n component\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 78,\n \"score\": 128589.50413755835\n },\n {\n \"content\": \"/// Create a new relm container widget without adding it to an existing widget.\\n\\n/// This is useful when a relm widget is at the root of another relm widget.\\n\\npub fn create_container<CHILDWIDGET>(model_param: CHILDWIDGET::ModelParam)\\n\\n -> ContainerComponent<CHILDWIDGET>\\n\\n where CHILDWIDGET: Container + Widget + 'static,\\n\\n CHILDWIDGET::Msg: DisplayVariant + 'static,\\n\\n{\\n\\n let (component, widget, child_relm) = create_widget::<CHILDWIDGET>(model_param);\\n\\n let container = widget.container().clone();\\n\\n let containers = widget.other_containers();\\n\\n init_component::<CHILDWIDGET>(component.owned_stream(), widget, &child_relm);\\n\\n ContainerComponent::new(component, container, containers)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 79,\n \"score\": 128589.39342632776\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum CheckMsg {\\n\\n Check,\\n\\n Toggle,\\n\\n Uncheck,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/checkboxes.rs\",\n \"rank\": 80,\n \"score\": 124686.26900772189\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum TextMsg {\\n\\n Change(glib::GString),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/communication.rs\",\n \"rank\": 81,\n \"score\": 124686.26900772189\n },\n {\n \"content\": \"#[derive(Msg)]\\n\\nenum CounterMsg {\\n\\n Decrement,\\n\\n Increment,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/communication.rs\",\n \"rank\": 82,\n \"score\": 124686.26900772189\n },\n {\n \"content\": \"pub fn new_source<T: SourceFuncs>(data: T) -> Source {\\n\\n unsafe {\\n\\n let mut funcs: GSourceFuncs = mem::zeroed();\\n\\n funcs.prepare = Some(prepare::<T>);\\n\\n funcs.check = Some(check::<T>);\\n\\n funcs.dispatch = Some(dispatch::<T>);\\n\\n funcs.finalize = Some(finalize::<T>);\\n\\n let mut funcs = Box::new(funcs);\\n\\n let source = g_source_new(&mut *funcs, mem::size_of::<SourceData<T>>() as u32);\\n\\n ptr::write(&mut (*(source as *mut SourceData<T>)).data, data);\\n\\n ptr::write(&mut (*(source as *mut SourceData<T>)).funcs, funcs);\\n\\n from_glib_full(source)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/source.rs\",\n \"rank\": 83,\n \"score\": 124304.66471746951\n },\n {\n \"content\": \"pub fn source_get<T: SourceFuncs>(source: &Source) -> &T {\\n\\n unsafe { &( *(source.to_glib_none().0 as *const SourceData<T>) ).data }\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn check<T: SourceFuncs>(source: *mut GSource) -> c_int {\\n\\n let object = source as *mut SourceData<T>;\\n\\n bool_to_int((*object).data.check())\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn dispatch<T: SourceFuncs>(source: *mut GSource, _callback: GSourceFunc, _user_data: *mut libc::c_void)\\n\\n -> c_int\\n\\n{\\n\\n let object = source as *mut SourceData<T>;\\n\\n bool_to_int((*object).data.dispatch())\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn finalize<T: SourceFuncs>(source: *mut GSource) {\\n\\n // TODO: needs a bomb to abort on panic\\n\\n let source = source as *mut SourceData<T>;\\n\\n ptr::read(&(*source).funcs);\\n\",\n \"file_path\": \"src/core/source.rs\",\n \"rank\": 84,\n \"score\": 124304.66471746951\n },\n {\n \"content\": \"// There will be several widgets involved in this example, but this struct\\n\\n// will act as a container just for the widgets that we will be updating.\\n\\nstruct Widgets {\\n\\n clock_label: Label,\\n\\n counter_label: Label,\\n\\n}\\n\\n\\n\\n// This enum holds the various messages that will be passed between our\\n\\n// widgets. Note that we aren't deriving `Msg` because this example uses\\n\\n// the `core` module, which is the basic event-handling library that\\n\\n// `relm` depends on.\\n\",\n \"file_path\": \"relm-examples/examples/core.rs\",\n \"rank\": 85,\n \"score\": 123276.23016805618\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n counter1: gtk::Box,\\n\\n counter2: gtk::Box,\\n\\n dec_button: Button,\\n\\n label: Label,\\n\\n text: gtk::Box,\\n\\n window: Window,\\n\\n}\\n\\n\\n\\nimpl Update for Win {\\n\\n type Model = Model;\\n\\n type ModelParam = ();\\n\\n type Msg = Msg;\\n\\n\\n\\n fn model(_: &Relm<Self>, _: ()) -> Model {\\n\\n Model {\\n\\n counter: 0,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/communication.rs\",\n \"rank\": 86,\n \"score\": 123266.57202037793\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n window: Window,\\n\\n inc_button: gtk::Button,\\n\\n dec_button: gtk::Button,\\n\\n label: Label,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/container.rs\",\n \"rank\": 87,\n \"score\": 123266.57202037793\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n minus_button: gtk::CheckButton,\\n\\n plus_button: gtk::CheckButton,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/checkboxes.rs\",\n \"rank\": 88,\n \"score\": 123266.57202037793\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n counter_label: Label,\\n\\n minus_button: Button,\\n\\n plus_button: Button,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/glade.rs\",\n \"rank\": 89,\n \"score\": 123266.57202037793\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Widgets {\\n\\n counter_label: Label,\\n\\n minus_button: Button,\\n\\n plus_button: Button,\\n\\n window: Window,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/examples/buttons.rs\",\n \"rank\": 90,\n \"score\": 123266.57202037793\n },\n {\n \"content\": \"/// Extension trait for GTK+ containers to add and remove relm `Widget`s.\\n\\npub trait ContainerWidget {\\n\\n /// Add a relm `Container` to the current GTK+ container.\\n\\n ///\\n\\n /// # Note\\n\\n ///\\n\\n /// The returned `ContainerComponent` must be stored in a `Widget`. If it is not stored, a\\n\\n /// communication receiver will be droped which will cause events to be ignored for this\\n\\n /// widget.\\n\\n fn add_container<CHILDWIDGET>(&self, model_param: CHILDWIDGET::ModelParam)\\n\\n -> ContainerComponent<CHILDWIDGET>\\n\\n where CHILDWIDGET: Container + Widget + 'static,\\n\\n CHILDWIDGET::Msg: DisplayVariant + 'static,\\n\\n CHILDWIDGET::Root: IsA<gtk::Widget> + IsA<Object> + WidgetExt;\\n\\n\\n\\n /// Add a relm `Widget` to the current GTK+ container.\\n\\n ///\\n\\n /// # Note\\n\\n ///\\n\\n /// The returned `Component` must be stored in a `Widget`. If it is not stored, a communication\\n\\n /// receiver will be droped which will cause events to be ignored for this widget.\\n\",\n \"file_path\": \"src/container.rs\",\n \"rank\": 91,\n \"score\": 122978.97870499137\n },\n {\n \"content\": \"fn main() {\\n\\n Win::run(()).expect(\\\"Win::run failed\\\");\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use gtk::prelude::{ButtonExt, LabelExt};\\n\\n\\n\\n use gtk_test::{assert_label, assert_text};\\n\\n use relm_test::click;\\n\\n\\n\\n use crate::Win;\\n\\n\\n\\n #[test]\\n\\n fn label_change() {\\n\\n let (_component, _, widgets) = relm::init_test::<Win>(()).expect(\\\"init_test failed\\\");\\n\\n let inc_button = &widgets.inc_button;\\n\\n let dec_button = &widgets.dec_button;\\n\\n let label = &widgets.label;\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/include.rs\",\n \"rank\": 92,\n \"score\": 122871.37508782223\n },\n {\n \"content\": \"fn gen_add_widget_method(container_names: &HashMap<Option<String>, (Ident, Path)>) -> TokenStream {\\n\\n if container_names.len() > 1 {\\n\\n let span = container_names.values().next().expect(\\\"at least one container name\\\").0.span();\\n\\n let mut default_container = quote! {};\\n\\n let mut other_containers = quote! {};\\n\\n for (parent_id, &(ref name, _)) in container_names {\\n\\n if parent_id.is_none() {\\n\\n default_container = quote_spanned! { span =>\\n\\n ::gtk::prelude::ContainerExt::add(&container.container, widget.widget());\\n\\n ::relm::Cast::upcast(container.container.clone())\\n\\n };\\n\\n }\\n\\n else if other_containers.is_empty() {\\n\\n other_containers = quote_spanned! { span =>\\n\\n if WIDGET::parent_id() == Some(#parent_id) {\\n\\n ::gtk::prelude::ContainerExt::add(&container.containers.#name, widget.widget());\\n\\n ::relm::Cast::upcast(container.containers.#name.clone())\\n\\n }\\n\\n };\\n\\n }\\n\",\n \"file_path\": \"relm-derive/src/gen/generator.rs\",\n \"rank\": 93,\n \"score\": 122195.18717476827\n },\n {\n \"content\": \"struct Value {\\n\\n value: Expr,\\n\\n use_self: bool,\\n\\n}\\n\\n\\n\\nimpl Parse for Value {\\n\\n fn parse(input: ParseStream) -> Result<Self> {\\n\\n let expr = Expr::parse(input)?;\\n\\n let use_self = expr_use_self(&expr);\\n\\n Ok(Value {\\n\\n value: expr,\\n\\n use_self,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-derive/src/gen/parser.rs\",\n \"rank\": 94,\n \"score\": 122160.2557125601\n },\n {\n \"content\": \"struct Components {\\n\\n _vbox: Component<MyVBox>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/relm-root.rs\",\n \"rank\": 95,\n \"score\": 122107.84335093459\n },\n {\n \"content\": \"struct Button {\\n\\n button: gtk::Button,\\n\\n}\\n\\n\\n\\nimpl Update for Button {\\n\\n type Model = ();\\n\\n type ModelParam = ();\\n\\n type Msg = ();\\n\\n\\n\\n fn model(_: &Relm<Self>, _: ()) -> () {\\n\\n }\\n\\n\\n\\n fn update(&mut self, _msg: ()) {\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Widget for Button {\\n\\n type Root = gtk::Button;\\n\\n\\n\\n fn root(&self) -> gtk::Button {\\n\",\n \"file_path\": \"relm-examples/tests/relm-root.rs\",\n \"rank\": 96,\n \"score\": 122107.84335093459\n },\n {\n \"content\": \"struct Win {\\n\\n _components: Components,\\n\\n widgets: Widgets,\\n\\n}\\n\\n\\n\\nimpl Update for Win {\\n\\n type Model = ();\\n\\n type ModelParam = ();\\n\\n type Msg = Msg;\\n\\n\\n\\n fn model(_: &Relm<Self>, _: ()) -> () {\\n\\n }\\n\\n\\n\\n fn update(&mut self, event: Msg) {\\n\\n match event {\\n\\n Quit => gtk::main_quit(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"relm-examples/tests/relm-root.rs\",\n \"rank\": 97,\n \"score\": 122107.84335093459\n },\n {\n \"content\": \"struct Win {\\n\\n model: Model,\\n\\n widgets: Widgets,\\n\\n}\\n\\n\\n\\nimpl Update for Win {\\n\\n type Model = Model;\\n\\n type ModelParam = ();\\n\\n type Msg = Msg;\\n\\n\\n\\n fn model(_relm: &Relm<Self>, _: ()) -> Model {\\n\\n Model {\\n\\n press_count: Rc::new(Cell::new(0)),\\n\\n }\\n\\n }\\n\\n\\n\\n fn update(&mut self, event: Msg) {\\n\\n match event {\\n\\n KeyPress => (),\\n\\n Press => {\\n\",\n \"file_path\": \"relm-examples/tests/key-events.rs\",\n \"rank\": 98,\n \"score\": 122019.56976249242\n },\n {\n \"content\": \"#[derive(PartialEq)]\\n\\nenum SaveWidget {\\n\\n DontSave,\\n\\n Save,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum EventValueReturn {\\n\\n CallReturn(Expr),\\n\\n Return(Box<(Expr, Expr)>),\\n\\n WithoutReturn(Expr),\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum EventValue {\\n\\n CurrentWidget(EventValueReturn),\\n\\n ForeignWidget(Ident, EventValueReturn),\\n\\n NoEventValue,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"relm-derive/src/gen/parser.rs\",\n \"rank\": 99,\n \"score\": 121965.54178802531\n }\n]","isConversational":false}}},{"rowIdx":3685,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"shell/src/shell_automaton_manager.rs"},"repo_name":{"kind":"string","value":"simplestaking/tezos-rs"},"commit":{"kind":"string","value":"d859dff0a8db4f5adb4885e4885217d5284f7861"},"file_code":{"kind":"string","value":"\n\nuse std::collections::HashSet;\nuse std::env;\nuse std::iter::FromIterator;\nuse std::net::SocketAddr;\nuse std::str::FromStr;\nuse std::sync::Arc;\nuse std::time::{Duration, SystemTime};\n\nuse rand::{rngs::StdRng, Rng, SeedableRng as _};\nuse slog::{info, warn, Logger};\nuse storage::{PersistentStorage, StorageInitInfo};\n\nuse networking::network_channel::NetworkChannelRef;\nuse tezos_identity::Identity;\nuse tezos_messages::p2p::encoding::block_header::Level;\nuse tezos_protocol_ipc_client::{ProtocolRunnerApi, ProtocolRunnerConfiguration};\n\npub use shell_automaton::service::actors_service::{\n ActorsMessageFrom as ShellAutomatonMsg, AutomatonSyncSender as ShellAutomatonSender,\n};\npub use shell_automaton::service::actors_service::{ApplyBlockCallback, ApplyBlockResult};\nuse shell_automaton::service::mio_service::MioInternalEventsContainer;\nuse shell_automaton::service::rpc_service::RpcShellAutomatonSender;\nuse shell_automaton::service::{\n ActorsServiceDefault, DnsServiceDefault, MioServiceDefault, ProtocolRunnerServiceDefault,\n RpcServiceDefault, ServiceDefault, StorageServiceDefault,\n};\nuse shell_automaton::shell_compatibility_version::ShellCompatibilityVersion;\nuse shell_automaton::ShellAutomaton;\n\nuse crate::PeerConnectionThreshold;\n\n#[derive(Debug, Clone)]\npub struct P2p {\n \n pub listener_port: u16,\n \n pub listener_address: SocketAddr,\n\n pub disable_mempool: bool,\n pub disable_block_precheck: bool,\n pub disable_endorsements_precheck: bool,\n pub disable_peer_graylist: bool,\n pub private_node: bool,\n\n pub peer_threshold: PeerConnectionThreshold,\n\n \n pub disable_bootstrap_lookup: bool,\n \n pub bootstrap_lookup_addresses: Vec<(String, u16)>,\n\n \n pub bootstrap_peers: Vec<SocketAddr>,\n\n pub current_head_level_override: Option<Level>,\n\n \n pub randomness_seed: Option<u64>,\n\n pub record_shell_automaton_state_snapshots: bool,\n pub record_shell_automaton_actions: bool,\n}\n\nimpl P2p {\n pub const DEFAULT_P2P_PORT_FOR_LOOKUP: u16 = 9732;\n}\n\nenum ShellAutomatonThreadHandle {\n Running(std::thread::JoinHandle<()>),\n NotRunning(Box<ShellAutomaton<ServiceDefault, MioInternalEventsContainer>>),\n}\n\npub struct ShellAutomatonManager {\n shell_automaton_sender: ShellAutomatonSender,\n shell_automaton_thread_handle: Option<ShellAutomatonThreadHandle>,\n log: Logger,\n}\n\nimpl ShellAutomatonManager {\n const SHELL_AUTOMATON_QUEUE_MAX_CAPACITY: usize = 100_000;\n\n pub fn new(\n protocol_runner_api: ProtocolRunnerApi,\n persistent_storage: PersistentStorage,\n network_channel: NetworkChannelRef,\n log: Logger,\n identity: Arc<Identity>,\n shell_compatibility_version: Arc<ShellCompatibilityVersion>,\n p2p_config: P2p,\n pow_target: f64,\n init_storage_data: StorageInitInfo,\n protocol_runner_config: ProtocolRunnerConfiguration,\n context_init_status_sender: tokio::sync::watch::Sender<bool>,\n ) -> (Self, RpcShellAutomatonSender) {\n \n let mut bootstrap_addresses = HashSet::<_>::from_iter(\n p2p_config\n .bootstrap_peers\n .iter()\n .map(|addr| (addr.ip().to_string(), addr.port())),\n );\n\n \n if !p2p_config.disable_bootstrap_lookup {\n bootstrap_addresses.extend(p2p_config.bootstrap_lookup_addresses.iter().cloned());\n };\n\n \n let mut listener_addr = p2p_config.listener_address;\n listener_addr.set_port(p2p_config.listener_port);\n\n let seed = p2p_config.randomness_seed.unwrap_or_else(|| {\n let seed = rand::thread_rng().gen();\n info!(log, \"Automaton's randomness seed selected\"; \"seed\" => seed);\n seed\n });\n\n let mio_service = MioServiceDefault::new(\n listener_addr,\n \n \n \n u16::MAX as usize,\n );\n let (rpc_service, rpc_channel) = RpcServiceDefault::new(mio_service.waker(), 128);\n\n let storage_service =\n StorageServiceDefault::init(log.clone(), mio_service.waker(), persistent_storage, 4096);\n\n let (automaton_sender, automaton_receiver) =\n shell_automaton::service::actors_service::sync_channel(\n mio_service.waker(),\n Self::SHELL_AUTOMATON_QUEUE_MAX_CAPACITY,\n );\n\n let protocol_runner_service = ProtocolRunnerServiceDefault::new(\n protocol_runner_api,\n mio_service.waker(),\n 64,\n context_init_status_sender,\n log.new(slog::o!(\"service\" => \"protocol_runner\")),\n );\n\n let service = ServiceDefault {\n randomness: StdRng::seed_from_u64(seed),\n dns: DnsServiceDefault::default(),\n mio: mio_service,\n protocol_runner: protocol_runner_service,\n storage: storage_service,\n rpc: rpc_service,\n actors: ActorsServiceDefault::new(automaton_receiver, network_channel),\n statistics: Some(Default::default()),\n };\n\n let events = MioInternalEventsContainer::with_capacity(1024);\n\n let chain_id = init_storage_data.chain_id.clone();\n let mut initial_state = shell_automaton::State::new(shell_automaton::Config {\n initial_time: SystemTime::now(),\n\n protocol_runner: protocol_runner_config,\n init_storage_data,\n\n port: p2p_config.listener_port,\n disable_mempool: p2p_config.disable_mempool,\n private_node: p2p_config.private_node,\n identity: (*identity).clone(),\n shell_compatibility_version: (*shell_compatibility_version).clone(),\n pow_target,\n chain_id,\n\n check_timeouts_interval: Duration::from_millis(200),\n\n peers_dns_lookup_addresses: bootstrap_addresses.into_iter().collect(),\n\n peer_connecting_timeout: Duration::from_secs(4),\n peer_handshaking_timeout: Duration::from_secs(8),\n\n peer_max_io_syscalls: 32,\n\n peers_potential_max: p2p_config.peer_threshold.high * 5,\n peers_connected_min: p2p_config.peer_threshold.low,\n peers_connected_max: p2p_config.peer_threshold.high,\n peers_bootstrapped_min: p2p_config\n .peer_threshold\n .num_of_peers_for_bootstrap_threshold(),\n\n peers_graylist_disable: p2p_config.disable_peer_graylist,\n peers_graylist_timeout: Duration::from_secs(15 * 60),\n\n bootstrap_block_header_get_timeout: Duration::from_millis(500),\n bootstrap_block_operations_get_timeout: Duration::from_millis(1000),\n\n current_head_level_override: p2p_config.current_head_level_override,\n\n record_state_snapshots_with_interval: match p2p_config\n .record_shell_automaton_state_snapshots\n {\n true => Some(10_000),\n false => None,\n },\n record_actions: p2p_config.record_shell_automaton_actions,\n\n quota: shell_automaton::Quota {\n restore_duration_millis: env_variable(\"QUOTA_RESTORE_DURATION_MILLIS\")\n .unwrap_or(1000),\n read_quota: env_variable(\"QUOTA_READ_BYTES\").unwrap_or(3 * 1024 * 1024), \n write_quota: env_variable(\"QUOTA_WRITE_BYTES\").unwrap_or(3 * 1024 * 1024), \n },\n disable_block_precheck: p2p_config.disable_block_precheck,\n disable_endorsements_precheck: p2p_config.disable_endorsements_precheck,\n mempool_get_operation_timeout: Duration::from_millis(\n env_variable(\"MEMPOOL_GET_OPERATIONS_TIMEOUT_SECS\").unwrap_or(1),\n ),\n });\n\n initial_state.set_logger(log.clone());\n\n let shell_automaton = ShellAutomaton::new(initial_state, service, events);\n\n let this = Self {\n log,\n shell_automaton_sender: automaton_sender,\n shell_automaton_thread_handle: Some(ShellAutomatonThreadHandle::NotRunning(Box::new(\n shell_automaton,\n ))),\n };\n\n (this, rpc_channel)\n }\n\n pub fn start(&mut self) {\n if let Some(ShellAutomatonThreadHandle::NotRunning(mut shell_automaton)) =\n self.shell_automaton_thread_handle.take()\n {\n \n let shell_automaton_thread_handle = std::thread::Builder::new()\n .name(\"shell-automaton\".to_owned())\n .spawn(move || {\n shell_automaton.init();\n\n while !shell_automaton.is_shutdown() {\n shell_automaton.make_progress();\n }\n })\n .expect(\"failed to spawn shell-automaton-thread\");\n\n self.shell_automaton_thread_handle = Some(ShellAutomatonThreadHandle::Running(\n shell_automaton_thread_handle,\n ));\n }\n }\n\n pub fn shell_automaton_sender(&self) -> ShellAutomatonSender {\n self.shell_automaton_sender.clone()\n }\n\n pub fn send_shutdown_signal(&self) {\n if let Err(err) = self\n .shell_automaton_sender\n .send(ShellAutomatonMsg::Shutdown)\n {\n warn!(self.log, \"Failed to send Shutdown message to ShellAutomaton\"; \"error\" => format!(\"{:?}\", err));\n }\n }\n\n pub fn shutdown_and_wait(self) {\n self.send_shutdown_signal();\n\n if let Some(ShellAutomatonThreadHandle::Running(th)) = self.shell_automaton_thread_handle {\n th.join().unwrap();\n }\n }\n}\n\nfn env_variable<T: FromStr>(name: &str) -> Option<T> {\n env::var(name).ok().and_then(|v| v.parse().ok())\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::collections::HashSet;\nuse std::env;\nuse std::iter::FromIterator;\nuse std::net::SocketAddr;\nuse std::str::FromStr;\nuse std::sync::Arc;\nuse std::time::{Duration, SystemTime};\n\nuse rand::{rngs::StdRng, Rng, SeedableRng as _};\nuse slog::{info, warn, Logger};\nuse storage::{PersistentStorage, StorageInitInfo};\n\nuse networking::network_channel::NetworkChannelRef;\nuse tezos_identity::Identity;\nuse tezos_messages::p2p::encoding::block_header::Level;\nuse tezos_protocol_ipc_client::{ProtocolRunnerApi, ProtocolRunnerConfiguration};\n\npub use shell_automaton::service::actors_service::{\n ActorsMessageFrom as ShellAutomatonMsg, AutomatonSyncSender as ShellAutomatonSender,\n};\npub use shell_automaton::service::actors_service::{ApplyBlockCallback, ApplyBlockResult};\nuse shell_automaton::service::mio_service::MioInternalEventsContainer;\nuse shell_automaton::service::rpc_service::RpcShellAutomatonSender;\nuse shell_automaton::service::{\n ActorsServiceDefault, DnsServiceDefault, MioServiceDefault, ProtocolRunnerServiceDefault,\n RpcServiceDefault, ServiceDefault, StorageServiceDefault,\n};\nuse shell_automaton::shell_compatibility_version::ShellCompatibilityVersion;\nuse shell_automaton::ShellAutomaton;\n\nuse crate::PeerConnectionThreshold;\n\n#[derive(Debug, Clone)]\npub struct P2p {\n \n pub listener_port: u16,\n \n pub listener_address: SocketAddr,\n\n pub disable_mempool: bool,\n pub disable_block_precheck: bool,\n pub disable_endorsements_precheck: bool,\n pub disable_peer_graylist: bool,\n pub private_node: bool,\n\n pub peer_threshold: PeerConnectionThreshold,\n\n \n pub disable_bootstrap_lookup: bool,\n \n pub bootstrap_lookup_addresses: Vec<(String, u16)>,\n\n \n pub bootstrap_peers: Vec<SocketAddr>,\n\n pub current_head_level_override: Option<Level>,\n\n \n pub randomness_seed: Option<u64>,\n\n pub record_shell_automaton_state_snapshots: bool,\n pub record_shell_automaton_actions: bool,\n}\n\nimpl P2p {\n pub const DEFAULT_P2P_PORT_FOR_LOOKUP: u16 = 9732;\n}\n\nenum ShellAutomatonThreadHandle {\n Running(std::thread::JoinHandle<()>),\n NotRunning(Box<ShellAutomaton<ServiceDefault, MioInternalEventsContainer>>),\n}\n\npub struct ShellAutomatonManager {\n shell_automaton_sender: ShellAutomatonSender,\n shell_automaton_thread_handle: Option<ShellAutomatonThreadHandle>,\n log: Logger,\n}\n\nimpl ShellAutomatonManager {\n const SHELL_AUTOMATON_QUEUE_MAX_CAPACITY: usize = 100_000;\n\n pub fn new(\n protocol_runner_api: ProtocolRunnerApi,\n persistent_storage: PersistentStorage,\n network_channel: NetworkChannelRef,\n log: Logger,\n identity: Arc<Identity>,\n shell_compatibility_version: Arc<ShellCompatibilityVersion>,\n p2p_config: P2p,\n pow_target: f64,\n init_storage_data: StorageInitInfo,\n protocol_runner_config: ProtocolRunnerConfiguration,\n context_init_status_sender: tokio::sync::watch::Sender<bool>,\n ) -> (Self, RpcShellAutomatonSender) {\n \n let mut bootstrap_addresses = HashSet::<_>::from_iter(\n p2p_config\n .bootstrap_peers\n .iter()\n .map(|addr| (addr.ip().to_string(), addr.port())),\n );\n\n \n if !p2p_config.disable_bootstrap_lookup {\n bootstrap_addresses.extend(p2p_config.bootstrap_lookup_addresses.iter().cloned());\n };\n\n \n let mut listener_addr = p2p_config.listener_address;\n listener_addr.set_port(p2p_config.listener_port);\n\n let seed = p2p_config.randomness_seed.unwrap_or_else(|| {\n let seed = rand::thread_rng().gen();\n info!(log, \"Automaton's randomness seed selected\"; \"seed\" => seed);\n seed\n });\n\n let mio_service = MioServiceDefault::new(\n listener_addr,\n \n \n \n u16::MAX as usize,\n );\n let (rpc_service, rpc_channel) = RpcServiceDefault::new(mio_service.waker(), 128);\n\n let storage_service =\n StorageServiceDefault::init(log.clone(), mio_service.waker(), persistent_storage, 4096);\n\n let (automaton_sender, automaton_receiver) =\n shell_automaton::service::actors_service::sync_channel(\n mio_service.waker(),\n Self::SHELL_AUTOMATON_QUEUE_MAX_CAPACITY,\n );\n\n let protocol_runner_service = ProtocolRunnerServiceDefault::new(\n protocol_runner_api,\n mio_service.waker(),\n 64,\n context_init_status_sender,\n log.new(slog::o!(\"service\" => \"protocol_runner\")),\n );\n\n let service = ServiceDefault {\n randomness: StdRng::seed_from_u64(seed),\n dns: DnsServiceDefault::default(),\n mio: mio_service,\n protocol_runner: protocol_runner_service,\n storage: storage_service,\n rpc: rpc_service,\n actors: ActorsServiceDefault::new(automaton_receiver, network_channel),\n statistics: Some(Default::default()),\n };\n\n let events = MioInternalEventsContainer::with_capacity(1024);\n\n let chain_id = init_storage_data.chain_id.clone();\n let mut initial_state = shell_automaton::State::new(shell_automaton::Config {\n initial_time: SystemTime::now(),\n\n protocol_runner: protocol_runner_config,\n init_storage_data,\n\n port: p2p_config.listener_port,\n disable_mempool: p2p_config.disable_mempool,\n private_node: p2p_config.private_node,\n identity: (*identity).clone(),\n shell_compatibility_version: (*shell_compatibility_version).clone(),\n pow_target,\n chain_id,\n\n check_timeouts_interval: Duration::from_millis(200),\n\n peers_dns_lookup_addresses: bootstrap_addresses.into_iter().collect(),\n\n peer_connecting_timeout: Duration::from_secs(4),\n peer_handshaking_timeout: Duration::from_secs(8),\n\n peer_max_io_syscalls: 32,\n\n peers_potential_max: p2p_config.peer_threshold.high * 5,\n peers_connected_min: p2p_config.peer_threshold.low,\n peers_connected_max: p2p_config.peer_threshold.high,\n peers_bootstrapped_min: p2p_config\n .peer_threshold\n .num_of_peers_for_bootstrap_threshold(),\n\n peers_graylist_disable: p2p_config.disable_peer_graylist,\n peers_graylist_timeout: Duration::from_secs(15 * 60),\n\n bootstrap_block_header_get_timeout: Duration::from_millis(500),\n bootstrap_block_operations_get_timeout: Duration::from_millis(1000),\n\n current_head_level_override: p2p_config.current_head_level_override,\n\n record_state_snapshots_with_interval: match p2p_config\n .record_shell_automaton_state_snapshots\n {\n true => Some(10_000),\n false => None,\n },\n record_actions: p2p_config.record_shell_automaton_actions,\n\n quota: shell_automaton::Quota {\n restore_duration_millis: env_variable(\"QUOTA_RESTORE_DURATION_MILLIS\")\n .unwrap_or(1000),\n read_quota: env_variable(\"QUOTA_READ_BYTES\").unwrap_or(3 * 1024 * 1024), \n write_quota: env_variable(\"QUOTA_WRITE_BYTES\").unwrap_or(3 * 1024 * 1024), \n },\n disable_block_precheck: p2p_config.disable_block_precheck,\n disable_endorsements_precheck: p2p_config.disable_endorsements_precheck,\n mempool_get_operation_timeout: Duration::from_millis(\n env_variable(\"MEMPOOL_GET_OPERATIONS_TIMEOUT_SECS\").unwrap_or(1),\n ),\n });\n\n initial_state.set_logger(log.clone());\n\n let shell_automaton = ShellAutomaton::new(initial_state, service, events);\n\n let this = Self {\n log,\n shell_automaton_sender: automaton_sender,\n shell_automaton_thread_handle: Some(ShellAutomatonThreadHandle::NotRunning(Box::new(\n shell_automaton,\n ))),\n };\n\n (this, rpc_channel)\n }\n\n pub fn start(&mut self) {\n if let Some(ShellAutomatonThreadHandle::NotRunning(mut shell_automaton)) =\n "},"suffix":{"kind":"string","value":"\n\n pub fn shell_automaton_sender(&self) -> ShellAutomatonSender {\n self.shell_automaton_sender.clone()\n }\n\n pub fn send_shutdown_signal(&self) {\n if let Err(err) = self\n .shell_automaton_sender\n .send(ShellAutomatonMsg::Shutdown)\n {\n warn!(self.log, \"Failed to send Shutdown message to ShellAutomaton\"; \"error\" => format!(\"{:?}\", err));\n }\n }\n\n pub fn shutdown_and_wait(self) {\n self.send_shutdown_signal();\n\n if let Some(ShellAutomatonThreadHandle::Running(th)) = self.shell_automaton_thread_handle {\n th.join().unwrap();\n }\n }\n}\n\nfn env_variable<T: FromStr>(name: &str) -> Option<T> {\n env::var(name).ok().and_then(|v| v.parse().ok())\n}\n"},"middle":{"kind":"string","value":"self.shell_automaton_thread_handle.take()\n {\n \n let shell_automaton_thread_handle = std::thread::Builder::new()\n .name(\"shell-automaton\".to_owned())\n .spawn(move || {\n shell_automaton.init();\n\n while !shell_automaton.is_shutdown() {\n shell_automaton.make_progress();\n }\n })\n .expect(\"failed to spawn shell-automaton-thread\");\n\n self.shell_automaton_thread_handle = Some(ShellAutomatonThreadHandle::Running(\n shell_automaton_thread_handle,\n ));\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"#[allow(dead_code)]\n\npub fn logger(empty: bool, level: Level) -> Logger {\n\n use std::io::{self, Write};\n\n\n\n use slog::Record;\n\n use slog_term::{CountingWriter, RecordDecorator, ThreadSafeTimestampFn};\n\n\n\n pub fn print_msg_header(\n\n fn_timestamp: &dyn ThreadSafeTimestampFn<Output = io::Result<()>>,\n\n mut rd: &mut dyn RecordDecorator,\n\n record: &Record,\n\n use_file_location: bool,\n\n ) -> io::Result<bool> {\n\n let _ = (fn_timestamp, record, use_file_location);\n\n rd.start_msg()?;\n\n let mut count_rd = CountingWriter::new(&mut rd);\n\n write!(count_rd, \"{}\", record.msg())?;\n\n Ok(count_rd.count() != 0)\n\n }\n\n\n\n if !empty {\n","file_path":"apps/baker/src/services/logger.rs","rank":0,"score":398181.7884122762},{"content":"pub fn init_limits(log: &Logger) {\n\n // Need unsafe to access direct libc syscall interface\n\n unsafe {\n\n // Enable core dumps for debug build\n\n if cfg!(debug_assertions) {\n\n enable_core_dumps(log);\n\n }\n\n // Increase open files rlimit to 64k\n\n set_file_desc_limit(log, OPEN_FILES_LIMIT);\n\n }\n\n}\n","file_path":"light_node/src/system.rs","rank":1,"score":353502.91447634087},{"content":"pub fn actors_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\n\n if let Action::WakeupEvent(_) = &action.action {\n\n while let Ok(msg) = store.service.actors().try_recv() {\n\n match msg {\n\n ActorsMessageFrom::Shutdown => {\n\n store.dispatch(ShutdownInitAction {});\n\n }\n\n ActorsMessageFrom::P2pInit => {\n\n store.dispatch(PeersInitAction {});\n\n }\n\n ActorsMessageFrom::ApplyBlock {\n\n block_hash,\n\n callback,\n\n ..\n\n } => {\n\n store\n\n .service\n\n .actors()\n\n .register_apply_block_callback(block_hash.clone(), callback);\n\n store.dispatch(BlockApplierEnqueueBlockAction {\n\n block_hash,\n\n injector_rpc_id: None,\n\n });\n\n }\n\n }\n\n }\n\n }\n\n}\n","file_path":"shell_automaton/src/actors/actors_effects.rs","rank":2,"score":352636.18306737766},{"content":"#[allow(unused)]\n\npub fn logger_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\n\n // eprintln!(\"[+] Action: {}\", action.action.as_ref());\n\n // eprintln!(\"[+] Action: {:#?}\", &action);\n\n // eprintln!(\"[+] State: {:#?}\\n\", store.state());\n\n\n\n let state = store.state.get();\n\n let log = &state.log;\n\n\n\n match &action.action {\n\n Action::CurrentHeadUpdate(content) => {\n\n slog::info!(log, \"CurrentHead Updated\";\n\n \"level\" => content.new_head.header.level(),\n\n \"hash\" => content.new_head.hash.to_string(),\n\n \"fitness\" => display_fitness(content.new_head.header.fitness()),\n\n \"payload_hash\" => format!(\"{:?}\", content.payload_hash.as_ref()));\n\n slog::debug!(log, \"CurrentHead Updated - full header\";\n\n \"new_head\" => slog::FnValue(|_| format!(\"{:?}\", content.new_head)));\n\n }\n\n Action::PeerCurrentHeadUpdate(content) => {\n\n slog::info!(log, \"Peer CurrentHead Updated\";\n","file_path":"shell_automaton/src/logger/logger_effects.rs","rank":3,"score":352625.3676169928},{"content":"pub fn rpc_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::WakeupEvent(_) => {\n\n let wakeup_timestamp = Instant::now();\n\n while let Ok((msg, rpc_id)) = store.service().rpc().try_recv_stream() {\n\n match msg {\n\n RpcRequestStream::Bootstrapped => {\n\n store.dispatch(RpcBootstrappedAction { rpc_id });\n\n }\n\n RpcRequestStream::ValidBlocks(query) => {\n\n store.dispatch(RpcMonitorValidBlocksAction { query, rpc_id });\n\n }\n\n RpcRequestStream::GetOperations {\n\n applied,\n\n refused,\n\n branch_delayed,\n\n branch_refused,\n\n outdated,\n\n } => {\n\n store.dispatch(MempoolRegisterOperationsStreamAction {\n","file_path":"shell_automaton/src/rpc/rpc_effects.rs","rank":4,"score":351278.6468333168},{"content":"/// Channel for communcation from Actor System to Automaton.\n\npub fn sync_channel(\n\n mio_waker: Arc<mio::Waker>,\n\n bound: usize,\n\n) -> (AutomatonSyncSender, AutomatonReceiver) {\n\n let (tx, rx) = mpsc::sync_channel(bound);\n\n\n\n let sender = AutomatonSyncSender {\n\n sender: tx,\n\n mio_waker,\n\n };\n\n\n\n (sender, rx)\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct ActorsServiceDefault {\n\n /// Channel receiver half for receiving messages from actors.\n\n actors_channel: mpsc::Receiver<ActorsMessageFrom>,\n\n\n\n /// NetworkChannel is used to send messages/notifications to actors.\n","file_path":"shell_automaton/src/service/actors_service.rs","rank":5,"score":346836.5162731013},{"content":"pub fn main_logger() -> Logger {\n\n let drain = FullFormat::new(TermDecorator::new().build()).build().fuse();\n\n let drain = Async::new(drain)\n\n .chan_size(32768)\n\n .overflow_strategy(OverflowStrategy::Block)\n\n .build()\n\n .filter_level(Level::Info)\n\n .fuse();\n\n Logger::root(drain, o!())\n\n}\n\n\n","file_path":"apps/baker/src/services/logger.rs","rank":6,"score":341207.9707803647},{"content":"pub fn log_stats(state: &mut State) {\n\n // log every 2 seconds.\n\n const LOG_INTERVAL_S: u64 = 2;\n\n const LOG_INTERVAL_NS: u64 = LOG_INTERVAL_S * 1_000_000_000;\n\n\n\n let now = state.time_as_nanos();\n\n\n\n if let BootstrapState::PeersBlockHeadersGetPending {\n\n last_logged,\n\n last_logged_downloaded_count,\n\n main_chain,\n\n main_chain_last_level,\n\n peer_intervals,\n\n ..\n\n } = &mut state.bootstrap\n\n {\n\n if now - *last_logged < LOG_INTERVAL_NS {\n\n return;\n\n }\n\n\n","file_path":"shell_automaton/src/bootstrap/bootstrap_reducer.rs","rank":7,"score":339237.7387519819},{"content":"/// Open commit log at a given path.\n\npub fn open_cl<P, I>(path: P, cfs: I, log: Logger) -> Result<CommitLogs, CommitLogError>\n\nwhere\n\n P: AsRef<Path>,\n\n I: IntoIterator<Item = CommitLogDescriptor>,\n\n{\n\n CommitLogs::new(path, cfs, log)\n\n}\n\n\n","file_path":"storage/src/persistent/mod.rs","rank":8,"score":324875.05940272374},{"content":"pub fn storage_request_reducer(state: &mut State, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::StorageRequestCreate(content) => {\n\n state.storage.requests.add(StorageRequestState {\n\n status: StorageRequestStatus::Idle {\n\n time: action.time_as_nanos(),\n\n },\n\n payload: content.payload.clone(),\n\n requestor: content.requestor.clone(),\n\n });\n\n }\n\n Action::StorageRequestPending(content) => {\n\n if let Some(req) = state.storage.requests.get_mut(content.req_id) {\n\n if let StorageRequestStatus::Idle { .. } = &req.status {\n\n req.status = StorageRequestStatus::Pending {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n }\n\n }\n","file_path":"shell_automaton/src/storage/request/storage_request_reducer.rs","rank":9,"score":322974.93891726027},{"content":"/// All the actions which trigger checking for timeouts are called here.\n\npub fn check_timeouts<S: Service>(store: &mut Store<S>) {\n\n store.dispatch(PeersCheckTimeoutsInitAction {});\n\n store.dispatch(BootstrapCheckTimeoutsInitAction {});\n\n store.dispatch(MempoolTimeoutsInitAction {});\n\n}\n\n\n","file_path":"shell_automaton/src/effects.rs","rank":10,"score":318048.8229659828},{"content":"pub fn rpc_reducer(state: &mut crate::State, action: &crate::ActionWithMeta) {\n\n match &action.action {\n\n Action::RpcBootstrapped(RpcBootstrappedAction { rpc_id }) => {\n\n let bootstrapped = &mut state.rpc.bootstrapped;\n\n bootstrapped.requests.insert(*rpc_id);\n\n if bootstrapped.state.is_none() {\n\n if let BlockApplierApplyState::Success { block, .. } = &state.block_applier.current\n\n {\n\n bootstrapped.state = Some(BootstrapState {\n\n json: serde_json::json!({\n\n \"block\": block.hash,\n\n \"timestamp\": block.header.timestamp(),\n\n }),\n\n is_bootstrapped: true,\n\n });\n\n }\n\n }\n\n }\n\n Action::RpcBootstrappedNewBlock(RpcBootstrappedNewBlockAction {\n\n block,\n","file_path":"shell_automaton/src/rpc/rpc_reducer.rs","rank":11,"score":317963.88608796906},{"content":"pub fn bounded_string<S: AsRef<str>>(max_len: usize) -> impl FnMut(S, &mut Vec<u8>) -> BinResult {\n\n move |data, out| {\n\n if data.as_ref().len() <= max_len {\n\n string(data, out)\n\n } else {\n\n Err(BinError::size_error(max_len, data.as_ref().len()))\n\n }\n\n }\n\n}\n\n\n","file_path":"tezos/encoding/src/enc.rs","rank":12,"score":317165.21432689205},{"content":"pub fn is_ocaml_log_enabled() -> bool {\n\n env::var(\"OCAML_LOG_ENABLED\")\n\n .unwrap_or_else(|_| \"false\".to_string())\n\n .parse::<bool>()\n\n .unwrap()\n\n}\n\n\n","file_path":"tezos/interop/tests/common/mod.rs","rank":13,"score":315952.01499438146},{"content":"#[inline(always)]\n\npub fn bounded<'a, O, F>(max: usize, mut f: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\n\nwhere\n\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\n\n O: Clone,\n\n{\n\n move |input: NomInput| {\n\n let max = std::cmp::min(max, input.input_len());\n\n let bounded = input.slice(std::ops::RangeTo { end: max });\n\n match f.parse(bounded) {\n\n Ok((rest, parsed)) => Ok((\n\n input.slice(std::ops::RangeFrom {\n\n start: max - rest.input_len(),\n\n }),\n\n parsed,\n\n )),\n\n Err(Err::Error(DecodeError {\n\n input,\n\n kind: error::DecodeErrorKind::Nom(ErrorKind::Eof),\n\n other,\n\n })) => Err(Err::Error(DecodeError {\n\n input,\n\n kind: error::DecodeErrorKind::Boundary(BoundedEncodingKind::Bounded),\n\n other,\n\n })),\n\n e => e,\n\n }\n\n }\n\n}\n\n\n\n/// Reserves `size` trailing bytes of the input and applies parser to the rest of the input.\n","file_path":"tezos/encoding/src/nom.rs","rank":14,"score":315146.58997978794},{"content":"fn ocaml_time_normalize(ocaml_time: f64) -> u64 {\n\n (ocaml_time * 1_000_000_000.0) as u64\n\n}\n\n\n\npub type BlocksApplyStats = HashMap<BlockHash, BlockApplyStats>;\n\n\n\n#[derive(Serialize, Deserialize, Debug, Default, Clone)]\n\npub struct BlockApplyStats {\n\n pub level: Level,\n\n pub block_timestamp: i64,\n\n pub validation_pass: u8,\n\n pub round: Option<i32>,\n\n\n\n pub receive_timestamp: u64,\n\n\n\n pub injected: Option<u64>,\n\n pub baker: Option<SignaturePublicKey>,\n\n pub priority: Option<u16>,\n\n\n\n pub payload_hash: Option<BlockPayloadHash>,\n","file_path":"shell_automaton/src/service/statistics_service/mod.rs","rank":15,"score":312495.1156126782},{"content":"#[inline(always)]\n\npub fn reserve<'a, O, F>(size: usize, mut parser: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\n\nwhere\n\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\n\n{\n\n move |input| {\n\n let input_len = input.len();\n\n let reserved_len = input_len - std::cmp::min(input_len, size);\n\n let reserved_input = &input[..reserved_len];\n\n let (reserved_input, out) = parser(reserved_input)?;\n\n Ok((&input[reserved_len - reserved_input.len()..], out))\n\n }\n\n}\n\n\n\n/// Applies the `parser` to the input, addin field context to the error.\n","file_path":"tezos/encoding/src/nom.rs","rank":16,"score":311377.4610736418},{"content":"/// Produces a JSON response from an FFI RPC response\n\npub fn make_response_with_status_and_json_string(status_code: u16, body: &str) -> ServiceResult {\n\n Ok(Response::builder()\n\n .header(hyper::header::CONTENT_TYPE, \"application/json\")\n\n // TODO: add to config\n\n .header(hyper::header::ACCESS_CONTROL_ALLOW_ORIGIN, \"*\")\n\n .header(hyper::header::ACCESS_CONTROL_ALLOW_HEADERS, \"Content-Type\")\n\n .header(hyper::header::ACCESS_CONTROL_ALLOW_HEADERS, \"content-type\")\n\n .header(\n\n hyper::header::ACCESS_CONTROL_ALLOW_HEADERS,\n\n \"x-requested-with\",\n\n )\n\n .header(\n\n hyper::header::ACCESS_CONTROL_ALLOW_METHODS,\n\n \"GET, POST, OPTIONS, PUT\",\n\n )\n\n .status(status_code)\n\n .body(Body::from(body.to_owned()))?)\n\n}\n\n\n\n/// Function to generate JSON response from a stream\n","file_path":"rpc/src/lib.rs","rank":17,"score":309034.0979880006},{"content":"pub fn storage_request_effects<S>(store: &mut Store<S>, action: &ActionWithMeta)\n\nwhere\n\n S: Service,\n\n{\n\n match &action.action {\n\n Action::StorageRequestCreate(_) => {\n\n store.dispatch(StorageRequestInitAction {\n\n req_id: store.state().storage.requests.last_added_req_id(),\n\n });\n\n }\n\n Action::StorageRequestInit(action) => {\n\n let req = match store.state.get().storage.requests.get(action.req_id) {\n\n Some(v) => v,\n\n None => return,\n\n };\n\n match req.status {\n\n StorageRequestStatus::Idle { .. } => {}\n\n _ => return,\n\n }\n\n // TODO: handle send error in case of mpsc disconnection.\n","file_path":"shell_automaton/src/storage/request/storage_request_effects.rs","rank":18,"score":306625.4955731561},{"content":"pub fn applied_actions_count_reducer(state: &mut State, _: &ActionWithMeta) {\n\n state.applied_actions_count += 1;\n\n}\n\n\n","file_path":"shell_automaton/src/reducer.rs","rank":19,"score":306352.7148144277},{"content":"pub fn boolean(b: &bool, out: &mut Vec<u8>) -> BinResult {\n\n put_byte(\n\n if *b {\n\n &crate::types::BYTE_VAL_TRUE\n\n } else {\n\n &crate::types::BYTE_VAL_FALSE\n\n },\n\n out,\n\n );\n\n Ok(())\n\n}\n\n\n\n// Rust integers encoding\n\nmod integers {\n\n macro_rules! encode_integer {\n\n ($t:ident) => {\n\n pub fn $t(i: &$t, out: &mut Vec<u8>) -> super::BinResult {\n\n super::put_bytes(&i.to_be_bytes(), out);\n\n Ok(())\n\n }\n","file_path":"tezos/encoding/src/enc.rs","rank":20,"score":304254.77695004444},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_001/helpers.rs","rank":21,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_008_2/helpers.rs","rank":22,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_005_2/helpers.rs","rank":23,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_007/helpers.rs","rank":24,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_009/helpers.rs","rank":25,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_004/helpers.rs","rank":26,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_003/helpers.rs","rank":27,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_010/helpers.rs","rank":28,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_002/helpers.rs","rank":29,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_008/helpers.rs","rank":30,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_011/helpers.rs","rank":31,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_006/helpers.rs","rank":32,"score":303685.1474562311},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_012/helpers.rs","rank":33,"score":303685.14745623106},{"content":"#[inline]\n\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\n\n if bound < 1 {\n\n return Err(TezosPRNGError::BoundNotCorrect { bound });\n\n }\n\n let v: i32;\n\n // Note: this part aims to be similar\n\n // hash once again and take the 4 highest bytes and we got our random number\n\n let mut sequence = state;\n\n loop {\n\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\n\n\n\n // computation for overflow check\n\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\n\n\n\n // 4 highest bytes\n\n let r = num_from_slice!(hashed, 0, i32).abs();\n\n\n\n // potentional overflow, keep the state of the generator and do one more iteration\n\n sequence = hashed;\n\n if r >= drop_if_over {\n","file_path":"rpc/src/services/protocol/proto_013/helpers.rs","rank":34,"score":303685.14745623106},{"content":"#[inline(always)]\n\npub fn bounded_string<'a>(max: usize) -> impl FnMut(NomInput<'a>) -> NomResult<'a, String> {\n\n map_res(\n\n complete(length_data(bounded_size(BoundedEncodingKind::String, max))),\n\n |bytes| std::str::from_utf8(bytes).map(str::to_string),\n\n )\n\n}\n\n\n\n/// Parser that applies specified parser to the fixed length slice of input.\n","file_path":"tezos/encoding/src/nom.rs","rank":35,"score":302436.1786644062},{"content":"pub fn identity_1() -> Identity {\n\n const IDENTITY: &str = r#\"\n\n{\n\n \"peer_id\": \"idrdoT9g6YwELhUQyshCcHwAzBS9zA\",\n\n \"proof_of_work_stamp\": \"bbc2300149249e1ccc84a54362236c3cbbc2cc2ffbd3b6ea\",\n\n \"public_key\": \"94498d9416140fbc458495333daac1b4c87e419f5726717a54f9b6c67476ae1c\",\n\n \"secret_key\": \"ac7acf3afed7637be10f8fc76a2eb6b3359c78adb1d813b41cbab3fae954f4b1\"\n\n}\n\n\"#;\n\n Identity::from_json(IDENTITY).unwrap()\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone)]\n\npub struct Config {\n\n pub initial_time: SystemTime,\n\n\n\n pub protocol_runner: ProtocolRunnerConfiguration,\n\n pub init_storage_data: StorageInitInfo,\n\n\n\n pub port: Port,\n","file_path":"shell_automaton/src/config.rs","rank":36,"score":301674.90770058933},{"content":"pub fn storage_state_snapshot_create_reducer(state: &mut State, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::StorageStateSnapshotCreatePending(action) => {\n\n let state = &mut state.storage.state_snapshot.create;\n\n if !state.is_pending() {\n\n *state = StorageStateSnapshotCreateState::Pending {\n\n action_id: action.action_id,\n\n applied_actions_count: action.applied_actions_count,\n\n };\n\n }\n\n }\n\n Action::StorageStateSnapshotCreateError(action) => {\n\n let state = &mut state.storage.state_snapshot.create;\n\n let (action_id, applied_actions_count) = match state {\n\n StorageStateSnapshotCreateState::Pending {\n\n action_id,\n\n applied_actions_count,\n\n } => (*action_id, *applied_actions_count),\n\n _ => return,\n\n };\n","file_path":"shell_automaton/src/storage/state_snapshot/create/storage_state_snapshot_create_reducer.rs","rank":37,"score":301252.7764101563},{"content":"pub fn storage_blocks_genesis_init_reducer(state: &mut State, action: &ActionWithMeta) {\n\n if let Action::StorageBlocksGenesisInitSuccess(_) = &action.action {\n\n state.storage.blocks.genesis.init = StorageBlocksGenesisInitState::Success;\n\n }\n\n}\n","file_path":"shell_automaton/src/storage/blocks/genesis/init/storage_blocks_genesis_init_reducer.rs","rank":38,"score":301252.7764101563},{"content":"pub fn effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\n\n // these four effects must be first and in this order!\n\n // if action.action.as_ref().starts_with(\"Rights\") {\n\n // slog::debug!(store.state().log, \"Rights action\"; \"action\" => format!(\"{:#?}\", action.action));\n\n // }\n\n\n\n logger_effects(store, action);\n\n last_action_effects(store, action);\n\n applied_actions_count_effects(store, action);\n\n\n\n paused_loops_effects(store, action);\n\n\n\n stats_current_head_effects(store, action);\n\n\n\n protocol_runner_effects(store, action);\n\n\n\n protocol_runner_spawn_server_effects(store, action);\n\n\n\n protocol_runner_latest_context_hashes_effects(store, action);\n\n\n","file_path":"shell_automaton/src/effects.rs","rank":39,"score":300360.7520255495},{"content":"// TODO: needs to take a path and other stuff, not just env?\n\nfn initialize_persistent_storage(env: &Environment, log: &Logger) -> PersistentStorage {\n\n // create common RocksDB block cache to be shared among column families\n\n // IMPORTANT: Cache object must live at least as long as DB (returned by open_kv)\n\n let mut caches = GlobalRocksDbCacheHolder::with_capacity(1);\n\n let main_chain = MainChain::new(\n\n env.tezos_network_config\n\n .main_chain_id()\n\n .expect(\"Failed to decode chainId\"),\n\n env.tezos_network_config.version.clone(),\n\n );\n\n\n\n // initialize dbs\n\n let kv_cache = RocksDbCache::new_lru_cache(env.storage.db.cache_size)\n\n .expect(\"Failed to initialize RocksDB cache (db)\");\n\n\n\n let maindb = match env.storage.main_db {\n\n TezedgeDatabaseBackendConfiguration::Sled => initialize_maindb(\n\n log,\n\n None,\n\n &env.storage.db,\n","file_path":"light_node/src/main.rs","rank":40,"score":300117.80869208346},{"content":"fn with_log(log: Logger) -> BoxedFilter<(Logger,)> {\n\n warp::any().map(move || log.clone()).boxed()\n\n}\n\n\n","file_path":"sandbox/src/filters.rs","rank":41,"score":299653.64795409713},{"content":"/// Process block operations. This will mark operations in store for the block as seen.\n\n///\n\n/// Returns tuple:\n\n/// (\n\n/// are_operations_complete,\n\n/// missing_validation_passes\n\n/// )\n\npub fn process_block_operations(\n\n env: &RpcServiceEnvironment,\n\n message: &OperationsForBlocksMessage,\n\n) -> Result<(bool, Option<HashSet<u8>>), StorageError> {\n\n let operations_storage = OperationsStorage::new(env.persistent_storage());\n\n let operations_meta_storage = OperationsMetaStorage::new(env.persistent_storage());\n\n if operations_meta_storage.is_complete(message.operations_for_block().hash())? {\n\n return Ok((true, None));\n\n }\n\n\n\n operations_storage.put_operations(message)?;\n\n operations_meta_storage.put_operations(message)\n\n}\n\n\n\npub async fn try_apply_block(\n\n env: &RpcServiceEnvironment,\n\n block: &BlockHeaderWithHash,\n\n) -> Result<(), InjectBlockError> {\n\n let block_meta_storage = BlockMetaStorage::new(env.persistent_storage());\n\n let operations_meta_storage = OperationsMetaStorage::new(env.persistent_storage());\n","file_path":"rpc/src/services/mempool_services.rs","rank":42,"score":296048.0719726635},{"content":"fn enqueue_injected_block<S: Service>(store: &mut Store<S>) {\n\n let state = store.state();\n\n\n\n if state.block_applier.current.is_pending() || !state.block_applier.queue.is_empty() {\n\n return;\n\n }\n\n\n\n if !state.bootstrap.can_inject_block() {\n\n return;\n\n }\n\n\n\n let mut blocks = state\n\n .rpc\n\n .injected_blocks\n\n .iter()\n\n .map(|(_, data)| {\n\n (\n\n data.block.hash.clone(),\n\n data.rpc_id,\n\n data.block.header.fitness().clone(),\n","file_path":"shell_automaton/src/rpc/rpc_effects.rs","rank":43,"score":295190.1010712349},{"content":"fn find_block_with_context_hash_impl(\n\n head_block_storage: BlockHeaderWithHash,\n\n latest_context_hashes: &[ContextHash],\n\n block_storage: &BlockStorage,\n\n) -> Result<Option<BlockHeaderWithHash>, StorageError> {\n\n let mut head = head_block_storage;\n\n let latest_context_hashes = HashSet::<&ContextHash>::from_iter(latest_context_hashes.iter());\n\n\n\n while !latest_context_hashes.contains(head.header.context()) {\n\n if head.header.level() == 0 {\n\n return Ok(None);\n\n }\n\n\n\n head = match block_storage.get(head.header.predecessor())? {\n\n Some(head) => head,\n\n _ => return Ok(None),\n\n };\n\n }\n\n\n\n Ok(Some(head))\n\n}\n\n\n","file_path":"shell_automaton/src/service/storage_service.rs","rank":44,"score":294952.5333596722},{"content":"fn with_log(log: Logger) -> BoxedFilter<(Logger,)> {\n\n warp::any().map(move || log.clone()).boxed()\n\n}\n\n\n","file_path":"monitoring/src/websocket/ws_server.rs","rank":45,"score":293260.5700425993},{"content":"pub fn peer_message_size(bytes: impl AsRef<[u8]>) -> Result<usize, BinaryReaderError> {\n\n let size = complete_input(size, bytes.as_ref())?;\n\n Ok(size as usize)\n\n}\n","file_path":"tezos/messages/src/p2p/mod.rs","rank":46,"score":293190.6958682678},{"content":"pub fn storage_blocks_genesis_check_applied_reducer(state: &mut State, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::StorageBlocksGenesisCheckAppliedInit(_) => {\n\n state.storage.blocks.genesis.check_applied =\n\n StorageBlocksGenesisCheckAppliedState::GetMetaInit;\n\n }\n\n Action::StorageBlocksGenesisCheckAppliedGetMetaPending(_) => {\n\n let req_id = state.storage.requests.last_added_req_id();\n\n state.storage.blocks.genesis.check_applied =\n\n StorageBlocksGenesisCheckAppliedState::GetMetaPending { req_id };\n\n }\n\n Action::StorageBlocksGenesisCheckAppliedGetMetaError(_) => {\n\n state.storage.blocks.genesis.check_applied =\n\n StorageBlocksGenesisCheckAppliedState::GetMetaError {};\n\n }\n\n Action::StorageBlocksGenesisCheckAppliedGetMetaSuccess(content) => {\n\n state.storage.blocks.genesis.check_applied =\n\n StorageBlocksGenesisCheckAppliedState::GetMetaSuccess {\n\n meta: content.meta.clone(),\n\n };\n","file_path":"shell_automaton/src/storage/blocks/genesis/check_applied/storage_blocks_genesis_check_applied_reducer.rs","rank":47,"score":291931.90599307127},{"content":"/// Process block_header, stores/updates storages, schedules missing stuff\n\n///\n\n/// Returns:\n\n/// [metadata] - block header metadata\n\n/// [is_new_block] - if it is a new block or previosly stored\n\n/// [are_operations_complete] - if operations are completed\n\n///\n\npub fn process_injected_block_header(\n\n env: &RpcServiceEnvironment,\n\n chain_id: &ChainId,\n\n block_header: &BlockHeaderWithHash,\n\n) -> Result<(Meta, bool, bool), StorageError> {\n\n let block_storage = BlockStorage::new(env.persistent_storage());\n\n let block_meta_storage = BlockMetaStorage::new(env.persistent_storage());\n\n // store block\n\n let is_new_block = block_storage.put_block_header(block_header)?;\n\n\n\n // update block metadata\n\n let metadata = block_meta_storage.put_block_header(block_header, chain_id, env.log())?;\n\n\n\n // update operations metadata\n\n let are_operations_complete = process_injected_block_header_operations(env, block_header)?;\n\n\n\n Ok((metadata, is_new_block, are_operations_complete))\n\n}\n\n\n","file_path":"rpc/src/services/mempool_services.rs","rank":48,"score":291410.693845827},{"content":"/// Find the node to monitor\n\npub fn find_node_process_id(port: u16) -> Result<Option<i32>, ProcError> {\n\n let all_procs = process::all_processes().expect(\"No processes found on system\");\n\n\n\n let mut process_map: HashMap<u32, &Process> = HashMap::new();\n\n\n\n // create mapping between processes and inodes\n\n for process in &all_procs {\n\n if let ProcResult::Ok(fds) = process.fd() {\n\n for fd in fds {\n\n if let process::FDTarget::Socket(inode) = fd.target {\n\n process_map.insert(inode, process);\n\n }\n\n }\n\n }\n\n }\n\n\n\n // get the tcp table\n\n let tcp = tcp()?;\n\n let tcp6 = tcp6()?;\n\n\n\n for entry in tcp.into_iter().chain(tcp6) {\n\n if port == entry.local_address.port() && entry.state == TcpState::Listen {\n\n if let Some(process) = process_map.get(&entry.inode) {\n\n return Ok(Some(process.pid()));\n\n }\n\n }\n\n }\n\n Ok(None)\n\n}\n","file_path":"apps/node_monitoring/src/node.rs","rank":49,"score":290928.8112341297},{"content":"pub fn start_applying_next_block<S: Service>(store: &mut Store<S>) {\n\n if let Some((block_hash, injector_rpc_id)) = store.state().block_applier.queue.front().cloned()\n\n {\n\n store.dispatch(BlockApplierApplyInitAction {\n\n block_hash,\n\n injector_rpc_id,\n\n });\n\n }\n\n}\n","file_path":"shell_automaton/src/block_applier/block_applier_effects.rs","rank":50,"score":290769.6905512983},{"content":"#[no_coverage]\n\nfn complexity<const SIZE: usize>(_t: &SizedBytes<SIZE>, cplx: f64) -> f64 {\n\n cplx\n\n}\n\n\n\nimpl<const SIZE: usize> SizedBytesMutator<SIZE> {\n\n #[no_coverage]\n\n pub fn new() -> Self {\n\n Self {\n\n 0: MapMutator::new(\n\n FixedLenVecMutator::<u8, U8Mutator>::new_with_repeated_mutator(\n\n U8Mutator::default(),\n\n SIZE,\n\n ),\n\n vec_from_sizedbytes,\n\n sizedbytes_from_vec,\n\n complexity,\n\n ),\n\n }\n\n }\n\n}\n","file_path":"tezos/encoding/src/fuzzing/sizedbytes.rs","rank":51,"score":288133.6341003617},{"content":"pub fn storage_state_snapshot_create_effects<S>(store: &mut Store<S>, action: &ActionWithMeta)\n\nwhere\n\n S: Service,\n\n{\n\n match &action.action {\n\n Action::StorageStateSnapshotCreateInit(_) => {\n\n let req_payload =\n\n StorageRequestPayload::StateSnapshotPut(Box::new(store.state().clone()));\n\n let req = StorageRequest::new(None, req_payload).subscribe();\n\n let _ = store.service.storage().request_send(req);\n\n\n\n let action = StorageStateSnapshotCreatePendingAction {\n\n action_id: store.state().last_action.id(),\n\n applied_actions_count: store.state().applied_actions_count,\n\n };\n\n store.dispatch(action);\n\n }\n\n Action::StorageStateSnapshotCreateError(_)\n\n | Action::StorageStateSnapshotCreateSuccess(_) => {\n\n store.dispatch(StorageStateSnapshotCreateInitAction {});\n\n }\n\n _ => {}\n\n }\n\n}\n","file_path":"shell_automaton/src/storage/state_snapshot/create/storage_state_snapshot_create_effects.rs","rank":52,"score":286346.3394118248},{"content":"pub fn storage_blocks_genesis_init_effects<S>(store: &mut Store<S>, action: &ActionWithMeta)\n\nwhere\n\n S: Service,\n\n{\n\n match &action.action {\n\n Action::StorageBlocksGenesisInit(content) => {\n\n store.dispatch(StorageBlocksGenesisInitHeaderPutInitAction {\n\n genesis_commit_hash: content.genesis_commit_hash.clone(),\n\n });\n\n }\n\n Action::StorageBlocksGenesisInitHeaderPutSuccess(_) => {\n\n store.dispatch(StorageBlocksGenesisInitAdditionalDataPutInitAction {});\n\n }\n\n Action::StorageBlocksGenesisInitAdditionalDataPutSuccess(_) => {\n\n store.dispatch(StorageBlocksGenesisInitCommitResultGetInitAction {});\n\n }\n\n Action::StorageBlocksGenesisInitCommitResultGetSuccess(_) => {\n\n store.dispatch(StorageBlocksGenesisInitCommitResultPutInitAction {});\n\n }\n\n Action::StorageBlocksGenesisInitCommitResultPutSuccess(_) => {\n\n store.dispatch(StorageBlocksGenesisInitSuccessAction {});\n\n }\n\n Action::StorageBlocksGenesisInitSuccess(_) => {\n\n store.dispatch(CurrentHeadRehydrateInitAction {});\n\n store.dispatch(ProtocolRunnerNotifyStatusAction {});\n\n }\n\n _ => {}\n\n }\n\n}\n","file_path":"shell_automaton/src/storage/blocks/genesis/init/storage_blocks_genesis_init_effects.rs","rank":53,"score":286346.3394118248},{"content":"// it may be string without quotes, it is invalid json, let's read it manually\n\nfn read_error(response: &mut impl io::Read, status: StatusCode) -> Result<(), RpcErrorInner> {\n\n let mut buf = [0; 0x1000];\n\n io::Read::read(response, &mut buf)?;\n\n let err = str::from_utf8(&buf)?\n\n .trim_end_matches('\\0')\n\n .trim_end_matches('\\n');\n\n Err(RpcErrorInner::NodeError(err.to_string(), status))\n\n}\n\n\n","file_path":"apps/baker/src/services/client.rs","rank":54,"score":285023.049685247},{"content":"#[inline(always)]\n\npub fn sized<'a, O, F>(size: usize, f: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\n\nwhere\n\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\n\n{\n\n map_parser(take(size), f)\n\n}\n\n\n\n/// Parses optional field. Byte `0x00` indicates absence of the field,\n\n/// byte `0xff` preceedes encoding of the existing field.\n","file_path":"tezos/encoding/src/nom.rs","rank":55,"score":283726.012158446},{"content":"pub fn storage_blocks_genesis_init_header_put_reducer(state: &mut State, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::StorageBlocksGenesisInitHeaderPutInit(_) => {\n\n state.storage.blocks.genesis.init = StorageBlocksGenesisInitHeaderPutState::Init.into();\n\n }\n\n Action::StorageBlocksGenesisInitHeaderPutPending(_) => {\n\n let req_id = state.storage.requests.last_added_req_id();\n\n state.storage.blocks.genesis.init =\n\n StorageBlocksGenesisInitHeaderPutState::Pending { req_id }.into();\n\n }\n\n Action::StorageBlocksGenesisInitHeaderPutError(_) => {\n\n state.storage.blocks.genesis.init =\n\n StorageBlocksGenesisInitHeaderPutState::Error {}.into();\n\n }\n\n Action::StorageBlocksGenesisInitHeaderPutSuccess(content) => {\n\n state.storage.blocks.genesis.init = StorageBlocksGenesisInitHeaderPutState::Success {\n\n is_new_block: content.is_new_block,\n\n }\n\n .into();\n\n }\n\n _ => {}\n\n }\n\n}\n","file_path":"shell_automaton/src/storage/blocks/genesis/init/header_put/storage_blocks_genesis_init_header_put_reducer.rs","rank":56,"score":283446.8523402496},{"content":"pub fn string(data: impl AsRef<str>, out: &mut Vec<u8>) -> BinResult {\n\n put_size(data.as_ref().len(), out)?;\n\n put_bytes(data.as_ref().as_bytes(), out);\n\n Ok(())\n\n}\n\n\n","file_path":"tezos/encoding/src/enc.rs","rank":57,"score":282327.88459430984},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_010/helpers.rs","rank":58,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_009/helpers.rs","rank":59,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_002/helpers.rs","rank":60,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_013/helpers.rs","rank":61,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_008_2/helpers.rs","rank":62,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_012/helpers.rs","rank":63,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_008/helpers.rs","rank":64,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_005_2/helpers.rs","rank":65,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_006/helpers.rs","rank":66,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_011/helpers.rs","rank":67,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_001/helpers.rs","rank":68,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_003/helpers.rs","rank":69,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_007/helpers.rs","rank":70,"score":281895.98154266377},{"content":"#[inline]\n\npub fn init_prng(\n\n cycle_meta_data: &CycleData,\n\n constants: &RightsConstants,\n\n use_string_bytes: &[u8],\n\n cycle_position: i32,\n\n offset: i32,\n\n) -> Result<RandomSeedState, anyhow::Error> {\n\n // a safe way to convert betwwen types is to use try_from\n\n let nonce_size = usize::try_from(*constants.nonce_length())?;\n\n let state = cycle_meta_data.seed_bytes();\n\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\n\n\n\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\n\n let rd = blake2b::digest_256(&merge_slices!(\n\n state,\n\n &zero_bytes,\n\n use_string_bytes,\n\n &cycle_position.to_be_bytes()\n\n ))?\n\n .to_vec();\n","file_path":"rpc/src/services/protocol/proto_004/helpers.rs","rank":71,"score":281895.98154266377},{"content":"pub fn reducer(state: &mut State, action: &ActionWithMeta) {\n\n if let Action::StorageStateSnapshotCreateInit(_) = &action.action {\n\n // This action shouldn't cause changes in the state, so that in the\n\n // effects, we will save exact same state that was before calling\n\n // this action.\n\n return;\n\n }\n\n\n\n chain_reducers!(\n\n state,\n\n action,\n\n paused_loops_reducer,\n\n protocol_runner_latest_context_hashes_reducer,\n\n protocol_runner_spawn_server_reducer,\n\n protocol_runner_init_reducer,\n\n protocol_runner_init_runtime_reducer,\n\n protocol_runner_init_context_reducer,\n\n protocol_runner_init_context_ipc_server_reducer,\n\n protocol_runner_reducer,\n\n current_head_reducer,\n","file_path":"shell_automaton/src/reducer.rs","rank":72,"score":281032.49153533985},{"content":"pub trait ActorsService {\n\n /// Send message to actors.\n\n fn send(&self, msg: ActorsMessageTo);\n\n\n\n /// Try to receive/read queued message from actors, if there is any.\n\n fn try_recv(&mut self) -> Result<ActorsMessageFrom, mpsc::TryRecvError>;\n\n\n\n fn register_apply_block_callback(\n\n &mut self,\n\n block_hash: Arc<BlockHash>,\n\n callback: ApplyBlockCallback,\n\n );\n\n\n\n fn call_apply_block_callback(&mut self, block_hash: &BlockHash, result: ApplyBlockResult);\n\n}\n\n\n\n/// Message to actors.\n\n#[derive(Debug, Clone)]\n\npub enum ActorsMessageTo {\n\n PeerHandshaked(Arc<PeerId>, MetadataMessage, Arc<NetworkVersion>),\n","file_path":"shell_automaton/src/service/actors_service.rs","rank":73,"score":280164.0284761753},{"content":"pub trait RandomnessService {\n\n fn get_nonce(&mut self, peer: SocketAddr) -> Nonce;\n\n\n\n /// Choose peer to initiate random outgoing connection.\n\n fn choose_peer(&mut self, list: &[SocketAddr]) -> Option<SocketAddr>;\n\n\n\n fn choose_potential_peers_for_advertise(&mut self, list: &[SocketAddr]) -> Vec<SocketAddr>;\n\n\n\n fn choose_potential_peers_for_nack(&mut self, list: &[SocketAddr]) -> Vec<SocketAddr>;\n\n}\n\n\n\nimpl<R> RandomnessService for R\n\nwhere\n\n R: Rng + Debug,\n\n{\n\n fn get_nonce(&mut self, _: SocketAddr) -> Nonce {\n\n let mut b: [u8; NONCE_SIZE] = [0; NONCE_SIZE];\n\n self.fill(&mut b);\n\n Nonce::new(&b)\n\n }\n","file_path":"shell_automaton/src/service/randomness_service.rs","rank":74,"score":280144.6911747833},{"content":"pub trait MioService {\n\n type PeerStream: Read + Write;\n\n type Events;\n\n type InternalEvent;\n\n\n\n fn wait_for_events(&mut self, events: &mut Self::Events, timeout: Option<Duration>);\n\n fn transform_event(&mut self, event: &Self::InternalEvent) -> Event;\n\n\n\n fn peer_connection_incoming_listen_start(&mut self) -> io::Result<()>;\n\n fn peer_connection_incoming_listen_stop(&mut self);\n\n fn peer_connection_incoming_accept(\n\n &mut self,\n\n ) -> Result<(PeerToken, MioPeerRefMut<Self::PeerStream>), PeerConnectionIncomingAcceptError>;\n\n\n\n fn peer_connection_init(&mut self, address: SocketAddr) -> io::Result<PeerToken>;\n\n fn peer_disconnect(&mut self, token: PeerToken);\n\n\n\n fn peer_get(&mut self, token: PeerToken) -> Option<MioPeerRefMut<Self::PeerStream>>;\n\n}\n\n\n","file_path":"shell_automaton/src/service/mio_service.rs","rank":75,"score":280119.1020885114},{"content":"#[inline(always)]\n\npub fn bounded_dynamic<'a, O, F>(max: usize, f: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\n\nwhere\n\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\n\n O: Clone,\n\n{\n\n length_value(\n\n bounded_size(BoundedEncodingKind::Dynamic, max),\n\n all_consuming(f),\n\n )\n\n}\n\n\n\n/// Applies the parser `f` to the input, limiting it to `max` bytes at most.\n","file_path":"tezos/encoding/src/nom.rs","rank":76,"score":279791.96870363125},{"content":"pub trait StorageService {\n\n /// Send the request to storage for execution.\n\n fn request_send(&mut self, req: StorageRequest)\n\n -> Result<(), RequestSendError<StorageRequest>>;\n\n\n\n /// Try to receive/read queued response, if there is any.\n\n fn response_try_recv(&mut self) -> Result<StorageResponse, ResponseTryRecvError>;\n\n\n\n fn blocks_genesis_commit_result_put(\n\n &mut self,\n\n init_storage_info: &StorageInitInfo,\n\n commit_result: CommitGenesisResult,\n\n ) -> Result<(), StorageError>;\n\n}\n\n\n","file_path":"shell_automaton/src/service/storage_service.rs","rank":77,"score":279315.40456460975},{"content":"pub trait RpcService {\n\n /// Try to receive a request from rpc\n\n fn try_recv(&mut self) -> Result<(RpcRequest, RpcId), RpcRecvError>;\n\n\n\n /// Respond on the request, `json` is `None` means close the stream\n\n fn respond<J>(&mut self, call_id: RpcId, json: J)\n\n where\n\n J: 'static + Send + Serialize;\n\n\n\n /// Try to receive a request from rpc, but response is expected to be stream\n\n fn try_recv_stream(&mut self) -> Result<(RpcRequestStream, RpcId), RpcRecvError>;\n\n\n\n /// Respond on the request with json value, `None` means the stream is terminated\n\n fn respond_stream(&mut self, call_id: RpcId, json: Option<serde_json::Value>);\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone)]\n\npub struct StorageRequest {\n\n pub req_id: RequestId,\n\n pub pending_since: u64,\n","file_path":"shell_automaton/src/service/rpc_service.rs","rank":78,"score":278805.20700415864},{"content":"/// Returns only true, if new_fitness is greater than head's fitness\n\npub fn is_fitness_increases_or_same(head: &Head, new_fitness: &Fitness) -> bool {\n\n fitness_increases_or_same(head.fitness(), new_fitness)\n\n}\n\n\n","file_path":"shell/src/validation/mod.rs","rank":79,"score":278704.0099879071},{"content":"/// Returns only true, if new_fitness is greater than head's fitness\n\npub fn is_fitness_increases(head: &Head, new_fitness: &Fitness) -> bool {\n\n fitness_increases(head.fitness(), new_fitness)\n\n}\n\n\n","file_path":"shell/src/validation/mod.rs","rank":80,"score":278704.0099879071},{"content":"pub fn create_routes(tezedge_is_enabled: bool) -> PathTree<MethodHandler> {\n\n let mut routes = PathTree::<MethodHandler>::new();\n\n\n\n // Shell rpc - implemented\n\n routes.handle(\n\n hash_set![Method::GET],\n\n \"/version\",\n\n shell_handler::node_version,\n\n );\n\n routes.handle(\n\n hash_set![Method::GET],\n\n \"/monitor/bootstrapped\",\n\n shell_handler::bootstrapped,\n\n );\n\n routes.handle(\n\n hash_set![Method::GET],\n\n \"/monitor/commit_hash\",\n\n shell_handler::commit_hash,\n\n );\n\n routes.handle(\n","file_path":"rpc/src/server/router.rs","rank":81,"score":278683.3895165555},{"content":"pub fn get_blocks_per_cycle(\n\n protocol_hash: &ProtocolHash,\n\n serialized_constants: &str,\n\n) -> Result<i32, anyhow::Error> {\n\n let supported_protocol = SupportedProtocol::try_from(protocol_hash)?;\n\n\n\n match supported_protocol {\n\n SupportedProtocol::Proto001 => Ok(serde_json::from_str::<proto_001::ProtocolConstants>(\n\n serialized_constants,\n\n )?\n\n .blocks_per_cycle()),\n\n SupportedProtocol::Proto002 => Ok(serde_json::from_str::<proto_002::ProtocolConstants>(\n\n serialized_constants,\n\n )?\n\n .blocks_per_cycle()),\n\n SupportedProtocol::Proto003 => Ok(serde_json::from_str::<proto_003::ProtocolConstants>(\n\n serialized_constants,\n\n )?\n\n .blocks_per_cycle()),\n\n SupportedProtocol::Proto004 => Ok(serde_json::from_str::<proto_004::ProtocolConstants>(\n","file_path":"rpc/src/services/protocol/mod.rs","rank":82,"score":277038.72457972646},{"content":"pub fn worker_channel<Req, Resp>(\n\n mio_waker: Arc<mio::Waker>,\n\n bound: usize,\n\n) -> (\n\n ServiceWorkerRequester<Req, Resp>,\n\n ServiceWorkerResponder<Req, Resp>,\n\n) {\n\n let (requester_tx, responder_rx) = mpsc::sync_channel(bound);\n\n let (responder_tx, requester_rx) = mpsc::sync_channel(bound);\n\n\n\n (\n\n ServiceWorkerRequester {\n\n sender: requester_tx,\n\n receiver: requester_rx,\n\n },\n\n ServiceWorkerResponder {\n\n sender: responder_tx,\n\n receiver: responder_rx,\n\n mio_waker,\n\n },\n\n )\n\n}\n","file_path":"shell_automaton/src/service/service_channel.rs","rank":83,"score":276858.56614394154},{"content":"pub fn peers_graylist_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::PeersGraylistAddress(action) => {\n\n if store.state.get().config.peers_graylist_disable {\n\n store.dispatch(PeerDisconnectAction {\n\n address: action.address,\n\n });\n\n return;\n\n }\n\n\n\n store.dispatch(PeersGraylistIpAddAction {\n\n ip: action.address.ip(),\n\n });\n\n }\n\n Action::PeersGraylistIpAdd(action) => {\n\n store.dispatch(PeersGraylistIpAddedAction { ip: action.ip });\n\n }\n\n Action::PeersGraylistIpAdded(action) => {\n\n let peers = &store.state.get().peers;\n\n // find all peers with same ip and disconnect/remove them.\n","file_path":"shell_automaton/src/peers/graylist/peers_graylist_effects.rs","rank":84,"score":275247.0754244244},{"content":"pub fn peers_init_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\n\n if let Action::PeersInit(_) = &action.action {\n\n let list = store.state().config.peers_dns_lookup_addresses.clone();\n\n\n\n // Do dns lookups to gather some potential peers.\n\n for (address, port) in list.into_iter() {\n\n store.dispatch(PeersDnsLookupInitAction { address, port });\n\n }\n\n\n\n // Try connecting to potential peers if we need peers.\n\n store.dispatch(PeerConnectionOutgoingRandomInitAction {});\n\n }\n\n}\n","file_path":"shell_automaton/src/peers/init/peers_init_effects.rs","rank":85,"score":275247.0754244244},{"content":"pub fn restart_bootstrap<S>(store: &mut Store<S>)\n\nwhere\n\n S: Service,\n\n{\n\n let state = store.state();\n\n let (peer, current_head) = match state\n\n .peers\n\n .handshaked_iter()\n\n .filter_map(|(addr, peer)| peer.current_head.as_ref().map(|head| (addr, head)))\n\n .max_by_key(|(_, b)| b.header.fitness())\n\n .filter(|(_, current_head)| {\n\n !state.is_same_head(current_head.header.level(), ¤t_head.hash)\n\n })\n\n .filter(|(_, current_head)| state.can_accept_new_head(current_head))\n\n {\n\n Some((addr, head)) => (addr, head.clone()),\n\n None => return,\n\n };\n\n store.dispatch(BootstrapFromPeerCurrentHeadAction { peer, current_head });\n\n}\n","file_path":"shell_automaton/src/bootstrap/bootstrap_effects.rs","rank":86,"score":272764.3649514817},{"content":"pub fn last_action_reducer(state: &mut State, action: &ActionWithMeta) {\n\n state.set_last_action(action);\n\n}\n\n\n","file_path":"shell_automaton/src/reducer.rs","rank":87,"score":272764.3649514817},{"content":"pub fn worker_channel<Req, Resp>(\n\n mio_waker: Arc<mio::Waker>,\n\n bound: usize,\n\n) -> (\n\n ServiceWorkerAsyncRequester<Req, Resp>,\n\n ServiceWorkerAsyncResponder<Req, Resp>,\n\n) {\n\n let (requester_tx, responder_rx) = mpsc::channel(bound);\n\n let (responder_tx, requester_rx) = mpsc::channel(bound);\n\n\n\n (\n\n ServiceWorkerAsyncRequester {\n\n sender: requester_tx,\n\n receiver: requester_rx,\n\n },\n\n ServiceWorkerAsyncResponder {\n\n sender: responder_tx,\n\n receiver: responder_rx,\n\n mio_waker,\n\n },\n\n )\n\n}\n","file_path":"shell_automaton/src/service/service_async_channel.rs","rank":88,"score":272609.9060214673},{"content":"pub fn hashed<'a, O, F>(mut parser: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, (O, Vec<u8>)>\n\nwhere\n\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\n\n{\n\n move |input| {\n\n let (rest, result) = parser(input)?;\n\n let hash = crypto::blake2b::digest_256(&input[..input.len() - rest.len()])\n\n .map_err(|e| nom::Err::Failure(NomError::hash_error(input, e)))?;\n\n Ok((rest, (result, hash)))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use num_bigint::BigInt;\n\n use num_traits::FromPrimitive;\n\n\n\n use super::error::*;\n\n use super::*;\n\n\n","file_path":"tezos/encoding/src/nom.rs","rank":89,"score":271856.4419754192},{"content":"fn create_logger() -> Logger {\n\n let drain = slog_async::Async::new(\n\n slog_term::FullFormat::new(slog_term::TermDecorator::new().build())\n\n .build()\n\n .fuse(),\n\n )\n\n .build()\n\n .filter_level(Level::Info)\n\n .fuse();\n\n\n\n Logger::root(drain, slog::o!())\n\n}\n","file_path":"storage/tests/storage_for_shell.rs","rank":90,"score":270153.2107102975},{"content":"pub fn print(is_stdout: bool, prefix: &str, s: Option<String>) {\n\n let bufwtr = if is_stdout {\n\n BufferWriter::stdout(ColorChoice::Always)\n\n } else {\n\n BufferWriter::stderr(ColorChoice::Always)\n\n };\n\n\n\n let mut buffer = bufwtr.buffer();\n\n buffer\n\n .set_color(ColorSpec::new().set_fg(Some(Color::Green)))\n\n .unwrap();\n\n buffer.write_all(prefix.as_bytes()).unwrap();\n\n buffer.set_color(ColorSpec::new().set_fg(None)).unwrap();\n\n\n\n if let Some(s) = s.as_ref() {\n\n buffer.write_all(s.as_bytes()).unwrap();\n\n };\n\n\n\n buffer.write_all(\"\\n\".as_bytes()).unwrap();\n\n\n","file_path":"tezos/context-tool/src/log.rs","rank":91,"score":270010.7640432748},{"content":"pub fn prechecker_reducer(state: &mut State, action: &ActionWithMeta) {\n\n // let PrecheckerState {\n\n // cached_operations,\n\n // operations,\n\n // proto_cache,\n\n // ..\n\n // } = &mut state.prechecker;\n\n let operations = &mut state.prechecker.operations;\n\n let cached_operations = &mut state.prechecker.cached_operations;\n\n let proto_cache = &mut state.prechecker.proto_cache;\n\n //let rights = &mut state.prechecker.rights;\n\n let rights = &mut state.rights;\n\n match &action.action {\n\n Action::PrecheckerCurrentHeadUpdate(PrecheckerCurrentHeadUpdateAction { head, .. }) => {\n\n let min_level = head.header.level().saturating_sub(2);\n\n let old_operations = cached_operations.remove_older(min_level);\n\n for old_operation in old_operations {\n\n let op_state = operations.remove(&old_operation);\n\n slog::debug!(\n\n state.log,\n","file_path":"shell_automaton/src/prechecker/prechecker_reducer.rs","rank":92,"score":268896.70376200404},{"content":"pub fn peer_reducer(state: &mut State, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::PeerTryReadLoopStart(PeerTryReadLoopStartAction { address }) => {\n\n if let Some(peer) = state.peers.get_mut(address) {\n\n peer.try_read_loop = PeerIOLoopState::Started {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n }\n\n Action::PeerTryReadLoopFinish(PeerTryReadLoopFinishAction { address, result }) => {\n\n if let Some(peer) = state.peers.get_mut(address) {\n\n peer.try_read_loop = PeerIOLoopState::Finished {\n\n time: action.time_as_nanos(),\n\n result: result.clone(),\n\n };\n\n }\n\n }\n\n Action::PeerTryWriteLoopStart(PeerTryWriteLoopStartAction { address }) => {\n\n if let Some(peer) = state.peers.get_mut(address) {\n\n peer.try_write_loop = PeerIOLoopState::Started {\n","file_path":"shell_automaton/src/peer/peer_reducer.rs","rank":93,"score":268896.70376200404},{"content":"pub fn shutdown_reducer(state: &mut State, action: &ActionWithMeta) {\n\n match &action.action {\n\n Action::ShutdownInit(_) => {\n\n state.shutdown = ShutdownState::Init {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n Action::ShutdownPending(_) => {\n\n state.shutdown = ShutdownState::pending(action.time_as_nanos());\n\n }\n\n Action::ShutdownSuccess(_) => {\n\n state.shutdown = ShutdownState::Success {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n Action::ProtocolRunnerShutdownSuccess(_) => {\n\n if let ShutdownState::Pending(state) = &mut state.shutdown {\n\n state.protocol_runner_shutdown = true\n\n }\n\n }\n\n _ => {}\n\n }\n\n}\n","file_path":"shell_automaton/src/shutdown/shutdown_reducer.rs","rank":94,"score":268896.70376200404},{"content":"pub fn mempool_reducer(state: &mut State, action: &ActionWithMeta) {\n\n if state.config.disable_mempool {\n\n return;\n\n }\n\n let mempool_state = &mut state.mempool;\n\n\n\n match &action.action {\n\n Action::MempoolValidatorValidateSuccess(content) => {\n\n let current_head_level = state.current_head.get().map(|v| v.header.level());\n\n\n\n if let Some(rpc_id) = mempool_state.injecting_rpc_ids.remove(&content.op_hash) {\n\n mempool_state.injected_rpc_ids.push(rpc_id);\n\n }\n\n\n\n match &content.result {\n\n MempoolValidatorValidateResult::Applied(v) => {\n\n if let Some(op) = mempool_state.pending_operations.remove(&v.hash) {\n\n mempool_state\n\n .validated_operations\n\n .ops\n","file_path":"shell_automaton/src/mempool/mempool_reducer.rs","rank":95,"score":268896.70376200404},{"content":"pub fn bootstrap_reducer(state: &mut State, action: &ActionWithMeta) {\n\n log_stats(state);\n\n match &action.action {\n\n Action::BootstrapInit(_) => {\n\n state.bootstrap = BootstrapState::Init {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n Action::BootstrapPeersConnectPending(_) => {\n\n state.bootstrap = BootstrapState::PeersConnectPending {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n Action::BootstrapPeersConnectSuccess(_) => {\n\n state.bootstrap = BootstrapState::PeersConnectSuccess {\n\n time: action.time_as_nanos(),\n\n };\n\n }\n\n Action::BootstrapPeersMainBranchFindPending(_) => {\n\n state.bootstrap = BootstrapState::PeersMainBranchFindPending {\n","file_path":"shell_automaton/src/bootstrap/bootstrap_reducer.rs","rank":96,"score":268896.70376200404},{"content":"pub fn zstd_decompress<B: AsRef<[u8]>>(input: B, output: &mut Vec<u8>) -> std::io::Result<()> {\n\n zstd::stream::copy_decode(input.as_ref(), output)\n\n}\n","file_path":"storage/src/commit_log/compression.rs","rank":97,"score":268322.0009626138},{"content":"pub fn zstd_compress<B: AsRef<[u8]>>(input: B, output: &mut Vec<u8>) -> std::io::Result<()> {\n\n zstd::stream::copy_encode(input.as_ref(), output, COMPRESSION_LEVEL)\n\n}\n\n\n","file_path":"storage/src/commit_log/compression.rs","rank":98,"score":268322.0009626138},{"content":"fn notify_new_current_head<S: Service>(store: &mut Store<S>) {\n\n let state = store.state.get();\n\n let block = match state.current_head.get() {\n\n Some(v) => v,\n\n None => return,\n\n };\n\n let chain_id = state.config.chain_id.clone().into();\n\n let is_bootstrapped = state.is_bootstrapped();\n\n let best_remote_level = state.best_remote_level();\n\n let new_head = NewCurrentHeadNotification::new(\n\n chain_id,\n\n block.clone().into(),\n\n is_bootstrapped,\n\n best_remote_level,\n\n );\n\n\n\n store\n\n .service\n\n .actors()\n\n .send(ActorsMessageTo::NewCurrentHead(new_head.into()));\n\n\n\n if let Some(stats) = store.service.statistics() {\n\n stats.current_head_update(state.time_as_nanos(), block);\n\n }\n\n}\n","file_path":"shell_automaton/src/current_head/current_head_effects.rs","rank":99,"score":267759.36466941977}],"string":"[\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn logger(empty: bool, level: Level) -> Logger {\\n\\n use std::io::{self, Write};\\n\\n\\n\\n use slog::Record;\\n\\n use slog_term::{CountingWriter, RecordDecorator, ThreadSafeTimestampFn};\\n\\n\\n\\n pub fn print_msg_header(\\n\\n fn_timestamp: &dyn ThreadSafeTimestampFn<Output = io::Result<()>>,\\n\\n mut rd: &mut dyn RecordDecorator,\\n\\n record: &Record,\\n\\n use_file_location: bool,\\n\\n ) -> io::Result<bool> {\\n\\n let _ = (fn_timestamp, record, use_file_location);\\n\\n rd.start_msg()?;\\n\\n let mut count_rd = CountingWriter::new(&mut rd);\\n\\n write!(count_rd, \\\"{}\\\", record.msg())?;\\n\\n Ok(count_rd.count() != 0)\\n\\n }\\n\\n\\n\\n if !empty {\\n\",\n \"file_path\": \"apps/baker/src/services/logger.rs\",\n \"rank\": 0,\n \"score\": 398181.7884122762\n },\n {\n \"content\": \"pub fn init_limits(log: &Logger) {\\n\\n // Need unsafe to access direct libc syscall interface\\n\\n unsafe {\\n\\n // Enable core dumps for debug build\\n\\n if cfg!(debug_assertions) {\\n\\n enable_core_dumps(log);\\n\\n }\\n\\n // Increase open files rlimit to 64k\\n\\n set_file_desc_limit(log, OPEN_FILES_LIMIT);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"light_node/src/system.rs\",\n \"rank\": 1,\n \"score\": 353502.91447634087\n },\n {\n \"content\": \"pub fn actors_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\\n\\n if let Action::WakeupEvent(_) = &action.action {\\n\\n while let Ok(msg) = store.service.actors().try_recv() {\\n\\n match msg {\\n\\n ActorsMessageFrom::Shutdown => {\\n\\n store.dispatch(ShutdownInitAction {});\\n\\n }\\n\\n ActorsMessageFrom::P2pInit => {\\n\\n store.dispatch(PeersInitAction {});\\n\\n }\\n\\n ActorsMessageFrom::ApplyBlock {\\n\\n block_hash,\\n\\n callback,\\n\\n ..\\n\\n } => {\\n\\n store\\n\\n .service\\n\\n .actors()\\n\\n .register_apply_block_callback(block_hash.clone(), callback);\\n\\n store.dispatch(BlockApplierEnqueueBlockAction {\\n\\n block_hash,\\n\\n injector_rpc_id: None,\\n\\n });\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/actors/actors_effects.rs\",\n \"rank\": 2,\n \"score\": 352636.18306737766\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn logger_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\\n\\n // eprintln!(\\\"[+] Action: {}\\\", action.action.as_ref());\\n\\n // eprintln!(\\\"[+] Action: {:#?}\\\", &action);\\n\\n // eprintln!(\\\"[+] State: {:#?}\\\\n\\\", store.state());\\n\\n\\n\\n let state = store.state.get();\\n\\n let log = &state.log;\\n\\n\\n\\n match &action.action {\\n\\n Action::CurrentHeadUpdate(content) => {\\n\\n slog::info!(log, \\\"CurrentHead Updated\\\";\\n\\n \\\"level\\\" => content.new_head.header.level(),\\n\\n \\\"hash\\\" => content.new_head.hash.to_string(),\\n\\n \\\"fitness\\\" => display_fitness(content.new_head.header.fitness()),\\n\\n \\\"payload_hash\\\" => format!(\\\"{:?}\\\", content.payload_hash.as_ref()));\\n\\n slog::debug!(log, \\\"CurrentHead Updated - full header\\\";\\n\\n \\\"new_head\\\" => slog::FnValue(|_| format!(\\\"{:?}\\\", content.new_head)));\\n\\n }\\n\\n Action::PeerCurrentHeadUpdate(content) => {\\n\\n slog::info!(log, \\\"Peer CurrentHead Updated\\\";\\n\",\n \"file_path\": \"shell_automaton/src/logger/logger_effects.rs\",\n \"rank\": 3,\n \"score\": 352625.3676169928\n },\n {\n \"content\": \"pub fn rpc_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::WakeupEvent(_) => {\\n\\n let wakeup_timestamp = Instant::now();\\n\\n while let Ok((msg, rpc_id)) = store.service().rpc().try_recv_stream() {\\n\\n match msg {\\n\\n RpcRequestStream::Bootstrapped => {\\n\\n store.dispatch(RpcBootstrappedAction { rpc_id });\\n\\n }\\n\\n RpcRequestStream::ValidBlocks(query) => {\\n\\n store.dispatch(RpcMonitorValidBlocksAction { query, rpc_id });\\n\\n }\\n\\n RpcRequestStream::GetOperations {\\n\\n applied,\\n\\n refused,\\n\\n branch_delayed,\\n\\n branch_refused,\\n\\n outdated,\\n\\n } => {\\n\\n store.dispatch(MempoolRegisterOperationsStreamAction {\\n\",\n \"file_path\": \"shell_automaton/src/rpc/rpc_effects.rs\",\n \"rank\": 4,\n \"score\": 351278.6468333168\n },\n {\n \"content\": \"/// Channel for communcation from Actor System to Automaton.\\n\\npub fn sync_channel(\\n\\n mio_waker: Arc<mio::Waker>,\\n\\n bound: usize,\\n\\n) -> (AutomatonSyncSender, AutomatonReceiver) {\\n\\n let (tx, rx) = mpsc::sync_channel(bound);\\n\\n\\n\\n let sender = AutomatonSyncSender {\\n\\n sender: tx,\\n\\n mio_waker,\\n\\n };\\n\\n\\n\\n (sender, rx)\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct ActorsServiceDefault {\\n\\n /// Channel receiver half for receiving messages from actors.\\n\\n actors_channel: mpsc::Receiver<ActorsMessageFrom>,\\n\\n\\n\\n /// NetworkChannel is used to send messages/notifications to actors.\\n\",\n \"file_path\": \"shell_automaton/src/service/actors_service.rs\",\n \"rank\": 5,\n \"score\": 346836.5162731013\n },\n {\n \"content\": \"pub fn main_logger() -> Logger {\\n\\n let drain = FullFormat::new(TermDecorator::new().build()).build().fuse();\\n\\n let drain = Async::new(drain)\\n\\n .chan_size(32768)\\n\\n .overflow_strategy(OverflowStrategy::Block)\\n\\n .build()\\n\\n .filter_level(Level::Info)\\n\\n .fuse();\\n\\n Logger::root(drain, o!())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"apps/baker/src/services/logger.rs\",\n \"rank\": 6,\n \"score\": 341207.9707803647\n },\n {\n \"content\": \"pub fn log_stats(state: &mut State) {\\n\\n // log every 2 seconds.\\n\\n const LOG_INTERVAL_S: u64 = 2;\\n\\n const LOG_INTERVAL_NS: u64 = LOG_INTERVAL_S * 1_000_000_000;\\n\\n\\n\\n let now = state.time_as_nanos();\\n\\n\\n\\n if let BootstrapState::PeersBlockHeadersGetPending {\\n\\n last_logged,\\n\\n last_logged_downloaded_count,\\n\\n main_chain,\\n\\n main_chain_last_level,\\n\\n peer_intervals,\\n\\n ..\\n\\n } = &mut state.bootstrap\\n\\n {\\n\\n if now - *last_logged < LOG_INTERVAL_NS {\\n\\n return;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/bootstrap/bootstrap_reducer.rs\",\n \"rank\": 7,\n \"score\": 339237.7387519819\n },\n {\n \"content\": \"/// Open commit log at a given path.\\n\\npub fn open_cl<P, I>(path: P, cfs: I, log: Logger) -> Result<CommitLogs, CommitLogError>\\n\\nwhere\\n\\n P: AsRef<Path>,\\n\\n I: IntoIterator<Item = CommitLogDescriptor>,\\n\\n{\\n\\n CommitLogs::new(path, cfs, log)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/persistent/mod.rs\",\n \"rank\": 8,\n \"score\": 324875.05940272374\n },\n {\n \"content\": \"pub fn storage_request_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::StorageRequestCreate(content) => {\\n\\n state.storage.requests.add(StorageRequestState {\\n\\n status: StorageRequestStatus::Idle {\\n\\n time: action.time_as_nanos(),\\n\\n },\\n\\n payload: content.payload.clone(),\\n\\n requestor: content.requestor.clone(),\\n\\n });\\n\\n }\\n\\n Action::StorageRequestPending(content) => {\\n\\n if let Some(req) = state.storage.requests.get_mut(content.req_id) {\\n\\n if let StorageRequestStatus::Idle { .. } = &req.status {\\n\\n req.status = StorageRequestStatus::Pending {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"shell_automaton/src/storage/request/storage_request_reducer.rs\",\n \"rank\": 9,\n \"score\": 322974.93891726027\n },\n {\n \"content\": \"/// All the actions which trigger checking for timeouts are called here.\\n\\npub fn check_timeouts<S: Service>(store: &mut Store<S>) {\\n\\n store.dispatch(PeersCheckTimeoutsInitAction {});\\n\\n store.dispatch(BootstrapCheckTimeoutsInitAction {});\\n\\n store.dispatch(MempoolTimeoutsInitAction {});\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/effects.rs\",\n \"rank\": 10,\n \"score\": 318048.8229659828\n },\n {\n \"content\": \"pub fn rpc_reducer(state: &mut crate::State, action: &crate::ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::RpcBootstrapped(RpcBootstrappedAction { rpc_id }) => {\\n\\n let bootstrapped = &mut state.rpc.bootstrapped;\\n\\n bootstrapped.requests.insert(*rpc_id);\\n\\n if bootstrapped.state.is_none() {\\n\\n if let BlockApplierApplyState::Success { block, .. } = &state.block_applier.current\\n\\n {\\n\\n bootstrapped.state = Some(BootstrapState {\\n\\n json: serde_json::json!({\\n\\n \\\"block\\\": block.hash,\\n\\n \\\"timestamp\\\": block.header.timestamp(),\\n\\n }),\\n\\n is_bootstrapped: true,\\n\\n });\\n\\n }\\n\\n }\\n\\n }\\n\\n Action::RpcBootstrappedNewBlock(RpcBootstrappedNewBlockAction {\\n\\n block,\\n\",\n \"file_path\": \"shell_automaton/src/rpc/rpc_reducer.rs\",\n \"rank\": 11,\n \"score\": 317963.88608796906\n },\n {\n \"content\": \"pub fn bounded_string<S: AsRef<str>>(max_len: usize) -> impl FnMut(S, &mut Vec<u8>) -> BinResult {\\n\\n move |data, out| {\\n\\n if data.as_ref().len() <= max_len {\\n\\n string(data, out)\\n\\n } else {\\n\\n Err(BinError::size_error(max_len, data.as_ref().len()))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tezos/encoding/src/enc.rs\",\n \"rank\": 12,\n \"score\": 317165.21432689205\n },\n {\n \"content\": \"pub fn is_ocaml_log_enabled() -> bool {\\n\\n env::var(\\\"OCAML_LOG_ENABLED\\\")\\n\\n .unwrap_or_else(|_| \\\"false\\\".to_string())\\n\\n .parse::<bool>()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tezos/interop/tests/common/mod.rs\",\n \"rank\": 13,\n \"score\": 315952.01499438146\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn bounded<'a, O, F>(max: usize, mut f: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\\n\\nwhere\\n\\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\\n\\n O: Clone,\\n\\n{\\n\\n move |input: NomInput| {\\n\\n let max = std::cmp::min(max, input.input_len());\\n\\n let bounded = input.slice(std::ops::RangeTo { end: max });\\n\\n match f.parse(bounded) {\\n\\n Ok((rest, parsed)) => Ok((\\n\\n input.slice(std::ops::RangeFrom {\\n\\n start: max - rest.input_len(),\\n\\n }),\\n\\n parsed,\\n\\n )),\\n\\n Err(Err::Error(DecodeError {\\n\\n input,\\n\\n kind: error::DecodeErrorKind::Nom(ErrorKind::Eof),\\n\\n other,\\n\\n })) => Err(Err::Error(DecodeError {\\n\\n input,\\n\\n kind: error::DecodeErrorKind::Boundary(BoundedEncodingKind::Bounded),\\n\\n other,\\n\\n })),\\n\\n e => e,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Reserves `size` trailing bytes of the input and applies parser to the rest of the input.\\n\",\n \"file_path\": \"tezos/encoding/src/nom.rs\",\n \"rank\": 14,\n \"score\": 315146.58997978794\n },\n {\n \"content\": \"fn ocaml_time_normalize(ocaml_time: f64) -> u64 {\\n\\n (ocaml_time * 1_000_000_000.0) as u64\\n\\n}\\n\\n\\n\\npub type BlocksApplyStats = HashMap<BlockHash, BlockApplyStats>;\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Default, Clone)]\\n\\npub struct BlockApplyStats {\\n\\n pub level: Level,\\n\\n pub block_timestamp: i64,\\n\\n pub validation_pass: u8,\\n\\n pub round: Option<i32>,\\n\\n\\n\\n pub receive_timestamp: u64,\\n\\n\\n\\n pub injected: Option<u64>,\\n\\n pub baker: Option<SignaturePublicKey>,\\n\\n pub priority: Option<u16>,\\n\\n\\n\\n pub payload_hash: Option<BlockPayloadHash>,\\n\",\n \"file_path\": \"shell_automaton/src/service/statistics_service/mod.rs\",\n \"rank\": 15,\n \"score\": 312495.1156126782\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn reserve<'a, O, F>(size: usize, mut parser: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\\n\\nwhere\\n\\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\\n\\n{\\n\\n move |input| {\\n\\n let input_len = input.len();\\n\\n let reserved_len = input_len - std::cmp::min(input_len, size);\\n\\n let reserved_input = &input[..reserved_len];\\n\\n let (reserved_input, out) = parser(reserved_input)?;\\n\\n Ok((&input[reserved_len - reserved_input.len()..], out))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Applies the `parser` to the input, addin field context to the error.\\n\",\n \"file_path\": \"tezos/encoding/src/nom.rs\",\n \"rank\": 16,\n \"score\": 311377.4610736418\n },\n {\n \"content\": \"/// Produces a JSON response from an FFI RPC response\\n\\npub fn make_response_with_status_and_json_string(status_code: u16, body: &str) -> ServiceResult {\\n\\n Ok(Response::builder()\\n\\n .header(hyper::header::CONTENT_TYPE, \\\"application/json\\\")\\n\\n // TODO: add to config\\n\\n .header(hyper::header::ACCESS_CONTROL_ALLOW_ORIGIN, \\\"*\\\")\\n\\n .header(hyper::header::ACCESS_CONTROL_ALLOW_HEADERS, \\\"Content-Type\\\")\\n\\n .header(hyper::header::ACCESS_CONTROL_ALLOW_HEADERS, \\\"content-type\\\")\\n\\n .header(\\n\\n hyper::header::ACCESS_CONTROL_ALLOW_HEADERS,\\n\\n \\\"x-requested-with\\\",\\n\\n )\\n\\n .header(\\n\\n hyper::header::ACCESS_CONTROL_ALLOW_METHODS,\\n\\n \\\"GET, POST, OPTIONS, PUT\\\",\\n\\n )\\n\\n .status(status_code)\\n\\n .body(Body::from(body.to_owned()))?)\\n\\n}\\n\\n\\n\\n/// Function to generate JSON response from a stream\\n\",\n \"file_path\": \"rpc/src/lib.rs\",\n \"rank\": 17,\n \"score\": 309034.0979880006\n },\n {\n \"content\": \"pub fn storage_request_effects<S>(store: &mut Store<S>, action: &ActionWithMeta)\\n\\nwhere\\n\\n S: Service,\\n\\n{\\n\\n match &action.action {\\n\\n Action::StorageRequestCreate(_) => {\\n\\n store.dispatch(StorageRequestInitAction {\\n\\n req_id: store.state().storage.requests.last_added_req_id(),\\n\\n });\\n\\n }\\n\\n Action::StorageRequestInit(action) => {\\n\\n let req = match store.state.get().storage.requests.get(action.req_id) {\\n\\n Some(v) => v,\\n\\n None => return,\\n\\n };\\n\\n match req.status {\\n\\n StorageRequestStatus::Idle { .. } => {}\\n\\n _ => return,\\n\\n }\\n\\n // TODO: handle send error in case of mpsc disconnection.\\n\",\n \"file_path\": \"shell_automaton/src/storage/request/storage_request_effects.rs\",\n \"rank\": 18,\n \"score\": 306625.4955731561\n },\n {\n \"content\": \"pub fn applied_actions_count_reducer(state: &mut State, _: &ActionWithMeta) {\\n\\n state.applied_actions_count += 1;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/reducer.rs\",\n \"rank\": 19,\n \"score\": 306352.7148144277\n },\n {\n \"content\": \"pub fn boolean(b: &bool, out: &mut Vec<u8>) -> BinResult {\\n\\n put_byte(\\n\\n if *b {\\n\\n &crate::types::BYTE_VAL_TRUE\\n\\n } else {\\n\\n &crate::types::BYTE_VAL_FALSE\\n\\n },\\n\\n out,\\n\\n );\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n// Rust integers encoding\\n\\nmod integers {\\n\\n macro_rules! encode_integer {\\n\\n ($t:ident) => {\\n\\n pub fn $t(i: &$t, out: &mut Vec<u8>) -> super::BinResult {\\n\\n super::put_bytes(&i.to_be_bytes(), out);\\n\\n Ok(())\\n\\n }\\n\",\n \"file_path\": \"tezos/encoding/src/enc.rs\",\n \"rank\": 20,\n \"score\": 304254.77695004444\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_001/helpers.rs\",\n \"rank\": 21,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_008_2/helpers.rs\",\n \"rank\": 22,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_005_2/helpers.rs\",\n \"rank\": 23,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_007/helpers.rs\",\n \"rank\": 24,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_009/helpers.rs\",\n \"rank\": 25,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_004/helpers.rs\",\n \"rank\": 26,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_003/helpers.rs\",\n \"rank\": 27,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_010/helpers.rs\",\n \"rank\": 28,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_002/helpers.rs\",\n \"rank\": 29,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_008/helpers.rs\",\n \"rank\": 30,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_011/helpers.rs\",\n \"rank\": 31,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_006/helpers.rs\",\n \"rank\": 32,\n \"score\": 303685.1474562311\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_012/helpers.rs\",\n \"rank\": 33,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_prng_number(state: RandomSeedState, bound: i32) -> TezosPRNGResult {\\n\\n if bound < 1 {\\n\\n return Err(TezosPRNGError::BoundNotCorrect { bound });\\n\\n }\\n\\n let v: i32;\\n\\n // Note: this part aims to be similar\\n\\n // hash once again and take the 4 highest bytes and we got our random number\\n\\n let mut sequence = state;\\n\\n loop {\\n\\n let hashed = blake2b::digest_256(&sequence)?.to_vec();\\n\\n\\n\\n // computation for overflow check\\n\\n let drop_if_over = i32::max_value() - (i32::max_value() % bound);\\n\\n\\n\\n // 4 highest bytes\\n\\n let r = num_from_slice!(hashed, 0, i32).abs();\\n\\n\\n\\n // potentional overflow, keep the state of the generator and do one more iteration\\n\\n sequence = hashed;\\n\\n if r >= drop_if_over {\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_013/helpers.rs\",\n \"rank\": 34,\n \"score\": 303685.14745623106\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn bounded_string<'a>(max: usize) -> impl FnMut(NomInput<'a>) -> NomResult<'a, String> {\\n\\n map_res(\\n\\n complete(length_data(bounded_size(BoundedEncodingKind::String, max))),\\n\\n |bytes| std::str::from_utf8(bytes).map(str::to_string),\\n\\n )\\n\\n}\\n\\n\\n\\n/// Parser that applies specified parser to the fixed length slice of input.\\n\",\n \"file_path\": \"tezos/encoding/src/nom.rs\",\n \"rank\": 35,\n \"score\": 302436.1786644062\n },\n {\n \"content\": \"pub fn identity_1() -> Identity {\\n\\n const IDENTITY: &str = r#\\\"\\n\\n{\\n\\n \\\"peer_id\\\": \\\"idrdoT9g6YwELhUQyshCcHwAzBS9zA\\\",\\n\\n \\\"proof_of_work_stamp\\\": \\\"bbc2300149249e1ccc84a54362236c3cbbc2cc2ffbd3b6ea\\\",\\n\\n \\\"public_key\\\": \\\"94498d9416140fbc458495333daac1b4c87e419f5726717a54f9b6c67476ae1c\\\",\\n\\n \\\"secret_key\\\": \\\"ac7acf3afed7637be10f8fc76a2eb6b3359c78adb1d813b41cbab3fae954f4b1\\\"\\n\\n}\\n\\n\\\"#;\\n\\n Identity::from_json(IDENTITY).unwrap()\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone)]\\n\\npub struct Config {\\n\\n pub initial_time: SystemTime,\\n\\n\\n\\n pub protocol_runner: ProtocolRunnerConfiguration,\\n\\n pub init_storage_data: StorageInitInfo,\\n\\n\\n\\n pub port: Port,\\n\",\n \"file_path\": \"shell_automaton/src/config.rs\",\n \"rank\": 36,\n \"score\": 301674.90770058933\n },\n {\n \"content\": \"pub fn storage_state_snapshot_create_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::StorageStateSnapshotCreatePending(action) => {\\n\\n let state = &mut state.storage.state_snapshot.create;\\n\\n if !state.is_pending() {\\n\\n *state = StorageStateSnapshotCreateState::Pending {\\n\\n action_id: action.action_id,\\n\\n applied_actions_count: action.applied_actions_count,\\n\\n };\\n\\n }\\n\\n }\\n\\n Action::StorageStateSnapshotCreateError(action) => {\\n\\n let state = &mut state.storage.state_snapshot.create;\\n\\n let (action_id, applied_actions_count) = match state {\\n\\n StorageStateSnapshotCreateState::Pending {\\n\\n action_id,\\n\\n applied_actions_count,\\n\\n } => (*action_id, *applied_actions_count),\\n\\n _ => return,\\n\\n };\\n\",\n \"file_path\": \"shell_automaton/src/storage/state_snapshot/create/storage_state_snapshot_create_reducer.rs\",\n \"rank\": 37,\n \"score\": 301252.7764101563\n },\n {\n \"content\": \"pub fn storage_blocks_genesis_init_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n if let Action::StorageBlocksGenesisInitSuccess(_) = &action.action {\\n\\n state.storage.blocks.genesis.init = StorageBlocksGenesisInitState::Success;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/storage/blocks/genesis/init/storage_blocks_genesis_init_reducer.rs\",\n \"rank\": 38,\n \"score\": 301252.7764101563\n },\n {\n \"content\": \"pub fn effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\\n\\n // these four effects must be first and in this order!\\n\\n // if action.action.as_ref().starts_with(\\\"Rights\\\") {\\n\\n // slog::debug!(store.state().log, \\\"Rights action\\\"; \\\"action\\\" => format!(\\\"{:#?}\\\", action.action));\\n\\n // }\\n\\n\\n\\n logger_effects(store, action);\\n\\n last_action_effects(store, action);\\n\\n applied_actions_count_effects(store, action);\\n\\n\\n\\n paused_loops_effects(store, action);\\n\\n\\n\\n stats_current_head_effects(store, action);\\n\\n\\n\\n protocol_runner_effects(store, action);\\n\\n\\n\\n protocol_runner_spawn_server_effects(store, action);\\n\\n\\n\\n protocol_runner_latest_context_hashes_effects(store, action);\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/effects.rs\",\n \"rank\": 39,\n \"score\": 300360.7520255495\n },\n {\n \"content\": \"// TODO: needs to take a path and other stuff, not just env?\\n\\nfn initialize_persistent_storage(env: &Environment, log: &Logger) -> PersistentStorage {\\n\\n // create common RocksDB block cache to be shared among column families\\n\\n // IMPORTANT: Cache object must live at least as long as DB (returned by open_kv)\\n\\n let mut caches = GlobalRocksDbCacheHolder::with_capacity(1);\\n\\n let main_chain = MainChain::new(\\n\\n env.tezos_network_config\\n\\n .main_chain_id()\\n\\n .expect(\\\"Failed to decode chainId\\\"),\\n\\n env.tezos_network_config.version.clone(),\\n\\n );\\n\\n\\n\\n // initialize dbs\\n\\n let kv_cache = RocksDbCache::new_lru_cache(env.storage.db.cache_size)\\n\\n .expect(\\\"Failed to initialize RocksDB cache (db)\\\");\\n\\n\\n\\n let maindb = match env.storage.main_db {\\n\\n TezedgeDatabaseBackendConfiguration::Sled => initialize_maindb(\\n\\n log,\\n\\n None,\\n\\n &env.storage.db,\\n\",\n \"file_path\": \"light_node/src/main.rs\",\n \"rank\": 40,\n \"score\": 300117.80869208346\n },\n {\n \"content\": \"fn with_log(log: Logger) -> BoxedFilter<(Logger,)> {\\n\\n warp::any().map(move || log.clone()).boxed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/filters.rs\",\n \"rank\": 41,\n \"score\": 299653.64795409713\n },\n {\n \"content\": \"/// Process block operations. This will mark operations in store for the block as seen.\\n\\n///\\n\\n/// Returns tuple:\\n\\n/// (\\n\\n/// are_operations_complete,\\n\\n/// missing_validation_passes\\n\\n/// )\\n\\npub fn process_block_operations(\\n\\n env: &RpcServiceEnvironment,\\n\\n message: &OperationsForBlocksMessage,\\n\\n) -> Result<(bool, Option<HashSet<u8>>), StorageError> {\\n\\n let operations_storage = OperationsStorage::new(env.persistent_storage());\\n\\n let operations_meta_storage = OperationsMetaStorage::new(env.persistent_storage());\\n\\n if operations_meta_storage.is_complete(message.operations_for_block().hash())? {\\n\\n return Ok((true, None));\\n\\n }\\n\\n\\n\\n operations_storage.put_operations(message)?;\\n\\n operations_meta_storage.put_operations(message)\\n\\n}\\n\\n\\n\\npub async fn try_apply_block(\\n\\n env: &RpcServiceEnvironment,\\n\\n block: &BlockHeaderWithHash,\\n\\n) -> Result<(), InjectBlockError> {\\n\\n let block_meta_storage = BlockMetaStorage::new(env.persistent_storage());\\n\\n let operations_meta_storage = OperationsMetaStorage::new(env.persistent_storage());\\n\",\n \"file_path\": \"rpc/src/services/mempool_services.rs\",\n \"rank\": 42,\n \"score\": 296048.0719726635\n },\n {\n \"content\": \"fn enqueue_injected_block<S: Service>(store: &mut Store<S>) {\\n\\n let state = store.state();\\n\\n\\n\\n if state.block_applier.current.is_pending() || !state.block_applier.queue.is_empty() {\\n\\n return;\\n\\n }\\n\\n\\n\\n if !state.bootstrap.can_inject_block() {\\n\\n return;\\n\\n }\\n\\n\\n\\n let mut blocks = state\\n\\n .rpc\\n\\n .injected_blocks\\n\\n .iter()\\n\\n .map(|(_, data)| {\\n\\n (\\n\\n data.block.hash.clone(),\\n\\n data.rpc_id,\\n\\n data.block.header.fitness().clone(),\\n\",\n \"file_path\": \"shell_automaton/src/rpc/rpc_effects.rs\",\n \"rank\": 43,\n \"score\": 295190.1010712349\n },\n {\n \"content\": \"fn find_block_with_context_hash_impl(\\n\\n head_block_storage: BlockHeaderWithHash,\\n\\n latest_context_hashes: &[ContextHash],\\n\\n block_storage: &BlockStorage,\\n\\n) -> Result<Option<BlockHeaderWithHash>, StorageError> {\\n\\n let mut head = head_block_storage;\\n\\n let latest_context_hashes = HashSet::<&ContextHash>::from_iter(latest_context_hashes.iter());\\n\\n\\n\\n while !latest_context_hashes.contains(head.header.context()) {\\n\\n if head.header.level() == 0 {\\n\\n return Ok(None);\\n\\n }\\n\\n\\n\\n head = match block_storage.get(head.header.predecessor())? {\\n\\n Some(head) => head,\\n\\n _ => return Ok(None),\\n\\n };\\n\\n }\\n\\n\\n\\n Ok(Some(head))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/service/storage_service.rs\",\n \"rank\": 44,\n \"score\": 294952.5333596722\n },\n {\n \"content\": \"fn with_log(log: Logger) -> BoxedFilter<(Logger,)> {\\n\\n warp::any().map(move || log.clone()).boxed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"monitoring/src/websocket/ws_server.rs\",\n \"rank\": 45,\n \"score\": 293260.5700425993\n },\n {\n \"content\": \"pub fn peer_message_size(bytes: impl AsRef<[u8]>) -> Result<usize, BinaryReaderError> {\\n\\n let size = complete_input(size, bytes.as_ref())?;\\n\\n Ok(size as usize)\\n\\n}\\n\",\n \"file_path\": \"tezos/messages/src/p2p/mod.rs\",\n \"rank\": 46,\n \"score\": 293190.6958682678\n },\n {\n \"content\": \"pub fn storage_blocks_genesis_check_applied_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::StorageBlocksGenesisCheckAppliedInit(_) => {\\n\\n state.storage.blocks.genesis.check_applied =\\n\\n StorageBlocksGenesisCheckAppliedState::GetMetaInit;\\n\\n }\\n\\n Action::StorageBlocksGenesisCheckAppliedGetMetaPending(_) => {\\n\\n let req_id = state.storage.requests.last_added_req_id();\\n\\n state.storage.blocks.genesis.check_applied =\\n\\n StorageBlocksGenesisCheckAppliedState::GetMetaPending { req_id };\\n\\n }\\n\\n Action::StorageBlocksGenesisCheckAppliedGetMetaError(_) => {\\n\\n state.storage.blocks.genesis.check_applied =\\n\\n StorageBlocksGenesisCheckAppliedState::GetMetaError {};\\n\\n }\\n\\n Action::StorageBlocksGenesisCheckAppliedGetMetaSuccess(content) => {\\n\\n state.storage.blocks.genesis.check_applied =\\n\\n StorageBlocksGenesisCheckAppliedState::GetMetaSuccess {\\n\\n meta: content.meta.clone(),\\n\\n };\\n\",\n \"file_path\": \"shell_automaton/src/storage/blocks/genesis/check_applied/storage_blocks_genesis_check_applied_reducer.rs\",\n \"rank\": 47,\n \"score\": 291931.90599307127\n },\n {\n \"content\": \"/// Process block_header, stores/updates storages, schedules missing stuff\\n\\n///\\n\\n/// Returns:\\n\\n/// [metadata] - block header metadata\\n\\n/// [is_new_block] - if it is a new block or previosly stored\\n\\n/// [are_operations_complete] - if operations are completed\\n\\n///\\n\\npub fn process_injected_block_header(\\n\\n env: &RpcServiceEnvironment,\\n\\n chain_id: &ChainId,\\n\\n block_header: &BlockHeaderWithHash,\\n\\n) -> Result<(Meta, bool, bool), StorageError> {\\n\\n let block_storage = BlockStorage::new(env.persistent_storage());\\n\\n let block_meta_storage = BlockMetaStorage::new(env.persistent_storage());\\n\\n // store block\\n\\n let is_new_block = block_storage.put_block_header(block_header)?;\\n\\n\\n\\n // update block metadata\\n\\n let metadata = block_meta_storage.put_block_header(block_header, chain_id, env.log())?;\\n\\n\\n\\n // update operations metadata\\n\\n let are_operations_complete = process_injected_block_header_operations(env, block_header)?;\\n\\n\\n\\n Ok((metadata, is_new_block, are_operations_complete))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rpc/src/services/mempool_services.rs\",\n \"rank\": 48,\n \"score\": 291410.693845827\n },\n {\n \"content\": \"/// Find the node to monitor\\n\\npub fn find_node_process_id(port: u16) -> Result<Option<i32>, ProcError> {\\n\\n let all_procs = process::all_processes().expect(\\\"No processes found on system\\\");\\n\\n\\n\\n let mut process_map: HashMap<u32, &Process> = HashMap::new();\\n\\n\\n\\n // create mapping between processes and inodes\\n\\n for process in &all_procs {\\n\\n if let ProcResult::Ok(fds) = process.fd() {\\n\\n for fd in fds {\\n\\n if let process::FDTarget::Socket(inode) = fd.target {\\n\\n process_map.insert(inode, process);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // get the tcp table\\n\\n let tcp = tcp()?;\\n\\n let tcp6 = tcp6()?;\\n\\n\\n\\n for entry in tcp.into_iter().chain(tcp6) {\\n\\n if port == entry.local_address.port() && entry.state == TcpState::Listen {\\n\\n if let Some(process) = process_map.get(&entry.inode) {\\n\\n return Ok(Some(process.pid()));\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(None)\\n\\n}\\n\",\n \"file_path\": \"apps/node_monitoring/src/node.rs\",\n \"rank\": 49,\n \"score\": 290928.8112341297\n },\n {\n \"content\": \"pub fn start_applying_next_block<S: Service>(store: &mut Store<S>) {\\n\\n if let Some((block_hash, injector_rpc_id)) = store.state().block_applier.queue.front().cloned()\\n\\n {\\n\\n store.dispatch(BlockApplierApplyInitAction {\\n\\n block_hash,\\n\\n injector_rpc_id,\\n\\n });\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/block_applier/block_applier_effects.rs\",\n \"rank\": 50,\n \"score\": 290769.6905512983\n },\n {\n \"content\": \"#[no_coverage]\\n\\nfn complexity<const SIZE: usize>(_t: &SizedBytes<SIZE>, cplx: f64) -> f64 {\\n\\n cplx\\n\\n}\\n\\n\\n\\nimpl<const SIZE: usize> SizedBytesMutator<SIZE> {\\n\\n #[no_coverage]\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\\n 0: MapMutator::new(\\n\\n FixedLenVecMutator::<u8, U8Mutator>::new_with_repeated_mutator(\\n\\n U8Mutator::default(),\\n\\n SIZE,\\n\\n ),\\n\\n vec_from_sizedbytes,\\n\\n sizedbytes_from_vec,\\n\\n complexity,\\n\\n ),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tezos/encoding/src/fuzzing/sizedbytes.rs\",\n \"rank\": 51,\n \"score\": 288133.6341003617\n },\n {\n \"content\": \"pub fn storage_state_snapshot_create_effects<S>(store: &mut Store<S>, action: &ActionWithMeta)\\n\\nwhere\\n\\n S: Service,\\n\\n{\\n\\n match &action.action {\\n\\n Action::StorageStateSnapshotCreateInit(_) => {\\n\\n let req_payload =\\n\\n StorageRequestPayload::StateSnapshotPut(Box::new(store.state().clone()));\\n\\n let req = StorageRequest::new(None, req_payload).subscribe();\\n\\n let _ = store.service.storage().request_send(req);\\n\\n\\n\\n let action = StorageStateSnapshotCreatePendingAction {\\n\\n action_id: store.state().last_action.id(),\\n\\n applied_actions_count: store.state().applied_actions_count,\\n\\n };\\n\\n store.dispatch(action);\\n\\n }\\n\\n Action::StorageStateSnapshotCreateError(_)\\n\\n | Action::StorageStateSnapshotCreateSuccess(_) => {\\n\\n store.dispatch(StorageStateSnapshotCreateInitAction {});\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/storage/state_snapshot/create/storage_state_snapshot_create_effects.rs\",\n \"rank\": 52,\n \"score\": 286346.3394118248\n },\n {\n \"content\": \"pub fn storage_blocks_genesis_init_effects<S>(store: &mut Store<S>, action: &ActionWithMeta)\\n\\nwhere\\n\\n S: Service,\\n\\n{\\n\\n match &action.action {\\n\\n Action::StorageBlocksGenesisInit(content) => {\\n\\n store.dispatch(StorageBlocksGenesisInitHeaderPutInitAction {\\n\\n genesis_commit_hash: content.genesis_commit_hash.clone(),\\n\\n });\\n\\n }\\n\\n Action::StorageBlocksGenesisInitHeaderPutSuccess(_) => {\\n\\n store.dispatch(StorageBlocksGenesisInitAdditionalDataPutInitAction {});\\n\\n }\\n\\n Action::StorageBlocksGenesisInitAdditionalDataPutSuccess(_) => {\\n\\n store.dispatch(StorageBlocksGenesisInitCommitResultGetInitAction {});\\n\\n }\\n\\n Action::StorageBlocksGenesisInitCommitResultGetSuccess(_) => {\\n\\n store.dispatch(StorageBlocksGenesisInitCommitResultPutInitAction {});\\n\\n }\\n\\n Action::StorageBlocksGenesisInitCommitResultPutSuccess(_) => {\\n\\n store.dispatch(StorageBlocksGenesisInitSuccessAction {});\\n\\n }\\n\\n Action::StorageBlocksGenesisInitSuccess(_) => {\\n\\n store.dispatch(CurrentHeadRehydrateInitAction {});\\n\\n store.dispatch(ProtocolRunnerNotifyStatusAction {});\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/storage/blocks/genesis/init/storage_blocks_genesis_init_effects.rs\",\n \"rank\": 53,\n \"score\": 286346.3394118248\n },\n {\n \"content\": \"// it may be string without quotes, it is invalid json, let's read it manually\\n\\nfn read_error(response: &mut impl io::Read, status: StatusCode) -> Result<(), RpcErrorInner> {\\n\\n let mut buf = [0; 0x1000];\\n\\n io::Read::read(response, &mut buf)?;\\n\\n let err = str::from_utf8(&buf)?\\n\\n .trim_end_matches('\\\\0')\\n\\n .trim_end_matches('\\\\n');\\n\\n Err(RpcErrorInner::NodeError(err.to_string(), status))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"apps/baker/src/services/client.rs\",\n \"rank\": 54,\n \"score\": 285023.049685247\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sized<'a, O, F>(size: usize, f: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\\n\\nwhere\\n\\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\\n\\n{\\n\\n map_parser(take(size), f)\\n\\n}\\n\\n\\n\\n/// Parses optional field. Byte `0x00` indicates absence of the field,\\n\\n/// byte `0xff` preceedes encoding of the existing field.\\n\",\n \"file_path\": \"tezos/encoding/src/nom.rs\",\n \"rank\": 55,\n \"score\": 283726.012158446\n },\n {\n \"content\": \"pub fn storage_blocks_genesis_init_header_put_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::StorageBlocksGenesisInitHeaderPutInit(_) => {\\n\\n state.storage.blocks.genesis.init = StorageBlocksGenesisInitHeaderPutState::Init.into();\\n\\n }\\n\\n Action::StorageBlocksGenesisInitHeaderPutPending(_) => {\\n\\n let req_id = state.storage.requests.last_added_req_id();\\n\\n state.storage.blocks.genesis.init =\\n\\n StorageBlocksGenesisInitHeaderPutState::Pending { req_id }.into();\\n\\n }\\n\\n Action::StorageBlocksGenesisInitHeaderPutError(_) => {\\n\\n state.storage.blocks.genesis.init =\\n\\n StorageBlocksGenesisInitHeaderPutState::Error {}.into();\\n\\n }\\n\\n Action::StorageBlocksGenesisInitHeaderPutSuccess(content) => {\\n\\n state.storage.blocks.genesis.init = StorageBlocksGenesisInitHeaderPutState::Success {\\n\\n is_new_block: content.is_new_block,\\n\\n }\\n\\n .into();\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/storage/blocks/genesis/init/header_put/storage_blocks_genesis_init_header_put_reducer.rs\",\n \"rank\": 56,\n \"score\": 283446.8523402496\n },\n {\n \"content\": \"pub fn string(data: impl AsRef<str>, out: &mut Vec<u8>) -> BinResult {\\n\\n put_size(data.as_ref().len(), out)?;\\n\\n put_bytes(data.as_ref().as_bytes(), out);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tezos/encoding/src/enc.rs\",\n \"rank\": 57,\n \"score\": 282327.88459430984\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_010/helpers.rs\",\n \"rank\": 58,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_009/helpers.rs\",\n \"rank\": 59,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_002/helpers.rs\",\n \"rank\": 60,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_013/helpers.rs\",\n \"rank\": 61,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_008_2/helpers.rs\",\n \"rank\": 62,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_012/helpers.rs\",\n \"rank\": 63,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_008/helpers.rs\",\n \"rank\": 64,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_005_2/helpers.rs\",\n \"rank\": 65,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_006/helpers.rs\",\n \"rank\": 66,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_011/helpers.rs\",\n \"rank\": 67,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_001/helpers.rs\",\n \"rank\": 68,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_003/helpers.rs\",\n \"rank\": 69,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_007/helpers.rs\",\n \"rank\": 70,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init_prng(\\n\\n cycle_meta_data: &CycleData,\\n\\n constants: &RightsConstants,\\n\\n use_string_bytes: &[u8],\\n\\n cycle_position: i32,\\n\\n offset: i32,\\n\\n) -> Result<RandomSeedState, anyhow::Error> {\\n\\n // a safe way to convert betwwen types is to use try_from\\n\\n let nonce_size = usize::try_from(*constants.nonce_length())?;\\n\\n let state = cycle_meta_data.seed_bytes();\\n\\n let zero_bytes: Vec<u8> = vec![0; nonce_size];\\n\\n\\n\\n // take the state (initially the random seed), zero bytes, the use string and the blocks position in the cycle as bytes, merge them together and hash the result\\n\\n let rd = blake2b::digest_256(&merge_slices!(\\n\\n state,\\n\\n &zero_bytes,\\n\\n use_string_bytes,\\n\\n &cycle_position.to_be_bytes()\\n\\n ))?\\n\\n .to_vec();\\n\",\n \"file_path\": \"rpc/src/services/protocol/proto_004/helpers.rs\",\n \"rank\": 71,\n \"score\": 281895.98154266377\n },\n {\n \"content\": \"pub fn reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n if let Action::StorageStateSnapshotCreateInit(_) = &action.action {\\n\\n // This action shouldn't cause changes in the state, so that in the\\n\\n // effects, we will save exact same state that was before calling\\n\\n // this action.\\n\\n return;\\n\\n }\\n\\n\\n\\n chain_reducers!(\\n\\n state,\\n\\n action,\\n\\n paused_loops_reducer,\\n\\n protocol_runner_latest_context_hashes_reducer,\\n\\n protocol_runner_spawn_server_reducer,\\n\\n protocol_runner_init_reducer,\\n\\n protocol_runner_init_runtime_reducer,\\n\\n protocol_runner_init_context_reducer,\\n\\n protocol_runner_init_context_ipc_server_reducer,\\n\\n protocol_runner_reducer,\\n\\n current_head_reducer,\\n\",\n \"file_path\": \"shell_automaton/src/reducer.rs\",\n \"rank\": 72,\n \"score\": 281032.49153533985\n },\n {\n \"content\": \"pub trait ActorsService {\\n\\n /// Send message to actors.\\n\\n fn send(&self, msg: ActorsMessageTo);\\n\\n\\n\\n /// Try to receive/read queued message from actors, if there is any.\\n\\n fn try_recv(&mut self) -> Result<ActorsMessageFrom, mpsc::TryRecvError>;\\n\\n\\n\\n fn register_apply_block_callback(\\n\\n &mut self,\\n\\n block_hash: Arc<BlockHash>,\\n\\n callback: ApplyBlockCallback,\\n\\n );\\n\\n\\n\\n fn call_apply_block_callback(&mut self, block_hash: &BlockHash, result: ApplyBlockResult);\\n\\n}\\n\\n\\n\\n/// Message to actors.\\n\\n#[derive(Debug, Clone)]\\n\\npub enum ActorsMessageTo {\\n\\n PeerHandshaked(Arc<PeerId>, MetadataMessage, Arc<NetworkVersion>),\\n\",\n \"file_path\": \"shell_automaton/src/service/actors_service.rs\",\n \"rank\": 73,\n \"score\": 280164.0284761753\n },\n {\n \"content\": \"pub trait RandomnessService {\\n\\n fn get_nonce(&mut self, peer: SocketAddr) -> Nonce;\\n\\n\\n\\n /// Choose peer to initiate random outgoing connection.\\n\\n fn choose_peer(&mut self, list: &[SocketAddr]) -> Option<SocketAddr>;\\n\\n\\n\\n fn choose_potential_peers_for_advertise(&mut self, list: &[SocketAddr]) -> Vec<SocketAddr>;\\n\\n\\n\\n fn choose_potential_peers_for_nack(&mut self, list: &[SocketAddr]) -> Vec<SocketAddr>;\\n\\n}\\n\\n\\n\\nimpl<R> RandomnessService for R\\n\\nwhere\\n\\n R: Rng + Debug,\\n\\n{\\n\\n fn get_nonce(&mut self, _: SocketAddr) -> Nonce {\\n\\n let mut b: [u8; NONCE_SIZE] = [0; NONCE_SIZE];\\n\\n self.fill(&mut b);\\n\\n Nonce::new(&b)\\n\\n }\\n\",\n \"file_path\": \"shell_automaton/src/service/randomness_service.rs\",\n \"rank\": 74,\n \"score\": 280144.6911747833\n },\n {\n \"content\": \"pub trait MioService {\\n\\n type PeerStream: Read + Write;\\n\\n type Events;\\n\\n type InternalEvent;\\n\\n\\n\\n fn wait_for_events(&mut self, events: &mut Self::Events, timeout: Option<Duration>);\\n\\n fn transform_event(&mut self, event: &Self::InternalEvent) -> Event;\\n\\n\\n\\n fn peer_connection_incoming_listen_start(&mut self) -> io::Result<()>;\\n\\n fn peer_connection_incoming_listen_stop(&mut self);\\n\\n fn peer_connection_incoming_accept(\\n\\n &mut self,\\n\\n ) -> Result<(PeerToken, MioPeerRefMut<Self::PeerStream>), PeerConnectionIncomingAcceptError>;\\n\\n\\n\\n fn peer_connection_init(&mut self, address: SocketAddr) -> io::Result<PeerToken>;\\n\\n fn peer_disconnect(&mut self, token: PeerToken);\\n\\n\\n\\n fn peer_get(&mut self, token: PeerToken) -> Option<MioPeerRefMut<Self::PeerStream>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/service/mio_service.rs\",\n \"rank\": 75,\n \"score\": 280119.1020885114\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn bounded_dynamic<'a, O, F>(max: usize, f: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, O>\\n\\nwhere\\n\\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\\n\\n O: Clone,\\n\\n{\\n\\n length_value(\\n\\n bounded_size(BoundedEncodingKind::Dynamic, max),\\n\\n all_consuming(f),\\n\\n )\\n\\n}\\n\\n\\n\\n/// Applies the parser `f` to the input, limiting it to `max` bytes at most.\\n\",\n \"file_path\": \"tezos/encoding/src/nom.rs\",\n \"rank\": 76,\n \"score\": 279791.96870363125\n },\n {\n \"content\": \"pub trait StorageService {\\n\\n /// Send the request to storage for execution.\\n\\n fn request_send(&mut self, req: StorageRequest)\\n\\n -> Result<(), RequestSendError<StorageRequest>>;\\n\\n\\n\\n /// Try to receive/read queued response, if there is any.\\n\\n fn response_try_recv(&mut self) -> Result<StorageResponse, ResponseTryRecvError>;\\n\\n\\n\\n fn blocks_genesis_commit_result_put(\\n\\n &mut self,\\n\\n init_storage_info: &StorageInitInfo,\\n\\n commit_result: CommitGenesisResult,\\n\\n ) -> Result<(), StorageError>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/service/storage_service.rs\",\n \"rank\": 77,\n \"score\": 279315.40456460975\n },\n {\n \"content\": \"pub trait RpcService {\\n\\n /// Try to receive a request from rpc\\n\\n fn try_recv(&mut self) -> Result<(RpcRequest, RpcId), RpcRecvError>;\\n\\n\\n\\n /// Respond on the request, `json` is `None` means close the stream\\n\\n fn respond<J>(&mut self, call_id: RpcId, json: J)\\n\\n where\\n\\n J: 'static + Send + Serialize;\\n\\n\\n\\n /// Try to receive a request from rpc, but response is expected to be stream\\n\\n fn try_recv_stream(&mut self) -> Result<(RpcRequestStream, RpcId), RpcRecvError>;\\n\\n\\n\\n /// Respond on the request with json value, `None` means the stream is terminated\\n\\n fn respond_stream(&mut self, call_id: RpcId, json: Option<serde_json::Value>);\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone)]\\n\\npub struct StorageRequest {\\n\\n pub req_id: RequestId,\\n\\n pub pending_since: u64,\\n\",\n \"file_path\": \"shell_automaton/src/service/rpc_service.rs\",\n \"rank\": 78,\n \"score\": 278805.20700415864\n },\n {\n \"content\": \"/// Returns only true, if new_fitness is greater than head's fitness\\n\\npub fn is_fitness_increases_or_same(head: &Head, new_fitness: &Fitness) -> bool {\\n\\n fitness_increases_or_same(head.fitness(), new_fitness)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell/src/validation/mod.rs\",\n \"rank\": 79,\n \"score\": 278704.0099879071\n },\n {\n \"content\": \"/// Returns only true, if new_fitness is greater than head's fitness\\n\\npub fn is_fitness_increases(head: &Head, new_fitness: &Fitness) -> bool {\\n\\n fitness_increases(head.fitness(), new_fitness)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell/src/validation/mod.rs\",\n \"rank\": 80,\n \"score\": 278704.0099879071\n },\n {\n \"content\": \"pub fn create_routes(tezedge_is_enabled: bool) -> PathTree<MethodHandler> {\\n\\n let mut routes = PathTree::<MethodHandler>::new();\\n\\n\\n\\n // Shell rpc - implemented\\n\\n routes.handle(\\n\\n hash_set![Method::GET],\\n\\n \\\"/version\\\",\\n\\n shell_handler::node_version,\\n\\n );\\n\\n routes.handle(\\n\\n hash_set![Method::GET],\\n\\n \\\"/monitor/bootstrapped\\\",\\n\\n shell_handler::bootstrapped,\\n\\n );\\n\\n routes.handle(\\n\\n hash_set![Method::GET],\\n\\n \\\"/monitor/commit_hash\\\",\\n\\n shell_handler::commit_hash,\\n\\n );\\n\\n routes.handle(\\n\",\n \"file_path\": \"rpc/src/server/router.rs\",\n \"rank\": 81,\n \"score\": 278683.3895165555\n },\n {\n \"content\": \"pub fn get_blocks_per_cycle(\\n\\n protocol_hash: &ProtocolHash,\\n\\n serialized_constants: &str,\\n\\n) -> Result<i32, anyhow::Error> {\\n\\n let supported_protocol = SupportedProtocol::try_from(protocol_hash)?;\\n\\n\\n\\n match supported_protocol {\\n\\n SupportedProtocol::Proto001 => Ok(serde_json::from_str::<proto_001::ProtocolConstants>(\\n\\n serialized_constants,\\n\\n )?\\n\\n .blocks_per_cycle()),\\n\\n SupportedProtocol::Proto002 => Ok(serde_json::from_str::<proto_002::ProtocolConstants>(\\n\\n serialized_constants,\\n\\n )?\\n\\n .blocks_per_cycle()),\\n\\n SupportedProtocol::Proto003 => Ok(serde_json::from_str::<proto_003::ProtocolConstants>(\\n\\n serialized_constants,\\n\\n )?\\n\\n .blocks_per_cycle()),\\n\\n SupportedProtocol::Proto004 => Ok(serde_json::from_str::<proto_004::ProtocolConstants>(\\n\",\n \"file_path\": \"rpc/src/services/protocol/mod.rs\",\n \"rank\": 82,\n \"score\": 277038.72457972646\n },\n {\n \"content\": \"pub fn worker_channel<Req, Resp>(\\n\\n mio_waker: Arc<mio::Waker>,\\n\\n bound: usize,\\n\\n) -> (\\n\\n ServiceWorkerRequester<Req, Resp>,\\n\\n ServiceWorkerResponder<Req, Resp>,\\n\\n) {\\n\\n let (requester_tx, responder_rx) = mpsc::sync_channel(bound);\\n\\n let (responder_tx, requester_rx) = mpsc::sync_channel(bound);\\n\\n\\n\\n (\\n\\n ServiceWorkerRequester {\\n\\n sender: requester_tx,\\n\\n receiver: requester_rx,\\n\\n },\\n\\n ServiceWorkerResponder {\\n\\n sender: responder_tx,\\n\\n receiver: responder_rx,\\n\\n mio_waker,\\n\\n },\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/service/service_channel.rs\",\n \"rank\": 83,\n \"score\": 276858.56614394154\n },\n {\n \"content\": \"pub fn peers_graylist_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::PeersGraylistAddress(action) => {\\n\\n if store.state.get().config.peers_graylist_disable {\\n\\n store.dispatch(PeerDisconnectAction {\\n\\n address: action.address,\\n\\n });\\n\\n return;\\n\\n }\\n\\n\\n\\n store.dispatch(PeersGraylistIpAddAction {\\n\\n ip: action.address.ip(),\\n\\n });\\n\\n }\\n\\n Action::PeersGraylistIpAdd(action) => {\\n\\n store.dispatch(PeersGraylistIpAddedAction { ip: action.ip });\\n\\n }\\n\\n Action::PeersGraylistIpAdded(action) => {\\n\\n let peers = &store.state.get().peers;\\n\\n // find all peers with same ip and disconnect/remove them.\\n\",\n \"file_path\": \"shell_automaton/src/peers/graylist/peers_graylist_effects.rs\",\n \"rank\": 84,\n \"score\": 275247.0754244244\n },\n {\n \"content\": \"pub fn peers_init_effects<S: Service>(store: &mut Store<S>, action: &ActionWithMeta) {\\n\\n if let Action::PeersInit(_) = &action.action {\\n\\n let list = store.state().config.peers_dns_lookup_addresses.clone();\\n\\n\\n\\n // Do dns lookups to gather some potential peers.\\n\\n for (address, port) in list.into_iter() {\\n\\n store.dispatch(PeersDnsLookupInitAction { address, port });\\n\\n }\\n\\n\\n\\n // Try connecting to potential peers if we need peers.\\n\\n store.dispatch(PeerConnectionOutgoingRandomInitAction {});\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/peers/init/peers_init_effects.rs\",\n \"rank\": 85,\n \"score\": 275247.0754244244\n },\n {\n \"content\": \"pub fn restart_bootstrap<S>(store: &mut Store<S>)\\n\\nwhere\\n\\n S: Service,\\n\\n{\\n\\n let state = store.state();\\n\\n let (peer, current_head) = match state\\n\\n .peers\\n\\n .handshaked_iter()\\n\\n .filter_map(|(addr, peer)| peer.current_head.as_ref().map(|head| (addr, head)))\\n\\n .max_by_key(|(_, b)| b.header.fitness())\\n\\n .filter(|(_, current_head)| {\\n\\n !state.is_same_head(current_head.header.level(), ¤t_head.hash)\\n\\n })\\n\\n .filter(|(_, current_head)| state.can_accept_new_head(current_head))\\n\\n {\\n\\n Some((addr, head)) => (addr, head.clone()),\\n\\n None => return,\\n\\n };\\n\\n store.dispatch(BootstrapFromPeerCurrentHeadAction { peer, current_head });\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/bootstrap/bootstrap_effects.rs\",\n \"rank\": 86,\n \"score\": 272764.3649514817\n },\n {\n \"content\": \"pub fn last_action_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n state.set_last_action(action);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"shell_automaton/src/reducer.rs\",\n \"rank\": 87,\n \"score\": 272764.3649514817\n },\n {\n \"content\": \"pub fn worker_channel<Req, Resp>(\\n\\n mio_waker: Arc<mio::Waker>,\\n\\n bound: usize,\\n\\n) -> (\\n\\n ServiceWorkerAsyncRequester<Req, Resp>,\\n\\n ServiceWorkerAsyncResponder<Req, Resp>,\\n\\n) {\\n\\n let (requester_tx, responder_rx) = mpsc::channel(bound);\\n\\n let (responder_tx, requester_rx) = mpsc::channel(bound);\\n\\n\\n\\n (\\n\\n ServiceWorkerAsyncRequester {\\n\\n sender: requester_tx,\\n\\n receiver: requester_rx,\\n\\n },\\n\\n ServiceWorkerAsyncResponder {\\n\\n sender: responder_tx,\\n\\n receiver: responder_rx,\\n\\n mio_waker,\\n\\n },\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/service/service_async_channel.rs\",\n \"rank\": 88,\n \"score\": 272609.9060214673\n },\n {\n \"content\": \"pub fn hashed<'a, O, F>(mut parser: F) -> impl FnMut(NomInput<'a>) -> NomResult<'a, (O, Vec<u8>)>\\n\\nwhere\\n\\n F: FnMut(NomInput<'a>) -> NomResult<'a, O>,\\n\\n{\\n\\n move |input| {\\n\\n let (rest, result) = parser(input)?;\\n\\n let hash = crypto::blake2b::digest_256(&input[..input.len() - rest.len()])\\n\\n .map_err(|e| nom::Err::Failure(NomError::hash_error(input, e)))?;\\n\\n Ok((rest, (result, hash)))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use num_bigint::BigInt;\\n\\n use num_traits::FromPrimitive;\\n\\n\\n\\n use super::error::*;\\n\\n use super::*;\\n\\n\\n\",\n \"file_path\": \"tezos/encoding/src/nom.rs\",\n \"rank\": 89,\n \"score\": 271856.4419754192\n },\n {\n \"content\": \"fn create_logger() -> Logger {\\n\\n let drain = slog_async::Async::new(\\n\\n slog_term::FullFormat::new(slog_term::TermDecorator::new().build())\\n\\n .build()\\n\\n .fuse(),\\n\\n )\\n\\n .build()\\n\\n .filter_level(Level::Info)\\n\\n .fuse();\\n\\n\\n\\n Logger::root(drain, slog::o!())\\n\\n}\\n\",\n \"file_path\": \"storage/tests/storage_for_shell.rs\",\n \"rank\": 90,\n \"score\": 270153.2107102975\n },\n {\n \"content\": \"pub fn print(is_stdout: bool, prefix: &str, s: Option<String>) {\\n\\n let bufwtr = if is_stdout {\\n\\n BufferWriter::stdout(ColorChoice::Always)\\n\\n } else {\\n\\n BufferWriter::stderr(ColorChoice::Always)\\n\\n };\\n\\n\\n\\n let mut buffer = bufwtr.buffer();\\n\\n buffer\\n\\n .set_color(ColorSpec::new().set_fg(Some(Color::Green)))\\n\\n .unwrap();\\n\\n buffer.write_all(prefix.as_bytes()).unwrap();\\n\\n buffer.set_color(ColorSpec::new().set_fg(None)).unwrap();\\n\\n\\n\\n if let Some(s) = s.as_ref() {\\n\\n buffer.write_all(s.as_bytes()).unwrap();\\n\\n };\\n\\n\\n\\n buffer.write_all(\\\"\\\\n\\\".as_bytes()).unwrap();\\n\\n\\n\",\n \"file_path\": \"tezos/context-tool/src/log.rs\",\n \"rank\": 91,\n \"score\": 270010.7640432748\n },\n {\n \"content\": \"pub fn prechecker_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n // let PrecheckerState {\\n\\n // cached_operations,\\n\\n // operations,\\n\\n // proto_cache,\\n\\n // ..\\n\\n // } = &mut state.prechecker;\\n\\n let operations = &mut state.prechecker.operations;\\n\\n let cached_operations = &mut state.prechecker.cached_operations;\\n\\n let proto_cache = &mut state.prechecker.proto_cache;\\n\\n //let rights = &mut state.prechecker.rights;\\n\\n let rights = &mut state.rights;\\n\\n match &action.action {\\n\\n Action::PrecheckerCurrentHeadUpdate(PrecheckerCurrentHeadUpdateAction { head, .. }) => {\\n\\n let min_level = head.header.level().saturating_sub(2);\\n\\n let old_operations = cached_operations.remove_older(min_level);\\n\\n for old_operation in old_operations {\\n\\n let op_state = operations.remove(&old_operation);\\n\\n slog::debug!(\\n\\n state.log,\\n\",\n \"file_path\": \"shell_automaton/src/prechecker/prechecker_reducer.rs\",\n \"rank\": 92,\n \"score\": 268896.70376200404\n },\n {\n \"content\": \"pub fn peer_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::PeerTryReadLoopStart(PeerTryReadLoopStartAction { address }) => {\\n\\n if let Some(peer) = state.peers.get_mut(address) {\\n\\n peer.try_read_loop = PeerIOLoopState::Started {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n }\\n\\n Action::PeerTryReadLoopFinish(PeerTryReadLoopFinishAction { address, result }) => {\\n\\n if let Some(peer) = state.peers.get_mut(address) {\\n\\n peer.try_read_loop = PeerIOLoopState::Finished {\\n\\n time: action.time_as_nanos(),\\n\\n result: result.clone(),\\n\\n };\\n\\n }\\n\\n }\\n\\n Action::PeerTryWriteLoopStart(PeerTryWriteLoopStartAction { address }) => {\\n\\n if let Some(peer) = state.peers.get_mut(address) {\\n\\n peer.try_write_loop = PeerIOLoopState::Started {\\n\",\n \"file_path\": \"shell_automaton/src/peer/peer_reducer.rs\",\n \"rank\": 93,\n \"score\": 268896.70376200404\n },\n {\n \"content\": \"pub fn shutdown_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n match &action.action {\\n\\n Action::ShutdownInit(_) => {\\n\\n state.shutdown = ShutdownState::Init {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n Action::ShutdownPending(_) => {\\n\\n state.shutdown = ShutdownState::pending(action.time_as_nanos());\\n\\n }\\n\\n Action::ShutdownSuccess(_) => {\\n\\n state.shutdown = ShutdownState::Success {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n Action::ProtocolRunnerShutdownSuccess(_) => {\\n\\n if let ShutdownState::Pending(state) = &mut state.shutdown {\\n\\n state.protocol_runner_shutdown = true\\n\\n }\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/shutdown/shutdown_reducer.rs\",\n \"rank\": 94,\n \"score\": 268896.70376200404\n },\n {\n \"content\": \"pub fn mempool_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n if state.config.disable_mempool {\\n\\n return;\\n\\n }\\n\\n let mempool_state = &mut state.mempool;\\n\\n\\n\\n match &action.action {\\n\\n Action::MempoolValidatorValidateSuccess(content) => {\\n\\n let current_head_level = state.current_head.get().map(|v| v.header.level());\\n\\n\\n\\n if let Some(rpc_id) = mempool_state.injecting_rpc_ids.remove(&content.op_hash) {\\n\\n mempool_state.injected_rpc_ids.push(rpc_id);\\n\\n }\\n\\n\\n\\n match &content.result {\\n\\n MempoolValidatorValidateResult::Applied(v) => {\\n\\n if let Some(op) = mempool_state.pending_operations.remove(&v.hash) {\\n\\n mempool_state\\n\\n .validated_operations\\n\\n .ops\\n\",\n \"file_path\": \"shell_automaton/src/mempool/mempool_reducer.rs\",\n \"rank\": 95,\n \"score\": 268896.70376200404\n },\n {\n \"content\": \"pub fn bootstrap_reducer(state: &mut State, action: &ActionWithMeta) {\\n\\n log_stats(state);\\n\\n match &action.action {\\n\\n Action::BootstrapInit(_) => {\\n\\n state.bootstrap = BootstrapState::Init {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n Action::BootstrapPeersConnectPending(_) => {\\n\\n state.bootstrap = BootstrapState::PeersConnectPending {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n Action::BootstrapPeersConnectSuccess(_) => {\\n\\n state.bootstrap = BootstrapState::PeersConnectSuccess {\\n\\n time: action.time_as_nanos(),\\n\\n };\\n\\n }\\n\\n Action::BootstrapPeersMainBranchFindPending(_) => {\\n\\n state.bootstrap = BootstrapState::PeersMainBranchFindPending {\\n\",\n \"file_path\": \"shell_automaton/src/bootstrap/bootstrap_reducer.rs\",\n \"rank\": 96,\n \"score\": 268896.70376200404\n },\n {\n \"content\": \"pub fn zstd_decompress<B: AsRef<[u8]>>(input: B, output: &mut Vec<u8>) -> std::io::Result<()> {\\n\\n zstd::stream::copy_decode(input.as_ref(), output)\\n\\n}\\n\",\n \"file_path\": \"storage/src/commit_log/compression.rs\",\n \"rank\": 97,\n \"score\": 268322.0009626138\n },\n {\n \"content\": \"pub fn zstd_compress<B: AsRef<[u8]>>(input: B, output: &mut Vec<u8>) -> std::io::Result<()> {\\n\\n zstd::stream::copy_encode(input.as_ref(), output, COMPRESSION_LEVEL)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"storage/src/commit_log/compression.rs\",\n \"rank\": 98,\n \"score\": 268322.0009626138\n },\n {\n \"content\": \"fn notify_new_current_head<S: Service>(store: &mut Store<S>) {\\n\\n let state = store.state.get();\\n\\n let block = match state.current_head.get() {\\n\\n Some(v) => v,\\n\\n None => return,\\n\\n };\\n\\n let chain_id = state.config.chain_id.clone().into();\\n\\n let is_bootstrapped = state.is_bootstrapped();\\n\\n let best_remote_level = state.best_remote_level();\\n\\n let new_head = NewCurrentHeadNotification::new(\\n\\n chain_id,\\n\\n block.clone().into(),\\n\\n is_bootstrapped,\\n\\n best_remote_level,\\n\\n );\\n\\n\\n\\n store\\n\\n .service\\n\\n .actors()\\n\\n .send(ActorsMessageTo::NewCurrentHead(new_head.into()));\\n\\n\\n\\n if let Some(stats) = store.service.statistics() {\\n\\n stats.current_head_update(state.time_as_nanos(), block);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"shell_automaton/src/current_head/current_head_effects.rs\",\n \"rank\": 99,\n \"score\": 267759.36466941977\n }\n]","isConversational":false}}},{"rowIdx":3686,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"pipelined/bevy_pbr2/src/render/light.rs"},"repo_name":{"kind":"string","value":"bch29/bevy"},"commit":{"kind":"string","value":"c53efeed6fb8b1e41737ea4502051fa4cf535784"},"file_code":{"kind":"string","value":"use crate::{render::MeshViewBindGroups, ExtractedMeshes, PointLight};\nuse bevy_ecs::{prelude::*, system::SystemState};\nuse bevy_math::{Mat4, Vec3, Vec4};\nuse bevy_render2::{\n color::Color,\n core_pipeline::Transparent3dPhase,\n pass::*,\n pipeline::*,\n render_graph::{Node, NodeRunError, RenderGraphContext, SlotInfo, SlotType},\n render_phase::{Draw, DrawFunctions, RenderPhase, TrackedRenderPass},\n render_resource::{DynamicUniformVec, SamplerId, TextureId, TextureViewId},\n renderer::{RenderContext, RenderResources},\n shader::{Shader, ShaderStage, ShaderStages},\n texture::*,\n view::{ExtractedView, ViewUniform},\n};\nuse bevy_transform::components::GlobalTransform;\nuse crevice::std140::AsStd140;\nuse std::num::NonZeroU32;\n\npub struct ExtractedPointLight {\n color: Color,\n intensity: f32,\n range: f32,\n radius: f32,\n transform: GlobalTransform,\n}\n\n#[repr(C)]\n#[derive(Copy, Clone, AsStd140, Default, Debug)]\npub struct GpuLight {\n color: Vec4,\n range: f32,\n radius: f32,\n position: Vec3,\n view_proj: Mat4,\n}\n\n#[repr(C)]\n#[derive(Copy, Clone, Debug, AsStd140)]\npub struct GpuLights {\n len: u32,\n lights: [GpuLight; MAX_POINT_LIGHTS],\n}\n\npub const MAX_POINT_LIGHTS: usize = 10;\npub const SHADOW_SIZE: Extent3d = Extent3d {\n width: 1024,\n height: 1024,\n depth_or_array_layers: MAX_POINT_LIGHTS as u32,\n};\npub const SHADOW_FORMAT: TextureFormat = TextureFormat::Depth32Float;\n\npub struct ShadowShaders {\n pub pipeline: PipelineId,\n pub pipeline_descriptor: RenderPipelineDescriptor,\n pub light_sampler: SamplerId,\n}\n\nimpl FromWorld for ShadowShaders {\n fn from_world(world: &mut World) -> Self {\n let render_resources = world.get_resource::<RenderResources>().unwrap();\n let vertex_shader = Shader::from_glsl(ShaderStage::Vertex, include_str!(\"pbr.vert\"))\n .get_spirv_shader(None)\n .unwrap();\n let vertex_layout = vertex_shader.reflect_layout(&Default::default()).unwrap();\n\n let mut pipeline_layout = PipelineLayout::from_shader_layouts(&mut [vertex_layout]);\n\n let vertex = render_resources.create_shader_module(&vertex_shader);\n\n pipeline_layout.vertex_buffer_descriptors = vec![VertexBufferLayout {\n stride: 32,\n name: \"Vertex\".into(),\n step_mode: InputStepMode::Vertex,\n attributes: vec![\n \n VertexAttribute {\n name: \"Vertex_Position\".into(),\n format: VertexFormat::Float32x3,\n offset: 12,\n shader_location: 0,\n },\n VertexAttribute {\n name: \"Vertex_Normals\".into(),\n format: VertexFormat::Float32x3,\n offset: 0,\n shader_location: 1,\n },\n VertexAttribute {\n name: \"Vertex_Uv\".into(),\n format: VertexFormat::Float32x2,\n offset: 24,\n shader_location: 2,\n },\n ],\n }];\n\n pipeline_layout.bind_group_mut(0).bindings[0].set_dynamic(true);\n pipeline_layout.bind_group_mut(1).bindings[0].set_dynamic(true);\n pipeline_layout.update_bind_group_ids();\n\n let pipeline_descriptor = RenderPipelineDescriptor {\n depth_stencil: Some(DepthStencilState {\n format: SHADOW_FORMAT,\n depth_write_enabled: true,\n depth_compare: CompareFunction::LessEqual,\n stencil: StencilState {\n front: StencilFaceState::IGNORE,\n back: StencilFaceState::IGNORE,\n read_mask: 0,\n write_mask: 0,\n },\n bias: DepthBiasState {\n constant: 2,\n slope_scale: 2.0,\n clamp: 0.0,\n },\n }),\n primitive: PrimitiveState {\n topology: PrimitiveTopology::TriangleList,\n cull_mode: Some(Face::Back),\n \n clamp_depth: false,\n ..Default::default()\n },\n color_target_states: vec![],\n ..RenderPipelineDescriptor::new(\n ShaderStages {\n vertex,\n fragment: None,\n },\n pipeline_layout,\n )\n };\n\n let pipeline = render_resources.create_render_pipeline(&pipeline_descriptor);\n\n ShadowShaders {\n pipeline,\n pipeline_descriptor,\n light_sampler: render_resources.create_sampler(&SamplerDescriptor {\n address_mode_u: AddressMode::ClampToEdge,\n address_mode_v: AddressMode::ClampToEdge,\n address_mode_w: AddressMode::ClampToEdge,\n mag_filter: FilterMode::Linear,\n min_filter: FilterMode::Linear,\n mipmap_filter: FilterMode::Nearest,\n compare_function: Some(CompareFunction::LessEqual),\n ..Default::default()\n }),\n }\n }\n}\n\npub fn extract_lights(\n mut commands: Commands,\n lights: Query<(Entity, &PointLight, &GlobalTransform)>,\n) {\n for (entity, light, transform) in lights.iter() {\n commands.get_or_spawn(entity).insert(ExtractedPointLight {\n color: light.color,\n intensity: light.intensity,\n range: light.range,\n radius: light.radius,\n transform: transform.clone(),\n });\n }\n}\n\npub struct ViewLight {\n pub depth_texture: TextureViewId,\n}\n\npub struct ViewLights {\n pub light_depth_texture: TextureId,\n pub light_depth_texture_view: TextureViewId,\n pub lights: Vec<Entity>,\n pub gpu_light_binding_index: u32,\n}\n\n#[derive(Default)]\npub struct LightMeta {\n pub view_gpu_lights: DynamicUniformVec<GpuLights>,\n}\n\npub fn prepare_lights(\n mut commands: Commands,\n mut texture_cache: ResMut<TextureCache>,\n render_resources: Res<RenderResources>,\n mut light_meta: ResMut<LightMeta>,\n views: Query<Entity, With<RenderPhase<Transparent3dPhase>>>,\n lights: Query<&ExtractedPointLight>,\n) {\n \n light_meta\n .view_gpu_lights\n .reserve_and_clear(views.iter().count(), &render_resources);\n\n \n for entity in views.iter() {\n let light_depth_texture = texture_cache.get(\n &render_resources,\n TextureDescriptor {\n size: SHADOW_SIZE,\n mip_level_count: 1,\n sample_count: 1,\n dimension: TextureDimension::D2,\n format: SHADOW_FORMAT,\n usage: TextureUsage::RENDER_ATTACHMENT | TextureUsage::SAMPLED,\n ..Default::default()\n },\n );\n let mut view_lights = Vec::new();\n\n let mut gpu_lights = GpuLights {\n len: lights.iter().len() as u32,\n lights: [GpuLight::default(); MAX_POINT_LIGHTS],\n };\n\n \n for (i, light) in lights.iter().enumerate().take(MAX_POINT_LIGHTS) {\n let depth_texture_view = render_resources.create_texture_view(\n light_depth_texture.texture,\n TextureViewDescriptor {\n format: None,\n dimension: Some(TextureViewDimension::D2),\n aspect: TextureAspect::All,\n base_mip_level: 0,\n level_count: None,\n base_array_layer: i as u32,\n array_layer_count: NonZeroU32::new(1),\n },\n );\n\n let view_transform = GlobalTransform::from_translation(light.transform.translation)\n .looking_at(Vec3::default(), Vec3::Y);\n \n let projection = Mat4::perspective_rh(1.0472, 1.0, 1.0, 20.0);\n\n gpu_lights.lights[i] = GpuLight {\n \n \n color: (light.color * light.intensity).into(),\n radius: light.radius.into(),\n position: light.transform.translation.into(),\n range: 1.0 / (light.range * light.range),\n \n view_proj: projection * view_transform.compute_matrix().inverse(),\n };\n\n let view_light_entity = commands\n .spawn()\n .insert_bundle((\n ViewLight {\n depth_texture: depth_texture_view,\n },\n ExtractedView {\n width: SHADOW_SIZE.width,\n height: SHADOW_SIZE.height,\n transform: view_transform.clone(),\n projection,\n },\n RenderPhase::<ShadowPhase>::default(),\n ))\n .id();\n view_lights.push(view_light_entity);\n }\n\n commands.entity(entity).insert(ViewLights {\n light_depth_texture: light_depth_texture.texture,\n light_depth_texture_view: light_depth_texture.default_view,\n lights: view_lights,\n gpu_light_binding_index: light_meta.view_gpu_lights.push(gpu_lights),\n });\n }\n\n light_meta\n .view_gpu_lights\n .write_to_staging_buffer(&render_resources);\n}\n\npub fn cleanup_view_lights(render_resources: Res<RenderResources>, query: Query<&ViewLight>) {\n for view_light in query.iter() {\n render_resources.remove_texture_view(view_light.depth_texture);\n }\n}\n\npub struct ShadowPhase;\n\npub struct ShadowPassNode {\n main_view_query: QueryState<&'static ViewLights>,\n view_light_query: QueryState<(&'static ViewLight, &'static RenderPhase<ShadowPhase>)>,\n}\n\nimpl ShadowPassNode {\n pub const IN_VIEW: &'static str = \"view\";\n\n pub fn new(world: &mut World) -> Self {\n Self {\n main_view_query: QueryState::new(world),\n view_light_query: QueryState::new(world),\n }\n }\n}\n\nimpl Node for ShadowPassNode {\n fn input(&self) -> Vec<SlotInfo> {\n vec![SlotInfo::new(ShadowPassNode::IN_VIEW, SlotType::Entity)]\n }\n\n fn update(&mut self, world: &mut World) {\n self.main_view_query.update_archetypes(world);\n self.view_light_query.update_archetypes(world);\n }\n\n fn run(\n &self,\n graph: &mut RenderGraphContext,\n render_context: &mut dyn RenderContext,\n world: &World,\n ) -> Result<(), NodeRunError> {\n let view_entity = graph.get_input_entity(Self::IN_VIEW)?;\n let view_lights = self.main_view_query.get_manual(world, view_entity).unwrap();\n for view_light_entity in view_lights.lights.iter().copied() {\n let (view_light, shadow_phase) = self\n .view_light_query\n .get_manual(world, view_light_entity)\n .unwrap();\n let pass_descriptor = PassDescriptor {\n color_attachments: Vec::new(),\n depth_stencil_attachment: Some(RenderPassDepthStencilAttachment {\n attachment: TextureAttachment::Id(view_light.depth_texture),\n depth_ops: Some(Operations {\n load: LoadOp::Clear(1.0),\n store: true,\n }),\n stencil_ops: None,\n }),\n sample_count: 1,\n };\n\n let draw_functions = world.get_resource::<DrawFunctions>().unwrap();\n\n render_context.begin_render_pass(\n &pass_descriptor,\n &mut |render_pass: &mut dyn RenderPass| {\n let mut draw_functions = draw_functions.write();\n let mut tracked_pass = TrackedRenderPass::new(render_pass);\n for drawable in shadow_phase.drawn_things.iter() {\n let draw_function = draw_functions.get_mut(drawable.draw_function).unwrap();\n draw_function.draw(\n world,\n &mut tracked_pass,\n view_light_entity,\n drawable.draw_key,\n drawable.sort_key,\n );\n }\n },\n );\n }\n\n Ok(())\n }\n}\n\ntype DrawShadowMeshParams<'a> = (\n Res<'a, ShadowShaders>,\n Res<'a, ExtractedMeshes>,\n Query<'a, (&'a ViewUniform, &'a MeshViewBindGroups)>,\n);\npub struct DrawShadowMesh {\n params: SystemState<DrawShadowMeshParams<'static>>,\n}\n\nimpl DrawShadowMesh {\n pub fn new(world: &mut World) -> Self {\n Self {\n params: SystemState::new(world),\n }\n }\n}\n\nimpl Draw for DrawShadowMesh {\n fn draw(\n &mut self,\n world: &World,\n pass: &mut TrackedRenderPass,\n view: Entity,\n draw_key: usize,\n _sort_key: usize,\n ) {\n let (shadow_shaders, extracted_meshes, views) = self.params.get(world);\n let (view_uniforms, mesh_view_bind_groups) = views.get(view).unwrap();\n let layout = &shadow_shaders.pipeline_descriptor.layout;\n let extracted_mesh = &extracted_meshes.meshes[draw_key];\n pass.set_pipeline(shadow_shaders.pipeline);\n pass.set_bind_group(\n 0,\n layout.bind_group(0).id,\n mesh_view_bind_groups.view_bind_group,\n Some(&[view_uniforms.view_uniform_offset]),\n );\n\n pass.set_bind_group(\n 1,\n layout.bind_group(1).id,\n mesh_view_bind_groups.mesh_transform_bind_group,\n Some(&[extracted_mesh.transform_binding_offset]),\n );\n pass.set_vertex_buffer(0, extracted_mesh.vertex_buffer, 0);\n if let Some(index_info) = &extracted_mesh.index_info {\n pass.set_index_buffer(index_info.buffer, 0, IndexFormat::Uint32);\n pass.draw_indexed(0..index_info.count, 0, 0..1);\n } else {\n panic!(\"non-indexed drawing not supported yet\")\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::{render::MeshViewBindGroups, ExtractedMeshes, PointLight};\nuse bevy_ecs::{prelude::*, system::SystemState};\nuse bevy_math::{Mat4, Vec3, Vec4};\nuse bevy_render2::{\n color::Color,\n core_pipeline::Transparent3dPhase,\n pass::*,\n pipeline::*,\n render_graph::{Node, NodeRunError, RenderGraphContext, SlotInfo, SlotType},\n render_phase::{Draw, DrawFunctions, RenderPhase, TrackedRenderPass},\n render_resource::{DynamicUniformVec, SamplerId, TextureId, TextureViewId},\n renderer::{RenderContext, RenderResources},\n shader::{Shader, ShaderStage, ShaderStages},\n texture::*,\n view::{ExtractedView, ViewUniform},\n};\nuse bevy_transform::components::GlobalTransform;\nuse crevice::std140::AsStd140;\nuse std::num::NonZeroU32;\n\npub struct ExtractedPointLight {\n color: Color,\n intensity: f32,\n range: f32,\n radius: f32,\n transform: GlobalTransform,\n}\n\n#[repr(C)]\n#[derive(Copy, Clone, AsStd140, Default, Debug)]\npub struct GpuLight {\n color: Vec4,\n range: f32,\n radius: f32,\n position: Vec3,\n view_proj: Mat4,\n}\n\n#[repr(C)]\n#[derive(Copy, Clone, Debug, AsStd140)]\npub struct GpuLights {\n len: u32,\n lights: [GpuLight; MAX_POINT_LIGHTS],\n}\n\npub const MAX_POINT_LIGHTS: usize = 10;\npub const SHADOW_SIZE: Extent3d = Extent3d {\n width: 1024,\n height: 1024,\n depth_or_array_layers: MAX_POINT_LIGHTS as u32,\n};\npub const SHADOW_FORMAT: TextureFormat = TextureFormat::Depth32Float;\n\npub struct ShadowShaders {\n pub pipeline: PipelineId,\n pub pipeline_descriptor: RenderPipelineDescriptor,\n pub light_sampler: SamplerId,\n}\n\nimpl FromWorld for ShadowShaders {\n fn from_world(world: &mut World) -> Self {\n let render_resources = world.get_resource::<RenderResources>().unwrap();\n let vertex_shader = Shader::from_glsl(ShaderStage::Vertex, include_str!(\"pbr.vert\"))\n .get_spirv_shader(None)\n .unwrap();\n let vertex_layout = vertex_shader.reflect_layout(&Default::default()).unwrap();\n\n let mut pipeline_layout = PipelineLayout::from_shader_layouts(&mut [vertex_layout]);\n\n let vertex = render_resources.create_shader_module(&vertex_shader);\n\n pipeline_layout.vertex_buffer_descriptors = vec![VertexBufferLayout {\n stride: 32,\n name: \"Vertex\".into(),\n step_mode: InputStepMode::Vertex,\n attributes: vec![\n \n VertexAttribute {\n name: \"Vertex_Position\".into(),\n format: VertexFormat::Float32x3,\n offset: 12,\n shader_location: 0,\n },\n VertexAttribute {\n name: \"Vertex_Normals\".into(),\n format: VertexFormat::Float32x3,\n offset: 0,\n shader_location: 1,\n },\n VertexAttribute {\n name: \"Vertex_Uv\".into(),\n format: VertexFormat::Float32x2,\n offset: 24,\n shader_location: 2,\n },\n ],\n }];\n\n pipeline_layout.bind_group_mut(0).bindings[0].set_dynamic(true);\n pipeline_layout.bind_group_mut(1).bindings[0].set_dynamic(true);\n pipeline_layout.update_bind_group_ids();\n\n let pipeline_descriptor = RenderPipelineDescriptor {\n depth_stencil: Some(DepthStencilState {\n format: SHADOW_FORMAT,\n depth_write_enabled: true,\n depth_compare: CompareFunction::LessEqual,\n stencil: StencilState {\n front: StencilFaceState::IGNORE,\n back: StencilFaceState::IGNORE,\n read_mask: 0,\n write_mask: 0,\n },\n bias: DepthBiasState {\n constant: 2,\n slope_scale: 2.0,\n clamp: 0.0,\n },\n }),\n primitive: PrimitiveState {\n topology: PrimitiveTopology::TriangleList,\n cull_mode: Some(Face::Back),\n \n clamp_depth: false,\n ..Default::default()\n },\n color_target_states: vec![],\n ..RenderPipelineDescriptor::new(\n ShaderStages {\n vertex,\n fragment: None,\n },\n pipeline_layout,\n )\n };\n\n let pipeline = render_resources.create_render_pipeline(&pipeline_descriptor);\n\n ShadowShaders {\n pipeline,\n pipeline_descriptor,\n light_sampler: render_resources.create_sampler(&SamplerDescriptor {\n address_mode_u: AddressMode::ClampToEdge,\n address_mode_v: AddressMode::ClampToEdge,\n address_mode_w: AddressMode::ClampToEdge,\n mag_filter: FilterMode::Linear,\n min_filter: FilterMode::Linear,\n mipmap_filter: FilterMode::Nearest,\n compare_function: Some(CompareFunction::LessEqual),\n ..Default::default()\n }),\n }\n }\n}\n\npub fn extract_lights(\n mut commands: Commands,\n lights: Query<(Entity, &PointLight, &GlobalTransform)>,\n) {\n for (entity, light, transform) in lights.iter() {\n commands.get_or_spawn(entity).insert(ExtractedPointLight {\n color: light.color,\n intensity: light.intensity,\n range: light.range,\n radius: light.radius,\n transform: transform.clone(),\n });\n }\n}\n\npub struct ViewLight {\n pub depth_texture: TextureViewId,\n}\n\npub struct ViewLights {\n pub light_depth_texture: TextureId,\n pub light_depth_texture_view: TextureViewId,\n pub lights: Vec<Entity>,\n pub gpu_light_binding_index: u32,\n}\n\n#[derive(Default)]\npub struct LightMeta {\n pub view_gpu_lights: DynamicUniformVec<GpuLights>,\n}\n\npub fn prepare_lights(\n mut commands: Commands,\n mut texture_cache: ResMut<TextureCache>,\n render_resources: Res<RenderResources>,\n mut light_meta: ResMut<LightMeta>,\n views: Query<Entity, With<RenderPhase<Transparent3dPhase>>>,\n lights: Query<&ExtractedPointLight>,\n) {\n \n light_meta\n .view_gpu_lights\n .reserve_and_clear(views.iter().count(), &render_resources);\n\n \n for entity in views.iter() {\n let light_depth_texture = texture_cache.get(\n &render_resources,\n TextureDescriptor {\n size: SHADOW_SIZE,\n mip_level_count: 1,\n sample_count: 1,\n dimension: TextureDimension::D2,\n format: SHADOW_FORMAT,\n usage: TextureUsage::RENDER_ATTACHMENT | TextureUsage::SAMPLED,\n ..Default::default()\n },\n );\n let mut view_lights = Vec::new();\n\n let mut gpu_lights = GpuLights {\n len: lights.iter().len() as u32,\n lights: [GpuLight::default(); MAX_POINT_LIGHTS],\n };\n\n \n for (i, light) in lights.iter().enumerate().take(MAX_POINT_LIGHTS) {\n let depth_texture_view = render_resources.create_texture_view(\n light_depth_texture.texture,\n TextureViewDescriptor {\n format: None,\n dimension: Some(TextureViewDimension::D2),\n aspect: TextureAspect::All,\n base_mip_level: 0,\n level_count: None,\n base_array_layer: i as u32,\n array_layer_count: NonZeroU32::new(1),\n },\n );\n\n let view_transform = GlobalTransform::from_translation(light.transform.translation)\n .looking_at(Vec3::default(), Vec3::Y);\n \n let projection = Mat4::perspective_rh(1.0472, 1.0, 1.0, 20.0);\n\n gpu_lights.lights[i] = GpuLight {\n \n \n color: (light.color * light.intensity).into(),\n radius: light.radius.into(),\n position: light.transform.translation.into(),\n range: 1.0 / (light.range * light.range),\n \n view_proj: projection * view_transform.compute_matrix().inverse(),\n };\n\n let view_light_entity = commands\n .spawn()\n .insert_bundle((\n ViewLight {\n depth_texture: depth_texture_view,\n },\n ExtractedView {\n width: SHADOW_SIZE.width,\n height: SHADOW_SIZE.height,\n transform: view_transform.clone(),\n projection,\n },\n RenderPhase::<ShadowPhase>::default(),\n ))\n .id();\n view_lights.push(view_light_entity);\n }\n\n commands.entity(entity).insert(ViewLights {\n light_depth_texture: light_depth_texture.texture,\n light_depth_texture_view: light_depth_texture.default_view,\n lights: view_lights,\n gpu_light_binding_index: light_meta.view_gpu_lights.push(gpu_lights),\n });\n }\n\n light_meta\n .view_gpu_lights\n .write_to_staging_buffer(&render_resources);\n}\n\npub fn cleanup_view_lights(render_resources: Res<RenderResources>, query: Query<&ViewLight>) {\n for view_light in query.iter() {\n render_resources.remove_texture_view(view_light.depth_texture);\n }\n}\n\npub struct ShadowPhase;\n\npub struct ShadowPassNode {\n main_view_query: QueryState<&'static ViewLights>,\n view_light_query: QueryState<(&'static ViewLight, &'static RenderPhase<ShadowPhase>)>,\n}\n\nimpl ShadowPassNode {\n pub const IN_VIEW: &'static str = \"view\";\n\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl Node for ShadowPassNode {\n fn input(&self) -> Vec<SlotInfo> {\n vec![SlotInfo::new(ShadowPassNode::IN_VIEW, SlotType::Entity)]\n }\n\n fn update(&mut self, world: &mut World) {\n self.main_view_query.update_archetypes(world);\n self.view_light_query.update_archetypes(world);\n }\n\n fn run(\n &self,\n graph: &mut RenderGraphContext,\n render_context: &mut dyn RenderContext,\n world: &World,\n ) -> Result<(), NodeRunError> {\n let view_entity = graph.get_input_entity(Self::IN_VIEW)?;\n let view_lights = self.main_view_query.get_manual(world, view_entity).unwrap();\n for view_light_entity in view_lights.lights.iter().copied() {\n let (view_light, shadow_phase) = self\n .view_light_query\n .get_manual(world, view_light_entity)\n .unwrap();\n let pass_descriptor = PassDescriptor {\n color_attachments: Vec::new(),\n depth_stencil_attachment: Some(RenderPassDepthStencilAttachment {\n attachment: TextureAttachment::Id(view_light.depth_texture),\n depth_ops: Some(Operations {\n load: LoadOp::Clear(1.0),\n store: true,\n }),\n stencil_ops: None,\n }),\n sample_count: 1,\n };\n\n let draw_functions = world.get_resource::<DrawFunctions>().unwrap();\n\n render_context.begin_render_pass(\n &pass_descriptor,\n &mut |render_pass: &mut dyn RenderPass| {\n let mut draw_functions = draw_functions.write();\n let mut tracked_pass = TrackedRenderPass::new(render_pass);\n for drawable in shadow_phase.drawn_things.iter() {\n let draw_function = draw_functions.get_mut(drawable.draw_function).unwrap();\n draw_function.draw(\n world,\n &mut tracked_pass,\n view_light_entity,\n drawable.draw_key,\n drawable.sort_key,\n );\n }\n },\n );\n }\n\n Ok(())\n }\n}\n\ntype DrawShadowMeshParams<'a> = (\n Res<'a, ShadowShaders>,\n Res<'a, ExtractedMeshes>,\n Query<'a, (&'a ViewUniform, &'a MeshViewBindGroups)>,\n);\npub struct DrawShadowMesh {\n params: SystemState<DrawShadowMeshParams<'static>>,\n}\n\nimpl DrawShadowMesh {\n pub fn new(world: &mut World) -> Self {\n Self {\n params: SystemState::new(world),\n }\n }\n}\n\nimpl Draw for DrawShadowMesh {\n fn draw(\n &mut self,\n world: &World,\n pass: &mut TrackedRenderPass,\n view: Entity,\n draw_key: usize,\n _sort_key: usize,\n ) {\n let (shadow_shaders, extracted_meshes, views) = self.params.get(world);\n let (view_uniforms, mesh_view_bind_groups) = views.get(view).unwrap();\n let layout = &shadow_shaders.pipeline_descriptor.layout;\n let extracted_mesh = &extracted_meshes.meshes[draw_key];\n pass.set_pipeline(shadow_shaders.pipeline);\n pass.set_bind_group(\n 0,\n layout.bind_group(0).id,\n mesh_view_bind_groups.view_bind_group,\n Some(&[view_uniforms.view_uniform_offset]),\n );\n\n pass.set_bind_group(\n 1,\n layout.bind_group(1).id,\n mesh_view_bind_groups.mesh_transform_bind_group,\n Some(&[extracted_mesh.transform_binding_offset]),\n );\n pass.set_vertex_buffer(0, extracted_mesh.vertex_buffer, 0);\n if let Some(index_info) = &extracted_mesh.index_info {\n pass.set_index_buffer(index_info.buffer, 0, IndexFormat::Uint32);\n pass.draw_indexed(0..index_info.count, 0, 0..1);\n } else {\n panic!(\"non-indexed drawing not supported yet\")\n }\n }\n}\n"},"middle":{"kind":"string","value":"pub fn new(world: &mut World) -> Self {\n Self {\n main_view_query: QueryState::new(world),\n view_light_query: QueryState::new(world),\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Internally, `bevy_render` uses hashes to identify vertex attribute names.\n\npub fn get_vertex_attribute_name_id(name: &str) -> u64 {\n\n let mut hasher = bevy_utils::AHasher::default();\n\n hasher.write(&name.as_bytes());\n\n hasher.finish()\n\n}\n","file_path":"pipelined/bevy_render2/src/pipeline/vertex_buffer_descriptor.rs","rank":0,"score":466873.61920144095},{"content":"/// Internally, `bevy_render` uses hashes to identify vertex attribute names.\n\npub fn get_vertex_attribute_name_id(name: &str) -> u64 {\n\n let mut hasher = bevy_utils::AHasher::default();\n\n hasher.write(&name.as_bytes());\n\n hasher.finish()\n\n}\n","file_path":"crates/bevy_render/src/pipeline/vertex_buffer_descriptor.rs","rank":1,"score":452709.33903283736},{"content":"pub fn get_wgpu_render_system(world: &mut World) -> impl FnMut(&mut World) {\n\n let options = world\n\n .get_resource::<WgpuOptions>()\n\n .cloned()\n\n .unwrap_or_else(WgpuOptions::default);\n\n let mut wgpu_renderer = future::block_on(WgpuRenderer::new(options));\n\n\n\n let resource_context = WgpuRenderResourceContext::new(wgpu_renderer.device.clone());\n\n world.insert_resource::<Box<dyn RenderResourceContext>>(Box::new(resource_context));\n\n world.insert_resource(SharedBuffers::new(4096));\n\n move |world| {\n\n wgpu_renderer.update(world);\n\n }\n\n}\n\n\n\n#[derive(Default, Clone)]\n\npub struct WgpuOptions {\n\n pub device_label: Option<Cow<'static, str>>,\n\n pub backend: WgpuBackend,\n\n pub power_pref: WgpuPowerOptions,\n","file_path":"crates/bevy_wgpu/src/lib.rs","rank":2,"score":396667.3077346629},{"content":"pub fn despawn_with_children_recursive(world: &mut World, entity: Entity) {\n\n // first, make the entity's own parent forget about it\n\n if let Some(parent) = world.get::<Parent>(entity).map(|parent| parent.0) {\n\n if let Some(mut children) = world.get_mut::<Children>(parent) {\n\n children.0.retain(|c| *c != entity);\n\n }\n\n }\n\n\n\n // then despawn the entity and all of its children\n\n despawn_with_children_recursive_inner(world, entity);\n\n}\n\n\n","file_path":"crates/bevy_transform/src/hierarchy/hierarchy.rs","rank":3,"score":385361.1296731719},{"content":"/// Generate a color modulation\n\n///\n\n/// Because there is no `Mul<Color> for Color` instead `[f32; 3]` is\n\n/// used.\n\nfn gen_color(rng: &mut impl Rng) -> [f32; 3] {\n\n let r = rng.gen_range(0.2..1.0);\n\n let g = rng.gen_range(0.2..1.0);\n\n let b = rng.gen_range(0.2..1.0);\n\n let v = Vec3::new(r, g, b);\n\n v.normalize().into()\n\n}\n","file_path":"examples/tools/bevymark_pipelined.rs","rank":4,"score":370071.6342194791},{"content":"pub fn wgpu_window_system(world: &mut World) {\n\n world.resource_scope(|world, mut renderer: Mut<WgpuRenderer>| {\n\n renderer.handle_new_windows(world);\n\n })\n\n}\n\n\n\n#[derive(Default, Clone)]\n\npub struct WgpuOptions {\n\n pub device_label: Option<Cow<'static, str>>,\n\n pub backend: WgpuBackend,\n\n pub power_pref: WgpuPowerOptions,\n\n pub features: WgpuFeatures,\n\n pub limits: WgpuLimits,\n\n}\n\n\n\n#[derive(Clone)]\n\npub enum WgpuBackend {\n\n Auto,\n\n Vulkan,\n\n Metal,\n","file_path":"pipelined/bevy_wgpu2/src/lib.rs","rank":5,"score":358751.30029687705},{"content":"pub fn wgpu_render_system(world: &mut World) {\n\n world.resource_scope(|world, mut renderer: Mut<WgpuRenderer>| {\n\n renderer.update(world);\n\n })\n\n}\n\n\n","file_path":"pipelined/bevy_wgpu2/src/lib.rs","rank":6,"score":358751.30029687705},{"content":"fn add_render_to_texture_graph(graph: &mut RenderGraph, size: Extent3d) {\n\n let mut pass_node = PassNode::<&FirstPass>::new(PassDescriptor {\n\n color_attachments: vec![RenderPassColorAttachment {\n\n attachment: TextureAttachment::Input(\"color_attachment\".to_string()),\n\n resolve_target: None,\n\n ops: Operations {\n\n load: LoadOp::Clear(Color::rgb(0.1, 0.2, 0.3)),\n\n store: true,\n\n },\n\n }],\n\n depth_stencil_attachment: Some(RenderPassDepthStencilAttachment {\n\n attachment: TextureAttachment::Input(\"depth\".to_string()),\n\n depth_ops: Some(Operations {\n\n load: LoadOp::Clear(1.0),\n\n store: true,\n\n }),\n\n stencil_ops: None,\n\n }),\n\n sample_count: 1,\n\n });\n","file_path":"examples/3d/render_to_texture.rs","rank":8,"score":337823.06638159754},{"content":"/// rotates the inner cube (first pass)\n\nfn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<FirstPassCube>>) {\n\n for mut transform in query.iter_mut() {\n\n transform.rotation *= Quat::from_rotation_x(1.5 * time.delta_seconds());\n\n transform.rotation *= Quat::from_rotation_z(1.3 * time.delta_seconds());\n\n }\n\n}\n\n\n","file_path":"examples/3d/render_to_texture.rs","rank":9,"score":337009.5750497079},{"content":"/// Generate a color modulation\n\n///\n\n/// Because there is no `Mul<Color> for Color` instead `[f32; 3]` is\n\n/// used.\n\nfn gen_color(rng: &mut impl Rng) -> [f32; 3] {\n\n let r = rng.gen_range(0.2..1.0);\n\n let g = rng.gen_range(0.2..1.0);\n\n let b = rng.gen_range(0.2..1.0);\n\n let v = Vec3::new(r, g, b);\n\n v.normalize().into()\n\n}\n","file_path":"examples/tools/bevymark.rs","rank":10,"score":333406.55389189615},{"content":"/// rotates the outer cube (main pass)\n\nfn cube_rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<MainPassCube>>) {\n\n for mut transform in query.iter_mut() {\n\n transform.rotation *= Quat::from_rotation_x(1.0 * time.delta_seconds());\n\n transform.rotation *= Quat::from_rotation_y(0.7 * time.delta_seconds());\n\n }\n\n}\n\n\n","file_path":"examples/3d/render_to_texture.rs","rank":11,"score":331968.4707518142},{"content":"pub fn sort_phase_system<T: 'static>(mut render_phases: Query<&mut RenderPhase<T>>) {\n\n for mut phase in render_phases.iter_mut() {\n\n phase.sort();\n\n } \n\n}","file_path":"pipelined/bevy_render2/src/render_phase/mod.rs","rank":12,"score":325584.9911663728},{"content":"// Should only be called by `despawn_with_children_recursive`!\n\nfn despawn_with_children_recursive_inner(world: &mut World, entity: Entity) {\n\n if let Some(mut children) = world.get_mut::<Children>(entity) {\n\n for e in std::mem::take(&mut children.0) {\n\n despawn_with_children_recursive_inner(world, e);\n\n }\n\n }\n\n\n\n if !world.despawn(entity) {\n\n debug!(\"Failed to despawn entity {:?}\", entity);\n\n }\n\n}\n\n\n\nimpl Command for DespawnRecursive {\n\n fn write(self: Box<Self>, world: &mut World) {\n\n despawn_with_children_recursive(world, self.entity);\n\n }\n\n}\n\n\n","file_path":"crates/bevy_transform/src/hierarchy/hierarchy.rs","rank":13,"score":323183.62195770716},{"content":"fn move_camera(time: Res<Time>, mut query: Query<(&mut Transform, &mut Position)>) {\n\n for (mut transform, mut position) in query.iter_mut() {\n\n position\n\n .0\n\n .rotate(Quat::from_rotation_z(time.delta_seconds() * 0.5));\n\n position.0 =\n\n position.0 * Transform::from_translation(Vec3::X * CAMERA_SPEED * time.delta_seconds());\n\n transform.translation = position.0.translation;\n\n transform.rotation *= Quat::from_rotation_z(time.delta_seconds() / 2.0);\n\n }\n\n}\n\n\n","file_path":"examples/2d/many_sprites.rs","rank":14,"score":317181.3002020847},{"content":"pub fn gilrs_event_system(world: &mut World) {\n\n let world = world.cell();\n\n let mut gilrs = world.get_non_send_mut::<Gilrs>().unwrap();\n\n let mut event = world.get_resource_mut::<Events<GamepadEventRaw>>().unwrap();\n\n event.update();\n\n while let Some(gilrs_event) = gilrs.next_event() {\n\n match gilrs_event.event {\n\n EventType::Connected => {\n\n event.send(GamepadEventRaw(\n\n convert_gamepad_id(gilrs_event.id),\n\n GamepadEventType::Connected,\n\n ));\n\n }\n\n EventType::Disconnected => {\n\n event.send(GamepadEventRaw(\n\n convert_gamepad_id(gilrs_event.id),\n\n GamepadEventType::Disconnected,\n\n ));\n\n }\n\n EventType::ButtonChanged(gilrs_button, value, _) => {\n","file_path":"crates/bevy_gilrs/src/gilrs_system.rs","rank":15,"score":313423.0022000539},{"content":"pub fn scene_spawner_system(world: &mut World) {\n\n world.resource_scope(|world, mut scene_spawner: Mut<SceneSpawner>| {\n\n let scene_asset_events = world\n\n .get_resource::<Events<AssetEvent<DynamicScene>>>()\n\n .unwrap();\n\n\n\n let mut updated_spawned_scenes = Vec::new();\n\n for event in scene_spawner\n\n .scene_asset_event_reader\n\n .iter(&scene_asset_events)\n\n {\n\n if let AssetEvent::Modified { handle } = event {\n\n if scene_spawner.spawned_dynamic_scenes.contains_key(handle) {\n\n updated_spawned_scenes.push(handle.clone_weak());\n\n }\n\n }\n\n }\n\n\n\n scene_spawner.despawn_queued_scenes(world).unwrap();\n\n scene_spawner\n\n .spawn_queued_scenes(world)\n\n .unwrap_or_else(|err| panic!(\"{}\", err));\n\n scene_spawner\n\n .update_spawned_scenes(world, &updated_spawned_scenes)\n\n .unwrap();\n\n scene_spawner.set_scene_instance_parent_sync(world);\n\n });\n\n}\n","file_path":"crates/bevy_scene/src/scene_spawner.rs","rank":16,"score":313423.0022000539},{"content":"pub fn from_f32_size(scale_factor: f64, size: Size<f32>) -> stretch::geometry::Size<f32> {\n\n stretch::geometry::Size {\n\n width: (scale_factor * size.width as f64) as f32,\n\n height: (scale_factor * size.height as f64) as f32,\n\n }\n\n}\n\n\n","file_path":"crates/bevy_ui/src/flex/convert.rs","rank":17,"score":313399.64953757846},{"content":"pub fn gilrs_event_startup_system(world: &mut World) {\n\n let world = world.cell();\n\n let gilrs = world.get_non_send::<Gilrs>().unwrap();\n\n let mut event = world.get_resource_mut::<Events<GamepadEventRaw>>().unwrap();\n\n for (id, _) in gilrs.gamepads() {\n\n event.send(GamepadEventRaw(\n\n convert_gamepad_id(id),\n\n GamepadEventType::Connected,\n\n ));\n\n }\n\n}\n\n\n","file_path":"crates/bevy_gilrs/src/gilrs_system.rs","rank":18,"score":309587.1735021465},{"content":"fn movement_system(time: Res<Time>, mut bird_query: Query<(&mut Bird, &mut Transform)>) {\n\n for (mut bird, mut transform) in bird_query.iter_mut() {\n\n transform.translation.x += bird.velocity.x * time.delta_seconds();\n\n transform.translation.y += bird.velocity.y * time.delta_seconds();\n\n bird.velocity.y += GRAVITY * time.delta_seconds();\n\n }\n\n}\n\n\n","file_path":"examples/tools/bevymark_pipelined.rs","rank":19,"score":307947.8594017602},{"content":"/// rotates the parent, which will result in the child also rotating\n\nfn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<Rotator>>) {\n\n for mut transform in query.iter_mut() {\n\n transform.rotation *= Quat::from_rotation_x(3.0 * time.delta_seconds());\n\n }\n\n}\n\n\n","file_path":"examples/3d/z_sort_debug.rs","rank":20,"score":307680.8662791414},{"content":"/// Clears each [RenderPipelines]' shader defs collection\n\npub fn clear_shader_defs_system(mut query: Query<&mut RenderPipelines>) {\n\n for mut render_pipelines in query.iter_mut() {\n\n for render_pipeline in render_pipelines.pipelines.iter_mut() {\n\n render_pipeline\n\n .specialization\n\n .shader_specialization\n\n .shader_defs\n\n .clear();\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/bevy_render/src/shader/shader_defs.rs","rank":21,"score":303290.1629673484},{"content":"pub fn render_graph_schedule_executor_system(world: &mut World) {\n\n // run render graph systems\n\n let mut system_schedule = {\n\n let mut render_graph = world.get_resource_mut::<RenderGraph>().unwrap();\n\n render_graph.take_schedule()\n\n };\n\n\n\n if let Some(schedule) = system_schedule.as_mut() {\n\n schedule.run(world);\n\n }\n\n let mut render_graph = world.get_resource_mut::<RenderGraph>().unwrap();\n\n if let Some(schedule) = system_schedule.take() {\n\n render_graph.set_schedule(schedule);\n\n }\n\n}\n","file_path":"crates/bevy_render/src/render_graph/system.rs","rank":22,"score":302402.445861473},{"content":"/// Spawn some players to count\n\nfn spawn(mut commands: Commands) {\n\n commands.spawn().insert(Player);\n\n commands.spawn().insert(Player);\n\n commands.spawn().insert(Player);\n\n}\n\n\n","file_path":"examples/ecs/system_param.rs","rank":23,"score":299509.45360311115},{"content":"/// Returns vector containing all pairs of indices of systems with ambiguous execution order,\n\n/// along with specific components that have triggered the warning.\n\n/// Systems must be topologically sorted beforehand.\n\nfn find_ambiguities(systems: &[impl SystemContainer]) -> Vec<(usize, usize, Vec<ComponentId>)> {\n\n let mut ambiguity_set_labels = HashMap::default();\n\n for set in systems.iter().flat_map(|c| c.ambiguity_sets()) {\n\n let len = ambiguity_set_labels.len();\n\n ambiguity_set_labels.entry(set).or_insert(len);\n\n }\n\n let mut all_ambiguity_sets = Vec::<FixedBitSet>::with_capacity(systems.len());\n\n let mut all_dependencies = Vec::<FixedBitSet>::with_capacity(systems.len());\n\n let mut all_dependants = Vec::<FixedBitSet>::with_capacity(systems.len());\n\n for (index, container) in systems.iter().enumerate() {\n\n let mut ambiguity_sets = FixedBitSet::with_capacity(ambiguity_set_labels.len());\n\n for set in container.ambiguity_sets() {\n\n ambiguity_sets.insert(ambiguity_set_labels[set]);\n\n }\n\n all_ambiguity_sets.push(ambiguity_sets);\n\n let mut dependencies = FixedBitSet::with_capacity(systems.len());\n\n for &dependency in container.dependencies() {\n\n dependencies.union_with(&all_dependencies[dependency]);\n\n dependencies.insert(dependency);\n\n all_dependants[dependency].insert(index);\n","file_path":"crates/bevy_ecs/src/schedule/stage.rs","rank":24,"score":298793.8504407645},{"content":"fn collision_system(window: Res<WindowDescriptor>, mut bird_query: Query<(&mut Bird, &Transform)>) {\n\n let half_width = window.width as f32 * 0.5;\n\n let half_height = window.height as f32 * 0.5;\n\n\n\n for (mut bird, transform) in bird_query.iter_mut() {\n\n let x_vel = bird.velocity.x;\n\n let y_vel = bird.velocity.y;\n\n let x_pos = transform.translation.x;\n\n let y_pos = transform.translation.y;\n\n\n\n if (x_vel > 0. && x_pos + HALF_BIRD_SIZE > half_width)\n\n || (x_vel <= 0. && x_pos - HALF_BIRD_SIZE < -(half_width))\n\n {\n\n bird.velocity.x = -x_vel;\n\n }\n\n if y_vel < 0. && y_pos - HALF_BIRD_SIZE < -half_height {\n\n bird.velocity.y = -y_vel;\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/tools/bevymark_pipelined.rs","rank":25,"score":296999.61267544137},{"content":"fn integrate(mut query: Query<(&mut Acceleration, &mut Transform, &mut LastPos)>) {\n\n let dt_sq = (DELTA_TIME * DELTA_TIME) as f32;\n\n for (mut acceleration, mut transform, mut last_pos) in query.iter_mut() {\n\n // verlet integration\n\n // x(t+dt) = 2x(t) - x(t-dt) + a(t)dt^2 + O(dt^4)\n\n\n\n let new_pos =\n\n transform.translation + transform.translation - last_pos.0 + acceleration.0 * dt_sq;\n\n acceleration.0 = Vec3::ZERO;\n\n last_pos.0 = transform.translation;\n\n transform.translation = new_pos;\n\n }\n\n}\n","file_path":"examples/ecs/iter_combinations.rs","rank":26,"score":289797.6596487398},{"content":"/// Plays audio currently queued in the [Audio] resource through the [AudioOutput] resource\n\npub fn play_queued_audio_system<P: Asset>(world: &mut World)\n\nwhere\n\n P: Decodable,\n\n <P as Decodable>::Decoder: rodio::Source + Send + Sync,\n\n <<P as Decodable>::Decoder as Iterator>::Item: rodio::Sample + Send + Sync,\n\n{\n\n let world = world.cell();\n\n let audio_output = world.get_non_send::<AudioOutput<P>>().unwrap();\n\n let mut audio = world.get_resource_mut::<Audio<P>>().unwrap();\n\n\n\n if let Some(audio_sources) = world.get_resource::<Assets<P>>() {\n\n audio_output.try_play_queued(&*audio_sources, &mut *audio);\n\n };\n\n}\n","file_path":"crates/bevy_audio/src/audio_output.rs","rank":27,"score":288984.66623188695},{"content":"fn ball_movement_system(mut ball_query: Query<(&Ball, &mut Transform)>) {\n\n if let Ok((ball, mut transform)) = ball_query.single_mut() {\n\n transform.translation += ball.velocity * TIME_STEP;\n\n }\n\n}\n\n\n","file_path":"examples/game/breakout.rs","rank":28,"score":286198.88197355164},{"content":"fn extract(app_world: &mut World, render_app: &mut App) {\n\n let extract = render_app\n\n .schedule\n\n .get_stage_mut::<SystemStage>(&RenderStage::Extract)\n\n .unwrap();\n\n extract.run(app_world);\n\n extract.apply_buffers(&mut render_app.world);\n\n}\n\n\n","file_path":"pipelined/bevy_render2/src/lib.rs","rank":29,"score":281733.43631613784},{"content":"pub fn clear_draw_system(mut query: Query<&mut Draw>) {\n\n for mut draw in query.iter_mut() {\n\n draw.clear_render_commands();\n\n }\n\n}\n","file_path":"crates/bevy_render/src/draw.rs","rank":30,"score":280968.8788625471},{"content":"fn interact_bodies(mut query: Query<(&Mass, &GlobalTransform, &mut Acceleration)>) {\n\n let mut iter = query.iter_combinations_mut();\n\n while let Some([(Mass(m1), transform1, mut acc1), (Mass(m2), transform2, mut acc2)]) =\n\n iter.fetch_next()\n\n {\n\n let delta = transform2.translation - transform1.translation;\n\n let distance_sq: f32 = delta.length_squared();\n\n\n\n let f = GRAVITY_CONSTANT / (distance_sq * (distance_sq + SOFTENING).sqrt());\n\n let force_unit_mass = delta * f;\n\n acc1.0 += force_unit_mass * *m2;\n\n acc2.0 -= force_unit_mass * *m1;\n\n }\n\n}\n\n\n","file_path":"examples/ecs/iter_combinations.rs","rank":31,"score":278228.07135246857},{"content":"// remove all entities that are not a camera\n\nfn teardown(mut commands: Commands, entities: Query<Entity, Without<Camera>>) {\n\n for entity in entities.iter() {\n\n commands.entity(entity).despawn_recursive();\n\n }\n\n}\n\n\n","file_path":"examples/game/alien_cake_addict.rs","rank":32,"score":276947.750488578},{"content":"fn movement_system(time: Res<Time>, mut bird_query: Query<(&mut Bird, &mut Transform)>) {\n\n for (mut bird, mut transform) in bird_query.iter_mut() {\n\n transform.translation.x += bird.velocity.x * time.delta_seconds();\n\n transform.translation.y += bird.velocity.y * time.delta_seconds();\n\n bird.velocity.y += GRAVITY * time.delta_seconds();\n\n }\n\n}\n\n\n","file_path":"examples/tools/bevymark.rs","rank":33,"score":274470.88547256467},{"content":"/// Updates [RenderPipelines] with the latest [ShaderDefs]\n\npub fn shader_defs_system<T>(mut query: Query<(&T, &mut RenderPipelines), Without<OutsideFrustum>>)\n\nwhere\n\n T: ShaderDefs + Send + Sync + 'static,\n\n{\n\n for (shader_defs, mut render_pipelines) in query.iter_mut() {\n\n for shader_def in shader_defs.iter_shader_defs() {\n\n for render_pipeline in render_pipelines.pipelines.iter_mut() {\n\n render_pipeline\n\n .specialization\n\n .shader_specialization\n\n .shader_defs\n\n .insert(shader_def.to_string());\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/bevy_render/src/shader/shader_defs.rs","rank":34,"score":273901.2330080727},{"content":"/// rotates the parent, which will result in the child also rotating\n\nfn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<Rotator>>) {\n\n for mut transform in query.iter_mut() {\n\n transform.rotation *= Quat::from_rotation_x(3.0 * time.delta_seconds());\n\n }\n\n}\n\n\n","file_path":"examples/3d/parenting.rs","rank":35,"score":271161.72839418123},{"content":"fn despawn_dead_enemies(mut commands: Commands, enemies: Query<(Entity, &Enemy)>) {\n\n for (entity, enemy) in enemies.iter() {\n\n if enemy.hit_points == 0 {\n\n commands.entity(entity).despawn_recursive();\n\n }\n\n }\n\n}\n\n\n","file_path":"tests/how_to_test_systems.rs","rank":36,"score":269964.766638006},{"content":"fn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<Rotates>>) {\n\n for mut transform in query.iter_mut() {\n\n *transform = Transform::from_rotation(Quat::from_rotation_y(\n\n (4.0 * std::f32::consts::PI / 20.0) * time.delta_seconds(),\n\n )) * *transform;\n\n }\n\n}\n","file_path":"examples/3d/load_gltf.rs","rank":37,"score":267411.2491237824},{"content":"fn extract_windows(mut commands: Commands, windows: Res<Windows>) {\n\n let mut extracted_windows = ExtractedWindows::default();\n\n for window in windows.iter() {\n\n extracted_windows.insert(\n\n window.id(),\n\n ExtractedWindow {\n\n id: window.id(),\n\n handle: window.raw_window_handle(),\n\n physical_width: window.physical_width(),\n\n physical_height: window.physical_height(),\n\n vsync: window.vsync(),\n\n swap_chain_texture: None,\n\n },\n\n );\n\n }\n\n\n\n commands.insert_resource(extracted_windows);\n\n}\n\n\n","file_path":"pipelined/bevy_render2/src/view/window.rs","rank":38,"score":267328.03718485986},{"content":"/// Generates a topological order for the given graph.\n\npub fn topological_order<Labels: Clone>(\n\n graph: &HashMap<usize, HashMap<usize, Labels>>,\n\n) -> Result<Vec<usize>, DependencyGraphError<Labels>> {\n\n fn check_if_cycles_and_visit<L>(\n\n node: &usize,\n\n graph: &HashMap<usize, HashMap<usize, L>>,\n\n sorted: &mut Vec<usize>,\n\n unvisited: &mut HashSet<usize>,\n\n current: &mut Vec<usize>,\n\n ) -> bool {\n\n if current.contains(node) {\n\n return true;\n\n } else if !unvisited.remove(node) {\n\n return false;\n\n }\n\n current.push(*node);\n\n for dependency in graph.get(node).unwrap().keys() {\n\n if check_if_cycles_and_visit(dependency, &graph, sorted, unvisited, current) {\n\n return true;\n\n }\n","file_path":"crates/bevy_ecs/src/schedule/graph_utils.rs","rank":41,"score":266277.6687528235},{"content":"/// Apply velocity to positions and rotations.\n\nfn move_system(time: Res<Time>, mut q: Query<(&Velocity, &mut Transform)>) {\n\n let delta = time.delta_seconds();\n\n\n\n for (v, mut t) in q.iter_mut() {\n\n t.translation += delta * v.translation;\n\n t.rotate(Quat::from_rotation_z(v.rotation * delta));\n\n }\n\n}\n\n\n","file_path":"examples/2d/contributors.rs","rank":42,"score":264288.4136855035},{"content":"/// Sets up two entities, one with a [Name] component as part of a bundle,\n\n/// and one entity with [Name] only.\n\nfn setup(mut commands: Commands) {\n\n commands.spawn().insert(Name(\"Steve\".to_string()));\n\n commands.spawn().insert_bundle(PersonBundle {\n\n name: Name(\"Bob\".to_string()),\n\n age: Age(40),\n\n });\n\n}\n\n\n","file_path":"examples/ecs/query_bundle.rs","rank":43,"score":264266.73638726625},{"content":"fn collision_system(window: Res<WindowDescriptor>, mut bird_query: Query<(&mut Bird, &Transform)>) {\n\n let half_width = window.width as f32 * 0.5;\n\n let half_height = window.height as f32 * 0.5;\n\n\n\n for (mut bird, transform) in bird_query.iter_mut() {\n\n let x_vel = bird.velocity.x;\n\n let y_vel = bird.velocity.y;\n\n let x_pos = transform.translation.x;\n\n let y_pos = transform.translation.y;\n\n\n\n if (x_vel > 0. && x_pos + HALF_BIRD_SIZE > half_width)\n\n || (x_vel <= 0. && x_pos - HALF_BIRD_SIZE < -(half_width))\n\n {\n\n bird.velocity.x = -x_vel;\n\n }\n\n if y_vel < 0. && y_pos - HALF_BIRD_SIZE < -half_height {\n\n bird.velocity.y = -y_vel;\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/tools/bevymark.rs","rank":44,"score":263624.78795506735},{"content":"pub fn texture_resource_system(\n\n render_resource_context: Res<RenderResources>,\n\n mut render_command_queue: ResMut<RenderCommandQueue>,\n\n mut textures: ResMut<Assets<Texture>>,\n\n mut texture_events: EventReader<AssetEvent<Texture>>,\n\n) {\n\n let render_resource_context = &**render_resource_context;\n\n let mut changed_textures = HashSet::default();\n\n for event in texture_events.iter() {\n\n match event {\n\n AssetEvent::Created { handle } => {\n\n changed_textures.insert(handle);\n\n }\n\n AssetEvent::Modified { handle } => {\n\n changed_textures.insert(handle);\n\n // TODO: uncomment this to support mutated textures\n\n // remove_current_texture_resources(render_resource_context, handle, &mut textures);\n\n }\n\n AssetEvent::Removed { handle } => {\n\n remove_current_texture_resources(render_resource_context, handle, &mut textures);\n","file_path":"pipelined/bevy_render2/src/texture/mod.rs","rank":45,"score":262305.57273013506},{"content":"fn bytes_to_words(bytes: &[u8]) -> Vec<u32> {\n\n let mut words = Vec::new();\n\n for bytes4 in bytes.chunks(4) {\n\n words.push(u32::from_le_bytes([\n\n bytes4[0], bytes4[1], bytes4[2], bytes4[3],\n\n ]));\n\n }\n\n\n\n words\n\n}\n\n\n\n/// The full \"source\" of a shader\n\n#[derive(Clone, Debug, Hash, Eq, PartialEq)]\n\npub enum ShaderSource {\n\n Spirv(Vec<u32>),\n\n Glsl(String),\n\n}\n\n\n\nimpl ShaderSource {\n\n pub fn spirv_from_bytes(bytes: &[u8]) -> ShaderSource {\n","file_path":"pipelined/bevy_render2/src/shader/shader.rs","rank":46,"score":260992.72677562825},{"content":"pub fn update_texture_cache_system(\n\n mut texture_cache: ResMut<TextureCache>,\n\n render_resources: Res<RenderResources>,\n\n) {\n\n texture_cache.update(&render_resources);\n\n}\n","file_path":"pipelined/bevy_render2/src/texture/texture_cache.rs","rank":47,"score":260791.18628106886},{"content":"// Move sprites according to their velocity\n\nfn move_system(pool: Res<ComputeTaskPool>, mut sprites: Query<(&mut Transform, &Velocity)>) {\n\n // Compute the new location of each sprite in parallel on the\n\n // ComputeTaskPool using batches of 32 sprites\n\n //\n\n // This example is only for demonstrative purposes. Using a\n\n // ParallelIterator for an inexpensive operation like addition on only 128\n\n // elements will not typically be faster than just using a normal Iterator.\n\n // See the ParallelIterator documentation for more information on when\n\n // to use or not use ParallelIterator over a normal Iterator.\n\n sprites.par_for_each_mut(&pool, 32, |(mut transform, velocity)| {\n\n transform.translation += velocity.0.extend(0.0);\n\n });\n\n}\n\n\n","file_path":"examples/ecs/parallel_query.rs","rank":48,"score":260294.12602192012},{"content":"fn save_scene_system(world: &mut World) {\n\n // Scenes can be created from any ECS World. You can either create a new one for the scene or\n\n // use the current World.\n\n let mut scene_world = World::new();\n\n let mut component_b = ComponentB::from_world(world);\n\n component_b.value = \"hello\".to_string();\n\n scene_world.spawn().insert_bundle((\n\n component_b,\n\n ComponentA { x: 1.0, y: 2.0 },\n\n Transform::identity(),\n\n ));\n\n scene_world\n\n .spawn()\n\n .insert_bundle((ComponentA { x: 3.0, y: 4.0 },));\n\n\n\n // The TypeRegistry resource contains information about all registered types (including\n\n // components). This is used to construct scenes.\n\n let type_registry = world.get_resource::<TypeRegistry>().unwrap();\n\n let scene = DynamicScene::from_world(&scene_world, &type_registry);\n\n\n\n // Scenes can be serialized like this:\n\n info!(\"{}\", scene.serialize_ron(&type_registry).unwrap());\n\n\n\n // TODO: save scene\n\n}\n\n\n","file_path":"examples/scene/scene.rs","rank":49,"score":259822.40363467723},{"content":"pub trait AsVertexFormats {\n\n fn as_vertex_formats() -> &'static [VertexFormat];\n\n}\n\n\n\nimpl AsVertexFormats for f32 {\n\n fn as_vertex_formats() -> &'static [VertexFormat] {\n\n &[VertexFormat::Float32]\n\n }\n\n}\n\n\n\nimpl AsVertexFormats for Vec2 {\n\n fn as_vertex_formats() -> &'static [VertexFormat] {\n\n &[VertexFormat::Float32x2]\n\n }\n\n}\n\n\n\nimpl AsVertexFormats for Vec3 {\n\n fn as_vertex_formats() -> &'static [VertexFormat] {\n\n &[VertexFormat::Float32x3]\n\n }\n","file_path":"pipelined/bevy_render2/src/pipeline/vertex_format.rs","rank":50,"score":256490.50421235076},{"content":"fn change_window(world: &mut World) {\n\n let world = world.cell();\n\n let winit_windows = world.get_resource::<WinitWindows>().unwrap();\n\n let mut windows = world.get_resource_mut::<Windows>().unwrap();\n\n\n\n for bevy_window in windows.iter_mut() {\n\n let id = bevy_window.id();\n\n for command in bevy_window.drain_commands() {\n\n match command {\n\n bevy_window::WindowCommand::SetWindowMode {\n\n mode,\n\n resolution: (width, height),\n\n } => {\n\n let window = winit_windows.get_window(id).unwrap();\n\n match mode {\n\n bevy_window::WindowMode::BorderlessFullscreen => {\n\n window.set_fullscreen(Some(winit::window::Fullscreen::Borderless(None)))\n\n }\n\n bevy_window::WindowMode::Fullscreen { use_size } => window.set_fullscreen(\n\n Some(winit::window::Fullscreen::Exclusive(match use_size {\n","file_path":"crates/bevy_winit/src/lib.rs","rank":51,"score":256395.78146165493},{"content":"#[allow(dead_code)]\n\nfn thread_local_system(world: &mut World) {\n\n // this does the same thing as \"new_player_system\"\n\n let total_players = world.get_resource_mut::<GameState>().unwrap().total_players;\n\n let should_add_player = {\n\n let game_rules = world.get_resource::<GameRules>().unwrap();\n\n let add_new_player = random::<bool>();\n\n add_new_player && total_players < game_rules.max_players\n\n };\n\n // Randomly add a new player\n\n if should_add_player {\n\n world.spawn().insert_bundle((\n\n Player {\n\n name: format!(\"Player {}\", total_players),\n\n },\n\n Score { value: 0 },\n\n ));\n\n\n\n let mut game_state = world.get_resource_mut::<GameState>().unwrap();\n\n game_state.total_players += 1;\n\n }\n","file_path":"examples/ecs/ecs_guide.rs","rank":52,"score":256395.78146165493},{"content":"fn contains_component_with_type(world: &World, type_id: TypeId, location: EntityLocation) -> bool {\n\n if let Some(component_id) = world.components.get_id(type_id) {\n\n contains_component_with_id(world, component_id, location)\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"crates/bevy_ecs/src/world/entity_ref.rs","rank":53,"score":254366.72576701472},{"content":"fn run_stage(stage: &mut SystemStage, world: &mut World) {\n\n stage.run(world);\n\n}\n\n\n","file_path":"benches/benches/bevy_ecs/stages.rs","rank":54,"score":253984.99048287084},{"content":"pub fn prepare_core_views_system(\n\n mut commands: Commands,\n\n mut texture_cache: ResMut<TextureCache>,\n\n render_resources: Res<RenderResources>,\n\n views: Query<(Entity, &ExtractedView), With<RenderPhase<Transparent3dPhase>>>,\n\n) {\n\n for (entity, view) in views.iter() {\n\n let cached_texture = texture_cache.get(\n\n &render_resources,\n\n TextureDescriptor {\n\n size: Extent3d {\n\n depth_or_array_layers: 1,\n\n width: view.width as u32,\n\n height: view.height as u32,\n\n },\n\n mip_level_count: 1,\n\n sample_count: 1,\n\n dimension: TextureDimension::D2,\n\n format: TextureFormat::Depth32Float, /* PERF: vulkan docs recommend using 24\n\n * bit depth for better performance */\n\n usage: TextureUsage::RENDER_ATTACHMENT,\n\n },\n\n );\n\n commands.entity(entity).insert(ViewDepthTexture {\n\n texture: cached_texture.texture,\n\n view: cached_texture.default_view,\n\n });\n\n }\n\n}\n","file_path":"pipelined/bevy_render2/src/core_pipeline/mod.rs","rank":55,"score":253682.75381663747},{"content":"pub fn prepare_windows(\n\n mut windows: ResMut<ExtractedWindows>,\n\n render_resources: Res<RenderResources>,\n\n) {\n\n for window in windows.windows.values_mut() {\n\n let swap_chain_descriptor = SwapChainDescriptor {\n\n window_id: window.id,\n\n format: crate::texture::TextureFormat::Bgra8UnormSrgb,\n\n width: window.physical_width,\n\n height: window.physical_height,\n\n vsync: window.vsync,\n\n };\n\n\n\n let swap_chain_texture = render_resources.next_swap_chain_texture(&swap_chain_descriptor);\n\n window.swap_chain_texture = Some(swap_chain_texture);\n\n }\n\n}\n","file_path":"pipelined/bevy_render2/src/view/window.rs","rank":56,"score":253505.5013576888},{"content":"// let the cake turn on itself\n\nfn rotate_bonus(game: Res<Game>, time: Res<Time>, mut transforms: Query<&mut Transform>) {\n\n if let Some(entity) = game.bonus.entity {\n\n if let Ok(mut cake_transform) = transforms.get_mut(entity) {\n\n cake_transform.rotate(Quat::from_rotation_y(time.delta_seconds()));\n\n cake_transform.scale = Vec3::splat(\n\n 1.0 + (game.score as f32 / 10.0 * time.seconds_since_startup().sin() as f32).abs(),\n\n );\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/game/alien_cake_addict.rs","rank":57,"score":250849.70958651172},{"content":"// TODO: ideally we can remove this once bevy gets a physics system\n\n/// Axis-aligned bounding box collision with \"side\" detection\n\npub fn collide(a_pos: Vec3, a_size: Vec2, b_pos: Vec3, b_size: Vec2) -> Option<Collision> {\n\n let a_min = a_pos.truncate() - a_size / 2.0;\n\n let a_max = a_pos.truncate() + a_size / 2.0;\n\n\n\n let b_min = b_pos.truncate() - b_size / 2.0;\n\n let b_max = b_pos.truncate() + b_size / 2.0;\n\n\n\n // check to see if the two rectangles are intersecting\n\n if a_min.x < b_max.x && a_max.x > b_min.x && a_min.y < b_max.y && a_max.y > b_min.y {\n\n // check to see if we hit on the left or right side\n\n let (x_collision, x_depth) = if a_min.x < b_min.x && a_max.x > b_min.x && a_max.x < b_max.x\n\n {\n\n (Some(Collision::Left), b_min.x - a_max.x)\n\n } else if a_min.x > b_min.x && a_min.x < b_max.x && a_max.x > b_max.x {\n\n (Some(Collision::Right), a_min.x - b_max.x)\n\n } else {\n\n (None, 0.0)\n\n };\n\n\n\n // check to see if we hit on the top or bottom side\n","file_path":"crates/bevy_sprite/src/collide_aabb.rs","rank":58,"score":250844.71322981652},{"content":"fn text_color_system(time: Res<Time>, mut query: Query<&mut Text, With<ColorText>>) {\n\n for mut text in query.iter_mut() {\n\n let seconds = time.seconds_since_startup() as f32;\n\n // We used the `Text::with_section` helper method, but it is still just a `Text`,\n\n // so to update it, we are still updating the one and only section\n\n text.sections[0].style.color = Color::Rgba {\n\n red: (1.25 * seconds).sin() / 2.0 + 0.5,\n\n green: (0.75 * seconds).sin() / 2.0 + 0.5,\n\n blue: (0.50 * seconds).sin() / 2.0 + 0.5,\n\n alpha: 1.0,\n\n };\n\n }\n\n}\n","file_path":"examples/ui/text.rs","rank":59,"score":250844.01955273774},{"content":"/// Defines how min_size, size, and max_size affects the bounds of a text\n\n/// block.\n\npub fn text_constraint(min_size: Val, size: Val, max_size: Val, scale_factor: f64) -> f32 {\n\n // Needs support for percentages\n\n match (min_size, size, max_size) {\n\n (_, _, Val::Px(max)) => scale_value(max, scale_factor),\n\n (Val::Px(min), _, _) => scale_value(min, scale_factor),\n\n (Val::Undefined, Val::Px(size), Val::Undefined) => scale_value(size, scale_factor),\n\n (Val::Auto, Val::Px(size), Val::Auto) => scale_value(size, scale_factor),\n\n _ => f32::MAX,\n\n }\n\n}\n\n\n\n/// Computes the size of a text block and updates the TextGlyphs with the\n\n/// new computed glyphs from the layout\n","file_path":"crates/bevy_ui/src/widget/text.rs","rank":60,"score":250779.47720948322},{"content":"pub fn build_ui_pipeline(shaders: &mut Assets<Shader>) -> PipelineDescriptor {\n\n PipelineDescriptor {\n\n depth_stencil: Some(DepthStencilState {\n\n format: TextureFormat::Depth32Float,\n\n depth_write_enabled: true,\n\n depth_compare: CompareFunction::Less,\n\n stencil: StencilState {\n\n front: StencilFaceState::IGNORE,\n\n back: StencilFaceState::IGNORE,\n\n read_mask: 0,\n\n write_mask: 0,\n\n },\n\n bias: DepthBiasState {\n\n constant: 0,\n\n slope_scale: 0.0,\n\n clamp: 0.0,\n\n },\n\n }),\n\n color_target_states: vec![ColorTargetState {\n\n format: TextureFormat::default(),\n","file_path":"crates/bevy_ui/src/render/mod.rs","rank":61,"score":247199.81039892483},{"content":"pub fn build_sprite_pipeline(shaders: &mut Assets<Shader>) -> PipelineDescriptor {\n\n PipelineDescriptor {\n\n depth_stencil: Some(DepthStencilState {\n\n format: TextureFormat::Depth32Float,\n\n depth_write_enabled: true,\n\n depth_compare: CompareFunction::LessEqual,\n\n stencil: StencilState {\n\n front: StencilFaceState::IGNORE,\n\n back: StencilFaceState::IGNORE,\n\n read_mask: 0,\n\n write_mask: 0,\n\n },\n\n bias: DepthBiasState {\n\n constant: 0,\n\n slope_scale: 0.0,\n\n clamp: 0.0,\n\n },\n\n }),\n\n color_target_states: vec![ColorTargetState {\n\n format: TextureFormat::default(),\n","file_path":"crates/bevy_sprite/src/render/mod.rs","rank":62,"score":247199.81039892483},{"content":"fn sorted_remove<T: Eq + Ord + Copy>(source: &mut Vec<T>, remove: &[T]) {\n\n let mut remove_index = 0;\n\n source.retain(|value| {\n\n while remove_index < remove.len() && *value > remove[remove_index] {\n\n remove_index += 1;\n\n }\n\n\n\n if remove_index < remove.len() {\n\n *value != remove[remove_index]\n\n } else {\n\n true\n\n }\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n #[test]\n\n fn sorted_remove() {\n\n let mut a = vec![1, 2, 3, 4, 5, 6, 7];\n","file_path":"crates/bevy_ecs/src/world/entity_ref.rs","rank":63,"score":246634.71459244235},{"content":"pub fn build_sprite_sheet_pipeline(shaders: &mut Assets<Shader>) -> PipelineDescriptor {\n\n PipelineDescriptor {\n\n depth_stencil: Some(DepthStencilState {\n\n format: TextureFormat::Depth32Float,\n\n depth_write_enabled: true,\n\n depth_compare: CompareFunction::LessEqual,\n\n stencil: StencilState {\n\n front: StencilFaceState::IGNORE,\n\n back: StencilFaceState::IGNORE,\n\n read_mask: 0,\n\n write_mask: 0,\n\n },\n\n bias: DepthBiasState {\n\n constant: 0,\n\n slope_scale: 0.0,\n\n clamp: 0.0,\n\n },\n\n }),\n\n color_target_states: vec![ColorTargetState {\n\n format: TextureFormat::default(),\n","file_path":"crates/bevy_sprite/src/render/mod.rs","rank":64,"score":243846.93218358018},{"content":"pub trait AsVertexFormats {\n\n fn as_vertex_formats() -> &'static [VertexFormat];\n\n}\n\n\n\nimpl AsVertexFormats for f32 {\n\n fn as_vertex_formats() -> &'static [VertexFormat] {\n\n &[VertexFormat::Float32]\n\n }\n\n}\n\n\n\nimpl AsVertexFormats for Vec2 {\n\n fn as_vertex_formats() -> &'static [VertexFormat] {\n\n &[VertexFormat::Float32x2]\n\n }\n\n}\n\n\n\nimpl AsVertexFormats for Vec3 {\n\n fn as_vertex_formats() -> &'static [VertexFormat] {\n\n &[VertexFormat::Float32x3]\n\n }\n","file_path":"crates/bevy_render/src/pipeline/vertex_format.rs","rank":65,"score":242946.55888804587},{"content":"fn change_component(time: Res<Time>, mut query: Query<(Entity, &mut MyComponent)>) {\n\n for (entity, mut component) in query.iter_mut() {\n\n if rand::thread_rng().gen_bool(0.1) {\n\n info!(\"changing component {:?}\", entity);\n\n component.0 = time.seconds_since_startup();\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/ecs/change_detection.rs","rank":66,"score":242061.83863347338},{"content":"/// A [`World`] mutation.\n\npub trait Command: Send + Sync + 'static {\n\n fn write(self: Box<Self>, world: &mut World);\n\n}\n\n\n\n/// A queue of [`Command`]s.\n\n#[derive(Default)]\n\npub struct CommandQueue {\n\n commands: Vec<Box<dyn Command>>,\n\n}\n\n\n\nimpl CommandQueue {\n\n /// Execute the queued [`Command`]s in the world.\n\n /// This clears the queue.\n\n pub fn apply(&mut self, world: &mut World) {\n\n world.flush();\n\n for command in self.commands.drain(..) {\n\n command.write(world);\n\n }\n\n }\n\n\n","file_path":"crates/bevy_ecs/src/system/commands.rs","rank":67,"score":240609.46301251167},{"content":"pub fn create_render_pass<'a, 'b>(\n\n pass_descriptor: &PassDescriptor,\n\n refs: &WgpuResourceRefs<'a>,\n\n encoder: &'a mut wgpu::CommandEncoder,\n\n) -> wgpu::RenderPass<'a> {\n\n encoder.begin_render_pass(&wgpu::RenderPassDescriptor {\n\n label: None,\n\n color_attachments: &pass_descriptor\n\n .color_attachments\n\n .iter()\n\n .map(|c| create_wgpu_color_attachment(refs, c))\n\n .collect::<Vec<wgpu::RenderPassColorAttachment>>(),\n\n depth_stencil_attachment: pass_descriptor\n\n .depth_stencil_attachment\n\n .as_ref()\n\n .map(|d| create_wgpu_depth_stencil_attachment(refs, d)),\n\n })\n\n}\n\n\n","file_path":"pipelined/bevy_wgpu2/src/render_context.rs","rank":68,"score":239108.88416252052},{"content":"fn text_update_system(mut state: ResMut<State>, time: Res<Time>, mut query: Query<&mut Text>) {\n\n if state.timer.tick(time.delta()).finished() {\n\n for mut text in query.iter_mut() {\n\n let c = rand::random::<u8>() as char;\n\n if !text.sections[0].value.contains(c) {\n\n text.sections[0].value.push(c);\n\n }\n\n }\n\n\n\n state.timer.reset();\n\n }\n\n}\n\n\n","file_path":"examples/ui/font_atlas_debug.rs","rank":69,"score":236939.16564012325},{"content":"fn setup(mut commands: Commands, asset_server: Res<AssetServer>, mut state: ResMut<State>) {\n\n let font_handle = asset_server.load(\"fonts/FiraSans-Bold.ttf\");\n\n state.handle = font_handle.clone();\n\n commands.spawn_bundle(UiCameraBundle::default());\n\n commands.spawn_bundle(TextBundle {\n\n text: Text::with_section(\n\n \"a\",\n\n TextStyle {\n\n font: font_handle,\n\n font_size: 60.0,\n\n color: Color::YELLOW,\n\n },\n\n Default::default(),\n\n ),\n\n ..Default::default()\n\n });\n\n}\n","file_path":"examples/ui/font_atlas_debug.rs","rank":70,"score":234983.0248594849},{"content":"fn log_names(query: Query<&Name>) {\n\n info!(\"Log all entities with `Name` component\");\n\n // this will necessarily have to print both components.\n\n for name in query.iter() {\n\n info!(\"{:?}\", name);\n\n }\n\n}\n","file_path":"examples/ecs/query_bundle.rs","rank":71,"score":234778.36265611346},{"content":"pub fn scale_value(value: f32, factor: f64) -> f32 {\n\n (value as f64 * factor) as f32\n\n}\n","file_path":"crates/bevy_text/src/text2d.rs","rank":72,"score":230499.3618815499},{"content":"#[derive(Debug)]\n\nstruct Name(String);\n\n\n","file_path":"examples/ecs/query_bundle.rs","rank":73,"score":228179.794863642},{"content":"fn next_token<'a>(path: &'a str, index: &mut usize) -> Option<Token<'a>> {\n\n if *index >= path.len() {\n\n return None;\n\n }\n\n\n\n match path[*index..].chars().next().unwrap() {\n\n '.' => {\n\n *index += 1;\n\n return Some(Token::Dot);\n\n }\n\n '[' => {\n\n *index += 1;\n\n return Some(Token::OpenBracket);\n\n }\n\n ']' => {\n\n *index += 1;\n\n return Some(Token::CloseBracket);\n\n }\n\n _ => {}\n\n }\n","file_path":"crates/bevy_reflect/src/path.rs","rank":74,"score":228044.61420560977},{"content":"fn infotext_system(mut commands: Commands, asset_server: Res<AssetServer>) {\n\n let font = asset_server.load(\"fonts/FiraSans-Bold.ttf\");\n\n commands.spawn_bundle(UiCameraBundle::default());\n\n commands.spawn_bundle(TextBundle {\n\n style: Style {\n\n align_self: AlignSelf::FlexEnd,\n\n position_type: PositionType::Absolute,\n\n position: Rect {\n\n top: Val::Px(5.0),\n\n left: Val::Px(15.0),\n\n ..Default::default()\n\n },\n\n ..Default::default()\n\n },\n\n text: Text::with_section(\n\n \"This is\\ntext with\\nline breaks\\nin the top left\",\n\n TextStyle {\n\n font: font.clone(),\n\n font_size: 50.0,\n\n color: Color::WHITE,\n","file_path":"examples/ui/text_debug.rs","rank":75,"score":227974.45222889274},{"content":"fn check_tick(last_change_tick: &mut u32, change_tick: u32) {\n\n let tick_delta = change_tick.wrapping_sub(*last_change_tick);\n\n const MAX_DELTA: u32 = (u32::MAX / 4) * 3;\n\n // Clamp to max delta\n\n if tick_delta > MAX_DELTA {\n\n *last_change_tick = change_tick.wrapping_sub(MAX_DELTA);\n\n }\n\n}\n","file_path":"crates/bevy_ecs/src/component/mod.rs","rank":76,"score":227972.52286204055},{"content":"fn spawn_enemy(mut commands: Commands, keyboard_input: Res<Input<KeyCode>>) {\n\n if keyboard_input.just_pressed(KeyCode::Space) {\n\n commands.spawn().insert(Enemy { hit_points: 5 });\n\n }\n\n}\n\n\n","file_path":"tests/how_to_test_systems.rs","rank":77,"score":225212.39136214132},{"content":"/// Create an instance of the platform default `AssetIo`\n\n///\n\n/// This is useful when providing a custom `AssetIo` instance that needs to\n\n/// delegate to the default `AssetIo` for the platform.\n\npub fn create_platform_default_asset_io(app: &mut App) -> Box<dyn AssetIo> {\n\n let settings = app\n\n .world\n\n .get_resource_or_insert_with(AssetServerSettings::default);\n\n\n\n #[cfg(all(not(target_arch = \"wasm32\"), not(target_os = \"android\")))]\n\n let source = FileAssetIo::new(&settings.asset_folder);\n\n #[cfg(target_arch = \"wasm32\")]\n\n let source = WasmAssetIo::new(&settings.asset_folder);\n\n #[cfg(target_os = \"android\")]\n\n let source = AndroidAssetIo::new(&settings.asset_folder);\n\n\n\n Box::new(source)\n\n}\n\n\n\nimpl Plugin for AssetPlugin {\n\n fn build(&self, app: &mut App) {\n\n if app.world.get_resource::<AssetServer>().is_none() {\n\n let task_pool = app\n\n .world\n","file_path":"crates/bevy_asset/src/lib.rs","rank":78,"score":223091.0627794713},{"content":"/// Update [`GlobalTransform`] component of entities based on entity hierarchy and\n\n/// [`Transform`] component.\n\npub fn transform_propagate_system(\n\n mut root_query: Query<\n\n (Entity, Option<&Children>, &Transform, &mut GlobalTransform),\n\n Without<Parent>,\n\n >,\n\n mut transform_query: Query<(&Transform, &mut GlobalTransform), With<Parent>>,\n\n changed_transform_query: Query<Entity, Changed<Transform>>,\n\n children_query: Query<Option<&Children>, (With<Parent>, With<GlobalTransform>)>,\n\n) {\n\n for (entity, children, transform, mut global_transform) in root_query.iter_mut() {\n\n let mut changed = false;\n\n if changed_transform_query.get(entity).is_ok() {\n\n *global_transform = GlobalTransform::from(*transform);\n\n changed = true;\n\n }\n\n\n\n if let Some(children) = children {\n\n for child in children.0.iter() {\n\n propagate_recursive(\n\n &global_transform,\n","file_path":"crates/bevy_transform/src/transform_propagate_system.rs","rank":79,"score":222624.2960737845},{"content":"#[allow(clippy::type_complexity)]\n\npub fn camera_system<T: CameraProjection + Component>(\n\n mut window_resized_events: EventReader<WindowResized>,\n\n mut window_created_events: EventReader<WindowCreated>,\n\n windows: Res<Windows>,\n\n mut queries: QuerySet<(\n\n Query<(Entity, &mut Camera, &mut T)>,\n\n Query<Entity, Added<Camera>>,\n\n )>,\n\n) {\n\n let mut changed_window_ids = Vec::new();\n\n // handle resize events. latest events are handled first because we only want to resize each\n\n // window once\n\n for event in window_resized_events.iter().rev() {\n\n if changed_window_ids.contains(&event.id) {\n\n continue;\n\n }\n\n\n\n changed_window_ids.push(event.id);\n\n }\n\n\n","file_path":"pipelined/bevy_render2/src/camera/camera.rs","rank":80,"score":222318.4677471735},{"content":"fn bytes_to_words(bytes: &[u8]) -> Vec<u32> {\n\n let mut words = Vec::new();\n\n for bytes4 in bytes.chunks(4) {\n\n words.push(u32::from_le_bytes([\n\n bytes4[0], bytes4[1], bytes4[2], bytes4[3],\n\n ]));\n\n }\n\n\n\n words\n\n}\n\n\n\n/// The full \"source\" of a shader\n\n#[derive(Clone, Debug, Hash, Eq, PartialEq)]\n\npub enum ShaderSource {\n\n Spirv(Vec<u32>),\n\n Glsl(String),\n\n}\n\n\n\nimpl ShaderSource {\n\n pub fn spirv_from_bytes(bytes: &[u8]) -> ShaderSource {\n","file_path":"crates/bevy_render/src/shader/shader.rs","rank":81,"score":219677.93066663976},{"content":"// This system updates the score for each entity with the \"Player\" and \"Score\" component.\n\nfn score_system(mut query: Query<(&Player, &mut Score)>) {\n\n for (player, mut score) in query.iter_mut() {\n\n let scored_a_point = random::<bool>();\n\n if scored_a_point {\n\n score.value += 1;\n\n println!(\n\n \"{} scored a point! Their score is: {}\",\n\n player.name, score.value\n\n );\n\n } else {\n\n println!(\n\n \"{} did not score a point! Their score is: {}\",\n\n player.name, score.value\n\n );\n\n }\n\n }\n\n\n\n // this game isn't very fun is it :)\n\n}\n\n\n","file_path":"examples/ecs/ecs_guide.rs","rank":82,"score":218770.89866547362},{"content":"pub fn draw_render_pipelines_system(\n\n mut draw_context: DrawContext,\n\n mut render_resource_bindings: ResMut<RenderResourceBindings>,\n\n msaa: Res<Msaa>,\n\n meshes: Res<Assets<Mesh>>,\n\n mut query: Query<\n\n (&mut Draw, &mut RenderPipelines, &Handle<Mesh>, &Visible),\n\n Without<OutsideFrustum>,\n\n >,\n\n) {\n\n for (mut draw, mut render_pipelines, mesh_handle, visible) in query.iter_mut() {\n\n if !visible.is_visible {\n\n continue;\n\n }\n\n\n\n // don't render if the mesh isn't loaded yet\n\n let mesh = if let Some(mesh) = meshes.get(mesh_handle) {\n\n mesh\n\n } else {\n\n continue;\n","file_path":"crates/bevy_render/src/pipeline/render_pipelines.rs","rank":83,"score":218292.01103070512},{"content":"fn setup(mut commands: Commands) {\n\n commands.spawn().insert(MyComponent(0.));\n\n commands.spawn().insert(Transform::identity());\n\n}\n\n\n","file_path":"examples/ecs/change_detection.rs","rank":84,"score":217498.69128027637},{"content":"fn setup_system(mut commands: Commands) {\n\n // Add an entity to the world with a timer\n\n commands.spawn().insert(Timer::from_seconds(5.0, false));\n\n}\n\n\n","file_path":"examples/ecs/timers.rs","rank":85,"score":217498.69128027637},{"content":"/// This system generates tasks simulating computationally intensive\n\n/// work that potentially spans multiple frames/ticks. A separate\n\n/// system, handle_tasks, will poll the spawned tasks on subsequent\n\n/// frames/ticks, and use the results to spawn cubes\n\nfn spawn_tasks(mut commands: Commands, thread_pool: Res<AsyncComputeTaskPool>) {\n\n for x in 0..NUM_CUBES {\n\n for y in 0..NUM_CUBES {\n\n for z in 0..NUM_CUBES {\n\n // Spawn new task on the AsyncComputeTaskPool\n\n let task = thread_pool.spawn(async move {\n\n let mut rng = rand::thread_rng();\n\n let start_time = Instant::now();\n\n let duration = Duration::from_secs_f32(rng.gen_range(0.05..0.2));\n\n while Instant::now() - start_time < duration {\n\n // Spinning for 'duration', simulating doing hard\n\n // compute work generating translation coords!\n\n }\n\n\n\n // Such hard work, all done!\n\n Transform::from_translation(Vec3::new(x as f32, y as f32, z as f32))\n\n });\n\n\n\n // Spawn new entity and add our new task as a component\n\n commands.spawn().insert(task);\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/async_tasks/async_compute.rs","rank":86,"score":217427.29948016733},{"content":"pub fn winit_runner_with(mut app: App, mut event_loop: EventLoop<()>) {\n\n let mut create_window_event_reader = ManualEventReader::<CreateWindow>::default();\n\n let mut app_exit_event_reader = ManualEventReader::<AppExit>::default();\n\n app.world.insert_non_send(event_loop.create_proxy());\n\n\n\n trace!(\"Entering winit event loop\");\n\n\n\n let should_return_from_run = app\n\n .world\n\n .get_resource::<WinitConfig>()\n\n .map_or(false, |config| config.return_from_run);\n\n\n\n let event_handler = move |event: Event<()>,\n\n event_loop: &EventLoopWindowTarget<()>,\n\n control_flow: &mut ControlFlow| {\n\n *control_flow = ControlFlow::Poll;\n\n\n\n if let Some(app_exit_events) = app.world.get_resource_mut::<Events<AppExit>>() {\n\n if app_exit_event_reader\n\n .iter(&app_exit_events)\n","file_path":"crates/bevy_winit/src/lib.rs","rank":87,"score":217095.8480217863},{"content":"pub fn visible_entities_system(\n\n mut camera_query: Query<(\n\n &Camera,\n\n &GlobalTransform,\n\n &mut VisibleEntities,\n\n Option<&RenderLayers>,\n\n )>,\n\n visible_query: Query<(Entity, &Visible, Option<&RenderLayers>), Without<OutsideFrustum>>,\n\n visible_transform_query: Query<&GlobalTransform, Without<OutsideFrustum>>,\n\n) {\n\n for (camera, camera_global_transform, mut visible_entities, maybe_camera_mask) in\n\n camera_query.iter_mut()\n\n {\n\n visible_entities.value.clear();\n\n let camera_position = camera_global_transform.translation;\n\n let camera_mask = maybe_camera_mask.copied().unwrap_or_default();\n\n\n\n let mut no_transform_order = 0.0;\n\n let mut transparent_entities = Vec::new();\n\n for (entity, visible, maybe_entity_mask) in visible_query.iter() {\n","file_path":"crates/bevy_render/src/camera/visible_entities.rs","rank":88,"score":215658.63456586137},{"content":"fn face_normal(a: [f32; 3], b: [f32; 3], c: [f32; 3]) -> [f32; 3] {\n\n let (a, b, c) = (Vec3::from(a), Vec3::from(b), Vec3::from(c));\n\n (b - a).cross(c - a).normalize().into()\n\n}\n","file_path":"pipelined/bevy_render2/src/mesh/mesh.rs","rank":89,"score":215606.8850554935},{"content":"pub fn extract_core_pipeline_camera_phases(\n\n mut commands: Commands,\n\n active_cameras: Res<ActiveCameras>,\n\n) {\n\n if let Some(camera_2d) = active_cameras.get(CameraPlugin::CAMERA_2D) {\n\n if let Some(entity) = camera_2d.entity {\n\n commands\n\n .get_or_spawn(entity)\n\n .insert(RenderPhase::<Transparent2dPhase>::default());\n\n }\n\n }\n\n if let Some(camera_3d) = active_cameras.get(CameraPlugin::CAMERA_3D) {\n\n if let Some(entity) = camera_3d.entity {\n\n commands\n\n .get_or_spawn(entity)\n\n .insert(RenderPhase::<Transparent3dPhase>::default());\n\n }\n\n }\n\n}\n\n\n","file_path":"pipelined/bevy_render2/src/core_pipeline/mod.rs","rank":90,"score":215469.21585644947},{"content":"fn setup_cameras(mut commands: Commands, mut game: ResMut<Game>) {\n\n game.camera_should_focus = Vec3::from(RESET_FOCUS);\n\n game.camera_is_focus = game.camera_should_focus;\n\n commands.spawn_bundle(PerspectiveCameraBundle {\n\n transform: Transform::from_xyz(\n\n -(BOARD_SIZE_I as f32 / 2.0),\n\n 2.0 * BOARD_SIZE_J as f32 / 3.0,\n\n BOARD_SIZE_J as f32 / 2.0 - 0.5,\n\n )\n\n .looking_at(game.camera_is_focus, Vec3::Y),\n\n ..Default::default()\n\n });\n\n commands.spawn_bundle(UiCameraBundle::default());\n\n}\n\n\n","file_path":"examples/game/alien_cake_addict.rs","rank":91,"score":215384.94156255404},{"content":"#[proc_macro]\n\npub fn impl_query_set(_input: TokenStream) -> TokenStream {\n\n let mut tokens = TokenStream::new();\n\n let max_queries = 4;\n\n let queries = get_idents(|i| format!(\"Q{}\", i), max_queries);\n\n let filters = get_idents(|i| format!(\"F{}\", i), max_queries);\n\n let lifetimes = get_lifetimes(|i| format!(\"'q{}\", i), max_queries);\n\n let mut query_fns = Vec::new();\n\n let mut query_fn_muts = Vec::new();\n\n for i in 0..max_queries {\n\n let query = &queries[i];\n\n let filter = &filters[i];\n\n let lifetime = &lifetimes[i];\n\n let fn_name = Ident::new(&format!(\"q{}\", i), Span::call_site());\n\n let fn_name_mut = Ident::new(&format!(\"q{}_mut\", i), Span::call_site());\n\n let index = Index::from(i);\n\n query_fns.push(quote! {\n\n pub fn #fn_name(&self) -> &Query<#lifetime, #query, #filter> {\n\n &self.0.#index\n\n }\n\n });\n","file_path":"crates/bevy_ecs/macros/src/lib.rs","rank":92,"score":215369.7884388137},{"content":"fn get_texture_view<'a>(\n\n refs: &WgpuResourceRefs<'a>,\n\n attachment: &TextureAttachment,\n\n) -> &'a wgpu::TextureView {\n\n match attachment {\n\n TextureAttachment::Id(render_resource) => refs.texture_views.get(&render_resource).unwrap_or_else(|| &refs.swap_chain_frames.get(&render_resource).unwrap().output.view),\n\n TextureAttachment::Input(_) => panic!(\"Encountered unset `TextureAttachment::Input`. The `RenderGraph` executor should always set `TextureAttachment::Inputs` to `TextureAttachment::RenderResource` before running. This is a bug, please report it!\"),\n\n }\n\n}\n\n\n","file_path":"pipelined/bevy_wgpu2/src/render_context.rs","rank":93,"score":215208.3611282318},{"content":"fn contains_component_with_id(\n\n world: &World,\n\n component_id: ComponentId,\n\n location: EntityLocation,\n\n) -> bool {\n\n world.archetypes[location.archetype_id].contains(component_id)\n\n}\n\n\n\n/// Adds a bundle to the given archetype and returns the resulting archetype. This could be the same\n\n/// [ArchetypeId], in the event that adding the given bundle does not result in an Archetype change.\n\n/// Results are cached in the Archetype Graph to avoid redundant work.\n\n///\n\n/// # Safety\n\n/// components in `bundle_info` must exist\n\npub(crate) unsafe fn add_bundle_to_archetype(\n\n archetypes: &mut Archetypes,\n\n storages: &mut Storages,\n\n components: &mut Components,\n\n archetype_id: ArchetypeId,\n\n bundle_info: &BundleInfo,\n","file_path":"crates/bevy_ecs/src/world/entity_ref.rs","rank":94,"score":214224.09457334518},{"content":"fn hurt_enemies(mut enemies: Query<&mut Enemy>) {\n\n for mut enemy in enemies.iter_mut() {\n\n enemy.hit_points -= 1;\n\n }\n\n}\n\n\n","file_path":"tests/how_to_test_systems.rs","rank":95,"score":214118.30463122556},{"content":"// This is a \"startup\" system that runs exactly once when the app starts up. Startup systems are\n\n// generally used to create the initial \"state\" of our game. The only thing that distinguishes a\n\n// \"startup\" system from a \"normal\" system is how it is registered: Startup:\n\n// app.add_startup_system(startup_system) Normal: app.add_system(normal_system)\n\nfn startup_system(mut commands: Commands, mut game_state: ResMut<GameState>) {\n\n // Create our game rules resource\n\n commands.insert_resource(GameRules {\n\n max_rounds: 10,\n\n winning_score: 4,\n\n max_players: 4,\n\n });\n\n\n\n // Add some players to our world. Players start with a score of 0 ... we want our game to be\n\n // fair!\n\n commands.spawn_batch(vec![\n\n (\n\n Player {\n\n name: \"Alice\".to_string(),\n\n },\n\n Score { value: 0 },\n\n ),\n\n (\n\n Player {\n\n name: \"Bob\".to_string(),\n\n },\n\n Score { value: 0 },\n\n ),\n\n ]);\n\n\n\n // set the total players to \"2\"\n\n game_state.total_players = 2;\n\n}\n\n\n","file_path":"examples/ecs/ecs_guide.rs","rank":96,"score":212929.96922247816},{"content":"pub fn lights_node_system(\n\n mut state: Local<LightsNodeSystemState>,\n\n render_resource_context: Res<Box<dyn RenderResourceContext>>,\n\n ambient_light_resource: Res<AmbientLight>,\n\n // TODO: this write on RenderResourceBindings will prevent this system from running in parallel\n\n // with other systems that do the same\n\n mut render_resource_bindings: ResMut<RenderResourceBindings>,\n\n point_lights: Query<(&PointLight, &GlobalTransform)>,\n\n dir_lights: Query<&DirectionalLight>,\n\n) {\n\n let state = &mut state;\n\n let render_resource_context = &**render_resource_context;\n\n\n\n // premultiply ambient brightness\n\n let ambient_light: [f32; 4] =\n\n (ambient_light_resource.color * ambient_light_resource.brightness).into();\n\n let ambient_light_size = std::mem::size_of::<[f32; 4]>();\n\n\n\n let point_light_count = point_lights.iter().len().min(state.max_point_lights);\n\n let point_light_size = std::mem::size_of::<PointLightUniform>();\n","file_path":"crates/bevy_pbr/src/render_graph/lights_node.rs","rank":97,"score":212655.81836277278},{"content":"/// This system ticks all the `Timer` components on entities within the scene\n\n/// using bevy's `Time` resource to get the delta between each update.\n\nfn timer_system(time: Res<Time>, mut query: Query<&mut Timer>) {\n\n for mut timer in query.iter_mut() {\n\n if timer.tick(time.delta()).just_finished() {\n\n info!(\"Entity timer just finished\")\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/ecs/timers.rs","rank":98,"score":210598.14484495987},{"content":"fn scoreboard_system(scoreboard: Res<Scoreboard>, mut query: Query<&mut Text>) {\n\n let mut text = query.single_mut().unwrap();\n\n text.sections[0].value = format!(\"Score: {}\", scoreboard.score);\n\n}\n\n\n","file_path":"examples/game/breakout.rs","rank":99,"score":210587.92912744623}],"string":"[\n {\n \"content\": \"/// Internally, `bevy_render` uses hashes to identify vertex attribute names.\\n\\npub fn get_vertex_attribute_name_id(name: &str) -> u64 {\\n\\n let mut hasher = bevy_utils::AHasher::default();\\n\\n hasher.write(&name.as_bytes());\\n\\n hasher.finish()\\n\\n}\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/pipeline/vertex_buffer_descriptor.rs\",\n \"rank\": 0,\n \"score\": 466873.61920144095\n },\n {\n \"content\": \"/// Internally, `bevy_render` uses hashes to identify vertex attribute names.\\n\\npub fn get_vertex_attribute_name_id(name: &str) -> u64 {\\n\\n let mut hasher = bevy_utils::AHasher::default();\\n\\n hasher.write(&name.as_bytes());\\n\\n hasher.finish()\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_render/src/pipeline/vertex_buffer_descriptor.rs\",\n \"rank\": 1,\n \"score\": 452709.33903283736\n },\n {\n \"content\": \"pub fn get_wgpu_render_system(world: &mut World) -> impl FnMut(&mut World) {\\n\\n let options = world\\n\\n .get_resource::<WgpuOptions>()\\n\\n .cloned()\\n\\n .unwrap_or_else(WgpuOptions::default);\\n\\n let mut wgpu_renderer = future::block_on(WgpuRenderer::new(options));\\n\\n\\n\\n let resource_context = WgpuRenderResourceContext::new(wgpu_renderer.device.clone());\\n\\n world.insert_resource::<Box<dyn RenderResourceContext>>(Box::new(resource_context));\\n\\n world.insert_resource(SharedBuffers::new(4096));\\n\\n move |world| {\\n\\n wgpu_renderer.update(world);\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct WgpuOptions {\\n\\n pub device_label: Option<Cow<'static, str>>,\\n\\n pub backend: WgpuBackend,\\n\\n pub power_pref: WgpuPowerOptions,\\n\",\n \"file_path\": \"crates/bevy_wgpu/src/lib.rs\",\n \"rank\": 2,\n \"score\": 396667.3077346629\n },\n {\n \"content\": \"pub fn despawn_with_children_recursive(world: &mut World, entity: Entity) {\\n\\n // first, make the entity's own parent forget about it\\n\\n if let Some(parent) = world.get::<Parent>(entity).map(|parent| parent.0) {\\n\\n if let Some(mut children) = world.get_mut::<Children>(parent) {\\n\\n children.0.retain(|c| *c != entity);\\n\\n }\\n\\n }\\n\\n\\n\\n // then despawn the entity and all of its children\\n\\n despawn_with_children_recursive_inner(world, entity);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_transform/src/hierarchy/hierarchy.rs\",\n \"rank\": 3,\n \"score\": 385361.1296731719\n },\n {\n \"content\": \"/// Generate a color modulation\\n\\n///\\n\\n/// Because there is no `Mul<Color> for Color` instead `[f32; 3]` is\\n\\n/// used.\\n\\nfn gen_color(rng: &mut impl Rng) -> [f32; 3] {\\n\\n let r = rng.gen_range(0.2..1.0);\\n\\n let g = rng.gen_range(0.2..1.0);\\n\\n let b = rng.gen_range(0.2..1.0);\\n\\n let v = Vec3::new(r, g, b);\\n\\n v.normalize().into()\\n\\n}\\n\",\n \"file_path\": \"examples/tools/bevymark_pipelined.rs\",\n \"rank\": 4,\n \"score\": 370071.6342194791\n },\n {\n \"content\": \"pub fn wgpu_window_system(world: &mut World) {\\n\\n world.resource_scope(|world, mut renderer: Mut<WgpuRenderer>| {\\n\\n renderer.handle_new_windows(world);\\n\\n })\\n\\n}\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct WgpuOptions {\\n\\n pub device_label: Option<Cow<'static, str>>,\\n\\n pub backend: WgpuBackend,\\n\\n pub power_pref: WgpuPowerOptions,\\n\\n pub features: WgpuFeatures,\\n\\n pub limits: WgpuLimits,\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub enum WgpuBackend {\\n\\n Auto,\\n\\n Vulkan,\\n\\n Metal,\\n\",\n \"file_path\": \"pipelined/bevy_wgpu2/src/lib.rs\",\n \"rank\": 5,\n \"score\": 358751.30029687705\n },\n {\n \"content\": \"pub fn wgpu_render_system(world: &mut World) {\\n\\n world.resource_scope(|world, mut renderer: Mut<WgpuRenderer>| {\\n\\n renderer.update(world);\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_wgpu2/src/lib.rs\",\n \"rank\": 6,\n \"score\": 358751.30029687705\n },\n {\n \"content\": \"fn add_render_to_texture_graph(graph: &mut RenderGraph, size: Extent3d) {\\n\\n let mut pass_node = PassNode::<&FirstPass>::new(PassDescriptor {\\n\\n color_attachments: vec![RenderPassColorAttachment {\\n\\n attachment: TextureAttachment::Input(\\\"color_attachment\\\".to_string()),\\n\\n resolve_target: None,\\n\\n ops: Operations {\\n\\n load: LoadOp::Clear(Color::rgb(0.1, 0.2, 0.3)),\\n\\n store: true,\\n\\n },\\n\\n }],\\n\\n depth_stencil_attachment: Some(RenderPassDepthStencilAttachment {\\n\\n attachment: TextureAttachment::Input(\\\"depth\\\".to_string()),\\n\\n depth_ops: Some(Operations {\\n\\n load: LoadOp::Clear(1.0),\\n\\n store: true,\\n\\n }),\\n\\n stencil_ops: None,\\n\\n }),\\n\\n sample_count: 1,\\n\\n });\\n\",\n \"file_path\": \"examples/3d/render_to_texture.rs\",\n \"rank\": 8,\n \"score\": 337823.06638159754\n },\n {\n \"content\": \"/// rotates the inner cube (first pass)\\n\\nfn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<FirstPassCube>>) {\\n\\n for mut transform in query.iter_mut() {\\n\\n transform.rotation *= Quat::from_rotation_x(1.5 * time.delta_seconds());\\n\\n transform.rotation *= Quat::from_rotation_z(1.3 * time.delta_seconds());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/3d/render_to_texture.rs\",\n \"rank\": 9,\n \"score\": 337009.5750497079\n },\n {\n \"content\": \"/// Generate a color modulation\\n\\n///\\n\\n/// Because there is no `Mul<Color> for Color` instead `[f32; 3]` is\\n\\n/// used.\\n\\nfn gen_color(rng: &mut impl Rng) -> [f32; 3] {\\n\\n let r = rng.gen_range(0.2..1.0);\\n\\n let g = rng.gen_range(0.2..1.0);\\n\\n let b = rng.gen_range(0.2..1.0);\\n\\n let v = Vec3::new(r, g, b);\\n\\n v.normalize().into()\\n\\n}\\n\",\n \"file_path\": \"examples/tools/bevymark.rs\",\n \"rank\": 10,\n \"score\": 333406.55389189615\n },\n {\n \"content\": \"/// rotates the outer cube (main pass)\\n\\nfn cube_rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<MainPassCube>>) {\\n\\n for mut transform in query.iter_mut() {\\n\\n transform.rotation *= Quat::from_rotation_x(1.0 * time.delta_seconds());\\n\\n transform.rotation *= Quat::from_rotation_y(0.7 * time.delta_seconds());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/3d/render_to_texture.rs\",\n \"rank\": 11,\n \"score\": 331968.4707518142\n },\n {\n \"content\": \"pub fn sort_phase_system<T: 'static>(mut render_phases: Query<&mut RenderPhase<T>>) {\\n\\n for mut phase in render_phases.iter_mut() {\\n\\n phase.sort();\\n\\n } \\n\\n}\",\n \"file_path\": \"pipelined/bevy_render2/src/render_phase/mod.rs\",\n \"rank\": 12,\n \"score\": 325584.9911663728\n },\n {\n \"content\": \"// Should only be called by `despawn_with_children_recursive`!\\n\\nfn despawn_with_children_recursive_inner(world: &mut World, entity: Entity) {\\n\\n if let Some(mut children) = world.get_mut::<Children>(entity) {\\n\\n for e in std::mem::take(&mut children.0) {\\n\\n despawn_with_children_recursive_inner(world, e);\\n\\n }\\n\\n }\\n\\n\\n\\n if !world.despawn(entity) {\\n\\n debug!(\\\"Failed to despawn entity {:?}\\\", entity);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Command for DespawnRecursive {\\n\\n fn write(self: Box<Self>, world: &mut World) {\\n\\n despawn_with_children_recursive(world, self.entity);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_transform/src/hierarchy/hierarchy.rs\",\n \"rank\": 13,\n \"score\": 323183.62195770716\n },\n {\n \"content\": \"fn move_camera(time: Res<Time>, mut query: Query<(&mut Transform, &mut Position)>) {\\n\\n for (mut transform, mut position) in query.iter_mut() {\\n\\n position\\n\\n .0\\n\\n .rotate(Quat::from_rotation_z(time.delta_seconds() * 0.5));\\n\\n position.0 =\\n\\n position.0 * Transform::from_translation(Vec3::X * CAMERA_SPEED * time.delta_seconds());\\n\\n transform.translation = position.0.translation;\\n\\n transform.rotation *= Quat::from_rotation_z(time.delta_seconds() / 2.0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/2d/many_sprites.rs\",\n \"rank\": 14,\n \"score\": 317181.3002020847\n },\n {\n \"content\": \"pub fn gilrs_event_system(world: &mut World) {\\n\\n let world = world.cell();\\n\\n let mut gilrs = world.get_non_send_mut::<Gilrs>().unwrap();\\n\\n let mut event = world.get_resource_mut::<Events<GamepadEventRaw>>().unwrap();\\n\\n event.update();\\n\\n while let Some(gilrs_event) = gilrs.next_event() {\\n\\n match gilrs_event.event {\\n\\n EventType::Connected => {\\n\\n event.send(GamepadEventRaw(\\n\\n convert_gamepad_id(gilrs_event.id),\\n\\n GamepadEventType::Connected,\\n\\n ));\\n\\n }\\n\\n EventType::Disconnected => {\\n\\n event.send(GamepadEventRaw(\\n\\n convert_gamepad_id(gilrs_event.id),\\n\\n GamepadEventType::Disconnected,\\n\\n ));\\n\\n }\\n\\n EventType::ButtonChanged(gilrs_button, value, _) => {\\n\",\n \"file_path\": \"crates/bevy_gilrs/src/gilrs_system.rs\",\n \"rank\": 15,\n \"score\": 313423.0022000539\n },\n {\n \"content\": \"pub fn scene_spawner_system(world: &mut World) {\\n\\n world.resource_scope(|world, mut scene_spawner: Mut<SceneSpawner>| {\\n\\n let scene_asset_events = world\\n\\n .get_resource::<Events<AssetEvent<DynamicScene>>>()\\n\\n .unwrap();\\n\\n\\n\\n let mut updated_spawned_scenes = Vec::new();\\n\\n for event in scene_spawner\\n\\n .scene_asset_event_reader\\n\\n .iter(&scene_asset_events)\\n\\n {\\n\\n if let AssetEvent::Modified { handle } = event {\\n\\n if scene_spawner.spawned_dynamic_scenes.contains_key(handle) {\\n\\n updated_spawned_scenes.push(handle.clone_weak());\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n scene_spawner.despawn_queued_scenes(world).unwrap();\\n\\n scene_spawner\\n\\n .spawn_queued_scenes(world)\\n\\n .unwrap_or_else(|err| panic!(\\\"{}\\\", err));\\n\\n scene_spawner\\n\\n .update_spawned_scenes(world, &updated_spawned_scenes)\\n\\n .unwrap();\\n\\n scene_spawner.set_scene_instance_parent_sync(world);\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_scene/src/scene_spawner.rs\",\n \"rank\": 16,\n \"score\": 313423.0022000539\n },\n {\n \"content\": \"pub fn from_f32_size(scale_factor: f64, size: Size<f32>) -> stretch::geometry::Size<f32> {\\n\\n stretch::geometry::Size {\\n\\n width: (scale_factor * size.width as f64) as f32,\\n\\n height: (scale_factor * size.height as f64) as f32,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_ui/src/flex/convert.rs\",\n \"rank\": 17,\n \"score\": 313399.64953757846\n },\n {\n \"content\": \"pub fn gilrs_event_startup_system(world: &mut World) {\\n\\n let world = world.cell();\\n\\n let gilrs = world.get_non_send::<Gilrs>().unwrap();\\n\\n let mut event = world.get_resource_mut::<Events<GamepadEventRaw>>().unwrap();\\n\\n for (id, _) in gilrs.gamepads() {\\n\\n event.send(GamepadEventRaw(\\n\\n convert_gamepad_id(id),\\n\\n GamepadEventType::Connected,\\n\\n ));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_gilrs/src/gilrs_system.rs\",\n \"rank\": 18,\n \"score\": 309587.1735021465\n },\n {\n \"content\": \"fn movement_system(time: Res<Time>, mut bird_query: Query<(&mut Bird, &mut Transform)>) {\\n\\n for (mut bird, mut transform) in bird_query.iter_mut() {\\n\\n transform.translation.x += bird.velocity.x * time.delta_seconds();\\n\\n transform.translation.y += bird.velocity.y * time.delta_seconds();\\n\\n bird.velocity.y += GRAVITY * time.delta_seconds();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/tools/bevymark_pipelined.rs\",\n \"rank\": 19,\n \"score\": 307947.8594017602\n },\n {\n \"content\": \"/// rotates the parent, which will result in the child also rotating\\n\\nfn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<Rotator>>) {\\n\\n for mut transform in query.iter_mut() {\\n\\n transform.rotation *= Quat::from_rotation_x(3.0 * time.delta_seconds());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/3d/z_sort_debug.rs\",\n \"rank\": 20,\n \"score\": 307680.8662791414\n },\n {\n \"content\": \"/// Clears each [RenderPipelines]' shader defs collection\\n\\npub fn clear_shader_defs_system(mut query: Query<&mut RenderPipelines>) {\\n\\n for mut render_pipelines in query.iter_mut() {\\n\\n for render_pipeline in render_pipelines.pipelines.iter_mut() {\\n\\n render_pipeline\\n\\n .specialization\\n\\n .shader_specialization\\n\\n .shader_defs\\n\\n .clear();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_render/src/shader/shader_defs.rs\",\n \"rank\": 21,\n \"score\": 303290.1629673484\n },\n {\n \"content\": \"pub fn render_graph_schedule_executor_system(world: &mut World) {\\n\\n // run render graph systems\\n\\n let mut system_schedule = {\\n\\n let mut render_graph = world.get_resource_mut::<RenderGraph>().unwrap();\\n\\n render_graph.take_schedule()\\n\\n };\\n\\n\\n\\n if let Some(schedule) = system_schedule.as_mut() {\\n\\n schedule.run(world);\\n\\n }\\n\\n let mut render_graph = world.get_resource_mut::<RenderGraph>().unwrap();\\n\\n if let Some(schedule) = system_schedule.take() {\\n\\n render_graph.set_schedule(schedule);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_render/src/render_graph/system.rs\",\n \"rank\": 22,\n \"score\": 302402.445861473\n },\n {\n \"content\": \"/// Spawn some players to count\\n\\nfn spawn(mut commands: Commands) {\\n\\n commands.spawn().insert(Player);\\n\\n commands.spawn().insert(Player);\\n\\n commands.spawn().insert(Player);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/system_param.rs\",\n \"rank\": 23,\n \"score\": 299509.45360311115\n },\n {\n \"content\": \"/// Returns vector containing all pairs of indices of systems with ambiguous execution order,\\n\\n/// along with specific components that have triggered the warning.\\n\\n/// Systems must be topologically sorted beforehand.\\n\\nfn find_ambiguities(systems: &[impl SystemContainer]) -> Vec<(usize, usize, Vec<ComponentId>)> {\\n\\n let mut ambiguity_set_labels = HashMap::default();\\n\\n for set in systems.iter().flat_map(|c| c.ambiguity_sets()) {\\n\\n let len = ambiguity_set_labels.len();\\n\\n ambiguity_set_labels.entry(set).or_insert(len);\\n\\n }\\n\\n let mut all_ambiguity_sets = Vec::<FixedBitSet>::with_capacity(systems.len());\\n\\n let mut all_dependencies = Vec::<FixedBitSet>::with_capacity(systems.len());\\n\\n let mut all_dependants = Vec::<FixedBitSet>::with_capacity(systems.len());\\n\\n for (index, container) in systems.iter().enumerate() {\\n\\n let mut ambiguity_sets = FixedBitSet::with_capacity(ambiguity_set_labels.len());\\n\\n for set in container.ambiguity_sets() {\\n\\n ambiguity_sets.insert(ambiguity_set_labels[set]);\\n\\n }\\n\\n all_ambiguity_sets.push(ambiguity_sets);\\n\\n let mut dependencies = FixedBitSet::with_capacity(systems.len());\\n\\n for &dependency in container.dependencies() {\\n\\n dependencies.union_with(&all_dependencies[dependency]);\\n\\n dependencies.insert(dependency);\\n\\n all_dependants[dependency].insert(index);\\n\",\n \"file_path\": \"crates/bevy_ecs/src/schedule/stage.rs\",\n \"rank\": 24,\n \"score\": 298793.8504407645\n },\n {\n \"content\": \"fn collision_system(window: Res<WindowDescriptor>, mut bird_query: Query<(&mut Bird, &Transform)>) {\\n\\n let half_width = window.width as f32 * 0.5;\\n\\n let half_height = window.height as f32 * 0.5;\\n\\n\\n\\n for (mut bird, transform) in bird_query.iter_mut() {\\n\\n let x_vel = bird.velocity.x;\\n\\n let y_vel = bird.velocity.y;\\n\\n let x_pos = transform.translation.x;\\n\\n let y_pos = transform.translation.y;\\n\\n\\n\\n if (x_vel > 0. && x_pos + HALF_BIRD_SIZE > half_width)\\n\\n || (x_vel <= 0. && x_pos - HALF_BIRD_SIZE < -(half_width))\\n\\n {\\n\\n bird.velocity.x = -x_vel;\\n\\n }\\n\\n if y_vel < 0. && y_pos - HALF_BIRD_SIZE < -half_height {\\n\\n bird.velocity.y = -y_vel;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/tools/bevymark_pipelined.rs\",\n \"rank\": 25,\n \"score\": 296999.61267544137\n },\n {\n \"content\": \"fn integrate(mut query: Query<(&mut Acceleration, &mut Transform, &mut LastPos)>) {\\n\\n let dt_sq = (DELTA_TIME * DELTA_TIME) as f32;\\n\\n for (mut acceleration, mut transform, mut last_pos) in query.iter_mut() {\\n\\n // verlet integration\\n\\n // x(t+dt) = 2x(t) - x(t-dt) + a(t)dt^2 + O(dt^4)\\n\\n\\n\\n let new_pos =\\n\\n transform.translation + transform.translation - last_pos.0 + acceleration.0 * dt_sq;\\n\\n acceleration.0 = Vec3::ZERO;\\n\\n last_pos.0 = transform.translation;\\n\\n transform.translation = new_pos;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/ecs/iter_combinations.rs\",\n \"rank\": 26,\n \"score\": 289797.6596487398\n },\n {\n \"content\": \"/// Plays audio currently queued in the [Audio] resource through the [AudioOutput] resource\\n\\npub fn play_queued_audio_system<P: Asset>(world: &mut World)\\n\\nwhere\\n\\n P: Decodable,\\n\\n <P as Decodable>::Decoder: rodio::Source + Send + Sync,\\n\\n <<P as Decodable>::Decoder as Iterator>::Item: rodio::Sample + Send + Sync,\\n\\n{\\n\\n let world = world.cell();\\n\\n let audio_output = world.get_non_send::<AudioOutput<P>>().unwrap();\\n\\n let mut audio = world.get_resource_mut::<Audio<P>>().unwrap();\\n\\n\\n\\n if let Some(audio_sources) = world.get_resource::<Assets<P>>() {\\n\\n audio_output.try_play_queued(&*audio_sources, &mut *audio);\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_audio/src/audio_output.rs\",\n \"rank\": 27,\n \"score\": 288984.66623188695\n },\n {\n \"content\": \"fn ball_movement_system(mut ball_query: Query<(&Ball, &mut Transform)>) {\\n\\n if let Ok((ball, mut transform)) = ball_query.single_mut() {\\n\\n transform.translation += ball.velocity * TIME_STEP;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/game/breakout.rs\",\n \"rank\": 28,\n \"score\": 286198.88197355164\n },\n {\n \"content\": \"fn extract(app_world: &mut World, render_app: &mut App) {\\n\\n let extract = render_app\\n\\n .schedule\\n\\n .get_stage_mut::<SystemStage>(&RenderStage::Extract)\\n\\n .unwrap();\\n\\n extract.run(app_world);\\n\\n extract.apply_buffers(&mut render_app.world);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/lib.rs\",\n \"rank\": 29,\n \"score\": 281733.43631613784\n },\n {\n \"content\": \"pub fn clear_draw_system(mut query: Query<&mut Draw>) {\\n\\n for mut draw in query.iter_mut() {\\n\\n draw.clear_render_commands();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_render/src/draw.rs\",\n \"rank\": 30,\n \"score\": 280968.8788625471\n },\n {\n \"content\": \"fn interact_bodies(mut query: Query<(&Mass, &GlobalTransform, &mut Acceleration)>) {\\n\\n let mut iter = query.iter_combinations_mut();\\n\\n while let Some([(Mass(m1), transform1, mut acc1), (Mass(m2), transform2, mut acc2)]) =\\n\\n iter.fetch_next()\\n\\n {\\n\\n let delta = transform2.translation - transform1.translation;\\n\\n let distance_sq: f32 = delta.length_squared();\\n\\n\\n\\n let f = GRAVITY_CONSTANT / (distance_sq * (distance_sq + SOFTENING).sqrt());\\n\\n let force_unit_mass = delta * f;\\n\\n acc1.0 += force_unit_mass * *m2;\\n\\n acc2.0 -= force_unit_mass * *m1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/iter_combinations.rs\",\n \"rank\": 31,\n \"score\": 278228.07135246857\n },\n {\n \"content\": \"// remove all entities that are not a camera\\n\\nfn teardown(mut commands: Commands, entities: Query<Entity, Without<Camera>>) {\\n\\n for entity in entities.iter() {\\n\\n commands.entity(entity).despawn_recursive();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/game/alien_cake_addict.rs\",\n \"rank\": 32,\n \"score\": 276947.750488578\n },\n {\n \"content\": \"fn movement_system(time: Res<Time>, mut bird_query: Query<(&mut Bird, &mut Transform)>) {\\n\\n for (mut bird, mut transform) in bird_query.iter_mut() {\\n\\n transform.translation.x += bird.velocity.x * time.delta_seconds();\\n\\n transform.translation.y += bird.velocity.y * time.delta_seconds();\\n\\n bird.velocity.y += GRAVITY * time.delta_seconds();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/tools/bevymark.rs\",\n \"rank\": 33,\n \"score\": 274470.88547256467\n },\n {\n \"content\": \"/// Updates [RenderPipelines] with the latest [ShaderDefs]\\n\\npub fn shader_defs_system<T>(mut query: Query<(&T, &mut RenderPipelines), Without<OutsideFrustum>>)\\n\\nwhere\\n\\n T: ShaderDefs + Send + Sync + 'static,\\n\\n{\\n\\n for (shader_defs, mut render_pipelines) in query.iter_mut() {\\n\\n for shader_def in shader_defs.iter_shader_defs() {\\n\\n for render_pipeline in render_pipelines.pipelines.iter_mut() {\\n\\n render_pipeline\\n\\n .specialization\\n\\n .shader_specialization\\n\\n .shader_defs\\n\\n .insert(shader_def.to_string());\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_render/src/shader/shader_defs.rs\",\n \"rank\": 34,\n \"score\": 273901.2330080727\n },\n {\n \"content\": \"/// rotates the parent, which will result in the child also rotating\\n\\nfn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<Rotator>>) {\\n\\n for mut transform in query.iter_mut() {\\n\\n transform.rotation *= Quat::from_rotation_x(3.0 * time.delta_seconds());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/3d/parenting.rs\",\n \"rank\": 35,\n \"score\": 271161.72839418123\n },\n {\n \"content\": \"fn despawn_dead_enemies(mut commands: Commands, enemies: Query<(Entity, &Enemy)>) {\\n\\n for (entity, enemy) in enemies.iter() {\\n\\n if enemy.hit_points == 0 {\\n\\n commands.entity(entity).despawn_recursive();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/how_to_test_systems.rs\",\n \"rank\": 36,\n \"score\": 269964.766638006\n },\n {\n \"content\": \"fn rotator_system(time: Res<Time>, mut query: Query<&mut Transform, With<Rotates>>) {\\n\\n for mut transform in query.iter_mut() {\\n\\n *transform = Transform::from_rotation(Quat::from_rotation_y(\\n\\n (4.0 * std::f32::consts::PI / 20.0) * time.delta_seconds(),\\n\\n )) * *transform;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/3d/load_gltf.rs\",\n \"rank\": 37,\n \"score\": 267411.2491237824\n },\n {\n \"content\": \"fn extract_windows(mut commands: Commands, windows: Res<Windows>) {\\n\\n let mut extracted_windows = ExtractedWindows::default();\\n\\n for window in windows.iter() {\\n\\n extracted_windows.insert(\\n\\n window.id(),\\n\\n ExtractedWindow {\\n\\n id: window.id(),\\n\\n handle: window.raw_window_handle(),\\n\\n physical_width: window.physical_width(),\\n\\n physical_height: window.physical_height(),\\n\\n vsync: window.vsync(),\\n\\n swap_chain_texture: None,\\n\\n },\\n\\n );\\n\\n }\\n\\n\\n\\n commands.insert_resource(extracted_windows);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/view/window.rs\",\n \"rank\": 38,\n \"score\": 267328.03718485986\n },\n {\n \"content\": \"/// Generates a topological order for the given graph.\\n\\npub fn topological_order<Labels: Clone>(\\n\\n graph: &HashMap<usize, HashMap<usize, Labels>>,\\n\\n) -> Result<Vec<usize>, DependencyGraphError<Labels>> {\\n\\n fn check_if_cycles_and_visit<L>(\\n\\n node: &usize,\\n\\n graph: &HashMap<usize, HashMap<usize, L>>,\\n\\n sorted: &mut Vec<usize>,\\n\\n unvisited: &mut HashSet<usize>,\\n\\n current: &mut Vec<usize>,\\n\\n ) -> bool {\\n\\n if current.contains(node) {\\n\\n return true;\\n\\n } else if !unvisited.remove(node) {\\n\\n return false;\\n\\n }\\n\\n current.push(*node);\\n\\n for dependency in graph.get(node).unwrap().keys() {\\n\\n if check_if_cycles_and_visit(dependency, &graph, sorted, unvisited, current) {\\n\\n return true;\\n\\n }\\n\",\n \"file_path\": \"crates/bevy_ecs/src/schedule/graph_utils.rs\",\n \"rank\": 41,\n \"score\": 266277.6687528235\n },\n {\n \"content\": \"/// Apply velocity to positions and rotations.\\n\\nfn move_system(time: Res<Time>, mut q: Query<(&Velocity, &mut Transform)>) {\\n\\n let delta = time.delta_seconds();\\n\\n\\n\\n for (v, mut t) in q.iter_mut() {\\n\\n t.translation += delta * v.translation;\\n\\n t.rotate(Quat::from_rotation_z(v.rotation * delta));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/2d/contributors.rs\",\n \"rank\": 42,\n \"score\": 264288.4136855035\n },\n {\n \"content\": \"/// Sets up two entities, one with a [Name] component as part of a bundle,\\n\\n/// and one entity with [Name] only.\\n\\nfn setup(mut commands: Commands) {\\n\\n commands.spawn().insert(Name(\\\"Steve\\\".to_string()));\\n\\n commands.spawn().insert_bundle(PersonBundle {\\n\\n name: Name(\\\"Bob\\\".to_string()),\\n\\n age: Age(40),\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/query_bundle.rs\",\n \"rank\": 43,\n \"score\": 264266.73638726625\n },\n {\n \"content\": \"fn collision_system(window: Res<WindowDescriptor>, mut bird_query: Query<(&mut Bird, &Transform)>) {\\n\\n let half_width = window.width as f32 * 0.5;\\n\\n let half_height = window.height as f32 * 0.5;\\n\\n\\n\\n for (mut bird, transform) in bird_query.iter_mut() {\\n\\n let x_vel = bird.velocity.x;\\n\\n let y_vel = bird.velocity.y;\\n\\n let x_pos = transform.translation.x;\\n\\n let y_pos = transform.translation.y;\\n\\n\\n\\n if (x_vel > 0. && x_pos + HALF_BIRD_SIZE > half_width)\\n\\n || (x_vel <= 0. && x_pos - HALF_BIRD_SIZE < -(half_width))\\n\\n {\\n\\n bird.velocity.x = -x_vel;\\n\\n }\\n\\n if y_vel < 0. && y_pos - HALF_BIRD_SIZE < -half_height {\\n\\n bird.velocity.y = -y_vel;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/tools/bevymark.rs\",\n \"rank\": 44,\n \"score\": 263624.78795506735\n },\n {\n \"content\": \"pub fn texture_resource_system(\\n\\n render_resource_context: Res<RenderResources>,\\n\\n mut render_command_queue: ResMut<RenderCommandQueue>,\\n\\n mut textures: ResMut<Assets<Texture>>,\\n\\n mut texture_events: EventReader<AssetEvent<Texture>>,\\n\\n) {\\n\\n let render_resource_context = &**render_resource_context;\\n\\n let mut changed_textures = HashSet::default();\\n\\n for event in texture_events.iter() {\\n\\n match event {\\n\\n AssetEvent::Created { handle } => {\\n\\n changed_textures.insert(handle);\\n\\n }\\n\\n AssetEvent::Modified { handle } => {\\n\\n changed_textures.insert(handle);\\n\\n // TODO: uncomment this to support mutated textures\\n\\n // remove_current_texture_resources(render_resource_context, handle, &mut textures);\\n\\n }\\n\\n AssetEvent::Removed { handle } => {\\n\\n remove_current_texture_resources(render_resource_context, handle, &mut textures);\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/texture/mod.rs\",\n \"rank\": 45,\n \"score\": 262305.57273013506\n },\n {\n \"content\": \"fn bytes_to_words(bytes: &[u8]) -> Vec<u32> {\\n\\n let mut words = Vec::new();\\n\\n for bytes4 in bytes.chunks(4) {\\n\\n words.push(u32::from_le_bytes([\\n\\n bytes4[0], bytes4[1], bytes4[2], bytes4[3],\\n\\n ]));\\n\\n }\\n\\n\\n\\n words\\n\\n}\\n\\n\\n\\n/// The full \\\"source\\\" of a shader\\n\\n#[derive(Clone, Debug, Hash, Eq, PartialEq)]\\n\\npub enum ShaderSource {\\n\\n Spirv(Vec<u32>),\\n\\n Glsl(String),\\n\\n}\\n\\n\\n\\nimpl ShaderSource {\\n\\n pub fn spirv_from_bytes(bytes: &[u8]) -> ShaderSource {\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/shader/shader.rs\",\n \"rank\": 46,\n \"score\": 260992.72677562825\n },\n {\n \"content\": \"pub fn update_texture_cache_system(\\n\\n mut texture_cache: ResMut<TextureCache>,\\n\\n render_resources: Res<RenderResources>,\\n\\n) {\\n\\n texture_cache.update(&render_resources);\\n\\n}\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/texture/texture_cache.rs\",\n \"rank\": 47,\n \"score\": 260791.18628106886\n },\n {\n \"content\": \"// Move sprites according to their velocity\\n\\nfn move_system(pool: Res<ComputeTaskPool>, mut sprites: Query<(&mut Transform, &Velocity)>) {\\n\\n // Compute the new location of each sprite in parallel on the\\n\\n // ComputeTaskPool using batches of 32 sprites\\n\\n //\\n\\n // This example is only for demonstrative purposes. Using a\\n\\n // ParallelIterator for an inexpensive operation like addition on only 128\\n\\n // elements will not typically be faster than just using a normal Iterator.\\n\\n // See the ParallelIterator documentation for more information on when\\n\\n // to use or not use ParallelIterator over a normal Iterator.\\n\\n sprites.par_for_each_mut(&pool, 32, |(mut transform, velocity)| {\\n\\n transform.translation += velocity.0.extend(0.0);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/parallel_query.rs\",\n \"rank\": 48,\n \"score\": 260294.12602192012\n },\n {\n \"content\": \"fn save_scene_system(world: &mut World) {\\n\\n // Scenes can be created from any ECS World. You can either create a new one for the scene or\\n\\n // use the current World.\\n\\n let mut scene_world = World::new();\\n\\n let mut component_b = ComponentB::from_world(world);\\n\\n component_b.value = \\\"hello\\\".to_string();\\n\\n scene_world.spawn().insert_bundle((\\n\\n component_b,\\n\\n ComponentA { x: 1.0, y: 2.0 },\\n\\n Transform::identity(),\\n\\n ));\\n\\n scene_world\\n\\n .spawn()\\n\\n .insert_bundle((ComponentA { x: 3.0, y: 4.0 },));\\n\\n\\n\\n // The TypeRegistry resource contains information about all registered types (including\\n\\n // components). This is used to construct scenes.\\n\\n let type_registry = world.get_resource::<TypeRegistry>().unwrap();\\n\\n let scene = DynamicScene::from_world(&scene_world, &type_registry);\\n\\n\\n\\n // Scenes can be serialized like this:\\n\\n info!(\\\"{}\\\", scene.serialize_ron(&type_registry).unwrap());\\n\\n\\n\\n // TODO: save scene\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scene/scene.rs\",\n \"rank\": 49,\n \"score\": 259822.40363467723\n },\n {\n \"content\": \"pub trait AsVertexFormats {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat];\\n\\n}\\n\\n\\n\\nimpl AsVertexFormats for f32 {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat] {\\n\\n &[VertexFormat::Float32]\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsVertexFormats for Vec2 {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat] {\\n\\n &[VertexFormat::Float32x2]\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsVertexFormats for Vec3 {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat] {\\n\\n &[VertexFormat::Float32x3]\\n\\n }\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/pipeline/vertex_format.rs\",\n \"rank\": 50,\n \"score\": 256490.50421235076\n },\n {\n \"content\": \"fn change_window(world: &mut World) {\\n\\n let world = world.cell();\\n\\n let winit_windows = world.get_resource::<WinitWindows>().unwrap();\\n\\n let mut windows = world.get_resource_mut::<Windows>().unwrap();\\n\\n\\n\\n for bevy_window in windows.iter_mut() {\\n\\n let id = bevy_window.id();\\n\\n for command in bevy_window.drain_commands() {\\n\\n match command {\\n\\n bevy_window::WindowCommand::SetWindowMode {\\n\\n mode,\\n\\n resolution: (width, height),\\n\\n } => {\\n\\n let window = winit_windows.get_window(id).unwrap();\\n\\n match mode {\\n\\n bevy_window::WindowMode::BorderlessFullscreen => {\\n\\n window.set_fullscreen(Some(winit::window::Fullscreen::Borderless(None)))\\n\\n }\\n\\n bevy_window::WindowMode::Fullscreen { use_size } => window.set_fullscreen(\\n\\n Some(winit::window::Fullscreen::Exclusive(match use_size {\\n\",\n \"file_path\": \"crates/bevy_winit/src/lib.rs\",\n \"rank\": 51,\n \"score\": 256395.78146165493\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn thread_local_system(world: &mut World) {\\n\\n // this does the same thing as \\\"new_player_system\\\"\\n\\n let total_players = world.get_resource_mut::<GameState>().unwrap().total_players;\\n\\n let should_add_player = {\\n\\n let game_rules = world.get_resource::<GameRules>().unwrap();\\n\\n let add_new_player = random::<bool>();\\n\\n add_new_player && total_players < game_rules.max_players\\n\\n };\\n\\n // Randomly add a new player\\n\\n if should_add_player {\\n\\n world.spawn().insert_bundle((\\n\\n Player {\\n\\n name: format!(\\\"Player {}\\\", total_players),\\n\\n },\\n\\n Score { value: 0 },\\n\\n ));\\n\\n\\n\\n let mut game_state = world.get_resource_mut::<GameState>().unwrap();\\n\\n game_state.total_players += 1;\\n\\n }\\n\",\n \"file_path\": \"examples/ecs/ecs_guide.rs\",\n \"rank\": 52,\n \"score\": 256395.78146165493\n },\n {\n \"content\": \"fn contains_component_with_type(world: &World, type_id: TypeId, location: EntityLocation) -> bool {\\n\\n if let Some(component_id) = world.components.get_id(type_id) {\\n\\n contains_component_with_id(world, component_id, location)\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/bevy_ecs/src/world/entity_ref.rs\",\n \"rank\": 53,\n \"score\": 254366.72576701472\n },\n {\n \"content\": \"fn run_stage(stage: &mut SystemStage, world: &mut World) {\\n\\n stage.run(world);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/benches/bevy_ecs/stages.rs\",\n \"rank\": 54,\n \"score\": 253984.99048287084\n },\n {\n \"content\": \"pub fn prepare_core_views_system(\\n\\n mut commands: Commands,\\n\\n mut texture_cache: ResMut<TextureCache>,\\n\\n render_resources: Res<RenderResources>,\\n\\n views: Query<(Entity, &ExtractedView), With<RenderPhase<Transparent3dPhase>>>,\\n\\n) {\\n\\n for (entity, view) in views.iter() {\\n\\n let cached_texture = texture_cache.get(\\n\\n &render_resources,\\n\\n TextureDescriptor {\\n\\n size: Extent3d {\\n\\n depth_or_array_layers: 1,\\n\\n width: view.width as u32,\\n\\n height: view.height as u32,\\n\\n },\\n\\n mip_level_count: 1,\\n\\n sample_count: 1,\\n\\n dimension: TextureDimension::D2,\\n\\n format: TextureFormat::Depth32Float, /* PERF: vulkan docs recommend using 24\\n\\n * bit depth for better performance */\\n\\n usage: TextureUsage::RENDER_ATTACHMENT,\\n\\n },\\n\\n );\\n\\n commands.entity(entity).insert(ViewDepthTexture {\\n\\n texture: cached_texture.texture,\\n\\n view: cached_texture.default_view,\\n\\n });\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/core_pipeline/mod.rs\",\n \"rank\": 55,\n \"score\": 253682.75381663747\n },\n {\n \"content\": \"pub fn prepare_windows(\\n\\n mut windows: ResMut<ExtractedWindows>,\\n\\n render_resources: Res<RenderResources>,\\n\\n) {\\n\\n for window in windows.windows.values_mut() {\\n\\n let swap_chain_descriptor = SwapChainDescriptor {\\n\\n window_id: window.id,\\n\\n format: crate::texture::TextureFormat::Bgra8UnormSrgb,\\n\\n width: window.physical_width,\\n\\n height: window.physical_height,\\n\\n vsync: window.vsync,\\n\\n };\\n\\n\\n\\n let swap_chain_texture = render_resources.next_swap_chain_texture(&swap_chain_descriptor);\\n\\n window.swap_chain_texture = Some(swap_chain_texture);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/view/window.rs\",\n \"rank\": 56,\n \"score\": 253505.5013576888\n },\n {\n \"content\": \"// let the cake turn on itself\\n\\nfn rotate_bonus(game: Res<Game>, time: Res<Time>, mut transforms: Query<&mut Transform>) {\\n\\n if let Some(entity) = game.bonus.entity {\\n\\n if let Ok(mut cake_transform) = transforms.get_mut(entity) {\\n\\n cake_transform.rotate(Quat::from_rotation_y(time.delta_seconds()));\\n\\n cake_transform.scale = Vec3::splat(\\n\\n 1.0 + (game.score as f32 / 10.0 * time.seconds_since_startup().sin() as f32).abs(),\\n\\n );\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/game/alien_cake_addict.rs\",\n \"rank\": 57,\n \"score\": 250849.70958651172\n },\n {\n \"content\": \"// TODO: ideally we can remove this once bevy gets a physics system\\n\\n/// Axis-aligned bounding box collision with \\\"side\\\" detection\\n\\npub fn collide(a_pos: Vec3, a_size: Vec2, b_pos: Vec3, b_size: Vec2) -> Option<Collision> {\\n\\n let a_min = a_pos.truncate() - a_size / 2.0;\\n\\n let a_max = a_pos.truncate() + a_size / 2.0;\\n\\n\\n\\n let b_min = b_pos.truncate() - b_size / 2.0;\\n\\n let b_max = b_pos.truncate() + b_size / 2.0;\\n\\n\\n\\n // check to see if the two rectangles are intersecting\\n\\n if a_min.x < b_max.x && a_max.x > b_min.x && a_min.y < b_max.y && a_max.y > b_min.y {\\n\\n // check to see if we hit on the left or right side\\n\\n let (x_collision, x_depth) = if a_min.x < b_min.x && a_max.x > b_min.x && a_max.x < b_max.x\\n\\n {\\n\\n (Some(Collision::Left), b_min.x - a_max.x)\\n\\n } else if a_min.x > b_min.x && a_min.x < b_max.x && a_max.x > b_max.x {\\n\\n (Some(Collision::Right), a_min.x - b_max.x)\\n\\n } else {\\n\\n (None, 0.0)\\n\\n };\\n\\n\\n\\n // check to see if we hit on the top or bottom side\\n\",\n \"file_path\": \"crates/bevy_sprite/src/collide_aabb.rs\",\n \"rank\": 58,\n \"score\": 250844.71322981652\n },\n {\n \"content\": \"fn text_color_system(time: Res<Time>, mut query: Query<&mut Text, With<ColorText>>) {\\n\\n for mut text in query.iter_mut() {\\n\\n let seconds = time.seconds_since_startup() as f32;\\n\\n // We used the `Text::with_section` helper method, but it is still just a `Text`,\\n\\n // so to update it, we are still updating the one and only section\\n\\n text.sections[0].style.color = Color::Rgba {\\n\\n red: (1.25 * seconds).sin() / 2.0 + 0.5,\\n\\n green: (0.75 * seconds).sin() / 2.0 + 0.5,\\n\\n blue: (0.50 * seconds).sin() / 2.0 + 0.5,\\n\\n alpha: 1.0,\\n\\n };\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/ui/text.rs\",\n \"rank\": 59,\n \"score\": 250844.01955273774\n },\n {\n \"content\": \"/// Defines how min_size, size, and max_size affects the bounds of a text\\n\\n/// block.\\n\\npub fn text_constraint(min_size: Val, size: Val, max_size: Val, scale_factor: f64) -> f32 {\\n\\n // Needs support for percentages\\n\\n match (min_size, size, max_size) {\\n\\n (_, _, Val::Px(max)) => scale_value(max, scale_factor),\\n\\n (Val::Px(min), _, _) => scale_value(min, scale_factor),\\n\\n (Val::Undefined, Val::Px(size), Val::Undefined) => scale_value(size, scale_factor),\\n\\n (Val::Auto, Val::Px(size), Val::Auto) => scale_value(size, scale_factor),\\n\\n _ => f32::MAX,\\n\\n }\\n\\n}\\n\\n\\n\\n/// Computes the size of a text block and updates the TextGlyphs with the\\n\\n/// new computed glyphs from the layout\\n\",\n \"file_path\": \"crates/bevy_ui/src/widget/text.rs\",\n \"rank\": 60,\n \"score\": 250779.47720948322\n },\n {\n \"content\": \"pub fn build_ui_pipeline(shaders: &mut Assets<Shader>) -> PipelineDescriptor {\\n\\n PipelineDescriptor {\\n\\n depth_stencil: Some(DepthStencilState {\\n\\n format: TextureFormat::Depth32Float,\\n\\n depth_write_enabled: true,\\n\\n depth_compare: CompareFunction::Less,\\n\\n stencil: StencilState {\\n\\n front: StencilFaceState::IGNORE,\\n\\n back: StencilFaceState::IGNORE,\\n\\n read_mask: 0,\\n\\n write_mask: 0,\\n\\n },\\n\\n bias: DepthBiasState {\\n\\n constant: 0,\\n\\n slope_scale: 0.0,\\n\\n clamp: 0.0,\\n\\n },\\n\\n }),\\n\\n color_target_states: vec![ColorTargetState {\\n\\n format: TextureFormat::default(),\\n\",\n \"file_path\": \"crates/bevy_ui/src/render/mod.rs\",\n \"rank\": 61,\n \"score\": 247199.81039892483\n },\n {\n \"content\": \"pub fn build_sprite_pipeline(shaders: &mut Assets<Shader>) -> PipelineDescriptor {\\n\\n PipelineDescriptor {\\n\\n depth_stencil: Some(DepthStencilState {\\n\\n format: TextureFormat::Depth32Float,\\n\\n depth_write_enabled: true,\\n\\n depth_compare: CompareFunction::LessEqual,\\n\\n stencil: StencilState {\\n\\n front: StencilFaceState::IGNORE,\\n\\n back: StencilFaceState::IGNORE,\\n\\n read_mask: 0,\\n\\n write_mask: 0,\\n\\n },\\n\\n bias: DepthBiasState {\\n\\n constant: 0,\\n\\n slope_scale: 0.0,\\n\\n clamp: 0.0,\\n\\n },\\n\\n }),\\n\\n color_target_states: vec![ColorTargetState {\\n\\n format: TextureFormat::default(),\\n\",\n \"file_path\": \"crates/bevy_sprite/src/render/mod.rs\",\n \"rank\": 62,\n \"score\": 247199.81039892483\n },\n {\n \"content\": \"fn sorted_remove<T: Eq + Ord + Copy>(source: &mut Vec<T>, remove: &[T]) {\\n\\n let mut remove_index = 0;\\n\\n source.retain(|value| {\\n\\n while remove_index < remove.len() && *value > remove[remove_index] {\\n\\n remove_index += 1;\\n\\n }\\n\\n\\n\\n if remove_index < remove.len() {\\n\\n *value != remove[remove_index]\\n\\n } else {\\n\\n true\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n #[test]\\n\\n fn sorted_remove() {\\n\\n let mut a = vec![1, 2, 3, 4, 5, 6, 7];\\n\",\n \"file_path\": \"crates/bevy_ecs/src/world/entity_ref.rs\",\n \"rank\": 63,\n \"score\": 246634.71459244235\n },\n {\n \"content\": \"pub fn build_sprite_sheet_pipeline(shaders: &mut Assets<Shader>) -> PipelineDescriptor {\\n\\n PipelineDescriptor {\\n\\n depth_stencil: Some(DepthStencilState {\\n\\n format: TextureFormat::Depth32Float,\\n\\n depth_write_enabled: true,\\n\\n depth_compare: CompareFunction::LessEqual,\\n\\n stencil: StencilState {\\n\\n front: StencilFaceState::IGNORE,\\n\\n back: StencilFaceState::IGNORE,\\n\\n read_mask: 0,\\n\\n write_mask: 0,\\n\\n },\\n\\n bias: DepthBiasState {\\n\\n constant: 0,\\n\\n slope_scale: 0.0,\\n\\n clamp: 0.0,\\n\\n },\\n\\n }),\\n\\n color_target_states: vec![ColorTargetState {\\n\\n format: TextureFormat::default(),\\n\",\n \"file_path\": \"crates/bevy_sprite/src/render/mod.rs\",\n \"rank\": 64,\n \"score\": 243846.93218358018\n },\n {\n \"content\": \"pub trait AsVertexFormats {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat];\\n\\n}\\n\\n\\n\\nimpl AsVertexFormats for f32 {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat] {\\n\\n &[VertexFormat::Float32]\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsVertexFormats for Vec2 {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat] {\\n\\n &[VertexFormat::Float32x2]\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsVertexFormats for Vec3 {\\n\\n fn as_vertex_formats() -> &'static [VertexFormat] {\\n\\n &[VertexFormat::Float32x3]\\n\\n }\\n\",\n \"file_path\": \"crates/bevy_render/src/pipeline/vertex_format.rs\",\n \"rank\": 65,\n \"score\": 242946.55888804587\n },\n {\n \"content\": \"fn change_component(time: Res<Time>, mut query: Query<(Entity, &mut MyComponent)>) {\\n\\n for (entity, mut component) in query.iter_mut() {\\n\\n if rand::thread_rng().gen_bool(0.1) {\\n\\n info!(\\\"changing component {:?}\\\", entity);\\n\\n component.0 = time.seconds_since_startup();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/change_detection.rs\",\n \"rank\": 66,\n \"score\": 242061.83863347338\n },\n {\n \"content\": \"/// A [`World`] mutation.\\n\\npub trait Command: Send + Sync + 'static {\\n\\n fn write(self: Box<Self>, world: &mut World);\\n\\n}\\n\\n\\n\\n/// A queue of [`Command`]s.\\n\\n#[derive(Default)]\\n\\npub struct CommandQueue {\\n\\n commands: Vec<Box<dyn Command>>,\\n\\n}\\n\\n\\n\\nimpl CommandQueue {\\n\\n /// Execute the queued [`Command`]s in the world.\\n\\n /// This clears the queue.\\n\\n pub fn apply(&mut self, world: &mut World) {\\n\\n world.flush();\\n\\n for command in self.commands.drain(..) {\\n\\n command.write(world);\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"crates/bevy_ecs/src/system/commands.rs\",\n \"rank\": 67,\n \"score\": 240609.46301251167\n },\n {\n \"content\": \"pub fn create_render_pass<'a, 'b>(\\n\\n pass_descriptor: &PassDescriptor,\\n\\n refs: &WgpuResourceRefs<'a>,\\n\\n encoder: &'a mut wgpu::CommandEncoder,\\n\\n) -> wgpu::RenderPass<'a> {\\n\\n encoder.begin_render_pass(&wgpu::RenderPassDescriptor {\\n\\n label: None,\\n\\n color_attachments: &pass_descriptor\\n\\n .color_attachments\\n\\n .iter()\\n\\n .map(|c| create_wgpu_color_attachment(refs, c))\\n\\n .collect::<Vec<wgpu::RenderPassColorAttachment>>(),\\n\\n depth_stencil_attachment: pass_descriptor\\n\\n .depth_stencil_attachment\\n\\n .as_ref()\\n\\n .map(|d| create_wgpu_depth_stencil_attachment(refs, d)),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_wgpu2/src/render_context.rs\",\n \"rank\": 68,\n \"score\": 239108.88416252052\n },\n {\n \"content\": \"fn text_update_system(mut state: ResMut<State>, time: Res<Time>, mut query: Query<&mut Text>) {\\n\\n if state.timer.tick(time.delta()).finished() {\\n\\n for mut text in query.iter_mut() {\\n\\n let c = rand::random::<u8>() as char;\\n\\n if !text.sections[0].value.contains(c) {\\n\\n text.sections[0].value.push(c);\\n\\n }\\n\\n }\\n\\n\\n\\n state.timer.reset();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ui/font_atlas_debug.rs\",\n \"rank\": 69,\n \"score\": 236939.16564012325\n },\n {\n \"content\": \"fn setup(mut commands: Commands, asset_server: Res<AssetServer>, mut state: ResMut<State>) {\\n\\n let font_handle = asset_server.load(\\\"fonts/FiraSans-Bold.ttf\\\");\\n\\n state.handle = font_handle.clone();\\n\\n commands.spawn_bundle(UiCameraBundle::default());\\n\\n commands.spawn_bundle(TextBundle {\\n\\n text: Text::with_section(\\n\\n \\\"a\\\",\\n\\n TextStyle {\\n\\n font: font_handle,\\n\\n font_size: 60.0,\\n\\n color: Color::YELLOW,\\n\\n },\\n\\n Default::default(),\\n\\n ),\\n\\n ..Default::default()\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"examples/ui/font_atlas_debug.rs\",\n \"rank\": 70,\n \"score\": 234983.0248594849\n },\n {\n \"content\": \"fn log_names(query: Query<&Name>) {\\n\\n info!(\\\"Log all entities with `Name` component\\\");\\n\\n // this will necessarily have to print both components.\\n\\n for name in query.iter() {\\n\\n info!(\\\"{:?}\\\", name);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/ecs/query_bundle.rs\",\n \"rank\": 71,\n \"score\": 234778.36265611346\n },\n {\n \"content\": \"pub fn scale_value(value: f32, factor: f64) -> f32 {\\n\\n (value as f64 * factor) as f32\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_text/src/text2d.rs\",\n \"rank\": 72,\n \"score\": 230499.3618815499\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Name(String);\\n\\n\\n\",\n \"file_path\": \"examples/ecs/query_bundle.rs\",\n \"rank\": 73,\n \"score\": 228179.794863642\n },\n {\n \"content\": \"fn next_token<'a>(path: &'a str, index: &mut usize) -> Option<Token<'a>> {\\n\\n if *index >= path.len() {\\n\\n return None;\\n\\n }\\n\\n\\n\\n match path[*index..].chars().next().unwrap() {\\n\\n '.' => {\\n\\n *index += 1;\\n\\n return Some(Token::Dot);\\n\\n }\\n\\n '[' => {\\n\\n *index += 1;\\n\\n return Some(Token::OpenBracket);\\n\\n }\\n\\n ']' => {\\n\\n *index += 1;\\n\\n return Some(Token::CloseBracket);\\n\\n }\\n\\n _ => {}\\n\\n }\\n\",\n \"file_path\": \"crates/bevy_reflect/src/path.rs\",\n \"rank\": 74,\n \"score\": 228044.61420560977\n },\n {\n \"content\": \"fn infotext_system(mut commands: Commands, asset_server: Res<AssetServer>) {\\n\\n let font = asset_server.load(\\\"fonts/FiraSans-Bold.ttf\\\");\\n\\n commands.spawn_bundle(UiCameraBundle::default());\\n\\n commands.spawn_bundle(TextBundle {\\n\\n style: Style {\\n\\n align_self: AlignSelf::FlexEnd,\\n\\n position_type: PositionType::Absolute,\\n\\n position: Rect {\\n\\n top: Val::Px(5.0),\\n\\n left: Val::Px(15.0),\\n\\n ..Default::default()\\n\\n },\\n\\n ..Default::default()\\n\\n },\\n\\n text: Text::with_section(\\n\\n \\\"This is\\\\ntext with\\\\nline breaks\\\\nin the top left\\\",\\n\\n TextStyle {\\n\\n font: font.clone(),\\n\\n font_size: 50.0,\\n\\n color: Color::WHITE,\\n\",\n \"file_path\": \"examples/ui/text_debug.rs\",\n \"rank\": 75,\n \"score\": 227974.45222889274\n },\n {\n \"content\": \"fn check_tick(last_change_tick: &mut u32, change_tick: u32) {\\n\\n let tick_delta = change_tick.wrapping_sub(*last_change_tick);\\n\\n const MAX_DELTA: u32 = (u32::MAX / 4) * 3;\\n\\n // Clamp to max delta\\n\\n if tick_delta > MAX_DELTA {\\n\\n *last_change_tick = change_tick.wrapping_sub(MAX_DELTA);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/bevy_ecs/src/component/mod.rs\",\n \"rank\": 76,\n \"score\": 227972.52286204055\n },\n {\n \"content\": \"fn spawn_enemy(mut commands: Commands, keyboard_input: Res<Input<KeyCode>>) {\\n\\n if keyboard_input.just_pressed(KeyCode::Space) {\\n\\n commands.spawn().insert(Enemy { hit_points: 5 });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/how_to_test_systems.rs\",\n \"rank\": 77,\n \"score\": 225212.39136214132\n },\n {\n \"content\": \"/// Create an instance of the platform default `AssetIo`\\n\\n///\\n\\n/// This is useful when providing a custom `AssetIo` instance that needs to\\n\\n/// delegate to the default `AssetIo` for the platform.\\n\\npub fn create_platform_default_asset_io(app: &mut App) -> Box<dyn AssetIo> {\\n\\n let settings = app\\n\\n .world\\n\\n .get_resource_or_insert_with(AssetServerSettings::default);\\n\\n\\n\\n #[cfg(all(not(target_arch = \\\"wasm32\\\"), not(target_os = \\\"android\\\")))]\\n\\n let source = FileAssetIo::new(&settings.asset_folder);\\n\\n #[cfg(target_arch = \\\"wasm32\\\")]\\n\\n let source = WasmAssetIo::new(&settings.asset_folder);\\n\\n #[cfg(target_os = \\\"android\\\")]\\n\\n let source = AndroidAssetIo::new(&settings.asset_folder);\\n\\n\\n\\n Box::new(source)\\n\\n}\\n\\n\\n\\nimpl Plugin for AssetPlugin {\\n\\n fn build(&self, app: &mut App) {\\n\\n if app.world.get_resource::<AssetServer>().is_none() {\\n\\n let task_pool = app\\n\\n .world\\n\",\n \"file_path\": \"crates/bevy_asset/src/lib.rs\",\n \"rank\": 78,\n \"score\": 223091.0627794713\n },\n {\n \"content\": \"/// Update [`GlobalTransform`] component of entities based on entity hierarchy and\\n\\n/// [`Transform`] component.\\n\\npub fn transform_propagate_system(\\n\\n mut root_query: Query<\\n\\n (Entity, Option<&Children>, &Transform, &mut GlobalTransform),\\n\\n Without<Parent>,\\n\\n >,\\n\\n mut transform_query: Query<(&Transform, &mut GlobalTransform), With<Parent>>,\\n\\n changed_transform_query: Query<Entity, Changed<Transform>>,\\n\\n children_query: Query<Option<&Children>, (With<Parent>, With<GlobalTransform>)>,\\n\\n) {\\n\\n for (entity, children, transform, mut global_transform) in root_query.iter_mut() {\\n\\n let mut changed = false;\\n\\n if changed_transform_query.get(entity).is_ok() {\\n\\n *global_transform = GlobalTransform::from(*transform);\\n\\n changed = true;\\n\\n }\\n\\n\\n\\n if let Some(children) = children {\\n\\n for child in children.0.iter() {\\n\\n propagate_recursive(\\n\\n &global_transform,\\n\",\n \"file_path\": \"crates/bevy_transform/src/transform_propagate_system.rs\",\n \"rank\": 79,\n \"score\": 222624.2960737845\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn camera_system<T: CameraProjection + Component>(\\n\\n mut window_resized_events: EventReader<WindowResized>,\\n\\n mut window_created_events: EventReader<WindowCreated>,\\n\\n windows: Res<Windows>,\\n\\n mut queries: QuerySet<(\\n\\n Query<(Entity, &mut Camera, &mut T)>,\\n\\n Query<Entity, Added<Camera>>,\\n\\n )>,\\n\\n) {\\n\\n let mut changed_window_ids = Vec::new();\\n\\n // handle resize events. latest events are handled first because we only want to resize each\\n\\n // window once\\n\\n for event in window_resized_events.iter().rev() {\\n\\n if changed_window_ids.contains(&event.id) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n changed_window_ids.push(event.id);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/camera/camera.rs\",\n \"rank\": 80,\n \"score\": 222318.4677471735\n },\n {\n \"content\": \"fn bytes_to_words(bytes: &[u8]) -> Vec<u32> {\\n\\n let mut words = Vec::new();\\n\\n for bytes4 in bytes.chunks(4) {\\n\\n words.push(u32::from_le_bytes([\\n\\n bytes4[0], bytes4[1], bytes4[2], bytes4[3],\\n\\n ]));\\n\\n }\\n\\n\\n\\n words\\n\\n}\\n\\n\\n\\n/// The full \\\"source\\\" of a shader\\n\\n#[derive(Clone, Debug, Hash, Eq, PartialEq)]\\n\\npub enum ShaderSource {\\n\\n Spirv(Vec<u32>),\\n\\n Glsl(String),\\n\\n}\\n\\n\\n\\nimpl ShaderSource {\\n\\n pub fn spirv_from_bytes(bytes: &[u8]) -> ShaderSource {\\n\",\n \"file_path\": \"crates/bevy_render/src/shader/shader.rs\",\n \"rank\": 81,\n \"score\": 219677.93066663976\n },\n {\n \"content\": \"// This system updates the score for each entity with the \\\"Player\\\" and \\\"Score\\\" component.\\n\\nfn score_system(mut query: Query<(&Player, &mut Score)>) {\\n\\n for (player, mut score) in query.iter_mut() {\\n\\n let scored_a_point = random::<bool>();\\n\\n if scored_a_point {\\n\\n score.value += 1;\\n\\n println!(\\n\\n \\\"{} scored a point! Their score is: {}\\\",\\n\\n player.name, score.value\\n\\n );\\n\\n } else {\\n\\n println!(\\n\\n \\\"{} did not score a point! Their score is: {}\\\",\\n\\n player.name, score.value\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n // this game isn't very fun is it :)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/ecs_guide.rs\",\n \"rank\": 82,\n \"score\": 218770.89866547362\n },\n {\n \"content\": \"pub fn draw_render_pipelines_system(\\n\\n mut draw_context: DrawContext,\\n\\n mut render_resource_bindings: ResMut<RenderResourceBindings>,\\n\\n msaa: Res<Msaa>,\\n\\n meshes: Res<Assets<Mesh>>,\\n\\n mut query: Query<\\n\\n (&mut Draw, &mut RenderPipelines, &Handle<Mesh>, &Visible),\\n\\n Without<OutsideFrustum>,\\n\\n >,\\n\\n) {\\n\\n for (mut draw, mut render_pipelines, mesh_handle, visible) in query.iter_mut() {\\n\\n if !visible.is_visible {\\n\\n continue;\\n\\n }\\n\\n\\n\\n // don't render if the mesh isn't loaded yet\\n\\n let mesh = if let Some(mesh) = meshes.get(mesh_handle) {\\n\\n mesh\\n\\n } else {\\n\\n continue;\\n\",\n \"file_path\": \"crates/bevy_render/src/pipeline/render_pipelines.rs\",\n \"rank\": 83,\n \"score\": 218292.01103070512\n },\n {\n \"content\": \"fn setup(mut commands: Commands) {\\n\\n commands.spawn().insert(MyComponent(0.));\\n\\n commands.spawn().insert(Transform::identity());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/change_detection.rs\",\n \"rank\": 84,\n \"score\": 217498.69128027637\n },\n {\n \"content\": \"fn setup_system(mut commands: Commands) {\\n\\n // Add an entity to the world with a timer\\n\\n commands.spawn().insert(Timer::from_seconds(5.0, false));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/timers.rs\",\n \"rank\": 85,\n \"score\": 217498.69128027637\n },\n {\n \"content\": \"/// This system generates tasks simulating computationally intensive\\n\\n/// work that potentially spans multiple frames/ticks. A separate\\n\\n/// system, handle_tasks, will poll the spawned tasks on subsequent\\n\\n/// frames/ticks, and use the results to spawn cubes\\n\\nfn spawn_tasks(mut commands: Commands, thread_pool: Res<AsyncComputeTaskPool>) {\\n\\n for x in 0..NUM_CUBES {\\n\\n for y in 0..NUM_CUBES {\\n\\n for z in 0..NUM_CUBES {\\n\\n // Spawn new task on the AsyncComputeTaskPool\\n\\n let task = thread_pool.spawn(async move {\\n\\n let mut rng = rand::thread_rng();\\n\\n let start_time = Instant::now();\\n\\n let duration = Duration::from_secs_f32(rng.gen_range(0.05..0.2));\\n\\n while Instant::now() - start_time < duration {\\n\\n // Spinning for 'duration', simulating doing hard\\n\\n // compute work generating translation coords!\\n\\n }\\n\\n\\n\\n // Such hard work, all done!\\n\\n Transform::from_translation(Vec3::new(x as f32, y as f32, z as f32))\\n\\n });\\n\\n\\n\\n // Spawn new entity and add our new task as a component\\n\\n commands.spawn().insert(task);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/async_tasks/async_compute.rs\",\n \"rank\": 86,\n \"score\": 217427.29948016733\n },\n {\n \"content\": \"pub fn winit_runner_with(mut app: App, mut event_loop: EventLoop<()>) {\\n\\n let mut create_window_event_reader = ManualEventReader::<CreateWindow>::default();\\n\\n let mut app_exit_event_reader = ManualEventReader::<AppExit>::default();\\n\\n app.world.insert_non_send(event_loop.create_proxy());\\n\\n\\n\\n trace!(\\\"Entering winit event loop\\\");\\n\\n\\n\\n let should_return_from_run = app\\n\\n .world\\n\\n .get_resource::<WinitConfig>()\\n\\n .map_or(false, |config| config.return_from_run);\\n\\n\\n\\n let event_handler = move |event: Event<()>,\\n\\n event_loop: &EventLoopWindowTarget<()>,\\n\\n control_flow: &mut ControlFlow| {\\n\\n *control_flow = ControlFlow::Poll;\\n\\n\\n\\n if let Some(app_exit_events) = app.world.get_resource_mut::<Events<AppExit>>() {\\n\\n if app_exit_event_reader\\n\\n .iter(&app_exit_events)\\n\",\n \"file_path\": \"crates/bevy_winit/src/lib.rs\",\n \"rank\": 87,\n \"score\": 217095.8480217863\n },\n {\n \"content\": \"pub fn visible_entities_system(\\n\\n mut camera_query: Query<(\\n\\n &Camera,\\n\\n &GlobalTransform,\\n\\n &mut VisibleEntities,\\n\\n Option<&RenderLayers>,\\n\\n )>,\\n\\n visible_query: Query<(Entity, &Visible, Option<&RenderLayers>), Without<OutsideFrustum>>,\\n\\n visible_transform_query: Query<&GlobalTransform, Without<OutsideFrustum>>,\\n\\n) {\\n\\n for (camera, camera_global_transform, mut visible_entities, maybe_camera_mask) in\\n\\n camera_query.iter_mut()\\n\\n {\\n\\n visible_entities.value.clear();\\n\\n let camera_position = camera_global_transform.translation;\\n\\n let camera_mask = maybe_camera_mask.copied().unwrap_or_default();\\n\\n\\n\\n let mut no_transform_order = 0.0;\\n\\n let mut transparent_entities = Vec::new();\\n\\n for (entity, visible, maybe_entity_mask) in visible_query.iter() {\\n\",\n \"file_path\": \"crates/bevy_render/src/camera/visible_entities.rs\",\n \"rank\": 88,\n \"score\": 215658.63456586137\n },\n {\n \"content\": \"fn face_normal(a: [f32; 3], b: [f32; 3], c: [f32; 3]) -> [f32; 3] {\\n\\n let (a, b, c) = (Vec3::from(a), Vec3::from(b), Vec3::from(c));\\n\\n (b - a).cross(c - a).normalize().into()\\n\\n}\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/mesh/mesh.rs\",\n \"rank\": 89,\n \"score\": 215606.8850554935\n },\n {\n \"content\": \"pub fn extract_core_pipeline_camera_phases(\\n\\n mut commands: Commands,\\n\\n active_cameras: Res<ActiveCameras>,\\n\\n) {\\n\\n if let Some(camera_2d) = active_cameras.get(CameraPlugin::CAMERA_2D) {\\n\\n if let Some(entity) = camera_2d.entity {\\n\\n commands\\n\\n .get_or_spawn(entity)\\n\\n .insert(RenderPhase::<Transparent2dPhase>::default());\\n\\n }\\n\\n }\\n\\n if let Some(camera_3d) = active_cameras.get(CameraPlugin::CAMERA_3D) {\\n\\n if let Some(entity) = camera_3d.entity {\\n\\n commands\\n\\n .get_or_spawn(entity)\\n\\n .insert(RenderPhase::<Transparent3dPhase>::default());\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_render2/src/core_pipeline/mod.rs\",\n \"rank\": 90,\n \"score\": 215469.21585644947\n },\n {\n \"content\": \"fn setup_cameras(mut commands: Commands, mut game: ResMut<Game>) {\\n\\n game.camera_should_focus = Vec3::from(RESET_FOCUS);\\n\\n game.camera_is_focus = game.camera_should_focus;\\n\\n commands.spawn_bundle(PerspectiveCameraBundle {\\n\\n transform: Transform::from_xyz(\\n\\n -(BOARD_SIZE_I as f32 / 2.0),\\n\\n 2.0 * BOARD_SIZE_J as f32 / 3.0,\\n\\n BOARD_SIZE_J as f32 / 2.0 - 0.5,\\n\\n )\\n\\n .looking_at(game.camera_is_focus, Vec3::Y),\\n\\n ..Default::default()\\n\\n });\\n\\n commands.spawn_bundle(UiCameraBundle::default());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/game/alien_cake_addict.rs\",\n \"rank\": 91,\n \"score\": 215384.94156255404\n },\n {\n \"content\": \"#[proc_macro]\\n\\npub fn impl_query_set(_input: TokenStream) -> TokenStream {\\n\\n let mut tokens = TokenStream::new();\\n\\n let max_queries = 4;\\n\\n let queries = get_idents(|i| format!(\\\"Q{}\\\", i), max_queries);\\n\\n let filters = get_idents(|i| format!(\\\"F{}\\\", i), max_queries);\\n\\n let lifetimes = get_lifetimes(|i| format!(\\\"'q{}\\\", i), max_queries);\\n\\n let mut query_fns = Vec::new();\\n\\n let mut query_fn_muts = Vec::new();\\n\\n for i in 0..max_queries {\\n\\n let query = &queries[i];\\n\\n let filter = &filters[i];\\n\\n let lifetime = &lifetimes[i];\\n\\n let fn_name = Ident::new(&format!(\\\"q{}\\\", i), Span::call_site());\\n\\n let fn_name_mut = Ident::new(&format!(\\\"q{}_mut\\\", i), Span::call_site());\\n\\n let index = Index::from(i);\\n\\n query_fns.push(quote! {\\n\\n pub fn #fn_name(&self) -> &Query<#lifetime, #query, #filter> {\\n\\n &self.0.#index\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"crates/bevy_ecs/macros/src/lib.rs\",\n \"rank\": 92,\n \"score\": 215369.7884388137\n },\n {\n \"content\": \"fn get_texture_view<'a>(\\n\\n refs: &WgpuResourceRefs<'a>,\\n\\n attachment: &TextureAttachment,\\n\\n) -> &'a wgpu::TextureView {\\n\\n match attachment {\\n\\n TextureAttachment::Id(render_resource) => refs.texture_views.get(&render_resource).unwrap_or_else(|| &refs.swap_chain_frames.get(&render_resource).unwrap().output.view),\\n\\n TextureAttachment::Input(_) => panic!(\\\"Encountered unset `TextureAttachment::Input`. The `RenderGraph` executor should always set `TextureAttachment::Inputs` to `TextureAttachment::RenderResource` before running. This is a bug, please report it!\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pipelined/bevy_wgpu2/src/render_context.rs\",\n \"rank\": 93,\n \"score\": 215208.3611282318\n },\n {\n \"content\": \"fn contains_component_with_id(\\n\\n world: &World,\\n\\n component_id: ComponentId,\\n\\n location: EntityLocation,\\n\\n) -> bool {\\n\\n world.archetypes[location.archetype_id].contains(component_id)\\n\\n}\\n\\n\\n\\n/// Adds a bundle to the given archetype and returns the resulting archetype. This could be the same\\n\\n/// [ArchetypeId], in the event that adding the given bundle does not result in an Archetype change.\\n\\n/// Results are cached in the Archetype Graph to avoid redundant work.\\n\\n///\\n\\n/// # Safety\\n\\n/// components in `bundle_info` must exist\\n\\npub(crate) unsafe fn add_bundle_to_archetype(\\n\\n archetypes: &mut Archetypes,\\n\\n storages: &mut Storages,\\n\\n components: &mut Components,\\n\\n archetype_id: ArchetypeId,\\n\\n bundle_info: &BundleInfo,\\n\",\n \"file_path\": \"crates/bevy_ecs/src/world/entity_ref.rs\",\n \"rank\": 94,\n \"score\": 214224.09457334518\n },\n {\n \"content\": \"fn hurt_enemies(mut enemies: Query<&mut Enemy>) {\\n\\n for mut enemy in enemies.iter_mut() {\\n\\n enemy.hit_points -= 1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/how_to_test_systems.rs\",\n \"rank\": 95,\n \"score\": 214118.30463122556\n },\n {\n \"content\": \"// This is a \\\"startup\\\" system that runs exactly once when the app starts up. Startup systems are\\n\\n// generally used to create the initial \\\"state\\\" of our game. The only thing that distinguishes a\\n\\n// \\\"startup\\\" system from a \\\"normal\\\" system is how it is registered: Startup:\\n\\n// app.add_startup_system(startup_system) Normal: app.add_system(normal_system)\\n\\nfn startup_system(mut commands: Commands, mut game_state: ResMut<GameState>) {\\n\\n // Create our game rules resource\\n\\n commands.insert_resource(GameRules {\\n\\n max_rounds: 10,\\n\\n winning_score: 4,\\n\\n max_players: 4,\\n\\n });\\n\\n\\n\\n // Add some players to our world. Players start with a score of 0 ... we want our game to be\\n\\n // fair!\\n\\n commands.spawn_batch(vec![\\n\\n (\\n\\n Player {\\n\\n name: \\\"Alice\\\".to_string(),\\n\\n },\\n\\n Score { value: 0 },\\n\\n ),\\n\\n (\\n\\n Player {\\n\\n name: \\\"Bob\\\".to_string(),\\n\\n },\\n\\n Score { value: 0 },\\n\\n ),\\n\\n ]);\\n\\n\\n\\n // set the total players to \\\"2\\\"\\n\\n game_state.total_players = 2;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/ecs_guide.rs\",\n \"rank\": 96,\n \"score\": 212929.96922247816\n },\n {\n \"content\": \"pub fn lights_node_system(\\n\\n mut state: Local<LightsNodeSystemState>,\\n\\n render_resource_context: Res<Box<dyn RenderResourceContext>>,\\n\\n ambient_light_resource: Res<AmbientLight>,\\n\\n // TODO: this write on RenderResourceBindings will prevent this system from running in parallel\\n\\n // with other systems that do the same\\n\\n mut render_resource_bindings: ResMut<RenderResourceBindings>,\\n\\n point_lights: Query<(&PointLight, &GlobalTransform)>,\\n\\n dir_lights: Query<&DirectionalLight>,\\n\\n) {\\n\\n let state = &mut state;\\n\\n let render_resource_context = &**render_resource_context;\\n\\n\\n\\n // premultiply ambient brightness\\n\\n let ambient_light: [f32; 4] =\\n\\n (ambient_light_resource.color * ambient_light_resource.brightness).into();\\n\\n let ambient_light_size = std::mem::size_of::<[f32; 4]>();\\n\\n\\n\\n let point_light_count = point_lights.iter().len().min(state.max_point_lights);\\n\\n let point_light_size = std::mem::size_of::<PointLightUniform>();\\n\",\n \"file_path\": \"crates/bevy_pbr/src/render_graph/lights_node.rs\",\n \"rank\": 97,\n \"score\": 212655.81836277278\n },\n {\n \"content\": \"/// This system ticks all the `Timer` components on entities within the scene\\n\\n/// using bevy's `Time` resource to get the delta between each update.\\n\\nfn timer_system(time: Res<Time>, mut query: Query<&mut Timer>) {\\n\\n for mut timer in query.iter_mut() {\\n\\n if timer.tick(time.delta()).just_finished() {\\n\\n info!(\\\"Entity timer just finished\\\")\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ecs/timers.rs\",\n \"rank\": 98,\n \"score\": 210598.14484495987\n },\n {\n \"content\": \"fn scoreboard_system(scoreboard: Res<Scoreboard>, mut query: Query<&mut Text>) {\\n\\n let mut text = query.single_mut().unwrap();\\n\\n text.sections[0].value = format!(\\\"Score: {}\\\", scoreboard.score);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/game/breakout.rs\",\n \"rank\": 99,\n \"score\": 210587.92912744623\n }\n]","isConversational":false}}},{"rowIdx":3687,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/actors.rs"},"repo_name":{"kind":"string","value":"thomaslienbacher/Moving-Tower"},"commit":{"kind":"string","value":"adfaf169a8dc85993dd90507db9b8d702ba71f4f"},"file_code":{"kind":"string","value":"use sfml::graphics::*;\nuse sfml::system::Vector2f;\nuse sfml::window::*;\nuse sfml::window::mouse::Button;\n\nuse crate::AssetManager;\n\nuse super::{WIN_HEIGHT, WIN_WIDTH};\n\npub trait Actor {\n fn update(&mut self, d: f32);\n\n fn draw(&self, win: &mut RenderWindow);\n\n fn events(&mut self, evt: Event);\n}\n\nstruct Circle {\n x: f32,\n y: f32,\n radius: f32,\n}\n\nimpl Circle {\n fn new(x: f32, y: f32, radius: f32) -> Circle {\n Circle { x, y, radius }\n }\n\n fn is_colliding(&self, other: &Self) -> bool {\n let dis = {\n let x = self.x - other.x;\n let y = self.y - other.y;\n\n f32::sqrt(x * x + y * y)\n };\n\n dis < (self.radius + other.radius)\n }\n}\n\nconst TOWER_INNER: f32 = 100.0;\nconst TOWER_OUTER: f32 = 250.0;\n\npub struct Tower<'a> {\n sprite: Sprite<'a>,\n teleport_circle: CircleShape<'a>,\n hitbox: Circle,\n position: Vector2f,\n rotation: f32,\n bullet_sprite: Sprite<'a>,\n bullets: Vec<Bullet<'a>>,\n pub dead: bool,\n}\n\nimpl<'a> Tower<'a> {\n pub fn new(am: &'a AssetManager) -> Tower<'a> {\n let position = Vector2f::new(WIN_WIDTH / 2.0, WIN_HEIGHT / 2.0);\n\n let sprite = {\n let mut s = Sprite::new();\n let t = am.get_texture(\"tower.png\");\n s.set_texture(t, true);\n s.set_position(position);\n s.set_origin(Vector2f { x: t.size().x as f32 / 2.0, y: t.size().y as f32 / 2.0 });\n\n s\n };\n\n let teleport_circle = {\n let mut c = CircleShape::new(TOWER_INNER, 36);\n c.set_position(position);\n c.set_outline_thickness(TOWER_OUTER - TOWER_INNER);\n c.set_origin(Vector2f::new(TOWER_INNER, TOWER_INNER));\n c.set_fill_color(&Color::TRANSPARENT);\n c.set_outline_color(&Color::rgba(255, 255, 255, 50));\n\n c\n };\n\n let bullet_sprite = {\n let mut s = Sprite::new();\n let t = am.get_texture(\"bullet.png\");\n s.set_texture(t, true);\n s.set_position(position);\n s.set_origin(Vector2f { x: t.size().x as f32 / 2.0, y: t.size().y as f32 / 2.0 });\n\n s\n };\n\n let hitbox = {\n Circle::new(position.x, position.y, sprite.texture_rect().width as f32 / 2.0)\n };\n\n Tower {\n sprite,\n teleport_circle,\n hitbox,\n position,\n rotation: 0.0,\n bullet_sprite,\n bullets: Vec::new(),\n dead: false,\n }\n }\n\n pub fn num_bullets(&self) -> usize {\n self.bullets.len()\n }\n}\n\nimpl<'a> Actor for Tower<'a> {\n fn update(&mut self, d: f32) {\n self.sprite.set_rotation(self.rotation);\n self.sprite.set_position(self.position);\n self.teleport_circle.set_position(self.position);\n self.hitbox.x = self.position.x;\n self.hitbox.y = self.position.y;\n\n for b in &mut self.bullets {\n b.update(d);\n\n if b.hitbox.is_colliding(&self.hitbox) {\n self.dead = true;\n }\n }\n }\n\n fn draw(&self, win: &mut RenderWindow) {\n for b in &self.bullets {\n b.draw(win);\n }\n\n win.draw(&self.sprite);\n win.draw(&self.teleport_circle);\n }\n\n fn events(&mut self, evt: Event) {\n match evt {\n Event::MouseButtonPressed { button: Button::Left, x, y } => {\n self.position += {\n let mut m = Vector2f::new(x as f32 - self.position.x, y as f32 - self.position.y);\n let mut l = f32::sqrt(m.x.powi(2) + m.y.powi(2));\n\n if l != 0.0 {\n m.x /= l;\n m.y /= l;\n l = f32::min(TOWER_OUTER, f32::max(l, TOWER_INNER));\n m.x *= l;\n m.y *= l;\n\n self.bullets.push(Bullet::new(self.bullet_sprite.clone(), self.position, self.rotation));\n }\n\n m\n }\n }\n Event::MouseMoved { x, y } => {\n self.rotation = (y as f32 - self.position.y).atan2(x as f32 - self.position.x).to_degrees();\n }\n\n _ => {}\n }\n }\n}\n\nconst BULLET_SPEED: f32 = 85.0;\n\npub struct Bullet<'a> {\n sprite: Sprite<'a>,\n hitbox: Circle,\n position: Vector2f,\n rotation: f32,\n}\n\nimpl<'a> Bullet<'a> {\n pub fn new(spr: Sprite<'a>, pos: Vector2f, rot: f32) -> Bullet<'a> {\n let hitbox = {\n Circle::new(pos.x, pos.y, spr.texture_rect().width as f32 / 2.0)\n };\n\n let mut b = Bullet {\n sprite: spr,\n hitbox,\n position: pos,\n rotation: rot,\n };\n\n b.update(1.0 / 100.0);\n\n b\n }\n}\n\nimpl<'a> Actor for Bullet<'a> {\n fn update(&mut self, d: f32) {\n if self.position.x <= 0.0 || self.position.x >= WIN_WIDTH {\n self.rotation = -self.rotation + 180.0;\n }\n\n if self.position.y <= 0.0 || self.position.y >= WIN_HEIGHT {\n self.rotation = -self.rotation;\n }\n\n self.position.x += self.rotation.to_radians().cos() * BULLET_SPEED * d;\n self.position.y += self.rotation.to_radians().sin() * BULLET_SPEED * d;\n\n self.sprite.set_rotation(self.rotation);\n self.sprite.set_position(self.position);\n self.hitbox.x = self.position.x;\n self.hitbox.y = self.position.y;\n }\n\n fn draw(&self, win: &mut RenderWindow) {\n win.draw(&self.sprite);\n }\n\n fn events(&mut self, _evt: Event) {\n unimplemented!();\n }\n}\n"},"prefix":{"kind":"string","value":"use sfml::graphics::*;\nuse sfml::system::Vector2f;\nuse sfml::window::*;\nuse sfml::window::mouse::Button;\n\nuse crate::AssetManager;\n\nuse super::{WIN_HEIGHT, WIN_WIDTH};\n\npub trait Actor {\n fn update(&mut self, d: f32);\n\n fn draw(&self, win: &mut RenderWindow);\n\n fn events(&mut self, evt: Event);\n}\n\nstruct Circle {\n x: f32,\n y: f32,\n radius: f32,\n}\n\nimpl Circle {\n fn new(x: f32, y: f32, radius: f32) -> Circle {\n Circle { x, y, radius }\n }\n\n fn is_colliding(&self, other: &Self) -> bool {\n let dis = {\n let x = self.x - other.x;\n let y = self.y - other.y;\n\n f32::sqrt(x * x + y * y)\n };\n\n dis < (self.radius + other.radius)\n }\n}\n\nconst TOWER_INNER: f32 = 100.0;\nconst TOWER_OUTER: f32 = 250.0;\n\npub struct Tower<'a> {\n sprite: Sprite<'a>,\n teleport_circle: CircleShape<'a>,\n hitbox: Circle,\n position: Vector2f,\n rotation: f32,\n bullet_sprite: Sprite<'a>,\n bullets: Vec<Bullet<'a>>,\n pub dead: bool,\n}\n\nimpl<'a> Tower<'a> {\n pub fn new(am: &'a AssetManager) -> Tower<'a> {\n let position = Vector2f::new(WIN_WIDTH / 2.0, WIN_HEIGHT / 2.0);\n\n let sprite = {\n let mut s = Sprite::new();\n let t = am.get_texture(\"tower.png\");\n s.set_texture(t, true);\n s.set_position(position);\n s.set_origin(Vector2f { x: t.size().x as f32 / 2.0, y: t.size().y as f32 / 2.0 });\n\n s\n };\n\n let teleport_circle = {\n let mut c = CircleShape::new(TOWER_IN"},"suffix":{"kind":"string","value":" Circle::new(position.x, position.y, sprite.texture_rect().width as f32 / 2.0)\n };\n\n Tower {\n sprite,\n teleport_circle,\n hitbox,\n position,\n rotation: 0.0,\n bullet_sprite,\n bullets: Vec::new(),\n dead: false,\n }\n }\n\n pub fn num_bullets(&self) -> usize {\n self.bullets.len()\n }\n}\n\nimpl<'a> Actor for Tower<'a> {\n fn update(&mut self, d: f32) {\n self.sprite.set_rotation(self.rotation);\n self.sprite.set_position(self.position);\n self.teleport_circle.set_position(self.position);\n self.hitbox.x = self.position.x;\n self.hitbox.y = self.position.y;\n\n for b in &mut self.bullets {\n b.update(d);\n\n if b.hitbox.is_colliding(&self.hitbox) {\n self.dead = true;\n }\n }\n }\n\n fn draw(&self, win: &mut RenderWindow) {\n for b in &self.bullets {\n b.draw(win);\n }\n\n win.draw(&self.sprite);\n win.draw(&self.teleport_circle);\n }\n\n fn events(&mut self, evt: Event) {\n match evt {\n Event::MouseButtonPressed { button: Button::Left, x, y } => {\n self.position += {\n let mut m = Vector2f::new(x as f32 - self.position.x, y as f32 - self.position.y);\n let mut l = f32::sqrt(m.x.powi(2) + m.y.powi(2));\n\n if l != 0.0 {\n m.x /= l;\n m.y /= l;\n l = f32::min(TOWER_OUTER, f32::max(l, TOWER_INNER));\n m.x *= l;\n m.y *= l;\n\n self.bullets.push(Bullet::new(self.bullet_sprite.clone(), self.position, self.rotation));\n }\n\n m\n }\n }\n Event::MouseMoved { x, y } => {\n self.rotation = (y as f32 - self.position.y).atan2(x as f32 - self.position.x).to_degrees();\n }\n\n _ => {}\n }\n }\n}\n\nconst BULLET_SPEED: f32 = 85.0;\n\npub struct Bullet<'a> {\n sprite: Sprite<'a>,\n hitbox: Circle,\n position: Vector2f,\n rotation: f32,\n}\n\nimpl<'a> Bullet<'a> {\n pub fn new(spr: Sprite<'a>, pos: Vector2f, rot: f32) -> Bullet<'a> {\n let hitbox = {\n Circle::new(pos.x, pos.y, spr.texture_rect().width as f32 / 2.0)\n };\n\n let mut b = Bullet {\n sprite: spr,\n hitbox,\n position: pos,\n rotation: rot,\n };\n\n b.update(1.0 / 100.0);\n\n b\n }\n}\n\nimpl<'a> Actor for Bullet<'a> {\n fn update(&mut self, d: f32) {\n if self.position.x <= 0.0 || self.position.x >= WIN_WIDTH {\n self.rotation = -self.rotation + 180.0;\n }\n\n if self.position.y <= 0.0 || self.position.y >= WIN_HEIGHT {\n self.rotation = -self.rotation;\n }\n\n self.position.x += self.rotation.to_radians().cos() * BULLET_SPEED * d;\n self.position.y += self.rotation.to_radians().sin() * BULLET_SPEED * d;\n\n self.sprite.set_rotation(self.rotation);\n self.sprite.set_position(self.position);\n self.hitbox.x = self.position.x;\n self.hitbox.y = self.position.y;\n }\n\n fn draw(&self, win: &mut RenderWindow) {\n win.draw(&self.sprite);\n }\n\n fn events(&mut self, _evt: Event) {\n unimplemented!();\n }\n}\n"},"middle":{"kind":"string","value":"NER, 36);\n c.set_position(position);\n c.set_outline_thickness(TOWER_OUTER - TOWER_INNER);\n c.set_origin(Vector2f::new(TOWER_INNER, TOWER_INNER));\n c.set_fill_color(&Color::TRANSPARENT);\n c.set_outline_color(&Color::rgba(255, 255, 255, 50));\n\n c\n };\n\n let bullet_sprite = {\n let mut s = Sprite::new();\n let t = am.get_texture(\"bullet.png\");\n s.set_texture(t, true);\n s.set_position(position);\n s.set_origin(Vector2f { x: t.size().x as f32 / 2.0, y: t.size().y as f32 / 2.0 });\n\n s\n };\n\n let hitbox = {\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub trait Scene {\n\n fn update(&mut self, d: f32) -> Option<State>; //returns the new state if we need to change\n\n\n\n fn draw(&self, win: &mut RenderWindow);\n\n\n\n fn events(&mut self, evt: Event);\n\n}\n\n\n\npub struct MenuScene<'a> {\n\n title_text: Text<'a>,\n\n help_text: Text<'a>,\n\n highscore_text: Text<'a>,\n\n play_button: UiButton<'a>,\n\n exit_button: UiButton<'a>,\n\n highscore: f32,\n\n}\n\n\n\nimpl<'a> MenuScene<'a> {\n\n pub fn new(am: &'a AssetManager, pre_highscore: Option<f32>) -> MenuScene<'a> {\n\n let play_button = UiButton::new(am.get_font(\"font.ttf\"))\n","file_path":"src/scenes.rs","rank":2,"score":51327.902788676394},{"content":"fn load_highscore() -> f32 {\n\n let mut hs: f32 = 0.0;\n\n\n\n match File::open(\"highscore.txt\") {\n\n Ok(mut f) => {\n\n let mut s = String::new();\n\n match f.read_to_string(&mut s) {\n\n Ok(_) => {\n\n match s.parse::<f32>() {\n\n Ok(o) => { hs = o }\n\n _ => {}\n\n }\n\n }\n\n\n\n _ => {}\n\n }\n\n }\n\n\n\n _ => {}\n\n }\n\n\n\n hs\n\n}\n\n\n","file_path":"src/scenes.rs","rank":3,"score":48317.732942422095},{"content":"fn save_highscore(hs: f32) {\n\n match OpenOptions::new().write(true).open(\"highscore.txt\") {\n\n Ok(mut f) => {\n\n f.write_all(format!(\"{}\", hs).as_bytes());\n\n f.flush();\n\n }\n\n\n\n Err(e) => match e.kind() {\n\n ErrorKind::NotFound => {\n\n match File::create(\"highscore.txt\") {\n\n Ok(mut f) => {\n\n f.write(format!(\"{}\", hs).as_bytes());\n\n f.flush();\n\n }\n\n\n\n _ => {\n\n println!(\"Couldn't save!\");\n\n }\n\n }\n\n }\n","file_path":"src/scenes.rs","rank":4,"score":44225.311154440795},{"content":"pub fn get_path(path: &str) -> String {\n\n let here = {\n\n match env::current_exe() {\n\n Ok(p) => {\n\n match p.parent() {\n\n Some(s) => { String::from(s.to_str().unwrap()) }//TODO: remove unwrap\n\n None => {\n\n panic!(\"Path not available {:?}\", p)\n\n }\n\n }\n\n }\n\n Err(err) => {\n\n panic!(\"{}\", err);\n\n }\n\n }\n\n };\n\n\n\n (here + \"/\" + path)\n\n}","file_path":"src/utils.rs","rank":5,"score":37469.7283634628},{"content":"fn main() {\n\n let mut settings = ContextSettings::default();\n\n settings.antialiasing_level = 4;\n\n\n\n let mut window = RenderWindow::new(\n\n VideoMode::new(WIN_SIZE.0, WIN_SIZE.1, 8),\n\n \"Moving Tower\",\n\n Style::CLOSE,\n\n &settings,\n\n );\n\n\n\n window.set_framerate_limit(60);\n\n\n\n let icon = {\n\n let path = get_path(\"resources/icon.png\");\n\n if let Some(t) = Image::from_file(path.as_str()) {\n\n t\n\n } else {\n\n panic!(\"Couldn't load icon: {}\", path);\n\n }\n","file_path":"src/main.rs","rank":6,"score":27115.0559029722},{"content":" }\n\n\n\n pub fn clicked(&mut self) -> bool {\n\n if self.clicked {\n\n self.clicked = false;\n\n return true;\n\n }\n\n\n\n false\n\n }\n\n\n\n pub fn event(&mut self, evt: Event) {\n\n match evt {\n\n Event::MouseButtonPressed { button: Button::Left, x, y } => {\n\n if self.rect.contains2(x as f32, y as f32) {\n\n self.shape.set_scale(Vector2f::new(DOWN_SCALE, DOWN_SCALE));\n\n self.down = true;\n\n }\n\n }\n\n Event::MouseButtonReleased { button: Button::Left, x, y } => {\n","file_path":"src/ui.rs","rank":17,"score":12.86211178327829},{"content":"\n\n self.score_text.set_position(p);\n\n }\n\n\n\n if self.tower.dead {\n\n return Some(State::Menu(Some(self.score)));\n\n }\n\n\n\n None\n\n }\n\n\n\n fn draw(&self, win: &mut RenderWindow) {\n\n self.tower.draw(win);\n\n win.draw(&self.score_text);\n\n }\n\n\n\n fn events(&mut self, evt: Event) {\n\n self.tower.events(evt);\n\n }\n\n}\n","file_path":"src/scenes.rs","rank":18,"score":11.066321785143582},{"content":" }\n\n\n\n fn draw(&self, win: &mut RenderWindow) {\n\n self.play_button.draw(win);\n\n self.exit_button.draw(win);\n\n win.draw(&self.title_text);\n\n win.draw(&self.help_text);\n\n win.draw(&self.highscore_text);\n\n }\n\n\n\n fn events(&mut self, evt: Event) {\n\n self.play_button.event(evt);\n\n self.exit_button.event(evt);\n\n }\n\n}\n\n\n\npub struct GameScene<'a> {\n\n tower: Tower<'a>,\n\n score_text: Text<'a>,\n\n score: f32,\n","file_path":"src/scenes.rs","rank":19,"score":10.1128262186284},{"content":"use sfml::graphics::*;\n\nuse sfml::system::Vector2f;\n\nuse sfml::window::Event;\n\nuse sfml::window::mouse::Button;\n\n\n\npub struct UiButton<'a> {\n\n shape: RectangleShape<'a>,\n\n text: Text<'a>,\n\n rect: FloatRect,\n\n clicked: bool,\n\n down: bool,\n\n fill_color: Color,\n\n border_color: Color,\n\n}\n\n\n\nconst DOWN_SCALE: f32 = 0.97;\n\nconst DARKENING_SCALE: f32 = 0.9;\n\n\n\nimpl<'a> UiButton<'a> {\n\n pub fn new(font: &'a Font) -> UiButton<'a> {\n","file_path":"src/ui.rs","rank":20,"score":10.090871589225786},{"content":"use std::fs::*;\n\nuse std::io::*;\n\nuse std::option::Option;\n\n\n\nuse sfml::graphics::*;\n\nuse sfml::system::Vector2f;\n\nuse sfml::window::*;\n\n\n\nuse crate::actors::*;\n\nuse crate::assets::AssetManager;\n\nuse crate::ui::UiButton;\n\n\n\nuse super::{WIN_HEIGHT, WIN_WIDTH};\n\n\n\n#[derive(PartialEq)]\n\npub enum State {\n\n Menu(Option<f32>),\n\n Game,\n\n Exit,\n\n}\n\n\n","file_path":"src/scenes.rs","rank":21,"score":8.589215756891756},{"content":"}\n\n\n\nimpl<'a> Scene for GameScene<'a> {\n\n fn update(&mut self, d: f32) -> Option<State> {\n\n self.tower.update(d);\n\n self.score += self.tower.num_bullets() as f32 * 4.0 / (self.tower.num_bullets() as f32 / 8.0 + 1.0) * d;\n\n\n\n let ss = format!(\"Score: {:.0}\", self.score);\n\n self.score_text.set_string(ss.as_str());\n\n\n\n if ss.len() != self.score_len {\n\n self.score_len = ss.len();\n\n\n\n let p = {\n\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 5.0);\n\n v.x -= (self.score_text.local_bounds().width / 2.0).trunc();\n\n v.x = v.x.trunc();\n\n\n\n v\n\n };\n","file_path":"src/scenes.rs","rank":22,"score":7.774926612023593},{"content":"#![windows_subsystem = \"windows\"]\n\n\n\nextern crate sfml;\n\n\n\nuse std::boxed::Box;\n\n\n\nuse sfml::graphics::*;\n\nuse sfml::system::*;\n\nuse sfml::window::*;\n\n\n\nuse crate::assets::AssetManager;\n\nuse crate::scenes::*;\n\nuse crate::utils::get_path;\n\n\n\nmod utils;\n\nmod scenes;\n\nmod ui;\n\nmod assets;\n\nmod actors;\n\n\n\nconst WIN_SIZE: (u32, u32) = (1000, 600);\n\nconst WIN_WIDTH: f32 = WIN_SIZE.0 as f32;\n\nconst WIN_HEIGHT: f32 = WIN_SIZE.1 as f32;\n\n\n","file_path":"src/main.rs","rank":23,"score":7.664347718295731},{"content":" UiButton {\n\n shape: RectangleShape::new(),\n\n text: Text::new(\"\", font, 16),\n\n rect: FloatRect::default(),\n\n clicked: false,\n\n down: false,\n\n fill_color: Color::WHITE,\n\n border_color: Color::BLACK,\n\n }\n\n }\n\n\n\n pub fn bounds(mut self, x: f32, y: f32, w: f32, h: f32) -> Self {\n\n self.rect = FloatRect::new(x, y, w, h);\n\n self.shape.set_size(Vector2f { x: w, y: h });\n\n self\n\n }\n\n\n\n pub fn color(mut self, color: Color) -> Self {\n\n self.fill_color = color;\n\n self\n","file_path":"src/ui.rs","rank":24,"score":7.51269276313432},{"content":" }\n\n\n\n pub fn border_color(mut self, color: Color) -> Self {\n\n self.border_color = color;\n\n self\n\n }\n\n\n\n pub fn border_thickness(mut self, thickness: f32) -> Self {\n\n self.shape.set_outline_thickness(thickness);\n\n self\n\n }\n\n\n\n pub fn text(mut self, text: &str) -> Self {\n\n self.text.set_string(text);\n\n self\n\n }\n\n\n\n pub fn char_size(mut self, size: u32) -> Self {\n\n self.text.set_character_size(size);\n\n self\n","file_path":"src/ui.rs","rank":25,"score":7.474640186390946},{"content":" Vector2f::new(x.round(), y.round())\n\n };\n\n self.text.set_position(pos);\n\n\n\n let org = {\n\n let x = self.rect.width / 2.0;\n\n let y = self.rect.height / 2.0;\n\n\n\n Vector2f::new(x, y)\n\n };\n\n self.shape.set_origin(org);\n\n self.shape.set_position(Vector2f::new(self.rect.left + org.x, self.rect.top + org.y));\n\n\n\n self\n\n }\n\n\n\n //TODO: add more down state features\n\n pub fn draw(&self, win: &mut RenderWindow) {\n\n win.draw(&self.shape);\n\n win.draw(&self.text);\n","file_path":"src/ui.rs","rank":26,"score":7.296928477460865},{"content":" if self.down && self.rect.contains2(x as f32, y as f32) {\n\n self.clicked = true;\n\n }\n\n\n\n self.shape.set_scale(Vector2f::new(1.0, 1.0));\n\n self.down = false;\n\n }\n\n Event::MouseMoved { x, y } => {\n\n if self.rect.contains2(x as f32, y as f32) {\n\n let fc = {\n\n let mut c = self.fill_color.clone();\n\n c.r = (c.r as f32 * DARKENING_SCALE) as u8;\n\n c.g = (c.g as f32 * DARKENING_SCALE) as u8;\n\n c.b = (c.b as f32 * DARKENING_SCALE) as u8;\n\n\n\n c\n\n };\n\n\n\n let bc = {\n\n let mut c = self.border_color.clone();\n","file_path":"src/ui.rs","rank":27,"score":7.283026009293234},{"content":" score_len: usize,\n\n}\n\n\n\nimpl<'a> GameScene<'a> {\n\n pub fn new(am: &'a AssetManager) -> GameScene<'a> {\n\n let score_text = {\n\n let mut t = Text::new(\"0.0\", am.get_font(\"font.ttf\"), 20);\n\n t.set_fill_color(&Color::BLACK);\n\n t.set_position(Vector2f::new(WIN_WIDTH / 2.0, 5.0));\n\n\n\n t\n\n };\n\n\n\n GameScene {\n\n tower: Tower::new(am),\n\n score_text,\n\n score: 0.0,\n\n score_len: 0,\n\n }\n\n }\n","file_path":"src/scenes.rs","rank":28,"score":6.6034559567695466},{"content":" let p = {\n\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 120.0);\n\n v.x -= (t.local_bounds().width / 2.0).trunc();\n\n v.x = v.x.trunc();\n\n\n\n v\n\n };\n\n\n\n t.set_position(p);\n\n\n\n t\n\n };\n\n\n\n let mut highscore = load_highscore();\n\n match pre_highscore {\n\n Some(hs) => {\n\n highscore = hs.max(highscore);\n\n save_highscore(highscore);\n\n }\n\n\n","file_path":"src/scenes.rs","rank":29,"score":5.786442767054762},{"content":" let mut t = Text::new(\"Moving Tower\", am.get_font(\"font.ttf\"), 56);\n\n t.set_fill_color(&Color::BLACK);\n\n\n\n let p = {\n\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 15.0);\n\n v.x -= (t.local_bounds().width / 2.0).trunc();\n\n v.x = v.x.trunc();\n\n\n\n v\n\n };\n\n\n\n t.set_position(p);\n\n\n\n t\n\n };\n\n\n\n let help_text = {\n\n let mut t = Text::new(\"Click to teleport within the ring\\nand don't get hit by a bullet\", am.get_font(\"font.ttf\"), 19);\n\n t.set_fill_color(&Color::BLACK);\n\n\n","file_path":"src/scenes.rs","rank":30,"score":5.770678449714124},{"content":" _ => {}\n\n }\n\n\n\n let highscore_text = {\n\n let mut t = Text::new(format!(\"Highscore: {:.0}\", highscore).as_str(), am.get_font(\"font.ttf\"), 19);\n\n t.set_fill_color(&Color::BLACK);\n\n\n\n let p = {\n\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 200.0);\n\n v.x -= (t.local_bounds().width / 2.0).trunc();\n\n v.x = v.x.trunc();\n\n\n\n v\n\n };\n\n\n\n t.set_position(p);\n\n\n\n t\n\n };\n\n\n","file_path":"src/scenes.rs","rank":31,"score":5.5407797445653255},{"content":"use std::collections::HashMap;\n\nuse sfml::graphics::*;\n\nuse crate::utils::get_path;\n\n\n\npub struct AssetManager {\n\n res_path: String,\n\n fonts: HashMap<String, Font>,\n\n textures: HashMap<String, Texture>,\n\n}\n\n\n\nimpl AssetManager {\n\n pub fn new(res_path: &str) -> AssetManager {\n\n AssetManager {\n\n res_path: res_path.to_string(),\n\n fonts: HashMap::new(),\n\n textures: HashMap::new(),\n\n }\n\n }\n\n\n\n pub fn load_font(&mut self, font: &str) {\n","file_path":"src/assets.rs","rank":32,"score":5.373679301617754},{"content":" }\n\n\n\n pub fn text_color(mut self, color: Color) -> Self {\n\n self.text.set_fill_color(&color);\n\n self\n\n }\n\n\n\n pub fn pack(mut self) -> Self {\n\n self.shape.set_fill_color(&self.fill_color);\n\n self.shape.set_outline_color(&self.border_color);\n\n\n\n let pos = {\n\n let x = self.rect.left\n\n + self.rect.width / 2.0\n\n - self.text.global_bounds().width / 2.0;\n\n\n\n let y = self.rect.top\n\n + self.rect.height / 2.0\n\n - self.text.global_bounds().height;//TODO: divide by 2 ??\n\n\n","file_path":"src/ui.rs","rank":33,"score":4.707419647188436},{"content":"\n\n _ => {\n\n println!(\"Couldn't save!\");\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> Scene for MenuScene<'a> {\n\n fn update(&mut self, _d: f32) -> Option<State> {\n\n if self.play_button.clicked() {\n\n return Some(State::Game);\n\n }\n\n\n\n if self.exit_button.clicked() {\n\n save_highscore(self.highscore);\n\n return Some(State::Exit);\n\n }\n\n\n\n None\n","file_path":"src/scenes.rs","rank":34,"score":4.067774607713602},{"content":" let f = {\n\n let path = get_path((self.res_path.clone() + font).as_str());\n\n if let Some(f) = Font::from_file(path.as_str()) {\n\n f\n\n } else {\n\n panic!(\"Couldn't load font: {}\", path);\n\n }\n\n };\n\n\n\n self.fonts.insert(font.to_string(), f);\n\n }\n\n\n\n pub fn load_texture(&mut self, texture: &str) {\n\n let t = {\n\n let path = get_path((self.res_path.clone() + texture).as_str());\n\n if let Some(mut t) = Texture::from_file(path.as_str()) {\n\n t.set_smooth(true);\n\n\n\n t\n\n } else {\n","file_path":"src/assets.rs","rank":35,"score":3.7100595077840812},{"content":"# Moving Tower\n\n\n\nA small game to help me learn Rust made using [rust-sfml](https://github.com/jeremyletang/rust-sfml).\n\n\n\n### How to play\n\nUse the mouse to teleport to a location within the white ring.\n\nTry not to get hit by the bullets.\n","file_path":"README.md","rank":36,"score":3.4673731880775636},{"content":" _ => {}\n\n }\n\n\n\n curscene.events(ev);\n\n }\n\n\n\n window.clear(&Color::from(0x777777FF));\n\n\n\n curscene.draw(&mut window);\n\n\n\n window.display();\n\n }\n\n}","file_path":"src/main.rs","rank":37,"score":3.353222577403999},{"content":"use std::env;\n\n\n","file_path":"src/utils.rs","rank":38,"score":2.4776721028293185},{"content":" State::Game => {\n\n curscene = Box::new(GameScene::new(&asset_manager)) as Box<Scene>;\n\n }\n\n State::Exit => {\n\n window.close()\n\n }\n\n }\n\n }\n\n\n\n while let Some(ev) = window.poll_event() {\n\n match ev {\n\n Event::Closed => { window.close() }\n\n Event::KeyPressed {\n\n code, ..\n\n } => {\n\n match code {\n\n Key::Escape => { window.close() }\n\n _ => {}\n\n }\n\n }\n","file_path":"src/main.rs","rank":39,"score":2.1980596614408485},{"content":" };\n\n\n\n window.set_icon(icon.size().x, icon.size().y, icon.pixel_data());\n\n\n\n let mut asset_manager = AssetManager::new(\"resources/\");\n\n asset_manager.load_font(\"font.ttf\");\n\n asset_manager.load_texture(\"tower.png\");\n\n asset_manager.load_texture(\"bullet.png\");\n\n\n\n let mut clock = Clock::default();\n\n let mut curscene: Box<Scene> = Box::new(MenuScene::new(&asset_manager, None)) as Box<Scene>;\n\n\n\n while window.is_open() {\n\n let delta = clock.restart().as_seconds();\n\n\n\n if let Some(s) = curscene.update(delta) {\n\n match s {\n\n State::Menu(hs) => {\n\n curscene = Box::new(MenuScene::new(&asset_manager, hs)) as Box<Scene>;\n\n }\n","file_path":"src/main.rs","rank":40,"score":2.1146752799546817},{"content":" c.r = (c.r as f32 * DARKENING_SCALE) as u8;\n\n c.g = (c.g as f32 * DARKENING_SCALE) as u8;\n\n c.b = (c.b as f32 * DARKENING_SCALE) as u8;\n\n\n\n c\n\n };\n\n\n\n self.shape.set_fill_color(&fc);\n\n self.shape.set_outline_color(&bc);\n\n } else {\n\n self.shape.set_fill_color(&self.fill_color);\n\n self.shape.set_outline_color(&self.border_color);\n\n }\n\n }\n\n\n\n _ => {}\n\n }\n\n }\n\n}","file_path":"src/ui.rs","rank":41,"score":2.0301257078927506},{"content":" .bounds(WIN_WIDTH / 2.0 - 200.0, WIN_HEIGHT / 2.0, 400.0, 70.0)\n\n .color(Color::WHITE)\n\n .border_color(Color::BLACK)\n\n .border_thickness(3.0)\n\n .text(\"PLAY\")\n\n .char_size(42)\n\n .text_color(Color::BLACK)\n\n .pack();\n\n\n\n let exit_button = UiButton::new(am.get_font(\"font.ttf\"))\n\n .bounds(WIN_WIDTH / 2.0 - 200.0, WIN_HEIGHT / 2.0 + 120.0, 400.0, 70.0)\n\n .color(Color::WHITE)\n\n .border_color(Color::BLACK)\n\n .border_thickness(3.0)\n\n .text(\"EXIT\")\n\n .char_size(42)\n\n .text_color(Color::BLACK)\n\n .pack();\n\n\n\n let title_text = {\n","file_path":"src/scenes.rs","rank":42,"score":1.9782923001693056},{"content":" panic!(\"Couldn't load texture: {}\", path);\n\n }\n\n };\n\n\n\n self.textures.insert(texture.to_string(), t);\n\n }\n\n\n\n pub fn get_font(&self, font: &str) -> &Font {\n\n if let Some(f) = self.fonts.get(font) {\n\n return f;\n\n } else {\n\n panic!(\"Font not loaded: {}\", font);\n\n }\n\n }\n\n\n\n pub fn get_texture(&self, texture: &str) -> &Texture {\n\n if let Some(t) = self.textures.get(texture) {\n\n return t;\n\n } else {\n\n panic!(\"Texture not loaded: {}\", texture);\n\n }\n\n }\n\n}\n\n\n","file_path":"src/assets.rs","rank":43,"score":1.785551037756194}],"string":"[\n {\n \"content\": \"pub trait Scene {\\n\\n fn update(&mut self, d: f32) -> Option<State>; //returns the new state if we need to change\\n\\n\\n\\n fn draw(&self, win: &mut RenderWindow);\\n\\n\\n\\n fn events(&mut self, evt: Event);\\n\\n}\\n\\n\\n\\npub struct MenuScene<'a> {\\n\\n title_text: Text<'a>,\\n\\n help_text: Text<'a>,\\n\\n highscore_text: Text<'a>,\\n\\n play_button: UiButton<'a>,\\n\\n exit_button: UiButton<'a>,\\n\\n highscore: f32,\\n\\n}\\n\\n\\n\\nimpl<'a> MenuScene<'a> {\\n\\n pub fn new(am: &'a AssetManager, pre_highscore: Option<f32>) -> MenuScene<'a> {\\n\\n let play_button = UiButton::new(am.get_font(\\\"font.ttf\\\"))\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 2,\n \"score\": 51327.902788676394\n },\n {\n \"content\": \"fn load_highscore() -> f32 {\\n\\n let mut hs: f32 = 0.0;\\n\\n\\n\\n match File::open(\\\"highscore.txt\\\") {\\n\\n Ok(mut f) => {\\n\\n let mut s = String::new();\\n\\n match f.read_to_string(&mut s) {\\n\\n Ok(_) => {\\n\\n match s.parse::<f32>() {\\n\\n Ok(o) => { hs = o }\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n\\n\\n _ => {}\\n\\n }\\n\\n\\n\\n hs\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 3,\n \"score\": 48317.732942422095\n },\n {\n \"content\": \"fn save_highscore(hs: f32) {\\n\\n match OpenOptions::new().write(true).open(\\\"highscore.txt\\\") {\\n\\n Ok(mut f) => {\\n\\n f.write_all(format!(\\\"{}\\\", hs).as_bytes());\\n\\n f.flush();\\n\\n }\\n\\n\\n\\n Err(e) => match e.kind() {\\n\\n ErrorKind::NotFound => {\\n\\n match File::create(\\\"highscore.txt\\\") {\\n\\n Ok(mut f) => {\\n\\n f.write(format!(\\\"{}\\\", hs).as_bytes());\\n\\n f.flush();\\n\\n }\\n\\n\\n\\n _ => {\\n\\n println!(\\\"Couldn't save!\\\");\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 4,\n \"score\": 44225.311154440795\n },\n {\n \"content\": \"pub fn get_path(path: &str) -> String {\\n\\n let here = {\\n\\n match env::current_exe() {\\n\\n Ok(p) => {\\n\\n match p.parent() {\\n\\n Some(s) => { String::from(s.to_str().unwrap()) }//TODO: remove unwrap\\n\\n None => {\\n\\n panic!(\\\"Path not available {:?}\\\", p)\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(err) => {\\n\\n panic!(\\\"{}\\\", err);\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n (here + \\\"/\\\" + path)\\n\\n}\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 5,\n \"score\": 37469.7283634628\n },\n {\n \"content\": \"fn main() {\\n\\n let mut settings = ContextSettings::default();\\n\\n settings.antialiasing_level = 4;\\n\\n\\n\\n let mut window = RenderWindow::new(\\n\\n VideoMode::new(WIN_SIZE.0, WIN_SIZE.1, 8),\\n\\n \\\"Moving Tower\\\",\\n\\n Style::CLOSE,\\n\\n &settings,\\n\\n );\\n\\n\\n\\n window.set_framerate_limit(60);\\n\\n\\n\\n let icon = {\\n\\n let path = get_path(\\\"resources/icon.png\\\");\\n\\n if let Some(t) = Image::from_file(path.as_str()) {\\n\\n t\\n\\n } else {\\n\\n panic!(\\\"Couldn't load icon: {}\\\", path);\\n\\n }\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 6,\n \"score\": 27115.0559029722\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn clicked(&mut self) -> bool {\\n\\n if self.clicked {\\n\\n self.clicked = false;\\n\\n return true;\\n\\n }\\n\\n\\n\\n false\\n\\n }\\n\\n\\n\\n pub fn event(&mut self, evt: Event) {\\n\\n match evt {\\n\\n Event::MouseButtonPressed { button: Button::Left, x, y } => {\\n\\n if self.rect.contains2(x as f32, y as f32) {\\n\\n self.shape.set_scale(Vector2f::new(DOWN_SCALE, DOWN_SCALE));\\n\\n self.down = true;\\n\\n }\\n\\n }\\n\\n Event::MouseButtonReleased { button: Button::Left, x, y } => {\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 17,\n \"score\": 12.86211178327829\n },\n {\n \"content\": \"\\n\\n self.score_text.set_position(p);\\n\\n }\\n\\n\\n\\n if self.tower.dead {\\n\\n return Some(State::Menu(Some(self.score)));\\n\\n }\\n\\n\\n\\n None\\n\\n }\\n\\n\\n\\n fn draw(&self, win: &mut RenderWindow) {\\n\\n self.tower.draw(win);\\n\\n win.draw(&self.score_text);\\n\\n }\\n\\n\\n\\n fn events(&mut self, evt: Event) {\\n\\n self.tower.events(evt);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 18,\n \"score\": 11.066321785143582\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn draw(&self, win: &mut RenderWindow) {\\n\\n self.play_button.draw(win);\\n\\n self.exit_button.draw(win);\\n\\n win.draw(&self.title_text);\\n\\n win.draw(&self.help_text);\\n\\n win.draw(&self.highscore_text);\\n\\n }\\n\\n\\n\\n fn events(&mut self, evt: Event) {\\n\\n self.play_button.event(evt);\\n\\n self.exit_button.event(evt);\\n\\n }\\n\\n}\\n\\n\\n\\npub struct GameScene<'a> {\\n\\n tower: Tower<'a>,\\n\\n score_text: Text<'a>,\\n\\n score: f32,\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 19,\n \"score\": 10.1128262186284\n },\n {\n \"content\": \"use sfml::graphics::*;\\n\\nuse sfml::system::Vector2f;\\n\\nuse sfml::window::Event;\\n\\nuse sfml::window::mouse::Button;\\n\\n\\n\\npub struct UiButton<'a> {\\n\\n shape: RectangleShape<'a>,\\n\\n text: Text<'a>,\\n\\n rect: FloatRect,\\n\\n clicked: bool,\\n\\n down: bool,\\n\\n fill_color: Color,\\n\\n border_color: Color,\\n\\n}\\n\\n\\n\\nconst DOWN_SCALE: f32 = 0.97;\\n\\nconst DARKENING_SCALE: f32 = 0.9;\\n\\n\\n\\nimpl<'a> UiButton<'a> {\\n\\n pub fn new(font: &'a Font) -> UiButton<'a> {\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 20,\n \"score\": 10.090871589225786\n },\n {\n \"content\": \"use std::fs::*;\\n\\nuse std::io::*;\\n\\nuse std::option::Option;\\n\\n\\n\\nuse sfml::graphics::*;\\n\\nuse sfml::system::Vector2f;\\n\\nuse sfml::window::*;\\n\\n\\n\\nuse crate::actors::*;\\n\\nuse crate::assets::AssetManager;\\n\\nuse crate::ui::UiButton;\\n\\n\\n\\nuse super::{WIN_HEIGHT, WIN_WIDTH};\\n\\n\\n\\n#[derive(PartialEq)]\\n\\npub enum State {\\n\\n Menu(Option<f32>),\\n\\n Game,\\n\\n Exit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 21,\n \"score\": 8.589215756891756\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a> Scene for GameScene<'a> {\\n\\n fn update(&mut self, d: f32) -> Option<State> {\\n\\n self.tower.update(d);\\n\\n self.score += self.tower.num_bullets() as f32 * 4.0 / (self.tower.num_bullets() as f32 / 8.0 + 1.0) * d;\\n\\n\\n\\n let ss = format!(\\\"Score: {:.0}\\\", self.score);\\n\\n self.score_text.set_string(ss.as_str());\\n\\n\\n\\n if ss.len() != self.score_len {\\n\\n self.score_len = ss.len();\\n\\n\\n\\n let p = {\\n\\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 5.0);\\n\\n v.x -= (self.score_text.local_bounds().width / 2.0).trunc();\\n\\n v.x = v.x.trunc();\\n\\n\\n\\n v\\n\\n };\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 22,\n \"score\": 7.774926612023593\n },\n {\n \"content\": \"#![windows_subsystem = \\\"windows\\\"]\\n\\n\\n\\nextern crate sfml;\\n\\n\\n\\nuse std::boxed::Box;\\n\\n\\n\\nuse sfml::graphics::*;\\n\\nuse sfml::system::*;\\n\\nuse sfml::window::*;\\n\\n\\n\\nuse crate::assets::AssetManager;\\n\\nuse crate::scenes::*;\\n\\nuse crate::utils::get_path;\\n\\n\\n\\nmod utils;\\n\\nmod scenes;\\n\\nmod ui;\\n\\nmod assets;\\n\\nmod actors;\\n\\n\\n\\nconst WIN_SIZE: (u32, u32) = (1000, 600);\\n\\nconst WIN_WIDTH: f32 = WIN_SIZE.0 as f32;\\n\\nconst WIN_HEIGHT: f32 = WIN_SIZE.1 as f32;\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 23,\n \"score\": 7.664347718295731\n },\n {\n \"content\": \" UiButton {\\n\\n shape: RectangleShape::new(),\\n\\n text: Text::new(\\\"\\\", font, 16),\\n\\n rect: FloatRect::default(),\\n\\n clicked: false,\\n\\n down: false,\\n\\n fill_color: Color::WHITE,\\n\\n border_color: Color::BLACK,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn bounds(mut self, x: f32, y: f32, w: f32, h: f32) -> Self {\\n\\n self.rect = FloatRect::new(x, y, w, h);\\n\\n self.shape.set_size(Vector2f { x: w, y: h });\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn color(mut self, color: Color) -> Self {\\n\\n self.fill_color = color;\\n\\n self\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 24,\n \"score\": 7.51269276313432\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn border_color(mut self, color: Color) -> Self {\\n\\n self.border_color = color;\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn border_thickness(mut self, thickness: f32) -> Self {\\n\\n self.shape.set_outline_thickness(thickness);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn text(mut self, text: &str) -> Self {\\n\\n self.text.set_string(text);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn char_size(mut self, size: u32) -> Self {\\n\\n self.text.set_character_size(size);\\n\\n self\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 25,\n \"score\": 7.474640186390946\n },\n {\n \"content\": \" Vector2f::new(x.round(), y.round())\\n\\n };\\n\\n self.text.set_position(pos);\\n\\n\\n\\n let org = {\\n\\n let x = self.rect.width / 2.0;\\n\\n let y = self.rect.height / 2.0;\\n\\n\\n\\n Vector2f::new(x, y)\\n\\n };\\n\\n self.shape.set_origin(org);\\n\\n self.shape.set_position(Vector2f::new(self.rect.left + org.x, self.rect.top + org.y));\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n //TODO: add more down state features\\n\\n pub fn draw(&self, win: &mut RenderWindow) {\\n\\n win.draw(&self.shape);\\n\\n win.draw(&self.text);\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 26,\n \"score\": 7.296928477460865\n },\n {\n \"content\": \" if self.down && self.rect.contains2(x as f32, y as f32) {\\n\\n self.clicked = true;\\n\\n }\\n\\n\\n\\n self.shape.set_scale(Vector2f::new(1.0, 1.0));\\n\\n self.down = false;\\n\\n }\\n\\n Event::MouseMoved { x, y } => {\\n\\n if self.rect.contains2(x as f32, y as f32) {\\n\\n let fc = {\\n\\n let mut c = self.fill_color.clone();\\n\\n c.r = (c.r as f32 * DARKENING_SCALE) as u8;\\n\\n c.g = (c.g as f32 * DARKENING_SCALE) as u8;\\n\\n c.b = (c.b as f32 * DARKENING_SCALE) as u8;\\n\\n\\n\\n c\\n\\n };\\n\\n\\n\\n let bc = {\\n\\n let mut c = self.border_color.clone();\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 27,\n \"score\": 7.283026009293234\n },\n {\n \"content\": \" score_len: usize,\\n\\n}\\n\\n\\n\\nimpl<'a> GameScene<'a> {\\n\\n pub fn new(am: &'a AssetManager) -> GameScene<'a> {\\n\\n let score_text = {\\n\\n let mut t = Text::new(\\\"0.0\\\", am.get_font(\\\"font.ttf\\\"), 20);\\n\\n t.set_fill_color(&Color::BLACK);\\n\\n t.set_position(Vector2f::new(WIN_WIDTH / 2.0, 5.0));\\n\\n\\n\\n t\\n\\n };\\n\\n\\n\\n GameScene {\\n\\n tower: Tower::new(am),\\n\\n score_text,\\n\\n score: 0.0,\\n\\n score_len: 0,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 28,\n \"score\": 6.6034559567695466\n },\n {\n \"content\": \" let p = {\\n\\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 120.0);\\n\\n v.x -= (t.local_bounds().width / 2.0).trunc();\\n\\n v.x = v.x.trunc();\\n\\n\\n\\n v\\n\\n };\\n\\n\\n\\n t.set_position(p);\\n\\n\\n\\n t\\n\\n };\\n\\n\\n\\n let mut highscore = load_highscore();\\n\\n match pre_highscore {\\n\\n Some(hs) => {\\n\\n highscore = hs.max(highscore);\\n\\n save_highscore(highscore);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 29,\n \"score\": 5.786442767054762\n },\n {\n \"content\": \" let mut t = Text::new(\\\"Moving Tower\\\", am.get_font(\\\"font.ttf\\\"), 56);\\n\\n t.set_fill_color(&Color::BLACK);\\n\\n\\n\\n let p = {\\n\\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 15.0);\\n\\n v.x -= (t.local_bounds().width / 2.0).trunc();\\n\\n v.x = v.x.trunc();\\n\\n\\n\\n v\\n\\n };\\n\\n\\n\\n t.set_position(p);\\n\\n\\n\\n t\\n\\n };\\n\\n\\n\\n let help_text = {\\n\\n let mut t = Text::new(\\\"Click to teleport within the ring\\\\nand don't get hit by a bullet\\\", am.get_font(\\\"font.ttf\\\"), 19);\\n\\n t.set_fill_color(&Color::BLACK);\\n\\n\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 30,\n \"score\": 5.770678449714124\n },\n {\n \"content\": \" _ => {}\\n\\n }\\n\\n\\n\\n let highscore_text = {\\n\\n let mut t = Text::new(format!(\\\"Highscore: {:.0}\\\", highscore).as_str(), am.get_font(\\\"font.ttf\\\"), 19);\\n\\n t.set_fill_color(&Color::BLACK);\\n\\n\\n\\n let p = {\\n\\n let mut v = Vector2f::new(WIN_WIDTH / 2.0, 200.0);\\n\\n v.x -= (t.local_bounds().width / 2.0).trunc();\\n\\n v.x = v.x.trunc();\\n\\n\\n\\n v\\n\\n };\\n\\n\\n\\n t.set_position(p);\\n\\n\\n\\n t\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 31,\n \"score\": 5.5407797445653255\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse sfml::graphics::*;\\n\\nuse crate::utils::get_path;\\n\\n\\n\\npub struct AssetManager {\\n\\n res_path: String,\\n\\n fonts: HashMap<String, Font>,\\n\\n textures: HashMap<String, Texture>,\\n\\n}\\n\\n\\n\\nimpl AssetManager {\\n\\n pub fn new(res_path: &str) -> AssetManager {\\n\\n AssetManager {\\n\\n res_path: res_path.to_string(),\\n\\n fonts: HashMap::new(),\\n\\n textures: HashMap::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load_font(&mut self, font: &str) {\\n\",\n \"file_path\": \"src/assets.rs\",\n \"rank\": 32,\n \"score\": 5.373679301617754\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn text_color(mut self, color: Color) -> Self {\\n\\n self.text.set_fill_color(&color);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn pack(mut self) -> Self {\\n\\n self.shape.set_fill_color(&self.fill_color);\\n\\n self.shape.set_outline_color(&self.border_color);\\n\\n\\n\\n let pos = {\\n\\n let x = self.rect.left\\n\\n + self.rect.width / 2.0\\n\\n - self.text.global_bounds().width / 2.0;\\n\\n\\n\\n let y = self.rect.top\\n\\n + self.rect.height / 2.0\\n\\n - self.text.global_bounds().height;//TODO: divide by 2 ??\\n\\n\\n\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 33,\n \"score\": 4.707419647188436\n },\n {\n \"content\": \"\\n\\n _ => {\\n\\n println!(\\\"Couldn't save!\\\");\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Scene for MenuScene<'a> {\\n\\n fn update(&mut self, _d: f32) -> Option<State> {\\n\\n if self.play_button.clicked() {\\n\\n return Some(State::Game);\\n\\n }\\n\\n\\n\\n if self.exit_button.clicked() {\\n\\n save_highscore(self.highscore);\\n\\n return Some(State::Exit);\\n\\n }\\n\\n\\n\\n None\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 34,\n \"score\": 4.067774607713602\n },\n {\n \"content\": \" let f = {\\n\\n let path = get_path((self.res_path.clone() + font).as_str());\\n\\n if let Some(f) = Font::from_file(path.as_str()) {\\n\\n f\\n\\n } else {\\n\\n panic!(\\\"Couldn't load font: {}\\\", path);\\n\\n }\\n\\n };\\n\\n\\n\\n self.fonts.insert(font.to_string(), f);\\n\\n }\\n\\n\\n\\n pub fn load_texture(&mut self, texture: &str) {\\n\\n let t = {\\n\\n let path = get_path((self.res_path.clone() + texture).as_str());\\n\\n if let Some(mut t) = Texture::from_file(path.as_str()) {\\n\\n t.set_smooth(true);\\n\\n\\n\\n t\\n\\n } else {\\n\",\n \"file_path\": \"src/assets.rs\",\n \"rank\": 35,\n \"score\": 3.7100595077840812\n },\n {\n \"content\": \"# Moving Tower\\n\\n\\n\\nA small game to help me learn Rust made using [rust-sfml](https://github.com/jeremyletang/rust-sfml).\\n\\n\\n\\n### How to play\\n\\nUse the mouse to teleport to a location within the white ring.\\n\\nTry not to get hit by the bullets.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 36,\n \"score\": 3.4673731880775636\n },\n {\n \"content\": \" _ => {}\\n\\n }\\n\\n\\n\\n curscene.events(ev);\\n\\n }\\n\\n\\n\\n window.clear(&Color::from(0x777777FF));\\n\\n\\n\\n curscene.draw(&mut window);\\n\\n\\n\\n window.display();\\n\\n }\\n\\n}\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 37,\n \"score\": 3.353222577403999\n },\n {\n \"content\": \"use std::env;\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 38,\n \"score\": 2.4776721028293185\n },\n {\n \"content\": \" State::Game => {\\n\\n curscene = Box::new(GameScene::new(&asset_manager)) as Box<Scene>;\\n\\n }\\n\\n State::Exit => {\\n\\n window.close()\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n while let Some(ev) = window.poll_event() {\\n\\n match ev {\\n\\n Event::Closed => { window.close() }\\n\\n Event::KeyPressed {\\n\\n code, ..\\n\\n } => {\\n\\n match code {\\n\\n Key::Escape => { window.close() }\\n\\n _ => {}\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 39,\n \"score\": 2.1980596614408485\n },\n {\n \"content\": \" };\\n\\n\\n\\n window.set_icon(icon.size().x, icon.size().y, icon.pixel_data());\\n\\n\\n\\n let mut asset_manager = AssetManager::new(\\\"resources/\\\");\\n\\n asset_manager.load_font(\\\"font.ttf\\\");\\n\\n asset_manager.load_texture(\\\"tower.png\\\");\\n\\n asset_manager.load_texture(\\\"bullet.png\\\");\\n\\n\\n\\n let mut clock = Clock::default();\\n\\n let mut curscene: Box<Scene> = Box::new(MenuScene::new(&asset_manager, None)) as Box<Scene>;\\n\\n\\n\\n while window.is_open() {\\n\\n let delta = clock.restart().as_seconds();\\n\\n\\n\\n if let Some(s) = curscene.update(delta) {\\n\\n match s {\\n\\n State::Menu(hs) => {\\n\\n curscene = Box::new(MenuScene::new(&asset_manager, hs)) as Box<Scene>;\\n\\n }\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 40,\n \"score\": 2.1146752799546817\n },\n {\n \"content\": \" c.r = (c.r as f32 * DARKENING_SCALE) as u8;\\n\\n c.g = (c.g as f32 * DARKENING_SCALE) as u8;\\n\\n c.b = (c.b as f32 * DARKENING_SCALE) as u8;\\n\\n\\n\\n c\\n\\n };\\n\\n\\n\\n self.shape.set_fill_color(&fc);\\n\\n self.shape.set_outline_color(&bc);\\n\\n } else {\\n\\n self.shape.set_fill_color(&self.fill_color);\\n\\n self.shape.set_outline_color(&self.border_color);\\n\\n }\\n\\n }\\n\\n\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n}\",\n \"file_path\": \"src/ui.rs\",\n \"rank\": 41,\n \"score\": 2.0301257078927506\n },\n {\n \"content\": \" .bounds(WIN_WIDTH / 2.0 - 200.0, WIN_HEIGHT / 2.0, 400.0, 70.0)\\n\\n .color(Color::WHITE)\\n\\n .border_color(Color::BLACK)\\n\\n .border_thickness(3.0)\\n\\n .text(\\\"PLAY\\\")\\n\\n .char_size(42)\\n\\n .text_color(Color::BLACK)\\n\\n .pack();\\n\\n\\n\\n let exit_button = UiButton::new(am.get_font(\\\"font.ttf\\\"))\\n\\n .bounds(WIN_WIDTH / 2.0 - 200.0, WIN_HEIGHT / 2.0 + 120.0, 400.0, 70.0)\\n\\n .color(Color::WHITE)\\n\\n .border_color(Color::BLACK)\\n\\n .border_thickness(3.0)\\n\\n .text(\\\"EXIT\\\")\\n\\n .char_size(42)\\n\\n .text_color(Color::BLACK)\\n\\n .pack();\\n\\n\\n\\n let title_text = {\\n\",\n \"file_path\": \"src/scenes.rs\",\n \"rank\": 42,\n \"score\": 1.9782923001693056\n },\n {\n \"content\": \" panic!(\\\"Couldn't load texture: {}\\\", path);\\n\\n }\\n\\n };\\n\\n\\n\\n self.textures.insert(texture.to_string(), t);\\n\\n }\\n\\n\\n\\n pub fn get_font(&self, font: &str) -> &Font {\\n\\n if let Some(f) = self.fonts.get(font) {\\n\\n return f;\\n\\n } else {\\n\\n panic!(\\\"Font not loaded: {}\\\", font);\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_texture(&self, texture: &str) -> &Texture {\\n\\n if let Some(t) = self.textures.get(texture) {\\n\\n return t;\\n\\n } else {\\n\\n panic!(\\\"Texture not loaded: {}\\\", texture);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/assets.rs\",\n \"rank\": 43,\n \"score\": 1.785551037756194\n }\n]","isConversational":false}}},{"rowIdx":3688,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/line.rs"},"repo_name":{"kind":"string","value":"RoguishStudios/hexgrid"},"commit":{"kind":"string","value":"5d19f73a56a7210ac883bb3d001b4fc60e2f49c7"},"file_code":{"kind":"string","value":"\n\nuse crate::{Coordinate, Float, Integer, Position};\nuse std::iter;\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LineGenIter<I: Integer, F: Float> {\n origin: Position<F>,\n target: Position<F>,\n n: I,\n i: I,\n}\n\nimpl<I: Integer, F: Float> LineGenIter<I, F> {\n pub(crate) fn new(origin: Position<F>, target: Position<F>) -> LineGenIter<I, F> {\n let n = I::from(origin.distance(target)).unwrap();\n let i = I::zero();\n LineGenIter {\n origin,\n target,\n n,\n i,\n }\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LineGenIter<I, F> {\n type Item = Position<F>;\n\n fn next(&mut self) -> Option<Self::Item> {\n if self.i > self.n {\n None\n } else if self.n == I::zero() && self.i == I::zero() {\n self.i += I::one();\n Some(self.origin)\n } else {\n let d = F::from(self.i).unwrap() / F::from(self.n).unwrap();\n self.i += I::one();\n Some(Position::from_axial(\n self.origin.q + (self.target.q - self.origin.q) * d,\n self.origin.q + (self.target.r - self.origin.r) * d,\n ))\n }\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n let origin = Coordinate::from_position(self.origin);\n let target = Coordinate::from_position(self.target);\n let total_size = I::one() + origin.distance(target);\n let len = (total_size - self.i).to_usize().unwrap();\n (len, Some(len))\n }\n}\n\nimpl<I: Integer, F: Float> std::iter::FusedIterator for LineGenIter<I, F> {}\nimpl<I: Integer, F: Float> std::iter::ExactSizeIterator for LineGenIter<I, F> {}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LineIter<I: Integer, F: Float = f64>(LineGenIter<I, F>);\n\nimpl<I: Integer, F: Float> LineIter<I, F> {\n pub(crate) fn new(gen: LineGenIter<I, F>) -> LineIter<I, F> {\n LineIter(gen)\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LineIter<I, F> {\n type Item = Coordinate<I>;\n\n fn next(&mut self) -> Option<Self::Item> {\n self.0.next().map(Coordinate::from_position)\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n self.0.size_hint()\n }\n}\n\nimpl<I: Integer, F: Float> iter::FusedIterator for LineIter<I, F> {}\nimpl<I: Integer, F: Float> iter::ExactSizeIterator for LineIter<I, F> {}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LossyLineIter<I: Integer, F: Float = f64>(LineGenIter<I, F>);\n\nimpl<I: Integer, F: Float> LossyLineIter<I, F> {\n pub(crate) fn new(gen: LineGenIter<I, F>) -> LossyLineIter<I, F> {\n LossyLineIter(gen)\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LossyLineIter<I, F> {\n type Item = Coordinate<I>;\n fn next(&mut self) -> Option<Self::Item> {\n loop {\n let c = self.0.next().map(Coordinate::from_position_lossy);\n match c {\n Some(c @ Some(_)) => return c,\n Some(None) => continue,\n None => return None,\n }\n }\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n (self.0.size_hint().0 / 2, self.0.size_hint().1)\n }\n}\n\nimpl<I: Integer, F: Float> iter::FusedIterator for LossyLineIter<I, F> {}\nimpl<I: Integer, F: Float> iter::ExactSizeIterator for LossyLineIter<I, F> {}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LineIterWithEdgeDetection<I: Integer, F: Float = f64>(LineGenIter<I, F>);\n\nimpl<I: Integer, F: Float> LineIterWithEdgeDetection<I, F> {\n pub(crate) fn new(gen: LineGenIter<I, F>) -> LineIterWithEdgeDetection<I, F> {\n LineIterWithEdgeDetection(gen)\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LineIterWithEdgeDetection<I, F> {\n type Item = (Coordinate<I>, Coordinate<I>);\n\n fn next(&mut self) -> Option<Self::Item> {\n let delta: F = F::from(0.000001).unwrap();\n self.0.next().map(|p| {\n (\n Position::from_axial(p.q + delta, p.r + delta).into_coordinate(),\n Position::from_axial(p.q - delta, p.r - delta).into_coordinate(),\n )\n })\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n self.0.size_hint()\n }\n}\n\nimpl<I: Integer, F: Float> iter::FusedIterator for LineIterWithEdgeDetection<I, F> {}\nimpl<I: Integer, F: Float> iter::ExactSizeIterator for LineIterWithEdgeDetection<I, F> {}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::{Coordinate, Float, Integer, Position};\nuse std::iter;\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LineGenIter<I: Integer, F: Float> {\n origin: Position<F>,\n target: Position<F>,\n n: I,\n i: I,\n}\n\nimpl<I: Integer, F: Float> LineGenIter<I, F> {\n pub(crate) fn new(origin: Position<F>, target: Position<F>) -> LineGenIter<I, F> {\n let n = I::from(origin.distance(target)).unwrap();\n let i = I::zero();\n LineGenIter {\n origin,\n target,\n n,\n i,\n }\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LineGenIter<I, F> {\n type Item = Position<F>;\n\n fn next(&mut self) -> Option<Self::Item> {\n if self.i > self.n {\n None\n } else if self.n == I::zero() && self.i == I::zero() {\n self.i += I::one();\n Some(self.origin)\n } else {\n let d = F::from(self.i).unwrap() / F::from(self.n).unwrap();\n self.i += I::one();\n Some(Position::from_axial(\n self.origin.q + (self.target.q - self.origin.q) * d,\n self.origin.q + (self.target.r - self.origin.r) * d,\n ))\n }\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n let origin = Coordinate::from_position(self.origin);\n let target = Coordinate::from_position(self.target);\n let total_size = I::one() + origin.distance(target);\n let len = (total_size - self.i).to_usize().unwrap();\n (len, Some(len))\n }\n}\n\nimpl<I: Integer, F: Float> std::iter::FusedIterator for LineGenIter<I, F> {}\nimpl<I: Integer, F: Float> std::iter::ExactSizeIterator for LineGenIter<I, F> {}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LineIter<I: Integer, F: Float = f64>(LineGenIter<I, F>);\n\nimpl<I: Integer, F: Float> LineIter<I, F> {\n pub(crate) fn new(gen: LineGenIter<I, F>) -> LineIter<I, F> {\n LineIter(gen)\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LineIter<I, F> {\n type Item = Coordinate<I>;\n\n fn next(&mut self) -> Option<Self::Item> {\n self.0.next().map(Coordinate::from_position)\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n self.0.size_hint()\n }\n}\n\nimpl<I: Integer, F: Float> iter::FusedIterator for LineIter<I, F> {}\nimpl<I: Integer, F: Float> iter::ExactSizeIterator for LineIter<I, F> {}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LossyLineIter<I: Integer, F: Float = f64>(LineGenIter<I, F>);\n\nimpl<I: Integer, F: Float> LossyLineIter<I, F> {\n pub(crate) fn new(gen: LineGenIter<I, F>) -> LossyLineIter<I, F> {\n LossyLineIter(gen)\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LossyLineIter<I, F> {\n type Item = Coordinate<I>;\n fn next(&mut self) -> Option<Self::Item> {\n loop {\n let c = self.0.next().map(Coordinate::from_position_lossy);\n match c {\n Some(c @ Some(_)) => return c,\n Some(None) => continue,\n None => return None,\n }\n }\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n (self.0.size_hint().0 / 2, self.0.size_hint().1)\n }\n}\n\nimpl<I: Integer, F: Float> iter::FusedIterator for LossyLineIter<I, F> {}\nimpl<I: Integer, F: Float> iter::ExactSizeIterator for LossyLineIter<I, F> {}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, PartialEq, Debug, PartialOrd)]\npub struct LineIterWithEdgeDetection<I: Integer, F: Float = f64>(LineGenIter<I, F>);\n\nimpl<I: Integer, F: Float> LineIterWithEdgeDetection<I, F> {\n pub(crate) fn new(gen: LineGenIter<I, F>) -> LineIterWithEdgeDetection<I, F> {\n LineIterWithEdgeDetection(gen)\n }\n}\n\nimpl<I: Integer, F: Float> Iterator for LineIterWithEdgeDetection<I, F> {\n type Item = (Coordinate<I>, Coordinate<I>);\n\n "},"suffix":{"kind":"string","value":"\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n self.0.size_hint()\n }\n}\n\nimpl<I: Integer, F: Float> iter::FusedIterator for LineIterWithEdgeDetection<I, F> {}\nimpl<I: Integer, F: Float> iter::ExactSizeIterator for LineIterWithEdgeDetection<I, F> {}\n"},"middle":{"kind":"string","value":"fn next(&mut self) -> Option<Self::Item> {\n let delta: F = F::from(0.000001).unwrap();\n self.0.next().map(|p| {\n (\n Position::from_axial(p.q + delta, p.r + delta).into_coordinate(),\n Position::from_axial(p.q - delta, p.r - delta).into_coordinate(),\n )\n })\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Float trait used by this library\n\npub trait Float:\n\n num::Signed\n\n + num::Float\n\n + num::ToPrimitive\n\n + num::FromPrimitive\n\n + num::NumCast\n\n + num::One\n\n + num::Zero\n\n + std::marker::Copy\n\n + std::ops::AddAssign\n\n + std::default::Default\n\n{\n\n}\n\n\n\nimpl<F> Float for F where\n\n F: num::Signed\n\n + num::Float\n\n + num::ToPrimitive\n\n + num::FromPrimitive\n\n + num::NumCast\n\n + num::One\n\n + num::Zero\n\n + std::marker::Copy\n\n + std::ops::AddAssign\n\n + std::default::Default\n\n{\n\n}\n","file_path":"src/types.rs","rank":0,"score":75878.38311700396},{"content":"/// Integer trait used by this library.\n\npub trait Integer:\n\n num::Signed\n\n + num::Integer\n\n + num::CheckedAdd\n\n + num::ToPrimitive\n\n + num::FromPrimitive\n\n + num::NumCast\n\n + num::One\n\n + num::Zero\n\n + std::default::Default\n\n + std::fmt::Debug\n\n + std::hash::Hash\n\n + std::marker::Copy\n\n + std::ops::AddAssign\n\n{\n\n}\n\n\n\nimpl<I> Integer for I where\n\n I: num::Signed\n\n + num::Integer\n","file_path":"src/types.rs","rank":1,"score":74200.83499000534},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\n/// Integer trait used by this library.\n","file_path":"src/types.rs","rank":2,"score":27407.132134449068},{"content":" + num::CheckedAdd\n\n + num::ToPrimitive\n\n + num::FromPrimitive\n\n + num::NumCast\n\n + num::One\n\n + num::Zero\n\n + std::default::Default\n\n + std::fmt::Debug\n\n + std::hash::Hash\n\n + std::marker::Copy\n\n + std::ops::AddAssign\n\n{\n\n}\n\n\n","file_path":"src/types.rs","rank":3,"score":27402.74141679599},{"content":"}\n\n\n\nimpl<F: Float, I: Integer> From<Coordinate<I>> for Position<F> {\n\n fn from(coordinate: Coordinate<I>) -> Self {\n\n Position::from_coordinate(coordinate)\n\n }\n\n}\n\n\n\nimpl<F: Float, I: Integer> From<Bearing<I>> for Position<F> {\n\n fn from(bearing: Bearing<I>) -> Self {\n\n bearing.coordinate.into_position()\n\n }\n\n}\n\n\n\nimpl<F: Float> From<Direction> for Position<F> {\n\n fn from(direction: Direction) -> Self {\n\n let (q, r) = match direction {\n\n Direction::YZ => (0.0, 1.0),\n\n Direction::XZ => (1.0, 0.0),\n\n Direction::XY => (1.0, -1.0),\n","file_path":"src/position.rs","rank":4,"score":27117.7573362584},{"content":"/// Fractional Position on 2d hexagonal grid\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Debug, Ord, PartialOrd)]\n\npub struct Position<F: Float = f32> {\n\n /// Axial `q` coordinate\n\n pub q: F,\n\n /// Axial `r` coordinate\n\n pub r: F,\n\n}\n\n\n\nimpl<F: Float> Position<F> {\n\n /// Create new Coordinate from `q` and `r` axial components.\n\n ///\n\n /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/#coordinates).\n\n pub fn from_axial(q: F, r: F) -> Position<F> {\n\n Position { q, r }\n\n }\n\n\n\n /// Create new Coordinate from `x`, `y`, and `z` cubic components.\n\n ///\n","file_path":"src/position.rs","rank":5,"score":27116.367767169577},{"content":"\n\n /// Round Position into the nearest Coordinate\n\n ///\n\n /// See [Coordinate::from_position](crate::Coordinate::from_position).\n\n /// See [Hex Rounding](https://www.redblobgames.com/grids/hexagons/implementation.html#rounding).\n\n pub fn into_coordinate<I: Integer>(&self) -> Coordinate<I> {\n\n Coordinate::from_position(*self)\n\n }\n\n}\n\n\n\nimpl<F: Float> From<(F, F)> for Position<F> {\n\n fn from(qr: (F, F)) -> Self {\n\n Position::from_axial(qr.0, qr.1)\n\n }\n\n}\n\n\n\nimpl<F: Float> From<(F, F, F)> for Position<F> {\n\n fn from(xyz: (F, F, F)) -> Self {\n\n Position::from_cubic(xyz.0, xyz.1, xyz.2)\n\n }\n","file_path":"src/position.rs","rank":6,"score":27115.364851213733},{"content":" /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/#coordinates).\n\n pub fn from_cubic(x: F, y: F, z: F) -> Position<F> {\n\n assert!(x + y + z == F::zero());\n\n Position { q: x, r: z }\n\n }\n\n\n\n /// Create Position from Hex Coordinate.\n\n pub fn from_coordinate<I: Integer>(coordinate: Coordinate<I>) -> Position<F> {\n\n Position {\n\n q: F::from(coordinate.q).unwrap(),\n\n r: F::from(coordinate.r).unwrap(),\n\n }\n\n }\n\n\n\n /// Convert a cartesian point into a hex position. The origin of the cartesian space is the\n\n /// center of the hex at (0,0) in hex coordinates.\n\n ///\n\n /// See [Screen to Hex](https://www.redblobgames.com/grids/hexagons/implementation.html#pixel-to-hex).\n\n pub fn from_cartesian(x: F, y: F, spacing: Spacing<F>) -> Position<F> {\n\n let f2: F = F::from(2).unwrap();\n","file_path":"src/position.rs","rank":7,"score":27111.949439554457},{"content":"\n\n fn mul(self, rhs: F) -> Self {\n\n Position {\n\n q: self.q * rhs,\n\n r: self.r * rhs,\n\n }\n\n }\n\n}\n\n\n\nimpl<F: Float> std::ops::Neg for Position<F> {\n\n type Output = Position<F>;\n\n\n\n fn neg(self) -> Self {\n\n Position {\n\n q: -self.q,\n\n r: -self.r,\n\n }\n\n }\n\n}\n","file_path":"src/position.rs","rank":8,"score":27111.876326973434},{"content":" r: self.r + p.r,\n\n }\n\n }\n\n}\n\n\n\nimpl<F: Float, T: Into<Position<F>>> std::ops::Sub<T> for Position<F> {\n\n type Output = Position<F>;\n\n\n\n fn sub(self, rhs: T) -> Self {\n\n let p: Position<_> = rhs.into();\n\n\n\n Position {\n\n q: self.q - p.q,\n\n r: self.r - p.r,\n\n }\n\n }\n\n}\n\n\n\nimpl<F: Float> std::ops::Mul<F> for Position<F> {\n\n type Output = Position<F>;\n","file_path":"src/position.rs","rank":9,"score":27111.61847880887},{"content":" pub fn y(&self) -> F {\n\n F::zero() - self.q - self.r\n\n }\n\n\n\n /// Cubic Hex `Z` coordinate\n\n pub fn z(&self) -> F {\n\n self.r\n\n }\n\n\n\n /// Distance from Origin\n\n pub fn length(&self) -> F {\n\n (self.x().abs() + self.y().abs() + self.z().abs()) / F::from_f64(2.0).unwrap()\n\n }\n\n\n\n /// Distance between two Positions in Hex Space\n\n pub fn distance(&self, position: Position<F>) -> F {\n\n (self.x() - position.x()).abs()\n\n + (self.y() - position.y()).abs()\n\n + (self.z() - position.z()).abs() / F::from_f64(2.0).unwrap()\n\n }\n","file_path":"src/position.rs","rank":10,"score":27111.50614907242},{"content":" let f3: F = F::from(3).unwrap();\n\n let f3s: F = f3.sqrt();\n\n\n\n match spacing {\n\n Spacing::PointyTop(size) => Position {\n\n q: (x * f3s / f3 - y / f3) / size,\n\n r: (y * f2 / f3) / size,\n\n },\n\n Spacing::FlatTop(size) => Position {\n\n q: (x * f2 / f3) / size,\n\n r: (-x / f3 + f3s / f3 * y) / size,\n\n },\n\n }\n\n }\n\n\n\n /// Convert Position into Cartesian coordinates with their origin at (0, 0).\n\n ///\n\n /// See [Hex to Pixel](https://www.redblobgames.com/grids/hexagons/#hex-to-pixel).\n\n pub fn into_cartesian(&self, spacing: Spacing<F>) -> (F, F) {\n\n let f2: F = F::from(2).unwrap();\n","file_path":"src/position.rs","rank":11,"score":27110.815518170366},{"content":" Direction::ZY => (0.0, -1.0),\n\n Direction::ZX => (-1.0, 0.0),\n\n Direction::YX => (-1.0, 1.0),\n\n };\n\n\n\n Position {\n\n q: F::from(q).unwrap(),\n\n r: F::from(r).unwrap(),\n\n }\n\n }\n\n}\n\n\n\nimpl<F: Float, T: Into<Position<F>>> std::ops::Add<T> for Position<F> {\n\n type Output = Position<F>;\n\n\n\n fn add(self, rhs: T) -> Self {\n\n let p: Position<_> = rhs.into();\n\n\n\n Position {\n\n q: self.q + p.q,\n","file_path":"src/position.rs","rank":12,"score":27110.733118947},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n// See LICENSE file for more information\n\n//\n\n\n\nuse crate::{Bearing, Coordinate, Direction, Float, Integer, Spacing};\n\n\n","file_path":"src/position.rs","rank":13,"score":27106.011961710083},{"content":" let f3: F = F::from(3).unwrap();\n\n let f3s: F = f3.sqrt();\n\n match spacing {\n\n Spacing::FlatTop(size) => (\n\n size * (f3 / f2 * self.q),\n\n size * (f3s / f2 * self.q + f3s * self.r),\n\n ),\n\n Spacing::PointyTop(size) => (\n\n size * (f3s * self.q + f3s / f2 * self.r),\n\n size * (f3 / f2 * self.r),\n\n ),\n\n }\n\n }\n\n\n\n /// Cubic Hex `X` coordinate\n\n pub fn x(&self) -> F {\n\n self.q\n\n }\n\n\n\n /// Cubic Hex `Y` coordinate\n","file_path":"src/position.rs","rank":14,"score":27105.708744740332},{"content":" pub fn into_position<F: Float>(&self) -> Position<F> {\n\n Position::from_coordinate(*self)\n\n }\n\n\n\n /// Find the hex containing a pixel. The origin of the pixel coordinates\n\n /// is the center of the hex at (0,0) in hex coordinates.\n\n ///\n\n\n\n pub fn from_cartesian<F: Float>(x: F, y: F, spacing: Spacing<F>) -> Coordinate<I> {\n\n Coordinate::from_position(Position::from_cartesian(x, y, spacing))\n\n }\n\n\n\n /// Convert integer pixel coordinates `v` using `spacing` to nearest coordinate that has both\n\n /// integer pixel coordinates lower or equal to `v`. Also return offset (in integer pixels)\n\n /// from that coordinate.\n\n ///\n\n /// Useful for ASCII visualization. Shamelessly stolen from [Hex2d](https://github.com/dpc/hex2d-rs).\n\n pub fn nearest_with_offset(spacing: IntegerSpacing<I>, v: (I, I)) -> (Coordinate<I>, (I, I)) {\n\n let (asc_x, asc_y) = v;\n\n\n","file_path":"src/coordinate.rs","rank":22,"score":21.05414917119542},{"content":"pub use self::sextant::Sextant;\n\npub use self::spacing::{IntegerSpacing, Spacing};\n\npub use self::sparse::SparseHexStorage;\n\npub use self::spin::Spin;\n\npub use self::spiral::Spiral;\n\npub use self::types::{Float, Integer};\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::Angle::*;\n\n use crate::Direction::*;\n\n use crate::*;\n\n\n\n fn with_test_points<F: Fn(Coordinate) -> ()>(f: F) {\n\n let offs = [-2i32, -1, 0, 1, 2, 1000, -1000, 1001, -1001];\n\n for &x in offs.iter() {\n\n for &y in offs.iter() {\n\n let p = Coordinate::from_axial(x, y);\n\n f(p)\n\n }\n","file_path":"src/lib.rs","rank":23,"score":21.012708988524643},{"content":"/// Iterator over an range\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub struct RangeIter<I: Integer> {\n\n source: Coordinate<I>,\n\n q: I,\n\n r: I,\n\n radius: I,\n\n counter: usize,\n\n}\n\n\n\nimpl<I: Integer> RangeIter<I> {\n\n /// Create a new Range Iterator\n\n pub(crate) fn new(origin: &Coordinate<I>, radius: I) -> RangeIter<I> {\n\n RangeIter {\n\n source: origin.clone(),\n\n q: -radius,\n\n r: max(-radius, -(-radius) - radius),\n\n radius,\n\n counter: 0,\n","file_path":"src/range.rs","rank":24,"score":20.02790813093142},{"content":" self.layer\n\n }\n\n /// Get final radius of the `Spiral`\n\n pub fn radius(&self) -> I {\n\n self.radius\n\n }\n\n}\n\n\n\nimpl<I: Integer> Iterator for Spiral<I> {\n\n type Item = Coordinate<I>;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n // Iterator has fused and finished the Spiral, will return None forevermore.\n\n if self.fuse {\n\n return None;\n\n }\n\n\n\n // If current layer is zero, return origin.\n\n // If radius is also zero, then fuse.\n\n if self.layer.is_zero() {\n","file_path":"src/spiral.rs","rank":25,"score":19.584850922542604},{"content":" }\n\n}\n\n\n\nimpl<I: Integer> Iterator for Ring<I> {\n\n type Item = Coordinate<I>;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n if self.fuse {\n\n return None;\n\n }\n\n if self.r.is_zero() {\n\n self.fuse = true;\n\n return Some(self.origin);\n\n }\n\n\n\n if self.jj >= self.r.abs() {\n\n self.ii += I::one();\n\n if self.ii >= I::from_u8(6).unwrap() {\n\n self.fuse = true;\n\n return None;\n","file_path":"src/ring.rs","rank":26,"score":17.897799739662837},{"content":" q: I::from(q).unwrap(),\n\n r: I::from(r).unwrap(),\n\n }\n\n }\n\n\n\n /// Round x, y float to nearest hex coordinates.\n\n ///\n\n /// Return None, if exactly on the border of two hex coordinates\n\n pub fn from_position_lossy<F: Float>(position: Position<F>) -> Option<Coordinate<I>> {\n\n let mut q = position.q;\n\n let mut r = position.r;\n\n let s = F::zero() - position.q - position.r;\n\n\n\n let q_diff = (q.round() - q).abs();\n\n let r_diff = (r.round() - r).abs();\n\n let s_diff = (s.round() - s).abs();\n\n\n\n if q_diff > r_diff && q_diff > s_diff {\n\n q = F::zero() - r - s;\n\n } else if r_diff > s_diff {\n","file_path":"src/coordinate.rs","rank":27,"score":17.72408163997144},{"content":"impl<I: Integer> From<(I, I)> for Coordinate<I> {\n\n fn from(qr: (I, I)) -> Self {\n\n Coordinate::from_axial(qr.0, qr.1)\n\n }\n\n}\n\n\n\nimpl<I: Integer> From<(I, I, I)> for Coordinate<I> {\n\n fn from(xyz: (I, I, I)) -> Self {\n\n Coordinate::from_cubic(xyz.0, xyz.1, xyz.2)\n\n }\n\n}\n\n\n\nimpl<I: Integer, F: Float> From<Position<F>> for Coordinate<I> {\n\n fn from(position: Position<F>) -> Self {\n\n Coordinate::from_position(position)\n\n }\n\n}\n\n\n\nimpl<I: Integer> From<Bearing<I>> for Coordinate<I> {\n\n fn from(bearing: Bearing<I>) -> Self {\n","file_path":"src/coordinate.rs","rank":28,"score":17.488919907912173},{"content":"#[derive(Copy, Clone, PartialEq, Debug, PartialOrd)]\n\npub enum Spacing<F: Float = f32> {\n\n /// Hex-grid with an edge on top\n\n FlatTop(F),\n\n /// Hex-grid with a corner on top\n\n PointyTop(F),\n\n}\n\n\n\n/// Integer pixel tile size for integer pixel conversion functions\n\n///\n\n/// Example values that give good results:\n\n///\n\n/// * FlatTop(3, 2)\n\n/// * PointyTop(2, 1)\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Debug, Hash, Ord, PartialOrd)]\n\npub enum IntegerSpacing<I: Integer> {\n\n /// Hex-grid with an edge on top\n\n FlatTop(I, I),\n\n /// Hex-grid with a corner on top\n\n PointyTop(I, I),\n\n}\n","file_path":"src/spacing.rs","rank":29,"score":16.51399857596835},{"content":"/// ### Ring Iteration Pattern:\n\n/// ```rust\n\n/// use hexgrid::{Coordinate, Spin, Direction};\n\n///\n\n/// for location in Coordinate::from_axial(0, 0).ring_iter(5, Spin::CW(Direction::YZ)) {\n\n/// assert_eq!(location.distance(Coordinate::from_axial(0,0)), 5);\n\n/// }\n\n/// ```\n\n#[doc = include_str!(\"ring.svg\")]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub struct Ring<I: Integer> {\n\n origin: Coordinate<I>,\n\n current: Bearing<I>,\n\n step_angle: Angle,\n\n r: I,\n\n ii: I,\n\n jj: I,\n\n fuse: bool,\n\n}\n","file_path":"src/ring.rs","rank":30,"score":16.362700532782235},{"content":"#[doc = include_str!(\"spiral.svg\")]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub struct Spiral<I: Integer> {\n\n origin_coordinate: Coordinate<I>,\n\n current_coordinate: Coordinate<I>,\n\n current_direction: Direction,\n\n start_direction: Direction,\n\n step_angle: Angle,\n\n radius: I,\n\n layer: I,\n\n idx: I,\n\n ii: I,\n\n jj: I,\n\n fuse: bool,\n\n}\n\n\n\nimpl<I: Integer> Spiral<I> {\n\n pub(crate) fn new(origin: Coordinate<I>, radius: I, spin: Spin) -> Spiral<I> {\n\n let (start_angle, step_angle, start_direction) = match spin {\n","file_path":"src/spiral.rs","rank":31,"score":15.461892439799058},{"content":"\n\n Coordinate { q: x, r: y }\n\n }\n\n\n\n /// Rotate `self` around a `center` using angle of rotation `a`\n\n pub fn rotate_around(&self, center: Coordinate<I>, a: Angle) -> Coordinate<I> {\n\n let rel_p = *self - center;\n\n let rot_p = rel_p.rotate_around_zero(a);\n\n rot_p + center\n\n }\n\n\n\n /// Iterator over each coordinate in straight line from `self` to `dest`\n\n pub fn line_iter(&self, target: Coordinate<I>) -> LineIter<I> {\n\n LineIter::new(LineGenIter::new(\n\n self.into_position(),\n\n target.into_position(),\n\n ))\n\n }\n\n\n\n /// Iterator over each coordinate in straight line from `self` to `dest`\n","file_path":"src/coordinate.rs","rank":32,"score":15.216192560317163},{"content":" }\n\n }\n\n}\n\n\n\nimpl<I: Integer> Iterator for RangeIter<I> {\n\n type Item = Coordinate<I>;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n if self.r > min(self.radius, -self.q + self.radius) {\n\n if self.q >= self.radius {\n\n return None;\n\n }\n\n self.q += One::one();\n\n self.r = max(-self.radius, -self.q - self.radius);\n\n }\n\n\n\n let ret = Some(Coordinate {\n\n q: self.source.q + self.q,\n\n r: self.source.r + self.r,\n\n });\n","file_path":"src/range.rs","rank":33,"score":15.210748172437835},{"content":"mod position;\n\nmod range;\n\nmod ring;\n\nmod sextant;\n\nmod spacing;\n\nmod sparse;\n\nmod spin;\n\nmod spiral;\n\nmod types;\n\n\n\npub use self::angle::Angle;\n\npub use self::bearing::Bearing;\n\npub use self::coordinate::Coordinate;\n\npub use self::direction::Direction;\n\npub use self::line::LineGenIter;\n\npub use self::line::{LineIter, LineIterWithEdgeDetection, LossyLineIter};\n\npub use self::offset::Offset;\n\npub use self::position::Position;\n\npub use self::range::RangeIter;\n\npub use self::ring::Ring;\n","file_path":"src/lib.rs","rank":34,"score":14.76543721474474},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n// See LICENSE file for more information\n\n//\n\n\n\n/// Coordinate Offset\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub struct Offset<N = i32> {\n\n /// `x` coordinate\n\n pub x: N,\n\n /// `y` coordinate\n\n pub y: N,\n\n}\n","file_path":"src/offset.rs","rank":35,"score":14.378968870402478},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{\n\n Angle, Bearing, Direction, Float, Integer, IntegerSpacing, LineGenIter, LineIter,\n\n LineIterWithEdgeDetection, LossyLineIter, Position, RangeIter, Ring, Spacing, Spin, Spiral,\n\n};\n","file_path":"src/coordinate.rs","rank":36,"score":14.129291305148802},{"content":" ///\n\n /// Skip points on the border of two tiles\n\n pub fn lossy_line_iter(&self, target: Coordinate<I>) -> LossyLineIter<I> {\n\n LossyLineIter::new(LineGenIter::new(\n\n self.into_position(),\n\n target.into_position(),\n\n ))\n\n }\n\n\n\n /// Iterator over each coordinate in straight line from `self` to `dest`\n\n ///\n\n /// On edge condition the pair contains different members, otherwise it's the same.\n\n pub fn line_iter_with_edge_detection(\n\n &self,\n\n target: Coordinate<I>,\n\n ) -> LineIterWithEdgeDetection<I> {\n\n LineIterWithEdgeDetection::new(LineGenIter::new(\n\n self.into_position(),\n\n target.into_position(),\n\n ))\n","file_path":"src/coordinate.rs","rank":37,"score":14.097054325347838},{"content":" 2 => Angle::RightBackward,\n\n 3 => Angle::Backward,\n\n 4 => Angle::LeftBackward,\n\n 5 => Angle::LeftForward,\n\n _ => panic!(),\n\n }\n\n }\n\n\n\n /// Convert angle to integer ordinal in [0, 6) range.\n\n pub fn to_int<I: Integer>(&self) -> I {\n\n I::from_u8(*self as u8).unwrap()\n\n }\n\n\n\n /// Convert to degrees from bearing.\n\n pub fn to_degree<F: Float>(&self) -> F {\n\n match self {\n\n Angle::Forward => F::from(0.0).unwrap(),\n\n Angle::RightForward => F::from(60.0).unwrap(),\n\n Angle::RightBackward => F::from(120.0).unwrap(),\n\n Angle::Backward => F::from(180.0).unwrap(),\n\n Angle::LeftBackward => F::from(240.0).unwrap(),\n\n Angle::LeftForward => F::from(300.0).unwrap(),\n\n }\n\n }\n\n}\n","file_path":"src/angle.rs","rank":38,"score":13.771195793390618},{"content":" /// use hexgrid::Angle;\n\n ///\n\n /// assert_eq!(Angle::all().len(), 6);\n\n /// ```\n\n pub fn all() -> &'static [Angle; 6] {\n\n &[\n\n Angle::Forward,\n\n Angle::RightForward,\n\n Angle::RightBackward,\n\n Angle::Backward,\n\n Angle::LeftBackward,\n\n Angle::LeftForward,\n\n ]\n\n }\n\n\n\n /// Create Angle from integer ordinal in [0, 6) range.\n\n pub fn from_int<I: Integer>(i: I) -> Angle {\n\n match i.mod_floor(&I::from_u8(6).unwrap()).to_u8().unwrap() {\n\n 0 => Angle::Forward,\n\n 1 => Angle::RightForward,\n","file_path":"src/angle.rs","rank":40,"score":12.833195075000315},{"content":" 5 => Direction::YX,\n\n _ => panic!(),\n\n }\n\n }\n\n\n\n /// Convert to integer in [0, 6) range\n\n ///\n\n /// This should probably be internal\n\n pub fn to_int<I: Integer>(&self) -> I {\n\n I::from_u8(*self as u8).unwrap()\n\n }\n\n\n\n /// Convert to angle for pointy-topped map, in radians, grows clockwise, 0.0 points up\n\n pub fn to_radians_pointy<T: Float>(&self) -> T {\n\n use std::f64::consts::PI;\n\n T::from(match *self {\n\n Direction::XZ => PI * (0.5 / 3.0),\n\n Direction::XY => PI * (1.5 / 3.0),\n\n Direction::ZY => PI * (2.5 / 3.0),\n\n Direction::ZX => PI * (3.5 / 3.0),\n","file_path":"src/direction.rs","rank":41,"score":12.736735916241155},{"content":"\n\nimpl<I: Integer, D> IntoIterator for SparseHexStorage<I, D> {\n\n type Item = (Coordinate<I>, D);\n\n type IntoIter = std::collections::hash_map::IntoIter<Coordinate<I>, D>;\n\n\n\n fn into_iter(self) -> Self::IntoIter {\n\n self.0.into_iter()\n\n }\n\n}\n","file_path":"src/sparse.rs","rank":42,"score":12.617209890862148},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Float, Integer};\n\n\n\n/// Floating point tile size for pixel conversion functions\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n","file_path":"src/spacing.rs","rank":43,"score":12.460898000149712},{"content":" /// See [Hex Rounding](https://www.redblobgames.com/grids/hexagons/implementation.html#rounding)\n\n pub fn from_position<F: Float>(position: Position<F>) -> Coordinate<I> {\n\n let mut q = position.q;\n\n let mut r = position.r;\n\n let s = F::zero() - position.q - position.r;\n\n\n\n let q_diff = (q.round() - q).abs();\n\n let r_diff = (r.round() - r).abs();\n\n let s_diff = (s.round() - s).abs();\n\n\n\n if q_diff > r_diff && q_diff > s_diff {\n\n q = F::zero() - r - s;\n\n } else if r_diff > s_diff {\n\n r = F::zero() - q - s;\n\n } else {\n\n // Not Needed with axial coordinate math\n\n // s = F::zero() - q - r;\n\n }\n\n\n\n Coordinate {\n","file_path":"src/coordinate.rs","rank":44,"score":12.264339092170959},{"content":"#[doc = include_str!(\"bearing.svg\")]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub struct Bearing<I: Integer = i32> {\n\n /// Coordinate\n\n pub coordinate: Coordinate<I>,\n\n /// Direction\n\n pub direction: Direction,\n\n}\n\n\n\nimpl<I: Integer> Bearing<I> {\n\n /// Create a new Bearing from Coordinate and Direction\n\n pub fn new(coordinate: Coordinate<I>, direction: Direction) -> Bearing<I> {\n\n Bearing {\n\n coordinate,\n\n direction,\n\n }\n\n }\n\n}\n\n\n","file_path":"src/bearing.rs","rank":45,"score":11.951391768641418},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Float, Integer};\n\n\n\n/// Angle, relative to a Direction\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n","file_path":"src/angle.rs","rank":46,"score":11.902961239985695},{"content":"\n\n/// Integer Coordinate on 2d hexagonal grid\n\n///\n\n/// Coordinate Components (Cubic -> Axial):\n\n/// * x -> q\n\n/// * y -> -q - r\n\n/// * z -> r\n\n///\n\n/// ## Hex Orientations\n\n/// ### Flat Topped:\n\n#[doc = include_str!(\"flat.svg\")]\n\n/// ### Pointy Topped:\n\n#[doc = include_str!(\"pointy.svg\")]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Default, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub struct Coordinate<I: Integer = i32> {\n\n /// `q` coordinate\n\n pub q: I,\n\n /// `r` coordinate\n\n pub r: I,\n","file_path":"src/coordinate.rs","rank":47,"score":11.884561802221116},{"content":" (coord, (qo, ro))\n\n }\n\n\n\n /// Convert center point to cartesian coordinates using `spacing`, where the size parameter\n\n /// is the edge length of a hexagon.\n\n ///\n\n /// This function is meant for graphical user interfaces where resolution is big enough that\n\n /// floating point calculation make sense.\n\n ///\n\n /// See [Hex to Screen](https://www.redblobgames.com/grids/hexagons/implementation.html#hex-to-pixel)\n\n pub fn cartesian_center<F: Float>(&self, spacing: Spacing<F>) -> (F, F) {\n\n let f2: F = F::from(2).unwrap();\n\n let f3: F = F::from(3).unwrap();\n\n let f3s: F = f3.sqrt();\n\n let q: F = F::from(self.q).unwrap();\n\n let r: F = F::from(self.r).unwrap();\n\n\n\n match spacing {\n\n Spacing::FlatTop(size) => (size * (f3 / f2 * q), size * (f3s / f2 * q + f3s * r)),\n\n Spacing::PointyTop(size) => (size * (f3s * q + f3s / f2 * r), size * (f3 / f2 * r)),\n","file_path":"src/coordinate.rs","rank":48,"score":11.784292201028094},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Angle, Coordinate, Direction, Integer, Spin};\n\nuse std::usize;\n\n\n\n/// Iterates through all hexes in a hexagonal shaped spiral pattern.\n","file_path":"src/spiral.rs","rank":49,"score":11.044065187765721},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Angle, Bearing, Coordinate, Integer, Spin};\n\nuse std::cmp::max;\n\n\n\n/// Iterates in a ring around an origin at provided radius.\n","file_path":"src/ring.rs","rank":50,"score":10.936829509123628},{"content":" ret\n\n }\n\n\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n\n if self.fuse {\n\n return (0, Some(0));\n\n }\n\n\n\n let total_size: usize = (0..=self.radius.to_usize().unwrap())\n\n .map(|layer| if layer == 0 { 1 } else { layer * 6 })\n\n .sum();\n\n let remaining = total_size - self.idx.to_usize().unwrap();\n\n\n\n (remaining, Some(remaining))\n\n }\n\n}\n\n\n\nimpl<I: Integer> std::iter::FusedIterator for Spiral<I> {}\n\nimpl<I: Integer> std::iter::ExactSizeIterator for Spiral<I> {}\n","file_path":"src/spiral.rs","rank":51,"score":10.795557403051422},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::Direction;\n\n\n\n/// Spin Direction\n\n#[doc = include_str!(\"spin.svg\")]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub enum Spin {\n\n /// Clockwise\n\n CW(Direction),\n\n /// Counterclockwise\n\n CCW(Direction),\n\n}\n","file_path":"src/spin.rs","rank":52,"score":10.773474863546875},{"content":" I::to_usize(&(self.r * I::from_u8(6).unwrap())).unwrap()\n\n };\n\n let past: usize =\n\n num::ToPrimitive::to_usize(max(&I::zero(), &(self.jj + self.ii * self.r))).unwrap();\n\n (total_size - past, Some(total_size - past))\n\n }\n\n}\n\n\n\nimpl<I: Integer> std::iter::FusedIterator for Ring<I> {}\n\nimpl<I: Integer> std::iter::ExactSizeIterator for Ring<I> {}\n","file_path":"src/ring.rs","rank":53,"score":10.665169317120885},{"content":" #[doc = include_str!(\"ring.svg\")]\n\n ///\n\n /// ```\n\n ///\n\n /// use hexgrid::{Coordinate, Spin, Direction};\n\n ///\n\n /// let center = Coordinate::from_axial(5, -1);\n\n ///\n\n /// for &c in ¢er.neighbors() {\n\n /// for ring_c in c.ring_iter(5, Spin::CCW(Direction::XY)) {\n\n /// assert_eq!(c.distance(ring_c), 5);\n\n /// }\n\n /// }\n\n /// ```\n\n pub fn ring_iter(&self, radius: I, spin: Spin) -> Ring<I> {\n\n Ring::new(self, radius, spin)\n\n }\n\n\n\n /// Iterates in a spiral around an origin out to the supplied radius.\n\n ///\n","file_path":"src/coordinate.rs","rank":54,"score":10.534652340729089},{"content":" }\n\n\n\n /// Direction from center `(0, 0)` to coordinate\n\n ///\n\n /// In case of diagonals (edge of two major directions), prefers direction that is clockwise\n\n /// from the diagonal\n\n ///\n\n /// Returns:\n\n /// None if is center\n\n ///\n\n pub fn direction_from_center_cw(&self) -> Option<Direction> {\n\n let x = self.x();\n\n let y = self.y();\n\n let z = self.z();\n\n\n\n let xz = if y < I::zero() { x >= z } else { x > z };\n\n let zy = if x < I::zero() { z >= y } else { z > y };\n\n let yx = if z < I::zero() { y >= x } else { y > x };\n\n\n\n match (xz, zy, yx) {\n","file_path":"src/coordinate.rs","rank":55,"score":10.498751703215468},{"content":" self.r += One::one();\n\n self.counter += 1;\n\n ret\n\n }\n\n\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n\n let rc = (if self.radius < Zero::zero() {\n\n I::one() - self.radius\n\n } else {\n\n self.radius\n\n })\n\n .to_usize()\n\n .unwrap();\n\n let total_size = 3 * (rc + rc * rc) + 1;\n\n let current_size = total_size - self.counter;\n\n (current_size, Some(current_size))\n\n }\n\n}\n\n\n\nimpl<I: Integer> std::iter::FusedIterator for RangeIter<I> {}\n\nimpl<I: Integer> std::iter::ExactSizeIterator for RangeIter<I> {}\n","file_path":"src/range.rs","rank":56,"score":10.3556871496485},{"content":"\n\n /// Cubic `Y` component.\n\n pub fn y(&self) -> I {\n\n I::zero() - self.q - self.r\n\n }\n\n\n\n /// Cubic `Z` component.\n\n pub fn z(&self) -> I {\n\n self.r\n\n }\n\n\n\n /// Distance from Origin\n\n pub fn length(&self) -> I {\n\n let q = self.q.abs();\n\n let r = self.r.abs();\n\n let s = (I::zero() - self.q - self.r).abs();\n\n (q + r + s) / I::from_u8(2).unwrap()\n\n }\n\n\n\n /// Convert Coordinate into fractional [Position](crate::Position).\n","file_path":"src/coordinate.rs","rank":57,"score":9.889491744380535},{"content":" r = F::zero() - q - s;\n\n } else {\n\n // Not necessary with axial coordinate math\n\n // s = F::zero() - q - r;\n\n }\n\n\n\n if q_diff + r_diff + s_diff > F::from(0.99).unwrap() {\n\n None\n\n } else {\n\n Some(Coordinate {\n\n q: I::from(q).unwrap(),\n\n r: I::from(r).unwrap(),\n\n })\n\n }\n\n }\n\n\n\n /// Cubic `X` component.\n\n pub fn x(&self) -> I {\n\n self.q\n\n }\n","file_path":"src/coordinate.rs","rank":58,"score":9.552260408907381},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::spin::Spin;\n\nuse crate::{Angle, Bearing, Float, Integer};\n\nuse std::fmt::Formatter;\n\n\n","file_path":"src/direction.rs","rank":59,"score":9.393622191646601},{"content":" }\n\n }\n\n\n\n /// Create a set of ordered cartesian points to draw a hex.\n\n ///\n\n /// Reference:\n\n /// [Layout](https://www.redblobgames.com/grids/hexagons/implementation.html#layout)\n\n /// [Drawing a Hex](https://www.redblobgames.com/grids/hexagons/implementation.html#hex-geometry)\n\n pub fn to_corner_points<F: Float>(&self, spacing: Spacing<F>) -> [(F, F); 6] {\n\n let fz: F = F::zero();\n\n let fh: F = F::from(0.5).unwrap();\n\n let f2: F = F::from(2).unwrap();\n\n let f6: F = F::from(6).unwrap();\n\n let pi: F = F::from(std::f64::consts::PI).unwrap();\n\n let center: (F, F) = self.cartesian_center(spacing);\n\n let corner_offset = |i| {\n\n let corner = F::from_u8(i).unwrap();\n\n let (start_angle, size) = match spacing {\n\n Spacing::FlatTop(size) => (fz, size),\n\n Spacing::PointyTop(size) => (fh, size),\n","file_path":"src/coordinate.rs","rank":60,"score":9.369194631702056},{"content":"\n\n /// Direction from self to `coordinate`\n\n ///\n\n /// In case of diagonals (edge of two major directions), prefers direction that is clockwise\n\n /// from the diagonal.\n\n ///\n\n /// Returns:\n\n /// None if is center\n\n pub fn direction_to_cw(&self, coordinate: Coordinate<I>) -> Option<Direction> {\n\n (coordinate - *self).direction_from_center_cw()\n\n }\n\n\n\n /// Direction from self to `coordinate`\n\n ///\n\n /// In case of diagonals (edge of two major directions), prefers direction that is\n\n /// counter-clockwise from the diagonal.\n\n ///\n\n /// Returns:\n\n /// None if is center\n\n pub fn direction_to_ccw(&self, coordinate: Coordinate<I>) -> Option<Direction> {\n","file_path":"src/coordinate.rs","rank":61,"score":9.208017424932146},{"content":" /// Example: Elements in order for all rings from radius 0 to radius 2, Direction ZX, CCW\n\n ///\n\n /// ### Ring Iteration Pattern:\n\n #[doc = include_str!(\"spiral.svg\")]\n\n /// ```rust\n\n /// use hexgrid::{Coordinate, Spin, Direction};\n\n ///\n\n /// let locations = Coordinate::from_axial(0, 0).spiral_iter(2, Spin::CW(Direction::YZ)).collect::<Vec<_>>();\n\n ///\n\n /// assert_eq!(locations.len(), 19);\n\n /// assert_eq!(locations[0].distance(Coordinate::from_axial(0,0)), 0);\n\n /// assert_eq!(locations[1].distance(Coordinate::from_axial(0,0)), 1);\n\n /// assert_eq!(locations[7].distance(Coordinate::from_axial(0,0)), 2);\n\n ///\n\n /// ```\n\n pub fn spiral_iter(&self, radius: I, spin: Spin) -> Spiral<I> {\n\n Spiral::new(*self, radius, spin)\n\n }\n\n}\n\n\n","file_path":"src/coordinate.rs","rank":62,"score":9.166604948544723},{"content":"\n\nimpl<I: Integer> Ring<I> {\n\n pub(crate) fn new(origin: &Coordinate<I>, radius: I, spin: Spin) -> Ring<I> {\n\n let (start_angle, step_angle, start_dir) = match spin {\n\n Spin::CW(d) => (\n\n if radius >= I::zero() {\n\n Angle::RightBackward\n\n } else {\n\n Angle::LeftForward\n\n },\n\n Angle::RightForward,\n\n d,\n\n ),\n\n Spin::CCW(d) => (\n\n if radius >= I::zero() {\n\n Angle::LeftBackward\n\n } else {\n\n Angle::RightForward\n\n },\n\n Angle::LeftForward,\n","file_path":"src/ring.rs","rank":63,"score":9.102789519413921},{"content":" (coordinate - *self).direction_from_center_ccw()\n\n }\n\n\n\n /// Distance between two Coordinates\n\n pub fn distance(&self, coordinate: Coordinate<I>) -> I {\n\n ((self.x() - coordinate.x()).abs()\n\n + (self.y() - coordinate.y()).abs()\n\n + (self.z() - coordinate.z()).abs())\n\n / I::from_i8(2).unwrap()\n\n }\n\n\n\n /// An iterator over all coordinates in radius `r`\n\n pub fn range_iter(&self, radius: I) -> RangeIter<I> {\n\n RangeIter::new(self, radius)\n\n }\n\n\n\n /// Iterates in a ring around an origin at provided radius.\n\n ///\n\n /// Example: Elements in order for Ring of radius 2, Direction YZ, CW\n\n ///\n","file_path":"src/coordinate.rs","rank":64,"score":9.088699401579964},{"content":"\n\n fn sub(self, c: T) -> Angle {\n\n let c: Direction = c.into();\n\n\n\n Angle::from_int::<i8>(self.to_int::<i8>() - c.to_int::<i8>())\n\n }\n\n}\n\n\n\nimpl From<Spin> for Direction {\n\n fn from(spin: Spin) -> Self {\n\n match spin {\n\n Spin::CW(d) => d,\n\n Spin::CCW(d) => d,\n\n }\n\n }\n\n}\n\n\n\nimpl<I: Integer> From<Bearing<I>> for Direction {\n\n fn from(bearing: Bearing<I>) -> Self {\n\n bearing.direction\n","file_path":"src/direction.rs","rank":65,"score":8.530381950229028},{"content":"\n\n match spacing {\n\n IntegerSpacing::FlatTop(w, h) => (w * q, h * (r + r + q) / two),\n\n IntegerSpacing::PointyTop(w, h) => (w * (q + q + r) / two, h * r),\n\n }\n\n }\n\n\n\n /// Scale coordinate by a factor `scalar`\n\n ///\n\n /// See [Coordinate arithmetic](https://www.redblobgames.com/grids/hexagons/implementation.html#hex-arithmetic)\n\n pub fn scale(&self, scalar: I) -> Coordinate<I> {\n\n let q = self.q * scalar;\n\n let r = self.r * scalar;\n\n Coordinate { q, r }\n\n }\n\n\n\n /// Array with all the neighbors of a coordinate\n\n pub fn neighbors(&self) -> [Coordinate<I>; 6] {\n\n [\n\n *self + Direction::XZ,\n","file_path":"src/coordinate.rs","rank":66,"score":8.296950627271356},{"content":" bearing.coordinate\n\n }\n\n}\n\n\n\nimpl<I: Integer> From<Direction> for Coordinate<I> {\n\n fn from(direction: Direction) -> Self {\n\n let (x, y) = match direction {\n\n Direction::YZ => (0, -1),\n\n Direction::XZ => (1, -1),\n\n Direction::XY => (1, 0),\n\n Direction::ZY => (0, 1),\n\n Direction::ZX => (-1, 1),\n\n Direction::YX => (-1, 0),\n\n };\n\n\n\n Coordinate {\n\n q: I::from_i8(x).unwrap(),\n\n r: I::from_i8(y).unwrap(),\n\n }\n\n }\n","file_path":"src/coordinate.rs","rank":67,"score":8.048631972838063},{"content":" &[\n\n Direction::YZ,\n\n Direction::XZ,\n\n Direction::XY,\n\n Direction::ZY,\n\n Direction::ZX,\n\n Direction::YX,\n\n ]\n\n }\n\n\n\n /// Return a vector of an arc including Directions `steps` away from the original Direction both\n\n /// sides from left to right.\n\n ///\n\n /// ```\n\n /// use hexgrid::{Direction};\n\n /// use hexgrid::Angle::*;\n\n ///\n\n /// for &d in Direction::all() {\n\n /// assert_eq!(d.arc(0), vec!(d));\n\n /// assert_eq!(d.arc(1), vec!(d + LeftForward, d, d + RightForward));\n","file_path":"src/direction.rs","rank":68,"score":8.01646825175593},{"content":" XZ,\n\n /// +X -Y\n\n XY,\n\n /// +Z -Y\n\n ZY,\n\n /// +Z -X\n\n ZX,\n\n /// +Y -X\n\n YX,\n\n}\n\n\n\nimpl Direction {\n\n /// Static array of all directions\n\n ///\n\n /// ```\n\n /// use hexgrid::Direction;\n\n ///\n\n /// assert_eq!(Direction::all().len(), 6);\n\n /// ```\n\n pub fn all() -> &'static [Direction; 6] {\n","file_path":"src/direction.rs","rank":69,"score":8.003390953393897},{"content":"///\n\n/// ### Flat Topped:\n\n#[doc = include_str!(\"flat.svg\")]\n\n/// ### Pointy Topped:\n\n#[doc = include_str!(\"pointy.svg\")]\n\n#[derive(Debug, Ord, PartialOrd, Eq, PartialEq, Copy, Clone, Hash)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub enum Sextant {\n\n /// YZ Sextant\n\n YZ,\n\n /// XZ Sextant\n\n XZ,\n\n /// XY Sextant\n\n XY,\n\n /// ZY Sextant\n\n ZY,\n\n /// ZX Sextant\n\n ZX,\n\n /// YX Sextant\n\n YX,\n","file_path":"src/sextant.rs","rank":70,"score":7.880418730839613},{"content":"#[derive(Clone, Debug, Default)]\n\npub struct SparseHexStorage<I: Integer, D>(HashMap<Coordinate<I>, D>);\n\n\n\nimpl<I: Integer, D> SparseHexStorage<I, D> {\n\n /// Set Contents of Hex.\n\n pub fn set(&mut self, coordinate: &Coordinate<I>, data: D) {\n\n self.0.insert(coordinate.clone(), data);\n\n }\n\n /// Get contents of hex.\n\n pub fn get(&self, coordinate: &Coordinate<I>) -> Option<&D> {\n\n self.0.get(&coordinate)\n\n }\n\n /// Get contents of hex mutably.\n\n pub fn get_mut(&mut self, coordinate: &Coordinate<I>) -> Option<&mut D> {\n\n self.0.get_mut(&coordinate)\n\n }\n\n /// Get contents of hex mutably, calling f if data doesn't exist.\n\n pub fn get_mut_or_insert(\n\n &mut self,\n\n coordinate: &Coordinate<I>,\n","file_path":"src/sparse.rs","rank":71,"score":7.825564338670303},{"content":" *self + Angle::LeftBackward,\n\n *self + Angle::LeftForward,\n\n *self,\n\n *self + Angle::RightForward,\n\n *self + Angle::RightBackward,\n\n *self + Angle::Backward,\n\n ],\n\n }\n\n }\n\n\n\n /// Create Direction from integer in [0, 6) range\n\n ///\n\n /// This should probably be internal\n\n pub fn from_int<I: Integer>(i: I) -> Direction {\n\n match i.mod_floor(&I::from_i8(6).unwrap()).to_u8().unwrap() {\n\n 0 => Direction::YZ,\n\n 1 => Direction::XZ,\n\n 2 => Direction::XY,\n\n 3 => Direction::ZY,\n\n 4 => Direction::ZX,\n","file_path":"src/direction.rs","rank":72,"score":7.7264097922949215},{"content":" };\n\n let angle = f2 * pi * (start_angle + corner) / f6;\n\n (center.0 + size * angle.cos(), center.1 + size * angle.sin())\n\n };\n\n [\n\n corner_offset(0),\n\n corner_offset(1),\n\n corner_offset(2),\n\n corner_offset(3),\n\n corner_offset(4),\n\n corner_offset(5),\n\n ]\n\n }\n\n\n\n /// Convert to integer pixel coordinates using `spacing`, where the\n\n /// parameters mean the width and height multiplications\n\n pub fn to_pixel_integer(&self, spacing: IntegerSpacing<I>) -> (I, I) {\n\n let q = self.q;\n\n let r = self.z();\n\n let two = I::from_i8(2).unwrap();\n","file_path":"src/coordinate.rs","rank":73,"score":7.709434126598554},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Coordinate, Integer};\n\nuse num::{One, Zero};\n\nuse std::cmp::{max, min};\n\n\n","file_path":"src/range.rs","rank":74,"score":7.423104903020796},{"content":"/// Cubic Direction on a hexagonal map.\n\n///\n\n/// See [Coordinate](crate::Coordinate) for graph with directions.\n\n///\n\n/// Naming convention: increasing coordinate for a given direction is first\n\n/// decreasing is second. The missing coordinate is unaffected by a move in\n\n/// a given direction.\n\n///\n\n/// ## Hex Orientations\n\n/// ### Flat Topped:\n\n#[doc = include_str!(\"flat.svg\")]\n\n/// ### Pointy Topped:\n\n#[doc = include_str!(\"pointy.svg\")]\n\n///\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub enum Direction {\n\n /// +Y -Z\n\n YZ,\n\n /// +X -Z\n","file_path":"src/direction.rs","rank":75,"score":7.299406955977377},{"content":" *self + Direction::XY,\n\n *self + Direction::ZY,\n\n *self + Direction::ZX,\n\n *self + Direction::YX,\n\n *self + Direction::YZ,\n\n ]\n\n }\n\n\n\n /// Rotate self around a point `(0, 0, 0)` using angle of rotation `a`\n\n pub fn rotate_around_zero(&self, a: Angle) -> Coordinate<I> {\n\n let (x, y, z) = (self.q, self.r, self.z());\n\n\n\n let (x, y) = match a {\n\n Angle::Forward => (x, y),\n\n Angle::RightForward => (-z, -x),\n\n Angle::RightBackward => (y, z),\n\n Angle::Backward => (-x, -y),\n\n Angle::LeftBackward => (z, x),\n\n Angle::LeftForward => (-y, -z),\n\n };\n","file_path":"src/coordinate.rs","rank":76,"score":7.231335755024899},{"content":"}\n\n\n\nimpl<I: Integer> Coordinate<I> {\n\n /// Create new Coordinate from `q` and `r` axial components.\n\n ///\n\n /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/implementation.html#hex)\n\n pub fn from_axial(q: I, r: I) -> Coordinate<I> {\n\n Coordinate { q, r }\n\n }\n\n\n\n /// Create new Coordinate from `x`, `y`, and `z` cubic components.\n\n ///\n\n /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/implementation.html#hex)\n\n pub fn from_cubic(x: I, y: I, z: I) -> Coordinate<I> {\n\n assert!(x + y + z == I::zero());\n\n Coordinate { q: x, r: y }\n\n }\n\n\n\n /// Round position to nearest hex coordinates\n\n ///\n","file_path":"src/coordinate.rs","rank":77,"score":7.156904812849765},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Coordinate, Integer};\n\nuse std::collections::HashMap;\n\n\n\n/// Sparse Hex Grid Data Storage\n","file_path":"src/sparse.rs","rank":78,"score":7.122292588782389},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Coordinate, Integer};\n\n\n\n///\n\n/// Which slice of a hexgrid does a coordinate exist in.\n","file_path":"src/sextant.rs","rank":79,"score":6.897961893692591},{"content":"}\n\n\n\nimpl<I: Integer> From<Coordinate<I>> for Sextant {\n\n fn from(coordinate: Coordinate<I>) -> Self {\n\n match (\n\n coordinate.x() >= I::zero(),\n\n coordinate.y() >= I::zero(),\n\n coordinate.z() >= I::zero(),\n\n ) {\n\n (true, false, true) => Sextant::YZ,\n\n (true, false, false) => Sextant::XZ,\n\n (true, true, false) => Sextant::XY,\n\n (false, true, false) => Sextant::ZY,\n\n (false, true, true) => Sextant::ZX,\n\n (false, false, true) => Sextant::YX,\n\n _ => panic!(\"You Broke Math\"),\n\n }\n\n }\n\n}\n","file_path":"src/sextant.rs","rank":80,"score":6.8871551972380765},{"content":"//\n\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\nuse crate::{Angle, Coordinate, Direction, Integer};\n\n\n\n/// Coordinate and Directional Component Pair on a 2d hexagonal grid.\n\n///\n","file_path":"src/bearing.rs","rank":81,"score":6.7768688521555305},{"content":" (true, true, false) => Some(Direction::XZ),\n\n (true, false, false) => Some(Direction::XY),\n\n (true, false, true) => Some(Direction::ZY),\n\n\n\n (false, false, true) => Some(Direction::ZX),\n\n (false, true, true) => Some(Direction::YZ),\n\n (false, true, false) => Some(Direction::YX),\n\n\n\n (false, false, false) => None,\n\n (true, true, true) => panic!(\"You broke math\"),\n\n }\n\n }\n\n\n\n /// Directions that lead from center to a given point.\n\n ///\n\n /// Returns an array of one or two directions.\n\n pub fn directions_from_center(&self) -> Vec<Direction> {\n\n let x = self.x();\n\n let y = self.y();\n\n let z = self.z();\n","file_path":"src/coordinate.rs","rank":82,"score":6.553089419508272},{"content":" /// ```notrust\n\n /// use hexgrid::{Angle, Direction, Coordinate};\n\n ///\n\n /// let center = Coordinate::from_axial(0, 0);\n\n ///\n\n /// assert_eq!(center.direction_from_center_ccw(), None);\n\n ///\n\n /// for &d in Direction::all() {\n\n /// assert_eq!((center + d).direction_from_center_ccw(), Some(d));\n\n /// assert_eq!((center + d + (d + Angle::LeftForward)).direction_from_center_ccw(), Some(d + Angle::LeftForward));\n\n /// assert_eq!((center + d + (d + Angle::RightForward)).direction_from_center_ccw(), Some(d));\n\n /// }\n\n /// ```\n\n pub fn direction_from_center_ccw(&self) -> Option<Direction> {\n\n let x = self.x();\n\n let y = self.y();\n\n let z = self.z();\n\n\n\n let xz = if y > I::zero() { x >= z } else { x > z }; // t\n\n let zy = if x > I::zero() { z >= y } else { z > y }; // f\n","file_path":"src/coordinate.rs","rank":83,"score":6.465019876934501},{"content":" let yx = if z > I::zero() { y >= x } else { y > x }; // f\n\n\n\n match (xz, zy, yx) {\n\n (true, true, false) => Some(Direction::XZ),\n\n (true, false, false) => Some(Direction::XY),\n\n (true, false, true) => Some(Direction::ZY),\n\n\n\n (false, false, true) => Some(Direction::ZX),\n\n (false, true, true) => Some(Direction::YX),\n\n (false, true, false) => Some(Direction::YZ),\n\n\n\n (false, false, false) => None,\n\n (true, true, true) => panic!(\"You broke math\"),\n\n }\n\n }\n\n\n\n /// Directions from self to `coordinate`\n\n pub fn directions_to(&self, coordinate: Coordinate<I>) -> Vec<Direction> {\n\n (coordinate - *self).directions_from_center()\n\n }\n","file_path":"src/coordinate.rs","rank":84,"score":6.4009919326896085},{"content":" assert_eq!(1, ring.len());\n\n assert_eq!(ring[0], c);\n\n }\n\n {\n\n // CCW r0\n\n let ring = c.ring_iter(0, Spin::CCW(d)).collect::<Vec<_>>();\n\n\n\n assert_eq!(1, ring.len());\n\n assert_eq!(ring[0], c);\n\n }\n\n {\n\n // CCW r1\n\n let ring = c.ring_iter(1, Spin::CW(d)).collect::<Vec<_>>();\n\n\n\n assert_eq!(6, ring.len());\n\n assert_eq!(ring[0], c + d);\n\n assert_eq!(ring[1], c + (d + RightForward));\n\n assert_eq!(ring[2], c + (d + RightBackward));\n\n assert_eq!(ring[3], c + (d + Backward));\n\n assert_eq!(ring[4], c + (d + LeftBackward));\n","file_path":"src/lib.rs","rank":85,"score":6.35265433853515},{"content":" assert_eq!(c, Coordinate::from_cartesian(x, y, spacing));\n\n });\n\n }\n\n }\n\n\n\n #[test]\n\n fn simple_from_pixel_integer() {\n\n for &spacing in [\n\n IntegerSpacing::PointyTop(2, 1),\n\n IntegerSpacing::PointyTop(4, 6),\n\n IntegerSpacing::FlatTop(3, 2),\n\n ]\n\n .iter()\n\n {\n\n with_test_points(|c: Coordinate| {\n\n let ascii_pix = c.to_pixel_integer(spacing);\n\n let (coord, pix_off) = Coordinate::nearest_with_offset(spacing, ascii_pix);\n\n assert_eq!((c, (0, 0)), (coord, pix_off));\n\n });\n\n }\n","file_path":"src/lib.rs","rank":86,"score":6.009913348175454},{"content":" d,\n\n ),\n\n };\n\n\n\n let cur_coord: Coordinate<I> = *origin + Coordinate::from(start_dir).scale(radius);\n\n let cur_dir = start_dir + start_angle;\n\n\n\n Ring {\n\n origin: origin.clone(),\n\n current: Bearing::new(cur_coord, cur_dir),\n\n step_angle,\n\n r: I::abs(&radius),\n\n ii: I::zero(),\n\n jj: I::zero(),\n\n fuse: false,\n\n }\n\n }\n\n /// Get Radius of the `Ring`\n\n pub fn radius(&self) -> I {\n\n self.r\n","file_path":"src/ring.rs","rank":87,"score":5.893703088560588},{"content":" assert_eq!(ring[1], c + d + d + (d + RightBackward));\n\n assert_eq!(ring[7], c - d - d - (d + RightBackward));\n\n assert_eq!(ring[11], c + d + d + (d + LeftBackward));\n\n }\n\n {\n\n // CCW r2\n\n let ring = c.ring_iter(2, Spin::CCW(d)).collect::<Vec<_>>();\n\n\n\n assert_eq!(12, ring.len());\n\n assert_eq!(ring[0], c + d + d);\n\n assert_eq!(ring[1], c + d + d + (d + LeftBackward));\n\n assert_eq!(ring[7], c - d - d - (d + LeftBackward));\n\n assert_eq!(ring[11], c + d + d + (d + RightBackward));\n\n }\n\n {\n\n // CW r-2\n\n let ring = c.ring_iter(-2, Spin::CW(d)).collect::<Vec<_>>();\n\n\n\n assert_eq!(12, ring.len());\n\n assert_eq!(ring[0], c - d - d);\n","file_path":"src/lib.rs","rank":88,"score":5.834935401791242},{"content":" assert_eq!(ring[5], c + (d + LeftForward));\n\n }\n\n {\n\n // CCW r1\n\n let ring = c.ring_iter(1, Spin::CCW(d)).collect::<Vec<_>>();\n\n\n\n assert_eq!(6, ring.len());\n\n assert_eq!(ring[0], c + d);\n\n assert_eq!(ring[1], c + (d + LeftForward));\n\n assert_eq!(ring[2], c + (d + LeftBackward));\n\n assert_eq!(ring[3], c + (d + Backward));\n\n assert_eq!(ring[4], c + (d + RightBackward));\n\n assert_eq!(ring[5], c + (d + RightForward));\n\n }\n\n {\n\n // CW r2\n\n let ring = c.ring_iter(2, Spin::CW(d)).collect::<Vec<_>>();\n\n\n\n assert_eq!(12, ring.len());\n\n assert_eq!(ring[0], c + d + d);\n","file_path":"src/lib.rs","rank":89,"score":5.834935401791242},{"content":" Spin::CW(direction) => (Angle::RightBackward, Angle::RightForward, direction),\n\n Spin::CCW(direction) => (Angle::LeftBackward, Angle::LeftForward, direction),\n\n };\n\n\n\n Spiral {\n\n origin_coordinate: origin,\n\n current_coordinate: origin + start_direction,\n\n current_direction: start_direction + start_angle,\n\n start_direction,\n\n step_angle,\n\n layer: I::zero(),\n\n idx: I::zero(),\n\n ii: I::zero(),\n\n jj: I::zero(),\n\n fuse: false,\n\n radius,\n\n }\n\n }\n\n /// Get current layer of the `Spiral`\n\n pub fn layer(&self) -> I {\n","file_path":"src/spiral.rs","rank":90,"score":5.45094437476978},{"content":"#### 5. Submission of Contributions\n\n\n\nUnless You explicitly state otherwise, any Contribution intentionally submitted\n\nfor inclusion in the Work by You to the Licensor shall be under the terms and\n\nconditions of this License, without any additional terms or conditions.\n\nNotwithstanding the above, nothing herein shall supersede or modify the terms of\n\nany separate license agreement you may have executed with Licensor regarding\n\nsuch Contributions.\n\n\n\n#### 6. Trademarks\n\n\n\nThis License does not grant permission to use the trade names, trademarks,\n\nservice marks, or product names of the Licensor, except as required for\n\nreasonable and customary use in describing the origin of the Work and\n\nreproducing the content of the NOTICE file.\n\n\n\n#### 7. Disclaimer of Warranty\n\n\n\nUnless required by applicable law or agreed to in writing, Licensor provides the\n\nWork (and each Contributor provides its Contributions) on an \"AS IS\" BASIS,\n\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,\n\nincluding, without limitation, any warranties or conditions of TITLE,\n\nNON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are\n\nsolely responsible for determining the appropriateness of using or\n\nredistributing the Work and assume any risks associated with Your exercise of\n\npermissions under this License.\n\n\n\n#### 8. Limitation of Liability\n\n\n\nIn no event and under no legal theory, whether in tort (including negligence),\n\ncontract, or otherwise, unless required by applicable law (such as deliberate\n\nand grossly negligent acts) or agreed to in writing, shall any Contributor be\n\nliable to You for damages, including any direct, indirect, special, incidental,\n\nor consequential damages of any character arising as a result of this License or\n\nout of the use or inability to use the Work (including but not limited to\n\ndamages for loss of goodwill, work stoppage, computer failure or malfunction, or\n\nany and all other commercial damages or losses), even if such Contributor has\n\nbeen advised of the possibility of such damages.\n\n\n","file_path":"LICENSE.md","rank":91,"score":5.419729518661889},{"content":" dirs.push(Direction::YZ)\n\n }\n\n\n\n if y > I::zero() && x < I::zero() {\n\n dirs.push(Direction::YX)\n\n }\n\n\n\n dirs\n\n }\n\n\n\n /// Direction from center `(0, 0)` to coordinate\n\n ///\n\n /// In case of diagonals (edge of two major directions), prefers direction that is\n\n /// counter-clockwise from the diagonal.\n\n ///\n\n /// Returns:\n\n /// None if is center\n\n ///\n\n /// TODO: Example/Function broken.\n\n ///\n","file_path":"src/coordinate.rs","rank":92,"score":5.398755934266719},{"content":" self.fuse = true;\n\n return None;\n\n }\n\n self.layer += I::one();\n\n self.ii = I::zero();\n\n self.current_coordinate = Coordinate::from(self.start_direction).scale(self.layer);\n\n }\n\n // Rotate Direction by Step Angle, and set side position to zero\n\n self.current_direction = self.current_direction + self.step_angle;\n\n self.jj = I::zero();\n\n }\n\n // Increment Side Position\n\n self.jj += I::one();\n\n // Increment index. TODO: Remove\n\n self.idx += I::one();\n\n\n\n let ret = Some(self.current_coordinate);\n\n let current_direction_offset: Coordinate<_> = self.current_direction.into();\n\n self.current_coordinate = self.current_coordinate + current_direction_offset;\n\n\n","file_path":"src/spiral.rs","rank":93,"score":5.161834154555799},{"content":" let two: I = I::from_i8(2).unwrap();\n\n\n\n let ((q, qo), (r, ro)) = match spacing {\n\n IntegerSpacing::FlatTop(w, h) => (\n\n (asc_x.div_floor(&w), asc_x.mod_floor(&w)),\n\n (\n\n (asc_y - h * asc_x.div_floor(&w) / two).div_floor(&h),\n\n (asc_y + h / two * asc_x.div_floor(&w)).mod_floor(&h),\n\n ),\n\n ),\n\n IntegerSpacing::PointyTop(w, h) => (\n\n (\n\n (asc_x - w * asc_y.div_floor(&h) / two).div_floor(&w),\n\n (asc_x + w / two * asc_y.div_floor(&h)).mod_floor(&w),\n\n ),\n\n (asc_y.div_floor(&h), asc_y.mod_floor(&h)),\n\n ),\n\n };\n\n\n\n let coord = Coordinate { q, r };\n","file_path":"src/coordinate.rs","rank":94,"score":4.945614036438238},{"content":"#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\n\npub enum Angle {\n\n /// 0-deg clockwise\n\n Forward,\n\n /// 60-deg clockwise\n\n RightForward,\n\n /// 120-deg clockwise\n\n RightBackward,\n\n /// 180-deg clockwise\n\n Backward,\n\n /// 240-deg clockwise\n\n LeftBackward,\n\n /// 300-deg clockwise\n\n LeftForward,\n\n}\n\n\n\nimpl Angle {\n\n /// Static array of all angles\n\n ///\n\n /// ```\n","file_path":"src/angle.rs","rank":95,"score":4.79044296311571},{"content":"\n\n for &dir in Direction::all().iter() {\n\n assert_eq!((c + dir).direction_from_center_cw(), Some(dir));\n\n assert_eq!((c + dir).direction_from_center_ccw(), Some(dir));\n\n assert_eq!(\n\n (c + dir + (dir + LeftForward)).direction_from_center_cw(),\n\n Some(dir)\n\n );\n\n assert_eq!(\n\n (c + dir + (dir + RightForward)).direction_from_center_ccw(),\n\n Some(dir)\n\n );\n\n }\n\n }\n\n\n\n #[test]\n\n #[ignore]\n\n fn simple_direction_to() {\n\n with_test_points(|c: Coordinate| {\n\n assert_eq!(c.direction_to_cw(c), None);\n","file_path":"src/lib.rs","rank":96,"score":4.5617779303388835},{"content":" if self.radius.is_zero() {\n\n self.fuse = true;\n\n } else {\n\n self.layer += I::one();\n\n self.idx += I::one();\n\n }\n\n return Some(self.origin_coordinate);\n\n }\n\n\n\n // ii is the current side relative to the starting location. 0-5\n\n // jj is the position on the current side.\n\n // if jj > current layer radius. increment side and rotate\n\n // if ii > 6, then increment radius and start over.\n\n if self.jj >= self.layer.abs() {\n\n // Increment current side\n\n self.ii += I::one();\n\n // if side > 6, increment layer\n\n if self.ii >= I::from_u8(6).unwrap() {\n\n // If layer is equal or greater than radius, fuse\n\n if self.layer >= self.radius {\n","file_path":"src/spiral.rs","rank":97,"score":4.501289476440809},{"content":" assert_eq!(ring[1], c - d - d - (d + RightBackward));\n\n assert_eq!(ring[7], c + d + d + (d + RightBackward));\n\n assert_eq!(ring[11], c - d - d - (d + LeftBackward));\n\n }\n\n }\n\n })\n\n }\n\n\n\n #[test]\n\n fn simple_spiral() {\n\n let spiral = Coordinate::from_axial(0, 0)\n\n .spiral_iter(2, Spin::CW(Direction::YZ))\n\n .collect::<Vec<_>>();\n\n assert_eq!(19, spiral.len());\n\n // Center\n\n assert_eq!(spiral[0], Coordinate::from_axial(0, 0));\n\n // Ring 1\n\n assert_eq!(spiral[1], Coordinate::from_axial(0, -1));\n\n assert_eq!(spiral[2], Coordinate::from_axial(1, -1));\n\n assert_eq!(spiral[3], Coordinate::from_axial(1, 0));\n","file_path":"src/lib.rs","rank":98,"score":4.403232239864549},{"content":" Direction::YX => PI * (4.5 / 3.0),\n\n Direction::YZ => PI * (5.5 / 3.0),\n\n })\n\n .unwrap()\n\n }\n\n\n\n /// Convert to angle for flat-topped map, in radians, grows clockwise, 0.0 points up\n\n pub fn to_radians_flat<T: Float>(&self) -> T {\n\n self.to_radians_pointy::<T>() + T::from(std::f64::consts::PI * (0.5 / 3.0)).unwrap()\n\n }\n\n}\n\n\n\nimpl std::fmt::Display for Direction {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {\n\n write!(f, \"{:?}\", self)\n\n }\n\n}\n\n\n\nimpl<T: Into<Direction>> std::ops::Sub<T> for Direction {\n\n type Output = Angle;\n","file_path":"src/direction.rs","rank":99,"score":4.315130523951135}],"string":"[\n {\n \"content\": \"/// Float trait used by this library\\n\\npub trait Float:\\n\\n num::Signed\\n\\n + num::Float\\n\\n + num::ToPrimitive\\n\\n + num::FromPrimitive\\n\\n + num::NumCast\\n\\n + num::One\\n\\n + num::Zero\\n\\n + std::marker::Copy\\n\\n + std::ops::AddAssign\\n\\n + std::default::Default\\n\\n{\\n\\n}\\n\\n\\n\\nimpl<F> Float for F where\\n\\n F: num::Signed\\n\\n + num::Float\\n\\n + num::ToPrimitive\\n\\n + num::FromPrimitive\\n\\n + num::NumCast\\n\\n + num::One\\n\\n + num::Zero\\n\\n + std::marker::Copy\\n\\n + std::ops::AddAssign\\n\\n + std::default::Default\\n\\n{\\n\\n}\\n\",\n \"file_path\": \"src/types.rs\",\n \"rank\": 0,\n \"score\": 75878.38311700396\n },\n {\n \"content\": \"/// Integer trait used by this library.\\n\\npub trait Integer:\\n\\n num::Signed\\n\\n + num::Integer\\n\\n + num::CheckedAdd\\n\\n + num::ToPrimitive\\n\\n + num::FromPrimitive\\n\\n + num::NumCast\\n\\n + num::One\\n\\n + num::Zero\\n\\n + std::default::Default\\n\\n + std::fmt::Debug\\n\\n + std::hash::Hash\\n\\n + std::marker::Copy\\n\\n + std::ops::AddAssign\\n\\n{\\n\\n}\\n\\n\\n\\nimpl<I> Integer for I where\\n\\n I: num::Signed\\n\\n + num::Integer\\n\",\n \"file_path\": \"src/types.rs\",\n \"rank\": 1,\n \"score\": 74200.83499000534\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\n/// Integer trait used by this library.\\n\",\n \"file_path\": \"src/types.rs\",\n \"rank\": 2,\n \"score\": 27407.132134449068\n },\n {\n \"content\": \" + num::CheckedAdd\\n\\n + num::ToPrimitive\\n\\n + num::FromPrimitive\\n\\n + num::NumCast\\n\\n + num::One\\n\\n + num::Zero\\n\\n + std::default::Default\\n\\n + std::fmt::Debug\\n\\n + std::hash::Hash\\n\\n + std::marker::Copy\\n\\n + std::ops::AddAssign\\n\\n{\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types.rs\",\n \"rank\": 3,\n \"score\": 27402.74141679599\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<F: Float, I: Integer> From<Coordinate<I>> for Position<F> {\\n\\n fn from(coordinate: Coordinate<I>) -> Self {\\n\\n Position::from_coordinate(coordinate)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float, I: Integer> From<Bearing<I>> for Position<F> {\\n\\n fn from(bearing: Bearing<I>) -> Self {\\n\\n bearing.coordinate.into_position()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float> From<Direction> for Position<F> {\\n\\n fn from(direction: Direction) -> Self {\\n\\n let (q, r) = match direction {\\n\\n Direction::YZ => (0.0, 1.0),\\n\\n Direction::XZ => (1.0, 0.0),\\n\\n Direction::XY => (1.0, -1.0),\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 4,\n \"score\": 27117.7573362584\n },\n {\n \"content\": \"/// Fractional Position on 2d hexagonal grid\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Debug, Ord, PartialOrd)]\\n\\npub struct Position<F: Float = f32> {\\n\\n /// Axial `q` coordinate\\n\\n pub q: F,\\n\\n /// Axial `r` coordinate\\n\\n pub r: F,\\n\\n}\\n\\n\\n\\nimpl<F: Float> Position<F> {\\n\\n /// Create new Coordinate from `q` and `r` axial components.\\n\\n ///\\n\\n /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/#coordinates).\\n\\n pub fn from_axial(q: F, r: F) -> Position<F> {\\n\\n Position { q, r }\\n\\n }\\n\\n\\n\\n /// Create new Coordinate from `x`, `y`, and `z` cubic components.\\n\\n ///\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 5,\n \"score\": 27116.367767169577\n },\n {\n \"content\": \"\\n\\n /// Round Position into the nearest Coordinate\\n\\n ///\\n\\n /// See [Coordinate::from_position](crate::Coordinate::from_position).\\n\\n /// See [Hex Rounding](https://www.redblobgames.com/grids/hexagons/implementation.html#rounding).\\n\\n pub fn into_coordinate<I: Integer>(&self) -> Coordinate<I> {\\n\\n Coordinate::from_position(*self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float> From<(F, F)> for Position<F> {\\n\\n fn from(qr: (F, F)) -> Self {\\n\\n Position::from_axial(qr.0, qr.1)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float> From<(F, F, F)> for Position<F> {\\n\\n fn from(xyz: (F, F, F)) -> Self {\\n\\n Position::from_cubic(xyz.0, xyz.1, xyz.2)\\n\\n }\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 6,\n \"score\": 27115.364851213733\n },\n {\n \"content\": \" /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/#coordinates).\\n\\n pub fn from_cubic(x: F, y: F, z: F) -> Position<F> {\\n\\n assert!(x + y + z == F::zero());\\n\\n Position { q: x, r: z }\\n\\n }\\n\\n\\n\\n /// Create Position from Hex Coordinate.\\n\\n pub fn from_coordinate<I: Integer>(coordinate: Coordinate<I>) -> Position<F> {\\n\\n Position {\\n\\n q: F::from(coordinate.q).unwrap(),\\n\\n r: F::from(coordinate.r).unwrap(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Convert a cartesian point into a hex position. The origin of the cartesian space is the\\n\\n /// center of the hex at (0,0) in hex coordinates.\\n\\n ///\\n\\n /// See [Screen to Hex](https://www.redblobgames.com/grids/hexagons/implementation.html#pixel-to-hex).\\n\\n pub fn from_cartesian(x: F, y: F, spacing: Spacing<F>) -> Position<F> {\\n\\n let f2: F = F::from(2).unwrap();\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 7,\n \"score\": 27111.949439554457\n },\n {\n \"content\": \"\\n\\n fn mul(self, rhs: F) -> Self {\\n\\n Position {\\n\\n q: self.q * rhs,\\n\\n r: self.r * rhs,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float> std::ops::Neg for Position<F> {\\n\\n type Output = Position<F>;\\n\\n\\n\\n fn neg(self) -> Self {\\n\\n Position {\\n\\n q: -self.q,\\n\\n r: -self.r,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 8,\n \"score\": 27111.876326973434\n },\n {\n \"content\": \" r: self.r + p.r,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float, T: Into<Position<F>>> std::ops::Sub<T> for Position<F> {\\n\\n type Output = Position<F>;\\n\\n\\n\\n fn sub(self, rhs: T) -> Self {\\n\\n let p: Position<_> = rhs.into();\\n\\n\\n\\n Position {\\n\\n q: self.q - p.q,\\n\\n r: self.r - p.r,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float> std::ops::Mul<F> for Position<F> {\\n\\n type Output = Position<F>;\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 9,\n \"score\": 27111.61847880887\n },\n {\n \"content\": \" pub fn y(&self) -> F {\\n\\n F::zero() - self.q - self.r\\n\\n }\\n\\n\\n\\n /// Cubic Hex `Z` coordinate\\n\\n pub fn z(&self) -> F {\\n\\n self.r\\n\\n }\\n\\n\\n\\n /// Distance from Origin\\n\\n pub fn length(&self) -> F {\\n\\n (self.x().abs() + self.y().abs() + self.z().abs()) / F::from_f64(2.0).unwrap()\\n\\n }\\n\\n\\n\\n /// Distance between two Positions in Hex Space\\n\\n pub fn distance(&self, position: Position<F>) -> F {\\n\\n (self.x() - position.x()).abs()\\n\\n + (self.y() - position.y()).abs()\\n\\n + (self.z() - position.z()).abs() / F::from_f64(2.0).unwrap()\\n\\n }\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 10,\n \"score\": 27111.50614907242\n },\n {\n \"content\": \" let f3: F = F::from(3).unwrap();\\n\\n let f3s: F = f3.sqrt();\\n\\n\\n\\n match spacing {\\n\\n Spacing::PointyTop(size) => Position {\\n\\n q: (x * f3s / f3 - y / f3) / size,\\n\\n r: (y * f2 / f3) / size,\\n\\n },\\n\\n Spacing::FlatTop(size) => Position {\\n\\n q: (x * f2 / f3) / size,\\n\\n r: (-x / f3 + f3s / f3 * y) / size,\\n\\n },\\n\\n }\\n\\n }\\n\\n\\n\\n /// Convert Position into Cartesian coordinates with their origin at (0, 0).\\n\\n ///\\n\\n /// See [Hex to Pixel](https://www.redblobgames.com/grids/hexagons/#hex-to-pixel).\\n\\n pub fn into_cartesian(&self, spacing: Spacing<F>) -> (F, F) {\\n\\n let f2: F = F::from(2).unwrap();\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 11,\n \"score\": 27110.815518170366\n },\n {\n \"content\": \" Direction::ZY => (0.0, -1.0),\\n\\n Direction::ZX => (-1.0, 0.0),\\n\\n Direction::YX => (-1.0, 1.0),\\n\\n };\\n\\n\\n\\n Position {\\n\\n q: F::from(q).unwrap(),\\n\\n r: F::from(r).unwrap(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F: Float, T: Into<Position<F>>> std::ops::Add<T> for Position<F> {\\n\\n type Output = Position<F>;\\n\\n\\n\\n fn add(self, rhs: T) -> Self {\\n\\n let p: Position<_> = rhs.into();\\n\\n\\n\\n Position {\\n\\n q: self.q + p.q,\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 12,\n \"score\": 27110.733118947\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n// See LICENSE file for more information\\n\\n//\\n\\n\\n\\nuse crate::{Bearing, Coordinate, Direction, Float, Integer, Spacing};\\n\\n\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 13,\n \"score\": 27106.011961710083\n },\n {\n \"content\": \" let f3: F = F::from(3).unwrap();\\n\\n let f3s: F = f3.sqrt();\\n\\n match spacing {\\n\\n Spacing::FlatTop(size) => (\\n\\n size * (f3 / f2 * self.q),\\n\\n size * (f3s / f2 * self.q + f3s * self.r),\\n\\n ),\\n\\n Spacing::PointyTop(size) => (\\n\\n size * (f3s * self.q + f3s / f2 * self.r),\\n\\n size * (f3 / f2 * self.r),\\n\\n ),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Cubic Hex `X` coordinate\\n\\n pub fn x(&self) -> F {\\n\\n self.q\\n\\n }\\n\\n\\n\\n /// Cubic Hex `Y` coordinate\\n\",\n \"file_path\": \"src/position.rs\",\n \"rank\": 14,\n \"score\": 27105.708744740332\n },\n {\n \"content\": \" pub fn into_position<F: Float>(&self) -> Position<F> {\\n\\n Position::from_coordinate(*self)\\n\\n }\\n\\n\\n\\n /// Find the hex containing a pixel. The origin of the pixel coordinates\\n\\n /// is the center of the hex at (0,0) in hex coordinates.\\n\\n ///\\n\\n\\n\\n pub fn from_cartesian<F: Float>(x: F, y: F, spacing: Spacing<F>) -> Coordinate<I> {\\n\\n Coordinate::from_position(Position::from_cartesian(x, y, spacing))\\n\\n }\\n\\n\\n\\n /// Convert integer pixel coordinates `v` using `spacing` to nearest coordinate that has both\\n\\n /// integer pixel coordinates lower or equal to `v`. Also return offset (in integer pixels)\\n\\n /// from that coordinate.\\n\\n ///\\n\\n /// Useful for ASCII visualization. Shamelessly stolen from [Hex2d](https://github.com/dpc/hex2d-rs).\\n\\n pub fn nearest_with_offset(spacing: IntegerSpacing<I>, v: (I, I)) -> (Coordinate<I>, (I, I)) {\\n\\n let (asc_x, asc_y) = v;\\n\\n\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 22,\n \"score\": 21.05414917119542\n },\n {\n \"content\": \"pub use self::sextant::Sextant;\\n\\npub use self::spacing::{IntegerSpacing, Spacing};\\n\\npub use self::sparse::SparseHexStorage;\\n\\npub use self::spin::Spin;\\n\\npub use self::spiral::Spiral;\\n\\npub use self::types::{Float, Integer};\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::Angle::*;\\n\\n use crate::Direction::*;\\n\\n use crate::*;\\n\\n\\n\\n fn with_test_points<F: Fn(Coordinate) -> ()>(f: F) {\\n\\n let offs = [-2i32, -1, 0, 1, 2, 1000, -1000, 1001, -1001];\\n\\n for &x in offs.iter() {\\n\\n for &y in offs.iter() {\\n\\n let p = Coordinate::from_axial(x, y);\\n\\n f(p)\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 23,\n \"score\": 21.012708988524643\n },\n {\n \"content\": \"/// Iterator over an range\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub struct RangeIter<I: Integer> {\\n\\n source: Coordinate<I>,\\n\\n q: I,\\n\\n r: I,\\n\\n radius: I,\\n\\n counter: usize,\\n\\n}\\n\\n\\n\\nimpl<I: Integer> RangeIter<I> {\\n\\n /// Create a new Range Iterator\\n\\n pub(crate) fn new(origin: &Coordinate<I>, radius: I) -> RangeIter<I> {\\n\\n RangeIter {\\n\\n source: origin.clone(),\\n\\n q: -radius,\\n\\n r: max(-radius, -(-radius) - radius),\\n\\n radius,\\n\\n counter: 0,\\n\",\n \"file_path\": \"src/range.rs\",\n \"rank\": 24,\n \"score\": 20.02790813093142\n },\n {\n \"content\": \" self.layer\\n\\n }\\n\\n /// Get final radius of the `Spiral`\\n\\n pub fn radius(&self) -> I {\\n\\n self.radius\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> Iterator for Spiral<I> {\\n\\n type Item = Coordinate<I>;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n // Iterator has fused and finished the Spiral, will return None forevermore.\\n\\n if self.fuse {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // If current layer is zero, return origin.\\n\\n // If radius is also zero, then fuse.\\n\\n if self.layer.is_zero() {\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 25,\n \"score\": 19.584850922542604\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> Iterator for Ring<I> {\\n\\n type Item = Coordinate<I>;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n if self.fuse {\\n\\n return None;\\n\\n }\\n\\n if self.r.is_zero() {\\n\\n self.fuse = true;\\n\\n return Some(self.origin);\\n\\n }\\n\\n\\n\\n if self.jj >= self.r.abs() {\\n\\n self.ii += I::one();\\n\\n if self.ii >= I::from_u8(6).unwrap() {\\n\\n self.fuse = true;\\n\\n return None;\\n\",\n \"file_path\": \"src/ring.rs\",\n \"rank\": 26,\n \"score\": 17.897799739662837\n },\n {\n \"content\": \" q: I::from(q).unwrap(),\\n\\n r: I::from(r).unwrap(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Round x, y float to nearest hex coordinates.\\n\\n ///\\n\\n /// Return None, if exactly on the border of two hex coordinates\\n\\n pub fn from_position_lossy<F: Float>(position: Position<F>) -> Option<Coordinate<I>> {\\n\\n let mut q = position.q;\\n\\n let mut r = position.r;\\n\\n let s = F::zero() - position.q - position.r;\\n\\n\\n\\n let q_diff = (q.round() - q).abs();\\n\\n let r_diff = (r.round() - r).abs();\\n\\n let s_diff = (s.round() - s).abs();\\n\\n\\n\\n if q_diff > r_diff && q_diff > s_diff {\\n\\n q = F::zero() - r - s;\\n\\n } else if r_diff > s_diff {\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 27,\n \"score\": 17.72408163997144\n },\n {\n \"content\": \"impl<I: Integer> From<(I, I)> for Coordinate<I> {\\n\\n fn from(qr: (I, I)) -> Self {\\n\\n Coordinate::from_axial(qr.0, qr.1)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> From<(I, I, I)> for Coordinate<I> {\\n\\n fn from(xyz: (I, I, I)) -> Self {\\n\\n Coordinate::from_cubic(xyz.0, xyz.1, xyz.2)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer, F: Float> From<Position<F>> for Coordinate<I> {\\n\\n fn from(position: Position<F>) -> Self {\\n\\n Coordinate::from_position(position)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> From<Bearing<I>> for Coordinate<I> {\\n\\n fn from(bearing: Bearing<I>) -> Self {\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 28,\n \"score\": 17.488919907912173\n },\n {\n \"content\": \"#[derive(Copy, Clone, PartialEq, Debug, PartialOrd)]\\n\\npub enum Spacing<F: Float = f32> {\\n\\n /// Hex-grid with an edge on top\\n\\n FlatTop(F),\\n\\n /// Hex-grid with a corner on top\\n\\n PointyTop(F),\\n\\n}\\n\\n\\n\\n/// Integer pixel tile size for integer pixel conversion functions\\n\\n///\\n\\n/// Example values that give good results:\\n\\n///\\n\\n/// * FlatTop(3, 2)\\n\\n/// * PointyTop(2, 1)\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Debug, Hash, Ord, PartialOrd)]\\n\\npub enum IntegerSpacing<I: Integer> {\\n\\n /// Hex-grid with an edge on top\\n\\n FlatTop(I, I),\\n\\n /// Hex-grid with a corner on top\\n\\n PointyTop(I, I),\\n\\n}\\n\",\n \"file_path\": \"src/spacing.rs\",\n \"rank\": 29,\n \"score\": 16.51399857596835\n },\n {\n \"content\": \"/// ### Ring Iteration Pattern:\\n\\n/// ```rust\\n\\n/// use hexgrid::{Coordinate, Spin, Direction};\\n\\n///\\n\\n/// for location in Coordinate::from_axial(0, 0).ring_iter(5, Spin::CW(Direction::YZ)) {\\n\\n/// assert_eq!(location.distance(Coordinate::from_axial(0,0)), 5);\\n\\n/// }\\n\\n/// ```\\n\\n#[doc = include_str!(\\\"ring.svg\\\")]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub struct Ring<I: Integer> {\\n\\n origin: Coordinate<I>,\\n\\n current: Bearing<I>,\\n\\n step_angle: Angle,\\n\\n r: I,\\n\\n ii: I,\\n\\n jj: I,\\n\\n fuse: bool,\\n\\n}\\n\",\n \"file_path\": \"src/ring.rs\",\n \"rank\": 30,\n \"score\": 16.362700532782235\n },\n {\n \"content\": \"#[doc = include_str!(\\\"spiral.svg\\\")]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub struct Spiral<I: Integer> {\\n\\n origin_coordinate: Coordinate<I>,\\n\\n current_coordinate: Coordinate<I>,\\n\\n current_direction: Direction,\\n\\n start_direction: Direction,\\n\\n step_angle: Angle,\\n\\n radius: I,\\n\\n layer: I,\\n\\n idx: I,\\n\\n ii: I,\\n\\n jj: I,\\n\\n fuse: bool,\\n\\n}\\n\\n\\n\\nimpl<I: Integer> Spiral<I> {\\n\\n pub(crate) fn new(origin: Coordinate<I>, radius: I, spin: Spin) -> Spiral<I> {\\n\\n let (start_angle, step_angle, start_direction) = match spin {\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 31,\n \"score\": 15.461892439799058\n },\n {\n \"content\": \"\\n\\n Coordinate { q: x, r: y }\\n\\n }\\n\\n\\n\\n /// Rotate `self` around a `center` using angle of rotation `a`\\n\\n pub fn rotate_around(&self, center: Coordinate<I>, a: Angle) -> Coordinate<I> {\\n\\n let rel_p = *self - center;\\n\\n let rot_p = rel_p.rotate_around_zero(a);\\n\\n rot_p + center\\n\\n }\\n\\n\\n\\n /// Iterator over each coordinate in straight line from `self` to `dest`\\n\\n pub fn line_iter(&self, target: Coordinate<I>) -> LineIter<I> {\\n\\n LineIter::new(LineGenIter::new(\\n\\n self.into_position(),\\n\\n target.into_position(),\\n\\n ))\\n\\n }\\n\\n\\n\\n /// Iterator over each coordinate in straight line from `self` to `dest`\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 32,\n \"score\": 15.216192560317163\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> Iterator for RangeIter<I> {\\n\\n type Item = Coordinate<I>;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n if self.r > min(self.radius, -self.q + self.radius) {\\n\\n if self.q >= self.radius {\\n\\n return None;\\n\\n }\\n\\n self.q += One::one();\\n\\n self.r = max(-self.radius, -self.q - self.radius);\\n\\n }\\n\\n\\n\\n let ret = Some(Coordinate {\\n\\n q: self.source.q + self.q,\\n\\n r: self.source.r + self.r,\\n\\n });\\n\",\n \"file_path\": \"src/range.rs\",\n \"rank\": 33,\n \"score\": 15.210748172437835\n },\n {\n \"content\": \"mod position;\\n\\nmod range;\\n\\nmod ring;\\n\\nmod sextant;\\n\\nmod spacing;\\n\\nmod sparse;\\n\\nmod spin;\\n\\nmod spiral;\\n\\nmod types;\\n\\n\\n\\npub use self::angle::Angle;\\n\\npub use self::bearing::Bearing;\\n\\npub use self::coordinate::Coordinate;\\n\\npub use self::direction::Direction;\\n\\npub use self::line::LineGenIter;\\n\\npub use self::line::{LineIter, LineIterWithEdgeDetection, LossyLineIter};\\n\\npub use self::offset::Offset;\\n\\npub use self::position::Position;\\n\\npub use self::range::RangeIter;\\n\\npub use self::ring::Ring;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 34,\n \"score\": 14.76543721474474\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n// See LICENSE file for more information\\n\\n//\\n\\n\\n\\n/// Coordinate Offset\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub struct Offset<N = i32> {\\n\\n /// `x` coordinate\\n\\n pub x: N,\\n\\n /// `y` coordinate\\n\\n pub y: N,\\n\\n}\\n\",\n \"file_path\": \"src/offset.rs\",\n \"rank\": 35,\n \"score\": 14.378968870402478\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{\\n\\n Angle, Bearing, Direction, Float, Integer, IntegerSpacing, LineGenIter, LineIter,\\n\\n LineIterWithEdgeDetection, LossyLineIter, Position, RangeIter, Ring, Spacing, Spin, Spiral,\\n\\n};\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 36,\n \"score\": 14.129291305148802\n },\n {\n \"content\": \" ///\\n\\n /// Skip points on the border of two tiles\\n\\n pub fn lossy_line_iter(&self, target: Coordinate<I>) -> LossyLineIter<I> {\\n\\n LossyLineIter::new(LineGenIter::new(\\n\\n self.into_position(),\\n\\n target.into_position(),\\n\\n ))\\n\\n }\\n\\n\\n\\n /// Iterator over each coordinate in straight line from `self` to `dest`\\n\\n ///\\n\\n /// On edge condition the pair contains different members, otherwise it's the same.\\n\\n pub fn line_iter_with_edge_detection(\\n\\n &self,\\n\\n target: Coordinate<I>,\\n\\n ) -> LineIterWithEdgeDetection<I> {\\n\\n LineIterWithEdgeDetection::new(LineGenIter::new(\\n\\n self.into_position(),\\n\\n target.into_position(),\\n\\n ))\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 37,\n \"score\": 14.097054325347838\n },\n {\n \"content\": \" 2 => Angle::RightBackward,\\n\\n 3 => Angle::Backward,\\n\\n 4 => Angle::LeftBackward,\\n\\n 5 => Angle::LeftForward,\\n\\n _ => panic!(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Convert angle to integer ordinal in [0, 6) range.\\n\\n pub fn to_int<I: Integer>(&self) -> I {\\n\\n I::from_u8(*self as u8).unwrap()\\n\\n }\\n\\n\\n\\n /// Convert to degrees from bearing.\\n\\n pub fn to_degree<F: Float>(&self) -> F {\\n\\n match self {\\n\\n Angle::Forward => F::from(0.0).unwrap(),\\n\\n Angle::RightForward => F::from(60.0).unwrap(),\\n\\n Angle::RightBackward => F::from(120.0).unwrap(),\\n\\n Angle::Backward => F::from(180.0).unwrap(),\\n\\n Angle::LeftBackward => F::from(240.0).unwrap(),\\n\\n Angle::LeftForward => F::from(300.0).unwrap(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/angle.rs\",\n \"rank\": 38,\n \"score\": 13.771195793390618\n },\n {\n \"content\": \" /// use hexgrid::Angle;\\n\\n ///\\n\\n /// assert_eq!(Angle::all().len(), 6);\\n\\n /// ```\\n\\n pub fn all() -> &'static [Angle; 6] {\\n\\n &[\\n\\n Angle::Forward,\\n\\n Angle::RightForward,\\n\\n Angle::RightBackward,\\n\\n Angle::Backward,\\n\\n Angle::LeftBackward,\\n\\n Angle::LeftForward,\\n\\n ]\\n\\n }\\n\\n\\n\\n /// Create Angle from integer ordinal in [0, 6) range.\\n\\n pub fn from_int<I: Integer>(i: I) -> Angle {\\n\\n match i.mod_floor(&I::from_u8(6).unwrap()).to_u8().unwrap() {\\n\\n 0 => Angle::Forward,\\n\\n 1 => Angle::RightForward,\\n\",\n \"file_path\": \"src/angle.rs\",\n \"rank\": 40,\n \"score\": 12.833195075000315\n },\n {\n \"content\": \" 5 => Direction::YX,\\n\\n _ => panic!(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Convert to integer in [0, 6) range\\n\\n ///\\n\\n /// This should probably be internal\\n\\n pub fn to_int<I: Integer>(&self) -> I {\\n\\n I::from_u8(*self as u8).unwrap()\\n\\n }\\n\\n\\n\\n /// Convert to angle for pointy-topped map, in radians, grows clockwise, 0.0 points up\\n\\n pub fn to_radians_pointy<T: Float>(&self) -> T {\\n\\n use std::f64::consts::PI;\\n\\n T::from(match *self {\\n\\n Direction::XZ => PI * (0.5 / 3.0),\\n\\n Direction::XY => PI * (1.5 / 3.0),\\n\\n Direction::ZY => PI * (2.5 / 3.0),\\n\\n Direction::ZX => PI * (3.5 / 3.0),\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 41,\n \"score\": 12.736735916241155\n },\n {\n \"content\": \"\\n\\nimpl<I: Integer, D> IntoIterator for SparseHexStorage<I, D> {\\n\\n type Item = (Coordinate<I>, D);\\n\\n type IntoIter = std::collections::hash_map::IntoIter<Coordinate<I>, D>;\\n\\n\\n\\n fn into_iter(self) -> Self::IntoIter {\\n\\n self.0.into_iter()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sparse.rs\",\n \"rank\": 42,\n \"score\": 12.617209890862148\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Float, Integer};\\n\\n\\n\\n/// Floating point tile size for pixel conversion functions\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\",\n \"file_path\": \"src/spacing.rs\",\n \"rank\": 43,\n \"score\": 12.460898000149712\n },\n {\n \"content\": \" /// See [Hex Rounding](https://www.redblobgames.com/grids/hexagons/implementation.html#rounding)\\n\\n pub fn from_position<F: Float>(position: Position<F>) -> Coordinate<I> {\\n\\n let mut q = position.q;\\n\\n let mut r = position.r;\\n\\n let s = F::zero() - position.q - position.r;\\n\\n\\n\\n let q_diff = (q.round() - q).abs();\\n\\n let r_diff = (r.round() - r).abs();\\n\\n let s_diff = (s.round() - s).abs();\\n\\n\\n\\n if q_diff > r_diff && q_diff > s_diff {\\n\\n q = F::zero() - r - s;\\n\\n } else if r_diff > s_diff {\\n\\n r = F::zero() - q - s;\\n\\n } else {\\n\\n // Not Needed with axial coordinate math\\n\\n // s = F::zero() - q - r;\\n\\n }\\n\\n\\n\\n Coordinate {\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 44,\n \"score\": 12.264339092170959\n },\n {\n \"content\": \"#[doc = include_str!(\\\"bearing.svg\\\")]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub struct Bearing<I: Integer = i32> {\\n\\n /// Coordinate\\n\\n pub coordinate: Coordinate<I>,\\n\\n /// Direction\\n\\n pub direction: Direction,\\n\\n}\\n\\n\\n\\nimpl<I: Integer> Bearing<I> {\\n\\n /// Create a new Bearing from Coordinate and Direction\\n\\n pub fn new(coordinate: Coordinate<I>, direction: Direction) -> Bearing<I> {\\n\\n Bearing {\\n\\n coordinate,\\n\\n direction,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bearing.rs\",\n \"rank\": 45,\n \"score\": 11.951391768641418\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Float, Integer};\\n\\n\\n\\n/// Angle, relative to a Direction\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\",\n \"file_path\": \"src/angle.rs\",\n \"rank\": 46,\n \"score\": 11.902961239985695\n },\n {\n \"content\": \"\\n\\n/// Integer Coordinate on 2d hexagonal grid\\n\\n///\\n\\n/// Coordinate Components (Cubic -> Axial):\\n\\n/// * x -> q\\n\\n/// * y -> -q - r\\n\\n/// * z -> r\\n\\n///\\n\\n/// ## Hex Orientations\\n\\n/// ### Flat Topped:\\n\\n#[doc = include_str!(\\\"flat.svg\\\")]\\n\\n/// ### Pointy Topped:\\n\\n#[doc = include_str!(\\\"pointy.svg\\\")]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Default, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub struct Coordinate<I: Integer = i32> {\\n\\n /// `q` coordinate\\n\\n pub q: I,\\n\\n /// `r` coordinate\\n\\n pub r: I,\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 47,\n \"score\": 11.884561802221116\n },\n {\n \"content\": \" (coord, (qo, ro))\\n\\n }\\n\\n\\n\\n /// Convert center point to cartesian coordinates using `spacing`, where the size parameter\\n\\n /// is the edge length of a hexagon.\\n\\n ///\\n\\n /// This function is meant for graphical user interfaces where resolution is big enough that\\n\\n /// floating point calculation make sense.\\n\\n ///\\n\\n /// See [Hex to Screen](https://www.redblobgames.com/grids/hexagons/implementation.html#hex-to-pixel)\\n\\n pub fn cartesian_center<F: Float>(&self, spacing: Spacing<F>) -> (F, F) {\\n\\n let f2: F = F::from(2).unwrap();\\n\\n let f3: F = F::from(3).unwrap();\\n\\n let f3s: F = f3.sqrt();\\n\\n let q: F = F::from(self.q).unwrap();\\n\\n let r: F = F::from(self.r).unwrap();\\n\\n\\n\\n match spacing {\\n\\n Spacing::FlatTop(size) => (size * (f3 / f2 * q), size * (f3s / f2 * q + f3s * r)),\\n\\n Spacing::PointyTop(size) => (size * (f3s * q + f3s / f2 * r), size * (f3 / f2 * r)),\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 48,\n \"score\": 11.784292201028094\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Angle, Coordinate, Direction, Integer, Spin};\\n\\nuse std::usize;\\n\\n\\n\\n/// Iterates through all hexes in a hexagonal shaped spiral pattern.\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 49,\n \"score\": 11.044065187765721\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Angle, Bearing, Coordinate, Integer, Spin};\\n\\nuse std::cmp::max;\\n\\n\\n\\n/// Iterates in a ring around an origin at provided radius.\\n\",\n \"file_path\": \"src/ring.rs\",\n \"rank\": 50,\n \"score\": 10.936829509123628\n },\n {\n \"content\": \" ret\\n\\n }\\n\\n\\n\\n fn size_hint(&self) -> (usize, Option<usize>) {\\n\\n if self.fuse {\\n\\n return (0, Some(0));\\n\\n }\\n\\n\\n\\n let total_size: usize = (0..=self.radius.to_usize().unwrap())\\n\\n .map(|layer| if layer == 0 { 1 } else { layer * 6 })\\n\\n .sum();\\n\\n let remaining = total_size - self.idx.to_usize().unwrap();\\n\\n\\n\\n (remaining, Some(remaining))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> std::iter::FusedIterator for Spiral<I> {}\\n\\nimpl<I: Integer> std::iter::ExactSizeIterator for Spiral<I> {}\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 51,\n \"score\": 10.795557403051422\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::Direction;\\n\\n\\n\\n/// Spin Direction\\n\\n#[doc = include_str!(\\\"spin.svg\\\")]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub enum Spin {\\n\\n /// Clockwise\\n\\n CW(Direction),\\n\\n /// Counterclockwise\\n\\n CCW(Direction),\\n\\n}\\n\",\n \"file_path\": \"src/spin.rs\",\n \"rank\": 52,\n \"score\": 10.773474863546875\n },\n {\n \"content\": \" I::to_usize(&(self.r * I::from_u8(6).unwrap())).unwrap()\\n\\n };\\n\\n let past: usize =\\n\\n num::ToPrimitive::to_usize(max(&I::zero(), &(self.jj + self.ii * self.r))).unwrap();\\n\\n (total_size - past, Some(total_size - past))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> std::iter::FusedIterator for Ring<I> {}\\n\\nimpl<I: Integer> std::iter::ExactSizeIterator for Ring<I> {}\\n\",\n \"file_path\": \"src/ring.rs\",\n \"rank\": 53,\n \"score\": 10.665169317120885\n },\n {\n \"content\": \" #[doc = include_str!(\\\"ring.svg\\\")]\\n\\n ///\\n\\n /// ```\\n\\n ///\\n\\n /// use hexgrid::{Coordinate, Spin, Direction};\\n\\n ///\\n\\n /// let center = Coordinate::from_axial(5, -1);\\n\\n ///\\n\\n /// for &c in ¢er.neighbors() {\\n\\n /// for ring_c in c.ring_iter(5, Spin::CCW(Direction::XY)) {\\n\\n /// assert_eq!(c.distance(ring_c), 5);\\n\\n /// }\\n\\n /// }\\n\\n /// ```\\n\\n pub fn ring_iter(&self, radius: I, spin: Spin) -> Ring<I> {\\n\\n Ring::new(self, radius, spin)\\n\\n }\\n\\n\\n\\n /// Iterates in a spiral around an origin out to the supplied radius.\\n\\n ///\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 54,\n \"score\": 10.534652340729089\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Direction from center `(0, 0)` to coordinate\\n\\n ///\\n\\n /// In case of diagonals (edge of two major directions), prefers direction that is clockwise\\n\\n /// from the diagonal\\n\\n ///\\n\\n /// Returns:\\n\\n /// None if is center\\n\\n ///\\n\\n pub fn direction_from_center_cw(&self) -> Option<Direction> {\\n\\n let x = self.x();\\n\\n let y = self.y();\\n\\n let z = self.z();\\n\\n\\n\\n let xz = if y < I::zero() { x >= z } else { x > z };\\n\\n let zy = if x < I::zero() { z >= y } else { z > y };\\n\\n let yx = if z < I::zero() { y >= x } else { y > x };\\n\\n\\n\\n match (xz, zy, yx) {\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 55,\n \"score\": 10.498751703215468\n },\n {\n \"content\": \" self.r += One::one();\\n\\n self.counter += 1;\\n\\n ret\\n\\n }\\n\\n\\n\\n fn size_hint(&self) -> (usize, Option<usize>) {\\n\\n let rc = (if self.radius < Zero::zero() {\\n\\n I::one() - self.radius\\n\\n } else {\\n\\n self.radius\\n\\n })\\n\\n .to_usize()\\n\\n .unwrap();\\n\\n let total_size = 3 * (rc + rc * rc) + 1;\\n\\n let current_size = total_size - self.counter;\\n\\n (current_size, Some(current_size))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> std::iter::FusedIterator for RangeIter<I> {}\\n\\nimpl<I: Integer> std::iter::ExactSizeIterator for RangeIter<I> {}\\n\",\n \"file_path\": \"src/range.rs\",\n \"rank\": 56,\n \"score\": 10.3556871496485\n },\n {\n \"content\": \"\\n\\n /// Cubic `Y` component.\\n\\n pub fn y(&self) -> I {\\n\\n I::zero() - self.q - self.r\\n\\n }\\n\\n\\n\\n /// Cubic `Z` component.\\n\\n pub fn z(&self) -> I {\\n\\n self.r\\n\\n }\\n\\n\\n\\n /// Distance from Origin\\n\\n pub fn length(&self) -> I {\\n\\n let q = self.q.abs();\\n\\n let r = self.r.abs();\\n\\n let s = (I::zero() - self.q - self.r).abs();\\n\\n (q + r + s) / I::from_u8(2).unwrap()\\n\\n }\\n\\n\\n\\n /// Convert Coordinate into fractional [Position](crate::Position).\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 57,\n \"score\": 9.889491744380535\n },\n {\n \"content\": \" r = F::zero() - q - s;\\n\\n } else {\\n\\n // Not necessary with axial coordinate math\\n\\n // s = F::zero() - q - r;\\n\\n }\\n\\n\\n\\n if q_diff + r_diff + s_diff > F::from(0.99).unwrap() {\\n\\n None\\n\\n } else {\\n\\n Some(Coordinate {\\n\\n q: I::from(q).unwrap(),\\n\\n r: I::from(r).unwrap(),\\n\\n })\\n\\n }\\n\\n }\\n\\n\\n\\n /// Cubic `X` component.\\n\\n pub fn x(&self) -> I {\\n\\n self.q\\n\\n }\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 58,\n \"score\": 9.552260408907381\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::spin::Spin;\\n\\nuse crate::{Angle, Bearing, Float, Integer};\\n\\nuse std::fmt::Formatter;\\n\\n\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 59,\n \"score\": 9.393622191646601\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /// Create a set of ordered cartesian points to draw a hex.\\n\\n ///\\n\\n /// Reference:\\n\\n /// [Layout](https://www.redblobgames.com/grids/hexagons/implementation.html#layout)\\n\\n /// [Drawing a Hex](https://www.redblobgames.com/grids/hexagons/implementation.html#hex-geometry)\\n\\n pub fn to_corner_points<F: Float>(&self, spacing: Spacing<F>) -> [(F, F); 6] {\\n\\n let fz: F = F::zero();\\n\\n let fh: F = F::from(0.5).unwrap();\\n\\n let f2: F = F::from(2).unwrap();\\n\\n let f6: F = F::from(6).unwrap();\\n\\n let pi: F = F::from(std::f64::consts::PI).unwrap();\\n\\n let center: (F, F) = self.cartesian_center(spacing);\\n\\n let corner_offset = |i| {\\n\\n let corner = F::from_u8(i).unwrap();\\n\\n let (start_angle, size) = match spacing {\\n\\n Spacing::FlatTop(size) => (fz, size),\\n\\n Spacing::PointyTop(size) => (fh, size),\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 60,\n \"score\": 9.369194631702056\n },\n {\n \"content\": \"\\n\\n /// Direction from self to `coordinate`\\n\\n ///\\n\\n /// In case of diagonals (edge of two major directions), prefers direction that is clockwise\\n\\n /// from the diagonal.\\n\\n ///\\n\\n /// Returns:\\n\\n /// None if is center\\n\\n pub fn direction_to_cw(&self, coordinate: Coordinate<I>) -> Option<Direction> {\\n\\n (coordinate - *self).direction_from_center_cw()\\n\\n }\\n\\n\\n\\n /// Direction from self to `coordinate`\\n\\n ///\\n\\n /// In case of diagonals (edge of two major directions), prefers direction that is\\n\\n /// counter-clockwise from the diagonal.\\n\\n ///\\n\\n /// Returns:\\n\\n /// None if is center\\n\\n pub fn direction_to_ccw(&self, coordinate: Coordinate<I>) -> Option<Direction> {\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 61,\n \"score\": 9.208017424932146\n },\n {\n \"content\": \" /// Example: Elements in order for all rings from radius 0 to radius 2, Direction ZX, CCW\\n\\n ///\\n\\n /// ### Ring Iteration Pattern:\\n\\n #[doc = include_str!(\\\"spiral.svg\\\")]\\n\\n /// ```rust\\n\\n /// use hexgrid::{Coordinate, Spin, Direction};\\n\\n ///\\n\\n /// let locations = Coordinate::from_axial(0, 0).spiral_iter(2, Spin::CW(Direction::YZ)).collect::<Vec<_>>();\\n\\n ///\\n\\n /// assert_eq!(locations.len(), 19);\\n\\n /// assert_eq!(locations[0].distance(Coordinate::from_axial(0,0)), 0);\\n\\n /// assert_eq!(locations[1].distance(Coordinate::from_axial(0,0)), 1);\\n\\n /// assert_eq!(locations[7].distance(Coordinate::from_axial(0,0)), 2);\\n\\n ///\\n\\n /// ```\\n\\n pub fn spiral_iter(&self, radius: I, spin: Spin) -> Spiral<I> {\\n\\n Spiral::new(*self, radius, spin)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 62,\n \"score\": 9.166604948544723\n },\n {\n \"content\": \"\\n\\nimpl<I: Integer> Ring<I> {\\n\\n pub(crate) fn new(origin: &Coordinate<I>, radius: I, spin: Spin) -> Ring<I> {\\n\\n let (start_angle, step_angle, start_dir) = match spin {\\n\\n Spin::CW(d) => (\\n\\n if radius >= I::zero() {\\n\\n Angle::RightBackward\\n\\n } else {\\n\\n Angle::LeftForward\\n\\n },\\n\\n Angle::RightForward,\\n\\n d,\\n\\n ),\\n\\n Spin::CCW(d) => (\\n\\n if radius >= I::zero() {\\n\\n Angle::LeftBackward\\n\\n } else {\\n\\n Angle::RightForward\\n\\n },\\n\\n Angle::LeftForward,\\n\",\n \"file_path\": \"src/ring.rs\",\n \"rank\": 63,\n \"score\": 9.102789519413921\n },\n {\n \"content\": \" (coordinate - *self).direction_from_center_ccw()\\n\\n }\\n\\n\\n\\n /// Distance between two Coordinates\\n\\n pub fn distance(&self, coordinate: Coordinate<I>) -> I {\\n\\n ((self.x() - coordinate.x()).abs()\\n\\n + (self.y() - coordinate.y()).abs()\\n\\n + (self.z() - coordinate.z()).abs())\\n\\n / I::from_i8(2).unwrap()\\n\\n }\\n\\n\\n\\n /// An iterator over all coordinates in radius `r`\\n\\n pub fn range_iter(&self, radius: I) -> RangeIter<I> {\\n\\n RangeIter::new(self, radius)\\n\\n }\\n\\n\\n\\n /// Iterates in a ring around an origin at provided radius.\\n\\n ///\\n\\n /// Example: Elements in order for Ring of radius 2, Direction YZ, CW\\n\\n ///\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 64,\n \"score\": 9.088699401579964\n },\n {\n \"content\": \"\\n\\n fn sub(self, c: T) -> Angle {\\n\\n let c: Direction = c.into();\\n\\n\\n\\n Angle::from_int::<i8>(self.to_int::<i8>() - c.to_int::<i8>())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Spin> for Direction {\\n\\n fn from(spin: Spin) -> Self {\\n\\n match spin {\\n\\n Spin::CW(d) => d,\\n\\n Spin::CCW(d) => d,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> From<Bearing<I>> for Direction {\\n\\n fn from(bearing: Bearing<I>) -> Self {\\n\\n bearing.direction\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 65,\n \"score\": 8.530381950229028\n },\n {\n \"content\": \"\\n\\n match spacing {\\n\\n IntegerSpacing::FlatTop(w, h) => (w * q, h * (r + r + q) / two),\\n\\n IntegerSpacing::PointyTop(w, h) => (w * (q + q + r) / two, h * r),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Scale coordinate by a factor `scalar`\\n\\n ///\\n\\n /// See [Coordinate arithmetic](https://www.redblobgames.com/grids/hexagons/implementation.html#hex-arithmetic)\\n\\n pub fn scale(&self, scalar: I) -> Coordinate<I> {\\n\\n let q = self.q * scalar;\\n\\n let r = self.r * scalar;\\n\\n Coordinate { q, r }\\n\\n }\\n\\n\\n\\n /// Array with all the neighbors of a coordinate\\n\\n pub fn neighbors(&self) -> [Coordinate<I>; 6] {\\n\\n [\\n\\n *self + Direction::XZ,\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 66,\n \"score\": 8.296950627271356\n },\n {\n \"content\": \" bearing.coordinate\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Integer> From<Direction> for Coordinate<I> {\\n\\n fn from(direction: Direction) -> Self {\\n\\n let (x, y) = match direction {\\n\\n Direction::YZ => (0, -1),\\n\\n Direction::XZ => (1, -1),\\n\\n Direction::XY => (1, 0),\\n\\n Direction::ZY => (0, 1),\\n\\n Direction::ZX => (-1, 1),\\n\\n Direction::YX => (-1, 0),\\n\\n };\\n\\n\\n\\n Coordinate {\\n\\n q: I::from_i8(x).unwrap(),\\n\\n r: I::from_i8(y).unwrap(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 67,\n \"score\": 8.048631972838063\n },\n {\n \"content\": \" &[\\n\\n Direction::YZ,\\n\\n Direction::XZ,\\n\\n Direction::XY,\\n\\n Direction::ZY,\\n\\n Direction::ZX,\\n\\n Direction::YX,\\n\\n ]\\n\\n }\\n\\n\\n\\n /// Return a vector of an arc including Directions `steps` away from the original Direction both\\n\\n /// sides from left to right.\\n\\n ///\\n\\n /// ```\\n\\n /// use hexgrid::{Direction};\\n\\n /// use hexgrid::Angle::*;\\n\\n ///\\n\\n /// for &d in Direction::all() {\\n\\n /// assert_eq!(d.arc(0), vec!(d));\\n\\n /// assert_eq!(d.arc(1), vec!(d + LeftForward, d, d + RightForward));\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 68,\n \"score\": 8.01646825175593\n },\n {\n \"content\": \" XZ,\\n\\n /// +X -Y\\n\\n XY,\\n\\n /// +Z -Y\\n\\n ZY,\\n\\n /// +Z -X\\n\\n ZX,\\n\\n /// +Y -X\\n\\n YX,\\n\\n}\\n\\n\\n\\nimpl Direction {\\n\\n /// Static array of all directions\\n\\n ///\\n\\n /// ```\\n\\n /// use hexgrid::Direction;\\n\\n ///\\n\\n /// assert_eq!(Direction::all().len(), 6);\\n\\n /// ```\\n\\n pub fn all() -> &'static [Direction; 6] {\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 69,\n \"score\": 8.003390953393897\n },\n {\n \"content\": \"///\\n\\n/// ### Flat Topped:\\n\\n#[doc = include_str!(\\\"flat.svg\\\")]\\n\\n/// ### Pointy Topped:\\n\\n#[doc = include_str!(\\\"pointy.svg\\\")]\\n\\n#[derive(Debug, Ord, PartialOrd, Eq, PartialEq, Copy, Clone, Hash)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub enum Sextant {\\n\\n /// YZ Sextant\\n\\n YZ,\\n\\n /// XZ Sextant\\n\\n XZ,\\n\\n /// XY Sextant\\n\\n XY,\\n\\n /// ZY Sextant\\n\\n ZY,\\n\\n /// ZX Sextant\\n\\n ZX,\\n\\n /// YX Sextant\\n\\n YX,\\n\",\n \"file_path\": \"src/sextant.rs\",\n \"rank\": 70,\n \"score\": 7.880418730839613\n },\n {\n \"content\": \"#[derive(Clone, Debug, Default)]\\n\\npub struct SparseHexStorage<I: Integer, D>(HashMap<Coordinate<I>, D>);\\n\\n\\n\\nimpl<I: Integer, D> SparseHexStorage<I, D> {\\n\\n /// Set Contents of Hex.\\n\\n pub fn set(&mut self, coordinate: &Coordinate<I>, data: D) {\\n\\n self.0.insert(coordinate.clone(), data);\\n\\n }\\n\\n /// Get contents of hex.\\n\\n pub fn get(&self, coordinate: &Coordinate<I>) -> Option<&D> {\\n\\n self.0.get(&coordinate)\\n\\n }\\n\\n /// Get contents of hex mutably.\\n\\n pub fn get_mut(&mut self, coordinate: &Coordinate<I>) -> Option<&mut D> {\\n\\n self.0.get_mut(&coordinate)\\n\\n }\\n\\n /// Get contents of hex mutably, calling f if data doesn't exist.\\n\\n pub fn get_mut_or_insert(\\n\\n &mut self,\\n\\n coordinate: &Coordinate<I>,\\n\",\n \"file_path\": \"src/sparse.rs\",\n \"rank\": 71,\n \"score\": 7.825564338670303\n },\n {\n \"content\": \" *self + Angle::LeftBackward,\\n\\n *self + Angle::LeftForward,\\n\\n *self,\\n\\n *self + Angle::RightForward,\\n\\n *self + Angle::RightBackward,\\n\\n *self + Angle::Backward,\\n\\n ],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Create Direction from integer in [0, 6) range\\n\\n ///\\n\\n /// This should probably be internal\\n\\n pub fn from_int<I: Integer>(i: I) -> Direction {\\n\\n match i.mod_floor(&I::from_i8(6).unwrap()).to_u8().unwrap() {\\n\\n 0 => Direction::YZ,\\n\\n 1 => Direction::XZ,\\n\\n 2 => Direction::XY,\\n\\n 3 => Direction::ZY,\\n\\n 4 => Direction::ZX,\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 72,\n \"score\": 7.7264097922949215\n },\n {\n \"content\": \" };\\n\\n let angle = f2 * pi * (start_angle + corner) / f6;\\n\\n (center.0 + size * angle.cos(), center.1 + size * angle.sin())\\n\\n };\\n\\n [\\n\\n corner_offset(0),\\n\\n corner_offset(1),\\n\\n corner_offset(2),\\n\\n corner_offset(3),\\n\\n corner_offset(4),\\n\\n corner_offset(5),\\n\\n ]\\n\\n }\\n\\n\\n\\n /// Convert to integer pixel coordinates using `spacing`, where the\\n\\n /// parameters mean the width and height multiplications\\n\\n pub fn to_pixel_integer(&self, spacing: IntegerSpacing<I>) -> (I, I) {\\n\\n let q = self.q;\\n\\n let r = self.z();\\n\\n let two = I::from_i8(2).unwrap();\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 73,\n \"score\": 7.709434126598554\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Coordinate, Integer};\\n\\nuse num::{One, Zero};\\n\\nuse std::cmp::{max, min};\\n\\n\\n\",\n \"file_path\": \"src/range.rs\",\n \"rank\": 74,\n \"score\": 7.423104903020796\n },\n {\n \"content\": \"/// Cubic Direction on a hexagonal map.\\n\\n///\\n\\n/// See [Coordinate](crate::Coordinate) for graph with directions.\\n\\n///\\n\\n/// Naming convention: increasing coordinate for a given direction is first\\n\\n/// decreasing is second. The missing coordinate is unaffected by a move in\\n\\n/// a given direction.\\n\\n///\\n\\n/// ## Hex Orientations\\n\\n/// ### Flat Topped:\\n\\n#[doc = include_str!(\\\"flat.svg\\\")]\\n\\n/// ### Pointy Topped:\\n\\n#[doc = include_str!(\\\"pointy.svg\\\")]\\n\\n///\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub enum Direction {\\n\\n /// +Y -Z\\n\\n YZ,\\n\\n /// +X -Z\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 75,\n \"score\": 7.299406955977377\n },\n {\n \"content\": \" *self + Direction::XY,\\n\\n *self + Direction::ZY,\\n\\n *self + Direction::ZX,\\n\\n *self + Direction::YX,\\n\\n *self + Direction::YZ,\\n\\n ]\\n\\n }\\n\\n\\n\\n /// Rotate self around a point `(0, 0, 0)` using angle of rotation `a`\\n\\n pub fn rotate_around_zero(&self, a: Angle) -> Coordinate<I> {\\n\\n let (x, y, z) = (self.q, self.r, self.z());\\n\\n\\n\\n let (x, y) = match a {\\n\\n Angle::Forward => (x, y),\\n\\n Angle::RightForward => (-z, -x),\\n\\n Angle::RightBackward => (y, z),\\n\\n Angle::Backward => (-x, -y),\\n\\n Angle::LeftBackward => (z, x),\\n\\n Angle::LeftForward => (-y, -z),\\n\\n };\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 76,\n \"score\": 7.231335755024899\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<I: Integer> Coordinate<I> {\\n\\n /// Create new Coordinate from `q` and `r` axial components.\\n\\n ///\\n\\n /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/implementation.html#hex)\\n\\n pub fn from_axial(q: I, r: I) -> Coordinate<I> {\\n\\n Coordinate { q, r }\\n\\n }\\n\\n\\n\\n /// Create new Coordinate from `x`, `y`, and `z` cubic components.\\n\\n ///\\n\\n /// See [Hex Coordinates](https://www.redblobgames.com/grids/hexagons/implementation.html#hex)\\n\\n pub fn from_cubic(x: I, y: I, z: I) -> Coordinate<I> {\\n\\n assert!(x + y + z == I::zero());\\n\\n Coordinate { q: x, r: y }\\n\\n }\\n\\n\\n\\n /// Round position to nearest hex coordinates\\n\\n ///\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 77,\n \"score\": 7.156904812849765\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Coordinate, Integer};\\n\\nuse std::collections::HashMap;\\n\\n\\n\\n/// Sparse Hex Grid Data Storage\\n\",\n \"file_path\": \"src/sparse.rs\",\n \"rank\": 78,\n \"score\": 7.122292588782389\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Coordinate, Integer};\\n\\n\\n\\n///\\n\\n/// Which slice of a hexgrid does a coordinate exist in.\\n\",\n \"file_path\": \"src/sextant.rs\",\n \"rank\": 79,\n \"score\": 6.897961893692591\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<I: Integer> From<Coordinate<I>> for Sextant {\\n\\n fn from(coordinate: Coordinate<I>) -> Self {\\n\\n match (\\n\\n coordinate.x() >= I::zero(),\\n\\n coordinate.y() >= I::zero(),\\n\\n coordinate.z() >= I::zero(),\\n\\n ) {\\n\\n (true, false, true) => Sextant::YZ,\\n\\n (true, false, false) => Sextant::XZ,\\n\\n (true, true, false) => Sextant::XY,\\n\\n (false, true, false) => Sextant::ZY,\\n\\n (false, true, true) => Sextant::ZX,\\n\\n (false, false, true) => Sextant::YX,\\n\\n _ => panic!(\\\"You Broke Math\\\"),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sextant.rs\",\n \"rank\": 80,\n \"score\": 6.8871551972380765\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Hans W. Uhlig. All Rights Reserved.\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\nuse crate::{Angle, Coordinate, Direction, Integer};\\n\\n\\n\\n/// Coordinate and Directional Component Pair on a 2d hexagonal grid.\\n\\n///\\n\",\n \"file_path\": \"src/bearing.rs\",\n \"rank\": 81,\n \"score\": 6.7768688521555305\n },\n {\n \"content\": \" (true, true, false) => Some(Direction::XZ),\\n\\n (true, false, false) => Some(Direction::XY),\\n\\n (true, false, true) => Some(Direction::ZY),\\n\\n\\n\\n (false, false, true) => Some(Direction::ZX),\\n\\n (false, true, true) => Some(Direction::YZ),\\n\\n (false, true, false) => Some(Direction::YX),\\n\\n\\n\\n (false, false, false) => None,\\n\\n (true, true, true) => panic!(\\\"You broke math\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Directions that lead from center to a given point.\\n\\n ///\\n\\n /// Returns an array of one or two directions.\\n\\n pub fn directions_from_center(&self) -> Vec<Direction> {\\n\\n let x = self.x();\\n\\n let y = self.y();\\n\\n let z = self.z();\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 82,\n \"score\": 6.553089419508272\n },\n {\n \"content\": \" /// ```notrust\\n\\n /// use hexgrid::{Angle, Direction, Coordinate};\\n\\n ///\\n\\n /// let center = Coordinate::from_axial(0, 0);\\n\\n ///\\n\\n /// assert_eq!(center.direction_from_center_ccw(), None);\\n\\n ///\\n\\n /// for &d in Direction::all() {\\n\\n /// assert_eq!((center + d).direction_from_center_ccw(), Some(d));\\n\\n /// assert_eq!((center + d + (d + Angle::LeftForward)).direction_from_center_ccw(), Some(d + Angle::LeftForward));\\n\\n /// assert_eq!((center + d + (d + Angle::RightForward)).direction_from_center_ccw(), Some(d));\\n\\n /// }\\n\\n /// ```\\n\\n pub fn direction_from_center_ccw(&self) -> Option<Direction> {\\n\\n let x = self.x();\\n\\n let y = self.y();\\n\\n let z = self.z();\\n\\n\\n\\n let xz = if y > I::zero() { x >= z } else { x > z }; // t\\n\\n let zy = if x > I::zero() { z >= y } else { z > y }; // f\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 83,\n \"score\": 6.465019876934501\n },\n {\n \"content\": \" let yx = if z > I::zero() { y >= x } else { y > x }; // f\\n\\n\\n\\n match (xz, zy, yx) {\\n\\n (true, true, false) => Some(Direction::XZ),\\n\\n (true, false, false) => Some(Direction::XY),\\n\\n (true, false, true) => Some(Direction::ZY),\\n\\n\\n\\n (false, false, true) => Some(Direction::ZX),\\n\\n (false, true, true) => Some(Direction::YX),\\n\\n (false, true, false) => Some(Direction::YZ),\\n\\n\\n\\n (false, false, false) => None,\\n\\n (true, true, true) => panic!(\\\"You broke math\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Directions from self to `coordinate`\\n\\n pub fn directions_to(&self, coordinate: Coordinate<I>) -> Vec<Direction> {\\n\\n (coordinate - *self).directions_from_center()\\n\\n }\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 84,\n \"score\": 6.4009919326896085\n },\n {\n \"content\": \" assert_eq!(1, ring.len());\\n\\n assert_eq!(ring[0], c);\\n\\n }\\n\\n {\\n\\n // CCW r0\\n\\n let ring = c.ring_iter(0, Spin::CCW(d)).collect::<Vec<_>>();\\n\\n\\n\\n assert_eq!(1, ring.len());\\n\\n assert_eq!(ring[0], c);\\n\\n }\\n\\n {\\n\\n // CCW r1\\n\\n let ring = c.ring_iter(1, Spin::CW(d)).collect::<Vec<_>>();\\n\\n\\n\\n assert_eq!(6, ring.len());\\n\\n assert_eq!(ring[0], c + d);\\n\\n assert_eq!(ring[1], c + (d + RightForward));\\n\\n assert_eq!(ring[2], c + (d + RightBackward));\\n\\n assert_eq!(ring[3], c + (d + Backward));\\n\\n assert_eq!(ring[4], c + (d + LeftBackward));\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 85,\n \"score\": 6.35265433853515\n },\n {\n \"content\": \" assert_eq!(c, Coordinate::from_cartesian(x, y, spacing));\\n\\n });\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn simple_from_pixel_integer() {\\n\\n for &spacing in [\\n\\n IntegerSpacing::PointyTop(2, 1),\\n\\n IntegerSpacing::PointyTop(4, 6),\\n\\n IntegerSpacing::FlatTop(3, 2),\\n\\n ]\\n\\n .iter()\\n\\n {\\n\\n with_test_points(|c: Coordinate| {\\n\\n let ascii_pix = c.to_pixel_integer(spacing);\\n\\n let (coord, pix_off) = Coordinate::nearest_with_offset(spacing, ascii_pix);\\n\\n assert_eq!((c, (0, 0)), (coord, pix_off));\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 86,\n \"score\": 6.009913348175454\n },\n {\n \"content\": \" d,\\n\\n ),\\n\\n };\\n\\n\\n\\n let cur_coord: Coordinate<I> = *origin + Coordinate::from(start_dir).scale(radius);\\n\\n let cur_dir = start_dir + start_angle;\\n\\n\\n\\n Ring {\\n\\n origin: origin.clone(),\\n\\n current: Bearing::new(cur_coord, cur_dir),\\n\\n step_angle,\\n\\n r: I::abs(&radius),\\n\\n ii: I::zero(),\\n\\n jj: I::zero(),\\n\\n fuse: false,\\n\\n }\\n\\n }\\n\\n /// Get Radius of the `Ring`\\n\\n pub fn radius(&self) -> I {\\n\\n self.r\\n\",\n \"file_path\": \"src/ring.rs\",\n \"rank\": 87,\n \"score\": 5.893703088560588\n },\n {\n \"content\": \" assert_eq!(ring[1], c + d + d + (d + RightBackward));\\n\\n assert_eq!(ring[7], c - d - d - (d + RightBackward));\\n\\n assert_eq!(ring[11], c + d + d + (d + LeftBackward));\\n\\n }\\n\\n {\\n\\n // CCW r2\\n\\n let ring = c.ring_iter(2, Spin::CCW(d)).collect::<Vec<_>>();\\n\\n\\n\\n assert_eq!(12, ring.len());\\n\\n assert_eq!(ring[0], c + d + d);\\n\\n assert_eq!(ring[1], c + d + d + (d + LeftBackward));\\n\\n assert_eq!(ring[7], c - d - d - (d + LeftBackward));\\n\\n assert_eq!(ring[11], c + d + d + (d + RightBackward));\\n\\n }\\n\\n {\\n\\n // CW r-2\\n\\n let ring = c.ring_iter(-2, Spin::CW(d)).collect::<Vec<_>>();\\n\\n\\n\\n assert_eq!(12, ring.len());\\n\\n assert_eq!(ring[0], c - d - d);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 88,\n \"score\": 5.834935401791242\n },\n {\n \"content\": \" assert_eq!(ring[5], c + (d + LeftForward));\\n\\n }\\n\\n {\\n\\n // CCW r1\\n\\n let ring = c.ring_iter(1, Spin::CCW(d)).collect::<Vec<_>>();\\n\\n\\n\\n assert_eq!(6, ring.len());\\n\\n assert_eq!(ring[0], c + d);\\n\\n assert_eq!(ring[1], c + (d + LeftForward));\\n\\n assert_eq!(ring[2], c + (d + LeftBackward));\\n\\n assert_eq!(ring[3], c + (d + Backward));\\n\\n assert_eq!(ring[4], c + (d + RightBackward));\\n\\n assert_eq!(ring[5], c + (d + RightForward));\\n\\n }\\n\\n {\\n\\n // CW r2\\n\\n let ring = c.ring_iter(2, Spin::CW(d)).collect::<Vec<_>>();\\n\\n\\n\\n assert_eq!(12, ring.len());\\n\\n assert_eq!(ring[0], c + d + d);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 89,\n \"score\": 5.834935401791242\n },\n {\n \"content\": \" Spin::CW(direction) => (Angle::RightBackward, Angle::RightForward, direction),\\n\\n Spin::CCW(direction) => (Angle::LeftBackward, Angle::LeftForward, direction),\\n\\n };\\n\\n\\n\\n Spiral {\\n\\n origin_coordinate: origin,\\n\\n current_coordinate: origin + start_direction,\\n\\n current_direction: start_direction + start_angle,\\n\\n start_direction,\\n\\n step_angle,\\n\\n layer: I::zero(),\\n\\n idx: I::zero(),\\n\\n ii: I::zero(),\\n\\n jj: I::zero(),\\n\\n fuse: false,\\n\\n radius,\\n\\n }\\n\\n }\\n\\n /// Get current layer of the `Spiral`\\n\\n pub fn layer(&self) -> I {\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 90,\n \"score\": 5.45094437476978\n },\n {\n \"content\": \"#### 5. Submission of Contributions\\n\\n\\n\\nUnless You explicitly state otherwise, any Contribution intentionally submitted\\n\\nfor inclusion in the Work by You to the Licensor shall be under the terms and\\n\\nconditions of this License, without any additional terms or conditions.\\n\\nNotwithstanding the above, nothing herein shall supersede or modify the terms of\\n\\nany separate license agreement you may have executed with Licensor regarding\\n\\nsuch Contributions.\\n\\n\\n\\n#### 6. Trademarks\\n\\n\\n\\nThis License does not grant permission to use the trade names, trademarks,\\n\\nservice marks, or product names of the Licensor, except as required for\\n\\nreasonable and customary use in describing the origin of the Work and\\n\\nreproducing the content of the NOTICE file.\\n\\n\\n\\n#### 7. Disclaimer of Warranty\\n\\n\\n\\nUnless required by applicable law or agreed to in writing, Licensor provides the\\n\\nWork (and each Contributor provides its Contributions) on an \\\"AS IS\\\" BASIS,\\n\\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,\\n\\nincluding, without limitation, any warranties or conditions of TITLE,\\n\\nNON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are\\n\\nsolely responsible for determining the appropriateness of using or\\n\\nredistributing the Work and assume any risks associated with Your exercise of\\n\\npermissions under this License.\\n\\n\\n\\n#### 8. Limitation of Liability\\n\\n\\n\\nIn no event and under no legal theory, whether in tort (including negligence),\\n\\ncontract, or otherwise, unless required by applicable law (such as deliberate\\n\\nand grossly negligent acts) or agreed to in writing, shall any Contributor be\\n\\nliable to You for damages, including any direct, indirect, special, incidental,\\n\\nor consequential damages of any character arising as a result of this License or\\n\\nout of the use or inability to use the Work (including but not limited to\\n\\ndamages for loss of goodwill, work stoppage, computer failure or malfunction, or\\n\\nany and all other commercial damages or losses), even if such Contributor has\\n\\nbeen advised of the possibility of such damages.\\n\\n\\n\",\n \"file_path\": \"LICENSE.md\",\n \"rank\": 91,\n \"score\": 5.419729518661889\n },\n {\n \"content\": \" dirs.push(Direction::YZ)\\n\\n }\\n\\n\\n\\n if y > I::zero() && x < I::zero() {\\n\\n dirs.push(Direction::YX)\\n\\n }\\n\\n\\n\\n dirs\\n\\n }\\n\\n\\n\\n /// Direction from center `(0, 0)` to coordinate\\n\\n ///\\n\\n /// In case of diagonals (edge of two major directions), prefers direction that is\\n\\n /// counter-clockwise from the diagonal.\\n\\n ///\\n\\n /// Returns:\\n\\n /// None if is center\\n\\n ///\\n\\n /// TODO: Example/Function broken.\\n\\n ///\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 92,\n \"score\": 5.398755934266719\n },\n {\n \"content\": \" self.fuse = true;\\n\\n return None;\\n\\n }\\n\\n self.layer += I::one();\\n\\n self.ii = I::zero();\\n\\n self.current_coordinate = Coordinate::from(self.start_direction).scale(self.layer);\\n\\n }\\n\\n // Rotate Direction by Step Angle, and set side position to zero\\n\\n self.current_direction = self.current_direction + self.step_angle;\\n\\n self.jj = I::zero();\\n\\n }\\n\\n // Increment Side Position\\n\\n self.jj += I::one();\\n\\n // Increment index. TODO: Remove\\n\\n self.idx += I::one();\\n\\n\\n\\n let ret = Some(self.current_coordinate);\\n\\n let current_direction_offset: Coordinate<_> = self.current_direction.into();\\n\\n self.current_coordinate = self.current_coordinate + current_direction_offset;\\n\\n\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 93,\n \"score\": 5.161834154555799\n },\n {\n \"content\": \" let two: I = I::from_i8(2).unwrap();\\n\\n\\n\\n let ((q, qo), (r, ro)) = match spacing {\\n\\n IntegerSpacing::FlatTop(w, h) => (\\n\\n (asc_x.div_floor(&w), asc_x.mod_floor(&w)),\\n\\n (\\n\\n (asc_y - h * asc_x.div_floor(&w) / two).div_floor(&h),\\n\\n (asc_y + h / two * asc_x.div_floor(&w)).mod_floor(&h),\\n\\n ),\\n\\n ),\\n\\n IntegerSpacing::PointyTop(w, h) => (\\n\\n (\\n\\n (asc_x - w * asc_y.div_floor(&h) / two).div_floor(&w),\\n\\n (asc_x + w / two * asc_y.div_floor(&h)).mod_floor(&w),\\n\\n ),\\n\\n (asc_y.div_floor(&h), asc_y.mod_floor(&h)),\\n\\n ),\\n\\n };\\n\\n\\n\\n let coord = Coordinate { q, r };\\n\",\n \"file_path\": \"src/coordinate.rs\",\n \"rank\": 94,\n \"score\": 4.945614036438238\n },\n {\n \"content\": \"#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug, Ord, PartialOrd)]\\n\\npub enum Angle {\\n\\n /// 0-deg clockwise\\n\\n Forward,\\n\\n /// 60-deg clockwise\\n\\n RightForward,\\n\\n /// 120-deg clockwise\\n\\n RightBackward,\\n\\n /// 180-deg clockwise\\n\\n Backward,\\n\\n /// 240-deg clockwise\\n\\n LeftBackward,\\n\\n /// 300-deg clockwise\\n\\n LeftForward,\\n\\n}\\n\\n\\n\\nimpl Angle {\\n\\n /// Static array of all angles\\n\\n ///\\n\\n /// ```\\n\",\n \"file_path\": \"src/angle.rs\",\n \"rank\": 95,\n \"score\": 4.79044296311571\n },\n {\n \"content\": \"\\n\\n for &dir in Direction::all().iter() {\\n\\n assert_eq!((c + dir).direction_from_center_cw(), Some(dir));\\n\\n assert_eq!((c + dir).direction_from_center_ccw(), Some(dir));\\n\\n assert_eq!(\\n\\n (c + dir + (dir + LeftForward)).direction_from_center_cw(),\\n\\n Some(dir)\\n\\n );\\n\\n assert_eq!(\\n\\n (c + dir + (dir + RightForward)).direction_from_center_ccw(),\\n\\n Some(dir)\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[ignore]\\n\\n fn simple_direction_to() {\\n\\n with_test_points(|c: Coordinate| {\\n\\n assert_eq!(c.direction_to_cw(c), None);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 96,\n \"score\": 4.5617779303388835\n },\n {\n \"content\": \" if self.radius.is_zero() {\\n\\n self.fuse = true;\\n\\n } else {\\n\\n self.layer += I::one();\\n\\n self.idx += I::one();\\n\\n }\\n\\n return Some(self.origin_coordinate);\\n\\n }\\n\\n\\n\\n // ii is the current side relative to the starting location. 0-5\\n\\n // jj is the position on the current side.\\n\\n // if jj > current layer radius. increment side and rotate\\n\\n // if ii > 6, then increment radius and start over.\\n\\n if self.jj >= self.layer.abs() {\\n\\n // Increment current side\\n\\n self.ii += I::one();\\n\\n // if side > 6, increment layer\\n\\n if self.ii >= I::from_u8(6).unwrap() {\\n\\n // If layer is equal or greater than radius, fuse\\n\\n if self.layer >= self.radius {\\n\",\n \"file_path\": \"src/spiral.rs\",\n \"rank\": 97,\n \"score\": 4.501289476440809\n },\n {\n \"content\": \" assert_eq!(ring[1], c - d - d - (d + RightBackward));\\n\\n assert_eq!(ring[7], c + d + d + (d + RightBackward));\\n\\n assert_eq!(ring[11], c - d - d - (d + LeftBackward));\\n\\n }\\n\\n }\\n\\n })\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn simple_spiral() {\\n\\n let spiral = Coordinate::from_axial(0, 0)\\n\\n .spiral_iter(2, Spin::CW(Direction::YZ))\\n\\n .collect::<Vec<_>>();\\n\\n assert_eq!(19, spiral.len());\\n\\n // Center\\n\\n assert_eq!(spiral[0], Coordinate::from_axial(0, 0));\\n\\n // Ring 1\\n\\n assert_eq!(spiral[1], Coordinate::from_axial(0, -1));\\n\\n assert_eq!(spiral[2], Coordinate::from_axial(1, -1));\\n\\n assert_eq!(spiral[3], Coordinate::from_axial(1, 0));\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 98,\n \"score\": 4.403232239864549\n },\n {\n \"content\": \" Direction::YX => PI * (4.5 / 3.0),\\n\\n Direction::YZ => PI * (5.5 / 3.0),\\n\\n })\\n\\n .unwrap()\\n\\n }\\n\\n\\n\\n /// Convert to angle for flat-topped map, in radians, grows clockwise, 0.0 points up\\n\\n pub fn to_radians_flat<T: Float>(&self) -> T {\\n\\n self.to_radians_pointy::<T>() + T::from(std::f64::consts::PI * (0.5 / 3.0)).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for Direction {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {\\n\\n write!(f, \\\"{:?}\\\", self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Into<Direction>> std::ops::Sub<T> for Direction {\\n\\n type Output = Angle;\\n\",\n \"file_path\": \"src/direction.rs\",\n \"rank\": 99,\n \"score\": 4.315130523951135\n }\n]","isConversational":false}}},{"rowIdx":3689,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"client/tests/tests/add_asset.rs"},"repo_name":{"kind":"string","value":"satu-n/iroha"},"commit":{"kind":"string","value":"97e63b3895fb1469d5420e16ec7a4563b61cdf76"},"file_code":{"kind":"string","value":"#![allow(clippy::restriction)]\n\nuse std::{convert::TryFrom, thread};\n\nuse eyre::Result;\nuse iroha_client::client;\nuse iroha_core::config::Configuration;\nuse iroha_data_model::{fixed::Fixed, prelude::*};\nuse test_network::{Peer as TestPeer, *};\n\n#[test]\nfn client_add_asset_quantity_to_existing_asset_should_increase_asset_amount() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n asset_definition_id.clone(),\n )));\n\n test_client.submit(create_asset)?;\n thread::sleep(pipeline_time * 2);\n\n \n let quantity: u32 = 200;\n let mint = MintBox::new(\n Value::U32(quantity),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n test_client.submit_till(mint, client::asset::by_account_id(account_id), |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id\n && asset.value == AssetValue::Quantity(quantity)\n })\n });\n Ok(())\n}\n\n#[test]\nfn client_add_big_asset_quantity_to_existing_asset_should_increase_asset_amount() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_big_quantity(\n asset_definition_id.clone(),\n )));\n\n test_client.submit(create_asset)?;\n thread::sleep(pipeline_time * 2);\n\n \n let quantity: u128 = 0x0001_0000_0000_0000_0000; \n let mint = MintBox::new(\n Value::U128(quantity),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n test_client.submit_till(mint, client::asset::by_account_id(account_id), |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id\n && asset.value == AssetValue::BigQuantity(quantity)\n })\n });\n Ok(())\n}\n\n#[test]\nfn client_add_asset_with_decimal_should_increase_asset_amount() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let identifiable_box =\n IdentifiableBox::from(AssetDefinition::with_precision(asset_definition_id.clone()));\n let create_asset = RegisterBox::new(identifiable_box);\n\n test_client.submit(create_asset)?;\n thread::sleep(pipeline_time * 2);\n\n \n let quantity: Fixed = Fixed::try_from(123.45_f64).unwrap();\n let mint = MintBox::new(\n Value::Fixed(quantity),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n test_client.submit_till(\n mint,\n client::asset::by_account_id(account_id.clone()),\n |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id\n && asset.value == AssetValue::Fixed(quantity)\n })\n },\n );\n\n \n let quantity2: Fixed = Fixed::try_from(0.55_f64).unwrap();\n let mint = MintBox::new(\n Value::Fixed(quantity2),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n \n let sum = Fixed::try_from(124.00_f64).unwrap();\n test_client.submit_till(mint, client::asset::by_account_id(account_id), |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id && asset.value == AssetValue::Fixed(sum)\n })\n });\n Ok(())\n}\n\n#[test]\nfn client_add_asset_with_name_length_more_than_limit_should_not_commit_transaction() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let normal_asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n normal_asset_definition_id.clone(),\n )));\n test_client.submit(create_asset)?;\n iroha_logger::info!(\"Creating asset\");\n\n let too_long_asset_name = \"0\".repeat(2_usize.pow(14));\n let incorrect_asset_definition_id = AssetDefinitionId::new(&too_long_asset_name, \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n incorrect_asset_definition_id.clone(),\n )));\n\n test_client.submit(create_asset)?;\n iroha_logger::info!(\"Creating another asset\");\n thread::sleep(pipeline_time * 4);\n\n let asset_definition_ids = test_client\n .request(client::asset::all_definitions())\n .expect(\"Failed to execute request.\")\n .into_iter()\n .map(|asset| asset.id)\n .collect::<Vec<_>>();\n dbg!(&asset_definition_ids);\n\n assert!(asset_definition_ids.contains(&normal_asset_definition_id));\n assert!(!asset_definition_ids.contains(&incorrect_asset_definition_id));\n\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"#![allow(clippy::restriction)]\n\nuse std::{convert::TryFrom, thread};\n\nuse eyre::Result;\nuse iroha_client::client;\nuse iroha_core::config::Configuration;\nuse iroha_data_model::{fixed::Fixed, prelude::*};\nuse test_network::{Peer as TestPeer, *};\n\n#[test]\nfn client_add_asset_quantity_to_existing_asset_should_increase_asset_amount() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n asset_definition_id.clone(),\n )));\n\n test_client.submit(create_asset)?;\n thread::sleep(pipeline_time * 2);\n\n \n let quantity: u32 = 200;\n let mint = MintBox::new(\n Value::U32(quantity),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n test_client.submit_till(mint, client::asset::by_account_id(account_id), |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id\n && asset.value == AssetValue::Quantity(quantity)\n })\n });\n Ok(())\n}\n\n#[test]\nfn client_add_big_asset_quantity_to_existing_asset_should_increase_asset_amount() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_big_quantity(\n asset_definition_id.clone(),\n )));\n\n test_client.submit(create_asset)?;\n thread::sleep(pipeline_time * 2);\n\n \n let quantity: u128 = 0x0001_0000_0000_0000_0000; \n let mint = MintBox::new(\n Value::U128(quantity),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n test_client.submit_till(mint, client::asset::by_account_id(account_id), |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id\n && asset.value == AssetValue::BigQuantity(quantity)\n })\n });\n Ok(())\n}\n\n#[test]\nfn client_add_asset_with_decimal_should_increase_asset_amount() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let ident"},"suffix":{"kind":"string","value":" = MintBox::new(\n Value::Fixed(quantity),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n test_client.submit_till(\n mint,\n client::asset::by_account_id(account_id.clone()),\n |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id\n && asset.value == AssetValue::Fixed(quantity)\n })\n },\n );\n\n \n let quantity2: Fixed = Fixed::try_from(0.55_f64).unwrap();\n let mint = MintBox::new(\n Value::Fixed(quantity2),\n IdBox::AssetId(AssetId::new(\n asset_definition_id.clone(),\n account_id.clone(),\n )),\n );\n \n let sum = Fixed::try_from(124.00_f64).unwrap();\n test_client.submit_till(mint, client::asset::by_account_id(account_id), |result| {\n result.iter().any(|asset| {\n asset.id.definition_id == asset_definition_id && asset.value == AssetValue::Fixed(sum)\n })\n });\n Ok(())\n}\n\n#[test]\nfn client_add_asset_with_name_length_more_than_limit_should_not_commit_transaction() -> Result<()> {\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n let pipeline_time = Configuration::pipeline_time();\n\n \n thread::sleep(pipeline_time);\n\n let normal_asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n normal_asset_definition_id.clone(),\n )));\n test_client.submit(create_asset)?;\n iroha_logger::info!(\"Creating asset\");\n\n let too_long_asset_name = \"0\".repeat(2_usize.pow(14));\n let incorrect_asset_definition_id = AssetDefinitionId::new(&too_long_asset_name, \"wonderland\");\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n incorrect_asset_definition_id.clone(),\n )));\n\n test_client.submit(create_asset)?;\n iroha_logger::info!(\"Creating another asset\");\n thread::sleep(pipeline_time * 4);\n\n let asset_definition_ids = test_client\n .request(client::asset::all_definitions())\n .expect(\"Failed to execute request.\")\n .into_iter()\n .map(|asset| asset.id)\n .collect::<Vec<_>>();\n dbg!(&asset_definition_ids);\n\n assert!(asset_definition_ids.contains(&normal_asset_definition_id));\n assert!(!asset_definition_ids.contains(&incorrect_asset_definition_id));\n\n Ok(())\n}\n"},"middle":{"kind":"string","value":"ifiable_box =\n IdentifiableBox::from(AssetDefinition::with_precision(asset_definition_id.clone()));\n let create_asset = RegisterBox::new(identifiable_box);\n\n test_client.submit(create_asset)?;\n thread::sleep(pipeline_time * 2);\n\n \n let quantity: Fixed = Fixed::try_from(123.45_f64).unwrap();\n let mint"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn mint_asset(quantity: u32, asset: &str, account: &str) -> Instruction {\n\n Instruction::Mint(MintBox::new(\n\n Value::U32(quantity),\n\n AssetId::from_names(asset, DOMAIN, account, DOMAIN),\n\n ))\n\n}\n\n#[tokio::test]\n\nasync fn find_asset() {\n\n AssertSet::new()\n\n .given(register_domain())\n\n .given(register_account(\"alice\"))\n\n .given(register_asset_definition(\"rose\"))\n\n .given(mint_asset(99, \"rose\", \"alice\"))\n\n .query(QueryBox::FindAssetById(FindAssetById::new(\n\n AssetId::from_names(\"rose\", DOMAIN, \"alice\", DOMAIN),\n\n )))\n\n .status(StatusCode::OK)\n\n .hint(\"Quantity\")\n\n .hint(\"99\")\n\n .assert()\n","file_path":"core/src/torii/tests.rs","rank":2,"score":217649.98316761883},{"content":"fn mint(\n\n asset_definition_id: &AssetDefinitionId,\n\n account_id: &AccountId,\n\n client: &mut client::Client,\n\n pipeline_time: std::time::Duration,\n\n quantity: u32,\n\n) -> Result<u32, color_eyre::Report> {\n\n let mint_asset = MintBox::new(\n\n Value::U32(quantity),\n\n IdBox::AssetId(AssetId::new(\n\n asset_definition_id.clone(),\n\n account_id.clone(),\n\n )),\n\n );\n\n client.submit(mint_asset)?;\n\n thread::sleep(pipeline_time * 5);\n\n iroha_logger::info!(\"Mint\");\n\n Ok(quantity)\n\n}\n\n\n","file_path":"client/tests/tests/unregister_peer.rs","rank":4,"score":209182.0183100117},{"content":"fn main() {}\n","file_path":"actor/tests/ok/simple_result.rs","rank":5,"score":205971.5059600347},{"content":"fn init() -> Result<(\n\n tokio::runtime::Runtime,\n\n test_network::Network,\n\n iroha_client::client::Client,\n\n std::time::Duration,\n\n AccountId,\n\n AssetDefinitionId,\n\n)> {\n\n let (rt, network, mut client) = <Network>::start_test_with_runtime(4, 1);\n\n let pipeline_time = Configuration::pipeline_time();\n\n thread::sleep(pipeline_time * 2);\n\n iroha_logger::info!(\"Started\");\n\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\"domain\").into()));\n\n let account_id = AccountId::new(\"account\", \"domain\");\n\n let create_account = RegisterBox::new(IdentifiableBox::NewAccount(\n\n NewAccount::with_signatory(account_id.clone(), KeyPair::generate()?.public_key).into(),\n\n ));\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"domain\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\n","file_path":"client/tests/tests/unregister_peer.rs","rank":6,"score":198384.21898542446},{"content":"#[test]\n\nfn transaction_event_should_be_sent_to_all_peers_from_all_peers() -> Result<()> {\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id).into(),\n\n ));\n\n test_with_instruction_and_status(create_asset, true)?;\n\n let fail = FailBox::new(\"Failing transaction to test Rejected event.\");\n\n test_with_instruction_and_status(fail, false)\n\n}\n\n\n","file_path":"client/tests/tests/events.rs","rank":7,"score":188310.22372946815},{"content":"#[test]\n\nfn restarted_peer_should_have_the_same_asset_amount() -> Result<()> {\n\n let temp_dir = TempDir::new()?;\n\n\n\n let mut configuration = Configuration::test();\n\n let mut peer = <TestPeer>::new()?;\n\n configuration.sumeragi.trusted_peers.peers = std::iter::once(peer.id.clone()).collect();\n\n\n\n let pipeline_time = Duration::from_millis(configuration.sumeragi.pipeline_time_ms());\n\n\n\n // Given\n\n let rt = Runtime::test();\n\n rt.block_on(peer.start_with_config_permissions_dir(configuration.clone(), AllowAll, &temp_dir));\n\n\n\n // Wait for genesis to be committed.\n\n thread::sleep(pipeline_time * 2);\n\n\n\n let account_id = AccountId::from_str(\"alice@wonderland\").unwrap();\n\n let asset_definition_id = AssetDefinitionId::from_str(\"xor#wonderland\").unwrap();\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\n","file_path":"client/tests/tests/restart_peer.rs","rank":8,"score":188310.22372946815},{"content":"#[test]\n\nfn client_add_asset_quantity_to_existing_asset_should_increase_asset_amount() {\n\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n let register = ('a'..'z')\n\n .map(|c| c.to_string())\n\n .map(|name| AssetDefinitionId::new(&name, \"wonderland\"))\n\n .map(AssetDefinition::new_quantity)\n\n .map(IdentifiableBox::from)\n\n .map(RegisterBox::new)\n\n .map(Instruction::Register)\n\n .collect();\n\n iroha_client\n\n .submit_all(register)\n\n .expect(\"Failed to prepare state.\");\n\n\n\n thread::sleep(pipeline_time);\n\n //When\n\n\n\n let vec = iroha_client\n","file_path":"client/tests/tests/pagination.rs","rank":9,"score":186665.1994636223},{"content":"#[test]\n\nfn network_stable_after_add_and_after_remove_peer() -> Result<()> {\n\n // Given a network\n\n let (rt, network, mut genesis_client, pipeline_time, account_id, asset_definition_id) = init()?;\n\n // When assets are minted\n\n mint(\n\n &asset_definition_id,\n\n &account_id,\n\n &mut genesis_client,\n\n pipeline_time,\n\n 100,\n\n )?;\n\n // and a new peer is registered\n\n let (peer, mut peer_client) = rt.block_on(network.add_peer());\n\n // Then the new peer should already have the mint result.\n\n check_assets(&mut peer_client, &account_id, &asset_definition_id, 100);\n\n // Also, when a peer is unregistered\n\n let remove_peer = UnregisterBox::new(IdBox::PeerId(peer.id.clone()));\n\n genesis_client.submit(remove_peer)?;\n\n thread::sleep(pipeline_time * 2);\n\n // We can mint without error.\n","file_path":"client/tests/tests/unregister_peer.rs","rank":10,"score":185279.96833714255},{"content":"// TODO: make it const generic type once it will be stabilized\n\nfn parse_const_ident(input: ParseStream, ident: &'static str) -> syn::Result<Ident> {\n\n let parse_ident: Ident = input.parse()?;\n\n if parse_ident == ident {\n\n Ok(parse_ident)\n\n } else {\n\n Err(syn::Error::new_spanned(parse_ident, \"Unknown ident\"))\n\n }\n\n}\n\n\n\nimpl Parse for Result {\n\n fn parse(input: ParseStream) -> syn::Result<Self> {\n\n Ok(Self {\n\n _ident: parse_const_ident(input, RESULT)?,\n\n _eq: input.parse()?,\n\n result: input.parse()?,\n\n })\n\n }\n\n}\n\n\n\n/// Derive for message. Check other doc in `iroha_actor` reexport\n","file_path":"actor/derive/src/lib.rs","rank":11,"score":184930.95983894507},{"content":"// TODO: make it const generic type once it will be stabilized\n\nfn parse_const_ident(input: ParseStream, ident: &'static str) -> syn::Result<Ident> {\n\n let parse_ident: Ident = input.parse()?;\n\n if parse_ident == ident {\n\n Ok(parse_ident)\n\n } else {\n\n Err(syn::Error::new_spanned(parse_ident, \"Unknown ident\"))\n\n }\n\n}\n\n\n\nimpl Parse for EnvPrefix {\n\n fn parse(input: ParseStream) -> syn::Result<Self> {\n\n Ok(Self {\n\n _ident: parse_const_ident(input, attrs::ENV_PREFIX)?,\n\n _eq: input.parse()?,\n\n prefix: input.parse()?,\n\n })\n\n }\n\n}\n\n\n","file_path":"config/derive/src/lib.rs","rank":12,"score":184930.95983894507},{"content":"#[test]\n\nfn transaction_signed_by_new_signatory_of_account_should_pass() -> Result<()> {\n\n let (_rt, peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\n\n let pipeline_time = Configuration::pipeline_time();\n\n thread::sleep(pipeline_time);\n\n\n\n // Given\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\n\n ));\n\n let key_pair = KeyPair::generate()?;\n\n let add_signatory = MintBox::new(\n\n key_pair.public_key.clone(),\n\n IdBox::AccountId(account_id.clone()),\n\n );\n\n\n\n iroha_client.submit_all(vec![create_asset.into(), add_signatory.into()])?;\n\n thread::sleep(pipeline_time * 2);\n\n //When\n","file_path":"client/tests/tests/multisignature_account.rs","rank":13,"score":182394.26675683528},{"content":"#[test]\n\nfn client_add_domain_with_name_length_more_than_limit_should_not_commit_transaction() -> Result<()>\n\n{\n\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time);\n\n\n\n let normal_domain_name = \"sora\";\n\n let create_domain = RegisterBox::new(IdentifiableBox::from(Domain::new(normal_domain_name)));\n\n test_client.submit(create_domain)?;\n\n\n\n let too_long_domain_name = &\"0\".repeat(2_usize.pow(14));\n\n let create_domain = RegisterBox::new(IdentifiableBox::from(Domain::new(too_long_domain_name)));\n\n test_client.submit(create_domain)?;\n\n\n\n thread::sleep(pipeline_time * 2);\n\n\n\n assert!(test_client\n\n .request(client::domain::by_name(normal_domain_name.to_string()))\n\n .is_ok());\n\n assert!(test_client\n\n .request(client::domain::by_name(too_long_domain_name.to_string()))\n\n .is_err());\n\n\n\n Ok(())\n\n}\n","file_path":"client/tests/tests/add_domain.rs","rank":15,"score":177016.03332801475},{"content":"#[test]\n\nfn client_add_account_with_name_length_more_than_limit_should_not_commit_transaction() -> Result<()>\n\n{\n\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\n\n\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n let normal_account_id = AccountId::new(\"bob\", \"wonderland\");\n\n let create_account = RegisterBox::new(IdentifiableBox::from(NewAccount::new(\n\n normal_account_id.clone(),\n\n )));\n\n test_client.submit(create_account)?;\n\n\n\n let too_long_account_name = \"0\".repeat(2_usize.pow(14));\n\n let incorrect_account_id = AccountId::new(&too_long_account_name, \"wonderland\");\n\n let create_account = RegisterBox::new(IdentifiableBox::from(NewAccount::new(\n\n incorrect_account_id.clone(),\n\n )));\n\n test_client.submit(create_account)?;\n\n\n\n thread::sleep(pipeline_time * 2);\n","file_path":"client/tests/tests/add_account.rs","rank":16,"score":177016.03332801475},{"content":"fn main() {}\n","file_path":"actor/tests/ok/generics.rs","rank":17,"score":166245.33633246948},{"content":"fn main() {}\n","file_path":"actor/tests/ok/simple.rs","rank":18,"score":166245.33633246948},{"content":"fn to_hex<S>(payload: &[u8], serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: serde::Serializer,\n\n{\n\n serializer.serialize_str(&hex::encode(payload))\n\n}\n\n\n\nimpl Debug for PrivateKey {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n f.debug_struct(\"PrivateKey\")\n\n .field(\"digest_function\", &self.digest_function)\n\n .field(\"payload\", &format!(\"{:X?}\", self.payload))\n\n .finish()\n\n }\n\n}\n\n\n\nimpl Display for PrivateKey {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n write!(f, \"{}\", hex::encode(&self.payload))\n\n }\n","file_path":"crypto/src/lib.rs","rank":19,"score":154499.11426347474},{"content":"fn main() -> Result<()> {\n\n let mut config = vergen::Config::default();\n\n *config.git_mut().sha_kind_mut() = ShaKind::Short;\n\n vergen::vergen(config)\n\n}\n","file_path":"telemetry/build.rs","rank":20,"score":153470.22363627132},{"content":"fn get_assets(iroha_client: &mut Client, id: &AccountId) -> Vec<Asset> {\n\n iroha_client\n\n .request(client::asset::by_account_id(id.clone()))\n\n .expect(\"Failed to execute request.\")\n\n}\n\n\n","file_path":"client/tests/tests/permissions.rs","rank":21,"score":152767.91245820295},{"content":"pub fn main() {\n\n let versioned_message: VersionedMessage = Message.into();\n\n match versioned_message {\n\n VersionedMessage::V1(message) => {\n\n let message: Message = message.into();\n\n message.handle();\n\n }\n\n VersionedMessage::V2(message) => {\n\n let message: Message2 = message.into();\n\n message.handle();\n\n }\n\n }\n\n}\n","file_path":"version/derive/tests/ui/ok_declare_versioned.rs","rank":22,"score":147722.01707832288},{"content":"fn main() -> Result<()> {\n\n color_eyre::install()?;\n\n let Args {\n\n config: Configuration(config),\n\n subcommand,\n\n } = Args::from_args();\n\n\n\n println!(\"Value for config: {:?}\", &config);\n\n subcommand\n\n .run(&config)\n\n .wrap_err(\"Failed to run subcommand\")?;\n\n Ok(())\n\n}\n\n\n","file_path":"client_cli/src/main.rs","rank":23,"score":147592.77090095432},{"content":"pub fn main() {\n\n let versioned_message: VersionedMessage = Message.into();\n\n match versioned_message {\n\n VersionedMessage::V1(message) => {\n\n let message: Message = message.into();\n\n message.handle();\n\n }\n\n VersionedMessage::V2(message) => {\n\n let message: Message2 = message.into();\n\n message.handle();\n\n }\n\n }\n\n}\n","file_path":"version/derive/tests/ui/ok_declare_versioned_scale.rs","rank":24,"score":144389.28659683038},{"content":"pub fn main() {\n\n let versioned_message: VersionedMessage = Message.into();\n\n match versioned_message {\n\n VersionedMessage::V1(message) => {\n\n let message: Message = message.into();\n\n message.handle();\n\n }\n\n VersionedMessage::V2(message) => {\n\n let message: Message2 = message.into();\n\n message.handle();\n\n }\n\n }\n\n}\n","file_path":"version/derive/tests/ui/ok_declare_versioned_json.rs","rank":25,"score":144389.28659683035},{"content":"pub fn main() {\n\n let versioned_message: VersionedMessage = Message.into();\n\n match versioned_message {\n\n VersionedMessage::V1(message) => {\n\n let message: Message = message.into();\n\n message.handle();\n\n }\n\n }\n\n let versioned_message: VersionedMessage2 = Message2.into();\n\n match versioned_message {\n\n VersionedMessage2::V1(message) => {\n\n let message: Message2 = message.into();\n\n message.handle();\n\n }\n\n }\n\n}\n","file_path":"version/derive/tests/ui/ok_declare_several_vesrioned.rs","rank":26,"score":144389.28659683035},{"content":"#[test]\n\nfn client_add_asset_quantity_to_existing_asset_should_increase_asset_amount_on_another_peer(\n\n) -> Result<()> {\n\n // Given\n\n let (_rt, network, mut iroha_client) = <Network>::start_test_with_runtime(4, 1);\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n thread::sleep(pipeline_time * 5);\n\n\n\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\"domain\").into()));\n\n let account_id = AccountId::new(\"account\", \"domain\");\n\n let create_account = RegisterBox::new(IdentifiableBox::NewAccount(\n\n NewAccount::with_signatory(account_id.clone(), KeyPair::generate()?.public_key).into(),\n\n ));\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"domain\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\n\n ));\n\n iroha_client.submit_all(vec![\n\n create_domain.into(),\n\n create_account.into(),\n","file_path":"client/tests/tests/asset_propagation.rs","rank":27,"score":143594.67921079788},{"content":"fn main() -> Result<(), Report> {\n\n color_eyre::install()?;\n\n let default_algorithm = Algorithm::default().to_string();\n\n let matches = App::new(\"iroha_crypto_cli\")\n\n .version(\"0.1\")\n\n .author(\"Soramitsu\")\n\n .about(\"iroha_crypto_cli is a command line tool used to generate keys for Iroha peers and clients.\")\n\n .arg(\n\n Arg::with_name(\"seed\")\n\n .long(\"seed\")\n\n .value_name(\"seed\")\n\n .help(\"Sets a seed for random number generator. Should be used separately from `private_key`.\")\n\n .required(false)\n\n .takes_value(true)\n\n )\n\n .arg(\n\n Arg::with_name(\"private_key\")\n\n .long(\"private_key\")\n\n .value_name(\"private_key\")\n\n .help(\"Sets a private key. Should be used separately from `seed`.\")\n","file_path":"crypto_cli/src/main.rs","rank":28,"score":139653.91929149552},{"content":"fn main() -> color_eyre::Result<()> {\n\n color_eyre::install().unwrap();\n\n Configuration::get_markdown(&mut BufWriter::new(stdout()))\n\n .wrap_err(\"Failed to generate documentation\")\n\n}\n\n\n\nimpl<E: Debug, C: Configurable<Error = E> + Send + Sync + Default> PrintDocs for C {}\n\n\n","file_path":"core/docs/src/main.rs","rank":29,"score":137142.11426594856},{"content":"#[derive(iroha_actor::Message)]\n\n#[message(result = \"i32\")]\n","file_path":"actor/tests/ok/simple_result.rs","rank":30,"score":135178.2939852847},{"content":"#[test]\n\nfn test_status() {\n\n const N_PEERS: u64 = 4;\n\n let mut status;\n\n\n\n let (rt, network, mut client) = <TestNetwork>::start_test_with_runtime(N_PEERS as u32, 1);\n\n let pipeline_time = Configuration::pipeline_time();\n\n thread::sleep(pipeline_time * 2);\n\n\n\n // Confirm all peers connected\n\n status = client.get_status().unwrap();\n\n assert_eq!(status.peers, N_PEERS - 1);\n\n assert_eq!(status.blocks, 1);\n\n\n\n // Add a peer then #peers should be incremented\n\n let (peer, _) = rt.block_on(network.add_peer());\n\n thread::sleep(pipeline_time * 2);\n\n status = client.get_status().unwrap();\n\n assert_eq!(status.peers, N_PEERS);\n\n assert_eq!(status.blocks, 2);\n\n\n\n // Remove the peer then #peers should be decremented\n\n let remove_peer = UnregisterBox::new(IdBox::PeerId(peer.id.clone()));\n\n client.submit(remove_peer).expect(\"Failed to remove peer\");\n\n thread::sleep(pipeline_time * 2);\n\n status = client.get_status().unwrap();\n\n assert_eq!(status.peers, N_PEERS - 1);\n\n assert_eq!(status.blocks, 3);\n\n}\n","file_path":"client/tests/tests/status.rs","rank":31,"score":134963.25885890194},{"content":"fn validate_blocks(criterion: &mut Criterion) {\n\n // Prepare WSV\n\n let key_pair = KeyPair::generate().expect(\"Failed to generate KeyPair.\");\n\n let domain_name = \"global\".to_string();\n\n let asset_definitions = BTreeMap::new();\n\n let account_id = AccountId::new(\"root\", &domain_name);\n\n let account = Account::with_signatory(account_id.clone(), key_pair.public_key);\n\n let mut accounts = BTreeMap::new();\n\n accounts.insert(account_id, account);\n\n let domain = Domain {\n\n name: domain_name.clone(),\n\n accounts,\n\n asset_definitions,\n\n metadata: Metadata::new(),\n\n };\n\n let mut domains = BTreeMap::new();\n\n domains.insert(domain_name, domain);\n\n let wsv = WorldStateView::new(World::with(domains, BTreeSet::new()));\n\n // Pepare test transaction\n\n let keys = KeyPair::generate().expect(\"Failed to generate keys\");\n","file_path":"core/benches/validation.rs","rank":32,"score":133038.49097423392},{"content":"fn accept_transaction(criterion: &mut Criterion) {\n\n let keys = KeyPair::generate().expect(\"Failed to generate keys\");\n\n let transaction = build_test_transaction(&keys);\n\n let mut success_count = 0;\n\n let mut failures_count = 0;\n\n let _ = criterion.bench_function(\"accept\", |b| {\n\n b.iter(\n\n || match AcceptedTransaction::from_transaction(transaction.clone(), 4096) {\n\n Ok(_) => success_count += 1,\n\n Err(_) => failures_count += 1,\n\n },\n\n );\n\n });\n\n println!(\n\n \"Success count: {}, Failures count: {}\",\n\n success_count, failures_count\n\n );\n\n}\n\n\n","file_path":"core/benches/validation.rs","rank":33,"score":133038.49097423392},{"content":"fn chain_blocks(criterion: &mut Criterion) {\n\n let keys = KeyPair::generate().expect(\"Failed to generate keys\");\n\n let transaction = AcceptedTransaction::from_transaction(build_test_transaction(&keys), 4096)\n\n .expect(\"Failed to accept transaction.\");\n\n let block = PendingBlock::new(vec![transaction.into()]);\n\n let mut previous_block_hash = block.clone().chain_first().hash();\n\n let mut success_count = 0;\n\n let _ = criterion.bench_function(\"chain_block\", |b| {\n\n b.iter(|| {\n\n success_count += 1;\n\n let new_block = block.clone().chain(\n\n success_count,\n\n previous_block_hash.transmute(),\n\n view_change::ProofChain::empty(),\n\n Vec::new(),\n\n );\n\n previous_block_hash = new_block.hash();\n\n });\n\n });\n\n println!(\"Total count: {}\", success_count);\n\n}\n\n\n","file_path":"core/benches/validation.rs","rank":34,"score":133038.49097423392},{"content":"fn query_requests(criterion: &mut Criterion) {\n\n let mut peer = <TestPeer>::new().expect(\"Failed to create peer\");\n\n let configuration = get_config(\n\n std::iter::once(peer.id.clone()).collect(),\n\n Some(get_key_pair()),\n\n );\n\n let rt = Runtime::test();\n\n let genesis = GenesisNetwork::from_configuration(\n\n true,\n\n RawGenesisBlock::new(\"alice\", \"wonderland\", &get_key_pair().public_key),\n\n &configuration.genesis,\n\n configuration.sumeragi.max_instruction_number,\n\n )\n\n .unwrap();\n\n\n\n rt.block_on(peer.start_with_config(genesis, configuration));\n\n thread::sleep(std::time::Duration::from_millis(50));\n\n\n\n let mut group = criterion.benchmark_group(\"query-reqeuests\");\n\n let domain_name = \"domain\";\n","file_path":"client/benches/torii.rs","rank":35,"score":133038.49097423392},{"content":"fn instruction_submits(criterion: &mut Criterion) {\n\n let rt = Runtime::test();\n\n let mut peer = <TestPeer>::new().expect(\"Failed to create peer\");\n\n let configuration = get_config(\n\n std::iter::once(peer.id.clone()).collect(),\n\n Some(get_key_pair()),\n\n );\n\n let genesis = GenesisNetwork::from_configuration(\n\n true,\n\n RawGenesisBlock::new(\"alice\", \"wonderland\", &configuration.public_key),\n\n &configuration.genesis,\n\n configuration.sumeragi.max_instruction_number,\n\n )\n\n .unwrap();\n\n rt.block_on(peer.start_with_config(genesis, configuration));\n\n thread::sleep(std::time::Duration::from_millis(50));\n\n\n\n let mut group = criterion.benchmark_group(\"instruction-requests\");\n\n let domain_name = \"domain\";\n\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(domain_name).into()));\n","file_path":"client/benches/torii.rs","rank":36,"score":133038.49097423392},{"content":"fn validate_transaction(criterion: &mut Criterion) {\n\n let keys = KeyPair::generate().expect(\"Failed to generate keys\");\n\n let transaction = AcceptedTransaction::from_transaction(build_test_transaction(&keys), 4096)\n\n .expect(\"Failed to accept transaction.\");\n\n let mut success_count = 0;\n\n let mut failures_count = 0;\n\n let wsv = build_test_wsv(&keys);\n\n let _ = criterion.bench_function(\"validate\", |b| {\n\n b.iter(|| {\n\n match transaction\n\n .clone()\n\n .validate(&wsv, &AllowAll.into(), &AllowAll.into(), false)\n\n {\n\n Ok(_) => success_count += 1,\n\n Err(_) => failures_count += 1,\n\n }\n\n });\n\n });\n\n println!(\n\n \"Success count: {}, Failures count: {}\",\n\n success_count, failures_count\n\n );\n\n}\n\n\n","file_path":"core/benches/validation.rs","rank":37,"score":133038.49097423392},{"content":"fn sort_peers(criterion: &mut Criterion) {\n\n let peers = get_n_peers(N_PEERS);\n\n let _ = criterion.bench_function(\"sort_peers\", |b| {\n\n let hash = HashOf::from_hash(Hash([0_u8; 32]));\n\n b.iter(|| network_topology::sort_peers_by_hash(peers.clone(), &hash));\n\n });\n\n}\n\n\n\ncriterion_group!(benches, sort_peers);\n\ncriterion_main!(benches);\n","file_path":"core/benches/sumeragi.rs","rank":38,"score":133038.49097423392},{"content":"fn sign_blocks(criterion: &mut Criterion) {\n\n let keys = KeyPair::generate().expect(\"Failed to generate keys\");\n\n let transaction = AcceptedTransaction::from_transaction(build_test_transaction(&keys), 4096)\n\n .expect(\"Failed to accept transaction.\");\n\n let wsv = build_test_wsv(&keys);\n\n let block = PendingBlock::new(vec![transaction.into()])\n\n .chain_first()\n\n .validate(&wsv, &AllowAll.into(), &AllowAll.into());\n\n let key_pair = KeyPair::generate().expect(\"Failed to generate KeyPair.\");\n\n let mut success_count = 0;\n\n let mut failures_count = 0;\n\n let _ = criterion.bench_function(\"sign_block\", |b| {\n\n b.iter(|| match block.clone().sign(key_pair.clone()) {\n\n Ok(_) => success_count += 1,\n\n Err(_) => failures_count += 1,\n\n });\n\n });\n\n println!(\n\n \"Success count: {}, Failures count: {}\",\n\n success_count, failures_count\n\n );\n\n}\n\n\n","file_path":"core/benches/validation.rs","rank":39,"score":133038.49097423392},{"content":"fn sign_transaction(criterion: &mut Criterion) {\n\n let keys = KeyPair::generate().expect(\"Failed to generate keys\");\n\n let transaction = build_test_transaction(&keys);\n\n let key_pair = KeyPair::generate().expect(\"Failed to generate KeyPair.\");\n\n let mut success_count = 0;\n\n let mut failures_count = 0;\n\n let _ = criterion.bench_function(\"sign\", |b| {\n\n b.iter(|| match transaction.clone().sign(&key_pair) {\n\n Ok(_) => success_count += 1,\n\n Err(_) => failures_count += 1,\n\n });\n\n });\n\n println!(\n\n \"Success count: {}, Failures count: {}\",\n\n success_count, failures_count\n\n );\n\n}\n\n\n","file_path":"core/benches/validation.rs","rank":40,"score":133038.49097423392},{"content":"#[allow(clippy::needless_range_loop)]\n\nfn test_with_instruction_and_status(\n\n instruction: impl Into<Instruction>,\n\n should_be_committed: bool,\n\n) -> Result<()> {\n\n let instruction: Instruction = instruction.into();\n\n for submitting_peer in 0..PEER_COUNT {\n\n let (_rt, network, _) =\n\n <Network>::start_test_with_runtime(PEER_COUNT.try_into().unwrap(), 1);\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time * 4);\n\n\n\n let committed_event_received = Arc::new(RwLock::new([false; PEER_COUNT]));\n\n let validating_event_received = Arc::new(RwLock::new([false; PEER_COUNT]));\n\n let rejected_event_received = Arc::new(RwLock::new([false; PEER_COUNT]));\n\n let peers: Vec<_> = network.peers().collect();\n\n let mut submitter_client = Client::test(\n\n &peers[submitting_peer].api_address,\n\n &peers[submitting_peer].status_address,\n","file_path":"client/tests/tests/events.rs","rank":41,"score":132765.28735931643},{"content":"#[test]\n\nfn test_encryption() {\n\n use iroha_crypto::ursa::encryption::symm::prelude::*;\n\n\n\n const TEST_KEY: [u8; 32] = [\n\n 5, 87, 82, 183, 220, 57, 107, 49, 227, 4, 96, 231, 198, 88, 153, 11, 22, 65, 56, 45, 237,\n\n 35, 231, 165, 122, 153, 14, 68, 13, 84, 5, 24,\n\n ];\n\n\n\n let encryptor = SymmetricEncryptor::<ChaCha20Poly1305>::new_with_key(&TEST_KEY).unwrap();\n\n let message = b\"Some ciphertext\";\n\n let aad = b\"Iroha2 AAD\";\n\n let res = encryptor.encrypt_easy(aad.as_ref(), message.as_ref());\n\n assert!(res.is_ok());\n\n\n\n let ciphertext = res.unwrap();\n\n let res = encryptor.decrypt_easy(aad.as_ref(), ciphertext.as_slice());\n\n assert!(res.is_ok());\n\n assert_eq!(res.unwrap().as_slice(), message);\n\n}\n","file_path":"p2p/tests/p2p.rs","rank":42,"score":132111.2344604144},{"content":"#[test]\n\nfn test_docs() {\n\n assert_eq!(\n\n Configuration::get_doc_recursive([\"inner\", \"b\"]).unwrap(),\n\n Some(\" Docs from b\\n\\nHas type `i32`. Can be configured via environment variable `CONF_INNER_B`\")\n\n );\n\n assert_eq!(\n\n Configuration::get_doc_recursive([\"inner\", \"a\"]).unwrap(),\n\n Some(\"Has type `String`. Can be configured via environment variable `CONF_INNER_A`\")\n\n );\n\n assert_eq!(\n\n Configuration::get_doc_recursive([\"inner\"]).unwrap(),\n\n Some(\" Inner structure\\n\\nHas type `InnerConfiguration`. Can be configured via environment variable `CONF_INNER`\")\n\n );\n\n}\n","file_path":"config/tests/simple.rs","rank":43,"score":132111.2344604144},{"content":"#[derive(iroha_actor::Message)]\n\n#[message(result = \"i32\")]\n\nstruct M;\n","file_path":"actor/tests/ok/simple_result.rs","rank":44,"score":130925.9411868666},{"content":"fn measure_block_size(_criterion: &mut Criterion) {\n\n Runtime::new().unwrap().block_on(measure_block_size_async());\n\n}\n\n\n\ncriterion_group!(kura, measure_block_size);\n\ncriterion_main!(kura);\n","file_path":"core/benches/kura.rs","rank":45,"score":130669.59861983167},{"content":"/// Installs the panic hook with [`color_eyre::install`] if it isn't installed yet\n\n///\n\n/// # Errors\n\n/// Fails if [`color_eyre::install`] fails\n\npub fn install_panic_hook() -> Result<(), Report> {\n\n static INSTALLED: AtomicBool = AtomicBool::new(false);\n\n if INSTALLED\n\n .compare_exchange(false, true, Ordering::SeqCst, Ordering::SeqCst)\n\n .is_ok()\n\n {\n\n color_eyre::install()\n\n } else {\n\n Ok(())\n\n }\n\n}\n","file_path":"logger/src/lib.rs","rank":46,"score":130355.70508962426},{"content":"#[test]\n\nfn get_config() {\n\n // The underscored variables must not be dropped until end of closure.\n\n let (_dont_drop, _dont_drop_either, cl) = <TestPeer>::start_test_with_runtime();\n\n\n\n let field = cl.get_config_docs(&[\"torii\"]).unwrap().unwrap();\n\n assert!(field.contains(\"IROHA_TORII\"));\n\n\n\n let cfg: Configuration = serde_json::from_value(cl.get_config_value().unwrap()).unwrap();\n\n let test = Configuration::test();\n\n assert_eq!(cfg.block_sync, test.block_sync);\n\n assert_eq!(cfg.network, test.network);\n\n assert_eq!(cfg.telemetry, test.telemetry);\n\n}\n","file_path":"client/tests/tests/config.rs","rank":47,"score":129585.10592466705},{"content":"fn attrs_have_ident(attrs: &[syn::Attribute], ident: &str) -> bool {\n\n attrs.iter().any(|attr| attr.path.is_ident(ident))\n\n}\n\n\n","file_path":"macro/derive/src/lib.rs","rank":48,"score":127433.03561809428},{"content":"fn check_assets(\n\n iroha_client: &mut client::Client,\n\n account_id: &AccountId,\n\n asset_definition_id: &AssetDefinitionId,\n\n quantity: u32,\n\n) {\n\n iroha_client.poll_request_with_period(\n\n client::asset::by_account_id(account_id.clone()),\n\n Configuration::block_sync_gossip_time(),\n\n 15,\n\n |result| {\n\n result.iter().any(|asset| {\n\n asset.id.definition_id == *asset_definition_id\n\n && asset.value == AssetValue::Quantity(quantity)\n\n })\n\n },\n\n );\n\n}\n\n\n","file_path":"client/tests/tests/unregister_peer.rs","rank":49,"score":127183.15171232654},{"content":"fn unstable_network(\n\n n_peers: u32,\n\n n_offline_peers: u32,\n\n n_transactions: usize,\n\n polling_max_attempts: u32,\n\n polling_period: Duration,\n\n) {\n\n drop(iroha_logger::install_panic_hook());\n\n let rt = Runtime::test();\n\n // Given\n\n let (_network, mut iroha_client) =\n\n rt.block_on(<Network>::start_test_with_offline_and_set_n_shifts(\n\n n_peers,\n\n MAXIMUM_TRANSACTIONS_IN_BLOCK,\n\n n_offline_peers,\n\n u64::from(n_peers),\n\n ));\n\n\n\n let pipeline_time = Configuration::pipeline_time();\n\n thread::sleep(pipeline_time * n_peers);\n","file_path":"client/tests/tests/unstable_network.rs","rank":50,"score":127183.15171232654},{"content":"fn setup_logger(configuration: &Configuration) -> Result<Telemetries> {\n\n if configuration.compact_mode {\n\n let layer = tracing_subscriber::fmt::layer()\n\n .with_test_writer()\n\n .compact();\n\n Ok(add_bunyan(configuration, layer)?)\n\n } else {\n\n let layer = tracing_subscriber::fmt::layer().with_test_writer();\n\n Ok(add_bunyan(configuration, layer)?)\n\n }\n\n}\n\n\n","file_path":"logger/src/lib.rs","rank":51,"score":126596.36209252235},{"content":"#[test]\n\nfn account_can_query_only_its_own_domain() {\n\n let rt = Runtime::test();\n\n let (_not_drop, mut iroha_client) = rt.block_on(<TestPeer>::start_test_with_permissions(\n\n AllowAll.into(),\n\n private_blockchain::query::OnlyAccountsDomain.into(),\n\n ));\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time * 2);\n\n\n\n let domain_name = \"wonderland\";\n\n let new_domain_name = \"wonderland2\";\n\n let register_domain = RegisterBox::new(IdentifiableBox::from(Domain::new(new_domain_name)));\n\n\n\n iroha_client\n\n .submit(register_domain)\n\n .expect(\"Failed to prepare state.\");\n\n\n\n thread::sleep(pipeline_time * 2);\n","file_path":"client/tests/tests/permissions.rs","rank":52,"score":124912.13351590207},{"content":"#[test]\n\nfn permissions_disallow_asset_burn() {\n\n let rt = Runtime::test();\n\n let (_not_drop, mut iroha_client) = rt.block_on(<TestPeer>::start_test_with_permissions(\n\n public_blockchain::default_permissions(),\n\n AllowAll.into(),\n\n ));\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time * 5);\n\n\n\n let domain_name = \"wonderland\";\n\n let alice_id = AccountId::new(\"alice\", domain_name);\n\n let bob_id = AccountId::new(\"bob\", domain_name);\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", domain_name);\n\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n\n asset_definition_id.clone(),\n\n )));\n\n let register_bob = RegisterBox::new(IdentifiableBox::from(NewAccount::new(bob_id.clone())));\n\n\n","file_path":"client/tests/tests/permissions.rs","rank":53,"score":124912.13351590207},{"content":"#[test]\n\nfn permissions_disallow_asset_transfer() {\n\n let rt = Runtime::test();\n\n let (_peer, mut iroha_client) = rt.block_on(<TestPeer>::start_test_with_permissions(\n\n public_blockchain::default_permissions(),\n\n AllowAll.into(),\n\n ));\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n let alice_id = AccountId::new(\"alice\", \"wonderland\");\n\n let bob_id = AccountId::new(\"bob\", \"wonderland\");\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n\n asset_definition_id.clone(),\n\n )));\n\n let register_bob = RegisterBox::new(IdentifiableBox::from(NewAccount::new(bob_id.clone())));\n\n\n\n let alice_start_assets = get_assets(&mut iroha_client, &alice_id);\n\n iroha_client\n\n .submit_all(vec![create_asset.into(), register_bob.into()])\n","file_path":"client/tests/tests/permissions.rs","rank":54,"score":124912.13351590207},{"content":"#[test]\n\nfn trybuild() {\n\n let test_cases = TestCases::new();\n\n test_cases.pass(\"tests/ok/*.rs\");\n\n test_cases.compile_fail(\"tests/fail/*.rs\");\n\n}\n","file_path":"actor/tests/trybuild.rs","rank":55,"score":123825.04070018294},{"content":"#[test]\n\n#[ignore = \"This test fails after reducing the amount of gossipping\"]\n\nfn unstable_network_7_peers_1_fault() {\n\n let n_peers = 7;\n\n let n_transactions = 20;\n\n let polling_max_attempts = n_peers * n_transactions;\n\n unstable_network(\n\n n_peers,\n\n 1,\n\n n_transactions as usize,\n\n polling_max_attempts,\n\n Configuration::pipeline_time(),\n\n );\n\n}\n\n\n","file_path":"client/tests/tests/unstable_network.rs","rank":56,"score":122746.59506685931},{"content":"#[test]\n\n#[ignore = \"This test does not guarantee to have positive outcome given a fixed time.\"]\n\nfn unstable_network_7_peers_2_faults() {\n\n unstable_network(7, 2, 5, 100, Configuration::pipeline_time());\n\n}\n\n\n","file_path":"client/tests/tests/unstable_network.rs","rank":57,"score":122746.53563082984},{"content":"#[test]\n\nfn unstable_network_4_peers_1_fault() {\n\n let n_peers = 4;\n\n let n_transactions = 20;\n\n // Given that the topology will resolve view changes by shift for `n_peers` consequent times\n\n // and having only 1 faulty peer guarantees us that at maximum in `n_peers` tries the block will be committed.\n\n // So for the worst case scenario for `n_transactions` given 1 transaction per block\n\n // the network will commit all of them in `n_peers * n_transactions` tries.\n\n let polling_max_attempts = n_peers * n_transactions;\n\n unstable_network(\n\n n_peers,\n\n 1,\n\n n_transactions as usize,\n\n polling_max_attempts,\n\n Configuration::pipeline_time(),\n\n );\n\n}\n\n\n","file_path":"client/tests/tests/unstable_network.rs","rank":58,"score":122746.01992200753},{"content":"#[allow(clippy::too_many_lines)]\n\n#[test]\n\nfn multisignature_transactions_should_wait_for_all_signatures() {\n\n let (_rt, network, _) = <Network>::start_test_with_runtime(4, 1);\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n thread::sleep(pipeline_time * 3);\n\n\n\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\"domain\").into()));\n\n let account_id = AccountId::new(\"account\", \"domain\");\n\n let key_pair_1 = KeyPair::generate().expect(\"Failed to generate KeyPair.\");\n\n let key_pair_2 = KeyPair::generate().expect(\"Failed to generate KeyPair.\");\n\n let create_account = RegisterBox::new(IdentifiableBox::from(NewAccount::with_signatory(\n\n account_id.clone(),\n\n key_pair_1.public_key.clone(),\n\n )));\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"domain\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\n\n asset_definition_id.clone(),\n\n )));\n\n let set_signature_condition = MintBox::new(\n\n SignatureCheckCondition(\n","file_path":"client/tests/tests/multisignature_transaction.rs","rank":59,"score":122745.82891951363},{"content":"#[test]\n\nfn trybuild() {\n\n TestCases::new().compile_fail(\"tests/fail_to_compile/*.rs\");\n\n}\n","file_path":"data_model/tests/trybuild.rs","rank":60,"score":120825.7666127264},{"content":"fn setup_logger() {\n\n INIT.call_once(|| {\n\n let log_config = Configuration {\n\n max_log_level: Level::TRACE.into(),\n\n compact_mode: false,\n\n ..Configuration::default()\n\n };\n\n iroha_logger::init(&log_config).expect(\"Failed to start logger\");\n\n })\n\n}\n\n\n\n/// This test creates a network and one peer.\n\n/// This peer connects back to our network, emulating some distant peer.\n\n/// There is no need to create separate networks to check that messages\n\n/// are properly sent and received using encryption and serialization/deserialization.\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 4)]\n\nasync fn network_create() {\n\n let delay = Duration::from_millis(200);\n\n setup_logger();\n\n info!(\"Starting network tests...\");\n","file_path":"p2p/tests/p2p.rs","rank":61,"score":120820.12274758013},{"content":"#[test]\n\nfn genesis_block_is_commited_with_some_offline_peers() {\n\n // Given\n\n let rt = Runtime::test();\n\n let (_network, mut iroha_client) = rt.block_on(<Network>::start_test_with_offline(4, 1, 1));\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n thread::sleep(pipeline_time * 8);\n\n\n\n //When\n\n let alice_id = AccountId::new(\"alice\", \"wonderland\");\n\n let alice_has_roses = 13;\n\n\n\n //Then\n\n let assets = iroha_client\n\n .request(client::asset::by_account_id(alice_id))\n\n .expect(\"Failed to execute request.\");\n\n let asset = assets\n\n .iter()\n\n .find(|asset| asset.id.definition_id == AssetDefinitionId::new(\"rose\", \"wonderland\"))\n\n .unwrap();\n\n assert_eq!(AssetValue::Quantity(alice_has_roses), asset.value);\n\n}\n","file_path":"client/tests/tests/offline_peers.rs","rank":62,"score":120682.2844801351},{"content":"#[ignore = \"Takes a lot of time.\"]\n\n#[test]\n\nfn long_multiple_blocks_created() {\n\n // Given\n\n let (_rt, network, mut iroha_client) = <Network>::start_test_with_runtime(4, 1);\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n thread::sleep(pipeline_time * 2);\n\n\n\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\"domain\").into()));\n\n let account_id = AccountId::new(\"account\", \"domain\");\n\n let create_account = RegisterBox::new(IdentifiableBox::NewAccount(\n\n NewAccount::with_signatory(\n\n account_id.clone(),\n\n KeyPair::generate()\n\n .expect(\"Failed to generate KeyPair.\")\n\n .public_key,\n\n )\n\n .into(),\n\n ));\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"domain\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n","file_path":"client/tests/tests/multiple_blocks_created.rs","rank":63,"score":120682.0934776412},{"content":"#[test]\n\nfn client_can_transfer_asset_to_another_account() {\n\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time);\n\n\n\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\"domain\").into()));\n\n let account1_id = AccountId::new(\"account1\", \"domain\");\n\n let account2_id = AccountId::new(\"account2\", \"domain\");\n\n let create_account1 = RegisterBox::new(IdentifiableBox::NewAccount(\n\n NewAccount::with_signatory(\n\n account1_id.clone(),\n\n KeyPair::generate()\n\n .expect(\"Failed to generate KeyPair.\")\n\n .public_key,\n\n )\n\n .into(),\n\n ));\n\n let create_account2 = RegisterBox::new(IdentifiableBox::NewAccount(\n","file_path":"client/tests/tests/transfer_asset.rs","rank":64,"score":118713.56777760673},{"content":"/// Initializes `Logger` with given [`LoggerConfiguration`](`config::LoggerConfiguration`).\n\n/// After the initialization `log` macros will print with the use of this `Logger`.\n\n/// Returns the receiving side of telemetry channels (regular telemetry, future telemetry)\n\n///\n\n/// # Errors\n\n/// If the logger is already set, raises a generic error.\n\npub fn init(configuration: &Configuration) -> Result<Option<Telemetries>> {\n\n if LOGGER_SET\n\n .compare_exchange(false, true, Ordering::AcqRel, Ordering::Relaxed)\n\n .is_err()\n\n {\n\n return Ok(None);\n\n }\n\n Ok(Some(setup_logger(configuration)?))\n\n}\n\n\n","file_path":"logger/src/lib.rs","rank":65,"score":118311.89979278552},{"content":"#[test]\n\nfn discriminant() {\n\n use std::collections::BTreeMap;\n\n\n\n let expected_meta = vec![(\n\n \"enum_with_various_discriminants::Foo\".to_owned(),\n\n Metadata::Enum(EnumMeta {\n\n variants: vec![\n\n EnumVariant {\n\n name: \"A\".to_owned(),\n\n discriminant: 1,\n\n ty: None,\n\n },\n\n EnumVariant {\n\n name: \"B\".to_owned(),\n\n discriminant: 77,\n\n ty: None,\n\n },\n\n EnumVariant {\n\n name: \"C\".to_owned(),\n\n discriminant: 2,\n","file_path":"schema/tests/enum_with_various_discriminants.rs","rank":66,"score":118015.19832864866},{"content":"#[test]\n\nfn reload_log_level() {\n\n let (_dont_drop, _dont_drop_either, cl) = <TestPeer>::start_test_with_runtime();\n\n\n\n let verify = |level| {\n\n let field: bool = cl\n\n .set_config(iroha_core::torii::PostConfiguration::LogLevel(level))\n\n .unwrap();\n\n assert!(field);\n\n };\n\n verify(ERROR);\n\n verify(TRACE);\n\n verify(WARN);\n\n verify(DEBUG);\n\n}\n","file_path":"client/tests/reload.rs","rank":67,"score":118015.19832864866},{"content":"#[test]\n\nfn compact() {\n\n use std::collections::BTreeMap;\n\n\n\n use IntMode::*;\n\n use Metadata::*;\n\n\n\n let expected = vec![\n\n (\n\n \"iroha_schema::Compact<u128>\".to_owned(),\n\n Int(IntMode::Compact),\n\n ),\n\n (\n\n \"iroha_schema::Compact<u16>\".to_owned(),\n\n Int(IntMode::Compact),\n\n ),\n\n (\n\n \"iroha_schema::Compact<u32>\".to_owned(),\n\n Int(IntMode::Compact),\n\n ),\n\n (\n","file_path":"schema/tests/numbers_compact_and_fixed.rs","rank":68,"score":118015.19832864866},{"content":"#[test]\n\nfn unnamed() {\n\n use Metadata::*;\n\n\n\n let expected = vec![\n\n (\"String\".to_owned(), String),\n\n (\"Vec<String>\".to_owned(), Vec(\"String\".to_owned())),\n\n (\n\n \"struct_with_unnamed_fields::Command\".to_owned(),\n\n TupleStruct(UnnamedFieldsMeta {\n\n types: vec![\"String\".to_owned(), \"Vec<String>\".to_owned()],\n\n }),\n\n ),\n\n ]\n\n .into_iter()\n\n .collect::<BTreeMap<_, _>>();\n\n assert_eq!(Command::get_schema(), expected);\n\n}\n","file_path":"schema/tests/struct_with_unnamed_fields.rs","rank":69,"score":118015.19832864866},{"content":"fn main() {}\n","file_path":"macro/derive/tests/from_variant/05-struct.rs","rank":70,"score":118009.5544635024},{"content":"fn main() {\n\n\tFixed::from(-1_f64);\n\n}\n","file_path":"data_model/tests/fail/no_conversion.rs","rank":71,"score":118009.5544635024},{"content":"fn impl_decode_versioned(enum_name: &Ident) -> proc_macro2::TokenStream {\n\n quote! (\n\n impl iroha_version::scale::DecodeVersioned for #enum_name {\n\n fn decode_versioned(input: &[u8]) -> iroha_version::error::Result<Self> {\n\n use iroha_version::{error::Error, Version, UnsupportedVersion, RawVersioned};\n\n use parity_scale_codec::Decode;\n\n\n\n if let Some(version) = input.first() {\n\n if Self::supported_versions().contains(version) {\n\n let mut input = input.clone();\n\n Ok(Self::decode(&mut input)?)\n\n } else {\n\n Err(Error::UnsupportedVersion(UnsupportedVersion::new(*version, RawVersioned::ScaleBytes(input.to_vec()))))\n\n }\n\n } else {\n\n Err(Error::NotVersioned)\n\n }\n\n }\n\n }\n\n\n","file_path":"version/derive/src/lib.rs","rank":72,"score":116951.05888247376},{"content":"#[test]\n\nfn client_sends_transaction_with_invalid_instruction_should_not_see_any_changes() {\n\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time);\n\n\n\n //When\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n\n let wrong_asset_definition_id = AssetDefinitionId::new(\"ksor\", \"wonderland\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id).into(),\n\n ));\n\n let quantity: u32 = 200;\n\n let mint_asset = MintBox::new(\n\n Value::U32(quantity),\n\n IdBox::AssetId(AssetId::new(\n\n wrong_asset_definition_id.clone(),\n\n account_id.clone(),\n","file_path":"client/tests/tests/tx_rollback.rs","rank":73,"score":116833.22073132833},{"content":"#[test]\n\nfn client_has_rejected_and_acepted_txs_should_return_tx_history() {\n\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\n\n let pipeline_time = Configuration::pipeline_time();\n\n\n\n // Given\n\n thread::sleep(pipeline_time);\n\n\n\n let account_id = AccountId::new(\"alice\", \"wonderland\");\n\n let asset_definition_id = AssetDefinitionId::new(\"xor\", \"wonderland\");\n\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\n\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\n\n ));\n\n iroha_client\n\n .submit(create_asset)\n\n .expect(\"Failed to prepare state.\");\n\n\n\n thread::sleep(pipeline_time * 2);\n\n\n\n //When\n\n let quantity: u32 = 200;\n","file_path":"client/tests/tests/tx_history.rs","rank":74,"score":116833.22073132833},{"content":"/// Body of method `type_name`\n\nfn type_name_body(name: &Ident, generics: &Generics) -> TokenStream2 {\n\n let generics = &generics\n\n .params\n\n .iter()\n\n .filter_map(|param| match param {\n\n GenericParam::Type(ty) => Some(&ty.ident),\n\n _ => None,\n\n })\n\n .collect::<Vec<_>>();\n\n let name = LitStr::new(&name.to_string(), Span::call_site());\n\n\n\n if generics.is_empty() {\n\n return quote! { format!(\"{}::{}\", module_path!(), #name) };\n\n }\n\n\n\n let mut format_str = \"{}::{}<\".to_owned();\n\n format_str.push_str(\n\n &generics\n\n .iter()\n\n .map(|_| \"{}\".to_owned())\n","file_path":"schema/derive/src/lib.rs","rank":75,"score":115494.84636766027},{"content":"#[test]\n\nfn check_generic() {\n\n use std::collections::BTreeMap;\n\n\n\n use iroha_schema::prelude::*;\n\n use Metadata::*;\n\n\n\n let expected_struct = Struct(NamedFieldsMeta {\n\n declarations: vec![Declaration {\n\n name: \"_value\".to_owned(),\n\n ty: \"Option<bool>\".to_owned(),\n\n }],\n\n });\n\n let expected = vec![\n\n (\"bool\".to_owned(), Bool),\n\n (\"Option<bool>\".to_owned(), Option(\"bool\".to_owned())),\n\n (\n\n \"struct_with_generic_bounds::Foo<bool>\".to_owned(),\n\n expected_struct,\n\n ),\n\n ]\n\n .into_iter()\n\n .collect::<BTreeMap<_, _>>();\n\n assert_eq!(Foo::<bool>::get_schema(), expected);\n\n}\n","file_path":"schema/tests/struct_with_generic_bounds.rs","rank":76,"score":115376.06976495695},{"content":"#[test]\n\nfn default_discriminants() {\n\n use std::collections::BTreeMap;\n\n\n\n use IntMode::*;\n\n use Metadata::*;\n\n\n\n let expected = vec![\n\n (\n\n \"Result<bool, String>\".to_owned(),\n\n Result(ResultMeta {\n\n ok: \"bool\".to_owned(),\n\n err: \"String\".to_owned(),\n\n }),\n\n ),\n\n (\"String\".to_owned(), String),\n\n (\"bool\".to_owned(), Bool),\n\n (\n\n \"enum_with_default_discriminants::Foo\".to_owned(),\n\n Enum(EnumMeta {\n\n variants: vec![\n","file_path":"schema/tests/enum_with_default_discriminants.rs","rank":77,"score":115376.06976495695},{"content":"#[test]\n\nfn named_fields() {\n\n use IntMode::*;\n\n use Metadata::*;\n\n\n\n let expected_struct = Struct(NamedFieldsMeta {\n\n declarations: vec![\n\n Declaration {\n\n name: \"executable\".to_owned(),\n\n ty: \"String\".to_owned(),\n\n },\n\n Declaration {\n\n name: \"args\".to_owned(),\n\n ty: \"Vec<String>\".to_owned(),\n\n },\n\n Declaration {\n\n name: \"num\".to_owned(),\n\n ty: \"i32\".to_owned(),\n\n },\n\n ],\n\n });\n","file_path":"schema/tests/struct_with_named_fields.rs","rank":78,"score":115376.06976495695},{"content":"fn main() {}\n","file_path":"macro/derive/tests/from_variant/03-container-enums.rs","rank":79,"score":115370.42589981068},{"content":"fn main() {}\n","file_path":"macro/derive/tests/from_variant/01-big-enum.rs","rank":80,"score":115370.42589981068},{"content":"/// Finds specific attribute with codec ident satisfying predicate\n\nfn find_meta_item<'a, F, R, I, M>(mut itr: I, mut pred: F) -> Option<R>\n\nwhere\n\n F: FnMut(M) -> Option<R> + Clone,\n\n I: Iterator<Item = &'a Attribute>,\n\n M: Parse,\n\n{\n\n itr.find_map(|attr| {\n\n attr.path\n\n .is_ident(\"codec\")\n\n .then(|| pred(attr.parse_args().ok()?))\n\n .flatten()\n\n })\n\n}\n\n\n","file_path":"schema/derive/src/lib.rs","rank":81,"score":115029.62602099439},{"content":"fn gen_address() -> String {\n\n format!(\"127.0.0.1:{}\", unique_port::get_unique_free_port().unwrap())\n\n}\n\n\n\nstatic INIT: Once = Once::new();\n\n\n","file_path":"p2p/tests/p2p.rs","rank":82,"score":114982.12321439333},{"content":"fn main() {\n\n\tlet qty = Fixed::negative_one();\n\n}\n","file_path":"data_model/tests/fail/neg_one_private.rs","rank":83,"score":112887.51503286888},{"content":"fn main() {\n\n\tlet quantity = Fixed(iroha_data_model::fixed::FixNum::try_from(-123.45_f64).unwrap());\n\n}\n","file_path":"data_model/tests/fail/fix_num_private.rs","rank":84,"score":112887.51503286888},{"content":"fn register_domain() -> Instruction {\n\n Instruction::Register(RegisterBox::new(Domain::new(DOMAIN)))\n\n}\n","file_path":"core/src/torii/tests.rs","rank":85,"score":112342.99465070161},{"content":"fn query() -> QueryBox {\n\n QueryBox::FindAccountById(FindAccountById::new(AccountId::new(\"alice\", DOMAIN)))\n\n}\n\n#[tokio::test]\n\nasync fn query_with_wrong_signatory() {\n\n AssertSet::new()\n\n .given(register_domain())\n\n .given(register_account(\"alice\"))\n\n .account(AccountId::new(\"alice\", DOMAIN))\n\n // .deny_all()\n\n .query(query())\n\n .status(StatusCode::UNAUTHORIZED)\n\n .assert()\n\n .await\n\n}\n\n#[tokio::test]\n\nasync fn query_with_wrong_signature() {\n\n AssertSet::new()\n\n .given(register_domain())\n\n .given(register_account(\"alice\"))\n","file_path":"core/src/torii/tests.rs","rank":86,"score":112342.99465070161},{"content":"fn add_bunyan<L>(configuration: &Configuration, layer: L) -> Result<Telemetries>\n\nwhere\n\n L: tracing_subscriber::Layer<Registry> + Debug + Send + Sync + 'static,\n\n{\n\n let level: tracing::Level = configuration.max_log_level.value().into();\n\n let level_filter = tracing_subscriber::filter::LevelFilter::from_level(level);\n\n let (filter, handle) = reload::Layer::new(level_filter);\n\n configuration.max_log_level.set_handle(handle)?;\n\n let (bunyan_layer, storage_layer) = match configuration.log_file_path.clone() {\n\n Some(path) => (\n\n Some(BunyanFormattingLayer::new(\n\n \"bunyan_layer\".into(),\n\n bunyan_writer_create(path)?,\n\n )),\n\n Some(JsonStorageLayer),\n\n ),\n\n None => (None, None),\n\n };\n\n let subscriber = Registry::default()\n\n .with(layer)\n\n .with(filter)\n\n .with(storage_layer)\n\n .with(bunyan_layer);\n\n add_telemetry_and_set_default(configuration, subscriber)\n\n}\n\n\n","file_path":"logger/src/lib.rs","rank":87,"score":111719.06467939688},{"content":"fn get_derives(derive: &Lit) -> syn::Result<Punctuated<Path, Token![,]>> {\n\n let lit = if let Lit::Str(lit) = derive {\n\n lit\n\n } else {\n\n return Ok(Punctuated::new());\n\n };\n\n let parser = |stream: ParseStream<'_>| -> syn::parse::Result<Punctuated<Path, Token![,]>> {\n\n Punctuated::parse_terminated(stream)\n\n };\n\n parser.parse_str(&lit.value())\n\n}\n\n\n","file_path":"version/derive/src/lib.rs","rank":88,"score":109820.56089617785},{"content":"/// Returns the a map of a form `domain_name -> domain`, for initial domains.\n\npub fn domains(configuration: &Configuration) -> Result<BTreeMap<String, Domain>> {\n\n let key = configuration\n\n .genesis\n\n .account_public_key\n\n .clone()\n\n .ok_or_else(|| eyre!(\"Genesis account public key is not specified.\"))?;\n\n Ok(std::iter::once((\n\n GENESIS_DOMAIN_NAME.to_owned(),\n\n Domain::from(GenesisDomain::new(key)),\n\n ))\n\n .collect())\n\n}\n","file_path":"core/src/init.rs","rank":89,"score":109820.56089617785},{"content":"#[test]\n\nfn install_panic_hook_multiple_times_works() {\n\n iroha_logger::install_panic_hook().unwrap();\n\n iroha_logger::install_panic_hook().unwrap();\n\n}\n","file_path":"logger/tests/setting_logger.rs","rank":90,"score":108343.60897527495},{"content":"fn bunyan_writer_create(destination: PathBuf) -> Result<Arc<std::fs::File>> {\n\n OpenOptions::new()\n\n .create(true)\n\n .append(true)\n\n .open(destination)\n\n .wrap_err(\"Failed to create or open bunyan logs file\")\n\n .map(Arc::new)\n\n}\n\n\n","file_path":"logger/src/lib.rs","rank":91,"score":108017.48849177184},{"content":"#[test]\n\nfn find_rate_and_make_exchange_isi_should_succeed() {\n\n let kp = KeyPair {\n\n public_key: PublicKey::from_str(\n\n r#\"ed01207233bfc89dcbd68c19fde6ce6158225298ec1131b6a130d1aeb454c1ab5183c0\"#,\n\n )\n\n .unwrap(),\n\n private_key: PrivateKey {\n\n digest_function: \"ed25519\".to_string(),\n\n payload: hex_literal::hex!(\"9AC47ABF 59B356E0 BD7DCBBB B4DEC080 E302156A 48CA907E 47CB6AEA 1D32719E 7233BFC8 9DCBD68C 19FDE6CE 61582252 98EC1131 B6A130D1 AEB454C1 AB5183C0\")\n\n\t\t\t\t.into(),\n\n },\n\n };\n\n let mut peer = <TestPeer>::new().expect(\"Failed to create peer\");\n\n let configuration = get_config(std::iter::once(peer.id.clone()).collect(), Some(kp.clone()));\n\n let pipeline_time = Duration::from_millis(configuration.sumeragi.pipeline_time_ms());\n\n\n\n // Given\n\n let genesis = GenesisNetwork::from_configuration(\n\n true,\n\n RawGenesisBlock::new(\"alice\", \"wonderland\", &kp.public_key),\n","file_path":"data_model/tests/data_model.rs","rank":92,"score":106254.33896785344},{"content":"#[test]\n\nfn find_rate_and_make_exchange_isi_should_be_valid() {\n\n let _instruction = Pair::new(\n\n TransferBox::new(\n\n IdBox::AssetId(AssetId::from_names(\"btc\", \"crypto\", \"seller\", \"company\")),\n\n Expression::Query(\n\n FindAssetQuantityById::new(AssetId::from_names(\n\n \"btc2eth_rate\",\n\n \"exchange\",\n\n \"dex\",\n\n \"exchange\",\n\n ))\n\n .into(),\n\n ),\n\n IdBox::AssetId(AssetId::from_names(\"btc\", \"crypto\", \"buyer\", \"company\")),\n\n ),\n\n TransferBox::new(\n\n IdBox::AssetId(AssetId::from_names(\"btc\", \"crypto\", \"buyer\", \"company\")),\n\n Expression::Query(\n\n FindAssetQuantityById::new(AssetId::from_names(\n\n \"btc2eth_rate\",\n","file_path":"data_model/tests/data_model.rs","rank":93,"score":106254.33896785344},{"content":"fn impl_json(enum_name: &Ident, version_field_name: &str) -> proc_macro2::TokenStream {\n\n quote!(\n\n impl<'a> iroha_version::json::DeserializeVersioned<'a> for #enum_name {\n\n fn from_versioned_json_str(input: &str) -> iroha_version::error::Result<Self> {\n\n use iroha_version::{error::Error, Version, UnsupportedVersion, RawVersioned};\n\n use serde_json::Value;\n\n\n\n let json: Value = serde_json::from_str(input)?;\n\n if let Value::Object(map) = json {\n\n if let Some(Value::String(version_number)) = map.get(#version_field_name) {\n\n let version: u8 = version_number.parse()?;\n\n if Self::supported_versions().contains(&version) {\n\n Ok(serde_json::from_str(input)?)\n\n } else {\n\n Err(Error::UnsupportedVersion(\n\n UnsupportedVersion::new(version, RawVersioned::Json(input.to_owned()))\n\n ))\n\n }\n\n } else {\n\n Err(Error::NotVersioned)\n","file_path":"version/derive/src/lib.rs","rank":94,"score":105944.73300532468},{"content":"fn prepare_message(name: &str, telemetry: Telemetry) -> Result<(Message, Option<MessageKind>)> {\n\n let fields = telemetry.fields.0;\n\n let msg_kind = fields\n\n .iter()\n\n .find_map(|(name, map)| (*name == \"msg\").then(|| map))\n\n .and_then(|v| {\n\n v.as_str().map(|v| match v {\n\n \"system.connected\" => Some(MessageKind::Initialization),\n\n _ => None,\n\n })\n\n })\n\n .ok_or_else(|| eyre!(\"Failed to read 'msg'\"))?;\n\n let mut payload: Map<_, _> = fields\n\n .into_iter()\n\n .map(|(field, map)| {\n\n let field = field.to_owned();\n\n let map = if field == \"genesis_hash\" || field == \"best\" || field == \"finalized_hash\" {\n\n if let Some(hash) = map.as_str() {\n\n format!(\"0x{}\", hash).into()\n\n } else {\n","file_path":"telemetry/src/ws.rs","rank":95,"score":105828.67787301767},{"content":"fn from_hex<'de, D>(deserializer: D) -> Result<Vec<u8>, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n hex::decode(String::deserialize(deserializer)?).map_err(SerdeError::custom)\n\n}\n\n\n","file_path":"crypto/src/lib.rs","rank":96,"score":105680.88389244417},{"content":"pub fn main() {}\n","file_path":"version/derive/tests/ui/fail_invalid_range_less.rs","rank":97,"score":105310.53386101962},{"content":"pub fn main() {}\n","file_path":"version/derive/tests/ui/fail_invalid_range_equal.rs","rank":98,"score":105310.53386101962},{"content":"#[test]\n\nfn find_rate_and_check_it_greater_than_value_isi_should_be_valid() {\n\n let _instruction = IfInstruction::new(\n\n Not::new(Greater::new(\n\n QueryBox::from(FindAssetQuantityById::new(AssetId::from_names(\n\n \"btc2eth_rate\",\n\n \"exchange\",\n\n \"dex\",\n\n \"exchange\",\n\n ))),\n\n 10_u32,\n\n )),\n\n FailBox::new(\"rate is less or equal to value\"),\n\n );\n\n}\n\n\n","file_path":"data_model/tests/data_model.rs","rank":99,"score":104275.64794607543}],"string":"[\n {\n \"content\": \"fn mint_asset(quantity: u32, asset: &str, account: &str) -> Instruction {\\n\\n Instruction::Mint(MintBox::new(\\n\\n Value::U32(quantity),\\n\\n AssetId::from_names(asset, DOMAIN, account, DOMAIN),\\n\\n ))\\n\\n}\\n\\n#[tokio::test]\\n\\nasync fn find_asset() {\\n\\n AssertSet::new()\\n\\n .given(register_domain())\\n\\n .given(register_account(\\\"alice\\\"))\\n\\n .given(register_asset_definition(\\\"rose\\\"))\\n\\n .given(mint_asset(99, \\\"rose\\\", \\\"alice\\\"))\\n\\n .query(QueryBox::FindAssetById(FindAssetById::new(\\n\\n AssetId::from_names(\\\"rose\\\", DOMAIN, \\\"alice\\\", DOMAIN),\\n\\n )))\\n\\n .status(StatusCode::OK)\\n\\n .hint(\\\"Quantity\\\")\\n\\n .hint(\\\"99\\\")\\n\\n .assert()\\n\",\n \"file_path\": \"core/src/torii/tests.rs\",\n \"rank\": 2,\n \"score\": 217649.98316761883\n },\n {\n \"content\": \"fn mint(\\n\\n asset_definition_id: &AssetDefinitionId,\\n\\n account_id: &AccountId,\\n\\n client: &mut client::Client,\\n\\n pipeline_time: std::time::Duration,\\n\\n quantity: u32,\\n\\n) -> Result<u32, color_eyre::Report> {\\n\\n let mint_asset = MintBox::new(\\n\\n Value::U32(quantity),\\n\\n IdBox::AssetId(AssetId::new(\\n\\n asset_definition_id.clone(),\\n\\n account_id.clone(),\\n\\n )),\\n\\n );\\n\\n client.submit(mint_asset)?;\\n\\n thread::sleep(pipeline_time * 5);\\n\\n iroha_logger::info!(\\\"Mint\\\");\\n\\n Ok(quantity)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/unregister_peer.rs\",\n \"rank\": 4,\n \"score\": 209182.0183100117\n },\n {\n \"content\": \"fn main() {}\\n\",\n \"file_path\": \"actor/tests/ok/simple_result.rs\",\n \"rank\": 5,\n \"score\": 205971.5059600347\n },\n {\n \"content\": \"fn init() -> Result<(\\n\\n tokio::runtime::Runtime,\\n\\n test_network::Network,\\n\\n iroha_client::client::Client,\\n\\n std::time::Duration,\\n\\n AccountId,\\n\\n AssetDefinitionId,\\n\\n)> {\\n\\n let (rt, network, mut client) = <Network>::start_test_with_runtime(4, 1);\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n thread::sleep(pipeline_time * 2);\\n\\n iroha_logger::info!(\\\"Started\\\");\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\\\"domain\\\").into()));\\n\\n let account_id = AccountId::new(\\\"account\\\", \\\"domain\\\");\\n\\n let create_account = RegisterBox::new(IdentifiableBox::NewAccount(\\n\\n NewAccount::with_signatory(account_id.clone(), KeyPair::generate()?.public_key).into(),\\n\\n ));\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"domain\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\\n\",\n \"file_path\": \"client/tests/tests/unregister_peer.rs\",\n \"rank\": 6,\n \"score\": 198384.21898542446\n },\n {\n \"content\": \"#[test]\\n\\nfn transaction_event_should_be_sent_to_all_peers_from_all_peers() -> Result<()> {\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"wonderland\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id).into(),\\n\\n ));\\n\\n test_with_instruction_and_status(create_asset, true)?;\\n\\n let fail = FailBox::new(\\\"Failing transaction to test Rejected event.\\\");\\n\\n test_with_instruction_and_status(fail, false)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/events.rs\",\n \"rank\": 7,\n \"score\": 188310.22372946815\n },\n {\n \"content\": \"#[test]\\n\\nfn restarted_peer_should_have_the_same_asset_amount() -> Result<()> {\\n\\n let temp_dir = TempDir::new()?;\\n\\n\\n\\n let mut configuration = Configuration::test();\\n\\n let mut peer = <TestPeer>::new()?;\\n\\n configuration.sumeragi.trusted_peers.peers = std::iter::once(peer.id.clone()).collect();\\n\\n\\n\\n let pipeline_time = Duration::from_millis(configuration.sumeragi.pipeline_time_ms());\\n\\n\\n\\n // Given\\n\\n let rt = Runtime::test();\\n\\n rt.block_on(peer.start_with_config_permissions_dir(configuration.clone(), AllowAll, &temp_dir));\\n\\n\\n\\n // Wait for genesis to be committed.\\n\\n thread::sleep(pipeline_time * 2);\\n\\n\\n\\n let account_id = AccountId::from_str(\\\"alice@wonderland\\\").unwrap();\\n\\n let asset_definition_id = AssetDefinitionId::from_str(\\\"xor#wonderland\\\").unwrap();\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\\n\",\n \"file_path\": \"client/tests/tests/restart_peer.rs\",\n \"rank\": 8,\n \"score\": 188310.22372946815\n },\n {\n \"content\": \"#[test]\\n\\nfn client_add_asset_quantity_to_existing_asset_should_increase_asset_amount() {\\n\\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n let register = ('a'..'z')\\n\\n .map(|c| c.to_string())\\n\\n .map(|name| AssetDefinitionId::new(&name, \\\"wonderland\\\"))\\n\\n .map(AssetDefinition::new_quantity)\\n\\n .map(IdentifiableBox::from)\\n\\n .map(RegisterBox::new)\\n\\n .map(Instruction::Register)\\n\\n .collect();\\n\\n iroha_client\\n\\n .submit_all(register)\\n\\n .expect(\\\"Failed to prepare state.\\\");\\n\\n\\n\\n thread::sleep(pipeline_time);\\n\\n //When\\n\\n\\n\\n let vec = iroha_client\\n\",\n \"file_path\": \"client/tests/tests/pagination.rs\",\n \"rank\": 9,\n \"score\": 186665.1994636223\n },\n {\n \"content\": \"#[test]\\n\\nfn network_stable_after_add_and_after_remove_peer() -> Result<()> {\\n\\n // Given a network\\n\\n let (rt, network, mut genesis_client, pipeline_time, account_id, asset_definition_id) = init()?;\\n\\n // When assets are minted\\n\\n mint(\\n\\n &asset_definition_id,\\n\\n &account_id,\\n\\n &mut genesis_client,\\n\\n pipeline_time,\\n\\n 100,\\n\\n )?;\\n\\n // and a new peer is registered\\n\\n let (peer, mut peer_client) = rt.block_on(network.add_peer());\\n\\n // Then the new peer should already have the mint result.\\n\\n check_assets(&mut peer_client, &account_id, &asset_definition_id, 100);\\n\\n // Also, when a peer is unregistered\\n\\n let remove_peer = UnregisterBox::new(IdBox::PeerId(peer.id.clone()));\\n\\n genesis_client.submit(remove_peer)?;\\n\\n thread::sleep(pipeline_time * 2);\\n\\n // We can mint without error.\\n\",\n \"file_path\": \"client/tests/tests/unregister_peer.rs\",\n \"rank\": 10,\n \"score\": 185279.96833714255\n },\n {\n \"content\": \"// TODO: make it const generic type once it will be stabilized\\n\\nfn parse_const_ident(input: ParseStream, ident: &'static str) -> syn::Result<Ident> {\\n\\n let parse_ident: Ident = input.parse()?;\\n\\n if parse_ident == ident {\\n\\n Ok(parse_ident)\\n\\n } else {\\n\\n Err(syn::Error::new_spanned(parse_ident, \\\"Unknown ident\\\"))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Parse for Result {\\n\\n fn parse(input: ParseStream) -> syn::Result<Self> {\\n\\n Ok(Self {\\n\\n _ident: parse_const_ident(input, RESULT)?,\\n\\n _eq: input.parse()?,\\n\\n result: input.parse()?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n/// Derive for message. Check other doc in `iroha_actor` reexport\\n\",\n \"file_path\": \"actor/derive/src/lib.rs\",\n \"rank\": 11,\n \"score\": 184930.95983894507\n },\n {\n \"content\": \"// TODO: make it const generic type once it will be stabilized\\n\\nfn parse_const_ident(input: ParseStream, ident: &'static str) -> syn::Result<Ident> {\\n\\n let parse_ident: Ident = input.parse()?;\\n\\n if parse_ident == ident {\\n\\n Ok(parse_ident)\\n\\n } else {\\n\\n Err(syn::Error::new_spanned(parse_ident, \\\"Unknown ident\\\"))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Parse for EnvPrefix {\\n\\n fn parse(input: ParseStream) -> syn::Result<Self> {\\n\\n Ok(Self {\\n\\n _ident: parse_const_ident(input, attrs::ENV_PREFIX)?,\\n\\n _eq: input.parse()?,\\n\\n prefix: input.parse()?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"config/derive/src/lib.rs\",\n \"rank\": 12,\n \"score\": 184930.95983894507\n },\n {\n \"content\": \"#[test]\\n\\nfn transaction_signed_by_new_signatory_of_account_should_pass() -> Result<()> {\\n\\n let (_rt, peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n thread::sleep(pipeline_time);\\n\\n\\n\\n // Given\\n\\n let account_id = AccountId::new(\\\"alice\\\", \\\"wonderland\\\");\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"wonderland\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\\n\\n ));\\n\\n let key_pair = KeyPair::generate()?;\\n\\n let add_signatory = MintBox::new(\\n\\n key_pair.public_key.clone(),\\n\\n IdBox::AccountId(account_id.clone()),\\n\\n );\\n\\n\\n\\n iroha_client.submit_all(vec![create_asset.into(), add_signatory.into()])?;\\n\\n thread::sleep(pipeline_time * 2);\\n\\n //When\\n\",\n \"file_path\": \"client/tests/tests/multisignature_account.rs\",\n \"rank\": 13,\n \"score\": 182394.26675683528\n },\n {\n \"content\": \"#[test]\\n\\nfn client_add_domain_with_name_length_more_than_limit_should_not_commit_transaction() -> Result<()>\\n\\n{\\n\\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time);\\n\\n\\n\\n let normal_domain_name = \\\"sora\\\";\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::from(Domain::new(normal_domain_name)));\\n\\n test_client.submit(create_domain)?;\\n\\n\\n\\n let too_long_domain_name = &\\\"0\\\".repeat(2_usize.pow(14));\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::from(Domain::new(too_long_domain_name)));\\n\\n test_client.submit(create_domain)?;\\n\\n\\n\\n thread::sleep(pipeline_time * 2);\\n\\n\\n\\n assert!(test_client\\n\\n .request(client::domain::by_name(normal_domain_name.to_string()))\\n\\n .is_ok());\\n\\n assert!(test_client\\n\\n .request(client::domain::by_name(too_long_domain_name.to_string()))\\n\\n .is_err());\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"client/tests/tests/add_domain.rs\",\n \"rank\": 15,\n \"score\": 177016.03332801475\n },\n {\n \"content\": \"#[test]\\n\\nfn client_add_account_with_name_length_more_than_limit_should_not_commit_transaction() -> Result<()>\\n\\n{\\n\\n let (_rt, _peer, mut test_client) = <TestPeer>::start_test_with_runtime();\\n\\n\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n let normal_account_id = AccountId::new(\\\"bob\\\", \\\"wonderland\\\");\\n\\n let create_account = RegisterBox::new(IdentifiableBox::from(NewAccount::new(\\n\\n normal_account_id.clone(),\\n\\n )));\\n\\n test_client.submit(create_account)?;\\n\\n\\n\\n let too_long_account_name = \\\"0\\\".repeat(2_usize.pow(14));\\n\\n let incorrect_account_id = AccountId::new(&too_long_account_name, \\\"wonderland\\\");\\n\\n let create_account = RegisterBox::new(IdentifiableBox::from(NewAccount::new(\\n\\n incorrect_account_id.clone(),\\n\\n )));\\n\\n test_client.submit(create_account)?;\\n\\n\\n\\n thread::sleep(pipeline_time * 2);\\n\",\n \"file_path\": \"client/tests/tests/add_account.rs\",\n \"rank\": 16,\n \"score\": 177016.03332801475\n },\n {\n \"content\": \"fn main() {}\\n\",\n \"file_path\": \"actor/tests/ok/generics.rs\",\n \"rank\": 17,\n \"score\": 166245.33633246948\n },\n {\n \"content\": \"fn main() {}\\n\",\n \"file_path\": \"actor/tests/ok/simple.rs\",\n \"rank\": 18,\n \"score\": 166245.33633246948\n },\n {\n \"content\": \"fn to_hex<S>(payload: &[u8], serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: serde::Serializer,\\n\\n{\\n\\n serializer.serialize_str(&hex::encode(payload))\\n\\n}\\n\\n\\n\\nimpl Debug for PrivateKey {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n f.debug_struct(\\\"PrivateKey\\\")\\n\\n .field(\\\"digest_function\\\", &self.digest_function)\\n\\n .field(\\\"payload\\\", &format!(\\\"{:X?}\\\", self.payload))\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for PrivateKey {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", hex::encode(&self.payload))\\n\\n }\\n\",\n \"file_path\": \"crypto/src/lib.rs\",\n \"rank\": 19,\n \"score\": 154499.11426347474\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n let mut config = vergen::Config::default();\\n\\n *config.git_mut().sha_kind_mut() = ShaKind::Short;\\n\\n vergen::vergen(config)\\n\\n}\\n\",\n \"file_path\": \"telemetry/build.rs\",\n \"rank\": 20,\n \"score\": 153470.22363627132\n },\n {\n \"content\": \"fn get_assets(iroha_client: &mut Client, id: &AccountId) -> Vec<Asset> {\\n\\n iroha_client\\n\\n .request(client::asset::by_account_id(id.clone()))\\n\\n .expect(\\\"Failed to execute request.\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/permissions.rs\",\n \"rank\": 21,\n \"score\": 152767.91245820295\n },\n {\n \"content\": \"pub fn main() {\\n\\n let versioned_message: VersionedMessage = Message.into();\\n\\n match versioned_message {\\n\\n VersionedMessage::V1(message) => {\\n\\n let message: Message = message.into();\\n\\n message.handle();\\n\\n }\\n\\n VersionedMessage::V2(message) => {\\n\\n let message: Message2 = message.into();\\n\\n message.handle();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"version/derive/tests/ui/ok_declare_versioned.rs\",\n \"rank\": 22,\n \"score\": 147722.01707832288\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n color_eyre::install()?;\\n\\n let Args {\\n\\n config: Configuration(config),\\n\\n subcommand,\\n\\n } = Args::from_args();\\n\\n\\n\\n println!(\\\"Value for config: {:?}\\\", &config);\\n\\n subcommand\\n\\n .run(&config)\\n\\n .wrap_err(\\\"Failed to run subcommand\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client_cli/src/main.rs\",\n \"rank\": 23,\n \"score\": 147592.77090095432\n },\n {\n \"content\": \"pub fn main() {\\n\\n let versioned_message: VersionedMessage = Message.into();\\n\\n match versioned_message {\\n\\n VersionedMessage::V1(message) => {\\n\\n let message: Message = message.into();\\n\\n message.handle();\\n\\n }\\n\\n VersionedMessage::V2(message) => {\\n\\n let message: Message2 = message.into();\\n\\n message.handle();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"version/derive/tests/ui/ok_declare_versioned_scale.rs\",\n \"rank\": 24,\n \"score\": 144389.28659683038\n },\n {\n \"content\": \"pub fn main() {\\n\\n let versioned_message: VersionedMessage = Message.into();\\n\\n match versioned_message {\\n\\n VersionedMessage::V1(message) => {\\n\\n let message: Message = message.into();\\n\\n message.handle();\\n\\n }\\n\\n VersionedMessage::V2(message) => {\\n\\n let message: Message2 = message.into();\\n\\n message.handle();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"version/derive/tests/ui/ok_declare_versioned_json.rs\",\n \"rank\": 25,\n \"score\": 144389.28659683035\n },\n {\n \"content\": \"pub fn main() {\\n\\n let versioned_message: VersionedMessage = Message.into();\\n\\n match versioned_message {\\n\\n VersionedMessage::V1(message) => {\\n\\n let message: Message = message.into();\\n\\n message.handle();\\n\\n }\\n\\n }\\n\\n let versioned_message: VersionedMessage2 = Message2.into();\\n\\n match versioned_message {\\n\\n VersionedMessage2::V1(message) => {\\n\\n let message: Message2 = message.into();\\n\\n message.handle();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"version/derive/tests/ui/ok_declare_several_vesrioned.rs\",\n \"rank\": 26,\n \"score\": 144389.28659683035\n },\n {\n \"content\": \"#[test]\\n\\nfn client_add_asset_quantity_to_existing_asset_should_increase_asset_amount_on_another_peer(\\n\\n) -> Result<()> {\\n\\n // Given\\n\\n let (_rt, network, mut iroha_client) = <Network>::start_test_with_runtime(4, 1);\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n thread::sleep(pipeline_time * 5);\\n\\n\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\\\"domain\\\").into()));\\n\\n let account_id = AccountId::new(\\\"account\\\", \\\"domain\\\");\\n\\n let create_account = RegisterBox::new(IdentifiableBox::NewAccount(\\n\\n NewAccount::with_signatory(account_id.clone(), KeyPair::generate()?.public_key).into(),\\n\\n ));\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"domain\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\\n\\n ));\\n\\n iroha_client.submit_all(vec![\\n\\n create_domain.into(),\\n\\n create_account.into(),\\n\",\n \"file_path\": \"client/tests/tests/asset_propagation.rs\",\n \"rank\": 27,\n \"score\": 143594.67921079788\n },\n {\n \"content\": \"fn main() -> Result<(), Report> {\\n\\n color_eyre::install()?;\\n\\n let default_algorithm = Algorithm::default().to_string();\\n\\n let matches = App::new(\\\"iroha_crypto_cli\\\")\\n\\n .version(\\\"0.1\\\")\\n\\n .author(\\\"Soramitsu\\\")\\n\\n .about(\\\"iroha_crypto_cli is a command line tool used to generate keys for Iroha peers and clients.\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"seed\\\")\\n\\n .long(\\\"seed\\\")\\n\\n .value_name(\\\"seed\\\")\\n\\n .help(\\\"Sets a seed for random number generator. Should be used separately from `private_key`.\\\")\\n\\n .required(false)\\n\\n .takes_value(true)\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"private_key\\\")\\n\\n .long(\\\"private_key\\\")\\n\\n .value_name(\\\"private_key\\\")\\n\\n .help(\\\"Sets a private key. Should be used separately from `seed`.\\\")\\n\",\n \"file_path\": \"crypto_cli/src/main.rs\",\n \"rank\": 28,\n \"score\": 139653.91929149552\n },\n {\n \"content\": \"fn main() -> color_eyre::Result<()> {\\n\\n color_eyre::install().unwrap();\\n\\n Configuration::get_markdown(&mut BufWriter::new(stdout()))\\n\\n .wrap_err(\\\"Failed to generate documentation\\\")\\n\\n}\\n\\n\\n\\nimpl<E: Debug, C: Configurable<Error = E> + Send + Sync + Default> PrintDocs for C {}\\n\\n\\n\",\n \"file_path\": \"core/docs/src/main.rs\",\n \"rank\": 29,\n \"score\": 137142.11426594856\n },\n {\n \"content\": \"#[derive(iroha_actor::Message)]\\n\\n#[message(result = \\\"i32\\\")]\\n\",\n \"file_path\": \"actor/tests/ok/simple_result.rs\",\n \"rank\": 30,\n \"score\": 135178.2939852847\n },\n {\n \"content\": \"#[test]\\n\\nfn test_status() {\\n\\n const N_PEERS: u64 = 4;\\n\\n let mut status;\\n\\n\\n\\n let (rt, network, mut client) = <TestNetwork>::start_test_with_runtime(N_PEERS as u32, 1);\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n thread::sleep(pipeline_time * 2);\\n\\n\\n\\n // Confirm all peers connected\\n\\n status = client.get_status().unwrap();\\n\\n assert_eq!(status.peers, N_PEERS - 1);\\n\\n assert_eq!(status.blocks, 1);\\n\\n\\n\\n // Add a peer then #peers should be incremented\\n\\n let (peer, _) = rt.block_on(network.add_peer());\\n\\n thread::sleep(pipeline_time * 2);\\n\\n status = client.get_status().unwrap();\\n\\n assert_eq!(status.peers, N_PEERS);\\n\\n assert_eq!(status.blocks, 2);\\n\\n\\n\\n // Remove the peer then #peers should be decremented\\n\\n let remove_peer = UnregisterBox::new(IdBox::PeerId(peer.id.clone()));\\n\\n client.submit(remove_peer).expect(\\\"Failed to remove peer\\\");\\n\\n thread::sleep(pipeline_time * 2);\\n\\n status = client.get_status().unwrap();\\n\\n assert_eq!(status.peers, N_PEERS - 1);\\n\\n assert_eq!(status.blocks, 3);\\n\\n}\\n\",\n \"file_path\": \"client/tests/tests/status.rs\",\n \"rank\": 31,\n \"score\": 134963.25885890194\n },\n {\n \"content\": \"fn validate_blocks(criterion: &mut Criterion) {\\n\\n // Prepare WSV\\n\\n let key_pair = KeyPair::generate().expect(\\\"Failed to generate KeyPair.\\\");\\n\\n let domain_name = \\\"global\\\".to_string();\\n\\n let asset_definitions = BTreeMap::new();\\n\\n let account_id = AccountId::new(\\\"root\\\", &domain_name);\\n\\n let account = Account::with_signatory(account_id.clone(), key_pair.public_key);\\n\\n let mut accounts = BTreeMap::new();\\n\\n accounts.insert(account_id, account);\\n\\n let domain = Domain {\\n\\n name: domain_name.clone(),\\n\\n accounts,\\n\\n asset_definitions,\\n\\n metadata: Metadata::new(),\\n\\n };\\n\\n let mut domains = BTreeMap::new();\\n\\n domains.insert(domain_name, domain);\\n\\n let wsv = WorldStateView::new(World::with(domains, BTreeSet::new()));\\n\\n // Pepare test transaction\\n\\n let keys = KeyPair::generate().expect(\\\"Failed to generate keys\\\");\\n\",\n \"file_path\": \"core/benches/validation.rs\",\n \"rank\": 32,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn accept_transaction(criterion: &mut Criterion) {\\n\\n let keys = KeyPair::generate().expect(\\\"Failed to generate keys\\\");\\n\\n let transaction = build_test_transaction(&keys);\\n\\n let mut success_count = 0;\\n\\n let mut failures_count = 0;\\n\\n let _ = criterion.bench_function(\\\"accept\\\", |b| {\\n\\n b.iter(\\n\\n || match AcceptedTransaction::from_transaction(transaction.clone(), 4096) {\\n\\n Ok(_) => success_count += 1,\\n\\n Err(_) => failures_count += 1,\\n\\n },\\n\\n );\\n\\n });\\n\\n println!(\\n\\n \\\"Success count: {}, Failures count: {}\\\",\\n\\n success_count, failures_count\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/benches/validation.rs\",\n \"rank\": 33,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn chain_blocks(criterion: &mut Criterion) {\\n\\n let keys = KeyPair::generate().expect(\\\"Failed to generate keys\\\");\\n\\n let transaction = AcceptedTransaction::from_transaction(build_test_transaction(&keys), 4096)\\n\\n .expect(\\\"Failed to accept transaction.\\\");\\n\\n let block = PendingBlock::new(vec![transaction.into()]);\\n\\n let mut previous_block_hash = block.clone().chain_first().hash();\\n\\n let mut success_count = 0;\\n\\n let _ = criterion.bench_function(\\\"chain_block\\\", |b| {\\n\\n b.iter(|| {\\n\\n success_count += 1;\\n\\n let new_block = block.clone().chain(\\n\\n success_count,\\n\\n previous_block_hash.transmute(),\\n\\n view_change::ProofChain::empty(),\\n\\n Vec::new(),\\n\\n );\\n\\n previous_block_hash = new_block.hash();\\n\\n });\\n\\n });\\n\\n println!(\\\"Total count: {}\\\", success_count);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/benches/validation.rs\",\n \"rank\": 34,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn query_requests(criterion: &mut Criterion) {\\n\\n let mut peer = <TestPeer>::new().expect(\\\"Failed to create peer\\\");\\n\\n let configuration = get_config(\\n\\n std::iter::once(peer.id.clone()).collect(),\\n\\n Some(get_key_pair()),\\n\\n );\\n\\n let rt = Runtime::test();\\n\\n let genesis = GenesisNetwork::from_configuration(\\n\\n true,\\n\\n RawGenesisBlock::new(\\\"alice\\\", \\\"wonderland\\\", &get_key_pair().public_key),\\n\\n &configuration.genesis,\\n\\n configuration.sumeragi.max_instruction_number,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n rt.block_on(peer.start_with_config(genesis, configuration));\\n\\n thread::sleep(std::time::Duration::from_millis(50));\\n\\n\\n\\n let mut group = criterion.benchmark_group(\\\"query-reqeuests\\\");\\n\\n let domain_name = \\\"domain\\\";\\n\",\n \"file_path\": \"client/benches/torii.rs\",\n \"rank\": 35,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn instruction_submits(criterion: &mut Criterion) {\\n\\n let rt = Runtime::test();\\n\\n let mut peer = <TestPeer>::new().expect(\\\"Failed to create peer\\\");\\n\\n let configuration = get_config(\\n\\n std::iter::once(peer.id.clone()).collect(),\\n\\n Some(get_key_pair()),\\n\\n );\\n\\n let genesis = GenesisNetwork::from_configuration(\\n\\n true,\\n\\n RawGenesisBlock::new(\\\"alice\\\", \\\"wonderland\\\", &configuration.public_key),\\n\\n &configuration.genesis,\\n\\n configuration.sumeragi.max_instruction_number,\\n\\n )\\n\\n .unwrap();\\n\\n rt.block_on(peer.start_with_config(genesis, configuration));\\n\\n thread::sleep(std::time::Duration::from_millis(50));\\n\\n\\n\\n let mut group = criterion.benchmark_group(\\\"instruction-requests\\\");\\n\\n let domain_name = \\\"domain\\\";\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(domain_name).into()));\\n\",\n \"file_path\": \"client/benches/torii.rs\",\n \"rank\": 36,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn validate_transaction(criterion: &mut Criterion) {\\n\\n let keys = KeyPair::generate().expect(\\\"Failed to generate keys\\\");\\n\\n let transaction = AcceptedTransaction::from_transaction(build_test_transaction(&keys), 4096)\\n\\n .expect(\\\"Failed to accept transaction.\\\");\\n\\n let mut success_count = 0;\\n\\n let mut failures_count = 0;\\n\\n let wsv = build_test_wsv(&keys);\\n\\n let _ = criterion.bench_function(\\\"validate\\\", |b| {\\n\\n b.iter(|| {\\n\\n match transaction\\n\\n .clone()\\n\\n .validate(&wsv, &AllowAll.into(), &AllowAll.into(), false)\\n\\n {\\n\\n Ok(_) => success_count += 1,\\n\\n Err(_) => failures_count += 1,\\n\\n }\\n\\n });\\n\\n });\\n\\n println!(\\n\\n \\\"Success count: {}, Failures count: {}\\\",\\n\\n success_count, failures_count\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/benches/validation.rs\",\n \"rank\": 37,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn sort_peers(criterion: &mut Criterion) {\\n\\n let peers = get_n_peers(N_PEERS);\\n\\n let _ = criterion.bench_function(\\\"sort_peers\\\", |b| {\\n\\n let hash = HashOf::from_hash(Hash([0_u8; 32]));\\n\\n b.iter(|| network_topology::sort_peers_by_hash(peers.clone(), &hash));\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, sort_peers);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"core/benches/sumeragi.rs\",\n \"rank\": 38,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn sign_blocks(criterion: &mut Criterion) {\\n\\n let keys = KeyPair::generate().expect(\\\"Failed to generate keys\\\");\\n\\n let transaction = AcceptedTransaction::from_transaction(build_test_transaction(&keys), 4096)\\n\\n .expect(\\\"Failed to accept transaction.\\\");\\n\\n let wsv = build_test_wsv(&keys);\\n\\n let block = PendingBlock::new(vec![transaction.into()])\\n\\n .chain_first()\\n\\n .validate(&wsv, &AllowAll.into(), &AllowAll.into());\\n\\n let key_pair = KeyPair::generate().expect(\\\"Failed to generate KeyPair.\\\");\\n\\n let mut success_count = 0;\\n\\n let mut failures_count = 0;\\n\\n let _ = criterion.bench_function(\\\"sign_block\\\", |b| {\\n\\n b.iter(|| match block.clone().sign(key_pair.clone()) {\\n\\n Ok(_) => success_count += 1,\\n\\n Err(_) => failures_count += 1,\\n\\n });\\n\\n });\\n\\n println!(\\n\\n \\\"Success count: {}, Failures count: {}\\\",\\n\\n success_count, failures_count\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/benches/validation.rs\",\n \"rank\": 39,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"fn sign_transaction(criterion: &mut Criterion) {\\n\\n let keys = KeyPair::generate().expect(\\\"Failed to generate keys\\\");\\n\\n let transaction = build_test_transaction(&keys);\\n\\n let key_pair = KeyPair::generate().expect(\\\"Failed to generate KeyPair.\\\");\\n\\n let mut success_count = 0;\\n\\n let mut failures_count = 0;\\n\\n let _ = criterion.bench_function(\\\"sign\\\", |b| {\\n\\n b.iter(|| match transaction.clone().sign(&key_pair) {\\n\\n Ok(_) => success_count += 1,\\n\\n Err(_) => failures_count += 1,\\n\\n });\\n\\n });\\n\\n println!(\\n\\n \\\"Success count: {}, Failures count: {}\\\",\\n\\n success_count, failures_count\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"core/benches/validation.rs\",\n \"rank\": 40,\n \"score\": 133038.49097423392\n },\n {\n \"content\": \"#[allow(clippy::needless_range_loop)]\\n\\nfn test_with_instruction_and_status(\\n\\n instruction: impl Into<Instruction>,\\n\\n should_be_committed: bool,\\n\\n) -> Result<()> {\\n\\n let instruction: Instruction = instruction.into();\\n\\n for submitting_peer in 0..PEER_COUNT {\\n\\n let (_rt, network, _) =\\n\\n <Network>::start_test_with_runtime(PEER_COUNT.try_into().unwrap(), 1);\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time * 4);\\n\\n\\n\\n let committed_event_received = Arc::new(RwLock::new([false; PEER_COUNT]));\\n\\n let validating_event_received = Arc::new(RwLock::new([false; PEER_COUNT]));\\n\\n let rejected_event_received = Arc::new(RwLock::new([false; PEER_COUNT]));\\n\\n let peers: Vec<_> = network.peers().collect();\\n\\n let mut submitter_client = Client::test(\\n\\n &peers[submitting_peer].api_address,\\n\\n &peers[submitting_peer].status_address,\\n\",\n \"file_path\": \"client/tests/tests/events.rs\",\n \"rank\": 41,\n \"score\": 132765.28735931643\n },\n {\n \"content\": \"#[test]\\n\\nfn test_encryption() {\\n\\n use iroha_crypto::ursa::encryption::symm::prelude::*;\\n\\n\\n\\n const TEST_KEY: [u8; 32] = [\\n\\n 5, 87, 82, 183, 220, 57, 107, 49, 227, 4, 96, 231, 198, 88, 153, 11, 22, 65, 56, 45, 237,\\n\\n 35, 231, 165, 122, 153, 14, 68, 13, 84, 5, 24,\\n\\n ];\\n\\n\\n\\n let encryptor = SymmetricEncryptor::<ChaCha20Poly1305>::new_with_key(&TEST_KEY).unwrap();\\n\\n let message = b\\\"Some ciphertext\\\";\\n\\n let aad = b\\\"Iroha2 AAD\\\";\\n\\n let res = encryptor.encrypt_easy(aad.as_ref(), message.as_ref());\\n\\n assert!(res.is_ok());\\n\\n\\n\\n let ciphertext = res.unwrap();\\n\\n let res = encryptor.decrypt_easy(aad.as_ref(), ciphertext.as_slice());\\n\\n assert!(res.is_ok());\\n\\n assert_eq!(res.unwrap().as_slice(), message);\\n\\n}\\n\",\n \"file_path\": \"p2p/tests/p2p.rs\",\n \"rank\": 42,\n \"score\": 132111.2344604144\n },\n {\n \"content\": \"#[test]\\n\\nfn test_docs() {\\n\\n assert_eq!(\\n\\n Configuration::get_doc_recursive([\\\"inner\\\", \\\"b\\\"]).unwrap(),\\n\\n Some(\\\" Docs from b\\\\n\\\\nHas type `i32`. Can be configured via environment variable `CONF_INNER_B`\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Configuration::get_doc_recursive([\\\"inner\\\", \\\"a\\\"]).unwrap(),\\n\\n Some(\\\"Has type `String`. Can be configured via environment variable `CONF_INNER_A`\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Configuration::get_doc_recursive([\\\"inner\\\"]).unwrap(),\\n\\n Some(\\\" Inner structure\\\\n\\\\nHas type `InnerConfiguration`. Can be configured via environment variable `CONF_INNER`\\\")\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"config/tests/simple.rs\",\n \"rank\": 43,\n \"score\": 132111.2344604144\n },\n {\n \"content\": \"#[derive(iroha_actor::Message)]\\n\\n#[message(result = \\\"i32\\\")]\\n\\nstruct M;\\n\",\n \"file_path\": \"actor/tests/ok/simple_result.rs\",\n \"rank\": 44,\n \"score\": 130925.9411868666\n },\n {\n \"content\": \"fn measure_block_size(_criterion: &mut Criterion) {\\n\\n Runtime::new().unwrap().block_on(measure_block_size_async());\\n\\n}\\n\\n\\n\\ncriterion_group!(kura, measure_block_size);\\n\\ncriterion_main!(kura);\\n\",\n \"file_path\": \"core/benches/kura.rs\",\n \"rank\": 45,\n \"score\": 130669.59861983167\n },\n {\n \"content\": \"/// Installs the panic hook with [`color_eyre::install`] if it isn't installed yet\\n\\n///\\n\\n/// # Errors\\n\\n/// Fails if [`color_eyre::install`] fails\\n\\npub fn install_panic_hook() -> Result<(), Report> {\\n\\n static INSTALLED: AtomicBool = AtomicBool::new(false);\\n\\n if INSTALLED\\n\\n .compare_exchange(false, true, Ordering::SeqCst, Ordering::SeqCst)\\n\\n .is_ok()\\n\\n {\\n\\n color_eyre::install()\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"logger/src/lib.rs\",\n \"rank\": 46,\n \"score\": 130355.70508962426\n },\n {\n \"content\": \"#[test]\\n\\nfn get_config() {\\n\\n // The underscored variables must not be dropped until end of closure.\\n\\n let (_dont_drop, _dont_drop_either, cl) = <TestPeer>::start_test_with_runtime();\\n\\n\\n\\n let field = cl.get_config_docs(&[\\\"torii\\\"]).unwrap().unwrap();\\n\\n assert!(field.contains(\\\"IROHA_TORII\\\"));\\n\\n\\n\\n let cfg: Configuration = serde_json::from_value(cl.get_config_value().unwrap()).unwrap();\\n\\n let test = Configuration::test();\\n\\n assert_eq!(cfg.block_sync, test.block_sync);\\n\\n assert_eq!(cfg.network, test.network);\\n\\n assert_eq!(cfg.telemetry, test.telemetry);\\n\\n}\\n\",\n \"file_path\": \"client/tests/tests/config.rs\",\n \"rank\": 47,\n \"score\": 129585.10592466705\n },\n {\n \"content\": \"fn attrs_have_ident(attrs: &[syn::Attribute], ident: &str) -> bool {\\n\\n attrs.iter().any(|attr| attr.path.is_ident(ident))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"macro/derive/src/lib.rs\",\n \"rank\": 48,\n \"score\": 127433.03561809428\n },\n {\n \"content\": \"fn check_assets(\\n\\n iroha_client: &mut client::Client,\\n\\n account_id: &AccountId,\\n\\n asset_definition_id: &AssetDefinitionId,\\n\\n quantity: u32,\\n\\n) {\\n\\n iroha_client.poll_request_with_period(\\n\\n client::asset::by_account_id(account_id.clone()),\\n\\n Configuration::block_sync_gossip_time(),\\n\\n 15,\\n\\n |result| {\\n\\n result.iter().any(|asset| {\\n\\n asset.id.definition_id == *asset_definition_id\\n\\n && asset.value == AssetValue::Quantity(quantity)\\n\\n })\\n\\n },\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/unregister_peer.rs\",\n \"rank\": 49,\n \"score\": 127183.15171232654\n },\n {\n \"content\": \"fn unstable_network(\\n\\n n_peers: u32,\\n\\n n_offline_peers: u32,\\n\\n n_transactions: usize,\\n\\n polling_max_attempts: u32,\\n\\n polling_period: Duration,\\n\\n) {\\n\\n drop(iroha_logger::install_panic_hook());\\n\\n let rt = Runtime::test();\\n\\n // Given\\n\\n let (_network, mut iroha_client) =\\n\\n rt.block_on(<Network>::start_test_with_offline_and_set_n_shifts(\\n\\n n_peers,\\n\\n MAXIMUM_TRANSACTIONS_IN_BLOCK,\\n\\n n_offline_peers,\\n\\n u64::from(n_peers),\\n\\n ));\\n\\n\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n thread::sleep(pipeline_time * n_peers);\\n\",\n \"file_path\": \"client/tests/tests/unstable_network.rs\",\n \"rank\": 50,\n \"score\": 127183.15171232654\n },\n {\n \"content\": \"fn setup_logger(configuration: &Configuration) -> Result<Telemetries> {\\n\\n if configuration.compact_mode {\\n\\n let layer = tracing_subscriber::fmt::layer()\\n\\n .with_test_writer()\\n\\n .compact();\\n\\n Ok(add_bunyan(configuration, layer)?)\\n\\n } else {\\n\\n let layer = tracing_subscriber::fmt::layer().with_test_writer();\\n\\n Ok(add_bunyan(configuration, layer)?)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"logger/src/lib.rs\",\n \"rank\": 51,\n \"score\": 126596.36209252235\n },\n {\n \"content\": \"#[test]\\n\\nfn account_can_query_only_its_own_domain() {\\n\\n let rt = Runtime::test();\\n\\n let (_not_drop, mut iroha_client) = rt.block_on(<TestPeer>::start_test_with_permissions(\\n\\n AllowAll.into(),\\n\\n private_blockchain::query::OnlyAccountsDomain.into(),\\n\\n ));\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time * 2);\\n\\n\\n\\n let domain_name = \\\"wonderland\\\";\\n\\n let new_domain_name = \\\"wonderland2\\\";\\n\\n let register_domain = RegisterBox::new(IdentifiableBox::from(Domain::new(new_domain_name)));\\n\\n\\n\\n iroha_client\\n\\n .submit(register_domain)\\n\\n .expect(\\\"Failed to prepare state.\\\");\\n\\n\\n\\n thread::sleep(pipeline_time * 2);\\n\",\n \"file_path\": \"client/tests/tests/permissions.rs\",\n \"rank\": 52,\n \"score\": 124912.13351590207\n },\n {\n \"content\": \"#[test]\\n\\nfn permissions_disallow_asset_burn() {\\n\\n let rt = Runtime::test();\\n\\n let (_not_drop, mut iroha_client) = rt.block_on(<TestPeer>::start_test_with_permissions(\\n\\n public_blockchain::default_permissions(),\\n\\n AllowAll.into(),\\n\\n ));\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time * 5);\\n\\n\\n\\n let domain_name = \\\"wonderland\\\";\\n\\n let alice_id = AccountId::new(\\\"alice\\\", domain_name);\\n\\n let bob_id = AccountId::new(\\\"bob\\\", domain_name);\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", domain_name);\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\\n\\n asset_definition_id.clone(),\\n\\n )));\\n\\n let register_bob = RegisterBox::new(IdentifiableBox::from(NewAccount::new(bob_id.clone())));\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/permissions.rs\",\n \"rank\": 53,\n \"score\": 124912.13351590207\n },\n {\n \"content\": \"#[test]\\n\\nfn permissions_disallow_asset_transfer() {\\n\\n let rt = Runtime::test();\\n\\n let (_peer, mut iroha_client) = rt.block_on(<TestPeer>::start_test_with_permissions(\\n\\n public_blockchain::default_permissions(),\\n\\n AllowAll.into(),\\n\\n ));\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n let alice_id = AccountId::new(\\\"alice\\\", \\\"wonderland\\\");\\n\\n let bob_id = AccountId::new(\\\"bob\\\", \\\"wonderland\\\");\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"wonderland\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\\n\\n asset_definition_id.clone(),\\n\\n )));\\n\\n let register_bob = RegisterBox::new(IdentifiableBox::from(NewAccount::new(bob_id.clone())));\\n\\n\\n\\n let alice_start_assets = get_assets(&mut iroha_client, &alice_id);\\n\\n iroha_client\\n\\n .submit_all(vec![create_asset.into(), register_bob.into()])\\n\",\n \"file_path\": \"client/tests/tests/permissions.rs\",\n \"rank\": 54,\n \"score\": 124912.13351590207\n },\n {\n \"content\": \"#[test]\\n\\nfn trybuild() {\\n\\n let test_cases = TestCases::new();\\n\\n test_cases.pass(\\\"tests/ok/*.rs\\\");\\n\\n test_cases.compile_fail(\\\"tests/fail/*.rs\\\");\\n\\n}\\n\",\n \"file_path\": \"actor/tests/trybuild.rs\",\n \"rank\": 55,\n \"score\": 123825.04070018294\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore = \\\"This test fails after reducing the amount of gossipping\\\"]\\n\\nfn unstable_network_7_peers_1_fault() {\\n\\n let n_peers = 7;\\n\\n let n_transactions = 20;\\n\\n let polling_max_attempts = n_peers * n_transactions;\\n\\n unstable_network(\\n\\n n_peers,\\n\\n 1,\\n\\n n_transactions as usize,\\n\\n polling_max_attempts,\\n\\n Configuration::pipeline_time(),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/unstable_network.rs\",\n \"rank\": 56,\n \"score\": 122746.59506685931\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore = \\\"This test does not guarantee to have positive outcome given a fixed time.\\\"]\\n\\nfn unstable_network_7_peers_2_faults() {\\n\\n unstable_network(7, 2, 5, 100, Configuration::pipeline_time());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/unstable_network.rs\",\n \"rank\": 57,\n \"score\": 122746.53563082984\n },\n {\n \"content\": \"#[test]\\n\\nfn unstable_network_4_peers_1_fault() {\\n\\n let n_peers = 4;\\n\\n let n_transactions = 20;\\n\\n // Given that the topology will resolve view changes by shift for `n_peers` consequent times\\n\\n // and having only 1 faulty peer guarantees us that at maximum in `n_peers` tries the block will be committed.\\n\\n // So for the worst case scenario for `n_transactions` given 1 transaction per block\\n\\n // the network will commit all of them in `n_peers * n_transactions` tries.\\n\\n let polling_max_attempts = n_peers * n_transactions;\\n\\n unstable_network(\\n\\n n_peers,\\n\\n 1,\\n\\n n_transactions as usize,\\n\\n polling_max_attempts,\\n\\n Configuration::pipeline_time(),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"client/tests/tests/unstable_network.rs\",\n \"rank\": 58,\n \"score\": 122746.01992200753\n },\n {\n \"content\": \"#[allow(clippy::too_many_lines)]\\n\\n#[test]\\n\\nfn multisignature_transactions_should_wait_for_all_signatures() {\\n\\n let (_rt, network, _) = <Network>::start_test_with_runtime(4, 1);\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n thread::sleep(pipeline_time * 3);\\n\\n\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\\\"domain\\\").into()));\\n\\n let account_id = AccountId::new(\\\"account\\\", \\\"domain\\\");\\n\\n let key_pair_1 = KeyPair::generate().expect(\\\"Failed to generate KeyPair.\\\");\\n\\n let key_pair_2 = KeyPair::generate().expect(\\\"Failed to generate KeyPair.\\\");\\n\\n let create_account = RegisterBox::new(IdentifiableBox::from(NewAccount::with_signatory(\\n\\n account_id.clone(),\\n\\n key_pair_1.public_key.clone(),\\n\\n )));\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"domain\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::from(AssetDefinition::new_quantity(\\n\\n asset_definition_id.clone(),\\n\\n )));\\n\\n let set_signature_condition = MintBox::new(\\n\\n SignatureCheckCondition(\\n\",\n \"file_path\": \"client/tests/tests/multisignature_transaction.rs\",\n \"rank\": 59,\n \"score\": 122745.82891951363\n },\n {\n \"content\": \"#[test]\\n\\nfn trybuild() {\\n\\n TestCases::new().compile_fail(\\\"tests/fail_to_compile/*.rs\\\");\\n\\n}\\n\",\n \"file_path\": \"data_model/tests/trybuild.rs\",\n \"rank\": 60,\n \"score\": 120825.7666127264\n },\n {\n \"content\": \"fn setup_logger() {\\n\\n INIT.call_once(|| {\\n\\n let log_config = Configuration {\\n\\n max_log_level: Level::TRACE.into(),\\n\\n compact_mode: false,\\n\\n ..Configuration::default()\\n\\n };\\n\\n iroha_logger::init(&log_config).expect(\\\"Failed to start logger\\\");\\n\\n })\\n\\n}\\n\\n\\n\\n/// This test creates a network and one peer.\\n\\n/// This peer connects back to our network, emulating some distant peer.\\n\\n/// There is no need to create separate networks to check that messages\\n\\n/// are properly sent and received using encryption and serialization/deserialization.\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 4)]\\n\\nasync fn network_create() {\\n\\n let delay = Duration::from_millis(200);\\n\\n setup_logger();\\n\\n info!(\\\"Starting network tests...\\\");\\n\",\n \"file_path\": \"p2p/tests/p2p.rs\",\n \"rank\": 61,\n \"score\": 120820.12274758013\n },\n {\n \"content\": \"#[test]\\n\\nfn genesis_block_is_commited_with_some_offline_peers() {\\n\\n // Given\\n\\n let rt = Runtime::test();\\n\\n let (_network, mut iroha_client) = rt.block_on(<Network>::start_test_with_offline(4, 1, 1));\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n thread::sleep(pipeline_time * 8);\\n\\n\\n\\n //When\\n\\n let alice_id = AccountId::new(\\\"alice\\\", \\\"wonderland\\\");\\n\\n let alice_has_roses = 13;\\n\\n\\n\\n //Then\\n\\n let assets = iroha_client\\n\\n .request(client::asset::by_account_id(alice_id))\\n\\n .expect(\\\"Failed to execute request.\\\");\\n\\n let asset = assets\\n\\n .iter()\\n\\n .find(|asset| asset.id.definition_id == AssetDefinitionId::new(\\\"rose\\\", \\\"wonderland\\\"))\\n\\n .unwrap();\\n\\n assert_eq!(AssetValue::Quantity(alice_has_roses), asset.value);\\n\\n}\\n\",\n \"file_path\": \"client/tests/tests/offline_peers.rs\",\n \"rank\": 62,\n \"score\": 120682.2844801351\n },\n {\n \"content\": \"#[ignore = \\\"Takes a lot of time.\\\"]\\n\\n#[test]\\n\\nfn long_multiple_blocks_created() {\\n\\n // Given\\n\\n let (_rt, network, mut iroha_client) = <Network>::start_test_with_runtime(4, 1);\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n thread::sleep(pipeline_time * 2);\\n\\n\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\\\"domain\\\").into()));\\n\\n let account_id = AccountId::new(\\\"account\\\", \\\"domain\\\");\\n\\n let create_account = RegisterBox::new(IdentifiableBox::NewAccount(\\n\\n NewAccount::with_signatory(\\n\\n account_id.clone(),\\n\\n KeyPair::generate()\\n\\n .expect(\\\"Failed to generate KeyPair.\\\")\\n\\n .public_key,\\n\\n )\\n\\n .into(),\\n\\n ));\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"domain\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\",\n \"file_path\": \"client/tests/tests/multiple_blocks_created.rs\",\n \"rank\": 63,\n \"score\": 120682.0934776412\n },\n {\n \"content\": \"#[test]\\n\\nfn client_can_transfer_asset_to_another_account() {\\n\\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time);\\n\\n\\n\\n let create_domain = RegisterBox::new(IdentifiableBox::Domain(Domain::new(\\\"domain\\\").into()));\\n\\n let account1_id = AccountId::new(\\\"account1\\\", \\\"domain\\\");\\n\\n let account2_id = AccountId::new(\\\"account2\\\", \\\"domain\\\");\\n\\n let create_account1 = RegisterBox::new(IdentifiableBox::NewAccount(\\n\\n NewAccount::with_signatory(\\n\\n account1_id.clone(),\\n\\n KeyPair::generate()\\n\\n .expect(\\\"Failed to generate KeyPair.\\\")\\n\\n .public_key,\\n\\n )\\n\\n .into(),\\n\\n ));\\n\\n let create_account2 = RegisterBox::new(IdentifiableBox::NewAccount(\\n\",\n \"file_path\": \"client/tests/tests/transfer_asset.rs\",\n \"rank\": 64,\n \"score\": 118713.56777760673\n },\n {\n \"content\": \"/// Initializes `Logger` with given [`LoggerConfiguration`](`config::LoggerConfiguration`).\\n\\n/// After the initialization `log` macros will print with the use of this `Logger`.\\n\\n/// Returns the receiving side of telemetry channels (regular telemetry, future telemetry)\\n\\n///\\n\\n/// # Errors\\n\\n/// If the logger is already set, raises a generic error.\\n\\npub fn init(configuration: &Configuration) -> Result<Option<Telemetries>> {\\n\\n if LOGGER_SET\\n\\n .compare_exchange(false, true, Ordering::AcqRel, Ordering::Relaxed)\\n\\n .is_err()\\n\\n {\\n\\n return Ok(None);\\n\\n }\\n\\n Ok(Some(setup_logger(configuration)?))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"logger/src/lib.rs\",\n \"rank\": 65,\n \"score\": 118311.89979278552\n },\n {\n \"content\": \"#[test]\\n\\nfn discriminant() {\\n\\n use std::collections::BTreeMap;\\n\\n\\n\\n let expected_meta = vec![(\\n\\n \\\"enum_with_various_discriminants::Foo\\\".to_owned(),\\n\\n Metadata::Enum(EnumMeta {\\n\\n variants: vec![\\n\\n EnumVariant {\\n\\n name: \\\"A\\\".to_owned(),\\n\\n discriminant: 1,\\n\\n ty: None,\\n\\n },\\n\\n EnumVariant {\\n\\n name: \\\"B\\\".to_owned(),\\n\\n discriminant: 77,\\n\\n ty: None,\\n\\n },\\n\\n EnumVariant {\\n\\n name: \\\"C\\\".to_owned(),\\n\\n discriminant: 2,\\n\",\n \"file_path\": \"schema/tests/enum_with_various_discriminants.rs\",\n \"rank\": 66,\n \"score\": 118015.19832864866\n },\n {\n \"content\": \"#[test]\\n\\nfn reload_log_level() {\\n\\n let (_dont_drop, _dont_drop_either, cl) = <TestPeer>::start_test_with_runtime();\\n\\n\\n\\n let verify = |level| {\\n\\n let field: bool = cl\\n\\n .set_config(iroha_core::torii::PostConfiguration::LogLevel(level))\\n\\n .unwrap();\\n\\n assert!(field);\\n\\n };\\n\\n verify(ERROR);\\n\\n verify(TRACE);\\n\\n verify(WARN);\\n\\n verify(DEBUG);\\n\\n}\\n\",\n \"file_path\": \"client/tests/reload.rs\",\n \"rank\": 67,\n \"score\": 118015.19832864866\n },\n {\n \"content\": \"#[test]\\n\\nfn compact() {\\n\\n use std::collections::BTreeMap;\\n\\n\\n\\n use IntMode::*;\\n\\n use Metadata::*;\\n\\n\\n\\n let expected = vec![\\n\\n (\\n\\n \\\"iroha_schema::Compact<u128>\\\".to_owned(),\\n\\n Int(IntMode::Compact),\\n\\n ),\\n\\n (\\n\\n \\\"iroha_schema::Compact<u16>\\\".to_owned(),\\n\\n Int(IntMode::Compact),\\n\\n ),\\n\\n (\\n\\n \\\"iroha_schema::Compact<u32>\\\".to_owned(),\\n\\n Int(IntMode::Compact),\\n\\n ),\\n\\n (\\n\",\n \"file_path\": \"schema/tests/numbers_compact_and_fixed.rs\",\n \"rank\": 68,\n \"score\": 118015.19832864866\n },\n {\n \"content\": \"#[test]\\n\\nfn unnamed() {\\n\\n use Metadata::*;\\n\\n\\n\\n let expected = vec![\\n\\n (\\\"String\\\".to_owned(), String),\\n\\n (\\\"Vec<String>\\\".to_owned(), Vec(\\\"String\\\".to_owned())),\\n\\n (\\n\\n \\\"struct_with_unnamed_fields::Command\\\".to_owned(),\\n\\n TupleStruct(UnnamedFieldsMeta {\\n\\n types: vec![\\\"String\\\".to_owned(), \\\"Vec<String>\\\".to_owned()],\\n\\n }),\\n\\n ),\\n\\n ]\\n\\n .into_iter()\\n\\n .collect::<BTreeMap<_, _>>();\\n\\n assert_eq!(Command::get_schema(), expected);\\n\\n}\\n\",\n \"file_path\": \"schema/tests/struct_with_unnamed_fields.rs\",\n \"rank\": 69,\n \"score\": 118015.19832864866\n },\n {\n \"content\": \"fn main() {}\\n\",\n \"file_path\": \"macro/derive/tests/from_variant/05-struct.rs\",\n \"rank\": 70,\n \"score\": 118009.5544635024\n },\n {\n \"content\": \"fn main() {\\n\\n\\tFixed::from(-1_f64);\\n\\n}\\n\",\n \"file_path\": \"data_model/tests/fail/no_conversion.rs\",\n \"rank\": 71,\n \"score\": 118009.5544635024\n },\n {\n \"content\": \"fn impl_decode_versioned(enum_name: &Ident) -> proc_macro2::TokenStream {\\n\\n quote! (\\n\\n impl iroha_version::scale::DecodeVersioned for #enum_name {\\n\\n fn decode_versioned(input: &[u8]) -> iroha_version::error::Result<Self> {\\n\\n use iroha_version::{error::Error, Version, UnsupportedVersion, RawVersioned};\\n\\n use parity_scale_codec::Decode;\\n\\n\\n\\n if let Some(version) = input.first() {\\n\\n if Self::supported_versions().contains(version) {\\n\\n let mut input = input.clone();\\n\\n Ok(Self::decode(&mut input)?)\\n\\n } else {\\n\\n Err(Error::UnsupportedVersion(UnsupportedVersion::new(*version, RawVersioned::ScaleBytes(input.to_vec()))))\\n\\n }\\n\\n } else {\\n\\n Err(Error::NotVersioned)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"version/derive/src/lib.rs\",\n \"rank\": 72,\n \"score\": 116951.05888247376\n },\n {\n \"content\": \"#[test]\\n\\nfn client_sends_transaction_with_invalid_instruction_should_not_see_any_changes() {\\n\\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time);\\n\\n\\n\\n //When\\n\\n let account_id = AccountId::new(\\\"alice\\\", \\\"wonderland\\\");\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"wonderland\\\");\\n\\n let wrong_asset_definition_id = AssetDefinitionId::new(\\\"ksor\\\", \\\"wonderland\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id).into(),\\n\\n ));\\n\\n let quantity: u32 = 200;\\n\\n let mint_asset = MintBox::new(\\n\\n Value::U32(quantity),\\n\\n IdBox::AssetId(AssetId::new(\\n\\n wrong_asset_definition_id.clone(),\\n\\n account_id.clone(),\\n\",\n \"file_path\": \"client/tests/tests/tx_rollback.rs\",\n \"rank\": 73,\n \"score\": 116833.22073132833\n },\n {\n \"content\": \"#[test]\\n\\nfn client_has_rejected_and_acepted_txs_should_return_tx_history() {\\n\\n let (_rt, _peer, mut iroha_client) = <TestPeer>::start_test_with_runtime();\\n\\n let pipeline_time = Configuration::pipeline_time();\\n\\n\\n\\n // Given\\n\\n thread::sleep(pipeline_time);\\n\\n\\n\\n let account_id = AccountId::new(\\\"alice\\\", \\\"wonderland\\\");\\n\\n let asset_definition_id = AssetDefinitionId::new(\\\"xor\\\", \\\"wonderland\\\");\\n\\n let create_asset = RegisterBox::new(IdentifiableBox::AssetDefinition(\\n\\n AssetDefinition::new_quantity(asset_definition_id.clone()).into(),\\n\\n ));\\n\\n iroha_client\\n\\n .submit(create_asset)\\n\\n .expect(\\\"Failed to prepare state.\\\");\\n\\n\\n\\n thread::sleep(pipeline_time * 2);\\n\\n\\n\\n //When\\n\\n let quantity: u32 = 200;\\n\",\n \"file_path\": \"client/tests/tests/tx_history.rs\",\n \"rank\": 74,\n \"score\": 116833.22073132833\n },\n {\n \"content\": \"/// Body of method `type_name`\\n\\nfn type_name_body(name: &Ident, generics: &Generics) -> TokenStream2 {\\n\\n let generics = &generics\\n\\n .params\\n\\n .iter()\\n\\n .filter_map(|param| match param {\\n\\n GenericParam::Type(ty) => Some(&ty.ident),\\n\\n _ => None,\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n let name = LitStr::new(&name.to_string(), Span::call_site());\\n\\n\\n\\n if generics.is_empty() {\\n\\n return quote! { format!(\\\"{}::{}\\\", module_path!(), #name) };\\n\\n }\\n\\n\\n\\n let mut format_str = \\\"{}::{}<\\\".to_owned();\\n\\n format_str.push_str(\\n\\n &generics\\n\\n .iter()\\n\\n .map(|_| \\\"{}\\\".to_owned())\\n\",\n \"file_path\": \"schema/derive/src/lib.rs\",\n \"rank\": 75,\n \"score\": 115494.84636766027\n },\n {\n \"content\": \"#[test]\\n\\nfn check_generic() {\\n\\n use std::collections::BTreeMap;\\n\\n\\n\\n use iroha_schema::prelude::*;\\n\\n use Metadata::*;\\n\\n\\n\\n let expected_struct = Struct(NamedFieldsMeta {\\n\\n declarations: vec![Declaration {\\n\\n name: \\\"_value\\\".to_owned(),\\n\\n ty: \\\"Option<bool>\\\".to_owned(),\\n\\n }],\\n\\n });\\n\\n let expected = vec![\\n\\n (\\\"bool\\\".to_owned(), Bool),\\n\\n (\\\"Option<bool>\\\".to_owned(), Option(\\\"bool\\\".to_owned())),\\n\\n (\\n\\n \\\"struct_with_generic_bounds::Foo<bool>\\\".to_owned(),\\n\\n expected_struct,\\n\\n ),\\n\\n ]\\n\\n .into_iter()\\n\\n .collect::<BTreeMap<_, _>>();\\n\\n assert_eq!(Foo::<bool>::get_schema(), expected);\\n\\n}\\n\",\n \"file_path\": \"schema/tests/struct_with_generic_bounds.rs\",\n \"rank\": 76,\n \"score\": 115376.06976495695\n },\n {\n \"content\": \"#[test]\\n\\nfn default_discriminants() {\\n\\n use std::collections::BTreeMap;\\n\\n\\n\\n use IntMode::*;\\n\\n use Metadata::*;\\n\\n\\n\\n let expected = vec![\\n\\n (\\n\\n \\\"Result<bool, String>\\\".to_owned(),\\n\\n Result(ResultMeta {\\n\\n ok: \\\"bool\\\".to_owned(),\\n\\n err: \\\"String\\\".to_owned(),\\n\\n }),\\n\\n ),\\n\\n (\\\"String\\\".to_owned(), String),\\n\\n (\\\"bool\\\".to_owned(), Bool),\\n\\n (\\n\\n \\\"enum_with_default_discriminants::Foo\\\".to_owned(),\\n\\n Enum(EnumMeta {\\n\\n variants: vec![\\n\",\n \"file_path\": \"schema/tests/enum_with_default_discriminants.rs\",\n \"rank\": 77,\n \"score\": 115376.06976495695\n },\n {\n \"content\": \"#[test]\\n\\nfn named_fields() {\\n\\n use IntMode::*;\\n\\n use Metadata::*;\\n\\n\\n\\n let expected_struct = Struct(NamedFieldsMeta {\\n\\n declarations: vec![\\n\\n Declaration {\\n\\n name: \\\"executable\\\".to_owned(),\\n\\n ty: \\\"String\\\".to_owned(),\\n\\n },\\n\\n Declaration {\\n\\n name: \\\"args\\\".to_owned(),\\n\\n ty: \\\"Vec<String>\\\".to_owned(),\\n\\n },\\n\\n Declaration {\\n\\n name: \\\"num\\\".to_owned(),\\n\\n ty: \\\"i32\\\".to_owned(),\\n\\n },\\n\\n ],\\n\\n });\\n\",\n \"file_path\": \"schema/tests/struct_with_named_fields.rs\",\n \"rank\": 78,\n \"score\": 115376.06976495695\n },\n {\n \"content\": \"fn main() {}\\n\",\n \"file_path\": \"macro/derive/tests/from_variant/03-container-enums.rs\",\n \"rank\": 79,\n \"score\": 115370.42589981068\n },\n {\n \"content\": \"fn main() {}\\n\",\n \"file_path\": \"macro/derive/tests/from_variant/01-big-enum.rs\",\n \"rank\": 80,\n \"score\": 115370.42589981068\n },\n {\n \"content\": \"/// Finds specific attribute with codec ident satisfying predicate\\n\\nfn find_meta_item<'a, F, R, I, M>(mut itr: I, mut pred: F) -> Option<R>\\n\\nwhere\\n\\n F: FnMut(M) -> Option<R> + Clone,\\n\\n I: Iterator<Item = &'a Attribute>,\\n\\n M: Parse,\\n\\n{\\n\\n itr.find_map(|attr| {\\n\\n attr.path\\n\\n .is_ident(\\\"codec\\\")\\n\\n .then(|| pred(attr.parse_args().ok()?))\\n\\n .flatten()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"schema/derive/src/lib.rs\",\n \"rank\": 81,\n \"score\": 115029.62602099439\n },\n {\n \"content\": \"fn gen_address() -> String {\\n\\n format!(\\\"127.0.0.1:{}\\\", unique_port::get_unique_free_port().unwrap())\\n\\n}\\n\\n\\n\\nstatic INIT: Once = Once::new();\\n\\n\\n\",\n \"file_path\": \"p2p/tests/p2p.rs\",\n \"rank\": 82,\n \"score\": 114982.12321439333\n },\n {\n \"content\": \"fn main() {\\n\\n\\tlet qty = Fixed::negative_one();\\n\\n}\\n\",\n \"file_path\": \"data_model/tests/fail/neg_one_private.rs\",\n \"rank\": 83,\n \"score\": 112887.51503286888\n },\n {\n \"content\": \"fn main() {\\n\\n\\tlet quantity = Fixed(iroha_data_model::fixed::FixNum::try_from(-123.45_f64).unwrap());\\n\\n}\\n\",\n \"file_path\": \"data_model/tests/fail/fix_num_private.rs\",\n \"rank\": 84,\n \"score\": 112887.51503286888\n },\n {\n \"content\": \"fn register_domain() -> Instruction {\\n\\n Instruction::Register(RegisterBox::new(Domain::new(DOMAIN)))\\n\\n}\\n\",\n \"file_path\": \"core/src/torii/tests.rs\",\n \"rank\": 85,\n \"score\": 112342.99465070161\n },\n {\n \"content\": \"fn query() -> QueryBox {\\n\\n QueryBox::FindAccountById(FindAccountById::new(AccountId::new(\\\"alice\\\", DOMAIN)))\\n\\n}\\n\\n#[tokio::test]\\n\\nasync fn query_with_wrong_signatory() {\\n\\n AssertSet::new()\\n\\n .given(register_domain())\\n\\n .given(register_account(\\\"alice\\\"))\\n\\n .account(AccountId::new(\\\"alice\\\", DOMAIN))\\n\\n // .deny_all()\\n\\n .query(query())\\n\\n .status(StatusCode::UNAUTHORIZED)\\n\\n .assert()\\n\\n .await\\n\\n}\\n\\n#[tokio::test]\\n\\nasync fn query_with_wrong_signature() {\\n\\n AssertSet::new()\\n\\n .given(register_domain())\\n\\n .given(register_account(\\\"alice\\\"))\\n\",\n \"file_path\": \"core/src/torii/tests.rs\",\n \"rank\": 86,\n \"score\": 112342.99465070161\n },\n {\n \"content\": \"fn add_bunyan<L>(configuration: &Configuration, layer: L) -> Result<Telemetries>\\n\\nwhere\\n\\n L: tracing_subscriber::Layer<Registry> + Debug + Send + Sync + 'static,\\n\\n{\\n\\n let level: tracing::Level = configuration.max_log_level.value().into();\\n\\n let level_filter = tracing_subscriber::filter::LevelFilter::from_level(level);\\n\\n let (filter, handle) = reload::Layer::new(level_filter);\\n\\n configuration.max_log_level.set_handle(handle)?;\\n\\n let (bunyan_layer, storage_layer) = match configuration.log_file_path.clone() {\\n\\n Some(path) => (\\n\\n Some(BunyanFormattingLayer::new(\\n\\n \\\"bunyan_layer\\\".into(),\\n\\n bunyan_writer_create(path)?,\\n\\n )),\\n\\n Some(JsonStorageLayer),\\n\\n ),\\n\\n None => (None, None),\\n\\n };\\n\\n let subscriber = Registry::default()\\n\\n .with(layer)\\n\\n .with(filter)\\n\\n .with(storage_layer)\\n\\n .with(bunyan_layer);\\n\\n add_telemetry_and_set_default(configuration, subscriber)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"logger/src/lib.rs\",\n \"rank\": 87,\n \"score\": 111719.06467939688\n },\n {\n \"content\": \"fn get_derives(derive: &Lit) -> syn::Result<Punctuated<Path, Token![,]>> {\\n\\n let lit = if let Lit::Str(lit) = derive {\\n\\n lit\\n\\n } else {\\n\\n return Ok(Punctuated::new());\\n\\n };\\n\\n let parser = |stream: ParseStream<'_>| -> syn::parse::Result<Punctuated<Path, Token![,]>> {\\n\\n Punctuated::parse_terminated(stream)\\n\\n };\\n\\n parser.parse_str(&lit.value())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"version/derive/src/lib.rs\",\n \"rank\": 88,\n \"score\": 109820.56089617785\n },\n {\n \"content\": \"/// Returns the a map of a form `domain_name -> domain`, for initial domains.\\n\\npub fn domains(configuration: &Configuration) -> Result<BTreeMap<String, Domain>> {\\n\\n let key = configuration\\n\\n .genesis\\n\\n .account_public_key\\n\\n .clone()\\n\\n .ok_or_else(|| eyre!(\\\"Genesis account public key is not specified.\\\"))?;\\n\\n Ok(std::iter::once((\\n\\n GENESIS_DOMAIN_NAME.to_owned(),\\n\\n Domain::from(GenesisDomain::new(key)),\\n\\n ))\\n\\n .collect())\\n\\n}\\n\",\n \"file_path\": \"core/src/init.rs\",\n \"rank\": 89,\n \"score\": 109820.56089617785\n },\n {\n \"content\": \"#[test]\\n\\nfn install_panic_hook_multiple_times_works() {\\n\\n iroha_logger::install_panic_hook().unwrap();\\n\\n iroha_logger::install_panic_hook().unwrap();\\n\\n}\\n\",\n \"file_path\": \"logger/tests/setting_logger.rs\",\n \"rank\": 90,\n \"score\": 108343.60897527495\n },\n {\n \"content\": \"fn bunyan_writer_create(destination: PathBuf) -> Result<Arc<std::fs::File>> {\\n\\n OpenOptions::new()\\n\\n .create(true)\\n\\n .append(true)\\n\\n .open(destination)\\n\\n .wrap_err(\\\"Failed to create or open bunyan logs file\\\")\\n\\n .map(Arc::new)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"logger/src/lib.rs\",\n \"rank\": 91,\n \"score\": 108017.48849177184\n },\n {\n \"content\": \"#[test]\\n\\nfn find_rate_and_make_exchange_isi_should_succeed() {\\n\\n let kp = KeyPair {\\n\\n public_key: PublicKey::from_str(\\n\\n r#\\\"ed01207233bfc89dcbd68c19fde6ce6158225298ec1131b6a130d1aeb454c1ab5183c0\\\"#,\\n\\n )\\n\\n .unwrap(),\\n\\n private_key: PrivateKey {\\n\\n digest_function: \\\"ed25519\\\".to_string(),\\n\\n payload: hex_literal::hex!(\\\"9AC47ABF 59B356E0 BD7DCBBB B4DEC080 E302156A 48CA907E 47CB6AEA 1D32719E 7233BFC8 9DCBD68C 19FDE6CE 61582252 98EC1131 B6A130D1 AEB454C1 AB5183C0\\\")\\n\\n\\t\\t\\t\\t.into(),\\n\\n },\\n\\n };\\n\\n let mut peer = <TestPeer>::new().expect(\\\"Failed to create peer\\\");\\n\\n let configuration = get_config(std::iter::once(peer.id.clone()).collect(), Some(kp.clone()));\\n\\n let pipeline_time = Duration::from_millis(configuration.sumeragi.pipeline_time_ms());\\n\\n\\n\\n // Given\\n\\n let genesis = GenesisNetwork::from_configuration(\\n\\n true,\\n\\n RawGenesisBlock::new(\\\"alice\\\", \\\"wonderland\\\", &kp.public_key),\\n\",\n \"file_path\": \"data_model/tests/data_model.rs\",\n \"rank\": 92,\n \"score\": 106254.33896785344\n },\n {\n \"content\": \"#[test]\\n\\nfn find_rate_and_make_exchange_isi_should_be_valid() {\\n\\n let _instruction = Pair::new(\\n\\n TransferBox::new(\\n\\n IdBox::AssetId(AssetId::from_names(\\\"btc\\\", \\\"crypto\\\", \\\"seller\\\", \\\"company\\\")),\\n\\n Expression::Query(\\n\\n FindAssetQuantityById::new(AssetId::from_names(\\n\\n \\\"btc2eth_rate\\\",\\n\\n \\\"exchange\\\",\\n\\n \\\"dex\\\",\\n\\n \\\"exchange\\\",\\n\\n ))\\n\\n .into(),\\n\\n ),\\n\\n IdBox::AssetId(AssetId::from_names(\\\"btc\\\", \\\"crypto\\\", \\\"buyer\\\", \\\"company\\\")),\\n\\n ),\\n\\n TransferBox::new(\\n\\n IdBox::AssetId(AssetId::from_names(\\\"btc\\\", \\\"crypto\\\", \\\"buyer\\\", \\\"company\\\")),\\n\\n Expression::Query(\\n\\n FindAssetQuantityById::new(AssetId::from_names(\\n\\n \\\"btc2eth_rate\\\",\\n\",\n \"file_path\": \"data_model/tests/data_model.rs\",\n \"rank\": 93,\n \"score\": 106254.33896785344\n },\n {\n \"content\": \"fn impl_json(enum_name: &Ident, version_field_name: &str) -> proc_macro2::TokenStream {\\n\\n quote!(\\n\\n impl<'a> iroha_version::json::DeserializeVersioned<'a> for #enum_name {\\n\\n fn from_versioned_json_str(input: &str) -> iroha_version::error::Result<Self> {\\n\\n use iroha_version::{error::Error, Version, UnsupportedVersion, RawVersioned};\\n\\n use serde_json::Value;\\n\\n\\n\\n let json: Value = serde_json::from_str(input)?;\\n\\n if let Value::Object(map) = json {\\n\\n if let Some(Value::String(version_number)) = map.get(#version_field_name) {\\n\\n let version: u8 = version_number.parse()?;\\n\\n if Self::supported_versions().contains(&version) {\\n\\n Ok(serde_json::from_str(input)?)\\n\\n } else {\\n\\n Err(Error::UnsupportedVersion(\\n\\n UnsupportedVersion::new(version, RawVersioned::Json(input.to_owned()))\\n\\n ))\\n\\n }\\n\\n } else {\\n\\n Err(Error::NotVersioned)\\n\",\n \"file_path\": \"version/derive/src/lib.rs\",\n \"rank\": 94,\n \"score\": 105944.73300532468\n },\n {\n \"content\": \"fn prepare_message(name: &str, telemetry: Telemetry) -> Result<(Message, Option<MessageKind>)> {\\n\\n let fields = telemetry.fields.0;\\n\\n let msg_kind = fields\\n\\n .iter()\\n\\n .find_map(|(name, map)| (*name == \\\"msg\\\").then(|| map))\\n\\n .and_then(|v| {\\n\\n v.as_str().map(|v| match v {\\n\\n \\\"system.connected\\\" => Some(MessageKind::Initialization),\\n\\n _ => None,\\n\\n })\\n\\n })\\n\\n .ok_or_else(|| eyre!(\\\"Failed to read 'msg'\\\"))?;\\n\\n let mut payload: Map<_, _> = fields\\n\\n .into_iter()\\n\\n .map(|(field, map)| {\\n\\n let field = field.to_owned();\\n\\n let map = if field == \\\"genesis_hash\\\" || field == \\\"best\\\" || field == \\\"finalized_hash\\\" {\\n\\n if let Some(hash) = map.as_str() {\\n\\n format!(\\\"0x{}\\\", hash).into()\\n\\n } else {\\n\",\n \"file_path\": \"telemetry/src/ws.rs\",\n \"rank\": 95,\n \"score\": 105828.67787301767\n },\n {\n \"content\": \"fn from_hex<'de, D>(deserializer: D) -> Result<Vec<u8>, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n hex::decode(String::deserialize(deserializer)?).map_err(SerdeError::custom)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crypto/src/lib.rs\",\n \"rank\": 96,\n \"score\": 105680.88389244417\n },\n {\n \"content\": \"pub fn main() {}\\n\",\n \"file_path\": \"version/derive/tests/ui/fail_invalid_range_less.rs\",\n \"rank\": 97,\n \"score\": 105310.53386101962\n },\n {\n \"content\": \"pub fn main() {}\\n\",\n \"file_path\": \"version/derive/tests/ui/fail_invalid_range_equal.rs\",\n \"rank\": 98,\n \"score\": 105310.53386101962\n },\n {\n \"content\": \"#[test]\\n\\nfn find_rate_and_check_it_greater_than_value_isi_should_be_valid() {\\n\\n let _instruction = IfInstruction::new(\\n\\n Not::new(Greater::new(\\n\\n QueryBox::from(FindAssetQuantityById::new(AssetId::from_names(\\n\\n \\\"btc2eth_rate\\\",\\n\\n \\\"exchange\\\",\\n\\n \\\"dex\\\",\\n\\n \\\"exchange\\\",\\n\\n ))),\\n\\n 10_u32,\\n\\n )),\\n\\n FailBox::new(\\\"rate is less or equal to value\\\"),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"data_model/tests/data_model.rs\",\n \"rank\": 99,\n \"score\": 104275.64794607543\n }\n]","isConversational":false}}},{"rowIdx":3690,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/renderer/wgpu_renderer.rs"},"repo_name":{"kind":"string","value":"takahirox/wgpu-rust-renderer"},"commit":{"kind":"string","value":"38dd6b0e60563229384bd33140b1bd51e09f23fc"},"file_code":{"kind":"string","value":"use winit::window::Window;\n\nuse crate::{\n\tgeometry::{\n\t\tattribute::Attribute,\n\t\tgeometry::Geometry,\n\t\tindex::Index,\n\t},\n\tmaterial::material::Material,\n\trenderer::{\n\t\twgpu_attributes::WGPUAttributes,\n\t\twgpu_bindings::WGPUBindings,\n\t\twgpu_indices::WGPUIndices,\n\t\twgpu_render_pipeline::WGPURenderPipelines,\n\t\twgpu_samplers::WGPUSamplers,\n\t\twgpu_textures::WGPUTextures,\n\t},\n\tresource::resource::{\n\t\tResourceId,\n\t\tResourcePools,\n\t},\n\tscene::{\n\t\tcamera::PerspectiveCamera,\n\t\tmesh::Mesh,\n\t\tnode::Node,\n\t\tscene::Scene,\n\t},\n};\n\npub struct WGPURendererOptions {\n\tpub sample_count: u32,\n}\n\nimpl Default for WGPURendererOptions {\n\tfn default() -> Self {\n\t\tWGPURendererOptions {\n\t\t\tsample_count: 4,\n\t\t}\n\t}\n}\n\npub struct WGPURenderer {\n\tattributes: WGPUAttributes,\n\tbindings: WGPUBindings,\n\tcolor_buffer: wgpu::Texture,\n\tdevice: wgpu::Device,\n\tdepth_buffer: wgpu::Texture,\n\theight: f64,\n\tindices: WGPUIndices,\n\tpixel_ratio: f64,\n\tqueue: wgpu::Queue,\n\trender_pipelines: WGPURenderPipelines,\n\tsample_count: u32,\n\tsamplers: WGPUSamplers,\n\tsurface: wgpu::Surface,\n\tsurface_configuration: wgpu::SurfaceConfiguration,\n\ttextures: WGPUTextures,\n\twidth: f64,\n}\n\nimpl WGPURenderer {\n\tpub async fn new(window: &Window, options: WGPURendererOptions) -> Self {\n\t\tlet width = 640.0;\n\t\tlet height = 480.0;\n\t\tlet pixel_ratio = 1.0;\n\n\t\tlet instance = wgpu::Instance::new(wgpu::Backends::all());\n\t\tlet surface = unsafe { instance.create_surface(window) };\n\t\tlet adapter = instance\n\t\t\t.request_adapter(&wgpu::RequestAdapterOptions {\n\t\t\t\tcompatible_surface: Some(&surface),\n\t\t\t\tforce_fallback_adapter: false,\n\t\t\t\tpower_preference: wgpu::PowerPreference::default(),\n\t\t\t})\n\t\t\t.await\n\t\t\t.expect(\"Failed to find an appropriate adapter\");\n\n\t\tlet (device, queue) = adapter\n\t\t\t.request_device(\n\t\t\t\t&wgpu::DeviceDescriptor {\n\t\t\t\t\tfeatures: wgpu::Features::empty(),\n\t\t\t\t\tlabel: None,\n\t\t\t\t\tlimits: wgpu::Limits::downlevel_defaults().using_resolution(adapter.limits()),\n\t\t\t\t},\n\t\t\t\tNone,\n\t\t\t)\n\t\t\t.await\n\t\t\t.expect(\"Failed to create device\");\n\n\t\tlet surface_configuration = wgpu::SurfaceConfiguration {\n\t\t\t\n\t\t\tformat: wgpu::TextureFormat::Bgra8Unorm,\n\t\t\theight: (height * pixel_ratio) as u32,\n\t\t\tpresent_mode: wgpu::PresentMode::Mailbox,\n\t\t\tusage: wgpu::TextureUsages::RENDER_ATTACHMENT,\n\t\t\twidth: (width * pixel_ratio) as u32,\n\t\t};\n\n\t\tsurface.configure(&device, &surface_configuration);\n\n\t\tWGPURenderer {\n\t\t\tattributes: WGPUAttributes::new(),\n\t\t\tbindings: WGPUBindings::new(),\n\t\t\tcolor_buffer: create_color_buffer(\n\t\t\t\t&device,\n\t\t\t\twidth,\n\t\t\t\theight,\n\t\t\t\tpixel_ratio,\n\t\t\t\toptions.sample_count,\n\t\t\t),\n\t\t\tdepth_buffer: create_depth_buffer(\n\t\t\t\t&device,\n\t\t\t\twidth,\n\t\t\t\theight,\n\t\t\t\tpixel_ratio,\n\t\t\t\toptions.sample_count,\n\t\t\t),\n\t\t\tdevice: device,\n\t\t\theight: height,\n\t\t\tindices: WGPUIndices::new(),\n\t\t\tpixel_ratio: pixel_ratio,\n\t\t\tqueue: queue,\n\t\t\trender_pipelines: WGPURenderPipelines::new(),\n\t\t\tsample_count: options.sample_count,\n\t\t\tsamplers: WGPUSamplers::new(),\n\t\t\tsurface: surface,\n\t\t\tsurface_configuration: surface_configuration,\n\t\t\ttextures: WGPUTextures::new(),\n\t\t\twidth: width\n\t\t}\n\t}\n\n\tpub fn set_size(&mut self, width: f64, height: f64) -> &mut Self {\n\t\tself.width = width;\n\t\tself.height = height;\n\n\t\tself.update_surface_configuration();\n\t\tself.recreate_color_buffer();\n\t\tself.recreate_depth_buffer();\n\n\t\tself\n\t}\n\n\tpub fn get_size(&self) -> (f64, f64) {\n\t\t(self.width, self.height)\n\t}\n\n\tpub fn set_pixel_ratio(&mut self, pixel_ratio: f64) -> &mut Self {\n\t\tself.pixel_ratio = pixel_ratio;\n\t\tself.set_size(self.width, self.height)\n\t}\n\n\tpub fn get_pixel_ratio(&self) -> f64 {\n\t\tself.pixel_ratio\n\t}\n\n\tfn update(\n\t\t&mut self,\n\t\tpools: &ResourcePools,\n\t\tscene_rid: &ResourceId<Scene>,\n\t\tcamera_rid: &ResourceId<PerspectiveCamera>,\n\t) {\n\t\tlet geometry_pool = pools.borrow::<Geometry>();\n\t\tlet mesh_pool = pools.borrow::<Mesh>();\n\t\tlet material_pool = pools.borrow::<Material>();\n\t\tlet node_pool = pools.borrow::<Node>();\n\n\t\t\n\n\t\tlet scene = match pools.borrow::<Scene>().borrow(scene_rid) {\n\t\t\tSome(scene) => scene,\n\t\t\tNone => return,\n\t\t};\n\n\t\tlet camera = match pools.borrow::<PerspectiveCamera>().borrow(camera_rid) {\n\t\t\tSome(camera) => camera,\n\t\t\tNone => return,\n\t\t};\n\n\t\tlet camera_node = match scene.borrow_assigned_from::<PerspectiveCamera>(camera_rid) {\n\t\t\tSome(rid) => match node_pool.borrow(rid) {\n\t\t\t\tSome(node) => node,\n\t\t\t\tNone => return,\n\t\t\t},\n\t\t\tNone => return,\n\t\t};\n\n\t\tfor node_rid in scene.collect_nodes(pools).iter() {\n\t\t\tlet mesh = match scene.borrow_assigned_to::<Mesh>(node_rid) {\n\t\t\t\tSome(rid) => match mesh_pool.borrow(rid) {\n\t\t\t\t\tSome(mesh) => mesh,\n\t\t\t\t\tNone => continue,\n\t\t\t\t},\n\t\t\t\tNone => continue,\n\t\t\t};\n\n\t\t\tlet geometry = match geometry_pool.borrow(mesh.borrow_geometry()) {\n\t\t\t\tSome(geometry) => geometry,\n\t\t\t\tNone => continue,\n\t\t\t};\n\n\t\t\tlet material = match material_pool.borrow(mesh.borrow_material()) {\n\t\t\t\tSome(material) => material,\n\t\t\t\tNone => continue,\n\t\t\t};\n\n\t\t\t\n\t\t\tif let Some(rid) = geometry.borrow_attribute(\"position\") {\n\t\t\t\tself.attributes.update(&self.device, pools, rid);\n\t\t\t}\n\t\t\tif let Some(rid) = geometry.borrow_attribute(\"normal\") {\n\t\t\t\tself.attributes.update(&self.device, pools, rid);\n\t\t\t}\n\t\t\tif let Some(rid) = geometry.borrow_attribute(\"uv\") {\n\t\t\t\tself.attributes.update(&self.device, pools, rid);\n\t\t\t}\n\n\t\t\tif let Some(rid) = geometry.borrow_index() {\n\t\t\t\tself.indices.update(&self.device, pools, rid);\n\t\t\t}\n\n\t\t\tself.textures.update_from_material(\n\t\t\t\t&self.device,\n\t\t\t\t&self.queue,\n\t\t\t\tpools,\n\t\t\t\tmaterial,\n\t\t\t);\n\n\t\t\tself.samplers.update_from_material(\n\t\t\t\t&self.device,\n\t\t\t\tpools,\n\t\t\t\tmaterial,\n\t\t\t);\n\n\t\t\tself.bindings.update(\n\t\t\t\t&self.device,\n\t\t\t\t&self.queue,\n\t\t\t\t&self.textures,\n\t\t\t\t&self.samplers,\n\t\t\t\tpools,\n\t\t\t\tnode_rid,\n\t\t\t\tcamera,\n\t\t\t\tcamera_node,\n\t\t\t\tmaterial,\n\t\t\t);\n\n\t\t\tself.render_pipelines.update(\n\t\t\t\t&self.device,\n\t\t\t\tpools,\n\t\t\t\tnode_rid,\n\t\t\t\tmaterial,\n\t\t\t\t&self.bindings.borrow(node_rid).unwrap().borrow_layout(),\n\t\t\t\tself.sample_count,\n\t\t\t);\n\t\t}\n\t}\n\n\tfn render_internal(\n\t\t&self,\n\t\tpools: &ResourcePools,\n\t\tscene_rid: &ResourceId<Scene>,\n\t) {\n\t\tlet attribute_pool = pools.borrow::<Attribute>();\n\t\tlet geometry_pool = pools.borrow::<Geometry>();\n\t\tlet index_pool = pools.borrow::<Index>();\n\t\tlet mesh_pool = pools.borrow::<Mesh>();\n\n\t\t\n\n\t\tlet scene = match pools.borrow::<Scene>().borrow(scene_rid) {\n\t\t\tSome(scene) => scene,\n\t\t\tNone => return,\n\t\t};\n\n\t\tlet frame = self.surface\n\t\t\t.get_current_texture()\n\t\t\t.expect(\"Failed to acquire next swap chain texture\");\n\n\t\tlet view = frame\n\t\t\t.texture\n\t\t\t.create_view(&wgpu::TextureViewDescriptor::default());\n\n\t\tlet color_view = &self.color_buffer.create_view(&wgpu::TextureViewDescriptor::default());\n\t\tlet depth_view = &self.depth_buffer.create_view(&wgpu::TextureViewDescriptor::default());\n\n\t\tlet background_color = scene.borrow_background_color();\n\n\t\tlet mut encoder = self.device.create_command_encoder(\n\t\t\t&wgpu::CommandEncoderDescriptor {label: None});\n\n\t\t{\n\t\t\tlet mut pass = encoder.begin_render_pass(&wgpu::RenderPassDescriptor {\n\t\t\t\tlabel: None,\n\t\t\t\tcolor_attachments: &[wgpu::RenderPassColorAttachment {\n\t\t\t\t\tops: wgpu::Operations {\n\t\t\t\t\t\tload: wgpu::LoadOp::Clear(wgpu::Color {\n\t\t\t\t\t\t\tr: background_color[0] as f64,\n\t\t\t\t\t\t\tg: background_color[1] as f64,\n\t\t\t\t\t\t\tb: background_color[2] as f64,\n\t\t\t\t\t\t\ta: 1.0,\n\t\t\t\t\t\t}),\n\t\t\t\t\t\tstore: true,\n\t\t\t\t\t},\n\t\t\t\t\tresolve_target: match self.sample_count {\n\t\t\t\t\t\t1 => None,\n\t\t\t\t\t\t_ => Some(&view),\n\t\t\t\t\t},\n\t\t\t\t\tview: match self.sample_count {\n\t\t\t\t\t\t1 => &view,\n\t\t\t\t\t\t_ => &color_view,\n\t\t\t\t\t},\n\t\t\t\t}],\n\t\t\t\tdepth_stencil_attachment: Some(wgpu::RenderPassDepthStencilAttachment {\n\t\t\t\t\tdepth_ops: Some(wgpu::Operations {\n\t\t\t\t\t\tload: wgpu::LoadOp::Clear(1.0),\n\t\t\t\t\t\tstore: true,\n\t\t\t\t\t}),\n\t\t\t\t\tstencil_ops: None,\n\t\t\t\t\tview: &depth_view,\n\t\t\t\t}),\n\t\t\t});\n\n\t\t\tfor node_rid in scene.collect_nodes(pools).iter() {\n\t\t\t\tlet mesh = match scene.borrow_assigned_to::<Mesh>(node_rid) {\n\t\t\t\t\tSome(rid) => match mesh_pool.borrow(rid) {\n\t\t\t\t\t\tSome(mesh) => mesh,\n\t\t\t\t\t\tNone => continue,\n\t\t\t\t\t},\n\t\t\t\t\tNone => continue,\n\t\t\t\t};\n\n\t\t\t\tlet geometry = match geometry_pool.borrow(mesh.borrow_geometry()) {\n\t\t\t\t\tSome(geometry) => geometry,\n\t\t\t\t\tNone => continue,\n\t\t\t\t};\n\n\t\t\t\tif let Some(pipeline) = self.render_pipelines.borrow(node_rid) {\n\t\t\t\t\tpass.set_pipeline(&pipeline);\n\t\t\t\t} else {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\n\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"position\") {\n\t\t\t\t\tif let Some(buffer) = self.attributes.borrow(rid) {\n\t\t\t\t\t\tpass.set_vertex_buffer(0, buffer.slice(..));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"normal\") {\n\t\t\t\t\tif let Some(buffer) = self.attributes.borrow(rid) {\n\t\t\t\t\t\tpass.set_vertex_buffer(1, buffer.slice(..));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"uv\") {\n\t\t\t\t\tif let Some(buffer) = self.attributes.borrow(rid) {\n\t\t\t\t\t\tpass.set_vertex_buffer(2, buffer.slice(..));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tlet binding = self.bindings.borrow(node_rid).unwrap();\n\t\t\t\tpass.set_bind_group(0, &binding.borrow_group(), &[]);\n\n\t\t\t\tif let Some(rid) = geometry.borrow_index() {\n\t\t\t\t\tif let Some(indices) = index_pool.borrow(rid) {\n\t\t\t\t\t\tif let Some(buffer) = self.indices.borrow(rid) {\n\t\t\t\t\t\t\tpass.set_index_buffer(buffer.slice(..), wgpu::IndexFormat::Uint16);\n\t\t\t\t\t\t\tpass.draw_indexed(0..indices.get_count(), 0, 0..1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"position\") {\n\t\t\t\t\t\tif let Some(positions) = attribute_pool.borrow(rid) {\n\t\t\t\t\t\t\tpass.draw(0..positions.get_count(), 0..1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tself.queue.submit(Some(encoder.finish()));\n\t\tframe.present()\n\t}\n\n\tpub fn render(\n\t\t&mut self,\n\t\tpools: &ResourcePools,\n\t\tscene_rid: &ResourceId<Scene>,\n\t\tcamera_rid: &ResourceId<PerspectiveCamera>,\n\t) {\n\t\tself.update(pools, scene_rid, camera_rid);\n\t\tself.render_internal(pools, scene_rid);\n\t}\n\n\tfn update_surface_configuration(&mut self) {\n\t\tself.surface_configuration.width = (self.width * self.pixel_ratio) as u32;\n\t\tself.surface_configuration.height = (self.height * self.pixel_ratio) as u32;\n\t\tself.surface.configure(&self.device, &self.surface_configuration);\n\t}\n\n\tfn recreate_color_buffer(&mut self) {\n\t\tself.color_buffer.destroy();\n\t\tself.color_buffer = create_color_buffer(\n\t\t\t&self.device,\n\t\t\tself.width,\n\t\t\tself.height,\n\t\t\tself.pixel_ratio,\n\t\t\tself.sample_count,\n\t\t);\n\t}\n\n\tfn recreate_depth_buffer(&mut self) {\n\t\tself.depth_buffer.destroy();\n\t\tself.depth_buffer = create_depth_buffer(\n\t\t\t&self.device,\n\t\t\tself.width,\n\t\t\tself.height,\n\t\t\tself.pixel_ratio,\n\t\t\tself.sample_count,\n\t\t);\n\t}\n}\n\nfn create_color_buffer(\n\tdevice: &wgpu::Device,\n\twidth: f64,\n\theight: f64,\n\tpixel_ratio: f64,\n\tsample_count: u32,\n) -> wgpu::Texture {\n\tdevice.create_texture(&wgpu::TextureDescriptor {\n\t\tlabel: None,\n\t\tsize: wgpu::Extent3d {\n\t\t\twidth: (width * pixel_ratio) as u32,\n\t\t\theight: (height * pixel_ratio) as u32,\n\t\t\tdepth_or_array_layers: 1,\n\t\t},\n\t\tmip_level_count: 1,\n\t\tsample_count: sample_count,\n\t\tdimension: wgpu::TextureDimension::D2,\n\t\tformat: wgpu::TextureFormat::Bgra8Unorm,\n\t\tusage: wgpu::TextureUsages::RENDER_ATTACHMENT,\n\t})\n}\n\nfn create_depth_buffer(\n\tdevice: &wgpu::Device,\n\twidth: f64,\n\theight: f64,\n\tpixel_ratio: f64,\n\tsample_count: u32,\n) -> wgpu::Texture {\n\tdevice.create_texture(&wgpu::TextureDescriptor {\n\t\tlabel: None,\n\t\tsize: wgpu::Extent3d {\n\t\t\twidth: (width * pixel_ratio) as u32,\n\t\t\theight: (height * pixel_ratio) as u32,\n\t\t\tdepth_or_array_layers: 1,\n\t\t},\n\t\tmip_level_count: 1,\n\t\tsample_count: sample_count,\n\t\tdimension: wgpu::TextureDimension::D2,\n\t\tformat: wgpu::TextureFormat::Depth24PlusStencil8,\n\t\tusage: wgpu::TextureUsages::RENDER_ATTACHMENT,\n\t})\n}\n"},"prefix":{"kind":"string","value":"use winit::window::Window;\n\nuse crate::{\n\tgeometry::{\n\t\tattribute::Attribute,\n\t\tgeometry::Geometry,\n\t\tindex::Index,\n\t},\n\tmaterial::material::Material,\n\trenderer::{\n\t\twgpu_attributes::WGPUAttributes,\n\t\twgpu_bindings::WGPUBindings,\n\t\twgpu_indices::WGPUIndices,\n\t\twgpu_render_pipeline::WGPURenderPipelines,\n\t\twgpu_samplers::WGPUSamplers,\n\t\twgpu_textures::WGPUTextures,\n\t},\n\tresource::resource::{\n\t\tResourceId,\n\t\tResourcePools,\n\t},\n\tscene::{\n\t\tcamera::PerspectiveCamera,\n\t\tmesh::Mesh,\n\t\tnode::Node,\n\t\tscene::Scene,\n\t},\n};\n\npub struct WGPURendererOptions {\n\tpub sample_count: u32,\n}\n\nimpl Default for WGPURendererOptions {\n\tfn default() -> Self {\n\t\tWGPURendererOptions {\n\t\t\tsample_count: 4,\n\t\t}\n\t}\n}\n\npub struct WGPURenderer {\n\tattributes: WGPUAttributes,\n\tbindings: WGPUBindings,\n\tcolor_buffer: wgpu::Texture,\n\tdevice: wgpu::Device,\n\tdepth_buffer: wgpu::Texture,\n\theight: f64,\n\tindices: WGPUIndices,\n\tpixel_ratio: f64,\n\tqueue: wgpu::Queue,\n\trender_pipelines: WGPURenderPipelines,\n\tsample_count: u32,\n\tsamplers: WGPUSamplers,\n\tsurface: wgpu::Surface,\n\tsurface_configuration: wgpu::SurfaceConfiguration,\n\ttextures: WGPUTextures,\n\twidth: f64,\n}\n\nimpl WGPURenderer {\n\tpub async fn new(window: &Window, options: WGPURendererOptions) -> Self {\n\t\tlet width = 640.0;\n\t\tlet height = 480.0;\n\t\tlet pixel_ratio = 1.0;\n\n\t\tlet instance = wgpu::Instance::new(wgpu::Backends::all());\n\t\tlet surface = unsafe { instance.create_surface(window) };\n\t\tlet adapter = instance\n\t\t\t.request_adapter(&wgpu::RequestAdapterOptions {\n\t\t\t\tcompatible_surface: Some(&surface),\n\t\t\t\tforce_fallback_adapter: false,\n\t\t\t\tpower_preference: wgpu::PowerPreference::default(),\n\t\t\t})\n\t\t\t.await\n\t\t\t.expect(\"Failed to find an appropriate adapter\");\n\n\t\tlet (device, queue) = adapter\n\t\t\t.request_device(\n\t\t\t\t&wgpu::DeviceDescriptor {\n\t\t\t\t\tfeatures: wgpu::Features::empty(),\n\t\t\t\t\tlabel: None,\n\t\t\t\t\tlimits: wgpu::Limits::downlevel_defaults().using_resolution(adapter.limits()),\n\t\t\t\t},\n\t\t\t\tNone,\n\t\t\t)\n\t\t\t.await\n\t\t\t.expect(\"Failed to create device\");\n\n\t\tlet surface_configuration = wgpu::SurfaceConfiguration {\n\t\t\t\n\t\t\tformat: wgpu::TextureFormat::Bgra8Unorm,\n\t\t\theight: (height * pixel_ratio) as u32,\n\t\t\tpresent_mode: wgpu::PresentMode::Mailbox,\n\t\t\tusage: wgpu::TextureUsages::RENDER_ATTACHMENT,\n\t\t\twidth: (width * pixel_ratio) as u32,\n\t\t};\n\n\t\tsurface.configure(&device, &surface_configuration);\n\n\t\tWGPURenderer {\n\t\t\tattributes: WGPUAttributes::new(),\n\t\t\tbindings: WGPUBindings::new(),\n\t\t\tcolor_buffer: create_color_buffer(\n\t\t\t\t&device,\n\t\t\t\twidth,\n\t\t\t\theight,\n\t\t\t\tpixel_ratio,\n\t\t\t\toptions.sample_count,\n\t\t\t),\n\t\t\tdepth_buffer: create_depth_buffer(\n\t\t\t\t&device,\n\t\t\t\twidth,\n\t\t\t\theight,\n\t\t\t\tpixel_ratio,\n\t\t\t\toptions.sample_count,\n\t\t\t),\n\t\t\tdevice: device,\n\t\t\theight: height,\n\t\t\tindices: WGPUIndices::new(),\n\t\t\tpixel_ratio: pixel_ratio,\n\t\t\tqueue: queue,\n\t\t\trender_pipelines: WGPURenderPipelines::new(),\n\t\t\tsample_count: options.sample_count,\n\t\t\tsamplers: WGPUSamplers::new(),\n\t\t\tsurface: surface,\n\t\t\tsurface_configuration: surface_configuration,\n\t\t\ttextures: WGPUTextures::new(),\n\t\t\twidth: width\n\t\t}\n\t}\n\n\tpub fn set_size(&mut self, width: f64, height: f64) -> &mut Self {\n\t\tself.width = width;\n\t\tself.height = height;\n\n\t\tself.update_surface_configuration();\n\t\tself.recreate_color_buffer();\n\t\tself.recreate_depth_buffer();\n\n\t\tself\n\t}\n\n\tpub fn get_size(&self) -> (f64, f64) {\n\t\t(self.width, self.height)\n\t}\n\n\tpub fn set_pixel_ratio(&mut self, pixel_ratio: f64) -> &mut Self {\n\t\tself.pixel_ratio = pixel_ratio;\n\t\tself.set_size(self.width, self.height)\n\t}\n\n\tpub fn get_pixel_ratio(&self) -> f64 {\n\t\tself.pixel_ratio\n\t}\n\n\tfn update(\n\t\t&mut self,\n\t\tpools: &ResourcePools,\n\t\tscene_rid: &ResourceId<Scene>,\n\t\tcamera_rid: &ResourceId<PerspectiveCamera>,\n\t) {\n\t\tlet geometry_pool = pools.borrow::<Geometry>();\n\t\tlet mesh_pool = pools.borrow::<Mesh>();\n\t\tlet material_pool = pools.borrow::<Material>();\n\t\tlet node_pool = pools.borrow::<Node>();\n\n\t\t\n\n\t\tlet scene = match pools.borrow::<Scene>().borrow(scene_rid) {\n\t\t\tSome(scene) => scene,\n\t\t\tNone => return,\n\t\t};\n\n\t\tlet camera = match pools.borrow::<PerspectiveCamera>().borrow(camera_rid) {\n\t\t\tSome(camera) => camera,\n\t\t\tNone => return,\n\t\t};\n\n\t\tlet camera_node = match scene.borrow_assigned_from::<PerspectiveCamera>(camera_rid) {\n\t\t\tSome(rid) => match node_pool.borrow(rid) {\n\t\t\t\tSome(node) => node,\n\t\t\t\tNone => return,\n\t\t\t},\n\t\t\tNone => return,\n\t\t};\n\n\t\tfor node_rid in scene.collect_nodes(pools).iter() {\n\t\t\tlet mesh = match scene.borrow_assigned_to::<Mesh>(node_rid) {\n\t\t\t\tSome(rid) => match mesh_pool.borrow(rid) {\n\t\t\t\t\tSome(mesh) => mesh,\n\t\t\t\t\tNone => continue,\n\t\t\t\t},\n\t\t\t\tNone => continue,\n\t\t\t};\n\n\t\t\tlet geometry = match geometry_pool.borrow(mesh.borrow_geometry()) {\n\t\t\t\tSome(geometry) => geometry,\n\t\t\t\tNone => continue,\n\t\t\t};\n\n\t\t\t"},"suffix":{"kind":"string","value":"\n\n\t\t\t\n\t\t\tif let Some(rid) = geometry.borrow_attribute(\"position\") {\n\t\t\t\tself.attributes.update(&self.device, pools, rid);\n\t\t\t}\n\t\t\tif let Some(rid) = geometry.borrow_attribute(\"normal\") {\n\t\t\t\tself.attributes.update(&self.device, pools, rid);\n\t\t\t}\n\t\t\tif let Some(rid) = geometry.borrow_attribute(\"uv\") {\n\t\t\t\tself.attributes.update(&self.device, pools, rid);\n\t\t\t}\n\n\t\t\tif let Some(rid) = geometry.borrow_index() {\n\t\t\t\tself.indices.update(&self.device, pools, rid);\n\t\t\t}\n\n\t\t\tself.textures.update_from_material(\n\t\t\t\t&self.device,\n\t\t\t\t&self.queue,\n\t\t\t\tpools,\n\t\t\t\tmaterial,\n\t\t\t);\n\n\t\t\tself.samplers.update_from_material(\n\t\t\t\t&self.device,\n\t\t\t\tpools,\n\t\t\t\tmaterial,\n\t\t\t);\n\n\t\t\tself.bindings.update(\n\t\t\t\t&self.device,\n\t\t\t\t&self.queue,\n\t\t\t\t&self.textures,\n\t\t\t\t&self.samplers,\n\t\t\t\tpools,\n\t\t\t\tnode_rid,\n\t\t\t\tcamera,\n\t\t\t\tcamera_node,\n\t\t\t\tmaterial,\n\t\t\t);\n\n\t\t\tself.render_pipelines.update(\n\t\t\t\t&self.device,\n\t\t\t\tpools,\n\t\t\t\tnode_rid,\n\t\t\t\tmaterial,\n\t\t\t\t&self.bindings.borrow(node_rid).unwrap().borrow_layout(),\n\t\t\t\tself.sample_count,\n\t\t\t);\n\t\t}\n\t}\n\n\tfn render_internal(\n\t\t&self,\n\t\tpools: &ResourcePools,\n\t\tscene_rid: &ResourceId<Scene>,\n\t) {\n\t\tlet attribute_pool = pools.borrow::<Attribute>();\n\t\tlet geometry_pool = pools.borrow::<Geometry>();\n\t\tlet index_pool = pools.borrow::<Index>();\n\t\tlet mesh_pool = pools.borrow::<Mesh>();\n\n\t\t\n\n\t\tlet scene = match pools.borrow::<Scene>().borrow(scene_rid) {\n\t\t\tSome(scene) => scene,\n\t\t\tNone => return,\n\t\t};\n\n\t\tlet frame = self.surface\n\t\t\t.get_current_texture()\n\t\t\t.expect(\"Failed to acquire next swap chain texture\");\n\n\t\tlet view = frame\n\t\t\t.texture\n\t\t\t.create_view(&wgpu::TextureViewDescriptor::default());\n\n\t\tlet color_view = &self.color_buffer.create_view(&wgpu::TextureViewDescriptor::default());\n\t\tlet depth_view = &self.depth_buffer.create_view(&wgpu::TextureViewDescriptor::default());\n\n\t\tlet background_color = scene.borrow_background_color();\n\n\t\tlet mut encoder = self.device.create_command_encoder(\n\t\t\t&wgpu::CommandEncoderDescriptor {label: None});\n\n\t\t{\n\t\t\tlet mut pass = encoder.begin_render_pass(&wgpu::RenderPassDescriptor {\n\t\t\t\tlabel: None,\n\t\t\t\tcolor_attachments: &[wgpu::RenderPassColorAttachment {\n\t\t\t\t\tops: wgpu::Operations {\n\t\t\t\t\t\tload: wgpu::LoadOp::Clear(wgpu::Color {\n\t\t\t\t\t\t\tr: background_color[0] as f64,\n\t\t\t\t\t\t\tg: background_color[1] as f64,\n\t\t\t\t\t\t\tb: background_color[2] as f64,\n\t\t\t\t\t\t\ta: 1.0,\n\t\t\t\t\t\t}),\n\t\t\t\t\t\tstore: true,\n\t\t\t\t\t},\n\t\t\t\t\tresolve_target: match self.sample_count {\n\t\t\t\t\t\t1 => None,\n\t\t\t\t\t\t_ => Some(&view),\n\t\t\t\t\t},\n\t\t\t\t\tview: match self.sample_count {\n\t\t\t\t\t\t1 => &view,\n\t\t\t\t\t\t_ => &color_view,\n\t\t\t\t\t},\n\t\t\t\t}],\n\t\t\t\tdepth_stencil_attachment: Some(wgpu::RenderPassDepthStencilAttachment {\n\t\t\t\t\tdepth_ops: Some(wgpu::Operations {\n\t\t\t\t\t\tload: wgpu::LoadOp::Clear(1.0),\n\t\t\t\t\t\tstore: true,\n\t\t\t\t\t}),\n\t\t\t\t\tstencil_ops: None,\n\t\t\t\t\tview: &depth_view,\n\t\t\t\t}),\n\t\t\t});\n\n\t\t\tfor node_rid in scene.collect_nodes(pools).iter() {\n\t\t\t\tlet mesh = match scene.borrow_assigned_to::<Mesh>(node_rid) {\n\t\t\t\t\tSome(rid) => match mesh_pool.borrow(rid) {\n\t\t\t\t\t\tSome(mesh) => mesh,\n\t\t\t\t\t\tNone => continue,\n\t\t\t\t\t},\n\t\t\t\t\tNone => continue,\n\t\t\t\t};\n\n\t\t\t\tlet geometry = match geometry_pool.borrow(mesh.borrow_geometry()) {\n\t\t\t\t\tSome(geometry) => geometry,\n\t\t\t\t\tNone => continue,\n\t\t\t\t};\n\n\t\t\t\tif let Some(pipeline) = self.render_pipelines.borrow(node_rid) {\n\t\t\t\t\tpass.set_pipeline(&pipeline);\n\t\t\t\t} else {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t\n\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"position\") {\n\t\t\t\t\tif let Some(buffer) = self.attributes.borrow(rid) {\n\t\t\t\t\t\tpass.set_vertex_buffer(0, buffer.slice(..));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"normal\") {\n\t\t\t\t\tif let Some(buffer) = self.attributes.borrow(rid) {\n\t\t\t\t\t\tpass.set_vertex_buffer(1, buffer.slice(..));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"uv\") {\n\t\t\t\t\tif let Some(buffer) = self.attributes.borrow(rid) {\n\t\t\t\t\t\tpass.set_vertex_buffer(2, buffer.slice(..));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tlet binding = self.bindings.borrow(node_rid).unwrap();\n\t\t\t\tpass.set_bind_group(0, &binding.borrow_group(), &[]);\n\n\t\t\t\tif let Some(rid) = geometry.borrow_index() {\n\t\t\t\t\tif let Some(indices) = index_pool.borrow(rid) {\n\t\t\t\t\t\tif let Some(buffer) = self.indices.borrow(rid) {\n\t\t\t\t\t\t\tpass.set_index_buffer(buffer.slice(..), wgpu::IndexFormat::Uint16);\n\t\t\t\t\t\t\tpass.draw_indexed(0..indices.get_count(), 0, 0..1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif let Some(rid) = geometry.borrow_attribute(\"position\") {\n\t\t\t\t\t\tif let Some(positions) = attribute_pool.borrow(rid) {\n\t\t\t\t\t\t\tpass.draw(0..positions.get_count(), 0..1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tself.queue.submit(Some(encoder.finish()));\n\t\tframe.present()\n\t}\n\n\tpub fn render(\n\t\t&mut self,\n\t\tpools: &ResourcePools,\n\t\tscene_rid: &ResourceId<Scene>,\n\t\tcamera_rid: &ResourceId<PerspectiveCamera>,\n\t) {\n\t\tself.update(pools, scene_rid, camera_rid);\n\t\tself.render_internal(pools, scene_rid);\n\t}\n\n\tfn update_surface_configuration(&mut self) {\n\t\tself.surface_configuration.width = (self.width * self.pixel_ratio) as u32;\n\t\tself.surface_configuration.height = (self.height * self.pixel_ratio) as u32;\n\t\tself.surface.configure(&self.device, &self.surface_configuration);\n\t}\n\n\tfn recreate_color_buffer(&mut self) {\n\t\tself.color_buffer.destroy();\n\t\tself.color_buffer = create_color_buffer(\n\t\t\t&self.device,\n\t\t\tself.width,\n\t\t\tself.height,\n\t\t\tself.pixel_ratio,\n\t\t\tself.sample_count,\n\t\t);\n\t}\n\n\tfn recreate_depth_buffer(&mut self) {\n\t\tself.depth_buffer.destroy();\n\t\tself.depth_buffer = create_depth_buffer(\n\t\t\t&self.device,\n\t\t\tself.width,\n\t\t\tself.height,\n\t\t\tself.pixel_ratio,\n\t\t\tself.sample_count,\n\t\t);\n\t}\n}\n\nfn create_color_buffer(\n\tdevice: &wgpu::Device,\n\twidth: f64,\n\theight: f64,\n\tpixel_ratio: f64,\n\tsample_count: u32,\n) -> wgpu::Texture {\n\tdevice.create_texture(&wgpu::TextureDescriptor {\n\t\tlabel: None,\n\t\tsize: wgpu::Extent3d {\n\t\t\twidth: (width * pixel_ratio) as u32,\n\t\t\theight: (height * pixel_ratio) as u32,\n\t\t\tdepth_or_array_layers: 1,\n\t\t},\n\t\tmip_level_count: 1,\n\t\tsample_count: sample_count,\n\t\tdimension: wgpu::TextureDimension::D2,\n\t\tformat: wgpu::TextureFormat::Bgra8Unorm,\n\t\tusage: wgpu::TextureUsages::RENDER_ATTACHMENT,\n\t})\n}\n\nfn create_depth_buffer(\n\tdevice: &wgpu::Device,\n\twidth: f64,\n\theight: f64,\n\tpixel_ratio: f64,\n\tsample_count: u32,\n) -> wgpu::Texture {\n\tdevice.create_texture(&wgpu::TextureDescriptor {\n\t\tlabel: None,\n\t\tsize: wgpu::Extent3d {\n\t\t\twidth: (width * pixel_ratio) as u32,\n\t\t\theight: (height * pixel_ratio) as u32,\n\t\t\tdepth_or_array_layers: 1,\n\t\t},\n\t\tmip_level_count: 1,\n\t\tsample_count: sample_count,\n\t\tdimension: wgpu::TextureDimension::D2,\n\t\tformat: wgpu::TextureFormat::Depth24PlusStencil8,\n\t\tusage: wgpu::TextureUsages::RENDER_ATTACHMENT,\n\t})\n}\n"},"middle":{"kind":"string","value":"let material = match material_pool.borrow(mesh.borrow_material()) {\n\t\t\t\tSome(material) => material,\n\t\t\t\tNone => continue,\n\t\t\t};"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"pub fn get_window_device_pixel_ratio() -> f64 {\n\n\tlet window = web_sys::window().unwrap();\n\n\twindow.device_pixel_ratio()\n\n}\n\n\n","file_path":"web/examples/utils/window.rs","rank":0,"score":218816.77958122682},{"content":"pub fn get_window_inner_size() -> (f64, f64) {\n\n\tlet window = web_sys::window().unwrap();\n\n\t(\n\n\t\twindow.inner_width().unwrap().as_f64().unwrap(),\n\n\t\twindow.inner_height().unwrap().as_f64().unwrap()\n\n\t)\n\n}\n\n\n","file_path":"web/examples/utils/window.rs","rank":1,"score":202281.6631094451},{"content":"// @TODO: Remove duplication with wgpu_attributes.rs\n\nfn create_buffer(device: &wgpu::Device, contents: &[u8], usage: wgpu::BufferUsages) -> wgpu::Buffer {\n\n\tuse wgpu::util::DeviceExt;\n\n\tdevice.create_buffer_init(&wgpu::util::BufferInitDescriptor {\n\n\t\tlabel: None,\n\n\t\tcontents: contents,\n\n\t\tusage: usage,\n\n\t})\n\n}\n","file_path":"src/renderer/wgpu_indices.rs","rank":2,"score":179608.97366765174},{"content":"fn create_buffer(device: &wgpu::Device, contents: &[u8], usage: wgpu::BufferUsages) -> wgpu::Buffer {\n\n\tuse wgpu::util::DeviceExt;\n\n\tdevice.create_buffer_init(&wgpu::util::BufferInitDescriptor {\n\n\t\tlabel: None,\n\n\t\tcontents: contents,\n\n\t\tusage: usage,\n\n\t})\n\n}\n","file_path":"src/renderer/wgpu_attributes.rs","rank":3,"score":179597.23967667524},{"content":"fn get_wgpu_format(format: &TextureFormat) -> wgpu::TextureFormat {\n\n\tmatch format {\n\n\t\tTextureFormat::Float => wgpu::TextureFormat::Rgba32Float,\n\n\t\tTextureFormat::Uint8 => wgpu::TextureFormat::Rgba8Unorm,\n\n\t\tTextureFormat::Uint8Srgb => wgpu::TextureFormat::Rgba8UnormSrgb,\n\n\t}\n\n}\n","file_path":"src/renderer/wgpu_textures.rs","rank":4,"score":177289.25852096808},{"content":"// @TODO: Write comment\n\nfn cast_pool_mut_unsafe<T: 'static>(pool: &Box<dyn ResourcePoolTrait>) -> &mut ResourcePool<T> {\n\n\tlet ptr = cast_pool(pool.as_ref())\n\n\t\tas *const ResourcePool<T> as *mut ResourcePool<T>;\n\n\tunsafe { transmute(ptr) }\n\n}\n\n\n\nimpl<T: 'static> ResourcePool<T> {\n\n\tpub fn new() -> Self {\n\n\t\tResourcePool {\n\n\t\t\tresources: Vec::new(),\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn add(&mut self, resource: T) -> ResourceId<T> {\n\n\t\tlet id = self.resources.len();\n\n\t\tself.resources.push(resource);\n\n\t\tResourceId::new(id)\n\n\t}\n\n\n\n\tpub fn borrow(&self, r_id: &ResourceId<T>) -> Option<&T> {\n","file_path":"src/resource/resource.rs","rank":5,"score":171925.47084891915},{"content":"fn create_sampler(\n\n\tdevice: &wgpu::Device,\n\n\tsampler: &Sampler,\n\n) -> wgpu::Sampler {\n\n\t// @TODO: Fix me\n\n\tdevice.create_sampler(&wgpu::SamplerDescriptor {\n\n\t\taddress_mode_u: get_address_mode(sampler.wrap_u()),\n\n\t\taddress_mode_v: get_address_mode(sampler.wrap_v()),\n\n\t\taddress_mode_w: get_address_mode(sampler.wrap_w()),\n\n\t\tanisotropy_clamp: None,\n\n\t\tborder_color: None,\n\n\t\tcompare: None,\n\n\t\tmag_filter: get_filter_mode(sampler.mag_filter()),\n\n\t\tmin_filter: get_filter_mode(sampler.min_filter()),\n\n\t\tmipmap_filter: get_filter_mode(sampler.mipmap_filter()),\n\n\t\tlabel: None,\n\n\t\tlod_max_clamp: 0.0,\n\n \t\tlod_min_clamp: 0.0,\n\n\t})\n\n}\n\n\n","file_path":"src/renderer/wgpu_samplers.rs","rank":6,"score":169999.79491284228},{"content":"fn create_texture(\n\n\tdevice: &wgpu::Device,\n\n\twidth: u32,\n\n\theight: u32,\n\n\tformat: wgpu::TextureFormat\n\n) -> wgpu::Texture {\n\n\tdevice.create_texture(&wgpu::TextureDescriptor {\n\n\t\tlabel: None,\n\n\t\tsize: wgpu::Extent3d {\n\n\t\t\twidth: width,\n\n\t\t\theight: height,\n\n\t\t\tdepth_or_array_layers: 1,\n\n },\n\n\t\tmip_level_count: 1,\n\n\t\tsample_count: 1,\n\n\t\tdimension: wgpu::TextureDimension::D2,\n\n\t\tformat: format,\n\n\t\tusage: wgpu::TextureUsages::TEXTURE_BINDING | wgpu::TextureUsages::COPY_DST,\n\n\t})\n\n}\n\n\n","file_path":"src/renderer/wgpu_textures.rs","rank":7,"score":169321.40649253016},{"content":"fn cast_pool_mut<T: 'static>(pool: &mut dyn ResourcePoolTrait) -> &mut ResourcePool<T> {\n\n\tpool\n\n\t\t.as_any_mut()\n\n\t\t.downcast_mut::<ResourcePool<T>>()\n\n\t\t.unwrap()\n\n}\n\n\n","file_path":"src/resource/resource.rs","rank":8,"score":163091.72919276112},{"content":"pub fn create_window(event_loop: &EventLoop<()>) -> std::rc::Rc<winit::window::Window> {\n\n\tlet window = winit::window::Window::new(&event_loop).unwrap();\n\n\tlet window = std::rc::Rc::new(window);\n\n\n\n\t// winit::window::Window doesn't seem to detect browser's onresize event so we emulate it.\n\n {\n\n\t\tlet window = window.clone();\n\n\t\tlet closure = Closure::wrap(Box::new(move |_e: web_sys::Event| {\n\n\t\t\tlet size = get_window_inner_size();\n\n\t\t\twindow.set_inner_size(winit::dpi::PhysicalSize::new(\n\n\t\t\t\tsize.0, size.1,\n\n\t\t\t));\n\n\t\t}) as Box<dyn FnMut(_)>);\n\n\t\tweb_sys::window()\n\n\t\t\t.unwrap()\n\n\t\t\t.add_event_listener_with_callback(\"resize\", closure.as_ref().unchecked_ref())\n\n\t\t\t.unwrap();\n\n\t\tclosure.forget();\n\n }\n\n\n\n\twindow\n\n}\n","file_path":"web/examples/utils/window.rs","rank":9,"score":161337.05906842422},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/texture/main.rs","rank":10,"score":159645.46964923147},{"content":"fn create_buffer(device: &wgpu::Device, size_in_byte: usize) -> wgpu::Buffer {\n\n\tuse wgpu::util::DeviceExt;\n\n\tdevice.create_buffer_init(&wgpu::util::BufferInitDescriptor {\n\n\t\tlabel: None,\n\n\t\tcontents: bytemuck::cast_slice(&vec![0.0; size_in_byte / 4]),\n\n\t\tusage: wgpu::BufferUsages::UNIFORM | wgpu::BufferUsages::COPY_DST,\n\n\t})\n\n}\n\n\n","file_path":"src/renderer/wgpu_bindings.rs","rank":11,"score":155762.63105445803},{"content":"fn render(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[wasm_bindgen(start)]\n\npub async fn start() {\n\n\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\n\n\tconsole_log::init().expect(\"could not initialize logger\");\n\n\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = create_window(&event_loop);\n\n\n\n\tuse winit::platform::web::WindowExtWebSys;\n\n\n\n\tweb_sys::window()\n","file_path":"web/examples/texture/src/lib.rs","rank":12,"score":152054.51290581445},{"content":"fn upload_texture(\n\n\tqueue: &wgpu::Queue,\n\n\ttexture: &wgpu::Texture,\n\n\twidth: u32,\n\n\theight: u32,\n\n\ttexels: &[u8],\n\n) {\n\n\tqueue.write_texture(\n\n\t\ttexture.as_image_copy(),\n\n\t\t&texels,\n\n\t\twgpu::ImageDataLayout {\n\n\t\t\toffset: 0,\n\n\t\t\t// @TODO: Fix me\n\n\t\t\tbytes_per_row: Some(std::num::NonZeroU32::new(width * 4).unwrap()),\n\n\t\t\trows_per_image: None,\n\n\t\t},\n\n\t\twgpu::Extent3d {\n\n\t\t\twidth: width,\n\n\t\t\theight: height,\n\n\t\t\tdepth_or_array_layers: 1,\n\n },\n\n\t);\n\n}\n\n\n","file_path":"src/renderer/wgpu_textures.rs","rank":13,"score":134665.70019296027},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.0, 0.01, 0.0],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/texture/main.rs","rank":14,"score":134641.7375334434},{"content":"fn create_scene(\n\n\twindow: &Window,\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_box(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 0.5, 0.5, 1.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n","file_path":"examples/cube/main.rs","rank":17,"score":130886.17460341491},{"content":"fn create_scene(\n\n\twindow: &Window,\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>) {\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_triangle(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 1.0, 0.0, 0.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n\n\tlet node = pools.borrow_mut::<Node>().add(Node::new());\n\n\tscene.add_node(&node);\n","file_path":"examples/triangle/main.rs","rank":18,"score":130886.17460341491},{"content":"fn create_scene(\n\n\twindow: &Window,\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_plane(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n\n\tlet node = pools.borrow_mut::<Node>().add(Node::new());\n","file_path":"examples/rotation/main.rs","rank":19,"score":130886.17460341491},{"content":"fn create_scene(\n\n\twindow: &Window,\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_box(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_brdf_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 1.0, 1.0, 1.0),\n\n\t\t0.5,\n\n\t\t0.5,\n\n\t);\n","file_path":"examples/pbr/main.rs","rank":20,"score":130886.17460341491},{"content":"struct Camera {\n\n projection_matrix: mat4x4<f32>;\n\n};\n\n\n\n[[block]]\n","file_path":"src/material/material.rs","rank":21,"score":130005.25176133549},{"content":"fn create_scene(\n\n\twindow: &Window,\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\t//\n\n\n\n\tlet geometry = GeometryHelper::create_plane(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\n\n\t);\n\n\n","file_path":"examples/face_culling/main.rs","rank":22,"score":127144.89591444175},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.0, 0.01, 0.0],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"web/examples/texture/src/lib.rs","rank":23,"score":126896.0363400685},{"content":"fn create_scene(\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_plane(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n\n\tlet node = pools.borrow_mut::<Node>().add(Node::new());\n\n\tscene.add_node(&node);\n","file_path":"web/examples/rotation/src/lib.rs","rank":24,"score":123656.88715046295},{"content":"fn create_scene(\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_box(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 0.5, 0.5, 1.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n\n\tlet node = pools.borrow_mut::<Node>().add(Node::new());\n","file_path":"web/examples/cube/src/lib.rs","rank":25,"score":123656.88715046295},{"content":"fn create_scene(\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>) {\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_triangle(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 1.0, 0.0, 0.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n\n\tlet node = pools.borrow_mut::<Node>().add(Node::new());\n\n\tscene.add_node(&node);\n\n\tscene.assign(&node, &mesh);\n","file_path":"web/examples/triangle/src/lib.rs","rank":26,"score":123656.88715046295},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/triangle/main.rs","rank":27,"score":122877.1707294059},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/pbr/main.rs","rank":28,"score":122877.1707294059},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/gltf/main.rs","rank":29,"score":122877.1707294059},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/rotation/main.rs","rank":30,"score":122877.1707294059},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/cube/main.rs","rank":31,"score":122877.1707294059},{"content":"fn create_scene(\n\n\tpools: &mut ResourcePools\n\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\n\n\tlet mut objects = Vec::new();\n\n\tlet mut scene = Scene::new();\n\n\n\n\tlet geometry = GeometryHelper::create_plane(\n\n\t\tpools,\n\n\t\t1.0,\n\n\t\t1.0,\n\n\t);\n\n\n\n\tlet material = MaterialHelper::create_basic_material(\n\n\t\tpools,\n\n\t\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\n\n\t);\n\n\n\n\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\n\n\tlet mut node = Node::new();\n\n\tnode.borrow_position_mut()[0] = -0.5;\n","file_path":"web/examples/face_culling/src/lib.rs","rank":32,"score":120397.27224364714},{"content":"fn render(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = Window::new(&event_loop).unwrap();\n\n\n\n\tlet window_size = window.inner_size();\n\n\tlet pixel_ratio = window.scale_factor();\n\n\n\n\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\n\n\trenderer.set_size(window_size.width as f64, window_size.height as f64);\n\n\trenderer.set_pixel_ratio(pixel_ratio);\n","file_path":"examples/face_culling/main.rs","rank":33,"score":120278.79711748421},{"content":"fn cast_links_mut<T1: 'static, T2: 'static>(links: &mut dyn ResourceLinksTrait) -> &mut ResourceLinks<T1, T2> {\n\n\tlinks\n\n\t\t.as_any_mut()\n\n\t\t.downcast_mut::<ResourceLinks<T1, T2>>()\n\n\t\t.unwrap()\n\n}\n\n\n\npub struct Scene {\n\n\tbackground_color: [f32; 3],\n\n\tlinks: HashMap<TypeId, Box<dyn ResourceLinksTrait>>,\n\n\tnodes: Vec<ResourceId<Node>>,\n\n}\n\n\n\nimpl Scene {\n\n\tpub fn new() -> Self {\n\n\t\tlet mut links = HashMap::new();\n\n\t\tSelf::add_links::<Node, Mesh>(&mut links);\n\n\t\tSelf::add_links::<Mesh, Node>(&mut links);\n\n\t\tSelf::add_links::<Node, PerspectiveCamera>(&mut links);\n\n\t\tSelf::add_links::<PerspectiveCamera, Node>(&mut links);\n","file_path":"src/scene/scene.rs","rank":34,"score":120145.41394457332},{"content":"fn update_canvas_size(\n\n\tcanvas: &web_sys::HtmlCanvasElement,\n\n\t(width, height): (f64, f64),\n\n\tpixel_ratio: f64\n\n) {\n\n\tcanvas.set_width((width * pixel_ratio) as u32);\n\n\tcanvas.set_height((height * pixel_ratio) as u32);\n\n\tcanvas.style().set_property(\"width\", &((width as u32).to_string() + \"px\")).unwrap();\n\n\tcanvas.style().set_property(\"height\", &((height as u32).to_string() + \"px\")).unwrap();\n\n}\n","file_path":"src/web/wgpu_web_renderer.rs","rank":35,"score":118708.40102751396},{"content":"fn render(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[wasm_bindgen(start)]\n\npub async fn start() {\n\n\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\n\n\tconsole_log::init().expect(\"could not initialize logger\");\n\n\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = create_window(&event_loop);\n\n\n\n\tuse winit::platform::web::WindowExtWebSys;\n\n\n\n\tweb_sys::window()\n","file_path":"web/examples/cube/src/lib.rs","rank":36,"score":117862.4856781021},{"content":"fn render(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[wasm_bindgen(start)]\n\npub async fn start() {\n\n\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\n\n\tconsole_log::init().expect(\"could not initialize logger\");\n\n\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = create_window(&event_loop);\n\n\n\n\tuse winit::platform::web::WindowExtWebSys;\n\n\n\n\tweb_sys::window()\n","file_path":"web/examples/gltf/src/lib.rs","rank":37,"score":117862.4856781021},{"content":"fn render(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[wasm_bindgen(start)]\n\npub async fn start() {\n\n\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\n\n\tconsole_log::init().expect(\"could not initialize logger\");\n\n\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = create_window(&event_loop);\n\n\n\n\tuse winit::platform::web::WindowExtWebSys;\n\n\n\n\tweb_sys::window()\n","file_path":"web/examples/triangle/src/lib.rs","rank":38,"score":117862.4856781021},{"content":"fn render(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[wasm_bindgen(start)]\n\npub async fn start() {\n\n\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\n\n\tconsole_log::init().expect(\"could not initialize logger\");\n\n\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = create_window(&event_loop);\n\n\n\n\tuse winit::platform::web::WindowExtWebSys;\n\n\n\n\tweb_sys::window()\n","file_path":"web/examples/rotation/src/lib.rs","rank":39,"score":117862.4856781021},{"content":"fn render(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n) {\n\n\trenderer.render(pools, scene, camera);\n\n}\n\n\n\n#[wasm_bindgen(start)]\n\npub async fn start() {\n\n\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\n\n\tconsole_log::init().expect(\"could not initialize logger\");\n\n\n\n\tlet event_loop = EventLoop::new();\n\n\tlet window = create_window(&event_loop);\n\n\n\n\tuse winit::platform::web::WindowExtWebSys;\n\n\n\n\tweb_sys::window()\n","file_path":"web/examples/face_culling/src/lib.rs","rank":40,"score":115609.74906644374},{"content":"fn cast_pool<T: 'static>(pool: &dyn ResourcePoolTrait) -> &ResourcePool<T> {\n\n\tpool\n\n\t\t.as_any()\n\n\t\t.downcast_ref::<ResourcePool<T>>()\n\n\t\t.unwrap()\n\n}\n\n\n","file_path":"src/resource/resource.rs","rank":41,"score":111154.57840113423},{"content":"fn get_align(contents: &UniformContents) -> u64 {\n\n\tmatch contents {\n\n\t\tUniformContents::Float {value: _} => 4,\n\n\t\tUniformContents::Matrix4 {value: _} => 64,\n\n\t\tUniformContents::Vector3 {value: _} => 16,\n\n\t\t_ => 0,\n\n\t}\n\n}\n","file_path":"src/renderer/wgpu_bindings.rs","rank":42,"score":105325.36555340898},{"content":"fn get_byte(contents: &UniformContents) -> u64 {\n\n\tmatch contents {\n\n\t\tUniformContents::Float {value: _} => 4,\n\n\t\tUniformContents::Matrix4 {value: _} => 64,\n\n\t\tUniformContents::Vector3 {value: _} => 12,\n\n\t\t_ => 0,\n\n\t}\n\n}\n\n\n","file_path":"src/renderer/wgpu_bindings.rs","rank":43,"score":105325.36555340898},{"content":"pub trait MaterialNode {\n\n\tfn collect_nodes (\n\n\t\t&self,\n\n\t\tpool: &ResourcePool<Box<dyn MaterialNode>>,\n\n\t\tnodes: &mut Vec<ResourceId<Box<dyn MaterialNode>>>,\n\n\t\tvisited: &mut HashMap<ResourceId<Box<dyn MaterialNode>>, bool>,\n\n\t\tself_rid: ResourceId<Box<dyn MaterialNode>>,\n\n\t);\n\n\tfn borrow_contents(&self) -> Option<&UniformContents>;\n\n\tfn build_declaration(&self, self_id: usize) -> String;\n\n\tfn build_functions(&self, self_id: usize) -> String;\n\n\tfn build_fragment_shader(\n\n\t\t&self,\n\n\t\tpool: &ResourcePool<Box<dyn MaterialNode>>,\n\n\t\tvisited: &mut HashMap<usize, bool>,\n\n\t\tself_id: usize,\n\n\t) -> String;\n\n\tfn get_fragment_output(&self, self_id: usize) -> String;\n\n}\n\n\n\n// @TODO: Ensure unique variable names\n","file_path":"src/material/node/node.rs","rank":44,"score":104896.4248463712},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\npub fn log(s: &str) {\n\n\tprintln!(\"{}\", s);\n\n}\n\n\n\n// Wasm\n\n\n\n#[cfg(target_arch = \"wasm32\")]\n\nuse wasm_bindgen::prelude::*;\n\n\n\n#[cfg(target_arch = \"wasm32\")]\n\n#[wasm_bindgen]\n\nextern \"C\" {\n\n\t#[wasm_bindgen(js_namespace = console)]\n\n\tpub fn log(s: &str);\n\n}\n","file_path":"src/utils/log.rs","rank":45,"score":104259.0122463301},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.001, 0.01, 0.003],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/cube/main.rs","rank":46,"score":97873.43861361784},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.0, 0.0, -0.01],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/gltf/main.rs","rank":47,"score":97873.43861361784},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.001, 0.01, 0.003],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/pbr/main.rs","rank":48,"score":97873.43861361784},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tnode.borrow_rotation_mut()[2] += 0.01;\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/rotation/main.rs","rank":49,"score":97873.43861361784},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n) {\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/triangle/main.rs","rank":50,"score":97873.43861361784},{"content":"fn resize(\n\n\trenderer: &mut WGPURenderer,\n\n\tpools: &mut ResourcePools,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n\twidth: u32,\n\n\theight: u32,\n\n) {\n\n\tpools\n\n\t\t.borrow_mut::<PerspectiveCamera>()\n\n\t\t.borrow_mut(camera)\n\n\t\t.unwrap()\n\n\t\t.set_aspect(width as f32 / height as f32);\n\n\trenderer.set_size(width as f64, height as f64);\n\n}\n\n\n","file_path":"examples/texture/main.rs","rank":51,"score":97340.70491789754},{"content":"fn get_filter_mode(mode: &FilterMode) -> wgpu::FilterMode {\n\n\tmatch mode {\n\n\t\tFilterMode::Nearest => wgpu::FilterMode::Nearest,\n\n\t\tFilterMode::Linear => wgpu::FilterMode::Linear,\n\n\t}\n\n}\n","file_path":"src/renderer/wgpu_samplers.rs","rank":52,"score":96381.28381084147},{"content":"fn get_address_mode(mode: &WrapMode) -> wgpu::AddressMode {\n\n\tmatch mode {\n\n\t\tWrapMode::ClampToBorder => wgpu::AddressMode::ClampToBorder,\n\n\t\tWrapMode::ClampToEdge => wgpu::AddressMode::ClampToEdge,\n\n\t\tWrapMode::MirrorRepeat => wgpu::AddressMode::MirrorRepeat,\n\n\t\tWrapMode::Repeat => wgpu::AddressMode::Repeat,\n\n\t}\n\n}\n\n\n","file_path":"src/renderer/wgpu_samplers.rs","rank":53,"score":96381.28381084147},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tnode.borrow_rotation_mut()[1] += 0.01;\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[1]).unwrap();\n\n\t\tnode.borrow_rotation_mut()[1] += 0.01;\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"examples/face_culling/main.rs","rank":54,"score":95194.88371588291},{"content":"fn brdf(\n\n v: vec3<f32>,\n\n n: vec3<f32>,\n\n h: vec3<f32>,\n\n l: vec3<f32>,\n\n base_color: vec3<f32>,\n\n metallic: f32,\n\n roughness: f32\n\n) -> vec3<f32> {\n\n let black = vec3<f32>(0.0);\n\n let v_dot_h = dot(v, h);\n\n let n_dot_v = dot(v, n);\n\n let n_dot_l = dot(l, n);\n\n let n_dot_h = dot(n, h);\n\n\n\n let c_diff = mix(base_color, black, metallic);\n\n let f0 = mix(vec3<f32>(0.04), base_color, metallic);\n\n let alpha = pow(roughness, 2.0);\n\n\n\n let f = f0 + (1.0 - f0) * pow(1.0 - abs(v_dot_h), 5.0);\n","file_path":"src/material/node/brdf.rs","rank":55,"score":94324.68334401041},{"content":"fn parse_sampler(\n\n\tpools: &mut ResourcePools,\n\n\tsampler: &gltf::texture::Sampler,\n\n) -> ResourceId<Sampler> {\n\n\t// @TODO: Proper default values\n\n\tpools.borrow_mut::<Sampler>().add(Sampler::new(\n\n\t\tSamplerDescriptor {\n\n\t\t\tmag_filter: match sampler.mag_filter() {\n\n\t\t\t\tSome(filter) => match filter {\n\n\t\t\t\t\tgltf::texture::MagFilter::Nearest => FilterMode::Nearest,\n\n\t\t\t\t\tgltf::texture::MagFilter::Linear => FilterMode::Linear,\n\n\t\t\t\t},\n\n\t\t\t\tNone => FilterMode::Linear,\n\n\t\t\t},\n\n\t\t\tmin_filter: match sampler.min_filter() {\n\n\t\t\t\tSome(filter) => match filter {\n\n\t\t\t\t\tgltf::texture::MinFilter::Linear |\n\n\t\t\t\t\tgltf::texture::MinFilter::LinearMipmapLinear |\n\n\t\t\t\t\tgltf::texture::MinFilter::LinearMipmapNearest => FilterMode::Linear,\n\n\t\t\t\t\tgltf::texture::MinFilter::Nearest |\n","file_path":"src/utils/gltf_loader.rs","rank":56,"score":92735.58778190897},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.001, 0.01, 0.003],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"web/examples/cube/src/lib.rs","rank":57,"score":92704.00911235614},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tnode.borrow_rotation_mut()[2] += 0.01;\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"web/examples/rotation/src/lib.rs","rank":58,"score":92704.00911235614},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tVector3::add(\n\n\t\t\tnode.borrow_rotation_mut(),\n\n\t\t\t&[0.0, 0.0, 0.01],\n\n\t\t);\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"web/examples/gltf/src/lib.rs","rank":59,"score":92704.00911235614},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n) {\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"web/examples/triangle/src/lib.rs","rank":60,"score":92704.00911235614},{"content":"fn resize(\n\n\trenderer: &mut WGPUWebRenderer,\n\n\tpools: &mut ResourcePools,\n\n\tcamera: &ResourceId<PerspectiveCamera>,\n\n\twidth: u32,\n\n\theight: u32,\n\n) {\n\n\tpools\n\n\t\t.borrow_mut::<PerspectiveCamera>()\n\n\t\t.borrow_mut(camera)\n\n\t\t.unwrap()\n\n\t\t.set_aspect(width as f32 / height as f32);\n\n\trenderer.set_size(width as f64, height as f64);\n\n}\n\n\n","file_path":"web/examples/texture/src/lib.rs","rank":61,"score":92208.60286392165},{"content":"fn update(\n\n\tpools: &mut ResourcePools,\n\n\tscene: &ResourceId<Scene>,\n\n\tobjects: &Vec<ResourceId<Node>>,\n\n) {\n\n\t{\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\n\n\t\tnode.borrow_rotation_mut()[1] += 0.01;\n\n\t\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[1]).unwrap();\n\n\t\tnode.borrow_rotation_mut()[1] += 0.01;\n\n\t}\n\n\n\n\tpools.borrow::<Scene>()\n\n\t\t.borrow(scene)\n\n\t\t.unwrap()\n\n\t\t.update_matrices(pools);\n\n}\n\n\n","file_path":"web/examples/face_culling/src/lib.rs","rank":62,"score":90381.75697094772},{"content":"fn perturb_normal_to_arb(\n\n eye_pos: vec3<f32>,\n\n surf_norm: vec3<f32>,\n\n map_n: vec3<f32>,\n\n uv: vec2<f32>\n\n) -> vec3<f32> {\n\n let q0: vec3<f32> = vec3<f32>(dpdx(eye_pos.x), dpdx(eye_pos.y), dpdx(eye_pos.z));\n\n let q1: vec3<f32> = vec3<f32>(dpdy(eye_pos.x), dpdy(eye_pos.y), dpdy(eye_pos.z));\n\n let st0: vec2<f32> = dpdx(uv);\n\n let st1: vec2<f32> = dpdy(uv);\n\n let n: vec3<f32> = surf_norm; // normalized\n\n let q1perp: vec3<f32> = cross(q1, n);\n\n let q0perp: vec3<f32> = cross(n, q0);\n\n let t = q1perp * st0.x + q0perp * st1.x;\n\n let b = q1perp * st0.y + q0perp * st1.y;\n\n let det: f32 = max(dot(t, t), dot(b, b));\n\n var scale: f32;\n\n if (det == 0.0) {\n\n scale = 0.0;\n\n } else {\n","file_path":"src/material/node/tangent_to_object_normal.rs","rank":63,"score":85419.11996043095},{"content":"pub struct Attribute {\n\n\tcount: u32,\n\n\tdata: Vec<f32>,\n\n\t_item_size: u32,\n\n}\n\n\n\nimpl Attribute {\n\n\tpub fn new(data: Vec<f32>, item_size: u32) -> Self {\n\n\t\tAttribute {\n\n\t\t\tcount: data.len() as u32 / item_size,\n\n\t\t\tdata: data,\n\n\t\t\t_item_size: item_size,\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn get_count(&self) -> u32 {\n\n\t\tself.count\n\n\t}\n\n\n\n\tpub fn borrow_data(&self) -> &Vec<f32> {\n\n\t\t&self.data\n\n\t}\n\n}\n","file_path":"src/geometry/attribute.rs","rank":64,"score":77634.09900413945},{"content":"use crate::{\n\n\tgeometry::geometry::Geometry,\n\n\tmaterial::material::Material,\n\n\tresource::resource::ResourceId,\n\n};\n\n\n\n// @TODO: Support shared geometry and material\n\npub struct Mesh {\n\n\tgeometry: ResourceId<Geometry>,\n\n\tmaterial: ResourceId<Material>,\n\n}\n\n\n\nimpl Mesh {\n\n\tpub fn new(\n\n\t\tgeometry: ResourceId<Geometry>,\n\n\t\tmaterial: ResourceId<Material>,\n\n\t) -> Self {\n\n\t\tMesh {\n\n\t\t\tgeometry: geometry,\n\n\t\t\tmaterial: material,\n","file_path":"src/scene/mesh.rs","rank":65,"score":77446.29931381333},{"content":"\t\t}\n\n\t}\n\n\n\n\tpub fn borrow_geometry(&self) -> &ResourceId<Geometry> {\n\n\t\t&self.geometry\n\n\t}\n\n\n\n\tpub fn borrow_material(&self) -> &ResourceId<Material> {\n\n\t\t&self.material\n\n\t}\n\n}\n","file_path":"src/scene/mesh.rs","rank":66,"score":77433.01338074473},{"content":"use crate::math::matrix4::Matrix4;\n\n\n\npub struct PerspectiveCamera {\n\n\taspect: f32,\n\n\tfar: f32,\n\n\tfovy: f32,\n\n\tnear: f32,\n\n\tprojection_matrix: [f32; 16],\n\n\tprojection_matrix_inverse: [f32; 16],\n\n}\n\n\n\nimpl PerspectiveCamera {\n\n\tpub fn new(fovy: f32, aspect: f32, near: f32, far: f32) -> Self {\n\n\t\tlet mut camera = PerspectiveCamera {\n\n\t\t\taspect: aspect,\n\n\t\t\tfar: far,\n\n\t\t\tfovy: fovy,\n\n\t\t\tnear: near,\n\n\t\t\tprojection_matrix: Matrix4::create(),\n\n\t\t\tprojection_matrix_inverse: Matrix4::create(),\n","file_path":"src/scene/camera.rs","rank":67,"score":77420.90936437386},{"content":"\t\t};\n\n\t\tcamera.update_projection_matrix();\n\n\t\tcamera\n\n\t}\n\n\n\n\tpub fn set_aspect(&mut self, aspect: f32) -> &mut Self {\n\n\t\tself.aspect = aspect;\n\n\t\tself.update_projection_matrix();\n\n\t\tself\n\n\t}\n\n\n\n\tpub fn update_projection_matrix(&mut self) {\n\n\t\tMatrix4::make_perspective(\n\n\t\t\t&mut self.projection_matrix,\n\n\t\t\tself.fovy,\n\n\t\t\tself.aspect,\n\n\t\t\tself.near,\n\n\t\t\tself.far,\n\n\t\t);\n\n\t\tMatrix4::invert(\n","file_path":"src/scene/camera.rs","rank":68,"score":77418.33961188242},{"content":"\t\t\tMatrix4::copy(&mut self.projection_matrix_inverse, &self.projection_matrix)\n\n\t\t);\n\n\t}\n\n\n\n\tpub fn borrow_projection_matrix(&self) -> &[f32; 16] {\n\n\t\t&self.projection_matrix\n\n\t}\n\n\n\n\tpub fn borrow_projection_matrix_inverse(&self) -> &[f32; 16] {\n\n\t\t&self.projection_matrix_inverse\n\n\t}\n\n}","file_path":"src/scene/camera.rs","rank":69,"score":77406.64795769964},{"content":"\n\npub struct SamplerDescriptor {\n\n\tpub mag_filter: FilterMode,\n\n\tpub min_filter: FilterMode,\n\n\tpub mipmap_filter: FilterMode,\n\n\tpub wrap_u: WrapMode,\n\n\tpub wrap_v: WrapMode,\n\n\tpub wrap_w: WrapMode,\n\n}\n\n\n\nimpl Default for SamplerDescriptor {\n\n\tfn default() -> Self {\n\n\t\tSamplerDescriptor {\n\n\t\t\tmag_filter: FilterMode::Linear,\n\n\t\t\tmin_filter: FilterMode::Linear,\n\n\t\t\tmipmap_filter: FilterMode::Linear,\n\n\t\t\twrap_u: WrapMode::ClampToEdge,\n\n\t\t\twrap_v: WrapMode::ClampToEdge,\n\n\t\t\twrap_w: WrapMode::ClampToEdge,\n\n\t\t}\n","file_path":"src/texture/sampler.rs","rank":70,"score":77018.30944355075},{"content":"\t}\n\n}\n\n\n\nimpl Sampler {\n\n\tpub fn new(desc: SamplerDescriptor) -> Self {\n\n\t\t// @TODO: Fix default parameters\n\n\t\tSampler {\n\n\t\t\tmag_filter: desc.mag_filter,\n\n\t\t\tmin_filter: desc.min_filter,\n\n\t\t\tmipmap_filter: desc.mipmap_filter,\n\n\t\t\twrap_u: desc.wrap_u,\n\n\t\t\twrap_v: desc.wrap_v,\n\n\t\t\twrap_w: desc.wrap_w,\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn mag_filter(&self) -> &FilterMode {\n\n\t\t&self.mag_filter\n\n\t}\n\n\n","file_path":"src/texture/sampler.rs","rank":71,"score":77016.62558976865},{"content":"pub enum WrapMode {\n\n\tClampToBorder,\n\n\tClampToEdge,\n\n\tMirrorRepeat,\n\n\tRepeat,\n\n}\n\n\n\npub enum FilterMode {\n\n\tLinear,\n\n\tNearest,\t\n\n}\n\n\n\npub struct Sampler {\n\n\tmag_filter: FilterMode,\n\n\tmin_filter: FilterMode,\n\n\tmipmap_filter: FilterMode,\n\n\twrap_u: WrapMode,\n\n\twrap_v: WrapMode,\n\n\twrap_w: WrapMode,\n\n}\n","file_path":"src/texture/sampler.rs","rank":72,"score":77010.95147842962},{"content":"\tpub fn min_filter(&self) -> &FilterMode {\n\n\t\t&self.min_filter\n\n\t}\n\n\n\n\tpub fn mipmap_filter(&self) -> &FilterMode {\n\n\t\t&self.mipmap_filter\n\n\t}\n\n\n\n\tpub fn wrap_u(&self) -> &WrapMode {\n\n\t\t&self.wrap_u\n\n\t}\n\n\n\n\tpub fn wrap_v(&self) -> &WrapMode {\n\n\t\t&self.wrap_v\n\n\t}\n\n\n\n\tpub fn wrap_w(&self) -> &WrapMode {\n\n\t\t&self.wrap_w\n\n\t}\n\n}\n","file_path":"src/texture/sampler.rs","rank":73,"score":77008.94144487928},{"content":"\tscale: [f32; 3],\n\n\tworld_matrix: [f32; 16],\n\n}\n\n\n\nimpl Node {\n\n\tpub fn new() -> Self {\n\n\t\tNode {\n\n\t\t\tchildren: Vec::new(),\n\n\t\t\tmatrix: Matrix4::create(),\n\n\t\t\tparent: None,\n\n\t\t\tposition: Vector3::create(),\n\n\t\t\tquaternion: Quaternion::create(),\n\n\t\t\trotation: Euler::create(),\n\n\t\t\tscale: *Vector3::set(&mut Vector3::create(), 1.0, 1.0, 1.0),\n\n\t\t\tworld_matrix: Matrix4::create(),\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn borrow_parent(&self) -> Option<&ResourceId<Node>> {\n\n\t\tself.parent.as_ref()\n","file_path":"src/scene/node.rs","rank":74,"score":76367.60965933325},{"content":"impl NodeExecutor {\n\n\tpub fn update_matrices(\n\n\t\tpool: &mut ResourcePool<Node>,\n\n\t\troot: &ResourceId<Node>,\n\n\t) {\n\n\t\tlet mut stack = Vec::new();\n\n\t\tstack.push(*root);\n\n\n\n\t\twhile let Some(rid) = stack.pop() {\n\n\t\t\tlet node = pool.borrow_mut(&rid).unwrap();\n\n\t\t\tnode.update_matrix();\n\n\n\n\t\t\tlet parent_matrix = {\n\n\t\t\t\tlet mut matrix = Matrix4::create();\n\n\t\t\t\tlet node = pool.borrow_mut(&rid).unwrap();\n\n\t\t\t\tif let Some(parent) = node.borrow_parent().cloned() {\n\n\t\t\t\t\tMatrix4::copy(&mut matrix, pool.borrow(&parent).unwrap().borrow_world_matrix());\n\n\t\t\t\t}\n\n\t\t\t\tmatrix\n\n\t\t\t};\n","file_path":"src/scene/node.rs","rank":75,"score":76365.42091998825},{"content":"\t\tMatrix4::decompose(&mut self.position, &mut self.quaternion, &mut self.scale, &self.matrix);\n\n\t\tEuler::set_from_quaternion(&mut self.rotation, &self.quaternion);\n\n\t\tself\n\n\t}\n\n\n\n\tpub fn set_world_matrix(&mut self, matrix: &[f32; 16]) -> &mut Self {\n\n\t\tMatrix4::copy(&mut self.world_matrix, matrix);\n\n\t\tself\n\n\t}\n\n\n\n\tpub fn update_matrix(&mut self) -> &mut Self {\n\n\t\tQuaternion::set_from_euler(&mut self.quaternion, &self.rotation);\n\n\t\tMatrix4::compose(&mut self.matrix, &self.position, &self.quaternion, &self.scale);\n\n\t\tself\n\n\t}\n\n\n\n\t// @TODO: Optimize\n\n\tpub fn update_matrices(\n\n\t\t&mut self,\n\n\t\tpool: &mut ResourcePool<Node>,\n","file_path":"src/scene/node.rs","rank":76,"score":76363.30749713788},{"content":"use crate::{\n\n\tmath::{\n\n\t\teuler::Euler,\n\n\t\tmatrix4::Matrix4,\n\n\t\tquaternion::Quaternion,\n\n\t\tvector3::Vector3,\n\n\t},\n\n\tresource::resource::{\n\n\t\tResourceId,\n\n\t\tResourcePool,\n\n\t},\n\n};\n\n\n\npub struct Node {\n\n\tchildren: Vec<ResourceId<Node>>,\n\n\tmatrix: [f32; 16],\n\n\tparent: Option<ResourceId<Node>>,\n\n\tposition: [f32; 3],\n\n\tquaternion: [f32; 4],\n\n\trotation: [f32; 3],\n","file_path":"src/scene/node.rs","rank":77,"score":76360.94011609847},{"content":"\n\n\t\t\tlet node = pool.borrow_mut(&rid).unwrap();\n\n\t\t\tlet mut matrix = Matrix4::create();\n\n\t\t\tMatrix4::multiply(&mut matrix, &parent_matrix, &node.borrow_matrix());\n\n\t\t\tnode.set_world_matrix(&matrix);\n\n\n\n\t\t\tfor child in node.children.iter() {\n\n\t\t\t\tstack.push(*child);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn collect_nodes(\n\n\t\tpool: &ResourcePool<Node>,\n\n\t\troot: &ResourceId<Node>,\n\n\t\tnodes: &mut Vec<ResourceId<Node>>,\n\n\t) {\n\n\t\tlet mut stack = Vec::new();\n\n\t\tstack.push(*root);\n\n\t\tnodes.push(*root);\n","file_path":"src/scene/node.rs","rank":78,"score":76360.15507137305},{"content":"\t\t\t\tlet parent = node.borrow_parent().cloned().unwrap();\n\n\t\t\t\tMatrix4::copy(&mut matrix, pool.borrow(&parent).unwrap().borrow_world_matrix());\n\n\t\t\t\tmatrix\n\n\t\t\t};\n\n\n\n\t\t\tlet node = pool.borrow_mut(&rid).unwrap();\n\n\t\t\tlet mut matrix = Matrix4::create();\n\n\t\t\tMatrix4::multiply(&mut matrix, &parent_matrix, &node.borrow_matrix());\n\n\t\t\tnode.set_world_matrix(&matrix);\n\n\n\n\t\t\tfor child in node.children.iter() {\n\n\t\t\t\tstack.push(*child);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\npub struct NodeExecutor {\n\n}\n\n\n","file_path":"src/scene/node.rs","rank":79,"score":76359.57641523512},{"content":"\t) {\n\n\t\tself.update_matrix();\n\n\n\n\t\tif let Some(parent) = self.borrow_parent() {\n\n\t\t\tlet parent_matrix = pool.borrow(parent).unwrap().borrow_world_matrix();\n\n\t\t\tMatrix4::multiply(&mut self.world_matrix, parent_matrix, &self.matrix);\n\n\t\t} else {\n\n\t\t\tMatrix4::copy(&mut self.world_matrix, &self.matrix);\n\n\t\t}\n\n\n\n\t\tlet mut stack = Vec::new();\n\n\n\n\t\tfor child in self.children.iter() {\n\n\t\t\tstack.push(*child);\n\n\t\t}\n\n\n\n\t\twhile let Some(rid) = stack.pop() {\n\n\t\t\tlet parent_matrix = {\n\n\t\t\t\tlet mut matrix = Matrix4::create();\n\n\t\t\t\tlet node = pool.borrow_mut(&rid).unwrap();\n","file_path":"src/scene/node.rs","rank":80,"score":76357.72722305731},{"content":"\t}\n\n\n\n\tpub fn borrow_children(&self) -> &Vec<ResourceId<Node>> {\n\n\t\t&self.children\n\n\t}\n\n\n\n\tpub fn borrow_position(&self) -> &[f32; 3] {\n\n\t\t&self.position\n\n\t}\n\n\n\n\tpub fn borrow_position_mut(&mut self) -> &mut [f32; 3] {\n\n\t\t&mut self.position\n\n\t}\n\n\n\n\tpub fn borrow_rotation(&self) -> &[f32; 3] {\n\n\t\t&self.rotation\n\n\t}\n\n\n\n\tpub fn borrow_rotation_mut(&mut self) -> &mut [f32; 3] {\n\n\t\t&mut self.rotation\n","file_path":"src/scene/node.rs","rank":81,"score":76355.7669852712},{"content":"\t}\n\n\n\n\tpub fn borrow_scale(&self) -> &[f32; 3] {\n\n\t\t&self.scale\n\n\t}\n\n\n\n\tpub fn borrow_scale_mut(&mut self) -> &mut [f32; 3] {\n\n\t\t&mut self.scale\n\n\t}\n\n\n\n\tpub fn borrow_matrix(&self) -> &[f32; 16] {\n\n\t\t&self.matrix\n\n\t}\n\n\n\n\tpub fn borrow_world_matrix(&self) -> &[f32; 16] {\n\n\t\t&self.world_matrix\n\n\t}\n\n\n\n\tpub fn set_matrix(&mut self, matrix: &[f32; 16]) -> &mut Self {\n\n\t\tMatrix4::copy(&mut self.matrix, matrix);\n","file_path":"src/scene/node.rs","rank":82,"score":76355.736092539},{"content":"\n\n\t\twhile let Some(rid) = stack.pop() {\n\n\t\t\tlet node = pool.borrow(&rid).unwrap();\n\n\t\t\tfor child in node.children.iter() {\n\n\t\t\t\tstack.push(*child);\n\n\t\t\t\tnodes.push(*child);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n","file_path":"src/scene/node.rs","rank":83,"score":76351.3536872573},{"content":"fn d_ggx(n_dot_h: f32, roughness: f32) -> f32 {\n\n let a: f32 = n_dot_h * roughness;\n\n let k: f32 = roughness / (1.0 - pow(n_dot_h, 2.0) + pow(a, 2.0));\n\n return pow(k, 2.0) * (1.0 / PI);\n\n}\n\n\n","file_path":"src/material/node/brdf.rs","rank":84,"score":73200.4285927179},{"content":"use std::collections::HashMap;\n\nuse crate::{\n\n\tmaterial::node::node::{\n\n\t\tMaterialNode,\n\n\t\tUniformContents,\n\n\t},\n\n\tresource::resource::{\n\n\t\tResourceId,\n\n\t\tResourcePool,\n\n\t},\n\n\ttexture::{\n\n\t\tsampler::Sampler,\n\n\t\ttexture::Texture,\n\n\t}\n\n};\n\n\n\npub struct TextureNode {\n\n\tcontents: UniformContents,\n\n}\n\n\n","file_path":"src/material/node/texture.rs","rank":85,"score":73190.79198269045},{"content":"impl TextureNode {\n\n\tpub fn new(\n\n\t\ttexture: ResourceId<Texture>,\n\n\t\tsampler: ResourceId<Sampler>,\n\n\t) -> Self {\n\n\t\tTextureNode {\n\n\t\t\tcontents: UniformContents::Texture {\n\n\t\t\t\tsampler: sampler,\n\n\t\t\t\ttexture: texture,\n\n\t\t\t},\n\n\t\t}\n\n\t}\n\n\n\n\tfn get_texture_name(&self) -> String {\n\n\t\tmatch self.contents {\n\n\t\t\tUniformContents::Texture{texture, ..} => {\n\n\t\t\t\tformat!(\"texture_{}\", texture.id)\n\n\t\t\t},\n\n\t\t\t_ => panic!(),\t\t\n\n\t\t}\n","file_path":"src/material/node/texture.rs","rank":86,"score":73189.59824959656},{"content":"\t}\n\n\n\n\tfn get_sampler_name(&self) -> String {\n\n\t\tmatch self.contents {\n\n\t\t\tUniformContents::Texture{sampler, ..} => {\n\n\t\t\t\tformat!(\"sampler_{}\", sampler.id)\n\n\t\t\t},\n\n\t\t\t_ => panic!(),\t\t\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl MaterialNode for TextureNode {\n\n\tfn collect_nodes (\n\n\t\t&self,\n\n\t\t_pool: &ResourcePool<Box<dyn MaterialNode>>,\n\n\t\tnodes: &mut Vec<ResourceId<Box<dyn MaterialNode>>>,\n\n\t\tvisited: &mut HashMap<ResourceId<Box<dyn MaterialNode>>, bool>,\n\n\t\tself_rid: ResourceId<Box<dyn MaterialNode>>,\n\n\t) {\n","file_path":"src/material/node/texture.rs","rank":87,"score":73188.15781734262},{"content":"\t\t_pool: &ResourcePool<Box<dyn MaterialNode>>,\n\n\t\tvisited: &mut HashMap<usize, bool>,\n\n\t\tself_id: usize,\n\n\t) -> String {\n\n\t\tif visited.contains_key(&self_id) {\n\n\t\t\treturn \"\".to_string();\n\n\t\t}\n\n\t\tvisited.insert(self_id, true);\n\n\n\n\t\tformat!(\"let {} = textureSample({}, {}, in.uv);\\n\",\n\n\t\t\tself.get_fragment_output(self_id),\n\n\t\t\tself.get_texture_name(),\n\n\t\t\tself.get_sampler_name(),\n\n\t\t)\n\n\t}\n\n\n\n\tfn get_fragment_output(&self, self_id: usize) -> String {\n\n\t\tformat!(\"texture_output_{}\", self_id)\n\n\t}\n\n}\n","file_path":"src/material/node/texture.rs","rank":88,"score":73179.79499744785},{"content":"\t\tif !visited.contains_key(&self_rid) {\n\n\t\t\tvisited.insert(self_rid, true);\n\n\t\t\tnodes.push(self_rid);\n\n\t\t}\n\n\t}\n\n\n\n\tfn borrow_contents(&self) -> Option<&UniformContents> {\n\n\t\tSome(&self.contents)\n\n\t}\n\n\n\n\tfn build_declaration(&self, _self_id: usize) -> String {\n\n\t\tformat!(\"\")\n\n\t}\n\n\n\n\tfn build_functions(&self, _self_id: usize) -> String {\n\n\t\tformat!(\"\")\n\n\t}\n\n\n\n\tfn build_fragment_shader(\n\n\t\t&self,\n","file_path":"src/material/node/texture.rs","rank":89,"score":73175.32736169538},{"content":"let wasm;\n","file_path":"web/examples/texture/wgpu_rust_renderer_example_texture.js","rank":90,"score":72877.90058596316},{"content":"const heap = new Array(32).fill(undefined);\n","file_path":"web/examples/texture/wgpu_rust_renderer_example_texture.js","rank":91,"score":72877.90058596316},{"content":"// @TODO: Should we reuse wgpu_attributes?\n\n\n\nuse std::collections::HashMap;\n\n\n\nuse crate::{\n\n\tgeometry::index::Index,\n\n\tresource::resource::{\n\n\t\tResourceId,\n\n\t\tResourcePools,\n\n\t},\n\n};\n\n\n\npub struct WGPUIndices {\n\n\tindices: HashMap<ResourceId<Index>, wgpu::Buffer>,\n\n}\n\n\n\nimpl WGPUIndices {\n\n\tpub fn new() -> Self {\n\n\t\tWGPUIndices {\n\n\t\t\tindices: HashMap::new()\n","file_path":"src/renderer/wgpu_indices.rs","rank":92,"score":72544.28742136262},{"content":"\t\t}\n\n\t}\n\n\n\n\tpub fn borrow(&self, index: &ResourceId<Index>) -> Option<&wgpu::Buffer> {\n\n\t\tself.indices.get(index)\n\n\t}\n\n\n\n\t// @TODO: Implement correctly\n\n\tpub fn update(\n\n\t\t&mut self,\n\n\t\tdevice: &wgpu::Device,\n\n\t\tpools: &ResourcePools,\n\n\t\tindex_rid: &ResourceId<Index>,\n\n\t) {\n\n\t\tif !self.indices.contains_key(index_rid) {\n\n\t\t\tif let Some(index) = pools.borrow::<Index>().borrow(index_rid) {\n\n\t\t\t\tself.indices.insert(*index_rid, create_buffer(\n\n\t\t\t\t\tdevice,\n\n\t\t\t\t\tbytemuck::cast_slice(index.borrow_data()),\n\n\t\t\t\t\twgpu::BufferUsages::INDEX,\n\n\t\t\t\t));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n\n// @TODO: Remove duplication with wgpu_attributes.rs\n","file_path":"src/renderer/wgpu_indices.rs","rank":93,"score":72543.76250626182},{"content":"\n\n\tpub fn borrow(&self, attribute: &ResourceId<Attribute>) -> Option<&wgpu::Buffer> {\n\n\t\tself.attributes.get(attribute)\n\n\t}\n\n\n\n\t// @TODO: Implement correctly\n\n\tpub fn update(\n\n\t\t&mut self,\n\n\t\tdevice: &wgpu::Device,\n\n\t\tpools: &ResourcePools,\n\n\t\tattribute_rid: &ResourceId<Attribute>,\n\n\t) {\n\n\t\tif !self.attributes.contains_key(attribute_rid) {\n\n\t\t\tif let Some(attribute) = pools.borrow::<Attribute>().borrow(attribute_rid) {\n\n\t\t\t\tself.attributes.insert(*attribute_rid, create_buffer(\n\n\t\t\t\t\tdevice,\n\n\t\t\t\t\tbytemuck::cast_slice(attribute.borrow_data()),\n\n\t\t\t\t\twgpu::BufferUsages::VERTEX,\n\n\t\t\t\t));\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n\n\n","file_path":"src/renderer/wgpu_attributes.rs","rank":94,"score":72532.56929052985},{"content":"use std::collections::HashMap;\n\n\n\nuse crate::{\n\n\tgeometry::attribute::Attribute,\n\n\tresource::resource::{\n\n\t\tResourceId,\n\n\t\tResourcePools,\n\n\t},\n\n};\n\n\n\npub struct WGPUAttributes {\n\n\tattributes: HashMap<ResourceId<Attribute>, wgpu::Buffer>,\n\n}\n\n\n\nimpl WGPUAttributes {\n\n\tpub fn new() -> Self {\n\n\t\tWGPUAttributes {\n\n\t\t\tattributes: HashMap::new()\n\n\t\t}\n\n\t}\n","file_path":"src/renderer/wgpu_attributes.rs","rank":95,"score":72531.38727172681},{"content":"\n\nimpl WGPUSamplers {\n\n\tpub fn new() -> Self {\n\n\t\tWGPUSamplers {\n\n\t\t\tsamplers: HashMap::new(),\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn borrow(&self, sampler: &ResourceId<Sampler>) -> Option<&wgpu::Sampler> {\n\n\t\tself.samplers.get(sampler)\n\n\t}\n\n\n\n\t// @TODO: Implement correctly\n\n\tfn update(\n\n\t\t&mut self,\n\n\t\tdevice: &wgpu::Device,\n\n\t\tpools: &ResourcePools,\n\n\t\tsampler_rid: &ResourceId<Sampler>,\n\n\t) {\n\n\t\tif !self.samplers.contains_key(sampler_rid) {\n","file_path":"src/renderer/wgpu_samplers.rs","rank":96,"score":72454.5830114713},{"content":"\t\t\tif let Some(sampler) = pools.borrow::<Sampler>().borrow(sampler_rid) {\n\n\t\t\t\tlet sampler_gpu = create_sampler(\n\n\t\t\t\t\tdevice,\n\n\t\t\t\t\tsampler,\n\n\t\t\t\t);\n\n\t\t\t\tself.samplers.insert(*sampler_rid, sampler_gpu);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn update_from_material(\n\n\t\t&mut self,\n\n\t\tdevice: &wgpu::Device,\n\n\t\tpools: &ResourcePools,\n\n\t\tmaterial: &Material,\n\n\t) {\n\n\t\tlet samplers = material.borrow_samplers(\n\n\t\t\tpools.borrow::<Box<dyn MaterialNode>>(),\n\n\t\t);\n\n\t\tfor sampler in samplers.iter() {\n\n\t\t\tself.update(device, pools, sampler);\n\n\t\t}\n\n\t}\n\n}\n\n\n","file_path":"src/renderer/wgpu_samplers.rs","rank":97,"score":72453.39672659535},{"content":"use std::collections::HashMap;\n\nuse crate::{\n\n\tmaterial::{\n\n\t\tmaterial::Material,\n\n\t\tnode::node::MaterialNode,\n\n\t},\n\n\tresource::resource::{\n\n\t\tResourceId,\n\n\t\tResourcePools,\n\n\t},\n\n\ttexture::sampler::{\n\n\t\tFilterMode,\n\n\t\tSampler,\n\n\t\tWrapMode,\n\n\t},\n\n};\n\n\n\npub struct WGPUSamplers {\n\n\tsamplers: HashMap<ResourceId<Sampler>, wgpu::Sampler>,\n\n}\n","file_path":"src/renderer/wgpu_samplers.rs","rank":98,"score":72449.85011651514},{"content":"\t\t\tgroups: HashMap::new()\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn borrow(&self, node: &ResourceId<Node>) -> Option<&WGPUBinding> {\n\n\t\tself.groups.get(node)\n\n\t}\n\n\n\n\tpub fn update(&mut self,\n\n\t\tdevice: &wgpu::Device,\n\n\t\tqueue: &wgpu::Queue,\n\n\t\twgpu_textures: &WGPUTextures,\n\n\t\twgpu_samplers: &WGPUSamplers,\n\n\t\tpools: &ResourcePools,\n\n\t\tnode_rid: &ResourceId<Node>,\n\n\t\tcamera: &PerspectiveCamera,\n\n\t\tcamera_node: &Node,\n\n\t\tmaterial: &Material,\n\n\t) {\n\n\t\tif !self.groups.contains_key(node_rid) {\n","file_path":"src/renderer/wgpu_bindings.rs","rank":99,"score":72326.72906528244}],"string":"[\n {\n \"content\": \"pub fn get_window_device_pixel_ratio() -> f64 {\\n\\n\\tlet window = web_sys::window().unwrap();\\n\\n\\twindow.device_pixel_ratio()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/utils/window.rs\",\n \"rank\": 0,\n \"score\": 218816.77958122682\n },\n {\n \"content\": \"pub fn get_window_inner_size() -> (f64, f64) {\\n\\n\\tlet window = web_sys::window().unwrap();\\n\\n\\t(\\n\\n\\t\\twindow.inner_width().unwrap().as_f64().unwrap(),\\n\\n\\t\\twindow.inner_height().unwrap().as_f64().unwrap()\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/utils/window.rs\",\n \"rank\": 1,\n \"score\": 202281.6631094451\n },\n {\n \"content\": \"// @TODO: Remove duplication with wgpu_attributes.rs\\n\\nfn create_buffer(device: &wgpu::Device, contents: &[u8], usage: wgpu::BufferUsages) -> wgpu::Buffer {\\n\\n\\tuse wgpu::util::DeviceExt;\\n\\n\\tdevice.create_buffer_init(&wgpu::util::BufferInitDescriptor {\\n\\n\\t\\tlabel: None,\\n\\n\\t\\tcontents: contents,\\n\\n\\t\\tusage: usage,\\n\\n\\t})\\n\\n}\\n\",\n \"file_path\": \"src/renderer/wgpu_indices.rs\",\n \"rank\": 2,\n \"score\": 179608.97366765174\n },\n {\n \"content\": \"fn create_buffer(device: &wgpu::Device, contents: &[u8], usage: wgpu::BufferUsages) -> wgpu::Buffer {\\n\\n\\tuse wgpu::util::DeviceExt;\\n\\n\\tdevice.create_buffer_init(&wgpu::util::BufferInitDescriptor {\\n\\n\\t\\tlabel: None,\\n\\n\\t\\tcontents: contents,\\n\\n\\t\\tusage: usage,\\n\\n\\t})\\n\\n}\\n\",\n \"file_path\": \"src/renderer/wgpu_attributes.rs\",\n \"rank\": 3,\n \"score\": 179597.23967667524\n },\n {\n \"content\": \"fn get_wgpu_format(format: &TextureFormat) -> wgpu::TextureFormat {\\n\\n\\tmatch format {\\n\\n\\t\\tTextureFormat::Float => wgpu::TextureFormat::Rgba32Float,\\n\\n\\t\\tTextureFormat::Uint8 => wgpu::TextureFormat::Rgba8Unorm,\\n\\n\\t\\tTextureFormat::Uint8Srgb => wgpu::TextureFormat::Rgba8UnormSrgb,\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/renderer/wgpu_textures.rs\",\n \"rank\": 4,\n \"score\": 177289.25852096808\n },\n {\n \"content\": \"// @TODO: Write comment\\n\\nfn cast_pool_mut_unsafe<T: 'static>(pool: &Box<dyn ResourcePoolTrait>) -> &mut ResourcePool<T> {\\n\\n\\tlet ptr = cast_pool(pool.as_ref())\\n\\n\\t\\tas *const ResourcePool<T> as *mut ResourcePool<T>;\\n\\n\\tunsafe { transmute(ptr) }\\n\\n}\\n\\n\\n\\nimpl<T: 'static> ResourcePool<T> {\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tResourcePool {\\n\\n\\t\\t\\tresources: Vec::new(),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn add(&mut self, resource: T) -> ResourceId<T> {\\n\\n\\t\\tlet id = self.resources.len();\\n\\n\\t\\tself.resources.push(resource);\\n\\n\\t\\tResourceId::new(id)\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow(&self, r_id: &ResourceId<T>) -> Option<&T> {\\n\",\n \"file_path\": \"src/resource/resource.rs\",\n \"rank\": 5,\n \"score\": 171925.47084891915\n },\n {\n \"content\": \"fn create_sampler(\\n\\n\\tdevice: &wgpu::Device,\\n\\n\\tsampler: &Sampler,\\n\\n) -> wgpu::Sampler {\\n\\n\\t// @TODO: Fix me\\n\\n\\tdevice.create_sampler(&wgpu::SamplerDescriptor {\\n\\n\\t\\taddress_mode_u: get_address_mode(sampler.wrap_u()),\\n\\n\\t\\taddress_mode_v: get_address_mode(sampler.wrap_v()),\\n\\n\\t\\taddress_mode_w: get_address_mode(sampler.wrap_w()),\\n\\n\\t\\tanisotropy_clamp: None,\\n\\n\\t\\tborder_color: None,\\n\\n\\t\\tcompare: None,\\n\\n\\t\\tmag_filter: get_filter_mode(sampler.mag_filter()),\\n\\n\\t\\tmin_filter: get_filter_mode(sampler.min_filter()),\\n\\n\\t\\tmipmap_filter: get_filter_mode(sampler.mipmap_filter()),\\n\\n\\t\\tlabel: None,\\n\\n\\t\\tlod_max_clamp: 0.0,\\n\\n \\t\\tlod_min_clamp: 0.0,\\n\\n\\t})\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_samplers.rs\",\n \"rank\": 6,\n \"score\": 169999.79491284228\n },\n {\n \"content\": \"fn create_texture(\\n\\n\\tdevice: &wgpu::Device,\\n\\n\\twidth: u32,\\n\\n\\theight: u32,\\n\\n\\tformat: wgpu::TextureFormat\\n\\n) -> wgpu::Texture {\\n\\n\\tdevice.create_texture(&wgpu::TextureDescriptor {\\n\\n\\t\\tlabel: None,\\n\\n\\t\\tsize: wgpu::Extent3d {\\n\\n\\t\\t\\twidth: width,\\n\\n\\t\\t\\theight: height,\\n\\n\\t\\t\\tdepth_or_array_layers: 1,\\n\\n },\\n\\n\\t\\tmip_level_count: 1,\\n\\n\\t\\tsample_count: 1,\\n\\n\\t\\tdimension: wgpu::TextureDimension::D2,\\n\\n\\t\\tformat: format,\\n\\n\\t\\tusage: wgpu::TextureUsages::TEXTURE_BINDING | wgpu::TextureUsages::COPY_DST,\\n\\n\\t})\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_textures.rs\",\n \"rank\": 7,\n \"score\": 169321.40649253016\n },\n {\n \"content\": \"fn cast_pool_mut<T: 'static>(pool: &mut dyn ResourcePoolTrait) -> &mut ResourcePool<T> {\\n\\n\\tpool\\n\\n\\t\\t.as_any_mut()\\n\\n\\t\\t.downcast_mut::<ResourcePool<T>>()\\n\\n\\t\\t.unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/resource.rs\",\n \"rank\": 8,\n \"score\": 163091.72919276112\n },\n {\n \"content\": \"pub fn create_window(event_loop: &EventLoop<()>) -> std::rc::Rc<winit::window::Window> {\\n\\n\\tlet window = winit::window::Window::new(&event_loop).unwrap();\\n\\n\\tlet window = std::rc::Rc::new(window);\\n\\n\\n\\n\\t// winit::window::Window doesn't seem to detect browser's onresize event so we emulate it.\\n\\n {\\n\\n\\t\\tlet window = window.clone();\\n\\n\\t\\tlet closure = Closure::wrap(Box::new(move |_e: web_sys::Event| {\\n\\n\\t\\t\\tlet size = get_window_inner_size();\\n\\n\\t\\t\\twindow.set_inner_size(winit::dpi::PhysicalSize::new(\\n\\n\\t\\t\\t\\tsize.0, size.1,\\n\\n\\t\\t\\t));\\n\\n\\t\\t}) as Box<dyn FnMut(_)>);\\n\\n\\t\\tweb_sys::window()\\n\\n\\t\\t\\t.unwrap()\\n\\n\\t\\t\\t.add_event_listener_with_callback(\\\"resize\\\", closure.as_ref().unchecked_ref())\\n\\n\\t\\t\\t.unwrap();\\n\\n\\t\\tclosure.forget();\\n\\n }\\n\\n\\n\\n\\twindow\\n\\n}\\n\",\n \"file_path\": \"web/examples/utils/window.rs\",\n \"rank\": 9,\n \"score\": 161337.05906842422\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/texture/main.rs\",\n \"rank\": 10,\n \"score\": 159645.46964923147\n },\n {\n \"content\": \"fn create_buffer(device: &wgpu::Device, size_in_byte: usize) -> wgpu::Buffer {\\n\\n\\tuse wgpu::util::DeviceExt;\\n\\n\\tdevice.create_buffer_init(&wgpu::util::BufferInitDescriptor {\\n\\n\\t\\tlabel: None,\\n\\n\\t\\tcontents: bytemuck::cast_slice(&vec![0.0; size_in_byte / 4]),\\n\\n\\t\\tusage: wgpu::BufferUsages::UNIFORM | wgpu::BufferUsages::COPY_DST,\\n\\n\\t})\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_bindings.rs\",\n \"rank\": 11,\n \"score\": 155762.63105445803\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[wasm_bindgen(start)]\\n\\npub async fn start() {\\n\\n\\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\\n\\n\\tconsole_log::init().expect(\\\"could not initialize logger\\\");\\n\\n\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = create_window(&event_loop);\\n\\n\\n\\n\\tuse winit::platform::web::WindowExtWebSys;\\n\\n\\n\\n\\tweb_sys::window()\\n\",\n \"file_path\": \"web/examples/texture/src/lib.rs\",\n \"rank\": 12,\n \"score\": 152054.51290581445\n },\n {\n \"content\": \"fn upload_texture(\\n\\n\\tqueue: &wgpu::Queue,\\n\\n\\ttexture: &wgpu::Texture,\\n\\n\\twidth: u32,\\n\\n\\theight: u32,\\n\\n\\ttexels: &[u8],\\n\\n) {\\n\\n\\tqueue.write_texture(\\n\\n\\t\\ttexture.as_image_copy(),\\n\\n\\t\\t&texels,\\n\\n\\t\\twgpu::ImageDataLayout {\\n\\n\\t\\t\\toffset: 0,\\n\\n\\t\\t\\t// @TODO: Fix me\\n\\n\\t\\t\\tbytes_per_row: Some(std::num::NonZeroU32::new(width * 4).unwrap()),\\n\\n\\t\\t\\trows_per_image: None,\\n\\n\\t\\t},\\n\\n\\t\\twgpu::Extent3d {\\n\\n\\t\\t\\twidth: width,\\n\\n\\t\\t\\theight: height,\\n\\n\\t\\t\\tdepth_or_array_layers: 1,\\n\\n },\\n\\n\\t);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_textures.rs\",\n \"rank\": 13,\n \"score\": 134665.70019296027\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.0, 0.01, 0.0],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/texture/main.rs\",\n \"rank\": 14,\n \"score\": 134641.7375334434\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\twindow: &Window,\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_box(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 0.5, 0.5, 1.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\",\n \"file_path\": \"examples/cube/main.rs\",\n \"rank\": 17,\n \"score\": 130886.17460341491\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\twindow: &Window,\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>) {\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_triangle(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 1.0, 0.0, 0.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\\n\\tlet node = pools.borrow_mut::<Node>().add(Node::new());\\n\\n\\tscene.add_node(&node);\\n\",\n \"file_path\": \"examples/triangle/main.rs\",\n \"rank\": 18,\n \"score\": 130886.17460341491\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\twindow: &Window,\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_plane(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\\n\\tlet node = pools.borrow_mut::<Node>().add(Node::new());\\n\",\n \"file_path\": \"examples/rotation/main.rs\",\n \"rank\": 19,\n \"score\": 130886.17460341491\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\twindow: &Window,\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_box(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_brdf_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 1.0, 1.0, 1.0),\\n\\n\\t\\t0.5,\\n\\n\\t\\t0.5,\\n\\n\\t);\\n\",\n \"file_path\": \"examples/pbr/main.rs\",\n \"rank\": 20,\n \"score\": 130886.17460341491\n },\n {\n \"content\": \"struct Camera {\\n\\n projection_matrix: mat4x4<f32>;\\n\\n};\\n\\n\\n\\n[[block]]\\n\",\n \"file_path\": \"src/material/material.rs\",\n \"rank\": 21,\n \"score\": 130005.25176133549\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\twindow: &Window,\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\t//\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_plane(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\\n\\n\\t);\\n\\n\\n\",\n \"file_path\": \"examples/face_culling/main.rs\",\n \"rank\": 22,\n \"score\": 127144.89591444175\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.0, 0.01, 0.0],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/texture/src/lib.rs\",\n \"rank\": 23,\n \"score\": 126896.0363400685\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_plane(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\\n\\tlet node = pools.borrow_mut::<Node>().add(Node::new());\\n\\n\\tscene.add_node(&node);\\n\",\n \"file_path\": \"web/examples/rotation/src/lib.rs\",\n \"rank\": 24,\n \"score\": 123656.88715046295\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_box(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 0.5, 0.5, 1.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\\n\\tlet node = pools.borrow_mut::<Node>().add(Node::new());\\n\",\n \"file_path\": \"web/examples/cube/src/lib.rs\",\n \"rank\": 25,\n \"score\": 123656.88715046295\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>) {\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_triangle(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 1.0, 0.0, 0.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\\n\\tlet node = pools.borrow_mut::<Node>().add(Node::new());\\n\\n\\tscene.add_node(&node);\\n\\n\\tscene.assign(&node, &mesh);\\n\",\n \"file_path\": \"web/examples/triangle/src/lib.rs\",\n \"rank\": 26,\n \"score\": 123656.88715046295\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/triangle/main.rs\",\n \"rank\": 27,\n \"score\": 122877.1707294059\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/pbr/main.rs\",\n \"rank\": 28,\n \"score\": 122877.1707294059\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/gltf/main.rs\",\n \"rank\": 29,\n \"score\": 122877.1707294059\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/rotation/main.rs\",\n \"rank\": 30,\n \"score\": 122877.1707294059\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/cube/main.rs\",\n \"rank\": 31,\n \"score\": 122877.1707294059\n },\n {\n \"content\": \"fn create_scene(\\n\\n\\tpools: &mut ResourcePools\\n\\n) -> (ResourceId<Scene>, ResourceId<PerspectiveCamera>, Vec<ResourceId<Node>>) {\\n\\n\\tlet mut objects = Vec::new();\\n\\n\\tlet mut scene = Scene::new();\\n\\n\\n\\n\\tlet geometry = GeometryHelper::create_plane(\\n\\n\\t\\tpools,\\n\\n\\t\\t1.0,\\n\\n\\t\\t1.0,\\n\\n\\t);\\n\\n\\n\\n\\tlet material = MaterialHelper::create_basic_material(\\n\\n\\t\\tpools,\\n\\n\\t\\tColor::set(&mut Color::create(), 0.0, 1.0, 0.0),\\n\\n\\t);\\n\\n\\n\\n\\tlet mesh = pools.borrow_mut::<Mesh>().add(Mesh::new(geometry, material));\\n\\n\\tlet mut node = Node::new();\\n\\n\\tnode.borrow_position_mut()[0] = -0.5;\\n\",\n \"file_path\": \"web/examples/face_culling/src/lib.rs\",\n \"rank\": 32,\n \"score\": 120397.27224364714\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = Window::new(&event_loop).unwrap();\\n\\n\\n\\n\\tlet window_size = window.inner_size();\\n\\n\\tlet pixel_ratio = window.scale_factor();\\n\\n\\n\\n\\tlet mut renderer = WGPURenderer::new(&window, WGPURendererOptions::default()).await;\\n\\n\\trenderer.set_size(window_size.width as f64, window_size.height as f64);\\n\\n\\trenderer.set_pixel_ratio(pixel_ratio);\\n\",\n \"file_path\": \"examples/face_culling/main.rs\",\n \"rank\": 33,\n \"score\": 120278.79711748421\n },\n {\n \"content\": \"fn cast_links_mut<T1: 'static, T2: 'static>(links: &mut dyn ResourceLinksTrait) -> &mut ResourceLinks<T1, T2> {\\n\\n\\tlinks\\n\\n\\t\\t.as_any_mut()\\n\\n\\t\\t.downcast_mut::<ResourceLinks<T1, T2>>()\\n\\n\\t\\t.unwrap()\\n\\n}\\n\\n\\n\\npub struct Scene {\\n\\n\\tbackground_color: [f32; 3],\\n\\n\\tlinks: HashMap<TypeId, Box<dyn ResourceLinksTrait>>,\\n\\n\\tnodes: Vec<ResourceId<Node>>,\\n\\n}\\n\\n\\n\\nimpl Scene {\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tlet mut links = HashMap::new();\\n\\n\\t\\tSelf::add_links::<Node, Mesh>(&mut links);\\n\\n\\t\\tSelf::add_links::<Mesh, Node>(&mut links);\\n\\n\\t\\tSelf::add_links::<Node, PerspectiveCamera>(&mut links);\\n\\n\\t\\tSelf::add_links::<PerspectiveCamera, Node>(&mut links);\\n\",\n \"file_path\": \"src/scene/scene.rs\",\n \"rank\": 34,\n \"score\": 120145.41394457332\n },\n {\n \"content\": \"fn update_canvas_size(\\n\\n\\tcanvas: &web_sys::HtmlCanvasElement,\\n\\n\\t(width, height): (f64, f64),\\n\\n\\tpixel_ratio: f64\\n\\n) {\\n\\n\\tcanvas.set_width((width * pixel_ratio) as u32);\\n\\n\\tcanvas.set_height((height * pixel_ratio) as u32);\\n\\n\\tcanvas.style().set_property(\\\"width\\\", &((width as u32).to_string() + \\\"px\\\")).unwrap();\\n\\n\\tcanvas.style().set_property(\\\"height\\\", &((height as u32).to_string() + \\\"px\\\")).unwrap();\\n\\n}\\n\",\n \"file_path\": \"src/web/wgpu_web_renderer.rs\",\n \"rank\": 35,\n \"score\": 118708.40102751396\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[wasm_bindgen(start)]\\n\\npub async fn start() {\\n\\n\\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\\n\\n\\tconsole_log::init().expect(\\\"could not initialize logger\\\");\\n\\n\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = create_window(&event_loop);\\n\\n\\n\\n\\tuse winit::platform::web::WindowExtWebSys;\\n\\n\\n\\n\\tweb_sys::window()\\n\",\n \"file_path\": \"web/examples/cube/src/lib.rs\",\n \"rank\": 36,\n \"score\": 117862.4856781021\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[wasm_bindgen(start)]\\n\\npub async fn start() {\\n\\n\\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\\n\\n\\tconsole_log::init().expect(\\\"could not initialize logger\\\");\\n\\n\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = create_window(&event_loop);\\n\\n\\n\\n\\tuse winit::platform::web::WindowExtWebSys;\\n\\n\\n\\n\\tweb_sys::window()\\n\",\n \"file_path\": \"web/examples/gltf/src/lib.rs\",\n \"rank\": 37,\n \"score\": 117862.4856781021\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[wasm_bindgen(start)]\\n\\npub async fn start() {\\n\\n\\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\\n\\n\\tconsole_log::init().expect(\\\"could not initialize logger\\\");\\n\\n\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = create_window(&event_loop);\\n\\n\\n\\n\\tuse winit::platform::web::WindowExtWebSys;\\n\\n\\n\\n\\tweb_sys::window()\\n\",\n \"file_path\": \"web/examples/triangle/src/lib.rs\",\n \"rank\": 38,\n \"score\": 117862.4856781021\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[wasm_bindgen(start)]\\n\\npub async fn start() {\\n\\n\\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\\n\\n\\tconsole_log::init().expect(\\\"could not initialize logger\\\");\\n\\n\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = create_window(&event_loop);\\n\\n\\n\\n\\tuse winit::platform::web::WindowExtWebSys;\\n\\n\\n\\n\\tweb_sys::window()\\n\",\n \"file_path\": \"web/examples/rotation/src/lib.rs\",\n \"rank\": 39,\n \"score\": 117862.4856781021\n },\n {\n \"content\": \"fn render(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n) {\\n\\n\\trenderer.render(pools, scene, camera);\\n\\n}\\n\\n\\n\\n#[wasm_bindgen(start)]\\n\\npub async fn start() {\\n\\n\\tstd::panic::set_hook(Box::new(console_error_panic_hook::hook));\\n\\n\\tconsole_log::init().expect(\\\"could not initialize logger\\\");\\n\\n\\n\\n\\tlet event_loop = EventLoop::new();\\n\\n\\tlet window = create_window(&event_loop);\\n\\n\\n\\n\\tuse winit::platform::web::WindowExtWebSys;\\n\\n\\n\\n\\tweb_sys::window()\\n\",\n \"file_path\": \"web/examples/face_culling/src/lib.rs\",\n \"rank\": 40,\n \"score\": 115609.74906644374\n },\n {\n \"content\": \"fn cast_pool<T: 'static>(pool: &dyn ResourcePoolTrait) -> &ResourcePool<T> {\\n\\n\\tpool\\n\\n\\t\\t.as_any()\\n\\n\\t\\t.downcast_ref::<ResourcePool<T>>()\\n\\n\\t\\t.unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/resource.rs\",\n \"rank\": 41,\n \"score\": 111154.57840113423\n },\n {\n \"content\": \"fn get_align(contents: &UniformContents) -> u64 {\\n\\n\\tmatch contents {\\n\\n\\t\\tUniformContents::Float {value: _} => 4,\\n\\n\\t\\tUniformContents::Matrix4 {value: _} => 64,\\n\\n\\t\\tUniformContents::Vector3 {value: _} => 16,\\n\\n\\t\\t_ => 0,\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/renderer/wgpu_bindings.rs\",\n \"rank\": 42,\n \"score\": 105325.36555340898\n },\n {\n \"content\": \"fn get_byte(contents: &UniformContents) -> u64 {\\n\\n\\tmatch contents {\\n\\n\\t\\tUniformContents::Float {value: _} => 4,\\n\\n\\t\\tUniformContents::Matrix4 {value: _} => 64,\\n\\n\\t\\tUniformContents::Vector3 {value: _} => 12,\\n\\n\\t\\t_ => 0,\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_bindings.rs\",\n \"rank\": 43,\n \"score\": 105325.36555340898\n },\n {\n \"content\": \"pub trait MaterialNode {\\n\\n\\tfn collect_nodes (\\n\\n\\t\\t&self,\\n\\n\\t\\tpool: &ResourcePool<Box<dyn MaterialNode>>,\\n\\n\\t\\tnodes: &mut Vec<ResourceId<Box<dyn MaterialNode>>>,\\n\\n\\t\\tvisited: &mut HashMap<ResourceId<Box<dyn MaterialNode>>, bool>,\\n\\n\\t\\tself_rid: ResourceId<Box<dyn MaterialNode>>,\\n\\n\\t);\\n\\n\\tfn borrow_contents(&self) -> Option<&UniformContents>;\\n\\n\\tfn build_declaration(&self, self_id: usize) -> String;\\n\\n\\tfn build_functions(&self, self_id: usize) -> String;\\n\\n\\tfn build_fragment_shader(\\n\\n\\t\\t&self,\\n\\n\\t\\tpool: &ResourcePool<Box<dyn MaterialNode>>,\\n\\n\\t\\tvisited: &mut HashMap<usize, bool>,\\n\\n\\t\\tself_id: usize,\\n\\n\\t) -> String;\\n\\n\\tfn get_fragment_output(&self, self_id: usize) -> String;\\n\\n}\\n\\n\\n\\n// @TODO: Ensure unique variable names\\n\",\n \"file_path\": \"src/material/node/node.rs\",\n \"rank\": 44,\n \"score\": 104896.4248463712\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\npub fn log(s: &str) {\\n\\n\\tprintln!(\\\"{}\\\", s);\\n\\n}\\n\\n\\n\\n// Wasm\\n\\n\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\nuse wasm_bindgen::prelude::*;\\n\\n\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\n#[wasm_bindgen]\\n\\nextern \\\"C\\\" {\\n\\n\\t#[wasm_bindgen(js_namespace = console)]\\n\\n\\tpub fn log(s: &str);\\n\\n}\\n\",\n \"file_path\": \"src/utils/log.rs\",\n \"rank\": 45,\n \"score\": 104259.0122463301\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.001, 0.01, 0.003],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/cube/main.rs\",\n \"rank\": 46,\n \"score\": 97873.43861361784\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.0, 0.0, -0.01],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/gltf/main.rs\",\n \"rank\": 47,\n \"score\": 97873.43861361784\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.001, 0.01, 0.003],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/pbr/main.rs\",\n \"rank\": 48,\n \"score\": 97873.43861361784\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tnode.borrow_rotation_mut()[2] += 0.01;\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/rotation/main.rs\",\n \"rank\": 49,\n \"score\": 97873.43861361784\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n) {\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/triangle/main.rs\",\n \"rank\": 50,\n \"score\": 97873.43861361784\n },\n {\n \"content\": \"fn resize(\\n\\n\\trenderer: &mut WGPURenderer,\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n\\twidth: u32,\\n\\n\\theight: u32,\\n\\n) {\\n\\n\\tpools\\n\\n\\t\\t.borrow_mut::<PerspectiveCamera>()\\n\\n\\t\\t.borrow_mut(camera)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.set_aspect(width as f32 / height as f32);\\n\\n\\trenderer.set_size(width as f64, height as f64);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/texture/main.rs\",\n \"rank\": 51,\n \"score\": 97340.70491789754\n },\n {\n \"content\": \"fn get_filter_mode(mode: &FilterMode) -> wgpu::FilterMode {\\n\\n\\tmatch mode {\\n\\n\\t\\tFilterMode::Nearest => wgpu::FilterMode::Nearest,\\n\\n\\t\\tFilterMode::Linear => wgpu::FilterMode::Linear,\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/renderer/wgpu_samplers.rs\",\n \"rank\": 52,\n \"score\": 96381.28381084147\n },\n {\n \"content\": \"fn get_address_mode(mode: &WrapMode) -> wgpu::AddressMode {\\n\\n\\tmatch mode {\\n\\n\\t\\tWrapMode::ClampToBorder => wgpu::AddressMode::ClampToBorder,\\n\\n\\t\\tWrapMode::ClampToEdge => wgpu::AddressMode::ClampToEdge,\\n\\n\\t\\tWrapMode::MirrorRepeat => wgpu::AddressMode::MirrorRepeat,\\n\\n\\t\\tWrapMode::Repeat => wgpu::AddressMode::Repeat,\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_samplers.rs\",\n \"rank\": 53,\n \"score\": 96381.28381084147\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tnode.borrow_rotation_mut()[1] += 0.01;\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[1]).unwrap();\\n\\n\\t\\tnode.borrow_rotation_mut()[1] += 0.01;\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/face_culling/main.rs\",\n \"rank\": 54,\n \"score\": 95194.88371588291\n },\n {\n \"content\": \"fn brdf(\\n\\n v: vec3<f32>,\\n\\n n: vec3<f32>,\\n\\n h: vec3<f32>,\\n\\n l: vec3<f32>,\\n\\n base_color: vec3<f32>,\\n\\n metallic: f32,\\n\\n roughness: f32\\n\\n) -> vec3<f32> {\\n\\n let black = vec3<f32>(0.0);\\n\\n let v_dot_h = dot(v, h);\\n\\n let n_dot_v = dot(v, n);\\n\\n let n_dot_l = dot(l, n);\\n\\n let n_dot_h = dot(n, h);\\n\\n\\n\\n let c_diff = mix(base_color, black, metallic);\\n\\n let f0 = mix(vec3<f32>(0.04), base_color, metallic);\\n\\n let alpha = pow(roughness, 2.0);\\n\\n\\n\\n let f = f0 + (1.0 - f0) * pow(1.0 - abs(v_dot_h), 5.0);\\n\",\n \"file_path\": \"src/material/node/brdf.rs\",\n \"rank\": 55,\n \"score\": 94324.68334401041\n },\n {\n \"content\": \"fn parse_sampler(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tsampler: &gltf::texture::Sampler,\\n\\n) -> ResourceId<Sampler> {\\n\\n\\t// @TODO: Proper default values\\n\\n\\tpools.borrow_mut::<Sampler>().add(Sampler::new(\\n\\n\\t\\tSamplerDescriptor {\\n\\n\\t\\t\\tmag_filter: match sampler.mag_filter() {\\n\\n\\t\\t\\t\\tSome(filter) => match filter {\\n\\n\\t\\t\\t\\t\\tgltf::texture::MagFilter::Nearest => FilterMode::Nearest,\\n\\n\\t\\t\\t\\t\\tgltf::texture::MagFilter::Linear => FilterMode::Linear,\\n\\n\\t\\t\\t\\t},\\n\\n\\t\\t\\t\\tNone => FilterMode::Linear,\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\tmin_filter: match sampler.min_filter() {\\n\\n\\t\\t\\t\\tSome(filter) => match filter {\\n\\n\\t\\t\\t\\t\\tgltf::texture::MinFilter::Linear |\\n\\n\\t\\t\\t\\t\\tgltf::texture::MinFilter::LinearMipmapLinear |\\n\\n\\t\\t\\t\\t\\tgltf::texture::MinFilter::LinearMipmapNearest => FilterMode::Linear,\\n\\n\\t\\t\\t\\t\\tgltf::texture::MinFilter::Nearest |\\n\",\n \"file_path\": \"src/utils/gltf_loader.rs\",\n \"rank\": 56,\n \"score\": 92735.58778190897\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.001, 0.01, 0.003],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/cube/src/lib.rs\",\n \"rank\": 57,\n \"score\": 92704.00911235614\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tnode.borrow_rotation_mut()[2] += 0.01;\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/rotation/src/lib.rs\",\n \"rank\": 58,\n \"score\": 92704.00911235614\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tVector3::add(\\n\\n\\t\\t\\tnode.borrow_rotation_mut(),\\n\\n\\t\\t\\t&[0.0, 0.0, 0.01],\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/gltf/src/lib.rs\",\n \"rank\": 59,\n \"score\": 92704.00911235614\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n) {\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/triangle/src/lib.rs\",\n \"rank\": 60,\n \"score\": 92704.00911235614\n },\n {\n \"content\": \"fn resize(\\n\\n\\trenderer: &mut WGPUWebRenderer,\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tcamera: &ResourceId<PerspectiveCamera>,\\n\\n\\twidth: u32,\\n\\n\\theight: u32,\\n\\n) {\\n\\n\\tpools\\n\\n\\t\\t.borrow_mut::<PerspectiveCamera>()\\n\\n\\t\\t.borrow_mut(camera)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.set_aspect(width as f32 / height as f32);\\n\\n\\trenderer.set_size(width as f64, height as f64);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/texture/src/lib.rs\",\n \"rank\": 61,\n \"score\": 92208.60286392165\n },\n {\n \"content\": \"fn update(\\n\\n\\tpools: &mut ResourcePools,\\n\\n\\tscene: &ResourceId<Scene>,\\n\\n\\tobjects: &Vec<ResourceId<Node>>,\\n\\n) {\\n\\n\\t{\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[0]).unwrap();\\n\\n\\t\\tnode.borrow_rotation_mut()[1] += 0.01;\\n\\n\\t\\tlet node = pools.borrow_mut::<Node>().borrow_mut(&objects[1]).unwrap();\\n\\n\\t\\tnode.borrow_rotation_mut()[1] += 0.01;\\n\\n\\t}\\n\\n\\n\\n\\tpools.borrow::<Scene>()\\n\\n\\t\\t.borrow(scene)\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.update_matrices(pools);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"web/examples/face_culling/src/lib.rs\",\n \"rank\": 62,\n \"score\": 90381.75697094772\n },\n {\n \"content\": \"fn perturb_normal_to_arb(\\n\\n eye_pos: vec3<f32>,\\n\\n surf_norm: vec3<f32>,\\n\\n map_n: vec3<f32>,\\n\\n uv: vec2<f32>\\n\\n) -> vec3<f32> {\\n\\n let q0: vec3<f32> = vec3<f32>(dpdx(eye_pos.x), dpdx(eye_pos.y), dpdx(eye_pos.z));\\n\\n let q1: vec3<f32> = vec3<f32>(dpdy(eye_pos.x), dpdy(eye_pos.y), dpdy(eye_pos.z));\\n\\n let st0: vec2<f32> = dpdx(uv);\\n\\n let st1: vec2<f32> = dpdy(uv);\\n\\n let n: vec3<f32> = surf_norm; // normalized\\n\\n let q1perp: vec3<f32> = cross(q1, n);\\n\\n let q0perp: vec3<f32> = cross(n, q0);\\n\\n let t = q1perp * st0.x + q0perp * st1.x;\\n\\n let b = q1perp * st0.y + q0perp * st1.y;\\n\\n let det: f32 = max(dot(t, t), dot(b, b));\\n\\n var scale: f32;\\n\\n if (det == 0.0) {\\n\\n scale = 0.0;\\n\\n } else {\\n\",\n \"file_path\": \"src/material/node/tangent_to_object_normal.rs\",\n \"rank\": 63,\n \"score\": 85419.11996043095\n },\n {\n \"content\": \"pub struct Attribute {\\n\\n\\tcount: u32,\\n\\n\\tdata: Vec<f32>,\\n\\n\\t_item_size: u32,\\n\\n}\\n\\n\\n\\nimpl Attribute {\\n\\n\\tpub fn new(data: Vec<f32>, item_size: u32) -> Self {\\n\\n\\t\\tAttribute {\\n\\n\\t\\t\\tcount: data.len() as u32 / item_size,\\n\\n\\t\\t\\tdata: data,\\n\\n\\t\\t\\t_item_size: item_size,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn get_count(&self) -> u32 {\\n\\n\\t\\tself.count\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_data(&self) -> &Vec<f32> {\\n\\n\\t\\t&self.data\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/geometry/attribute.rs\",\n \"rank\": 64,\n \"score\": 77634.09900413945\n },\n {\n \"content\": \"use crate::{\\n\\n\\tgeometry::geometry::Geometry,\\n\\n\\tmaterial::material::Material,\\n\\n\\tresource::resource::ResourceId,\\n\\n};\\n\\n\\n\\n// @TODO: Support shared geometry and material\\n\\npub struct Mesh {\\n\\n\\tgeometry: ResourceId<Geometry>,\\n\\n\\tmaterial: ResourceId<Material>,\\n\\n}\\n\\n\\n\\nimpl Mesh {\\n\\n\\tpub fn new(\\n\\n\\t\\tgeometry: ResourceId<Geometry>,\\n\\n\\t\\tmaterial: ResourceId<Material>,\\n\\n\\t) -> Self {\\n\\n\\t\\tMesh {\\n\\n\\t\\t\\tgeometry: geometry,\\n\\n\\t\\t\\tmaterial: material,\\n\",\n \"file_path\": \"src/scene/mesh.rs\",\n \"rank\": 65,\n \"score\": 77446.29931381333\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_geometry(&self) -> &ResourceId<Geometry> {\\n\\n\\t\\t&self.geometry\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_material(&self) -> &ResourceId<Material> {\\n\\n\\t\\t&self.material\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/scene/mesh.rs\",\n \"rank\": 66,\n \"score\": 77433.01338074473\n },\n {\n \"content\": \"use crate::math::matrix4::Matrix4;\\n\\n\\n\\npub struct PerspectiveCamera {\\n\\n\\taspect: f32,\\n\\n\\tfar: f32,\\n\\n\\tfovy: f32,\\n\\n\\tnear: f32,\\n\\n\\tprojection_matrix: [f32; 16],\\n\\n\\tprojection_matrix_inverse: [f32; 16],\\n\\n}\\n\\n\\n\\nimpl PerspectiveCamera {\\n\\n\\tpub fn new(fovy: f32, aspect: f32, near: f32, far: f32) -> Self {\\n\\n\\t\\tlet mut camera = PerspectiveCamera {\\n\\n\\t\\t\\taspect: aspect,\\n\\n\\t\\t\\tfar: far,\\n\\n\\t\\t\\tfovy: fovy,\\n\\n\\t\\t\\tnear: near,\\n\\n\\t\\t\\tprojection_matrix: Matrix4::create(),\\n\\n\\t\\t\\tprojection_matrix_inverse: Matrix4::create(),\\n\",\n \"file_path\": \"src/scene/camera.rs\",\n \"rank\": 67,\n \"score\": 77420.90936437386\n },\n {\n \"content\": \"\\t\\t};\\n\\n\\t\\tcamera.update_projection_matrix();\\n\\n\\t\\tcamera\\n\\n\\t}\\n\\n\\n\\n\\tpub fn set_aspect(&mut self, aspect: f32) -> &mut Self {\\n\\n\\t\\tself.aspect = aspect;\\n\\n\\t\\tself.update_projection_matrix();\\n\\n\\t\\tself\\n\\n\\t}\\n\\n\\n\\n\\tpub fn update_projection_matrix(&mut self) {\\n\\n\\t\\tMatrix4::make_perspective(\\n\\n\\t\\t\\t&mut self.projection_matrix,\\n\\n\\t\\t\\tself.fovy,\\n\\n\\t\\t\\tself.aspect,\\n\\n\\t\\t\\tself.near,\\n\\n\\t\\t\\tself.far,\\n\\n\\t\\t);\\n\\n\\t\\tMatrix4::invert(\\n\",\n \"file_path\": \"src/scene/camera.rs\",\n \"rank\": 68,\n \"score\": 77418.33961188242\n },\n {\n \"content\": \"\\t\\t\\tMatrix4::copy(&mut self.projection_matrix_inverse, &self.projection_matrix)\\n\\n\\t\\t);\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_projection_matrix(&self) -> &[f32; 16] {\\n\\n\\t\\t&self.projection_matrix\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_projection_matrix_inverse(&self) -> &[f32; 16] {\\n\\n\\t\\t&self.projection_matrix_inverse\\n\\n\\t}\\n\\n}\",\n \"file_path\": \"src/scene/camera.rs\",\n \"rank\": 69,\n \"score\": 77406.64795769964\n },\n {\n \"content\": \"\\n\\npub struct SamplerDescriptor {\\n\\n\\tpub mag_filter: FilterMode,\\n\\n\\tpub min_filter: FilterMode,\\n\\n\\tpub mipmap_filter: FilterMode,\\n\\n\\tpub wrap_u: WrapMode,\\n\\n\\tpub wrap_v: WrapMode,\\n\\n\\tpub wrap_w: WrapMode,\\n\\n}\\n\\n\\n\\nimpl Default for SamplerDescriptor {\\n\\n\\tfn default() -> Self {\\n\\n\\t\\tSamplerDescriptor {\\n\\n\\t\\t\\tmag_filter: FilterMode::Linear,\\n\\n\\t\\t\\tmin_filter: FilterMode::Linear,\\n\\n\\t\\t\\tmipmap_filter: FilterMode::Linear,\\n\\n\\t\\t\\twrap_u: WrapMode::ClampToEdge,\\n\\n\\t\\t\\twrap_v: WrapMode::ClampToEdge,\\n\\n\\t\\t\\twrap_w: WrapMode::ClampToEdge,\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/texture/sampler.rs\",\n \"rank\": 70,\n \"score\": 77018.30944355075\n },\n {\n \"content\": \"\\t}\\n\\n}\\n\\n\\n\\nimpl Sampler {\\n\\n\\tpub fn new(desc: SamplerDescriptor) -> Self {\\n\\n\\t\\t// @TODO: Fix default parameters\\n\\n\\t\\tSampler {\\n\\n\\t\\t\\tmag_filter: desc.mag_filter,\\n\\n\\t\\t\\tmin_filter: desc.min_filter,\\n\\n\\t\\t\\tmipmap_filter: desc.mipmap_filter,\\n\\n\\t\\t\\twrap_u: desc.wrap_u,\\n\\n\\t\\t\\twrap_v: desc.wrap_v,\\n\\n\\t\\t\\twrap_w: desc.wrap_w,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn mag_filter(&self) -> &FilterMode {\\n\\n\\t\\t&self.mag_filter\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"src/texture/sampler.rs\",\n \"rank\": 71,\n \"score\": 77016.62558976865\n },\n {\n \"content\": \"pub enum WrapMode {\\n\\n\\tClampToBorder,\\n\\n\\tClampToEdge,\\n\\n\\tMirrorRepeat,\\n\\n\\tRepeat,\\n\\n}\\n\\n\\n\\npub enum FilterMode {\\n\\n\\tLinear,\\n\\n\\tNearest,\\t\\n\\n}\\n\\n\\n\\npub struct Sampler {\\n\\n\\tmag_filter: FilterMode,\\n\\n\\tmin_filter: FilterMode,\\n\\n\\tmipmap_filter: FilterMode,\\n\\n\\twrap_u: WrapMode,\\n\\n\\twrap_v: WrapMode,\\n\\n\\twrap_w: WrapMode,\\n\\n}\\n\",\n \"file_path\": \"src/texture/sampler.rs\",\n \"rank\": 72,\n \"score\": 77010.95147842962\n },\n {\n \"content\": \"\\tpub fn min_filter(&self) -> &FilterMode {\\n\\n\\t\\t&self.min_filter\\n\\n\\t}\\n\\n\\n\\n\\tpub fn mipmap_filter(&self) -> &FilterMode {\\n\\n\\t\\t&self.mipmap_filter\\n\\n\\t}\\n\\n\\n\\n\\tpub fn wrap_u(&self) -> &WrapMode {\\n\\n\\t\\t&self.wrap_u\\n\\n\\t}\\n\\n\\n\\n\\tpub fn wrap_v(&self) -> &WrapMode {\\n\\n\\t\\t&self.wrap_v\\n\\n\\t}\\n\\n\\n\\n\\tpub fn wrap_w(&self) -> &WrapMode {\\n\\n\\t\\t&self.wrap_w\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/texture/sampler.rs\",\n \"rank\": 73,\n \"score\": 77008.94144487928\n },\n {\n \"content\": \"\\tscale: [f32; 3],\\n\\n\\tworld_matrix: [f32; 16],\\n\\n}\\n\\n\\n\\nimpl Node {\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tNode {\\n\\n\\t\\t\\tchildren: Vec::new(),\\n\\n\\t\\t\\tmatrix: Matrix4::create(),\\n\\n\\t\\t\\tparent: None,\\n\\n\\t\\t\\tposition: Vector3::create(),\\n\\n\\t\\t\\tquaternion: Quaternion::create(),\\n\\n\\t\\t\\trotation: Euler::create(),\\n\\n\\t\\t\\tscale: *Vector3::set(&mut Vector3::create(), 1.0, 1.0, 1.0),\\n\\n\\t\\t\\tworld_matrix: Matrix4::create(),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_parent(&self) -> Option<&ResourceId<Node>> {\\n\\n\\t\\tself.parent.as_ref()\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 74,\n \"score\": 76367.60965933325\n },\n {\n \"content\": \"impl NodeExecutor {\\n\\n\\tpub fn update_matrices(\\n\\n\\t\\tpool: &mut ResourcePool<Node>,\\n\\n\\t\\troot: &ResourceId<Node>,\\n\\n\\t) {\\n\\n\\t\\tlet mut stack = Vec::new();\\n\\n\\t\\tstack.push(*root);\\n\\n\\n\\n\\t\\twhile let Some(rid) = stack.pop() {\\n\\n\\t\\t\\tlet node = pool.borrow_mut(&rid).unwrap();\\n\\n\\t\\t\\tnode.update_matrix();\\n\\n\\n\\n\\t\\t\\tlet parent_matrix = {\\n\\n\\t\\t\\t\\tlet mut matrix = Matrix4::create();\\n\\n\\t\\t\\t\\tlet node = pool.borrow_mut(&rid).unwrap();\\n\\n\\t\\t\\t\\tif let Some(parent) = node.borrow_parent().cloned() {\\n\\n\\t\\t\\t\\t\\tMatrix4::copy(&mut matrix, pool.borrow(&parent).unwrap().borrow_world_matrix());\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tmatrix\\n\\n\\t\\t\\t};\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 75,\n \"score\": 76365.42091998825\n },\n {\n \"content\": \"\\t\\tMatrix4::decompose(&mut self.position, &mut self.quaternion, &mut self.scale, &self.matrix);\\n\\n\\t\\tEuler::set_from_quaternion(&mut self.rotation, &self.quaternion);\\n\\n\\t\\tself\\n\\n\\t}\\n\\n\\n\\n\\tpub fn set_world_matrix(&mut self, matrix: &[f32; 16]) -> &mut Self {\\n\\n\\t\\tMatrix4::copy(&mut self.world_matrix, matrix);\\n\\n\\t\\tself\\n\\n\\t}\\n\\n\\n\\n\\tpub fn update_matrix(&mut self) -> &mut Self {\\n\\n\\t\\tQuaternion::set_from_euler(&mut self.quaternion, &self.rotation);\\n\\n\\t\\tMatrix4::compose(&mut self.matrix, &self.position, &self.quaternion, &self.scale);\\n\\n\\t\\tself\\n\\n\\t}\\n\\n\\n\\n\\t// @TODO: Optimize\\n\\n\\tpub fn update_matrices(\\n\\n\\t\\t&mut self,\\n\\n\\t\\tpool: &mut ResourcePool<Node>,\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 76,\n \"score\": 76363.30749713788\n },\n {\n \"content\": \"use crate::{\\n\\n\\tmath::{\\n\\n\\t\\teuler::Euler,\\n\\n\\t\\tmatrix4::Matrix4,\\n\\n\\t\\tquaternion::Quaternion,\\n\\n\\t\\tvector3::Vector3,\\n\\n\\t},\\n\\n\\tresource::resource::{\\n\\n\\t\\tResourceId,\\n\\n\\t\\tResourcePool,\\n\\n\\t},\\n\\n};\\n\\n\\n\\npub struct Node {\\n\\n\\tchildren: Vec<ResourceId<Node>>,\\n\\n\\tmatrix: [f32; 16],\\n\\n\\tparent: Option<ResourceId<Node>>,\\n\\n\\tposition: [f32; 3],\\n\\n\\tquaternion: [f32; 4],\\n\\n\\trotation: [f32; 3],\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 77,\n \"score\": 76360.94011609847\n },\n {\n \"content\": \"\\n\\n\\t\\t\\tlet node = pool.borrow_mut(&rid).unwrap();\\n\\n\\t\\t\\tlet mut matrix = Matrix4::create();\\n\\n\\t\\t\\tMatrix4::multiply(&mut matrix, &parent_matrix, &node.borrow_matrix());\\n\\n\\t\\t\\tnode.set_world_matrix(&matrix);\\n\\n\\n\\n\\t\\t\\tfor child in node.children.iter() {\\n\\n\\t\\t\\t\\tstack.push(*child);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn collect_nodes(\\n\\n\\t\\tpool: &ResourcePool<Node>,\\n\\n\\t\\troot: &ResourceId<Node>,\\n\\n\\t\\tnodes: &mut Vec<ResourceId<Node>>,\\n\\n\\t) {\\n\\n\\t\\tlet mut stack = Vec::new();\\n\\n\\t\\tstack.push(*root);\\n\\n\\t\\tnodes.push(*root);\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 78,\n \"score\": 76360.15507137305\n },\n {\n \"content\": \"\\t\\t\\t\\tlet parent = node.borrow_parent().cloned().unwrap();\\n\\n\\t\\t\\t\\tMatrix4::copy(&mut matrix, pool.borrow(&parent).unwrap().borrow_world_matrix());\\n\\n\\t\\t\\t\\tmatrix\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\tlet node = pool.borrow_mut(&rid).unwrap();\\n\\n\\t\\t\\tlet mut matrix = Matrix4::create();\\n\\n\\t\\t\\tMatrix4::multiply(&mut matrix, &parent_matrix, &node.borrow_matrix());\\n\\n\\t\\t\\tnode.set_world_matrix(&matrix);\\n\\n\\n\\n\\t\\t\\tfor child in node.children.iter() {\\n\\n\\t\\t\\t\\tstack.push(*child);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\npub struct NodeExecutor {\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 79,\n \"score\": 76359.57641523512\n },\n {\n \"content\": \"\\t) {\\n\\n\\t\\tself.update_matrix();\\n\\n\\n\\n\\t\\tif let Some(parent) = self.borrow_parent() {\\n\\n\\t\\t\\tlet parent_matrix = pool.borrow(parent).unwrap().borrow_world_matrix();\\n\\n\\t\\t\\tMatrix4::multiply(&mut self.world_matrix, parent_matrix, &self.matrix);\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tMatrix4::copy(&mut self.world_matrix, &self.matrix);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tlet mut stack = Vec::new();\\n\\n\\n\\n\\t\\tfor child in self.children.iter() {\\n\\n\\t\\t\\tstack.push(*child);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\twhile let Some(rid) = stack.pop() {\\n\\n\\t\\t\\tlet parent_matrix = {\\n\\n\\t\\t\\t\\tlet mut matrix = Matrix4::create();\\n\\n\\t\\t\\t\\tlet node = pool.borrow_mut(&rid).unwrap();\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 80,\n \"score\": 76357.72722305731\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tpub fn borrow_children(&self) -> &Vec<ResourceId<Node>> {\\n\\n\\t\\t&self.children\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_position(&self) -> &[f32; 3] {\\n\\n\\t\\t&self.position\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_position_mut(&mut self) -> &mut [f32; 3] {\\n\\n\\t\\t&mut self.position\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_rotation(&self) -> &[f32; 3] {\\n\\n\\t\\t&self.rotation\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_rotation_mut(&mut self) -> &mut [f32; 3] {\\n\\n\\t\\t&mut self.rotation\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 81,\n \"score\": 76355.7669852712\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tpub fn borrow_scale(&self) -> &[f32; 3] {\\n\\n\\t\\t&self.scale\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_scale_mut(&mut self) -> &mut [f32; 3] {\\n\\n\\t\\t&mut self.scale\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_matrix(&self) -> &[f32; 16] {\\n\\n\\t\\t&self.matrix\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow_world_matrix(&self) -> &[f32; 16] {\\n\\n\\t\\t&self.world_matrix\\n\\n\\t}\\n\\n\\n\\n\\tpub fn set_matrix(&mut self, matrix: &[f32; 16]) -> &mut Self {\\n\\n\\t\\tMatrix4::copy(&mut self.matrix, matrix);\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 82,\n \"score\": 76355.736092539\n },\n {\n \"content\": \"\\n\\n\\t\\twhile let Some(rid) = stack.pop() {\\n\\n\\t\\t\\tlet node = pool.borrow(&rid).unwrap();\\n\\n\\t\\t\\tfor child in node.children.iter() {\\n\\n\\t\\t\\t\\tstack.push(*child);\\n\\n\\t\\t\\t\\tnodes.push(*child);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/scene/node.rs\",\n \"rank\": 83,\n \"score\": 76351.3536872573\n },\n {\n \"content\": \"fn d_ggx(n_dot_h: f32, roughness: f32) -> f32 {\\n\\n let a: f32 = n_dot_h * roughness;\\n\\n let k: f32 = roughness / (1.0 - pow(n_dot_h, 2.0) + pow(a, 2.0));\\n\\n return pow(k, 2.0) * (1.0 / PI);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/material/node/brdf.rs\",\n \"rank\": 84,\n \"score\": 73200.4285927179\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse crate::{\\n\\n\\tmaterial::node::node::{\\n\\n\\t\\tMaterialNode,\\n\\n\\t\\tUniformContents,\\n\\n\\t},\\n\\n\\tresource::resource::{\\n\\n\\t\\tResourceId,\\n\\n\\t\\tResourcePool,\\n\\n\\t},\\n\\n\\ttexture::{\\n\\n\\t\\tsampler::Sampler,\\n\\n\\t\\ttexture::Texture,\\n\\n\\t}\\n\\n};\\n\\n\\n\\npub struct TextureNode {\\n\\n\\tcontents: UniformContents,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/material/node/texture.rs\",\n \"rank\": 85,\n \"score\": 73190.79198269045\n },\n {\n \"content\": \"impl TextureNode {\\n\\n\\tpub fn new(\\n\\n\\t\\ttexture: ResourceId<Texture>,\\n\\n\\t\\tsampler: ResourceId<Sampler>,\\n\\n\\t) -> Self {\\n\\n\\t\\tTextureNode {\\n\\n\\t\\t\\tcontents: UniformContents::Texture {\\n\\n\\t\\t\\t\\tsampler: sampler,\\n\\n\\t\\t\\t\\ttexture: texture,\\n\\n\\t\\t\\t},\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfn get_texture_name(&self) -> String {\\n\\n\\t\\tmatch self.contents {\\n\\n\\t\\t\\tUniformContents::Texture{texture, ..} => {\\n\\n\\t\\t\\t\\tformat!(\\\"texture_{}\\\", texture.id)\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\t_ => panic!(),\\t\\t\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/material/node/texture.rs\",\n \"rank\": 86,\n \"score\": 73189.59824959656\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tfn get_sampler_name(&self) -> String {\\n\\n\\t\\tmatch self.contents {\\n\\n\\t\\t\\tUniformContents::Texture{sampler, ..} => {\\n\\n\\t\\t\\t\\tformat!(\\\"sampler_{}\\\", sampler.id)\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\t_ => panic!(),\\t\\t\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl MaterialNode for TextureNode {\\n\\n\\tfn collect_nodes (\\n\\n\\t\\t&self,\\n\\n\\t\\t_pool: &ResourcePool<Box<dyn MaterialNode>>,\\n\\n\\t\\tnodes: &mut Vec<ResourceId<Box<dyn MaterialNode>>>,\\n\\n\\t\\tvisited: &mut HashMap<ResourceId<Box<dyn MaterialNode>>, bool>,\\n\\n\\t\\tself_rid: ResourceId<Box<dyn MaterialNode>>,\\n\\n\\t) {\\n\",\n \"file_path\": \"src/material/node/texture.rs\",\n \"rank\": 87,\n \"score\": 73188.15781734262\n },\n {\n \"content\": \"\\t\\t_pool: &ResourcePool<Box<dyn MaterialNode>>,\\n\\n\\t\\tvisited: &mut HashMap<usize, bool>,\\n\\n\\t\\tself_id: usize,\\n\\n\\t) -> String {\\n\\n\\t\\tif visited.contains_key(&self_id) {\\n\\n\\t\\t\\treturn \\\"\\\".to_string();\\n\\n\\t\\t}\\n\\n\\t\\tvisited.insert(self_id, true);\\n\\n\\n\\n\\t\\tformat!(\\\"let {} = textureSample({}, {}, in.uv);\\\\n\\\",\\n\\n\\t\\t\\tself.get_fragment_output(self_id),\\n\\n\\t\\t\\tself.get_texture_name(),\\n\\n\\t\\t\\tself.get_sampler_name(),\\n\\n\\t\\t)\\n\\n\\t}\\n\\n\\n\\n\\tfn get_fragment_output(&self, self_id: usize) -> String {\\n\\n\\t\\tformat!(\\\"texture_output_{}\\\", self_id)\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/material/node/texture.rs\",\n \"rank\": 88,\n \"score\": 73179.79499744785\n },\n {\n \"content\": \"\\t\\tif !visited.contains_key(&self_rid) {\\n\\n\\t\\t\\tvisited.insert(self_rid, true);\\n\\n\\t\\t\\tnodes.push(self_rid);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfn borrow_contents(&self) -> Option<&UniformContents> {\\n\\n\\t\\tSome(&self.contents)\\n\\n\\t}\\n\\n\\n\\n\\tfn build_declaration(&self, _self_id: usize) -> String {\\n\\n\\t\\tformat!(\\\"\\\")\\n\\n\\t}\\n\\n\\n\\n\\tfn build_functions(&self, _self_id: usize) -> String {\\n\\n\\t\\tformat!(\\\"\\\")\\n\\n\\t}\\n\\n\\n\\n\\tfn build_fragment_shader(\\n\\n\\t\\t&self,\\n\",\n \"file_path\": \"src/material/node/texture.rs\",\n \"rank\": 89,\n \"score\": 73175.32736169538\n },\n {\n \"content\": \"let wasm;\\n\",\n \"file_path\": \"web/examples/texture/wgpu_rust_renderer_example_texture.js\",\n \"rank\": 90,\n \"score\": 72877.90058596316\n },\n {\n \"content\": \"const heap = new Array(32).fill(undefined);\\n\",\n \"file_path\": \"web/examples/texture/wgpu_rust_renderer_example_texture.js\",\n \"rank\": 91,\n \"score\": 72877.90058596316\n },\n {\n \"content\": \"// @TODO: Should we reuse wgpu_attributes?\\n\\n\\n\\nuse std::collections::HashMap;\\n\\n\\n\\nuse crate::{\\n\\n\\tgeometry::index::Index,\\n\\n\\tresource::resource::{\\n\\n\\t\\tResourceId,\\n\\n\\t\\tResourcePools,\\n\\n\\t},\\n\\n};\\n\\n\\n\\npub struct WGPUIndices {\\n\\n\\tindices: HashMap<ResourceId<Index>, wgpu::Buffer>,\\n\\n}\\n\\n\\n\\nimpl WGPUIndices {\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tWGPUIndices {\\n\\n\\t\\t\\tindices: HashMap::new()\\n\",\n \"file_path\": \"src/renderer/wgpu_indices.rs\",\n \"rank\": 92,\n \"score\": 72544.28742136262\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow(&self, index: &ResourceId<Index>) -> Option<&wgpu::Buffer> {\\n\\n\\t\\tself.indices.get(index)\\n\\n\\t}\\n\\n\\n\\n\\t// @TODO: Implement correctly\\n\\n\\tpub fn update(\\n\\n\\t\\t&mut self,\\n\\n\\t\\tdevice: &wgpu::Device,\\n\\n\\t\\tpools: &ResourcePools,\\n\\n\\t\\tindex_rid: &ResourceId<Index>,\\n\\n\\t) {\\n\\n\\t\\tif !self.indices.contains_key(index_rid) {\\n\\n\\t\\t\\tif let Some(index) = pools.borrow::<Index>().borrow(index_rid) {\\n\\n\\t\\t\\t\\tself.indices.insert(*index_rid, create_buffer(\\n\\n\\t\\t\\t\\t\\tdevice,\\n\\n\\t\\t\\t\\t\\tbytemuck::cast_slice(index.borrow_data()),\\n\\n\\t\\t\\t\\t\\twgpu::BufferUsages::INDEX,\\n\\n\\t\\t\\t\\t));\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n// @TODO: Remove duplication with wgpu_attributes.rs\\n\",\n \"file_path\": \"src/renderer/wgpu_indices.rs\",\n \"rank\": 93,\n \"score\": 72543.76250626182\n },\n {\n \"content\": \"\\n\\n\\tpub fn borrow(&self, attribute: &ResourceId<Attribute>) -> Option<&wgpu::Buffer> {\\n\\n\\t\\tself.attributes.get(attribute)\\n\\n\\t}\\n\\n\\n\\n\\t// @TODO: Implement correctly\\n\\n\\tpub fn update(\\n\\n\\t\\t&mut self,\\n\\n\\t\\tdevice: &wgpu::Device,\\n\\n\\t\\tpools: &ResourcePools,\\n\\n\\t\\tattribute_rid: &ResourceId<Attribute>,\\n\\n\\t) {\\n\\n\\t\\tif !self.attributes.contains_key(attribute_rid) {\\n\\n\\t\\t\\tif let Some(attribute) = pools.borrow::<Attribute>().borrow(attribute_rid) {\\n\\n\\t\\t\\t\\tself.attributes.insert(*attribute_rid, create_buffer(\\n\\n\\t\\t\\t\\t\\tdevice,\\n\\n\\t\\t\\t\\t\\tbytemuck::cast_slice(attribute.borrow_data()),\\n\\n\\t\\t\\t\\t\\twgpu::BufferUsages::VERTEX,\\n\\n\\t\\t\\t\\t));\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_attributes.rs\",\n \"rank\": 94,\n \"score\": 72532.56929052985\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\n\\n\\nuse crate::{\\n\\n\\tgeometry::attribute::Attribute,\\n\\n\\tresource::resource::{\\n\\n\\t\\tResourceId,\\n\\n\\t\\tResourcePools,\\n\\n\\t},\\n\\n};\\n\\n\\n\\npub struct WGPUAttributes {\\n\\n\\tattributes: HashMap<ResourceId<Attribute>, wgpu::Buffer>,\\n\\n}\\n\\n\\n\\nimpl WGPUAttributes {\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tWGPUAttributes {\\n\\n\\t\\t\\tattributes: HashMap::new()\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"src/renderer/wgpu_attributes.rs\",\n \"rank\": 95,\n \"score\": 72531.38727172681\n },\n {\n \"content\": \"\\n\\nimpl WGPUSamplers {\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tWGPUSamplers {\\n\\n\\t\\t\\tsamplers: HashMap::new(),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow(&self, sampler: &ResourceId<Sampler>) -> Option<&wgpu::Sampler> {\\n\\n\\t\\tself.samplers.get(sampler)\\n\\n\\t}\\n\\n\\n\\n\\t// @TODO: Implement correctly\\n\\n\\tfn update(\\n\\n\\t\\t&mut self,\\n\\n\\t\\tdevice: &wgpu::Device,\\n\\n\\t\\tpools: &ResourcePools,\\n\\n\\t\\tsampler_rid: &ResourceId<Sampler>,\\n\\n\\t) {\\n\\n\\t\\tif !self.samplers.contains_key(sampler_rid) {\\n\",\n \"file_path\": \"src/renderer/wgpu_samplers.rs\",\n \"rank\": 96,\n \"score\": 72454.5830114713\n },\n {\n \"content\": \"\\t\\t\\tif let Some(sampler) = pools.borrow::<Sampler>().borrow(sampler_rid) {\\n\\n\\t\\t\\t\\tlet sampler_gpu = create_sampler(\\n\\n\\t\\t\\t\\t\\tdevice,\\n\\n\\t\\t\\t\\t\\tsampler,\\n\\n\\t\\t\\t\\t);\\n\\n\\t\\t\\t\\tself.samplers.insert(*sampler_rid, sampler_gpu);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn update_from_material(\\n\\n\\t\\t&mut self,\\n\\n\\t\\tdevice: &wgpu::Device,\\n\\n\\t\\tpools: &ResourcePools,\\n\\n\\t\\tmaterial: &Material,\\n\\n\\t) {\\n\\n\\t\\tlet samplers = material.borrow_samplers(\\n\\n\\t\\t\\tpools.borrow::<Box<dyn MaterialNode>>(),\\n\\n\\t\\t);\\n\\n\\t\\tfor sampler in samplers.iter() {\\n\\n\\t\\t\\tself.update(device, pools, sampler);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/wgpu_samplers.rs\",\n \"rank\": 97,\n \"score\": 72453.39672659535\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse crate::{\\n\\n\\tmaterial::{\\n\\n\\t\\tmaterial::Material,\\n\\n\\t\\tnode::node::MaterialNode,\\n\\n\\t},\\n\\n\\tresource::resource::{\\n\\n\\t\\tResourceId,\\n\\n\\t\\tResourcePools,\\n\\n\\t},\\n\\n\\ttexture::sampler::{\\n\\n\\t\\tFilterMode,\\n\\n\\t\\tSampler,\\n\\n\\t\\tWrapMode,\\n\\n\\t},\\n\\n};\\n\\n\\n\\npub struct WGPUSamplers {\\n\\n\\tsamplers: HashMap<ResourceId<Sampler>, wgpu::Sampler>,\\n\\n}\\n\",\n \"file_path\": \"src/renderer/wgpu_samplers.rs\",\n \"rank\": 98,\n \"score\": 72449.85011651514\n },\n {\n \"content\": \"\\t\\t\\tgroups: HashMap::new()\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn borrow(&self, node: &ResourceId<Node>) -> Option<&WGPUBinding> {\\n\\n\\t\\tself.groups.get(node)\\n\\n\\t}\\n\\n\\n\\n\\tpub fn update(&mut self,\\n\\n\\t\\tdevice: &wgpu::Device,\\n\\n\\t\\tqueue: &wgpu::Queue,\\n\\n\\t\\twgpu_textures: &WGPUTextures,\\n\\n\\t\\twgpu_samplers: &WGPUSamplers,\\n\\n\\t\\tpools: &ResourcePools,\\n\\n\\t\\tnode_rid: &ResourceId<Node>,\\n\\n\\t\\tcamera: &PerspectiveCamera,\\n\\n\\t\\tcamera_node: &Node,\\n\\n\\t\\tmaterial: &Material,\\n\\n\\t) {\\n\\n\\t\\tif !self.groups.contains_key(node_rid) {\\n\",\n \"file_path\": \"src/renderer/wgpu_bindings.rs\",\n \"rank\": 99,\n \"score\": 72326.72906528244\n }\n]","isConversational":false}}},{"rowIdx":3691,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/bxdf/bsdf.rs"},"repo_name":{"kind":"string","value":"joeftiger/Rust-V"},"commit":{"kind":"string","value":"bac9029eba6eefcff2d831acdc91a99168622382"},"file_code":{"kind":"string","value":"use crate::bxdf::{same_hemisphere, world_to_bxdf, BxDF, BxDFSample, BxDFSampleResult, Type};\nuse crate::debug_utils::is_normalized;\nuse crate::samplers::Sample;\nuse crate::*;\nuse serde::{Deserialize, Serialize};\n\n#[derive(Serialize, Deserialize, Default)]\npub struct BSDF {\n #[serde(default)]\n bxdfs: Vec<Box<dyn BxDF>>,\n}\n\nimpl BSDF {\n pub fn empty() -> Self {\n Self::new(vec![])\n }\n\n pub fn new(bxdfs: Vec<Box<dyn BxDF>>) -> Self {\n Self { bxdfs }\n }\n\n pub fn size(&self) -> usize {\n self.bxdfs.len()\n }\n\n pub fn is_empty(&self) -> bool {\n self.size() == 0\n }\n\n pub fn num_types(&self, t: Type) -> usize {\n self.bxdfs.iter().filter(|bxdf| bxdf.is_type(t)).count()\n }\n\n pub fn random_matching_bxdf(&self, t: Type, rand: Float) -> Option<&dyn BxDF> {\n let count = self.num_types(t);\n if count == 0 {\n return None;\n }\n\n let index = (rand * count as Float) as usize;\n self.bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(t) {\n Some(bxdf.as_ref())\n } else {\n None\n }\n })\n .nth(index)\n }\n\n pub fn evaluate(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n mut types: Type,\n ) -> Spectrum {\n let rotation = world_to_bxdf(normal);\n\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n \n if same_hemisphere(incident, outgoing) {\n types &= !Type::TRANSMISSION;\n } else {\n types &= !Type::REFLECTION;\n }\n\n self.bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(types) {\n Some(bxdf.evaluate(incident, outgoing))\n } else {\n None\n }\n })\n .sum()\n }\n\n \n \n \n \n \n \n \n \n \n \n pub fn evaluate_buf(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n mut types: Type,\n indices: &[usize],\n ) -> Vec<Float> {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n \n if same_hemisphere(incident, outgoing) {\n types &= !Type::TRANSMISSION;\n } else {\n types &= !Type::REFLECTION;\n }\n\n let mut buf = vec![0.0; indices.len()];\n self.bxdfs\n .iter()\n .filter(|bxdf| bxdf.is_type(types))\n .for_each(|bxdf| {\n for i in 0..indices.len() {\n buf[i] += bxdf.evaluate_wavelength(incident, outgoing, indices[i]);\n }\n });\n\n buf\n }\n\n pub fn evaluate_wavelength(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n mut types: Type,\n light_wave_index: usize,\n ) -> Float {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n \n if same_hemisphere(incident, outgoing) {\n types &= !Type::TRANSMISSION;\n } else {\n types &= !Type::REFLECTION;\n }\n\n self.bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(types) {\n Some(bxdf.evaluate_wavelength(incident, outgoing, light_wave_index))\n } else {\n None\n }\n })\n .sum()\n }\n\n pub fn evaluate_bxdf_light_wave(\n bxdf: &dyn BxDF,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n light_wave_index: usize,\n ) -> Float {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n bxdf.evaluate_wavelength(incident, outgoing, light_wave_index)\n }\n\n pub fn sample(\n &self,\n normal: Vector3,\n outgoing_world: Vector3,\n types: Type,\n sample: Sample,\n ) -> Option<BxDFSample<Spectrum>> {\n debug_assert!(is_normalized(normal));\n debug_assert!(is_normalized(outgoing_world));\n\n let rotation = world_to_bxdf(normal);\n let outgoing = rotation * outgoing_world;\n\n let bxdf = self.random_matching_bxdf(types, sample.one_d)?;\n\n bxdf.sample(outgoing, sample.two_d).map(|mut s| {\n s.incident = rotation.reversed() * s.incident;\n s\n })\n }\n\n \n \n \n \n \n \n \n \n \n \n pub fn sample_buf(\n &self,\n normal: Vector3,\n outgoing_world: Vector3,\n types: Type,\n sample: Sample,\n indices: &[usize],\n ) -> Option<BxDFSampleResult> {\n debug_assert!(is_normalized(normal));\n debug_assert!(is_normalized(outgoing_world));\n\n let rotation = world_to_bxdf(normal);\n let outgoing = rotation * outgoing_world;\n\n let bxdf = self.random_matching_bxdf(types, sample.one_d)?;\n\n bxdf.sample_buf(outgoing, sample.two_d, indices)\n .map(|mut sample| {\n let reverse = rotation.reversed();\n\n match sample {\n BxDFSampleResult::Bundle(ref mut s) => s.incident = reverse * s.incident,\n BxDFSampleResult::ScatteredBundle(ref mut s) => {\n s.iter_mut().for_each(|s| s.incident = reverse * s.incident)\n }\n }\n\n sample\n })\n }\n\n pub fn sample_light_wave(\n &self,\n normal: Vector3,\n outgoing_world: Vector3,\n types: Type,\n sample: Sample,\n light_wave_index: usize,\n ) -> Option<BxDFSample<Float>> {\n debug_assert!(is_normalized(normal));\n debug_assert!(is_normalized(outgoing_world));\n\n let rotation = world_to_bxdf(normal);\n let outgoing = rotation * outgoing_world;\n\n let bxdf = self.random_matching_bxdf(types, sample.one_d)?;\n\n bxdf.sample_wavelength(outgoing, sample.two_d, light_wave_index)\n .map(|mut s| {\n s.incident = rotation.reversed() * s.incident;\n s\n })\n }\n\n pub fn pdf(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n types: Type,\n ) -> Float {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n let (pdf, num) = self\n .bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(types) {\n Some(bxdf.pdf(incident, outgoing))\n } else {\n None\n }\n })\n .fold((0.0, 0usize), |(a, num), b| (a + b, num + 1));\n\n if num > 0 {\n pdf / num as Float\n } else {\n 0.0\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::bxdf::{same_hemisphere, world_to_bxdf, BxDF, BxDFSample, BxDFSampleResult, Type};\nuse crate::debug_utils::is_normalized;\nuse crate::samplers::Sample;\nuse crate::*;\nuse serde::{Deserialize, Serialize};\n\n#[derive(Serialize, Deserialize, Default)]\npub struct BSDF {\n #[serde(default)]\n bxdfs: Vec<Box<dyn BxDF>>,\n}\n\nimpl BSDF {\n pub fn empty() -> Self {\n Self::new(vec![])\n }\n\n pub fn new(bxdfs: Vec<Box<dyn BxDF>>) -> Self {\n Self { bxdfs }\n }\n\n pub fn size(&self) -> usize {\n self.bxdfs.len()\n }\n\n pub fn is_empty(&self) -> bool {\n self.size() == 0\n }\n\n pub fn num_types(&self, t: Type) -> usize {\n self.bxdfs.iter().filter(|bxdf| bxdf.is_type(t)).count()\n }\n\n pub fn random_matching_bxdf(&self, t: Type, rand: Float) -> Option<&dyn BxDF> {\n let count = self.num_types(t);\n if count == 0 {\n return None;\n }\n\n let index = (rand * count as Float) as usize;\n self.bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(t) {\n Some(bxdf.as_ref())\n } else {\n None\n }\n })\n .nth(index)\n }\n\n pub fn evaluate(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n mut types: Type,\n ) -> Spectrum {\n let rotation = world_to_bxdf(normal);\n\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n \n if same_hemisphere(incident, outgoing) {\n types &= !Type::TRANSMISSION;\n } else {\n types &= !Type::REFLECTION;\n }\n\n self.bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(types) {\n Some(bxdf.evaluate(incident, outgoing))\n } else {\n None\n }\n })\n .sum()\n }\n\n \n \n \n \n \n \n \n \n \n \n pub fn evaluate_buf(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n mut types: Type,\n indices: &[usize],\n ) -> Vec<Float> {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n \n if same_hemisphere(incident, outgoing) {\n types &= !Type::TRANSMISSION;\n } else {\n types &= !Type::REFLECTION;\n }\n\n let mut buf = vec![0.0; indices.len()];\n self.bxdfs\n .iter()\n .filter(|bxdf| bxdf.is_type(types))\n .for_each(|bxdf| {\n for i in 0..indices.len() {\n buf[i] += bxdf.evaluate_wavelength(incident, outgoing, indices[i]);\n }\n });\n\n buf\n }\n\n pub fn evaluate_wavelength(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n mut types: Type,\n light_wave_index: usize,\n ) -> Float {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n \n if same_hemisphere(incident, outgoing) {\n types &= !Type::TRANSMISSION;\n } else {\n type"},"suffix":{"kind":"string","value":"\n\n pub fn evaluate_bxdf_light_wave(\n bxdf: &dyn BxDF,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n light_wave_index: usize,\n ) -> Float {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n bxdf.evaluate_wavelength(incident, outgoing, light_wave_index)\n }\n\n pub fn sample(\n &self,\n normal: Vector3,\n outgoing_world: Vector3,\n types: Type,\n sample: Sample,\n ) -> Option<BxDFSample<Spectrum>> {\n debug_assert!(is_normalized(normal));\n debug_assert!(is_normalized(outgoing_world));\n\n let rotation = world_to_bxdf(normal);\n let outgoing = rotation * outgoing_world;\n\n let bxdf = self.random_matching_bxdf(types, sample.one_d)?;\n\n bxdf.sample(outgoing, sample.two_d).map(|mut s| {\n s.incident = rotation.reversed() * s.incident;\n s\n })\n }\n\n \n \n \n \n \n \n \n \n \n \n pub fn sample_buf(\n &self,\n normal: Vector3,\n outgoing_world: Vector3,\n types: Type,\n sample: Sample,\n indices: &[usize],\n ) -> Option<BxDFSampleResult> {\n debug_assert!(is_normalized(normal));\n debug_assert!(is_normalized(outgoing_world));\n\n let rotation = world_to_bxdf(normal);\n let outgoing = rotation * outgoing_world;\n\n let bxdf = self.random_matching_bxdf(types, sample.one_d)?;\n\n bxdf.sample_buf(outgoing, sample.two_d, indices)\n .map(|mut sample| {\n let reverse = rotation.reversed();\n\n match sample {\n BxDFSampleResult::Bundle(ref mut s) => s.incident = reverse * s.incident,\n BxDFSampleResult::ScatteredBundle(ref mut s) => {\n s.iter_mut().for_each(|s| s.incident = reverse * s.incident)\n }\n }\n\n sample\n })\n }\n\n pub fn sample_light_wave(\n &self,\n normal: Vector3,\n outgoing_world: Vector3,\n types: Type,\n sample: Sample,\n light_wave_index: usize,\n ) -> Option<BxDFSample<Float>> {\n debug_assert!(is_normalized(normal));\n debug_assert!(is_normalized(outgoing_world));\n\n let rotation = world_to_bxdf(normal);\n let outgoing = rotation * outgoing_world;\n\n let bxdf = self.random_matching_bxdf(types, sample.one_d)?;\n\n bxdf.sample_wavelength(outgoing, sample.two_d, light_wave_index)\n .map(|mut s| {\n s.incident = rotation.reversed() * s.incident;\n s\n })\n }\n\n pub fn pdf(\n &self,\n normal: Vector3,\n incident_world: Vector3,\n outgoing_world: Vector3,\n types: Type,\n ) -> Float {\n let rotation = world_to_bxdf(normal);\n let incident = rotation * incident_world;\n let outgoing = rotation * outgoing_world;\n\n let (pdf, num) = self\n .bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(types) {\n Some(bxdf.pdf(incident, outgoing))\n } else {\n None\n }\n })\n .fold((0.0, 0usize), |(a, num), b| (a + b, num + 1));\n\n if num > 0 {\n pdf / num as Float\n } else {\n 0.0\n }\n }\n}\n"},"middle":{"kind":"string","value":"s &= !Type::REFLECTION;\n }\n\n self.bxdfs\n .iter()\n .filter_map(|bxdf| {\n if bxdf.is_type(types) {\n Some(bxdf.evaluate_wavelength(incident, outgoing, light_wave_index))\n } else {\n None\n }\n })\n .sum()\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"#[inline(always)]\n\npub fn flip(mut v: Vector3) -> Vector3 {\n\n debug_assert!(is_finite(v));\n\n\n\n v.y = -v.y;\n\n v\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":0,"score":314455.87686131534},{"content":"/// Computes the Fresnel reflection for dielectric materials and unpolarized light.\n\n///\n\n/// # Arguments\n\n/// * `cos_i` - The cosine of the angle between normal and incident\n\n/// * `eta_i` - The index of refraction for the incident medium\n\n/// * `eta_t` - The index of refraction for the transmission medium\n\n///\n\n/// # Returns\n\n/// * The Fresnel reflectance\n\npub fn fresnel_dielectric(mut cos_i: Float, mut eta_i: Float, mut eta_t: Float) -> Float {\n\n // potentially swap indices of refraction\n\n let entering = cos_i > 0.0;\n\n if !entering {\n\n swap(&mut eta_i, &mut eta_t);\n\n cos_i = cos_i.abs();\n\n }\n\n\n\n // compute cos_t using Snell's law\n\n let sin_i = cos_i.mul_add(-cos_i, 1.0).fast_max(0.0).sqrt();\n\n let sin_t = eta_i * sin_i / eta_t;\n\n\n\n // handle total internal reflection\n\n if sin_t >= 1.0 {\n\n return 1.0;\n\n }\n\n\n\n let cos_t = Float::fast_max(0.0, 1.0 - sin_t * sin_t).sqrt();\n\n let r_par = dielectric_parallel(cos_i, cos_t, eta_i, eta_t);\n\n let r_perp = dielectric_perpendicular(cos_i, cos_t, eta_i, eta_t);\n\n\n\n 0.5 * (r_par * r_par + r_perp * r_perp)\n\n}\n\n\n","file_path":"src/bxdf/fresnel.rs","rank":1,"score":312545.02273111563},{"content":"#[inline(always)]\n\npub fn world_to_bxdf(v: Vector3) -> Rotation {\n\n debug_assert!(is_finite(v));\n\n\n\n if v == Vector3::unit_y() {\n\n Rotation::None\n\n } else if v == -Vector3::unit_y() {\n\n Rotation::Flip\n\n } else {\n\n Rotation::Some(Rotation3::from_rotation_between(v, bxdf_normal()))\n\n }\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":2,"score":311161.4234729241},{"content":"#[inline(always)]\n\npub fn bxdf_is_parallel(v: Vector3) -> bool {\n\n debug_assert!(is_finite(v));\n\n\n\n v.y == 0.0\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":3,"score":310681.87621380785},{"content":"#[inline(always)]\n\npub fn flip_if_neg(mut v: Vector3) -> Vector3 {\n\n debug_assert!(is_finite(v));\n\n\n\n if is_neg(v) {\n\n v.y = -v.y;\n\n }\n\n v\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":4,"score":310529.276491896},{"content":"#[inline(always)]\n\npub fn same_hemisphere(a: Vector3, b: Vector3) -> bool {\n\n debug_assert!(is_finite(a));\n\n debug_assert!(is_finite(b));\n\n\n\n a.y * b.y > 0.0\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":5,"score":310337.7389167171},{"content":"#[inline(always)]\n\npub fn is_normalized(v: Vector3) -> bool {\n\n v.mag()\n\n .in_range(1.0 - Float::big_epsilon(), 1.0 + Float::big_epsilon())\n\n}\n\n\n","file_path":"src/debug_utils.rs","rank":6,"score":306508.5887767294},{"content":"#[inline(always)]\n\npub fn is_neg(v: Vector3) -> bool {\n\n debug_assert!(is_finite(v));\n\n\n\n v.y < 0.0\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":7,"score":305390.830309698},{"content":"#[inline]\n\npub fn cos_d_phi(a: Vector3, b: Vector3) -> Float {\n\n debug_assert!(is_finite(a));\n\n debug_assert!(is_finite(b));\n\n\n\n let abxz = a.x * b.x + a.z * b.z;\n\n let axz = a.x * a.x + a.z * a.z;\n\n let bxz = b.x * b.x + b.z * b.z;\n\n\n\n Float::fast_clamp(abxz / Float::sqrt(axz * bxz), -1.0, 1.0)\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":8,"score":305012.75689267385},{"content":"#[inline]\n\npub fn is_normalized(v: &Vector3) -> bool {\n\n v.mag()\n\n .in_range(1.0 - Float::big_epsilon(), 1.0 + Float::big_epsilon())\n\n}\n","file_path":"geometry/src/debug_util.rs","rank":9,"score":302200.3218909985},{"content":"#[inline(always)]\n\npub fn bxdf_incident_to(v: Vector3) -> Vector3 {\n\n debug_assert!(is_finite(v));\n\n\n\n Vector3::new(-v.x, v.y, -v.z)\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":10,"score":299635.428631683},{"content":"#[inline(always)]\n\npub fn sin2_theta(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n 0.0.fast_max(1.0 - cos2_theta(v))\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":11,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn tan_theta(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n sin_theta(v) / cos_theta(v)\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":12,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn sin_phi(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n let sin_theta = sin_theta(v);\n\n if sin_theta == 0.0 {\n\n 0.0\n\n } else {\n\n Float::fast_clamp(v.z / sin_theta, -1.0, 1.0)\n\n }\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":13,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn sin2_phi(v: Vector3) -> Float {\n\n let sin_phi = sin_phi(v);\n\n sin_phi * sin_phi\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":14,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn cos2_phi(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n let cos_phi = cos_phi(v);\n\n cos_phi * cos_phi\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":15,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn tan2_theta(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n sin2_theta(v) / cos2_theta(v)\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":16,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn cos_theta(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n v.y\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":17,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn cos2_theta(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n cos_theta(v) * cos_theta(v)\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":18,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn sin_theta(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n sin2_theta(v).sqrt()\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":19,"score":299603.16152104887},{"content":"#[inline(always)]\n\npub fn cos_phi(v: Vector3) -> Float {\n\n debug_assert!(is_finite(v));\n\n\n\n let sin_theta = sin_theta(v);\n\n if sin_theta == 0.0 {\n\n 0.0\n\n } else {\n\n Float::fast_clamp(v.x / sin_theta, -1.0, 1.0)\n\n }\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":20,"score":299603.16152104887},{"content":"#[inline]\n\npub fn refract(v: Vector3, n: Vector3, eta: Float) -> Option<Vector3> {\n\n let cos_i = n.dot(v);\n\n let sin_t2 = eta * eta * cos_i.mul_add(-cos_i, 1.0).fast_max(0.0);\n\n\n\n if sin_t2 > 1.0 {\n\n None\n\n } else {\n\n let cos_t = Float::sqrt(1.0 - sin_t2);\n\n let right = eta.mul_add(cos_i, -cos_t);\n\n let r = eta * -v + right * n;\n\n\n\n Some(r)\n\n }\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":21,"score":296668.3227255035},{"content":"#[inline(always)]\n\npub fn bxdf_normal() -> Vector3 {\n\n Vector3::unit_y()\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":22,"score":293652.6682972184},{"content":"#[inline]\n\npub fn search_index(slice: &[Float], value: Float) -> Result<usize, (usize, usize)> {\n\n match slice.binary_search_by(|a| a.fast_cmp(value)) {\n\n Ok(index) => Ok(index),\n\n Err(index) => Err((index - 1, index)),\n\n }\n\n}\n\n\n","file_path":"src/refractive_index/mod.rs","rank":23,"score":280097.33754956257},{"content":"#[inline]\n\n#[must_use]\n\npub fn sinc(mut x: Float) -> Float {\n\n debug_assert!(x.is_finite());\n\n\n\n x = x.abs();\n\n\n\n if x < Float::epsilon() {\n\n 1.0\n\n } else {\n\n let pix = PI * x;\n\n Float::sin(pix) / pix\n\n }\n\n}\n\n\n","file_path":"utility/src/math.rs","rank":24,"score":275540.71709813434},{"content":"fn random_bsdf(color: Spectrum) -> (bool, BSDF) {\n\n let rand = fastrand::f32();\n\n\n\n let mut out = false;\n\n let bsdf = if color == Spectrum::from(Colors::White) {\n\n if rand < 0.6 {\n\n out = true;\n\n BSDF::empty()\n\n } else if rand < 0.8 {\n\n let specular = SpecularReflection::new(Spectrum::broadcast(1.0), FresnelType::NoOp);\n\n let bxdf = Box::new(specular);\n\n\n\n BSDF::new(vec![bxdf])\n\n } else {\n\n let specular = SpecularTransmission::new(\n\n Spectrum::broadcast(1.0),\n\n RefractiveType::Air,\n\n RefractiveType::Glass,\n\n );\n\n let bxdf = Box::new(specular);\n","file_path":"demos/src/demo_scenes/spheres.rs","rank":25,"score":269073.51323521324},{"content":"fn parse_vector3(iter: &mut SplitWhitespace) -> Vector3 {\n\n let x = iter.next().unwrap().parse().unwrap();\n\n let y = iter.next().unwrap().parse().unwrap();\n\n let z = iter.next().unwrap().parse().unwrap();\n\n\n\n Vector3::new(x, y, z)\n\n}\n\n\n","file_path":"geometry/src/obj_file.rs","rank":26,"score":267342.05882837705},{"content":"#[inline(always)]\n\npub fn is_not_nan(v: Vector3) -> bool {\n\n !(v.x.is_nan() && v.y.is_nan() && v.z.is_nan())\n\n}\n\n\n","file_path":"src/debug_utils.rs","rank":27,"score":265511.73670604377},{"content":"#[inline(always)]\n\npub fn is_finite(v: Vector3) -> bool {\n\n v.x.is_finite() && v.y.is_finite() && v.z.is_finite()\n\n}\n\n\n","file_path":"src/debug_utils.rs","rank":28,"score":265511.7367060437},{"content":"/// Offsets a point by an epsilon into the normal direction, depending on the angle to the given\n\n/// direction.\n\n///\n\n/// # Constraints\n\n/// * `point` - ALl values should be finite (neither infinite nor `NaN`).\n\n/// * `normal` - All values should be finite.\n\n/// Should be normalized.\n\n/// * `direction` - Should be finite.\n\n/// (Does not need to be normalized.)\n\n///\n\n/// # Arguments\n\n/// * `point` - The starting point\n\n/// * `normal` - The normal vector to offset towards\n\n/// * `direction` - The direction helper to decide whether to invert the normal\n\n///\n\n/// # Returns\n\n/// * The offset point\n\npub fn offset_point(point: Vector3, normal: Vector3, direction: Vector3) -> Vector3 {\n\n debug_assert!(is_finite(&point));\n\n debug_assert!(is_finite(&normal));\n\n debug_assert!(is_normalized(&normal));\n\n debug_assert!(is_finite(&direction));\n\n\n\n let offset = if direction.dot(normal) >= 0.0 {\n\n normal * Float::big_epsilon()\n\n } else {\n\n normal * -Float::big_epsilon()\n\n };\n\n\n\n point + offset\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":29,"score":264804.84490123286},{"content":"#[inline]\n\npub fn is_not_nan(v: &Vector3) -> bool {\n\n !(v.x.is_nan() && v.y.is_nan() && v.z.is_nan())\n\n}\n\n\n","file_path":"geometry/src/debug_util.rs","rank":30,"score":262073.36122351463},{"content":"#[inline]\n\npub fn is_finite(v: &Vector3) -> bool {\n\n v.x.is_finite() && v.y.is_finite() && v.z.is_finite()\n\n}\n\n\n","file_path":"geometry/src/debug_util.rs","rank":31,"score":262073.36122351463},{"content":"/// Converts spherical coordinates to cartesian coordinates in the following describe frame:\n\n/// * x-axis: to your right\n\n/// * y-axis: to your top\n\n/// * z-axis: towards you\n\n///\n\n/// # Constraints\n\n/// * `theta` - Should be within `[0, 2π]`.\n\n/// * `phi` - Should be within `[0, π]`.\n\n///\n\n/// # Arguments\n\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane.\n\n/// * `phi` - The angle between the `y`-axis and the spherical direction .\n\n///\n\n/// # Returns\n\n/// * The corresponding cartesian vector\n\npub fn spherical_to_cartesian(theta: Float, phi: Float) -> Vector3 {\n\n debug_assert!(theta.in_range_incl(0.0, TAU));\n\n debug_assert!(phi.in_range_incl(0.0, PI));\n\n\n\n let (sin_theta, cos_theta) = theta.sin_cos();\n\n let (sin_phi, cos_phi) = phi.sin_cos();\n\n\n\n spherical_to_cartesian_trig(sin_theta, cos_theta, sin_phi, cos_phi)\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":32,"score":260950.06321202815},{"content":"/// Offsets a point by an epsilon into the normal direction, depending on the angle to the given\n\n/// direction and creates a ray to the target from it.\n\n///\n\n/// If the direction to the parameter `target` shows into the same general direction of this\n\n/// intersection normal, the ray origin will be offset by an epsilon into the intersection\n\n/// normal.\n\n/// Otherwise, the opposite normal will be used.\n\n///\n\n/// # Constraints\n\n/// * `point` - ALl values should be finite (neither infinite nor `NaN`).\n\n/// * `normal` - All values should be finite.\n\n/// Should be normalized.\n\n/// * `target` - Should be finite.\n\n///\n\n/// # Arguments\n\n/// * `point` - The starting point\n\n/// * `normal` - The normal vector to offset towards\n\n/// * `target` - The target position\n\n///\n\n/// # Returns\n\n/// * Ray from this intersection to the target, offset by an epsilon\n\npub fn offset_ray_to(point: Vector3, normal: Vector3, target: Vector3) -> Ray {\n\n debug_assert!(is_finite(&point));\n\n debug_assert!(is_finite(&normal));\n\n debug_assert!(is_normalized(&normal));\n\n debug_assert!(is_finite(&target));\n\n\n\n let dir = target - point;\n\n let origin = offset_point(point, normal, dir);\n\n let direction = target - origin;\n\n\n\n Ray::new(origin, direction.normalized(), 0.0, direction.mag())\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":33,"score":259337.32882106077},{"content":"/// Offsets a point by an epsilon into the normal direction, depending on the angle to the given\n\n/// direction and creates a ray from it.\n\n///\n\n/// If the parameter `direction` shows into the same general direction of this intersection\n\n/// normal, the ray origin will be offset by an epsilon into the intersection normal.\n\n/// Otherwise, the opposite normal will be used.\n\n///\n\n/// # Constraints\n\n/// * `point` - ALl values should be finite (neither infinite nor `NaN`).\n\n/// * `normal` - All values should be finite.\n\n/// Should be normalized.\n\n/// * `direction` - Should be finite.\n\n/// Should be normalized.\n\n///\n\n/// # Arguments\n\n/// * `point` - The starting point\n\n/// * `normal` - The normal vector to offset towards\n\n/// * `direction` - The direction of the ray\n\n///\n\n/// # Returns\n\n/// * Ray from this intersection, offset by an epsilon\n\npub fn offset_ray_towards(point: Vector3, normal: Vector3, direction: Vector3) -> Ray {\n\n debug_assert!(is_finite(&point));\n\n debug_assert!(is_finite(&normal));\n\n debug_assert!(is_normalized(&normal));\n\n debug_assert!(is_finite(&direction));\n\n debug_assert!(is_normalized(&direction));\n\n\n\n let origin = offset_point(point, normal, direction);\n\n\n\n Ray::new_fast(origin, direction)\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":34,"score":256848.1218276039},{"content":"#[inline]\n\npub fn spherical_to_cartesian1(sin_theta: Float, cos_theta: Float, phi: Float) -> Vector3 {\n\n Vector3::new(sin_theta * phi.cos(), sin_theta * phi.sin(), cos_theta)\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":35,"score":252895.87901978503},{"content":"#[inline(always)]\n\npub fn face_forward(v: Vector3, n: Vector3) -> Vector3 {\n\n if n.dot(v) > 0.0 {\n\n v\n\n } else {\n\n -v\n\n }\n\n}\n\n\n","file_path":"src/bxdf/mod.rs","rank":36,"score":249440.73998904292},{"content":"#[inline(always)]\n\npub fn sellmeier_n(lambda: Float) -> Float {\n\n debug_assert!(lambda.is_finite());\n\n\n\n let l2 = lambda * lambda;\n\n let one = 1.03961212 * l2 / (l2 - 6.00069867e-3);\n\n let two = 0.231792344 * l2 / (l2 - 2.00179144e-2);\n\n let three = 1.01046945 * l2 / (l2 - 103.560653);\n\n\n\n Float::sqrt(1.0 + one + two + three)\n\n}\n\n\n\npub static INDEX_K: [Float; 25] = {\n\n [\n\n 0.3, 0.31, 0.32, 0.334, 0.35, 0.365, 0.37, 0.38, 0.39, 0.4, 0.405, 0.42, 0.436, 0.46, 0.5,\n\n 0.546, 0.58, 0.62, 0.66, 0.7, 1.06, 1.53, 1.97, 2.325, 2.5,\n\n ]\n\n};\n\npub static K: [Float; 25] = {\n\n [\n\n 0.0000028607,\n","file_path":"src/refractive_index/glass.rs","rank":37,"score":247819.23745907645},{"content":"#[inline(always)]\n\npub fn sellmeier_n(lambda: Float) -> Float {\n\n let l2 = lambda * lambda;\n\n let one = 1.43134930 * l2 / (l2 - 5.2799261e-3);\n\n let two = 0.65054713 * l2 / (l2 - 1.42382647e-2);\n\n let three = 5.3414021 * l2 / (l2 - 325.017834);\n\n\n\n Float::sqrt(1.0 + one + two + three)\n\n}\n\n\n\npub static INDEX_K: [Float; 612] = {\n\n [\n\n 0.21, 0.22, 0.23, 0.24, 0.25, 0.26, 0.27, 0.28, 0.29, 0.3, 0.31, 0.32, 0.33, 0.34, 0.35,\n\n 0.36, 0.37, 0.38, 0.39, 0.4, 0.41, 0.42, 0.43, 0.44, 0.45, 0.46, 0.47, 0.48, 0.49, 0.5,\n\n 0.51, 0.52, 0.53, 0.54, 0.55, 0.56, 0.57, 0.58, 0.59, 0.6, 0.61, 0.62, 0.63, 0.64, 0.65,\n\n 0.66, 0.67, 0.68, 0.69, 0.7, 0.71, 0.72, 0.73, 0.74, 0.75, 0.76, 0.77, 0.78, 0.79, 0.8,\n\n 0.81, 0.82, 0.83, 0.84, 0.85, 0.86, 0.87, 0.88, 0.89, 0.9, 0.91, 0.92, 0.93, 0.94, 0.95,\n\n 0.96, 0.97, 0.98, 0.99, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.1,\n\n 1.11, 1.12, 1.13, 1.14, 1.15, 1.16, 1.17, 1.18, 1.19, 1.2, 1.21, 1.22, 1.23, 1.24, 1.25,\n\n 1.26, 1.27, 1.28, 1.29, 1.3, 1.31, 1.32, 1.33, 1.34, 1.35, 1.36, 1.37, 1.38, 1.39, 1.4,\n\n 1.41, 1.42, 1.43, 1.44, 1.45, 1.46, 1.47, 1.48, 1.49, 1.5, 1.51, 1.52, 1.53, 1.54, 1.55,\n","file_path":"src/refractive_index/sapphire.rs","rank":38,"score":247819.23745907645},{"content":"#[inline(always)]\n\npub fn sellmeier_n(lambda: Float) -> Float {\n\n debug_assert!(lambda.is_finite());\n\n\n\n let l2 = lambda * lambda;\n\n\n\n let one = 0.75831 * l2 / (l2 - 0.01007);\n\n let two = 0.08495 * l2 / (l2 - 8.91377);\n\n\n\n Float::sqrt(1.0 + one + two)\n\n}\n","file_path":"src/refractive_index/air.rs","rank":39,"score":247819.23745907645},{"content":"#[allow(dead_code)]\n\npub fn roughness_to_alpha(roughness: Float) -> Float {\n\n let roughness = Float::big_epsilon().fast_max(roughness);\n\n let x = roughness.ln();\n\n let x2 = x * x;\n\n\n\n 1.62142 + 0.819955 * x + 0.1734 * x2 + 0.0171201 * x2 * x + 0.000640711 * x2 * x2\n\n}\n\n\n","file_path":"src/bxdf/microfacet.rs","rank":40,"score":246900.3098362992},{"content":"/// Converts spherical coordinates to cartesian coordinates in the given frame wth following description:\n\n/// * `frame.x_axis`: to your right\n\n/// * `frame.y_axis`: to your top\n\n/// * `frame.z_axis`: towards you\n\n///\n\n/// # Constraints\n\n/// * `theta` - Should be within `[0, 2π]`.\n\n/// * `phi` - Should be within `[0, π]`.\n\n///\n\n/// # Arguments\n\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane\n\n/// * `phi` - The angle between the `y`-axis and the spherical direction\n\n/// * `frame` - The coordinate system/frame to use\n\n///\n\n/// # Returns\n\n/// * The corresponding cartesian vector\n\npub fn spherical_to_cartesian_frame(theta: Float, phi: Float, frame: &CoordinateSystem) -> Vector3 {\n\n debug_assert!(theta.in_range_incl(0.0, TAU));\n\n debug_assert!(phi.in_range_incl(0.0, PI));\n\n\n\n let (sin_theta, cos_theta) = theta.sin_cos();\n\n let (sin_phi, cos_phi) = phi.sin_cos();\n\n\n\n spherical_to_cartesian_frame_trig(sin_theta, cos_theta, sin_phi, cos_phi, frame)\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":41,"score":243502.16791036475},{"content":"#[inline]\n\npub fn bxdf_to_world(v: Vector3) -> Rotation3 {\n\n debug_assert!(is_finite(v));\n\n\n\n if v == Vector3::unit_y() {\n\n Rotation3::default()\n\n } else if v == -Vector3::unit_y() {\n\n Rotation3::from_rotation_xy(-PI)\n\n } else {\n\n Rotation3::from_rotation_between(bxdf_normal(), v)\n\n }\n\n}\n\n\n\nbitflags! {\n\n /// All BxDF have types, for example\n\n /// * `BRDF` - Bidirectional Reflection Function\n\n /// * `BTDF` - Bidirectional Transmission Function\n\n /// All these have properties like being `reflective`, `transmissive`, `diffuse`, `glossy`,\n\n /// `specular` or be any mixture in between.\n\n ///\n\n /// This type allows bit-flagging these properties at will.\n","file_path":"src/bxdf/mod.rs","rank":42,"score":242081.30585776718},{"content":"#[inline]\n\npub fn sample_cone(sample: Vector2, cos_theta_max: Float) -> Vector3 {\n\n debug_assert!(within_01(sample));\n\n\n\n let cos_theta = cos_theta_max.lerp(1.0, sample.x);\n\n let sin_theta = cos_theta.mul_add(-cos_theta, 1.0).sqrt();\n\n let (sin_phi, cos_phi) = Float::sin_cos(sample.y * TAU as Float);\n\n\n\n spherical_to_cartesian_trig(sin_theta, cos_theta, sin_phi, cos_phi)\n\n}\n\n\n\n/// Samples a cone around the `frame.e2` axis with a uniform distribution described by the sample.\n\n///\n\n/// # Constraints\n\n/// * `sample` - All values should be within `[0, 1]`.\n\n///\n\n/// # Arguments\n\n/// * `sample` - A random sample in `[0, 1]`\n\n/// * `cos_theta_max` - The max angle\n\n/// * `frame` - The coordinate system frame. Y-axis is \"up\"-axis.\n\n///\n\n/// # Results\n\n// * `Vector3` - A direction in the cone around `frame.e2`\n","file_path":"src/mc.rs","rank":43,"score":239797.6796491807},{"content":"pub fn index_to_vec2(index: usize, height: usize) -> UVec2 {\n\n let y = index / height;\n\n let x = index % height;\n\n\n\n UVec2::new(x as u32, y as u32)\n\n}\n\n\n\nuse crate::sensor::bounds::UBounds2;\n\nuse crate::sensor::sensor_tile::SensorTile;\n\nuse crate::Float;\n\nuse parking_lot::Mutex;\n\n\n\npub struct Sensor {\n\n pub resolution: UVec2,\n\n // pub filter: Box<dyn Filter>,\n\n pub filename: Option<String>,\n\n pub bounds: UBounds2,\n\n pub block_size: UVec2,\n\n pub tiles: Vec<Mutex<SensorTile>>,\n\n}\n","file_path":"src/sensor/mod.rs","rank":44,"score":237696.16962290113},{"content":"#[inline]\n\npub fn dielectric_parallel(cos_i: Float, cos_t: Float, eta_i: Float, eta_t: Float) -> Float {\n\n let it = eta_i * cos_t;\n\n let ti = eta_t * cos_i;\n\n\n\n (ti - it) / (ti + it)\n\n}\n\n\n\n/// Computes the fraction of reflected light for perpendicular polarized light.\n\n///\n\n/// # Arguments\n\n/// * `cos_i` - The cosine of the angle between normal and incident\n\n/// * `cos_t` - The cosine of the angle between normal and transmission\n\n/// * `eta_i` - The index of refraction for the incident medium\n\n/// * `eta_t` - The index of refraction for the transmission medium\n\n///\n\n/// # Returns\n\n/// * The amount of light reflected\n","file_path":"src/bxdf/fresnel.rs","rank":45,"score":234651.22399795073},{"content":"#[inline]\n\npub fn dielectric_perpendicular(cos_i: Float, cos_t: Float, eta_i: Float, eta_t: Float) -> Float {\n\n let tt = eta_t * cos_t;\n\n let ii = eta_i * cos_i;\n\n\n\n (ii - tt) / (ii + tt)\n\n}\n\n\n","file_path":"src/bxdf/fresnel.rs","rank":46,"score":234651.22399795073},{"content":"#[inline]\n\n#[cfg(feature = \"watertight-mesh\")]\n\nfn max_index(v: Vector3) -> usize {\n\n if v.x > v.y {\n\n if v.x > v.z {\n\n return 0;\n\n }\n\n } else if v.y > v.z {\n\n return 1;\n\n }\n\n\n\n 2\n\n}\n\n\n\n#[derive(Copy, Clone, Debug, Deserialize, Serialize)]\n\npub struct Vertex {\n\n pub position: Vector3,\n\n #[serde(default)]\n\n pub normal: Vector3,\n\n}\n\n\n\n/// A triangle consists of vertex indices `(v0, v1, v2)`.\n","file_path":"geometry/src/mesh.rs","rank":47,"score":214672.46218695803},{"content":"#[allow(clippy::excessive_precision)]\n\n#[inline]\n\n#[must_use]\n\npub fn erf(x: Float) -> Float {\n\n // constants\n\n let a1 = 0.254829592;\n\n let a2 = -0.284496736;\n\n let a3 = 1.421413741;\n\n let a4 = -1.453152027;\n\n let a5 = 1.061405429;\n\n let p = 0.3275911;\n\n\n\n // Save the sign of x\n\n let sign = x.signum();\n\n let x = x.abs();\n\n\n\n // A&S formula 7.1.26\n\n let t = 1.0 / (1.0 + p * x);\n\n let y = 1.0 - (((((a5 * t + a4) * t) + a3) * t + a2) * t + a1) * t * Float::exp(-x * x);\n\n\n\n sign * y\n\n}\n\n\n","file_path":"utility/src/math.rs","rank":48,"score":213333.045576721},{"content":"#[allow(clippy::excessive_precision)]\n\n#[inline]\n\n#[must_use]\n\npub fn erf_inv(x: Float) -> Float {\n\n let x = Float::fast_clamp(x, -1.0 + Float::big_epsilon(), 1.0 - Float::big_epsilon());\n\n\n\n let mut w = -Float::ln((1.0 - x) * (1.0 + x));\n\n let mut p: Float;\n\n if w < 5.0 {\n\n w -= 2.5;\n\n p = 2.81022636e-08;\n\n p = 3.43273939e-07 + p * w;\n\n p = -3.5233877e-06 + p * w;\n\n p = -4.39150654e-06 + p * w;\n\n p = 0.00021858087 + p * w;\n\n p = -0.00125372503 + p * w;\n\n p = -0.00417768164 + p * w;\n\n p = 0.246640727 + p * w;\n\n p = 1.50140941 + p * w;\n\n } else {\n\n w = w.sqrt() - 3.0;\n\n p = -0.000200214257;\n\n p = 0.000100950558 + p * w;\n","file_path":"utility/src/math.rs","rank":49,"score":210963.87243157963},{"content":"#[inline]\n\npub fn uniform_cone_pdf(cos_theta: Float) -> Float {\n\n 1.0 / (TAU as Float * (1.0 - cos_theta))\n\n}\n","file_path":"src/mc.rs","rank":50,"score":206480.60670586186},{"content":"#[inline]\n\n#[must_use]\n\npub fn solve_quadratic(a: Float, b: Float, c: Float) -> Option<(Float, Float)> {\n\n debug_assert!(a.is_finite());\n\n debug_assert!(b.is_finite());\n\n debug_assert!(c.is_finite());\n\n\n\n if a < Float::epsilon() {\n\n if b < Float::epsilon() {\n\n return None;\n\n }\n\n\n\n let sol = -c / b;\n\n\n\n return Some((sol, sol));\n\n }\n\n\n\n let discriminant = b.mul_add(b, -4.0 * a * c);\n\n if discriminant < 0.0 {\n\n return None;\n\n }\n\n\n","file_path":"utility/src/math.rs","rank":51,"score":205700.91067119088},{"content":"pub fn vec2_to_index(v: UVec2, height: usize) -> usize {\n\n v.x as usize + v.y as usize * height\n\n}\n\n\n","file_path":"src/sensor/mod.rs","rank":52,"score":203522.63226178588},{"content":"#[inline(always)]\n\npub fn within_01(v: Vector2) -> bool {\n\n v.x.in_range_incl_left(0.0, 1.0) && v.y.in_range_incl_left(0.0, 1.0)\n\n}\n","file_path":"src/debug_utils.rs","rank":53,"score":197642.00120492477},{"content":"#[inline]\n\npub fn xyz_of(lambda: Float) -> Xyz {\n\n let lambda = mu_m_to_angstrom(lambda as f64);\n\n Xyz::new([\n\n x_bar(lambda) as Float,\n\n y_bar(lambda) as Float,\n\n z_bar(lambda) as Float,\n\n ])\n\n}\n","file_path":"color/src/cie.rs","rank":54,"score":193563.7524329696},{"content":"fn parse_face(iter: &mut SplitWhitespace) -> Face {\n\n let p = |s: &str| -> u32 { s.splitn(2, '/').next().unwrap().parse().unwrap() };\n\n\n\n let v0 = p(iter.next().unwrap());\n\n let v1 = p(iter.next().unwrap());\n\n let v2 = p(iter.next().unwrap());\n\n\n\n // offset by one because indexing starts at 1 in obj files\n\n let vertices = (v0 - 1, v1 - 1, v2 - 1);\n\n\n\n Face::new(vertices, Vector3::zero())\n\n}\n","file_path":"geometry/src/obj_file.rs","rank":55,"score":192457.35704833388},{"content":"#[inline]\n\npub fn sample_unit_sphere(sample: Vector2) -> Vector3 {\n\n debug_assert!(within_01(sample));\n\n\n\n let z = sample.x.mul_add(-2.0, 1.0);\n\n\n\n let r = z.mul_add(-z, 1.0).fast_max(0.0).sqrt();\n\n let (sin_phi, cos_phi) = Float::sin_cos(sample.y * TAU as Float);\n\n\n\n let x = r * cos_phi;\n\n let y = r * sin_phi;\n\n\n\n Vector3::new(x, y, z)\n\n}\n\n\n\n/// Samples a cone around the `(0, 1, 0)` axis with a uniform distribution described by the sample.\n\n///\n\n/// # Constraints\n\n/// * `sample` - All values should be within `[0, 1]`.\n\n///\n\n/// # Arguments\n\n/// * `sample` - A random sample in `[0, 1]`\n\n/// * `cos_theta_max` - The max angle\n\n///\n\n/// # Results\n\n/// * `Vector3` - A direction in the cone around `(0, 1, 0)`\n","file_path":"src/mc.rs","rank":56,"score":191010.36521111912},{"content":"#[inline]\n\npub fn sample_unit_hemisphere(sample: Vector2) -> Vector3 {\n\n debug_assert!(within_01(sample));\n\n\n\n let d = sample_unit_disk_concentric(sample);\n\n let b = d.y.mul_add(-d.y, 1.0);\n\n let right = d.x.mul_add(-d.x, b);\n\n\n\n // let y = fast_max(0.0, 1.0 - d.x * d.x - d.y * d.y).sqrt();\n\n let y = right.fast_max(0.0).sqrt();\n\n\n\n Vector3::new(d.x, y, d.y)\n\n}\n\n\n\n/// Samples a sphere with a uniform distribution described by the sample.\n\n///\n\n/// # Constraints\n\n/// * `sample` - All values should be within `[0, 1]`.\n\n///\n\n/// # Arguments\n\n/// * `sample` - A random sample\n\n///\n\n/// # Results\n\n/// * A point on the unit sphere around `(0, 0, 0)`\n","file_path":"src/mc.rs","rank":57,"score":191010.36521111912},{"content":"#[inline]\n\npub fn search_and_lerp(\n\n index_slice: &[Float],\n\n value_slice: &[Float],\n\n wavelength_nm: Float,\n\n) -> Float {\n\n match search_index(index_slice, wavelength_nm) {\n\n Ok(i) => value_slice[i],\n\n Err((min, max)) => {\n\n if max >= value_slice.len() {\n\n return value_slice[min];\n\n }\n\n\n\n Float::lerp_map(\n\n min as Float,\n\n max as Float,\n\n value_slice[min],\n\n value_slice[max],\n\n wavelength_nm,\n\n )\n\n }\n\n }\n\n}\n","file_path":"src/refractive_index/mod.rs","rank":58,"score":176403.60335159293},{"content":"fn bench_glass(c: &mut Criterion) {\n\n let mut group = c.benchmark_group(\"Refractive Index of Glass\");\n\n\n\n group.sample_size(10000);\n\n group.warm_up_time(Duration::from_secs(10));\n\n\n\n group.bench_function(\"Search and Get\", |b| {\n\n b.iter(|| search_and_lerp(&glass::INDEX_N, &glass::N, black_box(300.0)))\n\n });\n\n\n\n // NOTICE: was too slow, so we removed the function.\n\n // group.bench_function(\"Calculate\", |b| {\n\n // b.iter(|| sellmeier_n(black_box(0.3), &glass::INDEX_N, &glass::N))\n\n // });\n\n\n\n group.bench_function(\"Calculate Optimized\", |b| {\n\n b.iter(|| glass::sellmeier_n(black_box(0.3)))\n\n });\n\n}\n\n\n\ncriterion_group!(benches, bench_glass);\n\ncriterion_main!(benches);\n","file_path":"benches/refractive_index.rs","rank":59,"score":175530.10445764769},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Float = f32;\n","file_path":"src/lib.rs","rank":60,"score":151335.6679760997},{"content":"#[cfg(feature = \"f64\")]\n\ntype Float = f64;\n","file_path":"src/lib.rs","rank":61,"score":151335.6679760997},{"content":"#[allow(clippy::excessive_precision)]\n\n#[inline]\n\nfn uncompand(val: Float) -> Float {\n\n // https://entropymine.com/imageworsener/srgbformula/\n\n if val <= 0.0404482362771082 {\n\n val / 12.92\n\n } else {\n\n ((val + 0.055) / 1.055).powf(2.4)\n\n }\n\n}\n","file_path":"color/src/srgb.rs","rank":62,"score":149848.22350280272},{"content":"#[allow(clippy::excessive_precision)]\n\n#[inline]\n\nfn compand(val: Float) -> Float {\n\n // https://entropymine.com/imageworsener/srgbformula/\n\n if val <= 0.00313066844250063 {\n\n val * 12.92\n\n } else {\n\n 1.055 * val.powf(1.0 / 2.4) - 0.055\n\n }\n\n}\n","file_path":"color/src/xyz.rs","rank":63,"score":149848.22350280272},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Float = f32;\n","file_path":"demos/src/main.rs","rank":64,"score":149359.4343418007},{"content":"#[cfg(feature = \"f64\")]\n\ntype Float = f64;\n","file_path":"demos/src/main.rs","rank":65,"score":149359.4343418007},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Float = f32;\n","file_path":"color/src/lib.rs","rank":66,"score":149359.4343418007},{"content":"#[cfg(feature = \"f64\")]\n\ntype Float = f64;\n\n\n\nbig_array! {\n\n SerdeBigArray;\n\n 3, LAMBDA_NUM\n\n}\n\n\n\n#[allow(clippy::large_enum_variant)]\n\n#[derive(Clone, Debug, Serialize, Deserialize)]\n\npub enum SerdeColors {\n\n Srgb([Float; 3]),\n\n Xyz([Float; 3]),\n\n #[serde(with = \"SerdeBigArray\")]\n\n Spectrum([Float; 36]),\n\n Color(Colors),\n\n MulColor(Float, Colors),\n\n Constant(Float),\n\n}\n\n\n\n#[macro_export]\n","file_path":"color/src/lib.rs","rank":67,"score":149359.4343418007},{"content":"#[cfg(feature = \"f64\")]\n\ntype Float = f64;\n","file_path":"utility/src/lib.rs","rank":68,"score":149359.4343418007},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Float = f32;\n","file_path":"utility/src/lib.rs","rank":69,"score":149359.4343418007},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Vector3 = ultraviolet::Vec3;\n","file_path":"src/lib.rs","rank":70,"score":146112.4098223541},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Float = f32;\n","file_path":"demos/src/demo_scenes/mod.rs","rank":71,"score":145664.017488275},{"content":"#[cfg(feature = \"f64\")]\n\ntype Float = f64;\n","file_path":"demos/src/demo_scenes/mod.rs","rank":72,"score":145664.017488275},{"content":"fn look_at(position: Vector3, target: Vector3, up: Vector3) -> Matrix4 {\n\n let w = (position - target).normalized();\n\n let u = up.cross(w).normalized();\n\n let v = w.cross(u);\n\n\n\n Matrix4::new(\n\n u.into_homogeneous_vector(),\n\n v.into_homogeneous_vector(),\n\n w.into_homogeneous_vector(),\n\n position.into_homogeneous_point(),\n\n )\n\n}\n\n\n","file_path":"src/camera/perspective_simone.rs","rank":73,"score":145327.0347489479},{"content":"#[cfg(feature = \"f64\")]\n\ntype Vector3 = ultraviolet::DVec3;\n","file_path":"src/lib.rs","rank":74,"score":144222.75026748804},{"content":"#[cfg(not(feature = \"f64\"))]\n\ntype Vector3 = ultraviolet::Vec3;\n","file_path":"demos/src/demo_scenes/mod.rs","rank":75,"score":140684.00552169816},{"content":"#[cfg(feature = \"f64\")]\n\ntype Vector3 = ultraviolet::DVec3;\n\n\n\npub const SIGMA: Float = 20.0;\n\npub const FOVY: Float = 70.0;\n\n\n","file_path":"demos/src/demo_scenes/mod.rs","rank":76,"score":139024.9232040021},{"content":"fn random_color() -> Spectrum {\n\n let rand = fastrand::f32() * 1.5;\n\n\n\n if rand < 0.25 {\n\n Spectrum::from(Colors::Red)\n\n } else if rand < 0.5 {\n\n Spectrum::from(Colors::Green)\n\n } else if rand < 0.75 {\n\n Spectrum::from(Colors::Blue)\n\n } else {\n\n Spectrum::from(Colors::White)\n\n }\n\n}\n\n\n","file_path":"demos/src/demo_scenes/spheres.rs","rank":77,"score":138684.1588907952},{"content":"#[inline]\n\npub fn sample_vector_from_angle(\n\n direction: Vector3,\n\n sin_theta_max: Float,\n\n sample: Vector2,\n\n) -> Vector3 {\n\n debug_assert!(within_01(sample));\n\n\n\n let frame = CoordinateSystem::from_y(direction);\n\n\n\n let sample = sample_unit_disk_concentric(sample) * sin_theta_max;\n\n\n\n let right = frame.x_axis * sample.x;\n\n let forward = frame.z_axis * sample.y;\n\n\n\n (direction + right + forward).normalized()\n\n}\n\n\n\n/// Samples a non-concentric mapped point from the given random sample.\n\n///\n\n/// # Constraints\n\n/// * `sample` - All values should be within `[0, 1]`.\n\n///\n\n/// # Arguments\n\n/// * `sample` - A random sample\n\n///\n\n/// # Results\n\n/// * A non-concentric sample on the unit disk\n","file_path":"src/mc.rs","rank":78,"score":137347.2868606061},{"content":"fn random_pos() -> Vector3 {\n\n let (x, z) = {\n\n #[cfg(feature = \"f64\")]\n\n {\n\n (\n\n DISTRIBUTION * (fastrand::f64() - 0.5),\n\n DISTRIBUTION * (fastrand::f64() - 0.5),\n\n )\n\n }\n\n #[cfg(not(feature = \"f64\"))]\n\n {\n\n (\n\n DISTRIBUTION * (fastrand::f32() - 0.5),\n\n DISTRIBUTION * (fastrand::f32() - 0.5),\n\n )\n\n }\n\n };\n\n\n\n Vector3::new(x, RADIUS, z)\n\n}\n\n\n","file_path":"demos/src/demo_scenes/spheres.rs","rank":79,"score":136464.4216867635},{"content":"/// Converts spherical coordinates to cartesian coordinates in the following described frame:\n\n/// * x-axis: to your right\n\n/// * y-axis: to your top\n\n/// * z-axis: towards you\n\n///\n\n/// To make below descriptions easier, we define the following:\n\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane.\n\n/// * `phi` - The angle between the `y`-axis and the spherical direction .\n\n///\n\n/// # Constraints\n\n/// * `sin_theta` - Should be within `[-1, 1]`\n\n/// * `cos_theta` - Should be within `[-1, 1]`\n\n/// * `sin_phi` - Should be within `[-1, 1]`\n\n/// * `cos_phi` - Should be within `[-1, 1]`\n\n///\n\n/// # Arguments\n\n/// * `sin_theta` - The sine of `theta`\n\n/// * `cos_theta` - The cosine of `theta`\n\n/// * `sin_phi` - The sine of `phi`\n\n/// * `cos_phi` - The cosine of `phi`\n\n///\n\n/// # Returns\n\n/// * The corresponding cartesian vector\n\npub fn spherical_to_cartesian_trig(\n\n sin_theta: Float,\n\n cos_theta: Float,\n\n sin_phi: Float,\n\n cos_phi: Float,\n\n) -> Vector3 {\n\n debug_assert!(sin_theta.in_range_incl(-1.0, 1.0));\n\n debug_assert!(cos_theta.in_range_incl(-1.0, 1.0));\n\n debug_assert!(sin_phi.in_range_incl(-1.0, 1.0));\n\n debug_assert!(cos_phi.in_range_incl(-1.0, 1.0));\n\n\n\n let x = sin_phi * sin_theta;\n\n let y = cos_phi;\n\n let z = sin_phi * cos_theta;\n\n\n\n Vector3::new(x, y, z)\n\n}\n\n\n\n/// An intersection consists of the following 4 properties:\n\n/// * `point` - The intersection point\n","file_path":"geometry/src/lib.rs","rank":80,"score":135568.65724394325},{"content":"#[inline]\n\npub fn uniform_sample_cone_frame(\n\n sample: Vector2,\n\n cos_theta_max: Float,\n\n frame: &CoordinateSystem,\n\n) -> Vector3 {\n\n debug_assert!(within_01(sample));\n\n\n\n let cos_theta = cos_theta_max.lerp(1.0, sample.x);\n\n let sin_theta = cos_theta.mul_add(-cos_theta, 1.0).sqrt();\n\n let (sin_phi, cos_phi) = Float::sin_cos(sample.y * TAU as Float);\n\n\n\n spherical_to_cartesian_frame_trig(sin_theta, cos_theta, sin_phi, cos_phi, frame)\n\n}\n\n\n\n/// Computes the pdf for uniformly sampling a code.\n\n///\n\n/// # Arguments\n\n/// * `cos_theta` - The cone angle\n\n///\n\n/// # Results\n\n/// * `Float` - The pdf\n","file_path":"src/mc.rs","rank":81,"score":135565.74022206577},{"content":"#[typetag::serde]\n\npub trait BxDF: Send + Sync {\n\n /// Returns the type of this bxdf.\n\n ///\n\n /// # Results\n\n /// * The type of this BxDF\n\n fn get_type(&self) -> Type;\n\n\n\n /// Allows matching the user-supplied type to this BxDF.\n\n ///\n\n /// # Results\n\n /// * Whether the type matches.\n\n fn is_type(&self, t: Type) -> bool {\n\n let st = self.get_type();\n\n (st & t) == st\n\n }\n\n\n\n /// Evaluates the BxDF for the pair of incident and outgoing light directions and the\n\n /// intersection normal.\n\n ///\n\n /// # Constraints\n","file_path":"src/bxdf/mod.rs","rank":82,"score":135165.44761380192},{"content":"/// Converts spherical coordinates to cartesian coordinates in the given frame wth following description:\n\n/// * `frame.x_axis`: to your right\n\n/// * `frame.y_axis`: to your top\n\n/// * `frame.z_axis`: towards you\n\n///\n\n/// To make below descriptions easier, we define the following:\n\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane.\n\n/// * `phi` - The angle between the `y`-axis and the spherical direction.\n\n///\n\n/// # Constraints\n\n/// * `sin_theta` - Should be within `[-1, 1]`\n\n/// * `cos_theta` - Should be within `[-1, 1]`\n\n/// * `sin_phi` - Should be within `[-1, 1]`\n\n/// * `cos_phi` - Should be within `[-1, 1]`\n\n///\n\n/// # Arguments\n\n/// * `sin_theta` - The sine of `theta`\n\n/// * `cos_theta` - The cosine of `theta`\n\n/// * `sin_phi` - The sine of `phi`\n\n/// * `cos_phi` - The cosine of `phi`\n\n/// * `frame` - The coordinate system/frame to use\n\n///\n\n/// # Returns\n\n/// * The corresponding cartesian vector\n\npub fn spherical_to_cartesian_frame_trig(\n\n sin_theta: Float,\n\n cos_theta: Float,\n\n sin_phi: Float,\n\n cos_phi: Float,\n\n frame: &CoordinateSystem,\n\n) -> Vector3 {\n\n debug_assert!(sin_theta.in_range_incl(-1.0, 1.0));\n\n debug_assert!(cos_theta.in_range_incl(-1.0, 1.0));\n\n debug_assert!(sin_phi.in_range_incl(-1.0, 1.0));\n\n debug_assert!(cos_phi.in_range_incl(-1.0, 1.0));\n\n\n\n let x = frame.x_axis * sin_phi * sin_theta;\n\n let y = frame.y_axis * cos_phi;\n\n let z = frame.z_axis * sin_phi * cos_theta;\n\n\n\n x + y + z\n\n}\n\n\n","file_path":"geometry/src/lib.rs","rank":83,"score":133865.2851204726},{"content":"#[inline]\n\npub fn x_bar(lambda: f64) -> f64 {\n\n gaussian(lambda, 1.056, 5998.0, 379.0, 310.0)\n\n + gaussian(lambda, 0.362, 4420.0, 160.0, 267.0)\n\n + gaussian(lambda, -0.065, 5011.0, 204.0, 262.0)\n\n}\n\n\n","file_path":"color/src/cie.rs","rank":84,"score":126466.3011296334},{"content":"#[inline]\n\npub fn y_bar(lambda: f64) -> f64 {\n\n gaussian(lambda, 0.821, 5688.0, 469.0, 405.0) + gaussian(lambda, 0.286, 5309.0, 163.0, 311.0)\n\n}\n\n\n","file_path":"color/src/cie.rs","rank":85,"score":126466.3011296334},{"content":"#[inline]\n\npub fn z_bar(lambda: f64) -> f64 {\n\n gaussian(lambda, 1.217, 4370.0, 118.0, 360.0) + gaussian(lambda, 0.681, 4590.0, 260.0, 138.0)\n\n}\n\n\n","file_path":"color/src/cie.rs","rank":86,"score":126466.3011296334},{"content":"#[inline]\n\npub fn sample_unit_disk(sample: Vector2) -> Vector2 {\n\n debug_assert!(within_01(sample));\n\n\n\n let theta = sample.x * TAU as Float;\n\n let (sin, cos) = theta.sin_cos();\n\n\n\n sample.y * Vector2::new(cos, sin)\n\n}\n\n\n\n/// Samples a concentric mapped point from the given random sample.\n\n///\n\n/// # Constraints\n\n/// * `sample` - All values should be within `[0, 1]`.\n\n///\n\n/// # Arguments\n\n/// * `sample` - A random sample\n\n///\n\n/// # Results\n\n/// * A concentric sample on the unit disk\n","file_path":"src/mc.rs","rank":87,"score":124831.24884687396},{"content":"#[inline]\n\npub fn sample_unit_disk_concentric(sample: Vector2) -> Vector2 {\n\n debug_assert!(within_01(sample));\n\n\n\n // Map uniform random numbers to [-1,1]^2\n\n let offset = 2.0 * sample - Vector2::one();\n\n\n\n // Handle degeneracy at the origin\n\n if offset.x == 0.0 || offset.y == 0.0 {\n\n return Vector2::zero();\n\n }\n\n\n\n // Apply concentric mapping to point\n\n let (r, theta) = if (offset.x * offset.x) > (offset.y * offset.y) {\n\n (offset.x, FRAC_PI_4 as Float * offset.y / offset.x)\n\n } else {\n\n (\n\n offset.y,\n\n (FRAC_PI_4 as Float).mul_add(-offset.x / offset.y, FRAC_PI_2 as Float),\n\n )\n\n };\n","file_path":"src/mc.rs","rank":88,"score":123262.75856314178},{"content":"pub trait FloatExt {\n\n fn epsilon() -> Self;\n\n fn big_epsilon() -> Self;\n\n fn in_range(&self, min: Self, max: Self) -> bool;\n\n fn in_range_incl(&self, min: Self, max: Self) -> bool;\n\n fn in_range_incl_left(&self, min: Self, max: Self) -> bool;\n\n fn in_range_incl_right(&self, min: Self, max: Self) -> bool;\n\n fn fast_min(self, other: Self) -> Self;\n\n fn fast_max(self, other: Self) -> Self;\n\n fn fast_clamp(self, min: Self, max: Self) -> Self;\n\n fn is_approx_zero(&self) -> bool;\n\n fn is_approx_eq(&self, other: Self) -> bool;\n\n fn is_approx_eq_with(&self, other: Self, tolerance: Self) -> bool;\n\n fn fast_cmp(self, other: Self) -> Ordering;\n\n fn lerp(self, to: Self, t: Self) -> Self;\n\n fn inv_lerp(self, to: Self, res: Self) -> Self;\n\n fn lerp_map(a_from: Self, a_to: Self, b_from: Self, b_to: Self, res: Self) -> Self;\n\n}\n\n\n\nmacro_rules! impl_float_ext {\n","file_path":"utility/src/floats.rs","rank":89,"score":121240.29490826244},{"content":"fn in_range<T: PartialOrd>(t: T, min: T, max: T) -> bool {\n\n min <= t && t <= max\n\n}\n\n\n\nimpl Bound<Vector2> {\n\n pub fn contains(&self, p: Vector2) -> bool {\n\n in_range(p.x, self.min.x, self.max.x) && in_range(p.y, self.min.y, self.max.y)\n\n }\n\n}\n\n\n\nimpl Default for Bounds2 {\n\n fn default() -> Self {\n\n Self {\n\n min: Default::default(),\n\n max: Default::default(),\n\n }\n\n }\n\n}\n\n\n\nimpl Bound<UVec2> {\n","file_path":"src/sensor/bounds.rs","rank":90,"score":113429.4717778429},{"content":"#[inline]\n\nfn etas(\n\n eta_i: RefractiveType,\n\n eta_t: RefractiveType,\n\n outgoing: Vector3,\n\n) -> (RefractiveType, RefractiveType, Vector3) {\n\n debug_assert!(is_normalized(outgoing));\n\n\n\n let entering = cos_theta(outgoing) > 0.0;\n\n if entering {\n\n (eta_i, eta_t, bxdf_normal())\n\n } else {\n\n (eta_t, eta_i, -bxdf_normal())\n\n }\n\n}\n\n\n\n/// Describes a specular reflection\n\n#[derive(Serialize, Deserialize)]\n\npub struct SpecularReflection {\n\n r: Spectrum,\n\n fresnel: FresnelType,\n","file_path":"src/bxdf/specular.rs","rank":91,"score":112956.03130189632},{"content":"#[allow(clippy::too_many_arguments)]\n\nfn direct_illumination_buf(\n\n scene: &Scene,\n\n sampler: Sampler,\n\n strategy: DirectLightStrategy,\n\n hit: &SceneIntersection,\n\n bsdf: &BSDF,\n\n indices: &[usize],\n\n illumination: &mut [Float],\n\n throughput: &[Float],\n\n) {\n\n if bsdf.is_empty() {\n\n return;\n\n }\n\n\n\n let outgoing_world = -hit.ray.direction;\n\n for light in strategy.get_emitters(scene, sampler.get_1d()) {\n\n let sample = light.sample_buf(hit.point, sampler.get_2d(), indices);\n\n\n\n if sample.pdf > 0.0 && sample.occlusion_tester.unoccluded(scene) {\n\n let intensities = bsdf.evaluate_buf(\n","file_path":"src/integrator/mod.rs","rank":92,"score":110371.13924305627},{"content":"#[inline]\n\nfn rand_vec() -> Vector2 {\n\n Vector2::new(rand(), rand())\n\n}\n\n\n\nimpl CameraSampler {\n\n /// Generates a new camera pixel anchor for a given pixel.\n\n ///\n\n /// # Arguments\n\n /// * `pixel` - The pixel we are sampling/generating for.\n\n ///\n\n /// # Returns\n\n /// * A camera pixel anchor in range `[0, 1)`\n\n #[inline]\n\n pub fn sample(&self) -> Vector2 {\n\n match self {\n\n CameraSampler::NoOp => Vector2::broadcast(0.5),\n\n CameraSampler::Random => rand_vec(),\n\n CameraSampler::Concentric => {\n\n sample_unit_disk_concentric(rand_vec()) + Vector2::broadcast(0.5)\n\n }\n\n CameraSampler::NonConcentric => sample_unit_disk(rand_vec()) + Vector2::broadcast(0.5),\n\n }\n\n }\n\n}\n","file_path":"src/samplers/camera/mod.rs","rank":93,"score":107156.78298387559},{"content":"/// Provides an interface for computing Fresnel reflection coefficients.\n\npub trait Fresnel: Send + Sync {\n\n /// Evaluates the amount of light reflected by the surface.\n\n ///\n\n /// # Arguments\n\n /// * `cos_i` -The cosine of the angle between the normal and the incident\n\n ///\n\n /// # Returns\n\n /// * The reflectance\n\n fn evaluate(&self, cos_i: Float) -> Spectrum;\n\n\n\n fn evaluate_lambda(&self, lambda: Float, cos_i: Float) -> Float;\n\n}\n\n\n\n/// An implementation of `Fresnel` for dielectric materials.\n\n#[derive(Serialize, Deserialize)]\n\npub struct FresnelDielectric {\n\n pub eta_i: RefractiveType,\n\n pub eta_t: RefractiveType,\n\n}\n\n\n","file_path":"src/bxdf/fresnel.rs","rank":94,"score":106621.94004222621},{"content":"#[typetag::serde]\n\npub trait MicrofacetDistribution: Send + Sync {\n\n fn d(&self, wh: Vector3) -> Float;\n\n\n\n fn lambda(&self, w: Vector3) -> Float;\n\n\n\n fn g1(&self, w: Vector3) -> Float {\n\n 1.0 / (1.0 + self.lambda(w))\n\n }\n\n\n\n fn g(&self, wi: Vector3, wo: Vector3) -> Float {\n\n 1.0 / (1.0 + self.lambda(wo) + self.lambda(wi))\n\n }\n\n\n\n fn sample_wh(&self, wo: Vector3, sample: Vector2) -> Vector3;\n\n\n\n fn pdf(&self, wo: Vector3, wh: Vector3) -> Float {\n\n if self.is_sample_visible_area() {\n\n self.d(wh) * self.g1(wo) * wo.dot(wh).abs() / cos_theta(wo).abs()\n\n } else {\n\n self.d(wh) * cos_theta(wh).abs()\n","file_path":"src/bxdf/microfacet.rs","rank":95,"score":104919.51150843641},{"content":"#[inline]\n\npub fn gaussian(lambda: f64, alpha: f64, mu: f64, sigma1: f64, sigma2: f64) -> f64 {\n\n let t = (lambda - mu) / if lambda < mu { sigma1 } else { sigma2 };\n\n alpha * f64::exp(-(t * t) / 2.0)\n\n}\n\n\n","file_path":"color/src/cie.rs","rank":96,"score":102468.47492015219}],"string":"[\n {\n \"content\": \"#[inline(always)]\\n\\npub fn flip(mut v: Vector3) -> Vector3 {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n v.y = -v.y;\\n\\n v\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 0,\n \"score\": 314455.87686131534\n },\n {\n \"content\": \"/// Computes the Fresnel reflection for dielectric materials and unpolarized light.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `cos_i` - The cosine of the angle between normal and incident\\n\\n/// * `eta_i` - The index of refraction for the incident medium\\n\\n/// * `eta_t` - The index of refraction for the transmission medium\\n\\n///\\n\\n/// # Returns\\n\\n/// * The Fresnel reflectance\\n\\npub fn fresnel_dielectric(mut cos_i: Float, mut eta_i: Float, mut eta_t: Float) -> Float {\\n\\n // potentially swap indices of refraction\\n\\n let entering = cos_i > 0.0;\\n\\n if !entering {\\n\\n swap(&mut eta_i, &mut eta_t);\\n\\n cos_i = cos_i.abs();\\n\\n }\\n\\n\\n\\n // compute cos_t using Snell's law\\n\\n let sin_i = cos_i.mul_add(-cos_i, 1.0).fast_max(0.0).sqrt();\\n\\n let sin_t = eta_i * sin_i / eta_t;\\n\\n\\n\\n // handle total internal reflection\\n\\n if sin_t >= 1.0 {\\n\\n return 1.0;\\n\\n }\\n\\n\\n\\n let cos_t = Float::fast_max(0.0, 1.0 - sin_t * sin_t).sqrt();\\n\\n let r_par = dielectric_parallel(cos_i, cos_t, eta_i, eta_t);\\n\\n let r_perp = dielectric_perpendicular(cos_i, cos_t, eta_i, eta_t);\\n\\n\\n\\n 0.5 * (r_par * r_par + r_perp * r_perp)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/fresnel.rs\",\n \"rank\": 1,\n \"score\": 312545.02273111563\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn world_to_bxdf(v: Vector3) -> Rotation {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n if v == Vector3::unit_y() {\\n\\n Rotation::None\\n\\n } else if v == -Vector3::unit_y() {\\n\\n Rotation::Flip\\n\\n } else {\\n\\n Rotation::Some(Rotation3::from_rotation_between(v, bxdf_normal()))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 2,\n \"score\": 311161.4234729241\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn bxdf_is_parallel(v: Vector3) -> bool {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n v.y == 0.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 3,\n \"score\": 310681.87621380785\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn flip_if_neg(mut v: Vector3) -> Vector3 {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n if is_neg(v) {\\n\\n v.y = -v.y;\\n\\n }\\n\\n v\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 4,\n \"score\": 310529.276491896\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn same_hemisphere(a: Vector3, b: Vector3) -> bool {\\n\\n debug_assert!(is_finite(a));\\n\\n debug_assert!(is_finite(b));\\n\\n\\n\\n a.y * b.y > 0.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 5,\n \"score\": 310337.7389167171\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn is_normalized(v: Vector3) -> bool {\\n\\n v.mag()\\n\\n .in_range(1.0 - Float::big_epsilon(), 1.0 + Float::big_epsilon())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/debug_utils.rs\",\n \"rank\": 6,\n \"score\": 306508.5887767294\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn is_neg(v: Vector3) -> bool {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n v.y < 0.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 7,\n \"score\": 305390.830309698\n },\n {\n \"content\": \"#[inline]\\n\\npub fn cos_d_phi(a: Vector3, b: Vector3) -> Float {\\n\\n debug_assert!(is_finite(a));\\n\\n debug_assert!(is_finite(b));\\n\\n\\n\\n let abxz = a.x * b.x + a.z * b.z;\\n\\n let axz = a.x * a.x + a.z * a.z;\\n\\n let bxz = b.x * b.x + b.z * b.z;\\n\\n\\n\\n Float::fast_clamp(abxz / Float::sqrt(axz * bxz), -1.0, 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 8,\n \"score\": 305012.75689267385\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_normalized(v: &Vector3) -> bool {\\n\\n v.mag()\\n\\n .in_range(1.0 - Float::big_epsilon(), 1.0 + Float::big_epsilon())\\n\\n}\\n\",\n \"file_path\": \"geometry/src/debug_util.rs\",\n \"rank\": 9,\n \"score\": 302200.3218909985\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn bxdf_incident_to(v: Vector3) -> Vector3 {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n Vector3::new(-v.x, v.y, -v.z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 10,\n \"score\": 299635.428631683\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sin2_theta(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n 0.0.fast_max(1.0 - cos2_theta(v))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 11,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn tan_theta(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n sin_theta(v) / cos_theta(v)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 12,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sin_phi(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n let sin_theta = sin_theta(v);\\n\\n if sin_theta == 0.0 {\\n\\n 0.0\\n\\n } else {\\n\\n Float::fast_clamp(v.z / sin_theta, -1.0, 1.0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 13,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sin2_phi(v: Vector3) -> Float {\\n\\n let sin_phi = sin_phi(v);\\n\\n sin_phi * sin_phi\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 14,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn cos2_phi(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n let cos_phi = cos_phi(v);\\n\\n cos_phi * cos_phi\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 15,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn tan2_theta(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n sin2_theta(v) / cos2_theta(v)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 16,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn cos_theta(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n v.y\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 17,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn cos2_theta(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n cos_theta(v) * cos_theta(v)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 18,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sin_theta(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n sin2_theta(v).sqrt()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 19,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn cos_phi(v: Vector3) -> Float {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n let sin_theta = sin_theta(v);\\n\\n if sin_theta == 0.0 {\\n\\n 0.0\\n\\n } else {\\n\\n Float::fast_clamp(v.x / sin_theta, -1.0, 1.0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 20,\n \"score\": 299603.16152104887\n },\n {\n \"content\": \"#[inline]\\n\\npub fn refract(v: Vector3, n: Vector3, eta: Float) -> Option<Vector3> {\\n\\n let cos_i = n.dot(v);\\n\\n let sin_t2 = eta * eta * cos_i.mul_add(-cos_i, 1.0).fast_max(0.0);\\n\\n\\n\\n if sin_t2 > 1.0 {\\n\\n None\\n\\n } else {\\n\\n let cos_t = Float::sqrt(1.0 - sin_t2);\\n\\n let right = eta.mul_add(cos_i, -cos_t);\\n\\n let r = eta * -v + right * n;\\n\\n\\n\\n Some(r)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 21,\n \"score\": 296668.3227255035\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn bxdf_normal() -> Vector3 {\\n\\n Vector3::unit_y()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 22,\n \"score\": 293652.6682972184\n },\n {\n \"content\": \"#[inline]\\n\\npub fn search_index(slice: &[Float], value: Float) -> Result<usize, (usize, usize)> {\\n\\n match slice.binary_search_by(|a| a.fast_cmp(value)) {\\n\\n Ok(index) => Ok(index),\\n\\n Err(index) => Err((index - 1, index)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/refractive_index/mod.rs\",\n \"rank\": 23,\n \"score\": 280097.33754956257\n },\n {\n \"content\": \"#[inline]\\n\\n#[must_use]\\n\\npub fn sinc(mut x: Float) -> Float {\\n\\n debug_assert!(x.is_finite());\\n\\n\\n\\n x = x.abs();\\n\\n\\n\\n if x < Float::epsilon() {\\n\\n 1.0\\n\\n } else {\\n\\n let pix = PI * x;\\n\\n Float::sin(pix) / pix\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"utility/src/math.rs\",\n \"rank\": 24,\n \"score\": 275540.71709813434\n },\n {\n \"content\": \"fn random_bsdf(color: Spectrum) -> (bool, BSDF) {\\n\\n let rand = fastrand::f32();\\n\\n\\n\\n let mut out = false;\\n\\n let bsdf = if color == Spectrum::from(Colors::White) {\\n\\n if rand < 0.6 {\\n\\n out = true;\\n\\n BSDF::empty()\\n\\n } else if rand < 0.8 {\\n\\n let specular = SpecularReflection::new(Spectrum::broadcast(1.0), FresnelType::NoOp);\\n\\n let bxdf = Box::new(specular);\\n\\n\\n\\n BSDF::new(vec![bxdf])\\n\\n } else {\\n\\n let specular = SpecularTransmission::new(\\n\\n Spectrum::broadcast(1.0),\\n\\n RefractiveType::Air,\\n\\n RefractiveType::Glass,\\n\\n );\\n\\n let bxdf = Box::new(specular);\\n\",\n \"file_path\": \"demos/src/demo_scenes/spheres.rs\",\n \"rank\": 25,\n \"score\": 269073.51323521324\n },\n {\n \"content\": \"fn parse_vector3(iter: &mut SplitWhitespace) -> Vector3 {\\n\\n let x = iter.next().unwrap().parse().unwrap();\\n\\n let y = iter.next().unwrap().parse().unwrap();\\n\\n let z = iter.next().unwrap().parse().unwrap();\\n\\n\\n\\n Vector3::new(x, y, z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/obj_file.rs\",\n \"rank\": 26,\n \"score\": 267342.05882837705\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn is_not_nan(v: Vector3) -> bool {\\n\\n !(v.x.is_nan() && v.y.is_nan() && v.z.is_nan())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/debug_utils.rs\",\n \"rank\": 27,\n \"score\": 265511.73670604377\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn is_finite(v: Vector3) -> bool {\\n\\n v.x.is_finite() && v.y.is_finite() && v.z.is_finite()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/debug_utils.rs\",\n \"rank\": 28,\n \"score\": 265511.7367060437\n },\n {\n \"content\": \"/// Offsets a point by an epsilon into the normal direction, depending on the angle to the given\\n\\n/// direction.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `point` - ALl values should be finite (neither infinite nor `NaN`).\\n\\n/// * `normal` - All values should be finite.\\n\\n/// Should be normalized.\\n\\n/// * `direction` - Should be finite.\\n\\n/// (Does not need to be normalized.)\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `point` - The starting point\\n\\n/// * `normal` - The normal vector to offset towards\\n\\n/// * `direction` - The direction helper to decide whether to invert the normal\\n\\n///\\n\\n/// # Returns\\n\\n/// * The offset point\\n\\npub fn offset_point(point: Vector3, normal: Vector3, direction: Vector3) -> Vector3 {\\n\\n debug_assert!(is_finite(&point));\\n\\n debug_assert!(is_finite(&normal));\\n\\n debug_assert!(is_normalized(&normal));\\n\\n debug_assert!(is_finite(&direction));\\n\\n\\n\\n let offset = if direction.dot(normal) >= 0.0 {\\n\\n normal * Float::big_epsilon()\\n\\n } else {\\n\\n normal * -Float::big_epsilon()\\n\\n };\\n\\n\\n\\n point + offset\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 29,\n \"score\": 264804.84490123286\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_not_nan(v: &Vector3) -> bool {\\n\\n !(v.x.is_nan() && v.y.is_nan() && v.z.is_nan())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/debug_util.rs\",\n \"rank\": 30,\n \"score\": 262073.36122351463\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_finite(v: &Vector3) -> bool {\\n\\n v.x.is_finite() && v.y.is_finite() && v.z.is_finite()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/debug_util.rs\",\n \"rank\": 31,\n \"score\": 262073.36122351463\n },\n {\n \"content\": \"/// Converts spherical coordinates to cartesian coordinates in the following describe frame:\\n\\n/// * x-axis: to your right\\n\\n/// * y-axis: to your top\\n\\n/// * z-axis: towards you\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `theta` - Should be within `[0, 2π]`.\\n\\n/// * `phi` - Should be within `[0, π]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane.\\n\\n/// * `phi` - The angle between the `y`-axis and the spherical direction .\\n\\n///\\n\\n/// # Returns\\n\\n/// * The corresponding cartesian vector\\n\\npub fn spherical_to_cartesian(theta: Float, phi: Float) -> Vector3 {\\n\\n debug_assert!(theta.in_range_incl(0.0, TAU));\\n\\n debug_assert!(phi.in_range_incl(0.0, PI));\\n\\n\\n\\n let (sin_theta, cos_theta) = theta.sin_cos();\\n\\n let (sin_phi, cos_phi) = phi.sin_cos();\\n\\n\\n\\n spherical_to_cartesian_trig(sin_theta, cos_theta, sin_phi, cos_phi)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 32,\n \"score\": 260950.06321202815\n },\n {\n \"content\": \"/// Offsets a point by an epsilon into the normal direction, depending on the angle to the given\\n\\n/// direction and creates a ray to the target from it.\\n\\n///\\n\\n/// If the direction to the parameter `target` shows into the same general direction of this\\n\\n/// intersection normal, the ray origin will be offset by an epsilon into the intersection\\n\\n/// normal.\\n\\n/// Otherwise, the opposite normal will be used.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `point` - ALl values should be finite (neither infinite nor `NaN`).\\n\\n/// * `normal` - All values should be finite.\\n\\n/// Should be normalized.\\n\\n/// * `target` - Should be finite.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `point` - The starting point\\n\\n/// * `normal` - The normal vector to offset towards\\n\\n/// * `target` - The target position\\n\\n///\\n\\n/// # Returns\\n\\n/// * Ray from this intersection to the target, offset by an epsilon\\n\\npub fn offset_ray_to(point: Vector3, normal: Vector3, target: Vector3) -> Ray {\\n\\n debug_assert!(is_finite(&point));\\n\\n debug_assert!(is_finite(&normal));\\n\\n debug_assert!(is_normalized(&normal));\\n\\n debug_assert!(is_finite(&target));\\n\\n\\n\\n let dir = target - point;\\n\\n let origin = offset_point(point, normal, dir);\\n\\n let direction = target - origin;\\n\\n\\n\\n Ray::new(origin, direction.normalized(), 0.0, direction.mag())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 33,\n \"score\": 259337.32882106077\n },\n {\n \"content\": \"/// Offsets a point by an epsilon into the normal direction, depending on the angle to the given\\n\\n/// direction and creates a ray from it.\\n\\n///\\n\\n/// If the parameter `direction` shows into the same general direction of this intersection\\n\\n/// normal, the ray origin will be offset by an epsilon into the intersection normal.\\n\\n/// Otherwise, the opposite normal will be used.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `point` - ALl values should be finite (neither infinite nor `NaN`).\\n\\n/// * `normal` - All values should be finite.\\n\\n/// Should be normalized.\\n\\n/// * `direction` - Should be finite.\\n\\n/// Should be normalized.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `point` - The starting point\\n\\n/// * `normal` - The normal vector to offset towards\\n\\n/// * `direction` - The direction of the ray\\n\\n///\\n\\n/// # Returns\\n\\n/// * Ray from this intersection, offset by an epsilon\\n\\npub fn offset_ray_towards(point: Vector3, normal: Vector3, direction: Vector3) -> Ray {\\n\\n debug_assert!(is_finite(&point));\\n\\n debug_assert!(is_finite(&normal));\\n\\n debug_assert!(is_normalized(&normal));\\n\\n debug_assert!(is_finite(&direction));\\n\\n debug_assert!(is_normalized(&direction));\\n\\n\\n\\n let origin = offset_point(point, normal, direction);\\n\\n\\n\\n Ray::new_fast(origin, direction)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 34,\n \"score\": 256848.1218276039\n },\n {\n \"content\": \"#[inline]\\n\\npub fn spherical_to_cartesian1(sin_theta: Float, cos_theta: Float, phi: Float) -> Vector3 {\\n\\n Vector3::new(sin_theta * phi.cos(), sin_theta * phi.sin(), cos_theta)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 35,\n \"score\": 252895.87901978503\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn face_forward(v: Vector3, n: Vector3) -> Vector3 {\\n\\n if n.dot(v) > 0.0 {\\n\\n v\\n\\n } else {\\n\\n -v\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 36,\n \"score\": 249440.73998904292\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sellmeier_n(lambda: Float) -> Float {\\n\\n debug_assert!(lambda.is_finite());\\n\\n\\n\\n let l2 = lambda * lambda;\\n\\n let one = 1.03961212 * l2 / (l2 - 6.00069867e-3);\\n\\n let two = 0.231792344 * l2 / (l2 - 2.00179144e-2);\\n\\n let three = 1.01046945 * l2 / (l2 - 103.560653);\\n\\n\\n\\n Float::sqrt(1.0 + one + two + three)\\n\\n}\\n\\n\\n\\npub static INDEX_K: [Float; 25] = {\\n\\n [\\n\\n 0.3, 0.31, 0.32, 0.334, 0.35, 0.365, 0.37, 0.38, 0.39, 0.4, 0.405, 0.42, 0.436, 0.46, 0.5,\\n\\n 0.546, 0.58, 0.62, 0.66, 0.7, 1.06, 1.53, 1.97, 2.325, 2.5,\\n\\n ]\\n\\n};\\n\\npub static K: [Float; 25] = {\\n\\n [\\n\\n 0.0000028607,\\n\",\n \"file_path\": \"src/refractive_index/glass.rs\",\n \"rank\": 37,\n \"score\": 247819.23745907645\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sellmeier_n(lambda: Float) -> Float {\\n\\n let l2 = lambda * lambda;\\n\\n let one = 1.43134930 * l2 / (l2 - 5.2799261e-3);\\n\\n let two = 0.65054713 * l2 / (l2 - 1.42382647e-2);\\n\\n let three = 5.3414021 * l2 / (l2 - 325.017834);\\n\\n\\n\\n Float::sqrt(1.0 + one + two + three)\\n\\n}\\n\\n\\n\\npub static INDEX_K: [Float; 612] = {\\n\\n [\\n\\n 0.21, 0.22, 0.23, 0.24, 0.25, 0.26, 0.27, 0.28, 0.29, 0.3, 0.31, 0.32, 0.33, 0.34, 0.35,\\n\\n 0.36, 0.37, 0.38, 0.39, 0.4, 0.41, 0.42, 0.43, 0.44, 0.45, 0.46, 0.47, 0.48, 0.49, 0.5,\\n\\n 0.51, 0.52, 0.53, 0.54, 0.55, 0.56, 0.57, 0.58, 0.59, 0.6, 0.61, 0.62, 0.63, 0.64, 0.65,\\n\\n 0.66, 0.67, 0.68, 0.69, 0.7, 0.71, 0.72, 0.73, 0.74, 0.75, 0.76, 0.77, 0.78, 0.79, 0.8,\\n\\n 0.81, 0.82, 0.83, 0.84, 0.85, 0.86, 0.87, 0.88, 0.89, 0.9, 0.91, 0.92, 0.93, 0.94, 0.95,\\n\\n 0.96, 0.97, 0.98, 0.99, 1.0, 1.01, 1.02, 1.03, 1.04, 1.05, 1.06, 1.07, 1.08, 1.09, 1.1,\\n\\n 1.11, 1.12, 1.13, 1.14, 1.15, 1.16, 1.17, 1.18, 1.19, 1.2, 1.21, 1.22, 1.23, 1.24, 1.25,\\n\\n 1.26, 1.27, 1.28, 1.29, 1.3, 1.31, 1.32, 1.33, 1.34, 1.35, 1.36, 1.37, 1.38, 1.39, 1.4,\\n\\n 1.41, 1.42, 1.43, 1.44, 1.45, 1.46, 1.47, 1.48, 1.49, 1.5, 1.51, 1.52, 1.53, 1.54, 1.55,\\n\",\n \"file_path\": \"src/refractive_index/sapphire.rs\",\n \"rank\": 38,\n \"score\": 247819.23745907645\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn sellmeier_n(lambda: Float) -> Float {\\n\\n debug_assert!(lambda.is_finite());\\n\\n\\n\\n let l2 = lambda * lambda;\\n\\n\\n\\n let one = 0.75831 * l2 / (l2 - 0.01007);\\n\\n let two = 0.08495 * l2 / (l2 - 8.91377);\\n\\n\\n\\n Float::sqrt(1.0 + one + two)\\n\\n}\\n\",\n \"file_path\": \"src/refractive_index/air.rs\",\n \"rank\": 39,\n \"score\": 247819.23745907645\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn roughness_to_alpha(roughness: Float) -> Float {\\n\\n let roughness = Float::big_epsilon().fast_max(roughness);\\n\\n let x = roughness.ln();\\n\\n let x2 = x * x;\\n\\n\\n\\n 1.62142 + 0.819955 * x + 0.1734 * x2 + 0.0171201 * x2 * x + 0.000640711 * x2 * x2\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/microfacet.rs\",\n \"rank\": 40,\n \"score\": 246900.3098362992\n },\n {\n \"content\": \"/// Converts spherical coordinates to cartesian coordinates in the given frame wth following description:\\n\\n/// * `frame.x_axis`: to your right\\n\\n/// * `frame.y_axis`: to your top\\n\\n/// * `frame.z_axis`: towards you\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `theta` - Should be within `[0, 2π]`.\\n\\n/// * `phi` - Should be within `[0, π]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane\\n\\n/// * `phi` - The angle between the `y`-axis and the spherical direction\\n\\n/// * `frame` - The coordinate system/frame to use\\n\\n///\\n\\n/// # Returns\\n\\n/// * The corresponding cartesian vector\\n\\npub fn spherical_to_cartesian_frame(theta: Float, phi: Float, frame: &CoordinateSystem) -> Vector3 {\\n\\n debug_assert!(theta.in_range_incl(0.0, TAU));\\n\\n debug_assert!(phi.in_range_incl(0.0, PI));\\n\\n\\n\\n let (sin_theta, cos_theta) = theta.sin_cos();\\n\\n let (sin_phi, cos_phi) = phi.sin_cos();\\n\\n\\n\\n spherical_to_cartesian_frame_trig(sin_theta, cos_theta, sin_phi, cos_phi, frame)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 41,\n \"score\": 243502.16791036475\n },\n {\n \"content\": \"#[inline]\\n\\npub fn bxdf_to_world(v: Vector3) -> Rotation3 {\\n\\n debug_assert!(is_finite(v));\\n\\n\\n\\n if v == Vector3::unit_y() {\\n\\n Rotation3::default()\\n\\n } else if v == -Vector3::unit_y() {\\n\\n Rotation3::from_rotation_xy(-PI)\\n\\n } else {\\n\\n Rotation3::from_rotation_between(bxdf_normal(), v)\\n\\n }\\n\\n}\\n\\n\\n\\nbitflags! {\\n\\n /// All BxDF have types, for example\\n\\n /// * `BRDF` - Bidirectional Reflection Function\\n\\n /// * `BTDF` - Bidirectional Transmission Function\\n\\n /// All these have properties like being `reflective`, `transmissive`, `diffuse`, `glossy`,\\n\\n /// `specular` or be any mixture in between.\\n\\n ///\\n\\n /// This type allows bit-flagging these properties at will.\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 42,\n \"score\": 242081.30585776718\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sample_cone(sample: Vector2, cos_theta_max: Float) -> Vector3 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n let cos_theta = cos_theta_max.lerp(1.0, sample.x);\\n\\n let sin_theta = cos_theta.mul_add(-cos_theta, 1.0).sqrt();\\n\\n let (sin_phi, cos_phi) = Float::sin_cos(sample.y * TAU as Float);\\n\\n\\n\\n spherical_to_cartesian_trig(sin_theta, cos_theta, sin_phi, cos_phi)\\n\\n}\\n\\n\\n\\n/// Samples a cone around the `frame.e2` axis with a uniform distribution described by the sample.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sample` - All values should be within `[0, 1]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sample` - A random sample in `[0, 1]`\\n\\n/// * `cos_theta_max` - The max angle\\n\\n/// * `frame` - The coordinate system frame. Y-axis is \\\"up\\\"-axis.\\n\\n///\\n\\n/// # Results\\n\\n// * `Vector3` - A direction in the cone around `frame.e2`\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 43,\n \"score\": 239797.6796491807\n },\n {\n \"content\": \"pub fn index_to_vec2(index: usize, height: usize) -> UVec2 {\\n\\n let y = index / height;\\n\\n let x = index % height;\\n\\n\\n\\n UVec2::new(x as u32, y as u32)\\n\\n}\\n\\n\\n\\nuse crate::sensor::bounds::UBounds2;\\n\\nuse crate::sensor::sensor_tile::SensorTile;\\n\\nuse crate::Float;\\n\\nuse parking_lot::Mutex;\\n\\n\\n\\npub struct Sensor {\\n\\n pub resolution: UVec2,\\n\\n // pub filter: Box<dyn Filter>,\\n\\n pub filename: Option<String>,\\n\\n pub bounds: UBounds2,\\n\\n pub block_size: UVec2,\\n\\n pub tiles: Vec<Mutex<SensorTile>>,\\n\\n}\\n\",\n \"file_path\": \"src/sensor/mod.rs\",\n \"rank\": 44,\n \"score\": 237696.16962290113\n },\n {\n \"content\": \"#[inline]\\n\\npub fn dielectric_parallel(cos_i: Float, cos_t: Float, eta_i: Float, eta_t: Float) -> Float {\\n\\n let it = eta_i * cos_t;\\n\\n let ti = eta_t * cos_i;\\n\\n\\n\\n (ti - it) / (ti + it)\\n\\n}\\n\\n\\n\\n/// Computes the fraction of reflected light for perpendicular polarized light.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `cos_i` - The cosine of the angle between normal and incident\\n\\n/// * `cos_t` - The cosine of the angle between normal and transmission\\n\\n/// * `eta_i` - The index of refraction for the incident medium\\n\\n/// * `eta_t` - The index of refraction for the transmission medium\\n\\n///\\n\\n/// # Returns\\n\\n/// * The amount of light reflected\\n\",\n \"file_path\": \"src/bxdf/fresnel.rs\",\n \"rank\": 45,\n \"score\": 234651.22399795073\n },\n {\n \"content\": \"#[inline]\\n\\npub fn dielectric_perpendicular(cos_i: Float, cos_t: Float, eta_i: Float, eta_t: Float) -> Float {\\n\\n let tt = eta_t * cos_t;\\n\\n let ii = eta_i * cos_i;\\n\\n\\n\\n (ii - tt) / (ii + tt)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/fresnel.rs\",\n \"rank\": 46,\n \"score\": 234651.22399795073\n },\n {\n \"content\": \"#[inline]\\n\\n#[cfg(feature = \\\"watertight-mesh\\\")]\\n\\nfn max_index(v: Vector3) -> usize {\\n\\n if v.x > v.y {\\n\\n if v.x > v.z {\\n\\n return 0;\\n\\n }\\n\\n } else if v.y > v.z {\\n\\n return 1;\\n\\n }\\n\\n\\n\\n 2\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug, Deserialize, Serialize)]\\n\\npub struct Vertex {\\n\\n pub position: Vector3,\\n\\n #[serde(default)]\\n\\n pub normal: Vector3,\\n\\n}\\n\\n\\n\\n/// A triangle consists of vertex indices `(v0, v1, v2)`.\\n\",\n \"file_path\": \"geometry/src/mesh.rs\",\n \"rank\": 47,\n \"score\": 214672.46218695803\n },\n {\n \"content\": \"#[allow(clippy::excessive_precision)]\\n\\n#[inline]\\n\\n#[must_use]\\n\\npub fn erf(x: Float) -> Float {\\n\\n // constants\\n\\n let a1 = 0.254829592;\\n\\n let a2 = -0.284496736;\\n\\n let a3 = 1.421413741;\\n\\n let a4 = -1.453152027;\\n\\n let a5 = 1.061405429;\\n\\n let p = 0.3275911;\\n\\n\\n\\n // Save the sign of x\\n\\n let sign = x.signum();\\n\\n let x = x.abs();\\n\\n\\n\\n // A&S formula 7.1.26\\n\\n let t = 1.0 / (1.0 + p * x);\\n\\n let y = 1.0 - (((((a5 * t + a4) * t) + a3) * t + a2) * t + a1) * t * Float::exp(-x * x);\\n\\n\\n\\n sign * y\\n\\n}\\n\\n\\n\",\n \"file_path\": \"utility/src/math.rs\",\n \"rank\": 48,\n \"score\": 213333.045576721\n },\n {\n \"content\": \"#[allow(clippy::excessive_precision)]\\n\\n#[inline]\\n\\n#[must_use]\\n\\npub fn erf_inv(x: Float) -> Float {\\n\\n let x = Float::fast_clamp(x, -1.0 + Float::big_epsilon(), 1.0 - Float::big_epsilon());\\n\\n\\n\\n let mut w = -Float::ln((1.0 - x) * (1.0 + x));\\n\\n let mut p: Float;\\n\\n if w < 5.0 {\\n\\n w -= 2.5;\\n\\n p = 2.81022636e-08;\\n\\n p = 3.43273939e-07 + p * w;\\n\\n p = -3.5233877e-06 + p * w;\\n\\n p = -4.39150654e-06 + p * w;\\n\\n p = 0.00021858087 + p * w;\\n\\n p = -0.00125372503 + p * w;\\n\\n p = -0.00417768164 + p * w;\\n\\n p = 0.246640727 + p * w;\\n\\n p = 1.50140941 + p * w;\\n\\n } else {\\n\\n w = w.sqrt() - 3.0;\\n\\n p = -0.000200214257;\\n\\n p = 0.000100950558 + p * w;\\n\",\n \"file_path\": \"utility/src/math.rs\",\n \"rank\": 49,\n \"score\": 210963.87243157963\n },\n {\n \"content\": \"#[inline]\\n\\npub fn uniform_cone_pdf(cos_theta: Float) -> Float {\\n\\n 1.0 / (TAU as Float * (1.0 - cos_theta))\\n\\n}\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 50,\n \"score\": 206480.60670586186\n },\n {\n \"content\": \"#[inline]\\n\\n#[must_use]\\n\\npub fn solve_quadratic(a: Float, b: Float, c: Float) -> Option<(Float, Float)> {\\n\\n debug_assert!(a.is_finite());\\n\\n debug_assert!(b.is_finite());\\n\\n debug_assert!(c.is_finite());\\n\\n\\n\\n if a < Float::epsilon() {\\n\\n if b < Float::epsilon() {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let sol = -c / b;\\n\\n\\n\\n return Some((sol, sol));\\n\\n }\\n\\n\\n\\n let discriminant = b.mul_add(b, -4.0 * a * c);\\n\\n if discriminant < 0.0 {\\n\\n return None;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"utility/src/math.rs\",\n \"rank\": 51,\n \"score\": 205700.91067119088\n },\n {\n \"content\": \"pub fn vec2_to_index(v: UVec2, height: usize) -> usize {\\n\\n v.x as usize + v.y as usize * height\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sensor/mod.rs\",\n \"rank\": 52,\n \"score\": 203522.63226178588\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn within_01(v: Vector2) -> bool {\\n\\n v.x.in_range_incl_left(0.0, 1.0) && v.y.in_range_incl_left(0.0, 1.0)\\n\\n}\\n\",\n \"file_path\": \"src/debug_utils.rs\",\n \"rank\": 53,\n \"score\": 197642.00120492477\n },\n {\n \"content\": \"#[inline]\\n\\npub fn xyz_of(lambda: Float) -> Xyz {\\n\\n let lambda = mu_m_to_angstrom(lambda as f64);\\n\\n Xyz::new([\\n\\n x_bar(lambda) as Float,\\n\\n y_bar(lambda) as Float,\\n\\n z_bar(lambda) as Float,\\n\\n ])\\n\\n}\\n\",\n \"file_path\": \"color/src/cie.rs\",\n \"rank\": 54,\n \"score\": 193563.7524329696\n },\n {\n \"content\": \"fn parse_face(iter: &mut SplitWhitespace) -> Face {\\n\\n let p = |s: &str| -> u32 { s.splitn(2, '/').next().unwrap().parse().unwrap() };\\n\\n\\n\\n let v0 = p(iter.next().unwrap());\\n\\n let v1 = p(iter.next().unwrap());\\n\\n let v2 = p(iter.next().unwrap());\\n\\n\\n\\n // offset by one because indexing starts at 1 in obj files\\n\\n let vertices = (v0 - 1, v1 - 1, v2 - 1);\\n\\n\\n\\n Face::new(vertices, Vector3::zero())\\n\\n}\\n\",\n \"file_path\": \"geometry/src/obj_file.rs\",\n \"rank\": 55,\n \"score\": 192457.35704833388\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sample_unit_sphere(sample: Vector2) -> Vector3 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n let z = sample.x.mul_add(-2.0, 1.0);\\n\\n\\n\\n let r = z.mul_add(-z, 1.0).fast_max(0.0).sqrt();\\n\\n let (sin_phi, cos_phi) = Float::sin_cos(sample.y * TAU as Float);\\n\\n\\n\\n let x = r * cos_phi;\\n\\n let y = r * sin_phi;\\n\\n\\n\\n Vector3::new(x, y, z)\\n\\n}\\n\\n\\n\\n/// Samples a cone around the `(0, 1, 0)` axis with a uniform distribution described by the sample.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sample` - All values should be within `[0, 1]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sample` - A random sample in `[0, 1]`\\n\\n/// * `cos_theta_max` - The max angle\\n\\n///\\n\\n/// # Results\\n\\n/// * `Vector3` - A direction in the cone around `(0, 1, 0)`\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 56,\n \"score\": 191010.36521111912\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sample_unit_hemisphere(sample: Vector2) -> Vector3 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n let d = sample_unit_disk_concentric(sample);\\n\\n let b = d.y.mul_add(-d.y, 1.0);\\n\\n let right = d.x.mul_add(-d.x, b);\\n\\n\\n\\n // let y = fast_max(0.0, 1.0 - d.x * d.x - d.y * d.y).sqrt();\\n\\n let y = right.fast_max(0.0).sqrt();\\n\\n\\n\\n Vector3::new(d.x, y, d.y)\\n\\n}\\n\\n\\n\\n/// Samples a sphere with a uniform distribution described by the sample.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sample` - All values should be within `[0, 1]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sample` - A random sample\\n\\n///\\n\\n/// # Results\\n\\n/// * A point on the unit sphere around `(0, 0, 0)`\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 57,\n \"score\": 191010.36521111912\n },\n {\n \"content\": \"#[inline]\\n\\npub fn search_and_lerp(\\n\\n index_slice: &[Float],\\n\\n value_slice: &[Float],\\n\\n wavelength_nm: Float,\\n\\n) -> Float {\\n\\n match search_index(index_slice, wavelength_nm) {\\n\\n Ok(i) => value_slice[i],\\n\\n Err((min, max)) => {\\n\\n if max >= value_slice.len() {\\n\\n return value_slice[min];\\n\\n }\\n\\n\\n\\n Float::lerp_map(\\n\\n min as Float,\\n\\n max as Float,\\n\\n value_slice[min],\\n\\n value_slice[max],\\n\\n wavelength_nm,\\n\\n )\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/refractive_index/mod.rs\",\n \"rank\": 58,\n \"score\": 176403.60335159293\n },\n {\n \"content\": \"fn bench_glass(c: &mut Criterion) {\\n\\n let mut group = c.benchmark_group(\\\"Refractive Index of Glass\\\");\\n\\n\\n\\n group.sample_size(10000);\\n\\n group.warm_up_time(Duration::from_secs(10));\\n\\n\\n\\n group.bench_function(\\\"Search and Get\\\", |b| {\\n\\n b.iter(|| search_and_lerp(&glass::INDEX_N, &glass::N, black_box(300.0)))\\n\\n });\\n\\n\\n\\n // NOTICE: was too slow, so we removed the function.\\n\\n // group.bench_function(\\\"Calculate\\\", |b| {\\n\\n // b.iter(|| sellmeier_n(black_box(0.3), &glass::INDEX_N, &glass::N))\\n\\n // });\\n\\n\\n\\n group.bench_function(\\\"Calculate Optimized\\\", |b| {\\n\\n b.iter(|| glass::sellmeier_n(black_box(0.3)))\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, bench_glass);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/refractive_index.rs\",\n \"rank\": 59,\n \"score\": 175530.10445764769\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Float = f32;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 60,\n \"score\": 151335.6679760997\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Float = f64;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 61,\n \"score\": 151335.6679760997\n },\n {\n \"content\": \"#[allow(clippy::excessive_precision)]\\n\\n#[inline]\\n\\nfn uncompand(val: Float) -> Float {\\n\\n // https://entropymine.com/imageworsener/srgbformula/\\n\\n if val <= 0.0404482362771082 {\\n\\n val / 12.92\\n\\n } else {\\n\\n ((val + 0.055) / 1.055).powf(2.4)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"color/src/srgb.rs\",\n \"rank\": 62,\n \"score\": 149848.22350280272\n },\n {\n \"content\": \"#[allow(clippy::excessive_precision)]\\n\\n#[inline]\\n\\nfn compand(val: Float) -> Float {\\n\\n // https://entropymine.com/imageworsener/srgbformula/\\n\\n if val <= 0.00313066844250063 {\\n\\n val * 12.92\\n\\n } else {\\n\\n 1.055 * val.powf(1.0 / 2.4) - 0.055\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"color/src/xyz.rs\",\n \"rank\": 63,\n \"score\": 149848.22350280272\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Float = f32;\\n\",\n \"file_path\": \"demos/src/main.rs\",\n \"rank\": 64,\n \"score\": 149359.4343418007\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Float = f64;\\n\",\n \"file_path\": \"demos/src/main.rs\",\n \"rank\": 65,\n \"score\": 149359.4343418007\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Float = f32;\\n\",\n \"file_path\": \"color/src/lib.rs\",\n \"rank\": 66,\n \"score\": 149359.4343418007\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Float = f64;\\n\\n\\n\\nbig_array! {\\n\\n SerdeBigArray;\\n\\n 3, LAMBDA_NUM\\n\\n}\\n\\n\\n\\n#[allow(clippy::large_enum_variant)]\\n\\n#[derive(Clone, Debug, Serialize, Deserialize)]\\n\\npub enum SerdeColors {\\n\\n Srgb([Float; 3]),\\n\\n Xyz([Float; 3]),\\n\\n #[serde(with = \\\"SerdeBigArray\\\")]\\n\\n Spectrum([Float; 36]),\\n\\n Color(Colors),\\n\\n MulColor(Float, Colors),\\n\\n Constant(Float),\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\",\n \"file_path\": \"color/src/lib.rs\",\n \"rank\": 67,\n \"score\": 149359.4343418007\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Float = f64;\\n\",\n \"file_path\": \"utility/src/lib.rs\",\n \"rank\": 68,\n \"score\": 149359.4343418007\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Float = f32;\\n\",\n \"file_path\": \"utility/src/lib.rs\",\n \"rank\": 69,\n \"score\": 149359.4343418007\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Vector3 = ultraviolet::Vec3;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 70,\n \"score\": 146112.4098223541\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Float = f32;\\n\",\n \"file_path\": \"demos/src/demo_scenes/mod.rs\",\n \"rank\": 71,\n \"score\": 145664.017488275\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Float = f64;\\n\",\n \"file_path\": \"demos/src/demo_scenes/mod.rs\",\n \"rank\": 72,\n \"score\": 145664.017488275\n },\n {\n \"content\": \"fn look_at(position: Vector3, target: Vector3, up: Vector3) -> Matrix4 {\\n\\n let w = (position - target).normalized();\\n\\n let u = up.cross(w).normalized();\\n\\n let v = w.cross(u);\\n\\n\\n\\n Matrix4::new(\\n\\n u.into_homogeneous_vector(),\\n\\n v.into_homogeneous_vector(),\\n\\n w.into_homogeneous_vector(),\\n\\n position.into_homogeneous_point(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/camera/perspective_simone.rs\",\n \"rank\": 73,\n \"score\": 145327.0347489479\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Vector3 = ultraviolet::DVec3;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 74,\n \"score\": 144222.75026748804\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"f64\\\"))]\\n\\ntype Vector3 = ultraviolet::Vec3;\\n\",\n \"file_path\": \"demos/src/demo_scenes/mod.rs\",\n \"rank\": 75,\n \"score\": 140684.00552169816\n },\n {\n \"content\": \"#[cfg(feature = \\\"f64\\\")]\\n\\ntype Vector3 = ultraviolet::DVec3;\\n\\n\\n\\npub const SIGMA: Float = 20.0;\\n\\npub const FOVY: Float = 70.0;\\n\\n\\n\",\n \"file_path\": \"demos/src/demo_scenes/mod.rs\",\n \"rank\": 76,\n \"score\": 139024.9232040021\n },\n {\n \"content\": \"fn random_color() -> Spectrum {\\n\\n let rand = fastrand::f32() * 1.5;\\n\\n\\n\\n if rand < 0.25 {\\n\\n Spectrum::from(Colors::Red)\\n\\n } else if rand < 0.5 {\\n\\n Spectrum::from(Colors::Green)\\n\\n } else if rand < 0.75 {\\n\\n Spectrum::from(Colors::Blue)\\n\\n } else {\\n\\n Spectrum::from(Colors::White)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"demos/src/demo_scenes/spheres.rs\",\n \"rank\": 77,\n \"score\": 138684.1588907952\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sample_vector_from_angle(\\n\\n direction: Vector3,\\n\\n sin_theta_max: Float,\\n\\n sample: Vector2,\\n\\n) -> Vector3 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n let frame = CoordinateSystem::from_y(direction);\\n\\n\\n\\n let sample = sample_unit_disk_concentric(sample) * sin_theta_max;\\n\\n\\n\\n let right = frame.x_axis * sample.x;\\n\\n let forward = frame.z_axis * sample.y;\\n\\n\\n\\n (direction + right + forward).normalized()\\n\\n}\\n\\n\\n\\n/// Samples a non-concentric mapped point from the given random sample.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sample` - All values should be within `[0, 1]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sample` - A random sample\\n\\n///\\n\\n/// # Results\\n\\n/// * A non-concentric sample on the unit disk\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 78,\n \"score\": 137347.2868606061\n },\n {\n \"content\": \"fn random_pos() -> Vector3 {\\n\\n let (x, z) = {\\n\\n #[cfg(feature = \\\"f64\\\")]\\n\\n {\\n\\n (\\n\\n DISTRIBUTION * (fastrand::f64() - 0.5),\\n\\n DISTRIBUTION * (fastrand::f64() - 0.5),\\n\\n )\\n\\n }\\n\\n #[cfg(not(feature = \\\"f64\\\"))]\\n\\n {\\n\\n (\\n\\n DISTRIBUTION * (fastrand::f32() - 0.5),\\n\\n DISTRIBUTION * (fastrand::f32() - 0.5),\\n\\n )\\n\\n }\\n\\n };\\n\\n\\n\\n Vector3::new(x, RADIUS, z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"demos/src/demo_scenes/spheres.rs\",\n \"rank\": 79,\n \"score\": 136464.4216867635\n },\n {\n \"content\": \"/// Converts spherical coordinates to cartesian coordinates in the following described frame:\\n\\n/// * x-axis: to your right\\n\\n/// * y-axis: to your top\\n\\n/// * z-axis: towards you\\n\\n///\\n\\n/// To make below descriptions easier, we define the following:\\n\\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane.\\n\\n/// * `phi` - The angle between the `y`-axis and the spherical direction .\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sin_theta` - Should be within `[-1, 1]`\\n\\n/// * `cos_theta` - Should be within `[-1, 1]`\\n\\n/// * `sin_phi` - Should be within `[-1, 1]`\\n\\n/// * `cos_phi` - Should be within `[-1, 1]`\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sin_theta` - The sine of `theta`\\n\\n/// * `cos_theta` - The cosine of `theta`\\n\\n/// * `sin_phi` - The sine of `phi`\\n\\n/// * `cos_phi` - The cosine of `phi`\\n\\n///\\n\\n/// # Returns\\n\\n/// * The corresponding cartesian vector\\n\\npub fn spherical_to_cartesian_trig(\\n\\n sin_theta: Float,\\n\\n cos_theta: Float,\\n\\n sin_phi: Float,\\n\\n cos_phi: Float,\\n\\n) -> Vector3 {\\n\\n debug_assert!(sin_theta.in_range_incl(-1.0, 1.0));\\n\\n debug_assert!(cos_theta.in_range_incl(-1.0, 1.0));\\n\\n debug_assert!(sin_phi.in_range_incl(-1.0, 1.0));\\n\\n debug_assert!(cos_phi.in_range_incl(-1.0, 1.0));\\n\\n\\n\\n let x = sin_phi * sin_theta;\\n\\n let y = cos_phi;\\n\\n let z = sin_phi * cos_theta;\\n\\n\\n\\n Vector3::new(x, y, z)\\n\\n}\\n\\n\\n\\n/// An intersection consists of the following 4 properties:\\n\\n/// * `point` - The intersection point\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 80,\n \"score\": 135568.65724394325\n },\n {\n \"content\": \"#[inline]\\n\\npub fn uniform_sample_cone_frame(\\n\\n sample: Vector2,\\n\\n cos_theta_max: Float,\\n\\n frame: &CoordinateSystem,\\n\\n) -> Vector3 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n let cos_theta = cos_theta_max.lerp(1.0, sample.x);\\n\\n let sin_theta = cos_theta.mul_add(-cos_theta, 1.0).sqrt();\\n\\n let (sin_phi, cos_phi) = Float::sin_cos(sample.y * TAU as Float);\\n\\n\\n\\n spherical_to_cartesian_frame_trig(sin_theta, cos_theta, sin_phi, cos_phi, frame)\\n\\n}\\n\\n\\n\\n/// Computes the pdf for uniformly sampling a code.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `cos_theta` - The cone angle\\n\\n///\\n\\n/// # Results\\n\\n/// * `Float` - The pdf\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 81,\n \"score\": 135565.74022206577\n },\n {\n \"content\": \"#[typetag::serde]\\n\\npub trait BxDF: Send + Sync {\\n\\n /// Returns the type of this bxdf.\\n\\n ///\\n\\n /// # Results\\n\\n /// * The type of this BxDF\\n\\n fn get_type(&self) -> Type;\\n\\n\\n\\n /// Allows matching the user-supplied type to this BxDF.\\n\\n ///\\n\\n /// # Results\\n\\n /// * Whether the type matches.\\n\\n fn is_type(&self, t: Type) -> bool {\\n\\n let st = self.get_type();\\n\\n (st & t) == st\\n\\n }\\n\\n\\n\\n /// Evaluates the BxDF for the pair of incident and outgoing light directions and the\\n\\n /// intersection normal.\\n\\n ///\\n\\n /// # Constraints\\n\",\n \"file_path\": \"src/bxdf/mod.rs\",\n \"rank\": 82,\n \"score\": 135165.44761380192\n },\n {\n \"content\": \"/// Converts spherical coordinates to cartesian coordinates in the given frame wth following description:\\n\\n/// * `frame.x_axis`: to your right\\n\\n/// * `frame.y_axis`: to your top\\n\\n/// * `frame.z_axis`: towards you\\n\\n///\\n\\n/// To make below descriptions easier, we define the following:\\n\\n/// * `theta` - The angle between the `z`-axis and the spherical direction in the `zx` plane.\\n\\n/// * `phi` - The angle between the `y`-axis and the spherical direction.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sin_theta` - Should be within `[-1, 1]`\\n\\n/// * `cos_theta` - Should be within `[-1, 1]`\\n\\n/// * `sin_phi` - Should be within `[-1, 1]`\\n\\n/// * `cos_phi` - Should be within `[-1, 1]`\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sin_theta` - The sine of `theta`\\n\\n/// * `cos_theta` - The cosine of `theta`\\n\\n/// * `sin_phi` - The sine of `phi`\\n\\n/// * `cos_phi` - The cosine of `phi`\\n\\n/// * `frame` - The coordinate system/frame to use\\n\\n///\\n\\n/// # Returns\\n\\n/// * The corresponding cartesian vector\\n\\npub fn spherical_to_cartesian_frame_trig(\\n\\n sin_theta: Float,\\n\\n cos_theta: Float,\\n\\n sin_phi: Float,\\n\\n cos_phi: Float,\\n\\n frame: &CoordinateSystem,\\n\\n) -> Vector3 {\\n\\n debug_assert!(sin_theta.in_range_incl(-1.0, 1.0));\\n\\n debug_assert!(cos_theta.in_range_incl(-1.0, 1.0));\\n\\n debug_assert!(sin_phi.in_range_incl(-1.0, 1.0));\\n\\n debug_assert!(cos_phi.in_range_incl(-1.0, 1.0));\\n\\n\\n\\n let x = frame.x_axis * sin_phi * sin_theta;\\n\\n let y = frame.y_axis * cos_phi;\\n\\n let z = frame.z_axis * sin_phi * cos_theta;\\n\\n\\n\\n x + y + z\\n\\n}\\n\\n\\n\",\n \"file_path\": \"geometry/src/lib.rs\",\n \"rank\": 83,\n \"score\": 133865.2851204726\n },\n {\n \"content\": \"#[inline]\\n\\npub fn x_bar(lambda: f64) -> f64 {\\n\\n gaussian(lambda, 1.056, 5998.0, 379.0, 310.0)\\n\\n + gaussian(lambda, 0.362, 4420.0, 160.0, 267.0)\\n\\n + gaussian(lambda, -0.065, 5011.0, 204.0, 262.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"color/src/cie.rs\",\n \"rank\": 84,\n \"score\": 126466.3011296334\n },\n {\n \"content\": \"#[inline]\\n\\npub fn y_bar(lambda: f64) -> f64 {\\n\\n gaussian(lambda, 0.821, 5688.0, 469.0, 405.0) + gaussian(lambda, 0.286, 5309.0, 163.0, 311.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"color/src/cie.rs\",\n \"rank\": 85,\n \"score\": 126466.3011296334\n },\n {\n \"content\": \"#[inline]\\n\\npub fn z_bar(lambda: f64) -> f64 {\\n\\n gaussian(lambda, 1.217, 4370.0, 118.0, 360.0) + gaussian(lambda, 0.681, 4590.0, 260.0, 138.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"color/src/cie.rs\",\n \"rank\": 86,\n \"score\": 126466.3011296334\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sample_unit_disk(sample: Vector2) -> Vector2 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n let theta = sample.x * TAU as Float;\\n\\n let (sin, cos) = theta.sin_cos();\\n\\n\\n\\n sample.y * Vector2::new(cos, sin)\\n\\n}\\n\\n\\n\\n/// Samples a concentric mapped point from the given random sample.\\n\\n///\\n\\n/// # Constraints\\n\\n/// * `sample` - All values should be within `[0, 1]`.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `sample` - A random sample\\n\\n///\\n\\n/// # Results\\n\\n/// * A concentric sample on the unit disk\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 87,\n \"score\": 124831.24884687396\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sample_unit_disk_concentric(sample: Vector2) -> Vector2 {\\n\\n debug_assert!(within_01(sample));\\n\\n\\n\\n // Map uniform random numbers to [-1,1]^2\\n\\n let offset = 2.0 * sample - Vector2::one();\\n\\n\\n\\n // Handle degeneracy at the origin\\n\\n if offset.x == 0.0 || offset.y == 0.0 {\\n\\n return Vector2::zero();\\n\\n }\\n\\n\\n\\n // Apply concentric mapping to point\\n\\n let (r, theta) = if (offset.x * offset.x) > (offset.y * offset.y) {\\n\\n (offset.x, FRAC_PI_4 as Float * offset.y / offset.x)\\n\\n } else {\\n\\n (\\n\\n offset.y,\\n\\n (FRAC_PI_4 as Float).mul_add(-offset.x / offset.y, FRAC_PI_2 as Float),\\n\\n )\\n\\n };\\n\",\n \"file_path\": \"src/mc.rs\",\n \"rank\": 88,\n \"score\": 123262.75856314178\n },\n {\n \"content\": \"pub trait FloatExt {\\n\\n fn epsilon() -> Self;\\n\\n fn big_epsilon() -> Self;\\n\\n fn in_range(&self, min: Self, max: Self) -> bool;\\n\\n fn in_range_incl(&self, min: Self, max: Self) -> bool;\\n\\n fn in_range_incl_left(&self, min: Self, max: Self) -> bool;\\n\\n fn in_range_incl_right(&self, min: Self, max: Self) -> bool;\\n\\n fn fast_min(self, other: Self) -> Self;\\n\\n fn fast_max(self, other: Self) -> Self;\\n\\n fn fast_clamp(self, min: Self, max: Self) -> Self;\\n\\n fn is_approx_zero(&self) -> bool;\\n\\n fn is_approx_eq(&self, other: Self) -> bool;\\n\\n fn is_approx_eq_with(&self, other: Self, tolerance: Self) -> bool;\\n\\n fn fast_cmp(self, other: Self) -> Ordering;\\n\\n fn lerp(self, to: Self, t: Self) -> Self;\\n\\n fn inv_lerp(self, to: Self, res: Self) -> Self;\\n\\n fn lerp_map(a_from: Self, a_to: Self, b_from: Self, b_to: Self, res: Self) -> Self;\\n\\n}\\n\\n\\n\\nmacro_rules! impl_float_ext {\\n\",\n \"file_path\": \"utility/src/floats.rs\",\n \"rank\": 89,\n \"score\": 121240.29490826244\n },\n {\n \"content\": \"fn in_range<T: PartialOrd>(t: T, min: T, max: T) -> bool {\\n\\n min <= t && t <= max\\n\\n}\\n\\n\\n\\nimpl Bound<Vector2> {\\n\\n pub fn contains(&self, p: Vector2) -> bool {\\n\\n in_range(p.x, self.min.x, self.max.x) && in_range(p.y, self.min.y, self.max.y)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for Bounds2 {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n min: Default::default(),\\n\\n max: Default::default(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Bound<UVec2> {\\n\",\n \"file_path\": \"src/sensor/bounds.rs\",\n \"rank\": 90,\n \"score\": 113429.4717778429\n },\n {\n \"content\": \"#[inline]\\n\\nfn etas(\\n\\n eta_i: RefractiveType,\\n\\n eta_t: RefractiveType,\\n\\n outgoing: Vector3,\\n\\n) -> (RefractiveType, RefractiveType, Vector3) {\\n\\n debug_assert!(is_normalized(outgoing));\\n\\n\\n\\n let entering = cos_theta(outgoing) > 0.0;\\n\\n if entering {\\n\\n (eta_i, eta_t, bxdf_normal())\\n\\n } else {\\n\\n (eta_t, eta_i, -bxdf_normal())\\n\\n }\\n\\n}\\n\\n\\n\\n/// Describes a specular reflection\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct SpecularReflection {\\n\\n r: Spectrum,\\n\\n fresnel: FresnelType,\\n\",\n \"file_path\": \"src/bxdf/specular.rs\",\n \"rank\": 91,\n \"score\": 112956.03130189632\n },\n {\n \"content\": \"#[allow(clippy::too_many_arguments)]\\n\\nfn direct_illumination_buf(\\n\\n scene: &Scene,\\n\\n sampler: Sampler,\\n\\n strategy: DirectLightStrategy,\\n\\n hit: &SceneIntersection,\\n\\n bsdf: &BSDF,\\n\\n indices: &[usize],\\n\\n illumination: &mut [Float],\\n\\n throughput: &[Float],\\n\\n) {\\n\\n if bsdf.is_empty() {\\n\\n return;\\n\\n }\\n\\n\\n\\n let outgoing_world = -hit.ray.direction;\\n\\n for light in strategy.get_emitters(scene, sampler.get_1d()) {\\n\\n let sample = light.sample_buf(hit.point, sampler.get_2d(), indices);\\n\\n\\n\\n if sample.pdf > 0.0 && sample.occlusion_tester.unoccluded(scene) {\\n\\n let intensities = bsdf.evaluate_buf(\\n\",\n \"file_path\": \"src/integrator/mod.rs\",\n \"rank\": 92,\n \"score\": 110371.13924305627\n },\n {\n \"content\": \"#[inline]\\n\\nfn rand_vec() -> Vector2 {\\n\\n Vector2::new(rand(), rand())\\n\\n}\\n\\n\\n\\nimpl CameraSampler {\\n\\n /// Generates a new camera pixel anchor for a given pixel.\\n\\n ///\\n\\n /// # Arguments\\n\\n /// * `pixel` - The pixel we are sampling/generating for.\\n\\n ///\\n\\n /// # Returns\\n\\n /// * A camera pixel anchor in range `[0, 1)`\\n\\n #[inline]\\n\\n pub fn sample(&self) -> Vector2 {\\n\\n match self {\\n\\n CameraSampler::NoOp => Vector2::broadcast(0.5),\\n\\n CameraSampler::Random => rand_vec(),\\n\\n CameraSampler::Concentric => {\\n\\n sample_unit_disk_concentric(rand_vec()) + Vector2::broadcast(0.5)\\n\\n }\\n\\n CameraSampler::NonConcentric => sample_unit_disk(rand_vec()) + Vector2::broadcast(0.5),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/samplers/camera/mod.rs\",\n \"rank\": 93,\n \"score\": 107156.78298387559\n },\n {\n \"content\": \"/// Provides an interface for computing Fresnel reflection coefficients.\\n\\npub trait Fresnel: Send + Sync {\\n\\n /// Evaluates the amount of light reflected by the surface.\\n\\n ///\\n\\n /// # Arguments\\n\\n /// * `cos_i` -The cosine of the angle between the normal and the incident\\n\\n ///\\n\\n /// # Returns\\n\\n /// * The reflectance\\n\\n fn evaluate(&self, cos_i: Float) -> Spectrum;\\n\\n\\n\\n fn evaluate_lambda(&self, lambda: Float, cos_i: Float) -> Float;\\n\\n}\\n\\n\\n\\n/// An implementation of `Fresnel` for dielectric materials.\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct FresnelDielectric {\\n\\n pub eta_i: RefractiveType,\\n\\n pub eta_t: RefractiveType,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bxdf/fresnel.rs\",\n \"rank\": 94,\n \"score\": 106621.94004222621\n },\n {\n \"content\": \"#[typetag::serde]\\n\\npub trait MicrofacetDistribution: Send + Sync {\\n\\n fn d(&self, wh: Vector3) -> Float;\\n\\n\\n\\n fn lambda(&self, w: Vector3) -> Float;\\n\\n\\n\\n fn g1(&self, w: Vector3) -> Float {\\n\\n 1.0 / (1.0 + self.lambda(w))\\n\\n }\\n\\n\\n\\n fn g(&self, wi: Vector3, wo: Vector3) -> Float {\\n\\n 1.0 / (1.0 + self.lambda(wo) + self.lambda(wi))\\n\\n }\\n\\n\\n\\n fn sample_wh(&self, wo: Vector3, sample: Vector2) -> Vector3;\\n\\n\\n\\n fn pdf(&self, wo: Vector3, wh: Vector3) -> Float {\\n\\n if self.is_sample_visible_area() {\\n\\n self.d(wh) * self.g1(wo) * wo.dot(wh).abs() / cos_theta(wo).abs()\\n\\n } else {\\n\\n self.d(wh) * cos_theta(wh).abs()\\n\",\n \"file_path\": \"src/bxdf/microfacet.rs\",\n \"rank\": 95,\n \"score\": 104919.51150843641\n },\n {\n \"content\": \"#[inline]\\n\\npub fn gaussian(lambda: f64, alpha: f64, mu: f64, sigma1: f64, sigma2: f64) -> f64 {\\n\\n let t = (lambda - mu) / if lambda < mu { sigma1 } else { sigma2 };\\n\\n alpha * f64::exp(-(t * t) / 2.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"color/src/cie.rs\",\n \"rank\": 96,\n \"score\": 102468.47492015219\n }\n]","isConversational":false}}},{"rowIdx":3692,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"sentry/src/hash.rs"},"repo_name":{"kind":"string","value":"agaviria/oxide"},"commit":{"kind":"string","value":"bb0b274da172a3223283280f6b213673f4c54dc4"},"file_code":{"kind":"string","value":"use std::str::FromStr;\n\nuse argonautica::{\n\tself,\n\tconfig::{Variant, Version},\n\t{Hasher, Verifier},\n\tinput::SecretKey,\n};\nuse crate::error::{Error, ErrorKind, ParseError};\nuse failure::format_err;\n\nconst SALT_SIZE : usize = 32;\n\nenum HashVersion {\n\tV1,\n}\n\nimpl HashVersion {\n\tpub fn from_hash(hash: &str) -> Option<HashVersion> {\n\t\tlet version: String = hash.chars().take_while(|c| c != &'$').collect();\n\t\tmatch version.as_ref() {\n\t\t\t\"1\" => Some(HashVersion::V1),\n\t\t\t_ => None,\n\t\t}\n\t}\n}\n\nstruct V1Hash {\n\tpub salt: [u8; SALT_SIZE],\n\tpub hash: [u8; 32],\n}\n\nimpl V1Hash {\n\n\t\n\t#[allow(dead_code)]\n\tpub fn hash_password(password: &str) -> Result<Self, Error> {\n\t\tuse crate::random;\n\n\t\tlet salt = random::generate_random_byte_array();\n\t\tlet slen = salt.len();\n\n\t\t\n\t\tif !(slen == 32) {\n\t\t\treturn Err(\n\t\t\t\tErrorKind::Msg(format!(\n\t\t\t\t\t\t\"Expected salt size (32), got salt size({})\",\n\t\t\t\t\t\tslen)).into())\n\t\t}\n\n\t\tlet encrypt = argon2id(password, &salt)?;\n\t\tlet mut hash = [0u8; 32];\n\t\tfor (&x, p) in encrypt.into_bytes()\n\t\t\t.iter().zip(hash.iter_mut()){\n\t\t\t\t*p = x;\n\t\t\t}\n\n\t\tOk (V1Hash { salt, hash })\n\t}\n\n\t\n\tpub fn check(&self, password: &str) -> Result<bool, Error> {\n\t\tlet key = load_env_var(\"SECRET_KEY\")?;\n\t\tlet mut verifier = Verifier::new();\n\t\tlet is_valid = if verifier\n\t\t\t.with_secret_key(&key)\n\t\t\t.with_password(password)\n\t\t\t.verify()\n\t\t\t.is_ok()\n\t\t\t{\n\t\t\t\ttrue\n\t\t\t} else {\n\t\t\t\tfalse\n\t\t\t};\n\n\t\tOk(is_valid)\n\n\t}\n\n\t\n\tpub fn from_bytes<B: AsRef<[u8]>, C: AsRef<[u8]>>(b0: B, b1: C) ->\n\t\tResult<Self, ParseError> {\n\t\t\tlet salt_byte = b0.as_ref();\n\t\t\tlet hash_byte= b1.as_ref();\n\t\t\tvalidate!(\n\t\t\t\tsalt_byte.len() != 32 || hash_byte.len() != 32,\n\t\t\t\tParseError::InvalidLen\n\t\t\t);\n\t\t\tlet mut salt = [0u8; 32];\n\t\t\tlet mut hash = [0u8; 32];\n\t\t\tsalt.copy_from_slice(salt_byte);\n\t\t\thash.copy_from_slice(hash_byte);\n\t\t\tOk(V1Hash { salt, hash } )\n\t\t}\n}\n\nimpl FromStr for V1Hash {\n\ttype Err = ParseError;\n\n\tfn from_str(s: &str) -> Result<Self, ParseError> {\n\t\tlet parts: Vec<_> = s.split('$').collect();\n\t\tvalidate!(parts.len() != 3, ParseError::InvalidVecLen);\n\t\tvalidate!(parts[0] != \"1\", ParseError::InvalidSlice);\n\n\t\tlet vec_salt = base64::decode(parts[1])\n\t\t\t.map_err(|e| ParseError::DecodeError(e))?;\n\n\t\tlet vec_hash = base64::decode(parts[2])\n\t\t\t.map_err(|e| ParseError::DecodeError(e))?;\n\n\t\tlet v1hash_from_bytes = V1Hash::from_bytes(&vec_salt, &vec_hash)?;\n\n\t\tlet salt = v1hash_from_bytes.salt;\n\t\tlet hash = v1hash_from_bytes.hash;\n\n\t\tOk(Self { salt, hash })\n\t}\n}\n\nimpl ToString for V1Hash {\n\tfn to_string(&self) -> String {\n\t\tlet as_str = format!(\n\t\t\t\"1${}${}\",\n\t\t\t\n\t\t\tbase64::encode(&self.salt),\n\t\t\t\n\t\t\tbase64::encode(&self.hash),\n\t\t\t);\n\t\tas_str\n\t}\n}\n\nimpl Into<String> for V1Hash {\n\tfn into(self) -> String {\n\t\tself.to_string()\n\t}\n}\n\npub fn argon2id(pwd: &str, salt: &[u8]) -> Result<String, Error> {\n\tlet key = load_env_var(\"SECRET_KEY\")?;\n\n\tlet mut a2id = Hasher::default();\n\tlet raw_hash = a2id\n\t\t.configure_hash_len(32)\n\t\t.configure_variant(Variant::Argon2id)\n\t\t.configure_version(Version::_0x13)\n\t\t.with_password(pwd)\n\t\t.with_salt(salt)\n\t\t.with_secret_key(key);\n\n\tlet hash_encoded = raw_hash.hash()?;\n\tOk(hash_encoded)\n}\n\npub fn check_password(pwd: &str, hash: &str) -> bool {\n\tmatch HashVersion::from_hash(hash) {\n\t\tSome(HashVersion::V1) => {\n\t\t\tlet v1_hash: V1Hash = match hash.parse() {\n\t\t\t\tOk(v1_hash) => v1_hash,\n\t\t\t\tErr(_) => return false,\n\t\t\t};\n\n\t\t\tv1_hash.check(pwd).unwrap()\n\t\t}\n\t\tNone => false,\n\t}\n}\n\npub fn load_env_var(env: &str) -> Result<SecretKey<'static>, Error> {\n\tlet _path = dotenv::from_path(\"../sentry.env\")\n\t\t.map_err(|e|\n\t\t\t\t\t\t format_err!(\n\t\t\t\t\t\t\t \"Failed to load env file. Cause: {}\", e\n\t\t\t\t\t\t ))?;\n\tlet env_var = std::env::var(env)\n\t\t.expect(\"Please inspect env variable exists\");\n\n\tOk(SecretKey::from_base64_encoded(&env_var)?)\n}\n\n#[cfg(test)]\nmod test {\n\tuse super::*;\n\t#[test]\n\tpub fn known_hash() {\n\t\t\n\t\t\n\t\tlet nonce = [66, 67, 80, 97, 35, 48, 7, 89, 112, 112, 32, 225, 83, 134, 76, 117, 159, 143, 191, 83, 140, 8, 239, 14, 53, 253, 105, 206, 71, 108, 116, 12];\n\t\tlet crypt = argon2id(\"WY5cpFbAY0ns\", &nonce).unwrap();\n\t\tlet encrypted: String = base64::encode(&crypt).into();\n\t\tassert_eq!(\n\t\t\tencrypted,\n\t\t\t\"JGFyZ29uMmlkJHY9MTkkbT00MDk2LHQ9MTkyLHA9OCRRa05RWVNNd0IxbHdjQ0RoVTRaTWRaK1B2MU9NQ084T05mMXB6a2RzZEF3JFcxYW5VQlBaUnUvYlFJR3E2aHBqMkorNytCOVg2SmtzZUY0dUpBM0xid0E=\"\n\t\t);\n\t}\n\t#[test]\n\tpub fn hash_roundtrip() {\n\t\tuse crate::random;\n\n\t\tfor _ in 0..10 {\n\t\t\tlet password: String = random::password();\n\n\t\t\tlet v1_hash: String = V1Hash::hash_password(&password).unwrap().into();\n\t\t\teprintln!(\"{:?}\", v1_hash);\n\t\t\tassert!(true, check_password(&password, &v1_hash))\n\t\t}\n\t}\n}\n"},"prefix":{"kind":"string","value":"use std::str::FromStr;\n\nuse argonautica::{\n\tself,\n\tconfig::{Variant, Version},\n\t{Hasher, Verifier},\n\tinput::SecretKey,\n};\nuse crate::error::{Error, ErrorKind, ParseError};\nuse failure::format_err;\n\nconst SALT_SIZE : usize = 32;\n\nenum HashVersion {\n\tV1,\n}\n\nimpl HashVersion {\n\tpub fn from_hash(hash: &str) -> Option<HashVersion> {\n\t\tlet version: String = hash.chars().take_while(|c| c != &'$').collect();\n\t\tmatch version.as_ref() {\n\t\t\t\"1\" => Some(HashVersion::V1),\n\t\t\t_ => None,\n\t\t}\n\t}\n}\n\nstruct V1Hash {\n\tpub salt: [u8; SALT_SIZE],\n\tpub hash: [u8; 32],\n}\n\nimpl V1Hash {\n\n\t\n\t#[allow(dead_code)]\n\tpub fn hash_password(password: &str) -> Result<Self, Error> {\n\t\tuse crate::random;\n\n\t\tlet salt = random::generate_random_byte_array();\n\t\tlet slen = salt.len();\n\n\t\t\n\t\tif !(slen == 32) {\n\t\t\treturn Err(\n\t\t\t\tErrorKind::Msg(format!(\n\t\t\t\t\t\t\"Expected salt size (32), got salt size({})\",\n\t\t\t\t\t\tslen)).into())\n\t\t}\n\n\t\tlet encrypt = argon2id(password, &salt)?;\n\t\tlet mut hash = [0u8; 32];\n\t\tfor (&x, p) in encrypt.into_bytes()\n\t\t\t.iter().zip(hash.iter_mut()){\n\t\t\t\t*p = x;\n\t\t\t}\n\n\t\tOk (V1Hash { salt, hash })\n\t}\n\n\t\n\t"},"suffix":{"kind":"string","value":"\n\n\t\n\tpub fn from_bytes<B: AsRef<[u8]>, C: AsRef<[u8]>>(b0: B, b1: C) ->\n\t\tResult<Self, ParseError> {\n\t\t\tlet salt_byte = b0.as_ref();\n\t\t\tlet hash_byte= b1.as_ref();\n\t\t\tvalidate!(\n\t\t\t\tsalt_byte.len() != 32 || hash_byte.len() != 32,\n\t\t\t\tParseError::InvalidLen\n\t\t\t);\n\t\t\tlet mut salt = [0u8; 32];\n\t\t\tlet mut hash = [0u8; 32];\n\t\t\tsalt.copy_from_slice(salt_byte);\n\t\t\thash.copy_from_slice(hash_byte);\n\t\t\tOk(V1Hash { salt, hash } )\n\t\t}\n}\n\nimpl FromStr for V1Hash {\n\ttype Err = ParseError;\n\n\tfn from_str(s: &str) -> Result<Self, ParseError> {\n\t\tlet parts: Vec<_> = s.split('$').collect();\n\t\tvalidate!(parts.len() != 3, ParseError::InvalidVecLen);\n\t\tvalidate!(parts[0] != \"1\", ParseError::InvalidSlice);\n\n\t\tlet vec_salt = base64::decode(parts[1])\n\t\t\t.map_err(|e| ParseError::DecodeError(e))?;\n\n\t\tlet vec_hash = base64::decode(parts[2])\n\t\t\t.map_err(|e| ParseError::DecodeError(e))?;\n\n\t\tlet v1hash_from_bytes = V1Hash::from_bytes(&vec_salt, &vec_hash)?;\n\n\t\tlet salt = v1hash_from_bytes.salt;\n\t\tlet hash = v1hash_from_bytes.hash;\n\n\t\tOk(Self { salt, hash })\n\t}\n}\n\nimpl ToString for V1Hash {\n\tfn to_string(&self) -> String {\n\t\tlet as_str = format!(\n\t\t\t\"1${}${}\",\n\t\t\t\n\t\t\tbase64::encode(&self.salt),\n\t\t\t\n\t\t\tbase64::encode(&self.hash),\n\t\t\t);\n\t\tas_str\n\t}\n}\n\nimpl Into<String> for V1Hash {\n\tfn into(self) -> String {\n\t\tself.to_string()\n\t}\n}\n\npub fn argon2id(pwd: &str, salt: &[u8]) -> Result<String, Error> {\n\tlet key = load_env_var(\"SECRET_KEY\")?;\n\n\tlet mut a2id = Hasher::default();\n\tlet raw_hash = a2id\n\t\t.configure_hash_len(32)\n\t\t.configure_variant(Variant::Argon2id)\n\t\t.configure_version(Version::_0x13)\n\t\t.with_password(pwd)\n\t\t.with_salt(salt)\n\t\t.with_secret_key(key);\n\n\tlet hash_encoded = raw_hash.hash()?;\n\tOk(hash_encoded)\n}\n\npub fn check_password(pwd: &str, hash: &str) -> bool {\n\tmatch HashVersion::from_hash(hash) {\n\t\tSome(HashVersion::V1) => {\n\t\t\tlet v1_hash: V1Hash = match hash.parse() {\n\t\t\t\tOk(v1_hash) => v1_hash,\n\t\t\t\tErr(_) => return false,\n\t\t\t};\n\n\t\t\tv1_hash.check(pwd).unwrap()\n\t\t}\n\t\tNone => false,\n\t}\n}\n\npub fn load_env_var(env: &str) -> Result<SecretKey<'static>, Error> {\n\tlet _path = dotenv::from_path(\"../sentry.env\")\n\t\t.map_err(|e|\n\t\t\t\t\t\t format_err!(\n\t\t\t\t\t\t\t \"Failed to load env file. Cause: {}\", e\n\t\t\t\t\t\t ))?;\n\tlet env_var = std::env::var(env)\n\t\t.expect(\"Please inspect env variable exists\");\n\n\tOk(SecretKey::from_base64_encoded(&env_var)?)\n}\n\n#[cfg(test)]\nmod test {\n\tuse super::*;\n\t#[test]\n\tpub fn known_hash() {\n\t\t\n\t\t\n\t\tlet nonce = [66, 67, 80, 97, 35, 48, 7, 89, 112, 112, 32, 225, 83, 134, 76, 117, 159, 143, 191, 83, 140, 8, 239, 14, 53, 253, 105, 206, 71, 108, 116, 12];\n\t\tlet crypt = argon2id(\"WY5cpFbAY0ns\", &nonce).unwrap();\n\t\tlet encrypted: String = base64::encode(&crypt).into();\n\t\tassert_eq!(\n\t\t\tencrypted,\n\t\t\t\"JGFyZ29uMmlkJHY9MTkkbT00MDk2LHQ9MTkyLHA9OCRRa05RWVNNd0IxbHdjQ0RoVTRaTWRaK1B2MU9NQ084T05mMXB6a2RzZEF3JFcxYW5VQlBaUnUvYlFJR3E2aHBqMkorNytCOVg2SmtzZUY0dUpBM0xid0E=\"\n\t\t);\n\t}\n\t#[test]\n\tpub fn hash_roundtrip() {\n\t\tuse crate::random;\n\n\t\tfor _ in 0..10 {\n\t\t\tlet password: String = random::password();\n\n\t\t\tlet v1_hash: String = V1Hash::hash_password(&password).unwrap().into();\n\t\t\teprintln!(\"{:?}\", v1_hash);\n\t\t\tassert!(true, check_password(&password, &v1_hash))\n\t\t}\n\t}\n}\n"},"middle":{"kind":"string","value":"pub fn check(&self, password: &str) -> Result<bool, Error> {\n\t\tlet key = load_env_var(\"SECRET_KEY\")?;\n\t\tlet mut verifier = Verifier::new();\n\t\tlet is_valid = if verifier\n\t\t\t.with_secret_key(&key)\n\t\t\t.with_password(password)\n\t\t\t.verify()\n\t\t\t.is_ok()\n\t\t\t{\n\t\t\t\ttrue\n\t\t\t} else {\n\t\t\t\tfalse\n\t\t\t};\n\n\t\tOk(is_valid)\n\n\t}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// decrypt_aud() takes in AES 256-bit base64 encoded string and decrypts it.\n\npub fn decrypt_aud(audience_identifier: &str) -> Result<String, Error> {\n\n\tlet key: Option<&String> = MASTER_ASAP_KEY.get();\n\n\tlet mut secret: MagicCrypt = new_magic_crypt!(key.unwrap().as_str(), 256);\n\n\tlet raw = secret.decrypt_base64_to_string(audience_identifier).unwrap();\n\n\tOk(raw)\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":1,"score":154617.20512044494},{"content":"/// Encrypts the client_data to AES 256-bit, encoded as base64.\n\npub fn encrypt_aud_to_base64(client_data: &str) -> String {\n\n\tlet key: Option<&String> = MASTER_ASAP_KEY.get();\n\n\tlet mut secret: MagicCrypt = new_magic_crypt!(key.unwrap().as_str(), 256);\n\n\tlet aud_claims = secret.encrypt_str_to_base64(client_data);\n\n\tlog::info!(\"encrpted aud claims field: {}\", aud_claims);\n\n\n\n\taud_claims.to_string()\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":2,"score":150213.03615443743},{"content":"/// Generate a random string.\n\npub fn string(length: usize) -> String {\n\n random_string_with_characters(length, RANDOM_CHARACTERS)\n\n}\n\n\n","file_path":"sentry/src/random.rs","rank":4,"score":136998.940926843},{"content":"/// Generate a random string without ambiguous characters.\n\npub fn unambiguous_string(length: usize) -> String {\n\n random_string_with_characters(length, RANDOM_UNAMBIGUOUS_CHARACTERS)\n\n}\n\n\n","file_path":"sentry/src/random.rs","rank":6,"score":128095.9164735211},{"content":"/// Generate a random, lowercase string without ambiguous characters.\n\npub fn unambiguous_lowercase_string(length: usize) -> String {\n\n random_string_with_characters(length, RANDOM_UNAMBIGUOUS_LOWERCASE_CHARACTERS)\n\n}\n\n\n","file_path":"sentry/src/random.rs","rank":7,"score":125242.8729263022},{"content":"/// Generates a 256-bit random byte array.\n\npub fn generate_random_byte_array() -> [u8; 32] {\n\n use rand::Rng;\n\n\n\n const SIZE : usize = 32;\n\n\n\n let mut rng = rand::thread_rng();\n\n let mut rand_array = [0u8; SIZE];\n\n rng.try_fill(&mut rand_array[..]).expect(\"Failed to fill random bytes\");\n\n\n\n rand_array\n\n}\n\n\n","file_path":"sentry/src/random.rs","rank":9,"score":124006.73237934863},{"content":"/// Runs a function on a threadpool, ignoring a potential Diesel error inside the threadpool.\n\n/// This error is turned into an internal server error (as Diesel errors are unexpected, and\n\n/// indicative of erroneous queries).\n\npub fn threadpool_diesel_ok<F, T>(f: F) -> impl Future<Item = T, Error = Rejection>\n\nwhere\n\nF: FnOnce() -> Result<T, diesel::result::Error>,\n\n{\n\n threadpool(f).and_then(|result| match result {\n\n Ok(v) => future::ok(v),\n\n Err(_) => future::err(warp::reject::custom(INTERNAL_SERVER_ERROR)),\n\n })\n\n}\n\n\n","file_path":"src/utils.rs","rank":10,"score":120655.96375079898},{"content":"/// Create a filter that gates a request behind a leaky bucket rate limiter.\n\n///\n\n/// # Panics\n\n/// Panics if it is used with a transport not using socket addresses.\n\npub fn leaky_bucket() -> impl Filter<Extract = (), Error = Rejection> + Clone {\n\n let limiter = Arc::new(Mutex::new(KeyedRateLimiter::<SocketAddr>::new(\n\n std::num::NonZeroU32::new(2u32).unwrap(),\n\n std::time::Duration::from_secs(1),\n\n )));\n\n\n\n warp::addr::remote()\n\n .and_then(move |addr: Option<SocketAddr>| {\n\n let addr = addr\n\n .expect(\n\n \"Must be used with a transport utilizing socket addresses.\"\n\n );\n\n let mut limiter = limiter.lock().unwrap();\n\n match limiter.check(addr) {\n\n Ok(_) => Ok(()),\n\n Err(neg) => Err(\n\n warp::reject::custom(Fault::RateLimit(RateLimitException {\n\n wait_time_millis: neg\n\n .wait_time_from(Instant::now())\n\n .as_millis() as u64,\n\n }))),\n\n }\n\n })\n\n .untuple_one()\n\n}\n","file_path":"src/rate_limit.rs","rank":11,"score":119844.22676062942},{"content":"/// Generate a random string with N characters.\n\npub fn random_string_with_characters(length: usize, characters: &[char]) -> String {\n\n use rand::Rng;\n\n\n\n let mut rng = rand::thread_rng();\n\n let distribution = rand::distributions::Uniform::new(0, characters.len());\n\n\n\n let mut string = String::with_capacity(length);\n\n for _ in 0..length {\n\n let idx = rng.sample(distribution);\n\n string.push(characters[idx])\n\n }\n\n\n\n string\n\n}\n\n\n","file_path":"sentry/src/random.rs","rank":12,"score":115267.61149582316},{"content":"/// Generate a password.\n\npub fn password() -> String {\n\n const PASSWORD_LENGTH: usize = 24;\n\n unambiguous_string(PASSWORD_LENGTH)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test_collisions {\n\n use super::*;\n\n use std::collections::HashMap;\n\n\n\n #[test]\n\n fn no_collisions () {\n\n let count = 1_000_000;\n\n let mut ids = HashMap::new();\n\n\n\n for _ in 0..count {\n\n let id = string(20);\n\n\n\n if ids.contains_key(&id) {\n\n panic!(\"collision detected\");\n\n }\n\n\n\n ids.insert(id, true);\n\n }\n\n }\n\n}\n","file_path":"sentry/src/random.rs","rank":13,"score":114372.87802479483},{"content":"/// Run a function on a threadpool, returning a future resolving when the\n\n/// function completes. Any (unexpected!) threadpool error is turned into a\n\n/// Warp rejection, wrapping the Internal Server Error problem.\n\npub fn threadpool<F, T>(f: F) -> impl Future<Item = T, Error = Rejection>\n\nwhere\n\nF: FnOnce() -> T,\n\n{\n\n fut_threadpool(f).map_err(|_| warp::reject::custom(INTERNAL_SERVER_ERROR))\n\n}\n\n\n","file_path":"src/utils.rs","rank":14,"score":108609.37723972036},{"content":"/// Run a function on a threadpool, returning a future resolving when the function completes.\n\npub fn fut_threadpool<F, T>(f: F) -> impl Future<Item = T, Error = tokio_threadpool::BlockingError>\n\nwhere\n\nF: FnOnce() -> T,\n\n{\n\n let mut f_only_once = Some(f);\n\n futures::future::poll_fn(move || {\n\n tokio_threadpool::blocking(|| {\n\n let f = f_only_once.take().unwrap();\n\n f()\n\n })\n\n })\n\n}\n\n\n","file_path":"src/utils.rs","rank":15,"score":106196.39439829587},{"content":"/// get_validator() is a constructor method for ValidatorBuilder.\n\n/// Incoming ASAP tokens must include resource server audience identifier in\n\n/// their `aud` claim in order for a token to be valid.\n\npub fn get_validator(keyserver_uri: &str) -> ValidatorBuilder {\n\n\tlet audience_identifier = encrypt_aud_to_base64(AUD);\n\n\tlet resource_server_audience = String::from(audience_identifier);\n\n\tValidator::builder(String::from(keyserver_uri), resource_server_audience)\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":17,"score":96764.95094672921},{"content":"/// generate_token() takes in client_data which will be used in the 'aud'\n\n/// claims, and TokenType variont of 'Normal' or 'Refresh'. The method\n\n/// returns an ASAP token with extra claims.\n\n///\n\n/// The token will have different lifespans depending on the TokenType variant.\n\npub fn generate_token(token_type: TokenType, client_data: &str)\n\n\t-> Result<String, Error>\n\n{\n\n\tlet mut generator = generator_build();\n\n\tmatch token_type {\n\n\t\tTokenType::Normal => {\n\n\t\t\tlet _ = generator.set_max_lifespan(NORMAL_LIFESPAN);\n\n\t\t\tlet normal_token = generator\n\n\t\t\t\t.token(\n\n\t\t\t\t\tdefault_aud(client_data),\n\n\t\t\t\t\tset_token_type(TokenType::Normal)\n\n\t\t\t\t)?;\n\n\t\t\tOk(normal_token)\n\n\t\t},\n\n\t\tTokenType::Refresh => {\n\n\t\t\tlet _ = generator.set_max_lifespan(REFRESH_LIFESPAN);\n\n\t\t\tlet refresh_token = generator\n\n\t\t\t\t.token(\n\n\t\t\t\t\tdefault_aud(client_data),\n\n\t\t\t\t\tset_token_type(TokenType::Refresh)\n\n\t\t\t\t)?;\n\n\t\t\tOk(refresh_token)\n\n\t\t},\n\n\t}\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":18,"score":90651.5061206384},{"content":"/// Convert rejections into replies.\n\npub fn handle_rejection(rejection: Rejection) -> Result<impl Reply, Rejection> {\n\n use crate::exception::{ExceptionMsg, Fault};\n\n\n\n let reply = if let Some(fault) = rejection.find_cause::<Fault>() {\n\n // This rejection originated in this implementation.\n\n let static_exception = ExceptionMsg::from(fault);\n\n\n\n warp::reply::with_status(\n\n serde_json::to_string(&static_exception).unwrap(),\n\n fault.to_status_code(),\n\n )\n\n } else {\n\n // This rejection originated in Warp.\n\n let fault = if rejection.is_not_found() {\n\n exception::NOT_FOUND\n\n } else {\n\n exception::INTERNAL_SERVER_ERROR\n\n };\n\n let static_exception = ExceptionMsg::from(&fault);\n\n\n","file_path":"src/utils.rs","rank":19,"score":90383.79073001172},{"content":"/// aud_from_json() extracts the inner member of Aud enum variant.\n\n/// Its purpose is to get the `aud` variant from a token payload.\n\n///\n\n/// This method is credited to @Sébastien Renauld, over at StackOverflow.\n\n/// Thank you for your help and patience.\n\npub fn aud_from_json(data: &asap::claims::Aud) -> IoResult<String> {\n\n\tmatch data {\n\n\t\tAud::One(audience) => Ok(audience.clone()),\n\n\t\tAud::Many(audiences) => audiences\n\n\t\t\t.last()\n\n\t\t\t.ok_or(\n\n\t\t\t\tstd::io::Error::new(\n\n\t\t\t\t\tstd::io::ErrorKind::NotFound, \"No audience found\")\n\n\t\t\t).map(|r| r.clone())\n\n\t}\n\n}\n","file_path":"sentry/src/token.rs","rank":20,"score":86159.70045457888},{"content":"/// Create a filter to get a PostgreSQL connection from a PostgreSQL connection pool.\n\npub fn pg(\n\n pg_pool: crate::utils::PgPool,\n\n ) -> impl Filter<Extract = (crate::utils::PgPooled,),\n\n Error = Rejection> + Clone {\n\n warp::any()\n\n .map(move || pg_pool.clone())\n\n .and_then(|pg_pool: crate::utils::PgPool| match pg_pool.get() {\n\n Ok(pg_pooled) => Ok(pg_pooled),\n\n Err(_) => Err(warp::reject::custom(INTERNAL_SERVER_ERROR)),\n\n })\n\n }\n\n\n","file_path":"src/utils.rs","rank":21,"score":79519.87857440436},{"content":"/// A thread-safe cell which can be written to only once\n\npub fn init_thread_safe_key() {\n\n\tstd::thread::spawn(|| {\n\n\t\tlet _value: String = MASTER_ASAP_KEY.get_or_init(|| {\n\n\t\t\tlet file_path = std::env::var(\"MASTER_ASAP_KEY\")\n\n\t\t\t\t.unwrap_or(\"./warden.key\".to_owned());\n\n\n\n\t\t\tlog::debug!(\"Using `aud` obfuscator file {}\", file_path);\n\n\n\n\t\t\tlet aud_key: Vec<u8> = std::fs::read(&file_path).unwrap();\n\n\n\n\t\t\tlog::debug!( \"Using `aud` signer key of {} bits\", aud_key.len() * 8);\n\n\n\n\t\t\tstd::str::from_utf8(aud_key.as_slice()).unwrap().to_string()\n\n\n\n\t\t}).to_owned();\n\n\t}).join().ok().expect(\"Could not join a thread\");\n\n}\n\n\n\n/// TokenType enumerates the type of Token: [Normal or Refresh]\n\n#[derive(Debug, Serialize, Deserialize)]\n","file_path":"sentry/src/token.rs","rank":22,"score":72020.15722502998},{"content":"/// pg_pool handles the PostgreSQL connection thread pool.\n\npub fn pg_pool() -> PgPool {\n\n let db_url = env::var(\"DATABASE_URL\").expect(\"DATABASE_URL must be set\");\n\n let manager = ConnectionManager::<PgConnection>::new(db_url);\n\n let pool = Pool::new(manager)\n\n .expect(\"PostgreSQL connection pool could not be created\");\n\n log::info!(\"initiated postgresSQL thread connection pool\");\n\n\n\n pool\n\n}\n\n\n","file_path":"src/utils.rs","rank":23,"score":71313.7838399105},{"content":"/// Converts client_data to audience server identifier for generator consumption\n\nfn default_aud(client_data: &str) -> Aud {\n\n\tlet audience_identifier = Aud::One(encrypt_aud_to_base64(client_data));\n\n\taudience_identifier\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":24,"score":69762.76747409411},{"content":"/// Generator builder for ASAP Claims.\n\nfn generator_build() -> Generator {\n\n\tGenerator::new(\n\n\t\tISS.to_string(),\n\n\t\tKID.to_string(),\n\n\t\tPKEY.to_vec(),\n\n\t\t)\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":25,"score":36634.38402261989},{"content":"fn pg_pool() -> PgPool {\n\n let manager =\n\n ConnectionManager::<PgConnection>::new(\"postgres://ag@localhost/oxide\");\n\n}\n","file_path":"src/persistance.rs","rank":26,"score":36634.38402261989},{"content":"fn main() -> Result<(), Terminator> {\n\n dotenv().ok();\n\n Logger::new().start(log::LevelFilter::Info)?;\n\n log::info!(\"log mechanism initialized...\");\n\n\n\n let db_pool = utils::pg_pool();\n\n let _db = utils::pg(db_pool);\n\n\n\n let rate_limiter = rate_limit::leaky_bucket();\n\n\n\n let bundle_oxide = rate_limiter\n\n .and(\n\n warp::path!(\"version\")\n\n .map(|| payload::ResponseBuilder::ok()\n\n .body(env!(\"CARGO_PKG_VERSION\")\n\n )\n\n )\n\n .or(path!(\"time\")\n\n .map(|| payload::ResponseBuilder::ok()\n\n .body(Utc::now().to_rfc3339())\n","file_path":"src/main.rs","rank":27,"score":36491.09147709531},{"content":"/// type_of_token() is a helper method to include ExtraClaims hashMap of TokenType.\n\n///\n\n/// ASAP tokens have a hard limit of 3600 as their lifespan. This limitation\n\n/// puts a halt on a new generator implementation, which intended on\n\n/// overriding the 'exp' field and setting an ExtraClaim of TokenType.\n\nfn set_token_type(token_type: TokenType) -> Option<ExtraClaims> {\n\n\tlet normal = TokenType::Normal;\n\n\tlet refresh = TokenType::Refresh;\n\n\n\n\tlet mut extra_claims = HashMap::new();\n\n\tmatch token_type {\n\n\t\tTokenType::Normal => {\n\n\t\t\textra_claims.insert(\"TokenType\".to_string(), json!(\n\n\t\t\t\t\tInto::<&str>::into(normal)));\n\n\t\t},\n\n\n\n\t\tTokenType::Refresh => {\n\n\t\t\textra_claims.insert(\"TokenType\".to_string(), json!(\n\n\t\t\t\t\tInto::<&str>::into(refresh)));\n\n\t\t},\n\n\t}\n\n\tSome(extra_claims)\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":28,"score":28787.971956842695},{"content":"\n\nimpl Fail for Error {\n\n fn cause(&self) -> Option<&dyn Fail> {\n\n self.inner.cause()\n\n }\n\n\n\n fn backtrace(&self) -> Option<&Backtrace> {\n\n self.inner.backtrace()\n\n }\n\n}\n\n\n\nimpl Display for Error {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n Display::fmt(&self.inner, f)\n\n }\n\n}\n\n\n\nimpl Error {\n\n pub fn kind(&self) -> ErrorKind {\n\n *self.inner.get_context()\n","file_path":"src/error.rs","rank":29,"score":25963.84096793664},{"content":"use failure::{Fail, Context, Backtrace};\n\nuse failure::Error as FailureError;\n\n\n\nuse std::fmt::{self, Display};\n\n\n\n/// convenience alias wrapper Result.\n\npub type Result<T> = ::std::result::Result<T, Error>;\n\n\n\n#[derive(Debug, Clone, Copy, Fail)]\n\npub enum ErrorKind {\n\n #[fail(display=\"From Failure\")]\n\n FromFailure,\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct Error {\n\n /// Inner `Context` with the `Fail` implementor.\n\n inner: Context<ErrorKind>,\n\n}\n\n\n","file_path":"src/error.rs","rank":30,"score":25962.71730022315},{"content":" }\n\n}\n\n\n\nimpl From<ErrorKind> for Error {\n\n fn from(kind: ErrorKind) -> Error {\n\n Error { inner: Context::new(kind) }\n\n }\n\n}\n\n\n\nimpl From<Context<ErrorKind>> for Error {\n\n fn from(inner: Context<ErrorKind>) -> Error {\n\n Error { inner: inner }\n\n }\n\n}\n\n\n\nimpl From<FailureError> for Error {\n\n fn from(e: FailureError) -> Error {\n\n Error { inner: e.context(ErrorKind::FromFailure) }\n\n }\n\n}\n","file_path":"src/error.rs","rank":31,"score":25961.183454486138},{"content":"}\n\n\n\n/// ParseError handles the parse validation errors for HashVersion V1.\n\n#[derive(Debug)]\n\npub enum ParseError {\n\n\t/// base64 decode error\n\n\tDecodeError(base64::DecodeError),\n\n\t/// Utf-8 string error\n\n\tUtf8(std::str::Utf8Error),\n\n\t/// vector length validator\n\n\tInvalidVecLen,\n\n\t/// slice validation\n\n\tInvalidSlice,\n\n\t/// byte size validation can occur in `salt` or `hash` types of V1Hash\n\n\tInvalidLen,\n\n}\n\n\n\nimpl Display for ParseError {\n\n\tfn fmt(&self, fmt: &mut Formatter) -> FmtResult {\n\n\t\tmatch &*self {\n","file_path":"sentry/src/error.rs","rank":39,"score":24657.21105691059},{"content":"\t#[fail(display = \"{}\", _0)]\n\n\tMsg(String),\n\n\n\n\t#[fail(display = \"Base64 encode error\")]\n\n\tEnvVarEncoder(argonautica::Error),\n\n\n\n\t#[fail(display = \"Failure error\")]\n\n\tFromFailure,\n\n\n\n\t#[fail(display = \"I/O error\")]\n\n\tIO,\n\n\n\n\t#[fail(display = \"Hash error\")]\n\n\tHasher,\n\n\n\n\t#[fail(display = \"Invalid Vector length: got {}, expected {}\", got, expected)]\n\n\tVecLength { got: usize, expected: usize },\n\n}\n\n\n\n/// Sentry application error.\n","file_path":"sentry/src/error.rs","rank":40,"score":24655.27158296153},{"content":"use std::{\n\n\tenv,\n\n\tfmt::{Display, Formatter, Result as FmtResult},\n\n};\n\nuse failure::{Backtrace, Context, Fail};\n\n\n\n/// convenience alias wrapper Result.\n\npub type Result<T> = ::std::result::Result<T, Error>;\n\n\n\n/// Sentry package error kind.\n\n#[derive(Debug, Fail)]\n\npub enum ErrorKind {\n\n\t#[fail(display = \"Hasher config error\")]\n\n\tHashConfigError(argonautica::Error),\n\n\n\n\t/// An error with an arbitrary message, referenced as &'static str\n\n\t#[fail(display = \"{}\", _0)]\n\n\tMessage(&'static str),\n\n\n\n\t/// An error with an arbitrary message, stored as String\n","file_path":"sentry/src/error.rs","rank":41,"score":24652.490199653017},{"content":"impl<E: Into<ErrorKind>> From<E> for Error {\n\n\tfn from(err: E) -> Error {\n\n\t\tContext::new(err.into()).into()\n\n\t}\n\n}\n\n\n\nimpl From<Context<ErrorKind>> for Error {\n\n\tfn from(inner: Context<ErrorKind>) -> Error {\n\n\t\tError { inner: inner }\n\n\t}\n\n}\n\n\n\nimpl From<&'static str> for Error {\n\n\tfn from(msg: &'static str) -> Error {\n\n\t\tErrorKind::Message(msg).into()\n\n\t}\n\n}\n\n\n\nimpl From<String> for Error {\n\n\tfn from(msg: String) -> Error {\n","file_path":"sentry/src/error.rs","rank":42,"score":24651.906402082106},{"content":"\t\tErrorKind::Msg(msg).into()\n\n\t}\n\n}\n\n\n\nimpl From<failure::Error> for Error {\n\n\tfn from(err: failure::Error) -> Error {\n\n\t\tError { inner: err.context(ErrorKind::FromFailure) }\n\n\t}\n\n}\n\n\n\nimpl From<::std::io::Error> for Error {\n\n\tfn from(err: ::std::io::Error) -> Error {\n\n\t\tError { inner: err.context(ErrorKind::IO) }\n\n\t}\n\n}\n\n\n\nimpl From<argonautica::Error> for Error {\n\n\tfn from(err: argonautica::Error) -> Error {\n\n\t\tError { inner: err.context(ErrorKind::Hasher) }\n\n\t}\n","file_path":"sentry/src/error.rs","rank":43,"score":24651.72849101906},{"content":"}\n\n\n\nimpl Fail for Error {\n\n\tfn cause(&self) -> Option<&dyn Fail> {\n\n\t\tself.inner.cause()\n\n\t}\n\n\n\n\tfn backtrace(&self) -> Option<&Backtrace> {\n\n\t\tself.inner.backtrace()\n\n\t}\n\n}\n\n\n\nimpl Display for Error {\n\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\n\t\tlet show_trace = match env::var(\"RUST_BACKTRACE\") {\n\n\t\t\tOk(r) => {\n\n\t\t\t\tif r == \"1\" {\n\n\t\t\t\t\ttrue\n\n\t\t\t\t} else {\n\n\t\t\t\t\tfalse\n","file_path":"sentry/src/error.rs","rank":44,"score":24649.153556223213},{"content":"\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tErr(_) => false,\n\n\t\t};\n\n\n\n\t\tlet backtrace = match self.backtrace() {\n\n\t\t\tSome(b) => format!(\"{}\", b),\n\n\t\t\tNone => String::from(\"Unknown\"),\n\n\t\t};\n\n\n\n\t\tlet trace_fmt = format!(\"\\nBacktrace: {:?}\", backtrace);\n\n\t\tlet inner_fmt = format!(\"{}\", self.inner);\n\n\t\tlet mut print_format = inner_fmt.clone();\n\n\t\tif show_trace {\n\n\t\t\tprint_format.push_str(&trace_fmt);\n\n\t\t}\n\n\t\tDisplay::fmt(&print_format, f)\n\n\t}\n\n}\n\n\n","file_path":"sentry/src/error.rs","rank":45,"score":24648.904358052965},{"content":"#[derive(Debug)]\n\npub struct Error {\n\n\tinner: Context<ErrorKind>,\n\n}\n\n\n\nimpl Error {\n\n\t/// Returns the error variant and contents.\n\n\tpub fn kind(&self) -> &ErrorKind {\n\n\t\tself.inner.get_context()\n\n\t}\n\n\n\n\t/// Returns the immediate cause of error (e.g. the next error in the chain)\n\n\tpub fn cause(&self) -> Option<&dyn Fail> {\n\n\t\tself.inner.cause()\n\n\t}\n\n\n\n\tpub fn backtrace(&self) -> Option<&Backtrace> {\n\n\t\tself.inner.backtrace()\n\n\t}\n\n\n","file_path":"sentry/src/error.rs","rank":46,"score":24648.891517681484},{"content":"\t\t\tParseError::DecodeError(e) => write!(fmt, \"Decode error: {}\", e),\n\n\t\t\tParseError::InvalidVecLen => write!(fmt, \"Invalid vector\"),\n\n\t\t\tParseError::InvalidSlice => write!(fmt, \"Invalid Slice\"),\n\n\t\t\tParseError::InvalidLen => write!(fmt, \"Invalid byte size\"),\n\n\t\t\tParseError::Utf8(e) => write!(fmt, \"Utf-8 error: {}\", e),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl PartialEq for ParseError {\n\n\tfn eq(&self, other: &Self) -> bool {\n\n\t\tmatch self {\n\n\t\t\tParseError::InvalidVecLen => match other {\n\n\t\t\t\tParseError::InvalidVecLen => true,\n\n\t\t\t\t_ => false,\n\n\t\t\t},\n\n\t\t\tParseError::InvalidSlice => match other {\n\n\t\t\t\tParseError::InvalidSlice => true,\n\n\t\t\t\t_ => false,\n\n\t\t\t},\n","file_path":"sentry/src/error.rs","rank":47,"score":24647.69441810676},{"content":"\t\t\tParseError::InvalidLen => match other {\n\n\t\t\t\tParseError::InvalidLen => true,\n\n\t\t\t\t_ => false,\n\n\t\t\t},\n\n\t\t\tParseError::DecodeError(_) => false,\n\n\t\t\tParseError::Utf8(_) => false,\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl From<base64::DecodeError> for ParseError {\n\n\tfn from(err: base64::DecodeError) -> ParseError {\n\n\t\tParseError::DecodeError(err)\n\n\t}\n\n}\n\n\n\n// #[macro_export]\n\n// /// validates ParseError Eq implementation\n\n// macro_rules! validate {\n\n//\t($cond:expr, $e:expr) => {\n","file_path":"sentry/src/error.rs","rank":48,"score":24647.243792028858},{"content":"//\t\tif !($cond) {\n\n//\t\t\treturn Err($e);\n\n//\t\t}\n\n//\t};\n\n//\t($cond:expr, $fmt:expr, $($arg:tt)+) => {\n\n//\t\tif !($cond) {\n\n//\t\t\treturn Err($fmt, $($arg)+);\n\n//\t\t}\n\n//\t};\n\n// }\n","file_path":"sentry/src/error.rs","rank":49,"score":24642.171574922166},{"content":"CREATE OR REPLACE FUNCTION diesel_set_updated_at() RETURNS trigger AS $$\n\nBEGIN\n\n IF (\n\n NEW IS DISTINCT FROM OLD AND\n\n NEW.updated_at IS NOT DISTINCT FROM OLD.updated_at\n\n ) THEN\n\n NEW.updated_at := current_timestamp;\n\n END IF;\n\n RETURN NEW;\n\nEND;\n\n$$ LANGUAGE plpgsql;\n","file_path":"migrations/00000000000000_diesel_initial_setup/up.sql","rank":50,"score":18481.853927055785},{"content":"-- Sets up a trigger for the given table to automatically set a column called\n\n-- `updated_at` whenever the row is modified (unless `updated_at` was included\n\n-- in the modified columns)\n\n--\n\n-- # Example\n\n--\n\n-- ```sql\n\n-- CREATE TABLE users (id SERIAL PRIMARY KEY, updated_at TIMESTAMP NOT NULL DEFAULT NOW());\n\n--\n\n-- SELECT diesel_manage_updated_at('users');\n\n-- ```\n\nCREATE OR REPLACE FUNCTION diesel_manage_updated_at(_tbl regclass) RETURNS VOID AS $$\n\nBEGIN\n\n EXECUTE format('CREATE TRIGGER set_updated_at BEFORE UPDATE ON %s\n\n FOR EACH ROW EXECUTE PROCEDURE diesel_set_updated_at()', _tbl);\n\nEND;\n\n$$ LANGUAGE plpgsql;\n\n\n","file_path":"migrations/00000000000000_diesel_initial_setup/up.sql","rank":51,"score":17238.290139367724},{"content":"/// debug as such:\n\n///\n\n/// i.e.\n\n/// println!(\"{}\", Into::<&str>::into(TokenType::Refresh));\n\n///\n\n/// $ Refresh\n\nimpl <'a> TryFrom<&'a str> for TokenType {\n\n\ttype Error = &'a str;\n\n\tfn try_from(value: &'a str) -> Result<Self, &'a str> {\n\n\t\tuse self::TokenType::*;\n\n\n\n\t\tlet normal: &'static str = Normal.into();\n\n\t\tlet refresh: &'static str = Refresh.into();\n\n\n\n\t\tmatch value {\n\n\t\t\tx if x == normal => Ok(Normal),\n\n\t\t\tx if x == refresh => Ok(Refresh),\n\n\t\t\t_ => Err(\"Error while converting TokenType value to static string.\"),\n\n\t\t}\n\n\t}\n\n}\n\n\n","file_path":"sentry/src/token.rs","rank":52,"score":16.046656504655815},{"content":"\n\n// impl FromStr for Cfg {\n\n// type Err = failure::Error;\n\n\n\n// /// Load a `Cfg` from some string.\n\n// fn from(src: &str) -> Result<Self, Self::Err> {\n\n// toml::from_str(src)\n\n// .map_err(|e| format_err!(\"Failed to load config from: {}\", e))\n\n// }\n\n// }\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::Cfg;\n\n use std::path::Path;\n\n\n\n #[test]\n\n fn parse_cfg_with_fields() {\n\n let toml = Path::new(\"./config_test.toml\");\n\n let cfg_result = Cfg::load_config_file(toml);\n\n match cfg_result {\n\n Ok(cfg) => {\n\n assert_ne!(cfg.server.url.is_empty(), true);\n\n }\n\n Err(e) => panic!(\"Failed configuration parse: {:?}\", e)\n\n }\n\n }\n\n}\n","file_path":"src/config.rs","rank":53,"score":13.874343088960632},{"content":"use std::collections::HashMap;\n\n\n\nuse erased_serde::Serialize as ErasedSerialize;\n\nuse warp::http::StatusCode;\n\n\n\npub struct Response {\n\n value: Option<Box<dyn ErasedSerialize + Send>>,\n\n status_code: StatusCode,\n\n headers: HashMap<String, String>,\n\n}\n\n\n\npub struct ResponseBuilder {\n\n status_code: StatusCode,\n\n headers: HashMap<String, String>,\n\n}\n\n\n\nimpl Response {\n\n /// The response headers.\n\n pub fn headers(&self) -> &HashMap<String, String> {\n\n &self.headers\n","file_path":"src/payload.rs","rank":54,"score":12.715955155286817},{"content":" pub fault: &'a Fault,\n\n\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub title: Option<String>,\n\n\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub status: Option<u16>,\n\n\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub detail: Option<String>,\n\n}\n\n\n\nimpl<'a> From<&'a Fault> for ExceptionMsg<'a> {\n\n fn from(fault: &'a Fault) -> ExceptionMsg<'a> {\n\n use Fault::*;\n\n\n\n let status = Some(fault.to_status_code().as_u16());\n\n\n\n let (title, detail) = match fault {\n\n Static(_) => {\n","file_path":"src/exception.rs","rank":55,"score":11.306374427418392},{"content":" ReadCfgFile(#[fail(cause)] io::Error),\n\n\n\n #[fail(display = \"Invalid format for config file: {}\", _0)]\n\n InvalidCfgFile(#[fail(cause)]toml::de::Error),\n\n}\n\n\n\nimpl Cfg {\n\n /// Creates a new `Cfg` instance using the parameters found in the given\n\n /// TOML configuration file. If the file cannot be found or the file is\n\n /// invalid, an `Error` is returned.\n\n pub fn load_config_file(filename: &Path) -> Result<Cfg, CfgError> {\n\n let path = &filename;\n\n let cfg_file_str = read_to_string(path)\n\n .map_err(CfgError::ReadCfgFile)?;\n\n let cfg = toml::de::from_str(&cfg_file_str)\n\n .map_err(CfgError::InvalidCfgFile)?;\n\n\n\n Ok(cfg)\n\n }\n\n}\n","file_path":"src/config.rs","rank":56,"score":11.206408092539192},{"content":"pub enum TokenType {\n\n\t/// Normal token is valid for 60 minutes\n\n\tNormal,\n\n\t/// Refresh token is valid for 15 minutes\n\n\tRefresh,\n\n}\n\n\n\n/// From &str trait implementation\n\nimpl From<TokenType> for &'static str {\n\n\tfn from(original: TokenType) -> &'static str {\n\n\t\tuse self::TokenType::*;\n\n\n\n\t\tmatch original {\n\n\t\t\tNormal => \"Normal\",\n\n\t\t\tRefresh => \"Refresh\",\n\n\t\t}\n\n\t}\n\n}\n\n\n\n/// Convert From enum to static string. Allows the use of TokenType variant\n","file_path":"sentry/src/token.rs","rank":57,"score":10.590196212110305},{"content":" use warp::http::StatusCode;\n\n use Fault::*;\n\n\n\n match self {\n\n Static(StaticException::NotFound) => StatusCode::NOT_FOUND,\n\n Static(StaticException::InternalServerError) => {\n\n StatusCode::INTERNAL_SERVER_ERROR\n\n },\n\n RateLimit(_) => warp::http::StatusCode::TOO_MANY_REQUESTS,\n\n }\n\n }\n\n}\n\n\n\nimpl std::fmt::Display for Fault {\n\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\n\n let exception_msg: ExceptionMsg = self.into();\n\n\n\n // TODO: improve\n\n f.write_str(&format!(\"{:?}\", exception_msg))\n\n }\n","file_path":"src/exception.rs","rank":58,"score":8.70691488653247},{"content":"#![feature(try_trait)]\n\n#![cfg_attr(feature = \"alloc\", feature(alloc))]\n\nextern crate alloc;\n\n\n\n#[macro_use] extern crate failure;\n\n#[macro_use] pub mod macros;\n\n#[macro_use] extern crate magic_crypt;\n\n#[macro_use] extern crate serde_json;\n\n\n\npub mod error;\n\npub mod hash;\n\npub mod random;\n\npub mod token;\n","file_path":"sentry/src/lib.rs","rank":59,"score":8.543882762225778},{"content":"use std::{\n\n\tcollections::HashMap,\n\n\tconvert::TryFrom,\n\n\tio::Result as IoResult,\n\n};\n\n\n\nuse asap::{\n\n\tgenerator::Generator,\n\n\tvalidator::{Validator, ValidatorBuilder},\n\n\tclaims::{Aud, ExtraClaims},\n\n};\n\n\n\n#[cfg(feature = \"alloc\")]\n\nuse alloc;\n\nuse log;\n\nuse magic_crypt::MagicCrypt;\n\nuse once_cell::sync::OnceCell;\n\nuse serde::{Serialize, Deserialize};\n\nuse crate::error::Error;\n\n\n","file_path":"sentry/src/token.rs","rank":60,"score":8.142396153895353},{"content":"use std::error::Error as StdError;\n\nuse serde::{Deserialize, Serialize};\n\n\n\npub const INTERNAL_SERVER_ERROR: Fault = Fault::Static(StaticException::InternalServerError);\n\npub const NOT_FOUND: Fault = Fault::Static(StaticException::NotFound);\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\n#[serde(tag = \"type\")]\n\npub enum Fault {\n\n /// Static will handle exceptions related to the static server\n\n #[serde(rename = \"about:blank\")]\n\n Static(StaticException),\n\n /// RateLimit handles exceptions related to filter gated request behind a\n\n /// leaky bucket rate limiter\n\n #[serde(rename = \"/report/rate-limit\")]\n\n RateLimit(RateLimitException)\n\n}\n\n\n\nimpl Fault {\n\n pub fn to_status_code(&self) -> warp::http::StatusCode {\n","file_path":"src/exception.rs","rank":61,"score":7.1806187848756515},{"content":" }\n\n\n\n /// Build the payload response with the given value.\n\n pub fn body<T>(self, value: T) -> Response\n\n where\n\n T: ErasedSerialize + Send + 'static,\n\n {\n\n Response {\n\n value: Some(Box::new(value) as Box<dyn ErasedSerialize + Send>),\n\n status_code: self.status_code,\n\n headers: self.headers,\n\n }\n\n }\n\n\n\n /// Create a response with a 200 OK status code.\n\n pub fn ok() -> Self {\n\n Self::new(StatusCode::OK)\n\n }\n\n}\n","file_path":"src/payload.rs","rank":62,"score":6.947260827646809},{"content":" 'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'm', 'n', 'p', 'q', 'r', 't', 'v', 'w', 'x', 'y',\n\n 'B', 'C', 'D', 'F', 'G', 'H', 'J', 'K', 'M', 'N', 'P', 'Q', 'R', 'T', 'V', 'W', 'X', 'Y',\n\n '!', '@', '#', '$', '%', '&',\n\n];\n\n\n\n#[rustfmt::skip]\n\n/// A set of characters to generate random lowercase strings without ambiguous characters, and\n\n/// without vowels as to minimize the chance of generating bad words :)\n\n///\n\n/// also 0, o, 1, l, 2, z, 5, s are removed, as they look similar and can be confused.\n\n///\n\n/// Roughly 4.2 bits of entropy per character.\n\npub static RANDOM_UNAMBIGUOUS_LOWERCASE_CHARACTERS: &[char] = &[\n\n 'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'm', 'n', 'p', 'q', 'r', 't', 'v', 'w', 'x', 'y',\n\n];\n\n\n\n/// Generate a random string with N characters.\n","file_path":"sentry/src/random.rs","rank":63,"score":6.9112616696986215},{"content":"//! Configuration\n\nuse serde::Deserialize;\n\nuse failure::Fail;\n\nuse std::{\n\n fs::read_to_string,\n\n io,\n\n path::Path,\n\n};\n\nuse toml;\n\n\n\n#[derive(Clone, Deserialize)]\n\n// Global configuration structure\n\npub struct Cfg {\n\n /// Web server configuration\n\n pub server: ServerCfg,\n\n // /// Log mechanism configuration\n\n // pub log: LogCfg,\n\n /// Persistance storage configuration\n\n pub database: StorageCfg,\n\n}\n","file_path":"src/config.rs","rank":64,"score":6.884368015453821},{"content":"}\n\n\n\nimpl StdError for Fault {}\n\n\n\n/// Serde serializes an ExceptionMsg with its title field set to None and\n\n/// with its problem field to the Fault::Static variant, the title field in the\n\n/// generated serialization is taken from the StaticException variant.\n\n#[derive(Debug, Serialize, Deserialize)]\n\n#[serde(tag = \"title\")]\n\npub enum StaticException {\n\n #[serde(rename = \"Not Found\")]\n\n NotFound,\n\n\n\n #[serde(rename = \"Internal Server Error\")]\n\n InternalServerError,\n\n}\n\n\n\n#[derive(Debug, Serialize)]\n\npub struct ExceptionMsg<'a> {\n\n #[serde(flatten)]\n","file_path":"src/exception.rs","rank":65,"score":6.794951338886155},{"content":" }\n\n\n\n /// The response status code.\n\n pub fn status_code(&self) -> StatusCode {\n\n self.status_code\n\n }\n\n\n\n /// The response value.\n\n pub fn value(&self) -> &Option<Box<dyn ErasedSerialize + Send>> {\n\n &self.value\n\n }\n\n}\n\n\n\nimpl ResponseBuilder {\n\n /// Create a new payload response builder with the given status code.\n\n pub fn new(status_code: StatusCode) -> Self {\n\n ResponseBuilder {\n\n status_code,\n\n headers: HashMap::new(),\n\n }\n","file_path":"src/payload.rs","rank":66,"score":6.722818995502841},{"content":"// as `aud`.\n\n//\n\n// Assert MASTER_ASAP_KEY.get() is empty before initialzing thread_safe_key.\n\n// Sentry token uses the key in a Lazy sync non-copy type, similar to a\n\n// lazy_static! but without using any macro's.\n\n//\n\n// To validate tokens be sure to use a keyserver. Future developments will\n\n// include a custom async HTTP client with async/await.\n\n//\n\n// Reference: https://github.com/rustasync/surf\n\n\n\n/// Private key used to sign tokens.\n\nconst PKEY: &[u8] = include_bytes!(\"../support/keys/sessions01/1569901546-private.der\");\n\n/// Name of the issuer for the token generating service.\n\nconst ISS: &'static str = \"sessions\";\n\n/// client data used for audience_identifier obfuscation.\n\nconst AUD: &'static str = \"email@example.com\";\n\n/// Path of the public key. It will be consumed by a keyserver.\n\nconst KID: &'static str = \"sessions01/1569901546-public.der\";\n\n\n\n/// Token lifespans\n\nconst REFRESH_LIFESPAN: i64 = 15 * 60;\n\nconst NORMAL_LIFESPAN: i64 = 60 * 60;\n\n\n\n/// Master key will be consumed by the `aud` magic_crypt encrypt method\n\nstatic MASTER_ASAP_KEY: OnceCell<String> = OnceCell::new();\n\n\n\n/// A thread-safe cell which can be written to only once\n","file_path":"sentry/src/token.rs","rank":67,"score":6.07693672550786},{"content":"\n\n#[derive(Clone, Deserialize)]\n\n#[serde(rename_all = \"kebab-case\")]\n\n/// Server configuration key/values.\n\npub struct ServerCfg {\n\n /// The full server URL\n\n pub url: String,\n\n}\n\n\n\n#[derive(Clone, Deserialize)]\n\n#[serde(rename_all = \"kebab-case\")]\n\n/// Persistance storage configuration key/values.\n\npub struct StorageCfg {\n\n /// The full server URL\n\n pub url: String,\n\n}\n\n\n\n#[derive(Debug, Fail)]\n\npub enum CfgError {\n\n #[fail(display = \"Unable to read configuration file: {}\", _0)]\n","file_path":"src/config.rs","rank":68,"score":6.036680397516811},{"content":"#[rustfmt::skip]\n\n/// Alphanumeric characters (lowercase and upercase).\n\n/// Roughly 6 bits of entropy per character.\n\npub static RANDOM_CHARACTERS: &[char] = &[\n\n '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n\n 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',\n\n 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',\n\n 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n\n 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n\n];\n\n\n\n#[rustfmt::skip]\n\n/// A set of characters to generate random strings without ambiguous characters, and without\n\n/// vowels as to minimize the chance of generating bad words :)\n\n///\n\n/// also 0, o, 1, l, 2, z, 5, s are removed, as they look similar and can be confused.\n\n///\n\n/// Roughly 5.6 bits of entropy per character.\n\npub static RANDOM_UNAMBIGUOUS_CHARACTERS: &[char] = &[\n\n '3', '4', '6', '7', '8', '9',\n","file_path":"sentry/src/random.rs","rank":69,"score":6.030197194878488},{"content":"#[macro_use]\n\n#[cfg(feature = \"sentry\")] pub mod sentry;\n\n#[macro_use] extern crate failure;\n\n\n\nmod config;\n\nmod error;\n\nmod exception;\n\nmod payload;\n\nmod rate_limit;\n\nmod utils;\n\n\n\nuse std::env;\n\n\n\nuse chrono::Utc;\n\nuse dotenv::dotenv;\n\nuse femme::pretty::Logger;\n\nuse log;\n\nuse terminator::Terminator;\n\nuse warp::{Filter, path};\n\n\n","file_path":"src/main.rs","rank":70,"score":6.00852397152468},{"content":" (None, None)\n\n }\n\n\n\n RateLimit(_) => {\n\n (\n\n Some(\"Your request has been rate limited.\".to_owned()),\n\n None,\n\n )\n\n }\n\n };\n\n\n\n ExceptionMsg {\n\n fault,\n\n title,\n\n status,\n\n detail,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct RateLimitException {\n\n pub wait_time_millis: u64,\n\n}\n","file_path":"src/exception.rs","rank":71,"score":5.3449677311853545},{"content":" )\n\n )\n\n .unify(),\n\n )\n\n .and(warp::header(\"Accept\"))\n\n .map(|resp: payload::Response, _accept: String| {\n\n let mut http_resp_builder = warp::http::response::Builder::new();\n\n http_resp_builder.status(resp.status_code());\n\n http_resp_builder.header(\"Content-Type\", \"application/json\");\n\n\n\n for (header, value) in resp.headers() {\n\n http_resp_builder.header(header.as_bytes(), value.clone());\n\n }\n\n\n\n match resp.value() {\n\n Some(value) => http_resp_builder\n\n .body(serde_json::to_string(value).unwrap())\n\n .unwrap(),\n\n None => http_resp_builder.body(\"\".to_owned()).unwrap()\n\n }\n","file_path":"src/main.rs","rank":72,"score":5.234460113076372},{"content":"use std::env;\n\n\n\nuse diesel::pg::PgConnection;\n\nuse diesel::r2d2::{ConnectionManager, Pool, PooledConnection};\n\nuse futures::future::{self, Future};\n\nuse serde_json;\n\nuse warp::{Filter, Reply, Rejection};\n\n\n\nuse crate::exception::{self, INTERNAL_SERVER_ERROR};\n\n\n","file_path":"src/utils.rs","rank":73,"score":4.929317967003682},{"content":"// Info: Use .der format for PEM key encryption\n\n//\n\n// Steps to use ASAP API\n\n//\n\n// get_validator() method builds a `Resource_Server` which will fetch `KID`,\n\n// verify claims and signature.\n\n//\n\n// See [Validator, ValidatorBuilder] ASAP trait definition for more info.\n\n//\n\n// You'll need to setup environment variables for the validator and the generator.\n\n// The generator holds the header which is RS256 algorithm, private key, claims\n\n// and extra-claims.\n\n//\n\n// Set the \"aud\" claim identifier to access token generation. The issuer\n\n// and the resource server have to mutually agree on this identifier. The\n\n// details of how they reach agreement is not covered in the [Atlassian S2S Auth\n\n// protocol specification](https://s2sauth.bitbucket.io/spec/)\n\n//\n\n// As the aud consensus is open for implementation; Sentry token implements a\n\n// 256-bit DES encrypted client identifier, which converts client data string\n","file_path":"sentry/src/token.rs","rank":74,"score":4.8828270335948565},{"content":"/// validates ParseError Eq implementation\n\nmacro_rules! validate {\n\n\t($cond:expr, $e:expr) => {\n\n\t\tif !($cond) {\n\n\t\t\treturn Err($e);\n\n\t\t}\n\n\t};\n\n\t($cond:expr, $fmt:expr, $($arg:tt)+) => {\n\n\t\tif !($cond) {\n\n\t\t\treturn Err($fmt, $($arg)+);\n\n\t\t}\n\n\t};\n\n}\n","file_path":"sentry/src/macros.rs","rank":75,"score":4.618271454790224},{"content":" warp::reply::with_status(\n\n serde_json::to_string(&static_exception).unwrap(),\n\n fault.to_status_code(),\n\n )\n\n };\n\n\n\n Ok(warp::reply::with_header(\n\n reply,\n\n \"Content-Type\",\n\n \"application/fault+json\",\n\n )\n\n )\n\n}\n","file_path":"src/utils.rs","rank":76,"score":3.998761427236764},{"content":"use crate::exception::{Fault, RateLimitException};\n\nuse ratelimit_meter::{algorithms::NonConformance, KeyedRateLimiter};\n\nuse std::net::SocketAddr;\n\nuse std::sync::{Arc, Mutex};\n\nuse std::time::Instant;\n\nuse warp::{Filter, Rejection};\n\n\n\n/// Create a filter that gates a request behind a leaky bucket rate limiter.\n\n///\n\n/// # Panics\n\n/// Panics if it is used with a transport not using socket addresses.\n","file_path":"src/rate_limit.rs","rank":77,"score":3.2299858915747164},{"content":"use crate::config::Cfg;\n\nuse diesel::pg::PgConnection;\n\nuse diesel::r2d2::{ConnectionManager, Pool, PooledConnection};\n\n\n","file_path":"src/persistance.rs","rank":78,"score":3.127191095178742},{"content":" })\n\n .recover(utils::handle_rejection)\n\n .with(warp::log(\"oxide::api\"));\n\n\n\n\n\n warp::serve(bundle_oxide)\n\n .run(\n\n // localhost\n\n ([127, 0, 0, 1], 8080)\n\n );\n\n\n\n Ok(())\n\n}\n","file_path":"src/main.rs","rank":79,"score":2.339485035181271},{"content":"Oxide\n\n=====\n\nRust microservice application. Currently 'Sentry', the backend of Oxide is\n\nunder development. Oxide will likely be built using an async framework.\n","file_path":"README.md","rank":80,"score":2.1736978614675264},{"content":"Sentry\n\n======\n\nSentry is the backend for oxide. It includes the following components:\n\n\n\n* Token generator, adherance to [Atlassian S2S Auth Spec](https://s2sauth.bitbucket.io/spec)\n\n* Token validator through async Tokio server\n\n* Password hashing\n\n* Collision free unique identifier generator.\n\n\n\n##Build requirement\n\n* Initialize PEM private and public keys in DER format.\n\n\n\n```\n\n# Run shell script for directory and key scaffold.\n\n$ sh gen-keys.sh\n\n```\n\n\n\n* Store `MASTER_ASAP_KEY` in ./warden.key file recommended 256-bit minimum.\n\n\n\n* Store `SECRET_KEY` in ../sentry.env file, recommend 128-bit minimum.\n\n\n\n## License\n\nThis library is licensed under Apache License, Version 2.0, (LICENSE-APACHE or\n\nhttp://www.apache.org/licenses/LICENSE-2.0)\n","file_path":"sentry/README.md","rank":81,"score":1.9920341855358101}],"string":"[\n {\n \"content\": \"/// decrypt_aud() takes in AES 256-bit base64 encoded string and decrypts it.\\n\\npub fn decrypt_aud(audience_identifier: &str) -> Result<String, Error> {\\n\\n\\tlet key: Option<&String> = MASTER_ASAP_KEY.get();\\n\\n\\tlet mut secret: MagicCrypt = new_magic_crypt!(key.unwrap().as_str(), 256);\\n\\n\\tlet raw = secret.decrypt_base64_to_string(audience_identifier).unwrap();\\n\\n\\tOk(raw)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 1,\n \"score\": 154617.20512044494\n },\n {\n \"content\": \"/// Encrypts the client_data to AES 256-bit, encoded as base64.\\n\\npub fn encrypt_aud_to_base64(client_data: &str) -> String {\\n\\n\\tlet key: Option<&String> = MASTER_ASAP_KEY.get();\\n\\n\\tlet mut secret: MagicCrypt = new_magic_crypt!(key.unwrap().as_str(), 256);\\n\\n\\tlet aud_claims = secret.encrypt_str_to_base64(client_data);\\n\\n\\tlog::info!(\\\"encrpted aud claims field: {}\\\", aud_claims);\\n\\n\\n\\n\\taud_claims.to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 2,\n \"score\": 150213.03615443743\n },\n {\n \"content\": \"/// Generate a random string.\\n\\npub fn string(length: usize) -> String {\\n\\n random_string_with_characters(length, RANDOM_CHARACTERS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 4,\n \"score\": 136998.940926843\n },\n {\n \"content\": \"/// Generate a random string without ambiguous characters.\\n\\npub fn unambiguous_string(length: usize) -> String {\\n\\n random_string_with_characters(length, RANDOM_UNAMBIGUOUS_CHARACTERS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 6,\n \"score\": 128095.9164735211\n },\n {\n \"content\": \"/// Generate a random, lowercase string without ambiguous characters.\\n\\npub fn unambiguous_lowercase_string(length: usize) -> String {\\n\\n random_string_with_characters(length, RANDOM_UNAMBIGUOUS_LOWERCASE_CHARACTERS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 7,\n \"score\": 125242.8729263022\n },\n {\n \"content\": \"/// Generates a 256-bit random byte array.\\n\\npub fn generate_random_byte_array() -> [u8; 32] {\\n\\n use rand::Rng;\\n\\n\\n\\n const SIZE : usize = 32;\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n let mut rand_array = [0u8; SIZE];\\n\\n rng.try_fill(&mut rand_array[..]).expect(\\\"Failed to fill random bytes\\\");\\n\\n\\n\\n rand_array\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 9,\n \"score\": 124006.73237934863\n },\n {\n \"content\": \"/// Runs a function on a threadpool, ignoring a potential Diesel error inside the threadpool.\\n\\n/// This error is turned into an internal server error (as Diesel errors are unexpected, and\\n\\n/// indicative of erroneous queries).\\n\\npub fn threadpool_diesel_ok<F, T>(f: F) -> impl Future<Item = T, Error = Rejection>\\n\\nwhere\\n\\nF: FnOnce() -> Result<T, diesel::result::Error>,\\n\\n{\\n\\n threadpool(f).and_then(|result| match result {\\n\\n Ok(v) => future::ok(v),\\n\\n Err(_) => future::err(warp::reject::custom(INTERNAL_SERVER_ERROR)),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 10,\n \"score\": 120655.96375079898\n },\n {\n \"content\": \"/// Create a filter that gates a request behind a leaky bucket rate limiter.\\n\\n///\\n\\n/// # Panics\\n\\n/// Panics if it is used with a transport not using socket addresses.\\n\\npub fn leaky_bucket() -> impl Filter<Extract = (), Error = Rejection> + Clone {\\n\\n let limiter = Arc::new(Mutex::new(KeyedRateLimiter::<SocketAddr>::new(\\n\\n std::num::NonZeroU32::new(2u32).unwrap(),\\n\\n std::time::Duration::from_secs(1),\\n\\n )));\\n\\n\\n\\n warp::addr::remote()\\n\\n .and_then(move |addr: Option<SocketAddr>| {\\n\\n let addr = addr\\n\\n .expect(\\n\\n \\\"Must be used with a transport utilizing socket addresses.\\\"\\n\\n );\\n\\n let mut limiter = limiter.lock().unwrap();\\n\\n match limiter.check(addr) {\\n\\n Ok(_) => Ok(()),\\n\\n Err(neg) => Err(\\n\\n warp::reject::custom(Fault::RateLimit(RateLimitException {\\n\\n wait_time_millis: neg\\n\\n .wait_time_from(Instant::now())\\n\\n .as_millis() as u64,\\n\\n }))),\\n\\n }\\n\\n })\\n\\n .untuple_one()\\n\\n}\\n\",\n \"file_path\": \"src/rate_limit.rs\",\n \"rank\": 11,\n \"score\": 119844.22676062942\n },\n {\n \"content\": \"/// Generate a random string with N characters.\\n\\npub fn random_string_with_characters(length: usize, characters: &[char]) -> String {\\n\\n use rand::Rng;\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n let distribution = rand::distributions::Uniform::new(0, characters.len());\\n\\n\\n\\n let mut string = String::with_capacity(length);\\n\\n for _ in 0..length {\\n\\n let idx = rng.sample(distribution);\\n\\n string.push(characters[idx])\\n\\n }\\n\\n\\n\\n string\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 12,\n \"score\": 115267.61149582316\n },\n {\n \"content\": \"/// Generate a password.\\n\\npub fn password() -> String {\\n\\n const PASSWORD_LENGTH: usize = 24;\\n\\n unambiguous_string(PASSWORD_LENGTH)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test_collisions {\\n\\n use super::*;\\n\\n use std::collections::HashMap;\\n\\n\\n\\n #[test]\\n\\n fn no_collisions () {\\n\\n let count = 1_000_000;\\n\\n let mut ids = HashMap::new();\\n\\n\\n\\n for _ in 0..count {\\n\\n let id = string(20);\\n\\n\\n\\n if ids.contains_key(&id) {\\n\\n panic!(\\\"collision detected\\\");\\n\\n }\\n\\n\\n\\n ids.insert(id, true);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 13,\n \"score\": 114372.87802479483\n },\n {\n \"content\": \"/// Run a function on a threadpool, returning a future resolving when the\\n\\n/// function completes. Any (unexpected!) threadpool error is turned into a\\n\\n/// Warp rejection, wrapping the Internal Server Error problem.\\n\\npub fn threadpool<F, T>(f: F) -> impl Future<Item = T, Error = Rejection>\\n\\nwhere\\n\\nF: FnOnce() -> T,\\n\\n{\\n\\n fut_threadpool(f).map_err(|_| warp::reject::custom(INTERNAL_SERVER_ERROR))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 14,\n \"score\": 108609.37723972036\n },\n {\n \"content\": \"/// Run a function on a threadpool, returning a future resolving when the function completes.\\n\\npub fn fut_threadpool<F, T>(f: F) -> impl Future<Item = T, Error = tokio_threadpool::BlockingError>\\n\\nwhere\\n\\nF: FnOnce() -> T,\\n\\n{\\n\\n let mut f_only_once = Some(f);\\n\\n futures::future::poll_fn(move || {\\n\\n tokio_threadpool::blocking(|| {\\n\\n let f = f_only_once.take().unwrap();\\n\\n f()\\n\\n })\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 15,\n \"score\": 106196.39439829587\n },\n {\n \"content\": \"/// get_validator() is a constructor method for ValidatorBuilder.\\n\\n/// Incoming ASAP tokens must include resource server audience identifier in\\n\\n/// their `aud` claim in order for a token to be valid.\\n\\npub fn get_validator(keyserver_uri: &str) -> ValidatorBuilder {\\n\\n\\tlet audience_identifier = encrypt_aud_to_base64(AUD);\\n\\n\\tlet resource_server_audience = String::from(audience_identifier);\\n\\n\\tValidator::builder(String::from(keyserver_uri), resource_server_audience)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 17,\n \"score\": 96764.95094672921\n },\n {\n \"content\": \"/// generate_token() takes in client_data which will be used in the 'aud'\\n\\n/// claims, and TokenType variont of 'Normal' or 'Refresh'. The method\\n\\n/// returns an ASAP token with extra claims.\\n\\n///\\n\\n/// The token will have different lifespans depending on the TokenType variant.\\n\\npub fn generate_token(token_type: TokenType, client_data: &str)\\n\\n\\t-> Result<String, Error>\\n\\n{\\n\\n\\tlet mut generator = generator_build();\\n\\n\\tmatch token_type {\\n\\n\\t\\tTokenType::Normal => {\\n\\n\\t\\t\\tlet _ = generator.set_max_lifespan(NORMAL_LIFESPAN);\\n\\n\\t\\t\\tlet normal_token = generator\\n\\n\\t\\t\\t\\t.token(\\n\\n\\t\\t\\t\\t\\tdefault_aud(client_data),\\n\\n\\t\\t\\t\\t\\tset_token_type(TokenType::Normal)\\n\\n\\t\\t\\t\\t)?;\\n\\n\\t\\t\\tOk(normal_token)\\n\\n\\t\\t},\\n\\n\\t\\tTokenType::Refresh => {\\n\\n\\t\\t\\tlet _ = generator.set_max_lifespan(REFRESH_LIFESPAN);\\n\\n\\t\\t\\tlet refresh_token = generator\\n\\n\\t\\t\\t\\t.token(\\n\\n\\t\\t\\t\\t\\tdefault_aud(client_data),\\n\\n\\t\\t\\t\\t\\tset_token_type(TokenType::Refresh)\\n\\n\\t\\t\\t\\t)?;\\n\\n\\t\\t\\tOk(refresh_token)\\n\\n\\t\\t},\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 18,\n \"score\": 90651.5061206384\n },\n {\n \"content\": \"/// Convert rejections into replies.\\n\\npub fn handle_rejection(rejection: Rejection) -> Result<impl Reply, Rejection> {\\n\\n use crate::exception::{ExceptionMsg, Fault};\\n\\n\\n\\n let reply = if let Some(fault) = rejection.find_cause::<Fault>() {\\n\\n // This rejection originated in this implementation.\\n\\n let static_exception = ExceptionMsg::from(fault);\\n\\n\\n\\n warp::reply::with_status(\\n\\n serde_json::to_string(&static_exception).unwrap(),\\n\\n fault.to_status_code(),\\n\\n )\\n\\n } else {\\n\\n // This rejection originated in Warp.\\n\\n let fault = if rejection.is_not_found() {\\n\\n exception::NOT_FOUND\\n\\n } else {\\n\\n exception::INTERNAL_SERVER_ERROR\\n\\n };\\n\\n let static_exception = ExceptionMsg::from(&fault);\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 19,\n \"score\": 90383.79073001172\n },\n {\n \"content\": \"/// aud_from_json() extracts the inner member of Aud enum variant.\\n\\n/// Its purpose is to get the `aud` variant from a token payload.\\n\\n///\\n\\n/// This method is credited to @Sébastien Renauld, over at StackOverflow.\\n\\n/// Thank you for your help and patience.\\n\\npub fn aud_from_json(data: &asap::claims::Aud) -> IoResult<String> {\\n\\n\\tmatch data {\\n\\n\\t\\tAud::One(audience) => Ok(audience.clone()),\\n\\n\\t\\tAud::Many(audiences) => audiences\\n\\n\\t\\t\\t.last()\\n\\n\\t\\t\\t.ok_or(\\n\\n\\t\\t\\t\\tstd::io::Error::new(\\n\\n\\t\\t\\t\\t\\tstd::io::ErrorKind::NotFound, \\\"No audience found\\\")\\n\\n\\t\\t\\t).map(|r| r.clone())\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 20,\n \"score\": 86159.70045457888\n },\n {\n \"content\": \"/// Create a filter to get a PostgreSQL connection from a PostgreSQL connection pool.\\n\\npub fn pg(\\n\\n pg_pool: crate::utils::PgPool,\\n\\n ) -> impl Filter<Extract = (crate::utils::PgPooled,),\\n\\n Error = Rejection> + Clone {\\n\\n warp::any()\\n\\n .map(move || pg_pool.clone())\\n\\n .and_then(|pg_pool: crate::utils::PgPool| match pg_pool.get() {\\n\\n Ok(pg_pooled) => Ok(pg_pooled),\\n\\n Err(_) => Err(warp::reject::custom(INTERNAL_SERVER_ERROR)),\\n\\n })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 21,\n \"score\": 79519.87857440436\n },\n {\n \"content\": \"/// A thread-safe cell which can be written to only once\\n\\npub fn init_thread_safe_key() {\\n\\n\\tstd::thread::spawn(|| {\\n\\n\\t\\tlet _value: String = MASTER_ASAP_KEY.get_or_init(|| {\\n\\n\\t\\t\\tlet file_path = std::env::var(\\\"MASTER_ASAP_KEY\\\")\\n\\n\\t\\t\\t\\t.unwrap_or(\\\"./warden.key\\\".to_owned());\\n\\n\\n\\n\\t\\t\\tlog::debug!(\\\"Using `aud` obfuscator file {}\\\", file_path);\\n\\n\\n\\n\\t\\t\\tlet aud_key: Vec<u8> = std::fs::read(&file_path).unwrap();\\n\\n\\n\\n\\t\\t\\tlog::debug!( \\\"Using `aud` signer key of {} bits\\\", aud_key.len() * 8);\\n\\n\\n\\n\\t\\t\\tstd::str::from_utf8(aud_key.as_slice()).unwrap().to_string()\\n\\n\\n\\n\\t\\t}).to_owned();\\n\\n\\t}).join().ok().expect(\\\"Could not join a thread\\\");\\n\\n}\\n\\n\\n\\n/// TokenType enumerates the type of Token: [Normal or Refresh]\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 22,\n \"score\": 72020.15722502998\n },\n {\n \"content\": \"/// pg_pool handles the PostgreSQL connection thread pool.\\n\\npub fn pg_pool() -> PgPool {\\n\\n let db_url = env::var(\\\"DATABASE_URL\\\").expect(\\\"DATABASE_URL must be set\\\");\\n\\n let manager = ConnectionManager::<PgConnection>::new(db_url);\\n\\n let pool = Pool::new(manager)\\n\\n .expect(\\\"PostgreSQL connection pool could not be created\\\");\\n\\n log::info!(\\\"initiated postgresSQL thread connection pool\\\");\\n\\n\\n\\n pool\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 23,\n \"score\": 71313.7838399105\n },\n {\n \"content\": \"/// Converts client_data to audience server identifier for generator consumption\\n\\nfn default_aud(client_data: &str) -> Aud {\\n\\n\\tlet audience_identifier = Aud::One(encrypt_aud_to_base64(client_data));\\n\\n\\taudience_identifier\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 24,\n \"score\": 69762.76747409411\n },\n {\n \"content\": \"/// Generator builder for ASAP Claims.\\n\\nfn generator_build() -> Generator {\\n\\n\\tGenerator::new(\\n\\n\\t\\tISS.to_string(),\\n\\n\\t\\tKID.to_string(),\\n\\n\\t\\tPKEY.to_vec(),\\n\\n\\t\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 25,\n \"score\": 36634.38402261989\n },\n {\n \"content\": \"fn pg_pool() -> PgPool {\\n\\n let manager =\\n\\n ConnectionManager::<PgConnection>::new(\\\"postgres://ag@localhost/oxide\\\");\\n\\n}\\n\",\n \"file_path\": \"src/persistance.rs\",\n \"rank\": 26,\n \"score\": 36634.38402261989\n },\n {\n \"content\": \"fn main() -> Result<(), Terminator> {\\n\\n dotenv().ok();\\n\\n Logger::new().start(log::LevelFilter::Info)?;\\n\\n log::info!(\\\"log mechanism initialized...\\\");\\n\\n\\n\\n let db_pool = utils::pg_pool();\\n\\n let _db = utils::pg(db_pool);\\n\\n\\n\\n let rate_limiter = rate_limit::leaky_bucket();\\n\\n\\n\\n let bundle_oxide = rate_limiter\\n\\n .and(\\n\\n warp::path!(\\\"version\\\")\\n\\n .map(|| payload::ResponseBuilder::ok()\\n\\n .body(env!(\\\"CARGO_PKG_VERSION\\\")\\n\\n )\\n\\n )\\n\\n .or(path!(\\\"time\\\")\\n\\n .map(|| payload::ResponseBuilder::ok()\\n\\n .body(Utc::now().to_rfc3339())\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 27,\n \"score\": 36491.09147709531\n },\n {\n \"content\": \"/// type_of_token() is a helper method to include ExtraClaims hashMap of TokenType.\\n\\n///\\n\\n/// ASAP tokens have a hard limit of 3600 as their lifespan. This limitation\\n\\n/// puts a halt on a new generator implementation, which intended on\\n\\n/// overriding the 'exp' field and setting an ExtraClaim of TokenType.\\n\\nfn set_token_type(token_type: TokenType) -> Option<ExtraClaims> {\\n\\n\\tlet normal = TokenType::Normal;\\n\\n\\tlet refresh = TokenType::Refresh;\\n\\n\\n\\n\\tlet mut extra_claims = HashMap::new();\\n\\n\\tmatch token_type {\\n\\n\\t\\tTokenType::Normal => {\\n\\n\\t\\t\\textra_claims.insert(\\\"TokenType\\\".to_string(), json!(\\n\\n\\t\\t\\t\\t\\tInto::<&str>::into(normal)));\\n\\n\\t\\t},\\n\\n\\n\\n\\t\\tTokenType::Refresh => {\\n\\n\\t\\t\\textra_claims.insert(\\\"TokenType\\\".to_string(), json!(\\n\\n\\t\\t\\t\\t\\tInto::<&str>::into(refresh)));\\n\\n\\t\\t},\\n\\n\\t}\\n\\n\\tSome(extra_claims)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 28,\n \"score\": 28787.971956842695\n },\n {\n \"content\": \"\\n\\nimpl Fail for Error {\\n\\n fn cause(&self) -> Option<&dyn Fail> {\\n\\n self.inner.cause()\\n\\n }\\n\\n\\n\\n fn backtrace(&self) -> Option<&Backtrace> {\\n\\n self.inner.backtrace()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for Error {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n Display::fmt(&self.inner, f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Error {\\n\\n pub fn kind(&self) -> ErrorKind {\\n\\n *self.inner.get_context()\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 29,\n \"score\": 25963.84096793664\n },\n {\n \"content\": \"use failure::{Fail, Context, Backtrace};\\n\\nuse failure::Error as FailureError;\\n\\n\\n\\nuse std::fmt::{self, Display};\\n\\n\\n\\n/// convenience alias wrapper Result.\\n\\npub type Result<T> = ::std::result::Result<T, Error>;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, Fail)]\\n\\npub enum ErrorKind {\\n\\n #[fail(display=\\\"From Failure\\\")]\\n\\n FromFailure,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct Error {\\n\\n /// Inner `Context` with the `Fail` implementor.\\n\\n inner: Context<ErrorKind>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 30,\n \"score\": 25962.71730022315\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl From<ErrorKind> for Error {\\n\\n fn from(kind: ErrorKind) -> Error {\\n\\n Error { inner: Context::new(kind) }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Context<ErrorKind>> for Error {\\n\\n fn from(inner: Context<ErrorKind>) -> Error {\\n\\n Error { inner: inner }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<FailureError> for Error {\\n\\n fn from(e: FailureError) -> Error {\\n\\n Error { inner: e.context(ErrorKind::FromFailure) }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 31,\n \"score\": 25961.183454486138\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// ParseError handles the parse validation errors for HashVersion V1.\\n\\n#[derive(Debug)]\\n\\npub enum ParseError {\\n\\n\\t/// base64 decode error\\n\\n\\tDecodeError(base64::DecodeError),\\n\\n\\t/// Utf-8 string error\\n\\n\\tUtf8(std::str::Utf8Error),\\n\\n\\t/// vector length validator\\n\\n\\tInvalidVecLen,\\n\\n\\t/// slice validation\\n\\n\\tInvalidSlice,\\n\\n\\t/// byte size validation can occur in `salt` or `hash` types of V1Hash\\n\\n\\tInvalidLen,\\n\\n}\\n\\n\\n\\nimpl Display for ParseError {\\n\\n\\tfn fmt(&self, fmt: &mut Formatter) -> FmtResult {\\n\\n\\t\\tmatch &*self {\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 39,\n \"score\": 24657.21105691059\n },\n {\n \"content\": \"\\t#[fail(display = \\\"{}\\\", _0)]\\n\\n\\tMsg(String),\\n\\n\\n\\n\\t#[fail(display = \\\"Base64 encode error\\\")]\\n\\n\\tEnvVarEncoder(argonautica::Error),\\n\\n\\n\\n\\t#[fail(display = \\\"Failure error\\\")]\\n\\n\\tFromFailure,\\n\\n\\n\\n\\t#[fail(display = \\\"I/O error\\\")]\\n\\n\\tIO,\\n\\n\\n\\n\\t#[fail(display = \\\"Hash error\\\")]\\n\\n\\tHasher,\\n\\n\\n\\n\\t#[fail(display = \\\"Invalid Vector length: got {}, expected {}\\\", got, expected)]\\n\\n\\tVecLength { got: usize, expected: usize },\\n\\n}\\n\\n\\n\\n/// Sentry application error.\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 40,\n \"score\": 24655.27158296153\n },\n {\n \"content\": \"use std::{\\n\\n\\tenv,\\n\\n\\tfmt::{Display, Formatter, Result as FmtResult},\\n\\n};\\n\\nuse failure::{Backtrace, Context, Fail};\\n\\n\\n\\n/// convenience alias wrapper Result.\\n\\npub type Result<T> = ::std::result::Result<T, Error>;\\n\\n\\n\\n/// Sentry package error kind.\\n\\n#[derive(Debug, Fail)]\\n\\npub enum ErrorKind {\\n\\n\\t#[fail(display = \\\"Hasher config error\\\")]\\n\\n\\tHashConfigError(argonautica::Error),\\n\\n\\n\\n\\t/// An error with an arbitrary message, referenced as &'static str\\n\\n\\t#[fail(display = \\\"{}\\\", _0)]\\n\\n\\tMessage(&'static str),\\n\\n\\n\\n\\t/// An error with an arbitrary message, stored as String\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 41,\n \"score\": 24652.490199653017\n },\n {\n \"content\": \"impl<E: Into<ErrorKind>> From<E> for Error {\\n\\n\\tfn from(err: E) -> Error {\\n\\n\\t\\tContext::new(err.into()).into()\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<Context<ErrorKind>> for Error {\\n\\n\\tfn from(inner: Context<ErrorKind>) -> Error {\\n\\n\\t\\tError { inner: inner }\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<&'static str> for Error {\\n\\n\\tfn from(msg: &'static str) -> Error {\\n\\n\\t\\tErrorKind::Message(msg).into()\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<String> for Error {\\n\\n\\tfn from(msg: String) -> Error {\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 42,\n \"score\": 24651.906402082106\n },\n {\n \"content\": \"\\t\\tErrorKind::Msg(msg).into()\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<failure::Error> for Error {\\n\\n\\tfn from(err: failure::Error) -> Error {\\n\\n\\t\\tError { inner: err.context(ErrorKind::FromFailure) }\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<::std::io::Error> for Error {\\n\\n\\tfn from(err: ::std::io::Error) -> Error {\\n\\n\\t\\tError { inner: err.context(ErrorKind::IO) }\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<argonautica::Error> for Error {\\n\\n\\tfn from(err: argonautica::Error) -> Error {\\n\\n\\t\\tError { inner: err.context(ErrorKind::Hasher) }\\n\\n\\t}\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 43,\n \"score\": 24651.72849101906\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Fail for Error {\\n\\n\\tfn cause(&self) -> Option<&dyn Fail> {\\n\\n\\t\\tself.inner.cause()\\n\\n\\t}\\n\\n\\n\\n\\tfn backtrace(&self) -> Option<&Backtrace> {\\n\\n\\t\\tself.inner.backtrace()\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl Display for Error {\\n\\n\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\\n\\t\\tlet show_trace = match env::var(\\\"RUST_BACKTRACE\\\") {\\n\\n\\t\\t\\tOk(r) => {\\n\\n\\t\\t\\t\\tif r == \\\"1\\\" {\\n\\n\\t\\t\\t\\t\\ttrue\\n\\n\\t\\t\\t\\t} else {\\n\\n\\t\\t\\t\\t\\tfalse\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 44,\n \"score\": 24649.153556223213\n },\n {\n \"content\": \"\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tErr(_) => false,\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tlet backtrace = match self.backtrace() {\\n\\n\\t\\t\\tSome(b) => format!(\\\"{}\\\", b),\\n\\n\\t\\t\\tNone => String::from(\\\"Unknown\\\"),\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tlet trace_fmt = format!(\\\"\\\\nBacktrace: {:?}\\\", backtrace);\\n\\n\\t\\tlet inner_fmt = format!(\\\"{}\\\", self.inner);\\n\\n\\t\\tlet mut print_format = inner_fmt.clone();\\n\\n\\t\\tif show_trace {\\n\\n\\t\\t\\tprint_format.push_str(&trace_fmt);\\n\\n\\t\\t}\\n\\n\\t\\tDisplay::fmt(&print_format, f)\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 45,\n \"score\": 24648.904358052965\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\npub struct Error {\\n\\n\\tinner: Context<ErrorKind>,\\n\\n}\\n\\n\\n\\nimpl Error {\\n\\n\\t/// Returns the error variant and contents.\\n\\n\\tpub fn kind(&self) -> &ErrorKind {\\n\\n\\t\\tself.inner.get_context()\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns the immediate cause of error (e.g. the next error in the chain)\\n\\n\\tpub fn cause(&self) -> Option<&dyn Fail> {\\n\\n\\t\\tself.inner.cause()\\n\\n\\t}\\n\\n\\n\\n\\tpub fn backtrace(&self) -> Option<&Backtrace> {\\n\\n\\t\\tself.inner.backtrace()\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 46,\n \"score\": 24648.891517681484\n },\n {\n \"content\": \"\\t\\t\\tParseError::DecodeError(e) => write!(fmt, \\\"Decode error: {}\\\", e),\\n\\n\\t\\t\\tParseError::InvalidVecLen => write!(fmt, \\\"Invalid vector\\\"),\\n\\n\\t\\t\\tParseError::InvalidSlice => write!(fmt, \\\"Invalid Slice\\\"),\\n\\n\\t\\t\\tParseError::InvalidLen => write!(fmt, \\\"Invalid byte size\\\"),\\n\\n\\t\\t\\tParseError::Utf8(e) => write!(fmt, \\\"Utf-8 error: {}\\\", e),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl PartialEq for ParseError {\\n\\n\\tfn eq(&self, other: &Self) -> bool {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tParseError::InvalidVecLen => match other {\\n\\n\\t\\t\\t\\tParseError::InvalidVecLen => true,\\n\\n\\t\\t\\t\\t_ => false,\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\tParseError::InvalidSlice => match other {\\n\\n\\t\\t\\t\\tParseError::InvalidSlice => true,\\n\\n\\t\\t\\t\\t_ => false,\\n\\n\\t\\t\\t},\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 47,\n \"score\": 24647.69441810676\n },\n {\n \"content\": \"\\t\\t\\tParseError::InvalidLen => match other {\\n\\n\\t\\t\\t\\tParseError::InvalidLen => true,\\n\\n\\t\\t\\t\\t_ => false,\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\tParseError::DecodeError(_) => false,\\n\\n\\t\\t\\tParseError::Utf8(_) => false,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl From<base64::DecodeError> for ParseError {\\n\\n\\tfn from(err: base64::DecodeError) -> ParseError {\\n\\n\\t\\tParseError::DecodeError(err)\\n\\n\\t}\\n\\n}\\n\\n\\n\\n// #[macro_export]\\n\\n// /// validates ParseError Eq implementation\\n\\n// macro_rules! validate {\\n\\n//\\t($cond:expr, $e:expr) => {\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 48,\n \"score\": 24647.243792028858\n },\n {\n \"content\": \"//\\t\\tif !($cond) {\\n\\n//\\t\\t\\treturn Err($e);\\n\\n//\\t\\t}\\n\\n//\\t};\\n\\n//\\t($cond:expr, $fmt:expr, $($arg:tt)+) => {\\n\\n//\\t\\tif !($cond) {\\n\\n//\\t\\t\\treturn Err($fmt, $($arg)+);\\n\\n//\\t\\t}\\n\\n//\\t};\\n\\n// }\\n\",\n \"file_path\": \"sentry/src/error.rs\",\n \"rank\": 49,\n \"score\": 24642.171574922166\n },\n {\n \"content\": \"CREATE OR REPLACE FUNCTION diesel_set_updated_at() RETURNS trigger AS $$\\n\\nBEGIN\\n\\n IF (\\n\\n NEW IS DISTINCT FROM OLD AND\\n\\n NEW.updated_at IS NOT DISTINCT FROM OLD.updated_at\\n\\n ) THEN\\n\\n NEW.updated_at := current_timestamp;\\n\\n END IF;\\n\\n RETURN NEW;\\n\\nEND;\\n\\n$$ LANGUAGE plpgsql;\\n\",\n \"file_path\": \"migrations/00000000000000_diesel_initial_setup/up.sql\",\n \"rank\": 50,\n \"score\": 18481.853927055785\n },\n {\n \"content\": \"-- Sets up a trigger for the given table to automatically set a column called\\n\\n-- `updated_at` whenever the row is modified (unless `updated_at` was included\\n\\n-- in the modified columns)\\n\\n--\\n\\n-- # Example\\n\\n--\\n\\n-- ```sql\\n\\n-- CREATE TABLE users (id SERIAL PRIMARY KEY, updated_at TIMESTAMP NOT NULL DEFAULT NOW());\\n\\n--\\n\\n-- SELECT diesel_manage_updated_at('users');\\n\\n-- ```\\n\\nCREATE OR REPLACE FUNCTION diesel_manage_updated_at(_tbl regclass) RETURNS VOID AS $$\\n\\nBEGIN\\n\\n EXECUTE format('CREATE TRIGGER set_updated_at BEFORE UPDATE ON %s\\n\\n FOR EACH ROW EXECUTE PROCEDURE diesel_set_updated_at()', _tbl);\\n\\nEND;\\n\\n$$ LANGUAGE plpgsql;\\n\\n\\n\",\n \"file_path\": \"migrations/00000000000000_diesel_initial_setup/up.sql\",\n \"rank\": 51,\n \"score\": 17238.290139367724\n },\n {\n \"content\": \"/// debug as such:\\n\\n///\\n\\n/// i.e.\\n\\n/// println!(\\\"{}\\\", Into::<&str>::into(TokenType::Refresh));\\n\\n///\\n\\n/// $ Refresh\\n\\nimpl <'a> TryFrom<&'a str> for TokenType {\\n\\n\\ttype Error = &'a str;\\n\\n\\tfn try_from(value: &'a str) -> Result<Self, &'a str> {\\n\\n\\t\\tuse self::TokenType::*;\\n\\n\\n\\n\\t\\tlet normal: &'static str = Normal.into();\\n\\n\\t\\tlet refresh: &'static str = Refresh.into();\\n\\n\\n\\n\\t\\tmatch value {\\n\\n\\t\\t\\tx if x == normal => Ok(Normal),\\n\\n\\t\\t\\tx if x == refresh => Ok(Refresh),\\n\\n\\t\\t\\t_ => Err(\\\"Error while converting TokenType value to static string.\\\"),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 52,\n \"score\": 16.046656504655815\n },\n {\n \"content\": \"\\n\\n// impl FromStr for Cfg {\\n\\n// type Err = failure::Error;\\n\\n\\n\\n// /// Load a `Cfg` from some string.\\n\\n// fn from(src: &str) -> Result<Self, Self::Err> {\\n\\n// toml::from_str(src)\\n\\n// .map_err(|e| format_err!(\\\"Failed to load config from: {}\\\", e))\\n\\n// }\\n\\n// }\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::Cfg;\\n\\n use std::path::Path;\\n\\n\\n\\n #[test]\\n\\n fn parse_cfg_with_fields() {\\n\\n let toml = Path::new(\\\"./config_test.toml\\\");\\n\\n let cfg_result = Cfg::load_config_file(toml);\\n\\n match cfg_result {\\n\\n Ok(cfg) => {\\n\\n assert_ne!(cfg.server.url.is_empty(), true);\\n\\n }\\n\\n Err(e) => panic!(\\\"Failed configuration parse: {:?}\\\", e)\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/config.rs\",\n \"rank\": 53,\n \"score\": 13.874343088960632\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\n\\n\\nuse erased_serde::Serialize as ErasedSerialize;\\n\\nuse warp::http::StatusCode;\\n\\n\\n\\npub struct Response {\\n\\n value: Option<Box<dyn ErasedSerialize + Send>>,\\n\\n status_code: StatusCode,\\n\\n headers: HashMap<String, String>,\\n\\n}\\n\\n\\n\\npub struct ResponseBuilder {\\n\\n status_code: StatusCode,\\n\\n headers: HashMap<String, String>,\\n\\n}\\n\\n\\n\\nimpl Response {\\n\\n /// The response headers.\\n\\n pub fn headers(&self) -> &HashMap<String, String> {\\n\\n &self.headers\\n\",\n \"file_path\": \"src/payload.rs\",\n \"rank\": 54,\n \"score\": 12.715955155286817\n },\n {\n \"content\": \" pub fault: &'a Fault,\\n\\n\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub title: Option<String>,\\n\\n\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub status: Option<u16>,\\n\\n\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub detail: Option<String>,\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a Fault> for ExceptionMsg<'a> {\\n\\n fn from(fault: &'a Fault) -> ExceptionMsg<'a> {\\n\\n use Fault::*;\\n\\n\\n\\n let status = Some(fault.to_status_code().as_u16());\\n\\n\\n\\n let (title, detail) = match fault {\\n\\n Static(_) => {\\n\",\n \"file_path\": \"src/exception.rs\",\n \"rank\": 55,\n \"score\": 11.306374427418392\n },\n {\n \"content\": \" ReadCfgFile(#[fail(cause)] io::Error),\\n\\n\\n\\n #[fail(display = \\\"Invalid format for config file: {}\\\", _0)]\\n\\n InvalidCfgFile(#[fail(cause)]toml::de::Error),\\n\\n}\\n\\n\\n\\nimpl Cfg {\\n\\n /// Creates a new `Cfg` instance using the parameters found in the given\\n\\n /// TOML configuration file. If the file cannot be found or the file is\\n\\n /// invalid, an `Error` is returned.\\n\\n pub fn load_config_file(filename: &Path) -> Result<Cfg, CfgError> {\\n\\n let path = &filename;\\n\\n let cfg_file_str = read_to_string(path)\\n\\n .map_err(CfgError::ReadCfgFile)?;\\n\\n let cfg = toml::de::from_str(&cfg_file_str)\\n\\n .map_err(CfgError::InvalidCfgFile)?;\\n\\n\\n\\n Ok(cfg)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/config.rs\",\n \"rank\": 56,\n \"score\": 11.206408092539192\n },\n {\n \"content\": \"pub enum TokenType {\\n\\n\\t/// Normal token is valid for 60 minutes\\n\\n\\tNormal,\\n\\n\\t/// Refresh token is valid for 15 minutes\\n\\n\\tRefresh,\\n\\n}\\n\\n\\n\\n/// From &str trait implementation\\n\\nimpl From<TokenType> for &'static str {\\n\\n\\tfn from(original: TokenType) -> &'static str {\\n\\n\\t\\tuse self::TokenType::*;\\n\\n\\n\\n\\t\\tmatch original {\\n\\n\\t\\t\\tNormal => \\\"Normal\\\",\\n\\n\\t\\t\\tRefresh => \\\"Refresh\\\",\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n/// Convert From enum to static string. Allows the use of TokenType variant\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 57,\n \"score\": 10.590196212110305\n },\n {\n \"content\": \" use warp::http::StatusCode;\\n\\n use Fault::*;\\n\\n\\n\\n match self {\\n\\n Static(StaticException::NotFound) => StatusCode::NOT_FOUND,\\n\\n Static(StaticException::InternalServerError) => {\\n\\n StatusCode::INTERNAL_SERVER_ERROR\\n\\n },\\n\\n RateLimit(_) => warp::http::StatusCode::TOO_MANY_REQUESTS,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for Fault {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\\n\\n let exception_msg: ExceptionMsg = self.into();\\n\\n\\n\\n // TODO: improve\\n\\n f.write_str(&format!(\\\"{:?}\\\", exception_msg))\\n\\n }\\n\",\n \"file_path\": \"src/exception.rs\",\n \"rank\": 58,\n \"score\": 8.70691488653247\n },\n {\n \"content\": \"#![feature(try_trait)]\\n\\n#![cfg_attr(feature = \\\"alloc\\\", feature(alloc))]\\n\\nextern crate alloc;\\n\\n\\n\\n#[macro_use] extern crate failure;\\n\\n#[macro_use] pub mod macros;\\n\\n#[macro_use] extern crate magic_crypt;\\n\\n#[macro_use] extern crate serde_json;\\n\\n\\n\\npub mod error;\\n\\npub mod hash;\\n\\npub mod random;\\n\\npub mod token;\\n\",\n \"file_path\": \"sentry/src/lib.rs\",\n \"rank\": 59,\n \"score\": 8.543882762225778\n },\n {\n \"content\": \"use std::{\\n\\n\\tcollections::HashMap,\\n\\n\\tconvert::TryFrom,\\n\\n\\tio::Result as IoResult,\\n\\n};\\n\\n\\n\\nuse asap::{\\n\\n\\tgenerator::Generator,\\n\\n\\tvalidator::{Validator, ValidatorBuilder},\\n\\n\\tclaims::{Aud, ExtraClaims},\\n\\n};\\n\\n\\n\\n#[cfg(feature = \\\"alloc\\\")]\\n\\nuse alloc;\\n\\nuse log;\\n\\nuse magic_crypt::MagicCrypt;\\n\\nuse once_cell::sync::OnceCell;\\n\\nuse serde::{Serialize, Deserialize};\\n\\nuse crate::error::Error;\\n\\n\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 60,\n \"score\": 8.142396153895353\n },\n {\n \"content\": \"use std::error::Error as StdError;\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\npub const INTERNAL_SERVER_ERROR: Fault = Fault::Static(StaticException::InternalServerError);\\n\\npub const NOT_FOUND: Fault = Fault::Static(StaticException::NotFound);\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"type\\\")]\\n\\npub enum Fault {\\n\\n /// Static will handle exceptions related to the static server\\n\\n #[serde(rename = \\\"about:blank\\\")]\\n\\n Static(StaticException),\\n\\n /// RateLimit handles exceptions related to filter gated request behind a\\n\\n /// leaky bucket rate limiter\\n\\n #[serde(rename = \\\"/report/rate-limit\\\")]\\n\\n RateLimit(RateLimitException)\\n\\n}\\n\\n\\n\\nimpl Fault {\\n\\n pub fn to_status_code(&self) -> warp::http::StatusCode {\\n\",\n \"file_path\": \"src/exception.rs\",\n \"rank\": 61,\n \"score\": 7.1806187848756515\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Build the payload response with the given value.\\n\\n pub fn body<T>(self, value: T) -> Response\\n\\n where\\n\\n T: ErasedSerialize + Send + 'static,\\n\\n {\\n\\n Response {\\n\\n value: Some(Box::new(value) as Box<dyn ErasedSerialize + Send>),\\n\\n status_code: self.status_code,\\n\\n headers: self.headers,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Create a response with a 200 OK status code.\\n\\n pub fn ok() -> Self {\\n\\n Self::new(StatusCode::OK)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/payload.rs\",\n \"rank\": 62,\n \"score\": 6.947260827646809\n },\n {\n \"content\": \" 'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'm', 'n', 'p', 'q', 'r', 't', 'v', 'w', 'x', 'y',\\n\\n 'B', 'C', 'D', 'F', 'G', 'H', 'J', 'K', 'M', 'N', 'P', 'Q', 'R', 'T', 'V', 'W', 'X', 'Y',\\n\\n '!', '@', '#', '$', '%', '&',\\n\\n];\\n\\n\\n\\n#[rustfmt::skip]\\n\\n/// A set of characters to generate random lowercase strings without ambiguous characters, and\\n\\n/// without vowels as to minimize the chance of generating bad words :)\\n\\n///\\n\\n/// also 0, o, 1, l, 2, z, 5, s are removed, as they look similar and can be confused.\\n\\n///\\n\\n/// Roughly 4.2 bits of entropy per character.\\n\\npub static RANDOM_UNAMBIGUOUS_LOWERCASE_CHARACTERS: &[char] = &[\\n\\n 'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'm', 'n', 'p', 'q', 'r', 't', 'v', 'w', 'x', 'y',\\n\\n];\\n\\n\\n\\n/// Generate a random string with N characters.\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 63,\n \"score\": 6.9112616696986215\n },\n {\n \"content\": \"//! Configuration\\n\\nuse serde::Deserialize;\\n\\nuse failure::Fail;\\n\\nuse std::{\\n\\n fs::read_to_string,\\n\\n io,\\n\\n path::Path,\\n\\n};\\n\\nuse toml;\\n\\n\\n\\n#[derive(Clone, Deserialize)]\\n\\n// Global configuration structure\\n\\npub struct Cfg {\\n\\n /// Web server configuration\\n\\n pub server: ServerCfg,\\n\\n // /// Log mechanism configuration\\n\\n // pub log: LogCfg,\\n\\n /// Persistance storage configuration\\n\\n pub database: StorageCfg,\\n\\n}\\n\",\n \"file_path\": \"src/config.rs\",\n \"rank\": 64,\n \"score\": 6.884368015453821\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl StdError for Fault {}\\n\\n\\n\\n/// Serde serializes an ExceptionMsg with its title field set to None and\\n\\n/// with its problem field to the Fault::Static variant, the title field in the\\n\\n/// generated serialization is taken from the StaticException variant.\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\n#[serde(tag = \\\"title\\\")]\\n\\npub enum StaticException {\\n\\n #[serde(rename = \\\"Not Found\\\")]\\n\\n NotFound,\\n\\n\\n\\n #[serde(rename = \\\"Internal Server Error\\\")]\\n\\n InternalServerError,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize)]\\n\\npub struct ExceptionMsg<'a> {\\n\\n #[serde(flatten)]\\n\",\n \"file_path\": \"src/exception.rs\",\n \"rank\": 65,\n \"score\": 6.794951338886155\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// The response status code.\\n\\n pub fn status_code(&self) -> StatusCode {\\n\\n self.status_code\\n\\n }\\n\\n\\n\\n /// The response value.\\n\\n pub fn value(&self) -> &Option<Box<dyn ErasedSerialize + Send>> {\\n\\n &self.value\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ResponseBuilder {\\n\\n /// Create a new payload response builder with the given status code.\\n\\n pub fn new(status_code: StatusCode) -> Self {\\n\\n ResponseBuilder {\\n\\n status_code,\\n\\n headers: HashMap::new(),\\n\\n }\\n\",\n \"file_path\": \"src/payload.rs\",\n \"rank\": 66,\n \"score\": 6.722818995502841\n },\n {\n \"content\": \"// as `aud`.\\n\\n//\\n\\n// Assert MASTER_ASAP_KEY.get() is empty before initialzing thread_safe_key.\\n\\n// Sentry token uses the key in a Lazy sync non-copy type, similar to a\\n\\n// lazy_static! but without using any macro's.\\n\\n//\\n\\n// To validate tokens be sure to use a keyserver. Future developments will\\n\\n// include a custom async HTTP client with async/await.\\n\\n//\\n\\n// Reference: https://github.com/rustasync/surf\\n\\n\\n\\n/// Private key used to sign tokens.\\n\\nconst PKEY: &[u8] = include_bytes!(\\\"../support/keys/sessions01/1569901546-private.der\\\");\\n\\n/// Name of the issuer for the token generating service.\\n\\nconst ISS: &'static str = \\\"sessions\\\";\\n\\n/// client data used for audience_identifier obfuscation.\\n\\nconst AUD: &'static str = \\\"email@example.com\\\";\\n\\n/// Path of the public key. It will be consumed by a keyserver.\\n\\nconst KID: &'static str = \\\"sessions01/1569901546-public.der\\\";\\n\\n\\n\\n/// Token lifespans\\n\\nconst REFRESH_LIFESPAN: i64 = 15 * 60;\\n\\nconst NORMAL_LIFESPAN: i64 = 60 * 60;\\n\\n\\n\\n/// Master key will be consumed by the `aud` magic_crypt encrypt method\\n\\nstatic MASTER_ASAP_KEY: OnceCell<String> = OnceCell::new();\\n\\n\\n\\n/// A thread-safe cell which can be written to only once\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 67,\n \"score\": 6.07693672550786\n },\n {\n \"content\": \"\\n\\n#[derive(Clone, Deserialize)]\\n\\n#[serde(rename_all = \\\"kebab-case\\\")]\\n\\n/// Server configuration key/values.\\n\\npub struct ServerCfg {\\n\\n /// The full server URL\\n\\n pub url: String,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Deserialize)]\\n\\n#[serde(rename_all = \\\"kebab-case\\\")]\\n\\n/// Persistance storage configuration key/values.\\n\\npub struct StorageCfg {\\n\\n /// The full server URL\\n\\n pub url: String,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Fail)]\\n\\npub enum CfgError {\\n\\n #[fail(display = \\\"Unable to read configuration file: {}\\\", _0)]\\n\",\n \"file_path\": \"src/config.rs\",\n \"rank\": 68,\n \"score\": 6.036680397516811\n },\n {\n \"content\": \"#[rustfmt::skip]\\n\\n/// Alphanumeric characters (lowercase and upercase).\\n\\n/// Roughly 6 bits of entropy per character.\\n\\npub static RANDOM_CHARACTERS: &[char] = &[\\n\\n '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\\n\\n 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',\\n\\n 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',\\n\\n 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\\n\\n 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\\n\\n];\\n\\n\\n\\n#[rustfmt::skip]\\n\\n/// A set of characters to generate random strings without ambiguous characters, and without\\n\\n/// vowels as to minimize the chance of generating bad words :)\\n\\n///\\n\\n/// also 0, o, 1, l, 2, z, 5, s are removed, as they look similar and can be confused.\\n\\n///\\n\\n/// Roughly 5.6 bits of entropy per character.\\n\\npub static RANDOM_UNAMBIGUOUS_CHARACTERS: &[char] = &[\\n\\n '3', '4', '6', '7', '8', '9',\\n\",\n \"file_path\": \"sentry/src/random.rs\",\n \"rank\": 69,\n \"score\": 6.030197194878488\n },\n {\n \"content\": \"#[macro_use]\\n\\n#[cfg(feature = \\\"sentry\\\")] pub mod sentry;\\n\\n#[macro_use] extern crate failure;\\n\\n\\n\\nmod config;\\n\\nmod error;\\n\\nmod exception;\\n\\nmod payload;\\n\\nmod rate_limit;\\n\\nmod utils;\\n\\n\\n\\nuse std::env;\\n\\n\\n\\nuse chrono::Utc;\\n\\nuse dotenv::dotenv;\\n\\nuse femme::pretty::Logger;\\n\\nuse log;\\n\\nuse terminator::Terminator;\\n\\nuse warp::{Filter, path};\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 70,\n \"score\": 6.00852397152468\n },\n {\n \"content\": \" (None, None)\\n\\n }\\n\\n\\n\\n RateLimit(_) => {\\n\\n (\\n\\n Some(\\\"Your request has been rate limited.\\\".to_owned()),\\n\\n None,\\n\\n )\\n\\n }\\n\\n };\\n\\n\\n\\n ExceptionMsg {\\n\\n fault,\\n\\n title,\\n\\n status,\\n\\n detail,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct RateLimitException {\\n\\n pub wait_time_millis: u64,\\n\\n}\\n\",\n \"file_path\": \"src/exception.rs\",\n \"rank\": 71,\n \"score\": 5.3449677311853545\n },\n {\n \"content\": \" )\\n\\n )\\n\\n .unify(),\\n\\n )\\n\\n .and(warp::header(\\\"Accept\\\"))\\n\\n .map(|resp: payload::Response, _accept: String| {\\n\\n let mut http_resp_builder = warp::http::response::Builder::new();\\n\\n http_resp_builder.status(resp.status_code());\\n\\n http_resp_builder.header(\\\"Content-Type\\\", \\\"application/json\\\");\\n\\n\\n\\n for (header, value) in resp.headers() {\\n\\n http_resp_builder.header(header.as_bytes(), value.clone());\\n\\n }\\n\\n\\n\\n match resp.value() {\\n\\n Some(value) => http_resp_builder\\n\\n .body(serde_json::to_string(value).unwrap())\\n\\n .unwrap(),\\n\\n None => http_resp_builder.body(\\\"\\\".to_owned()).unwrap()\\n\\n }\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 72,\n \"score\": 5.234460113076372\n },\n {\n \"content\": \"use std::env;\\n\\n\\n\\nuse diesel::pg::PgConnection;\\n\\nuse diesel::r2d2::{ConnectionManager, Pool, PooledConnection};\\n\\nuse futures::future::{self, Future};\\n\\nuse serde_json;\\n\\nuse warp::{Filter, Reply, Rejection};\\n\\n\\n\\nuse crate::exception::{self, INTERNAL_SERVER_ERROR};\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 73,\n \"score\": 4.929317967003682\n },\n {\n \"content\": \"// Info: Use .der format for PEM key encryption\\n\\n//\\n\\n// Steps to use ASAP API\\n\\n//\\n\\n// get_validator() method builds a `Resource_Server` which will fetch `KID`,\\n\\n// verify claims and signature.\\n\\n//\\n\\n// See [Validator, ValidatorBuilder] ASAP trait definition for more info.\\n\\n//\\n\\n// You'll need to setup environment variables for the validator and the generator.\\n\\n// The generator holds the header which is RS256 algorithm, private key, claims\\n\\n// and extra-claims.\\n\\n//\\n\\n// Set the \\\"aud\\\" claim identifier to access token generation. The issuer\\n\\n// and the resource server have to mutually agree on this identifier. The\\n\\n// details of how they reach agreement is not covered in the [Atlassian S2S Auth\\n\\n// protocol specification](https://s2sauth.bitbucket.io/spec/)\\n\\n//\\n\\n// As the aud consensus is open for implementation; Sentry token implements a\\n\\n// 256-bit DES encrypted client identifier, which converts client data string\\n\",\n \"file_path\": \"sentry/src/token.rs\",\n \"rank\": 74,\n \"score\": 4.8828270335948565\n },\n {\n \"content\": \"/// validates ParseError Eq implementation\\n\\nmacro_rules! validate {\\n\\n\\t($cond:expr, $e:expr) => {\\n\\n\\t\\tif !($cond) {\\n\\n\\t\\t\\treturn Err($e);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\t($cond:expr, $fmt:expr, $($arg:tt)+) => {\\n\\n\\t\\tif !($cond) {\\n\\n\\t\\t\\treturn Err($fmt, $($arg)+);\\n\\n\\t\\t}\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"sentry/src/macros.rs\",\n \"rank\": 75,\n \"score\": 4.618271454790224\n },\n {\n \"content\": \" warp::reply::with_status(\\n\\n serde_json::to_string(&static_exception).unwrap(),\\n\\n fault.to_status_code(),\\n\\n )\\n\\n };\\n\\n\\n\\n Ok(warp::reply::with_header(\\n\\n reply,\\n\\n \\\"Content-Type\\\",\\n\\n \\\"application/fault+json\\\",\\n\\n )\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 76,\n \"score\": 3.998761427236764\n },\n {\n \"content\": \"use crate::exception::{Fault, RateLimitException};\\n\\nuse ratelimit_meter::{algorithms::NonConformance, KeyedRateLimiter};\\n\\nuse std::net::SocketAddr;\\n\\nuse std::sync::{Arc, Mutex};\\n\\nuse std::time::Instant;\\n\\nuse warp::{Filter, Rejection};\\n\\n\\n\\n/// Create a filter that gates a request behind a leaky bucket rate limiter.\\n\\n///\\n\\n/// # Panics\\n\\n/// Panics if it is used with a transport not using socket addresses.\\n\",\n \"file_path\": \"src/rate_limit.rs\",\n \"rank\": 77,\n \"score\": 3.2299858915747164\n },\n {\n \"content\": \"use crate::config::Cfg;\\n\\nuse diesel::pg::PgConnection;\\n\\nuse diesel::r2d2::{ConnectionManager, Pool, PooledConnection};\\n\\n\\n\",\n \"file_path\": \"src/persistance.rs\",\n \"rank\": 78,\n \"score\": 3.127191095178742\n },\n {\n \"content\": \" })\\n\\n .recover(utils::handle_rejection)\\n\\n .with(warp::log(\\\"oxide::api\\\"));\\n\\n\\n\\n\\n\\n warp::serve(bundle_oxide)\\n\\n .run(\\n\\n // localhost\\n\\n ([127, 0, 0, 1], 8080)\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 79,\n \"score\": 2.339485035181271\n },\n {\n \"content\": \"Oxide\\n\\n=====\\n\\nRust microservice application. Currently 'Sentry', the backend of Oxide is\\n\\nunder development. Oxide will likely be built using an async framework.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 80,\n \"score\": 2.1736978614675264\n },\n {\n \"content\": \"Sentry\\n\\n======\\n\\nSentry is the backend for oxide. It includes the following components:\\n\\n\\n\\n* Token generator, adherance to [Atlassian S2S Auth Spec](https://s2sauth.bitbucket.io/spec)\\n\\n* Token validator through async Tokio server\\n\\n* Password hashing\\n\\n* Collision free unique identifier generator.\\n\\n\\n\\n##Build requirement\\n\\n* Initialize PEM private and public keys in DER format.\\n\\n\\n\\n```\\n\\n# Run shell script for directory and key scaffold.\\n\\n$ sh gen-keys.sh\\n\\n```\\n\\n\\n\\n* Store `MASTER_ASAP_KEY` in ./warden.key file recommended 256-bit minimum.\\n\\n\\n\\n* Store `SECRET_KEY` in ../sentry.env file, recommend 128-bit minimum.\\n\\n\\n\\n## License\\n\\nThis library is licensed under Apache License, Version 2.0, (LICENSE-APACHE or\\n\\nhttp://www.apache.org/licenses/LICENSE-2.0)\\n\",\n \"file_path\": \"sentry/README.md\",\n \"rank\": 81,\n \"score\": 1.9920341855358101\n }\n]","isConversational":false}}},{"rowIdx":3693,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"operators/src/util/input/multi_raster_or_vector.rs"},"repo_name":{"kind":"string","value":"koerberm/geoengine"},"commit":{"kind":"string","value":"61e0ec7a0c1136b4360b0f9c6306c34198e8ac3a"},"file_code":{"kind":"string","value":"use crate::engine::{OperatorDatasets, RasterOperator, VectorOperator};\nuse geoengine_datatypes::dataset::DatasetId;\nuse serde::{Deserialize, Serialize};\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n#[serde(untagged)]\npub enum MultiRasterOrVectorOperator {\n Raster(Vec<Box<dyn RasterOperator>>),\n Vector(Box<dyn VectorOperator>),\n}\n\nimpl MultiRasterOrVectorOperator {\n pub fn is_raster(&self) -> bool {\n match self {\n Self::Raster(_) => true,\n Self::Vector(_) => false,\n }\n }\n\n pub fn is_vector(&self) -> bool {\n match self {\n Self::Raster(_) => false,\n Self::Vector(_) => true,\n }\n }\n}\n\nimpl From<Box<dyn RasterOperator>> for MultiRasterOrVectorOperator {\n fn from(operator: Box<dyn RasterOperator>) -> Self {\n Self::Raster(vec![operator])\n }\n}\n\nimpl From<Vec<Box<dyn RasterOperator>>> for MultiRasterOrVectorOperator {\n fn from(operators: Vec<Box<dyn RasterOperator>>) -> Self {\n Self::Raster(operators)\n }\n}\n\nimpl From<Box<dyn VectorOperator>> for MultiRasterOrVectorOperator {\n fn from(operator: Box<dyn VectorOperator>) -> Self {\n Self::Vector(operator)\n }\n}\n\nimpl OperatorDatasets for MultiRasterOrVectorOperator {\n fn datasets_collect(&self, datasets: &mut Vec<DatasetId>) {\n match self {\n Self::Raster(rs) => {\n for r in rs {\n r.datasets_collect(datasets);\n }\n }\n Self::Vector(v) => v.datasets_collect(datasets),\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use crate::source::{GdalSource, GdalSourceParameters};\n use geoengine_datatypes::dataset::InternalDatasetId;\n use std::str::FromStr;\n\n use super::*;\n\n #[test]\n fn it_serializes() {\n let operator = MultiRasterOrVectorOperator::Raster(vec![GdalSource {\n params: GdalSourceParameters {\n dataset: InternalDatasetId::from_str(\"fc734022-61e0-49da-b327-257ba9d602a7\")\n .unwrap()\n .into(),\n },\n }\n .boxed()]);\n\n assert_eq!(\n serde_json::to_value(&operator).unwrap(),\n serde_json::json!([{\n \"type\": \"GdalSource\",\n \"params\": {\n \"dataset\": {\n \"type\": \"internal\",\n \"datasetId\": \"fc734022-61e0-49da-b327-257ba9d602a7\"\n }\n }\n }])\n );\n }\n\n #[test]\n fn it_deserializes_raster_ops() {\n let workflow = serde_json::json!([{\n \"type\": \"GdalSource\",\n \"params\": {\n \"dataset\": {\n \"type\": \"internal\",\n \"datasetId\": \"fc734022-61e0-49da-b327-257ba9d602a7\"\n }\n }\n }])\n .to_string();\n\n let raster_or_vector_operator: MultiRasterOrVectorOperator =\n serde_json::from_str(&workflow).unwrap();\n\n assert!(raster_or_vector_operator.is_raster());\n assert!(!raster_or_vector_operator.is_vector());\n }\n\n #[test]\n fn it_deserializes_vector_ops() {\n let workflow = serde_json::json!({\n \"type\": \"OgrSource\",\n \"params\": {\n \"dataset\": {\n \"type\": \"internal\",\n \"datasetId\": \"fc734022-61e0-49da-b327-257ba9d602a7\"\n },\n \"attribute_projection\": null,\n }\n })\n .to_string();\n\n let raster_or_vector_operator: MultiRasterOrVectorOperator =\n serde_json::from_str(&workflow).unwrap();\n\n assert!(raster_or_vector_operator.is_vector());\n assert!(!raster_or_vector_operator.is_raster());\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::engine::{OperatorDatasets, RasterOperator, VectorOperator};\nuse geoengine_datatypes::dataset::DatasetId;\nuse serde::{Deserialize, Serialize};\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n#[serde(untagged)]\npub enum MultiRasterOrVectorOperator {\n Raster(Vec<Box<dyn RasterOperator>>),\n Vector(Box<dyn VectorOperator>),\n}\n\nimpl MultiRasterOrVectorOperator {\n pub fn is_raster(&self) -> bool {\n match self {\n Self::Raster(_) => true,\n Self::Vector(_) => false,\n }\n }\n\n pub fn is_vector(&self) -> bool {\n match self {\n Self::Raster(_) => false,\n Self::Vector(_) => true,\n }\n }\n}\n\nimpl From<Box<dyn RasterOperator>> for MultiRasterOrVectorOperator {\n fn from(operator: Box<dyn RasterOperator>) -> Self {\n Self::Raster(vec![operator])\n }\n}\n\nimpl From<Vec<Box<dyn RasterOperator>>> for MultiRasterOrVectorOperator {\n fn from(operators: Vec<Box<dyn RasterOperator>>) -> Self {\n Self::Raster(operators)\n }\n}\n\nimpl From<Box<dyn VectorOperator>> for MultiRasterOrVectorOperator {\n fn from(operator: Box<dyn VectorOperator>) -> Self {\n Self::Vector(operator)\n }\n}\n\nimpl OperatorDatasets for MultiRasterOrVectorOperator {\n fn datasets_collect(&self, datasets: &mut Vec<DatasetId>) {\n match self {\n Self::Raster(rs) => {\n for r in rs {\n r.datasets_collect(datasets);\n }\n }\n Self::Vector(v) => v.datasets_collect(datasets),\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use crate::source::{GdalSource, GdalSourceParameters};\n use geoengine_datatypes::dataset::InternalDatasetId;\n use std::str::FromStr;\n\n use super::*;\n\n #[test]\n fn it_serializes() {\n let operator = MultiRasterOrVectorOperator::Raster(vec![GdalSource {\n params: GdalSourceParameters {\n dataset: InternalDatasetId::from_str(\"fc734022-61e0-49da-b327-257ba9d602a7\")\n .unwrap()\n .into(),\n },\n }\n .boxed()]);\n\n assert_eq!(\n serde_json::to_value(&operator).unwrap(),\n serde_json::json!([{\n \"type\": \"GdalSource\",\n \"params\": {\n \"dataset\": {\n \"type\": \"internal\",\n \"datasetId\": \"fc734022-61e0-49da-b327-257ba9d602a7\"\n }\n }\n }])\n );\n }\n\n #[test]\n fn it_deserializes_raster_ops() {\n let workflow = serde_json::json!([{\n \"type\": \"GdalSource\",\n \"params\": {\n \"dataset\": {\n \"type\": \"internal\",\n \"datasetId\": \"fc734022-61e0-49da-b327-257ba9d602a7\"\n }\n }\n }])\n .to_string();\n\n let raster_or_vector_operator: MultiRasterOrVectorOperator =\n serde_json::from_str(&workflow).unwrap();\n\n assert!(raster_or_vector_operator.is_raster());\n assert!(!raster_or_vector_operator.is_vector());\n }\n\n #[test]\n fn it_deserializes_vector_ops() {\n let workflow = serde_json::json!({\n \"type\": \"OgrSource\",\n \"params\": {\n \"dataset\": {\n \"type\": \"internal\",\n \"datasetId\": \"fc734022-61e0-49da-b327-257ba9d602a7\"\n },\n \""},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"attribute_projection\": null,\n }\n })\n .to_string();\n\n let raster_or_vector_operator: MultiRasterOrVectorOperator =\n serde_json::from_str(&workflow).unwrap();\n\n assert!(raster_or_vector_operator.is_vector());\n assert!(!raster_or_vector_operator.is_raster());\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"// TODO: move test helper somewhere else?\n\npub fn add_ndvi_dataset(ctx: &mut MockExecutionContext) -> DatasetId {\n\n let id: DatasetId = InternalDatasetId::new().into();\n\n ctx.add_meta_data(id.clone(), Box::new(create_ndvi_meta_data()));\n\n id\n\n}\n\n\n","file_path":"operators/src/util/gdal.rs","rank":0,"score":347120.72459160676},{"content":"pub fn fn_stream() -> impl Stream<Item = usize> {\n\n let mut counter: usize = 2;\n\n\n\n stream::poll_fn(move |_| -> Poll<Option<usize>> {\n\n if counter == 0 {\n\n return Poll::Ready(None);\n\n }\n\n counter -= 1;\n\n Poll::Ready(Some(counter))\n\n })\n\n}\n\n\n","file_path":"operators/tests/streams.rs","rank":1,"score":344067.65860353963},{"content":"pub fn catch_unwind_silent<F: FnOnce() -> R + panic::UnwindSafe, R>(\n\n f: F,\n\n) -> std::thread::Result<R> {\n\n let prev_hook = panic::take_hook();\n\n panic::set_hook(Box::new(|_| {}));\n\n let result = panic::catch_unwind(f);\n\n panic::set_hook(prev_hook);\n\n result\n\n}\n\n\n","file_path":"datatypes/src/util/test.rs","rank":2,"score":295790.70563735534},{"content":"/// Serde deserializer for booleans with case insensitive strings\n\npub fn bool_option_case_insensitive<'de, D>(deserializer: D) -> Result<Option<bool>, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let s = <&str as serde::Deserialize>::deserialize(deserializer)?;\n\n if s.is_empty() {\n\n Ok(None)\n\n } else {\n\n bool::from_str(&s.to_lowercase())\n\n .map(Some)\n\n .map_err(|_error| {\n\n D::Error::custom(format_args!(\"could not parse string as boolean: {}\", s))\n\n })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod mod_tests {\n\n use super::*;\n\n\n","file_path":"services/src/util/mod.rs","rank":3,"score":292854.6287424605},{"content":"/// Opens a Gdal Dataset with the given `path`.\n\n/// Other crates should use this method for Gdal Dataset access as a workaround to avoid strange errors.\n\npub fn gdal_open_dataset(path: &Path) -> Result<Dataset> {\n\n gdal_open_dataset_ex(path, DatasetOptions::default())\n\n}\n\n\n","file_path":"operators/src/util/gdal.rs","rank":4,"score":286868.1285375535},{"content":"/// Create a `RasterResultDescriptor` for the given `band` and `dataset`. If the raster data type is\n\n/// unknown, the default is F64 unless it is otherwise specified by `default_data_type`. If the data\n\n/// type is a complex floating point type, an error is returned\n\npub fn raster_descriptor_from_dataset(\n\n dataset: &Dataset,\n\n band: isize,\n\n default_data_type: Option<RasterDataType>,\n\n) -> Result<RasterResultDescriptor> {\n\n let rasterband = &dataset.rasterband(band)?;\n\n\n\n let spatial_ref: SpatialReference =\n\n dataset.spatial_ref()?.try_into().context(error::DataType)?;\n\n\n\n let data_type = match rasterband.band_type() {\n\n GDALDataType::GDT_Byte => RasterDataType::U8,\n\n GDALDataType::GDT_UInt16 => RasterDataType::U16,\n\n GDALDataType::GDT_Int16 => RasterDataType::I16,\n\n GDALDataType::GDT_UInt32 => RasterDataType::U32,\n\n GDALDataType::GDT_Int32 => RasterDataType::I32,\n\n GDALDataType::GDT_Float32 => RasterDataType::F32,\n\n GDALDataType::GDT_Float64 => RasterDataType::F64,\n\n GDALDataType::GDT_Unknown => default_data_type.unwrap_or(RasterDataType::F64),\n\n _ => return Err(Error::GdalRasterDataTypeNotSupported),\n\n };\n\n\n\n Ok(RasterResultDescriptor {\n\n data_type,\n\n spatial_reference: spatial_ref.into(),\n\n measurement: Measurement::Unitless,\n\n no_data_value: rasterband.no_data_value(),\n\n })\n\n}\n\n\n","file_path":"operators/src/util/gdal.rs","rank":5,"score":279600.7755940977},{"content":"/// Create `GdalDatasetParameters` from the infos in the given `dataset` and its `band`.\n\n/// `path` is the location of the actual data, `band_out` allows optionally specifying a different\n\n/// band in the resulting parameters, otherwise `band` is used.\n\npub fn gdal_parameters_from_dataset(\n\n dataset: &Dataset,\n\n band: usize,\n\n path: &Path,\n\n band_out: Option<usize>,\n\n open_options: Option<Vec<String>>,\n\n) -> Result<GdalDatasetParameters> {\n\n let rasterband = &dataset.rasterband(band as isize)?;\n\n\n\n Ok(GdalDatasetParameters {\n\n file_path: PathBuf::from(path),\n\n rasterband_channel: band_out.unwrap_or(band),\n\n geo_transform: dataset.geo_transform().context(error::Gdal)?.into(),\n\n file_not_found_handling: FileNotFoundHandling::Error,\n\n no_data_value: rasterband.no_data_value(),\n\n properties_mapping: None,\n\n width: rasterband.x_size(),\n\n height: rasterband.y_size(),\n\n gdal_open_options: open_options,\n\n gdal_config_options: None,\n\n })\n\n}\n","file_path":"operators/src/util/gdal.rs","rank":6,"score":279600.3344375393},{"content":"/// Opens a Gdal Dataset with the given `path` and `dataset_options`.\n\n/// Other crates should use this method for Gdal Dataset access as a workaround to avoid strange errors.\n\npub fn gdal_open_dataset_ex(path: &Path, dataset_options: DatasetOptions) -> Result<Dataset> {\n\n #[cfg(debug_assertions)]\n\n let dataset_options = {\n\n let mut dataset_options = dataset_options;\n\n dataset_options.open_flags |= gdal::GdalOpenFlags::GDAL_OF_VERBOSE_ERROR;\n\n dataset_options\n\n };\n\n\n\n Dataset::open_ex(path, dataset_options).context(error::Gdal)\n\n}\n\n\n","file_path":"operators/src/util/gdal.rs","rank":7,"score":272131.15636430745},{"content":"/// A descriptor that contains information about the query result, for instance, the data type\n\n/// and spatial reference.\n\npub trait ResultDescriptor: Clone + Serialize {\n\n type DataType;\n\n\n\n /// Return the type-specific result data type\n\n fn data_type(&self) -> Self::DataType;\n\n\n\n /// Return the spatial reference of the result\n\n fn spatial_reference(&self) -> SpatialReferenceOption;\n\n\n\n /// Map one descriptor to another one\n\n #[must_use]\n\n fn map<F>(&self, f: F) -> Self\n\n where\n\n F: Fn(&Self) -> Self,\n\n {\n\n f(self)\n\n }\n\n\n\n /// Map one descriptor to another one by modifying only the spatial reference\n\n #[must_use]\n","file_path":"operators/src/engine/result_descriptor.rs","rank":8,"score":264611.3795219799},{"content":"pub fn fold_by_blit_impl<T>(\n\n accu: RasterTileAccu2D<T>,\n\n tile: RasterTile2D<T>,\n\n) -> Result<RasterTileAccu2D<T>>\n\nwhere\n\n T: Pixel,\n\n{\n\n let mut accu_tile = accu.tile;\n\n let pool = accu.pool;\n\n let t_union = accu_tile.time.union(&tile.time)?;\n\n\n\n accu_tile.time = t_union;\n\n\n\n if tile.grid_array.is_empty() && accu_tile.no_data_value() == tile.no_data_value() {\n\n return Ok(RasterTileAccu2D::new(accu_tile, pool));\n\n }\n\n\n\n let mut materialized_accu_tile = accu_tile.into_materialized_tile();\n\n\n\n let blit_tile = match materialized_accu_tile.blit(tile) {\n","file_path":"operators/src/adapters/raster_subquery/raster_subquery_adapter.rs","rank":9,"score":254013.58303681438},{"content":"#[allow(dead_code)]\n\n#[allow(clippy::type_complexity)]\n\n#[allow(clippy::needless_pass_by_value)]\n\npub fn fold_by_coordinate_lookup_impl<T>(\n\n accu: TileWithProjectionCoordinates<T>,\n\n tile: RasterTile2D<T>,\n\n) -> Result<TileWithProjectionCoordinates<T>>\n\nwhere\n\n T: Pixel,\n\n{\n\n const MIN_ELEMENTS_IN_PAR_CHUNK: usize = 32 * 512; // this must never be smaller than 1\n\n let min_rows_in_par_chunk =\n\n num::integer::div_ceil(MIN_ELEMENTS_IN_PAR_CHUNK, tile.grid_array.axis_size_x()).max(1);\n\n\n\n // println!(\"fold_by_coordinate_lookup_impl {:?}\", &tile.tile_position);\n\n let mut accu = accu;\n\n let t_union = accu.accu_tile.time.union(&tile.time)?;\n\n\n\n accu.tile_mut().time = t_union;\n\n\n\n if tile.grid_array.is_empty() {\n\n return Ok(accu);\n\n }\n","file_path":"operators/src/adapters/raster_subquery/raster_subquery_reprojection.rs","rank":10,"score":250244.11494284432},{"content":"pub fn create_feature_aggregator<P: Pixel>(\n\n number_of_features: usize,\n\n aggregation: FeatureAggregationMethod,\n\n) -> TypedAggregator {\n\n match aggregation {\n\n FeatureAggregationMethod::First => match P::TYPE {\n\n RasterDataType::U8\n\n | RasterDataType::U16\n\n | RasterDataType::U32\n\n | RasterDataType::U64\n\n | RasterDataType::I8\n\n | RasterDataType::I16\n\n | RasterDataType::I32\n\n | RasterDataType::I64 => FirstValueIntAggregator::new(number_of_features).into_typed(),\n\n RasterDataType::F32 | RasterDataType::F64 => {\n\n FirstValueFloatAggregator::new(number_of_features).into_typed()\n\n }\n\n },\n\n FeatureAggregationMethod::Mean => MeanValueAggregator::new(number_of_features).into_typed(),\n\n }\n","file_path":"operators/src/processing/raster_vector_join/mod.rs","rank":11,"score":249285.95854947463},{"content":"/// Initialize a basic logger within tests.\n\n/// You should only use this for debugging.\n\n///\n\n/// # Panics\n\n/// This function will panic if the logger cannot be initialized.\n\n///\n\npub fn initialize_debugging_in_test() {\n\n Logger::try_with_str(\"debug\").unwrap().start().unwrap();\n\n}\n\n\n","file_path":"services/src/util/tests.rs","rank":12,"score":245839.79539387822},{"content":"/// Loop through an iterator by yielding the current and previous tuple. Starts with the\n\n/// (first, second) item, so the iterator must have more than one item to create an output.\n\nfn two_tuple_windows<I, T>(mut iter: I) -> impl Iterator<Item = (T, T)>\n\nwhere\n\n I: Iterator<Item = T>,\n\n T: Copy,\n\n{\n\n let mut last = iter.next();\n\n\n\n iter.map(move |item| {\n\n let output = (last.unwrap(), item);\n\n last = Some(item);\n\n output\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n use super::*;\n\n\n\n use geoengine_datatypes::primitives::{\n","file_path":"operators/src/processing/point_in_polygon.rs","rank":13,"score":243321.00956466407},{"content":"/// Loop through an iterator by yielding the current and previous tuple. Starts with the\n\n/// (first, second) item, so the iterator must have more than one item to create an output.\n\nfn two_tuple_windows<I, T>(mut iter: I) -> impl Iterator<Item = (T, T)>\n\nwhere\n\n I: Iterator<Item = T>,\n\n T: Copy,\n\n{\n\n let mut last = iter.next();\n\n\n\n iter.map(move |item| {\n\n let output = (last.unwrap(), item);\n\n last = Some(item);\n\n output\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use geoengine_datatypes::primitives::MultiPolygon;\n\n\n\n use super::*;\n\n\n","file_path":"operators/src/processing/point_in_polygon/tester.rs","rank":14,"score":239953.35022487916},{"content":"/// Helper function to downcast a mutable arrow array from a builder\n\n///\n\n/// The caller must be sure of its type, otherwise it panics\n\n/// # Panics\n\n/// Panics if `array` is not of type `T`\n\n///\n\npub fn downcast_mut_array<T: Any>(array: &mut dyn ArrayBuilder) -> &mut T {\n\n array.as_any_mut().downcast_mut().unwrap() // must obey type\n\n}\n\n\n","file_path":"datatypes/src/util/arrow.rs","rank":15,"score":235617.3096481622},{"content":"#[test]\n\nfn fn_test() {\n\n let mut stream = block_on_stream(fn_stream());\n\n\n\n assert_eq!(stream.next(), Some(1));\n\n assert_eq!(stream.next(), Some(0));\n\n assert_eq!(stream.next(), None);\n\n}\n","file_path":"operators/tests/streams.rs","rank":16,"score":235099.20152713062},{"content":"fn properties_from_band(properties: &mut RasterProperties, gdal_dataset: &GdalRasterBand) {\n\n if let Some(scale) = gdal_dataset.metadata_item(\"scale\", \"\") {\n\n properties.scale = scale.parse::<f64>().ok();\n\n };\n\n\n\n if let Some(offset) = gdal_dataset.metadata_item(\"offset\", \"\") {\n\n properties.offset = offset.parse::<f64>().ok();\n\n };\n\n\n\n if let Some(band_name) = gdal_dataset.metadata_item(\"band_name\", \"\") {\n\n properties.band_name = Some(band_name);\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::engine::{MockExecutionContext, MockQueryContext};\n\n use crate::test_data;\n\n use crate::util::gdal::add_ndvi_dataset;\n","file_path":"operators/src/source/gdal_source.rs","rank":17,"score":233932.40482885417},{"content":"/// reorders the given tuple of coordinates, resolutions, etc. using the axis ordering for `spatial_reference` to give (x, y)\n\npub fn tuple_from_ogc_params(\n\n a: f64,\n\n b: f64,\n\n spatial_reference: SpatialReference,\n\n) -> Result<(f64, f64)> {\n\n match spatial_reference_specification(&spatial_reference.proj_string()?)?\n\n .axis_order\n\n .ok_or(error::Error::AxisOrderingNotKnownForSrs {\n\n srs_string: spatial_reference.srs_string(),\n\n })? {\n\n AxisOrder::EastNorth => Ok((a, b)),\n\n AxisOrder::NorthEast => Ok((b, a)),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use chrono::{TimeZone, Utc};\n\n use geoengine_datatypes::spatial_reference::SpatialReferenceAuthority;\n\n use serde::de::value::StringDeserializer;\n","file_path":"services/src/ogc/util.rs","rank":18,"score":233233.45555551935},{"content":"#[allow(clippy::option_if_let_else)]\n\npub fn parse_type_names<'de, D>(deserializer: D) -> Result<TypeNames, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n\n\n if let Some(pos) = s.find(':') {\n\n let namespace = Some(s[..pos].to_string());\n\n let feature_type = s[pos + 1..].to_string();\n\n\n\n Ok(TypeNames {\n\n namespace,\n\n feature_type,\n\n })\n\n } else {\n\n Ok(TypeNames {\n\n namespace: None,\n\n feature_type: s,\n\n })\n\n }\n","file_path":"services/src/ogc/wfs/request.rs","rank":19,"score":232647.52924960887},{"content":"/// This trait extends `FeatureCollection` `Stream`s with Geo-Engine-specific functionality.\n\n///\n\npub trait FeatureCollectionStreamExt<CollectionType>:\n\n Stream<Item = Result<FeatureCollection<CollectionType>>>\n\nwhere\n\n CollectionType: Geometry + ArrowTyped + 'static,\n\n{\n\n /// Transforms a `Stream` of `FeatureCollection`s and merges them in a way that they\n\n /// are `chunk_size_bytes` large.\n\n fn merge_chunks(\n\n self,\n\n chunk_size_bytes: usize,\n\n ) -> FeatureCollectionChunkMerger<Fuse<Self>, CollectionType>\n\n where\n\n Self: Sized,\n\n {\n\n FeatureCollectionChunkMerger::new(self.fuse(), chunk_size_bytes)\n\n }\n\n}\n\n\n\nimpl<T: ?Sized, CollectionType: Geometry + ArrowTyped + 'static>\n\n FeatureCollectionStreamExt<CollectionType> for T\n\nwhere\n\n T: Stream<Item = Result<FeatureCollection<CollectionType>>>,\n\n{\n\n}\n","file_path":"operators/src/adapters/mod.rs","rank":20,"score":230679.1269518578},{"content":"/// Get a lock for mutex and recover from poisoning\n\n/// TODO: proper poisoning handling\n\npub fn safe_lock_mutex<M, T>(lock: &M) -> MutexGuard<T>\n\nwhere\n\n M: Deref<Target = Mutex<T>>,\n\n{\n\n match lock.deref().lock() {\n\n Ok(guard) => guard,\n\n Err(poisoned) => poisoned.into_inner(),\n\n }\n\n}\n","file_path":"operators/src/util/mod.rs","rank":21,"score":229585.7545117616},{"content":"pub fn grid_eq_with_no_data<D, T>(g1: &Grid<D, T>, g2: &Grid<D, T>) -> bool\n\nwhere\n\n D: PartialEq,\n\n T: PartialEq + Copy,\n\n{\n\n if g1.data.len() != g2.data.len() || g1.shape.ne(&g2.shape) {\n\n return false;\n\n }\n\n\n\n if !match (g1.no_data_value, g2.no_data_value) {\n\n (None, None) => true,\n\n (Some(_), None) => false,\n\n (_, Some(y)) => g1.is_no_data(y),\n\n } {\n\n return false;\n\n }\n\n\n\n for (l, r) in g1.data.iter().zip(g2.data.iter()) {\n\n if g1.is_no_data(*l) && g1.is_no_data(*r) {\n\n continue;\n\n }\n\n if l != r {\n\n return false;\n\n }\n\n }\n\n true\n\n}\n\n\n","file_path":"datatypes/src/util/test.rs","rank":22,"score":229331.63759966203},{"content":"pub trait Blit<R> {\n\n fn blit(&mut self, source: R) -> Result<()>;\n\n}\n\n\n\nimpl<T: Pixel> Blit<RasterTile2D<T>> for MaterializedRasterTile2D<T> {\n\n /// Copy `source` raster pixels into this raster, fails if the rasters do not overlap\n\n #[allow(clippy::float_cmp)]\n\n fn blit(&mut self, source: RasterTile2D<T>) -> Result<()> {\n\n // TODO: same crs\n\n // TODO: allow approximately equal pixel sizes?\n\n // TODO: ensure pixels are aligned\n\n\n\n ensure!(\n\n (self.geo_transform().x_pixel_size() == source.geo_transform().x_pixel_size())\n\n && (self.geo_transform().y_pixel_size() == source.geo_transform().y_pixel_size()),\n\n error::Blit {\n\n details: \"Incompatible pixel size\"\n\n }\n\n );\n\n\n","file_path":"datatypes/src/raster/operations/blit.rs","rank":23,"score":227337.10872606016},{"content":"/// Serde deserializer <https://docs.rs/serde_qs/0.6.0/serde_qs/index.html#flatten-workaround>\n\npub fn from_str<'de, D, S>(deserializer: D) -> Result<S, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n S: std::str::FromStr,\n\n{\n\n let s = <&str as serde::Deserialize>::deserialize(deserializer)?;\n\n S::from_str(s).map_err(|_error| D::Error::custom(\"could not parse string\"))\n\n}\n\n\n","file_path":"services/src/util/mod.rs","rank":24,"score":226473.1536721012},{"content":"pub fn eq_with_no_data<D, T>(g1: &GridOrEmpty<D, T>, g2: &GridOrEmpty<D, T>) -> bool\n\nwhere\n\n D: PartialEq,\n\n T: PartialEq + Copy,\n\n{\n\n match (g1, g2) {\n\n (GridOrEmpty::Grid(g1), GridOrEmpty::Grid(g2)) => grid_eq_with_no_data(g1, g2),\n\n (GridOrEmpty::Empty(g1), GridOrEmpty::Empty(g2)) => empty_grid_eq_with_no_data(g1, g2),\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"datatypes/src/util/test.rs","rank":25,"score":226265.74274591956},{"content":"#[must_use]\n\npub fn approx_eq_floats(left: &[f64], right: &[f64]) -> bool {\n\n if left.len() != right.len() {\n\n return false;\n\n }\n\n\n\n for (&l, &r) in left.iter().zip(right) {\n\n if !float_cmp::approx_eq!(f64, l, r) {\n\n return false;\n\n }\n\n }\n\n\n\n true\n\n}\n\n\n\n/// Create hash maps by specifying key-value pairs\n\n#[macro_export]\n\nmacro_rules! hashmap {\n\n (@void $($x:tt)*) => (());\n\n (@count $($tts:expr),*) => (<[()]>::len(&[$(hashmap!(@void $tts)),*]));\n\n\n","file_path":"datatypes/src/util/helpers.rs","rank":26,"score":223385.28241302643},{"content":"pub fn empty_grid_eq_with_no_data<D, T>(g1: &EmptyGrid<D, T>, g2: &EmptyGrid<D, T>) -> bool\n\nwhere\n\n D: PartialEq,\n\n T: PartialEq + Copy,\n\n{\n\n g1.shape.eq(&g2.shape) && g1.is_no_data(g2.no_data_value)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::raster::{EmptyGrid, Grid2D, GridShape2D};\n\n use crate::util::test::{empty_grid_eq_with_no_data, grid_eq_with_no_data};\n\n\n\n #[test]\n\n fn test_empty_grid_eq_with_no_data_integral_ok() {\n\n let d1: GridShape2D = [3, 2].into();\n\n let d2: GridShape2D = [3, 2].into();\n\n\n\n let ndv1 = 42;\n\n let ndv2 = 42;\n","file_path":"datatypes/src/util/test.rs","rank":27,"score":220445.58067403996},{"content":"/// Parse bbox, format is: \"x1,y1,x2,y2\"\n\npub fn parse_ogc_bbox<'de, D>(deserializer: D) -> Result<OgcBoundingBox, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n\n\n let split: Vec<Result<f64, std::num::ParseFloatError>> = s.split(',').map(str::parse).collect();\n\n\n\n if let [Ok(x1), Ok(y1), Ok(x2), Ok(y2)] = *split.as_slice() {\n\n Ok(OgcBoundingBox {\n\n values: [x1, y1, x2, y2],\n\n })\n\n } else {\n\n Err(D::Error::custom(\"Invalid bbox\"))\n\n }\n\n}\n\n\n","file_path":"services/src/ogc/util.rs","rank":28,"score":218438.28639858324},{"content":"/// Serde deserializer <https://docs.rs/serde_qs/0.6.0/serde_qs/index.html#flatten-workaround>\n\npub fn from_str_option<'de, D, S>(deserializer: D) -> Result<Option<S>, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n S: std::str::FromStr,\n\n{\n\n let s = <&str as serde::Deserialize>::deserialize(deserializer)?;\n\n if s.is_empty() {\n\n Ok(None)\n\n } else {\n\n S::from_str(s)\n\n .map(Some)\n\n .map_err(|_error| D::Error::custom(\"could not parse string\"))\n\n }\n\n}\n\n\n","file_path":"services/src/util/mod.rs","rank":29,"score":217808.46096524518},{"content":"pub trait OperatorDatasets {\n\n /// Get the dataset ids of all the datasets involoved in this operator and its sources\n\n fn datasets(&self) -> Vec<DatasetId> {\n\n let mut datasets = vec![];\n\n self.datasets_collect(&mut datasets);\n\n datasets\n\n }\n\n\n\n fn datasets_collect(&self, datasets: &mut Vec<DatasetId>);\n\n}\n\n\n\n/// Common methods for `RasterOperator`s\n","file_path":"operators/src/engine/operator.rs","rank":30,"score":216248.35098962375},{"content":"fn main() {\n\n println!(\"Bench_name, num_threads, chunk_byte_size, query_name, tilesize_x, tilesize_y, query_time (ns), tiles_produced, pixels_produced, stream_collect_time (ns) \");\n\n\n\n bench_gdal_source_operator_tile_size();\n\n bench_gdal_source_operator_with_expression_tile_size();\n\n bench_gdal_source_operator_with_identity_reprojection();\n\n bench_gdal_source_operator_with_4326_to_3857_reprojection();\n\n}\n","file_path":"operators/benches/workflows.rs","rank":31,"score":215683.75522770552},{"content":"#[test]\n\nfn serialize() {\n\n let array = {\n\n let mut builder = Int32Builder::new(5);\n\n builder\n\n .append_slice(&(1..=5).collect::<Vec<i32>>())\n\n .unwrap();\n\n\n\n builder.finish()\n\n };\n\n\n\n assert_eq!(array.len(), 5);\n\n\n\n // no serialization of arrays by now\n\n let json = serde_json::to_string(array.values()).unwrap();\n\n\n\n assert_eq!(json, \"[1,2,3,4,5]\");\n\n}\n\n\n","file_path":"datatypes/tests/example-arrow.rs","rank":32,"score":215297.66424403517},{"content":"/// create an axis aligned rectangle using the values \"a,b,c,d\" from OGC bbox-like parameters using the axis ordering for `spatial_reference`\n\npub fn rectangle_from_ogc_params<A: AxisAlignedRectangle>(\n\n values: [f64; 4],\n\n spatial_reference: SpatialReference,\n\n) -> Result<A> {\n\n let [a, b, c, d] = values;\n\n match spatial_reference_specification(&spatial_reference.proj_string()?)?\n\n .axis_order\n\n .ok_or(error::Error::AxisOrderingNotKnownForSrs {\n\n srs_string: spatial_reference.srs_string(),\n\n })? {\n\n AxisOrder::EastNorth => {\n\n A::from_min_max((a, b).into(), (c, d).into()).context(error::DataType)\n\n }\n\n AxisOrder::NorthEast => {\n\n A::from_min_max((b, a).into(), (d, c).into()).context(error::DataType)\n\n }\n\n }\n\n}\n\n\n","file_path":"services/src/ogc/util.rs","rank":33,"score":213706.74066571615},{"content":"enum BoxPlotAccumKind {\n\n Exact(Vec<f64>),\n\n Estimated(PSquareQuantileEstimator<f64>),\n\n}\n\n\n\nimpl BoxPlotAccumKind {\n\n fn update(&mut self, values: impl Iterator<Item = f64>) -> crate::util::Result<()> {\n\n match self {\n\n Self::Exact(ref mut x) => {\n\n x.extend(values.filter(|x| x.is_finite()));\n\n\n\n if x.len() > EXACT_CALC_BOUND {\n\n let est = PSquareQuantileEstimator::new(0.5, x.as_slice())?;\n\n *self = Self::Estimated(est);\n\n }\n\n Ok(())\n\n }\n\n Self::Estimated(ref mut est) => {\n\n for v in values {\n\n est.update(v);\n","file_path":"operators/src/plot/box_plot.rs","rank":34,"score":212037.13107744904},{"content":"#[inline]\n\npub fn average_floor<I>(a: I, b: I) -> I\n\nwhere\n\n I: Copy\n\n + Add<I, Output = I>\n\n + Shr<usize, Output = I>\n\n + BitAnd<I, Output = I>\n\n + BitOr<I, Output = I>\n\n + BitXor<I, Output = I>,\n\n{\n\n (a & b) + ((a ^ b) >> 1)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn average_floor_checks() {\n\n assert_eq!(\n\n average_floor(631_152_000_000_i64, 946_684_800_001_i64),\n\n 788_918_400_000_i64\n\n );\n\n\n\n assert_eq!(average_floor(i64::MIN, i64::MAX), -1);\n\n }\n\n}\n","file_path":"operators/src/util/math.rs","rank":35,"score":211903.87156433257},{"content":"#[async_trait]\n\npub trait Context: 'static + Send + Sync + Clone {\n\n type Session: MockableSession + Clone; // TODO: change to `[Session]` when workarounds are gone\n\n type ProjectDB: ProjectDb<Self::Session>;\n\n type WorkflowRegistry: WorkflowRegistry;\n\n type DatasetDB: DatasetDb<Self::Session>;\n\n type QueryContext: QueryContext;\n\n type ExecutionContext: ExecutionContext;\n\n\n\n fn project_db(&self) -> Db<Self::ProjectDB>;\n\n async fn project_db_ref(&self) -> RwLockReadGuard<Self::ProjectDB>;\n\n async fn project_db_ref_mut(&self) -> RwLockWriteGuard<Self::ProjectDB>;\n\n\n\n fn workflow_registry(&self) -> Db<Self::WorkflowRegistry>;\n\n async fn workflow_registry_ref(&self) -> RwLockReadGuard<Self::WorkflowRegistry>;\n\n async fn workflow_registry_ref_mut(&self) -> RwLockWriteGuard<Self::WorkflowRegistry>;\n\n\n\n fn dataset_db(&self) -> Db<Self::DatasetDB>;\n\n async fn dataset_db_ref(&self) -> RwLockReadGuard<Self::DatasetDB>;\n\n async fn dataset_db_ref_mut(&self) -> RwLockWriteGuard<Self::DatasetDB>;\n\n\n","file_path":"services/src/contexts/mod.rs","rank":36,"score":211788.12093350844},{"content":"pub fn first_tile_fold_fn<T>(\n\n acc: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> TemporalRasterAggregationTileAccu<T>\n\nwhere\n\n T: Pixel,\n\n{\n\n if acc.initial_state {\n\n let mut next_accu = tile;\n\n next_accu.time = acc.accu_tile.time;\n\n\n\n TemporalRasterAggregationTileAccu {\n\n accu_tile: next_accu,\n\n initial_state: false,\n\n pool: acc.pool,\n\n }\n\n } else {\n\n acc\n\n }\n\n}\n\n\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":37,"score":211582.10002427164},{"content":"#[allow(clippy::needless_pass_by_value)]\n\npub fn last_tile_fold_fn<T>(\n\n acc: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> TemporalRasterAggregationTileAccu<T>\n\nwhere\n\n T: Pixel,\n\n{\n\n let mut next_accu = tile;\n\n next_accu.time = acc.accu_tile.time;\n\n\n\n TemporalRasterAggregationTileAccu {\n\n accu_tile: next_accu,\n\n initial_state: false,\n\n pool: acc.pool,\n\n }\n\n}\n\n\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":38,"score":211582.10002427164},{"content":"fn bench_gdal_source_operator_with_4326_to_3857_reprojection() {\n\n let qrects = vec![(\n\n \"World in EPSG:3857 ~ 40000 x 20000 px\",\n\n RasterQueryRectangle {\n\n spatial_bounds: SpatialPartition2D::new(\n\n (-20_037_508.342_789_244, 20_048_966.104_014_594).into(),\n\n (20_037_508.342_789_244, -20_048_966.104_014_594).into(),\n\n )\n\n .unwrap(),\n\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\n\n spatial_resolution: SpatialResolution::new(1050., 2100.).unwrap(),\n\n },\n\n )];\n\n\n\n let tiling_specs = vec![\n\n // TilingSpecification::new((0., 0.).into(), [32, 32].into()),\n\n // TilingSpecification::new((0., 0.).into(), [64, 64].into()),\n\n // TilingSpecification::new((0., 0.).into(), [128, 128].into()),\n\n // TilingSpecification::new((0., 0.).into(), [256, 256].into()),\n\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\n","file_path":"operators/benches/workflows.rs","rank":39,"score":211572.771582282},{"content":"pub fn create_random_user_session_helper() -> UserSession {\n\n let user_id = UserId::new();\n\n\n\n UserSession {\n\n id: SessionId::new(),\n\n user: UserInfo {\n\n id: user_id,\n\n email: Some(user_id.to_string()),\n\n real_name: Some(user_id.to_string()),\n\n },\n\n created: MIN_DATETIME,\n\n valid_until: MAX_DATETIME,\n\n project: None,\n\n view: None,\n\n roles: vec![user_id.into(), Role::user_role_id()],\n\n }\n\n}\n\n\n\n#[allow(clippy::missing_panics_doc)]\n\npub async fn create_project_helper<C: ProContext>(ctx: &C) -> (UserSession, ProjectId) {\n","file_path":"services/src/pro/util/tests.rs","rank":40,"score":211556.18014834268},{"content":"/// this method performs the transformation of a query rectangle in `target` projection\n\n/// to a new query rectangle with coordinates in the `source` projection\n\npub fn reproject_query<S: AxisAlignedRectangle>(\n\n query: QueryRectangle<S>,\n\n source: SpatialReference,\n\n target: SpatialReference,\n\n) -> Result<QueryRectangle<S>> {\n\n let projector_source_target = CoordinateProjector::from_known_srs(source, target)?;\n\n let projector_target_source = CoordinateProjector::from_known_srs(target, source)?;\n\n\n\n let p_bbox = query\n\n .spatial_bounds\n\n .reproject_clipped(&projector_target_source)?;\n\n let s_bbox = p_bbox.reproject(&projector_source_target)?;\n\n\n\n let p_spatial_resolution =\n\n suggest_pixel_size_from_diag_cross_projected(s_bbox, p_bbox, query.spatial_resolution)?;\n\n Ok(QueryRectangle {\n\n spatial_bounds: p_bbox,\n\n spatial_resolution: p_spatial_resolution,\n\n time_interval: query.time_interval,\n\n })\n","file_path":"datatypes/src/operations/reproject.rs","rank":41,"score":210304.80717084766},{"content":"pub fn fold_fn<T, C>(\n\n acc: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> TemporalRasterAggregationTileAccu<T>\n\nwhere\n\n T: Pixel,\n\n C: AccFunction,\n\n{\n\n let mut accu_tile = acc.accu_tile;\n\n\n\n let grid = if acc.initial_state {\n\n tile.grid_array\n\n } else {\n\n match (accu_tile.grid_array, tile.grid_array) {\n\n (GridOrEmpty::Grid(mut a), GridOrEmpty::Grid(g)) => {\n\n a.data = a\n\n .inner_ref()\n\n .iter()\n\n .zip(g.inner_ref())\n\n .map(|(x, y)| C::acc(a.no_data_value, *x, *y))\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":42,"score":209844.53082609747},{"content":"fn create_rgba_image<P: Pixel + RgbaTransmutable, N: Fn(P) -> bool>(\n\n raster_grid: &Grid2D<P>,\n\n width: u32,\n\n height: u32,\n\n colorizer: &Colorizer,\n\n scale_x: f64,\n\n scale_y: f64,\n\n is_no_data: N,\n\n) -> RgbaImage {\n\n let color_mapper = colorizer.create_color_mapper();\n\n\n\n RgbaImage::from_fn(width, height, |x, y| {\n\n let (grid_pixel_x, grid_pixel_y) = image_pixel_to_raster_pixel(x, y, scale_x, scale_y);\n\n if let Ok(pixel_value) = raster_grid.get_at_grid_index([grid_pixel_y, grid_pixel_x]) {\n\n if is_no_data(pixel_value) {\n\n return colorizer.no_data_color().into();\n\n }\n\n\n\n color_mapper.call(pixel_value)\n\n } else {\n","file_path":"datatypes/src/operations/image/to_png.rs","rank":43,"score":209560.53178906327},{"content":"enum ColumnDataType {\n\n Int,\n\n Float,\n\n Text,\n\n Date,\n\n Unknown,\n\n}\n\n\n\nimpl TryFrom<ColumnDataType> for FeatureDataType {\n\n type Error = error::Error;\n\n\n\n fn try_from(value: ColumnDataType) -> Result<Self, Self::Error> {\n\n match value {\n\n ColumnDataType::Int => Ok(FeatureDataType::Int),\n\n ColumnDataType::Float => Ok(FeatureDataType::Float),\n\n ColumnDataType::Text => Ok(FeatureDataType::Text),\n\n _ => Err(error::Error::NoFeatureDataTypeForColumnDataType),\n\n }\n\n }\n\n}\n\n\n","file_path":"services/src/handlers/datasets.rs","rank":44,"score":209386.33362206415},{"content":"#[allow(dead_code)]\n\npub fn fold_by_blit_future<T>(\n\n accu: RasterTileAccu2D<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl Future<Output = Result<RasterTileAccu2D<T>>>\n\nwhere\n\n T: Pixel,\n\n{\n\n tokio::task::spawn_blocking(|| fold_by_blit_impl(accu, tile)).then(|x| async move {\n\n match x {\n\n Ok(r) => r,\n\n Err(e) => Err(e.into()),\n\n }\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use geoengine_datatypes::{\n\n primitives::{Measurement, SpatialPartition2D, SpatialResolution, TimeInterval},\n\n raster::{Grid, GridShape, RasterDataType},\n","file_path":"operators/src/adapters/raster_subquery/raster_subquery_adapter.rs","rank":45,"score":208395.86025085987},{"content":"#[allow(clippy::missing_panics_doc)]\n\npub fn create_ndvi_meta_data() -> GdalMetaDataRegular {\n\n let no_data_value = Some(0.); // TODO: is it really 0?\n\n GdalMetaDataRegular {\n\n start: TimeInstance::from_millis(1_388_534_400_000).unwrap(),\n\n step: TimeStep {\n\n granularity: TimeGranularity::Months,\n\n step: 1,\n\n },\n\n time_placeholders: hashmap! {\n\n \"%_START_TIME_%\".to_string() => GdalSourceTimePlaceholder {\n\n format: \"%Y-%m-%d\".to_string(),\n\n reference: TimeReference::Start,\n\n },\n\n },\n\n params: GdalDatasetParameters {\n\n file_path: test_data!(\"raster/modis_ndvi/MOD13A2_M_NDVI_%_START_TIME_%.TIFF\").into(),\n\n rasterband_channel: 1,\n\n geo_transform: GdalDatasetGeoTransform {\n\n origin_coordinate: (-180., 90.).into(),\n\n x_pixel_size: 0.1,\n","file_path":"operators/src/util/gdal.rs","rank":46,"score":208395.86025085987},{"content":"fn bench_gdal_source_operator_with_identity_reprojection() {\n\n let qrects = vec![(\n\n \"World in 36000x18000 pixels\",\n\n RasterQueryRectangle {\n\n spatial_bounds: SpatialPartition2D::new((-180., 90.).into(), (180., -90.).into())\n\n .unwrap(),\n\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\n\n spatial_resolution: SpatialResolution::new(0.01, 0.01).unwrap(),\n\n },\n\n )];\n\n\n\n let tiling_specs = vec![\n\n // TilingSpecification::new((0., 0.).into(), [32, 32].into()),\n\n // TilingSpecification::new((0., 0.).into(), [64, 64].into()),\n\n // TilingSpecification::new((0., 0.).into(), [128, 128].into()),\n\n TilingSpecification::new((0., 0.).into(), [256, 256].into()),\n\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\n\n // TilingSpecification::new((0., 0.).into(), [600, 600].into()),\n\n // TilingSpecification::new((0., 0.).into(), [900, 900].into()),\n\n TilingSpecification::new((0., 0.).into(), [1024, 1024].into()),\n","file_path":"operators/benches/workflows.rs","rank":47,"score":208236.31104957665},{"content":"fn bench_gdal_source_operator_tile_size() {\n\n let qrects = vec![(\n\n \"World in 36000x18000 pixels\",\n\n RasterQueryRectangle {\n\n spatial_bounds: SpatialPartition2D::new((-180., 90.).into(), (180., -90.).into())\n\n .unwrap(),\n\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\n\n spatial_resolution: SpatialResolution::new(0.01, 0.01).unwrap(),\n\n },\n\n )];\n\n\n\n let tiling_specs = vec![\n\n TilingSpecification::new((0., 0.).into(), [32, 32].into()),\n\n TilingSpecification::new((0., 0.).into(), [64, 64].into()),\n\n TilingSpecification::new((0., 0.).into(), [128, 128].into()),\n\n TilingSpecification::new((0., 0.).into(), [256, 256].into()),\n\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\n\n // TilingSpecification::new((0., 0.).into(), [600, 600].into()),\n\n // TilingSpecification::new((0., 0.).into(), [900, 900].into()),\n\n TilingSpecification::new((0., 0.).into(), [1024, 1024].into()),\n","file_path":"operators/benches/workflows.rs","rank":48,"score":208236.31104957665},{"content":"/// Tries to reproject all coordinates at once. If this fails, tries to reproject coordinate by coordinate.\n\n/// It returns all coordinates in input order.\n\n/// In case of success it returns `Some(Coordinate2D)` and `None` otherwise.\n\npub fn project_coordinates_fail_tolerant<P: CoordinateProjection>(\n\n i: &[Coordinate2D],\n\n p: &P,\n\n) -> Vec<Option<Coordinate2D>> {\n\n if let Ok(projected_all) = p.project_coordinates(&i) {\n\n return projected_all\n\n .into_iter()\n\n .map(Some)\n\n .collect::<Vec<Option<Coordinate2D>>>();\n\n }\n\n\n\n let individual_projected: Vec<Option<Coordinate2D>> = i\n\n .iter()\n\n .map(|&c| (c, c.reproject(p)))\n\n //.inspect(|(c, c_p)| {\n\n // dbg!(c, c_p);\n\n //})\n\n .map(|(_, c_p)| c_p.ok())\n\n .collect();\n\n // For debuging use this to find oput how many coordinates could be transformed.\n\n //dbg!(\n\n // individual_projected.iter().filter(|c| c.is_some()).count(),\n\n // i.len()\n\n //);\n\n individual_projected\n\n}\n\n\n","file_path":"datatypes/src/operations/reproject.rs","rank":49,"score":207181.1104882963},{"content":"pub fn value_in_range<T>(value: T, min: T, max: T) -> bool\n\nwhere\n\n T: PartialOrd + Copy,\n\n{\n\n (value >= min) && (value < max)\n\n}\n\n\n","file_path":"datatypes/src/util/ranges.rs","rank":50,"score":206938.13380117973},{"content":"pub fn check_allowed_http_methods<'a, T, TRes>(\n\n test_helper: T,\n\n allowed_methods: &'a [Method],\n\n) -> impl futures::Future + 'a\n\nwhere\n\n T: Fn(Method) -> TRes + 'a,\n\n TRes: futures::Future<Output = ServiceResponse> + 'a,\n\n{\n\n check_allowed_http_methods2(test_helper, allowed_methods, |res| res)\n\n}\n\n\n\npub async fn send_test_request<C: SimpleContext>(\n\n req: test::TestRequest,\n\n ctx: C,\n\n) -> ServiceResponse {\n\n let app = test::init_service(\n\n App::new()\n\n .app_data(web::Data::new(ctx))\n\n .wrap(\n\n middleware::ErrorHandlers::default()\n","file_path":"services/src/util/tests.rs","rank":51,"score":206733.78861444464},{"content":"#[async_trait]\n\npub trait MetaDataProvider<L, R, Q>\n\nwhere\n\n R: ResultDescriptor,\n\n{\n\n async fn meta_data(&self, dataset: &DatasetId) -> Result<Box<dyn MetaData<L, R, Q>>>;\n\n}\n\n\n","file_path":"operators/src/engine/execution_context.rs","rank":52,"score":205798.143029268},{"content":"#[allow(dead_code)]\n\npub fn fold_by_coordinate_lookup_future<T>(\n\n accu: TileWithProjectionCoordinates<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl TryFuture<Ok = TileWithProjectionCoordinates<T>, Error = error::Error>\n\nwhere\n\n T: Pixel,\n\n{\n\n // println!(\"fold_by_coordinate_lookup_future {:?}\", &tile.tile_position);\n\n tokio::task::spawn_blocking(|| fold_by_coordinate_lookup_impl(accu, tile)).then(\n\n |x| async move {\n\n match x {\n\n Ok(r) => r,\n\n Err(e) => Err(e.into()),\n\n }\n\n },\n\n )\n\n}\n\n\n","file_path":"operators/src/adapters/raster_subquery/raster_subquery_reprojection.rs","rank":53,"score":205514.56846042807},{"content":"fn bench_gdal_source_operator_with_expression_tile_size() {\n\n let qrects = vec![(\n\n \"World in 36000x18000 pixels\",\n\n RasterQueryRectangle {\n\n spatial_bounds: SpatialPartition2D::new((-180., 90.).into(), (180., -90.).into())\n\n .unwrap(),\n\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\n\n spatial_resolution: SpatialResolution::new(0.01, 0.01).unwrap(),\n\n },\n\n )];\n\n\n\n let tiling_specs = vec![\n\n // TilingSpecification::new((0., 0.).into(), [32, 32].into()),\n\n TilingSpecification::new((0., 0.).into(), [64, 64].into()),\n\n TilingSpecification::new((0., 0.).into(), [128, 128].into()),\n\n TilingSpecification::new((0., 0.).into(), [256, 256].into()),\n\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\n\n // TilingSpecification::new((0., 0.).into(), [600, 600].into()),\n\n // TilingSpecification::new((0., 0.).into(), [900, 900].into()),\n\n TilingSpecification::new((0., 0.).into(), [1024, 1024].into()),\n","file_path":"operators/benches/workflows.rs","rank":54,"score":205029.23295231504},{"content":"pub fn no_data_ignoring_fold_fn<T, C>(\n\n acc: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> TemporalRasterAggregationTileAccu<T>\n\nwhere\n\n T: Pixel,\n\n C: NoDataIgnoringAccFunction,\n\n{\n\n let TemporalRasterAggregationTileAccu {\n\n mut accu_tile,\n\n initial_state: _initial_state,\n\n pool,\n\n } = acc;\n\n\n\n let grid = match (accu_tile.grid_array, tile.grid_array) {\n\n (GridOrEmpty::Grid(mut a), GridOrEmpty::Grid(g)) => {\n\n a.data = a\n\n .inner_ref()\n\n .iter()\n\n .zip(g.inner_ref())\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":55,"score":204974.12350377502},{"content":"/// Method to generate an `Iterator` over all `GridIdx2D` in `GridBounds`\n\npub fn grid_idx_iter_2d<B>(bounds: &B) -> impl Iterator<Item = GridIdx2D>\n\nwhere\n\n B: GridBounds<IndexArray = [isize; 2]>,\n\n{\n\n let GridIdx([y_s, x_s]) = bounds.min_index();\n\n let GridIdx([y_e, x_e]) = bounds.max_index();\n\n\n\n (y_s..=y_e).flat_map(move |y| (x_s..=x_e).map(move |x| [y, x].into()))\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Grid<D, T> {\n\n pub shape: D,\n\n pub data: Vec<T>,\n\n pub no_data_value: Option<T>,\n\n}\n\n\n\npub type Grid1D<T> = Grid<GridShape1D, T>;\n\npub type Grid2D<T> = Grid<GridShape2D, T>;\n","file_path":"datatypes/src/raster/grid.rs","rank":56,"score":204822.96980948246},{"content":"pub fn value_in_range_inv<T>(value: T, min: T, max: T) -> bool\n\nwhere\n\n T: PartialOrd + Copy,\n\n{\n\n (value > min) && (value <= max)\n\n}\n\n\n","file_path":"datatypes/src/util/ranges.rs","rank":57,"score":204213.1519150808},{"content":"pub fn value_in_range_inclusive<T>(value: T, min: T, max: T) -> bool\n\nwhere\n\n T: PartialOrd + Copy,\n\n{\n\n (value >= min) && (value <= max)\n\n}\n\n\n","file_path":"datatypes/src/util/ranges.rs","rank":58,"score":204213.1519150808},{"content":"pub fn identity_accu<T: Pixel>(\n\n tile_info: TileInformation,\n\n query_rect: RasterQueryRectangle,\n\n no_data_value: T,\n\n pool: Arc<ThreadPool>,\n\n) -> impl Future<Output = Result<RasterTileAccu2D<T>>> {\n\n tokio::task::spawn_blocking(move || {\n\n let output_raster =\n\n EmptyGrid2D::new(tile_info.tile_size_in_pixels, T::from_(no_data_value)).into();\n\n let output_tile =\n\n RasterTile2D::new_with_tile_info(query_rect.time_interval, tile_info, output_raster);\n\n RasterTileAccu2D::new(output_tile, pool)\n\n })\n\n .map_err(From::from)\n\n}\n\n\n","file_path":"operators/src/adapters/raster_subquery/raster_subquery_adapter.rs","rank":59,"score":204182.2868310359},{"content":"pub fn update_project_helper(project: ProjectId) -> UpdateProject {\n\n UpdateProject {\n\n id: project,\n\n name: Some(\"TestUpdate\".to_string()),\n\n description: None,\n\n layers: Some(vec![LayerUpdate::UpdateOrInsert(Layer {\n\n workflow: WorkflowId::new(),\n\n name: \"L1\".to_string(),\n\n visibility: Default::default(),\n\n symbology: Symbology::Raster(RasterSymbology {\n\n opacity: 1.0,\n\n colorizer: Colorizer::Rgba,\n\n }),\n\n })]),\n\n plots: None,\n\n bounds: None,\n\n time_step: None,\n\n }\n\n}\n\n\n","file_path":"services/src/util/tests.rs","rank":60,"score":203670.50805306912},{"content":"fn detect_time_type(columns: &Columns) -> OgrSourceDatasetTimeType {\n\n // TODO: load candidate names from config\n\n let known_start = [\n\n \"start\",\n\n \"time\",\n\n \"begin\",\n\n \"date\",\n\n \"time_start\",\n\n \"start time\",\n\n \"date_start\",\n\n \"start date\",\n\n \"datetime\",\n\n \"date_time\",\n\n \"date time\",\n\n \"event\",\n\n \"timestamp\",\n\n \"time_from\",\n\n \"t1\",\n\n \"t\",\n\n ];\n","file_path":"services/src/handlers/datasets.rs","rank":61,"score":202993.98486736498},{"content":"pub fn mean_tile_fold_future<T>(\n\n accu: TemporalMeanTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl Future<Output = Result<TemporalMeanTileAccu<T>>>\n\nwhere\n\n T: Pixel,\n\n{\n\n tokio::task::spawn_blocking(|| {\n\n let mut accu = accu;\n\n accu.add_tile(tile)?;\n\n Ok(accu)\n\n })\n\n .then(|x| async move {\n\n match x {\n\n Ok(r) => r,\n\n Err(e) => Err(e.into()),\n\n }\n\n })\n\n}\n\n\n","file_path":"operators/src/processing/temporal_raster_aggregation/mean_aggregation_subquery.rs","rank":62,"score":202744.0317576118},{"content":"#[async_trait]\n\npub trait SessionMetaDataProvider<S, L, R, Q>\n\nwhere\n\n S: Session,\n\n R: ResultDescriptor,\n\n{\n\n async fn session_meta_data(\n\n &self,\n\n session: &S,\n\n dataset: &DatasetId,\n\n ) -> Result<Box<dyn MetaData<L, R, Q>>>;\n\n}\n\n\n\n/// Listing of stored datasets\n","file_path":"services/src/datasets/listing.rs","rank":63,"score":202052.88361552084},{"content":"pub fn get_token(req: &HttpRequest) -> Result<SessionId> {\n\n let header = req\n\n .headers()\n\n .get(header::AUTHORIZATION)\n\n .ok_or(Error::Authorization {\n\n source: Box::new(Error::MissingAuthorizationHeader),\n\n })?;\n\n let scheme = Bearer::parse(header).map_err(|_| Error::Authorization {\n\n source: Box::new(Error::InvalidAuthorizationScheme),\n\n })?;\n\n SessionId::from_str(scheme.token()).map_err(|err| Error::Authorization {\n\n source: Box::new(err),\n\n })\n\n}\n","file_path":"services/src/handlers/mod.rs","rank":64,"score":200010.8868835831},{"content":"enum FeaturesProvider<'a> {\n\n Layer(Layer<'a>),\n\n ResultSet(ResultSet<'a>),\n\n}\n\n\n\nimpl FeaturesProvider<'_> {\n\n fn layer_ref(&self) -> &Layer {\n\n match self {\n\n FeaturesProvider::Layer(l) => l,\n\n FeaturesProvider::ResultSet(r) => &**r,\n\n }\n\n }\n\n\n\n fn set_spatial_filter(&mut self, spatial_bounds: &BoundingBox2D) {\n\n match self {\n\n FeaturesProvider::Layer(l) => {\n\n l.set_spatial_filter_rect(\n\n spatial_bounds.lower_left().x,\n\n spatial_bounds.lower_left().y,\n\n spatial_bounds.upper_right().x,\n","file_path":"operators/src/source/ogr_source/mod.rs","rank":65,"score":199142.45313313277},{"content":"/// A version of `suggest_pixel_size_from_diag_cross` that takes a `partition` and a projected counterpart as input\n\npub fn suggest_pixel_size_from_diag_cross_projected<B: AxisAlignedRectangle>(\n\n bbox: B,\n\n bbox_projected: B,\n\n spatial_resolution: SpatialResolution,\n\n) -> Result<SpatialResolution> {\n\n let diag_pixels = euclidian_pixel_distance(bbox, spatial_resolution)?;\n\n\n\n let proj_ul_lr_distance =\n\n diag_distance(bbox_projected.upper_left(), bbox_projected.lower_right());\n\n\n\n let proj_ll_ur_distance =\n\n diag_distance(bbox_projected.lower_left(), bbox_projected.upper_right());\n\n\n\n let min_dist_r = proj_ul_lr_distance.min(proj_ll_ur_distance);\n\n\n\n Ok(SpatialResolution::new_unchecked(\n\n min_dist_r / diag_pixels,\n\n min_dist_r / diag_pixels,\n\n ))\n\n}\n\n\n","file_path":"datatypes/src/operations/reproject.rs","rank":66,"score":198530.45833778783},{"content":"fn detect_vector_geometry(dataset: &Dataset) -> DetectedGeometry {\n\n for layer in dataset.layers() {\n\n for g in layer.defn().geom_fields() {\n\n if let Ok(data_type) = VectorDataType::try_from_ogr_type_code(g.field_type()) {\n\n return DetectedGeometry {\n\n layer_name: Some(layer.name()),\n\n data_type,\n\n spatial_reference: g\n\n .spatial_ref()\n\n .context(error::Gdal)\n\n .and_then(|s| {\n\n let s: Result<SpatialReference> = s.try_into().context(error::DataType);\n\n s\n\n })\n\n .map(Into::into)\n\n .unwrap_or(SpatialReferenceOption::Unreferenced),\n\n };\n\n }\n\n }\n\n }\n\n\n\n // fallback type if no geometry was found\n\n DetectedGeometry {\n\n layer_name: None,\n\n data_type: VectorDataType::Data,\n\n spatial_reference: SpatialReferenceOption::Unreferenced,\n\n }\n\n}\n\n\n","file_path":"services/src/handlers/datasets.rs","rank":67,"score":198042.24228089413},{"content":"pub fn first_tile_fold_future<T>(\n\n accu: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\n\nwhere\n\n T: Pixel,\n\n{\n\n tokio::task::spawn_blocking(|| first_tile_fold_fn(accu, tile)).then(move |x| async move {\n\n match x {\n\n Ok(r) => Ok(r),\n\n Err(e) => Err(e.into()),\n\n }\n\n })\n\n}\n\n\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":68,"score":197510.6250240963},{"content":"pub fn last_tile_fold_future<T>(\n\n accu: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\n\nwhere\n\n T: Pixel,\n\n{\n\n tokio::task::spawn_blocking(|| last_tile_fold_fn(accu, tile)).then(move |x| async move {\n\n match x {\n\n Ok(r) => Ok(r),\n\n Err(e) => Err(e.into()),\n\n }\n\n })\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct TemporalRasterAggregationTileAccu<T> {\n\n accu_tile: RasterTile2D<T>,\n\n initial_state: bool,\n\n pool: Arc<ThreadPool>,\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":69,"score":197510.6250240963},{"content":"/// Deserialize a base URL by enforcing a trailing slash and then parsing it as a URL.\n\npub fn deserialize_base_url<'de, D>(deserializer: D) -> Result<Url, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let mut url_string = String::deserialize(deserializer)?;\n\n\n\n if !url_string.ends_with('/') {\n\n url_string.push('/');\n\n }\n\n\n\n Url::parse(&url_string).map_err(D::Error::custom)\n\n}\n\n\n","file_path":"services/src/util/parsing.rs","rank":70,"score":196284.360216158},{"content":"pub fn fold_future<T, C>(\n\n accu: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\n\nwhere\n\n T: Pixel,\n\n C: AccFunction,\n\n{\n\n tokio::task::spawn_blocking(|| fold_fn::<T, C>(accu, tile)).then(|x| async move {\n\n match x {\n\n Ok(r) => Ok(r),\n\n Err(e) => Err(e.into()),\n\n }\n\n })\n\n}\n\n\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":71,"score":195864.41110938552},{"content":"/// Method to generate a default `Colorizer`.\n\n///\n\n/// # Panics\n\n/// If T has no min max value\n\npub fn default_colorizer_gradient<T: Pixel>() -> Result<Colorizer> {\n\n Colorizer::linear_gradient(\n\n vec![\n\n (AsPrimitive::<f64>::as_(T::min_value()), RgbaColor::black())\n\n .try_into()\n\n .unwrap(),\n\n (AsPrimitive::<f64>::as_(T::max_value()), RgbaColor::white())\n\n .try_into()\n\n .unwrap(),\n\n ],\n\n RgbaColor::transparent(),\n\n RgbaColor::pink(),\n\n )\n\n .map_err(error::Error::from)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use geoengine_datatypes::{\n\n primitives::{Coordinate2D, SpatialPartition2D, SpatialResolution},\n","file_path":"operators/src/util/raster_stream_to_png.rs","rank":72,"score":194400.19886857702},{"content":"/// Common functionality for slice data types\n\npub trait GenericSliceType: Sized + OclPrm {\n\n const TYPE: SliceDataType;\n\n\n\n fn create_typed_slice_ref(slice: &[Self]) -> TypedSliceRef;\n\n\n\n fn create_typed_slice_mut(slice: &mut [Self]) -> TypedSliceMut;\n\n\n\n fn create_slice_output_buffer(buffer: Buffer<Self>) -> SliceOutputBuffer;\n\n}\n\n\n\n/// Implement `GenericSliceType` in a concise way\n\nmacro_rules! generic_slice_type_impl {\n\n ($type:ty, $variant:ident) => {\n\n impl GenericSliceType for $type {\n\n const TYPE: SliceDataType = SliceDataType::$variant;\n\n\n\n fn create_typed_slice_ref(slice: &[Self]) -> TypedSliceRef {\n\n TypedSliceRef::$variant(slice)\n\n }\n\n\n","file_path":"operators/src/opencl/typed_slice.rs","rank":73,"score":191984.46480356448},{"content":"/// Create a rayon thread pool with the given number of threads.\n\n/// Use `num_threads = 0` for auto number of threads.\n\npub fn create_rayon_thread_pool(num_threads: usize) -> Arc<ThreadPool> {\n\n rayon_destroy_global_thread_pool();\n\n\n\n let thread_pool = ThreadPoolBuilder::new()\n\n .num_threads(num_threads)\n\n .build()\n\n .expect(\"Thread Pool must be initializable\");\n\n\n\n Arc::new(thread_pool)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n #[should_panic(\n\n expected = \"The global thread pool has not been initialized.: ThreadPoolBuildError { kind: GlobalPoolAlreadyInitialized }\"\n\n )]\n\n fn global_rayon_fail() {\n","file_path":"operators/src/util/rayon.rs","rank":74,"score":191635.48296917515},{"content":"#[async_trait]\n\npub trait MetaData<L, R, Q>: Debug + Send + Sync\n\nwhere\n\n R: ResultDescriptor,\n\n{\n\n async fn loading_info(&self, query: Q) -> Result<L>;\n\n async fn result_descriptor(&self) -> Result<R>;\n\n\n\n fn box_clone(&self) -> Box<dyn MetaData<L, R, Q>>;\n\n}\n\n\n\nimpl<L, R, Q> Clone for Box<dyn MetaData<L, R, Q>>\n\nwhere\n\n R: ResultDescriptor,\n\n{\n\n fn clone(&self) -> Box<dyn MetaData<L, R, Q>> {\n\n self.box_clone()\n\n }\n\n}\n\n\n\npub struct MockExecutionContext {\n","file_path":"operators/src/engine/execution_context.rs","rank":75,"score":190929.5178101398},{"content":"pub fn no_data_ignoring_fold_future<T, C>(\n\n accu: TemporalRasterAggregationTileAccu<T>,\n\n tile: RasterTile2D<T>,\n\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\n\nwhere\n\n T: Pixel,\n\n C: NoDataIgnoringAccFunction,\n\n{\n\n tokio::task::spawn_blocking(|| no_data_ignoring_fold_fn::<T, C>(accu, tile)).then(\n\n |x| async move {\n\n match x {\n\n Ok(r) => Ok(r),\n\n Err(e) => Err(e.into()),\n\n }\n\n },\n\n )\n\n}\n\n\n","file_path":"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs","rank":76,"score":190822.9997870841},{"content":"#[inline(never)]\n\nfn bench_raster_operator<'a, Q, T, F, C, B>(\n\n bench_id: &'static str,\n\n named_querys: Q,\n\n tiling_specs: T,\n\n named_operator: Box<dyn RasterOperator>,\n\n context_builder: F,\n\n chunk_byte_size: B,\n\n num_threads: C,\n\n) where\n\n F: Fn(TilingSpecification, usize) -> MockExecutionContext,\n\n C: IntoIterator<Item = &'a usize> + Clone,\n\n Q: IntoIterator<Item = &'a (&'static str, RasterQueryRectangle)> + Clone,\n\n T: IntoIterator<Item = &'a TilingSpecification> + Clone,\n\n B: IntoIterator<Item = &'a ChunkByteSize> + Clone,\n\n{\n\n let run_time = tokio::runtime::Runtime::new().unwrap();\n\n\n\n for current_threads in num_threads.into_iter() {\n\n for tiling_spec in tiling_specs.clone().into_iter() {\n\n let exe_ctx = (context_builder)(*tiling_spec, *current_threads);\n","file_path":"operators/benches/workflows.rs","rank":77,"score":189562.21279239355},{"content":"/// Deserialize an optional base URL by enforcing a trailing slash and then parsing it as a URL.\n\npub fn deserialize_base_url_option<'de, D>(deserializer: D) -> Result<Option<Url>, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let mut url_string = if let Some(url_string) = Option::<String>::deserialize(deserializer)? {\n\n url_string\n\n } else {\n\n return Ok(None);\n\n };\n\n\n\n if !url_string.ends_with('/') {\n\n url_string.push('/');\n\n }\n\n\n\n Url::parse(&url_string)\n\n .map(Option::Some)\n\n .map_err(D::Error::custom)\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"services/src/util/parsing.rs","rank":78,"score":189426.54525202847},{"content":"#[allow(clippy::float_cmp)] // allow since NO DATA is a specific value\n\nfn process_raster(number_statistics: &mut NumberStatistics, tile_grid: &Grid2D<f64>) {\n\n let no_data_value = tile_grid.no_data_value();\n\n\n\n if let Some(no_data_value) = no_data_value {\n\n for &value in &tile_grid.data {\n\n if value == no_data_value {\n\n number_statistics.add_no_data();\n\n } else {\n\n number_statistics.add(value);\n\n }\n\n }\n\n } else {\n\n for &value in &tile_grid.data {\n\n number_statistics.add(value);\n\n }\n\n }\n\n}\n\n\n\n/// The statistics summary output type for each raster input\n","file_path":"operators/src/plot/statistics.rs","rank":79,"score":188497.20704246726},{"content":"fn adjust_user_path_to_upload_path(meta: &mut MetaDataDefinition, upload: &Upload) -> Result<()> {\n\n match meta {\n\n crate::datasets::storage::MetaDataDefinition::MockMetaData(_) => {}\n\n crate::datasets::storage::MetaDataDefinition::OgrMetaData(m) => {\n\n m.loading_info.file_name = upload.adjust_file_path(&m.loading_info.file_name)?;\n\n }\n\n crate::datasets::storage::MetaDataDefinition::GdalMetaDataRegular(m) => {\n\n m.params.file_path = upload.adjust_file_path(&m.params.file_path)?;\n\n }\n\n crate::datasets::storage::MetaDataDefinition::GdalStatic(m) => {\n\n m.params.file_path = upload.adjust_file_path(&m.params.file_path)?;\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n\n/// Creates a new [Dataset](AutoCreateDataset) using previously uploaded files.\n\n/// The format of the files will be automatically detected when possible.\n\n///\n\n/// # Example\n","file_path":"services/src/handlers/datasets.rs","rank":80,"score":188345.23605089518},{"content":"/// Marker trait for geometry types\n\n// TODO: rename to CollectionType oder something?…\n\npub trait Geometry: Clone + Debug + Send + Sync + TryFrom<TypedGeometry, Error = Error> {\n\n // TODO: introduce once generic associated types are possible due to lifetime introduction for ref type\n\n // type REF: GeometryRef;\n\n\n\n const IS_GEOMETRY: bool = true;\n\n\n\n // move to primitives module?\n\n const DATA_TYPE: VectorDataType;\n\n\n\n /// Is the geometry overlapping the `BoundingBox2D`?\n\n fn intersects_bbox(&self, bbox: &BoundingBox2D) -> bool;\n\n}\n\n\n","file_path":"datatypes/src/primitives/geometry.rs","rank":81,"score":186689.53906713135},{"content":"/// This method calculates a suggested pixel size for the translation of a raster into a different projection.\n\n/// The source raster is described using a `BoundingBox2D` and a pixel size as `SpatialResolution`.\n\n/// A suggested pixel size is calculated using the approach used by GDAL:\n\n/// The upper left and the lower right coordinates of the bounding box are projected in the target SRS.\n\n/// Then, the distance between both points in the target SRS is devided by the distance in pixels of the source.\n\npub fn suggest_pixel_size_like_gdal<P: CoordinateProjection, B: AxisAlignedRectangle>(\n\n bbox: B,\n\n spatial_resolution: SpatialResolution,\n\n projector: &P,\n\n) -> Result<SpatialResolution> {\n\n let diag_pixels = euclidian_pixel_distance(bbox, spatial_resolution)?;\n\n\n\n let proj_ul_lr_distance =\n\n projected_diag_distance(bbox.upper_left(), bbox.lower_right(), projector)?;\n\n\n\n // derive the pixel size by deviding srs unit distance by pixel distance in the source bbox\n\n let proj_ul_lr_pixel_size = proj_ul_lr_distance / diag_pixels;\n\n Ok(SpatialResolution::new_unchecked(\n\n proj_ul_lr_pixel_size,\n\n proj_ul_lr_pixel_size,\n\n ))\n\n}\n\n\n","file_path":"datatypes/src/operations/reproject.rs","rank":82,"score":186407.67424335488},{"content":"/// This approach uses the GDAL way to suggest the pixel size. However, we check both diagonals and take the smaller one.\n\n/// This method fails if the bbox cannot be projected\n\npub fn suggest_pixel_size_from_diag_cross<P: CoordinateProjection, B: AxisAlignedRectangle>(\n\n bbox: B,\n\n spatial_resolution: SpatialResolution,\n\n projector: &P,\n\n) -> Result<SpatialResolution> {\n\n let diag_pixels = euclidian_pixel_distance(bbox, spatial_resolution)?;\n\n\n\n let proj_ul_lr_distance =\n\n projected_diag_distance(bbox.upper_left(), bbox.lower_right(), projector);\n\n\n\n let proj_ll_ur_distance =\n\n projected_diag_distance(bbox.lower_left(), bbox.upper_right(), projector);\n\n\n\n let min_dist_r = match (proj_ul_lr_distance, proj_ll_ur_distance) {\n\n (Ok(ul_lr), Ok(ll_ur)) => Ok(ul_lr.min(ll_ur)),\n\n (Ok(ul_lr), Err(_)) => Ok(ul_lr),\n\n (Err(_), Ok(ll_ur)) => Ok(ll_ur),\n\n (Err(e), Err(_)) => Err(e),\n\n };\n\n\n\n min_dist_r.map(|d| SpatialResolution::new_unchecked(d / diag_pixels, d / diag_pixels))\n\n}\n\n\n","file_path":"datatypes/src/operations/reproject.rs","rank":83,"score":186401.92898839817},{"content":"fn new_slope_key() -> RasterPropertiesKey {\n\n RasterPropertiesKey {\n\n domain: Some(\"msg\".into()),\n\n key: \"calibration_slope\".into(),\n\n }\n\n}\n\n\n","file_path":"operators/src/processing/meteosat/mod.rs","rank":84,"score":186196.8211694727},{"content":"fn new_offset_key() -> RasterPropertiesKey {\n\n RasterPropertiesKey {\n\n domain: Some(\"msg\".into()),\n\n key: \"calibration_offset\".into(),\n\n }\n\n}\n\n\n","file_path":"operators/src/processing/meteosat/mod.rs","rank":85,"score":186196.8211694727},{"content":"fn new_channel_key() -> RasterPropertiesKey {\n\n RasterPropertiesKey {\n\n domain: Some(\"msg\".into()),\n\n key: \"channel_number\".into(),\n\n }\n\n}\n\n\n","file_path":"operators/src/processing/meteosat/mod.rs","rank":86,"score":186196.8211694727},{"content":"fn new_satellite_key() -> RasterPropertiesKey {\n\n RasterPropertiesKey {\n\n domain: Some(\"msg\".into()),\n\n key: \"satellite_number\".into(),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test_util {\n\n use chrono::{TimeZone, Utc};\n\n use futures::StreamExt;\n\n use geoengine_datatypes::hashmap;\n\n use geoengine_datatypes::util::test::TestDefault;\n\n use num_traits::AsPrimitive;\n\n\n\n use geoengine_datatypes::dataset::{DatasetId, InternalDatasetId};\n\n use geoengine_datatypes::primitives::{\n\n Measurement, RasterQueryRectangle, SpatialPartition2D, SpatialResolution, TimeGranularity,\n\n TimeInstance, TimeInterval, TimeStep,\n\n };\n","file_path":"operators/src/processing/meteosat/mod.rs","rank":87,"score":186196.8211694727},{"content":"/// Provides the intersection method\n\npub trait GridIntersection<Rhs = Self, Out = Self> {\n\n // Returns true if Self intesects Rhs\n\n fn intersection(&self, other: &Rhs) -> Option<Out>;\n\n}\n\n\n","file_path":"datatypes/src/raster/grid_traits.rs","rank":88,"score":185396.6730615497},{"content":"#[derive(Clone, Debug)]\n\nstruct NFDIMetaData<L, R, Q>\n\nwhere\n\n L: Debug + Clone + Send + Sync + ExpiringDownloadLink + 'static,\n\n R: Debug + Send + Sync + 'static + ResultDescriptor,\n\n Q: Debug + Clone + Send + Sync + 'static,\n\n{\n\n result_descriptor: R,\n\n object_id: String,\n\n template: L,\n\n object_stub: ObjectLoadServiceClient<InterceptedService<Channel, APITokenInterceptor>>,\n\n _phantom: PhantomData<Q>,\n\n}\n\n\n\n#[async_trait::async_trait]\n\nimpl<L, R, Q> MetaData<L, R, Q> for NFDIMetaData<L, R, Q>\n\nwhere\n\n L: Debug + Clone + Send + Sync + ExpiringDownloadLink + 'static,\n\n R: Debug + Send + Sync + 'static + ResultDescriptor,\n\n Q: Debug + Clone + Send + Sync + 'static,\n\n{\n","file_path":"services/src/datasets/external/nfdi/mod.rs","rank":89,"score":183603.2635448649},{"content":"// TODO: raster pixel access is currently modeled similar to numpy/ndarray with ..,z,y,x\n\n// TODO: move these functions to base raster (?)\n\n/// Map an image's (x, y) values to the grid cells of a raster.\n\nfn image_pixel_to_raster_pixel<ImagePixelType>(\n\n x: ImagePixelType,\n\n y: ImagePixelType,\n\n scale_x: f64,\n\n scale_y: f64,\n\n) -> (isize, isize)\n\nwhere\n\n ImagePixelType: Into<f64>,\n\n{\n\n debug_assert!(\n\n scale_x > 0. && scale_y > 0.,\n\n \"scale values must be positive\"\n\n );\n\n\n\n let cell_x = (((x.into() + 0.5) * scale_x) - 0.5).round();\n\n let cell_y = (((y.into() + 0.5) * scale_y) - 0.5).round();\n\n (cell_x as isize, cell_y as isize)\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"datatypes/src/operations/image/to_png.rs","rank":90,"score":183494.66576145403},{"content":"fn random_points<T: Rng>(rng: &mut T, num_points: usize) -> MultiPointCollection {\n\n let coordinates = (0..num_points)\n\n .into_iter()\n\n .map(|_| (rng.gen_range(0.0..100.0), rng.gen_range(0.0..100.0)))\n\n .collect::<Vec<_>>();\n\n\n\n let time = vec![TimeInterval::default(); num_points];\n\n\n\n MultiPointCollection::from_data(\n\n MultiPoint::many(coordinates).unwrap(),\n\n time,\n\n Default::default(),\n\n )\n\n .unwrap()\n\n}\n\n\n","file_path":"operators/benches/pip.rs","rank":91,"score":183428.56634211523},{"content":"struct InitializedMockDatasetDataSource<R: ResultDescriptor, Q> {\n\n result_descriptor: R,\n\n loading_info: Box<dyn MetaData<MockDatasetDataSourceLoadingInfo, R, Q>>,\n\n}\n\n\n\nimpl InitializedVectorOperator\n\n for InitializedMockDatasetDataSource<VectorResultDescriptor, VectorQueryRectangle>\n\n{\n\n fn query_processor(&self) -> Result<TypedVectorQueryProcessor> {\n\n Ok(TypedVectorQueryProcessor::MultiPoint(\n\n MockDatasetDataSourceProcessor {\n\n loading_info: self.loading_info.clone(),\n\n }\n\n .boxed(),\n\n ))\n\n }\n\n\n\n fn result_descriptor(&self) -> &VectorResultDescriptor {\n\n &self.result_descriptor\n\n }\n","file_path":"operators/src/mock/mock_dataset_data_source.rs","rank":92,"score":183355.17986775946},{"content":"// use `TryFrom` in `datatypes` if this is used on more than one occasion\n\npub trait TryFromOgrGeometry: Sized {\n\n fn try_from(geometry: Result<&gdal::vector::Geometry>) -> Result<Self>;\n\n}\n\n\n\n/// Implement direct conversions from OGR geometries to our geometries\n\n/// Unfortunately, we cannot convert to `geo`'s geometries since the implementation panics on unknown types.\n\nimpl TryFromOgrGeometry for MultiPoint {\n\n fn try_from(geometry: Result<&gdal::vector::Geometry>) -> Result<Self> {\n\n fn coordinate(geometry: &gdal::vector::Geometry) -> Coordinate2D {\n\n let (x, y, _) = geometry.get_point(0);\n\n Coordinate2D::new(x, y)\n\n }\n\n\n\n let geometry = geometry?;\n\n\n\n match geometry.geometry_type() {\n\n OGRwkbGeometryType::wkbPoint => Ok(MultiPoint::new(vec![coordinate(geometry)])?),\n\n OGRwkbGeometryType::wkbMultiPoint => {\n\n let coordinates = (0..geometry.geometry_count())\n\n .map(|i| coordinate(&unsafe { geometry.get_unowned_geometry(i) }))\n","file_path":"operators/src/source/ogr_source/mod.rs","rank":93,"score":183280.60946854317},{"content":"pub trait FirstValueOutputType {\n\n fn feature_data_type() -> FeatureDataType;\n\n fn typed_aggregator(aggregator: FirstValueAggregator<Self>) -> TypedAggregator\n\n where\n\n Self: Sized;\n\n}\n\n\n\nimpl FirstValueOutputType for i64 {\n\n fn feature_data_type() -> FeatureDataType {\n\n FeatureDataType::Int\n\n }\n\n\n\n fn typed_aggregator(aggregator: FirstValueAggregator<Self>) -> TypedAggregator {\n\n TypedAggregator::FirstValueInt(aggregator)\n\n }\n\n}\n\n\n\nimpl FirstValueOutputType for f64 {\n\n fn feature_data_type() -> FeatureDataType {\n\n FeatureDataType::Float\n","file_path":"operators/src/processing/raster_vector_join/aggregator.rs","rank":94,"score":182996.8443245715},{"content":"/// parse coordinate, format is \"x,y\"\n\npub fn parse_coordinate<'de, D>(deserializer: D) -> Result<Coordinate2D, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n\n\n let split: Vec<Result<f64, std::num::ParseFloatError>> = s.split(',').map(str::parse).collect();\n\n\n\n match *split.as_slice() {\n\n [Ok(x), Ok(y)] => Ok(Coordinate2D::new(x, y)),\n\n _ => Err(D::Error::custom(\"Invalid coordinate\")),\n\n }\n\n}\n\n\n","file_path":"services/src/ogc/util.rs","rank":95,"score":182243.69444607702},{"content":"/// Parse the time string of a WMS request\n\n/// time is specified in ISO8601, it can either be an instant (single datetime) or an interval\n\n/// An interval is separated by \"/\". \"Either the start value or the end value can be omitted to\n\n/// indicate no restriction on time in that direction.\"\n\n/// sources: - <http://docs.geoserver.org/2.8.x/en/user/services/wms/time.html#wms-time>\n\n/// - <http://www.ogcnetwork.net/node/178>\n\npub fn parse_time<'de, D>(deserializer: D) -> Result<TimeInterval, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n // TODO: support relative time intervals\n\n\n\n let s = String::deserialize(deserializer)?;\n\n parse_time_from_str::<D>(&s)\n\n}\n\n\n","file_path":"services/src/ogc/util.rs","rank":96,"score":182243.69444607705},{"content":"/// Create an `arrow` struct from column meta data and data\n\npub fn struct_array_from_data(\n\n columns: Vec<Field>,\n\n column_values: Vec<ArrayRef>,\n\n number_of_features: usize,\n\n) -> Result<StructArray> {\n\n Ok(StructArray::from(\n\n ArrayData::builder(arrow::datatypes::DataType::Struct(columns))\n\n .child_data(\n\n column_values\n\n .into_iter()\n\n .map(|a| a.data().clone())\n\n .collect(),\n\n )\n\n .len(number_of_features)\n\n .build()?,\n\n ))\n\n}\n\n\n","file_path":"datatypes/src/collections/feature_collection.rs","rank":97,"score":180000.6982706891},{"content":"/// Parse bbox, format is: \"x1,y1,x2,y2\"\n\npub fn parse_bbox<'de, D>(deserializer: D) -> Result<BoundingBox2D, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n\n\n let split: Vec<Result<f64, std::num::ParseFloatError>> = s.split(',').map(str::parse).collect();\n\n\n\n if let [Ok(x1), Ok(y1), Ok(x2), Ok(y2)] = *split.as_slice() {\n\n BoundingBox2D::new(Coordinate2D::new(x1, y1), Coordinate2D::new(x2, y2))\n\n .map_err(D::Error::custom)\n\n } else {\n\n Err(D::Error::custom(\"Invalid bbox\"))\n\n }\n\n}\n\n\n","file_path":"services/src/ogc/util.rs","rank":98,"score":179619.79926248046},{"content":"/// Parse the `SpatialResolution` of a request by parsing `x,y`, e.g. `0.1,0.1`.\n\npub fn parse_spatial_resolution<'de, D>(deserializer: D) -> Result<SpatialResolution, D::Error>\n\nwhere\n\n D: serde::Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n\n\n let split: Result<Vec<f64>, <f64 as FromStr>::Err> = s.split(',').map(f64::from_str).collect();\n\n\n\n match split.as_ref().map(Vec::as_slice) {\n\n Ok(&[x, y]) => SpatialResolution::new(x, y).map_err(D::Error::custom),\n\n Err(error) => Err(D::Error::custom(error)),\n\n Ok(..) => Err(D::Error::custom(\"Invalid spatial resolution\")),\n\n }\n\n}\n\n\n","file_path":"services/src/util/parsing.rs","rank":99,"score":179619.79926248046}],"string":"[\n {\n \"content\": \"// TODO: move test helper somewhere else?\\n\\npub fn add_ndvi_dataset(ctx: &mut MockExecutionContext) -> DatasetId {\\n\\n let id: DatasetId = InternalDatasetId::new().into();\\n\\n ctx.add_meta_data(id.clone(), Box::new(create_ndvi_meta_data()));\\n\\n id\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/util/gdal.rs\",\n \"rank\": 0,\n \"score\": 347120.72459160676\n },\n {\n \"content\": \"pub fn fn_stream() -> impl Stream<Item = usize> {\\n\\n let mut counter: usize = 2;\\n\\n\\n\\n stream::poll_fn(move |_| -> Poll<Option<usize>> {\\n\\n if counter == 0 {\\n\\n return Poll::Ready(None);\\n\\n }\\n\\n counter -= 1;\\n\\n Poll::Ready(Some(counter))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/tests/streams.rs\",\n \"rank\": 1,\n \"score\": 344067.65860353963\n },\n {\n \"content\": \"pub fn catch_unwind_silent<F: FnOnce() -> R + panic::UnwindSafe, R>(\\n\\n f: F,\\n\\n) -> std::thread::Result<R> {\\n\\n let prev_hook = panic::take_hook();\\n\\n panic::set_hook(Box::new(|_| {}));\\n\\n let result = panic::catch_unwind(f);\\n\\n panic::set_hook(prev_hook);\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/test.rs\",\n \"rank\": 2,\n \"score\": 295790.70563735534\n },\n {\n \"content\": \"/// Serde deserializer for booleans with case insensitive strings\\n\\npub fn bool_option_case_insensitive<'de, D>(deserializer: D) -> Result<Option<bool>, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let s = <&str as serde::Deserialize>::deserialize(deserializer)?;\\n\\n if s.is_empty() {\\n\\n Ok(None)\\n\\n } else {\\n\\n bool::from_str(&s.to_lowercase())\\n\\n .map(Some)\\n\\n .map_err(|_error| {\\n\\n D::Error::custom(format_args!(\\\"could not parse string as boolean: {}\\\", s))\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod mod_tests {\\n\\n use super::*;\\n\\n\\n\",\n \"file_path\": \"services/src/util/mod.rs\",\n \"rank\": 3,\n \"score\": 292854.6287424605\n },\n {\n \"content\": \"/// Opens a Gdal Dataset with the given `path`.\\n\\n/// Other crates should use this method for Gdal Dataset access as a workaround to avoid strange errors.\\n\\npub fn gdal_open_dataset(path: &Path) -> Result<Dataset> {\\n\\n gdal_open_dataset_ex(path, DatasetOptions::default())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/util/gdal.rs\",\n \"rank\": 4,\n \"score\": 286868.1285375535\n },\n {\n \"content\": \"/// Create a `RasterResultDescriptor` for the given `band` and `dataset`. If the raster data type is\\n\\n/// unknown, the default is F64 unless it is otherwise specified by `default_data_type`. If the data\\n\\n/// type is a complex floating point type, an error is returned\\n\\npub fn raster_descriptor_from_dataset(\\n\\n dataset: &Dataset,\\n\\n band: isize,\\n\\n default_data_type: Option<RasterDataType>,\\n\\n) -> Result<RasterResultDescriptor> {\\n\\n let rasterband = &dataset.rasterband(band)?;\\n\\n\\n\\n let spatial_ref: SpatialReference =\\n\\n dataset.spatial_ref()?.try_into().context(error::DataType)?;\\n\\n\\n\\n let data_type = match rasterband.band_type() {\\n\\n GDALDataType::GDT_Byte => RasterDataType::U8,\\n\\n GDALDataType::GDT_UInt16 => RasterDataType::U16,\\n\\n GDALDataType::GDT_Int16 => RasterDataType::I16,\\n\\n GDALDataType::GDT_UInt32 => RasterDataType::U32,\\n\\n GDALDataType::GDT_Int32 => RasterDataType::I32,\\n\\n GDALDataType::GDT_Float32 => RasterDataType::F32,\\n\\n GDALDataType::GDT_Float64 => RasterDataType::F64,\\n\\n GDALDataType::GDT_Unknown => default_data_type.unwrap_or(RasterDataType::F64),\\n\\n _ => return Err(Error::GdalRasterDataTypeNotSupported),\\n\\n };\\n\\n\\n\\n Ok(RasterResultDescriptor {\\n\\n data_type,\\n\\n spatial_reference: spatial_ref.into(),\\n\\n measurement: Measurement::Unitless,\\n\\n no_data_value: rasterband.no_data_value(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/util/gdal.rs\",\n \"rank\": 5,\n \"score\": 279600.7755940977\n },\n {\n \"content\": \"/// Create `GdalDatasetParameters` from the infos in the given `dataset` and its `band`.\\n\\n/// `path` is the location of the actual data, `band_out` allows optionally specifying a different\\n\\n/// band in the resulting parameters, otherwise `band` is used.\\n\\npub fn gdal_parameters_from_dataset(\\n\\n dataset: &Dataset,\\n\\n band: usize,\\n\\n path: &Path,\\n\\n band_out: Option<usize>,\\n\\n open_options: Option<Vec<String>>,\\n\\n) -> Result<GdalDatasetParameters> {\\n\\n let rasterband = &dataset.rasterband(band as isize)?;\\n\\n\\n\\n Ok(GdalDatasetParameters {\\n\\n file_path: PathBuf::from(path),\\n\\n rasterband_channel: band_out.unwrap_or(band),\\n\\n geo_transform: dataset.geo_transform().context(error::Gdal)?.into(),\\n\\n file_not_found_handling: FileNotFoundHandling::Error,\\n\\n no_data_value: rasterband.no_data_value(),\\n\\n properties_mapping: None,\\n\\n width: rasterband.x_size(),\\n\\n height: rasterband.y_size(),\\n\\n gdal_open_options: open_options,\\n\\n gdal_config_options: None,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"operators/src/util/gdal.rs\",\n \"rank\": 6,\n \"score\": 279600.3344375393\n },\n {\n \"content\": \"/// Opens a Gdal Dataset with the given `path` and `dataset_options`.\\n\\n/// Other crates should use this method for Gdal Dataset access as a workaround to avoid strange errors.\\n\\npub fn gdal_open_dataset_ex(path: &Path, dataset_options: DatasetOptions) -> Result<Dataset> {\\n\\n #[cfg(debug_assertions)]\\n\\n let dataset_options = {\\n\\n let mut dataset_options = dataset_options;\\n\\n dataset_options.open_flags |= gdal::GdalOpenFlags::GDAL_OF_VERBOSE_ERROR;\\n\\n dataset_options\\n\\n };\\n\\n\\n\\n Dataset::open_ex(path, dataset_options).context(error::Gdal)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/util/gdal.rs\",\n \"rank\": 7,\n \"score\": 272131.15636430745\n },\n {\n \"content\": \"/// A descriptor that contains information about the query result, for instance, the data type\\n\\n/// and spatial reference.\\n\\npub trait ResultDescriptor: Clone + Serialize {\\n\\n type DataType;\\n\\n\\n\\n /// Return the type-specific result data type\\n\\n fn data_type(&self) -> Self::DataType;\\n\\n\\n\\n /// Return the spatial reference of the result\\n\\n fn spatial_reference(&self) -> SpatialReferenceOption;\\n\\n\\n\\n /// Map one descriptor to another one\\n\\n #[must_use]\\n\\n fn map<F>(&self, f: F) -> Self\\n\\n where\\n\\n F: Fn(&Self) -> Self,\\n\\n {\\n\\n f(self)\\n\\n }\\n\\n\\n\\n /// Map one descriptor to another one by modifying only the spatial reference\\n\\n #[must_use]\\n\",\n \"file_path\": \"operators/src/engine/result_descriptor.rs\",\n \"rank\": 8,\n \"score\": 264611.3795219799\n },\n {\n \"content\": \"pub fn fold_by_blit_impl<T>(\\n\\n accu: RasterTileAccu2D<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> Result<RasterTileAccu2D<T>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n let mut accu_tile = accu.tile;\\n\\n let pool = accu.pool;\\n\\n let t_union = accu_tile.time.union(&tile.time)?;\\n\\n\\n\\n accu_tile.time = t_union;\\n\\n\\n\\n if tile.grid_array.is_empty() && accu_tile.no_data_value() == tile.no_data_value() {\\n\\n return Ok(RasterTileAccu2D::new(accu_tile, pool));\\n\\n }\\n\\n\\n\\n let mut materialized_accu_tile = accu_tile.into_materialized_tile();\\n\\n\\n\\n let blit_tile = match materialized_accu_tile.blit(tile) {\\n\",\n \"file_path\": \"operators/src/adapters/raster_subquery/raster_subquery_adapter.rs\",\n \"rank\": 9,\n \"score\": 254013.58303681438\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\n#[allow(clippy::type_complexity)]\\n\\n#[allow(clippy::needless_pass_by_value)]\\n\\npub fn fold_by_coordinate_lookup_impl<T>(\\n\\n accu: TileWithProjectionCoordinates<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> Result<TileWithProjectionCoordinates<T>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n const MIN_ELEMENTS_IN_PAR_CHUNK: usize = 32 * 512; // this must never be smaller than 1\\n\\n let min_rows_in_par_chunk =\\n\\n num::integer::div_ceil(MIN_ELEMENTS_IN_PAR_CHUNK, tile.grid_array.axis_size_x()).max(1);\\n\\n\\n\\n // println!(\\\"fold_by_coordinate_lookup_impl {:?}\\\", &tile.tile_position);\\n\\n let mut accu = accu;\\n\\n let t_union = accu.accu_tile.time.union(&tile.time)?;\\n\\n\\n\\n accu.tile_mut().time = t_union;\\n\\n\\n\\n if tile.grid_array.is_empty() {\\n\\n return Ok(accu);\\n\\n }\\n\",\n \"file_path\": \"operators/src/adapters/raster_subquery/raster_subquery_reprojection.rs\",\n \"rank\": 10,\n \"score\": 250244.11494284432\n },\n {\n \"content\": \"pub fn create_feature_aggregator<P: Pixel>(\\n\\n number_of_features: usize,\\n\\n aggregation: FeatureAggregationMethod,\\n\\n) -> TypedAggregator {\\n\\n match aggregation {\\n\\n FeatureAggregationMethod::First => match P::TYPE {\\n\\n RasterDataType::U8\\n\\n | RasterDataType::U16\\n\\n | RasterDataType::U32\\n\\n | RasterDataType::U64\\n\\n | RasterDataType::I8\\n\\n | RasterDataType::I16\\n\\n | RasterDataType::I32\\n\\n | RasterDataType::I64 => FirstValueIntAggregator::new(number_of_features).into_typed(),\\n\\n RasterDataType::F32 | RasterDataType::F64 => {\\n\\n FirstValueFloatAggregator::new(number_of_features).into_typed()\\n\\n }\\n\\n },\\n\\n FeatureAggregationMethod::Mean => MeanValueAggregator::new(number_of_features).into_typed(),\\n\\n }\\n\",\n \"file_path\": \"operators/src/processing/raster_vector_join/mod.rs\",\n \"rank\": 11,\n \"score\": 249285.95854947463\n },\n {\n \"content\": \"/// Initialize a basic logger within tests.\\n\\n/// You should only use this for debugging.\\n\\n///\\n\\n/// # Panics\\n\\n/// This function will panic if the logger cannot be initialized.\\n\\n///\\n\\npub fn initialize_debugging_in_test() {\\n\\n Logger::try_with_str(\\\"debug\\\").unwrap().start().unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/util/tests.rs\",\n \"rank\": 12,\n \"score\": 245839.79539387822\n },\n {\n \"content\": \"/// Loop through an iterator by yielding the current and previous tuple. Starts with the\\n\\n/// (first, second) item, so the iterator must have more than one item to create an output.\\n\\nfn two_tuple_windows<I, T>(mut iter: I) -> impl Iterator<Item = (T, T)>\\n\\nwhere\\n\\n I: Iterator<Item = T>,\\n\\n T: Copy,\\n\\n{\\n\\n let mut last = iter.next();\\n\\n\\n\\n iter.map(move |item| {\\n\\n let output = (last.unwrap(), item);\\n\\n last = Some(item);\\n\\n output\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n use super::*;\\n\\n\\n\\n use geoengine_datatypes::primitives::{\\n\",\n \"file_path\": \"operators/src/processing/point_in_polygon.rs\",\n \"rank\": 13,\n \"score\": 243321.00956466407\n },\n {\n \"content\": \"/// Loop through an iterator by yielding the current and previous tuple. Starts with the\\n\\n/// (first, second) item, so the iterator must have more than one item to create an output.\\n\\nfn two_tuple_windows<I, T>(mut iter: I) -> impl Iterator<Item = (T, T)>\\n\\nwhere\\n\\n I: Iterator<Item = T>,\\n\\n T: Copy,\\n\\n{\\n\\n let mut last = iter.next();\\n\\n\\n\\n iter.map(move |item| {\\n\\n let output = (last.unwrap(), item);\\n\\n last = Some(item);\\n\\n output\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use geoengine_datatypes::primitives::MultiPolygon;\\n\\n\\n\\n use super::*;\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/point_in_polygon/tester.rs\",\n \"rank\": 14,\n \"score\": 239953.35022487916\n },\n {\n \"content\": \"/// Helper function to downcast a mutable arrow array from a builder\\n\\n///\\n\\n/// The caller must be sure of its type, otherwise it panics\\n\\n/// # Panics\\n\\n/// Panics if `array` is not of type `T`\\n\\n///\\n\\npub fn downcast_mut_array<T: Any>(array: &mut dyn ArrayBuilder) -> &mut T {\\n\\n array.as_any_mut().downcast_mut().unwrap() // must obey type\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/arrow.rs\",\n \"rank\": 15,\n \"score\": 235617.3096481622\n },\n {\n \"content\": \"#[test]\\n\\nfn fn_test() {\\n\\n let mut stream = block_on_stream(fn_stream());\\n\\n\\n\\n assert_eq!(stream.next(), Some(1));\\n\\n assert_eq!(stream.next(), Some(0));\\n\\n assert_eq!(stream.next(), None);\\n\\n}\\n\",\n \"file_path\": \"operators/tests/streams.rs\",\n \"rank\": 16,\n \"score\": 235099.20152713062\n },\n {\n \"content\": \"fn properties_from_band(properties: &mut RasterProperties, gdal_dataset: &GdalRasterBand) {\\n\\n if let Some(scale) = gdal_dataset.metadata_item(\\\"scale\\\", \\\"\\\") {\\n\\n properties.scale = scale.parse::<f64>().ok();\\n\\n };\\n\\n\\n\\n if let Some(offset) = gdal_dataset.metadata_item(\\\"offset\\\", \\\"\\\") {\\n\\n properties.offset = offset.parse::<f64>().ok();\\n\\n };\\n\\n\\n\\n if let Some(band_name) = gdal_dataset.metadata_item(\\\"band_name\\\", \\\"\\\") {\\n\\n properties.band_name = Some(band_name);\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::engine::{MockExecutionContext, MockQueryContext};\\n\\n use crate::test_data;\\n\\n use crate::util::gdal::add_ndvi_dataset;\\n\",\n \"file_path\": \"operators/src/source/gdal_source.rs\",\n \"rank\": 17,\n \"score\": 233932.40482885417\n },\n {\n \"content\": \"/// reorders the given tuple of coordinates, resolutions, etc. using the axis ordering for `spatial_reference` to give (x, y)\\n\\npub fn tuple_from_ogc_params(\\n\\n a: f64,\\n\\n b: f64,\\n\\n spatial_reference: SpatialReference,\\n\\n) -> Result<(f64, f64)> {\\n\\n match spatial_reference_specification(&spatial_reference.proj_string()?)?\\n\\n .axis_order\\n\\n .ok_or(error::Error::AxisOrderingNotKnownForSrs {\\n\\n srs_string: spatial_reference.srs_string(),\\n\\n })? {\\n\\n AxisOrder::EastNorth => Ok((a, b)),\\n\\n AxisOrder::NorthEast => Ok((b, a)),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use chrono::{TimeZone, Utc};\\n\\n use geoengine_datatypes::spatial_reference::SpatialReferenceAuthority;\\n\\n use serde::de::value::StringDeserializer;\\n\",\n \"file_path\": \"services/src/ogc/util.rs\",\n \"rank\": 18,\n \"score\": 233233.45555551935\n },\n {\n \"content\": \"#[allow(clippy::option_if_let_else)]\\n\\npub fn parse_type_names<'de, D>(deserializer: D) -> Result<TypeNames, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n\\n\\n if let Some(pos) = s.find(':') {\\n\\n let namespace = Some(s[..pos].to_string());\\n\\n let feature_type = s[pos + 1..].to_string();\\n\\n\\n\\n Ok(TypeNames {\\n\\n namespace,\\n\\n feature_type,\\n\\n })\\n\\n } else {\\n\\n Ok(TypeNames {\\n\\n namespace: None,\\n\\n feature_type: s,\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"services/src/ogc/wfs/request.rs\",\n \"rank\": 19,\n \"score\": 232647.52924960887\n },\n {\n \"content\": \"/// This trait extends `FeatureCollection` `Stream`s with Geo-Engine-specific functionality.\\n\\n///\\n\\npub trait FeatureCollectionStreamExt<CollectionType>:\\n\\n Stream<Item = Result<FeatureCollection<CollectionType>>>\\n\\nwhere\\n\\n CollectionType: Geometry + ArrowTyped + 'static,\\n\\n{\\n\\n /// Transforms a `Stream` of `FeatureCollection`s and merges them in a way that they\\n\\n /// are `chunk_size_bytes` large.\\n\\n fn merge_chunks(\\n\\n self,\\n\\n chunk_size_bytes: usize,\\n\\n ) -> FeatureCollectionChunkMerger<Fuse<Self>, CollectionType>\\n\\n where\\n\\n Self: Sized,\\n\\n {\\n\\n FeatureCollectionChunkMerger::new(self.fuse(), chunk_size_bytes)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: ?Sized, CollectionType: Geometry + ArrowTyped + 'static>\\n\\n FeatureCollectionStreamExt<CollectionType> for T\\n\\nwhere\\n\\n T: Stream<Item = Result<FeatureCollection<CollectionType>>>,\\n\\n{\\n\\n}\\n\",\n \"file_path\": \"operators/src/adapters/mod.rs\",\n \"rank\": 20,\n \"score\": 230679.1269518578\n },\n {\n \"content\": \"/// Get a lock for mutex and recover from poisoning\\n\\n/// TODO: proper poisoning handling\\n\\npub fn safe_lock_mutex<M, T>(lock: &M) -> MutexGuard<T>\\n\\nwhere\\n\\n M: Deref<Target = Mutex<T>>,\\n\\n{\\n\\n match lock.deref().lock() {\\n\\n Ok(guard) => guard,\\n\\n Err(poisoned) => poisoned.into_inner(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"operators/src/util/mod.rs\",\n \"rank\": 21,\n \"score\": 229585.7545117616\n },\n {\n \"content\": \"pub fn grid_eq_with_no_data<D, T>(g1: &Grid<D, T>, g2: &Grid<D, T>) -> bool\\n\\nwhere\\n\\n D: PartialEq,\\n\\n T: PartialEq + Copy,\\n\\n{\\n\\n if g1.data.len() != g2.data.len() || g1.shape.ne(&g2.shape) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n if !match (g1.no_data_value, g2.no_data_value) {\\n\\n (None, None) => true,\\n\\n (Some(_), None) => false,\\n\\n (_, Some(y)) => g1.is_no_data(y),\\n\\n } {\\n\\n return false;\\n\\n }\\n\\n\\n\\n for (l, r) in g1.data.iter().zip(g2.data.iter()) {\\n\\n if g1.is_no_data(*l) && g1.is_no_data(*r) {\\n\\n continue;\\n\\n }\\n\\n if l != r {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n true\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/test.rs\",\n \"rank\": 22,\n \"score\": 229331.63759966203\n },\n {\n \"content\": \"pub trait Blit<R> {\\n\\n fn blit(&mut self, source: R) -> Result<()>;\\n\\n}\\n\\n\\n\\nimpl<T: Pixel> Blit<RasterTile2D<T>> for MaterializedRasterTile2D<T> {\\n\\n /// Copy `source` raster pixels into this raster, fails if the rasters do not overlap\\n\\n #[allow(clippy::float_cmp)]\\n\\n fn blit(&mut self, source: RasterTile2D<T>) -> Result<()> {\\n\\n // TODO: same crs\\n\\n // TODO: allow approximately equal pixel sizes?\\n\\n // TODO: ensure pixels are aligned\\n\\n\\n\\n ensure!(\\n\\n (self.geo_transform().x_pixel_size() == source.geo_transform().x_pixel_size())\\n\\n && (self.geo_transform().y_pixel_size() == source.geo_transform().y_pixel_size()),\\n\\n error::Blit {\\n\\n details: \\\"Incompatible pixel size\\\"\\n\\n }\\n\\n );\\n\\n\\n\",\n \"file_path\": \"datatypes/src/raster/operations/blit.rs\",\n \"rank\": 23,\n \"score\": 227337.10872606016\n },\n {\n \"content\": \"/// Serde deserializer <https://docs.rs/serde_qs/0.6.0/serde_qs/index.html#flatten-workaround>\\n\\npub fn from_str<'de, D, S>(deserializer: D) -> Result<S, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n S: std::str::FromStr,\\n\\n{\\n\\n let s = <&str as serde::Deserialize>::deserialize(deserializer)?;\\n\\n S::from_str(s).map_err(|_error| D::Error::custom(\\\"could not parse string\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/util/mod.rs\",\n \"rank\": 24,\n \"score\": 226473.1536721012\n },\n {\n \"content\": \"pub fn eq_with_no_data<D, T>(g1: &GridOrEmpty<D, T>, g2: &GridOrEmpty<D, T>) -> bool\\n\\nwhere\\n\\n D: PartialEq,\\n\\n T: PartialEq + Copy,\\n\\n{\\n\\n match (g1, g2) {\\n\\n (GridOrEmpty::Grid(g1), GridOrEmpty::Grid(g2)) => grid_eq_with_no_data(g1, g2),\\n\\n (GridOrEmpty::Empty(g1), GridOrEmpty::Empty(g2)) => empty_grid_eq_with_no_data(g1, g2),\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/test.rs\",\n \"rank\": 25,\n \"score\": 226265.74274591956\n },\n {\n \"content\": \"#[must_use]\\n\\npub fn approx_eq_floats(left: &[f64], right: &[f64]) -> bool {\\n\\n if left.len() != right.len() {\\n\\n return false;\\n\\n }\\n\\n\\n\\n for (&l, &r) in left.iter().zip(right) {\\n\\n if !float_cmp::approx_eq!(f64, l, r) {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n\\n\\n true\\n\\n}\\n\\n\\n\\n/// Create hash maps by specifying key-value pairs\\n\\n#[macro_export]\\n\\nmacro_rules! hashmap {\\n\\n (@void $($x:tt)*) => (());\\n\\n (@count $($tts:expr),*) => (<[()]>::len(&[$(hashmap!(@void $tts)),*]));\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/helpers.rs\",\n \"rank\": 26,\n \"score\": 223385.28241302643\n },\n {\n \"content\": \"pub fn empty_grid_eq_with_no_data<D, T>(g1: &EmptyGrid<D, T>, g2: &EmptyGrid<D, T>) -> bool\\n\\nwhere\\n\\n D: PartialEq,\\n\\n T: PartialEq + Copy,\\n\\n{\\n\\n g1.shape.eq(&g2.shape) && g1.is_no_data(g2.no_data_value)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::raster::{EmptyGrid, Grid2D, GridShape2D};\\n\\n use crate::util::test::{empty_grid_eq_with_no_data, grid_eq_with_no_data};\\n\\n\\n\\n #[test]\\n\\n fn test_empty_grid_eq_with_no_data_integral_ok() {\\n\\n let d1: GridShape2D = [3, 2].into();\\n\\n let d2: GridShape2D = [3, 2].into();\\n\\n\\n\\n let ndv1 = 42;\\n\\n let ndv2 = 42;\\n\",\n \"file_path\": \"datatypes/src/util/test.rs\",\n \"rank\": 27,\n \"score\": 220445.58067403996\n },\n {\n \"content\": \"/// Parse bbox, format is: \\\"x1,y1,x2,y2\\\"\\n\\npub fn parse_ogc_bbox<'de, D>(deserializer: D) -> Result<OgcBoundingBox, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n\\n\\n let split: Vec<Result<f64, std::num::ParseFloatError>> = s.split(',').map(str::parse).collect();\\n\\n\\n\\n if let [Ok(x1), Ok(y1), Ok(x2), Ok(y2)] = *split.as_slice() {\\n\\n Ok(OgcBoundingBox {\\n\\n values: [x1, y1, x2, y2],\\n\\n })\\n\\n } else {\\n\\n Err(D::Error::custom(\\\"Invalid bbox\\\"))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/ogc/util.rs\",\n \"rank\": 28,\n \"score\": 218438.28639858324\n },\n {\n \"content\": \"/// Serde deserializer <https://docs.rs/serde_qs/0.6.0/serde_qs/index.html#flatten-workaround>\\n\\npub fn from_str_option<'de, D, S>(deserializer: D) -> Result<Option<S>, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n S: std::str::FromStr,\\n\\n{\\n\\n let s = <&str as serde::Deserialize>::deserialize(deserializer)?;\\n\\n if s.is_empty() {\\n\\n Ok(None)\\n\\n } else {\\n\\n S::from_str(s)\\n\\n .map(Some)\\n\\n .map_err(|_error| D::Error::custom(\\\"could not parse string\\\"))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/util/mod.rs\",\n \"rank\": 29,\n \"score\": 217808.46096524518\n },\n {\n \"content\": \"pub trait OperatorDatasets {\\n\\n /// Get the dataset ids of all the datasets involoved in this operator and its sources\\n\\n fn datasets(&self) -> Vec<DatasetId> {\\n\\n let mut datasets = vec![];\\n\\n self.datasets_collect(&mut datasets);\\n\\n datasets\\n\\n }\\n\\n\\n\\n fn datasets_collect(&self, datasets: &mut Vec<DatasetId>);\\n\\n}\\n\\n\\n\\n/// Common methods for `RasterOperator`s\\n\",\n \"file_path\": \"operators/src/engine/operator.rs\",\n \"rank\": 30,\n \"score\": 216248.35098962375\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"Bench_name, num_threads, chunk_byte_size, query_name, tilesize_x, tilesize_y, query_time (ns), tiles_produced, pixels_produced, stream_collect_time (ns) \\\");\\n\\n\\n\\n bench_gdal_source_operator_tile_size();\\n\\n bench_gdal_source_operator_with_expression_tile_size();\\n\\n bench_gdal_source_operator_with_identity_reprojection();\\n\\n bench_gdal_source_operator_with_4326_to_3857_reprojection();\\n\\n}\\n\",\n \"file_path\": \"operators/benches/workflows.rs\",\n \"rank\": 31,\n \"score\": 215683.75522770552\n },\n {\n \"content\": \"#[test]\\n\\nfn serialize() {\\n\\n let array = {\\n\\n let mut builder = Int32Builder::new(5);\\n\\n builder\\n\\n .append_slice(&(1..=5).collect::<Vec<i32>>())\\n\\n .unwrap();\\n\\n\\n\\n builder.finish()\\n\\n };\\n\\n\\n\\n assert_eq!(array.len(), 5);\\n\\n\\n\\n // no serialization of arrays by now\\n\\n let json = serde_json::to_string(array.values()).unwrap();\\n\\n\\n\\n assert_eq!(json, \\\"[1,2,3,4,5]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/tests/example-arrow.rs\",\n \"rank\": 32,\n \"score\": 215297.66424403517\n },\n {\n \"content\": \"/// create an axis aligned rectangle using the values \\\"a,b,c,d\\\" from OGC bbox-like parameters using the axis ordering for `spatial_reference`\\n\\npub fn rectangle_from_ogc_params<A: AxisAlignedRectangle>(\\n\\n values: [f64; 4],\\n\\n spatial_reference: SpatialReference,\\n\\n) -> Result<A> {\\n\\n let [a, b, c, d] = values;\\n\\n match spatial_reference_specification(&spatial_reference.proj_string()?)?\\n\\n .axis_order\\n\\n .ok_or(error::Error::AxisOrderingNotKnownForSrs {\\n\\n srs_string: spatial_reference.srs_string(),\\n\\n })? {\\n\\n AxisOrder::EastNorth => {\\n\\n A::from_min_max((a, b).into(), (c, d).into()).context(error::DataType)\\n\\n }\\n\\n AxisOrder::NorthEast => {\\n\\n A::from_min_max((b, a).into(), (d, c).into()).context(error::DataType)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/ogc/util.rs\",\n \"rank\": 33,\n \"score\": 213706.74066571615\n },\n {\n \"content\": \"enum BoxPlotAccumKind {\\n\\n Exact(Vec<f64>),\\n\\n Estimated(PSquareQuantileEstimator<f64>),\\n\\n}\\n\\n\\n\\nimpl BoxPlotAccumKind {\\n\\n fn update(&mut self, values: impl Iterator<Item = f64>) -> crate::util::Result<()> {\\n\\n match self {\\n\\n Self::Exact(ref mut x) => {\\n\\n x.extend(values.filter(|x| x.is_finite()));\\n\\n\\n\\n if x.len() > EXACT_CALC_BOUND {\\n\\n let est = PSquareQuantileEstimator::new(0.5, x.as_slice())?;\\n\\n *self = Self::Estimated(est);\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n Self::Estimated(ref mut est) => {\\n\\n for v in values {\\n\\n est.update(v);\\n\",\n \"file_path\": \"operators/src/plot/box_plot.rs\",\n \"rank\": 34,\n \"score\": 212037.13107744904\n },\n {\n \"content\": \"#[inline]\\n\\npub fn average_floor<I>(a: I, b: I) -> I\\n\\nwhere\\n\\n I: Copy\\n\\n + Add<I, Output = I>\\n\\n + Shr<usize, Output = I>\\n\\n + BitAnd<I, Output = I>\\n\\n + BitOr<I, Output = I>\\n\\n + BitXor<I, Output = I>,\\n\\n{\\n\\n (a & b) + ((a ^ b) >> 1)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn average_floor_checks() {\\n\\n assert_eq!(\\n\\n average_floor(631_152_000_000_i64, 946_684_800_001_i64),\\n\\n 788_918_400_000_i64\\n\\n );\\n\\n\\n\\n assert_eq!(average_floor(i64::MIN, i64::MAX), -1);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"operators/src/util/math.rs\",\n \"rank\": 35,\n \"score\": 211903.87156433257\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait Context: 'static + Send + Sync + Clone {\\n\\n type Session: MockableSession + Clone; // TODO: change to `[Session]` when workarounds are gone\\n\\n type ProjectDB: ProjectDb<Self::Session>;\\n\\n type WorkflowRegistry: WorkflowRegistry;\\n\\n type DatasetDB: DatasetDb<Self::Session>;\\n\\n type QueryContext: QueryContext;\\n\\n type ExecutionContext: ExecutionContext;\\n\\n\\n\\n fn project_db(&self) -> Db<Self::ProjectDB>;\\n\\n async fn project_db_ref(&self) -> RwLockReadGuard<Self::ProjectDB>;\\n\\n async fn project_db_ref_mut(&self) -> RwLockWriteGuard<Self::ProjectDB>;\\n\\n\\n\\n fn workflow_registry(&self) -> Db<Self::WorkflowRegistry>;\\n\\n async fn workflow_registry_ref(&self) -> RwLockReadGuard<Self::WorkflowRegistry>;\\n\\n async fn workflow_registry_ref_mut(&self) -> RwLockWriteGuard<Self::WorkflowRegistry>;\\n\\n\\n\\n fn dataset_db(&self) -> Db<Self::DatasetDB>;\\n\\n async fn dataset_db_ref(&self) -> RwLockReadGuard<Self::DatasetDB>;\\n\\n async fn dataset_db_ref_mut(&self) -> RwLockWriteGuard<Self::DatasetDB>;\\n\\n\\n\",\n \"file_path\": \"services/src/contexts/mod.rs\",\n \"rank\": 36,\n \"score\": 211788.12093350844\n },\n {\n \"content\": \"pub fn first_tile_fold_fn<T>(\\n\\n acc: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> TemporalRasterAggregationTileAccu<T>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n if acc.initial_state {\\n\\n let mut next_accu = tile;\\n\\n next_accu.time = acc.accu_tile.time;\\n\\n\\n\\n TemporalRasterAggregationTileAccu {\\n\\n accu_tile: next_accu,\\n\\n initial_state: false,\\n\\n pool: acc.pool,\\n\\n }\\n\\n } else {\\n\\n acc\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 37,\n \"score\": 211582.10002427164\n },\n {\n \"content\": \"#[allow(clippy::needless_pass_by_value)]\\n\\npub fn last_tile_fold_fn<T>(\\n\\n acc: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> TemporalRasterAggregationTileAccu<T>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n let mut next_accu = tile;\\n\\n next_accu.time = acc.accu_tile.time;\\n\\n\\n\\n TemporalRasterAggregationTileAccu {\\n\\n accu_tile: next_accu,\\n\\n initial_state: false,\\n\\n pool: acc.pool,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 38,\n \"score\": 211582.10002427164\n },\n {\n \"content\": \"fn bench_gdal_source_operator_with_4326_to_3857_reprojection() {\\n\\n let qrects = vec![(\\n\\n \\\"World in EPSG:3857 ~ 40000 x 20000 px\\\",\\n\\n RasterQueryRectangle {\\n\\n spatial_bounds: SpatialPartition2D::new(\\n\\n (-20_037_508.342_789_244, 20_048_966.104_014_594).into(),\\n\\n (20_037_508.342_789_244, -20_048_966.104_014_594).into(),\\n\\n )\\n\\n .unwrap(),\\n\\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\\n\\n spatial_resolution: SpatialResolution::new(1050., 2100.).unwrap(),\\n\\n },\\n\\n )];\\n\\n\\n\\n let tiling_specs = vec![\\n\\n // TilingSpecification::new((0., 0.).into(), [32, 32].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [64, 64].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [128, 128].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [256, 256].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\\n\",\n \"file_path\": \"operators/benches/workflows.rs\",\n \"rank\": 39,\n \"score\": 211572.771582282\n },\n {\n \"content\": \"pub fn create_random_user_session_helper() -> UserSession {\\n\\n let user_id = UserId::new();\\n\\n\\n\\n UserSession {\\n\\n id: SessionId::new(),\\n\\n user: UserInfo {\\n\\n id: user_id,\\n\\n email: Some(user_id.to_string()),\\n\\n real_name: Some(user_id.to_string()),\\n\\n },\\n\\n created: MIN_DATETIME,\\n\\n valid_until: MAX_DATETIME,\\n\\n project: None,\\n\\n view: None,\\n\\n roles: vec![user_id.into(), Role::user_role_id()],\\n\\n }\\n\\n}\\n\\n\\n\\n#[allow(clippy::missing_panics_doc)]\\n\\npub async fn create_project_helper<C: ProContext>(ctx: &C) -> (UserSession, ProjectId) {\\n\",\n \"file_path\": \"services/src/pro/util/tests.rs\",\n \"rank\": 40,\n \"score\": 211556.18014834268\n },\n {\n \"content\": \"/// this method performs the transformation of a query rectangle in `target` projection\\n\\n/// to a new query rectangle with coordinates in the `source` projection\\n\\npub fn reproject_query<S: AxisAlignedRectangle>(\\n\\n query: QueryRectangle<S>,\\n\\n source: SpatialReference,\\n\\n target: SpatialReference,\\n\\n) -> Result<QueryRectangle<S>> {\\n\\n let projector_source_target = CoordinateProjector::from_known_srs(source, target)?;\\n\\n let projector_target_source = CoordinateProjector::from_known_srs(target, source)?;\\n\\n\\n\\n let p_bbox = query\\n\\n .spatial_bounds\\n\\n .reproject_clipped(&projector_target_source)?;\\n\\n let s_bbox = p_bbox.reproject(&projector_source_target)?;\\n\\n\\n\\n let p_spatial_resolution =\\n\\n suggest_pixel_size_from_diag_cross_projected(s_bbox, p_bbox, query.spatial_resolution)?;\\n\\n Ok(QueryRectangle {\\n\\n spatial_bounds: p_bbox,\\n\\n spatial_resolution: p_spatial_resolution,\\n\\n time_interval: query.time_interval,\\n\\n })\\n\",\n \"file_path\": \"datatypes/src/operations/reproject.rs\",\n \"rank\": 41,\n \"score\": 210304.80717084766\n },\n {\n \"content\": \"pub fn fold_fn<T, C>(\\n\\n acc: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> TemporalRasterAggregationTileAccu<T>\\n\\nwhere\\n\\n T: Pixel,\\n\\n C: AccFunction,\\n\\n{\\n\\n let mut accu_tile = acc.accu_tile;\\n\\n\\n\\n let grid = if acc.initial_state {\\n\\n tile.grid_array\\n\\n } else {\\n\\n match (accu_tile.grid_array, tile.grid_array) {\\n\\n (GridOrEmpty::Grid(mut a), GridOrEmpty::Grid(g)) => {\\n\\n a.data = a\\n\\n .inner_ref()\\n\\n .iter()\\n\\n .zip(g.inner_ref())\\n\\n .map(|(x, y)| C::acc(a.no_data_value, *x, *y))\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 42,\n \"score\": 209844.53082609747\n },\n {\n \"content\": \"fn create_rgba_image<P: Pixel + RgbaTransmutable, N: Fn(P) -> bool>(\\n\\n raster_grid: &Grid2D<P>,\\n\\n width: u32,\\n\\n height: u32,\\n\\n colorizer: &Colorizer,\\n\\n scale_x: f64,\\n\\n scale_y: f64,\\n\\n is_no_data: N,\\n\\n) -> RgbaImage {\\n\\n let color_mapper = colorizer.create_color_mapper();\\n\\n\\n\\n RgbaImage::from_fn(width, height, |x, y| {\\n\\n let (grid_pixel_x, grid_pixel_y) = image_pixel_to_raster_pixel(x, y, scale_x, scale_y);\\n\\n if let Ok(pixel_value) = raster_grid.get_at_grid_index([grid_pixel_y, grid_pixel_x]) {\\n\\n if is_no_data(pixel_value) {\\n\\n return colorizer.no_data_color().into();\\n\\n }\\n\\n\\n\\n color_mapper.call(pixel_value)\\n\\n } else {\\n\",\n \"file_path\": \"datatypes/src/operations/image/to_png.rs\",\n \"rank\": 43,\n \"score\": 209560.53178906327\n },\n {\n \"content\": \"enum ColumnDataType {\\n\\n Int,\\n\\n Float,\\n\\n Text,\\n\\n Date,\\n\\n Unknown,\\n\\n}\\n\\n\\n\\nimpl TryFrom<ColumnDataType> for FeatureDataType {\\n\\n type Error = error::Error;\\n\\n\\n\\n fn try_from(value: ColumnDataType) -> Result<Self, Self::Error> {\\n\\n match value {\\n\\n ColumnDataType::Int => Ok(FeatureDataType::Int),\\n\\n ColumnDataType::Float => Ok(FeatureDataType::Float),\\n\\n ColumnDataType::Text => Ok(FeatureDataType::Text),\\n\\n _ => Err(error::Error::NoFeatureDataTypeForColumnDataType),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/handlers/datasets.rs\",\n \"rank\": 44,\n \"score\": 209386.33362206415\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn fold_by_blit_future<T>(\\n\\n accu: RasterTileAccu2D<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl Future<Output = Result<RasterTileAccu2D<T>>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n tokio::task::spawn_blocking(|| fold_by_blit_impl(accu, tile)).then(|x| async move {\\n\\n match x {\\n\\n Ok(r) => r,\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use geoengine_datatypes::{\\n\\n primitives::{Measurement, SpatialPartition2D, SpatialResolution, TimeInterval},\\n\\n raster::{Grid, GridShape, RasterDataType},\\n\",\n \"file_path\": \"operators/src/adapters/raster_subquery/raster_subquery_adapter.rs\",\n \"rank\": 45,\n \"score\": 208395.86025085987\n },\n {\n \"content\": \"#[allow(clippy::missing_panics_doc)]\\n\\npub fn create_ndvi_meta_data() -> GdalMetaDataRegular {\\n\\n let no_data_value = Some(0.); // TODO: is it really 0?\\n\\n GdalMetaDataRegular {\\n\\n start: TimeInstance::from_millis(1_388_534_400_000).unwrap(),\\n\\n step: TimeStep {\\n\\n granularity: TimeGranularity::Months,\\n\\n step: 1,\\n\\n },\\n\\n time_placeholders: hashmap! {\\n\\n \\\"%_START_TIME_%\\\".to_string() => GdalSourceTimePlaceholder {\\n\\n format: \\\"%Y-%m-%d\\\".to_string(),\\n\\n reference: TimeReference::Start,\\n\\n },\\n\\n },\\n\\n params: GdalDatasetParameters {\\n\\n file_path: test_data!(\\\"raster/modis_ndvi/MOD13A2_M_NDVI_%_START_TIME_%.TIFF\\\").into(),\\n\\n rasterband_channel: 1,\\n\\n geo_transform: GdalDatasetGeoTransform {\\n\\n origin_coordinate: (-180., 90.).into(),\\n\\n x_pixel_size: 0.1,\\n\",\n \"file_path\": \"operators/src/util/gdal.rs\",\n \"rank\": 46,\n \"score\": 208395.86025085987\n },\n {\n \"content\": \"fn bench_gdal_source_operator_with_identity_reprojection() {\\n\\n let qrects = vec![(\\n\\n \\\"World in 36000x18000 pixels\\\",\\n\\n RasterQueryRectangle {\\n\\n spatial_bounds: SpatialPartition2D::new((-180., 90.).into(), (180., -90.).into())\\n\\n .unwrap(),\\n\\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\\n\\n spatial_resolution: SpatialResolution::new(0.01, 0.01).unwrap(),\\n\\n },\\n\\n )];\\n\\n\\n\\n let tiling_specs = vec![\\n\\n // TilingSpecification::new((0., 0.).into(), [32, 32].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [64, 64].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [128, 128].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [256, 256].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [600, 600].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [900, 900].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [1024, 1024].into()),\\n\",\n \"file_path\": \"operators/benches/workflows.rs\",\n \"rank\": 47,\n \"score\": 208236.31104957665\n },\n {\n \"content\": \"fn bench_gdal_source_operator_tile_size() {\\n\\n let qrects = vec![(\\n\\n \\\"World in 36000x18000 pixels\\\",\\n\\n RasterQueryRectangle {\\n\\n spatial_bounds: SpatialPartition2D::new((-180., 90.).into(), (180., -90.).into())\\n\\n .unwrap(),\\n\\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\\n\\n spatial_resolution: SpatialResolution::new(0.01, 0.01).unwrap(),\\n\\n },\\n\\n )];\\n\\n\\n\\n let tiling_specs = vec![\\n\\n TilingSpecification::new((0., 0.).into(), [32, 32].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [64, 64].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [128, 128].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [256, 256].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [600, 600].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [900, 900].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [1024, 1024].into()),\\n\",\n \"file_path\": \"operators/benches/workflows.rs\",\n \"rank\": 48,\n \"score\": 208236.31104957665\n },\n {\n \"content\": \"/// Tries to reproject all coordinates at once. If this fails, tries to reproject coordinate by coordinate.\\n\\n/// It returns all coordinates in input order.\\n\\n/// In case of success it returns `Some(Coordinate2D)` and `None` otherwise.\\n\\npub fn project_coordinates_fail_tolerant<P: CoordinateProjection>(\\n\\n i: &[Coordinate2D],\\n\\n p: &P,\\n\\n) -> Vec<Option<Coordinate2D>> {\\n\\n if let Ok(projected_all) = p.project_coordinates(&i) {\\n\\n return projected_all\\n\\n .into_iter()\\n\\n .map(Some)\\n\\n .collect::<Vec<Option<Coordinate2D>>>();\\n\\n }\\n\\n\\n\\n let individual_projected: Vec<Option<Coordinate2D>> = i\\n\\n .iter()\\n\\n .map(|&c| (c, c.reproject(p)))\\n\\n //.inspect(|(c, c_p)| {\\n\\n // dbg!(c, c_p);\\n\\n //})\\n\\n .map(|(_, c_p)| c_p.ok())\\n\\n .collect();\\n\\n // For debuging use this to find oput how many coordinates could be transformed.\\n\\n //dbg!(\\n\\n // individual_projected.iter().filter(|c| c.is_some()).count(),\\n\\n // i.len()\\n\\n //);\\n\\n individual_projected\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/operations/reproject.rs\",\n \"rank\": 49,\n \"score\": 207181.1104882963\n },\n {\n \"content\": \"pub fn value_in_range<T>(value: T, min: T, max: T) -> bool\\n\\nwhere\\n\\n T: PartialOrd + Copy,\\n\\n{\\n\\n (value >= min) && (value < max)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/ranges.rs\",\n \"rank\": 50,\n \"score\": 206938.13380117973\n },\n {\n \"content\": \"pub fn check_allowed_http_methods<'a, T, TRes>(\\n\\n test_helper: T,\\n\\n allowed_methods: &'a [Method],\\n\\n) -> impl futures::Future + 'a\\n\\nwhere\\n\\n T: Fn(Method) -> TRes + 'a,\\n\\n TRes: futures::Future<Output = ServiceResponse> + 'a,\\n\\n{\\n\\n check_allowed_http_methods2(test_helper, allowed_methods, |res| res)\\n\\n}\\n\\n\\n\\npub async fn send_test_request<C: SimpleContext>(\\n\\n req: test::TestRequest,\\n\\n ctx: C,\\n\\n) -> ServiceResponse {\\n\\n let app = test::init_service(\\n\\n App::new()\\n\\n .app_data(web::Data::new(ctx))\\n\\n .wrap(\\n\\n middleware::ErrorHandlers::default()\\n\",\n \"file_path\": \"services/src/util/tests.rs\",\n \"rank\": 51,\n \"score\": 206733.78861444464\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait MetaDataProvider<L, R, Q>\\n\\nwhere\\n\\n R: ResultDescriptor,\\n\\n{\\n\\n async fn meta_data(&self, dataset: &DatasetId) -> Result<Box<dyn MetaData<L, R, Q>>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/engine/execution_context.rs\",\n \"rank\": 52,\n \"score\": 205798.143029268\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn fold_by_coordinate_lookup_future<T>(\\n\\n accu: TileWithProjectionCoordinates<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl TryFuture<Ok = TileWithProjectionCoordinates<T>, Error = error::Error>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n // println!(\\\"fold_by_coordinate_lookup_future {:?}\\\", &tile.tile_position);\\n\\n tokio::task::spawn_blocking(|| fold_by_coordinate_lookup_impl(accu, tile)).then(\\n\\n |x| async move {\\n\\n match x {\\n\\n Ok(r) => r,\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/adapters/raster_subquery/raster_subquery_reprojection.rs\",\n \"rank\": 53,\n \"score\": 205514.56846042807\n },\n {\n \"content\": \"fn bench_gdal_source_operator_with_expression_tile_size() {\\n\\n let qrects = vec![(\\n\\n \\\"World in 36000x18000 pixels\\\",\\n\\n RasterQueryRectangle {\\n\\n spatial_bounds: SpatialPartition2D::new((-180., 90.).into(), (180., -90.).into())\\n\\n .unwrap(),\\n\\n time_interval: TimeInterval::new(1_388_534_400_000, 1_388_534_400_000 + 1000).unwrap(),\\n\\n spatial_resolution: SpatialResolution::new(0.01, 0.01).unwrap(),\\n\\n },\\n\\n )];\\n\\n\\n\\n let tiling_specs = vec![\\n\\n // TilingSpecification::new((0., 0.).into(), [32, 32].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [64, 64].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [128, 128].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [256, 256].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [512, 512].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [600, 600].into()),\\n\\n // TilingSpecification::new((0., 0.).into(), [900, 900].into()),\\n\\n TilingSpecification::new((0., 0.).into(), [1024, 1024].into()),\\n\",\n \"file_path\": \"operators/benches/workflows.rs\",\n \"rank\": 54,\n \"score\": 205029.23295231504\n },\n {\n \"content\": \"pub fn no_data_ignoring_fold_fn<T, C>(\\n\\n acc: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> TemporalRasterAggregationTileAccu<T>\\n\\nwhere\\n\\n T: Pixel,\\n\\n C: NoDataIgnoringAccFunction,\\n\\n{\\n\\n let TemporalRasterAggregationTileAccu {\\n\\n mut accu_tile,\\n\\n initial_state: _initial_state,\\n\\n pool,\\n\\n } = acc;\\n\\n\\n\\n let grid = match (accu_tile.grid_array, tile.grid_array) {\\n\\n (GridOrEmpty::Grid(mut a), GridOrEmpty::Grid(g)) => {\\n\\n a.data = a\\n\\n .inner_ref()\\n\\n .iter()\\n\\n .zip(g.inner_ref())\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 55,\n \"score\": 204974.12350377502\n },\n {\n \"content\": \"/// Method to generate an `Iterator` over all `GridIdx2D` in `GridBounds`\\n\\npub fn grid_idx_iter_2d<B>(bounds: &B) -> impl Iterator<Item = GridIdx2D>\\n\\nwhere\\n\\n B: GridBounds<IndexArray = [isize; 2]>,\\n\\n{\\n\\n let GridIdx([y_s, x_s]) = bounds.min_index();\\n\\n let GridIdx([y_e, x_e]) = bounds.max_index();\\n\\n\\n\\n (y_s..=y_e).flat_map(move |y| (x_s..=x_e).map(move |x| [y, x].into()))\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Grid<D, T> {\\n\\n pub shape: D,\\n\\n pub data: Vec<T>,\\n\\n pub no_data_value: Option<T>,\\n\\n}\\n\\n\\n\\npub type Grid1D<T> = Grid<GridShape1D, T>;\\n\\npub type Grid2D<T> = Grid<GridShape2D, T>;\\n\",\n \"file_path\": \"datatypes/src/raster/grid.rs\",\n \"rank\": 56,\n \"score\": 204822.96980948246\n },\n {\n \"content\": \"pub fn value_in_range_inv<T>(value: T, min: T, max: T) -> bool\\n\\nwhere\\n\\n T: PartialOrd + Copy,\\n\\n{\\n\\n (value > min) && (value <= max)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/ranges.rs\",\n \"rank\": 57,\n \"score\": 204213.1519150808\n },\n {\n \"content\": \"pub fn value_in_range_inclusive<T>(value: T, min: T, max: T) -> bool\\n\\nwhere\\n\\n T: PartialOrd + Copy,\\n\\n{\\n\\n (value >= min) && (value <= max)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/util/ranges.rs\",\n \"rank\": 58,\n \"score\": 204213.1519150808\n },\n {\n \"content\": \"pub fn identity_accu<T: Pixel>(\\n\\n tile_info: TileInformation,\\n\\n query_rect: RasterQueryRectangle,\\n\\n no_data_value: T,\\n\\n pool: Arc<ThreadPool>,\\n\\n) -> impl Future<Output = Result<RasterTileAccu2D<T>>> {\\n\\n tokio::task::spawn_blocking(move || {\\n\\n let output_raster =\\n\\n EmptyGrid2D::new(tile_info.tile_size_in_pixels, T::from_(no_data_value)).into();\\n\\n let output_tile =\\n\\n RasterTile2D::new_with_tile_info(query_rect.time_interval, tile_info, output_raster);\\n\\n RasterTileAccu2D::new(output_tile, pool)\\n\\n })\\n\\n .map_err(From::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/adapters/raster_subquery/raster_subquery_adapter.rs\",\n \"rank\": 59,\n \"score\": 204182.2868310359\n },\n {\n \"content\": \"pub fn update_project_helper(project: ProjectId) -> UpdateProject {\\n\\n UpdateProject {\\n\\n id: project,\\n\\n name: Some(\\\"TestUpdate\\\".to_string()),\\n\\n description: None,\\n\\n layers: Some(vec![LayerUpdate::UpdateOrInsert(Layer {\\n\\n workflow: WorkflowId::new(),\\n\\n name: \\\"L1\\\".to_string(),\\n\\n visibility: Default::default(),\\n\\n symbology: Symbology::Raster(RasterSymbology {\\n\\n opacity: 1.0,\\n\\n colorizer: Colorizer::Rgba,\\n\\n }),\\n\\n })]),\\n\\n plots: None,\\n\\n bounds: None,\\n\\n time_step: None,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/util/tests.rs\",\n \"rank\": 60,\n \"score\": 203670.50805306912\n },\n {\n \"content\": \"fn detect_time_type(columns: &Columns) -> OgrSourceDatasetTimeType {\\n\\n // TODO: load candidate names from config\\n\\n let known_start = [\\n\\n \\\"start\\\",\\n\\n \\\"time\\\",\\n\\n \\\"begin\\\",\\n\\n \\\"date\\\",\\n\\n \\\"time_start\\\",\\n\\n \\\"start time\\\",\\n\\n \\\"date_start\\\",\\n\\n \\\"start date\\\",\\n\\n \\\"datetime\\\",\\n\\n \\\"date_time\\\",\\n\\n \\\"date time\\\",\\n\\n \\\"event\\\",\\n\\n \\\"timestamp\\\",\\n\\n \\\"time_from\\\",\\n\\n \\\"t1\\\",\\n\\n \\\"t\\\",\\n\\n ];\\n\",\n \"file_path\": \"services/src/handlers/datasets.rs\",\n \"rank\": 61,\n \"score\": 202993.98486736498\n },\n {\n \"content\": \"pub fn mean_tile_fold_future<T>(\\n\\n accu: TemporalMeanTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl Future<Output = Result<TemporalMeanTileAccu<T>>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n tokio::task::spawn_blocking(|| {\\n\\n let mut accu = accu;\\n\\n accu.add_tile(tile)?;\\n\\n Ok(accu)\\n\\n })\\n\\n .then(|x| async move {\\n\\n match x {\\n\\n Ok(r) => r,\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/mean_aggregation_subquery.rs\",\n \"rank\": 62,\n \"score\": 202744.0317576118\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait SessionMetaDataProvider<S, L, R, Q>\\n\\nwhere\\n\\n S: Session,\\n\\n R: ResultDescriptor,\\n\\n{\\n\\n async fn session_meta_data(\\n\\n &self,\\n\\n session: &S,\\n\\n dataset: &DatasetId,\\n\\n ) -> Result<Box<dyn MetaData<L, R, Q>>>;\\n\\n}\\n\\n\\n\\n/// Listing of stored datasets\\n\",\n \"file_path\": \"services/src/datasets/listing.rs\",\n \"rank\": 63,\n \"score\": 202052.88361552084\n },\n {\n \"content\": \"pub fn get_token(req: &HttpRequest) -> Result<SessionId> {\\n\\n let header = req\\n\\n .headers()\\n\\n .get(header::AUTHORIZATION)\\n\\n .ok_or(Error::Authorization {\\n\\n source: Box::new(Error::MissingAuthorizationHeader),\\n\\n })?;\\n\\n let scheme = Bearer::parse(header).map_err(|_| Error::Authorization {\\n\\n source: Box::new(Error::InvalidAuthorizationScheme),\\n\\n })?;\\n\\n SessionId::from_str(scheme.token()).map_err(|err| Error::Authorization {\\n\\n source: Box::new(err),\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"services/src/handlers/mod.rs\",\n \"rank\": 64,\n \"score\": 200010.8868835831\n },\n {\n \"content\": \"enum FeaturesProvider<'a> {\\n\\n Layer(Layer<'a>),\\n\\n ResultSet(ResultSet<'a>),\\n\\n}\\n\\n\\n\\nimpl FeaturesProvider<'_> {\\n\\n fn layer_ref(&self) -> &Layer {\\n\\n match self {\\n\\n FeaturesProvider::Layer(l) => l,\\n\\n FeaturesProvider::ResultSet(r) => &**r,\\n\\n }\\n\\n }\\n\\n\\n\\n fn set_spatial_filter(&mut self, spatial_bounds: &BoundingBox2D) {\\n\\n match self {\\n\\n FeaturesProvider::Layer(l) => {\\n\\n l.set_spatial_filter_rect(\\n\\n spatial_bounds.lower_left().x,\\n\\n spatial_bounds.lower_left().y,\\n\\n spatial_bounds.upper_right().x,\\n\",\n \"file_path\": \"operators/src/source/ogr_source/mod.rs\",\n \"rank\": 65,\n \"score\": 199142.45313313277\n },\n {\n \"content\": \"/// A version of `suggest_pixel_size_from_diag_cross` that takes a `partition` and a projected counterpart as input\\n\\npub fn suggest_pixel_size_from_diag_cross_projected<B: AxisAlignedRectangle>(\\n\\n bbox: B,\\n\\n bbox_projected: B,\\n\\n spatial_resolution: SpatialResolution,\\n\\n) -> Result<SpatialResolution> {\\n\\n let diag_pixels = euclidian_pixel_distance(bbox, spatial_resolution)?;\\n\\n\\n\\n let proj_ul_lr_distance =\\n\\n diag_distance(bbox_projected.upper_left(), bbox_projected.lower_right());\\n\\n\\n\\n let proj_ll_ur_distance =\\n\\n diag_distance(bbox_projected.lower_left(), bbox_projected.upper_right());\\n\\n\\n\\n let min_dist_r = proj_ul_lr_distance.min(proj_ll_ur_distance);\\n\\n\\n\\n Ok(SpatialResolution::new_unchecked(\\n\\n min_dist_r / diag_pixels,\\n\\n min_dist_r / diag_pixels,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/operations/reproject.rs\",\n \"rank\": 66,\n \"score\": 198530.45833778783\n },\n {\n \"content\": \"fn detect_vector_geometry(dataset: &Dataset) -> DetectedGeometry {\\n\\n for layer in dataset.layers() {\\n\\n for g in layer.defn().geom_fields() {\\n\\n if let Ok(data_type) = VectorDataType::try_from_ogr_type_code(g.field_type()) {\\n\\n return DetectedGeometry {\\n\\n layer_name: Some(layer.name()),\\n\\n data_type,\\n\\n spatial_reference: g\\n\\n .spatial_ref()\\n\\n .context(error::Gdal)\\n\\n .and_then(|s| {\\n\\n let s: Result<SpatialReference> = s.try_into().context(error::DataType);\\n\\n s\\n\\n })\\n\\n .map(Into::into)\\n\\n .unwrap_or(SpatialReferenceOption::Unreferenced),\\n\\n };\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // fallback type if no geometry was found\\n\\n DetectedGeometry {\\n\\n layer_name: None,\\n\\n data_type: VectorDataType::Data,\\n\\n spatial_reference: SpatialReferenceOption::Unreferenced,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/handlers/datasets.rs\",\n \"rank\": 67,\n \"score\": 198042.24228089413\n },\n {\n \"content\": \"pub fn first_tile_fold_future<T>(\\n\\n accu: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n tokio::task::spawn_blocking(|| first_tile_fold_fn(accu, tile)).then(move |x| async move {\\n\\n match x {\\n\\n Ok(r) => Ok(r),\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 68,\n \"score\": 197510.6250240963\n },\n {\n \"content\": \"pub fn last_tile_fold_future<T>(\\n\\n accu: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n{\\n\\n tokio::task::spawn_blocking(|| last_tile_fold_fn(accu, tile)).then(move |x| async move {\\n\\n match x {\\n\\n Ok(r) => Ok(r),\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct TemporalRasterAggregationTileAccu<T> {\\n\\n accu_tile: RasterTile2D<T>,\\n\\n initial_state: bool,\\n\\n pool: Arc<ThreadPool>,\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 69,\n \"score\": 197510.6250240963\n },\n {\n \"content\": \"/// Deserialize a base URL by enforcing a trailing slash and then parsing it as a URL.\\n\\npub fn deserialize_base_url<'de, D>(deserializer: D) -> Result<Url, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let mut url_string = String::deserialize(deserializer)?;\\n\\n\\n\\n if !url_string.ends_with('/') {\\n\\n url_string.push('/');\\n\\n }\\n\\n\\n\\n Url::parse(&url_string).map_err(D::Error::custom)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/util/parsing.rs\",\n \"rank\": 70,\n \"score\": 196284.360216158\n },\n {\n \"content\": \"pub fn fold_future<T, C>(\\n\\n accu: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n C: AccFunction,\\n\\n{\\n\\n tokio::task::spawn_blocking(|| fold_fn::<T, C>(accu, tile)).then(|x| async move {\\n\\n match x {\\n\\n Ok(r) => Ok(r),\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 71,\n \"score\": 195864.41110938552\n },\n {\n \"content\": \"/// Method to generate a default `Colorizer`.\\n\\n///\\n\\n/// # Panics\\n\\n/// If T has no min max value\\n\\npub fn default_colorizer_gradient<T: Pixel>() -> Result<Colorizer> {\\n\\n Colorizer::linear_gradient(\\n\\n vec![\\n\\n (AsPrimitive::<f64>::as_(T::min_value()), RgbaColor::black())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n (AsPrimitive::<f64>::as_(T::max_value()), RgbaColor::white())\\n\\n .try_into()\\n\\n .unwrap(),\\n\\n ],\\n\\n RgbaColor::transparent(),\\n\\n RgbaColor::pink(),\\n\\n )\\n\\n .map_err(error::Error::from)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use geoengine_datatypes::{\\n\\n primitives::{Coordinate2D, SpatialPartition2D, SpatialResolution},\\n\",\n \"file_path\": \"operators/src/util/raster_stream_to_png.rs\",\n \"rank\": 72,\n \"score\": 194400.19886857702\n },\n {\n \"content\": \"/// Common functionality for slice data types\\n\\npub trait GenericSliceType: Sized + OclPrm {\\n\\n const TYPE: SliceDataType;\\n\\n\\n\\n fn create_typed_slice_ref(slice: &[Self]) -> TypedSliceRef;\\n\\n\\n\\n fn create_typed_slice_mut(slice: &mut [Self]) -> TypedSliceMut;\\n\\n\\n\\n fn create_slice_output_buffer(buffer: Buffer<Self>) -> SliceOutputBuffer;\\n\\n}\\n\\n\\n\\n/// Implement `GenericSliceType` in a concise way\\n\\nmacro_rules! generic_slice_type_impl {\\n\\n ($type:ty, $variant:ident) => {\\n\\n impl GenericSliceType for $type {\\n\\n const TYPE: SliceDataType = SliceDataType::$variant;\\n\\n\\n\\n fn create_typed_slice_ref(slice: &[Self]) -> TypedSliceRef {\\n\\n TypedSliceRef::$variant(slice)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"operators/src/opencl/typed_slice.rs\",\n \"rank\": 73,\n \"score\": 191984.46480356448\n },\n {\n \"content\": \"/// Create a rayon thread pool with the given number of threads.\\n\\n/// Use `num_threads = 0` for auto number of threads.\\n\\npub fn create_rayon_thread_pool(num_threads: usize) -> Arc<ThreadPool> {\\n\\n rayon_destroy_global_thread_pool();\\n\\n\\n\\n let thread_pool = ThreadPoolBuilder::new()\\n\\n .num_threads(num_threads)\\n\\n .build()\\n\\n .expect(\\\"Thread Pool must be initializable\\\");\\n\\n\\n\\n Arc::new(thread_pool)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n #[should_panic(\\n\\n expected = \\\"The global thread pool has not been initialized.: ThreadPoolBuildError { kind: GlobalPoolAlreadyInitialized }\\\"\\n\\n )]\\n\\n fn global_rayon_fail() {\\n\",\n \"file_path\": \"operators/src/util/rayon.rs\",\n \"rank\": 74,\n \"score\": 191635.48296917515\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait MetaData<L, R, Q>: Debug + Send + Sync\\n\\nwhere\\n\\n R: ResultDescriptor,\\n\\n{\\n\\n async fn loading_info(&self, query: Q) -> Result<L>;\\n\\n async fn result_descriptor(&self) -> Result<R>;\\n\\n\\n\\n fn box_clone(&self) -> Box<dyn MetaData<L, R, Q>>;\\n\\n}\\n\\n\\n\\nimpl<L, R, Q> Clone for Box<dyn MetaData<L, R, Q>>\\n\\nwhere\\n\\n R: ResultDescriptor,\\n\\n{\\n\\n fn clone(&self) -> Box<dyn MetaData<L, R, Q>> {\\n\\n self.box_clone()\\n\\n }\\n\\n}\\n\\n\\n\\npub struct MockExecutionContext {\\n\",\n \"file_path\": \"operators/src/engine/execution_context.rs\",\n \"rank\": 75,\n \"score\": 190929.5178101398\n },\n {\n \"content\": \"pub fn no_data_ignoring_fold_future<T, C>(\\n\\n accu: TemporalRasterAggregationTileAccu<T>,\\n\\n tile: RasterTile2D<T>,\\n\\n) -> impl Future<Output = Result<TemporalRasterAggregationTileAccu<T>>>\\n\\nwhere\\n\\n T: Pixel,\\n\\n C: NoDataIgnoringAccFunction,\\n\\n{\\n\\n tokio::task::spawn_blocking(|| no_data_ignoring_fold_fn::<T, C>(accu, tile)).then(\\n\\n |x| async move {\\n\\n match x {\\n\\n Ok(r) => Ok(r),\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/temporal_raster_aggregation/min_max_first_last_subquery.rs\",\n \"rank\": 76,\n \"score\": 190822.9997870841\n },\n {\n \"content\": \"#[inline(never)]\\n\\nfn bench_raster_operator<'a, Q, T, F, C, B>(\\n\\n bench_id: &'static str,\\n\\n named_querys: Q,\\n\\n tiling_specs: T,\\n\\n named_operator: Box<dyn RasterOperator>,\\n\\n context_builder: F,\\n\\n chunk_byte_size: B,\\n\\n num_threads: C,\\n\\n) where\\n\\n F: Fn(TilingSpecification, usize) -> MockExecutionContext,\\n\\n C: IntoIterator<Item = &'a usize> + Clone,\\n\\n Q: IntoIterator<Item = &'a (&'static str, RasterQueryRectangle)> + Clone,\\n\\n T: IntoIterator<Item = &'a TilingSpecification> + Clone,\\n\\n B: IntoIterator<Item = &'a ChunkByteSize> + Clone,\\n\\n{\\n\\n let run_time = tokio::runtime::Runtime::new().unwrap();\\n\\n\\n\\n for current_threads in num_threads.into_iter() {\\n\\n for tiling_spec in tiling_specs.clone().into_iter() {\\n\\n let exe_ctx = (context_builder)(*tiling_spec, *current_threads);\\n\",\n \"file_path\": \"operators/benches/workflows.rs\",\n \"rank\": 77,\n \"score\": 189562.21279239355\n },\n {\n \"content\": \"/// Deserialize an optional base URL by enforcing a trailing slash and then parsing it as a URL.\\n\\npub fn deserialize_base_url_option<'de, D>(deserializer: D) -> Result<Option<Url>, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let mut url_string = if let Some(url_string) = Option::<String>::deserialize(deserializer)? {\\n\\n url_string\\n\\n } else {\\n\\n return Ok(None);\\n\\n };\\n\\n\\n\\n if !url_string.ends_with('/') {\\n\\n url_string.push('/');\\n\\n }\\n\\n\\n\\n Url::parse(&url_string)\\n\\n .map(Option::Some)\\n\\n .map_err(D::Error::custom)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"services/src/util/parsing.rs\",\n \"rank\": 78,\n \"score\": 189426.54525202847\n },\n {\n \"content\": \"#[allow(clippy::float_cmp)] // allow since NO DATA is a specific value\\n\\nfn process_raster(number_statistics: &mut NumberStatistics, tile_grid: &Grid2D<f64>) {\\n\\n let no_data_value = tile_grid.no_data_value();\\n\\n\\n\\n if let Some(no_data_value) = no_data_value {\\n\\n for &value in &tile_grid.data {\\n\\n if value == no_data_value {\\n\\n number_statistics.add_no_data();\\n\\n } else {\\n\\n number_statistics.add(value);\\n\\n }\\n\\n }\\n\\n } else {\\n\\n for &value in &tile_grid.data {\\n\\n number_statistics.add(value);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// The statistics summary output type for each raster input\\n\",\n \"file_path\": \"operators/src/plot/statistics.rs\",\n \"rank\": 79,\n \"score\": 188497.20704246726\n },\n {\n \"content\": \"fn adjust_user_path_to_upload_path(meta: &mut MetaDataDefinition, upload: &Upload) -> Result<()> {\\n\\n match meta {\\n\\n crate::datasets::storage::MetaDataDefinition::MockMetaData(_) => {}\\n\\n crate::datasets::storage::MetaDataDefinition::OgrMetaData(m) => {\\n\\n m.loading_info.file_name = upload.adjust_file_path(&m.loading_info.file_name)?;\\n\\n }\\n\\n crate::datasets::storage::MetaDataDefinition::GdalMetaDataRegular(m) => {\\n\\n m.params.file_path = upload.adjust_file_path(&m.params.file_path)?;\\n\\n }\\n\\n crate::datasets::storage::MetaDataDefinition::GdalStatic(m) => {\\n\\n m.params.file_path = upload.adjust_file_path(&m.params.file_path)?;\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// Creates a new [Dataset](AutoCreateDataset) using previously uploaded files.\\n\\n/// The format of the files will be automatically detected when possible.\\n\\n///\\n\\n/// # Example\\n\",\n \"file_path\": \"services/src/handlers/datasets.rs\",\n \"rank\": 80,\n \"score\": 188345.23605089518\n },\n {\n \"content\": \"/// Marker trait for geometry types\\n\\n// TODO: rename to CollectionType oder something?…\\n\\npub trait Geometry: Clone + Debug + Send + Sync + TryFrom<TypedGeometry, Error = Error> {\\n\\n // TODO: introduce once generic associated types are possible due to lifetime introduction for ref type\\n\\n // type REF: GeometryRef;\\n\\n\\n\\n const IS_GEOMETRY: bool = true;\\n\\n\\n\\n // move to primitives module?\\n\\n const DATA_TYPE: VectorDataType;\\n\\n\\n\\n /// Is the geometry overlapping the `BoundingBox2D`?\\n\\n fn intersects_bbox(&self, bbox: &BoundingBox2D) -> bool;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/primitives/geometry.rs\",\n \"rank\": 81,\n \"score\": 186689.53906713135\n },\n {\n \"content\": \"/// This method calculates a suggested pixel size for the translation of a raster into a different projection.\\n\\n/// The source raster is described using a `BoundingBox2D` and a pixel size as `SpatialResolution`.\\n\\n/// A suggested pixel size is calculated using the approach used by GDAL:\\n\\n/// The upper left and the lower right coordinates of the bounding box are projected in the target SRS.\\n\\n/// Then, the distance between both points in the target SRS is devided by the distance in pixels of the source.\\n\\npub fn suggest_pixel_size_like_gdal<P: CoordinateProjection, B: AxisAlignedRectangle>(\\n\\n bbox: B,\\n\\n spatial_resolution: SpatialResolution,\\n\\n projector: &P,\\n\\n) -> Result<SpatialResolution> {\\n\\n let diag_pixels = euclidian_pixel_distance(bbox, spatial_resolution)?;\\n\\n\\n\\n let proj_ul_lr_distance =\\n\\n projected_diag_distance(bbox.upper_left(), bbox.lower_right(), projector)?;\\n\\n\\n\\n // derive the pixel size by deviding srs unit distance by pixel distance in the source bbox\\n\\n let proj_ul_lr_pixel_size = proj_ul_lr_distance / diag_pixels;\\n\\n Ok(SpatialResolution::new_unchecked(\\n\\n proj_ul_lr_pixel_size,\\n\\n proj_ul_lr_pixel_size,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/operations/reproject.rs\",\n \"rank\": 82,\n \"score\": 186407.67424335488\n },\n {\n \"content\": \"/// This approach uses the GDAL way to suggest the pixel size. However, we check both diagonals and take the smaller one.\\n\\n/// This method fails if the bbox cannot be projected\\n\\npub fn suggest_pixel_size_from_diag_cross<P: CoordinateProjection, B: AxisAlignedRectangle>(\\n\\n bbox: B,\\n\\n spatial_resolution: SpatialResolution,\\n\\n projector: &P,\\n\\n) -> Result<SpatialResolution> {\\n\\n let diag_pixels = euclidian_pixel_distance(bbox, spatial_resolution)?;\\n\\n\\n\\n let proj_ul_lr_distance =\\n\\n projected_diag_distance(bbox.upper_left(), bbox.lower_right(), projector);\\n\\n\\n\\n let proj_ll_ur_distance =\\n\\n projected_diag_distance(bbox.lower_left(), bbox.upper_right(), projector);\\n\\n\\n\\n let min_dist_r = match (proj_ul_lr_distance, proj_ll_ur_distance) {\\n\\n (Ok(ul_lr), Ok(ll_ur)) => Ok(ul_lr.min(ll_ur)),\\n\\n (Ok(ul_lr), Err(_)) => Ok(ul_lr),\\n\\n (Err(_), Ok(ll_ur)) => Ok(ll_ur),\\n\\n (Err(e), Err(_)) => Err(e),\\n\\n };\\n\\n\\n\\n min_dist_r.map(|d| SpatialResolution::new_unchecked(d / diag_pixels, d / diag_pixels))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/operations/reproject.rs\",\n \"rank\": 83,\n \"score\": 186401.92898839817\n },\n {\n \"content\": \"fn new_slope_key() -> RasterPropertiesKey {\\n\\n RasterPropertiesKey {\\n\\n domain: Some(\\\"msg\\\".into()),\\n\\n key: \\\"calibration_slope\\\".into(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/meteosat/mod.rs\",\n \"rank\": 84,\n \"score\": 186196.8211694727\n },\n {\n \"content\": \"fn new_offset_key() -> RasterPropertiesKey {\\n\\n RasterPropertiesKey {\\n\\n domain: Some(\\\"msg\\\".into()),\\n\\n key: \\\"calibration_offset\\\".into(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/meteosat/mod.rs\",\n \"rank\": 85,\n \"score\": 186196.8211694727\n },\n {\n \"content\": \"fn new_channel_key() -> RasterPropertiesKey {\\n\\n RasterPropertiesKey {\\n\\n domain: Some(\\\"msg\\\".into()),\\n\\n key: \\\"channel_number\\\".into(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/src/processing/meteosat/mod.rs\",\n \"rank\": 86,\n \"score\": 186196.8211694727\n },\n {\n \"content\": \"fn new_satellite_key() -> RasterPropertiesKey {\\n\\n RasterPropertiesKey {\\n\\n domain: Some(\\\"msg\\\".into()),\\n\\n key: \\\"satellite_number\\\".into(),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test_util {\\n\\n use chrono::{TimeZone, Utc};\\n\\n use futures::StreamExt;\\n\\n use geoengine_datatypes::hashmap;\\n\\n use geoengine_datatypes::util::test::TestDefault;\\n\\n use num_traits::AsPrimitive;\\n\\n\\n\\n use geoengine_datatypes::dataset::{DatasetId, InternalDatasetId};\\n\\n use geoengine_datatypes::primitives::{\\n\\n Measurement, RasterQueryRectangle, SpatialPartition2D, SpatialResolution, TimeGranularity,\\n\\n TimeInstance, TimeInterval, TimeStep,\\n\\n };\\n\",\n \"file_path\": \"operators/src/processing/meteosat/mod.rs\",\n \"rank\": 87,\n \"score\": 186196.8211694727\n },\n {\n \"content\": \"/// Provides the intersection method\\n\\npub trait GridIntersection<Rhs = Self, Out = Self> {\\n\\n // Returns true if Self intesects Rhs\\n\\n fn intersection(&self, other: &Rhs) -> Option<Out>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/raster/grid_traits.rs\",\n \"rank\": 88,\n \"score\": 185396.6730615497\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct NFDIMetaData<L, R, Q>\\n\\nwhere\\n\\n L: Debug + Clone + Send + Sync + ExpiringDownloadLink + 'static,\\n\\n R: Debug + Send + Sync + 'static + ResultDescriptor,\\n\\n Q: Debug + Clone + Send + Sync + 'static,\\n\\n{\\n\\n result_descriptor: R,\\n\\n object_id: String,\\n\\n template: L,\\n\\n object_stub: ObjectLoadServiceClient<InterceptedService<Channel, APITokenInterceptor>>,\\n\\n _phantom: PhantomData<Q>,\\n\\n}\\n\\n\\n\\n#[async_trait::async_trait]\\n\\nimpl<L, R, Q> MetaData<L, R, Q> for NFDIMetaData<L, R, Q>\\n\\nwhere\\n\\n L: Debug + Clone + Send + Sync + ExpiringDownloadLink + 'static,\\n\\n R: Debug + Send + Sync + 'static + ResultDescriptor,\\n\\n Q: Debug + Clone + Send + Sync + 'static,\\n\\n{\\n\",\n \"file_path\": \"services/src/datasets/external/nfdi/mod.rs\",\n \"rank\": 89,\n \"score\": 183603.2635448649\n },\n {\n \"content\": \"// TODO: raster pixel access is currently modeled similar to numpy/ndarray with ..,z,y,x\\n\\n// TODO: move these functions to base raster (?)\\n\\n/// Map an image's (x, y) values to the grid cells of a raster.\\n\\nfn image_pixel_to_raster_pixel<ImagePixelType>(\\n\\n x: ImagePixelType,\\n\\n y: ImagePixelType,\\n\\n scale_x: f64,\\n\\n scale_y: f64,\\n\\n) -> (isize, isize)\\n\\nwhere\\n\\n ImagePixelType: Into<f64>,\\n\\n{\\n\\n debug_assert!(\\n\\n scale_x > 0. && scale_y > 0.,\\n\\n \\\"scale values must be positive\\\"\\n\\n );\\n\\n\\n\\n let cell_x = (((x.into() + 0.5) * scale_x) - 0.5).round();\\n\\n let cell_y = (((y.into() + 0.5) * scale_y) - 0.5).round();\\n\\n (cell_x as isize, cell_y as isize)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"datatypes/src/operations/image/to_png.rs\",\n \"rank\": 90,\n \"score\": 183494.66576145403\n },\n {\n \"content\": \"fn random_points<T: Rng>(rng: &mut T, num_points: usize) -> MultiPointCollection {\\n\\n let coordinates = (0..num_points)\\n\\n .into_iter()\\n\\n .map(|_| (rng.gen_range(0.0..100.0), rng.gen_range(0.0..100.0)))\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n let time = vec![TimeInterval::default(); num_points];\\n\\n\\n\\n MultiPointCollection::from_data(\\n\\n MultiPoint::many(coordinates).unwrap(),\\n\\n time,\\n\\n Default::default(),\\n\\n )\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"operators/benches/pip.rs\",\n \"rank\": 91,\n \"score\": 183428.56634211523\n },\n {\n \"content\": \"struct InitializedMockDatasetDataSource<R: ResultDescriptor, Q> {\\n\\n result_descriptor: R,\\n\\n loading_info: Box<dyn MetaData<MockDatasetDataSourceLoadingInfo, R, Q>>,\\n\\n}\\n\\n\\n\\nimpl InitializedVectorOperator\\n\\n for InitializedMockDatasetDataSource<VectorResultDescriptor, VectorQueryRectangle>\\n\\n{\\n\\n fn query_processor(&self) -> Result<TypedVectorQueryProcessor> {\\n\\n Ok(TypedVectorQueryProcessor::MultiPoint(\\n\\n MockDatasetDataSourceProcessor {\\n\\n loading_info: self.loading_info.clone(),\\n\\n }\\n\\n .boxed(),\\n\\n ))\\n\\n }\\n\\n\\n\\n fn result_descriptor(&self) -> &VectorResultDescriptor {\\n\\n &self.result_descriptor\\n\\n }\\n\",\n \"file_path\": \"operators/src/mock/mock_dataset_data_source.rs\",\n \"rank\": 92,\n \"score\": 183355.17986775946\n },\n {\n \"content\": \"// use `TryFrom` in `datatypes` if this is used on more than one occasion\\n\\npub trait TryFromOgrGeometry: Sized {\\n\\n fn try_from(geometry: Result<&gdal::vector::Geometry>) -> Result<Self>;\\n\\n}\\n\\n\\n\\n/// Implement direct conversions from OGR geometries to our geometries\\n\\n/// Unfortunately, we cannot convert to `geo`'s geometries since the implementation panics on unknown types.\\n\\nimpl TryFromOgrGeometry for MultiPoint {\\n\\n fn try_from(geometry: Result<&gdal::vector::Geometry>) -> Result<Self> {\\n\\n fn coordinate(geometry: &gdal::vector::Geometry) -> Coordinate2D {\\n\\n let (x, y, _) = geometry.get_point(0);\\n\\n Coordinate2D::new(x, y)\\n\\n }\\n\\n\\n\\n let geometry = geometry?;\\n\\n\\n\\n match geometry.geometry_type() {\\n\\n OGRwkbGeometryType::wkbPoint => Ok(MultiPoint::new(vec![coordinate(geometry)])?),\\n\\n OGRwkbGeometryType::wkbMultiPoint => {\\n\\n let coordinates = (0..geometry.geometry_count())\\n\\n .map(|i| coordinate(&unsafe { geometry.get_unowned_geometry(i) }))\\n\",\n \"file_path\": \"operators/src/source/ogr_source/mod.rs\",\n \"rank\": 93,\n \"score\": 183280.60946854317\n },\n {\n \"content\": \"pub trait FirstValueOutputType {\\n\\n fn feature_data_type() -> FeatureDataType;\\n\\n fn typed_aggregator(aggregator: FirstValueAggregator<Self>) -> TypedAggregator\\n\\n where\\n\\n Self: Sized;\\n\\n}\\n\\n\\n\\nimpl FirstValueOutputType for i64 {\\n\\n fn feature_data_type() -> FeatureDataType {\\n\\n FeatureDataType::Int\\n\\n }\\n\\n\\n\\n fn typed_aggregator(aggregator: FirstValueAggregator<Self>) -> TypedAggregator {\\n\\n TypedAggregator::FirstValueInt(aggregator)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FirstValueOutputType for f64 {\\n\\n fn feature_data_type() -> FeatureDataType {\\n\\n FeatureDataType::Float\\n\",\n \"file_path\": \"operators/src/processing/raster_vector_join/aggregator.rs\",\n \"rank\": 94,\n \"score\": 182996.8443245715\n },\n {\n \"content\": \"/// parse coordinate, format is \\\"x,y\\\"\\n\\npub fn parse_coordinate<'de, D>(deserializer: D) -> Result<Coordinate2D, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n\\n\\n let split: Vec<Result<f64, std::num::ParseFloatError>> = s.split(',').map(str::parse).collect();\\n\\n\\n\\n match *split.as_slice() {\\n\\n [Ok(x), Ok(y)] => Ok(Coordinate2D::new(x, y)),\\n\\n _ => Err(D::Error::custom(\\\"Invalid coordinate\\\")),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/ogc/util.rs\",\n \"rank\": 95,\n \"score\": 182243.69444607702\n },\n {\n \"content\": \"/// Parse the time string of a WMS request\\n\\n/// time is specified in ISO8601, it can either be an instant (single datetime) or an interval\\n\\n/// An interval is separated by \\\"/\\\". \\\"Either the start value or the end value can be omitted to\\n\\n/// indicate no restriction on time in that direction.\\\"\\n\\n/// sources: - <http://docs.geoserver.org/2.8.x/en/user/services/wms/time.html#wms-time>\\n\\n/// - <http://www.ogcnetwork.net/node/178>\\n\\npub fn parse_time<'de, D>(deserializer: D) -> Result<TimeInterval, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n // TODO: support relative time intervals\\n\\n\\n\\n let s = String::deserialize(deserializer)?;\\n\\n parse_time_from_str::<D>(&s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/ogc/util.rs\",\n \"rank\": 96,\n \"score\": 182243.69444607705\n },\n {\n \"content\": \"/// Create an `arrow` struct from column meta data and data\\n\\npub fn struct_array_from_data(\\n\\n columns: Vec<Field>,\\n\\n column_values: Vec<ArrayRef>,\\n\\n number_of_features: usize,\\n\\n) -> Result<StructArray> {\\n\\n Ok(StructArray::from(\\n\\n ArrayData::builder(arrow::datatypes::DataType::Struct(columns))\\n\\n .child_data(\\n\\n column_values\\n\\n .into_iter()\\n\\n .map(|a| a.data().clone())\\n\\n .collect(),\\n\\n )\\n\\n .len(number_of_features)\\n\\n .build()?,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datatypes/src/collections/feature_collection.rs\",\n \"rank\": 97,\n \"score\": 180000.6982706891\n },\n {\n \"content\": \"/// Parse bbox, format is: \\\"x1,y1,x2,y2\\\"\\n\\npub fn parse_bbox<'de, D>(deserializer: D) -> Result<BoundingBox2D, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n\\n\\n let split: Vec<Result<f64, std::num::ParseFloatError>> = s.split(',').map(str::parse).collect();\\n\\n\\n\\n if let [Ok(x1), Ok(y1), Ok(x2), Ok(y2)] = *split.as_slice() {\\n\\n BoundingBox2D::new(Coordinate2D::new(x1, y1), Coordinate2D::new(x2, y2))\\n\\n .map_err(D::Error::custom)\\n\\n } else {\\n\\n Err(D::Error::custom(\\\"Invalid bbox\\\"))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/ogc/util.rs\",\n \"rank\": 98,\n \"score\": 179619.79926248046\n },\n {\n \"content\": \"/// Parse the `SpatialResolution` of a request by parsing `x,y`, e.g. `0.1,0.1`.\\n\\npub fn parse_spatial_resolution<'de, D>(deserializer: D) -> Result<SpatialResolution, D::Error>\\n\\nwhere\\n\\n D: serde::Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n\\n\\n let split: Result<Vec<f64>, <f64 as FromStr>::Err> = s.split(',').map(f64::from_str).collect();\\n\\n\\n\\n match split.as_ref().map(Vec::as_slice) {\\n\\n Ok(&[x, y]) => SpatialResolution::new(x, y).map_err(D::Error::custom),\\n\\n Err(error) => Err(D::Error::custom(error)),\\n\\n Ok(..) => Err(D::Error::custom(\\\"Invalid spatial resolution\\\")),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"services/src/util/parsing.rs\",\n \"rank\": 99,\n \"score\": 179619.79926248046\n }\n]","isConversational":false}}},{"rowIdx":3694,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"9-smoke-basin/src/main.rs"},"repo_name":{"kind":"string","value":"coreyja/advent-of-code-2021"},"commit":{"kind":"string","value":"cea92fda8a849918dbbe26d007d57d5bc824d3ee"},"file_code":{"kind":"string","value":"use anyhow::{anyhow, Result};\nuse itertools::{iproduct, Itertools};\n\n#[derive(Debug)]\nstruct Board {\n cells: Vec<Vec<i32>>,\n}\n\nimpl Board {\n fn get(&self, pos: &Pos) -> i32 {\n self.cells[pos.0 as usize][pos.1 as usize]\n }\n}\n\n#[derive(Debug, Clone)]\nstruct Pos(i32, i32);\n\nimpl Pos {\n fn new(x: i32, y: i32) -> Self {\n Pos(x, y)\n }\n\n fn get_neighbours(&self, board: &Board) -> Vec<Pos> {\n let mut neighbours = Vec::new();\n for x in self.0 - 1..=self.0 + 1 {\n for y in self.1 - 1..=self.1 + 1 {\n if ((x == self.0) ^ (y == self.1))\n && x >= 0\n && y >= 0\n && x < board.cells.len() as i32\n && y < board.cells[x as usize].len() as i32\n {\n neighbours.push(Pos::new(x, y));\n }\n }\n }\n neighbours\n }\n\n fn is_low_point(&self, board: &Board) -> bool {\n let neighbours = self.get_neighbours(board);\n\n neighbours.iter().all(|neighbour| {\n board.cells[self.0 as usize][self.1 as usize]\n < board.cells[neighbour.0 as usize][neighbour.1 as usize]\n })\n }\n\n fn find_basin_size(&self, board: &Board) -> u32 {\n let mut visited = vec![vec![false; board.cells[0].len()]; board.cells.len()];\n let mut queue = vec![self.clone()];\n let mut size = 0;\n\n while let Some(pos) = queue.pop() {\n if visited[pos.0 as usize][pos.1 as usize] {\n continue;\n }\n visited[pos.0 as usize][pos.1 as usize] = true;\n\n let value = board.get(&pos);\n\n if value != 9 {\n size += 1;\n for n in pos.get_neighbours(board).into_iter() {\n queue.push(n);\n }\n }\n }\n\n size\n }\n}\n\nfn parse_input(s: &str) -> Result<Board> {\n fn parse_line(s: &str) -> Result<Vec<i32>> {\n s.trim()\n .chars()\n .map(|s| s.to_string().parse().map_err(|_| anyhow!(\"Parse error\")))\n .collect()\n }\n\n let cells = s\n .trim()\n .lines()\n .map(parse_line)\n .collect::<Result<Vec<Vec<_>>>>()?;\n\n Ok(Board { cells })\n}\n\nfn part2_ans(s: &str) -> Result<u32> {\n let board = parse_input(s)?;\n let size_x = board.cells.len() as i32;\n let size_y = board.cells[0].len() as i32;\n\n let low = iproduct!((0..size_x), (0..size_y))\n .map(|(x, y)| Pos::new(x, y))\n .filter(|pos| pos.is_low_point(&board))\n .collect_vec();\n\n let mut basin_sizes = low\n .iter()\n .map(|pos| pos.find_basin_size(&board))\n .collect_vec();\n\n basin_sizes.sort_unstable();\n\n Ok(basin_sizes[basin_sizes.len() - 3..].iter().product())\n}\n\nfn part1_ans(s: &str) -> Result<i32> {\n let board = parse_input(s)?;\n\n let size_x = board.cells.len() as i32;\n let size_y = board.cells[0].len() as i32;\n\n let low = iproduct!((0..size_x), (0..size_y))\n .map(|(x, y)| Pos::new(x, y))\n .filter(|pos| pos.is_low_point(&board))\n .collect_vec();\n\n Ok(low.iter().map(|pos| board.get(pos)).sum::<i32>() + low.len() as i32)\n}\nfn main() -> Result<()> {\n println!(\"Part 1\");\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\"))?);\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\"))?);\n\n println!(\"Part 2\");\n println!(\"Sample: {}\", part2_ans(include_str!(\"sample.input\"))?);\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\"))?);\n\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"use anyhow::{anyhow, Result};\nuse itertools::{iproduct, Itertools};\n\n#[derive(Debug)]\nstruct Board {\n cells: Vec<Vec<i32>>,\n}\n\nimpl Board {\n fn get(&self, pos: &Pos) -> i32 {\n self.cells[pos.0 as usize][pos.1 as usize]\n }\n}\n\n#[derive(Debug, Clone)]\nstruct Pos(i32, i32);\n\nimpl Pos {\n fn new(x: i32, y: i32) -> Self {\n Pos(x, y)\n }\n\n fn get_neighbours(&self, board: &Board) -> Vec<Pos> {\n let mut neighbours = Vec::new();\n for x in self.0 - 1..=self.0 + 1 {\n for y in self.1 - 1..=self.1 + 1 {\n if ((x == self.0) ^ (y == self.1))\n && x >= 0\n && y >= 0\n && x < board.cells.len() as i32\n && y < board.cells[x as usize].len() as i32\n {\n neighbours.push(Pos::new(x, y));\n }\n }\n }\n neighbours\n }\n\n fn is_low_point(&self, board: &Board) -> bool {\n let neighbours = self.get_neighbours(board);\n\n neighbours.iter().all(|neighbour| {\n board.cells[self.0 as usize][self.1 as usize]\n < board.cells[neighbour.0 as usize][neighbour.1 as usize]\n })\n }\n\n fn find_basin_size(&self, board: &Board) -> u32 {\n let mut visited = vec![vec![false; board.cells[0].len()]; board.cells.len()];\n let mut queue = vec![self.clone()];\n let mut size = 0;\n\n while let Some(pos) = queue.pop() {\n if visited[pos.0 as usize][pos.1 as usize] {\n continue;\n }\n visited[pos.0 as usiz"},"suffix":{"kind":"string","value":"\n}\n\nfn parse_input(s: &str) -> Result<Board> {\n fn parse_line(s: &str) -> Result<Vec<i32>> {\n s.trim()\n .chars()\n .map(|s| s.to_string().parse().map_err(|_| anyhow!(\"Parse error\")))\n .collect()\n }\n\n let cells = s\n .trim()\n .lines()\n .map(parse_line)\n .collect::<Result<Vec<Vec<_>>>>()?;\n\n Ok(Board { cells })\n}\n\nfn part2_ans(s: &str) -> Result<u32> {\n let board = parse_input(s)?;\n let size_x = board.cells.len() as i32;\n let size_y = board.cells[0].len() as i32;\n\n let low = iproduct!((0..size_x), (0..size_y))\n .map(|(x, y)| Pos::new(x, y))\n .filter(|pos| pos.is_low_point(&board))\n .collect_vec();\n\n let mut basin_sizes = low\n .iter()\n .map(|pos| pos.find_basin_size(&board))\n .collect_vec();\n\n basin_sizes.sort_unstable();\n\n Ok(basin_sizes[basin_sizes.len() - 3..].iter().product())\n}\n\nfn part1_ans(s: &str) -> Result<i32> {\n let board = parse_input(s)?;\n\n let size_x = board.cells.len() as i32;\n let size_y = board.cells[0].len() as i32;\n\n let low = iproduct!((0..size_x), (0..size_y))\n .map(|(x, y)| Pos::new(x, y))\n .filter(|pos| pos.is_low_point(&board))\n .collect_vec();\n\n Ok(low.iter().map(|pos| board.get(pos)).sum::<i32>() + low.len() as i32)\n}\nfn main() -> Result<()> {\n println!(\"Part 1\");\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\"))?);\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\"))?);\n\n println!(\"Part 2\");\n println!(\"Sample: {}\", part2_ans(include_str!(\"sample.input\"))?);\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\"))?);\n\n Ok(())\n}\n"},"middle":{"kind":"string","value":"e][pos.1 as usize] = true;\n\n let value = board.get(&pos);\n\n if value != 9 {\n size += 1;\n for n in pos.get_neighbours(board).into_iter() {\n queue.push(n);\n }\n }\n }\n\n size\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"fn part2_ans(s: &str) -> Result<(usize, u32, u32)> {\n\n let nums = parse_input(s)?;\n\n\n\n (0..nums.len())\n\n .map(|i| {\n\n (\n\n i,\n\n sum_of_additions_diff(&nums, i as u32),\n\n sum_of_diff(&nums, i as u32),\n\n )\n\n })\n\n .min_by_key(|(_, x, _)| *x)\n\n .ok_or_else(|| anyhow!(\"No min found\"))\n\n}\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":0,"score":156978.93496276118},{"content":"fn part1_ans(s: &str) -> Result<(usize, u32)> {\n\n let nums = parse_input(s)?;\n\n\n\n (0..nums.len())\n\n .map(|i| (i, sum_of_diff(&nums, i as u32)))\n\n .min_by_key(|(_, x)| *x)\n\n .ok_or_else(|| anyhow!(\"No min found\"))\n\n}\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":1,"score":146823.15510809823},{"content":"fn part2_ans(s: &str) -> Result<i32> {\n\n let mut board = parse_input(s)?;\n\n\n\n for i in 0.. {\n\n let flashed = board.single_cycle()?;\n\n\n\n if flashed == 100 {\n\n return Ok(i + 1);\n\n }\n\n }\n\n\n\n Err(anyhow!(\"Infinite loop\"))\n\n}\n\n\n","file_path":"11-dumbo-octopus/src/main.rs","rank":2,"score":128943.04782484737},{"content":"fn part1_ans(s: &str) -> Result<i32> {\n\n let mut board = parse_input(s)?;\n\n\n\n let mut sum = 0;\n\n\n\n for _ in 0..100 {\n\n sum += board.single_cycle()?;\n\n }\n\n\n\n sum.try_into().map_err(|_| anyhow!(\"Overflow\"))\n\n}\n\n\n","file_path":"11-dumbo-octopus/src/main.rs","rank":3,"score":128943.04782484737},{"content":"fn parse_input(s: &str) -> Result<Board> {\n\n fn parse_line(s: &str) -> Result<Vec<i32>> {\n\n s.trim()\n\n .chars()\n\n .map(|s| s.to_string().parse().map_err(|_| anyhow!(\"Parse error\")))\n\n .collect()\n\n }\n\n\n\n let cells = s\n\n .trim()\n\n .lines()\n\n .map(parse_line)\n\n .collect::<Result<Vec<Vec<_>>>>()?;\n\n\n\n Ok(Board { cells })\n\n}\n\n\n","file_path":"11-dumbo-octopus/src/main.rs","rank":5,"score":128840.82380236653},{"content":"fn parse_input(s: &str) -> Result<Vec<u32>> {\n\n s.trim()\n\n .split(',')\n\n .map(|s| {\n\n s.parse()\n\n .map_err(|e| anyhow!(\"Couldn't parse input: {}\", e))\n\n })\n\n .collect()\n\n}\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":8,"score":123340.66588359684},{"content":"#[derive(Debug)]\n\nstruct Board<const N: usize> {\n\n cells: [[Cell; N]; N],\n\n}\n\n\n\nimpl<const N: usize> Board<N> {\n\n fn from_str(s: &str) -> Result<Self> {\n\n fn parse_row<const N: usize>(row: &str) -> Result<[u64; N]> {\n\n row.split_whitespace()\n\n .map(|s| s.parse::<u64>().context(\"parse error\"))\n\n .collect::<Result<Vec<u64>>>()?\n\n .try_into()\n\n .map_err(|v: Vec<_>| {\n\n anyhow!(\n\n \"Error making row from vec, vec has length {} where N={}\",\n\n v.len(),\n\n N\n\n )\n\n })\n\n }\n\n\n","file_path":"4-giant-squid/src/main.rs","rank":9,"score":122996.8396242897},{"content":"#[derive(Debug, Clone, PartialEq, Eq)]\n\nstruct Pos(i32, i32);\n\n\n\nimpl Pos {\n\n fn new(x: i32, y: i32) -> Self {\n\n Pos(x, y)\n\n }\n\n\n\n fn get_neighbours(&self, board: &Board) -> Vec<Pos> {\n\n let mut neighbours = Vec::new();\n\n\n\n for x in self.0 - 1..=self.0 + 1 {\n\n for y in self.1 - 1..=self.1 + 1 {\n\n if !((x == self.0) && (y == self.1))\n\n && x >= 0\n\n && y >= 0\n\n && x < board.cells.len() as i32\n\n && y < board.cells[x as usize].len() as i32\n\n {\n\n neighbours.push(Pos::new(x, y));\n\n }\n","file_path":"11-dumbo-octopus/src/main.rs","rank":11,"score":117445.3039136698},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct Cell {\n\n num: u64,\n\n marked: bool,\n\n}\n\n\n","file_path":"4-giant-squid/src/main.rs","rank":12,"score":114177.35380200097},{"content":"#[derive(Debug)]\n\nstruct Board {\n\n cells: Vec<Vec<i32>>,\n\n}\n\n\n\nimpl Board {\n\n fn get(&self, pos: &Pos) -> i32 {\n\n self.cells[pos.0 as usize][pos.1 as usize]\n\n }\n\n\n\n fn set(&mut self, pos: &Pos, value: i32) {\n\n self.cells[pos.0 as usize][pos.1 as usize] = value\n\n }\n\n}\n\n\n","file_path":"11-dumbo-octopus/src/main.rs","rank":13,"score":113538.02556665127},{"content":"fn parse_file(s: &str) -> Result<(Vec<u64>, Vec<Board<5>>)> {\n\n let mut split = s.split(\"\\n\\n\");\n\n let chosen_numbers = split\n\n .next()\n\n .unwrap()\n\n .split(',')\n\n .map(|s| {\n\n s.parse()\n\n .map_err(|_| anyhow!(\"Couldn't parse the chosen numbers into u64\"))\n\n })\n\n .collect::<Result<Vec<_>>>()?;\n\n\n\n let boards = split\n\n .map(Board::<5>::from_str)\n\n .collect::<Result<Vec<Board<5>>>>()?;\n\n\n\n Ok((chosen_numbers, boards))\n\n}\n\n\n","file_path":"4-giant-squid/src/main.rs","rank":15,"score":112160.32856296169},{"content":"fn alive_after_days(mut swarm: Swarm, days: usize) -> usize {\n\n for _ in 0..days {\n\n simulate_swarm(&mut swarm);\n\n }\n\n\n\n swarm.iter().sum()\n\n}\n\n\n","file_path":"6-lanternfish/src/main.rs","rank":16,"score":108657.63755814612},{"content":"fn part1_ans(s: &str) -> Result<usize> {\n\n let swarm = parse_input(s)?;\n\n\n\n Ok(alive_after_days(swarm, 80))\n\n}\n\n\n","file_path":"6-lanternfish/src/main.rs","rank":17,"score":107891.8172350846},{"content":"fn part2_ans(s: &str) -> Result<usize> {\n\n let swarm = parse_input(s)?;\n\n\n\n Ok(alive_after_days(swarm, 256))\n\n}\n\n\n","file_path":"6-lanternfish/src/main.rs","rank":18,"score":107891.8172350846},{"content":"fn diff_u32(a: u32, b: u32) -> u32 {\n\n if a > b {\n\n a - b\n\n } else {\n\n b - a\n\n }\n\n}\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":19,"score":107135.75832856},{"content":"fn part1_ans(s: &str) -> Result<usize> {\n\n let connections = parse_connections(s);\n\n let paths = make_paths_part1(&connections, \"end\", vec![\"start\"]);\n\n\n\n Ok(paths.len())\n\n}\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":20,"score":105705.39371396526},{"content":"fn part1_ans(s: &str) -> Result<usize> {\n\n let lines = parse_input(s)?.into_iter().filter(|l| l.is_non_diagonal());\n\n let covered_counts = get_covered_counts(lines);\n\n\n\n Ok(covered_counts\n\n .iter()\n\n .filter(|(_key, value)| **value >= 2)\n\n .count())\n\n}\n\n\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":21,"score":105705.39371396526},{"content":"fn part2_ans(s: &str) -> Result<usize> {\n\n let lines = parse_input(s)?;\n\n let covered_counts = get_covered_counts(lines.into_iter());\n\n\n\n Ok(covered_counts\n\n .iter()\n\n .filter(|(_key, value)| **value >= 2)\n\n .count())\n\n}\n\n\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":22,"score":105705.39371396526},{"content":"fn part2_ans(s: &str) -> Result<usize> {\n\n let connections = parse_connections(s);\n\n let paths = make_paths_part2(&connections, \"end\", vec![\"start\"]);\n\n\n\n Ok(paths.len())\n\n}\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":23,"score":105705.39371396526},{"content":"fn addition_up_to(n: u32) -> u32 {\n\n (1..=n).sum()\n\n}\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":24,"score":103775.48353232356},{"content":"fn sum_of_diff(nums: &[u32], index: u32) -> u32 {\n\n let mut diff: u32 = 0;\n\n\n\n for n in nums {\n\n diff += diff_u32(*n, index);\n\n }\n\n\n\n diff\n\n}\n\n\n\n// fn least_squares_index(nums: &[u32]) -> (usize, u32) {\n\n// dbg!((0..*nums.iter().max().unwrap())\n\n// .map(|i| (i, sum_of_diff(nums, i as u32)))\n\n// .collect_vec());\n\n// }\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":25,"score":102479.707444235},{"content":"fn sum_of_additions_diff(nums: &[u32], index: u32) -> u32 {\n\n let mut diff: u32 = 0;\n\n\n\n for n in nums {\n\n diff += addition_up_to(diff_u32(*n, index));\n\n }\n\n\n\n diff\n\n}\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":26,"score":101405.66985370846},{"content":"fn main() -> Result<()> {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\"))?);\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {}\", part2_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\"))?);\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_part1() {\n\n assert_eq!(part1_ans(include_str!(\"sample.input\")).unwrap(), 5934);\n\n assert_eq!(part1_ans(include_str!(\"my.input\")).unwrap(), 352151);\n","file_path":"6-lanternfish/src/main.rs","rank":27,"score":95135.93375736772},{"content":"fn main() -> Result<()> {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\"))?);\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {}\", part2_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\"))?);\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_iter_straight() {\n\n let l = Line {\n\n start: Position { x: 0, y: 0 },\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":28,"score":93408.61063492464},{"content":"fn main() -> Result<()> {\n\n println!(\"Part 1\");\n\n println!(\"Small: {}\", part1_ans(include_str!(\"small.input\"))?);\n\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\"))?);\n\n\n\n println!();\n\n println!(\"Part 2\");\n\n println!(\"Sample: {}\", part2_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\"))?);\n\n\n\n Ok(())\n\n}\n","file_path":"11-dumbo-octopus/src/main.rs","rank":29,"score":93408.61063492464},{"content":"fn main() -> Result<()> {\n\n println!(\"Part 1\");\n\n println!(\"Small: {}\", part1_ans(include_str!(\"small.input\"))?);\n\n println!(\"Medium: {}\", part1_ans(include_str!(\"medium.input\"))?);\n\n println!(\"Large: {}\", part1_ans(include_str!(\"large.input\"))?);\n\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\"))?);\n\n\n\n println!();\n\n println!(\"Part 2\");\n\n println!(\"Small: {}\", part2_ans(include_str!(\"small.input\"))?);\n\n println!(\"Medium: {}\", part2_ans(include_str!(\"medium.input\"))?);\n\n println!(\"Large: {}\", part2_ans(include_str!(\"large.input\"))?);\n\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\"))?);\n\n\n\n Ok(())\n\n}\n","file_path":"12-passage-pathing/src/main.rs","rank":30,"score":93408.61063492464},{"content":"fn main() -> Result<()> {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {:?}\", part1_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {:?}\", part1_ans(include_str!(\"my.input\"))?);\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {:?}\", part2_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {:?}\", part2_ans(include_str!(\"my.input\"))?);\n\n\n\n Ok(())\n\n}\n","file_path":"7-whale-treachery/src/main.rs","rank":31,"score":93408.61063492464},{"content":"fn main() -> Result<()> {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {:?}\", part1_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {:?}\", part1_ans(include_str!(\"my.input\"))?);\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {:?}\", part2_ans(include_str!(\"sample.input\"))?);\n\n println!(\"My: {:?}\", part2_ans(include_str!(\"my.input\"))?);\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_part_1() {\n\n assert_eq!(Some(4512), part1_ans(include_str!(\"sample.input\")).unwrap());\n\n assert_eq!(Some(38594), part1_ans(include_str!(\"my.input\")).unwrap());\n\n }\n\n\n\n #[test]\n\n fn test_part_2() {\n\n assert_eq!(Some(1924), part2_ans(include_str!(\"sample.input\")).unwrap());\n\n assert_eq!(Some(21184), part2_ans(include_str!(\"my.input\")).unwrap());\n\n }\n\n}\n","file_path":"4-giant-squid/src/main.rs","rank":33,"score":93408.61063492464},{"content":"fn simulate_swarm(swarm: &mut Swarm) {\n\n let zero = swarm[0];\n\n\n\n for i in 0..8 {\n\n swarm[i] = swarm[i + 1];\n\n }\n\n\n\n swarm[8] = zero;\n\n swarm[6] += zero;\n\n}\n\n\n","file_path":"6-lanternfish/src/main.rs","rank":34,"score":88067.47355586733},{"content":"fn parse_input(input: &str) -> Result<Swarm> {\n\n let mut swarm: Swarm = [0; 9];\n\n\n\n for f in input\n\n .trim()\n\n .split(',')\n\n .map(|s| {\n\n s.parse()\n\n .map_err(|e| anyhow::anyhow!(\"Couldnt not parse to u32 {}\", e))\n\n })\n\n .collect::<Result<Vec<u32>>>()?\n\n .into_iter()\n\n {\n\n swarm[f as usize] += 1;\n\n }\n\n\n\n Ok(swarm)\n\n}\n\n\n","file_path":"6-lanternfish/src/main.rs","rank":35,"score":81501.1292458201},{"content":"fn parse_input(s: &str) -> Result<Vec<Line>> {\n\n s.lines().map(Line::from_str).collect()\n\n}\n\n\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":36,"score":78229.96037580242},{"content":"fn part1_ans(s: &str) -> Result<Option<u64>> {\n\n let (chosen_numbers, mut boards) = parse_file(s)?;\n\n\n\n for n in chosen_numbers.iter() {\n\n for b in boards.iter_mut() {\n\n b.mark(*n);\n\n\n\n if let Some(score) = b.score() {\n\n return Ok(Some(score * n));\n\n }\n\n }\n\n }\n\n\n\n Ok(None)\n\n}\n\n\n","file_path":"4-giant-squid/src/main.rs","rank":37,"score":78229.96037580242},{"content":"fn part2_ans(s: &str) -> Result<Option<u64>> {\n\n let (chosen_numbers, boards) = parse_file(s)?;\n\n\n\n let mut not_won_boards = boards;\n\n\n\n for n in chosen_numbers.iter() {\n\n for b in not_won_boards.iter_mut() {\n\n b.mark(*n);\n\n }\n\n\n\n if not_won_boards.len() == 1 {\n\n let last_board = ¬_won_boards[0];\n\n\n\n if let Some(score) = last_board.score() {\n\n return Ok(Some(score * n));\n\n }\n\n }\n\n\n\n not_won_boards = not_won_boards.into_iter().filter(|b| !b.is_win()).collect();\n\n }\n\n\n\n Ok(None)\n\n}\n\n\n","file_path":"4-giant-squid/src/main.rs","rank":38,"score":78229.96037580242},{"content":"fn parse_line(line: &str) -> Result<Vec<char>, char> {\n\n let mut stack = vec![];\n\n\n\n for character in line.chars() {\n\n match character {\n\n '(' | '{' | '[' | '<' => stack.push(character),\n\n ')' | '}' | ']' | '>' => {\n\n if stack.last().map(close_char) == Some(character) {\n\n stack.pop();\n\n } else {\n\n return Err(character);\n\n }\n\n }\n\n _ => panic!(\"invalid character\"),\n\n }\n\n }\n\n\n\n Ok(stack)\n\n}\n\n\n","file_path":"10-syntax-scoring/src/main.rs","rank":39,"score":74043.74101879401},{"content":"fn filter_common(mut v: Vec<Vec<char>>, filter_on: MostOrLeastCommon) -> Vec<char> {\n\n let mut current_digit = 0;\n\n\n\n while v.len() > 1 {\n\n let mut digits = vec![];\n\n\n\n for line in v.iter() {\n\n digits.push(line[current_digit]);\n\n }\n\n\n\n let ((least, least_count), (most, most_count)) = least_and_most_common_with_counts(digits);\n\n let matching_digit = if least_count == most_count {\n\n match filter_on {\n\n MostOrLeastCommon::Most => '1',\n\n MostOrLeastCommon::Least => '0',\n\n }\n\n } else {\n\n match filter_on {\n\n MostOrLeastCommon::Most => most,\n\n MostOrLeastCommon::Least => least,\n","file_path":"3-binary-diagnostic/src/main.rs","rank":40,"score":68829.63331617505},{"content":"type Pos = (u32, u32);\n\n\n","file_path":"2-dive/src/main.rs","rank":41,"score":66736.11250170958},{"content":"fn part1_ans(s: &str) -> usize {\n\n let mut input = Input::parse(s);\n\n\n\n input.fold_first();\n\n\n\n input.holes.len()\n\n}\n\n\n","file_path":"13-transparent-oragami/src/main.rs","rank":42,"score":63260.24508176569},{"content":"fn count_increases(lines: &[u64]) -> usize {\n\n lines.iter().tuple_windows().filter(|(a, b)| a < b).count()\n\n}\n\n\n","file_path":"1-sonar-sweep/src/main.rs","rank":43,"score":61823.72773107386},{"content":"fn part1_ans(s: &str) -> usize {\n\n let input = parse_str(s);\n\n\n\n input\n\n .into_iter()\n\n .map(|(_, right)| {\n\n right\n\n .iter()\n\n .filter(|x| {\n\n let length = x.len();\n\n\n\n length == 2 || length == 3 || length == 4 || length == 7\n\n })\n\n .count()\n\n })\n\n .sum()\n\n}\n\n\n","file_path":"8-seven-segment-search/src/main.rs","rank":44,"score":61823.72773107386},{"content":"fn least_and_most_common_with_counts(v: Vec<char>) -> ((char, usize), (char, usize)) {\n\n let counts = v.into_iter().counts();\n\n\n\n let counts_v: Vec<_> = counts.into_iter().collect_vec();\n\n\n\n let (min, max) = counts_v\n\n .into_iter()\n\n .minmax_by_key(|x| x.1)\n\n .into_option()\n\n .unwrap();\n\n\n\n (min, max)\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":45,"score":61819.31310810694},{"content":"#[derive(Debug, PartialEq)]\n\nstruct Sub {\n\n pos: Pos,\n\n aim: u32,\n\n}\n\n\n\nimpl Sub {\n\n fn new() -> Self {\n\n Sub {\n\n pos: (0, 0),\n\n aim: 0,\n\n }\n\n }\n\n\n\n fn from_moves(moves: &[Move]) -> Self {\n\n let mut sub = Sub::new();\n\n sub.eval_all(moves);\n\n sub\n\n }\n\n\n\n fn eval(&mut self, m: &Move) {\n","file_path":"2-dive/src/main.rs","rank":46,"score":57252.20205970164},{"content":"#[derive(Debug, PartialEq)]\n\nstruct Move {\n\n direction: Direction,\n\n distance: u32,\n\n}\n\n\n\nimpl Move {\n\n fn from_str(s: &str) -> Option<Move> {\n\n let mut parts = s.split_whitespace();\n\n let direction = parts.next().and_then(Direction::from_str);\n\n let distance = parts.next().and_then(|s| s.parse().ok());\n\n if direction.is_none() || distance.is_none() {\n\n return None;\n\n }\n\n\n\n Some(Move {\n\n direction: direction.unwrap(),\n\n distance: distance.unwrap(),\n\n })\n\n }\n\n\n","file_path":"2-dive/src/main.rs","rank":47,"score":57252.20205970164},{"content":"#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\n\nstruct Position {\n\n x: u32,\n\n y: u32,\n\n}\n\n\n\nimpl Position {\n\n fn from_str(s: &str) -> Result<Self> {\n\n s.trim()\n\n .split(',')\n\n .map(|s| {\n\n s.parse()\n\n .map_err(|_| anyhow!(\"Couldn't parse u32 from string\"))\n\n })\n\n .collect::<Result<Vec<u32>>>()\n\n .and_then(|v| {\n\n if v.len() == 2 {\n\n Ok(Position { x: v[0], y: v[1] })\n\n } else {\n\n Err(anyhow!(\"Wrong number of numbers in position\"))\n\n }\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":48,"score":56248.41776204893},{"content":"#[derive(Debug, Hash, PartialEq, Eq, PartialOrd, Ord, Clone)]\n\nstruct Pos {\n\n x: u32,\n\n y: u32,\n\n}\n\n\n\nimpl Pos {\n\n fn parse(s: &str) -> Pos {\n\n let mut iter = s.split(',');\n\n Pos {\n\n x: iter.next().unwrap().parse().unwrap(),\n\n y: iter.next().unwrap().parse().unwrap(),\n\n }\n\n }\n\n}\n\n\n","file_path":"13-transparent-oragami/src/main.rs","rank":49,"score":56248.274503981615},{"content":"#[derive(Debug)]\n\nstruct Input {\n\n holes: Vec<Pos>,\n\n folds: VecDeque<Fold>,\n\n}\n\n\n\nimpl Input {\n\n fn parse(s: &str) -> Self {\n\n let mut halves = s.split(\"\\n\\n\");\n\n let holes = halves.next().unwrap().lines().map(Pos::parse).collect();\n\n\n\n let folds = halves.next().unwrap().lines().map(Fold::parse).collect();\n\n\n\n Input { holes, folds }\n\n }\n\n\n\n fn fold_first(&mut self) {\n\n if let Some(fold) = self.folds.pop_front() {\n\n match fold {\n\n Fold::HorizontalAxis(pos) => {\n\n self.fold_horizontal(pos);\n","file_path":"13-transparent-oragami/src/main.rs","rank":50,"score":56246.30648942081},{"content":"#[derive(Debug)]\n\nstruct Line {\n\n start: Position,\n\n end: Position,\n\n}\n\n\n\nimpl Line {\n\n fn from_str(s: &str) -> Result<Self> {\n\n let mut parts = s.split(\"->\");\n\n\n\n let start_str = parts.next().unwrap();\n\n let end_str = parts.next().unwrap();\n\n\n\n let start = Position::from_str(start_str)?;\n\n let end = Position::from_str(end_str)?;\n\n\n\n Ok(Self { start, end })\n\n }\n\n\n\n fn to_cells(&self) -> Box<dyn Iterator<Item = Position>> {\n\n let mut current = self.start;\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":51,"score":56246.30648942081},{"content":"struct Puzzle {\n\n order: [Option<char>; 7],\n\n valid_arrangements: ValidArrangements,\n\n digits_signals: Vec<String>,\n\n}\n\n\n\nimpl Puzzle {\n\n fn solve(&mut self) -> u64 {\n\n let one_pattern = self\n\n .valid_arrangements\n\n .0\n\n .iter()\n\n .find(|s| s.len() == 2)\n\n .unwrap();\n\n let four_pattern = self\n\n .valid_arrangements\n\n .0\n\n .iter()\n\n .find(|s| s.len() == 4)\n\n .unwrap();\n","file_path":"8-seven-segment-search/src/main.rs","rank":52,"score":55308.52791045905},{"content":"fn get_covered_counts<T>(lines: T) -> HashMap<Position, usize>\n\nwhere\n\n T: Iterator<Item = Line>,\n\n{\n\n let mut chained_iter: Box<dyn Iterator<Item = Position> + '_> = Box::new(std::iter::empty());\n\n\n\n for line in lines {\n\n chained_iter = Box::new(chained_iter.chain(line.to_cells()));\n\n }\n\n\n\n chained_iter.counts()\n\n}\n\n\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":53,"score":53307.902240476156},{"content":"struct ValidArrangements(Vec<String>);\n\n\n","file_path":"8-seven-segment-search/src/main.rs","rank":54,"score":49267.360933938806},{"content":"fn main() {\n\n let sample = parse_file(include_str!(\"sample.input\"));\n\n let sample_ans = eval_simple_moves(&sample);\n\n\n\n let input = parse_file(include_str!(\"my.input\"));\n\n let ans = eval_simple_moves(&input);\n\n\n\n println!(\"Part 1\");\n\n println!(\n\n \"Sample Input: {:?} => {}\",\n\n sample_ans,\n\n sample_ans.0 * sample_ans.1\n\n );\n\n println!(\"My Input: {:?} => {}\", ans, ans.0 * ans.1);\n\n\n\n println!(\"Part 2\");\n\n let sample_sub = Sub::from_moves(&sample);\n\n println!(\n\n \"Sample Input: {:?} => {}\",\n\n sample_sub,\n","file_path":"2-dive/src/main.rs","rank":55,"score":44996.769572032994},{"content":"fn main() {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\")));\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample:\\n{}\", part2_ans(include_str!(\"sample.input\")));\n\n println!(\"My:\\n{}\", part2_ans(include_str!(\"my.input\")));\n\n}\n","file_path":"13-transparent-oragami/src/main.rs","rank":56,"score":44123.221890574525},{"content":"fn main() {\n\n let sample_input: Vec<u64> = transform_input(include_str!(\"sample.input\"));\n\n let my_input: Vec<u64> = transform_input(include_str!(\"my.input\"));\n\n\n\n println!(\"Part 1\");\n\n println!(\"Sample Answer: {}\", count_increases(&sample_input));\n\n println!(\"My Answer: {}\", count_increases(&my_input));\n\n\n\n println!(\"Part 2\");\n\n println!(\n\n \"Sample Answer: {}\",\n\n count_increases(&sum_three_windows(&sample_input))\n\n );\n\n println!(\n\n \"My Answer: {}\",\n\n count_increases(&sum_three_windows(&my_input))\n\n );\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"1-sonar-sweep/src/main.rs","rank":57,"score":44123.221890574525},{"content":"fn main() {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {}\", part1_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {}\", part1_ans(include_str!(\"my.input\")));\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {}\", part2_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {}\", part2_ans(include_str!(\"my.input\")));\n\n}\n","file_path":"10-syntax-scoring/src/main.rs","rank":58,"score":44123.221890574525},{"content":"fn main() {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {:?}\", part1_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {:?}\", part1_ans(include_str!(\"my.input\")));\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {:?}\", part2_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {:?}\", part2_ans(include_str!(\"my.input\")));\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_into_digit_position_vecs() {\n\n let input = \"101\\n010\\n111\";\n\n\n\n assert_eq!(\n\n vec![\n","file_path":"3-binary-diagnostic/src/main.rs","rank":59,"score":44123.221890574525},{"content":"fn main() {\n\n println!(\"Part 1\");\n\n println!(\"Sample: {:?}\", part1_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {:?}\", part1_ans(include_str!(\"my.input\")));\n\n\n\n println!(\"Part 2\");\n\n println!(\"Sample: {:?}\", part2_ans(include_str!(\"sample.input\")));\n\n println!(\"My: {:?}\", part2_ans(include_str!(\"my.input\")));\n\n}\n","file_path":"8-seven-segment-search/src/main.rs","rank":60,"score":43308.8288983231},{"content":"fn make_paths<'input>(\n\n connections: &HashMap<&'input str, Vec<&'input str>>,\n\n to: &'input str,\n\n path: Vec<&'input str>,\n\n path_filter: &dyn Fn(&Vec<&'input str>, &'input str) -> bool,\n\n) -> Vec<Vec<&'input str>> {\n\n let mut paths = Vec::new();\n\n\n\n let from = *path.last().unwrap();\n\n\n\n if from == to {\n\n paths.push(path);\n\n } else {\n\n for next in connections\n\n .get(from)\n\n .unwrap()\n\n .iter()\n\n .filter(|next| path_filter(&path, next))\n\n {\n\n let mut new_path = path.clone();\n\n new_path.push(next);\n\n paths.append(&mut make_paths(connections, to, new_path, path_filter));\n\n }\n\n }\n\n\n\n paths\n\n}\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":61,"score":41207.727527352756},{"content":"fn make_paths_part2<'input>(\n\n connections: &HashMap<&'input str, Vec<&'input str>>,\n\n to: &'input str,\n\n path: Vec<&'input str>,\n\n) -> Vec<Vec<&'input str>> {\n\n make_paths(connections, to, path, &|path, next| {\n\n !path.contains(&next)\n\n || next.chars().next().unwrap().is_ascii_uppercase()\n\n || (next != \"start\"\n\n && next != \"end\"\n\n && path\n\n .iter()\n\n .filter(|&x| x.chars().next().unwrap().is_ascii_lowercase())\n\n .counts()\n\n .iter()\n\n .all(|(_, count)| *count == 1))\n\n })\n\n}\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":62,"score":40494.94529009281},{"content":"fn make_paths_part1<'input>(\n\n connections: &HashMap<&'input str, Vec<&'input str>>,\n\n to: &'input str,\n\n path: Vec<&'input str>,\n\n) -> Vec<Vec<&'input str>> {\n\n make_paths(connections, to, path, &|path, next| {\n\n !path.contains(&next) || next.chars().next().unwrap().is_ascii_uppercase()\n\n })\n\n}\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":63,"score":40494.94529009281},{"content":"fn part2_ans(s: &str) -> String {\n\n let mut input = Input::parse(s);\n\n\n\n while !input.folds.is_empty() {\n\n input.fold_first();\n\n }\n\n\n\n let max_x = input.holes.iter().map(|p| p.x).max().unwrap();\n\n let max_y = input.holes.iter().map(|p| p.y).max().unwrap();\n\n\n\n let mut lines_grouped: HashMap<u32, Vec<_>> = HashMap::new();\n\n for h in input.holes.into_iter() {\n\n lines_grouped.entry(h.y).or_default().push(h.x);\n\n }\n\n\n\n (0..=max_y)\n\n .map(|y| {\n\n let v = lines_grouped.entry(y).or_default();\n\n (0..=max_x + 1)\n\n .map(|x| if v.contains(&x) { '█' } else { ' ' })\n\n .collect::<String>()\n\n })\n\n .join(\"\\n\")\n\n}\n\n\n","file_path":"13-transparent-oragami/src/main.rs","rank":64,"score":38288.428290859214},{"content":"fn part1_ans(s: &str) -> u64 {\n\n let input = s.trim().lines();\n\n\n\n let corrupt = input\n\n .map(parse_line)\n\n .filter_map(|result| result.err())\n\n .collect::<Vec<_>>();\n\n\n\n corrupt.iter().map(score_invalid).sum()\n\n}\n\n\n","file_path":"10-syntax-scoring/src/main.rs","rank":65,"score":38288.428290859214},{"content":"fn close_char(c: &char) -> char {\n\n match c {\n\n '{' => '}',\n\n '(' => ')',\n\n '[' => ']',\n\n '<' => '>',\n\n _ => panic!(\"invalid char\"),\n\n }\n\n}\n","file_path":"10-syntax-scoring/src/main.rs","rank":66,"score":38288.428290859214},{"content":"fn score_invalid(c: &char) -> u64 {\n\n match c {\n\n ')' => 3,\n\n ']' => 57,\n\n '}' => 1197,\n\n '>' => 25137,\n\n _ => panic!(\"invalid char\"),\n\n }\n\n}\n","file_path":"10-syntax-scoring/src/main.rs","rank":67,"score":38288.428290859214},{"content":"fn score_valid(c: &char) -> u64 {\n\n match c {\n\n ')' => 1,\n\n ']' => 2,\n\n '}' => 3,\n\n '>' => 4,\n\n _ => panic!(\"invalid char\"),\n\n }\n\n}\n\n\n","file_path":"10-syntax-scoring/src/main.rs","rank":68,"score":38288.428290859214},{"content":"fn part1_ans(s: &str) -> i64 {\n\n let digits = into_digit_position_vecs(s);\n\n let (epsilon, gamma) = calculate_gamma_and_epsilon(digits);\n\n\n\n let epsilon_num = i64::from_str_radix(&epsilon, 2).unwrap();\n\n let gamma_num = i64::from_str_radix(&gamma, 2).unwrap();\n\n\n\n epsilon_num * gamma_num\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":69,"score":38288.428290859214},{"content":"fn part2_ans(s: &str) -> u64 {\n\n let input = s.trim().lines();\n\n\n\n let mut scores = input\n\n .map(parse_line)\n\n .filter_map(|result| result.ok())\n\n .map(|mut stack| {\n\n stack.reverse();\n\n stack.iter().map(close_char).collect::<Vec<_>>()\n\n })\n\n .map(|stack| {\n\n let mut score = 0;\n\n\n\n for c in stack {\n\n score *= 5;\n\n score += score_valid(&c);\n\n }\n\n\n\n score\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n scores.sort_unstable();\n\n\n\n scores[scores.len() / 2]\n\n}\n\n\n","file_path":"10-syntax-scoring/src/main.rs","rank":70,"score":38288.428290859214},{"content":"fn part2_ans(s: &str) -> i64 {\n\n let v = into_vec(s);\n\n\n\n let oxygen: String = filter_common(v.clone(), MostOrLeastCommon::Most)\n\n .into_iter()\n\n .collect();\n\n let c02: String = filter_common(v, MostOrLeastCommon::Least)\n\n .into_iter()\n\n .collect();\n\n\n\n let oxygen_num = i64::from_str_radix(&oxygen, 2).unwrap();\n\n let c02_num = i64::from_str_radix(&c02, 2).unwrap();\n\n\n\n oxygen_num * c02_num\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":71,"score":38288.428290859214},{"content":"fn part2_ans(s: &str) -> u64 {\n\n let input = parse_str(s);\n\n\n\n input\n\n .into_iter()\n\n .map(|(valid_arrangements, right)| {\n\n let mut puzzle = Puzzle {\n\n order: [None, None, None, None, None, None, None],\n\n valid_arrangements,\n\n digits_signals: right.into_iter().map(|x| x.to_string()).collect(),\n\n };\n\n\n\n puzzle.solve()\n\n })\n\n .sum()\n\n}\n\n\n","file_path":"8-seven-segment-search/src/main.rs","rank":72,"score":37619.46326292871},{"content":"fn eval_simple_moves(moves: &[Move]) -> Pos {\n\n let mut pos = (0, 0);\n\n\n\n for m in moves {\n\n pos = m.simple_eval(pos);\n\n }\n\n\n\n pos\n\n}\n\n\n","file_path":"2-dive/src/main.rs","rank":73,"score":37619.46326292871},{"content":"fn parse_file(s: &str) -> Vec<Move> {\n\n s.lines()\n\n .map(Move::from_str)\n\n .collect::<Option<Vec<Move>>>()\n\n .unwrap()\n\n}\n\n\n","file_path":"2-dive/src/main.rs","rank":74,"score":37369.27605336597},{"content":"fn transform_input(file: &str) -> Vec<u64> {\n\n file.lines()\n\n .map(|line| line.parse::<u64>().unwrap())\n\n .collect()\n\n}\n\n\n","file_path":"1-sonar-sweep/src/main.rs","rank":75,"score":36071.243297144785},{"content":"fn into_vec(s: &str) -> Vec<Vec<char>> {\n\n s.lines().map(|l| l.chars().collect_vec()).collect_vec()\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":76,"score":35878.02622327306},{"content":"fn sum_three_windows(lines: &[u64]) -> Vec<u64> {\n\n lines\n\n .iter()\n\n .tuple_windows()\n\n .map(|(a, b, c)| a + b + c)\n\n .collect()\n\n}\n\n\n","file_path":"1-sonar-sweep/src/main.rs","rank":77,"score":35478.606989015956},{"content":"fn least_and_most_common(v: Vec<char>) -> (char, char) {\n\n let (min, max) = least_and_most_common_with_counts(v);\n\n\n\n (min.0, max.0)\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":78,"score":35248.95849498239},{"content":"fn into_digit_position_vecs(s: &str) -> Vec<Vec<char>> {\n\n let mut lines = s.lines().map(|l| l.chars()).collect_vec();\n\n let mut result = Vec::new();\n\n\n\n let mut chars_left = true;\n\n while chars_left {\n\n let mut current_new_line = Vec::new();\n\n for l in lines.iter_mut() {\n\n if let Some(c) = l.next() {\n\n current_new_line.push(c);\n\n } else {\n\n chars_left = false;\n\n }\n\n }\n\n if !current_new_line.is_empty() {\n\n result.push(current_new_line);\n\n }\n\n }\n\n\n\n result\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":79,"score":34656.32218685356},{"content":"fn parse_line(s: &str) -> (ValidArrangements, Vec<&str>) {\n\n let mut halves = s.trim().split('|');\n\n let left = halves\n\n .next()\n\n .unwrap()\n\n .trim()\n\n .split(' ')\n\n .map(|x| x.to_owned())\n\n .collect_vec();\n\n let right = halves.next().unwrap().trim().split(' ').collect::<Vec<_>>();\n\n\n\n (ValidArrangements(left), right)\n\n}\n\n\n","file_path":"8-seven-segment-search/src/main.rs","rank":80,"score":34097.04156352166},{"content":"fn parse_str(s: &str) -> Vec<(ValidArrangements, Vec<&str>)> {\n\n s.trim().split('\\n').map(parse_line).collect()\n\n}\n\n\n","file_path":"8-seven-segment-search/src/main.rs","rank":81,"score":32828.41381311869},{"content":"fn calculate_gamma_and_epsilon(digits: Vec<Vec<char>>) -> (String, String) {\n\n let mut epsilon_digits = vec![];\n\n let mut gamma_digits = vec![];\n\n\n\n for digit_line in digits {\n\n let (epsilon, gamma) = least_and_most_common(digit_line);\n\n epsilon_digits.push(epsilon);\n\n gamma_digits.push(gamma);\n\n }\n\n\n\n (\n\n epsilon_digits.into_iter().collect(),\n\n gamma_digits.into_iter().collect(),\n\n )\n\n}\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":82,"score":32828.41381311869},{"content":"fn parse_connections(input: &str) -> HashMap<&str, Vec<&str>> {\n\n let mut connections = HashMap::new();\n\n\n\n for line in input.lines() {\n\n let mut words = line.split('-');\n\n let from = words.next().unwrap();\n\n let to = words.next().unwrap();\n\n\n\n connections.entry(from).or_insert_with(Vec::new).push(to);\n\n connections.entry(to).or_insert_with(Vec::new).push(from);\n\n }\n\n\n\n connections\n\n}\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":83,"score":32828.41381311869},{"content":"// This represents the number of snakes in each 'lifecycle'\n\ntype Swarm = [usize; 9];\n\n\n","file_path":"6-lanternfish/src/main.rs","rank":84,"score":27597.26462365828},{"content":" }\n\n }\n\n neighbours\n\n }\n\n}\n\n\n\nimpl Board {\n\n fn all_positions(&self) -> Vec<Pos> {\n\n iproduct!(0..self.cells.len() as i32, 0..self.cells[0].len() as i32)\n\n .map(|(x, y)| Pos::new(x, y))\n\n .collect()\n\n }\n\n\n\n fn single_cycle(&mut self) -> Result<usize> {\n\n let mut flashed = vec![];\n\n\n\n for pos in self.all_positions() {\n\n let pos = Pos::new(pos.0, pos.1);\n\n\n\n let old_value = self.get(&pos);\n","file_path":"11-dumbo-octopus/src/main.rs","rank":87,"score":10.482095339413398},{"content":"use anyhow::{anyhow, Context, Result};\n\nuse itertools::Itertools;\n\nuse std::convert::TryInto;\n\n\n\n#[derive(Debug, Copy, Clone)]\n","file_path":"4-giant-squid/src/main.rs","rank":88,"score":8.241371792043385},{"content":"use anyhow::Result;\n\nuse itertools::Itertools;\n\nuse std::collections::HashMap;\n\n\n","file_path":"12-passage-pathing/src/main.rs","rank":89,"score":7.350514462618019},{"content":"use std::{cmp::Ordering, collections::HashMap};\n\n\n\nuse anyhow::{anyhow, Result};\n\nuse itertools::Itertools;\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\n","file_path":"5-hydrothermal-vents/src/main.rs","rank":90,"score":7.29791271321},{"content":"use anyhow::{anyhow, Result};\n\nuse itertools::{iproduct, Itertools};\n\n\n\n#[derive(Debug)]\n","file_path":"11-dumbo-octopus/src/main.rs","rank":92,"score":7.2070148369746585},{"content":"use itertools::Itertools;\n\nuse std::collections::{HashMap, VecDeque};\n\n\n\n#[derive(Debug, Hash, PartialEq, Eq, PartialOrd, Ord, Clone)]\n","file_path":"13-transparent-oragami/src/main.rs","rank":93,"score":5.729407955309654},{"content":"use itertools::Itertools;\n\n\n","file_path":"3-binary-diagnostic/src/main.rs","rank":94,"score":5.682668784330566},{"content":"use itertools::Itertools;\n\n\n","file_path":"1-sonar-sweep/src/main.rs","rank":95,"score":5.682668784330566},{"content":" fn unmarked_cells(&self) -> Vec<((usize, usize), Cell)> {\n\n (0..N)\n\n .cartesian_product(0..N)\n\n .filter(|(i, j)| !self.cells[*i][*j].marked)\n\n .map(|pos| (pos, self.cells[pos.0][pos.1]))\n\n .collect()\n\n }\n\n\n\n fn is_win(&self) -> bool {\n\n self.is_horizontal_win() || self.is_vertical_win()\n\n }\n\n\n\n fn rows(&self) -> [[Cell; N]; N] {\n\n self.cells\n\n }\n\n\n\n fn columns(&self) -> [[Cell; N]; N] {\n\n (0..N)\n\n .map(|i| {\n\n (0..N)\n","file_path":"4-giant-squid/src/main.rs","rank":96,"score":5.501790538880649},{"content":"use anyhow::{anyhow, Result};\n\n\n","file_path":"7-whale-treachery/src/main.rs","rank":97,"score":4.940959412068165},{"content":" }\n\n\n\n fn score(&self) -> Option<u64> {\n\n if self.is_win() {\n\n Some(self.unmarked_cells().iter().map(|(_, cell)| cell.num).sum())\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n fn mark(&mut self, num: u64) {\n\n for row in self.cells.iter_mut() {\n\n for cell in row {\n\n if cell.num == num {\n\n cell.marked = true;\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"4-giant-squid/src/main.rs","rank":98,"score":4.837897708801146},{"content":"use anyhow::Result;\n\n\n\n// This represents the number of snakes in each 'lifecycle'\n","file_path":"6-lanternfish/src/main.rs","rank":99,"score":4.381079351337432}],"string":"[\n {\n \"content\": \"fn part2_ans(s: &str) -> Result<(usize, u32, u32)> {\\n\\n let nums = parse_input(s)?;\\n\\n\\n\\n (0..nums.len())\\n\\n .map(|i| {\\n\\n (\\n\\n i,\\n\\n sum_of_additions_diff(&nums, i as u32),\\n\\n sum_of_diff(&nums, i as u32),\\n\\n )\\n\\n })\\n\\n .min_by_key(|(_, x, _)| *x)\\n\\n .ok_or_else(|| anyhow!(\\\"No min found\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 0,\n \"score\": 156978.93496276118\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> Result<(usize, u32)> {\\n\\n let nums = parse_input(s)?;\\n\\n\\n\\n (0..nums.len())\\n\\n .map(|i| (i, sum_of_diff(&nums, i as u32)))\\n\\n .min_by_key(|(_, x)| *x)\\n\\n .ok_or_else(|| anyhow!(\\\"No min found\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 1,\n \"score\": 146823.15510809823\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> Result<i32> {\\n\\n let mut board = parse_input(s)?;\\n\\n\\n\\n for i in 0.. {\\n\\n let flashed = board.single_cycle()?;\\n\\n\\n\\n if flashed == 100 {\\n\\n return Ok(i + 1);\\n\\n }\\n\\n }\\n\\n\\n\\n Err(anyhow!(\\\"Infinite loop\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 2,\n \"score\": 128943.04782484737\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> Result<i32> {\\n\\n let mut board = parse_input(s)?;\\n\\n\\n\\n let mut sum = 0;\\n\\n\\n\\n for _ in 0..100 {\\n\\n sum += board.single_cycle()?;\\n\\n }\\n\\n\\n\\n sum.try_into().map_err(|_| anyhow!(\\\"Overflow\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 3,\n \"score\": 128943.04782484737\n },\n {\n \"content\": \"fn parse_input(s: &str) -> Result<Board> {\\n\\n fn parse_line(s: &str) -> Result<Vec<i32>> {\\n\\n s.trim()\\n\\n .chars()\\n\\n .map(|s| s.to_string().parse().map_err(|_| anyhow!(\\\"Parse error\\\")))\\n\\n .collect()\\n\\n }\\n\\n\\n\\n let cells = s\\n\\n .trim()\\n\\n .lines()\\n\\n .map(parse_line)\\n\\n .collect::<Result<Vec<Vec<_>>>>()?;\\n\\n\\n\\n Ok(Board { cells })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 5,\n \"score\": 128840.82380236653\n },\n {\n \"content\": \"fn parse_input(s: &str) -> Result<Vec<u32>> {\\n\\n s.trim()\\n\\n .split(',')\\n\\n .map(|s| {\\n\\n s.parse()\\n\\n .map_err(|e| anyhow!(\\\"Couldn't parse input: {}\\\", e))\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 8,\n \"score\": 123340.66588359684\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Board<const N: usize> {\\n\\n cells: [[Cell; N]; N],\\n\\n}\\n\\n\\n\\nimpl<const N: usize> Board<N> {\\n\\n fn from_str(s: &str) -> Result<Self> {\\n\\n fn parse_row<const N: usize>(row: &str) -> Result<[u64; N]> {\\n\\n row.split_whitespace()\\n\\n .map(|s| s.parse::<u64>().context(\\\"parse error\\\"))\\n\\n .collect::<Result<Vec<u64>>>()?\\n\\n .try_into()\\n\\n .map_err(|v: Vec<_>| {\\n\\n anyhow!(\\n\\n \\\"Error making row from vec, vec has length {} where N={}\\\",\\n\\n v.len(),\\n\\n N\\n\\n )\\n\\n })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 9,\n \"score\": 122996.8396242897\n },\n {\n \"content\": \"#[derive(Debug, Clone, PartialEq, Eq)]\\n\\nstruct Pos(i32, i32);\\n\\n\\n\\nimpl Pos {\\n\\n fn new(x: i32, y: i32) -> Self {\\n\\n Pos(x, y)\\n\\n }\\n\\n\\n\\n fn get_neighbours(&self, board: &Board) -> Vec<Pos> {\\n\\n let mut neighbours = Vec::new();\\n\\n\\n\\n for x in self.0 - 1..=self.0 + 1 {\\n\\n for y in self.1 - 1..=self.1 + 1 {\\n\\n if !((x == self.0) && (y == self.1))\\n\\n && x >= 0\\n\\n && y >= 0\\n\\n && x < board.cells.len() as i32\\n\\n && y < board.cells[x as usize].len() as i32\\n\\n {\\n\\n neighbours.push(Pos::new(x, y));\\n\\n }\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 11,\n \"score\": 117445.3039136698\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct Cell {\\n\\n num: u64,\\n\\n marked: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 12,\n \"score\": 114177.35380200097\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Board {\\n\\n cells: Vec<Vec<i32>>,\\n\\n}\\n\\n\\n\\nimpl Board {\\n\\n fn get(&self, pos: &Pos) -> i32 {\\n\\n self.cells[pos.0 as usize][pos.1 as usize]\\n\\n }\\n\\n\\n\\n fn set(&mut self, pos: &Pos, value: i32) {\\n\\n self.cells[pos.0 as usize][pos.1 as usize] = value\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 13,\n \"score\": 113538.02556665127\n },\n {\n \"content\": \"fn parse_file(s: &str) -> Result<(Vec<u64>, Vec<Board<5>>)> {\\n\\n let mut split = s.split(\\\"\\\\n\\\\n\\\");\\n\\n let chosen_numbers = split\\n\\n .next()\\n\\n .unwrap()\\n\\n .split(',')\\n\\n .map(|s| {\\n\\n s.parse()\\n\\n .map_err(|_| anyhow!(\\\"Couldn't parse the chosen numbers into u64\\\"))\\n\\n })\\n\\n .collect::<Result<Vec<_>>>()?;\\n\\n\\n\\n let boards = split\\n\\n .map(Board::<5>::from_str)\\n\\n .collect::<Result<Vec<Board<5>>>>()?;\\n\\n\\n\\n Ok((chosen_numbers, boards))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 15,\n \"score\": 112160.32856296169\n },\n {\n \"content\": \"fn alive_after_days(mut swarm: Swarm, days: usize) -> usize {\\n\\n for _ in 0..days {\\n\\n simulate_swarm(&mut swarm);\\n\\n }\\n\\n\\n\\n swarm.iter().sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 16,\n \"score\": 108657.63755814612\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> Result<usize> {\\n\\n let swarm = parse_input(s)?;\\n\\n\\n\\n Ok(alive_after_days(swarm, 80))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 17,\n \"score\": 107891.8172350846\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> Result<usize> {\\n\\n let swarm = parse_input(s)?;\\n\\n\\n\\n Ok(alive_after_days(swarm, 256))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 18,\n \"score\": 107891.8172350846\n },\n {\n \"content\": \"fn diff_u32(a: u32, b: u32) -> u32 {\\n\\n if a > b {\\n\\n a - b\\n\\n } else {\\n\\n b - a\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 19,\n \"score\": 107135.75832856\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> Result<usize> {\\n\\n let connections = parse_connections(s);\\n\\n let paths = make_paths_part1(&connections, \\\"end\\\", vec![\\\"start\\\"]);\\n\\n\\n\\n Ok(paths.len())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 20,\n \"score\": 105705.39371396526\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> Result<usize> {\\n\\n let lines = parse_input(s)?.into_iter().filter(|l| l.is_non_diagonal());\\n\\n let covered_counts = get_covered_counts(lines);\\n\\n\\n\\n Ok(covered_counts\\n\\n .iter()\\n\\n .filter(|(_key, value)| **value >= 2)\\n\\n .count())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 21,\n \"score\": 105705.39371396526\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> Result<usize> {\\n\\n let lines = parse_input(s)?;\\n\\n let covered_counts = get_covered_counts(lines.into_iter());\\n\\n\\n\\n Ok(covered_counts\\n\\n .iter()\\n\\n .filter(|(_key, value)| **value >= 2)\\n\\n .count())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 22,\n \"score\": 105705.39371396526\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> Result<usize> {\\n\\n let connections = parse_connections(s);\\n\\n let paths = make_paths_part2(&connections, \\\"end\\\", vec![\\\"start\\\"]);\\n\\n\\n\\n Ok(paths.len())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 23,\n \"score\": 105705.39371396526\n },\n {\n \"content\": \"fn addition_up_to(n: u32) -> u32 {\\n\\n (1..=n).sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 24,\n \"score\": 103775.48353232356\n },\n {\n \"content\": \"fn sum_of_diff(nums: &[u32], index: u32) -> u32 {\\n\\n let mut diff: u32 = 0;\\n\\n\\n\\n for n in nums {\\n\\n diff += diff_u32(*n, index);\\n\\n }\\n\\n\\n\\n diff\\n\\n}\\n\\n\\n\\n// fn least_squares_index(nums: &[u32]) -> (usize, u32) {\\n\\n// dbg!((0..*nums.iter().max().unwrap())\\n\\n// .map(|i| (i, sum_of_diff(nums, i as u32)))\\n\\n// .collect_vec());\\n\\n// }\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 25,\n \"score\": 102479.707444235\n },\n {\n \"content\": \"fn sum_of_additions_diff(nums: &[u32], index: u32) -> u32 {\\n\\n let mut diff: u32 = 0;\\n\\n\\n\\n for n in nums {\\n\\n diff += addition_up_to(diff_u32(*n, index));\\n\\n }\\n\\n\\n\\n diff\\n\\n}\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 26,\n \"score\": 101405.66985370846\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {}\\\", part1_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part1_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {}\\\", part2_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part2_ans(include_str!(\\\"my.input\\\"))?);\\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_part1() {\\n\\n assert_eq!(part1_ans(include_str!(\\\"sample.input\\\")).unwrap(), 5934);\\n\\n assert_eq!(part1_ans(include_str!(\\\"my.input\\\")).unwrap(), 352151);\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 27,\n \"score\": 95135.93375736772\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {}\\\", part1_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part1_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {}\\\", part2_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part2_ans(include_str!(\\\"my.input\\\"))?);\\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_iter_straight() {\\n\\n let l = Line {\\n\\n start: Position { x: 0, y: 0 },\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 28,\n \"score\": 93408.61063492464\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Small: {}\\\", part1_ans(include_str!(\\\"small.input\\\"))?);\\n\\n println!(\\\"Sample: {}\\\", part1_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part1_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n println!();\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {}\\\", part2_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part2_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 29,\n \"score\": 93408.61063492464\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Small: {}\\\", part1_ans(include_str!(\\\"small.input\\\"))?);\\n\\n println!(\\\"Medium: {}\\\", part1_ans(include_str!(\\\"medium.input\\\"))?);\\n\\n println!(\\\"Large: {}\\\", part1_ans(include_str!(\\\"large.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part1_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n println!();\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Small: {}\\\", part2_ans(include_str!(\\\"small.input\\\"))?);\\n\\n println!(\\\"Medium: {}\\\", part2_ans(include_str!(\\\"medium.input\\\"))?);\\n\\n println!(\\\"Large: {}\\\", part2_ans(include_str!(\\\"large.input\\\"))?);\\n\\n println!(\\\"My: {}\\\", part2_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 30,\n \"score\": 93408.61063492464\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part1_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {:?}\\\", part1_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part2_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {:?}\\\", part2_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 31,\n \"score\": 93408.61063492464\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part1_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {:?}\\\", part1_ans(include_str!(\\\"my.input\\\"))?);\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part2_ans(include_str!(\\\"sample.input\\\"))?);\\n\\n println!(\\\"My: {:?}\\\", part2_ans(include_str!(\\\"my.input\\\"))?);\\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_part_1() {\\n\\n assert_eq!(Some(4512), part1_ans(include_str!(\\\"sample.input\\\")).unwrap());\\n\\n assert_eq!(Some(38594), part1_ans(include_str!(\\\"my.input\\\")).unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_part_2() {\\n\\n assert_eq!(Some(1924), part2_ans(include_str!(\\\"sample.input\\\")).unwrap());\\n\\n assert_eq!(Some(21184), part2_ans(include_str!(\\\"my.input\\\")).unwrap());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 33,\n \"score\": 93408.61063492464\n },\n {\n \"content\": \"fn simulate_swarm(swarm: &mut Swarm) {\\n\\n let zero = swarm[0];\\n\\n\\n\\n for i in 0..8 {\\n\\n swarm[i] = swarm[i + 1];\\n\\n }\\n\\n\\n\\n swarm[8] = zero;\\n\\n swarm[6] += zero;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 34,\n \"score\": 88067.47355586733\n },\n {\n \"content\": \"fn parse_input(input: &str) -> Result<Swarm> {\\n\\n let mut swarm: Swarm = [0; 9];\\n\\n\\n\\n for f in input\\n\\n .trim()\\n\\n .split(',')\\n\\n .map(|s| {\\n\\n s.parse()\\n\\n .map_err(|e| anyhow::anyhow!(\\\"Couldnt not parse to u32 {}\\\", e))\\n\\n })\\n\\n .collect::<Result<Vec<u32>>>()?\\n\\n .into_iter()\\n\\n {\\n\\n swarm[f as usize] += 1;\\n\\n }\\n\\n\\n\\n Ok(swarm)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 35,\n \"score\": 81501.1292458201\n },\n {\n \"content\": \"fn parse_input(s: &str) -> Result<Vec<Line>> {\\n\\n s.lines().map(Line::from_str).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 36,\n \"score\": 78229.96037580242\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> Result<Option<u64>> {\\n\\n let (chosen_numbers, mut boards) = parse_file(s)?;\\n\\n\\n\\n for n in chosen_numbers.iter() {\\n\\n for b in boards.iter_mut() {\\n\\n b.mark(*n);\\n\\n\\n\\n if let Some(score) = b.score() {\\n\\n return Ok(Some(score * n));\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(None)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 37,\n \"score\": 78229.96037580242\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> Result<Option<u64>> {\\n\\n let (chosen_numbers, boards) = parse_file(s)?;\\n\\n\\n\\n let mut not_won_boards = boards;\\n\\n\\n\\n for n in chosen_numbers.iter() {\\n\\n for b in not_won_boards.iter_mut() {\\n\\n b.mark(*n);\\n\\n }\\n\\n\\n\\n if not_won_boards.len() == 1 {\\n\\n let last_board = ¬_won_boards[0];\\n\\n\\n\\n if let Some(score) = last_board.score() {\\n\\n return Ok(Some(score * n));\\n\\n }\\n\\n }\\n\\n\\n\\n not_won_boards = not_won_boards.into_iter().filter(|b| !b.is_win()).collect();\\n\\n }\\n\\n\\n\\n Ok(None)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 38,\n \"score\": 78229.96037580242\n },\n {\n \"content\": \"fn parse_line(line: &str) -> Result<Vec<char>, char> {\\n\\n let mut stack = vec![];\\n\\n\\n\\n for character in line.chars() {\\n\\n match character {\\n\\n '(' | '{' | '[' | '<' => stack.push(character),\\n\\n ')' | '}' | ']' | '>' => {\\n\\n if stack.last().map(close_char) == Some(character) {\\n\\n stack.pop();\\n\\n } else {\\n\\n return Err(character);\\n\\n }\\n\\n }\\n\\n _ => panic!(\\\"invalid character\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(stack)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 39,\n \"score\": 74043.74101879401\n },\n {\n \"content\": \"fn filter_common(mut v: Vec<Vec<char>>, filter_on: MostOrLeastCommon) -> Vec<char> {\\n\\n let mut current_digit = 0;\\n\\n\\n\\n while v.len() > 1 {\\n\\n let mut digits = vec![];\\n\\n\\n\\n for line in v.iter() {\\n\\n digits.push(line[current_digit]);\\n\\n }\\n\\n\\n\\n let ((least, least_count), (most, most_count)) = least_and_most_common_with_counts(digits);\\n\\n let matching_digit = if least_count == most_count {\\n\\n match filter_on {\\n\\n MostOrLeastCommon::Most => '1',\\n\\n MostOrLeastCommon::Least => '0',\\n\\n }\\n\\n } else {\\n\\n match filter_on {\\n\\n MostOrLeastCommon::Most => most,\\n\\n MostOrLeastCommon::Least => least,\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 40,\n \"score\": 68829.63331617505\n },\n {\n \"content\": \"type Pos = (u32, u32);\\n\\n\\n\",\n \"file_path\": \"2-dive/src/main.rs\",\n \"rank\": 41,\n \"score\": 66736.11250170958\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> usize {\\n\\n let mut input = Input::parse(s);\\n\\n\\n\\n input.fold_first();\\n\\n\\n\\n input.holes.len()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"13-transparent-oragami/src/main.rs\",\n \"rank\": 42,\n \"score\": 63260.24508176569\n },\n {\n \"content\": \"fn count_increases(lines: &[u64]) -> usize {\\n\\n lines.iter().tuple_windows().filter(|(a, b)| a < b).count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"1-sonar-sweep/src/main.rs\",\n \"rank\": 43,\n \"score\": 61823.72773107386\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> usize {\\n\\n let input = parse_str(s);\\n\\n\\n\\n input\\n\\n .into_iter()\\n\\n .map(|(_, right)| {\\n\\n right\\n\\n .iter()\\n\\n .filter(|x| {\\n\\n let length = x.len();\\n\\n\\n\\n length == 2 || length == 3 || length == 4 || length == 7\\n\\n })\\n\\n .count()\\n\\n })\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 44,\n \"score\": 61823.72773107386\n },\n {\n \"content\": \"fn least_and_most_common_with_counts(v: Vec<char>) -> ((char, usize), (char, usize)) {\\n\\n let counts = v.into_iter().counts();\\n\\n\\n\\n let counts_v: Vec<_> = counts.into_iter().collect_vec();\\n\\n\\n\\n let (min, max) = counts_v\\n\\n .into_iter()\\n\\n .minmax_by_key(|x| x.1)\\n\\n .into_option()\\n\\n .unwrap();\\n\\n\\n\\n (min, max)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 45,\n \"score\": 61819.31310810694\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\nstruct Sub {\\n\\n pos: Pos,\\n\\n aim: u32,\\n\\n}\\n\\n\\n\\nimpl Sub {\\n\\n fn new() -> Self {\\n\\n Sub {\\n\\n pos: (0, 0),\\n\\n aim: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n fn from_moves(moves: &[Move]) -> Self {\\n\\n let mut sub = Sub::new();\\n\\n sub.eval_all(moves);\\n\\n sub\\n\\n }\\n\\n\\n\\n fn eval(&mut self, m: &Move) {\\n\",\n \"file_path\": \"2-dive/src/main.rs\",\n \"rank\": 46,\n \"score\": 57252.20205970164\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\nstruct Move {\\n\\n direction: Direction,\\n\\n distance: u32,\\n\\n}\\n\\n\\n\\nimpl Move {\\n\\n fn from_str(s: &str) -> Option<Move> {\\n\\n let mut parts = s.split_whitespace();\\n\\n let direction = parts.next().and_then(Direction::from_str);\\n\\n let distance = parts.next().and_then(|s| s.parse().ok());\\n\\n if direction.is_none() || distance.is_none() {\\n\\n return None;\\n\\n }\\n\\n\\n\\n Some(Move {\\n\\n direction: direction.unwrap(),\\n\\n distance: distance.unwrap(),\\n\\n })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"2-dive/src/main.rs\",\n \"rank\": 47,\n \"score\": 57252.20205970164\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\\n\\nstruct Position {\\n\\n x: u32,\\n\\n y: u32,\\n\\n}\\n\\n\\n\\nimpl Position {\\n\\n fn from_str(s: &str) -> Result<Self> {\\n\\n s.trim()\\n\\n .split(',')\\n\\n .map(|s| {\\n\\n s.parse()\\n\\n .map_err(|_| anyhow!(\\\"Couldn't parse u32 from string\\\"))\\n\\n })\\n\\n .collect::<Result<Vec<u32>>>()\\n\\n .and_then(|v| {\\n\\n if v.len() == 2 {\\n\\n Ok(Position { x: v[0], y: v[1] })\\n\\n } else {\\n\\n Err(anyhow!(\\\"Wrong number of numbers in position\\\"))\\n\\n }\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 48,\n \"score\": 56248.41776204893\n },\n {\n \"content\": \"#[derive(Debug, Hash, PartialEq, Eq, PartialOrd, Ord, Clone)]\\n\\nstruct Pos {\\n\\n x: u32,\\n\\n y: u32,\\n\\n}\\n\\n\\n\\nimpl Pos {\\n\\n fn parse(s: &str) -> Pos {\\n\\n let mut iter = s.split(',');\\n\\n Pos {\\n\\n x: iter.next().unwrap().parse().unwrap(),\\n\\n y: iter.next().unwrap().parse().unwrap(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"13-transparent-oragami/src/main.rs\",\n \"rank\": 49,\n \"score\": 56248.274503981615\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input {\\n\\n holes: Vec<Pos>,\\n\\n folds: VecDeque<Fold>,\\n\\n}\\n\\n\\n\\nimpl Input {\\n\\n fn parse(s: &str) -> Self {\\n\\n let mut halves = s.split(\\\"\\\\n\\\\n\\\");\\n\\n let holes = halves.next().unwrap().lines().map(Pos::parse).collect();\\n\\n\\n\\n let folds = halves.next().unwrap().lines().map(Fold::parse).collect();\\n\\n\\n\\n Input { holes, folds }\\n\\n }\\n\\n\\n\\n fn fold_first(&mut self) {\\n\\n if let Some(fold) = self.folds.pop_front() {\\n\\n match fold {\\n\\n Fold::HorizontalAxis(pos) => {\\n\\n self.fold_horizontal(pos);\\n\",\n \"file_path\": \"13-transparent-oragami/src/main.rs\",\n \"rank\": 50,\n \"score\": 56246.30648942081\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Line {\\n\\n start: Position,\\n\\n end: Position,\\n\\n}\\n\\n\\n\\nimpl Line {\\n\\n fn from_str(s: &str) -> Result<Self> {\\n\\n let mut parts = s.split(\\\"->\\\");\\n\\n\\n\\n let start_str = parts.next().unwrap();\\n\\n let end_str = parts.next().unwrap();\\n\\n\\n\\n let start = Position::from_str(start_str)?;\\n\\n let end = Position::from_str(end_str)?;\\n\\n\\n\\n Ok(Self { start, end })\\n\\n }\\n\\n\\n\\n fn to_cells(&self) -> Box<dyn Iterator<Item = Position>> {\\n\\n let mut current = self.start;\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 51,\n \"score\": 56246.30648942081\n },\n {\n \"content\": \"struct Puzzle {\\n\\n order: [Option<char>; 7],\\n\\n valid_arrangements: ValidArrangements,\\n\\n digits_signals: Vec<String>,\\n\\n}\\n\\n\\n\\nimpl Puzzle {\\n\\n fn solve(&mut self) -> u64 {\\n\\n let one_pattern = self\\n\\n .valid_arrangements\\n\\n .0\\n\\n .iter()\\n\\n .find(|s| s.len() == 2)\\n\\n .unwrap();\\n\\n let four_pattern = self\\n\\n .valid_arrangements\\n\\n .0\\n\\n .iter()\\n\\n .find(|s| s.len() == 4)\\n\\n .unwrap();\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 52,\n \"score\": 55308.52791045905\n },\n {\n \"content\": \"fn get_covered_counts<T>(lines: T) -> HashMap<Position, usize>\\n\\nwhere\\n\\n T: Iterator<Item = Line>,\\n\\n{\\n\\n let mut chained_iter: Box<dyn Iterator<Item = Position> + '_> = Box::new(std::iter::empty());\\n\\n\\n\\n for line in lines {\\n\\n chained_iter = Box::new(chained_iter.chain(line.to_cells()));\\n\\n }\\n\\n\\n\\n chained_iter.counts()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 53,\n \"score\": 53307.902240476156\n },\n {\n \"content\": \"struct ValidArrangements(Vec<String>);\\n\\n\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 54,\n \"score\": 49267.360933938806\n },\n {\n \"content\": \"fn main() {\\n\\n let sample = parse_file(include_str!(\\\"sample.input\\\"));\\n\\n let sample_ans = eval_simple_moves(&sample);\\n\\n\\n\\n let input = parse_file(include_str!(\\\"my.input\\\"));\\n\\n let ans = eval_simple_moves(&input);\\n\\n\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\n\\n \\\"Sample Input: {:?} => {}\\\",\\n\\n sample_ans,\\n\\n sample_ans.0 * sample_ans.1\\n\\n );\\n\\n println!(\\\"My Input: {:?} => {}\\\", ans, ans.0 * ans.1);\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n let sample_sub = Sub::from_moves(&sample);\\n\\n println!(\\n\\n \\\"Sample Input: {:?} => {}\\\",\\n\\n sample_sub,\\n\",\n \"file_path\": \"2-dive/src/main.rs\",\n \"rank\": 55,\n \"score\": 44996.769572032994\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {}\\\", part1_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {}\\\", part1_ans(include_str!(\\\"my.input\\\")));\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample:\\\\n{}\\\", part2_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My:\\\\n{}\\\", part2_ans(include_str!(\\\"my.input\\\")));\\n\\n}\\n\",\n \"file_path\": \"13-transparent-oragami/src/main.rs\",\n \"rank\": 56,\n \"score\": 44123.221890574525\n },\n {\n \"content\": \"fn main() {\\n\\n let sample_input: Vec<u64> = transform_input(include_str!(\\\"sample.input\\\"));\\n\\n let my_input: Vec<u64> = transform_input(include_str!(\\\"my.input\\\"));\\n\\n\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample Answer: {}\\\", count_increases(&sample_input));\\n\\n println!(\\\"My Answer: {}\\\", count_increases(&my_input));\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\n\\n \\\"Sample Answer: {}\\\",\\n\\n count_increases(&sum_three_windows(&sample_input))\\n\\n );\\n\\n println!(\\n\\n \\\"My Answer: {}\\\",\\n\\n count_increases(&sum_three_windows(&my_input))\\n\\n );\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"1-sonar-sweep/src/main.rs\",\n \"rank\": 57,\n \"score\": 44123.221890574525\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {}\\\", part1_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {}\\\", part1_ans(include_str!(\\\"my.input\\\")));\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {}\\\", part2_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {}\\\", part2_ans(include_str!(\\\"my.input\\\")));\\n\\n}\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 58,\n \"score\": 44123.221890574525\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part1_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {:?}\\\", part1_ans(include_str!(\\\"my.input\\\")));\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part2_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {:?}\\\", part2_ans(include_str!(\\\"my.input\\\")));\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_into_digit_position_vecs() {\\n\\n let input = \\\"101\\\\n010\\\\n111\\\";\\n\\n\\n\\n assert_eq!(\\n\\n vec![\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 59,\n \"score\": 44123.221890574525\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"Part 1\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part1_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {:?}\\\", part1_ans(include_str!(\\\"my.input\\\")));\\n\\n\\n\\n println!(\\\"Part 2\\\");\\n\\n println!(\\\"Sample: {:?}\\\", part2_ans(include_str!(\\\"sample.input\\\")));\\n\\n println!(\\\"My: {:?}\\\", part2_ans(include_str!(\\\"my.input\\\")));\\n\\n}\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 60,\n \"score\": 43308.8288983231\n },\n {\n \"content\": \"fn make_paths<'input>(\\n\\n connections: &HashMap<&'input str, Vec<&'input str>>,\\n\\n to: &'input str,\\n\\n path: Vec<&'input str>,\\n\\n path_filter: &dyn Fn(&Vec<&'input str>, &'input str) -> bool,\\n\\n) -> Vec<Vec<&'input str>> {\\n\\n let mut paths = Vec::new();\\n\\n\\n\\n let from = *path.last().unwrap();\\n\\n\\n\\n if from == to {\\n\\n paths.push(path);\\n\\n } else {\\n\\n for next in connections\\n\\n .get(from)\\n\\n .unwrap()\\n\\n .iter()\\n\\n .filter(|next| path_filter(&path, next))\\n\\n {\\n\\n let mut new_path = path.clone();\\n\\n new_path.push(next);\\n\\n paths.append(&mut make_paths(connections, to, new_path, path_filter));\\n\\n }\\n\\n }\\n\\n\\n\\n paths\\n\\n}\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 61,\n \"score\": 41207.727527352756\n },\n {\n \"content\": \"fn make_paths_part2<'input>(\\n\\n connections: &HashMap<&'input str, Vec<&'input str>>,\\n\\n to: &'input str,\\n\\n path: Vec<&'input str>,\\n\\n) -> Vec<Vec<&'input str>> {\\n\\n make_paths(connections, to, path, &|path, next| {\\n\\n !path.contains(&next)\\n\\n || next.chars().next().unwrap().is_ascii_uppercase()\\n\\n || (next != \\\"start\\\"\\n\\n && next != \\\"end\\\"\\n\\n && path\\n\\n .iter()\\n\\n .filter(|&x| x.chars().next().unwrap().is_ascii_lowercase())\\n\\n .counts()\\n\\n .iter()\\n\\n .all(|(_, count)| *count == 1))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 62,\n \"score\": 40494.94529009281\n },\n {\n \"content\": \"fn make_paths_part1<'input>(\\n\\n connections: &HashMap<&'input str, Vec<&'input str>>,\\n\\n to: &'input str,\\n\\n path: Vec<&'input str>,\\n\\n) -> Vec<Vec<&'input str>> {\\n\\n make_paths(connections, to, path, &|path, next| {\\n\\n !path.contains(&next) || next.chars().next().unwrap().is_ascii_uppercase()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 63,\n \"score\": 40494.94529009281\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> String {\\n\\n let mut input = Input::parse(s);\\n\\n\\n\\n while !input.folds.is_empty() {\\n\\n input.fold_first();\\n\\n }\\n\\n\\n\\n let max_x = input.holes.iter().map(|p| p.x).max().unwrap();\\n\\n let max_y = input.holes.iter().map(|p| p.y).max().unwrap();\\n\\n\\n\\n let mut lines_grouped: HashMap<u32, Vec<_>> = HashMap::new();\\n\\n for h in input.holes.into_iter() {\\n\\n lines_grouped.entry(h.y).or_default().push(h.x);\\n\\n }\\n\\n\\n\\n (0..=max_y)\\n\\n .map(|y| {\\n\\n let v = lines_grouped.entry(y).or_default();\\n\\n (0..=max_x + 1)\\n\\n .map(|x| if v.contains(&x) { '█' } else { ' ' })\\n\\n .collect::<String>()\\n\\n })\\n\\n .join(\\\"\\\\n\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"13-transparent-oragami/src/main.rs\",\n \"rank\": 64,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> u64 {\\n\\n let input = s.trim().lines();\\n\\n\\n\\n let corrupt = input\\n\\n .map(parse_line)\\n\\n .filter_map(|result| result.err())\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n corrupt.iter().map(score_invalid).sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 65,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn close_char(c: &char) -> char {\\n\\n match c {\\n\\n '{' => '}',\\n\\n '(' => ')',\\n\\n '[' => ']',\\n\\n '<' => '>',\\n\\n _ => panic!(\\\"invalid char\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 66,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn score_invalid(c: &char) -> u64 {\\n\\n match c {\\n\\n ')' => 3,\\n\\n ']' => 57,\\n\\n '}' => 1197,\\n\\n '>' => 25137,\\n\\n _ => panic!(\\\"invalid char\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 67,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn score_valid(c: &char) -> u64 {\\n\\n match c {\\n\\n ')' => 1,\\n\\n ']' => 2,\\n\\n '}' => 3,\\n\\n '>' => 4,\\n\\n _ => panic!(\\\"invalid char\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 68,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn part1_ans(s: &str) -> i64 {\\n\\n let digits = into_digit_position_vecs(s);\\n\\n let (epsilon, gamma) = calculate_gamma_and_epsilon(digits);\\n\\n\\n\\n let epsilon_num = i64::from_str_radix(&epsilon, 2).unwrap();\\n\\n let gamma_num = i64::from_str_radix(&gamma, 2).unwrap();\\n\\n\\n\\n epsilon_num * gamma_num\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 69,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> u64 {\\n\\n let input = s.trim().lines();\\n\\n\\n\\n let mut scores = input\\n\\n .map(parse_line)\\n\\n .filter_map(|result| result.ok())\\n\\n .map(|mut stack| {\\n\\n stack.reverse();\\n\\n stack.iter().map(close_char).collect::<Vec<_>>()\\n\\n })\\n\\n .map(|stack| {\\n\\n let mut score = 0;\\n\\n\\n\\n for c in stack {\\n\\n score *= 5;\\n\\n score += score_valid(&c);\\n\\n }\\n\\n\\n\\n score\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n scores.sort_unstable();\\n\\n\\n\\n scores[scores.len() / 2]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"10-syntax-scoring/src/main.rs\",\n \"rank\": 70,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> i64 {\\n\\n let v = into_vec(s);\\n\\n\\n\\n let oxygen: String = filter_common(v.clone(), MostOrLeastCommon::Most)\\n\\n .into_iter()\\n\\n .collect();\\n\\n let c02: String = filter_common(v, MostOrLeastCommon::Least)\\n\\n .into_iter()\\n\\n .collect();\\n\\n\\n\\n let oxygen_num = i64::from_str_radix(&oxygen, 2).unwrap();\\n\\n let c02_num = i64::from_str_radix(&c02, 2).unwrap();\\n\\n\\n\\n oxygen_num * c02_num\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 71,\n \"score\": 38288.428290859214\n },\n {\n \"content\": \"fn part2_ans(s: &str) -> u64 {\\n\\n let input = parse_str(s);\\n\\n\\n\\n input\\n\\n .into_iter()\\n\\n .map(|(valid_arrangements, right)| {\\n\\n let mut puzzle = Puzzle {\\n\\n order: [None, None, None, None, None, None, None],\\n\\n valid_arrangements,\\n\\n digits_signals: right.into_iter().map(|x| x.to_string()).collect(),\\n\\n };\\n\\n\\n\\n puzzle.solve()\\n\\n })\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 72,\n \"score\": 37619.46326292871\n },\n {\n \"content\": \"fn eval_simple_moves(moves: &[Move]) -> Pos {\\n\\n let mut pos = (0, 0);\\n\\n\\n\\n for m in moves {\\n\\n pos = m.simple_eval(pos);\\n\\n }\\n\\n\\n\\n pos\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2-dive/src/main.rs\",\n \"rank\": 73,\n \"score\": 37619.46326292871\n },\n {\n \"content\": \"fn parse_file(s: &str) -> Vec<Move> {\\n\\n s.lines()\\n\\n .map(Move::from_str)\\n\\n .collect::<Option<Vec<Move>>>()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2-dive/src/main.rs\",\n \"rank\": 74,\n \"score\": 37369.27605336597\n },\n {\n \"content\": \"fn transform_input(file: &str) -> Vec<u64> {\\n\\n file.lines()\\n\\n .map(|line| line.parse::<u64>().unwrap())\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"1-sonar-sweep/src/main.rs\",\n \"rank\": 75,\n \"score\": 36071.243297144785\n },\n {\n \"content\": \"fn into_vec(s: &str) -> Vec<Vec<char>> {\\n\\n s.lines().map(|l| l.chars().collect_vec()).collect_vec()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 76,\n \"score\": 35878.02622327306\n },\n {\n \"content\": \"fn sum_three_windows(lines: &[u64]) -> Vec<u64> {\\n\\n lines\\n\\n .iter()\\n\\n .tuple_windows()\\n\\n .map(|(a, b, c)| a + b + c)\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"1-sonar-sweep/src/main.rs\",\n \"rank\": 77,\n \"score\": 35478.606989015956\n },\n {\n \"content\": \"fn least_and_most_common(v: Vec<char>) -> (char, char) {\\n\\n let (min, max) = least_and_most_common_with_counts(v);\\n\\n\\n\\n (min.0, max.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 78,\n \"score\": 35248.95849498239\n },\n {\n \"content\": \"fn into_digit_position_vecs(s: &str) -> Vec<Vec<char>> {\\n\\n let mut lines = s.lines().map(|l| l.chars()).collect_vec();\\n\\n let mut result = Vec::new();\\n\\n\\n\\n let mut chars_left = true;\\n\\n while chars_left {\\n\\n let mut current_new_line = Vec::new();\\n\\n for l in lines.iter_mut() {\\n\\n if let Some(c) = l.next() {\\n\\n current_new_line.push(c);\\n\\n } else {\\n\\n chars_left = false;\\n\\n }\\n\\n }\\n\\n if !current_new_line.is_empty() {\\n\\n result.push(current_new_line);\\n\\n }\\n\\n }\\n\\n\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 79,\n \"score\": 34656.32218685356\n },\n {\n \"content\": \"fn parse_line(s: &str) -> (ValidArrangements, Vec<&str>) {\\n\\n let mut halves = s.trim().split('|');\\n\\n let left = halves\\n\\n .next()\\n\\n .unwrap()\\n\\n .trim()\\n\\n .split(' ')\\n\\n .map(|x| x.to_owned())\\n\\n .collect_vec();\\n\\n let right = halves.next().unwrap().trim().split(' ').collect::<Vec<_>>();\\n\\n\\n\\n (ValidArrangements(left), right)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 80,\n \"score\": 34097.04156352166\n },\n {\n \"content\": \"fn parse_str(s: &str) -> Vec<(ValidArrangements, Vec<&str>)> {\\n\\n s.trim().split('\\\\n').map(parse_line).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"8-seven-segment-search/src/main.rs\",\n \"rank\": 81,\n \"score\": 32828.41381311869\n },\n {\n \"content\": \"fn calculate_gamma_and_epsilon(digits: Vec<Vec<char>>) -> (String, String) {\\n\\n let mut epsilon_digits = vec![];\\n\\n let mut gamma_digits = vec![];\\n\\n\\n\\n for digit_line in digits {\\n\\n let (epsilon, gamma) = least_and_most_common(digit_line);\\n\\n epsilon_digits.push(epsilon);\\n\\n gamma_digits.push(gamma);\\n\\n }\\n\\n\\n\\n (\\n\\n epsilon_digits.into_iter().collect(),\\n\\n gamma_digits.into_iter().collect(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 82,\n \"score\": 32828.41381311869\n },\n {\n \"content\": \"fn parse_connections(input: &str) -> HashMap<&str, Vec<&str>> {\\n\\n let mut connections = HashMap::new();\\n\\n\\n\\n for line in input.lines() {\\n\\n let mut words = line.split('-');\\n\\n let from = words.next().unwrap();\\n\\n let to = words.next().unwrap();\\n\\n\\n\\n connections.entry(from).or_insert_with(Vec::new).push(to);\\n\\n connections.entry(to).or_insert_with(Vec::new).push(from);\\n\\n }\\n\\n\\n\\n connections\\n\\n}\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 83,\n \"score\": 32828.41381311869\n },\n {\n \"content\": \"// This represents the number of snakes in each 'lifecycle'\\n\\ntype Swarm = [usize; 9];\\n\\n\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 84,\n \"score\": 27597.26462365828\n },\n {\n \"content\": \" }\\n\\n }\\n\\n neighbours\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Board {\\n\\n fn all_positions(&self) -> Vec<Pos> {\\n\\n iproduct!(0..self.cells.len() as i32, 0..self.cells[0].len() as i32)\\n\\n .map(|(x, y)| Pos::new(x, y))\\n\\n .collect()\\n\\n }\\n\\n\\n\\n fn single_cycle(&mut self) -> Result<usize> {\\n\\n let mut flashed = vec![];\\n\\n\\n\\n for pos in self.all_positions() {\\n\\n let pos = Pos::new(pos.0, pos.1);\\n\\n\\n\\n let old_value = self.get(&pos);\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 87,\n \"score\": 10.482095339413398\n },\n {\n \"content\": \"use anyhow::{anyhow, Context, Result};\\n\\nuse itertools::Itertools;\\n\\nuse std::convert::TryInto;\\n\\n\\n\\n#[derive(Debug, Copy, Clone)]\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 88,\n \"score\": 8.241371792043385\n },\n {\n \"content\": \"use anyhow::Result;\\n\\nuse itertools::Itertools;\\n\\nuse std::collections::HashMap;\\n\\n\\n\",\n \"file_path\": \"12-passage-pathing/src/main.rs\",\n \"rank\": 89,\n \"score\": 7.350514462618019\n },\n {\n \"content\": \"use std::{cmp::Ordering, collections::HashMap};\\n\\n\\n\\nuse anyhow::{anyhow, Result};\\n\\nuse itertools::Itertools;\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\\n\",\n \"file_path\": \"5-hydrothermal-vents/src/main.rs\",\n \"rank\": 90,\n \"score\": 7.29791271321\n },\n {\n \"content\": \"use anyhow::{anyhow, Result};\\n\\nuse itertools::{iproduct, Itertools};\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"11-dumbo-octopus/src/main.rs\",\n \"rank\": 92,\n \"score\": 7.2070148369746585\n },\n {\n \"content\": \"use itertools::Itertools;\\n\\nuse std::collections::{HashMap, VecDeque};\\n\\n\\n\\n#[derive(Debug, Hash, PartialEq, Eq, PartialOrd, Ord, Clone)]\\n\",\n \"file_path\": \"13-transparent-oragami/src/main.rs\",\n \"rank\": 93,\n \"score\": 5.729407955309654\n },\n {\n \"content\": \"use itertools::Itertools;\\n\\n\\n\",\n \"file_path\": \"3-binary-diagnostic/src/main.rs\",\n \"rank\": 94,\n \"score\": 5.682668784330566\n },\n {\n \"content\": \"use itertools::Itertools;\\n\\n\\n\",\n \"file_path\": \"1-sonar-sweep/src/main.rs\",\n \"rank\": 95,\n \"score\": 5.682668784330566\n },\n {\n \"content\": \" fn unmarked_cells(&self) -> Vec<((usize, usize), Cell)> {\\n\\n (0..N)\\n\\n .cartesian_product(0..N)\\n\\n .filter(|(i, j)| !self.cells[*i][*j].marked)\\n\\n .map(|pos| (pos, self.cells[pos.0][pos.1]))\\n\\n .collect()\\n\\n }\\n\\n\\n\\n fn is_win(&self) -> bool {\\n\\n self.is_horizontal_win() || self.is_vertical_win()\\n\\n }\\n\\n\\n\\n fn rows(&self) -> [[Cell; N]; N] {\\n\\n self.cells\\n\\n }\\n\\n\\n\\n fn columns(&self) -> [[Cell; N]; N] {\\n\\n (0..N)\\n\\n .map(|i| {\\n\\n (0..N)\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 96,\n \"score\": 5.501790538880649\n },\n {\n \"content\": \"use anyhow::{anyhow, Result};\\n\\n\\n\",\n \"file_path\": \"7-whale-treachery/src/main.rs\",\n \"rank\": 97,\n \"score\": 4.940959412068165\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn score(&self) -> Option<u64> {\\n\\n if self.is_win() {\\n\\n Some(self.unmarked_cells().iter().map(|(_, cell)| cell.num).sum())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n fn mark(&mut self, num: u64) {\\n\\n for row in self.cells.iter_mut() {\\n\\n for cell in row {\\n\\n if cell.num == num {\\n\\n cell.marked = true;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"4-giant-squid/src/main.rs\",\n \"rank\": 98,\n \"score\": 4.837897708801146\n },\n {\n \"content\": \"use anyhow::Result;\\n\\n\\n\\n// This represents the number of snakes in each 'lifecycle'\\n\",\n \"file_path\": \"6-lanternfish/src/main.rs\",\n \"rank\": 99,\n \"score\": 4.381079351337432\n }\n]","isConversational":false}}},{"rowIdx":3695,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/parser/parameters.rs"},"repo_name":{"kind":"string","value":"hoodie/icalendar-rs"},"commit":{"kind":"string","value":"c0ffee24858e0739b9964395d0ae61f6a582aa94"},"file_code":{"kind":"string","value":"use nom::{\n branch::alt,\n bytes::complete::{tag, take_till1},\n character::complete::space0,\n combinator::{eof, map, opt},\n error::{convert_error, ContextError, ParseError, VerboseError},\n multi::many0,\n sequence::{preceded, separated_pair, tuple},\n Finish, IResult,\n};\n\n#[cfg(test)]\nuse nom::error::ErrorKind;\n\nuse super::{parsed_string::ParseString, utils::valid_key_sequence_cow};\n\n#[derive(PartialEq, Debug, Clone)]\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\npub struct Parameter<'a> {\n pub key: ParseString<'a>,\n pub val: Option<ParseString<'a>>,\n}\n\nimpl<'a> Parameter<'a> {\n pub fn new_ref(key: &'a str, val: Option<&'a str>) -> Parameter<'a> {\n Parameter {\n key: key.into(),\n val: val.map(Into::into),\n }\n }\n}\n\nimpl<'a> TryFrom<&'a str> for Parameter<'a> {\n type Error = String;\n\n fn try_from(input: &'a str) -> Result<Self, Self::Error> {\n parameter(input)\n .finish()\n .map(|(_, x)| x)\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n }\n}\n\nimpl<'a> From<Parameter<'a>> for crate::properties::Parameter {\n fn from(parameter: Parameter<'_>) -> crate::properties::Parameter {\n crate::properties::Parameter::new(\n parameter.key.as_ref(),\n parameter.val.as_ref().map(AsRef::as_ref).unwrap_or(\"\"),\n )\n }\n}\n\n#[test]\nfn test_parameter() {\n assert_parser!(\n parameter,\n \";KEY=VALUE\",\n Parameter::new_ref(\"KEY\", Some(\"VALUE\"))\n );\n\n assert_parser!(\n parameter,\n \"; KEY=VALUE\",\n Parameter::new_ref(\"KEY\", Some(\"VALUE\"))\n );\n\n assert_parser!(\n parameter,\n \"; KEY=VAL UE\",\n Parameter::new_ref(\"KEY\", Some(\"VAL UE\"))\n );\n\n assert_parser!(parameter, \"; KEY=\", Parameter::new_ref(\"KEY\", None));\n\n assert_parser!(\n parameter,\n \";KEY=VAL-UE\",\n Parameter::new_ref(\"KEY\", Some(\"VAL-UE\"))\n );\n\n assert_parser!(\n parameter,\n \";KEY\",\n Parameter {\n key: \"KEY\".into(),\n val: None,\n }\n );\n\n assert_parser!(\n parameter,\n \";email=rust@hoodie.de\",\n Parameter::new_ref(\"email\", Some(\"rust@hoodie.de\"))\n );\n}\n\n#[test]\nfn test_parameter_with_dash() {\n assert_parser!(\n parameter,\n \";X-HOODIE-KEY=VALUE\",\n Parameter::new_ref(\"X-HOODIE-KEY\", Some(\"VALUE\"))\n );\n}\n\n#[test]\nfn test_quirky_parameter() {\n assert_parser!(parameter, \";KEY=\", Parameter::new_ref(\"KEY\", None));\n}\n\nfn remove_empty_string(input: Option<&str>) -> Option<&str> {\n if let Some(input) = input {\n return if input.is_empty() { None } else { Some(input) };\n }\n None\n}\n\nfn remove_empty_string_parsed(input: Option<ParseString<'_>>) -> Option<ParseString<'_>> {\n if let Some(input) = input {\n return if input.as_ref().is_empty() {\n None\n } else {\n Some(input)\n };\n }\n None\n}\n\nfn parameter<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Parameter<'a>, E> {\n alt((pair_parameter, base_parameter))(input)\n}\n\nfn pair_parameter<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Parameter<'a>, E> {\n map(\n preceded(\n tuple((tag(\";\"), space0)),\n separated_pair(\n valid_key_sequence_cow, \n tag(\"=\"),\n map(\n opt(alt((eof, take_till1(|x| x == ';' || x == ':')))),\n remove_empty_string,\n ),\n ),\n ),\n |(key, val)| Parameter {\n key,\n val: val.map(ParseString::from),\n },\n )(input)\n}\n\nfn base_parameter<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Parameter<'a>, E> {\n map(\n tuple((\n preceded(\n tuple((tag(\";\"), space0)),\n valid_key_sequence_cow, \n ),\n map(\n opt(preceded(\n tag(\"=\"),\n map(\n alt((eof, take_till1(|x| x == ';' || x == ':'))),\n ParseString::from,\n ),\n )),\n remove_empty_string_parsed,\n ),\n )),\n |(key, val)| Parameter { key, val },\n )(input)\n}\n\n#[test]\npub fn parse_parameter_list() {\n assert_parser!(\n parameters,\n \";KEY=VALUE\",\n vec![Parameter::new_ref(\"KEY\", Some(\"VALUE\"))]\n );\n\n assert_parser!(\n parameters,\n \";KEY=VALUE;DATE=TODAY\",\n vec![\n Parameter::new_ref(\"KEY\", Some(\"VALUE\")),\n Parameter::new_ref(\"DATE\", Some(\"TODAY\")),\n ]\n );\n\n assert_parser!(\n parameters,\n \";KEY=VALUE;DATE=20170218\",\n vec![\n Parameter::new_ref(\"KEY\", Some(\"VALUE\")),\n Parameter::new_ref(\"DATE\", Some(\"20170218\")),\n ]\n );\n}\n\npub fn parameters<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Vec<Parameter>, E> {\n many0(parameter)(input)\n}\n"},"prefix":{"kind":"string","value":"use nom::{\n branch::alt,\n bytes::complete::{tag, take_till1},\n character::complete::space0,\n combinator::{eof, map, opt},\n error::{convert_error, ContextError, ParseError, VerboseError},\n multi::many0,\n sequence::{preceded, separated_pair, tuple},\n Finish, IResult,\n};\n\n#[cfg(test)]\nuse nom::error::ErrorKind;\n\nuse super::{parsed_string::ParseString, utils::valid_key_sequence_cow};\n\n#[derive(PartialEq, Debug, Clone)]\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\npub struct Parameter<'a> {\n pub key: ParseString<'a>,\n pub val: Option<ParseString<'a>>,\n}\n\nimpl<'a> Parameter<'a> {\n pub fn new_ref(key: &'a str, val: Option<&'a str>) -> Parameter<'a> {\n Parameter {\n key: key.into(),\n val: val.map(Into::into),\n }\n }\n}\n\nimpl<'a> TryFrom<&'a str> for Parameter<'a> {\n type Error = String;\n\n fn try_from(input: &'a str) -> Result<Self, Self::Error> {\n parameter(input)\n .finish()\n .map(|(_, x)| x)\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n }\n}\n\nimpl<'a> From<Parameter<'a>> for crate::properties::Parameter {\n fn from(parameter: Parameter<'_>) -> crate::properties::Parameter {\n crate::properties::Parameter::new(\n parameter.key.as_ref(),\n parameter.val.as_ref().map(AsRef::as_ref).unwrap_or(\"\"),\n )\n }\n}\n\n#[test]\nfn test_parameter() {\n assert_parser!(\n parameter,\n \";KEY=VALUE\",\n Parameter::new_ref(\"KEY\", Some(\"VALUE\"))\n );\n\n assert_parser!(\n parameter,\n \"; KEY=VALUE\",\n Parameter::new_ref(\"KEY\", Some(\"VALUE\"))\n );\n\n assert_parser!(\n parameter,\n \"; KEY=VAL UE\",\n Parameter::new_ref(\"KEY\", Some(\"VAL UE\"))\n );\n\n assert_parser!(parameter, \"; KEY=\", Parameter::new_ref(\"KEY\", None));\n\n assert_parser!(\n parameter,\n \";KEY=VAL-UE\",\n Parameter::new_ref(\"KEY\", Some(\"VAL-UE\"))\n );\n\n assert_parser!(\n parameter,\n \";KEY\",\n Parameter {\n key: \"KEY\".into(),\n val: None,\n }\n );\n\n assert_parser!(\n parameter,\n \";email=rust@hoodie.de\",\n Parameter::new_ref(\"email\", Some(\"rust@hoodie.de\"))\n );\n}\n\n#[test]\nfn test_parameter_with_dash() {\n assert_parser!(\n parameter,\n \";X-HOODIE-KEY=VALUE\",\n Parameter::new_ref(\"X-HOODIE-KEY\", Some(\"VALUE\"))\n );\n}\n\n#[test]\nfn test_quirky_parameter() {\n assert_parser!(parameter, \";KEY=\", Parameter::new_ref(\"KEY\", None));\n}\n\nfn remove_empty_string(input: Option<&str>) -> Option<&str> {\n if let Some(input) = input {\n return if input.is_empty() { None } else { Some(input) };\n }\n None\n}\n\nfn remove_empty_string_parsed(input: Option<ParseString<'_>>) -> Option<ParseString<'_>> {\n if let Some(input) = input {\n return if input.as_ref().is_empty() {\n None\n } else {\n Some(input)\n };\n }\n None\n}\n\nfn parameter<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Parameter<'a>, E> {\n alt((pair_parameter, base_parameter))(input)\n}\n\nfn pair_parameter<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Parameter<'a>, E> {\n map(\n preceded(\n tuple((tag(\";\"), space0)),\n separated_pair(\n valid_key_sequence_cow, \n tag(\"=\"),\n map(\n opt(alt((eof, take_till1(|x| x == ';' || x == ':')))),\n remove_empty_string,\n ),\n ),\n ),\n |(key, val)| Parameter {\n key,\n val: val.map(ParseString::from),\n },\n )(input)\n}\n\nfn base_parameter<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Parameter<'a>, E> {\n map(\n tuple((\n preceded(\n tuple((tag(\";\"), space0)),\n valid_key_sequence_cow, \n ),\n map(\n opt("},"suffix":{"kind":"string","value":"),\n remove_empty_string_parsed,\n ),\n )),\n |(key, val)| Parameter { key, val },\n )(input)\n}\n\n#[test]\npub fn parse_parameter_list() {\n assert_parser!(\n parameters,\n \";KEY=VALUE\",\n vec![Parameter::new_ref(\"KEY\", Some(\"VALUE\"))]\n );\n\n assert_parser!(\n parameters,\n \";KEY=VALUE;DATE=TODAY\",\n vec![\n Parameter::new_ref(\"KEY\", Some(\"VALUE\")),\n Parameter::new_ref(\"DATE\", Some(\"TODAY\")),\n ]\n );\n\n assert_parser!(\n parameters,\n \";KEY=VALUE;DATE=20170218\",\n vec![\n Parameter::new_ref(\"KEY\", Some(\"VALUE\")),\n Parameter::new_ref(\"DATE\", Some(\"20170218\")),\n ]\n );\n}\n\npub fn parameters<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n input: &'a str,\n) -> IResult<&'a str, Vec<Parameter>, E> {\n many0(parameter)(input)\n}\n"},"middle":{"kind":"string","value":"preceded(\n tag(\"=\"),\n map(\n alt((eof, take_till1(|x| x == ';' || x == ':'))),\n ParseString::from,\n ),\n )"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"pub fn valid_key_sequence_cow<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, ParseString<'a>, E> {\n\n map(\n\n take_while(|c: char| {\n\n c == '.' || c == ',' || c == '/' || c == '_' || c == '-' || c.is_alphanumeric()\n\n }),\n\n ParseString::from,\n\n )(input)\n\n}\n\n\n","file_path":"src/parser/utils.rs","rank":1,"score":263752.2400370854},{"content":"// TODO: how do I express <<alpha_or_dash, but not \"END\">>\n\npub fn property_key<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, &str, E> {\n\n if &input[0..=2] == \"END\" || &input[0..=4] == \"BEGIN\" {\n\n IResult::Err(Err::Error(nom::error::make_error(\n\n input,\n\n nom::error::ErrorKind::Satisfy,\n\n )))\n\n } else {\n\n valid_key_sequence(input)\n\n }\n\n}\n\n\n","file_path":"src/parser/utils.rs","rank":2,"score":253519.29882932812},{"content":"pub fn valid_key_sequence<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, &str, E> {\n\n take_while(|c: char| {\n\n c == '.' || c == ',' || c == '/' || c == '_' || c == '-' || c.is_alphanumeric()\n\n })(input)\n\n}\n\n\n","file_path":"src/parser/utils.rs","rank":3,"score":249780.41853004915},{"content":"pub fn property<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, Property, E> {\n\n context(\n\n \"property\",\n\n cut(map(\n\n tuple((\n\n alt((\n\n separated_pair(\n\n tuple((\n\n // preceded(multispace0, alpha_or_dash), // key\n\n cut(context(\n\n \"property can't be END or BEGIN\",\n\n map(preceded(multispace0, property_key), ParseString::from),\n\n )), // key\n\n parameters, // params\n\n )),\n\n context(\"property sparator\", tag(\":\")), // separator\n\n context(\n\n \"property value\",\n","file_path":"src/parser/properties.rs","rank":4,"score":233131.3680667415},{"content":"pub fn component<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, Component, E> {\n\n let (input, name) = line(\"BEGIN:\", valid_key_sequence_cow)(input)?;\n\n\n\n let (input, (properties, components)) = map(\n\n many_till(\n\n cut(context(\n\n \"component\",\n\n alt((\n\n map(line_separated(component), ComponentChild::Component),\n\n map(line_separated(property), ComponentChild::Property),\n\n )),\n\n )),\n\n line(\"END:\", cut(context(\"MISMATCHING END\", tag(name.as_str())))),\n\n ),\n\n |(body_elements, _)| {\n\n let mut properties = Vec::new();\n\n let mut components = Vec::new();\n\n for el in body_elements {\n","file_path":"src/parser/components.rs","rank":5,"score":233131.3680667415},{"content":"pub fn components<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, Vec<Component>, E> {\n\n complete(many0(all_consuming(component)))(input)\n\n}\n","file_path":"src/parser/components.rs","rank":6,"score":233131.3680667415},{"content":"/// Normalize content lines.\n\n///\n\n/// This simplifies line endings and unfolds breaks to simplify parsing.\n\n/// iCal specifies that content may be folded and to fit into a certain\n\n/// length, which must be undone before parsing.\n\n///\n\n/// This is a copying operation.\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// # use icalendar::parser::unfold;\n\n/// #[rustfmt::skip]\n\n/// let line = \"this gets w\\r\n\n/// rapped i\\r\n\n/// n a w\\r\n\n/// eird\\r\n\n/// way\";\n\n///\n\n/// assert_eq!(unfold(line), \"this gets wrapped in a weird way\")\n\n/// ```\n\npub fn unfold(input: &str) -> String {\n\n input.split(\"\\r\\n \").flat_map(|l| l.split(\"\\n \")).collect()\n\n}\n\n\n","file_path":"src/parser/utils.rs","rank":10,"score":227953.3449972187},{"content":"/// Parse iCalendar file content into an array of [`Component`]s\n\n///\n\n/// This version produces nice and readable errors with line numbers thanks the the awesomeness of [`nom`].\n\n/// Line numbers are in regard to the normalized/unfolded version of the input, so better keep those around for reference.\n\n///\n\npub fn read_calendar(input: &str) -> Result<Calendar<'_>, String> {\n\n components(input)\n\n .finish()\n\n .map(|(_, mut components)| {\n\n let root_is_calendar = components\n\n .get(0)\n\n .map(|first_root| first_root.name == \"VCALENDAR\")\n\n .unwrap_or(false);\n\n\n\n if root_is_calendar {\n\n let root = components.swap_remove(0);\n\n Calendar {\n\n properties: root.properties,\n\n components: root.components,\n\n }\n\n } else {\n\n Calendar {\n\n components,\n\n properties: Vec::new(),\n\n }\n\n }\n\n })\n\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n\n}\n\n\n","file_path":"src/parser/mod.rs","rank":11,"score":203288.83902359358},{"content":"pub fn read_component(input: &str) -> Result<Component<'_>, String> {\n\n component(input)\n\n .finish()\n\n .map(|(_, component)| component)\n\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":12,"score":203280.69140787976},{"content":"pub fn line<'a, O, E: ParseError<&'a str>, F: Parser<&'a str, O, E>>(\n\n prefix: &'a str,\n\n f: F,\n\n) -> impl FnMut(&'a str) -> IResult<&'a str, O, E> {\n\n line_separated(complete(preceded(tag_no_case(prefix), f)))\n\n}\n\n\n","file_path":"src/parser/utils.rs","rank":13,"score":203278.56614216592},{"content":"pub fn line_separated<'a, O, E: ParseError<&'a str>, F: Parser<&'a str, O, E>>(\n\n f: F,\n\n) -> impl FnMut(&'a str) -> IResult<&'a str, O, E> {\n\n delimited(many0(line_ending), f, many0(line_ending))\n\n}\n\n\n","file_path":"src/parser/utils.rs","rank":14,"score":200463.29752755584},{"content":"pub fn print_result<T: fmt::Debug>(input: &str, rest: &str, result: &T) {\n\n println!(\n\n \"INPUT: {:?}\\nLEFT: {:?}\\nRESULT: {:#?}\",\n\n input, rest, result\n\n );\n\n}\n\n\n\nmacro_rules! assert_parser {\n\n ($parser:ident, $line:expr) => {\n\n assert_parser!($line, $parser);\n\n };\n\n\n\n ($parser:ident, $line:expr, $expectation:expr) => {{\n\n match $parser::<(_, ErrorKind)>(&$line) {\n\n Ok((rest, parsed)) => {\n\n crate::assert::print_result($line, &rest, &parsed);\n\n pretty_assertions::assert_eq!(\n\n parsed,\n\n $expectation,\n\n \"{:?} not parsed as expected\",\n","file_path":"src/assert.rs","rank":15,"score":199715.70227269048},{"content":"/// Parse iCalendar file content into an array of [`Component`]s\n\n///\n\n/// This version produces nice and readable errors with line numbers thanks the the awesomeness of [`nom`].\n\n/// Line numbers are in regard to the normalized/unfolded version of the input, so better keep those around for reference.\n\n///\n\npub fn read_components(input: &str) -> Result<Vec<Component<'_>>, String> {\n\n components(input)\n\n .finish()\n\n .map(|(_, components)| components)\n\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n\n}\n","file_path":"src/parser/mod.rs","rank":16,"score":196259.46745025314},{"content":"// read first arg as file name or read stdin if arg[1] == \"-\"\n\npub fn content_from_arg() -> Result<Option<String>, Box<dyn std::error::Error>> {\n\n if let Some(arg) = env::args().nth(1) {\n\n let (mut std_in, mut file);\n\n let readable: &mut dyn io::Read = if arg == \"-\" {\n\n std_in = io::stdin();\n\n &mut std_in\n\n } else {\n\n file = fs::File::open(arg)?;\n\n &mut file\n\n };\n\n let mut output = String::new();\n\n readable.read_to_string(&mut output)?;\n\n Ok(Some(output))\n\n } else {\n\n eprintln!(\"no input provided\");\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"examples/example_utils.rs","rank":18,"score":163166.90241893393},{"content":"#[test]\n\nfn try_into_string() -> Result<(), Box<dyn std::error::Error>> {\n\n let bday = Event::new()\n\n .start_date(Utc.ymd(2016, 3, 15))\n\n .end_date(Utc.ymd(2016, 3, 15))\n\n .summary(\"My Birthday\")\n\n .description(\n\n r#\"Hey, I'm gonna have a party\n\nBYOB: Bring your own beer.\n\nHendrik\"#,\n\n )\n\n .done();\n\n\n\n let mut calendar = Calendar::new();\n\n calendar.push(bday);\n\n\n\n let s1: String = (&calendar).try_into()?;\n\n let s2: String = calendar.to_string();\n\n\n\n println!(\"{:?}\", (s1, s2));\n\n\n\n Ok(())\n\n}\n","file_path":"tests/try_into_string.rs","rank":19,"score":149637.46989673027},{"content":"#[allow(dead_code)]\n\npub fn print_with_lines(content: &str) {\n\n println!(\n\n \"{}\",\n\n content\n\n .lines()\n\n .enumerate()\n\n .map(|(num, content)| format!(\"{:4}. {}\\n\", num + 1, content))\n\n .collect::<String>()\n\n );\n\n}\n\n\n","file_path":"examples/example_utils.rs","rank":21,"score":132746.9964801671},{"content":"#[test]\n\nfn test_calendar_to_string() {\n\n let mut calendar = Calendar::new();\n\n let cest_date = FixedOffset::east(2 * 3600)\n\n .ymd(2014, 7, 8)\n\n .and_hms(9, 10, 11);\n\n let utc_date = Utc.ymd(2014, 7, 9).and_hms(9, 10, 11);\n\n let event = Event::new()\n\n .status(EventStatus::Tentative)\n\n .starts(cest_date.with_timezone(&Utc))\n\n .ends(utc_date)\n\n .priority(11) // converted to 10\n\n .summary(\"summary\")\n\n .description(\"Description\")\n\n .location(\"Somewhere\")\n\n .uid(\"euid\")\n\n .class(Class::Confidential)\n\n .add_property(\"DTSTAMP\", \"20190307T181159\")\n\n .done();\n\n calendar.push(event);\n\n let todo = Todo::new()\n","file_path":"tests/calendar.rs","rank":25,"score":108207.41249863929},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let groceries = Todo::new()\n\n .summary(\"buy groceries\")\n\n .description(\"* soy-milk\\n* oak-meal\\n* vegan chocolate\\n* kale\\n* bacon\\nabcdefghijklmnopqrstuvwxyz\")\n\n .starts(Local::now().naive_local())\n\n .ends(Local::now().naive_local() + Duration::hours(24))\n\n .priority(12)\n\n .percent_complete(28)\n\n .status(TodoStatus::InProcess)\n\n .completed(Utc::now())\n\n .due(Local::now().with_timezone(&Utc))\n\n .done();\n\n\n\n let calendar = dbg!(Calendar::from([groceries]));\n\n println!(\"{}\", calendar);\n\n\n\n #[cfg(feature = \"parser\")]\n\n {\n\n let parsed_calendar = dbg!(calendar.to_string().parse::<Calendar>()?);\n\n parsed_calendar.print()?;\n\n }\n\n Ok(())\n\n}\n","file_path":"examples/todos.rs","rank":27,"score":94509.21153495318},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n if let Some(sample) = content_from_arg()? {\n\n let unfolded = unfold(&sample);\n\n print_with_lines(&unfolded);\n\n\n\n let parsed_calendar = match sample.parse::<Calendar>() {\n\n Ok(read) => read,\n\n Err(error) => {\n\n println!(\"{}\", error); // println!(error) yields prettier output\n\n return Ok(());\n\n }\n\n };\n\n println!(\"{}\", parsed_calendar);\n\n }\n\n Ok(())\n\n}\n","file_path":"examples/parse.rs","rank":28,"score":94509.21153495318},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n if let Some(content) = content_from_arg()? {\n\n let calendar = serde_json::from_str::<icalendar::parser::Calendar>(&content)?;\n\n println!(\"{}\", calendar);\n\n }\n\n Ok(())\n\n}\n","file_path":"examples/json_to_ical.rs","rank":29,"score":93032.45528118216},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n if let Some(sample) = content_from_arg()? {\n\n let unfolded = unfold(&sample);\n\n //print_with_lines(&unfolded);\n\n\n\n match icalendar::parser::read_calendar(&unfolded) {\n\n Ok(read) => println!(\"{}\", serde_json::to_string_pretty(&read)?),\n\n Err(error) => println!(\"human-readable error\\n{}\", error),\n\n }\n\n }\n\n Ok(())\n\n}\n","file_path":"examples/ical_to_json.rs","rank":30,"score":93032.45528118216},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n if let Some(sample) = content_from_arg()? {\n\n let unfolded = unfold(&sample);\n\n // print_with_lines(&unfolded);\n\n\n\n match icalendar::parser::read_calendar(&unfolded) {\n\n Ok(read) => println!(\"{}\", read),\n\n Err(error) => println!(\"human-readable error\\n{}\", error),\n\n }\n\n }\n\n Ok(())\n\n}\n","file_path":"examples/parse_advanced.rs","rank":31,"score":93032.45528118216},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let event = Event::new()\n\n .summary(\"test event\")\n\n .append_property(\n\n Property::new(\"TEST\", \"FOOBAR\")\n\n .add_parameter(\"IMPORTANCE\", \"very\")\n\n .add_parameter(\"DUE\", \"tomorrow\")\n\n .done(),\n\n )\n\n .uid(\"my.own.id\")\n\n .done();\n\n\n\n let calendar = Calendar::from([event]);\n\n\n\n calendar.print()?;\n\n\n\n Ok(())\n\n}\n","file_path":"examples/custom_property.rs","rank":32,"score":93032.45528118216},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let event = Event::new()\n\n .summary(\"test event\")\n\n .append_property(\n\n \"TEST;IMPORTANCE=very;DUE=tomorrow:FOOBAR\\n\"\n\n .parse()\n\n .unwrap(),\n\n )\n\n // .uid(\"my.own.id\")\n\n .done();\n\n\n\n let parsed_event = r#\"BEGIN:VEVENT\n\nDTSTAMP:20211123T192118Z\n\nSUMMARY:parsed event\n\nTEST;IMPORTANCE=very;DUE=tomorrow:FOOBAR\n\nEND:VEVENT\n\n\"#;\n\n\n\n let calendar = Calendar::from(event)\n\n .push(parsed_event.parse::<CalendarComponent>().unwrap())\n\n .done();\n\n calendar.print()?;\n\n\n\n let parsed_calendar = calendar.to_string().parse::<Calendar>()?;\n\n parsed_calendar.print()?;\n\n Ok(())\n\n}\n","file_path":"examples/custom_property_parsed.rs","rank":33,"score":91629.69341562988},{"content":"/// Parse iCalendar file content into an array of [`Component`]s\n\n///\n\n/// This version produces very simple Errors for simplicity's sake.\n\npub fn read_calendar_simple<'a>(\n\n input: &'a str,\n\n) -> Result<Vec<Component<'_>>, nom::error::Error<&'a str>> {\n\n components(input).finish().map(|(_, components)| components)\n\n}\n\n\n","file_path":"src/parser/mod.rs","rank":34,"score":87761.38643331535},{"content":"#[test]\n\nfn test_folding_consistency() {\n\n let parsed_0 = Calendar::from([\n\n // add an event\n\n Event::new()\n\n .summary(\"test event\")\n\n .description(include_str!(\"lorem.txt\"))\n\n .timestamp(Utc::now())\n\n .uid(\"1234\")\n\n .starts(Utc::now())\n\n .class(Class::Confidential)\n\n .ends(Utc::now() + Duration::days(1))\n\n .done(),\n\n ]);\n\n let serialized_1 = parsed_0.to_string();\n\n\n\n let parsed_1 = serialized_1.parse::<Calendar>().unwrap();\n\n assert_eq!(parsed_0, parsed_1);\n\n\n\n let serialized_2 = dbg!(parsed_1.to_string());\n\n\n","file_path":"tests/folding_consistency.rs","rank":35,"score":76206.81245323452},{"content":"#[test]\n\nfn reserialization() {\n\n let unfolded = unfold(SAMPLE);\n\n // print_with_lines(&unfolded);\n\n\n\n let parsed = icalendar::parser::read_calendar(&unfolded).unwrap();\n\n let reserialized = parsed.to_string();\n\n println!(\"{}\", reserialized);\n\n assert_eq!(SAMPLE, reserialized);\n\n}\n","file_path":"tests/reserialize.rs","rank":36,"score":74571.9646787116},{"content":"#[test]\n\nfn rfc_2425_8_3_3() {\n\n let example = r#\"begin:vcard\n\nsource:ldap://cn=Meister%20Berger,o=Universitaet%20Goerlitz,c=DE\n\nname:Meister Berger\n\nfn:Meister Berger\n\nn:Berger;Meister\n\nbday;value=date:1963-09-21\n\no:Universit=E6t G=F6rlitz\n\ntitle:Mayor\n\ntitle;language=de;value=text:Burgermeister\n\nnote:The Mayor of the great city of\n\n Goerlitz in the great country of Germany.\n\nemail;internet:mb@goerlitz.de\n\nhome.tel;type=fax,voice,msg:+49 3581 123456\n\nhome.label:Hufenshlagel 1234\\n\n\n 02828 Goerlitz\\n\n\n Deutschland\n\nkey;type=X509;encoding=b:MIICajCCAdOgAwIBAgICBEUwDQYJKoZIhvcNAQEEBQ\n\n AwdzELMAkGA1UEBhMCVVMxLDAqBgNVBAoTI05ldHNjYXBlIENvbW11bmljYXRpb25zI\n\n ENvcnBvcmF0aW9uMRwwGgYDVQQLExNJbmZvcm1hdGlvbiBTeXN0ZW1zMRwwGgYDVQQD\n","file_path":"src/parser/tests.rs","rank":37,"score":72228.00567470855},{"content":"#[test]\n\nfn test_property() {\n\n assert_parser!(\n\n property,\n\n \"KEY:VALUE\\n\",\n\n Property {\n\n name: \"KEY\".into(),\n\n val: \"VALUE\".into(),\n\n params: vec![]\n\n }\n\n );\n\n\n\n assert_parser!(\n\n property,\n\n \"KEY1;foo=bar:VALUE\\n\",\n\n Property {\n\n name: \"KEY1\".into(),\n\n val: \"VALUE\".into(),\n\n params: vec![Parameter::new_ref(\"foo\", Some(\"bar\"))]\n\n }\n\n );\n","file_path":"src/parser/properties.rs","rank":38,"score":70053.23384938014},{"content":"#[test]\n\nfn test_unfold2() {\n\n let input1 = \"1 hello world\\n2 hello \\n world\\n3 hello world\\n4 hello world\";\n\n let input2 = \"1 hello world\\r\\n2 hello \\r\\n world\\r\\n3 hello \\r\\n world\\r\\n4 hello world\";\n\n\n\n let expected = vec![\n\n \"1 hello world\",\n\n \"2 hello world\",\n\n \"3 hello world\",\n\n \"4 hello world\",\n\n ];\n\n\n\n assert_eq!(unfold(input1).lines().collect::<Vec<_>>(), expected);\n\n assert_eq!(unfold(input2).lines().collect::<Vec<_>>(), expected);\n\n}\n","file_path":"src/parser/utils.rs","rank":39,"score":70053.23384938014},{"content":"#[test]\n\nfn test_unfold1() {\n\n let input = \"1 hello world\\r\\n2 hello \\r\\n world\\r\\n3 hello \\r\\n world\\r\\n4 hello world\";\n\n let expected = \"1 hello world\\r\\n2 hello world\\r\\n3 hello world\\r\\n4 hello world\";\n\n assert_eq!(unfold(input), expected);\n\n}\n\n\n\n/// this is actually also allowed by the spec\n","file_path":"src/parser/utils.rs","rank":40,"score":70053.23384938014},{"content":"#[test]\n\nfn test_components() {\n\n assert_parser!(component, \"BEGIN:FOO\\nEND:FOO\", Component::new_empty(\"FOO\"));\n\n\n\n assert_parser!(\n\n component,\n\n \"BEGIN:FOO\\nFOO-PROP:important: spam €\\nEND:FOO\",\n\n Component {\n\n name: \"FOO\".into(),\n\n properties: vec![Property {\n\n name: \"FOO-PROP\".into(),\n\n val: \"important: spam €\".into(),\n\n params: vec![]\n\n }],\n\n components: vec![]\n\n }\n\n );\n\n\n\n assert_parser!(\n\n component,\n\n \"BEGIN:FOO\\nUID:e1c97b31-38bb-4b72-b94f-463a12ef5239\\nFOO-PROP:sp.am\\nEND:FOO\",\n","file_path":"src/parser/components.rs","rank":41,"score":70053.23384938014},{"content":"fn with_all_fixtures<F>(\n\n sub_folder: impl AsRef<Path>,\n\n f: F,\n\n) -> Result<(), Box<dyn std::error::Error>>\n\nwhere\n\n F: Fn(&dyn AsRef<Path>), // -> Result<(), Box<dyn std::error::Error>>,\n\n{\n\n let fixture_path = PathBuf::from(env::var(\"CARGO_MANIFEST_DIR\").unwrap())\n\n .join(\"fixtures\")\n\n .join(sub_folder);\n\n\n\n for path in fs::read_dir(fixture_path)?\n\n .filter_map(|entry| entry.ok())\n\n .filter(|entry| entry.path().extension().and_then(OsStr::to_str) == Some(\"ics\"))\n\n .map(|entry| entry.path())\n\n {\n\n f(&path);\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tests/parse_fixtures.rs","rank":42,"score":69305.86288260063},{"content":"#[test]\n\nfn parse_fixtures_root() {\n\n with_all_fixtures(\"\", |path| {\n\n let fixture = std::fs::read_to_string(&path).unwrap();\n\n if let Err(error) = read_calendar(&unfold(&fixture)) {\n\n println!(\"{}\", error);\n\n\n\n panic!(\"test failed\");\n\n }\n\n })\n\n .unwrap();\n\n}\n\n\n","file_path":"tests/parse_fixtures.rs","rank":43,"score":68029.96935001918},{"content":"#[test]\n\nfn test_nested_components() {\n\n assert_parser!(\n\n component,\n\n \"BEGIN:FOO\\nFOO-PROP:spam\\nBEGIN:BAR\\nBAR-PROP:spam\\nBEGIN:BAR\\nBAR-PROP:spam\\nEND:BAR\\nEND:BAR\\nEND:FOO\",\n\n Component {\n\n name: \"FOO\".into(),\n\n properties: vec![Property::new_ref (\n\n \"FOO-PROP\",\n\n \"spam\",\n\n )],\n\n components: vec![\n\n Component {\n\n name: \"BAR\".into(),\n\n properties: vec![Property::new_ref (\n\n \"BAR-PROP\",\n\n \"spam\",\n\n )],\n\n components: vec![\n\n Component {\n\n name: \"BAR\".into(),\n","file_path":"src/parser/components.rs","rank":44,"score":68029.96935001918},{"content":"#[test]\n\nfn test_property_with_dash() {\n\n assert_parser!(\n\n property,\n\n \"X-HOODIE-KEY:VALUE\\n\",\n\n Property {\n\n name: \"X-HOODIE-KEY\".into(),\n\n val: \"VALUE\".into(),\n\n params: vec![]\n\n }\n\n );\n\n}\n\n\n","file_path":"src/parser/properties.rs","rank":45,"score":68029.96935001918},{"content":"#[test]\n\nfn test_multi_components() {\n\n assert_parser!(\n\n component,\n\n r#\"\n\nBEGIN:VEVENT\n\nBEGIN:VALARM\n\nRELATED-TO;RELTYPE=:c605e4e8-8ea3-4315-b139-19394ab3ced6\n\nEND:VALARM\n\nEND:VEVENT\n\n\"#,\n\n Component {\n\n name: \"VEVENT\".into(),\n\n properties: vec![],\n\n components: vec![Component {\n\n name: \"VALARM\".into(),\n\n properties: vec![Property {\n\n name: \"RELATED-TO\".into(),\n\n val: \"c605e4e8-8ea3-4315-b139-19394ab3ced6\".into(),\n\n params: vec![Parameter::new_ref(\"RELTYPE\", None,)],\n\n }],\n","file_path":"src/parser/components.rs","rank":46,"score":68029.96935001918},{"content":"#[test]\n\n#[should_panic]\n\nfn test_faulty_component() {\n\n assert_parser!(\n\n component,\n\n \"BEGIN:FOO\\nEND:F0O\",\n\n Component {\n\n name: \"FOO\".into(),\n\n properties: vec![],\n\n components: vec![]\n\n }\n\n );\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":47,"score":68029.91207316304},{"content":"#[test]\n\nfn parse_fixtures_icalendar_rb() {\n\n with_all_fixtures(\"icalendar-rb\", |path| {\n\n let fixture = std::fs::read_to_string(&path).unwrap();\n\n if let Err(error) = read_calendar(&unfold(&fixture)) {\n\n println!(\"{}\", error);\n\n\n\n panic!(\"test failed\");\n\n }\n\n })\n\n .unwrap();\n\n}\n\n\n\n/// this one is a bit special because the file is not valid utf8\n\n/// but it's nice to know that we can still parse it\n","file_path":"tests/parse_fixtures.rs","rank":48,"score":66142.91276992644},{"content":"use chrono::*;\n\nuse icalendar::*;\n\nuse std::convert::TryInto;\n\n\n\n#[test]\n","file_path":"tests/try_into_string.rs","rank":49,"score":64416.09353947906},{"content":"#[test]\n\nfn parse_fixtures_icalendar_rb_bad_utf8() {\n\n eprintln!(\"these fixtures produce errors\");\n\n with_all_fixtures(\"icalendar-rb-bad-utf8\", |path| {\n\n // let fixture = std::fs::read_to_string(&path).unwrap();\n\n let file_content = std::fs::read(path).unwrap();\n\n let fixture = dbg!(String::from_utf8_lossy(&file_content));\n\n\n\n dbg!(read_calendar(&unfold(&fixture)).unwrap());\n\n })\n\n .unwrap();\n\n}\n","file_path":"tests/parse_fixtures.rs","rank":50,"score":62725.87578459527},{"content":"/// Implemented by everything that goes into a `Calendar`\n\npub trait Component {\n\n /// Returns kind of component.\n\n ///\n\n ///\n\n /// Must be ALL CAPS\n\n /// These are used in the `BEGIN` and `END` line of the component.\n\n fn component_kind(&self) -> String;\n\n\n\n /// Allows access to the inner properties map.\n\n fn properties(&self) -> &BTreeMap<String, Property>;\n\n\n\n /// Read-only access to `multi_properties`\n\n fn multi_properties(&self) -> &Vec<Property>;\n\n\n\n /// Writes [`Component`] using [`std::fmt`].\n\n fn fmt_write<W: fmt::Write>(&self, out: &mut W) -> Result<(), fmt::Error> {\n\n write_crlf!(out, \"BEGIN:{}\", self.component_kind())?;\n\n\n\n if !self.properties().contains_key(\"DTSTAMP\") {\n\n let now = CalendarDateTime::Utc(Utc::now());\n","file_path":"src/components.rs","rank":51,"score":55168.34635372985},{"content":"pub trait Repeater: Sized {}\n","file_path":"src/repeats.rs","rank":52,"score":52636.773887579904},{"content":"fn main() {\n\n // lets create a calendar\n\n let my_calendar = Calendar::new()\n\n .name(\"example calendar\")\n\n .push(\n\n // add an event\n\n Event::new()\n\n .summary(\"test event\")\n\n .description(\"here I have something really important to do\")\n\n .starts(Utc::now())\n\n .class(Class::Confidential)\n\n .ends(Utc::now() + Duration::days(1))\n\n .append_property(\n\n Property::new(\"TEST\", \"FOOBAR\")\n\n .add_parameter(\"IMPORTANCE\", \"very\")\n\n .add_parameter(\"DUE\", \"tomorrow\")\n\n .done(),\n\n )\n\n .done(),\n\n )\n","file_path":"examples/readme.rs","rank":53,"score":42672.62424970597},{"content":"fn main() {\n\n let event = Event::new()\n\n .summary(\"test event\")\n\n .description(\"here I have something really important to do\")\n\n .starts(Utc::now())\n\n .class(Class::Confidential)\n\n .ends(Utc::now() + Duration::days(1))\n\n .append_property(\n\n Property::new(\"TEST\", \"FOOBAR\")\n\n .add_parameter(\"IMPORTANCE\", \"very\")\n\n .add_parameter(\"DUE\", \"tomorrow\")\n\n .done(),\n\n )\n\n .uid(\"my.own.id\")\n\n .done();\n\n\n\n let todo = Todo::new().summary(\"Buy some milk\").done();\n\n\n\n let mut built_calendar = Calendar::new();\n\n built_calendar.push(event);\n","file_path":"examples/full_circle.rs","rank":54,"score":41522.88179252022},{"content":"#[allow(dead_code)]\n\nfn main() {\n\n eprintln!(\"this is not an example, just a utility module\");\n\n}\n","file_path":"examples/example_utils.rs","rank":55,"score":41522.88179252022},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_component() {\n\n let sample_1 = \"BEGIN:VEVENT\n\nKEY;foo=bar:VALUE\n\nKEY;foo=bar;DATE=20170218:VALUE\n\nEND:VEVENT\n\n\";\n\n\n\n let expectation = Component{name: \"VEVENT\".into(), properties: vec![\n\n Property{name: \"KEY\".into(), val: \"VALUE\".into(), params: vec![\n\n Parameter::new_ref(\"foo\", Some(\"bar\")),\n\n ]},\n\n Property{name: \"KEY\".into(), val: \"VALUE\".into(), params: vec![\n\n Parameter::new_ref(\"foo\", Some(\"bar\")),\n\n Parameter::new_ref(\"DATE\", Some(\"20170218\")),\n\n ]},\n\n ], components: vec![]};\n\n\n\n println!(\"expectation: {:#?}\", expectation);\n\n println!(\"vs reality : {:#?}\", component::<(_, ErrorKind)>(sample_1));\n\n\n\n assert_eq!(\n\n component::<(_, ErrorKind)>(sample_1).unwrap().1,\n\n expectation);\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":56,"score":40459.65767560398},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_properties_from_rfc() {\n\n // TODO: newlines followed by spaces must be ignored\n\n assert_parser!(\n\n property,\n\n \"home.tel;type=fax,voice,msg:+49 3581 123456\\n\",\n\n Property {\n\n name: \"home.tel\".into(),\n\n val: \"+49 3581 123456\".into(),\n\n params: vec![Parameter ::new_ref(\n\n \"type\",\n\n Some(\"fax,voice,msg\"),\n\n )]\n\n }\n\n );\n\n // TODO: newlines followed by spaces must be ignored\n\n assert_parser!(\n\n property,\n\n \"email;internet:mb@goerlitz.de\\n\",\n\n Property {\n\n name: \"email\".into(),\n\n val: \"mb@goerlitz.de\".into(),\n\n params: vec![\n\n Parameter ::new_ref(\n\n \"internet\" ,\n\n None,\n\n )]\n\n }\n\n );\n\n}\n\n\n","file_path":"src/parser/properties.rs","rank":57,"score":39467.22005486949},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_empty_component1() {\n\n assert_eq!(\n\n component::<(_, ErrorKind)>(\"BEGIN:VEVENT\\nEND:VEVENT\\n\"),\n\n Ok((\"\", Component::new_empty(\"VEVENT\")))\n\n );\n\n\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":58,"score":39467.22005486949},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_empty_component2() {\n\n assert_eq!(\n\n component::<(_, ErrorKind)>(\"BEGIN:VEVENT\\n\\nEND:VEVENT\\n\"),\n\n Ok((\"\", Component::new_empty(\"VEVENT\"))),\n\n \"empty component with empty line\");\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":59,"score":39467.22005486949},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_property_with_colon() {\n\n\n\n let sample_0 = \"RELATED-TO;RELTYPE=:c605e4e8-8ea3-4315-b139-19394ab3ced6\\n\";\n\n // let sample_0 = \"RELATED-TO;RELTYPE:c605e4e8-8ea3-4315-b139-19394ab3ced6\\n\";\n\n\n\n let expectation = Property {\n\n name: \"RELATED-TO\".into(),\n\n val: \"c605e4e8-8ea3-4315-b139-19394ab3ced6\".into(),\n\n params: vec![Parameter {\n\n key: \"RELTYPE\".into(),\n\n val: None\n\n }]\n\n };\n\n\n\n assert_parser!(property, sample_0, expectation);\n\n}\n\n\n","file_path":"src/parser/properties.rs","rank":60,"score":39467.22005486949},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_property_with_breaks() {\n\n\n\n let sample_0 = \"DESCRIPTION:Hey, I'm gonna have a party\\\\n BYOB: Bring your own beer.\\\\n Hendrik\\\\n\\n\";\n\n\n\n let expectation = Property {\n\n name: \"DESCRIPTION\".into(),\n\n val: \"Hey, I'm gonna have a party\\\\n BYOB: Bring your own beer.\\\\n Hendrik\\\\n\".into(),\n\n params: vec![]\n\n };\n\n\n\n assert_parser!(property, sample_0, expectation);\n\n}\n","file_path":"src/parser/properties.rs","rank":61,"score":39467.22005486949},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_property_with_no_value() {\n\n\n\n let sample_0 = \"X-NO-VALUE\";\n\n\n\n let expectation = Property {\n\n name: \"X-NO-VALUE\".into(),\n\n val: \"\".into(),\n\n params: vec![]\n\n };\n\n\n\n assert_parser!(property, sample_0, expectation);\n\n}\n\n\n","file_path":"src/parser/properties.rs","rank":62,"score":39467.22005486949},{"content":"#[test]\n\n#[rustfmt::skip]\n\nfn parse_empty_component_with_dash() {\n\n assert_eq!(\n\n component::<(_, ErrorKind)>(\"BEGIN:X-HOODIE-EVENT\\n\\nEND:X-HOODIE-EVENT\\n\"),\n\n Ok((\"\", Component::new_empty(\"X-HOODIE-EVENT\"))),\n\n \"empty component with empty line\");\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":63,"score":38541.59419471619},{"content":"use chrono::prelude::*;\n\nuse icalendar::{Calendar, Class, Component, Event, EventStatus, Todo};\n\nuse pretty_assertions::assert_eq;\n\n\n\nconst EXPECTED_CAL_CONTENT: &str = \"\\\n\nBEGIN:VCALENDAR\\r\n\nVERSION:2.0\\r\n\nPRODID:ICALENDAR-RS\\r\n\nCALSCALE:GREGORIAN\\r\n\nBEGIN:VEVENT\\r\n\nCLASS:CONFIDENTIAL\\r\n\nDESCRIPTION:Description\\r\n\nDTEND:20140709T091011Z\\r\n\nDTSTAMP:20190307T181159\\r\n\nDTSTART:20140708T071011Z\\r\n\nLOCATION:Somewhere\\r\n\nPRIORITY:10\\r\n\nSTATUS:TENTATIVE\\r\n\nSUMMARY:summary\\r\n\nUID:euid\\r\n","file_path":"tests/calendar.rs","rank":64,"score":33191.89054635784},{"content":"#![cfg(feature = \"parser\")]\n\nuse icalendar::parser::unfold;\n\nuse pretty_assertions::assert_eq;\n\n\n\nconst SAMPLE: &str = \"\\\n\nBEGIN:VCALENDAR\\r\n\nVERSION:2.0\\r\n\nPRODID:ICALENDAR-RS\\r\n\nCALSCALE:GREGORIAN\\r\n\nBEGIN:VEVENT\\r\n\nCLASS:CONFIDENTIAL\\r\n\nDESCRIPTION:Description\\r\n\nDTEND:20140709T091011Z\\r\n\nDTSTAMP:20190307T181159\\r\n\nDTSTART:20140708T071011Z\\r\n\nLOCATION:Somewhere\\r\n\nPRIORITY:10\\r\n\nSTATUS:TENTATIVE\\r\n\nSUMMARY:summary\\r\n\nUID:euid\\r\n","file_path":"tests/reserialize.rs","rank":65,"score":33191.70425304848},{"content":"END:VEVENT\\r\n\nBEGIN:VTODO\\r\n\nCOMPLETED:20140709T091011Z\\r\n\nDTSTAMP:20190307T181159\\r\n\nDUE:20140708T091011\\r\n\nPERCENT-COMPLETE:95\\r\n\nSUMMARY:A Todo\\r\n\nUID:todouid\\r\n\nEND:VTODO\\r\n\nEND:VCALENDAR\\r\n\n\";\n\n\n\n#[test]\n","file_path":"tests/calendar.rs","rank":66,"score":33189.3064737564},{"content":" .percent_complete(95)\n\n .due(cest_date.naive_local())\n\n .completed(utc_date)\n\n .summary(\"A Todo\")\n\n .uid(\"todouid\")\n\n .add_property(\"DTSTAMP\", \"20190307T181159\")\n\n .done();\n\n calendar.push(todo);\n\n assert_eq!(calendar.to_string(), EXPECTED_CAL_CONTENT);\n\n}\n","file_path":"tests/calendar.rs","rank":67,"score":33189.10833154186},{"content":"END:VEVENT\\r\n\nBEGIN:VTODO\\r\n\nCOMPLETED:20140709T091011Z\\r\n\nDTSTAMP:20190307T181159\\r\n\nDUE:20140708T091011\\r\n\nPERCENT-COMPLETE:95\\r\n\nSUMMARY:A Todo\\r\n\nUID:todouid\\r\n\nEND:VTODO\\r\n\nBEGIN:VALARM\\r\n\nTRIGGER;RELATED=END:-P2D\\r\n\nACTION:EMAIL\\r\n\nATTENDEE:mailto:john_doe@example.com\\r\n\nSUMMARY:*** REMINDER: SEND AGENDA FOR WEEKLY STAFF MEETING ***\\r\n\nDESCRIPTION:A draft agenda needs to be sent out to the attendees to the wee\\r\n\n kly managers meeting (MGR-LIST). Attached is a pointer the document templat\\r\n\n e for the agenda file.\\r\n\nATTACH;FMTTYPE=application/msword:http://example.com/templates/agenda.doc\\r\n\nEND:VALARM\\r\n\nEND:VCALENDAR\\r\n\n\";\n\n\n\n#[test]\n","file_path":"tests/reserialize.rs","rank":68,"score":33188.2729740766},{"content":"use crate::parser::unfold;\n\n\n\n#[test]\n","file_path":"src/parser/tests.rs","rank":73,"score":31902.53379383006},{"content":"#![cfg(feature = \"parser\")]\n\nuse chrono::{Duration, Utc};\n\nuse icalendar::{Calendar, Class, Component, Event};\n\nuse pretty_assertions::assert_eq;\n\n\n\n#[test]\n","file_path":"tests/folding_consistency.rs","rank":74,"score":31902.41440077289},{"content":"#![cfg(feature = \"parser\")]\n\nuse std::{\n\n env,\n\n ffi::OsStr,\n\n fs,\n\n path::{Path, PathBuf},\n\n};\n\n\n\nuse icalendar::parser::{read_calendar, unfold};\n\n\n","file_path":"tests/parse_fixtures.rs","rank":75,"score":31902.061280947655},{"content":" let parsed_2 = serialized_2.parse::<Calendar>().unwrap();\n\n let serialized_3 = dbg!(parsed_2.to_string());\n\n\n\n let parsed_3 = serialized_3.parse::<Calendar>().unwrap();\n\n let serialized_4 = dbg!(parsed_3.to_string());\n\n\n\n assert_eq!(parsed_1, parsed_2);\n\n assert_eq!(parsed_2, parsed_3);\n\n\n\n assert_eq!(serialized_1, serialized_2);\n\n assert_eq!(serialized_2, serialized_3);\n\n assert_eq!(serialized_3, serialized_4);\n\n}\n","file_path":"tests/folding_consistency.rs","rank":76,"score":31898.81605303272},{"content":" ExNyb290Y2EubmV0c2NhcGUuY29tMB4XDTk3MDYwNjE5NDc1OVoXDTk3MTIwMzE5NDc\n\n 1OVowgYkxCzAJBgNVBAYTAlVTMSYwJAYDVQQKEx1OZXRzY2FwZSBDb21tdW5pY2F0aW\n\n 9ucyBDb3JwLjEYMBYGA1UEAxMPVGltb3RoeSBBIEhvd2VzMSEwHwYJKoZIhvcNAQkBF\n\n hJob3dlc0BuZXRzY2FwZS5jb20xFTATBgoJkiaJk/IsZAEBEwVob3dlczBcMA0GCSqG\n\n SIb3DQEBAQUAA0sAMEgCQQC0JZf6wkg8pLMXHHCUvMfL5H6zjSk4vTTXZpYyrdN2dXc\n\n oX49LKiOmgeJSzoiFKHtLOIboyludF90CgqcxtwKnAgMBAAGjNjA0MBEGCWCGSAGG+E\n\n IBAQQEAwIAoDAfBgNVHSMEGDAWgBT84FToB/GV3jr3mcau+hUMbsQukjANBgkqhkiG9\n\n w0BAQQFAAOBgQBexv7o7mi3PLXadkmNP9LcIPmx93HGp0Kgyx1jIVMyNgsemeAwBM+M\n\n SlhMfcpbTrONwNjZYW8vJDSoi//yrZlVt9bJbs7MNYZVsyF1unsqaln4/vy6Uawfg8V\n\n UMk1U7jt8LYpo4YULU7UZHPYVUaSgVttImOHZIKi4hlPXBOhcUQ==\n\nend:vcard\"#;\n\n\n\n crate::parser::read_calendar(&unfold(example)).unwrap();\n\n}\n","file_path":"src/parser/tests.rs","rank":77,"score":31896.615078674873},{"content":"use std::borrow::Cow;\n\n\n\n#[derive(Debug, Eq, Clone)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub struct ParseString<'a>(Cow<'a, str>);\n\n\n\nimpl ParseString<'_> {\n\n pub fn to_owned(&self) -> ParseString<'static> {\n\n match self.0 {\n\n Cow::Borrowed(s) => ParseString(Cow::Owned(s.to_owned())),\n\n Cow::Owned(ref s) => ParseString(Cow::Owned(s.clone())),\n\n }\n\n }\n\n pub fn into_owned(self) -> ParseString<'static> {\n\n match self.0 {\n\n Cow::Borrowed(s) => ParseString(Cow::Owned(s.to_owned())),\n\n Cow::Owned(s) => ParseString(Cow::Owned(s)),\n\n }\n\n }\n\n pub fn as_str(&self) -> &str {\n","file_path":"src/parser/parsed_string.rs","rank":78,"score":31315.719524483506},{"content":"}\n\n\n\nimpl From<ParseString<'static>> for String {\n\n fn from(val: ParseString<'static>) -> Self {\n\n val.0.into_owned()\n\n }\n\n}\n\n\n\nimpl From<String> for ParseString<'static> {\n\n fn from(s: String) -> Self {\n\n ParseString(Cow::Owned(s))\n\n }\n\n}\n\n\n\nimpl ToString for ParseString<'_> {\n\n fn to_string(&self) -> String {\n\n self.to_owned().into()\n\n }\n\n}\n\n\n\nimpl<'a> From<&'a str> for ParseString<'a> {\n\n fn from(s: &'a str) -> Self {\n\n ParseString(Cow::Borrowed(s))\n\n }\n\n}\n","file_path":"src/parser/parsed_string.rs","rank":79,"score":31306.45995478534},{"content":" self.0.as_ref()\n\n }\n\n}\n\n\n\nimpl PartialEq<Self> for ParseString<'_> {\n\n fn eq(&self, rhs: &Self) -> bool {\n\n self.as_ref() == rhs.as_ref()\n\n }\n\n}\n\n\n\nimpl PartialEq<&str> for ParseString<'_> {\n\n fn eq(&self, rhs: &&str) -> bool {\n\n self.as_ref() == *rhs\n\n }\n\n}\n\n\n\nimpl AsRef<str> for ParseString<'_> {\n\n fn as_ref(&self) -> &str {\n\n self.0.as_ref()\n\n }\n","file_path":"src/parser/parsed_string.rs","rank":80,"score":31303.222590619338},{"content":"};\n\n\n\n#[cfg(test)]\n\nuse nom::error::ErrorKind;\n\n\n\n/// Zero-copy version of [`crate::properties::Property`]\n\n#[derive(PartialEq, Debug, Clone)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub struct Property<'a> {\n\n pub name: ParseString<'a>,\n\n pub val: ParseString<'a>,\n\n pub params: Vec<Parameter<'a>>,\n\n}\n\n\n\nimpl<'a> Property<'a> {\n\n pub fn new_ref(key: &'a str, val: &'a str) -> Property<'a> {\n\n Property {\n\n name: key.into(),\n\n val: val.into(),\n\n params: vec![],\n","file_path":"src/parser/properties.rs","rank":81,"score":33.77398219060547},{"content":"use std::{\n\n fmt::{self, Write},\n\n str::FromStr,\n\n};\n\n\n\nuse crate::{parser::utils::valid_key_sequence_cow, properties::fold_line};\n\n\n\nuse super::{\n\n parameters::{parameters, Parameter},\n\n parsed_string::ParseString,\n\n utils::property_key,\n\n};\n\nuse nom::{\n\n branch::alt,\n\n bytes::complete::{tag, take_until, take_while},\n\n character::complete::{line_ending, multispace0},\n\n combinator::{cut, map, opt},\n\n error::{context, convert_error, ContextError, ParseError, VerboseError},\n\n sequence::{preceded, separated_pair, tuple},\n\n Finish, IResult,\n","file_path":"src/parser/properties.rs","rank":82,"score":30.042678521203047},{"content":"use std::{fmt, str::FromStr};\n\n\n\nuse chrono::Utc;\n\nuse nom::{\n\n branch::alt,\n\n bytes::complete::tag,\n\n combinator::{all_consuming, complete, cut, map},\n\n error::{context, convert_error, ContextError, ParseError, VerboseError},\n\n multi::{many0, many_till},\n\n Finish, IResult,\n\n};\n\n\n\n#[cfg(test)]\n\nuse nom::error::ErrorKind;\n\nuse uuid::Uuid;\n\n\n\n#[cfg(test)]\n\nuse super::parameters::Parameter;\n\nuse super::{\n\n parsed_string::ParseString,\n","file_path":"src/parser/components.rs","rank":83,"score":28.09376442314006},{"content":"use std::{\n\n collections::HashMap,\n\n fmt::{self, Write},\n\n mem,\n\n};\n\n\n\n#[derive(Debug, PartialEq, Eq)]\n\n/// key-value pairs inside of `Property`s\n\npub struct Parameter {\n\n key: String,\n\n val: String,\n\n}\n\n\n\nimpl Parameter {\n\n /// Creates a new `Parameter`\n\n pub fn new(key: &str, val: &str) -> Self {\n\n Parameter {\n\n key: key.to_owned(),\n\n val: val.to_owned(),\n\n }\n","file_path":"src/properties.rs","rank":84,"score":27.552801079899233},{"content":" }\n\n}\n\n\n\n//type EntryParameters = Vec<Parameter>;\n\npub type EntryParameters = HashMap<String, Parameter>;\n\n\n\n#[derive(Debug, PartialEq, Eq)]\n\n/// key-value pairs inside of `Component`s\n\npub struct Property {\n\n pub(crate) key: String,\n\n pub(crate) val: String,\n\n pub(crate) params: EntryParameters,\n\n}\n\n\n\nimpl Property {\n\n /// Guess what this does :D\n\n pub fn new(key: &str, val: &str) -> Self {\n\n Property {\n\n key: key.to_owned(),\n\n val: val.replace('\\n', \"\\\\n\"),\n","file_path":"src/properties.rs","rank":85,"score":25.495796379814596},{"content":" params: HashMap::new(),\n\n }\n\n }\n\n\n\n /// Clones the key field.\n\n pub fn key(&self) -> &str {\n\n &self.key\n\n }\n\n\n\n /// Clones the key field.\n\n pub fn value(&self) -> &str {\n\n &self.val\n\n }\n\n\n\n /// Appends a new parameter.\n\n pub fn append_parameter<I: Into<Parameter>>(&mut self, into_parameter: I) -> &mut Self {\n\n let parameter = into_parameter.into();\n\n self.params.insert(parameter.key.clone(), parameter);\n\n self\n\n }\n","file_path":"src/properties.rs","rank":86,"score":23.812485358070944},{"content":"//! It may contain multiple root elements so we have a `Vec<Component>` and each `Component` may more child `Component`s.\n\n//! Each [`Component`] has properties, so a [`Vec`] of [`Property`] and those have of [`Parameter`]s.\n\n//!\n\n//!\n\n#![allow(missing_docs)]\n\nuse nom::{error::convert_error, error::VerboseError, Finish};\n\n\n\nmod calendar;\n\npub(crate) mod components;\n\nmod parameters;\n\nmod parsed_string;\n\nmod properties;\n\n#[cfg(test)]\n\nmod tests;\n\nmod utils;\n\n\n\npub use calendar::Calendar;\n\npub use components::Component;\n\npub use parameters::Parameter;\n\npub use properties::Property;\n\n\n\nuse components::*;\n\n\n\npub use utils::unfold;\n\n\n\n/// Parse iCalendar file content into an array of [`Component`]s\n\n///\n\n/// This version produces very simple Errors for simplicity's sake.\n","file_path":"src/parser/mod.rs","rank":87,"score":21.677382550729764},{"content":"\n\n /// Creates and appends a parameter.\n\n pub fn add_parameter(&mut self, key: &str, val: &str) -> &mut Self {\n\n self.append_parameter(Parameter::new(key, val));\n\n self\n\n }\n\n\n\n /// End of Builder Pattern.\n\n pub fn done(&mut self) -> Self {\n\n Property {\n\n key: mem::take(&mut self.key),\n\n val: mem::take(&mut self.val),\n\n params: mem::take(&mut self.params),\n\n }\n\n }\n\n\n\n /// Writes this Property to `out`\n\n pub(crate) fn fmt_write<W: Write>(&self, out: &mut W) -> Result<(), fmt::Error> {\n\n // A nice starting capacity for the majority of content lines\n\n let mut line = String::with_capacity(150);\n","file_path":"src/properties.rs","rank":88,"score":20.07348349527464},{"content":" fn properties(&self) -> &[Property<'a>] {\n\n &self.properties\n\n }\n\n\n\n fn components(&self) -> &[Component<'a>] {\n\n &self.components\n\n }\n\n}\n\n\n\nimpl<'a> TryFrom<&'a str> for Component<'a> {\n\n type Error = String;\n\n\n\n fn try_from(input: &'a str) -> Result<Self, Self::Error> {\n\n component(input)\n\n .finish()\n\n .map(|(_, x)| x)\n\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n\n }\n\n}\n\n\n","file_path":"src/parser/components.rs","rank":89,"score":19.9821171915937},{"content":" }\n\n}\n\n\n\nimpl fmt::Display for Property<'_> {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n self.fmt_write(f)\n\n }\n\n}\n\n\n\nimpl<'a> TryFrom<&'a str> for Property<'a> {\n\n type Error = String;\n\n\n\n fn try_from(input: &'a str) -> Result<Self, Self::Error> {\n\n property(input)\n\n .finish()\n\n .map(|(_, x)| x)\n\n .map_err(|e: VerboseError<&str>| format!(\"error: {}\", convert_error(input, e.clone())))\n\n }\n\n}\n\n\n","file_path":"src/parser/properties.rs","rank":90,"score":19.234116260684427},{"content":" properties::property,\n\n unfold,\n\n utils::{line, line_separated, valid_key_sequence_cow},\n\n Property,\n\n};\n\n\n\n#[cfg(test)]\n\nuse pretty_assertions::assert_eq;\n\n\n\nuse crate::{\n\n calendar::CalendarComponent,\n\n components::{InnerComponent, Other},\n\n CalendarDateTime,\n\n};\n\n\n\n/// The parsing equivalent of [`crate::components::Component`]\n\n#[derive(PartialEq, Debug, Clone)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub struct Component<'a> {\n\n pub name: ParseString<'a>,\n","file_path":"src/parser/components.rs","rank":91,"score":19.08684332058164},{"content":"use crate::calendar::CalendarComponent;\n\n\n\nuse super::{components::LikeComponent, read_calendar, unfold, Component, Property};\n\nuse core::{fmt, str::FromStr};\n\n\n\n/// Helpertype for reserialization\n\n#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub struct Calendar<'a> {\n\n pub properties: Vec<Property<'a>>,\n\n pub components: Vec<Component<'a>>,\n\n}\n\n\n\nimpl Calendar<'_> {\n\n /// Prints to stdout\n\n pub fn print(&self) -> Result<(), fmt::Error> {\n\n print_crlf!(\"{}\", self);\n\n Ok(())\n\n }\n\n}\n","file_path":"src/parser/calendar.rs","rank":92,"score":19.074708137189596},{"content":" }\n\n }\n\n}\n\n\n\nimpl Property<'_> {\n\n pub(crate) fn fmt_write<W: Write>(&self, out: &mut W) -> Result<(), fmt::Error> {\n\n // A nice starting capacity for the majority of content lines\n\n let mut line = String::with_capacity(150);\n\n\n\n write!(line, \"{}\", self.name.as_str())?;\n\n for &Parameter { ref key, ref val } in &self.params {\n\n if let Some(val) = val {\n\n write!(line, \";{}={}\", key.as_str(), val.as_str())?;\n\n } else {\n\n write!(line, \";{}\", key.as_str())?;\n\n }\n\n }\n\n write!(line, \":{}\", self.val.as_str())?;\n\n write_crlf!(out, \"{}\", fold_line(&line))?;\n\n Ok(())\n","file_path":"src/parser/properties.rs","rank":93,"score":19.05112028744996},{"content":"use nom::{\n\n bytes::complete::{tag_no_case, take_while},\n\n character::complete::line_ending,\n\n combinator::{complete, map},\n\n error::{ContextError, ParseError},\n\n multi::many0,\n\n sequence::{delimited, preceded},\n\n Err, IResult, Parser,\n\n};\n\n#[cfg(test)]\n\nuse pretty_assertions::assert_eq;\n\n\n\nuse super::parsed_string::ParseString;\n\n\n\n// TODO: how do I express <<alpha_or_dash, but not \"END\">>\n","file_path":"src/parser/utils.rs","rank":94,"score":18.816321710751218},{"content":" map(\n\n alt((\n\n take_until(\"\\r\\n\"),\n\n take_until(\"\\n\"),\n\n // this is for single line prop parsing, just so I can leave off the '\\n'\n\n take_while(|_| true),\n\n )),\n\n ParseString::from,\n\n ),\n\n ), // val TODO: replace this with something simpler!\n\n ),\n\n context(\n\n \"no-value property\",\n\n map(valid_key_sequence_cow, |key| {\n\n ((key, vec![]), ParseString::from(\"\"))\n\n }), // key and nothing else\n\n ),\n\n )),\n\n opt(line_ending),\n\n )),\n\n |(((key, params), val), _)| Property {\n\n name: key,\n\n val,\n\n params,\n\n },\n\n )),\n\n )(input)\n\n}\n","file_path":"src/parser/properties.rs","rank":95,"score":18.1004013482644},{"content":"impl From<Property<'_>> for crate::Property {\n\n fn from(parsed: Property<'_>) -> Self {\n\n Self {\n\n key: parsed.name.as_ref().to_owned(),\n\n val: parsed.val.as_ref().to_owned(),\n\n params: parsed\n\n .params\n\n .into_iter()\n\n .map(|p| (p.key.as_ref().to_owned(), p.into()))\n\n .collect(),\n\n }\n\n }\n\n}\n\n\n\nimpl FromStr for crate::Property {\n\n type Err = String;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n Ok(crate::parser::Property::try_from(s)?.into())\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"src/parser/properties.rs","rank":96,"score":16.267549597246376},{"content":"use super::*;\n\n\n\n#[derive(Debug, Default, PartialEq, Eq)]\n\npub struct Other {\n\n name: String,\n\n inner: InnerComponent,\n\n}\n\n\n\nimpl Component for Other {\n\n /// Tells you what kind of `Component` this is\n\n ///\n\n /// Might be `VEVENT`, `VTODO`, `VALARM` etc\n\n fn component_kind(&self) -> String {\n\n self.name.clone()\n\n }\n\n\n\n /// Read-only access to `properties`\n\n fn properties(&self) -> &BTreeMap<String, Property> {\n\n &self.inner.properties\n\n }\n","file_path":"src/components/other.rs","rank":97,"score":15.039396333070968},{"content":"\n\n write!(line, \"{}\", self.key)?;\n\n for &Parameter {\n\n ref key,\n\n val: ref value,\n\n } in self.params.values()\n\n {\n\n write!(line, \";{}={}\", key, value)?;\n\n }\n\n write!(line, \":{}\", self.val)?;\n\n write_crlf!(out, \"{}\", fold_line(&line))?;\n\n Ok(())\n\n }\n\n}\n\n\n\n/// This property defines the access classification for a calendar component.\n\n/// <https://datatracker.ietf.org/doc/html/rfc5545#section-3.8.1.3>\n\n#[derive(Copy, Clone, Debug)]\n\npub enum Class {\n\n /// [`Public`](https://datatracker.ietf.org/doc/html/rfc5545#section-3.8.1.3)\n","file_path":"src/properties.rs","rank":98,"score":14.803362754423523},{"content":" InProcess,\n\n /// Indicates to-do was cancelled.\n\n Cancelled,\n\n //Custom(&str)\n\n}\n\n\n\n//pub enum JournalStatuw{\n\n// Draft,\n\n// Final,\n\n// Cancelled,\n\n// Custom(&str)\n\n//}\n\n\n\nimpl From<EventStatus> for Property {\n\n fn from(val: EventStatus) -> Self {\n\n Property {\n\n key: String::from(\"STATUS\"),\n\n val: String::from(match val {\n\n EventStatus::Tentative => \"TENTATIVE\",\n\n EventStatus::Confirmed => \"CONFIRMED\",\n","file_path":"src/properties.rs","rank":99,"score":14.642974194208033}],"string":"[\n {\n \"content\": \"pub fn valid_key_sequence_cow<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\\n\\n input: &'a str,\\n\\n) -> IResult<&'a str, ParseString<'a>, E> {\\n\\n map(\\n\\n take_while(|c: char| {\\n\\n c == '.' || c == ',' || c == '/' || c == '_' || c == '-' || c.is_alphanumeric()\\n\\n }),\\n\\n ParseString::from,\\n\\n )(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 1,\n \"score\": 263752.2400370854\n },\n {\n \"content\": \"// TODO: how do I express <<alpha_or_dash, but not \\\"END\\\">>\\n\\npub fn property_key<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\\n\\n input: &'a str,\\n\\n) -> IResult<&'a str, &str, E> {\\n\\n if &input[0..=2] == \\\"END\\\" || &input[0..=4] == \\\"BEGIN\\\" {\\n\\n IResult::Err(Err::Error(nom::error::make_error(\\n\\n input,\\n\\n nom::error::ErrorKind::Satisfy,\\n\\n )))\\n\\n } else {\\n\\n valid_key_sequence(input)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 2,\n \"score\": 253519.29882932812\n },\n {\n \"content\": \"pub fn valid_key_sequence<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\\n\\n input: &'a str,\\n\\n) -> IResult<&'a str, &str, E> {\\n\\n take_while(|c: char| {\\n\\n c == '.' || c == ',' || c == '/' || c == '_' || c == '-' || c.is_alphanumeric()\\n\\n })(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 3,\n \"score\": 249780.41853004915\n },\n {\n \"content\": \"pub fn property<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\\n\\n input: &'a str,\\n\\n) -> IResult<&'a str, Property, E> {\\n\\n context(\\n\\n \\\"property\\\",\\n\\n cut(map(\\n\\n tuple((\\n\\n alt((\\n\\n separated_pair(\\n\\n tuple((\\n\\n // preceded(multispace0, alpha_or_dash), // key\\n\\n cut(context(\\n\\n \\\"property can't be END or BEGIN\\\",\\n\\n map(preceded(multispace0, property_key), ParseString::from),\\n\\n )), // key\\n\\n parameters, // params\\n\\n )),\\n\\n context(\\\"property sparator\\\", tag(\\\":\\\")), // separator\\n\\n context(\\n\\n \\\"property value\\\",\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 4,\n \"score\": 233131.3680667415\n },\n {\n \"content\": \"pub fn component<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\\n\\n input: &'a str,\\n\\n) -> IResult<&'a str, Component, E> {\\n\\n let (input, name) = line(\\\"BEGIN:\\\", valid_key_sequence_cow)(input)?;\\n\\n\\n\\n let (input, (properties, components)) = map(\\n\\n many_till(\\n\\n cut(context(\\n\\n \\\"component\\\",\\n\\n alt((\\n\\n map(line_separated(component), ComponentChild::Component),\\n\\n map(line_separated(property), ComponentChild::Property),\\n\\n )),\\n\\n )),\\n\\n line(\\\"END:\\\", cut(context(\\\"MISMATCHING END\\\", tag(name.as_str())))),\\n\\n ),\\n\\n |(body_elements, _)| {\\n\\n let mut properties = Vec::new();\\n\\n let mut components = Vec::new();\\n\\n for el in body_elements {\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 5,\n \"score\": 233131.3680667415\n },\n {\n \"content\": \"pub fn components<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\\n\\n input: &'a str,\\n\\n) -> IResult<&'a str, Vec<Component>, E> {\\n\\n complete(many0(all_consuming(component)))(input)\\n\\n}\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 6,\n \"score\": 233131.3680667415\n },\n {\n \"content\": \"/// Normalize content lines.\\n\\n///\\n\\n/// This simplifies line endings and unfolds breaks to simplify parsing.\\n\\n/// iCal specifies that content may be folded and to fit into a certain\\n\\n/// length, which must be undone before parsing.\\n\\n///\\n\\n/// This is a copying operation.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// # use icalendar::parser::unfold;\\n\\n/// #[rustfmt::skip]\\n\\n/// let line = \\\"this gets w\\\\r\\n\\n/// rapped i\\\\r\\n\\n/// n a w\\\\r\\n\\n/// eird\\\\r\\n\\n/// way\\\";\\n\\n///\\n\\n/// assert_eq!(unfold(line), \\\"this gets wrapped in a weird way\\\")\\n\\n/// ```\\n\\npub fn unfold(input: &str) -> String {\\n\\n input.split(\\\"\\\\r\\\\n \\\").flat_map(|l| l.split(\\\"\\\\n \\\")).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 10,\n \"score\": 227953.3449972187\n },\n {\n \"content\": \"/// Parse iCalendar file content into an array of [`Component`]s\\n\\n///\\n\\n/// This version produces nice and readable errors with line numbers thanks the the awesomeness of [`nom`].\\n\\n/// Line numbers are in regard to the normalized/unfolded version of the input, so better keep those around for reference.\\n\\n///\\n\\npub fn read_calendar(input: &str) -> Result<Calendar<'_>, String> {\\n\\n components(input)\\n\\n .finish()\\n\\n .map(|(_, mut components)| {\\n\\n let root_is_calendar = components\\n\\n .get(0)\\n\\n .map(|first_root| first_root.name == \\\"VCALENDAR\\\")\\n\\n .unwrap_or(false);\\n\\n\\n\\n if root_is_calendar {\\n\\n let root = components.swap_remove(0);\\n\\n Calendar {\\n\\n properties: root.properties,\\n\\n components: root.components,\\n\\n }\\n\\n } else {\\n\\n Calendar {\\n\\n components,\\n\\n properties: Vec::new(),\\n\\n }\\n\\n }\\n\\n })\\n\\n .map_err(|e: VerboseError<&str>| format!(\\\"error: {}\\\", convert_error(input, e.clone())))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/mod.rs\",\n \"rank\": 11,\n \"score\": 203288.83902359358\n },\n {\n \"content\": \"pub fn read_component(input: &str) -> Result<Component<'_>, String> {\\n\\n component(input)\\n\\n .finish()\\n\\n .map(|(_, component)| component)\\n\\n .map_err(|e: VerboseError<&str>| format!(\\\"error: {}\\\", convert_error(input, e.clone())))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 12,\n \"score\": 203280.69140787976\n },\n {\n \"content\": \"pub fn line<'a, O, E: ParseError<&'a str>, F: Parser<&'a str, O, E>>(\\n\\n prefix: &'a str,\\n\\n f: F,\\n\\n) -> impl FnMut(&'a str) -> IResult<&'a str, O, E> {\\n\\n line_separated(complete(preceded(tag_no_case(prefix), f)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 13,\n \"score\": 203278.56614216592\n },\n {\n \"content\": \"pub fn line_separated<'a, O, E: ParseError<&'a str>, F: Parser<&'a str, O, E>>(\\n\\n f: F,\\n\\n) -> impl FnMut(&'a str) -> IResult<&'a str, O, E> {\\n\\n delimited(many0(line_ending), f, many0(line_ending))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 14,\n \"score\": 200463.29752755584\n },\n {\n \"content\": \"pub fn print_result<T: fmt::Debug>(input: &str, rest: &str, result: &T) {\\n\\n println!(\\n\\n \\\"INPUT: {:?}\\\\nLEFT: {:?}\\\\nRESULT: {:#?}\\\",\\n\\n input, rest, result\\n\\n );\\n\\n}\\n\\n\\n\\nmacro_rules! assert_parser {\\n\\n ($parser:ident, $line:expr) => {\\n\\n assert_parser!($line, $parser);\\n\\n };\\n\\n\\n\\n ($parser:ident, $line:expr, $expectation:expr) => {{\\n\\n match $parser::<(_, ErrorKind)>(&$line) {\\n\\n Ok((rest, parsed)) => {\\n\\n crate::assert::print_result($line, &rest, &parsed);\\n\\n pretty_assertions::assert_eq!(\\n\\n parsed,\\n\\n $expectation,\\n\\n \\\"{:?} not parsed as expected\\\",\\n\",\n \"file_path\": \"src/assert.rs\",\n \"rank\": 15,\n \"score\": 199715.70227269048\n },\n {\n \"content\": \"/// Parse iCalendar file content into an array of [`Component`]s\\n\\n///\\n\\n/// This version produces nice and readable errors with line numbers thanks the the awesomeness of [`nom`].\\n\\n/// Line numbers are in regard to the normalized/unfolded version of the input, so better keep those around for reference.\\n\\n///\\n\\npub fn read_components(input: &str) -> Result<Vec<Component<'_>>, String> {\\n\\n components(input)\\n\\n .finish()\\n\\n .map(|(_, components)| components)\\n\\n .map_err(|e: VerboseError<&str>| format!(\\\"error: {}\\\", convert_error(input, e.clone())))\\n\\n}\\n\",\n \"file_path\": \"src/parser/mod.rs\",\n \"rank\": 16,\n \"score\": 196259.46745025314\n },\n {\n \"content\": \"// read first arg as file name or read stdin if arg[1] == \\\"-\\\"\\n\\npub fn content_from_arg() -> Result<Option<String>, Box<dyn std::error::Error>> {\\n\\n if let Some(arg) = env::args().nth(1) {\\n\\n let (mut std_in, mut file);\\n\\n let readable: &mut dyn io::Read = if arg == \\\"-\\\" {\\n\\n std_in = io::stdin();\\n\\n &mut std_in\\n\\n } else {\\n\\n file = fs::File::open(arg)?;\\n\\n &mut file\\n\\n };\\n\\n let mut output = String::new();\\n\\n readable.read_to_string(&mut output)?;\\n\\n Ok(Some(output))\\n\\n } else {\\n\\n eprintln!(\\\"no input provided\\\");\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/example_utils.rs\",\n \"rank\": 18,\n \"score\": 163166.90241893393\n },\n {\n \"content\": \"#[test]\\n\\nfn try_into_string() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let bday = Event::new()\\n\\n .start_date(Utc.ymd(2016, 3, 15))\\n\\n .end_date(Utc.ymd(2016, 3, 15))\\n\\n .summary(\\\"My Birthday\\\")\\n\\n .description(\\n\\n r#\\\"Hey, I'm gonna have a party\\n\\nBYOB: Bring your own beer.\\n\\nHendrik\\\"#,\\n\\n )\\n\\n .done();\\n\\n\\n\\n let mut calendar = Calendar::new();\\n\\n calendar.push(bday);\\n\\n\\n\\n let s1: String = (&calendar).try_into()?;\\n\\n let s2: String = calendar.to_string();\\n\\n\\n\\n println!(\\\"{:?}\\\", (s1, s2));\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tests/try_into_string.rs\",\n \"rank\": 19,\n \"score\": 149637.46989673027\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn print_with_lines(content: &str) {\\n\\n println!(\\n\\n \\\"{}\\\",\\n\\n content\\n\\n .lines()\\n\\n .enumerate()\\n\\n .map(|(num, content)| format!(\\\"{:4}. {}\\\\n\\\", num + 1, content))\\n\\n .collect::<String>()\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/example_utils.rs\",\n \"rank\": 21,\n \"score\": 132746.9964801671\n },\n {\n \"content\": \"#[test]\\n\\nfn test_calendar_to_string() {\\n\\n let mut calendar = Calendar::new();\\n\\n let cest_date = FixedOffset::east(2 * 3600)\\n\\n .ymd(2014, 7, 8)\\n\\n .and_hms(9, 10, 11);\\n\\n let utc_date = Utc.ymd(2014, 7, 9).and_hms(9, 10, 11);\\n\\n let event = Event::new()\\n\\n .status(EventStatus::Tentative)\\n\\n .starts(cest_date.with_timezone(&Utc))\\n\\n .ends(utc_date)\\n\\n .priority(11) // converted to 10\\n\\n .summary(\\\"summary\\\")\\n\\n .description(\\\"Description\\\")\\n\\n .location(\\\"Somewhere\\\")\\n\\n .uid(\\\"euid\\\")\\n\\n .class(Class::Confidential)\\n\\n .add_property(\\\"DTSTAMP\\\", \\\"20190307T181159\\\")\\n\\n .done();\\n\\n calendar.push(event);\\n\\n let todo = Todo::new()\\n\",\n \"file_path\": \"tests/calendar.rs\",\n \"rank\": 25,\n \"score\": 108207.41249863929\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let groceries = Todo::new()\\n\\n .summary(\\\"buy groceries\\\")\\n\\n .description(\\\"* soy-milk\\\\n* oak-meal\\\\n* vegan chocolate\\\\n* kale\\\\n* bacon\\\\nabcdefghijklmnopqrstuvwxyz\\\")\\n\\n .starts(Local::now().naive_local())\\n\\n .ends(Local::now().naive_local() + Duration::hours(24))\\n\\n .priority(12)\\n\\n .percent_complete(28)\\n\\n .status(TodoStatus::InProcess)\\n\\n .completed(Utc::now())\\n\\n .due(Local::now().with_timezone(&Utc))\\n\\n .done();\\n\\n\\n\\n let calendar = dbg!(Calendar::from([groceries]));\\n\\n println!(\\\"{}\\\", calendar);\\n\\n\\n\\n #[cfg(feature = \\\"parser\\\")]\\n\\n {\\n\\n let parsed_calendar = dbg!(calendar.to_string().parse::<Calendar>()?);\\n\\n parsed_calendar.print()?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/todos.rs\",\n \"rank\": 27,\n \"score\": 94509.21153495318\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n if let Some(sample) = content_from_arg()? {\\n\\n let unfolded = unfold(&sample);\\n\\n print_with_lines(&unfolded);\\n\\n\\n\\n let parsed_calendar = match sample.parse::<Calendar>() {\\n\\n Ok(read) => read,\\n\\n Err(error) => {\\n\\n println!(\\\"{}\\\", error); // println!(error) yields prettier output\\n\\n return Ok(());\\n\\n }\\n\\n };\\n\\n println!(\\\"{}\\\", parsed_calendar);\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/parse.rs\",\n \"rank\": 28,\n \"score\": 94509.21153495318\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n if let Some(content) = content_from_arg()? {\\n\\n let calendar = serde_json::from_str::<icalendar::parser::Calendar>(&content)?;\\n\\n println!(\\\"{}\\\", calendar);\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/json_to_ical.rs\",\n \"rank\": 29,\n \"score\": 93032.45528118216\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n if let Some(sample) = content_from_arg()? {\\n\\n let unfolded = unfold(&sample);\\n\\n //print_with_lines(&unfolded);\\n\\n\\n\\n match icalendar::parser::read_calendar(&unfolded) {\\n\\n Ok(read) => println!(\\\"{}\\\", serde_json::to_string_pretty(&read)?),\\n\\n Err(error) => println!(\\\"human-readable error\\\\n{}\\\", error),\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/ical_to_json.rs\",\n \"rank\": 30,\n \"score\": 93032.45528118216\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n if let Some(sample) = content_from_arg()? {\\n\\n let unfolded = unfold(&sample);\\n\\n // print_with_lines(&unfolded);\\n\\n\\n\\n match icalendar::parser::read_calendar(&unfolded) {\\n\\n Ok(read) => println!(\\\"{}\\\", read),\\n\\n Err(error) => println!(\\\"human-readable error\\\\n{}\\\", error),\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/parse_advanced.rs\",\n \"rank\": 31,\n \"score\": 93032.45528118216\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let event = Event::new()\\n\\n .summary(\\\"test event\\\")\\n\\n .append_property(\\n\\n Property::new(\\\"TEST\\\", \\\"FOOBAR\\\")\\n\\n .add_parameter(\\\"IMPORTANCE\\\", \\\"very\\\")\\n\\n .add_parameter(\\\"DUE\\\", \\\"tomorrow\\\")\\n\\n .done(),\\n\\n )\\n\\n .uid(\\\"my.own.id\\\")\\n\\n .done();\\n\\n\\n\\n let calendar = Calendar::from([event]);\\n\\n\\n\\n calendar.print()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/custom_property.rs\",\n \"rank\": 32,\n \"score\": 93032.45528118216\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let event = Event::new()\\n\\n .summary(\\\"test event\\\")\\n\\n .append_property(\\n\\n \\\"TEST;IMPORTANCE=very;DUE=tomorrow:FOOBAR\\\\n\\\"\\n\\n .parse()\\n\\n .unwrap(),\\n\\n )\\n\\n // .uid(\\\"my.own.id\\\")\\n\\n .done();\\n\\n\\n\\n let parsed_event = r#\\\"BEGIN:VEVENT\\n\\nDTSTAMP:20211123T192118Z\\n\\nSUMMARY:parsed event\\n\\nTEST;IMPORTANCE=very;DUE=tomorrow:FOOBAR\\n\\nEND:VEVENT\\n\\n\\\"#;\\n\\n\\n\\n let calendar = Calendar::from(event)\\n\\n .push(parsed_event.parse::<CalendarComponent>().unwrap())\\n\\n .done();\\n\\n calendar.print()?;\\n\\n\\n\\n let parsed_calendar = calendar.to_string().parse::<Calendar>()?;\\n\\n parsed_calendar.print()?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"examples/custom_property_parsed.rs\",\n \"rank\": 33,\n \"score\": 91629.69341562988\n },\n {\n \"content\": \"/// Parse iCalendar file content into an array of [`Component`]s\\n\\n///\\n\\n/// This version produces very simple Errors for simplicity's sake.\\n\\npub fn read_calendar_simple<'a>(\\n\\n input: &'a str,\\n\\n) -> Result<Vec<Component<'_>>, nom::error::Error<&'a str>> {\\n\\n components(input).finish().map(|(_, components)| components)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/mod.rs\",\n \"rank\": 34,\n \"score\": 87761.38643331535\n },\n {\n \"content\": \"#[test]\\n\\nfn test_folding_consistency() {\\n\\n let parsed_0 = Calendar::from([\\n\\n // add an event\\n\\n Event::new()\\n\\n .summary(\\\"test event\\\")\\n\\n .description(include_str!(\\\"lorem.txt\\\"))\\n\\n .timestamp(Utc::now())\\n\\n .uid(\\\"1234\\\")\\n\\n .starts(Utc::now())\\n\\n .class(Class::Confidential)\\n\\n .ends(Utc::now() + Duration::days(1))\\n\\n .done(),\\n\\n ]);\\n\\n let serialized_1 = parsed_0.to_string();\\n\\n\\n\\n let parsed_1 = serialized_1.parse::<Calendar>().unwrap();\\n\\n assert_eq!(parsed_0, parsed_1);\\n\\n\\n\\n let serialized_2 = dbg!(parsed_1.to_string());\\n\\n\\n\",\n \"file_path\": \"tests/folding_consistency.rs\",\n \"rank\": 35,\n \"score\": 76206.81245323452\n },\n {\n \"content\": \"#[test]\\n\\nfn reserialization() {\\n\\n let unfolded = unfold(SAMPLE);\\n\\n // print_with_lines(&unfolded);\\n\\n\\n\\n let parsed = icalendar::parser::read_calendar(&unfolded).unwrap();\\n\\n let reserialized = parsed.to_string();\\n\\n println!(\\\"{}\\\", reserialized);\\n\\n assert_eq!(SAMPLE, reserialized);\\n\\n}\\n\",\n \"file_path\": \"tests/reserialize.rs\",\n \"rank\": 36,\n \"score\": 74571.9646787116\n },\n {\n \"content\": \"#[test]\\n\\nfn rfc_2425_8_3_3() {\\n\\n let example = r#\\\"begin:vcard\\n\\nsource:ldap://cn=Meister%20Berger,o=Universitaet%20Goerlitz,c=DE\\n\\nname:Meister Berger\\n\\nfn:Meister Berger\\n\\nn:Berger;Meister\\n\\nbday;value=date:1963-09-21\\n\\no:Universit=E6t G=F6rlitz\\n\\ntitle:Mayor\\n\\ntitle;language=de;value=text:Burgermeister\\n\\nnote:The Mayor of the great city of\\n\\n Goerlitz in the great country of Germany.\\n\\nemail;internet:mb@goerlitz.de\\n\\nhome.tel;type=fax,voice,msg:+49 3581 123456\\n\\nhome.label:Hufenshlagel 1234\\\\n\\n\\n 02828 Goerlitz\\\\n\\n\\n Deutschland\\n\\nkey;type=X509;encoding=b:MIICajCCAdOgAwIBAgICBEUwDQYJKoZIhvcNAQEEBQ\\n\\n AwdzELMAkGA1UEBhMCVVMxLDAqBgNVBAoTI05ldHNjYXBlIENvbW11bmljYXRpb25zI\\n\\n ENvcnBvcmF0aW9uMRwwGgYDVQQLExNJbmZvcm1hdGlvbiBTeXN0ZW1zMRwwGgYDVQQD\\n\",\n \"file_path\": \"src/parser/tests.rs\",\n \"rank\": 37,\n \"score\": 72228.00567470855\n },\n {\n \"content\": \"#[test]\\n\\nfn test_property() {\\n\\n assert_parser!(\\n\\n property,\\n\\n \\\"KEY:VALUE\\\\n\\\",\\n\\n Property {\\n\\n name: \\\"KEY\\\".into(),\\n\\n val: \\\"VALUE\\\".into(),\\n\\n params: vec![]\\n\\n }\\n\\n );\\n\\n\\n\\n assert_parser!(\\n\\n property,\\n\\n \\\"KEY1;foo=bar:VALUE\\\\n\\\",\\n\\n Property {\\n\\n name: \\\"KEY1\\\".into(),\\n\\n val: \\\"VALUE\\\".into(),\\n\\n params: vec![Parameter::new_ref(\\\"foo\\\", Some(\\\"bar\\\"))]\\n\\n }\\n\\n );\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 38,\n \"score\": 70053.23384938014\n },\n {\n \"content\": \"#[test]\\n\\nfn test_unfold2() {\\n\\n let input1 = \\\"1 hello world\\\\n2 hello \\\\n world\\\\n3 hello world\\\\n4 hello world\\\";\\n\\n let input2 = \\\"1 hello world\\\\r\\\\n2 hello \\\\r\\\\n world\\\\r\\\\n3 hello \\\\r\\\\n world\\\\r\\\\n4 hello world\\\";\\n\\n\\n\\n let expected = vec![\\n\\n \\\"1 hello world\\\",\\n\\n \\\"2 hello world\\\",\\n\\n \\\"3 hello world\\\",\\n\\n \\\"4 hello world\\\",\\n\\n ];\\n\\n\\n\\n assert_eq!(unfold(input1).lines().collect::<Vec<_>>(), expected);\\n\\n assert_eq!(unfold(input2).lines().collect::<Vec<_>>(), expected);\\n\\n}\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 39,\n \"score\": 70053.23384938014\n },\n {\n \"content\": \"#[test]\\n\\nfn test_unfold1() {\\n\\n let input = \\\"1 hello world\\\\r\\\\n2 hello \\\\r\\\\n world\\\\r\\\\n3 hello \\\\r\\\\n world\\\\r\\\\n4 hello world\\\";\\n\\n let expected = \\\"1 hello world\\\\r\\\\n2 hello world\\\\r\\\\n3 hello world\\\\r\\\\n4 hello world\\\";\\n\\n assert_eq!(unfold(input), expected);\\n\\n}\\n\\n\\n\\n/// this is actually also allowed by the spec\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 40,\n \"score\": 70053.23384938014\n },\n {\n \"content\": \"#[test]\\n\\nfn test_components() {\\n\\n assert_parser!(component, \\\"BEGIN:FOO\\\\nEND:FOO\\\", Component::new_empty(\\\"FOO\\\"));\\n\\n\\n\\n assert_parser!(\\n\\n component,\\n\\n \\\"BEGIN:FOO\\\\nFOO-PROP:important: spam €\\\\nEND:FOO\\\",\\n\\n Component {\\n\\n name: \\\"FOO\\\".into(),\\n\\n properties: vec![Property {\\n\\n name: \\\"FOO-PROP\\\".into(),\\n\\n val: \\\"important: spam €\\\".into(),\\n\\n params: vec![]\\n\\n }],\\n\\n components: vec![]\\n\\n }\\n\\n );\\n\\n\\n\\n assert_parser!(\\n\\n component,\\n\\n \\\"BEGIN:FOO\\\\nUID:e1c97b31-38bb-4b72-b94f-463a12ef5239\\\\nFOO-PROP:sp.am\\\\nEND:FOO\\\",\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 41,\n \"score\": 70053.23384938014\n },\n {\n \"content\": \"fn with_all_fixtures<F>(\\n\\n sub_folder: impl AsRef<Path>,\\n\\n f: F,\\n\\n) -> Result<(), Box<dyn std::error::Error>>\\n\\nwhere\\n\\n F: Fn(&dyn AsRef<Path>), // -> Result<(), Box<dyn std::error::Error>>,\\n\\n{\\n\\n let fixture_path = PathBuf::from(env::var(\\\"CARGO_MANIFEST_DIR\\\").unwrap())\\n\\n .join(\\\"fixtures\\\")\\n\\n .join(sub_folder);\\n\\n\\n\\n for path in fs::read_dir(fixture_path)?\\n\\n .filter_map(|entry| entry.ok())\\n\\n .filter(|entry| entry.path().extension().and_then(OsStr::to_str) == Some(\\\"ics\\\"))\\n\\n .map(|entry| entry.path())\\n\\n {\\n\\n f(&path);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/parse_fixtures.rs\",\n \"rank\": 42,\n \"score\": 69305.86288260063\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_fixtures_root() {\\n\\n with_all_fixtures(\\\"\\\", |path| {\\n\\n let fixture = std::fs::read_to_string(&path).unwrap();\\n\\n if let Err(error) = read_calendar(&unfold(&fixture)) {\\n\\n println!(\\\"{}\\\", error);\\n\\n\\n\\n panic!(\\\"test failed\\\");\\n\\n }\\n\\n })\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/parse_fixtures.rs\",\n \"rank\": 43,\n \"score\": 68029.96935001918\n },\n {\n \"content\": \"#[test]\\n\\nfn test_nested_components() {\\n\\n assert_parser!(\\n\\n component,\\n\\n \\\"BEGIN:FOO\\\\nFOO-PROP:spam\\\\nBEGIN:BAR\\\\nBAR-PROP:spam\\\\nBEGIN:BAR\\\\nBAR-PROP:spam\\\\nEND:BAR\\\\nEND:BAR\\\\nEND:FOO\\\",\\n\\n Component {\\n\\n name: \\\"FOO\\\".into(),\\n\\n properties: vec![Property::new_ref (\\n\\n \\\"FOO-PROP\\\",\\n\\n \\\"spam\\\",\\n\\n )],\\n\\n components: vec![\\n\\n Component {\\n\\n name: \\\"BAR\\\".into(),\\n\\n properties: vec![Property::new_ref (\\n\\n \\\"BAR-PROP\\\",\\n\\n \\\"spam\\\",\\n\\n )],\\n\\n components: vec![\\n\\n Component {\\n\\n name: \\\"BAR\\\".into(),\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 44,\n \"score\": 68029.96935001918\n },\n {\n \"content\": \"#[test]\\n\\nfn test_property_with_dash() {\\n\\n assert_parser!(\\n\\n property,\\n\\n \\\"X-HOODIE-KEY:VALUE\\\\n\\\",\\n\\n Property {\\n\\n name: \\\"X-HOODIE-KEY\\\".into(),\\n\\n val: \\\"VALUE\\\".into(),\\n\\n params: vec![]\\n\\n }\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 45,\n \"score\": 68029.96935001918\n },\n {\n \"content\": \"#[test]\\n\\nfn test_multi_components() {\\n\\n assert_parser!(\\n\\n component,\\n\\n r#\\\"\\n\\nBEGIN:VEVENT\\n\\nBEGIN:VALARM\\n\\nRELATED-TO;RELTYPE=:c605e4e8-8ea3-4315-b139-19394ab3ced6\\n\\nEND:VALARM\\n\\nEND:VEVENT\\n\\n\\\"#,\\n\\n Component {\\n\\n name: \\\"VEVENT\\\".into(),\\n\\n properties: vec![],\\n\\n components: vec![Component {\\n\\n name: \\\"VALARM\\\".into(),\\n\\n properties: vec![Property {\\n\\n name: \\\"RELATED-TO\\\".into(),\\n\\n val: \\\"c605e4e8-8ea3-4315-b139-19394ab3ced6\\\".into(),\\n\\n params: vec![Parameter::new_ref(\\\"RELTYPE\\\", None,)],\\n\\n }],\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 46,\n \"score\": 68029.96935001918\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn test_faulty_component() {\\n\\n assert_parser!(\\n\\n component,\\n\\n \\\"BEGIN:FOO\\\\nEND:F0O\\\",\\n\\n Component {\\n\\n name: \\\"FOO\\\".into(),\\n\\n properties: vec![],\\n\\n components: vec![]\\n\\n }\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 47,\n \"score\": 68029.91207316304\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_fixtures_icalendar_rb() {\\n\\n with_all_fixtures(\\\"icalendar-rb\\\", |path| {\\n\\n let fixture = std::fs::read_to_string(&path).unwrap();\\n\\n if let Err(error) = read_calendar(&unfold(&fixture)) {\\n\\n println!(\\\"{}\\\", error);\\n\\n\\n\\n panic!(\\\"test failed\\\");\\n\\n }\\n\\n })\\n\\n .unwrap();\\n\\n}\\n\\n\\n\\n/// this one is a bit special because the file is not valid utf8\\n\\n/// but it's nice to know that we can still parse it\\n\",\n \"file_path\": \"tests/parse_fixtures.rs\",\n \"rank\": 48,\n \"score\": 66142.91276992644\n },\n {\n \"content\": \"use chrono::*;\\n\\nuse icalendar::*;\\n\\nuse std::convert::TryInto;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/try_into_string.rs\",\n \"rank\": 49,\n \"score\": 64416.09353947906\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_fixtures_icalendar_rb_bad_utf8() {\\n\\n eprintln!(\\\"these fixtures produce errors\\\");\\n\\n with_all_fixtures(\\\"icalendar-rb-bad-utf8\\\", |path| {\\n\\n // let fixture = std::fs::read_to_string(&path).unwrap();\\n\\n let file_content = std::fs::read(path).unwrap();\\n\\n let fixture = dbg!(String::from_utf8_lossy(&file_content));\\n\\n\\n\\n dbg!(read_calendar(&unfold(&fixture)).unwrap());\\n\\n })\\n\\n .unwrap();\\n\\n}\\n\",\n \"file_path\": \"tests/parse_fixtures.rs\",\n \"rank\": 50,\n \"score\": 62725.87578459527\n },\n {\n \"content\": \"/// Implemented by everything that goes into a `Calendar`\\n\\npub trait Component {\\n\\n /// Returns kind of component.\\n\\n ///\\n\\n ///\\n\\n /// Must be ALL CAPS\\n\\n /// These are used in the `BEGIN` and `END` line of the component.\\n\\n fn component_kind(&self) -> String;\\n\\n\\n\\n /// Allows access to the inner properties map.\\n\\n fn properties(&self) -> &BTreeMap<String, Property>;\\n\\n\\n\\n /// Read-only access to `multi_properties`\\n\\n fn multi_properties(&self) -> &Vec<Property>;\\n\\n\\n\\n /// Writes [`Component`] using [`std::fmt`].\\n\\n fn fmt_write<W: fmt::Write>(&self, out: &mut W) -> Result<(), fmt::Error> {\\n\\n write_crlf!(out, \\\"BEGIN:{}\\\", self.component_kind())?;\\n\\n\\n\\n if !self.properties().contains_key(\\\"DTSTAMP\\\") {\\n\\n let now = CalendarDateTime::Utc(Utc::now());\\n\",\n \"file_path\": \"src/components.rs\",\n \"rank\": 51,\n \"score\": 55168.34635372985\n },\n {\n \"content\": \"pub trait Repeater: Sized {}\\n\",\n \"file_path\": \"src/repeats.rs\",\n \"rank\": 52,\n \"score\": 52636.773887579904\n },\n {\n \"content\": \"fn main() {\\n\\n // lets create a calendar\\n\\n let my_calendar = Calendar::new()\\n\\n .name(\\\"example calendar\\\")\\n\\n .push(\\n\\n // add an event\\n\\n Event::new()\\n\\n .summary(\\\"test event\\\")\\n\\n .description(\\\"here I have something really important to do\\\")\\n\\n .starts(Utc::now())\\n\\n .class(Class::Confidential)\\n\\n .ends(Utc::now() + Duration::days(1))\\n\\n .append_property(\\n\\n Property::new(\\\"TEST\\\", \\\"FOOBAR\\\")\\n\\n .add_parameter(\\\"IMPORTANCE\\\", \\\"very\\\")\\n\\n .add_parameter(\\\"DUE\\\", \\\"tomorrow\\\")\\n\\n .done(),\\n\\n )\\n\\n .done(),\\n\\n )\\n\",\n \"file_path\": \"examples/readme.rs\",\n \"rank\": 53,\n \"score\": 42672.62424970597\n },\n {\n \"content\": \"fn main() {\\n\\n let event = Event::new()\\n\\n .summary(\\\"test event\\\")\\n\\n .description(\\\"here I have something really important to do\\\")\\n\\n .starts(Utc::now())\\n\\n .class(Class::Confidential)\\n\\n .ends(Utc::now() + Duration::days(1))\\n\\n .append_property(\\n\\n Property::new(\\\"TEST\\\", \\\"FOOBAR\\\")\\n\\n .add_parameter(\\\"IMPORTANCE\\\", \\\"very\\\")\\n\\n .add_parameter(\\\"DUE\\\", \\\"tomorrow\\\")\\n\\n .done(),\\n\\n )\\n\\n .uid(\\\"my.own.id\\\")\\n\\n .done();\\n\\n\\n\\n let todo = Todo::new().summary(\\\"Buy some milk\\\").done();\\n\\n\\n\\n let mut built_calendar = Calendar::new();\\n\\n built_calendar.push(event);\\n\",\n \"file_path\": \"examples/full_circle.rs\",\n \"rank\": 54,\n \"score\": 41522.88179252022\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn main() {\\n\\n eprintln!(\\\"this is not an example, just a utility module\\\");\\n\\n}\\n\",\n \"file_path\": \"examples/example_utils.rs\",\n \"rank\": 55,\n \"score\": 41522.88179252022\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_component() {\\n\\n let sample_1 = \\\"BEGIN:VEVENT\\n\\nKEY;foo=bar:VALUE\\n\\nKEY;foo=bar;DATE=20170218:VALUE\\n\\nEND:VEVENT\\n\\n\\\";\\n\\n\\n\\n let expectation = Component{name: \\\"VEVENT\\\".into(), properties: vec![\\n\\n Property{name: \\\"KEY\\\".into(), val: \\\"VALUE\\\".into(), params: vec![\\n\\n Parameter::new_ref(\\\"foo\\\", Some(\\\"bar\\\")),\\n\\n ]},\\n\\n Property{name: \\\"KEY\\\".into(), val: \\\"VALUE\\\".into(), params: vec![\\n\\n Parameter::new_ref(\\\"foo\\\", Some(\\\"bar\\\")),\\n\\n Parameter::new_ref(\\\"DATE\\\", Some(\\\"20170218\\\")),\\n\\n ]},\\n\\n ], components: vec![]};\\n\\n\\n\\n println!(\\\"expectation: {:#?}\\\", expectation);\\n\\n println!(\\\"vs reality : {:#?}\\\", component::<(_, ErrorKind)>(sample_1));\\n\\n\\n\\n assert_eq!(\\n\\n component::<(_, ErrorKind)>(sample_1).unwrap().1,\\n\\n expectation);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 56,\n \"score\": 40459.65767560398\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_properties_from_rfc() {\\n\\n // TODO: newlines followed by spaces must be ignored\\n\\n assert_parser!(\\n\\n property,\\n\\n \\\"home.tel;type=fax,voice,msg:+49 3581 123456\\\\n\\\",\\n\\n Property {\\n\\n name: \\\"home.tel\\\".into(),\\n\\n val: \\\"+49 3581 123456\\\".into(),\\n\\n params: vec![Parameter ::new_ref(\\n\\n \\\"type\\\",\\n\\n Some(\\\"fax,voice,msg\\\"),\\n\\n )]\\n\\n }\\n\\n );\\n\\n // TODO: newlines followed by spaces must be ignored\\n\\n assert_parser!(\\n\\n property,\\n\\n \\\"email;internet:mb@goerlitz.de\\\\n\\\",\\n\\n Property {\\n\\n name: \\\"email\\\".into(),\\n\\n val: \\\"mb@goerlitz.de\\\".into(),\\n\\n params: vec![\\n\\n Parameter ::new_ref(\\n\\n \\\"internet\\\" ,\\n\\n None,\\n\\n )]\\n\\n }\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 57,\n \"score\": 39467.22005486949\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_empty_component1() {\\n\\n assert_eq!(\\n\\n component::<(_, ErrorKind)>(\\\"BEGIN:VEVENT\\\\nEND:VEVENT\\\\n\\\"),\\n\\n Ok((\\\"\\\", Component::new_empty(\\\"VEVENT\\\")))\\n\\n );\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 58,\n \"score\": 39467.22005486949\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_empty_component2() {\\n\\n assert_eq!(\\n\\n component::<(_, ErrorKind)>(\\\"BEGIN:VEVENT\\\\n\\\\nEND:VEVENT\\\\n\\\"),\\n\\n Ok((\\\"\\\", Component::new_empty(\\\"VEVENT\\\"))),\\n\\n \\\"empty component with empty line\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 59,\n \"score\": 39467.22005486949\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_property_with_colon() {\\n\\n\\n\\n let sample_0 = \\\"RELATED-TO;RELTYPE=:c605e4e8-8ea3-4315-b139-19394ab3ced6\\\\n\\\";\\n\\n // let sample_0 = \\\"RELATED-TO;RELTYPE:c605e4e8-8ea3-4315-b139-19394ab3ced6\\\\n\\\";\\n\\n\\n\\n let expectation = Property {\\n\\n name: \\\"RELATED-TO\\\".into(),\\n\\n val: \\\"c605e4e8-8ea3-4315-b139-19394ab3ced6\\\".into(),\\n\\n params: vec![Parameter {\\n\\n key: \\\"RELTYPE\\\".into(),\\n\\n val: None\\n\\n }]\\n\\n };\\n\\n\\n\\n assert_parser!(property, sample_0, expectation);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 60,\n \"score\": 39467.22005486949\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_property_with_breaks() {\\n\\n\\n\\n let sample_0 = \\\"DESCRIPTION:Hey, I'm gonna have a party\\\\\\\\n BYOB: Bring your own beer.\\\\\\\\n Hendrik\\\\\\\\n\\\\n\\\";\\n\\n\\n\\n let expectation = Property {\\n\\n name: \\\"DESCRIPTION\\\".into(),\\n\\n val: \\\"Hey, I'm gonna have a party\\\\\\\\n BYOB: Bring your own beer.\\\\\\\\n Hendrik\\\\\\\\n\\\".into(),\\n\\n params: vec![]\\n\\n };\\n\\n\\n\\n assert_parser!(property, sample_0, expectation);\\n\\n}\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 61,\n \"score\": 39467.22005486949\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_property_with_no_value() {\\n\\n\\n\\n let sample_0 = \\\"X-NO-VALUE\\\";\\n\\n\\n\\n let expectation = Property {\\n\\n name: \\\"X-NO-VALUE\\\".into(),\\n\\n val: \\\"\\\".into(),\\n\\n params: vec![]\\n\\n };\\n\\n\\n\\n assert_parser!(property, sample_0, expectation);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 62,\n \"score\": 39467.22005486949\n },\n {\n \"content\": \"#[test]\\n\\n#[rustfmt::skip]\\n\\nfn parse_empty_component_with_dash() {\\n\\n assert_eq!(\\n\\n component::<(_, ErrorKind)>(\\\"BEGIN:X-HOODIE-EVENT\\\\n\\\\nEND:X-HOODIE-EVENT\\\\n\\\"),\\n\\n Ok((\\\"\\\", Component::new_empty(\\\"X-HOODIE-EVENT\\\"))),\\n\\n \\\"empty component with empty line\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 63,\n \"score\": 38541.59419471619\n },\n {\n \"content\": \"use chrono::prelude::*;\\n\\nuse icalendar::{Calendar, Class, Component, Event, EventStatus, Todo};\\n\\nuse pretty_assertions::assert_eq;\\n\\n\\n\\nconst EXPECTED_CAL_CONTENT: &str = \\\"\\\\\\n\\nBEGIN:VCALENDAR\\\\r\\n\\nVERSION:2.0\\\\r\\n\\nPRODID:ICALENDAR-RS\\\\r\\n\\nCALSCALE:GREGORIAN\\\\r\\n\\nBEGIN:VEVENT\\\\r\\n\\nCLASS:CONFIDENTIAL\\\\r\\n\\nDESCRIPTION:Description\\\\r\\n\\nDTEND:20140709T091011Z\\\\r\\n\\nDTSTAMP:20190307T181159\\\\r\\n\\nDTSTART:20140708T071011Z\\\\r\\n\\nLOCATION:Somewhere\\\\r\\n\\nPRIORITY:10\\\\r\\n\\nSTATUS:TENTATIVE\\\\r\\n\\nSUMMARY:summary\\\\r\\n\\nUID:euid\\\\r\\n\",\n \"file_path\": \"tests/calendar.rs\",\n \"rank\": 64,\n \"score\": 33191.89054635784\n },\n {\n \"content\": \"#![cfg(feature = \\\"parser\\\")]\\n\\nuse icalendar::parser::unfold;\\n\\nuse pretty_assertions::assert_eq;\\n\\n\\n\\nconst SAMPLE: &str = \\\"\\\\\\n\\nBEGIN:VCALENDAR\\\\r\\n\\nVERSION:2.0\\\\r\\n\\nPRODID:ICALENDAR-RS\\\\r\\n\\nCALSCALE:GREGORIAN\\\\r\\n\\nBEGIN:VEVENT\\\\r\\n\\nCLASS:CONFIDENTIAL\\\\r\\n\\nDESCRIPTION:Description\\\\r\\n\\nDTEND:20140709T091011Z\\\\r\\n\\nDTSTAMP:20190307T181159\\\\r\\n\\nDTSTART:20140708T071011Z\\\\r\\n\\nLOCATION:Somewhere\\\\r\\n\\nPRIORITY:10\\\\r\\n\\nSTATUS:TENTATIVE\\\\r\\n\\nSUMMARY:summary\\\\r\\n\\nUID:euid\\\\r\\n\",\n \"file_path\": \"tests/reserialize.rs\",\n \"rank\": 65,\n \"score\": 33191.70425304848\n },\n {\n \"content\": \"END:VEVENT\\\\r\\n\\nBEGIN:VTODO\\\\r\\n\\nCOMPLETED:20140709T091011Z\\\\r\\n\\nDTSTAMP:20190307T181159\\\\r\\n\\nDUE:20140708T091011\\\\r\\n\\nPERCENT-COMPLETE:95\\\\r\\n\\nSUMMARY:A Todo\\\\r\\n\\nUID:todouid\\\\r\\n\\nEND:VTODO\\\\r\\n\\nEND:VCALENDAR\\\\r\\n\\n\\\";\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/calendar.rs\",\n \"rank\": 66,\n \"score\": 33189.3064737564\n },\n {\n \"content\": \" .percent_complete(95)\\n\\n .due(cest_date.naive_local())\\n\\n .completed(utc_date)\\n\\n .summary(\\\"A Todo\\\")\\n\\n .uid(\\\"todouid\\\")\\n\\n .add_property(\\\"DTSTAMP\\\", \\\"20190307T181159\\\")\\n\\n .done();\\n\\n calendar.push(todo);\\n\\n assert_eq!(calendar.to_string(), EXPECTED_CAL_CONTENT);\\n\\n}\\n\",\n \"file_path\": \"tests/calendar.rs\",\n \"rank\": 67,\n \"score\": 33189.10833154186\n },\n {\n \"content\": \"END:VEVENT\\\\r\\n\\nBEGIN:VTODO\\\\r\\n\\nCOMPLETED:20140709T091011Z\\\\r\\n\\nDTSTAMP:20190307T181159\\\\r\\n\\nDUE:20140708T091011\\\\r\\n\\nPERCENT-COMPLETE:95\\\\r\\n\\nSUMMARY:A Todo\\\\r\\n\\nUID:todouid\\\\r\\n\\nEND:VTODO\\\\r\\n\\nBEGIN:VALARM\\\\r\\n\\nTRIGGER;RELATED=END:-P2D\\\\r\\n\\nACTION:EMAIL\\\\r\\n\\nATTENDEE:mailto:john_doe@example.com\\\\r\\n\\nSUMMARY:*** REMINDER: SEND AGENDA FOR WEEKLY STAFF MEETING ***\\\\r\\n\\nDESCRIPTION:A draft agenda needs to be sent out to the attendees to the wee\\\\r\\n\\n kly managers meeting (MGR-LIST). Attached is a pointer the document templat\\\\r\\n\\n e for the agenda file.\\\\r\\n\\nATTACH;FMTTYPE=application/msword:http://example.com/templates/agenda.doc\\\\r\\n\\nEND:VALARM\\\\r\\n\\nEND:VCALENDAR\\\\r\\n\\n\\\";\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/reserialize.rs\",\n \"rank\": 68,\n \"score\": 33188.2729740766\n },\n {\n \"content\": \"use crate::parser::unfold;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/parser/tests.rs\",\n \"rank\": 73,\n \"score\": 31902.53379383006\n },\n {\n \"content\": \"#![cfg(feature = \\\"parser\\\")]\\n\\nuse chrono::{Duration, Utc};\\n\\nuse icalendar::{Calendar, Class, Component, Event};\\n\\nuse pretty_assertions::assert_eq;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/folding_consistency.rs\",\n \"rank\": 74,\n \"score\": 31902.41440077289\n },\n {\n \"content\": \"#![cfg(feature = \\\"parser\\\")]\\n\\nuse std::{\\n\\n env,\\n\\n ffi::OsStr,\\n\\n fs,\\n\\n path::{Path, PathBuf},\\n\\n};\\n\\n\\n\\nuse icalendar::parser::{read_calendar, unfold};\\n\\n\\n\",\n \"file_path\": \"tests/parse_fixtures.rs\",\n \"rank\": 75,\n \"score\": 31902.061280947655\n },\n {\n \"content\": \" let parsed_2 = serialized_2.parse::<Calendar>().unwrap();\\n\\n let serialized_3 = dbg!(parsed_2.to_string());\\n\\n\\n\\n let parsed_3 = serialized_3.parse::<Calendar>().unwrap();\\n\\n let serialized_4 = dbg!(parsed_3.to_string());\\n\\n\\n\\n assert_eq!(parsed_1, parsed_2);\\n\\n assert_eq!(parsed_2, parsed_3);\\n\\n\\n\\n assert_eq!(serialized_1, serialized_2);\\n\\n assert_eq!(serialized_2, serialized_3);\\n\\n assert_eq!(serialized_3, serialized_4);\\n\\n}\\n\",\n \"file_path\": \"tests/folding_consistency.rs\",\n \"rank\": 76,\n \"score\": 31898.81605303272\n },\n {\n \"content\": \" ExNyb290Y2EubmV0c2NhcGUuY29tMB4XDTk3MDYwNjE5NDc1OVoXDTk3MTIwMzE5NDc\\n\\n 1OVowgYkxCzAJBgNVBAYTAlVTMSYwJAYDVQQKEx1OZXRzY2FwZSBDb21tdW5pY2F0aW\\n\\n 9ucyBDb3JwLjEYMBYGA1UEAxMPVGltb3RoeSBBIEhvd2VzMSEwHwYJKoZIhvcNAQkBF\\n\\n hJob3dlc0BuZXRzY2FwZS5jb20xFTATBgoJkiaJk/IsZAEBEwVob3dlczBcMA0GCSqG\\n\\n SIb3DQEBAQUAA0sAMEgCQQC0JZf6wkg8pLMXHHCUvMfL5H6zjSk4vTTXZpYyrdN2dXc\\n\\n oX49LKiOmgeJSzoiFKHtLOIboyludF90CgqcxtwKnAgMBAAGjNjA0MBEGCWCGSAGG+E\\n\\n IBAQQEAwIAoDAfBgNVHSMEGDAWgBT84FToB/GV3jr3mcau+hUMbsQukjANBgkqhkiG9\\n\\n w0BAQQFAAOBgQBexv7o7mi3PLXadkmNP9LcIPmx93HGp0Kgyx1jIVMyNgsemeAwBM+M\\n\\n SlhMfcpbTrONwNjZYW8vJDSoi//yrZlVt9bJbs7MNYZVsyF1unsqaln4/vy6Uawfg8V\\n\\n UMk1U7jt8LYpo4YULU7UZHPYVUaSgVttImOHZIKi4hlPXBOhcUQ==\\n\\nend:vcard\\\"#;\\n\\n\\n\\n crate::parser::read_calendar(&unfold(example)).unwrap();\\n\\n}\\n\",\n \"file_path\": \"src/parser/tests.rs\",\n \"rank\": 77,\n \"score\": 31896.615078674873\n },\n {\n \"content\": \"use std::borrow::Cow;\\n\\n\\n\\n#[derive(Debug, Eq, Clone)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub struct ParseString<'a>(Cow<'a, str>);\\n\\n\\n\\nimpl ParseString<'_> {\\n\\n pub fn to_owned(&self) -> ParseString<'static> {\\n\\n match self.0 {\\n\\n Cow::Borrowed(s) => ParseString(Cow::Owned(s.to_owned())),\\n\\n Cow::Owned(ref s) => ParseString(Cow::Owned(s.clone())),\\n\\n }\\n\\n }\\n\\n pub fn into_owned(self) -> ParseString<'static> {\\n\\n match self.0 {\\n\\n Cow::Borrowed(s) => ParseString(Cow::Owned(s.to_owned())),\\n\\n Cow::Owned(s) => ParseString(Cow::Owned(s)),\\n\\n }\\n\\n }\\n\\n pub fn as_str(&self) -> &str {\\n\",\n \"file_path\": \"src/parser/parsed_string.rs\",\n \"rank\": 78,\n \"score\": 31315.719524483506\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl From<ParseString<'static>> for String {\\n\\n fn from(val: ParseString<'static>) -> Self {\\n\\n val.0.into_owned()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<String> for ParseString<'static> {\\n\\n fn from(s: String) -> Self {\\n\\n ParseString(Cow::Owned(s))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ToString for ParseString<'_> {\\n\\n fn to_string(&self) -> String {\\n\\n self.to_owned().into()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a str> for ParseString<'a> {\\n\\n fn from(s: &'a str) -> Self {\\n\\n ParseString(Cow::Borrowed(s))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser/parsed_string.rs\",\n \"rank\": 79,\n \"score\": 31306.45995478534\n },\n {\n \"content\": \" self.0.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialEq<Self> for ParseString<'_> {\\n\\n fn eq(&self, rhs: &Self) -> bool {\\n\\n self.as_ref() == rhs.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialEq<&str> for ParseString<'_> {\\n\\n fn eq(&self, rhs: &&str) -> bool {\\n\\n self.as_ref() == *rhs\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsRef<str> for ParseString<'_> {\\n\\n fn as_ref(&self) -> &str {\\n\\n self.0.as_ref()\\n\\n }\\n\",\n \"file_path\": \"src/parser/parsed_string.rs\",\n \"rank\": 80,\n \"score\": 31303.222590619338\n },\n {\n \"content\": \"};\\n\\n\\n\\n#[cfg(test)]\\n\\nuse nom::error::ErrorKind;\\n\\n\\n\\n/// Zero-copy version of [`crate::properties::Property`]\\n\\n#[derive(PartialEq, Debug, Clone)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub struct Property<'a> {\\n\\n pub name: ParseString<'a>,\\n\\n pub val: ParseString<'a>,\\n\\n pub params: Vec<Parameter<'a>>,\\n\\n}\\n\\n\\n\\nimpl<'a> Property<'a> {\\n\\n pub fn new_ref(key: &'a str, val: &'a str) -> Property<'a> {\\n\\n Property {\\n\\n name: key.into(),\\n\\n val: val.into(),\\n\\n params: vec![],\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 81,\n \"score\": 33.77398219060547\n },\n {\n \"content\": \"use std::{\\n\\n fmt::{self, Write},\\n\\n str::FromStr,\\n\\n};\\n\\n\\n\\nuse crate::{parser::utils::valid_key_sequence_cow, properties::fold_line};\\n\\n\\n\\nuse super::{\\n\\n parameters::{parameters, Parameter},\\n\\n parsed_string::ParseString,\\n\\n utils::property_key,\\n\\n};\\n\\nuse nom::{\\n\\n branch::alt,\\n\\n bytes::complete::{tag, take_until, take_while},\\n\\n character::complete::{line_ending, multispace0},\\n\\n combinator::{cut, map, opt},\\n\\n error::{context, convert_error, ContextError, ParseError, VerboseError},\\n\\n sequence::{preceded, separated_pair, tuple},\\n\\n Finish, IResult,\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 82,\n \"score\": 30.042678521203047\n },\n {\n \"content\": \"use std::{fmt, str::FromStr};\\n\\n\\n\\nuse chrono::Utc;\\n\\nuse nom::{\\n\\n branch::alt,\\n\\n bytes::complete::tag,\\n\\n combinator::{all_consuming, complete, cut, map},\\n\\n error::{context, convert_error, ContextError, ParseError, VerboseError},\\n\\n multi::{many0, many_till},\\n\\n Finish, IResult,\\n\\n};\\n\\n\\n\\n#[cfg(test)]\\n\\nuse nom::error::ErrorKind;\\n\\nuse uuid::Uuid;\\n\\n\\n\\n#[cfg(test)]\\n\\nuse super::parameters::Parameter;\\n\\nuse super::{\\n\\n parsed_string::ParseString,\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 83,\n \"score\": 28.09376442314006\n },\n {\n \"content\": \"use std::{\\n\\n collections::HashMap,\\n\\n fmt::{self, Write},\\n\\n mem,\\n\\n};\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq)]\\n\\n/// key-value pairs inside of `Property`s\\n\\npub struct Parameter {\\n\\n key: String,\\n\\n val: String,\\n\\n}\\n\\n\\n\\nimpl Parameter {\\n\\n /// Creates a new `Parameter`\\n\\n pub fn new(key: &str, val: &str) -> Self {\\n\\n Parameter {\\n\\n key: key.to_owned(),\\n\\n val: val.to_owned(),\\n\\n }\\n\",\n \"file_path\": \"src/properties.rs\",\n \"rank\": 84,\n \"score\": 27.552801079899233\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n//type EntryParameters = Vec<Parameter>;\\n\\npub type EntryParameters = HashMap<String, Parameter>;\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq)]\\n\\n/// key-value pairs inside of `Component`s\\n\\npub struct Property {\\n\\n pub(crate) key: String,\\n\\n pub(crate) val: String,\\n\\n pub(crate) params: EntryParameters,\\n\\n}\\n\\n\\n\\nimpl Property {\\n\\n /// Guess what this does :D\\n\\n pub fn new(key: &str, val: &str) -> Self {\\n\\n Property {\\n\\n key: key.to_owned(),\\n\\n val: val.replace('\\\\n', \\\"\\\\\\\\n\\\"),\\n\",\n \"file_path\": \"src/properties.rs\",\n \"rank\": 85,\n \"score\": 25.495796379814596\n },\n {\n \"content\": \" params: HashMap::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Clones the key field.\\n\\n pub fn key(&self) -> &str {\\n\\n &self.key\\n\\n }\\n\\n\\n\\n /// Clones the key field.\\n\\n pub fn value(&self) -> &str {\\n\\n &self.val\\n\\n }\\n\\n\\n\\n /// Appends a new parameter.\\n\\n pub fn append_parameter<I: Into<Parameter>>(&mut self, into_parameter: I) -> &mut Self {\\n\\n let parameter = into_parameter.into();\\n\\n self.params.insert(parameter.key.clone(), parameter);\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"src/properties.rs\",\n \"rank\": 86,\n \"score\": 23.812485358070944\n },\n {\n \"content\": \"//! It may contain multiple root elements so we have a `Vec<Component>` and each `Component` may more child `Component`s.\\n\\n//! Each [`Component`] has properties, so a [`Vec`] of [`Property`] and those have of [`Parameter`]s.\\n\\n//!\\n\\n//!\\n\\n#![allow(missing_docs)]\\n\\nuse nom::{error::convert_error, error::VerboseError, Finish};\\n\\n\\n\\nmod calendar;\\n\\npub(crate) mod components;\\n\\nmod parameters;\\n\\nmod parsed_string;\\n\\nmod properties;\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\\nmod utils;\\n\\n\\n\\npub use calendar::Calendar;\\n\\npub use components::Component;\\n\\npub use parameters::Parameter;\\n\\npub use properties::Property;\\n\\n\\n\\nuse components::*;\\n\\n\\n\\npub use utils::unfold;\\n\\n\\n\\n/// Parse iCalendar file content into an array of [`Component`]s\\n\\n///\\n\\n/// This version produces very simple Errors for simplicity's sake.\\n\",\n \"file_path\": \"src/parser/mod.rs\",\n \"rank\": 87,\n \"score\": 21.677382550729764\n },\n {\n \"content\": \"\\n\\n /// Creates and appends a parameter.\\n\\n pub fn add_parameter(&mut self, key: &str, val: &str) -> &mut Self {\\n\\n self.append_parameter(Parameter::new(key, val));\\n\\n self\\n\\n }\\n\\n\\n\\n /// End of Builder Pattern.\\n\\n pub fn done(&mut self) -> Self {\\n\\n Property {\\n\\n key: mem::take(&mut self.key),\\n\\n val: mem::take(&mut self.val),\\n\\n params: mem::take(&mut self.params),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Writes this Property to `out`\\n\\n pub(crate) fn fmt_write<W: Write>(&self, out: &mut W) -> Result<(), fmt::Error> {\\n\\n // A nice starting capacity for the majority of content lines\\n\\n let mut line = String::with_capacity(150);\\n\",\n \"file_path\": \"src/properties.rs\",\n \"rank\": 88,\n \"score\": 20.07348349527464\n },\n {\n \"content\": \" fn properties(&self) -> &[Property<'a>] {\\n\\n &self.properties\\n\\n }\\n\\n\\n\\n fn components(&self) -> &[Component<'a>] {\\n\\n &self.components\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> TryFrom<&'a str> for Component<'a> {\\n\\n type Error = String;\\n\\n\\n\\n fn try_from(input: &'a str) -> Result<Self, Self::Error> {\\n\\n component(input)\\n\\n .finish()\\n\\n .map(|(_, x)| x)\\n\\n .map_err(|e: VerboseError<&str>| format!(\\\"error: {}\\\", convert_error(input, e.clone())))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 89,\n \"score\": 19.9821171915937\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Property<'_> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n self.fmt_write(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> TryFrom<&'a str> for Property<'a> {\\n\\n type Error = String;\\n\\n\\n\\n fn try_from(input: &'a str) -> Result<Self, Self::Error> {\\n\\n property(input)\\n\\n .finish()\\n\\n .map(|(_, x)| x)\\n\\n .map_err(|e: VerboseError<&str>| format!(\\\"error: {}\\\", convert_error(input, e.clone())))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 90,\n \"score\": 19.234116260684427\n },\n {\n \"content\": \" properties::property,\\n\\n unfold,\\n\\n utils::{line, line_separated, valid_key_sequence_cow},\\n\\n Property,\\n\\n};\\n\\n\\n\\n#[cfg(test)]\\n\\nuse pretty_assertions::assert_eq;\\n\\n\\n\\nuse crate::{\\n\\n calendar::CalendarComponent,\\n\\n components::{InnerComponent, Other},\\n\\n CalendarDateTime,\\n\\n};\\n\\n\\n\\n/// The parsing equivalent of [`crate::components::Component`]\\n\\n#[derive(PartialEq, Debug, Clone)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub struct Component<'a> {\\n\\n pub name: ParseString<'a>,\\n\",\n \"file_path\": \"src/parser/components.rs\",\n \"rank\": 91,\n \"score\": 19.08684332058164\n },\n {\n \"content\": \"use crate::calendar::CalendarComponent;\\n\\n\\n\\nuse super::{components::LikeComponent, read_calendar, unfold, Component, Property};\\n\\nuse core::{fmt, str::FromStr};\\n\\n\\n\\n/// Helpertype for reserialization\\n\\n#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub struct Calendar<'a> {\\n\\n pub properties: Vec<Property<'a>>,\\n\\n pub components: Vec<Component<'a>>,\\n\\n}\\n\\n\\n\\nimpl Calendar<'_> {\\n\\n /// Prints to stdout\\n\\n pub fn print(&self) -> Result<(), fmt::Error> {\\n\\n print_crlf!(\\\"{}\\\", self);\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser/calendar.rs\",\n \"rank\": 92,\n \"score\": 19.074708137189596\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Property<'_> {\\n\\n pub(crate) fn fmt_write<W: Write>(&self, out: &mut W) -> Result<(), fmt::Error> {\\n\\n // A nice starting capacity for the majority of content lines\\n\\n let mut line = String::with_capacity(150);\\n\\n\\n\\n write!(line, \\\"{}\\\", self.name.as_str())?;\\n\\n for &Parameter { ref key, ref val } in &self.params {\\n\\n if let Some(val) = val {\\n\\n write!(line, \\\";{}={}\\\", key.as_str(), val.as_str())?;\\n\\n } else {\\n\\n write!(line, \\\";{}\\\", key.as_str())?;\\n\\n }\\n\\n }\\n\\n write!(line, \\\":{}\\\", self.val.as_str())?;\\n\\n write_crlf!(out, \\\"{}\\\", fold_line(&line))?;\\n\\n Ok(())\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 93,\n \"score\": 19.05112028744996\n },\n {\n \"content\": \"use nom::{\\n\\n bytes::complete::{tag_no_case, take_while},\\n\\n character::complete::line_ending,\\n\\n combinator::{complete, map},\\n\\n error::{ContextError, ParseError},\\n\\n multi::many0,\\n\\n sequence::{delimited, preceded},\\n\\n Err, IResult, Parser,\\n\\n};\\n\\n#[cfg(test)]\\n\\nuse pretty_assertions::assert_eq;\\n\\n\\n\\nuse super::parsed_string::ParseString;\\n\\n\\n\\n// TODO: how do I express <<alpha_or_dash, but not \\\"END\\\">>\\n\",\n \"file_path\": \"src/parser/utils.rs\",\n \"rank\": 94,\n \"score\": 18.816321710751218\n },\n {\n \"content\": \" map(\\n\\n alt((\\n\\n take_until(\\\"\\\\r\\\\n\\\"),\\n\\n take_until(\\\"\\\\n\\\"),\\n\\n // this is for single line prop parsing, just so I can leave off the '\\\\n'\\n\\n take_while(|_| true),\\n\\n )),\\n\\n ParseString::from,\\n\\n ),\\n\\n ), // val TODO: replace this with something simpler!\\n\\n ),\\n\\n context(\\n\\n \\\"no-value property\\\",\\n\\n map(valid_key_sequence_cow, |key| {\\n\\n ((key, vec![]), ParseString::from(\\\"\\\"))\\n\\n }), // key and nothing else\\n\\n ),\\n\\n )),\\n\\n opt(line_ending),\\n\\n )),\\n\\n |(((key, params), val), _)| Property {\\n\\n name: key,\\n\\n val,\\n\\n params,\\n\\n },\\n\\n )),\\n\\n )(input)\\n\\n}\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 95,\n \"score\": 18.1004013482644\n },\n {\n \"content\": \"impl From<Property<'_>> for crate::Property {\\n\\n fn from(parsed: Property<'_>) -> Self {\\n\\n Self {\\n\\n key: parsed.name.as_ref().to_owned(),\\n\\n val: parsed.val.as_ref().to_owned(),\\n\\n params: parsed\\n\\n .params\\n\\n .into_iter()\\n\\n .map(|p| (p.key.as_ref().to_owned(), p.into()))\\n\\n .collect(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromStr for crate::Property {\\n\\n type Err = String;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n Ok(crate::parser::Property::try_from(s)?.into())\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/parser/properties.rs\",\n \"rank\": 96,\n \"score\": 16.267549597246376\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\n#[derive(Debug, Default, PartialEq, Eq)]\\n\\npub struct Other {\\n\\n name: String,\\n\\n inner: InnerComponent,\\n\\n}\\n\\n\\n\\nimpl Component for Other {\\n\\n /// Tells you what kind of `Component` this is\\n\\n ///\\n\\n /// Might be `VEVENT`, `VTODO`, `VALARM` etc\\n\\n fn component_kind(&self) -> String {\\n\\n self.name.clone()\\n\\n }\\n\\n\\n\\n /// Read-only access to `properties`\\n\\n fn properties(&self) -> &BTreeMap<String, Property> {\\n\\n &self.inner.properties\\n\\n }\\n\",\n \"file_path\": \"src/components/other.rs\",\n \"rank\": 97,\n \"score\": 15.039396333070968\n },\n {\n \"content\": \"\\n\\n write!(line, \\\"{}\\\", self.key)?;\\n\\n for &Parameter {\\n\\n ref key,\\n\\n val: ref value,\\n\\n } in self.params.values()\\n\\n {\\n\\n write!(line, \\\";{}={}\\\", key, value)?;\\n\\n }\\n\\n write!(line, \\\":{}\\\", self.val)?;\\n\\n write_crlf!(out, \\\"{}\\\", fold_line(&line))?;\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n/// This property defines the access classification for a calendar component.\\n\\n/// <https://datatracker.ietf.org/doc/html/rfc5545#section-3.8.1.3>\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub enum Class {\\n\\n /// [`Public`](https://datatracker.ietf.org/doc/html/rfc5545#section-3.8.1.3)\\n\",\n \"file_path\": \"src/properties.rs\",\n \"rank\": 98,\n \"score\": 14.803362754423523\n },\n {\n \"content\": \" InProcess,\\n\\n /// Indicates to-do was cancelled.\\n\\n Cancelled,\\n\\n //Custom(&str)\\n\\n}\\n\\n\\n\\n//pub enum JournalStatuw{\\n\\n// Draft,\\n\\n// Final,\\n\\n// Cancelled,\\n\\n// Custom(&str)\\n\\n//}\\n\\n\\n\\nimpl From<EventStatus> for Property {\\n\\n fn from(val: EventStatus) -> Self {\\n\\n Property {\\n\\n key: String::from(\\\"STATUS\\\"),\\n\\n val: String::from(match val {\\n\\n EventStatus::Tentative => \\\"TENTATIVE\\\",\\n\\n EventStatus::Confirmed => \\\"CONFIRMED\\\",\\n\",\n \"file_path\": \"src/properties.rs\",\n \"rank\": 99,\n \"score\": 14.642974194208033\n }\n]","isConversational":false}}},{"rowIdx":3696,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"crates/noirc_frontend/src/hir/type_check/mod.rs"},"repo_name":{"kind":"string","value":"guipublic/noir"},"commit":{"kind":"string","value":"f581f68795c8c4fa04daece8e0461211c4fab417"},"file_code":{"kind":"string","value":"mod errors;\nmod expr;\nmod stmt;\n\nuse errors::TypeCheckError;\nuse expr::type_check_expression;\n\nuse crate::node_interner::{FuncId, NodeInterner};\n\npub fn type_check_func(interner: &mut NodeInterner, func_id: FuncId) -> Result<(), TypeCheckError> {\n \n \n \n let meta = interner.function_meta(&func_id);\n let declared_return_type = &meta.return_type;\n let can_ignore_ret = meta.can_ignore_return_type();\n\n for param in meta.parameters.into_iter() {\n interner.push_ident_type(¶m.0, param.1);\n }\n\n \n let hir_func = interner.function(&func_id);\n let func_as_expr = hir_func.as_expr();\n\n \n type_check_expression(interner, func_as_expr)?;\n\n \n let function_last_type = interner.id_type(func_as_expr);\n\n if !can_ignore_ret && (&function_last_type != declared_return_type) {\n let func_span = interner.id_span(func_as_expr); \n return Err(TypeCheckError::TypeMismatch {\n expected_typ: declared_return_type.to_string(),\n expr_typ: function_last_type.to_string(),\n expr_span: func_span,\n });\n }\n\n \n if declared_return_type.is_public() {\n return Err(TypeCheckError::PublicReturnType {\n typ: declared_return_type.clone(),\n span: interner.id_span(func_as_expr),\n });\n }\n\n Ok(())\n}\n\n#[cfg(test)]\nmod test {\n use std::collections::HashMap;\n\n use noirc_errors::{Span, Spanned};\n\n use crate::hir_def::{\n expr::{\n HirBinaryOp, HirBinaryOpKind, HirBlockExpression, HirExpression, HirInfixExpression,\n },\n function::{FuncMeta, HirFunction, Param},\n stmt::{HirPrivateStatement, HirStatement},\n };\n use crate::node_interner::{FuncId, NodeInterner};\n use crate::{graph::CrateId, Ident};\n use crate::{\n hir::{\n def_map::{CrateDefMap, ModuleDefId},\n resolution::{path_resolver::PathResolver, resolver::Resolver},\n },\n FunctionKind, Parser, Path, Type,\n };\n\n #[test]\n fn basic_priv() {\n let mut interner = NodeInterner::default();\n\n \n \n \n \n let x_id = interner.push_ident(Spanned::from(Span::default(), String::from(\"x\")).into());\n interner.linked_ident_to_def(x_id, x_id);\n \n let y_id = interner.push_ident(Spanned::from(Span::default(), String::from(\"y\")).into());\n interner.linked_ident_to_def(y_id, y_id);\n \n let z_id = interner.push_ident(Spanned::from(Span::default(), String::from(\"z\")).into());\n interner.linked_ident_to_def(z_id, z_id);\n\n \n let x_expr_id = interner.push_expr(HirExpression::Ident(x_id));\n let y_expr_id = interner.push_expr(HirExpression::Ident(y_id));\n\n \n let operator = HirBinaryOp {\n span: Span::default(),\n kind: HirBinaryOpKind::Add,\n };\n let expr = HirInfixExpression {\n lhs: x_expr_id,\n operator,\n rhs: y_expr_id,\n };\n let expr_id = interner.push_expr(HirExpression::Infix(expr));\n\n \n let priv_stmt = HirPrivateStatement {\n identifier: z_id,\n r#type: crate::Type::Unspecified,\n expression: expr_id,\n };\n let stmt_id = interner.push_stmt(HirStatement::Private(priv_stmt));\n\n let expr_id = interner.push_expr(HirExpression::Block(HirBlockExpression(vec![stmt_id])));\n\n \n let func = HirFunction::unsafe_from_expr(expr_id);\n let func_id = interner.push_fn(func);\n\n \n let func_meta = FuncMeta {\n name: String::from(\"test_func\"),\n kind: FunctionKind::Normal,\n attributes: None,\n parameters: vec![Param(x_id, Type::WITNESS), Param(y_id, Type::WITNESS)].into(),\n return_type: Type::Unit,\n has_body: true,\n };\n interner.push_fn_meta(func_meta, func_id);\n\n super::type_check_func(&mut interner, func_id).unwrap();\n }\n #[test]\n fn basic_priv_simplified() {\n let src = r#\"\n\n fn main(x : Field) {\n priv k = x;\n priv _z = x + k;\n }\n\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\")]);\n }\n #[test]\n #[should_panic]\n fn basic_let_stmt() {\n let src = r#\"\n fn main(x : Field) {\n let k = [x,x];\n priv _z = x + k;\n }\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\")]);\n }\n #[test]\n fn basic_index_expr() {\n let src = r#\"\n fn main(x : Field) {\n let k = [x,x];\n priv _z = x + k[0];\n }\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\")]);\n }\n #[test]\n fn basic_call_expr() {\n let src = r#\"\n fn main(x : Field) {\n priv _z = x + foo(x);\n }\n\n fn foo(x : Field) -> Field {\n x\n }\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\"), String::from(\"foo\")]);\n }\n #[test]\n fn basic_for_expr() {\n let src = r#\"\n fn main(_x : Field) {\n let _j = for _i in 0..10 {\n for _k in 0..100 {\n\n }\n };\n }\n\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\"), String::from(\"foo\")]);\n }\n\n \n struct TestPathResolver(HashMap<String, ModuleDefId>);\n\n impl PathResolver for TestPathResolver {\n fn resolve(\n &self,\n _def_maps: &HashMap<CrateId, CrateDefMap>,\n path: Path,\n ) -> Result<Option<ModuleDefId>, Ident> {\n \n let name = path.segments.last().unwrap();\n let mod_def = self.0.get(&name.0.contents).cloned();\n match mod_def {\n None => Err(name.clone()),\n Some(_) => Ok(mod_def),\n }\n }\n }\n\n impl TestPathResolver {\n pub fn insert_func(&mut self, name: String, func_id: FuncId) {\n self.0.insert(name, func_id.into());\n }\n }\n\n \n \n fn type_check_src_code(src: &str, func_namespace: Vec<String>) {\n let mut parser = Parser::from_src(src);\n let program = parser.parse_program().unwrap();\n let mut interner = NodeInterner::default();\n\n let mut func_ids = Vec::new();\n for _ in 0..func_namespace.len() {\n func_ids.push(interner.push_fn(HirFunction::empty()));\n }\n\n let mut path_resolver = TestPathResolver(HashMap::new());\n for (name, id) in func_namespace.into_iter().zip(func_ids.clone()) {\n path_resolver.insert_func(name, id);\n }\n\n let def_maps: HashMap<CrateId, CrateDefMap> = HashMap::new();\n\n let func_meta: Vec<_> = program\n .functions\n .into_iter()\n .map(|nf| {\n let resolver = Resolver::new(&mut interner, &path_resolver, &def_maps);\n resolver.resolve_function(nf).unwrap()\n })\n .collect();\n\n for ((hir_func, meta), func_id) in func_meta.into_iter().zip(func_ids.clone()) {\n interner.update_fn(func_id, hir_func);\n interner.push_fn_meta(meta, func_id)\n }\n\n \n super::type_check_func(&mut interner, func_ids.first().cloned().unwrap()).unwrap();\n }\n}\n"},"prefix":{"kind":"string","value":"mod errors;\nmod expr;\nmod stmt;\n\nuse errors::TypeCheckError;\nuse expr::type_check_expression;\n\nuse crate::node_interner::{FuncId, NodeInterner};\n\npub fn type_check_func(interner: &mut NodeInterner, func_id: FuncId) -> Result<(), TypeCheckError> {\n \n \n \n let meta = interner.function_meta(&func_id);\n let declared_return_type = &meta.return_type;\n let can_ignore_ret = meta.can_ignore_return_type();\n\n for param in meta.parameters.into_iter() {\n interner.push_ident_type(¶m.0, param.1);\n }\n\n \n let hir_func = interner.function(&func_id);\n let func_as_expr = hir_func.as_expr();\n\n \n type_check_expression(interner, func_as_expr)?;\n\n \n let function_last_type = interner.id_type(func_as_expr);\n\n if !can_ignore_ret && (&function_last_type != declared_return_type) {\n let func_span = interner.id_span(func_as_expr); \n return Err(TypeCheckError::TypeMismatch {\n expected_typ: declared_return_type.to_string(),\n expr_typ: function_last_type.to_string(),\n expr_span: func_span,\n });\n }\n\n \n if declared_return_type.is_public() {\n return Err(TypeCheckError::PublicReturnType {\n typ: declared_return_type.clone(),\n span: interner.id_span(func_as_expr),\n });\n }\n\n Ok(())\n}\n\n#[cfg(test)]\nmod test {\n use std::collections::HashMap;\n\n use noirc_errors::{Span, Spanned};\n\n use crate::hir_def::{\n expr::{\n HirBinaryOp, HirBinaryOpKind, HirBlockExpression, HirExpression, HirInfixExpression,\n },\n function::{FuncMeta, HirFunction, Param},\n stmt::{HirPrivateStatement, HirStatement},\n };\n use crate::node_interner::{FuncId, NodeInterner};\n use crate::{graph::CrateId, Ident};\n use crate::{\n hir::{\n def_map::{CrateDefMap, ModuleDefId},\n resolution::{path_resolver::PathResolver, resolver::Resolver},\n },\n FunctionKind, Parser, Path, Type,\n };\n\n #[test]\n fn basic_priv() {\n let mut interner = NodeInterner::default();\n\n \n \n \n \n let x_id = interner.push_ident(Spanned::from(Span::default(), String::from(\"x\")).into());\n interner.linked_ident_to_def(x_id, x_id);\n \n let y_id = interner.push_ident(Spanned::from(Span::default(), String::from(\"y\")).into());\n interner.linked_ident_to_def(y_id, y_id);\n \n let z_id = interner.push_ident(Spanned::from(Span::default(), String::from(\"z\")).into());\n interner.linked_ident_to_def(z_id, z_id);\n\n \n let x_expr_id = interner.push_expr(HirExpression::Ident(x_id));\n let y_expr_id = interner.push_expr(HirExpression::Ident(y_id));\n\n \n let operator = HirBinaryOp {\n span: Span::default(),\n kind: HirBinaryOpKind::Add,\n };\n let expr = HirInfixExpression {\n lhs: x_expr_id,\n operator,\n rhs: y_expr_id,\n };\n let expr_id = interner.push_expr(HirExpression::Infix(expr));\n\n \n let priv_stmt = HirPrivateStatement {\n identifier: z_id,\n r#type: crate::Type::Unspecified,\n expression: expr_id,\n };\n let stmt_id = interner.push_stmt(HirStatement::Private(priv_stmt));\n\n let expr_id = interner.push_expr(HirExpression::Block(HirBlockExpression(vec![stmt_id])));\n\n \n let func = HirFunction::unsafe_from_expr(expr_id);\n let func_id = interner.push_fn(func);\n\n \n let func_meta = FuncMeta {\n name: String::from(\"test_func\"),\n kind: FunctionKind::Normal,\n attributes: None,\n parameters: vec![Param(x_id, Type::WITNESS), Param(y_id, Type::WITNESS)].into(),\n return_type: Type::Unit,\n has_body: true,\n };\n interner.push_fn_meta(func_meta, func_id);\n\n super::type_check_func(&mut interner, func_id).unwrap();\n }\n #[test]\n fn basic_priv_simplified() {\n let src = r#\"\n\n fn main(x : Field) {\n priv k = x;\n priv _z = x + k;\n }\n\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\")]);\n }\n #[test]\n #[should_panic]\n fn basic_let_stmt() {\n let src = r#\"\n fn main(x : Field) {\n let k = [x,x];\n priv _z = x + k;\n }\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\")]);\n }\n #[test]\n "},"suffix":{"kind":"string","value":"\n #[test]\n fn basic_call_expr() {\n let src = r#\"\n fn main(x : Field) {\n priv _z = x + foo(x);\n }\n\n fn foo(x : Field) -> Field {\n x\n }\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\"), String::from(\"foo\")]);\n }\n #[test]\n fn basic_for_expr() {\n let src = r#\"\n fn main(_x : Field) {\n let _j = for _i in 0..10 {\n for _k in 0..100 {\n\n }\n };\n }\n\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\"), String::from(\"foo\")]);\n }\n\n \n struct TestPathResolver(HashMap<String, ModuleDefId>);\n\n impl PathResolver for TestPathResolver {\n fn resolve(\n &self,\n _def_maps: &HashMap<CrateId, CrateDefMap>,\n path: Path,\n ) -> Result<Option<ModuleDefId>, Ident> {\n \n let name = path.segments.last().unwrap();\n let mod_def = self.0.get(&name.0.contents).cloned();\n match mod_def {\n None => Err(name.clone()),\n Some(_) => Ok(mod_def),\n }\n }\n }\n\n impl TestPathResolver {\n pub fn insert_func(&mut self, name: String, func_id: FuncId) {\n self.0.insert(name, func_id.into());\n }\n }\n\n \n \n fn type_check_src_code(src: &str, func_namespace: Vec<String>) {\n let mut parser = Parser::from_src(src);\n let program = parser.parse_program().unwrap();\n let mut interner = NodeInterner::default();\n\n let mut func_ids = Vec::new();\n for _ in 0..func_namespace.len() {\n func_ids.push(interner.push_fn(HirFunction::empty()));\n }\n\n let mut path_resolver = TestPathResolver(HashMap::new());\n for (name, id) in func_namespace.into_iter().zip(func_ids.clone()) {\n path_resolver.insert_func(name, id);\n }\n\n let def_maps: HashMap<CrateId, CrateDefMap> = HashMap::new();\n\n let func_meta: Vec<_> = program\n .functions\n .into_iter()\n .map(|nf| {\n let resolver = Resolver::new(&mut interner, &path_resolver, &def_maps);\n resolver.resolve_function(nf).unwrap()\n })\n .collect();\n\n for ((hir_func, meta), func_id) in func_meta.into_iter().zip(func_ids.clone()) {\n interner.update_fn(func_id, hir_func);\n interner.push_fn_meta(meta, func_id)\n }\n\n \n super::type_check_func(&mut interner, func_ids.first().cloned().unwrap()).unwrap();\n }\n}\n"},"middle":{"kind":"string","value":"fn basic_index_expr() {\n let src = r#\"\n fn main(x : Field) {\n let k = [x,x];\n priv _z = x + k[0];\n }\n \"#;\n\n type_check_src_code(src, vec![String::from(\"main\")]);\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"fn parse_let_statement(parser: &mut Parser) -> Result<LetStatement, ParserErrorKind> {\n\n let generic_stmt = parse_generic_decl_statement(parser)?;\n\n\n\n let stmt = LetStatement {\n\n identifier: generic_stmt.identifier,\n\n r#type: generic_stmt.typ.unwrap_or(Type::Unspecified), //XXX: Haven't implemented this yet for general structs, we only parse arrays using this\n\n expression: generic_stmt.rhs,\n\n };\n\n Ok(stmt)\n\n}\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/declaration.rs","rank":1,"score":401384.08124396164},{"content":"/// Creates a new witness and constrains it to be the inverse of the polynomial passed in\n\npub fn invert(x: Object, evaluator: &mut Evaluator) -> Result<Object, RuntimeErrorKind> {\n\n // Create a fresh witness\n\n\n\n let inverse_witness = evaluator.add_witness_to_cs();\n\n let inverse_obj = Object::from_witness(inverse_witness);\n\n\n\n // Multiply inverse by original value\n\n let should_be_one = handle_mul_op(x, inverse_obj.clone(), evaluator)?;\n\n\n\n // Constrain x * x_inv = 1\n\n let _ = handle_equal_op(\n\n should_be_one,\n\n Object::Constants(FieldElement::one()),\n\n evaluator,\n\n );\n\n\n\n // Return inverse\n\n Ok(inverse_obj)\n\n}\n\n\n","file_path":"crates/noirc_evaluator/src/binary_op/mod.rs","rank":2,"score":371157.1337014666},{"content":"fn parse_const_statement(parser: &mut Parser) -> Result<ConstStatement, ParserErrorKind> {\n\n let generic_stmt = parse_generic_decl_statement(parser)?;\n\n\n\n // Note: If a Type is supplied for some reason in a const statement, it can only be a Field element/Constant\n\n let mut default_type = Type::CONSTANT;\n\n if let Some(declared_type) = generic_stmt.typ {\n\n if !declared_type.is_constant() {\n\n let message = format!(\"Const statements can only have constant type, you supplied a {:?}. Suggestion: Remove the type and the compiler will default to Constant \",declared_type);\n\n return Err(ParserErrorKind::UnstructuredError {\n\n message,\n\n span: Span::default(),\n\n }); // XXX: We don't have spanning for types yet\n\n } else {\n\n default_type = declared_type;\n\n }\n\n }\n\n\n\n let stmt = ConstStatement {\n\n identifier: generic_stmt.identifier,\n\n r#type: default_type,\n\n expression: generic_stmt.rhs,\n\n };\n\n Ok(stmt)\n\n}\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/declaration.rs","rank":3,"score":353920.0604178479},{"content":"fn parse_private_statement(parser: &mut Parser) -> Result<PrivateStatement, ParserErrorKind> {\n\n let generic_stmt = parse_generic_decl_statement(parser)?;\n\n\n\n // XXX: As of FieldElement refactor, we can catch basic type errors for private statements,\n\n // similar to the code for pub and const.\n\n //\n\n // This change may wait until, it is decided whether `let` will be the only declaration keyword.\n\n\n\n let stmt = PrivateStatement {\n\n identifier: generic_stmt.identifier,\n\n r#type: generic_stmt.typ.unwrap_or(Type::Unspecified),\n\n expression: generic_stmt.rhs,\n\n };\n\n Ok(stmt)\n\n}\n\n\n\n//XXX: Maybe do a second pass for invalid?\n\n#[cfg(test)]\n\nmod test {\n\n use crate::{parser::test_parse, token::Token};\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/declaration.rs","rank":4,"score":353920.0604178478},{"content":"fn extract_ret_type(interner: &NodeInterner, stmt_id: &StmtId) -> Type {\n\n let stmt = interner.statement(stmt_id);\n\n match stmt {\n\n HirStatement::Let(_)\n\n | HirStatement::Const(_)\n\n | HirStatement::Private(_)\n\n // We could fetch the type here also for Semi\n\n // It would return Unit, as we modify the\n\n // return type in the interner after type checking it\n\n | HirStatement::Semi(_)\n\n | HirStatement::Assign(_)\n\n | HirStatement::Constrain(_) => Type::Unit,\n\n HirStatement::Expression(expr_id) => interner.id_type(&expr_id),\n\n }\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/type_check/expr.rs","rank":5,"score":347470.3434948877},{"content":"fn token_to_binary_op(spanned_tok: &SpannedToken) -> Result<BinaryOp, ParserErrorKind> {\n\n let bin_op_kind: Option<BinaryOpKind> = spanned_tok.token().into();\n\n let bin_op_kind = bin_op_kind.ok_or(ParserErrorKind::TokenNotBinaryOp {\n\n spanned_token: spanned_tok.clone(),\n\n })?;\n\n Ok(Spanned::from(spanned_tok.to_span(), bin_op_kind))\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n\n\n use crate::parser::{dummy_expr, test_parse};\n\n\n\n use super::BinaryParser;\n\n\n\n #[test]\n\n fn valid_syntax() {\n\n let vectors = vec![\" + 6\", \" - k\", \" + (x + a)\", \" * (x + a) + (x - 4)\"];\n\n\n\n for src in vectors {\n","file_path":"crates/noirc_frontend/src/parser/infix_parser/binary.rs","rank":6,"score":304773.0440491843},{"content":"// Why is this here?\n\n// To avoid collecting after using the predicate method.\n\n// It allows the caller to filter or map further without paying the cost of a vector collect\n\n// The complexity is hidden in this method, as the caller will simply call .map() or an iterator method\n\n// to do further processing\n\n// I also note that the unreadability in my opinion, seems to come from the fact that we are using generics and lifetimes in PredicateResult\n\ntype Predicate<K, V> = fn(&(&K, &V)) -> bool;\n","file_path":"crates/noirc_frontend/src/hir/scope/mod.rs","rank":7,"score":304583.9372524378},{"content":"// This is exposed so that we can run the examples and verify that they pass\n\npub fn build_from_path<P: AsRef<Path>>(p: P) -> Result<(), CliError> {\n\n let mut driver = Resolver::resolve_root_config(p.as_ref())?;\n\n driver.build();\n\n // XXX: We can have a --overwrite flag to determine if you want to overwrite the Prover/Verifier.toml files\n\n if let Some(x) = driver.compute_abi() {\n\n // XXX: The root config should return an enum to determine if we are looking for .json or .toml\n\n // For now it is hard-coded to be toml.\n\n //\n\n // Check for input.toml and verifier.toml\n\n let path_to_root = PathBuf::from(p.as_ref());\n\n let path_to_prover_input = path_to_root.join(format!(\"{}.toml\", PROVER_INPUT_FILE));\n\n let path_to_verifier_input = path_to_root.join(format!(\"{}.toml\", VERIFIER_INPUT_FILE));\n\n\n\n // If they are not available, then create them and\n\n // populate them based on the ABI\n\n if !path_to_prover_input.exists() {\n\n let toml = toml::to_string(&x).unwrap();\n\n write_to_file(toml.as_bytes(), &path_to_prover_input);\n\n }\n\n if !path_to_verifier_input.exists() {\n","file_path":"crates/nargo/src/cli/build_cmd.rs","rank":8,"score":301482.0405697531},{"content":"/// Parses a Nargo.toml file from it's path\n\n/// The path to the toml file must be present.\n\n/// Calling this function without this guarantee is an ICE.\n\npub fn parse<P: AsRef<Path>>(path_to_toml: P) -> Result<Config, CliError> {\n\n let toml_as_string =\n\n std::fs::read_to_string(&path_to_toml).expect(\"ice: path given for toml file is invalid\");\n\n\n\n match parse_toml_str(&toml_as_string) {\n\n Ok(cfg) => Ok(cfg),\n\n Err(msg) => {\n\n let path = path_to_toml.as_ref();\n\n Err(CliError::Generic(format!(\n\n \"{}\\n Location: {}\",\n\n msg,\n\n path.display()\n\n )))\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/nargo/src/toml.rs","rank":9,"score":297799.770443591},{"content":"fn lib_or_bin(current_path: &Path) -> Result<(PathBuf, CrateType), CliError> {\n\n // A library has a lib.nr and a binary has a main.nr\n\n // You cannot have both.\n\n let src_path = match fm::find_dir(current_path, \"src\") {\n\n Some(path) => path,\n\n None => {\n\n return Err(CliError::Generic(format!(\n\n \"cannot find src file in path {}\",\n\n current_path.display()\n\n )))\n\n }\n\n };\n\n let lib_nr_path = fm::find_file(&src_path, \"lib\", \"nr\");\n\n let bin_nr_path = fm::find_file(&src_path, \"main\", \"nr\");\n\n match (lib_nr_path, bin_nr_path) {\n\n (Some(_), Some(_)) => Err(CliError::Generic(\n\n \"package cannot contain both a `lib.nr` and a `main.nr`\".to_owned(),\n\n )),\n\n (None, Some(path)) => Ok((path, CrateType::Binary)),\n\n (Some(path), None) => Ok((path, CrateType::Library)),\n\n (None, None) => Err(CliError::Generic(\n\n \"package must contain either a `lib.nr`(Library) or a `main.nr`(Binary).\".to_owned(),\n\n )),\n\n }\n\n}\n","file_path":"crates/nargo/src/lib.rs","rank":10,"score":297434.28767537465},{"content":"// Given a binary operator and another type. This method will produce the\n\n// output type\n\n// XXX: Review these rules. In particular, the interaction between integers, constants and private/public variables\n\npub fn infix_operand_type_rules(\n\n lhs_type: &Type,\n\n op: &HirBinaryOp,\n\n other: &Type,\n\n) -> Result<Type, String> {\n\n if op.kind.is_comparator() {\n\n return Ok(Type::Bool);\n\n }\n\n\n\n match (lhs_type, other) {\n\n\n\n (Type::Integer(lhs_field_type,sign_x, bit_width_x), Type::Integer(rhs_field_type,sign_y, bit_width_y)) => {\n\n let field_type = field_type_rules(lhs_field_type, rhs_field_type);\n\n if sign_x != sign_y {\n\n return Err(format!(\"Integers must have the same signedness LHS is {:?}, RHS is {:?} \", sign_x, sign_y))\n\n }\n\n if bit_width_x != bit_width_y {\n\n return Err(format!(\"Integers must have the same bit width LHS is {}, RHS is {} \", bit_width_x, bit_width_y))\n\n }\n\n Ok(Type::Integer(field_type,*sign_x, *bit_width_x))\n","file_path":"crates/noirc_frontend/src/hir/type_check/expr.rs","rank":11,"score":291841.5694655719},{"content":"type PredicateResult<'r, K, V> = Filter<hash_map::Iter<'r, K, V>, Predicate<K, V>>;\n\n\n\nimpl<K: std::hash::Hash + Eq + Clone, V> Scope<K, V> {\n\n pub fn new() -> Self {\n\n Scope(HashMap::with_capacity(100))\n\n }\n\n\n\n pub fn find<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V>\n\n where\n\n K: std::borrow::Borrow<Q>,\n\n Q: std::hash::Hash + Eq,\n\n {\n\n self.0.get_mut(key)\n\n }\n\n pub fn occupied_key(&mut self, key: &K) -> Option<&K> {\n\n self.0.get_key_value(key).map(|(k, _)| k)\n\n }\n\n\n\n // From HashMap: If the map did not have this key present, None is returned.\n\n pub fn add_key_value(&mut self, key: K, value: V) -> Option<V> {\n","file_path":"crates/noirc_frontend/src/hir/scope/mod.rs","rank":12,"score":291620.5189525783},{"content":"fn create_dir<P: AsRef<Path>>(dir_path: P) -> Result<PathBuf, std::io::Error> {\n\n let mut dir = std::path::PathBuf::new();\n\n dir.push(dir_path);\n\n std::fs::create_dir_all(&dir)?;\n\n Ok(dir)\n\n}\n\n\n","file_path":"crates/nargo/src/cli/mod.rs","rank":13,"score":290389.5350271578},{"content":"pub fn copy<U: AsRef<Path>, V: AsRef<Path>>(from: U, to: V) -> Result<(), std::io::Error> {\n\n let mut stack = vec![PathBuf::from(from.as_ref())];\n\n\n\n let output_root = PathBuf::from(to.as_ref());\n\n let input_root = PathBuf::from(from.as_ref()).components().count();\n\n\n\n while let Some(working_path) = stack.pop() {\n\n println!(\"process: {:?}\", &working_path);\n\n\n\n // Generate a relative path\n\n let src: PathBuf = working_path.components().skip(input_root).collect();\n\n\n\n // Create a destination if missing\n\n let dest = if src.components().count() == 0 {\n\n output_root.clone()\n\n } else {\n\n output_root.join(&src)\n\n };\n\n if fs::metadata(&dest).is_err() {\n\n println!(\" mkdir: {:?}\", dest);\n","file_path":"crates/std_lib/build.rs","rank":14,"score":282926.517468837},{"content":"// helper function which tests noir programs by trying to generate a proof and verify it\n\npub fn prove_and_verify(proof_name: &str, prg_dir: &Path) -> bool {\n\n let tmp_dir = TempDir::new(\"p_and_v_tests\").unwrap();\n\n let proof_path =\n\n prove_cmd::prove_with_path(proof_name, prg_dir.to_path_buf(), tmp_dir.into_path()).unwrap();\n\n verify_cmd::verify_with_path(prg_dir, &proof_path).unwrap()\n\n}\n","file_path":"crates/nargo/src/cli/mod.rs","rank":15,"score":279530.0301534547},{"content":"fn type_check_priv_stmt(\n\n interner: &mut NodeInterner,\n\n priv_stmt: HirPrivateStatement,\n\n) -> Result<(), TypeCheckError> {\n\n let resolved_type = type_check_declaration(interner, priv_stmt.expression, priv_stmt.r#type)?;\n\n\n\n // Check if this type can be used in a Private statement\n\n if !resolved_type.can_be_used_in_priv() {\n\n let span = interner.expr_span(&priv_stmt.expression);\n\n return Err(TypeCheckError::TypeCannotBeUsed {\n\n typ: resolved_type,\n\n place: \"private statement\",\n\n span,\n\n });\n\n }\n\n\n\n // Set the type of the identifier to be equal to the annotated type\n\n interner.push_ident_type(&priv_stmt.identifier, resolved_type);\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/type_check/stmt.rs","rank":16,"score":279385.5779486335},{"content":"fn type_check_let_stmt(\n\n interner: &mut NodeInterner,\n\n let_stmt: HirLetStatement,\n\n) -> Result<(), TypeCheckError> {\n\n let resolved_type = type_check_declaration(interner, let_stmt.expression, let_stmt.r#type)?;\n\n\n\n // Check if this type can be used in a Let statement\n\n if !resolved_type.can_be_used_in_let() {\n\n let span = interner.expr_span(&let_stmt.expression);\n\n return Err(TypeCheckError::TypeCannotBeUsed {\n\n typ: resolved_type,\n\n place: \"let statement\",\n\n span,\n\n });\n\n }\n\n\n\n // Set the type of the identifier to be equal to the annotated type\n\n interner.push_ident_type(&let_stmt.identifier, resolved_type);\n\n\n\n Ok(())\n\n}\n","file_path":"crates/noirc_frontend/src/hir/type_check/stmt.rs","rank":17,"score":279380.4851302841},{"content":"pub fn verify_with_path<P: AsRef<Path>>(program_dir: P, proof_path: P) -> Result<bool, CliError> {\n\n let driver = Resolver::resolve_root_config(program_dir.as_ref())?;\n\n let compiled_program = driver.into_compiled_program();\n\n let mut public_abi = compiled_program.abi.clone().unwrap().public_abi();\n\n add_dummy_setpub_arr(&mut public_abi);\n\n let num_pub_params = public_abi.num_parameters();\n\n let mut public_inputs = BTreeMap::new();\n\n if num_pub_params != 0 {\n\n let curr_dir = program_dir;\n\n public_inputs = noirc_abi::input_parser::Format::Toml.parse(curr_dir, VERIFIER_INPUT_FILE);\n\n }\n\n\n\n if num_pub_params != public_inputs.len() {\n\n panic!(\n\n \"Expected {} number of values, but got {} number of values\",\n\n num_pub_params,\n\n public_inputs.len()\n\n )\n\n }\n\n\n","file_path":"crates/nargo/src/cli/verify_cmd.rs","rank":18,"score":277858.52465565957},{"content":"pub fn download_crs(mut path_to_transcript: std::path::PathBuf) {\n\n if path_to_transcript.exists() {\n\n println!(\"File already exists {:?}\", path_to_transcript);\n\n return;\n\n }\n\n // Pop off the transcript component to get just the directory\n\n path_to_transcript.pop();\n\n\n\n if !path_to_transcript.exists() {\n\n std::fs::create_dir_all(&path_to_transcript).unwrap();\n\n }\n\n\n\n let url = \"http://aztec-ignition.s3.amazonaws.com/MAIN%20IGNITION/sealed/transcript00.dat\";\n\n use downloader::Downloader;\n\n let mut downloader = Downloader::builder()\n\n .download_folder(path_to_transcript.as_path())\n\n .build()\n\n .unwrap();\n\n\n\n let dl = downloader::Download::new(url);\n\n let dl = dl.progress(SimpleReporter::create());\n\n let result = downloader.download(&[dl]).unwrap();\n\n\n\n for r in result {\n\n match r {\n\n Err(e) => println!(\"Error: {}\", e),\n\n Ok(s) => println!(\"\\nSRS is located at : {:?}\", &s.file_name),\n\n };\n\n }\n\n}\n","file_path":"crates/aztec_backend/src/barretenberg_rs/crs.rs","rank":19,"score":275241.4384772302},{"content":"fn type_check_list_expression(\n\n interner: &mut NodeInterner,\n\n exprs: &[ExprId],\n\n) -> Result<(), TypeCheckError> {\n\n assert!(!exprs.is_empty());\n\n\n\n let (_, errors): (Vec<_>, Vec<_>) = exprs\n\n .iter()\n\n .map(|arg| type_check_expression(interner, arg))\n\n .partition(Result::is_ok);\n\n\n\n let errors: Vec<TypeCheckError> = errors.into_iter().map(Result::unwrap_err).collect();\n\n\n\n if !errors.is_empty() {\n\n return Err(TypeCheckError::MultipleErrors(errors));\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"crates/noirc_frontend/src/hir/type_check/expr.rs","rank":20,"score":268132.2161411844},{"content":"fn resolve_path_name(import_directive: &ImportDirective) -> Ident {\n\n match &import_directive.alias {\n\n None => import_directive.path.segments.last().unwrap().clone(),\n\n Some(ident) => ident.clone(),\n\n }\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/resolution/import.rs","rank":21,"score":267139.3140973748},{"content":"/// Searches for the Nargo.toml file\n\n///\n\n/// XXX: In the end, this should find the root of the project and check\n\n/// for the Nargo.toml file there\n\n/// However, it should only do this after checking the current path\n\n/// This allows the use of workspace settings in the future.\n\nfn find_package_config(current_path: &Path) -> Result<PathBuf, CliError> {\n\n match fm::find_file(current_path, \"Nargo\", \"toml\") {\n\n Some(p) => Ok(p),\n\n None => {\n\n return Err(CliError::Generic(format!(\n\n \"cannot find a Nargo.toml in {}\",\n\n current_path.display()\n\n )))\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/nargo/src/lib.rs","rank":22,"score":263259.2703601647},{"content":"fn check_param_argument(\n\n interner: &NodeInterner,\n\n expr_id: ExprId,\n\n param: &Param,\n\n arg_type: &Type,\n\n) -> Result<(), TypeCheckError> {\n\n let param_type = ¶m.1;\n\n\n\n if arg_type.is_variable_sized_array() {\n\n unreachable!(\"arg type type cannot be a variable sized array. This is not supported.\")\n\n }\n\n\n\n if !param_type.is_super_type_of(arg_type) {\n\n let span = interner.expr_span(&expr_id);\n\n return Err(TypeCheckError::TypeMismatch {\n\n expected_typ: param_type.to_string(),\n\n expr_typ: arg_type.to_string(),\n\n expr_span: span,\n\n });\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/type_check/expr.rs","rank":23,"score":261506.5620595059},{"content":"fn field_type_rules(lhs: &FieldElementType, rhs: &FieldElementType) -> FieldElementType {\n\n match (lhs, rhs) {\n\n (FieldElementType::Private, FieldElementType::Private) => FieldElementType::Private,\n\n (FieldElementType::Private, FieldElementType::Public) => FieldElementType::Private,\n\n (FieldElementType::Private, FieldElementType::Constant) => FieldElementType::Private,\n\n (FieldElementType::Public, FieldElementType::Private) => FieldElementType::Private,\n\n (FieldElementType::Public, FieldElementType::Public) => FieldElementType::Public,\n\n (FieldElementType::Public, FieldElementType::Constant) => FieldElementType::Public,\n\n (FieldElementType::Constant, FieldElementType::Private) => FieldElementType::Private,\n\n (FieldElementType::Constant, FieldElementType::Public) => FieldElementType::Public,\n\n (FieldElementType::Constant, FieldElementType::Constant) => FieldElementType::Constant,\n\n }\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/type_check/expr.rs","rank":24,"score":258819.93252027722},{"content":"pub fn sha256(initial_witness: &mut BTreeMap<Witness, FieldElement>, gadget_call: &GadgetCall) {\n\n generic_hash_256::<Sha256>(initial_witness, gadget_call)\n\n}\n\n\n","file_path":"crates/acvm/src/pwg/hash/mod.rs","rank":25,"score":252602.5395040831},{"content":"pub fn blake2s(initial_witness: &mut BTreeMap<Witness, FieldElement>, gadget_call: &GadgetCall) {\n\n generic_hash_256::<Blake2s>(initial_witness, gadget_call)\n\n}\n\n\n","file_path":"crates/acvm/src/pwg/hash/mod.rs","rank":26,"score":252602.5395040831},{"content":"// Resolve `foo::bar` in foo::bar::call() to the module with the function\n\npub fn resolve_function_call_path(\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n module_id: ModuleId,\n\n path: Path,\n\n) -> Result<Option<ModuleDefId>, Ident> {\n\n // lets package up the path into an ImportDirective and resolve it using that\n\n let import = ImportDirective {\n\n module_id: module_id.local_id,\n\n path,\n\n alias: None,\n\n };\n\n\n\n let def_map = &def_maps[&module_id.krate];\n\n let path_res = resolve_path_to_ns(&import, def_map, def_maps);\n\n let ns = match path_res {\n\n PathResolution::Unresolved(seg) => return Err(seg),\n\n PathResolution::Resolved(ns) => ns,\n\n };\n\n\n\n // XXX: Note that we are returning the value and not a type.\n\n // In the future we can generalise and return a PerNs\n\n // Which the Resolver will then deal with\n\n // For now, since this is used only for function call paths, it is fine\n\n Ok(ns.take_values())\n\n}\n","file_path":"crates/noirc_frontend/src/hir/resolution/path_resolver.rs","rank":27,"score":252328.7799514149},{"content":"pub fn flatten_path(path: Vec<(FieldElement, FieldElement)>) -> Vec<FieldElement> {\n\n path.into_iter()\n\n .flat_map(|(left, right)| std::iter::once(left).chain(std::iter::once(right)))\n\n .collect()\n\n}\n\n\n\npub struct MerkleTree {\n\n depth: u32,\n\n total_size: u32,\n\n db: sled::Db,\n\n barretenberg: Barretenberg,\n\n}\n\n\n","file_path":"crates/acvm/src/backends/csat_3_plonk_aztec/pwg/merkle.rs","rank":28,"score":251094.6960172358},{"content":"type ParserStmtResult = ParserResult<Statement>;\n\n\n\n// XXX: We can probably abstract the lexer away, as we really only need an Iterator of Tokens/ TokenStream\n\n// XXX: Alternatively can make Lexer take a Reader, but will need to do a Bytes -> to char conversion. Can just return an error if cannot do conversion\n\n// As this should not be leaked to any other part of the lib\n\npub struct Parser<'a> {\n\n pub(crate) lexer: Lexer<'a>,\n\n pub(crate) curr_token: SpannedToken,\n\n pub(crate) peek_token: SpannedToken,\n\n pub(crate) errors: Vec<ParserErrorKind>,\n\n}\n\n\n\nimpl<'a> Parser<'a> {\n\n pub fn new(mut lexer: Lexer<'a>) -> Self {\n\n let curr_token = lexer.next_token().unwrap();\n\n let peek_token = lexer.next_token().unwrap();\n\n\n\n Parser {\n\n lexer,\n\n curr_token,\n","file_path":"crates/noirc_frontend/src/parser/parser.rs","rank":29,"score":249300.25700645035},{"content":"pub fn resolve_path_to_ns(\n\n import_directive: &ImportDirective,\n\n def_map: &CrateDefMap,\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n) -> PathResolution {\n\n let import_path = &import_directive.path.segments;\n\n\n\n match import_directive.path.kind {\n\n crate::ast::PathKind::Crate => {\n\n // Resolve from the root of the crate\n\n resolve_path_from_crate_root(def_map, import_path, def_maps)\n\n }\n\n crate::ast::PathKind::Dep => resolve_external_dep(def_map, import_directive, def_maps),\n\n crate::ast::PathKind::Plain => {\n\n // Plain paths are only used to import children modules. It's possible to allow import of external deps, but maybe this distinction is better?\n\n // In Rust they can also point to external Dependencies, if no children can be found with the specified name\n\n resolve_name_in_module(def_map, import_path, import_directive.module_id, def_maps)\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/resolution/import.rs","rank":30,"score":248086.1662363446},{"content":"// Looks for directory named `dir_name` in path\n\npub fn find_dir<P: AsRef<Path>>(path: P, dir_name: &str) -> Option<PathBuf> {\n\n let entries = list_files_and_folders_in(path)?;\n\n find_artifact(entries, dir_name)\n\n}\n\n\n","file_path":"crates/fm/src/util.rs","rank":31,"score":247701.84854832626},{"content":"/// Given a FileId, fetch the File, from the FileManager and parse it's content\n\npub fn parse_file(\n\n fm: &mut FileManager,\n\n file_id: FileId,\n\n) -> Result<ParsedModule, Vec<CollectedErrors>> {\n\n let file = fm.fetch_file(file_id);\n\n let mut parser = Parser::from_src(file.get_source());\n\n match parser.parse_program() {\n\n Ok(prog) => Ok(prog),\n\n Err(errs) => {\n\n let file_errs = CollectedErrors {\n\n file_id,\n\n errors: errs.iter().map(|err| err.to_diagnostic()).collect(),\n\n };\n\n\n\n Err(vec![file_errs])\n\n }\n\n }\n\n}\n\n\n\nimpl std::ops::Index<LocalModuleId> for CrateDefMap {\n","file_path":"crates/noirc_frontend/src/hir/def_map/mod.rs","rank":32,"score":247386.6045782733},{"content":"fn span_parser(\n\n parser: &mut Parser,\n\n left: Expression,\n\n f: fn(parser: &mut Parser, left: Expression) -> ParserExprKindResult,\n\n) -> ParserExprResult {\n\n let start = parser.curr_token.to_span();\n\n let kind = f(parser, left)?;\n\n let end = parser.curr_token.to_span();\n\n\n\n Ok(Expression {\n\n kind,\n\n span: start.merge(end),\n\n })\n\n}\n","file_path":"crates/noirc_frontend/src/parser/infix_parser/mod.rs","rank":33,"score":239066.18733962084},{"content":"fn span_parser(\n\n parser: &mut Parser,\n\n f: fn(parser: &mut Parser) -> ParserExprKindResult,\n\n) -> ParserExprResult {\n\n let start = parser.curr_token.to_span();\n\n let kind = f(parser)?;\n\n let end = parser.curr_token.to_span();\n\n\n\n Ok(Expression {\n\n kind,\n\n span: start.merge(end),\n\n })\n\n}\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/mod.rs","rank":34,"score":239066.18733962084},{"content":"fn type_check_assign_stmt(\n\n interner: &mut NodeInterner,\n\n assign_stmt: HirAssignStatement,\n\n) -> Result<(), TypeCheckError> {\n\n // To get the type of the identifier, we need to get the identifier which defined it\n\n // once a variable has a type, it cannot be changed\n\n let ident_def = interner\n\n .ident_def(&assign_stmt.identifier)\n\n .expect(\"all identifiers that define a variable, should have a type during type checking\");\n\n let identifier_type = interner.id_type(&ident_def);\n\n\n\n type_check_expression(interner, &assign_stmt.expression)?;\n\n let expr_type = interner.id_type(&assign_stmt.expression);\n\n\n\n if expr_type != identifier_type {\n\n let expr_span = interner.expr_span(&assign_stmt.expression);\n\n return Err(TypeCheckError::TypeMismatch {\n\n expected_typ: identifier_type.to_string(),\n\n expr_typ: expr_type.to_string(),\n\n expr_span,\n\n });\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"crates/noirc_frontend/src/hir/type_check/stmt.rs","rank":35,"score":238605.28866453076},{"content":"fn type_check_constrain_stmt(\n\n interner: &mut NodeInterner,\n\n stmt: HirConstrainStatement,\n\n) -> Result<(), TypeCheckError> {\n\n type_check_expression(interner, &stmt.0.lhs)?;\n\n let lhs_type = interner.id_type(stmt.0.lhs);\n\n\n\n type_check_expression(interner, &stmt.0.rhs)?;\n\n let rhs_type = interner.id_type(&stmt.0.rhs);\n\n\n\n // Since constrain statements are not expressions, we do not allow predicate or non-comparison binary operators\n\n if !stmt.0.operator.kind.is_comparator() {\n\n let span = stmt.0.operator.span;\n\n let err = TypeCheckError::OpCannotBeUsed {\n\n op: stmt.0.operator,\n\n place: \"constrain statement\",\n\n span,\n\n };\n\n let err = err\n\n .add_context(\"only comparison operators can be used in a constrain statement\")\n","file_path":"crates/noirc_frontend/src/hir/type_check/stmt.rs","rank":36,"score":238605.28866453076},{"content":"fn type_check_const_stmt(\n\n interner: &mut NodeInterner,\n\n const_stmt: HirConstStatement,\n\n) -> Result<(), TypeCheckError> {\n\n // XXX: It may not make sense to have annotations for const statements, since they can only have one type\n\n // Unless we later want to have u32 constants and check those at compile time.\n\n let resolved_type = type_check_declaration(interner, const_stmt.expression, const_stmt.r#type)?;\n\n\n\n if resolved_type != Type::CONSTANT {\n\n let span = interner.expr_span(&const_stmt.expression);\n\n let mut err = TypeCheckError::TypeCannotBeUsed {\n\n typ: resolved_type,\n\n place: \"constant statement\",\n\n span,\n\n };\n\n err = err\n\n .add_context(\"constant statements can only contain constant types\")\n\n .unwrap();\n\n return Err(err);\n\n }\n\n\n\n interner.push_ident_type(&const_stmt.identifier, resolved_type);\n\n\n\n Ok(())\n\n}\n","file_path":"crates/noirc_frontend/src/hir/type_check/stmt.rs","rank":37,"score":238605.28866453076},{"content":"// Looks for file named `file_name` in path\n\npub fn find_file<P: AsRef<Path>>(path: P, file_name: &str, extension: &str) -> Option<PathBuf> {\n\n let entries = list_files_and_folders_in(path)?;\n\n\n\n let mut file_name = file_name.to_owned();\n\n file_name.push('.');\n\n file_name.push_str(extension);\n\n\n\n find_artifact(entries, &file_name)\n\n}\n","file_path":"crates/fm/src/util.rs","rank":38,"score":238001.80184592505},{"content":"/// XXX: I'd prefer to use a GitHub library however, there\n\n/// does not seem to be an easy way to download a repo at a specific\n\n/// tag\n\n/// github-rs looks promising, however it seems to require an API token\n\n///\n\n/// One advantage of using \"git clone\" is that there is effectively no rate limit\n\npub fn clone_git_repo(url: &str, tag: &str) -> Result<PathBuf, String> {\n\n use std::process::Command;\n\n\n\n let base = match url::Url::parse(url) {\n\n Ok(base) => base,\n\n Err(err) => return Err(err.to_string()),\n\n };\n\n\n\n let loc = git_dep_location(&base, tag);\n\n if loc.exists() {\n\n return Ok(loc);\n\n }\n\n\n\n Command::new(\"git\")\n\n .arg(\"-c\")\n\n .arg(\"advice.detachedHead=false\")\n\n .arg(\"clone\")\n\n .arg(\"--depth\")\n\n .arg(\"1\")\n\n .arg(\"--branch\")\n\n .arg(&tag)\n\n .arg(base.as_str())\n\n .arg(&loc)\n\n .status()\n\n .expect(\"git clone command failed to start\");\n\n\n\n Ok(loc)\n\n}\n","file_path":"crates/nargo/src/git.rs","rank":39,"score":232349.041751971},{"content":"fn prove(proof_name: &str) -> Result<(), CliError> {\n\n let curr_dir = std::env::current_dir().unwrap();\n\n let mut proof_path = PathBuf::new();\n\n proof_path.push(PROOFS_DIR);\n\n let result = prove_with_path(proof_name, curr_dir, proof_path);\n\n match result {\n\n Ok(_) => Ok(()),\n\n Err(e) => Err(e),\n\n }\n\n}\n\n\n","file_path":"crates/nargo/src/cli/prove_cmd.rs","rank":40,"score":232220.68125499878},{"content":"/// All declaration statements check that the user specified type(UST) is equal to the\n\n/// expression on the RHS, unless the UST is unspecified\n\n/// In that case, the UST because the expression\n\nfn type_check_declaration(\n\n interner: &mut NodeInterner,\n\n rhs_expr: ExprId,\n\n mut annotated_type: Type,\n\n) -> Result<Type, TypeCheckError> {\n\n // Type check the expression on the RHS\n\n type_check_expression(interner, &rhs_expr)?;\n\n let expr_type = interner.id_type(&rhs_expr);\n\n\n\n // First check if the LHS is unspecified\n\n // If so, then we give it the same type as the expression\n\n if annotated_type == Type::Unspecified {\n\n annotated_type = expr_type.clone();\n\n };\n\n\n\n // Now check if LHS is the same type as the RHS\n\n // Importantly, we do not co-erce any types implicitly\n\n if annotated_type != expr_type {\n\n let expr_span = interner.expr_span(&rhs_expr);\n\n return Err(TypeCheckError::TypeMismatch {\n","file_path":"crates/noirc_frontend/src/hir/type_check/stmt.rs","rank":41,"score":230898.4495789327},{"content":"pub fn prove_with_path<P: AsRef<Path>>(\n\n proof_name: &str,\n\n program_dir: P,\n\n proof_dir: P,\n\n) -> Result<PathBuf, CliError> {\n\n let driver = Resolver::resolve_root_config(program_dir.as_ref())?;\n\n let compiled_program = driver.into_compiled_program();\n\n\n\n // Parse the initial witness values\n\n let witness_map = noirc_abi::input_parser::Format::Toml.parse(program_dir, PROVER_INPUT_FILE);\n\n\n\n // Check that enough witness values were supplied\n\n let num_params = compiled_program.abi.as_ref().unwrap().num_parameters();\n\n if num_params != witness_map.len() {\n\n panic!(\n\n \"Expected {} number of values, but got {} number of values\",\n\n num_params,\n\n witness_map.len()\n\n )\n\n }\n","file_path":"crates/nargo/src/cli/prove_cmd.rs","rank":42,"score":230052.26270795625},{"content":"/// Takes a path to a noir file. This will panic on paths to directories\n\n/// Returns\n\n/// For Normal filetypes, given \"src/mod.nr\" this method returns \"src/mod\"\n\n/// For Root filetypes, given \"src/mod.nr\" this method returns \"src\"\n\nfn virtualise_path(path: &Path, file_type: FileType) -> VirtualPath {\n\n let mut path = path.to_path_buf();\n\n let path = match file_type {\n\n FileType::Root => {\n\n path.pop();\n\n path\n\n }\n\n FileType::Normal => {\n\n let base = path.parent().unwrap();\n\n let path_no_ext: PathBuf = path\n\n .file_stem()\n\n .expect(\"ice: this should have been the path to a file\")\n\n .into();\n\n base.join(path_no_ext)\n\n }\n\n };\n\n VirtualPath(path)\n\n}\n\n#[cfg(test)]\n\nmod tests {\n","file_path":"crates/fm/src/lib.rs","rank":43,"score":226737.7830481545},{"content":"fn verify(proof_name: &str) -> Result<bool, CliError> {\n\n let curr_dir = std::env::current_dir().unwrap();\n\n let mut proof_path = PathBuf::new(); //or cur_dir?\n\n proof_path.push(PROOFS_DIR);\n\n proof_path.push(Path::new(proof_name));\n\n proof_path.set_extension(PROOF_EXT);\n\n verify_with_path(&curr_dir, &proof_path)\n\n}\n\n\n","file_path":"crates/nargo/src/cli/verify_cmd.rs","rank":44,"score":226125.01396386957},{"content":"fn handle_cannot_add(typ: &'static str) -> RuntimeErrorKind {\n\n RuntimeErrorKind::UnstructuredError {\n\n message: format!(\"{} cannot be used in an addition\", typ),\n\n }\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/add.rs","rank":45,"score":226114.4173686682},{"content":"/// For now we disallow statement of the form `constrain x / y` as their meaning is a bit ambiguous\n\n/// In the future, if the user inputs a disallowed operator, we may modify the AST so that it's RHS is `== 0`\n\n///\n\n/// We could also do it for the other expressions:\n\n///\n\n/// Example : `constrain x` becomes `constrain x == 0`\n\n///\n\n/// Example : `constrain x / y` becomes `constrain x/y == 0`\n\n///\n\n///\n\n/// XXX: Although explicitness is preferred, in this case it seems that since we will always be adding a `== 0`\n\n/// it may be fine. Since this change is backwards compatible, it is not necessary to make an eager decision without\n\n/// more case study.\n\nfn disallowed_operators() -> Vec<BinaryOpKind> {\n\n vec![\n\n BinaryOpKind::And,\n\n BinaryOpKind::Or,\n\n BinaryOpKind::Divide,\n\n BinaryOpKind::Multiply,\n\n ]\n\n}\n\n\n\n/// Parses statements of the form\n\n/// - constrain <EXPR> OP <EXPR>\n\n///\n\n/// Cursor Start : `constrain`\n\n///\n\n/// Cursor End : `;`\n\nimpl ConstrainParser {\n\n // Since == is an infix operator\n\n // The pratt parser will do most of the job, we just need to check that everything was correct\n\n pub(crate) fn parse_statement(\n\n parser: &mut Parser,\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/constrain.rs","rank":46,"score":217549.99003733354},{"content":"pub fn start_cli() {\n\n let matches = App::new(\"nargo\")\n\n .about(\"Noir's package manager\")\n\n .version(\"0.1\")\n\n .author(\"Kevaundray Wedderburn <kevtheappdev@gmail.com>\")\n\n .subcommand(App::new(\"build\").about(\"Builds the constraint system\"))\n\n .subcommand(App::new(\"contract\").about(\"Creates the smart contract code for circuit\"))\n\n .subcommand(\n\n App::new(\"new\")\n\n .about(\"Create a new binary project\")\n\n .arg(\n\n Arg::with_name(\"package_name\")\n\n .help(\"Name of the package\")\n\n .required(true),\n\n )\n\n .arg(\n\n Arg::with_name(\"path\")\n\n .help(\"The path to save the new project\")\n\n .required(false),\n\n ),\n","file_path":"crates/nargo/src/cli/mod.rs","rank":47,"score":215850.9620573271},{"content":"fn mod_cache_location() -> std::path::PathBuf {\n\n let mut mod_cache_dir = dirs::home_dir().unwrap();\n\n mod_cache_dir.push(std::path::Path::new(\"noir_cache\"));\n\n mod_cache_dir.push(std::path::Path::new(\"barretenberg_module_cache\"));\n\n mod_cache_dir\n\n}\n\n\n","file_path":"crates/aztec_backend/src/barretenberg_rs/mod.rs","rank":48,"score":214447.99118319407},{"content":"pub fn add_dummy_setpub_arr(abi: &mut Abi) {\n\n // Add a dummy setpub array\n\n // This method is used so that an empty \"setpub\" array is created in the verifier.toml\n\n // and also so that when the verifier searches for public inputs,\n\n // they also search for this \"setpub\"\n\n let dummy_arr = AbiType::Array {\n\n visibility: AbiFEType::Private,\n\n length: 0,\n\n typ: Box::new(AbiType::Field(AbiFEType::Private)),\n\n };\n\n // setpub is a keyword in Noir, so it cannot be used as a field name\n\n // ensuring there will be no conflicts\n\n abi.parameters.push((RESERVED_PUBLIC_ARR.into(), dummy_arr));\n\n}\n\n\n","file_path":"crates/nargo/src/cli/verify_cmd.rs","rank":49,"score":213896.98734847674},{"content":"pub fn call_builtin(\n\n evaluator: &mut Evaluator,\n\n env: &mut Environment,\n\n builtin_name: &str,\n\n call_expr_span: (HirCallExpression, Span),\n\n) -> Result<Object, RuntimeError> {\n\n let (call_expr, span) = call_expr_span;\n\n let func = match BuiltInFunctions::look_up_func_name(builtin_name) {\n\n None => {\n\n let message = format!(\n\n \"cannot find a builtin function with the attribute name {}\",\n\n builtin_name\n\n );\n\n return Err(RuntimeErrorKind::UnstructuredError { message }.add_span(span));\n\n }\n\n Some(func) => func,\n\n };\n\n\n\n match func {\n\n BuiltInFunctions::ArraySum => ArraySum::call(evaluator, env, (call_expr, span)),\n\n BuiltInFunctions::ArrayProd => ArrayProd::call(evaluator, env, (call_expr, span)),\n\n BuiltInFunctions::SetPub => SetPub::call(evaluator, env, (call_expr, span)),\n\n BuiltInFunctions::PowConst => PowConst::call(evaluator, env, (call_expr, span)),\n\n BuiltInFunctions::PredEq => PredicateEq::call(evaluator, env, (call_expr, span)),\n\n }\n\n}\n","file_path":"crates/noirc_evaluator/src/builtin/mod.rs","rank":50,"score":212714.1895897505},{"content":"pub fn input_to_value<'a>(\n\n witness_map: &'a BTreeMap<Witness, FieldElement>,\n\n input: &GadgetInput,\n\n) -> &'a FieldElement {\n\n match witness_map.get(&input.witness) {\n\n None => panic!(\"Cannot find witness assignment for {:?}\", input),\n\n Some(assignment) => assignment,\n\n }\n\n}\n","file_path":"crates/acvm/src/pwg/mod.rs","rank":51,"score":211721.23264755544},{"content":"fn write_to_file(bytes: &[u8], path: &Path) -> String {\n\n let display = path.display();\n\n\n\n let mut file = match File::create(&path) {\n\n Err(why) => panic!(\"couldn't create {}: {}\", display, why),\n\n Ok(file) => file,\n\n };\n\n\n\n match file.write_all(bytes) {\n\n Err(why) => panic!(\"couldn't write to {}: {}\", display, why),\n\n Ok(_) => display.to_string(),\n\n }\n\n}\n\n\n","file_path":"crates/nargo/src/cli/mod.rs","rank":52,"score":211555.25458794017},{"content":"/// Returns 1 if a == b else 0\n\npub fn maybe_equal(\n\n a: Object,\n\n b: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Integer, RuntimeErrorKind> {\n\n const ICE_STR: &str = \"ice: this method should only be called for arithmetic gates\";\n\n let a_arith = a.to_arithmetic().expect(ICE_STR);\n\n let b_arith = b.to_arithmetic().expect(ICE_STR);\n\n\n\n // u = a - b\n\n let a_minus_b = &a_arith - &b_arith;\n\n let (_, u_wit) = evaluator.create_intermediate_variable(a_minus_b);\n\n\n\n // z = 1/u => uz = 1\n\n let z = evaluator.add_witness_to_cs();\n\n evaluator.gates.push(Gate::Directive(Directive::Invert {\n\n x: u_wit,\n\n result: z,\n\n }));\n\n\n","file_path":"crates/noirc_evaluator/src/binary_op/mod.rs","rank":53,"score":209702.8206392128},{"content":"pub fn resolve_imports(\n\n crate_id: CrateId,\n\n imports_to_resolve: Vec<ImportDirective>,\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n) -> (Vec<ImportDirective>, Vec<ResolvedImport>) {\n\n let num_imports = imports_to_resolve.len();\n\n let def_map = &def_maps[&crate_id];\n\n\n\n let mut unresolved: Vec<ImportDirective> = Vec::new();\n\n let mut resolved: Vec<ResolvedImport> = Vec::new();\n\n for import_directive in imports_to_resolve {\n\n let defs = resolve_path_to_ns(&import_directive, def_map, def_maps);\n\n\n\n // Once we have the Option<defs>\n\n // resolve name and push into appropriate vector\n\n match defs {\n\n PathResolution::Unresolved(_) => {\n\n unresolved.push(import_directive);\n\n }\n\n PathResolution::Resolved(resolved_namespace) => {\n","file_path":"crates/noirc_frontend/src/hir/resolution/import.rs","rank":54,"score":209648.30882031517},{"content":"// Remove all terms with zero as a coefficient\n\npub fn remove_zero_coefficients(mut gate: Arithmetic) -> Arithmetic {\n\n // Check the mul terms\n\n gate.mul_terms = gate\n\n .mul_terms\n\n .into_iter()\n\n .filter(|(scale, _, _)| !scale.is_zero())\n\n .collect();\n\n\n\n // Check the linear combination terms\n\n gate.linear_combinations = gate\n\n .linear_combinations\n\n .into_iter()\n\n .filter(|(scale, _)| !scale.is_zero())\n\n .collect();\n\n\n\n gate\n\n}\n\n\n","file_path":"crates/acir/src/optimiser/general_optimiser.rs","rank":55,"score":209644.02784589372},{"content":"// Simplifies all mul terms with the same bi-variate variables\n\npub fn simplify_mul_terms(mut gate: Arithmetic) -> Arithmetic {\n\n let mut hash_map: IndexMap<(Witness, Witness), FieldElement> = IndexMap::new();\n\n\n\n // Canonicalise the ordering of the multiplication, lets just order by variable name\n\n for (scale, w_l, w_r) in gate.mul_terms.clone().into_iter() {\n\n let mut pair = vec![w_l, w_r];\n\n // Sort using rust sort algorithm\n\n pair.sort();\n\n\n\n *hash_map\n\n .entry((pair[0], pair[1]))\n\n .or_insert_with(FieldElement::zero) += scale;\n\n }\n\n\n\n gate.mul_terms = hash_map\n\n .into_iter()\n\n .map(|((w_l, w_r), scale)| (scale, w_l, w_r))\n\n .collect();\n\n\n\n gate\n\n}\n","file_path":"crates/acir/src/optimiser/general_optimiser.rs","rank":56,"score":209644.02784589372},{"content":"/// Checks the token and returns the identifier along with the path kind\n\n/// only plain paths return identifiers, as the other path kinds implicitly\n\n/// contain the keyword used.\n\nfn path_identifer(\n\n tok: &crate::token::SpannedToken,\n\n) -> Result<(Option<Ident>, PathKind), ParserErrorKind> {\n\n use noirc_errors::Spanned;\n\n match tok.token() {\n\n Token::Ident(x) => Ok((\n\n Some(Spanned::from(tok.to_span(), x.to_owned()).into()),\n\n PathKind::Plain,\n\n )),\n\n Token::Keyword(Keyword::Crate) => Ok((None, PathKind::Crate)),\n\n Token::Keyword(Keyword::Dep) => Ok((None, PathKind::Dep)),\n\n _ => {\n\n return Err(ParserErrorKind::UnstructuredError {\n\n span: tok.to_span(),\n\n message: format!(\n\n \"expected an identifier, `dep` or `crate`. Found {} \",\n\n tok.token()\n\n ),\n\n })\n\n }\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/path.rs","rank":57,"score":203395.46738335898},{"content":"pub fn call_low_level(\n\n evaluator: &mut Evaluator,\n\n env: &mut Environment,\n\n opcode_name: &str,\n\n call_expr_span: (HirCallExpression, Span),\n\n) -> Result<Object, RuntimeError> {\n\n let (call_expr, span) = call_expr_span;\n\n let func = match OPCODE::lookup(opcode_name) {\n\n None => {\n\n let message = format!(\n\n \"cannot find a low level opcode with the name {} in the IR\",\n\n opcode_name\n\n );\n\n\n\n return Err(RuntimeErrorKind::UnstructuredError { message }.add_span(span));\n\n }\n\n\n\n Some(func) => func,\n\n };\n\n\n","file_path":"crates/noirc_evaluator/src/low_level_function_impl/mod.rs","rank":58,"score":201303.30894341978},{"content":"fn err_cannot_mul(first_type: &'static str, second_type: &'static str) -> RuntimeErrorKind {\n\n RuntimeErrorKind::UnsupportedOp {\n\n op: \"mul\".to_owned(),\n\n first_type: first_type.to_owned(),\n\n second_type: second_type.to_owned(),\n\n }\n\n}\n\n\n","file_path":"crates/noirc_evaluator/src/binary_op/mul.rs","rank":59,"score":194135.19367558762},{"content":"pub trait PathResolver {\n\n fn resolve(\n\n &self,\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n path: Path,\n\n ) -> Result<Option<ModuleDefId>, Ident>;\n\n}\n\n\n\npub struct FunctionPathResolver {\n\n // Module that we are resolving the path in\n\n module_id: ModuleId,\n\n}\n\n\n\nimpl FunctionPathResolver {\n\n pub fn new(module_id: ModuleId) -> FunctionPathResolver {\n\n Self { module_id }\n\n }\n\n}\n\n\n\nimpl PathResolver for FunctionPathResolver {\n\n fn resolve(\n\n &self,\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n path: Path,\n\n ) -> Result<Option<ModuleDefId>, Ident> {\n\n resolve_function_call_path(def_maps, self.module_id, path)\n\n }\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/resolution/path_resolver.rs","rank":60,"score":193176.8350159026},{"content":"/// Parses the initial Witness Values that are needed to seed the\n\n/// Partial Witness generator\n\npub trait InitialWitnessParser {\n\n fn parse_initial_witness<P: AsRef<Path>>(&self, path: P) -> BTreeMap<String, InputValue>;\n\n}\n\n\n\n/// The different formats that are supported when parsing\n\n/// the initial witness values\n\npub enum Format {\n\n Toml,\n\n}\n\n\n\nimpl Format {\n\n pub fn ext(&self) -> &'static str {\n\n match self {\n\n Format::Toml => \"toml\",\n\n }\n\n }\n\n}\n\n\n\nimpl Format {\n\n pub fn parse<P: AsRef<Path>>(&self, path: P, file_name: &str) -> BTreeMap<String, InputValue> {\n","file_path":"crates/noirc_abi/src/input_parser/mod.rs","rank":61,"score":192487.70120889772},{"content":"// We use lib.rs to lean on Rusts build system, but we do not want it or any other rust files to be copied\n\nfn is_rs_file(src: &Path) -> bool {\n\n // assert_eq!(\"rs\", path.extension().unwrap());\n\n match src.extension() {\n\n Some(ext) => ext == \"rs\",\n\n None => false,\n\n }\n\n}\n\n\n","file_path":"crates/std_lib/build.rs","rank":62,"score":191030.25966163096},{"content":"/// Converts an `IR` into the `StandardFormat` constraint system\n\npub fn serialise_circuit(circuit: &Circuit) -> ConstraintSystem {\n\n // Create constraint system\n\n let mut constraints: Vec<Constraint> = Vec::new();\n\n let mut range_constraints: Vec<RangeConstraint> = Vec::new();\n\n let mut logic_constraints: Vec<LogicConstraint> = Vec::new();\n\n let mut sha256_constraints: Vec<Sha256Constraint> = Vec::new();\n\n let mut blake2s_constraints: Vec<Blake2sConstraint> = Vec::new();\n\n let mut pedersen_constraints: Vec<PedersenConstraint> = Vec::new();\n\n let mut merkle_membership_constraints: Vec<MerkleMembershipConstraint> = Vec::new();\n\n let mut insert_merkle_constraints: Vec<InsertMerkleConstraint> = Vec::new();\n\n let mut schnorr_constraints: Vec<SchnorrConstraint> = Vec::new();\n\n let mut ecdsa_secp256k1_constraints: Vec<EcdsaConstraint> = Vec::new();\n\n let mut fixed_base_scalar_mul_constraints: Vec<FixedBaseScalarMulConstraint> = Vec::new();\n\n let mut hash_to_field_constraints: Vec<HashToFieldConstraint> = Vec::new();\n\n\n\n for gate in circuit.gates.iter() {\n\n match gate {\n\n Gate::Arithmetic(arithmetic) => {\n\n let constraint = serialise_arithmetic_gates(arithmetic);\n\n constraints.push(constraint);\n","file_path":"crates/aztec_backend/src/serialiser/mod.rs","rank":63,"score":190526.56107523837},{"content":"#[test]\n\nfn test_span() {\n\n let input = \"let x = 5\";\n\n\n\n // Let\n\n let start_position = Position::default().forward();\n\n let let_position = start_position.forward_by(2);\n\n let let_token = Token::Keyword(Keyword::Let).into_span(start_position, let_position);\n\n\n\n // Skip whitespace\n\n let whitespace_position = let_position.forward();\n\n\n\n // Identifier position\n\n let ident_position = whitespace_position.forward();\n\n let ident_token = Token::Ident(\"x\".to_string()).into_single_span(ident_position);\n\n\n\n // Skip whitespace\n\n let whitespace_position = ident_position.forward();\n\n\n\n // Assign position\n\n let assign_position = whitespace_position.forward();\n","file_path":"crates/noirc_frontend/src/lexer/lexer.rs","rank":64,"score":189076.60791870975},{"content":"#[test]\n\nfn test_int_type() {\n\n let input = \"u16 i16 i108 u104.5\";\n\n\n\n let expected = vec![\n\n Token::IntType(IntType::Unsigned(16)),\n\n Token::IntType(IntType::Signed(16)),\n\n Token::IntType(IntType::Signed(108)),\n\n Token::IntType(IntType::Unsigned(104)),\n\n Token::Dot,\n\n Token::Int(5.into()),\n\n ];\n\n\n\n let mut lexer = Lexer::new(input);\n\n for token in expected.into_iter() {\n\n let got = lexer.next_token().unwrap();\n\n assert_eq!(got, token);\n\n }\n\n}\n","file_path":"crates/noirc_frontend/src/lexer/lexer.rs","rank":65,"score":185394.55484026542},{"content":"fn mask_vector_le(bytes: &mut [u8], num_bits: usize) {\n\n // reverse to big endian format\n\n bytes.reverse();\n\n\n\n let mask_power = num_bits % 8;\n\n let array_mask_index = num_bits / 8;\n\n\n\n for (index, byte) in bytes.iter_mut().enumerate() {\n\n match index.cmp(&array_mask_index) {\n\n std::cmp::Ordering::Less => {\n\n // do nothing if the current index is less than\n\n // the array index.\n\n }\n\n std::cmp::Ordering::Equal => {\n\n let mask = 2u8.pow(mask_power as u32) - 1;\n\n // mask the byte\n\n *byte &= mask;\n\n }\n\n std::cmp::Ordering::Greater => {\n\n // Anything greater than the array index\n\n // will be set to zero\n\n *byte = 0;\n\n }\n\n }\n\n }\n\n // reverse back to little endian\n\n bytes.reverse();\n\n}\n","file_path":"crates/noir_field/src/generic_ark.rs","rank":66,"score":184465.32620556487},{"content":"fn resolve_path_from_crate_root(\n\n def_map: &CrateDefMap,\n\n import_path: &[Ident],\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n) -> PathResolution {\n\n resolve_name_in_module(def_map, import_path, def_map.root, def_maps)\n\n}\n\n\n","file_path":"crates/noirc_frontend/src/hir/resolution/import.rs","rank":67,"score":182084.87108090072},{"content":"fn resolve_name_in_module(\n\n def_map: &CrateDefMap,\n\n import_path: &[Ident],\n\n starting_mod: LocalModuleId,\n\n def_maps: &HashMap<CrateId, CrateDefMap>,\n\n) -> PathResolution {\n\n let mut current_mod = &def_map.modules[starting_mod.0];\n\n\n\n // There is a possibility that the import path is empty\n\n // In that case, early return\n\n if import_path.is_empty() {\n\n let mod_id = ModuleId {\n\n krate: def_map.krate,\n\n local_id: starting_mod,\n\n };\n\n return PathResolution::Resolved(PerNs::types(mod_id.into()));\n\n }\n\n\n\n let mut import_path = import_path.iter();\n\n let first_segment = import_path\n","file_path":"crates/noirc_frontend/src/hir/resolution/import.rs","rank":68,"score":181959.28698647313},{"content":"fn type_check_functions(\n\n interner: &mut NodeInterner,\n\n file_func_ids: Vec<(FileId, FuncId)>,\n\n) -> Result<(), Vec<CollectedErrors>> {\n\n for (file_id, func_id) in file_func_ids {\n\n if let Err(type_err) = type_check_func(interner, func_id) {\n\n let diag = type_err.into_diagnostics(interner);\n\n let errs = vec![CollectedErrors {\n\n file_id,\n\n errors: diag,\n\n }];\n\n return Err(errs);\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"crates/noirc_frontend/src/hir/def_collector/dc_crate.rs","rank":69,"score":179026.03172871555},{"content":"pub fn git_dep_location(base: &url::Url, tag: &str) -> PathBuf {\n\n let folder_name = super::resolver::resolve_folder_name(base, tag);\n\n\n\n super::nargo_crates().join(folder_name)\n\n}\n\n\n","file_path":"crates/nargo/src/git.rs","rank":70,"score":178813.81588630038},{"content":"fn insert_root(db: &mut sled::Db, value: FieldElement) {\n\n db.insert(\"ROOT\".as_bytes(), value.to_bytes()).unwrap();\n\n}\n","file_path":"crates/acvm/src/backends/csat_3_plonk_aztec/pwg/merkle.rs","rank":71,"score":174944.48153315007},{"content":"struct Scope<K,V>(Vec<Item>)\n\n\n\nWe may want this because vector search is more cache friendly when there are not a lot of items.\n\nIt's not implemented yet, because nothing has been benched\n\n\n\n*/\n\n\n\n/// This implementation uses the terminology Scope and ScopeTree\n\n/// A Scope is map between Keys and Values, it is possible to search for a Key in Scope, returning a mutable copy\n\n/// A ScopeTree is a Vector of Scopes, searching for Key in ScopeTree will recursively search from the last scope until the first scope\n\n/// to find the Key, returning None, if the Key is in None of the Scopes.\n\n/// A ScopeTree is useful for implementing the scoping logic around for-loops, if statements and ClosureCalls.\n\n/// Implementers will usually store a Vector of ScopeTrees to implement the logic needed for FunctionCalls\n\npub struct Scope<K, V>(pub HashMap<K, V>);\n\n\n\nuse std::collections::hash_map;\n\nuse std::iter::Filter;\n\n\n","file_path":"crates/noirc_frontend/src/hir/scope/mod.rs","rank":72,"score":174343.61094636703},{"content":"type Scope = GenericScope<String, ResolverMeta>;\n","file_path":"crates/noirc_frontend/src/hir/resolution/resolver.rs","rank":73,"score":173655.27196446303},{"content":"/// Converts the Toml mapping to the native representation that the compiler\n\n/// understands for Inputs\n\nfn toml_map_to_field(toml_map: BTreeMap<String, TomlTypes>) -> BTreeMap<String, InputValue> {\n\n let mut field_map = BTreeMap::new();\n\n\n\n for (parameter, value) in toml_map {\n\n match value {\n\n TomlTypes::String(string) => {\n\n let old_value =\n\n field_map.insert(parameter.clone(), InputValue::Field(parse_str(&string)));\n\n assert!(old_value.is_none(), \"duplicate variable name {}\", parameter);\n\n }\n\n TomlTypes::Integer(integer) => {\n\n let old_value = field_map.insert(\n\n parameter.clone(),\n\n InputValue::Field(parse_str(&integer.to_string())),\n\n );\n\n assert!(old_value.is_none(), \"duplicate variable name {}\", parameter);\n\n }\n\n TomlTypes::ArrayNum(arr_num) => {\n\n let array_elements: Vec<_> = arr_num\n\n .into_iter()\n","file_path":"crates/noirc_abi/src/input_parser/toml.rs","rank":74,"score":171873.41009143303},{"content":"pub fn handle_and_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n match (left, right) {\n\n (Object::Integer(x), Object::Integer(y)) => Ok(Object::Integer(x.and(y, evaluator)?)),\n\n (x, y) => {\n\n let err= RuntimeErrorKind::UnstructuredError{ message : format!(\"currently we only support bitwise operations on ranged operations, found types {} and {}\", x.r#type(), y.r#type())};\n\n Err(err)\n\n }\n\n }\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/and.rs","rank":75,"score":170486.5030580648},{"content":"pub fn secp256k1_prehashed(\n\n initial_witness: &mut BTreeMap<Witness, FieldElement>,\n\n gadget_call: &GadgetCall,\n\n) {\n\n let mut inputs_iter = gadget_call.inputs.iter();\n\n\n\n let mut pub_key_x = [0u8; 32];\n\n for (i, pkx) in pub_key_x.iter_mut().enumerate() {\n\n let _x_i = inputs_iter\n\n .next()\n\n .unwrap_or_else(|| panic!(\"pub_key_x should be 32 bytes long, found only {} bytes\", i));\n\n let x_i = input_to_value(initial_witness, _x_i);\n\n *pkx = *x_i.to_bytes().last().unwrap()\n\n }\n\n\n\n let mut pub_key_y = [0u8; 32];\n\n for (i, pky) in pub_key_y.iter_mut().enumerate() {\n\n let _y_i = inputs_iter\n\n .next()\n\n .unwrap_or_else(|| panic!(\"pub_key_y should be 32 bytes long, found only {} bytes\", i));\n","file_path":"crates/acvm/src/pwg/signature/ecdsa.rs","rank":76,"score":170486.50305806476},{"content":"use super::*;\n\n\n\npub struct UseParser;\n\n\n\nimpl UseParser {\n\n // Import statements of the form use std::hash::sha256;\n\n pub fn parse(parser: &mut Parser) -> Result<ImportStatement, ParserErrorKind> {\n\n // Current token is 'use'\n\n //\n\n // Next token should be the first segment for the Path\n\n // The PathParser expects the cursor to be on the first segment\n\n // so we advance the parser.\n\n parser.advance_tokens();\n\n\n\n // Current token is the first path segment\n\n // Which is the correct condition to call the Path parser\n\n // as a sub procedure.\n\n let path = PathParser::parse(parser)?\n\n .into_path()\n\n .expect(\"ice : path parser did not produce a path\");\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs","rank":77,"score":169075.78408256575},{"content":" //\n\n // Peek ahead and check if the next token is `;`\n\n parser.peek_check_variant_advance(&Token::Semicolon)?;\n\n\n\n Ok(ImportStatement { path, alias })\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::parser::test_parse;\n\n\n\n use super::UseParser;\n\n\n\n #[test]\n\n fn valid_syntax() {\n\n let vectors = vec![\n\n \"use std::hash;\",\n\n \"use std;\",\n\n \"use foo::bar as hello;\",\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs","rank":78,"score":169073.30440105152},{"content":" \"use foobar as as;\",\n\n //\n\n // Path ends with `::`\n\n \"use hello:: as foo;\",\n\n ];\n\n\n\n for src in vectors {\n\n let mut parser = test_parse(src);\n\n UseParser::parse(&mut parser).unwrap_err();\n\n }\n\n }\n\n}\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs","rank":79,"score":169073.0981081775},{"content":"\n\n // Current token is the last identifier in the path\n\n //\n\n // Check if next token is `as` for path aliasing\n\n let mut alias: Option<Ident> = None;\n\n if parser.peek_token == Token::Keyword(Keyword::As) {\n\n // Current token is last path segment\n\n //\n\n // Bump cursor. Next token is `as`\n\n parser.advance_tokens();\n\n\n\n // Current token is `as`\n\n //\n\n // Bump cursor. Next token is the alias\n\n parser.peek_check_kind_advance(TokenKind::Ident)?;\n\n\n\n alias = Some(parser.curr_token.clone().into());\n\n }\n\n\n\n // Current token is the alias or the last path segment\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs","rank":80,"score":169071.37296432792},{"content":" \"use bar as bar;\",\n\n ];\n\n\n\n for src in vectors {\n\n let mut parser = test_parse(src);\n\n UseParser::parse(&mut parser).unwrap();\n\n }\n\n }\n\n\n\n #[test]\n\n fn invalid_syntax() {\n\n let vectors = vec![\n\n // Missing semi-colon\n\n \"use std::hash\",\n\n \"use bar as foo\",\n\n //\n\n // Missing alias\n\n \"use std as ;\",\n\n //\n\n // alias is replaced with `as`\n","file_path":"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs","rank":81,"score":169068.25477740893},{"content":"type ScopeTree = GenericScopeTree<String, ResolverMeta>;\n","file_path":"crates/noirc_frontend/src/hir/resolution/resolver.rs","rank":82,"score":168532.95669131048},{"content":"type ScopeForest = GenericScopeForest<String, ResolverMeta>;\n\n\n\npub struct Resolver<'a> {\n\n scopes: ScopeForest,\n\n\n\n path_resolver: &'a dyn PathResolver,\n\n def_maps: &'a HashMap<CrateId, CrateDefMap>,\n\n\n\n interner: &'a mut NodeInterner,\n\n\n\n errors: Vec<ResolverError>,\n\n}\n\n\n\nimpl<'a> Resolver<'a> {\n\n pub fn new(\n\n interner: &'a mut NodeInterner,\n\n path_resolver: &'a dyn PathResolver,\n\n def_maps: &'a HashMap<CrateId, CrateDefMap>,\n\n ) -> Resolver<'a> {\n\n Self {\n","file_path":"crates/noirc_frontend/src/hir/resolution/resolver.rs","rank":83,"score":168532.95669131048},{"content":"fn write_to_file(bytes: &[u8], path: &Path) -> String {\n\n let display = path.display();\n\n\n\n let mut file = match File::create(&path) {\n\n Err(why) => panic!(\"couldn't create {}: {}\", display, why),\n\n Ok(file) => file,\n\n };\n\n\n\n match file.write_all(bytes) {\n\n Err(why) => panic!(\"couldn't write to {}: {}\", display, why),\n\n Ok(_) => display.to_string(),\n\n }\n\n}\n","file_path":"crates/aztec_backend/src/barretenberg_rs/integration.rs","rank":84,"score":168045.49154767834},{"content":"fn parse_str(value: &str) -> FieldElement {\n\n if value.starts_with(\"0x\") {\n\n FieldElement::from_hex(value)\n\n .unwrap_or_else(|| panic!(\"Could not parse hex value {}\", value))\n\n } else {\n\n let val: i128 = value\n\n .parse()\n\n .expect(\"Expected witness values to be integers\");\n\n FieldElement::from(val)\n\n }\n\n}\n","file_path":"crates/noirc_abi/src/input_parser/toml.rs","rank":85,"score":167909.27247916965},{"content":"fn read_crs(path: std::path::PathBuf) -> Vec<u8> {\n\n match std::fs::read(&path) {\n\n Ok(bytes) => bytes,\n\n Err(e) => {\n\n assert!(\n\n !(e.kind() == std::io::ErrorKind::PermissionDenied),\n\n \"please run again with appropriate permissions.\"\n\n );\n\n panic!(\n\n \"Could not find file transcript00.dat at location {}.\\n Starting Download\",\n\n path.display()\n\n );\n\n }\n\n }\n\n}\n\n\n\n// XXX: Below is the logic to download the CRS if it is not already present\n\n\n","file_path":"crates/aztec_backend/src/barretenberg_rs/crs.rs","rank":86,"score":167832.89247294498},{"content":"fn transcript_location() -> std::path::PathBuf {\n\n let mut transcript_dir = dirs::home_dir().unwrap();\n\n transcript_dir.push(std::path::Path::new(\"noir_cache\"));\n\n transcript_dir.push(std::path::Path::new(\"ignition\"));\n\n transcript_dir.push(std::path::Path::new(\"transcript00.dat\"));\n\n transcript_dir\n\n}\n\n\n\nimpl CRS {\n\n pub fn new(num_points: usize) -> CRS {\n\n let g1_end = G1_START + (num_points * 64) - 1;\n\n\n\n // If the CRS does not exist, then download it from S3\n\n if !transcript_location().exists() {\n\n download_crs(transcript_location());\n\n }\n\n\n\n let crs = read_crs(transcript_location());\n\n\n\n let g1_data = crs[G1_START..=g1_end].to_vec();\n\n let g2_data = crs[G2_START..=G2_END].to_vec();\n\n\n\n CRS {\n\n g1_data,\n\n g2_data,\n\n num_points,\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/aztec_backend/src/barretenberg_rs/crs.rs","rank":87,"score":166596.7685861423},{"content":"fn insert_hash(db: &mut sled::Db, index: u32, hash: FieldElement) {\n\n let tree = db.open_tree(\"hashes\").unwrap();\n\n let index = index as u128;\n\n\n\n tree.insert(&index.to_be_bytes(), hash.to_bytes()).unwrap();\n\n}\n\n\n","file_path":"crates/acvm/src/backends/csat_3_plonk_aztec/pwg/merkle.rs","rank":88,"score":166465.75770773942},{"content":"/// This calls the sub op under the hood\n\n/// Then asserts that the result has an inverse\n\n/// i.e a != b => a-b has an inverse => 1/(a-b) * (a-b) = 1\n\npub fn handle_neq_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n match (left, right) {\n\n (Object::Array(left_arr), Object::Array(right_arr)) => {\n\n Array::not_equal(left_arr, right_arr, evaluator)?;\n\n }\n\n (left, right) => {\n\n let result = handle_sub_op(left, right, evaluator)?;\n\n // Add an inversion to ensure that the inverse exists\n\n let _ = invert(result, evaluator);\n\n }\n\n }\n\n Ok(Object::Null)\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/neq.rs","rank":89,"score":166158.4813896384},{"content":"// Intentionally chose to write this out manually as it's not expected to change often or at all\n\n// We could expand again, so that ordering is preserved, but this does not seem necessary.\n\npub fn handle_add_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n match (left, right) {\n\n //\n\n // You cannot add Null objects with anything else\n\n (Object::Null, _) | (_, Object::Null) => Err(handle_cannot_add(\"()\")),\n\n //\n\n (Object::Array(lhs), Object::Array(rhs)) => {\n\n Ok(Object::Array(Array::add(lhs, rhs, evaluator)?))\n\n }\n\n //\n\n // You cannot add array objects to anything that is not an array\n\n (Object::Array(_), _) | (_, Object::Array(_)) => Err(handle_cannot_add(\"Arrays\")),\n\n //\n\n // Delegate logic for integer addition to the integer module\n\n (Object::Integer(x), y) | (y, Object::Integer(x)) => {\n\n Ok(Object::Integer(x.add(y, evaluator)?))\n","file_path":"crates/noirc_evaluator/src/binary_op/add.rs","rank":90,"score":166153.70027563436},{"content":"/// This calls the add op under the hood\n\n/// We negate the RHS and send it to the add op\n\npub fn handle_sub_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n let negated_right = match right {\n\n Object::Null => {\n\n return Err(RuntimeErrorKind::UnstructuredError {\n\n message: \"cannot do an operation with the null object\".to_string(),\n\n })\n\n }\n\n Object::Arithmetic(arith) => Object::Arithmetic(-&arith),\n\n Object::Constants(c) => Object::Constants(-c),\n\n Object::Linear(linear) => Object::Linear(-&linear),\n\n Object::Integer(_rhs_integer) => {\n\n let left_int = left.integer();\n\n match left_int {\n\n Some(left_int) => return Ok(Object::Integer(left_int.sub(right, evaluator)?)),\n\n None => {\n\n return Err(RuntimeErrorKind::UnstructuredError {\n","file_path":"crates/noirc_evaluator/src/binary_op/sub.rs","rank":91,"score":166153.70027563436},{"content":"pub fn handle_cast_op(\n\n evaluator: &mut Evaluator,\n\n left: Object,\n\n right: Type,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n let num_bits = match right {\n\n Type::Integer(_, _sign, num_bits) => num_bits,\n\n Type::FieldElement(_) => {\n\n match left.to_arithmetic() {\n\n Some(arith) => {\n\n // XXX: Create an intermediate variable for the arithmetic gate\n\n // as we don't have full support for Arithmetic constraints in\n\n // method object_to_wit_bits\n\n let (object, _) = evaluator.create_intermediate_variable(arith);\n\n return Ok(object);\n\n }\n\n None => {\n\n return Err(RuntimeErrorKind::UnstructuredError {\n\n message: \"type cannot be casted to a Field element\".to_string(),\n\n })\n","file_path":"crates/noirc_evaluator/src/binary_op/cast.rs","rank":92,"score":166153.70027563436},{"content":"pub fn handle_xor_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n match (left, right) {\n\n (Object::Integer(x), Object::Integer(y)) => Ok(Object::Integer(x.xor(y, evaluator)?)),\n\n (x, y) => {\n\n return Err(RuntimeErrorKind::UnstructuredError {\n\n message: format!(\n\n \"bitwise operations are only available on integers, found types : {} and {}\",\n\n x.r#type(),\n\n y.r#type()\n\n ),\n\n })\n\n }\n\n }\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/xor.rs","rank":93,"score":166153.70027563436},{"content":"/// This calls the sub op under the hood\n\n/// We negate the RHS and send it to the add op\n\npub fn handle_equal_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n let result = handle_sub_op(left, right, evaluator)?;\n\n\n\n match result {\n\n Object::Null => {\n\n return Err(RuntimeErrorKind::UnstructuredError {\n\n message: \"constrain statement cannot output a null polynomial\".to_string(),\n\n })\n\n } // XXX; This should be BUG severity as sub should have caught it\n\n Object::Constants(_) => {\n\n return Err(RuntimeErrorKind::UnstructuredError {\n\n message: \"cannot constrain two constants\".to_string(),\n\n })\n\n }\n\n Object::Linear(linear) => evaluator.gates.push(Gate::Arithmetic(linear.into())),\n\n Object::Arithmetic(arith) => evaluator.gates.push(Gate::Arithmetic(arith)),\n","file_path":"crates/noirc_evaluator/src/binary_op/equal.rs","rank":94,"score":166153.70027563436},{"content":"pub fn handle_mul_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n let general_err = err_cannot_mul(left.r#type(), right.r#type());\n\n\n\n match (left, right) {\n\n (Object::Null, _) | (_, Object::Null) => Err(general_err),\n\n\n\n (Object::Array(_), Object::Array(_)) => Err(general_err),\n\n\n\n (Object::Arithmetic(x), y) | (y, Object::Arithmetic(x)) => {\n\n handle_arithmetic_mul(x, y, evaluator)\n\n }\n\n\n\n (Object::Constants(x), y) | (y, Object::Constants(x)) => {\n\n y.mul_constant(x).ok_or(general_err)\n\n }\n\n\n\n (Object::Linear(lin), y) | (y, Object::Linear(lin)) => handle_linear_mul(lin, y, evaluator),\n\n\n\n (Object::Integer(integer), y) | (y, Object::Integer(integer)) => {\n\n Ok(Object::Integer(integer.mul(y, evaluator)?))\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/noirc_evaluator/src/binary_op/mul.rs","rank":95,"score":166153.70027563436},{"content":"/// For a / b . First compute the 1/b and constraint it to be the inverse of b\n\n/// Then multiply this inverse by a\n\npub fn handle_div_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n let right_inv = invert(right, evaluator)?;\n\n handle_mul_op(left, right_inv, evaluator)\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/div.rs","rank":96,"score":166153.70027563436},{"content":"pub fn handle_less_than_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n bound_check(left, right, false, evaluator)\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/bound_check.rs","rank":97,"score":164107.17789129174},{"content":"pub fn handle_greater_than_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n bound_check(right, left, false, evaluator)\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/bound_check.rs","rank":98,"score":164107.17789129174},{"content":"pub fn handle_less_than_equal_op(\n\n left: Object,\n\n right: Object,\n\n evaluator: &mut Evaluator,\n\n) -> Result<Object, RuntimeErrorKind> {\n\n bound_check(left, right, true, evaluator)\n\n}\n","file_path":"crates/noirc_evaluator/src/binary_op/bound_check.rs","rank":99,"score":162134.78513012704}],"string":"[\n {\n \"content\": \"fn parse_let_statement(parser: &mut Parser) -> Result<LetStatement, ParserErrorKind> {\\n\\n let generic_stmt = parse_generic_decl_statement(parser)?;\\n\\n\\n\\n let stmt = LetStatement {\\n\\n identifier: generic_stmt.identifier,\\n\\n r#type: generic_stmt.typ.unwrap_or(Type::Unspecified), //XXX: Haven't implemented this yet for general structs, we only parse arrays using this\\n\\n expression: generic_stmt.rhs,\\n\\n };\\n\\n Ok(stmt)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/declaration.rs\",\n \"rank\": 1,\n \"score\": 401384.08124396164\n },\n {\n \"content\": \"/// Creates a new witness and constrains it to be the inverse of the polynomial passed in\\n\\npub fn invert(x: Object, evaluator: &mut Evaluator) -> Result<Object, RuntimeErrorKind> {\\n\\n // Create a fresh witness\\n\\n\\n\\n let inverse_witness = evaluator.add_witness_to_cs();\\n\\n let inverse_obj = Object::from_witness(inverse_witness);\\n\\n\\n\\n // Multiply inverse by original value\\n\\n let should_be_one = handle_mul_op(x, inverse_obj.clone(), evaluator)?;\\n\\n\\n\\n // Constrain x * x_inv = 1\\n\\n let _ = handle_equal_op(\\n\\n should_be_one,\\n\\n Object::Constants(FieldElement::one()),\\n\\n evaluator,\\n\\n );\\n\\n\\n\\n // Return inverse\\n\\n Ok(inverse_obj)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/mod.rs\",\n \"rank\": 2,\n \"score\": 371157.1337014666\n },\n {\n \"content\": \"fn parse_const_statement(parser: &mut Parser) -> Result<ConstStatement, ParserErrorKind> {\\n\\n let generic_stmt = parse_generic_decl_statement(parser)?;\\n\\n\\n\\n // Note: If a Type is supplied for some reason in a const statement, it can only be a Field element/Constant\\n\\n let mut default_type = Type::CONSTANT;\\n\\n if let Some(declared_type) = generic_stmt.typ {\\n\\n if !declared_type.is_constant() {\\n\\n let message = format!(\\\"Const statements can only have constant type, you supplied a {:?}. Suggestion: Remove the type and the compiler will default to Constant \\\",declared_type);\\n\\n return Err(ParserErrorKind::UnstructuredError {\\n\\n message,\\n\\n span: Span::default(),\\n\\n }); // XXX: We don't have spanning for types yet\\n\\n } else {\\n\\n default_type = declared_type;\\n\\n }\\n\\n }\\n\\n\\n\\n let stmt = ConstStatement {\\n\\n identifier: generic_stmt.identifier,\\n\\n r#type: default_type,\\n\\n expression: generic_stmt.rhs,\\n\\n };\\n\\n Ok(stmt)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/declaration.rs\",\n \"rank\": 3,\n \"score\": 353920.0604178479\n },\n {\n \"content\": \"fn parse_private_statement(parser: &mut Parser) -> Result<PrivateStatement, ParserErrorKind> {\\n\\n let generic_stmt = parse_generic_decl_statement(parser)?;\\n\\n\\n\\n // XXX: As of FieldElement refactor, we can catch basic type errors for private statements,\\n\\n // similar to the code for pub and const.\\n\\n //\\n\\n // This change may wait until, it is decided whether `let` will be the only declaration keyword.\\n\\n\\n\\n let stmt = PrivateStatement {\\n\\n identifier: generic_stmt.identifier,\\n\\n r#type: generic_stmt.typ.unwrap_or(Type::Unspecified),\\n\\n expression: generic_stmt.rhs,\\n\\n };\\n\\n Ok(stmt)\\n\\n}\\n\\n\\n\\n//XXX: Maybe do a second pass for invalid?\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::{parser::test_parse, token::Token};\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/declaration.rs\",\n \"rank\": 4,\n \"score\": 353920.0604178478\n },\n {\n \"content\": \"fn extract_ret_type(interner: &NodeInterner, stmt_id: &StmtId) -> Type {\\n\\n let stmt = interner.statement(stmt_id);\\n\\n match stmt {\\n\\n HirStatement::Let(_)\\n\\n | HirStatement::Const(_)\\n\\n | HirStatement::Private(_)\\n\\n // We could fetch the type here also for Semi\\n\\n // It would return Unit, as we modify the\\n\\n // return type in the interner after type checking it\\n\\n | HirStatement::Semi(_)\\n\\n | HirStatement::Assign(_)\\n\\n | HirStatement::Constrain(_) => Type::Unit,\\n\\n HirStatement::Expression(expr_id) => interner.id_type(&expr_id),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/expr.rs\",\n \"rank\": 5,\n \"score\": 347470.3434948877\n },\n {\n \"content\": \"fn token_to_binary_op(spanned_tok: &SpannedToken) -> Result<BinaryOp, ParserErrorKind> {\\n\\n let bin_op_kind: Option<BinaryOpKind> = spanned_tok.token().into();\\n\\n let bin_op_kind = bin_op_kind.ok_or(ParserErrorKind::TokenNotBinaryOp {\\n\\n spanned_token: spanned_tok.clone(),\\n\\n })?;\\n\\n Ok(Spanned::from(spanned_tok.to_span(), bin_op_kind))\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n\\n\\n use crate::parser::{dummy_expr, test_parse};\\n\\n\\n\\n use super::BinaryParser;\\n\\n\\n\\n #[test]\\n\\n fn valid_syntax() {\\n\\n let vectors = vec![\\\" + 6\\\", \\\" - k\\\", \\\" + (x + a)\\\", \\\" * (x + a) + (x - 4)\\\"];\\n\\n\\n\\n for src in vectors {\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/infix_parser/binary.rs\",\n \"rank\": 6,\n \"score\": 304773.0440491843\n },\n {\n \"content\": \"// Why is this here?\\n\\n// To avoid collecting after using the predicate method.\\n\\n// It allows the caller to filter or map further without paying the cost of a vector collect\\n\\n// The complexity is hidden in this method, as the caller will simply call .map() or an iterator method\\n\\n// to do further processing\\n\\n// I also note that the unreadability in my opinion, seems to come from the fact that we are using generics and lifetimes in PredicateResult\\n\\ntype Predicate<K, V> = fn(&(&K, &V)) -> bool;\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/scope/mod.rs\",\n \"rank\": 7,\n \"score\": 304583.9372524378\n },\n {\n \"content\": \"// This is exposed so that we can run the examples and verify that they pass\\n\\npub fn build_from_path<P: AsRef<Path>>(p: P) -> Result<(), CliError> {\\n\\n let mut driver = Resolver::resolve_root_config(p.as_ref())?;\\n\\n driver.build();\\n\\n // XXX: We can have a --overwrite flag to determine if you want to overwrite the Prover/Verifier.toml files\\n\\n if let Some(x) = driver.compute_abi() {\\n\\n // XXX: The root config should return an enum to determine if we are looking for .json or .toml\\n\\n // For now it is hard-coded to be toml.\\n\\n //\\n\\n // Check for input.toml and verifier.toml\\n\\n let path_to_root = PathBuf::from(p.as_ref());\\n\\n let path_to_prover_input = path_to_root.join(format!(\\\"{}.toml\\\", PROVER_INPUT_FILE));\\n\\n let path_to_verifier_input = path_to_root.join(format!(\\\"{}.toml\\\", VERIFIER_INPUT_FILE));\\n\\n\\n\\n // If they are not available, then create them and\\n\\n // populate them based on the ABI\\n\\n if !path_to_prover_input.exists() {\\n\\n let toml = toml::to_string(&x).unwrap();\\n\\n write_to_file(toml.as_bytes(), &path_to_prover_input);\\n\\n }\\n\\n if !path_to_verifier_input.exists() {\\n\",\n \"file_path\": \"crates/nargo/src/cli/build_cmd.rs\",\n \"rank\": 8,\n \"score\": 301482.0405697531\n },\n {\n \"content\": \"/// Parses a Nargo.toml file from it's path\\n\\n/// The path to the toml file must be present.\\n\\n/// Calling this function without this guarantee is an ICE.\\n\\npub fn parse<P: AsRef<Path>>(path_to_toml: P) -> Result<Config, CliError> {\\n\\n let toml_as_string =\\n\\n std::fs::read_to_string(&path_to_toml).expect(\\\"ice: path given for toml file is invalid\\\");\\n\\n\\n\\n match parse_toml_str(&toml_as_string) {\\n\\n Ok(cfg) => Ok(cfg),\\n\\n Err(msg) => {\\n\\n let path = path_to_toml.as_ref();\\n\\n Err(CliError::Generic(format!(\\n\\n \\\"{}\\\\n Location: {}\\\",\\n\\n msg,\\n\\n path.display()\\n\\n )))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/toml.rs\",\n \"rank\": 9,\n \"score\": 297799.770443591\n },\n {\n \"content\": \"fn lib_or_bin(current_path: &Path) -> Result<(PathBuf, CrateType), CliError> {\\n\\n // A library has a lib.nr and a binary has a main.nr\\n\\n // You cannot have both.\\n\\n let src_path = match fm::find_dir(current_path, \\\"src\\\") {\\n\\n Some(path) => path,\\n\\n None => {\\n\\n return Err(CliError::Generic(format!(\\n\\n \\\"cannot find src file in path {}\\\",\\n\\n current_path.display()\\n\\n )))\\n\\n }\\n\\n };\\n\\n let lib_nr_path = fm::find_file(&src_path, \\\"lib\\\", \\\"nr\\\");\\n\\n let bin_nr_path = fm::find_file(&src_path, \\\"main\\\", \\\"nr\\\");\\n\\n match (lib_nr_path, bin_nr_path) {\\n\\n (Some(_), Some(_)) => Err(CliError::Generic(\\n\\n \\\"package cannot contain both a `lib.nr` and a `main.nr`\\\".to_owned(),\\n\\n )),\\n\\n (None, Some(path)) => Ok((path, CrateType::Binary)),\\n\\n (Some(path), None) => Ok((path, CrateType::Library)),\\n\\n (None, None) => Err(CliError::Generic(\\n\\n \\\"package must contain either a `lib.nr`(Library) or a `main.nr`(Binary).\\\".to_owned(),\\n\\n )),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/nargo/src/lib.rs\",\n \"rank\": 10,\n \"score\": 297434.28767537465\n },\n {\n \"content\": \"// Given a binary operator and another type. This method will produce the\\n\\n// output type\\n\\n// XXX: Review these rules. In particular, the interaction between integers, constants and private/public variables\\n\\npub fn infix_operand_type_rules(\\n\\n lhs_type: &Type,\\n\\n op: &HirBinaryOp,\\n\\n other: &Type,\\n\\n) -> Result<Type, String> {\\n\\n if op.kind.is_comparator() {\\n\\n return Ok(Type::Bool);\\n\\n }\\n\\n\\n\\n match (lhs_type, other) {\\n\\n\\n\\n (Type::Integer(lhs_field_type,sign_x, bit_width_x), Type::Integer(rhs_field_type,sign_y, bit_width_y)) => {\\n\\n let field_type = field_type_rules(lhs_field_type, rhs_field_type);\\n\\n if sign_x != sign_y {\\n\\n return Err(format!(\\\"Integers must have the same signedness LHS is {:?}, RHS is {:?} \\\", sign_x, sign_y))\\n\\n }\\n\\n if bit_width_x != bit_width_y {\\n\\n return Err(format!(\\\"Integers must have the same bit width LHS is {}, RHS is {} \\\", bit_width_x, bit_width_y))\\n\\n }\\n\\n Ok(Type::Integer(field_type,*sign_x, *bit_width_x))\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/expr.rs\",\n \"rank\": 11,\n \"score\": 291841.5694655719\n },\n {\n \"content\": \"type PredicateResult<'r, K, V> = Filter<hash_map::Iter<'r, K, V>, Predicate<K, V>>;\\n\\n\\n\\nimpl<K: std::hash::Hash + Eq + Clone, V> Scope<K, V> {\\n\\n pub fn new() -> Self {\\n\\n Scope(HashMap::with_capacity(100))\\n\\n }\\n\\n\\n\\n pub fn find<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V>\\n\\n where\\n\\n K: std::borrow::Borrow<Q>,\\n\\n Q: std::hash::Hash + Eq,\\n\\n {\\n\\n self.0.get_mut(key)\\n\\n }\\n\\n pub fn occupied_key(&mut self, key: &K) -> Option<&K> {\\n\\n self.0.get_key_value(key).map(|(k, _)| k)\\n\\n }\\n\\n\\n\\n // From HashMap: If the map did not have this key present, None is returned.\\n\\n pub fn add_key_value(&mut self, key: K, value: V) -> Option<V> {\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/scope/mod.rs\",\n \"rank\": 12,\n \"score\": 291620.5189525783\n },\n {\n \"content\": \"fn create_dir<P: AsRef<Path>>(dir_path: P) -> Result<PathBuf, std::io::Error> {\\n\\n let mut dir = std::path::PathBuf::new();\\n\\n dir.push(dir_path);\\n\\n std::fs::create_dir_all(&dir)?;\\n\\n Ok(dir)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/cli/mod.rs\",\n \"rank\": 13,\n \"score\": 290389.5350271578\n },\n {\n \"content\": \"pub fn copy<U: AsRef<Path>, V: AsRef<Path>>(from: U, to: V) -> Result<(), std::io::Error> {\\n\\n let mut stack = vec![PathBuf::from(from.as_ref())];\\n\\n\\n\\n let output_root = PathBuf::from(to.as_ref());\\n\\n let input_root = PathBuf::from(from.as_ref()).components().count();\\n\\n\\n\\n while let Some(working_path) = stack.pop() {\\n\\n println!(\\\"process: {:?}\\\", &working_path);\\n\\n\\n\\n // Generate a relative path\\n\\n let src: PathBuf = working_path.components().skip(input_root).collect();\\n\\n\\n\\n // Create a destination if missing\\n\\n let dest = if src.components().count() == 0 {\\n\\n output_root.clone()\\n\\n } else {\\n\\n output_root.join(&src)\\n\\n };\\n\\n if fs::metadata(&dest).is_err() {\\n\\n println!(\\\" mkdir: {:?}\\\", dest);\\n\",\n \"file_path\": \"crates/std_lib/build.rs\",\n \"rank\": 14,\n \"score\": 282926.517468837\n },\n {\n \"content\": \"// helper function which tests noir programs by trying to generate a proof and verify it\\n\\npub fn prove_and_verify(proof_name: &str, prg_dir: &Path) -> bool {\\n\\n let tmp_dir = TempDir::new(\\\"p_and_v_tests\\\").unwrap();\\n\\n let proof_path =\\n\\n prove_cmd::prove_with_path(proof_name, prg_dir.to_path_buf(), tmp_dir.into_path()).unwrap();\\n\\n verify_cmd::verify_with_path(prg_dir, &proof_path).unwrap()\\n\\n}\\n\",\n \"file_path\": \"crates/nargo/src/cli/mod.rs\",\n \"rank\": 15,\n \"score\": 279530.0301534547\n },\n {\n \"content\": \"fn type_check_priv_stmt(\\n\\n interner: &mut NodeInterner,\\n\\n priv_stmt: HirPrivateStatement,\\n\\n) -> Result<(), TypeCheckError> {\\n\\n let resolved_type = type_check_declaration(interner, priv_stmt.expression, priv_stmt.r#type)?;\\n\\n\\n\\n // Check if this type can be used in a Private statement\\n\\n if !resolved_type.can_be_used_in_priv() {\\n\\n let span = interner.expr_span(&priv_stmt.expression);\\n\\n return Err(TypeCheckError::TypeCannotBeUsed {\\n\\n typ: resolved_type,\\n\\n place: \\\"private statement\\\",\\n\\n span,\\n\\n });\\n\\n }\\n\\n\\n\\n // Set the type of the identifier to be equal to the annotated type\\n\\n interner.push_ident_type(&priv_stmt.identifier, resolved_type);\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/stmt.rs\",\n \"rank\": 16,\n \"score\": 279385.5779486335\n },\n {\n \"content\": \"fn type_check_let_stmt(\\n\\n interner: &mut NodeInterner,\\n\\n let_stmt: HirLetStatement,\\n\\n) -> Result<(), TypeCheckError> {\\n\\n let resolved_type = type_check_declaration(interner, let_stmt.expression, let_stmt.r#type)?;\\n\\n\\n\\n // Check if this type can be used in a Let statement\\n\\n if !resolved_type.can_be_used_in_let() {\\n\\n let span = interner.expr_span(&let_stmt.expression);\\n\\n return Err(TypeCheckError::TypeCannotBeUsed {\\n\\n typ: resolved_type,\\n\\n place: \\\"let statement\\\",\\n\\n span,\\n\\n });\\n\\n }\\n\\n\\n\\n // Set the type of the identifier to be equal to the annotated type\\n\\n interner.push_ident_type(&let_stmt.identifier, resolved_type);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/stmt.rs\",\n \"rank\": 17,\n \"score\": 279380.4851302841\n },\n {\n \"content\": \"pub fn verify_with_path<P: AsRef<Path>>(program_dir: P, proof_path: P) -> Result<bool, CliError> {\\n\\n let driver = Resolver::resolve_root_config(program_dir.as_ref())?;\\n\\n let compiled_program = driver.into_compiled_program();\\n\\n let mut public_abi = compiled_program.abi.clone().unwrap().public_abi();\\n\\n add_dummy_setpub_arr(&mut public_abi);\\n\\n let num_pub_params = public_abi.num_parameters();\\n\\n let mut public_inputs = BTreeMap::new();\\n\\n if num_pub_params != 0 {\\n\\n let curr_dir = program_dir;\\n\\n public_inputs = noirc_abi::input_parser::Format::Toml.parse(curr_dir, VERIFIER_INPUT_FILE);\\n\\n }\\n\\n\\n\\n if num_pub_params != public_inputs.len() {\\n\\n panic!(\\n\\n \\\"Expected {} number of values, but got {} number of values\\\",\\n\\n num_pub_params,\\n\\n public_inputs.len()\\n\\n )\\n\\n }\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/cli/verify_cmd.rs\",\n \"rank\": 18,\n \"score\": 277858.52465565957\n },\n {\n \"content\": \"pub fn download_crs(mut path_to_transcript: std::path::PathBuf) {\\n\\n if path_to_transcript.exists() {\\n\\n println!(\\\"File already exists {:?}\\\", path_to_transcript);\\n\\n return;\\n\\n }\\n\\n // Pop off the transcript component to get just the directory\\n\\n path_to_transcript.pop();\\n\\n\\n\\n if !path_to_transcript.exists() {\\n\\n std::fs::create_dir_all(&path_to_transcript).unwrap();\\n\\n }\\n\\n\\n\\n let url = \\\"http://aztec-ignition.s3.amazonaws.com/MAIN%20IGNITION/sealed/transcript00.dat\\\";\\n\\n use downloader::Downloader;\\n\\n let mut downloader = Downloader::builder()\\n\\n .download_folder(path_to_transcript.as_path())\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n let dl = downloader::Download::new(url);\\n\\n let dl = dl.progress(SimpleReporter::create());\\n\\n let result = downloader.download(&[dl]).unwrap();\\n\\n\\n\\n for r in result {\\n\\n match r {\\n\\n Err(e) => println!(\\\"Error: {}\\\", e),\\n\\n Ok(s) => println!(\\\"\\\\nSRS is located at : {:?}\\\", &s.file_name),\\n\\n };\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/aztec_backend/src/barretenberg_rs/crs.rs\",\n \"rank\": 19,\n \"score\": 275241.4384772302\n },\n {\n \"content\": \"fn type_check_list_expression(\\n\\n interner: &mut NodeInterner,\\n\\n exprs: &[ExprId],\\n\\n) -> Result<(), TypeCheckError> {\\n\\n assert!(!exprs.is_empty());\\n\\n\\n\\n let (_, errors): (Vec<_>, Vec<_>) = exprs\\n\\n .iter()\\n\\n .map(|arg| type_check_expression(interner, arg))\\n\\n .partition(Result::is_ok);\\n\\n\\n\\n let errors: Vec<TypeCheckError> = errors.into_iter().map(Result::unwrap_err).collect();\\n\\n\\n\\n if !errors.is_empty() {\\n\\n return Err(TypeCheckError::MultipleErrors(errors));\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/expr.rs\",\n \"rank\": 20,\n \"score\": 268132.2161411844\n },\n {\n \"content\": \"fn resolve_path_name(import_directive: &ImportDirective) -> Ident {\\n\\n match &import_directive.alias {\\n\\n None => import_directive.path.segments.last().unwrap().clone(),\\n\\n Some(ident) => ident.clone(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/import.rs\",\n \"rank\": 21,\n \"score\": 267139.3140973748\n },\n {\n \"content\": \"/// Searches for the Nargo.toml file\\n\\n///\\n\\n/// XXX: In the end, this should find the root of the project and check\\n\\n/// for the Nargo.toml file there\\n\\n/// However, it should only do this after checking the current path\\n\\n/// This allows the use of workspace settings in the future.\\n\\nfn find_package_config(current_path: &Path) -> Result<PathBuf, CliError> {\\n\\n match fm::find_file(current_path, \\\"Nargo\\\", \\\"toml\\\") {\\n\\n Some(p) => Ok(p),\\n\\n None => {\\n\\n return Err(CliError::Generic(format!(\\n\\n \\\"cannot find a Nargo.toml in {}\\\",\\n\\n current_path.display()\\n\\n )))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/lib.rs\",\n \"rank\": 22,\n \"score\": 263259.2703601647\n },\n {\n \"content\": \"fn check_param_argument(\\n\\n interner: &NodeInterner,\\n\\n expr_id: ExprId,\\n\\n param: &Param,\\n\\n arg_type: &Type,\\n\\n) -> Result<(), TypeCheckError> {\\n\\n let param_type = ¶m.1;\\n\\n\\n\\n if arg_type.is_variable_sized_array() {\\n\\n unreachable!(\\\"arg type type cannot be a variable sized array. This is not supported.\\\")\\n\\n }\\n\\n\\n\\n if !param_type.is_super_type_of(arg_type) {\\n\\n let span = interner.expr_span(&expr_id);\\n\\n return Err(TypeCheckError::TypeMismatch {\\n\\n expected_typ: param_type.to_string(),\\n\\n expr_typ: arg_type.to_string(),\\n\\n expr_span: span,\\n\\n });\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/expr.rs\",\n \"rank\": 23,\n \"score\": 261506.5620595059\n },\n {\n \"content\": \"fn field_type_rules(lhs: &FieldElementType, rhs: &FieldElementType) -> FieldElementType {\\n\\n match (lhs, rhs) {\\n\\n (FieldElementType::Private, FieldElementType::Private) => FieldElementType::Private,\\n\\n (FieldElementType::Private, FieldElementType::Public) => FieldElementType::Private,\\n\\n (FieldElementType::Private, FieldElementType::Constant) => FieldElementType::Private,\\n\\n (FieldElementType::Public, FieldElementType::Private) => FieldElementType::Private,\\n\\n (FieldElementType::Public, FieldElementType::Public) => FieldElementType::Public,\\n\\n (FieldElementType::Public, FieldElementType::Constant) => FieldElementType::Public,\\n\\n (FieldElementType::Constant, FieldElementType::Private) => FieldElementType::Private,\\n\\n (FieldElementType::Constant, FieldElementType::Public) => FieldElementType::Public,\\n\\n (FieldElementType::Constant, FieldElementType::Constant) => FieldElementType::Constant,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/expr.rs\",\n \"rank\": 24,\n \"score\": 258819.93252027722\n },\n {\n \"content\": \"pub fn sha256(initial_witness: &mut BTreeMap<Witness, FieldElement>, gadget_call: &GadgetCall) {\\n\\n generic_hash_256::<Sha256>(initial_witness, gadget_call)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/acvm/src/pwg/hash/mod.rs\",\n \"rank\": 25,\n \"score\": 252602.5395040831\n },\n {\n \"content\": \"pub fn blake2s(initial_witness: &mut BTreeMap<Witness, FieldElement>, gadget_call: &GadgetCall) {\\n\\n generic_hash_256::<Blake2s>(initial_witness, gadget_call)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/acvm/src/pwg/hash/mod.rs\",\n \"rank\": 26,\n \"score\": 252602.5395040831\n },\n {\n \"content\": \"// Resolve `foo::bar` in foo::bar::call() to the module with the function\\n\\npub fn resolve_function_call_path(\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n module_id: ModuleId,\\n\\n path: Path,\\n\\n) -> Result<Option<ModuleDefId>, Ident> {\\n\\n // lets package up the path into an ImportDirective and resolve it using that\\n\\n let import = ImportDirective {\\n\\n module_id: module_id.local_id,\\n\\n path,\\n\\n alias: None,\\n\\n };\\n\\n\\n\\n let def_map = &def_maps[&module_id.krate];\\n\\n let path_res = resolve_path_to_ns(&import, def_map, def_maps);\\n\\n let ns = match path_res {\\n\\n PathResolution::Unresolved(seg) => return Err(seg),\\n\\n PathResolution::Resolved(ns) => ns,\\n\\n };\\n\\n\\n\\n // XXX: Note that we are returning the value and not a type.\\n\\n // In the future we can generalise and return a PerNs\\n\\n // Which the Resolver will then deal with\\n\\n // For now, since this is used only for function call paths, it is fine\\n\\n Ok(ns.take_values())\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/path_resolver.rs\",\n \"rank\": 27,\n \"score\": 252328.7799514149\n },\n {\n \"content\": \"pub fn flatten_path(path: Vec<(FieldElement, FieldElement)>) -> Vec<FieldElement> {\\n\\n path.into_iter()\\n\\n .flat_map(|(left, right)| std::iter::once(left).chain(std::iter::once(right)))\\n\\n .collect()\\n\\n}\\n\\n\\n\\npub struct MerkleTree {\\n\\n depth: u32,\\n\\n total_size: u32,\\n\\n db: sled::Db,\\n\\n barretenberg: Barretenberg,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/acvm/src/backends/csat_3_plonk_aztec/pwg/merkle.rs\",\n \"rank\": 28,\n \"score\": 251094.6960172358\n },\n {\n \"content\": \"type ParserStmtResult = ParserResult<Statement>;\\n\\n\\n\\n// XXX: We can probably abstract the lexer away, as we really only need an Iterator of Tokens/ TokenStream\\n\\n// XXX: Alternatively can make Lexer take a Reader, but will need to do a Bytes -> to char conversion. Can just return an error if cannot do conversion\\n\\n// As this should not be leaked to any other part of the lib\\n\\npub struct Parser<'a> {\\n\\n pub(crate) lexer: Lexer<'a>,\\n\\n pub(crate) curr_token: SpannedToken,\\n\\n pub(crate) peek_token: SpannedToken,\\n\\n pub(crate) errors: Vec<ParserErrorKind>,\\n\\n}\\n\\n\\n\\nimpl<'a> Parser<'a> {\\n\\n pub fn new(mut lexer: Lexer<'a>) -> Self {\\n\\n let curr_token = lexer.next_token().unwrap();\\n\\n let peek_token = lexer.next_token().unwrap();\\n\\n\\n\\n Parser {\\n\\n lexer,\\n\\n curr_token,\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/parser.rs\",\n \"rank\": 29,\n \"score\": 249300.25700645035\n },\n {\n \"content\": \"pub fn resolve_path_to_ns(\\n\\n import_directive: &ImportDirective,\\n\\n def_map: &CrateDefMap,\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n) -> PathResolution {\\n\\n let import_path = &import_directive.path.segments;\\n\\n\\n\\n match import_directive.path.kind {\\n\\n crate::ast::PathKind::Crate => {\\n\\n // Resolve from the root of the crate\\n\\n resolve_path_from_crate_root(def_map, import_path, def_maps)\\n\\n }\\n\\n crate::ast::PathKind::Dep => resolve_external_dep(def_map, import_directive, def_maps),\\n\\n crate::ast::PathKind::Plain => {\\n\\n // Plain paths are only used to import children modules. It's possible to allow import of external deps, but maybe this distinction is better?\\n\\n // In Rust they can also point to external Dependencies, if no children can be found with the specified name\\n\\n resolve_name_in_module(def_map, import_path, import_directive.module_id, def_maps)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/import.rs\",\n \"rank\": 30,\n \"score\": 248086.1662363446\n },\n {\n \"content\": \"// Looks for directory named `dir_name` in path\\n\\npub fn find_dir<P: AsRef<Path>>(path: P, dir_name: &str) -> Option<PathBuf> {\\n\\n let entries = list_files_and_folders_in(path)?;\\n\\n find_artifact(entries, dir_name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/fm/src/util.rs\",\n \"rank\": 31,\n \"score\": 247701.84854832626\n },\n {\n \"content\": \"/// Given a FileId, fetch the File, from the FileManager and parse it's content\\n\\npub fn parse_file(\\n\\n fm: &mut FileManager,\\n\\n file_id: FileId,\\n\\n) -> Result<ParsedModule, Vec<CollectedErrors>> {\\n\\n let file = fm.fetch_file(file_id);\\n\\n let mut parser = Parser::from_src(file.get_source());\\n\\n match parser.parse_program() {\\n\\n Ok(prog) => Ok(prog),\\n\\n Err(errs) => {\\n\\n let file_errs = CollectedErrors {\\n\\n file_id,\\n\\n errors: errs.iter().map(|err| err.to_diagnostic()).collect(),\\n\\n };\\n\\n\\n\\n Err(vec![file_errs])\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::ops::Index<LocalModuleId> for CrateDefMap {\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/def_map/mod.rs\",\n \"rank\": 32,\n \"score\": 247386.6045782733\n },\n {\n \"content\": \"fn span_parser(\\n\\n parser: &mut Parser,\\n\\n left: Expression,\\n\\n f: fn(parser: &mut Parser, left: Expression) -> ParserExprKindResult,\\n\\n) -> ParserExprResult {\\n\\n let start = parser.curr_token.to_span();\\n\\n let kind = f(parser, left)?;\\n\\n let end = parser.curr_token.to_span();\\n\\n\\n\\n Ok(Expression {\\n\\n kind,\\n\\n span: start.merge(end),\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/infix_parser/mod.rs\",\n \"rank\": 33,\n \"score\": 239066.18733962084\n },\n {\n \"content\": \"fn span_parser(\\n\\n parser: &mut Parser,\\n\\n f: fn(parser: &mut Parser) -> ParserExprKindResult,\\n\\n) -> ParserExprResult {\\n\\n let start = parser.curr_token.to_span();\\n\\n let kind = f(parser)?;\\n\\n let end = parser.curr_token.to_span();\\n\\n\\n\\n Ok(Expression {\\n\\n kind,\\n\\n span: start.merge(end),\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/mod.rs\",\n \"rank\": 34,\n \"score\": 239066.18733962084\n },\n {\n \"content\": \"fn type_check_assign_stmt(\\n\\n interner: &mut NodeInterner,\\n\\n assign_stmt: HirAssignStatement,\\n\\n) -> Result<(), TypeCheckError> {\\n\\n // To get the type of the identifier, we need to get the identifier which defined it\\n\\n // once a variable has a type, it cannot be changed\\n\\n let ident_def = interner\\n\\n .ident_def(&assign_stmt.identifier)\\n\\n .expect(\\\"all identifiers that define a variable, should have a type during type checking\\\");\\n\\n let identifier_type = interner.id_type(&ident_def);\\n\\n\\n\\n type_check_expression(interner, &assign_stmt.expression)?;\\n\\n let expr_type = interner.id_type(&assign_stmt.expression);\\n\\n\\n\\n if expr_type != identifier_type {\\n\\n let expr_span = interner.expr_span(&assign_stmt.expression);\\n\\n return Err(TypeCheckError::TypeMismatch {\\n\\n expected_typ: identifier_type.to_string(),\\n\\n expr_typ: expr_type.to_string(),\\n\\n expr_span,\\n\\n });\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/stmt.rs\",\n \"rank\": 35,\n \"score\": 238605.28866453076\n },\n {\n \"content\": \"fn type_check_constrain_stmt(\\n\\n interner: &mut NodeInterner,\\n\\n stmt: HirConstrainStatement,\\n\\n) -> Result<(), TypeCheckError> {\\n\\n type_check_expression(interner, &stmt.0.lhs)?;\\n\\n let lhs_type = interner.id_type(stmt.0.lhs);\\n\\n\\n\\n type_check_expression(interner, &stmt.0.rhs)?;\\n\\n let rhs_type = interner.id_type(&stmt.0.rhs);\\n\\n\\n\\n // Since constrain statements are not expressions, we do not allow predicate or non-comparison binary operators\\n\\n if !stmt.0.operator.kind.is_comparator() {\\n\\n let span = stmt.0.operator.span;\\n\\n let err = TypeCheckError::OpCannotBeUsed {\\n\\n op: stmt.0.operator,\\n\\n place: \\\"constrain statement\\\",\\n\\n span,\\n\\n };\\n\\n let err = err\\n\\n .add_context(\\\"only comparison operators can be used in a constrain statement\\\")\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/stmt.rs\",\n \"rank\": 36,\n \"score\": 238605.28866453076\n },\n {\n \"content\": \"fn type_check_const_stmt(\\n\\n interner: &mut NodeInterner,\\n\\n const_stmt: HirConstStatement,\\n\\n) -> Result<(), TypeCheckError> {\\n\\n // XXX: It may not make sense to have annotations for const statements, since they can only have one type\\n\\n // Unless we later want to have u32 constants and check those at compile time.\\n\\n let resolved_type = type_check_declaration(interner, const_stmt.expression, const_stmt.r#type)?;\\n\\n\\n\\n if resolved_type != Type::CONSTANT {\\n\\n let span = interner.expr_span(&const_stmt.expression);\\n\\n let mut err = TypeCheckError::TypeCannotBeUsed {\\n\\n typ: resolved_type,\\n\\n place: \\\"constant statement\\\",\\n\\n span,\\n\\n };\\n\\n err = err\\n\\n .add_context(\\\"constant statements can only contain constant types\\\")\\n\\n .unwrap();\\n\\n return Err(err);\\n\\n }\\n\\n\\n\\n interner.push_ident_type(&const_stmt.identifier, resolved_type);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/stmt.rs\",\n \"rank\": 37,\n \"score\": 238605.28866453076\n },\n {\n \"content\": \"// Looks for file named `file_name` in path\\n\\npub fn find_file<P: AsRef<Path>>(path: P, file_name: &str, extension: &str) -> Option<PathBuf> {\\n\\n let entries = list_files_and_folders_in(path)?;\\n\\n\\n\\n let mut file_name = file_name.to_owned();\\n\\n file_name.push('.');\\n\\n file_name.push_str(extension);\\n\\n\\n\\n find_artifact(entries, &file_name)\\n\\n}\\n\",\n \"file_path\": \"crates/fm/src/util.rs\",\n \"rank\": 38,\n \"score\": 238001.80184592505\n },\n {\n \"content\": \"/// XXX: I'd prefer to use a GitHub library however, there\\n\\n/// does not seem to be an easy way to download a repo at a specific\\n\\n/// tag\\n\\n/// github-rs looks promising, however it seems to require an API token\\n\\n///\\n\\n/// One advantage of using \\\"git clone\\\" is that there is effectively no rate limit\\n\\npub fn clone_git_repo(url: &str, tag: &str) -> Result<PathBuf, String> {\\n\\n use std::process::Command;\\n\\n\\n\\n let base = match url::Url::parse(url) {\\n\\n Ok(base) => base,\\n\\n Err(err) => return Err(err.to_string()),\\n\\n };\\n\\n\\n\\n let loc = git_dep_location(&base, tag);\\n\\n if loc.exists() {\\n\\n return Ok(loc);\\n\\n }\\n\\n\\n\\n Command::new(\\\"git\\\")\\n\\n .arg(\\\"-c\\\")\\n\\n .arg(\\\"advice.detachedHead=false\\\")\\n\\n .arg(\\\"clone\\\")\\n\\n .arg(\\\"--depth\\\")\\n\\n .arg(\\\"1\\\")\\n\\n .arg(\\\"--branch\\\")\\n\\n .arg(&tag)\\n\\n .arg(base.as_str())\\n\\n .arg(&loc)\\n\\n .status()\\n\\n .expect(\\\"git clone command failed to start\\\");\\n\\n\\n\\n Ok(loc)\\n\\n}\\n\",\n \"file_path\": \"crates/nargo/src/git.rs\",\n \"rank\": 39,\n \"score\": 232349.041751971\n },\n {\n \"content\": \"fn prove(proof_name: &str) -> Result<(), CliError> {\\n\\n let curr_dir = std::env::current_dir().unwrap();\\n\\n let mut proof_path = PathBuf::new();\\n\\n proof_path.push(PROOFS_DIR);\\n\\n let result = prove_with_path(proof_name, curr_dir, proof_path);\\n\\n match result {\\n\\n Ok(_) => Ok(()),\\n\\n Err(e) => Err(e),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/cli/prove_cmd.rs\",\n \"rank\": 40,\n \"score\": 232220.68125499878\n },\n {\n \"content\": \"/// All declaration statements check that the user specified type(UST) is equal to the\\n\\n/// expression on the RHS, unless the UST is unspecified\\n\\n/// In that case, the UST because the expression\\n\\nfn type_check_declaration(\\n\\n interner: &mut NodeInterner,\\n\\n rhs_expr: ExprId,\\n\\n mut annotated_type: Type,\\n\\n) -> Result<Type, TypeCheckError> {\\n\\n // Type check the expression on the RHS\\n\\n type_check_expression(interner, &rhs_expr)?;\\n\\n let expr_type = interner.id_type(&rhs_expr);\\n\\n\\n\\n // First check if the LHS is unspecified\\n\\n // If so, then we give it the same type as the expression\\n\\n if annotated_type == Type::Unspecified {\\n\\n annotated_type = expr_type.clone();\\n\\n };\\n\\n\\n\\n // Now check if LHS is the same type as the RHS\\n\\n // Importantly, we do not co-erce any types implicitly\\n\\n if annotated_type != expr_type {\\n\\n let expr_span = interner.expr_span(&rhs_expr);\\n\\n return Err(TypeCheckError::TypeMismatch {\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/type_check/stmt.rs\",\n \"rank\": 41,\n \"score\": 230898.4495789327\n },\n {\n \"content\": \"pub fn prove_with_path<P: AsRef<Path>>(\\n\\n proof_name: &str,\\n\\n program_dir: P,\\n\\n proof_dir: P,\\n\\n) -> Result<PathBuf, CliError> {\\n\\n let driver = Resolver::resolve_root_config(program_dir.as_ref())?;\\n\\n let compiled_program = driver.into_compiled_program();\\n\\n\\n\\n // Parse the initial witness values\\n\\n let witness_map = noirc_abi::input_parser::Format::Toml.parse(program_dir, PROVER_INPUT_FILE);\\n\\n\\n\\n // Check that enough witness values were supplied\\n\\n let num_params = compiled_program.abi.as_ref().unwrap().num_parameters();\\n\\n if num_params != witness_map.len() {\\n\\n panic!(\\n\\n \\\"Expected {} number of values, but got {} number of values\\\",\\n\\n num_params,\\n\\n witness_map.len()\\n\\n )\\n\\n }\\n\",\n \"file_path\": \"crates/nargo/src/cli/prove_cmd.rs\",\n \"rank\": 42,\n \"score\": 230052.26270795625\n },\n {\n \"content\": \"/// Takes a path to a noir file. This will panic on paths to directories\\n\\n/// Returns\\n\\n/// For Normal filetypes, given \\\"src/mod.nr\\\" this method returns \\\"src/mod\\\"\\n\\n/// For Root filetypes, given \\\"src/mod.nr\\\" this method returns \\\"src\\\"\\n\\nfn virtualise_path(path: &Path, file_type: FileType) -> VirtualPath {\\n\\n let mut path = path.to_path_buf();\\n\\n let path = match file_type {\\n\\n FileType::Root => {\\n\\n path.pop();\\n\\n path\\n\\n }\\n\\n FileType::Normal => {\\n\\n let base = path.parent().unwrap();\\n\\n let path_no_ext: PathBuf = path\\n\\n .file_stem()\\n\\n .expect(\\\"ice: this should have been the path to a file\\\")\\n\\n .into();\\n\\n base.join(path_no_ext)\\n\\n }\\n\\n };\\n\\n VirtualPath(path)\\n\\n}\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\",\n \"file_path\": \"crates/fm/src/lib.rs\",\n \"rank\": 43,\n \"score\": 226737.7830481545\n },\n {\n \"content\": \"fn verify(proof_name: &str) -> Result<bool, CliError> {\\n\\n let curr_dir = std::env::current_dir().unwrap();\\n\\n let mut proof_path = PathBuf::new(); //or cur_dir?\\n\\n proof_path.push(PROOFS_DIR);\\n\\n proof_path.push(Path::new(proof_name));\\n\\n proof_path.set_extension(PROOF_EXT);\\n\\n verify_with_path(&curr_dir, &proof_path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/cli/verify_cmd.rs\",\n \"rank\": 44,\n \"score\": 226125.01396386957\n },\n {\n \"content\": \"fn handle_cannot_add(typ: &'static str) -> RuntimeErrorKind {\\n\\n RuntimeErrorKind::UnstructuredError {\\n\\n message: format!(\\\"{} cannot be used in an addition\\\", typ),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/add.rs\",\n \"rank\": 45,\n \"score\": 226114.4173686682\n },\n {\n \"content\": \"/// For now we disallow statement of the form `constrain x / y` as their meaning is a bit ambiguous\\n\\n/// In the future, if the user inputs a disallowed operator, we may modify the AST so that it's RHS is `== 0`\\n\\n///\\n\\n/// We could also do it for the other expressions:\\n\\n///\\n\\n/// Example : `constrain x` becomes `constrain x == 0`\\n\\n///\\n\\n/// Example : `constrain x / y` becomes `constrain x/y == 0`\\n\\n///\\n\\n///\\n\\n/// XXX: Although explicitness is preferred, in this case it seems that since we will always be adding a `== 0`\\n\\n/// it may be fine. Since this change is backwards compatible, it is not necessary to make an eager decision without\\n\\n/// more case study.\\n\\nfn disallowed_operators() -> Vec<BinaryOpKind> {\\n\\n vec![\\n\\n BinaryOpKind::And,\\n\\n BinaryOpKind::Or,\\n\\n BinaryOpKind::Divide,\\n\\n BinaryOpKind::Multiply,\\n\\n ]\\n\\n}\\n\\n\\n\\n/// Parses statements of the form\\n\\n/// - constrain <EXPR> OP <EXPR>\\n\\n///\\n\\n/// Cursor Start : `constrain`\\n\\n///\\n\\n/// Cursor End : `;`\\n\\nimpl ConstrainParser {\\n\\n // Since == is an infix operator\\n\\n // The pratt parser will do most of the job, we just need to check that everything was correct\\n\\n pub(crate) fn parse_statement(\\n\\n parser: &mut Parser,\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/constrain.rs\",\n \"rank\": 46,\n \"score\": 217549.99003733354\n },\n {\n \"content\": \"pub fn start_cli() {\\n\\n let matches = App::new(\\\"nargo\\\")\\n\\n .about(\\\"Noir's package manager\\\")\\n\\n .version(\\\"0.1\\\")\\n\\n .author(\\\"Kevaundray Wedderburn <kevtheappdev@gmail.com>\\\")\\n\\n .subcommand(App::new(\\\"build\\\").about(\\\"Builds the constraint system\\\"))\\n\\n .subcommand(App::new(\\\"contract\\\").about(\\\"Creates the smart contract code for circuit\\\"))\\n\\n .subcommand(\\n\\n App::new(\\\"new\\\")\\n\\n .about(\\\"Create a new binary project\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"package_name\\\")\\n\\n .help(\\\"Name of the package\\\")\\n\\n .required(true),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"path\\\")\\n\\n .help(\\\"The path to save the new project\\\")\\n\\n .required(false),\\n\\n ),\\n\",\n \"file_path\": \"crates/nargo/src/cli/mod.rs\",\n \"rank\": 47,\n \"score\": 215850.9620573271\n },\n {\n \"content\": \"fn mod_cache_location() -> std::path::PathBuf {\\n\\n let mut mod_cache_dir = dirs::home_dir().unwrap();\\n\\n mod_cache_dir.push(std::path::Path::new(\\\"noir_cache\\\"));\\n\\n mod_cache_dir.push(std::path::Path::new(\\\"barretenberg_module_cache\\\"));\\n\\n mod_cache_dir\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/aztec_backend/src/barretenberg_rs/mod.rs\",\n \"rank\": 48,\n \"score\": 214447.99118319407\n },\n {\n \"content\": \"pub fn add_dummy_setpub_arr(abi: &mut Abi) {\\n\\n // Add a dummy setpub array\\n\\n // This method is used so that an empty \\\"setpub\\\" array is created in the verifier.toml\\n\\n // and also so that when the verifier searches for public inputs,\\n\\n // they also search for this \\\"setpub\\\"\\n\\n let dummy_arr = AbiType::Array {\\n\\n visibility: AbiFEType::Private,\\n\\n length: 0,\\n\\n typ: Box::new(AbiType::Field(AbiFEType::Private)),\\n\\n };\\n\\n // setpub is a keyword in Noir, so it cannot be used as a field name\\n\\n // ensuring there will be no conflicts\\n\\n abi.parameters.push((RESERVED_PUBLIC_ARR.into(), dummy_arr));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/cli/verify_cmd.rs\",\n \"rank\": 49,\n \"score\": 213896.98734847674\n },\n {\n \"content\": \"pub fn call_builtin(\\n\\n evaluator: &mut Evaluator,\\n\\n env: &mut Environment,\\n\\n builtin_name: &str,\\n\\n call_expr_span: (HirCallExpression, Span),\\n\\n) -> Result<Object, RuntimeError> {\\n\\n let (call_expr, span) = call_expr_span;\\n\\n let func = match BuiltInFunctions::look_up_func_name(builtin_name) {\\n\\n None => {\\n\\n let message = format!(\\n\\n \\\"cannot find a builtin function with the attribute name {}\\\",\\n\\n builtin_name\\n\\n );\\n\\n return Err(RuntimeErrorKind::UnstructuredError { message }.add_span(span));\\n\\n }\\n\\n Some(func) => func,\\n\\n };\\n\\n\\n\\n match func {\\n\\n BuiltInFunctions::ArraySum => ArraySum::call(evaluator, env, (call_expr, span)),\\n\\n BuiltInFunctions::ArrayProd => ArrayProd::call(evaluator, env, (call_expr, span)),\\n\\n BuiltInFunctions::SetPub => SetPub::call(evaluator, env, (call_expr, span)),\\n\\n BuiltInFunctions::PowConst => PowConst::call(evaluator, env, (call_expr, span)),\\n\\n BuiltInFunctions::PredEq => PredicateEq::call(evaluator, env, (call_expr, span)),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/builtin/mod.rs\",\n \"rank\": 50,\n \"score\": 212714.1895897505\n },\n {\n \"content\": \"pub fn input_to_value<'a>(\\n\\n witness_map: &'a BTreeMap<Witness, FieldElement>,\\n\\n input: &GadgetInput,\\n\\n) -> &'a FieldElement {\\n\\n match witness_map.get(&input.witness) {\\n\\n None => panic!(\\\"Cannot find witness assignment for {:?}\\\", input),\\n\\n Some(assignment) => assignment,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/acvm/src/pwg/mod.rs\",\n \"rank\": 51,\n \"score\": 211721.23264755544\n },\n {\n \"content\": \"fn write_to_file(bytes: &[u8], path: &Path) -> String {\\n\\n let display = path.display();\\n\\n\\n\\n let mut file = match File::create(&path) {\\n\\n Err(why) => panic!(\\\"couldn't create {}: {}\\\", display, why),\\n\\n Ok(file) => file,\\n\\n };\\n\\n\\n\\n match file.write_all(bytes) {\\n\\n Err(why) => panic!(\\\"couldn't write to {}: {}\\\", display, why),\\n\\n Ok(_) => display.to_string(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/cli/mod.rs\",\n \"rank\": 52,\n \"score\": 211555.25458794017\n },\n {\n \"content\": \"/// Returns 1 if a == b else 0\\n\\npub fn maybe_equal(\\n\\n a: Object,\\n\\n b: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Integer, RuntimeErrorKind> {\\n\\n const ICE_STR: &str = \\\"ice: this method should only be called for arithmetic gates\\\";\\n\\n let a_arith = a.to_arithmetic().expect(ICE_STR);\\n\\n let b_arith = b.to_arithmetic().expect(ICE_STR);\\n\\n\\n\\n // u = a - b\\n\\n let a_minus_b = &a_arith - &b_arith;\\n\\n let (_, u_wit) = evaluator.create_intermediate_variable(a_minus_b);\\n\\n\\n\\n // z = 1/u => uz = 1\\n\\n let z = evaluator.add_witness_to_cs();\\n\\n evaluator.gates.push(Gate::Directive(Directive::Invert {\\n\\n x: u_wit,\\n\\n result: z,\\n\\n }));\\n\\n\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/mod.rs\",\n \"rank\": 53,\n \"score\": 209702.8206392128\n },\n {\n \"content\": \"pub fn resolve_imports(\\n\\n crate_id: CrateId,\\n\\n imports_to_resolve: Vec<ImportDirective>,\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n) -> (Vec<ImportDirective>, Vec<ResolvedImport>) {\\n\\n let num_imports = imports_to_resolve.len();\\n\\n let def_map = &def_maps[&crate_id];\\n\\n\\n\\n let mut unresolved: Vec<ImportDirective> = Vec::new();\\n\\n let mut resolved: Vec<ResolvedImport> = Vec::new();\\n\\n for import_directive in imports_to_resolve {\\n\\n let defs = resolve_path_to_ns(&import_directive, def_map, def_maps);\\n\\n\\n\\n // Once we have the Option<defs>\\n\\n // resolve name and push into appropriate vector\\n\\n match defs {\\n\\n PathResolution::Unresolved(_) => {\\n\\n unresolved.push(import_directive);\\n\\n }\\n\\n PathResolution::Resolved(resolved_namespace) => {\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/import.rs\",\n \"rank\": 54,\n \"score\": 209648.30882031517\n },\n {\n \"content\": \"// Remove all terms with zero as a coefficient\\n\\npub fn remove_zero_coefficients(mut gate: Arithmetic) -> Arithmetic {\\n\\n // Check the mul terms\\n\\n gate.mul_terms = gate\\n\\n .mul_terms\\n\\n .into_iter()\\n\\n .filter(|(scale, _, _)| !scale.is_zero())\\n\\n .collect();\\n\\n\\n\\n // Check the linear combination terms\\n\\n gate.linear_combinations = gate\\n\\n .linear_combinations\\n\\n .into_iter()\\n\\n .filter(|(scale, _)| !scale.is_zero())\\n\\n .collect();\\n\\n\\n\\n gate\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/acir/src/optimiser/general_optimiser.rs\",\n \"rank\": 55,\n \"score\": 209644.02784589372\n },\n {\n \"content\": \"// Simplifies all mul terms with the same bi-variate variables\\n\\npub fn simplify_mul_terms(mut gate: Arithmetic) -> Arithmetic {\\n\\n let mut hash_map: IndexMap<(Witness, Witness), FieldElement> = IndexMap::new();\\n\\n\\n\\n // Canonicalise the ordering of the multiplication, lets just order by variable name\\n\\n for (scale, w_l, w_r) in gate.mul_terms.clone().into_iter() {\\n\\n let mut pair = vec![w_l, w_r];\\n\\n // Sort using rust sort algorithm\\n\\n pair.sort();\\n\\n\\n\\n *hash_map\\n\\n .entry((pair[0], pair[1]))\\n\\n .or_insert_with(FieldElement::zero) += scale;\\n\\n }\\n\\n\\n\\n gate.mul_terms = hash_map\\n\\n .into_iter()\\n\\n .map(|((w_l, w_r), scale)| (scale, w_l, w_r))\\n\\n .collect();\\n\\n\\n\\n gate\\n\\n}\\n\",\n \"file_path\": \"crates/acir/src/optimiser/general_optimiser.rs\",\n \"rank\": 56,\n \"score\": 209644.02784589372\n },\n {\n \"content\": \"/// Checks the token and returns the identifier along with the path kind\\n\\n/// only plain paths return identifiers, as the other path kinds implicitly\\n\\n/// contain the keyword used.\\n\\nfn path_identifer(\\n\\n tok: &crate::token::SpannedToken,\\n\\n) -> Result<(Option<Ident>, PathKind), ParserErrorKind> {\\n\\n use noirc_errors::Spanned;\\n\\n match tok.token() {\\n\\n Token::Ident(x) => Ok((\\n\\n Some(Spanned::from(tok.to_span(), x.to_owned()).into()),\\n\\n PathKind::Plain,\\n\\n )),\\n\\n Token::Keyword(Keyword::Crate) => Ok((None, PathKind::Crate)),\\n\\n Token::Keyword(Keyword::Dep) => Ok((None, PathKind::Dep)),\\n\\n _ => {\\n\\n return Err(ParserErrorKind::UnstructuredError {\\n\\n span: tok.to_span(),\\n\\n message: format!(\\n\\n \\\"expected an identifier, `dep` or `crate`. Found {} \\\",\\n\\n tok.token()\\n\\n ),\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/path.rs\",\n \"rank\": 57,\n \"score\": 203395.46738335898\n },\n {\n \"content\": \"pub fn call_low_level(\\n\\n evaluator: &mut Evaluator,\\n\\n env: &mut Environment,\\n\\n opcode_name: &str,\\n\\n call_expr_span: (HirCallExpression, Span),\\n\\n) -> Result<Object, RuntimeError> {\\n\\n let (call_expr, span) = call_expr_span;\\n\\n let func = match OPCODE::lookup(opcode_name) {\\n\\n None => {\\n\\n let message = format!(\\n\\n \\\"cannot find a low level opcode with the name {} in the IR\\\",\\n\\n opcode_name\\n\\n );\\n\\n\\n\\n return Err(RuntimeErrorKind::UnstructuredError { message }.add_span(span));\\n\\n }\\n\\n\\n\\n Some(func) => func,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/low_level_function_impl/mod.rs\",\n \"rank\": 58,\n \"score\": 201303.30894341978\n },\n {\n \"content\": \"fn err_cannot_mul(first_type: &'static str, second_type: &'static str) -> RuntimeErrorKind {\\n\\n RuntimeErrorKind::UnsupportedOp {\\n\\n op: \\\"mul\\\".to_owned(),\\n\\n first_type: first_type.to_owned(),\\n\\n second_type: second_type.to_owned(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/mul.rs\",\n \"rank\": 59,\n \"score\": 194135.19367558762\n },\n {\n \"content\": \"pub trait PathResolver {\\n\\n fn resolve(\\n\\n &self,\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n path: Path,\\n\\n ) -> Result<Option<ModuleDefId>, Ident>;\\n\\n}\\n\\n\\n\\npub struct FunctionPathResolver {\\n\\n // Module that we are resolving the path in\\n\\n module_id: ModuleId,\\n\\n}\\n\\n\\n\\nimpl FunctionPathResolver {\\n\\n pub fn new(module_id: ModuleId) -> FunctionPathResolver {\\n\\n Self { module_id }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PathResolver for FunctionPathResolver {\\n\\n fn resolve(\\n\\n &self,\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n path: Path,\\n\\n ) -> Result<Option<ModuleDefId>, Ident> {\\n\\n resolve_function_call_path(def_maps, self.module_id, path)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/path_resolver.rs\",\n \"rank\": 60,\n \"score\": 193176.8350159026\n },\n {\n \"content\": \"/// Parses the initial Witness Values that are needed to seed the\\n\\n/// Partial Witness generator\\n\\npub trait InitialWitnessParser {\\n\\n fn parse_initial_witness<P: AsRef<Path>>(&self, path: P) -> BTreeMap<String, InputValue>;\\n\\n}\\n\\n\\n\\n/// The different formats that are supported when parsing\\n\\n/// the initial witness values\\n\\npub enum Format {\\n\\n Toml,\\n\\n}\\n\\n\\n\\nimpl Format {\\n\\n pub fn ext(&self) -> &'static str {\\n\\n match self {\\n\\n Format::Toml => \\\"toml\\\",\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Format {\\n\\n pub fn parse<P: AsRef<Path>>(&self, path: P, file_name: &str) -> BTreeMap<String, InputValue> {\\n\",\n \"file_path\": \"crates/noirc_abi/src/input_parser/mod.rs\",\n \"rank\": 61,\n \"score\": 192487.70120889772\n },\n {\n \"content\": \"// We use lib.rs to lean on Rusts build system, but we do not want it or any other rust files to be copied\\n\\nfn is_rs_file(src: &Path) -> bool {\\n\\n // assert_eq!(\\\"rs\\\", path.extension().unwrap());\\n\\n match src.extension() {\\n\\n Some(ext) => ext == \\\"rs\\\",\\n\\n None => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/std_lib/build.rs\",\n \"rank\": 62,\n \"score\": 191030.25966163096\n },\n {\n \"content\": \"/// Converts an `IR` into the `StandardFormat` constraint system\\n\\npub fn serialise_circuit(circuit: &Circuit) -> ConstraintSystem {\\n\\n // Create constraint system\\n\\n let mut constraints: Vec<Constraint> = Vec::new();\\n\\n let mut range_constraints: Vec<RangeConstraint> = Vec::new();\\n\\n let mut logic_constraints: Vec<LogicConstraint> = Vec::new();\\n\\n let mut sha256_constraints: Vec<Sha256Constraint> = Vec::new();\\n\\n let mut blake2s_constraints: Vec<Blake2sConstraint> = Vec::new();\\n\\n let mut pedersen_constraints: Vec<PedersenConstraint> = Vec::new();\\n\\n let mut merkle_membership_constraints: Vec<MerkleMembershipConstraint> = Vec::new();\\n\\n let mut insert_merkle_constraints: Vec<InsertMerkleConstraint> = Vec::new();\\n\\n let mut schnorr_constraints: Vec<SchnorrConstraint> = Vec::new();\\n\\n let mut ecdsa_secp256k1_constraints: Vec<EcdsaConstraint> = Vec::new();\\n\\n let mut fixed_base_scalar_mul_constraints: Vec<FixedBaseScalarMulConstraint> = Vec::new();\\n\\n let mut hash_to_field_constraints: Vec<HashToFieldConstraint> = Vec::new();\\n\\n\\n\\n for gate in circuit.gates.iter() {\\n\\n match gate {\\n\\n Gate::Arithmetic(arithmetic) => {\\n\\n let constraint = serialise_arithmetic_gates(arithmetic);\\n\\n constraints.push(constraint);\\n\",\n \"file_path\": \"crates/aztec_backend/src/serialiser/mod.rs\",\n \"rank\": 63,\n \"score\": 190526.56107523837\n },\n {\n \"content\": \"#[test]\\n\\nfn test_span() {\\n\\n let input = \\\"let x = 5\\\";\\n\\n\\n\\n // Let\\n\\n let start_position = Position::default().forward();\\n\\n let let_position = start_position.forward_by(2);\\n\\n let let_token = Token::Keyword(Keyword::Let).into_span(start_position, let_position);\\n\\n\\n\\n // Skip whitespace\\n\\n let whitespace_position = let_position.forward();\\n\\n\\n\\n // Identifier position\\n\\n let ident_position = whitespace_position.forward();\\n\\n let ident_token = Token::Ident(\\\"x\\\".to_string()).into_single_span(ident_position);\\n\\n\\n\\n // Skip whitespace\\n\\n let whitespace_position = ident_position.forward();\\n\\n\\n\\n // Assign position\\n\\n let assign_position = whitespace_position.forward();\\n\",\n \"file_path\": \"crates/noirc_frontend/src/lexer/lexer.rs\",\n \"rank\": 64,\n \"score\": 189076.60791870975\n },\n {\n \"content\": \"#[test]\\n\\nfn test_int_type() {\\n\\n let input = \\\"u16 i16 i108 u104.5\\\";\\n\\n\\n\\n let expected = vec![\\n\\n Token::IntType(IntType::Unsigned(16)),\\n\\n Token::IntType(IntType::Signed(16)),\\n\\n Token::IntType(IntType::Signed(108)),\\n\\n Token::IntType(IntType::Unsigned(104)),\\n\\n Token::Dot,\\n\\n Token::Int(5.into()),\\n\\n ];\\n\\n\\n\\n let mut lexer = Lexer::new(input);\\n\\n for token in expected.into_iter() {\\n\\n let got = lexer.next_token().unwrap();\\n\\n assert_eq!(got, token);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/lexer/lexer.rs\",\n \"rank\": 65,\n \"score\": 185394.55484026542\n },\n {\n \"content\": \"fn mask_vector_le(bytes: &mut [u8], num_bits: usize) {\\n\\n // reverse to big endian format\\n\\n bytes.reverse();\\n\\n\\n\\n let mask_power = num_bits % 8;\\n\\n let array_mask_index = num_bits / 8;\\n\\n\\n\\n for (index, byte) in bytes.iter_mut().enumerate() {\\n\\n match index.cmp(&array_mask_index) {\\n\\n std::cmp::Ordering::Less => {\\n\\n // do nothing if the current index is less than\\n\\n // the array index.\\n\\n }\\n\\n std::cmp::Ordering::Equal => {\\n\\n let mask = 2u8.pow(mask_power as u32) - 1;\\n\\n // mask the byte\\n\\n *byte &= mask;\\n\\n }\\n\\n std::cmp::Ordering::Greater => {\\n\\n // Anything greater than the array index\\n\\n // will be set to zero\\n\\n *byte = 0;\\n\\n }\\n\\n }\\n\\n }\\n\\n // reverse back to little endian\\n\\n bytes.reverse();\\n\\n}\\n\",\n \"file_path\": \"crates/noir_field/src/generic_ark.rs\",\n \"rank\": 66,\n \"score\": 184465.32620556487\n },\n {\n \"content\": \"fn resolve_path_from_crate_root(\\n\\n def_map: &CrateDefMap,\\n\\n import_path: &[Ident],\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n) -> PathResolution {\\n\\n resolve_name_in_module(def_map, import_path, def_map.root, def_maps)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/import.rs\",\n \"rank\": 67,\n \"score\": 182084.87108090072\n },\n {\n \"content\": \"fn resolve_name_in_module(\\n\\n def_map: &CrateDefMap,\\n\\n import_path: &[Ident],\\n\\n starting_mod: LocalModuleId,\\n\\n def_maps: &HashMap<CrateId, CrateDefMap>,\\n\\n) -> PathResolution {\\n\\n let mut current_mod = &def_map.modules[starting_mod.0];\\n\\n\\n\\n // There is a possibility that the import path is empty\\n\\n // In that case, early return\\n\\n if import_path.is_empty() {\\n\\n let mod_id = ModuleId {\\n\\n krate: def_map.krate,\\n\\n local_id: starting_mod,\\n\\n };\\n\\n return PathResolution::Resolved(PerNs::types(mod_id.into()));\\n\\n }\\n\\n\\n\\n let mut import_path = import_path.iter();\\n\\n let first_segment = import_path\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/import.rs\",\n \"rank\": 68,\n \"score\": 181959.28698647313\n },\n {\n \"content\": \"fn type_check_functions(\\n\\n interner: &mut NodeInterner,\\n\\n file_func_ids: Vec<(FileId, FuncId)>,\\n\\n) -> Result<(), Vec<CollectedErrors>> {\\n\\n for (file_id, func_id) in file_func_ids {\\n\\n if let Err(type_err) = type_check_func(interner, func_id) {\\n\\n let diag = type_err.into_diagnostics(interner);\\n\\n let errs = vec![CollectedErrors {\\n\\n file_id,\\n\\n errors: diag,\\n\\n }];\\n\\n return Err(errs);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/def_collector/dc_crate.rs\",\n \"rank\": 69,\n \"score\": 179026.03172871555\n },\n {\n \"content\": \"pub fn git_dep_location(base: &url::Url, tag: &str) -> PathBuf {\\n\\n let folder_name = super::resolver::resolve_folder_name(base, tag);\\n\\n\\n\\n super::nargo_crates().join(folder_name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/nargo/src/git.rs\",\n \"rank\": 70,\n \"score\": 178813.81588630038\n },\n {\n \"content\": \"fn insert_root(db: &mut sled::Db, value: FieldElement) {\\n\\n db.insert(\\\"ROOT\\\".as_bytes(), value.to_bytes()).unwrap();\\n\\n}\\n\",\n \"file_path\": \"crates/acvm/src/backends/csat_3_plonk_aztec/pwg/merkle.rs\",\n \"rank\": 71,\n \"score\": 174944.48153315007\n },\n {\n \"content\": \"struct Scope<K,V>(Vec<Item>)\\n\\n\\n\\nWe may want this because vector search is more cache friendly when there are not a lot of items.\\n\\nIt's not implemented yet, because nothing has been benched\\n\\n\\n\\n*/\\n\\n\\n\\n/// This implementation uses the terminology Scope and ScopeTree\\n\\n/// A Scope is map between Keys and Values, it is possible to search for a Key in Scope, returning a mutable copy\\n\\n/// A ScopeTree is a Vector of Scopes, searching for Key in ScopeTree will recursively search from the last scope until the first scope\\n\\n/// to find the Key, returning None, if the Key is in None of the Scopes.\\n\\n/// A ScopeTree is useful for implementing the scoping logic around for-loops, if statements and ClosureCalls.\\n\\n/// Implementers will usually store a Vector of ScopeTrees to implement the logic needed for FunctionCalls\\n\\npub struct Scope<K, V>(pub HashMap<K, V>);\\n\\n\\n\\nuse std::collections::hash_map;\\n\\nuse std::iter::Filter;\\n\\n\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/scope/mod.rs\",\n \"rank\": 72,\n \"score\": 174343.61094636703\n },\n {\n \"content\": \"type Scope = GenericScope<String, ResolverMeta>;\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/resolver.rs\",\n \"rank\": 73,\n \"score\": 173655.27196446303\n },\n {\n \"content\": \"/// Converts the Toml mapping to the native representation that the compiler\\n\\n/// understands for Inputs\\n\\nfn toml_map_to_field(toml_map: BTreeMap<String, TomlTypes>) -> BTreeMap<String, InputValue> {\\n\\n let mut field_map = BTreeMap::new();\\n\\n\\n\\n for (parameter, value) in toml_map {\\n\\n match value {\\n\\n TomlTypes::String(string) => {\\n\\n let old_value =\\n\\n field_map.insert(parameter.clone(), InputValue::Field(parse_str(&string)));\\n\\n assert!(old_value.is_none(), \\\"duplicate variable name {}\\\", parameter);\\n\\n }\\n\\n TomlTypes::Integer(integer) => {\\n\\n let old_value = field_map.insert(\\n\\n parameter.clone(),\\n\\n InputValue::Field(parse_str(&integer.to_string())),\\n\\n );\\n\\n assert!(old_value.is_none(), \\\"duplicate variable name {}\\\", parameter);\\n\\n }\\n\\n TomlTypes::ArrayNum(arr_num) => {\\n\\n let array_elements: Vec<_> = arr_num\\n\\n .into_iter()\\n\",\n \"file_path\": \"crates/noirc_abi/src/input_parser/toml.rs\",\n \"rank\": 74,\n \"score\": 171873.41009143303\n },\n {\n \"content\": \"pub fn handle_and_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n match (left, right) {\\n\\n (Object::Integer(x), Object::Integer(y)) => Ok(Object::Integer(x.and(y, evaluator)?)),\\n\\n (x, y) => {\\n\\n let err= RuntimeErrorKind::UnstructuredError{ message : format!(\\\"currently we only support bitwise operations on ranged operations, found types {} and {}\\\", x.r#type(), y.r#type())};\\n\\n Err(err)\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/and.rs\",\n \"rank\": 75,\n \"score\": 170486.5030580648\n },\n {\n \"content\": \"pub fn secp256k1_prehashed(\\n\\n initial_witness: &mut BTreeMap<Witness, FieldElement>,\\n\\n gadget_call: &GadgetCall,\\n\\n) {\\n\\n let mut inputs_iter = gadget_call.inputs.iter();\\n\\n\\n\\n let mut pub_key_x = [0u8; 32];\\n\\n for (i, pkx) in pub_key_x.iter_mut().enumerate() {\\n\\n let _x_i = inputs_iter\\n\\n .next()\\n\\n .unwrap_or_else(|| panic!(\\\"pub_key_x should be 32 bytes long, found only {} bytes\\\", i));\\n\\n let x_i = input_to_value(initial_witness, _x_i);\\n\\n *pkx = *x_i.to_bytes().last().unwrap()\\n\\n }\\n\\n\\n\\n let mut pub_key_y = [0u8; 32];\\n\\n for (i, pky) in pub_key_y.iter_mut().enumerate() {\\n\\n let _y_i = inputs_iter\\n\\n .next()\\n\\n .unwrap_or_else(|| panic!(\\\"pub_key_y should be 32 bytes long, found only {} bytes\\\", i));\\n\",\n \"file_path\": \"crates/acvm/src/pwg/signature/ecdsa.rs\",\n \"rank\": 76,\n \"score\": 170486.50305806476\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\npub struct UseParser;\\n\\n\\n\\nimpl UseParser {\\n\\n // Import statements of the form use std::hash::sha256;\\n\\n pub fn parse(parser: &mut Parser) -> Result<ImportStatement, ParserErrorKind> {\\n\\n // Current token is 'use'\\n\\n //\\n\\n // Next token should be the first segment for the Path\\n\\n // The PathParser expects the cursor to be on the first segment\\n\\n // so we advance the parser.\\n\\n parser.advance_tokens();\\n\\n\\n\\n // Current token is the first path segment\\n\\n // Which is the correct condition to call the Path parser\\n\\n // as a sub procedure.\\n\\n let path = PathParser::parse(parser)?\\n\\n .into_path()\\n\\n .expect(\\\"ice : path parser did not produce a path\\\");\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs\",\n \"rank\": 77,\n \"score\": 169075.78408256575\n },\n {\n \"content\": \" //\\n\\n // Peek ahead and check if the next token is `;`\\n\\n parser.peek_check_variant_advance(&Token::Semicolon)?;\\n\\n\\n\\n Ok(ImportStatement { path, alias })\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::parser::test_parse;\\n\\n\\n\\n use super::UseParser;\\n\\n\\n\\n #[test]\\n\\n fn valid_syntax() {\\n\\n let vectors = vec![\\n\\n \\\"use std::hash;\\\",\\n\\n \\\"use std;\\\",\\n\\n \\\"use foo::bar as hello;\\\",\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs\",\n \"rank\": 78,\n \"score\": 169073.30440105152\n },\n {\n \"content\": \" \\\"use foobar as as;\\\",\\n\\n //\\n\\n // Path ends with `::`\\n\\n \\\"use hello:: as foo;\\\",\\n\\n ];\\n\\n\\n\\n for src in vectors {\\n\\n let mut parser = test_parse(src);\\n\\n UseParser::parse(&mut parser).unwrap_err();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs\",\n \"rank\": 79,\n \"score\": 169073.0981081775\n },\n {\n \"content\": \"\\n\\n // Current token is the last identifier in the path\\n\\n //\\n\\n // Check if next token is `as` for path aliasing\\n\\n let mut alias: Option<Ident> = None;\\n\\n if parser.peek_token == Token::Keyword(Keyword::As) {\\n\\n // Current token is last path segment\\n\\n //\\n\\n // Bump cursor. Next token is `as`\\n\\n parser.advance_tokens();\\n\\n\\n\\n // Current token is `as`\\n\\n //\\n\\n // Bump cursor. Next token is the alias\\n\\n parser.peek_check_kind_advance(TokenKind::Ident)?;\\n\\n\\n\\n alias = Some(parser.curr_token.clone().into());\\n\\n }\\n\\n\\n\\n // Current token is the alias or the last path segment\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs\",\n \"rank\": 80,\n \"score\": 169071.37296432792\n },\n {\n \"content\": \" \\\"use bar as bar;\\\",\\n\\n ];\\n\\n\\n\\n for src in vectors {\\n\\n let mut parser = test_parse(src);\\n\\n UseParser::parse(&mut parser).unwrap();\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn invalid_syntax() {\\n\\n let vectors = vec![\\n\\n // Missing semi-colon\\n\\n \\\"use std::hash\\\",\\n\\n \\\"use bar as foo\\\",\\n\\n //\\n\\n // Missing alias\\n\\n \\\"use std as ;\\\",\\n\\n //\\n\\n // alias is replaced with `as`\\n\",\n \"file_path\": \"crates/noirc_frontend/src/parser/prefix_parser/use_stmt.rs\",\n \"rank\": 81,\n \"score\": 169068.25477740893\n },\n {\n \"content\": \"type ScopeTree = GenericScopeTree<String, ResolverMeta>;\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/resolver.rs\",\n \"rank\": 82,\n \"score\": 168532.95669131048\n },\n {\n \"content\": \"type ScopeForest = GenericScopeForest<String, ResolverMeta>;\\n\\n\\n\\npub struct Resolver<'a> {\\n\\n scopes: ScopeForest,\\n\\n\\n\\n path_resolver: &'a dyn PathResolver,\\n\\n def_maps: &'a HashMap<CrateId, CrateDefMap>,\\n\\n\\n\\n interner: &'a mut NodeInterner,\\n\\n\\n\\n errors: Vec<ResolverError>,\\n\\n}\\n\\n\\n\\nimpl<'a> Resolver<'a> {\\n\\n pub fn new(\\n\\n interner: &'a mut NodeInterner,\\n\\n path_resolver: &'a dyn PathResolver,\\n\\n def_maps: &'a HashMap<CrateId, CrateDefMap>,\\n\\n ) -> Resolver<'a> {\\n\\n Self {\\n\",\n \"file_path\": \"crates/noirc_frontend/src/hir/resolution/resolver.rs\",\n \"rank\": 83,\n \"score\": 168532.95669131048\n },\n {\n \"content\": \"fn write_to_file(bytes: &[u8], path: &Path) -> String {\\n\\n let display = path.display();\\n\\n\\n\\n let mut file = match File::create(&path) {\\n\\n Err(why) => panic!(\\\"couldn't create {}: {}\\\", display, why),\\n\\n Ok(file) => file,\\n\\n };\\n\\n\\n\\n match file.write_all(bytes) {\\n\\n Err(why) => panic!(\\\"couldn't write to {}: {}\\\", display, why),\\n\\n Ok(_) => display.to_string(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/aztec_backend/src/barretenberg_rs/integration.rs\",\n \"rank\": 84,\n \"score\": 168045.49154767834\n },\n {\n \"content\": \"fn parse_str(value: &str) -> FieldElement {\\n\\n if value.starts_with(\\\"0x\\\") {\\n\\n FieldElement::from_hex(value)\\n\\n .unwrap_or_else(|| panic!(\\\"Could not parse hex value {}\\\", value))\\n\\n } else {\\n\\n let val: i128 = value\\n\\n .parse()\\n\\n .expect(\\\"Expected witness values to be integers\\\");\\n\\n FieldElement::from(val)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_abi/src/input_parser/toml.rs\",\n \"rank\": 85,\n \"score\": 167909.27247916965\n },\n {\n \"content\": \"fn read_crs(path: std::path::PathBuf) -> Vec<u8> {\\n\\n match std::fs::read(&path) {\\n\\n Ok(bytes) => bytes,\\n\\n Err(e) => {\\n\\n assert!(\\n\\n !(e.kind() == std::io::ErrorKind::PermissionDenied),\\n\\n \\\"please run again with appropriate permissions.\\\"\\n\\n );\\n\\n panic!(\\n\\n \\\"Could not find file transcript00.dat at location {}.\\\\n Starting Download\\\",\\n\\n path.display()\\n\\n );\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// XXX: Below is the logic to download the CRS if it is not already present\\n\\n\\n\",\n \"file_path\": \"crates/aztec_backend/src/barretenberg_rs/crs.rs\",\n \"rank\": 86,\n \"score\": 167832.89247294498\n },\n {\n \"content\": \"fn transcript_location() -> std::path::PathBuf {\\n\\n let mut transcript_dir = dirs::home_dir().unwrap();\\n\\n transcript_dir.push(std::path::Path::new(\\\"noir_cache\\\"));\\n\\n transcript_dir.push(std::path::Path::new(\\\"ignition\\\"));\\n\\n transcript_dir.push(std::path::Path::new(\\\"transcript00.dat\\\"));\\n\\n transcript_dir\\n\\n}\\n\\n\\n\\nimpl CRS {\\n\\n pub fn new(num_points: usize) -> CRS {\\n\\n let g1_end = G1_START + (num_points * 64) - 1;\\n\\n\\n\\n // If the CRS does not exist, then download it from S3\\n\\n if !transcript_location().exists() {\\n\\n download_crs(transcript_location());\\n\\n }\\n\\n\\n\\n let crs = read_crs(transcript_location());\\n\\n\\n\\n let g1_data = crs[G1_START..=g1_end].to_vec();\\n\\n let g2_data = crs[G2_START..=G2_END].to_vec();\\n\\n\\n\\n CRS {\\n\\n g1_data,\\n\\n g2_data,\\n\\n num_points,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/aztec_backend/src/barretenberg_rs/crs.rs\",\n \"rank\": 87,\n \"score\": 166596.7685861423\n },\n {\n \"content\": \"fn insert_hash(db: &mut sled::Db, index: u32, hash: FieldElement) {\\n\\n let tree = db.open_tree(\\\"hashes\\\").unwrap();\\n\\n let index = index as u128;\\n\\n\\n\\n tree.insert(&index.to_be_bytes(), hash.to_bytes()).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/acvm/src/backends/csat_3_plonk_aztec/pwg/merkle.rs\",\n \"rank\": 88,\n \"score\": 166465.75770773942\n },\n {\n \"content\": \"/// This calls the sub op under the hood\\n\\n/// Then asserts that the result has an inverse\\n\\n/// i.e a != b => a-b has an inverse => 1/(a-b) * (a-b) = 1\\n\\npub fn handle_neq_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n match (left, right) {\\n\\n (Object::Array(left_arr), Object::Array(right_arr)) => {\\n\\n Array::not_equal(left_arr, right_arr, evaluator)?;\\n\\n }\\n\\n (left, right) => {\\n\\n let result = handle_sub_op(left, right, evaluator)?;\\n\\n // Add an inversion to ensure that the inverse exists\\n\\n let _ = invert(result, evaluator);\\n\\n }\\n\\n }\\n\\n Ok(Object::Null)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/neq.rs\",\n \"rank\": 89,\n \"score\": 166158.4813896384\n },\n {\n \"content\": \"// Intentionally chose to write this out manually as it's not expected to change often or at all\\n\\n// We could expand again, so that ordering is preserved, but this does not seem necessary.\\n\\npub fn handle_add_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n match (left, right) {\\n\\n //\\n\\n // You cannot add Null objects with anything else\\n\\n (Object::Null, _) | (_, Object::Null) => Err(handle_cannot_add(\\\"()\\\")),\\n\\n //\\n\\n (Object::Array(lhs), Object::Array(rhs)) => {\\n\\n Ok(Object::Array(Array::add(lhs, rhs, evaluator)?))\\n\\n }\\n\\n //\\n\\n // You cannot add array objects to anything that is not an array\\n\\n (Object::Array(_), _) | (_, Object::Array(_)) => Err(handle_cannot_add(\\\"Arrays\\\")),\\n\\n //\\n\\n // Delegate logic for integer addition to the integer module\\n\\n (Object::Integer(x), y) | (y, Object::Integer(x)) => {\\n\\n Ok(Object::Integer(x.add(y, evaluator)?))\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/add.rs\",\n \"rank\": 90,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"/// This calls the add op under the hood\\n\\n/// We negate the RHS and send it to the add op\\n\\npub fn handle_sub_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n let negated_right = match right {\\n\\n Object::Null => {\\n\\n return Err(RuntimeErrorKind::UnstructuredError {\\n\\n message: \\\"cannot do an operation with the null object\\\".to_string(),\\n\\n })\\n\\n }\\n\\n Object::Arithmetic(arith) => Object::Arithmetic(-&arith),\\n\\n Object::Constants(c) => Object::Constants(-c),\\n\\n Object::Linear(linear) => Object::Linear(-&linear),\\n\\n Object::Integer(_rhs_integer) => {\\n\\n let left_int = left.integer();\\n\\n match left_int {\\n\\n Some(left_int) => return Ok(Object::Integer(left_int.sub(right, evaluator)?)),\\n\\n None => {\\n\\n return Err(RuntimeErrorKind::UnstructuredError {\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/sub.rs\",\n \"rank\": 91,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"pub fn handle_cast_op(\\n\\n evaluator: &mut Evaluator,\\n\\n left: Object,\\n\\n right: Type,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n let num_bits = match right {\\n\\n Type::Integer(_, _sign, num_bits) => num_bits,\\n\\n Type::FieldElement(_) => {\\n\\n match left.to_arithmetic() {\\n\\n Some(arith) => {\\n\\n // XXX: Create an intermediate variable for the arithmetic gate\\n\\n // as we don't have full support for Arithmetic constraints in\\n\\n // method object_to_wit_bits\\n\\n let (object, _) = evaluator.create_intermediate_variable(arith);\\n\\n return Ok(object);\\n\\n }\\n\\n None => {\\n\\n return Err(RuntimeErrorKind::UnstructuredError {\\n\\n message: \\\"type cannot be casted to a Field element\\\".to_string(),\\n\\n })\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/cast.rs\",\n \"rank\": 92,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"pub fn handle_xor_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n match (left, right) {\\n\\n (Object::Integer(x), Object::Integer(y)) => Ok(Object::Integer(x.xor(y, evaluator)?)),\\n\\n (x, y) => {\\n\\n return Err(RuntimeErrorKind::UnstructuredError {\\n\\n message: format!(\\n\\n \\\"bitwise operations are only available on integers, found types : {} and {}\\\",\\n\\n x.r#type(),\\n\\n y.r#type()\\n\\n ),\\n\\n })\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/xor.rs\",\n \"rank\": 93,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"/// This calls the sub op under the hood\\n\\n/// We negate the RHS and send it to the add op\\n\\npub fn handle_equal_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n let result = handle_sub_op(left, right, evaluator)?;\\n\\n\\n\\n match result {\\n\\n Object::Null => {\\n\\n return Err(RuntimeErrorKind::UnstructuredError {\\n\\n message: \\\"constrain statement cannot output a null polynomial\\\".to_string(),\\n\\n })\\n\\n } // XXX; This should be BUG severity as sub should have caught it\\n\\n Object::Constants(_) => {\\n\\n return Err(RuntimeErrorKind::UnstructuredError {\\n\\n message: \\\"cannot constrain two constants\\\".to_string(),\\n\\n })\\n\\n }\\n\\n Object::Linear(linear) => evaluator.gates.push(Gate::Arithmetic(linear.into())),\\n\\n Object::Arithmetic(arith) => evaluator.gates.push(Gate::Arithmetic(arith)),\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/equal.rs\",\n \"rank\": 94,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"pub fn handle_mul_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n let general_err = err_cannot_mul(left.r#type(), right.r#type());\\n\\n\\n\\n match (left, right) {\\n\\n (Object::Null, _) | (_, Object::Null) => Err(general_err),\\n\\n\\n\\n (Object::Array(_), Object::Array(_)) => Err(general_err),\\n\\n\\n\\n (Object::Arithmetic(x), y) | (y, Object::Arithmetic(x)) => {\\n\\n handle_arithmetic_mul(x, y, evaluator)\\n\\n }\\n\\n\\n\\n (Object::Constants(x), y) | (y, Object::Constants(x)) => {\\n\\n y.mul_constant(x).ok_or(general_err)\\n\\n }\\n\\n\\n\\n (Object::Linear(lin), y) | (y, Object::Linear(lin)) => handle_linear_mul(lin, y, evaluator),\\n\\n\\n\\n (Object::Integer(integer), y) | (y, Object::Integer(integer)) => {\\n\\n Ok(Object::Integer(integer.mul(y, evaluator)?))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/mul.rs\",\n \"rank\": 95,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"/// For a / b . First compute the 1/b and constraint it to be the inverse of b\\n\\n/// Then multiply this inverse by a\\n\\npub fn handle_div_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n let right_inv = invert(right, evaluator)?;\\n\\n handle_mul_op(left, right_inv, evaluator)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/div.rs\",\n \"rank\": 96,\n \"score\": 166153.70027563436\n },\n {\n \"content\": \"pub fn handle_less_than_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n bound_check(left, right, false, evaluator)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/bound_check.rs\",\n \"rank\": 97,\n \"score\": 164107.17789129174\n },\n {\n \"content\": \"pub fn handle_greater_than_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n bound_check(right, left, false, evaluator)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/bound_check.rs\",\n \"rank\": 98,\n \"score\": 164107.17789129174\n },\n {\n \"content\": \"pub fn handle_less_than_equal_op(\\n\\n left: Object,\\n\\n right: Object,\\n\\n evaluator: &mut Evaluator,\\n\\n) -> Result<Object, RuntimeErrorKind> {\\n\\n bound_check(left, right, true, evaluator)\\n\\n}\\n\",\n \"file_path\": \"crates/noirc_evaluator/src/binary_op/bound_check.rs\",\n \"rank\": 99,\n \"score\": 162134.78513012704\n }\n]","isConversational":false}}},{"rowIdx":3697,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"etk-asm/src/disasm.rs"},"repo_name":{"kind":"string","value":"Sheikh-A/etk"},"commit":{"kind":"string","value":"f22319ecd69bad0dd84124a47b506d0bdc8d2866"},"file_code":{"kind":"string","value":"\n\nmod error {\n use snafu::{Backtrace, Snafu};\n\n use super::Offset;\n\n \n #[derive(Debug, Snafu)]\n #[snafu(visibility = \"pub(super)\")]\n #[non_exhaustive]\n pub enum Error {\n \n #[non_exhaustive]\n Truncated {\n \n remaining: Offset<Vec<u8>>,\n\n \n backtrace: Backtrace,\n },\n }\n}\n\nuse crate::ops::{ConcreteOp, Op, Specifier};\n\npub use self::error::Error;\n\nuse snafu::ensure;\n\nuse std::collections::VecDeque;\nuse std::fmt;\nuse std::io::{self, Write};\n\n#[derive(Debug, Clone, Copy, Eq, PartialEq)]\npub struct Offset<T> {\n \n pub offset: usize,\n\n \n pub item: T,\n}\n\nimpl<T> Offset<T> {\n \n pub const fn new(offset: usize, item: T) -> Self {\n Self { offset, item }\n }\n}\n\nimpl<T> fmt::Display for Offset<T>\nwhere\n T: fmt::Display,\n{\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{: >4x}: {}\", self.offset, self.item)\n }\n}\n\n#[derive(Debug)]\npub struct Iter<'a> {\n disassembler: &'a mut Disassembler,\n}\n\nimpl<'a> Iterator for Iter<'a> {\n type Item = Offset<ConcreteOp>;\n\n fn next(&mut self) -> Option<Self::Item> {\n let buffer = &mut self.disassembler.buffer;\n let front = *buffer.front()?;\n let specifier = Specifier::from(front);\n let len = specifier.size() as usize;\n if buffer.len() < len {\n return None;\n }\n\n let remaining = buffer.split_off(len);\n let mut instruction = std::mem::replace(&mut self.disassembler.buffer, remaining);\n let instruction = instruction.make_contiguous();\n\n let item = Op::from_slice(instruction);\n let offset = self.disassembler.offset;\n self.disassembler.offset += len;\n Some(Offset::new(offset, item))\n }\n}\n\n#[derive(Debug, Default)]\npub struct Disassembler {\n buffer: VecDeque<u8>,\n offset: usize,\n}\n\nimpl Write for Disassembler {\n fn write(&mut self, buf: &[u8]) -> io::Result<usize> {\n self.buffer.reserve(buf.len());\n self.buffer.extend(buf);\n Ok(buf.len())\n }\n\n fn flush(&mut self) -> io::Result<()> {\n Ok(())\n }\n}\n\nimpl Disassembler {\n \n pub fn new() -> Self {\n Default::default()\n }\n\n \n pub fn ops(&mut self) -> Iter {\n Iter { disassembler: self }\n }\n\n \n \n pub fn finish(self) -> Result<(), Error> {\n ensure!(\n self.buffer.is_empty(),\n error::Truncated {\n remaining: Offset::new(self.offset, self.buffer.into()),\n }\n );\n Ok(())\n }\n}\n\n#[cfg(test)]\nmod tests {\n use hex_literal::hex;\n\n use super::*;\n\n #[test]\n fn empty() {\n let mut dasm = Disassembler::new();\n assert!(dasm.ops().next().is_none());\n dasm.finish().unwrap();\n }\n\n #[test]\n fn stop() {\n let input = hex!(\"00\");\n let expected = [Offset::new(0, Op::Stop)];\n\n let mut dasm = Disassembler::new();\n dasm.write_all(&input).unwrap();\n\n let actual: Vec<_> = dasm.ops().collect();\n\n assert_eq!(expected, actual.as_slice());\n dasm.finish().unwrap();\n }\n\n #[test]\n fn partial_push5() {\n let input = hex!(\"6401020304\");\n let expected = [Offset::new(0, Op::Push5(hex!(\"0102030406\").into()))];\n\n let mut dasm = Disassembler::new();\n dasm.write_all(&input).unwrap();\n assert!(dasm.ops().next().is_none());\n\n dasm.write_all(&hex!(\"06\")).unwrap();\n\n let actual: Vec<_> = dasm.ops().collect();\n\n assert_eq!(expected, actual.as_slice());\n dasm.finish().unwrap();\n }\n\n #[test]\n fn push5() {\n let input = hex!(\"640102030405\");\n let expected = [Offset::new(0, Op::Push5(hex!(\"0102030405\").into()))];\n\n let mut dasm = Disassembler::new();\n dasm.write_all(&input).unwrap();\n\n let actual: Vec<_> = dasm.ops().collect();\n\n assert_eq!(expected, actual.as_slice());\n dasm.finish().unwrap();\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nmod error {\n use snafu::{Backtrace, Snafu};\n\n use super::Offset;\n\n \n #[derive(Debug, Snafu)]\n #[snafu(visibility = \"pub(super)\")]\n #[non_exhaustive]\n pub enum Error {\n \n #[non_exhaustive]\n Truncated {\n \n remaining: Offset<Vec<u8>>,\n\n \n backtrace: Backtrace,\n },\n }\n}\n\nuse crate::ops::{ConcreteOp, Op, Specifier};\n\npub use self::error::Error;\n\nuse snafu::ensure;\n\nuse std::collections::VecDeque;\nuse std::fmt;\nuse std::io::{self, Write};\n\n#[derive(Debug, Clone, Copy, Eq, PartialEq)]\npub struct Offset<T> {\n \n pub offset: usize,\n\n \n pub item: T,\n}\n\nimpl<T> Offset<T> {\n \n pub const fn new(offset: usize, item: T) -> Self {\n Self { offset, item }\n }\n}\n\nimpl<T> fmt::Display for Offset<T>\nwhere\n T: fmt::Display,\n{\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{: >4x}: {}\", self.offset, self.item)\n }\n}\n\n#[derive(Debug)]\npub struct Iter<'a> {\n disassembler: &'a mut Disassembler,\n}\n\nimpl<'a> Iterator for Iter<'a> {\n type Item = Offset<ConcreteOp>;\n\n fn next(&mut self) -> Option<Self::Item> {\n let buffer = &mut self.disassembler.buffer;\n let front = *buffer.front()?;\n let specifier = Specifier::from(front);\n let len = specifier.size() as usize;\n if buffer.len() < len {\n return None;\n }\n\n let remaining = buffer.split_off(len);\n let mut instruction = std::mem::replace(&mut self.disassembler.buffer, remaining);\n let instruction = instruction.make_contiguous();\n\n let item = Op::from_slice(instruction);\n let offset = self.disassembler.offset;\n self.disassembler.offset += len;\n Some(Offset::new(offset, item))\n }\n}\n\n#[derive(Debug, Default)]\npub struct Disassembler {\n buffer: VecDeque<u8>,\n offset: usize,\n}\n\nimpl Write for Disassembler {\n fn write(&mut self, buf: &[u8]) -> io::Result<usize> {\n self.buffer.reserve(buf.len());\n self.buffer.extend(buf);\n Ok(buf.len())\n }\n\n fn flush(&mut self) -> io::Result<()> {\n Ok(())\n }\n}\n\nimpl Disassembler {\n \n pub fn new() -> Self {\n Default::default()\n }\n\n \n pub fn ops(&mut self) -> Iter {\n Iter { disassembler: self }\n }\n\n \n \n pub fn finish(self) -> Result<(), Error> {\n ensure!(\n self.buffer.is_empty(),\n error::Truncated {\n remaining: Offset::new(self.offset, self.buffer.into()),\n }\n );\n Ok(())\n }\n}\n\n#[cfg(test)]\nmod tests {\n use hex_literal::hex;\n\n use super::*;\n\n #[test]\n fn empty() {\n let mut dasm = Disassembler::new();\n assert!(dasm.ops().next().is_none());\n dasm.finish().unwrap();\n }\n\n #[test]\n fn stop() {\n let input = hex!(\"00\");\n let expected = [Offset::new(0, Op::Stop)];\n\n let mut dasm = Disassembler::new();\n dasm.write_all(&input).unwrap();\n\n let actual: Vec<_> = dasm.ops().collect();\n\n assert_eq!(expected, actual.as_slice());\n dasm.finish().unwrap();\n }\n\n #[test]\n fn partial_push5() {\n let input = hex!(\"6401020304\");\n let expected = [Offset::new(0, Op::Push5(hex!(\"0102030406\").into()))];\n\n let mut dasm = Disassembler::new();\n dasm.write_all(&input).unwrap();\n assert!(dasm.ops().next().is_none());\n\n dasm.write_all(&hex!(\"06\")).unwrap();\n\n let actual: Vec<_> = dasm.ops().collect();\n\n assert_eq!(expected, actual.as_slice());\n dasm.finish().unwrap();\n }\n\n #[test]\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"fn push5() {\n let input = hex!(\"640102030405\");\n let expected = [Offset::new(0, Op::Push5(hex!(\"0102030405\").into()))];\n\n let mut dasm = Disassembler::new();\n dasm.write_all(&input).unwrap();\n\n let actual: Vec<_> = dasm.ops().collect();\n\n assert_eq!(expected, actual.as_slice());\n dasm.finish().unwrap();\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[doc(hidden)]\n\npub trait Immediate<const N: usize>: Debug + Clone + Eq + PartialEq {\n\n fn extra_len() -> usize {\n\n N\n\n }\n\n}\n\n\n\nimpl<T, const N: usize> Immediate<N> for [T; N] where T: Debug + Clone + Eq + PartialEq {}\n\nimpl<const N: usize> Immediate<N> for Imm<[u8; N]> {}\n\nimpl<const N: usize> Immediate<N> for () {}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use assert_matches::assert_matches;\n\n\n\n use hex_literal::hex;\n\n\n\n use super::*;\n\n\n\n #[test]\n\n fn imm4_from_array() {\n\n let imm = Imm::from(hex!(\"95ea7b30\"));\n\n assert_matches!(imm, Imm::Constant([0x95, 0xea, 0x7b, 0x30]));\n\n }\n\n}\n","file_path":"etk-asm/src/ops/imm.rs","rank":0,"score":194468.3115139712},{"content":"#[test]\n\nfn every_op() -> Result<(), Error> {\n\n let mut output = Vec::new();\n\n let mut ingester = Ingest::new(&mut output);\n\n ingester.ingest_file(source(&[\"every-op\", \"main.etk\"]))?;\n\n\n\n assert_eq!(\n\n output,\n\n hex!(\n\n \"\n\n 00\n\n 01\n\n 02\n\n 03\n\n 04\n\n 05\n\n 06\n\n 07\n\n 08\n\n 09\n\n 0a\n","file_path":"etk-asm/tests/asm.rs","rank":1,"score":192753.9198014396},{"content":"#[doc(hidden)]\n\npub trait ImmediateTypes: Debug + Clone + Eq + PartialEq {\n\n // TODO: Technically `Self` doesn't need to implement anything, but it makes\n\n // derive(...) work on `Op`.\n\n\n\n type P1: Immediate<1>;\n\n type P2: Immediate<2>;\n\n type P3: Immediate<3>;\n\n type P4: Immediate<4>;\n\n type P5: Immediate<5>;\n\n type P6: Immediate<6>;\n\n type P7: Immediate<7>;\n\n type P8: Immediate<8>;\n\n type P9: Immediate<9>;\n\n type P10: Immediate<10>;\n\n type P11: Immediate<11>;\n\n type P12: Immediate<12>;\n\n type P13: Immediate<13>;\n\n type P14: Immediate<14>;\n\n type P15: Immediate<15>;\n\n type P16: Immediate<16>;\n","file_path":"etk-asm/src/ops/types.rs","rank":2,"score":189044.17900138305},{"content":"fn arg<T>(pairs: &mut Pairs<Rule>, expected: usize, got: &mut usize) -> Result<T, ParseError>\n\nwhere\n\n T: FromPair,\n\n{\n\n let pair = pairs.next().context(error::MissingArgument {\n\n got: *got,\n\n expected,\n\n })?;\n\n *got += 1;\n\n T::from_pair(pair)\n\n}\n\n\n\nimpl Signature for () {\n\n type Output = Self;\n\n\n\n fn parse_arguments(mut pairs: Pairs<Rule>) -> Result<Self, ParseError> {\n\n match pairs.next() {\n\n Some(_) => error::ExtraArgument { expected: 0usize }.fail(),\n\n None => Ok(()),\n\n }\n","file_path":"etk-asm/src/parse/args.rs","rank":3,"score":170474.5172606198},{"content":"#[test]\n\nfn subdirectory() -> Result<(), Error> {\n\n let mut output = Vec::new();\n\n let mut ingester = Ingest::new(&mut output);\n\n ingester.ingest_file(source(&[\"subdirectory\", \"main.etk\"]))?;\n\n\n\n assert_eq!(output, hex!(\"63c001c0de60ff\"));\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"etk-asm/tests/asm.rs","rank":4,"score":167371.0326540867},{"content":"#[test]\n\nfn variable_jump() -> Result<(), Error> {\n\n let mut output = Vec::new();\n\n let mut ingester = Ingest::new(&mut output);\n\n ingester.ingest_file(source(&[\"variable-jump\", \"main.etk\"]))?;\n\n\n\n assert_eq!(output, hex!(\"6003565b\"));\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"etk-asm/tests/asm.rs","rank":5,"score":162944.73557236552},{"content":"#[test]\n\nfn simple_constructor() -> Result<(), Error> {\n\n let mut output = Vec::new();\n\n let mut ingester = Ingest::new(&mut output);\n\n ingester.ingest_file(source(&[\"simple-constructor\", \"ctor.etk\"]))?;\n\n\n\n assert_eq!(\n\n output,\n\n hex!(\n\n \"\n\n 5858600f01803803919082908239f36020601f537f0b68656c6c6f20776f\n\n 726c640000000000000000000000000000000000000000603f5260606000f3\n\n \"\n\n ),\n\n );\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"etk-asm/tests/asm.rs","rank":6,"score":162944.73557236552},{"content":"fn radix_str_to_vec(s: &str, radix: u32, min: usize) -> Result<Vec<u8>, ParseError> {\n\n let n = u128::from_str_radix(s, radix)\n\n .ok()\n\n .context(error::ImmediateTooLarge)?;\n\n\n\n let msb = 128 - n.leading_zeros();\n\n let mut len = (msb / 8) as usize;\n\n if msb % 8 != 0 {\n\n len += 1;\n\n }\n\n\n\n len = std::cmp::max(len, min);\n\n\n\n Ok(n.to_be_bytes()[16 - len..].to_vec())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use assert_matches::assert_matches;\n\n\n","file_path":"etk-asm/src/parse/mod.rs","rank":7,"score":155286.71718132411},{"content":"fn parse_push(pair: pest::iterators::Pair<Rule>) -> Result<AbstractOp, ParseError> {\n\n let mut pair = pair.into_inner();\n\n let size = pair.next().unwrap();\n\n let size: usize = size.as_str().parse().unwrap();\n\n let operand = pair.next().unwrap();\n\n\n\n let spec = Specifier::push(size as u32).unwrap();\n\n\n\n let op = match operand.as_rule() {\n\n Rule::binary => {\n\n let raw = operand.as_str();\n\n let imm = radix_str_to_vec(&raw[2..], 2, size)?;\n\n AbstractOp::with_immediate(spec, imm.as_ref())\n\n .ok()\n\n .context(error::ImmediateTooLarge)?\n\n }\n\n Rule::octal => {\n\n let raw = operand.as_str();\n\n let imm = radix_str_to_vec(&raw[2..], 8, size)?;\n\n AbstractOp::with_immediate(spec, imm.as_ref())\n","file_path":"etk-asm/src/parse/mod.rs","rank":8,"score":153799.09302041633},{"content":"fn parse_inst_macro(pair: pest::iterators::Pair<Rule>) -> Result<Node, ParseError> {\n\n let rule = pair.as_rule();\n\n\n\n let node = match rule {\n\n Rule::import => {\n\n let args = <(PathBuf,)>::parse_arguments(pair.into_inner())?;\n\n Node::Import(args.0)\n\n }\n\n\n\n Rule::include => {\n\n let args = <(PathBuf,)>::parse_arguments(pair.into_inner())?;\n\n Node::Include(args.0)\n\n }\n\n\n\n Rule::include_hex => {\n\n let args = <(PathBuf,)>::parse_arguments(pair.into_inner())?;\n\n Node::IncludeHex(args.0)\n\n }\n\n\n\n Rule::push_macro => {\n","file_path":"etk-asm/src/parse/mod.rs","rank":9,"score":131089.18853750205},{"content":"fn source<P>(paths: &[P]) -> PathBuf\n\nwhere\n\n P: AsRef<Path>,\n\n{\n\n let rel: PathBuf = paths.into_iter().collect();\n\n let mut root = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n\n root.push(\"tests\");\n\n root.push(\"asm\");\n\n root.join(&rel)\n\n}\n\n\n","file_path":"etk-asm/tests/asm.rs","rank":10,"score":96524.91971505333},{"content":"fn parse_file<P: AsRef<Path>>(path: P) -> Result<Vec<Node>, Error> {\n\n let asm = read_to_string(path.as_ref()).with_context(|| error::Io {\n\n path: path.as_ref().to_owned(),\n\n })?;\n\n let nodes = parse_asm(&asm)?;\n\n Ok(nodes)\n\n}\n\n\n","file_path":"etk-asm/src/ingest.rs","rank":11,"score":93773.39722777202},{"content":"#[test]\n\nfn out_of_bounds() {\n\n let mut output = Vec::new();\n\n let mut ingester = Ingest::new(&mut output);\n\n let err = ingester\n\n .ingest_file(source(&[\"out-of-bounds\", \"main\", \"main.etk\"]))\n\n .unwrap_err();\n\n\n\n assert_matches!(err, Error::DirectoryTraversal { .. });\n\n}\n\n\n","file_path":"etk-asm/tests/asm.rs","rank":12,"score":87445.31074404533},{"content":"/// Extra information about an instruction.\n\npub trait Metadata {\n\n /// Returns true if the current instruction changes the program counter (other\n\n /// than incrementing it.)\n\n fn is_jump(&self) -> bool;\n\n\n\n /// Returns true if the current instruction is a valid destination for jumps.\n\n fn is_jump_target(&self) -> bool;\n\n\n\n /// Returns true if the current instruction causes the EVM to stop executing\n\n /// the contract.\n\n fn is_exit(&self) -> bool;\n\n\n\n /// Returns the access mode, if any, for touching account storage.\n\n fn storage_access(&self) -> Option<Access>;\n\n\n\n /// Returns the access mode, if any, for touching EVM memory.\n\n fn memory_access(&self) -> Option<Access>;\n\n\n\n /// How many stack elements this instruction pops.\n\n fn pops(&self) -> usize;\n","file_path":"etk-asm/src/ops.rs","rank":13,"score":81097.0766650491},{"content":"struct DisplayVisit<'a, 'b>(&'a mut fmt::Formatter<'b>);\n\n\n\nimpl<'a, 'b> Visit for DisplayVisit<'a, 'b> {\n\n type Error = fmt::Error;\n\n\n\n fn empty(&mut self) -> fmt::Result {\n\n write!(self.0, \"{{}}\")\n\n }\n\n\n\n fn exit(&mut self, op: &Sym) -> fmt::Result {\n\n match op {\n\n Sym::Const(_) => Ok(()),\n\n Sym::Var(_) => Ok(()),\n\n Sym::IsZero => write!(self.0, \" = 0)\"),\n\n _ => write!(self.0, \")\"),\n\n }\n\n }\n\n\n\n fn between(&mut self, op: &Sym, idx: u8) -> fmt::Result {\n\n let txt = match op {\n","file_path":"etk-analyze/src/sym.rs","rank":14,"score":74962.74209205185},{"content":"#[derive(Debug, Clone, Eq, PartialEq)]\n\npub enum Concrete {}\n\n\n\nimpl ImmediateTypes for Concrete {\n\n type P1 = [u8; 1];\n\n type P2 = [u8; 2];\n\n type P3 = [u8; 3];\n\n type P4 = [u8; 4];\n\n type P5 = [u8; 5];\n\n type P6 = [u8; 6];\n\n type P7 = [u8; 7];\n\n type P8 = [u8; 8];\n\n type P9 = [u8; 9];\n\n type P10 = [u8; 10];\n\n type P11 = [u8; 11];\n\n type P12 = [u8; 12];\n\n type P13 = [u8; 13];\n\n type P14 = [u8; 14];\n\n type P15 = [u8; 15];\n\n type P16 = [u8; 16];\n","file_path":"etk-asm/src/ops/types.rs","rank":15,"score":67658.06844519963},{"content":"#[derive(Debug, Clone, Eq, PartialEq)]\n\npub enum Abstract {}\n\n\n\nimpl ImmediateTypes for Abstract {\n\n type P1 = Imm<[u8; 1]>;\n\n type P2 = Imm<[u8; 2]>;\n\n type P3 = Imm<[u8; 3]>;\n\n type P4 = Imm<[u8; 4]>;\n\n type P5 = Imm<[u8; 5]>;\n\n type P6 = Imm<[u8; 6]>;\n\n type P7 = Imm<[u8; 7]>;\n\n type P8 = Imm<[u8; 8]>;\n\n type P9 = Imm<[u8; 9]>;\n\n type P10 = Imm<[u8; 10]>;\n\n type P11 = Imm<[u8; 11]>;\n\n type P12 = Imm<[u8; 12]>;\n\n type P13 = Imm<[u8; 13]>;\n\n type P14 = Imm<[u8; 14]>;\n\n type P15 = Imm<[u8; 15]>;\n\n type P16 = Imm<[u8; 16]>;\n","file_path":"etk-asm/src/ops/types.rs","rank":16,"score":67656.14711446929},{"content":" type P17 = Imm<[u8; 17]>;\n\n type P18 = Imm<[u8; 18]>;\n\n type P19 = Imm<[u8; 19]>;\n\n type P20 = Imm<[u8; 20]>;\n\n type P21 = Imm<[u8; 21]>;\n\n type P22 = Imm<[u8; 22]>;\n\n type P23 = Imm<[u8; 23]>;\n\n type P24 = Imm<[u8; 24]>;\n\n type P25 = Imm<[u8; 25]>;\n\n type P26 = Imm<[u8; 26]>;\n\n type P27 = Imm<[u8; 27]>;\n\n type P28 = Imm<[u8; 28]>;\n\n type P29 = Imm<[u8; 29]>;\n\n type P30 = Imm<[u8; 30]>;\n\n type P31 = Imm<[u8; 31]>;\n\n type P32 = Imm<[u8; 32]>;\n\n}\n\n\n\n/// Marker type for instructions without arguments.\n\n#[derive(Debug, Clone, Eq, PartialEq)]\n","file_path":"etk-asm/src/ops/types.rs","rank":17,"score":67652.14984106742},{"content":"pub enum Spec {}\n\n\n\nimpl ImmediateTypes for Spec {\n\n type P1 = ();\n\n type P2 = ();\n\n type P3 = ();\n\n type P4 = ();\n\n type P5 = ();\n\n type P6 = ();\n\n type P7 = ();\n\n type P8 = ();\n\n type P9 = ();\n\n type P10 = ();\n\n type P11 = ();\n\n type P12 = ();\n\n type P13 = ();\n\n type P14 = ();\n\n type P15 = ();\n\n type P16 = ();\n\n type P17 = ();\n","file_path":"etk-asm/src/ops/types.rs","rank":18,"score":67648.88045107883},{"content":"use super::imm::{Imm, Immediate};\n\n\n\nuse std::fmt::Debug;\n\n\n\n#[doc(hidden)]\n","file_path":"etk-asm/src/ops/types.rs","rank":19,"score":67648.02581747992},{"content":" type P17 = [u8; 17];\n\n type P18 = [u8; 18];\n\n type P19 = [u8; 19];\n\n type P20 = [u8; 20];\n\n type P21 = [u8; 21];\n\n type P22 = [u8; 22];\n\n type P23 = [u8; 23];\n\n type P24 = [u8; 24];\n\n type P25 = [u8; 25];\n\n type P26 = [u8; 26];\n\n type P27 = [u8; 27];\n\n type P28 = [u8; 28];\n\n type P29 = [u8; 29];\n\n type P30 = [u8; 30];\n\n type P31 = [u8; 31];\n\n type P32 = [u8; 32];\n\n}\n\n\n\n/// Marker type for instructions which may accept labels or constants as\n\n/// arguments.\n","file_path":"etk-asm/src/ops/types.rs","rank":20,"score":67647.598094272},{"content":" type P17: Immediate<17>;\n\n type P18: Immediate<18>;\n\n type P19: Immediate<19>;\n\n type P20: Immediate<20>;\n\n type P21: Immediate<21>;\n\n type P22: Immediate<22>;\n\n type P23: Immediate<23>;\n\n type P24: Immediate<24>;\n\n type P25: Immediate<25>;\n\n type P26: Immediate<26>;\n\n type P27: Immediate<27>;\n\n type P28: Immediate<28>;\n\n type P29: Immediate<29>;\n\n type P30: Immediate<30>;\n\n type P31: Immediate<31>;\n\n type P32: Immediate<32>;\n\n}\n\n\n\n/// Marker type for concrete instructions, meaning instructions which cannot use\n\n/// labels.\n","file_path":"etk-asm/src/ops/types.rs","rank":21,"score":67645.65868541348},{"content":" type P18 = ();\n\n type P19 = ();\n\n type P20 = ();\n\n type P21 = ();\n\n type P22 = ();\n\n type P23 = ();\n\n type P24 = ();\n\n type P25 = ();\n\n type P26 = ();\n\n type P27 = ();\n\n type P28 = ();\n\n type P29 = ();\n\n type P30 = ();\n\n type P31 = ();\n\n type P32 = ();\n\n}\n","file_path":"etk-asm/src/ops/types.rs","rank":22,"score":67639.47836577774},{"content":"#[derive(Debug, Clone, Eq, PartialEq, Hash)]\n\nenum Sym {\n\n Const(Box<[u8; 32]>),\n\n Var(Var),\n\n\n\n Add,\n\n Mul,\n\n Sub,\n\n Div,\n\n SDiv,\n\n Mod,\n\n SMod,\n\n AddMod,\n\n MulMod,\n\n Exp,\n\n Lt,\n\n Gt,\n\n SLt,\n\n SGt,\n\n Eq,\n\n And,\n","file_path":"etk-analyze/src/sym.rs","rank":23,"score":53730.80083983651},{"content":"#[derive(Debug, Clone)]\n\nenum Node {\n\n Terminate,\n\n BadJump,\n\n Block(Box<AnnotatedBlock>),\n\n}\n\n\n\nimpl fmt::Display for Node {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let block = match self {\n\n Self::Terminate => return write!(f, \"<terminate>\"),\n\n Self::BadJump => return write!(f, \"<bad-jump>\"),\n\n Self::Block(b) => b,\n\n };\n\n\n\n write!(f, \"Offset: 0x{:x}\", block.offset)\n\n }\n\n}\n\n\n","file_path":"etk-analyze/src/cfg.rs","rank":24,"score":53726.4402050623},{"content":"#[derive(Debug)]\n\nenum Scope {\n\n Same,\n\n Independent(Assembler),\n\n}\n\n\n\nimpl Scope {\n\n fn same() -> Self {\n\n Self::Same\n\n }\n\n\n\n fn independent() -> Self {\n\n Self::Independent(Assembler::new())\n\n }\n\n}\n\n\n","file_path":"etk-asm/src/ingest.rs","rank":25,"score":53722.05727149553},{"content":"struct Edge;\n\n\n\nimpl fmt::Display for Edge {\n\n fn fmt(&self, _: &mut fmt::Formatter) -> fmt::Result {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl Node {\n\n fn unwrap_block(&self) -> &AnnotatedBlock {\n\n match self {\n\n Self::Block(b) => b,\n\n _ => panic!(\"not a block\"),\n\n }\n\n }\n\n}\n\n\n\npub struct ControlFlowGraph {\n\n by_offset: BTreeMap<usize, NodeIndex>,\n\n graph: Graph<Node, Edge>,\n","file_path":"etk-analyze/src/cfg.rs","rank":26,"score":53289.31723717645},{"content":"#[derive(Debug)]\n\nstruct Root {\n\n original: PathBuf,\n\n canonicalized: PathBuf,\n\n}\n\n\n\nimpl Root {\n\n fn new(mut file: PathBuf) -> Result<Self, Error> {\n\n // Pop the filename.\n\n if !file.pop() {\n\n file = std::env::current_dir().context(error::Io { path: None })?;\n\n }\n\n\n\n let metadata = file\n\n .metadata()\n\n .with_context(|| error::Io { path: file.clone() })?;\n\n\n\n // Root must be a directory.\n\n if !metadata.is_dir() {\n\n let err = io::Error::from(io::ErrorKind::NotFound);\n\n return Err(err).context(error::Io { path: file });\n","file_path":"etk-asm/src/ingest.rs","rank":27,"score":53289.31723717645},{"content":"#[derive(Debug)]\n\nstruct Source {\n\n path: PathBuf,\n\n nodes: std::vec::IntoIter<Node>,\n\n scope: Scope,\n\n}\n\n\n","file_path":"etk-asm/src/ingest.rs","rank":28,"score":53289.31723717645},{"content":"#[derive(Debug)]\n\nstruct Annotator<'a> {\n\n basic: &'a BasicBlock,\n\n vars: u16,\n\n stacks: Vec<VecDeque<Expr>>, // TODO: I don't think we actually need to keep the\n\n // intermediary stacks. Probably only need the\n\n // current, previous, and first.\n\n}\n\n\n\nimpl<'a> Annotator<'a> {\n\n pub fn new(basic: &'a BasicBlock) -> Self {\n\n let mut stacks = Vec::with_capacity(basic.ops.len() + 1);\n\n stacks.push(VecDeque::new());\n\n\n\n Self {\n\n stacks,\n\n basic,\n\n vars: 0,\n\n }\n\n }\n\n\n","file_path":"etk-analyze/src/blocks/annotated.rs","rank":29,"score":48691.05383880361},{"content":"struct StackWindow<'s> {\n\n vars: &'s mut u16,\n\n stacks: &'s mut Vec<VecDeque<Expr>>,\n\n pops: usize,\n\n pushes: usize,\n\n}\n\n\n\nimpl<'s> Drop for StackWindow<'s> {\n\n fn drop(&mut self) {\n\n if !std::thread::panicking() {\n\n assert_eq!(self.pops, 0);\n\n assert_eq!(self.pushes, 0);\n\n }\n\n }\n\n}\n\n\n\nimpl<'s> StackWindow<'s> {\n\n fn new(vars: &'s mut u16, stacks: &'s mut Vec<VecDeque<Expr>>, op: &ConcreteOp) -> Self {\n\n Self {\n\n vars,\n","file_path":"etk-analyze/src/blocks/annotated.rs","rank":30,"score":47500.698693543716},{"content":"#[derive(Debug)]\n\nstruct HexRead<R> {\n\n first_read: bool,\n\n file: R,\n\n remainder: Option<u8>,\n\n}\n\n\n\nimpl<R> HexRead<R> {\n\n fn new(file: R) -> Self {\n\n Self {\n\n first_read: true,\n\n remainder: None,\n\n file,\n\n }\n\n }\n\n}\n\n\n\nimpl<R> io::Read for HexRead<R>\n\nwhere\n\n R: io::Read,\n\n{\n","file_path":"etk-cli/src/io.rs","rank":31,"score":47500.698693543716},{"content":"#[derive(Debug)]\n\nstruct SourceStack<W> {\n\n output: W,\n\n sources: Vec<Source>,\n\n root: Option<Root>,\n\n}\n\n\n\nimpl<W> SourceStack<W> {\n\n fn new(output: W) -> Self {\n\n Self {\n\n output,\n\n sources: Default::default(),\n\n root: Default::default(),\n\n }\n\n }\n\n\n\n fn resolve(&mut self, path: PathBuf, scope: Scope) -> Result<PartialSource<W>, Error> {\n\n ensure!(self.sources.len() <= 255, error::RecursionLimit);\n\n\n\n let path = if let Some(ref root) = self.root {\n\n let last = self.sources.last().unwrap();\n","file_path":"etk-asm/src/ingest.rs","rank":32,"score":47500.698693543716},{"content":"#[must_use]\n\nstruct PartialSource<'a, W> {\n\n stack: &'a mut SourceStack<W>,\n\n path: PathBuf,\n\n scope: Scope,\n\n}\n\n\n\nimpl<'a, W> PartialSource<'a, W> {\n\n fn path(&self) -> &Path {\n\n &self.path\n\n }\n\n\n\n fn push(self, nodes: Vec<Node>) -> &'a mut Source {\n\n self.stack.sources.push(Source {\n\n path: self.path,\n\n nodes: nodes.into_iter(),\n\n scope: self.scope,\n\n });\n\n\n\n self.stack.sources.last_mut().unwrap()\n\n }\n\n}\n\n\n","file_path":"etk-asm/src/ingest.rs","rank":33,"score":45178.02577402193},{"content":"use assert_matches::assert_matches;\n\n\n\nuse etk_asm::ingest::{Error, Ingest};\n\n\n\nuse hex_literal::hex;\n\n\n\nuse std::path::{Path, PathBuf};\n\n\n","file_path":"etk-asm/tests/asm.rs","rank":34,"score":35696.33611822716},{"content":" 9e\n\n 9f\n\n a0\n\n a1\n\n a2\n\n a3\n\n a4\n\n\n\n f0\n\n f1\n\n f2\n\n f3\n\n f4\n\n f5\n\n\n\n fa\n\n\n\n fd\n\n fe\n\n ff\n\n \"\n\n )\n\n );\n\n\n\n Ok(())\n\n}\n","file_path":"etk-asm/tests/asm.rs","rank":35,"score":35688.43174565286},{"content":" 8a\n\n 8b\n\n 8c\n\n 8d\n\n 8e\n\n 8f\n\n 90\n\n 91\n\n 92\n\n 93\n\n 94\n\n 95\n\n 96\n\n 97\n\n 98\n\n 99\n\n 9a\n\n 9b\n\n 9c\n\n 9d\n","file_path":"etk-asm/tests/asm.rs","rank":36,"score":35684.98319795801},{"content":" 0b\n\n\n\n 10\n\n 11\n\n 12\n\n 13\n\n 14\n\n 15\n\n 16\n\n 17\n\n 18\n\n 19\n\n 1a\n\n 1b\n\n 1c\n\n 1d\n\n\n\n 20\n\n\n\n 30\n","file_path":"etk-asm/tests/asm.rs","rank":37,"score":35684.98319795801},{"content":" 45\n\n 46\n\n 47\n\n 48\n\n\n\n 50\n\n 51\n\n 52\n\n 53\n\n 54\n\n 55\n\n 56\n\n 57\n\n 58\n\n 59\n\n 5a\n\n 5b\n\n\n\n 60 aa\n\n 61 aabb\n","file_path":"etk-asm/tests/asm.rs","rank":38,"score":35684.98319795801},{"content":" 31\n\n 32\n\n 33\n\n 34\n\n 35\n\n 36\n\n 37\n\n 38\n\n 39\n\n 3a\n\n 3b\n\n 3c\n\n 3d\n\n 3e\n\n 3f\n\n 40\n\n 41\n\n 42\n\n 43\n\n 44\n","file_path":"etk-asm/tests/asm.rs","rank":39,"score":35684.98319795801},{"content":" 76 aabbccddeeff00112233445566778899aabbccddeeff00\n\n 77 aabbccddeeff00112233445566778899aabbccddeeff0011\n\n 78 aabbccddeeff00112233445566778899aabbccddeeff001122\n\n 79 aabbccddeeff00112233445566778899aabbccddeeff00112233\n\n 7a aabbccddeeff00112233445566778899aabbccddeeff0011223344\n\n 7b aabbccddeeff00112233445566778899aabbccddeeff001122334455\n\n 7c aabbccddeeff00112233445566778899aabbccddeeff00112233445566\n\n 7d aabbccddeeff00112233445566778899aabbccddeeff0011223344556677\n\n 7e aabbccddeeff00112233445566778899aabbccddeeff001122334455667788\n\n 7f aabbccddeeff00112233445566778899aabbccddeeff00112233445566778899\n\n 80\n\n 81\n\n 82\n\n 83\n\n 84\n\n 85\n\n 86\n\n 87\n\n 88\n\n 89\n","file_path":"etk-asm/tests/asm.rs","rank":40,"score":35684.98319795801},{"content":" 62 aabbcc\n\n 63 aabbccdd\n\n 64 aabbccddee\n\n 65 aabbccddeeff\n\n 66 aabbccddeeff00\n\n 67 aabbccddeeff0011\n\n 68 aabbccddeeff001122\n\n 69 aabbccddeeff00112233\n\n 6a aabbccddeeff0011223344\n\n 6b aabbccddeeff001122334455\n\n 6c aabbccddeeff00112233445566\n\n 6d aabbccddeeff0011223344556677\n\n 6e aabbccddeeff001122334455667788\n\n 6f aabbccddeeff00112233445566778899\n\n 70 aabbccddeeff00112233445566778899aa\n\n 71 aabbccddeeff00112233445566778899aabb\n\n 72 aabbccddeeff00112233445566778899aabbcc\n\n 73 aabbccddeeff00112233445566778899aabbccdd\n\n 74 aabbccddeeff00112233445566778899aabbccddee\n\n 75 aabbccddeeff00112233445566778899aabbccddeeff\n","file_path":"etk-asm/tests/asm.rs","rank":41,"score":35684.98319795801},{"content":"//! Definitions of all instructions supported by the assembler.\n\n\n\nmod error {\n\n use snafu::{Backtrace, Snafu};\n\n\n\n /// The error that can arise while parsing a specifier from a string.\n\n #[derive(Debug, Snafu)]\n\n #[snafu(display(\"unknown specifier: {}\", text))]\n\n #[snafu(visibility = \"pub(super)\")]\n\n #[non_exhaustive]\n\n pub struct UnknownSpecifierError {\n\n text: String,\n\n backtrace: Backtrace,\n\n }\n\n}\n\n\n\nmod imm;\n\nmod types;\n\n\n\npub use self::error::UnknownSpecifierError;\n","file_path":"etk-asm/src/ops.rs","rank":42,"score":34656.91414272263},{"content":" }\n\n\n\n fn pops(&self) -> usize {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => or_zero!($($pops)?),\n\n )*\n\n }\n\n }\n\n }\n\n\n\n impl<I> Op<I> where I: ImmediateTypes {\n\n /// Create a new `Op` given a particular specifier.\n\n ///\n\n /// Returns `None` if the instruction specified requires an\n\n /// immediate argument.\n\n pub fn new(spec: Op<Spec>) -> Option<Self> {\n\n match spec {\n\n $(\n\n pat_spec!($op$(, $arg)?) => ret_new!($op$(, $arg)?),\n","file_path":"etk-asm/src/ops.rs","rank":43,"score":34654.512455855765},{"content":" )*\n\n };\n\n\n\n Ok(op)\n\n }\n\n\n\n /// Construct an `Op` by disassembling the given slice `bytes`.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if the length of `bytes` doesn't match the\n\n /// instruction size, as determined by the first element of `bytes`.\n\n pub fn from_slice(bytes: &[u8]) -> Self {\n\n let specifier: Op<Spec> = Op::from(bytes[0]);\n\n let sz = specifier.extra_len() as usize + 1;\n\n\n\n if bytes.len() != sz {\n\n panic!(\n\n \"got {} bytes for {}, expected {}\",\n\n bytes.len(),\n","file_path":"etk-asm/src/ops.rs","rank":44,"score":34653.25753411495},{"content":" impl FromStr for Op<Spec> {\n\n type Err = UnknownSpecifierError;\n\n\n\n fn from_str(text: &str) -> Result<Self, Self::Err> {\n\n let result = match text {\n\n $(\n\n $mnemonic => Op::$op$((default!($arg)))?,\n\n )*\n\n\n\n _ => return error::UnknownSpecifierContext {\n\n text: text.clone()\n\n }.fail(),\n\n };\n\n\n\n Ok(result)\n\n }\n\n }\n\n\n\n impl fmt::Display for Op<Spec> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n","file_path":"etk-asm/src/ops.rs","rank":45,"score":34651.92925936686},{"content":" fn op_new() {\n\n for ii in 0..=u8::MAX {\n\n let spec = Specifier::try_from(ii).unwrap();\n\n let op = AbstractOp::new(spec);\n\n if spec.extra_len() > 0 {\n\n assert_eq!(op, None);\n\n } else {\n\n let op = op.unwrap();\n\n assert_eq!(op.specifier(), Some(spec));\n\n }\n\n }\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_zero() {\n\n let spec = Specifier::push_for(0);\n\n assert_eq!(spec, Some(Specifier::Push1(())));\n\n }\n\n\n\n #[test]\n","file_path":"etk-asm/src/ops.rs","rank":46,"score":34651.327662824486},{"content":" /// A `Specifier` is an `Op` that takes no arguments. It's useful to refer\n\n /// to instructions without needing knowledge of any particular immediate\n\n /// argument value.\n\n pub type Specifier = Op<Spec>;\n\n\n\n impl Copy for Op<Spec> {}\n\n\n\n impl Op<Spec> {\n\n const LUT: [Op<Spec>; 256] = [\n\n $(\n\n Op::$op$((tuple!($arg)))?,\n\n )*\n\n ];\n\n\n\n const fn to_u8(self) -> u8 {\n\n to_u8!(self, 0u8; $($op$(|$arg)?, )*)\n\n }\n\n\n\n fn extra_len(self) -> u32 {\n\n match self {\n","file_path":"etk-asm/src/ops.rs","rank":47,"score":34651.26219567579},{"content":"\n\nimpl AbstractOp {\n\n /// Construct a new `AbstractOp` given a specifier.\n\n ///\n\n /// Returns `None` if the instruction described by `spec` requires an immediate\n\n /// argument.\n\n pub fn new(spec: Op<Spec>) -> Option<Self> {\n\n Some(Self::Op(Op::new(spec)?))\n\n }\n\n\n\n /// Construct an `AbstractOp` with the given label.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if the instruction described by the specifier\n\n /// does not accept immediate arguments.\n\n pub fn with_label<S: Into<String>>(spec: Op<Spec>, lbl: S) -> Self {\n\n Self::Op(Op::with_label(spec, lbl))\n\n }\n\n\n","file_path":"etk-asm/src/ops.rs","rank":48,"score":34649.82570902072},{"content":"pub use self::imm::{Imm, Immediate, TryFromIntError, TryFromSliceError};\n\nuse self::types::ImmediateTypes;\n\npub use self::types::{Abstract, Concrete, Spec};\n\n\n\nuse snafu::OptionExt;\n\n\n\nuse std::cmp::{Eq, PartialEq};\n\nuse std::convert::{TryFrom, TryInto};\n\nuse std::fmt;\n\nuse std::str::FromStr;\n\n\n\n/// The access mode (read, write, both) of an instruction.\n\n#[derive(Debug, Clone, Copy, Eq, PartialEq)]\n\npub enum Access {\n\n /// Indicates that the instruction might read.\n\n Read,\n\n\n\n /// Indicates that the instruction might write.\n\n Write,\n\n\n","file_path":"etk-asm/src/ops.rs","rank":49,"score":34649.36713793679},{"content":" /// immediate if one is required.\n\n ///\n\n /// If the size of this instruction is undefined (for example a variable sized\n\n /// push), this function returns `None`.\n\n pub fn size(&self) -> Option<u32> {\n\n match self {\n\n Self::Op(op) => Some(op.size()),\n\n Self::Label(_) => Some(0),\n\n Self::Push(_) => None,\n\n }\n\n }\n\n\n\n /// Return the specifier that corresponds to this `AbstractOp`.\n\n pub fn specifier(&self) -> Option<Op<Spec>> {\n\n match self {\n\n Self::Op(op) => Some(op.specifier()),\n\n _ => None,\n\n }\n\n }\n\n}\n","file_path":"etk-asm/src/ops.rs","rank":50,"score":34648.571561038945},{"content":" /// Construct an `AbstractOp` with the given immediate argument.\n\n ///\n\n /// An error is returned if `imm` doesn't match the immediate size for\n\n /// the instruction described by `spec`.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if the instruction described by the specifier\n\n /// does not accept immediate arguments.\n\n pub fn with_immediate(spec: Op<Spec>, imm: &[u8]) -> Result<Self, TryFromSliceError> {\n\n Ok(Self::Op(Op::<Abstract>::with_immediate(spec, imm)?))\n\n }\n\n\n\n pub(crate) fn immediate_label(&self) -> Option<&str> {\n\n match self {\n\n Self::Op(op) => op.immediate_label(),\n\n Self::Push(Imm::Label(lbl)) => Some(lbl),\n\n Self::Push(_) => None,\n\n Self::Label(_) => None,\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":51,"score":34648.457114320714},{"content":" )*) => {\n\n /// Enumeration of all supported instructions.\n\n ///\n\n /// There are three flavors of `Op`:\n\n /// - Abstract: `Op` that may use labels or constants.\n\n /// - Concrete: `Op` that may only use constants.\n\n /// - Specifier: `Op` without any arguments.\n\n #[derive(Debug, Clone, PartialEq, Eq)]\n\n #[allow(missing_docs)]\n\n pub enum Op<I = Abstract> where I: ImmediateTypes {\n\n $($op$((I::$arg))?, )*\n\n }\n\n\n\n impl<I> Metadata for Op<I> where I: ImmediateTypes {\n\n fn is_jump_target(&self) -> bool {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => or_false!($($jt)?),\n\n )*\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":52,"score":34647.079649182764},{"content":" )*\n\n }\n\n }\n\n\n\n /// Return the specifier that corresponds to this `Op`.\n\n pub fn specifier(&self) -> Op<Spec> {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => Op::$op$((default!($arg)))?,\n\n )*\n\n }\n\n }\n\n\n\n /// Return the total encoded size for this instruction, including the\n\n /// immediate if one is required.\n\n pub fn size(&self) -> u32 {\n\n self.specifier().extra_len() + 1u32\n\n }\n\n }\n\n\n","file_path":"etk-asm/src/ops.rs","rank":53,"score":34645.54591690646},{"content":" }\n\n\n\n pub(crate) fn realize(&self, address: u32) -> Result<Self, TryFromIntError> {\n\n let ret = match self {\n\n Self::Push(Imm::Label(_)) => {\n\n let spec = Specifier::push_for(address).context(imm::TryFromIntContext)?;\n\n let bytes = address.to_be_bytes();\n\n let start = bytes.len() - spec.extra_len() as usize;\n\n AbstractOp::with_immediate(spec, &bytes[start..]).unwrap()\n\n }\n\n Self::Push(Imm::Constant(_)) => {\n\n panic!(\"only pushes with a label can be realized\");\n\n }\n\n Self::Op(op) => Self::Op(op.realize(address)?),\n\n Self::Label(_) => panic!(\"labels cannot be realized\"),\n\n };\n\n\n\n Ok(ret)\n\n }\n\n\n","file_path":"etk-asm/src/ops.rs","rank":54,"score":34644.08901231699},{"content":" }\n\n\n\n /// Shorthand for `Op<Concrete>`, that is an `Op` that can only accept\n\n /// constants as arguments.\n\n pub type ConcreteOp = Op<Concrete>;\n\n\n\n impl Op<Concrete> {\n\n /// Construct an `Op` with the given immediate argument.\n\n ///\n\n /// An error is returned if `imm` doesn't match the immediate size for\n\n /// the instruction described by `spec`.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if the instruction described by the specifier\n\n /// does not accept immediate arguments.\n\n pub fn with_immediate(spec: Op<Spec>, imm: &[u8]) -> Result<Self, std::array::TryFromSliceError> {\n\n let op = match spec {\n\n $(\n\n pat_spec!($op$(, $arg)?) => ret_with_immediate!(imm, $op$(, $arg)?),\n","file_path":"etk-asm/src/ops.rs","rank":55,"score":34644.08725230398},{"content":" specifier,\n\n sz\n\n );\n\n }\n\n\n\n match specifier {\n\n $(\n\n pat_spec!($op$(, $arg)?) => ret_from_slice!(bytes, $op$(, $arg)?),\n\n )*\n\n }\n\n }\n\n\n\n pub(crate) fn assemble(&self, buf: &mut Vec<u8>) {\n\n buf.push(self.specifier().into());\n\n\n\n let args = match self {\n\n $(\n\n pat_cap!(a, $op$(, $arg)?) => {\n\n ret_assemble!(a$(, $arg)?)\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":56,"score":34643.93206043448},{"content":" pub(crate) fn concretize(self) -> Option<Op<Concrete>> {\n\n let res = match self {\n\n Self::Op(op) => op.concretize(),\n\n Self::Push(Imm::Label(_)) => panic!(\"label immediates must be realized first\"),\n\n Self::Push(Imm::Constant(konst)) => {\n\n let mut trimmed = konst.as_slice();\n\n while !trimmed.is_empty() && trimmed[0] == 0 {\n\n trimmed = &trimmed[1..];\n\n }\n\n let spec = Specifier::push(trimmed.len() as u32)?;\n\n\n\n Op::<Concrete>::with_immediate(spec, trimmed).unwrap()\n\n }\n\n Self::Label(_) => panic!(\"labels cannot be concretized\"),\n\n };\n\n\n\n Some(res)\n\n }\n\n\n\n /// Return the total encoded size for this instruction, including the\n","file_path":"etk-asm/src/ops.rs","rank":57,"score":34643.536229450256},{"content":"\n\n #[test]\n\n fn specifier_push_for_4294967295() {\n\n let spec = Specifier::push_for(4294967295);\n\n assert_eq!(spec, Some(Specifier::Push4(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_to_u8_selfdestruct() {\n\n let spec = Specifier::SelfDestruct;\n\n assert_eq!(0xffu8, spec.into());\n\n }\n\n}\n","file_path":"etk-asm/src/ops.rs","rank":58,"score":34643.46202602391},{"content":" )*\n\n };\n\n\n\n buf.extend_from_slice(args);\n\n }\n\n }\n\n\n\n impl fmt::Display for Op<Concrete> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let sp = self.specifier();\n\n\n\n match self {\n\n $(\n\n pat_cap!(a, $op$(, $arg)?) => {\n\n write_cap!(f, sp, Imm::Constant(a)$(, $arg)?)\n\n }\n\n )*\n\n }\n\n }\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":59,"score":34643.25419270938},{"content":" $(\n\n pat!($op$(, $arg)?) => extra_len!($($arg)?),\n\n )*\n\n }\n\n }\n\n\n\n }\n\n\n\n impl From<u8> for Op<Spec> {\n\n fn from(v: u8) -> Self {\n\n Self::LUT[v as usize]\n\n }\n\n }\n\n\n\n impl From<Op<Spec>> for u8 {\n\n fn from(sp: Op<Spec>) -> u8 {\n\n sp.to_u8()\n\n }\n\n }\n\n\n","file_path":"etk-asm/src/ops.rs","rank":60,"score":34642.72836644952},{"content":" /// Indicates that the instruction may read and/or write.\n\n ReadWrite,\n\n}\n\n\n\nimpl Access {\n\n /// Returns true if the instruction might read.\n\n pub fn reads(self) -> bool {\n\n matches!(self, Self::Read | Self::ReadWrite)\n\n }\n\n\n\n /// Returns true if the instruction might write.\n\n pub fn writes(self) -> bool {\n\n matches!(self, Self::Write | Self::ReadWrite)\n\n }\n\n}\n\n\n\n/// Extra information about an instruction.\n","file_path":"etk-asm/src/ops.rs","rank":61,"score":34642.62731661481},{"content":" $(\n\n pat_spec!($op$(, $arg)?) => ret_with_label!(lbl, $op$(, $arg)?),\n\n )*\n\n }\n\n }\n\n\n\n /// Construct an `Op` with the given immediate argument.\n\n ///\n\n /// An error is returned if `imm` doesn't match the immediate size for\n\n /// the instruction described by `spec`.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if the instruction described by the specifier\n\n /// does not accept immediate arguments.\n\n pub fn with_immediate(spec: Op<Spec>, imm: &[u8]) -> Result<Self, TryFromSliceError> {\n\n let op = match spec {\n\n $(\n\n pat_spec!($op$(, $arg)?) => ret_with_immediate!(imm, $op$(, $arg)?),\n\n )*\n","file_path":"etk-asm/src/ops.rs","rank":62,"score":34642.310034311435},{"content":" };\n\n\n\n Ok(op)\n\n }\n\n\n\n /// The label to be pushed on the stack. Only relevant for push instructions.\n\n pub(crate) fn immediate_label(&self) -> Option<&str> {\n\n match self {\n\n $(\n\n pat_label!(a, $op$(, $arg)?) => ret_label!(a$(, $arg)?),\n\n )*\n\n\n\n _ => None,\n\n }\n\n }\n\n\n\n // TODO: Rename `realize`\n\n pub(crate) fn realize(&self, address: u32) -> Result<Self, TryFromIntError> {\n\n let op = match self {\n\n $(\n","file_path":"etk-asm/src/ops.rs","rank":63,"score":34641.97799224322},{"content":" Self::Op(op) => op.pops(),\n\n Self::Push(_) => 0,\n\n Self::Label(_) => 0,\n\n }\n\n }\n\n\n\n fn pushes(&self) -> usize {\n\n match self {\n\n Self::Op(op) => op.pushes(),\n\n Self::Push(_) => 1,\n\n Self::Label(_) => 0,\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use assert_matches::assert_matches;\n\n\n\n use std::convert::TryInto;\n","file_path":"etk-asm/src/ops.rs","rank":64,"score":34641.44556505271},{"content":" let txt = match self {\n\n $(\n\n pat!($op$(, $arg)?) => $mnemonic,\n\n )*\n\n };\n\n write!(f, \"{}\", txt)\n\n }\n\n }\n\n\n\n impl Op<Abstract> {\n\n /// Construct an `Op` with the given label.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if the instruction described by the specifier\n\n /// does not accept immediate arguments.\n\n pub fn with_label<S: Into<String>>(spec: Op<Spec>, lbl: S) -> Self {\n\n let lbl = lbl.into();\n\n\n\n match spec {\n","file_path":"etk-asm/src/ops.rs","rank":65,"score":34641.20303481837},{"content":"\n\n }\n\n}\n\n\n\nimpl Op<Spec> {\n\n pub(crate) fn push_for(n: u32) -> Option<Specifier> {\n\n let bits = 0u32.leading_zeros() - n.leading_zeros();\n\n let bytes = (bits + 8 - 1) / 8;\n\n Self::push(bytes)\n\n }\n\n\n\n /// Converts a push instruction to the next larger push size.\n\n ///\n\n /// For example, a `push2` will become a `push3`.\n\n ///\n\n /// ## Panics\n\n ///\n\n /// This function panics if `self` is not a push instruction.\n\n pub fn upsize(self) -> Option<Self> {\n\n let extra = match self.extra_len() {\n","file_path":"etk-asm/src/ops.rs","rank":66,"score":34641.14323274353},{"content":"\n\nimpl From<Op<Concrete>> for AbstractOp {\n\n fn from(cop: Op<Concrete>) -> Self {\n\n Self::Op(cop.into())\n\n }\n\n}\n\n\n\nimpl fmt::Display for AbstractOp {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n Self::Op(op) => write!(f, \"{}\", op),\n\n Self::Push(txt) => write!(f, r#\"%push({})\"#, txt),\n\n Self::Label(lbl) => write!(f, r#\".{}:\"#, lbl),\n\n }\n\n }\n\n}\n\n\n\nimpl Metadata for AbstractOp {\n\n fn is_jump(&self) -> bool {\n\n match self {\n","file_path":"etk-asm/src/ops.rs","rank":67,"score":34640.85413771338},{"content":" $(\n\n pat_cap_concrete!(a, $op$(, $arg)?) =>\n\n ret_from_concrete!($op, a$(, $arg)?),\n\n )*\n\n }\n\n }\n\n }\n\n\n\n impl fmt::Display for Op<Abstract> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n let sp = self.specifier();\n\n\n\n match self {\n\n $(\n\n pat_cap!(a, $op$(, $arg)?) => {\n\n write_cap!(f, sp, a$(, $arg)?)\n\n }\n\n )*\n\n }\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":68,"score":34640.321216141274},{"content":" Revert(mnemonic=\"revert\", pops=2, memory=Access::ReadWrite, exit=true),\n\n Invalid(mnemonic=\"invalid\", exit=true),\n\n SelfDestruct(mnemonic=\"selfdestruct\", pops=1, exit=true),\n\n}\n\n\n\n/// Like an [`Op`], except it also supports virtual instructions.\n\n///\n\n/// In addition to the real EVM instructions, `AbstractOp` also supports defining\n\n/// labels, and pushing variable length immediate arguments.\n\n#[derive(Debug, Clone, Eq, PartialEq)]\n\npub enum AbstractOp {\n\n /// A real `Op`, as opposed to a label or variable sized push.\n\n Op(Op<Abstract>),\n\n\n\n /// A label, which is a virtual instruction.\n\n Label(String),\n\n\n\n /// A variable sized push, which is a virtual instruction.\n\n Push(Imm<Vec<u8>>),\n\n}\n","file_path":"etk-asm/src/ops.rs","rank":69,"score":34638.48985252557},{"content":" let parsed = Specifier::try_from(ii).unwrap();\n\n if ii == 0xfe {\n\n assert_eq!(Specifier::Invalid, parsed);\n\n } else {\n\n assert_ne!(Specifier::Invalid, parsed);\n\n }\n\n }\n\n }\n\n\n\n #[test]\n\n fn specifier_through_str() {\n\n for ii in 0..=u8::MAX {\n\n let spec = Specifier::try_from(ii).unwrap();\n\n let txt = spec.to_string();\n\n let parsed: Specifier = txt.parse().unwrap();\n\n assert_eq!(spec, parsed);\n\n }\n\n }\n\n\n\n #[test]\n","file_path":"etk-asm/src/ops.rs","rank":70,"score":34638.45924037879},{"content":" assert_eq!(spec, Some(Specifier::Push2(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_65536() {\n\n let spec = Specifier::push_for(65536);\n\n assert_eq!(spec, Some(Specifier::Push3(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_16777215() {\n\n let spec = Specifier::push_for(16777215);\n\n assert_eq!(spec, Some(Specifier::Push3(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_16777216() {\n\n let spec = Specifier::push_for(16777216);\n\n assert_eq!(spec, Some(Specifier::Push4(())));\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":71,"score":34638.132095870686},{"content":" fn specifier_push_for_one() {\n\n let spec = Specifier::push_for(1);\n\n assert_eq!(spec, Some(Specifier::Push1(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_255() {\n\n let spec = Specifier::push_for(255);\n\n assert_eq!(spec, Some(Specifier::Push1(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_256() {\n\n let spec = Specifier::push_for(256);\n\n assert_eq!(spec, Some(Specifier::Push2(())));\n\n }\n\n\n\n #[test]\n\n fn specifier_push_for_65535() {\n\n let spec = Specifier::push_for(65535);\n","file_path":"etk-asm/src/ops.rs","rank":72,"score":34637.84161270319},{"content":" }\n\n\n\n fn memory_access(&self) -> Option<Access> {\n\n match self {\n\n Self::Op(op) => op.storage_access(),\n\n Self::Push(_) => None,\n\n Self::Label(_) => None,\n\n }\n\n }\n\n\n\n fn storage_access(&self) -> Option<Access> {\n\n match self {\n\n Self::Op(op) => op.storage_access(),\n\n Self::Push(_) => None,\n\n Self::Label(_) => None,\n\n }\n\n }\n\n\n\n fn pops(&self) -> usize {\n\n match self {\n","file_path":"etk-asm/src/ops.rs","rank":73,"score":34635.72599688632},{"content":" pat_label!(_a, $op$(, $arg)?) => ret_realize!($op, address$(, $arg)?),\n\n )*\n\n _ => panic!(\"only push ops with labels can be realized\"),\n\n };\n\n Ok(op)\n\n }\n\n\n\n pub(crate) fn concretize(self) -> Op<Concrete> {\n\n match self {\n\n $(\n\n pat_const!(a, $op$(, $arg)?) => ret_concretize!($op, a$(, $arg)?),\n\n )*\n\n _ => panic!(\"labels must be resolved be concretizing\"),\n\n }\n\n }\n\n }\n\n\n\n impl From<Op<Concrete>> for Op<Abstract> {\n\n fn from(concrete: Op<Concrete>) -> Self {\n\n match concrete {\n","file_path":"etk-asm/src/ops.rs","rank":74,"score":34635.58507249817},{"content":"\n\n /// How many stack elements this instruction pushes.\n\n fn pushes(&self) -> usize;\n\n}\n\n\n\nmacro_rules! tuple {\n\n ($arg:ident) => {\n\n ()\n\n };\n\n}\n\n\n\nmacro_rules! default {\n\n ($arg:ident) => {\n\n Default::default()\n\n };\n\n}\n\n\n\nmacro_rules! pat {\n\n ($op:ident) => {\n\n Self::$op\n","file_path":"etk-asm/src/ops.rs","rank":75,"score":34634.88773724128},{"content":" Self::$op($cap)\n\n };\n\n}\n\n\n\nmacro_rules! write_cap {\n\n ($f:ident, $sp:expr, $cap:expr) => {\n\n write!($f, \"{}\", $sp)\n\n };\n\n ($f:ident, $sp:expr, $cap:expr, $arg:ident) => {\n\n write!($f, \"{} {}\", $sp, $cap)\n\n };\n\n}\n\n\n\nmacro_rules! pat_const {\n\n ($cap:ident, $op:ident) => {\n\n Self::$op\n\n };\n\n ($cap:ident, $op:ident, $arg:ident) => {\n\n Self::$op(Imm::Constant($cap))\n\n };\n","file_path":"etk-asm/src/ops.rs","rank":76,"score":34633.74827209561},{"content":" 0 => panic!(\"only push ops can be upsized\"),\n\n e => e,\n\n };\n\n\n\n Self::push(extra + 1)\n\n }\n\n\n\n /// Create a new push instruction with the given immediate size.\n\n pub fn push(bytes: u32) -> Option<Self> {\n\n let spec = match bytes {\n\n 0 | 1 => Self::Push1(()),\n\n 2 => Self::Push2(()),\n\n 3 => Self::Push3(()),\n\n 4 => Self::Push4(()),\n\n 5 => Self::Push5(()),\n\n 6 => Self::Push6(()),\n\n 7 => Self::Push7(()),\n\n 8 => Self::Push8(()),\n\n 9 => Self::Push9(()),\n\n 10 => Self::Push10(()),\n","file_path":"etk-asm/src/ops.rs","rank":77,"score":34633.728918404224},{"content":" 31 => Self::Push31(()),\n\n 32 => Self::Push32(()),\n\n _ => return None,\n\n };\n\n\n\n Some(spec)\n\n }\n\n}\n\n\n\nops! {\n\n Stop(mnemonic=\"stop\", exit=true),\n\n Add(mnemonic=\"add\", pops=2, pushes=1),\n\n Mul(mnemonic=\"mul\", pops=2, pushes=1),\n\n Sub(mnemonic=\"sub\", pops=2, pushes=1),\n\n Div(mnemonic=\"div\", pops=2, pushes=1),\n\n SDiv(mnemonic=\"sdiv\", pops=2, pushes=1),\n\n Mod(mnemonic=\"mod\", pops=2, pushes=1),\n\n SMod(mnemonic=\"smod\", pops=2, pushes=1),\n\n AddMod(mnemonic=\"addmod\", pops=3, pushes=1),\n\n MulMod(mnemonic=\"mulmod\", pops=3, pushes=1),\n","file_path":"etk-asm/src/ops.rs","rank":78,"score":34633.51473635895},{"content":"\n\n use super::*;\n\n\n\n #[test]\n\n fn u8_into_imm1() {\n\n let x: u8 = 0xdc;\n\n let imm: Imm<[u8; 1]> = x.into();\n\n assert_matches!(imm, Imm::Constant([0xdc]));\n\n }\n\n\n\n #[test]\n\n fn u16_try_into_imm1() {\n\n let x: u16 = 0xFF;\n\n let imm: Imm<[u8; 1]> = x.try_into().unwrap();\n\n assert_matches!(imm, Imm::Constant([0xFF]));\n\n }\n\n\n\n #[test]\n\n fn imm1_try_from_u16_too_large() {\n\n let x: u16 = 0x0100;\n","file_path":"etk-asm/src/ops.rs","rank":79,"score":34632.70006173199},{"content":"\n\nmacro_rules! ret_new {\n\n ($op:ident) => {\n\n Some(Self::$op)\n\n };\n\n ($op:ident, $arg:ident) => {\n\n None\n\n };\n\n}\n\n\n\nmacro_rules! ret_with_immediate {\n\n ($imm:ident, $op:ident) => {\n\n panic!()\n\n };\n\n ($imm:ident, $op:ident, $arg:ident) => {\n\n Self::$op($imm.try_into()?)\n\n };\n\n}\n\n\n\nmacro_rules! ret_with_label {\n","file_path":"etk-asm/src/ops.rs","rank":80,"score":34632.63686115372},{"content":" };\n\n ($arg:ident) => {{\n\n fn helper<T: ImmediateTypes>() -> u32 {\n\n T::$arg::extra_len().try_into().unwrap()\n\n }\n\n helper::<Spec>()\n\n }};\n\n}\n\n\n\nmacro_rules! to_u8 {\n\n ($test:ident, $c:expr; $first:ident, ) => {\n\n $c\n\n };\n\n ($test:ident, $c:expr; $first:ident$(|$arg:ident)?, $($rest:ident$(|$args:ident)?, )+) => {\n\n if matches!($test, pat!($first$(, $arg)?)) {\n\n $c\n\n } else {\n\n to_u8!($test, $c + 1u8; $($rest$(|$args)?, )+)\n\n }\n\n };\n","file_path":"etk-asm/src/ops.rs","rank":81,"score":34632.29163052648},{"content":" $(\n\n pat!($op$(, $arg)?) => or_none!($($storage)?),\n\n )*\n\n }\n\n }\n\n\n\n fn memory_access(&self) -> Option<Access> {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => or_none!($($memory)?),\n\n )*\n\n }\n\n }\n\n\n\n fn pushes(&self) -> usize {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => or_zero!($($pushes)?),\n\n )*\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":82,"score":34630.6481274611},{"content":" ($imm:ident, $op:ident) => {\n\n panic!()\n\n };\n\n ($imm:ident, $op:ident, $arg:ident) => {\n\n Self::$op($imm.into())\n\n };\n\n}\n\n\n\nmacro_rules! ret_from_slice {\n\n ($imm:ident, $op:ident) => {\n\n Self::$op\n\n };\n\n ($imm:ident, $op:ident, $arg:ident) => {\n\n Self::$op(TryFrom::try_from(&$imm[1..]).unwrap())\n\n };\n\n}\n\n\n\nmacro_rules! extra_len {\n\n () => {\n\n 0\n","file_path":"etk-asm/src/ops.rs","rank":83,"score":34630.38508207129},{"content":" assert_matches!(imm, Imm::Constant([0xfe, 0xdc]));\n\n }\n\n\n\n #[test]\n\n fn u128_into_imm32() {\n\n let x: u128 = 0x1023456789abcdef0123456789abcdef;\n\n let imm: Imm<[u8; 32]> = x.into();\n\n assert_matches!(\n\n imm,\n\n Imm::Constant([\n\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n\n 0x00, 0x00, 0x10, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0x01, 0x23, 0x45, 0x67,\n\n 0x89, 0xab, 0xcd, 0xef,\n\n ])\n\n );\n\n }\n\n\n\n #[test]\n\n fn specifier_from_u8() {\n\n for ii in 0..=u8::MAX {\n","file_path":"etk-asm/src/ops.rs","rank":84,"score":34630.038107182234},{"content":"}\n\n\n\nmacro_rules! pat_label {\n\n ($cap:ident, $op:ident) => { Self::$op };\n\n ($cap:ident, $op:ident, $arg:ident) => { Self::$op(Imm::Label(ref $cap)) };\n\n}\n\n\n\nmacro_rules! ret_label {\n\n ($cap:ident) => {\n\n None\n\n };\n\n ($cap:ident, $arg:ident) => {\n\n Some($cap)\n\n };\n\n}\n\n\n\nmacro_rules! ret_realize {\n\n ($op:ident, $addr:ident) => {\n\n panic!()\n\n };\n","file_path":"etk-asm/src/ops.rs","rank":85,"score":34629.28122028067},{"content":" Self::Op(op) => op.is_jump(),\n\n Self::Push(_) => false,\n\n Self::Label(_) => false,\n\n }\n\n }\n\n\n\n fn is_jump_target(&self) -> bool {\n\n match self {\n\n Self::Op(op) => op.is_jump_target(),\n\n Self::Push(_) => false,\n\n Self::Label(_) => false,\n\n }\n\n }\n\n\n\n fn is_exit(&self) -> bool {\n\n match self {\n\n Self::Op(op) => op.is_exit(),\n\n Self::Push(_) => false,\n\n Self::Label(_) => false,\n\n }\n","file_path":"etk-asm/src/ops.rs","rank":86,"score":34628.98457264397},{"content":" Imm::<[u8; 1]>::try_from(x).unwrap_err();\n\n }\n\n\n\n #[test]\n\n fn imm15_try_from_u128_too_large() {\n\n let x: u128 = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF + 0x1;\n\n Imm::<[u8; 15]>::try_from(x).unwrap_err();\n\n }\n\n\n\n #[test]\n\n fn u8_into_imm2() {\n\n let x: u8 = 0xdc;\n\n let imm: Imm<[u8; 2]> = x.into();\n\n assert_matches!(imm, Imm::Constant([0x00, 0xdc]));\n\n }\n\n\n\n #[test]\n\n fn u16_into_imm2() {\n\n let x: u16 = 0xfedc;\n\n let imm: Imm<[u8; 2]> = x.into();\n","file_path":"etk-asm/src/ops.rs","rank":87,"score":34627.93551902705},{"content":" Invalid2d(mnemonic=\"invalid_2d\", exit=true),\n\n Invalid2e(mnemonic=\"invalid_2e\", exit=true),\n\n Invalid2f(mnemonic=\"invalid_2f\", exit=true),\n\n\n\n Address(mnemonic=\"address\", pushes=1),\n\n Balance(mnemonic=\"balance\", pops=1, pushes=1),\n\n Origin(mnemonic=\"origin\", pushes=1),\n\n Caller(mnemonic=\"caller\", pushes=1),\n\n CallValue(mnemonic=\"callvalue\", pushes=1),\n\n CallDataLoad(mnemonic=\"calldataload\", pops=1, pushes=1),\n\n CallDataSize(mnemonic=\"calldatasize\", pushes=1),\n\n CallDataCopy(mnemonic=\"calldatacopy\", pops=3, memory=Access::Write),\n\n CodeSize(mnemonic=\"codesize\", pushes=1),\n\n CodeCopy(mnemonic=\"codecopy\", pops=3, memory=Access::Write),\n\n GasPrice(mnemonic=\"gasprice\", pushes=1),\n\n ExtCodeSize(mnemonic=\"extcodesize\", pops=1, pushes=1),\n\n ExtCodeCopy(mnemonic=\"extcodecopy\", pops=4, memory=Access::Write),\n\n ReturnDataSize(mnemonic=\"returndatasize\", pushes=1),\n\n ReturnDataCopy(mnemonic=\"returndatacopy\", pops=3, memory=Access::Write),\n\n ExtCodeHash(mnemonic=\"extcodehash\", pops=1, pushes=1),\n","file_path":"etk-asm/src/ops.rs","rank":88,"score":34627.921211499},{"content":" };\n\n ($op:ident, $arg:ident) => {\n\n Self::$op(_)\n\n };\n\n}\n\n\n\nmacro_rules! pat_cap_concrete {\n\n ($cap:ident, $op:ident) => {\n\n Op::<Concrete>::$op\n\n };\n\n ($cap:ident, $op:ident, $arg:ident) => {\n\n Op::<Concrete>::$op($cap)\n\n };\n\n}\n\n\n\nmacro_rules! pat_cap {\n\n ($cap:ident, $op:ident) => {\n\n Self::$op\n\n };\n\n ($cap:ident, $op:ident, $arg:ident) => {\n","file_path":"etk-asm/src/ops.rs","rank":89,"score":34627.3715635953},{"content":" ($op:ident, $addr:ident, $arg:ident) => {\n\n Op::$op($addr.try_into()?)\n\n };\n\n}\n\n\n\nmacro_rules! ret_from_concrete {\n\n ($op:ident, $addr:ident) => {\n\n Self::$op\n\n };\n\n ($op:ident, $addr:expr, $arg:ident) => {\n\n Self::$op(Imm::Constant($addr))\n\n };\n\n}\n\n\n\nmacro_rules! ret_concretize {\n\n ($op:ident, $addr:ident) => {\n\n Op::$op\n\n };\n\n ($op:ident, $addr:expr, $arg:ident) => {\n\n Op::$op($addr)\n","file_path":"etk-asm/src/ops.rs","rank":90,"score":34627.291899687836},{"content":" };\n\n}\n\n\n\nmacro_rules! ret_assemble {\n\n ($op:ident) => {\n\n return\n\n };\n\n ($addr:ident, $arg:ident) => {\n\n $addr as &[u8]\n\n };\n\n}\n\n\n\nmacro_rules! pat_spec {\n\n ($op:ident) => {\n\n Op::<Spec>::$op\n\n };\n\n ($op:ident, $arg:ident) => {\n\n Op::<Spec>::$op(_)\n\n };\n\n}\n","file_path":"etk-asm/src/ops.rs","rank":91,"score":34626.845585212846},{"content":" 11 => Self::Push11(()),\n\n 12 => Self::Push12(()),\n\n 13 => Self::Push13(()),\n\n 14 => Self::Push14(()),\n\n 15 => Self::Push15(()),\n\n 16 => Self::Push16(()),\n\n 17 => Self::Push17(()),\n\n 18 => Self::Push18(()),\n\n 19 => Self::Push19(()),\n\n 20 => Self::Push20(()),\n\n 21 => Self::Push21(()),\n\n 22 => Self::Push22(()),\n\n 23 => Self::Push23(()),\n\n 24 => Self::Push24(()),\n\n 25 => Self::Push25(()),\n\n 26 => Self::Push26(()),\n\n 27 => Self::Push27(()),\n\n 28 => Self::Push28(()),\n\n 29 => Self::Push29(()),\n\n 30 => Self::Push30(()),\n","file_path":"etk-asm/src/ops.rs","rank":92,"score":34624.54498279805},{"content":"}\n\n\n\nmacro_rules! or_false {\n\n () => {\n\n false\n\n };\n\n ($v:expr) => {\n\n $v\n\n };\n\n}\n\n\n\nmacro_rules! or_none {\n\n () => {\n\n None\n\n };\n\n ($v:expr) => {\n\n Some($v)\n\n };\n\n}\n\n\n","file_path":"etk-asm/src/ops.rs","rank":93,"score":34623.734812120776},{"content":" InvalidEe(mnemonic=\"invalid_ee\", exit=true),\n\n InvalidEf(mnemonic=\"invalid_ef\", exit=true),\n\n\n\n Create(mnemonic=\"create\", pops=3, pushes=1, memory=Access::Read),\n\n Call(mnemonic=\"call\", pops=7, pushes=1, memory=Access::ReadWrite),\n\n CallCode(mnemonic=\"callcode\", pops=7, pushes=1, memory=Access::ReadWrite),\n\n Return(mnemonic=\"return\", pops=2, memory=Access::Read, exit=true),\n\n DelegateCall(mnemonic=\"delegatecall\", pops=6, pushes=1, memory=Access::ReadWrite),\n\n Create2(mnemonic=\"create2\", pops=4, pushes=1, memory=Access::Read),\n\n\n\n InvalidF6(mnemonic=\"invalid_f6\", exit=true),\n\n InvalidF7(mnemonic=\"invalid_f7\", exit=true),\n\n InvalidF8(mnemonic=\"invalid_f8\", exit=true),\n\n InvalidF9(mnemonic=\"invalid_f9\", exit=true),\n\n\n\n StaticCall(mnemonic=\"staticcall\", pops=6, pushes=1, memory=Access::ReadWrite),\n\n\n\n InvalidFb(mnemonic=\"invalid_fb\", exit=true),\n\n InvalidFc(mnemonic=\"invalid_fc\", exit=true),\n\n\n","file_path":"etk-asm/src/ops.rs","rank":94,"score":34623.64122605235},{"content":" }\n\n\n\n fn is_exit(&self) -> bool {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => or_false!($($exit)?),\n\n )*\n\n }\n\n }\n\n\n\n fn is_jump(&self) -> bool {\n\n match self {\n\n $(\n\n pat!($op$(, $arg)?) => or_false!($($jmp)?),\n\n )*\n\n }\n\n }\n\n\n\n fn storage_access(&self) -> Option<Access> {\n\n match self {\n","file_path":"etk-asm/src/ops.rs","rank":95,"score":34622.952534309974},{"content":"macro_rules! or_zero {\n\n () => {\n\n 0\n\n };\n\n ($v:expr) => {\n\n $v\n\n };\n\n}\n\n\n\nmacro_rules! ops {\n\n ($($op:ident(\n\n mnemonic = $mnemonic:literal\n\n $(, arg = $arg:ident )?\n\n $(, pops = $pops:literal)?\n\n $(, pushes = $pushes:literal)?\n\n $(, memory = $memory:expr)?\n\n $(, storage = $storage:expr)?\n\n $(, exit = $exit:expr)?\n\n $(, jump = $jmp:expr)?\n\n $(, jump_target = $jt:expr)?),\n","file_path":"etk-asm/src/ops.rs","rank":96,"score":34622.44714084478},{"content":" Exp(mnemonic=\"exp\", pops=2, pushes=1),\n\n SignExtend(mnemonic=\"signextend\", pops=2, pushes=1),\n\n\n\n Invalid0c(mnemonic=\"invalid_0c\", exit=true),\n\n Invalid0d(mnemonic=\"invalid_0d\", exit=true),\n\n Invalid0e(mnemonic=\"invalid_0e\", exit=true),\n\n Invalid0f(mnemonic=\"invalid_0f\", exit=true),\n\n\n\n Lt(mnemonic=\"lt\", pops=2, pushes=1),\n\n Gt(mnemonic=\"gt\", pops=2, pushes=1),\n\n SLt(mnemonic=\"slt\", pops=2, pushes=1),\n\n SGt(mnemonic=\"sgt\", pops=2, pushes=1),\n\n Eq(mnemonic=\"eq\", pops=2, pushes=1),\n\n IsZero(mnemonic=\"iszero\", pops=1, pushes=1),\n\n And(mnemonic=\"and\", pops=2, pushes=1),\n\n Or(mnemonic=\"or\", pops=2, pushes=1),\n\n Xor(mnemonic=\"xor\", pops=2, pushes=1),\n\n Not(mnemonic=\"not\", pops=1, pushes=1),\n\n Byte(mnemonic=\"byte\", pops=2, pushes=1),\n\n Shl(mnemonic=\"shl\", pops=2, pushes=1),\n","file_path":"etk-asm/src/ops.rs","rank":97,"score":34621.55805932539},{"content":" BlockHash(mnemonic=\"blockhash\", pops=1, pushes=1),\n\n Coinbase(mnemonic=\"coinbase\", pushes=1),\n\n Timestamp(mnemonic=\"timestamp\", pushes=1),\n\n Number(mnemonic=\"number\", pushes=1),\n\n Difficulty(mnemonic=\"difficulty\", pushes=1),\n\n GasLimit(mnemonic=\"gaslimit\", pushes=1),\n\n ChainId(mnemonic=\"chainid\", pushes=1),\n\n SelfBalance(mnemonic=\"selfbalance\", pushes=1),\n\n BaseFee(mnemonic=\"basefee\", pushes=1),\n\n\n\n Invalid49(mnemonic=\"invalid_49\", exit=true),\n\n Invalid4a(mnemonic=\"invalid_4a\", exit=true),\n\n Invalid4b(mnemonic=\"invalid_4b\", exit=true),\n\n Invalid4c(mnemonic=\"invalid_4c\", exit=true),\n\n Invalid4d(mnemonic=\"invalid_4d\", exit=true),\n\n Invalid4e(mnemonic=\"invalid_4e\", exit=true),\n\n Invalid4f(mnemonic=\"invalid_4f\", exit=true),\n\n\n\n Pop(mnemonic=\"pop\", pops=1),\n\n MLoad(mnemonic=\"mload\", pops=1, pushes=1, memory=Access::Read),\n","file_path":"etk-asm/src/ops.rs","rank":98,"score":34620.633618364336},{"content":" MStore(mnemonic=\"mstore\", pops=2, memory=Access::Read),\n\n MStore8(mnemonic=\"mstore8\", pops=2, memory=Access::Read),\n\n SLoad(mnemonic=\"sload\", pops=1, pushes=1, storage=Access::Read),\n\n SStore(mnemonic=\"sstore\", pops=2, storage=Access::Write),\n\n Jump(mnemonic=\"jump\", pops=1, jump=true),\n\n JumpI(mnemonic=\"jumpi\", pops=2, jump=true),\n\n GetPc(mnemonic=\"pc\", pushes=1),\n\n MSize(mnemonic=\"msize\", pushes=1, memory=Access::Read),\n\n Gas(mnemonic=\"gas\", pushes=1),\n\n JumpDest(mnemonic=\"jumpdest\", jump_target=true),\n\n\n\n Invalid5c(mnemonic=\"invalid_5c\", exit=true),\n\n Invalid5d(mnemonic=\"invalid_5d\", exit=true),\n\n Invalid5e(mnemonic=\"invalid_5e\", exit=true),\n\n Invalid5f(mnemonic=\"invalid_5f\", exit=true),\n\n\n\n Push1(mnemonic=\"push1\", arg=P1, pushes=1),\n\n Push2(mnemonic=\"push2\", arg=P2, pushes=1),\n\n Push3(mnemonic=\"push3\", arg=P3, pushes=1),\n\n Push4(mnemonic=\"push4\", arg=P4, pushes=1),\n","file_path":"etk-asm/src/ops.rs","rank":99,"score":34620.439835378056}],"string":"[\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait Immediate<const N: usize>: Debug + Clone + Eq + PartialEq {\\n\\n fn extra_len() -> usize {\\n\\n N\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, const N: usize> Immediate<N> for [T; N] where T: Debug + Clone + Eq + PartialEq {}\\n\\nimpl<const N: usize> Immediate<N> for Imm<[u8; N]> {}\\n\\nimpl<const N: usize> Immediate<N> for () {}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use assert_matches::assert_matches;\\n\\n\\n\\n use hex_literal::hex;\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn imm4_from_array() {\\n\\n let imm = Imm::from(hex!(\\\"95ea7b30\\\"));\\n\\n assert_matches!(imm, Imm::Constant([0x95, 0xea, 0x7b, 0x30]));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"etk-asm/src/ops/imm.rs\",\n \"rank\": 0,\n \"score\": 194468.3115139712\n },\n {\n \"content\": \"#[test]\\n\\nfn every_op() -> Result<(), Error> {\\n\\n let mut output = Vec::new();\\n\\n let mut ingester = Ingest::new(&mut output);\\n\\n ingester.ingest_file(source(&[\\\"every-op\\\", \\\"main.etk\\\"]))?;\\n\\n\\n\\n assert_eq!(\\n\\n output,\\n\\n hex!(\\n\\n \\\"\\n\\n 00\\n\\n 01\\n\\n 02\\n\\n 03\\n\\n 04\\n\\n 05\\n\\n 06\\n\\n 07\\n\\n 08\\n\\n 09\\n\\n 0a\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 1,\n \"score\": 192753.9198014396\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait ImmediateTypes: Debug + Clone + Eq + PartialEq {\\n\\n // TODO: Technically `Self` doesn't need to implement anything, but it makes\\n\\n // derive(...) work on `Op`.\\n\\n\\n\\n type P1: Immediate<1>;\\n\\n type P2: Immediate<2>;\\n\\n type P3: Immediate<3>;\\n\\n type P4: Immediate<4>;\\n\\n type P5: Immediate<5>;\\n\\n type P6: Immediate<6>;\\n\\n type P7: Immediate<7>;\\n\\n type P8: Immediate<8>;\\n\\n type P9: Immediate<9>;\\n\\n type P10: Immediate<10>;\\n\\n type P11: Immediate<11>;\\n\\n type P12: Immediate<12>;\\n\\n type P13: Immediate<13>;\\n\\n type P14: Immediate<14>;\\n\\n type P15: Immediate<15>;\\n\\n type P16: Immediate<16>;\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 2,\n \"score\": 189044.17900138305\n },\n {\n \"content\": \"fn arg<T>(pairs: &mut Pairs<Rule>, expected: usize, got: &mut usize) -> Result<T, ParseError>\\n\\nwhere\\n\\n T: FromPair,\\n\\n{\\n\\n let pair = pairs.next().context(error::MissingArgument {\\n\\n got: *got,\\n\\n expected,\\n\\n })?;\\n\\n *got += 1;\\n\\n T::from_pair(pair)\\n\\n}\\n\\n\\n\\nimpl Signature for () {\\n\\n type Output = Self;\\n\\n\\n\\n fn parse_arguments(mut pairs: Pairs<Rule>) -> Result<Self, ParseError> {\\n\\n match pairs.next() {\\n\\n Some(_) => error::ExtraArgument { expected: 0usize }.fail(),\\n\\n None => Ok(()),\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/parse/args.rs\",\n \"rank\": 3,\n \"score\": 170474.5172606198\n },\n {\n \"content\": \"#[test]\\n\\nfn subdirectory() -> Result<(), Error> {\\n\\n let mut output = Vec::new();\\n\\n let mut ingester = Ingest::new(&mut output);\\n\\n ingester.ingest_file(source(&[\\\"subdirectory\\\", \\\"main.etk\\\"]))?;\\n\\n\\n\\n assert_eq!(output, hex!(\\\"63c001c0de60ff\\\"));\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 4,\n \"score\": 167371.0326540867\n },\n {\n \"content\": \"#[test]\\n\\nfn variable_jump() -> Result<(), Error> {\\n\\n let mut output = Vec::new();\\n\\n let mut ingester = Ingest::new(&mut output);\\n\\n ingester.ingest_file(source(&[\\\"variable-jump\\\", \\\"main.etk\\\"]))?;\\n\\n\\n\\n assert_eq!(output, hex!(\\\"6003565b\\\"));\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 5,\n \"score\": 162944.73557236552\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_constructor() -> Result<(), Error> {\\n\\n let mut output = Vec::new();\\n\\n let mut ingester = Ingest::new(&mut output);\\n\\n ingester.ingest_file(source(&[\\\"simple-constructor\\\", \\\"ctor.etk\\\"]))?;\\n\\n\\n\\n assert_eq!(\\n\\n output,\\n\\n hex!(\\n\\n \\\"\\n\\n 5858600f01803803919082908239f36020601f537f0b68656c6c6f20776f\\n\\n 726c640000000000000000000000000000000000000000603f5260606000f3\\n\\n \\\"\\n\\n ),\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 6,\n \"score\": 162944.73557236552\n },\n {\n \"content\": \"fn radix_str_to_vec(s: &str, radix: u32, min: usize) -> Result<Vec<u8>, ParseError> {\\n\\n let n = u128::from_str_radix(s, radix)\\n\\n .ok()\\n\\n .context(error::ImmediateTooLarge)?;\\n\\n\\n\\n let msb = 128 - n.leading_zeros();\\n\\n let mut len = (msb / 8) as usize;\\n\\n if msb % 8 != 0 {\\n\\n len += 1;\\n\\n }\\n\\n\\n\\n len = std::cmp::max(len, min);\\n\\n\\n\\n Ok(n.to_be_bytes()[16 - len..].to_vec())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use assert_matches::assert_matches;\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/parse/mod.rs\",\n \"rank\": 7,\n \"score\": 155286.71718132411\n },\n {\n \"content\": \"fn parse_push(pair: pest::iterators::Pair<Rule>) -> Result<AbstractOp, ParseError> {\\n\\n let mut pair = pair.into_inner();\\n\\n let size = pair.next().unwrap();\\n\\n let size: usize = size.as_str().parse().unwrap();\\n\\n let operand = pair.next().unwrap();\\n\\n\\n\\n let spec = Specifier::push(size as u32).unwrap();\\n\\n\\n\\n let op = match operand.as_rule() {\\n\\n Rule::binary => {\\n\\n let raw = operand.as_str();\\n\\n let imm = radix_str_to_vec(&raw[2..], 2, size)?;\\n\\n AbstractOp::with_immediate(spec, imm.as_ref())\\n\\n .ok()\\n\\n .context(error::ImmediateTooLarge)?\\n\\n }\\n\\n Rule::octal => {\\n\\n let raw = operand.as_str();\\n\\n let imm = radix_str_to_vec(&raw[2..], 8, size)?;\\n\\n AbstractOp::with_immediate(spec, imm.as_ref())\\n\",\n \"file_path\": \"etk-asm/src/parse/mod.rs\",\n \"rank\": 8,\n \"score\": 153799.09302041633\n },\n {\n \"content\": \"fn parse_inst_macro(pair: pest::iterators::Pair<Rule>) -> Result<Node, ParseError> {\\n\\n let rule = pair.as_rule();\\n\\n\\n\\n let node = match rule {\\n\\n Rule::import => {\\n\\n let args = <(PathBuf,)>::parse_arguments(pair.into_inner())?;\\n\\n Node::Import(args.0)\\n\\n }\\n\\n\\n\\n Rule::include => {\\n\\n let args = <(PathBuf,)>::parse_arguments(pair.into_inner())?;\\n\\n Node::Include(args.0)\\n\\n }\\n\\n\\n\\n Rule::include_hex => {\\n\\n let args = <(PathBuf,)>::parse_arguments(pair.into_inner())?;\\n\\n Node::IncludeHex(args.0)\\n\\n }\\n\\n\\n\\n Rule::push_macro => {\\n\",\n \"file_path\": \"etk-asm/src/parse/mod.rs\",\n \"rank\": 9,\n \"score\": 131089.18853750205\n },\n {\n \"content\": \"fn source<P>(paths: &[P]) -> PathBuf\\n\\nwhere\\n\\n P: AsRef<Path>,\\n\\n{\\n\\n let rel: PathBuf = paths.into_iter().collect();\\n\\n let mut root = PathBuf::from(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n root.push(\\\"tests\\\");\\n\\n root.push(\\\"asm\\\");\\n\\n root.join(&rel)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 10,\n \"score\": 96524.91971505333\n },\n {\n \"content\": \"fn parse_file<P: AsRef<Path>>(path: P) -> Result<Vec<Node>, Error> {\\n\\n let asm = read_to_string(path.as_ref()).with_context(|| error::Io {\\n\\n path: path.as_ref().to_owned(),\\n\\n })?;\\n\\n let nodes = parse_asm(&asm)?;\\n\\n Ok(nodes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ingest.rs\",\n \"rank\": 11,\n \"score\": 93773.39722777202\n },\n {\n \"content\": \"#[test]\\n\\nfn out_of_bounds() {\\n\\n let mut output = Vec::new();\\n\\n let mut ingester = Ingest::new(&mut output);\\n\\n let err = ingester\\n\\n .ingest_file(source(&[\\\"out-of-bounds\\\", \\\"main\\\", \\\"main.etk\\\"]))\\n\\n .unwrap_err();\\n\\n\\n\\n assert_matches!(err, Error::DirectoryTraversal { .. });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 12,\n \"score\": 87445.31074404533\n },\n {\n \"content\": \"/// Extra information about an instruction.\\n\\npub trait Metadata {\\n\\n /// Returns true if the current instruction changes the program counter (other\\n\\n /// than incrementing it.)\\n\\n fn is_jump(&self) -> bool;\\n\\n\\n\\n /// Returns true if the current instruction is a valid destination for jumps.\\n\\n fn is_jump_target(&self) -> bool;\\n\\n\\n\\n /// Returns true if the current instruction causes the EVM to stop executing\\n\\n /// the contract.\\n\\n fn is_exit(&self) -> bool;\\n\\n\\n\\n /// Returns the access mode, if any, for touching account storage.\\n\\n fn storage_access(&self) -> Option<Access>;\\n\\n\\n\\n /// Returns the access mode, if any, for touching EVM memory.\\n\\n fn memory_access(&self) -> Option<Access>;\\n\\n\\n\\n /// How many stack elements this instruction pops.\\n\\n fn pops(&self) -> usize;\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 13,\n \"score\": 81097.0766650491\n },\n {\n \"content\": \"struct DisplayVisit<'a, 'b>(&'a mut fmt::Formatter<'b>);\\n\\n\\n\\nimpl<'a, 'b> Visit for DisplayVisit<'a, 'b> {\\n\\n type Error = fmt::Error;\\n\\n\\n\\n fn empty(&mut self) -> fmt::Result {\\n\\n write!(self.0, \\\"{{}}\\\")\\n\\n }\\n\\n\\n\\n fn exit(&mut self, op: &Sym) -> fmt::Result {\\n\\n match op {\\n\\n Sym::Const(_) => Ok(()),\\n\\n Sym::Var(_) => Ok(()),\\n\\n Sym::IsZero => write!(self.0, \\\" = 0)\\\"),\\n\\n _ => write!(self.0, \\\")\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n fn between(&mut self, op: &Sym, idx: u8) -> fmt::Result {\\n\\n let txt = match op {\\n\",\n \"file_path\": \"etk-analyze/src/sym.rs\",\n \"rank\": 14,\n \"score\": 74962.74209205185\n },\n {\n \"content\": \"#[derive(Debug, Clone, Eq, PartialEq)]\\n\\npub enum Concrete {}\\n\\n\\n\\nimpl ImmediateTypes for Concrete {\\n\\n type P1 = [u8; 1];\\n\\n type P2 = [u8; 2];\\n\\n type P3 = [u8; 3];\\n\\n type P4 = [u8; 4];\\n\\n type P5 = [u8; 5];\\n\\n type P6 = [u8; 6];\\n\\n type P7 = [u8; 7];\\n\\n type P8 = [u8; 8];\\n\\n type P9 = [u8; 9];\\n\\n type P10 = [u8; 10];\\n\\n type P11 = [u8; 11];\\n\\n type P12 = [u8; 12];\\n\\n type P13 = [u8; 13];\\n\\n type P14 = [u8; 14];\\n\\n type P15 = [u8; 15];\\n\\n type P16 = [u8; 16];\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 15,\n \"score\": 67658.06844519963\n },\n {\n \"content\": \"#[derive(Debug, Clone, Eq, PartialEq)]\\n\\npub enum Abstract {}\\n\\n\\n\\nimpl ImmediateTypes for Abstract {\\n\\n type P1 = Imm<[u8; 1]>;\\n\\n type P2 = Imm<[u8; 2]>;\\n\\n type P3 = Imm<[u8; 3]>;\\n\\n type P4 = Imm<[u8; 4]>;\\n\\n type P5 = Imm<[u8; 5]>;\\n\\n type P6 = Imm<[u8; 6]>;\\n\\n type P7 = Imm<[u8; 7]>;\\n\\n type P8 = Imm<[u8; 8]>;\\n\\n type P9 = Imm<[u8; 9]>;\\n\\n type P10 = Imm<[u8; 10]>;\\n\\n type P11 = Imm<[u8; 11]>;\\n\\n type P12 = Imm<[u8; 12]>;\\n\\n type P13 = Imm<[u8; 13]>;\\n\\n type P14 = Imm<[u8; 14]>;\\n\\n type P15 = Imm<[u8; 15]>;\\n\\n type P16 = Imm<[u8; 16]>;\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 16,\n \"score\": 67656.14711446929\n },\n {\n \"content\": \" type P17 = Imm<[u8; 17]>;\\n\\n type P18 = Imm<[u8; 18]>;\\n\\n type P19 = Imm<[u8; 19]>;\\n\\n type P20 = Imm<[u8; 20]>;\\n\\n type P21 = Imm<[u8; 21]>;\\n\\n type P22 = Imm<[u8; 22]>;\\n\\n type P23 = Imm<[u8; 23]>;\\n\\n type P24 = Imm<[u8; 24]>;\\n\\n type P25 = Imm<[u8; 25]>;\\n\\n type P26 = Imm<[u8; 26]>;\\n\\n type P27 = Imm<[u8; 27]>;\\n\\n type P28 = Imm<[u8; 28]>;\\n\\n type P29 = Imm<[u8; 29]>;\\n\\n type P30 = Imm<[u8; 30]>;\\n\\n type P31 = Imm<[u8; 31]>;\\n\\n type P32 = Imm<[u8; 32]>;\\n\\n}\\n\\n\\n\\n/// Marker type for instructions without arguments.\\n\\n#[derive(Debug, Clone, Eq, PartialEq)]\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 17,\n \"score\": 67652.14984106742\n },\n {\n \"content\": \"pub enum Spec {}\\n\\n\\n\\nimpl ImmediateTypes for Spec {\\n\\n type P1 = ();\\n\\n type P2 = ();\\n\\n type P3 = ();\\n\\n type P4 = ();\\n\\n type P5 = ();\\n\\n type P6 = ();\\n\\n type P7 = ();\\n\\n type P8 = ();\\n\\n type P9 = ();\\n\\n type P10 = ();\\n\\n type P11 = ();\\n\\n type P12 = ();\\n\\n type P13 = ();\\n\\n type P14 = ();\\n\\n type P15 = ();\\n\\n type P16 = ();\\n\\n type P17 = ();\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 18,\n \"score\": 67648.88045107883\n },\n {\n \"content\": \"use super::imm::{Imm, Immediate};\\n\\n\\n\\nuse std::fmt::Debug;\\n\\n\\n\\n#[doc(hidden)]\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 19,\n \"score\": 67648.02581747992\n },\n {\n \"content\": \" type P17 = [u8; 17];\\n\\n type P18 = [u8; 18];\\n\\n type P19 = [u8; 19];\\n\\n type P20 = [u8; 20];\\n\\n type P21 = [u8; 21];\\n\\n type P22 = [u8; 22];\\n\\n type P23 = [u8; 23];\\n\\n type P24 = [u8; 24];\\n\\n type P25 = [u8; 25];\\n\\n type P26 = [u8; 26];\\n\\n type P27 = [u8; 27];\\n\\n type P28 = [u8; 28];\\n\\n type P29 = [u8; 29];\\n\\n type P30 = [u8; 30];\\n\\n type P31 = [u8; 31];\\n\\n type P32 = [u8; 32];\\n\\n}\\n\\n\\n\\n/// Marker type for instructions which may accept labels or constants as\\n\\n/// arguments.\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 20,\n \"score\": 67647.598094272\n },\n {\n \"content\": \" type P17: Immediate<17>;\\n\\n type P18: Immediate<18>;\\n\\n type P19: Immediate<19>;\\n\\n type P20: Immediate<20>;\\n\\n type P21: Immediate<21>;\\n\\n type P22: Immediate<22>;\\n\\n type P23: Immediate<23>;\\n\\n type P24: Immediate<24>;\\n\\n type P25: Immediate<25>;\\n\\n type P26: Immediate<26>;\\n\\n type P27: Immediate<27>;\\n\\n type P28: Immediate<28>;\\n\\n type P29: Immediate<29>;\\n\\n type P30: Immediate<30>;\\n\\n type P31: Immediate<31>;\\n\\n type P32: Immediate<32>;\\n\\n}\\n\\n\\n\\n/// Marker type for concrete instructions, meaning instructions which cannot use\\n\\n/// labels.\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 21,\n \"score\": 67645.65868541348\n },\n {\n \"content\": \" type P18 = ();\\n\\n type P19 = ();\\n\\n type P20 = ();\\n\\n type P21 = ();\\n\\n type P22 = ();\\n\\n type P23 = ();\\n\\n type P24 = ();\\n\\n type P25 = ();\\n\\n type P26 = ();\\n\\n type P27 = ();\\n\\n type P28 = ();\\n\\n type P29 = ();\\n\\n type P30 = ();\\n\\n type P31 = ();\\n\\n type P32 = ();\\n\\n}\\n\",\n \"file_path\": \"etk-asm/src/ops/types.rs\",\n \"rank\": 22,\n \"score\": 67639.47836577774\n },\n {\n \"content\": \"#[derive(Debug, Clone, Eq, PartialEq, Hash)]\\n\\nenum Sym {\\n\\n Const(Box<[u8; 32]>),\\n\\n Var(Var),\\n\\n\\n\\n Add,\\n\\n Mul,\\n\\n Sub,\\n\\n Div,\\n\\n SDiv,\\n\\n Mod,\\n\\n SMod,\\n\\n AddMod,\\n\\n MulMod,\\n\\n Exp,\\n\\n Lt,\\n\\n Gt,\\n\\n SLt,\\n\\n SGt,\\n\\n Eq,\\n\\n And,\\n\",\n \"file_path\": \"etk-analyze/src/sym.rs\",\n \"rank\": 23,\n \"score\": 53730.80083983651\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nenum Node {\\n\\n Terminate,\\n\\n BadJump,\\n\\n Block(Box<AnnotatedBlock>),\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Node {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let block = match self {\\n\\n Self::Terminate => return write!(f, \\\"<terminate>\\\"),\\n\\n Self::BadJump => return write!(f, \\\"<bad-jump>\\\"),\\n\\n Self::Block(b) => b,\\n\\n };\\n\\n\\n\\n write!(f, \\\"Offset: 0x{:x}\\\", block.offset)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-analyze/src/cfg.rs\",\n \"rank\": 24,\n \"score\": 53726.4402050623\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum Scope {\\n\\n Same,\\n\\n Independent(Assembler),\\n\\n}\\n\\n\\n\\nimpl Scope {\\n\\n fn same() -> Self {\\n\\n Self::Same\\n\\n }\\n\\n\\n\\n fn independent() -> Self {\\n\\n Self::Independent(Assembler::new())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ingest.rs\",\n \"rank\": 25,\n \"score\": 53722.05727149553\n },\n {\n \"content\": \"struct Edge;\\n\\n\\n\\nimpl fmt::Display for Edge {\\n\\n fn fmt(&self, _: &mut fmt::Formatter) -> fmt::Result {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Node {\\n\\n fn unwrap_block(&self) -> &AnnotatedBlock {\\n\\n match self {\\n\\n Self::Block(b) => b,\\n\\n _ => panic!(\\\"not a block\\\"),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct ControlFlowGraph {\\n\\n by_offset: BTreeMap<usize, NodeIndex>,\\n\\n graph: Graph<Node, Edge>,\\n\",\n \"file_path\": \"etk-analyze/src/cfg.rs\",\n \"rank\": 26,\n \"score\": 53289.31723717645\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Root {\\n\\n original: PathBuf,\\n\\n canonicalized: PathBuf,\\n\\n}\\n\\n\\n\\nimpl Root {\\n\\n fn new(mut file: PathBuf) -> Result<Self, Error> {\\n\\n // Pop the filename.\\n\\n if !file.pop() {\\n\\n file = std::env::current_dir().context(error::Io { path: None })?;\\n\\n }\\n\\n\\n\\n let metadata = file\\n\\n .metadata()\\n\\n .with_context(|| error::Io { path: file.clone() })?;\\n\\n\\n\\n // Root must be a directory.\\n\\n if !metadata.is_dir() {\\n\\n let err = io::Error::from(io::ErrorKind::NotFound);\\n\\n return Err(err).context(error::Io { path: file });\\n\",\n \"file_path\": \"etk-asm/src/ingest.rs\",\n \"rank\": 27,\n \"score\": 53289.31723717645\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Source {\\n\\n path: PathBuf,\\n\\n nodes: std::vec::IntoIter<Node>,\\n\\n scope: Scope,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ingest.rs\",\n \"rank\": 28,\n \"score\": 53289.31723717645\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Annotator<'a> {\\n\\n basic: &'a BasicBlock,\\n\\n vars: u16,\\n\\n stacks: Vec<VecDeque<Expr>>, // TODO: I don't think we actually need to keep the\\n\\n // intermediary stacks. Probably only need the\\n\\n // current, previous, and first.\\n\\n}\\n\\n\\n\\nimpl<'a> Annotator<'a> {\\n\\n pub fn new(basic: &'a BasicBlock) -> Self {\\n\\n let mut stacks = Vec::with_capacity(basic.ops.len() + 1);\\n\\n stacks.push(VecDeque::new());\\n\\n\\n\\n Self {\\n\\n stacks,\\n\\n basic,\\n\\n vars: 0,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"etk-analyze/src/blocks/annotated.rs\",\n \"rank\": 29,\n \"score\": 48691.05383880361\n },\n {\n \"content\": \"struct StackWindow<'s> {\\n\\n vars: &'s mut u16,\\n\\n stacks: &'s mut Vec<VecDeque<Expr>>,\\n\\n pops: usize,\\n\\n pushes: usize,\\n\\n}\\n\\n\\n\\nimpl<'s> Drop for StackWindow<'s> {\\n\\n fn drop(&mut self) {\\n\\n if !std::thread::panicking() {\\n\\n assert_eq!(self.pops, 0);\\n\\n assert_eq!(self.pushes, 0);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'s> StackWindow<'s> {\\n\\n fn new(vars: &'s mut u16, stacks: &'s mut Vec<VecDeque<Expr>>, op: &ConcreteOp) -> Self {\\n\\n Self {\\n\\n vars,\\n\",\n \"file_path\": \"etk-analyze/src/blocks/annotated.rs\",\n \"rank\": 30,\n \"score\": 47500.698693543716\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct HexRead<R> {\\n\\n first_read: bool,\\n\\n file: R,\\n\\n remainder: Option<u8>,\\n\\n}\\n\\n\\n\\nimpl<R> HexRead<R> {\\n\\n fn new(file: R) -> Self {\\n\\n Self {\\n\\n first_read: true,\\n\\n remainder: None,\\n\\n file,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R> io::Read for HexRead<R>\\n\\nwhere\\n\\n R: io::Read,\\n\\n{\\n\",\n \"file_path\": \"etk-cli/src/io.rs\",\n \"rank\": 31,\n \"score\": 47500.698693543716\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct SourceStack<W> {\\n\\n output: W,\\n\\n sources: Vec<Source>,\\n\\n root: Option<Root>,\\n\\n}\\n\\n\\n\\nimpl<W> SourceStack<W> {\\n\\n fn new(output: W) -> Self {\\n\\n Self {\\n\\n output,\\n\\n sources: Default::default(),\\n\\n root: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn resolve(&mut self, path: PathBuf, scope: Scope) -> Result<PartialSource<W>, Error> {\\n\\n ensure!(self.sources.len() <= 255, error::RecursionLimit);\\n\\n\\n\\n let path = if let Some(ref root) = self.root {\\n\\n let last = self.sources.last().unwrap();\\n\",\n \"file_path\": \"etk-asm/src/ingest.rs\",\n \"rank\": 32,\n \"score\": 47500.698693543716\n },\n {\n \"content\": \"#[must_use]\\n\\nstruct PartialSource<'a, W> {\\n\\n stack: &'a mut SourceStack<W>,\\n\\n path: PathBuf,\\n\\n scope: Scope,\\n\\n}\\n\\n\\n\\nimpl<'a, W> PartialSource<'a, W> {\\n\\n fn path(&self) -> &Path {\\n\\n &self.path\\n\\n }\\n\\n\\n\\n fn push(self, nodes: Vec<Node>) -> &'a mut Source {\\n\\n self.stack.sources.push(Source {\\n\\n path: self.path,\\n\\n nodes: nodes.into_iter(),\\n\\n scope: self.scope,\\n\\n });\\n\\n\\n\\n self.stack.sources.last_mut().unwrap()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ingest.rs\",\n \"rank\": 33,\n \"score\": 45178.02577402193\n },\n {\n \"content\": \"use assert_matches::assert_matches;\\n\\n\\n\\nuse etk_asm::ingest::{Error, Ingest};\\n\\n\\n\\nuse hex_literal::hex;\\n\\n\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 34,\n \"score\": 35696.33611822716\n },\n {\n \"content\": \" 9e\\n\\n 9f\\n\\n a0\\n\\n a1\\n\\n a2\\n\\n a3\\n\\n a4\\n\\n\\n\\n f0\\n\\n f1\\n\\n f2\\n\\n f3\\n\\n f4\\n\\n f5\\n\\n\\n\\n fa\\n\\n\\n\\n fd\\n\\n fe\\n\\n ff\\n\\n \\\"\\n\\n )\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 35,\n \"score\": 35688.43174565286\n },\n {\n \"content\": \" 8a\\n\\n 8b\\n\\n 8c\\n\\n 8d\\n\\n 8e\\n\\n 8f\\n\\n 90\\n\\n 91\\n\\n 92\\n\\n 93\\n\\n 94\\n\\n 95\\n\\n 96\\n\\n 97\\n\\n 98\\n\\n 99\\n\\n 9a\\n\\n 9b\\n\\n 9c\\n\\n 9d\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 36,\n \"score\": 35684.98319795801\n },\n {\n \"content\": \" 0b\\n\\n\\n\\n 10\\n\\n 11\\n\\n 12\\n\\n 13\\n\\n 14\\n\\n 15\\n\\n 16\\n\\n 17\\n\\n 18\\n\\n 19\\n\\n 1a\\n\\n 1b\\n\\n 1c\\n\\n 1d\\n\\n\\n\\n 20\\n\\n\\n\\n 30\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 37,\n \"score\": 35684.98319795801\n },\n {\n \"content\": \" 45\\n\\n 46\\n\\n 47\\n\\n 48\\n\\n\\n\\n 50\\n\\n 51\\n\\n 52\\n\\n 53\\n\\n 54\\n\\n 55\\n\\n 56\\n\\n 57\\n\\n 58\\n\\n 59\\n\\n 5a\\n\\n 5b\\n\\n\\n\\n 60 aa\\n\\n 61 aabb\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 38,\n \"score\": 35684.98319795801\n },\n {\n \"content\": \" 31\\n\\n 32\\n\\n 33\\n\\n 34\\n\\n 35\\n\\n 36\\n\\n 37\\n\\n 38\\n\\n 39\\n\\n 3a\\n\\n 3b\\n\\n 3c\\n\\n 3d\\n\\n 3e\\n\\n 3f\\n\\n 40\\n\\n 41\\n\\n 42\\n\\n 43\\n\\n 44\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 39,\n \"score\": 35684.98319795801\n },\n {\n \"content\": \" 76 aabbccddeeff00112233445566778899aabbccddeeff00\\n\\n 77 aabbccddeeff00112233445566778899aabbccddeeff0011\\n\\n 78 aabbccddeeff00112233445566778899aabbccddeeff001122\\n\\n 79 aabbccddeeff00112233445566778899aabbccddeeff00112233\\n\\n 7a aabbccddeeff00112233445566778899aabbccddeeff0011223344\\n\\n 7b aabbccddeeff00112233445566778899aabbccddeeff001122334455\\n\\n 7c aabbccddeeff00112233445566778899aabbccddeeff00112233445566\\n\\n 7d aabbccddeeff00112233445566778899aabbccddeeff0011223344556677\\n\\n 7e aabbccddeeff00112233445566778899aabbccddeeff001122334455667788\\n\\n 7f aabbccddeeff00112233445566778899aabbccddeeff00112233445566778899\\n\\n 80\\n\\n 81\\n\\n 82\\n\\n 83\\n\\n 84\\n\\n 85\\n\\n 86\\n\\n 87\\n\\n 88\\n\\n 89\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 40,\n \"score\": 35684.98319795801\n },\n {\n \"content\": \" 62 aabbcc\\n\\n 63 aabbccdd\\n\\n 64 aabbccddee\\n\\n 65 aabbccddeeff\\n\\n 66 aabbccddeeff00\\n\\n 67 aabbccddeeff0011\\n\\n 68 aabbccddeeff001122\\n\\n 69 aabbccddeeff00112233\\n\\n 6a aabbccddeeff0011223344\\n\\n 6b aabbccddeeff001122334455\\n\\n 6c aabbccddeeff00112233445566\\n\\n 6d aabbccddeeff0011223344556677\\n\\n 6e aabbccddeeff001122334455667788\\n\\n 6f aabbccddeeff00112233445566778899\\n\\n 70 aabbccddeeff00112233445566778899aa\\n\\n 71 aabbccddeeff00112233445566778899aabb\\n\\n 72 aabbccddeeff00112233445566778899aabbcc\\n\\n 73 aabbccddeeff00112233445566778899aabbccdd\\n\\n 74 aabbccddeeff00112233445566778899aabbccddee\\n\\n 75 aabbccddeeff00112233445566778899aabbccddeeff\\n\",\n \"file_path\": \"etk-asm/tests/asm.rs\",\n \"rank\": 41,\n \"score\": 35684.98319795801\n },\n {\n \"content\": \"//! Definitions of all instructions supported by the assembler.\\n\\n\\n\\nmod error {\\n\\n use snafu::{Backtrace, Snafu};\\n\\n\\n\\n /// The error that can arise while parsing a specifier from a string.\\n\\n #[derive(Debug, Snafu)]\\n\\n #[snafu(display(\\\"unknown specifier: {}\\\", text))]\\n\\n #[snafu(visibility = \\\"pub(super)\\\")]\\n\\n #[non_exhaustive]\\n\\n pub struct UnknownSpecifierError {\\n\\n text: String,\\n\\n backtrace: Backtrace,\\n\\n }\\n\\n}\\n\\n\\n\\nmod imm;\\n\\nmod types;\\n\\n\\n\\npub use self::error::UnknownSpecifierError;\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 42,\n \"score\": 34656.91414272263\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn pops(&self) -> usize {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => or_zero!($($pops)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n impl<I> Op<I> where I: ImmediateTypes {\\n\\n /// Create a new `Op` given a particular specifier.\\n\\n ///\\n\\n /// Returns `None` if the instruction specified requires an\\n\\n /// immediate argument.\\n\\n pub fn new(spec: Op<Spec>) -> Option<Self> {\\n\\n match spec {\\n\\n $(\\n\\n pat_spec!($op$(, $arg)?) => ret_new!($op$(, $arg)?),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 43,\n \"score\": 34654.512455855765\n },\n {\n \"content\": \" )*\\n\\n };\\n\\n\\n\\n Ok(op)\\n\\n }\\n\\n\\n\\n /// Construct an `Op` by disassembling the given slice `bytes`.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if the length of `bytes` doesn't match the\\n\\n /// instruction size, as determined by the first element of `bytes`.\\n\\n pub fn from_slice(bytes: &[u8]) -> Self {\\n\\n let specifier: Op<Spec> = Op::from(bytes[0]);\\n\\n let sz = specifier.extra_len() as usize + 1;\\n\\n\\n\\n if bytes.len() != sz {\\n\\n panic!(\\n\\n \\\"got {} bytes for {}, expected {}\\\",\\n\\n bytes.len(),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 44,\n \"score\": 34653.25753411495\n },\n {\n \"content\": \" impl FromStr for Op<Spec> {\\n\\n type Err = UnknownSpecifierError;\\n\\n\\n\\n fn from_str(text: &str) -> Result<Self, Self::Err> {\\n\\n let result = match text {\\n\\n $(\\n\\n $mnemonic => Op::$op$((default!($arg)))?,\\n\\n )*\\n\\n\\n\\n _ => return error::UnknownSpecifierContext {\\n\\n text: text.clone()\\n\\n }.fail(),\\n\\n };\\n\\n\\n\\n Ok(result)\\n\\n }\\n\\n }\\n\\n\\n\\n impl fmt::Display for Op<Spec> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 45,\n \"score\": 34651.92925936686\n },\n {\n \"content\": \" fn op_new() {\\n\\n for ii in 0..=u8::MAX {\\n\\n let spec = Specifier::try_from(ii).unwrap();\\n\\n let op = AbstractOp::new(spec);\\n\\n if spec.extra_len() > 0 {\\n\\n assert_eq!(op, None);\\n\\n } else {\\n\\n let op = op.unwrap();\\n\\n assert_eq!(op.specifier(), Some(spec));\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_zero() {\\n\\n let spec = Specifier::push_for(0);\\n\\n assert_eq!(spec, Some(Specifier::Push1(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 46,\n \"score\": 34651.327662824486\n },\n {\n \"content\": \" /// A `Specifier` is an `Op` that takes no arguments. It's useful to refer\\n\\n /// to instructions without needing knowledge of any particular immediate\\n\\n /// argument value.\\n\\n pub type Specifier = Op<Spec>;\\n\\n\\n\\n impl Copy for Op<Spec> {}\\n\\n\\n\\n impl Op<Spec> {\\n\\n const LUT: [Op<Spec>; 256] = [\\n\\n $(\\n\\n Op::$op$((tuple!($arg)))?,\\n\\n )*\\n\\n ];\\n\\n\\n\\n const fn to_u8(self) -> u8 {\\n\\n to_u8!(self, 0u8; $($op$(|$arg)?, )*)\\n\\n }\\n\\n\\n\\n fn extra_len(self) -> u32 {\\n\\n match self {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 47,\n \"score\": 34651.26219567579\n },\n {\n \"content\": \"\\n\\nimpl AbstractOp {\\n\\n /// Construct a new `AbstractOp` given a specifier.\\n\\n ///\\n\\n /// Returns `None` if the instruction described by `spec` requires an immediate\\n\\n /// argument.\\n\\n pub fn new(spec: Op<Spec>) -> Option<Self> {\\n\\n Some(Self::Op(Op::new(spec)?))\\n\\n }\\n\\n\\n\\n /// Construct an `AbstractOp` with the given label.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if the instruction described by the specifier\\n\\n /// does not accept immediate arguments.\\n\\n pub fn with_label<S: Into<String>>(spec: Op<Spec>, lbl: S) -> Self {\\n\\n Self::Op(Op::with_label(spec, lbl))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 48,\n \"score\": 34649.82570902072\n },\n {\n \"content\": \"pub use self::imm::{Imm, Immediate, TryFromIntError, TryFromSliceError};\\n\\nuse self::types::ImmediateTypes;\\n\\npub use self::types::{Abstract, Concrete, Spec};\\n\\n\\n\\nuse snafu::OptionExt;\\n\\n\\n\\nuse std::cmp::{Eq, PartialEq};\\n\\nuse std::convert::{TryFrom, TryInto};\\n\\nuse std::fmt;\\n\\nuse std::str::FromStr;\\n\\n\\n\\n/// The access mode (read, write, both) of an instruction.\\n\\n#[derive(Debug, Clone, Copy, Eq, PartialEq)]\\n\\npub enum Access {\\n\\n /// Indicates that the instruction might read.\\n\\n Read,\\n\\n\\n\\n /// Indicates that the instruction might write.\\n\\n Write,\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 49,\n \"score\": 34649.36713793679\n },\n {\n \"content\": \" /// immediate if one is required.\\n\\n ///\\n\\n /// If the size of this instruction is undefined (for example a variable sized\\n\\n /// push), this function returns `None`.\\n\\n pub fn size(&self) -> Option<u32> {\\n\\n match self {\\n\\n Self::Op(op) => Some(op.size()),\\n\\n Self::Label(_) => Some(0),\\n\\n Self::Push(_) => None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return the specifier that corresponds to this `AbstractOp`.\\n\\n pub fn specifier(&self) -> Option<Op<Spec>> {\\n\\n match self {\\n\\n Self::Op(op) => Some(op.specifier()),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 50,\n \"score\": 34648.571561038945\n },\n {\n \"content\": \" /// Construct an `AbstractOp` with the given immediate argument.\\n\\n ///\\n\\n /// An error is returned if `imm` doesn't match the immediate size for\\n\\n /// the instruction described by `spec`.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if the instruction described by the specifier\\n\\n /// does not accept immediate arguments.\\n\\n pub fn with_immediate(spec: Op<Spec>, imm: &[u8]) -> Result<Self, TryFromSliceError> {\\n\\n Ok(Self::Op(Op::<Abstract>::with_immediate(spec, imm)?))\\n\\n }\\n\\n\\n\\n pub(crate) fn immediate_label(&self) -> Option<&str> {\\n\\n match self {\\n\\n Self::Op(op) => op.immediate_label(),\\n\\n Self::Push(Imm::Label(lbl)) => Some(lbl),\\n\\n Self::Push(_) => None,\\n\\n Self::Label(_) => None,\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 51,\n \"score\": 34648.457114320714\n },\n {\n \"content\": \" )*) => {\\n\\n /// Enumeration of all supported instructions.\\n\\n ///\\n\\n /// There are three flavors of `Op`:\\n\\n /// - Abstract: `Op` that may use labels or constants.\\n\\n /// - Concrete: `Op` that may only use constants.\\n\\n /// - Specifier: `Op` without any arguments.\\n\\n #[derive(Debug, Clone, PartialEq, Eq)]\\n\\n #[allow(missing_docs)]\\n\\n pub enum Op<I = Abstract> where I: ImmediateTypes {\\n\\n $($op$((I::$arg))?, )*\\n\\n }\\n\\n\\n\\n impl<I> Metadata for Op<I> where I: ImmediateTypes {\\n\\n fn is_jump_target(&self) -> bool {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => or_false!($($jt)?),\\n\\n )*\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 52,\n \"score\": 34647.079649182764\n },\n {\n \"content\": \" )*\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return the specifier that corresponds to this `Op`.\\n\\n pub fn specifier(&self) -> Op<Spec> {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => Op::$op$((default!($arg)))?,\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return the total encoded size for this instruction, including the\\n\\n /// immediate if one is required.\\n\\n pub fn size(&self) -> u32 {\\n\\n self.specifier().extra_len() + 1u32\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 53,\n \"score\": 34645.54591690646\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub(crate) fn realize(&self, address: u32) -> Result<Self, TryFromIntError> {\\n\\n let ret = match self {\\n\\n Self::Push(Imm::Label(_)) => {\\n\\n let spec = Specifier::push_for(address).context(imm::TryFromIntContext)?;\\n\\n let bytes = address.to_be_bytes();\\n\\n let start = bytes.len() - spec.extra_len() as usize;\\n\\n AbstractOp::with_immediate(spec, &bytes[start..]).unwrap()\\n\\n }\\n\\n Self::Push(Imm::Constant(_)) => {\\n\\n panic!(\\\"only pushes with a label can be realized\\\");\\n\\n }\\n\\n Self::Op(op) => Self::Op(op.realize(address)?),\\n\\n Self::Label(_) => panic!(\\\"labels cannot be realized\\\"),\\n\\n };\\n\\n\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 54,\n \"score\": 34644.08901231699\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Shorthand for `Op<Concrete>`, that is an `Op` that can only accept\\n\\n /// constants as arguments.\\n\\n pub type ConcreteOp = Op<Concrete>;\\n\\n\\n\\n impl Op<Concrete> {\\n\\n /// Construct an `Op` with the given immediate argument.\\n\\n ///\\n\\n /// An error is returned if `imm` doesn't match the immediate size for\\n\\n /// the instruction described by `spec`.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if the instruction described by the specifier\\n\\n /// does not accept immediate arguments.\\n\\n pub fn with_immediate(spec: Op<Spec>, imm: &[u8]) -> Result<Self, std::array::TryFromSliceError> {\\n\\n let op = match spec {\\n\\n $(\\n\\n pat_spec!($op$(, $arg)?) => ret_with_immediate!(imm, $op$(, $arg)?),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 55,\n \"score\": 34644.08725230398\n },\n {\n \"content\": \" specifier,\\n\\n sz\\n\\n );\\n\\n }\\n\\n\\n\\n match specifier {\\n\\n $(\\n\\n pat_spec!($op$(, $arg)?) => ret_from_slice!(bytes, $op$(, $arg)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn assemble(&self, buf: &mut Vec<u8>) {\\n\\n buf.push(self.specifier().into());\\n\\n\\n\\n let args = match self {\\n\\n $(\\n\\n pat_cap!(a, $op$(, $arg)?) => {\\n\\n ret_assemble!(a$(, $arg)?)\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 56,\n \"score\": 34643.93206043448\n },\n {\n \"content\": \" pub(crate) fn concretize(self) -> Option<Op<Concrete>> {\\n\\n let res = match self {\\n\\n Self::Op(op) => op.concretize(),\\n\\n Self::Push(Imm::Label(_)) => panic!(\\\"label immediates must be realized first\\\"),\\n\\n Self::Push(Imm::Constant(konst)) => {\\n\\n let mut trimmed = konst.as_slice();\\n\\n while !trimmed.is_empty() && trimmed[0] == 0 {\\n\\n trimmed = &trimmed[1..];\\n\\n }\\n\\n let spec = Specifier::push(trimmed.len() as u32)?;\\n\\n\\n\\n Op::<Concrete>::with_immediate(spec, trimmed).unwrap()\\n\\n }\\n\\n Self::Label(_) => panic!(\\\"labels cannot be concretized\\\"),\\n\\n };\\n\\n\\n\\n Some(res)\\n\\n }\\n\\n\\n\\n /// Return the total encoded size for this instruction, including the\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 57,\n \"score\": 34643.536229450256\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn specifier_push_for_4294967295() {\\n\\n let spec = Specifier::push_for(4294967295);\\n\\n assert_eq!(spec, Some(Specifier::Push4(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_to_u8_selfdestruct() {\\n\\n let spec = Specifier::SelfDestruct;\\n\\n assert_eq!(0xffu8, spec.into());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 58,\n \"score\": 34643.46202602391\n },\n {\n \"content\": \" )*\\n\\n };\\n\\n\\n\\n buf.extend_from_slice(args);\\n\\n }\\n\\n }\\n\\n\\n\\n impl fmt::Display for Op<Concrete> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let sp = self.specifier();\\n\\n\\n\\n match self {\\n\\n $(\\n\\n pat_cap!(a, $op$(, $arg)?) => {\\n\\n write_cap!(f, sp, Imm::Constant(a)$(, $arg)?)\\n\\n }\\n\\n )*\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 59,\n \"score\": 34643.25419270938\n },\n {\n \"content\": \" $(\\n\\n pat!($op$(, $arg)?) => extra_len!($($arg)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n }\\n\\n\\n\\n impl From<u8> for Op<Spec> {\\n\\n fn from(v: u8) -> Self {\\n\\n Self::LUT[v as usize]\\n\\n }\\n\\n }\\n\\n\\n\\n impl From<Op<Spec>> for u8 {\\n\\n fn from(sp: Op<Spec>) -> u8 {\\n\\n sp.to_u8()\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 60,\n \"score\": 34642.72836644952\n },\n {\n \"content\": \" /// Indicates that the instruction may read and/or write.\\n\\n ReadWrite,\\n\\n}\\n\\n\\n\\nimpl Access {\\n\\n /// Returns true if the instruction might read.\\n\\n pub fn reads(self) -> bool {\\n\\n matches!(self, Self::Read | Self::ReadWrite)\\n\\n }\\n\\n\\n\\n /// Returns true if the instruction might write.\\n\\n pub fn writes(self) -> bool {\\n\\n matches!(self, Self::Write | Self::ReadWrite)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Extra information about an instruction.\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 61,\n \"score\": 34642.62731661481\n },\n {\n \"content\": \" $(\\n\\n pat_spec!($op$(, $arg)?) => ret_with_label!(lbl, $op$(, $arg)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n /// Construct an `Op` with the given immediate argument.\\n\\n ///\\n\\n /// An error is returned if `imm` doesn't match the immediate size for\\n\\n /// the instruction described by `spec`.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if the instruction described by the specifier\\n\\n /// does not accept immediate arguments.\\n\\n pub fn with_immediate(spec: Op<Spec>, imm: &[u8]) -> Result<Self, TryFromSliceError> {\\n\\n let op = match spec {\\n\\n $(\\n\\n pat_spec!($op$(, $arg)?) => ret_with_immediate!(imm, $op$(, $arg)?),\\n\\n )*\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 62,\n \"score\": 34642.310034311435\n },\n {\n \"content\": \" };\\n\\n\\n\\n Ok(op)\\n\\n }\\n\\n\\n\\n /// The label to be pushed on the stack. Only relevant for push instructions.\\n\\n pub(crate) fn immediate_label(&self) -> Option<&str> {\\n\\n match self {\\n\\n $(\\n\\n pat_label!(a, $op$(, $arg)?) => ret_label!(a$(, $arg)?),\\n\\n )*\\n\\n\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n // TODO: Rename `realize`\\n\\n pub(crate) fn realize(&self, address: u32) -> Result<Self, TryFromIntError> {\\n\\n let op = match self {\\n\\n $(\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 63,\n \"score\": 34641.97799224322\n },\n {\n \"content\": \" Self::Op(op) => op.pops(),\\n\\n Self::Push(_) => 0,\\n\\n Self::Label(_) => 0,\\n\\n }\\n\\n }\\n\\n\\n\\n fn pushes(&self) -> usize {\\n\\n match self {\\n\\n Self::Op(op) => op.pushes(),\\n\\n Self::Push(_) => 1,\\n\\n Self::Label(_) => 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use assert_matches::assert_matches;\\n\\n\\n\\n use std::convert::TryInto;\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 64,\n \"score\": 34641.44556505271\n },\n {\n \"content\": \" let txt = match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => $mnemonic,\\n\\n )*\\n\\n };\\n\\n write!(f, \\\"{}\\\", txt)\\n\\n }\\n\\n }\\n\\n\\n\\n impl Op<Abstract> {\\n\\n /// Construct an `Op` with the given label.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if the instruction described by the specifier\\n\\n /// does not accept immediate arguments.\\n\\n pub fn with_label<S: Into<String>>(spec: Op<Spec>, lbl: S) -> Self {\\n\\n let lbl = lbl.into();\\n\\n\\n\\n match spec {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 65,\n \"score\": 34641.20303481837\n },\n {\n \"content\": \"\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Op<Spec> {\\n\\n pub(crate) fn push_for(n: u32) -> Option<Specifier> {\\n\\n let bits = 0u32.leading_zeros() - n.leading_zeros();\\n\\n let bytes = (bits + 8 - 1) / 8;\\n\\n Self::push(bytes)\\n\\n }\\n\\n\\n\\n /// Converts a push instruction to the next larger push size.\\n\\n ///\\n\\n /// For example, a `push2` will become a `push3`.\\n\\n ///\\n\\n /// ## Panics\\n\\n ///\\n\\n /// This function panics if `self` is not a push instruction.\\n\\n pub fn upsize(self) -> Option<Self> {\\n\\n let extra = match self.extra_len() {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 66,\n \"score\": 34641.14323274353\n },\n {\n \"content\": \"\\n\\nimpl From<Op<Concrete>> for AbstractOp {\\n\\n fn from(cop: Op<Concrete>) -> Self {\\n\\n Self::Op(cop.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for AbstractOp {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n Self::Op(op) => write!(f, \\\"{}\\\", op),\\n\\n Self::Push(txt) => write!(f, r#\\\"%push({})\\\"#, txt),\\n\\n Self::Label(lbl) => write!(f, r#\\\".{}:\\\"#, lbl),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Metadata for AbstractOp {\\n\\n fn is_jump(&self) -> bool {\\n\\n match self {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 67,\n \"score\": 34640.85413771338\n },\n {\n \"content\": \" $(\\n\\n pat_cap_concrete!(a, $op$(, $arg)?) =>\\n\\n ret_from_concrete!($op, a$(, $arg)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n impl fmt::Display for Op<Abstract> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n let sp = self.specifier();\\n\\n\\n\\n match self {\\n\\n $(\\n\\n pat_cap!(a, $op$(, $arg)?) => {\\n\\n write_cap!(f, sp, a$(, $arg)?)\\n\\n }\\n\\n )*\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 68,\n \"score\": 34640.321216141274\n },\n {\n \"content\": \" Revert(mnemonic=\\\"revert\\\", pops=2, memory=Access::ReadWrite, exit=true),\\n\\n Invalid(mnemonic=\\\"invalid\\\", exit=true),\\n\\n SelfDestruct(mnemonic=\\\"selfdestruct\\\", pops=1, exit=true),\\n\\n}\\n\\n\\n\\n/// Like an [`Op`], except it also supports virtual instructions.\\n\\n///\\n\\n/// In addition to the real EVM instructions, `AbstractOp` also supports defining\\n\\n/// labels, and pushing variable length immediate arguments.\\n\\n#[derive(Debug, Clone, Eq, PartialEq)]\\n\\npub enum AbstractOp {\\n\\n /// A real `Op`, as opposed to a label or variable sized push.\\n\\n Op(Op<Abstract>),\\n\\n\\n\\n /// A label, which is a virtual instruction.\\n\\n Label(String),\\n\\n\\n\\n /// A variable sized push, which is a virtual instruction.\\n\\n Push(Imm<Vec<u8>>),\\n\\n}\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 69,\n \"score\": 34638.48985252557\n },\n {\n \"content\": \" let parsed = Specifier::try_from(ii).unwrap();\\n\\n if ii == 0xfe {\\n\\n assert_eq!(Specifier::Invalid, parsed);\\n\\n } else {\\n\\n assert_ne!(Specifier::Invalid, parsed);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_through_str() {\\n\\n for ii in 0..=u8::MAX {\\n\\n let spec = Specifier::try_from(ii).unwrap();\\n\\n let txt = spec.to_string();\\n\\n let parsed: Specifier = txt.parse().unwrap();\\n\\n assert_eq!(spec, parsed);\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 70,\n \"score\": 34638.45924037879\n },\n {\n \"content\": \" assert_eq!(spec, Some(Specifier::Push2(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_65536() {\\n\\n let spec = Specifier::push_for(65536);\\n\\n assert_eq!(spec, Some(Specifier::Push3(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_16777215() {\\n\\n let spec = Specifier::push_for(16777215);\\n\\n assert_eq!(spec, Some(Specifier::Push3(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_16777216() {\\n\\n let spec = Specifier::push_for(16777216);\\n\\n assert_eq!(spec, Some(Specifier::Push4(())));\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 71,\n \"score\": 34638.132095870686\n },\n {\n \"content\": \" fn specifier_push_for_one() {\\n\\n let spec = Specifier::push_for(1);\\n\\n assert_eq!(spec, Some(Specifier::Push1(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_255() {\\n\\n let spec = Specifier::push_for(255);\\n\\n assert_eq!(spec, Some(Specifier::Push1(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_256() {\\n\\n let spec = Specifier::push_for(256);\\n\\n assert_eq!(spec, Some(Specifier::Push2(())));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_push_for_65535() {\\n\\n let spec = Specifier::push_for(65535);\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 72,\n \"score\": 34637.84161270319\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn memory_access(&self) -> Option<Access> {\\n\\n match self {\\n\\n Self::Op(op) => op.storage_access(),\\n\\n Self::Push(_) => None,\\n\\n Self::Label(_) => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn storage_access(&self) -> Option<Access> {\\n\\n match self {\\n\\n Self::Op(op) => op.storage_access(),\\n\\n Self::Push(_) => None,\\n\\n Self::Label(_) => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn pops(&self) -> usize {\\n\\n match self {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 73,\n \"score\": 34635.72599688632\n },\n {\n \"content\": \" pat_label!(_a, $op$(, $arg)?) => ret_realize!($op, address$(, $arg)?),\\n\\n )*\\n\\n _ => panic!(\\\"only push ops with labels can be realized\\\"),\\n\\n };\\n\\n Ok(op)\\n\\n }\\n\\n\\n\\n pub(crate) fn concretize(self) -> Op<Concrete> {\\n\\n match self {\\n\\n $(\\n\\n pat_const!(a, $op$(, $arg)?) => ret_concretize!($op, a$(, $arg)?),\\n\\n )*\\n\\n _ => panic!(\\\"labels must be resolved be concretizing\\\"),\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n impl From<Op<Concrete>> for Op<Abstract> {\\n\\n fn from(concrete: Op<Concrete>) -> Self {\\n\\n match concrete {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 74,\n \"score\": 34635.58507249817\n },\n {\n \"content\": \"\\n\\n /// How many stack elements this instruction pushes.\\n\\n fn pushes(&self) -> usize;\\n\\n}\\n\\n\\n\\nmacro_rules! tuple {\\n\\n ($arg:ident) => {\\n\\n ()\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! default {\\n\\n ($arg:ident) => {\\n\\n Default::default()\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! pat {\\n\\n ($op:ident) => {\\n\\n Self::$op\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 75,\n \"score\": 34634.88773724128\n },\n {\n \"content\": \" Self::$op($cap)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! write_cap {\\n\\n ($f:ident, $sp:expr, $cap:expr) => {\\n\\n write!($f, \\\"{}\\\", $sp)\\n\\n };\\n\\n ($f:ident, $sp:expr, $cap:expr, $arg:ident) => {\\n\\n write!($f, \\\"{} {}\\\", $sp, $cap)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! pat_const {\\n\\n ($cap:ident, $op:ident) => {\\n\\n Self::$op\\n\\n };\\n\\n ($cap:ident, $op:ident, $arg:ident) => {\\n\\n Self::$op(Imm::Constant($cap))\\n\\n };\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 76,\n \"score\": 34633.74827209561\n },\n {\n \"content\": \" 0 => panic!(\\\"only push ops can be upsized\\\"),\\n\\n e => e,\\n\\n };\\n\\n\\n\\n Self::push(extra + 1)\\n\\n }\\n\\n\\n\\n /// Create a new push instruction with the given immediate size.\\n\\n pub fn push(bytes: u32) -> Option<Self> {\\n\\n let spec = match bytes {\\n\\n 0 | 1 => Self::Push1(()),\\n\\n 2 => Self::Push2(()),\\n\\n 3 => Self::Push3(()),\\n\\n 4 => Self::Push4(()),\\n\\n 5 => Self::Push5(()),\\n\\n 6 => Self::Push6(()),\\n\\n 7 => Self::Push7(()),\\n\\n 8 => Self::Push8(()),\\n\\n 9 => Self::Push9(()),\\n\\n 10 => Self::Push10(()),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 77,\n \"score\": 34633.728918404224\n },\n {\n \"content\": \" 31 => Self::Push31(()),\\n\\n 32 => Self::Push32(()),\\n\\n _ => return None,\\n\\n };\\n\\n\\n\\n Some(spec)\\n\\n }\\n\\n}\\n\\n\\n\\nops! {\\n\\n Stop(mnemonic=\\\"stop\\\", exit=true),\\n\\n Add(mnemonic=\\\"add\\\", pops=2, pushes=1),\\n\\n Mul(mnemonic=\\\"mul\\\", pops=2, pushes=1),\\n\\n Sub(mnemonic=\\\"sub\\\", pops=2, pushes=1),\\n\\n Div(mnemonic=\\\"div\\\", pops=2, pushes=1),\\n\\n SDiv(mnemonic=\\\"sdiv\\\", pops=2, pushes=1),\\n\\n Mod(mnemonic=\\\"mod\\\", pops=2, pushes=1),\\n\\n SMod(mnemonic=\\\"smod\\\", pops=2, pushes=1),\\n\\n AddMod(mnemonic=\\\"addmod\\\", pops=3, pushes=1),\\n\\n MulMod(mnemonic=\\\"mulmod\\\", pops=3, pushes=1),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 78,\n \"score\": 34633.51473635895\n },\n {\n \"content\": \"\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn u8_into_imm1() {\\n\\n let x: u8 = 0xdc;\\n\\n let imm: Imm<[u8; 1]> = x.into();\\n\\n assert_matches!(imm, Imm::Constant([0xdc]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn u16_try_into_imm1() {\\n\\n let x: u16 = 0xFF;\\n\\n let imm: Imm<[u8; 1]> = x.try_into().unwrap();\\n\\n assert_matches!(imm, Imm::Constant([0xFF]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn imm1_try_from_u16_too_large() {\\n\\n let x: u16 = 0x0100;\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 79,\n \"score\": 34632.70006173199\n },\n {\n \"content\": \"\\n\\nmacro_rules! ret_new {\\n\\n ($op:ident) => {\\n\\n Some(Self::$op)\\n\\n };\\n\\n ($op:ident, $arg:ident) => {\\n\\n None\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_with_immediate {\\n\\n ($imm:ident, $op:ident) => {\\n\\n panic!()\\n\\n };\\n\\n ($imm:ident, $op:ident, $arg:ident) => {\\n\\n Self::$op($imm.try_into()?)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_with_label {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 80,\n \"score\": 34632.63686115372\n },\n {\n \"content\": \" };\\n\\n ($arg:ident) => {{\\n\\n fn helper<T: ImmediateTypes>() -> u32 {\\n\\n T::$arg::extra_len().try_into().unwrap()\\n\\n }\\n\\n helper::<Spec>()\\n\\n }};\\n\\n}\\n\\n\\n\\nmacro_rules! to_u8 {\\n\\n ($test:ident, $c:expr; $first:ident, ) => {\\n\\n $c\\n\\n };\\n\\n ($test:ident, $c:expr; $first:ident$(|$arg:ident)?, $($rest:ident$(|$args:ident)?, )+) => {\\n\\n if matches!($test, pat!($first$(, $arg)?)) {\\n\\n $c\\n\\n } else {\\n\\n to_u8!($test, $c + 1u8; $($rest$(|$args)?, )+)\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 81,\n \"score\": 34632.29163052648\n },\n {\n \"content\": \" $(\\n\\n pat!($op$(, $arg)?) => or_none!($($storage)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n fn memory_access(&self) -> Option<Access> {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => or_none!($($memory)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n fn pushes(&self) -> usize {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => or_zero!($($pushes)?),\\n\\n )*\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 82,\n \"score\": 34630.6481274611\n },\n {\n \"content\": \" ($imm:ident, $op:ident) => {\\n\\n panic!()\\n\\n };\\n\\n ($imm:ident, $op:ident, $arg:ident) => {\\n\\n Self::$op($imm.into())\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_from_slice {\\n\\n ($imm:ident, $op:ident) => {\\n\\n Self::$op\\n\\n };\\n\\n ($imm:ident, $op:ident, $arg:ident) => {\\n\\n Self::$op(TryFrom::try_from(&$imm[1..]).unwrap())\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! extra_len {\\n\\n () => {\\n\\n 0\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 83,\n \"score\": 34630.38508207129\n },\n {\n \"content\": \" assert_matches!(imm, Imm::Constant([0xfe, 0xdc]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn u128_into_imm32() {\\n\\n let x: u128 = 0x1023456789abcdef0123456789abcdef;\\n\\n let imm: Imm<[u8; 32]> = x.into();\\n\\n assert_matches!(\\n\\n imm,\\n\\n Imm::Constant([\\n\\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\\n\\n 0x00, 0x00, 0x10, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef, 0x01, 0x23, 0x45, 0x67,\\n\\n 0x89, 0xab, 0xcd, 0xef,\\n\\n ])\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn specifier_from_u8() {\\n\\n for ii in 0..=u8::MAX {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 84,\n \"score\": 34630.038107182234\n },\n {\n \"content\": \"}\\n\\n\\n\\nmacro_rules! pat_label {\\n\\n ($cap:ident, $op:ident) => { Self::$op };\\n\\n ($cap:ident, $op:ident, $arg:ident) => { Self::$op(Imm::Label(ref $cap)) };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_label {\\n\\n ($cap:ident) => {\\n\\n None\\n\\n };\\n\\n ($cap:ident, $arg:ident) => {\\n\\n Some($cap)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_realize {\\n\\n ($op:ident, $addr:ident) => {\\n\\n panic!()\\n\\n };\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 85,\n \"score\": 34629.28122028067\n },\n {\n \"content\": \" Self::Op(op) => op.is_jump(),\\n\\n Self::Push(_) => false,\\n\\n Self::Label(_) => false,\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_jump_target(&self) -> bool {\\n\\n match self {\\n\\n Self::Op(op) => op.is_jump_target(),\\n\\n Self::Push(_) => false,\\n\\n Self::Label(_) => false,\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_exit(&self) -> bool {\\n\\n match self {\\n\\n Self::Op(op) => op.is_exit(),\\n\\n Self::Push(_) => false,\\n\\n Self::Label(_) => false,\\n\\n }\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 86,\n \"score\": 34628.98457264397\n },\n {\n \"content\": \" Imm::<[u8; 1]>::try_from(x).unwrap_err();\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn imm15_try_from_u128_too_large() {\\n\\n let x: u128 = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF + 0x1;\\n\\n Imm::<[u8; 15]>::try_from(x).unwrap_err();\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn u8_into_imm2() {\\n\\n let x: u8 = 0xdc;\\n\\n let imm: Imm<[u8; 2]> = x.into();\\n\\n assert_matches!(imm, Imm::Constant([0x00, 0xdc]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn u16_into_imm2() {\\n\\n let x: u16 = 0xfedc;\\n\\n let imm: Imm<[u8; 2]> = x.into();\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 87,\n \"score\": 34627.93551902705\n },\n {\n \"content\": \" Invalid2d(mnemonic=\\\"invalid_2d\\\", exit=true),\\n\\n Invalid2e(mnemonic=\\\"invalid_2e\\\", exit=true),\\n\\n Invalid2f(mnemonic=\\\"invalid_2f\\\", exit=true),\\n\\n\\n\\n Address(mnemonic=\\\"address\\\", pushes=1),\\n\\n Balance(mnemonic=\\\"balance\\\", pops=1, pushes=1),\\n\\n Origin(mnemonic=\\\"origin\\\", pushes=1),\\n\\n Caller(mnemonic=\\\"caller\\\", pushes=1),\\n\\n CallValue(mnemonic=\\\"callvalue\\\", pushes=1),\\n\\n CallDataLoad(mnemonic=\\\"calldataload\\\", pops=1, pushes=1),\\n\\n CallDataSize(mnemonic=\\\"calldatasize\\\", pushes=1),\\n\\n CallDataCopy(mnemonic=\\\"calldatacopy\\\", pops=3, memory=Access::Write),\\n\\n CodeSize(mnemonic=\\\"codesize\\\", pushes=1),\\n\\n CodeCopy(mnemonic=\\\"codecopy\\\", pops=3, memory=Access::Write),\\n\\n GasPrice(mnemonic=\\\"gasprice\\\", pushes=1),\\n\\n ExtCodeSize(mnemonic=\\\"extcodesize\\\", pops=1, pushes=1),\\n\\n ExtCodeCopy(mnemonic=\\\"extcodecopy\\\", pops=4, memory=Access::Write),\\n\\n ReturnDataSize(mnemonic=\\\"returndatasize\\\", pushes=1),\\n\\n ReturnDataCopy(mnemonic=\\\"returndatacopy\\\", pops=3, memory=Access::Write),\\n\\n ExtCodeHash(mnemonic=\\\"extcodehash\\\", pops=1, pushes=1),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 88,\n \"score\": 34627.921211499\n },\n {\n \"content\": \" };\\n\\n ($op:ident, $arg:ident) => {\\n\\n Self::$op(_)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! pat_cap_concrete {\\n\\n ($cap:ident, $op:ident) => {\\n\\n Op::<Concrete>::$op\\n\\n };\\n\\n ($cap:ident, $op:ident, $arg:ident) => {\\n\\n Op::<Concrete>::$op($cap)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! pat_cap {\\n\\n ($cap:ident, $op:ident) => {\\n\\n Self::$op\\n\\n };\\n\\n ($cap:ident, $op:ident, $arg:ident) => {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 89,\n \"score\": 34627.3715635953\n },\n {\n \"content\": \" ($op:ident, $addr:ident, $arg:ident) => {\\n\\n Op::$op($addr.try_into()?)\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_from_concrete {\\n\\n ($op:ident, $addr:ident) => {\\n\\n Self::$op\\n\\n };\\n\\n ($op:ident, $addr:expr, $arg:ident) => {\\n\\n Self::$op(Imm::Constant($addr))\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_concretize {\\n\\n ($op:ident, $addr:ident) => {\\n\\n Op::$op\\n\\n };\\n\\n ($op:ident, $addr:expr, $arg:ident) => {\\n\\n Op::$op($addr)\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 90,\n \"score\": 34627.291899687836\n },\n {\n \"content\": \" };\\n\\n}\\n\\n\\n\\nmacro_rules! ret_assemble {\\n\\n ($op:ident) => {\\n\\n return\\n\\n };\\n\\n ($addr:ident, $arg:ident) => {\\n\\n $addr as &[u8]\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! pat_spec {\\n\\n ($op:ident) => {\\n\\n Op::<Spec>::$op\\n\\n };\\n\\n ($op:ident, $arg:ident) => {\\n\\n Op::<Spec>::$op(_)\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 91,\n \"score\": 34626.845585212846\n },\n {\n \"content\": \" 11 => Self::Push11(()),\\n\\n 12 => Self::Push12(()),\\n\\n 13 => Self::Push13(()),\\n\\n 14 => Self::Push14(()),\\n\\n 15 => Self::Push15(()),\\n\\n 16 => Self::Push16(()),\\n\\n 17 => Self::Push17(()),\\n\\n 18 => Self::Push18(()),\\n\\n 19 => Self::Push19(()),\\n\\n 20 => Self::Push20(()),\\n\\n 21 => Self::Push21(()),\\n\\n 22 => Self::Push22(()),\\n\\n 23 => Self::Push23(()),\\n\\n 24 => Self::Push24(()),\\n\\n 25 => Self::Push25(()),\\n\\n 26 => Self::Push26(()),\\n\\n 27 => Self::Push27(()),\\n\\n 28 => Self::Push28(()),\\n\\n 29 => Self::Push29(()),\\n\\n 30 => Self::Push30(()),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 92,\n \"score\": 34624.54498279805\n },\n {\n \"content\": \"}\\n\\n\\n\\nmacro_rules! or_false {\\n\\n () => {\\n\\n false\\n\\n };\\n\\n ($v:expr) => {\\n\\n $v\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! or_none {\\n\\n () => {\\n\\n None\\n\\n };\\n\\n ($v:expr) => {\\n\\n Some($v)\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 93,\n \"score\": 34623.734812120776\n },\n {\n \"content\": \" InvalidEe(mnemonic=\\\"invalid_ee\\\", exit=true),\\n\\n InvalidEf(mnemonic=\\\"invalid_ef\\\", exit=true),\\n\\n\\n\\n Create(mnemonic=\\\"create\\\", pops=3, pushes=1, memory=Access::Read),\\n\\n Call(mnemonic=\\\"call\\\", pops=7, pushes=1, memory=Access::ReadWrite),\\n\\n CallCode(mnemonic=\\\"callcode\\\", pops=7, pushes=1, memory=Access::ReadWrite),\\n\\n Return(mnemonic=\\\"return\\\", pops=2, memory=Access::Read, exit=true),\\n\\n DelegateCall(mnemonic=\\\"delegatecall\\\", pops=6, pushes=1, memory=Access::ReadWrite),\\n\\n Create2(mnemonic=\\\"create2\\\", pops=4, pushes=1, memory=Access::Read),\\n\\n\\n\\n InvalidF6(mnemonic=\\\"invalid_f6\\\", exit=true),\\n\\n InvalidF7(mnemonic=\\\"invalid_f7\\\", exit=true),\\n\\n InvalidF8(mnemonic=\\\"invalid_f8\\\", exit=true),\\n\\n InvalidF9(mnemonic=\\\"invalid_f9\\\", exit=true),\\n\\n\\n\\n StaticCall(mnemonic=\\\"staticcall\\\", pops=6, pushes=1, memory=Access::ReadWrite),\\n\\n\\n\\n InvalidFb(mnemonic=\\\"invalid_fb\\\", exit=true),\\n\\n InvalidFc(mnemonic=\\\"invalid_fc\\\", exit=true),\\n\\n\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 94,\n \"score\": 34623.64122605235\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn is_exit(&self) -> bool {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => or_false!($($exit)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_jump(&self) -> bool {\\n\\n match self {\\n\\n $(\\n\\n pat!($op$(, $arg)?) => or_false!($($jmp)?),\\n\\n )*\\n\\n }\\n\\n }\\n\\n\\n\\n fn storage_access(&self) -> Option<Access> {\\n\\n match self {\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 95,\n \"score\": 34622.952534309974\n },\n {\n \"content\": \"macro_rules! or_zero {\\n\\n () => {\\n\\n 0\\n\\n };\\n\\n ($v:expr) => {\\n\\n $v\\n\\n };\\n\\n}\\n\\n\\n\\nmacro_rules! ops {\\n\\n ($($op:ident(\\n\\n mnemonic = $mnemonic:literal\\n\\n $(, arg = $arg:ident )?\\n\\n $(, pops = $pops:literal)?\\n\\n $(, pushes = $pushes:literal)?\\n\\n $(, memory = $memory:expr)?\\n\\n $(, storage = $storage:expr)?\\n\\n $(, exit = $exit:expr)?\\n\\n $(, jump = $jmp:expr)?\\n\\n $(, jump_target = $jt:expr)?),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 96,\n \"score\": 34622.44714084478\n },\n {\n \"content\": \" Exp(mnemonic=\\\"exp\\\", pops=2, pushes=1),\\n\\n SignExtend(mnemonic=\\\"signextend\\\", pops=2, pushes=1),\\n\\n\\n\\n Invalid0c(mnemonic=\\\"invalid_0c\\\", exit=true),\\n\\n Invalid0d(mnemonic=\\\"invalid_0d\\\", exit=true),\\n\\n Invalid0e(mnemonic=\\\"invalid_0e\\\", exit=true),\\n\\n Invalid0f(mnemonic=\\\"invalid_0f\\\", exit=true),\\n\\n\\n\\n Lt(mnemonic=\\\"lt\\\", pops=2, pushes=1),\\n\\n Gt(mnemonic=\\\"gt\\\", pops=2, pushes=1),\\n\\n SLt(mnemonic=\\\"slt\\\", pops=2, pushes=1),\\n\\n SGt(mnemonic=\\\"sgt\\\", pops=2, pushes=1),\\n\\n Eq(mnemonic=\\\"eq\\\", pops=2, pushes=1),\\n\\n IsZero(mnemonic=\\\"iszero\\\", pops=1, pushes=1),\\n\\n And(mnemonic=\\\"and\\\", pops=2, pushes=1),\\n\\n Or(mnemonic=\\\"or\\\", pops=2, pushes=1),\\n\\n Xor(mnemonic=\\\"xor\\\", pops=2, pushes=1),\\n\\n Not(mnemonic=\\\"not\\\", pops=1, pushes=1),\\n\\n Byte(mnemonic=\\\"byte\\\", pops=2, pushes=1),\\n\\n Shl(mnemonic=\\\"shl\\\", pops=2, pushes=1),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 97,\n \"score\": 34621.55805932539\n },\n {\n \"content\": \" BlockHash(mnemonic=\\\"blockhash\\\", pops=1, pushes=1),\\n\\n Coinbase(mnemonic=\\\"coinbase\\\", pushes=1),\\n\\n Timestamp(mnemonic=\\\"timestamp\\\", pushes=1),\\n\\n Number(mnemonic=\\\"number\\\", pushes=1),\\n\\n Difficulty(mnemonic=\\\"difficulty\\\", pushes=1),\\n\\n GasLimit(mnemonic=\\\"gaslimit\\\", pushes=1),\\n\\n ChainId(mnemonic=\\\"chainid\\\", pushes=1),\\n\\n SelfBalance(mnemonic=\\\"selfbalance\\\", pushes=1),\\n\\n BaseFee(mnemonic=\\\"basefee\\\", pushes=1),\\n\\n\\n\\n Invalid49(mnemonic=\\\"invalid_49\\\", exit=true),\\n\\n Invalid4a(mnemonic=\\\"invalid_4a\\\", exit=true),\\n\\n Invalid4b(mnemonic=\\\"invalid_4b\\\", exit=true),\\n\\n Invalid4c(mnemonic=\\\"invalid_4c\\\", exit=true),\\n\\n Invalid4d(mnemonic=\\\"invalid_4d\\\", exit=true),\\n\\n Invalid4e(mnemonic=\\\"invalid_4e\\\", exit=true),\\n\\n Invalid4f(mnemonic=\\\"invalid_4f\\\", exit=true),\\n\\n\\n\\n Pop(mnemonic=\\\"pop\\\", pops=1),\\n\\n MLoad(mnemonic=\\\"mload\\\", pops=1, pushes=1, memory=Access::Read),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 98,\n \"score\": 34620.633618364336\n },\n {\n \"content\": \" MStore(mnemonic=\\\"mstore\\\", pops=2, memory=Access::Read),\\n\\n MStore8(mnemonic=\\\"mstore8\\\", pops=2, memory=Access::Read),\\n\\n SLoad(mnemonic=\\\"sload\\\", pops=1, pushes=1, storage=Access::Read),\\n\\n SStore(mnemonic=\\\"sstore\\\", pops=2, storage=Access::Write),\\n\\n Jump(mnemonic=\\\"jump\\\", pops=1, jump=true),\\n\\n JumpI(mnemonic=\\\"jumpi\\\", pops=2, jump=true),\\n\\n GetPc(mnemonic=\\\"pc\\\", pushes=1),\\n\\n MSize(mnemonic=\\\"msize\\\", pushes=1, memory=Access::Read),\\n\\n Gas(mnemonic=\\\"gas\\\", pushes=1),\\n\\n JumpDest(mnemonic=\\\"jumpdest\\\", jump_target=true),\\n\\n\\n\\n Invalid5c(mnemonic=\\\"invalid_5c\\\", exit=true),\\n\\n Invalid5d(mnemonic=\\\"invalid_5d\\\", exit=true),\\n\\n Invalid5e(mnemonic=\\\"invalid_5e\\\", exit=true),\\n\\n Invalid5f(mnemonic=\\\"invalid_5f\\\", exit=true),\\n\\n\\n\\n Push1(mnemonic=\\\"push1\\\", arg=P1, pushes=1),\\n\\n Push2(mnemonic=\\\"push2\\\", arg=P2, pushes=1),\\n\\n Push3(mnemonic=\\\"push3\\\", arg=P3, pushes=1),\\n\\n Push4(mnemonic=\\\"push4\\\", arg=P4, pushes=1),\\n\",\n \"file_path\": \"etk-asm/src/ops.rs\",\n \"rank\": 99,\n \"score\": 34620.439835378056\n }\n]","isConversational":false}}},{"rowIdx":3698,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/main.rs"},"repo_name":{"kind":"string","value":"Nukesor/geil"},"commit":{"kind":"string","value":"a536173698885d0e98689d2efd195a90493e0114"},"file_code":{"kind":"string","value":"use std::collections::HashMap;\nuse std::env::vars;\n\nuse anyhow::Result;\nuse clap::Parser;\nuse indicatif::{ProgressBar, ProgressStyle};\nuse log::error;\nuse rayon::prelude::*;\nuse simplelog::{Config, LevelFilter, SimpleLogger};\n\nmod cli;\nmod display;\nmod git;\nmod process;\nmod repository_info;\nmod state;\n\nuse cli::*;\nuse display::*;\nuse git::*;\nuse repository_info::*;\nuse state::*;\n\nfn main() -> Result<()> {\n \n let opt = CliArguments::parse();\n\n \n let level = match opt.verbose {\n 0 => LevelFilter::Error,\n 1 => LevelFilter::Warn,\n 2 => LevelFilter::Info,\n _ => LevelFilter::Debug,\n };\n SimpleLogger::init(level, Config::default()).unwrap();\n\n let mut state = State::load()?;\n\n let show_all;\n match opt.cmd {\n SubCommand::Add { repos } => {\n for path in repos {\n \n if !path.exists() || !path.is_dir() {\n error!(\"Cannot find repository at {:?}\", path);\n }\n\n \n let real_path = std::fs::canonicalize(&path)?;\n if !state.repositories.contains(&real_path) {\n println!(\"Added repository: {:?}\", &real_path);\n state.repositories.push(real_path);\n }\n }\n state.save()?;\n return Ok(());\n }\n SubCommand::Watch { directories } => {\n for path in directories {\n \n if !path.exists() || !path.is_dir() {\n error!(\"Cannot find directory at {:?}\", path);\n }\n\n \n let real_path = std::fs::canonicalize(&path)?;\n if !state.watched.contains(&real_path) {\n println!(\"Watching folder: {:?}\", &real_path);\n state.watched.push(real_path);\n }\n }\n state.scan()?;\n return Ok(());\n }\n SubCommand::Update { all } => {\n state.scan()?;\n show_all = all;\n }\n };\n\n \n let mut repo_infos: Vec<RepositoryInfo> = Vec::new();\n for path in state.repositories.iter() {\n let repository_info = RepositoryInfo::new(path.clone());\n repo_infos.push(repository_info);\n }\n\n \n let mut envs = HashMap::new();\n for (key, value) in vars() {\n envs.insert(key, value);\n }\n\n let mut results: Vec<Result<RepositoryInfo>>;\n if opt.not_parallel {\n results = Vec::new();\n for repo_info in repo_infos.into_iter() {\n results.push(handle_repo(repo_info, &envs));\n }\n } else {\n \n let style = ProgressStyle::default_bar().template(\"{msg}: {wide_bar} {pos}/{len}\");\n let bar = ProgressBar::new(repo_infos.len() as u64);\n bar.set_style(style);\n bar.set_message(\"Checking repositories\");\n results = repo_infos\n .into_par_iter()\n \n \n .map(|repo_info| {\n bar.inc(1);\n handle_repo(repo_info, &envs)\n })\n .collect();\n\n bar.finish_with_message(\"All done: \");\n }\n\n let mut repo_infos = Vec::new();\n for result in results {\n repo_infos.push(result?);\n }\n\n print_status(repo_infos, show_all)?;\n\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"use std::collections::HashMap;\nuse std::env::vars;\n\nuse anyhow::Result;\nuse clap::Parser;\nuse indicatif::{ProgressBar, ProgressStyle};\nuse log::error;\nuse rayon::prelude::*;\nuse simplelog::{Config, LevelFilter, SimpleLogger};\n\nmod cli;\nmod display;\nmod git;\nmod process;\nmod repository_info;\nmod state;\n\nuse cli::*;\nuse display::*;\nuse git::*;\nuse repository_info::*;\nuse state::*;\n\n"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"fn main() -> Result<()> {\n \n let opt = CliArguments::parse();\n\n \n let level = match opt.verbose {\n 0 => LevelFilter::Error,\n 1 => LevelFilter::Warn,\n 2 => LevelFilter::Info,\n _ => LevelFilter::Debug,\n };\n SimpleLogger::init(level, Config::default()).unwrap();\n\n let mut state = State::load()?;\n\n let show_all;\n match opt.cmd {\n SubCommand::Add { repos } => {\n for path in repos {\n \n if !path.exists() || !path.is_dir() {\n error!(\"Cannot find repository at {:?}\", path);\n }\n\n \n let real_path = std::fs::canonicalize(&path)?;\n if !state.repositories.contains(&real_path) {\n println!(\"Added repository: {:?}\", &real_path);\n state.repositories.push(real_path);\n }\n }\n state.save()?;\n return Ok(());\n }\n SubCommand::Watch { directories } => {\n for path in directories {\n \n if !path.exists() || !path.is_dir() {\n error!(\"Cannot find directory at {:?}\", path);\n }\n\n \n let real_path = std::fs::canonicalize(&path)?;\n if !state.watched.contains(&real_path) {\n println!(\"Watching folder: {:?}\", &real_path);\n state.watched.push(real_path);\n }\n }\n state.scan()?;\n return Ok(());\n }\n SubCommand::Update { all } => {\n state.scan()?;\n show_all = all;\n }\n };\n\n \n let mut repo_infos: Vec<RepositoryInfo> = Vec::new();\n for path in state.repositories.iter() {\n let repository_info = RepositoryInfo::new(path.clone());\n repo_infos.push(repository_info);\n }\n\n \n let mut envs = HashMap::new();\n for (key, value) in vars() {\n envs.insert(key, value);\n }\n\n let mut results: Vec<Result<RepositoryInfo>>;\n if opt.not_parallel {\n results = Vec::new();\n for repo_info in repo_infos.into_iter() {\n results.push(handle_repo(repo_info, &envs));\n }\n } else {\n \n let style = ProgressStyle::default_bar().template(\"{msg}: {wide_bar} {pos}/{len}\");\n let bar = ProgressBar::new(repo_infos.len() as u64);\n bar.set_style(style);\n bar.set_message(\"Checking repositories\");\n results = repo_infos\n .into_par_iter()\n \n \n .map(|repo_info| {\n bar.inc(1);\n handle_repo(repo_info, &envs)\n })\n .collect();\n\n bar.finish_with_message(\"All done: \");\n }\n\n let mut repo_infos = Vec::new();\n for result in results {\n repo_infos.push(result?);\n }\n\n print_status(repo_infos, show_all)?;\n\n Ok(())\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn format_state(state: &RepositoryState) -> Cell {\n\n match state {\n\n RepositoryState::Updated => Cell::new(\"Updated\").fg(Color::Green),\n\n RepositoryState::UpToDate => Cell::new(\"Up to date\").fg(Color::DarkGreen),\n\n RepositoryState::Fetched => Cell::new(\"Fetched\").fg(Color::Yellow),\n\n RepositoryState::NoFastForward => Cell::new(\"No fast forward\").fg(Color::Red),\n\n RepositoryState::LocalChanges => Cell::new(\"Local changes\").fg(Color::Red),\n\n }\n\n}\n\n\n","file_path":"src/display.rs","rank":0,"score":46780.99230578341},{"content":"use std::path::PathBuf;\n\n\n\nuse clap::Parser;\n\n\n\n#[derive(Parser, Debug)]\n\n#[clap(\n\n name = \"Geil\",\n\n about = \"A git repository manager\",\n\n author = env!(\"CARGO_PKG_AUTHORS\"),\n\n version = env!(\"CARGO_PKG_VERSION\")\n\n)]\n\npub struct CliArguments {\n\n /// Verbose mode (-v, -vv, -vvv)\n\n #[clap(short, long, parse(from_occurrences))]\n\n pub verbose: u8,\n\n\n\n /// Don't run git commands in parallel\n\n /// This is useful in combination with the verbose flag for debugging.\n\n #[clap(short, long)]\n\n pub not_parallel: bool,\n","file_path":"src/cli.rs","rank":1,"score":20063.794892267604},{"content":"\n\n /// This is the main command of `geil`. This will:\n\n /// - Fetch all branches from a remote\n\n /// - Check stash sizes\n\n /// - Check for local changes\n\n /// - Update via fast-forward if possible\n\n Update {\n\n /// Show all repositories and not only those that are somehow interesting\n\n #[clap(short, long)]\n\n all: bool,\n\n },\n\n}\n","file_path":"src/cli.rs","rank":2,"score":20059.406843468558},{"content":"\n\n #[clap(subcommand)]\n\n pub cmd: SubCommand,\n\n}\n\n\n\n#[derive(Parser, Debug)]\n\npub enum SubCommand {\n\n /// Add one or more repositories to your watchlist\n\n Add {\n\n /// The repository that should be watched\n\n repos: Vec<PathBuf>,\n\n },\n\n\n\n /// Add a directory which should be searched for repositories.\n\n /// The maximum depths for this search is 5 subdirectories.\n\n /// This repository will be searched for repos every time you run `update` or `check`.\n\n Watch {\n\n /// The directory that should be watched\n\n directories: Vec<PathBuf>,\n\n },\n","file_path":"src/cli.rs","rank":3,"score":20059.406843468558},{"content":"use std::{collections::HashMap, path::PathBuf};\n\n\n\nuse anyhow::{bail, Result};\n\nuse subprocess::{CaptureData, Exec, Redirection};\n\n\n\n#[macro_export]\n\nmacro_rules! cmd {\n\n ($( $x:expr ),*) => {\n\n Cmd::new(format!(\n\n $($x,)*\n\n ))\n\n };\n\n}\n\n\n\n/// This is a convenience layer around [Subprocess's Exec](subprocess.Exec).\n\n/// It provides simple exit handling for single Commands.\n\n/// This doesn't work with pipes.\n\npub struct Cmd {\n\n cwd: Option<PathBuf>,\n\n pub env: HashMap<String, String>,\n","file_path":"src/process.rs","rank":4,"score":19880.01674358723},{"content":" command: String,\n\n}\n\n\n\nimpl Cmd {\n\n /// Create a new wrapper with the command that should be executed.\n\n pub fn new<T: ToString>(command: T) -> Cmd {\n\n Cmd {\n\n command: command.to_string(),\n\n env: HashMap::new(),\n\n cwd: None,\n\n }\n\n }\n\n\n\n /// Set the current working directory of the process.\n\n pub fn cwd(mut self, dir: PathBuf) -> Cmd {\n\n self.cwd = Some(dir);\n\n\n\n self\n\n }\n\n\n","file_path":"src/process.rs","rank":5,"score":19879.468741337383},{"content":" /// Set the current working directory of the process.\n\n pub fn env(mut self, env: HashMap<String, String>) -> Cmd {\n\n self.env = env;\n\n self\n\n }\n\n\n\n /// Run the command and return the exit status\n\n pub fn run(&self) -> Result<CaptureData> {\n\n let mut exec = Exec::shell(&self.command)\n\n .stdout(Redirection::Pipe)\n\n .stderr(Redirection::Merge);\n\n\n\n // Set the current working directory.\n\n if let Some(cwd) = &self.cwd {\n\n exec = exec.cwd(cwd);\n\n }\n\n\n\n for (key, value) in self.env.iter() {\n\n exec = exec.env(key, value);\n\n }\n","file_path":"src/process.rs","rank":6,"score":19879.27956221779},{"content":"\n\n // Check if there are any critical errors.\n\n let capture_data = match exec.capture() {\n\n Ok(exit_status) => exit_status,\n\n Err(error) => {\n\n bail!(\n\n \"Failed during: {} \\nCritical error: {}\",\n\n &self.command,\n\n error\n\n );\n\n }\n\n };\n\n\n\n Ok(capture_data)\n\n }\n\n}\n","file_path":"src/process.rs","rank":7,"score":19878.197962131366},{"content":"use anyhow::Result;\n\nuse comfy_table::*;\n\n\n\nuse crate::repository_info::{RepositoryInfo, RepositoryState};\n\n\n","file_path":"src/display.rs","rank":8,"score":19697.260889991052},{"content":" table.load_preset(comfy_table::presets::UTF8_FULL);\n\n\n\n table.set_header(vec![\"Path\", \"State\", \"Stash size\"]);\n\n for info in repo_infos.iter() {\n\n table.add_row(vec![\n\n Cell::new(info.path.to_string_lossy().into_owned()),\n\n format_state(&info.state),\n\n format_number(info.stashed),\n\n ]);\n\n }\n\n\n\n println!(\"{}\", table);\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/display.rs","rank":9,"score":19695.092289038716},{"content":"use std::collections::HashMap;\n\n\n\nuse anyhow::Result;\n\nuse log::info;\n\n\n\nuse crate::cmd;\n\nuse crate::process::*;\n\nuse crate::repository_info::*;\n\n\n","file_path":"src/git.rs","rank":10,"score":19507.40773512661},{"content":"use std::fs::{read_dir, File};\n\nuse std::io::Write;\n\nuse std::path::{Path, PathBuf};\n\n\n\nuse anyhow::{anyhow, Context, Result};\n\nuse log::debug;\n\nuse serde_derive::{Deserialize, Serialize};\n\n\n\n#[derive(Deserialize, Serialize)]\n\npub struct State {\n\n pub watched: Vec<PathBuf>,\n\n pub repositories: Vec<PathBuf>,\n\n}\n\n\n\nimpl State {\n\n pub fn new() -> State {\n\n State {\n\n watched: Vec::new(),\n\n repositories: Vec::new(),\n\n }\n","file_path":"src/state.rs","rank":11,"score":18900.15754832205},{"content":" self.discover(watched, 0);\n\n }\n\n\n\n self.save()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn discover(&mut self, path: &Path, depths: usize) {\n\n // Check if a .git directory exists.\n\n // If it does, always stop searching.\n\n let git_dir = path.join(\".git\");\n\n debug!(\"{} Looking at folder {:?}\", depths, path);\n\n if git_dir.exists() {\n\n debug!(\"Found .git folder\");\n\n // Add the repository, if we don't know it yet.\n\n let path = path.to_path_buf();\n\n if !self.repositories.contains(&path) {\n\n println!(\"Found new repository: {:?}\", path);\n\n self.repositories.push(path);\n","file_path":"src/state.rs","rank":12,"score":18898.17561992119},{"content":" }\n\n}\n\n\n\nimpl State {\n\n /// Save a state to the disk.\n\n pub fn save(&self) -> Result<()> {\n\n let serialized = bincode::serialize(self)\n\n .context(\"Failed to serialize state. Please report this bug\")?;\n\n\n\n let path = default_cache_path()?;\n\n let mut file = File::create(path)?;\n\n\n\n file.write_all(&serialized)?;\n\n\n\n Ok(())\n\n }\n\n\n\n /// Load an existing state from the disk or create an empty new one.\n\n pub fn load() -> Result<State> {\n\n let path = default_cache_path()?;\n","file_path":"src/state.rs","rank":13,"score":18898.127447854964},{"content":" // Return default path if it doesn't exist yet\n\n if !path.exists() {\n\n return Ok(State::new());\n\n }\n\n\n\n let file = File::open(path)?;\n\n let state = bincode::deserialize_from(&file)?;\n\n\n\n Ok(state)\n\n }\n\n\n\n pub fn scan(&mut self) -> Result<()> {\n\n // Go through all watched folder and check if they still exist\n\n for key in (0..self.watched.len()).rev() {\n\n if !self.watched[key].exists() || !self.watched[key].is_dir() {\n\n println!(\n\n \"Watched folder does no longer exist: {:?}\",\n\n &self.watched[key]\n\n );\n\n self.watched.remove(key);\n","file_path":"src/state.rs","rank":14,"score":18897.77126378962},{"content":" }\n\n }\n\n\n\n // Go through all repositories and check if they still exist\n\n for key in (0..self.repositories.len()).rev() {\n\n if !self.repositories[key].exists()\n\n || !self.repositories[key].is_dir()\n\n || !self.repositories[key].join(\".git\").exists()\n\n || !self.repositories[key].join(\".git\").is_dir()\n\n {\n\n println!(\n\n \"Repository does no longer exist: {:?}\",\n\n &self.repositories[key]\n\n );\n\n self.repositories.remove(key);\n\n }\n\n }\n\n\n\n // Do a full repository discovery on all watched repositories\n\n for watched in &self.watched.clone() {\n","file_path":"src/state.rs","rank":15,"score":18897.693671903296},{"content":"\n\n // The current path is no repository, search it's subdirectories\n\n for entry_result in current_dir {\n\n match entry_result {\n\n Ok(entry) => {\n\n let path = entry.path();\n\n if !path.is_dir() {\n\n continue;\n\n }\n\n\n\n self.discover(&path, depths + 1);\n\n }\n\n Err(err) => {\n\n debug!(\n\n \"Couldn't read directory path {:?} with error: {:?}\",\n\n path, err\n\n );\n\n continue;\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/state.rs","rank":16,"score":18895.99014010344},{"content":" }\n\n return;\n\n }\n\n\n\n // Recursion stop. Only check up to a dephts of 5\n\n if depths == 5 {\n\n debug!(\"Max depth reached\");\n\n return;\n\n }\n\n\n\n let current_dir = match read_dir(path) {\n\n Ok(current_dir) => current_dir,\n\n Err(err) => {\n\n debug!(\n\n \"Couldn't read directory at {:?} with error: {:?}\",\n\n path, err\n\n );\n\n return;\n\n }\n\n };\n","file_path":"src/state.rs","rank":17,"score":18895.99014010344},{"content":"pub fn handle_repo(\n\n mut repo_info: RepositoryInfo,\n\n envs: &HashMap<String, String>,\n\n) -> Result<RepositoryInfo> {\n\n info!(\"Checking repo: {}\", repo_info.path.to_string_lossy());\n\n get_stashed_entries(&mut repo_info, envs)?;\n\n fetch_repo(&mut repo_info, envs)?;\n\n check_local_changes(&mut repo_info, envs)?;\n\n\n\n // Skip update\n\n // We cannot merge with local changes anyway.\n\n if matches!(repo_info.state, RepositoryState::LocalChanges) {\n\n return Ok(repo_info);\n\n }\n\n update_repo(&mut repo_info, envs)?;\n\n\n\n Ok(repo_info)\n\n}\n\n\n","file_path":"src/git.rs","rank":18,"score":16370.896861221001},{"content":"pub fn check_local_changes(\n\n repo_info: &mut RepositoryInfo,\n\n envs: &HashMap<String, String>,\n\n) -> Result<()> {\n\n let merge = cmd!(\"git status\")\n\n .cwd(repo_info.path.clone())\n\n .env(envs.clone());\n\n let capture_data = merge.run()?;\n\n let stdout = String::from_utf8_lossy(&capture_data.stdout);\n\n\n\n // No local changes, everything seems clean.\n\n if stdout.contains(\"nothing to commit, working tree clean\") {\n\n info!(\"No local changes\");\n\n return Ok(());\n\n }\n\n\n\n repo_info.state = RepositoryState::LocalChanges;\n\n info!(\"Found local changes\");\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/git.rs","rank":19,"score":15539.015507569668},{"content":"pub fn get_stashed_entries(\n\n repo_info: &mut RepositoryInfo,\n\n envs: &HashMap<String, String>,\n\n) -> Result<()> {\n\n let merge = cmd!(\"git rev-list --walk-reflogs --count refs/stash\")\n\n .cwd(repo_info.path.clone())\n\n .env(envs.clone());\n\n let capture_data = merge.run()?;\n\n let stdout = String::from_utf8_lossy(&capture_data.stdout);\n\n // There are now stashes\n\n if stdout.contains(\"unknown revision or path not in the working tree\") {\n\n info!(\"No stashed changes\");\n\n return Ok(());\n\n }\n\n let number = stdout\n\n .lines()\n\n .next()\n\n .expect(\"At least two lines of output\")\n\n .trim();\n\n\n\n repo_info.stashed = number.parse::<usize>().expect(\"Couldn't get stash amount\");\n\n info!(\"Found {} stashed entries\", repo_info.stashed);\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/git.rs","rank":20,"score":15539.015507569668},{"content":"pub fn format_number(number: usize) -> Cell {\n\n match number {\n\n 0 => Cell::new(\"0\").fg(Color::Green),\n\n _ => Cell::new(number.to_string()).fg(Color::Red),\n\n }\n\n}\n","file_path":"src/display.rs","rank":21,"score":14242.891732124446},{"content":"fn default_cache_path() -> Result<PathBuf> {\n\n let home = dirs::home_dir().ok_or_else(|| anyhow!(\"Couldn't resolve home dir\"))?;\n\n let path = home.join(\".local/share/geil\");\n\n Ok(path)\n\n}\n","file_path":"src/state.rs","rank":22,"score":13666.31941748},{"content":"pub fn print_status(mut repo_infos: Vec<RepositoryInfo>, show_all: bool) -> Result<()> {\n\n // Filter all repos that don't need attention.\n\n if !show_all {\n\n repo_infos = repo_infos\n\n .into_iter()\n\n .filter(|info| {\n\n !matches!(info.state, RepositoryState::UpToDate)\n\n || info.stashed != 0\n\n || matches!(info.state, RepositoryState::LocalChanges)\n\n })\n\n .collect();\n\n }\n\n\n\n if repo_infos.is_empty() {\n\n println!(\"Nothing to do here, everything looks perfectly fine.\");\n\n return Ok(());\n\n }\n\n\n\n let mut table = Table::new();\n\n table.set_content_arrangement(ContentArrangement::Dynamic);\n","file_path":"src/display.rs","rank":23,"score":11155.488890776218},{"content":"pub fn fetch_repo(repo_info: &mut RepositoryInfo, envs: &HashMap<String, String>) -> Result<()> {\n\n let fetch = cmd!(\"git fetch --all\")\n\n .cwd(repo_info.path.clone())\n\n .env(envs.clone());\n\n let capture_data = fetch.run()?;\n\n if String::from_utf8_lossy(&capture_data.stdout).contains(\"Receiving objects: 100%\") {\n\n info!(\"Got new changes from remote\");\n\n repo_info.state = RepositoryState::Fetched;\n\n } else {\n\n info!(\"Everything is up to date\");\n\n repo_info.state = RepositoryState::UpToDate;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/git.rs","rank":24,"score":10303.386151612407},{"content":"pub fn update_repo(repo_info: &mut RepositoryInfo, envs: &HashMap<String, String>) -> Result<()> {\n\n let merge = cmd!(\"git merge --ff-only\")\n\n .cwd(repo_info.path.clone())\n\n .env(envs.clone());\n\n let capture_data = merge.run()?;\n\n let stdout = String::from_utf8_lossy(&capture_data.stdout);\n\n\n\n if stdout.contains(\"Updating\") {\n\n info!(\"Fast forward succeeded\");\n\n repo_info.state = RepositoryState::Updated;\n\n } else if stdout.contains(\"Already up to date\") {\n\n info!(\"Already up to date\");\n\n repo_info.state = RepositoryState::UpToDate;\n\n } else if stdout.contains(\"fatal:\") {\n\n info!(\"Fast forward not possible\");\n\n repo_info.state = RepositoryState::NoFastForward;\n\n } else {\n\n info!(\"Couldn't get state from output: {}\", stdout);\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"src/git.rs","rank":25,"score":10303.386151612407},{"content":"use std::path::PathBuf;\n\n\n\nuse strum_macros::Display;\n\n\n\n#[derive(Display)]\n\npub enum RepositoryState {\n\n UpToDate,\n\n Fetched,\n\n Updated,\n\n NoFastForward,\n\n LocalChanges,\n\n}\n\n\n\npub struct RepositoryInfo {\n\n pub path: PathBuf,\n\n pub state: RepositoryState,\n\n pub stashed: usize,\n\n}\n\n\n\nimpl RepositoryInfo {\n\n pub fn new(path: PathBuf) -> RepositoryInfo {\n\n RepositoryInfo {\n\n path,\n\n state: RepositoryState::UpToDate,\n\n stashed: 0,\n\n }\n\n }\n\n}\n","file_path":"src/repository_info.rs","rank":27,"score":5.307532626286347},{"content":"# Geil\n\n\n\n\n\n\n\nA tool for updating all of your repositories and keeping them clean.\n\n\n\n## Features:\n\n\n\n- Watch folders for new repositories\n\n- Fetch new commits from remote\n\n- Fast-forward only update\n\n- Check git stash size for each repository\n\n- Check for local changes\n","file_path":"README.md","rank":30,"score":1.275796289936113}],"string":"[\n {\n \"content\": \"pub fn format_state(state: &RepositoryState) -> Cell {\\n\\n match state {\\n\\n RepositoryState::Updated => Cell::new(\\\"Updated\\\").fg(Color::Green),\\n\\n RepositoryState::UpToDate => Cell::new(\\\"Up to date\\\").fg(Color::DarkGreen),\\n\\n RepositoryState::Fetched => Cell::new(\\\"Fetched\\\").fg(Color::Yellow),\\n\\n RepositoryState::NoFastForward => Cell::new(\\\"No fast forward\\\").fg(Color::Red),\\n\\n RepositoryState::LocalChanges => Cell::new(\\\"Local changes\\\").fg(Color::Red),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/display.rs\",\n \"rank\": 0,\n \"score\": 46780.99230578341\n },\n {\n \"content\": \"use std::path::PathBuf;\\n\\n\\n\\nuse clap::Parser;\\n\\n\\n\\n#[derive(Parser, Debug)]\\n\\n#[clap(\\n\\n name = \\\"Geil\\\",\\n\\n about = \\\"A git repository manager\\\",\\n\\n author = env!(\\\"CARGO_PKG_AUTHORS\\\"),\\n\\n version = env!(\\\"CARGO_PKG_VERSION\\\")\\n\\n)]\\n\\npub struct CliArguments {\\n\\n /// Verbose mode (-v, -vv, -vvv)\\n\\n #[clap(short, long, parse(from_occurrences))]\\n\\n pub verbose: u8,\\n\\n\\n\\n /// Don't run git commands in parallel\\n\\n /// This is useful in combination with the verbose flag for debugging.\\n\\n #[clap(short, long)]\\n\\n pub not_parallel: bool,\\n\",\n \"file_path\": \"src/cli.rs\",\n \"rank\": 1,\n \"score\": 20063.794892267604\n },\n {\n \"content\": \"\\n\\n /// This is the main command of `geil`. This will:\\n\\n /// - Fetch all branches from a remote\\n\\n /// - Check stash sizes\\n\\n /// - Check for local changes\\n\\n /// - Update via fast-forward if possible\\n\\n Update {\\n\\n /// Show all repositories and not only those that are somehow interesting\\n\\n #[clap(short, long)]\\n\\n all: bool,\\n\\n },\\n\\n}\\n\",\n \"file_path\": \"src/cli.rs\",\n \"rank\": 2,\n \"score\": 20059.406843468558\n },\n {\n \"content\": \"\\n\\n #[clap(subcommand)]\\n\\n pub cmd: SubCommand,\\n\\n}\\n\\n\\n\\n#[derive(Parser, Debug)]\\n\\npub enum SubCommand {\\n\\n /// Add one or more repositories to your watchlist\\n\\n Add {\\n\\n /// The repository that should be watched\\n\\n repos: Vec<PathBuf>,\\n\\n },\\n\\n\\n\\n /// Add a directory which should be searched for repositories.\\n\\n /// The maximum depths for this search is 5 subdirectories.\\n\\n /// This repository will be searched for repos every time you run `update` or `check`.\\n\\n Watch {\\n\\n /// The directory that should be watched\\n\\n directories: Vec<PathBuf>,\\n\\n },\\n\",\n \"file_path\": \"src/cli.rs\",\n \"rank\": 3,\n \"score\": 20059.406843468558\n },\n {\n \"content\": \"use std::{collections::HashMap, path::PathBuf};\\n\\n\\n\\nuse anyhow::{bail, Result};\\n\\nuse subprocess::{CaptureData, Exec, Redirection};\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! cmd {\\n\\n ($( $x:expr ),*) => {\\n\\n Cmd::new(format!(\\n\\n $($x,)*\\n\\n ))\\n\\n };\\n\\n}\\n\\n\\n\\n/// This is a convenience layer around [Subprocess's Exec](subprocess.Exec).\\n\\n/// It provides simple exit handling for single Commands.\\n\\n/// This doesn't work with pipes.\\n\\npub struct Cmd {\\n\\n cwd: Option<PathBuf>,\\n\\n pub env: HashMap<String, String>,\\n\",\n \"file_path\": \"src/process.rs\",\n \"rank\": 4,\n \"score\": 19880.01674358723\n },\n {\n \"content\": \" command: String,\\n\\n}\\n\\n\\n\\nimpl Cmd {\\n\\n /// Create a new wrapper with the command that should be executed.\\n\\n pub fn new<T: ToString>(command: T) -> Cmd {\\n\\n Cmd {\\n\\n command: command.to_string(),\\n\\n env: HashMap::new(),\\n\\n cwd: None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Set the current working directory of the process.\\n\\n pub fn cwd(mut self, dir: PathBuf) -> Cmd {\\n\\n self.cwd = Some(dir);\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/process.rs\",\n \"rank\": 5,\n \"score\": 19879.468741337383\n },\n {\n \"content\": \" /// Set the current working directory of the process.\\n\\n pub fn env(mut self, env: HashMap<String, String>) -> Cmd {\\n\\n self.env = env;\\n\\n self\\n\\n }\\n\\n\\n\\n /// Run the command and return the exit status\\n\\n pub fn run(&self) -> Result<CaptureData> {\\n\\n let mut exec = Exec::shell(&self.command)\\n\\n .stdout(Redirection::Pipe)\\n\\n .stderr(Redirection::Merge);\\n\\n\\n\\n // Set the current working directory.\\n\\n if let Some(cwd) = &self.cwd {\\n\\n exec = exec.cwd(cwd);\\n\\n }\\n\\n\\n\\n for (key, value) in self.env.iter() {\\n\\n exec = exec.env(key, value);\\n\\n }\\n\",\n \"file_path\": \"src/process.rs\",\n \"rank\": 6,\n \"score\": 19879.27956221779\n },\n {\n \"content\": \"\\n\\n // Check if there are any critical errors.\\n\\n let capture_data = match exec.capture() {\\n\\n Ok(exit_status) => exit_status,\\n\\n Err(error) => {\\n\\n bail!(\\n\\n \\\"Failed during: {} \\\\nCritical error: {}\\\",\\n\\n &self.command,\\n\\n error\\n\\n );\\n\\n }\\n\\n };\\n\\n\\n\\n Ok(capture_data)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/process.rs\",\n \"rank\": 7,\n \"score\": 19878.197962131366\n },\n {\n \"content\": \"use anyhow::Result;\\n\\nuse comfy_table::*;\\n\\n\\n\\nuse crate::repository_info::{RepositoryInfo, RepositoryState};\\n\\n\\n\",\n \"file_path\": \"src/display.rs\",\n \"rank\": 8,\n \"score\": 19697.260889991052\n },\n {\n \"content\": \" table.load_preset(comfy_table::presets::UTF8_FULL);\\n\\n\\n\\n table.set_header(vec![\\\"Path\\\", \\\"State\\\", \\\"Stash size\\\"]);\\n\\n for info in repo_infos.iter() {\\n\\n table.add_row(vec![\\n\\n Cell::new(info.path.to_string_lossy().into_owned()),\\n\\n format_state(&info.state),\\n\\n format_number(info.stashed),\\n\\n ]);\\n\\n }\\n\\n\\n\\n println!(\\\"{}\\\", table);\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/display.rs\",\n \"rank\": 9,\n \"score\": 19695.092289038716\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\n\\n\\nuse anyhow::Result;\\n\\nuse log::info;\\n\\n\\n\\nuse crate::cmd;\\n\\nuse crate::process::*;\\n\\nuse crate::repository_info::*;\\n\\n\\n\",\n \"file_path\": \"src/git.rs\",\n \"rank\": 10,\n \"score\": 19507.40773512661\n },\n {\n \"content\": \"use std::fs::{read_dir, File};\\n\\nuse std::io::Write;\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\nuse anyhow::{anyhow, Context, Result};\\n\\nuse log::debug;\\n\\nuse serde_derive::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Deserialize, Serialize)]\\n\\npub struct State {\\n\\n pub watched: Vec<PathBuf>,\\n\\n pub repositories: Vec<PathBuf>,\\n\\n}\\n\\n\\n\\nimpl State {\\n\\n pub fn new() -> State {\\n\\n State {\\n\\n watched: Vec::new(),\\n\\n repositories: Vec::new(),\\n\\n }\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 11,\n \"score\": 18900.15754832205\n },\n {\n \"content\": \" self.discover(watched, 0);\\n\\n }\\n\\n\\n\\n self.save()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn discover(&mut self, path: &Path, depths: usize) {\\n\\n // Check if a .git directory exists.\\n\\n // If it does, always stop searching.\\n\\n let git_dir = path.join(\\\".git\\\");\\n\\n debug!(\\\"{} Looking at folder {:?}\\\", depths, path);\\n\\n if git_dir.exists() {\\n\\n debug!(\\\"Found .git folder\\\");\\n\\n // Add the repository, if we don't know it yet.\\n\\n let path = path.to_path_buf();\\n\\n if !self.repositories.contains(&path) {\\n\\n println!(\\\"Found new repository: {:?}\\\", path);\\n\\n self.repositories.push(path);\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 12,\n \"score\": 18898.17561992119\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl State {\\n\\n /// Save a state to the disk.\\n\\n pub fn save(&self) -> Result<()> {\\n\\n let serialized = bincode::serialize(self)\\n\\n .context(\\\"Failed to serialize state. Please report this bug\\\")?;\\n\\n\\n\\n let path = default_cache_path()?;\\n\\n let mut file = File::create(path)?;\\n\\n\\n\\n file.write_all(&serialized)?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Load an existing state from the disk or create an empty new one.\\n\\n pub fn load() -> Result<State> {\\n\\n let path = default_cache_path()?;\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 13,\n \"score\": 18898.127447854964\n },\n {\n \"content\": \" // Return default path if it doesn't exist yet\\n\\n if !path.exists() {\\n\\n return Ok(State::new());\\n\\n }\\n\\n\\n\\n let file = File::open(path)?;\\n\\n let state = bincode::deserialize_from(&file)?;\\n\\n\\n\\n Ok(state)\\n\\n }\\n\\n\\n\\n pub fn scan(&mut self) -> Result<()> {\\n\\n // Go through all watched folder and check if they still exist\\n\\n for key in (0..self.watched.len()).rev() {\\n\\n if !self.watched[key].exists() || !self.watched[key].is_dir() {\\n\\n println!(\\n\\n \\\"Watched folder does no longer exist: {:?}\\\",\\n\\n &self.watched[key]\\n\\n );\\n\\n self.watched.remove(key);\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 14,\n \"score\": 18897.77126378962\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n // Go through all repositories and check if they still exist\\n\\n for key in (0..self.repositories.len()).rev() {\\n\\n if !self.repositories[key].exists()\\n\\n || !self.repositories[key].is_dir()\\n\\n || !self.repositories[key].join(\\\".git\\\").exists()\\n\\n || !self.repositories[key].join(\\\".git\\\").is_dir()\\n\\n {\\n\\n println!(\\n\\n \\\"Repository does no longer exist: {:?}\\\",\\n\\n &self.repositories[key]\\n\\n );\\n\\n self.repositories.remove(key);\\n\\n }\\n\\n }\\n\\n\\n\\n // Do a full repository discovery on all watched repositories\\n\\n for watched in &self.watched.clone() {\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 15,\n \"score\": 18897.693671903296\n },\n {\n \"content\": \"\\n\\n // The current path is no repository, search it's subdirectories\\n\\n for entry_result in current_dir {\\n\\n match entry_result {\\n\\n Ok(entry) => {\\n\\n let path = entry.path();\\n\\n if !path.is_dir() {\\n\\n continue;\\n\\n }\\n\\n\\n\\n self.discover(&path, depths + 1);\\n\\n }\\n\\n Err(err) => {\\n\\n debug!(\\n\\n \\\"Couldn't read directory path {:?} with error: {:?}\\\",\\n\\n path, err\\n\\n );\\n\\n continue;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 16,\n \"score\": 18895.99014010344\n },\n {\n \"content\": \" }\\n\\n return;\\n\\n }\\n\\n\\n\\n // Recursion stop. Only check up to a dephts of 5\\n\\n if depths == 5 {\\n\\n debug!(\\\"Max depth reached\\\");\\n\\n return;\\n\\n }\\n\\n\\n\\n let current_dir = match read_dir(path) {\\n\\n Ok(current_dir) => current_dir,\\n\\n Err(err) => {\\n\\n debug!(\\n\\n \\\"Couldn't read directory at {:?} with error: {:?}\\\",\\n\\n path, err\\n\\n );\\n\\n return;\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 17,\n \"score\": 18895.99014010344\n },\n {\n \"content\": \"pub fn handle_repo(\\n\\n mut repo_info: RepositoryInfo,\\n\\n envs: &HashMap<String, String>,\\n\\n) -> Result<RepositoryInfo> {\\n\\n info!(\\\"Checking repo: {}\\\", repo_info.path.to_string_lossy());\\n\\n get_stashed_entries(&mut repo_info, envs)?;\\n\\n fetch_repo(&mut repo_info, envs)?;\\n\\n check_local_changes(&mut repo_info, envs)?;\\n\\n\\n\\n // Skip update\\n\\n // We cannot merge with local changes anyway.\\n\\n if matches!(repo_info.state, RepositoryState::LocalChanges) {\\n\\n return Ok(repo_info);\\n\\n }\\n\\n update_repo(&mut repo_info, envs)?;\\n\\n\\n\\n Ok(repo_info)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/git.rs\",\n \"rank\": 18,\n \"score\": 16370.896861221001\n },\n {\n \"content\": \"pub fn check_local_changes(\\n\\n repo_info: &mut RepositoryInfo,\\n\\n envs: &HashMap<String, String>,\\n\\n) -> Result<()> {\\n\\n let merge = cmd!(\\\"git status\\\")\\n\\n .cwd(repo_info.path.clone())\\n\\n .env(envs.clone());\\n\\n let capture_data = merge.run()?;\\n\\n let stdout = String::from_utf8_lossy(&capture_data.stdout);\\n\\n\\n\\n // No local changes, everything seems clean.\\n\\n if stdout.contains(\\\"nothing to commit, working tree clean\\\") {\\n\\n info!(\\\"No local changes\\\");\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n repo_info.state = RepositoryState::LocalChanges;\\n\\n info!(\\\"Found local changes\\\");\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/git.rs\",\n \"rank\": 19,\n \"score\": 15539.015507569668\n },\n {\n \"content\": \"pub fn get_stashed_entries(\\n\\n repo_info: &mut RepositoryInfo,\\n\\n envs: &HashMap<String, String>,\\n\\n) -> Result<()> {\\n\\n let merge = cmd!(\\\"git rev-list --walk-reflogs --count refs/stash\\\")\\n\\n .cwd(repo_info.path.clone())\\n\\n .env(envs.clone());\\n\\n let capture_data = merge.run()?;\\n\\n let stdout = String::from_utf8_lossy(&capture_data.stdout);\\n\\n // There are now stashes\\n\\n if stdout.contains(\\\"unknown revision or path not in the working tree\\\") {\\n\\n info!(\\\"No stashed changes\\\");\\n\\n return Ok(());\\n\\n }\\n\\n let number = stdout\\n\\n .lines()\\n\\n .next()\\n\\n .expect(\\\"At least two lines of output\\\")\\n\\n .trim();\\n\\n\\n\\n repo_info.stashed = number.parse::<usize>().expect(\\\"Couldn't get stash amount\\\");\\n\\n info!(\\\"Found {} stashed entries\\\", repo_info.stashed);\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/git.rs\",\n \"rank\": 20,\n \"score\": 15539.015507569668\n },\n {\n \"content\": \"pub fn format_number(number: usize) -> Cell {\\n\\n match number {\\n\\n 0 => Cell::new(\\\"0\\\").fg(Color::Green),\\n\\n _ => Cell::new(number.to_string()).fg(Color::Red),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/display.rs\",\n \"rank\": 21,\n \"score\": 14242.891732124446\n },\n {\n \"content\": \"fn default_cache_path() -> Result<PathBuf> {\\n\\n let home = dirs::home_dir().ok_or_else(|| anyhow!(\\\"Couldn't resolve home dir\\\"))?;\\n\\n let path = home.join(\\\".local/share/geil\\\");\\n\\n Ok(path)\\n\\n}\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 22,\n \"score\": 13666.31941748\n },\n {\n \"content\": \"pub fn print_status(mut repo_infos: Vec<RepositoryInfo>, show_all: bool) -> Result<()> {\\n\\n // Filter all repos that don't need attention.\\n\\n if !show_all {\\n\\n repo_infos = repo_infos\\n\\n .into_iter()\\n\\n .filter(|info| {\\n\\n !matches!(info.state, RepositoryState::UpToDate)\\n\\n || info.stashed != 0\\n\\n || matches!(info.state, RepositoryState::LocalChanges)\\n\\n })\\n\\n .collect();\\n\\n }\\n\\n\\n\\n if repo_infos.is_empty() {\\n\\n println!(\\\"Nothing to do here, everything looks perfectly fine.\\\");\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n let mut table = Table::new();\\n\\n table.set_content_arrangement(ContentArrangement::Dynamic);\\n\",\n \"file_path\": \"src/display.rs\",\n \"rank\": 23,\n \"score\": 11155.488890776218\n },\n {\n \"content\": \"pub fn fetch_repo(repo_info: &mut RepositoryInfo, envs: &HashMap<String, String>) -> Result<()> {\\n\\n let fetch = cmd!(\\\"git fetch --all\\\")\\n\\n .cwd(repo_info.path.clone())\\n\\n .env(envs.clone());\\n\\n let capture_data = fetch.run()?;\\n\\n if String::from_utf8_lossy(&capture_data.stdout).contains(\\\"Receiving objects: 100%\\\") {\\n\\n info!(\\\"Got new changes from remote\\\");\\n\\n repo_info.state = RepositoryState::Fetched;\\n\\n } else {\\n\\n info!(\\\"Everything is up to date\\\");\\n\\n repo_info.state = RepositoryState::UpToDate;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/git.rs\",\n \"rank\": 24,\n \"score\": 10303.386151612407\n },\n {\n \"content\": \"pub fn update_repo(repo_info: &mut RepositoryInfo, envs: &HashMap<String, String>) -> Result<()> {\\n\\n let merge = cmd!(\\\"git merge --ff-only\\\")\\n\\n .cwd(repo_info.path.clone())\\n\\n .env(envs.clone());\\n\\n let capture_data = merge.run()?;\\n\\n let stdout = String::from_utf8_lossy(&capture_data.stdout);\\n\\n\\n\\n if stdout.contains(\\\"Updating\\\") {\\n\\n info!(\\\"Fast forward succeeded\\\");\\n\\n repo_info.state = RepositoryState::Updated;\\n\\n } else if stdout.contains(\\\"Already up to date\\\") {\\n\\n info!(\\\"Already up to date\\\");\\n\\n repo_info.state = RepositoryState::UpToDate;\\n\\n } else if stdout.contains(\\\"fatal:\\\") {\\n\\n info!(\\\"Fast forward not possible\\\");\\n\\n repo_info.state = RepositoryState::NoFastForward;\\n\\n } else {\\n\\n info!(\\\"Couldn't get state from output: {}\\\", stdout);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/git.rs\",\n \"rank\": 25,\n \"score\": 10303.386151612407\n },\n {\n \"content\": \"use std::path::PathBuf;\\n\\n\\n\\nuse strum_macros::Display;\\n\\n\\n\\n#[derive(Display)]\\n\\npub enum RepositoryState {\\n\\n UpToDate,\\n\\n Fetched,\\n\\n Updated,\\n\\n NoFastForward,\\n\\n LocalChanges,\\n\\n}\\n\\n\\n\\npub struct RepositoryInfo {\\n\\n pub path: PathBuf,\\n\\n pub state: RepositoryState,\\n\\n pub stashed: usize,\\n\\n}\\n\\n\\n\\nimpl RepositoryInfo {\\n\\n pub fn new(path: PathBuf) -> RepositoryInfo {\\n\\n RepositoryInfo {\\n\\n path,\\n\\n state: RepositoryState::UpToDate,\\n\\n stashed: 0,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/repository_info.rs\",\n \"rank\": 27,\n \"score\": 5.307532626286347\n },\n {\n \"content\": \"# Geil\\n\\n\\n\\n\\n\\n\\n\\nA tool for updating all of your repositories and keeping them clean.\\n\\n\\n\\n## Features:\\n\\n\\n\\n- Watch folders for new repositories\\n\\n- Fetch new commits from remote\\n\\n- Fast-forward only update\\n\\n- Check git stash size for each repository\\n\\n- Check for local changes\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 30,\n \"score\": 1.275796289936113\n }\n]","isConversational":false}}},{"rowIdx":3699,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/frontend/server.rs"},"repo_name":{"kind":"string","value":"neofight78/chrust"},"commit":{"kind":"string","value":"bfc1cb762b7b2859a02d5ada6fd995a70961772a"},"file_code":{"kind":"string","value":"use super::{\n responses::{SettingsResponse, ValidateResponse},\n};\nuse crate::{\n frontend::responses::MoveOptionsResponse,\n game::chessgame::{is_valid, process_fen, valid_moves},\n state::programstate::ProgramState,\n};\nuse rocket::{\n get,\n http::ContentType,\n post,\n response::{\n content::{Css, Custom, Html, JavaScript},\n },\n routes, State,\n};\nuse std::{collections::HashMap, sync::Mutex};\n\npub struct Settings {\n program_state: Mutex<ProgramState>,\n}\n\npub struct ImageMap {\n map: HashMap<String, Vec<u8>>,\n}\n\n#[post(\"/process/<fen>\")]\npub async fn process(fen: String, settings: &State<Settings>) -> String {\n let program_state = *settings.program_state.lock().unwrap();\n let returned_fen = match process_fen(fen, program_state.num_plies) {\n Ok(f) => f,\n Err(e) => panic!(\"paniced because! {}\", e),\n };\n returned_fen\n}\n\n#[get(\"/possible/<fen>/<location>\")]\npub async fn possible(fen: String, location: String) -> MoveOptionsResponse {\n let options = valid_moves(fen, location).unwrap_or_default();\n MoveOptionsResponse { options }\n}\n\n#[get(\"/validate/<current_fen>/<current_location>/<possible_location>\")]\npub async fn validate(\n current_fen: String,\n current_location: String,\n possible_location: String,\n) -> ValidateResponse {\n let is_valid = is_valid(current_fen, current_location, possible_location).unwrap_or(false);\n ValidateResponse { is_valid }\n}\n\n#[get(\"/settings\")]\npub async fn settings(settings: &State<Settings>) -> SettingsResponse {\n let program_state = *settings.program_state.lock().unwrap();\n SettingsResponse { program_state }\n}\n\n#[get(\"/\")]\nfn index() -> Html<&'static str> {\n Html(include_str!(\"../../static/index.html\"))\n}\n\n#[get(\"/chrust.js\")]\nfn javascript() -> JavaScript<&'static str> {\n JavaScript(include_str!(\"../../static/js/chrust.js\"))\n}\n\n#[get(\"/chrust.css\")]\nfn css() -> Css<&'static str> {\n Css(include_str!(\"../../static/css/chrust.css\"))\n}\n\n#[get(\"/chesspieces/wikipedia/<piece>\")]\nfn chesspiece(piece: String, image_map: &State<ImageMap>) -> Custom<Vec<u8>> {\n let byte_vec = match image_map.map.get(&piece.replace(\".png\", \"\")) {\n Some(byte_vec) => byte_vec,\n None => panic!(\"Unable to find the piece image in the image_map!\"),\n };\n\n Custom(ContentType::PNG, byte_vec.clone())\n}\n\nfn init_image_map() -> HashMap<String, Vec<u8>> {\n HashMap::from([\n (\n \"bB\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bB.png\").to_vec(),\n ),\n (\n \"bK\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bK.png\").to_vec(),\n ),\n (\n \"bN\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bN.png\").to_vec(),\n ),\n (\n \"bP\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bP.png\").to_vec(),\n ),\n (\n \"bQ\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bQ.png\").to_vec(),\n ),\n (\n \"bR\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bR.png\").to_vec(),\n ),\n (\n \"wB\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wB.png\").to_vec(),\n ),\n (\n \"wK\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wK.png\").to_vec(),\n ),\n (\n \"wN\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wN.png\").to_vec(),\n ),\n (\n \"wP\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wP.png\").to_vec(),\n ),\n (\n \"wQ\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wQ.png\").to_vec(),\n ),\n (\n \"wR\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wR.png\").to_vec(),\n ),\n ])\n}\n\npub async fn build_and_run_frontend(ps: ProgramState) -> Result<(), rocket::Error> {\n rocket::build()\n .manage(Settings {\n program_state: Mutex::from(ps),\n })\n .manage(ImageMap {\n map: init_image_map(),\n })\n .mount(\"/chrust\", routes![index])\n .mount(\"/chrust/js\", routes![javascript])\n .mount(\"/chrust/css\", routes![css])\n .mount(\"/img\", routes![chesspiece])\n .mount(\"/chrust/api\", routes![process])\n .mount(\"/chrust/api\", routes![possible])\n .mount(\"/chrust/api\", routes![validate])\n .mount(\"/chrust/api\", routes![settings])\n .launch()\n .await\n}\n"},"prefix":{"kind":"string","value":"use super::{\n responses::{SettingsResponse, ValidateResponse},\n};\nuse crate::{\n frontend::responses::MoveOptionsResponse,\n game::chessgame::{is_valid, process_fen, valid_moves},\n state::programstate::ProgramState,\n};\nuse rocket::{\n get,\n http::ContentType,\n post,\n response::{\n content::{Css, Custom, Html, JavaScript},\n },\n routes, State,\n};\nuse std::{collections::HashMap, sync::Mutex};\n\npub struct Settings {\n program_state: Mutex<ProgramState>,\n}\n\npub struct ImageMap {\n map: HashMap<String, Vec<u8>>,\n}\n\n#[post(\"/process/<fen>\")]\npub async fn process(fen: String, settings: &State<Settings>) -> String {\n let program_state = *settings.program_state.lock().unwrap();\n let returned_fen = match process_fen(fen, program_state.num_plies) {\n Ok(f) => f,\n Err(e) => panic!(\"paniced because! {}\", e),\n };\n returned_fen\n}\n\n#[get(\"/possible/<fen>/<location>\")]\npub async fn possible(fen: String, location: String) -> MoveOptionsResponse {\n let options = valid_moves(fen, location).unwrap_or_default();\n MoveOptionsResponse { options }\n}\n\n#[get(\"/validate/<current_fen>/<current_location>/<possible_location>\")]\npub async fn validate(\n current_fen: String,\n current_location: String,\n possible_location: String,\n) -> ValidateResponse {\n let is_valid = is_valid(current_fen, current_location, possible_location).unwrap_or(false);\n ValidateResponse { is_valid }\n}\n\n#[get(\"/settings\")]\npub async fn settings(settings: &State<Settings>) -> SettingsResponse {\n let program_state = *settings.program_state.lock().unwrap();\n SettingsResponse { program_state }\n}\n\n#[get(\"/\")]\nfn index() -> Html<&'static str> {\n Html(include_str!(\"../../static/index.html\"))\n}\n\n#[get(\"/chrust.js\")]\nfn javascript() -> JavaScript<&'static str> {\n JavaScript(include_str!(\"../../static/js/chrust.js\"))\n}\n\n#[get(\"/chrust.css\")]\nfn css() -> Css<&'static str> {\n Css(include_str!(\"../../static/css/chrust.css\"))\n}\n\n#[get(\"/chesspieces/wikipedia/<piece>\")]\nfn chesspiece(piece: String, image_map: &State<ImageMap>) -> Custom<Vec<u8>> {\n let byte_vec = match image_map.map.get(&piece.replace(\".png\", \"\")) {\n Some(byte_vec) => byte_vec,\n None => panic!(\"Unable to find the piece image in the image_map!\"),\n };\n\n Custom(ContentType::PNG, byte_vec.clone())\n}\n\nfn init_image_map() -> HashMap<String, Vec<u8>> {\n HashMap::from([\n (\n \"bB\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bB.png\").to_vec(),\n ),\n (\n \"bK\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bK.png\").to_vec(),\n ),\n (\n \"bN\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bN.png\").to_vec(),\n ),\n (\n \"bP\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bP.png\").to_vec(),\n ),\n (\n \"bQ\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bQ.png\").to_vec(),\n ),\n (\n \"bR\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/bR.png\").to_vec(),\n ),\n (\n \"wB\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wB.png\").to_vec(),\n ),\n (\n \"wK\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wK.png\").to_vec(),\n ),\n (\n \"wN\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wN.png\").to_vec(),\n ),\n (\n \"wP\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wP.png\").to_vec(),\n ),\n (\n \"wQ\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wQ.png\").to_vec(),\n ),\n (\n \"wR\".to_string(),\n include_bytes!(\"../../static/img/chesspieces/wikipedia/wR.png\").to_vec(),\n ),\n ])\n}\n\npub async fn build_and_run_frontend(ps: ProgramState) -> Result<(), rocket::Error> {\n rocket::build()\n .manage(Set"},"suffix":{"kind":"string","value":"\n .mount(\"/chrust/api\", routes![validate])\n .mount(\"/chrust/api\", routes![settings])\n .launch()\n .await\n}\n"},"middle":{"kind":"string","value":"tings {\n program_state: Mutex::from(ps),\n })\n .manage(ImageMap {\n map: init_image_map(),\n })\n .mount(\"/chrust\", routes![index])\n .mount(\"/chrust/js\", routes![javascript])\n .mount(\"/chrust/css\", routes![css])\n .mount(\"/img\", routes![chesspiece])\n .mount(\"/chrust/api\", routes![process])\n .mount(\"/chrust/api\", routes![possible])"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"pub fn get_args() -> Result<ProgramState, Box<dyn std::error::Error>> {\n\n let matches = App::new(\"Chrust\")\n\n .version(\"0.2.0\")\n\n .author(\"John YB. <jyenterbriars@gmail.com>\")\n\n .about(\"Simple Chess Engine\")\n\n .arg(\n\n Arg::new(\"viz\")\n\n .short('z')\n\n .long(\"visualization_mode\")\n\n .value_name(\"TERM|WEB\")\n\n .about(\"Sets the method of visualization for the app\")\n\n .takes_value(true)\n\n .default_value(\"WEB\")\n\n )\n\n .arg(\n\n Arg::new(\"hplay\")\n\n .short('h')\n\n .long(\"human_plays\")\n\n .value_name(\"true|false\")\n\n .about(\"Sets whether or not the human player will play the game. If false, the human player makes random decisions\")\n","file_path":"src/state/programstate.rs","rank":2,"score":150730.49792743544},{"content":"pub fn is_valid(\n\n current_fen: String,\n\n current_location: String,\n\n possible_location: String,\n\n) -> Result<bool, Box<dyn std::error::Error>> {\n\n let board_section = current_fen\n\n .split(' ')\n\n .next()\n\n .expect(\"Fen is improperly formatted!\");\n\n\n\n let board =\n\n Board::load_from_fen(board_section.to_string()).expect(\"Unable to load board from \");\n\n\n\n let current_position = current_location.to_coord();\n\n\n\n let possible_moves = board.possible_moves(current_position, Color::White)?;\n\n\n\n let possible_position = possible_location.to_coord();\n\n\n\n let valid_move = possible_moves\n\n .iter()\n\n .any(|coord| coord.x == possible_position.x && coord.y == possible_position.y);\n\n\n\n Ok(valid_move)\n\n}\n\n\n","file_path":"src/game/chessgame.rs","rank":3,"score":136002.6296219358},{"content":"pub fn process_fen(fen: String, num_plies: u32) -> Result<String, Box<dyn Error>> {\n\n let board_section = fen.split(' ').next().expect(\"Fen is improperly formatted!\");\n\n\n\n let board =\n\n Board::load_from_fen(board_section.to_string()).expect(\"Unable to load board from \");\n\n\n\n let ai_move = max_decision(&board, Color::Black, num_plies)?;\n\n\n\n let new_board = board.apply_action(&ai_move);\n\n\n\n new_board.print_to_screen(\"ai move\".to_string());\n\n\n\n Ok(new_board.board_fen_section())\n\n}\n\n\n","file_path":"src/game/chessgame.rs","rank":6,"score":131585.10664124187},{"content":"//this is a mess and i dont fully understand it - i just did what the compiler told me to\n\nfn get_input<I: std::str::FromStr>() -> Result<I, Box<dyn Error>>\n\nwhere\n\n <I as FromStr>::Err: 'static + Error,\n\n{\n\n let mut line = String::new();\n\n let _ = std::io::stdin().read_line(&mut line).unwrap();\n\n let y: I = line.trim().parse()?;\n\n Ok(y)\n\n}\n","file_path":"src/game/chessgame.rs","rank":8,"score":117197.66739345377},{"content":"pub fn valid_moves(\n\n fen: String,\n\n location: String,\n\n) -> Result<Vec<Coordinate>, Box<dyn std::error::Error>> {\n\n let board_section = fen.split(' ').next().expect(\"Fen is improperly formatted!\");\n\n\n\n let board =\n\n Board::load_from_fen(board_section.to_string()).expect(\"Unable to load board from \");\n\n\n\n if location.as_str().len() != 2 {\n\n return Err(Box::from(\"Invalid format for location string\"));\n\n }\n\n\n\n let current_position = location.to_coord();\n\n\n\n if board.piece(current_position.x, current_position.y)?.color == Color::Black {\n\n return Ok(vec![]);\n\n }\n\n\n\n let coords = board\n\n .possible_moves(current_position, Color::White)\n\n .expect(\"Unable to find the valid moves!\");\n\n\n\n Ok(coords)\n\n}\n\n\n","file_path":"src/game/chessgame.rs","rank":9,"score":111855.01360393225},{"content":"pub fn max_decision(\n\n board: &Board,\n\n color: Color,\n\n max_depth: u32,\n\n) -> Result<PieceMove, Box<dyn std::error::Error>> {\n\n let start = Instant::now();\n\n let (max_decision, _) = minimax_decision_max(board, color, max_depth, -1000000, 1000000)?;\n\n let duration = start.elapsed();\n\n println!(\"Time to determine move: {:?}\", duration);\n\n Ok(max_decision)\n\n}\n","file_path":"src/ai/minimax/funcs.rs","rank":10,"score":84812.19070075238},{"content":"fn piece_from_fen_char(c: char) -> Result<ChessPiece, Box<dyn std::error::Error>> {\n\n match c {\n\n 'p' => Ok(ChessPiece{piece_type: PieceType::Pawn, color: Color::Black}),\n\n 'r' => Ok(ChessPiece{piece_type: PieceType::Rook, color: Color::Black}),\n\n 'n' => Ok(ChessPiece{piece_type: PieceType::Knight, color: Color::Black}),\n\n 'b' => Ok(ChessPiece{piece_type: PieceType::Bishop, color: Color::Black}),\n\n 'k' => Ok(ChessPiece{piece_type: PieceType::King, color: Color::Black}),\n\n 'q' => Ok(ChessPiece{piece_type: PieceType::Queen, color: Color::Black}),\n\n 'P' => Ok(ChessPiece{piece_type: PieceType::Pawn, color: Color::White}),\n\n 'R' => Ok(ChessPiece{piece_type: PieceType::Rook, color: Color::White}),\n\n 'N' => Ok(ChessPiece{piece_type: PieceType::Knight, color: Color::White}),\n\n 'B' => Ok(ChessPiece{piece_type: PieceType::Bishop, color: Color::White}),\n\n 'K' => Ok(ChessPiece{piece_type: PieceType::King, color: Color::White}),\n\n 'Q' => Ok(ChessPiece{piece_type: PieceType::Queen, color: Color::White}),\n\n _ => Err(Box::from(\"Invalid char: {}\")),\n\n }\n\n}\n","file_path":"src/board/chessboard.rs","rank":11,"score":81160.4944864261},{"content":"//NOTE: this evaluation function assumes that the WHITE is the MIN player and BLACK is the MAX player\n\npub fn evaluate(board: &Board) -> i32 {\n\n let cells = board.all_cells();\n\n cells\n\n .iter()\n\n .map(|c| match c.space {\n\n Some(p) => {\n\n let abs_value = piece_value(p.piece_type) + piece_position_score(&p, c.x, c.y);\n\n if p.color == Color::White {\n\n -abs_value\n\n } else {\n\n abs_value\n\n }\n\n }\n\n None => 0,\n\n })\n\n .sum()\n\n}\n\n\n","file_path":"src/ai/minimax/evaluate.rs","rank":12,"score":71129.64789532292},{"content":"fn piece_value(piece_type: PieceType) -> i32 {\n\n match piece_type {\n\n PieceType::Pawn => 10,\n\n PieceType::Rook => 50,\n\n PieceType::Knight => 30,\n\n PieceType::Bishop => 30,\n\n PieceType::Queen => 90,\n\n PieceType::King => 900,\n\n }\n\n}\n\n\n","file_path":"src/ai/minimax/evaluate.rs","rank":13,"score":67703.37216486958},{"content":"fn piece_eval_vector(piece_type: PieceType, color: Color) -> Vec<Vec<f64>> {\n\n match (piece_type, color) {\n\n (PieceType::Pawn, Color::White) => arr_to_vec(PAWN_EVAL_WHITE),\n\n (PieceType::Pawn, Color::Black) => reverse(arr_to_vec(PAWN_EVAL_WHITE)),\n\n (PieceType::Rook, Color::White) => arr_to_vec(ROOK_EVAL_WHITE),\n\n (PieceType::Rook, Color::Black) => reverse(arr_to_vec(ROOK_EVAL_WHITE)),\n\n (PieceType::Knight, Color::White) => arr_to_vec(KNIGHT_EVAL_WHITE),\n\n (PieceType::Knight, Color::Black) => reverse(arr_to_vec(KNIGHT_EVAL_WHITE)),\n\n (PieceType::Bishop, Color::White) => arr_to_vec(BISHOP_EVAL_WHITE),\n\n (PieceType::Bishop, Color::Black) => reverse(arr_to_vec(BISHOP_EVAL_WHITE)),\n\n (PieceType::Queen, Color::White) => arr_to_vec(QUEEN_EVAL_WHITE),\n\n (PieceType::Queen, Color::Black) => reverse(arr_to_vec(QUEEN_EVAL_WHITE)),\n\n (PieceType::King, Color::White) => arr_to_vec(KING_EVAL_WHITE),\n\n (PieceType::King, Color::Black) => reverse(arr_to_vec(KING_EVAL_WHITE)),\n\n }\n\n}\n\n\n","file_path":"src/ai/minimax/evaluate.rs","rank":14,"score":57729.61096581114},{"content":"fn piece_position_score(p: &ChessPiece, x: char, y: i32) -> i32 {\n\n let vector = piece_eval_vector(p.piece_type, p.color);\n\n vector[char_to_int(x) as usize][y as usize - 1] as i32\n\n}\n\n\n","file_path":"src/ai/minimax/evaluate.rs","rank":15,"score":57645.248403006175},{"content":"use clap::{App, Arg};\n\n\n\nuse super::viztype::VizType;\n\n\n\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\n\npub struct ProgramState {\n\n pub viz_type: VizType,\n\n pub human_plays: bool,\n\n pub tick_speed: u64,\n\n pub num_plies: u32,\n\n}\n\n\n","file_path":"src/state/programstate.rs","rank":16,"score":57300.65410775105},{"content":" )\n\n .get_matches();\n\n\n\n //this is horrible and i'm sorry\n\n let viz_type = matches.value_of(\"viz\").ok_or(\"unable to parse arguments :(\")?;\n\n let human_plays = matches.value_of(\"hplay\").ok_or(\"unable to parse arguments :(\")?;\n\n let tick_speed = matches.value_of(\"tick\").ok_or(\"unable to parse arguments :(\")?;\n\n let num_plies = matches.value_of(\"plies\").ok_or(\"unable to parse arguments :(\")?;\n\n\n\n let program_state = ProgramState {\n\n viz_type: match viz_type {\n\n \"TERM\" => VizType::Term,\n\n \"WEB\" => VizType::Web,\n\n _ => {\n\n return Err(Box::from(\n\n \"You must pass in a vaid argument for the -v flag!\",\n\n ));\n\n }\n\n },\n\n human_plays: match human_plays {\n","file_path":"src/state/programstate.rs","rank":17,"score":57299.066427416896},{"content":" \"true\" => true,\n\n \"false\" => false,\n\n _ => {\n\n return Err(Box::from(\n\n \"You must pass in a vaid argument for the -h flag!\",\n\n ));\n\n }\n\n },\n\n tick_speed: tick_speed.parse()?,\n\n num_plies: num_plies.parse()?,\n\n };\n\n\n\n Ok(program_state)\n\n}\n","file_path":"src/state/programstate.rs","rank":18,"score":57295.4573549779},{"content":" .takes_value(true)\n\n .default_value(\"true\")\n\n )\n\n .arg(\n\n Arg::new(\"tick\")\n\n .short('t')\n\n .long(\"tick_speed\")\n\n .value_name(\"positive integer\")\n\n .about(\"Sets the interval between moves. (Milliseconds)\")\n\n .takes_value(true)\n\n .default_value(\"1000\")\n\n )\n\n .arg(\n\n Arg::new(\"plies\")\n\n .short('p')\n\n .long(\"num_plies\")\n\n .value_name(\"positive integer\")\n\n .about(\"Number of turns into the future the AI will look ahead.\")\n\n .takes_value(true)\n\n .default_value(\"3\")\n","file_path":"src/state/programstate.rs","rank":19,"score":57292.58143925297},{"content":"pub trait ToCoord {\n\n fn to_coord(&self) -> Coordinate;\n\n}\n\n\n\nimpl ToCoord for std::string::String {\n\n fn to_coord(&self) -> Coordinate {\n\n let mut chars = self.chars();\n\n let x: char = chars.next().unwrap();\n\n let y: u32 = chars.next().unwrap().to_digit(10).unwrap();\n\n Coordinate { x, y: y as i32 }\n\n }\n\n}\n","file_path":"src/ext/stringext.rs","rank":20,"score":46156.49401683462},{"content":"fn enemy_occupied(coordinate: Coordinate, current_piece_color: Color, board: &Board) -> bool {\n\n let cell = board.test_cell_at(coordinate);\n\n\n\n match cell {\n\n Some(c) => match c.space {\n\n Some(piece) => piece.color != current_piece_color,\n\n None => false,\n\n },\n\n None => false,\n\n }\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":21,"score":45541.314867411216},{"content":"fn friendly_occupied(coordinate: Coordinate, current_piece_color: Color, board: &Board) -> bool {\n\n let cell = board.test_cell_at(coordinate);\n\n\n\n match cell {\n\n Some(c) => match c.space {\n\n Some(piece) => piece.color == current_piece_color,\n\n None => false,\n\n },\n\n None => false,\n\n }\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":22,"score":45541.314867411216},{"content":"pub trait ChessPlayer {\n\n fn name(&self) -> &str;\n\n fn color_abbr(&self) -> char;\n\n}\n","file_path":"src/player/chessplayer.rs","rank":23,"score":45034.99206521352},{"content":"pub trait Action<'a> {\n\n fn get_piece_(&self) -> &ChessPiece;\n\n fn get_x(&self) -> char;\n\n fn get_y(&self) -> i32;\n\n // fn get_player(&self) -> &'a dyn ChessPlayer;\n\n}\n\n\n\npub struct HumanAction<'a> {\n\n pub piece_move: PieceMove<'a>,\n\n pub player: &'a HumanPlayer,\n\n}\n\n\n\nimpl<'a> HumanAction<'a> {\n\n // pub fn new(piece_move: PieceMove<'a>, player: &'a HumanPlayer) -> Self {\n\n // HumanAction{piece_move, player}\n\n // }\n\n}\n\n\n\npub struct AIAction<'a> {\n\n pub piece_move: PieceMove<'a>,\n","file_path":"src/chessmove/action.rs","rank":24,"score":43984.49330083186},{"content":"fn minimax_decision_max(\n\n board: &Board,\n\n color: Color,\n\n max_depth: u32,\n\n alpha: i32,\n\n beta: i32,\n\n) -> Result<(PieceMove, i32), Box<dyn Error>> {\n\n let mut good_actions = Vec::new();\n\n\n\n for action in board.all_possible_moves(color)? {\n\n good_actions.push((\n\n action,\n\n min_value(&board.apply_action(&action), max_depth, alpha, beta),\n\n ));\n\n }\n\n\n\n let max_action = good_actions.into_iter().max_by(|x, y| x.1.cmp(&y.1));\n\n\n\n match max_action {\n\n Some(action) => Ok(action),\n\n None => Err(Box::from(\"Minimax was unable to find a max decision!\")),\n\n }\n\n}\n\n\n","file_path":"src/ai/minimax/funcs.rs","rank":25,"score":43254.350902784085},{"content":" getCurrentSettings() {\n\n var url = `${this.apiUrl}/api/settings`;\n\n return fetch(url,\n\n {\n\n method: 'GET',\n\n mode: 'cors',\n\n cache: 'no-cache',\n\n credentials: 'same-origin',\n\n headers: {\n\n 'Content-Type': 'application/json'\n\n }\n\n }\n\n\n\n ).then((response) => { return response.text() }\n\n ).then((text) => {\n\n var foo = JSON.parse(text);\n\n return foo.program_state;\n\n })\n\n .catch((err) => {\n\n return false;\n\n });\n","file_path":"static/js/chrust.js","rank":26,"score":41217.542644447},{"content":"fn char_to_int(x: char) -> i32 {\n\n match x {\n\n 'a' => 0,\n\n 'b' => 1,\n\n 'c' => 2,\n\n 'd' => 3,\n\n 'e' => 4,\n\n 'f' => 5,\n\n 'g' => 6,\n\n 'h' => 7,\n\n _ => panic!(\"Coordinate not well structured!\"),\n\n }\n\n}\n\n\n","file_path":"src/ai/minimax/evaluate.rs","rank":27,"score":36423.53908641075},{"content":"fn up_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.up_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":28,"score":33239.863135474465},{"content":"fn down_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.down_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":29,"score":33239.863135474465},{"content":"fn left_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.left_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":30,"score":32459.57677247803},{"content":"fn right_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.right_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":31,"score":32459.57677247803},{"content":"fn diagonal_up_left_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.diagonal_up_left_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":32,"score":31734.72436616005},{"content":"fn diagonal_down_right_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.diagonal_down_right_by(ammount)\n\n}\n","file_path":"src/board/cell/piecetype.rs","rank":33,"score":31734.72436616005},{"content":"fn diagonal_down_left_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.diagonal_down_left_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":34,"score":31734.72436616005},{"content":"fn diagonal_up_right_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\n\n coordinate.diagonal_up_right_by(ammount)\n\n}\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":35,"score":31734.72436616005},{"content":"fn arr_to_vec(arr: [[f64; 8]; 8]) -> Vec<Vec<f64>> {\n\n arr.to_vec().iter().map(|row| row.to_vec()).collect()\n\n}\n\n\n","file_path":"src/ai/minimax/evaluate.rs","rank":36,"score":30048.471622512483},{"content":"fn reverse(vec: Vec<Vec<f64>>) -> Vec<Vec<f64>> {\n\n vec.into_iter().rev().collect::<Vec<Vec<f64>>>()\n\n}\n\n\n\nstatic PAWN_EVAL_WHITE: [[f64; 8]; 8] = [\n\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\n\n [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0],\n\n [1.0, 1.0, 2.0, 3.0, 3.0, 2.0, 1.0, 1.0],\n\n [0.5, 0.5, 1.0, 2.5, 2.5, 1.0, 0.5, 0.5],\n\n [0.0, 0.0, 0.0, 2.0, 2.0, 0.0, 0.0, 0.0],\n\n [0.5, -0.5, -1.0, 0.0, 0.0, -1.0, -0.5, 0.5],\n\n [0.5, 1.0, 1.0, -2.0, -2.0, 1.0, 1.0, 0.5],\n\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\n\n];\n\n\n\nstatic KNIGHT_EVAL_WHITE: [[f64; 8]; 8] = [\n\n [-5.0, -4.0, -3.0, -3.0, -3.0, -3.0, -4.0, -5.0],\n\n [-4.0, -2.0, 0.0, 0.0, 0.0, 0.0, -2.0, -4.0],\n\n [-3.0, 0.0, 1.0, 1.5, 1.5, 1.0, 0.0, -3.0],\n\n [-3.0, 0.5, 1.5, 2.0, 2.0, 1.5, 0.5, -3.0],\n","file_path":"src/ai/minimax/evaluate.rs","rank":37,"score":29373.348511649725},{"content":"pub mod programstate;\n\npub mod viztype;\n","file_path":"src/state/mod.rs","rank":38,"score":28589.922838629565},{"content":"use core::fmt;\n\n\n\n#[derive(Debug, PartialEq, Clone, Copy, Serialize, Deserialize)]\n\npub enum VizType {\n\n Term,\n\n Web,\n\n}\n\n\n\nimpl fmt::Display for VizType {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{:?}\", self)\n\n }\n\n}\n","file_path":"src/state/viztype.rs","rank":39,"score":28589.59300297814},{"content":"fn min_value(board: &Board, depth: u32, alpha: i32, mut beta: i32) -> i32 {\n\n if depth == 0 {\n\n return evaluate(board);\n\n }\n\n\n\n let mut best_value = 1000000;\n\n\n\n let moves = match board.all_possible_moves(Color::White) {\n\n Ok(mvs) => mvs,\n\n Err(e) => panic!(\n\n \"Unable to get the possible moves from current board state: {:?}\",\n\n e\n\n ),\n\n };\n\n\n\n for action in moves {\n\n best_value = cmp::min(\n\n best_value,\n\n max_value(&board.apply_action(&action), depth - 1, alpha, beta),\n\n );\n","file_path":"src/ai/minimax/funcs.rs","rank":40,"score":25281.958330568108},{"content":"fn max_value(board: &Board, depth: u32, mut alpha: i32, beta: i32) -> i32 {\n\n if depth == 0 {\n\n return evaluate(board);\n\n }\n\n\n\n let mut best_value = -1000000;\n\n\n\n let moves = match board.all_possible_moves(Color::Black) {\n\n Ok(mvs) => mvs,\n\n Err(e) => panic!(\n\n \"Unable to get the possible moves from current board state: {:?}\",\n\n e\n\n ),\n\n };\n\n\n\n for action in moves {\n\n best_value = cmp::max(\n\n best_value,\n\n min_value(&board.apply_action(&action), depth - 1, alpha, beta),\n\n );\n\n alpha = cmp::max(alpha, best_value);\n\n if beta <= alpha {\n\n return best_value;\n\n }\n\n }\n\n\n\n best_value\n\n}\n\n\n","file_path":"src/ai/minimax/funcs.rs","rank":41,"score":25281.958330568108},{"content":"const refreshSettings = async () => {\n\n var result = await chrustAPI.getCurrentSettings();\n\n for(key in result){\n\n document.getElementById(key).textContent = result[key];\n\n }\n","file_path":"static/js/chrust.js","rank":42,"score":23100.229276237456},{"content":"var getMoveAPI = () => {\n\n chrustAPI.sendFen();\n","file_path":"static/js/chrust.js","rank":43,"score":22152.783213282197},{"content":" isValid(currentLocation, possibleLocation, resolve) {\n\n if (!isValidLocationString(currentLocation) || !isValidLocationString(possibleLocation)) return;\n\n var fen = this.chessBoard.fen();\n\n var url = `${this.apiUrl}/api/validate/${encodeURIComponent(fen)}/${currentLocation}/${possibleLocation}`;\n\n this.currenlyInWebRequest = true;\n\n var request = new XMLHttpRequest();\n\n request.open('GET', url, false);\n\n request.send(null);\n\n this.currenlyInWebRequest = false;\n\n\n\n if (request.status === 200) {\n\n var foo = JSON.parse(request.responseText);\n\n return foo.is_valid;\n\n }\n","file_path":"static/js/chrust.js","rank":44,"score":22152.783213282197},{"content":" validMoves(location) {\n\n if (!isValidLocationString(location)) return;\n\n var fen = this.chessBoard.fen();\n\n var url = `${this.apiUrl}/api/possible/${encodeURIComponent(fen)}/${location}`;\n\n return fetch(url,\n\n {\n\n method: 'GET',\n\n mode: 'cors',\n\n cache: 'no-cache',\n\n credentials: 'same-origin',\n\n headers: {\n\n 'Content-Type': 'application/json'\n\n }\n\n }\n\n\n\n ).then((response) => { return response.text() }\n\n ).then((text) => {\n\n var foo = JSON.parse(text);\n\n return foo.options;\n\n })\n\n .catch((err) => {\n\n return false;\n\n });\n","file_path":"static/js/chrust.js","rank":45,"score":21340.20203331797},{"content":"use std::io::Cursor;\n\n\n\nuse crate::board::coordinate::Coordinate;\n\nuse crate::state::programstate::ProgramState;\n\nuse rocket::http::ContentType;\n\nuse rocket::request::Request;\n\nuse rocket::response;\n\nuse rocket::response::Responder;\n\nuse rocket::response::Response;\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct MoveOptionsResponse {\n\n pub options: Vec<Coordinate>,\n\n}\n\n\n\nimpl<'r> Responder<'r, 'static> for MoveOptionsResponse {\n\n fn respond_to(self, _: &'r Request<'_>) -> response::Result<'static> {\n\n let response_string = serde_json::to_string(&self).unwrap();\n\n Response::build()\n\n .header(ContentType::JSON)\n","file_path":"src/frontend/responses.rs","rank":49,"score":19.74850151277398},{"content":"\n\n match cell.space {\n\n Some(_) => {\n\n //TODO - handle the piece being captured\n\n cell.space = Option::from(target_piece);\n\n }\n\n None => {\n\n cell.space = Option::from(target_piece);\n\n }\n\n };\n\n }\n\n }\n\n }\n\n\n\n //3: set the current cell to nothing\n\n self.space_to_empty(from.x, from.y);\n\n }\n\n\n\n pub fn load_from_file(board_name: &str) -> Result<Board, Box<dyn std::error::Error>> {\n\n let board_string = match board_name {\n","file_path":"src/board/chessboard.rs","rank":50,"score":18.214025931092785},{"content":"use super::color::Color;\n\nuse super::piecetype::PieceType;\n\n\n\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\n\npub struct ChessPiece {\n\n pub piece_type: PieceType,\n\n pub color: Color,\n\n}\n\n\n\nimpl ChessPiece {\n\n pub fn str(&self) -> &str {\n\n match (self.piece_type, self.color) {\n\n (PieceType::Pawn, Color::White) => \"\\u{2659}\",\n\n (PieceType::Pawn, Color::Black) => \"\\u{265F}\",\n\n (PieceType::Rook, Color::White) => \"\\u{2656}\",\n\n (PieceType::Rook, Color::Black) => \"\\u{265C}\",\n\n (PieceType::Knight, Color::White) => \"\\u{2658}\",\n\n (PieceType::Knight, Color::Black) => \"\\u{265E}\",\n\n (PieceType::Bishop, Color::White) => \"\\u{2657}\",\n\n (PieceType::Bishop, Color::Black) => \"\\u{265D}\",\n","file_path":"src/board/cell/chesspiece.rs","rank":52,"score":15.394112965904615},{"content":"extern crate serde_derive;\n\nextern crate serde_json;\n\n\n\nuse crate::board::cell::Cell;\n\nuse crate::board::cell::piecetype::PieceType;\n\nuse crate::chessmove::piecemove::{PieceMove};\n\nuse crate::player::humanplayer::HumanPlayer;\n\nuse std::error::Error;\n\nuse core::result::Result;\n\n\n\nuse crate::board::cell::chesspiece::ChessPiece;\n\nuse crate::board::cell::color::Color;\n\n\n\nuse super::coordinate::Coordinate;\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\npub struct Board {\n\n pub squares: Vec<Vec<Cell>>,\n\n pub board_size: i32,\n\n}\n","file_path":"src/board/chessboard.rs","rank":53,"score":14.6655671303245},{"content":" return Ok(false);\n\n }\n\n choices\n\n }\n\n Err(reason) => {\n\n println!(\"Not valid move : {:?}\", reason);\n\n return Ok(false);\n\n }\n\n };\n\n\n\n println!(\"Options: \");\n\n for (index, c) in coord_choices.iter().enumerate() {\n\n println!(\"choice: {}, coord: {:?}\", index, c);\n\n }\n\n\n\n let choice = match get_input::<i32>() {\n\n Ok(i) => i,\n\n Err(_) => {\n\n return Ok(false);\n\n }\n","file_path":"src/game/chessgame.rs","rank":55,"score":13.724246670164833},{"content":"pub mod chesspiece;\n\npub mod color;\n\npub mod piecetype;\n\n\n\nuse chesspiece::ChessPiece;\n\nuse color::Color;\n\n\n\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\n\npub struct Cell {\n\n pub space: Option<ChessPiece>,\n\n pub color: Color,\n\n pub x: char,\n\n pub y: i32,\n\n}\n\n\n\nimpl Cell {\n\n // pub fn is_empty(&self) -> bool{\n\n // match self.space {\n\n // Some(_) => false,\n\n // None => true\n\n // }\n\n // }\n\n}\n","file_path":"src/board/cell/mod.rs","rank":56,"score":13.15829429619204},{"content":"use chrust::{\n\n board::{cell::color::Color, chessboard::Board},\n\n frontend::server::build_and_run_frontend,\n\n game::chessgame::ChessGame,\n\n player::{aiplayer::AIPlayer, humanplayer::HumanPlayer},\n\n state::{programstate::get_args, viztype::VizType},\n\n};\n\n\n\n#[rocket::main]\n\nasync fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let program_state = get_args()?;\n\n let board = Board::load_from_file(\"game_start\")?;\n\n\n\n let human_player = HumanPlayer {\n\n name: \"kasparov\".to_string(),\n\n color: Color::White,\n\n };\n\n\n\n let ai_player = AIPlayer {\n\n name: \"rusty\".to_string(),\n","file_path":"src/main.rs","rank":57,"score":12.96579275845523},{"content":"use super::chessplayer::ChessPlayer;\n\nuse crate::board::cell::color::Color;\n\n\n\n#[derive(Debug)]\n\npub struct HumanPlayer {\n\n pub name: String,\n\n pub color: Color,\n\n}\n\n\n\nimpl ChessPlayer for HumanPlayer {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n fn color_abbr(&self) -> char {\n\n self.color.color_abbr()\n\n }\n\n}\n","file_path":"src/player/humanplayer.rs","rank":58,"score":12.948076705958545},{"content":"use crate::board::cell::color::Color;\n\n\n\nuse super::chessplayer::ChessPlayer;\n\n\n\n#[derive(Debug)]\n\npub struct AIPlayer {\n\n pub color: Color,\n\n pub name: String,\n\n}\n\n\n\nimpl ChessPlayer for AIPlayer {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n fn color_abbr(&self) -> char {\n\n self.color.color_abbr()\n\n }\n\n}\n","file_path":"src/player/aiplayer.rs","rank":59,"score":12.948076705958545},{"content":" }\n\n\n\n pub fn check_for_winner(&self) -> Option<String> {\n\n let white_king = self.board.piece_specific(Color::White, PieceType::King);\n\n let black_king = self.board.piece_specific(Color::Black, PieceType::King);\n\n\n\n match (white_king.is_some(), black_king.is_some()) {\n\n (true, true) => None,\n\n (true, false) => Some(self.user_of_color(Color::White).name().to_string()),\n\n (false, true) => Some(self.user_of_color(Color::Black).name().to_string()),\n\n (false, false) => panic!(\"Something went horribly wrong. Both kings are gone?\"),\n\n }\n\n }\n\n\n\n pub fn start_game(&mut self) -> Result<String, Box<dyn Error>> {\n\n self.print_to_screen(\"Initial\".to_string());\n\n\n\n let mut turn_num: u32 = 1;\n\n\n\n let winner = loop {\n","file_path":"src/game/chessgame.rs","rank":60,"score":12.18855915122067},{"content":"#[derive(Serialize, Deserialize)]\n\npub struct SettingsResponse {\n\n pub program_state: ProgramState\n\n}\n\n\n\nimpl<'r> Responder<'r, 'static> for SettingsResponse {\n\n fn respond_to(self, _: &'r Request<'_>) -> response::Result<'static> {\n\n let response_string = serde_json::to_string(&self).unwrap();\n\n Response::build()\n\n .header(ContentType::JSON)\n\n .sized_body(response_string.len(), Cursor::new(response_string))\n\n .ok()\n\n }\n\n}\n","file_path":"src/frontend/responses.rs","rank":61,"score":12.167924245940355},{"content":"// use crate::ai::minimax::boardstate::BoardState;\n\nuse crate::ai::minimax::funcs::max_decision;\n\nuse crate::board::cell::color::Color;\n\nuse crate::board::cell::piecetype::PieceType;\n\nuse crate::board::chessboard::Board;\n\nuse crate::board::coordinate::Coordinate;\n\n// use crate::chessmove::piecemove::Move;\n\nuse crate::player::aiplayer::*;\n\nuse crate::player::chessplayer::ChessPlayer;\n\nuse crate::player::humanplayer::*;\n\n\n\nextern crate rand;\n\n\n\n// use rand::thread_rng;\n\nuse rand::seq::SliceRandom;\n\n\n\nuse std::error::Error;\n\nuse std::str::FromStr;\n\nuse std::thread;\n\nuse std::time::Duration;\n","file_path":"src/game/chessgame.rs","rank":62,"score":11.566132495470892},{"content":" self.board.move_piece(ai_move.from, ai_move.to);\n\n\n\n self.fullmove_counter += 1;\n\n self.halfmove_clock += 1;\n\n\n\n Ok(true)\n\n }\n\n\n\n pub fn human_moves(&mut self) -> Result<bool, Box<dyn Error>> {\n\n println!(\"Human moving!\");\n\n\n\n let (from, to) = if self.human_plays {\n\n println!(\"Select your piece!\");\n\n\n\n println!(\"x:\");\n\n let x = match get_input::<char>() {\n\n Ok(c) => c,\n\n Err(_) => {\n\n return Ok(false);\n\n }\n","file_path":"src/game/chessgame.rs","rank":63,"score":11.311831393230133},{"content":" \"game_start\" => include_str!(\"../../boards/game_start.json\"),\n\n \"empty_board\" => include_str!(\"../../boards/empty_board.json\"),\n\n _ => {return Err(Box::from(\"Invalid option for board_name\"))}\n\n };\n\n \n\n let board: Board = serde_json::from_str(board_string)?;\n\n\n\n if board.squares.len() as i32 != board.board_size {\n\n return Err(Box::from(format!(\n\n \"The json board is formated incorectly! The expected board_size: {} does not match the actual board size: {}\",\n\n board.board_size, \n\n board.squares.len()\n\n )));\n\n }\n\n\n\n Ok(board)\n\n }\n\n \n\n // assumes the game section of the fen has been taken out\n\n pub fn load_from_fen(fen: String) -> Result<Board, Box<dyn std::error::Error>> {\n","file_path":"src/board/chessboard.rs","rank":64,"score":11.268720255783398},{"content":"use super::chessboard::Board;\n\n\n\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\n\npub struct Coordinate {\n\n pub x: char, //a-h\n\n pub y: i32, //1-8\n\n}\n\n\n\n//NO ERROR HANDLING - call is_valid if you want to test validity of a coordinate\n\nimpl Coordinate {\n\n pub fn new(x: char, y: i32) -> Self {\n\n Coordinate { x, y }\n\n }\n\n\n\n pub fn is_valid(&self, board: &Board) -> bool {\n\n (1..9).any(|ele| ele == self.y)\n\n && \"abcdefgh\"\n\n .to_string()\n\n .chars()\n\n .into_iter()\n","file_path":"src/board/coordinate.rs","rank":65,"score":11.152833827410172},{"content":" }\n\n for cell in row {\n\n if let Some(piece_ref) = &cell.space {\n\n print!(\" {} |\", piece_ref.str());\n\n } else {\n\n print!(\" |\");\n\n }\n\n }\n\n println!();\n\n }\n\n print!(\" \");\n\n \"abcdefgh\".to_string().chars().into_iter().for_each(|int| print!(\" {} \", int));\n\n println!();\n\n }\n\n\n\n pub fn piece(&self, x: char, y: i32) -> core::result::Result<&ChessPiece, Box<dyn Error>> {\n\n for cell in self.all_cells() {\n\n if cell.x == x && cell.y == y {\n\n if let Some(piece_ref) = &cell.space {\n\n return Ok(piece_ref);\n","file_path":"src/board/chessboard.rs","rank":66,"score":10.704662719758844},{"content":"use crate::board::{cell::color, chessboard::Board, coordinate::Coordinate};\n\n\n\nuse super::{chesspiece::ChessPiece, color::Color};\n\n\n\n#[derive(Debug, Clone, Copy, Serialize, Deserialize, PartialEq)]\n\npub enum PieceType {\n\n Pawn = 1,\n\n Rook = 2,\n\n Knight = 3,\n\n Bishop = 4,\n\n Queen = 5,\n\n King = 6,\n\n}\n\n\n\n//TODO - refac this - should probably be impl ChessPiece instead\n\nimpl PieceType {\n\n pub fn available_moves(\n\n &self,\n\n target_piece: &ChessPiece,\n\n current_position: Coordinate,\n","file_path":"src/board/cell/piecetype.rs","rank":67,"score":10.649832068352342},{"content":"use super::piecemove::*;\n\nuse crate::{\n\n board::cell::chesspiece::ChessPiece,\n\n player::{aiplayer::AIPlayer, humanplayer::HumanPlayer},\n\n};\n\n\n","file_path":"src/chessmove/action.rs","rank":68,"score":10.425060475931275},{"content":"use crate::board::{cell::chesspiece::*, coordinate::Coordinate};\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub struct PieceMove<'a> {\n\n pub chess_piece: &'a ChessPiece,\n\n pub from: Coordinate,\n\n pub to: Coordinate,\n\n}\n\n\n\nimpl<'a> PieceMove<'a> {\n\n pub fn new(chess_piece: &'a ChessPiece, from: Coordinate, to: Coordinate) -> Self {\n\n PieceMove {\n\n chess_piece,\n\n from,\n\n to,\n\n }\n\n }\n\n}\n","file_path":"src/chessmove/piecemove.rs","rank":69,"score":10.243568999109819},{"content":"pub mod ai;\n\npub mod board;\n\npub mod chessmove;\n\npub mod ext;\n\npub mod frontend;\n\npub mod game;\n\npub mod player;\n\npub mod state;\n\n\n\n#[macro_use]\n\nextern crate serde_derive;\n\nextern crate serde_json;\n\n\n\n\n\nextern crate clap;\n\n\n","file_path":"src/lib.rs","rank":70,"score":10.205749989520072},{"content":"\n\n Ok(board)\n\n }\n\n\n\n pub fn board_fen_section(&self) -> String {\n\n let mut fen = \"\".to_string();\n\n\n\n //construct the piece position portion\n\n for row in &self.squares {\n\n let mut num_empty_squares:i32 = 0;\n\n for cell in row {\n\n if let Some(piece) = cell.space {\n\n if num_empty_squares == 0 {\n\n fen.push_str(piece.fen_code());\n\n } else {\n\n fen.push_str(&num_empty_squares.to_string());\n\n fen.push_str(piece.fen_code());\n\n }\n\n num_empty_squares = 0;\n\n } else {\n","file_path":"src/board/chessboard.rs","rank":71,"score":9.834086639315622},{"content":" .sized_body(response_string.len(), Cursor::new(response_string))\n\n .ok()\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct ValidateResponse {\n\n pub is_valid: bool,\n\n}\n\n\n\nimpl<'r> Responder<'r, 'static> for ValidateResponse {\n\n fn respond_to(self, _: &'r Request<'_>) -> response::Result<'static> {\n\n let response_string = serde_json::to_string(&self).unwrap();\n\n Response::build()\n\n .header(ContentType::JSON)\n\n .sized_body(response_string.len(), Cursor::new(response_string))\n\n .ok()\n\n }\n\n}\n\n\n","file_path":"src/frontend/responses.rs","rank":72,"score":9.833227024550695},{"content":" }\n\n else {\n\n return Err(Box::from(format!(\"You tried to get a piece at a space that didnt have one - did you mean to do that? x:{},y:{}\", x, y)));\n\n }\n\n }\n\n }\n\n \n\n Err(Box::from(format!(\"couldnt find the given pairs of points on the board! Either the board is goofed - or your points are: x:{},y:{}\", x, y)))\n\n }\n\n\n\n pub fn possible_moves_human(&self, current_position: Coordinate, human_player: &HumanPlayer) -> Result<Vec<Coordinate>, Box<dyn Error>> {\n\n let target_piece = self.piece(current_position.x, current_position.y)?;\n\n\n\n if target_piece.color != human_player.color {\n\n return Err(Box::from(\"Thats not your piece!\"));\n\n }\n\n \n\n Ok(target_piece.piece_type.available_moves(target_piece, current_position, self))\n\n }\n\n\n","file_path":"src/board/chessboard.rs","rank":73,"score":9.65361195844196},{"content":" pub player: &'a AIPlayer,\n\n}\n\n\n\nimpl<'a> Action<'a> for HumanAction<'a> {\n\n fn get_piece_(&self) -> &ChessPiece {\n\n self.piece_move.chess_piece\n\n }\n\n\n\n fn get_x(&self) -> char {\n\n 'a'\n\n }\n\n\n\n fn get_y(&self) -> i32 {\n\n 1\n\n }\n\n}\n\n\n\nimpl<'a> Action<'a> for AIAction<'a> {\n\n fn get_piece_(&self) -> &ChessPiece {\n\n self.piece_move.chess_piece\n","file_path":"src/chessmove/action.rs","rank":74,"score":8.746696385289052},{"content":"\n\nuse crate::ext::stringext::ToCoord;\n\n\n\npub struct ChessGame {\n\n pub human_player: HumanPlayer,\n\n pub ai_player: AIPlayer,\n\n pub board: Board,\n\n // pub history: Vec<&'a (dyn Action<'a> + Sync)>,\n\n human_plays: bool,\n\n tick_speed: u64, //milli\n\n\n\n side_to_move: char,\n\n castling_ability: String,\n\n en_passant_target_square: String,\n\n halfmove_clock: u32,\n\n fullmove_counter: u32,\n\n}\n\n\n\nimpl ChessGame {\n\n pub fn new(\n","file_path":"src/game/chessgame.rs","rank":75,"score":8.245509025345472},{"content":" };\n\n\n\n println!(\"y:\");\n\n let y = match get_input::<i32>() {\n\n Ok(i) => i,\n\n Err(_) => {\n\n return Ok(false);\n\n }\n\n };\n\n\n\n let current_position = Coordinate::new(x, y);\n\n\n\n //this is syntax is really cool\n\n let coord_choices = match self\n\n .board\n\n .possible_moves_human(current_position, &self.human_player)\n\n {\n\n Ok(choices) => {\n\n if choices.is_empty() {\n\n println!(\"That piece can't go anywhere!\");\n","file_path":"src/game/chessgame.rs","rank":76,"score":8.180965539250286},{"content":"\n\nimpl Board {\n\n pub fn test_cell_at(&self, coordinate: Coordinate) -> Option<&Cell> {\n\n self.all_cells().iter().filter(|cell| cell.x == coordinate.x && cell.y == coordinate.y).map(|x| x.to_owned()).next()\n\n }\n\n\n\n //should really ONLY be used in an evaluation function\n\n pub fn all_cells(&self) -> Vec<&Cell> {\n\n self.squares.iter().flatten().collect()\n\n }\n\n\n\n fn all_cells_mut(&mut self) -> Vec<&mut Cell> {\n\n self.squares.iter_mut().flatten().collect()\n\n }\n\n\n\n pub fn print_to_screen(&self, configuration_name: String) {\n\n println!(\"---------------------------{}\", configuration_name);\n\n for row in &self.squares {\n\n if let Some(first_cell) = row.iter().next() {\n\n print!(\"{}|\", first_cell.y);\n","file_path":"src/board/chessboard.rs","rank":77,"score":8.034764968768261},{"content":" pub fn possible_moves(&self, current_position: Coordinate, color: Color) -> Result<Vec<Coordinate>, Box<dyn Error>> {\n\n let target_piece = self.piece(current_position.x, current_position.y)?;\n\n\n\n if target_piece.color != color {\n\n return Err(Box::from(\"Thats not your piece!\"));\n\n }\n\n \n\n Ok(target_piece.piece_type.available_moves(target_piece, current_position, self))\n\n }\n\n\n\n pub fn all_possible_moves(&self, color: Color) -> Result<Vec<PieceMove>, Box<dyn Error>> {\n\n let cells = self.cells_with_pieces_with_color(color);\n\n\n\n let mut possible_moves: Vec<PieceMove> = Vec::new();\n\n\n\n for cell in cells{\n\n let current_position = Coordinate::new(cell.x, cell.y);\n\n let piece_at_position = self.piece(current_position.x, current_position.y)?;\n\n\n\n let coord_choices = self.possible_moves(current_position, color)?;\n","file_path":"src/board/chessboard.rs","rank":78,"score":7.984947699536191},{"content":"use std::fmt;\n\n\n\n#[derive(PartialEq, Debug, Clone, Copy, Serialize, Deserialize)]\n\npub enum Color {\n\n White = 1,\n\n Black = 2,\n\n}\n\n\n\nimpl Color {\n\n pub fn color_abbr(&self) -> char {\n\n self.to_string().chars().next().unwrap()\n\n }\n\n}\n\n\n\nimpl fmt::Display for Color {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{:?}\", self)\n\n }\n\n}\n","file_path":"src/board/cell/color.rs","rank":79,"score":7.9745347242816536},{"content":" //1: get the reference to the piece we're going to movmute\n\n let mut target_piece: ChessPiece = ChessPiece {\n\n color: Color::Black,\n\n piece_type: PieceType::Bishop\n\n };\n\n for cell in self.all_cells(){\n\n if cell.x == from.x && cell.y == from.y {\n\n if let Some(piece_ref) = cell.space {\n\n target_piece = piece_ref; //should be moving the value i hope\n\n }\n\n }\n\n }\n\n\n\n //2: move the reference to the stop we're moving to \n\n for row in &mut self.squares {\n\n for cell in row {\n\n if cell.x == to.x && cell.y == to.y {\n\n //we can safely assume there is NO piece at this location\n\n //since the from x and y are given to us by the set of possible moves\n\n //calculated ahead of time\n","file_path":"src/board/chessboard.rs","rank":80,"score":7.718787899702798},{"content":" pub fn cells_with_pieces_with_color(&self, color: Color) -> Vec<&Cell> {\n\n let mut cells: Vec<&Cell> = Vec::new();\n\n for cell in self.all_cells() {\n\n if let Some(piece_ref) = &cell.space {\n\n if piece_ref.color == color {\n\n cells.push(cell);\n\n }\n\n }\n\n }\n\n cells\n\n }\n\n\n\n pub fn piece_specific(&self, color: Color, piece_type: PieceType) -> Option<&ChessPiece>{\n\n let pieces = self.pieces_of_color(color);\n\n\n\n pieces.into_iter().find(|x| x.piece_type == piece_type)\n\n }\n\n\n\n\n\n pub fn move_piece(&mut self, from: Coordinate, to: Coordinate){\n","file_path":"src/board/chessboard.rs","rank":81,"score":7.53303841819904},{"content":"use core::panic;\n\nuse std::cmp;\n\nuse std::error::Error;\n\nuse std::time::Instant;\n\n\n\nuse crate::{\n\n ai::minimax::evaluate::evaluate,\n\n board::{cell::color::Color, chessboard::Board},\n\n chessmove::piecemove::PieceMove,\n\n};\n\n\n","file_path":"src/ai/minimax/funcs.rs","rank":82,"score":7.47922191300392},{"content":" for cell in row {\n\n if cell.x == x && cell.y == y {\n\n cell.space = None;\n\n }\n\n }\n\n }\n\n }\n\n\n\n pub fn pieces_of_color(&self, color: Color) -> Vec<&ChessPiece> {\n\n let mut pieces: Vec<&ChessPiece> = Vec::new();\n\n for cell in self.all_cells() {\n\n if let Some(piece_ref) = &cell.space {\n\n if piece_ref.color == color {\n\n pieces.push(piece_ref);\n\n }\n\n }\n\n }\n\n pieces\n\n }\n\n\n","file_path":"src/board/chessboard.rs","rank":83,"score":7.183134935731411},{"content":"use crate::board::{\n\n cell::{chesspiece::ChessPiece, color::Color, piecetype::PieceType},\n\n chessboard::Board,\n\n};\n\n\n\n//NOTE: this evaluation function assumes that the WHITE is the MIN player and BLACK is the MAX player\n","file_path":"src/ai/minimax/evaluate.rs","rank":84,"score":7.158000554876337},{"content":"// ));\n\n// }\n\n\n\n// let min_action = good_actions.into_iter().min_by(|x, y| x.1.cmp(&y.1));\n\n\n\n// match min_action {\n\n// Some(action) => Ok(action),\n\n// None => Err(Box::from(\"Minimax was unable to find a min decision!\")),\n\n// }\n\n// }\n\n\n","file_path":"src/ai/minimax/funcs.rs","rank":85,"score":7.062425853329054},{"content":" (PieceType::Queen, Color::White) => \"\\u{2655}\",\n\n (PieceType::Queen, Color::Black) => \"\\u{265B}\",\n\n (PieceType::King, Color::White) => \"\\u{2654}\",\n\n (PieceType::King, Color::Black) => \"\\u{265A}\",\n\n }\n\n }\n\n\n\n pub fn fen_code(&self) -> &str {\n\n match (self.piece_type, self.color) {\n\n (PieceType::Pawn, Color::White) => \"P\",\n\n (PieceType::Pawn, Color::Black) => \"p\",\n\n (PieceType::Rook, Color::White) => \"R\",\n\n (PieceType::Rook, Color::Black) => \"r\",\n\n (PieceType::Knight, Color::White) => \"N\",\n\n (PieceType::Knight, Color::Black) => \"n\",\n\n (PieceType::Bishop, Color::White) => \"B\",\n\n (PieceType::Bishop, Color::Black) => \"b\",\n\n (PieceType::Queen, Color::White) => \"Q\",\n\n (PieceType::Queen, Color::Black) => \"q\",\n\n (PieceType::King, Color::White) => \"K\",\n\n (PieceType::King, Color::Black) => \"k\",\n\n }\n\n }\n\n}\n","file_path":"src/board/cell/chesspiece.rs","rank":86,"score":6.667950055459627},{"content":" board: &Board,\n\n ) -> Vec<Coordinate> {\n\n let valid_moves: Vec<Coordinate> = match *self {\n\n PieceType::Pawn => {\n\n //pawns can only move one or two spaces (depending on turn num)\n\n let possible_coordinates = match (target_piece.color, current_position.y) {\n\n (Color::White, 2) => vec![current_position.up_by(1), current_position.up_by(2)],\n\n (Color::Black, 2) => {\n\n vec![current_position.down_by(1), current_position.down_by(2)]\n\n }\n\n (Color::White, _) => vec![current_position.up_by(1)],\n\n (Color::Black, _) => vec![current_position.down_by(1)],\n\n };\n\n\n\n //only include the ones where the enemy is NOT in front of\n\n let mut possible_coordinates: Vec<Coordinate> = possible_coordinates\n\n .into_iter()\n\n .filter(|coord| !enemy_occupied(coord.to_owned(), target_piece.color, board))\n\n .map(|coord| coord.to_owned())\n\n .collect();\n","file_path":"src/board/cell/piecetype.rs","rank":87,"score":6.42836352616038},{"content":" color: Color::Black,\n\n };\n\n\n\n let mut game = ChessGame::new(\n\n human_player,\n\n ai_player,\n\n board,\n\n program_state.human_plays,\n\n program_state.tick_speed,\n\n );\n\n\n\n match program_state.viz_type {\n\n VizType::Term => {\n\n let winner = game.start_game()?;\n\n println!(\"Winner: {}\", &winner);\n\n Ok(())\n\n }\n\n VizType::Web => {\n\n if build_and_run_frontend(program_state).await.is_err() {\n\n panic!(\"Error while trying to start frontend!\");\n\n }\n\n Ok(())\n\n }\n\n }\n\n}\n","file_path":"src/main.rs","rank":88,"score":6.195927025161589},{"content":"use crate::board::coordinate::Coordinate;\n\n\n","file_path":"src/ext/stringext.rs","rank":89,"score":6.124503311744934},{"content":"\n\n let mut possible_moves_for_piece: Vec<PieceMove> = \n\n coord_choices.iter().map(|coord | PieceMove::new(piece_at_position, current_position, *coord)).collect();\n\n\n\n \n\n possible_moves.append(&mut possible_moves_for_piece);\n\n }\n\n\n\n Ok(possible_moves)\n\n }\n\n\n\n pub fn apply_action(&self, action: &PieceMove) -> Board {\n\n //by jove i hope this doesnt have unexpected side affects\n\n let mut new_board = self.clone();\n\n new_board.move_piece(action.from, action.to);\n\n new_board\n\n }\n\n\n\n fn space_to_empty(&mut self, x: char, y: i32) {\n\n for row in self.squares.iter_mut() {\n","file_path":"src/board/chessboard.rs","rank":90,"score":5.803609227907018},{"content":"\n\n //Pawns can move diagonally if there's an enemy there\n\n let possible_enemy_positions: Vec<Coordinate> =\n\n if target_piece.color == color::Color::White {\n\n vec![\n\n current_position.diagonal_up_right_by(1),\n\n current_position.diagonal_up_left_by(1),\n\n ]\n\n } else {\n\n vec![\n\n current_position.diagonal_down_left_by(1),\n\n current_position.diagonal_down_right_by(1),\n\n ]\n\n }\n\n .into_iter()\n\n .filter(|coord| coord.is_valid(board)) //filter out the ones that arent valid (i.e, diagonal left might be off the map)\n\n .collect();\n\n\n\n for coord in possible_enemy_positions {\n\n if enemy_occupied(coord, target_piece.color, board) {\n","file_path":"src/board/cell/piecetype.rs","rank":91,"score":5.690497888539641},{"content":" num_empty_squares += 1;\n\n }\n\n }\n\n if num_empty_squares != 0 {\n\n fen.push_str(&num_empty_squares.to_string());\n\n }\n\n fen.push('/');\n\n }\n\n\n\n fen[0..fen.len()-1].to_string()\n\n }\n\n}\n\n\n","file_path":"src/board/chessboard.rs","rank":92,"score":5.482725869785406},{"content":" let mut board = Board::load_from_file(\"empty_board\")?;\n\n let sections: Vec<Vec<char>> = fen.split('/').into_iter().map(|s| s.to_string().chars().collect()).collect();\n\n\n\n let mut cells = board.all_cells_mut();\n\n let mut cell_iter = cells.iter_mut();\n\n\n\n for c_vec in sections {\n\n for c in c_vec {\n\n if c.is_numeric() {\n\n let num_to_skip = c.to_digit(10).expect(\"Unable to convert the num to skip to i32\");\n\n for _ in 0..num_to_skip {\n\n cell_iter.next();\n\n }\n\n }\n\n else {\n\n let cell = cell_iter.next().expect(\"The iterator really shouldnt be empty :(\");\n\n cell.space.get_or_insert(piece_from_fen_char(c)?);\n\n }\n\n }\n\n }\n","file_path":"src/board/chessboard.rs","rank":93,"score":5.463313097040759},{"content":"\n\n if coord_choices.is_empty() {\n\n //that piece can't go anywhere - try to get another one\n\n continue;\n\n }\n\n\n\n let to = *coord_choices\n\n .choose(&mut rand::thread_rng())\n\n .ok_or(\"There was an error while trying to get a choice randomly\")?;\n\n\n\n break (from, to);\n\n };\n\n\n\n (from, to)\n\n };\n\n\n\n self.board.move_piece(from, to);\n\n\n\n Ok(true)\n\n }\n","file_path":"src/game/chessgame.rs","rank":94,"score":5.366678414631508},{"content":" possible_coordinates.push(coord)\n\n };\n\n }\n\n\n\n //only return the coordinates that are valid spaces (on the board)\n\n possible_coordinates\n\n .into_iter()\n\n .filter(|coord| coord.is_valid(board))\n\n .collect()\n\n }\n\n PieceType::Rook => {\n\n /*Algorithm:\n\n For each direction a rook can move in:\n\n iterate up starting at the target piece in a diagonal line, if we hit an enemy, add that position, but dont go any further. If we hit a friendly piece, stop - dont add that position\n\n */\n\n let mut possible_coordinates: Vec<Coordinate> = Vec::new();\n\n\n\n let possible_directions: Vec<fn(Coordinate, i32) -> Coordinate> =\n\n vec![up_by, down_by, left_by, right_by];\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":95,"score":4.598559194059273},{"content":"\n\n if !possible_position.is_valid(board) {\n\n continue;\n\n };\n\n\n\n if friendly_occupied(possible_position, target_piece.color, board) {\n\n break;\n\n } else if enemy_occupied(possible_position, target_piece.color, board) {\n\n possible_coordinates.push(possible_position);\n\n break;\n\n } else {\n\n possible_coordinates.push(possible_position);\n\n }\n\n }\n\n }\n\n\n\n possible_coordinates\n\n }\n\n };\n\n\n","file_path":"src/board/cell/piecetype.rs","rank":96,"score":4.385571434594773},{"content":" ];\n\n\n\n for direction_func in possible_directions {\n\n for position in (1..9).into_iter() {\n\n let possible_position = direction_func(current_position, position);\n\n\n\n if !possible_position.is_valid(board) {\n\n continue;\n\n };\n\n\n\n if friendly_occupied(possible_position, target_piece.color, board) {\n\n break;\n\n } else if enemy_occupied(possible_position, target_piece.color, board) {\n\n possible_coordinates.push(possible_position);\n\n break;\n\n } else {\n\n possible_coordinates.push(possible_position);\n\n }\n\n }\n\n }\n","file_path":"src/board/cell/piecetype.rs","rank":97,"score":3.9311333629168694},{"content":" for direction_func in possible_directions {\n\n for position in (1..9).into_iter() {\n\n let possible_position = direction_func(current_position, position);\n\n\n\n if !possible_position.is_valid(board) {\n\n continue;\n\n };\n\n\n\n if friendly_occupied(possible_position, target_piece.color, board) {\n\n break;\n\n } else if enemy_occupied(possible_position, target_piece.color, board) {\n\n possible_coordinates.push(possible_position);\n\n break;\n\n } else {\n\n possible_coordinates.push(possible_position);\n\n }\n\n }\n\n }\n\n\n\n possible_coordinates\n","file_path":"src/board/cell/piecetype.rs","rank":98,"score":3.858683871468327},{"content":" diagonal_down_right_by,\n\n diagonal_down_left_by,\n\n ];\n\n\n\n for direction_func in possible_directions {\n\n for position in (1..9).into_iter() {\n\n let possible_position = direction_func(current_position, position);\n\n\n\n if !possible_position.is_valid(board) {\n\n continue;\n\n };\n\n\n\n if friendly_occupied(possible_position, target_piece.color, board) {\n\n break;\n\n } else if enemy_occupied(possible_position, target_piece.color, board) {\n\n possible_coordinates.push(possible_position);\n\n break;\n\n } else {\n\n possible_coordinates.push(possible_position);\n\n }\n","file_path":"src/board/cell/piecetype.rs","rank":99,"score":3.788918682954322}],"string":"[\n {\n \"content\": \"pub fn get_args() -> Result<ProgramState, Box<dyn std::error::Error>> {\\n\\n let matches = App::new(\\\"Chrust\\\")\\n\\n .version(\\\"0.2.0\\\")\\n\\n .author(\\\"John YB. <jyenterbriars@gmail.com>\\\")\\n\\n .about(\\\"Simple Chess Engine\\\")\\n\\n .arg(\\n\\n Arg::new(\\\"viz\\\")\\n\\n .short('z')\\n\\n .long(\\\"visualization_mode\\\")\\n\\n .value_name(\\\"TERM|WEB\\\")\\n\\n .about(\\\"Sets the method of visualization for the app\\\")\\n\\n .takes_value(true)\\n\\n .default_value(\\\"WEB\\\")\\n\\n )\\n\\n .arg(\\n\\n Arg::new(\\\"hplay\\\")\\n\\n .short('h')\\n\\n .long(\\\"human_plays\\\")\\n\\n .value_name(\\\"true|false\\\")\\n\\n .about(\\\"Sets whether or not the human player will play the game. If false, the human player makes random decisions\\\")\\n\",\n \"file_path\": \"src/state/programstate.rs\",\n \"rank\": 2,\n \"score\": 150730.49792743544\n },\n {\n \"content\": \"pub fn is_valid(\\n\\n current_fen: String,\\n\\n current_location: String,\\n\\n possible_location: String,\\n\\n) -> Result<bool, Box<dyn std::error::Error>> {\\n\\n let board_section = current_fen\\n\\n .split(' ')\\n\\n .next()\\n\\n .expect(\\\"Fen is improperly formatted!\\\");\\n\\n\\n\\n let board =\\n\\n Board::load_from_fen(board_section.to_string()).expect(\\\"Unable to load board from \\\");\\n\\n\\n\\n let current_position = current_location.to_coord();\\n\\n\\n\\n let possible_moves = board.possible_moves(current_position, Color::White)?;\\n\\n\\n\\n let possible_position = possible_location.to_coord();\\n\\n\\n\\n let valid_move = possible_moves\\n\\n .iter()\\n\\n .any(|coord| coord.x == possible_position.x && coord.y == possible_position.y);\\n\\n\\n\\n Ok(valid_move)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 3,\n \"score\": 136002.6296219358\n },\n {\n \"content\": \"pub fn process_fen(fen: String, num_plies: u32) -> Result<String, Box<dyn Error>> {\\n\\n let board_section = fen.split(' ').next().expect(\\\"Fen is improperly formatted!\\\");\\n\\n\\n\\n let board =\\n\\n Board::load_from_fen(board_section.to_string()).expect(\\\"Unable to load board from \\\");\\n\\n\\n\\n let ai_move = max_decision(&board, Color::Black, num_plies)?;\\n\\n\\n\\n let new_board = board.apply_action(&ai_move);\\n\\n\\n\\n new_board.print_to_screen(\\\"ai move\\\".to_string());\\n\\n\\n\\n Ok(new_board.board_fen_section())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 6,\n \"score\": 131585.10664124187\n },\n {\n \"content\": \"//this is a mess and i dont fully understand it - i just did what the compiler told me to\\n\\nfn get_input<I: std::str::FromStr>() -> Result<I, Box<dyn Error>>\\n\\nwhere\\n\\n <I as FromStr>::Err: 'static + Error,\\n\\n{\\n\\n let mut line = String::new();\\n\\n let _ = std::io::stdin().read_line(&mut line).unwrap();\\n\\n let y: I = line.trim().parse()?;\\n\\n Ok(y)\\n\\n}\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 8,\n \"score\": 117197.66739345377\n },\n {\n \"content\": \"pub fn valid_moves(\\n\\n fen: String,\\n\\n location: String,\\n\\n) -> Result<Vec<Coordinate>, Box<dyn std::error::Error>> {\\n\\n let board_section = fen.split(' ').next().expect(\\\"Fen is improperly formatted!\\\");\\n\\n\\n\\n let board =\\n\\n Board::load_from_fen(board_section.to_string()).expect(\\\"Unable to load board from \\\");\\n\\n\\n\\n if location.as_str().len() != 2 {\\n\\n return Err(Box::from(\\\"Invalid format for location string\\\"));\\n\\n }\\n\\n\\n\\n let current_position = location.to_coord();\\n\\n\\n\\n if board.piece(current_position.x, current_position.y)?.color == Color::Black {\\n\\n return Ok(vec![]);\\n\\n }\\n\\n\\n\\n let coords = board\\n\\n .possible_moves(current_position, Color::White)\\n\\n .expect(\\\"Unable to find the valid moves!\\\");\\n\\n\\n\\n Ok(coords)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 9,\n \"score\": 111855.01360393225\n },\n {\n \"content\": \"pub fn max_decision(\\n\\n board: &Board,\\n\\n color: Color,\\n\\n max_depth: u32,\\n\\n) -> Result<PieceMove, Box<dyn std::error::Error>> {\\n\\n let start = Instant::now();\\n\\n let (max_decision, _) = minimax_decision_max(board, color, max_depth, -1000000, 1000000)?;\\n\\n let duration = start.elapsed();\\n\\n println!(\\\"Time to determine move: {:?}\\\", duration);\\n\\n Ok(max_decision)\\n\\n}\\n\",\n \"file_path\": \"src/ai/minimax/funcs.rs\",\n \"rank\": 10,\n \"score\": 84812.19070075238\n },\n {\n \"content\": \"fn piece_from_fen_char(c: char) -> Result<ChessPiece, Box<dyn std::error::Error>> {\\n\\n match c {\\n\\n 'p' => Ok(ChessPiece{piece_type: PieceType::Pawn, color: Color::Black}),\\n\\n 'r' => Ok(ChessPiece{piece_type: PieceType::Rook, color: Color::Black}),\\n\\n 'n' => Ok(ChessPiece{piece_type: PieceType::Knight, color: Color::Black}),\\n\\n 'b' => Ok(ChessPiece{piece_type: PieceType::Bishop, color: Color::Black}),\\n\\n 'k' => Ok(ChessPiece{piece_type: PieceType::King, color: Color::Black}),\\n\\n 'q' => Ok(ChessPiece{piece_type: PieceType::Queen, color: Color::Black}),\\n\\n 'P' => Ok(ChessPiece{piece_type: PieceType::Pawn, color: Color::White}),\\n\\n 'R' => Ok(ChessPiece{piece_type: PieceType::Rook, color: Color::White}),\\n\\n 'N' => Ok(ChessPiece{piece_type: PieceType::Knight, color: Color::White}),\\n\\n 'B' => Ok(ChessPiece{piece_type: PieceType::Bishop, color: Color::White}),\\n\\n 'K' => Ok(ChessPiece{piece_type: PieceType::King, color: Color::White}),\\n\\n 'Q' => Ok(ChessPiece{piece_type: PieceType::Queen, color: Color::White}),\\n\\n _ => Err(Box::from(\\\"Invalid char: {}\\\")),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 11,\n \"score\": 81160.4944864261\n },\n {\n \"content\": \"//NOTE: this evaluation function assumes that the WHITE is the MIN player and BLACK is the MAX player\\n\\npub fn evaluate(board: &Board) -> i32 {\\n\\n let cells = board.all_cells();\\n\\n cells\\n\\n .iter()\\n\\n .map(|c| match c.space {\\n\\n Some(p) => {\\n\\n let abs_value = piece_value(p.piece_type) + piece_position_score(&p, c.x, c.y);\\n\\n if p.color == Color::White {\\n\\n -abs_value\\n\\n } else {\\n\\n abs_value\\n\\n }\\n\\n }\\n\\n None => 0,\\n\\n })\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 12,\n \"score\": 71129.64789532292\n },\n {\n \"content\": \"fn piece_value(piece_type: PieceType) -> i32 {\\n\\n match piece_type {\\n\\n PieceType::Pawn => 10,\\n\\n PieceType::Rook => 50,\\n\\n PieceType::Knight => 30,\\n\\n PieceType::Bishop => 30,\\n\\n PieceType::Queen => 90,\\n\\n PieceType::King => 900,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 13,\n \"score\": 67703.37216486958\n },\n {\n \"content\": \"fn piece_eval_vector(piece_type: PieceType, color: Color) -> Vec<Vec<f64>> {\\n\\n match (piece_type, color) {\\n\\n (PieceType::Pawn, Color::White) => arr_to_vec(PAWN_EVAL_WHITE),\\n\\n (PieceType::Pawn, Color::Black) => reverse(arr_to_vec(PAWN_EVAL_WHITE)),\\n\\n (PieceType::Rook, Color::White) => arr_to_vec(ROOK_EVAL_WHITE),\\n\\n (PieceType::Rook, Color::Black) => reverse(arr_to_vec(ROOK_EVAL_WHITE)),\\n\\n (PieceType::Knight, Color::White) => arr_to_vec(KNIGHT_EVAL_WHITE),\\n\\n (PieceType::Knight, Color::Black) => reverse(arr_to_vec(KNIGHT_EVAL_WHITE)),\\n\\n (PieceType::Bishop, Color::White) => arr_to_vec(BISHOP_EVAL_WHITE),\\n\\n (PieceType::Bishop, Color::Black) => reverse(arr_to_vec(BISHOP_EVAL_WHITE)),\\n\\n (PieceType::Queen, Color::White) => arr_to_vec(QUEEN_EVAL_WHITE),\\n\\n (PieceType::Queen, Color::Black) => reverse(arr_to_vec(QUEEN_EVAL_WHITE)),\\n\\n (PieceType::King, Color::White) => arr_to_vec(KING_EVAL_WHITE),\\n\\n (PieceType::King, Color::Black) => reverse(arr_to_vec(KING_EVAL_WHITE)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 14,\n \"score\": 57729.61096581114\n },\n {\n \"content\": \"fn piece_position_score(p: &ChessPiece, x: char, y: i32) -> i32 {\\n\\n let vector = piece_eval_vector(p.piece_type, p.color);\\n\\n vector[char_to_int(x) as usize][y as usize - 1] as i32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 15,\n \"score\": 57645.248403006175\n },\n {\n \"content\": \"use clap::{App, Arg};\\n\\n\\n\\nuse super::viztype::VizType;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\\n\\npub struct ProgramState {\\n\\n pub viz_type: VizType,\\n\\n pub human_plays: bool,\\n\\n pub tick_speed: u64,\\n\\n pub num_plies: u32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/state/programstate.rs\",\n \"rank\": 16,\n \"score\": 57300.65410775105\n },\n {\n \"content\": \" )\\n\\n .get_matches();\\n\\n\\n\\n //this is horrible and i'm sorry\\n\\n let viz_type = matches.value_of(\\\"viz\\\").ok_or(\\\"unable to parse arguments :(\\\")?;\\n\\n let human_plays = matches.value_of(\\\"hplay\\\").ok_or(\\\"unable to parse arguments :(\\\")?;\\n\\n let tick_speed = matches.value_of(\\\"tick\\\").ok_or(\\\"unable to parse arguments :(\\\")?;\\n\\n let num_plies = matches.value_of(\\\"plies\\\").ok_or(\\\"unable to parse arguments :(\\\")?;\\n\\n\\n\\n let program_state = ProgramState {\\n\\n viz_type: match viz_type {\\n\\n \\\"TERM\\\" => VizType::Term,\\n\\n \\\"WEB\\\" => VizType::Web,\\n\\n _ => {\\n\\n return Err(Box::from(\\n\\n \\\"You must pass in a vaid argument for the -v flag!\\\",\\n\\n ));\\n\\n }\\n\\n },\\n\\n human_plays: match human_plays {\\n\",\n \"file_path\": \"src/state/programstate.rs\",\n \"rank\": 17,\n \"score\": 57299.066427416896\n },\n {\n \"content\": \" \\\"true\\\" => true,\\n\\n \\\"false\\\" => false,\\n\\n _ => {\\n\\n return Err(Box::from(\\n\\n \\\"You must pass in a vaid argument for the -h flag!\\\",\\n\\n ));\\n\\n }\\n\\n },\\n\\n tick_speed: tick_speed.parse()?,\\n\\n num_plies: num_plies.parse()?,\\n\\n };\\n\\n\\n\\n Ok(program_state)\\n\\n}\\n\",\n \"file_path\": \"src/state/programstate.rs\",\n \"rank\": 18,\n \"score\": 57295.4573549779\n },\n {\n \"content\": \" .takes_value(true)\\n\\n .default_value(\\\"true\\\")\\n\\n )\\n\\n .arg(\\n\\n Arg::new(\\\"tick\\\")\\n\\n .short('t')\\n\\n .long(\\\"tick_speed\\\")\\n\\n .value_name(\\\"positive integer\\\")\\n\\n .about(\\\"Sets the interval between moves. (Milliseconds)\\\")\\n\\n .takes_value(true)\\n\\n .default_value(\\\"1000\\\")\\n\\n )\\n\\n .arg(\\n\\n Arg::new(\\\"plies\\\")\\n\\n .short('p')\\n\\n .long(\\\"num_plies\\\")\\n\\n .value_name(\\\"positive integer\\\")\\n\\n .about(\\\"Number of turns into the future the AI will look ahead.\\\")\\n\\n .takes_value(true)\\n\\n .default_value(\\\"3\\\")\\n\",\n \"file_path\": \"src/state/programstate.rs\",\n \"rank\": 19,\n \"score\": 57292.58143925297\n },\n {\n \"content\": \"pub trait ToCoord {\\n\\n fn to_coord(&self) -> Coordinate;\\n\\n}\\n\\n\\n\\nimpl ToCoord for std::string::String {\\n\\n fn to_coord(&self) -> Coordinate {\\n\\n let mut chars = self.chars();\\n\\n let x: char = chars.next().unwrap();\\n\\n let y: u32 = chars.next().unwrap().to_digit(10).unwrap();\\n\\n Coordinate { x, y: y as i32 }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/ext/stringext.rs\",\n \"rank\": 20,\n \"score\": 46156.49401683462\n },\n {\n \"content\": \"fn enemy_occupied(coordinate: Coordinate, current_piece_color: Color, board: &Board) -> bool {\\n\\n let cell = board.test_cell_at(coordinate);\\n\\n\\n\\n match cell {\\n\\n Some(c) => match c.space {\\n\\n Some(piece) => piece.color != current_piece_color,\\n\\n None => false,\\n\\n },\\n\\n None => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 21,\n \"score\": 45541.314867411216\n },\n {\n \"content\": \"fn friendly_occupied(coordinate: Coordinate, current_piece_color: Color, board: &Board) -> bool {\\n\\n let cell = board.test_cell_at(coordinate);\\n\\n\\n\\n match cell {\\n\\n Some(c) => match c.space {\\n\\n Some(piece) => piece.color == current_piece_color,\\n\\n None => false,\\n\\n },\\n\\n None => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 22,\n \"score\": 45541.314867411216\n },\n {\n \"content\": \"pub trait ChessPlayer {\\n\\n fn name(&self) -> &str;\\n\\n fn color_abbr(&self) -> char;\\n\\n}\\n\",\n \"file_path\": \"src/player/chessplayer.rs\",\n \"rank\": 23,\n \"score\": 45034.99206521352\n },\n {\n \"content\": \"pub trait Action<'a> {\\n\\n fn get_piece_(&self) -> &ChessPiece;\\n\\n fn get_x(&self) -> char;\\n\\n fn get_y(&self) -> i32;\\n\\n // fn get_player(&self) -> &'a dyn ChessPlayer;\\n\\n}\\n\\n\\n\\npub struct HumanAction<'a> {\\n\\n pub piece_move: PieceMove<'a>,\\n\\n pub player: &'a HumanPlayer,\\n\\n}\\n\\n\\n\\nimpl<'a> HumanAction<'a> {\\n\\n // pub fn new(piece_move: PieceMove<'a>, player: &'a HumanPlayer) -> Self {\\n\\n // HumanAction{piece_move, player}\\n\\n // }\\n\\n}\\n\\n\\n\\npub struct AIAction<'a> {\\n\\n pub piece_move: PieceMove<'a>,\\n\",\n \"file_path\": \"src/chessmove/action.rs\",\n \"rank\": 24,\n \"score\": 43984.49330083186\n },\n {\n \"content\": \"fn minimax_decision_max(\\n\\n board: &Board,\\n\\n color: Color,\\n\\n max_depth: u32,\\n\\n alpha: i32,\\n\\n beta: i32,\\n\\n) -> Result<(PieceMove, i32), Box<dyn Error>> {\\n\\n let mut good_actions = Vec::new();\\n\\n\\n\\n for action in board.all_possible_moves(color)? {\\n\\n good_actions.push((\\n\\n action,\\n\\n min_value(&board.apply_action(&action), max_depth, alpha, beta),\\n\\n ));\\n\\n }\\n\\n\\n\\n let max_action = good_actions.into_iter().max_by(|x, y| x.1.cmp(&y.1));\\n\\n\\n\\n match max_action {\\n\\n Some(action) => Ok(action),\\n\\n None => Err(Box::from(\\\"Minimax was unable to find a max decision!\\\")),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/funcs.rs\",\n \"rank\": 25,\n \"score\": 43254.350902784085\n },\n {\n \"content\": \" getCurrentSettings() {\\n\\n var url = `${this.apiUrl}/api/settings`;\\n\\n return fetch(url,\\n\\n {\\n\\n method: 'GET',\\n\\n mode: 'cors',\\n\\n cache: 'no-cache',\\n\\n credentials: 'same-origin',\\n\\n headers: {\\n\\n 'Content-Type': 'application/json'\\n\\n }\\n\\n }\\n\\n\\n\\n ).then((response) => { return response.text() }\\n\\n ).then((text) => {\\n\\n var foo = JSON.parse(text);\\n\\n return foo.program_state;\\n\\n })\\n\\n .catch((err) => {\\n\\n return false;\\n\\n });\\n\",\n \"file_path\": \"static/js/chrust.js\",\n \"rank\": 26,\n \"score\": 41217.542644447\n },\n {\n \"content\": \"fn char_to_int(x: char) -> i32 {\\n\\n match x {\\n\\n 'a' => 0,\\n\\n 'b' => 1,\\n\\n 'c' => 2,\\n\\n 'd' => 3,\\n\\n 'e' => 4,\\n\\n 'f' => 5,\\n\\n 'g' => 6,\\n\\n 'h' => 7,\\n\\n _ => panic!(\\\"Coordinate not well structured!\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 27,\n \"score\": 36423.53908641075\n },\n {\n \"content\": \"fn up_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.up_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 28,\n \"score\": 33239.863135474465\n },\n {\n \"content\": \"fn down_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.down_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 29,\n \"score\": 33239.863135474465\n },\n {\n \"content\": \"fn left_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.left_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 30,\n \"score\": 32459.57677247803\n },\n {\n \"content\": \"fn right_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.right_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 31,\n \"score\": 32459.57677247803\n },\n {\n \"content\": \"fn diagonal_up_left_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.diagonal_up_left_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 32,\n \"score\": 31734.72436616005\n },\n {\n \"content\": \"fn diagonal_down_right_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.diagonal_down_right_by(ammount)\\n\\n}\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 33,\n \"score\": 31734.72436616005\n },\n {\n \"content\": \"fn diagonal_down_left_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.diagonal_down_left_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 34,\n \"score\": 31734.72436616005\n },\n {\n \"content\": \"fn diagonal_up_right_by(coordinate: Coordinate, ammount: i32) -> Coordinate {\\n\\n coordinate.diagonal_up_right_by(ammount)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 35,\n \"score\": 31734.72436616005\n },\n {\n \"content\": \"fn arr_to_vec(arr: [[f64; 8]; 8]) -> Vec<Vec<f64>> {\\n\\n arr.to_vec().iter().map(|row| row.to_vec()).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 36,\n \"score\": 30048.471622512483\n },\n {\n \"content\": \"fn reverse(vec: Vec<Vec<f64>>) -> Vec<Vec<f64>> {\\n\\n vec.into_iter().rev().collect::<Vec<Vec<f64>>>()\\n\\n}\\n\\n\\n\\nstatic PAWN_EVAL_WHITE: [[f64; 8]; 8] = [\\n\\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\\n\\n [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0],\\n\\n [1.0, 1.0, 2.0, 3.0, 3.0, 2.0, 1.0, 1.0],\\n\\n [0.5, 0.5, 1.0, 2.5, 2.5, 1.0, 0.5, 0.5],\\n\\n [0.0, 0.0, 0.0, 2.0, 2.0, 0.0, 0.0, 0.0],\\n\\n [0.5, -0.5, -1.0, 0.0, 0.0, -1.0, -0.5, 0.5],\\n\\n [0.5, 1.0, 1.0, -2.0, -2.0, 1.0, 1.0, 0.5],\\n\\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\\n\\n];\\n\\n\\n\\nstatic KNIGHT_EVAL_WHITE: [[f64; 8]; 8] = [\\n\\n [-5.0, -4.0, -3.0, -3.0, -3.0, -3.0, -4.0, -5.0],\\n\\n [-4.0, -2.0, 0.0, 0.0, 0.0, 0.0, -2.0, -4.0],\\n\\n [-3.0, 0.0, 1.0, 1.5, 1.5, 1.0, 0.0, -3.0],\\n\\n [-3.0, 0.5, 1.5, 2.0, 2.0, 1.5, 0.5, -3.0],\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 37,\n \"score\": 29373.348511649725\n },\n {\n \"content\": \"pub mod programstate;\\n\\npub mod viztype;\\n\",\n \"file_path\": \"src/state/mod.rs\",\n \"rank\": 38,\n \"score\": 28589.922838629565\n },\n {\n \"content\": \"use core::fmt;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Copy, Serialize, Deserialize)]\\n\\npub enum VizType {\\n\\n Term,\\n\\n Web,\\n\\n}\\n\\n\\n\\nimpl fmt::Display for VizType {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{:?}\\\", self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/state/viztype.rs\",\n \"rank\": 39,\n \"score\": 28589.59300297814\n },\n {\n \"content\": \"fn min_value(board: &Board, depth: u32, alpha: i32, mut beta: i32) -> i32 {\\n\\n if depth == 0 {\\n\\n return evaluate(board);\\n\\n }\\n\\n\\n\\n let mut best_value = 1000000;\\n\\n\\n\\n let moves = match board.all_possible_moves(Color::White) {\\n\\n Ok(mvs) => mvs,\\n\\n Err(e) => panic!(\\n\\n \\\"Unable to get the possible moves from current board state: {:?}\\\",\\n\\n e\\n\\n ),\\n\\n };\\n\\n\\n\\n for action in moves {\\n\\n best_value = cmp::min(\\n\\n best_value,\\n\\n max_value(&board.apply_action(&action), depth - 1, alpha, beta),\\n\\n );\\n\",\n \"file_path\": \"src/ai/minimax/funcs.rs\",\n \"rank\": 40,\n \"score\": 25281.958330568108\n },\n {\n \"content\": \"fn max_value(board: &Board, depth: u32, mut alpha: i32, beta: i32) -> i32 {\\n\\n if depth == 0 {\\n\\n return evaluate(board);\\n\\n }\\n\\n\\n\\n let mut best_value = -1000000;\\n\\n\\n\\n let moves = match board.all_possible_moves(Color::Black) {\\n\\n Ok(mvs) => mvs,\\n\\n Err(e) => panic!(\\n\\n \\\"Unable to get the possible moves from current board state: {:?}\\\",\\n\\n e\\n\\n ),\\n\\n };\\n\\n\\n\\n for action in moves {\\n\\n best_value = cmp::max(\\n\\n best_value,\\n\\n min_value(&board.apply_action(&action), depth - 1, alpha, beta),\\n\\n );\\n\\n alpha = cmp::max(alpha, best_value);\\n\\n if beta <= alpha {\\n\\n return best_value;\\n\\n }\\n\\n }\\n\\n\\n\\n best_value\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/funcs.rs\",\n \"rank\": 41,\n \"score\": 25281.958330568108\n },\n {\n \"content\": \"const refreshSettings = async () => {\\n\\n var result = await chrustAPI.getCurrentSettings();\\n\\n for(key in result){\\n\\n document.getElementById(key).textContent = result[key];\\n\\n }\\n\",\n \"file_path\": \"static/js/chrust.js\",\n \"rank\": 42,\n \"score\": 23100.229276237456\n },\n {\n \"content\": \"var getMoveAPI = () => {\\n\\n chrustAPI.sendFen();\\n\",\n \"file_path\": \"static/js/chrust.js\",\n \"rank\": 43,\n \"score\": 22152.783213282197\n },\n {\n \"content\": \" isValid(currentLocation, possibleLocation, resolve) {\\n\\n if (!isValidLocationString(currentLocation) || !isValidLocationString(possibleLocation)) return;\\n\\n var fen = this.chessBoard.fen();\\n\\n var url = `${this.apiUrl}/api/validate/${encodeURIComponent(fen)}/${currentLocation}/${possibleLocation}`;\\n\\n this.currenlyInWebRequest = true;\\n\\n var request = new XMLHttpRequest();\\n\\n request.open('GET', url, false);\\n\\n request.send(null);\\n\\n this.currenlyInWebRequest = false;\\n\\n\\n\\n if (request.status === 200) {\\n\\n var foo = JSON.parse(request.responseText);\\n\\n return foo.is_valid;\\n\\n }\\n\",\n \"file_path\": \"static/js/chrust.js\",\n \"rank\": 44,\n \"score\": 22152.783213282197\n },\n {\n \"content\": \" validMoves(location) {\\n\\n if (!isValidLocationString(location)) return;\\n\\n var fen = this.chessBoard.fen();\\n\\n var url = `${this.apiUrl}/api/possible/${encodeURIComponent(fen)}/${location}`;\\n\\n return fetch(url,\\n\\n {\\n\\n method: 'GET',\\n\\n mode: 'cors',\\n\\n cache: 'no-cache',\\n\\n credentials: 'same-origin',\\n\\n headers: {\\n\\n 'Content-Type': 'application/json'\\n\\n }\\n\\n }\\n\\n\\n\\n ).then((response) => { return response.text() }\\n\\n ).then((text) => {\\n\\n var foo = JSON.parse(text);\\n\\n return foo.options;\\n\\n })\\n\\n .catch((err) => {\\n\\n return false;\\n\\n });\\n\",\n \"file_path\": \"static/js/chrust.js\",\n \"rank\": 45,\n \"score\": 21340.20203331797\n },\n {\n \"content\": \"use std::io::Cursor;\\n\\n\\n\\nuse crate::board::coordinate::Coordinate;\\n\\nuse crate::state::programstate::ProgramState;\\n\\nuse rocket::http::ContentType;\\n\\nuse rocket::request::Request;\\n\\nuse rocket::response;\\n\\nuse rocket::response::Responder;\\n\\nuse rocket::response::Response;\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct MoveOptionsResponse {\\n\\n pub options: Vec<Coordinate>,\\n\\n}\\n\\n\\n\\nimpl<'r> Responder<'r, 'static> for MoveOptionsResponse {\\n\\n fn respond_to(self, _: &'r Request<'_>) -> response::Result<'static> {\\n\\n let response_string = serde_json::to_string(&self).unwrap();\\n\\n Response::build()\\n\\n .header(ContentType::JSON)\\n\",\n \"file_path\": \"src/frontend/responses.rs\",\n \"rank\": 49,\n \"score\": 19.74850151277398\n },\n {\n \"content\": \"\\n\\n match cell.space {\\n\\n Some(_) => {\\n\\n //TODO - handle the piece being captured\\n\\n cell.space = Option::from(target_piece);\\n\\n }\\n\\n None => {\\n\\n cell.space = Option::from(target_piece);\\n\\n }\\n\\n };\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n //3: set the current cell to nothing\\n\\n self.space_to_empty(from.x, from.y);\\n\\n }\\n\\n\\n\\n pub fn load_from_file(board_name: &str) -> Result<Board, Box<dyn std::error::Error>> {\\n\\n let board_string = match board_name {\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 50,\n \"score\": 18.214025931092785\n },\n {\n \"content\": \"use super::color::Color;\\n\\nuse super::piecetype::PieceType;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\\n\\npub struct ChessPiece {\\n\\n pub piece_type: PieceType,\\n\\n pub color: Color,\\n\\n}\\n\\n\\n\\nimpl ChessPiece {\\n\\n pub fn str(&self) -> &str {\\n\\n match (self.piece_type, self.color) {\\n\\n (PieceType::Pawn, Color::White) => \\\"\\\\u{2659}\\\",\\n\\n (PieceType::Pawn, Color::Black) => \\\"\\\\u{265F}\\\",\\n\\n (PieceType::Rook, Color::White) => \\\"\\\\u{2656}\\\",\\n\\n (PieceType::Rook, Color::Black) => \\\"\\\\u{265C}\\\",\\n\\n (PieceType::Knight, Color::White) => \\\"\\\\u{2658}\\\",\\n\\n (PieceType::Knight, Color::Black) => \\\"\\\\u{265E}\\\",\\n\\n (PieceType::Bishop, Color::White) => \\\"\\\\u{2657}\\\",\\n\\n (PieceType::Bishop, Color::Black) => \\\"\\\\u{265D}\\\",\\n\",\n \"file_path\": \"src/board/cell/chesspiece.rs\",\n \"rank\": 52,\n \"score\": 15.394112965904615\n },\n {\n \"content\": \"extern crate serde_derive;\\n\\nextern crate serde_json;\\n\\n\\n\\nuse crate::board::cell::Cell;\\n\\nuse crate::board::cell::piecetype::PieceType;\\n\\nuse crate::chessmove::piecemove::{PieceMove};\\n\\nuse crate::player::humanplayer::HumanPlayer;\\n\\nuse std::error::Error;\\n\\nuse core::result::Result;\\n\\n\\n\\nuse crate::board::cell::chesspiece::ChessPiece;\\n\\nuse crate::board::cell::color::Color;\\n\\n\\n\\nuse super::coordinate::Coordinate;\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\npub struct Board {\\n\\n pub squares: Vec<Vec<Cell>>,\\n\\n pub board_size: i32,\\n\\n}\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 53,\n \"score\": 14.6655671303245\n },\n {\n \"content\": \" return Ok(false);\\n\\n }\\n\\n choices\\n\\n }\\n\\n Err(reason) => {\\n\\n println!(\\\"Not valid move : {:?}\\\", reason);\\n\\n return Ok(false);\\n\\n }\\n\\n };\\n\\n\\n\\n println!(\\\"Options: \\\");\\n\\n for (index, c) in coord_choices.iter().enumerate() {\\n\\n println!(\\\"choice: {}, coord: {:?}\\\", index, c);\\n\\n }\\n\\n\\n\\n let choice = match get_input::<i32>() {\\n\\n Ok(i) => i,\\n\\n Err(_) => {\\n\\n return Ok(false);\\n\\n }\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 55,\n \"score\": 13.724246670164833\n },\n {\n \"content\": \"pub mod chesspiece;\\n\\npub mod color;\\n\\npub mod piecetype;\\n\\n\\n\\nuse chesspiece::ChessPiece;\\n\\nuse color::Color;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\\n\\npub struct Cell {\\n\\n pub space: Option<ChessPiece>,\\n\\n pub color: Color,\\n\\n pub x: char,\\n\\n pub y: i32,\\n\\n}\\n\\n\\n\\nimpl Cell {\\n\\n // pub fn is_empty(&self) -> bool{\\n\\n // match self.space {\\n\\n // Some(_) => false,\\n\\n // None => true\\n\\n // }\\n\\n // }\\n\\n}\\n\",\n \"file_path\": \"src/board/cell/mod.rs\",\n \"rank\": 56,\n \"score\": 13.15829429619204\n },\n {\n \"content\": \"use chrust::{\\n\\n board::{cell::color::Color, chessboard::Board},\\n\\n frontend::server::build_and_run_frontend,\\n\\n game::chessgame::ChessGame,\\n\\n player::{aiplayer::AIPlayer, humanplayer::HumanPlayer},\\n\\n state::{programstate::get_args, viztype::VizType},\\n\\n};\\n\\n\\n\\n#[rocket::main]\\n\\nasync fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let program_state = get_args()?;\\n\\n let board = Board::load_from_file(\\\"game_start\\\")?;\\n\\n\\n\\n let human_player = HumanPlayer {\\n\\n name: \\\"kasparov\\\".to_string(),\\n\\n color: Color::White,\\n\\n };\\n\\n\\n\\n let ai_player = AIPlayer {\\n\\n name: \\\"rusty\\\".to_string(),\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 57,\n \"score\": 12.96579275845523\n },\n {\n \"content\": \"use super::chessplayer::ChessPlayer;\\n\\nuse crate::board::cell::color::Color;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct HumanPlayer {\\n\\n pub name: String,\\n\\n pub color: Color,\\n\\n}\\n\\n\\n\\nimpl ChessPlayer for HumanPlayer {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n fn color_abbr(&self) -> char {\\n\\n self.color.color_abbr()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/player/humanplayer.rs\",\n \"rank\": 58,\n \"score\": 12.948076705958545\n },\n {\n \"content\": \"use crate::board::cell::color::Color;\\n\\n\\n\\nuse super::chessplayer::ChessPlayer;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct AIPlayer {\\n\\n pub color: Color,\\n\\n pub name: String,\\n\\n}\\n\\n\\n\\nimpl ChessPlayer for AIPlayer {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n fn color_abbr(&self) -> char {\\n\\n self.color.color_abbr()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/player/aiplayer.rs\",\n \"rank\": 59,\n \"score\": 12.948076705958545\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn check_for_winner(&self) -> Option<String> {\\n\\n let white_king = self.board.piece_specific(Color::White, PieceType::King);\\n\\n let black_king = self.board.piece_specific(Color::Black, PieceType::King);\\n\\n\\n\\n match (white_king.is_some(), black_king.is_some()) {\\n\\n (true, true) => None,\\n\\n (true, false) => Some(self.user_of_color(Color::White).name().to_string()),\\n\\n (false, true) => Some(self.user_of_color(Color::Black).name().to_string()),\\n\\n (false, false) => panic!(\\\"Something went horribly wrong. Both kings are gone?\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn start_game(&mut self) -> Result<String, Box<dyn Error>> {\\n\\n self.print_to_screen(\\\"Initial\\\".to_string());\\n\\n\\n\\n let mut turn_num: u32 = 1;\\n\\n\\n\\n let winner = loop {\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 60,\n \"score\": 12.18855915122067\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize)]\\n\\npub struct SettingsResponse {\\n\\n pub program_state: ProgramState\\n\\n}\\n\\n\\n\\nimpl<'r> Responder<'r, 'static> for SettingsResponse {\\n\\n fn respond_to(self, _: &'r Request<'_>) -> response::Result<'static> {\\n\\n let response_string = serde_json::to_string(&self).unwrap();\\n\\n Response::build()\\n\\n .header(ContentType::JSON)\\n\\n .sized_body(response_string.len(), Cursor::new(response_string))\\n\\n .ok()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/frontend/responses.rs\",\n \"rank\": 61,\n \"score\": 12.167924245940355\n },\n {\n \"content\": \"// use crate::ai::minimax::boardstate::BoardState;\\n\\nuse crate::ai::minimax::funcs::max_decision;\\n\\nuse crate::board::cell::color::Color;\\n\\nuse crate::board::cell::piecetype::PieceType;\\n\\nuse crate::board::chessboard::Board;\\n\\nuse crate::board::coordinate::Coordinate;\\n\\n// use crate::chessmove::piecemove::Move;\\n\\nuse crate::player::aiplayer::*;\\n\\nuse crate::player::chessplayer::ChessPlayer;\\n\\nuse crate::player::humanplayer::*;\\n\\n\\n\\nextern crate rand;\\n\\n\\n\\n// use rand::thread_rng;\\n\\nuse rand::seq::SliceRandom;\\n\\n\\n\\nuse std::error::Error;\\n\\nuse std::str::FromStr;\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 62,\n \"score\": 11.566132495470892\n },\n {\n \"content\": \" self.board.move_piece(ai_move.from, ai_move.to);\\n\\n\\n\\n self.fullmove_counter += 1;\\n\\n self.halfmove_clock += 1;\\n\\n\\n\\n Ok(true)\\n\\n }\\n\\n\\n\\n pub fn human_moves(&mut self) -> Result<bool, Box<dyn Error>> {\\n\\n println!(\\\"Human moving!\\\");\\n\\n\\n\\n let (from, to) = if self.human_plays {\\n\\n println!(\\\"Select your piece!\\\");\\n\\n\\n\\n println!(\\\"x:\\\");\\n\\n let x = match get_input::<char>() {\\n\\n Ok(c) => c,\\n\\n Err(_) => {\\n\\n return Ok(false);\\n\\n }\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 63,\n \"score\": 11.311831393230133\n },\n {\n \"content\": \" \\\"game_start\\\" => include_str!(\\\"../../boards/game_start.json\\\"),\\n\\n \\\"empty_board\\\" => include_str!(\\\"../../boards/empty_board.json\\\"),\\n\\n _ => {return Err(Box::from(\\\"Invalid option for board_name\\\"))}\\n\\n };\\n\\n \\n\\n let board: Board = serde_json::from_str(board_string)?;\\n\\n\\n\\n if board.squares.len() as i32 != board.board_size {\\n\\n return Err(Box::from(format!(\\n\\n \\\"The json board is formated incorectly! The expected board_size: {} does not match the actual board size: {}\\\",\\n\\n board.board_size, \\n\\n board.squares.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n Ok(board)\\n\\n }\\n\\n \\n\\n // assumes the game section of the fen has been taken out\\n\\n pub fn load_from_fen(fen: String) -> Result<Board, Box<dyn std::error::Error>> {\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 64,\n \"score\": 11.268720255783398\n },\n {\n \"content\": \"use super::chessboard::Board;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, Serialize, Deserialize)]\\n\\npub struct Coordinate {\\n\\n pub x: char, //a-h\\n\\n pub y: i32, //1-8\\n\\n}\\n\\n\\n\\n//NO ERROR HANDLING - call is_valid if you want to test validity of a coordinate\\n\\nimpl Coordinate {\\n\\n pub fn new(x: char, y: i32) -> Self {\\n\\n Coordinate { x, y }\\n\\n }\\n\\n\\n\\n pub fn is_valid(&self, board: &Board) -> bool {\\n\\n (1..9).any(|ele| ele == self.y)\\n\\n && \\\"abcdefgh\\\"\\n\\n .to_string()\\n\\n .chars()\\n\\n .into_iter()\\n\",\n \"file_path\": \"src/board/coordinate.rs\",\n \"rank\": 65,\n \"score\": 11.152833827410172\n },\n {\n \"content\": \" }\\n\\n for cell in row {\\n\\n if let Some(piece_ref) = &cell.space {\\n\\n print!(\\\" {} |\\\", piece_ref.str());\\n\\n } else {\\n\\n print!(\\\" |\\\");\\n\\n }\\n\\n }\\n\\n println!();\\n\\n }\\n\\n print!(\\\" \\\");\\n\\n \\\"abcdefgh\\\".to_string().chars().into_iter().for_each(|int| print!(\\\" {} \\\", int));\\n\\n println!();\\n\\n }\\n\\n\\n\\n pub fn piece(&self, x: char, y: i32) -> core::result::Result<&ChessPiece, Box<dyn Error>> {\\n\\n for cell in self.all_cells() {\\n\\n if cell.x == x && cell.y == y {\\n\\n if let Some(piece_ref) = &cell.space {\\n\\n return Ok(piece_ref);\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 66,\n \"score\": 10.704662719758844\n },\n {\n \"content\": \"use crate::board::{cell::color, chessboard::Board, coordinate::Coordinate};\\n\\n\\n\\nuse super::{chesspiece::ChessPiece, color::Color};\\n\\n\\n\\n#[derive(Debug, Clone, Copy, Serialize, Deserialize, PartialEq)]\\n\\npub enum PieceType {\\n\\n Pawn = 1,\\n\\n Rook = 2,\\n\\n Knight = 3,\\n\\n Bishop = 4,\\n\\n Queen = 5,\\n\\n King = 6,\\n\\n}\\n\\n\\n\\n//TODO - refac this - should probably be impl ChessPiece instead\\n\\nimpl PieceType {\\n\\n pub fn available_moves(\\n\\n &self,\\n\\n target_piece: &ChessPiece,\\n\\n current_position: Coordinate,\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 67,\n \"score\": 10.649832068352342\n },\n {\n \"content\": \"use super::piecemove::*;\\n\\nuse crate::{\\n\\n board::cell::chesspiece::ChessPiece,\\n\\n player::{aiplayer::AIPlayer, humanplayer::HumanPlayer},\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/chessmove/action.rs\",\n \"rank\": 68,\n \"score\": 10.425060475931275\n },\n {\n \"content\": \"use crate::board::{cell::chesspiece::*, coordinate::Coordinate};\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub struct PieceMove<'a> {\\n\\n pub chess_piece: &'a ChessPiece,\\n\\n pub from: Coordinate,\\n\\n pub to: Coordinate,\\n\\n}\\n\\n\\n\\nimpl<'a> PieceMove<'a> {\\n\\n pub fn new(chess_piece: &'a ChessPiece, from: Coordinate, to: Coordinate) -> Self {\\n\\n PieceMove {\\n\\n chess_piece,\\n\\n from,\\n\\n to,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/chessmove/piecemove.rs\",\n \"rank\": 69,\n \"score\": 10.243568999109819\n },\n {\n \"content\": \"pub mod ai;\\n\\npub mod board;\\n\\npub mod chessmove;\\n\\npub mod ext;\\n\\npub mod frontend;\\n\\npub mod game;\\n\\npub mod player;\\n\\npub mod state;\\n\\n\\n\\n#[macro_use]\\n\\nextern crate serde_derive;\\n\\nextern crate serde_json;\\n\\n\\n\\n\\n\\nextern crate clap;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 70,\n \"score\": 10.205749989520072\n },\n {\n \"content\": \"\\n\\n Ok(board)\\n\\n }\\n\\n\\n\\n pub fn board_fen_section(&self) -> String {\\n\\n let mut fen = \\\"\\\".to_string();\\n\\n\\n\\n //construct the piece position portion\\n\\n for row in &self.squares {\\n\\n let mut num_empty_squares:i32 = 0;\\n\\n for cell in row {\\n\\n if let Some(piece) = cell.space {\\n\\n if num_empty_squares == 0 {\\n\\n fen.push_str(piece.fen_code());\\n\\n } else {\\n\\n fen.push_str(&num_empty_squares.to_string());\\n\\n fen.push_str(piece.fen_code());\\n\\n }\\n\\n num_empty_squares = 0;\\n\\n } else {\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 71,\n \"score\": 9.834086639315622\n },\n {\n \"content\": \" .sized_body(response_string.len(), Cursor::new(response_string))\\n\\n .ok()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct ValidateResponse {\\n\\n pub is_valid: bool,\\n\\n}\\n\\n\\n\\nimpl<'r> Responder<'r, 'static> for ValidateResponse {\\n\\n fn respond_to(self, _: &'r Request<'_>) -> response::Result<'static> {\\n\\n let response_string = serde_json::to_string(&self).unwrap();\\n\\n Response::build()\\n\\n .header(ContentType::JSON)\\n\\n .sized_body(response_string.len(), Cursor::new(response_string))\\n\\n .ok()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/frontend/responses.rs\",\n \"rank\": 72,\n \"score\": 9.833227024550695\n },\n {\n \"content\": \" }\\n\\n else {\\n\\n return Err(Box::from(format!(\\\"You tried to get a piece at a space that didnt have one - did you mean to do that? x:{},y:{}\\\", x, y)));\\n\\n }\\n\\n }\\n\\n }\\n\\n \\n\\n Err(Box::from(format!(\\\"couldnt find the given pairs of points on the board! Either the board is goofed - or your points are: x:{},y:{}\\\", x, y)))\\n\\n }\\n\\n\\n\\n pub fn possible_moves_human(&self, current_position: Coordinate, human_player: &HumanPlayer) -> Result<Vec<Coordinate>, Box<dyn Error>> {\\n\\n let target_piece = self.piece(current_position.x, current_position.y)?;\\n\\n\\n\\n if target_piece.color != human_player.color {\\n\\n return Err(Box::from(\\\"Thats not your piece!\\\"));\\n\\n }\\n\\n \\n\\n Ok(target_piece.piece_type.available_moves(target_piece, current_position, self))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 73,\n \"score\": 9.65361195844196\n },\n {\n \"content\": \" pub player: &'a AIPlayer,\\n\\n}\\n\\n\\n\\nimpl<'a> Action<'a> for HumanAction<'a> {\\n\\n fn get_piece_(&self) -> &ChessPiece {\\n\\n self.piece_move.chess_piece\\n\\n }\\n\\n\\n\\n fn get_x(&self) -> char {\\n\\n 'a'\\n\\n }\\n\\n\\n\\n fn get_y(&self) -> i32 {\\n\\n 1\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Action<'a> for AIAction<'a> {\\n\\n fn get_piece_(&self) -> &ChessPiece {\\n\\n self.piece_move.chess_piece\\n\",\n \"file_path\": \"src/chessmove/action.rs\",\n \"rank\": 74,\n \"score\": 8.746696385289052\n },\n {\n \"content\": \"\\n\\nuse crate::ext::stringext::ToCoord;\\n\\n\\n\\npub struct ChessGame {\\n\\n pub human_player: HumanPlayer,\\n\\n pub ai_player: AIPlayer,\\n\\n pub board: Board,\\n\\n // pub history: Vec<&'a (dyn Action<'a> + Sync)>,\\n\\n human_plays: bool,\\n\\n tick_speed: u64, //milli\\n\\n\\n\\n side_to_move: char,\\n\\n castling_ability: String,\\n\\n en_passant_target_square: String,\\n\\n halfmove_clock: u32,\\n\\n fullmove_counter: u32,\\n\\n}\\n\\n\\n\\nimpl ChessGame {\\n\\n pub fn new(\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 75,\n \"score\": 8.245509025345472\n },\n {\n \"content\": \" };\\n\\n\\n\\n println!(\\\"y:\\\");\\n\\n let y = match get_input::<i32>() {\\n\\n Ok(i) => i,\\n\\n Err(_) => {\\n\\n return Ok(false);\\n\\n }\\n\\n };\\n\\n\\n\\n let current_position = Coordinate::new(x, y);\\n\\n\\n\\n //this is syntax is really cool\\n\\n let coord_choices = match self\\n\\n .board\\n\\n .possible_moves_human(current_position, &self.human_player)\\n\\n {\\n\\n Ok(choices) => {\\n\\n if choices.is_empty() {\\n\\n println!(\\\"That piece can't go anywhere!\\\");\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 76,\n \"score\": 8.180965539250286\n },\n {\n \"content\": \"\\n\\nimpl Board {\\n\\n pub fn test_cell_at(&self, coordinate: Coordinate) -> Option<&Cell> {\\n\\n self.all_cells().iter().filter(|cell| cell.x == coordinate.x && cell.y == coordinate.y).map(|x| x.to_owned()).next()\\n\\n }\\n\\n\\n\\n //should really ONLY be used in an evaluation function\\n\\n pub fn all_cells(&self) -> Vec<&Cell> {\\n\\n self.squares.iter().flatten().collect()\\n\\n }\\n\\n\\n\\n fn all_cells_mut(&mut self) -> Vec<&mut Cell> {\\n\\n self.squares.iter_mut().flatten().collect()\\n\\n }\\n\\n\\n\\n pub fn print_to_screen(&self, configuration_name: String) {\\n\\n println!(\\\"---------------------------{}\\\", configuration_name);\\n\\n for row in &self.squares {\\n\\n if let Some(first_cell) = row.iter().next() {\\n\\n print!(\\\"{}|\\\", first_cell.y);\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 77,\n \"score\": 8.034764968768261\n },\n {\n \"content\": \" pub fn possible_moves(&self, current_position: Coordinate, color: Color) -> Result<Vec<Coordinate>, Box<dyn Error>> {\\n\\n let target_piece = self.piece(current_position.x, current_position.y)?;\\n\\n\\n\\n if target_piece.color != color {\\n\\n return Err(Box::from(\\\"Thats not your piece!\\\"));\\n\\n }\\n\\n \\n\\n Ok(target_piece.piece_type.available_moves(target_piece, current_position, self))\\n\\n }\\n\\n\\n\\n pub fn all_possible_moves(&self, color: Color) -> Result<Vec<PieceMove>, Box<dyn Error>> {\\n\\n let cells = self.cells_with_pieces_with_color(color);\\n\\n\\n\\n let mut possible_moves: Vec<PieceMove> = Vec::new();\\n\\n\\n\\n for cell in cells{\\n\\n let current_position = Coordinate::new(cell.x, cell.y);\\n\\n let piece_at_position = self.piece(current_position.x, current_position.y)?;\\n\\n\\n\\n let coord_choices = self.possible_moves(current_position, color)?;\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 78,\n \"score\": 7.984947699536191\n },\n {\n \"content\": \"use std::fmt;\\n\\n\\n\\n#[derive(PartialEq, Debug, Clone, Copy, Serialize, Deserialize)]\\n\\npub enum Color {\\n\\n White = 1,\\n\\n Black = 2,\\n\\n}\\n\\n\\n\\nimpl Color {\\n\\n pub fn color_abbr(&self) -> char {\\n\\n self.to_string().chars().next().unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Color {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{:?}\\\", self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/board/cell/color.rs\",\n \"rank\": 79,\n \"score\": 7.9745347242816536\n },\n {\n \"content\": \" //1: get the reference to the piece we're going to movmute\\n\\n let mut target_piece: ChessPiece = ChessPiece {\\n\\n color: Color::Black,\\n\\n piece_type: PieceType::Bishop\\n\\n };\\n\\n for cell in self.all_cells(){\\n\\n if cell.x == from.x && cell.y == from.y {\\n\\n if let Some(piece_ref) = cell.space {\\n\\n target_piece = piece_ref; //should be moving the value i hope\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n //2: move the reference to the stop we're moving to \\n\\n for row in &mut self.squares {\\n\\n for cell in row {\\n\\n if cell.x == to.x && cell.y == to.y {\\n\\n //we can safely assume there is NO piece at this location\\n\\n //since the from x and y are given to us by the set of possible moves\\n\\n //calculated ahead of time\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 80,\n \"score\": 7.718787899702798\n },\n {\n \"content\": \" pub fn cells_with_pieces_with_color(&self, color: Color) -> Vec<&Cell> {\\n\\n let mut cells: Vec<&Cell> = Vec::new();\\n\\n for cell in self.all_cells() {\\n\\n if let Some(piece_ref) = &cell.space {\\n\\n if piece_ref.color == color {\\n\\n cells.push(cell);\\n\\n }\\n\\n }\\n\\n }\\n\\n cells\\n\\n }\\n\\n\\n\\n pub fn piece_specific(&self, color: Color, piece_type: PieceType) -> Option<&ChessPiece>{\\n\\n let pieces = self.pieces_of_color(color);\\n\\n\\n\\n pieces.into_iter().find(|x| x.piece_type == piece_type)\\n\\n }\\n\\n\\n\\n\\n\\n pub fn move_piece(&mut self, from: Coordinate, to: Coordinate){\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 81,\n \"score\": 7.53303841819904\n },\n {\n \"content\": \"use core::panic;\\n\\nuse std::cmp;\\n\\nuse std::error::Error;\\n\\nuse std::time::Instant;\\n\\n\\n\\nuse crate::{\\n\\n ai::minimax::evaluate::evaluate,\\n\\n board::{cell::color::Color, chessboard::Board},\\n\\n chessmove::piecemove::PieceMove,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/funcs.rs\",\n \"rank\": 82,\n \"score\": 7.47922191300392\n },\n {\n \"content\": \" for cell in row {\\n\\n if cell.x == x && cell.y == y {\\n\\n cell.space = None;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn pieces_of_color(&self, color: Color) -> Vec<&ChessPiece> {\\n\\n let mut pieces: Vec<&ChessPiece> = Vec::new();\\n\\n for cell in self.all_cells() {\\n\\n if let Some(piece_ref) = &cell.space {\\n\\n if piece_ref.color == color {\\n\\n pieces.push(piece_ref);\\n\\n }\\n\\n }\\n\\n }\\n\\n pieces\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 83,\n \"score\": 7.183134935731411\n },\n {\n \"content\": \"use crate::board::{\\n\\n cell::{chesspiece::ChessPiece, color::Color, piecetype::PieceType},\\n\\n chessboard::Board,\\n\\n};\\n\\n\\n\\n//NOTE: this evaluation function assumes that the WHITE is the MIN player and BLACK is the MAX player\\n\",\n \"file_path\": \"src/ai/minimax/evaluate.rs\",\n \"rank\": 84,\n \"score\": 7.158000554876337\n },\n {\n \"content\": \"// ));\\n\\n// }\\n\\n\\n\\n// let min_action = good_actions.into_iter().min_by(|x, y| x.1.cmp(&y.1));\\n\\n\\n\\n// match min_action {\\n\\n// Some(action) => Ok(action),\\n\\n// None => Err(Box::from(\\\"Minimax was unable to find a min decision!\\\")),\\n\\n// }\\n\\n// }\\n\\n\\n\",\n \"file_path\": \"src/ai/minimax/funcs.rs\",\n \"rank\": 85,\n \"score\": 7.062425853329054\n },\n {\n \"content\": \" (PieceType::Queen, Color::White) => \\\"\\\\u{2655}\\\",\\n\\n (PieceType::Queen, Color::Black) => \\\"\\\\u{265B}\\\",\\n\\n (PieceType::King, Color::White) => \\\"\\\\u{2654}\\\",\\n\\n (PieceType::King, Color::Black) => \\\"\\\\u{265A}\\\",\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn fen_code(&self) -> &str {\\n\\n match (self.piece_type, self.color) {\\n\\n (PieceType::Pawn, Color::White) => \\\"P\\\",\\n\\n (PieceType::Pawn, Color::Black) => \\\"p\\\",\\n\\n (PieceType::Rook, Color::White) => \\\"R\\\",\\n\\n (PieceType::Rook, Color::Black) => \\\"r\\\",\\n\\n (PieceType::Knight, Color::White) => \\\"N\\\",\\n\\n (PieceType::Knight, Color::Black) => \\\"n\\\",\\n\\n (PieceType::Bishop, Color::White) => \\\"B\\\",\\n\\n (PieceType::Bishop, Color::Black) => \\\"b\\\",\\n\\n (PieceType::Queen, Color::White) => \\\"Q\\\",\\n\\n (PieceType::Queen, Color::Black) => \\\"q\\\",\\n\\n (PieceType::King, Color::White) => \\\"K\\\",\\n\\n (PieceType::King, Color::Black) => \\\"k\\\",\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/board/cell/chesspiece.rs\",\n \"rank\": 86,\n \"score\": 6.667950055459627\n },\n {\n \"content\": \" board: &Board,\\n\\n ) -> Vec<Coordinate> {\\n\\n let valid_moves: Vec<Coordinate> = match *self {\\n\\n PieceType::Pawn => {\\n\\n //pawns can only move one or two spaces (depending on turn num)\\n\\n let possible_coordinates = match (target_piece.color, current_position.y) {\\n\\n (Color::White, 2) => vec![current_position.up_by(1), current_position.up_by(2)],\\n\\n (Color::Black, 2) => {\\n\\n vec![current_position.down_by(1), current_position.down_by(2)]\\n\\n }\\n\\n (Color::White, _) => vec![current_position.up_by(1)],\\n\\n (Color::Black, _) => vec![current_position.down_by(1)],\\n\\n };\\n\\n\\n\\n //only include the ones where the enemy is NOT in front of\\n\\n let mut possible_coordinates: Vec<Coordinate> = possible_coordinates\\n\\n .into_iter()\\n\\n .filter(|coord| !enemy_occupied(coord.to_owned(), target_piece.color, board))\\n\\n .map(|coord| coord.to_owned())\\n\\n .collect();\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 87,\n \"score\": 6.42836352616038\n },\n {\n \"content\": \" color: Color::Black,\\n\\n };\\n\\n\\n\\n let mut game = ChessGame::new(\\n\\n human_player,\\n\\n ai_player,\\n\\n board,\\n\\n program_state.human_plays,\\n\\n program_state.tick_speed,\\n\\n );\\n\\n\\n\\n match program_state.viz_type {\\n\\n VizType::Term => {\\n\\n let winner = game.start_game()?;\\n\\n println!(\\\"Winner: {}\\\", &winner);\\n\\n Ok(())\\n\\n }\\n\\n VizType::Web => {\\n\\n if build_and_run_frontend(program_state).await.is_err() {\\n\\n panic!(\\\"Error while trying to start frontend!\\\");\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 88,\n \"score\": 6.195927025161589\n },\n {\n \"content\": \"use crate::board::coordinate::Coordinate;\\n\\n\\n\",\n \"file_path\": \"src/ext/stringext.rs\",\n \"rank\": 89,\n \"score\": 6.124503311744934\n },\n {\n \"content\": \"\\n\\n let mut possible_moves_for_piece: Vec<PieceMove> = \\n\\n coord_choices.iter().map(|coord | PieceMove::new(piece_at_position, current_position, *coord)).collect();\\n\\n\\n\\n \\n\\n possible_moves.append(&mut possible_moves_for_piece);\\n\\n }\\n\\n\\n\\n Ok(possible_moves)\\n\\n }\\n\\n\\n\\n pub fn apply_action(&self, action: &PieceMove) -> Board {\\n\\n //by jove i hope this doesnt have unexpected side affects\\n\\n let mut new_board = self.clone();\\n\\n new_board.move_piece(action.from, action.to);\\n\\n new_board\\n\\n }\\n\\n\\n\\n fn space_to_empty(&mut self, x: char, y: i32) {\\n\\n for row in self.squares.iter_mut() {\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 90,\n \"score\": 5.803609227907018\n },\n {\n \"content\": \"\\n\\n //Pawns can move diagonally if there's an enemy there\\n\\n let possible_enemy_positions: Vec<Coordinate> =\\n\\n if target_piece.color == color::Color::White {\\n\\n vec![\\n\\n current_position.diagonal_up_right_by(1),\\n\\n current_position.diagonal_up_left_by(1),\\n\\n ]\\n\\n } else {\\n\\n vec![\\n\\n current_position.diagonal_down_left_by(1),\\n\\n current_position.diagonal_down_right_by(1),\\n\\n ]\\n\\n }\\n\\n .into_iter()\\n\\n .filter(|coord| coord.is_valid(board)) //filter out the ones that arent valid (i.e, diagonal left might be off the map)\\n\\n .collect();\\n\\n\\n\\n for coord in possible_enemy_positions {\\n\\n if enemy_occupied(coord, target_piece.color, board) {\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 91,\n \"score\": 5.690497888539641\n },\n {\n \"content\": \" num_empty_squares += 1;\\n\\n }\\n\\n }\\n\\n if num_empty_squares != 0 {\\n\\n fen.push_str(&num_empty_squares.to_string());\\n\\n }\\n\\n fen.push('/');\\n\\n }\\n\\n\\n\\n fen[0..fen.len()-1].to_string()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 92,\n \"score\": 5.482725869785406\n },\n {\n \"content\": \" let mut board = Board::load_from_file(\\\"empty_board\\\")?;\\n\\n let sections: Vec<Vec<char>> = fen.split('/').into_iter().map(|s| s.to_string().chars().collect()).collect();\\n\\n\\n\\n let mut cells = board.all_cells_mut();\\n\\n let mut cell_iter = cells.iter_mut();\\n\\n\\n\\n for c_vec in sections {\\n\\n for c in c_vec {\\n\\n if c.is_numeric() {\\n\\n let num_to_skip = c.to_digit(10).expect(\\\"Unable to convert the num to skip to i32\\\");\\n\\n for _ in 0..num_to_skip {\\n\\n cell_iter.next();\\n\\n }\\n\\n }\\n\\n else {\\n\\n let cell = cell_iter.next().expect(\\\"The iterator really shouldnt be empty :(\\\");\\n\\n cell.space.get_or_insert(piece_from_fen_char(c)?);\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/board/chessboard.rs\",\n \"rank\": 93,\n \"score\": 5.463313097040759\n },\n {\n \"content\": \"\\n\\n if coord_choices.is_empty() {\\n\\n //that piece can't go anywhere - try to get another one\\n\\n continue;\\n\\n }\\n\\n\\n\\n let to = *coord_choices\\n\\n .choose(&mut rand::thread_rng())\\n\\n .ok_or(\\\"There was an error while trying to get a choice randomly\\\")?;\\n\\n\\n\\n break (from, to);\\n\\n };\\n\\n\\n\\n (from, to)\\n\\n };\\n\\n\\n\\n self.board.move_piece(from, to);\\n\\n\\n\\n Ok(true)\\n\\n }\\n\",\n \"file_path\": \"src/game/chessgame.rs\",\n \"rank\": 94,\n \"score\": 5.366678414631508\n },\n {\n \"content\": \" possible_coordinates.push(coord)\\n\\n };\\n\\n }\\n\\n\\n\\n //only return the coordinates that are valid spaces (on the board)\\n\\n possible_coordinates\\n\\n .into_iter()\\n\\n .filter(|coord| coord.is_valid(board))\\n\\n .collect()\\n\\n }\\n\\n PieceType::Rook => {\\n\\n /*Algorithm:\\n\\n For each direction a rook can move in:\\n\\n iterate up starting at the target piece in a diagonal line, if we hit an enemy, add that position, but dont go any further. If we hit a friendly piece, stop - dont add that position\\n\\n */\\n\\n let mut possible_coordinates: Vec<Coordinate> = Vec::new();\\n\\n\\n\\n let possible_directions: Vec<fn(Coordinate, i32) -> Coordinate> =\\n\\n vec![up_by, down_by, left_by, right_by];\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 95,\n \"score\": 4.598559194059273\n },\n {\n \"content\": \"\\n\\n if !possible_position.is_valid(board) {\\n\\n continue;\\n\\n };\\n\\n\\n\\n if friendly_occupied(possible_position, target_piece.color, board) {\\n\\n break;\\n\\n } else if enemy_occupied(possible_position, target_piece.color, board) {\\n\\n possible_coordinates.push(possible_position);\\n\\n break;\\n\\n } else {\\n\\n possible_coordinates.push(possible_position);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n possible_coordinates\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 96,\n \"score\": 4.385571434594773\n },\n {\n \"content\": \" ];\\n\\n\\n\\n for direction_func in possible_directions {\\n\\n for position in (1..9).into_iter() {\\n\\n let possible_position = direction_func(current_position, position);\\n\\n\\n\\n if !possible_position.is_valid(board) {\\n\\n continue;\\n\\n };\\n\\n\\n\\n if friendly_occupied(possible_position, target_piece.color, board) {\\n\\n break;\\n\\n } else if enemy_occupied(possible_position, target_piece.color, board) {\\n\\n possible_coordinates.push(possible_position);\\n\\n break;\\n\\n } else {\\n\\n possible_coordinates.push(possible_position);\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 97,\n \"score\": 3.9311333629168694\n },\n {\n \"content\": \" for direction_func in possible_directions {\\n\\n for position in (1..9).into_iter() {\\n\\n let possible_position = direction_func(current_position, position);\\n\\n\\n\\n if !possible_position.is_valid(board) {\\n\\n continue;\\n\\n };\\n\\n\\n\\n if friendly_occupied(possible_position, target_piece.color, board) {\\n\\n break;\\n\\n } else if enemy_occupied(possible_position, target_piece.color, board) {\\n\\n possible_coordinates.push(possible_position);\\n\\n break;\\n\\n } else {\\n\\n possible_coordinates.push(possible_position);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n possible_coordinates\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 98,\n \"score\": 3.858683871468327\n },\n {\n \"content\": \" diagonal_down_right_by,\\n\\n diagonal_down_left_by,\\n\\n ];\\n\\n\\n\\n for direction_func in possible_directions {\\n\\n for position in (1..9).into_iter() {\\n\\n let possible_position = direction_func(current_position, position);\\n\\n\\n\\n if !possible_position.is_valid(board) {\\n\\n continue;\\n\\n };\\n\\n\\n\\n if friendly_occupied(possible_position, target_piece.color, board) {\\n\\n break;\\n\\n } else if enemy_occupied(possible_position, target_piece.color, board) {\\n\\n possible_coordinates.push(possible_position);\\n\\n break;\\n\\n } else {\\n\\n possible_coordinates.push(possible_position);\\n\\n }\\n\",\n \"file_path\": \"src/board/cell/piecetype.rs\",\n \"rank\": 99,\n \"score\": 3.788918682954322\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":36,"numItemsPerPage":100,"numTotalItems":13489,"offset":3600,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NTU3Mzk0Niwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3NzU1Nzc1NDYsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.46gJ_yETT0rQl4EZqZIeV8vjQd0Kdt8tmHDukvQaIDy2-PaKopmj8KBgw3boKC0lLHv_L_maXiMRPLHJ-IR6Dw","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 | src/crawler.rs | parallaxisjones/crawlrs | e9844344feb36152758fd810b03b9cca58be4abd | use crate::api::crawl::CrawlOpts;
use crate::client::FetchProvider;
use crate::session_stats::SessionStats;
use std::collections::HashSet;
pub struct Crawler {
pub options: CrawlOpts,
client: Box<dyn FetchProvider>,
visited: Box<HashSet<String>>,
stats: SessionStats,
}
impl Crawler {
pub fn new(cl... | use crate::api::crawl::CrawlOpts;
use crate::client::FetchProvider;
use crate::session_stats::SessionStats;
use std::collections::HashSet;
pub struct Crawler {
pub options: CrawlOpts,
client: Box<dyn FetchProvider>,
visited: Box<HashSet<String>>,
stats: SessionStats,
}
impl Crawler {
pub fn new(cl... |
self.visited.extend(self.options.urls.iter().cloned());
self.stats.add_visit(Some(self.options.urls.len() as u64));
let mut new_urls = found_urls
.difference(&self.visited)
.map(|x| x.to_string())
.collect::<HashSet<String>>();
while !new_urls.is_empt... | let mut found_urls = self
.options
.urls
.iter()
.map(|url| {
let root_node = self.client.fetch(&url, &self.options).unwrap();
let links = root_node.get_links_from_html();
links
})
.f... | assignment_statement | [
{
"content": "pub fn crawl(craw_opts: CrawlOpts) {\n\n let client = Box::new(CrawlrsClient::new());\n\n let mut session = Crawler::new(client, craw_opts);\n\n let links = session.crawl();\n\n let mut sorted = links.iter().cloned().collect::<Vec<String>>();\n\n sorted.sort();\n\n serde_json::to... |
Rust | backend/src/service/server.rs | flyingblackshark/blog-rs | fd11213cd89b188643ec2bba5013b3d56d234e16 | use std::vec::Vec;
use std::{collections::HashMap, convert::Infallible, net::SocketAddr};
use futures::future::Future;
use hyper::{header::HeaderValue, HeaderMap, Uri};
use password_hash::Output;
use tokio::sync::oneshot::Receiver;
use warp::{self, reject, Filter, Rejection, Reply, Server, TlsServer};
use blog_common... | use std::vec::Vec;
use std::{collections::HashMap, convert::Infallible, net::SocketAddr};
use futures::future::Future;
use hyper::{header::HeaderValue, HeaderMap, Uri};
use password_hash::Output;
use tokio::sync::oneshot::Receiver;
use warp::{self, reject, Filter, Rejection, Reply, Server, TlsServer};
use blog_common... |
routes.recover(facade::handle_rejection)
}
| let routes = index
.or(asset)
.or(get_upload)
.or(management_settings)
.or(management_login)
.or(management_update_settings)
.or(user_logout)
.or(user_info)
.or(verify_image)
.or(random_title_image)
.or(post_list)
.or(tags_all)
... | assignment_statement | [] |
Rust | src/connectivity/wlan/lib/mlme/rust/src/buffer.rs | winksaville/Fuchsia | a0ec86f1d51ae8d2538ff3404dad46eb302f9b4f |
use {
crate::error::Error,
std::{
ffi::c_void,
ops::{Deref, DerefMut},
ptr, slice,
},
};
#[repr(C)]
pub struct BufferProvider {
get_buffer: unsafe extern "C" fn(min_len: usize) -> InBuf,
}
impl BufferProvider {
pub fn get_buffer(&self, min_len: usize) -> Re... |
use {
crate::error::Error,
std::{
ffi::c_void,
ops::{Deref, DerefMut},
ptr, slice,
},
};
#[repr(C)]
pub struct BufferProvider {
get_buffer: unsafe extern "C" fn(min_len: usize) -> InBuf,
}
impl BufferProvider {
pub fn get_buffer(&self, min_len: usize) -> Re... |
#[test]
fn as_slice_null_data() {
let buf = InBuf {
free_buffer: default_free_buffer,
raw: 42 as *mut c_void,
data: ptr::null_mut(),
len: 10,
};
assert_eq!(buf.as_slice(), []);
}
#[test]
fn as_slice() {
let mut data =... | fn return_out_of_scope_buffer() {
static mut RETURNED_RAW_BUFFER: *mut c_void = ptr::null_mut();
unsafe extern "C" fn assert_free_buffer(raw: *mut c_void) {
RETURNED_RAW_BUFFER = raw;
}
{
InBuf {
free_buffer: assert_free_buffer,
... | function_block-full_function | [] |
Rust | crates/vx_client/src/debug.rs | vilunov/vx_bevy | 7cfffc9a4a97e89ceb0c9bc9e7d235b77b585537 | use crate::{input::Action, player::PlayerController, render::CHUNK_MESHING_TIME};
use bevy::{
diagnostic::{DiagnosticId, Diagnostics, FrameTimeDiagnosticsPlugin},
ecs::system::EntityCommands,
prelude::*,
};
use enum_iterator::IntoEnumIterator;
use vx_core::{
config::GlobalConfig,
world::{ChunkEntity... | use crate::{input::Action, player::PlayerController, render::CHUNK_MESHING_TIME};
use bevy::{
diagnostic::{DiagnosticId, Diagnostics, FrameTimeDiagnosticsPlugin},
ecs::system::EntityCommands,
prelude::*,
};
use enum_iterator::IntoEnumIterator;
use vx_core::{
config::GlobalConfig,
world::{ChunkEntity... |
fn update_debug_values(
mut counters: Query<(&mut Text, &DebugValue)>,
player: Query<(&PlayerController, &Transform)>,
config: Res<GlobalConfig>,
) {
for (mut text, debug_cnt) in counters.iter_mut() {
for (_, transform) in player.single() {
match &debug_cnt {
&Debug... | fn update_diagnostic_counters(
diagnostics: ResMut<Diagnostics>,
mut counter: Query<(&mut Text, &DiagnosticCounter)>,
) {
for (mut text, counter) in counter.iter_mut() {
if let Some(diag) = diagnostics.get(counter.0) {
if let Some(avg) = diag.average() {
text.sections[2].... | function_block-full_function | [
{
"content": "fn setup(mut commands: Commands) {\n\n commands\n\n .spawn_bundle(PerspectiveCameraBundle {\n\n transform: Transform::from_xyz(0., 150.0, 0.0),\n\n ..Default::default()\n\n })\n\n .insert(Player)\n\n .insert(PlayerController::default());\n\n}\n"... |
Rust | src/solution.rs | jgrosspietsch/nonogram-rs | 477e211126c81b247ba112ebc7ba99f051dd1646 | extern crate ndarray;
use ndarray::Array1;
use std::collections::{HashSet, VecDeque};
#[path = "state_grid.rs"]
mod state_grid;
#[path = "state_row.rs"]
mod state_row;
pub use state_grid::StateGrid;
pub use state_row::StateRow;
#[derive(PartialEq, Eq, Copy, Clone, Debug, Hash)]
pub enum CellState {
Unknown,
... | extern crate ndarray;
use ndarray::Array1;
use std::collections::{HashSet, VecDeque};
#[path = "state_grid.rs"]
mod state_grid;
#[path = "state_row.rs"]
mod state_row;
pub use state_grid::StateGrid;
pub use state_row::StateRow;
#[derive(PartialEq, Eq, Copy, Clone, Debug, Hash)]
pub enum CellState {
Unknown,
... |
#[cfg(test)]
mod tests {
use super::{
common_row_indexes, enumerate_row_states, filter_invalid_row_states, CellState, StateRow,
};
use ndarray::arr1;
#[test]
fn enumerate_row_states1() {
let states = enumerate_row_states(5, &[1, 1, 1]);
assert_eq!(states.len(), 1);
}
... | pub fn common_row_indexes(states: &[StateRow]) -> Vec<(usize, CellState)> {
let mut common_empty: Array1<usize> = Array1::zeros(states[0].0.len());
let mut common_filled: Array1<usize> = Array1::zeros(states[0].0.len());
for state in states {
for i in 0..state.0.len() {
match state.0[i]... | function_block-full_function | [
{
"content": "fn build_clue(row: ArrayView1<u8>) -> Vec<usize> {\n\n let mut clue: Vec<usize> = Vec::new();\n\n\n\n row.into_iter()\n\n .cloned()\n\n .collect::<Vec<u8>>()\n\n .split(|cell| *cell == 0u8)\n\n .for_each(|segment| {\n\n if !segment.is_empty() {\n\n ... |
Rust | src/database.rs | sacooper/Copper | 0240a0060fb2f84b3026d2aff4f07b5c843b2308 | use rustc_serialize::json::{self, Json, ToJson};
use rand::{thread_rng, Rng};
use mmap::{MemoryMap, MapOption};
use std::fs;
use std::io::{Write, SeekFrom, Seek};
use std::io::Error as IOError;
use std::os::unix::prelude::AsRawFd;
use std::collections::{HashMap, VecDeque, BTreeMap};
use std::mem;
use std::sync::{Arc,... | use rustc_serialize::json::{self, Json, ToJson};
use rand::{thread_rng, Rng};
use mmap::{MemoryMap, MapOption};
use std::fs;
use std::io::{Write, SeekFrom, Seek};
use std::io::Error as IOError;
use std::os::unix::prelude::AsRawFd;
use std::collections::{HashMap, VecDeque, BTreeMap};
use std::mem;
use std::sync::{Arc,... |
log.push_back(Entry::Insert(obj));
Ok(())
}
fn gen_random_id() -> String {
thread_rng().gen_ascii_chars().filter(|c| c.is_alphanumeric()).take(15).collect::<String>()
}
fn load_datab... | if let Json::Object(ref mut map) = obj {
map.insert("_id".to_string(), Json::String(Database::gen_random_id()));
} else {
unimplemented!();
} | if_condition | [
{
"content": "fn copy_log(temp_lock: &mut Arc<RwLock<File>>, log: &mut Box<VecDeque<Entry>>){\n\n let mut temp = temp_lock.write().unwrap();\n\n for entry in log.iter() {\n\n temp.write(&(json::encode(entry).unwrap().into_bytes()));\n\n temp.write(\"\\n\".as_bytes());\n\n }\n\n}\n\n\n",
... |
Rust | tests/direnv/direnvtestcase.rs | sveitser/lorri | e68e0f51a864b746372555b7f5482977c6e9556d |
use lorri::{
build_loop::{BuildError, BuildLoop, BuildResults},
ops::direnv,
project::Project,
roots::Roots,
};
use std::collections::HashMap;
use std::fs::File;
use std::io::Write;
use std::path::PathBuf;
use std::process::Command;
use tempfile::{tempdir, TempDir};
pub struct DirenvTestCase {
te... |
use lorri::{
build_loop::{BuildError, BuildLoop, BuildResults},
ops::direnv,
project::Project,
roots::Roots,
};
use std::collections::HashMap;
use std::fs::File;
use std::io::Write;
use std::path::PathBuf;
use std::process::Command;
use tempfile::{tempdir, TempDir};
pub struct DirenvTestCase {
te... |
let result = allow.status().expect("Failed to run direnv allow");
assert!(result.success());
}
let mut env = self.direnv_cmd();
env.args(&["export", "json"]);
let result = env.output().expect("Failed to run direnv allow");
assert!(result.status.success()... | ect_root.join(".envrc"))
.unwrap()
.write_all(shell.as_bytes())
.unwrap();
{
let mut allow = self.direnv_cmd();
allow.arg("allow"); | random | [
{
"content": "/// See the documentation for lorri::cli::Command::Shell for more\n\n/// details.\n\npub fn main(project: Project) -> OpResult {\n\n let (tx, rx) = channel();\n\n let root_nix_file = &project.expression();\n\n let roots = Roots::new(project.gc_root_path().unwrap(), project.id());\n\n l... |
Rust | tests/integration.rs | Windfisch/mcp49xx-rs | 2127940b6954626f5f90d3d3f7870e2a085edf1a | extern crate mcp49xx;
use mcp49xx::{Channel, Command, Error};
extern crate embedded_hal_mock as hal;
use self::hal::spi::Transaction as SpiTrans;
mod base;
use base::{
new_mcp4801, new_mcp4802, new_mcp4811, new_mcp4812, new_mcp4821, new_mcp4822, new_mcp4901,
new_mcp4902, new_mcp4911, new_mcp4912, new_mcp4921, n... | extern crate mcp49xx;
use mcp49xx::{Channel, Command, Error};
extern crate embedded_hal_mock as hal;
use self::hal::spi::Transaction as SpiTrans;
mod base;
use base::{
new_mcp4801, new_mcp4802, new_mcp4811, new_mcp4812, new_mcp4821, new_mcp4822, new_mcp4901,
new_mcp4902, new_mcp4911, new_mcp4912, new_mcp4921, n... | (Command::default().buffered()),
BufferingNotSupported
);
dev.destroy().0.done();
}
}
};
}
for_all_ics_without_buffering!(invalid_buffering_test);
macro_rules! send_buffered_test {
($name:ident, $create:ident) => {
mod $name {
... |
assert_error!(result, InvalidValue);
}
#[should_panic]
#[test]
fn can_fail() {
let result: Result<(), Error<()>> = Ok(());
assert_error!(result, InvalidValue);
}
macro_rules! common {
($name:ident, $create:ident) => {
mod $name {
use super::*;
test!(
s... | random | [
{
"content": "extern crate mcp49xx;\n\nuse mcp49xx::{interface, marker, Mcp49xx};\n\nextern crate embedded_hal_mock as hal;\n\nuse self::hal::spi::{Mock as SpiMock, Transaction as SpiTrans};\n\n\n\npub struct DummyOutputPin;\n\n\n\nimpl embedded_hal::digital::OutputPin for DummyOutputPin {\n\n fn set_low(&mu... |
Rust | src/client/commands/submit.rs | Dotnester/hyperqueue | cf5227c2157ab431ee7018a40bbbf0558afe4f27 | use std::io::BufRead;
use std::path::{Path, PathBuf};
use std::str::FromStr;
use std::{fs, io};
use anyhow::anyhow;
use bstr::BString;
use clap::Clap;
use hashbrown::HashMap;
use tako::common::resources::{CpuRequest, ResourceRequest};
use tako::messages::common::{ProgramDefinition, StdioDef};
use crate::client::comma... | use std::io::BufRead;
use std::path::{Path, PathBuf};
use std::str::FromStr;
use std::{fs, io};
use anyhow::anyhow;
use bstr::BString;
use clap::Clap;
use hashbrown::HashMap;
use tako::common::resources::{CpuRequest, ResourceRequest};
use tako::messages::common::{ProgramDefinition, StdioDef};
use crate::client::comma... |
}
struct StdioArg(StdioDef);
impl FromStr for StdioArg {
type Err = anyhow::Error;
fn from_str(s: &str) -> Result<Self, Self::Err> {
Ok(StdioArg(match s {
"none" => StdioDef::Null,
_ => StdioDef::File(s.into()),
}))
}
}
#[derive(Clap)]
#[clap(setting = clap::AppS... | r {
key: s[..position].into(),
value: s[position + 1..].into(),
},
None => ArgEnvironmentVar {
key: s.into(),
value: Default::default(),
},
};
Ok(var)
} | function_block-function_prefixed | [
{
"content": "pub fn deserialize_key(key: &str) -> anyhow::Result<SecretKey> {\n\n let data = hex::decode(key).context(\"Could not deserialize secret key\")?;\n\n let key = SecretKey::from_slice(&data).context(\"Could not create secret key from slice\")?;\n\n Ok(key)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tes... |
Rust | src/display/text_runs.rs | kas-gui/kas-text | 818515e319bf50a81306b8f64e2f19de6ba6e1f1 |
use super::TextDisplay;
use crate::conv::{to_u32, to_usize};
use crate::fonts::{fonts, FontId};
use crate::format::FormattableText;
use crate::{shaper, Action, Direction, Range};
use unicode_bidi::{BidiInfo, Level, LTR_LEVEL, RTL_LEVEL};
use xi_unicode::LineBreakIterator;
#[derive(Clone, Copy, Debug, PartialEq)]
pub... |
use super::TextDisplay;
use crate::conv::{to_u32, to_usize};
use crate::fonts::{fonts, FontId};
use crate::format::FormattableText;
use crate::{shaper, Action, Direction, Range};
use unicode_bidi::{BidiInfo, Level, LTR_LEVEL, RTL_LEVEL};
use xi_unicode::LineBreakIterator;
#[derive(Clone, Copy, Debug, PartialEq)]
pub... | ;
let mut levels = vec![];
let mut level: Level;
if bidi || default_para_level.is_none() {
levels = BidiInfo::new(text.as_str(), default_para_level).levels;
assert_eq!(text.str_len(), levels.len());
level = levels.get(0).cloned().unwrap_or(LTR_LEVEL);
... | match dir {
Direction::Auto => None,
Direction::LR => Some(LTR_LEVEL),
Direction::RL => Some(RTL_LEVEL),
} | if_condition | [
{
"content": "/// Access the [`FontLibrary`] singleton\n\npub fn fonts() -> &'static FontLibrary {\n\n &*LIBRARY\n\n}\n\n\n",
"file_path": "src/fonts/library.rs",
"rank": 0,
"score": 114531.3921757481
},
{
"content": "/// Text, optionally with formatting data\n\n///\n\n/// Any `F: Formatt... |
Rust | src/cmd.rs | deinferno/nl80211 | c4caba12ebdd3337fb121b5d061ac742cb895aa2 | use neli::consts::Cmd;
use neli::{impl_var, impl_var_base, impl_var_trait};
impl_var_trait!(
Nl80211Cmd, u8, Cmd,
CmdUnspec => 0,
CmdGetWiphy => 1,
CmdSetWiphy => 2,
CmdNewWiphy => 3,
CmdDelWiphy => ... | use neli::consts::Cmd;
use neli::{impl_var, impl_var_base, impl_var_trait};
impl_var_trait!(
Nl80211Cmd, u8, Cmd,
CmdUnspec => 0,
CmdGetWiphy => 1,
CmdSetWiphy => 2,
CmdNewWiphy => 3,
CmdDelWiphy => ... | 37,
CmdAssociate => 38,
CmdDeauthenticate => 39,
CmdDisassociate => 40,
CmdMichaelMicFailure => 41,
CmdRegBeaconHint => 42,
CmdJoinIbss => 43,
CmdLeaveIbss => 44,
CmdTestmode => 45,
CmdConne... | CmdSetMpath => 22,
CmdNewMpath => 23,
CmdDelMpath => 24,
CmdSetBss => 25,
CmdSetReg => 26,
CmdReqSetReg => 27,
CmdGetMeshConfig => 28,
CmdSetMeshConfig => 29,
CmdSetMgmtExtraI... | random | [
{
"content": "/// Parse a vec of bytes as u8\n\npub fn parse_u8(input: &Vec<u8>) -> u8 {\n\n let to_array =\n\n |slice: &[u8]| -> [u8; 1] { slice.try_into().expect(\"slice with incorrect length\") };\n\n\n\n u8::from_le_bytes(to_array(input))\n\n}\n\n\n",
"file_path": "src/parse_attr.rs",
"... |
Rust | src/backend/vulkan/swapchain.rs | arcana-engine/sierra | 42c0d7822cf707dcb9111d74d29176afd91363a6 | use super::{
convert::ToErupt as _,
device::{Device, WeakDevice},
physical::surface_capabilities,
surface::{surface_error_from_erupt, Surface},
unexpected_result,
};
use crate::{
format::Format,
image::{Image, ImageInfo, ImageUsage, Samples},
out_of_host_memory,
semaphore::Semaphore,... | use super::{
convert::ToErupt as _,
device::{Device, WeakDevice},
physical::surface_capabilities,
surface::{surface_error_from_erupt, Surface},
unexpected_result,
};
use crate::{
format::Format,
image::{Image, ImageInfo, ImageUsage, Samples},
out_of_host_memory,
semaphore::Semaphore,... |
}
| res.release;
Ok(SwapchainImage {
image: &image_and_semaphores.image,
wait,
signal,
owner: self.device.clone(),
handle: inner.handle,
supported_families: self.surface_capabilities.supported_families.clone(),
acquired_counter: &i... | function_block-function_prefixed | [
{
"content": "pub fn combined_stages_flags(stages: impl Iterator<Item = Stage>) -> u32 {\n\n stages.fold(0, |flags, stage| flags | stage.bit())\n\n}\n\n\n\nimpl Stages {\n\n pub fn bits(&self) -> u32 {\n\n combined_stages_flags(self.flags.iter().copied())\n\n }\n\n}\n\n\n",
"file_path": "pro... |
Rust | src/util.rs | ashtuchkin/rypt | 6cfe9ad1908f3563d2af954fd952c2f906cae8e8 | use failure::{Fail, Fallible};
use prost::Message;
use std::fs::Metadata;
use std::time::Duration;
static SCALES: &[&str; 7] = &["B", "KiB", "MiB", "GiB", "TiB", "PiB", "EiB"];
pub fn human_file_size(val: usize) -> String {
let filled_bits = (0usize.leading_zeros() - val.leading_zeros()) as i32;
let scale_idx... | use failure::{Fail, Fallible};
use prost::Message;
use std::fs::Metadata;
use std::time::Duration;
static SCALES: &[&str; 7] = &["B", "KiB", "MiB", "GiB", "TiB", "PiB", "EiB"];
|
pub fn human_duration(dur: Duration) -> String {
let mut time = dur.as_secs();
let secs = time % 60;
time /= 60;
let mins = time % 60;
time /= 60;
let hrs = time;
if hrs > 0 {
format!("{}:{:02}:{:02}", hrs, mins, secs)
} else {
format!("{}:{:02}", mins, secs)
}
}
p... | pub fn human_file_size(val: usize) -> String {
let filled_bits = (0usize.leading_zeros() - val.leading_zeros()) as i32;
let scale_idx = std::cmp::max(filled_bits - 1, 0) / 10;
let divider = 2.0f64.powi(scale_idx * 10);
let places = if scale_idx == 0 { 0 } else { 2 };
let scale = SCALES[(scale_idx ... | function_block-full_function | [
{
"content": "pub fn print_help(output: OutputStream, program_name: &str) -> Fallible<()> {\n\n let mut stdout = output.open(false)?;\n\n writeln!(\n\n stdout,\n\n \"\\\n\nUsage: {program_name} [OPTION].. [FILE]..\n\nEncrypt/decrypt FILE-s using passwords and/or public keys. \n\n\n\nCommands... |
Rust | src/error.rs | not-a-seagull/porcupine | 72e9857086f9a5f62f29048025ba8aea20e00df6 | /* -----------------------------------------------------------------------------------
* src/error.rs - Common error type to keep things simple.
* porcupine - Safe wrapper around the graphical parts of Win32.
* Copyright © 2020 not_a_seagull
*
* This project is licensed under either the Apache 2.0 license or the M... | /* -----------------------------------------------------------------------------------
* src/error.rs - Common error type to keep things simple.
* porcupine - Safe wra | E.
* -----------------------------------------------------------------------------------
* Apache 2.0 License Declaration:
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http... | pper around the graphical parts of Win32.
* Copyright © 2020 not_a_seagull
*
* This project is licensed under either the Apache 2.0 license or the MIT license, at
* your option. For more information, please consult the LICENSE-APACHE or LICENSE-MIT
* files in the repository root.
* -------------------------------... | random | [
{
"content": "type DropHandler = fn(NonNull<()>);\n\n\n\n/// The data stored in the extra memory of a window class.\n\n#[repr(C)]\n\npub(crate) struct ClassData<F> {\n\n /// The drop handler for the event handler.\n\n ///\n\n /// Putting this first allows us to drop the class data regardless of the\n\n... |
Rust | components/tikv_util/src/quota_limiter.rs | maxshuang/tikv | 9a43faf4da20389a4e2c262ee8ab8b369a3bfec4 |
use std::time::Duration;
use super::config::ReadableSize;
use super::time::Limiter;
use super::timer::GLOBAL_TIMER_HANDLE;
use cpu_time::ThreadTime;
use futures::compat::Future01CompatExt;
const CPU_TIME_FACTOR: f64 = 0.8;
const MAX_QUOTA_DELAY: Duration = Duration::from_secs(1);
#[derive(Debug)]
pub struct Quot... |
use std::time::Duration;
use super::config::ReadableSize;
use super::time::Limiter;
use super::timer::GLOBAL_TIMER_HANDLE;
use cpu_time::ThreadTime;
use futures::compat::Future01CompatExt;
const CPU_TIME_FACTOR: f64 = 0.8;
const MAX_QUOTA_DELAY: Duration = Duration::from_secs(1);
#[derive(Debug)]
pub struct Quot... |
pub fn new_sample(&self) -> Sample {
Sample {
read_bytes: 0,
write_bytes: 0,
cpu_time: Duration::ZERO,
enable_cpu_limit: !self.cputime_limiter.speed_limit().is_infinite(),
}
}
pub async fn async_consume(&self, sample: Sample) ... | let read_bandwidth_limiter = if read_bandwidth.0 == 0 {
Limiter::new(f64::INFINITY)
} else {
Limiter::new(read_bandwidth.0 as f64)
};
Self {
cputime_limiter,
write_bandwidth_limiter,
read_bandwidth_limiter,
}
} | function_block-function_prefix_line | [
{
"content": "#[inline]\n\npub fn duration_to_sec(d: Duration) -> f64 {\n\n let nanos = f64::from(d.subsec_nanos());\n\n d.as_secs() as f64 + (nanos / 1_000_000_000.0)\n\n}\n\n\n\n/// Converts Duration to microseconds.\n",
"file_path": "components/tikv_util/src/time.rs",
"rank": 0,
"score": 37... |
Rust | src/expr/src/linear.rs | gjlondon/materialize | 29efdc9d7f50891c461ffdd2727ab5d748c2a2a7 |
use serde::{Deserialize, Serialize};
use crate::{scalar::EvalError, RelationExpr, ScalarExpr};
use repr::{Datum, Row, RowArena, RowPacker};
#[derive(Clone, Debug, Eq, PartialEq, Serialize, Deserialize, Hash)]
pub struct MapFilterProject {
pub expressions: Vec<ScalarExpr>,
... |
use serde::{Deserialize, Serialize};
use crate::{scalar::EvalError, RelationExpr, ScalarExpr};
use repr::{Datum, Row, RowArena, RowPacker};
#[derive(Clone, Debug, Eq, PartialEq, Serialize, Deserialize, Hash)]
pub struct MapFilterProject {
pub expressions: Vec<ScalarExpr>,
... |
pub fn filter<I>(mut self, predicates: I) -> Self
where
I: IntoIterator<Item = ScalarExpr>,
{
for mut predicate in predicates {
predicate.permute(&self.projection[..]);
let max_support = predicate
... | pub fn project<I>(mut self, columns: I) -> Self
where
I: IntoIterator<Item = usize> + std::fmt::Debug,
{
self.projection = columns.into_iter().map(|c| self.projection[c]).collect();
self
} | function_block-full_function | [
{
"content": "/// Number of bytes required by the datum.\n\n///\n\n/// This is used to optimistically pre-allocate buffers for packing rows.\n\npub fn datum_size(datum: &Datum) -> usize {\n\n match datum {\n\n Datum::Null => 1,\n\n Datum::False => 1,\n\n Datum::True => 1,\n\n Datu... |
Rust | src/diagnostics/report.rs | olson-sean-k/wax | 22c4221bdee7417ed93fa5ebabdda49673460adf | #![cfg(feature = "diagnostics-report")]
use miette::{Diagnostic, LabeledSpan, SourceSpan};
use std::borrow::Cow;
use std::cmp;
use std::path::PathBuf;
use thiserror::Error;
use vec1::Vec1;
use crate::token::{self, TokenKind, Tokenized};
pub type BoxedDiagnostic<'t> = Box<dyn Diagnostic + 't>;
#[cfg_attr(docsrs, doc... | #![cfg(feature = "diagnostics-report")]
use miette::{Diagnostic, LabeledSpan, SourceSpan};
use std::borrow::Cow;
use std::cmp;
use std::path::PathBuf;
use thiserror::Error;
use vec1::Vec1;
use crate::token::{self, TokenKind, Tokenized};
pub type BoxedDiagnostic<'t> = Box<dyn Diagnostic + 't>;
#[cfg_attr(docsrs, doc... |
}
| let glob = Glob::new("**/foo/").unwrap();
let diagnostics: Vec<_> = glob.diagnostics().collect();
assert!(diagnostics.iter().any(|diagnostic| diagnostic
.code()
.map(|code| code.to_string() == CODE_TERMINATING_SEPARATOR)
.unwrap_or(false)));
} | function_block-function_prefix_line | [
{
"content": "pub fn components<'i, 't, A, I>(tokens: I) -> impl Iterator<Item = Component<'i, 't, A>>\n\nwhere\n\n 't: 'i,\n\n A: 't,\n\n I: IntoIterator<Item = &'i Token<'t, A>>,\n\n I::IntoIter: Clone,\n\n{\n\n tokens.into_iter().batching(|tokens| {\n\n let mut first = tokens.next();\n\... |
Rust | src/blockchain/esplora.rs | dspicher/magical-bitcoin-wallet | 462d413b02ec05b401d25dd7acb3237fcb522b4a | use std::collections::{HashMap, HashSet};
use futures::stream::{self, StreamExt, TryStreamExt};
#[allow(unused_imports)]
use log::{debug, error, info, trace};
use serde::Deserialize;
use reqwest::{Client, StatusCode};
use bitcoin::consensus::{deserialize, serialize};
use bitcoin::hashes::hex::ToHex;
use bitcoin::h... | use std::collections::{HashMap, HashSet};
use futures::stream::{self, StreamExt, TryStreamExt};
#[allow(unused_imports)]
use log::{debug, error, info, trace};
use serde::Deserialize;
use reqwest::{Client, StatusCode};
use bitcoin::consensus::{deserialize, serialize};
use bitcoin::hashes::hex::ToHex;
use bitcoin::h... | self) -> Result<usize, EsploraError> {
let req = self
.client
.get(&format!("{}/api/blocks/tip/height", self.url))
.send()
.await?;
Ok(req.error_for_status()?.text().await?.parse()?)
}
async fn _script_get_history(
&self,
script: ... | k_or(Error::OfflineClient)?
._get_tx(txid))?)
}
fn broadcast(&self, tx: &Transaction) -> Result<(), Error> {
Ok(await_or_block!(self
.0
.as_ref()
.ok_or(Error::OfflineClient)?
._broadcast(tx))?)
}
fn get_height(&self) -> Result<usize,... | random | [
{
"content": "pub fn get_checksum(desc: &str) -> Result<String, Error> {\n\n let mut c = 1;\n\n let mut cls = 0;\n\n let mut clscount = 0;\n\n for ch in desc.chars() {\n\n let pos = INPUT_CHARSET\n\n .find(ch)\n\n .ok_or(Error::InvalidDescriptorCharacter(ch))? as u64;\n\... |
Rust | examples/track-rs/ta/src/main.rs | zank0201/incubator-teaclave-trustzone-sdk | 0d379dae74cb2ebc356fa0d611721716ea43eb91 | #![feature(restricted_std)]
#![no_main]
use optee_utee::{
ta_close_session, ta_create, ta_destroy, ta_invoke_command, ta_open_session, trace_println,
};
use optee_utee::{AlgorithmId, Mac};
use optee_utee::{AttributeId, AttributeMemref, TransientObject, TransientObjectType};
use optee_utee::{Error, ErrorKind, Parame... | #![feature(restricted_std)]
#![no_main]
use optee_utee::{
ta_close_session, ta_create, ta_destroy, ta_invoke_command, ta_open_session, trace_println,
};
use optee_utee::{AlgorithmId, Mac};
use optee_utee::{AttributeId, AttributeMemref, TransientObject, TransientObjectType};
use optee_utee::{Error, ErrorKind, Parame... | umber_generate(_params);
}
_ => {
return Err(Error::new(ErrorKind::BadParameters));
}
}
}
const TA_FLAGS: u32 = 0;
const TA_DATA_SIZE: u32 =96 * 1024;
const TA_STACK_SIZE: u32 = 6 * 1024;
const TA_VERSION: &[u8] = b"0.1\0";
const TA_DESCRIPTION: &[u8] = b"This is an HOTP example... | te};
use ta_keygen::generate_key;
pub const SHA1_HASH_SIZE: usize = 20;
pub const MAX_KEY_SIZE: usize = 64;
pub const MIN_KEY_SIZE: usize = 10;
pub const DBC2_MODULO: u32 = 100000000;
#[ta_create]
fn create() -> Result<()> {
trace_println!("[+] TA create");
Ok(())
}
#[ta_open_session]
fn open_session(_params... | random | [
{
"content": "pub fn get_hotp(hotp: &mut Operations, params: &mut Parameters) -> Result<()> {\n\n let mut mac: [u8; SHA1_HASH_SIZE] = [0x0; SHA1_HASH_SIZE];\n\n\n\n hotp.counter = get_time(hotp);\n\n hmac_sha1(hotp, &mut mac)?;\n\n trace_println!(\"[+] Hmac value = {:?}\",&mac);\n\n\n\n let hotp_... |
Rust | src/lib.rs | Aetf/fit2 | e6b9ce05444e65c641291e32ec6347727e6989a1 | use futures::future::poll_fn;
use lambda_http::{
request::{ApiGatewayRequestContext, ApiGatewayV2RequestContext, Http, RequestContext},
Body as LambdaBody, Context, Request as LambdaRequest, RequestExt as _, Response,
};
use hyper::service::Service as _;
use routerify::RequestServiceBuilder;
use simple_logger:... | use futures::future::poll_fn;
use lambda_http::{
request::{ApiGatewayRequestContext, ApiGatewayV2RequestContext, Http, RequestContext},
Body as LambdaBody, Context, Req | str {
let paths: &ApiGatewayPath = self.extensions().get().expect("no apigateway path");
&paths.base_path
}
}
struct ApiGatewayPath {
base_path: String,
}
impl ApiGatewayPath {
pub fn from_req(req: &LambdaRequest) -> Self {
let base_path = match req.request_context() {
... | uest as LambdaRequest, RequestExt as _, Response,
};
use hyper::service::Service as _;
use routerify::RequestServiceBuilder;
use simple_logger::SimpleLogger;
use std::net::{Ipv4Addr, SocketAddr};
mod adaptor;
mod core;
pub mod error;
mod ext;
mod route;
use adaptor::prelude::*;
use error::*;
use crate::ext::Query;
... | random | [
{
"content": "pub trait IntoHyperBody: Sized {\n\n fn into_bytes(self) -> Bytes;\n\n fn into_hyper_body(self) -> hyper::Body {\n\n self.into_bytes().into()\n\n }\n\n}\n\n\n",
"file_path": "src/adaptor.rs",
"rank": 3,
"score": 17238.46736061178
},
{
"content": "pub fn router()... |
Rust | src/content_set.rs | PoignardAzur/disney-streaming-clone | 200ecf50f4fcbc3e28040d8dbb2b2bf35f830918 | use smallvec::{smallvec, SmallVec};
use tracing::{trace_span, Span};
use widget_cruncher::promise::PromiseToken;
use widget_cruncher::widget::prelude::*;
use widget_cruncher::widget::{AsWidgetPod, ClipBox, Flex, Label, SizedBox, Spinner, WidgetPod};
use widget_cruncher::Point;
use crate::thumbnail::{Thumbnail, THUMBN... | use smallvec::{smallvec, SmallVec};
use tracing::{trace_span, Span};
use widget_cruncher::promise::PromiseToken;
use widget_cruncher::widget::prelude::*;
use widget_cruncher::widget::{AsWidgetPod, ClipBox, Flex, Label, SizedBox, Spinner, WidgetPod};
use widget_cruncher::Point;
use crate::thumbnail::{Thumbnail, THUMBN... | _state,
ClipBox::new(titles).constrain_vertical(true),
);
},
);
ctx.skip_child(&mut self.children);
return;
... | o_iter().enumerate() {
titles = titles.with_child(Thumbnail::new(row, column, child));
}
flex.add_child(
flex | random | [
{
"content": "// Loads and parses https://cd-static.bamgrid.com/dp-117731241344/home.json\n\nfn load_collection(url: &str) -> Result<Vec<ContentSetMetadata>, reqwest::Error> {\n\n let json: serde_json::Value = reqwest::blocking::get(url)?.json()?;\n\n let containers = json[\"data\"][\"StandardCollection\"... |
Rust | src/ui/no_yaml.rs | eppixx/reel-moby | b6dbcd8ebac2aa0220455883b723d785b4ceb6c4 | use std::{io, thread};
use termion::event::Key;
use termion::raw::IntoRawMode;
use tui::backend::TermionBackend;
use tui::layout::{Constraint, Direction, Layout};
use tui::Terminal;
use crate::widget::details;
use crate::widget::info;
use crate::widget::repo_entry;
use crate::widget::tag_list;
use crate::Opt;
#[deri... | use std::{io, thread};
use termion::event::Key;
use termion::raw::IntoRawMode;
use tui::backend::TermionBackend;
use tui::layout::{Constraint, Direction, Layout};
use tui::Terminal;
use crate::widget::details;
use crate::widget::info;
use crate::widget::repo_entry;
use crate::widget::tag_list;
use crate::Opt;
#[deri... |
}
pub struct NoYaml {
state: State,
repo: repo_entry::RepoEntry,
tags: tag_list::TagList,
details: details::Details,
info: info::Info,
}
impl NoYaml {
pub fn run(opt: &Opt) {
let (repo, load_repo) = match &opt.repo {
None => (
repo_entry::RepoEntry::new(
... | fn next(&mut self) -> Option<Self::Item> {
match self {
State::EditRepo => *self = State::SelectTag,
State::SelectTag => *self = State::EditRepo,
}
Some(self.clone())
} | function_block-full_function | [
{
"content": "/// checks the repo name and may add a prefix for official images\n\npub fn check_repo(name: &str) -> Result<String, Error> {\n\n let repo = match repo::split_tag_from_repo(name) {\n\n Err(e) => return Err(Error::Converting(format!(\"{}\", e))),\n\n Ok((name, _)) => name,\n\n }... |
Rust | src/targets/mod.rs | sunshowers/cfg-expr | caa5d74415ea53bf439d4bb623a4ceb3c13719ec | use crate::error::Reason;
mod list;
pub use list::ALL_TARGETS as ALL;
macro_rules! target_enum {
(
$(#[$outer:meta])*
pub enum $kind:ident {
$(
$(#[$inner:ident $($args:tt)*])*
$name:ident $(= $value:expr)?,
)+
}
) => {
$... | use crate::error::Reason;
mod list;
pub use list::ALL_TARGETS as ALL;
macro_rules! target_enum {
(
$(#[$outer:meta])*
pub enum $kind:ident {
$(
$(#[$inner:ident $($args:tt)*])*
$name:ident $(= $value:expr)?,
)+
}
) => {
$... | );
}
}
| 6,
super::ALL
.iter()
.filter(|ti| ti.os == Some(super::Os::ios))
.count()
| function_block-random_span | [
{
"content": "#[test]\n\nfn target_family() {\n\n let matches_any_family = Expression::parse(\"any(unix, target_family = \\\"windows\\\")\").unwrap();\n\n let impossible = Expression::parse(\"all(windows, target_family = \\\"unix\\\")\").unwrap();\n\n\n\n for target in all {\n\n match target.fam... |
Rust | src/metadata.rs | stegaBOB/metabob | 37567e4c628e3a7570280700fd5fc91d2f847e1c | use crate::limiter::create_rate_limiter;
use crate::{
constants::{MAX_NAME_LENGTH, MAX_SYMBOL_LENGTH, MAX_URI_LENGTH, USE_RATE_LIMIT},
parse::parse_solana_config,
};
use anyhow::Result;
use indicatif::ParallelProgressIterator;
use log::{error, info};
use mpl_token_metadata::{
instruction::sign_metadata, sta... | use crate::limiter::create_rate_limiter;
use crate::{
constants::{MAX_NAME_LENGTH, MAX_SYMBOL_LENGTH, MAX_URI_LENGTH, USE_RATE_LIMIT},
parse::parse_solana_config,
};
use anyhow::Result;
use indicatif::ParallelProgressIterator;
use log::{error, info};
use mpl_token_metadata::{
instruction::sign_metadata, sta... | ;
let sig = res?;
Ok(sig)
}
| retry(
Exponential::from_millis_with_factor(250, 2.0).take(3),
|| client.send_and_confirm_transaction(&tx),
) | call_expression | [
{
"content": "pub fn decode_metadata_account(account: &Account) -> Result<Metadata, DecodeError> {\n\n let account_data = account.data.as_slice();\n\n let metadata: Result<Metadata, Error> = try_from_slice_unchecked(account_data);\n\n let token_metadata = match metadata {\n\n Ok(m) => m,\n\n ... |
Rust | src/shell.rs | afnanenayet/Enayet-Shell | 6509126a05755ae6c64a9271379047ea079afd63 |
use std::path::PathBuf;
use std::env;
use parser;
#[derive(Debug)]
#[derive(Default)]
pub struct Shell {
working_dir: PathBuf,
input_history: Vec<String>,
output_count: u64,
paths: Vec<String>,
}
impl Shell {
fn default() -> Shell {
Shell {
... |
use std::path::PathBuf;
use std::env;
use parser;
#[derive(Debug)]
#[derive(Default)]
pub struct Shell {
working_dir: PathBuf,
input_history: Vec<String>,
output_count: u64,
paths: Vec<String>,
}
impl Shell {
fn default() -> Shell {
Shell {
... | ");
let mut shell = Shell::default();
let def_paths_vec = create_default_path_vec();
let fp_str = tmp_dir.as_path().to_str().unwrap();
parser::config::create_default_config(&fp_str, &def_paths_vec);
shell.load_paths(Some(&fp_str), &def_paths_vec);
assert!(shell.... | r::config::create_default_config;
fn create_default_path_vec() -> Vec<String> {
vec![
"/usr/bin".to_string(),
"/usr/local/bin".to_string(),
"/bin/".to_string(),
]
}
#[test]
fn test_default_shell_init() {
let shell = Shell::defa... | random | [
{
"content": "// Checks to see if path/file exists. Returns whether path string is\n\n// valid and points to something the shell can access\n\npub fn verify_path(path: &str) -> bool {\n\n let full_path = expand_path(path);\n\n Path::new(full_path.as_str()).exists()\n\n}\n\n\n",
"file_path": "src/parse... |
Rust | src/cluster.rs | andrewvy/axiom | 6c5c41b5a58d7ff75ffd62d45e30d18d7ab3e083 |
use crate::prelude::*;
use log::{error, info};
use secc::*;
use std::collections::HashMap;
use std::io::prelude::*;
use std::io::{BufReader, BufWriter};
use std::net::{SocketAddr, TcpListener, TcpStream};
use std::sync::atomic::{AtomicBool, Ordering};
use std::sync::{Arc, RwLock};
use std::sync::{Condvar, Mutex};
use... |
use crate::prelude::*;
use log::{error, info};
use secc::*;
use std::collections::HashMap;
use std::io::prelude::*;
use std::io::{BufReader, BufWriter};
use std::net::{SocketAddr, TcpListener, TcpStream};
use std::sync::atomic::{AtomicBool, Ordering};
use std::sync::{Arc, RwLock};
use std::sync::{Condvar, Mutex};
use... | let system = self.data.system.clone();
let address = self.data.listen_address.clone();
let manager = self.clone();
thread::spawn(move || {
system.init_current();
let sys_uuid = system.uuid();
let listener = TcpListener::bind(address).unwrap();
inf... | ad::JoinHandle;
use std::time::Duration;
use uuid::Uuid;
struct ConnectionData {
pub system_uuid: Uuid,
pub address: SocketAddr,
pub sender: SeccSender<WireMessage>,
pub receiver: SeccReceiver<WireMessage>,
pub tx_handle: JoinHandle<()>,
pub rx_handle: JoinHandle<(... | random | [
{
"content": "//! Implements the [`ActorSystem`] and related types of Axiom.\n\n//!\n\n//! When the [`ActorSystem`] starts up, a number of Reactors will be spawned that will iterate over\n\n//! Actor's inbound messages, processing them asynchronously. Actors will be ran as many times as\n\n//! they can over a g... |
Rust | src/traits/json.rs | rsnodgrass/helium-wallet-rs | 620ef5cd9cf5fe7f8bb830c22a177dd3262a2f1b | use crate::{
keypair::PublicKey,
result::{anyhow, Result},
traits::B64,
};
use helium_proto::*;
use serde_json::json;
pub(crate) fn maybe_b58(data: &[u8]) -> Result<Option<String>> {
if data.is_empty() {
Ok(None)
} else {
Ok(Some(PublicKey::from_bytes(data)?.to_string()))
}
}
p... | use crate::{
keypair::PublicKey,
result::{anyhow, Result},
traits::B64,
};
use helium_proto::*;
use serde_json::json;
pub(crate) fn maybe_b58(data: &[u8]) -> Result<Option<String>> {
if data.is_empty() {
Ok(None)
} else {
Ok(Some(PublicKey::from_bytes(data)?.to_string()))
}
}
p... |
}
fn vec_to_strings(vec: &[Vec<u8>]) -> Result<Vec<String>> {
let mut seq = Vec::with_capacity(vec.len());
for entry in vec {
seq.push(String::from_utf8(entry.to_vec())?);
}
Ok(seq)
}
fn vec_to_b58s(vec: &[Vec<u8>]) -> Result<Vec<String>> {
let mut seq = Vec::with_capacity(vec.len());
... | to_json(&self) -> Result<serde_json::Value> {
let mut seq = Vec::with_capacity(self.len());
for entry in self {
seq.push(entry.to_json()?)
}
Ok(json!(seq))
} | function_block-function_prefixed | [] |
Rust | cynthia/src/utils/read_buf.rs | nephele-rs/cynthia | c512a88e51c9723b4b9b9d8addb9dfc4aa118f5e | #![allow(clippy::transmute_ptr_to_ptr)]
use std::fmt;
use std::mem::{self, MaybeUninit};
pub struct ReadBuf<'a> {
buf: &'a mut [MaybeUninit<u8>],
filled: usize,
initialized: usize,
}
impl<'a> ReadBuf<'a> {
#[inline]
pub fn new(buf: &'a mut [u8]) -> ReadBuf<'a> {
let initialized = buf.len(... | #![allow(clippy::transmute_ptr_to_ptr)]
use std::fmt;
use std::mem::{self, MaybeUninit};
pub struct ReadBuf<'a> {
buf: &'a mut [MaybeUninit<u8>],
filled: usize,
initialized: usize,
}
impl<'a> ReadBuf<'a> {
#[inline]
pub fn new(buf: &'a mut [u8]) -> ReadBuf<'a> { | unsafe { mem::transmute::<&[MaybeUninit<u8>], &[u8]>(slice) }
}
#[inline]
pub fn filled_mut(&mut self) -> &mut [u8] {
let slice = &mut self.buf[..self.filled];
unsafe { mem::transmute::<&mut [MaybeUninit<u8>], &mut [u8]>(slice) }
}
#[inline]
pub fn take(&mut self, n: usi... |
let initialized = buf.len();
let buf = unsafe { mem::transmute::<&mut [u8], &mut [MaybeUninit<u8>]>(buf) };
ReadBuf {
buf,
filled: 0,
initialized,
}
}
#[inline]
pub fn uninit(buf: &'a mut [MaybeUninit<u8>]) -> ReadBuf<'a> {
ReadBu... | random | [
{
"content": "pub fn repeat(byte: u8) -> Repeat {\n\n Repeat { byte }\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct Repeat {\n\n byte: u8,\n\n}\n\n\n\nimpl AsyncRead for Repeat {\n\n #[inline]\n\n fn poll_read(self: Pin<&mut Self>, _: &mut Context<'_>, buf: &mut [u8]) -> Poll<Result<usize>> {\n\n ... |
Rust | day_12/src/main.rs | Sousa99/AdventOfCode2020 | f8ce5008e688d50d818eabfea13e4da47e934744 | use std::fs::File;
use std::io::{BufRead, BufReader};
type CoordinateUnit = f32;
type Coordinates = (CoordinateUnit, CoordinateUnit);
#[derive(Copy, Clone)]
enum Operation {
MoveNorth,
MoveSouth,
MoveEast,
MoveWest,
RotateLeft,
RotateRight,
MoveForward,
}
struct Ferry {
position... | use std::fs::File;
use std::io::{BufRead, BufReader};
type CoordinateUnit = f32;
type Coordinates = (CoordinateUnit, CoordinateUnit);
#[derive(Copy, Clone)]
enum Operation {
MoveNorth,
MoveSouth,
MoveEast,
MoveWest,
RotateLeft,
RotateRight,
MoveForward,
}
struct Ferry {
position... |
}
fn get_operation_to_code(code : &str) -> Operation {
let operation : Operation = match code {
"N" => Operation::MoveNorth,
"S" => Operation::MoveSouth,
"E" => Operation::MoveEast,
"W" => Operation::MoveWest,
"L" => Operation::RotateLeft,
"R" => Operation::RotateR... | fn run_operation(&mut self, operation : Operation, value : CoordinateUnit) {
match operation {
Operation::MoveNorth => self.move_north(value),
Operation::MoveSouth => self.move_south(value),
Operation::MoveEast => self.move_east(value),
Operation::MoveWest => self... | function_block-full_function | [
{
"content": "type Coordinates = (CoordinateUnit, CoordinateUnit);\n\n\n",
"file_path": "day_24/src/main.rs",
"rank": 2,
"score": 117577.64285189944
},
{
"content": "type Coordinates4D = (CoordinateUnit, CoordinateUnit, CoordinateUnit, CoordinateUnit);\n\n\n\n// -------------- State --------... |
Rust | src/ipv6/network.rs | little-dude/ipaddr | 4836a0c8d6dc115d5a60314ba2d95e3900e9c1dc | use std::fmt;
use std::str::FromStr;
use {Ipv6Address, Ipv6Mask, ParsingFailed};
#[derive(Copy, Clone, Eq, PartialEq, Hash)]
pub struct Ipv6Network(Ipv6Address, Ipv6Mask);
impl Ipv6Network {
pub fn new(ip: Ipv6Address, mask: Ipv6Mask) -> Self {
Ipv6Network(ip, mask)
}
pub fn host(&self) -> ... | use std::fmt;
use std::str::FromStr;
use {Ipv6Address, Ipv6Mask, ParsingFailed};
#[derive(Copy, Clone, Eq, PartialEq, Hash)]
pub struct Ipv6Network(Ipv6Address, Ipv6Mask);
impl Ipv6Network {
pub fn new(ip: Ipv6Address, mask: Ipv6Mask) -> Self {
Ipv6Network(ip, mask)
}
pub fn host(&self) -> ... |
fn get_net(prefix: u8) -> Ipv6Network {
Ipv6Network::new(IP.into(), Ipv6Mask::from_prefixlen(prefix).unwrap())
}
#[test]
fn test_network() {
assert_eq!(
get_net(16).network(),
Ipv6Address::from_str("fe80::").unwrap()
);
assert_eq!(
g... | let s = "fe80::aef4:1242:24e6:c81/ffff:ffff:ffff:ffff::";
assert_eq!(Ipv6Network::from_str(s).unwrap(), expected);
let s = "fe80::aef4:1242:24e6:c81/0";
let expected = Ipv6Network::new(IP.into(), Ipv6Mask::try_from(0).unwrap());
assert_eq!(Ipv6Network::from_str(s).unwrap(), expected);
... | function_block-function_prefix_line | [
{
"content": "/// Check whether the given integer represents a valid IPv6 mask.\n\n// see https://codereview.stackexchange.com/a/197138/118470\n\nfn is_valid_mask(value: u128) -> bool {\n\n value.count_zeros() == value.trailing_zeros()\n\n}\n\n\n\n#[derive(Copy, Clone, PartialEq, Eq, Hash)]\n\npub struct Ipv... |
Rust | iroha_logger/src/lib.rs | EmelianPiker/iroha | d6097b81572554444b2e9a9a560c581006fc895a | use chrono::prelude::*;
use log::{Level, Log, Metadata, Record, SetLoggerError};
use std::sync::RwLock;
const RED: u8 = 31;
const GREEN: u8 = 32;
const YELLOW: u8 = 33;
const BLUE: u8 = 34;
const MAGENTA: u8 = 35;
lazy_static::lazy_static! {
static ref LOGGER_SET: RwLock<bool> = RwLock::new(false);
}
#[derive(De... | use chrono::prelude::*;
use log::{Level, Log, Metadata, Record, SetLoggerError};
use std::sync::RwLock;
const RED: u8 = 31;
const GREEN: u8 = 32;
const YELLOW: u8 = 33;
const BLUE: u8 = 34;
const MAGENTA: u8 = 35;
lazy_static::lazy_static! {
static ref LOGGER_SET: RwLock<bool> = RwLock::new(false);
}
#[derive(De... |
}
| fn init_logger() {
init(&LoggerConfiguration {
max_log_level: LevelFilter::Trace,
terminal_color_enabled: true,
date_time_format: "%Y-%m-%d %H:%M:%S:%f".to_string(),
})
.expect("Failed to initialize logger.");
println!("Max level: {}", log::max_level()... | function_block-full_function | [
{
"content": "pub fn new(configuration: &Configuration) -> Self {\n\n Client {\n\n torii_url: configuration.torii_url.clone(),\n\n //TODO: The `public_key` from `configuration` will be different. Fix this inconsistency.\n\n key_pair: KeyPair::generate().expect(\"Failed to generate KeyPai... |
Rust | link-types/src/lib.rs | Vociferix/sniffle | aa0ad27d4317e4ca9b760ae3c623775fe8004733 | #![doc = include_str!("../README.md")]
use std::hash::Hash;
#[derive(Debug, Clone, Copy, Hash, PartialEq, Eq)]
#[repr(transparent)]
pub struct LinkType(pub u16);
macro_rules! link_type {
($name:ident, $val:literal) => {
pub const $name: LinkType = LinkType($val);
};
}
#[macro_export]
macro_rules! fo... | #![doc = include_str!("../README.md")]
use std::hash::Hash;
#[derive(Debug, Clone, Copy, Hash, PartialEq, Eq)]
#[repr(transparent)]
pub struct LinkType(pub u16);
macro_rules! link_type {
($name:ident, $val:literal) => {
pub const $name: LinkType = LinkType($val);
};
}
#[macro_export]
macro_rules! fo... | SO_14443, 264);
link_type!(RDS, 265);
link_type!(USB_DARWIN, 266);
link_type!(SDLC, 268);
link_type!(LORATAP, 270);
link_type!(VSOCK, 271);
link_type!(NORDIC_BLE, 272);
link_type!(DOCSIS31_XRA31, 273);
link_type!(ETHERNET_MPACKET, 274);
link_type!(DISPLAYPORT_AUX, 275);
link_type... | ;
link_type!(IEEE802_11_RADIOTAP, 127);
link_type!(ARCNET_LINUX, 129);
link_type!(APPLE_IP_OVER_IEEE1394, 138);
link_type!(MTP2_WITH_PHDR, 139);
link_type!(MTP2, 140);
link_type!(MTP3, 141);
link_type!(SCCP, 142);
link_type!(DOCSIS, 143);
link_type!(LINUX_IRDA, 144);
link_type!(U... | random | [
{
"content": "pub trait AsDeviceName {\n\n fn as_device_name(&self) -> &str;\n\n}\n\n\n\nimpl AsDeviceName for Device {\n\n fn as_device_name(&self) -> &str {\n\n self.name()\n\n }\n\n}\n\n\n\nimpl<T: AsRef<str>> AsDeviceName for T {\n\n fn as_device_name(&self) -> &str {\n\n self.as_r... |
Rust | src/spis0.rs | cvetaevvitaliy/nrf52840-pac | bf07243a5a043883d915999f0f8ccd6cbf6229b8 | #[doc = r" Register block"]
#[repr(C)]
pub struct RegisterBlock {
_reserved0: [u8; 36usize],
#[doc = "0x24 - Acquire SPI semaphore"]
pub tasks_acquire: TASKS_ACQUIRE,
#[doc = "0x28 - Release SPI semaphore, enabling the SPI slave to acquire it"]
pub tasks_release: TASKS_RELEASE,
_reserved1: [u8; ... | #[doc = r" Register block"]
#[repr(C)]
pub struct RegisterBlock {
_reserved0: [u8; 36usize],
#[doc = "0x24 - Acquire SPI semaphore"]
pub tasks_acquire: TASKS_ACQUIRE,
#[doc = "0x28 - Release SPI semaphore, enabling the SPI slave to acquire it"]
pub tasks_release: TASKS_RELEASE,
_reserved1: [u8; ... | c = "Semaphore status register"]
pub struct SEMSTAT {
register: ::vcell::VolatileCell<u32>,
}
#[doc = "Semaphore status register"]
pub mod semstat;
#[doc = "Status from last transaction"]
pub struct STATUS {
register: ::vcell::VolatileCell<u32>,
}
#[doc = "Status from last transaction"]
pub mod status;
#[doc = ... | ; 244usize],
#[doc = "0x400 - Semaphore status register"]
pub semstat: SEMSTAT,
_reserved7: [u8; 60usize],
#[doc = "0x440 - Status from last transaction"]
pub status: STATUS,
_reserved8: [u8; 188usize],
#[doc = "0x500 - Enable SPI slave"]
pub enable: ENABLE,
_reserved9: [u8; 4usize],... | random | [
{
"content": "#[doc = \"RXD data pointer\"]\n\npub struct PTR {\n\n register: ::vcell::VolatileCell<u32>,\n\n}\n\n#[doc = \"RXD data pointer\"]\n\npub mod ptr;\n\n#[doc = \"Maximum number of bytes in receive buffer\"]\n\npub struct MAXCNT {\n\n register: ::vcell::VolatileCell<u32>,\n\n}\n\n#[doc = \"Maxim... |
Rust | src/config.rs | jessebraham/camper | 25f0dfd2f153be50937b8abde6bfd9a9a2cf07dc | use std::{
fmt::{Display, Formatter, Result as FmtResult},
fs,
io::Write as _,
path::PathBuf,
};
use anyhow::{bail, Context, Result};
use directories::UserDirs;
use serde::{Deserialize, Serialize};
use crate::format::Format;
#[derive(Debug, Default, Clone, Deserialize, Serialize)]
pub struct Config {... | use std::{
fmt::{Display, Formatter, Result as FmtResult},
fs,
io::Write as _,
path::PathBuf,
};
use anyhow::{bail, Context, Result};
use directories::UserDirs;
use serde::{Deserialize, Serialize};
use crate::format::Format;
#[derive(Debug, Default, Clone, Deserialize, Serialize)]
pub struct Config {... |
pub fn is_valid(&self) -> bool {
let fan_id_cfgd = match self.fan_id {
Some(id) if id > 0 => true,
_ => false,
};
let identity_cfgd = match &self.identity {
Some(ident) if !ident.is_empty() => true,
_ => false,
};
let librar... | f !path.exists() {
fs::File::create(&path).with_context(|| {
format!("unable to create configuration file '{}'", path.display())
})?;
}
let mut file = fs::OpenOptions::new().write(true).open(&path)?;
let toml = toml::to_string(self)?;
write!(file... | function_block-function_prefixed | [] |
Rust | necsim/impls/no-std/src/decomposition/equal/test.rs | MomoLangenstein/necsim-rust | d19045e2e36afdd33b254ad5fbcd10daa9ccbaf7 | use core::{convert::TryFrom, num::NonZeroU32};
use hashbrown::HashMap;
use necsim_core::cogs::{Backup, Habitat};
use necsim_core_maths::IntrinsicsMathsCore;
use necsim_partitioning_core::partition::Partition;
use crate::{
cogs::habitat::{non_spatial::NonSpatialHabitat, spatially_implicit::SpatiallyImplicitHabita... | use core::{convert::TryFrom, num::NonZeroU32};
use hashbrown::HashMap;
use necsim_core::cogs::{Backup, Habitat};
use necsim_core_maths::IntrinsicsMathsCore;
use necsim_partitioning_core::partition::Partition;
use crate::{
cogs::habitat::{non_spatial::NonSpatialHabitat, spatially_implicit::SpatiallyImplicitHabita... | local,
8,
meta,
partition,
decomposition,
indices.len(),
indices,
);
let num_indices = u32::try_from(indices.len()).expect(&assert_message);
... | (num_indices, partition, "{}", &assert_message);
} else {
assert!(num_indices > 0, "{}", assert_message);
assert!(num_indices < partition, "{}", assert_message);
assert!(
u64::from(num_indices) == (u64::from(width) * u64... | random | [
{
"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<NonNegativeF64>) {\n\n let size = habitat.num_rows() * habitat.num_columns();\n\n... |
Rust | src/process.rs | reaandrew/shtats | 940a23bb9192869d0038f35f987257e65734f66d | use std::fs::File;
use std::io::{ BufReader, Read, Write};
use std::path::Path;
use std::process::{ChildStdout, Command, Stdio};
use serde_json::{Value};
use crate::collectors::commits_by_day::CommitsByDayCollector;
use crate::collectors::commits_by_file_extension::CommitsByFileExtension;
use crate::collectors::files_b... | use std::fs::File;
use std::io::{ BufReader, Read, Write};
use std::path::Path;
use std::process::{ChildStdout, Command, Stdio};
use serde_json::{Value};
use crate::collectors::commits_by_day::CommitsByDayCollector;
use crate::collectors::commits_by_file_extension::CommitsByFileExtension;
use crate::collectors::files_b... |
}
impl GitExecutor for ProcessGitExecutor {
fn execute(&self, args: Vec<String>, path: &Path) -> result::Result<GitCommitIterator> {
let stdout = self.execute_git(args, path)?;
let buf_reader = BufReader::new(stdout);
let reader = StdoutGitLogReader { stdout: buf_reader };
Ok(GitCo... | h)?;
let child = Command::new("git")
.current_dir(path)
.args(args)
.stdout(Stdio::piped())
.spawn()?;
let stdout = child.stdout.unwrap();
Ok(stdout)
} | function_block-function_prefixed | [
{
"content": "pub fn git_log(path: &PathBuf){\n\n let mut git_log = Command::new(\"git\");\n\n git_log.args(vec![\n\n \"log\",\n\n \"--oneline\"\n\n ]);\n\n git_log.stdout(Stdio::piped());\n\n let _output = git_log.current_dir(\n\n &path\n\n ).output().expect(\"failed to e... |
Rust | src/shader/uniform.rs | seventh-chord/gondola | 4122966e5cf2cdd7947b2891c1906dfdf71406f2 |
use std::fmt;
use gl;
use gl::types::*;
use cable_math::{Mat4, Vec2, Vec3, Vec4};
pub struct UniformBinding {
pub name: String,
pub location: GLint,
pub kind: UniformKind,
}
pub trait UniformValue: Sized {
const KIND: UniformKind;
unsafe fn set_uniform(data: &Self, location: GLint);
unsafe... |
use std::fmt;
use gl;
use gl::types::*;
use cable_math::{Mat4, Vec2, Vec3, Vec4};
pub struct UniformBinding {
pub name: String,
pub location: GLint,
pub kind: UniformKind,
}
pub trait UniformValue: Sized {
const KIND: UniformKind;
unsafe fn set_uniform(data: &Self, location: GLint);
unsafe... |
}
| fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
use self::UniformKind::*;
let name = match *self {
F32 => "f32",
VEC2_F32 => "Vec2<f32>",
VEC3_F32 => "Vec3<f32>",
VEC4_F32 => "Vec4<f32>",
MAT4_F32 => "Mat4<f32>",
I32 ... | function_block-full_function | [
{
"content": "/// Enables/disables the OpenGL scissor test. The given region is in screen space, that is, in the\n\n/// same coordinate system as [`viewport`]. Anything drawn outside this region will be discarded.\n\n///\n\n/// `gl::Scissor` takes integers as parameters the given regions coordinates will be ca... |
Rust | ed25519-jni/src/lib.rs | Concordium/concordium-java-sdk | 4de276479acb99ef1fb5ccea615921acd7ae25a0 | use core::convert::Into;
use core::slice;
use ed25519_dalek::*;
use jni::objects::JClass;
use jni::sys::{jbyteArray, jint};
use jni::JNIEnv;
use std::convert::{From, TryFrom};
const SUCCESS: i32 = 0;
const NATIVE_CONVERSION_ERROR: i32 = 1;
const MALFORMED_SECRET_KEY: i32 = 2;
const MALFORMED_PUBLIC_KEY: i32 = 3;
const... | use core::convert::Into;
use core::slice;
use ed25519_dalek::*;
use jni::objects::JClass;
use jni::sys::{jbyteArray, jint};
use jni::JNIEnv;
use std::convert::{From, TryFrom};
const SUCCESS: i32 = 0;
const NATIVE_CONVERSION_ERROR: i32 = 1;
const MALFORMED_SECRET_KEY: i32 = 2;
const MALFORMED_PUBLIC_KEY: i32 = 3;
const... | nvert_byte_array(sig_bytes) {
Ok(x) => x,
_ => return NATIVE_CONVERSION_ERROR,
};
let signature: Signature = match Signature::try_from(&signature_bytes[..]) {
Ok(sig) => sig,
_ => return NATIVE_CONVERSION_ERROR,
};
match public_key.verify(&message_bytes, &signature) {
... | _crypto_ed25519_ED25519_verify(
env: JNIEnv,
_class: JClass,
pub_key_bytes: jbyteArray,
msg_bytes: jbyteArray,
sig_bytes: jbyteArray,
) -> jint {
let public_key_bytes = match env.convert_byte_array(pub_key_bytes) {
Ok(x) => x,
_ => return NATIVE_CONVERSION_ERROR,
};
let p... | function_block-random_span | [
{
"content": " private final boolean success;\n",
"file_path": "concordium-sdk/src/main/java/com/concordium/sdk/responses/transactionstatus/ResumedResult.java",
"rank": 0,
"score": 89515.34426715277
},
{
"content": " private final Map<Index, Map<Index, byte[]>> signatures = new TreeMap... |
Rust | src/main.rs | benjione/iot_webhook_server | 2e35274013821d2513a3d82a3fb0fd3a4b232ebb | #[macro_use]
extern crate diesel;
use actix::*;
use actix_files as fs;
use actix_identity::Identity;
use actix_identity::{CookieIdentityPolicy, IdentityService};
use actix_web::{error, get, http, web, App, Error, HttpResponse, HttpServer};
use diesel::SqliteConnection;
use tera::Context;
use tera::Tera;
mod api;
mod... | #[macro_use]
extern crate diesel;
use actix::*;
use actix_files as fs;
use actix_identity::Identity;
use actix_identity::{CookieIdentityPolicy, IdentityService};
use actix_web::{error, get, http, web, App, Error, HttpResponse, HttpServer};
use diesel::SqliteConnection;
use tera::Context;
use tera::Tera;
mod api;
mod... |
#[get("/profile")]
async fn profile(
id: Identity,
tmpl: web::Data<tera::Tera>,
pool: web::Data<Pool>,
) -> Result<HttpResponse, Error> {
match only_allowed_for_logged_in_user(&id) {
Some(ret) => return Ok(ret),
_ => {}
};
let mut context = Context::new();
context = check_l... | let mut context = Context::new();
context = check_logged_in_user(&id, context);
context.insert("title", &"signup");
let s = tmpl
.render("signup.html", &context)
.map_err(|_| error::ErrorInternalServerError("Template error"))?;
Ok(HttpResponse::Ok().content_type("text/html").body(s))
} | function_block-function_prefix_line | [
{
"content": "type Pool = diesel::r2d2::Pool<diesel::r2d2::ConnectionManager<SqliteConnection>>;\n\n\n\n#[derive(Serialize, Deserialize, Queryable)]\n\npub struct Device {\n\n pub id: i32, // id of the device, unique\n\n pub registration_id: String, // Unique ID generated for registration ... |
Rust | src/output/time.rs | dbrumbaugh/exa | 1489f3ea833dcc67efffcddf8238864c30a35f12 |
use std::time::{SystemTime, UNIX_EPOCH};
use datetime::{LocalDateTime, TimeZone, DatePiece, TimePiece};
use datetime::fmt::DateFormat;
use lazy_static::lazy_static;
use unicode_width::UnicodeWidthStr;
#[derive(PartialEq, Debug, Copy, Clone)]
pub enum TimeFormat {
DefaultFormat,
... |
use std::time::{SystemTime, UNIX_EPOCH};
use datetime::{LocalDateTime, TimeZone, DatePiece, TimePiece};
use datetime::fmt::DateFormat;
use lazy_static::lazy_static;
use unicode_width::UnicodeWidthStr;
#[derive(PartialEq, Debug, Copy, Clone)]
pub enum TimeFormat {
DefaultFormat,
... |
#[allow(trivial_numeric_casts)]
fn iso_local(time: SystemTime) -> String {
let date = LocalDateTime::at(systemtime_epoch(time));
if is_recent(&date) {
format!("{:02}-{:02} {:02}:{:02}",
date.month() as usize, date.day(),
date.hour(), date.minute())
}
else {
... | ffset;
let local = LocalDateTime::at(systemtime_epoch(time));
let date = zone.to_zoned(local);
let offset = Offset::of_seconds(zone.offset(local) as i32).expect("Offset out of range");
format!("{:04}-{:02}-{:02} {:02}:{:02}:{:02}.{:09} {:+03}{:02}",
date.year(), date.month() as usize, date.... | function_block-function_prefixed | [] |
Rust | src/write.rs | winstonewert/thread_io | 85dfd37d3868914020d3c7f69704d37c12622755 |
use std::io::{self, Write};
use std::mem::replace;
#[cfg(feature = "crossbeam_channel")]
use crossbeam::channel::{unbounded as channel, Receiver, Sender};
#[cfg(not(feature = "crossbeam_channel"))]
use std::sync::mpsc::{channel, Receiver, Sender};
use crossbeam;
#[derive(Debug)]
enum Message {
Buffer(io::Curso... |
use std::io::{self, Write};
use std::mem::replace;
#[cfg(feature = "crossbeam_channel")]
use crossbeam::channel::{unbounded as channel, Receiver, Sender};
#[cfg(not(feature = "crossbeam_channel"))]
use std::sync::mpsc::{channel, Receiver, Sender};
use crossbeam;
#[derive(Debug)]
enum Message {
Buffer(io::Curso... | } else {
self.get_errors()?;
Err(io::Error::from(io::ErrorKind::BrokenPipe))
}
}
#[inline]
fn done(&mut self) -> io::Result<()> {
self.send_to_background()?;
self.full_send.send(Message::Done).ok();
Ok(())
... | t<Box<[u8]>>>,
full_send: Sender<Message>,
bufsize: usize,
) -> Self {
let buffer = io::Cursor::new(vec![0; bufsize].into_boxed_slice());
Writer {
empty_recv,
full_send,
buffer,
}
}
#[inline]
fn send_to_background(&mut self) -... | random | [
{
"content": "#[derive(Clone)]\n\nstruct Writer {\n\n cache: Vec<u8>,\n\n data: Vec<u8>,\n\n write_fails: bool,\n\n flush_fails: bool,\n\n bufsize: usize,\n\n}\n\n\n\nimpl Writer {\n\n fn new(write_fails: bool, flush_fails: bool, bufsize: usize) -> Writer {\n\n Writer {\n\n c... |
Rust | src/borrow/cell_borrow.rs | ten3roberts/hecs-schedule | d23e1c197211f8809cdce7b5e9b1e17d8df82dbb | use std::{
any::type_name,
marker::PhantomData,
ops::{Deref, DerefMut},
ptr::NonNull,
};
pub type Borrows = SmallVec<[Access; 8]>;
use atomic_refcell::{AtomicRef, AtomicRefCell, AtomicRefMut};
use smallvec::{smallvec, SmallVec};
use crate::{Access, Context, Error, Result};
use super::ComponentBorrow... | use std::{
any::type_name,
marker::PhantomData,
ops::{Deref, DerefMut},
ptr::NonNull,
};
pub type Borrows = SmallVec<[Access; 8]>;
use atomic_refcell::{AtomicRef, AtomicRefCell, AtomicRefMut};
use smallvec::{smallvec, SmallVec};
use crate::{Access, Context, Error, Result};
use super::ComponentBorrow... |
}
impl<'a, T> Deref for Write<'a, T> {
type Target = T;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl<'a, T> DerefMut for Write<'a, T> {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
struct BorrowMarker<T> {
marker: PhantomData<T>,
}
pub trait Context... | pub(crate) fn try_from_untyped(cell: &'a AtomicRefCell<NonNull<u8>>) -> Result<Self> {
cell.try_borrow_mut()
.map_err(|_| Error::BorrowMut(type_name::<T>()))
.map(|cell| {
Self(AtomicRefMut::map(cell, |val| unsafe {
val.cast().as_mut()
... | function_block-full_function | [
{
"content": "/// Lifetime erasure in waiting of GAT\n\npub trait IntoBorrow {\n\n /// The borrow type\n\n type Borrow: for<'x> ContextBorrow<'x>;\n\n}\n\n\n\n/// Macro for implementing lifetime eliding IntoBorrow\n\n#[macro_export]\n\nmacro_rules! impl_into_borrow {\n\n ($generic: tt, $name: tt => $bo... |
Rust | src/weight_functions.rs | JohannesEller/feos-dft | 161d93c723102c697d771401936dc6267a5c622a | use ndarray::*;
use num_dual::DualNum;
use std::f64::consts::{FRAC_PI_3, PI};
use std::ops::Mul;
#[derive(Clone)]
pub struct WeightFunction<T> {
pub prefactor: Array1<T>,
pub kernel_radius: Array1<T>,
pub shape: WeightFunctionShape,
}
impl<T: DualNum<f64>> WeightFunction<T> {
pub ... | use ndarray::*;
use num_dual::DualNum;
use std::f64::consts::{FRAC_PI_3, PI};
use std::ops::Mul;
#[derive(Clone)]
pub struct WeightFunction<T> {
pub prefactor: Array1<T>,
pub kernel_radius: Array1<T>,
pub shape: WeightFunctionShape,
}
impl<T: DualNum<f64>> WeightFunction<T> {
pub ... |
}
impl<T> WeightFunctionInfo<T> {
pub fn new(component_index: Array1<usize>, local_density: bool) -> Self {
Self {
component_index,
local_density,
scalar_component_weighted_densities: Vec::new(),
vector_component_weighted_densities: Vec::new(),
... | if self.local_density { segments } else { 0 })
+ self.scalar_component_weighted_densities.len() * segments
+ self.vector_component_weighted_densities.len() * segments * dimensions
+ self.scalar_fmt_weighted_densities.len()
+ self.vector_fmt_weighted_densities.len() * dime... | function_block-function_prefix_line | [
{
"content": "#[pymodule]\n\npub fn feos_dft(py: Python<'_>, m: &PyModule) -> PyResult<()> {\n\n m.add_class::<PyExternalPotential>()?;\n\n m.add_class::<PyGeometry>()?;\n\n m.add_class::<PyDFTSolver>()?;\n\n\n\n m.add_class::<PyFMTVersion>()?;\n\n m.add_class::<PyFMTFunctional>()?;\n\n\n\n m.... |
Rust | crates/rune-cli/src/run/runecoral_inference.rs | ferrous-systems/rune | 11d752759003ee2707efb904f596cbe8f9ee07a6 | use std::{borrow::Cow, cell::Cell, convert::TryInto, path::Path, sync::Mutex};
use anyhow::{Context, Error};
use hotg_rune_core::{Shape, TFLITE_MIMETYPE, reflect::Type};
use hotg_runicos_base_runtime::{BaseImage, Model, ModelFactory};
use hotg_runecoral::{ElementType, InferenceContext, RuneCoral, Tensor, TensorDescrip... | use std::{borrow::Cow, cell::Cell, convert::TryInto, path::Path, sync::Mutex};
use anyhow::{Context, Error};
use hotg_rune_core::{Shape, TFLITE_MIMETYPE, reflect::Type};
use hotg_runicos_base_runtime::{BaseImage, Model, ModelFactory};
use hotg_runecoral::{ElementType, InferenceContext, RuneCoral, Tensor, TensorDescrip... |
}
struct RuneCoralModel {
ctx: Mutex<InferenceContext>,
inputs: Vec<Shape<'static>>,
input_descriptors: Vec<TensorDescriptor<'static>>,
outputs: Vec<Shape<'static>>,
output_descriptors: Vec<TensorDescriptor<'static>>,
}
impl Model for RuneCoralModel {
unsafe fn infer(
&mut self,
... | Ok(match *rune_type {
Type::i8 => ElementType::Int8,
Type::u8 => ElementType::UInt8,
Type::i16 => ElementType::Int16,
Type::i32 => ElementType::Int32,
Type::i64 => ElementType::Int64,
Type::f32 => ElementType::Float32,
Type::f64 => ElementType::Float64,
Ty... | call_expression | [
{
"content": "fn copy_docs(ctx: &Context) -> Result<(), Error> {\n\n let Context {\n\n project_root, dist, ..\n\n } = ctx;\n\n\n\n std::fs::copy(project_root.join(\"README.md\"), dist.join(\"README.md\"))\n\n .context(\"Unable to copy the README across\")?;\n\n\n\n BulkCopy::new(&[\"*.... |
Rust | rsp2/tests/force-constants.rs | colin-daniels/agnr-ml | fc936cb8b6a68c37dfaf64c74796e0cf795c1bb8 | #[macro_use] extern crate rsp2_assert_close;
#[macro_use] extern crate rsp2_integration_test;
#[macro_use] extern crate serde_derive;
type FailResult<T> = Result<T, ::failure::Error>;
use rsp2_integration_test::{resource, filetypes::Primitive};
use rsp2_dynmat::SuperForceConstants;
use rsp2_array_types::{M33, V3, Un... | #[macro_use] extern crate rsp2_assert_close;
#[macro_use] extern crate rsp2_integration_test;
#[macro_use] extern crate serde_derive;
type FailResult<T> = Result<T, ::failure::Error>;
use rsp2_integration_test::{resource, filetypes::Primitive};
use rsp2_dynmat::SuperForceConstants;
use rsp2_array_types::{M33, V3, Un... | absolute: 1e-12 },
).unwrap()
}
#[test]
fn graphene_sparseforce_771() {
check(
"primitive/graphene.json",
"force-constants/graphene-771-sparse.super.json",
Some("force-constants/graphene-771.fc.json.xz"),
"force-constants/graphene-ga... |
"force-constants/graphene-gamma.dynmat.json",
V3::zero(),
Tolerances { relative: 1e-10, | function_block-random_span | [
{
"content": "/// Given dims `[a, b, c]`, makes a supercell of size `[2a + 1, 2b + 1, 2c + 1]`.\n\npub fn centered_diagonal(extra_images: [u32; 3]) -> Builder {\n\n let extra_images = V3(extra_images);\n\n\n\n Builder {\n\n diagonal: (extra_images * 2 + V3([1; 3])).0,\n\n offset: extra_image... |
Rust | src/game_over.rs | yopox/LD49 | ec170a997bcc844c833951c5d58e1b3672fff706 | use bevy::prelude::*;
use bevy_kira_audio::Audio;
use crate::{AppState, HEIGHT, PlayerData, WIDTH, MySelf};
use crate::fight::fight_screen::FightBackup;
use crate::data::font::TextStyles;
use crate::data::loading::{AudioAssets, TextureAssets};
use crate::ui::StateBackground;
use crate::ui::card_overlay::NewCard;
use c... | use bevy::prelude::*;
use bevy_kira_audio::Audio;
use crate::{AppState, HEIGHT, PlayerData, WIDTH, MySelf};
use crate::fight::fight_screen::FightBackup;
use crate::data::font::TextStyles;
use crate::data::loading::{AudioAssets, TextureAssets};
use crate::ui::StateBackground;
use crate::ui::card_overlay::NewCard;
use c... | e: ResMut<State<AppState>>,
btn: Res<Input<MouseButton>>,
) {
if btn.just_released(MouseButton::Left) {
app_state.set(AppState::Title).unwrap();
}
}
| transform: Transform {
translation: Vec3::new(WIDTH / 2., HEIGHT / 4., 1.),
..Default::default()
},
..Default::default()
}).insert(Over);
commands.spawn_bundle(Text2dBundle {
text: Text::with_section(if won.0 { "You won!" } else { "You lost!" },
... | random | [
{
"content": "pub fn card_transform(x: f32, y: f32) -> Transform {\n\n return Transform {\n\n translation: Vec3::new(x, y, 2.),\n\n scale: Vec3::new(CARD_SCALE, CARD_SCALE, 1.),\n\n ..Default::default()\n\n };\n\n}\n\n\n",
"file_path": "src/util.rs",
"rank": 0,
"score": 18... |
Rust | grin/src/adapters.rs | AmarRSingh/grin | 2caa0b79e04722011814b1adf2a8a449b05799f2 |
use std::net::SocketAddr;
use std::sync::{Arc, RwLock};
use std::sync::atomic::{AtomicBool, Ordering};
use chain::{self, ChainAdapter};
use core::core::{self, Output};
use core::core::block::BlockHeader;
use core::core::hash::{Hash, Hashed};
use core::core::target::Difficulty;
use p2p;
use pool;
use util::secp::pede... |
use std::net::SocketAddr;
use std::sync::{Arc, RwLock};
use std::sync::atomic::{AtomicBool, Ordering};
use chain::{self, ChainAdapter};
use core::core::{self, Output};
use core::core::block::BlockHeader;
use core::core::hash::{Hash, Hashed};
use core::core::target::Difficulty;
use p2p;
use pool;
use util::secp::pede... | or[1..].to_vec())
} else {
Some(header)
}
} else {
self.find_common_header(locator[1..].to_vec())
}
},
Err(chain::Error::StoreErr(store::Error::NotFoundErr, _)) => {
self.find_common_header(locator[1..].to_vec())
},
Err(e) => {
error!(LOGGER, "Could not build header loca... | ed block {} at {} from network, going to process.",
bhash,
b.header.height,
);
let res = self.chain.process_block(b, self.chain_opts());
if let &Err(ref e) = &res {
debug!(LOGGER, "Block {} refused by chain: {:?}", bhash, e);
if e.is_bad_block() {
return false;
... | random | [
{
"content": "/// Using transaction merkle_inputs_outputs to calculate a deterministic hash;\n\n/// this hashing mechanism has some ambiguity issues especially around range\n\n/// proofs and any extra data the kernel may cover, but it is used initially\n\n/// for testing purposes.\n\npub fn transaction_identifi... |
Rust | MixxNet/deployments/rainbow-bridge/contracts/near/eth-prover/tests/utils.rs | GigameshGarages/MezzooNet | d1a1115feacbc9776167f5d17a5e2b1fcf29bea4 | #![allow(dead_code)]
use borsh::{BorshDeserialize, BorshSerialize};
use eth_types::*;
use hex::FromHex;
use near_crypto::{InMemorySigner, KeyType, Signer};
use near_primitives::{
account::{AccessKey, Account},
errors::{RuntimeError, TxExecutionError},
hash::CryptoHash,
transaction::{ExecutionOutcome, Ex... | #![allow(dead_code)]
use borsh::{BorshDeserialize, BorshSerialize};
use eth_types::*;
use hex::FromHex;
use near_crypto::{InMemorySigner, KeyType, Signer};
use near_primitives::{
account::{AccessKe | _static! {
static ref ETH_PROVER_WASM_BYTES: &'static [u8] = include_bytes!("../../res/eth_prover.wasm").as_ref();
static ref ETH_CLIENT_WASM_BYTES: &'static [u8] = include_bytes!("../../res/eth_client.wasm").as_ref();
}
pub fn ntoy(near_amount: Balance) -> Balance {
near_amount * 10u128.pow(24)
}
pub str... | y, Account},
errors::{RuntimeError, TxExecutionError},
hash::CryptoHash,
transaction::{ExecutionOutcome, ExecutionStatus, Transaction},
types::{AccountId, Balance},
};
use near_runtime_standalone::init_runtime_and_signer;
pub use near_runtime_standalone::RuntimeStandalone;
pub use near_sdk::VMContext;
u... | random | [
{
"content": "-- This view needs to handle 'normal' subgraphs and the fake subgraphs that\n",
"file_path": "GixxNet/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/up.sql",
"rank": 0,
"score": 86155.60445825255
},
{
"content": "-- Before proceeding and throwing away dat... |
Rust | librustuv/src/pipe.rs | alexcrichton/green-rs | b7e17fc19bb90d0bb53914e66251e68cc15594e4 |
use std::c_str::CString;
use std::io;
use std::mem;
use std::rt::task::BlockedTask;
use std::sync::Arc;
use std::time::Duration;
use libc;
use access::Access;
use homing::{HomingIO, HomeHandle};
use raw::Handle;
use stream::Stream;
use timeout::{Pusher, AcceptTimeout, ConnectCtx, AccessTimeout};
use {raw, uvll, tcp,... |
use std::c_str::CString;
use std::io;
use std::mem;
use std::rt::task::BlockedTask;
use std::sync::Arc;
use std::time::Duration;
use libc;
use access::Access;
use homing::{HomingIO, HomeHandle};
use raw::Handle;
use stream::Stream;
use timeout::{Pusher, AcceptTimeout, ConnectCtx, AccessTimeout};
use {raw, uvll, tcp,... |
}
impl Drop for PipeListener {
fn drop(&mut self) {
let _m = self.fire_homing_missile();
unsafe { self.handle.close_and_free() }
}
}
impl PipeAcceptor {
pub fn accept(&mut self) -> UvResult<Pipe> {
let m = self.fire_homing_missile();
let uv_loop = self.data.listener.handle... | use raw::Stream;
let mut handle = listener.handle;
let client = try!(Pipe::new(&handle.uv_loop(), listener.home.clone()));
try!(handle.accept(client.data.handle));
Ok(client)
} | function_block-function_prefix_line | [
{
"content": "pub fn slice_to_uv_buf(v: &[u8]) -> uvll::uv_buf_t {\n\n let data = v.as_ptr();\n\n uvll::uv_buf_t { base: data as *mut u8, len: v.len() as uvll::uv_buf_len_t }\n\n}\n\n\n",
"file_path": "librustuv/src/raw/mod.rs",
"rank": 0,
"score": 263456.35914425325
},
{
"content": "/... |
Rust | leint/src/lib.rs | gianlucamazza/proofmarshal | 8b7181e669067d731b52829777d7f22e9b6a9967 |
use core::cmp;
use core::fmt;
use core::hash::{Hash, Hasher};
use core::mem;
use core::num::{
NonZeroU16, NonZeroI16,
NonZeroU32, NonZeroI32,
NonZeroU64, NonZeroI64,
NonZeroU128, NonZeroI128,
};
use core::slice;
#[repr(packed)]
pub struct Le<T: sealed::ToFromLe>(T);
mod sealed {
use super::*;... |
use core::cmp;
use core::fmt;
use core::hash::{Hash, Hasher};
use core::mem;
use core::num::{
NonZeroU16, NonZeroI16,
NonZeroU32, NonZeroI32,
NonZeroU64, NonZeroI64,
NonZeroU128, NonZeroI128,
};
use core::slice;
#[repr(packed)]
pub struct Le<T: sealed::ToFromLe>(T);
mod sealed {
use super::*;... | => i64;
NonZeroU128 => u128; NonZeroI128 => i128;
);
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn alignment() {
assert_eq!(mem::align_of::<Le<u16>>(), 1);
assert_eq!(mem::align_of::<Le<u32>>(), 1);
assert_eq!(mem::align_of::<Le<u64>>(), 1);
assert_eq!(mem::al... | ( $( $t:ident, )+ ) => {
$(
impl_tofromle!($t, $t);
)+
};
}
/*
unsafe impl<T: NonZero + ToFromLe> NonZero for Le<T> {}
*/
macro_rules! impl_nonzero_ints {
( $( $t:ident => $inner:ident; )+ ) => {
$(
impl_tofromle!($t, $inner);
)+
};
}
macro_rules! ... | random | [
{
"content": "pub trait EncodePrimitive : for<'a> Encode<'a, !, State=(), Encoded=Self> {\n\n #[inline(always)]\n\n fn encode_primitive_blob<W: WriteBlob>(&self, dst: W) -> Result<W::Ok, W::Error> {\n\n self.encode_blob(&(), dst)\n\n }\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! impl_encode_for_... |
Rust | examples/hello_world/src/main.rs | second-state/pickledb-rs | 2fc235986cc377c62df62c289f8562a86fad2008 |
use pickledb::{PickleDb, PickleDbDumpPolicy, SerializationMethod};
use serde::{Deserialize, Serialize};
use std::fmt::{self, Display, Formatter};
#[derive(Serialize, Deserialize)]
struct Rectangle {
width: i32,
length: i32,
}
impl Display for Rectangle {
fn fmt(&self, f: &mut Formatter) -> fmt::Result {... |
use pickledb::{PickleDb, PickleDbDumpPolicy, SerializationMethod};
use serde::{Deserialize, Serialize};
use std::fmt::{self, Display, Formatter};
#[derive(Serialize, Deserialize)]
struct Rectangle {
width: i32,
length: i32,
}
impl Display for Rectangle {
fn fmt(&self, f: &mut Formatter) -> fmt::Result {... | kv.get_key(),
kv.get_value::<Vec<i32>>().unwrap()
),
"key5" => println!(
"Value of {} is: {}",
kv.get_key(),
kv.get_value::<Rectangle>().unwrap()
),
_ => (),
}
}
}
| ),
"key3" => println!(
"Value of {} is: {}",
kv.get_key(),
kv.get_value::<String>().unwrap()
),
"key4" => println!(
"Value of {} is: {:?}",
| random | [
{
"content": "#[rstest_parametrize(ser_method_int, case(0), case(1), case(2), case(3))]\n\nfn remove_values_from_list(ser_method_int: i32) {\n\n test_setup!(\"remove_values_from_list\", ser_method_int, db_name);\n\n\n\n let mut db = PickleDb::new(\n\n &db_name,\n\n PickleDbDumpPolicy::AutoDu... |
Rust | src/model.rs | Lemmih/cargo-criterion | 81c56c6c6e776216fff0231658ae7cf30e6dfca5 | use crate::connection::Throughput;
use crate::estimate::{ChangeEstimates, Estimates};
use crate::report::{BenchmarkId, ComparisonData, MeasurementData};
use anyhow::{Context, Result};
use chrono::{DateTime, Utc};
use linked_hash_map::LinkedHashMap;
use std::collections::HashSet;
use std::ffi::OsStr;
use std::fs... | use crate::connection::Throughput;
use crate::estimate::{ChangeEstimates, Estimates};
use crate::report::{BenchmarkId, ComparisonData, MeasurementData};
use anyhow::{Context, Result};
use chrono::{DateTime, Utc};
use linked_hash_map::LinkedHashMap;
use std::collections::HashSet;
use std::ffi::OsStr;
use std::fs... |
fn load_stored_benchmark(&mut self, benchmark_path: &Path) -> Result<()> {
if !benchmark_path.is_file() {
return Ok(());
}
let mut benchmark_file = File::open(&benchmark_path)
.with_context(|| format!("Failed to open benchmark file {:?}", benchmark_path))?;
... | w(),
history_id,
history_description,
};
for entry in WalkDir::new(&model.data_directory)
.into_iter()
.filter_map(::std::result::Result::ok)
.filter(|entry| entry.file_name() == OsStr::new("benchmark.cbor"))
{
... | function_block-function_prefixed | [
{
"content": "/// Call `cargo criterion` and parse the output to get the path to the target directory.\n\nfn get_target_directory_from_metadata() -> Result<PathBuf> {\n\n let out = Command::new(\"cargo\")\n\n .args(&[\"metadata\", \"--format-version\", \"1\"])\n\n .output()?;\n\n\n\n #[deriv... |
Rust | src/lib.rs | ajfrantz/wait-around | 608c2a2c93de516b6668584dfdf61f50ca708282 | #[cfg(feature = "no_std")]
extern crate alloc;
#[cfg(not(feature = "no_std"))]
extern crate std as alloc;
use alloc::{rc::Rc, vec::Vec};
use core::{cell::RefCell, pin::Pin};
use futures::{
io::Error,
prelude::*,
task::{Context, Poll, Waker},
};
pub struct RingBuffer {
data: Vec<u8>,
read_idx: usiz... | #[cfg(feature = "no_std")]
extern crate alloc;
#[cfg(not(feature = "no_std"))]
extern crate std as alloc;
use alloc::{rc::Rc, vec::Vec};
use core::{cell::RefCell, pin::Pin};
use futures::{
io::Error,
prelude::*,
task::{Context, Poll, Waker},
};
pub struct RingBuffer {
data: Vec<u8>,
read_idx: usiz... |
}
| _idx < self.read_idx {
write_idx += 2 * capacity;
}
let remaining_space = capacity - (write_idx - self.read_idx);
let space_before_end = capacity - self.wrap(self.write_idx);
remaining_space.min(space_before_end)
}
fn park(&mut self, waker: &Waker) {
self.wa... | random | [
{
"content": "# async/await-friendly circular buffer\n\n\n\nThis library provides a [circular\n\nbuffer](https://en.wikipedia.org/wiki/Circular_buffer) that implements\n\n`AsyncRead` and `AsyncWrite`. It's meant to be useful to embedded applications\n\nwhich want to use async/await but for which the full might... |
Rust | src/message_formats/json.rs | ccleve/cargo-criterion | c4003934318015a06a6c48e8e6e9d855662c0485 | use crate::connection::Throughput as ThroughputEnum;
use crate::estimate::Estimate;
use crate::model::BenchmarkGroup;
use crate::report::{
compare_to_threshold, BenchmarkId, ComparisonResult, MeasurementData, Report, ReportContext,
};
use crate::value_formatter::ValueFormatter;
use anyhow::Result;
use serde... | use crate::connection::Throughput as ThroughputEnum;
use crate::estimate::Estimate;
use crate::model::BenchmarkGroup;
use crate::report::{
compare_to_threshold, BenchmarkId, ComparisonResult, MeasurementData, Report, ReportContext,
};
use crate::value_formatter::ValueFormatter;
use anyhow::Result;
use serde... |
}
#[derive(Serialize)]
struct Throughput {
per_iteration: u64,
unit: String,
}
impl From<&ThroughputEnum> for Throughput {
fn from(other: &ThroughputEnum) -> Self {
match other {
ThroughputEnum::Bytes(bytes) => Throughput {
per_iteration: *bytes,
... | fn from_percent(estimate: &Estimate) -> ConfidenceInterval {
ConfidenceInterval {
estimate: estimate.point_estimate,
lower_bound: estimate.confidence_interval.lower_bound,
upper_bound: estimate.confidence_interval.upper_bound,
unit: "%".to_owned(),
}... | function_block-full_function | [
{
"content": "pub fn make_filename_safe(string: &str) -> String {\n\n let mut string = string.replace(\n\n &['?', '\"', '/', '\\\\', '*', '<', '>', ':', '|', '^'][..],\n\n \"_\",\n\n );\n\n\n\n // Truncate to last character boundary before max length...\n\n truncate_to_character_bounda... |
Rust | src/cron_parser.rs | j5ik2o/chronos-parser-rs | 171f8f4f701de591e0a8da8d5ff0f07f66c9da69 | use pom::parser::*;
use crate::Expr;
use crate::Expr::{
AnyValueExpr, CronExpr, LastValueExpr, ListExpr, NoOp, PerExpr, RangeExpr, ValueExpr,
};
fn min_digit<'a>() -> Parser<'a, u8, Expr> {
(one_of(b"12345") + one_of(b"0123456789")).map(|(e1, e2)| ValueExpr((e1 - 48) * 10 + e2 - 48))
| (sym(b'0') * one_of(b"0... | use pom::parser::*;
use crate::Expr;
use crate::Expr::{
AnyValueExpr, CronExpr, LastValueExpr, ListExpr, NoOp, PerExpr, RangeExpr, ValueExpr,
};
fn min_digit<'a>() -> Parser<'a, u8, Expr> {
(one_of(b"12345") + one_of(b"0123456789")).map(|(e1, e2)| ValueExpr((e1 - 48) * 10 + e2 - 48))
| (sym(b'0') * one_of(b"0... |
let s: &str = &format!("{:<02}", n);
let result: Expr = (month_digit() - end()).parse(s.as_bytes()).unwrap();
assert_eq!(result, ValueExpr(n));
}
let result = (month_digit() - end()).parse(b"13");
assert_eq!(result.is_err(), true);
}
}
| if n < 10 {
let s: &str = &n.to_string();
let result: Expr = (month_digit() - end()).parse(s.as_bytes()).unwrap();
assert_eq!(result, ValueExpr(n));
} | if_condition | [
{
"content": "fn get_days_from_month(year: i32, month: u32) -> i64 {\n\n NaiveDate::from_ymd(\n\n match month {\n\n 12 => year + 1,\n\n _ => year,\n\n },\n\n match month {\n\n 12 => 1,\n\n _ => month + 1,\n\n },\n\n 1,\n\n )\n\n .signed_duration_since(NaiveDate::from_ymd(ye... |
Rust | src/code/mod.rs | aesir-vanir/libtyr | a3de0f4186ffc71080082e31908d5c6bfde879c5 |
use dam::{ColumnMetadata, RowsMetadata, TablesMetadata};
use error::{ErrorKind, Result};
use inflector::cases::pascalcase::to_pascal_case;
use inflector::cases::snakecase::to_snake_case;
use mustache;
use std::fs::{self, File};
use std::io::BufWriter;
use std::path::PathBuf;
mod tmpl;
use self::tmpl::{Derive, Deriv... |
use dam::{ColumnMetadata, RowsMetadata, TablesMetadata};
use error::{ErrorKind, Result};
use inflector::cases::pascalcase::to_pascal_case;
use inflector::cases::snakecase::to_snake_case;
use mustache;
use std::fs::{self, File};
use std::io::BufWriter;
use std::path::PathBuf;
mod tmpl;
use self::tmpl::{Derive, Deriv... |
}
pub fn mod_gen(path: &PathBuf, tables_metadata: &TablesMetadata) -> Result<()> {
let template = mustache::compile_str(MOD_RS)?;
let mut table_mods = Vec::new();
for table_name in tables_metadata.keys() {
let lc_table_name: String = table_name.chars().map(|c| c.to_lowercase().to_string()).collec... | fs::create_dir_all(&self.module_path)?;
mod_gen(&self.module_path, tables_metadata)?;
for (table_name, rows) in tables_metadata {
table_gen(&self.module_path, table_name, rows)?
}
Ok(())
} | function_block-function_prefix_line | [
{
"content": "/// Pretty print table metadata.\n\npub fn pretty_print(tables: &TablesMetadata) -> Result<()> {\n\n for (table, rows) in tables {\n\n let mut t = term::stdout().ok_or_else(|| ErrorKind::Stdout)?;\n\n t.attr(term::Attr::Bold)?;\n\n t.fg(term::color::GREEN)?;\n\n let ... |
Rust | src/master/mobility.rs | Dash83/MeshSim | a273cc62af1686b2696ebdd20311333bcb6c79f7 | use crate::backend::{stop_all_workers, update_worker_vel, select_workers_at_destination, stop_workers, update_worker_target};
use crate::MeshSimError;
use crate::worker::Worker;
use crate::master::test_specification::Area;
use diesel::pg::PgConnection;
use slog::Logger;
use std::collections::HashMap;
use rand::{rngs::S... | use crate::backend::{stop_all_workers, update_worker_vel, select_workers_at_destination, stop_workers, update_worker_target};
use crate::MeshSimError;
use crate::worker::Worker;
use crate::master::test_specification::Area;
use diesel::pg::PgConnection;
use slog::Logger;
use std::collections::HashMap;
use rand::{rngs::S... |
}
impl MobilityHandler for IncreasedMobility {
fn handle_iteration(&mut self,) -> Result<Vec<NodeState>, MeshSimError> {
let workers = select_workers_at_destination(&self.conn)?;
let newly_arrived: Vec<NodeState> = workers.into_iter()
.filter(|n| !self.paused_workers.con... | a.width);
let height_dist = Uniform::new_inclusive(0., simulation_area.height);
IncreasedMobility {
paused_workers,
velocity_increase: vel_incr,
area_width_dist: width_dist,
area_height_dist: height_dist,
pause_time,
conn,
... | function_block-function_prefixed | [] |
Rust | src/json_schema/validators/of.rs | swarkentin/valico | f6aed770ef3b0f1215636b29c696c2a69e29f92b | use serde_json::Value;
use std::borrow::Cow;
use super::super::errors;
use super::super::scope;
#[allow(missing_copy_implementations)]
pub struct AllOf {
pub schemes: Vec<url::Url>,
}
impl super::Validator for AllOf {
fn validate(&self, val: &Value, path: &str, scope: &scope::Scope) -> super::ValidationState... | use serde_json::Value;
use std::borrow::Cow;
use super::super::errors;
use super::super::scope;
#[allow(missing_copy_implementations)]
pub struct AllOf {
pub schemes: Vec<url::Url>,
}
impl super::Validator for AllOf {
fn validate(&self, val: &Value, path: &str, scope: &scope::Scope) -> super::ValidationState... |
}
#[allow(missing_copy_implementations)]
pub struct OneOf {
pub schemes: Vec<url::Url>,
}
impl super::Validator for OneOf {
fn validate(&self, val: &Value, path: &str, scope: &scope::Scope) -> super::ValidationState {
let mut state = super::ValidationState::new();
let mut val = Cow::Borrowed(... | else {
states.push(result)
}
} else {
state.missing.push(url.clone())
}
}
if !valid {
state.errors.push(Box::new(errors::AnyOf {
path: path.to_string(),
states,
}))
... | function_block-function_prefix_line | [
{
"content": "pub fn parse_url_key(key: &str, obj: &Value) -> Result<Option<Url>, schema::SchemaError> {\n\n match obj.get(key) {\n\n Some(value) => match value.as_str() {\n\n Some(string) => Url::parse(string)\n\n .map(Some)\n\n .map_err(schema::SchemaError::U... |
Rust | src/ethernet/ethernet_rx.rs | faern/rips-old | abff3837894a404895c6c2dc11ec45377f6dc811 | use {RxResult, RxError};
use ethernet::EtherType;
use pnet::packet::Packet;
use pnet::packet::ethernet::EthernetPacket;
use rx::RxListener;
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::sync::mpsc::Sender;
use std::time::SystemTime;
pub trait EthernetListener: Send {
fn rec... | use {RxResult, RxError};
use ethernet::EtherType;
use pnet::packet::Packet;
use pnet::packet::ethernet::EthernetPacket;
use rx::RxListener;
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::sync::mpsc::Sender;
use std::time::SystemTime;
pub trait EthernetListener: Send {
fn rec... |
}
}
#[cfg(test)]
mod tests {
use super::*;
use RxError;
use ethernet::{EtherType, EtherTypes};
use pnet::packet::Packet;
use pnet::packet::ethernet::{EthernetPacket, MutableEthernetPacket};
use rx::RxListener;
use std::sync::mpsc::{self, Receiver};
use std::time::SystemTime;
... | match self.listeners.get_mut(ðertype) {
Some(listener) => listener.recv(time, packet),
None => Err(RxError::NoListener(format!("Ethernet: No listener for {}", ethertype))),
} | if_condition | [
{
"content": "pub trait RxListener: Send {\n\n fn recv(&mut self, time: SystemTime, packet: &EthernetPacket) -> RxResult;\n\n}\n\n\n",
"file_path": "src/rx.rs",
"rank": 0,
"score": 142827.39647350827
},
{
"content": "/// Trait that must be implemented by any struct who want to receive Icm... |
Rust | src/value.rs | gemmaro/csa-rs | 1dbc6ae2ee577613eaa4f8de6df92cfff971b7a6 | use chrono::{NaiveDate, NaiveTime};
use std::fmt;
use std::time::Duration;
#[derive(Default, Debug, PartialEq, Eq)]
pub struct GameRecord {
pub black_player: Option<String>,
pub white_player: Option<String>,
pub event: Option<String>,
pub site: Option<String>,
pub start_time: Option<Time>,
pub ... | use chrono::{NaiveDate, NaiveTime};
use std::fmt;
use std::time::Duration;
#[derive(Default, Debug, PartialEq, Eq)]
pub struct GameRecord {
pub black_player: Option<String>,
pub white_player: Option<String>,
pub event: Option<String>,
pub site: Option<String>,
pub start_time: Option<Time>,
pub ... | t_eq!(&PieceType::Silver.to_string(), "GI");
assert_eq!(&PieceType::Gold.to_string(), "KI");
assert_eq!(&PieceType::Bishop.to_string(), "KA");
assert_eq!(&PieceType::Rook.to_string(), "HI");
assert_eq!(&PieceType::King.to_string(), "OU");
assert_eq!(&PieceType::ProPawn.to_string(... | one, Copy)]
pub enum Action {
Move(Color, Square, Square, PieceType),
Toryo,
Chudan,
Sennichite,
TimeUp,
IllegalMove,
IllegalAction(Color),
Jishogi,
Kachi,
Hikiwake,
Matta,
Tsumi,
Fuzumi,
Error,
}
impl fmt::Display for Action {
fn fmt(&self, f: &mut fmt::Form... | random | [] |
Rust | src/webp.rs | joppuyo/pio | 63c12ddca1d47f8459d19f74daca07ad39f1014b |
use libwebp_sys::*;
use rgb::RGBA8;
use std::mem::MaybeUninit;
use crate::common::{exif_orientation, orient_image, CompressResult, Image, ReadResult};
use crate::profile::{is_srgb, SRGB_PROFILE};
pub fn read(buffer: &[u8]) -> ReadResult {
unsafe {
let data = WebPData {
bytes: buffer.as_ptr()... |
use libwebp_sys::*;
use rgb::RGBA8;
use std::mem::MaybeUninit;
use crate::common::{exif_orientation, orient_image, CompressResult, Image, ReadResult};
use crate::profile::{is_srgb, SRGB_PROFILE};
pub fn read(buffer: &[u8]) -> ReadResult {
unsafe {
let data = WebPData {
bytes: buffer.as_ptr()... | 4 * image.width * image.height,
(4 * image.width) as i32,
);
if ret.is_null() {
WebPDataClear(&mut output);
return Err("Failed to decode image data".to_string());
}
let buffer = std::slice::from_raw_parts(output.bytes, output.size as usize).t... |
if config.lossless == 1 || config.use_sharp_yuv == 1 || config.preprocessing > 0 {
pic.use_argb = 1;
}
let stride = image.width as i32 * 4;
let ret = WebPPictureImportRGBA(&mut pic, image.as_bytes().as_ptr(), stride);
if ret == 0 {
WebPPi... | function_block-random_span | [
{
"content": "pub fn read(buffer: &[u8]) -> ReadResult {\n\n let mut decoder = lodepng::Decoder::new();\n\n decoder.remember_unknown_chunks(true);\n\n decoder.info_raw_mut().colortype = lodepng::ColorType::RGBA;\n\n\n\n let mut png = match decoder.decode(&buffer) {\n\n Ok(lodepng::Image::RGBA... |
Rust | src/executor/evaluate/evaluated.rs | silathdiir/gluesql | 036080b7c5155a2bb6b8a26bdaa6a26805019e53 | use std::cmp::Ordering;
use std::convert::{TryFrom, TryInto};
use sqlparser::ast::Value as AstValue;
use crate::data;
use crate::data::Value;
use crate::result::{Error, Result};
use super::EvaluateError;
#[derive(std::fmt::Debug)]
pub enum Evaluated<'a> {
LiteralRef(&'a AstValue),
Literal(AstValue),
Str... | use std::cmp::Ordering;
use std::convert::{TryFrom, TryInto};
use sqlparser::ast::Value as AstValue;
use crate::data;
use crate::data::Value;
use crate::result::{Error, Result};
use super::EvaluateError;
#[derive(std::fmt::Debug)]
pub enum Evaluated<'a> {
LiteralRef(&'a AstValue),
Literal(AstValue),
Str... | 4>()
.map_or_else(
|_| v.parse::<f64>().map(|v| AstValue::Number((-v).to_string())),
|v| Ok(AstValue::Number((-v).to_string())),
)
.map_err(|_| EvaluateError::LiteralUnaryMinusOnNonNumeric.into()),
AstValue::Null => Ok(AstValue::Null),
... | function_block-function_prefixed | [] | |
Rust | src/v8_finder/v8_platform.rs | EightM/v8find4rs | 9c97adbb68bba53e6dd909eed6384fbd927cbe7d | use crate::v8_app::{V8Arch, V8AppType};
use std::path::PathBuf;
use std::cmp::Ordering;
use crate::v8_finder::v8_dir::V8Dir;
use itertools::Itertools;
use std::{env, io};
use std::fs::File;
use std::io::{Read, Error, ErrorKind};
use regex::Regex;
use encoding_rs_io::DecodeReaderBytes;
use lazy_static::lazy_static;
laz... | use crate::v8_app::{V8Arch, V8AppType};
use std::path::PathBuf;
use std::cmp::Ordering;
use crate::v8_finder::v8_dir::V8Dir;
use itertools::Itertools;
use std::{env, io};
use std::fs::File;
use std::io::{Read, Error, ErrorKind};
use regex::Regex;
use encoding_rs_io::DecodeReaderBytes;
use lazy_static::lazy_static;
laz... |
fn v8_windows_paths() -> Result<Vec<V8Dir>, io::Error> {
let all_users_starter = get_starter_path_windows("ALLUSERSPROFILE")?;
let mut v8_paths_all_users = read_locations_from_starter(
all_users_starter)?;
let local_user_starter = get_starter_path_windows("APPDATA")?;
let mut v8_paths_local_u... | fn v8_macos_paths() -> Result<Vec<V8Dir>, io::Error> {
let starter_cfg_path = PathBuf::from("~/.1C/1cestart");
let mut locations_from_starter = read_locations_from_starter(starter_cfg_path)?;
let mut default_v8_paths = read_default_macos_paths();
let mut v8_all_paths = Vec::new();
v8_all_paths.appe... | function_block-function_prefix_line | [
{
"content": "fn get_v8s_suffix() -> &'static str {\n\n let current_os = env::consts::OS;\n\n match current_os {\n\n \"windows\" => r\"bin\\1cv8s.exe\",\n\n _ => \"1cv8s\",\n\n }\n\n}\n",
"file_path": "src/v8_app.rs",
"rank": 9,
"score": 52139.56261356953
},
{
"content... |
Rust | src/database/dataset.rs | Nilix007/betree_storage_stack | cd3334794b98b45a3ab24022db6e51b42dcd7dde | use super::errors::*;
use super::Database;
use super::{ds_data_key, fetch_ds_data, DatasetData, DatasetId, DatasetTree, Generation};
use crate::cow_bytes::{CowBytes, SlicedCowBytes};
use crate::tree::{DefaultMessageAction, Tree, TreeBaseLayer, TreeLayer};
use std::borrow::Borrow;
use std::collections::HashSet;
use std:... | use super::errors::*;
use super::Database;
use super::{ds_data_key, fetch_ds_data, DatasetData, DatasetId, DatasetTree, Generation};
use crate::cow_bytes::{CowBytes, SlicedCowBytes};
use crate::tree::{DefaultMessageAction, Tree, TreeBaseLayer, TreeLayer};
use std::borrow::Borrow;
use std::collections::HashSet;
use std:... |
}
pub fn close_dataset(&mut self, ds: Dataset) -> Result<()> {
self.sync_ds(ds.id, &ds.tree)?;
self.open_datasets.remove(&ds.id);
self.root_tree
.dmu()
.handler()
.last_snapshot_generation
.write()
.remove(&ds.id);
... | Ok(self.root_tree.range(low..high)?.map(move |result| {
let (b, _) = result?;
let len = b.len() as u32;
Ok(b.slice(1, len - 1))
})) | call_expression | [
{
"content": "fn ss_data_key_max(mut ds_id: DatasetId) -> [u8; 9] {\n\n ds_id.0 += 1;\n\n let mut key = [0; 9];\n\n key[0] = 4;\n\n key[1..9].copy_from_slice(&ds_id.pack());\n\n key\n\n}\n\n\n",
"file_path": "src/database/mod.rs",
"rank": 0,
"score": 322620.1202356167
},
{
"co... |
Rust | packages/ffi-qrcode/src/lib.rs | TianLiangZhou/php-ffi-packages | febbf15dc22c1e1bd4ca597bb40782058057b9a5 | use qrcode::{QrCode, EcLevel};
use image::{Rgba, Pixel as ImagePixel, GenericImageView};
use qrcode::render::{Renderer as QrRenderer, svg::Color, Pixel, unicode::Dense1x2};
use std::ffi::{CStr, CString};
use std::{ptr, slice};
use std::cell::RefCell;
use std::error::Error;
use std::os::raw::{c_int, c_char};
use image::... | use qrcode::{QrCode, EcLevel};
use image::{Rgba, Pixel as ImagePixel, GenericImageView};
use qrcode::render::{Renderer as QrRenderer, svg::Color, Pixel, unicode::Dense1x2};
use std::ffi::{CStr, CString};
use std::{ptr, slice};
use std::cell::RefCell;
use std::error::Error;
use std::os::raw::{c_int, c_char};
use image::... | ogo_w = logo_image_rgba.width();
let logo_h = logo_image_rgba.height();
let start_x = (w - logo_w) / 2;
let start_y = (h - logo_h) / 2;
for (x, y, p) in image.enumerate_pixels_mut() {
if x >= start_x && y >= start_y && x - start_x <= logo_w - 1 && y - start_y <= logo_h - 1 {... | ustomRender for QrRenderer<'a, &str> {
fn render(&mut self, _cfg: Cfg) -> String {
self.build()
}
fn set_color(&mut self, bg: &'static str, fg: &'static str) {
if bg.len() > 0 {
self.light_color(bg);
}
if fg.len() > 0 {
self.dark_color(fg);
}
... | random | [
{
"content": "fn const_to_str(str: *const c_char) -> &'static str {\n\n return unsafe { CStr::from_ptr(str) }.to_str().unwrap();\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::ffi::CStr;\n\n use crate::{Mode, to_pinyin, to_pinyin_array};\n\n\n\n #[test]\n\n fn it_works() {\n\n\n\n le... |
Rust | azul-core/display_list.rs | niklasha/azul | dad5345942b82ed0273c48140a931bbbf81deae7 | use std::fmt;
use azul_css::{
LayoutPoint, LayoutSize, LayoutRect,
StyleBackgroundRepeat, StyleBackgroundPosition, ColorU, BoxShadowClipMode,
LinearGradient, RadialGradient, BoxShadowPreDisplayItem, StyleBackgroundSize,
CssPropertyValue,
StyleBorderTopWidth, StyleBorderRightWidth, StyleBorderBottom... | use std::fmt;
use azul_css::{
LayoutPoint, LayoutSize, LayoutRect,
StyleBackgroundRepeat, StyleBackgroundPosition, ColorU, BoxShadowClipMode,
LinearGradient, RadialGradient, BoxShadowPreDisplayItem, StyleBackgroundSize,
CssPropertyValue,
StyleBorderTopWidth, StyleBorderRightWidth, StyleBorderBottom... |
}
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub enum ImageRendering {
Auto,
CrispEdges,
Pixelated,
}
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub enum AlphaType {
Alpha,
PremultipliedAlpha,
}
#[derive(Default, Copy, Clone, PartialEq, Eq, Parti... | DisplayListFrame {
tag: None,
clip_rect: None,
rect: LayoutRect {
origin: LayoutPoint { x: 0.0, y: 0.0 },
size: dimensions,
},
border_radius: StyleBorderRadius::default(),
content: vec![],
children: vec![... | function_block-function_prefix_line | [
{
"content": "pub trait GetTextLayout { fn get_text_layout(&mut self, text_layout_options: &ResolvedTextLayoutOptions) -> InlineTextLayout; }\n\n\n\n#[derive(Debug, Clone, PartialEq, PartialOrd)]\n\npub struct SolvedUi {\n\n pub solved_rects: NodeDataContainer<PositionedRectangle>,\n\n}\n\n\n\n#[derive(Debug... |
Rust | crates/mun_codegen/src/ir/type_table.rs | parasyte/mun | 73d0839380a711c61885735320de78c4639691f8 | use super::types as ir;
use crate::ir::dispatch_table::{DispatchTable, FunctionPrototype};
use crate::type_info::{TypeGroup, TypeInfo};
use crate::value::{AsValue, CanInternalize, Global, IrValueContext, IterAsIrValue, Value};
use crate::IrDatabase;
use hir::{Body, ExprId, InferenceResult};
use inkwell::module::Linkage... | use super::types as ir;
use crate::ir::dispatch_table::{DispatchTable, FunctionPrototype};
use crate::type_info::{TypeGroup, TypeInfo};
use crate::value::{AsValue, CanInternalize, Global, IrValueContext, IterAsIrValue, Value};
use crate::IrDatabase;
use hir::{Body, ExprId, InferenceResult};
use inkwell::module::Linkage... |
pub fn collect_fn(&mut self, hir_fn: hir::Function) {
if !hir_fn.data(self.db).visibility().is_private() || self.dispatch_table.contains(hir_fn) {
let fn_sig = hir_fn.ty(self.db).callable_sig(self.db).unwrap();
for ty in fn_sig.params().iter() {
... | lf, expr_id: ExprId, body: &Arc<Body>, infer: &InferenceResult) {
let expr = &body[expr_id];
expr.walk_child_exprs(|expr_id| self.collect_expr(expr_id, body, infer))
} | function_block-function_prefixed | [
{
"content": "/// Returns the LLVM IR type of the specified struct\n\npub fn struct_ty_query(db: &impl IrDatabase, s: hir::Struct) -> StructType {\n\n let name = s.name(db).to_string();\n\n for field in s.fields(db).iter() {\n\n // Ensure that salsa's cached value incorporates the struct fields\n\n... |
Rust | hatch/src/generators/tup/tests/builder.rs | CachedNerds/Hatch | fc25adcda0dded3ad630aa3850d615aa13527975 | use generators::project_asset::ProjectAsset;
use generators::tup::builder::Builder as AssetBuilder;
use generators::tup::tests::fixtures;
use project::ProjectKind;
use std::path::PathBuf;
#[test]
fn add_asset() {
let project = fixtures::project(ProjectKind::HeaderOnly);
let mut asset_builder = AssetBuilder::ne... | use generators::project_asset::ProjectAsset;
use generators::tup::builder::Builder as AssetBuilder;
use generators::tup::tests::fixtures;
use project::ProjectKind;
use std::path::PathBuf;
#[test]
fn add_asset() {
let project = fixtures::project(ProjectKind::HeaderOnly);
let mut asset_builder = AssetBuilder::ne... |
#[test]
fn build_tupfile_asset() {
let project = fixtures::project(ProjectKind::Shared);
let asset_builder = AssetBuilder::new(PathBuf::from("./"), &project);
let actual_asset = asset_builder.add_tupfile();
let expected_contents = String::from(
"include config.tup
include_rules
: foreach $(... | TEST = test
TEST_TARGET = $(TEST)/$(TARGET)
TEST_FILES = $(TEST)/$(SOURCE)/*.cpp
TEST_OBJ_FILES = $(TEST_TARGET)/*.o
# macros
!compile = |> $(CC) $(CFLAGS) %f -o %o |>
!archive = |> ar crs %o %f |>
!link = |> $(CC) $(LINKFLAGS) %f -o %o |>
# includes the STATIC and SHARED variables for the target platform
include @(T... | function_block-function_prefix_line | [
{
"content": "pub fn project(kind: ProjectKind) -> Project {\n\n let compiler_options = CompilerOptions::new(\n\n String::from(\"g++\"),\n\n vec![String::from(\"-c\"), String::from(\"--std=c++1z\")].join(' '.to_string().as_str()),\n\n vec![String::from(\"-v\")].join(' '.to_string().as_st... |
Rust | examples/qrnn.rs | usamec/cntk-rs | cb4895d222768d5cbc8619d71fb02e5f14bc7c86 | #[macro_use]
extern crate cntk;
extern crate rand;
use cntk::{Variable, Function, Value, Learner, Trainer, DoubleParameterSchedule, DataMap, Axis};
use cntk::ParameterInitializer;
use cntk::ReplacementMap;
use cntk::Shape;
use cntk::ops::*;
use cntk::DeviceDescriptor;
use rand::distributions::{IndependentSample, Range... | #[macro_use]
extern crate cntk;
extern crate rand;
use cntk::{Variable, Function, Value, Learner, Trainer, DoubleParameterSchedule, DataMap, Axis};
use cntk::ParameterInitializer;
use cntk::ReplacementMap;
use cntk::Shape;
use cntk::ops::*;
use cntk::DeviceDescriptor;
use rand::distributions::{IndependentSample, Range... | println!("training end");
}
| tch_num*batch_size..(batch_num+1)*batch_size], DeviceDescriptor::cpu());
let datamap = datamap!{&x => &value, &y => &ovalue};
let mut outdatamap = outdatamap!{&output, &loss};
trainer.train_minibatch(&datamap, &mut outdatamap, DeviceDescriptor::cpu());
let _output_val = ... | function_block-random_span | [
{
"content": "fn linear_layer<T: Into<Variable>>(input: T, input_size: usize, output_size: usize) -> Function {\n\n let w = Variable::parameter(&Shape::new(&vec!(output_size, input_size)), &ParameterInitializer::glorot_uniform(), DeviceDescriptor::cpu());\n\n let b = Variable::parameter(&Shape::new(&vec!(... |
Rust | src/rules_parser/rule_action.rs | mcdobr/yawaf | 5238f99789ec972a14049d3b8eb0399674bc3a1d | use nom::IResult;
use nom::sequence::{tuple, separated_pair, delimited};
use nom::error::context;
use nom::character::complete::{alpha1, multispace0};
use nom::combinator::{opt};
use nom::bytes::complete::{tag, is_not};
use nom::multi::{separated_list1};
#[derive(Clone, Debug, PartialEq)]
pub struct RuleAction {
p... | use nom::IResult;
use nom::sequence::{tuple, separated_pair, delimited};
use nom::error::context;
use nom::character::complete::{alpha1, multispace0};
use nom::combinator::{opt};
use nom::bytes::complete::{tag, is_not};
use nom::multi::{separated_list1};
#[derive(Clone, Debug, PartialEq)]
pub struct RuleAction {
p... |
#[test]
fn parse_actions_should_extract_all_actions() {
assert_eq!(vec![
RuleAction {
action_type: RuleActionType::Nolog,
argument: None,
},
RuleAction {
action_type: RuleActionType::Id,
argument: Some("99".to_string()),
},
Ru... | fn parse_action_should_extract_action() {
assert_eq!(RuleAction {
action_type: RuleActionType::Append,
argument: Some("'<hr>Footer'".to_string()),
}, parse_action("append:'<hr>Footer'").unwrap().1)
} | function_block-full_function | [
{
"content": "pub fn parse_rule(input: &str) -> IResult<&str, Rule> {\n\n context(\n\n \"rule\",\n\n delimited(\n\n multispace0,\n\n tuple((\n\n rule_directive::parse_directive,\n\n multispace1,\n\n rule_variable::parse_variable... |
Rust | src/path64/cubic64.rs | vmx/tiny-skia | 58001e98b1ae267b5cd60dd681c88bb00a97ed16 |
use super::Scalar64;
use super::point64::{Point64, SearchAxis};
use super::quad64;
pub const POINT_COUNT: usize = 4;
const PI: f64 = 3.141592653589793;
pub struct Cubic64Pair {
pub points: [Point64; 7],
}
pub struct Cubic64 {
pub points: [Point64; POINT_COUNT],
}
impl Cubic64 {
pub fn new(points: [Poi... |
use super::Scalar64;
use super::point64::{Point64, SearchAxis};
use super::quad64;
pub const POINT_COUNT: usize = 4;
const PI: f64 = 3.141592653589793;
pub struct Cubic64Pair {
pub points: [Point64; 7],
}
pub struct Cubic64 {
pub points: [Point64; POINT_COUNT],
}
impl Cubic64 {
pub fn new(points: [Poi... | c[2].x, t);
let cd = interp(src[2].x, src[3].x, t);
let abc = interp(ab, bc, t);
let bcd = interp(bc, cd, t);
let abcd = interp(abc, bcd, t);
dst[0].x = src[0].x;
dst[1].x = ab;
dst[2].x = abc;
dst[3].x = abcd;
dst[4].x = bcd;
dst[5].x = cd;
dst[6].x = src[3].x;
}
fn interp... | return -1.0;
}
let more_dist = more_pt.axis_coord(x_axis) - axis_intercept;
let ok = if calc_dist > 0.0 { calc_dist <= more_dist } else { calc_dist >= more_dist };
if ok {
continue;
}
t = next_t;
... | random | [
{
"content": "pub fn vertical_intersect(cubic: &Cubic64, axis_intercept: f64, roots: &mut [f64; 3]) -> usize {\n\n let (a, b, c, mut d) = cubic64::coefficients(&cubic.as_f64_slice());\n\n d -= axis_intercept;\n\n let mut count = cubic64::roots_valid_t(a, b, c, d, roots);\n\n let mut index = 0;\n\n ... |
Rust | piet-gpu/bin/winit.rs | Vurich/piet-gpu | a41b6684d09d0205d6d8c80f5a8d186bebf65e6d | use piet_gpu::{render_scene, PietGpuRenderContext, Renderer, HEIGHT, WIDTH};
use std::iter;
use winit::{
event::{Event, WindowEvent},
event_loop::{ControlFlow, EventLoop},
window::{Window, WindowBuilder},
};
fn main() -> Result<(), Box<dyn std::error::Error>> {
let event_loop = EventLoop::new();
le... | use piet_gpu::{render_scene, PietGpuRenderContext, Renderer, HEIGHT, WIDTH};
use std::iter;
use winit::{
event::{Event, WindowEvent},
event_loop::{ControlFlow, EventLoop},
window::{Window, WindowBuilder},
};
fn main() -> Result<(), Box<dyn std::error::Error>> {
let event_loop = EventLoop::new();
le... | ,
Event::MainEventsCleared => {
window.request_redraw();
}
Event::RedrawRequested(window_id) if window_id == window.id() => {
let swap_frame = swapchain.get_current_frame().unwrap();
let mut cmd_buf =
device.create_c... | match event {
WindowEvent::CloseRequested => {
*control_flow = ControlFlow::Exit;
}
WindowEvent::Resized(size) => {
let sc_desc = wgpu::SwapChainDescriptor {
usage: wgpu::TextureUsage::OUTPUT_ATTACHMENT,
... | if_condition | [
{
"content": "pub fn render_scene(rc: &mut impl RenderContext) {\n\n render_tiger(rc);\n\n}\n\n\n",
"file_path": "piet-gpu/src/lib.rs",
"rank": 0,
"score": 153520.9568348133
},
{
"content": "fn main() {\n\n let mod_name = std::env::args()\n\n .skip(1)\n\n .next()\n\n ... |
Rust | matrix_sdk_appservice/src/webserver/actix.rs | fisherdarling/matrix-rust-sdk | 0fb3dedd1cd3b0766fa7378754480d52d38e8ef2 |
use std::pin::Pin;
pub use actix_web::Scope;
use actix_web::{
dev::Payload,
error::PayloadError,
get, put,
web::{self, BytesMut, Data},
App, FromRequest, HttpRequest, HttpResponse, HttpServer,
};
use futures::Future;
use futures_util::TryStreamExt;
use ruma::api::appservice as api;
use crate::{e... |
use std::pin::Pin;
pub use actix_web::Scope;
use actix_web::{
dev::Payload,
error::PayloadError,
get, put,
web::{self, BytesMut, Data},
App, FromRequest, HttpRequest, HttpResponse, HttpServer,
};
use futures::Future;
use futures_util::TryStreamExt;
use ruma::api::appservice as api;
use crate::{e... |
})
}
}
| Ok(IncomingRequest {
access_token,
incoming: ruma::api::IncomingRequest::try_from_http_request(request)?,
}) | call_expression | [
{
"content": "pub fn keys_query(c: &mut Criterion) {\n\n let runtime = Builder::new_multi_thread().build().expect(\"Can't create runtime\");\n\n let machine = OlmMachine::new(&alice_id(), &alice_device_id());\n\n let response = keys_query_response();\n\n let uuid = Uuid::new_v4();\n\n\n\n let cou... |
Rust | src/command/windows.rs | cosmo0920/grnenv-rs | 138d53e5037cd17f9ce40ee9f06bd9bba9f5a528 | use std::borrow::Cow;
use std::env;
use std::fs;
use std::io;
use std::process;
use clap::ArgMatches;
use kuchiki;
use tempdir::TempDir;
use config::Config;
use downloader;
use extractor;
use profile;
use reqwest::{Client, Proxy, Url};
pub fn init() {
let config = Config::new();
if config.install_dir.exists(... | use std::borrow::Cow;
use std::env;
use std::fs;
use std::io;
use std::process;
use clap::ArgMatches;
use kuchiki;
use tempdir::TempDir;
use config::Config;
use downloader;
use e | uninstall(m: &ArgMatches) {
let config = Config::from_matches(m);
let mut choice = String::new();
let arch = match config.arch.unwrap() {
Cow::Borrowed(s) => s.to_owned(),
Cow::Owned(s) => s,
};
let groonga_dir = format!("groonga-{}-{}", config.version.unwrap(), arch);
if config... | xtractor;
use profile;
use reqwest::{Client, Proxy, Url};
pub fn init() {
let config = Config::new();
if config.install_dir.exists() || config.shim_dir.exists() {
println!("Already initalized. Reinitializing....");
}
fs::create_dir_all(&config.install_dir).expect("Could not create installation ... | random | [
{
"content": "pub fn file_download<'a>(\n\n client: &'a Client,\n\n url: &str,\n\n mut base_dir: PathBuf,\n\n filename: &'a str,\n\n) -> Result<PathBuf, GrnEnvError> {\n\n let mut res = client\n\n .get(url)\n\n .header(Connection::close())\n\n .header(UserAgent::new(format!(\... |
Rust | src/timm/calls.rs | kumo/callog_bot | cd549d1ae2f7ef967be56ca647fab7580309a4e6 | use chrono::{NaiveDateTime, Utc};
use std::fmt::{Display, Formatter};
use visdom::Vis;
#[derive(Eq, PartialEq, Debug, Clone)]
pub struct PhoneCall {
pub who: String,
pub when: NaiveDateTime,
}
impl PhoneCall {
pub fn is_today(&self) -> bool {
Utc::now()
.naive_utc()
.signed... | use chrono::{NaiveDateTime, Utc};
use std::fmt::{Display, Formatter};
use visdom::Vis;
#[derive(Eq, PartialEq, Debug, Clone)]
pub struct PhoneCall {
pub who: String,
pub when: NaiveDateTime,
}
impl PhoneCall {
pub fn is_today(&self) -> bool {
Utc::now()
.naive_utc()
.signed... |
}
impl Display for PhoneCall {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
let diff = Utc::now().naive_utc() - self.when;
if diff.num_hours() > 1 {
write!(
f,
"☎️ {}\n👉 {}",
self.who,
self.when.fo... | pub fn is_recent(&self) -> bool {
Utc::now()
.naive_utc()
.signed_duration_since(self.when)
.num_minutes()
<= 20
} | function_block-full_function | [
{
"content": "fn parse_int(input: &str) -> Option<u32> {\n\n input\n\n .chars()\n\n .skip_while(|ch| !ch.is_digit(10))\n\n .take_while(|ch| ch.is_digit(10))\n\n .fold(None, |acc, ch| {\n\n ch.to_digit(10).map(|b| acc.unwrap_or(0) * 10 + b)\n\n })\n\n}\n\n\n\nimpl... |
Rust | src/views/results.rs | Ace4896/typetest | b2d682ca96be09d8ef157761615aaca7761fe9d8 | use iced::{button, scrollable, Align, Button, Column, HorizontalAlignment, Row, Scrollable, Text};
use typetest_core::stats::TestStats;
use typetest_themes::ApplicationTheme;
use super::Action;
pub struct ResultsState {
stats: TestStats,
show_missed_words: bool,
retry_button: button::State,
next_tes... | use iced::{button, scrollable, Align, Button, Column, HorizontalAlignment, Row, Scrollable, Text};
use typetest_core::stats::TestStats;
use typetest_themes::ApplicationTheme;
use super::Action;
pub struct ResultsState {
stats: TestStats,
show_missed_words: bool,
retry_button: button::State,
next_tes... |
pub fn update_stats(&mut self, stats: TestStats) {
self.stats = stats;
}
}
#[inline]
fn format_time_mm_ss(seconds: u64) -> String {
format!("{:0>2}:{:0>2}", seconds / 60, seconds % 60)
}
| if self.stats.get_missed_words().is_empty() {
tmp
} else {
tmp.on_press(ResultsMessage::ToggleMissedWords)
}
};
let controls = Row::new()
.align_items(Align::Center)
.spacing(10)
.push(next_test_button)
... | function_block-function_prefix_line | [
{
"content": "/// Converts a [DisplayedWord] to an [iced::Text].\n\nfn displayed_word(word: &DisplayedWord, theme: &Box<dyn ApplicationTheme>) -> Text {\n\n let theme = theme.word_palette();\n\n let color = match word.status {\n\n WordStatus::NotTyped => theme.default,\n\n WordStatus::Correc... |
Rust | examples/neopixel.rs | blueluna/circuit-playground-bluefruit | 53f05f169541c5f1b537803d72e3f102f76a0d7f | #![no_main]
#![no_std]
#[allow(unused_imports)]
use panic_semihosting;
use cortex_m_semihosting::{hprintln};
use rtfm::app;
use nrf52840_hal::{gpio, prelude::*, uarte, };
use nrf52840_pac as pac;
const PWM_FALLING_EDGE: u16 = 0x8000;
const NEOPIXEL_COUNTER_TOP: u16 = 20;
const NEOPIXEL_TIME_0_HIGH: u16 = 6 | PW... | #![no_main]
#![no_std]
#[allow(unused_imports)]
use panic_semihosting;
use cortex_m_semihosting::{hprintln};
use rtfm::app;
use nrf52840_hal::{gpio, prelude::*, uarte, };
use nrf52840_pac as pac;
const PWM_FALLING_EDGE: u16 = 0x8000;
const NEOPIXEL_COUNTER_TOP: u16 = 20;
const NEOPIXEL_TIME_0_HIGH: u16 = 6 | PW... |
#[task(binds = TIMER0, resources = [pwm, counter, timer])]
fn timer(cx: timer::Context) {
let pwm = cx.resources.pwm;
let counter = cx.resources.counter;
cx.resources.timer.events_compare[0].reset();
let mut colours = [0u8; 30];
let mut pwm_words = [0x8000u16; 30 * 8 + ... | e()._32bit());
timer.shorts.write(|w| w.compare0_clear().enabled().compare0_stop().disabled());
timer.prescaler.write(|w| unsafe { w.prescaler().bits(4) });
timer.cc[0].write(|w| unsafe { w.bits(50_000) });
timer.intenset.write(|w| w.compare0().set());
timer.tasks_clear.write(|w|... | function_block-function_prefixed | [
{
"content": "# Rust experiments on the Adafruit Circuit Playground Bluefruit\n\n\n\n## The Setup\n\n\n\nFollowing setup was used when running these examples.\n\n\n\nThe Adafruit Circuit Playground Bluefruit (CPB) is connected to a J-Link EDU\n\nthrough the SWD interface on the back of the CPB. A USB-to-serial ... |
Rust | src/main.rs | glapa-grossklag/rle | f6809704b27f9dc07617c2fe54918332d8a685b4 | use std::fs::File;
use std::io::prelude::*;
use clap::App;
fn main() {
let yaml = clap::load_yaml!("clap.yml");
let matches = App::from_yaml(yaml).get_matches();
if let Some(matches) = matches.subcommand_matches("encode") {
let mut bytes_read: usize = 0;
let mut bytes_w... | use std::fs::File;
use std::io::prelude::*;
use clap::App;
fn main() {
let yaml = clap::load_yaml!("clap.yml");
let matches = App::from_yaml(yaml).get_matches();
if let Some(matches) = matches.subcommand_matches("encode") {
let mut bytes_read: usize = 0;
let mut bytes_w... |
fn encode(data: Vec<u8>) -> Vec<u8> {
if data.is_empty() {
return Vec::new();
}
let mut encoded: Vec<u8> = Vec::new();
let mut previous: u8 = data[0];
let mut len: u8 = 0;
for current in data {
if current == previous && len < u8::MAX {
len += 1;
} else {
... | ile).unwrap();
match output.write_all(&encoded) {
Err(why) => panic!("Cannot write: {}", why),
Ok(_) => bytes_written += encoded.len(),
}
if matches.is_present("verbose") {
let compression_ratio = 1.0 - (bytes_written as f64 / bytes_read as f64);
... | function_block-function_prefixed | [
{
"content": "# Run-Length Encoding\n\n\n\nRun-length encoding (RLE) is one of the simplest and most intuitive compression\n\nmethods. In short, RLE encodes repeating strings of symbols as the length of the\n\nrun. An example illustrates this best. Let's say we have the following data:\n\n\n\n\tOh noooooo!\n\n\... |
Rust | src/main.rs | dextero/vrms-rs | ce72bc8017200641e9d8cdd214be56d54526dcd4 | #[macro_use]
#[cfg(test)]
extern crate matches;
extern crate regex;
#[macro_use]
extern crate error_chain;
extern crate colored;
use std::collections::HashSet;
use std::fs::File;
use std::io::BufRead;
use std::io::BufReader;
use std::process::Command;
use std::process;
use regex::Regex;
use colored::*;
error_chain!... | #[macro_use]
#[cfg(test)]
extern crate matches;
extern crate regex;
#[macro_use]
extern crate error_chain;
extern crate colored;
use std::collections::HashSet;
use std::fs::File;
use std::io::BufRead;
use std::io::BufReader;
use std::process::Command;
use std::process;
use regex::Regex;
use colored::*;
error_chain!... |
#[test]
fn license_parse_or() {
assert_eq!(License::Or(
vec!(License::License("a".to_owned()),
License::License("b".to_owned()))),
License::parse("a or b").unwrap());
assert_eq!(License::Or(
vec!(License::License("a".to_owned()),
... | fn license_parse_trivial() {
assert_eq!(License::License("trivial".to_owned()),
License::parse("trivial").unwrap());
assert_eq!(License::License("with spaces".to_owned()),
License::parse("with spaces").unwrap());
assert_eq!(License::License("spaces around".to_owned()),
... | function_block-full_function | [
{
"content": "# vrms-rs\n\n\n\nYet another clone of *vrms* (\"virtual Richard M. Stallman\") utility, inspired by [vrms-rpm](https://github.com/dextero/vrms-rpm) project by Suve and the [RIIR movement](https://transitiontech.ca/random/RIIR).\n",
"file_path": "README.md",
"rank": 22,
"score": 1.52058... |
Rust | src/search.rs | ZackPierce/syn-select | 6c9489df2147bfeabe4800eb54cae96ebf1c16d0 | use crate::{util, Selector};
use crate::selector::SelectorSegment;
use syn::visit::Visit;
use syn::{
self, Attribute, Ident, Item, ItemConst, ItemFn, ItemTrait, ItemType, Stmt, TraitItem,
Visibility,
};
trait Name {
fn name(&self) -> Option<&Ident>;
fn is_named(&self, ident: &impl PartialEq<... | use crate::{util, Selector};
use crate::selector::SelectorSegment;
use syn::visit::Visit;
use syn::{
self, Attribute, Ident, Item, ItemConst, ItemFn, ItemTrait, ItemType, Stmt, TraitItem,
Visibility,
};
trait Name {
fn name(&self) -> Option<&Ident>;
fn is_named(&self, ident: &impl PartialEq<... |
pub fn search_file(&mut self, file: &syn::File) {
self.visit_file(file)
}
fn term(&self) -> &SelectorSegment {
self.query.part(self.depth)
}
fn can_match(&self) -> bool {
self.depth == self.query.len() - 1
}
fn search_deeper(&self, item: &syn::Item) -> ... | pub fn new(query: &'a Selector) -> Self {
Self {
query,
depth: 0,
results: vec![],
}
} | function_block-full_function | [
{
"content": "/// Parse a path, then search a file for all results that exactly match the specified\n\n/// path.\n\n///\n\n/// # Returns\n\n/// This function can find multiple items if:\n\n///\n\n/// 1. There is a module and a function of the same name\n\n/// 2. The same path is declared multiple times, differi... |
Rust | sway-core/src/asm_generation/mod.rs | FuelLabs/sway | 0190b5dac4735fd2a34528e48cc2e0c9606b5ce8 | use crate::{
asm_lang::{
allocated_ops::AllocatedRegister, virtual_register::*, Label, Op, OrganizationalOp,
VirtualImmediate12, VirtualOp,
},
parse_tree::Literal,
};
use std::{collections::BTreeSet, fmt};
use either::Either;
mod abstract_instruction_set;
pub(crate) mod checks;
pub(crate) ... | use crate::{
asm_lang::{
allocated_ops::AllocatedRegister, virtual_register::*, Label, Op, OrganizationalOp,
VirtualImmediate12, VirtualOp,
},
parse_tree::Literal,
};
use std::{collections::BTreeSet, fmt};
use either::Either;
mod abstract_instruction_set;
pub(crate) mod checks;
pub(crate) ... |
}
}
impl SwayAsmSet {
pub(crate) fn remove_unnecessary_jumps(self) -> JumpOptimizedAsmSet {
match self {
SwayAsmSet::ScriptMain {
data_section,
program_section,
} => JumpOptimizedAsmSet::ScriptMain {
data_section,
... | match self {
SwayAsmSet::ScriptMain {
data_section,
program_section,
} => write!(f, "{}\n{}", program_section, data_section),
SwayAsmSet::PredicateMain {
data_section,
program_section,
} => write!(f, "{}\n{}"... | if_condition | [
{
"content": "/// cleans whitespace, including newlines\n\npub fn clean_all_whitespace(iter: &mut Peekable<Enumerate<Chars>>) {\n\n while let Some((_, next_char)) = iter.peek() {\n\n if next_char.is_whitespace() {\n\n iter.next();\n\n } else {\n\n break;\n\n }\n\n ... |
Rust | src/parse/callgrind.rs | pganssle/cargo-profiler | b2b84463dd86af42146f34fb365311c31291d1a7 | use crate::err::ProfError;
use crate::profiler::Profiler;
use lazy_static::lazy_static;
use regex::Regex;
use std::ffi::OsStr;
use std::process::Command;
pub trait CallGrindParser {
fn callgrind_cli(&self, binary: &str, binargs: &[&OsStr]) -> Result<String, ProfError>;
fn callgrind_parse<'b>(&'b self, output: ... | use crate::err::ProfError;
use crate::profiler::Profiler;
use lazy_static::lazy_static;
use regex::Regex;
use std::ffi::OsStr;
use std::process::Command;
pub trait CallGrindParser {
fn callgrind_cli(&self, binary: &str, binargs: &[&OsStr]) -> Result<String, ProfError>;
fn callgrind_parse<'b>(&'b self, output: ... |
}
#[cfg(test)]
mod test {
use super::CallGrindParser;
use crate::profiler::Profiler;
#[test]
fn test_callgrind_parse_1() {
let output = "==6072== Valgrind's memory management: out of memory:\n ==6072== \
Whatever the reason, Valgrind cannot continue. Sorry.";
... | let data_row = match elems[0].trim().replace(",", "").parse::<f64>() {
Ok(rep) => rep,
Err(_) => return Err(ProfError::RegexError),
};
data_vec.push(data_row);
let path = elems[1].split(' ').collect::<Vec<_>>();
... | function_block-function_prefix_line | [
{
"content": "/// match the binary argument\n\npub fn get_binary<'a>(matches: &'a ArgMatches) -> Result<&'a str, ProfError> {\n\n // read binary argument, make sure it exists in the filesystem\n\n match matches.value_of(\"binary\") {\n\n Some(z) => {\n\n if !Path::new(z).exists() {\n\n ... |
Rust | src/read.rs | Stupremee/rarchive | 7510b6a3d94c686ea14996c1a5b34d251354e801 | use crate::{Archive, Error, ErrorOrIo, Filter, Format, Result};
use rarchive_sys::archive;
use std::{path::Path, ptr::NonNull};
pub struct ReadArchive {
inner: NonNull<archive>,
}
impl ReadArchive {
pub fn from_path<P: AsRef<Path>>(path: P) -> Result<Self, ErrorOrIo> {
let mut archive = Self... | use crate::{Archive, Error, ErrorOrIo, Filter, Format, Result};
use rarchive_sys::archive;
use std::{path::Path, ptr::NonNull};
pub struct ReadArchive {
inner: NonNull<archive>,
}
impl ReadArchive {
pub fn from_path<P: AsRef<Path>>(path: P) -> Result<Self, ErrorOrIo> {
let mut archive = Self... |
fn set_format_option(&mut self, module: &str, option: &str, value: &str) -> Result<()> {
Error::from_code(self, || unsafe {
rarchive_sys::archive_read_set_format_option(
self.as_mut_ptr(),
module.as_ptr() as _,
option.as_ptr() as _,
... | fn set_filter_option(&mut self, module: &str, option: &str, value: &str) -> Result<()> {
Error::from_code(self, || unsafe {
rarchive_sys::archive_read_set_filter_option(
self.as_mut_ptr(),
module.as_ptr() as _,
option.as_ptr() as _,
val... | function_block-full_function | [
{
"content": "/// Common trait that is implemented for [`ReadArchive`] and [`WriteArchive`]\n\n/// to provide common operations.\n\n///\n\n/// [`ReadArchive`]: ./struct.ReadArchive.html\n\n/// [`WriteArchive`]: ./struct.WriteArchive.html\n\npub trait Archive {\n\n /// Returns a pointer to the underlying raw ... |
Rust | src/constants.rs | Alex6323/iota-lz4-udp | 7d0c234ff9cc99463d58170fc2e5d0b564df0626 | use lazy_static::lazy_static;
use regex::Regex;
type Field = (usize, usize, usize, usize, usize, usize);
pub const SIGNATURE_FRAGMENTS: Field = (0, 6561, 0, 2187, 0, 1458);
pub const EXTRA_DATA_DIGEST: Field = (6561, 243, 2187, 81, 1458, 54);
pub const ADDRESS: Field = (6804, 243, 2268, 81, 1512, 54);
pub const VALUE:... | use lazy_static::lazy_static;
use regex::Regex;
type Field = (usize, usize, usize, usize, usize, usize);
pub const SIGNATURE_FRAGMENTS: Field = (0, 6561, 0, 2187, 0, 1458);
pub const EXTRA_DATA_DIGEST: Field = (6561, 243, 2187, 81, 1458, 54);
pub const ADDRESS: Field = (6804, 243, 2268, 81, 1512, 54);
pub const VALUE:... |
assert_eq!(sum, TRANSACTION_SIZE_TRYTES);
}
#[test]
fn test_transaction_tryte_offset_constants() {
assert_eq!(SIGNATURE_FRAGMENTS.0 / 3, SIGNATURE_FRAGMENTS.2);
assert_eq!(EXTRA_DATA_DIGEST.0 / 3, EXTRA_DATA_DIGEST.2);
assert_eq!(ADDRESS.0 / 3, ADDRESS.2);
assert_e... | let sum = SIGNATURE_FRAGMENTS.3
+ EXTRA_DATA_DIGEST.3
+ ADDRESS.3
+ VALUE.3
+ ISSUANCE_TIMESTAMP.3
+ TIMELOCK_LOWER_BOUND.3
+ TIMELOCK_UPPER_BOUND.3
+ BUNDLE_NONCE.3
+ TRUNK_HASH.3
+ BRANCH_HASH.3
+ T... | assignment_statement | [
{
"content": "pub fn from_i64_fixed9(number: i64) -> [Tryte; 9] {\n\n let is_positive = number > 0;\n\n let mut trytes = [TRYTE_TO_ASCII[0]; 9];\n\n let mut number = number.abs();\n\n let mut remainder;\n\n\n\n for t in trytes.iter_mut() {\n\n remainder = number % 27;\n\n number = i... |
Rust | relm-examples/tests/references2.rs | RadicalZephyr/relm | 925a738fb8299bd1497adaf0752919475cf9bc92 | /*
* Copyright (c) 2020 Boucher, Antoni <bouanto@zoho.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy,... | /*
* Copyright (c) 2020 Boucher, Antoni <bouanto@zoho.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy,... | ilder::new().label("Remove").build();
remove_button.set_widget_name("remove_button");
connect!(relm, remove_button, connect_clicked(_), Msg::Remove);
vbox.pack_start(&remove_button, false, false, 0);
root.show_all();
RelmWidget {
root,
vbox,
l... | fn view(relm: &relm::Relm<Self>, _model: Self::Model) -> Self {
let root = gtk::Window::new(gtk::WindowType::Toplevel);
root.set_size_request(400, 400);
connect!(
relm,
root,
connect_delete_event(_, _),
return (Some(Msg::Quit), gtk::Inhibit(fal... | random | [
{
"content": "/// After `duration` ms, emit `msg`.\n\npub fn timeout<F: Fn() -> MSG + 'static, MSG: 'static>(stream: &StreamHandle<MSG>, duration: u32, constructor: F) {\n\n let stream = stream.clone();\n\n glib::timeout_add_local(std::time::Duration::from_millis(duration as u64), move || {\n\n let... |
Rust | shell/src/shell_automaton_manager.rs | simplestaking/tezos-rs | d859dff0a8db4f5adb4885e4885217d5284f7861 |
use std::collections::HashSet;
use std::env;
use std::iter::FromIterator;
use std::net::SocketAddr;
use std::str::FromStr;
use std::sync::Arc;
use std::time::{Duration, SystemTime};
use rand::{rngs::StdRng, Rng, SeedableRng as _};
use slog::{info, warn, Logger};
use storage::{PersistentStorage, StorageInitInfo};
us... |
use std::collections::HashSet;
use std::env;
use std::iter::FromIterator;
use std::net::SocketAddr;
use std::str::FromStr;
use std::sync::Arc;
use std::time::{Duration, SystemTime};
use rand::{rngs::StdRng, Rng, SeedableRng as _};
use slog::{info, warn, Logger};
use storage::{PersistentStorage, StorageInitInfo};
us... |
pub fn shell_automaton_sender(&self) -> ShellAutomatonSender {
self.shell_automaton_sender.clone()
}
pub fn send_shutdown_signal(&self) {
if let Err(err) = self
.shell_automaton_sender
.send(ShellAutomatonMsg::Shutdown)
{
warn!(self.log, "Failed... | self.shell_automaton_thread_handle.take()
{
let shell_automaton_thread_handle = std::thread::Builder::new()
.name("shell-automaton".to_owned())
.spawn(move || {
shell_automaton.init();
while !shell_automaton.is_shu... | function_block-function_prefix_line | [
{
"content": "#[allow(dead_code)]\n\npub fn logger(empty: bool, level: Level) -> Logger {\n\n use std::io::{self, Write};\n\n\n\n use slog::Record;\n\n use slog_term::{CountingWriter, RecordDecorator, ThreadSafeTimestampFn};\n\n\n\n pub fn print_msg_header(\n\n fn_timestamp: &dyn ThreadSafeTi... |
Rust | pipelined/bevy_pbr2/src/render/light.rs | bch29/bevy | c53efeed6fb8b1e41737ea4502051fa4cf535784 | use crate::{render::MeshViewBindGroups, ExtractedMeshes, PointLight};
use bevy_ecs::{prelude::*, system::SystemState};
use bevy_math::{Mat4, Vec3, Vec4};
use bevy_render2::{
color::Color,
core_pipeline::Transparent3dPhase,
pass::*,
pipeline::*,
render_graph::{Node, NodeRunError, RenderGraphContext, ... | use crate::{render::MeshViewBindGroups, ExtractedMeshes, PointLight};
use bevy_ecs::{prelude::*, system::SystemState};
use bevy_math::{Mat4, Vec3, Vec4};
use bevy_render2::{
color::Color,
core_pipeline::Transparent3dPhase,
pass::*,
pipeline::*,
render_graph::{Node, NodeRunError, RenderGraphContext, ... |
}
impl Node for ShadowPassNode {
fn input(&self) -> Vec<SlotInfo> {
vec![SlotInfo::new(ShadowPassNode::IN_VIEW, SlotType::Entity)]
}
fn update(&mut self, world: &mut World) {
self.main_view_query.update_archetypes(world);
self.view_light_query.update_archetypes(world);
}
... | pub fn new(world: &mut World) -> Self {
Self {
main_view_query: QueryState::new(world),
view_light_query: QueryState::new(world),
}
} | function_block-full_function | [
{
"content": "/// Internally, `bevy_render` uses hashes to identify vertex attribute names.\n\npub fn get_vertex_attribute_name_id(name: &str) -> u64 {\n\n let mut hasher = bevy_utils::AHasher::default();\n\n hasher.write(&name.as_bytes());\n\n hasher.finish()\n\n}\n",
"file_path": "pipelined/bevy_... |
Rust | src/actors.rs | thomaslienbacher/Moving-Tower | adfaf169a8dc85993dd90507db9b8d702ba71f4f | use sfml::graphics::*;
use sfml::system::Vector2f;
use sfml::window::*;
use sfml::window::mouse::Button;
use crate::AssetManager;
use super::{WIN_HEIGHT, WIN_WIDTH};
pub trait Actor {
fn update(&mut self, d: f32);
fn draw(&self, win: &mut RenderWindow);
fn events(&mut self, evt: Event);
}
struct Circl... | use sfml::graphics::*;
use sfml::system::Vector2f;
use sfml::window::*;
use sfml::window::mouse::Button;
use crate::AssetManager;
use super::{WIN_HEIGHT, WIN_WIDTH};
pub trait Actor {
fn update(&mut self, d: f32);
fn draw(&self, win: &mut RenderWindow);
fn events(&mut self, evt: Event);
}
struct Circl... | Circle::new(position.x, position.y, sprite.texture_rect().width as f32 / 2.0)
};
Tower {
sprite,
teleport_circle,
hitbox,
position,
rotation: 0.0,
bullet_sprite,
bullets: Vec::new(),
dead: false,
... | NER, 36);
c.set_position(position);
c.set_outline_thickness(TOWER_OUTER - TOWER_INNER);
c.set_origin(Vector2f::new(TOWER_INNER, TOWER_INNER));
c.set_fill_color(&Color::TRANSPARENT);
c.set_outline_color(&Color::rgba(255, 255, 255, 50));
c
}... | random | [
{
"content": "pub trait Scene {\n\n fn update(&mut self, d: f32) -> Option<State>; //returns the new state if we need to change\n\n\n\n fn draw(&self, win: &mut RenderWindow);\n\n\n\n fn events(&mut self, evt: Event);\n\n}\n\n\n\npub struct MenuScene<'a> {\n\n title_text: Text<'a>,\n\n help_text:... |
Rust | src/line.rs | RoguishStudios/hexgrid | 5d19f73a56a7210ac883bb3d001b4fc60e2f49c7 |
use crate::{Coordinate, Float, Integer, Position};
use std::iter;
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
#[derive(Clone, PartialEq, Debug, PartialOrd)]
pub struct LineGenIter<I: Integer, F: Float> {
origin: Position<F>,
target: Position<F>,
n: I,
i: I,
}
impl<I:... |
use crate::{Coordinate, Float, Integer, Position};
use std::iter;
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
#[derive(Clone, PartialEq, Debug, PartialOrd)]
pub struct LineGenIter<I: Integer, F: Float> {
origin: Position<F>,
target: Position<F>,
n: I,
i: I,
}
impl<I:... |
fn size_hint(&self) -> (usize, Option<usize>) {
self.0.size_hint()
}
}
impl<I: Integer, F: Float> iter::FusedIterator for LineIterWithEdgeDetection<I, F> {}
impl<I: Integer, F: Float> iter::ExactSizeIterator for LineIterWithEdgeDetection<I, F> {}
| fn next(&mut self) -> Option<Self::Item> {
let delta: F = F::from(0.000001).unwrap();
self.0.next().map(|p| {
(
Position::from_axial(p.q + delta, p.r + delta).into_coordinate(),
Position::from_axial(p.q - delta, p.r - delta).into_coordinate(),
)
... | function_block-full_function | [
{
"content": "/// Float trait used by this library\n\npub trait Float:\n\n num::Signed\n\n + num::Float\n\n + num::ToPrimitive\n\n + num::FromPrimitive\n\n + num::NumCast\n\n + num::One\n\n + num::Zero\n\n + std::marker::Copy\n\n + std::ops::AddAssign\n\n + std::default::Default\n\... |
Rust | client/tests/tests/add_asset.rs | satu-n/iroha | 97e63b3895fb1469d5420e16ec7a4563b61cdf76 | #![allow(clippy::restriction)]
use std::{convert::TryFrom, thread};
use eyre::Result;
use iroha_client::client;
use iroha_core::config::Configuration;
use iroha_data_model::{fixed::Fixed, prelude::*};
use test_network::{Peer as TestPeer, *};
#[test]
fn client_add_asset_quantity_to_existing_asset_should_increase_asse... | #![allow(clippy::restriction)]
use std::{convert::TryFrom, thread};
use eyre::Result;
use iroha_client::client;
use iroha_core::config::Configuration;
use iroha_data_model::{fixed::Fixed, prelude::*};
use test_network::{Peer as TestPeer, *};
#[test]
fn client_add_asset_quantity_to_existing_asset_should_increase_asse... | = MintBox::new(
Value::Fixed(quantity),
IdBox::AssetId(AssetId::new(
asset_definition_id.clone(),
account_id.clone(),
)),
);
test_client.submit_till(
mint,
client::asset::by_account_id(account_id.clone()),
|result| {
result.ite... | ifiable_box =
IdentifiableBox::from(AssetDefinition::with_precision(asset_definition_id.clone()));
let create_asset = RegisterBox::new(identifiable_box);
test_client.submit(create_asset)?;
thread::sleep(pipeline_time * 2);
let quantity: Fixed = Fixed::try_from(123.45_f64).unwrap();
le... | random | [
{
"content": "fn mint_asset(quantity: u32, asset: &str, account: &str) -> Instruction {\n\n Instruction::Mint(MintBox::new(\n\n Value::U32(quantity),\n\n AssetId::from_names(asset, DOMAIN, account, DOMAIN),\n\n ))\n\n}\n\n#[tokio::test]\n\nasync fn find_asset() {\n\n AssertSet::new()\n\n ... |
Rust | src/renderer/wgpu_renderer.rs | takahirox/wgpu-rust-renderer | 38dd6b0e60563229384bd33140b1bd51e09f23fc | use winit::window::Window;
use crate::{
geometry::{
attribute::Attribute,
geometry::Geometry,
index::Index,
},
material::material::Material,
renderer::{
wgpu_attributes::WGPUAttributes,
wgpu_bindings::WGPUBindings,
wgpu_indices::WGPUIndices,
wgpu_render_pipeline::WGPURenderPipelines,
wgpu_samplers:... | use winit::window::Window;
use crate::{
geometry::{
attribute::Attribute,
geometry::Geometry,
index::Index,
},
material::material::Material,
renderer::{
wgpu_attributes::WGPUAttributes,
wgpu_bindings::WGPUBindings,
wgpu_indices::WGPUIndices,
wgpu_render_pipeline::WGPURenderPipelines,
wgpu_samplers:... |
if let Some(rid) = geometry.borrow_attribute("position") {
self.attributes.update(&self.device, pools, rid);
}
if let Some(rid) = geometry.borrow_attribute("normal") {
self.attributes.update(&self.device, pools, rid);
}
if let Some(rid) = geometry.borrow_attribute("uv") {
self.attribute... | let material = match material_pool.borrow(mesh.borrow_material()) {
Some(material) => material,
None => continue,
}; | assignment_statement | [
{
"content": "pub fn get_window_device_pixel_ratio() -> f64 {\n\n\tlet window = web_sys::window().unwrap();\n\n\twindow.device_pixel_ratio()\n\n}\n\n\n",
"file_path": "web/examples/utils/window.rs",
"rank": 0,
"score": 218816.77958122682
},
{
"content": "pub fn get_window_inner_size() -> (f6... |
Rust | src/bxdf/bsdf.rs | joeftiger/Rust-V | bac9029eba6eefcff2d831acdc91a99168622382 | use crate::bxdf::{same_hemisphere, world_to_bxdf, BxDF, BxDFSample, BxDFSampleResult, Type};
use crate::debug_utils::is_normalized;
use crate::samplers::Sample;
use crate::*;
use serde::{Deserialize, Serialize};
#[derive(Serialize, Deserialize, Default)]
pub struct BSDF {
#[serde(default)]
bxdfs: Vec<Box<dyn B... | use crate::bxdf::{same_hemisphere, world_to_bxdf, BxDF, BxDFSample, BxDFSampleResult, Type};
use crate::debug_utils::is_normalized;
use crate::samplers::Sample;
use crate::*;
use serde::{Deserialize, Serialize};
#[derive(Serialize, Deserialize, Default)]
pub struct BSDF {
#[serde(default)]
bxdfs: Vec<Box<dyn B... |
pub fn evaluate_bxdf_light_wave(
bxdf: &dyn BxDF,
normal: Vector3,
incident_world: Vector3,
outgoing_world: Vector3,
light_wave_index: usize,
) -> Float {
let rotation = world_to_bxdf(normal);
let incident = rotation * incident_world;
let outgoin... | s &= !Type::REFLECTION;
}
self.bxdfs
.iter()
.filter_map(|bxdf| {
if bxdf.is_type(types) {
Some(bxdf.evaluate_wavelength(incident, outgoing, light_wave_index))
} else {
None
}
})
... | function_block-function_prefixed | [
{
"content": "#[inline(always)]\n\npub fn flip(mut v: Vector3) -> Vector3 {\n\n debug_assert!(is_finite(v));\n\n\n\n v.y = -v.y;\n\n v\n\n}\n\n\n",
"file_path": "src/bxdf/mod.rs",
"rank": 0,
"score": 314455.87686131534
},
{
"content": "/// Computes the Fresnel reflection for dielect... |
Rust | sentry/src/hash.rs | agaviria/oxide | bb0b274da172a3223283280f6b213673f4c54dc4 | use std::str::FromStr;
use argonautica::{
self,
config::{Variant, Version},
{Hasher, Verifier},
input::SecretKey,
};
use crate::error::{Error, ErrorKind, ParseError};
use failure::format_err;
const SALT_SIZE : usize = 32;
enum HashVersion {
V1,
}
impl HashVersion {
pub fn from_hash(hash: &str) -> Option<HashV... | use std::str::FromStr;
use argonautica::{
self,
config::{Variant, Version},
{Hasher, Verifier},
input::SecretKey,
};
use crate::error::{Error, ErrorKind, ParseError};
use failure::format_err;
const SALT_SIZE : usize = 32;
enum HashVersion {
V1,
}
impl HashVersion {
pub fn from_hash(hash: &str) -> Option<HashV... |
pub fn from_bytes<B: AsRef<[u8]>, C: AsRef<[u8]>>(b0: B, b1: C) ->
Result<Self, ParseError> {
let salt_byte = b0.as_ref();
let hash_byte= b1.as_ref();
validate!(
salt_byte.len() != 32 || hash_byte.len() != 32,
ParseError::InvalidLen
);
let mut salt = [0u8; 32];
let mut hash = [0u8; 32];... | pub fn check(&self, password: &str) -> Result<bool, Error> {
let key = load_env_var("SECRET_KEY")?;
let mut verifier = Verifier::new();
let is_valid = if verifier
.with_secret_key(&key)
.with_password(password)
.verify()
.is_ok()
{
true
} else {
false
};
Ok(is_valid)
} | function_block-full_function | [
{
"content": "/// decrypt_aud() takes in AES 256-bit base64 encoded string and decrypts it.\n\npub fn decrypt_aud(audience_identifier: &str) -> Result<String, Error> {\n\n\tlet key: Option<&String> = MASTER_ASAP_KEY.get();\n\n\tlet mut secret: MagicCrypt = new_magic_crypt!(key.unwrap().as_str(), 256);\n\n\tlet ... |
Rust | operators/src/util/input/multi_raster_or_vector.rs | koerberm/geoengine | 61e0ec7a0c1136b4360b0f9c6306c34198e8ac3a | use crate::engine::{OperatorDatasets, RasterOperator, VectorOperator};
use geoengine_datatypes::dataset::DatasetId;
use serde::{Deserialize, Serialize};
#[derive(Debug, Clone, Serialize, Deserialize)]
#[serde(untagged)]
pub enum MultiRasterOrVectorOperator {
Raster(Vec<Box<dyn RasterOperator>>),
Vector(Box<dyn... | use crate::engine::{OperatorDatasets, RasterOperator, VectorOperator};
use geoengine_datatypes::dataset::DatasetId;
use serde::{Deserialize, Serialize};
#[derive(Debug, Clone, Serialize, Deserialize)]
#[serde(untagged)]
pub enum MultiRasterOrVectorOperator {
Raster(Vec<Box<dyn RasterOperator>>),
Vector(Box<dyn... |
}
| attribute_projection": null,
}
})
.to_string();
let raster_or_vector_operator: MultiRasterOrVectorOperator =
serde_json::from_str(&workflow).unwrap();
assert!(raster_or_vector_operator.is_vector());
assert!(!raster_or_vector_operator.is_raster());
} | function_block-function_prefix_line | [
{
"content": "// TODO: move test helper somewhere else?\n\npub fn add_ndvi_dataset(ctx: &mut MockExecutionContext) -> DatasetId {\n\n let id: DatasetId = InternalDatasetId::new().into();\n\n ctx.add_meta_data(id.clone(), Box::new(create_ndvi_meta_data()));\n\n id\n\n}\n\n\n",
"file_path": "operator... |
Rust | 9-smoke-basin/src/main.rs | coreyja/advent-of-code-2021 | cea92fda8a849918dbbe26d007d57d5bc824d3ee | use anyhow::{anyhow, Result};
use itertools::{iproduct, Itertools};
#[derive(Debug)]
struct Board {
cells: Vec<Vec<i32>>,
}
impl Board {
fn get(&self, pos: &Pos) -> i32 {
self.cells[pos.0 as usize][pos.1 as usize]
}
}
#[derive(Debug, Clone)]
struct Pos(i32, i32);
impl Pos {
fn new(x: i32, y:... | use anyhow::{anyhow, Result};
use itertools::{iproduct, Itertools};
#[derive(Debug)]
struct Board {
cells: Vec<Vec<i32>>,
}
impl Board {
fn get(&self, pos: &Pos) -> i32 {
self.cells[pos.0 as usize][pos.1 as usize]
}
}
#[derive(Debug, Clone)]
struct Pos(i32, i32);
impl Pos {
fn new(x: i32, y:... |
}
fn parse_input(s: &str) -> Result<Board> {
fn parse_line(s: &str) -> Result<Vec<i32>> {
s.trim()
.chars()
.map(|s| s.to_string().parse().map_err(|_| anyhow!("Parse error")))
.collect()
}
let cells = s
.trim()
.lines()
.map(parse_line)
... | e][pos.1 as usize] = true;
let value = board.get(&pos);
if value != 9 {
size += 1;
for n in pos.get_neighbours(board).into_iter() {
queue.push(n);
}
}
}
size
} | function_block-function_prefixed | [
{
"content": "fn part2_ans(s: &str) -> Result<(usize, u32, u32)> {\n\n let nums = parse_input(s)?;\n\n\n\n (0..nums.len())\n\n .map(|i| {\n\n (\n\n i,\n\n sum_of_additions_diff(&nums, i as u32),\n\n sum_of_diff(&nums, i as u32),\n\n ... |
Rust | src/parser/parameters.rs | hoodie/icalendar-rs | c0ffee24858e0739b9964395d0ae61f6a582aa94 | use nom::{
branch::alt,
bytes::complete::{tag, take_till1},
character::complete::space0,
combinator::{eof, map, opt},
error::{convert_error, ContextError, ParseError, VerboseError},
multi::many0,
sequence::{preceded, separated_pair, tuple},
Finish, IResult,
};
#[cfg(test)]
use nom::erro... | use nom::{
branch::alt,
bytes::complete::{tag, take_till1},
character::complete::space0,
combinator::{eof, map, opt},
error::{convert_error, ContextError, ParseError, VerboseError},
multi::many0,
sequence::{preceded, separated_pair, tuple},
Finish, IResult,
};
#[cfg(test)]
use nom::erro... | ),
remove_empty_string_parsed,
),
)),
|(key, val)| Parameter { key, val },
)(input)
}
#[test]
pub fn parse_parameter_list() {
assert_parser!(
parameters,
";KEY=VALUE",
vec![Parameter::new_ref("KEY", Some("VALUE"))]
);
assert_parser!(
... | preceded(
tag("="),
map(
alt((eof, take_till1(|x| x == ';' || x == ':'))),
ParseString::from,
),
) | call_expression | [
{
"content": "pub fn valid_key_sequence_cow<'a, E: ParseError<&'a str> + ContextError<&'a str>>(\n\n input: &'a str,\n\n) -> IResult<&'a str, ParseString<'a>, E> {\n\n map(\n\n take_while(|c: char| {\n\n c == '.' || c == ',' || c == '/' || c == '_' || c == '-' || c.is_alphanumeric()\n\n ... |
Rust | crates/noirc_frontend/src/hir/type_check/mod.rs | guipublic/noir | f581f68795c8c4fa04daece8e0461211c4fab417 | mod errors;
mod expr;
mod stmt;
use errors::TypeCheckError;
use expr::type_check_expression;
use crate::node_interner::{FuncId, NodeInterner};
pub fn type_check_func(interner: &mut NodeInterner, func_id: FuncId) -> Result<(), TypeCheckError> {
let meta = interner.function_meta(&func_id);
let d... | mod errors;
mod expr;
mod stmt;
use errors::TypeCheckError;
use expr::type_check_expression;
use crate::node_interner::{FuncId, NodeInterner};
pub fn type_check_func(interner: &mut NodeInterner, func_id: FuncId) -> Result<(), TypeCheckError> {
let meta = interner.function_meta(&func_id);
let d... |
#[test]
fn basic_call_expr() {
let src = r#"
fn main(x : Field) {
priv _z = x + foo(x);
}
fn foo(x : Field) -> Field {
x
}
"#;
type_check_src_code(src, vec![String::from("main"), String::from("foo")]);
... | fn basic_index_expr() {
let src = r#"
fn main(x : Field) {
let k = [x,x];
priv _z = x + k[0];
}
"#;
type_check_src_code(src, vec![String::from("main")]);
} | function_block-function_prefix_line | [
{
"content": "fn parse_let_statement(parser: &mut Parser) -> Result<LetStatement, ParserErrorKind> {\n\n let generic_stmt = parse_generic_decl_statement(parser)?;\n\n\n\n let stmt = LetStatement {\n\n identifier: generic_stmt.identifier,\n\n r#type: generic_stmt.typ.unwrap_or(Type::Unspecifi... |
Rust | etk-asm/src/disasm.rs | Sheikh-A/etk | f22319ecd69bad0dd84124a47b506d0bdc8d2866 |
mod error {
use snafu::{Backtrace, Snafu};
use super::Offset;
#[derive(Debug, Snafu)]
#[snafu(visibility = "pub(super)")]
#[non_exhaustive]
pub enum Error {
#[non_exhaustive]
Truncated {
remaining: Offset<Vec<u8>>,
... |
mod error {
use snafu::{Backtrace, Snafu};
use super::Offset;
#[derive(Debug, Snafu)]
#[snafu(visibility = "pub(super)")]
#[non_exhaustive]
pub enum Error {
#[non_exhaustive]
Truncated {
remaining: Offset<Vec<u8>>,
... |
}
| fn push5() {
let input = hex!("640102030405");
let expected = [Offset::new(0, Op::Push5(hex!("0102030405").into()))];
let mut dasm = Disassembler::new();
dasm.write_all(&input).unwrap();
let actual: Vec<_> = dasm.ops().collect();
assert_eq!(expected, actual.as_slice())... | function_block-full_function | [
{
"content": "#[doc(hidden)]\n\npub trait Immediate<const N: usize>: Debug + Clone + Eq + PartialEq {\n\n fn extra_len() -> usize {\n\n N\n\n }\n\n}\n\n\n\nimpl<T, const N: usize> Immediate<N> for [T; N] where T: Debug + Clone + Eq + PartialEq {}\n\nimpl<const N: usize> Immediate<N> for Imm<[u8; N]... |
Rust | src/main.rs | Nukesor/geil | a536173698885d0e98689d2efd195a90493e0114 | use std::collections::HashMap;
use std::env::vars;
use anyhow::Result;
use clap::Parser;
use indicatif::{ProgressBar, ProgressStyle};
use log::error;
use rayon::prelude::*;
use simplelog::{Config, LevelFilter, SimpleLogger};
mod cli;
mod display;
mod git;
mod process;
mod repository_info;
mod state;
use cli::*;
use ... | use std::collections::HashMap;
use std::env::vars;
use anyhow::Result;
use clap::Parser;
use indicatif::{ProgressBar, ProgressStyle};
use log::error;
use rayon::prelude::*;
use simplelog::{Config, LevelFilter, SimpleLogger};
mod cli;
mod display;
mod git;
mod process;
mod repository_info;
mod state;
use cli::*;
use ... | fn main() -> Result<()> {
let opt = CliArguments::parse();
let level = match opt.verbose {
0 => LevelFilter::Error,
1 => LevelFilter::Warn,
2 => LevelFilter::Info,
_ => LevelFilter::Debug,
};
SimpleLogger::init(level, Config::default()).unwrap();
let mut s... | function_block-full_function | [
{
"content": "pub fn format_state(state: &RepositoryState) -> Cell {\n\n match state {\n\n RepositoryState::Updated => Cell::new(\"Updated\").fg(Color::Green),\n\n RepositoryState::UpToDate => Cell::new(\"Up to date\").fg(Color::DarkGreen),\n\n RepositoryState::Fetched => Cell::new(\"Fet... | |
Rust | src/frontend/server.rs | neofight78/chrust | bfc1cb762b7b2859a02d5ada6fd995a70961772a | use super::{
responses::{SettingsResponse, ValidateResponse},
};
use crate::{
frontend::responses::MoveOptionsResponse,
game::chessgame::{is_valid, process_fen, valid_moves},
state::programstate::ProgramState,
};
use rocket::{
get,
http::ContentType,
post,
response::{
content::{C... | use super::{
responses::{SettingsResponse, ValidateResponse},
};
use crate::{
frontend::responses::MoveOptionsResponse,
game::chessgame::{is_valid, process_fen, valid_moves},
state::programstate::ProgramState,
};
use rocket::{
get,
http::ContentType,
post,
response::{
content::{C... |
.mount("/chrust/api", routes![validate])
.mount("/chrust/api", routes![settings])
.launch()
.await
}
| tings {
program_state: Mutex::from(ps),
})
.manage(ImageMap {
map: init_image_map(),
})
.mount("/chrust", routes![index])
.mount("/chrust/js", routes![javascript])
.mount("/chrust/css", routes![css])
.mount("/img", routes![chesspiece])
... | function_block-random_span | [
{
"content": "pub fn get_args() -> Result<ProgramState, Box<dyn std::error::Error>> {\n\n let matches = App::new(\"Chrust\")\n\n .version(\"0.2.0\")\n\n .author(\"John YB. <jyenterbriars@gmail.com>\")\n\n .about(\"Simple Chess Engine\")\n\n .arg(\n\n Arg::new(\"viz\")\n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.