= blocks.iter().map(|x| x.header().hash()).collect();\n\n\n\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\n\n assert!(\n\n is_long_prefix(&block_hashes_from_logs, &blocks_hashes),\n\n \"server blocks: {:?} | client blocks: {:?}\",\n\n block_hashes_from_logs,\n\n blocks_hashes\n\n );\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":20,"score":160506.16352663896},{"content":"#[test]\n\npub fn test_correct_error_is_returned_for_incorrect_path() {\n\n let qcli: JCli = Default::default();\n\n let config = NodeConfigBuilder::new().build();\n\n let incorrect_uri = format!(\"http://{}/api/api\", config.rest.listen);\n\n\n\n qcli.rest()\n\n .v0()\n\n .tip_expect_fail(incorrect_uri, \"tcp connect error\");\n\n}\n","file_path":"testing/quibitous-integration-tests/src/qcli/rest/tip.rs","rank":21,"score":160491.31125487763},{"content":"#[test]\n\n#[cfg(windows)]\n\npub fn cors_single_domain() -> Result<(), Box<dyn std::error::Error>> {\n\n let temp_dir = TempDir::new().unwrap();\n\n\n\n let config = ConfigurationBuilder::new()\n\n .with_rest_cors_config(Cors {\n\n allowed_origins: vec![\"http://domain.com\".to_owned().into()],\n\n max_age_secs: None,\n\n allowed_headers: vec![],\n\n allowed_methods: vec![],\n\n })\n\n .build(&temp_dir);\n\n\n\n let quibitous = Starter::new().config(config).start_async().unwrap();\n\n\n\n let mut rest_client = quibitous.rest();\n\n rest_client.set_origin(\"http://domain.com\");\n\n\n\n assert!(rest_client.raw().stats()?.status().is_success());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/cors.rs","rank":22,"score":159335.08755759193},{"content":"#[test]\n\npub fn cors_illegal_domain() -> Result<(), Box<dyn std::error::Error>> {\n\n let temp_dir = TempDir::new().unwrap();\n\n\n\n let config = ConfigurationBuilder::new()\n\n .with_rest_cors_config(Cors {\n\n allowed_origins: vec![\"http://domain.com\".to_owned().into()],\n\n max_age_secs: None,\n\n allowed_headers: vec![],\n\n allowed_methods: vec![],\n\n })\n\n .build(&temp_dir);\n\n\n\n let quibitous = Starter::new().config(config).start().unwrap();\n\n\n\n let mut rest_client = quibitous.rest();\n\n rest_client.set_origin(\"http://other_domain.com\");\n\n\n\n assert_request_failed_due_to_cors(&rest_client)?;\n\n Ok(())\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/cors.rs","rank":23,"score":159335.08755759193},{"content":"#[test]\n\npub fn cors_multi_domain() -> Result<(), Box<dyn std::error::Error>> {\n\n let temp_dir = TempDir::new().unwrap();\n\n\n\n let config = ConfigurationBuilder::new()\n\n .with_rest_cors_config(Cors {\n\n allowed_origins: vec![\"http://domain.com;http://other_domain.com\"\n\n .to_owned()\n\n .into()],\n\n max_age_secs: None,\n\n allowed_headers: vec![],\n\n allowed_methods: vec![],\n\n })\n\n .build(&temp_dir);\n\n\n\n Starter::new()\n\n .config(config)\n\n .start_fail(\"invalid value: string \\\"http://domain.com;http://other_domain.com\\\"\");\n\n\n\n Ok(())\n\n}\n","file_path":"testing/quibitous-integration-tests/src/quibitous/cors.rs","rank":24,"score":159335.08755759193},{"content":"#[test]\n\npub fn cors_wrong_delimiter() -> Result<(), Box<dyn std::error::Error>> {\n\n let temp_dir = TempDir::new().unwrap();\n\n\n\n let config = ConfigurationBuilder::new()\n\n .with_rest_cors_config(Cors {\n\n allowed_origins: vec![\"http://domain.com,http://other_domain.com\"\n\n .to_owned()\n\n .into()],\n\n max_age_secs: None,\n\n allowed_headers: vec![],\n\n allowed_methods: vec![],\n\n })\n\n .build(&temp_dir);\n\n\n\n Starter::new()\n\n .config(config)\n\n .start_fail(\"rest.cors.allowed_origins[0]: invalid value\");\n\n Ok(())\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/cors.rs","rank":25,"score":159335.08755759193},{"content":"/// open the given file path as a writable stream, or stdout if no path\n\n/// provided\n\npub fn open_file_write<P: AsRef<Path>>(path: &Option<P>) -> Result<impl Write, Error> {\n\n match path {\n\n Some(path) => {\n\n let writer = std::fs::OpenOptions::new()\n\n .create(true)\n\n .write(true)\n\n .read(false)\n\n .append(false)\n\n .truncate(true)\n\n .open(path)?;\n\n Ok(Box::new(writer) as Box<dyn Write>)\n\n }\n\n None => Ok(Box::new(stdout()) as Box<dyn Write>),\n\n }\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/utils/io.rs","rank":26,"score":158619.3495800232},{"content":"#[test]\n\npub fn cors_malformed_domain_no_http() -> Result<(), Box<dyn std::error::Error>> {\n\n let temp_dir = TempDir::new().unwrap();\n\n let config = ConfigurationBuilder::new()\n\n .with_rest_cors_config(Cors {\n\n allowed_origins: vec![\"domain.com\".to_owned().into()],\n\n max_age_secs: None,\n\n allowed_headers: vec![],\n\n allowed_methods: vec![],\n\n })\n\n .build(&temp_dir);\n\n\n\n Starter::new()\n\n .config(config)\n\n .start_fail(\"invalid value: string \\\"domain.com\\\"\");\n\n Ok(())\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/cors.rs","rank":27,"score":157817.38701522426},{"content":"#[test]\n\n#[cfg(windows)]\n\npub fn cors_ip_versus_domain() -> Result<(), Box<dyn std::error::Error>> {\n\n let temp_dir = TempDir::new().unwrap();\n\n\n\n let config = ConfigurationBuilder::new()\n\n .with_rest_cors_config(Cors {\n\n allowed_origins: vec![\"http://127.0.0.1\".to_owned().into()],\n\n max_age_secs: None,\n\n allowed_headers: vec![],\n\n allowed_methods: vec![],\n\n })\n\n .build(&temp_dir);\n\n\n\n let quibitous = Starter::new().config(config).start_async().unwrap();\n\n\n\n let mut rest_client = quibitous.rest();\n\n rest_client.set_origin(\"http://localhost\");\n\n\n\n assert_eq!(rest_client.raw().stats()?.status(), 403);\n\n Ok(())\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/cors.rs","rank":28,"score":157817.38701522426},{"content":"pub fn parse_shift(from: &str) -> Result<(BlockDate, bool), BlockDateParseError> {\n\n if let Some(stripped) = from.strip_prefix('~') {\n\n BlockDate::from_str(stripped).map(|d| (d, true))\n\n } else {\n\n BlockDate::from_str(from).map(|d| (d, false))\n\n }\n\n}\n","file_path":"testing/mfive/src/mfive_lib/args.rs","rank":29,"score":157239.953042924},{"content":"/// open the given file path as a readable stream, or stdin if no path\n\n/// provided\n\npub fn open_file_read<P: AsRef<Path>>(path: &Option<P>) -> Result<impl BufRead, Error> {\n\n match path {\n\n Some(path) => {\n\n let reader = std::fs::OpenOptions::new()\n\n .create(false)\n\n .write(false)\n\n .read(true)\n\n .append(false)\n\n .open(path)?;\n\n Ok(Box::new(BufReader::new(reader)) as Box<dyn BufRead>)\n\n }\n\n None => Ok(Box::new(BufReader::new(stdin())) as Box<dyn BufRead>),\n\n }\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/utils/io.rs","rank":30,"score":156508.6200901315},{"content":"#[test]\n\npub fn test_correct_error_is_returned_for_non_existent_genesis_block() {\n\n let temp_dir = TempDir::new().unwrap();\n\n let block_file = temp_dir.child(\"block-0.bin\");\n\n let qcli: JCli = Default::default();\n\n qcli.genesis().hash_expect_fail(block_file.path(), \"file\");\n\n}\n","file_path":"testing/quibitous-integration-tests/src/qcli/genesis/hash.rs","rank":31,"score":155358.54187351058},{"content":"pub fn spawn_network(args: Args) -> Result<(), Error> {\n\n let config: Config = serde_yaml::from_reader(File::open(&args.config)?)?;\n\n let topology = config.build_topology();\n\n\n\n match &config.session.mode {\n\n SessionMode::Standard => standard::spawn_network(config, topology, args),\n\n SessionMode::Monitor => monitor::spawn_network(config, topology, args),\n\n SessionMode::Interactive => interactive::spawn_network(config, topology),\n\n }\n\n}\n","file_path":"testing/quantricity/src/spawn/mod.rs","rank":32,"score":148500.73174789836},{"content":"pub fn gen_pub_key<K>(priv_key_bech32: &[u5]) -> Result<String, Error>\n\nwhere\n\n K: AsymmetricKey,\n\n PublicKey<K::PubAlg>: Bech32,\n\n{\n\n let priv_key_bytes = Vec::<u8>::from_base32(priv_key_bech32).map_err(Bech32Error::from)?;\n\n let priv_key = <SecretKey<K>>::from_binary(&priv_key_bytes)?;\n\n let pub_key = priv_key.to_public();\n\n Ok(pub_key.to_bech32_str())\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/key.rs","rank":33,"score":148034.95087617688},{"content":"#[derive(Error, Debug)]\n\nenum PropagateError {\n\n #[error(\"Error sending message to task due to {0}\")]\n\n InternalCommSend(#[from] futures::channel::mpsc::SendError),\n\n #[error(\"Error receving message from task due to {0}\")]\n\n InternalCommRecv(#[from] crate::intercom::Error),\n\n}\n\n\n","file_path":"quibitous/src/network/mod.rs","rank":34,"score":146900.6657001754},{"content":"/// prepare the block storage from the given settings\n\npub fn prepare_storage(setting: &Settings) -> Result<Storage, Error> {\n\n let span = span!(Level::TRACE, \"sub_task\", kind = \"storage\");\n\n let storage_span = span.clone();\n\n let _enter = span.enter();\n\n if let Some(dir) = &setting.storage {\n\n std::fs::create_dir_all(dir).map_err(|err| Error::Io {\n\n source: err,\n\n reason: ErrorKind::BlockStorage,\n\n })?;\n\n\n\n tracing::info!(\"storing blockchain in '{:?}'\", dir);\n\n\n\n Storage::file(dir, storage_span).map_err(Into::into)\n\n } else {\n\n Storage::memory(storage_span).map_err(Into::into)\n\n }\n\n}\n\n\n\n/// Try to fetch the block0_id from the HTTP base URL (services) in the array\n\n///\n","file_path":"quibitous/src/start_up/mod.rs","rank":35,"score":145525.8274702543},{"content":"/// Checks if the multiaddr is valid for contacting a p2p peer\n\n/// and resolves DNS components.\n\n///\n\n/// Note that DNS resolution is performed synchronously by this function,\n\n/// so this should only be used at initialization.\n\npub fn resolve_dns(addr: &Multiaddr) -> Result<Multiaddr, Error> {\n\n let mut components = addr.iter();\n\n\n\n let ip_or_fqdn = components.next().ok_or(Error::InvalidMultiaddr)?;\n\n let port = components\n\n .next()\n\n .and_then(|ac| {\n\n if let Protocol::Tcp(port) = ac {\n\n Some(port)\n\n } else {\n\n None\n\n }\n\n })\n\n .ok_or(Error::InvalidMultiaddr)?;\n\n\n\n let socket_addr = match ip_or_fqdn {\n\n Protocol::Ip4(addr) => SocketAddrV4::new(addr, port).into(),\n\n Protocol::Ip6(addr) => SocketAddrV6::new(addr, port, 0, 0).into(),\n\n Protocol::Dns(fqdn) => (fqdn.borrow(), port)\n\n .to_socket_addrs()\n","file_path":"quibitous-lib/src/multiaddr.rs","rank":36,"score":145525.13174735187},{"content":"enum ApplyFragmentError {\n\n DoesNotFit,\n\n SoftDeadlineReached,\n\n Rejected(String),\n\n}\n\n\n","file_path":"quibitous/src/fragment/selection.rs","rank":37,"score":144292.09988631494},{"content":"pub fn get_block<S: Into<String>>(block0: S) -> Result<Block0Configuration, Block0Error> {\n\n let block0 = block0.into();\n\n let block = {\n\n if Path::new(&block0).exists() {\n\n let reader = std::fs::OpenOptions::new()\n\n .create(false)\n\n .write(false)\n\n .read(true)\n\n .append(false)\n\n .open(&block0)?;\n\n let reader = BufReader::new(reader);\n\n Block::deserialize(reader)?\n\n } else if Url::parse(&block0).is_ok() {\n\n let response = reqwest::blocking::get(&block0)?;\n\n let block0_bytes = response.bytes()?.to_vec();\n\n Block::read(&mut ReadBuf::from(&block0_bytes))?\n\n } else {\n\n panic!(\" block0 should be either path to filesystem or url \");\n\n }\n\n };\n\n Block0Configuration::from_block(&block).map_err(Into::into)\n\n}\n\n\n","file_path":"testing/quibitous-automation/src/testing/block0.rs","rank":38,"score":140699.12661841096},{"content":"#[ignore]\n\npub fn max_connections() {\n\n let mut controller = NetworkBuilder::default()\n\n .topology(\n\n Topology::default()\n\n .with_node(Node::new(LEADER1))\n\n .with_node(Node::new(LEADER2).with_trusted_peer(LEADER1))\n\n .with_node(Node::new(LEADER3).with_trusted_peer(LEADER1))\n\n .with_node(Node::new(LEADER4).with_trusted_peer(LEADER1)),\n\n )\n\n .blockchain_config(\n\n Blockchain::default().with_leaders(vec![LEADER1, LEADER2, LEADER3, LEADER4]),\n\n )\n\n .build()\n\n .unwrap();\n\n\n\n let leader1 = controller\n\n .spawn(\n\n SpawnParams::new(LEADER1)\n\n .in_memory()\n\n .max_inbound_connections(2),\n","file_path":"testing/quibitous-integration-tests/src/networking/p2p/connections.rs","rank":39,"score":139965.2793435349},{"content":"pub fn spawn_network(config: Config, topology: Topology) -> Result<(), Error> {\n\n let controller = NetworkBuilder::default()\n\n .topology(topology)\n\n .blockchain_config(config.build_blockchain())\n\n .session_settings(config.session)\n\n .build()?;\n\n\n\n let user_integration = quibitous_user_interaction();\n\n\n\n let mut interactive_commands = QuibitousInteractiveCommandExec {\n\n controller: UserInteractionController::new(controller),\n\n };\n\n\n\n user_integration\n\n .interact(&mut interactive_commands)\n\n .map_err(Into::into)\n\n}\n\n\n","file_path":"testing/quantricity/src/spawn/interactive.rs","rank":40,"score":139015.33550606866},{"content":"pub fn assert(statement: bool, info: &str) -> Result<(), Error> {\n\n if !statement {\n\n return Err(Error::VerificationFailed(info.to_string()));\n\n }\n\n Ok(())\n\n}\n","file_path":"testing/quibitous-automation/src/testing/verify.rs","rank":41,"score":139015.33550606866},{"content":"pub fn read_initials<P: AsRef<Path>>(initials: P) -> Result<Vec<Initial>, Block0Error> {\n\n let contents = std::fs::read_to_string(&initials)?;\n\n let value: serde_json::Value = serde_json::from_str(&contents)?;\n\n let initial = serde_json::to_string(&value[\"initial\"])?;\n\n serde_json::from_str(&initial).map_err(Into::into)\n\n}\n\n\n","file_path":"testing/quibitous-automation/src/testing/block0.rs","rank":42,"score":137552.9651578845},{"content":"fn match_block0(expected: HeaderHash, peer_responded: HeaderHash) -> Result<(), ConnectError> {\n\n if expected == peer_responded {\n\n Ok(())\n\n } else {\n\n Err(ConnectError::Block0Mismatch {\n\n expected,\n\n peer_responded,\n\n })\n\n }\n\n}\n","file_path":"quibitous/src/network/client/connect.rs","rank":43,"score":136588.9035701551},{"content":"fn encode_block_0(common: Common) -> Result<(), Error> {\n\n let reader = common.input.open()?;\n\n let genesis: Block0Configuration =\n\n serde_yaml::from_reader(reader).map_err(Error::GenesisFileCorrupted)?;\n\n let block = genesis.to_block();\n\n Ledger::new(block.id(), block.fragments())?;\n\n block\n\n .serialize(common.open_output()?)\n\n .map_err(Error::BlockSerializationFailed)\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/block/mod.rs","rank":44,"score":136508.35809684434},{"content":"fn decode_block_0(common: Common) -> Result<(), Error> {\n\n let block = common.input.load_block()?;\n\n let yaml = Block0Configuration::from_block(&block)?;\n\n serde_yaml::to_writer(common.open_output()?, &yaml).map_err(Error::GenesisSerializationFailed)\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/block/mod.rs","rank":45,"score":136508.35809684434},{"content":"pub fn read_genesis_yaml<P: AsRef<Path>>(genesis: P) -> Result<Block0Configuration, Block0Error> {\n\n let contents = std::fs::read_to_string(&genesis)?;\n\n serde_yaml::from_str(&contents).map_err(Into::into)\n\n}\n\n\n","file_path":"testing/quibitous-automation/src/testing/block0.rs","rank":46,"score":136321.3536008949},{"content":"pub fn request_settings(args: RestArgs) -> Result<SettingsDto, Error> {\n\n serde_json::from_str(&(args.client()?.get(&[\"v0\", \"settings\"]).execute()?.text()?))\n\n .map_err(Error::SerdeError)\n\n}\n","file_path":"qcli/src/qcli_lib/rest/v0/settings/mod.rs","rank":47,"score":134999.64374086697},{"content":"enum GenesisBlockOption<'a> {\n\n None,\n\n Hash(&'a str),\n\n Path(&'a Path),\n\n}\n\n\n\nimpl<'a> CommandBuilder<'a> {\n\n pub fn new(bin: &'a Path) -> Self {\n\n CommandBuilder {\n\n bin,\n\n config: None,\n\n genesis_block: GenesisBlockOption::None,\n\n secret: None,\n\n log_file: None,\n\n rewards_history: false,\n\n faketime: None,\n\n }\n\n }\n\n\n\n pub fn config(mut self, path: &'a Path) -> Self {\n","file_path":"testing/quibitous-automation/src/quibitous/starter/commands.rs","rank":48,"score":134324.60414364922},{"content":"#[test]\n\npub fn pull_blocks_correct_hashes_all_blocks() {\n\n let setup = setup::client::default();\n\n std::thread::sleep(Duration::from_secs(10)); // wait for the server to produce some blocks\n\n\n\n let genesis_block_hash = Hash::from_str(setup.config.genesis_block_hash()).unwrap();\n\n let blocks = setup\n\n .client\n\n .pull_blocks(&[genesis_block_hash], setup.client.tip().id())\n\n .unwrap();\n\n\n\n let blocks_hashes: Vec<Hash> = blocks.iter().map(|x| x.header().hash()).collect();\n\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\n\n assert!(\n\n is_long_prefix(&block_hashes_from_logs, &blocks_hashes),\n\n \"server blocks: {:?} | client blocks: {:?}\",\n\n block_hashes_from_logs,\n\n blocks_hashes\n\n );\n\n}\n\n\n\n// L1022 PullBlocks correct hashes\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":49,"score":132734.89888777988},{"content":"pub fn decode_block0<Q: AsRef<Path>>(block0: Vec<u8>, genesis_yaml: Q) -> Result<(), Block0Error> {\n\n let writer: std::fs::File = std::fs::OpenOptions::new()\n\n .create(true)\n\n .write(true)\n\n .read(false)\n\n .append(false)\n\n .truncate(true)\n\n .open(&genesis_yaml)?;\n\n\n\n let yaml = Block0Configuration::from_block(&Block::deserialize(&*block0)?)?;\n\n Ok(serde_yaml::to_writer(writer, &yaml)?)\n\n}\n\n\n\n#[derive(Error, Debug)]\n\n#[allow(clippy::large_enum_variant)]\n\npub enum Block0Error {\n\n #[error(transparent)]\n\n IapyxStatsCommandError(#[from] reqwest::Error),\n\n #[error(transparent)]\n\n Block0ParseError(#[from] Block0ConfigurationError),\n","file_path":"testing/quibitous-automation/src/testing/block0.rs","rank":50,"score":132365.6980233431},{"content":"#[test]\n\npub fn test_watch_tip_subscription_is_current_tip() {\n\n let setup = setup::client::bootstrap(\n\n ConfigurationBuilder::new()\n\n .with_slot_duration(3u8)\n\n .to_owned(),\n\n );\n\n let rest = setup.server.rest();\n\n let watch_client = setup.watch_client;\n\n\n\n let notif = watch_client.tip_subscription();\n\n\n\n let (watch_tip, cond) = &*notif;\n\n\n\n let mut iters_remaining: usize = 10;\n\n let mut guard = watch_tip.lock().unwrap();\n\n\n\n loop {\n\n println!(\"iter remaining: {}\", iters_remaining);\n\n let header = &*guard;\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":51,"score":131236.26756803654},{"content":"#[test]\n\npub fn test_watch_block_subscription_blocks_are_in_logs() {\n\n use std::collections::HashSet;\n\n\n\n let setup = setup::client::default();\n\n\n\n let watch_client = setup.watch_client;\n\n\n\n let (sender, receiver) = std::sync::mpsc::channel();\n\n\n\n watch_client.block_subscription(sender);\n\n\n\n let mut ids = HashSet::new();\n\n\n\n const BLOCKS_TO_TEST: usize = 20;\n\n\n\n while let Ok(block) = receiver.recv() {\n\n assert!(ids.insert(block.unwrap().id()));\n\n\n\n if ids.len() == BLOCKS_TO_TEST {\n\n break;\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":52,"score":131108.91084744566},{"content":"pub fn deserialize_hash<'de, D>(deserializer: D) -> Result<Blake2b256, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let hash_visitor = HashVisitor::new();\n\n if deserializer.is_human_readable() {\n\n deserializer.deserialize_str(hash_visitor)\n\n } else {\n\n deserializer.deserialize_bytes(hash_visitor)\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":53,"score":130829.28420768514},{"content":"pub fn compute_interval<I>(\n\n bounds: PaginationInterval<I>,\n\n pagination_arguments: ValidatedPaginationArguments<I>,\n\n) -> FieldResult<(PaginationInterval<I>, PageMeta)>\n\nwhere\n\n I: TryFrom<u64> + Clone,\n\n u64: From<I>,\n\n{\n\n let pagination_arguments = pagination_arguments.cursors_into::<u64>();\n\n let bounds = bounds.bounds_into::<u64>();\n\n\n\n let (page_interval, has_next_page, has_previous_page, total_count) = match bounds {\n\n PaginationInterval::Empty => (PaginationInterval::Empty, false, false, 0u64),\n\n PaginationInterval::Inclusive(total_elements) => {\n\n let InclusivePaginationInterval {\n\n upper_bound,\n\n lower_bound,\n\n } = total_elements;\n\n\n\n let page = compute_range_boundaries(total_elements, pagination_arguments);\n","file_path":"explorer/src/api/graphql/connections.rs","rank":54,"score":130818.60909900418},{"content":"pub fn parse_ed25519_secret_key(bech32_str: &str) -> Result<EitherEd25519SecretKey, Error> {\n\n match SecretKey::try_from_bech32_str(bech32_str) {\n\n Ok(sk) => Ok(EitherEd25519SecretKey::Extended(sk)),\n\n Err(_) => SecretKey::try_from_bech32_str(bech32_str)\n\n .map(EitherEd25519SecretKey::Normal)\n\n .map_err(Error::SecretKeyMalformed),\n\n }\n\n}\n","file_path":"qcli/src/qcli_lib/utils/key_parser.rs","rank":55,"score":130621.91610830877},{"content":"pub fn read_yaml<D: DeserializeOwned>(path: &Option<impl AsRef<Path>>) -> Result<D, ReadYamlError> {\n\n let reader = open_file_read(path)?;\n\n let yaml = serde_yaml::from_reader(reader)?;\n\n Ok(yaml)\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/utils/io.rs","rank":56,"score":130332.21816970293},{"content":"#[test]\n\npub fn fully_connected() {\n\n let mut controller = NetworkBuilder::default()\n\n .topology(\n\n Topology::default()\n\n .with_node(Node::new(LEADER_3))\n\n .with_node(Node::new(LEADER_1).with_trusted_peer(LEADER_3))\n\n .with_node(Node::new(LEADER_2).with_trusted_peer(LEADER_1))\n\n .with_node(\n\n Node::new(LEADER_4)\n\n .with_trusted_peer(LEADER_2)\n\n .with_trusted_peer(LEADER_3),\n\n ),\n\n )\n\n .blockchain_config(Blockchain::default().with_leaders(vec![LEADER_1, LEADER_2, LEADER_3]))\n\n .wallet_template(\n\n WalletTemplateBuilder::new(ALICE)\n\n .with(2_000_000_000)\n\n .build(),\n\n )\n\n .wallet_template(\n","file_path":"testing/quibitous-integration-tests/src/networking/topology.rs","rank":57,"score":128446.50938053313},{"content":"pub fn post_fragment(args: RestArgs, fragment: Fragment) -> Result<String, Error> {\n\n let fragment_id = args\n\n .client()?\n\n .post(&[\"v0\", \"message\"])\n\n .body(fragment.serialize_as_vec()?)\n\n .execute()?\n\n .text()?;\n\n Ok(fragment_id)\n\n}\n","file_path":"qcli/src/qcli_lib/rest/v0/message/mod.rs","rank":58,"score":128334.39719399356},{"content":"pub fn spawn_network(config: Config, mut topology: Topology, args: Args) -> Result<(), Error> {\n\n let (tx, rx) = channel();\n\n\n\n let mut monitor_controller = MonitorControllerBuilder::new(&config.session.title)\n\n .topology(topology.clone())\n\n .blockchain(config.build_blockchain())\n\n .build(config.session.clone())?;\n\n\n\n let mut processes: HashMap<NodeAlias, MonitorNode> = HashMap::new();\n\n\n\n while !topology.nodes.is_empty() {\n\n let alias = topology\n\n .nodes\n\n .values()\n\n .find(|n| n.trusted_peers.is_empty())\n\n .map(|n| n.alias.clone())\n\n .ok_or(Error::CircularTrust)?;\n\n\n\n let spawn_params = config.node_spawn_params(&alias)?;\n\n\n","file_path":"testing/quantricity/src/spawn/monitor.rs","rank":59,"score":127134.72540756036},{"content":"pub fn spawn_network(config: Config, mut topology: Topology, args: Args) -> Result<(), Error> {\n\n println!(\"Building network...\");\n\n let mut controller = NetworkBuilder::default()\n\n .topology(topology.clone())\n\n .session_settings(config.session.clone())\n\n .blockchain_config(config.build_blockchain())\n\n .build()?;\n\n\n\n let mut processes: HashMap<NodeAlias, QuibitousProcess> = HashMap::new();\n\n\n\n while !topology.nodes.is_empty() {\n\n let alias = topology\n\n .nodes\n\n .values()\n\n .find(|n| n.trusted_peers.is_empty())\n\n .map(|n| n.alias.clone())\n\n .ok_or(Error::CircularTrust)?;\n\n\n\n let spawn_params = config.node_spawn_params(&alias)?;\n\n\n","file_path":"testing/quantricity/src/spawn/standard.rs","rank":60,"score":127134.72540756036},{"content":"#[test]\n\npub fn node_trust_itself() {\n\n let mut network_controller = NetworkBuilder::default()\n\n .topology(\n\n Topology::default()\n\n .with_node(Node::new(SERVER))\n\n .with_node(Node::new(CLIENT).with_trusted_peer(SERVER)),\n\n )\n\n .blockchain_config(Blockchain::default().with_leader(SERVER))\n\n .wallet_template(\n\n WalletTemplateBuilder::new(ALICE)\n\n .with(1_000_000)\n\n .delegated_to(CLIENT)\n\n .build(),\n\n )\n\n .wallet_template(\n\n WalletTemplateBuilder::new(BOB)\n\n .with(1_000_000)\n\n .delegated_to(SERVER)\n\n .build(),\n\n )\n","file_path":"testing/quibitous-integration-tests/src/networking/p2p/connections.rs","rank":61,"score":126314.19759307092},{"content":"pub fn read_secret_key(secret_key_path: Option<PathBuf>) -> Result<EitherEd25519SecretKey, Error> {\n\n match secret_key_path {\n\n Some(path) => read_ed25519_secret_key_from_file(&Some(path)),\n\n None => {\n\n let key =\n\n rpassword::prompt_password_stdout(\"Introduce the bech32 format secret key:\\n\")?;\n\n parse_ed25519_secret_key(&key)\n\n }\n\n }\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/utils/key_parser.rs","rank":62,"score":125268.46962589497},{"content":"pub fn deserialize_public<'de, D, A>(deserializer: D) -> Result<PublicKey<A>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n A: AsymmetricPublicKey,\n\n{\n\n let public_key_visitor = PublicKeyVisitor::new();\n\n if deserializer.is_human_readable() {\n\n deserializer.deserialize_str(public_key_visitor)\n\n } else {\n\n deserializer.deserialize_bytes(public_key_visitor)\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":63,"score":125245.85740979153},{"content":"pub fn deserialize_secret<'de, D, A>(deserializer: D) -> Result<SecretKey<A>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n A: AsymmetricKey,\n\n SecretKey<A>: Bech32,\n\n{\n\n let secret_key_visitor = SecretKeyVisitor::new();\n\n if deserializer.is_human_readable() {\n\n deserializer.deserialize_str(secret_key_visitor)\n\n } else {\n\n deserializer.deserialize_bytes(secret_key_visitor)\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":64,"score":125245.85740979153},{"content":"#[test]\n\npub fn tip_request() {\n\n let setup = setup::client::bootstrap(\n\n ConfigurationBuilder::new()\n\n .with_slot_duration(15)\n\n .to_owned(),\n\n );\n\n\n\n setup\n\n .client\n\n .wait_for_chain_length(1.into(), CHAIN_GROWTH_TIMEOUT);\n\n\n\n let tip_header = setup.client.tip();\n\n let block_hashes = setup.server.logger.get_created_blocks_hashes();\n\n\n\n if *block_hashes.last().unwrap() != tip_header.hash() {\n\n //if the server produces another block compare with second last\n\n assert_eq!(block_hashes[block_hashes.len() - 2], tip_header.hash());\n\n }\n\n}\n\n\n\n// L1009 GetHeaders correct hash\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":65,"score":124300.7475374282},{"content":"pub fn serialize_hash<S>(hash: &Blake2b256, serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n{\n\n if serializer.is_human_readable() {\n\n hash.to_string().serialize(serializer)\n\n } else {\n\n hash.as_ref().serialize(serializer)\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":66,"score":123669.04536378372},{"content":"fn exec_get(block_id: String, args: RestArgs) -> Result<(), Error> {\n\n let response = args\n\n .client()?\n\n .get(&[\"v0\", \"block\", &block_id])\n\n .execute()?\n\n .bytes()?;\n\n println!(\"{}\", hex::encode(&response));\n\n Ok(())\n\n}\n","file_path":"qcli/src/qcli_lib/rest/v0/block/subcommand.rs","rank":67,"score":123157.44398802223},{"content":"pub fn encode_block0<P: AsRef<Path>, Q: AsRef<Path>>(\n\n genesis: P,\n\n block0: Q,\n\n) -> Result<(), Block0Error> {\n\n let input: std::fs::File = std::fs::OpenOptions::new()\n\n .create(false)\n\n .write(false)\n\n .read(true)\n\n .append(false)\n\n .truncate(false)\n\n .open(&genesis)?;\n\n\n\n let output: std::fs::File = std::fs::OpenOptions::new()\n\n .create(true)\n\n .write(true)\n\n .read(false)\n\n .append(false)\n\n .truncate(true)\n\n .open(&block0)?;\n\n\n\n let genesis: Block0Configuration = serde_yaml::from_reader(input)?;\n\n let block = genesis.to_block();\n\n Ledger::new(block.id(), block.fragments())?;\n\n block.serialize(&output).map_err(Into::into)\n\n}\n\n\n","file_path":"testing/quibitous-automation/src/testing/block0.rs","rank":68,"score":122773.64596388368},{"content":"fn print_hash(input: Input) -> Result<(), Error> {\n\n let block = input.load_block()?;\n\n println!(\"{}\", block.id());\n\n Ok(())\n\n}\n\n\n\n/// create block 0 of the blockchain (i.e. the genesis block)\n\n#[derive(StructOpt)]\n\n#[structopt(name = \"genesis\", rename_all = \"kebab-case\")]\n\npub enum Genesis {\n\n /// Create a default Genesis file with appropriate documentation\n\n /// to help creating the YAML file\n\n Init,\n\n\n\n /// create the block 0 file (the genesis block of the blockchain)\n\n /// from a given yaml file\n\n ///\n\n Encode(Common),\n\n\n\n /// Decode the block 0 and print the corresponding YAML file\n","file_path":"qcli/src/qcli_lib/block/mod.rs","rank":69,"score":122728.1419103641},{"content":"pub fn _read_secret_key_from_file<A, P>(path: &Option<P>) -> Result<SecretKey<A>, Error>\n\nwhere\n\n A: AsymmetricKey,\n\n SecretKey<A>: Bech32,\n\n P: AsRef<Path>,\n\n{\n\n let bech32_str: String =\n\n io::read_line(path).map_err(|source| Error::SecretKeyFileReadFailed {\n\n source,\n\n path: io::path_to_path_buf(path),\n\n })?;\n\n SecretKey::try_from_bech32_str(&bech32_str).map_err(|source| Error::SecretKeyFileMalformed {\n\n source,\n\n path: io::path_to_path_buf(path),\n\n })\n\n}\n\n\n","file_path":"qcli/src/qcli_lib/utils/key_parser.rs","rank":70,"score":122583.99327315364},{"content":"pub fn copy_initial_storage_if_used(\n\n config: &ClientLoadConfig,\n\n storage_folder: &str,\n\n temp_dir: &TempDir,\n\n) {\n\n if let Some(storage) = config.initial_storage() {\n\n let client_storage: PathBuf = temp_dir.child(storage_folder).path().into();\n\n if client_storage.exists() {\n\n fs::remove_dir_all(&client_storage).expect(\"cannot remove existing client storage\");\n\n }\n\n fs::create_dir(&client_storage).expect(\"cannot create client storage\");\n\n file::copy_folder(storage, &client_storage, true);\n\n }\n\n}\n\n\n","file_path":"testing/mfive/src/mfive_lib/bootstrap/scenario/mod.rs","rank":71,"score":122375.59742117801},{"content":"#[test]\n\npub fn test_blocks_are_being_created_for_more_than_15_minutes() {\n\n let mut sender = silica::Wallet::default();\n\n let mut receiver = silica::Wallet::default();\n\n let qcli: JCli = Default::default();\n\n\n\n let (quibitous, _) = startup::start_stake_pool(\n\n &[sender.clone()],\n\n &[],\n\n ConfigurationBuilder::new()\n\n .with_slots_per_epoch(60)\n\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\n\n .with_slot_duration(4)\n\n .with_epoch_stability_depth(10)\n\n .with_kes_update_speed(KesUpdateSpeed::new(43200).unwrap()),\n\n )\n\n .unwrap();\n\n\n\n let output_value = 1_u64;\n\n let benchmark = benchmark_endurance(\"test_blocks_are_created_for_more_than_15_minutes\")\n\n .target(Duration::from_secs(900))\n","file_path":"testing/quibitous-integration-tests/src/non_functional/transaction.rs","rank":72,"score":122251.93381507306},{"content":"#[test]\n\npub fn test_blocks_are_being_created_for_7_hours() {\n\n let qcli: JCli = Default::default();\n\n let duration_48_hours = Duration::from_secs(25_200);\n\n\n\n let mut receiver = silica::Wallet::default();\n\n let mut sender = silica::Wallet::default();\n\n let (quibitous, _) = startup::start_stake_pool(\n\n &[sender.clone()],\n\n &[],\n\n ConfigurationBuilder::new()\n\n .with_slots_per_epoch(20)\n\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\n\n .with_slot_duration(3)\n\n .with_kes_update_speed(KesUpdateSpeed::new(43200).unwrap())\n\n .with_mempool(Mempool {\n\n pool_max_entries: 1_000_000usize.into(),\n\n log_max_entries: 1_000_000usize.into(),\n\n persistent_log: None,\n\n }),\n\n )\n","file_path":"testing/quibitous-integration-tests/src/non_functional/soak.rs","rank":73,"score":122251.93381507306},{"content":"pub fn persist_dir_on_panic<S1: AsRef<str>, S2: AsRef<str>>(\n\n temp_dir: Option<TestingDirectory>,\n\n additional_contents: Vec<(S1, S2)>,\n\n) {\n\n if panicking() {\n\n let logs_dir = match tempfile::Builder::new().prefix(\"quibitous_\").tempdir() {\n\n Ok(dir) => dir.into_path(),\n\n Err(e) => {\n\n eprintln!(\"Could not create logs dir: {}\", e);\n\n return;\n\n }\n\n };\n\n\n\n println!(\n\n \"persisting node temp_dir after panic: {}\",\n\n logs_dir.display()\n\n );\n\n\n\n if let Some(dir) = temp_dir {\n\n let options = CopyOptions {\n","file_path":"testing/quibitous-automation/src/testing/panic.rs","rank":74,"score":121145.81197125277},{"content":"fn initial(block0: &Block) -> Result<&ConfigParams, Block0Malformed> {\n\n for fragment in block0.fragments() {\n\n if let Fragment::Initial(init) = fragment {\n\n return Ok(init);\n\n }\n\n }\n\n Err(Block0Malformed::NoInitialSettings)\n\n}\n","file_path":"modules/blockchain/src/block0.rs","rank":75,"score":121108.85372060335},{"content":"#[test]\n\npub fn passive_node_last_block_info() {\n\n let mut network_controller = build_network!()\n\n .topology(\n\n Topology::default()\n\n .with_node(Node::new(LEADER))\n\n .with_node(Node::new(PASSIVE).with_trusted_peer(LEADER)),\n\n )\n\n .blockchain_config(Blockchain::default().with_leader(LEADER))\n\n .wallet_template(\n\n WalletTemplateBuilder::new(\"alice\")\n\n .with(1_000_000)\n\n .delegated_to(LEADER)\n\n .build(),\n\n )\n\n .wallet_template(WalletTemplateBuilder::new(\"bob\").with(1_000_000).build())\n\n .build()\n\n .unwrap();\n\n\n\n let leader = network_controller\n\n .spawn(SpawnParams::new(LEADER).in_memory())\n","file_path":"testing/quibitous-integration-tests/src/networking/p2p/stats.rs","rank":76,"score":120389.5540176767},{"content":"#[test]\n\npub fn get_blocks_incorrect_hash() {\n\n let setup = setup::client::default();\n\n let fake_hash: Hash = TestGen::hash();\n\n assert_eq!(\n\n MockClientError::InvalidRequest(format!(\n\n \"not found (block {} is not known to this node)\",\n\n fake_hash\n\n )),\n\n setup.client.headers(&[fake_hash]).err().unwrap(),\n\n \"wrong error\"\n\n );\n\n}\n\n\n\n// L1013 PullBlocksToTip correct hash\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":77,"score":120389.5540176767},{"content":"#[test]\n\npub fn get_blocks_correct_hash() {\n\n let setup = setup::client::default();\n\n\n\n let tip = setup.client.tip();\n\n assert!(setup.client.get_blocks(&[tip.hash()]).is_ok());\n\n}\n\n\n\n// L1012 GetBlocks incorrect hash\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":78,"score":120389.5540176767},{"content":"#[test]\n\npub fn leader_node_last_block_info() {\n\n let mut network_controller = build_network!()\n\n .topology(\n\n Topology::default()\n\n .with_node(Node::new(LEADER))\n\n .with_node(Node::new(LEADER_CLIENT).with_trusted_peer(LEADER)),\n\n )\n\n .wallet_template(\n\n WalletTemplateBuilder::new(\"alice\")\n\n .with(1_000_000)\n\n .delegated_to(LEADER)\n\n .build(),\n\n )\n\n .wallet_template(WalletTemplateBuilder::new(\"bob\").with(1_000_000).build())\n\n .blockchain_config(Blockchain::default().with_leader(LEADER))\n\n .build()\n\n .unwrap();\n\n\n\n let leader = network_controller\n\n .spawn(SpawnParams::new(LEADER).in_memory())\n","file_path":"testing/quibitous-integration-tests/src/networking/p2p/stats.rs","rank":79,"score":120389.5540176767},{"content":"pub fn send_transaction_and_ensure_block_was_produced(\n\n transation_messages: &[String],\n\n quibitous: &QuibitousProcess,\n\n) -> Result<(), NodeStuckError> {\n\n let qcli: JCli = Default::default();\n\n let block_tip_before_transaction = qcli.rest().v0().tip(&quibitous.rest_uri());\n\n let block_counter_before_transaction = quibitous.logger.get_created_blocks_counter();\n\n\n\n qcli.fragment_sender(quibitous)\n\n .send_many(transation_messages)\n\n .wait_until_all_processed(&Default::default())\n\n .map_err(NodeStuckError::InternalQcliError)?;\n\n\n\n let block_tip_after_transaction = qcli.rest().v0().tip(quibitous.rest_uri());\n\n let block_counter_after_transaction = quibitous.logger.get_created_blocks_counter();\n\n\n\n if block_tip_before_transaction == block_tip_after_transaction {\n\n return Err(NodeStuckError::TipIsNotMoving {\n\n tip_hash: block_tip_after_transaction,\n\n logs: quibitous.logger.get_log_content(),\n","file_path":"testing/quibitous-integration-tests/src/non_functional/mod.rs","rank":80,"score":120389.5540176767},{"content":"#[test]\n\npub fn upload_block_incompatible_protocol() {\n\n let setup = setup::client::default();\n\n let tip_header = setup.client.tip();\n\n let stake_pool = StakePoolBuilder::new().build();\n\n\n\n let time_era = TimeEra::new(\n\n 0u64.into(),\n\n Epoch(0u32),\n\n setup\n\n .config\n\n .block0_configuration()\n\n .blockchain_configuration\n\n .slots_per_epoch\n\n .into(),\n\n );\n\n\n\n let block = GenesisOptimumBlockBuilder::new()\n\n .with_parent(&tip_header)\n\n .build(&stake_pool, &time_era);\n\n\n\n assert_eq!(\n\n MockClientError::InvalidRequest(\n\n \"invalid request data (the block header verification failed)\".into()\n\n ),\n\n setup.client.upload_blocks(block).err().unwrap()\n\n );\n\n}\n\n\n\n// L1020 Push headers incorrect header\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":81,"score":120389.5540176767},{"content":"pub fn deserialize_signature<'de, D, T, A>(deserializer: D) -> Result<Signature<T, A>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n A: VerificationAlgorithm,\n\n{\n\n let signature_visitor = SignatureVisitor::new();\n\n if deserializer.is_human_readable() {\n\n deserializer.deserialize_str(signature_visitor)\n\n } else {\n\n deserializer.deserialize_bytes(signature_visitor)\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":82,"score":120310.62809292071},{"content":"type GetNextBlockScheduler = FireForgetScheduler<HeaderHash, NodeId, ()>;\n\n\n\nconst TIP_UPDATE_QUEUE_SIZE: usize = 10;\n\n\n\nconst DEFAULT_TIMEOUT_PROCESS_LEADERSHIP: u64 = 5;\n\nconst DEFAULT_TIMEOUT_PROCESS_ANNOUNCEMENT: u64 = 5;\n\nconst DEFAULT_TIMEOUT_PROCESS_BLOCKS: u64 = 60;\n\nconst DEFAULT_TIMEOUT_PROCESS_HEADERS: u64 = 60;\n\n\n\nconst PULL_HEADERS_SCHEDULER_CONFIG: FireForgetSchedulerConfig = FireForgetSchedulerConfig {\n\n max_running: 16,\n\n max_running_same_task: 2,\n\n command_channel_size: 1024,\n\n timeout: Duration::from_millis(500),\n\n};\n\n\n\nconst GET_NEXT_BLOCK_SCHEDULER_CONFIG: FireForgetSchedulerConfig = FireForgetSchedulerConfig {\n\n max_running: 16,\n\n max_running_same_task: 2,\n\n command_channel_size: 1024,\n","file_path":"quibitous/src/blockchain/process.rs","rank":83,"score":119346.90772294276},{"content":"pub fn wait_for_date(target_block_date: BlockDate, mut rest: QuibitousRest) {\n\n let settings = rest.settings().unwrap();\n\n while is_it_due(get_current_date(&mut rest), target_block_date) {\n\n std::thread::sleep(std::time::Duration::from_secs(settings.slot_duration));\n\n }\n\n}\n\n\n","file_path":"testing/quibitous-automation/src/testing/time.rs","rank":84,"score":119188.25074030922},{"content":"#[derive(Clone)]\n\nstruct Tip(Arc<RwLock<HeaderHash>>);\n\n\n\n#[derive(Clone)]\n\npub struct ExplorerDb {\n\n /// Structure that keeps all the known states to allow easy branch management\n\n /// each new block is indexed by getting its previous `State` from the multiverse\n\n /// and inserted a new updated one.\n\n multiverse: Multiverse,\n\n /// This keeps track of the longest chain seen until now. All the queries are\n\n /// performed using the state of this branch, the HeaderHash is used as key for the\n\n /// multiverse, and the ChainLength is used in the updating process.\n\n longest_chain_tip: Tip,\n\n pub blockchain_config: BlockchainConfig,\n\n stable_store: StableIndex,\n\n tip_broadcast: tokio::sync::broadcast::Sender<(HeaderHash, multiverse::Ref)>,\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct StableIndex {\n\n confirmed_block_chain_length: Arc<AtomicU32>,\n","file_path":"explorer/src/db/mod.rs","rank":85,"score":119021.0448670129},{"content":"fn parse_block_hash(hex: &str) -> Result<Hash, Error> {\n\n Blake2b256::from_str(hex)\n\n .map_err(Into::into)\n\n .map(Into::into)\n\n}\n\n\n","file_path":"quibitous/src/rest/v0/logic.rs","rank":86,"score":119012.27011943782},{"content":"pub fn serialize_public<S, A>(key: &PublicKey<A>, serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n A: AsymmetricPublicKey,\n\n{\n\n if serializer.is_human_readable() {\n\n key.to_bech32_str().serialize(serializer)\n\n } else {\n\n key.as_ref().serialize(serializer)\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":87,"score":118794.87720415111},{"content":"pub fn serialize_secret<S, A>(key: &SecretKey<A>, serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n A: AsymmetricKey,\n\n SecretKey<A>: Bech32,\n\n{\n\n if serializer.is_human_readable() {\n\n key.to_bech32_str().serialize(serializer)\n\n } else {\n\n panic!(\"binary encoding for serialization of the secret key does not exist in chain-crypto\")\n\n }\n\n}\n\n\n","file_path":"quibitous-lib/src/crypto/serde.rs","rank":88,"score":118794.87720415111},{"content":"#[test]\n\npub fn topics_of_interest_influences_node_sync_ability() {\n\n const FAST_CLIENT: &str = \"FAST_CLIENT\";\n\n const SLOW_CLIENT: &str = \"SLOW_CLIENT\";\n\n\n\n let mut network_controller = NetworkBuilder::default()\n\n .topology(\n\n Topology::default()\n\n .with_node(Node::new(SERVER))\n\n .with_node(Node::new(FAST_CLIENT).with_trusted_peer(SERVER))\n\n .with_node(Node::new(SLOW_CLIENT).with_trusted_peer(SERVER)),\n\n )\n\n .blockchain_config(Blockchain::default().with_leader(SERVER))\n\n .wallet_template(\n\n WalletTemplateBuilder::new(ALICE)\n\n .with(1_000_000)\n\n .delegated_to(SERVER)\n\n .build(),\n\n )\n\n .wallet_template(\n\n WalletTemplateBuilder::new(BOB)\n","file_path":"testing/quibitous-integration-tests/src/networking/p2p/connections.rs","rank":89,"score":118679.99646240375},{"content":"#[test]\n\npub fn test_correct_hash_is_returned_for_correct_block() {\n\n let qcli: JCli = Default::default();\n\n let content = qcli.genesis().init();\n\n let temp_dir = TempDir::new().unwrap();\n\n let yaml_file = temp_dir.child(\"init_file.yaml\");\n\n yaml_file.write_str(&content).unwrap();\n\n let block_file = temp_dir.child(\"block-0.bin\");\n\n\n\n qcli.genesis().encode(yaml_file.path(), &block_file);\n\n qcli.genesis().hash(block_file.path());\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/qcli/genesis/hash.rs","rank":90,"score":118605.34832378927},{"content":"#[test]\n\npub fn upload_block_nonexisting_stake_pool() {\n\n let setup = setup::client::bootstrap(\n\n ConfigurationBuilder::new()\n\n .with_block0_consensus(ConsensusVersion::GenesisOptimum)\n\n .to_owned(),\n\n );\n\n let tip_header = setup.client.tip();\n\n let stake_pool = StakePoolBuilder::new().build();\n\n\n\n let time_era = TimeEra::new(\n\n 0u64.into(),\n\n Epoch(0u32),\n\n setup\n\n .config\n\n .block0_configuration()\n\n .blockchain_configuration\n\n .slots_per_epoch\n\n .into(),\n\n );\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":91,"score":118605.34832378927},{"content":"#[test]\n\npub fn pull_blocks_hashes_wrong_order() {\n\n let setup = setup::client::default();\n\n\n\n setup\n\n .client\n\n .wait_for_chain_length(10.into(), CHAIN_GROWTH_TIMEOUT);\n\n\n\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\n\n let start = 2;\n\n let end = 8;\n\n let expected_hashes = block_hashes_from_logs[start..end].to_vec();\n\n\n\n let result = setup.client.pull_blocks(\n\n &[expected_hashes.last().copied().unwrap()],\n\n expected_hashes[0],\n\n );\n\n\n\n assert!(result.is_err());\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":92,"score":118605.34832378927},{"content":"#[test]\n\npub fn test_genesis_block_is_built_from_correct_yaml() {\n\n let temp_dir = TempDir::new().unwrap();\n\n let config = Block0ConfigurationBuilder::new().build();\n\n let config_file = temp_dir.child(\"genesis.yaml\");\n\n let content = serde_yaml::to_string(&config).unwrap();\n\n config_file.write_str(&content).unwrap();\n\n let output_block_file = temp_dir.child(\"block-0.bin\");\n\n let qcli: JCli = Default::default();\n\n qcli.genesis()\n\n .encode(config_file.path(), &output_block_file);\n\n\n\n assert!(output_block_file.path().exists());\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/qcli/genesis/encode.rs","rank":93,"score":118605.34832378927},{"content":"#[test]\n\npub fn test_non_empty_hash_is_returned_for_block0() {\n\n let qcli: JCli = Default::default();\n\n let quibitous = Starter::new().start().unwrap();\n\n let rest_uri = quibitous.rest_uri();\n\n let block_id = qcli.rest().v0().tip(&rest_uri);\n\n qcli.rest().v0().block().get(block_id, rest_uri);\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/qcli/rest/block.rs","rank":94,"score":118605.34832378927},{"content":"#[test]\n\npub fn test_genesis_block_is_built_from_init_yaml() {\n\n let qcli: JCli = Default::default();\n\n\n\n let content = qcli.genesis().init();\n\n let temp_dir = TempDir::new().unwrap();\n\n let yaml_file = temp_dir.child(\"init_file.yaml\");\n\n yaml_file.write_str(&content).unwrap();\n\n let block_file = temp_dir.child(\"block-0.bin\");\n\n qcli.genesis().encode(yaml_file.path(), &block_file);\n\n}\n","file_path":"testing/quibitous-integration-tests/src/qcli/genesis/init.rs","rank":95,"score":118605.34832378927},{"content":"#[test]\n\npub fn test_increased_block_content_max_size() {\n\n let receivers: Vec<Wallet> = std::iter::from_fn(|| Some(silica::Wallet::default()))\n\n .take(98)\n\n .collect();\n\n let mut stake_pool_owner = silica::Wallet::default();\n\n\n\n let stake_pool_owner_stake = 1;\n\n\n\n let (quibitous, _stake_pools) = startup::start_stake_pool(\n\n &[stake_pool_owner.clone()],\n\n &[],\n\n ConfigurationBuilder::new()\n\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\n\n .with_block_content_max_size(8192.into()),\n\n )\n\n .unwrap();\n\n\n\n let settings = quibitous.rest().settings().unwrap();\n\n\n\n let transaction_sender = FragmentSender::new(\n","file_path":"testing/quibitous-integration-tests/src/quibitous/genesis/fragments.rs","rank":96,"score":118605.34832378927},{"content":"#[test]\n\npub fn pull_blocks_correct_hashes_partial() {\n\n let setup = setup::client::default();\n\n setup\n\n .client\n\n .wait_for_chain_length(10.into(), CHAIN_GROWTH_TIMEOUT);\n\n\n\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\n\n let start = 2;\n\n let end = 8;\n\n let expected_hashes = block_hashes_from_logs[start..end].to_vec();\n\n\n\n let blocks = setup\n\n .client\n\n .pull_blocks(\n\n &[expected_hashes[0]],\n\n expected_hashes.last().copied().unwrap(),\n\n )\n\n .unwrap();\n\n\n\n let blocks_hashes: Vec<Hash> = blocks.iter().map(|x| x.header().hash()).collect();\n\n\n\n assert_eq!(&expected_hashes[1..], &blocks_hashes);\n\n}\n\n\n\n// L1023 PullBlocks to and from in wrong order\n","file_path":"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs","rank":97,"score":118605.34832378927},{"content":"#[test]\n\npub fn test_block_content_max_size_below_transaction_size() {\n\n let receivers: Vec<Wallet> = std::iter::from_fn(|| Some(silica::Wallet::default()))\n\n .take(98)\n\n .collect();\n\n let mut stake_pool_owner = silica::Wallet::default();\n\n\n\n let stake_pool_owner_stake = 1;\n\n\n\n let (quibitous, _stake_pools) = startup::start_stake_pool(\n\n &[stake_pool_owner.clone()],\n\n &[],\n\n ConfigurationBuilder::new()\n\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\n\n .with_block_content_max_size(4092.into()),\n\n )\n\n .unwrap();\n\n\n\n let fragment_sender = FragmentSender::from_with_setup(\n\n quibitous.block0_configuration(),\n\n FragmentSenderSetup::should_stop_at_error(),\n","file_path":"testing/quibitous-integration-tests/src/quibitous/genesis/fragments.rs","rank":98,"score":116894.49583122502},{"content":"pub fn test_correct_error_is_returned_for_incorrect_host_syntax() {\n\n let qcli: JCli = Default::default();\n\n let incorrect_host = \"not_a_correct_syntax\";\n\n\n\n qcli.rest().v0().tip_expect_fail(\n\n incorrect_host,\n\n \"Invalid value for '--host <host>': relative URL without a base\",\n\n );\n\n}\n\n\n","file_path":"testing/quibitous-integration-tests/src/qcli/rest/host.rs","rank":99,"score":116879.94886666126}],"string":"[\n {\n \"content\": \"fn network_block_error_into_reply(err: chain::Error) -> intercom::Error {\\n\\n use super::chain::Error::*;\\n\\n\\n\\n match err {\\n\\n Storage(e) => intercom::Error::failed(e),\\n\\n Ledger(e) => intercom::Error::failed_precondition(e),\\n\\n Block0(e) => intercom::Error::failed(e),\\n\\n MissingParentBlock(_) => intercom::Error::failed_precondition(err.to_string()),\\n\\n BlockHeaderVerificationFailed(_) => intercom::Error::invalid_argument(err.to_string()),\\n\\n _ => intercom::Error::failed(err.to_string()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous/src/blockchain/process.rs\",\n \"rank\": 0,\n \"score\": 270021.0607784168\n },\n {\n \"content\": \"/// chose which of the two Ref is the most interesting to keep as a branch\\n\\n///\\n\\n/// i.e. if the two Ref points to the same block date: this allows to make a choice\\n\\n/// as to which Ref ought to be our preferred choice for a tip.\\n\\npub fn compare_against(storage: &Storage, current: &Ref, candidate: &Ref) -> ComparisonResult {\\n\\n let epoch_stability_depth = current.epoch_ledger_parameters().epoch_stability_depth;\\n\\n\\n\\n let rollback_possible =\\n\\n check_rollback_up_to(epoch_stability_depth, storage, current, candidate);\\n\\n\\n\\n // returns `true` if the candidate is set in what appears to be in the future\\n\\n // relative to this node, with a little buffer to accomodate for small inconsistencies\\n\\n // in time\\n\\n let in_future = match candidate.elapsed() {\\n\\n Err(duration) if duration.duration() > ALLOWED_TIME_DISCREPANCY => {\\n\\n tracing::debug!(\\n\\n \\\"candidate block {} appear to be in the future by {}s, will not consider it for updating our current tip\\\",\\n\\n candidate.header().description(),\\n\\n duration.duration().as_secs()\\n\\n );\\n\\n true\\n\\n }\\n\\n _ => false,\\n\\n };\\n\\n\\n\\n if rollback_possible && !in_future && current.chain_length() < candidate.chain_length() {\\n\\n ComparisonResult::PreferCandidate\\n\\n } else {\\n\\n ComparisonResult::PreferCurrent\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous/src/blockchain/chain_selection.rs\",\n \"rank\": 1,\n \"score\": 244267.0128679359\n },\n {\n \"content\": \"pub fn slot_duration(block0: &Block) -> Result<Duration, Block0Error> {\\n\\n for config in initial(block0)?.iter() {\\n\\n if let ConfigParam::SlotDuration(duration) = config {\\n\\n return Ok(Duration::from_secs(*duration as u64));\\n\\n }\\n\\n }\\n\\n Err(Block0Malformed::NoSlotDuration.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"modules/blockchain/src/block0.rs\",\n \"rank\": 2,\n \"score\": 230955.89187644672\n },\n {\n \"content\": \"pub fn load_block(block_reader: impl BufRead) -> Result<Block, Error> {\\n\\n Block::deserialize(block_reader).map_err(Error::BlockFileCorrupted)\\n\\n}\\n\\n\\n\\n#[derive(StructOpt)]\\n\\npub struct Common {\\n\\n #[structopt(flatten)]\\n\\n pub input: Input,\\n\\n\\n\\n /// the file path to the block to create\\n\\n ///\\n\\n /// If not available the command will expect to write the block to\\n\\n /// to the standard output\\n\\n #[structopt(long = \\\"output\\\", parse(from_os_str), name = \\\"FILE_OUTPUT\\\")]\\n\\n pub output_file: Option<std::path::PathBuf>,\\n\\n}\\n\\n\\n\\nimpl Common {\\n\\n pub fn open_output(&self) -> Result<impl Write, Error> {\\n\\n io::open_file_write(&self.output_file).map_err(|source| Error::OutputInvalid {\\n\\n source,\\n\\n path: self.output_file.clone().unwrap_or_default(),\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"qcli/src/qcli_lib/block/mod.rs\",\n \"rank\": 3,\n \"score\": 229261.9480687612\n },\n {\n \"content\": \"pub fn start_time(block0: &Block) -> Result<SystemTime, Block0Error> {\\n\\n for config in initial(block0)?.iter() {\\n\\n if let ConfigParam::Block0Date(date) = config {\\n\\n return Ok(SystemTime::UNIX_EPOCH + Duration::from_secs(date.0));\\n\\n }\\n\\n }\\n\\n Err(Block0Malformed::NoStartTime.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"modules/blockchain/src/block0.rs\",\n \"rank\": 4,\n \"score\": 227230.8774115587\n },\n {\n \"content\": \"fn get_current_block_date(tip: &Ref) -> BlockDate {\\n\\n let time = std::time::SystemTime::now();\\n\\n let era = tip.epoch_leadership_schedule().era();\\n\\n let epoch_position = tip\\n\\n .time_frame()\\n\\n .slot_at(&time)\\n\\n .and_then(|slot| era.from_slot_to_era(slot))\\n\\n .expect(\\\"the current time and blockchain state should produce a valid blockchain date\\\");\\n\\n let block_date: BlockDate = epoch_position.into();\\n\\n BlockDate {\\n\\n slot_id: block_date.slot_id + 1,\\n\\n ..block_date\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous/src/fragment/pool.rs\",\n \"rank\": 5,\n \"score\": 220059.0969380432\n },\n {\n \"content\": \"#[derive(Debug, thiserror::Error)]\\n\\nenum StreamingError {\\n\\n #[error(\\\"error accessing storage\\\")]\\n\\n Storage(#[from] Error),\\n\\n #[error(\\\"failed to send block\\\")]\\n\\n Sending(#[from] ReplySendError),\\n\\n}\\n\\n\\n\\nimpl Storage {\\n\\n pub fn file<P: AsRef<Path>>(path: P, span: Span) -> Result<Self, Error> {\\n\\n let storage = BlockStore::file(path, HeaderHash::zero_hash().as_bytes().to_vec())?;\\n\\n Ok(Storage { storage, span })\\n\\n }\\n\\n\\n\\n pub fn memory(span: Span) -> Result<Self, Error> {\\n\\n let storage = BlockStore::memory(HeaderHash::zero_hash().as_bytes().to_vec())?;\\n\\n Ok(Storage { storage, span })\\n\\n }\\n\\n\\n\\n pub fn get_tag(&self, tag: &str) -> Result<Option<HeaderHash>, Error> {\\n\\n self.storage\\n\",\n \"file_path\": \"quibitous/src/blockchain/storage.rs\",\n \"rank\": 6,\n \"score\": 198003.03984199482\n },\n {\n \"content\": \"fn chain_header_error_into_reply(err: candidate::Error) -> intercom::Error {\\n\\n use super::candidate::Error::*;\\n\\n\\n\\n // TODO: more detailed error case matching\\n\\n match err {\\n\\n Blockchain(e) => intercom::Error::failed(e.to_string()),\\n\\n EmptyHeaderStream => intercom::Error::invalid_argument(err.to_string()),\\n\\n MissingParentBlock(_) => intercom::Error::failed_precondition(err.to_string()),\\n\\n BrokenHeaderChain(_) => intercom::Error::invalid_argument(err.to_string()),\\n\\n HeaderChainVerificationFailed(e) => intercom::Error::invalid_argument(e),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"quibitous/src/blockchain/process.rs\",\n \"rank\": 7,\n \"score\": 194059.17246704112\n },\n {\n \"content\": \"fn get_block_from_storage(storage: &Storage, id: HeaderHash) -> Result<Block, Error> {\\n\\n match storage.get(id) {\\n\\n Ok(Some(block)) => Ok(block),\\n\\n Ok(None) => Err(Error::not_found(format!(\\n\\n \\\"block {} is not known to this node\\\",\\n\\n id\\n\\n ))),\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n}\\n\\n\\n\\n// Stop after sending the first Err() variant\\n\\n//\\n\\n// Common base for GetBlocks and GetHeaders\\n\\nasync fn fuse_send_items<T, V>(\\n\\n items: T,\\n\\n reply_handle: ReplyStreamHandle<V>,\\n\\n) -> Result<(), ReplySendError>\\n\\nwhere\\n\\n T: IntoIterator<Item = Result<V, Error>>,\\n\",\n \"file_path\": \"quibitous/src/client.rs\",\n \"rank\": 8,\n \"score\": 186570.54550158328\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_correct_id_is_returned_for_block_tip_if_only_genesis_block_exists() {\\n\\n let qcli: JCli = Default::default();\\n\\n let quibitous = Starter::new().start().unwrap();\\n\\n let block_id = qcli.rest().v0().tip(quibitous.rest_uri());\\n\\n\\n\\n assert_ne!(&block_id, \\\"\\\", \\\"empty block hash\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/rest/tip.rs\",\n \"rank\": 9,\n \"score\": 181817.3692452131\n },\n {\n \"content\": \"/// Performs lightweight sanity checks on information fields of a block header\\n\\n/// against those in the header of the block's parent.\\n\\n/// The `parent` header must have been retrieved based on, or otherwise\\n\\n/// matched to, the parent block hash of `header`.\\n\\n///\\n\\n/// # Panics\\n\\n///\\n\\n/// If the parent hash in the header does not match that of the parent,\\n\\n/// this function may panic.\\n\\npub fn pre_verify_link(\\n\\n header: &Header,\\n\\n parent: &Header,\\n\\n) -> ::std::result::Result<(), HeaderChainVerifyError> {\\n\\n use chain_core::property::ChainLength as _;\\n\\n\\n\\n debug_assert_eq!(header.block_parent_hash(), parent.hash());\\n\\n\\n\\n if header.block_date() <= parent.block_date() {\\n\\n return Err(HeaderChainVerifyError::BlockDateBeforeParent {\\n\\n child: header.block_date(),\\n\\n parent: parent.block_date(),\\n\\n });\\n\\n }\\n\\n if header.chain_length() != parent.chain_length().next() {\\n\\n return Err(HeaderChainVerifyError::ChainLengthNotIncremental {\\n\\n child: header.chain_length(),\\n\\n parent: parent.chain_length(),\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"quibitous/src/blockchain/chain.rs\",\n \"rank\": 10,\n \"score\": 181591.9569584867\n },\n {\n \"content\": \"pub fn new_epoch_leadership_from(\\n\\n epoch: Epoch,\\n\\n parent: Arc<Ref>,\\n\\n rewards_report_all: bool,\\n\\n) -> EpochLeadership {\\n\\n let parent_ledger_state = parent.ledger();\\n\\n let parent_epoch_leadership_schedule = parent.epoch_leadership_schedule().clone();\\n\\n let parent_epoch_ledger_parameters = parent.epoch_ledger_parameters().clone();\\n\\n let parent_epoch_rewards_info = parent.epoch_rewards_info().cloned();\\n\\n let parent_time_frame = parent.time_frame().clone();\\n\\n\\n\\n let parent_date = parent.block_date();\\n\\n\\n\\n if parent_date.epoch < epoch {\\n\\n // TODO: the time frame may change in the future, we will need to handle this\\n\\n // special case but it is not actually clear how to modify the time frame\\n\\n // for the blockchain\\n\\n use chain_impl_mockchain::chaintypes::ConsensusVersion;\\n\\n\\n\\n let ledger = parent_ledger_state\\n\",\n \"file_path\": \"quibitous/src/blockchain/chain.rs\",\n \"rank\": 11,\n \"score\": 181585.68147876678\n },\n {\n \"content\": \"pub fn open_block_file(input_file: &Option<PathBuf>) -> Result<impl BufRead, Error> {\\n\\n io::open_file_read(input_file).map_err(|source| Error::InputInvalid {\\n\\n source,\\n\\n path: input_file.clone().unwrap_or_default(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/block/mod.rs\",\n \"rank\": 12,\n \"score\": 179140.91135986085\n },\n {\n \"content\": \"fn apply_block_to_blocks(blocks: Blocks, block: &ExplorerBlock) -> Result<Blocks, Error> {\\n\\n let block_id = block.id();\\n\\n blocks\\n\\n .insert(block_id, Arc::new(block.clone()))\\n\\n .map_err(|_| Error::BlockAlreadyExists(block_id))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"explorer/src/db/mod.rs\",\n \"rank\": 13,\n \"score\": 173452.48565891664\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_correct_error_is_returned_for_incorrect_block_id() {\\n\\n let qcli: JCli = Default::default();\\n\\n let incorrect_block_id = \\\"e1049ea45726f0b1fc473af54f706546b3331765abf89ae9e6a8333e49621641aa\\\";\\n\\n let quibitous = Starter::new().start().unwrap();\\n\\n\\n\\n qcli.rest().v0().block().get_expect_fail(\\n\\n incorrect_block_id,\\n\\n quibitous.rest_uri(),\\n\\n \\\"node rejected request because of invalid parameters\\\",\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/rest/block.rs\",\n \"rank\": 14,\n \"score\": 172039.31767793646\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_correct_error_is_returned_for_incorrect_block_id_in_next_block_id_request() {\\n\\n let qcli: JCli = Default::default();\\n\\n let incorrect_block_id = \\\"e1049ea45726f0b1fc473af54f706546b3331765abf89ae9e6a8333e49621641aa\\\";\\n\\n\\n\\n let quibitous = Starter::new().start().unwrap();\\n\\n\\n\\n qcli.rest().v0().block().next_expect_fail(\\n\\n incorrect_block_id,\\n\\n 1,\\n\\n quibitous.rest_uri(),\\n\\n \\\"node rejected request because of invalid parameters\\\",\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/rest/block.rs\",\n \"rank\": 15,\n \"score\": 170565.07203261286\n },\n {\n \"content\": \"pub fn read_line<P: AsRef<Path>>(path: &Option<P>) -> Result<String, Error> {\\n\\n let mut line = String::new();\\n\\n open_file_read(path)?.read_line(&mut line)?;\\n\\n Ok(line.trim_end().to_string())\\n\\n}\\n\\n\\n\\n#[derive(Debug, Error)]\\n\\npub enum ReadYamlError {\\n\\n #[error(\\\"could not read input\\\")]\\n\\n Io(#[from] Error),\\n\\n #[error(\\\"input contains malformed yaml\\\")]\\n\\n Yaml(#[from] serde_yaml::Error),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/io.rs\",\n \"rank\": 16,\n \"score\": 164979.7285461451\n },\n {\n \"content\": \"/// Initiates a client connection, returning a connection handle and\\n\\n/// the connection future that must be polled to complete the connection.\\n\\n///\\n\\n/// Note that this is the only function in this module that is tied to the\\n\\n/// gRPC protocol, all other code is generic in terms of network-core traits.\\n\\n/// This is intentional, to facilitate extension to different protocols\\n\\n/// in the future.\\n\\npub fn connect(state: ConnectionState, channels: Channels) -> (ConnectHandle, ConnectFuture) {\\n\\n let (sender, receiver) = oneshot::channel();\\n\\n let peer = state.peer();\\n\\n let keypair = state.global.keypair.clone();\\n\\n let span = state.span().clone();\\n\\n let async_span = span.clone();\\n\\n let _enter = span.enter();\\n\\n let cf = async move {\\n\\n let mut grpc_client = {\\n\\n tracing::debug!(\\\"connecting\\\");\\n\\n grpc::connect(&peer).await\\n\\n }\\n\\n .map_err(ConnectError::Transport)?;\\n\\n\\n\\n let mut nonce = [0u8; NONCE_LEN];\\n\\n rand::thread_rng().fill(&mut nonce);\\n\\n\\n\\n let hr = grpc_client\\n\\n .handshake(&nonce[..])\\n\\n .await\\n\",\n \"file_path\": \"quibitous/src/network/client/connect.rs\",\n \"rank\": 17,\n \"score\": 164909.30587142217\n },\n {\n \"content\": \"pub fn block0() -> Block {\\n\\n block::builder(\\n\\n BlockVersion::Genesis,\\n\\n ContentsBuilder::new().into(),\\n\\n |hdr| {\\n\\n Ok::<_, ()>(\\n\\n hdr.set_genesis()\\n\\n .set_date(BlockDate::first())\\n\\n .into_unsigned_header()\\n\\n .expect(\\\"internal error cannot build unsigned block\\\")\\n\\n .generalize(),\\n\\n )\\n\\n },\\n\\n )\\n\\n .expect(\\\"internal error: block builder cannot return error\\\")\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-automation/src/quibitous/grpc/server/data.rs\",\n \"rank\": 18,\n \"score\": 162324.51603829858\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(windows)]\\n\\npub fn cors_https() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"https://domain.com\\\".to_owned().into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n let quibitous = Starter::new().config(config).start_async().unwrap();\\n\\n\\n\\n let mut rest_client = quibitous.rest();\\n\\n rest_client.set_origin(\\\"https://domain.com\\\");\\n\\n\\n\\n assert!(rest_client.raw().stats()?.status().is_success());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 19,\n \"score\": 160905.35096424163\n },\n {\n \"content\": \"#[test]\\n\\npub fn pull_blocks_to_tip_correct_hash() {\\n\\n let setup = setup::client::default();\\n\\n\\n\\n std::thread::sleep(Duration::from_secs(10)); // wait for the server to produce some blocks\\n\\n\\n\\n let blocks = setup\\n\\n .client\\n\\n .pull_blocks_to_tip(Hash::from_str(setup.config.genesis_block_hash()).unwrap())\\n\\n .unwrap();\\n\\n\\n\\n let blocks_hashes: Vec<Hash> = blocks.iter().map(|x| x.header().hash()).collect();\\n\\n\\n\\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\\n\\n assert!(\\n\\n is_long_prefix(&block_hashes_from_logs, &blocks_hashes),\\n\\n \\\"server blocks: {:?} | client blocks: {:?}\\\",\\n\\n block_hashes_from_logs,\\n\\n blocks_hashes\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 20,\n \"score\": 160506.16352663896\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_correct_error_is_returned_for_incorrect_path() {\\n\\n let qcli: JCli = Default::default();\\n\\n let config = NodeConfigBuilder::new().build();\\n\\n let incorrect_uri = format!(\\\"http://{}/api/api\\\", config.rest.listen);\\n\\n\\n\\n qcli.rest()\\n\\n .v0()\\n\\n .tip_expect_fail(incorrect_uri, \\\"tcp connect error\\\");\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/rest/tip.rs\",\n \"rank\": 21,\n \"score\": 160491.31125487763\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(windows)]\\n\\npub fn cors_single_domain() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"http://domain.com\\\".to_owned().into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n let quibitous = Starter::new().config(config).start_async().unwrap();\\n\\n\\n\\n let mut rest_client = quibitous.rest();\\n\\n rest_client.set_origin(\\\"http://domain.com\\\");\\n\\n\\n\\n assert!(rest_client.raw().stats()?.status().is_success());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 22,\n \"score\": 159335.08755759193\n },\n {\n \"content\": \"#[test]\\n\\npub fn cors_illegal_domain() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"http://domain.com\\\".to_owned().into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n let quibitous = Starter::new().config(config).start().unwrap();\\n\\n\\n\\n let mut rest_client = quibitous.rest();\\n\\n rest_client.set_origin(\\\"http://other_domain.com\\\");\\n\\n\\n\\n assert_request_failed_due_to_cors(&rest_client)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 23,\n \"score\": 159335.08755759193\n },\n {\n \"content\": \"#[test]\\n\\npub fn cors_multi_domain() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"http://domain.com;http://other_domain.com\\\"\\n\\n .to_owned()\\n\\n .into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n Starter::new()\\n\\n .config(config)\\n\\n .start_fail(\\\"invalid value: string \\\\\\\"http://domain.com;http://other_domain.com\\\\\\\"\\\");\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 24,\n \"score\": 159335.08755759193\n },\n {\n \"content\": \"#[test]\\n\\npub fn cors_wrong_delimiter() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"http://domain.com,http://other_domain.com\\\"\\n\\n .to_owned()\\n\\n .into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n Starter::new()\\n\\n .config(config)\\n\\n .start_fail(\\\"rest.cors.allowed_origins[0]: invalid value\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 25,\n \"score\": 159335.08755759193\n },\n {\n \"content\": \"/// open the given file path as a writable stream, or stdout if no path\\n\\n/// provided\\n\\npub fn open_file_write<P: AsRef<Path>>(path: &Option<P>) -> Result<impl Write, Error> {\\n\\n match path {\\n\\n Some(path) => {\\n\\n let writer = std::fs::OpenOptions::new()\\n\\n .create(true)\\n\\n .write(true)\\n\\n .read(false)\\n\\n .append(false)\\n\\n .truncate(true)\\n\\n .open(path)?;\\n\\n Ok(Box::new(writer) as Box<dyn Write>)\\n\\n }\\n\\n None => Ok(Box::new(stdout()) as Box<dyn Write>),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/io.rs\",\n \"rank\": 26,\n \"score\": 158619.3495800232\n },\n {\n \"content\": \"#[test]\\n\\npub fn cors_malformed_domain_no_http() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"domain.com\\\".to_owned().into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n Starter::new()\\n\\n .config(config)\\n\\n .start_fail(\\\"invalid value: string \\\\\\\"domain.com\\\\\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 27,\n \"score\": 157817.38701522426\n },\n {\n \"content\": \"#[test]\\n\\n#[cfg(windows)]\\n\\npub fn cors_ip_versus_domain() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n\\n\\n let config = ConfigurationBuilder::new()\\n\\n .with_rest_cors_config(Cors {\\n\\n allowed_origins: vec![\\\"http://127.0.0.1\\\".to_owned().into()],\\n\\n max_age_secs: None,\\n\\n allowed_headers: vec![],\\n\\n allowed_methods: vec![],\\n\\n })\\n\\n .build(&temp_dir);\\n\\n\\n\\n let quibitous = Starter::new().config(config).start_async().unwrap();\\n\\n\\n\\n let mut rest_client = quibitous.rest();\\n\\n rest_client.set_origin(\\\"http://localhost\\\");\\n\\n\\n\\n assert_eq!(rest_client.raw().stats()?.status(), 403);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/cors.rs\",\n \"rank\": 28,\n \"score\": 157817.38701522426\n },\n {\n \"content\": \"pub fn parse_shift(from: &str) -> Result<(BlockDate, bool), BlockDateParseError> {\\n\\n if let Some(stripped) = from.strip_prefix('~') {\\n\\n BlockDate::from_str(stripped).map(|d| (d, true))\\n\\n } else {\\n\\n BlockDate::from_str(from).map(|d| (d, false))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"testing/mfive/src/mfive_lib/args.rs\",\n \"rank\": 29,\n \"score\": 157239.953042924\n },\n {\n \"content\": \"/// open the given file path as a readable stream, or stdin if no path\\n\\n/// provided\\n\\npub fn open_file_read<P: AsRef<Path>>(path: &Option<P>) -> Result<impl BufRead, Error> {\\n\\n match path {\\n\\n Some(path) => {\\n\\n let reader = std::fs::OpenOptions::new()\\n\\n .create(false)\\n\\n .write(false)\\n\\n .read(true)\\n\\n .append(false)\\n\\n .open(path)?;\\n\\n Ok(Box::new(BufReader::new(reader)) as Box<dyn BufRead>)\\n\\n }\\n\\n None => Ok(Box::new(BufReader::new(stdin())) as Box<dyn BufRead>),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/io.rs\",\n \"rank\": 30,\n \"score\": 156508.6200901315\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_correct_error_is_returned_for_non_existent_genesis_block() {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n let block_file = temp_dir.child(\\\"block-0.bin\\\");\\n\\n let qcli: JCli = Default::default();\\n\\n qcli.genesis().hash_expect_fail(block_file.path(), \\\"file\\\");\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/genesis/hash.rs\",\n \"rank\": 31,\n \"score\": 155358.54187351058\n },\n {\n \"content\": \"pub fn spawn_network(args: Args) -> Result<(), Error> {\\n\\n let config: Config = serde_yaml::from_reader(File::open(&args.config)?)?;\\n\\n let topology = config.build_topology();\\n\\n\\n\\n match &config.session.mode {\\n\\n SessionMode::Standard => standard::spawn_network(config, topology, args),\\n\\n SessionMode::Monitor => monitor::spawn_network(config, topology, args),\\n\\n SessionMode::Interactive => interactive::spawn_network(config, topology),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"testing/quantricity/src/spawn/mod.rs\",\n \"rank\": 32,\n \"score\": 148500.73174789836\n },\n {\n \"content\": \"pub fn gen_pub_key<K>(priv_key_bech32: &[u5]) -> Result<String, Error>\\n\\nwhere\\n\\n K: AsymmetricKey,\\n\\n PublicKey<K::PubAlg>: Bech32,\\n\\n{\\n\\n let priv_key_bytes = Vec::<u8>::from_base32(priv_key_bech32).map_err(Bech32Error::from)?;\\n\\n let priv_key = <SecretKey<K>>::from_binary(&priv_key_bytes)?;\\n\\n let pub_key = priv_key.to_public();\\n\\n Ok(pub_key.to_bech32_str())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/key.rs\",\n \"rank\": 33,\n \"score\": 148034.95087617688\n },\n {\n \"content\": \"#[derive(Error, Debug)]\\n\\nenum PropagateError {\\n\\n #[error(\\\"Error sending message to task due to {0}\\\")]\\n\\n InternalCommSend(#[from] futures::channel::mpsc::SendError),\\n\\n #[error(\\\"Error receving message from task due to {0}\\\")]\\n\\n InternalCommRecv(#[from] crate::intercom::Error),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous/src/network/mod.rs\",\n \"rank\": 34,\n \"score\": 146900.6657001754\n },\n {\n \"content\": \"/// prepare the block storage from the given settings\\n\\npub fn prepare_storage(setting: &Settings) -> Result<Storage, Error> {\\n\\n let span = span!(Level::TRACE, \\\"sub_task\\\", kind = \\\"storage\\\");\\n\\n let storage_span = span.clone();\\n\\n let _enter = span.enter();\\n\\n if let Some(dir) = &setting.storage {\\n\\n std::fs::create_dir_all(dir).map_err(|err| Error::Io {\\n\\n source: err,\\n\\n reason: ErrorKind::BlockStorage,\\n\\n })?;\\n\\n\\n\\n tracing::info!(\\\"storing blockchain in '{:?}'\\\", dir);\\n\\n\\n\\n Storage::file(dir, storage_span).map_err(Into::into)\\n\\n } else {\\n\\n Storage::memory(storage_span).map_err(Into::into)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Try to fetch the block0_id from the HTTP base URL (services) in the array\\n\\n///\\n\",\n \"file_path\": \"quibitous/src/start_up/mod.rs\",\n \"rank\": 35,\n \"score\": 145525.8274702543\n },\n {\n \"content\": \"/// Checks if the multiaddr is valid for contacting a p2p peer\\n\\n/// and resolves DNS components.\\n\\n///\\n\\n/// Note that DNS resolution is performed synchronously by this function,\\n\\n/// so this should only be used at initialization.\\n\\npub fn resolve_dns(addr: &Multiaddr) -> Result<Multiaddr, Error> {\\n\\n let mut components = addr.iter();\\n\\n\\n\\n let ip_or_fqdn = components.next().ok_or(Error::InvalidMultiaddr)?;\\n\\n let port = components\\n\\n .next()\\n\\n .and_then(|ac| {\\n\\n if let Protocol::Tcp(port) = ac {\\n\\n Some(port)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .ok_or(Error::InvalidMultiaddr)?;\\n\\n\\n\\n let socket_addr = match ip_or_fqdn {\\n\\n Protocol::Ip4(addr) => SocketAddrV4::new(addr, port).into(),\\n\\n Protocol::Ip6(addr) => SocketAddrV6::new(addr, port, 0, 0).into(),\\n\\n Protocol::Dns(fqdn) => (fqdn.borrow(), port)\\n\\n .to_socket_addrs()\\n\",\n \"file_path\": \"quibitous-lib/src/multiaddr.rs\",\n \"rank\": 36,\n \"score\": 145525.13174735187\n },\n {\n \"content\": \"enum ApplyFragmentError {\\n\\n DoesNotFit,\\n\\n SoftDeadlineReached,\\n\\n Rejected(String),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous/src/fragment/selection.rs\",\n \"rank\": 37,\n \"score\": 144292.09988631494\n },\n {\n \"content\": \"pub fn get_block<S: Into<String>>(block0: S) -> Result<Block0Configuration, Block0Error> {\\n\\n let block0 = block0.into();\\n\\n let block = {\\n\\n if Path::new(&block0).exists() {\\n\\n let reader = std::fs::OpenOptions::new()\\n\\n .create(false)\\n\\n .write(false)\\n\\n .read(true)\\n\\n .append(false)\\n\\n .open(&block0)?;\\n\\n let reader = BufReader::new(reader);\\n\\n Block::deserialize(reader)?\\n\\n } else if Url::parse(&block0).is_ok() {\\n\\n let response = reqwest::blocking::get(&block0)?;\\n\\n let block0_bytes = response.bytes()?.to_vec();\\n\\n Block::read(&mut ReadBuf::from(&block0_bytes))?\\n\\n } else {\\n\\n panic!(\\\" block0 should be either path to filesystem or url \\\");\\n\\n }\\n\\n };\\n\\n Block0Configuration::from_block(&block).map_err(Into::into)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/block0.rs\",\n \"rank\": 38,\n \"score\": 140699.12661841096\n },\n {\n \"content\": \"#[ignore]\\n\\npub fn max_connections() {\\n\\n let mut controller = NetworkBuilder::default()\\n\\n .topology(\\n\\n Topology::default()\\n\\n .with_node(Node::new(LEADER1))\\n\\n .with_node(Node::new(LEADER2).with_trusted_peer(LEADER1))\\n\\n .with_node(Node::new(LEADER3).with_trusted_peer(LEADER1))\\n\\n .with_node(Node::new(LEADER4).with_trusted_peer(LEADER1)),\\n\\n )\\n\\n .blockchain_config(\\n\\n Blockchain::default().with_leaders(vec![LEADER1, LEADER2, LEADER3, LEADER4]),\\n\\n )\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n let leader1 = controller\\n\\n .spawn(\\n\\n SpawnParams::new(LEADER1)\\n\\n .in_memory()\\n\\n .max_inbound_connections(2),\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/networking/p2p/connections.rs\",\n \"rank\": 39,\n \"score\": 139965.2793435349\n },\n {\n \"content\": \"pub fn spawn_network(config: Config, topology: Topology) -> Result<(), Error> {\\n\\n let controller = NetworkBuilder::default()\\n\\n .topology(topology)\\n\\n .blockchain_config(config.build_blockchain())\\n\\n .session_settings(config.session)\\n\\n .build()?;\\n\\n\\n\\n let user_integration = quibitous_user_interaction();\\n\\n\\n\\n let mut interactive_commands = QuibitousInteractiveCommandExec {\\n\\n controller: UserInteractionController::new(controller),\\n\\n };\\n\\n\\n\\n user_integration\\n\\n .interact(&mut interactive_commands)\\n\\n .map_err(Into::into)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quantricity/src/spawn/interactive.rs\",\n \"rank\": 40,\n \"score\": 139015.33550606866\n },\n {\n \"content\": \"pub fn assert(statement: bool, info: &str) -> Result<(), Error> {\\n\\n if !statement {\\n\\n return Err(Error::VerificationFailed(info.to_string()));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/verify.rs\",\n \"rank\": 41,\n \"score\": 139015.33550606866\n },\n {\n \"content\": \"pub fn read_initials<P: AsRef<Path>>(initials: P) -> Result<Vec<Initial>, Block0Error> {\\n\\n let contents = std::fs::read_to_string(&initials)?;\\n\\n let value: serde_json::Value = serde_json::from_str(&contents)?;\\n\\n let initial = serde_json::to_string(&value[\\\"initial\\\"])?;\\n\\n serde_json::from_str(&initial).map_err(Into::into)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/block0.rs\",\n \"rank\": 42,\n \"score\": 137552.9651578845\n },\n {\n \"content\": \"fn match_block0(expected: HeaderHash, peer_responded: HeaderHash) -> Result<(), ConnectError> {\\n\\n if expected == peer_responded {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(ConnectError::Block0Mismatch {\\n\\n expected,\\n\\n peer_responded,\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"quibitous/src/network/client/connect.rs\",\n \"rank\": 43,\n \"score\": 136588.9035701551\n },\n {\n \"content\": \"fn encode_block_0(common: Common) -> Result<(), Error> {\\n\\n let reader = common.input.open()?;\\n\\n let genesis: Block0Configuration =\\n\\n serde_yaml::from_reader(reader).map_err(Error::GenesisFileCorrupted)?;\\n\\n let block = genesis.to_block();\\n\\n Ledger::new(block.id(), block.fragments())?;\\n\\n block\\n\\n .serialize(common.open_output()?)\\n\\n .map_err(Error::BlockSerializationFailed)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/block/mod.rs\",\n \"rank\": 44,\n \"score\": 136508.35809684434\n },\n {\n \"content\": \"fn decode_block_0(common: Common) -> Result<(), Error> {\\n\\n let block = common.input.load_block()?;\\n\\n let yaml = Block0Configuration::from_block(&block)?;\\n\\n serde_yaml::to_writer(common.open_output()?, &yaml).map_err(Error::GenesisSerializationFailed)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/block/mod.rs\",\n \"rank\": 45,\n \"score\": 136508.35809684434\n },\n {\n \"content\": \"pub fn read_genesis_yaml<P: AsRef<Path>>(genesis: P) -> Result<Block0Configuration, Block0Error> {\\n\\n let contents = std::fs::read_to_string(&genesis)?;\\n\\n serde_yaml::from_str(&contents).map_err(Into::into)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/block0.rs\",\n \"rank\": 46,\n \"score\": 136321.3536008949\n },\n {\n \"content\": \"pub fn request_settings(args: RestArgs) -> Result<SettingsDto, Error> {\\n\\n serde_json::from_str(&(args.client()?.get(&[\\\"v0\\\", \\\"settings\\\"]).execute()?.text()?))\\n\\n .map_err(Error::SerdeError)\\n\\n}\\n\",\n \"file_path\": \"qcli/src/qcli_lib/rest/v0/settings/mod.rs\",\n \"rank\": 47,\n \"score\": 134999.64374086697\n },\n {\n \"content\": \"enum GenesisBlockOption<'a> {\\n\\n None,\\n\\n Hash(&'a str),\\n\\n Path(&'a Path),\\n\\n}\\n\\n\\n\\nimpl<'a> CommandBuilder<'a> {\\n\\n pub fn new(bin: &'a Path) -> Self {\\n\\n CommandBuilder {\\n\\n bin,\\n\\n config: None,\\n\\n genesis_block: GenesisBlockOption::None,\\n\\n secret: None,\\n\\n log_file: None,\\n\\n rewards_history: false,\\n\\n faketime: None,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn config(mut self, path: &'a Path) -> Self {\\n\",\n \"file_path\": \"testing/quibitous-automation/src/quibitous/starter/commands.rs\",\n \"rank\": 48,\n \"score\": 134324.60414364922\n },\n {\n \"content\": \"#[test]\\n\\npub fn pull_blocks_correct_hashes_all_blocks() {\\n\\n let setup = setup::client::default();\\n\\n std::thread::sleep(Duration::from_secs(10)); // wait for the server to produce some blocks\\n\\n\\n\\n let genesis_block_hash = Hash::from_str(setup.config.genesis_block_hash()).unwrap();\\n\\n let blocks = setup\\n\\n .client\\n\\n .pull_blocks(&[genesis_block_hash], setup.client.tip().id())\\n\\n .unwrap();\\n\\n\\n\\n let blocks_hashes: Vec<Hash> = blocks.iter().map(|x| x.header().hash()).collect();\\n\\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\\n\\n assert!(\\n\\n is_long_prefix(&block_hashes_from_logs, &blocks_hashes),\\n\\n \\\"server blocks: {:?} | client blocks: {:?}\\\",\\n\\n block_hashes_from_logs,\\n\\n blocks_hashes\\n\\n );\\n\\n}\\n\\n\\n\\n// L1022 PullBlocks correct hashes\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 49,\n \"score\": 132734.89888777988\n },\n {\n \"content\": \"pub fn decode_block0<Q: AsRef<Path>>(block0: Vec<u8>, genesis_yaml: Q) -> Result<(), Block0Error> {\\n\\n let writer: std::fs::File = std::fs::OpenOptions::new()\\n\\n .create(true)\\n\\n .write(true)\\n\\n .read(false)\\n\\n .append(false)\\n\\n .truncate(true)\\n\\n .open(&genesis_yaml)?;\\n\\n\\n\\n let yaml = Block0Configuration::from_block(&Block::deserialize(&*block0)?)?;\\n\\n Ok(serde_yaml::to_writer(writer, &yaml)?)\\n\\n}\\n\\n\\n\\n#[derive(Error, Debug)]\\n\\n#[allow(clippy::large_enum_variant)]\\n\\npub enum Block0Error {\\n\\n #[error(transparent)]\\n\\n IapyxStatsCommandError(#[from] reqwest::Error),\\n\\n #[error(transparent)]\\n\\n Block0ParseError(#[from] Block0ConfigurationError),\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/block0.rs\",\n \"rank\": 50,\n \"score\": 132365.6980233431\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_watch_tip_subscription_is_current_tip() {\\n\\n let setup = setup::client::bootstrap(\\n\\n ConfigurationBuilder::new()\\n\\n .with_slot_duration(3u8)\\n\\n .to_owned(),\\n\\n );\\n\\n let rest = setup.server.rest();\\n\\n let watch_client = setup.watch_client;\\n\\n\\n\\n let notif = watch_client.tip_subscription();\\n\\n\\n\\n let (watch_tip, cond) = &*notif;\\n\\n\\n\\n let mut iters_remaining: usize = 10;\\n\\n let mut guard = watch_tip.lock().unwrap();\\n\\n\\n\\n loop {\\n\\n println!(\\\"iter remaining: {}\\\", iters_remaining);\\n\\n let header = &*guard;\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 51,\n \"score\": 131236.26756803654\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_watch_block_subscription_blocks_are_in_logs() {\\n\\n use std::collections::HashSet;\\n\\n\\n\\n let setup = setup::client::default();\\n\\n\\n\\n let watch_client = setup.watch_client;\\n\\n\\n\\n let (sender, receiver) = std::sync::mpsc::channel();\\n\\n\\n\\n watch_client.block_subscription(sender);\\n\\n\\n\\n let mut ids = HashSet::new();\\n\\n\\n\\n const BLOCKS_TO_TEST: usize = 20;\\n\\n\\n\\n while let Ok(block) = receiver.recv() {\\n\\n assert!(ids.insert(block.unwrap().id()));\\n\\n\\n\\n if ids.len() == BLOCKS_TO_TEST {\\n\\n break;\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 52,\n \"score\": 131108.91084744566\n },\n {\n \"content\": \"pub fn deserialize_hash<'de, D>(deserializer: D) -> Result<Blake2b256, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let hash_visitor = HashVisitor::new();\\n\\n if deserializer.is_human_readable() {\\n\\n deserializer.deserialize_str(hash_visitor)\\n\\n } else {\\n\\n deserializer.deserialize_bytes(hash_visitor)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 53,\n \"score\": 130829.28420768514\n },\n {\n \"content\": \"pub fn compute_interval<I>(\\n\\n bounds: PaginationInterval<I>,\\n\\n pagination_arguments: ValidatedPaginationArguments<I>,\\n\\n) -> FieldResult<(PaginationInterval<I>, PageMeta)>\\n\\nwhere\\n\\n I: TryFrom<u64> + Clone,\\n\\n u64: From<I>,\\n\\n{\\n\\n let pagination_arguments = pagination_arguments.cursors_into::<u64>();\\n\\n let bounds = bounds.bounds_into::<u64>();\\n\\n\\n\\n let (page_interval, has_next_page, has_previous_page, total_count) = match bounds {\\n\\n PaginationInterval::Empty => (PaginationInterval::Empty, false, false, 0u64),\\n\\n PaginationInterval::Inclusive(total_elements) => {\\n\\n let InclusivePaginationInterval {\\n\\n upper_bound,\\n\\n lower_bound,\\n\\n } = total_elements;\\n\\n\\n\\n let page = compute_range_boundaries(total_elements, pagination_arguments);\\n\",\n \"file_path\": \"explorer/src/api/graphql/connections.rs\",\n \"rank\": 54,\n \"score\": 130818.60909900418\n },\n {\n \"content\": \"pub fn parse_ed25519_secret_key(bech32_str: &str) -> Result<EitherEd25519SecretKey, Error> {\\n\\n match SecretKey::try_from_bech32_str(bech32_str) {\\n\\n Ok(sk) => Ok(EitherEd25519SecretKey::Extended(sk)),\\n\\n Err(_) => SecretKey::try_from_bech32_str(bech32_str)\\n\\n .map(EitherEd25519SecretKey::Normal)\\n\\n .map_err(Error::SecretKeyMalformed),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/key_parser.rs\",\n \"rank\": 55,\n \"score\": 130621.91610830877\n },\n {\n \"content\": \"pub fn read_yaml<D: DeserializeOwned>(path: &Option<impl AsRef<Path>>) -> Result<D, ReadYamlError> {\\n\\n let reader = open_file_read(path)?;\\n\\n let yaml = serde_yaml::from_reader(reader)?;\\n\\n Ok(yaml)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/io.rs\",\n \"rank\": 56,\n \"score\": 130332.21816970293\n },\n {\n \"content\": \"#[test]\\n\\npub fn fully_connected() {\\n\\n let mut controller = NetworkBuilder::default()\\n\\n .topology(\\n\\n Topology::default()\\n\\n .with_node(Node::new(LEADER_3))\\n\\n .with_node(Node::new(LEADER_1).with_trusted_peer(LEADER_3))\\n\\n .with_node(Node::new(LEADER_2).with_trusted_peer(LEADER_1))\\n\\n .with_node(\\n\\n Node::new(LEADER_4)\\n\\n .with_trusted_peer(LEADER_2)\\n\\n .with_trusted_peer(LEADER_3),\\n\\n ),\\n\\n )\\n\\n .blockchain_config(Blockchain::default().with_leaders(vec![LEADER_1, LEADER_2, LEADER_3]))\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(ALICE)\\n\\n .with(2_000_000_000)\\n\\n .build(),\\n\\n )\\n\\n .wallet_template(\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/networking/topology.rs\",\n \"rank\": 57,\n \"score\": 128446.50938053313\n },\n {\n \"content\": \"pub fn post_fragment(args: RestArgs, fragment: Fragment) -> Result<String, Error> {\\n\\n let fragment_id = args\\n\\n .client()?\\n\\n .post(&[\\\"v0\\\", \\\"message\\\"])\\n\\n .body(fragment.serialize_as_vec()?)\\n\\n .execute()?\\n\\n .text()?;\\n\\n Ok(fragment_id)\\n\\n}\\n\",\n \"file_path\": \"qcli/src/qcli_lib/rest/v0/message/mod.rs\",\n \"rank\": 58,\n \"score\": 128334.39719399356\n },\n {\n \"content\": \"pub fn spawn_network(config: Config, mut topology: Topology, args: Args) -> Result<(), Error> {\\n\\n let (tx, rx) = channel();\\n\\n\\n\\n let mut monitor_controller = MonitorControllerBuilder::new(&config.session.title)\\n\\n .topology(topology.clone())\\n\\n .blockchain(config.build_blockchain())\\n\\n .build(config.session.clone())?;\\n\\n\\n\\n let mut processes: HashMap<NodeAlias, MonitorNode> = HashMap::new();\\n\\n\\n\\n while !topology.nodes.is_empty() {\\n\\n let alias = topology\\n\\n .nodes\\n\\n .values()\\n\\n .find(|n| n.trusted_peers.is_empty())\\n\\n .map(|n| n.alias.clone())\\n\\n .ok_or(Error::CircularTrust)?;\\n\\n\\n\\n let spawn_params = config.node_spawn_params(&alias)?;\\n\\n\\n\",\n \"file_path\": \"testing/quantricity/src/spawn/monitor.rs\",\n \"rank\": 59,\n \"score\": 127134.72540756036\n },\n {\n \"content\": \"pub fn spawn_network(config: Config, mut topology: Topology, args: Args) -> Result<(), Error> {\\n\\n println!(\\\"Building network...\\\");\\n\\n let mut controller = NetworkBuilder::default()\\n\\n .topology(topology.clone())\\n\\n .session_settings(config.session.clone())\\n\\n .blockchain_config(config.build_blockchain())\\n\\n .build()?;\\n\\n\\n\\n let mut processes: HashMap<NodeAlias, QuibitousProcess> = HashMap::new();\\n\\n\\n\\n while !topology.nodes.is_empty() {\\n\\n let alias = topology\\n\\n .nodes\\n\\n .values()\\n\\n .find(|n| n.trusted_peers.is_empty())\\n\\n .map(|n| n.alias.clone())\\n\\n .ok_or(Error::CircularTrust)?;\\n\\n\\n\\n let spawn_params = config.node_spawn_params(&alias)?;\\n\\n\\n\",\n \"file_path\": \"testing/quantricity/src/spawn/standard.rs\",\n \"rank\": 60,\n \"score\": 127134.72540756036\n },\n {\n \"content\": \"#[test]\\n\\npub fn node_trust_itself() {\\n\\n let mut network_controller = NetworkBuilder::default()\\n\\n .topology(\\n\\n Topology::default()\\n\\n .with_node(Node::new(SERVER))\\n\\n .with_node(Node::new(CLIENT).with_trusted_peer(SERVER)),\\n\\n )\\n\\n .blockchain_config(Blockchain::default().with_leader(SERVER))\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(ALICE)\\n\\n .with(1_000_000)\\n\\n .delegated_to(CLIENT)\\n\\n .build(),\\n\\n )\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(BOB)\\n\\n .with(1_000_000)\\n\\n .delegated_to(SERVER)\\n\\n .build(),\\n\\n )\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/networking/p2p/connections.rs\",\n \"rank\": 61,\n \"score\": 126314.19759307092\n },\n {\n \"content\": \"pub fn read_secret_key(secret_key_path: Option<PathBuf>) -> Result<EitherEd25519SecretKey, Error> {\\n\\n match secret_key_path {\\n\\n Some(path) => read_ed25519_secret_key_from_file(&Some(path)),\\n\\n None => {\\n\\n let key =\\n\\n rpassword::prompt_password_stdout(\\\"Introduce the bech32 format secret key:\\\\n\\\")?;\\n\\n parse_ed25519_secret_key(&key)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/key_parser.rs\",\n \"rank\": 62,\n \"score\": 125268.46962589497\n },\n {\n \"content\": \"pub fn deserialize_public<'de, D, A>(deserializer: D) -> Result<PublicKey<A>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n A: AsymmetricPublicKey,\\n\\n{\\n\\n let public_key_visitor = PublicKeyVisitor::new();\\n\\n if deserializer.is_human_readable() {\\n\\n deserializer.deserialize_str(public_key_visitor)\\n\\n } else {\\n\\n deserializer.deserialize_bytes(public_key_visitor)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 63,\n \"score\": 125245.85740979153\n },\n {\n \"content\": \"pub fn deserialize_secret<'de, D, A>(deserializer: D) -> Result<SecretKey<A>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n A: AsymmetricKey,\\n\\n SecretKey<A>: Bech32,\\n\\n{\\n\\n let secret_key_visitor = SecretKeyVisitor::new();\\n\\n if deserializer.is_human_readable() {\\n\\n deserializer.deserialize_str(secret_key_visitor)\\n\\n } else {\\n\\n deserializer.deserialize_bytes(secret_key_visitor)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 64,\n \"score\": 125245.85740979153\n },\n {\n \"content\": \"#[test]\\n\\npub fn tip_request() {\\n\\n let setup = setup::client::bootstrap(\\n\\n ConfigurationBuilder::new()\\n\\n .with_slot_duration(15)\\n\\n .to_owned(),\\n\\n );\\n\\n\\n\\n setup\\n\\n .client\\n\\n .wait_for_chain_length(1.into(), CHAIN_GROWTH_TIMEOUT);\\n\\n\\n\\n let tip_header = setup.client.tip();\\n\\n let block_hashes = setup.server.logger.get_created_blocks_hashes();\\n\\n\\n\\n if *block_hashes.last().unwrap() != tip_header.hash() {\\n\\n //if the server produces another block compare with second last\\n\\n assert_eq!(block_hashes[block_hashes.len() - 2], tip_header.hash());\\n\\n }\\n\\n}\\n\\n\\n\\n// L1009 GetHeaders correct hash\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 65,\n \"score\": 124300.7475374282\n },\n {\n \"content\": \"pub fn serialize_hash<S>(hash: &Blake2b256, serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n{\\n\\n if serializer.is_human_readable() {\\n\\n hash.to_string().serialize(serializer)\\n\\n } else {\\n\\n hash.as_ref().serialize(serializer)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 66,\n \"score\": 123669.04536378372\n },\n {\n \"content\": \"fn exec_get(block_id: String, args: RestArgs) -> Result<(), Error> {\\n\\n let response = args\\n\\n .client()?\\n\\n .get(&[\\\"v0\\\", \\\"block\\\", &block_id])\\n\\n .execute()?\\n\\n .bytes()?;\\n\\n println!(\\\"{}\\\", hex::encode(&response));\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"qcli/src/qcli_lib/rest/v0/block/subcommand.rs\",\n \"rank\": 67,\n \"score\": 123157.44398802223\n },\n {\n \"content\": \"pub fn encode_block0<P: AsRef<Path>, Q: AsRef<Path>>(\\n\\n genesis: P,\\n\\n block0: Q,\\n\\n) -> Result<(), Block0Error> {\\n\\n let input: std::fs::File = std::fs::OpenOptions::new()\\n\\n .create(false)\\n\\n .write(false)\\n\\n .read(true)\\n\\n .append(false)\\n\\n .truncate(false)\\n\\n .open(&genesis)?;\\n\\n\\n\\n let output: std::fs::File = std::fs::OpenOptions::new()\\n\\n .create(true)\\n\\n .write(true)\\n\\n .read(false)\\n\\n .append(false)\\n\\n .truncate(true)\\n\\n .open(&block0)?;\\n\\n\\n\\n let genesis: Block0Configuration = serde_yaml::from_reader(input)?;\\n\\n let block = genesis.to_block();\\n\\n Ledger::new(block.id(), block.fragments())?;\\n\\n block.serialize(&output).map_err(Into::into)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/block0.rs\",\n \"rank\": 68,\n \"score\": 122773.64596388368\n },\n {\n \"content\": \"fn print_hash(input: Input) -> Result<(), Error> {\\n\\n let block = input.load_block()?;\\n\\n println!(\\\"{}\\\", block.id());\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// create block 0 of the blockchain (i.e. the genesis block)\\n\\n#[derive(StructOpt)]\\n\\n#[structopt(name = \\\"genesis\\\", rename_all = \\\"kebab-case\\\")]\\n\\npub enum Genesis {\\n\\n /// Create a default Genesis file with appropriate documentation\\n\\n /// to help creating the YAML file\\n\\n Init,\\n\\n\\n\\n /// create the block 0 file (the genesis block of the blockchain)\\n\\n /// from a given yaml file\\n\\n ///\\n\\n Encode(Common),\\n\\n\\n\\n /// Decode the block 0 and print the corresponding YAML file\\n\",\n \"file_path\": \"qcli/src/qcli_lib/block/mod.rs\",\n \"rank\": 69,\n \"score\": 122728.1419103641\n },\n {\n \"content\": \"pub fn _read_secret_key_from_file<A, P>(path: &Option<P>) -> Result<SecretKey<A>, Error>\\n\\nwhere\\n\\n A: AsymmetricKey,\\n\\n SecretKey<A>: Bech32,\\n\\n P: AsRef<Path>,\\n\\n{\\n\\n let bech32_str: String =\\n\\n io::read_line(path).map_err(|source| Error::SecretKeyFileReadFailed {\\n\\n source,\\n\\n path: io::path_to_path_buf(path),\\n\\n })?;\\n\\n SecretKey::try_from_bech32_str(&bech32_str).map_err(|source| Error::SecretKeyFileMalformed {\\n\\n source,\\n\\n path: io::path_to_path_buf(path),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"qcli/src/qcli_lib/utils/key_parser.rs\",\n \"rank\": 70,\n \"score\": 122583.99327315364\n },\n {\n \"content\": \"pub fn copy_initial_storage_if_used(\\n\\n config: &ClientLoadConfig,\\n\\n storage_folder: &str,\\n\\n temp_dir: &TempDir,\\n\\n) {\\n\\n if let Some(storage) = config.initial_storage() {\\n\\n let client_storage: PathBuf = temp_dir.child(storage_folder).path().into();\\n\\n if client_storage.exists() {\\n\\n fs::remove_dir_all(&client_storage).expect(\\\"cannot remove existing client storage\\\");\\n\\n }\\n\\n fs::create_dir(&client_storage).expect(\\\"cannot create client storage\\\");\\n\\n file::copy_folder(storage, &client_storage, true);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/mfive/src/mfive_lib/bootstrap/scenario/mod.rs\",\n \"rank\": 71,\n \"score\": 122375.59742117801\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_blocks_are_being_created_for_more_than_15_minutes() {\\n\\n let mut sender = silica::Wallet::default();\\n\\n let mut receiver = silica::Wallet::default();\\n\\n let qcli: JCli = Default::default();\\n\\n\\n\\n let (quibitous, _) = startup::start_stake_pool(\\n\\n &[sender.clone()],\\n\\n &[],\\n\\n ConfigurationBuilder::new()\\n\\n .with_slots_per_epoch(60)\\n\\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\\n\\n .with_slot_duration(4)\\n\\n .with_epoch_stability_depth(10)\\n\\n .with_kes_update_speed(KesUpdateSpeed::new(43200).unwrap()),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let output_value = 1_u64;\\n\\n let benchmark = benchmark_endurance(\\\"test_blocks_are_created_for_more_than_15_minutes\\\")\\n\\n .target(Duration::from_secs(900))\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/non_functional/transaction.rs\",\n \"rank\": 72,\n \"score\": 122251.93381507306\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_blocks_are_being_created_for_7_hours() {\\n\\n let qcli: JCli = Default::default();\\n\\n let duration_48_hours = Duration::from_secs(25_200);\\n\\n\\n\\n let mut receiver = silica::Wallet::default();\\n\\n let mut sender = silica::Wallet::default();\\n\\n let (quibitous, _) = startup::start_stake_pool(\\n\\n &[sender.clone()],\\n\\n &[],\\n\\n ConfigurationBuilder::new()\\n\\n .with_slots_per_epoch(20)\\n\\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\\n\\n .with_slot_duration(3)\\n\\n .with_kes_update_speed(KesUpdateSpeed::new(43200).unwrap())\\n\\n .with_mempool(Mempool {\\n\\n pool_max_entries: 1_000_000usize.into(),\\n\\n log_max_entries: 1_000_000usize.into(),\\n\\n persistent_log: None,\\n\\n }),\\n\\n )\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/non_functional/soak.rs\",\n \"rank\": 73,\n \"score\": 122251.93381507306\n },\n {\n \"content\": \"pub fn persist_dir_on_panic<S1: AsRef<str>, S2: AsRef<str>>(\\n\\n temp_dir: Option<TestingDirectory>,\\n\\n additional_contents: Vec<(S1, S2)>,\\n\\n) {\\n\\n if panicking() {\\n\\n let logs_dir = match tempfile::Builder::new().prefix(\\\"quibitous_\\\").tempdir() {\\n\\n Ok(dir) => dir.into_path(),\\n\\n Err(e) => {\\n\\n eprintln!(\\\"Could not create logs dir: {}\\\", e);\\n\\n return;\\n\\n }\\n\\n };\\n\\n\\n\\n println!(\\n\\n \\\"persisting node temp_dir after panic: {}\\\",\\n\\n logs_dir.display()\\n\\n );\\n\\n\\n\\n if let Some(dir) = temp_dir {\\n\\n let options = CopyOptions {\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/panic.rs\",\n \"rank\": 74,\n \"score\": 121145.81197125277\n },\n {\n \"content\": \"fn initial(block0: &Block) -> Result<&ConfigParams, Block0Malformed> {\\n\\n for fragment in block0.fragments() {\\n\\n if let Fragment::Initial(init) = fragment {\\n\\n return Ok(init);\\n\\n }\\n\\n }\\n\\n Err(Block0Malformed::NoInitialSettings)\\n\\n}\\n\",\n \"file_path\": \"modules/blockchain/src/block0.rs\",\n \"rank\": 75,\n \"score\": 121108.85372060335\n },\n {\n \"content\": \"#[test]\\n\\npub fn passive_node_last_block_info() {\\n\\n let mut network_controller = build_network!()\\n\\n .topology(\\n\\n Topology::default()\\n\\n .with_node(Node::new(LEADER))\\n\\n .with_node(Node::new(PASSIVE).with_trusted_peer(LEADER)),\\n\\n )\\n\\n .blockchain_config(Blockchain::default().with_leader(LEADER))\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(\\\"alice\\\")\\n\\n .with(1_000_000)\\n\\n .delegated_to(LEADER)\\n\\n .build(),\\n\\n )\\n\\n .wallet_template(WalletTemplateBuilder::new(\\\"bob\\\").with(1_000_000).build())\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n let leader = network_controller\\n\\n .spawn(SpawnParams::new(LEADER).in_memory())\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/networking/p2p/stats.rs\",\n \"rank\": 76,\n \"score\": 120389.5540176767\n },\n {\n \"content\": \"#[test]\\n\\npub fn get_blocks_incorrect_hash() {\\n\\n let setup = setup::client::default();\\n\\n let fake_hash: Hash = TestGen::hash();\\n\\n assert_eq!(\\n\\n MockClientError::InvalidRequest(format!(\\n\\n \\\"not found (block {} is not known to this node)\\\",\\n\\n fake_hash\\n\\n )),\\n\\n setup.client.headers(&[fake_hash]).err().unwrap(),\\n\\n \\\"wrong error\\\"\\n\\n );\\n\\n}\\n\\n\\n\\n// L1013 PullBlocksToTip correct hash\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 77,\n \"score\": 120389.5540176767\n },\n {\n \"content\": \"#[test]\\n\\npub fn get_blocks_correct_hash() {\\n\\n let setup = setup::client::default();\\n\\n\\n\\n let tip = setup.client.tip();\\n\\n assert!(setup.client.get_blocks(&[tip.hash()]).is_ok());\\n\\n}\\n\\n\\n\\n// L1012 GetBlocks incorrect hash\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 78,\n \"score\": 120389.5540176767\n },\n {\n \"content\": \"#[test]\\n\\npub fn leader_node_last_block_info() {\\n\\n let mut network_controller = build_network!()\\n\\n .topology(\\n\\n Topology::default()\\n\\n .with_node(Node::new(LEADER))\\n\\n .with_node(Node::new(LEADER_CLIENT).with_trusted_peer(LEADER)),\\n\\n )\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(\\\"alice\\\")\\n\\n .with(1_000_000)\\n\\n .delegated_to(LEADER)\\n\\n .build(),\\n\\n )\\n\\n .wallet_template(WalletTemplateBuilder::new(\\\"bob\\\").with(1_000_000).build())\\n\\n .blockchain_config(Blockchain::default().with_leader(LEADER))\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n let leader = network_controller\\n\\n .spawn(SpawnParams::new(LEADER).in_memory())\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/networking/p2p/stats.rs\",\n \"rank\": 79,\n \"score\": 120389.5540176767\n },\n {\n \"content\": \"pub fn send_transaction_and_ensure_block_was_produced(\\n\\n transation_messages: &[String],\\n\\n quibitous: &QuibitousProcess,\\n\\n) -> Result<(), NodeStuckError> {\\n\\n let qcli: JCli = Default::default();\\n\\n let block_tip_before_transaction = qcli.rest().v0().tip(&quibitous.rest_uri());\\n\\n let block_counter_before_transaction = quibitous.logger.get_created_blocks_counter();\\n\\n\\n\\n qcli.fragment_sender(quibitous)\\n\\n .send_many(transation_messages)\\n\\n .wait_until_all_processed(&Default::default())\\n\\n .map_err(NodeStuckError::InternalQcliError)?;\\n\\n\\n\\n let block_tip_after_transaction = qcli.rest().v0().tip(quibitous.rest_uri());\\n\\n let block_counter_after_transaction = quibitous.logger.get_created_blocks_counter();\\n\\n\\n\\n if block_tip_before_transaction == block_tip_after_transaction {\\n\\n return Err(NodeStuckError::TipIsNotMoving {\\n\\n tip_hash: block_tip_after_transaction,\\n\\n logs: quibitous.logger.get_log_content(),\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/non_functional/mod.rs\",\n \"rank\": 80,\n \"score\": 120389.5540176767\n },\n {\n \"content\": \"#[test]\\n\\npub fn upload_block_incompatible_protocol() {\\n\\n let setup = setup::client::default();\\n\\n let tip_header = setup.client.tip();\\n\\n let stake_pool = StakePoolBuilder::new().build();\\n\\n\\n\\n let time_era = TimeEra::new(\\n\\n 0u64.into(),\\n\\n Epoch(0u32),\\n\\n setup\\n\\n .config\\n\\n .block0_configuration()\\n\\n .blockchain_configuration\\n\\n .slots_per_epoch\\n\\n .into(),\\n\\n );\\n\\n\\n\\n let block = GenesisOptimumBlockBuilder::new()\\n\\n .with_parent(&tip_header)\\n\\n .build(&stake_pool, &time_era);\\n\\n\\n\\n assert_eq!(\\n\\n MockClientError::InvalidRequest(\\n\\n \\\"invalid request data (the block header verification failed)\\\".into()\\n\\n ),\\n\\n setup.client.upload_blocks(block).err().unwrap()\\n\\n );\\n\\n}\\n\\n\\n\\n// L1020 Push headers incorrect header\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 81,\n \"score\": 120389.5540176767\n },\n {\n \"content\": \"pub fn deserialize_signature<'de, D, T, A>(deserializer: D) -> Result<Signature<T, A>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n A: VerificationAlgorithm,\\n\\n{\\n\\n let signature_visitor = SignatureVisitor::new();\\n\\n if deserializer.is_human_readable() {\\n\\n deserializer.deserialize_str(signature_visitor)\\n\\n } else {\\n\\n deserializer.deserialize_bytes(signature_visitor)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 82,\n \"score\": 120310.62809292071\n },\n {\n \"content\": \"type GetNextBlockScheduler = FireForgetScheduler<HeaderHash, NodeId, ()>;\\n\\n\\n\\nconst TIP_UPDATE_QUEUE_SIZE: usize = 10;\\n\\n\\n\\nconst DEFAULT_TIMEOUT_PROCESS_LEADERSHIP: u64 = 5;\\n\\nconst DEFAULT_TIMEOUT_PROCESS_ANNOUNCEMENT: u64 = 5;\\n\\nconst DEFAULT_TIMEOUT_PROCESS_BLOCKS: u64 = 60;\\n\\nconst DEFAULT_TIMEOUT_PROCESS_HEADERS: u64 = 60;\\n\\n\\n\\nconst PULL_HEADERS_SCHEDULER_CONFIG: FireForgetSchedulerConfig = FireForgetSchedulerConfig {\\n\\n max_running: 16,\\n\\n max_running_same_task: 2,\\n\\n command_channel_size: 1024,\\n\\n timeout: Duration::from_millis(500),\\n\\n};\\n\\n\\n\\nconst GET_NEXT_BLOCK_SCHEDULER_CONFIG: FireForgetSchedulerConfig = FireForgetSchedulerConfig {\\n\\n max_running: 16,\\n\\n max_running_same_task: 2,\\n\\n command_channel_size: 1024,\\n\",\n \"file_path\": \"quibitous/src/blockchain/process.rs\",\n \"rank\": 83,\n \"score\": 119346.90772294276\n },\n {\n \"content\": \"pub fn wait_for_date(target_block_date: BlockDate, mut rest: QuibitousRest) {\\n\\n let settings = rest.settings().unwrap();\\n\\n while is_it_due(get_current_date(&mut rest), target_block_date) {\\n\\n std::thread::sleep(std::time::Duration::from_secs(settings.slot_duration));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-automation/src/testing/time.rs\",\n \"rank\": 84,\n \"score\": 119188.25074030922\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Tip(Arc<RwLock<HeaderHash>>);\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct ExplorerDb {\\n\\n /// Structure that keeps all the known states to allow easy branch management\\n\\n /// each new block is indexed by getting its previous `State` from the multiverse\\n\\n /// and inserted a new updated one.\\n\\n multiverse: Multiverse,\\n\\n /// This keeps track of the longest chain seen until now. All the queries are\\n\\n /// performed using the state of this branch, the HeaderHash is used as key for the\\n\\n /// multiverse, and the ChainLength is used in the updating process.\\n\\n longest_chain_tip: Tip,\\n\\n pub blockchain_config: BlockchainConfig,\\n\\n stable_store: StableIndex,\\n\\n tip_broadcast: tokio::sync::broadcast::Sender<(HeaderHash, multiverse::Ref)>,\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct StableIndex {\\n\\n confirmed_block_chain_length: Arc<AtomicU32>,\\n\",\n \"file_path\": \"explorer/src/db/mod.rs\",\n \"rank\": 85,\n \"score\": 119021.0448670129\n },\n {\n \"content\": \"fn parse_block_hash(hex: &str) -> Result<Hash, Error> {\\n\\n Blake2b256::from_str(hex)\\n\\n .map_err(Into::into)\\n\\n .map(Into::into)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous/src/rest/v0/logic.rs\",\n \"rank\": 86,\n \"score\": 119012.27011943782\n },\n {\n \"content\": \"pub fn serialize_public<S, A>(key: &PublicKey<A>, serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n A: AsymmetricPublicKey,\\n\\n{\\n\\n if serializer.is_human_readable() {\\n\\n key.to_bech32_str().serialize(serializer)\\n\\n } else {\\n\\n key.as_ref().serialize(serializer)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 87,\n \"score\": 118794.87720415111\n },\n {\n \"content\": \"pub fn serialize_secret<S, A>(key: &SecretKey<A>, serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n A: AsymmetricKey,\\n\\n SecretKey<A>: Bech32,\\n\\n{\\n\\n if serializer.is_human_readable() {\\n\\n key.to_bech32_str().serialize(serializer)\\n\\n } else {\\n\\n panic!(\\\"binary encoding for serialization of the secret key does not exist in chain-crypto\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"quibitous-lib/src/crypto/serde.rs\",\n \"rank\": 88,\n \"score\": 118794.87720415111\n },\n {\n \"content\": \"#[test]\\n\\npub fn topics_of_interest_influences_node_sync_ability() {\\n\\n const FAST_CLIENT: &str = \\\"FAST_CLIENT\\\";\\n\\n const SLOW_CLIENT: &str = \\\"SLOW_CLIENT\\\";\\n\\n\\n\\n let mut network_controller = NetworkBuilder::default()\\n\\n .topology(\\n\\n Topology::default()\\n\\n .with_node(Node::new(SERVER))\\n\\n .with_node(Node::new(FAST_CLIENT).with_trusted_peer(SERVER))\\n\\n .with_node(Node::new(SLOW_CLIENT).with_trusted_peer(SERVER)),\\n\\n )\\n\\n .blockchain_config(Blockchain::default().with_leader(SERVER))\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(ALICE)\\n\\n .with(1_000_000)\\n\\n .delegated_to(SERVER)\\n\\n .build(),\\n\\n )\\n\\n .wallet_template(\\n\\n WalletTemplateBuilder::new(BOB)\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/networking/p2p/connections.rs\",\n \"rank\": 89,\n \"score\": 118679.99646240375\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_correct_hash_is_returned_for_correct_block() {\\n\\n let qcli: JCli = Default::default();\\n\\n let content = qcli.genesis().init();\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n let yaml_file = temp_dir.child(\\\"init_file.yaml\\\");\\n\\n yaml_file.write_str(&content).unwrap();\\n\\n let block_file = temp_dir.child(\\\"block-0.bin\\\");\\n\\n\\n\\n qcli.genesis().encode(yaml_file.path(), &block_file);\\n\\n qcli.genesis().hash(block_file.path());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/genesis/hash.rs\",\n \"rank\": 90,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn upload_block_nonexisting_stake_pool() {\\n\\n let setup = setup::client::bootstrap(\\n\\n ConfigurationBuilder::new()\\n\\n .with_block0_consensus(ConsensusVersion::GenesisOptimum)\\n\\n .to_owned(),\\n\\n );\\n\\n let tip_header = setup.client.tip();\\n\\n let stake_pool = StakePoolBuilder::new().build();\\n\\n\\n\\n let time_era = TimeEra::new(\\n\\n 0u64.into(),\\n\\n Epoch(0u32),\\n\\n setup\\n\\n .config\\n\\n .block0_configuration()\\n\\n .blockchain_configuration\\n\\n .slots_per_epoch\\n\\n .into(),\\n\\n );\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 91,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn pull_blocks_hashes_wrong_order() {\\n\\n let setup = setup::client::default();\\n\\n\\n\\n setup\\n\\n .client\\n\\n .wait_for_chain_length(10.into(), CHAIN_GROWTH_TIMEOUT);\\n\\n\\n\\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\\n\\n let start = 2;\\n\\n let end = 8;\\n\\n let expected_hashes = block_hashes_from_logs[start..end].to_vec();\\n\\n\\n\\n let result = setup.client.pull_blocks(\\n\\n &[expected_hashes.last().copied().unwrap()],\\n\\n expected_hashes[0],\\n\\n );\\n\\n\\n\\n assert!(result.is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 92,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_genesis_block_is_built_from_correct_yaml() {\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n let config = Block0ConfigurationBuilder::new().build();\\n\\n let config_file = temp_dir.child(\\\"genesis.yaml\\\");\\n\\n let content = serde_yaml::to_string(&config).unwrap();\\n\\n config_file.write_str(&content).unwrap();\\n\\n let output_block_file = temp_dir.child(\\\"block-0.bin\\\");\\n\\n let qcli: JCli = Default::default();\\n\\n qcli.genesis()\\n\\n .encode(config_file.path(), &output_block_file);\\n\\n\\n\\n assert!(output_block_file.path().exists());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/genesis/encode.rs\",\n \"rank\": 93,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_non_empty_hash_is_returned_for_block0() {\\n\\n let qcli: JCli = Default::default();\\n\\n let quibitous = Starter::new().start().unwrap();\\n\\n let rest_uri = quibitous.rest_uri();\\n\\n let block_id = qcli.rest().v0().tip(&rest_uri);\\n\\n qcli.rest().v0().block().get(block_id, rest_uri);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/rest/block.rs\",\n \"rank\": 94,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_genesis_block_is_built_from_init_yaml() {\\n\\n let qcli: JCli = Default::default();\\n\\n\\n\\n let content = qcli.genesis().init();\\n\\n let temp_dir = TempDir::new().unwrap();\\n\\n let yaml_file = temp_dir.child(\\\"init_file.yaml\\\");\\n\\n yaml_file.write_str(&content).unwrap();\\n\\n let block_file = temp_dir.child(\\\"block-0.bin\\\");\\n\\n qcli.genesis().encode(yaml_file.path(), &block_file);\\n\\n}\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/genesis/init.rs\",\n \"rank\": 95,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_increased_block_content_max_size() {\\n\\n let receivers: Vec<Wallet> = std::iter::from_fn(|| Some(silica::Wallet::default()))\\n\\n .take(98)\\n\\n .collect();\\n\\n let mut stake_pool_owner = silica::Wallet::default();\\n\\n\\n\\n let stake_pool_owner_stake = 1;\\n\\n\\n\\n let (quibitous, _stake_pools) = startup::start_stake_pool(\\n\\n &[stake_pool_owner.clone()],\\n\\n &[],\\n\\n ConfigurationBuilder::new()\\n\\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\\n\\n .with_block_content_max_size(8192.into()),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let settings = quibitous.rest().settings().unwrap();\\n\\n\\n\\n let transaction_sender = FragmentSender::new(\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/genesis/fragments.rs\",\n \"rank\": 96,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn pull_blocks_correct_hashes_partial() {\\n\\n let setup = setup::client::default();\\n\\n setup\\n\\n .client\\n\\n .wait_for_chain_length(10.into(), CHAIN_GROWTH_TIMEOUT);\\n\\n\\n\\n let block_hashes_from_logs = setup.server.logger.get_created_blocks_hashes();\\n\\n let start = 2;\\n\\n let end = 8;\\n\\n let expected_hashes = block_hashes_from_logs[start..end].to_vec();\\n\\n\\n\\n let blocks = setup\\n\\n .client\\n\\n .pull_blocks(\\n\\n &[expected_hashes[0]],\\n\\n expected_hashes.last().copied().unwrap(),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let blocks_hashes: Vec<Hash> = blocks.iter().map(|x| x.header().hash()).collect();\\n\\n\\n\\n assert_eq!(&expected_hashes[1..], &blocks_hashes);\\n\\n}\\n\\n\\n\\n// L1023 PullBlocks to and from in wrong order\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/grpc/client_tests.rs\",\n \"rank\": 97,\n \"score\": 118605.34832378927\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_block_content_max_size_below_transaction_size() {\\n\\n let receivers: Vec<Wallet> = std::iter::from_fn(|| Some(silica::Wallet::default()))\\n\\n .take(98)\\n\\n .collect();\\n\\n let mut stake_pool_owner = silica::Wallet::default();\\n\\n\\n\\n let stake_pool_owner_stake = 1;\\n\\n\\n\\n let (quibitous, _stake_pools) = startup::start_stake_pool(\\n\\n &[stake_pool_owner.clone()],\\n\\n &[],\\n\\n ConfigurationBuilder::new()\\n\\n .with_consensus_genesis_optimum_active_slot_coeff(ActiveSlotCoefficient::MAXIMUM)\\n\\n .with_block_content_max_size(4092.into()),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let fragment_sender = FragmentSender::from_with_setup(\\n\\n quibitous.block0_configuration(),\\n\\n FragmentSenderSetup::should_stop_at_error(),\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/quibitous/genesis/fragments.rs\",\n \"rank\": 98,\n \"score\": 116894.49583122502\n },\n {\n \"content\": \"pub fn test_correct_error_is_returned_for_incorrect_host_syntax() {\\n\\n let qcli: JCli = Default::default();\\n\\n let incorrect_host = \\\"not_a_correct_syntax\\\";\\n\\n\\n\\n qcli.rest().v0().tip_expect_fail(\\n\\n incorrect_host,\\n\\n \\\"Invalid value for '--host <host>': relative URL without a base\\\",\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/quibitous-integration-tests/src/qcli/rest/host.rs\",\n \"rank\": 99,\n \"score\": 116879.94886666126\n }\n]","isConversational":false}}},{"rowIdx":1172,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/main.rs"},"repo_name":{"kind":"string","value":"azerupi/cube-parse"},"commit":{"kind":"string","value":"ee5af4aa48755449bab7d7afe01166e029791ffc"},"file_code":{"kind":"string","value":"use std::{collections::HashMap, env, path::Path};\n\nuse alphanumeric_sort::compare_str;\nuse clap::{App, Arg};\nuse lazy_static::lazy_static;\nuse regex::Regex;\n\nmod family;\nmod internal_peripheral;\nmod mcu;\nmod utils;\n\n#[derive(Debug, PartialEq)]\nenum GenerateTarget {\n Features,\n PinMappings,\n EepromSizes,\n}\n\nlazy_static! {\n \n static ref GPIO_VERSION: Regex = Regex::new(\"^([^_]*)_gpio_v1_0$\").unwrap();\n}\n\nfn gpio_version_to_feature(version: &str) -> Result<String, String> {\n if let Some(captures) = GPIO_VERSION.captures(version) {\n Ok(format!(\"io-{}\", captures.get(1).unwrap().as_str()))\n } else {\n Err(format!(\"Could not parse version {:?}\", version))\n }\n}\n\nfn eeprom_size_to_feature(size: u32) -> String {\n format!(\"eeprom-{}\", size)\n}\n\nfn flash_size_to_feature(size: u32) -> String {\n format!(\"flash-{}\", size)\n}\n\nfn ram_size_to_feature(size: u32) -> String {\n format!(\"ram-{}\", size)\n}\n\nfn main() -> Result<(), String> {\n let args = App::new(\"cube-parse\")\n .version(env!(\"CARGO_PKG_VERSION\"))\n .about(\"Extract AF modes on MCU pins from the database files provided with STM32CubeMX\")\n .author(&*env!(\"CARGO_PKG_AUTHORS\").replace(\":\", \", \"))\n .arg(\n Arg::with_name(\"db_dir\")\n .short(\"d\")\n .help(\"Path to the CubeMX MCU database directory\")\n .takes_value(true)\n .required(true),\n )\n .arg(\n Arg::with_name(\"generate\")\n .help(\"What to generate\")\n .takes_value(true)\n .possible_values(&[\"features\", \"pin_mappings\", \"eeprom_sizes\"])\n .required(true),\n )\n .arg(\n Arg::with_name(\"mcu_family\")\n .help(\"The MCU family to extract, e.g. \\\"STM32L0\\\"\")\n .takes_value(true)\n .required(true),\n )\n .get_matches();\n\n \n let db_dir = Path::new(args.value_of(\"db_dir\").unwrap());\n let mcu_family = args.value_of(\"mcu_family\").unwrap();\n let generate = match args.value_of(\"generate\").unwrap() {\n \"features\" => GenerateTarget::Features,\n \"pin_mappings\" => GenerateTarget::PinMappings,\n \"eeprom_sizes\" => GenerateTarget::EepromSizes,\n _ => unreachable!(),\n };\n\n \n let families = family::Families::load(&db_dir)\n .map_err(|e| format!(\"Could not load families XML: {}\", e))?;\n\n \n let family = (&families)\n .into_iter()\n .find(|v| v.name == mcu_family)\n .ok_or_else(|| format!(\"Could not find family {}\", mcu_family))?;\n\n \n \n \n let mut mcu_map: HashMap<String, (&family::Mcu, mcu::Mcu)> = HashMap::new();\n\n \n \n \n \n let mut mcu_gpio_map: HashMap<String, Vec<String>> = HashMap::new();\n\n \n \n \n let mut mcu_package_map: HashMap<String, String> = HashMap::new();\n\n \n \n \n let mut mcu_eeprom_size_map: HashMap<u32, Vec<String>> = HashMap::new();\n\n \n \n \n let mut mcu_flash_size_map: HashMap<u32, Vec<String>> = HashMap::new();\n\n \n \n \n let mut mcu_ram_size_map: HashMap<u32, Vec<String>> = HashMap::new();\n\n \n \n for sf in family {\n for mcu in sf {\n \n let mcu_dat = mcu::Mcu::load(&db_dir, &mcu.name)\n .map_err(|e| format!(\"Could not load MCU data for mcu {}: {}\", &mcu.name, e))?;\n\n \n let gpio_version = mcu_dat.get_ip(\"GPIO\").unwrap().get_version().to_string();\n mcu_gpio_map\n .entry(gpio_version)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n\n \n if mcu_family == \"STM32L0\" {\n \n mcu_package_map.insert(mcu.ref_name.clone(), mcu.package_name.clone());\n }\n\n \n if let Some(size) = mcu_dat.get_eeprom_size() {\n mcu_eeprom_size_map\n .entry(size)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n }\n\n \n if let Some(flash_size) = mcu.flash_size() {\n mcu_flash_size_map\n .entry(flash_size)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n }\n\n \n if let Some(ram_size) = mcu.ram_size() {\n mcu_ram_size_map\n .entry(ram_size)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n }\n\n mcu_map.insert(mcu.ref_name.clone(), (mcu, mcu_dat));\n }\n }\n\n match generate {\n GenerateTarget::Features => generate_features(\n &mcu_map,\n &mcu_gpio_map,\n &mcu_package_map,\n &mcu_eeprom_size_map,\n &mcu_flash_size_map,\n &mcu_ram_size_map,\n &mcu_family,\n )?,\n GenerateTarget::PinMappings => generate_pin_mappings(&mcu_gpio_map, &db_dir)?,\n GenerateTarget::EepromSizes => generate_eeprom_sizes(&mcu_eeprom_size_map)?,\n };\n\n Ok(())\n}\n\nlazy_static! {\n static ref FEATURE_DEPENDENCIES: HashMap<&'static str, HashMap<&'static str, &'static str>> = {\n let mut m = HashMap::new();\n\n \n let mut l0 = HashMap::new();\n l0.insert(\"^STM32L0.1\", \"stm32l0x1\");\n l0.insert(\"^STM32L0.2\", \"stm32l0x2\");\n l0.insert(\"^STM32L0.3\", \"stm32l0x3\");\n m.insert(\"STM32L0\", l0);\n\n m\n };\n}\n\nfn generate_features(\n mcu_map: &HashMap<String, (&family::Mcu, mcu::Mcu)>,\n mcu_gpio_map: &HashMap<String, Vec<String>>,\n mcu_package_map: &HashMap<String, String>,\n mcu_eeprom_size_map: &HashMap<u32, Vec<String>>,\n mcu_flash_size_map: &HashMap<u32, Vec<String>>,\n mcu_ram_size_map: &HashMap<u32, Vec<String>>,\n mcu_family: &str,\n) -> Result<(), String> {\n \n let mut io_features = mcu_gpio_map\n .keys()\n .map(|gpio| gpio_version_to_feature(gpio))\n .collect::<Result<Vec<String>, String>>()?;\n io_features.sort();\n println!(\"# Features based on the GPIO peripheral version\");\n println!(\"# This determines the pin function mapping of the MCU\");\n for feature in io_features {\n println!(\"{} = []\", feature);\n }\n println!();\n\n \n let mut eeprom_sizes = mcu_eeprom_size_map.keys().collect::<Vec<_>>();\n eeprom_sizes.sort();\n println!(\"# Features based on EEPROM size (in bytes)\");\n for size in eeprom_sizes {\n println!(\"{} = []\", eeprom_size_to_feature(*size));\n }\n println!();\n\n \n let mut flash_sizes = mcu_flash_size_map.keys().collect::<Vec<_>>();\n flash_sizes.sort();\n println!(\"# Features based on Flash size (in kbytes)\");\n for size in flash_sizes {\n println!(\"{} = []\", flash_size_to_feature(*size));\n }\n println!();\n\n \n let mut ram_sizes = mcu_ram_size_map.keys().collect::<Vec<_>>();\n ram_sizes.sort();\n println!(\"# Features based on RAM size (in kbytes)\");\n for size in ram_sizes {\n println!(\"{} = []\", ram_size_to_feature(*size));\n }\n println!();\n\n \n if !mcu_package_map.is_empty() {\n println!(\"# Physical packages\");\n let mut packages = mcu_package_map\n .values()\n .map(|v| v.to_lowercase())\n .collect::<Vec<_>>();\n packages.sort_by(|a, b| compare_str(a, b));\n packages.dedup();\n for pkg in packages {\n println!(\"{} = []\", pkg);\n }\n println!();\n }\n\n \n let mut mcu_aliases = vec![];\n for (gpio, mcu_list) in mcu_gpio_map {\n let gpio_version_feature = gpio_version_to_feature(gpio).unwrap();\n for mcu in mcu_list {\n let mut dependencies = vec![];\n\n \n if let Some(family) = FEATURE_DEPENDENCIES.get(mcu_family) {\n for (pattern, feature) in family {\n if Regex::new(pattern).unwrap().is_match(&mcu) {\n dependencies.push(feature.to_string());\n break;\n }\n }\n }\n\n \n if let Some(package) = mcu_package_map.get(mcu) {\n dependencies.push(package.to_lowercase());\n }\n\n \n dependencies.push(gpio_version_feature.clone());\n\n let (mcu_info, mcu_dat) = mcu_map.get(mcu).unwrap();\n\n \n if let Some(size) = mcu_dat.get_eeprom_size() {\n dependencies.push(eeprom_size_to_feature(size));\n }\n\n \n if let Some(flash_size) = mcu_info.flash_size() {\n dependencies.push(flash_size_to_feature(flash_size));\n }\n\n if let Some(ram_size) = mcu_info.ram_size() {\n dependencies.push(ram_size_to_feature(ram_size));\n }\n\n mcu_aliases.push(format!(\n \"mcu-{} = [{}]\",\n mcu,\n &dependencies.iter().map(|val| format!(\"\\\"{}\\\"\", val)).fold(\n String::new(),\n |mut acc, x| {\n if !acc.is_empty() {\n acc.push_str(\", \");\n }\n acc.push_str(&x);\n acc\n }\n )\n ));\n }\n }\n mcu_aliases.sort();\n println!(\"# MCU aliases\");\n println!(\"#\");\n println!(\"# Note: These are just aliases, they should not be used to directly feature gate\");\n println!(\n \"# functionality in the HAL! However, user code should usually depend on a MCU alias.\"\n );\n for alias in mcu_aliases {\n println!(\"{}\", alias);\n }\n\n Ok(())\n}\n\nfn generate_pin_mappings(\n mcu_gpio_map: &HashMap<String, Vec<String>>,\n db_dir: &Path,\n) -> Result<(), String> {\n let mut gpio_versions = mcu_gpio_map.keys().collect::<Vec<_>>();\n gpio_versions.sort();\n for gpio in gpio_versions {\n let gpio_version_feature = gpio_version_to_feature(&gpio)?;\n println!(\"#[cfg(feature = \\\"{}\\\")]\", gpio_version_feature);\n let gpio_data = internal_peripheral::IpGPIO::load(db_dir, &gpio)\n .map_err(|e| format!(\"Could not load IP GPIO file: {}\", e))?;\n render_pin_modes(&gpio_data);\n println!(\"\\n\");\n }\n Ok(())\n}\n\nfn generate_eeprom_sizes(mcu_eeprom_size_map: &HashMap<u32, Vec<String>>) -> Result<(), String> {\n println!(\"// EEPROM sizes in bytes, generated with cube-parse\");\n for size in mcu_eeprom_size_map.keys() {\n println!(\"#[cfg(feature = \\\"{}\\\")]\", eeprom_size_to_feature(*size));\n println!(\"const EEPROM_SIZE_BYTES: u32 = {};\", size);\n }\n Ok(())\n}\n\nfn render_pin_modes(ip: &internal_peripheral::IpGPIO) {\n let mut pin_map: HashMap<String, Vec<String>> = HashMap::new();\n\n for p in &ip.gpio_pin {\n let name = p.get_name();\n if let Some(n) = name {\n pin_map.insert(n, p.get_af_modes());\n }\n }\n\n let mut pin_map = pin_map\n .into_iter()\n .map(|(k, mut v)| {\n #[allow(clippy::redundant_closure)]\n v.sort_by(|a, b| compare_str(a, b));\n (k, v)\n })\n .collect::<Vec<_>>();\n\n pin_map.sort_by(|a, b| compare_str(&a.0, &b.0));\n\n println!(\"pins! {{\");\n for (n, af) in pin_map {\n if af.is_empty() {\n continue;\n } else if af.len() == 1 {\n println!(\" {} => {{{}}},\", n, af[0]);\n } else {\n println!(\" {} => {{\", n);\n for a in af {\n println!(\" {},\", a);\n }\n println!(\" }},\");\n }\n }\n println!(\"}}\");\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_gpio_version_to_feature() {\n \n assert_eq!(\n gpio_version_to_feature(\"STM32L152x8_gpio_v1_0\").unwrap(),\n \"io-STM32L152x8\"\n );\n assert_eq!(\n gpio_version_to_feature(\"STM32F333_gpio_v1_0\").unwrap(),\n \"io-STM32F333\"\n );\n\n \n assert!(gpio_version_to_feature(\"STM32F333_gpio_v1_1\").is_err());\n\n \n assert!(gpio_version_to_feature(\"STM32F333_qqio_v1_0\").is_err());\n\n \n assert!(gpio_version_to_feature(\"STM32_STM32F333_gpio_v1_0\").is_err());\n }\n}\n"},"prefix":{"kind":"string","value":"use std::{collections::HashMap, env, path::Path};\n\nuse alphanumeric_sort::compare_str;\nuse clap::{App, Arg};\nuse lazy_static::lazy_static;\nuse regex::Regex;\n\nmod family;\nmod internal_peripheral;\nmod mcu;\nmod utils;\n\n#[derive(Debug, PartialEq)]\nenum GenerateTarget {\n Features,\n PinMappings,\n EepromSizes,\n}\n\nlazy_static! {\n \n static ref GPIO_VERSION: Regex = Regex::new(\"^([^_]*)_gpio_v1_0$\").unwrap();\n}\n\nfn gpio_version_to_feature(version: &str) -> Result<String, String> {\n if let Some(captures) = GPIO_VERSION.captures(version) {\n Ok(format!(\"io-{}\", captures.get(1).unwrap().as_str()))\n } else {\n Err(format!(\"Could not parse version {:?}\", version))\n }\n}\n\nfn eeprom_size_to_feature(size: u32) -> String {\n format!(\"eeprom-{}\", size)\n}\n\nfn flash_size_to_feature(size: u32) -> String {\n format!(\"flash-{}\", size)\n}\n\nfn ram_size_to_feature(size: u32) -> String {\n format!(\"ram-{}\", size)\n}\n\nfn main() -> Result<(), String> {\n let args = App::new(\"cube-parse\")\n .version(env!(\"CARGO_PKG_VERSION\"))\n .about(\"Extract AF modes on MCU pins from the database files provided with STM32CubeMX\")\n .author(&*env!(\"CARGO_PKG_AUTHORS\").replace(\":\", \", \"))\n .arg(\n Arg::with_name(\"db_dir\")\n .short(\"d\")\n .help(\"Path to the CubeMX MCU database directory\")\n .takes_value(true)\n .required(true),\n )\n .arg(\n Arg::with_name(\"generate\")\n .help(\"What to generate\")\n .takes_value(true)\n .possible_values(&[\"features\", \"pin_mappings\", \"eeprom_sizes\"])\n .required(true),\n )\n .arg(\n Arg::with_name(\"mcu_family\")\n .help(\"The MCU family to extract, e.g. \\\"STM32L0\\\"\")\n .takes_value(true)\n .required(true),\n )\n .get_matches();\n\n \n let db_dir = Path::new(args.value_of(\"db_dir\").unwrap());\n let mcu_family = args.value_of(\"mcu_family\").unwrap();\n let generate = match args.value_of(\"generate\").unwrap() {\n \"features\" => GenerateTarget::Features,\n \"pin_mappings\" => Genera"},"suffix":{"kind":"string","value":" }\n\n \n if let Some(ram_size) = mcu.ram_size() {\n mcu_ram_size_map\n .entry(ram_size)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n }\n\n mcu_map.insert(mcu.ref_name.clone(), (mcu, mcu_dat));\n }\n }\n\n match generate {\n GenerateTarget::Features => generate_features(\n &mcu_map,\n &mcu_gpio_map,\n &mcu_package_map,\n &mcu_eeprom_size_map,\n &mcu_flash_size_map,\n &mcu_ram_size_map,\n &mcu_family,\n )?,\n GenerateTarget::PinMappings => generate_pin_mappings(&mcu_gpio_map, &db_dir)?,\n GenerateTarget::EepromSizes => generate_eeprom_sizes(&mcu_eeprom_size_map)?,\n };\n\n Ok(())\n}\n\nlazy_static! {\n static ref FEATURE_DEPENDENCIES: HashMap<&'static str, HashMap<&'static str, &'static str>> = {\n let mut m = HashMap::new();\n\n \n let mut l0 = HashMap::new();\n l0.insert(\"^STM32L0.1\", \"stm32l0x1\");\n l0.insert(\"^STM32L0.2\", \"stm32l0x2\");\n l0.insert(\"^STM32L0.3\", \"stm32l0x3\");\n m.insert(\"STM32L0\", l0);\n\n m\n };\n}\n\nfn generate_features(\n mcu_map: &HashMap<String, (&family::Mcu, mcu::Mcu)>,\n mcu_gpio_map: &HashMap<String, Vec<String>>,\n mcu_package_map: &HashMap<String, String>,\n mcu_eeprom_size_map: &HashMap<u32, Vec<String>>,\n mcu_flash_size_map: &HashMap<u32, Vec<String>>,\n mcu_ram_size_map: &HashMap<u32, Vec<String>>,\n mcu_family: &str,\n) -> Result<(), String> {\n \n let mut io_features = mcu_gpio_map\n .keys()\n .map(|gpio| gpio_version_to_feature(gpio))\n .collect::<Result<Vec<String>, String>>()?;\n io_features.sort();\n println!(\"# Features based on the GPIO peripheral version\");\n println!(\"# This determines the pin function mapping of the MCU\");\n for feature in io_features {\n println!(\"{} = []\", feature);\n }\n println!();\n\n \n let mut eeprom_sizes = mcu_eeprom_size_map.keys().collect::<Vec<_>>();\n eeprom_sizes.sort();\n println!(\"# Features based on EEPROM size (in bytes)\");\n for size in eeprom_sizes {\n println!(\"{} = []\", eeprom_size_to_feature(*size));\n }\n println!();\n\n \n let mut flash_sizes = mcu_flash_size_map.keys().collect::<Vec<_>>();\n flash_sizes.sort();\n println!(\"# Features based on Flash size (in kbytes)\");\n for size in flash_sizes {\n println!(\"{} = []\", flash_size_to_feature(*size));\n }\n println!();\n\n \n let mut ram_sizes = mcu_ram_size_map.keys().collect::<Vec<_>>();\n ram_sizes.sort();\n println!(\"# Features based on RAM size (in kbytes)\");\n for size in ram_sizes {\n println!(\"{} = []\", ram_size_to_feature(*size));\n }\n println!();\n\n \n if !mcu_package_map.is_empty() {\n println!(\"# Physical packages\");\n let mut packages = mcu_package_map\n .values()\n .map(|v| v.to_lowercase())\n .collect::<Vec<_>>();\n packages.sort_by(|a, b| compare_str(a, b));\n packages.dedup();\n for pkg in packages {\n println!(\"{} = []\", pkg);\n }\n println!();\n }\n\n \n let mut mcu_aliases = vec![];\n for (gpio, mcu_list) in mcu_gpio_map {\n let gpio_version_feature = gpio_version_to_feature(gpio).unwrap();\n for mcu in mcu_list {\n let mut dependencies = vec![];\n\n \n if let Some(family) = FEATURE_DEPENDENCIES.get(mcu_family) {\n for (pattern, feature) in family {\n if Regex::new(pattern).unwrap().is_match(&mcu) {\n dependencies.push(feature.to_string());\n break;\n }\n }\n }\n\n \n if let Some(package) = mcu_package_map.get(mcu) {\n dependencies.push(package.to_lowercase());\n }\n\n \n dependencies.push(gpio_version_feature.clone());\n\n let (mcu_info, mcu_dat) = mcu_map.get(mcu).unwrap();\n\n \n if let Some(size) = mcu_dat.get_eeprom_size() {\n dependencies.push(eeprom_size_to_feature(size));\n }\n\n \n if let Some(flash_size) = mcu_info.flash_size() {\n dependencies.push(flash_size_to_feature(flash_size));\n }\n\n if let Some(ram_size) = mcu_info.ram_size() {\n dependencies.push(ram_size_to_feature(ram_size));\n }\n\n mcu_aliases.push(format!(\n \"mcu-{} = [{}]\",\n mcu,\n &dependencies.iter().map(|val| format!(\"\\\"{}\\\"\", val)).fold(\n String::new(),\n |mut acc, x| {\n if !acc.is_empty() {\n acc.push_str(\", \");\n }\n acc.push_str(&x);\n acc\n }\n )\n ));\n }\n }\n mcu_aliases.sort();\n println!(\"# MCU aliases\");\n println!(\"#\");\n println!(\"# Note: These are just aliases, they should not be used to directly feature gate\");\n println!(\n \"# functionality in the HAL! However, user code should usually depend on a MCU alias.\"\n );\n for alias in mcu_aliases {\n println!(\"{}\", alias);\n }\n\n Ok(())\n}\n\nfn generate_pin_mappings(\n mcu_gpio_map: &HashMap<String, Vec<String>>,\n db_dir: &Path,\n) -> Result<(), String> {\n let mut gpio_versions = mcu_gpio_map.keys().collect::<Vec<_>>();\n gpio_versions.sort();\n for gpio in gpio_versions {\n let gpio_version_feature = gpio_version_to_feature(&gpio)?;\n println!(\"#[cfg(feature = \\\"{}\\\")]\", gpio_version_feature);\n let gpio_data = internal_peripheral::IpGPIO::load(db_dir, &gpio)\n .map_err(|e| format!(\"Could not load IP GPIO file: {}\", e))?;\n render_pin_modes(&gpio_data);\n println!(\"\\n\");\n }\n Ok(())\n}\n\nfn generate_eeprom_sizes(mcu_eeprom_size_map: &HashMap<u32, Vec<String>>) -> Result<(), String> {\n println!(\"// EEPROM sizes in bytes, generated with cube-parse\");\n for size in mcu_eeprom_size_map.keys() {\n println!(\"#[cfg(feature = \\\"{}\\\")]\", eeprom_size_to_feature(*size));\n println!(\"const EEPROM_SIZE_BYTES: u32 = {};\", size);\n }\n Ok(())\n}\n\nfn render_pin_modes(ip: &internal_peripheral::IpGPIO) {\n let mut pin_map: HashMap<String, Vec<String>> = HashMap::new();\n\n for p in &ip.gpio_pin {\n let name = p.get_name();\n if let Some(n) = name {\n pin_map.insert(n, p.get_af_modes());\n }\n }\n\n let mut pin_map = pin_map\n .into_iter()\n .map(|(k, mut v)| {\n #[allow(clippy::redundant_closure)]\n v.sort_by(|a, b| compare_str(a, b));\n (k, v)\n })\n .collect::<Vec<_>>();\n\n pin_map.sort_by(|a, b| compare_str(&a.0, &b.0));\n\n println!(\"pins! {{\");\n for (n, af) in pin_map {\n if af.is_empty() {\n continue;\n } else if af.len() == 1 {\n println!(\" {} => {{{}}},\", n, af[0]);\n } else {\n println!(\" {} => {{\", n);\n for a in af {\n println!(\" {},\", a);\n }\n println!(\" }},\");\n }\n }\n println!(\"}}\");\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_gpio_version_to_feature() {\n \n assert_eq!(\n gpio_version_to_feature(\"STM32L152x8_gpio_v1_0\").unwrap(),\n \"io-STM32L152x8\"\n );\n assert_eq!(\n gpio_version_to_feature(\"STM32F333_gpio_v1_0\").unwrap(),\n \"io-STM32F333\"\n );\n\n \n assert!(gpio_version_to_feature(\"STM32F333_gpio_v1_1\").is_err());\n\n \n assert!(gpio_version_to_feature(\"STM32F333_qqio_v1_0\").is_err());\n\n \n assert!(gpio_version_to_feature(\"STM32_STM32F333_gpio_v1_0\").is_err());\n }\n}\n"},"middle":{"kind":"string","value":"teTarget::PinMappings,\n \"eeprom_sizes\" => GenerateTarget::EepromSizes,\n _ => unreachable!(),\n };\n\n \n let families = family::Families::load(&db_dir)\n .map_err(|e| format!(\"Could not load families XML: {}\", e))?;\n\n \n let family = (&families)\n .into_iter()\n .find(|v| v.name == mcu_family)\n .ok_or_else(|| format!(\"Could not find family {}\", mcu_family))?;\n\n \n \n \n let mut mcu_map: HashMap<String, (&family::Mcu, mcu::Mcu)> = HashMap::new();\n\n \n \n \n \n let mut mcu_gpio_map: HashMap<String, Vec<String>> = HashMap::new();\n\n \n \n \n let mut mcu_package_map: HashMap<String, String> = HashMap::new();\n\n \n \n \n let mut mcu_eeprom_size_map: HashMap<u32, Vec<String>> = HashMap::new();\n\n \n \n \n let mut mcu_flash_size_map: HashMap<u32, Vec<String>> = HashMap::new();\n\n \n \n \n let mut mcu_ram_size_map: HashMap<u32, Vec<String>> = HashMap::new();\n\n \n \n for sf in family {\n for mcu in sf {\n \n let mcu_dat = mcu::Mcu::load(&db_dir, &mcu.name)\n .map_err(|e| format!(\"Could not load MCU data for mcu {}: {}\", &mcu.name, e))?;\n\n \n let gpio_version = mcu_dat.get_ip(\"GPIO\").unwrap().get_version().to_string();\n mcu_gpio_map\n .entry(gpio_version)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n\n \n if mcu_family == \"STM32L0\" {\n \n mcu_package_map.insert(mcu.ref_name.clone(), mcu.package_name.clone());\n }\n\n \n if let Some(size) = mcu_dat.get_eeprom_size() {\n mcu_eeprom_size_map\n .entry(size)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n }\n\n \n if let Some(flash_size) = mcu.flash_size() {\n mcu_flash_size_map\n .entry(flash_size)\n .or_insert(vec![])\n .push(mcu.ref_name.clone());\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn load_file<'a, P: AsRef<Path>, Q: AsRef<Path>, R: Deserialize<'a>>(\n\n db_dir: P,\n\n file_path: Q,\n\n) -> Result<R, Box<dyn Error>> {\n\n let db_dir = db_dir.as_ref();\n\n let mut fin = BufReader::new(File::open(&db_dir.join(file_path.as_ref()))?);\n\n\n\n Ok(serde_xml_rs::deserialize(&mut fin)?)\n\n}\n","file_path":"src/utils.rs","rank":8,"score":56449.948449911426},{"content":"use std::{error::Error, fs::File, io::BufReader, path::Path};\n\n\n\nuse serde::Deserialize;\n\n\n","file_path":"src/utils.rs","rank":11,"score":21039.490770387103},{"content":"use std::error::Error;\n\nuse std::path::Path;\n\n\n\nuse serde_derive::Deserialize;\n\n\n\nuse crate::utils::load_file;\n\n\n\n#[derive(Debug, Deserialize)]\n\npub struct Mcu {\n\n #[serde(rename = \"IP\", default)]\n\n ip: Vec<IP>,\n\n #[serde(rename = \"E2prom\")]\n\n eeprom_size_bytes: String,\n\n}\n\n\n\nimpl Mcu {\n\n pub fn load<P: AsRef<Path>>(db_dir: P, mcu_name: &str) -> Result<Self, Box<dyn Error>> {\n\n load_file(db_dir, format!(\"{}.xml\", mcu_name))\n\n }\n\n\n","file_path":"src/mcu.rs","rank":12,"score":20922.383714628784},{"content":" pub fn get_ip(&self, name: &str) -> Option<&IP> {\n\n self.ip.iter().find(|v| v.name == name)\n\n }\n\n\n\n /// Return the EEPROM size in bytes\n\n pub fn get_eeprom_size(&self) -> Option<u32> {\n\n self.eeprom_size_bytes.parse().ok()\n\n }\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"PascalCase\")]\n\npub struct IP {\n\n instance_name: String,\n\n name: String,\n\n version: String,\n\n}\n\n\n\nimpl IP {\n\n pub fn get_version(&self) -> &str {\n\n &self.version\n\n }\n\n}\n","file_path":"src/mcu.rs","rank":13,"score":20920.064908222997},{"content":"use std::error::Error;\n\nuse std::path::Path;\n\n\n\nuse serde_derive::Deserialize;\n\n\n\nuse crate::utils::load_file;\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"PascalCase\")]\n\npub struct Families {\n\n #[serde(rename = \"Family\")]\n\n families: Vec<Family>,\n\n}\n\n\n\n/// A MCU family (e.g. \"STM32F0\" or \"STM32L3\").\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"PascalCase\")]\n\npub struct Family {\n\n pub name: String,\n\n #[serde(rename = \"SubFamily\")]\n","file_path":"src/family.rs","rank":14,"score":20532.15338937752},{"content":"#[serde(rename_all = \"PascalCase\")]\n\npub struct Mcu {\n\n pub name: String,\n\n pub package_name: String,\n\n pub ref_name: String,\n\n #[serde(rename = \"Flash\")]\n\n pub flash_size: String,\n\n #[serde(rename = \"Ram\")]\n\n pub ram_size: String,\n\n}\n\n\n\nimpl Mcu {\n\n pub fn flash_size(&self) -> Option<u32> {\n\n self.flash_size.parse().ok()\n\n }\n\n\n\n pub fn ram_size(&self) -> Option<u32> {\n\n self.ram_size.parse().ok()\n\n }\n\n}\n","file_path":"src/family.rs","rank":15,"score":20531.987001778067},{"content":" sub_families: Vec<SubFamily>,\n\n}\n\n\n\n/// A MCU subfamily (e.g. \"STM32F0x0 Value Line\").\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"PascalCase\")]\n\npub struct SubFamily {\n\n pub name: String,\n\n #[serde(rename = \"Mcu\")]\n\n pub mcus: Vec<Mcu>,\n\n}\n\n\n\n/// A MCU (e.g. STM32L071KBTx).\n\n///\n\n/// Note that multiple MCUs (with unique `ref_name`) share a common name. For\n\n/// example:\n\n///\n\n/// - `<Mcu Name=\"STM32L071K(B-Z)Tx\" PackageName=\"LQFP32\" RefName=\"STM32L071KBTx\" RPN=\"STM32L071KB\">`\n\n/// - `<Mcu Name=\"STM32L071K(B-Z)Tx\" PackageName=\"LQFP32\" RefName=\"STM32L071KZTx\" RPN=\"STM32L071KZ\">`\n\n///\n","file_path":"src/family.rs","rank":16,"score":20528.822593878693},{"content":"\n\nimpl Families {\n\n pub fn load<P: AsRef<Path>>(db_dir: P) -> Result<Self, Box<dyn Error>> {\n\n load_file(db_dir, \"families.xml\")\n\n }\n\n}\n\n\n\nimpl<'a> IntoIterator for &'a Families {\n\n type Item = &'a Family;\n\n type IntoIter = std::slice::Iter<'a, Family>;\n\n\n\n fn into_iter(self) -> <Self as IntoIterator>::IntoIter {\n\n self.families.iter()\n\n }\n\n}\n\n\n\nimpl<'a> IntoIterator for &'a Family {\n\n type Item = &'a SubFamily;\n\n type IntoIter = std::slice::Iter<'a, SubFamily>;\n\n\n","file_path":"src/family.rs","rank":17,"score":20528.689295711083},{"content":" fn into_iter(self) -> <Self as IntoIterator>::IntoIter {\n\n self.sub_families.iter()\n\n }\n\n}\n\n\n\nimpl<'a> IntoIterator for &'a SubFamily {\n\n type Item = &'a Mcu;\n\n type IntoIter = std::slice::Iter<'a, Mcu>;\n\n\n\n fn into_iter(self) -> <Self as IntoIterator>::IntoIter {\n\n self.mcus.iter()\n\n }\n\n}\n","file_path":"src/family.rs","rank":18,"score":20526.136094209854},{"content":"/// Both MCUs share the same name, but the ref name is different.\n\n///\n\n/// The meaning of the name, using the `STM32L071KBTx` as an example:\n\n///\n\n/// |Part |Meaning |\n\n/// |-----|--------|\n\n/// |STM32|Family |\n\n/// | L |Type |\n\n/// | 0 |Core |\n\n/// | 71 |Line |\n\n/// | K |Pincount|\n\n/// | B |Flash |\n\n/// | T |Package |\n\n/// | x |Temp |\n\n/// |-----|--------|\n\n///\n\n/// See https://ziutek.github.io/2018/05/07/stm32_naming_scheme.html for more details.\n\n///\n\n/// Note that sometimes there are exceptions from this naming rule.\n\n#[derive(Debug, Deserialize)]\n","file_path":"src/family.rs","rank":19,"score":20525.779814903995},{"content":"\n\nlazy_static! {\n\n static ref USART_RX: Regex = Regex::new(\"(LP)?US?ART._RX\").unwrap();\n\n static ref USART_TX: Regex = Regex::new(\"(LP)?US?ART._TX\").unwrap();\n\n static ref SPI_MOSI: Regex = Regex::new(\"SPI._MOSI\").unwrap();\n\n static ref SPI_MISO: Regex = Regex::new(\"SPI._MISO\").unwrap();\n\n static ref SPI_SCK: Regex = Regex::new(\"SPI._SCK\").unwrap();\n\n static ref I2C_SCL: Regex = Regex::new(\"I2C._SCL\").unwrap();\n\n static ref I2C_SDA: Regex = Regex::new(\"I2C._SDA\").unwrap();\n\n}\n\n\n\nimpl GPIOPin {\n\n pub fn get_name(&self) -> Option<String> {\n\n let gpio_pin = self\n\n .specific_parameter\n\n .iter()\n\n .find(|v| v.name == \"GPIO_Pin\");\n\n match gpio_pin {\n\n Some(v) => {\n\n let num = v.possible_value.val.split('_').collect::<Vec<_>>()[2];\n","file_path":"src/internal_peripheral.rs","rank":36,"score":11.702323036921413},{"content":"# Cube Parser\n\n\n\n[![Build Status][github-actions-badge]][github-actions]\n\n\n\nA program to extract hardware configuration information from the MCU database\n\nfiles shipped with STM32CubeMX.\n\n\n\n\n\n## Usage\n\n\n\n cargo run features STM32L0 -d /path/to/stm32cubemx/db/mcu/\n\n cargo run pin_mappings STM32L0 -d /path/to/stm32cubemx/db/mcu/\n\n\n\nUnder a default Windows install, the database path is `C:\\Program Files\n\n(x86)\\STMicroelectronics\\STM32Cube\\STM32CubeMX\\db\\mcu`, adjust as appropriate\n\nfor your local config. The MCU family name should match one of the MCU families\n\nas defined in `families.xml`. At the time of writing, the following families\n\nare available:\n\n\n\n* STM32F0\n\n* STM32F1\n\n* STM32F2\n\n* STM32F3\n\n* STM32F4\n\n* STM32F7\n\n* STM32G0\n\n* STM32G4\n\n* STM32H7\n\n* STM32L0\n\n* STM32L1\n\n* STM32L4\n\n* STM32L4+\n\n* STM32L5\n\n* STM32MP1\n\n* STM32WB\n\n\n\n\n\n## The STM32CubeMX Database\n\n\n\nThe STM32CubeMX database contains the following files that are relevant to us:\n\n\n\n### Families\n\n\n\nIn the root, there is a file called `families.xml`. It contains all MCUs\n\ngrouped by family (e.g. \"STM32F0\") and subfamily (e.g. \"STM32F0x0 Value Line\").\n\n\n\n```xml\n\n<Families xsi:noNamespaceSchemaLocation=\"families.xsd\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\">\n\n <Family Name=\"STM32F0\">\n\n <SubFamily Name=\"STM32F0x0 Value Line\">\n\n <Mcu Name=\"STM32F030C6Tx\" PackageName=\"LQFP48\" RefName=\"STM32F030C6Tx\" RPN=\"STM32F030C6\">\n\n <Core>Arm Cortex-M0</Core>\n\n <Frequency>48</Frequency>\n\n <Ram>4</Ram>\n\n ...\n\n </Mcu>\n\n <Mcu Name=\"STM32F030C8Tx\" PackageName=\"LQFP48\" RefName=\"STM32F030C8Tx\" RPN=\"STM32F030C8\">\n\n ...\n\n```\n\n\n","file_path":"README.md","rank":37,"score":11.513922570500776},{"content":"#[serde(rename = \"GPIO_Pin\", rename_all = \"PascalCase\")]\n\npub struct GPIOPin {\n\n port_name: String,\n\n name: String,\n\n specific_parameter: Vec<SpecificParameter>,\n\n pin_signal: Option<Vec<PinSignal>>,\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename = \"IP\")]\n\npub struct IpGPIO {\n\n #[serde(rename = \"GPIO_Pin\")]\n\n pub(crate) gpio_pin: Vec<GPIOPin>,\n\n}\n\n\n\nimpl IpGPIO {\n\n pub fn load<P: AsRef<Path>>(db_dir: P, version: &str) -> Result<Self, Box<dyn Error>> {\n\n load_file(db_dir, format!(\"IP/GPIO-{}_Modes.xml\", version))\n\n }\n\n}\n","file_path":"src/internal_peripheral.rs","rank":38,"score":11.445490020880955},{"content":"use std::error::Error;\n\nuse std::path::Path;\n\n\n\nuse lazy_static::lazy_static;\n\nuse regex::Regex;\n\nuse serde_derive::Deserialize;\n\n\n\nuse crate::utils::load_file;\n\n\n\n#[derive(Debug, Deserialize)]\n\npub(crate) struct PossibleValue {\n\n #[serde(rename = \"$value\")]\n\n pub(crate) val: String,\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"PascalCase\")]\n\npub struct SpecificParameter {\n\n name: String,\n\n possible_value: PossibleValue,\n","file_path":"src/internal_peripheral.rs","rank":39,"score":11.224633114431713},{"content":"### GPIO Internal Peripheral\n\n\n\nThe GPIO IP can be found in the `IP` directory. The relevant file for us is at\n\n`IP/GPIO-<version>_Modes.xml`. The version can be extracted from the `IP`\n\nelement shown in the previous section.\n\n\n\nIn the case of the `STM32L071KBTx`, the relevant GPIO IP version file is at\n\n`IP/GPIO-STM32L071_gpio_v1_0_Modes.xml`.\n\n\n\nThat file starts out with some `RefParameter` and `RefMode` elements. Relevant\n\nto us are mostly the `GPIO_Pin` elements. They look like this:\n\n\n\n```xml\n\n<GPIO_Pin PortName=\"PB\" Name=\"PB6\">\n\n <SpecificParameter Name=\"GPIO_Pin\">\n\n <PossibleValue>GPIO_PIN_6</PossibleValue>\n\n </SpecificParameter>\n\n <PinSignal Name=\"I2C1_SCL\">\n\n <SpecificParameter Name=\"GPIO_AF\">\n\n <PossibleValue>GPIO_AF1_I2C1</PossibleValue>\n\n </SpecificParameter>\n\n </PinSignal>\n\n <PinSignal Name=\"LPTIM1_ETR\">\n\n <SpecificParameter Name=\"GPIO_AF\">\n\n <PossibleValue>GPIO_AF2_LPTIM1</PossibleValue>\n\n </SpecificParameter>\n\n </PinSignal>\n\n <PinSignal Name=\"TSC_G5_IO3\">\n\n <SpecificParameter Name=\"GPIO_AF\">\n\n <PossibleValue>GPIO_AF3_TSC</PossibleValue>\n\n </SpecificParameter>\n\n </PinSignal>\n\n <PinSignal Name=\"USART1_TX\">\n\n <SpecificParameter Name=\"GPIO_AF\">\n\n <PossibleValue>GPIO_AF0_USART1</PossibleValue>\n\n </SpecificParameter>\n\n </PinSignal>\n\n</GPIO_Pin>\n\n```\n\n\n\nAs you can see, this element describes the pin `PB6`. Depending on the chosen\n\nAlternative Function (AF), it can become an `I2C1_SCL` pin (AF1), a `USART1_TX`\n\npin (AF0), or some other variants.\n\n\n\n\n","file_path":"README.md","rank":40,"score":10.488742724816301},{"content":" Some(format!(\"{}{}\", &self.port_name, num))\n\n }\n\n None => None,\n\n }\n\n }\n\n\n\n pub fn get_af_modes(&self) -> Vec<String> {\n\n let mut res = Vec::new();\n\n if let Some(ref v) = self.pin_signal {\n\n for sig in v {\n\n let per = sig.name.split('_').collect::<Vec<_>>()[0];\n\n if USART_RX.is_match(&sig.name) {\n\n res.push(format!(\"{}: RxPin<{}>\", sig.get_af_value(), per));\n\n }\n\n if USART_TX.is_match(&sig.name) {\n\n res.push(format!(\"{}: TxPin<{}>\", sig.get_af_value(), per));\n\n }\n\n if SPI_MOSI.is_match(&sig.name) {\n\n res.push(format!(\"{}: MosiPin<{}>\", sig.get_af_value(), per));\n\n }\n","file_path":"src/internal_peripheral.rs","rank":41,"score":10.073777299161456},{"content":"### MCU\n\n\n\nNext to the `families.xml` file, there are a lot of MCU definitions. The\n\nfilenames match the `Name` attribute in the `Mcu` element above.\n\n\n\nFor example, the `STM32L071KB(B-Z)Tx.xml` file starts like this:\n\n\n\n```xml\n\n<Mcu ClockTree=\"STM32L0\" DBVersion=\"V3.0\" Family=\"STM32L0\" HasPowerPad=\"false\"\n\n IOType=\"\" Line=\"STM32L0x1\" Package=\"LQFP32\" RefName=\"STM32L071K(B-Z)Tx\"\n\n xmlns=\"http://mcd.rou.st.com/modules.php?name=mcu\">\n\n\t<Core>Arm Cortex-M0+</Core>\n\n\t<Frequency>32</Frequency>\n\n\t<E2prom>6144</E2prom>\n\n\t<Ram>20</Ram>\n\n\t<IONb>25</IONb>\n\n\t<Die>DIE447</Die>\n\n\t<Flash>128</Flash>\n\n\t<Flash>192</Flash>\n\n\t<Voltage Max=\"3.6\" Min=\"1.65\"/>\n\n\t<Current Lowest=\"0.29\" Run=\"87\"/>\n\n\t<Temperature Max=\"125\" Min=\"-40\"/>\n\n ...\n\n```\n\n\n\nThis first part describes the MCU: How much RAM it has, what the frequency is,\n\nhow many I/Os it has, what flash variants there are, etc. Many of these things\n\nare also encoded in the full MCU `RefName`.\n\n\n\nFollowing this general description, there are a number of `IP` elements. IP\n\nstands for \"Internal Peripheral\". Here we have things like the USART peripherals:\n\n\n\n```xml\n\n<IP InstanceName=\"USART1\" Name=\"USART\" Version=\"sci3_v1_1_Cube\"/>\n\n<IP InstanceName=\"USART2\" Name=\"USART\" Version=\"sci3_v1_1_Cube\"/>\n\n```\n\n\n\n...or the RCC peripheral:\n\n\n\n```xml\n\n<IP InstanceName=\"RCC\" Name=\"RCC\" Version=\"STM32L051_rcc_v1_0\"/>\n\n```\n\n\n\n...and, most important to us, the GPIO peripheral.\n\n\n\n```xml\n\n<IP ConfigFile=\"GPIO-STM32L0xx\" InstanceName=\"GPIO\" Name=\"GPIO\" Version=\"STM32L071_gpio_v1_0\"/>\n\n```\n\n\n\nHere, the value of the `Version` attribute points to the actual GPIO signal\n\ndefinition.\n\n\n\n(There are also some other interesting entries in that file, for example the\n\nmapping from physical pins to internal pin names. Those are not relevant for us\n\nthough.)\n\n\n","file_path":"README.md","rank":42,"score":9.294614568310474},{"content":" if SPI_MISO.is_match(&sig.name) {\n\n res.push(format!(\"{}: MisoPin<{}>\", sig.get_af_value(), per));\n\n }\n\n if SPI_SCK.is_match(&sig.name) {\n\n res.push(format!(\"{}: SckPin<{}>\", sig.get_af_value(), per));\n\n }\n\n if I2C_SCL.is_match(&sig.name) {\n\n res.push(format!(\"{}: SclPin<{}>\", sig.get_af_value(), per));\n\n }\n\n if I2C_SDA.is_match(&sig.name) {\n\n res.push(format!(\"{}: SdaPin<{}>\", sig.get_af_value(), per));\n\n }\n\n }\n\n }\n\n res\n\n }\n\n}\n","file_path":"src/internal_peripheral.rs","rank":43,"score":7.260907694552924},{"content":"}\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"PascalCase\")]\n\npub struct PinSignal {\n\n name: String,\n\n specific_parameter: SpecificParameter,\n\n}\n\n\n\nimpl PinSignal {\n\n fn get_af_value(&self) -> &str {\n\n self.specific_parameter\n\n .possible_value\n\n .val\n\n .split('_')\n\n .collect::<Vec<_>>()[1]\n\n }\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n","file_path":"src/internal_peripheral.rs","rank":44,"score":7.073337782884597},{"content":"## GPIO Feature Groups\n\n\n\nWhen generating pin function mappings, we want to avoid generating a mapping\n\nfor every possible MCU, since that would result in dozens or even hundreds of\n\npin definitions. However, if we don't want a mapping per MCU, we need to group\n\nthem somehow. The best way for grouping is probably to follow ST's grouping,\n\nwhich is encoded in the IP versions described above.\n\n\n\nThe feature names are mapped as follows:\n\n\n\n- `STM32L031_gpio_v1_0` -> `io-STM32L031`\n\n- `STM32L051_gpio_v1_0` -> `io-STM32L051`\n\n- `STM32L152x8_gpio_v1_0` -> `io-STM32L152x8`\n\n\n\nFor example, the GPIO IP file named \"STM32L031_gpio_v1_0\" is shared among the\n\nfollowing MCUs:\n\n\n\n- STM32L010C6Tx\n\n- STM32L031C(4-6)Tx\n\n- STM32L031C(4-6)Tx\n\n- STM32L031C6Ux\n\n- STM32L031E(4-6)Yx\n\n- STM32L031E(4-6)Yx\n\n- STM32L031F(4-6)Px\n\n- STM32L031F(4-6)Px\n\n- STM32L031G(4-6)Ux\n\n- STM32L031G(4-6)Ux\n\n- STM32L031G6UxS\n\n- STM32L031K(4-6)Tx\n\n- STM32L031K(4-6)Tx\n\n- STM32L031K(4-6)Ux\n\n- STM32L031K(4-6)Ux\n\n- STM32L041C(4-6)Tx\n\n- STM32L041C(4-6)Tx\n\n- STM32L041E6Yx\n\n- STM32L041F6Px\n\n- STM32L041G6Ux\n\n- STM32L041G6UxS\n\n- STM32L041K6Tx\n\n- STM32L041K6Ux\n\n\n\nAs you can see, this may be a bit confusing due to the fact that both the\n\n`STM32L010C6Tx` and the `STM32L041E6Yx` require the `io-STM32L031` feature.\n\nHowever, sticking to the (sometimes non-logical) grouping used in the CubeMX\n\ndatabase is probably still better than creating our own grouping, which may be\n\nbroken at any time by ST releasing a new MCU in a pre-existing group, but with\n\na different, incompatible GPIO IP version.\n\n\n\nIn order to simplify the GPIO IP version selection for the user, alias features\n\nare generated. These are purely a convenience for the user and are never used\n\ndirectly as feature gates in the source code.\n\n\n\n\n\n<!-- Badges -->\n\n[github-actions]: https://github.com/dbrgn/cube-parse/actions?query=branch%3Amaster\n\n[github-actions-badge]: https://github.com/dbrgn/cube-parse/workflows/CI/badge.svg\n","file_path":"README.md","rank":45,"score":6.568527927854404}],"string":"[\n {\n \"content\": \"pub fn load_file<'a, P: AsRef<Path>, Q: AsRef<Path>, R: Deserialize<'a>>(\\n\\n db_dir: P,\\n\\n file_path: Q,\\n\\n) -> Result<R, Box<dyn Error>> {\\n\\n let db_dir = db_dir.as_ref();\\n\\n let mut fin = BufReader::new(File::open(&db_dir.join(file_path.as_ref()))?);\\n\\n\\n\\n Ok(serde_xml_rs::deserialize(&mut fin)?)\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 8,\n \"score\": 56449.948449911426\n },\n {\n \"content\": \"use std::{error::Error, fs::File, io::BufReader, path::Path};\\n\\n\\n\\nuse serde::Deserialize;\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 11,\n \"score\": 21039.490770387103\n },\n {\n \"content\": \"use std::error::Error;\\n\\nuse std::path::Path;\\n\\n\\n\\nuse serde_derive::Deserialize;\\n\\n\\n\\nuse crate::utils::load_file;\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\npub struct Mcu {\\n\\n #[serde(rename = \\\"IP\\\", default)]\\n\\n ip: Vec<IP>,\\n\\n #[serde(rename = \\\"E2prom\\\")]\\n\\n eeprom_size_bytes: String,\\n\\n}\\n\\n\\n\\nimpl Mcu {\\n\\n pub fn load<P: AsRef<Path>>(db_dir: P, mcu_name: &str) -> Result<Self, Box<dyn Error>> {\\n\\n load_file(db_dir, format!(\\\"{}.xml\\\", mcu_name))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/mcu.rs\",\n \"rank\": 12,\n \"score\": 20922.383714628784\n },\n {\n \"content\": \" pub fn get_ip(&self, name: &str) -> Option<&IP> {\\n\\n self.ip.iter().find(|v| v.name == name)\\n\\n }\\n\\n\\n\\n /// Return the EEPROM size in bytes\\n\\n pub fn get_eeprom_size(&self) -> Option<u32> {\\n\\n self.eeprom_size_bytes.parse().ok()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct IP {\\n\\n instance_name: String,\\n\\n name: String,\\n\\n version: String,\\n\\n}\\n\\n\\n\\nimpl IP {\\n\\n pub fn get_version(&self) -> &str {\\n\\n &self.version\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mcu.rs\",\n \"rank\": 13,\n \"score\": 20920.064908222997\n },\n {\n \"content\": \"use std::error::Error;\\n\\nuse std::path::Path;\\n\\n\\n\\nuse serde_derive::Deserialize;\\n\\n\\n\\nuse crate::utils::load_file;\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct Families {\\n\\n #[serde(rename = \\\"Family\\\")]\\n\\n families: Vec<Family>,\\n\\n}\\n\\n\\n\\n/// A MCU family (e.g. \\\"STM32F0\\\" or \\\"STM32L3\\\").\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct Family {\\n\\n pub name: String,\\n\\n #[serde(rename = \\\"SubFamily\\\")]\\n\",\n \"file_path\": \"src/family.rs\",\n \"rank\": 14,\n \"score\": 20532.15338937752\n },\n {\n \"content\": \"#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct Mcu {\\n\\n pub name: String,\\n\\n pub package_name: String,\\n\\n pub ref_name: String,\\n\\n #[serde(rename = \\\"Flash\\\")]\\n\\n pub flash_size: String,\\n\\n #[serde(rename = \\\"Ram\\\")]\\n\\n pub ram_size: String,\\n\\n}\\n\\n\\n\\nimpl Mcu {\\n\\n pub fn flash_size(&self) -> Option<u32> {\\n\\n self.flash_size.parse().ok()\\n\\n }\\n\\n\\n\\n pub fn ram_size(&self) -> Option<u32> {\\n\\n self.ram_size.parse().ok()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/family.rs\",\n \"rank\": 15,\n \"score\": 20531.987001778067\n },\n {\n \"content\": \" sub_families: Vec<SubFamily>,\\n\\n}\\n\\n\\n\\n/// A MCU subfamily (e.g. \\\"STM32F0x0 Value Line\\\").\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct SubFamily {\\n\\n pub name: String,\\n\\n #[serde(rename = \\\"Mcu\\\")]\\n\\n pub mcus: Vec<Mcu>,\\n\\n}\\n\\n\\n\\n/// A MCU (e.g. STM32L071KBTx).\\n\\n///\\n\\n/// Note that multiple MCUs (with unique `ref_name`) share a common name. For\\n\\n/// example:\\n\\n///\\n\\n/// - `<Mcu Name=\\\"STM32L071K(B-Z)Tx\\\" PackageName=\\\"LQFP32\\\" RefName=\\\"STM32L071KBTx\\\" RPN=\\\"STM32L071KB\\\">`\\n\\n/// - `<Mcu Name=\\\"STM32L071K(B-Z)Tx\\\" PackageName=\\\"LQFP32\\\" RefName=\\\"STM32L071KZTx\\\" RPN=\\\"STM32L071KZ\\\">`\\n\\n///\\n\",\n \"file_path\": \"src/family.rs\",\n \"rank\": 16,\n \"score\": 20528.822593878693\n },\n {\n \"content\": \"\\n\\nimpl Families {\\n\\n pub fn load<P: AsRef<Path>>(db_dir: P) -> Result<Self, Box<dyn Error>> {\\n\\n load_file(db_dir, \\\"families.xml\\\")\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> IntoIterator for &'a Families {\\n\\n type Item = &'a Family;\\n\\n type IntoIter = std::slice::Iter<'a, Family>;\\n\\n\\n\\n fn into_iter(self) -> <Self as IntoIterator>::IntoIter {\\n\\n self.families.iter()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> IntoIterator for &'a Family {\\n\\n type Item = &'a SubFamily;\\n\\n type IntoIter = std::slice::Iter<'a, SubFamily>;\\n\\n\\n\",\n \"file_path\": \"src/family.rs\",\n \"rank\": 17,\n \"score\": 20528.689295711083\n },\n {\n \"content\": \" fn into_iter(self) -> <Self as IntoIterator>::IntoIter {\\n\\n self.sub_families.iter()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> IntoIterator for &'a SubFamily {\\n\\n type Item = &'a Mcu;\\n\\n type IntoIter = std::slice::Iter<'a, Mcu>;\\n\\n\\n\\n fn into_iter(self) -> <Self as IntoIterator>::IntoIter {\\n\\n self.mcus.iter()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/family.rs\",\n \"rank\": 18,\n \"score\": 20526.136094209854\n },\n {\n \"content\": \"/// Both MCUs share the same name, but the ref name is different.\\n\\n///\\n\\n/// The meaning of the name, using the `STM32L071KBTx` as an example:\\n\\n///\\n\\n/// |Part |Meaning |\\n\\n/// |-----|--------|\\n\\n/// |STM32|Family |\\n\\n/// | L |Type |\\n\\n/// | 0 |Core |\\n\\n/// | 71 |Line |\\n\\n/// | K |Pincount|\\n\\n/// | B |Flash |\\n\\n/// | T |Package |\\n\\n/// | x |Temp |\\n\\n/// |-----|--------|\\n\\n///\\n\\n/// See https://ziutek.github.io/2018/05/07/stm32_naming_scheme.html for more details.\\n\\n///\\n\\n/// Note that sometimes there are exceptions from this naming rule.\\n\\n#[derive(Debug, Deserialize)]\\n\",\n \"file_path\": \"src/family.rs\",\n \"rank\": 19,\n \"score\": 20525.779814903995\n },\n {\n \"content\": \"\\n\\nlazy_static! {\\n\\n static ref USART_RX: Regex = Regex::new(\\\"(LP)?US?ART._RX\\\").unwrap();\\n\\n static ref USART_TX: Regex = Regex::new(\\\"(LP)?US?ART._TX\\\").unwrap();\\n\\n static ref SPI_MOSI: Regex = Regex::new(\\\"SPI._MOSI\\\").unwrap();\\n\\n static ref SPI_MISO: Regex = Regex::new(\\\"SPI._MISO\\\").unwrap();\\n\\n static ref SPI_SCK: Regex = Regex::new(\\\"SPI._SCK\\\").unwrap();\\n\\n static ref I2C_SCL: Regex = Regex::new(\\\"I2C._SCL\\\").unwrap();\\n\\n static ref I2C_SDA: Regex = Regex::new(\\\"I2C._SDA\\\").unwrap();\\n\\n}\\n\\n\\n\\nimpl GPIOPin {\\n\\n pub fn get_name(&self) -> Option<String> {\\n\\n let gpio_pin = self\\n\\n .specific_parameter\\n\\n .iter()\\n\\n .find(|v| v.name == \\\"GPIO_Pin\\\");\\n\\n match gpio_pin {\\n\\n Some(v) => {\\n\\n let num = v.possible_value.val.split('_').collect::<Vec<_>>()[2];\\n\",\n \"file_path\": \"src/internal_peripheral.rs\",\n \"rank\": 36,\n \"score\": 11.702323036921413\n },\n {\n \"content\": \"# Cube Parser\\n\\n\\n\\n[![Build Status][github-actions-badge]][github-actions]\\n\\n\\n\\nA program to extract hardware configuration information from the MCU database\\n\\nfiles shipped with STM32CubeMX.\\n\\n\\n\\n\\n\\n## Usage\\n\\n\\n\\n cargo run features STM32L0 -d /path/to/stm32cubemx/db/mcu/\\n\\n cargo run pin_mappings STM32L0 -d /path/to/stm32cubemx/db/mcu/\\n\\n\\n\\nUnder a default Windows install, the database path is `C:\\\\Program Files\\n\\n(x86)\\\\STMicroelectronics\\\\STM32Cube\\\\STM32CubeMX\\\\db\\\\mcu`, adjust as appropriate\\n\\nfor your local config. The MCU family name should match one of the MCU families\\n\\nas defined in `families.xml`. At the time of writing, the following families\\n\\nare available:\\n\\n\\n\\n* STM32F0\\n\\n* STM32F1\\n\\n* STM32F2\\n\\n* STM32F3\\n\\n* STM32F4\\n\\n* STM32F7\\n\\n* STM32G0\\n\\n* STM32G4\\n\\n* STM32H7\\n\\n* STM32L0\\n\\n* STM32L1\\n\\n* STM32L4\\n\\n* STM32L4+\\n\\n* STM32L5\\n\\n* STM32MP1\\n\\n* STM32WB\\n\\n\\n\\n\\n\\n## The STM32CubeMX Database\\n\\n\\n\\nThe STM32CubeMX database contains the following files that are relevant to us:\\n\\n\\n\\n### Families\\n\\n\\n\\nIn the root, there is a file called `families.xml`. It contains all MCUs\\n\\ngrouped by family (e.g. \\\"STM32F0\\\") and subfamily (e.g. \\\"STM32F0x0 Value Line\\\").\\n\\n\\n\\n```xml\\n\\n<Families xsi:noNamespaceSchemaLocation=\\\"families.xsd\\\" xmlns:xsi=\\\"http://www.w3.org/2001/XMLSchema-instance\\\">\\n\\n <Family Name=\\\"STM32F0\\\">\\n\\n <SubFamily Name=\\\"STM32F0x0 Value Line\\\">\\n\\n <Mcu Name=\\\"STM32F030C6Tx\\\" PackageName=\\\"LQFP48\\\" RefName=\\\"STM32F030C6Tx\\\" RPN=\\\"STM32F030C6\\\">\\n\\n <Core>Arm Cortex-M0</Core>\\n\\n <Frequency>48</Frequency>\\n\\n <Ram>4</Ram>\\n\\n ...\\n\\n </Mcu>\\n\\n <Mcu Name=\\\"STM32F030C8Tx\\\" PackageName=\\\"LQFP48\\\" RefName=\\\"STM32F030C8Tx\\\" RPN=\\\"STM32F030C8\\\">\\n\\n ...\\n\\n```\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 37,\n \"score\": 11.513922570500776\n },\n {\n \"content\": \"#[serde(rename = \\\"GPIO_Pin\\\", rename_all = \\\"PascalCase\\\")]\\n\\npub struct GPIOPin {\\n\\n port_name: String,\\n\\n name: String,\\n\\n specific_parameter: Vec<SpecificParameter>,\\n\\n pin_signal: Option<Vec<PinSignal>>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename = \\\"IP\\\")]\\n\\npub struct IpGPIO {\\n\\n #[serde(rename = \\\"GPIO_Pin\\\")]\\n\\n pub(crate) gpio_pin: Vec<GPIOPin>,\\n\\n}\\n\\n\\n\\nimpl IpGPIO {\\n\\n pub fn load<P: AsRef<Path>>(db_dir: P, version: &str) -> Result<Self, Box<dyn Error>> {\\n\\n load_file(db_dir, format!(\\\"IP/GPIO-{}_Modes.xml\\\", version))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/internal_peripheral.rs\",\n \"rank\": 38,\n \"score\": 11.445490020880955\n },\n {\n \"content\": \"use std::error::Error;\\n\\nuse std::path::Path;\\n\\n\\n\\nuse lazy_static::lazy_static;\\n\\nuse regex::Regex;\\n\\nuse serde_derive::Deserialize;\\n\\n\\n\\nuse crate::utils::load_file;\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\npub(crate) struct PossibleValue {\\n\\n #[serde(rename = \\\"$value\\\")]\\n\\n pub(crate) val: String,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct SpecificParameter {\\n\\n name: String,\\n\\n possible_value: PossibleValue,\\n\",\n \"file_path\": \"src/internal_peripheral.rs\",\n \"rank\": 39,\n \"score\": 11.224633114431713\n },\n {\n \"content\": \"### GPIO Internal Peripheral\\n\\n\\n\\nThe GPIO IP can be found in the `IP` directory. The relevant file for us is at\\n\\n`IP/GPIO-<version>_Modes.xml`. The version can be extracted from the `IP`\\n\\nelement shown in the previous section.\\n\\n\\n\\nIn the case of the `STM32L071KBTx`, the relevant GPIO IP version file is at\\n\\n`IP/GPIO-STM32L071_gpio_v1_0_Modes.xml`.\\n\\n\\n\\nThat file starts out with some `RefParameter` and `RefMode` elements. Relevant\\n\\nto us are mostly the `GPIO_Pin` elements. They look like this:\\n\\n\\n\\n```xml\\n\\n<GPIO_Pin PortName=\\\"PB\\\" Name=\\\"PB6\\\">\\n\\n <SpecificParameter Name=\\\"GPIO_Pin\\\">\\n\\n <PossibleValue>GPIO_PIN_6</PossibleValue>\\n\\n </SpecificParameter>\\n\\n <PinSignal Name=\\\"I2C1_SCL\\\">\\n\\n <SpecificParameter Name=\\\"GPIO_AF\\\">\\n\\n <PossibleValue>GPIO_AF1_I2C1</PossibleValue>\\n\\n </SpecificParameter>\\n\\n </PinSignal>\\n\\n <PinSignal Name=\\\"LPTIM1_ETR\\\">\\n\\n <SpecificParameter Name=\\\"GPIO_AF\\\">\\n\\n <PossibleValue>GPIO_AF2_LPTIM1</PossibleValue>\\n\\n </SpecificParameter>\\n\\n </PinSignal>\\n\\n <PinSignal Name=\\\"TSC_G5_IO3\\\">\\n\\n <SpecificParameter Name=\\\"GPIO_AF\\\">\\n\\n <PossibleValue>GPIO_AF3_TSC</PossibleValue>\\n\\n </SpecificParameter>\\n\\n </PinSignal>\\n\\n <PinSignal Name=\\\"USART1_TX\\\">\\n\\n <SpecificParameter Name=\\\"GPIO_AF\\\">\\n\\n <PossibleValue>GPIO_AF0_USART1</PossibleValue>\\n\\n </SpecificParameter>\\n\\n </PinSignal>\\n\\n</GPIO_Pin>\\n\\n```\\n\\n\\n\\nAs you can see, this element describes the pin `PB6`. Depending on the chosen\\n\\nAlternative Function (AF), it can become an `I2C1_SCL` pin (AF1), a `USART1_TX`\\n\\npin (AF0), or some other variants.\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 40,\n \"score\": 10.488742724816301\n },\n {\n \"content\": \" Some(format!(\\\"{}{}\\\", &self.port_name, num))\\n\\n }\\n\\n None => None,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_af_modes(&self) -> Vec<String> {\\n\\n let mut res = Vec::new();\\n\\n if let Some(ref v) = self.pin_signal {\\n\\n for sig in v {\\n\\n let per = sig.name.split('_').collect::<Vec<_>>()[0];\\n\\n if USART_RX.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: RxPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\\n if USART_TX.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: TxPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\\n if SPI_MOSI.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: MosiPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\",\n \"file_path\": \"src/internal_peripheral.rs\",\n \"rank\": 41,\n \"score\": 10.073777299161456\n },\n {\n \"content\": \"### MCU\\n\\n\\n\\nNext to the `families.xml` file, there are a lot of MCU definitions. The\\n\\nfilenames match the `Name` attribute in the `Mcu` element above.\\n\\n\\n\\nFor example, the `STM32L071KB(B-Z)Tx.xml` file starts like this:\\n\\n\\n\\n```xml\\n\\n<Mcu ClockTree=\\\"STM32L0\\\" DBVersion=\\\"V3.0\\\" Family=\\\"STM32L0\\\" HasPowerPad=\\\"false\\\"\\n\\n IOType=\\\"\\\" Line=\\\"STM32L0x1\\\" Package=\\\"LQFP32\\\" RefName=\\\"STM32L071K(B-Z)Tx\\\"\\n\\n xmlns=\\\"http://mcd.rou.st.com/modules.php?name=mcu\\\">\\n\\n\\t<Core>Arm Cortex-M0+</Core>\\n\\n\\t<Frequency>32</Frequency>\\n\\n\\t<E2prom>6144</E2prom>\\n\\n\\t<Ram>20</Ram>\\n\\n\\t<IONb>25</IONb>\\n\\n\\t<Die>DIE447</Die>\\n\\n\\t<Flash>128</Flash>\\n\\n\\t<Flash>192</Flash>\\n\\n\\t<Voltage Max=\\\"3.6\\\" Min=\\\"1.65\\\"/>\\n\\n\\t<Current Lowest=\\\"0.29\\\" Run=\\\"87\\\"/>\\n\\n\\t<Temperature Max=\\\"125\\\" Min=\\\"-40\\\"/>\\n\\n ...\\n\\n```\\n\\n\\n\\nThis first part describes the MCU: How much RAM it has, what the frequency is,\\n\\nhow many I/Os it has, what flash variants there are, etc. Many of these things\\n\\nare also encoded in the full MCU `RefName`.\\n\\n\\n\\nFollowing this general description, there are a number of `IP` elements. IP\\n\\nstands for \\\"Internal Peripheral\\\". Here we have things like the USART peripherals:\\n\\n\\n\\n```xml\\n\\n<IP InstanceName=\\\"USART1\\\" Name=\\\"USART\\\" Version=\\\"sci3_v1_1_Cube\\\"/>\\n\\n<IP InstanceName=\\\"USART2\\\" Name=\\\"USART\\\" Version=\\\"sci3_v1_1_Cube\\\"/>\\n\\n```\\n\\n\\n\\n...or the RCC peripheral:\\n\\n\\n\\n```xml\\n\\n<IP InstanceName=\\\"RCC\\\" Name=\\\"RCC\\\" Version=\\\"STM32L051_rcc_v1_0\\\"/>\\n\\n```\\n\\n\\n\\n...and, most important to us, the GPIO peripheral.\\n\\n\\n\\n```xml\\n\\n<IP ConfigFile=\\\"GPIO-STM32L0xx\\\" InstanceName=\\\"GPIO\\\" Name=\\\"GPIO\\\" Version=\\\"STM32L071_gpio_v1_0\\\"/>\\n\\n```\\n\\n\\n\\nHere, the value of the `Version` attribute points to the actual GPIO signal\\n\\ndefinition.\\n\\n\\n\\n(There are also some other interesting entries in that file, for example the\\n\\nmapping from physical pins to internal pin names. Those are not relevant for us\\n\\nthough.)\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 42,\n \"score\": 9.294614568310474\n },\n {\n \"content\": \" if SPI_MISO.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: MisoPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\\n if SPI_SCK.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: SckPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\\n if I2C_SCL.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: SclPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\\n if I2C_SDA.is_match(&sig.name) {\\n\\n res.push(format!(\\\"{}: SdaPin<{}>\\\", sig.get_af_value(), per));\\n\\n }\\n\\n }\\n\\n }\\n\\n res\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/internal_peripheral.rs\",\n \"rank\": 43,\n \"score\": 7.260907694552924\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"PascalCase\\\")]\\n\\npub struct PinSignal {\\n\\n name: String,\\n\\n specific_parameter: SpecificParameter,\\n\\n}\\n\\n\\n\\nimpl PinSignal {\\n\\n fn get_af_value(&self) -> &str {\\n\\n self.specific_parameter\\n\\n .possible_value\\n\\n .val\\n\\n .split('_')\\n\\n .collect::<Vec<_>>()[1]\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\",\n \"file_path\": \"src/internal_peripheral.rs\",\n \"rank\": 44,\n \"score\": 7.073337782884597\n },\n {\n \"content\": \"## GPIO Feature Groups\\n\\n\\n\\nWhen generating pin function mappings, we want to avoid generating a mapping\\n\\nfor every possible MCU, since that would result in dozens or even hundreds of\\n\\npin definitions. However, if we don't want a mapping per MCU, we need to group\\n\\nthem somehow. The best way for grouping is probably to follow ST's grouping,\\n\\nwhich is encoded in the IP versions described above.\\n\\n\\n\\nThe feature names are mapped as follows:\\n\\n\\n\\n- `STM32L031_gpio_v1_0` -> `io-STM32L031`\\n\\n- `STM32L051_gpio_v1_0` -> `io-STM32L051`\\n\\n- `STM32L152x8_gpio_v1_0` -> `io-STM32L152x8`\\n\\n\\n\\nFor example, the GPIO IP file named \\\"STM32L031_gpio_v1_0\\\" is shared among the\\n\\nfollowing MCUs:\\n\\n\\n\\n- STM32L010C6Tx\\n\\n- STM32L031C(4-6)Tx\\n\\n- STM32L031C(4-6)Tx\\n\\n- STM32L031C6Ux\\n\\n- STM32L031E(4-6)Yx\\n\\n- STM32L031E(4-6)Yx\\n\\n- STM32L031F(4-6)Px\\n\\n- STM32L031F(4-6)Px\\n\\n- STM32L031G(4-6)Ux\\n\\n- STM32L031G(4-6)Ux\\n\\n- STM32L031G6UxS\\n\\n- STM32L031K(4-6)Tx\\n\\n- STM32L031K(4-6)Tx\\n\\n- STM32L031K(4-6)Ux\\n\\n- STM32L031K(4-6)Ux\\n\\n- STM32L041C(4-6)Tx\\n\\n- STM32L041C(4-6)Tx\\n\\n- STM32L041E6Yx\\n\\n- STM32L041F6Px\\n\\n- STM32L041G6Ux\\n\\n- STM32L041G6UxS\\n\\n- STM32L041K6Tx\\n\\n- STM32L041K6Ux\\n\\n\\n\\nAs you can see, this may be a bit confusing due to the fact that both the\\n\\n`STM32L010C6Tx` and the `STM32L041E6Yx` require the `io-STM32L031` feature.\\n\\nHowever, sticking to the (sometimes non-logical) grouping used in the CubeMX\\n\\ndatabase is probably still better than creating our own grouping, which may be\\n\\nbroken at any time by ST releasing a new MCU in a pre-existing group, but with\\n\\na different, incompatible GPIO IP version.\\n\\n\\n\\nIn order to simplify the GPIO IP version selection for the user, alias features\\n\\nare generated. These are purely a convenience for the user and are never used\\n\\ndirectly as feature gates in the source code.\\n\\n\\n\\n\\n\\n<!-- Badges -->\\n\\n[github-actions]: https://github.com/dbrgn/cube-parse/actions?query=branch%3Amaster\\n\\n[github-actions-badge]: https://github.com/dbrgn/cube-parse/workflows/CI/badge.svg\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 45,\n \"score\": 6.568527927854404\n }\n]","isConversational":false}}},{"rowIdx":1173,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"grid/src/lib.rs"},"repo_name":{"kind":"string","value":"Daniel-del-Castillo/ia1"},"commit":{"kind":"string","value":"c11d768af415a8d117152b954cb9cf25bce48631"},"file_code":{"kind":"string","value":"use crossterm::style::Colorize;\nuse std::fmt;\nmod content;\nmod path_finding;\nuse content::Content;\nuse rand::{thread_rng, Rng};\n\npub struct Grid {\n grid: Vec<Vec<Content>>,\n goal: Option<(usize, usize)>,\n car: Option<(usize, usize)>,\n}\n\nimpl fmt::Display for Grid {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n for _ in 0..self.grid[0].len() + 2 {\n write!(f, \"{}\", \" \".on_dark_blue())?;\n }\n write!(f, \"\\n\\r\")?;\n for row in self.grid.iter() {\n write!(f, \"{}\", \" \".on_dark_blue())?;\n for cell in row.iter() {\n write!(f, \"{}\", cell)?\n }\n write!(f, \"{}\", \" \\n\\r\".on_dark_blue())?;\n }\n for _ in 0..self.grid[0].len() + 2 {\n write!(f, \"{}\", \" \".on_dark_blue())?;\n }\n write!(f, \"\\n\\r\")?;\n Ok(())\n }\n}\n\nimpl Grid {\n pub fn new(m: usize, n: usize) -> Self {\n assert!(m != 0 && n != 0);\n Grid {\n grid: vec![vec![Content::Empty; n]; m],\n goal: None,\n car: None,\n }\n }\n\n pub fn m(&self) -> usize {\n self.grid.len()\n }\n\n pub fn n(&self) -> usize {\n self.grid[0].len()\n }\n\n pub fn has_goal(&self) -> bool {\n match self.goal {\n None => false,\n Some(_) => true,\n }\n }\n\n pub fn has_car(&self) -> bool {\n match self.car {\n None => false,\n Some(_) => true,\n }\n }\n\n pub fn set_width(&mut self, n: usize) {\n assert!(n != 0);\n let width = self.grid[0].len();\n if n == width {\n return;\n } else if n < width {\n self.grid.iter_mut().for_each(|row| row.truncate(n));\n self.check_car_valididy();\n self.check_goal_valididy();\n } else {\n self.grid\n .iter_mut()\n .for_each(|row| (0..n - width).for_each(|_| row.push(Content::Empty)));\n }\n }\n\n pub fn set_height(&mut self, m: usize) {\n assert!(m != 0);\n let height = self.grid.len();\n if m == height {\n return;\n } else if m < height {\n self.grid.truncate(m);\n self.check_car_valididy();\n self.check_goal_valididy();\n } else {\n let width = self.grid[0].len();\n (0..m - height).for_each(|_| self.grid.push(vec![Content::Empty; width]));\n }\n }\n\n pub fn set_wall(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Car => self.car = None,\n Content::Goal => self.goal = None,\n _ => {}\n }\n self.grid[y][x] = Content::Wall;\n }\n\n pub fn set_goal(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Car => self.car = None,\n Content::Goal => return,\n _ => {}\n }\n self.grid[y][x] = Content::Goal;\n if let Some(old_goal_pos) = &mut self.goal {\n self.grid[old_goal_pos.1][old_goal_pos.0] = Content::Empty;\n }\n self.goal = Some((x, y));\n }\n\n pub fn set_car(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Goal => self.goal = None,\n Content::Car => return,\n _ => {}\n }\n self.grid[y][x] = Content::Car;\n if let Some(old_car_pos) = &mut self.car {\n self.grid[old_car_pos.1][old_car_pos.0] = Content::Empty;\n }\n self.car = Some((x, y));\n }\n\n pub fn set_empty(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Goal => self.goal = None,\n Content::Car => self.car = None,\n _ => {}\n }\n self.grid[y][x] = Content::Empty;\n }\n\n pub fn clear(&mut self) {\n self.grid = vec![vec![Content::Empty; self.grid[0].len()]; self.grid.len()];\n }\n\n pub fn fill_random(&mut self, wall_percentage: usize) {\n assert!(wall_percentage <= 100);\n self.car = None;\n self.goal = None;\n self.fill_random_walls(wall_percentage);\n let car_pos = self.get_random_pos();\n self.set_car(car_pos.0, car_pos.1);\n \n if self.m() * self.n() != 1 {\n let goal_pos = loop {\n let pos = self.get_random_pos();\n if pos != car_pos {\n break pos;\n }\n };\n self.set_goal(goal_pos.0, goal_pos.1);\n }\n }\n\n fn fill_random_walls(&mut self, wall_percentage: usize) {\n let mut rng = thread_rng();\n for content in self.grid.iter_mut().map(|i| i.iter_mut()).flatten() {\n if rng.gen_range(1, 101) <= wall_percentage {\n *content = Content::Wall;\n } else {\n *content = Content::Empty;\n }\n }\n }\n\n fn get_random_pos(&mut self) -> (usize, usize) {\n let n_cells = self.m() * self.n();\n let pos = thread_rng().gen_range(0, n_cells);\n let y = pos / self.n();\n let x = pos % self.n();\n (x, y)\n }\n\n fn check_car_valididy(&mut self) {\n if let Some(pos) = self.car {\n if pos.0 >= self.n() || pos.1 >= self.m() {\n self.car = None;\n }\n }\n }\n\n fn check_goal_valididy(&mut self) {\n if let Some(pos) = self.goal {\n if pos.0 >= self.n() || pos.1 >= self.m() {\n self.goal = None;\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use crossterm::style::Colorize;\nuse std::fmt;\nmod content;\nmod path_finding;\nuse content::Content;\nuse rand::{thread_rng, Rng};\n\npub struct Grid {\n grid: Vec<Vec<Content>>,\n goal: Option<(usize, usize)>,\n car: Option<(usize, usize)>,\n}\n\nimpl fmt::Display for Grid {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n for _ in 0..self.grid[0].len() + 2 {\n write!(f, \"{}\", \" \".on_dark_blue())?;\n }\n write!(f, \"\\n\\r\")?;\n for row in self.grid.iter() {\n write!(f, \"{}\", \" \".on_dark_blue())?;\n for cell in row.iter() {\n write!(f, \"{}\", cell)?\n }\n write!(f, \"{}\", \" \\n\\r\".on_dark_blue())?;\n }\n for _ in 0..self.grid[0].len() + 2 {\n write!(f, \"{}\", \" \".on_dark_blue())?;\n }\n write!(f, \"\\n\\r\")?;\n Ok(())\n }\n}\n\nimpl Grid {\n pub fn new(m: usize, n: usize) -> Self {\n assert!(m != 0 && n != 0);\n Grid {\n grid: vec![vec![Content::Empty; n]; m],\n goal: None,\n car: None,\n }\n }\n\n pub fn m(&self) -> usize {\n self.grid.len()\n }\n\n pub fn n(&self) -> usize {\n self.grid[0].len()\n }\n\n pub fn has_goal(&self) -> bool {\n match self.goal {\n None => false,\n Some(_) => true,\n }\n }\n\n pub fn has_car(&self) -> bool {\n match self.car {\n None => false,\n Some(_) => true,\n }\n }\n\n pub fn set_width(&mut self, n: usize) {\n assert!(n != 0);\n let width = self.grid[0].len();\n if n == width {\n return;\n } else if n < width {\n self.grid.iter_mut().for_each(|row| row.truncate(n));\n self.check_car_valididy();\n self.check_goal_valididy();\n } else {\n self.grid\n .iter_mut()\n .for_each(|row| (0..n - width).for_each(|_| row.push(Content::Empty)));\n }\n }\n\n pub fn set_height(&mut self, m: usize) {\n assert!(m != 0);\n let height = self.grid.len();\n if m == height {\n return;\n } else if m < height {\n self.grid.truncate(m);\n self.check_car_valididy();\n self.check_goal_valididy();\n } else {\n let width = self.grid[0].len();\n (0..m - height).for_each(|_| self.grid.push(vec![Content::Empty; width]));\n }\n }\n\n pub fn set_wall(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Car => self.car = None,\n Content::Goal => self.goal = None,\n _ => {}\n }\n self.grid[y][x] = Content::Wall;\n }\n\n pub fn set_goal(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Car => self.car = None,\n Content::Goal => return,\n _ => {}\n }\n self.grid[y][x] = Content::Goal;\n if let Some(old_goal_pos) = &mut self.goal {\n se"},"suffix":{"kind":"string","value":"y][x] = Content::Car;\n if let Some(old_car_pos) = &mut self.car {\n self.grid[old_car_pos.1][old_car_pos.0] = Content::Empty;\n }\n self.car = Some((x, y));\n }\n\n pub fn set_empty(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Goal => self.goal = None,\n Content::Car => self.car = None,\n _ => {}\n }\n self.grid[y][x] = Content::Empty;\n }\n\n pub fn clear(&mut self) {\n self.grid = vec![vec![Content::Empty; self.grid[0].len()]; self.grid.len()];\n }\n\n pub fn fill_random(&mut self, wall_percentage: usize) {\n assert!(wall_percentage <= 100);\n self.car = None;\n self.goal = None;\n self.fill_random_walls(wall_percentage);\n let car_pos = self.get_random_pos();\n self.set_car(car_pos.0, car_pos.1);\n \n if self.m() * self.n() != 1 {\n let goal_pos = loop {\n let pos = self.get_random_pos();\n if pos != car_pos {\n break pos;\n }\n };\n self.set_goal(goal_pos.0, goal_pos.1);\n }\n }\n\n fn fill_random_walls(&mut self, wall_percentage: usize) {\n let mut rng = thread_rng();\n for content in self.grid.iter_mut().map(|i| i.iter_mut()).flatten() {\n if rng.gen_range(1, 101) <= wall_percentage {\n *content = Content::Wall;\n } else {\n *content = Content::Empty;\n }\n }\n }\n\n fn get_random_pos(&mut self) -> (usize, usize) {\n let n_cells = self.m() * self.n();\n let pos = thread_rng().gen_range(0, n_cells);\n let y = pos / self.n();\n let x = pos % self.n();\n (x, y)\n }\n\n fn check_car_valididy(&mut self) {\n if let Some(pos) = self.car {\n if pos.0 >= self.n() || pos.1 >= self.m() {\n self.car = None;\n }\n }\n }\n\n fn check_goal_valididy(&mut self) {\n if let Some(pos) = self.goal {\n if pos.0 >= self.n() || pos.1 >= self.m() {\n self.goal = None;\n }\n }\n }\n}\n"},"middle":{"kind":"string","value":"lf.grid[old_goal_pos.1][old_goal_pos.0] = Content::Empty;\n }\n self.goal = Some((x, y));\n }\n\n pub fn set_car(&mut self, x: usize, y: usize) {\n match &mut self.grid[y][x] {\n Content::Goal => self.goal = None,\n Content::Car => return,\n _ => {}\n }\n self.grid["},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn get_grid_size(matches: &ArgMatches) -> (usize, usize) {\n\n let m = matches.value_of(\"m\").unwrap_or(\"10\");\n\n let n = matches.value_of(\"n\").unwrap_or(\"10\");\n\n let m = match m.parse() {\n\n Err(_) | Ok(0) => {\n\n eprintln!(\"The -m parameter must be a positive integer\");\n\n std::process::exit(-1);\n\n }\n\n Ok(num) => num,\n\n };\n\n let n = match n.parse() {\n\n Err(_) | Ok(0) => {\n\n eprintln!(\"The -n parameter must be a positive integer\");\n\n std::process::exit(-1);\n\n }\n\n Ok(num) => num,\n\n };\n\n\n\n (m, n)\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":0,"score":105717.34834109014},{"content":"fn get_grid(matches: &ArgMatches) -> Result<Grid> {\n\n if let Some(file) = matches.value_of(\"file\") {\n\n get_grid_from_file(file)\n\n } else {\n\n get_grid_from_args(matches)\n\n }\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":1,"score":102260.1118388106},{"content":"fn get_grid_from_args(matches: &ArgMatches) -> Result<Grid> {\n\n let (m, n) = get_grid_size(&matches);\n\n check_valid_size(m, n)?;\n\n Ok(Grid::new(m, n))\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":2,"score":100036.48291096688},{"content":"fn get_wall_percentage(matches: &ArgMatches) -> usize {\n\n let wall_percentage = matches.value_of(\"wall_percentage\").unwrap_or(\"15\");\n\n let wall_percentage = match wall_percentage.parse() {\n\n Ok(num @ 0..=100) => num,\n\n _ => {\n\n eprintln!(\"The -r parameter must be a positive integer between 0 and 100\");\n\n std::process::exit(-1);\n\n }\n\n };\n\n\n\n wall_percentage\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":3,"score":85922.94839340687},{"content":"fn check_valid_size(m: usize, n: usize) -> Result<()> {\n\n let term_size = size()?;\n\n if m > term_size.1 as usize - 4 {\n\n eprintln!(\n\n \"There isn't space in your terminal for a grid with a height of {}\",\n\n m\n\n );\n\n eprintln!(\n\n \"The maximum for the actual size of your terminal is {}\",\n\n term_size.1 as usize - 4\n\n );\n\n std::process::exit(-1);\n\n } else if n > term_size.0 as usize / 2 - 2 {\n\n eprintln!(\n\n \"There isn't space in your terminal for a grid with a width of {}\",\n\n n\n\n );\n\n eprintln!(\n\n \"The maximum for the actual size of your terminal is {}\",\n\n term_size.0 as usize / 2 - 2\n\n );\n\n std::process::exit(-1);\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":4,"score":79256.887623791},{"content":"fn get_grid_from_file(path: &str) -> Result<Grid> {\n\n let file = File::open(path)?;\n\n let mut buffer = BufReader::new(file).lines();\n\n let m = buffer.next().unwrap()?.parse::<usize>()?;\n\n let n = buffer.next().unwrap()?.parse::<usize>()?;\n\n check_valid_size(m, n)?;\n\n let mut grid = Grid::new(m, n);\n\n for i in 0..m {\n\n let row = buffer.next().unwrap()?;\n\n let mut row_chars = row.chars();\n\n for j in 0..n {\n\n let c = row_chars.next().unwrap();\n\n match c {\n\n 'C' => grid.set_car(j, i),\n\n 'G' => grid.set_goal(j, i),\n\n 'X' => grid.set_wall(j, i),\n\n _ => {}\n\n }\n\n }\n\n }\n\n Ok(grid)\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":5,"score":77076.15850458808},{"content":"fn get_args_matches() -> ArgMatches<'static> {\n\n App::new(\"ia1\")\n\n .args(&[\n\n Arg::with_name(\"m\")\n\n .short(\"m\")\n\n .long(\"rows\")\n\n .takes_value(true)\n\n .help(\"Sets the number of initial rows\"),\n\n Arg::with_name(\"n\")\n\n .short(\"n\")\n\n .long(\"columns\")\n\n .takes_value(true)\n\n .help(\"Sets the number of initial columns\"),\n\n Arg::with_name(\"wall_percentage\")\n\n .short(\"r\")\n\n .long(\"random\")\n\n .takes_value(true)\n\n .help(\"Sets the percentage of walls in a random generated map\"),\n\n Arg::with_name(\"euclidean\")\n\n .long(\"euclidean\")\n","file_path":"car_simulation/src/main.rs","rank":6,"score":71086.3495282603},{"content":"fn get_heuristic(matches: &ArgMatches) -> Heuristic {\n\n if matches.is_present(\"euclidean\") {\n\n return Heuristic::Euclidean;\n\n }\n\n if matches.is_present(\"chebyshev\") {\n\n return Heuristic::Chebyshev;\n\n }\n\n Heuristic::Manhattan\n\n}\n","file_path":"car_simulation/src/main.rs","rank":7,"score":69959.12603020846},{"content":"fn get_chebyshev_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\n\n max(\n\n max(pos1.0, pos2.0) - min(pos1.0, pos2.0),\n\n max(pos1.1, pos2.1) - min(pos1.1, pos2.1),\n\n ) as f32\n\n}\n","file_path":"car_simulation/src/frontend/run_simulation.rs","rank":8,"score":64285.18936283658},{"content":"fn get_manhattan_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\n\n (max(pos1.0, pos2.0) - min(pos1.0, pos2.0) + max(pos1.1, pos2.1) - min(pos1.1, pos2.1)) as f32\n\n}\n\n\n","file_path":"car_simulation/src/frontend/run_simulation.rs","rank":9,"score":64285.18936283658},{"content":"fn get_euclidean_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\n\n let pos1 = (pos1.0 as f32, pos1.1 as f32);\n\n let pos2 = (pos2.0 as f32, pos2.1 as f32);\n\n ((pos1.0 - pos2.0).powi(2) + (pos1.1 - pos2.1).powi(2)).sqrt()\n\n}\n\n\n","file_path":"car_simulation/src/frontend/run_simulation.rs","rank":10,"score":64285.18936283658},{"content":"#[derive(Copy, Clone)]\n\nstruct AStarNode {\n\n pos: (usize, usize),\n\n predecessor: Option<(usize, usize)>,\n\n dist: usize,\n\n guessed_dist: f32,\n\n depth: usize,\n\n}\n\n\n\nimpl Default for AStarNode {\n\n fn default() -> Self {\n\n AStarNode {\n\n pos: (0, 0),\n\n predecessor: None,\n\n dist: usize::MAX,\n\n guessed_dist: f32::MAX,\n\n depth: 0,\n\n }\n\n }\n\n}\n\n\n","file_path":"grid/src/path_finding.rs","rank":11,"score":61037.951356981284},{"content":"fn quit() -> ! {\n\n disable_raw_mode().unwrap();\n\n execute!(stdout(), LeaveAlternateScreen, DisableMouseCapture, Show).unwrap();\n\n std::process::exit(0);\n\n}\n","file_path":"car_simulation/src/frontend/events.rs","rank":12,"score":54119.60155313226},{"content":"fn get_euclidean_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\n\n let pos1 = (pos1.0 as f32, pos1.1 as f32);\n\n let pos2 = (pos2.0 as f32, pos2.1 as f32);\n\n ((pos1.0 - pos2.0).powi(2) + (pos1.1 - pos2.1).powi(2)).sqrt()\n\n}\n\n\n","file_path":"benchmarks/src/main.rs","rank":13,"score":53582.2410165603},{"content":"fn get_chebyshev_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\n\n max(\n\n max(pos1.0, pos2.0) - min(pos1.0, pos2.0),\n\n max(pos1.1, pos2.1) - min(pos1.1, pos2.1),\n\n ) as f32\n\n}\n","file_path":"benchmarks/src/main.rs","rank":14,"score":53582.2410165603},{"content":"fn get_manhattan_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\n\n (max(pos1.0, pos2.0) - min(pos1.0, pos2.0) + max(pos1.1, pos2.1) - min(pos1.1, pos2.1)) as f32\n\n}\n\n\n","file_path":"benchmarks/src/main.rs","rank":15,"score":53582.2410165603},{"content":"fn main() -> Result<()> {\n\n let matches = get_args_matches();\n\n let grid = get_grid(&matches)?;\n\n let wall_percentage = get_wall_percentage(&matches);\n\n let heuristic = get_heuristic(&matches);\n\n let mut frontend = FrontEnd::new(grid, wall_percentage, heuristic);\n\n if matches.is_present(\"compat\") {\n\n frontend.use_compatibility_mode();\n\n }\n\n frontend.run()\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":16,"score":52318.19090911687},{"content":"\n\nimpl fmt::Display for Content {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n match self {\n\n Content::Car => write!(f, \"{}\", \"🚗\".on_black()),\n\n Content::Goal => write!(f, \"{}\", \"🏁\".on_black()),\n\n Content::Wall => write!(f, \"{}\", \" \".on_red()),\n\n Content::Empty => write!(f, \"{}\", \" \".on_black()),\n\n Content::Explored => write!(f, \"{}\", \" \".on_yellow()),\n\n Content::Trace(dir) => match dir {\n\n Direction::Left => write!(f, \"{}\", \"←←\".on_black()),\n\n Direction::Up => write!(f, \"{}\", \"↑↑\".on_black()),\n\n Direction::Right => write!(f, \"{}\", \"→→\".on_black()),\n\n Direction::Down => write!(f, \"{}\", \"↓↓\".on_black()),\n\n },\n\n }\n\n }\n\n}\n","file_path":"grid/src/content.rs","rank":17,"score":47706.2932457319},{"content":"use crossterm::style::Colorize;\n\nuse std::fmt;\n\n\n\n#[derive(Clone, Copy)]\n\npub enum Content {\n\n Car,\n\n Goal,\n\n Wall,\n\n Empty,\n\n Trace(Direction),\n\n Explored,\n\n}\n\n\n\n#[derive(Clone, Copy)]\n\npub enum Direction {\n\n Left,\n\n Up,\n\n Right,\n\n Down,\n\n}\n","file_path":"grid/src/content.rs","rank":18,"score":47706.1783143322},{"content":" compatibility_mode: bool,\n\n}\n\n\n\nimpl FrontEnd {\n\n pub fn new(grid: Grid, wall_percentage: usize, heuristic: Heuristic) -> Self {\n\n assert!(wall_percentage <= 100);\n\n FrontEnd {\n\n grid,\n\n state: State::Wall,\n\n wall_percentage,\n\n heuristic,\n\n status_msg: String::new(),\n\n compatibility_mode: false,\n\n }\n\n }\n\n\n\n pub fn run(&mut self) -> Result<()> {\n\n execute!(stdout(), Hide, EnableMouseCapture, EnterAlternateScreen)?;\n\n enable_raw_mode()?;\n\n loop {\n","file_path":"car_simulation/src/frontend/mod.rs","rank":19,"score":42550.02261159859},{"content":" self.draw_screen()?;\n\n self.process_event()?;\n\n }\n\n }\n\n\n\n pub fn use_compatibility_mode(&mut self) {\n\n self.compatibility_mode = true;\n\n }\n\n}\n","file_path":"car_simulation/src/frontend/mod.rs","rank":20,"score":42547.97972269843},{"content":"use crossterm::{\n\n cursor::Hide,\n\n event::EnableMouseCapture,\n\n execute,\n\n terminal::{enable_raw_mode, EnterAlternateScreen},\n\n Result,\n\n};\n\nuse grid::Grid;\n\nuse std::io::{stdout, Write};\n\nmod events;\n\nmod run_simulation;\n\nmod screen;\n\n\n\n#[derive(PartialEq)]\n","file_path":"car_simulation/src/frontend/mod.rs","rank":21,"score":42546.410833464826},{"content":"#[derive(PartialEq)]\n\nenum State {\n\n Car,\n\n Goal,\n\n Wall,\n\n Remove,\n\n}\n\n\n\n#[derive(PartialEq)]\n\npub enum Heuristic {\n\n Euclidean,\n\n Manhattan,\n\n Chebyshev,\n\n}\n\n\n\npub struct FrontEnd {\n\n grid: Grid,\n\n state: State,\n\n wall_percentage: usize,\n\n heuristic: Heuristic,\n\n status_msg: String,\n","file_path":"car_simulation/src/frontend/mod.rs","rank":22,"score":40771.12490476072},{"content":"fn main() {\n\n println!(\"Time benchmarks\");\n\n println!(\n\n \"{: <10} {: >12} {: >12} {: >12}\",\n\n \"15%\", \"200x200\", \"100x100\", \"50x50\"\n\n );\n\n println!(\n\n \"{: <10} {: >10}μs {: >10}μs {: >10}μs\",\n\n \"Manhattan\",\n\n get_average_duration(200, 200, 15, get_manhattan_dist, 5000),\n\n get_average_duration(100, 100, 15, get_manhattan_dist, 5000),\n\n get_average_duration(50, 50, 15, get_manhattan_dist, 5000),\n\n );\n\n println!(\n\n \"{: <10} {: >10}μs {: >10}μs {: >10}μs\",\n\n \"Euclidean\",\n\n get_average_duration(200, 200, 15, get_euclidean_dist, 5000),\n\n get_average_duration(100, 100, 15, get_euclidean_dist, 5000),\n\n get_average_duration(50, 50, 15, get_euclidean_dist, 5000),\n\n );\n","file_path":"benchmarks/src/main.rs","rank":23,"score":37039.44925417092},{"content":"fn get_average_explored(\n\n m: usize,\n\n n: usize,\n\n wall_percentage: usize,\n\n heuristic: fn((usize, usize), (usize, usize)) -> f32,\n\n repetitions: usize,\n\n) -> u128 {\n\n let mut grid = Grid::new(m, n);\n\n let mut acc = 0;\n\n for _ in 0..repetitions {\n\n acc += loop {\n\n grid.fill_random(wall_percentage);\n\n let result = grid.find_path(heuristic);\n\n if let Some(path_result) = result {\n\n break path_result.get_n_explored();\n\n }\n\n } as u128\n\n }\n\n acc / repetitions as u128\n\n}\n\n\n","file_path":"benchmarks/src/main.rs","rank":24,"score":35174.09012918645},{"content":"fn get_average_duration(\n\n m: usize,\n\n n: usize,\n\n wall_percentage: usize,\n\n heuristic: fn((usize, usize), (usize, usize)) -> f32,\n\n repetitions: usize,\n\n) -> u128 {\n\n let mut grid = Grid::new(m, n);\n\n let mut acc = 0;\n\n for _ in 0..repetitions {\n\n acc += loop {\n\n grid.fill_random(wall_percentage);\n\n let instant = Instant::now();\n\n let result = grid.find_path(heuristic);\n\n let duration = instant.elapsed();\n\n if let Some(_) = result {\n\n break duration.as_micros();\n\n }\n\n }\n\n }\n\n acc / repetitions as u128\n\n}\n\n\n","file_path":"benchmarks/src/main.rs","rank":25,"score":35174.09012918645},{"content":" break lenght;\n\n }\n\n lenght += 1;\n\n }\n\n }\n\n\n\n pub fn get_n_explored(&self) -> usize {\n\n self.explored\n\n }\n\n}\n\n\n\nimpl Grid {\n\n pub fn find_path(\n\n &mut self,\n\n heuristic: fn((usize, usize), (usize, usize)) -> f32,\n\n ) -> Option<PathResult> {\n\n assert!(self.car.is_some() && self.goal.is_some());\n\n let car_pos = self.car.unwrap();\n\n let goal_pos = self.goal.unwrap();\n\n\n","file_path":"grid/src/path_finding.rs","rank":36,"score":21581.414801534724},{"content":" if pos.1 + 1 < self.m() {\n\n neighs.push((pos.0, pos.1 + 1));\n\n }\n\n if pos.1 != 0 {\n\n neighs.push((pos.0, pos.1 - 1));\n\n }\n\n neighs\n\n .into_iter()\n\n .filter(|pos| {\n\n if let Content::Wall = self.grid[pos.1][pos.0] {\n\n false\n\n } else {\n\n true\n\n }\n\n })\n\n .collect()\n\n }\n\n\n\n pub fn clear_path(&mut self) {\n\n for cell in self.grid.iter_mut().map(|row| row.iter_mut()).flatten() {\n\n if let Content::Trace(_) | Content::Explored = cell {\n\n *cell = Content::Empty;\n\n }\n\n }\n\n }\n\n}\n","file_path":"grid/src/path_finding.rs","rank":37,"score":21581.21740895744},{"content":"impl Default for &AStarNode {\n\n fn default() -> Self {\n\n &AStarNode {\n\n pos: (0, 0),\n\n predecessor: None,\n\n dist: usize::MAX,\n\n guessed_dist: f32::MAX,\n\n depth: 0,\n\n }\n\n }\n\n}\n\n\n\nimpl Eq for AStarNode {}\n\n\n\nimpl PartialEq for AStarNode {\n\n fn eq(&self, other: &Self) -> bool {\n\n self.guessed_dist == other.guessed_dist && self.depth == other.depth\n\n }\n\n}\n\n\n","file_path":"grid/src/path_finding.rs","rank":38,"score":21576.18163278859},{"content":" break;\n\n }\n\n self.grid[current.1][current.0] = match current {\n\n (x, y) if x == prev.0 + 1 && y == prev.1 => Content::Trace(Direction::Left),\n\n (x, y) if x + 1 == prev.0 && y == prev.1 => Content::Trace(Direction::Right),\n\n (x, y) if x == prev.0 && y == prev.1 + 1 => Content::Trace(Direction::Up),\n\n (x, y) if x == prev.0 && y + 1 == prev.1 => Content::Trace(Direction::Down),\n\n _ => unreachable!(\"Corrupted predecessors table\"),\n\n };\n\n }\n\n }\n\n\n\n fn get_neighbours(&self, pos: (usize, usize)) -> Vec<(usize, usize)> {\n\n let mut neighs = Vec::new();\n\n if pos.0 + 1 < self.n() {\n\n neighs.push((pos.0 + 1, pos.1));\n\n }\n\n if pos.0 != 0 {\n\n neighs.push((pos.0 - 1, pos.1));\n\n }\n","file_path":"grid/src/path_finding.rs","rank":39,"score":21575.144674272302},{"content":" }\n\n x => x,\n\n }\n\n }\n\n}\n\n\n\npub struct PathResult {\n\n explored: usize,\n\n node_map: FxHashMap<(usize, usize), AStarNode>,\n\n start: (usize, usize),\n\n end: (usize, usize),\n\n}\n\n\n\nimpl PathResult {\n\n pub fn get_path_length(self) -> usize {\n\n let mut current = self.end;\n\n let mut lenght = 0;\n\n loop {\n\n current = self.node_map[¤t].predecessor.unwrap();\n\n if current == self.start {\n","file_path":"grid/src/path_finding.rs","rank":40,"score":21575.071819058492},{"content":" let mut node_map = FxHashMap::default();\n\n //reserve space for twice the space needed for the expected length upfront to avoid reallocations\n\n node_map.reserve(heuristic(car_pos, goal_pos) as usize * 2);\n\n node_map.insert(\n\n car_pos,\n\n AStarNode {\n\n pos: car_pos,\n\n predecessor: None,\n\n dist: 0,\n\n guessed_dist: heuristic(car_pos, goal_pos),\n\n depth: 0,\n\n },\n\n );\n\n\n\n let mut priority_queue = BinaryHeap::new();\n\n priority_queue.push(node_map[&car_pos]);\n\n let mut iteration_count = 0;\n\n\n\n while !priority_queue.is_empty() {\n\n iteration_count += 1;\n","file_path":"grid/src/path_finding.rs","rank":41,"score":21574.758425442953},{"content":"use super::content::{Content, Direction};\n\nuse super::Grid;\n\nuse fxhash::FxHashMap;\n\nuse std::cmp::Ordering;\n\nuse std::collections::BinaryHeap;\n\n\n\n#[derive(Copy, Clone)]\n","file_path":"grid/src/path_finding.rs","rank":42,"score":21573.571018835024},{"content":" neigh_node.guessed_dist = dist as f32 + heuristic(neigh_pos, goal_pos);\n\n neigh_node.depth = current.depth + 1;\n\n priority_queue.push(neigh_node.clone());\n\n }\n\n }\n\n }\n\n None\n\n }\n\n\n\n fn draw_path(\n\n &mut self,\n\n node_map: &FxHashMap<(usize, usize), AStarNode>,\n\n start: (usize, usize),\n\n end: (usize, usize),\n\n ) {\n\n let mut current = end;\n\n loop {\n\n let prev = current;\n\n current = node_map[¤t].predecessor.unwrap();\n\n if current == start {\n","file_path":"grid/src/path_finding.rs","rank":43,"score":21573.455313757862},{"content":"impl Ord for AStarNode {\n\n fn cmp(&self, other: &Self) -> Ordering {\n\n //this will panic if guessed_dist is NaN. That shouldn't happen and the floating point\n\n //is needed to use heuristics like the euclidean distance\n\n other.guessed_dist.partial_cmp(&self.guessed_dist).unwrap()\n\n }\n\n}\n\n\n\nimpl PartialOrd for AStarNode {\n\n //They get compared in inversed order\n\n //so an AStarNode will have more priority if its guessed distance is smaller\n\n //if equal the node with the higher depth will have more priority\n\n fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\n\n match other.guessed_dist.partial_cmp(&self.guessed_dist) {\n\n Some(Ordering::Equal) => {\n\n if other.depth < self.depth {\n\n Some(Ordering::Greater)\n\n } else {\n\n Some(Ordering::Less)\n\n }\n","file_path":"grid/src/path_finding.rs","rank":44,"score":21573.323305117618},{"content":" let current = priority_queue.pop().unwrap();\n\n if current.pos == goal_pos {\n\n self.draw_path(&node_map, car_pos, goal_pos);\n\n return Some(PathResult {\n\n explored: iteration_count,\n\n node_map,\n\n start: car_pos,\n\n end: goal_pos,\n\n });\n\n }\n\n if current.pos != car_pos {\n\n self.grid[current.pos.1][current.pos.0] = Content::Explored;\n\n }\n\n let dist = current.dist + 1;\n\n for neigh_pos in self.get_neighbours(current.pos) {\n\n if dist < node_map.get(&neigh_pos).unwrap_or_default().dist {\n\n let neigh_node = node_map.entry(neigh_pos).or_default();\n\n neigh_node.pos = neigh_pos;\n\n neigh_node.predecessor = Some(current.pos);\n\n neigh_node.dist = dist;\n","file_path":"grid/src/path_finding.rs","rank":45,"score":21572.10464214399},{"content":" The file must have:\n\n -The number of rows in the first row\n\n -The number of columns in the second column\n\n -A representation of the map using:\n\n -C. as the car\n\n -G. as the goal\n\n -X. as walls\n\n -another character as empty cells\",\n\n ),\n\n ])\n\n .get_matches()\n\n}\n\n\n","file_path":"car_simulation/src/main.rs","rank":46,"score":20676.922493605813},{"content":"use clap::{App, Arg, ArgMatches};\n\nuse crossterm::{terminal::size, Result};\n\nuse grid::Grid;\n\nmod frontend;\n\nuse frontend::{FrontEnd, Heuristic};\n\nuse std::fs::File;\n\nuse std::io::{BufRead, BufReader};\n\n\n","file_path":"car_simulation/src/main.rs","rank":47,"score":20671.7112123769},{"content":" .conflicts_with(\"manhattan\")\n\n .conflicts_with(\"chebyshev\")\n\n .help(\"Uses euclidean distance as the heuristic function\"),\n\n Arg::with_name(\"manhattan\")\n\n .long(\"manhattan\")\n\n .help(\"Uses manhattan distance as the heuristic function. This is the default\"),\n\n Arg::with_name(\"chebyshev\")\n\n .long(\"chebyshev\")\n\n .help(\"Uses chebyshev distance as the heuristic function\"),\n\n Arg::with_name(\"compat\")\n\n .long(\"compat\")\n\n .help(\"Uses a compatibility mode. Use this option if you can't see the car or the goal flag correctly\"),\n\n Arg::with_name(\"file\")\n\n .long(\"file\")\n\n .short(\"f\")\n\n .takes_value(true)\n\n .conflicts_with_all(&[\"m\", \"n\"])\n\n .help(\"Reads a map from the specified file\")\n\n .long_help(\n\n \"Reads a map from the specified file\n","file_path":"car_simulation/src/main.rs","rank":48,"score":20668.778693069828},{"content":" }\n\n\n\n //keep in mind that cell are two spaces wide\n\n fn is_inside_grid(&self, pos: (usize, usize)) -> bool {\n\n pos.0 <= self.grid.n() * 2 + 1 && pos.0 >= 2 && pos.1 <= self.grid.m() && pos.1 >= 1\n\n }\n\n\n\n fn set_cell(&mut self, pos: (usize, usize)) {\n\n match self.state {\n\n State::Car => self\n\n .grid\n\n .set_car(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\n\n State::Goal => self\n\n .grid\n\n .set_goal(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\n\n State::Wall => self\n\n .grid\n\n .set_wall(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\n\n State::Remove => self\n\n .grid\n","file_path":"car_simulation/src/frontend/events.rs","rank":49,"score":19782.721064235684},{"content":" pub(super) fn process_event(&mut self) -> Result<()> {\n\n let term_size = size()?;\n\n let buttons_y = term_size.1 - 2;\n\n match read()? {\n\n Event::Mouse(MouseEvent::Down(MouseButton::Left, x, y, ..)) => {\n\n self.status_msg.clear();\n\n if self.is_inside_grid((x as usize, y as usize)) {\n\n self.set_cell((x as usize, y as usize));\n\n } else if y == buttons_y {\n\n self.process_clicked_button(x, term_size)?;\n\n }\n\n }\n\n Event::Mouse(MouseEvent::Drag(MouseButton::Left, x, y, ..)) => {\n\n if self.is_inside_grid((x as usize, y as usize)) {\n\n self.set_cell((x as usize, y as usize));\n\n }\n\n }\n\n _ => {}\n\n }\n\n Ok(())\n","file_path":"car_simulation/src/frontend/events.rs","rank":50,"score":19779.233395291434},{"content":" .set_empty(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\n\n }\n\n }\n\n\n\n fn process_clicked_button(&mut self, x: u16, term_size: (u16, u16)) -> Result<()> {\n\n if x >= ROWS_MINUS_BUTTON_BEGIN && x <= ROWS_MINUS_BUTTON_END {\n\n self.change_height_while_clicked(-1, term_size.1 as usize)?;\n\n } else if x >= ROWS_PLUS_BUTTON_BEGIN && x <= ROWS_PLUS_BUTTON_END {\n\n self.change_height_while_clicked(1, term_size.1 as usize)?;\n\n } else if x >= COLUMNS_MINUS_BUTTON_BEGIN && x <= COLUMNS_MINUS_BUTTON_END {\n\n self.change_width_while_clicked(-1, term_size.0 as usize)?;\n\n } else if x >= COLUMNS_PLUS_BUTTON_BEGIN && x <= COLUMNS_PLUS_BUTTON_END {\n\n self.change_width_while_clicked(1, term_size.0 as usize)?;\n\n } else if x >= CAR_BUTTON_BEGIN && x <= CAR_BUTTON_END {\n\n self.state = State::Car;\n\n } else if x >= GOAL_BUTTON_BEGIN && x <= GOAL_BUTTON_END {\n\n self.state = State::Goal;\n\n } else if x >= WALL_BUTTON_BEGIN && x <= WALL_BUTTON_END {\n\n self.state = State::Wall;\n\n } else if x >= REMOVE_BUTTON_BEGIN && x <= REMOVE_BUTTON_END {\n","file_path":"car_simulation/src/frontend/events.rs","rank":51,"score":19779.040335277336},{"content":"use super::{FrontEnd, Heuristic, State};\n\nuse crossterm::{\n\n cursor::MoveTo,\n\n queue,\n\n style::Styler,\n\n terminal::{size, Clear, ClearType},\n\n Result,\n\n};\n\nuse std::io::{stdout, Write};\n\n\n\nimpl FrontEnd {\n\n pub(super) fn draw_screen(&mut self) -> Result<()> {\n\n queue!(stdout(), Clear(ClearType::All))?;\n\n self.draw_grid()?;\n\n self.draw_buttons()?;\n\n self.draw_status_bar()?;\n\n stdout().flush()?;\n\n Ok(())\n\n }\n\n\n","file_path":"car_simulation/src/frontend/screen.rs","rank":52,"score":19776.553170083534},{"content":" self.draw_screen()?;\n\n if poll(Duration::from_millis(50))? {\n\n if let Event::Mouse(MouseEvent::Up(MouseButton::Left, ..)) = read()? {\n\n break;\n\n }\n\n }\n\n }\n\n Ok(())\n\n }\n\n\n\n fn change_width_while_clicked(&mut self, change: isize, term_width: usize) -> Result<()> {\n\n loop {\n\n let desired_width = self.grid.n() as isize + change;\n\n self.grid\n\n .set_width(min(max(desired_width, 1) as usize, term_width / 2 - 2));\n\n self.draw_screen()?;\n\n if poll(Duration::from_millis(50))? {\n\n if let Event::Mouse(MouseEvent::Up(MouseButton::Left, ..)) = read()? {\n\n break;\n\n }\n","file_path":"car_simulation/src/frontend/events.rs","rank":53,"score":19776.45844416712},{"content":" self.state = State::Remove;\n\n } else if x >= CLEAR_BUTTON_BEGIN && x <= CLEAR_BUTTON_END {\n\n self.grid.clear();\n\n } else if x >= RANDOM_BUTTON_BEGIN && x <= RANDOM_BUTTON_END {\n\n self.grid.fill_random(self.wall_percentage);\n\n } else if x >= HEURISTIC_BUTTON_BEGIN && x <= HEURISTIC_BUTTON_END {\n\n self.change_heuristic();\n\n } else if x >= RUN_BUTTON_BEGIN && x <= RUN_BUTTON_END {\n\n self.run_simulation();\n\n } else if x >= QUIT_BUTTON_BEGIN && x <= QUIT_BUTTON_END {\n\n quit();\n\n }\n\n Ok(())\n\n }\n\n\n\n fn change_height_while_clicked(&mut self, change: isize, term_height: usize) -> Result<()> {\n\n loop {\n\n let desired_height = self.grid.m() as isize + change;\n\n self.grid\n\n .set_height(min(max(desired_height, 1) as usize, term_height - 4));\n","file_path":"car_simulation/src/frontend/events.rs","rank":54,"score":19776.104844965863},{"content":" stdout(),\n\n \"{0}Rows{1} {0}Columns{1} {2} {3} {4} {5} {6} {7} {8} {9} {10}\\n\\r\",\n\n \"--\".negative(),\n\n \"++\".negative(),\n\n if self.state == State::Car {\n\n \"Car\".bold()\n\n } else {\n\n \"Car\".negative()\n\n },\n\n if self.state == State::Goal {\n\n \"Goal\".bold()\n\n } else {\n\n \"Goal\".negative()\n\n },\n\n if self.state == State::Wall {\n\n \"Wall\".bold()\n\n } else {\n\n \"Wall\".negative()\n\n },\n\n if self.state == State::Remove {\n","file_path":"car_simulation/src/frontend/screen.rs","rank":55,"score":19774.099990190924},{"content":" fn draw_grid(&mut self) -> Result<()> {\n\n queue!(stdout(), MoveTo(0, 0))?;\n\n if self.compatibility_mode {\n\n write!(\n\n stdout(),\n\n \"{}\",\n\n self.grid\n\n .to_string()\n\n .replace(\"🚗\", \"CC\")\n\n .replace(\"🏁\", \"GG\")\n\n )?;\n\n } else {\n\n write!(stdout(), \"{}\", self.grid)?;\n\n }\n\n Ok(())\n\n }\n\n\n\n fn draw_buttons(&mut self) -> Result<()> {\n\n queue!(stdout(), MoveTo(0, size()?.1 - 2))?;\n\n write!(\n","file_path":"car_simulation/src/frontend/screen.rs","rank":56,"score":19773.574447191877},{"content":" }\n\n }\n\n Ok(())\n\n }\n\n\n\n fn change_heuristic(&mut self) {\n\n self.heuristic = match self.heuristic {\n\n Heuristic::Manhattan => Heuristic::Euclidean,\n\n Heuristic::Euclidean => Heuristic::Chebyshev,\n\n Heuristic::Chebyshev => Heuristic::Manhattan,\n\n }\n\n }\n\n}\n\n\n","file_path":"car_simulation/src/frontend/events.rs","rank":57,"score":19773.076921996468},{"content":" \"Remove\".bold()\n\n } else {\n\n \"Remove\".negative()\n\n },\n\n \"Clear\".negative(),\n\n \"Random\".negative(),\n\n match self.heuristic {\n\n Heuristic::Euclidean => \"Euclidean\".bold(),\n\n Heuristic::Manhattan => \"Manhattan\".bold(),\n\n Heuristic::Chebyshev => \"Chebyshev\".bold(),\n\n },\n\n \"Run\".negative(),\n\n \"Quit\".negative()\n\n )?;\n\n Ok(())\n\n }\n\n\n\n fn draw_status_bar(&mut self) -> Result<()> {\n\n write!(stdout(), \"{}\", self.status_msg)?;\n\n Ok(())\n\n }\n\n}\n","file_path":"car_simulation/src/frontend/screen.rs","rank":58,"score":19772.434550076003},{"content":"use super::{FrontEnd, Heuristic, State};\n\nuse crossterm::{\n\n cursor::Show,\n\n event::{poll, read, DisableMouseCapture, Event, MouseButton, MouseEvent},\n\n execute,\n\n terminal::{disable_raw_mode, size, LeaveAlternateScreen},\n\n Result,\n\n};\n\nuse std::cmp::{max, min};\n\nuse std::io::{stdout, Write};\n\nuse std::time::Duration;\n\n\n\nconst ROWS_MINUS_BUTTON_BEGIN: u16 = 0;\n\nconst ROWS_MINUS_BUTTON_END: u16 = 1;\n\nconst ROWS_PLUS_BUTTON_BEGIN: u16 = 6;\n\nconst ROWS_PLUS_BUTTON_END: u16 = 7;\n\nconst COLUMNS_MINUS_BUTTON_BEGIN: u16 = 9;\n\nconst COLUMNS_MINUS_BUTTON_END: u16 = 10;\n\nconst COLUMNS_PLUS_BUTTON_BEGIN: u16 = 18;\n\nconst COLUMNS_PLUS_BUTTON_END: u16 = 19;\n","file_path":"car_simulation/src/frontend/events.rs","rank":59,"score":19771.773613596193},{"content":"const CAR_BUTTON_BEGIN: u16 = 21;\n\nconst CAR_BUTTON_END: u16 = 23;\n\nconst GOAL_BUTTON_BEGIN: u16 = 25;\n\nconst GOAL_BUTTON_END: u16 = 28;\n\nconst WALL_BUTTON_BEGIN: u16 = 30;\n\nconst WALL_BUTTON_END: u16 = 33;\n\nconst REMOVE_BUTTON_BEGIN: u16 = 35;\n\nconst REMOVE_BUTTON_END: u16 = 40;\n\nconst CLEAR_BUTTON_BEGIN: u16 = 42;\n\nconst CLEAR_BUTTON_END: u16 = 46;\n\nconst RANDOM_BUTTON_BEGIN: u16 = 48;\n\nconst RANDOM_BUTTON_END: u16 = 53;\n\nconst HEURISTIC_BUTTON_BEGIN: u16 = 55;\n\nconst HEURISTIC_BUTTON_END: u16 = 63;\n\nconst RUN_BUTTON_BEGIN: u16 = 65;\n\nconst RUN_BUTTON_END: u16 = 67;\n\nconst QUIT_BUTTON_BEGIN: u16 = 69;\n\nconst QUIT_BUTTON_END: u16 = 72;\n\n\n\nimpl FrontEnd {\n","file_path":"car_simulation/src/frontend/events.rs","rank":60,"score":19771.37923221826},{"content":"use super::{FrontEnd, Heuristic};\n\nuse std::cmp::{max, min};\n\nuse std::time::Instant;\n\n\n\nimpl FrontEnd {\n\n pub(super) fn run_simulation(&mut self) {\n\n self.grid.clear_path();\n\n if !self.check_valid_state() {\n\n self.status_msg = String::from(\"A goal and a car must be in the grid\");\n\n return;\n\n }\n\n let heuristic_fn = match self.heuristic {\n\n Heuristic::Euclidean => get_euclidean_dist,\n\n Heuristic::Manhattan => get_manhattan_dist,\n\n Heuristic::Chebyshev => get_chebyshev_dist,\n\n };\n\n let time = Instant::now();\n\n let path_result = self.grid.find_path(heuristic_fn);\n\n let time_used = time.elapsed();\n\n match path_result {\n","file_path":"car_simulation/src/frontend/run_simulation.rs","rank":61,"score":18959.519737209834},{"content":" None => self.status_msg = String::from(\"Couldn't find a path\"),\n\n Some(path_result) => {\n\n self.status_msg =\n\n format!(\n\n \"Path with length {1} found! {0} cells were explored. Approximate time used: {2} μs\",\n\n path_result.get_n_explored(), path_result.get_path_length(), time_used.as_micros()\n\n );\n\n }\n\n }\n\n }\n\n\n\n fn check_valid_state(&self) -> bool {\n\n self.grid.has_car() && self.grid.has_goal()\n\n }\n\n}\n\n\n","file_path":"car_simulation/src/frontend/run_simulation.rs","rank":62,"score":18957.932595692222},{"content":"use grid::Grid;\n\nuse std::cmp::{max, min};\n\nuse std::time::Instant;\n","file_path":"benchmarks/src/main.rs","rank":63,"score":5.894982962416464},{"content":" # PRÁCTICA. ESTRATEGIAS DE BÚSQUEDA \n\nProfesores: Marcos Moreno Vega, Elena Sánchez Nielsen \n\n\n\nAlumno: Daniel del Castillo de la Rosa\n\n## Asignatura: Inteligencia Artificial \n\n## Curso: 2020/2021 \n\n## OBJETIVO \n\nEl objetivo del desarrollo de la actividad práctica es la utilización de estrategias de búsqueda como propuesta de resolución en la determinación de la planificación de trayectorias para coches autónomos. \n\n### DESCRIPCIÓN DEL PROBLEMA \n\nEl entorno del coche autónomo se puede suponer rectangular de dimensiones M x N y constituido por celdas libres y ocupadas, donde el coche puede efectuar acciones de movimiento, una cada vez, desde la casilla actual a una de las 4-vecinas (Norte, Sur, Este u Oeste) que no se encuentre ocupada. Las casillas ocupadas corresponden a obstáculos. Las casillas libres corresponden con celdas libres de obstáculos. El coche dispone de un vector de percepción, constituido por: \n\n\n\n* El estado de un sensor de proximidad (SN, SO, SS, SE) por cada una de las direcciones de movimiento, que detecta si el vecino correspondiente está ocupado por algún obstáculo (Si=1). \n\n\n\nEl desarrollo de la práctica, consiste en: \n\n\n\n1. **Diseño de un simulador de entorno**: se debe realizar un simulador de entorno que permita: (1) Definición de celdas de dimensiones variables M x N; (2) Definir de manera cómoda la posición de los obstáculos, de forma aleatoria y manual y (3) permitir una visualización de la trayectoria determinada. \n\n\n\n2. **Planificación del camino usando estrategias heurísticas**: Suponiendo un único coche autónomo según el escenario definido en el apartado anterior, se deberá determinar la trayectoria óptima partiendo desde una posición inicial hasta alcanzar una posición final. Ambas posiciones son definidas por el usuario, en el entorno de simulación desarrollado previamente.Se puede disponer de un mapa topológico que contenga la descripción del entorno. \n\n\n\n3. **Evaluación Experimental**: se evaluará los resultados obtenidos para la estrategia implementada utilizando como mínimo dos funciones heurísticas diferentes y tres tipos de tamaños diferentes de escenarios. \n","file_path":"README.md","rank":64,"score":5.275862159470835}],"string":"[\n {\n \"content\": \"fn get_grid_size(matches: &ArgMatches) -> (usize, usize) {\\n\\n let m = matches.value_of(\\\"m\\\").unwrap_or(\\\"10\\\");\\n\\n let n = matches.value_of(\\\"n\\\").unwrap_or(\\\"10\\\");\\n\\n let m = match m.parse() {\\n\\n Err(_) | Ok(0) => {\\n\\n eprintln!(\\\"The -m parameter must be a positive integer\\\");\\n\\n std::process::exit(-1);\\n\\n }\\n\\n Ok(num) => num,\\n\\n };\\n\\n let n = match n.parse() {\\n\\n Err(_) | Ok(0) => {\\n\\n eprintln!(\\\"The -n parameter must be a positive integer\\\");\\n\\n std::process::exit(-1);\\n\\n }\\n\\n Ok(num) => num,\\n\\n };\\n\\n\\n\\n (m, n)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 0,\n \"score\": 105717.34834109014\n },\n {\n \"content\": \"fn get_grid(matches: &ArgMatches) -> Result<Grid> {\\n\\n if let Some(file) = matches.value_of(\\\"file\\\") {\\n\\n get_grid_from_file(file)\\n\\n } else {\\n\\n get_grid_from_args(matches)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 1,\n \"score\": 102260.1118388106\n },\n {\n \"content\": \"fn get_grid_from_args(matches: &ArgMatches) -> Result<Grid> {\\n\\n let (m, n) = get_grid_size(&matches);\\n\\n check_valid_size(m, n)?;\\n\\n Ok(Grid::new(m, n))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 2,\n \"score\": 100036.48291096688\n },\n {\n \"content\": \"fn get_wall_percentage(matches: &ArgMatches) -> usize {\\n\\n let wall_percentage = matches.value_of(\\\"wall_percentage\\\").unwrap_or(\\\"15\\\");\\n\\n let wall_percentage = match wall_percentage.parse() {\\n\\n Ok(num @ 0..=100) => num,\\n\\n _ => {\\n\\n eprintln!(\\\"The -r parameter must be a positive integer between 0 and 100\\\");\\n\\n std::process::exit(-1);\\n\\n }\\n\\n };\\n\\n\\n\\n wall_percentage\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 3,\n \"score\": 85922.94839340687\n },\n {\n \"content\": \"fn check_valid_size(m: usize, n: usize) -> Result<()> {\\n\\n let term_size = size()?;\\n\\n if m > term_size.1 as usize - 4 {\\n\\n eprintln!(\\n\\n \\\"There isn't space in your terminal for a grid with a height of {}\\\",\\n\\n m\\n\\n );\\n\\n eprintln!(\\n\\n \\\"The maximum for the actual size of your terminal is {}\\\",\\n\\n term_size.1 as usize - 4\\n\\n );\\n\\n std::process::exit(-1);\\n\\n } else if n > term_size.0 as usize / 2 - 2 {\\n\\n eprintln!(\\n\\n \\\"There isn't space in your terminal for a grid with a width of {}\\\",\\n\\n n\\n\\n );\\n\\n eprintln!(\\n\\n \\\"The maximum for the actual size of your terminal is {}\\\",\\n\\n term_size.0 as usize / 2 - 2\\n\\n );\\n\\n std::process::exit(-1);\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 4,\n \"score\": 79256.887623791\n },\n {\n \"content\": \"fn get_grid_from_file(path: &str) -> Result<Grid> {\\n\\n let file = File::open(path)?;\\n\\n let mut buffer = BufReader::new(file).lines();\\n\\n let m = buffer.next().unwrap()?.parse::<usize>()?;\\n\\n let n = buffer.next().unwrap()?.parse::<usize>()?;\\n\\n check_valid_size(m, n)?;\\n\\n let mut grid = Grid::new(m, n);\\n\\n for i in 0..m {\\n\\n let row = buffer.next().unwrap()?;\\n\\n let mut row_chars = row.chars();\\n\\n for j in 0..n {\\n\\n let c = row_chars.next().unwrap();\\n\\n match c {\\n\\n 'C' => grid.set_car(j, i),\\n\\n 'G' => grid.set_goal(j, i),\\n\\n 'X' => grid.set_wall(j, i),\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(grid)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 5,\n \"score\": 77076.15850458808\n },\n {\n \"content\": \"fn get_args_matches() -> ArgMatches<'static> {\\n\\n App::new(\\\"ia1\\\")\\n\\n .args(&[\\n\\n Arg::with_name(\\\"m\\\")\\n\\n .short(\\\"m\\\")\\n\\n .long(\\\"rows\\\")\\n\\n .takes_value(true)\\n\\n .help(\\\"Sets the number of initial rows\\\"),\\n\\n Arg::with_name(\\\"n\\\")\\n\\n .short(\\\"n\\\")\\n\\n .long(\\\"columns\\\")\\n\\n .takes_value(true)\\n\\n .help(\\\"Sets the number of initial columns\\\"),\\n\\n Arg::with_name(\\\"wall_percentage\\\")\\n\\n .short(\\\"r\\\")\\n\\n .long(\\\"random\\\")\\n\\n .takes_value(true)\\n\\n .help(\\\"Sets the percentage of walls in a random generated map\\\"),\\n\\n Arg::with_name(\\\"euclidean\\\")\\n\\n .long(\\\"euclidean\\\")\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 6,\n \"score\": 71086.3495282603\n },\n {\n \"content\": \"fn get_heuristic(matches: &ArgMatches) -> Heuristic {\\n\\n if matches.is_present(\\\"euclidean\\\") {\\n\\n return Heuristic::Euclidean;\\n\\n }\\n\\n if matches.is_present(\\\"chebyshev\\\") {\\n\\n return Heuristic::Chebyshev;\\n\\n }\\n\\n Heuristic::Manhattan\\n\\n}\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 7,\n \"score\": 69959.12603020846\n },\n {\n \"content\": \"fn get_chebyshev_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\\n\\n max(\\n\\n max(pos1.0, pos2.0) - min(pos1.0, pos2.0),\\n\\n max(pos1.1, pos2.1) - min(pos1.1, pos2.1),\\n\\n ) as f32\\n\\n}\\n\",\n \"file_path\": \"car_simulation/src/frontend/run_simulation.rs\",\n \"rank\": 8,\n \"score\": 64285.18936283658\n },\n {\n \"content\": \"fn get_manhattan_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\\n\\n (max(pos1.0, pos2.0) - min(pos1.0, pos2.0) + max(pos1.1, pos2.1) - min(pos1.1, pos2.1)) as f32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/frontend/run_simulation.rs\",\n \"rank\": 9,\n \"score\": 64285.18936283658\n },\n {\n \"content\": \"fn get_euclidean_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\\n\\n let pos1 = (pos1.0 as f32, pos1.1 as f32);\\n\\n let pos2 = (pos2.0 as f32, pos2.1 as f32);\\n\\n ((pos1.0 - pos2.0).powi(2) + (pos1.1 - pos2.1).powi(2)).sqrt()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/frontend/run_simulation.rs\",\n \"rank\": 10,\n \"score\": 64285.18936283658\n },\n {\n \"content\": \"#[derive(Copy, Clone)]\\n\\nstruct AStarNode {\\n\\n pos: (usize, usize),\\n\\n predecessor: Option<(usize, usize)>,\\n\\n dist: usize,\\n\\n guessed_dist: f32,\\n\\n depth: usize,\\n\\n}\\n\\n\\n\\nimpl Default for AStarNode {\\n\\n fn default() -> Self {\\n\\n AStarNode {\\n\\n pos: (0, 0),\\n\\n predecessor: None,\\n\\n dist: usize::MAX,\\n\\n guessed_dist: f32::MAX,\\n\\n depth: 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 11,\n \"score\": 61037.951356981284\n },\n {\n \"content\": \"fn quit() -> ! {\\n\\n disable_raw_mode().unwrap();\\n\\n execute!(stdout(), LeaveAlternateScreen, DisableMouseCapture, Show).unwrap();\\n\\n std::process::exit(0);\\n\\n}\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 12,\n \"score\": 54119.60155313226\n },\n {\n \"content\": \"fn get_euclidean_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\\n\\n let pos1 = (pos1.0 as f32, pos1.1 as f32);\\n\\n let pos2 = (pos2.0 as f32, pos2.1 as f32);\\n\\n ((pos1.0 - pos2.0).powi(2) + (pos1.1 - pos2.1).powi(2)).sqrt()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 13,\n \"score\": 53582.2410165603\n },\n {\n \"content\": \"fn get_chebyshev_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\\n\\n max(\\n\\n max(pos1.0, pos2.0) - min(pos1.0, pos2.0),\\n\\n max(pos1.1, pos2.1) - min(pos1.1, pos2.1),\\n\\n ) as f32\\n\\n}\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 14,\n \"score\": 53582.2410165603\n },\n {\n \"content\": \"fn get_manhattan_dist(pos1: (usize, usize), pos2: (usize, usize)) -> f32 {\\n\\n (max(pos1.0, pos2.0) - min(pos1.0, pos2.0) + max(pos1.1, pos2.1) - min(pos1.1, pos2.1)) as f32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 15,\n \"score\": 53582.2410165603\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n let matches = get_args_matches();\\n\\n let grid = get_grid(&matches)?;\\n\\n let wall_percentage = get_wall_percentage(&matches);\\n\\n let heuristic = get_heuristic(&matches);\\n\\n let mut frontend = FrontEnd::new(grid, wall_percentage, heuristic);\\n\\n if matches.is_present(\\\"compat\\\") {\\n\\n frontend.use_compatibility_mode();\\n\\n }\\n\\n frontend.run()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 16,\n \"score\": 52318.19090911687\n },\n {\n \"content\": \"\\n\\nimpl fmt::Display for Content {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n match self {\\n\\n Content::Car => write!(f, \\\"{}\\\", \\\"🚗\\\".on_black()),\\n\\n Content::Goal => write!(f, \\\"{}\\\", \\\"🏁\\\".on_black()),\\n\\n Content::Wall => write!(f, \\\"{}\\\", \\\" \\\".on_red()),\\n\\n Content::Empty => write!(f, \\\"{}\\\", \\\" \\\".on_black()),\\n\\n Content::Explored => write!(f, \\\"{}\\\", \\\" \\\".on_yellow()),\\n\\n Content::Trace(dir) => match dir {\\n\\n Direction::Left => write!(f, \\\"{}\\\", \\\"←←\\\".on_black()),\\n\\n Direction::Up => write!(f, \\\"{}\\\", \\\"↑↑\\\".on_black()),\\n\\n Direction::Right => write!(f, \\\"{}\\\", \\\"→→\\\".on_black()),\\n\\n Direction::Down => write!(f, \\\"{}\\\", \\\"↓↓\\\".on_black()),\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"grid/src/content.rs\",\n \"rank\": 17,\n \"score\": 47706.2932457319\n },\n {\n \"content\": \"use crossterm::style::Colorize;\\n\\nuse std::fmt;\\n\\n\\n\\n#[derive(Clone, Copy)]\\n\\npub enum Content {\\n\\n Car,\\n\\n Goal,\\n\\n Wall,\\n\\n Empty,\\n\\n Trace(Direction),\\n\\n Explored,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Copy)]\\n\\npub enum Direction {\\n\\n Left,\\n\\n Up,\\n\\n Right,\\n\\n Down,\\n\\n}\\n\",\n \"file_path\": \"grid/src/content.rs\",\n \"rank\": 18,\n \"score\": 47706.1783143322\n },\n {\n \"content\": \" compatibility_mode: bool,\\n\\n}\\n\\n\\n\\nimpl FrontEnd {\\n\\n pub fn new(grid: Grid, wall_percentage: usize, heuristic: Heuristic) -> Self {\\n\\n assert!(wall_percentage <= 100);\\n\\n FrontEnd {\\n\\n grid,\\n\\n state: State::Wall,\\n\\n wall_percentage,\\n\\n heuristic,\\n\\n status_msg: String::new(),\\n\\n compatibility_mode: false,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> Result<()> {\\n\\n execute!(stdout(), Hide, EnableMouseCapture, EnterAlternateScreen)?;\\n\\n enable_raw_mode()?;\\n\\n loop {\\n\",\n \"file_path\": \"car_simulation/src/frontend/mod.rs\",\n \"rank\": 19,\n \"score\": 42550.02261159859\n },\n {\n \"content\": \" self.draw_screen()?;\\n\\n self.process_event()?;\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn use_compatibility_mode(&mut self) {\\n\\n self.compatibility_mode = true;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"car_simulation/src/frontend/mod.rs\",\n \"rank\": 20,\n \"score\": 42547.97972269843\n },\n {\n \"content\": \"use crossterm::{\\n\\n cursor::Hide,\\n\\n event::EnableMouseCapture,\\n\\n execute,\\n\\n terminal::{enable_raw_mode, EnterAlternateScreen},\\n\\n Result,\\n\\n};\\n\\nuse grid::Grid;\\n\\nuse std::io::{stdout, Write};\\n\\nmod events;\\n\\nmod run_simulation;\\n\\nmod screen;\\n\\n\\n\\n#[derive(PartialEq)]\\n\",\n \"file_path\": \"car_simulation/src/frontend/mod.rs\",\n \"rank\": 21,\n \"score\": 42546.410833464826\n },\n {\n \"content\": \"#[derive(PartialEq)]\\n\\nenum State {\\n\\n Car,\\n\\n Goal,\\n\\n Wall,\\n\\n Remove,\\n\\n}\\n\\n\\n\\n#[derive(PartialEq)]\\n\\npub enum Heuristic {\\n\\n Euclidean,\\n\\n Manhattan,\\n\\n Chebyshev,\\n\\n}\\n\\n\\n\\npub struct FrontEnd {\\n\\n grid: Grid,\\n\\n state: State,\\n\\n wall_percentage: usize,\\n\\n heuristic: Heuristic,\\n\\n status_msg: String,\\n\",\n \"file_path\": \"car_simulation/src/frontend/mod.rs\",\n \"rank\": 22,\n \"score\": 40771.12490476072\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"Time benchmarks\\\");\\n\\n println!(\\n\\n \\\"{: <10} {: >12} {: >12} {: >12}\\\",\\n\\n \\\"15%\\\", \\\"200x200\\\", \\\"100x100\\\", \\\"50x50\\\"\\n\\n );\\n\\n println!(\\n\\n \\\"{: <10} {: >10}μs {: >10}μs {: >10}μs\\\",\\n\\n \\\"Manhattan\\\",\\n\\n get_average_duration(200, 200, 15, get_manhattan_dist, 5000),\\n\\n get_average_duration(100, 100, 15, get_manhattan_dist, 5000),\\n\\n get_average_duration(50, 50, 15, get_manhattan_dist, 5000),\\n\\n );\\n\\n println!(\\n\\n \\\"{: <10} {: >10}μs {: >10}μs {: >10}μs\\\",\\n\\n \\\"Euclidean\\\",\\n\\n get_average_duration(200, 200, 15, get_euclidean_dist, 5000),\\n\\n get_average_duration(100, 100, 15, get_euclidean_dist, 5000),\\n\\n get_average_duration(50, 50, 15, get_euclidean_dist, 5000),\\n\\n );\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 23,\n \"score\": 37039.44925417092\n },\n {\n \"content\": \"fn get_average_explored(\\n\\n m: usize,\\n\\n n: usize,\\n\\n wall_percentage: usize,\\n\\n heuristic: fn((usize, usize), (usize, usize)) -> f32,\\n\\n repetitions: usize,\\n\\n) -> u128 {\\n\\n let mut grid = Grid::new(m, n);\\n\\n let mut acc = 0;\\n\\n for _ in 0..repetitions {\\n\\n acc += loop {\\n\\n grid.fill_random(wall_percentage);\\n\\n let result = grid.find_path(heuristic);\\n\\n if let Some(path_result) = result {\\n\\n break path_result.get_n_explored();\\n\\n }\\n\\n } as u128\\n\\n }\\n\\n acc / repetitions as u128\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 24,\n \"score\": 35174.09012918645\n },\n {\n \"content\": \"fn get_average_duration(\\n\\n m: usize,\\n\\n n: usize,\\n\\n wall_percentage: usize,\\n\\n heuristic: fn((usize, usize), (usize, usize)) -> f32,\\n\\n repetitions: usize,\\n\\n) -> u128 {\\n\\n let mut grid = Grid::new(m, n);\\n\\n let mut acc = 0;\\n\\n for _ in 0..repetitions {\\n\\n acc += loop {\\n\\n grid.fill_random(wall_percentage);\\n\\n let instant = Instant::now();\\n\\n let result = grid.find_path(heuristic);\\n\\n let duration = instant.elapsed();\\n\\n if let Some(_) = result {\\n\\n break duration.as_micros();\\n\\n }\\n\\n }\\n\\n }\\n\\n acc / repetitions as u128\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 25,\n \"score\": 35174.09012918645\n },\n {\n \"content\": \" break lenght;\\n\\n }\\n\\n lenght += 1;\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_n_explored(&self) -> usize {\\n\\n self.explored\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Grid {\\n\\n pub fn find_path(\\n\\n &mut self,\\n\\n heuristic: fn((usize, usize), (usize, usize)) -> f32,\\n\\n ) -> Option<PathResult> {\\n\\n assert!(self.car.is_some() && self.goal.is_some());\\n\\n let car_pos = self.car.unwrap();\\n\\n let goal_pos = self.goal.unwrap();\\n\\n\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 36,\n \"score\": 21581.414801534724\n },\n {\n \"content\": \" if pos.1 + 1 < self.m() {\\n\\n neighs.push((pos.0, pos.1 + 1));\\n\\n }\\n\\n if pos.1 != 0 {\\n\\n neighs.push((pos.0, pos.1 - 1));\\n\\n }\\n\\n neighs\\n\\n .into_iter()\\n\\n .filter(|pos| {\\n\\n if let Content::Wall = self.grid[pos.1][pos.0] {\\n\\n false\\n\\n } else {\\n\\n true\\n\\n }\\n\\n })\\n\\n .collect()\\n\\n }\\n\\n\\n\\n pub fn clear_path(&mut self) {\\n\\n for cell in self.grid.iter_mut().map(|row| row.iter_mut()).flatten() {\\n\\n if let Content::Trace(_) | Content::Explored = cell {\\n\\n *cell = Content::Empty;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 37,\n \"score\": 21581.21740895744\n },\n {\n \"content\": \"impl Default for &AStarNode {\\n\\n fn default() -> Self {\\n\\n &AStarNode {\\n\\n pos: (0, 0),\\n\\n predecessor: None,\\n\\n dist: usize::MAX,\\n\\n guessed_dist: f32::MAX,\\n\\n depth: 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Eq for AStarNode {}\\n\\n\\n\\nimpl PartialEq for AStarNode {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n self.guessed_dist == other.guessed_dist && self.depth == other.depth\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 38,\n \"score\": 21576.18163278859\n },\n {\n \"content\": \" break;\\n\\n }\\n\\n self.grid[current.1][current.0] = match current {\\n\\n (x, y) if x == prev.0 + 1 && y == prev.1 => Content::Trace(Direction::Left),\\n\\n (x, y) if x + 1 == prev.0 && y == prev.1 => Content::Trace(Direction::Right),\\n\\n (x, y) if x == prev.0 && y == prev.1 + 1 => Content::Trace(Direction::Up),\\n\\n (x, y) if x == prev.0 && y + 1 == prev.1 => Content::Trace(Direction::Down),\\n\\n _ => unreachable!(\\\"Corrupted predecessors table\\\"),\\n\\n };\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_neighbours(&self, pos: (usize, usize)) -> Vec<(usize, usize)> {\\n\\n let mut neighs = Vec::new();\\n\\n if pos.0 + 1 < self.n() {\\n\\n neighs.push((pos.0 + 1, pos.1));\\n\\n }\\n\\n if pos.0 != 0 {\\n\\n neighs.push((pos.0 - 1, pos.1));\\n\\n }\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 39,\n \"score\": 21575.144674272302\n },\n {\n \"content\": \" }\\n\\n x => x,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct PathResult {\\n\\n explored: usize,\\n\\n node_map: FxHashMap<(usize, usize), AStarNode>,\\n\\n start: (usize, usize),\\n\\n end: (usize, usize),\\n\\n}\\n\\n\\n\\nimpl PathResult {\\n\\n pub fn get_path_length(self) -> usize {\\n\\n let mut current = self.end;\\n\\n let mut lenght = 0;\\n\\n loop {\\n\\n current = self.node_map[¤t].predecessor.unwrap();\\n\\n if current == self.start {\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 40,\n \"score\": 21575.071819058492\n },\n {\n \"content\": \" let mut node_map = FxHashMap::default();\\n\\n //reserve space for twice the space needed for the expected length upfront to avoid reallocations\\n\\n node_map.reserve(heuristic(car_pos, goal_pos) as usize * 2);\\n\\n node_map.insert(\\n\\n car_pos,\\n\\n AStarNode {\\n\\n pos: car_pos,\\n\\n predecessor: None,\\n\\n dist: 0,\\n\\n guessed_dist: heuristic(car_pos, goal_pos),\\n\\n depth: 0,\\n\\n },\\n\\n );\\n\\n\\n\\n let mut priority_queue = BinaryHeap::new();\\n\\n priority_queue.push(node_map[&car_pos]);\\n\\n let mut iteration_count = 0;\\n\\n\\n\\n while !priority_queue.is_empty() {\\n\\n iteration_count += 1;\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 41,\n \"score\": 21574.758425442953\n },\n {\n \"content\": \"use super::content::{Content, Direction};\\n\\nuse super::Grid;\\n\\nuse fxhash::FxHashMap;\\n\\nuse std::cmp::Ordering;\\n\\nuse std::collections::BinaryHeap;\\n\\n\\n\\n#[derive(Copy, Clone)]\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 42,\n \"score\": 21573.571018835024\n },\n {\n \"content\": \" neigh_node.guessed_dist = dist as f32 + heuristic(neigh_pos, goal_pos);\\n\\n neigh_node.depth = current.depth + 1;\\n\\n priority_queue.push(neigh_node.clone());\\n\\n }\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n fn draw_path(\\n\\n &mut self,\\n\\n node_map: &FxHashMap<(usize, usize), AStarNode>,\\n\\n start: (usize, usize),\\n\\n end: (usize, usize),\\n\\n ) {\\n\\n let mut current = end;\\n\\n loop {\\n\\n let prev = current;\\n\\n current = node_map[¤t].predecessor.unwrap();\\n\\n if current == start {\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 43,\n \"score\": 21573.455313757862\n },\n {\n \"content\": \"impl Ord for AStarNode {\\n\\n fn cmp(&self, other: &Self) -> Ordering {\\n\\n //this will panic if guessed_dist is NaN. That shouldn't happen and the floating point\\n\\n //is needed to use heuristics like the euclidean distance\\n\\n other.guessed_dist.partial_cmp(&self.guessed_dist).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialOrd for AStarNode {\\n\\n //They get compared in inversed order\\n\\n //so an AStarNode will have more priority if its guessed distance is smaller\\n\\n //if equal the node with the higher depth will have more priority\\n\\n fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\\n\\n match other.guessed_dist.partial_cmp(&self.guessed_dist) {\\n\\n Some(Ordering::Equal) => {\\n\\n if other.depth < self.depth {\\n\\n Some(Ordering::Greater)\\n\\n } else {\\n\\n Some(Ordering::Less)\\n\\n }\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 44,\n \"score\": 21573.323305117618\n },\n {\n \"content\": \" let current = priority_queue.pop().unwrap();\\n\\n if current.pos == goal_pos {\\n\\n self.draw_path(&node_map, car_pos, goal_pos);\\n\\n return Some(PathResult {\\n\\n explored: iteration_count,\\n\\n node_map,\\n\\n start: car_pos,\\n\\n end: goal_pos,\\n\\n });\\n\\n }\\n\\n if current.pos != car_pos {\\n\\n self.grid[current.pos.1][current.pos.0] = Content::Explored;\\n\\n }\\n\\n let dist = current.dist + 1;\\n\\n for neigh_pos in self.get_neighbours(current.pos) {\\n\\n if dist < node_map.get(&neigh_pos).unwrap_or_default().dist {\\n\\n let neigh_node = node_map.entry(neigh_pos).or_default();\\n\\n neigh_node.pos = neigh_pos;\\n\\n neigh_node.predecessor = Some(current.pos);\\n\\n neigh_node.dist = dist;\\n\",\n \"file_path\": \"grid/src/path_finding.rs\",\n \"rank\": 45,\n \"score\": 21572.10464214399\n },\n {\n \"content\": \" The file must have:\\n\\n -The number of rows in the first row\\n\\n -The number of columns in the second column\\n\\n -A representation of the map using:\\n\\n -C. as the car\\n\\n -G. as the goal\\n\\n -X. as walls\\n\\n -another character as empty cells\\\",\\n\\n ),\\n\\n ])\\n\\n .get_matches()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 46,\n \"score\": 20676.922493605813\n },\n {\n \"content\": \"use clap::{App, Arg, ArgMatches};\\n\\nuse crossterm::{terminal::size, Result};\\n\\nuse grid::Grid;\\n\\nmod frontend;\\n\\nuse frontend::{FrontEnd, Heuristic};\\n\\nuse std::fs::File;\\n\\nuse std::io::{BufRead, BufReader};\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 47,\n \"score\": 20671.7112123769\n },\n {\n \"content\": \" .conflicts_with(\\\"manhattan\\\")\\n\\n .conflicts_with(\\\"chebyshev\\\")\\n\\n .help(\\\"Uses euclidean distance as the heuristic function\\\"),\\n\\n Arg::with_name(\\\"manhattan\\\")\\n\\n .long(\\\"manhattan\\\")\\n\\n .help(\\\"Uses manhattan distance as the heuristic function. This is the default\\\"),\\n\\n Arg::with_name(\\\"chebyshev\\\")\\n\\n .long(\\\"chebyshev\\\")\\n\\n .help(\\\"Uses chebyshev distance as the heuristic function\\\"),\\n\\n Arg::with_name(\\\"compat\\\")\\n\\n .long(\\\"compat\\\")\\n\\n .help(\\\"Uses a compatibility mode. Use this option if you can't see the car or the goal flag correctly\\\"),\\n\\n Arg::with_name(\\\"file\\\")\\n\\n .long(\\\"file\\\")\\n\\n .short(\\\"f\\\")\\n\\n .takes_value(true)\\n\\n .conflicts_with_all(&[\\\"m\\\", \\\"n\\\"])\\n\\n .help(\\\"Reads a map from the specified file\\\")\\n\\n .long_help(\\n\\n \\\"Reads a map from the specified file\\n\",\n \"file_path\": \"car_simulation/src/main.rs\",\n \"rank\": 48,\n \"score\": 20668.778693069828\n },\n {\n \"content\": \" }\\n\\n\\n\\n //keep in mind that cell are two spaces wide\\n\\n fn is_inside_grid(&self, pos: (usize, usize)) -> bool {\\n\\n pos.0 <= self.grid.n() * 2 + 1 && pos.0 >= 2 && pos.1 <= self.grid.m() && pos.1 >= 1\\n\\n }\\n\\n\\n\\n fn set_cell(&mut self, pos: (usize, usize)) {\\n\\n match self.state {\\n\\n State::Car => self\\n\\n .grid\\n\\n .set_car(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\\n\\n State::Goal => self\\n\\n .grid\\n\\n .set_goal(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\\n\\n State::Wall => self\\n\\n .grid\\n\\n .set_wall(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\\n\\n State::Remove => self\\n\\n .grid\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 49,\n \"score\": 19782.721064235684\n },\n {\n \"content\": \" pub(super) fn process_event(&mut self) -> Result<()> {\\n\\n let term_size = size()?;\\n\\n let buttons_y = term_size.1 - 2;\\n\\n match read()? {\\n\\n Event::Mouse(MouseEvent::Down(MouseButton::Left, x, y, ..)) => {\\n\\n self.status_msg.clear();\\n\\n if self.is_inside_grid((x as usize, y as usize)) {\\n\\n self.set_cell((x as usize, y as usize));\\n\\n } else if y == buttons_y {\\n\\n self.process_clicked_button(x, term_size)?;\\n\\n }\\n\\n }\\n\\n Event::Mouse(MouseEvent::Drag(MouseButton::Left, x, y, ..)) => {\\n\\n if self.is_inside_grid((x as usize, y as usize)) {\\n\\n self.set_cell((x as usize, y as usize));\\n\\n }\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n Ok(())\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 50,\n \"score\": 19779.233395291434\n },\n {\n \"content\": \" .set_empty(pos.0 as usize / 2 - 1, pos.1 as usize - 1),\\n\\n }\\n\\n }\\n\\n\\n\\n fn process_clicked_button(&mut self, x: u16, term_size: (u16, u16)) -> Result<()> {\\n\\n if x >= ROWS_MINUS_BUTTON_BEGIN && x <= ROWS_MINUS_BUTTON_END {\\n\\n self.change_height_while_clicked(-1, term_size.1 as usize)?;\\n\\n } else if x >= ROWS_PLUS_BUTTON_BEGIN && x <= ROWS_PLUS_BUTTON_END {\\n\\n self.change_height_while_clicked(1, term_size.1 as usize)?;\\n\\n } else if x >= COLUMNS_MINUS_BUTTON_BEGIN && x <= COLUMNS_MINUS_BUTTON_END {\\n\\n self.change_width_while_clicked(-1, term_size.0 as usize)?;\\n\\n } else if x >= COLUMNS_PLUS_BUTTON_BEGIN && x <= COLUMNS_PLUS_BUTTON_END {\\n\\n self.change_width_while_clicked(1, term_size.0 as usize)?;\\n\\n } else if x >= CAR_BUTTON_BEGIN && x <= CAR_BUTTON_END {\\n\\n self.state = State::Car;\\n\\n } else if x >= GOAL_BUTTON_BEGIN && x <= GOAL_BUTTON_END {\\n\\n self.state = State::Goal;\\n\\n } else if x >= WALL_BUTTON_BEGIN && x <= WALL_BUTTON_END {\\n\\n self.state = State::Wall;\\n\\n } else if x >= REMOVE_BUTTON_BEGIN && x <= REMOVE_BUTTON_END {\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 51,\n \"score\": 19779.040335277336\n },\n {\n \"content\": \"use super::{FrontEnd, Heuristic, State};\\n\\nuse crossterm::{\\n\\n cursor::MoveTo,\\n\\n queue,\\n\\n style::Styler,\\n\\n terminal::{size, Clear, ClearType},\\n\\n Result,\\n\\n};\\n\\nuse std::io::{stdout, Write};\\n\\n\\n\\nimpl FrontEnd {\\n\\n pub(super) fn draw_screen(&mut self) -> Result<()> {\\n\\n queue!(stdout(), Clear(ClearType::All))?;\\n\\n self.draw_grid()?;\\n\\n self.draw_buttons()?;\\n\\n self.draw_status_bar()?;\\n\\n stdout().flush()?;\\n\\n Ok(())\\n\\n }\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/frontend/screen.rs\",\n \"rank\": 52,\n \"score\": 19776.553170083534\n },\n {\n \"content\": \" self.draw_screen()?;\\n\\n if poll(Duration::from_millis(50))? {\\n\\n if let Event::Mouse(MouseEvent::Up(MouseButton::Left, ..)) = read()? {\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn change_width_while_clicked(&mut self, change: isize, term_width: usize) -> Result<()> {\\n\\n loop {\\n\\n let desired_width = self.grid.n() as isize + change;\\n\\n self.grid\\n\\n .set_width(min(max(desired_width, 1) as usize, term_width / 2 - 2));\\n\\n self.draw_screen()?;\\n\\n if poll(Duration::from_millis(50))? {\\n\\n if let Event::Mouse(MouseEvent::Up(MouseButton::Left, ..)) = read()? {\\n\\n break;\\n\\n }\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 53,\n \"score\": 19776.45844416712\n },\n {\n \"content\": \" self.state = State::Remove;\\n\\n } else if x >= CLEAR_BUTTON_BEGIN && x <= CLEAR_BUTTON_END {\\n\\n self.grid.clear();\\n\\n } else if x >= RANDOM_BUTTON_BEGIN && x <= RANDOM_BUTTON_END {\\n\\n self.grid.fill_random(self.wall_percentage);\\n\\n } else if x >= HEURISTIC_BUTTON_BEGIN && x <= HEURISTIC_BUTTON_END {\\n\\n self.change_heuristic();\\n\\n } else if x >= RUN_BUTTON_BEGIN && x <= RUN_BUTTON_END {\\n\\n self.run_simulation();\\n\\n } else if x >= QUIT_BUTTON_BEGIN && x <= QUIT_BUTTON_END {\\n\\n quit();\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn change_height_while_clicked(&mut self, change: isize, term_height: usize) -> Result<()> {\\n\\n loop {\\n\\n let desired_height = self.grid.m() as isize + change;\\n\\n self.grid\\n\\n .set_height(min(max(desired_height, 1) as usize, term_height - 4));\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 54,\n \"score\": 19776.104844965863\n },\n {\n \"content\": \" stdout(),\\n\\n \\\"{0}Rows{1} {0}Columns{1} {2} {3} {4} {5} {6} {7} {8} {9} {10}\\\\n\\\\r\\\",\\n\\n \\\"--\\\".negative(),\\n\\n \\\"++\\\".negative(),\\n\\n if self.state == State::Car {\\n\\n \\\"Car\\\".bold()\\n\\n } else {\\n\\n \\\"Car\\\".negative()\\n\\n },\\n\\n if self.state == State::Goal {\\n\\n \\\"Goal\\\".bold()\\n\\n } else {\\n\\n \\\"Goal\\\".negative()\\n\\n },\\n\\n if self.state == State::Wall {\\n\\n \\\"Wall\\\".bold()\\n\\n } else {\\n\\n \\\"Wall\\\".negative()\\n\\n },\\n\\n if self.state == State::Remove {\\n\",\n \"file_path\": \"car_simulation/src/frontend/screen.rs\",\n \"rank\": 55,\n \"score\": 19774.099990190924\n },\n {\n \"content\": \" fn draw_grid(&mut self) -> Result<()> {\\n\\n queue!(stdout(), MoveTo(0, 0))?;\\n\\n if self.compatibility_mode {\\n\\n write!(\\n\\n stdout(),\\n\\n \\\"{}\\\",\\n\\n self.grid\\n\\n .to_string()\\n\\n .replace(\\\"🚗\\\", \\\"CC\\\")\\n\\n .replace(\\\"🏁\\\", \\\"GG\\\")\\n\\n )?;\\n\\n } else {\\n\\n write!(stdout(), \\\"{}\\\", self.grid)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn draw_buttons(&mut self) -> Result<()> {\\n\\n queue!(stdout(), MoveTo(0, size()?.1 - 2))?;\\n\\n write!(\\n\",\n \"file_path\": \"car_simulation/src/frontend/screen.rs\",\n \"rank\": 56,\n \"score\": 19773.574447191877\n },\n {\n \"content\": \" }\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn change_heuristic(&mut self) {\\n\\n self.heuristic = match self.heuristic {\\n\\n Heuristic::Manhattan => Heuristic::Euclidean,\\n\\n Heuristic::Euclidean => Heuristic::Chebyshev,\\n\\n Heuristic::Chebyshev => Heuristic::Manhattan,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 57,\n \"score\": 19773.076921996468\n },\n {\n \"content\": \" \\\"Remove\\\".bold()\\n\\n } else {\\n\\n \\\"Remove\\\".negative()\\n\\n },\\n\\n \\\"Clear\\\".negative(),\\n\\n \\\"Random\\\".negative(),\\n\\n match self.heuristic {\\n\\n Heuristic::Euclidean => \\\"Euclidean\\\".bold(),\\n\\n Heuristic::Manhattan => \\\"Manhattan\\\".bold(),\\n\\n Heuristic::Chebyshev => \\\"Chebyshev\\\".bold(),\\n\\n },\\n\\n \\\"Run\\\".negative(),\\n\\n \\\"Quit\\\".negative()\\n\\n )?;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn draw_status_bar(&mut self) -> Result<()> {\\n\\n write!(stdout(), \\\"{}\\\", self.status_msg)?;\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"car_simulation/src/frontend/screen.rs\",\n \"rank\": 58,\n \"score\": 19772.434550076003\n },\n {\n \"content\": \"use super::{FrontEnd, Heuristic, State};\\n\\nuse crossterm::{\\n\\n cursor::Show,\\n\\n event::{poll, read, DisableMouseCapture, Event, MouseButton, MouseEvent},\\n\\n execute,\\n\\n terminal::{disable_raw_mode, size, LeaveAlternateScreen},\\n\\n Result,\\n\\n};\\n\\nuse std::cmp::{max, min};\\n\\nuse std::io::{stdout, Write};\\n\\nuse std::time::Duration;\\n\\n\\n\\nconst ROWS_MINUS_BUTTON_BEGIN: u16 = 0;\\n\\nconst ROWS_MINUS_BUTTON_END: u16 = 1;\\n\\nconst ROWS_PLUS_BUTTON_BEGIN: u16 = 6;\\n\\nconst ROWS_PLUS_BUTTON_END: u16 = 7;\\n\\nconst COLUMNS_MINUS_BUTTON_BEGIN: u16 = 9;\\n\\nconst COLUMNS_MINUS_BUTTON_END: u16 = 10;\\n\\nconst COLUMNS_PLUS_BUTTON_BEGIN: u16 = 18;\\n\\nconst COLUMNS_PLUS_BUTTON_END: u16 = 19;\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 59,\n \"score\": 19771.773613596193\n },\n {\n \"content\": \"const CAR_BUTTON_BEGIN: u16 = 21;\\n\\nconst CAR_BUTTON_END: u16 = 23;\\n\\nconst GOAL_BUTTON_BEGIN: u16 = 25;\\n\\nconst GOAL_BUTTON_END: u16 = 28;\\n\\nconst WALL_BUTTON_BEGIN: u16 = 30;\\n\\nconst WALL_BUTTON_END: u16 = 33;\\n\\nconst REMOVE_BUTTON_BEGIN: u16 = 35;\\n\\nconst REMOVE_BUTTON_END: u16 = 40;\\n\\nconst CLEAR_BUTTON_BEGIN: u16 = 42;\\n\\nconst CLEAR_BUTTON_END: u16 = 46;\\n\\nconst RANDOM_BUTTON_BEGIN: u16 = 48;\\n\\nconst RANDOM_BUTTON_END: u16 = 53;\\n\\nconst HEURISTIC_BUTTON_BEGIN: u16 = 55;\\n\\nconst HEURISTIC_BUTTON_END: u16 = 63;\\n\\nconst RUN_BUTTON_BEGIN: u16 = 65;\\n\\nconst RUN_BUTTON_END: u16 = 67;\\n\\nconst QUIT_BUTTON_BEGIN: u16 = 69;\\n\\nconst QUIT_BUTTON_END: u16 = 72;\\n\\n\\n\\nimpl FrontEnd {\\n\",\n \"file_path\": \"car_simulation/src/frontend/events.rs\",\n \"rank\": 60,\n \"score\": 19771.37923221826\n },\n {\n \"content\": \"use super::{FrontEnd, Heuristic};\\n\\nuse std::cmp::{max, min};\\n\\nuse std::time::Instant;\\n\\n\\n\\nimpl FrontEnd {\\n\\n pub(super) fn run_simulation(&mut self) {\\n\\n self.grid.clear_path();\\n\\n if !self.check_valid_state() {\\n\\n self.status_msg = String::from(\\\"A goal and a car must be in the grid\\\");\\n\\n return;\\n\\n }\\n\\n let heuristic_fn = match self.heuristic {\\n\\n Heuristic::Euclidean => get_euclidean_dist,\\n\\n Heuristic::Manhattan => get_manhattan_dist,\\n\\n Heuristic::Chebyshev => get_chebyshev_dist,\\n\\n };\\n\\n let time = Instant::now();\\n\\n let path_result = self.grid.find_path(heuristic_fn);\\n\\n let time_used = time.elapsed();\\n\\n match path_result {\\n\",\n \"file_path\": \"car_simulation/src/frontend/run_simulation.rs\",\n \"rank\": 61,\n \"score\": 18959.519737209834\n },\n {\n \"content\": \" None => self.status_msg = String::from(\\\"Couldn't find a path\\\"),\\n\\n Some(path_result) => {\\n\\n self.status_msg =\\n\\n format!(\\n\\n \\\"Path with length {1} found! {0} cells were explored. Approximate time used: {2} μs\\\",\\n\\n path_result.get_n_explored(), path_result.get_path_length(), time_used.as_micros()\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn check_valid_state(&self) -> bool {\\n\\n self.grid.has_car() && self.grid.has_goal()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"car_simulation/src/frontend/run_simulation.rs\",\n \"rank\": 62,\n \"score\": 18957.932595692222\n },\n {\n \"content\": \"use grid::Grid;\\n\\nuse std::cmp::{max, min};\\n\\nuse std::time::Instant;\\n\",\n \"file_path\": \"benchmarks/src/main.rs\",\n \"rank\": 63,\n \"score\": 5.894982962416464\n },\n {\n \"content\": \" # PRÁCTICA. ESTRATEGIAS DE BÚSQUEDA \\n\\nProfesores: Marcos Moreno Vega, Elena Sánchez Nielsen \\n\\n\\n\\nAlumno: Daniel del Castillo de la Rosa\\n\\n## Asignatura: Inteligencia Artificial \\n\\n## Curso: 2020/2021 \\n\\n## OBJETIVO \\n\\nEl objetivo del desarrollo de la actividad práctica es la utilización de estrategias de búsqueda como propuesta de resolución en la determinación de la planificación de trayectorias para coches autónomos. \\n\\n### DESCRIPCIÓN DEL PROBLEMA \\n\\nEl entorno del coche autónomo se puede suponer rectangular de dimensiones M x N y constituido por celdas libres y ocupadas, donde el coche puede efectuar acciones de movimiento, una cada vez, desde la casilla actual a una de las 4-vecinas (Norte, Sur, Este u Oeste) que no se encuentre ocupada. Las casillas ocupadas corresponden a obstáculos. Las casillas libres corresponden con celdas libres de obstáculos. El coche dispone de un vector de percepción, constituido por: \\n\\n\\n\\n* El estado de un sensor de proximidad (SN, SO, SS, SE) por cada una de las direcciones de movimiento, que detecta si el vecino correspondiente está ocupado por algún obstáculo (Si=1). \\n\\n\\n\\nEl desarrollo de la práctica, consiste en: \\n\\n\\n\\n1. **Diseño de un simulador de entorno**: se debe realizar un simulador de entorno que permita: (1) Definición de celdas de dimensiones variables M x N; (2) Definir de manera cómoda la posición de los obstáculos, de forma aleatoria y manual y (3) permitir una visualización de la trayectoria determinada. \\n\\n\\n\\n2. **Planificación del camino usando estrategias heurísticas**: Suponiendo un único coche autónomo según el escenario definido en el apartado anterior, se deberá determinar la trayectoria óptima partiendo desde una posición inicial hasta alcanzar una posición final. Ambas posiciones son definidas por el usuario, en el entorno de simulación desarrollado previamente.Se puede disponer de un mapa topológico que contenga la descripción del entorno. \\n\\n\\n\\n3. **Evaluación Experimental**: se evaluará los resultados obtenidos para la estrategia implementada utilizando como mínimo dos funciones heurísticas diferentes y tres tipos de tamaños diferentes de escenarios. \\n\",\n \"file_path\": \"README.md\",\n \"rank\": 64,\n \"score\": 5.275862159470835\n }\n]","isConversational":false}}},{"rowIdx":1174,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/parser/rfc3501/body.rs"},"repo_name":{"kind":"string","value":"filtsin/rimap"},"commit":{"kind":"string","value":"21954bdd1a848fe4a17e4180552ab4e58027a100"},"file_code":{"kind":"string","value":"\n\nuse super::{core::*, grammar::envelope};\n\nuse crate::parser::types::{\n Body, BodyEnc, BodyFields, BodyTypeBasic, BodyTypeMsg, BodyTypeText, MediaBasic, MediaType,\n};\n\nuse nom::{\n branch::alt,\n bytes::streaming::{tag, tag_no_case},\n combinator::{map, value},\n multi::separated_list1,\n sequence::{delimited, preceded, separated_pair, terminated, tuple},\n IResult,\n};\n\npub(crate) fn body(i: &[u8]) -> IResult<&[u8], Body> {\n todo!()\n}\n\npub(crate) fn body_type_1part(i: &[u8]) -> IResult<&[u8], Body<'_>> {\n todo!()\n}\n\npub(crate) fn body_type_basic(i: &[u8]) -> IResult<&[u8], BodyTypeBasic<'_>> {\n map(\n separated_pair(media_basic, tag(\" \"), body_fields),\n |(media, fields)| BodyTypeBasic { media, fields },\n )(i)\n}\n\npub(crate) fn media_basic(i: &[u8]) -> IResult<&[u8], MediaBasic<'_>> {\n map(\n separated_pair(\n alt((\n delimited(\n tag(\"\\\"\"),\n alt((\n value(MediaType::Application, tag_no_case(\"APPLICATION\")),\n value(MediaType::Audio, tag_no_case(\"AUDIO\")),\n value(MediaType::Image, tag_no_case(\"IMAGE\")),\n value(MediaType::Message, tag_no_case(\"MESSAGE\")),\n value(MediaType::Video, tag_no_case(\"VIDEO\")),\n )),\n tag(\"\\\"\"),\n ),\n map(string, MediaType::Custom),\n )),\n tag(\" \"),\n string,\n ),\n |(media_type, subtype)| MediaBasic {\n media_type,\n subtype,\n },\n )(i)\n}\n\npub(crate) fn body_fields(i: &[u8]) -> IResult<&[u8], BodyFields<'_>> {\n map(\n tuple((\n body_fld_param,\n tag(\" \"),\n nstring,\n tag(\" \"),\n nstring,\n tag(\" \"),\n body_fld_enc,\n tag(\" \"),\n number,\n )),\n |(param, _, id, _, desc, _, enc, _, octets)| BodyFields {\n param,\n id,\n desc,\n enc,\n octets,\n },\n )(i)\n}\n\npub(crate) fn body_fld_param(i: &[u8]) -> IResult<&[u8], Option<Vec<(&str, &str)>>> {\n alt((\n map(\n delimited(\n tag(\"(\"),\n separated_list1(tag(\" \"), separated_pair(string, tag(\" \"), string)),\n tag(\")\"),\n ),\n Some,\n ),\n nil,\n ))(i)\n}\n\npub(crate) fn body_fld_enc(i: &[u8]) -> IResult<&[u8], BodyEnc<'_>> {\n alt((\n delimited(\n tag(\"\\\"\"),\n alt((\n value(BodyEnc::N7bit, tag_no_case(\"7BIT\")),\n value(BodyEnc::N8bit, tag_no_case(\"8BIT\")),\n value(BodyEnc::Binary, tag_no_case(\"BINARY\")),\n value(BodyEnc::Base64, tag_no_case(\"BASE64\")),\n value(BodyEnc::QuotedPrintable, tag_no_case(\"QUOTED-PRINTABLE\")),\n )),\n tag(\"\\\"\"),\n ),\n map(string, BodyEnc::Custom),\n ))(i)\n}\n\npub(crate) fn body_type_msg(i: &[u8]) -> IResult<&[u8], BodyTypeMsg<'_>> {\n map(\n tuple((\n tag_no_case(\"\\\"MESSAGE\\\" \\\"RFC822\\\" \"),\n body_fields,\n tag(\" \"),\n envelope,\n tag(\" \"),\n body,\n tag(\" \"),\n number,\n )),\n |(_, fields, _, envelope, _, body, _, lines)| BodyTypeMsg {\n fields,\n envelope,\n body: Box::new(body),\n lines,\n },\n )(i)\n}\n\npub(crate) fn body_type_text(i: &[u8]) -> IResult<&[u8], BodyTypeText<'_>> {\n map(\n tuple((\n tag_no_case(\"\\\"TEXT\\\" \"),\n string,\n tag(\" \"),\n body_fields,\n tag(\" \"),\n number,\n )),\n |(_, subtype, _, fields, _, lines)| BodyTypeText {\n subtype,\n fields,\n lines,\n },\n )(i)\n}\n\npub(crate) fn body_ext_1part(i: &[u8]) -> IResult<&[u8], ()> {\n todo!()\n}\n\n"},"prefix":{"kind":"string","value":"\n\nuse super::{core::*, grammar::envelope};\n\nuse crate::parser::types::{\n Body, BodyEnc, BodyFields, BodyTypeBasic, BodyTypeMsg, BodyTypeText, MediaBasic, MediaType,\n};\n\nuse nom::{\n branch::alt,\n bytes::streaming::{tag, tag_no_case},\n combinator::{map, value},\n multi::separated_list1,\n sequence::{delimited, preceded, separated_pair, terminated, tuple},\n IResult,\n};\n\npub(crate) fn body(i: &[u8]) -> IResult<&[u8], Body> {\n todo!()\n}\n\npub(crate) fn body_type_1part(i: &[u8]) -> IResult<&[u8], Body<'_>> {\n todo!()\n}\n\npub(crate) fn body_type_basic(i: &[u8]) -> IResult<&[u8], BodyTypeBasic<'_>> {\n map(\n separated_pair(media_basic, tag(\" \"), body_fields),\n |(media, fields)| BodyTypeBasic { media, fields },\n )(i)\n}\n\npub(crate) fn media_basic(i: &[u8]) -> IResult<&[u8], MediaBasic<'_>> {\n map(\n separated_pair(\n alt((\n delimited(\n tag(\"\\\"\"),\n alt((\n value(MediaType::Application, tag_no_case(\"APPLICATION\")),\n value(MediaType::Audio, tag_no_case(\"AUDIO\")),\n value(MediaType::Image, tag_no_case(\"IMAGE\")),\n value(MediaType::Message, tag_no_case(\"MESSAGE\")),\n value(MediaType::Video, tag_no_case(\"VIDEO\")),\n )),\n tag(\"\\\"\"),\n ),\n map(string, MediaType::Custom),\n )),\n tag(\" \"),\n string,\n ),\n |(media_type, subtype)| MediaBasic {\n media_type,\n subtype,\n },\n )(i)\n}\n\npub(crate) fn body_fields(i: &[u8]) -> "},"suffix":{"kind":"string","value":"body: Box::new(body),\n lines,\n },\n )(i)\n}\n\npub(crate) fn body_type_text(i: &[u8]) -> IResult<&[u8], BodyTypeText<'_>> {\n map(\n tuple((\n tag_no_case(\"\\\"TEXT\\\" \"),\n string,\n tag(\" \"),\n body_fields,\n tag(\" \"),\n number,\n )),\n |(_, subtype, _, fields, _, lines)| BodyTypeText {\n subtype,\n fields,\n lines,\n },\n )(i)\n}\n\npub(crate) fn body_ext_1part(i: &[u8]) -> IResult<&[u8], ()> {\n todo!()\n}\n\n"},"middle":{"kind":"string","value":"IResult<&[u8], BodyFields<'_>> {\n map(\n tuple((\n body_fld_param,\n tag(\" \"),\n nstring,\n tag(\" \"),\n nstring,\n tag(\" \"),\n body_fld_enc,\n tag(\" \"),\n number,\n )),\n |(param, _, id, _, desc, _, enc, _, octets)| BodyFields {\n param,\n id,\n desc,\n enc,\n octets,\n },\n )(i)\n}\n\npub(crate) fn body_fld_param(i: &[u8]) -> IResult<&[u8], Option<Vec<(&str, &str)>>> {\n alt((\n map(\n delimited(\n tag(\"(\"),\n separated_list1(tag(\" \"), separated_pair(string, tag(\" \"), string)),\n tag(\")\"),\n ),\n Some,\n ),\n nil,\n ))(i)\n}\n\npub(crate) fn body_fld_enc(i: &[u8]) -> IResult<&[u8], BodyEnc<'_>> {\n alt((\n delimited(\n tag(\"\\\"\"),\n alt((\n value(BodyEnc::N7bit, tag_no_case(\"7BIT\")),\n value(BodyEnc::N8bit, tag_no_case(\"8BIT\")),\n value(BodyEnc::Binary, tag_no_case(\"BINARY\")),\n value(BodyEnc::Base64, tag_no_case(\"BASE64\")),\n value(BodyEnc::QuotedPrintable, tag_no_case(\"QUOTED-PRINTABLE\")),\n )),\n tag(\"\\\"\"),\n ),\n map(string, BodyEnc::Custom),\n ))(i)\n}\n\npub(crate) fn body_type_msg(i: &[u8]) -> IResult<&[u8], BodyTypeMsg<'_>> {\n map(\n tuple((\n tag_no_case(\"\\\"MESSAGE\\\" \\\"RFC822\\\" \"),\n body_fields,\n tag(\" \"),\n envelope,\n tag(\" \"),\n body,\n tag(\" \"),\n number,\n )),\n |(_, fields, _, envelope, _, body, _, lines)| BodyTypeMsg {\n fields,\n envelope,\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn vec_to_string(v: &Vec<u8>) -> String {\n\n std::string::String::from_utf8_lossy(&v[..]).into_owned()\n\n}\n","file_path":"src/error.rs","rank":0,"score":90814.00460926183},{"content":"pub fn create_custom_error(msg: String) -> Error {\n\n Error::Custom(msg)\n\n}\n\n\n","file_path":"src/error.rs","rank":1,"score":51457.04885232965},{"content":"// CHAR8 = %x01-ff;\n\n// any octet except 0\n\nfn is_char8(i: u8) -> bool {\n\n i != 0x00\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":2,"score":51435.4882609334},{"content":"// SP = %x20;\n\n// space\n\nfn is_space(i: u8) -> bool {\n\n i == b' '\n\n}\n\n\n\n// rfc 3501\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":3,"score":51435.4882609334},{"content":"// CHAR = %x01-7F;\n\n// any 7-bit US-ASCII character excluding 0\n\nfn is_char(i: u8) -> bool {\n\n (0x01..=0x7f).contains(&i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":4,"score":51435.4882609334},{"content":"// CTL = %x00-1F;\n\n// controls\n\nfn is_ctl(i: u8) -> bool {\n\n (0x00..=0x1f).contains(&i) || i == 0x7f\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":5,"score":51435.4882609334},{"content":"// resp-specials = ']'\n\nfn is_resp_specials(i: u8) -> bool {\n\n i == b']'\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":6,"score":49640.334941377885},{"content":"// TEXT-CHAR = <any CHAR except CR and LF>\n\nfn is_text_char(i: u8) -> bool {\n\n is_char(i) && i != b'\\r' && i != b'\\n'\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":7,"score":49640.334941377885},{"content":"// quoted-specials = '\"' | '\\'\n\nfn is_quoted_specials(i: u8) -> bool {\n\n i == b'\"' || i == b'\\\\'\n\n}\n\n\n\n// TODO: incorrect 2nd or: '\\' quoted-specials\n\n// QUOTED-CHAR = <any TEXT-CHAR except quoted-specials> | quoted-specials\n\npub(crate) fn is_quoted_char(i: u8) -> bool {\n\n is_quoted_specials(i) || is_text_char(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":8,"score":49640.334941377885},{"content":"// list-wildcards = '%' | '*'\n\nfn is_list_wildcards(i: u8) -> bool {\n\n i == b'%' || i == b'*'\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":9,"score":49640.334941377885},{"content":"// atom-specials = '(' | ')' | '{' | SP | CTL | list-wildcards | quoted-specials | resp-specials\n\nfn is_atom_specials(i: u8) -> bool {\n\n i == b')'\n\n || i == b')'\n\n || i == b'{'\n\n || is_space(i)\n\n || is_ctl(i)\n\n || is_list_wildcards(i)\n\n || is_quoted_specials(i)\n\n || is_resp_specials(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":10,"score":49640.334941377885},{"content":"// ATOM-CHAR = <any CHAR except atom-specials>\n\nfn is_atom_char(i: u8) -> bool {\n\n !is_atom_specials(i) && is_char(i)\n\n}\n\n\n\n// ASTRING-CHAR = ATOM-CHAR | resp-specials\n\npub(crate) fn is_astring_char(i: u8) -> bool {\n\n is_atom_char(i) || is_resp_specials(i)\n\n}\n\n\n\n// nil = 'NIL'\n\npub(crate) fn nil<T>(i: &[u8]) -> IResult<&[u8], Option<T>> {\n\n map(tag_no_case(\"NIL\"), |_| None)(i)\n\n}\n\n\n\n// astring = 1*ASTRING-CHAR | string\n\npub(crate) fn astring(i: &[u8]) -> IResult<&[u8], &str> {\n\n alt((\n\n string,\n\n map_res(take_while1(is_astring_char), std::str::from_utf8),\n\n ))(i)\n","file_path":"src/parser/rfc3501/core.rs","rank":11,"score":49640.334941377885},{"content":"// base64-char = ALPHA | DIGIT | '+' | '/'\n\nfn is_base64_char(i: u8) -> bool {\n\n is_alphanumeric(i) || i == b'+' || i == b'/'\n\n}\n\n\n","file_path":"src/parser/rfc3501/core.rs","rank":12,"score":49640.334941377885},{"content":"#[test]\n\nfn parse_tagged_answer() {\n\n let response = b\"a0017 OK CAPABILITY completed\\r\\n\";\n\n\n\n let result = parse(response).unwrap();\n\n\n\n let tagged_response = ImapResponse::Response(TaggedResponse {\n\n tag: Tag::new('a', 17),\n\n resp: RespCond {\n\n status: ImapResult::Ok,\n\n text: resp_text(\"CAPABILITY completed\"),\n\n },\n\n });\n\n\n\n assert_eq(result, tagged_response);\n\n}\n\n\n","file_path":"src/parser/tests/mod.rs","rank":13,"score":44198.3539516174},{"content":"fn assert_eq((remainder, result): (&[u8], ImapResponse<'_>), target: ImapResponse<'_>) {\n\n assert_eq!(remainder.len(), 0);\n\n assert_eq!(result, target);\n\n}\n\n\n","file_path":"src/parser/tests/mod.rs","rank":14,"score":38050.86559681582},{"content":"//! Imap `tag` declaration\n\n//!\n\n\n\nuse std::{fmt::Display, iter::Iterator};\n\n\n\n/// `Tag` with prefixed letter\n\n/// # Example\n\n/// a1, c1001\n\n#[derive(Eq, PartialEq, Debug, Hash)]\n\npub(crate) struct Tag {\n\n prefix: char,\n\n index: u32,\n\n}\n\n\n\nimpl Tag {\n\n /// Construct new `Tag`\n\n pub(crate) fn new(prefix: char, index: u32) -> Self {\n\n Self { prefix, index }\n\n }\n\n}\n","file_path":"src/tag.rs","rank":15,"score":26659.397993258604},{"content":"\n\nimpl TagGenerator {\n\n /// Construct new TagGenerator\n\n pub fn new(prefix: char, index: u32) -> Self {\n\n TagGenerator { prefix, index }\n\n }\n\n}\n\n\n\nimpl Default for TagGenerator {\n\n fn default() -> Self {\n\n TagGenerator::new('a', 0)\n\n }\n\n}\n\n\n\nimpl Iterator for TagGenerator {\n\n type Item = Tag;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let result = Tag::new(self.prefix, self.index);\n\n self.index += 1;\n\n Some(result)\n\n }\n\n}\n","file_path":"src/tag.rs","rank":16,"score":26658.079722632723},{"content":"\n\nimpl Default for Tag {\n\n fn default() -> Self {\n\n Tag::new('a', 0)\n\n }\n\n}\n\n\n\nimpl Display for Tag {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n write!(f, \"{}{}\", self.prefix, self.index)\n\n }\n\n}\n\n\n\n/// Each client command is prefixed with an identifer and a different tag is\n\n/// generated by the client for each command. Every call `next` method will\n\n/// return an unique `tag` for the command.\n\npub(crate) struct TagGenerator {\n\n prefix: char,\n\n index: u32,\n\n}\n","file_path":"src/tag.rs","rank":17,"score":26657.89364130878},{"content":"#[test]\n\nfn parse_greeting() {\n\n let response = b\"* OK IMAP4rev1 Service Ready\\r\\n\";\n\n\n\n let result = parse(response).unwrap();\n\n\n\n let greeting = ImapResponse::Greeting(Greeting {\n\n status: GreetingStatus::Ok(resp_text(\"IMAP4rev1 Service Ready\")),\n\n });\n\n\n\n assert_eq(result, greeting);\n\n}\n\n\n","file_path":"src/parser/tests/mod.rs","rank":18,"score":24858.14225189695},{"content":"#[test]\n\nfn parse_continue_req() {\n\n let response = b\"+ Ready\\r\\n\";\n\n\n\n let result = parse(response).unwrap();\n\n\n\n let continue_req = ImapResponse::Continue(ContinueReq::Text(resp_text(\"Ready\")));\n\n\n\n assert_eq(result, continue_req);\n\n}\n","file_path":"src/parser/tests/mod.rs","rank":19,"score":23877.14166816756},{"content":"fn resp_text(s: &str) -> RespText<'_> {\n\n RespText {\n\n code: vec![],\n\n text: s,\n\n }\n\n}\n\n\n","file_path":"src/parser/tests/mod.rs","rank":29,"score":20865.059733839662},{"content":" alt((map(string, Some), nil))(i)\n\n}\n\n\n\n// base64-terminal = (2base64-char '==') | (3base64-char '=')\n\npub(crate) fn base64_terminal(i: &[u8]) -> IResult<&[u8], &str> {\n\n map_res(\n\n length_data(many1_count(peek(alt((\n\n tuple((take_while_m_n(2, 2, is_base64_char), tag(\"==\"))),\n\n tuple((take_while_m_n(3, 3, is_base64_char), tag(\"=\"))),\n\n ))))),\n\n std::str::from_utf8,\n\n )(i)\n\n}\n\n\n\n// base64 = *(4base64_char) [base64_terminal]\n\npub(crate) fn base64(i: &[u8]) -> IResult<&[u8], &str> {\n\n // ODO: Check it\n\n map_res(\n\n length_data(many1_count(peek(tuple((\n\n take_while_m_n(4, 4, is_base64_char),\n","file_path":"src/parser/rfc3501/core.rs","rank":30,"score":14.353696146607424},{"content":"//! IMAP core types\n\n\n\nuse std::{fmt::Debug, str::FromStr};\n\n\n\nuse nom::{\n\n branch::alt,\n\n bytes::streaming::{tag, tag_no_case, take_while, take_while1, take_while_m_n},\n\n character::is_alphanumeric,\n\n character::{\n\n is_digit,\n\n streaming::{crlf, u32},\n\n },\n\n combinator::{map, map_res, not, opt, peek, value},\n\n multi::{length_data, many1_count},\n\n sequence::{delimited, tuple},\n\n IResult,\n\n};\n\n\n\n// strings\n\n\n\n// CORE rules from rfc 5234\n\n\n\n// CHAR = %x01-7F;\n\n// any 7-bit US-ASCII character excluding 0\n","file_path":"src/parser/rfc3501/core.rs","rank":31,"score":14.046736221762322},{"content":"pub(crate) mod body;\n\npub(crate) mod core;\n\npub(crate) mod grammar;\n\n\n\nuse self::core::base64;\n\nuse crate::parser::types::{\n\n ContinueReq, Greeting, GreetingStatus, TaggedResponse, UntaggedResponse,\n\n};\n\nuse grammar::{imap_tag, mailbox_data, resp_cond_auth, resp_cond_bye, resp_cond_state, resp_text};\n\nuse nom::{\n\n branch::alt,\n\n bytes::streaming::tag,\n\n character::streaming::crlf,\n\n combinator::map,\n\n sequence::{delimited, tuple},\n\n IResult,\n\n};\n\n\n\n// greeting = \"*\" SP (resp_cond_auth | resp_cond_bye) CRLF\n\npub(crate) fn greeting(i: &[u8]) -> IResult<&[u8], Greeting<'_>> {\n","file_path":"src/parser/rfc3501/mod.rs","rank":32,"score":12.799385372668649},{"content":"//! IMAP grammar [rfc3501]\n\n\n\nuse std::char::from_u32;\n\n\n\nuse super::core::*;\n\nuse crate::parser::types::{\n\n Address, ByeResponse, Capability, DateTime, Envelope, Flag, ImapResult, ListFlag, ListMailBox,\n\n MailBoxData, MessageData, Month, MsgAtt, MsgFlag, RespCond, RespText, RespTextCode, StatusInfo,\n\n StatusResponse, Time,\n\n};\n\nuse crate::tag::Tag;\n\nuse nom::{\n\n branch::alt,\n\n bytes::streaming::{tag, tag_no_case, take_while_m_n},\n\n combinator::{map, map_res, opt, value},\n\n multi::{many0, many1, separated_list0, separated_list1},\n\n sequence::{delimited, preceded, separated_pair, terminated, tuple},\n\n IResult,\n\n};\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":33,"score":12.66106704577743},{"content":"//! IMAP parser implementation\n\n\n\nmod rfc3501;\n\n#[cfg(test)]\n\nmod tests;\n\nmod types;\n\n\n\nuse rfc3501::{continue_req, greeting, response_tagged};\n\nuse types::ImapResponse;\n\n\n\nuse nom::{branch::alt, combinator::map, IResult};\n\n\n\npub(crate) fn parse(i: &[u8]) -> IResult<&[u8], ImapResponse<'_>> {\n\n alt((\n\n map(greeting, |v| ImapResponse::Greeting(v)),\n\n map(continue_req, |v| ImapResponse::Continue(v)),\n\n map(response_tagged, |v| ImapResponse::Response(v)),\n\n ))(i)\n\n}\n","file_path":"src/parser/mod.rs","rank":34,"score":12.512161343474142},{"content":"//mailbox-list = '(' [mbx-list-flags] ')' SP (DQUOTE QUOTED-CHAR DQUOTE | nil) SP mailbox\n\npub(crate) fn mailbox_list(i: &[u8]) -> IResult<&[u8], ListMailBox<'_>> {\n\n map(\n\n tuple((\n\n delimited(tag(\"(\"), opt(mbx_list_flags), tag(\")\")),\n\n tag(\" \"),\n\n alt((\n\n map(\n\n delimited(tag(\"\\\"\"), take_while_m_n(1, 1, is_quoted_char), tag(\"\\\"\")),\n\n Some,\n\n ),\n\n nil,\n\n )),\n\n tag(\" \"),\n\n mailbox,\n\n )),\n\n |(flags, _, delimiter, _, name)| ListMailBox {\n\n flags: match flags {\n\n Some(v) => v,\n\n None => vec![],\n","file_path":"src/parser/rfc3501/grammar.rs","rank":35,"score":11.747442902371848},{"content":" map(capability_data, RespTextCode::Capability)(i)\n\n}\n\n\n\n// 'PARSE'\n\npub(crate) fn rtc_parse(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(tag_no_case(\"PARSE\"), |_| RespTextCode::Parse)(i)\n\n}\n\n\n\n// 'PERMANENTFLAGS' SP '(' [flag-perm *(SP flag-perm)] ')'\n\npub(crate) fn rtc_permanent_flags(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(\n\n delimited(\n\n tag_no_case(\"PERMANENTFLAGS (\"),\n\n // TODO: Use nom::multi::separated_list0 for parsing lists\n\n separated_list0(tag(\" \"), flag_perm),\n\n tag(\")\"),\n\n ),\n\n RespTextCode::PermanentFlags,\n\n )(i)\n\n}\n","file_path":"src/parser/rfc3501/grammar.rs","rank":36,"score":11.665598818009094},{"content":"}\n\n\n\n// quoted = DQUOTE *QUOTED-CHAR DQUOTE;\n\n// quoted text\n\npub(crate) fn quoted(i: &[u8]) -> IResult<&[u8], &str> {\n\n map_res(\n\n delimited(tag(\"\\\"\"), take_while(is_quoted_char), tag(\"\\\"\")),\n\n std::str::from_utf8,\n\n )(i)\n\n}\n\n\n\n// string = quoted | literal\n\n//\n\npub(crate) fn string(i: &[u8]) -> IResult<&[u8], &str> {\n\n alt((quoted, literal))(i)\n\n}\n\n\n\n// nstring = string | nil\n\n// nil = 'NIL'\n\npub(crate) fn nstring(i: &[u8]) -> IResult<&[u8], Option<&str>> {\n","file_path":"src/parser/rfc3501/core.rs","rank":37,"score":11.594160759107721},{"content":" map(\n\n terminated(number, tag_no_case(\" EXISTS\")),\n\n MailBoxData::Exists,\n\n ),\n\n map(\n\n terminated(number, tag_no_case(\" RECENT\")),\n\n MailBoxData::Recent,\n\n ),\n\n ))(i)\n\n}\n\n\n\n//flag-list = '(' [flag *(SP flag)] ')'\n\npub(crate) fn flag_list(i: &[u8]) -> IResult<&[u8], Vec<Flag<'_>>> {\n\n delimited(\n\n tag(\"(\"),\n\n separated_list0(tag(\" \"), map(flag, Flag::from)),\n\n tag(\")\"),\n\n )(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":38,"score":11.29292214372099},{"content":"pub(crate) fn continue_req(i: &[u8]) -> IResult<&[u8], ContinueReq<'_>> {\n\n delimited(\n\n tag(\"+ \"),\n\n alt((\n\n map(resp_text, ContinueReq::Text),\n\n map(base64, ContinueReq::Base64),\n\n )),\n\n crlf,\n\n )(i)\n\n}\n\n\n\n// response-tagged = tag SP resp-cond-state CRLF\n\npub(crate) fn response_tagged(i: &[u8]) -> IResult<&[u8], TaggedResponse<'_>> {\n\n map(\n\n tuple((imap_tag, tag(\" \"), resp_cond_state, crlf)),\n\n |(tag, _, resp, _)| TaggedResponse { tag, resp },\n\n )(i)\n\n}\n\n\n\n//response-data = '*' SP (resp-cond-state | resp-cond-bye | mailbox-data |\n","file_path":"src/parser/rfc3501/mod.rs","rank":39,"score":11.086139566598682},{"content":"\n\n// zone = ('+' | '-') 4DIGIT\n\npub(crate) fn zone(i: &[u8]) -> IResult<&[u8], i16> {\n\n map(\n\n tuple((alt((tag(\"+\"), tag(\"-\"))), fixed_num(4))),\n\n |(sign, mut value): (_, i16)| {\n\n if sign == b\"-\" {\n\n value *= -1;\n\n }\n\n\n\n value\n\n },\n\n )(i)\n\n}\n\n\n\n//mailbox-data = 'FLAGS' SP flag-list | 'LIST' SP mailbox-list | 'LSUB' SP mailbox-list |\n\n// 'SEARCH' *(SP nz-number) | 'STATUS' SP mailbox SP '(' [status-att-list] ')' |\n\n// number SP 'EXISTS' | number SP 'RECENT'\n\npub(crate) fn mailbox_data(i: &[u8]) -> IResult<&[u8], MailBoxData<'_>> {\n\n alt((\n","file_path":"src/parser/rfc3501/grammar.rs","rank":40,"score":10.785594671571086},{"content":"// auth-type = atom\n\npub(crate) fn auth_type(i: &[u8]) -> IResult<&[u8], &str> {\n\n // TODO: Create enum for auth type\n\n atom(i)\n\n}\n\n\n\n// capability-data = \"CAPABILITY\" *(SP CAPABILITY) SP \"IMAP4rev1\" *(SP capability)\n\npub(crate) fn capability_data(i: &[u8]) -> IResult<&[u8], Vec<Capability<'_>>> {\n\n // Grammar is not exactly as in rfc3501.\n\n // Just take all capabilities delimited by space\n\n // hoping that IMAP4rev1 is present\n\n map(\n\n tuple((\n\n tag_no_case(\"CAPABILITY\"),\n\n many1(map(tuple((tag(\" \"), capability)), |(_, data)| data)),\n\n )),\n\n |(_, capability)| capability,\n\n )(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":41,"score":10.744016142163256},{"content":" ))(i)\n\n}\n\n\n\n// resp-text = [ \"[\" resp-text-code \"]\" SP ] text\n\npub(crate) fn resp_text(i: &[u8]) -> IResult<&[u8], RespText<'_>> {\n\n map(\n\n tuple((many0(delimited(tag(\"[\"), resp_text_code, tag(\"] \"))), text)),\n\n |(code, text)| RespText { code, text },\n\n )(i)\n\n}\n\n\n\n// resp-cond-auth = (\"OK\" | \"PREAUTH\") SP resp-text;\n\n// Authentication condition\n\npub(crate) fn resp_cond_auth(i: &[u8]) -> IResult<&[u8], (&str, RespText<'_>)> {\n\n map(\n\n separated_pair(\n\n alt((tag_no_case(\"OK\"), tag_no_case(\"PREAUTH\"))),\n\n tag(\" \"),\n\n resp_text,\n\n ),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":42,"score":10.265462414935055},{"content":"// Status condition\n\npub(crate) fn resp_cond_state(i: &[u8]) -> IResult<&[u8], RespCond<'_>> {\n\n map(\n\n separated_pair(\n\n alt((\n\n value(ImapResult::Ok, tag_no_case(\"OK\")),\n\n value(ImapResult::No, tag_no_case(\"NO\")),\n\n value(ImapResult::Bad, tag_no_case(\"BAD\")),\n\n )),\n\n tag(\" \"),\n\n resp_text,\n\n ),\n\n |(status, text)| RespCond { status, text },\n\n )(i)\n\n}\n\n\n\n// flag-keyword = atom\n\npub(crate) fn flag_keyword(i: &[u8]) -> IResult<&[u8], &str> {\n\n atom(i)\n\n}\n","file_path":"src/parser/rfc3501/grammar.rs","rank":43,"score":10.077958772237618},{"content":"}\n\n\n\n// flag-fetch = flag | '\\Recent'\n\npub(crate) fn flag_fetch(i: &[u8]) -> IResult<&[u8], MsgFlag<'_>> {\n\n alt((\n\n map(flag, |v| MsgFlag::Common(Flag::from(v))),\n\n map(tag_no_case(\"\\\\Recent\"), |_| MsgFlag::Recent),\n\n ))(i)\n\n}\n\n\n\n// msg-att-static = 'ENVELOPE' SP envelope | \"INTERNALDATE\" SP date-time |\n\n// 'RFC822' ['.HEADER' | '.TEXT'] SP nstring |\n\n// 'RFC822.SIZE' SP number | 'BODY' ['STRUCTURE'] SP body |\n\n// 'BODY' section ['<' number '>'] SP nstring |\n\n// 'UID' SP uniqueid\n\n// ; Must not change for a message\n\npub(crate) fn msg_att_static(i: &[u8]) -> IResult<&[u8], MsgAtt<'_>> {\n\n alt((\n\n map(\n\n preceded(tag_no_case(\"ENVELOPE \"), envelope),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":44,"score":9.743547309966667},{"content":"\n\n// flag-extension = '\\' atom;\n\n// Future expansion\n\npub(crate) fn flag_extension(i: &[u8]) -> IResult<&[u8], &str> {\n\n // TODO: incorrect removing suffix '\\'\n\n map(tuple((tag(\"\\\\\"), atom)), |(_, result)| result)(i)\n\n}\n\n\n\n// TODO: Change return type because Flag must not contain Perm\n\n// flag-perm = flag | '\\*'\n\npub(crate) fn flag_perm(i: &[u8]) -> IResult<&[u8], Flag<'_>> {\n\n map(flag, Flag::from)(i)\n\n}\n\n\n\n// flag = '\\Answered' | '\\Flagged' | '\\Deleted' | '\\Seen' | '\\Draft' | flag_keyword | flag_extension\n\npub(crate) fn flag(i: &[u8]) -> IResult<&[u8], &str> {\n\n // \\Answered, \\Flagged are handle by flag_extension parser\n\n alt((flag_extension, flag_keyword))(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":45,"score":9.623681244970047},{"content":"// date-day-fixed = (SP DIGIT) | 2DIGIT\n\npub(crate) fn date_day_fixed(i: &[u8]) -> IResult<&[u8], u8> {\n\n alt((preceded(tag(\" \"), fixed_num(1)), fixed_num(2)))(i)\n\n}\n\n\n\n// date-month = 'Jan' | 'Feb' | 'Mar' | 'Apr' | 'May' | 'Jun' | 'Jul' | 'Aug' |\n\n// 'Sep' | 'Oct' | 'Nov' | 'Dec'\n\npub(crate) fn date_month(i: &[u8]) -> IResult<&[u8], Month> {\n\n alt((\n\n value(Month::Jan, tag_no_case(\"Jan\")),\n\n value(Month::Feb, tag_no_case(\"Feb\")),\n\n value(Month::Mar, tag_no_case(\"Mar\")),\n\n value(Month::Apr, tag_no_case(\"Apr\")),\n\n value(Month::May, tag_no_case(\"May\")),\n\n value(Month::Jun, tag_no_case(\"Jun\")),\n\n value(Month::Jul, tag_no_case(\"Jul\")),\n\n value(Month::Aug, tag_no_case(\"Aug\")),\n\n value(Month::Sep, tag_no_case(\"Sep\")),\n\n value(Month::Oct, tag_no_case(\"Oct\")),\n\n value(Month::Nov, tag_no_case(\"Nov\")),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":46,"score":9.611526596130524},{"content":"// capability = ('AUTH=' auth-type) | atom;\n\npub(crate) fn capability(i: &[u8]) -> IResult<&[u8], Capability<'_>> {\n\n let auth_parser = map(\n\n tuple((tag_no_case(\"AUTH=\"), auth_type)),\n\n |(_, auth_type)| auth_type,\n\n );\n\n\n\n alt((\n\n map(auth_parser, Capability::Auth),\n\n map(atom, Capability::Other),\n\n ))(i)\n\n}\n\n\n\n// resp-text-code branches\n\n\n\n// 'ALERT'\n\npub(crate) fn rtc_alert(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(tag_no_case(\"ALERT\"), |_| RespTextCode::Alert)(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":47,"score":9.549120394524223},{"content":" value(Month::Dec, tag_no_case(\"Dec\")),\n\n ))(i)\n\n}\n\n\n\n// date-year = 4DIGIT\n\npub(crate) fn date_year(i: &[u8]) -> IResult<&[u8], u16> {\n\n fixed_num(4)(i)\n\n}\n\n\n\n// time = 2DIGIT ':' 2DIGIT ':' 2DIGIT\n\npub(crate) fn time(i: &[u8]) -> IResult<&[u8], Time> {\n\n map(\n\n tuple((fixed_num(2), tag(\":\"), fixed_num(2), tag(\":\"), fixed_num(2))),\n\n |(hours, _, minutes, _, seconds)| Time {\n\n hours,\n\n minutes,\n\n seconds,\n\n },\n\n )(i)\n\n}\n","file_path":"src/parser/rfc3501/grammar.rs","rank":48,"score":9.345305891641502},{"content":"// message-data | capability-data) CRLF\n\npub(crate) fn response_data(i: &[u8]) -> IResult<&[u8], UntaggedResponse<'_>> {\n\n delimited(\n\n tag(\"* \"),\n\n alt((\n\n map(resp_cond_state, UntaggedResponse::RespCond),\n\n map(resp_cond_bye, UntaggedResponse::RespBye),\n\n map(mailbox_data, UntaggedResponse::MailBox),\n\n )),\n\n crlf,\n\n )(i)\n\n}\n","file_path":"src/parser/rfc3501/mod.rs","rank":49,"score":9.239328833473088},{"content":" )),\n\n tag(\")\"),\n\n ),\n\n |(name, _, adl, _, mailbox, _, host)| Address {\n\n name,\n\n adl,\n\n mailbox,\n\n host,\n\n },\n\n )(i)\n\n}\n\n\n\n// date-time = DQUOTE date-day-fixed '-' date-month '-' date-year SP time SP zone DQUOTE\n\npub(crate) fn date_time(i: &[u8]) -> IResult<&[u8], DateTime> {\n\n map(\n\n delimited(\n\n tag(\"\\\"\"),\n\n tuple((\n\n date_day_fixed,\n\n tag(\"-\"),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":50,"score":9.091962249782393},{"content":" },\n\n // SAFETY: is_quoted_char is valid ascii character, so it is valid utf-8\n\n delimiter: unsafe { delimiter.map(|v| std::str::from_utf8_unchecked(v)) },\n\n name,\n\n },\n\n )(i)\n\n}\n\n\n\n// *(SP nz-number)\n\npub(crate) fn mailbox_data_search(i: &[u8]) -> IResult<&[u8], Vec<u32>> {\n\n separated_list1(tag(\" \"), nz_number)(i)\n\n}\n\n\n\n// mailbox SP '(' [status-att-list] ')'\n\npub(crate) fn mailbox_data_status(i: &[u8]) -> IResult<&[u8], StatusResponse<'_>> {\n\n map(\n\n separated_pair(\n\n mailbox,\n\n tag(\" \"),\n\n delimited(tag(\"(\"), opt(status_att_list), tag(\")\")),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":51,"score":8.957451511144},{"content":"// 'BADCHARSET' [SP '(' astring *(SP astring) ')']\n\npub(crate) fn rtc_bad_charset(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(\n\n preceded(\n\n tag_no_case(\"BADCHARSET\"),\n\n opt(delimited(\n\n tag(\" (\"),\n\n many1(terminated(astring, opt(tag(\" \")))),\n\n tag(\")\"),\n\n )),\n\n ),\n\n |v| match v {\n\n Some(v) => RespTextCode::BadCharset(v),\n\n None => RespTextCode::BadCharset(vec![]),\n\n },\n\n )(i)\n\n}\n\n\n\n// capability-data\n\npub(crate) fn rtc_capability_data(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n","file_path":"src/parser/rfc3501/grammar.rs","rank":52,"score":8.926121260113115},{"content":" to,\n\n cc,\n\n bcc,\n\n in_reply_to,\n\n message_id,\n\n },\n\n )(i)\n\n}\n\n\n\n// '(' 1*address ')' | nil\n\npub(crate) fn envelope_addr(i: &[u8]) -> IResult<&[u8], Option<Vec<Address<'_>>>> {\n\n alt((\n\n map(delimited(tag(\"(\"), many1(address), tag(\")\")), Some),\n\n nil,\n\n ))(i)\n\n}\n\n\n\n// address = '(' addr-name SP addr-adl SP addr-mailbox SP addr-host ')'\n\n//\n\n// addr-name = nstring\n","file_path":"src/parser/rfc3501/grammar.rs","rank":53,"score":8.907717994742079},{"content":" ListFlag::from(s)\n\n },\n\n )(i)\n\n}\n\n\n\n// tag(rfc) = 1*<any ASTRING-CHAR except '+'>\n\n// tag(this) = ASTRING-CHAR number\n\n// We use our own (tag)[tag::Tag] definition of tag\n\n// with one prefix letter and u32 id\n\npub(crate) fn imap_tag(i: &[u8]) -> IResult<&[u8], Tag> {\n\n map(\n\n tuple((take_while_m_n(1, 1, is_astring_char), number)),\n\n |(letter, index)| {\n\n let prefix = from_u32(letter[0] as u32).unwrap();\n\n Tag::new(prefix, index)\n\n },\n\n )(i)\n\n}\n\n\n\n// resp-cond-state = (\"OK\" | \"NO\" | \"BAD\") SP resp_text;\n","file_path":"src/parser/rfc3501/grammar.rs","rank":54,"score":8.889719544080991},{"content":"//message-data = nz-number SP (\"EXPUNGE\" | (\"FETCH\" SP msg-att))\n\npub(crate) fn message_data(i: &[u8]) -> IResult<&[u8], MessageData<'_>> {\n\n todo!()\n\n}\n\n\n\n// msg_att = '(' (msg-att-dynamic | msg-att-static) *(SP (msg-att-dynamic | msg-att-static)) ')'\n\npub(crate) fn msg_att(i: &[u8]) -> IResult<&[u8], MsgAtt<'_>> {\n\n todo!()\n\n}\n\n\n\n// msg-att-dynamic = 'FLAGS' SP '(' [flag-fetch *(SP flag-fetch)] ')'\n\n// ; May change for a message\n\npub(crate) fn msg_att_dynamic(i: &[u8]) -> IResult<&[u8], MsgAtt<'_>> {\n\n map(\n\n preceded(\n\n tag_no_case(\"FLAGS \"),\n\n delimited(tag(\"(\"), separated_list1(tag(\" \"), flag_fetch), tag(\")\")),\n\n ),\n\n MsgAtt::Flags,\n\n )(i)\n","file_path":"src/parser/rfc3501/grammar.rs","rank":55,"score":8.373020674484083},{"content":" alt((\n\n map_res(tag_no_case(\"\\\\Noinferiors\"), std::str::from_utf8),\n\n flag_extension,\n\n )),\n\n ListFlag::from,\n\n )(i)\n\n}\n\n\n\n//mbx-list-sflag = '\\Noselect' | '\\Marked' | '\\Unmarked'\n\n// Selectability flags; only one per LIST response\n\npub(crate) fn mbx_list_sflag(i: &[u8]) -> IResult<&[u8], ListFlag<'_>> {\n\n map(\n\n alt((\n\n tag_no_case(\"\\\\Noselect\"),\n\n tag_no_case(\"\\\\Marked\"),\n\n tag_no_case(\"\\\\Unmarked\"),\n\n )),\n\n |flag| {\n\n // SAFETY: flag is \\Noselect, \\Marked or \\Unmarked ASCII texts, so it is valid UTF-8\n\n let s = unsafe { std::str::from_utf8_unchecked(flag) };\n","file_path":"src/parser/rfc3501/grammar.rs","rank":56,"score":7.833111215328197},{"content":"// ; If non-NIL holds pharse from [RFC-2822] mailbox after removing quoting\n\n// addr-adl = nstring\n\n// ; Holds route from route-addr if non-NIL\n\n// addr-mailbox = nstring\n\n// ; NIL indicates end of group; if non-NIL and addr-host is NIL, holds group name\n\n// ; Otherwise, holds local-part after removing quoting\n\n// addr-host = nstring\n\n// ; NIL indicates group syntax. Otherwise, holds domain name\n\npub(crate) fn address(i: &[u8]) -> IResult<&[u8], Address<'_>> {\n\n map(\n\n delimited(\n\n tag(\"(\"),\n\n tuple((\n\n nstring,\n\n tag(\" \"),\n\n nstring,\n\n tag(\" \"),\n\n nstring,\n\n tag(\" \"),\n\n nstring,\n","file_path":"src/parser/rfc3501/grammar.rs","rank":57,"score":7.558531480954739},{"content":"}\n\n\n\n// atom = 1*ATOM-CHAR\n\npub(crate) fn atom(i: &[u8]) -> IResult<&[u8], &str> {\n\n map_res(take_while1(is_atom_char), std::str::from_utf8)(i)\n\n}\n\n\n\n// literal = \"{\" number \"}\" CRLF *CHAR8;\n\n// number represents the number of CHAR8s\n\npub(crate) fn literal(i: &[u8]) -> IResult<&[u8], &str> {\n\n let (i, (_, count, _, _)) = tuple((tag(\"{\"), number, tag(\"}\"), crlf))(i)?;\n\n let parser = take_while_m_n(count as usize, count as usize, is_char8);\n\n\n\n map_res(parser, std::str::from_utf8)(i)\n\n}\n\n\n\n// text = 1*TEXT-CHAR\n\n//\n\npub(crate) fn text(i: &[u8]) -> IResult<&[u8], &str> {\n\n map_res(take_while1(is_text_char), std::str::from_utf8)(i)\n","file_path":"src/parser/rfc3501/core.rs","rank":58,"score":7.481104187495063},{"content":"}\n\n\n\n// envelope = '(' env-date SP env-subject SP env-from SP env-sender\n\n// SP env-reply-to SP env-to SP env-cc SP env-bcc SP env-in-reply-to\n\n// SP env-message-id ')'\n\n// env-date, env-subject, env-in-reply-to, env-message-id = nstring\n\n// env-from, env-sender, env-reply-to, env-to, env-cc, env-bcc = '(' 1*address ')' | nil\n\npub(crate) fn envelope(i: &[u8]) -> IResult<&[u8], Envelope<'_>> {\n\n map(\n\n delimited(\n\n tag(\"(\"),\n\n tuple((\n\n nstring,\n\n tag(\" \"),\n\n nstring,\n\n tag(\" \"),\n\n envelope_addr,\n\n tag(\" \"),\n\n envelope_addr,\n\n tag(\" \"),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":59,"score":7.414224337037648},{"content":"pub(crate) struct MediaBasic<'a> {\n\n pub(crate) media_type: MediaType<'a>,\n\n pub(crate) subtype: &'a str,\n\n}\n\n\n\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\n\npub(crate) enum BodyEnc<'a> {\n\n N7bit,\n\n N8bit,\n\n Binary,\n\n Base64,\n\n QuotedPrintable,\n\n Custom(&'a str),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct BodyFields<'a> {\n\n pub(crate) param: Option<Vec<(&'a str, &'a str)>>,\n\n pub(crate) id: Option<&'a str>,\n\n pub(crate) desc: Option<&'a str>,\n","file_path":"src/parser/types.rs","rank":60,"score":7.390714252378748},{"content":" pub(crate) enc: BodyEnc<'a>,\n\n pub(crate) octets: u32,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct BodyTypeBasic<'a> {\n\n pub(crate) media: MediaBasic<'a>,\n\n pub(crate) fields: BodyFields<'a>,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct BodyTypeMsg<'a> {\n\n pub(crate) fields: BodyFields<'a>,\n\n pub(crate) envelope: Envelope<'a>,\n\n pub(crate) body: Box<Body<'a>>,\n\n pub(crate) lines: u32,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct BodyTypeText<'a> {\n","file_path":"src/parser/types.rs","rank":61,"score":7.3420149283324925},{"content":" opt(base64_terminal),\n\n ))))),\n\n std::str::from_utf8,\n\n )(i)\n\n}\n\n\n\n// numbers\n\n\n\n// number = 1*DIGIT;\n\n// unsigned 32-bit integer\n\npub(crate) fn number(i: &[u8]) -> IResult<&[u8], u32> {\n\n u32(i)\n\n}\n\n\n\n// nz-number = digit-nz *DIGIT;\n\n// non-zero unsigned 32-bit integer\n\npub(crate) fn nz_number(i: &[u8]) -> IResult<&[u8], u32> {\n\n let (i, (_, result)) = tuple((not(tag(\"0\")), number))(i)?;\n\n Ok((i, result))\n\n}\n","file_path":"src/parser/rfc3501/core.rs","rank":62,"score":7.238544951129705},{"content":" )(i)\n\n}\n\n\n\n// 'Unseen' SP number\n\npub(crate) fn status_unseen(i: &[u8]) -> IResult<&[u8], StatusInfo> {\n\n map(\n\n preceded(tag_no_case(\"UNSEEN \"), nz_number),\n\n StatusInfo::Unseen,\n\n )(i)\n\n}\n\n\n\n// TODO! Incorrect\n\n// status-att-list = status-att SP number *(SP status-att SP number)\n\n// status-att = 'MESSAGES' | 'RECENT' | 'UIDNEXT' | 'UIDVALIDITY' | 'UNSEEN'\n\npub(crate) fn status_att_list(i: &[u8]) -> IResult<&[u8], Vec<StatusInfo>> {\n\n many1(alt((\n\n status_messages,\n\n status_recent,\n\n status_uidnext,\n\n status_uidvalidity,\n","file_path":"src/parser/rfc3501/grammar.rs","rank":63,"score":7.1642252519453145},{"content":" map(\n\n delimited(\n\n tag(\"* \"),\n\n alt((\n\n map(resp_cond_auth, |(status, resp_text)| {\n\n if status == \"OK\" {\n\n GreetingStatus::Ok(resp_text)\n\n } else {\n\n GreetingStatus::Preauth(resp_text)\n\n }\n\n }),\n\n map(resp_cond_bye, GreetingStatus::Bye),\n\n )),\n\n crlf,\n\n ),\n\n |status| Greeting { status },\n\n )(i)\n\n}\n\n\n\n// continue-req = '+' SP (resp-text | base64) CRLF\n","file_path":"src/parser/rfc3501/mod.rs","rank":64,"score":7.097529669074544},{"content":"\n\n// 'READ-ONLY'\n\npub(crate) fn rtc_read_only(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(tag_no_case(\"READ-ONLY\"), |_| RespTextCode::ReadOnly)(i)\n\n}\n\n\n\n// 'READ-WRITE'\n\npub(crate) fn rtc_read_write(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(tag_no_case(\"READ-WRITE\"), |_| RespTextCode::ReadWrite)(i)\n\n}\n\n\n\n// 'TRYCREATE'\n\npub(crate) fn rtc_try_create(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(tag_no_case(\"TRYCREATE\"), |_| RespTextCode::TryCreate)(i)\n\n}\n\n\n\n// 'UIDNEXT' SP nz-number\n\npub(crate) fn rtc_uidnext(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(\n\n preceded(tag_no_case(\"UIDNEXT \"), nz_number),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":65,"score":7.086661600378328},{"content":" pub(crate) subtype: &'a str,\n\n pub(crate) fields: BodyFields<'a>,\n\n pub(crate) lines: u32,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct BodyExt1Part<'a> {\n\n md5: Option<&'a str>,\n\n}\n","file_path":"src/parser/types.rs","rank":66,"score":6.964096763757909},{"content":"pub(crate) fn status_recent(i: &[u8]) -> IResult<&[u8], StatusInfo> {\n\n map(\n\n preceded(tag_no_case(\"RECENT \"), nz_number),\n\n StatusInfo::Recent,\n\n )(i)\n\n}\n\n\n\n// 'UIDNEXT' SP number\n\npub(crate) fn status_uidnext(i: &[u8]) -> IResult<&[u8], StatusInfo> {\n\n map(\n\n preceded(tag_no_case(\"UIDNEXT \"), nz_number),\n\n StatusInfo::UidNext,\n\n )(i)\n\n}\n\n\n\n// 'UIDVALIDITY' SP number\n\npub(crate) fn status_uidvalidity(i: &[u8]) -> IResult<&[u8], StatusInfo> {\n\n map(\n\n preceded(tag_no_case(\"UIDVALIDITY \"), nz_number),\n\n StatusInfo::UidValidity,\n","file_path":"src/parser/rfc3501/grammar.rs","rank":67,"score":6.928742682711048},{"content":"//!\n\nuse crate::error::Result;\n\nuse crate::tag::{Tag, TagGenerator};\n\nuse futures::stream::SplitSink;\n\nuse futures::{SinkExt, StreamExt};\n\nuse log::trace;\n\nuse std::collections::HashMap;\n\nuse std::sync::Arc;\n\nuse tokio::sync::mpsc::Sender;\n\nuse tokio::{\n\n net::{TcpStream, ToSocketAddrs},\n\n task::JoinHandle,\n\n};\n\nuse tokio_util::codec::{Decoder, Framed, LinesCodec};\n\n\n\n/// An async tcp stream.\n\n/// The `ImapConnection` serves to register a request to the server\n\n/// and receive a response.\n\n///\n\n/// All requests for the server saved as ([Tag](Tag) - Channel) match.\n","file_path":"src/imapconnection.rs","rank":68,"score":6.87439261298945},{"content":" RespTextCode::UidNext,\n\n )(i)\n\n}\n\n\n\n// 'UIDVALIDITY' SP nz-number\n\npub(crate) fn rtc_uidvalidity(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(\n\n preceded(tag_no_case(\"UIDVALIDITY \"), nz_number),\n\n RespTextCode::UidValidity,\n\n )(i)\n\n}\n\n\n\n// 'UNSEEN' SP nz-number\n\npub(crate) fn rtc_unseen(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n map(\n\n preceded(tag_no_case(\"UNSEEN \"), nz_number),\n\n RespTextCode::Unseen,\n\n )(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":69,"score":6.1685133551729106},{"content":" |(status, resp_text)| {\n\n // SAFETY: status is \"OK\" either \"PREAUTH\" strings, so it is valid utf-8\n\n let status = unsafe { std::str::from_utf8_unchecked(status) };\n\n (status, resp_text)\n\n },\n\n )(i)\n\n}\n\n\n\n// resp-cond-bye = \"BYE\" SP resp-text\n\npub(crate) fn resp_cond_bye(i: &[u8]) -> IResult<&[u8], ByeResponse<'_>> {\n\n map(preceded(tag_no_case(\"BYE \"), resp_text), |resp| {\n\n ByeResponse { resp }\n\n })(i)\n\n}\n","file_path":"src/parser/rfc3501/grammar.rs","rank":70,"score":6.068794519806133},{"content":"\n\n// Help function for syntax like mDIGIT\n\npub(crate) fn fixed_num<T: FromStr>(m: usize) -> impl Fn(&[u8]) -> IResult<&[u8], T>\n\nwhere\n\n <T as FromStr>::Err: Debug,\n\n{\n\n move |i: &[u8]| {\n\n // SAFETY: v is slice of DIGIT('0' - '9') so it's valid utf-8\n\n map(take_while_m_n(m, m, is_digit), |v| unsafe {\n\n std::str::from_utf8_unchecked(v).parse().unwrap()\n\n })(i)\n\n }\n\n}\n","file_path":"src/parser/rfc3501/core.rs","rank":71,"score":5.821950730576054},{"content":"\n\n let subscriptions = Arc::new(HashMap::new());\n\n\n\n let future = tokio::spawn(async move {\n\n loop {\n\n let buf = stream.next().await.unwrap();\n\n trace!(\"S: {:?}\", buf);\n\n\n\n // Get in subs sender half by tag\n\n }\n\n });\n\n\n\n Ok(Self {\n\n sink,\n\n subscriptions,\n\n generator: TagGenerator::default(),\n\n cancel: future,\n\n })\n\n }\n\n\n\n async fn send(&mut self, data: String) {\n\n // Save subscription by tag to subscriptions map\n\n self.sink.send(data).await.unwrap()\n\n }\n\n}\n","file_path":"src/imapconnection.rs","rank":72,"score":5.660305819057216},{"content":" status_unseen,\n\n )))(i)\n\n}\n\n\n\n//mailbox = 'INBOX' | astring\n\npub(crate) fn mailbox(i: &[u8]) -> IResult<&[u8], &str> {\n\n astring(i)\n\n}\n\n\n\n//mbx-list-flags = *(mbx-list-oflag SP) mbx-list-sflag *(SP mbx-list-oflag) |\n\n// mbx-list-oflag *(SP mbx-list-oflag)\n\npub(crate) fn mbx_list_flags(i: &[u8]) -> IResult<&[u8], Vec<ListFlag<'_>>> {\n\n // Allow multiple mbx-list-sflag for easy writing of parser, it is not lethal\n\n separated_list1(tag(\" \"), alt((mbx_list_oflag, mbx_list_sflag)))(i)\n\n}\n\n\n\n//mbx-list-oflag = '\\Noinferiors' | flag-extension;\n\n// Other flags; multiple possible per LIST response\n\npub(crate) fn mbx_list_oflag(i: &[u8]) -> IResult<&[u8], ListFlag<'_>> {\n\n map(\n","file_path":"src/parser/rfc3501/grammar.rs","rank":73,"score":5.367071427760991},{"content":" MsgAtt::Envelope,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"INTERNALDATE \"), date_time),\n\n MsgAtt::InternalDate,\n\n ),\n\n map(preceded(tag_no_case(\"RFC822 \"), nstring), MsgAtt::Rfc822),\n\n map(\n\n preceded(tag_no_case(\"RFC822.HEADER \"), nstring),\n\n MsgAtt::Rfc822Header,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"RFC822.TEXT \"), nstring),\n\n MsgAtt::Rfc822Text,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"RFC822.SIZE \"), number),\n\n MsgAtt::Rfc822Size,\n\n ),\n\n ))(i)\n","file_path":"src/parser/rfc3501/grammar.rs","rank":74,"score":5.276093757361263},{"content":" ),\n\n |(name, status)| {\n\n let status = match status {\n\n Some(v) => v,\n\n None => vec![],\n\n };\n\n StatusResponse { name, status }\n\n },\n\n )(i)\n\n}\n\n\n\n// 'MESSAGES' SP number\n\npub(crate) fn status_messages(i: &[u8]) -> IResult<&[u8], StatusInfo> {\n\n map(\n\n preceded(tag_no_case(\"MESSAGES \"), nz_number),\n\n StatusInfo::Messages,\n\n )(i)\n\n}\n\n\n\n// 'RECENT' SP number\n","file_path":"src/parser/rfc3501/grammar.rs","rank":75,"score":5.258714595369732},{"content":" map(\n\n preceded(tag_no_case(\"FLAGS \"), flag_list),\n\n MailBoxData::Flags,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"LIST \"), mailbox_list),\n\n MailBoxData::List,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"LSUB \"), mailbox_list),\n\n MailBoxData::Lsub,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"SEARCH \"), mailbox_data_search),\n\n MailBoxData::Search,\n\n ),\n\n map(\n\n preceded(tag_no_case(\"STATUS \"), mailbox_data_status),\n\n MailBoxData::Status,\n\n ),\n","file_path":"src/parser/rfc3501/grammar.rs","rank":76,"score":5.251363999885935},{"content":"//!\n\n\n\nuse crate::tag::Tag;\n\nuse std::convert::TryFrom;\n\n\n\nuse crate::error::{create_custom_error, Error};\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum ImapResponse<'a> {\n\n Greeting(Greeting<'a>),\n\n Continue(ContinueReq<'a>),\n\n Response(TaggedResponse<'a>),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq, Clone)]\n\npub(crate) enum ImapResult {\n\n Ok,\n\n Bad,\n\n No,\n\n}\n","file_path":"src/parser/types.rs","rank":77,"score":5.097452461173988},{"content":"/// If the tagged response was received, we'll get Channel by the `Tag`\n\n/// and send parsed response into it.\n\n///\n\n/// We can wait multiple responses at one time in multiple threads\n\n/// because we can analyze received tag and find the corresponding Channel.\n\npub(crate) struct ImapConnection {\n\n sink: SplitSink<Framed<TcpStream, LinesCodec>, String>,\n\n subscriptions: Arc<HashMap<Tag, Sender<String>>>,\n\n generator: TagGenerator,\n\n // Cancel background listener future\n\n cancel: JoinHandle<()>,\n\n}\n\n\n\nimpl ImapConnection {\n\n async fn connect<A: ToSocketAddrs>(addr: A) -> Result<Self> {\n\n let connection = TcpStream::connect(addr).await?;\n\n\n\n let frame = LinesCodec::default().framed(connection);\n\n\n\n let (sink, mut stream) = frame.split();\n","file_path":"src/imapconnection.rs","rank":78,"score":4.98959282488644},{"content":"use crate::{\n\n parser::{\n\n parse,\n\n types::{\n\n ContinueReq, Greeting, GreetingStatus, ImapResponse, ImapResult, RespCond, RespText,\n\n TaggedResponse,\n\n },\n\n },\n\n tag::Tag,\n\n};\n\n\n","file_path":"src/parser/tests/mod.rs","rank":79,"score":4.965374479703505},{"content":"//! Error type\n\n\n\nuse thiserror::Error;\n\n\n\n/// A convenience wrapper around `Result` for [Error][Error]\n\npub type Result<T> = std::result::Result<T, Error>;\n\n\n\n/// A set of errors\n\n#[non_exhaustive]\n\n#[derive(Error, Debug)]\n\npub enum Error {\n\n /// Fail write or read to a network stream\n\n #[error(\"An IO error\")]\n\n Io(#[from] std::io::Error),\n\n /// Error with custom message\n\n #[error(\"An error has occured: {0}\")]\n\n Custom(String),\n\n #[error(\"Parser error [slice: {0:?}, str: {}]\", vec_to_string(.0))]\n\n Parser(Vec<u8>),\n\n}\n\n\n","file_path":"src/error.rs","rank":80,"score":4.718507492032698},{"content":" pub(crate) zone: i16,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum Body<'a> {\n\n Basic(BodyTypeBasic<'a>),\n\n Msg(BodyTypeMsg<'a>),\n\n}\n\n\n\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\n\npub(crate) enum MediaType<'a> {\n\n Application,\n\n Audio,\n\n Image,\n\n Message,\n\n Video,\n\n Custom(&'a str),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n","file_path":"src/parser/types.rs","rank":81,"score":4.460190273694162},{"content":" \"\\\\Seen\" => Ok(Self::Seen),\n\n \"\\\\Answred\" => Ok(Self::Answered),\n\n \"\\\\Flagged\" => Ok(Self::Flagged),\n\n \"\\\\Deleted\" => Ok(Self::Deleted),\n\n \"\\\\Draft\" => Ok(Self::Draft),\n\n \"\\\\Recent\" => Ok(Self::Recent),\n\n _ => Err(create_custom_error(format!(\n\n \"Can not convert {} into DefinedFlag\",\n\n value\n\n ))),\n\n }\n\n }\n\n}\n\n\n\n// TODO: Flag should be without Perm branch\n\n// Perm branch used only for resp_text_code\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum Flag<'a> {\n\n Defined(DefinedFlag),\n\n Keyword(&'a str),\n","file_path":"src/parser/types.rs","rank":82,"score":4.109431012905009},{"content":" pub(crate) resp: RespText<'a>,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum DefinedFlag {\n\n Seen,\n\n Answered,\n\n Flagged,\n\n Deleted,\n\n Draft,\n\n Recent,\n\n}\n\n\n\n// TODO: It is incorrect, because flags are case-insesitive\n\n// Add function for insesitive cmp\n\nimpl TryFrom<&str> for DefinedFlag {\n\n type Error = Error;\n\n\n\n fn try_from(value: &str) -> Result<Self, Self::Error> {\n\n match value {\n","file_path":"src/parser/types.rs","rank":83,"score":3.961933284595869},{"content":"// resp-text-code = \"ALERT\" | \"BADCHARSET\" [SP \"(\" astring *(SP astring) \")\" ] |\n\n// capability-data | \"PARSE\" | \"PERMANENTFLAGS\" SP \"(\"\n\n// [ flag-perm *(SP flag-perm)] \")\" | \"READ-ONLY\" |\n\n// \"READ-WRITE\" | \"TRYCREATE\" | \"UIDNEXT\" SP nz-number |\n\n// \"UIDVALIDITY\" SP nz-number | \"UNSEEN\" SP nz_number |\n\n// atom [ SP 1*<any TEXT-CHAR except \"]\"> ]\n\npub(crate) fn resp_text_code(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\n\n alt((\n\n rtc_alert,\n\n rtc_bad_charset,\n\n rtc_capability_data,\n\n rtc_parse,\n\n rtc_permanent_flags,\n\n rtc_read_only,\n\n rtc_read_write,\n\n rtc_try_create,\n\n rtc_uidnext,\n\n rtc_uidvalidity,\n\n rtc_unseen,\n\n // TODO: add last branch from rfc3501 resp-text-code\n","file_path":"src/parser/rfc3501/grammar.rs","rank":84,"score":3.5727988284849936},{"content":" }\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct ListMailBox<'a> {\n\n pub(crate) flags: Vec<ListFlag<'a>>,\n\n pub(crate) delimiter: Option<&'a str>,\n\n pub(crate) name: &'a str,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum Capability<'a> {\n\n // TODO: Create enum for common auth types\n\n Auth(&'a str),\n\n // TODO: Create enum for common other capabilities\n\n Other(&'a str),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum RespTextCode<'a> {\n","file_path":"src/parser/types.rs","rank":85,"score":3.550249516193007},{"content":"#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum ListDefinedFlag {\n\n Noinferiors,\n\n Noselect,\n\n Marked,\n\n Unmarked,\n\n}\n\n\n\n// TODO: It is incorrect, because flags are case-insesitive\n\n// Add function for insesitive cmp\n\nimpl TryFrom<&str> for ListDefinedFlag {\n\n type Error = Error;\n\n\n\n fn try_from(value: &str) -> Result<Self, Self::Error> {\n\n match value {\n\n \"\\\\Noinferiors\" => Ok(Self::Noinferiors),\n\n \"\\\\Noselect\" => Ok(Self::Noselect),\n\n \"\\\\Marked\" => Ok(Self::Marked),\n\n \"\\\\Unmarked\" => Ok(Self::Unmarked),\n\n _ => Err(create_custom_error(format!(\n","file_path":"src/parser/types.rs","rank":86,"score":3.406052199109396},{"content":" envelope_addr,\n\n tag(\" \"),\n\n envelope_addr,\n\n tag(\" \"),\n\n envelope_addr,\n\n tag(\" \"),\n\n envelope_addr,\n\n tag(\" \"),\n\n nstring,\n\n tag(\" \"),\n\n nstring,\n\n )),\n\n tag(\")\"),\n\n ),\n\n |(\n\n date,\n\n _,\n\n subject,\n\n _,\n\n from,\n","file_path":"src/parser/rfc3501/grammar.rs","rank":87,"score":3.1811955620990844},{"content":" date_month,\n\n tag(\"-\"),\n\n date_year,\n\n tag(\" \"),\n\n time,\n\n tag(\" \"),\n\n zone,\n\n )),\n\n tag(\"\\\"\"),\n\n ),\n\n |(day, _, month, _, year, _, time, _, zone)| DateTime {\n\n day,\n\n month,\n\n year,\n\n time,\n\n zone,\n\n },\n\n )(i)\n\n}\n\n\n","file_path":"src/parser/rfc3501/grammar.rs","rank":88,"score":2.9044304796054123},{"content":" Rfc822Text(Option<&'a str>),\n\n Rfc822Size(u32),\n\n Flags(Vec<MsgFlag<'a>>),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum MessageData<'a> {\n\n Expunge(u32),\n\n Fetch(MsgAtt<'a>),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct Time {\n\n pub(crate) hours: u8,\n\n pub(crate) minutes: u8,\n\n pub(crate) seconds: u8,\n\n}\n\n\n\n#[derive(Clone, Copy, Debug, Eq, PartialEq)]\n\npub(crate) enum Month {\n","file_path":"src/parser/types.rs","rank":89,"score":2.2953873223969303},{"content":"pub(crate) struct TaggedResponse<'a> {\n\n pub(crate) tag: Tag,\n\n pub(crate) resp: RespCond<'a>,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum UntaggedResponse<'a> {\n\n RespCond(RespCond<'a>),\n\n RespBye(ByeResponse<'a>),\n\n MailBox(MailBoxData<'a>),\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct RespCond<'a> {\n\n pub(crate) status: ImapResult,\n\n pub(crate) text: RespText<'a>,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct ByeResponse<'a> {\n","file_path":"src/parser/types.rs","rank":90,"score":2.0220976468160226},{"content":" \"Can not convert {} into ListDefinedFlag\",\n\n value\n\n ))),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) enum ListFlag<'a> {\n\n Defined(ListDefinedFlag),\n\n Extension(&'a str),\n\n}\n\n\n\nimpl<'a> From<&'a str> for ListFlag<'a> {\n\n fn from(s: &'a str) -> Self {\n\n if let Ok(v) = ListDefinedFlag::try_from(s) {\n\n Self::Defined(v)\n\n } else {\n\n Self::Extension(s)\n\n }\n","file_path":"src/parser/types.rs","rank":91,"score":1.800870473619605},{"content":"//! IMAP client implementation\n\n\n\n#![warn(rust_2018_idioms, /*missing_docs,*/ missing_debug_implementations)]\n\n#![allow(dead_code)] /* allow on develop stage */\n\n\n\npub mod client;\n\npub mod error;\n\nmod imapconnection;\n\nmod parser;\n\nmod tag;\n","file_path":"src/lib.rs","rank":92,"score":1.6047679171836138},{"content":" Jan,\n\n Feb,\n\n Mar,\n\n Apr,\n\n May,\n\n Jun,\n\n Jul,\n\n Aug,\n\n Sep,\n\n Oct,\n\n Nov,\n\n Dec,\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct DateTime {\n\n pub(crate) day: u8,\n\n pub(crate) month: Month,\n\n pub(crate) year: u16,\n\n pub(crate) time: Time,\n","file_path":"src/parser/types.rs","rank":93,"score":1.547012866919586},{"content":" Alert,\n\n BadCharset(Vec<&'a str>),\n\n Capability(Vec<Capability<'a>>),\n\n Parse,\n\n PermanentFlags(Vec<Flag<'a>>),\n\n ReadOnly,\n\n ReadWrite,\n\n TryCreate,\n\n UidNext(u32),\n\n UidValidity(u32),\n\n Unseen(u32),\n\n // TODO: add last branch\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq)]\n\npub(crate) struct RespText<'a> {\n\n pub(crate) code: Vec<RespTextCode<'a>>,\n\n pub(crate) text: &'a str,\n\n}\n\n\n","file_path":"src/parser/types.rs","rank":94,"score":1.4912957511420668}],"string":"[\n {\n \"content\": \"fn vec_to_string(v: &Vec<u8>) -> String {\\n\\n std::string::String::from_utf8_lossy(&v[..]).into_owned()\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 0,\n \"score\": 90814.00460926183\n },\n {\n \"content\": \"pub fn create_custom_error(msg: String) -> Error {\\n\\n Error::Custom(msg)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 1,\n \"score\": 51457.04885232965\n },\n {\n \"content\": \"// CHAR8 = %x01-ff;\\n\\n// any octet except 0\\n\\nfn is_char8(i: u8) -> bool {\\n\\n i != 0x00\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 2,\n \"score\": 51435.4882609334\n },\n {\n \"content\": \"// SP = %x20;\\n\\n// space\\n\\nfn is_space(i: u8) -> bool {\\n\\n i == b' '\\n\\n}\\n\\n\\n\\n// rfc 3501\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 3,\n \"score\": 51435.4882609334\n },\n {\n \"content\": \"// CHAR = %x01-7F;\\n\\n// any 7-bit US-ASCII character excluding 0\\n\\nfn is_char(i: u8) -> bool {\\n\\n (0x01..=0x7f).contains(&i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 4,\n \"score\": 51435.4882609334\n },\n {\n \"content\": \"// CTL = %x00-1F;\\n\\n// controls\\n\\nfn is_ctl(i: u8) -> bool {\\n\\n (0x00..=0x1f).contains(&i) || i == 0x7f\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 5,\n \"score\": 51435.4882609334\n },\n {\n \"content\": \"// resp-specials = ']'\\n\\nfn is_resp_specials(i: u8) -> bool {\\n\\n i == b']'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 6,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"// TEXT-CHAR = <any CHAR except CR and LF>\\n\\nfn is_text_char(i: u8) -> bool {\\n\\n is_char(i) && i != b'\\\\r' && i != b'\\\\n'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 7,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"// quoted-specials = '\\\"' | '\\\\'\\n\\nfn is_quoted_specials(i: u8) -> bool {\\n\\n i == b'\\\"' || i == b'\\\\\\\\'\\n\\n}\\n\\n\\n\\n// TODO: incorrect 2nd or: '\\\\' quoted-specials\\n\\n// QUOTED-CHAR = <any TEXT-CHAR except quoted-specials> | quoted-specials\\n\\npub(crate) fn is_quoted_char(i: u8) -> bool {\\n\\n is_quoted_specials(i) || is_text_char(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 8,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"// list-wildcards = '%' | '*'\\n\\nfn is_list_wildcards(i: u8) -> bool {\\n\\n i == b'%' || i == b'*'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 9,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"// atom-specials = '(' | ')' | '{' | SP | CTL | list-wildcards | quoted-specials | resp-specials\\n\\nfn is_atom_specials(i: u8) -> bool {\\n\\n i == b')'\\n\\n || i == b')'\\n\\n || i == b'{'\\n\\n || is_space(i)\\n\\n || is_ctl(i)\\n\\n || is_list_wildcards(i)\\n\\n || is_quoted_specials(i)\\n\\n || is_resp_specials(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 10,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"// ATOM-CHAR = <any CHAR except atom-specials>\\n\\nfn is_atom_char(i: u8) -> bool {\\n\\n !is_atom_specials(i) && is_char(i)\\n\\n}\\n\\n\\n\\n// ASTRING-CHAR = ATOM-CHAR | resp-specials\\n\\npub(crate) fn is_astring_char(i: u8) -> bool {\\n\\n is_atom_char(i) || is_resp_specials(i)\\n\\n}\\n\\n\\n\\n// nil = 'NIL'\\n\\npub(crate) fn nil<T>(i: &[u8]) -> IResult<&[u8], Option<T>> {\\n\\n map(tag_no_case(\\\"NIL\\\"), |_| None)(i)\\n\\n}\\n\\n\\n\\n// astring = 1*ASTRING-CHAR | string\\n\\npub(crate) fn astring(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n alt((\\n\\n string,\\n\\n map_res(take_while1(is_astring_char), std::str::from_utf8),\\n\\n ))(i)\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 11,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"// base64-char = ALPHA | DIGIT | '+' | '/'\\n\\nfn is_base64_char(i: u8) -> bool {\\n\\n is_alphanumeric(i) || i == b'+' || i == b'/'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 12,\n \"score\": 49640.334941377885\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_tagged_answer() {\\n\\n let response = b\\\"a0017 OK CAPABILITY completed\\\\r\\\\n\\\";\\n\\n\\n\\n let result = parse(response).unwrap();\\n\\n\\n\\n let tagged_response = ImapResponse::Response(TaggedResponse {\\n\\n tag: Tag::new('a', 17),\\n\\n resp: RespCond {\\n\\n status: ImapResult::Ok,\\n\\n text: resp_text(\\\"CAPABILITY completed\\\"),\\n\\n },\\n\\n });\\n\\n\\n\\n assert_eq(result, tagged_response);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/tests/mod.rs\",\n \"rank\": 13,\n \"score\": 44198.3539516174\n },\n {\n \"content\": \"fn assert_eq((remainder, result): (&[u8], ImapResponse<'_>), target: ImapResponse<'_>) {\\n\\n assert_eq!(remainder.len(), 0);\\n\\n assert_eq!(result, target);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/tests/mod.rs\",\n \"rank\": 14,\n \"score\": 38050.86559681582\n },\n {\n \"content\": \"//! Imap `tag` declaration\\n\\n//!\\n\\n\\n\\nuse std::{fmt::Display, iter::Iterator};\\n\\n\\n\\n/// `Tag` with prefixed letter\\n\\n/// # Example\\n\\n/// a1, c1001\\n\\n#[derive(Eq, PartialEq, Debug, Hash)]\\n\\npub(crate) struct Tag {\\n\\n prefix: char,\\n\\n index: u32,\\n\\n}\\n\\n\\n\\nimpl Tag {\\n\\n /// Construct new `Tag`\\n\\n pub(crate) fn new(prefix: char, index: u32) -> Self {\\n\\n Self { prefix, index }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tag.rs\",\n \"rank\": 15,\n \"score\": 26659.397993258604\n },\n {\n \"content\": \"\\n\\nimpl TagGenerator {\\n\\n /// Construct new TagGenerator\\n\\n pub fn new(prefix: char, index: u32) -> Self {\\n\\n TagGenerator { prefix, index }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for TagGenerator {\\n\\n fn default() -> Self {\\n\\n TagGenerator::new('a', 0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Iterator for TagGenerator {\\n\\n type Item = Tag;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let result = Tag::new(self.prefix, self.index);\\n\\n self.index += 1;\\n\\n Some(result)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tag.rs\",\n \"rank\": 16,\n \"score\": 26658.079722632723\n },\n {\n \"content\": \"\\n\\nimpl Default for Tag {\\n\\n fn default() -> Self {\\n\\n Tag::new('a', 0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for Tag {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n write!(f, \\\"{}{}\\\", self.prefix, self.index)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Each client command is prefixed with an identifer and a different tag is\\n\\n/// generated by the client for each command. Every call `next` method will\\n\\n/// return an unique `tag` for the command.\\n\\npub(crate) struct TagGenerator {\\n\\n prefix: char,\\n\\n index: u32,\\n\\n}\\n\",\n \"file_path\": \"src/tag.rs\",\n \"rank\": 17,\n \"score\": 26657.89364130878\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_greeting() {\\n\\n let response = b\\\"* OK IMAP4rev1 Service Ready\\\\r\\\\n\\\";\\n\\n\\n\\n let result = parse(response).unwrap();\\n\\n\\n\\n let greeting = ImapResponse::Greeting(Greeting {\\n\\n status: GreetingStatus::Ok(resp_text(\\\"IMAP4rev1 Service Ready\\\")),\\n\\n });\\n\\n\\n\\n assert_eq(result, greeting);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/tests/mod.rs\",\n \"rank\": 18,\n \"score\": 24858.14225189695\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_continue_req() {\\n\\n let response = b\\\"+ Ready\\\\r\\\\n\\\";\\n\\n\\n\\n let result = parse(response).unwrap();\\n\\n\\n\\n let continue_req = ImapResponse::Continue(ContinueReq::Text(resp_text(\\\"Ready\\\")));\\n\\n\\n\\n assert_eq(result, continue_req);\\n\\n}\\n\",\n \"file_path\": \"src/parser/tests/mod.rs\",\n \"rank\": 19,\n \"score\": 23877.14166816756\n },\n {\n \"content\": \"fn resp_text(s: &str) -> RespText<'_> {\\n\\n RespText {\\n\\n code: vec![],\\n\\n text: s,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/tests/mod.rs\",\n \"rank\": 29,\n \"score\": 20865.059733839662\n },\n {\n \"content\": \" alt((map(string, Some), nil))(i)\\n\\n}\\n\\n\\n\\n// base64-terminal = (2base64-char '==') | (3base64-char '=')\\n\\npub(crate) fn base64_terminal(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n map_res(\\n\\n length_data(many1_count(peek(alt((\\n\\n tuple((take_while_m_n(2, 2, is_base64_char), tag(\\\"==\\\"))),\\n\\n tuple((take_while_m_n(3, 3, is_base64_char), tag(\\\"=\\\"))),\\n\\n ))))),\\n\\n std::str::from_utf8,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// base64 = *(4base64_char) [base64_terminal]\\n\\npub(crate) fn base64(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n // ODO: Check it\\n\\n map_res(\\n\\n length_data(many1_count(peek(tuple((\\n\\n take_while_m_n(4, 4, is_base64_char),\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 30,\n \"score\": 14.353696146607424\n },\n {\n \"content\": \"//! IMAP core types\\n\\n\\n\\nuse std::{fmt::Debug, str::FromStr};\\n\\n\\n\\nuse nom::{\\n\\n branch::alt,\\n\\n bytes::streaming::{tag, tag_no_case, take_while, take_while1, take_while_m_n},\\n\\n character::is_alphanumeric,\\n\\n character::{\\n\\n is_digit,\\n\\n streaming::{crlf, u32},\\n\\n },\\n\\n combinator::{map, map_res, not, opt, peek, value},\\n\\n multi::{length_data, many1_count},\\n\\n sequence::{delimited, tuple},\\n\\n IResult,\\n\\n};\\n\\n\\n\\n// strings\\n\\n\\n\\n// CORE rules from rfc 5234\\n\\n\\n\\n// CHAR = %x01-7F;\\n\\n// any 7-bit US-ASCII character excluding 0\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 31,\n \"score\": 14.046736221762322\n },\n {\n \"content\": \"pub(crate) mod body;\\n\\npub(crate) mod core;\\n\\npub(crate) mod grammar;\\n\\n\\n\\nuse self::core::base64;\\n\\nuse crate::parser::types::{\\n\\n ContinueReq, Greeting, GreetingStatus, TaggedResponse, UntaggedResponse,\\n\\n};\\n\\nuse grammar::{imap_tag, mailbox_data, resp_cond_auth, resp_cond_bye, resp_cond_state, resp_text};\\n\\nuse nom::{\\n\\n branch::alt,\\n\\n bytes::streaming::tag,\\n\\n character::streaming::crlf,\\n\\n combinator::map,\\n\\n sequence::{delimited, tuple},\\n\\n IResult,\\n\\n};\\n\\n\\n\\n// greeting = \\\"*\\\" SP (resp_cond_auth | resp_cond_bye) CRLF\\n\\npub(crate) fn greeting(i: &[u8]) -> IResult<&[u8], Greeting<'_>> {\\n\",\n \"file_path\": \"src/parser/rfc3501/mod.rs\",\n \"rank\": 32,\n \"score\": 12.799385372668649\n },\n {\n \"content\": \"//! IMAP grammar [rfc3501]\\n\\n\\n\\nuse std::char::from_u32;\\n\\n\\n\\nuse super::core::*;\\n\\nuse crate::parser::types::{\\n\\n Address, ByeResponse, Capability, DateTime, Envelope, Flag, ImapResult, ListFlag, ListMailBox,\\n\\n MailBoxData, MessageData, Month, MsgAtt, MsgFlag, RespCond, RespText, RespTextCode, StatusInfo,\\n\\n StatusResponse, Time,\\n\\n};\\n\\nuse crate::tag::Tag;\\n\\nuse nom::{\\n\\n branch::alt,\\n\\n bytes::streaming::{tag, tag_no_case, take_while_m_n},\\n\\n combinator::{map, map_res, opt, value},\\n\\n multi::{many0, many1, separated_list0, separated_list1},\\n\\n sequence::{delimited, preceded, separated_pair, terminated, tuple},\\n\\n IResult,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 33,\n \"score\": 12.66106704577743\n },\n {\n \"content\": \"//! IMAP parser implementation\\n\\n\\n\\nmod rfc3501;\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\\nmod types;\\n\\n\\n\\nuse rfc3501::{continue_req, greeting, response_tagged};\\n\\nuse types::ImapResponse;\\n\\n\\n\\nuse nom::{branch::alt, combinator::map, IResult};\\n\\n\\n\\npub(crate) fn parse(i: &[u8]) -> IResult<&[u8], ImapResponse<'_>> {\\n\\n alt((\\n\\n map(greeting, |v| ImapResponse::Greeting(v)),\\n\\n map(continue_req, |v| ImapResponse::Continue(v)),\\n\\n map(response_tagged, |v| ImapResponse::Response(v)),\\n\\n ))(i)\\n\\n}\\n\",\n \"file_path\": \"src/parser/mod.rs\",\n \"rank\": 34,\n \"score\": 12.512161343474142\n },\n {\n \"content\": \"//mailbox-list = '(' [mbx-list-flags] ')' SP (DQUOTE QUOTED-CHAR DQUOTE | nil) SP mailbox\\n\\npub(crate) fn mailbox_list(i: &[u8]) -> IResult<&[u8], ListMailBox<'_>> {\\n\\n map(\\n\\n tuple((\\n\\n delimited(tag(\\\"(\\\"), opt(mbx_list_flags), tag(\\\")\\\")),\\n\\n tag(\\\" \\\"),\\n\\n alt((\\n\\n map(\\n\\n delimited(tag(\\\"\\\\\\\"\\\"), take_while_m_n(1, 1, is_quoted_char), tag(\\\"\\\\\\\"\\\")),\\n\\n Some,\\n\\n ),\\n\\n nil,\\n\\n )),\\n\\n tag(\\\" \\\"),\\n\\n mailbox,\\n\\n )),\\n\\n |(flags, _, delimiter, _, name)| ListMailBox {\\n\\n flags: match flags {\\n\\n Some(v) => v,\\n\\n None => vec![],\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 35,\n \"score\": 11.747442902371848\n },\n {\n \"content\": \" map(capability_data, RespTextCode::Capability)(i)\\n\\n}\\n\\n\\n\\n// 'PARSE'\\n\\npub(crate) fn rtc_parse(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(tag_no_case(\\\"PARSE\\\"), |_| RespTextCode::Parse)(i)\\n\\n}\\n\\n\\n\\n// 'PERMANENTFLAGS' SP '(' [flag-perm *(SP flag-perm)] ')'\\n\\npub(crate) fn rtc_permanent_flags(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(\\n\\n delimited(\\n\\n tag_no_case(\\\"PERMANENTFLAGS (\\\"),\\n\\n // TODO: Use nom::multi::separated_list0 for parsing lists\\n\\n separated_list0(tag(\\\" \\\"), flag_perm),\\n\\n tag(\\\")\\\"),\\n\\n ),\\n\\n RespTextCode::PermanentFlags,\\n\\n )(i)\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 36,\n \"score\": 11.665598818009094\n },\n {\n \"content\": \"}\\n\\n\\n\\n// quoted = DQUOTE *QUOTED-CHAR DQUOTE;\\n\\n// quoted text\\n\\npub(crate) fn quoted(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n map_res(\\n\\n delimited(tag(\\\"\\\\\\\"\\\"), take_while(is_quoted_char), tag(\\\"\\\\\\\"\\\")),\\n\\n std::str::from_utf8,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// string = quoted | literal\\n\\n//\\n\\npub(crate) fn string(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n alt((quoted, literal))(i)\\n\\n}\\n\\n\\n\\n// nstring = string | nil\\n\\n// nil = 'NIL'\\n\\npub(crate) fn nstring(i: &[u8]) -> IResult<&[u8], Option<&str>> {\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 37,\n \"score\": 11.594160759107721\n },\n {\n \"content\": \" map(\\n\\n terminated(number, tag_no_case(\\\" EXISTS\\\")),\\n\\n MailBoxData::Exists,\\n\\n ),\\n\\n map(\\n\\n terminated(number, tag_no_case(\\\" RECENT\\\")),\\n\\n MailBoxData::Recent,\\n\\n ),\\n\\n ))(i)\\n\\n}\\n\\n\\n\\n//flag-list = '(' [flag *(SP flag)] ')'\\n\\npub(crate) fn flag_list(i: &[u8]) -> IResult<&[u8], Vec<Flag<'_>>> {\\n\\n delimited(\\n\\n tag(\\\"(\\\"),\\n\\n separated_list0(tag(\\\" \\\"), map(flag, Flag::from)),\\n\\n tag(\\\")\\\"),\\n\\n )(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 38,\n \"score\": 11.29292214372099\n },\n {\n \"content\": \"pub(crate) fn continue_req(i: &[u8]) -> IResult<&[u8], ContinueReq<'_>> {\\n\\n delimited(\\n\\n tag(\\\"+ \\\"),\\n\\n alt((\\n\\n map(resp_text, ContinueReq::Text),\\n\\n map(base64, ContinueReq::Base64),\\n\\n )),\\n\\n crlf,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// response-tagged = tag SP resp-cond-state CRLF\\n\\npub(crate) fn response_tagged(i: &[u8]) -> IResult<&[u8], TaggedResponse<'_>> {\\n\\n map(\\n\\n tuple((imap_tag, tag(\\\" \\\"), resp_cond_state, crlf)),\\n\\n |(tag, _, resp, _)| TaggedResponse { tag, resp },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n//response-data = '*' SP (resp-cond-state | resp-cond-bye | mailbox-data |\\n\",\n \"file_path\": \"src/parser/rfc3501/mod.rs\",\n \"rank\": 39,\n \"score\": 11.086139566598682\n },\n {\n \"content\": \"\\n\\n// zone = ('+' | '-') 4DIGIT\\n\\npub(crate) fn zone(i: &[u8]) -> IResult<&[u8], i16> {\\n\\n map(\\n\\n tuple((alt((tag(\\\"+\\\"), tag(\\\"-\\\"))), fixed_num(4))),\\n\\n |(sign, mut value): (_, i16)| {\\n\\n if sign == b\\\"-\\\" {\\n\\n value *= -1;\\n\\n }\\n\\n\\n\\n value\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n//mailbox-data = 'FLAGS' SP flag-list | 'LIST' SP mailbox-list | 'LSUB' SP mailbox-list |\\n\\n// 'SEARCH' *(SP nz-number) | 'STATUS' SP mailbox SP '(' [status-att-list] ')' |\\n\\n// number SP 'EXISTS' | number SP 'RECENT'\\n\\npub(crate) fn mailbox_data(i: &[u8]) -> IResult<&[u8], MailBoxData<'_>> {\\n\\n alt((\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 40,\n \"score\": 10.785594671571086\n },\n {\n \"content\": \"// auth-type = atom\\n\\npub(crate) fn auth_type(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n // TODO: Create enum for auth type\\n\\n atom(i)\\n\\n}\\n\\n\\n\\n// capability-data = \\\"CAPABILITY\\\" *(SP CAPABILITY) SP \\\"IMAP4rev1\\\" *(SP capability)\\n\\npub(crate) fn capability_data(i: &[u8]) -> IResult<&[u8], Vec<Capability<'_>>> {\\n\\n // Grammar is not exactly as in rfc3501.\\n\\n // Just take all capabilities delimited by space\\n\\n // hoping that IMAP4rev1 is present\\n\\n map(\\n\\n tuple((\\n\\n tag_no_case(\\\"CAPABILITY\\\"),\\n\\n many1(map(tuple((tag(\\\" \\\"), capability)), |(_, data)| data)),\\n\\n )),\\n\\n |(_, capability)| capability,\\n\\n )(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 41,\n \"score\": 10.744016142163256\n },\n {\n \"content\": \" ))(i)\\n\\n}\\n\\n\\n\\n// resp-text = [ \\\"[\\\" resp-text-code \\\"]\\\" SP ] text\\n\\npub(crate) fn resp_text(i: &[u8]) -> IResult<&[u8], RespText<'_>> {\\n\\n map(\\n\\n tuple((many0(delimited(tag(\\\"[\\\"), resp_text_code, tag(\\\"] \\\"))), text)),\\n\\n |(code, text)| RespText { code, text },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// resp-cond-auth = (\\\"OK\\\" | \\\"PREAUTH\\\") SP resp-text;\\n\\n// Authentication condition\\n\\npub(crate) fn resp_cond_auth(i: &[u8]) -> IResult<&[u8], (&str, RespText<'_>)> {\\n\\n map(\\n\\n separated_pair(\\n\\n alt((tag_no_case(\\\"OK\\\"), tag_no_case(\\\"PREAUTH\\\"))),\\n\\n tag(\\\" \\\"),\\n\\n resp_text,\\n\\n ),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 42,\n \"score\": 10.265462414935055\n },\n {\n \"content\": \"// Status condition\\n\\npub(crate) fn resp_cond_state(i: &[u8]) -> IResult<&[u8], RespCond<'_>> {\\n\\n map(\\n\\n separated_pair(\\n\\n alt((\\n\\n value(ImapResult::Ok, tag_no_case(\\\"OK\\\")),\\n\\n value(ImapResult::No, tag_no_case(\\\"NO\\\")),\\n\\n value(ImapResult::Bad, tag_no_case(\\\"BAD\\\")),\\n\\n )),\\n\\n tag(\\\" \\\"),\\n\\n resp_text,\\n\\n ),\\n\\n |(status, text)| RespCond { status, text },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// flag-keyword = atom\\n\\npub(crate) fn flag_keyword(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n atom(i)\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 43,\n \"score\": 10.077958772237618\n },\n {\n \"content\": \"}\\n\\n\\n\\n// flag-fetch = flag | '\\\\Recent'\\n\\npub(crate) fn flag_fetch(i: &[u8]) -> IResult<&[u8], MsgFlag<'_>> {\\n\\n alt((\\n\\n map(flag, |v| MsgFlag::Common(Flag::from(v))),\\n\\n map(tag_no_case(\\\"\\\\\\\\Recent\\\"), |_| MsgFlag::Recent),\\n\\n ))(i)\\n\\n}\\n\\n\\n\\n// msg-att-static = 'ENVELOPE' SP envelope | \\\"INTERNALDATE\\\" SP date-time |\\n\\n// 'RFC822' ['.HEADER' | '.TEXT'] SP nstring |\\n\\n// 'RFC822.SIZE' SP number | 'BODY' ['STRUCTURE'] SP body |\\n\\n// 'BODY' section ['<' number '>'] SP nstring |\\n\\n// 'UID' SP uniqueid\\n\\n// ; Must not change for a message\\n\\npub(crate) fn msg_att_static(i: &[u8]) -> IResult<&[u8], MsgAtt<'_>> {\\n\\n alt((\\n\\n map(\\n\\n preceded(tag_no_case(\\\"ENVELOPE \\\"), envelope),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 44,\n \"score\": 9.743547309966667\n },\n {\n \"content\": \"\\n\\n// flag-extension = '\\\\' atom;\\n\\n// Future expansion\\n\\npub(crate) fn flag_extension(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n // TODO: incorrect removing suffix '\\\\'\\n\\n map(tuple((tag(\\\"\\\\\\\\\\\"), atom)), |(_, result)| result)(i)\\n\\n}\\n\\n\\n\\n// TODO: Change return type because Flag must not contain Perm\\n\\n// flag-perm = flag | '\\\\*'\\n\\npub(crate) fn flag_perm(i: &[u8]) -> IResult<&[u8], Flag<'_>> {\\n\\n map(flag, Flag::from)(i)\\n\\n}\\n\\n\\n\\n// flag = '\\\\Answered' | '\\\\Flagged' | '\\\\Deleted' | '\\\\Seen' | '\\\\Draft' | flag_keyword | flag_extension\\n\\npub(crate) fn flag(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n // \\\\Answered, \\\\Flagged are handle by flag_extension parser\\n\\n alt((flag_extension, flag_keyword))(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 45,\n \"score\": 9.623681244970047\n },\n {\n \"content\": \"// date-day-fixed = (SP DIGIT) | 2DIGIT\\n\\npub(crate) fn date_day_fixed(i: &[u8]) -> IResult<&[u8], u8> {\\n\\n alt((preceded(tag(\\\" \\\"), fixed_num(1)), fixed_num(2)))(i)\\n\\n}\\n\\n\\n\\n// date-month = 'Jan' | 'Feb' | 'Mar' | 'Apr' | 'May' | 'Jun' | 'Jul' | 'Aug' |\\n\\n// 'Sep' | 'Oct' | 'Nov' | 'Dec'\\n\\npub(crate) fn date_month(i: &[u8]) -> IResult<&[u8], Month> {\\n\\n alt((\\n\\n value(Month::Jan, tag_no_case(\\\"Jan\\\")),\\n\\n value(Month::Feb, tag_no_case(\\\"Feb\\\")),\\n\\n value(Month::Mar, tag_no_case(\\\"Mar\\\")),\\n\\n value(Month::Apr, tag_no_case(\\\"Apr\\\")),\\n\\n value(Month::May, tag_no_case(\\\"May\\\")),\\n\\n value(Month::Jun, tag_no_case(\\\"Jun\\\")),\\n\\n value(Month::Jul, tag_no_case(\\\"Jul\\\")),\\n\\n value(Month::Aug, tag_no_case(\\\"Aug\\\")),\\n\\n value(Month::Sep, tag_no_case(\\\"Sep\\\")),\\n\\n value(Month::Oct, tag_no_case(\\\"Oct\\\")),\\n\\n value(Month::Nov, tag_no_case(\\\"Nov\\\")),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 46,\n \"score\": 9.611526596130524\n },\n {\n \"content\": \"// capability = ('AUTH=' auth-type) | atom;\\n\\npub(crate) fn capability(i: &[u8]) -> IResult<&[u8], Capability<'_>> {\\n\\n let auth_parser = map(\\n\\n tuple((tag_no_case(\\\"AUTH=\\\"), auth_type)),\\n\\n |(_, auth_type)| auth_type,\\n\\n );\\n\\n\\n\\n alt((\\n\\n map(auth_parser, Capability::Auth),\\n\\n map(atom, Capability::Other),\\n\\n ))(i)\\n\\n}\\n\\n\\n\\n// resp-text-code branches\\n\\n\\n\\n// 'ALERT'\\n\\npub(crate) fn rtc_alert(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(tag_no_case(\\\"ALERT\\\"), |_| RespTextCode::Alert)(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 47,\n \"score\": 9.549120394524223\n },\n {\n \"content\": \" value(Month::Dec, tag_no_case(\\\"Dec\\\")),\\n\\n ))(i)\\n\\n}\\n\\n\\n\\n// date-year = 4DIGIT\\n\\npub(crate) fn date_year(i: &[u8]) -> IResult<&[u8], u16> {\\n\\n fixed_num(4)(i)\\n\\n}\\n\\n\\n\\n// time = 2DIGIT ':' 2DIGIT ':' 2DIGIT\\n\\npub(crate) fn time(i: &[u8]) -> IResult<&[u8], Time> {\\n\\n map(\\n\\n tuple((fixed_num(2), tag(\\\":\\\"), fixed_num(2), tag(\\\":\\\"), fixed_num(2))),\\n\\n |(hours, _, minutes, _, seconds)| Time {\\n\\n hours,\\n\\n minutes,\\n\\n seconds,\\n\\n },\\n\\n )(i)\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 48,\n \"score\": 9.345305891641502\n },\n {\n \"content\": \"// message-data | capability-data) CRLF\\n\\npub(crate) fn response_data(i: &[u8]) -> IResult<&[u8], UntaggedResponse<'_>> {\\n\\n delimited(\\n\\n tag(\\\"* \\\"),\\n\\n alt((\\n\\n map(resp_cond_state, UntaggedResponse::RespCond),\\n\\n map(resp_cond_bye, UntaggedResponse::RespBye),\\n\\n map(mailbox_data, UntaggedResponse::MailBox),\\n\\n )),\\n\\n crlf,\\n\\n )(i)\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/mod.rs\",\n \"rank\": 49,\n \"score\": 9.239328833473088\n },\n {\n \"content\": \" )),\\n\\n tag(\\\")\\\"),\\n\\n ),\\n\\n |(name, _, adl, _, mailbox, _, host)| Address {\\n\\n name,\\n\\n adl,\\n\\n mailbox,\\n\\n host,\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// date-time = DQUOTE date-day-fixed '-' date-month '-' date-year SP time SP zone DQUOTE\\n\\npub(crate) fn date_time(i: &[u8]) -> IResult<&[u8], DateTime> {\\n\\n map(\\n\\n delimited(\\n\\n tag(\\\"\\\\\\\"\\\"),\\n\\n tuple((\\n\\n date_day_fixed,\\n\\n tag(\\\"-\\\"),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 50,\n \"score\": 9.091962249782393\n },\n {\n \"content\": \" },\\n\\n // SAFETY: is_quoted_char is valid ascii character, so it is valid utf-8\\n\\n delimiter: unsafe { delimiter.map(|v| std::str::from_utf8_unchecked(v)) },\\n\\n name,\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// *(SP nz-number)\\n\\npub(crate) fn mailbox_data_search(i: &[u8]) -> IResult<&[u8], Vec<u32>> {\\n\\n separated_list1(tag(\\\" \\\"), nz_number)(i)\\n\\n}\\n\\n\\n\\n// mailbox SP '(' [status-att-list] ')'\\n\\npub(crate) fn mailbox_data_status(i: &[u8]) -> IResult<&[u8], StatusResponse<'_>> {\\n\\n map(\\n\\n separated_pair(\\n\\n mailbox,\\n\\n tag(\\\" \\\"),\\n\\n delimited(tag(\\\"(\\\"), opt(status_att_list), tag(\\\")\\\")),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 51,\n \"score\": 8.957451511144\n },\n {\n \"content\": \"// 'BADCHARSET' [SP '(' astring *(SP astring) ')']\\n\\npub(crate) fn rtc_bad_charset(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(\\n\\n preceded(\\n\\n tag_no_case(\\\"BADCHARSET\\\"),\\n\\n opt(delimited(\\n\\n tag(\\\" (\\\"),\\n\\n many1(terminated(astring, opt(tag(\\\" \\\")))),\\n\\n tag(\\\")\\\"),\\n\\n )),\\n\\n ),\\n\\n |v| match v {\\n\\n Some(v) => RespTextCode::BadCharset(v),\\n\\n None => RespTextCode::BadCharset(vec![]),\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// capability-data\\n\\npub(crate) fn rtc_capability_data(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 52,\n \"score\": 8.926121260113115\n },\n {\n \"content\": \" to,\\n\\n cc,\\n\\n bcc,\\n\\n in_reply_to,\\n\\n message_id,\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// '(' 1*address ')' | nil\\n\\npub(crate) fn envelope_addr(i: &[u8]) -> IResult<&[u8], Option<Vec<Address<'_>>>> {\\n\\n alt((\\n\\n map(delimited(tag(\\\"(\\\"), many1(address), tag(\\\")\\\")), Some),\\n\\n nil,\\n\\n ))(i)\\n\\n}\\n\\n\\n\\n// address = '(' addr-name SP addr-adl SP addr-mailbox SP addr-host ')'\\n\\n//\\n\\n// addr-name = nstring\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 53,\n \"score\": 8.907717994742079\n },\n {\n \"content\": \" ListFlag::from(s)\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// tag(rfc) = 1*<any ASTRING-CHAR except '+'>\\n\\n// tag(this) = ASTRING-CHAR number\\n\\n// We use our own (tag)[tag::Tag] definition of tag\\n\\n// with one prefix letter and u32 id\\n\\npub(crate) fn imap_tag(i: &[u8]) -> IResult<&[u8], Tag> {\\n\\n map(\\n\\n tuple((take_while_m_n(1, 1, is_astring_char), number)),\\n\\n |(letter, index)| {\\n\\n let prefix = from_u32(letter[0] as u32).unwrap();\\n\\n Tag::new(prefix, index)\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// resp-cond-state = (\\\"OK\\\" | \\\"NO\\\" | \\\"BAD\\\") SP resp_text;\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 54,\n \"score\": 8.889719544080991\n },\n {\n \"content\": \"//message-data = nz-number SP (\\\"EXPUNGE\\\" | (\\\"FETCH\\\" SP msg-att))\\n\\npub(crate) fn message_data(i: &[u8]) -> IResult<&[u8], MessageData<'_>> {\\n\\n todo!()\\n\\n}\\n\\n\\n\\n// msg_att = '(' (msg-att-dynamic | msg-att-static) *(SP (msg-att-dynamic | msg-att-static)) ')'\\n\\npub(crate) fn msg_att(i: &[u8]) -> IResult<&[u8], MsgAtt<'_>> {\\n\\n todo!()\\n\\n}\\n\\n\\n\\n// msg-att-dynamic = 'FLAGS' SP '(' [flag-fetch *(SP flag-fetch)] ')'\\n\\n// ; May change for a message\\n\\npub(crate) fn msg_att_dynamic(i: &[u8]) -> IResult<&[u8], MsgAtt<'_>> {\\n\\n map(\\n\\n preceded(\\n\\n tag_no_case(\\\"FLAGS \\\"),\\n\\n delimited(tag(\\\"(\\\"), separated_list1(tag(\\\" \\\"), flag_fetch), tag(\\\")\\\")),\\n\\n ),\\n\\n MsgAtt::Flags,\\n\\n )(i)\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 55,\n \"score\": 8.373020674484083\n },\n {\n \"content\": \" alt((\\n\\n map_res(tag_no_case(\\\"\\\\\\\\Noinferiors\\\"), std::str::from_utf8),\\n\\n flag_extension,\\n\\n )),\\n\\n ListFlag::from,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n//mbx-list-sflag = '\\\\Noselect' | '\\\\Marked' | '\\\\Unmarked'\\n\\n// Selectability flags; only one per LIST response\\n\\npub(crate) fn mbx_list_sflag(i: &[u8]) -> IResult<&[u8], ListFlag<'_>> {\\n\\n map(\\n\\n alt((\\n\\n tag_no_case(\\\"\\\\\\\\Noselect\\\"),\\n\\n tag_no_case(\\\"\\\\\\\\Marked\\\"),\\n\\n tag_no_case(\\\"\\\\\\\\Unmarked\\\"),\\n\\n )),\\n\\n |flag| {\\n\\n // SAFETY: flag is \\\\Noselect, \\\\Marked or \\\\Unmarked ASCII texts, so it is valid UTF-8\\n\\n let s = unsafe { std::str::from_utf8_unchecked(flag) };\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 56,\n \"score\": 7.833111215328197\n },\n {\n \"content\": \"// ; If non-NIL holds pharse from [RFC-2822] mailbox after removing quoting\\n\\n// addr-adl = nstring\\n\\n// ; Holds route from route-addr if non-NIL\\n\\n// addr-mailbox = nstring\\n\\n// ; NIL indicates end of group; if non-NIL and addr-host is NIL, holds group name\\n\\n// ; Otherwise, holds local-part after removing quoting\\n\\n// addr-host = nstring\\n\\n// ; NIL indicates group syntax. Otherwise, holds domain name\\n\\npub(crate) fn address(i: &[u8]) -> IResult<&[u8], Address<'_>> {\\n\\n map(\\n\\n delimited(\\n\\n tag(\\\"(\\\"),\\n\\n tuple((\\n\\n nstring,\\n\\n tag(\\\" \\\"),\\n\\n nstring,\\n\\n tag(\\\" \\\"),\\n\\n nstring,\\n\\n tag(\\\" \\\"),\\n\\n nstring,\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 57,\n \"score\": 7.558531480954739\n },\n {\n \"content\": \"}\\n\\n\\n\\n// atom = 1*ATOM-CHAR\\n\\npub(crate) fn atom(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n map_res(take_while1(is_atom_char), std::str::from_utf8)(i)\\n\\n}\\n\\n\\n\\n// literal = \\\"{\\\" number \\\"}\\\" CRLF *CHAR8;\\n\\n// number represents the number of CHAR8s\\n\\npub(crate) fn literal(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n let (i, (_, count, _, _)) = tuple((tag(\\\"{\\\"), number, tag(\\\"}\\\"), crlf))(i)?;\\n\\n let parser = take_while_m_n(count as usize, count as usize, is_char8);\\n\\n\\n\\n map_res(parser, std::str::from_utf8)(i)\\n\\n}\\n\\n\\n\\n// text = 1*TEXT-CHAR\\n\\n//\\n\\npub(crate) fn text(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n map_res(take_while1(is_text_char), std::str::from_utf8)(i)\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 58,\n \"score\": 7.481104187495063\n },\n {\n \"content\": \"}\\n\\n\\n\\n// envelope = '(' env-date SP env-subject SP env-from SP env-sender\\n\\n// SP env-reply-to SP env-to SP env-cc SP env-bcc SP env-in-reply-to\\n\\n// SP env-message-id ')'\\n\\n// env-date, env-subject, env-in-reply-to, env-message-id = nstring\\n\\n// env-from, env-sender, env-reply-to, env-to, env-cc, env-bcc = '(' 1*address ')' | nil\\n\\npub(crate) fn envelope(i: &[u8]) -> IResult<&[u8], Envelope<'_>> {\\n\\n map(\\n\\n delimited(\\n\\n tag(\\\"(\\\"),\\n\\n tuple((\\n\\n nstring,\\n\\n tag(\\\" \\\"),\\n\\n nstring,\\n\\n tag(\\\" \\\"),\\n\\n envelope_addr,\\n\\n tag(\\\" \\\"),\\n\\n envelope_addr,\\n\\n tag(\\\" \\\"),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 59,\n \"score\": 7.414224337037648\n },\n {\n \"content\": \"pub(crate) struct MediaBasic<'a> {\\n\\n pub(crate) media_type: MediaType<'a>,\\n\\n pub(crate) subtype: &'a str,\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\\n\\npub(crate) enum BodyEnc<'a> {\\n\\n N7bit,\\n\\n N8bit,\\n\\n Binary,\\n\\n Base64,\\n\\n QuotedPrintable,\\n\\n Custom(&'a str),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct BodyFields<'a> {\\n\\n pub(crate) param: Option<Vec<(&'a str, &'a str)>>,\\n\\n pub(crate) id: Option<&'a str>,\\n\\n pub(crate) desc: Option<&'a str>,\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 60,\n \"score\": 7.390714252378748\n },\n {\n \"content\": \" pub(crate) enc: BodyEnc<'a>,\\n\\n pub(crate) octets: u32,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct BodyTypeBasic<'a> {\\n\\n pub(crate) media: MediaBasic<'a>,\\n\\n pub(crate) fields: BodyFields<'a>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct BodyTypeMsg<'a> {\\n\\n pub(crate) fields: BodyFields<'a>,\\n\\n pub(crate) envelope: Envelope<'a>,\\n\\n pub(crate) body: Box<Body<'a>>,\\n\\n pub(crate) lines: u32,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct BodyTypeText<'a> {\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 61,\n \"score\": 7.3420149283324925\n },\n {\n \"content\": \" opt(base64_terminal),\\n\\n ))))),\\n\\n std::str::from_utf8,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// numbers\\n\\n\\n\\n// number = 1*DIGIT;\\n\\n// unsigned 32-bit integer\\n\\npub(crate) fn number(i: &[u8]) -> IResult<&[u8], u32> {\\n\\n u32(i)\\n\\n}\\n\\n\\n\\n// nz-number = digit-nz *DIGIT;\\n\\n// non-zero unsigned 32-bit integer\\n\\npub(crate) fn nz_number(i: &[u8]) -> IResult<&[u8], u32> {\\n\\n let (i, (_, result)) = tuple((not(tag(\\\"0\\\")), number))(i)?;\\n\\n Ok((i, result))\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 62,\n \"score\": 7.238544951129705\n },\n {\n \"content\": \" )(i)\\n\\n}\\n\\n\\n\\n// 'Unseen' SP number\\n\\npub(crate) fn status_unseen(i: &[u8]) -> IResult<&[u8], StatusInfo> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"UNSEEN \\\"), nz_number),\\n\\n StatusInfo::Unseen,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// TODO! Incorrect\\n\\n// status-att-list = status-att SP number *(SP status-att SP number)\\n\\n// status-att = 'MESSAGES' | 'RECENT' | 'UIDNEXT' | 'UIDVALIDITY' | 'UNSEEN'\\n\\npub(crate) fn status_att_list(i: &[u8]) -> IResult<&[u8], Vec<StatusInfo>> {\\n\\n many1(alt((\\n\\n status_messages,\\n\\n status_recent,\\n\\n status_uidnext,\\n\\n status_uidvalidity,\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 63,\n \"score\": 7.1642252519453145\n },\n {\n \"content\": \" map(\\n\\n delimited(\\n\\n tag(\\\"* \\\"),\\n\\n alt((\\n\\n map(resp_cond_auth, |(status, resp_text)| {\\n\\n if status == \\\"OK\\\" {\\n\\n GreetingStatus::Ok(resp_text)\\n\\n } else {\\n\\n GreetingStatus::Preauth(resp_text)\\n\\n }\\n\\n }),\\n\\n map(resp_cond_bye, GreetingStatus::Bye),\\n\\n )),\\n\\n crlf,\\n\\n ),\\n\\n |status| Greeting { status },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// continue-req = '+' SP (resp-text | base64) CRLF\\n\",\n \"file_path\": \"src/parser/rfc3501/mod.rs\",\n \"rank\": 64,\n \"score\": 7.097529669074544\n },\n {\n \"content\": \"\\n\\n// 'READ-ONLY'\\n\\npub(crate) fn rtc_read_only(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(tag_no_case(\\\"READ-ONLY\\\"), |_| RespTextCode::ReadOnly)(i)\\n\\n}\\n\\n\\n\\n// 'READ-WRITE'\\n\\npub(crate) fn rtc_read_write(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(tag_no_case(\\\"READ-WRITE\\\"), |_| RespTextCode::ReadWrite)(i)\\n\\n}\\n\\n\\n\\n// 'TRYCREATE'\\n\\npub(crate) fn rtc_try_create(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(tag_no_case(\\\"TRYCREATE\\\"), |_| RespTextCode::TryCreate)(i)\\n\\n}\\n\\n\\n\\n// 'UIDNEXT' SP nz-number\\n\\npub(crate) fn rtc_uidnext(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"UIDNEXT \\\"), nz_number),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 65,\n \"score\": 7.086661600378328\n },\n {\n \"content\": \" pub(crate) subtype: &'a str,\\n\\n pub(crate) fields: BodyFields<'a>,\\n\\n pub(crate) lines: u32,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct BodyExt1Part<'a> {\\n\\n md5: Option<&'a str>,\\n\\n}\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 66,\n \"score\": 6.964096763757909\n },\n {\n \"content\": \"pub(crate) fn status_recent(i: &[u8]) -> IResult<&[u8], StatusInfo> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"RECENT \\\"), nz_number),\\n\\n StatusInfo::Recent,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// 'UIDNEXT' SP number\\n\\npub(crate) fn status_uidnext(i: &[u8]) -> IResult<&[u8], StatusInfo> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"UIDNEXT \\\"), nz_number),\\n\\n StatusInfo::UidNext,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// 'UIDVALIDITY' SP number\\n\\npub(crate) fn status_uidvalidity(i: &[u8]) -> IResult<&[u8], StatusInfo> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"UIDVALIDITY \\\"), nz_number),\\n\\n StatusInfo::UidValidity,\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 67,\n \"score\": 6.928742682711048\n },\n {\n \"content\": \"//!\\n\\nuse crate::error::Result;\\n\\nuse crate::tag::{Tag, TagGenerator};\\n\\nuse futures::stream::SplitSink;\\n\\nuse futures::{SinkExt, StreamExt};\\n\\nuse log::trace;\\n\\nuse std::collections::HashMap;\\n\\nuse std::sync::Arc;\\n\\nuse tokio::sync::mpsc::Sender;\\n\\nuse tokio::{\\n\\n net::{TcpStream, ToSocketAddrs},\\n\\n task::JoinHandle,\\n\\n};\\n\\nuse tokio_util::codec::{Decoder, Framed, LinesCodec};\\n\\n\\n\\n/// An async tcp stream.\\n\\n/// The `ImapConnection` serves to register a request to the server\\n\\n/// and receive a response.\\n\\n///\\n\\n/// All requests for the server saved as ([Tag](Tag) - Channel) match.\\n\",\n \"file_path\": \"src/imapconnection.rs\",\n \"rank\": 68,\n \"score\": 6.87439261298945\n },\n {\n \"content\": \" RespTextCode::UidNext,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// 'UIDVALIDITY' SP nz-number\\n\\npub(crate) fn rtc_uidvalidity(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"UIDVALIDITY \\\"), nz_number),\\n\\n RespTextCode::UidValidity,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// 'UNSEEN' SP nz-number\\n\\npub(crate) fn rtc_unseen(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"UNSEEN \\\"), nz_number),\\n\\n RespTextCode::Unseen,\\n\\n )(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 69,\n \"score\": 6.1685133551729106\n },\n {\n \"content\": \" |(status, resp_text)| {\\n\\n // SAFETY: status is \\\"OK\\\" either \\\"PREAUTH\\\" strings, so it is valid utf-8\\n\\n let status = unsafe { std::str::from_utf8_unchecked(status) };\\n\\n (status, resp_text)\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// resp-cond-bye = \\\"BYE\\\" SP resp-text\\n\\npub(crate) fn resp_cond_bye(i: &[u8]) -> IResult<&[u8], ByeResponse<'_>> {\\n\\n map(preceded(tag_no_case(\\\"BYE \\\"), resp_text), |resp| {\\n\\n ByeResponse { resp }\\n\\n })(i)\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 70,\n \"score\": 6.068794519806133\n },\n {\n \"content\": \"\\n\\n// Help function for syntax like mDIGIT\\n\\npub(crate) fn fixed_num<T: FromStr>(m: usize) -> impl Fn(&[u8]) -> IResult<&[u8], T>\\n\\nwhere\\n\\n <T as FromStr>::Err: Debug,\\n\\n{\\n\\n move |i: &[u8]| {\\n\\n // SAFETY: v is slice of DIGIT('0' - '9') so it's valid utf-8\\n\\n map(take_while_m_n(m, m, is_digit), |v| unsafe {\\n\\n std::str::from_utf8_unchecked(v).parse().unwrap()\\n\\n })(i)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser/rfc3501/core.rs\",\n \"rank\": 71,\n \"score\": 5.821950730576054\n },\n {\n \"content\": \"\\n\\n let subscriptions = Arc::new(HashMap::new());\\n\\n\\n\\n let future = tokio::spawn(async move {\\n\\n loop {\\n\\n let buf = stream.next().await.unwrap();\\n\\n trace!(\\\"S: {:?}\\\", buf);\\n\\n\\n\\n // Get in subs sender half by tag\\n\\n }\\n\\n });\\n\\n\\n\\n Ok(Self {\\n\\n sink,\\n\\n subscriptions,\\n\\n generator: TagGenerator::default(),\\n\\n cancel: future,\\n\\n })\\n\\n }\\n\\n\\n\\n async fn send(&mut self, data: String) {\\n\\n // Save subscription by tag to subscriptions map\\n\\n self.sink.send(data).await.unwrap()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/imapconnection.rs\",\n \"rank\": 72,\n \"score\": 5.660305819057216\n },\n {\n \"content\": \" status_unseen,\\n\\n )))(i)\\n\\n}\\n\\n\\n\\n//mailbox = 'INBOX' | astring\\n\\npub(crate) fn mailbox(i: &[u8]) -> IResult<&[u8], &str> {\\n\\n astring(i)\\n\\n}\\n\\n\\n\\n//mbx-list-flags = *(mbx-list-oflag SP) mbx-list-sflag *(SP mbx-list-oflag) |\\n\\n// mbx-list-oflag *(SP mbx-list-oflag)\\n\\npub(crate) fn mbx_list_flags(i: &[u8]) -> IResult<&[u8], Vec<ListFlag<'_>>> {\\n\\n // Allow multiple mbx-list-sflag for easy writing of parser, it is not lethal\\n\\n separated_list1(tag(\\\" \\\"), alt((mbx_list_oflag, mbx_list_sflag)))(i)\\n\\n}\\n\\n\\n\\n//mbx-list-oflag = '\\\\Noinferiors' | flag-extension;\\n\\n// Other flags; multiple possible per LIST response\\n\\npub(crate) fn mbx_list_oflag(i: &[u8]) -> IResult<&[u8], ListFlag<'_>> {\\n\\n map(\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 73,\n \"score\": 5.367071427760991\n },\n {\n \"content\": \" MsgAtt::Envelope,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"INTERNALDATE \\\"), date_time),\\n\\n MsgAtt::InternalDate,\\n\\n ),\\n\\n map(preceded(tag_no_case(\\\"RFC822 \\\"), nstring), MsgAtt::Rfc822),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"RFC822.HEADER \\\"), nstring),\\n\\n MsgAtt::Rfc822Header,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"RFC822.TEXT \\\"), nstring),\\n\\n MsgAtt::Rfc822Text,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"RFC822.SIZE \\\"), number),\\n\\n MsgAtt::Rfc822Size,\\n\\n ),\\n\\n ))(i)\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 74,\n \"score\": 5.276093757361263\n },\n {\n \"content\": \" ),\\n\\n |(name, status)| {\\n\\n let status = match status {\\n\\n Some(v) => v,\\n\\n None => vec![],\\n\\n };\\n\\n StatusResponse { name, status }\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// 'MESSAGES' SP number\\n\\npub(crate) fn status_messages(i: &[u8]) -> IResult<&[u8], StatusInfo> {\\n\\n map(\\n\\n preceded(tag_no_case(\\\"MESSAGES \\\"), nz_number),\\n\\n StatusInfo::Messages,\\n\\n )(i)\\n\\n}\\n\\n\\n\\n// 'RECENT' SP number\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 75,\n \"score\": 5.258714595369732\n },\n {\n \"content\": \" map(\\n\\n preceded(tag_no_case(\\\"FLAGS \\\"), flag_list),\\n\\n MailBoxData::Flags,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"LIST \\\"), mailbox_list),\\n\\n MailBoxData::List,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"LSUB \\\"), mailbox_list),\\n\\n MailBoxData::Lsub,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"SEARCH \\\"), mailbox_data_search),\\n\\n MailBoxData::Search,\\n\\n ),\\n\\n map(\\n\\n preceded(tag_no_case(\\\"STATUS \\\"), mailbox_data_status),\\n\\n MailBoxData::Status,\\n\\n ),\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 76,\n \"score\": 5.251363999885935\n },\n {\n \"content\": \"//!\\n\\n\\n\\nuse crate::tag::Tag;\\n\\nuse std::convert::TryFrom;\\n\\n\\n\\nuse crate::error::{create_custom_error, Error};\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum ImapResponse<'a> {\\n\\n Greeting(Greeting<'a>),\\n\\n Continue(ContinueReq<'a>),\\n\\n Response(TaggedResponse<'a>),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, Clone)]\\n\\npub(crate) enum ImapResult {\\n\\n Ok,\\n\\n Bad,\\n\\n No,\\n\\n}\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 77,\n \"score\": 5.097452461173988\n },\n {\n \"content\": \"/// If the tagged response was received, we'll get Channel by the `Tag`\\n\\n/// and send parsed response into it.\\n\\n///\\n\\n/// We can wait multiple responses at one time in multiple threads\\n\\n/// because we can analyze received tag and find the corresponding Channel.\\n\\npub(crate) struct ImapConnection {\\n\\n sink: SplitSink<Framed<TcpStream, LinesCodec>, String>,\\n\\n subscriptions: Arc<HashMap<Tag, Sender<String>>>,\\n\\n generator: TagGenerator,\\n\\n // Cancel background listener future\\n\\n cancel: JoinHandle<()>,\\n\\n}\\n\\n\\n\\nimpl ImapConnection {\\n\\n async fn connect<A: ToSocketAddrs>(addr: A) -> Result<Self> {\\n\\n let connection = TcpStream::connect(addr).await?;\\n\\n\\n\\n let frame = LinesCodec::default().framed(connection);\\n\\n\\n\\n let (sink, mut stream) = frame.split();\\n\",\n \"file_path\": \"src/imapconnection.rs\",\n \"rank\": 78,\n \"score\": 4.98959282488644\n },\n {\n \"content\": \"use crate::{\\n\\n parser::{\\n\\n parse,\\n\\n types::{\\n\\n ContinueReq, Greeting, GreetingStatus, ImapResponse, ImapResult, RespCond, RespText,\\n\\n TaggedResponse,\\n\\n },\\n\\n },\\n\\n tag::Tag,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/parser/tests/mod.rs\",\n \"rank\": 79,\n \"score\": 4.965374479703505\n },\n {\n \"content\": \"//! Error type\\n\\n\\n\\nuse thiserror::Error;\\n\\n\\n\\n/// A convenience wrapper around `Result` for [Error][Error]\\n\\npub type Result<T> = std::result::Result<T, Error>;\\n\\n\\n\\n/// A set of errors\\n\\n#[non_exhaustive]\\n\\n#[derive(Error, Debug)]\\n\\npub enum Error {\\n\\n /// Fail write or read to a network stream\\n\\n #[error(\\\"An IO error\\\")]\\n\\n Io(#[from] std::io::Error),\\n\\n /// Error with custom message\\n\\n #[error(\\\"An error has occured: {0}\\\")]\\n\\n Custom(String),\\n\\n #[error(\\\"Parser error [slice: {0:?}, str: {}]\\\", vec_to_string(.0))]\\n\\n Parser(Vec<u8>),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 80,\n \"score\": 4.718507492032698\n },\n {\n \"content\": \" pub(crate) zone: i16,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum Body<'a> {\\n\\n Basic(BodyTypeBasic<'a>),\\n\\n Msg(BodyTypeMsg<'a>),\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\\n\\npub(crate) enum MediaType<'a> {\\n\\n Application,\\n\\n Audio,\\n\\n Image,\\n\\n Message,\\n\\n Video,\\n\\n Custom(&'a str),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 81,\n \"score\": 4.460190273694162\n },\n {\n \"content\": \" \\\"\\\\\\\\Seen\\\" => Ok(Self::Seen),\\n\\n \\\"\\\\\\\\Answred\\\" => Ok(Self::Answered),\\n\\n \\\"\\\\\\\\Flagged\\\" => Ok(Self::Flagged),\\n\\n \\\"\\\\\\\\Deleted\\\" => Ok(Self::Deleted),\\n\\n \\\"\\\\\\\\Draft\\\" => Ok(Self::Draft),\\n\\n \\\"\\\\\\\\Recent\\\" => Ok(Self::Recent),\\n\\n _ => Err(create_custom_error(format!(\\n\\n \\\"Can not convert {} into DefinedFlag\\\",\\n\\n value\\n\\n ))),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// TODO: Flag should be without Perm branch\\n\\n// Perm branch used only for resp_text_code\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum Flag<'a> {\\n\\n Defined(DefinedFlag),\\n\\n Keyword(&'a str),\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 82,\n \"score\": 4.109431012905009\n },\n {\n \"content\": \" pub(crate) resp: RespText<'a>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum DefinedFlag {\\n\\n Seen,\\n\\n Answered,\\n\\n Flagged,\\n\\n Deleted,\\n\\n Draft,\\n\\n Recent,\\n\\n}\\n\\n\\n\\n// TODO: It is incorrect, because flags are case-insesitive\\n\\n// Add function for insesitive cmp\\n\\nimpl TryFrom<&str> for DefinedFlag {\\n\\n type Error = Error;\\n\\n\\n\\n fn try_from(value: &str) -> Result<Self, Self::Error> {\\n\\n match value {\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 83,\n \"score\": 3.961933284595869\n },\n {\n \"content\": \"// resp-text-code = \\\"ALERT\\\" | \\\"BADCHARSET\\\" [SP \\\"(\\\" astring *(SP astring) \\\")\\\" ] |\\n\\n// capability-data | \\\"PARSE\\\" | \\\"PERMANENTFLAGS\\\" SP \\\"(\\\"\\n\\n// [ flag-perm *(SP flag-perm)] \\\")\\\" | \\\"READ-ONLY\\\" |\\n\\n// \\\"READ-WRITE\\\" | \\\"TRYCREATE\\\" | \\\"UIDNEXT\\\" SP nz-number |\\n\\n// \\\"UIDVALIDITY\\\" SP nz-number | \\\"UNSEEN\\\" SP nz_number |\\n\\n// atom [ SP 1*<any TEXT-CHAR except \\\"]\\\"> ]\\n\\npub(crate) fn resp_text_code(i: &[u8]) -> IResult<&[u8], RespTextCode<'_>> {\\n\\n alt((\\n\\n rtc_alert,\\n\\n rtc_bad_charset,\\n\\n rtc_capability_data,\\n\\n rtc_parse,\\n\\n rtc_permanent_flags,\\n\\n rtc_read_only,\\n\\n rtc_read_write,\\n\\n rtc_try_create,\\n\\n rtc_uidnext,\\n\\n rtc_uidvalidity,\\n\\n rtc_unseen,\\n\\n // TODO: add last branch from rfc3501 resp-text-code\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 84,\n \"score\": 3.5727988284849936\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct ListMailBox<'a> {\\n\\n pub(crate) flags: Vec<ListFlag<'a>>,\\n\\n pub(crate) delimiter: Option<&'a str>,\\n\\n pub(crate) name: &'a str,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum Capability<'a> {\\n\\n // TODO: Create enum for common auth types\\n\\n Auth(&'a str),\\n\\n // TODO: Create enum for common other capabilities\\n\\n Other(&'a str),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum RespTextCode<'a> {\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 85,\n \"score\": 3.550249516193007\n },\n {\n \"content\": \"#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum ListDefinedFlag {\\n\\n Noinferiors,\\n\\n Noselect,\\n\\n Marked,\\n\\n Unmarked,\\n\\n}\\n\\n\\n\\n// TODO: It is incorrect, because flags are case-insesitive\\n\\n// Add function for insesitive cmp\\n\\nimpl TryFrom<&str> for ListDefinedFlag {\\n\\n type Error = Error;\\n\\n\\n\\n fn try_from(value: &str) -> Result<Self, Self::Error> {\\n\\n match value {\\n\\n \\\"\\\\\\\\Noinferiors\\\" => Ok(Self::Noinferiors),\\n\\n \\\"\\\\\\\\Noselect\\\" => Ok(Self::Noselect),\\n\\n \\\"\\\\\\\\Marked\\\" => Ok(Self::Marked),\\n\\n \\\"\\\\\\\\Unmarked\\\" => Ok(Self::Unmarked),\\n\\n _ => Err(create_custom_error(format!(\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 86,\n \"score\": 3.406052199109396\n },\n {\n \"content\": \" envelope_addr,\\n\\n tag(\\\" \\\"),\\n\\n envelope_addr,\\n\\n tag(\\\" \\\"),\\n\\n envelope_addr,\\n\\n tag(\\\" \\\"),\\n\\n envelope_addr,\\n\\n tag(\\\" \\\"),\\n\\n nstring,\\n\\n tag(\\\" \\\"),\\n\\n nstring,\\n\\n )),\\n\\n tag(\\\")\\\"),\\n\\n ),\\n\\n |(\\n\\n date,\\n\\n _,\\n\\n subject,\\n\\n _,\\n\\n from,\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 87,\n \"score\": 3.1811955620990844\n },\n {\n \"content\": \" date_month,\\n\\n tag(\\\"-\\\"),\\n\\n date_year,\\n\\n tag(\\\" \\\"),\\n\\n time,\\n\\n tag(\\\" \\\"),\\n\\n zone,\\n\\n )),\\n\\n tag(\\\"\\\\\\\"\\\"),\\n\\n ),\\n\\n |(day, _, month, _, year, _, time, _, zone)| DateTime {\\n\\n day,\\n\\n month,\\n\\n year,\\n\\n time,\\n\\n zone,\\n\\n },\\n\\n )(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/rfc3501/grammar.rs\",\n \"rank\": 88,\n \"score\": 2.9044304796054123\n },\n {\n \"content\": \" Rfc822Text(Option<&'a str>),\\n\\n Rfc822Size(u32),\\n\\n Flags(Vec<MsgFlag<'a>>),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum MessageData<'a> {\\n\\n Expunge(u32),\\n\\n Fetch(MsgAtt<'a>),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct Time {\\n\\n pub(crate) hours: u8,\\n\\n pub(crate) minutes: u8,\\n\\n pub(crate) seconds: u8,\\n\\n}\\n\\n\\n\\n#[derive(Clone, Copy, Debug, Eq, PartialEq)]\\n\\npub(crate) enum Month {\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 89,\n \"score\": 2.2953873223969303\n },\n {\n \"content\": \"pub(crate) struct TaggedResponse<'a> {\\n\\n pub(crate) tag: Tag,\\n\\n pub(crate) resp: RespCond<'a>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum UntaggedResponse<'a> {\\n\\n RespCond(RespCond<'a>),\\n\\n RespBye(ByeResponse<'a>),\\n\\n MailBox(MailBoxData<'a>),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct RespCond<'a> {\\n\\n pub(crate) status: ImapResult,\\n\\n pub(crate) text: RespText<'a>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct ByeResponse<'a> {\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 90,\n \"score\": 2.0220976468160226\n },\n {\n \"content\": \" \\\"Can not convert {} into ListDefinedFlag\\\",\\n\\n value\\n\\n ))),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) enum ListFlag<'a> {\\n\\n Defined(ListDefinedFlag),\\n\\n Extension(&'a str),\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a str> for ListFlag<'a> {\\n\\n fn from(s: &'a str) -> Self {\\n\\n if let Ok(v) = ListDefinedFlag::try_from(s) {\\n\\n Self::Defined(v)\\n\\n } else {\\n\\n Self::Extension(s)\\n\\n }\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 91,\n \"score\": 1.800870473619605\n },\n {\n \"content\": \"//! IMAP client implementation\\n\\n\\n\\n#![warn(rust_2018_idioms, /*missing_docs,*/ missing_debug_implementations)]\\n\\n#![allow(dead_code)] /* allow on develop stage */\\n\\n\\n\\npub mod client;\\n\\npub mod error;\\n\\nmod imapconnection;\\n\\nmod parser;\\n\\nmod tag;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 92,\n \"score\": 1.6047679171836138\n },\n {\n \"content\": \" Jan,\\n\\n Feb,\\n\\n Mar,\\n\\n Apr,\\n\\n May,\\n\\n Jun,\\n\\n Jul,\\n\\n Aug,\\n\\n Sep,\\n\\n Oct,\\n\\n Nov,\\n\\n Dec,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct DateTime {\\n\\n pub(crate) day: u8,\\n\\n pub(crate) month: Month,\\n\\n pub(crate) year: u16,\\n\\n pub(crate) time: Time,\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 93,\n \"score\": 1.547012866919586\n },\n {\n \"content\": \" Alert,\\n\\n BadCharset(Vec<&'a str>),\\n\\n Capability(Vec<Capability<'a>>),\\n\\n Parse,\\n\\n PermanentFlags(Vec<Flag<'a>>),\\n\\n ReadOnly,\\n\\n ReadWrite,\\n\\n TryCreate,\\n\\n UidNext(u32),\\n\\n UidValidity(u32),\\n\\n Unseen(u32),\\n\\n // TODO: add last branch\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq)]\\n\\npub(crate) struct RespText<'a> {\\n\\n pub(crate) code: Vec<RespTextCode<'a>>,\\n\\n pub(crate) text: &'a str,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser/types.rs\",\n \"rank\": 94,\n \"score\": 1.4912957511420668\n }\n]","isConversational":false}}},{"rowIdx":1175,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/compaction/value.rs"},"repo_name":{"kind":"string","value":"timothee-haudebourg/json-ld"},"commit":{"kind":"string","value":"0b44aa736b681893e75ce282c67511480c992901"},"file_code":{"kind":"string","value":"use super::{compact_iri, JsonSrc, Options};\nuse crate::{\n\tcontext::{self, Inversible, Loader, Local},\n\tsyntax::{Container, ContainerType, Keyword, Term, Type},\n\tutil::{AsAnyJson, AsJson, JsonFrom},\n\tContextMut, Error, Id, Loc, Reference, Value,\n};\n\npub async fn compact_indexed_value_with<\n\tJ: JsonSrc,\n\tK: JsonFrom<J>,\n\tT: Sync + Send + Id,\n\tC: ContextMut<T>,\n\tL: Loader,\n\tM,\n>(\n\tvalue: &Value<J, T>,\n\tindex: Option<&str>,\n\tactive_context: Inversible<T, &C>,\n\tactive_property: Option<&str>,\n\tloader: &mut L,\n\toptions: Options,\n\tmeta: M,\n) -> Result<K, Error>\nwhere\n\tC: Sync + Send,\n\tC::LocalContext: Send + Sync + From<L::Output>,\n\tL: Sync + Send,\n\tM: Send + Sync + Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\n{\n\t\n\tlet mut active_context = active_context.into_borrowed();\n\tif let Some(active_property) = active_property {\n\t\tif let Some(active_property_definition) = active_context.get(active_property) {\n\t\t\tif let Some(local_context) = &active_property_definition.context {\n\t\t\t\tactive_context = Inversible::new(\n\t\t\t\t\tlocal_context\n\t\t\t\t\t\t.process_with(\n\t\t\t\t\t\t\t*active_context.as_ref(),\n\t\t\t\t\t\t\tloader,\n\t\t\t\t\t\t\tactive_property_definition.base_url(),\n\t\t\t\t\t\t\tcontext::ProcessingOptions::from(options).with_override(),\n\t\t\t\t\t\t)\n\t\t\t\t\t\t.await\n\t\t\t\t\t\t.map_err(Loc::unwrap)?\n\t\t\t\t\t\t.into_inner(),\n\t\t\t\t)\n\t\t\t\t.into_owned()\n\t\t\t}\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\n\t\n\n\t\n\tlet mut result = K::Object::default();\n\n\t\n\t\n\t\n\t\n\n\t\n\t\n\n\tlet active_property_definition = match active_property {\n\t\tSome(active_property) => active_context.get(active_property),\n\t\tNone => None,\n\t};\n\n\t\n\t\n\tlet language = match active_property_definition {\n\t\tSome(def) => match def.language.as_ref() {\n\t\t\tSome(lang) => lang.as_ref().map(|l| l.as_ref()).option(),\n\t\t\tNone => active_context.default_language(),\n\t\t},\n\t\tNone => active_context.default_language(),\n\t};\n\n\t\n\t\n\tlet direction = match active_property_definition {\n\t\tSome(def) => match def.direction {\n\t\t\tSome(dir) => dir.option(),\n\t\t\tNone => active_context.default_base_direction(),\n\t\t},\n\t\tNone => active_context.default_base_direction(),\n\t};\n\n\t\n\t\n\n\t\n\t\n\tlet type_mapping: Option<Type<&T>> = match active_property_definition {\n\t\tSome(def) => def.typ.as_ref().map(|t| t.into()),\n\t\tNone => None,\n\t};\n\n\tlet container_mapping = match active_property_definition {\n\t\tSome(def) => def.container,\n\t\tNone => Container::None,\n\t};\n\n\tlet remove_index =\n\t\t(index.is_some() && container_mapping.contains(ContainerType::Index)) || index.is_none();\n\n\tmatch value {\n\t\tValue::Literal(lit, ty) => {\n\t\t\tuse crate::object::value::Literal;\n\t\t\tif ty.as_ref().map(Type::Ref) == type_mapping && remove_index {\n\t\t\t\tmatch lit {\n\t\t\t\t\tLiteral::Null => return Ok(K::null(meta(None))),\n\t\t\t\t\tLiteral::Boolean(b) => return Ok(b.as_json_with(meta(None))),\n\t\t\t\t\tLiteral::Number(n) => return Ok(K::number(n.clone().into(), meta(None))),\n\t\t\t\t\tLiteral::String(s) => {\n\t\t\t\t\t\tif ty.is_some() || (language.is_none() && direction.is_none()) {\n\t\t\t\t\t\t\treturn Ok(s.as_json_with(meta(None)));\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\t\tfalse,\n\t\t\t\t\t\t\t\toptions,\n\t\t\t\t\t\t\t)?;\n\t\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\t\ts.as_json_with(meta(None)),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tmatch lit {\n\t\t\t\t\tLiteral::Null => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\tK::null(meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tLiteral::Boolean(b) => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\tb.as_json_with(meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tLiteral::Number(n) => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\tK::number(n.clone().into(), meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tLiteral::String(s) => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\ts.as_json_with(meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif let Some(ty) = ty {\n\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Keyword(Keyword::Type),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tlet compact_ty = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Ref(Reference::Id(ty.clone())),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tresult.insert(\n\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\tmatch compact_ty {\n\t\t\t\t\t\t\tSome(s) => K::string(s.as_str().into(), meta(None)),\n\t\t\t\t\t\t\tNone => K::null(meta(None)),\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\t\tValue::LangString(ls) => {\n\t\t\tlet ls_language = ls.language(); \n\t\t\tlet ls_direction = ls.direction(); \n\n\t\t\tif remove_index\n\t\t\t&& (ls_language.is_none() || language == ls_language) \n\t\t\t&& (ls_direction.is_none() || direction == ls_direction)\n\t\t\t{\n\t\t\t\t\n\t\t\t\treturn Ok(ls.as_str().as_json_with(meta(None)));\n\t\t\t} else {\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tresult.insert(\n\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\tK::string(ls.as_str().into(), meta(None)),\n\t\t\t\t);\n\n\t\t\t\tif let Some(language) = ls.language() {\n\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Keyword(Keyword::Language),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tresult.insert(\n\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\tlanguage.as_json_with(meta(None)),\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\tif let Some(direction) = ls.direction() {\n\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Keyword(Keyword::Direction),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tresult.insert(\n\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\tdirection.as_json_with(meta(None)),\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tValue::Json(value) => {\n\t\t\tif type_mapping == Some(Type::Json) && remove_index {\n\t\t\t\treturn Ok(value.as_json_with(meta));\n\t\t\t} else {\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tresult.insert(\n\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\tvalue.as_json_with(meta.clone()),\n\t\t\t\t);\n\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Type),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tlet compact_ty = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Json),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tresult.insert(\n\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\tmatch compact_ty {\n\t\t\t\t\t\tSome(s) => K::string(s.as_str().into(), meta(None)),\n\t\t\t\t\t\tNone => K::null(meta(None)),\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n\n\tif !remove_index {\n\t\tif let Some(index) = index {\n\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\tactive_context.as_ref(),\n\t\t\t\t&Term::Keyword(Keyword::Index),\n\t\t\t\ttrue,\n\t\t\t\tfalse,\n\t\t\t\toptions,\n\t\t\t)?;\n\t\t\tresult.insert(\n\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\tindex.as_json_with(meta(None)),\n\t\t\t);\n\t\t}\n\t}\n\n\tOk(K::object(result, meta(None)))\n}\n"},"prefix":{"kind":"string","value":"use super::{compact_iri, JsonSrc, Options};\nuse crate::{\n\tcontext::{self, Inversible, Loader, Local},\n\tsyntax::{Container, ContainerType, Keyword, Term, Type},\n\tutil::{AsAnyJson, AsJson, JsonFrom},\n\tContextMut, Error, Id, Loc, Reference, Value,\n};\n\npub async fn compact_indexed_value_with<\n\tJ: JsonSrc,\n\tK: JsonFrom<J>,\n\tT: Sync + Send + Id,\n\tC: ContextMut<T>,\n\tL: Loader,\n\tM,\n>(\n\tvalue: &Value<J, T>,\n\tindex: Option<&str>,\n\tactive_context: Inversible<T, &C>,\n\tactive_property: Option<&str>,\n\tloader: &mut L,\n\toptions: Options,\n\tmeta: M,\n) -> Result<K, Error>\nwhere\n\tC: Sync + Send,\n\tC::LocalContext: Send + Sync + From<L::Output>,\n\tL: Sync + Send,\n\tM: Send + Sync + Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\n{\n\t\n\tlet mut active_context = active_context.into_borrowed();\n\tif let Some(active_property) = active_property {\n\t\tif let Some(active_property_definition) = active_context.get(active_property) {\n\t\t\tif let Some(local_context) = &active_property_definition.context {\n\t\t\t\tactive_context = Inversible::new(\n\t\t\t\t\tlocal_context\n\t\t\t\t\t\t.process_with(\n\t\t\t\t\t\t\t*active_context.as_ref(),\n\t\t\t\t\t\t\tloader,\n\t\t\t\t\t\t\tactive_property_definition.base_url(),\n\t\t\t\t\t\t\tcontext::ProcessingOptions::from(options).with_override(),\n\t\t\t\t\t\t)\n\t\t\t\t\t\t.await\n\t\t\t\t\t\t.map_err(Loc::unwrap)?\n\t\t\t\t\t\t.into_inner(),\n\t\t\t\t)\n\t\t\t\t.into_owned()\n\t\t\t}\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\n\t\n\n\t\n\tlet mut result = K::Object::default();\n\n\t\n\t\n\t\n\t\n\n\t\n\t\n\n\tlet active_property_definition = match active_property {\n\t\tSome(active_property) => active_context.get(active_property),\n\t\tNone => None,\n\t};\n\n\t\n\t\n\tlet language = match active_property_definition {\n\t\tSome(def) => "},"suffix":{"kind":"string","value":",\n\t\tNone => active_context.default_language(),\n\t};\n\n\t\n\t\n\tlet direction = match active_property_definition {\n\t\tSome(def) => match def.direction {\n\t\t\tSome(dir) => dir.option(),\n\t\t\tNone => active_context.default_base_direction(),\n\t\t},\n\t\tNone => active_context.default_base_direction(),\n\t};\n\n\t\n\t\n\n\t\n\t\n\tlet type_mapping: Option<Type<&T>> = match active_property_definition {\n\t\tSome(def) => def.typ.as_ref().map(|t| t.into()),\n\t\tNone => None,\n\t};\n\n\tlet container_mapping = match active_property_definition {\n\t\tSome(def) => def.container,\n\t\tNone => Container::None,\n\t};\n\n\tlet remove_index =\n\t\t(index.is_some() && container_mapping.contains(ContainerType::Index)) || index.is_none();\n\n\tmatch value {\n\t\tValue::Literal(lit, ty) => {\n\t\t\tuse crate::object::value::Literal;\n\t\t\tif ty.as_ref().map(Type::Ref) == type_mapping && remove_index {\n\t\t\t\tmatch lit {\n\t\t\t\t\tLiteral::Null => return Ok(K::null(meta(None))),\n\t\t\t\t\tLiteral::Boolean(b) => return Ok(b.as_json_with(meta(None))),\n\t\t\t\t\tLiteral::Number(n) => return Ok(K::number(n.clone().into(), meta(None))),\n\t\t\t\t\tLiteral::String(s) => {\n\t\t\t\t\t\tif ty.is_some() || (language.is_none() && direction.is_none()) {\n\t\t\t\t\t\t\treturn Ok(s.as_json_with(meta(None)));\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\t\tfalse,\n\t\t\t\t\t\t\t\toptions,\n\t\t\t\t\t\t\t)?;\n\t\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\t\ts.as_json_with(meta(None)),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tmatch lit {\n\t\t\t\t\tLiteral::Null => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\tK::null(meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tLiteral::Boolean(b) => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\tb.as_json_with(meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tLiteral::Number(n) => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\tK::number(n.clone().into(), meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tLiteral::String(s) => {\n\t\t\t\t\t\tresult.insert(\n\t\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\t\ts.as_json_with(meta(None)),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif let Some(ty) = ty {\n\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Keyword(Keyword::Type),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tlet compact_ty = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Ref(Reference::Id(ty.clone())),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tresult.insert(\n\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\tmatch compact_ty {\n\t\t\t\t\t\t\tSome(s) => K::string(s.as_str().into(), meta(None)),\n\t\t\t\t\t\t\tNone => K::null(meta(None)),\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\t\tValue::LangString(ls) => {\n\t\t\tlet ls_language = ls.language(); \n\t\t\tlet ls_direction = ls.direction(); \n\n\t\t\tif remove_index\n\t\t\t&& (ls_language.is_none() || language == ls_language) \n\t\t\t&& (ls_direction.is_none() || direction == ls_direction)\n\t\t\t{\n\t\t\t\t\n\t\t\t\treturn Ok(ls.as_str().as_json_with(meta(None)));\n\t\t\t} else {\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tresult.insert(\n\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\tK::string(ls.as_str().into(), meta(None)),\n\t\t\t\t);\n\n\t\t\t\tif let Some(language) = ls.language() {\n\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Keyword(Keyword::Language),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tresult.insert(\n\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\tlanguage.as_json_with(meta(None)),\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\tif let Some(direction) = ls.direction() {\n\t\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t\t&Term::Keyword(Keyword::Direction),\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t\tfalse,\n\t\t\t\t\t\toptions,\n\t\t\t\t\t)?;\n\t\t\t\t\tresult.insert(\n\t\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\t\tdirection.as_json_with(meta(None)),\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tValue::Json(value) => {\n\t\t\tif type_mapping == Some(Type::Json) && remove_index {\n\t\t\t\treturn Ok(value.as_json_with(meta));\n\t\t\t} else {\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Value),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tresult.insert(\n\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\tvalue.as_json_with(meta.clone()),\n\t\t\t\t);\n\n\t\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Type),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tlet compact_ty = compact_iri::<J, _, _>(\n\t\t\t\t\tactive_context.as_ref(),\n\t\t\t\t\t&Term::Keyword(Keyword::Json),\n\t\t\t\t\ttrue,\n\t\t\t\t\tfalse,\n\t\t\t\t\toptions,\n\t\t\t\t)?;\n\t\t\t\tresult.insert(\n\t\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\t\tmatch compact_ty {\n\t\t\t\t\t\tSome(s) => K::string(s.as_str().into(), meta(None)),\n\t\t\t\t\t\tNone => K::null(meta(None)),\n\t\t\t\t\t},\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t}\n\n\tif !remove_index {\n\t\tif let Some(index) = index {\n\t\t\tlet compact_key = compact_iri::<J, _, _>(\n\t\t\t\tactive_context.as_ref(),\n\t\t\t\t&Term::Keyword(Keyword::Index),\n\t\t\t\ttrue,\n\t\t\t\tfalse,\n\t\t\t\toptions,\n\t\t\t)?;\n\t\t\tresult.insert(\n\t\t\t\tK::new_key(compact_key.as_ref().unwrap().as_str(), meta(None)),\n\t\t\t\tindex.as_json_with(meta(None)),\n\t\t\t);\n\t\t}\n\t}\n\n\tOk(K::object(result, meta(None)))\n}\n"},"middle":{"kind":"string","value":"match def.language.as_ref() {\n\t\t\tSome(lang) => lang.as_ref().map(|l| l.as_ref()).option(),\n\t\t\tNone => active_context.default_language(),\n\t\t}"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"/// Get the `@value` field of a value object.\n\nfn value_value<J: JsonClone, K: JsonFrom<J>, T: Id, M>(value: &Value<J, T>, meta: M) -> K\n\nwhere\n\n\tM: Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\n\n{\n\n\tuse crate::object::value::Literal;\n\n\tmatch value {\n\n\t\tValue::Literal(lit, _ty) => match lit {\n\n\t\t\tLiteral::Null => K::null(meta(None)),\n\n\t\t\tLiteral::Boolean(b) => b.as_json_with(meta(None)),\n\n\t\t\tLiteral::Number(n) => K::number(n.clone().into(), meta(None)),\n\n\t\t\tLiteral::String(s) => s.as_json_with(meta(None)),\n\n\t\t},\n\n\t\tValue::LangString(str) => K::string(str.as_str().into(), meta(None)),\n\n\t\tValue::Json(json) => json.as_json_with(meta),\n\n\t}\n\n}\n\n\n","file_path":"src/compaction/mod.rs","rank":0,"score":333201.18401212303},{"content":"/// Convert a term to a node id, if possible.\n\n/// Return `None` if the term is `null`.\n\npub fn node_id_of_term<T: Id>(term: Term<T>) -> Option<Reference<T>> {\n\n\tmatch term {\n\n\t\tTerm::Null => None,\n\n\t\tTerm::Ref(prop) => Some(prop),\n\n\t\tTerm::Keyword(kw) => Some(Reference::Invalid(kw.into_str().to_string())),\n\n\t}\n\n}\n\n\n\n/// Expand a node object.\n\npub(crate) async fn expand_node<\n\n\t'a,\n\n\tJ: JsonExpand,\n\n\tT: 'a + Id + Send + Sync,\n\n\tC: ContextMut<T> + Send + Sync,\n\n\tL: Loader + Send + Sync,\n\n>(\n\n\tactive_context: &'a C,\n\n\ttype_scoped_context: &'a C,\n\n\tactive_property: ActiveProperty<'a, J>,\n\n\texpanded_entries: Vec<ExpandedEntry<'a, J, Term<T>>>,\n","file_path":"src/expansion/node.rs","rank":1,"score":298191.2292051495},{"content":"/// Expand a literal value.\n\n/// See <https://www.w3.org/TR/json-ld11-api/#value-expansion>.\n\npub fn expand_literal<J: JsonHash + JsonClone, T: Id, C: Context<T>>(\n\n\tsource: Option<loader::Id>,\n\n\tactive_context: &C,\n\n\tactive_property: ActiveProperty<J>,\n\n\tvalue: LiteralValue<J>,\n\n\twarnings: &mut Vec<Loc<Warning, J::MetaData>>,\n\n) -> Result<Indexed<Object<J, T>>, Error> {\n\n\tlet active_property_definition = active_context.get_opt(active_property.id());\n\n\n\n\tlet active_property_type = if let Some(active_property_definition) = active_property_definition\n\n\t{\n\n\t\tactive_property_definition.typ.clone()\n\n\t} else {\n\n\t\tNone\n\n\t};\n\n\n\n\tmatch active_property_type {\n\n\t\t// If the `active_property` has a type mapping in `active_context` that is `@id`, and the\n\n\t\t// `value` is a string, return a new map containing a single entry where the key is `@id` and\n\n\t\t// the value is the result of IRI expanding `value` using `true` for `document_relative` and\n","file_path":"src/expansion/literal.rs","rank":2,"score":256632.74104644492},{"content":"fn select_nest_result<'a, K: 'a + JsonBuild + JsonMut + JsonIntoMut, T: Id, C: ContextMut<T>, M>(\n\n\tresult: &'a mut K::Object,\n\n\tactive_context: Inversible<T, &C>,\n\n\titem_active_property: &str,\n\n\tcompact_arrays: bool,\n\n\tmeta: M,\n\n) -> Result<(&'a mut K::Object, Container, bool), Error>\n\nwhere\n\n\tM: Fn() -> K::MetaData,\n\n{\n\n\tlet (nest_result, container) = match active_context.get(item_active_property) {\n\n\t\tSome(term_definition) => {\n\n\t\t\tlet nest_result = match &term_definition.nest {\n\n\t\t\t\tSome(nest_term) => {\n\n\t\t\t\t\t// If nest term is not @nest,\n\n\t\t\t\t\t// or a term in the active context that expands to @nest,\n\n\t\t\t\t\t// an invalid @nest value error has been detected,\n\n\t\t\t\t\t// and processing is aborted.\n\n\t\t\t\t\tif nest_term != \"@nest\" {\n\n\t\t\t\t\t\tmatch active_context.get(nest_term.as_ref()) {\n","file_path":"src/compaction/property.rs","rank":3,"score":252034.9919326434},{"content":"/// Type composed of `J` JSON values that can be converted\n\n/// into a `K` JSON value.\n\npub trait AsJson<J: JsonClone, K: JsonFrom<J>> {\n\n\t/// Converts this value into a `K` JSON value using the given\n\n\t/// `meta` function to convert `J::MetaData` into `K::MetaData`.\n\n\tfn as_json_with(&self, meta: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData) -> K;\n\n\n\n\t/// Converts this value into a `K` JSON value.\n\n\t///\n\n\t/// The `K` value is annotated with the default value of `K::MetaData`.\n\n\tfn as_json(&self) -> K\n\n\twhere\n\n\t\tK::MetaData: Default,\n\n\t{\n\n\t\tself.as_json_with(|_| K::MetaData::default())\n\n\t}\n\n}\n\n\n","file_path":"src/util/json/build.rs","rank":4,"score":250855.3917039103},{"content":"// Default value for `document_relative` is `false` and for `vocab` is `true`.\n\npub fn expand_iri<T: Id, C: Context<T>, M: Clone>(\n\n\tsource: Option<loader::Id>,\n\n\tactive_context: &C,\n\n\tvalue: &str,\n\n\tmetadata: &M,\n\n\tdocument_relative: bool,\n\n\tvocab: bool,\n\n\twarnings: &mut Vec<Loc<Warning, M>>,\n\n) -> Term<T> {\n\n\tif let Ok(keyword) = Keyword::try_from(value) {\n\n\t\tTerm::Keyword(keyword)\n\n\t} else {\n\n\t\t// If value has the form of a keyword, a processor SHOULD generate a warning and return\n\n\t\t// null.\n\n\t\tif is_keyword_like(value) {\n\n\t\t\twarnings.push(Loc::new(\n\n\t\t\t\tWarning::KeywordLikeValue(value.to_string()),\n\n\t\t\t\tsource,\n\n\t\t\t\tmetadata.clone(),\n\n\t\t\t));\n","file_path":"src/expansion/iri.rs","rank":5,"score":244422.88054142243},{"content":"fn optional_string<K: JsonBuild>(s: Option<String>, meta: K::MetaData) -> K {\n\n\tmatch s {\n\n\t\tSome(s) => K::string(s.as_str().into(), meta),\n\n\t\tNone => K::null(meta),\n\n\t}\n\n}\n\n\n\n/// Compaction options.\n\n#[derive(Clone, Copy)]\n\npub struct Options {\n\n\t/// JSON-LD processing mode.\n\n\tpub processing_mode: ProcessingMode,\n\n\n\n\t/// Determines if IRIs are compacted relative to the provided base IRI or document location when compacting.\n\n\tpub compact_to_relative: bool,\n\n\n\n\t/// If set to `true`, arrays with just one element are replaced with that element during compaction.\n\n\t/// If set to `false`, all arrays will remain arrays even if they have just one element.\n\n\tpub compact_arrays: bool,\n\n\n","file_path":"src/compaction/mod.rs","rank":6,"score":240584.95312258805},{"content":"/// Converts a JSON value into the same JSON value represented with another type.\n\nfn json_to_json<J: JsonClone, K: JsonFrom<J>>(\n\n\tinput: &J,\n\n\tm: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\n\n) -> K {\n\n\tlet meta: K::MetaData = m(Some(input.metadata()));\n\n\tmatch input.as_value_ref() {\n\n\t\tValueRef::Null => K::null(meta),\n\n\t\tValueRef::Boolean(b) => K::boolean(b, meta),\n\n\t\tValueRef::Number(n) => K::number(n.clone().into(), meta),\n\n\t\tValueRef::String(s) => K::string((&**s).into(), meta),\n\n\t\tValueRef::Array(a) => K::array(\n\n\t\t\ta.iter()\n\n\t\t\t\t.map(|value| json_to_json(&*value, m.clone()))\n\n\t\t\t\t.collect(),\n\n\t\t\tmeta,\n\n\t\t),\n\n\t\tValueRef::Object(o) => K::object(\n\n\t\t\to.iter()\n\n\t\t\t\t.map(|(key, value)| {\n\n\t\t\t\t\t(\n","file_path":"src/util/json/build.rs","rank":7,"score":229751.04597655736},{"content":"/// Checks if the given context has a protected definition.\n\npub fn has_protected_items<T: Id, C: Context<T>>(active_context: &C) -> bool {\n\n\tfor (_, definition) in active_context.definitions() {\n\n\t\tif definition.protected {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\n\n\tfalse\n\n}\n\n\n","file_path":"src/context/processing.rs","rank":8,"score":223777.66258637048},{"content":"pub fn json_ld_eq<J: Json, K: Json>(a: &J, b: &K) -> bool\n\nwhere\n\n\tJ::Number: PartialEq<K::Number>,\n\n{\n\n\tmatch (a.as_value_ref(), b.as_value_ref()) {\n\n\t\t(ValueRef::Array(a), ValueRef::Array(b)) if a.len() == b.len() => {\n\n\t\t\tlet mut selected = Vec::with_capacity(a.len());\n\n\t\t\tselected.resize(a.len(), false);\n\n\n\n\t\t\t'a_items: for item in a.iter() {\n\n\t\t\t\tfor (i, sel) in selected.iter_mut().enumerate() {\n\n\t\t\t\t\tif !*sel && json_ld_eq(&*item, &*b.get(i).unwrap()) {\n\n\t\t\t\t\t\t*sel = true;\n\n\t\t\t\t\t\tcontinue 'a_items;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\n","file_path":"src/util/json/build.rs","rank":9,"score":221149.21036386586},{"content":"/// Local context used for context expansion.\n\n///\n\n/// Local contexts can be seen as \"abstract contexts\" that can be processed to enrich an\n\n/// existing active context.\n\npub trait Local<T: Id = IriBuf>: JsonSendSync {\n\n\t/// Process the local context with specific options.\n\n\tfn process_full<'a, 's: 'a, C: ContextMut<T> + Send + Sync, L: Loader + Send + Sync>(\n\n\t\t&'s self,\n\n\t\tactive_context: &'a C,\n\n\t\tstack: ProcessingStack,\n\n\t\tloader: &'a mut L,\n\n\t\tbase_url: Option<Iri<'a>>,\n\n\t\toptions: ProcessingOptions,\n\n\t) -> BoxFuture<'a, ProcessingResult<'s, Self, C>>\n\n\twhere\n\n\t\tC::LocalContext: From<L::Output> + From<Self>,\n\n\t\tL::Output: Into<Self>,\n\n\t\tT: Send + Sync;\n\n\n\n\t/// Process the local context with specific options.\n\n\tfn process_with<'a, 's: 'a, C: ContextMut<T> + Send + Sync, L: Loader + Send + Sync>(\n\n\t\t&'s self,\n\n\t\tactive_context: &'a C,\n\n\t\tloader: &'a mut L,\n","file_path":"src/context/mod.rs","rank":10,"score":220148.93547088493},{"content":"/// Type that can be compacted with an index.\n\npub trait CompactIndexed<J: JsonSrc, T: Id> {\n\n\t/// Compact with the given optional index.\n\n\tfn compact_indexed<'a, K: JsonFrom<J>, C: ContextMut<T>, L: Loader, M>(\n\n\t\t&'a self,\n\n\t\tindex: Option<&'a str>,\n\n\t\tactive_context: Inversible<T, &'a C>,\n\n\t\ttype_scoped_context: Inversible<T, &'a C>,\n\n\t\tactive_property: Option<&'a str>,\n\n\t\tloader: &'a mut L,\n\n\t\toptions: Options,\n\n\t\tmeta: M,\n\n\t) -> BoxFuture<'a, Result<K, Error>>\n\n\twhere\n\n\t\tJ: 'a,\n\n\t\tT: 'a,\n\n\t\tC: Sync + Send,\n\n\t\tC::LocalContext: Send + Sync + From<L::Output>,\n\n\t\tL: Sync + Send,\n\n\t\tM: 'a + Send + Sync + Clone + Fn(Option<&J::MetaData>) -> K::MetaData;\n\n}\n","file_path":"src/compaction/mod.rs","rank":11,"score":215402.8616467805},{"content":"/// JSON value that can be converted from a `J` value.\n\npub trait JsonFrom<J: Json> = JsonMutSendSync + JsonBuild + JsonIntoMut\n\nwhere <Self as Json>::Number: From<<J as Json>::Number>;\n\n\n","file_path":"src/util/json/build.rs","rank":12,"score":214278.88358181005},{"content":"/// Hash a JSON value.\n\n///\n\n/// This bypasses any implementations of `Hash` for `J`\n\n/// since most JSON implementations (such as `serde_json`) do\n\n/// no provide it.\n\npub fn hash_json<J: JsonHash, H: Hasher>(json: &J, hasher: &mut H) {\n\n\tuse cc_traits::{Iter, MapIter};\n\n\tmatch json.as_value_ref() {\n\n\t\tValueRef::Null => (),\n\n\t\tValueRef::Boolean(b) => b.hash(hasher),\n\n\t\tValueRef::Number(n) => n.hash(hasher),\n\n\t\tValueRef::String(s) => s.hash(hasher),\n\n\t\tValueRef::Array(ary) => {\n\n\t\t\tfor item in ary.iter() {\n\n\t\t\t\thash_json(&*item, hasher)\n\n\t\t\t}\n\n\t\t}\n\n\t\tValueRef::Object(obj) => {\n\n\t\t\t// Elements must be combined with a associative and commutative operation •.\n\n\t\t\t// (u64, •, 0) must form a commutative monoid.\n\n\t\t\t// This is satisfied by • = u64::wrapping_add.\n\n\t\t\tlet mut hash = 0;\n\n\t\t\tfor (key, value) in obj.iter() {\n\n\t\t\t\tlet mut h = DefaultHasher::new();\n\n\t\t\t\t(*key).hash(&mut h);\n\n\t\t\t\thash_json(&*value, &mut h);\n\n\t\t\t\thash = u64::wrapping_add(hash, h.finish());\n\n\t\t\t}\n\n\t\t\thasher.write_u64(hash);\n\n\t\t}\n\n\t}\n\n}\n","file_path":"src/util/json.rs","rank":13,"score":199606.56048014964},{"content":"/// Type that can be compacted.\n\npub trait Compact<J: JsonSrc, T: Id> {\n\n\t/// Compact a JSON-LD document into a `K` JSON value with the provided\n\n\t/// type scoped context, active property and options.\n\n\t///\n\n\t/// Unless you know what you are doing, you will probably prefer\n\n\t/// to use the [`compact`](Compact::compact) and [`compact_with`](Compact::compact_with) functions.\n\n\tfn compact_full<'a, K: JsonFrom<J>, C: ContextMut<T>, L: Loader, M>(\n\n\t\t&'a self,\n\n\t\tactive_context: Inversible<T, &'a C>,\n\n\t\ttype_scoped_context: Inversible<T, &'a C>,\n\n\t\tactive_property: Option<&'a str>,\n\n\t\tloader: &'a mut L,\n\n\t\toptions: Options,\n\n\t\tmeta: M,\n\n\t) -> BoxFuture<'a, Result<K, Error>>\n\n\twhere\n\n\t\tJ: 'a,\n\n\t\tT: 'a,\n\n\t\tC: Sync + Send,\n\n\t\tC::LocalContext: Send + Sync + From<L::Output>,\n","file_path":"src/compaction/mod.rs","rank":14,"score":186505.79833668892},{"content":"/// Hash a [`HashMap`].\n\n///\n\n/// The standard library does not provide (yet) a `Hash` implementation\n\n/// for the [`HashMap`] type. This can be used instead.\n\n///\n\n/// Note that this function not particularly strong and does\n\n/// not protect against DoS attacks.\n\npub fn hash_map<K: Hash, V: Hash, H: Hasher>(map: &HashMap<K, V>, hasher: &mut H) {\n\n\t// See: https://github.com/rust-lang/rust/pull/48366\n\n\t// Elements must be combined with a associative and commutative operation •.\n\n\t// (u64, •, 0) must form a commutative monoid.\n\n\t// This is satisfied by • = u64::wrapping_add.\n\n\tlet mut hash = 0;\n\n\tfor entry in map {\n\n\t\tlet mut h = DefaultHasher::new();\n\n\t\tentry.hash(&mut h);\n\n\t\thash = u64::wrapping_add(hash, h.finish());\n\n\t}\n\n\n\n\thasher.write_u64(hash);\n\n}\n","file_path":"src/util/mod.rs","rank":15,"score":180620.1758341911},{"content":"/// Default value of `as_array` is false.\n\nfn add_value<K: JsonBuild + JsonMut>(\n\n\tmap: &mut K::Object,\n\n\tkey: &str,\n\n\tvalue: K,\n\n\tas_array: bool,\n\n\tmeta: impl Clone + Fn() -> K::MetaData,\n\n) {\n\n\tmatch map.get(key).map(|value| value.is_array()) {\n\n\t\tSome(false) => {\n\n\t\t\tlet value = map.remove(key).unwrap();\n\n\t\t\tmap.insert(\n\n\t\t\t\tK::new_key(key, meta()),\n\n\t\t\t\tK::array(Some(value).into_iter().collect(), meta()),\n\n\t\t\t);\n\n\t\t}\n\n\t\tNone if as_array => {\n\n\t\t\tmap.insert(K::new_key(key, meta()), K::empty_array(meta()));\n\n\t\t}\n\n\t\t_ => (),\n\n\t}\n","file_path":"src/compaction/mod.rs","rank":16,"score":176514.44183118083},{"content":"/// Converts the given `json` value into an array\n\n/// if it is not already.\n\n///\n\n/// Returns a tuple providing an iterator over the items\n\n/// of the array, and the size of the array.\n\npub fn as_array<J: Json>(json: &J) -> (AsArray<J>, usize) {\n\n\tuse cc_traits::{Iter, Len};\n\n\tmatch json.as_value_ref() {\n\n\t\tValueRef::Array(ary) => (AsArray::Array(ary.iter()), ary.len()),\n\n\t\t_ => (AsArray::NotArray(Some(json)), 1),\n\n\t}\n\n}\n\n\n","file_path":"src/util/json.rs","rank":17,"score":175736.35360402166},{"content":"fn filter_top_level_item<J: JsonHash, T: Id>(item: &Indexed<Object<J, T>>) -> bool {\n\n\t// Remove dangling values.\n\n\t!matches!(item.inner(), Object::Value(_))\n\n}\n\n\n\npub enum ActiveProperty<'a, J: Json> {\n\n\tNone,\n\n\tSome(&'a str, &'a J::MetaData),\n\n}\n\n\n\nimpl<'a, J: Json> ActiveProperty<'a, J> {\n\n\tpub fn is_none(&self) -> bool {\n\n\t\tmatches!(self, Self::None)\n\n\t}\n\n\n\n\tpub fn is_some(&self) -> bool {\n\n\t\tmatches!(self, Self::Some(_, _))\n\n\t}\n\n\n\n\tpub fn id(&self) -> Option<&'a str> {\n","file_path":"src/expansion/mod.rs","rank":18,"score":175322.5807561758},{"content":"/// Unique identifier types.\n\n///\n\n/// While JSON-LD uses [Internationalized Resource Identifiers (IRIs)](https://en.wikipedia.org/wiki/Internationalized_resource_identifier)\n\n/// to uniquely identify each node,\n\n/// this crate does not imposes the internal representation of identifiers.\n\n///\n\n/// Whatever type you choose, it must implement this trait to usure that:\n\n/// - there is a low cost bijection with IRIs,\n\n/// - it can be cloned ([`Clone`]),\n\n/// - it can be compared ([`PartialEq`], [`Eq`]),\n\n/// - it can be hashed ([`Hash`]).\n\n///\n\n/// # Using `enum` types\n\n/// If you know in advance which IRIs will be used by your implementation,\n\n/// one possibility is to use a `enum` type as identifier.\n\n/// This can be done throught the use of the [`Lexicon`](`crate::Lexicon`) type along with the\n\n/// [`iref-enum`](https://crates.io/crates/iref-enum) crate:\n\n/// ```\n\n/// use iref_enum::*;\n\n/// use json_ld::Lexicon;\n\n/// use ijson::IValue;\n\n///\n\n/// /// Vocabulary used in the implementation.\n\n/// #[derive(IriEnum, Clone, Copy, PartialEq, Eq, Hash)]\n\n/// #[iri_prefix(\"rdfs\" = \"http://www.w3.org/2000/01/rdf-schema#\")]\n\n/// #[iri_prefix(\"manifest\" = \"http://www.w3.org/2001/sw/DataAccess/tests/test-manifest#\")]\n\n/// #[iri_prefix(\"vocab\" = \"https://w3c.github.io/json-ld-api/tests/vocab#\")]\n\n/// pub enum Vocab {\n\n/// #[iri(\"rdfs:comment\")] Comment,\n\n///\n\n/// #[iri(\"manifest:name\")] Name,\n\n/// #[iri(\"manifest:entries\")] Entries,\n\n/// #[iri(\"manifest:action\")] Action,\n\n/// #[iri(\"manifest:result\")] Result,\n\n///\n\n/// #[iri(\"vocab:PositiveEvaluationTest\")] PositiveEvalTest,\n\n/// #[iri(\"vocab:NegativeEvaluationTest\")] NegativeEvalTest,\n\n/// #[iri(\"vocab:option\")] Option,\n\n/// #[iri(\"vocab:specVersion\")] SpecVersion,\n\n/// #[iri(\"vocab:processingMode\")] ProcessingMode,\n\n/// #[iri(\"vocab:expandContext\")] ExpandContext,\n\n/// #[iri(\"vocab:base\")] Base\n\n/// }\n\n///\n\n/// /// A fully functional identifier type.\n\n/// pub type Id = Lexicon<Vocab>;\n\n///\n\n/// fn handle_node(node: &json_ld::Node<IValue, Id>) {\n\n/// for name in node.get(Vocab::Name) { // <- note that we can directly use `Vocab` here.\n\n/// println!(\"node name: {}\", name.as_str().unwrap());\n\n/// }\n\n/// }\n\n/// ```\n\npub trait Id: AsIri + Clone + PartialEq + Eq + Hash {\n\n\t/// Create an identifier from its IRI.\n\n\tfn from_iri(iri: Iri) -> Self;\n\n\n\n\t#[inline(always)]\n\n\tfn as_json<K: JsonBuild>(&self, meta: K::MetaData) -> K {\n\n\t\tK::string(self.as_iri().as_str().into(), meta)\n\n\t}\n\n}\n\n\n\nimpl Id for IriBuf {\n\n\t#[inline(always)]\n\n\tfn from_iri(iri: Iri) -> IriBuf {\n\n\t\tiri.into()\n\n\t}\n\n}\n\n\n\nimpl<T: Id> TermLike for T {\n\n\t#[inline(always)]\n\n\tfn as_str(&self) -> &str {\n\n\t\tself.as_iri().into_str()\n\n\t}\n\n\n\n\t#[inline(always)]\n\n\tfn as_iri(&self) -> Option<Iri> {\n\n\t\tSome(self.as_iri())\n\n\t}\n\n}\n","file_path":"src/id.rs","rank":19,"score":171743.32087855318},{"content":"/// Build an invalid reference and emit a warning.\n\nfn invalid<T: Id, M: Clone>(\n\n\tvalue: String,\n\n\tsource: Option<loader::Id>,\n\n\tmetadata: &M,\n\n\twarnings: &mut Vec<Loc<Warning, M>>,\n\n) -> Term<T> {\n\n\twarnings.push(Loc::new(\n\n\t\tWarning::MalformedIri(value.clone()),\n\n\t\tsource,\n\n\t\tmetadata.clone(),\n\n\t));\n\n\tReference::Invalid(value).into()\n\n}\n","file_path":"src/expansion/iri.rs","rank":20,"score":170477.73466020502},{"content":"/// Types that can be converted into a borrowed node reference.\n\n///\n\n/// This is a convenient trait is used to simplify the use of references.\n\n/// For instance consider the [`Node::get`](crate::Node::get) method, used to get the objects associated to the\n\n/// given reference property for a given node.\n\n/// It essentially have the following signature:\n\n/// ```ignore\n\n/// fn get(&self, id: &Reference<T>) -> Objects;\n\n/// ```\n\n/// However building a `Reference` by hand can be tedious, especially while using [`Lexicon`](crate::Lexicon) and\n\n/// [`Vocab`](crate::Vocab). It can be as verbose as `node.get(&Reference::Id(Lexicon::Id(MyVocab::Term)))`.\n\n/// Thanks to `ToReference` which is implemented by `Lexicon<V>` for any type `V` implementing `Vocab`,\n\n/// it is simplified into `node.get(MyVocab::Term)` (while the first syntax remains correct).\n\n/// The signature of `get` becomes:\n\n/// ```ignore\n\n/// fn get<R: ToReference<T>>(&self, id: R) -> Objects;\n\n/// ```\n\npub trait ToReference<T: Id> {\n\n\t/// The target type of the conversion, which can be borrowed as a `Reference<T>`.\n\n\ttype Reference: Borrow<Reference<T>>;\n\n\n\n\t/// Convert the value into a reference.\n\n\tfn to_ref(&self) -> Self::Reference;\n\n}\n\n\n\nimpl<'a, T: Id> ToReference<T> for &'a Reference<T> {\n\n\ttype Reference = &'a Reference<T>;\n\n\n\n\t#[inline(always)]\n\n\tfn to_ref(&self) -> Self::Reference {\n\n\t\tself\n\n\t}\n\n}\n","file_path":"src/reference.rs","rank":21,"score":168286.91401530785},{"content":"/// Build an invalid reference and emit a warning.\n\nfn invalid_iri<T: Id, M: Clone>(\n\n\tvalue: String,\n\n\tsource: Option<loader::Id>,\n\n\tmetadata: &M,\n\n\twarnings: &mut Vec<Loc<Warning, M>>,\n\n) -> Term<T> {\n\n\twarnings.push(Loc::new(\n\n\t\tWarning::MalformedIri(value.clone()),\n\n\t\tsource,\n\n\t\tmetadata.clone(),\n\n\t));\n\n\tReference::Invalid(value).into()\n\n}\n\n\n","file_path":"src/context/processing.rs","rank":22,"score":167270.96189073974},{"content":"/// JSON type that can be used by the compaction algorithm.\n\npub trait JsonSrc = JsonClone + JsonHash + JsonSendSync;\n\n\n\nmod iri;\n\nmod node;\n\nmod property;\n\nmod value;\n\n\n\npub(crate) use iri::*;\n\nuse node::*;\n\nuse property::*;\n\nuse value::*;\n\n\n","file_path":"src/compaction/mod.rs","rank":23,"score":166630.49974199955},{"content":"/// Hash an optional [`HashSet`].\n\npub fn hash_set_opt<T: Hash, H: Hasher>(set_opt: &Option<HashSet<T>>, hasher: &mut H) {\n\n\tif let Some(set) = set_opt.as_ref() {\n\n\t\thash_set(set, hasher)\n\n\t}\n\n}\n\n\n","file_path":"src/util/mod.rs","rank":24,"score":166137.72068546986},{"content":"pub trait Any<J: JsonHash, T: Id> {\n\n\tfn as_ref(&self) -> Ref<J, T>;\n\n\n\n\t#[inline]\n\n\tfn id<'a>(&'a self) -> Option<&Reference<T>>\n\n\twhere\n\n\t\tJ: 'a,\n\n\t{\n\n\t\tmatch self.as_ref() {\n\n\t\t\tRef::Node(n) => n.id.as_ref(),\n\n\t\t\t_ => None,\n\n\t\t}\n\n\t}\n\n\n\n\t#[inline]\n\n\tfn language<'a>(&'a self) -> Option<LenientLanguageTag>\n\n\twhere\n\n\t\tJ: 'a,\n\n\t\tT: 'a,\n\n\t{\n","file_path":"src/object/mod.rs","rank":25,"score":166017.21812694194},{"content":"/// JSON-LD context.\n\n///\n\n/// A context holds all the term definitions used to expand a JSON-LD value.\n\npub trait Context<T: Id = IriBuf>: Clone {\n\n\t// TODO Later\n\n\t// type Definitions<'a>: Iterator<Item = (&'a str, TermDefinition<T, Self>)>;\n\n\n\n\t/// The type of local contexts associated to this type of contexts.\n\n\ttype LocalContext: Local<T>;\n\n\n\n\t/// Create a newly-initialized active context with the given *base IRI*.\n\n\tfn new(base_iri: Option<Iri>) -> Self;\n\n\n\n\t/// Get the definition of a term.\n\n\tfn get(&self, term: &str) -> Option<&TermDefinition<T, Self>>;\n\n\n\n\tfn get_opt(&self, term: Option<&str>) -> Option<&TermDefinition<T, Self>> {\n\n\t\tif let Some(term) = term {\n\n\t\t\tself.get(term)\n\n\t\t} else {\n\n\t\t\tNone\n\n\t\t}\n\n\t}\n","file_path":"src/context/mod.rs","rank":26,"score":163539.3699577334},{"content":"type Id = Lexicon<Vocab>;\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n\tlet mut loader = Loader::<IValue>::new(|s| serde_json::from_str(s));\n\n\n\n\t// The JSON-LD document to expand.\n\n\tlet doc = loader\n\n\t\t.load(iri!(\n\n\t\t\t\"https://w3c.github.io/json-ld-api/tests/expand-manifest.jsonld\"\n\n\t\t))\n\n\t\t.await\n\n\t\t.unwrap();\n\n\n\n\t// Expansion.\n\n\tlet expanded_doc = doc\n\n\t\t.expand::<context::Json<IValue, Id>, _>(&mut loader)\n\n\t\t.await\n\n\t\t.unwrap();\n\n\n","file_path":"examples/reqwest-loader.rs","rank":27,"score":162889.98384171817},{"content":"pub fn is_keyword(str: &str) -> bool {\n\n\tKeyword::try_from(str).is_ok()\n\n}\n\n\n","file_path":"src/syntax/keyword.rs","rank":28,"score":156660.1044323514},{"content":"pub fn is_keyword_like(s: &str) -> bool {\n\n\tif s.len() > 1 {\n\n\t\tfor (i, c) in s.chars().enumerate() {\n\n\t\t\tif (i == 0 && c != '@') || (i > 0 && !is_alpha(c)) {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t\ttrue\n\n\t} else {\n\n\t\tfalse\n\n\t}\n\n}\n","file_path":"src/syntax/keyword.rs","rank":29,"score":156660.1044323514},{"content":"// Checks if the input term is an IRI ending with a gen-delim character, or a blank node identifier.\n\nfn is_gen_delim_or_blank<T: Id>(t: &Term<T>) -> bool {\n\n\tmatch t {\n\n\t\tTerm::Ref(Reference::Blank(_)) => true,\n\n\t\tTerm::Ref(Reference::Id(id)) => {\n\n\t\t\tif let Some(c) = id.as_iri().as_str().chars().last() {\n\n\t\t\t\tis_gen_delim(c)\n\n\t\t\t} else {\n\n\t\t\t\tfalse\n\n\t\t\t}\n\n\t\t}\n\n\t\t_ => false,\n\n\t}\n\n}\n\n\n","file_path":"src/context/processing.rs","rank":30,"score":155886.15333693865},{"content":"/// Mutable JSON-LD context.\n\npub trait ContextMut<T: Id = IriBuf>: Context<T> {\n\n\t/// Defines the given term.\n\n\tfn set(\n\n\t\t&mut self,\n\n\t\tterm: &str,\n\n\t\tdefinition: Option<TermDefinition<T, Self>>,\n\n\t) -> Option<TermDefinition<T, Self>>;\n\n\n\n\t/// Sets the base IRI of the context.\n\n\tfn set_base_iri(&mut self, iri: Option<Iri>);\n\n\n\n\t/// Sets the vocabulary.\n\n\tfn set_vocabulary(&mut self, vocab: Option<Term<T>>);\n\n\n\n\t/// Sets the default language.\n\n\tfn set_default_language(&mut self, lang: Option<LenientLanguageTagBuf>);\n\n\n\n\t/// Sets de default language base direction.\n\n\tfn set_default_base_direction(&mut self, dir: Option<Direction>);\n\n\n\n\t/// Sets the previous context.\n\n\tfn set_previous_context(&mut self, previous: Self);\n\n}\n\n\n","file_path":"src/context/mod.rs","rank":31,"score":155403.9141040239},{"content":"type LangDir = Nullable<(Option<LenientLanguageTagBuf>, Option<Direction>)>;\n\n\n","file_path":"src/context/inverse.rs","rank":32,"score":155231.99265009956},{"content":"/// Result of the `expand_node_entries` function.\n\ntype NodeEntriesExpensionResult<J, T> =\n\n\tResult<ExpandedNode<J, T>, Loc<Error, <J as Json>::MetaData>>;\n\n\n","file_path":"src/expansion/node.rs","rank":33,"score":154524.2454478619},{"content":"/// Type returned by the `expand_node_entries` function.\n\n///\n\n/// It is a tuple containing both the node being expanded\n\n/// and a boolean flag set to `true` if the node contains\n\n/// value object entries (in practice, if it has a `@language` entry).\n\ntype ExpandedNode<J, T> = (Indexed<Node<J, T>>, bool);\n\n\n","file_path":"src/expansion/node.rs","rank":34,"score":153371.23600625206},{"content":"pub trait JsonContext = JsonSendSync + JsonClone;\n\n\n\n/// Options of the Context Processing Algorithm.\n\n#[derive(Clone, Copy, PartialEq, Eq)]\n\npub struct ProcessingOptions {\n\n\t/// The processing mode\n\n\tpub processing_mode: ProcessingMode,\n\n\n\n\t/// Override protected definitions.\n\n\tpub override_protected: bool,\n\n\n\n\t/// Propagate the processed context.\n\n\tpub propagate: bool,\n\n}\n\n\n\nimpl ProcessingOptions {\n\n\t/// Return the same set of options, but with `override_protected` set to `true`.\n\n\tpub fn with_override(&self) -> ProcessingOptions {\n\n\t\tlet mut opt = *self;\n\n\t\topt.override_protected = true;\n","file_path":"src/context/mod.rs","rank":35,"score":150083.0570826471},{"content":"/// JSON document loader.\n\n///\n\n/// Each document is uniquely identified by the loader by a `u32`.\n\npub trait Loader {\n\n\t/// The type of documents that can be loaded.\n\n\ttype Document: Json;\n\n\n\n\t/// Returns the unique identifier associated to the given IRI, if any.\n\n\tfn id(&self, iri: Iri<'_>) -> Option<Id>;\n\n\n\n\t/// Returns the unique identifier associated to the given IRI, if any.\n\n\t///\n\n\t/// Returns `None` if the input `iri` is `None`.\n\n\t#[inline(always)]\n\n\tfn id_opt(&self, iri: Option<Iri<'_>>) -> Option<Id> {\n\n\t\tiri.map(|iri| self.id(iri)).flatten()\n\n\t}\n\n\n\n\t/// Returns the IRI with the given identifier, if any.\n\n\tfn iri(&self, id: Id) -> Option<Iri<'_>>;\n\n\n\n\t/// Loads the document behind the given IRI.\n\n\tfn load<'a>(\n","file_path":"src/loader.rs","rank":36,"score":143972.33304379546},{"content":"pub trait Loader {\n\n\ttype Output;\n\n\n\n\t/// Returns the unique identifier associated to the given IRI, if any.\n\n\tfn id(&self, iri: Iri<'_>) -> Option<crate::loader::Id>;\n\n\n\n\t/// Returns the unique identifier associated to the given IRI, if any.\n\n\t///\n\n\t/// Returns `None` if the input `iri` is `None`.\n\n\t#[inline(always)]\n\n\tfn id_opt(&self, iri: Option<Iri<'_>>) -> Option<crate::loader::Id> {\n\n\t\tiri.map(|iri| self.id(iri)).flatten()\n\n\t}\n\n\n\n\t/// Returns the IRI with the given identifier, if any.\n\n\tfn iri(&self, id: crate::loader::Id) -> Option<Iri<'_>>;\n\n\n\n\tfn load_context<'a>(\n\n\t\t&'a mut self,\n\n\t\turl: Iri,\n","file_path":"src/context/loader.rs","rank":37,"score":141459.24707990457},{"content":"pub fn is_json_media_type(ty: &str) -> bool {\n\n\tty == \"application/json\" || ty == \"application/ld+json\"\n\n}\n\n\n\npub async fn load_remote_json_ld_document<J, P>(\n\n\turl: Iri<'_>,\n\n\tparser: &mut P,\n\n) -> Result<J, Error>\n\nwhere\n\n\tP: Send + Sync + FnMut(&str) -> Result<J, Error>,\n\n{\n\n\tlog::info!(\"loading remote document `{}'\", url);\n\n\tuse reqwest::header::*;\n\n\n\n\tlet client = reqwest::Client::new();\n\n\tlet request = client\n\n\t\t.get(url.as_str())\n\n\t\t.header(ACCEPT, \"application/ld+json, application/json\");\n\n\tlet response = request.send().await?;\n\n\n","file_path":"src/reqwest/mod.rs","rank":38,"score":139598.96823707287},{"content":"fn generate_test(entry: &Node<IValue, Id>) {\n\n\tlet name = entry.get(Vocab::Name).next().unwrap().as_str().unwrap();\n\n\tlet url = entry.get(Vocab::Action).next().unwrap().as_iri().unwrap();\n\n\tlet mut base_url = url;\n\n\tlet func_name = func_name(url.path().file_name().unwrap());\n\n\n\n\tlet mut processing_mode = ProcessingMode::JsonLd1_1;\n\n\tlet mut context_url = \"None\".to_string();\n\n\n\n\tfor option in entry.get(Vocab::Option) {\n\n\t\tif let Object::Node(option) = option.as_ref() {\n\n\t\t\tfor normative in option.get(Vocab::Normative) {\n\n\t\t\t\tif let Some(false) = normative.inner().as_bool() {\n\n\t\t\t\t\tinfo!(\"skipping test {} (non normative)\", url);\n\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\n\t\t\tfor spec_version in option.get(Vocab::SpecVersion) {\n\n\t\t\t\tif let Some(spec_version) = spec_version.as_str() {\n","file_path":"examples/generate-expand-tests.rs","rank":39,"score":139586.9855861585},{"content":"fn generate_test(entry: &Node<IValue, Id>) {\n\n\tlet name = entry.get(Vocab::Name).next().unwrap().as_str().unwrap();\n\n\tlet url = entry.get(Vocab::Action).next().unwrap().as_iri().unwrap();\n\n\tlet mut base_url = url;\n\n\n\n\tif url == \"https://w3c.github.io/json-ld-api/tests/compact/p004-in.jsonld\" {\n\n\t\twarn!(\n\n\t\t\t\"skipping invalid test {} (https://github.com/w3c/json-ld-api/issues/517)\",\n\n\t\t\turl\n\n\t\t);\n\n\t\treturn;\n\n\t}\n\n\n\n\tlet func_name = func_name(url.path().file_name().unwrap());\n\n\n\n\tlet mut processing_mode = ProcessingMode::JsonLd1_1;\n\n\tlet mut compact_arrays = true;\n\n\tlet mut context_url = \"None\".to_string();\n\n\n\n\tfor context in entry.get(Vocab::Context) {\n","file_path":"examples/generate-compact-tests.rs","rank":40,"score":139586.9855861585},{"content":"/// Trait for types that are or wrap a mutable context.\n\n///\n\n/// This trait is used by the [`Document::compact`](crate::Document::compact)\n\n/// function to accept either a context or a wrapper to a context.\n\npub trait ContextMutProxy<T: Id = IriBuf> {\n\n\ttype Target: ContextMut<T>;\n\n\n\n\t/// Returns a reference to the mutable context.\n\n\tfn deref(&self) -> &Self::Target;\n\n}\n\n\n\n/// Context processing result.\n\npub type ProcessingResult<'s, J, C> =\n\n\tResult<Processed<'s, J, C>, Loc<Error, <J as generic_json::Json>::MetaData>>;\n\n\n","file_path":"src/context/mod.rs","rank":41,"score":139427.98776343325},{"content":"type Id = Lexicon<Foaf>;\n\n\n\n#[async_std::main]\n\nasync fn main() {\n\n\t// The JSON-LD document to expand.\n\n\tlet doc: IValue = serde_json::from_str(\n\n\t\tr#\"\n\n\t\t{\n\n\t\t\t\"@context\": {\n\n\t\t\t\t\"name\": \"http://xmlns.com/foaf/0.1/name\",\n\n\t\t\t\t\"email\": \"http://xmlns.com/foaf/0.1/mbox\"\n\n\t\t\t},\n\n\t\t\t\"@id\": \"timothee.haudebourg.net\",\n\n\t\t\t\"name\": \"Timothée Haudebourg\",\n\n\t\t\t\"email\": \"author@haudebourg.net\"\n\n\t\t}\n\n\t\"#,\n\n\t)\n\n\t.unwrap();\n\n\n","file_path":"examples/custom-ids.rs","rank":42,"score":136247.2458117928},{"content":"type Id = Lexicon<Foaf>;\n\n\n\n#[async_std::main]\n\nasync fn main() {\n\n\t// The JSON-LD document to expand.\n\n\tlet doc: IValue = serde_json::from_str(\n\n\t\tr#\"\n\n\t\t{\n\n\t\t\t\"@context\": {\n\n\t\t\t\t\"name\": \"http://xmlns.com/foaf/0.1/name\",\n\n\t\t\t\t\"email\": \"http://xmlns.com/foaf/0.1/mbox\"\n\n\t\t\t},\n\n\t\t\t\"@id\": \"timothee.haudebourg.net\",\n\n\t\t\t\"name\": \"Timothée Haudebourg\",\n\n\t\t\t\"email\": \"author@haudebourg.net\"\n\n\t\t}\n\n\t\"#,\n\n\t)\n\n\t.unwrap();\n\n\n","file_path":"examples/custom-ids-iref-enum.rs","rank":43,"score":131897.79725483432},{"content":"/// JSON document that can be expanded.\n\npub trait JsonExpand = JsonSendSync + JsonHash + JsonClone + JsonLft<'static>;\n\n\n\n/// Expansion options.\n\n#[derive(Clone, Copy, Default)]\n\npub struct Options {\n\n\t/// Sets the processing mode.\n\n\tpub processing_mode: ProcessingMode,\n\n\n\n\t/// Term expansion policy.\n\n\t///\n\n\t/// Default is `Policy::Standard`.\n\n\tpub policy: Policy,\n\n\n\n\t/// If set to true, input document entries are processed lexicographically.\n\n\t/// If false, order is not considered in processing.\n\n\tpub ordered: bool,\n\n}\n\n\n\n/// Key expansion policy.\n\n///\n","file_path":"src/expansion/mod.rs","rank":44,"score":130942.96413379215},{"content":"/// Hash a [`HashSet`].\n\n///\n\n/// The standard library does not provide (yet) a `Hash` implementation\n\n/// for the [`HashSet`] type. This can be used instead.\n\n///\n\n/// Note that this function not particularly strong and does\n\n/// not protect against DoS attacks.\n\npub fn hash_set<T: Hash, H: Hasher>(set: &HashSet<T>, hasher: &mut H) {\n\n\t// See: https://github.com/rust-lang/rust/pull/48366\n\n\t// Elements must be combined with a associative and commutative operation •.\n\n\t// (u64, •, 0) must form a commutative monoid.\n\n\t// This is satisfied by • = u64::wrapping_add.\n\n\tlet mut hash = 0;\n\n\tfor item in set {\n\n\t\tlet mut h = DefaultHasher::new();\n\n\t\titem.hash(&mut h);\n\n\t\thash = u64::wrapping_add(hash, h.finish());\n\n\t}\n\n\n\n\thasher.write_u64(hash);\n\n}\n\n\n","file_path":"src/util/mod.rs","rank":45,"score":130617.99678782682},{"content":"/// Checks if the the given character is included in the given string anywhere but at the first position.\n\nfn contains_after_first(id: &str, c: char) -> bool {\n\n\tif let Some(i) = id.find(c) {\n\n\t\ti > 0\n\n\t} else {\n\n\t\tfalse\n\n\t}\n\n}\n\n\n","file_path":"src/context/processing.rs","rank":46,"score":130429.11011091601},{"content":"/// Checks if the the given character is included in the given string anywhere but at the first or last position.\n\nfn contains_between_boundaries(id: &str, c: char) -> bool {\n\n\tif let Some(i) = id.find(c) {\n\n\t\tlet j = id.rfind(c).unwrap();\n\n\t\ti > 0 && j < id.len() - 1\n\n\t} else {\n\n\t\tfalse\n\n\t}\n\n}\n\n\n\n// fn define<'a>(&mut self, env: &mut DefinitionEnvironment<'a>, term: &str, value: &JsonValue) -> Result<(), Self::Error> {\n\n\n","file_path":"src/context/processing.rs","rank":47,"score":130429.11011091601},{"content":"enum TypeLangValue<'a, T: Id> {\n\n\tType(TypeSelection<T>),\n\n\tLang(LangSelection<'a>),\n\n}\n\n\n","file_path":"src/compaction/mod.rs","rank":48,"score":127374.06960842901},{"content":"/// Follows the `https://www.w3.org/TR/json-ld11-api/#create-term-definition` algorithm.\n\n/// Default value for `base_url` is `None`. Default values for `protected` and `override_protected` are `false`.\n\npub fn define<\n\n\t'a,\n\n\tJ: JsonContext,\n\n\tT: Id + Send + Sync,\n\n\tC: ContextMut<T> + Send + Sync,\n\n\tL: Loader + Send + Sync,\n\n>(\n\n\tactive_context: &'a mut C,\n\n\tlocal_context: &'a LocalContextObject<'a, J::Object>,\n\n\tterm: &'a str,\n\n\tterm_metadata: &'a J::MetaData,\n\n\tdefined: &'a mut HashMap<String, bool>,\n\n\tremote_contexts: ProcessingStack,\n\n\tloader: &'a mut L,\n\n\tbase_url: Option<Iri<'a>>,\n\n\tprotected: bool,\n\n\toptions: ProcessingOptions,\n\n\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\n\n) -> BoxFuture<'a, Result<(), Error>>\n\nwhere\n","file_path":"src/context/processing.rs","rank":49,"score":125352.30180086978},{"content":"/// Expand an element.\n\n///\n\n/// See <https://www.w3.org/TR/json-ld11-api/#expansion-algorithm>.\n\n/// The default specified value for `ordered` and `from_map` is `false`.\n\npub fn expand_element<\n\n\t'a,\n\n\tJ: JsonExpand,\n\n\tT: 'a + Id + Send + Sync,\n\n\tC: ContextMut<T> + Send + Sync,\n\n\tL: Loader + Send + Sync,\n\n>(\n\n\tactive_context: &'a C,\n\n\tactive_property: ActiveProperty<'a, J>,\n\n\telement: &'a J,\n\n\tbase_url: Option<Iri<'a>>,\n\n\tloader: &'a mut L,\n\n\toptions: Options,\n\n\tfrom_map: bool,\n\n\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\n\n) -> BoxFuture<'a, ElementExpansionResult<T, J>>\n\nwhere\n\n\tC::LocalContext: From<L::Output> + From<J> + Send + Sync,\n\n\tL::Output: Into<J>,\n\n{\n","file_path":"src/expansion/element.rs","rank":50,"score":122742.60828076521},{"content":"/// JSON-LD document.\n\n///\n\n/// This trait represent a JSON-LD document that can be expanded into an [`ExpandedDocument`]\n\n/// or compacted. It is the main entry point to the JSON-LD API.\n\n/// It is notably implemented for any type implementing the [generic_json::Json] trait.\n\npub trait Document<T: Id> {\n\n\ttype Json: Json;\n\n\n\n\t/// Document location, if any.\n\n\tfn base_url(&self) -> Option<Iri>;\n\n\n\n\t/// Expand the document with a custom base URL, initial context, document loader and\n\n\t/// expansion options.\n\n\t///\n\n\t/// If you do not wish to set the base URL and expansion options yourself, the\n\n\t/// [`expand`](`Document::expand`) method is more appropriate.\n\n\t///\n\n\t/// This is an asynchronous method since expanding the context may require loading remote\n\n\t/// ressources. It returns a boxed [`Future`](`std::future::Future`) to the result.\n\n\tfn expand_with<'a, C: 'a + ContextMut<T>, L: 'a + Loader>(\n\n\t\t&'a self,\n\n\t\tbase_url: Option<Iri>,\n\n\t\tcontext: &'a C,\n\n\t\tloader: &'a mut L,\n\n\t\toptions: expansion::Options,\n","file_path":"src/document.rs","rank":51,"score":120645.01346474749},{"content":"fn is_alpha(c: char) -> bool {\n\n\tlet c = c as u32;\n\n\t(0x41..=0x5a).contains(&c) || (0x61..=0x7a).contains(&c)\n\n}\n\n\n","file_path":"src/syntax/keyword.rs","rank":52,"score":120285.75884813514},{"content":"fn negative_test(options: Options, input_url: Iri, base_url: Iri, error_code: ErrorCode) {{\n\n\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\n\n\tloader.mount(iri!(\"https://w3c.github.io/json-ld-api\"), \"json-ld-api\");\n\n\n\n\tlet input = task::block_on(loader.load(input_url)).unwrap();\n\n\tlet mut input_context: context::Json<IValue, IriBuf> = context::Json::new(Some(base_url));\n\n\n\n\tif let Some(context_url) = options.context {{\n\n\t\tlet local_context = task::block_on(loader.load_context(context_url)).unwrap().into_context();\n\n\t\tinput_context = task::block_on(local_context.process_with(&input_context, &mut loader, Some(base_url), options.into())).unwrap().into_inner();\n\n\t}}\n\n\n\n\tlet result = task::block_on(input.expand_with(Some(base_url), &input_context, &mut loader, options.into()));\n\n\n\n\tmatch result {{\n\n\t\tOk(output) => {{\n\n\t\t\tlet output_json: IValue = output.as_json();\n\n\t\t\tprintln!(\"output=\\n{{}}\", serde_json::to_string_pretty(&output_json).unwrap());\n\n\t\t\tpanic!(\"expansion succeeded where it should have failed with code: {{}}\", error_code)\n\n\t\t}},\n\n\t\tErr(e) => {{\n\n\t\t\tassert_eq!(e.code(), error_code)\n\n\t\t}}\n\n\t}}\n\n}}\n","file_path":"tests/templates/expand-header.rs","rank":53,"score":118185.44112114781},{"content":"fn negative_test(options: Options, input_url: Iri, base_url: Iri, error_code: ErrorCode) {{\n\n\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\n\n\tloader.mount(iri!(\"https://w3c.github.io/json-ld-api\"), \"json-ld-api\");\n\n\n\n\tlet input = task::block_on(loader.load(input_url)).unwrap();\n\n\tlet base_json_context = base_json_context(base_url);\n\n\tlet mut input_context: ProcessedOwned<IValue, context::Json<IValue, IriBuf>> =\n\n\t\tProcessedOwned::new(base_json_context, context::Json::new(Some(base_url)));\n\n\n\n\tif let Some(context_url) = options.context {{\n\n\t\tlet local_context = task::block_on(loader.load_context(context_url)).unwrap().into_context();\n\n\t\tinput_context = match task::block_on(local_context.process_with(input_context.as_ref(), &mut loader, Some(base_url), options.into())) {{\n\n\t\t\tOk(context) => context.owned(),\n\n\t\t\tErr(e) => {{\n\n\t\t\t\tassert_eq!(e.code(), error_code);\n\n\t\t\t\treturn\n\n\t\t\t}}\n\n\t\t}};\n\n\t}}\n\n\n","file_path":"tests/templates/compact-header.rs","rank":54,"score":118185.44112114781},{"content":"/// Type that can be converted into a `K` JSON value.\n\npub trait AsAnyJson<K: JsonBuild> {\n\n\t/// Converts this value into a `K` JSON value using the\n\n\t/// given `meta` value as metadata.\n\n\tfn as_json_with(&self, meta: K::MetaData) -> K;\n\n\n\n\t/// Converts this value into a `K` JSON value using the\n\n\t/// default metadata value.\n\n\tfn as_json(&self) -> K\n\n\twhere\n\n\t\tK::MetaData: Default,\n\n\t{\n\n\t\tself.as_json_with(K::MetaData::default())\n\n\t}\n\n}\n\n\n","file_path":"src/util/json/build.rs","rank":55,"score":115926.41240689947},{"content":"fn no_metadata<M>(_: Option<&M>) -> () {{\n\n\t()\n\n}}\n\n\n","file_path":"tests/templates/compact-header.rs","rank":56,"score":113491.2087715014},{"content":"/// Resolve `iri_ref` against the given base IRI.\n\nfn resolve_iri(iri_ref: IriRef, base_iri: Option<Iri>) -> Option<IriBuf> {\n\n\tmatch base_iri {\n\n\t\tSome(base_iri) => Some(iri_ref.resolved(base_iri)),\n\n\t\tNone => match iri_ref.into_iri() {\n\n\t\t\tOk(iri) => Some(iri.into()),\n\n\t\t\tErr(_) => None,\n\n\t\t},\n\n\t}\n\n}\n\n\n","file_path":"src/context/processing.rs","rank":57,"score":112763.18360057272},{"content":"fn func_name(id: &str) -> String {\n\n\tlet mut name = \"compact_\".to_string();\n\n\n\n\tfor c in id.chars() {\n\n\t\tmatch c {\n\n\t\t\t'.' | '-' => break,\n\n\t\t\t_ => name.push(c),\n\n\t\t}\n\n\t}\n\n\n\n\tname\n\n}\n\n\n","file_path":"examples/generate-compact-tests.rs","rank":58,"score":111268.8361599289},{"content":"fn func_name(id: &str) -> String {\n\n\tlet mut name = \"expand_\".to_string();\n\n\n\n\tfor c in id.chars() {\n\n\t\tmatch c {\n\n\t\t\t'.' | '-' => break,\n\n\t\t\t_ => name.push(c),\n\n\t\t}\n\n\t}\n\n\n\n\tname\n\n}\n\n\n","file_path":"examples/generate-expand-tests.rs","rank":59,"score":111268.8361599289},{"content":"pub trait TermLike {\n\n\tfn as_iri(&self) -> Option<Iri>;\n\n\n\n\tfn as_str(&self) -> &str;\n\n}\n\n\n\n#[derive(Clone, PartialEq, Eq, Hash)]\n\npub enum Term<T: AsIri> {\n\n\tNull,\n\n\tRef(Reference<T>),\n\n\tKeyword(Keyword),\n\n}\n\n\n\nimpl<T: AsIri> Term<T> {\n\n\tpub fn is_null(&self) -> bool {\n\n\t\tmatches!(self, Term::Null)\n\n\t}\n\n\n\n\tpub fn into_id(self) -> Result<T, Self> {\n\n\t\tmatch self {\n","file_path":"src/syntax/term.rs","rank":60,"score":110414.28213758089},{"content":"/// Vocabulary type.\n\n///\n\n/// Directly using [`IriBuf`] to identify each node\n\n/// can be very expensive.\n\n/// When you know in advance the set of IRIs will be used\n\n/// in your application, it is more effective to use\n\n/// an `enum` type where each variant represents an IRI.\n\n/// In this case, storing and comparing IRIs become very cheap.\n\n///\n\n/// In this setting, such `enum` type can implement the\n\n/// `Vocab` trait, automatically implemented in most cases.\n\n/// It can then be wrapped around the [`Vocab`] type to handle unexpected\n\n/// IRIs, and be used as identifier type instead of `IriBuf`.\n\npub trait Vocab: AsIri + Clone + PartialEq + Eq + Hash {\n\n\tfn from_iri(iri: Iri) -> Option<Self>;\n\n}\n\n\n\nimpl<T: AsIri + Clone + PartialEq + Eq + Hash> Vocab for T\n\nwhere\n\n\tfor<'a> T: TryFrom<Iri<'a>>,\n\n{\n\n\t#[inline]\n\n\tfn from_iri(iri: Iri) -> Option<Self> {\n\n\t\tmatch T::try_from(iri) {\n\n\t\t\tOk(t) => Some(t),\n\n\t\t\tErr(_) => None,\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl<V: Vocab> ToReference<Lexicon<V>> for V {\n\n\ttype Reference = Reference<Lexicon<V>>;\n\n\n","file_path":"src/vocab.rs","rank":61,"score":107721.49633706709},{"content":"/// Compact the given list of types into the given `result` compacted object.\n\nfn compact_types<\n\n\tJ: JsonSrc,\n\n\tK: JsonFrom<J>,\n\n\tT: Sync + Send + Id,\n\n\tC: ContextMut<T>,\n\n\tM: Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\n\n>(\n\n\tresult: &mut K::Object,\n\n\ttypes: &[Reference<T>],\n\n\tactive_context: Inversible<T, &C>,\n\n\ttype_scoped_context: Inversible<T, &C>,\n\n\toptions: Options,\n\n\tmeta: M,\n\n) -> Result<(), Error> {\n\n\t// If expanded property is @type:\n\n\tif !types.is_empty() {\n\n\t\t// If expanded value is a string,\n\n\t\t// then initialize compacted value by IRI compacting expanded value using\n\n\t\t// type-scoped context for active context.\n\n\t\tlet compacted_value = if types.len() == 1 {\n","file_path":"src/compaction/node.rs","rank":62,"score":101090.78438681859},{"content":"struct InverseType<T: Id> {\n\n\treverse: Option<String>,\n\n\tany: Option<String>,\n\n\tmap: HashMap<Type<T>, String>,\n\n}\n\n\n\nimpl<T: Id> InverseType<T> {\n\n\tfn select(&self, selection: TypeSelection<T>) -> Option<&str> {\n\n\t\tmatch selection {\n\n\t\t\tTypeSelection::Reverse => self.reverse.as_ref(),\n\n\t\t\tTypeSelection::Any => self.any.as_ref(),\n\n\t\t\tTypeSelection::Type(ty) => self.map.get(&ty),\n\n\t\t}\n\n\t\t.map(|v| v.as_str())\n\n\t}\n\n\n\n\tfn set_any(&mut self, term: &str) {\n\n\t\tif self.any.is_none() {\n\n\t\t\tself.any = Some(term.to_string())\n\n\t\t}\n","file_path":"src/context/inverse.rs","rank":63,"score":96392.56480981573},{"content":"fn positive_test(options: Options, input_url: Iri, base_url: Iri, output_url: Iri) {\n\n\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\n\n\tloader.mount(iri!(\"file://crate/tests\"), \"tests\");\n\n\n\n\tlet input = task::block_on(loader.load(input_url)).unwrap();\n\n\tlet output = task::block_on(loader.load(output_url)).unwrap();\n\n\tlet mut input_context: context::Json<IValue, IriBuf> = context::Json::new(Some(base_url));\n\n\n\n\tif let Some(context_url) = options.context {\n\n\t\tlet local_context = task::block_on(loader.load_context(context_url))\n\n\t\t\t.unwrap()\n\n\t\t\t.into_context();\n\n\t\tinput_context = task::block_on(local_context.process_with(\n\n\t\t\t&input_context,\n\n\t\t\t&mut loader,\n\n\t\t\tSome(base_url),\n\n\t\t\toptions.into(),\n\n\t\t))\n\n\t\t.unwrap()\n\n\t\t.into_inner();\n","file_path":"tests/custom.rs","rank":64,"score":84632.62336804457},{"content":"fn base_json_context(base_url: Iri) -> IValue {{\n\n\tlet mut object = ijson::IObject::new();\n\n\tobject.insert(\"@base\", IValue::from(base_url.as_str()));\n\n\tobject.into()\n\n}}\n\n\n","file_path":"tests/templates/compact-header.rs","rank":65,"score":83788.55595186341},{"content":"fn is_gen_delim(c: char) -> bool {\n\n\tmatches!(c, ':' | '/' | '?' | '#' | '[' | ']' | '@')\n\n}\n\n\n","file_path":"src/context/processing.rs","rank":66,"score":81949.26448331005},{"content":"fn positive_test(options: Options, input_url: Iri, base_url: Iri, output_url: Iri) {{\n\n\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\n\n\tloader.mount(iri!(\"https://w3c.github.io/json-ld-api\"), \"json-ld-api\");\n\n\n\n\tlet input = task::block_on(loader.load(input_url)).unwrap();\n\n\tlet expected_output = task::block_on(loader.load(output_url)).unwrap();\n\n\tlet mut input_context: context::Json<IValue, IriBuf> = context::Json::new(Some(base_url));\n\n\n\n\tif let Some(context_url) = options.context {{\n\n\t\tlet local_context = task::block_on(loader.load_context(context_url)).unwrap().into_context();\n\n\t\tinput_context = task::block_on(local_context.process_with(&input_context, &mut loader, Some(base_url), options.into())).unwrap().into_inner();\n\n\t}}\n\n\n\n\tlet output = task::block_on(input.expand_with(Some(base_url), &input_context, &mut loader, options.into())).unwrap();\n\n\tlet output_json: IValue = output.as_json();\n\n\n\n\tlet success = json_ld_eq(&output_json, &*expected_output);\n\n\n\n\tif !success {{\n\n\t\tprintln!(\n","file_path":"tests/templates/expand-header.rs","rank":67,"score":81835.72533462285},{"content":"fn positive_test(options: Options, input_url: Iri, base_url: Iri, output_url: Iri) {{\n\n\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\n\n\tloader.mount(iri!(\"https://w3c.github.io/json-ld-api\"), \"json-ld-api\");\n\n\n\n\tlet input = task::block_on(loader.load(input_url)).unwrap();\n\n\tlet expected_output = task::block_on(loader.load(output_url)).unwrap();\n\n\tlet base_json_context = base_json_context(base_url);\n\n\tlet mut input_context: ProcessedOwned<IValue, context::Json<IValue, IriBuf>> =\n\n\t\tProcessedOwned::new(base_json_context, context::Json::new(Some(base_url)));\n\n\n\n\tif let Some(context_url) = options.context {{\n\n\t\tlet local_context = task::block_on(loader.load_context(context_url))\n\n\t\t\t.unwrap()\n\n\t\t\t.into_context();\n\n\t\tinput_context = task::block_on(local_context.process_with(\n\n\t\t\tinput_context.as_ref(),\n\n\t\t\t&mut loader,\n\n\t\t\tSome(base_url),\n\n\t\t\toptions.into(),\n\n\t\t))\n","file_path":"tests/templates/compact-header.rs","rank":68,"score":81835.72533462285},{"content":"#[test]\n\nfn custom_0124() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/0124-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/0124-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/0124-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":69,"score":65517.07672935798},{"content":"#[test]\n\nfn custom_0125() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/0125-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/0125-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/0125-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n","file_path":"tests/custom.rs","rank":70,"score":65517.07672935798},{"content":"#[test]\n\nfn custom_0120() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/0120-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/0120-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/0120-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":71,"score":65517.07672935798},{"content":"#[test]\n\nfn custom_0122() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/0122-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/0122-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/0122-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":72,"score":65517.07672935798},{"content":"#[test]\n\nfn custom_0123() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/0123-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/0123-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/0123-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":73,"score":65517.07672935798},{"content":"#[test]\n\nfn custom_e112() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/e112-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/e112-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/e112-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n\n// See w3c/json-ld-api#480\n\n// #[test]\n\n// fn custom_e122() {\n\n// \tlet input_url = iri!(\"file://crate/tests/custom/e122-in.jsonld\");\n\n// \tlet base_url = iri!(\"file://crate/tests/custom/e122-in.jsonld\");\n","file_path":"tests/custom.rs","rank":74,"score":64018.63726351402},{"content":"#[test]\n\nfn custom_e111() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/e111-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/e111-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/e111-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":75,"score":64018.63726351402},{"content":"#[test]\n\nfn custom_c037() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/c037-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/c037-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/c037-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":76,"score":64018.63726351402},{"content":"#[test]\n\nfn custom_c038() {\n\n\tlet input_url = iri!(\"file://crate/tests/custom/c038-in.jsonld\");\n\n\tlet base_url = iri!(\"file://crate/tests/custom/c038-in.jsonld\");\n\n\tlet output_url = iri!(\"file://crate/tests/custom/c038-out.jsonld\");\n\n\tpositive_test(\n\n\t\tOptions {\n\n\t\t\tprocessing_mode: ProcessingMode::JsonLd1_1,\n\n\t\t\tcontext: None,\n\n\t\t},\n\n\t\tinput_url,\n\n\t\tbase_url,\n\n\t\toutput_url,\n\n\t)\n\n}\n\n\n","file_path":"tests/custom.rs","rank":77,"score":64018.63726351402},{"content":"/// Default values for `document_relative` and `vocab` should be `false` and `true`.\n\nfn expand_iri<\n\n\t'a,\n\n\tJ: JsonContext,\n\n\tT: Id + Send + Sync,\n\n\tC: ContextMut<T> + Send + Sync,\n\n\tL: Loader + Send + Sync,\n\n>(\n\n\tactive_context: &'a mut C,\n\n\tvalue: &str,\n\n\tsource: Option<loader::Id>,\n\n\tmetadata: &'a J::MetaData,\n\n\tdocument_relative: bool,\n\n\tvocab: bool,\n\n\tlocal_context: &'a LocalContextObject<'a, J::Object>,\n\n\tdefined: &'a mut HashMap<String, bool>,\n\n\tremote_contexts: ProcessingStack,\n\n\tloader: &'a mut L,\n\n\toptions: ProcessingOptions,\n\n\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\n\n) -> impl 'a + Send + Future<Output = Result<Term<T>, Error>>\n","file_path":"src/context/processing.rs","rank":78,"score":62630.10074348562},{"content":"// This function tries to follow the recommended context proessing algorithm.\n\n// See `https://www.w3.org/TR/json-ld11-api/#context-processing-algorithm`.\n\n//\n\n// The recommended default value for `remote_contexts` is the empty set,\n\n// `false` for `override_protected`, and `true` for `propagate`.\n\nfn process_context<\n\n\t'a,\n\n\tJ: JsonContext,\n\n\tT: Id + Send + Sync,\n\n\tC: ContextMut<T> + Send + Sync,\n\n\tL: Loader + Send + Sync,\n\n>(\n\n\tactive_context: &'a C,\n\n\tlocal_context: &'a J,\n\n\tmut remote_contexts: ProcessingStack,\n\n\tloader: &'a mut L,\n\n\tbase_url: Option<Iri>,\n\n\tmut options: ProcessingOptions,\n\n\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\n\n) -> BoxFuture<'a, Result<C, Loc<Error, J::MetaData>>>\n\nwhere\n\n\tC::LocalContext: From<L::Output> + From<J>,\n\n\tL::Output: Into<J>,\n\n{\n\n\tlet source = loader.id_opt(base_url);\n","file_path":"src/context/processing.rs","rank":79,"score":62629.43209494069},{"content":"fn compact_collection_with<\n\n\t'a,\n\n\tJ: 'a + JsonSrc,\n\n\tK: JsonFrom<J>,\n\n\tT: 'a + Sync + Send + Id,\n\n\tO: 'a + Send + Iterator<Item = &'a Indexed<Object<J, T>>>,\n\n\tC: ContextMut<T>,\n\n\tL: Loader,\n\n\tM: 'a,\n\n>(\n\n\titems: O,\n\n\tactive_context: Inversible<T, &'a C>,\n\n\ttype_scoped_context: Inversible<T, &'a C>,\n\n\tactive_property: Option<&'a str>,\n\n\tloader: &'a mut L,\n\n\toptions: Options,\n\n\tmeta: M,\n\n) -> BoxFuture<'a, Result<K, Error>>\n\nwhere\n\n\tC: Sync + Send,\n","file_path":"src/compaction/mod.rs","rank":80,"score":62625.85728322022},{"content":"fn expand_node_entries<\n\n\t'a,\n\n\tJ: JsonExpand,\n\n\tT: 'a + Id + Send + Sync,\n\n\tC: ContextMut<T> + Send + Sync,\n\n\tL: Loader + Send + Sync,\n\n>(\n\n\tmut result: Indexed<Node<J, T>>,\n\n\tmut has_value_object_entries: bool,\n\n\tactive_context: &'a C,\n\n\ttype_scoped_context: &'a C,\n\n\tactive_property: ActiveProperty<'a, J>,\n\n\texpanded_entries: Vec<ExpandedEntry<'a, J, Term<T>>>,\n\n\tbase_url: Option<Iri<'a>>,\n\n\tloader: &'a mut L,\n\n\toptions: Options,\n\n\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\n\n) -> BoxFuture<'a, NodeEntriesExpensionResult<J, T>>\n\nwhere\n\n\tC::LocalContext: From<L::Output> + From<J> + Send + Sync,\n","file_path":"src/expansion/node.rs","rank":81,"score":61327.94182765542},{"content":"struct InverseContainer<T: Id> {\n\n\tlanguage: InverseLang,\n\n\ttyp: InverseType<T>,\n\n\tany: Any,\n\n}\n\n\n","file_path":"src/context/inverse.rs","rank":82,"score":60469.75033752795},{"content":"use crate::loader;\n\nuse std::ops::{Deref, DerefMut};\n\n\n\n/// Value located behind an IRI reference.\n\n#[derive(Clone, Copy, Debug)]\n\npub struct Loc<T, M> {\n\n\t/// The value.\n\n\tvalue: T,\n\n\n\n\t/// Source document.\n\n\tsource: Option<loader::Id>,\n\n\n\n\t/// Metadata.\n\n\tmetadata: M,\n\n}\n\n\n\nimpl<T, M> Loc<T, M> {\n\n\t/// Creates a new value from the given `source` attached to the given `metadata`.\n\n\tpub fn new(value: T, source: Option<loader::Id>, metadata: M) -> Self {\n\n\t\tSelf {\n","file_path":"src/loc.rs","rank":83,"score":43091.23070244042},{"content":"\t\t\tvalue,\n\n\t\t\tsource,\n\n\t\t\tmetadata,\n\n\t\t}\n\n\t}\n\n\n\n\tpub fn value(&self) -> &T {\n\n\t\t&self.value\n\n\t}\n\n\n\n\tpub fn source(&self) -> Option<loader::Id> {\n\n\t\tself.source\n\n\t}\n\n\n\n\t/// Returns a reference to the metadata associated to this value.\n\n\tpub fn metadata(&self) -> &M {\n\n\t\t&self.metadata\n\n\t}\n\n\n\n\tpub fn into_parts(self) -> (T, Option<loader::Id>, M) {\n","file_path":"src/loc.rs","rank":84,"score":43075.87312154348},{"content":"\t\tF: FnOnce(M) -> N,\n\n\t{\n\n\t\tLoc::new(self.value, self.source, f(self.metadata))\n\n\t}\n\n}\n\n\n\nimpl<T, M> Deref for Loc<T, M> {\n\n\ttype Target = T;\n\n\n\n\tfn deref(&self) -> &T {\n\n\t\t&self.value\n\n\t}\n\n}\n\n\n\nimpl<T, M> DerefMut for Loc<T, M> {\n\n\tfn deref_mut(&mut self) -> &mut T {\n\n\t\t&mut self.value\n\n\t}\n\n}\n\n\n","file_path":"src/loc.rs","rank":85,"score":43066.482676149906},{"content":"\t\t(self.value, self.source, self.metadata)\n\n\t}\n\n\n\n\tpub fn unwrap(self) -> T {\n\n\t\tself.value\n\n\t}\n\n\n\n\tpub fn cast_metadata<N>(self) -> Loc<T, N>\n\n\twhere\n\n\t\tN: From<M>,\n\n\t{\n\n\t\tLoc::new(self.value, self.source, self.metadata.into())\n\n\t}\n\n\n\n\tpub fn with_metadata<N>(self, metadata: N) -> Loc<T, N> {\n\n\t\tLoc::new(self.value, self.source, metadata)\n\n\t}\n\n\n\n\tpub fn map_metadata<N, F>(self, f: F) -> Loc<T, N>\n\n\twhere\n","file_path":"src/loc.rs","rank":86,"score":43062.931528317495},{"content":"impl<T, M> AsRef<T> for Loc<T, M> {\n\n\tfn as_ref(&self) -> &T {\n\n\t\t&self.value\n\n\t}\n\n}\n\n\n\nimpl<T, M> AsMut<T> for Loc<T, M> {\n\n\tfn as_mut(&mut self) -> &mut T {\n\n\t\t&mut self.value\n\n\t}\n\n}\n","file_path":"src/loc.rs","rank":87,"score":43062.28078671656},{"content":"impl<J: JsonClone, K: JsonFrom<J>, T: AsJson<J, K>> AsJson<J, K> for Indexed<T> {\n\n\tfn as_json_with(&self, meta: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData) -> K {\n\n\t\tlet mut json = self.value.as_json_with(meta.clone());\n\n\n\n\t\tif let Some(obj) = json.as_object_mut() {\n\n\t\t\tif let Some(index) = &self.index {\n\n\t\t\t\tobj.insert(\n\n\t\t\t\t\tK::new_key(Keyword::Index.into_str(), meta(None)),\n\n\t\t\t\t\tindex.as_json_with(meta(None)),\n\n\t\t\t\t);\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t\tjson\n\n\t}\n\n}\n","file_path":"src/indexed.rs","rank":88,"score":43044.23284679195},{"content":"\n\n\t#[inline]\n\n\tfn try_from(term: Term<T>) -> Result<Reference<T>, Term<T>> {\n\n\t\tmatch term {\n\n\t\t\tTerm::Ref(prop) => Ok(prop),\n\n\t\t\tterm => Err(term),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl<T: AsIri> From<BlankId> for Reference<T> {\n\n\t#[inline(always)]\n\n\tfn from(blank: BlankId) -> Reference<T> {\n\n\t\tReference::Blank(blank)\n\n\t}\n\n}\n\n\n\nimpl<J: JsonClone, K: util::JsonFrom<J>, T: Id> util::AsJson<J, K> for Reference<T> {\n\n\t#[inline]\n\n\tfn as_json_with(&self, meta: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData) -> K {\n","file_path":"src/reference.rs","rank":89,"score":43034.452957026595},{"content":"use crate::{\n\n\tsyntax::Keyword,\n\n\tutil::{AsAnyJson, AsJson, JsonFrom},\n\n};\n\nuse generic_json::JsonClone;\n\nuse std::convert::{TryFrom, TryInto};\n\nuse std::hash::{Hash, Hasher};\n\nuse std::ops::{Deref, DerefMut};\n\n\n\n/// Indexed objects.\n\n///\n\n/// Nodes and value objects may be indexed by a string in JSON-LD.\n\n/// This type is a wrapper around any kind of indexable data.\n\n///\n\n/// It is a pointer type that `Deref` into the underlying value.\n\npub struct Indexed<T> {\n\n\t/// Index.\n\n\tindex: Option<String>,\n\n\n\n\t/// Value.\n","file_path":"src/indexed.rs","rank":90,"score":43031.36486732287},{"content":"\t}\n\n\n\n\t/// Get the index, if any.\n\n\t#[inline(always)]\n\n\tpub fn index(&self) -> Option<&str> {\n\n\t\tmatch &self.index {\n\n\t\t\tSome(index) => Some(index.as_str()),\n\n\t\t\tNone => None,\n\n\t\t}\n\n\t}\n\n\n\n\t/// Set the value index.\n\n\t#[inline(always)]\n\n\tpub fn set_index(&mut self, index: Option<String>) {\n\n\t\tself.index = index\n\n\t}\n\n\n\n\t/// Turn this indexed value into its components: inner value and index.\n\n\t#[inline(always)]\n\n\tpub fn into_parts(self) -> (T, Option<String>) {\n","file_path":"src/indexed.rs","rank":91,"score":43027.982444060406},{"content":"\t\t(self.value, self.index)\n\n\t}\n\n\n\n\t/// Cast the inner value.\n\n\t#[inline(always)]\n\n\tpub fn cast<U: From<T>>(self) -> Indexed<U> {\n\n\t\tIndexed::new(self.value.into(), self.index)\n\n\t}\n\n\n\n\t/// Try to cast the inner value.\n\n\t#[inline(always)]\n\n\tpub fn try_cast<U: TryFrom<T>>(self) -> Result<Indexed<U>, Indexed<U::Error>> {\n\n\t\tmatch self.value.try_into() {\n\n\t\t\tOk(value) => Ok(Indexed::new(value, self.index)),\n\n\t\t\tErr(e) => Err(Indexed::new(e, self.index)),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl<T: Hash> Hash for Indexed<T> {\n","file_path":"src/indexed.rs","rank":92,"score":43021.31904785937},{"content":"\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n\t\tmatch self {\n\n\t\t\tReference::Id(id) => write!(f, \"Reference::Id({})\", id.as_iri()),\n\n\t\t\tReference::Blank(b) => write!(f, \"Reference::Blank({})\", b),\n\n\t\t\tReference::Invalid(id) => write!(f, \"Reference::Invalid({})\", id),\n\n\t\t}\n\n\t}\n\n}\n\n\n\n/// Types that can be converted into a borrowed node reference.\n\n///\n\n/// This is a convenient trait is used to simplify the use of references.\n\n/// For instance consider the [`Node::get`](crate::Node::get) method, used to get the objects associated to the\n\n/// given reference property for a given node.\n\n/// It essentially have the following signature:\n\n/// ```ignore\n\n/// fn get(&self, id: &Reference<T>) -> Objects;\n\n/// ```\n\n/// However building a `Reference` by hand can be tedious, especially while using [`Lexicon`](crate::Lexicon) and\n\n/// [`Vocab`](crate::Vocab). It can be as verbose as `node.get(&Reference::Id(Lexicon::Id(MyVocab::Term)))`.\n\n/// Thanks to `ToReference` which is implemented by `Lexicon<V>` for any type `V` implementing `Vocab`,\n\n/// it is simplified into `node.get(MyVocab::Term)` (while the first syntax remains correct).\n\n/// The signature of `get` becomes:\n\n/// ```ignore\n\n/// fn get<R: ToReference<T>>(&self, id: R) -> Objects;\n\n/// ```\n","file_path":"src/reference.rs","rank":93,"score":43020.72427231729},{"content":"\t\tmatch self {\n\n\t\t\tReference::Id(id) => id.as_json(meta(None)),\n\n\t\t\tReference::Blank(b) => b.as_json_with(meta(None)),\n\n\t\t\tReference::Invalid(id) => id.as_json_with(meta(None)),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl<T: AsIri> fmt::Display for Reference<T> {\n\n\t#[inline]\n\n\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n\t\tmatch self {\n\n\t\t\tReference::Id(id) => id.as_iri().fmt(f),\n\n\t\t\tReference::Blank(b) => b.fmt(f),\n\n\t\t\tReference::Invalid(id) => id.fmt(f),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl<T: AsIri> fmt::Debug for Reference<T> {\n","file_path":"src/reference.rs","rank":94,"score":43019.389676637285},{"content":"use crate::{\n\n\tsyntax::{Term, TermLike},\n\n\tutil::{self, AsAnyJson},\n\n\tBlankId, Id,\n\n};\n\nuse generic_json::JsonClone;\n\nuse iref::{AsIri, Iri, IriBuf};\n\nuse std::borrow::Borrow;\n\nuse std::convert::TryFrom;\n\nuse std::fmt;\n\n\n\n/// Node reference.\n\n///\n\n/// Used to reference a node across a document or to a remote document.\n\n/// It can be an identifier (IRI), a blank node identifier for local blank nodes\n\n/// or an invalid reference (a string that is neither an IRI nor blank node identifier).\n\n#[derive(Clone, PartialEq, Eq, Hash)]\n\npub enum Reference<T: AsIri = IriBuf> {\n\n\t/// Node identifier, essentially an IRI.\n\n\tId(T),\n","file_path":"src/reference.rs","rank":95,"score":43019.35212517835},{"content":"\tvalue: T,\n\n}\n\n\n\nimpl<T> Indexed<T> {\n\n\t/// Create a new (maybe) indexed value.\n\n\t#[inline(always)]\n\n\tpub fn new(value: T, index: Option<String>) -> Indexed<T> {\n\n\t\tIndexed { value, index }\n\n\t}\n\n\n\n\t/// Get a reference to the inner value.\n\n\t#[inline(always)]\n\n\tpub fn inner(&self) -> &T {\n\n\t\t&self.value\n\n\t}\n\n\n\n\t/// Drop the index and return the underlying value.\n\n\t#[inline(always)]\n\n\tpub fn into_inner(self) -> T {\n\n\t\tself.value\n","file_path":"src/indexed.rs","rank":96,"score":43018.92421824805},{"content":"\t#[inline(always)]\n\n\tfn hash<H: Hasher>(&self, h: &mut H) {\n\n\t\tself.value.hash(h);\n\n\t\tself.index.hash(h)\n\n\t}\n\n}\n\n\n\nimpl<T: PartialEq> PartialEq for Indexed<T> {\n\n\t#[inline(always)]\n\n\tfn eq(&self, other: &Self) -> bool {\n\n\t\tself.index == other.index && self.value == other.value\n\n\t}\n\n}\n\n\n\nimpl<T: Eq> Eq for Indexed<T> {}\n\n\n\nimpl<T: Clone> Clone for Indexed<T> {\n\n\t#[inline(always)]\n\n\tfn clone(&self) -> Self {\n\n\t\tIndexed::new(self.value.clone(), self.index.clone())\n","file_path":"src/indexed.rs","rank":97,"score":43015.16186052932},{"content":"\t/// This will either return a string slice of an IRI, or a blank node identifier.\n\n\t#[inline(always)]\n\n\tpub fn as_str(&self) -> &str {\n\n\t\tmatch self {\n\n\t\t\tReference::Id(id) => id.as_iri().into_str(),\n\n\t\t\tReference::Blank(id) => id.as_str(),\n\n\t\t\tReference::Invalid(id) => id.as_str(),\n\n\t\t}\n\n\t}\n\n\n\n\t/// If the renference is a node identifier, returns the node IRI.\n\n\t///\n\n\t/// Returns `None` if it is a blank node reference.\n\n\t#[inline(always)]\n\n\tpub fn as_iri(&self) -> Option<Iri> {\n\n\t\tmatch self {\n\n\t\t\tReference::Id(k) => Some(k.as_iri()),\n\n\t\t\t_ => None,\n\n\t\t}\n\n\t}\n","file_path":"src/reference.rs","rank":98,"score":43014.94099667911},{"content":"\t}\n\n}\n\n\n\nimpl<T> From<T> for Indexed<T> {\n\n\t#[inline(always)]\n\n\tfn from(value: T) -> Indexed<T> {\n\n\t\tIndexed::new(value, None)\n\n\t}\n\n}\n\n\n\nimpl<T> Deref for Indexed<T> {\n\n\ttype Target = T;\n\n\n\n\t#[inline(always)]\n\n\tfn deref(&self) -> &T {\n\n\t\t&self.value\n\n\t}\n\n}\n\n\n\nimpl<T> DerefMut for Indexed<T> {\n","file_path":"src/indexed.rs","rank":99,"score":43013.79078321117}],"string":"[\n {\n \"content\": \"/// Get the `@value` field of a value object.\\n\\nfn value_value<J: JsonClone, K: JsonFrom<J>, T: Id, M>(value: &Value<J, T>, meta: M) -> K\\n\\nwhere\\n\\n\\tM: Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\\n\\n{\\n\\n\\tuse crate::object::value::Literal;\\n\\n\\tmatch value {\\n\\n\\t\\tValue::Literal(lit, _ty) => match lit {\\n\\n\\t\\t\\tLiteral::Null => K::null(meta(None)),\\n\\n\\t\\t\\tLiteral::Boolean(b) => b.as_json_with(meta(None)),\\n\\n\\t\\t\\tLiteral::Number(n) => K::number(n.clone().into(), meta(None)),\\n\\n\\t\\t\\tLiteral::String(s) => s.as_json_with(meta(None)),\\n\\n\\t\\t},\\n\\n\\t\\tValue::LangString(str) => K::string(str.as_str().into(), meta(None)),\\n\\n\\t\\tValue::Json(json) => json.as_json_with(meta),\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 0,\n \"score\": 333201.18401212303\n },\n {\n \"content\": \"/// Convert a term to a node id, if possible.\\n\\n/// Return `None` if the term is `null`.\\n\\npub fn node_id_of_term<T: Id>(term: Term<T>) -> Option<Reference<T>> {\\n\\n\\tmatch term {\\n\\n\\t\\tTerm::Null => None,\\n\\n\\t\\tTerm::Ref(prop) => Some(prop),\\n\\n\\t\\tTerm::Keyword(kw) => Some(Reference::Invalid(kw.into_str().to_string())),\\n\\n\\t}\\n\\n}\\n\\n\\n\\n/// Expand a node object.\\n\\npub(crate) async fn expand_node<\\n\\n\\t'a,\\n\\n\\tJ: JsonExpand,\\n\\n\\tT: 'a + Id + Send + Sync,\\n\\n\\tC: ContextMut<T> + Send + Sync,\\n\\n\\tL: Loader + Send + Sync,\\n\\n>(\\n\\n\\tactive_context: &'a C,\\n\\n\\ttype_scoped_context: &'a C,\\n\\n\\tactive_property: ActiveProperty<'a, J>,\\n\\n\\texpanded_entries: Vec<ExpandedEntry<'a, J, Term<T>>>,\\n\",\n \"file_path\": \"src/expansion/node.rs\",\n \"rank\": 1,\n \"score\": 298191.2292051495\n },\n {\n \"content\": \"/// Expand a literal value.\\n\\n/// See <https://www.w3.org/TR/json-ld11-api/#value-expansion>.\\n\\npub fn expand_literal<J: JsonHash + JsonClone, T: Id, C: Context<T>>(\\n\\n\\tsource: Option<loader::Id>,\\n\\n\\tactive_context: &C,\\n\\n\\tactive_property: ActiveProperty<J>,\\n\\n\\tvalue: LiteralValue<J>,\\n\\n\\twarnings: &mut Vec<Loc<Warning, J::MetaData>>,\\n\\n) -> Result<Indexed<Object<J, T>>, Error> {\\n\\n\\tlet active_property_definition = active_context.get_opt(active_property.id());\\n\\n\\n\\n\\tlet active_property_type = if let Some(active_property_definition) = active_property_definition\\n\\n\\t{\\n\\n\\t\\tactive_property_definition.typ.clone()\\n\\n\\t} else {\\n\\n\\t\\tNone\\n\\n\\t};\\n\\n\\n\\n\\tmatch active_property_type {\\n\\n\\t\\t// If the `active_property` has a type mapping in `active_context` that is `@id`, and the\\n\\n\\t\\t// `value` is a string, return a new map containing a single entry where the key is `@id` and\\n\\n\\t\\t// the value is the result of IRI expanding `value` using `true` for `document_relative` and\\n\",\n \"file_path\": \"src/expansion/literal.rs\",\n \"rank\": 2,\n \"score\": 256632.74104644492\n },\n {\n \"content\": \"fn select_nest_result<'a, K: 'a + JsonBuild + JsonMut + JsonIntoMut, T: Id, C: ContextMut<T>, M>(\\n\\n\\tresult: &'a mut K::Object,\\n\\n\\tactive_context: Inversible<T, &C>,\\n\\n\\titem_active_property: &str,\\n\\n\\tcompact_arrays: bool,\\n\\n\\tmeta: M,\\n\\n) -> Result<(&'a mut K::Object, Container, bool), Error>\\n\\nwhere\\n\\n\\tM: Fn() -> K::MetaData,\\n\\n{\\n\\n\\tlet (nest_result, container) = match active_context.get(item_active_property) {\\n\\n\\t\\tSome(term_definition) => {\\n\\n\\t\\t\\tlet nest_result = match &term_definition.nest {\\n\\n\\t\\t\\t\\tSome(nest_term) => {\\n\\n\\t\\t\\t\\t\\t// If nest term is not @nest,\\n\\n\\t\\t\\t\\t\\t// or a term in the active context that expands to @nest,\\n\\n\\t\\t\\t\\t\\t// an invalid @nest value error has been detected,\\n\\n\\t\\t\\t\\t\\t// and processing is aborted.\\n\\n\\t\\t\\t\\t\\tif nest_term != \\\"@nest\\\" {\\n\\n\\t\\t\\t\\t\\t\\tmatch active_context.get(nest_term.as_ref()) {\\n\",\n \"file_path\": \"src/compaction/property.rs\",\n \"rank\": 3,\n \"score\": 252034.9919326434\n },\n {\n \"content\": \"/// Type composed of `J` JSON values that can be converted\\n\\n/// into a `K` JSON value.\\n\\npub trait AsJson<J: JsonClone, K: JsonFrom<J>> {\\n\\n\\t/// Converts this value into a `K` JSON value using the given\\n\\n\\t/// `meta` function to convert `J::MetaData` into `K::MetaData`.\\n\\n\\tfn as_json_with(&self, meta: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData) -> K;\\n\\n\\n\\n\\t/// Converts this value into a `K` JSON value.\\n\\n\\t///\\n\\n\\t/// The `K` value is annotated with the default value of `K::MetaData`.\\n\\n\\tfn as_json(&self) -> K\\n\\n\\twhere\\n\\n\\t\\tK::MetaData: Default,\\n\\n\\t{\\n\\n\\t\\tself.as_json_with(|_| K::MetaData::default())\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/json/build.rs\",\n \"rank\": 4,\n \"score\": 250855.3917039103\n },\n {\n \"content\": \"// Default value for `document_relative` is `false` and for `vocab` is `true`.\\n\\npub fn expand_iri<T: Id, C: Context<T>, M: Clone>(\\n\\n\\tsource: Option<loader::Id>,\\n\\n\\tactive_context: &C,\\n\\n\\tvalue: &str,\\n\\n\\tmetadata: &M,\\n\\n\\tdocument_relative: bool,\\n\\n\\tvocab: bool,\\n\\n\\twarnings: &mut Vec<Loc<Warning, M>>,\\n\\n) -> Term<T> {\\n\\n\\tif let Ok(keyword) = Keyword::try_from(value) {\\n\\n\\t\\tTerm::Keyword(keyword)\\n\\n\\t} else {\\n\\n\\t\\t// If value has the form of a keyword, a processor SHOULD generate a warning and return\\n\\n\\t\\t// null.\\n\\n\\t\\tif is_keyword_like(value) {\\n\\n\\t\\t\\twarnings.push(Loc::new(\\n\\n\\t\\t\\t\\tWarning::KeywordLikeValue(value.to_string()),\\n\\n\\t\\t\\t\\tsource,\\n\\n\\t\\t\\t\\tmetadata.clone(),\\n\\n\\t\\t\\t));\\n\",\n \"file_path\": \"src/expansion/iri.rs\",\n \"rank\": 5,\n \"score\": 244422.88054142243\n },\n {\n \"content\": \"fn optional_string<K: JsonBuild>(s: Option<String>, meta: K::MetaData) -> K {\\n\\n\\tmatch s {\\n\\n\\t\\tSome(s) => K::string(s.as_str().into(), meta),\\n\\n\\t\\tNone => K::null(meta),\\n\\n\\t}\\n\\n}\\n\\n\\n\\n/// Compaction options.\\n\\n#[derive(Clone, Copy)]\\n\\npub struct Options {\\n\\n\\t/// JSON-LD processing mode.\\n\\n\\tpub processing_mode: ProcessingMode,\\n\\n\\n\\n\\t/// Determines if IRIs are compacted relative to the provided base IRI or document location when compacting.\\n\\n\\tpub compact_to_relative: bool,\\n\\n\\n\\n\\t/// If set to `true`, arrays with just one element are replaced with that element during compaction.\\n\\n\\t/// If set to `false`, all arrays will remain arrays even if they have just one element.\\n\\n\\tpub compact_arrays: bool,\\n\\n\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 6,\n \"score\": 240584.95312258805\n },\n {\n \"content\": \"/// Converts a JSON value into the same JSON value represented with another type.\\n\\nfn json_to_json<J: JsonClone, K: JsonFrom<J>>(\\n\\n\\tinput: &J,\\n\\n\\tm: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\\n\\n) -> K {\\n\\n\\tlet meta: K::MetaData = m(Some(input.metadata()));\\n\\n\\tmatch input.as_value_ref() {\\n\\n\\t\\tValueRef::Null => K::null(meta),\\n\\n\\t\\tValueRef::Boolean(b) => K::boolean(b, meta),\\n\\n\\t\\tValueRef::Number(n) => K::number(n.clone().into(), meta),\\n\\n\\t\\tValueRef::String(s) => K::string((&**s).into(), meta),\\n\\n\\t\\tValueRef::Array(a) => K::array(\\n\\n\\t\\t\\ta.iter()\\n\\n\\t\\t\\t\\t.map(|value| json_to_json(&*value, m.clone()))\\n\\n\\t\\t\\t\\t.collect(),\\n\\n\\t\\t\\tmeta,\\n\\n\\t\\t),\\n\\n\\t\\tValueRef::Object(o) => K::object(\\n\\n\\t\\t\\to.iter()\\n\\n\\t\\t\\t\\t.map(|(key, value)| {\\n\\n\\t\\t\\t\\t\\t(\\n\",\n \"file_path\": \"src/util/json/build.rs\",\n \"rank\": 7,\n \"score\": 229751.04597655736\n },\n {\n \"content\": \"/// Checks if the given context has a protected definition.\\n\\npub fn has_protected_items<T: Id, C: Context<T>>(active_context: &C) -> bool {\\n\\n\\tfor (_, definition) in active_context.definitions() {\\n\\n\\t\\tif definition.protected {\\n\\n\\t\\t\\treturn true;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfalse\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 8,\n \"score\": 223777.66258637048\n },\n {\n \"content\": \"pub fn json_ld_eq<J: Json, K: Json>(a: &J, b: &K) -> bool\\n\\nwhere\\n\\n\\tJ::Number: PartialEq<K::Number>,\\n\\n{\\n\\n\\tmatch (a.as_value_ref(), b.as_value_ref()) {\\n\\n\\t\\t(ValueRef::Array(a), ValueRef::Array(b)) if a.len() == b.len() => {\\n\\n\\t\\t\\tlet mut selected = Vec::with_capacity(a.len());\\n\\n\\t\\t\\tselected.resize(a.len(), false);\\n\\n\\n\\n\\t\\t\\t'a_items: for item in a.iter() {\\n\\n\\t\\t\\t\\tfor (i, sel) in selected.iter_mut().enumerate() {\\n\\n\\t\\t\\t\\t\\tif !*sel && json_ld_eq(&*item, &*b.get(i).unwrap()) {\\n\\n\\t\\t\\t\\t\\t\\t*sel = true;\\n\\n\\t\\t\\t\\t\\t\\tcontinue 'a_items;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}\\n\\n\\n\",\n \"file_path\": \"src/util/json/build.rs\",\n \"rank\": 9,\n \"score\": 221149.21036386586\n },\n {\n \"content\": \"/// Local context used for context expansion.\\n\\n///\\n\\n/// Local contexts can be seen as \\\"abstract contexts\\\" that can be processed to enrich an\\n\\n/// existing active context.\\n\\npub trait Local<T: Id = IriBuf>: JsonSendSync {\\n\\n\\t/// Process the local context with specific options.\\n\\n\\tfn process_full<'a, 's: 'a, C: ContextMut<T> + Send + Sync, L: Loader + Send + Sync>(\\n\\n\\t\\t&'s self,\\n\\n\\t\\tactive_context: &'a C,\\n\\n\\t\\tstack: ProcessingStack,\\n\\n\\t\\tloader: &'a mut L,\\n\\n\\t\\tbase_url: Option<Iri<'a>>,\\n\\n\\t\\toptions: ProcessingOptions,\\n\\n\\t) -> BoxFuture<'a, ProcessingResult<'s, Self, C>>\\n\\n\\twhere\\n\\n\\t\\tC::LocalContext: From<L::Output> + From<Self>,\\n\\n\\t\\tL::Output: Into<Self>,\\n\\n\\t\\tT: Send + Sync;\\n\\n\\n\\n\\t/// Process the local context with specific options.\\n\\n\\tfn process_with<'a, 's: 'a, C: ContextMut<T> + Send + Sync, L: Loader + Send + Sync>(\\n\\n\\t\\t&'s self,\\n\\n\\t\\tactive_context: &'a C,\\n\\n\\t\\tloader: &'a mut L,\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 10,\n \"score\": 220148.93547088493\n },\n {\n \"content\": \"/// Type that can be compacted with an index.\\n\\npub trait CompactIndexed<J: JsonSrc, T: Id> {\\n\\n\\t/// Compact with the given optional index.\\n\\n\\tfn compact_indexed<'a, K: JsonFrom<J>, C: ContextMut<T>, L: Loader, M>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\tindex: Option<&'a str>,\\n\\n\\t\\tactive_context: Inversible<T, &'a C>,\\n\\n\\t\\ttype_scoped_context: Inversible<T, &'a C>,\\n\\n\\t\\tactive_property: Option<&'a str>,\\n\\n\\t\\tloader: &'a mut L,\\n\\n\\t\\toptions: Options,\\n\\n\\t\\tmeta: M,\\n\\n\\t) -> BoxFuture<'a, Result<K, Error>>\\n\\n\\twhere\\n\\n\\t\\tJ: 'a,\\n\\n\\t\\tT: 'a,\\n\\n\\t\\tC: Sync + Send,\\n\\n\\t\\tC::LocalContext: Send + Sync + From<L::Output>,\\n\\n\\t\\tL: Sync + Send,\\n\\n\\t\\tM: 'a + Send + Sync + Clone + Fn(Option<&J::MetaData>) -> K::MetaData;\\n\\n}\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 11,\n \"score\": 215402.8616467805\n },\n {\n \"content\": \"/// JSON value that can be converted from a `J` value.\\n\\npub trait JsonFrom<J: Json> = JsonMutSendSync + JsonBuild + JsonIntoMut\\n\\nwhere <Self as Json>::Number: From<<J as Json>::Number>;\\n\\n\\n\",\n \"file_path\": \"src/util/json/build.rs\",\n \"rank\": 12,\n \"score\": 214278.88358181005\n },\n {\n \"content\": \"/// Hash a JSON value.\\n\\n///\\n\\n/// This bypasses any implementations of `Hash` for `J`\\n\\n/// since most JSON implementations (such as `serde_json`) do\\n\\n/// no provide it.\\n\\npub fn hash_json<J: JsonHash, H: Hasher>(json: &J, hasher: &mut H) {\\n\\n\\tuse cc_traits::{Iter, MapIter};\\n\\n\\tmatch json.as_value_ref() {\\n\\n\\t\\tValueRef::Null => (),\\n\\n\\t\\tValueRef::Boolean(b) => b.hash(hasher),\\n\\n\\t\\tValueRef::Number(n) => n.hash(hasher),\\n\\n\\t\\tValueRef::String(s) => s.hash(hasher),\\n\\n\\t\\tValueRef::Array(ary) => {\\n\\n\\t\\t\\tfor item in ary.iter() {\\n\\n\\t\\t\\t\\thash_json(&*item, hasher)\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tValueRef::Object(obj) => {\\n\\n\\t\\t\\t// Elements must be combined with a associative and commutative operation •.\\n\\n\\t\\t\\t// (u64, •, 0) must form a commutative monoid.\\n\\n\\t\\t\\t// This is satisfied by • = u64::wrapping_add.\\n\\n\\t\\t\\tlet mut hash = 0;\\n\\n\\t\\t\\tfor (key, value) in obj.iter() {\\n\\n\\t\\t\\t\\tlet mut h = DefaultHasher::new();\\n\\n\\t\\t\\t\\t(*key).hash(&mut h);\\n\\n\\t\\t\\t\\thash_json(&*value, &mut h);\\n\\n\\t\\t\\t\\thash = u64::wrapping_add(hash, h.finish());\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\thasher.write_u64(hash);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/util/json.rs\",\n \"rank\": 13,\n \"score\": 199606.56048014964\n },\n {\n \"content\": \"/// Type that can be compacted.\\n\\npub trait Compact<J: JsonSrc, T: Id> {\\n\\n\\t/// Compact a JSON-LD document into a `K` JSON value with the provided\\n\\n\\t/// type scoped context, active property and options.\\n\\n\\t///\\n\\n\\t/// Unless you know what you are doing, you will probably prefer\\n\\n\\t/// to use the [`compact`](Compact::compact) and [`compact_with`](Compact::compact_with) functions.\\n\\n\\tfn compact_full<'a, K: JsonFrom<J>, C: ContextMut<T>, L: Loader, M>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\tactive_context: Inversible<T, &'a C>,\\n\\n\\t\\ttype_scoped_context: Inversible<T, &'a C>,\\n\\n\\t\\tactive_property: Option<&'a str>,\\n\\n\\t\\tloader: &'a mut L,\\n\\n\\t\\toptions: Options,\\n\\n\\t\\tmeta: M,\\n\\n\\t) -> BoxFuture<'a, Result<K, Error>>\\n\\n\\twhere\\n\\n\\t\\tJ: 'a,\\n\\n\\t\\tT: 'a,\\n\\n\\t\\tC: Sync + Send,\\n\\n\\t\\tC::LocalContext: Send + Sync + From<L::Output>,\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 14,\n \"score\": 186505.79833668892\n },\n {\n \"content\": \"/// Hash a [`HashMap`].\\n\\n///\\n\\n/// The standard library does not provide (yet) a `Hash` implementation\\n\\n/// for the [`HashMap`] type. This can be used instead.\\n\\n///\\n\\n/// Note that this function not particularly strong and does\\n\\n/// not protect against DoS attacks.\\n\\npub fn hash_map<K: Hash, V: Hash, H: Hasher>(map: &HashMap<K, V>, hasher: &mut H) {\\n\\n\\t// See: https://github.com/rust-lang/rust/pull/48366\\n\\n\\t// Elements must be combined with a associative and commutative operation •.\\n\\n\\t// (u64, •, 0) must form a commutative monoid.\\n\\n\\t// This is satisfied by • = u64::wrapping_add.\\n\\n\\tlet mut hash = 0;\\n\\n\\tfor entry in map {\\n\\n\\t\\tlet mut h = DefaultHasher::new();\\n\\n\\t\\tentry.hash(&mut h);\\n\\n\\t\\thash = u64::wrapping_add(hash, h.finish());\\n\\n\\t}\\n\\n\\n\\n\\thasher.write_u64(hash);\\n\\n}\\n\",\n \"file_path\": \"src/util/mod.rs\",\n \"rank\": 15,\n \"score\": 180620.1758341911\n },\n {\n \"content\": \"/// Default value of `as_array` is false.\\n\\nfn add_value<K: JsonBuild + JsonMut>(\\n\\n\\tmap: &mut K::Object,\\n\\n\\tkey: &str,\\n\\n\\tvalue: K,\\n\\n\\tas_array: bool,\\n\\n\\tmeta: impl Clone + Fn() -> K::MetaData,\\n\\n) {\\n\\n\\tmatch map.get(key).map(|value| value.is_array()) {\\n\\n\\t\\tSome(false) => {\\n\\n\\t\\t\\tlet value = map.remove(key).unwrap();\\n\\n\\t\\t\\tmap.insert(\\n\\n\\t\\t\\t\\tK::new_key(key, meta()),\\n\\n\\t\\t\\t\\tK::array(Some(value).into_iter().collect(), meta()),\\n\\n\\t\\t\\t);\\n\\n\\t\\t}\\n\\n\\t\\tNone if as_array => {\\n\\n\\t\\t\\tmap.insert(K::new_key(key, meta()), K::empty_array(meta()));\\n\\n\\t\\t}\\n\\n\\t\\t_ => (),\\n\\n\\t}\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 16,\n \"score\": 176514.44183118083\n },\n {\n \"content\": \"/// Converts the given `json` value into an array\\n\\n/// if it is not already.\\n\\n///\\n\\n/// Returns a tuple providing an iterator over the items\\n\\n/// of the array, and the size of the array.\\n\\npub fn as_array<J: Json>(json: &J) -> (AsArray<J>, usize) {\\n\\n\\tuse cc_traits::{Iter, Len};\\n\\n\\tmatch json.as_value_ref() {\\n\\n\\t\\tValueRef::Array(ary) => (AsArray::Array(ary.iter()), ary.len()),\\n\\n\\t\\t_ => (AsArray::NotArray(Some(json)), 1),\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/json.rs\",\n \"rank\": 17,\n \"score\": 175736.35360402166\n },\n {\n \"content\": \"fn filter_top_level_item<J: JsonHash, T: Id>(item: &Indexed<Object<J, T>>) -> bool {\\n\\n\\t// Remove dangling values.\\n\\n\\t!matches!(item.inner(), Object::Value(_))\\n\\n}\\n\\n\\n\\npub enum ActiveProperty<'a, J: Json> {\\n\\n\\tNone,\\n\\n\\tSome(&'a str, &'a J::MetaData),\\n\\n}\\n\\n\\n\\nimpl<'a, J: Json> ActiveProperty<'a, J> {\\n\\n\\tpub fn is_none(&self) -> bool {\\n\\n\\t\\tmatches!(self, Self::None)\\n\\n\\t}\\n\\n\\n\\n\\tpub fn is_some(&self) -> bool {\\n\\n\\t\\tmatches!(self, Self::Some(_, _))\\n\\n\\t}\\n\\n\\n\\n\\tpub fn id(&self) -> Option<&'a str> {\\n\",\n \"file_path\": \"src/expansion/mod.rs\",\n \"rank\": 18,\n \"score\": 175322.5807561758\n },\n {\n \"content\": \"/// Unique identifier types.\\n\\n///\\n\\n/// While JSON-LD uses [Internationalized Resource Identifiers (IRIs)](https://en.wikipedia.org/wiki/Internationalized_resource_identifier)\\n\\n/// to uniquely identify each node,\\n\\n/// this crate does not imposes the internal representation of identifiers.\\n\\n///\\n\\n/// Whatever type you choose, it must implement this trait to usure that:\\n\\n/// - there is a low cost bijection with IRIs,\\n\\n/// - it can be cloned ([`Clone`]),\\n\\n/// - it can be compared ([`PartialEq`], [`Eq`]),\\n\\n/// - it can be hashed ([`Hash`]).\\n\\n///\\n\\n/// # Using `enum` types\\n\\n/// If you know in advance which IRIs will be used by your implementation,\\n\\n/// one possibility is to use a `enum` type as identifier.\\n\\n/// This can be done throught the use of the [`Lexicon`](`crate::Lexicon`) type along with the\\n\\n/// [`iref-enum`](https://crates.io/crates/iref-enum) crate:\\n\\n/// ```\\n\\n/// use iref_enum::*;\\n\\n/// use json_ld::Lexicon;\\n\\n/// use ijson::IValue;\\n\\n///\\n\\n/// /// Vocabulary used in the implementation.\\n\\n/// #[derive(IriEnum, Clone, Copy, PartialEq, Eq, Hash)]\\n\\n/// #[iri_prefix(\\\"rdfs\\\" = \\\"http://www.w3.org/2000/01/rdf-schema#\\\")]\\n\\n/// #[iri_prefix(\\\"manifest\\\" = \\\"http://www.w3.org/2001/sw/DataAccess/tests/test-manifest#\\\")]\\n\\n/// #[iri_prefix(\\\"vocab\\\" = \\\"https://w3c.github.io/json-ld-api/tests/vocab#\\\")]\\n\\n/// pub enum Vocab {\\n\\n/// #[iri(\\\"rdfs:comment\\\")] Comment,\\n\\n///\\n\\n/// #[iri(\\\"manifest:name\\\")] Name,\\n\\n/// #[iri(\\\"manifest:entries\\\")] Entries,\\n\\n/// #[iri(\\\"manifest:action\\\")] Action,\\n\\n/// #[iri(\\\"manifest:result\\\")] Result,\\n\\n///\\n\\n/// #[iri(\\\"vocab:PositiveEvaluationTest\\\")] PositiveEvalTest,\\n\\n/// #[iri(\\\"vocab:NegativeEvaluationTest\\\")] NegativeEvalTest,\\n\\n/// #[iri(\\\"vocab:option\\\")] Option,\\n\\n/// #[iri(\\\"vocab:specVersion\\\")] SpecVersion,\\n\\n/// #[iri(\\\"vocab:processingMode\\\")] ProcessingMode,\\n\\n/// #[iri(\\\"vocab:expandContext\\\")] ExpandContext,\\n\\n/// #[iri(\\\"vocab:base\\\")] Base\\n\\n/// }\\n\\n///\\n\\n/// /// A fully functional identifier type.\\n\\n/// pub type Id = Lexicon<Vocab>;\\n\\n///\\n\\n/// fn handle_node(node: &json_ld::Node<IValue, Id>) {\\n\\n/// for name in node.get(Vocab::Name) { // <- note that we can directly use `Vocab` here.\\n\\n/// println!(\\\"node name: {}\\\", name.as_str().unwrap());\\n\\n/// }\\n\\n/// }\\n\\n/// ```\\n\\npub trait Id: AsIri + Clone + PartialEq + Eq + Hash {\\n\\n\\t/// Create an identifier from its IRI.\\n\\n\\tfn from_iri(iri: Iri) -> Self;\\n\\n\\n\\n\\t#[inline(always)]\\n\\n\\tfn as_json<K: JsonBuild>(&self, meta: K::MetaData) -> K {\\n\\n\\t\\tK::string(self.as_iri().as_str().into(), meta)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl Id for IriBuf {\\n\\n\\t#[inline(always)]\\n\\n\\tfn from_iri(iri: Iri) -> IriBuf {\\n\\n\\t\\tiri.into()\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: Id> TermLike for T {\\n\\n\\t#[inline(always)]\\n\\n\\tfn as_str(&self) -> &str {\\n\\n\\t\\tself.as_iri().into_str()\\n\\n\\t}\\n\\n\\n\\n\\t#[inline(always)]\\n\\n\\tfn as_iri(&self) -> Option<Iri> {\\n\\n\\t\\tSome(self.as_iri())\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/id.rs\",\n \"rank\": 19,\n \"score\": 171743.32087855318\n },\n {\n \"content\": \"/// Build an invalid reference and emit a warning.\\n\\nfn invalid<T: Id, M: Clone>(\\n\\n\\tvalue: String,\\n\\n\\tsource: Option<loader::Id>,\\n\\n\\tmetadata: &M,\\n\\n\\twarnings: &mut Vec<Loc<Warning, M>>,\\n\\n) -> Term<T> {\\n\\n\\twarnings.push(Loc::new(\\n\\n\\t\\tWarning::MalformedIri(value.clone()),\\n\\n\\t\\tsource,\\n\\n\\t\\tmetadata.clone(),\\n\\n\\t));\\n\\n\\tReference::Invalid(value).into()\\n\\n}\\n\",\n \"file_path\": \"src/expansion/iri.rs\",\n \"rank\": 20,\n \"score\": 170477.73466020502\n },\n {\n \"content\": \"/// Types that can be converted into a borrowed node reference.\\n\\n///\\n\\n/// This is a convenient trait is used to simplify the use of references.\\n\\n/// For instance consider the [`Node::get`](crate::Node::get) method, used to get the objects associated to the\\n\\n/// given reference property for a given node.\\n\\n/// It essentially have the following signature:\\n\\n/// ```ignore\\n\\n/// fn get(&self, id: &Reference<T>) -> Objects;\\n\\n/// ```\\n\\n/// However building a `Reference` by hand can be tedious, especially while using [`Lexicon`](crate::Lexicon) and\\n\\n/// [`Vocab`](crate::Vocab). It can be as verbose as `node.get(&Reference::Id(Lexicon::Id(MyVocab::Term)))`.\\n\\n/// Thanks to `ToReference` which is implemented by `Lexicon<V>` for any type `V` implementing `Vocab`,\\n\\n/// it is simplified into `node.get(MyVocab::Term)` (while the first syntax remains correct).\\n\\n/// The signature of `get` becomes:\\n\\n/// ```ignore\\n\\n/// fn get<R: ToReference<T>>(&self, id: R) -> Objects;\\n\\n/// ```\\n\\npub trait ToReference<T: Id> {\\n\\n\\t/// The target type of the conversion, which can be borrowed as a `Reference<T>`.\\n\\n\\ttype Reference: Borrow<Reference<T>>;\\n\\n\\n\\n\\t/// Convert the value into a reference.\\n\\n\\tfn to_ref(&self) -> Self::Reference;\\n\\n}\\n\\n\\n\\nimpl<'a, T: Id> ToReference<T> for &'a Reference<T> {\\n\\n\\ttype Reference = &'a Reference<T>;\\n\\n\\n\\n\\t#[inline(always)]\\n\\n\\tfn to_ref(&self) -> Self::Reference {\\n\\n\\t\\tself\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/reference.rs\",\n \"rank\": 21,\n \"score\": 168286.91401530785\n },\n {\n \"content\": \"/// Build an invalid reference and emit a warning.\\n\\nfn invalid_iri<T: Id, M: Clone>(\\n\\n\\tvalue: String,\\n\\n\\tsource: Option<loader::Id>,\\n\\n\\tmetadata: &M,\\n\\n\\twarnings: &mut Vec<Loc<Warning, M>>,\\n\\n) -> Term<T> {\\n\\n\\twarnings.push(Loc::new(\\n\\n\\t\\tWarning::MalformedIri(value.clone()),\\n\\n\\t\\tsource,\\n\\n\\t\\tmetadata.clone(),\\n\\n\\t));\\n\\n\\tReference::Invalid(value).into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 22,\n \"score\": 167270.96189073974\n },\n {\n \"content\": \"/// JSON type that can be used by the compaction algorithm.\\n\\npub trait JsonSrc = JsonClone + JsonHash + JsonSendSync;\\n\\n\\n\\nmod iri;\\n\\nmod node;\\n\\nmod property;\\n\\nmod value;\\n\\n\\n\\npub(crate) use iri::*;\\n\\nuse node::*;\\n\\nuse property::*;\\n\\nuse value::*;\\n\\n\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 23,\n \"score\": 166630.49974199955\n },\n {\n \"content\": \"/// Hash an optional [`HashSet`].\\n\\npub fn hash_set_opt<T: Hash, H: Hasher>(set_opt: &Option<HashSet<T>>, hasher: &mut H) {\\n\\n\\tif let Some(set) = set_opt.as_ref() {\\n\\n\\t\\thash_set(set, hasher)\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/mod.rs\",\n \"rank\": 24,\n \"score\": 166137.72068546986\n },\n {\n \"content\": \"pub trait Any<J: JsonHash, T: Id> {\\n\\n\\tfn as_ref(&self) -> Ref<J, T>;\\n\\n\\n\\n\\t#[inline]\\n\\n\\tfn id<'a>(&'a self) -> Option<&Reference<T>>\\n\\n\\twhere\\n\\n\\t\\tJ: 'a,\\n\\n\\t{\\n\\n\\t\\tmatch self.as_ref() {\\n\\n\\t\\t\\tRef::Node(n) => n.id.as_ref(),\\n\\n\\t\\t\\t_ => None,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t#[inline]\\n\\n\\tfn language<'a>(&'a self) -> Option<LenientLanguageTag>\\n\\n\\twhere\\n\\n\\t\\tJ: 'a,\\n\\n\\t\\tT: 'a,\\n\\n\\t{\\n\",\n \"file_path\": \"src/object/mod.rs\",\n \"rank\": 25,\n \"score\": 166017.21812694194\n },\n {\n \"content\": \"/// JSON-LD context.\\n\\n///\\n\\n/// A context holds all the term definitions used to expand a JSON-LD value.\\n\\npub trait Context<T: Id = IriBuf>: Clone {\\n\\n\\t// TODO Later\\n\\n\\t// type Definitions<'a>: Iterator<Item = (&'a str, TermDefinition<T, Self>)>;\\n\\n\\n\\n\\t/// The type of local contexts associated to this type of contexts.\\n\\n\\ttype LocalContext: Local<T>;\\n\\n\\n\\n\\t/// Create a newly-initialized active context with the given *base IRI*.\\n\\n\\tfn new(base_iri: Option<Iri>) -> Self;\\n\\n\\n\\n\\t/// Get the definition of a term.\\n\\n\\tfn get(&self, term: &str) -> Option<&TermDefinition<T, Self>>;\\n\\n\\n\\n\\tfn get_opt(&self, term: Option<&str>) -> Option<&TermDefinition<T, Self>> {\\n\\n\\t\\tif let Some(term) = term {\\n\\n\\t\\t\\tself.get(term)\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tNone\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 26,\n \"score\": 163539.3699577334\n },\n {\n \"content\": \"type Id = Lexicon<Vocab>;\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n\\tlet mut loader = Loader::<IValue>::new(|s| serde_json::from_str(s));\\n\\n\\n\\n\\t// The JSON-LD document to expand.\\n\\n\\tlet doc = loader\\n\\n\\t\\t.load(iri!(\\n\\n\\t\\t\\t\\\"https://w3c.github.io/json-ld-api/tests/expand-manifest.jsonld\\\"\\n\\n\\t\\t))\\n\\n\\t\\t.await\\n\\n\\t\\t.unwrap();\\n\\n\\n\\n\\t// Expansion.\\n\\n\\tlet expanded_doc = doc\\n\\n\\t\\t.expand::<context::Json<IValue, Id>, _>(&mut loader)\\n\\n\\t\\t.await\\n\\n\\t\\t.unwrap();\\n\\n\\n\",\n \"file_path\": \"examples/reqwest-loader.rs\",\n \"rank\": 27,\n \"score\": 162889.98384171817\n },\n {\n \"content\": \"pub fn is_keyword(str: &str) -> bool {\\n\\n\\tKeyword::try_from(str).is_ok()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/syntax/keyword.rs\",\n \"rank\": 28,\n \"score\": 156660.1044323514\n },\n {\n \"content\": \"pub fn is_keyword_like(s: &str) -> bool {\\n\\n\\tif s.len() > 1 {\\n\\n\\t\\tfor (i, c) in s.chars().enumerate() {\\n\\n\\t\\t\\tif (i == 0 && c != '@') || (i > 0 && !is_alpha(c)) {\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\ttrue\\n\\n\\t} else {\\n\\n\\t\\tfalse\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/syntax/keyword.rs\",\n \"rank\": 29,\n \"score\": 156660.1044323514\n },\n {\n \"content\": \"// Checks if the input term is an IRI ending with a gen-delim character, or a blank node identifier.\\n\\nfn is_gen_delim_or_blank<T: Id>(t: &Term<T>) -> bool {\\n\\n\\tmatch t {\\n\\n\\t\\tTerm::Ref(Reference::Blank(_)) => true,\\n\\n\\t\\tTerm::Ref(Reference::Id(id)) => {\\n\\n\\t\\t\\tif let Some(c) = id.as_iri().as_str().chars().last() {\\n\\n\\t\\t\\t\\tis_gen_delim(c)\\n\\n\\t\\t\\t} else {\\n\\n\\t\\t\\t\\tfalse\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t_ => false,\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 30,\n \"score\": 155886.15333693865\n },\n {\n \"content\": \"/// Mutable JSON-LD context.\\n\\npub trait ContextMut<T: Id = IriBuf>: Context<T> {\\n\\n\\t/// Defines the given term.\\n\\n\\tfn set(\\n\\n\\t\\t&mut self,\\n\\n\\t\\tterm: &str,\\n\\n\\t\\tdefinition: Option<TermDefinition<T, Self>>,\\n\\n\\t) -> Option<TermDefinition<T, Self>>;\\n\\n\\n\\n\\t/// Sets the base IRI of the context.\\n\\n\\tfn set_base_iri(&mut self, iri: Option<Iri>);\\n\\n\\n\\n\\t/// Sets the vocabulary.\\n\\n\\tfn set_vocabulary(&mut self, vocab: Option<Term<T>>);\\n\\n\\n\\n\\t/// Sets the default language.\\n\\n\\tfn set_default_language(&mut self, lang: Option<LenientLanguageTagBuf>);\\n\\n\\n\\n\\t/// Sets de default language base direction.\\n\\n\\tfn set_default_base_direction(&mut self, dir: Option<Direction>);\\n\\n\\n\\n\\t/// Sets the previous context.\\n\\n\\tfn set_previous_context(&mut self, previous: Self);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 31,\n \"score\": 155403.9141040239\n },\n {\n \"content\": \"type LangDir = Nullable<(Option<LenientLanguageTagBuf>, Option<Direction>)>;\\n\\n\\n\",\n \"file_path\": \"src/context/inverse.rs\",\n \"rank\": 32,\n \"score\": 155231.99265009956\n },\n {\n \"content\": \"/// Result of the `expand_node_entries` function.\\n\\ntype NodeEntriesExpensionResult<J, T> =\\n\\n\\tResult<ExpandedNode<J, T>, Loc<Error, <J as Json>::MetaData>>;\\n\\n\\n\",\n \"file_path\": \"src/expansion/node.rs\",\n \"rank\": 33,\n \"score\": 154524.2454478619\n },\n {\n \"content\": \"/// Type returned by the `expand_node_entries` function.\\n\\n///\\n\\n/// It is a tuple containing both the node being expanded\\n\\n/// and a boolean flag set to `true` if the node contains\\n\\n/// value object entries (in practice, if it has a `@language` entry).\\n\\ntype ExpandedNode<J, T> = (Indexed<Node<J, T>>, bool);\\n\\n\\n\",\n \"file_path\": \"src/expansion/node.rs\",\n \"rank\": 34,\n \"score\": 153371.23600625206\n },\n {\n \"content\": \"pub trait JsonContext = JsonSendSync + JsonClone;\\n\\n\\n\\n/// Options of the Context Processing Algorithm.\\n\\n#[derive(Clone, Copy, PartialEq, Eq)]\\n\\npub struct ProcessingOptions {\\n\\n\\t/// The processing mode\\n\\n\\tpub processing_mode: ProcessingMode,\\n\\n\\n\\n\\t/// Override protected definitions.\\n\\n\\tpub override_protected: bool,\\n\\n\\n\\n\\t/// Propagate the processed context.\\n\\n\\tpub propagate: bool,\\n\\n}\\n\\n\\n\\nimpl ProcessingOptions {\\n\\n\\t/// Return the same set of options, but with `override_protected` set to `true`.\\n\\n\\tpub fn with_override(&self) -> ProcessingOptions {\\n\\n\\t\\tlet mut opt = *self;\\n\\n\\t\\topt.override_protected = true;\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 35,\n \"score\": 150083.0570826471\n },\n {\n \"content\": \"/// JSON document loader.\\n\\n///\\n\\n/// Each document is uniquely identified by the loader by a `u32`.\\n\\npub trait Loader {\\n\\n\\t/// The type of documents that can be loaded.\\n\\n\\ttype Document: Json;\\n\\n\\n\\n\\t/// Returns the unique identifier associated to the given IRI, if any.\\n\\n\\tfn id(&self, iri: Iri<'_>) -> Option<Id>;\\n\\n\\n\\n\\t/// Returns the unique identifier associated to the given IRI, if any.\\n\\n\\t///\\n\\n\\t/// Returns `None` if the input `iri` is `None`.\\n\\n\\t#[inline(always)]\\n\\n\\tfn id_opt(&self, iri: Option<Iri<'_>>) -> Option<Id> {\\n\\n\\t\\tiri.map(|iri| self.id(iri)).flatten()\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns the IRI with the given identifier, if any.\\n\\n\\tfn iri(&self, id: Id) -> Option<Iri<'_>>;\\n\\n\\n\\n\\t/// Loads the document behind the given IRI.\\n\\n\\tfn load<'a>(\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 36,\n \"score\": 143972.33304379546\n },\n {\n \"content\": \"pub trait Loader {\\n\\n\\ttype Output;\\n\\n\\n\\n\\t/// Returns the unique identifier associated to the given IRI, if any.\\n\\n\\tfn id(&self, iri: Iri<'_>) -> Option<crate::loader::Id>;\\n\\n\\n\\n\\t/// Returns the unique identifier associated to the given IRI, if any.\\n\\n\\t///\\n\\n\\t/// Returns `None` if the input `iri` is `None`.\\n\\n\\t#[inline(always)]\\n\\n\\tfn id_opt(&self, iri: Option<Iri<'_>>) -> Option<crate::loader::Id> {\\n\\n\\t\\tiri.map(|iri| self.id(iri)).flatten()\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns the IRI with the given identifier, if any.\\n\\n\\tfn iri(&self, id: crate::loader::Id) -> Option<Iri<'_>>;\\n\\n\\n\\n\\tfn load_context<'a>(\\n\\n\\t\\t&'a mut self,\\n\\n\\t\\turl: Iri,\\n\",\n \"file_path\": \"src/context/loader.rs\",\n \"rank\": 37,\n \"score\": 141459.24707990457\n },\n {\n \"content\": \"pub fn is_json_media_type(ty: &str) -> bool {\\n\\n\\tty == \\\"application/json\\\" || ty == \\\"application/ld+json\\\"\\n\\n}\\n\\n\\n\\npub async fn load_remote_json_ld_document<J, P>(\\n\\n\\turl: Iri<'_>,\\n\\n\\tparser: &mut P,\\n\\n) -> Result<J, Error>\\n\\nwhere\\n\\n\\tP: Send + Sync + FnMut(&str) -> Result<J, Error>,\\n\\n{\\n\\n\\tlog::info!(\\\"loading remote document `{}'\\\", url);\\n\\n\\tuse reqwest::header::*;\\n\\n\\n\\n\\tlet client = reqwest::Client::new();\\n\\n\\tlet request = client\\n\\n\\t\\t.get(url.as_str())\\n\\n\\t\\t.header(ACCEPT, \\\"application/ld+json, application/json\\\");\\n\\n\\tlet response = request.send().await?;\\n\\n\\n\",\n \"file_path\": \"src/reqwest/mod.rs\",\n \"rank\": 38,\n \"score\": 139598.96823707287\n },\n {\n \"content\": \"fn generate_test(entry: &Node<IValue, Id>) {\\n\\n\\tlet name = entry.get(Vocab::Name).next().unwrap().as_str().unwrap();\\n\\n\\tlet url = entry.get(Vocab::Action).next().unwrap().as_iri().unwrap();\\n\\n\\tlet mut base_url = url;\\n\\n\\tlet func_name = func_name(url.path().file_name().unwrap());\\n\\n\\n\\n\\tlet mut processing_mode = ProcessingMode::JsonLd1_1;\\n\\n\\tlet mut context_url = \\\"None\\\".to_string();\\n\\n\\n\\n\\tfor option in entry.get(Vocab::Option) {\\n\\n\\t\\tif let Object::Node(option) = option.as_ref() {\\n\\n\\t\\t\\tfor normative in option.get(Vocab::Normative) {\\n\\n\\t\\t\\t\\tif let Some(false) = normative.inner().as_bool() {\\n\\n\\t\\t\\t\\t\\tinfo!(\\\"skipping test {} (non normative)\\\", url);\\n\\n\\t\\t\\t\\t\\treturn;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tfor spec_version in option.get(Vocab::SpecVersion) {\\n\\n\\t\\t\\t\\tif let Some(spec_version) = spec_version.as_str() {\\n\",\n \"file_path\": \"examples/generate-expand-tests.rs\",\n \"rank\": 39,\n \"score\": 139586.9855861585\n },\n {\n \"content\": \"fn generate_test(entry: &Node<IValue, Id>) {\\n\\n\\tlet name = entry.get(Vocab::Name).next().unwrap().as_str().unwrap();\\n\\n\\tlet url = entry.get(Vocab::Action).next().unwrap().as_iri().unwrap();\\n\\n\\tlet mut base_url = url;\\n\\n\\n\\n\\tif url == \\\"https://w3c.github.io/json-ld-api/tests/compact/p004-in.jsonld\\\" {\\n\\n\\t\\twarn!(\\n\\n\\t\\t\\t\\\"skipping invalid test {} (https://github.com/w3c/json-ld-api/issues/517)\\\",\\n\\n\\t\\t\\turl\\n\\n\\t\\t);\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\tlet func_name = func_name(url.path().file_name().unwrap());\\n\\n\\n\\n\\tlet mut processing_mode = ProcessingMode::JsonLd1_1;\\n\\n\\tlet mut compact_arrays = true;\\n\\n\\tlet mut context_url = \\\"None\\\".to_string();\\n\\n\\n\\n\\tfor context in entry.get(Vocab::Context) {\\n\",\n \"file_path\": \"examples/generate-compact-tests.rs\",\n \"rank\": 40,\n \"score\": 139586.9855861585\n },\n {\n \"content\": \"/// Trait for types that are or wrap a mutable context.\\n\\n///\\n\\n/// This trait is used by the [`Document::compact`](crate::Document::compact)\\n\\n/// function to accept either a context or a wrapper to a context.\\n\\npub trait ContextMutProxy<T: Id = IriBuf> {\\n\\n\\ttype Target: ContextMut<T>;\\n\\n\\n\\n\\t/// Returns a reference to the mutable context.\\n\\n\\tfn deref(&self) -> &Self::Target;\\n\\n}\\n\\n\\n\\n/// Context processing result.\\n\\npub type ProcessingResult<'s, J, C> =\\n\\n\\tResult<Processed<'s, J, C>, Loc<Error, <J as generic_json::Json>::MetaData>>;\\n\\n\\n\",\n \"file_path\": \"src/context/mod.rs\",\n \"rank\": 41,\n \"score\": 139427.98776343325\n },\n {\n \"content\": \"type Id = Lexicon<Foaf>;\\n\\n\\n\\n#[async_std::main]\\n\\nasync fn main() {\\n\\n\\t// The JSON-LD document to expand.\\n\\n\\tlet doc: IValue = serde_json::from_str(\\n\\n\\t\\tr#\\\"\\n\\n\\t\\t{\\n\\n\\t\\t\\t\\\"@context\\\": {\\n\\n\\t\\t\\t\\t\\\"name\\\": \\\"http://xmlns.com/foaf/0.1/name\\\",\\n\\n\\t\\t\\t\\t\\\"email\\\": \\\"http://xmlns.com/foaf/0.1/mbox\\\"\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\t\\\"@id\\\": \\\"timothee.haudebourg.net\\\",\\n\\n\\t\\t\\t\\\"name\\\": \\\"Timothée Haudebourg\\\",\\n\\n\\t\\t\\t\\\"email\\\": \\\"author@haudebourg.net\\\"\\n\\n\\t\\t}\\n\\n\\t\\\"#,\\n\\n\\t)\\n\\n\\t.unwrap();\\n\\n\\n\",\n \"file_path\": \"examples/custom-ids.rs\",\n \"rank\": 42,\n \"score\": 136247.2458117928\n },\n {\n \"content\": \"type Id = Lexicon<Foaf>;\\n\\n\\n\\n#[async_std::main]\\n\\nasync fn main() {\\n\\n\\t// The JSON-LD document to expand.\\n\\n\\tlet doc: IValue = serde_json::from_str(\\n\\n\\t\\tr#\\\"\\n\\n\\t\\t{\\n\\n\\t\\t\\t\\\"@context\\\": {\\n\\n\\t\\t\\t\\t\\\"name\\\": \\\"http://xmlns.com/foaf/0.1/name\\\",\\n\\n\\t\\t\\t\\t\\\"email\\\": \\\"http://xmlns.com/foaf/0.1/mbox\\\"\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\t\\\"@id\\\": \\\"timothee.haudebourg.net\\\",\\n\\n\\t\\t\\t\\\"name\\\": \\\"Timothée Haudebourg\\\",\\n\\n\\t\\t\\t\\\"email\\\": \\\"author@haudebourg.net\\\"\\n\\n\\t\\t}\\n\\n\\t\\\"#,\\n\\n\\t)\\n\\n\\t.unwrap();\\n\\n\\n\",\n \"file_path\": \"examples/custom-ids-iref-enum.rs\",\n \"rank\": 43,\n \"score\": 131897.79725483432\n },\n {\n \"content\": \"/// JSON document that can be expanded.\\n\\npub trait JsonExpand = JsonSendSync + JsonHash + JsonClone + JsonLft<'static>;\\n\\n\\n\\n/// Expansion options.\\n\\n#[derive(Clone, Copy, Default)]\\n\\npub struct Options {\\n\\n\\t/// Sets the processing mode.\\n\\n\\tpub processing_mode: ProcessingMode,\\n\\n\\n\\n\\t/// Term expansion policy.\\n\\n\\t///\\n\\n\\t/// Default is `Policy::Standard`.\\n\\n\\tpub policy: Policy,\\n\\n\\n\\n\\t/// If set to true, input document entries are processed lexicographically.\\n\\n\\t/// If false, order is not considered in processing.\\n\\n\\tpub ordered: bool,\\n\\n}\\n\\n\\n\\n/// Key expansion policy.\\n\\n///\\n\",\n \"file_path\": \"src/expansion/mod.rs\",\n \"rank\": 44,\n \"score\": 130942.96413379215\n },\n {\n \"content\": \"/// Hash a [`HashSet`].\\n\\n///\\n\\n/// The standard library does not provide (yet) a `Hash` implementation\\n\\n/// for the [`HashSet`] type. This can be used instead.\\n\\n///\\n\\n/// Note that this function not particularly strong and does\\n\\n/// not protect against DoS attacks.\\n\\npub fn hash_set<T: Hash, H: Hasher>(set: &HashSet<T>, hasher: &mut H) {\\n\\n\\t// See: https://github.com/rust-lang/rust/pull/48366\\n\\n\\t// Elements must be combined with a associative and commutative operation •.\\n\\n\\t// (u64, •, 0) must form a commutative monoid.\\n\\n\\t// This is satisfied by • = u64::wrapping_add.\\n\\n\\tlet mut hash = 0;\\n\\n\\tfor item in set {\\n\\n\\t\\tlet mut h = DefaultHasher::new();\\n\\n\\t\\titem.hash(&mut h);\\n\\n\\t\\thash = u64::wrapping_add(hash, h.finish());\\n\\n\\t}\\n\\n\\n\\n\\thasher.write_u64(hash);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/mod.rs\",\n \"rank\": 45,\n \"score\": 130617.99678782682\n },\n {\n \"content\": \"/// Checks if the the given character is included in the given string anywhere but at the first position.\\n\\nfn contains_after_first(id: &str, c: char) -> bool {\\n\\n\\tif let Some(i) = id.find(c) {\\n\\n\\t\\ti > 0\\n\\n\\t} else {\\n\\n\\t\\tfalse\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 46,\n \"score\": 130429.11011091601\n },\n {\n \"content\": \"/// Checks if the the given character is included in the given string anywhere but at the first or last position.\\n\\nfn contains_between_boundaries(id: &str, c: char) -> bool {\\n\\n\\tif let Some(i) = id.find(c) {\\n\\n\\t\\tlet j = id.rfind(c).unwrap();\\n\\n\\t\\ti > 0 && j < id.len() - 1\\n\\n\\t} else {\\n\\n\\t\\tfalse\\n\\n\\t}\\n\\n}\\n\\n\\n\\n// fn define<'a>(&mut self, env: &mut DefinitionEnvironment<'a>, term: &str, value: &JsonValue) -> Result<(), Self::Error> {\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 47,\n \"score\": 130429.11011091601\n },\n {\n \"content\": \"enum TypeLangValue<'a, T: Id> {\\n\\n\\tType(TypeSelection<T>),\\n\\n\\tLang(LangSelection<'a>),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 48,\n \"score\": 127374.06960842901\n },\n {\n \"content\": \"/// Follows the `https://www.w3.org/TR/json-ld11-api/#create-term-definition` algorithm.\\n\\n/// Default value for `base_url` is `None`. Default values for `protected` and `override_protected` are `false`.\\n\\npub fn define<\\n\\n\\t'a,\\n\\n\\tJ: JsonContext,\\n\\n\\tT: Id + Send + Sync,\\n\\n\\tC: ContextMut<T> + Send + Sync,\\n\\n\\tL: Loader + Send + Sync,\\n\\n>(\\n\\n\\tactive_context: &'a mut C,\\n\\n\\tlocal_context: &'a LocalContextObject<'a, J::Object>,\\n\\n\\tterm: &'a str,\\n\\n\\tterm_metadata: &'a J::MetaData,\\n\\n\\tdefined: &'a mut HashMap<String, bool>,\\n\\n\\tremote_contexts: ProcessingStack,\\n\\n\\tloader: &'a mut L,\\n\\n\\tbase_url: Option<Iri<'a>>,\\n\\n\\tprotected: bool,\\n\\n\\toptions: ProcessingOptions,\\n\\n\\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\\n\\n) -> BoxFuture<'a, Result<(), Error>>\\n\\nwhere\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 49,\n \"score\": 125352.30180086978\n },\n {\n \"content\": \"/// Expand an element.\\n\\n///\\n\\n/// See <https://www.w3.org/TR/json-ld11-api/#expansion-algorithm>.\\n\\n/// The default specified value for `ordered` and `from_map` is `false`.\\n\\npub fn expand_element<\\n\\n\\t'a,\\n\\n\\tJ: JsonExpand,\\n\\n\\tT: 'a + Id + Send + Sync,\\n\\n\\tC: ContextMut<T> + Send + Sync,\\n\\n\\tL: Loader + Send + Sync,\\n\\n>(\\n\\n\\tactive_context: &'a C,\\n\\n\\tactive_property: ActiveProperty<'a, J>,\\n\\n\\telement: &'a J,\\n\\n\\tbase_url: Option<Iri<'a>>,\\n\\n\\tloader: &'a mut L,\\n\\n\\toptions: Options,\\n\\n\\tfrom_map: bool,\\n\\n\\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\\n\\n) -> BoxFuture<'a, ElementExpansionResult<T, J>>\\n\\nwhere\\n\\n\\tC::LocalContext: From<L::Output> + From<J> + Send + Sync,\\n\\n\\tL::Output: Into<J>,\\n\\n{\\n\",\n \"file_path\": \"src/expansion/element.rs\",\n \"rank\": 50,\n \"score\": 122742.60828076521\n },\n {\n \"content\": \"/// JSON-LD document.\\n\\n///\\n\\n/// This trait represent a JSON-LD document that can be expanded into an [`ExpandedDocument`]\\n\\n/// or compacted. It is the main entry point to the JSON-LD API.\\n\\n/// It is notably implemented for any type implementing the [generic_json::Json] trait.\\n\\npub trait Document<T: Id> {\\n\\n\\ttype Json: Json;\\n\\n\\n\\n\\t/// Document location, if any.\\n\\n\\tfn base_url(&self) -> Option<Iri>;\\n\\n\\n\\n\\t/// Expand the document with a custom base URL, initial context, document loader and\\n\\n\\t/// expansion options.\\n\\n\\t///\\n\\n\\t/// If you do not wish to set the base URL and expansion options yourself, the\\n\\n\\t/// [`expand`](`Document::expand`) method is more appropriate.\\n\\n\\t///\\n\\n\\t/// This is an asynchronous method since expanding the context may require loading remote\\n\\n\\t/// ressources. It returns a boxed [`Future`](`std::future::Future`) to the result.\\n\\n\\tfn expand_with<'a, C: 'a + ContextMut<T>, L: 'a + Loader>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\tbase_url: Option<Iri>,\\n\\n\\t\\tcontext: &'a C,\\n\\n\\t\\tloader: &'a mut L,\\n\\n\\t\\toptions: expansion::Options,\\n\",\n \"file_path\": \"src/document.rs\",\n \"rank\": 51,\n \"score\": 120645.01346474749\n },\n {\n \"content\": \"fn is_alpha(c: char) -> bool {\\n\\n\\tlet c = c as u32;\\n\\n\\t(0x41..=0x5a).contains(&c) || (0x61..=0x7a).contains(&c)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/syntax/keyword.rs\",\n \"rank\": 52,\n \"score\": 120285.75884813514\n },\n {\n \"content\": \"fn negative_test(options: Options, input_url: Iri, base_url: Iri, error_code: ErrorCode) {{\\n\\n\\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\\n\\n\\tloader.mount(iri!(\\\"https://w3c.github.io/json-ld-api\\\"), \\\"json-ld-api\\\");\\n\\n\\n\\n\\tlet input = task::block_on(loader.load(input_url)).unwrap();\\n\\n\\tlet mut input_context: context::Json<IValue, IriBuf> = context::Json::new(Some(base_url));\\n\\n\\n\\n\\tif let Some(context_url) = options.context {{\\n\\n\\t\\tlet local_context = task::block_on(loader.load_context(context_url)).unwrap().into_context();\\n\\n\\t\\tinput_context = task::block_on(local_context.process_with(&input_context, &mut loader, Some(base_url), options.into())).unwrap().into_inner();\\n\\n\\t}}\\n\\n\\n\\n\\tlet result = task::block_on(input.expand_with(Some(base_url), &input_context, &mut loader, options.into()));\\n\\n\\n\\n\\tmatch result {{\\n\\n\\t\\tOk(output) => {{\\n\\n\\t\\t\\tlet output_json: IValue = output.as_json();\\n\\n\\t\\t\\tprintln!(\\\"output=\\\\n{{}}\\\", serde_json::to_string_pretty(&output_json).unwrap());\\n\\n\\t\\t\\tpanic!(\\\"expansion succeeded where it should have failed with code: {{}}\\\", error_code)\\n\\n\\t\\t}},\\n\\n\\t\\tErr(e) => {{\\n\\n\\t\\t\\tassert_eq!(e.code(), error_code)\\n\\n\\t\\t}}\\n\\n\\t}}\\n\\n}}\\n\",\n \"file_path\": \"tests/templates/expand-header.rs\",\n \"rank\": 53,\n \"score\": 118185.44112114781\n },\n {\n \"content\": \"fn negative_test(options: Options, input_url: Iri, base_url: Iri, error_code: ErrorCode) {{\\n\\n\\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\\n\\n\\tloader.mount(iri!(\\\"https://w3c.github.io/json-ld-api\\\"), \\\"json-ld-api\\\");\\n\\n\\n\\n\\tlet input = task::block_on(loader.load(input_url)).unwrap();\\n\\n\\tlet base_json_context = base_json_context(base_url);\\n\\n\\tlet mut input_context: ProcessedOwned<IValue, context::Json<IValue, IriBuf>> =\\n\\n\\t\\tProcessedOwned::new(base_json_context, context::Json::new(Some(base_url)));\\n\\n\\n\\n\\tif let Some(context_url) = options.context {{\\n\\n\\t\\tlet local_context = task::block_on(loader.load_context(context_url)).unwrap().into_context();\\n\\n\\t\\tinput_context = match task::block_on(local_context.process_with(input_context.as_ref(), &mut loader, Some(base_url), options.into())) {{\\n\\n\\t\\t\\tOk(context) => context.owned(),\\n\\n\\t\\t\\tErr(e) => {{\\n\\n\\t\\t\\t\\tassert_eq!(e.code(), error_code);\\n\\n\\t\\t\\t\\treturn\\n\\n\\t\\t\\t}}\\n\\n\\t\\t}};\\n\\n\\t}}\\n\\n\\n\",\n \"file_path\": \"tests/templates/compact-header.rs\",\n \"rank\": 54,\n \"score\": 118185.44112114781\n },\n {\n \"content\": \"/// Type that can be converted into a `K` JSON value.\\n\\npub trait AsAnyJson<K: JsonBuild> {\\n\\n\\t/// Converts this value into a `K` JSON value using the\\n\\n\\t/// given `meta` value as metadata.\\n\\n\\tfn as_json_with(&self, meta: K::MetaData) -> K;\\n\\n\\n\\n\\t/// Converts this value into a `K` JSON value using the\\n\\n\\t/// default metadata value.\\n\\n\\tfn as_json(&self) -> K\\n\\n\\twhere\\n\\n\\t\\tK::MetaData: Default,\\n\\n\\t{\\n\\n\\t\\tself.as_json_with(K::MetaData::default())\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util/json/build.rs\",\n \"rank\": 55,\n \"score\": 115926.41240689947\n },\n {\n \"content\": \"fn no_metadata<M>(_: Option<&M>) -> () {{\\n\\n\\t()\\n\\n}}\\n\\n\\n\",\n \"file_path\": \"tests/templates/compact-header.rs\",\n \"rank\": 56,\n \"score\": 113491.2087715014\n },\n {\n \"content\": \"/// Resolve `iri_ref` against the given base IRI.\\n\\nfn resolve_iri(iri_ref: IriRef, base_iri: Option<Iri>) -> Option<IriBuf> {\\n\\n\\tmatch base_iri {\\n\\n\\t\\tSome(base_iri) => Some(iri_ref.resolved(base_iri)),\\n\\n\\t\\tNone => match iri_ref.into_iri() {\\n\\n\\t\\t\\tOk(iri) => Some(iri.into()),\\n\\n\\t\\t\\tErr(_) => None,\\n\\n\\t\\t},\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 57,\n \"score\": 112763.18360057272\n },\n {\n \"content\": \"fn func_name(id: &str) -> String {\\n\\n\\tlet mut name = \\\"compact_\\\".to_string();\\n\\n\\n\\n\\tfor c in id.chars() {\\n\\n\\t\\tmatch c {\\n\\n\\t\\t\\t'.' | '-' => break,\\n\\n\\t\\t\\t_ => name.push(c),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tname\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/generate-compact-tests.rs\",\n \"rank\": 58,\n \"score\": 111268.8361599289\n },\n {\n \"content\": \"fn func_name(id: &str) -> String {\\n\\n\\tlet mut name = \\\"expand_\\\".to_string();\\n\\n\\n\\n\\tfor c in id.chars() {\\n\\n\\t\\tmatch c {\\n\\n\\t\\t\\t'.' | '-' => break,\\n\\n\\t\\t\\t_ => name.push(c),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tname\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/generate-expand-tests.rs\",\n \"rank\": 59,\n \"score\": 111268.8361599289\n },\n {\n \"content\": \"pub trait TermLike {\\n\\n\\tfn as_iri(&self) -> Option<Iri>;\\n\\n\\n\\n\\tfn as_str(&self) -> &str;\\n\\n}\\n\\n\\n\\n#[derive(Clone, PartialEq, Eq, Hash)]\\n\\npub enum Term<T: AsIri> {\\n\\n\\tNull,\\n\\n\\tRef(Reference<T>),\\n\\n\\tKeyword(Keyword),\\n\\n}\\n\\n\\n\\nimpl<T: AsIri> Term<T> {\\n\\n\\tpub fn is_null(&self) -> bool {\\n\\n\\t\\tmatches!(self, Term::Null)\\n\\n\\t}\\n\\n\\n\\n\\tpub fn into_id(self) -> Result<T, Self> {\\n\\n\\t\\tmatch self {\\n\",\n \"file_path\": \"src/syntax/term.rs\",\n \"rank\": 60,\n \"score\": 110414.28213758089\n },\n {\n \"content\": \"/// Vocabulary type.\\n\\n///\\n\\n/// Directly using [`IriBuf`] to identify each node\\n\\n/// can be very expensive.\\n\\n/// When you know in advance the set of IRIs will be used\\n\\n/// in your application, it is more effective to use\\n\\n/// an `enum` type where each variant represents an IRI.\\n\\n/// In this case, storing and comparing IRIs become very cheap.\\n\\n///\\n\\n/// In this setting, such `enum` type can implement the\\n\\n/// `Vocab` trait, automatically implemented in most cases.\\n\\n/// It can then be wrapped around the [`Vocab`] type to handle unexpected\\n\\n/// IRIs, and be used as identifier type instead of `IriBuf`.\\n\\npub trait Vocab: AsIri + Clone + PartialEq + Eq + Hash {\\n\\n\\tfn from_iri(iri: Iri) -> Option<Self>;\\n\\n}\\n\\n\\n\\nimpl<T: AsIri + Clone + PartialEq + Eq + Hash> Vocab for T\\n\\nwhere\\n\\n\\tfor<'a> T: TryFrom<Iri<'a>>,\\n\\n{\\n\\n\\t#[inline]\\n\\n\\tfn from_iri(iri: Iri) -> Option<Self> {\\n\\n\\t\\tmatch T::try_from(iri) {\\n\\n\\t\\t\\tOk(t) => Some(t),\\n\\n\\t\\t\\tErr(_) => None,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<V: Vocab> ToReference<Lexicon<V>> for V {\\n\\n\\ttype Reference = Reference<Lexicon<V>>;\\n\\n\\n\",\n \"file_path\": \"src/vocab.rs\",\n \"rank\": 61,\n \"score\": 107721.49633706709\n },\n {\n \"content\": \"/// Compact the given list of types into the given `result` compacted object.\\n\\nfn compact_types<\\n\\n\\tJ: JsonSrc,\\n\\n\\tK: JsonFrom<J>,\\n\\n\\tT: Sync + Send + Id,\\n\\n\\tC: ContextMut<T>,\\n\\n\\tM: Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\\n\\n>(\\n\\n\\tresult: &mut K::Object,\\n\\n\\ttypes: &[Reference<T>],\\n\\n\\tactive_context: Inversible<T, &C>,\\n\\n\\ttype_scoped_context: Inversible<T, &C>,\\n\\n\\toptions: Options,\\n\\n\\tmeta: M,\\n\\n) -> Result<(), Error> {\\n\\n\\t// If expanded property is @type:\\n\\n\\tif !types.is_empty() {\\n\\n\\t\\t// If expanded value is a string,\\n\\n\\t\\t// then initialize compacted value by IRI compacting expanded value using\\n\\n\\t\\t// type-scoped context for active context.\\n\\n\\t\\tlet compacted_value = if types.len() == 1 {\\n\",\n \"file_path\": \"src/compaction/node.rs\",\n \"rank\": 62,\n \"score\": 101090.78438681859\n },\n {\n \"content\": \"struct InverseType<T: Id> {\\n\\n\\treverse: Option<String>,\\n\\n\\tany: Option<String>,\\n\\n\\tmap: HashMap<Type<T>, String>,\\n\\n}\\n\\n\\n\\nimpl<T: Id> InverseType<T> {\\n\\n\\tfn select(&self, selection: TypeSelection<T>) -> Option<&str> {\\n\\n\\t\\tmatch selection {\\n\\n\\t\\t\\tTypeSelection::Reverse => self.reverse.as_ref(),\\n\\n\\t\\t\\tTypeSelection::Any => self.any.as_ref(),\\n\\n\\t\\t\\tTypeSelection::Type(ty) => self.map.get(&ty),\\n\\n\\t\\t}\\n\\n\\t\\t.map(|v| v.as_str())\\n\\n\\t}\\n\\n\\n\\n\\tfn set_any(&mut self, term: &str) {\\n\\n\\t\\tif self.any.is_none() {\\n\\n\\t\\t\\tself.any = Some(term.to_string())\\n\\n\\t\\t}\\n\",\n \"file_path\": \"src/context/inverse.rs\",\n \"rank\": 63,\n \"score\": 96392.56480981573\n },\n {\n \"content\": \"fn positive_test(options: Options, input_url: Iri, base_url: Iri, output_url: Iri) {\\n\\n\\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\\n\\n\\tloader.mount(iri!(\\\"file://crate/tests\\\"), \\\"tests\\\");\\n\\n\\n\\n\\tlet input = task::block_on(loader.load(input_url)).unwrap();\\n\\n\\tlet output = task::block_on(loader.load(output_url)).unwrap();\\n\\n\\tlet mut input_context: context::Json<IValue, IriBuf> = context::Json::new(Some(base_url));\\n\\n\\n\\n\\tif let Some(context_url) = options.context {\\n\\n\\t\\tlet local_context = task::block_on(loader.load_context(context_url))\\n\\n\\t\\t\\t.unwrap()\\n\\n\\t\\t\\t.into_context();\\n\\n\\t\\tinput_context = task::block_on(local_context.process_with(\\n\\n\\t\\t\\t&input_context,\\n\\n\\t\\t\\t&mut loader,\\n\\n\\t\\t\\tSome(base_url),\\n\\n\\t\\t\\toptions.into(),\\n\\n\\t\\t))\\n\\n\\t\\t.unwrap()\\n\\n\\t\\t.into_inner();\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 64,\n \"score\": 84632.62336804457\n },\n {\n \"content\": \"fn base_json_context(base_url: Iri) -> IValue {{\\n\\n\\tlet mut object = ijson::IObject::new();\\n\\n\\tobject.insert(\\\"@base\\\", IValue::from(base_url.as_str()));\\n\\n\\tobject.into()\\n\\n}}\\n\\n\\n\",\n \"file_path\": \"tests/templates/compact-header.rs\",\n \"rank\": 65,\n \"score\": 83788.55595186341\n },\n {\n \"content\": \"fn is_gen_delim(c: char) -> bool {\\n\\n\\tmatches!(c, ':' | '/' | '?' | '#' | '[' | ']' | '@')\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 66,\n \"score\": 81949.26448331005\n },\n {\n \"content\": \"fn positive_test(options: Options, input_url: Iri, base_url: Iri, output_url: Iri) {{\\n\\n\\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\\n\\n\\tloader.mount(iri!(\\\"https://w3c.github.io/json-ld-api\\\"), \\\"json-ld-api\\\");\\n\\n\\n\\n\\tlet input = task::block_on(loader.load(input_url)).unwrap();\\n\\n\\tlet expected_output = task::block_on(loader.load(output_url)).unwrap();\\n\\n\\tlet mut input_context: context::Json<IValue, IriBuf> = context::Json::new(Some(base_url));\\n\\n\\n\\n\\tif let Some(context_url) = options.context {{\\n\\n\\t\\tlet local_context = task::block_on(loader.load_context(context_url)).unwrap().into_context();\\n\\n\\t\\tinput_context = task::block_on(local_context.process_with(&input_context, &mut loader, Some(base_url), options.into())).unwrap().into_inner();\\n\\n\\t}}\\n\\n\\n\\n\\tlet output = task::block_on(input.expand_with(Some(base_url), &input_context, &mut loader, options.into())).unwrap();\\n\\n\\tlet output_json: IValue = output.as_json();\\n\\n\\n\\n\\tlet success = json_ld_eq(&output_json, &*expected_output);\\n\\n\\n\\n\\tif !success {{\\n\\n\\t\\tprintln!(\\n\",\n \"file_path\": \"tests/templates/expand-header.rs\",\n \"rank\": 67,\n \"score\": 81835.72533462285\n },\n {\n \"content\": \"fn positive_test(options: Options, input_url: Iri, base_url: Iri, output_url: Iri) {{\\n\\n\\tlet mut loader = FsLoader::<IValue>::new(|s| serde_json::from_str(s));\\n\\n\\tloader.mount(iri!(\\\"https://w3c.github.io/json-ld-api\\\"), \\\"json-ld-api\\\");\\n\\n\\n\\n\\tlet input = task::block_on(loader.load(input_url)).unwrap();\\n\\n\\tlet expected_output = task::block_on(loader.load(output_url)).unwrap();\\n\\n\\tlet base_json_context = base_json_context(base_url);\\n\\n\\tlet mut input_context: ProcessedOwned<IValue, context::Json<IValue, IriBuf>> =\\n\\n\\t\\tProcessedOwned::new(base_json_context, context::Json::new(Some(base_url)));\\n\\n\\n\\n\\tif let Some(context_url) = options.context {{\\n\\n\\t\\tlet local_context = task::block_on(loader.load_context(context_url))\\n\\n\\t\\t\\t.unwrap()\\n\\n\\t\\t\\t.into_context();\\n\\n\\t\\tinput_context = task::block_on(local_context.process_with(\\n\\n\\t\\t\\tinput_context.as_ref(),\\n\\n\\t\\t\\t&mut loader,\\n\\n\\t\\t\\tSome(base_url),\\n\\n\\t\\t\\toptions.into(),\\n\\n\\t\\t))\\n\",\n \"file_path\": \"tests/templates/compact-header.rs\",\n \"rank\": 68,\n \"score\": 81835.72533462285\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_0124() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/0124-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/0124-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/0124-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 69,\n \"score\": 65517.07672935798\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_0125() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/0125-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/0125-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/0125-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 70,\n \"score\": 65517.07672935798\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_0120() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/0120-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/0120-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/0120-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 71,\n \"score\": 65517.07672935798\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_0122() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/0122-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/0122-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/0122-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 72,\n \"score\": 65517.07672935798\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_0123() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/0123-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/0123-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/0123-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 73,\n \"score\": 65517.07672935798\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_e112() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/e112-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/e112-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/e112-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\\n// See w3c/json-ld-api#480\\n\\n// #[test]\\n\\n// fn custom_e122() {\\n\\n// \\tlet input_url = iri!(\\\"file://crate/tests/custom/e122-in.jsonld\\\");\\n\\n// \\tlet base_url = iri!(\\\"file://crate/tests/custom/e122-in.jsonld\\\");\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 74,\n \"score\": 64018.63726351402\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_e111() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/e111-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/e111-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/e111-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 75,\n \"score\": 64018.63726351402\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_c037() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/c037-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/c037-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/c037-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 76,\n \"score\": 64018.63726351402\n },\n {\n \"content\": \"#[test]\\n\\nfn custom_c038() {\\n\\n\\tlet input_url = iri!(\\\"file://crate/tests/custom/c038-in.jsonld\\\");\\n\\n\\tlet base_url = iri!(\\\"file://crate/tests/custom/c038-in.jsonld\\\");\\n\\n\\tlet output_url = iri!(\\\"file://crate/tests/custom/c038-out.jsonld\\\");\\n\\n\\tpositive_test(\\n\\n\\t\\tOptions {\\n\\n\\t\\t\\tprocessing_mode: ProcessingMode::JsonLd1_1,\\n\\n\\t\\t\\tcontext: None,\\n\\n\\t\\t},\\n\\n\\t\\tinput_url,\\n\\n\\t\\tbase_url,\\n\\n\\t\\toutput_url,\\n\\n\\t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/custom.rs\",\n \"rank\": 77,\n \"score\": 64018.63726351402\n },\n {\n \"content\": \"/// Default values for `document_relative` and `vocab` should be `false` and `true`.\\n\\nfn expand_iri<\\n\\n\\t'a,\\n\\n\\tJ: JsonContext,\\n\\n\\tT: Id + Send + Sync,\\n\\n\\tC: ContextMut<T> + Send + Sync,\\n\\n\\tL: Loader + Send + Sync,\\n\\n>(\\n\\n\\tactive_context: &'a mut C,\\n\\n\\tvalue: &str,\\n\\n\\tsource: Option<loader::Id>,\\n\\n\\tmetadata: &'a J::MetaData,\\n\\n\\tdocument_relative: bool,\\n\\n\\tvocab: bool,\\n\\n\\tlocal_context: &'a LocalContextObject<'a, J::Object>,\\n\\n\\tdefined: &'a mut HashMap<String, bool>,\\n\\n\\tremote_contexts: ProcessingStack,\\n\\n\\tloader: &'a mut L,\\n\\n\\toptions: ProcessingOptions,\\n\\n\\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\\n\\n) -> impl 'a + Send + Future<Output = Result<Term<T>, Error>>\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 78,\n \"score\": 62630.10074348562\n },\n {\n \"content\": \"// This function tries to follow the recommended context proessing algorithm.\\n\\n// See `https://www.w3.org/TR/json-ld11-api/#context-processing-algorithm`.\\n\\n//\\n\\n// The recommended default value for `remote_contexts` is the empty set,\\n\\n// `false` for `override_protected`, and `true` for `propagate`.\\n\\nfn process_context<\\n\\n\\t'a,\\n\\n\\tJ: JsonContext,\\n\\n\\tT: Id + Send + Sync,\\n\\n\\tC: ContextMut<T> + Send + Sync,\\n\\n\\tL: Loader + Send + Sync,\\n\\n>(\\n\\n\\tactive_context: &'a C,\\n\\n\\tlocal_context: &'a J,\\n\\n\\tmut remote_contexts: ProcessingStack,\\n\\n\\tloader: &'a mut L,\\n\\n\\tbase_url: Option<Iri>,\\n\\n\\tmut options: ProcessingOptions,\\n\\n\\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\\n\\n) -> BoxFuture<'a, Result<C, Loc<Error, J::MetaData>>>\\n\\nwhere\\n\\n\\tC::LocalContext: From<L::Output> + From<J>,\\n\\n\\tL::Output: Into<J>,\\n\\n{\\n\\n\\tlet source = loader.id_opt(base_url);\\n\",\n \"file_path\": \"src/context/processing.rs\",\n \"rank\": 79,\n \"score\": 62629.43209494069\n },\n {\n \"content\": \"fn compact_collection_with<\\n\\n\\t'a,\\n\\n\\tJ: 'a + JsonSrc,\\n\\n\\tK: JsonFrom<J>,\\n\\n\\tT: 'a + Sync + Send + Id,\\n\\n\\tO: 'a + Send + Iterator<Item = &'a Indexed<Object<J, T>>>,\\n\\n\\tC: ContextMut<T>,\\n\\n\\tL: Loader,\\n\\n\\tM: 'a,\\n\\n>(\\n\\n\\titems: O,\\n\\n\\tactive_context: Inversible<T, &'a C>,\\n\\n\\ttype_scoped_context: Inversible<T, &'a C>,\\n\\n\\tactive_property: Option<&'a str>,\\n\\n\\tloader: &'a mut L,\\n\\n\\toptions: Options,\\n\\n\\tmeta: M,\\n\\n) -> BoxFuture<'a, Result<K, Error>>\\n\\nwhere\\n\\n\\tC: Sync + Send,\\n\",\n \"file_path\": \"src/compaction/mod.rs\",\n \"rank\": 80,\n \"score\": 62625.85728322022\n },\n {\n \"content\": \"fn expand_node_entries<\\n\\n\\t'a,\\n\\n\\tJ: JsonExpand,\\n\\n\\tT: 'a + Id + Send + Sync,\\n\\n\\tC: ContextMut<T> + Send + Sync,\\n\\n\\tL: Loader + Send + Sync,\\n\\n>(\\n\\n\\tmut result: Indexed<Node<J, T>>,\\n\\n\\tmut has_value_object_entries: bool,\\n\\n\\tactive_context: &'a C,\\n\\n\\ttype_scoped_context: &'a C,\\n\\n\\tactive_property: ActiveProperty<'a, J>,\\n\\n\\texpanded_entries: Vec<ExpandedEntry<'a, J, Term<T>>>,\\n\\n\\tbase_url: Option<Iri<'a>>,\\n\\n\\tloader: &'a mut L,\\n\\n\\toptions: Options,\\n\\n\\twarnings: &'a mut Vec<Loc<Warning, J::MetaData>>,\\n\\n) -> BoxFuture<'a, NodeEntriesExpensionResult<J, T>>\\n\\nwhere\\n\\n\\tC::LocalContext: From<L::Output> + From<J> + Send + Sync,\\n\",\n \"file_path\": \"src/expansion/node.rs\",\n \"rank\": 81,\n \"score\": 61327.94182765542\n },\n {\n \"content\": \"struct InverseContainer<T: Id> {\\n\\n\\tlanguage: InverseLang,\\n\\n\\ttyp: InverseType<T>,\\n\\n\\tany: Any,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/context/inverse.rs\",\n \"rank\": 82,\n \"score\": 60469.75033752795\n },\n {\n \"content\": \"use crate::loader;\\n\\nuse std::ops::{Deref, DerefMut};\\n\\n\\n\\n/// Value located behind an IRI reference.\\n\\n#[derive(Clone, Copy, Debug)]\\n\\npub struct Loc<T, M> {\\n\\n\\t/// The value.\\n\\n\\tvalue: T,\\n\\n\\n\\n\\t/// Source document.\\n\\n\\tsource: Option<loader::Id>,\\n\\n\\n\\n\\t/// Metadata.\\n\\n\\tmetadata: M,\\n\\n}\\n\\n\\n\\nimpl<T, M> Loc<T, M> {\\n\\n\\t/// Creates a new value from the given `source` attached to the given `metadata`.\\n\\n\\tpub fn new(value: T, source: Option<loader::Id>, metadata: M) -> Self {\\n\\n\\t\\tSelf {\\n\",\n \"file_path\": \"src/loc.rs\",\n \"rank\": 83,\n \"score\": 43091.23070244042\n },\n {\n \"content\": \"\\t\\t\\tvalue,\\n\\n\\t\\t\\tsource,\\n\\n\\t\\t\\tmetadata,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tpub fn value(&self) -> &T {\\n\\n\\t\\t&self.value\\n\\n\\t}\\n\\n\\n\\n\\tpub fn source(&self) -> Option<loader::Id> {\\n\\n\\t\\tself.source\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns a reference to the metadata associated to this value.\\n\\n\\tpub fn metadata(&self) -> &M {\\n\\n\\t\\t&self.metadata\\n\\n\\t}\\n\\n\\n\\n\\tpub fn into_parts(self) -> (T, Option<loader::Id>, M) {\\n\",\n \"file_path\": \"src/loc.rs\",\n \"rank\": 84,\n \"score\": 43075.87312154348\n },\n {\n \"content\": \"\\t\\tF: FnOnce(M) -> N,\\n\\n\\t{\\n\\n\\t\\tLoc::new(self.value, self.source, f(self.metadata))\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T, M> Deref for Loc<T, M> {\\n\\n\\ttype Target = T;\\n\\n\\n\\n\\tfn deref(&self) -> &T {\\n\\n\\t\\t&self.value\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T, M> DerefMut for Loc<T, M> {\\n\\n\\tfn deref_mut(&mut self) -> &mut T {\\n\\n\\t\\t&mut self.value\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/loc.rs\",\n \"rank\": 85,\n \"score\": 43066.482676149906\n },\n {\n \"content\": \"\\t\\t(self.value, self.source, self.metadata)\\n\\n\\t}\\n\\n\\n\\n\\tpub fn unwrap(self) -> T {\\n\\n\\t\\tself.value\\n\\n\\t}\\n\\n\\n\\n\\tpub fn cast_metadata<N>(self) -> Loc<T, N>\\n\\n\\twhere\\n\\n\\t\\tN: From<M>,\\n\\n\\t{\\n\\n\\t\\tLoc::new(self.value, self.source, self.metadata.into())\\n\\n\\t}\\n\\n\\n\\n\\tpub fn with_metadata<N>(self, metadata: N) -> Loc<T, N> {\\n\\n\\t\\tLoc::new(self.value, self.source, metadata)\\n\\n\\t}\\n\\n\\n\\n\\tpub fn map_metadata<N, F>(self, f: F) -> Loc<T, N>\\n\\n\\twhere\\n\",\n \"file_path\": \"src/loc.rs\",\n \"rank\": 86,\n \"score\": 43062.931528317495\n },\n {\n \"content\": \"impl<T, M> AsRef<T> for Loc<T, M> {\\n\\n\\tfn as_ref(&self) -> &T {\\n\\n\\t\\t&self.value\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T, M> AsMut<T> for Loc<T, M> {\\n\\n\\tfn as_mut(&mut self) -> &mut T {\\n\\n\\t\\t&mut self.value\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/loc.rs\",\n \"rank\": 87,\n \"score\": 43062.28078671656\n },\n {\n \"content\": \"impl<J: JsonClone, K: JsonFrom<J>, T: AsJson<J, K>> AsJson<J, K> for Indexed<T> {\\n\\n\\tfn as_json_with(&self, meta: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData) -> K {\\n\\n\\t\\tlet mut json = self.value.as_json_with(meta.clone());\\n\\n\\n\\n\\t\\tif let Some(obj) = json.as_object_mut() {\\n\\n\\t\\t\\tif let Some(index) = &self.index {\\n\\n\\t\\t\\t\\tobj.insert(\\n\\n\\t\\t\\t\\t\\tK::new_key(Keyword::Index.into_str(), meta(None)),\\n\\n\\t\\t\\t\\t\\tindex.as_json_with(meta(None)),\\n\\n\\t\\t\\t\\t);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tjson\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 88,\n \"score\": 43044.23284679195\n },\n {\n \"content\": \"\\n\\n\\t#[inline]\\n\\n\\tfn try_from(term: Term<T>) -> Result<Reference<T>, Term<T>> {\\n\\n\\t\\tmatch term {\\n\\n\\t\\t\\tTerm::Ref(prop) => Ok(prop),\\n\\n\\t\\t\\tterm => Err(term),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: AsIri> From<BlankId> for Reference<T> {\\n\\n\\t#[inline(always)]\\n\\n\\tfn from(blank: BlankId) -> Reference<T> {\\n\\n\\t\\tReference::Blank(blank)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<J: JsonClone, K: util::JsonFrom<J>, T: Id> util::AsJson<J, K> for Reference<T> {\\n\\n\\t#[inline]\\n\\n\\tfn as_json_with(&self, meta: impl Clone + Fn(Option<&J::MetaData>) -> K::MetaData) -> K {\\n\",\n \"file_path\": \"src/reference.rs\",\n \"rank\": 89,\n \"score\": 43034.452957026595\n },\n {\n \"content\": \"use crate::{\\n\\n\\tsyntax::Keyword,\\n\\n\\tutil::{AsAnyJson, AsJson, JsonFrom},\\n\\n};\\n\\nuse generic_json::JsonClone;\\n\\nuse std::convert::{TryFrom, TryInto};\\n\\nuse std::hash::{Hash, Hasher};\\n\\nuse std::ops::{Deref, DerefMut};\\n\\n\\n\\n/// Indexed objects.\\n\\n///\\n\\n/// Nodes and value objects may be indexed by a string in JSON-LD.\\n\\n/// This type is a wrapper around any kind of indexable data.\\n\\n///\\n\\n/// It is a pointer type that `Deref` into the underlying value.\\n\\npub struct Indexed<T> {\\n\\n\\t/// Index.\\n\\n\\tindex: Option<String>,\\n\\n\\n\\n\\t/// Value.\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 90,\n \"score\": 43031.36486732287\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\t/// Get the index, if any.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn index(&self) -> Option<&str> {\\n\\n\\t\\tmatch &self.index {\\n\\n\\t\\t\\tSome(index) => Some(index.as_str()),\\n\\n\\t\\t\\tNone => None,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t/// Set the value index.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn set_index(&mut self, index: Option<String>) {\\n\\n\\t\\tself.index = index\\n\\n\\t}\\n\\n\\n\\n\\t/// Turn this indexed value into its components: inner value and index.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn into_parts(self) -> (T, Option<String>) {\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 91,\n \"score\": 43027.982444060406\n },\n {\n \"content\": \"\\t\\t(self.value, self.index)\\n\\n\\t}\\n\\n\\n\\n\\t/// Cast the inner value.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn cast<U: From<T>>(self) -> Indexed<U> {\\n\\n\\t\\tIndexed::new(self.value.into(), self.index)\\n\\n\\t}\\n\\n\\n\\n\\t/// Try to cast the inner value.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn try_cast<U: TryFrom<T>>(self) -> Result<Indexed<U>, Indexed<U::Error>> {\\n\\n\\t\\tmatch self.value.try_into() {\\n\\n\\t\\t\\tOk(value) => Ok(Indexed::new(value, self.index)),\\n\\n\\t\\t\\tErr(e) => Err(Indexed::new(e, self.index)),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: Hash> Hash for Indexed<T> {\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 92,\n \"score\": 43021.31904785937\n },\n {\n \"content\": \"\\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tReference::Id(id) => write!(f, \\\"Reference::Id({})\\\", id.as_iri()),\\n\\n\\t\\t\\tReference::Blank(b) => write!(f, \\\"Reference::Blank({})\\\", b),\\n\\n\\t\\t\\tReference::Invalid(id) => write!(f, \\\"Reference::Invalid({})\\\", id),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n/// Types that can be converted into a borrowed node reference.\\n\\n///\\n\\n/// This is a convenient trait is used to simplify the use of references.\\n\\n/// For instance consider the [`Node::get`](crate::Node::get) method, used to get the objects associated to the\\n\\n/// given reference property for a given node.\\n\\n/// It essentially have the following signature:\\n\\n/// ```ignore\\n\\n/// fn get(&self, id: &Reference<T>) -> Objects;\\n\\n/// ```\\n\\n/// However building a `Reference` by hand can be tedious, especially while using [`Lexicon`](crate::Lexicon) and\\n\\n/// [`Vocab`](crate::Vocab). It can be as verbose as `node.get(&Reference::Id(Lexicon::Id(MyVocab::Term)))`.\\n\\n/// Thanks to `ToReference` which is implemented by `Lexicon<V>` for any type `V` implementing `Vocab`,\\n\\n/// it is simplified into `node.get(MyVocab::Term)` (while the first syntax remains correct).\\n\\n/// The signature of `get` becomes:\\n\\n/// ```ignore\\n\\n/// fn get<R: ToReference<T>>(&self, id: R) -> Objects;\\n\\n/// ```\\n\",\n \"file_path\": \"src/reference.rs\",\n \"rank\": 93,\n \"score\": 43020.72427231729\n },\n {\n \"content\": \"\\t\\tmatch self {\\n\\n\\t\\t\\tReference::Id(id) => id.as_json(meta(None)),\\n\\n\\t\\t\\tReference::Blank(b) => b.as_json_with(meta(None)),\\n\\n\\t\\t\\tReference::Invalid(id) => id.as_json_with(meta(None)),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: AsIri> fmt::Display for Reference<T> {\\n\\n\\t#[inline]\\n\\n\\tfn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tReference::Id(id) => id.as_iri().fmt(f),\\n\\n\\t\\t\\tReference::Blank(b) => b.fmt(f),\\n\\n\\t\\t\\tReference::Invalid(id) => id.fmt(f),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: AsIri> fmt::Debug for Reference<T> {\\n\",\n \"file_path\": \"src/reference.rs\",\n \"rank\": 94,\n \"score\": 43019.389676637285\n },\n {\n \"content\": \"use crate::{\\n\\n\\tsyntax::{Term, TermLike},\\n\\n\\tutil::{self, AsAnyJson},\\n\\n\\tBlankId, Id,\\n\\n};\\n\\nuse generic_json::JsonClone;\\n\\nuse iref::{AsIri, Iri, IriBuf};\\n\\nuse std::borrow::Borrow;\\n\\nuse std::convert::TryFrom;\\n\\nuse std::fmt;\\n\\n\\n\\n/// Node reference.\\n\\n///\\n\\n/// Used to reference a node across a document or to a remote document.\\n\\n/// It can be an identifier (IRI), a blank node identifier for local blank nodes\\n\\n/// or an invalid reference (a string that is neither an IRI nor blank node identifier).\\n\\n#[derive(Clone, PartialEq, Eq, Hash)]\\n\\npub enum Reference<T: AsIri = IriBuf> {\\n\\n\\t/// Node identifier, essentially an IRI.\\n\\n\\tId(T),\\n\",\n \"file_path\": \"src/reference.rs\",\n \"rank\": 95,\n \"score\": 43019.35212517835\n },\n {\n \"content\": \"\\tvalue: T,\\n\\n}\\n\\n\\n\\nimpl<T> Indexed<T> {\\n\\n\\t/// Create a new (maybe) indexed value.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn new(value: T, index: Option<String>) -> Indexed<T> {\\n\\n\\t\\tIndexed { value, index }\\n\\n\\t}\\n\\n\\n\\n\\t/// Get a reference to the inner value.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn inner(&self) -> &T {\\n\\n\\t\\t&self.value\\n\\n\\t}\\n\\n\\n\\n\\t/// Drop the index and return the underlying value.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn into_inner(self) -> T {\\n\\n\\t\\tself.value\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 96,\n \"score\": 43018.92421824805\n },\n {\n \"content\": \"\\t#[inline(always)]\\n\\n\\tfn hash<H: Hasher>(&self, h: &mut H) {\\n\\n\\t\\tself.value.hash(h);\\n\\n\\t\\tself.index.hash(h)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: PartialEq> PartialEq for Indexed<T> {\\n\\n\\t#[inline(always)]\\n\\n\\tfn eq(&self, other: &Self) -> bool {\\n\\n\\t\\tself.index == other.index && self.value == other.value\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T: Eq> Eq for Indexed<T> {}\\n\\n\\n\\nimpl<T: Clone> Clone for Indexed<T> {\\n\\n\\t#[inline(always)]\\n\\n\\tfn clone(&self) -> Self {\\n\\n\\t\\tIndexed::new(self.value.clone(), self.index.clone())\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 97,\n \"score\": 43015.16186052932\n },\n {\n \"content\": \"\\t/// This will either return a string slice of an IRI, or a blank node identifier.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn as_str(&self) -> &str {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tReference::Id(id) => id.as_iri().into_str(),\\n\\n\\t\\t\\tReference::Blank(id) => id.as_str(),\\n\\n\\t\\t\\tReference::Invalid(id) => id.as_str(),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t/// If the renference is a node identifier, returns the node IRI.\\n\\n\\t///\\n\\n\\t/// Returns `None` if it is a blank node reference.\\n\\n\\t#[inline(always)]\\n\\n\\tpub fn as_iri(&self) -> Option<Iri> {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tReference::Id(k) => Some(k.as_iri()),\\n\\n\\t\\t\\t_ => None,\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"src/reference.rs\",\n \"rank\": 98,\n \"score\": 43014.94099667911\n },\n {\n \"content\": \"\\t}\\n\\n}\\n\\n\\n\\nimpl<T> From<T> for Indexed<T> {\\n\\n\\t#[inline(always)]\\n\\n\\tfn from(value: T) -> Indexed<T> {\\n\\n\\t\\tIndexed::new(value, None)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T> Deref for Indexed<T> {\\n\\n\\ttype Target = T;\\n\\n\\n\\n\\t#[inline(always)]\\n\\n\\tfn deref(&self) -> &T {\\n\\n\\t\\t&self.value\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<T> DerefMut for Indexed<T> {\\n\",\n \"file_path\": \"src/indexed.rs\",\n \"rank\": 99,\n \"score\": 43013.79078321117\n }\n]","isConversational":false}}},{"rowIdx":1176,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"whisper/src/aggregation.rs"},"repo_name":{"kind":"string","value":"GiantPlantsSociety/graphite-rs"},"commit":{"kind":"string","value":"d2657ae3ddf110023417ec255f5192ac8fa83bfc"},"file_code":{"kind":"string","value":"use serde::*;\nuse std::cmp;\nuse std::convert::Into;\nuse std::fmt;\nuse std::str::FromStr;\n\n#[allow(clippy::trivially_copy_pass_by_ref)]\nfn cmp_f64(a: &f64, b: &f64) -> cmp::Ordering {\n a.partial_cmp(b).unwrap_or(::std::cmp::Ordering::Equal)\n}\n\n#[allow(clippy::trivially_copy_pass_by_ref)]\nfn cmp_f64_abs(a: &f64, b: &f64) -> cmp::Ordering {\n cmp_f64(&a.abs(), &b.abs())\n}\n\n#[derive(Clone, Copy, Debug, PartialEq, Deserialize)]\n#[serde(rename_all = \"lowercase\")]\npub enum AggregationMethod {\n Average,\n Sum,\n Last,\n Max,\n Min,\n AvgZero,\n AbsMax,\n AbsMin,\n}\n\nimpl AggregationMethod {\n pub fn from_type(aggregation_type: u32) -> Option<Self> {\n match aggregation_type {\n 1 => Some(AggregationMethod::Average),\n 2 => Some(AggregationMethod::Sum),\n 3 => Some(AggregationMethod::Last),\n 4 => Some(AggregationMethod::Max),\n 5 => Some(AggregationMethod::Min),\n 6 => Some(AggregationMethod::AvgZero),\n 7 => Some(AggregationMethod::AbsMax),\n 8 => Some(AggregationMethod::AbsMin),\n _ => None,\n }\n }\n\n pub fn to_type(self) -> u32 {\n match self {\n AggregationMethod::Average => 1,\n AggregationMethod::Sum => 2,\n AggregationMethod::Last => 3,\n AggregationMethod::Max => 4,\n AggregationMethod::Min => 5,\n AggregationMethod::AvgZero => 6,\n AggregationMethod::AbsMax => 7,\n AggregationMethod::AbsMin => 8,\n }\n }\n\n pub fn aggregate(self, values: &[Option<f64>]) -> Result<f64, &'static str> {\n match self {\n AggregationMethod::Average => {\n let sum: f64 = values.iter().filter_map(|v| *v).sum();\n let count = values.iter().filter_map(|v| *v).count();\n Ok(sum / count as f64)\n }\n AggregationMethod::Sum => {\n let sum: f64 = values.iter().filter_map(|v| *v).sum();\n Ok(sum)\n }\n AggregationMethod::Last => {\n if let Some(Some(v)) = values.iter().rev().find(|v| v.is_some()) {\n Ok(*v)\n } else {\n Err(\"Empty list of values\")\n }\n }\n AggregationMethod::Max => values\n .iter()\n .filter_map(|v| *v)\n .max_by(cmp_f64)\n .ok_or(\"Empty list of values\"),\n AggregationMethod::Min => values\n .iter()\n .filter_map(|v| *v)\n .min_by(cmp_f64)\n .ok_or(\"Empty list of values\"),\n AggregationMethod::AvgZero => {\n let sum: f64 = values.iter().filter_map(|v| *v).sum();\n let len = values.len();\n Ok(sum / len as f64)\n }\n AggregationMethod::AbsMax => values\n .iter()\n .filter_map(|v| *v)\n .max_by(cmp_f64_abs)\n .ok_or(\"Empty list of values\"),\n AggregationMethod::AbsMin => values\n .iter()\n .filter_map(|v| *v)\n .min_by(cmp_f64_abs)\n .ok_or(\"Empty list of values\"),\n }\n }\n}\n\nimpl ::std::default::Default for AggregationMethod {\n fn default() -> Self {\n AggregationMethod::Average\n }\n}\n\nimpl FromStr for AggregationMethod {\n type Err = String;\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n match s {\n \"average\" => Ok(AggregationMethod::Average),\n \"sum\" => Ok(AggregationMethod::Sum),\n \"last\" => Ok(AggregationMethod::Last),\n \"max\" => Ok(AggregationMethod::Max),\n \"min\" => Ok(AggregationMethod::Min),\n \"avg_zero\" => Ok(AggregationMethod::AvgZero),\n \"absmax\" => Ok(AggregationMethod::AbsMax),\n \"absmin\" => Ok(AggregationMethod::AbsMin),\n _ => Err(format!(\"Unsupported aggregation method '{}'.\", s)),\n }\n }\n}\n\nimpl Into<&'static str> for AggregationMethod {\n fn into(self) -> &'static str {\n match self {\n AggregationMethod::Average => \"average\",\n AggregationMethod::Sum => \"sum\",\n AggregationMethod::Last => \"last\",\n AggregationMethod::Max => \"max\",\n AggregationMethod::Min => \"min\",\n AggregationMethod::AvgZero => \"avg_zero\",\n AggregationMethod::AbsMax => \"absmax\",\n AggregationMethod::AbsMin => \"absmin\",\n }\n }\n}\n\nimpl fmt::Display for AggregationMethod {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n let s: &str = (*self).into();\n write!(f, \"{}\", s)\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_display() {\n assert_eq!(AggregationMethod::Average.to_string(), \"average\");\n assert_eq!(AggregationMethod::Sum.to_string(), \"sum\");\n assert_eq!(AggregationMethod::Last.to_string(), \"last\");\n assert_eq!(AggregationMethod::Max.to_string(), \"max\");\n assert_eq!(AggregationMethod::Min.to_string(), \"min\");\n assert_eq!(AggregationMethod::AvgZero.to_string(), \"avg_zero\");\n assert_eq!(AggregationMethod::AbsMax.to_string(), \"absmax\");\n assert_eq!(AggregationMethod::AbsMin.to_string(), \"absmin\");\n\n assert_eq!(AggregationMethod::default().to_string(), \"average\");\n }\n\n #[test]\n fn test_convert() {\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Average.to_string()),\n Ok(AggregationMethod::Average)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Sum.to_string()),\n Ok(AggregationMethod::Sum)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Last.to_string()),\n Ok(AggregationMethod::Last)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Max.to_string()),\n Ok(AggregationMethod::Max)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Min.to_string()),\n Ok(AggregationMethod::Min)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::AvgZero.to_string()),\n Ok(AggregationMethod::AvgZero)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::AbsMax.to_string()),\n Ok(AggregationMethod::AbsMax)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::AbsMin.to_string()),\n Ok(AggregationMethod::AbsMin)\n );\n\n assert!(AggregationMethod::from_str(\"test\").is_err());\n }\n\n #[test]\n fn test_aggregate() {\n assert_eq!(\n AggregationMethod::Average.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(2.5)\n );\n assert_eq!(\n AggregationMethod::Min.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(1.0)\n );\n assert_eq!(\n AggregationMethod::Max.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(4.0)\n );\n assert_eq!(\n AggregationMethod::Last.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(4.0)\n );\n assert_eq!(\n AggregationMethod::Last.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n Some(4.0),\n None\n ]),\n Ok(4.0)\n );\n assert_eq!(\n AggregationMethod::Sum.aggregate(&[\n Some(10.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(19.0)\n );\n assert_eq!(\n AggregationMethod::AvgZero.aggregate(&[\n Some(1.0),\n Some(2.0),\n Some(3.0),\n Some(4.0),\n None,\n None,\n None,\n None\n ]),\n Ok(1.25)\n );\n assert_eq!(\n AggregationMethod::AbsMax.aggregate(&[Some(-3.0), Some(-2.0), Some(1.0), Some(2.0)]),\n Ok(-3.0)\n );\n assert_eq!(\n AggregationMethod::AbsMax.aggregate(&[Some(-2.0), Some(-1.0), Some(2.0), Some(3.0)]),\n Ok(3.0)\n );\n assert_eq!(\n AggregationMethod::AbsMin.aggregate(&[Some(-3.0), Some(-2.0), Some(1.0), Some(2.0)]),\n Ok(1.0)\n );\n assert_eq!(\n AggregationMethod::AbsMin.aggregate(&[Some(-2.0), Some(-1.0), Some(2.0), Some(3.0)]),\n Ok(-1.0)\n );\n\n assert!(AggregationMethod::Last.aggregate(&[]).is_err());\n }\n\n #[test]\n fn test_from_to_type() {\n for i in 1..9 {\n let method = AggregationMethod::from_type(i).unwrap();\n assert_eq!(AggregationMethod::to_type(method), i);\n }\n\n assert_eq!(AggregationMethod::from_type(9), None);\n }\n}\n"},"prefix":{"kind":"string","value":"use serde::*;\nuse std::cmp;\nuse std::convert::Into;\nuse std::fmt;\nuse std::str::FromStr;\n\n#[allow(clippy::trivially_copy_pass_by_ref)]\nfn cmp_f64(a: &f64, b: &f64) -> cmp::Ordering {\n a.partial_cmp(b).unwrap_or(::std::cmp::Ordering::Equal)\n}\n\n#[allow(clippy::trivially_copy_pass_by_ref)]\nfn cmp_f64_abs(a: &f64, b: &f64) -> cmp::Ordering {\n cmp_f64(&a.abs(), &b.abs())\n}\n\n#[derive(Clone, Copy, Debug, PartialEq, Deserialize)]\n#[serde(rename_all = \"lowercase\")]\npub enum AggregationMethod {\n Average,\n Sum,\n"},"suffix":{"kind":"string","value":" }\n }\n\n pub fn aggregate(self, values: &[Option<f64>]) -> Result<f64, &'static str> {\n match self {\n AggregationMethod::Average => {\n let sum: f64 = values.iter().filter_map(|v| *v).sum();\n let count = values.iter().filter_map(|v| *v).count();\n Ok(sum / count as f64)\n }\n AggregationMethod::Sum => {\n let sum: f64 = values.iter().filter_map(|v| *v).sum();\n Ok(sum)\n }\n AggregationMethod::Last => {\n if let Some(Some(v)) = values.iter().rev().find(|v| v.is_some()) {\n Ok(*v)\n } else {\n Err(\"Empty list of values\")\n }\n }\n AggregationMethod::Max => values\n .iter()\n .filter_map(|v| *v)\n .max_by(cmp_f64)\n .ok_or(\"Empty list of values\"),\n AggregationMethod::Min => values\n .iter()\n .filter_map(|v| *v)\n .min_by(cmp_f64)\n .ok_or(\"Empty list of values\"),\n AggregationMethod::AvgZero => {\n let sum: f64 = values.iter().filter_map(|v| *v).sum();\n let len = values.len();\n Ok(sum / len as f64)\n }\n AggregationMethod::AbsMax => values\n .iter()\n .filter_map(|v| *v)\n .max_by(cmp_f64_abs)\n .ok_or(\"Empty list of values\"),\n AggregationMethod::AbsMin => values\n .iter()\n .filter_map(|v| *v)\n .min_by(cmp_f64_abs)\n .ok_or(\"Empty list of values\"),\n }\n }\n}\n\nimpl ::std::default::Default for AggregationMethod {\n fn default() -> Self {\n AggregationMethod::Average\n }\n}\n\nimpl FromStr for AggregationMethod {\n type Err = String;\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n match s {\n \"average\" => Ok(AggregationMethod::Average),\n \"sum\" => Ok(AggregationMethod::Sum),\n \"last\" => Ok(AggregationMethod::Last),\n \"max\" => Ok(AggregationMethod::Max),\n \"min\" => Ok(AggregationMethod::Min),\n \"avg_zero\" => Ok(AggregationMethod::AvgZero),\n \"absmax\" => Ok(AggregationMethod::AbsMax),\n \"absmin\" => Ok(AggregationMethod::AbsMin),\n _ => Err(format!(\"Unsupported aggregation method '{}'.\", s)),\n }\n }\n}\n\nimpl Into<&'static str> for AggregationMethod {\n fn into(self) -> &'static str {\n match self {\n AggregationMethod::Average => \"average\",\n AggregationMethod::Sum => \"sum\",\n AggregationMethod::Last => \"last\",\n AggregationMethod::Max => \"max\",\n AggregationMethod::Min => \"min\",\n AggregationMethod::AvgZero => \"avg_zero\",\n AggregationMethod::AbsMax => \"absmax\",\n AggregationMethod::AbsMin => \"absmin\",\n }\n }\n}\n\nimpl fmt::Display for AggregationMethod {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n let s: &str = (*self).into();\n write!(f, \"{}\", s)\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_display() {\n assert_eq!(AggregationMethod::Average.to_string(), \"average\");\n assert_eq!(AggregationMethod::Sum.to_string(), \"sum\");\n assert_eq!(AggregationMethod::Last.to_string(), \"last\");\n assert_eq!(AggregationMethod::Max.to_string(), \"max\");\n assert_eq!(AggregationMethod::Min.to_string(), \"min\");\n assert_eq!(AggregationMethod::AvgZero.to_string(), \"avg_zero\");\n assert_eq!(AggregationMethod::AbsMax.to_string(), \"absmax\");\n assert_eq!(AggregationMethod::AbsMin.to_string(), \"absmin\");\n\n assert_eq!(AggregationMethod::default().to_string(), \"average\");\n }\n\n #[test]\n fn test_convert() {\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Average.to_string()),\n Ok(AggregationMethod::Average)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Sum.to_string()),\n Ok(AggregationMethod::Sum)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Last.to_string()),\n Ok(AggregationMethod::Last)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Max.to_string()),\n Ok(AggregationMethod::Max)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::Min.to_string()),\n Ok(AggregationMethod::Min)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::AvgZero.to_string()),\n Ok(AggregationMethod::AvgZero)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::AbsMax.to_string()),\n Ok(AggregationMethod::AbsMax)\n );\n assert_eq!(\n AggregationMethod::from_str(&AggregationMethod::AbsMin.to_string()),\n Ok(AggregationMethod::AbsMin)\n );\n\n assert!(AggregationMethod::from_str(\"test\").is_err());\n }\n\n #[test]\n fn test_aggregate() {\n assert_eq!(\n AggregationMethod::Average.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(2.5)\n );\n assert_eq!(\n AggregationMethod::Min.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(1.0)\n );\n assert_eq!(\n AggregationMethod::Max.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(4.0)\n );\n assert_eq!(\n AggregationMethod::Last.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(4.0)\n );\n assert_eq!(\n AggregationMethod::Last.aggregate(&[\n Some(1.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n Some(4.0),\n None\n ]),\n Ok(4.0)\n );\n assert_eq!(\n AggregationMethod::Sum.aggregate(&[\n Some(10.0),\n None,\n Some(2.0),\n None,\n Some(3.0),\n None,\n None,\n Some(4.0)\n ]),\n Ok(19.0)\n );\n assert_eq!(\n AggregationMethod::AvgZero.aggregate(&[\n Some(1.0),\n Some(2.0),\n Some(3.0),\n Some(4.0),\n None,\n None,\n None,\n None\n ]),\n Ok(1.25)\n );\n assert_eq!(\n AggregationMethod::AbsMax.aggregate(&[Some(-3.0), Some(-2.0), Some(1.0), Some(2.0)]),\n Ok(-3.0)\n );\n assert_eq!(\n AggregationMethod::AbsMax.aggregate(&[Some(-2.0), Some(-1.0), Some(2.0), Some(3.0)]),\n Ok(3.0)\n );\n assert_eq!(\n AggregationMethod::AbsMin.aggregate(&[Some(-3.0), Some(-2.0), Some(1.0), Some(2.0)]),\n Ok(1.0)\n );\n assert_eq!(\n AggregationMethod::AbsMin.aggregate(&[Some(-2.0), Some(-1.0), Some(2.0), Some(3.0)]),\n Ok(-1.0)\n );\n\n assert!(AggregationMethod::Last.aggregate(&[]).is_err());\n }\n\n #[test]\n fn test_from_to_type() {\n for i in 1..9 {\n let method = AggregationMethod::from_type(i).unwrap();\n assert_eq!(AggregationMethod::to_type(method), i);\n }\n\n assert_eq!(AggregationMethod::from_type(9), None);\n }\n}\n"},"middle":{"kind":"string","value":" Last,\n Max,\n Min,\n AvgZero,\n AbsMax,\n AbsMin,\n}\n\nimpl AggregationMethod {\n pub fn from_type(aggregation_type: u32) -> Option<Self> {\n match aggregation_type {\n 1 => Some(AggregationMethod::Average),\n 2 => Some(AggregationMethod::Sum),\n 3 => Some(AggregationMethod::Last),\n 4 => Some(AggregationMethod::Max),\n 5 => Some(AggregationMethod::Min),\n 6 => Some(AggregationMethod::AvgZero),\n 7 => Some(AggregationMethod::AbsMax),\n 8 => Some(AggregationMethod::AbsMin),\n _ => None,\n }\n }\n\n pub fn to_type(self) -> u32 {\n match self {\n AggregationMethod::Average => 1,\n AggregationMethod::Sum => 2,\n AggregationMethod::Last => 3,\n AggregationMethod::Max => 4,\n AggregationMethod::Min => 5,\n AggregationMethod::AvgZero => 6,\n AggregationMethod::AbsMax => 7,\n AggregationMethod::AbsMin => 8,\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn diff(\n\n path1: &Path,\n\n path2: &Path,\n\n ignore_empty: bool,\n\n mut until_time: u32,\n\n now: u32,\n\n) -> Result<Vec<DiffArchive>, io::Error> {\n\n let mut file1 = WhisperFile::open(path1)?;\n\n let mut file2 = WhisperFile::open(path2)?;\n\n\n\n if file1.info().archives != file2.info().archives {\n\n return Err(io::Error::new(\n\n io::ErrorKind::Other,\n\n \"Archive configurations are unalike. Resize the input before diffing\",\n\n ));\n\n }\n\n\n\n let mut archives = file1.info().archives.clone();\n\n archives.sort_by_key(|a| a.retention());\n\n\n","file_path":"whisper/src/diff.rs","rank":2,"score":114835.86518919212},{"content":"pub fn fetch(\n\n filename: &Path,\n\n aggregation: AggregationMethod,\n\n resolution: Option<u32>,\n\n start: u64,\n\n end: u64,\n\n) -> Result<Data, Error> {\n\n let c_filename = CString::new(filename.to_str().unwrap().as_bytes()).unwrap();\n\n let c_aggregation =\n\n CString::new(str::to_ascii_uppercase(aggregation.into()).as_bytes()).unwrap();\n\n\n\n let mut start = start as c_long;\n\n let mut end = end as c_long;\n\n let mut step = u64::from(resolution.unwrap_or(1)) as c_ulong;\n\n let mut ds_cnt = 0;\n\n let mut ds_namv = ptr::null_mut();\n\n let mut data = ptr::null_mut();\n\n let status = unsafe {\n\n rrd_fetch_r(\n\n c_filename.as_ptr(),\n","file_path":"rrd/src/lib.rs","rank":3,"score":114835.86518919212},{"content":"pub fn merge(\n\n path_src: &Path,\n\n path_dst: &Path,\n\n time_from: u32,\n\n time_to: u32,\n\n now: u32,\n\n) -> Result<(), io::Error> {\n\n // if now is None:\n\n // now = int(time.time())\n\n\n\n // if (time_to is not None):\n\n // untilTime = time_to\n\n // else:\n\n // untilTime = now\n\n\n\n // if (time_from is not None):\n\n // fromTime = time_from\n\n // else:\n\n // fromTime = 0\n\n\n","file_path":"whisper/src/merge.rs","rank":4,"score":114835.86518919212},{"content":"#[allow(clippy::too_many_arguments)]\n\npub fn resize(\n\n path_src: &Path,\n\n path_new: Option<&Path>,\n\n retentions: &[Retention],\n\n x_files_factor: f32,\n\n aggregation_method: AggregationMethod,\n\n aggregate: bool,\n\n nobackup: bool,\n\n now: u32,\n\n) -> Result<(), Error> {\n\n let path_dst = match path_new {\n\n None => {\n\n let tmpfile = PathBuf::from(format!(\"{}.tmp\", path_src.display()));\n\n if tmpfile.is_file() {\n\n println!(\n\n \"Removing previous temporary database file: {}\",\n\n tmpfile.display()\n\n );\n\n remove_file(&tmpfile)?;\n\n }\n","file_path":"whisper/src/resize.rs","rank":5,"score":114835.86518919212},{"content":"pub fn copy_test_file(temp_dir: &TempDir, filename: &str) -> PathBuf {\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n let tmp_file_path = temp_dir.path().join(filename);\n\n\n\n fs::copy(&file_path, &tmp_file_path).unwrap();\n\n\n\n tmp_file_path\n\n}\n\n\n","file_path":"whisper_tests/src/lib.rs","rank":6,"score":109909.69735819429},{"content":"pub fn create_and_update_points(\n\n path: &PathBuf,\n\n points: &[Point],\n\n now: u32,\n\n) -> Result<WhisperFile, Box<dyn Error>> {\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 60,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n file.update_many(&points, now)?;\n\n\n\n Ok(file)\n\n}\n","file_path":"whisper_tests/src/lib.rs","rank":7,"score":107820.42367963331},{"content":"pub fn create_and_update_many(\n\n path: &PathBuf,\n\n timestamps: &[u32],\n\n now: u32,\n\n) -> Result<WhisperFile, Box<dyn Error>> {\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 60,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n let points: Vec<Point> = timestamps\n\n .iter()\n\n .map(|interval| Point {\n\n interval: *interval,\n\n value: rand::random(),\n\n })\n\n .collect();\n\n\n\n file.update_many(&points, now)?;\n\n\n\n Ok(file)\n\n}\n\n\n","file_path":"whisper_tests/src/lib.rs","rank":8,"score":107820.42367963331},{"content":"pub fn de_time_parse<'de, D>(deserializer: D) -> Result<u32, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n time_parse(String::deserialize(deserializer)?).map_err(serde::de::Error::custom)\n\n}\n\n\n","file_path":"diamond-api/src/parse/time.rs","rank":9,"score":103851.42968592388},{"content":"pub fn get_temp_dir() -> TempDir {\n\n Builder::new()\n\n .prefix(\"whisper\")\n\n .tempdir()\n\n .expect(\"Temp dir created\")\n\n}\n\n\n","file_path":"whisper_tests/src/lib.rs","rank":10,"score":101462.9537054646},{"content":"fn format_none(float: Option<f64>) -> String {\n\n match float {\n\n Some(x) => format!(\"{:.1}\", x),\n\n None => \"None\".to_string(),\n\n }\n\n}\n\n\n\nimpl fmt::Display for DiffArchiveInfo {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n for archive in &self.archives {\n\n if f.alternate() {\n\n writeln!(\n\n f,\n\n \"Archive {} ({} of {} datapoints differ)\",\n\n archive.index, archive.points, archive.total\n\n )?;\n\n writeln!(\n\n f,\n\n \"{:>7} {:>11} {:>13} {:>13}\",\n\n \"\", \"timestamp\", \"value_a\", \"value_b\"\n","file_path":"whisper/src/diff.rs","rank":11,"score":99953.44945209098},{"content":"pub fn app_config(ctx: Context) -> impl Fn(&mut ServiceConfig) {\n\n move |config: &mut ServiceConfig| {\n\n config\n\n .app_data(ctx.clone())\n\n .service(resource(\"/render\").to(render_handler))\n\n .service(resource(\"/metrics/find\").to(find_handler))\n\n .service(resource(\"/metrics\").to(find_handler));\n\n }\n\n}\n","file_path":"diamond-api/src/application.rs","rank":12,"score":99567.44648528646},{"content":"#[inline]\n\npub fn line_update<P: AsRef<Path>>(\n\n message: &str,\n\n dir: P,\n\n config: &WhisperConfig,\n\n now: u32,\n\n) -> Result<(), Box<dyn Error>> {\n\n let metric: MetricPoint = message.parse()?;\n\n let metric_path: MetricPath = metric.name.parse()?;\n\n\n\n let file_path = dir.as_ref().join(metric_path.0);\n\n\n\n let mut file = if file_path.exists() {\n\n WhisperFile::open(&file_path)?\n\n } else {\n\n let dir_path = file_path.parent().unwrap();\n\n fs::create_dir_all(&dir_path)?;\n\n\n\n WhisperBuilder::default()\n\n .add_retentions(&config.retentions)\n\n .x_files_factor(config.x_files_factor)\n\n .aggregation_method(config.aggregation_method)\n\n .build(&file_path)?\n\n };\n\n\n\n file.update(&metric.point, now)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"diamond/src/lib.rs","rank":13,"score":99224.08309380221},{"content":"pub fn random_string(len: usize) -> String {\n\n Alphanumeric.sample_string(&mut thread_rng(), len)\n\n}\n\n\n","file_path":"whisper_tests/src/lib.rs","rank":14,"score":97319.71507534919},{"content":"#[inline]\n\npub fn update_silently(line: &str, conf: &Settings) {\n\n let now = SystemTime::now()\n\n .duration_since(UNIX_EPOCH)\n\n .unwrap()\n\n .as_secs() as u32;\n\n\n\n line_update(&line, &conf.db_path, &conf.whisper, now).unwrap_or_else(|e| eprintln!(\"{}\", e));\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use settings::{Net, WhisperConfig};\n\n use std::convert::From;\n\n use std::io;\n\n use std::net::IpAddr::V4;\n\n use std::path::{Path, PathBuf};\n\n use tempfile::Builder;\n\n use whisper::aggregation::AggregationMethod;\n\n use whisper::retention::Retention;\n","file_path":"diamond/src/lib.rs","rank":15,"score":95532.7581596298},{"content":"pub fn parse_duration(s: &str) -> Result<u32, String> {\n\n lazy_static! {\n\n static ref RETENTION_DEF_RE: Regex = Regex::new(r#\"(?i)^\\s*(\\d+)([a-z]*)\\s*$\"#).unwrap();\n\n }\n\n\n\n let captures = RETENTION_DEF_RE\n\n .captures(s)\n\n .ok_or_else(|| format!(\"Invalid duration definition '{}'\", s))?;\n\n\n\n let mut precision = u32::from_str_radix(captures.get(1).unwrap().as_str(), 10).unwrap();\n\n if !captures.get(2).unwrap().as_str().is_empty() {\n\n precision *= get_unit_multiplier(captures.get(2).unwrap().as_str())?;\n\n }\n\n\n\n if precision == 0 {\n\n Err(\"Precision cannot be zero\".to_owned())\n\n } else {\n\n Ok(precision)\n\n }\n\n}\n","file_path":"whisper/src/retention.rs","rank":16,"score":93902.32954636353},{"content":"pub fn time_parse(s: String) -> Result<u32, ParseError> {\n\n if s.starts_with('-') {\n\n // Relative time\n\n let (multi, count) = match &s.chars().last().unwrap() {\n\n 's' => (1, 1),\n\n 'h' => (3600, 1),\n\n 'd' => (3600 * 24, 1),\n\n 'w' => (3600 * 24 * 7, 1),\n\n 'y' => (3600 * 24 * 365, 1),\n\n 'n' if s.ends_with(\"min\") => (60, 3),\n\n 'n' if s.ends_with(\"mon\") => (3600 * 24 * 30, 3),\n\n _ => return Err(ParseError::Time),\n\n };\n\n\n\n let s2 = &s[1..s.len() - count];\n\n let now = SystemTime::now().duration_since(UNIX_EPOCH)?.as_secs() as u32;\n\n\n\n let v = now - s2.parse::<u32>()? * multi;\n\n Ok(v)\n\n } else {\n","file_path":"diamond-api/src/parse/time.rs","rank":17,"score":88849.37404166203},{"content":"#[cfg(not(target_os = \"unix\"))]\n\npub fn fallocate(fd: &mut File, offset: usize, len: usize) -> Result<()> {\n\n use std::io::{Seek, SeekFrom, Write};\n\n\n\n fd.seek(SeekFrom::Start(offset as u64))?;\n\n let zeroes = [0u8; 16384];\n\n let mut remaining = len;\n\n while remaining > zeroes.len() {\n\n fd.write_all(&zeroes)?;\n\n remaining -= zeroes.len();\n\n }\n\n fd.write_all(&zeroes[0..remaining])?;\n\n Ok(())\n\n}\n","file_path":"whisper/src/fallocate.rs","rank":18,"score":84715.47651211075},{"content":"pub fn get_file_path(temp_dir: &TempDir, prefix: &str) -> PathBuf {\n\n let file_name = format!(\"{}_{}.wsp\", prefix, random_string(10));\n\n let mut path = temp_dir.path().to_path_buf();\n\n path.push(file_name);\n\n path\n\n}\n\n\n","file_path":"whisper_tests/src/lib.rs","rank":19,"score":84602.37508034328},{"content":"fn points_to_values(points: &[Point], start: u32, step: u32) -> Vec<Option<f64>> {\n\n let mut values = Vec::with_capacity(points.len());\n\n for (i, point) in points.iter().enumerate() {\n\n if point.interval == start + (i as u32) * step {\n\n values.push(Some(point.value));\n\n } else {\n\n values.push(None);\n\n }\n\n }\n\n values\n\n}\n\n\n","file_path":"whisper/src/lib.rs","rank":20,"score":83816.8413023235},{"content":"pub fn info(filename: &Path, daemon: Option<&Path>, noflush: bool) -> Result<Info, Error> {\n\n let mut c_args = Vec::<*const c_char>::new();\n\n\n\n let info_str = CString::new(\"info\").unwrap();\n\n c_args.push(info_str.as_ptr());\n\n\n\n let c_filename = CString::new(filename.to_str().unwrap().as_bytes()).unwrap();\n\n c_args.push(c_filename.as_ptr());\n\n\n\n if let Some(daemon_path) = daemon {\n\n let daemon_str = CString::new(\"--daemon\").unwrap();\n\n c_args.push(daemon_str.as_ptr());\n\n let c_daemon_path = CString::new(daemon_path.to_str().unwrap().as_bytes()).unwrap();\n\n c_args.push(c_daemon_path.as_ptr());\n\n }\n\n\n\n if noflush {\n\n let noflush_str = CString::new(\"--noflush\").unwrap();\n\n c_args.push(noflush_str.as_ptr());\n\n }\n","file_path":"rrd/src/lib.rs","rank":21,"score":79545.98394601604},{"content":"pub fn fill(src: &Path, dst: &Path, from: u32, now: u32) -> Result<(), io::Error> {\n\n let mut start_from = from;\n\n let mut file_dst = WhisperFile::open(dst)?;\n\n\n\n let mut archives = file_dst.info().archives.clone();\n\n archives.sort_by_key(|a| a.retention());\n\n\n\n for archive in &archives {\n\n let from_time = now - archive.retention();\n\n\n\n if from_time >= start_from {\n\n continue;\n\n }\n\n\n\n let interval = Interval::new(from_time, start_from).unwrap();\n\n let data_dst = file_dst.fetch(archive.seconds_per_point, interval, now)?;\n\n\n\n let mut start = data_dst.from_interval;\n\n let end = data_dst.until_interval;\n\n let step = data_dst.step;\n","file_path":"whisper/src/fill.rs","rank":22,"score":78533.18504043702},{"content":"pub trait Storage {\n\n fn find(\n\n &self,\n\n path_expression: &PathExpression,\n\n ) -> Result<Vec<MetricResponseLeaf>, ResponseError>;\n\n\n\n fn query(\n\n &self,\n\n path_expression: &PathExpression,\n\n interval: Interval,\n\n now: u64,\n\n ) -> Result<Vec<StorageResponse>, ResponseError>;\n\n}\n","file_path":"diamond-api/src/storage/storage.rs","rank":23,"score":65337.58809623959},{"content":"#[test]\n\nfn calling_with_sum_and_xfactor() -> Result<(), Box<dyn Error>> {\n\n let filename = \"info.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n fs::copy(&file_path, &path)?;\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap(), \"sum\", \"0.2\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"Updated aggregation method\").from_utf8())\n\n .stdout(predicate::str::contains(\"(average -> sum)\").from_utf8())\n\n .stdout(predicate::str::contains(\"0.2\").not().from_utf8());\n\n Ok(())\n\n}\n","file_path":"whisper/tests/test-whisper-set-aggregation-method.rs","rank":24,"score":63308.4484557553},{"content":"fn path_element_enum(input: &str) -> IResult<&str, Vec<String>, VerboseError<&str>> {\n\n delimited(\n\n c('{'),\n\n separated_list1(tag(\",\"), partial_path_element),\n\n c('}'),\n\n )(input)\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":25,"score":56231.67486242715},{"content":"fn match_group_single(input: &str) -> IResult<&str, BTreeSet<char>, VerboseError<&str>> {\n\n let (input, single) = none_of(\"]\")(input)?;\n\n let group_single = [single].iter().cloned().collect();\n\n Ok((input, group_single))\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":26,"score":53974.08273540145},{"content":"fn path_element_group(input: &str) -> IResult<&str, BTreeSet<char>, VerboseError<&str>> {\n\n let (input, _) = c('[')(input)?;\n\n let (input, start_dash) = opt(c('-'))(input)?;\n\n\n\n let (input, mut chars) = fold_many1(\n\n alt((match_group_range, match_group_single)),\n\n BTreeSet::new,\n\n |mut acc: BTreeSet<char>, chars: BTreeSet<char>| {\n\n acc.extend(chars);\n\n acc\n\n },\n\n )(input)?;\n\n\n\n let (input, end_dash) = opt(c('-'))(input)?;\n\n let (input, _) = c(']')(input)?;\n\n\n\n if start_dash.is_some() || end_dash.is_some() {\n\n chars.insert('-');\n\n }\n\n\n\n Ok((input, chars))\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":27,"score":53974.08273540145},{"content":"fn match_group_range(input: &str) -> IResult<&str, BTreeSet<char>, VerboseError<&str>> {\n\n let (input, from_char) = none_of(\"]\")(input)?;\n\n let (input, _) = c('-')(input)?;\n\n let (input, to_char) = none_of(\"]\")(input)?;\n\n\n\n let range = ((from_char as u8)..=(to_char as u8))\n\n .map(|c| c as char)\n\n .collect();\n\n\n\n Ok((input, range))\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":28,"score":53974.08273540145},{"content":"fn main() {\n\n #[cfg(target_os = \"freebsd\")]\n\n println!(\"cargo:rustc-link-search=native=/usr/local/lib\");\n\n println!(\"cargo:rustc-link-lib=rrd\");\n\n}\n","file_path":"rrd-sys/build.rs","rank":29,"score":49119.92117937884},{"content":"fn main() {\n\n let args = Args::from_args();\n\n if let Err(err) = run(&args) {\n\n eprintln!(\"{}\", err);\n\n exit(1);\n\n }\n\n}\n","file_path":"rrd2whisper/src/main.rs","rank":30,"score":49119.92117937884},{"content":"fn fill_interval(\n\n src: &Path,\n\n dst: &Path,\n\n tstart: u32,\n\n tsuntil: u32,\n\n now: u32,\n\n) -> Result<(), io::Error> {\n\n let mut tstop = tsuntil;\n\n\n\n let mut file_src = WhisperFile::open(src)?;\n\n let mut file_dst = WhisperFile::open(dst)?;\n\n\n\n let mut archives = file_src.info().archives.clone();\n\n archives.sort_by_key(|a| a.retention());\n\n\n\n // find oldest point in time, stored by both files\n\n let src_time = now - file_src.info().max_retention;\n\n\n\n if (tstart < src_time) && (tstop < src_time) {\n\n return Ok(());\n","file_path":"whisper/src/fill.rs","rank":31,"score":47804.13866519788},{"content":"fn migrate_points(\n\n path_src: &Path,\n\n path_dst: &Path,\n\n aggregate: bool,\n\n now: u32,\n\n) -> Result<(), Error> {\n\n if !path_src.is_file() {\n\n return Err(Error::FileNotExist(path_src.to_owned()).into());\n\n }\n\n\n\n if aggregate {\n\n println!(\"Migrating data with aggregation...\");\n\n migrate_aggregate(path_src, path_dst, now)?;\n\n } else {\n\n println!(\"Migrating data without aggregation...\");\n\n migrate_nonaggregate(path_src, path_dst, now)?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/src/resize.rs","rank":32,"score":47804.13866519788},{"content":"fn file_update(\n\n fh: &mut fs::File,\n\n header: &WhisperMetadata,\n\n point: &Point,\n\n now: u32,\n\n) -> Result<(), io::Error> {\n\n let timestamp = point.interval;\n\n\n\n if now >= timestamp + header.max_retention || now < timestamp {\n\n return Err(io::Error::new(\n\n io::ErrorKind::Other,\n\n \"Timestamp not covered by any archives in this database.\",\n\n ));\n\n }\n\n\n\n // Find the highest-precision archive that covers timestamp\n\n let archive_index = header\n\n .archives\n\n .iter()\n\n .position(|a| timestamp + a.retention() >= now)\n","file_path":"whisper/src/lib.rs","rank":33,"score":47804.13866519788},{"content":"fn points_to_data(\n\n points: &Option<Vec<Point>>,\n\n interval: Interval,\n\n seconds_per_point: u32,\n\n) -> ArchiveData {\n\n let values = match points {\n\n None => {\n\n let count = (interval.until() - interval.from()) / seconds_per_point;\n\n vec![None; count as usize]\n\n }\n\n Some(points) => points_to_values(&points, interval.from(), seconds_per_point),\n\n };\n\n\n\n ArchiveData {\n\n from_interval: interval.from(),\n\n until_interval: interval.until(),\n\n step: seconds_per_point,\n\n values,\n\n }\n\n}\n","file_path":"whisper/src/lib.rs","rank":34,"score":47804.13866519788},{"content":"fn file_update_many(\n\n fh: &mut fs::File,\n\n header: &WhisperMetadata,\n\n points: &[Point],\n\n now: u32,\n\n) -> Result<(), io::Error> {\n\n let mut archive_index = 0;\n\n let mut current_points = vec![];\n\n\n\n for point in points {\n\n while point.interval + header.archives[archive_index].retention() < now {\n\n // We can't fit any more points in this archive\n\n if !current_points.is_empty() {\n\n // Commit all the points we've found that it can fit\n\n current_points.reverse(); // Put points in chronological order\n\n __archive_update_many(fh, &header, archive_index, ¤t_points)?;\n\n current_points.clear();\n\n }\n\n archive_index += 1;\n\n if archive_index >= header.archives.len() {\n","file_path":"whisper/src/lib.rs","rank":35,"score":46583.64373679648},{"content":"fn get_and_clear_error() -> Error {\n\n unsafe {\n\n let c_err = rrd_get_error();\n\n let error = Error(\n\n CStr::from_ptr(c_err)\n\n .to_str()\n\n .map_err(|e| Error(e.to_string()))\n\n .unwrap()\n\n .to_owned(),\n\n );\n\n rrd_clear_error();\n\n error\n\n }\n\n}\n\n\n","file_path":"rrd/src/lib.rs","rank":36,"score":44657.88359273298},{"content":"fn current_time() -> u32 {\n\n let since_epoch = SystemTime::now().duration_since(UNIX_EPOCH).expect(\"Time\");\n\n since_epoch.as_secs() as u32\n\n}\n\n\n","file_path":"whisper_tests/benches/tests.rs","rank":37,"score":44657.88359273298},{"content":"fn parse_template(\n\n source: Source,\n\n all_args: Option<Vec<(Option<String>, LiteralValue)>>,\n\n) -> Result<Template, String> {\n\n let (args, named_args) = split_args(all_args.unwrap_or_default()).ok_or_else(|| {\n\n format!(\n\n \"Bad call of template {:?}: positional argument after named one.\",\n\n source\n\n )\n\n })?;\n\n Ok(Template {\n\n source,\n\n args,\n\n named_args,\n\n })\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":38,"score":44389.90881478431},{"content":"fn call_args(\n\n input: &str,\n\n) -> IResult<&str, (String, Vec<(Option<String>, Arg)>), VerboseError<&str>> {\n\n let (input, function) = ident(input)?;\n\n let (input, _) = c('(')(input)?;\n\n let (input, all_args) = separated_list0(c(','), call_arg)(input)?;\n\n let (input, _) = c(')')(input)?;\n\n\n\n Ok((input, (function, all_args)))\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":39,"score":44389.90881478431},{"content":"fn template_internal(\n\n input: &str,\n\n) -> IResult<&str, (Source, Option<Vec<(Option<String>, LiteralValue)>>), VerboseError<&str>> {\n\n let (input, _) = tag(\"template\")(input)?;\n\n let (input, _) = tag(\"(\")(input)?;\n\n let (input, source) = source(input)?;\n\n\n\n let (input, all_args) =\n\n opt(preceded(tag(\",\"), separated_list1(tag(\",\"), template_arg)))(input)?;\n\n let (input, _) = tag(\")\")(input)?;\n\n\n\n Ok((input, (source, all_args)))\n\n}\n\n\n","file_path":"diamond-api/src/render_target/parser.rs","rank":40,"score":44389.90881478431},{"content":"fn walk_tree(\n\n dir: &Path,\n\n path_prefix: &MetricName,\n\n path_words: &[PathWord],\n\n acc: &mut Vec<(MetricName, PathBuf)>,\n\n) -> Result<(), ResponseError> {\n\n match path_words.len() {\n\n 0 => {}\n\n 1 => {\n\n let regex = path_words[0].to_regex().map_err(|_| ResponseError::Path)?;\n\n for entry in fs::read_dir(&dir)? {\n\n let path = entry?.path();\n\n if let Some(file_name) = file_name(&path) {\n\n if regex.is_match(&file_name) {\n\n let storage_path = path_prefix.join(file_name);\n\n acc.push((storage_path, path));\n\n }\n\n }\n\n }\n\n }\n","file_path":"diamond-api/src/storage/whisper_fs.rs","rank":41,"score":44389.90881478431},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_infoval() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_infoval>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(rrd_infoval))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_infoval>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(rrd_infoval))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_infoval>())).u_cnt as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(rrd_infoval),\n\n \"::\",\n\n stringify!(u_cnt)\n\n )\n","file_path":"rrd-sys/src/tests.rs","rank":42,"score":43400.51738399056},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_info_t() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_info_t>(),\n\n 40usize,\n\n concat!(\"Size of: \", stringify!(rrd_info_t))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_info_t>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(rrd_info_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_info_t>())).key as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(rrd_info_t),\n\n \"::\",\n\n stringify!(key)\n\n )\n","file_path":"rrd-sys/src/tests.rs","rank":43,"score":43400.51738399056},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_blob_t() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_blob_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(rrd_blob_t))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_blob_t>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(rrd_blob_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_blob_t>())).size as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(rrd_blob_t),\n\n \"::\",\n\n stringify!(size)\n\n )\n","file_path":"rrd-sys/src/tests.rs","rank":44,"score":43400.51738399056},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_file_t() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_file_t>(),\n\n 40usize,\n\n \"Size of rrd_file_t\"\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_file_t>(),\n\n 8usize,\n\n \"Alignment of rrd_file_t\"\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_file_t>())).header_len as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(rrd_file_t),\n\n \"::\",\n\n stringify!(header_len)\n\n )\n","file_path":"rrd-sys/src/tests.rs","rank":45,"score":43400.51738399056},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_context() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_context>(),\n\n 4352usize,\n\n concat!(\"Size of: \", stringify!(rrd_context))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_context>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(rrd_context))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_context>())).lib_errstr as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(rrd_context),\n\n \"::\",\n\n stringify!(lib_errstr)\n\n )\n","file_path":"rrd-sys/src/tests.rs","rank":46,"score":43400.51738399056},{"content":"fn get_temp_dir() -> TempDir {\n\n Builder::new()\n\n .prefix(\"rrd\")\n\n .tempdir()\n\n .expect(\"Temp dir created\")\n\n}\n\n\n","file_path":"rrd_tests/tests/fetch.rs","rank":47,"score":42609.95381770953},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_simple_file_t() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_simple_file_t>(),\n\n 4usize,\n\n \"Size of rrd_simple_file_t\"\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_simple_file_t>(),\n\n 4usize,\n\n \"Alignment of rrd_simple_file_t\"\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_simple_file_t>())).fd as *const _ as usize },\n\n 0usize,\n\n \"Offset of field rrd_simple_file_t::fd\"\n\n );\n\n}\n\n\n","file_path":"rrd-sys/src/tests.rs","rank":48,"score":42473.71183284797},{"content":"#[test]\n\nfn bindgen_test_layout_rrd_time_value() {\n\n assert_eq!(\n\n ::std::mem::size_of::<rrd_time_value>(),\n\n 72usize,\n\n concat!(\"Size of: \", stringify!(rrd_time_value))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<rrd_time_value>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(rrd_time_value))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<rrd_time_value>())).type_ as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(rrd_time_value),\n\n \"::\",\n\n stringify!(type_)\n\n )\n","file_path":"rrd-sys/src/tests.rs","rank":49,"score":42473.71183284797},{"content":"fn write_archive<F: Write + Seek>(\n\n fh: &mut F,\n\n archive: &ArchiveInfo,\n\n points: &[Point],\n\n base_interval: u32,\n\n) -> Result<(), io::Error> {\n\n let point_size = 12;\n\n\n\n let first_interval = points[0].interval;\n\n\n\n let offset = instant_offset(archive, base_interval, first_interval);\n\n\n\n let available_tail_space = (archive.points - offset) as usize;\n\n\n\n if available_tail_space < points.len() {\n\n let (tail, head) = points.split_at(available_tail_space);\n\n\n\n fh.seek(io::SeekFrom::Start(\n\n (archive.offset + offset * point_size).into(),\n\n ))?;\n","file_path":"whisper/src/lib.rs","rank":50,"score":42257.39168814495},{"content":"fn read_archive<R: Read + Seek>(\n\n fh: &mut R,\n\n archive: &ArchiveInfo,\n\n from_index: u32,\n\n until_index: u32,\n\n) -> Result<Vec<Point>, io::Error> {\n\n let from_index = from_index % archive.points;\n\n let until_index = until_index % archive.points;\n\n\n\n let mut series =\n\n Vec::with_capacity(((archive.points + until_index - from_index) % archive.points) as usize);\n\n\n\n let point_size = 12;\n\n let from_offset = archive.offset + from_index * point_size;\n\n\n\n fh.seek(io::SeekFrom::Start(from_offset.into()))?;\n\n if from_index < until_index {\n\n // If we don't wrap around the archive\n\n for _i in from_index..until_index {\n\n series.push(Point::read(fh)?);\n","file_path":"whisper/src/lib.rs","rank":51,"score":42257.39168814495},{"content":"fn __propagate<F: Read + Write + Seek>(\n\n fh: &mut F,\n\n header: &WhisperMetadata,\n\n timestamp: u32,\n\n higher: &ArchiveInfo,\n\n lower: &ArchiveInfo,\n\n) -> Result<bool, io::Error> {\n\n let lower_interval_start = timestamp - (timestamp % lower.seconds_per_point);\n\n\n\n fh.seek(io::SeekFrom::Start(higher.offset.into()))?;\n\n let higher_base = Point::read(fh)?;\n\n\n\n let higher_first_index = instant_offset(higher, higher_base.interval, lower_interval_start);\n\n\n\n let higher_last_index = {\n\n let higher_points = lower.seconds_per_point / higher.seconds_per_point;\n\n (higher_first_index + higher_points) % higher.points\n\n };\n\n\n\n let series = read_archive(fh, higher, higher_first_index, higher_last_index)?;\n","file_path":"whisper/src/lib.rs","rank":52,"score":41683.0399814578},{"content":"fn archive_fetch_interval<R: Read + Seek>(\n\n fh: &mut R,\n\n archive: &ArchiveInfo,\n\n interval: Interval,\n\n) -> Result<Option<Vec<Point>>, io::Error> {\n\n let base = archive.read_base(fh)?;\n\n if base.interval == 0 {\n\n Ok(None)\n\n } else {\n\n let from_index = instant_offset(archive, base.interval, interval.from());\n\n let until_index = instant_offset(archive, base.interval, interval.until());\n\n let points = read_archive(fh, &archive, from_index, until_index)?;\n\n Ok(Some(points))\n\n }\n\n}\n\n\n","file_path":"whisper/src/lib.rs","rank":53,"score":41268.0002573512},{"content":"fn random_string(len: usize) -> String {\n\n Alphanumeric.sample_string(&mut thread_rng(), len)\n\n}\n\n\n","file_path":"rrd_tests/tests/fetch.rs","rank":54,"score":41268.0002573512},{"content":"fn test_create(bench: &mut Bencher) {\n\n let temp_dir = get_temp_dir();\n\n let mut index = 1;\n\n let i = &mut index;\n\n bench.iter(|| {\n\n let path = get_file_path(&temp_dir, \"whisper_create\");\n\n create_file(&path).expect(\"creating\");\n\n *i += 1;\n\n });\n\n}\n\n\n","file_path":"whisper_tests/benches/tests.rs","rank":55,"score":41268.0002573512},{"content":"fn test_update(bench: &mut Bencher) {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"whisper_update\");\n\n let mut file = create_file(&path).expect(\"Create file for update\");\n\n\n\n let mut current_value = 0.5;\n\n let i = &mut current_value;\n\n let now = current_time();\n\n\n\n bench.iter(|| {\n\n for j in 0..SECONDS_AGO {\n\n file.update(\n\n &Point {\n\n interval: now - SECONDS_AGO + j,\n\n value: *i,\n\n },\n\n now,\n\n )\n\n .expect(\"update\");\n\n *i += VALUE_STEP;\n\n }\n\n });\n\n}\n\n\n","file_path":"whisper_tests/benches/tests.rs","rank":56,"score":41268.0002573512},{"content":"fn test_fetch(bench: &mut Bencher) {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"whisper_fetch\");\n\n let mut file = create_file(&path).expect(\"Create file for fetching\");\n\n\n\n let mut current_value = 0.5;\n\n let now = current_time();\n\n\n\n for j in 0..SECONDS_AGO {\n\n file.update(\n\n &Point {\n\n interval: now - SECONDS_AGO + j,\n\n value: current_value,\n\n },\n\n now,\n\n )\n\n .expect(\"update\");\n\n current_value += VALUE_STEP;\n\n }\n\n\n\n let from_time = now - SECONDS_AGO;\n\n let until_time = from_time + 1000;\n\n let interval = Interval::new(from_time, until_time).expect(\"interval\");\n\n bench.iter(|| {\n\n let seconds_per_point = file.suggest_archive(interval, now).expect(\"Archive\");\n\n file.fetch(seconds_per_point, interval, now).expect(\"fetch\");\n\n });\n\n}\n\n\n","file_path":"whisper_tests/benches/tests.rs","rank":57,"score":41268.0002573512},{"content":"fn test_update_fetch(bench: &mut Bencher) {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"whisper_update\");\n\n let mut file = create_file(&path).expect(\"Create file for update\");\n\n\n\n let mut current_value = 0.5;\n\n let i = &mut current_value;\n\n let now = current_time();\n\n\n\n let from_time = now - SECONDS_AGO;\n\n let until_time = from_time + 1000;\n\n let interval = Interval::new(from_time, until_time).expect(\"interval\");\n\n bench.iter(|| {\n\n for j in 0..SECONDS_AGO {\n\n file.update(\n\n &Point {\n\n interval: now - SECONDS_AGO + j,\n\n value: *i,\n\n },\n\n now,\n","file_path":"whisper_tests/benches/tests.rs","rank":58,"score":40341.19470620861},{"content":"fn write_archive_point<F: Read + Write + Seek>(\n\n fh: &mut F,\n\n archive: &ArchiveInfo,\n\n point: &Point,\n\n) -> Result<(), io::Error> {\n\n let base = archive.read_base(fh)?;\n\n let index = instant_offset(archive, base.interval, point.interval);\n\n fh.seek(io::SeekFrom::Start(\n\n (archive.offset + index * POINT_SIZE as u32).into(),\n\n ))?;\n\n point.write(fh)?;\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/src/lib.rs","rank":59,"score":39766.84299952147},{"content":"#[test]\n\n#[allow(clippy::unreadable_literal)]\n\nfn issue8_many() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"issue8\");\n\n\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 60,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n file.update_many(\n\n &[Point {\n\n interval: 1528240818,\n\n value: 123.0,\n\n }],\n\n 1528240900,\n\n )?;\n\n\n\n let points = file.dump(60)?;\n\n assert_eq!(points[0].interval, 1528240800);\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"whisper_tests/tests/issue8.rs","rank":60,"score":39766.84299952147},{"content":"#[test]\n\nfn issue22_original() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"issue22\");\n\n\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 1,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n let now = 1000;\n\n\n\n file.update(\n\n &Point {\n\n interval: now - 1,\n\n value: 100.0,\n\n },\n\n now,\n\n )?;\n","file_path":"whisper_tests/tests/issue22.rs","rank":61,"score":39766.84299952147},{"content":"#[test]\n\n#[allow(clippy::unreadable_literal)]\n\nfn issue8_single() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"issue8\");\n\n\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 60,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n file.update(\n\n &Point {\n\n interval: 1528240818,\n\n value: 123.0,\n\n },\n\n 1528240900,\n\n )?;\n\n\n\n let points = file.dump(60)?;\n\n assert_eq!(points[0].interval, 1528240800);\n\n\n\n Ok(())\n\n}\n","file_path":"whisper_tests/tests/issue8.rs","rank":62,"score":39766.84299952147},{"content":"fn __archive_update_many<F: Read + Write + Seek>(\n\n fh: &mut F,\n\n header: &WhisperMetadata,\n\n archive_index: usize,\n\n points: &[Point],\n\n) -> Result<(), io::Error> {\n\n let archive = &header.archives[archive_index];\n\n\n\n let aligned_points: Vec<Point> = points\n\n .iter()\n\n .map(|p| p.align(archive.seconds_per_point))\n\n .collect();\n\n\n\n let chunks: Vec<Vec<Point>> = pack_points(&aligned_points, archive.seconds_per_point);\n\n\n\n // Read base point and determine where our writes will start\n\n let base = archive.read_base(fh)?;\n\n\n\n let base_interval = if base.interval == 0 {\n\n // This file's first update\n","file_path":"whisper/src/lib.rs","rank":63,"score":39766.84299952147},{"content":"fn adjust_instant_up(instant: u32, step: u32) -> u32 {\n\n (instant + step - 1) / step * step\n\n}\n\n\n","file_path":"whisper/src/lib.rs","rank":64,"score":39245.105957990614},{"content":"fn get_unit_multiplier(s: &str) -> Result<u32, String> {\n\n if s.is_empty() || \"seconds\".starts_with(s) {\n\n Ok(1)\n\n } else if \"minutes\".starts_with(s) {\n\n Ok(60)\n\n } else if \"hours\".starts_with(s) {\n\n Ok(3600)\n\n } else if \"days\".starts_with(s) {\n\n Ok(86400)\n\n } else if \"weeks\".starts_with(s) {\n\n Ok(86400 * 7)\n\n } else if \"years\".starts_with(s) {\n\n Ok(86400 * 365)\n\n } else {\n\n Err(format!(\"Invalid unit '{}'\", s))\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Clone, Copy)]\n\npub struct Retention {\n","file_path":"whisper/src/retention.rs","rank":65,"score":39245.105957990614},{"content":"fn adjust_instant(instant: u32, step: u32) -> u32 {\n\n instant - (instant % step)\n\n}\n\n\n","file_path":"whisper/src/lib.rs","rank":66,"score":39245.105957990614},{"content":"#[test]\n\nfn calling_help() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"--help\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"USAGE\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n","file_path":"whisper/tests/test-whisper-fetch.rs","rank":67,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_as_json() -> Result<(), Box<dyn Error>> {\n\n let filename = \"info.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n fs::copy(&file_path, &path)?;\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap(), \"--json\"])\n\n .assert()\n\n .success()\n\n .stdout(\n\n predicate::str::contains(\n","file_path":"whisper/tests/test-whisper-info.rs","rank":68,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_help() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"--help\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"USAGE\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-info.rs","rank":69,"score":38896.8669074688},{"content":"#[test]\n\n#[allow(clippy::unreadable_literal)]\n\nfn test_update_snapshot() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"update_snapshot\");\n\n\n\n {\n\n WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 1,\n\n points: 10,\n\n })\n\n .build(path.clone())?;\n\n }\n\n\n\n let header = Vec::new()\n\n .u32(1) // aggregation method\n\n .u32(10) // max retention\n\n .f32(0.5) // x files factor\n\n .u32(1) // archives\n\n // archive info\n\n .u32(28) // offset\n","file_path":"whisper_tests/tests/update.rs","rank":70,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_as_plain() -> Result<(), Box<dyn Error>> {\n\n let filename = \"dump.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n fs::copy(&file_path, &path)?;\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap()])\n\n .assert()\n\n .success()\n\n .stdout(\n\n predicate::str::contains(\n","file_path":"whisper/tests/test-whisper-dump.rs","rank":71,"score":38896.8669074688},{"content":"#[test]\n\nfn test_read_rrd() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"read_rrd\");\n\n\n\n Command::new(\"rrdtool\")\n\n .arg(\"create\")\n\n .arg(&path)\n\n .args(&[\"--step\", \"300\"])\n\n .arg(\"DS:temp:GAUGE:600:-273:5000\")\n\n .arg(\"RRA:AVERAGE:0.5:1:1200\")\n\n .arg(\"RRA:MIN:0.6:12:2400\")\n\n .arg(\"RRA:MAX:0.7:12:2400\")\n\n .arg(\"RRA:AVERAGE:0.8:12:2400\")\n\n .status()?;\n\n\n\n let rrd_info = rrd::info(&path, None, false)?;\n\n\n\n let info: HashMap<String, rrd::Value> = rrd_info.iter().collect();\n\n let seconds_per_pdp = info[\"step\"].as_long().unwrap();\n\n assert_eq!(seconds_per_pdp, 300);\n","file_path":"rrd_tests/tests/fetch.rs","rank":72,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_help() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"--help\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"USAGE\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-dump.rs","rank":73,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_as_pretty() -> Result<(), Box<dyn Error>> {\n\n let filename = \"dump.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n fs::copy(&file_path, &path)?;\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap(), \"--time-format\", \"%c\"])\n\n .assert()\n\n .success()\n\n .stdout(\n\n predicate::str::contains(\n","file_path":"whisper/tests/test-whisper-dump.rs","rank":74,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_help() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"--help\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"USAGE\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n","file_path":"whisper/tests/test-whisper-resize.rs","rank":75,"score":38896.8669074688},{"content":"#[test]\n\nfn issue22_many_archives() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"issue22_many\");\n\n\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 2,\n\n points: 10,\n\n })\n\n .add_retention(Retention {\n\n seconds_per_point: 4,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n let now = 1000;\n\n\n\n for item in (2..18).step_by(2) {\n\n let delta = 18 - item;\n\n file.update(\n","file_path":"whisper_tests/tests/issue22.rs","rank":76,"score":38896.8669074688},{"content":"#[test]\n\nfn issue22_many_archives_once() -> Result<(), Box<dyn Error>> {\n\n let temp_dir = get_temp_dir();\n\n let path = get_file_path(&temp_dir, \"issue22_many\");\n\n\n\n let mut file = WhisperBuilder::default()\n\n .add_retention(Retention {\n\n seconds_per_point: 2,\n\n points: 10,\n\n })\n\n .add_retention(Retention {\n\n seconds_per_point: 4,\n\n points: 10,\n\n })\n\n .build(path)?;\n\n\n\n let now = 1000;\n\n\n\n file.update_many(\n\n &[\n\n Point {\n","file_path":"whisper_tests/tests/issue22.rs","rank":77,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_as_plain() -> Result<(), Box<dyn Error>> {\n\n let filename = \"info.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n fs::copy(&file_path, &path)?;\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap()])\n\n .assert()\n\n .success()\n\n .stdout(\n\n predicate::str::contains(\n","file_path":"whisper/tests/test-whisper-info.rs","rank":78,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_help() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"--help\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"USAGE\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-create.rs","rank":79,"score":38896.8669074688},{"content":"fn validate_archive_list(archives: &[Retention]) -> Result<(), BuilderError> {\n\n for (i, pair) in archives.windows(2).enumerate() {\n\n let archive = &pair[0];\n\n let next_archive = &pair[1];\n\n\n\n if archive.seconds_per_point >= next_archive.seconds_per_point {\n\n return Err(BuilderError::SamePrecision(i, *archive, *next_archive));\n\n }\n\n\n\n if next_archive.seconds_per_point % archive.seconds_per_point != 0 {\n\n return Err(BuilderError::UndividablePrecision(\n\n i,\n\n *archive,\n\n *next_archive,\n\n ));\n\n }\n\n\n\n let retention = archive.retention();\n\n let next_retention = next_archive.retention();\n\n\n","file_path":"whisper/src/builder.rs","rank":80,"score":38896.8669074688},{"content":"#[test]\n\nfn calling_help() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"--help\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"USAGE\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-update.rs","rank":81,"score":38896.8669074688},{"content":"fn run(args: &Args) -> Result<(), Box<dyn Error>> {\n\n let now = SystemTime::now().duration_since(UNIX_EPOCH)?.as_secs();\n\n\n\n let rrd_info = rrd::info(&args.rrd_path, None, false).unwrap();\n\n\n\n let info: HashMap<String, rrd::Value> = rrd_info.iter().collect();\n\n\n\n let seconds_per_pdp = &info[\"step\"].as_long().unwrap();\n\n\n\n let rras = rrd_info.rras();\n\n\n\n let datasources = rrd_info.datasources();\n\n\n\n // Grab the archive configuration\n\n let relevant_rras: Vec<_> = rras\n\n .iter()\n\n .filter(|rra| rra.cf == args.aggregation_method)\n\n .collect();\n\n\n\n if relevant_rras.is_empty() {\n","file_path":"rrd2whisper/src/main.rs","rank":82,"score":38769.07041755324},{"content":"#[test]\n\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .assert()\n\n .code(1)\n\n .stdout(\"\")\n\n .stderr(predicate::str::contains(\"USAGE\").from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-dump.rs","rank":83,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_creating_simple() -> Result<(), Box<dyn Error>> {\n\n let filename = \"info.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap(), \"60:1440\"])\n\n .assert()\n\n .success()\n\n .stdout(predicate::str::contains(\"Created: \").from_utf8())\n\n .stdout(predicate::str::contains(path.to_str().unwrap()).from_utf8())\n\n .stdout(predicate::str::contains(\"(17308 bytes)\").from_utf8())\n\n .stderr(\"\");\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-create.rs","rank":84,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_value() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"invalid\", \"1:value\"])\n\n .assert()\n\n .code(1);\n\n Ok(())\n\n}\n","file_path":"whisper/tests/test-whisper-update.rs","rank":85,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_as_plain_for_unknown() -> Result<(), Box<dyn Error>> {\n\n let filename = \"info.wsp\";\n\n\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(filename)\n\n .tempdir()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let file_path = PathBuf::new().join(\"data\").join(filename);\n\n\n\n fs::copy(&file_path, &path)?;\n\n\n\n let error = \"Unknown field \\\"unknown\\\". Valid fields are maxRetention, xFilesFactor, aggregationMethod, archives, fileSize\";\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap(), \"unknown\"])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error).from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-info.rs","rank":86,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\n\n #[cfg(unix)]\n\n let error_msg = \"No such file or directory (os error 2)\";\n\n #[cfg(windows)]\n\n let error_msg = \"The system cannot find the file specified. (os error 2)\";\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"invalid\"])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error_msg).from_utf8());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-dump.rs","rank":87,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\n\n #[cfg(unix)]\n\n let error_msg = \"No such file or directory (os error 2)\";\n\n #[cfg(windows)]\n\n let error_msg = \"The system cannot find the file specified. (os error 2)\";\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"invalid\"])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error_msg).from_utf8());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-info.rs","rank":88,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .assert()\n\n .code(1)\n\n .stdout(\"\")\n\n .stderr(predicate::str::contains(\"USAGE\").from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-create.rs","rank":89,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .assert()\n\n .code(1)\n\n .stdout(\"\")\n\n .stderr(predicate::str::contains(\"USAGE\").from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-fetch.rs","rank":90,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .assert()\n\n .code(1)\n\n .stdout(\"\")\n\n .stderr(predicate::str::contains(\"USAGE\").from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-resize.rs","rank":91,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\n\n #[cfg(unix)]\n\n let error_msg = \"No such file or directory (os error 2)\";\n\n #[cfg(windows)]\n\n let error_msg = \"The system cannot find the file specified. (os error 2)\";\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"invalid\", \"1:1\"])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error_msg).from_utf8());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-update.rs","rank":92,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .assert()\n\n .code(1)\n\n .stdout(\"\")\n\n .stderr(predicate::str::contains(\"USAGE\").from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-update.rs","rank":93,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_timestamp() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"invalid\", \"nottimestamp:1\"])\n\n .assert()\n\n .code(1);\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-update.rs","rank":94,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\n\n #[cfg(unix)]\n\n let error_msg = \"No such file or directory (os error 2)\";\n\n #[cfg(windows)]\n\n let error_msg = \"The system cannot find the path specified. (os error 3)\";\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[\"invalid/path\", \"60:1440\"])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error_msg).from_utf8());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-create.rs","rank":95,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_method() -> Result<(), Box<dyn Error>> {\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(\"info.wsp\")\n\n .tempfile()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let error =\n\n \"error: Invalid value for '--aggregationMethod <aggregation-method>': Unsupported aggregation method 'unknown'\";\n\n\n\n Command::cargo_bin(NAME)?\n\n .args(&[\n\n path.to_str().unwrap(),\n\n \"60:1440\",\n\n \"--aggregationMethod\",\n\n \"unknown\",\n\n ])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error).from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-create.rs","rank":96,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_with_invalid_xfactor() -> Result<(), Box<dyn Error>> {\n\n let path = Builder::new()\n\n .prefix(\"whisper\")\n\n .suffix(\"info.wsp\")\n\n .tempfile()?\n\n .path()\n\n .to_path_buf();\n\n\n\n let error = \"error: Invalid value for '--xFilesFactor <x-files-factor>': invalid float literal\";\n\n\n\n // TODO: validate nan as invalid value\n\n Command::cargo_bin(NAME)?\n\n .args(&[path.to_str().unwrap(), \"60:1440\", \"--xFilesFactor\", \"nano\"])\n\n .assert()\n\n .code(1)\n\n .stderr(predicate::str::contains(error).from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-create.rs","rank":97,"score":38078.64879389722},{"content":"#[test]\n\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\n\n Command::cargo_bin(NAME)?\n\n .assert()\n\n .code(1)\n\n .stdout(\"\")\n\n .stderr(predicate::str::contains(\"USAGE\").from_utf8());\n\n Ok(())\n\n}\n\n\n","file_path":"whisper/tests/test-whisper-info.rs","rank":98,"score":38078.64879389722},{"content":"use super::*;\n\nuse crate::interval::Interval;\n\nuse std::fmt;\n\nuse std::io;\n\nuse std::path::Path;\n\n\n\n#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]\n\npub struct DiffPoint {\n\n #[serde(rename = \"timestamp\")]\n\n pub interval: u32,\n\n #[serde(rename = \"value_a\")]\n\n pub value1: Option<f64>,\n\n #[serde(rename = \"value_b\")]\n\n pub value2: Option<f64>,\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n\npub struct DiffArchive {\n\n #[serde(rename = \"archive\")]\n\n pub index: usize,\n","file_path":"whisper/src/diff.rs","rank":99,"score":21.811678259990707}],"string":"[\n {\n \"content\": \"pub fn diff(\\n\\n path1: &Path,\\n\\n path2: &Path,\\n\\n ignore_empty: bool,\\n\\n mut until_time: u32,\\n\\n now: u32,\\n\\n) -> Result<Vec<DiffArchive>, io::Error> {\\n\\n let mut file1 = WhisperFile::open(path1)?;\\n\\n let mut file2 = WhisperFile::open(path2)?;\\n\\n\\n\\n if file1.info().archives != file2.info().archives {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n \\\"Archive configurations are unalike. Resize the input before diffing\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n let mut archives = file1.info().archives.clone();\\n\\n archives.sort_by_key(|a| a.retention());\\n\\n\\n\",\n \"file_path\": \"whisper/src/diff.rs\",\n \"rank\": 2,\n \"score\": 114835.86518919212\n },\n {\n \"content\": \"pub fn fetch(\\n\\n filename: &Path,\\n\\n aggregation: AggregationMethod,\\n\\n resolution: Option<u32>,\\n\\n start: u64,\\n\\n end: u64,\\n\\n) -> Result<Data, Error> {\\n\\n let c_filename = CString::new(filename.to_str().unwrap().as_bytes()).unwrap();\\n\\n let c_aggregation =\\n\\n CString::new(str::to_ascii_uppercase(aggregation.into()).as_bytes()).unwrap();\\n\\n\\n\\n let mut start = start as c_long;\\n\\n let mut end = end as c_long;\\n\\n let mut step = u64::from(resolution.unwrap_or(1)) as c_ulong;\\n\\n let mut ds_cnt = 0;\\n\\n let mut ds_namv = ptr::null_mut();\\n\\n let mut data = ptr::null_mut();\\n\\n let status = unsafe {\\n\\n rrd_fetch_r(\\n\\n c_filename.as_ptr(),\\n\",\n \"file_path\": \"rrd/src/lib.rs\",\n \"rank\": 3,\n \"score\": 114835.86518919212\n },\n {\n \"content\": \"pub fn merge(\\n\\n path_src: &Path,\\n\\n path_dst: &Path,\\n\\n time_from: u32,\\n\\n time_to: u32,\\n\\n now: u32,\\n\\n) -> Result<(), io::Error> {\\n\\n // if now is None:\\n\\n // now = int(time.time())\\n\\n\\n\\n // if (time_to is not None):\\n\\n // untilTime = time_to\\n\\n // else:\\n\\n // untilTime = now\\n\\n\\n\\n // if (time_from is not None):\\n\\n // fromTime = time_from\\n\\n // else:\\n\\n // fromTime = 0\\n\\n\\n\",\n \"file_path\": \"whisper/src/merge.rs\",\n \"rank\": 4,\n \"score\": 114835.86518919212\n },\n {\n \"content\": \"#[allow(clippy::too_many_arguments)]\\n\\npub fn resize(\\n\\n path_src: &Path,\\n\\n path_new: Option<&Path>,\\n\\n retentions: &[Retention],\\n\\n x_files_factor: f32,\\n\\n aggregation_method: AggregationMethod,\\n\\n aggregate: bool,\\n\\n nobackup: bool,\\n\\n now: u32,\\n\\n) -> Result<(), Error> {\\n\\n let path_dst = match path_new {\\n\\n None => {\\n\\n let tmpfile = PathBuf::from(format!(\\\"{}.tmp\\\", path_src.display()));\\n\\n if tmpfile.is_file() {\\n\\n println!(\\n\\n \\\"Removing previous temporary database file: {}\\\",\\n\\n tmpfile.display()\\n\\n );\\n\\n remove_file(&tmpfile)?;\\n\\n }\\n\",\n \"file_path\": \"whisper/src/resize.rs\",\n \"rank\": 5,\n \"score\": 114835.86518919212\n },\n {\n \"content\": \"pub fn copy_test_file(temp_dir: &TempDir, filename: &str) -> PathBuf {\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n let tmp_file_path = temp_dir.path().join(filename);\\n\\n\\n\\n fs::copy(&file_path, &tmp_file_path).unwrap();\\n\\n\\n\\n tmp_file_path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/src/lib.rs\",\n \"rank\": 6,\n \"score\": 109909.69735819429\n },\n {\n \"content\": \"pub fn create_and_update_points(\\n\\n path: &PathBuf,\\n\\n points: &[Point],\\n\\n now: u32,\\n\\n) -> Result<WhisperFile, Box<dyn Error>> {\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 60,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n file.update_many(&points, now)?;\\n\\n\\n\\n Ok(file)\\n\\n}\\n\",\n \"file_path\": \"whisper_tests/src/lib.rs\",\n \"rank\": 7,\n \"score\": 107820.42367963331\n },\n {\n \"content\": \"pub fn create_and_update_many(\\n\\n path: &PathBuf,\\n\\n timestamps: &[u32],\\n\\n now: u32,\\n\\n) -> Result<WhisperFile, Box<dyn Error>> {\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 60,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n let points: Vec<Point> = timestamps\\n\\n .iter()\\n\\n .map(|interval| Point {\\n\\n interval: *interval,\\n\\n value: rand::random(),\\n\\n })\\n\\n .collect();\\n\\n\\n\\n file.update_many(&points, now)?;\\n\\n\\n\\n Ok(file)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/src/lib.rs\",\n \"rank\": 8,\n \"score\": 107820.42367963331\n },\n {\n \"content\": \"pub fn de_time_parse<'de, D>(deserializer: D) -> Result<u32, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n time_parse(String::deserialize(deserializer)?).map_err(serde::de::Error::custom)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/parse/time.rs\",\n \"rank\": 9,\n \"score\": 103851.42968592388\n },\n {\n \"content\": \"pub fn get_temp_dir() -> TempDir {\\n\\n Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .tempdir()\\n\\n .expect(\\\"Temp dir created\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/src/lib.rs\",\n \"rank\": 10,\n \"score\": 101462.9537054646\n },\n {\n \"content\": \"fn format_none(float: Option<f64>) -> String {\\n\\n match float {\\n\\n Some(x) => format!(\\\"{:.1}\\\", x),\\n\\n None => \\\"None\\\".to_string(),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for DiffArchiveInfo {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n for archive in &self.archives {\\n\\n if f.alternate() {\\n\\n writeln!(\\n\\n f,\\n\\n \\\"Archive {} ({} of {} datapoints differ)\\\",\\n\\n archive.index, archive.points, archive.total\\n\\n )?;\\n\\n writeln!(\\n\\n f,\\n\\n \\\"{:>7} {:>11} {:>13} {:>13}\\\",\\n\\n \\\"\\\", \\\"timestamp\\\", \\\"value_a\\\", \\\"value_b\\\"\\n\",\n \"file_path\": \"whisper/src/diff.rs\",\n \"rank\": 11,\n \"score\": 99953.44945209098\n },\n {\n \"content\": \"pub fn app_config(ctx: Context) -> impl Fn(&mut ServiceConfig) {\\n\\n move |config: &mut ServiceConfig| {\\n\\n config\\n\\n .app_data(ctx.clone())\\n\\n .service(resource(\\\"/render\\\").to(render_handler))\\n\\n .service(resource(\\\"/metrics/find\\\").to(find_handler))\\n\\n .service(resource(\\\"/metrics\\\").to(find_handler));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"diamond-api/src/application.rs\",\n \"rank\": 12,\n \"score\": 99567.44648528646\n },\n {\n \"content\": \"#[inline]\\n\\npub fn line_update<P: AsRef<Path>>(\\n\\n message: &str,\\n\\n dir: P,\\n\\n config: &WhisperConfig,\\n\\n now: u32,\\n\\n) -> Result<(), Box<dyn Error>> {\\n\\n let metric: MetricPoint = message.parse()?;\\n\\n let metric_path: MetricPath = metric.name.parse()?;\\n\\n\\n\\n let file_path = dir.as_ref().join(metric_path.0);\\n\\n\\n\\n let mut file = if file_path.exists() {\\n\\n WhisperFile::open(&file_path)?\\n\\n } else {\\n\\n let dir_path = file_path.parent().unwrap();\\n\\n fs::create_dir_all(&dir_path)?;\\n\\n\\n\\n WhisperBuilder::default()\\n\\n .add_retentions(&config.retentions)\\n\\n .x_files_factor(config.x_files_factor)\\n\\n .aggregation_method(config.aggregation_method)\\n\\n .build(&file_path)?\\n\\n };\\n\\n\\n\\n file.update(&metric.point, now)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond/src/lib.rs\",\n \"rank\": 13,\n \"score\": 99224.08309380221\n },\n {\n \"content\": \"pub fn random_string(len: usize) -> String {\\n\\n Alphanumeric.sample_string(&mut thread_rng(), len)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/src/lib.rs\",\n \"rank\": 14,\n \"score\": 97319.71507534919\n },\n {\n \"content\": \"#[inline]\\n\\npub fn update_silently(line: &str, conf: &Settings) {\\n\\n let now = SystemTime::now()\\n\\n .duration_since(UNIX_EPOCH)\\n\\n .unwrap()\\n\\n .as_secs() as u32;\\n\\n\\n\\n line_update(&line, &conf.db_path, &conf.whisper, now).unwrap_or_else(|e| eprintln!(\\\"{}\\\", e));\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use settings::{Net, WhisperConfig};\\n\\n use std::convert::From;\\n\\n use std::io;\\n\\n use std::net::IpAddr::V4;\\n\\n use std::path::{Path, PathBuf};\\n\\n use tempfile::Builder;\\n\\n use whisper::aggregation::AggregationMethod;\\n\\n use whisper::retention::Retention;\\n\",\n \"file_path\": \"diamond/src/lib.rs\",\n \"rank\": 15,\n \"score\": 95532.7581596298\n },\n {\n \"content\": \"pub fn parse_duration(s: &str) -> Result<u32, String> {\\n\\n lazy_static! {\\n\\n static ref RETENTION_DEF_RE: Regex = Regex::new(r#\\\"(?i)^\\\\s*(\\\\d+)([a-z]*)\\\\s*$\\\"#).unwrap();\\n\\n }\\n\\n\\n\\n let captures = RETENTION_DEF_RE\\n\\n .captures(s)\\n\\n .ok_or_else(|| format!(\\\"Invalid duration definition '{}'\\\", s))?;\\n\\n\\n\\n let mut precision = u32::from_str_radix(captures.get(1).unwrap().as_str(), 10).unwrap();\\n\\n if !captures.get(2).unwrap().as_str().is_empty() {\\n\\n precision *= get_unit_multiplier(captures.get(2).unwrap().as_str())?;\\n\\n }\\n\\n\\n\\n if precision == 0 {\\n\\n Err(\\\"Precision cannot be zero\\\".to_owned())\\n\\n } else {\\n\\n Ok(precision)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"whisper/src/retention.rs\",\n \"rank\": 16,\n \"score\": 93902.32954636353\n },\n {\n \"content\": \"pub fn time_parse(s: String) -> Result<u32, ParseError> {\\n\\n if s.starts_with('-') {\\n\\n // Relative time\\n\\n let (multi, count) = match &s.chars().last().unwrap() {\\n\\n 's' => (1, 1),\\n\\n 'h' => (3600, 1),\\n\\n 'd' => (3600 * 24, 1),\\n\\n 'w' => (3600 * 24 * 7, 1),\\n\\n 'y' => (3600 * 24 * 365, 1),\\n\\n 'n' if s.ends_with(\\\"min\\\") => (60, 3),\\n\\n 'n' if s.ends_with(\\\"mon\\\") => (3600 * 24 * 30, 3),\\n\\n _ => return Err(ParseError::Time),\\n\\n };\\n\\n\\n\\n let s2 = &s[1..s.len() - count];\\n\\n let now = SystemTime::now().duration_since(UNIX_EPOCH)?.as_secs() as u32;\\n\\n\\n\\n let v = now - s2.parse::<u32>()? * multi;\\n\\n Ok(v)\\n\\n } else {\\n\",\n \"file_path\": \"diamond-api/src/parse/time.rs\",\n \"rank\": 17,\n \"score\": 88849.37404166203\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"unix\\\"))]\\n\\npub fn fallocate(fd: &mut File, offset: usize, len: usize) -> Result<()> {\\n\\n use std::io::{Seek, SeekFrom, Write};\\n\\n\\n\\n fd.seek(SeekFrom::Start(offset as u64))?;\\n\\n let zeroes = [0u8; 16384];\\n\\n let mut remaining = len;\\n\\n while remaining > zeroes.len() {\\n\\n fd.write_all(&zeroes)?;\\n\\n remaining -= zeroes.len();\\n\\n }\\n\\n fd.write_all(&zeroes[0..remaining])?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"whisper/src/fallocate.rs\",\n \"rank\": 18,\n \"score\": 84715.47651211075\n },\n {\n \"content\": \"pub fn get_file_path(temp_dir: &TempDir, prefix: &str) -> PathBuf {\\n\\n let file_name = format!(\\\"{}_{}.wsp\\\", prefix, random_string(10));\\n\\n let mut path = temp_dir.path().to_path_buf();\\n\\n path.push(file_name);\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/src/lib.rs\",\n \"rank\": 19,\n \"score\": 84602.37508034328\n },\n {\n \"content\": \"fn points_to_values(points: &[Point], start: u32, step: u32) -> Vec<Option<f64>> {\\n\\n let mut values = Vec::with_capacity(points.len());\\n\\n for (i, point) in points.iter().enumerate() {\\n\\n if point.interval == start + (i as u32) * step {\\n\\n values.push(Some(point.value));\\n\\n } else {\\n\\n values.push(None);\\n\\n }\\n\\n }\\n\\n values\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 20,\n \"score\": 83816.8413023235\n },\n {\n \"content\": \"pub fn info(filename: &Path, daemon: Option<&Path>, noflush: bool) -> Result<Info, Error> {\\n\\n let mut c_args = Vec::<*const c_char>::new();\\n\\n\\n\\n let info_str = CString::new(\\\"info\\\").unwrap();\\n\\n c_args.push(info_str.as_ptr());\\n\\n\\n\\n let c_filename = CString::new(filename.to_str().unwrap().as_bytes()).unwrap();\\n\\n c_args.push(c_filename.as_ptr());\\n\\n\\n\\n if let Some(daemon_path) = daemon {\\n\\n let daemon_str = CString::new(\\\"--daemon\\\").unwrap();\\n\\n c_args.push(daemon_str.as_ptr());\\n\\n let c_daemon_path = CString::new(daemon_path.to_str().unwrap().as_bytes()).unwrap();\\n\\n c_args.push(c_daemon_path.as_ptr());\\n\\n }\\n\\n\\n\\n if noflush {\\n\\n let noflush_str = CString::new(\\\"--noflush\\\").unwrap();\\n\\n c_args.push(noflush_str.as_ptr());\\n\\n }\\n\",\n \"file_path\": \"rrd/src/lib.rs\",\n \"rank\": 21,\n \"score\": 79545.98394601604\n },\n {\n \"content\": \"pub fn fill(src: &Path, dst: &Path, from: u32, now: u32) -> Result<(), io::Error> {\\n\\n let mut start_from = from;\\n\\n let mut file_dst = WhisperFile::open(dst)?;\\n\\n\\n\\n let mut archives = file_dst.info().archives.clone();\\n\\n archives.sort_by_key(|a| a.retention());\\n\\n\\n\\n for archive in &archives {\\n\\n let from_time = now - archive.retention();\\n\\n\\n\\n if from_time >= start_from {\\n\\n continue;\\n\\n }\\n\\n\\n\\n let interval = Interval::new(from_time, start_from).unwrap();\\n\\n let data_dst = file_dst.fetch(archive.seconds_per_point, interval, now)?;\\n\\n\\n\\n let mut start = data_dst.from_interval;\\n\\n let end = data_dst.until_interval;\\n\\n let step = data_dst.step;\\n\",\n \"file_path\": \"whisper/src/fill.rs\",\n \"rank\": 22,\n \"score\": 78533.18504043702\n },\n {\n \"content\": \"pub trait Storage {\\n\\n fn find(\\n\\n &self,\\n\\n path_expression: &PathExpression,\\n\\n ) -> Result<Vec<MetricResponseLeaf>, ResponseError>;\\n\\n\\n\\n fn query(\\n\\n &self,\\n\\n path_expression: &PathExpression,\\n\\n interval: Interval,\\n\\n now: u64,\\n\\n ) -> Result<Vec<StorageResponse>, ResponseError>;\\n\\n}\\n\",\n \"file_path\": \"diamond-api/src/storage/storage.rs\",\n \"rank\": 23,\n \"score\": 65337.58809623959\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_sum_and_xfactor() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"info.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n fs::copy(&file_path, &path)?;\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap(), \\\"sum\\\", \\\"0.2\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"Updated aggregation method\\\").from_utf8())\\n\\n .stdout(predicate::str::contains(\\\"(average -> sum)\\\").from_utf8())\\n\\n .stdout(predicate::str::contains(\\\"0.2\\\").not().from_utf8());\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"whisper/tests/test-whisper-set-aggregation-method.rs\",\n \"rank\": 24,\n \"score\": 63308.4484557553\n },\n {\n \"content\": \"fn path_element_enum(input: &str) -> IResult<&str, Vec<String>, VerboseError<&str>> {\\n\\n delimited(\\n\\n c('{'),\\n\\n separated_list1(tag(\\\",\\\"), partial_path_element),\\n\\n c('}'),\\n\\n )(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 25,\n \"score\": 56231.67486242715\n },\n {\n \"content\": \"fn match_group_single(input: &str) -> IResult<&str, BTreeSet<char>, VerboseError<&str>> {\\n\\n let (input, single) = none_of(\\\"]\\\")(input)?;\\n\\n let group_single = [single].iter().cloned().collect();\\n\\n Ok((input, group_single))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 26,\n \"score\": 53974.08273540145\n },\n {\n \"content\": \"fn path_element_group(input: &str) -> IResult<&str, BTreeSet<char>, VerboseError<&str>> {\\n\\n let (input, _) = c('[')(input)?;\\n\\n let (input, start_dash) = opt(c('-'))(input)?;\\n\\n\\n\\n let (input, mut chars) = fold_many1(\\n\\n alt((match_group_range, match_group_single)),\\n\\n BTreeSet::new,\\n\\n |mut acc: BTreeSet<char>, chars: BTreeSet<char>| {\\n\\n acc.extend(chars);\\n\\n acc\\n\\n },\\n\\n )(input)?;\\n\\n\\n\\n let (input, end_dash) = opt(c('-'))(input)?;\\n\\n let (input, _) = c(']')(input)?;\\n\\n\\n\\n if start_dash.is_some() || end_dash.is_some() {\\n\\n chars.insert('-');\\n\\n }\\n\\n\\n\\n Ok((input, chars))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 27,\n \"score\": 53974.08273540145\n },\n {\n \"content\": \"fn match_group_range(input: &str) -> IResult<&str, BTreeSet<char>, VerboseError<&str>> {\\n\\n let (input, from_char) = none_of(\\\"]\\\")(input)?;\\n\\n let (input, _) = c('-')(input)?;\\n\\n let (input, to_char) = none_of(\\\"]\\\")(input)?;\\n\\n\\n\\n let range = ((from_char as u8)..=(to_char as u8))\\n\\n .map(|c| c as char)\\n\\n .collect();\\n\\n\\n\\n Ok((input, range))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 28,\n \"score\": 53974.08273540145\n },\n {\n \"content\": \"fn main() {\\n\\n #[cfg(target_os = \\\"freebsd\\\")]\\n\\n println!(\\\"cargo:rustc-link-search=native=/usr/local/lib\\\");\\n\\n println!(\\\"cargo:rustc-link-lib=rrd\\\");\\n\\n}\\n\",\n \"file_path\": \"rrd-sys/build.rs\",\n \"rank\": 29,\n \"score\": 49119.92117937884\n },\n {\n \"content\": \"fn main() {\\n\\n let args = Args::from_args();\\n\\n if let Err(err) = run(&args) {\\n\\n eprintln!(\\\"{}\\\", err);\\n\\n exit(1);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rrd2whisper/src/main.rs\",\n \"rank\": 30,\n \"score\": 49119.92117937884\n },\n {\n \"content\": \"fn fill_interval(\\n\\n src: &Path,\\n\\n dst: &Path,\\n\\n tstart: u32,\\n\\n tsuntil: u32,\\n\\n now: u32,\\n\\n) -> Result<(), io::Error> {\\n\\n let mut tstop = tsuntil;\\n\\n\\n\\n let mut file_src = WhisperFile::open(src)?;\\n\\n let mut file_dst = WhisperFile::open(dst)?;\\n\\n\\n\\n let mut archives = file_src.info().archives.clone();\\n\\n archives.sort_by_key(|a| a.retention());\\n\\n\\n\\n // find oldest point in time, stored by both files\\n\\n let src_time = now - file_src.info().max_retention;\\n\\n\\n\\n if (tstart < src_time) && (tstop < src_time) {\\n\\n return Ok(());\\n\",\n \"file_path\": \"whisper/src/fill.rs\",\n \"rank\": 31,\n \"score\": 47804.13866519788\n },\n {\n \"content\": \"fn migrate_points(\\n\\n path_src: &Path,\\n\\n path_dst: &Path,\\n\\n aggregate: bool,\\n\\n now: u32,\\n\\n) -> Result<(), Error> {\\n\\n if !path_src.is_file() {\\n\\n return Err(Error::FileNotExist(path_src.to_owned()).into());\\n\\n }\\n\\n\\n\\n if aggregate {\\n\\n println!(\\\"Migrating data with aggregation...\\\");\\n\\n migrate_aggregate(path_src, path_dst, now)?;\\n\\n } else {\\n\\n println!(\\\"Migrating data without aggregation...\\\");\\n\\n migrate_nonaggregate(path_src, path_dst, now)?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/src/resize.rs\",\n \"rank\": 32,\n \"score\": 47804.13866519788\n },\n {\n \"content\": \"fn file_update(\\n\\n fh: &mut fs::File,\\n\\n header: &WhisperMetadata,\\n\\n point: &Point,\\n\\n now: u32,\\n\\n) -> Result<(), io::Error> {\\n\\n let timestamp = point.interval;\\n\\n\\n\\n if now >= timestamp + header.max_retention || now < timestamp {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n \\\"Timestamp not covered by any archives in this database.\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n // Find the highest-precision archive that covers timestamp\\n\\n let archive_index = header\\n\\n .archives\\n\\n .iter()\\n\\n .position(|a| timestamp + a.retention() >= now)\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 33,\n \"score\": 47804.13866519788\n },\n {\n \"content\": \"fn points_to_data(\\n\\n points: &Option<Vec<Point>>,\\n\\n interval: Interval,\\n\\n seconds_per_point: u32,\\n\\n) -> ArchiveData {\\n\\n let values = match points {\\n\\n None => {\\n\\n let count = (interval.until() - interval.from()) / seconds_per_point;\\n\\n vec![None; count as usize]\\n\\n }\\n\\n Some(points) => points_to_values(&points, interval.from(), seconds_per_point),\\n\\n };\\n\\n\\n\\n ArchiveData {\\n\\n from_interval: interval.from(),\\n\\n until_interval: interval.until(),\\n\\n step: seconds_per_point,\\n\\n values,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 34,\n \"score\": 47804.13866519788\n },\n {\n \"content\": \"fn file_update_many(\\n\\n fh: &mut fs::File,\\n\\n header: &WhisperMetadata,\\n\\n points: &[Point],\\n\\n now: u32,\\n\\n) -> Result<(), io::Error> {\\n\\n let mut archive_index = 0;\\n\\n let mut current_points = vec![];\\n\\n\\n\\n for point in points {\\n\\n while point.interval + header.archives[archive_index].retention() < now {\\n\\n // We can't fit any more points in this archive\\n\\n if !current_points.is_empty() {\\n\\n // Commit all the points we've found that it can fit\\n\\n current_points.reverse(); // Put points in chronological order\\n\\n __archive_update_many(fh, &header, archive_index, ¤t_points)?;\\n\\n current_points.clear();\\n\\n }\\n\\n archive_index += 1;\\n\\n if archive_index >= header.archives.len() {\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 35,\n \"score\": 46583.64373679648\n },\n {\n \"content\": \"fn get_and_clear_error() -> Error {\\n\\n unsafe {\\n\\n let c_err = rrd_get_error();\\n\\n let error = Error(\\n\\n CStr::from_ptr(c_err)\\n\\n .to_str()\\n\\n .map_err(|e| Error(e.to_string()))\\n\\n .unwrap()\\n\\n .to_owned(),\\n\\n );\\n\\n rrd_clear_error();\\n\\n error\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rrd/src/lib.rs\",\n \"rank\": 36,\n \"score\": 44657.88359273298\n },\n {\n \"content\": \"fn current_time() -> u32 {\\n\\n let since_epoch = SystemTime::now().duration_since(UNIX_EPOCH).expect(\\\"Time\\\");\\n\\n since_epoch.as_secs() as u32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/benches/tests.rs\",\n \"rank\": 37,\n \"score\": 44657.88359273298\n },\n {\n \"content\": \"fn parse_template(\\n\\n source: Source,\\n\\n all_args: Option<Vec<(Option<String>, LiteralValue)>>,\\n\\n) -> Result<Template, String> {\\n\\n let (args, named_args) = split_args(all_args.unwrap_or_default()).ok_or_else(|| {\\n\\n format!(\\n\\n \\\"Bad call of template {:?}: positional argument after named one.\\\",\\n\\n source\\n\\n )\\n\\n })?;\\n\\n Ok(Template {\\n\\n source,\\n\\n args,\\n\\n named_args,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 38,\n \"score\": 44389.90881478431\n },\n {\n \"content\": \"fn call_args(\\n\\n input: &str,\\n\\n) -> IResult<&str, (String, Vec<(Option<String>, Arg)>), VerboseError<&str>> {\\n\\n let (input, function) = ident(input)?;\\n\\n let (input, _) = c('(')(input)?;\\n\\n let (input, all_args) = separated_list0(c(','), call_arg)(input)?;\\n\\n let (input, _) = c(')')(input)?;\\n\\n\\n\\n Ok((input, (function, all_args)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 39,\n \"score\": 44389.90881478431\n },\n {\n \"content\": \"fn template_internal(\\n\\n input: &str,\\n\\n) -> IResult<&str, (Source, Option<Vec<(Option<String>, LiteralValue)>>), VerboseError<&str>> {\\n\\n let (input, _) = tag(\\\"template\\\")(input)?;\\n\\n let (input, _) = tag(\\\"(\\\")(input)?;\\n\\n let (input, source) = source(input)?;\\n\\n\\n\\n let (input, all_args) =\\n\\n opt(preceded(tag(\\\",\\\"), separated_list1(tag(\\\",\\\"), template_arg)))(input)?;\\n\\n let (input, _) = tag(\\\")\\\")(input)?;\\n\\n\\n\\n Ok((input, (source, all_args)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"diamond-api/src/render_target/parser.rs\",\n \"rank\": 40,\n \"score\": 44389.90881478431\n },\n {\n \"content\": \"fn walk_tree(\\n\\n dir: &Path,\\n\\n path_prefix: &MetricName,\\n\\n path_words: &[PathWord],\\n\\n acc: &mut Vec<(MetricName, PathBuf)>,\\n\\n) -> Result<(), ResponseError> {\\n\\n match path_words.len() {\\n\\n 0 => {}\\n\\n 1 => {\\n\\n let regex = path_words[0].to_regex().map_err(|_| ResponseError::Path)?;\\n\\n for entry in fs::read_dir(&dir)? {\\n\\n let path = entry?.path();\\n\\n if let Some(file_name) = file_name(&path) {\\n\\n if regex.is_match(&file_name) {\\n\\n let storage_path = path_prefix.join(file_name);\\n\\n acc.push((storage_path, path));\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"diamond-api/src/storage/whisper_fs.rs\",\n \"rank\": 41,\n \"score\": 44389.90881478431\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_infoval() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_infoval>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(rrd_infoval))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_infoval>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(rrd_infoval))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_infoval>())).u_cnt as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(rrd_infoval),\\n\\n \\\"::\\\",\\n\\n stringify!(u_cnt)\\n\\n )\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 42,\n \"score\": 43400.51738399056\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_info_t() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_info_t>(),\\n\\n 40usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(rrd_info_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_info_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(rrd_info_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_info_t>())).key as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(rrd_info_t),\\n\\n \\\"::\\\",\\n\\n stringify!(key)\\n\\n )\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 43,\n \"score\": 43400.51738399056\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_blob_t() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_blob_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(rrd_blob_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_blob_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(rrd_blob_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_blob_t>())).size as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(rrd_blob_t),\\n\\n \\\"::\\\",\\n\\n stringify!(size)\\n\\n )\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 44,\n \"score\": 43400.51738399056\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_file_t() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_file_t>(),\\n\\n 40usize,\\n\\n \\\"Size of rrd_file_t\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_file_t>(),\\n\\n 8usize,\\n\\n \\\"Alignment of rrd_file_t\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_file_t>())).header_len as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(rrd_file_t),\\n\\n \\\"::\\\",\\n\\n stringify!(header_len)\\n\\n )\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 45,\n \"score\": 43400.51738399056\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_context() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_context>(),\\n\\n 4352usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(rrd_context))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_context>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(rrd_context))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_context>())).lib_errstr as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(rrd_context),\\n\\n \\\"::\\\",\\n\\n stringify!(lib_errstr)\\n\\n )\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 46,\n \"score\": 43400.51738399056\n },\n {\n \"content\": \"fn get_temp_dir() -> TempDir {\\n\\n Builder::new()\\n\\n .prefix(\\\"rrd\\\")\\n\\n .tempdir()\\n\\n .expect(\\\"Temp dir created\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rrd_tests/tests/fetch.rs\",\n \"rank\": 47,\n \"score\": 42609.95381770953\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_simple_file_t() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_simple_file_t>(),\\n\\n 4usize,\\n\\n \\\"Size of rrd_simple_file_t\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_simple_file_t>(),\\n\\n 4usize,\\n\\n \\\"Alignment of rrd_simple_file_t\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_simple_file_t>())).fd as *const _ as usize },\\n\\n 0usize,\\n\\n \\\"Offset of field rrd_simple_file_t::fd\\\"\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 48,\n \"score\": 42473.71183284797\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_rrd_time_value() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<rrd_time_value>(),\\n\\n 72usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(rrd_time_value))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<rrd_time_value>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(rrd_time_value))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<rrd_time_value>())).type_ as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(rrd_time_value),\\n\\n \\\"::\\\",\\n\\n stringify!(type_)\\n\\n )\\n\",\n \"file_path\": \"rrd-sys/src/tests.rs\",\n \"rank\": 49,\n \"score\": 42473.71183284797\n },\n {\n \"content\": \"fn write_archive<F: Write + Seek>(\\n\\n fh: &mut F,\\n\\n archive: &ArchiveInfo,\\n\\n points: &[Point],\\n\\n base_interval: u32,\\n\\n) -> Result<(), io::Error> {\\n\\n let point_size = 12;\\n\\n\\n\\n let first_interval = points[0].interval;\\n\\n\\n\\n let offset = instant_offset(archive, base_interval, first_interval);\\n\\n\\n\\n let available_tail_space = (archive.points - offset) as usize;\\n\\n\\n\\n if available_tail_space < points.len() {\\n\\n let (tail, head) = points.split_at(available_tail_space);\\n\\n\\n\\n fh.seek(io::SeekFrom::Start(\\n\\n (archive.offset + offset * point_size).into(),\\n\\n ))?;\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 50,\n \"score\": 42257.39168814495\n },\n {\n \"content\": \"fn read_archive<R: Read + Seek>(\\n\\n fh: &mut R,\\n\\n archive: &ArchiveInfo,\\n\\n from_index: u32,\\n\\n until_index: u32,\\n\\n) -> Result<Vec<Point>, io::Error> {\\n\\n let from_index = from_index % archive.points;\\n\\n let until_index = until_index % archive.points;\\n\\n\\n\\n let mut series =\\n\\n Vec::with_capacity(((archive.points + until_index - from_index) % archive.points) as usize);\\n\\n\\n\\n let point_size = 12;\\n\\n let from_offset = archive.offset + from_index * point_size;\\n\\n\\n\\n fh.seek(io::SeekFrom::Start(from_offset.into()))?;\\n\\n if from_index < until_index {\\n\\n // If we don't wrap around the archive\\n\\n for _i in from_index..until_index {\\n\\n series.push(Point::read(fh)?);\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 51,\n \"score\": 42257.39168814495\n },\n {\n \"content\": \"fn __propagate<F: Read + Write + Seek>(\\n\\n fh: &mut F,\\n\\n header: &WhisperMetadata,\\n\\n timestamp: u32,\\n\\n higher: &ArchiveInfo,\\n\\n lower: &ArchiveInfo,\\n\\n) -> Result<bool, io::Error> {\\n\\n let lower_interval_start = timestamp - (timestamp % lower.seconds_per_point);\\n\\n\\n\\n fh.seek(io::SeekFrom::Start(higher.offset.into()))?;\\n\\n let higher_base = Point::read(fh)?;\\n\\n\\n\\n let higher_first_index = instant_offset(higher, higher_base.interval, lower_interval_start);\\n\\n\\n\\n let higher_last_index = {\\n\\n let higher_points = lower.seconds_per_point / higher.seconds_per_point;\\n\\n (higher_first_index + higher_points) % higher.points\\n\\n };\\n\\n\\n\\n let series = read_archive(fh, higher, higher_first_index, higher_last_index)?;\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 52,\n \"score\": 41683.0399814578\n },\n {\n \"content\": \"fn archive_fetch_interval<R: Read + Seek>(\\n\\n fh: &mut R,\\n\\n archive: &ArchiveInfo,\\n\\n interval: Interval,\\n\\n) -> Result<Option<Vec<Point>>, io::Error> {\\n\\n let base = archive.read_base(fh)?;\\n\\n if base.interval == 0 {\\n\\n Ok(None)\\n\\n } else {\\n\\n let from_index = instant_offset(archive, base.interval, interval.from());\\n\\n let until_index = instant_offset(archive, base.interval, interval.until());\\n\\n let points = read_archive(fh, &archive, from_index, until_index)?;\\n\\n Ok(Some(points))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 53,\n \"score\": 41268.0002573512\n },\n {\n \"content\": \"fn random_string(len: usize) -> String {\\n\\n Alphanumeric.sample_string(&mut thread_rng(), len)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rrd_tests/tests/fetch.rs\",\n \"rank\": 54,\n \"score\": 41268.0002573512\n },\n {\n \"content\": \"fn test_create(bench: &mut Bencher) {\\n\\n let temp_dir = get_temp_dir();\\n\\n let mut index = 1;\\n\\n let i = &mut index;\\n\\n bench.iter(|| {\\n\\n let path = get_file_path(&temp_dir, \\\"whisper_create\\\");\\n\\n create_file(&path).expect(\\\"creating\\\");\\n\\n *i += 1;\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/benches/tests.rs\",\n \"rank\": 55,\n \"score\": 41268.0002573512\n },\n {\n \"content\": \"fn test_update(bench: &mut Bencher) {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"whisper_update\\\");\\n\\n let mut file = create_file(&path).expect(\\\"Create file for update\\\");\\n\\n\\n\\n let mut current_value = 0.5;\\n\\n let i = &mut current_value;\\n\\n let now = current_time();\\n\\n\\n\\n bench.iter(|| {\\n\\n for j in 0..SECONDS_AGO {\\n\\n file.update(\\n\\n &Point {\\n\\n interval: now - SECONDS_AGO + j,\\n\\n value: *i,\\n\\n },\\n\\n now,\\n\\n )\\n\\n .expect(\\\"update\\\");\\n\\n *i += VALUE_STEP;\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/benches/tests.rs\",\n \"rank\": 56,\n \"score\": 41268.0002573512\n },\n {\n \"content\": \"fn test_fetch(bench: &mut Bencher) {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"whisper_fetch\\\");\\n\\n let mut file = create_file(&path).expect(\\\"Create file for fetching\\\");\\n\\n\\n\\n let mut current_value = 0.5;\\n\\n let now = current_time();\\n\\n\\n\\n for j in 0..SECONDS_AGO {\\n\\n file.update(\\n\\n &Point {\\n\\n interval: now - SECONDS_AGO + j,\\n\\n value: current_value,\\n\\n },\\n\\n now,\\n\\n )\\n\\n .expect(\\\"update\\\");\\n\\n current_value += VALUE_STEP;\\n\\n }\\n\\n\\n\\n let from_time = now - SECONDS_AGO;\\n\\n let until_time = from_time + 1000;\\n\\n let interval = Interval::new(from_time, until_time).expect(\\\"interval\\\");\\n\\n bench.iter(|| {\\n\\n let seconds_per_point = file.suggest_archive(interval, now).expect(\\\"Archive\\\");\\n\\n file.fetch(seconds_per_point, interval, now).expect(\\\"fetch\\\");\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/benches/tests.rs\",\n \"rank\": 57,\n \"score\": 41268.0002573512\n },\n {\n \"content\": \"fn test_update_fetch(bench: &mut Bencher) {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"whisper_update\\\");\\n\\n let mut file = create_file(&path).expect(\\\"Create file for update\\\");\\n\\n\\n\\n let mut current_value = 0.5;\\n\\n let i = &mut current_value;\\n\\n let now = current_time();\\n\\n\\n\\n let from_time = now - SECONDS_AGO;\\n\\n let until_time = from_time + 1000;\\n\\n let interval = Interval::new(from_time, until_time).expect(\\\"interval\\\");\\n\\n bench.iter(|| {\\n\\n for j in 0..SECONDS_AGO {\\n\\n file.update(\\n\\n &Point {\\n\\n interval: now - SECONDS_AGO + j,\\n\\n value: *i,\\n\\n },\\n\\n now,\\n\",\n \"file_path\": \"whisper_tests/benches/tests.rs\",\n \"rank\": 58,\n \"score\": 40341.19470620861\n },\n {\n \"content\": \"fn write_archive_point<F: Read + Write + Seek>(\\n\\n fh: &mut F,\\n\\n archive: &ArchiveInfo,\\n\\n point: &Point,\\n\\n) -> Result<(), io::Error> {\\n\\n let base = archive.read_base(fh)?;\\n\\n let index = instant_offset(archive, base.interval, point.interval);\\n\\n fh.seek(io::SeekFrom::Start(\\n\\n (archive.offset + index * POINT_SIZE as u32).into(),\\n\\n ))?;\\n\\n point.write(fh)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 59,\n \"score\": 39766.84299952147\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(clippy::unreadable_literal)]\\n\\nfn issue8_many() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"issue8\\\");\\n\\n\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 60,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n file.update_many(\\n\\n &[Point {\\n\\n interval: 1528240818,\\n\\n value: 123.0,\\n\\n }],\\n\\n 1528240900,\\n\\n )?;\\n\\n\\n\\n let points = file.dump(60)?;\\n\\n assert_eq!(points[0].interval, 1528240800);\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper_tests/tests/issue8.rs\",\n \"rank\": 60,\n \"score\": 39766.84299952147\n },\n {\n \"content\": \"#[test]\\n\\nfn issue22_original() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"issue22\\\");\\n\\n\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 1,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n let now = 1000;\\n\\n\\n\\n file.update(\\n\\n &Point {\\n\\n interval: now - 1,\\n\\n value: 100.0,\\n\\n },\\n\\n now,\\n\\n )?;\\n\",\n \"file_path\": \"whisper_tests/tests/issue22.rs\",\n \"rank\": 61,\n \"score\": 39766.84299952147\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(clippy::unreadable_literal)]\\n\\nfn issue8_single() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"issue8\\\");\\n\\n\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 60,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n file.update(\\n\\n &Point {\\n\\n interval: 1528240818,\\n\\n value: 123.0,\\n\\n },\\n\\n 1528240900,\\n\\n )?;\\n\\n\\n\\n let points = file.dump(60)?;\\n\\n assert_eq!(points[0].interval, 1528240800);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"whisper_tests/tests/issue8.rs\",\n \"rank\": 62,\n \"score\": 39766.84299952147\n },\n {\n \"content\": \"fn __archive_update_many<F: Read + Write + Seek>(\\n\\n fh: &mut F,\\n\\n header: &WhisperMetadata,\\n\\n archive_index: usize,\\n\\n points: &[Point],\\n\\n) -> Result<(), io::Error> {\\n\\n let archive = &header.archives[archive_index];\\n\\n\\n\\n let aligned_points: Vec<Point> = points\\n\\n .iter()\\n\\n .map(|p| p.align(archive.seconds_per_point))\\n\\n .collect();\\n\\n\\n\\n let chunks: Vec<Vec<Point>> = pack_points(&aligned_points, archive.seconds_per_point);\\n\\n\\n\\n // Read base point and determine where our writes will start\\n\\n let base = archive.read_base(fh)?;\\n\\n\\n\\n let base_interval = if base.interval == 0 {\\n\\n // This file's first update\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 63,\n \"score\": 39766.84299952147\n },\n {\n \"content\": \"fn adjust_instant_up(instant: u32, step: u32) -> u32 {\\n\\n (instant + step - 1) / step * step\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 64,\n \"score\": 39245.105957990614\n },\n {\n \"content\": \"fn get_unit_multiplier(s: &str) -> Result<u32, String> {\\n\\n if s.is_empty() || \\\"seconds\\\".starts_with(s) {\\n\\n Ok(1)\\n\\n } else if \\\"minutes\\\".starts_with(s) {\\n\\n Ok(60)\\n\\n } else if \\\"hours\\\".starts_with(s) {\\n\\n Ok(3600)\\n\\n } else if \\\"days\\\".starts_with(s) {\\n\\n Ok(86400)\\n\\n } else if \\\"weeks\\\".starts_with(s) {\\n\\n Ok(86400 * 7)\\n\\n } else if \\\"years\\\".starts_with(s) {\\n\\n Ok(86400 * 365)\\n\\n } else {\\n\\n Err(format!(\\\"Invalid unit '{}'\\\", s))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Copy)]\\n\\npub struct Retention {\\n\",\n \"file_path\": \"whisper/src/retention.rs\",\n \"rank\": 65,\n \"score\": 39245.105957990614\n },\n {\n \"content\": \"fn adjust_instant(instant: u32, step: u32) -> u32 {\\n\\n instant - (instant % step)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/src/lib.rs\",\n \"rank\": 66,\n \"score\": 39245.105957990614\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_help() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"--help\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"USAGE\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"whisper/tests/test-whisper-fetch.rs\",\n \"rank\": 67,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_as_json() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"info.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n fs::copy(&file_path, &path)?;\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap(), \\\"--json\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\n\\n predicate::str::contains(\\n\",\n \"file_path\": \"whisper/tests/test-whisper-info.rs\",\n \"rank\": 68,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_help() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"--help\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"USAGE\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-info.rs\",\n \"rank\": 69,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(clippy::unreadable_literal)]\\n\\nfn test_update_snapshot() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"update_snapshot\\\");\\n\\n\\n\\n {\\n\\n WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 1,\\n\\n points: 10,\\n\\n })\\n\\n .build(path.clone())?;\\n\\n }\\n\\n\\n\\n let header = Vec::new()\\n\\n .u32(1) // aggregation method\\n\\n .u32(10) // max retention\\n\\n .f32(0.5) // x files factor\\n\\n .u32(1) // archives\\n\\n // archive info\\n\\n .u32(28) // offset\\n\",\n \"file_path\": \"whisper_tests/tests/update.rs\",\n \"rank\": 70,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_as_plain() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"dump.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n fs::copy(&file_path, &path)?;\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap()])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\n\\n predicate::str::contains(\\n\",\n \"file_path\": \"whisper/tests/test-whisper-dump.rs\",\n \"rank\": 71,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn test_read_rrd() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"read_rrd\\\");\\n\\n\\n\\n Command::new(\\\"rrdtool\\\")\\n\\n .arg(\\\"create\\\")\\n\\n .arg(&path)\\n\\n .args(&[\\\"--step\\\", \\\"300\\\"])\\n\\n .arg(\\\"DS:temp:GAUGE:600:-273:5000\\\")\\n\\n .arg(\\\"RRA:AVERAGE:0.5:1:1200\\\")\\n\\n .arg(\\\"RRA:MIN:0.6:12:2400\\\")\\n\\n .arg(\\\"RRA:MAX:0.7:12:2400\\\")\\n\\n .arg(\\\"RRA:AVERAGE:0.8:12:2400\\\")\\n\\n .status()?;\\n\\n\\n\\n let rrd_info = rrd::info(&path, None, false)?;\\n\\n\\n\\n let info: HashMap<String, rrd::Value> = rrd_info.iter().collect();\\n\\n let seconds_per_pdp = info[\\\"step\\\"].as_long().unwrap();\\n\\n assert_eq!(seconds_per_pdp, 300);\\n\",\n \"file_path\": \"rrd_tests/tests/fetch.rs\",\n \"rank\": 72,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_help() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"--help\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"USAGE\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-dump.rs\",\n \"rank\": 73,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_as_pretty() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"dump.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n fs::copy(&file_path, &path)?;\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap(), \\\"--time-format\\\", \\\"%c\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\n\\n predicate::str::contains(\\n\",\n \"file_path\": \"whisper/tests/test-whisper-dump.rs\",\n \"rank\": 74,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_help() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"--help\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"USAGE\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"whisper/tests/test-whisper-resize.rs\",\n \"rank\": 75,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn issue22_many_archives() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"issue22_many\\\");\\n\\n\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 2,\\n\\n points: 10,\\n\\n })\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 4,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n let now = 1000;\\n\\n\\n\\n for item in (2..18).step_by(2) {\\n\\n let delta = 18 - item;\\n\\n file.update(\\n\",\n \"file_path\": \"whisper_tests/tests/issue22.rs\",\n \"rank\": 76,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn issue22_many_archives_once() -> Result<(), Box<dyn Error>> {\\n\\n let temp_dir = get_temp_dir();\\n\\n let path = get_file_path(&temp_dir, \\\"issue22_many\\\");\\n\\n\\n\\n let mut file = WhisperBuilder::default()\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 2,\\n\\n points: 10,\\n\\n })\\n\\n .add_retention(Retention {\\n\\n seconds_per_point: 4,\\n\\n points: 10,\\n\\n })\\n\\n .build(path)?;\\n\\n\\n\\n let now = 1000;\\n\\n\\n\\n file.update_many(\\n\\n &[\\n\\n Point {\\n\",\n \"file_path\": \"whisper_tests/tests/issue22.rs\",\n \"rank\": 77,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_as_plain() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"info.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n fs::copy(&file_path, &path)?;\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap()])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\n\\n predicate::str::contains(\\n\",\n \"file_path\": \"whisper/tests/test-whisper-info.rs\",\n \"rank\": 78,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_help() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"--help\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"USAGE\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-create.rs\",\n \"rank\": 79,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"fn validate_archive_list(archives: &[Retention]) -> Result<(), BuilderError> {\\n\\n for (i, pair) in archives.windows(2).enumerate() {\\n\\n let archive = &pair[0];\\n\\n let next_archive = &pair[1];\\n\\n\\n\\n if archive.seconds_per_point >= next_archive.seconds_per_point {\\n\\n return Err(BuilderError::SamePrecision(i, *archive, *next_archive));\\n\\n }\\n\\n\\n\\n if next_archive.seconds_per_point % archive.seconds_per_point != 0 {\\n\\n return Err(BuilderError::UndividablePrecision(\\n\\n i,\\n\\n *archive,\\n\\n *next_archive,\\n\\n ));\\n\\n }\\n\\n\\n\\n let retention = archive.retention();\\n\\n let next_retention = next_archive.retention();\\n\\n\\n\",\n \"file_path\": \"whisper/src/builder.rs\",\n \"rank\": 80,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_help() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"--help\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"USAGE\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-update.rs\",\n \"rank\": 81,\n \"score\": 38896.8669074688\n },\n {\n \"content\": \"fn run(args: &Args) -> Result<(), Box<dyn Error>> {\\n\\n let now = SystemTime::now().duration_since(UNIX_EPOCH)?.as_secs();\\n\\n\\n\\n let rrd_info = rrd::info(&args.rrd_path, None, false).unwrap();\\n\\n\\n\\n let info: HashMap<String, rrd::Value> = rrd_info.iter().collect();\\n\\n\\n\\n let seconds_per_pdp = &info[\\\"step\\\"].as_long().unwrap();\\n\\n\\n\\n let rras = rrd_info.rras();\\n\\n\\n\\n let datasources = rrd_info.datasources();\\n\\n\\n\\n // Grab the archive configuration\\n\\n let relevant_rras: Vec<_> = rras\\n\\n .iter()\\n\\n .filter(|rra| rra.cf == args.aggregation_method)\\n\\n .collect();\\n\\n\\n\\n if relevant_rras.is_empty() {\\n\",\n \"file_path\": \"rrd2whisper/src/main.rs\",\n \"rank\": 82,\n \"score\": 38769.07041755324\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .assert()\\n\\n .code(1)\\n\\n .stdout(\\\"\\\")\\n\\n .stderr(predicate::str::contains(\\\"USAGE\\\").from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-dump.rs\",\n \"rank\": 83,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_creating_simple() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"info.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap(), \\\"60:1440\\\"])\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(predicate::str::contains(\\\"Created: \\\").from_utf8())\\n\\n .stdout(predicate::str::contains(path.to_str().unwrap()).from_utf8())\\n\\n .stdout(predicate::str::contains(\\\"(17308 bytes)\\\").from_utf8())\\n\\n .stderr(\\\"\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-create.rs\",\n \"rank\": 84,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_value() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"invalid\\\", \\\"1:value\\\"])\\n\\n .assert()\\n\\n .code(1);\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"whisper/tests/test-whisper-update.rs\",\n \"rank\": 85,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_as_plain_for_unknown() -> Result<(), Box<dyn Error>> {\\n\\n let filename = \\\"info.wsp\\\";\\n\\n\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(filename)\\n\\n .tempdir()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let file_path = PathBuf::new().join(\\\"data\\\").join(filename);\\n\\n\\n\\n fs::copy(&file_path, &path)?;\\n\\n\\n\\n let error = \\\"Unknown field \\\\\\\"unknown\\\\\\\". Valid fields are maxRetention, xFilesFactor, aggregationMethod, archives, fileSize\\\";\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap(), \\\"unknown\\\"])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error).from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-info.rs\",\n \"rank\": 86,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\\n\\n #[cfg(unix)]\\n\\n let error_msg = \\\"No such file or directory (os error 2)\\\";\\n\\n #[cfg(windows)]\\n\\n let error_msg = \\\"The system cannot find the file specified. (os error 2)\\\";\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"invalid\\\"])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error_msg).from_utf8());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-dump.rs\",\n \"rank\": 87,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\\n\\n #[cfg(unix)]\\n\\n let error_msg = \\\"No such file or directory (os error 2)\\\";\\n\\n #[cfg(windows)]\\n\\n let error_msg = \\\"The system cannot find the file specified. (os error 2)\\\";\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"invalid\\\"])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error_msg).from_utf8());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-info.rs\",\n \"rank\": 88,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .assert()\\n\\n .code(1)\\n\\n .stdout(\\\"\\\")\\n\\n .stderr(predicate::str::contains(\\\"USAGE\\\").from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-create.rs\",\n \"rank\": 89,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .assert()\\n\\n .code(1)\\n\\n .stdout(\\\"\\\")\\n\\n .stderr(predicate::str::contains(\\\"USAGE\\\").from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-fetch.rs\",\n \"rank\": 90,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .assert()\\n\\n .code(1)\\n\\n .stdout(\\\"\\\")\\n\\n .stderr(predicate::str::contains(\\\"USAGE\\\").from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-resize.rs\",\n \"rank\": 91,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\\n\\n #[cfg(unix)]\\n\\n let error_msg = \\\"No such file or directory (os error 2)\\\";\\n\\n #[cfg(windows)]\\n\\n let error_msg = \\\"The system cannot find the file specified. (os error 2)\\\";\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"invalid\\\", \\\"1:1\\\"])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error_msg).from_utf8());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-update.rs\",\n \"rank\": 92,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .assert()\\n\\n .code(1)\\n\\n .stdout(\\\"\\\")\\n\\n .stderr(predicate::str::contains(\\\"USAGE\\\").from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-update.rs\",\n \"rank\": 93,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_timestamp() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"invalid\\\", \\\"nottimestamp:1\\\"])\\n\\n .assert()\\n\\n .code(1);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-update.rs\",\n \"rank\": 94,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_path() -> Result<(), Box<dyn Error>> {\\n\\n #[cfg(unix)]\\n\\n let error_msg = \\\"No such file or directory (os error 2)\\\";\\n\\n #[cfg(windows)]\\n\\n let error_msg = \\\"The system cannot find the path specified. (os error 3)\\\";\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\\"invalid/path\\\", \\\"60:1440\\\"])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error_msg).from_utf8());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-create.rs\",\n \"rank\": 95,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_method() -> Result<(), Box<dyn Error>> {\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(\\\"info.wsp\\\")\\n\\n .tempfile()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let error =\\n\\n \\\"error: Invalid value for '--aggregationMethod <aggregation-method>': Unsupported aggregation method 'unknown'\\\";\\n\\n\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[\\n\\n path.to_str().unwrap(),\\n\\n \\\"60:1440\\\",\\n\\n \\\"--aggregationMethod\\\",\\n\\n \\\"unknown\\\",\\n\\n ])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error).from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-create.rs\",\n \"rank\": 96,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_with_invalid_xfactor() -> Result<(), Box<dyn Error>> {\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"whisper\\\")\\n\\n .suffix(\\\"info.wsp\\\")\\n\\n .tempfile()?\\n\\n .path()\\n\\n .to_path_buf();\\n\\n\\n\\n let error = \\\"error: Invalid value for '--xFilesFactor <x-files-factor>': invalid float literal\\\";\\n\\n\\n\\n // TODO: validate nan as invalid value\\n\\n Command::cargo_bin(NAME)?\\n\\n .args(&[path.to_str().unwrap(), \\\"60:1440\\\", \\\"--xFilesFactor\\\", \\\"nano\\\"])\\n\\n .assert()\\n\\n .code(1)\\n\\n .stderr(predicate::str::contains(error).from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-create.rs\",\n \"rank\": 97,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_without_args() -> Result<(), Box<dyn Error>> {\\n\\n Command::cargo_bin(NAME)?\\n\\n .assert()\\n\\n .code(1)\\n\\n .stdout(\\\"\\\")\\n\\n .stderr(predicate::str::contains(\\\"USAGE\\\").from_utf8());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"whisper/tests/test-whisper-info.rs\",\n \"rank\": 98,\n \"score\": 38078.64879389722\n },\n {\n \"content\": \"use super::*;\\n\\nuse crate::interval::Interval;\\n\\nuse std::fmt;\\n\\nuse std::io;\\n\\nuse std::path::Path;\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]\\n\\npub struct DiffPoint {\\n\\n #[serde(rename = \\\"timestamp\\\")]\\n\\n pub interval: u32,\\n\\n #[serde(rename = \\\"value_a\\\")]\\n\\n pub value1: Option<f64>,\\n\\n #[serde(rename = \\\"value_b\\\")]\\n\\n pub value2: Option<f64>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\\npub struct DiffArchive {\\n\\n #[serde(rename = \\\"archive\\\")]\\n\\n pub index: usize,\\n\",\n \"file_path\": \"whisper/src/diff.rs\",\n \"rank\": 99,\n \"score\": 21.811678259990707\n }\n]","isConversational":false}}},{"rowIdx":1177,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/algorithms/leaky_bucket.rs"},"repo_name":{"kind":"string","value":"jbg/ratelimit_meter"},"commit":{"kind":"string","value":"df4d7a3f9b26dffe4468ad2b05a512589296dd64"},"file_code":{"kind":"string","value":"\n\nuse crate::lib::*;\nuse crate::thread_safety::ThreadsafeWrapper;\nuse crate::{\n algorithms::{Algorithm, RateLimitState, RateLimitStateWithClock},\n instant, InconsistentCapacity, NegativeMultiDecision, NonConformance,\n};\n\n#[derive(Debug, Clone, Eq, PartialEq)]\npub struct LeakyBucket<P: instant::Relative = instant::TimeSource> {\n full: Duration,\n token_interval: Duration,\n point: PhantomData<P>,\n}\n\n#[derive(Debug, Eq, PartialEq, Clone)]\npub struct State<P: instant::Relative>(ThreadsafeWrapper<BucketState<P>>);\n\nimpl<P: instant::Relative> Default for State<P> {\n fn default() -> Self {\n State(Default::default())\n }\n}\n\nimpl<P: instant::Relative> RateLimitState<LeakyBucket<P>, P> for State<P> {}\n\nimpl<P: instant::Absolute> RateLimitStateWithClock<LeakyBucket<P>, P> for State<P> {\n fn last_touched(&self, _params: &LeakyBucket<P>) -> P {\n let data = self.0.snapshot();\n data.last_update.unwrap_or_else(P::now) + data.level\n }\n}\n\n#[cfg(feature = \"std\")]\nmod std {\n use crate::instant::Relative;\n use evmap::ShallowCopy;\n\n impl<P: Relative> ShallowCopy for super::State<P> {\n unsafe fn shallow_copy(&mut self) -> Self {\n super::State(self.0.shallow_copy())\n }\n }\n}\n\n#[derive(Debug, PartialEq)]\npub struct TooEarly<P: instant::Relative>(P, Duration);\n\nimpl<P: instant::Relative> fmt::Display for TooEarly<P> {\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n write!(f, \"rate-limited until {:?}\", self.0 + self.1)\n }\n}\n\nimpl<P: instant::Relative> NonConformance<P> for TooEarly<P> {\n #[inline]\n fn earliest_possible(&self) -> P {\n self.0 + self.1\n }\n}\n\n#[derive(Debug, Clone, PartialEq, Eq)]\nstruct BucketState<P: instant::Relative> {\n level: Duration,\n last_update: Option<P>,\n}\n\nimpl<P: instant::Relative> Default for BucketState<P> {\n fn default() -> Self {\n BucketState {\n level: Duration::new(0, 0),\n last_update: None,\n }\n }\n}\n\nimpl<P: instant::Relative> Algorithm<P> for LeakyBucket<P> {\n type BucketState = State<P>;\n\n type NegativeDecision = TooEarly<P>;\n\n fn construct(\n capacity: NonZeroU32,\n cell_weight: NonZeroU32,\n per_time_unit: Duration,\n ) -> Result<Self, InconsistentCapacity> {\n if capacity < cell_weight {\n return Err(InconsistentCapacity::new(capacity, cell_weight));\n }\n let token_interval = (per_time_unit * cell_weight.get()) / capacity.get();\n Ok(LeakyBucket {\n full: per_time_unit,\n token_interval,\n point: PhantomData,\n })\n }\n\n fn test_n_and_update(\n &self,\n state: &Self::BucketState,\n n: u32,\n t0: P,\n ) -> Result<(), NegativeMultiDecision<TooEarly<P>>> {\n let full = self.full;\n let weight = self.token_interval * n;\n if weight > self.full {\n return Err(NegativeMultiDecision::InsufficientCapacity(n));\n }\n state.0.measure_and_replace(|state| {\n let mut new = BucketState {\n last_update: Some(t0),\n level: Duration::new(0, 0),\n };\n let last = state.last_update.unwrap_or(t0);\n \n \n \n let t0 = cmp::max(t0, last);\n \n \n new.level = state.level - cmp::min(t0.duration_since(last), state.level);\n if weight + new.level <= full {\n new.level += weight;\n (Ok(()), Some(new))\n } else {\n let wait_period = (weight + new.level) - full;\n (\n Err(NegativeMultiDecision::BatchNonConforming(\n n,\n TooEarly(t0, wait_period),\n )),\n None,\n )\n }\n })\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::lib::*;\nuse crate::thread_safety::ThreadsafeWrapper;\nuse crate::{\n algorithms::{Algorithm, RateLimitState, RateLimitStateWithClock},\n instant, InconsistentCapacity, NegativeMultiDecision, NonConformance,\n};\n\n#[derive(Debug, Clone, Eq, PartialEq)]\npub struct LeakyBucket<P: instant::Relative = instant::TimeSource> {\n full: Duration,\n token_interval: Duration,\n point: PhantomData<P>,\n}\n\n#[derive(Debug, Eq, PartialEq, Clone)]\npub struct State<P: instant::Relative>(ThreadsafeWrapper<BucketState<P>>);\n\nimpl<P: instant::Relative> Default for State<P> {\n fn default() -> Self {\n State(Default::default())\n }\n}\n\nimpl<P: instant::Relative> RateLimitState<LeakyBucket<P>, P> for State<P> {}\n\nimpl<P: instant::Absolute> RateLimitStateWithClock<LeakyBucket<P>, P> for State<P> {\n fn last_touched(&self, _params: &LeakyBucket<P>) -> P {\n let data = self.0.snapshot();\n data.last_update.unwrap_or_else(P::now) + data.level\n }\n}\n\n#[cfg(feature = \"std\")]\nmod std {\n use crate::instant::Relative;\n use evmap::ShallowCopy;\n\n impl<P: Relative> ShallowCopy for super::State<P> {\n unsafe fn shallow_copy(&mut self) -> Self {\n super::State(self.0.shallow_copy())\n }\n }\n}\n\n#[derive(Debug, PartialEq)]\npub struct TooEarly<P: instant::Relative>(P, Duration);\n\nimpl<P: instant::Relative> fmt::Display for TooEarly<P> {\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n write!(f, \"rate-limited until {:?}\", self.0 + self.1)\n }\n}\n\nimpl<P: instant::Relative> NonConformance<P> for TooEarly<P> {\n #[inline]\n fn earliest_possible(&self) -> P {\n self.0 + self.1\n }\n}\n\n#[derive(Debug, Clone, PartialEq, Eq)]\nstruct BucketState<P: instant::Relative> {\n level: Duration,\n last_update: Option<P>,\n}\n\nimpl<P: instant::R"},"suffix":{"kind":"string","value":"(per_time_unit * cell_weight.get()) / capacity.get();\n Ok(LeakyBucket {\n full: per_time_unit,\n token_interval,\n point: PhantomData,\n })\n }\n\n fn test_n_and_update(\n &self,\n state: &Self::BucketState,\n n: u32,\n t0: P,\n ) -> Result<(), NegativeMultiDecision<TooEarly<P>>> {\n let full = self.full;\n let weight = self.token_interval * n;\n if weight > self.full {\n return Err(NegativeMultiDecision::InsufficientCapacity(n));\n }\n state.0.measure_and_replace(|state| {\n let mut new = BucketState {\n last_update: Some(t0),\n level: Duration::new(0, 0),\n };\n let last = state.last_update.unwrap_or(t0);\n \n \n \n let t0 = cmp::max(t0, last);\n \n \n new.level = state.level - cmp::min(t0.duration_since(last), state.level);\n if weight + new.level <= full {\n new.level += weight;\n (Ok(()), Some(new))\n } else {\n let wait_period = (weight + new.level) - full;\n (\n Err(NegativeMultiDecision::BatchNonConforming(\n n,\n TooEarly(t0, wait_period),\n )),\n None,\n )\n }\n })\n }\n}\n"},"middle":{"kind":"string","value":"elative> Default for BucketState<P> {\n fn default() -> Self {\n BucketState {\n level: Duration::new(0, 0),\n last_update: None,\n }\n }\n}\n\nimpl<P: instant::Relative> Algorithm<P> for LeakyBucket<P> {\n type BucketState = State<P>;\n\n type NegativeDecision = TooEarly<P>;\n\n fn construct(\n capacity: NonZeroU32,\n cell_weight: NonZeroU32,\n per_time_unit: Duration,\n ) -> Result<Self, InconsistentCapacity> {\n if capacity < cell_weight {\n return Err(InconsistentCapacity::new(capacity, cell_weight));\n }\n let token_interval = "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Trait that all rate limit states have to implement around\n\n/// housekeeping in keyed rate limiters.\n\npub trait RateLimitState<P, I: instant::Relative>: Default + Send + Sync + Eq + fmt::Debug {}\n\n\n","file_path":"src/algorithms.rs","rank":0,"score":139496.12516807122},{"content":"#[derive(Debug, Eq, PartialEq, Clone)]\n\nstruct Tat<P: instant::Relative>(Option<P>);\n\n\n\nimpl<P: instant::Relative> Default for Tat<P> {\n\n fn default() -> Self {\n\n Tat(None)\n\n }\n\n}\n\n\n\n/// The GCRA's state about a single rate limiting history.\n\n#[derive(Debug, Eq, PartialEq, Clone)]\n\npub struct State<P: instant::Relative>(ThreadsafeWrapper<Tat<P>>);\n\n\n\nimpl<P: instant::Relative> Default for State<P> {\n\n fn default() -> Self {\n\n State(Default::default())\n\n }\n\n}\n\n\n\nimpl<P: instant::Relative> RateLimitState<GCRA<P>, P> for State<P> {}\n\n\n","file_path":"src/algorithms/gcra.rs","rank":1,"score":124157.37552766272},{"content":"/// The trait that implementations of metered rate-limiter algorithms\n\n/// have to implement.\n\n///\n\n/// Implementing structures are expected to represent the \"parameters\"\n\n/// (e.g., the allowed requests/s), and keep the information necessary\n\n/// to make a decision, e.g. concrete usage statistics for an\n\n/// in-memory rate limiter, in the associated structure\n\n/// [`BucketState`](#associatedtype.BucketState).\n\npub trait Algorithm<P: instant::Relative = instant::TimeSource>:\n\n Send + Sync + Sized + fmt::Debug\n\n{\n\n /// The state of a single rate limiting bucket.\n\n ///\n\n /// Every new rate limiting state is initialized as `Default`. The\n\n /// states must be safe to share across threads (this crate uses a\n\n /// `parking_lot` Mutex to allow that).\n\n type BucketState: RateLimitState<Self, P>;\n\n\n\n /// The type returned when a rate limiting decision for a single\n\n /// cell is negative. Each rate limiting algorithm can decide to\n\n /// return the type that suits it best, but most algorithms'\n\n /// decisions also implement\n\n /// [`NonConformance`](trait.NonConformance.html), to ease\n\n /// handling of how long to wait.\n\n type NegativeDecision: PartialEq + fmt::Display + fmt::Debug + Send + Sync;\n\n\n\n /// Constructs a rate limiter with the given parameters:\n\n /// `capacity` is the number of cells to allow, weighing\n","file_path":"src/algorithms.rs","rank":2,"score":117515.92745916202},{"content":"/// Trait that all rate limit states implement if there is a real-time\n\n/// clock available.\n\npub trait RateLimitStateWithClock<P, I: instant::Absolute>: RateLimitState<P, I> {\n\n /// Returns the last time instant that the state had any relevance\n\n /// (i.e. the rate limiter would behave exactly as if it was a new\n\n /// rate limiter after this time).\n\n ///\n\n /// If the state has not been touched for a given amount of time,\n\n /// the keyed rate limiter will expire it.\n\n ///\n\n /// # Thread safety\n\n /// This uses a bucket state snapshot to determine eligibility;\n\n /// race conditions can occur.\n\n fn last_touched(&self, params: &P) -> I;\n\n}\n\n\n\n#[cfg(feature = \"std\")]\n\nmod std {\n\n use crate::instant;\n\n use evmap::ShallowCopy;\n\n\n","file_path":"src/algorithms.rs","rank":3,"score":116724.11369812317},{"content":"/// Provides additional information about non-conforming cells, most\n\n/// importantly the earliest time until the next cell could be\n\n/// considered conforming.\n\n///\n\n/// Since this does not account for effects like thundering herds,\n\n/// users should always add random jitter to the times given.\n\npub trait NonConformance<P: instant::Relative = instant::TimeSource> {\n\n /// Returns the earliest time at which a decision could be\n\n /// conforming (excluding conforming decisions made by the Decider\n\n /// that are made in the meantime).\n\n fn earliest_possible(&self) -> P;\n\n\n\n /// Returns the minimum amount of time from the time that the\n\n /// decision was made (relative to the `at` argument in a\n\n /// `Decider`'s `check_at` method) that must pass before a\n\n /// decision can be conforming. Since Durations can not be\n\n /// negative, a zero duration is returned if `from` is already\n\n /// after that duration.\n\n fn wait_time_from(&self, from: P) -> Duration {\n\n let earliest = self.earliest_possible();\n\n earliest.duration_since(earliest.min(from))\n\n }\n\n}\n\n\n","file_path":"src/algorithms.rs","rank":5,"score":115208.94038735001},{"content":"pub fn bench_all(c: &mut Criterion) {\n\n let id = \"algorithm/no_op\";\n\n\n\n let bm = Benchmark::new(id, move |b| {\n\n let algo = AlgorithmForTest::<Allower, Always>::default();\n\n let now = Always::now();\n\n let ms = Duration::from_millis(20);\n\n let state = algo.state();\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(algo.check(&state, now + (ms * i)).is_ok());\n\n });\n\n })\n\n .throughput(Throughput::Elements(1));\n\n c.bench(id, bm);\n\n}\n","file_path":"benches/no_op.rs","rank":6,"score":114628.35866274267},{"content":"pub fn bench_all(c: &mut Criterion) {\n\n bench_plain_algorithm_1elem(c);\n\n bench_plain_algorithm_multi(c);\n\n}\n\n\n","file_path":"benches/algorithms.rs","rank":7,"score":114628.35866274267},{"content":"pub trait NonConformanceExt<P: instant::Absolute>: NonConformance<P> {\n\n /// Returns the minimum amount of time (down to 0) that needs to\n\n /// pass from the current instant for the Decider to consider a\n\n /// cell conforming again.\n\n fn wait_time(&self) -> Duration {\n\n self.wait_time_from(P::now())\n\n }\n\n}\n\n\n\nimpl<P: instant::Absolute, T> NonConformanceExt<P> for T where T: NonConformance<P> {}\n\n\n","file_path":"src/algorithms.rs","rank":8,"score":113106.80373277623},{"content":"pub fn bench_all(c: &mut Criterion) {\n\n bench_direct(c);\n\n bench_keyed(c);\n\n}\n\n\n","file_path":"benches/single_threaded.rs","rank":9,"score":111481.45522854674},{"content":"pub fn bench_all(c: &mut Criterion) {\n\n bench_direct(c);\n\n bench_keyed(c);\n\n}\n\n\n","file_path":"benches/multi_threaded.rs","rank":10,"score":111481.45522854674},{"content":"/// Returns a \"current\" moment that's suitable for tests.\n\npub fn current_moment() -> instant::TimeSource {\n\n #[cfg(feature = \"std\")]\n\n return Instant::now();\n\n\n\n #[cfg(not(feature = \"std\"))]\n\n return Duration::from_secs(90);\n\n}\n","file_path":"src/test_utilities.rs","rank":11,"score":109358.07062296395},{"content":" /// Trait implemented by all rate limit states that are compatible\n\n /// with the KeyedRateLimiters.\n\n pub trait KeyableRateLimitState<P, I: instant::Absolute>:\n\n super::RateLimitStateWithClock<P, I> + ShallowCopy\n\n {\n\n }\n\n\n\n #[cfg(feature = \"std\")]\n\n impl<T, P, I> KeyableRateLimitState<P, I> for T\n\n where\n\n T: super::RateLimitStateWithClock<P, I> + ShallowCopy,\n\n I: instant::Absolute,\n\n {\n\n }\n\n}\n\n\n\n#[cfg(feature = \"std\")]\n\npub use self::std::*;\n","file_path":"src/algorithms.rs","rank":12,"score":105479.9741761017},{"content":"fn bench_keyed(c: &mut Criterion) {\n\n let id = \"multi_threaded/keyed\";\n\n\n\n let bm = ParameterizedBenchmark::new(\n\n id,\n\n |b, ref v| {\n\n bench_with_variants!(v, lim: KeyedBucket, {\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(20);\n\n let mut children = vec![];\n\n\n\n for _i in 0..19 {\n\n let mut lim = lim.clone();\n\n let mut b = b.clone();\n\n children.push(thread::spawn(move || {\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(lim.check_at(i % 100, now + (ms * i)).is_ok());\n\n });\n","file_path":"benches/multi_threaded.rs","rank":13,"score":75033.94699496083},{"content":"fn bench_keyed(c: &mut Criterion) {\n\n let id = \"single_threaded/keyed\";\n\n let bm = ParameterizedBenchmark::new(\n\n id,\n\n move |b, ref v| {\n\n bench_with_variants!(v, rl: KeyedBucket, {\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(20);\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(rl.check_at(i % 100, now + (ms * i)).is_ok());\n\n });\n\n });\n\n },\n\n Variant::ALL,\n\n )\n\n .throughput(|_s| Throughput::Elements(1));\n\n c.bench(id, bm);\n\n}\n","file_path":"benches/single_threaded.rs","rank":14,"score":75033.94699496083},{"content":"fn bench_direct(c: &mut Criterion) {\n\n let id = \"single_threaded/direct\";\n\n let bm = ParameterizedBenchmark::new(\n\n id,\n\n move |b, ref v| {\n\n bench_with_variants!(v, rl: DirectBucket, {\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(20);\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(rl.check_at(now + (ms * i)).is_ok());\n\n });\n\n });\n\n },\n\n Variant::ALL,\n\n )\n\n .throughput(|_s| Throughput::Elements(1));\n\n c.bench(id, bm);\n\n}\n\n\n","file_path":"benches/single_threaded.rs","rank":15,"score":75033.94699496083},{"content":"fn bench_direct(c: &mut Criterion) {\n\n let id = \"multi_threaded/direct\";\n\n\n\n let bm = ParameterizedBenchmark::new(\n\n id,\n\n |b, ref v| {\n\n bench_with_variants!(v, lim: DirectBucket, {\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(20);\n\n let mut children = vec![];\n\n\n\n for _i in 0..19 {\n\n let mut lim = lim.clone();\n\n let mut b = b.clone();\n\n children.push(thread::spawn(move || {\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(lim.check_at(now + (ms * i)).is_ok());\n\n });\n","file_path":"benches/multi_threaded.rs","rank":16,"score":75033.94699496083},{"content":"/// A point in time that is used as a reference for measuring a rate\n\n/// limit. On the clock, it has meaning only relative to some other point in time.\n\n///\n\n/// When using `no_std`, users of this crate are expected to provide\n\n/// an impl of `Relative` that corresponds to their system's time source.\n\npub trait Relative:\n\n Sized\n\n + Sub<Duration, Output = Self>\n\n + Add<Duration, Output = Self>\n\n + PartialEq\n\n + Eq\n\n + Ord\n\n + Copy\n\n + Clone\n\n + Send\n\n + Sync\n\n + Debug\n\n{\n\n /// Returns the amount of time elapsed from an earlier point in time.\n\n fn duration_since(&self, earlier: Self) -> Duration;\n\n}\n\n\n","file_path":"src/instant.rs","rank":17,"score":73695.49256833472},{"content":"fn bench_plain_algorithm_1elem(c: &mut Criterion) {\n\n let id = \"algorithm/1\";\n\n let bm = ParameterizedBenchmark::new(\n\n id,\n\n move |b, ref v| {\n\n bench_with_algorithm_variants!(v, algo, {\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(20);\n\n let state = algo.state();\n\n\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(algo.check(&state, now + (ms * i)).is_ok());\n\n });\n\n });\n\n },\n\n Variant::ALL,\n\n )\n\n .throughput(|_s| Throughput::Elements(1));\n\n c.bench(id, bm);\n\n}\n\n\n","file_path":"benches/algorithms.rs","rank":18,"score":73118.24639956064},{"content":"fn bench_plain_algorithm_multi(c: &mut Criterion) {\n\n let id = \"algorithm/multi\";\n\n let elements: u32 = 10;\n\n let bm = ParameterizedBenchmark::new(\n\n id,\n\n move |b, ref v| {\n\n bench_with_algorithm_variants!(v, algo, {\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(20);\n\n let state = algo.state();\n\n\n\n let mut i = 0;\n\n b.iter(|| {\n\n i += 1;\n\n black_box(algo.check_n(&state, elements, now + (ms * i)).is_ok());\n\n });\n\n });\n\n },\n\n Variant::ALL,\n\n )\n\n .throughput(|_s| Throughput::Elements(1));\n\n c.bench(id, bm);\n\n}\n","file_path":"benches/algorithms.rs","rank":19,"score":73118.24639956064},{"content":"/// A point in time as given by a source of time. It is assumed to be\n\n/// monotonically moving forward.\n\npub trait Absolute: Relative {\n\n /// Returns the current moment in time, as given by the time\n\n /// source.\n\n fn now() -> Self;\n\n}\n\n\n\n#[cfg(feature = \"std\")]\n\nmod std {\n\n use std::time::{Duration, Instant};\n\n\n\n impl super::Relative for Instant {\n\n fn duration_since(&self, earlier: Self) -> Duration {\n\n self.duration_since(earlier)\n\n }\n\n }\n\n\n\n impl super::Absolute for Instant {\n\n #[inline]\n\n fn now() -> Self {\n\n Instant::now()\n","file_path":"src/instant.rs","rank":20,"score":69378.26417382841},{"content":"#[test]\n\nfn nonconformance_wait_time_from() {\n\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n gcra.test_and_update(&state, now).unwrap();\n\n gcra.test_and_update(&state, now).unwrap();\n\n if let Err(failure) = gcra.test_and_update(&state, now) {\n\n assert_eq!(ms * 2000, failure.wait_time_from(now));\n\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 2000));\n\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 2001));\n\n } else {\n\n assert!(false, \"Second attempt should fail\");\n\n }\n\n}\n","file_path":"tests/gcra.rs","rank":21,"score":67048.10666363464},{"content":"struct LeakCheck {\n\n usage_before: i64,\n\n n_iter: usize,\n\n}\n\n\n\nimpl Drop for LeakCheck {\n\n fn drop(&mut self) {\n\n let usage_after = resident_memsize();\n\n assert!(\n\n usage_after <= self.usage_before + LEAK_TOLERANCE,\n\n \"Plausible memory leak!\\nAfter {} iterations, usage before: {}, usage after: {}\",\n\n self.n_iter,\n\n self.usage_before,\n\n usage_after\n\n );\n\n }\n\n}\n\n\n\nimpl LeakCheck {\n\n fn new(n_iter: usize) -> Self {\n\n LeakCheck {\n\n n_iter,\n\n usage_before: resident_memsize(),\n\n }\n\n }\n\n}\n\n\n","file_path":"tests/memory.rs","rank":22,"score":50558.59703728661},{"content":"#[test]\n\nfn expiration() {\n\n let ms = Duration::from_millis(1);\n\n let now = Instant::now();\n\n let then = now + ms * 2000; // two seconds later\n\n\n\n fn make_bucket<'a>() -> KeyedRateLimiter<&'a str> {\n\n let ms = Duration::from_millis(1);\n\n let now = Instant::now();\n\n let mut lim = KeyedRateLimiter::<&str>::new(nonzero!(1u32), Duration::from_secs(1));\n\n lim.check_at(\"foo\", now).unwrap();\n\n lim.check_at(\"bar\", now + ms * 200).unwrap();\n\n lim.check_at(\"baz\", now + ms * 800).unwrap();\n\n lim\n\n }\n\n\n\n // clean up all keys that are indistinguishable from unoccupied keys:\n\n let mut lim = make_bucket();\n\n let mut removed = lim.cleanup_at(None, then);\n\n removed.sort();\n\n assert_eq!(vec![\"bar\", \"baz\", \"foo\"], removed);\n","file_path":"tests/keyed.rs","rank":23,"score":43383.07841204845},{"content":"#[test]\n\nfn actual_threadsafety() {\n\n let gcra = GCRA::construct(nonzero!(20u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();\n\n\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n let mut children = vec![];\n\n\n\n gcra.test_and_update(&state, now).unwrap();\n\n for _i in 0..20 {\n\n let state = state.clone();\n\n let gcra = gcra.clone();\n\n children.push(thread::spawn(move || {\n\n gcra.test_and_update(&state, now).unwrap();\n\n }));\n\n }\n\n for child in children {\n\n child.join().unwrap();\n\n }\n\n assert_ne!(Ok(()), gcra.test_and_update(&state, now + ms * 2));\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms * 1000));\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":24,"score":42025.238489357966},{"content":"#[test]\n\nfn allows_after_interval() {\n\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();;\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n gcra.test_and_update(&state, now).unwrap();\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms));\n\n assert_ne!(Ok(()), gcra.test_and_update(&state, now + ms * 2));\n\n // should be ok again in 1s:\n\n let next = now + Duration::from_secs(1);\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, next));\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":25,"score":42025.238489357966},{"content":"#[test]\n\nfn actual_threadsafety() {\n\n let mut lim = KeyedRateLimiter::<&str, GCRA>::new(nonzero!(20u32), Duration::from_secs(1));\n\n let now = Instant::now();\n\n let ms = Duration::from_millis(1);\n\n let mut children = vec![];\n\n\n\n lim.check_at(\"foo\", now).unwrap();\n\n for _i in 0..20 {\n\n let mut lim = lim.clone();\n\n children.push(thread::spawn(move || {\n\n lim.check_at(\"foo\", now).unwrap();\n\n }));\n\n }\n\n for child in children {\n\n child.join().unwrap();\n\n }\n\n assert!(!lim.check_at(\"foo\", now + ms * 2).is_ok());\n\n assert_eq!(Ok(()), lim.check_at(\"foo\", now + ms * 1000));\n\n}\n","file_path":"tests/keyed.rs","rank":26,"score":42025.238489357966},{"content":"#[test]\n\nfn memleak_gcra() {\n\n let mut bucket = DirectRateLimiter::<GCRA>::build_with_capacity(nonzero!(1_000_000u32))\n\n .build()\n\n .unwrap();\n\n let leak_check = LeakCheck::new(500_000);\n\n\n\n for _i in 0..leak_check.n_iter {\n\n drop(bucket.check());\n\n }\n\n}\n\n\n","file_path":"tests/memory.rs","rank":27,"score":42025.238489357966},{"content":"#[test]\n\nfn rejects_too_many() {\n\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();;\n\n let now = current_moment();\n\n gcra.test_and_update(&state, now).unwrap();\n\n gcra.test_and_update(&state, now).unwrap();\n\n assert_ne!(\n\n Ok(()),\n\n gcra.test_and_update(&state, now),\n\n \"{:?} {:?}\",\n\n &state,\n\n &gcra\n\n );\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":28,"score":42025.238489357966},{"content":"#[test]\n\nfn allows_n_after_interval() {\n\n let gcra = GCRA::construct(nonzero!(2u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();;\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n assert_eq!(Ok(()), gcra.test_n_and_update(&state, 2, now));\n\n assert!(!gcra.test_n_and_update(&state, 2, now + ms).is_ok());\n\n // should be ok again in 1.5s:\n\n let next = now + Duration::from_secs(1);\n\n assert_eq!(\n\n Ok(()),\n\n gcra.test_n_and_update(&state, 2, next),\n\n \"now: {:?}\",\n\n next\n\n );\n\n\n\n // should always accommodate 0 cells:\n\n assert_eq!(Ok(()), gcra.test_n_and_update(&state, 0, next));\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":29,"score":42025.238489357966},{"content":"#[test]\n\nfn memleak_leakybucket() {\n\n let mut bucket = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(1_000_000u32));\n\n let leak_check = LeakCheck::new(500_000);\n\n\n\n for _i in 0..leak_check.n_iter {\n\n drop(bucket.check());\n\n }\n\n}\n\n\n","file_path":"tests/memory.rs","rank":30,"score":42025.238489357966},{"content":"#[test]\n\nfn actual_threadsafety() {\n\n let mut lim = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(20u32));\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n let mut children = vec![];\n\n\n\n lim.check_at(now).unwrap();\n\n for _i in 0..20 {\n\n let mut lim = lim.clone();\n\n children.push(thread::spawn(move || lim.check_at(now).is_ok()));\n\n }\n\n for child in children {\n\n child.join().unwrap();\n\n }\n\n assert!(!lim.check_at(now + ms * 2).is_ok());\n\n assert_eq!(Ok(()), lim.check_at(now + ms * 1000));\n\n}\n\n\n","file_path":"tests/leaky_bucket.rs","rank":31,"score":40794.88990300173},{"content":"#[test]\n\nfn accepts_first_cell() {\n\n let gcra = GCRA::construct(nonzero!(5u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();;\n\n let now = current_moment();\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now));\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":32,"score":40794.88990300173},{"content":"#[test]\n\nfn memleak_gcra_threaded() {\n\n let bucket = DirectRateLimiter::<GCRA>::build_with_capacity(nonzero!(1_000_000u32))\n\n .build()\n\n .unwrap();\n\n let leak_check = LeakCheck::new(5_000);\n\n\n\n for _i in 0..leak_check.n_iter {\n\n let mut bucket = bucket.clone();\n\n thread::spawn(move || drop(bucket.check())).join().unwrap();\n\n }\n\n}\n\n\n","file_path":"tests/memory.rs","rank":33,"score":40794.88990300173},{"content":"#[test]\n\nfn correct_wait_time() {\n\n // Bucket adding a new element per 200ms:\n\n let gcra = GCRA::construct(nonzero!(5u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();\n\n let mut now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n let mut conforming = 0;\n\n for _i in 0..20 {\n\n now += ms;\n\n let res = gcra.test_and_update(&state, now);\n\n match res {\n\n Ok(()) => {\n\n conforming += 1;\n\n }\n\n Err(wait) => {\n\n now += wait.wait_time_from(now);\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now));\n\n conforming += 1;\n\n }\n\n }\n\n }\n\n assert_eq!(20, conforming);\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":34,"score":40794.88990300173},{"content":"#[test]\n\nfn memleak_gcra_multi() {\n\n let mut bucket = DirectRateLimiter::<GCRA>::build_with_capacity(nonzero!(1_000_000u32))\n\n .build()\n\n .unwrap();\n\n let leak_check = LeakCheck::new(500_000);\n\n\n\n for _i in 0..leak_check.n_iter {\n\n drop(bucket.check_n(2));\n\n }\n\n}\n\n\n","file_path":"tests/memory.rs","rank":35,"score":40794.88990300173},{"content":"#[test]\n\nfn memleak_leakybucket_threaded() {\n\n let bucket = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(1_000_000u32));\n\n let leak_check = LeakCheck::new(5_000);\n\n\n\n for _i in 0..leak_check.n_iter {\n\n let mut bucket = bucket.clone();\n\n thread::spawn(move || drop(bucket.check())).join().unwrap();\n\n }\n\n}\n","file_path":"tests/memory.rs","rank":36,"score":40794.88990300173},{"content":"#[test]\n\nfn rejects_too_many() {\n\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(2u32));\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n assert_eq!(Ok(()), lb.check_at(now));\n\n assert_eq!(Ok(()), lb.check_at(now));\n\n\n\n assert_ne!(Ok(()), lb.check_at(now + ms * 2));\n\n\n\n // should be ok again in 1s:\n\n let next = now + Duration::from_millis(1002);\n\n assert_eq!(Ok(()), lb.check_at(next));\n\n assert_eq!(Ok(()), lb.check_at(next + ms));\n\n\n\n assert_ne!(Ok(()), lb.check_at(next + ms * 2), \"{:?}\", lb);\n\n}\n\n\n","file_path":"tests/leaky_bucket.rs","rank":37,"score":40794.88990300173},{"content":"#[test]\n\nfn correctly_handles_per() {\n\n let ms = Duration::from_millis(1);\n\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), ms * 20).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();;\n\n let now = current_moment();\n\n\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now));\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms));\n\n assert!(!gcra.test_and_update(&state, now + ms * 10).is_ok());\n\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms * 20));\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":38,"score":40794.88990300173},{"content":"#[test]\n\nfn never_allows_more_than_capacity() {\n\n let ms = Duration::from_millis(1);\n\n let gcra = GCRA::construct(nonzero!(5u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <GCRA as Algorithm>::BucketState::default();\n\n let now = current_moment();\n\n\n\n // Should not allow the first 15 cells on a capacity 5 bucket:\n\n assert!(gcra.test_n_and_update(&state, 15, now).is_err());\n\n\n\n // After 3 and 20 seconds, it should not allow 15 on that bucket either:\n\n assert!(gcra\n\n .test_n_and_update(&state, 15, now + (ms * 3 * 1000))\n\n .is_err());\n\n\n\n let result = gcra.test_n_and_update(&state, 15, now + (ms * 20 * 1000));\n\n match result {\n\n Err(NegativeMultiDecision::InsufficientCapacity(n)) => assert_eq!(n, 15),\n\n _ => panic!(\"Did not expect {:?}\", result),\n\n }\n\n}\n\n\n","file_path":"tests/gcra.rs","rank":39,"score":40794.88990300173},{"content":"#[test]\n\nfn tooearly_wait_time_from() {\n\n let lim =\n\n LeakyBucket::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\n\n let state = <LeakyBucket as Algorithm>::BucketState::default();\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n lim.test_and_update(&state, now).unwrap();\n\n if let Err(failure) = lim.test_and_update(&state, now) {\n\n assert_eq!(ms * 1000, failure.wait_time_from(now));\n\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 1000));\n\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 2001));\n\n } else {\n\n assert!(false, \"Second attempt should fail\");\n\n }\n\n}\n","file_path":"tests/leaky_bucket.rs","rank":40,"score":39674.88204212858},{"content":"#[test]\n\nfn correct_wait_time() {\n\n // Bucket adding a new element per 200ms:\n\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\n\n let mut now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n let mut conforming = 0;\n\n for _i in 0..20 {\n\n now += ms;\n\n let res = lb.check_at(now);\n\n match res {\n\n Ok(()) => {\n\n conforming += 1;\n\n }\n\n Err(wait) => {\n\n now += wait.wait_time_from(now);\n\n assert_eq!(Ok(()), lb.check_at(now));\n\n conforming += 1;\n\n }\n\n }\n\n }\n\n assert_eq!(20, conforming);\n\n}\n\n\n","file_path":"tests/leaky_bucket.rs","rank":41,"score":39674.88204212858},{"content":"#[test]\n\nfn never_allows_more_than_capacity() {\n\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n\n\n // Should not allow the first 15 cells on a capacity 5 bucket:\n\n assert_ne!(Ok(()), lb.check_n_at(15, now));\n\n\n\n // After 3 and 20 seconds, it should not allow 15 on that bucket either:\n\n assert_ne!(Ok(()), lb.check_n_at(15, now + (ms * 3 * 1000)));\n\n let result = lb.check_n_at(15, now + (ms * 20 * 1000));\n\n match result {\n\n Err(NegativeMultiDecision::InsufficientCapacity(n)) => assert_eq!(n, 15),\n\n _ => panic!(\"Did not expect {:?}\", result),\n\n }\n\n}\n\n\n","file_path":"tests/leaky_bucket.rs","rank":42,"score":39674.88204212858},{"content":"#[test]\n\nfn accepts_first_cell() {\n\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\n\n assert_eq!(Ok(()), lb.check_at(current_moment()));\n\n}\n\n\n","file_path":"tests/leaky_bucket.rs","rank":43,"score":39674.88204212858},{"content":"#[test]\n\nfn prevents_time_travel() {\n\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\n\n let now = current_moment();\n\n let ms = Duration::from_millis(1);\n\n\n\n assert!(lb.check_at(now).is_ok());\n\n assert!(lb.check_at(now - ms).is_ok());\n\n assert!(lb.check_at(now - ms * 500).is_ok());\n\n}\n\n\n","file_path":"tests/leaky_bucket.rs","rank":44,"score":39674.88204212858},{"content":"#[test]\n\nfn different_states_per_key() {\n\n let mut lim = KeyedRateLimiter::<&str>::new(nonzero!(1u32), Duration::from_secs(1));\n\n let ms = Duration::from_millis(1);\n\n let now = Instant::now();\n\n assert_eq!(Ok(()), lim.check_at(\"foo\", now + ms));\n\n assert_eq!(Ok(()), lim.check_at(\"bar\", now + ms));\n\n assert_eq!(Ok(()), lim.check_at(\"baz\", now + ms));\n\n\n\n assert_ne!(Ok(()), lim.check_at(\"foo\", now + ms * 3), \"{:?}\", lim);\n\n assert_ne!(Ok(()), lim.check_at(\"bar\", now + ms * 3), \"{:?}\", lim);\n\n assert_ne!(Ok(()), lim.check_at(\"baz\", now + ms * 3), \"{:?}\", lim);\n\n}\n\n\n","file_path":"tests/keyed.rs","rank":45,"score":39674.88204212858},{"content":"fn resident_memsize() -> i64 {\n\n let mut out: libc::rusage = unsafe { std::mem::zeroed() };\n\n assert!(unsafe { libc::getrusage(libc::RUSAGE_SELF, &mut out) } == 0);\n\n out.ru_maxrss\n\n}\n\n\n\nconst LEAK_TOLERANCE: i64 = 1024 * 1024 * 10;\n\n\n","file_path":"tests/memory.rs","rank":46,"score":39220.26010447035},{"content":"type MapWriteHandle<K, P, A, H> =\n\n Arc<Mutex<WriteHandle<K, <A as Algorithm<P>>::BucketState, (), H>>>;\n\n\n\n/// An in-memory rate limiter that regulates a single rate limit for\n\n/// multiple keys.\n\n///\n\n/// Keyed rate limiters can be used to e.g. enforce a per-IP address\n\n/// or a per-customer request limit on the server side.\n\n///\n\n/// This implementation of the keyed rate limiter uses\n\n/// [`evmap`](../../../evmap/index.html), a read lock-free, concurrent\n\n/// hash map. Addition of new keys (e.g. a new customer making their\n\n/// first request) is synchronized and happens one at a time (it\n\n/// synchronizes writes to minimize the effects from `evmap`'s\n\n/// eventually consistent behavior on key addition), while reads of\n\n/// existing keys all happen simultaneously, then get synchronized by\n\n/// the rate limiting algorithm itself.\n\n///\n\n/// ```\n\n/// # use std::num::NonZeroU32;\n","file_path":"src/state/keyed.rs","rank":47,"score":37306.38464417921},{"content":"use crate::lib::*;\n\n\n\n/// The default time representation in use by rate limiters. To\n\n/// override it, pass a different `P` type argument to the algorithm\n\n/// and rate limiter bucket.\n\n///\n\n/// ## When using `std`\n\n/// The default time source is `Instant` when using std.\n\n///\n\n/// ## When using `no_std`\n\n/// In situations where `std` is not available, the fallback default\n\n/// time source is Duration. It only allows comparisons to a relative,\n\n/// fixed, point in time. Users are expected to determine that point\n\n/// in time and stick to it.\n\n#[cfg(feature = \"std\")]\n\npub type TimeSource = Instant;\n\n#[cfg(not(feature = \"std\"))]\n\npub type TimeSource = Duration;\n\n\n\n/// A point in time that is used as a reference for measuring a rate\n\n/// limit. On the clock, it has meaning only relative to some other point in time.\n\n///\n\n/// When using `no_std`, users of this crate are expected to provide\n\n/// an impl of `Relative` that corresponds to their system's time source.\n","file_path":"src/instant.rs","rank":48,"score":30060.91376934474},{"content":" }\n\n }\n\n\n\n use std::time::SystemTime;\n\n\n\n impl super::Relative for SystemTime {\n\n /// Returns the difference in times between the two\n\n /// SystemTimes. Due to the fallible nature of SystemTimes,\n\n /// returns the zero duration if a negative duration would\n\n /// result (e.g. due to system clock adjustments).\n\n fn duration_since(&self, earlier: Self) -> Duration {\n\n self.duration_since(earlier)\n\n .unwrap_or_else(|_| Duration::new(0, 0))\n\n }\n\n }\n\n\n\n impl super::Absolute for SystemTime {\n\n #[inline]\n\n fn now() -> Self {\n\n SystemTime::now()\n","file_path":"src/instant.rs","rank":49,"score":30054.390020360617},{"content":" }\n\n }\n\n}\n\n\n\nimpl Relative for Duration {\n\n fn duration_since(&self, earlier: Self) -> Duration {\n\n *self - earlier\n\n }\n\n}\n","file_path":"src/instant.rs","rank":50,"score":30046.95033589908},{"content":"[](https://travis-ci.org/antifuchs/ratelimit_meter) [](https://docs.rs/ratelimit_meter/) [](https://crates.io/crates/ratelimit_meter)\n\n\n\n# Rate-Limiting with leaky buckets in Rust\n\n\n\nThis crate implements two rate-limiting algorithms in Rust:\n\n* a [leaky bucket](https://en.wikipedia.org/wiki/Leaky_bucket#As_a_meter) and\n\n* a variation on the leaky bucket, the\n\n [generic cell rate algorithm](https://en.wikipedia.org/wiki/Generic_cell_rate_algorithm) (GCRA)\n\n for rate-limiting and scheduling.\n\n\n\n`ratelimit_meter` is usable in `no_std` mode, with a few trade-offs on\n\nfeatures.\n\n\n\n## Installation\n\n\n\nAdd the crate `ratelimit_meter` to your `Cargo.toml`\n\nfile; [the crates.io page](https://crates.io/crates/ratelimit_meter)\n\ncan give you the exact thing to paste.\n\n\n\n## API Docs\n\n\n\nFind them [on docs.rs](https://docs.rs/ratelimit_meter/) for the latest version!\n\n\n","file_path":"README.md","rank":51,"score":18969.353158102935},{"content":"## Design and implementation\n\n\n\nUnlike some other token bucket algorithms, the GCRA one assumes that\n\nall units of work are of the same \"weight\", and so allows some\n\noptimizations which result in much more concise and fast code (it does\n\nnot even use multiplication or division in the \"hot\" path for a\n\nsingle-cell decision).\n\n\n\nAll rate-limiting algorithm implementations in this crate are\n\nthread-safe. Here are some benchmarks for repeated decisions (run on\n\nmy macbook pro, this will differ on your hardware, etc etc):\n\n\n\n```\n\n$ cargo bench\n\n Finished release [optimized] target(s) in 0.16s\n\n Running target/release/deps/ratelimit_meter-9874176533f7e1a0\n\n\n\nrunning 1 test\n\ntest test_wait_time_from ... ignored\n\n\n\ntest result: ok. 0 passed; 0 failed; 1 ignored; 0 measured; 0 filtered out\n\n\n\n Running target/release/deps/criterion-67011381a5f6ed00\n\nmulti_threaded/20_threads/GCRA\n\n time: [1.9664 us 2.0747 us 2.1503 us]\n\n thrpt: [465.04 Kelem/s 482.00 Kelem/s 508.55 Kelem/s]\n\nFound 10 outliers among 100 measurements (10.00%)\n\n 4 (4.00%) low severe\n\n 4 (4.00%) low mild\n\n 2 (2.00%) high mild\n\nmulti_threaded/20_threads/LeakyBucket\n\n time: [2.4536 us 2.4878 us 2.5189 us]\n\n thrpt: [396.99 Kelem/s 401.96 Kelem/s 407.56 Kelem/s]\n\nFound 8 outliers among 100 measurements (8.00%)\n\n 5 (5.00%) low severe\n\n 3 (3.00%) low mild\n\n\n\nsingle_threaded/1_element/GCRA\n\n time: [68.613 ns 68.779 ns 68.959 ns]\n\n thrpt: [14.501 Melem/s 14.539 Melem/s 14.575 Melem/s]\n\nFound 13 outliers among 100 measurements (13.00%)\n\n 9 (9.00%) high mild\n\n 4 (4.00%) high severe\n\nsingle_threaded/1_element/LeakyBucket\n\n time: [64.513 ns 64.855 ns 65.272 ns]\n\n thrpt: [15.321 Melem/s 15.419 Melem/s 15.501 Melem/s]\n\nFound 16 outliers among 100 measurements (16.00%)\n\n 4 (4.00%) high mild\n","file_path":"README.md","rank":52,"score":18965.72636748784},{"content":"# Thanks for contributing to this project!\n\n\n\nI'm completely thrilled that you find this project useful enough to\n\nspend your time on!\n\n\n\n## Code of Conduct\n\n\n\nContributors are expected to adhere to the\n\n[Contributor Covenant Code of Conduct](http://contributor-covenant.org/version/1/4/),\n\nversion 1.4. See [CoC.md](CoC.md) for the full text.\n\n\n\n## Things you might do\n\n\n\nFeel free to:\n\n\n\n* [Report issues](../../issues)\n\n* [Send me a pull request](../../pulls) or\n\n* Just get in touch with me: asf@boinkor.net!\n","file_path":"CONTRIBUTING.md","rank":53,"score":18965.015095831455},{"content":" 12 (12.00%) high severe\n\n\n\nsingle_threaded/multi_element/GCRA\n\n time: [96.461 ns 96.976 ns 97.578 ns]\n\n thrpt: [102.48 Melem/s 103.12 Melem/s 103.67 Melem/s]\n\nFound 11 outliers among 100 measurements (11.00%)\n\n 4 (4.00%) high mild\n\n 7 (7.00%) high severe\n\nsingle_threaded/multi_element/LeakyBucket\n\n time: [69.500 ns 70.359 ns 71.349 ns]\n\n thrpt: [140.16 Melem/s 142.13 Melem/s 143.88 Melem/s]\n\nFound 9 outliers among 100 measurements (9.00%)\n\n 6 (6.00%) high mild\n\n 3 (3.00%) high severe\n\n\n\nno-op single-element decision\n\n time: [23.755 ns 23.817 ns 23.883 ns]\n\nFound 11 outliers among 100 measurements (11.00%)\n\n 5 (5.00%) high mild\n\n 6 (6.00%) high severe\n\n\n\nno-op multi-element decision\n\n time: [22.772 ns 22.940 ns 23.125 ns]\n\nFound 5 outliers among 100 measurements (5.00%)\n\n 5 (5.00%) high mild\n\n```\n\n\n\n## Contributions welcome!\n\n\n\nI am actively hoping that this project gives people joy in using\n\nrate-limiting techniques. You can use these techniques for so many\n\nthings (from throttling API requests to ensuring you don't spam people\n\nwith emails about the same thing)!\n\n\n\nSo if you have any thoughts about the API design, the internals, or\n\nyou want to implement other rate-limiting algotrithms, I would be\n\nthrilled to have your input. See [CONTRIBUTING.md](CONTRIBUTING.md)\n\nfor details!\n","file_path":"README.md","rank":54,"score":18962.89914375821},{"content":"# Contributor Covenant Code of Conduct\n\n\n\n## Our Pledge\n\n\n\nIn the interest of fostering an open and welcoming environment, we as\n\ncontributors and maintainers pledge to making participation in our project and\n\nour community a harassment-free experience for everyone, regardless of age, body\n\nsize, disability, ethnicity, gender identity and expression, level of experience,\n\nnationality, personal appearance, race, religion, or sexual identity and\n\norientation.\n\n\n\n## Our Standards\n\n\n\nExamples of behavior that contributes to creating a positive environment\n\ninclude:\n\n\n\n* Using welcoming and inclusive language\n\n* Being respectful of differing viewpoints and experiences\n\n* Gracefully accepting constructive criticism\n\n* Focusing on what is best for the community\n\n* Showing empathy towards other community members\n\n\n\nExamples of unacceptable behavior by participants include:\n\n\n\n* The use of sexualized language or imagery and unwelcome sexual attention or\n\nadvances\n\n* Trolling, insulting/derogatory comments, and personal or political attacks\n\n* Public or private harassment\n\n* Publishing others' private information, such as a physical or electronic\n\n address, without explicit permission\n\n* Other conduct which could reasonably be considered inappropriate in a\n\n professional setting\n\n\n\n## Our Responsibilities\n\n\n\nProject maintainers are responsible for clarifying the standards of acceptable\n\nbehavior and are expected to take appropriate and fair corrective action in\n\nresponse to any instances of unacceptable behavior.\n\n\n\nProject maintainers have the right and responsibility to remove, edit, or\n\nreject comments, commits, code, wiki edits, issues, and other contributions\n\nthat are not aligned to this Code of Conduct, or to ban temporarily or\n\npermanently any contributor for other behaviors that they deem inappropriate,\n\nthreatening, offensive, or harmful.\n\n\n","file_path":"CoC.md","rank":55,"score":18338.047629384757},{"content":"## Scope\n\n\n\nThis Code of Conduct applies both within project spaces and in public spaces\n\nwhen an individual is representing the project or its community. Examples of\n\nrepresenting a project or community include using an official project e-mail\n\naddress, posting via an official social media account, or acting as an appointed\n\nrepresentative at an online or offline event. Representation of a project may be\n\nfurther defined and clarified by project maintainers.\n\n\n\n## Enforcement\n\n\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\n\nreported by contacting the project team at asf@boinkor.net. All\n\ncomplaints will be reviewed and investigated and will result in a response that\n\nis deemed necessary and appropriate to the circumstances. The project team is\n\nobligated to maintain confidentiality with regard to the reporter of an incident.\n\nFurther details of specific enforcement policies may be posted separately.\n\n\n\nProject maintainers who do not follow or enforce the Code of Conduct in good\n\nfaith may face temporary or permanent repercussions as determined by other\n\nmembers of the project's leadership.\n\n\n\n## Attribution\n\n\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,\n\navailable at [http://contributor-covenant.org/version/1/4][version]\n\n\n\n[homepage]: http://contributor-covenant.org\n\n[version]: http://contributor-covenant.org/version/1/4/\n","file_path":"CoC.md","rank":56,"score":18337.627411178226},{"content":"/// ```\n\n/// # use std::num::NonZeroU32;\n\n/// # use std::time::Duration;\n\n/// use ratelimit_meter::{KeyedRateLimiter};\n\n/// # #[macro_use] extern crate nonzero_ext;\n\n/// # extern crate ratelimit_meter;\n\n/// # fn main () {\n\n/// let mut limiter = KeyedRateLimiter::<&str>::new(nonzero!(100u32), Duration::from_secs(5));\n\n/// limiter.check(\"hi there\");\n\n/// // time passes...\n\n///\n\n/// // remove all keys that have been expireable for 10 minutes:\n\n/// limiter.cleanup(Duration::from_secs(600));\n\n/// # }\n\n/// ```\n\n#[derive(Clone)]\n\npub struct KeyedRateLimiter<\n\n K: Eq + Hash + Clone,\n\n A: Algorithm<P> = DefaultAlgorithm,\n\n P: instant::Absolute = Instant,\n","file_path":"src/state/keyed.rs","rank":58,"score":28.710847934759506},{"content":"//! The Generic Cell Rate Algorithm\n\n\n\nuse crate::lib::*;\n\n\n\nuse crate::{\n\n algorithms::{Algorithm, NonConformance, RateLimitState, RateLimitStateWithClock},\n\n instant,\n\n thread_safety::ThreadsafeWrapper,\n\n InconsistentCapacity, NegativeMultiDecision,\n\n};\n\n\n\n#[cfg(feature = \"std\")]\n\nmod std {\n\n use crate::instant::Relative;\n\n use evmap::ShallowCopy;\n\n\n\n impl<P: Relative> ShallowCopy for super::State<P> {\n\n unsafe fn shallow_copy(&mut self) -> Self {\n\n super::State(self.0.shallow_copy())\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Eq, PartialEq, Clone)]\n","file_path":"src/algorithms/gcra.rs","rank":59,"score":25.9584064230702},{"content":"impl<T> Eq for ThreadsafeWrapper<T> where T: fmt::Debug + Default + Clone + PartialEq + Eq {}\n\n\n\nimpl<T> fmt::Debug for ThreadsafeWrapper<T>\n\nwhere\n\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\n\n{\n\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n\n let data = self.data.lock();\n\n data.fmt(f)\n\n }\n\n}\n\n\n\n#[cfg(feature = \"std\")]\n\nmod std {\n\n use super::*;\n\n use evmap::ShallowCopy;\n\n\n\n impl<T> ShallowCopy for ThreadsafeWrapper<T>\n\n where\n\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\n","file_path":"src/thread_safety.rs","rank":61,"score":23.908005863300627},{"content":"\n\n#[cfg(feature = \"std\")]\n\npub use self::state::KeyedRateLimiter;\n\n\n\npub use self::errors::*;\n\n\n\n/// A facade around all the types we need from std/core crates, to\n\n/// avoid unnecessary cfg-conditionalization everywhere.\n\nmod lib {\n\n mod core {\n\n #[cfg(not(feature = \"std\"))]\n\n pub use core::*;\n\n\n\n #[cfg(feature = \"std\")]\n\n pub use std::*;\n\n }\n\n\n\n pub use self::core::clone::Clone;\n\n pub use self::core::cmp::{Eq, Ord, PartialEq};\n\n pub use self::core::default::Default;\n","file_path":"src/lib.rs","rank":62,"score":23.615734455797163},{"content":" /// # #[macro_use] extern crate nonzero_ext;\n\n /// # extern crate ratelimit_meter;\n\n /// # fn main () {\n\n /// let _gcra = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(100u32));\n\n /// # }\n\n /// ```\n\n pub fn per_second(capacity: NonZeroU32) -> Self {\n\n Self::new(capacity, Duration::from_secs(1))\n\n }\n\n\n\n /// Return a builder that can be used to construct a rate limiter using\n\n /// the parameters passed to the Builder.\n\n pub fn build_with_capacity(capacity: NonZeroU32) -> Builder<P, A> {\n\n Builder {\n\n capacity,\n\n cell_weight: nonzero!(1u32),\n\n time_unit: Duration::from_secs(1),\n\n end_result: PhantomData,\n\n point_result: PhantomData,\n\n }\n","file_path":"src/state/direct.rs","rank":63,"score":23.460696391772323},{"content":"use crate::lib::*;\n\n\n\n#[cfg(feature = \"std\")]\n\nuse parking_lot::Mutex;\n\n\n\n#[cfg(not(feature = \"std\"))]\n\nuse spin::Mutex;\n\n\n\n#[derive(Clone)]\n\n/// Wraps the atomic operations on a Decider's state in a threadsafe\n\n/// fashion.\n\npub(crate) struct ThreadsafeWrapper<T>\n\nwhere\n\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\n\n{\n\n data: Arc<Mutex<T>>,\n\n}\n\n\n\nimpl<T> Default for ThreadsafeWrapper<T>\n\nwhere\n","file_path":"src/thread_safety.rs","rank":64,"score":22.0587262527091},{"content":"impl<P, A, K> KeyedRateLimiter<K, A, P>\n\nwhere\n\n P: instant::Absolute,\n\n A: Algorithm<P>,\n\n A::BucketState: KeyableRateLimitState<A, P>,\n\n K: Eq + Hash + Clone,\n\n{\n\n /// Construct a new rate limiter that allows `capacity` cells per\n\n /// time unit through.\n\n /// # Examples\n\n /// ```\n\n /// # use std::num::NonZeroU32;\n\n /// # use std::time::Duration;\n\n /// use ratelimit_meter::{KeyedRateLimiter};\n\n /// # #[macro_use] extern crate nonzero_ext;\n\n /// # extern crate ratelimit_meter;\n\n /// # fn main () {\n\n /// let _limiter = KeyedRateLimiter::<&str>::new(nonzero!(100u32), Duration::from_secs(5));\n\n /// # }\n\n /// ```\n","file_path":"src/state/keyed.rs","rank":65,"score":21.889820355539253},{"content":"/// // After a sufficient time period, cells are allowed again:\n\n/// assert_eq!(Ok(()), limiter.check_at(now + ms*50));\n\n/// # }\n\n/// # #[cfg(not(feature = \"std\"))] fn main() {}\n\n/// ```\n\n#[derive(Debug, Clone)]\n\npub struct GCRA<P: instant::Relative = instant::TimeSource> {\n\n // The \"weight\" of a single packet in units of time.\n\n t: Duration,\n\n\n\n // The \"capacity\" of the bucket.\n\n tau: Duration,\n\n\n\n point: PhantomData<P>,\n\n}\n\n\n\nimpl<P: instant::Relative> Algorithm<P> for GCRA<P> {\n\n type BucketState = State<P>;\n\n\n\n type NegativeDecision = NotUntil<P>;\n","file_path":"src/algorithms/gcra.rs","rank":66,"score":21.740449115466646},{"content":" ///\n\n /// # Panics\n\n /// Panics if an error occurs in acquiring any locks.\n\n pub(crate) fn measure_and_replace<F, E>(&self, f: F) -> Result<(), E>\n\n where\n\n F: Fn(&T) -> (Result<(), E>, Option<T>),\n\n {\n\n let mut data = self.data.lock();\n\n let (decision, new_data) = f(&*data);\n\n if let Some(new_data) = new_data {\n\n *data = new_data;\n\n }\n\n decision\n\n }\n\n\n\n /// Retrieves and returns a snapshot of the bucket state. This\n\n /// isn't thread safe, but can be used to restore an old copy of\n\n /// the bucket if necessary.\n\n ///\n\n /// # Thread safety\n\n /// This function operates threadsafely, but you're literally\n\n /// taking a copy of data that will change. Relying on the data\n\n /// that is returned *will* race.\n\n pub(crate) fn snapshot(&self) -> T {\n\n let data = self.data.lock();\n\n data.clone()\n\n }\n\n}\n","file_path":"src/thread_safety.rs","rank":67,"score":21.351725284997993},{"content":"//! use std::time::Duration;\n\n//! use ratelimit_meter::{DirectRateLimiter, GCRA};\n\n//!\n\n//! # #[macro_use] extern crate nonzero_ext;\n\n//! # extern crate ratelimit_meter;\n\n//! # #[cfg(feature = \"std\")]\n\n//! # fn main () {\n\n//! // Allow 50 units/second across all threads:\n\n//! let mut lim = DirectRateLimiter::<GCRA>::per_second(nonzero!(50u32));\n\n//! let mut thread_lim = lim.clone();\n\n//! thread::spawn(move || { assert_eq!(Ok(()), thread_lim.check());});\n\n//! assert_eq!(Ok(()), lim.check());\n\n//! # }\n\n//! # #[cfg(not(feature = \"std\"))]\n\n//! # fn main() {}\n\n//! ```\n\n//!\n\n//! ## Usage with `no_std`\n\n//!\n\n//! `ratelimit_meter` can be used in `no_std` crates, with a reduced\n","file_path":"src/lib.rs","rank":68,"score":21.17109467435181},{"content":" ///\n\n /// ```\n\n /// # use std::time::Duration;\n\n /// use ratelimit_meter::{KeyedRateLimiter, GCRA};\n\n /// # #[macro_use] extern crate nonzero_ext;\n\n /// # extern crate ratelimit_meter;\n\n /// # fn main () {\n\n /// let _limiter = KeyedRateLimiter::<&str, GCRA>::per_second(nonzero!(100u32));\n\n /// # }\n\n /// ```\n\n pub fn per_second(capacity: NonZeroU32) -> Self {\n\n Self::new(capacity, Duration::from_secs(1))\n\n }\n\n\n\n /// Return a constructor that can be used to construct a keyed\n\n /// rate limiter with the builder pattern.\n\n pub fn build_with_capacity(capacity: NonZeroU32) -> Builder<K, P, A, RandomState> {\n\n Builder {\n\n capacity,\n\n ..Default::default()\n","file_path":"src/state/keyed.rs","rank":70,"score":21.08975637377748},{"content":"use crate::lib::*;\n\nuse crate::{algorithms::Algorithm, instant, NegativeMultiDecision};\n\n\n\n/// A representation of a bare in-memory algorithm, without any bucket\n\n/// attached.\n\n#[derive(Debug)]\n\npub struct AlgorithmForTest<A: Algorithm<P>, P: instant::Relative>(A, PhantomData<P>);\n\n\n\nimpl<'a, A, P> AlgorithmForTest<A, P>\n\nwhere\n\n A: Algorithm<P>,\n\n P: instant::Relative,\n\n{\n\n pub fn new<U: Into<Option<NonZeroU32>>, D: Into<Option<Duration>>>(\n\n cap: NonZeroU32,\n\n weight: U,\n\n duration: D,\n\n ) -> Self {\n\n AlgorithmForTest(\n\n A::construct(\n","file_path":"src/test_utilities/algorithms.rs","rank":71,"score":21.035475491519005},{"content":" }\n\n}\n\n\n\n/// A constructor for keyed rate limiters.\n\npub struct Builder<K: Eq + Hash + Clone, P: instant::Absolute, A: Algorithm<P>, H: BuildHasher> {\n\n end_result: PhantomData<(K, P, A)>,\n\n capacity: NonZeroU32,\n\n cell_weight: NonZeroU32,\n\n per_time_unit: Duration,\n\n hasher: H,\n\n map_capacity: Option<usize>,\n\n}\n\n\n\nimpl<K, A, P> Default for Builder<K, P, A, RandomState>\n\nwhere\n\n K: Eq + Hash + Clone,\n\n P: instant::Absolute,\n\n A: Algorithm<P>,\n\n A::BucketState: KeyableRateLimitState<A, P>,\n\n{\n","file_path":"src/state/keyed.rs","rank":72,"score":20.834384360374457},{"content":" fn default() -> Self {\n\n DirectBucket(DirectRateLimiter::per_second(nonzero!(50u32)))\n\n }\n\n}\n\nimpl<A, P> DirectBucket<A, P>\n\nwhere\n\n P: instant::Relative,\n\n A: Algorithm<P>,\n\n{\n\n pub fn limiter(self) -> DirectRateLimiter<A, P> {\n\n self.0\n\n }\n\n}\n\n\n\n#[cfg(feature = \"std\")]\n\nmod std {\n\n use super::*;\n\n use crate::{algorithms::KeyableRateLimitState, instant::Absolute, KeyedRateLimiter};\n\n\n\n pub struct KeyedBucket<A: Algorithm<P>, P: Absolute>(KeyedRateLimiter<u32, A, P>)\n","file_path":"src/test_utilities/variants.rs","rank":73,"score":20.491963677853345},{"content":" /// Allows all cells through unconditionally.\n\n fn test_n_and_update(\n\n &self,\n\n _state: &Self::BucketState,\n\n _n: u32,\n\n _t0: Always,\n\n ) -> Result<(), NegativeMultiDecision<Impossible>> {\n\n Ok(())\n\n }\n\n}\n\n\n\n/// A pseudo-instant that never changes.\n\n///\n\n/// It is used to implement the `Allower` rate-limiter type, which\n\n/// never denies any requests.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\n\npub struct Always();\n\nimpl instant::Relative for Always {\n\n fn duration_since(&self, _other: Self) -> Duration {\n\n Duration::new(0, 0)\n","file_path":"src/example_algorithms.rs","rank":74,"score":19.808726105280748},{"content":"///\n\n/// ```\n\n/// # use ratelimit_meter::{DirectRateLimiter, GCRA};\n\n/// # use std::num::NonZeroU32;\n\n/// # use std::time::{Instant, Duration};\n\n/// # #[macro_use] extern crate nonzero_ext;\n\n/// # extern crate ratelimit_meter;\n\n/// # #[cfg(feature = \"std\")]\n\n/// # fn main () {\n\n/// let mut limiter = DirectRateLimiter::<GCRA>::per_second(nonzero!(20u32));\n\n/// let now = Instant::now();\n\n/// let ms = Duration::from_millis(1);\n\n/// assert_eq!(Ok(()), limiter.check_at(now)); // the first cell is free\n\n/// for i in 0..20 {\n\n/// // Spam a lot:\n\n/// assert!(limiter.check_at(now).is_ok(), \"at {}\", i);\n\n/// }\n\n/// // We have exceeded the bucket capacity:\n\n/// assert!(limiter.check_at(now).is_err());\n\n///\n","file_path":"src/algorithms/gcra.rs","rank":75,"score":19.62834894516806},{"content":" {\n\n unsafe fn shallow_copy(&mut self) -> Self {\n\n ThreadsafeWrapper {\n\n data: self.data.shallow_copy(),\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl<T> ThreadsafeWrapper<T>\n\nwhere\n\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\n\n{\n\n #[inline]\n\n /// Wraps retrieving a bucket's data, calls a function to make a\n\n /// decision and return a new state, and then tries to set the\n\n /// state on the bucket.\n\n ///\n\n /// This function can loop and call the decision closure again if\n\n /// the bucket state couldn't be set.\n","file_path":"src/thread_safety.rs","rank":76,"score":19.44059592608305},{"content":"use crate::lib::*;\n\nuse crate::{\n\n algorithms::{Algorithm, RateLimitState, RateLimitStateWithClock},\n\n instant,\n\n instant::Absolute,\n\n DirectRateLimiter, InconsistentCapacity, NegativeMultiDecision,\n\n};\n\n\n\n/// The most naive implementation of a rate-limiter ever: Always\n\n/// allows every cell through.\n\n/// # Example\n\n/// ```\n\n/// use ratelimit_meter::DirectRateLimiter;\n\n/// use ratelimit_meter::example_algorithms::Allower;\n\n/// let mut allower = Allower::ratelimiter();\n\n/// assert!(allower.check().is_ok());\n\n/// ```\n\n#[derive(Default, Copy, Clone, Debug)]\n\npub struct Allower {}\n\n\n","file_path":"src/example_algorithms.rs","rank":77,"score":19.204893846907993},{"content":" pub use self::core::fmt::Debug;\n\n pub use self::core::marker::{Copy, PhantomData, Send, Sized, Sync};\n\n pub use self::core::num::NonZeroU32;\n\n pub use self::core::ops::{Add, Sub};\n\n pub use self::core::time::Duration;\n\n\n\n pub use self::core::cmp;\n\n pub use self::core::fmt;\n\n\n\n /// Imports that are only available on std.\n\n #[cfg(feature = \"std\")]\n\n mod std {\n\n pub use std::collections::hash_map::RandomState;\n\n pub use std::hash::{BuildHasher, Hash};\n\n pub use std::sync::Arc;\n\n pub use std::time::Instant;\n\n }\n\n\n\n #[cfg(feature = \"no_std\")]\n\n mod no_std {\n","file_path":"src/lib.rs","rank":78,"score":19.143042328014413},{"content":"/// An object that allows incrementally constructing rate Limiter\n\n/// objects.\n\npub struct Builder<P, A>\n\nwhere\n\n P: instant::Relative,\n\n A: Algorithm<P> + Sized,\n\n{\n\n capacity: NonZeroU32,\n\n cell_weight: NonZeroU32,\n\n time_unit: Duration,\n\n end_result: PhantomData<A>,\n\n point_result: PhantomData<P>,\n\n}\n\n\n\nimpl<P, A> Builder<P, A>\n\nwhere\n\n P: instant::Relative,\n\n A: Algorithm<P> + Sized,\n\n{\n\n /// Sets the \"weight\" of each cell being checked against the\n","file_path":"src/state/direct.rs","rank":79,"score":19.101538227945493},{"content":"#![cfg(feature = \"std\")]\n\n\n\nextern crate ratelimit_meter;\n\n#[macro_use]\n\nextern crate nonzero_ext;\n\n\n\nuse ratelimit_meter::{KeyedRateLimiter, GCRA};\n\nuse std::thread;\n\nuse std::time::{Duration, Instant};\n\n\n\n#[test]\n","file_path":"tests/keyed.rs","rank":80,"score":18.74248605809714},{"content":"use crate::algorithms::Algorithm;\n\nuse crate::instant;\n\nuse crate::state::DirectRateLimiter;\n\n\n\n#[derive(Debug)]\n\npub enum Variant {\n\n GCRA,\n\n LeakyBucket,\n\n}\n\n\n\nimpl Variant {\n\n pub const ALL: &'static [Variant; 2] = &[Variant::GCRA, Variant::LeakyBucket];\n\n}\n\n\n\npub struct DirectBucket<A: Algorithm<P>, P: instant::Relative>(DirectRateLimiter<A, P>);\n\nimpl<A, P> Default for DirectBucket<A, P>\n\nwhere\n\n P: instant::Relative,\n\n A: Algorithm<P>,\n\n{\n","file_path":"src/test_utilities/variants.rs","rank":81,"score":18.619089299560475},{"content":" state: A::BucketState,\n\n algorithm: A,\n\n}\n\n\n\nimpl<A, P> DirectRateLimiter<A, P>\n\nwhere\n\n P: instant::Relative,\n\n A: Algorithm<P>,\n\n{\n\n /// Construct a new rate limiter that allows `capacity` cells per\n\n /// time unit through.\n\n /// # Examples\n\n /// You can construct a GCRA rate limiter like so:\n\n /// ```\n\n /// # use std::num::NonZeroU32;\n\n /// # use std::time::Duration;\n\n /// use ratelimit_meter::{DirectRateLimiter, GCRA};\n\n /// # #[macro_use] extern crate nonzero_ext;\n\n /// # extern crate ratelimit_meter;\n\n /// # fn main () {\n","file_path":"src/state/direct.rs","rank":82,"score":18.442602500029345},{"content":"\n\npub mod algorithms;\n\nmod errors;\n\npub mod example_algorithms;\n\npub mod instant;\n\npub mod state;\n\npub mod test_utilities;\n\nmod thread_safety;\n\n\n\n#[macro_use]\n\nextern crate nonzero_ext;\n\n\n\n#[cfg(not(feature = \"std\"))]\n\nextern crate alloc;\n\n\n\npub use self::algorithms::LeakyBucket;\n\npub use self::algorithms::NonConformance;\n\npub use self::algorithms::GCRA;\n\n\n\npub use self::state::DirectRateLimiter;\n","file_path":"src/lib.rs","rank":83,"score":18.305046802853873},{"content":" /// let _gcra = DirectRateLimiter::<GCRA>::new(nonzero!(100u32), Duration::from_secs(5));\n\n /// # }\n\n /// ```\n\n ///\n\n /// and similarly, for a leaky bucket:\n\n /// ```\n\n /// # use std::time::Duration;\n\n /// use ratelimit_meter::{DirectRateLimiter, LeakyBucket};\n\n /// # #[macro_use] extern crate nonzero_ext;\n\n /// # extern crate ratelimit_meter;\n\n /// # fn main () {\n\n /// let _lb = DirectRateLimiter::<LeakyBucket>::new(nonzero!(100u32), Duration::from_secs(5));\n\n /// # }\n\n /// ```\n\n pub fn new(capacity: NonZeroU32, per_time_unit: Duration) -> Self {\n\n DirectRateLimiter {\n\n state: <A as Algorithm<P>>::BucketState::default(),\n\n algorithm: <A as Algorithm<P>>::construct(capacity, nonzero!(1u32), per_time_unit)\n\n .unwrap(),\n\n }\n","file_path":"src/state/direct.rs","rank":84,"score":18.244131637078375},{"content":"//! An in-memory rate limiter that can make decisions for a single\n\n//! situation.\n\n\n\nuse crate::lib::*;\n\n\n\nuse crate::{\n\n algorithms::{Algorithm, DefaultAlgorithm},\n\n instant, InconsistentCapacity, NegativeMultiDecision,\n\n};\n\n\n\n/// An in-memory rate limiter that makes direct (un-keyed)\n\n/// rate-limiting decisions. Direct rate limiters can be used to\n\n/// e.g. regulate the transmission of packets on a single connection,\n\n/// or to ensure that an API client stays within a server's rate\n\n/// limit.\n\n#[derive(Debug, Clone)]\n\npub struct DirectRateLimiter<\n\n A: Algorithm<P> = DefaultAlgorithm,\n\n P: instant::Relative = instant::TimeSource,\n\n> {\n","file_path":"src/state/direct.rs","rank":85,"score":17.422378766741474},{"content":" T: fmt::Debug + Default + Clone + PartialEq + Eq,\n\n{\n\n fn default() -> Self {\n\n ThreadsafeWrapper {\n\n data: Arc::new(Mutex::new(T::default())),\n\n }\n\n }\n\n}\n\n\n\nimpl<T> PartialEq<Self> for ThreadsafeWrapper<T>\n\nwhere\n\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\n\n{\n\n fn eq(&self, other: &Self) -> bool {\n\n let mine = self.data.lock();\n\n let other = other.data.lock();\n\n *other == *mine\n\n }\n\n}\n\n\n","file_path":"src/thread_safety.rs","rank":86,"score":17.13876654596169},{"content":"//! fn sub(self, rhs: Duration) -> Always {\n\n//! self.0 - rhs\n\n//! }\n\n//! }\n\n//! ```\n\n//!\n\n//! Then, using that type to create a rate limiter with that time\n\n//! source is a little more verbose. It looks like this:\n\n//!\n\n//! ```rust,ignore\n\n//! let mut lim = DirectRateLimiter::<GCRA<MyInstant>,MyInstant>::per_second(nonzero!(50u32));\n\n//! lim.check().ok();\n\n//! ```\n\n\n\n// Allow using the alloc crate\n\n#![cfg_attr(not(feature = \"std\"), feature(alloc))]\n\n// Allow using ratelimit_meter without std\n\n#![cfg_attr(not(feature = \"std\"), no_std)]\n\n// Deny warnings\n\n#![cfg_attr(feature = \"cargo-clippy\", deny(warnings))]\n","file_path":"src/lib.rs","rank":87,"score":16.400751236142703},{"content":"#![doc(hidden)]\n\n//! A module for code shared between integration tests & benchmarks in this crate.\n\n\n\npub mod algorithms;\n\npub mod variants;\n\n\n\nuse crate::lib::*;\n\n\n\nuse crate::instant;\n\n\n\n/// Returns a \"current\" moment that's suitable for tests.\n","file_path":"src/test_utilities.rs","rank":88,"score":16.361968665074052},{"content":" cap,\n\n weight.into().unwrap_or(nonzero!(1u32)),\n\n duration\n\n .into()\n\n .unwrap_or(crate::lib::Duration::from_secs(1)),\n\n )\n\n .unwrap(),\n\n PhantomData,\n\n )\n\n }\n\n\n\n pub fn algorithm(&'a self) -> &'a A {\n\n &self.0\n\n }\n\n\n\n pub fn state(&self) -> A::BucketState {\n\n A::BucketState::default()\n\n }\n\n\n\n pub fn check(&self, state: &A::BucketState, t0: P) -> Result<(), A::NegativeDecision> {\n","file_path":"src/test_utilities/algorithms.rs","rank":89,"score":16.328230948686638},{"content":" self.0\n\n }\n\n }\n\n}\n\n#[cfg(feature = \"std\")]\n\npub use self::std::*;\n\n\n\n// I really wish I could just have a function that returns an impl\n\n// Trait that was usable in all the benchmarks, but alas it should not\n\n// be so.\n\n#[doc(hidden)]\n\n#[macro_export]\n\nmacro_rules! bench_with_variants {\n\n ($variant:expr, $var:ident : $bucket:tt, $code:block) => {\n\n match $variant {\n\n $crate::test_utilities::variants::Variant::GCRA => {\n\n let mut $var =\n\n $bucket::<::ratelimit_meter::GCRA<Instant>, Instant>::default().limiter();\n\n $code\n\n }\n","file_path":"src/test_utilities/variants.rs","rank":90,"score":16.186615322549},{"content":"impl<P: instant::Absolute> RateLimitStateWithClock<GCRA<P>, P> for State<P> {\n\n fn last_touched(&self, params: &GCRA<P>) -> P {\n\n let data = self.0.snapshot();\n\n data.0.unwrap_or_else(P::now) + params.tau\n\n }\n\n}\n\n\n\n/// Returned in case of a negative rate-limiting decision. Indicates\n\n/// the earliest instant that a cell might get accepted again.\n\n///\n\n/// To avoid thundering herd effects, client code should always add a\n\n/// random amount of jitter to wait time estimates.\n\n#[derive(Debug, PartialEq)]\n\npub struct NotUntil<P: instant::Relative>(P);\n\n\n\nimpl<P: instant::Relative> fmt::Display for NotUntil<P> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n\n write!(f, \"rate-limited until {:?}\", self.0)\n\n }\n\n}\n","file_path":"src/algorithms/gcra.rs","rank":91,"score":16.13076406813945},{"content":" self.0.test_and_update(state, t0)\n\n }\n\n\n\n pub fn check_n(\n\n &self,\n\n state: &A::BucketState,\n\n n: u32,\n\n t0: P,\n\n ) -> Result<(), NegativeMultiDecision<A::NegativeDecision>> {\n\n self.0.test_n_and_update(state, n, t0)\n\n }\n\n}\n\n\n\nimpl<A, P> Default for AlgorithmForTest<A, P>\n\nwhere\n\n A: Algorithm<P>,\n\n P: instant::Relative,\n\n{\n\n fn default() -> Self {\n\n Self::new(nonzero!(1u32), None, None)\n","file_path":"src/test_utilities/algorithms.rs","rank":92,"score":15.839489085771632},{"content":" fn default() -> Builder<K, P, A, RandomState> {\n\n Builder {\n\n end_result: PhantomData,\n\n map_capacity: None,\n\n capacity: nonzero!(1u32),\n\n cell_weight: nonzero!(1u32),\n\n per_time_unit: Duration::from_secs(1),\n\n hasher: RandomState::new(),\n\n }\n\n }\n\n}\n\n\n\nimpl<K, P, A, H> Builder<K, P, A, H>\n\nwhere\n\n K: Eq + Hash + Clone,\n\n P: instant::Absolute,\n\n A: Algorithm<P>,\n\n A::BucketState: KeyableRateLimitState<A, P>,\n\n H: BuildHasher,\n\n{\n","file_path":"src/state/keyed.rs","rank":93,"score":15.638373761470937},{"content":"extern crate ratelimit_meter;\n\n#[macro_use]\n\nextern crate nonzero_ext;\n\n\n\nuse ratelimit_meter::{\n\n algorithms::Algorithm, test_utilities::current_moment, NegativeMultiDecision, NonConformance,\n\n GCRA,\n\n};\n\nuse std::thread;\n\nuse std::time::Duration;\n\n\n\n#[test]\n","file_path":"tests/gcra.rs","rank":94,"score":15.488252300536889},{"content":" }\n\n\n\n /// Tests whether a single cell can be accommodated at the given\n\n /// time stamp. See [`check`](#method.check).\n\n pub fn check_at(&mut self, at: P) -> Result<(), <A as Algorithm<P>>::NegativeDecision> {\n\n self.algorithm.test_and_update(&self.state, at)\n\n }\n\n\n\n /// Tests if `n` cells can be accommodated at the given time\n\n /// (`Instant::now()`), using [`check_n`](#method.check_n)\n\n pub fn check_n_at(\n\n &mut self,\n\n n: u32,\n\n at: P,\n\n ) -> Result<(), NegativeMultiDecision<<A as Algorithm<P>>::NegativeDecision>> {\n\n self.algorithm.test_n_and_update(&self.state, n, at)\n\n }\n\n}\n\n\n\nimpl<A, P> DirectRateLimiter<A, P>\n","file_path":"src/state/direct.rs","rank":95,"score":15.36191100649631},{"content":"/// # use std::time::Duration;\n\n/// use ratelimit_meter::{KeyedRateLimiter};\n\n/// # #[macro_use] extern crate nonzero_ext;\n\n/// # extern crate ratelimit_meter;\n\n/// # fn main () {\n\n/// let mut limiter = KeyedRateLimiter::<&str>::new(nonzero!(1u32), Duration::from_secs(5));\n\n/// assert_eq!(Ok(()), limiter.check(\"customer1\")); // allowed!\n\n/// assert_ne!(Ok(()), limiter.check(\"customer1\")); // ...but now customer1 must wait 5 seconds.\n\n///\n\n/// assert_eq!(Ok(()), limiter.check(\"customer2\")); // it's customer2's first request!\n\n/// # }\n\n/// ```\n\n///\n\n/// # Expiring old keys\n\n/// If a key has not been checked in a long time, that key can be\n\n/// expired safely (the next rate limit check for that key would\n\n/// behave as if the key was not present in the map, after all). To\n\n/// remove the unused keys and free up space, use the\n\n/// [`cleanup`](method.cleanup) method:\n\n///\n","file_path":"src/state/keyed.rs","rank":96,"score":15.322748381475622},{"content":"extern crate ratelimit_meter;\n\n#[macro_use]\n\nextern crate nonzero_ext;\n\n\n\nuse ratelimit_meter::{\n\n algorithms::Algorithm, test_utilities::current_moment, DirectRateLimiter, LeakyBucket,\n\n NegativeMultiDecision, NonConformance,\n\n};\n\nuse std::thread;\n\nuse std::time::Duration;\n\n\n\n#[test]\n","file_path":"tests/leaky_bucket.rs","rank":97,"score":15.094237116391549},{"content":"pub mod gcra;\n\npub mod leaky_bucket;\n\n\n\npub use self::gcra::*;\n\npub use self::leaky_bucket::*;\n\n\n\nuse crate::{instant, InconsistentCapacity, NegativeMultiDecision};\n\n\n\nuse crate::lib::*;\n\n\n\n/// The default rate limiting algorithm in this crate: The [\"leaky\n\n/// bucket\"](leaky_bucket/struct.LeakyBucket.html).\n\n///\n\n/// The leaky bucket algorithm is fairly easy to understand and has\n\n/// decent performance in most cases. If better threaded performance\n\n/// is needed, this crate also offers the\n\n/// [`GCRA`](gcra/struct.GCRA.html) algorithm.\n\npub type DefaultAlgorithm = LeakyBucket;\n\n\n\n/// Provides additional information about non-conforming cells, most\n\n/// importantly the earliest time until the next cell could be\n\n/// considered conforming.\n\n///\n\n/// Since this does not account for effects like thundering herds,\n\n/// users should always add random jitter to the times given.\n","file_path":"src/algorithms.rs","rank":98,"score":14.763519196033764},{"content":"use std::time::Duration;\n\n\n\nuse ratelimit_meter::example_algorithms::{Allower, Always};\n\nuse ratelimit_meter::instant::Absolute;\n\nuse ratelimit_meter::test_utilities::algorithms::AlgorithmForTest;\n\n\n\nuse criterion::{black_box, Benchmark, Criterion, Throughput};\n\n\n","file_path":"benches/no_op.rs","rank":99,"score":14.701144375495856}],"string":"[\n {\n \"content\": \"/// Trait that all rate limit states have to implement around\\n\\n/// housekeeping in keyed rate limiters.\\n\\npub trait RateLimitState<P, I: instant::Relative>: Default + Send + Sync + Eq + fmt::Debug {}\\n\\n\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 0,\n \"score\": 139496.12516807122\n },\n {\n \"content\": \"#[derive(Debug, Eq, PartialEq, Clone)]\\n\\nstruct Tat<P: instant::Relative>(Option<P>);\\n\\n\\n\\nimpl<P: instant::Relative> Default for Tat<P> {\\n\\n fn default() -> Self {\\n\\n Tat(None)\\n\\n }\\n\\n}\\n\\n\\n\\n/// The GCRA's state about a single rate limiting history.\\n\\n#[derive(Debug, Eq, PartialEq, Clone)]\\n\\npub struct State<P: instant::Relative>(ThreadsafeWrapper<Tat<P>>);\\n\\n\\n\\nimpl<P: instant::Relative> Default for State<P> {\\n\\n fn default() -> Self {\\n\\n State(Default::default())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<P: instant::Relative> RateLimitState<GCRA<P>, P> for State<P> {}\\n\\n\\n\",\n \"file_path\": \"src/algorithms/gcra.rs\",\n \"rank\": 1,\n \"score\": 124157.37552766272\n },\n {\n \"content\": \"/// The trait that implementations of metered rate-limiter algorithms\\n\\n/// have to implement.\\n\\n///\\n\\n/// Implementing structures are expected to represent the \\\"parameters\\\"\\n\\n/// (e.g., the allowed requests/s), and keep the information necessary\\n\\n/// to make a decision, e.g. concrete usage statistics for an\\n\\n/// in-memory rate limiter, in the associated structure\\n\\n/// [`BucketState`](#associatedtype.BucketState).\\n\\npub trait Algorithm<P: instant::Relative = instant::TimeSource>:\\n\\n Send + Sync + Sized + fmt::Debug\\n\\n{\\n\\n /// The state of a single rate limiting bucket.\\n\\n ///\\n\\n /// Every new rate limiting state is initialized as `Default`. The\\n\\n /// states must be safe to share across threads (this crate uses a\\n\\n /// `parking_lot` Mutex to allow that).\\n\\n type BucketState: RateLimitState<Self, P>;\\n\\n\\n\\n /// The type returned when a rate limiting decision for a single\\n\\n /// cell is negative. Each rate limiting algorithm can decide to\\n\\n /// return the type that suits it best, but most algorithms'\\n\\n /// decisions also implement\\n\\n /// [`NonConformance`](trait.NonConformance.html), to ease\\n\\n /// handling of how long to wait.\\n\\n type NegativeDecision: PartialEq + fmt::Display + fmt::Debug + Send + Sync;\\n\\n\\n\\n /// Constructs a rate limiter with the given parameters:\\n\\n /// `capacity` is the number of cells to allow, weighing\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 2,\n \"score\": 117515.92745916202\n },\n {\n \"content\": \"/// Trait that all rate limit states implement if there is a real-time\\n\\n/// clock available.\\n\\npub trait RateLimitStateWithClock<P, I: instant::Absolute>: RateLimitState<P, I> {\\n\\n /// Returns the last time instant that the state had any relevance\\n\\n /// (i.e. the rate limiter would behave exactly as if it was a new\\n\\n /// rate limiter after this time).\\n\\n ///\\n\\n /// If the state has not been touched for a given amount of time,\\n\\n /// the keyed rate limiter will expire it.\\n\\n ///\\n\\n /// # Thread safety\\n\\n /// This uses a bucket state snapshot to determine eligibility;\\n\\n /// race conditions can occur.\\n\\n fn last_touched(&self, params: &P) -> I;\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nmod std {\\n\\n use crate::instant;\\n\\n use evmap::ShallowCopy;\\n\\n\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 3,\n \"score\": 116724.11369812317\n },\n {\n \"content\": \"/// Provides additional information about non-conforming cells, most\\n\\n/// importantly the earliest time until the next cell could be\\n\\n/// considered conforming.\\n\\n///\\n\\n/// Since this does not account for effects like thundering herds,\\n\\n/// users should always add random jitter to the times given.\\n\\npub trait NonConformance<P: instant::Relative = instant::TimeSource> {\\n\\n /// Returns the earliest time at which a decision could be\\n\\n /// conforming (excluding conforming decisions made by the Decider\\n\\n /// that are made in the meantime).\\n\\n fn earliest_possible(&self) -> P;\\n\\n\\n\\n /// Returns the minimum amount of time from the time that the\\n\\n /// decision was made (relative to the `at` argument in a\\n\\n /// `Decider`'s `check_at` method) that must pass before a\\n\\n /// decision can be conforming. Since Durations can not be\\n\\n /// negative, a zero duration is returned if `from` is already\\n\\n /// after that duration.\\n\\n fn wait_time_from(&self, from: P) -> Duration {\\n\\n let earliest = self.earliest_possible();\\n\\n earliest.duration_since(earliest.min(from))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 5,\n \"score\": 115208.94038735001\n },\n {\n \"content\": \"pub fn bench_all(c: &mut Criterion) {\\n\\n let id = \\\"algorithm/no_op\\\";\\n\\n\\n\\n let bm = Benchmark::new(id, move |b| {\\n\\n let algo = AlgorithmForTest::<Allower, Always>::default();\\n\\n let now = Always::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let state = algo.state();\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(algo.check(&state, now + (ms * i)).is_ok());\\n\\n });\\n\\n })\\n\\n .throughput(Throughput::Elements(1));\\n\\n c.bench(id, bm);\\n\\n}\\n\",\n \"file_path\": \"benches/no_op.rs\",\n \"rank\": 6,\n \"score\": 114628.35866274267\n },\n {\n \"content\": \"pub fn bench_all(c: &mut Criterion) {\\n\\n bench_plain_algorithm_1elem(c);\\n\\n bench_plain_algorithm_multi(c);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/algorithms.rs\",\n \"rank\": 7,\n \"score\": 114628.35866274267\n },\n {\n \"content\": \"pub trait NonConformanceExt<P: instant::Absolute>: NonConformance<P> {\\n\\n /// Returns the minimum amount of time (down to 0) that needs to\\n\\n /// pass from the current instant for the Decider to consider a\\n\\n /// cell conforming again.\\n\\n fn wait_time(&self) -> Duration {\\n\\n self.wait_time_from(P::now())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<P: instant::Absolute, T> NonConformanceExt<P> for T where T: NonConformance<P> {}\\n\\n\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 8,\n \"score\": 113106.80373277623\n },\n {\n \"content\": \"pub fn bench_all(c: &mut Criterion) {\\n\\n bench_direct(c);\\n\\n bench_keyed(c);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/single_threaded.rs\",\n \"rank\": 9,\n \"score\": 111481.45522854674\n },\n {\n \"content\": \"pub fn bench_all(c: &mut Criterion) {\\n\\n bench_direct(c);\\n\\n bench_keyed(c);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/multi_threaded.rs\",\n \"rank\": 10,\n \"score\": 111481.45522854674\n },\n {\n \"content\": \"/// Returns a \\\"current\\\" moment that's suitable for tests.\\n\\npub fn current_moment() -> instant::TimeSource {\\n\\n #[cfg(feature = \\\"std\\\")]\\n\\n return Instant::now();\\n\\n\\n\\n #[cfg(not(feature = \\\"std\\\"))]\\n\\n return Duration::from_secs(90);\\n\\n}\\n\",\n \"file_path\": \"src/test_utilities.rs\",\n \"rank\": 11,\n \"score\": 109358.07062296395\n },\n {\n \"content\": \" /// Trait implemented by all rate limit states that are compatible\\n\\n /// with the KeyedRateLimiters.\\n\\n pub trait KeyableRateLimitState<P, I: instant::Absolute>:\\n\\n super::RateLimitStateWithClock<P, I> + ShallowCopy\\n\\n {\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"std\\\")]\\n\\n impl<T, P, I> KeyableRateLimitState<P, I> for T\\n\\n where\\n\\n T: super::RateLimitStateWithClock<P, I> + ShallowCopy,\\n\\n I: instant::Absolute,\\n\\n {\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\npub use self::std::*;\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 12,\n \"score\": 105479.9741761017\n },\n {\n \"content\": \"fn bench_keyed(c: &mut Criterion) {\\n\\n let id = \\\"multi_threaded/keyed\\\";\\n\\n\\n\\n let bm = ParameterizedBenchmark::new(\\n\\n id,\\n\\n |b, ref v| {\\n\\n bench_with_variants!(v, lim: KeyedBucket, {\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let mut children = vec![];\\n\\n\\n\\n for _i in 0..19 {\\n\\n let mut lim = lim.clone();\\n\\n let mut b = b.clone();\\n\\n children.push(thread::spawn(move || {\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(lim.check_at(i % 100, now + (ms * i)).is_ok());\\n\\n });\\n\",\n \"file_path\": \"benches/multi_threaded.rs\",\n \"rank\": 13,\n \"score\": 75033.94699496083\n },\n {\n \"content\": \"fn bench_keyed(c: &mut Criterion) {\\n\\n let id = \\\"single_threaded/keyed\\\";\\n\\n let bm = ParameterizedBenchmark::new(\\n\\n id,\\n\\n move |b, ref v| {\\n\\n bench_with_variants!(v, rl: KeyedBucket, {\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(rl.check_at(i % 100, now + (ms * i)).is_ok());\\n\\n });\\n\\n });\\n\\n },\\n\\n Variant::ALL,\\n\\n )\\n\\n .throughput(|_s| Throughput::Elements(1));\\n\\n c.bench(id, bm);\\n\\n}\\n\",\n \"file_path\": \"benches/single_threaded.rs\",\n \"rank\": 14,\n \"score\": 75033.94699496083\n },\n {\n \"content\": \"fn bench_direct(c: &mut Criterion) {\\n\\n let id = \\\"single_threaded/direct\\\";\\n\\n let bm = ParameterizedBenchmark::new(\\n\\n id,\\n\\n move |b, ref v| {\\n\\n bench_with_variants!(v, rl: DirectBucket, {\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(rl.check_at(now + (ms * i)).is_ok());\\n\\n });\\n\\n });\\n\\n },\\n\\n Variant::ALL,\\n\\n )\\n\\n .throughput(|_s| Throughput::Elements(1));\\n\\n c.bench(id, bm);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/single_threaded.rs\",\n \"rank\": 15,\n \"score\": 75033.94699496083\n },\n {\n \"content\": \"fn bench_direct(c: &mut Criterion) {\\n\\n let id = \\\"multi_threaded/direct\\\";\\n\\n\\n\\n let bm = ParameterizedBenchmark::new(\\n\\n id,\\n\\n |b, ref v| {\\n\\n bench_with_variants!(v, lim: DirectBucket, {\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let mut children = vec![];\\n\\n\\n\\n for _i in 0..19 {\\n\\n let mut lim = lim.clone();\\n\\n let mut b = b.clone();\\n\\n children.push(thread::spawn(move || {\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(lim.check_at(now + (ms * i)).is_ok());\\n\\n });\\n\",\n \"file_path\": \"benches/multi_threaded.rs\",\n \"rank\": 16,\n \"score\": 75033.94699496083\n },\n {\n \"content\": \"/// A point in time that is used as a reference for measuring a rate\\n\\n/// limit. On the clock, it has meaning only relative to some other point in time.\\n\\n///\\n\\n/// When using `no_std`, users of this crate are expected to provide\\n\\n/// an impl of `Relative` that corresponds to their system's time source.\\n\\npub trait Relative:\\n\\n Sized\\n\\n + Sub<Duration, Output = Self>\\n\\n + Add<Duration, Output = Self>\\n\\n + PartialEq\\n\\n + Eq\\n\\n + Ord\\n\\n + Copy\\n\\n + Clone\\n\\n + Send\\n\\n + Sync\\n\\n + Debug\\n\\n{\\n\\n /// Returns the amount of time elapsed from an earlier point in time.\\n\\n fn duration_since(&self, earlier: Self) -> Duration;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/instant.rs\",\n \"rank\": 17,\n \"score\": 73695.49256833472\n },\n {\n \"content\": \"fn bench_plain_algorithm_1elem(c: &mut Criterion) {\\n\\n let id = \\\"algorithm/1\\\";\\n\\n let bm = ParameterizedBenchmark::new(\\n\\n id,\\n\\n move |b, ref v| {\\n\\n bench_with_algorithm_variants!(v, algo, {\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let state = algo.state();\\n\\n\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(algo.check(&state, now + (ms * i)).is_ok());\\n\\n });\\n\\n });\\n\\n },\\n\\n Variant::ALL,\\n\\n )\\n\\n .throughput(|_s| Throughput::Elements(1));\\n\\n c.bench(id, bm);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/algorithms.rs\",\n \"rank\": 18,\n \"score\": 73118.24639956064\n },\n {\n \"content\": \"fn bench_plain_algorithm_multi(c: &mut Criterion) {\\n\\n let id = \\\"algorithm/multi\\\";\\n\\n let elements: u32 = 10;\\n\\n let bm = ParameterizedBenchmark::new(\\n\\n id,\\n\\n move |b, ref v| {\\n\\n bench_with_algorithm_variants!(v, algo, {\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(20);\\n\\n let state = algo.state();\\n\\n\\n\\n let mut i = 0;\\n\\n b.iter(|| {\\n\\n i += 1;\\n\\n black_box(algo.check_n(&state, elements, now + (ms * i)).is_ok());\\n\\n });\\n\\n });\\n\\n },\\n\\n Variant::ALL,\\n\\n )\\n\\n .throughput(|_s| Throughput::Elements(1));\\n\\n c.bench(id, bm);\\n\\n}\\n\",\n \"file_path\": \"benches/algorithms.rs\",\n \"rank\": 19,\n \"score\": 73118.24639956064\n },\n {\n \"content\": \"/// A point in time as given by a source of time. It is assumed to be\\n\\n/// monotonically moving forward.\\n\\npub trait Absolute: Relative {\\n\\n /// Returns the current moment in time, as given by the time\\n\\n /// source.\\n\\n fn now() -> Self;\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nmod std {\\n\\n use std::time::{Duration, Instant};\\n\\n\\n\\n impl super::Relative for Instant {\\n\\n fn duration_since(&self, earlier: Self) -> Duration {\\n\\n self.duration_since(earlier)\\n\\n }\\n\\n }\\n\\n\\n\\n impl super::Absolute for Instant {\\n\\n #[inline]\\n\\n fn now() -> Self {\\n\\n Instant::now()\\n\",\n \"file_path\": \"src/instant.rs\",\n \"rank\": 20,\n \"score\": 69378.26417382841\n },\n {\n \"content\": \"#[test]\\n\\nfn nonconformance_wait_time_from() {\\n\\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n if let Err(failure) = gcra.test_and_update(&state, now) {\\n\\n assert_eq!(ms * 2000, failure.wait_time_from(now));\\n\\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 2000));\\n\\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 2001));\\n\\n } else {\\n\\n assert!(false, \\\"Second attempt should fail\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 21,\n \"score\": 67048.10666363464\n },\n {\n \"content\": \"struct LeakCheck {\\n\\n usage_before: i64,\\n\\n n_iter: usize,\\n\\n}\\n\\n\\n\\nimpl Drop for LeakCheck {\\n\\n fn drop(&mut self) {\\n\\n let usage_after = resident_memsize();\\n\\n assert!(\\n\\n usage_after <= self.usage_before + LEAK_TOLERANCE,\\n\\n \\\"Plausible memory leak!\\\\nAfter {} iterations, usage before: {}, usage after: {}\\\",\\n\\n self.n_iter,\\n\\n self.usage_before,\\n\\n usage_after\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\\nimpl LeakCheck {\\n\\n fn new(n_iter: usize) -> Self {\\n\\n LeakCheck {\\n\\n n_iter,\\n\\n usage_before: resident_memsize(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 22,\n \"score\": 50558.59703728661\n },\n {\n \"content\": \"#[test]\\n\\nfn expiration() {\\n\\n let ms = Duration::from_millis(1);\\n\\n let now = Instant::now();\\n\\n let then = now + ms * 2000; // two seconds later\\n\\n\\n\\n fn make_bucket<'a>() -> KeyedRateLimiter<&'a str> {\\n\\n let ms = Duration::from_millis(1);\\n\\n let now = Instant::now();\\n\\n let mut lim = KeyedRateLimiter::<&str>::new(nonzero!(1u32), Duration::from_secs(1));\\n\\n lim.check_at(\\\"foo\\\", now).unwrap();\\n\\n lim.check_at(\\\"bar\\\", now + ms * 200).unwrap();\\n\\n lim.check_at(\\\"baz\\\", now + ms * 800).unwrap();\\n\\n lim\\n\\n }\\n\\n\\n\\n // clean up all keys that are indistinguishable from unoccupied keys:\\n\\n let mut lim = make_bucket();\\n\\n let mut removed = lim.cleanup_at(None, then);\\n\\n removed.sort();\\n\\n assert_eq!(vec![\\\"bar\\\", \\\"baz\\\", \\\"foo\\\"], removed);\\n\",\n \"file_path\": \"tests/keyed.rs\",\n \"rank\": 23,\n \"score\": 43383.07841204845\n },\n {\n \"content\": \"#[test]\\n\\nfn actual_threadsafety() {\\n\\n let gcra = GCRA::construct(nonzero!(20u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();\\n\\n\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n let mut children = vec![];\\n\\n\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n for _i in 0..20 {\\n\\n let state = state.clone();\\n\\n let gcra = gcra.clone();\\n\\n children.push(thread::spawn(move || {\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n }));\\n\\n }\\n\\n for child in children {\\n\\n child.join().unwrap();\\n\\n }\\n\\n assert_ne!(Ok(()), gcra.test_and_update(&state, now + ms * 2));\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms * 1000));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 24,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn allows_after_interval() {\\n\\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();;\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms));\\n\\n assert_ne!(Ok(()), gcra.test_and_update(&state, now + ms * 2));\\n\\n // should be ok again in 1s:\\n\\n let next = now + Duration::from_secs(1);\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, next));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 25,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn actual_threadsafety() {\\n\\n let mut lim = KeyedRateLimiter::<&str, GCRA>::new(nonzero!(20u32), Duration::from_secs(1));\\n\\n let now = Instant::now();\\n\\n let ms = Duration::from_millis(1);\\n\\n let mut children = vec![];\\n\\n\\n\\n lim.check_at(\\\"foo\\\", now).unwrap();\\n\\n for _i in 0..20 {\\n\\n let mut lim = lim.clone();\\n\\n children.push(thread::spawn(move || {\\n\\n lim.check_at(\\\"foo\\\", now).unwrap();\\n\\n }));\\n\\n }\\n\\n for child in children {\\n\\n child.join().unwrap();\\n\\n }\\n\\n assert!(!lim.check_at(\\\"foo\\\", now + ms * 2).is_ok());\\n\\n assert_eq!(Ok(()), lim.check_at(\\\"foo\\\", now + ms * 1000));\\n\\n}\\n\",\n \"file_path\": \"tests/keyed.rs\",\n \"rank\": 26,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn memleak_gcra() {\\n\\n let mut bucket = DirectRateLimiter::<GCRA>::build_with_capacity(nonzero!(1_000_000u32))\\n\\n .build()\\n\\n .unwrap();\\n\\n let leak_check = LeakCheck::new(500_000);\\n\\n\\n\\n for _i in 0..leak_check.n_iter {\\n\\n drop(bucket.check());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 27,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn rejects_too_many() {\\n\\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();;\\n\\n let now = current_moment();\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n gcra.test_and_update(&state, now).unwrap();\\n\\n assert_ne!(\\n\\n Ok(()),\\n\\n gcra.test_and_update(&state, now),\\n\\n \\\"{:?} {:?}\\\",\\n\\n &state,\\n\\n &gcra\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 28,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn allows_n_after_interval() {\\n\\n let gcra = GCRA::construct(nonzero!(2u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();;\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n assert_eq!(Ok(()), gcra.test_n_and_update(&state, 2, now));\\n\\n assert!(!gcra.test_n_and_update(&state, 2, now + ms).is_ok());\\n\\n // should be ok again in 1.5s:\\n\\n let next = now + Duration::from_secs(1);\\n\\n assert_eq!(\\n\\n Ok(()),\\n\\n gcra.test_n_and_update(&state, 2, next),\\n\\n \\\"now: {:?}\\\",\\n\\n next\\n\\n );\\n\\n\\n\\n // should always accommodate 0 cells:\\n\\n assert_eq!(Ok(()), gcra.test_n_and_update(&state, 0, next));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 29,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn memleak_leakybucket() {\\n\\n let mut bucket = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(1_000_000u32));\\n\\n let leak_check = LeakCheck::new(500_000);\\n\\n\\n\\n for _i in 0..leak_check.n_iter {\\n\\n drop(bucket.check());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 30,\n \"score\": 42025.238489357966\n },\n {\n \"content\": \"#[test]\\n\\nfn actual_threadsafety() {\\n\\n let mut lim = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(20u32));\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n let mut children = vec![];\\n\\n\\n\\n lim.check_at(now).unwrap();\\n\\n for _i in 0..20 {\\n\\n let mut lim = lim.clone();\\n\\n children.push(thread::spawn(move || lim.check_at(now).is_ok()));\\n\\n }\\n\\n for child in children {\\n\\n child.join().unwrap();\\n\\n }\\n\\n assert!(!lim.check_at(now + ms * 2).is_ok());\\n\\n assert_eq!(Ok(()), lim.check_at(now + ms * 1000));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 31,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn accepts_first_cell() {\\n\\n let gcra = GCRA::construct(nonzero!(5u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();;\\n\\n let now = current_moment();\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 32,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn memleak_gcra_threaded() {\\n\\n let bucket = DirectRateLimiter::<GCRA>::build_with_capacity(nonzero!(1_000_000u32))\\n\\n .build()\\n\\n .unwrap();\\n\\n let leak_check = LeakCheck::new(5_000);\\n\\n\\n\\n for _i in 0..leak_check.n_iter {\\n\\n let mut bucket = bucket.clone();\\n\\n thread::spawn(move || drop(bucket.check())).join().unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 33,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn correct_wait_time() {\\n\\n // Bucket adding a new element per 200ms:\\n\\n let gcra = GCRA::construct(nonzero!(5u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();\\n\\n let mut now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n let mut conforming = 0;\\n\\n for _i in 0..20 {\\n\\n now += ms;\\n\\n let res = gcra.test_and_update(&state, now);\\n\\n match res {\\n\\n Ok(()) => {\\n\\n conforming += 1;\\n\\n }\\n\\n Err(wait) => {\\n\\n now += wait.wait_time_from(now);\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now));\\n\\n conforming += 1;\\n\\n }\\n\\n }\\n\\n }\\n\\n assert_eq!(20, conforming);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 34,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn memleak_gcra_multi() {\\n\\n let mut bucket = DirectRateLimiter::<GCRA>::build_with_capacity(nonzero!(1_000_000u32))\\n\\n .build()\\n\\n .unwrap();\\n\\n let leak_check = LeakCheck::new(500_000);\\n\\n\\n\\n for _i in 0..leak_check.n_iter {\\n\\n drop(bucket.check_n(2));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 35,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn memleak_leakybucket_threaded() {\\n\\n let bucket = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(1_000_000u32));\\n\\n let leak_check = LeakCheck::new(5_000);\\n\\n\\n\\n for _i in 0..leak_check.n_iter {\\n\\n let mut bucket = bucket.clone();\\n\\n thread::spawn(move || drop(bucket.check())).join().unwrap();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 36,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn rejects_too_many() {\\n\\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(2u32));\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n assert_eq!(Ok(()), lb.check_at(now));\\n\\n assert_eq!(Ok(()), lb.check_at(now));\\n\\n\\n\\n assert_ne!(Ok(()), lb.check_at(now + ms * 2));\\n\\n\\n\\n // should be ok again in 1s:\\n\\n let next = now + Duration::from_millis(1002);\\n\\n assert_eq!(Ok(()), lb.check_at(next));\\n\\n assert_eq!(Ok(()), lb.check_at(next + ms));\\n\\n\\n\\n assert_ne!(Ok(()), lb.check_at(next + ms * 2), \\\"{:?}\\\", lb);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 37,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn correctly_handles_per() {\\n\\n let ms = Duration::from_millis(1);\\n\\n let gcra = GCRA::construct(nonzero!(1u32), nonzero!(1u32), ms * 20).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();;\\n\\n let now = current_moment();\\n\\n\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now));\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms));\\n\\n assert!(!gcra.test_and_update(&state, now + ms * 10).is_ok());\\n\\n assert_eq!(Ok(()), gcra.test_and_update(&state, now + ms * 20));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 38,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn never_allows_more_than_capacity() {\\n\\n let ms = Duration::from_millis(1);\\n\\n let gcra = GCRA::construct(nonzero!(5u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <GCRA as Algorithm>::BucketState::default();\\n\\n let now = current_moment();\\n\\n\\n\\n // Should not allow the first 15 cells on a capacity 5 bucket:\\n\\n assert!(gcra.test_n_and_update(&state, 15, now).is_err());\\n\\n\\n\\n // After 3 and 20 seconds, it should not allow 15 on that bucket either:\\n\\n assert!(gcra\\n\\n .test_n_and_update(&state, 15, now + (ms * 3 * 1000))\\n\\n .is_err());\\n\\n\\n\\n let result = gcra.test_n_and_update(&state, 15, now + (ms * 20 * 1000));\\n\\n match result {\\n\\n Err(NegativeMultiDecision::InsufficientCapacity(n)) => assert_eq!(n, 15),\\n\\n _ => panic!(\\\"Did not expect {:?}\\\", result),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 39,\n \"score\": 40794.88990300173\n },\n {\n \"content\": \"#[test]\\n\\nfn tooearly_wait_time_from() {\\n\\n let lim =\\n\\n LeakyBucket::construct(nonzero!(1u32), nonzero!(1u32), Duration::from_secs(1)).unwrap();\\n\\n let state = <LeakyBucket as Algorithm>::BucketState::default();\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n lim.test_and_update(&state, now).unwrap();\\n\\n if let Err(failure) = lim.test_and_update(&state, now) {\\n\\n assert_eq!(ms * 1000, failure.wait_time_from(now));\\n\\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 1000));\\n\\n assert_eq!(Duration::new(0, 0), failure.wait_time_from(now + ms * 2001));\\n\\n } else {\\n\\n assert!(false, \\\"Second attempt should fail\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 40,\n \"score\": 39674.88204212858\n },\n {\n \"content\": \"#[test]\\n\\nfn correct_wait_time() {\\n\\n // Bucket adding a new element per 200ms:\\n\\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\\n\\n let mut now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n let mut conforming = 0;\\n\\n for _i in 0..20 {\\n\\n now += ms;\\n\\n let res = lb.check_at(now);\\n\\n match res {\\n\\n Ok(()) => {\\n\\n conforming += 1;\\n\\n }\\n\\n Err(wait) => {\\n\\n now += wait.wait_time_from(now);\\n\\n assert_eq!(Ok(()), lb.check_at(now));\\n\\n conforming += 1;\\n\\n }\\n\\n }\\n\\n }\\n\\n assert_eq!(20, conforming);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 41,\n \"score\": 39674.88204212858\n },\n {\n \"content\": \"#[test]\\n\\nfn never_allows_more_than_capacity() {\\n\\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n\\n\\n // Should not allow the first 15 cells on a capacity 5 bucket:\\n\\n assert_ne!(Ok(()), lb.check_n_at(15, now));\\n\\n\\n\\n // After 3 and 20 seconds, it should not allow 15 on that bucket either:\\n\\n assert_ne!(Ok(()), lb.check_n_at(15, now + (ms * 3 * 1000)));\\n\\n let result = lb.check_n_at(15, now + (ms * 20 * 1000));\\n\\n match result {\\n\\n Err(NegativeMultiDecision::InsufficientCapacity(n)) => assert_eq!(n, 15),\\n\\n _ => panic!(\\\"Did not expect {:?}\\\", result),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 42,\n \"score\": 39674.88204212858\n },\n {\n \"content\": \"#[test]\\n\\nfn accepts_first_cell() {\\n\\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\\n\\n assert_eq!(Ok(()), lb.check_at(current_moment()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 43,\n \"score\": 39674.88204212858\n },\n {\n \"content\": \"#[test]\\n\\nfn prevents_time_travel() {\\n\\n let mut lb = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(5u32));\\n\\n let now = current_moment();\\n\\n let ms = Duration::from_millis(1);\\n\\n\\n\\n assert!(lb.check_at(now).is_ok());\\n\\n assert!(lb.check_at(now - ms).is_ok());\\n\\n assert!(lb.check_at(now - ms * 500).is_ok());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 44,\n \"score\": 39674.88204212858\n },\n {\n \"content\": \"#[test]\\n\\nfn different_states_per_key() {\\n\\n let mut lim = KeyedRateLimiter::<&str>::new(nonzero!(1u32), Duration::from_secs(1));\\n\\n let ms = Duration::from_millis(1);\\n\\n let now = Instant::now();\\n\\n assert_eq!(Ok(()), lim.check_at(\\\"foo\\\", now + ms));\\n\\n assert_eq!(Ok(()), lim.check_at(\\\"bar\\\", now + ms));\\n\\n assert_eq!(Ok(()), lim.check_at(\\\"baz\\\", now + ms));\\n\\n\\n\\n assert_ne!(Ok(()), lim.check_at(\\\"foo\\\", now + ms * 3), \\\"{:?}\\\", lim);\\n\\n assert_ne!(Ok(()), lim.check_at(\\\"bar\\\", now + ms * 3), \\\"{:?}\\\", lim);\\n\\n assert_ne!(Ok(()), lim.check_at(\\\"baz\\\", now + ms * 3), \\\"{:?}\\\", lim);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/keyed.rs\",\n \"rank\": 45,\n \"score\": 39674.88204212858\n },\n {\n \"content\": \"fn resident_memsize() -> i64 {\\n\\n let mut out: libc::rusage = unsafe { std::mem::zeroed() };\\n\\n assert!(unsafe { libc::getrusage(libc::RUSAGE_SELF, &mut out) } == 0);\\n\\n out.ru_maxrss\\n\\n}\\n\\n\\n\\nconst LEAK_TOLERANCE: i64 = 1024 * 1024 * 10;\\n\\n\\n\",\n \"file_path\": \"tests/memory.rs\",\n \"rank\": 46,\n \"score\": 39220.26010447035\n },\n {\n \"content\": \"type MapWriteHandle<K, P, A, H> =\\n\\n Arc<Mutex<WriteHandle<K, <A as Algorithm<P>>::BucketState, (), H>>>;\\n\\n\\n\\n/// An in-memory rate limiter that regulates a single rate limit for\\n\\n/// multiple keys.\\n\\n///\\n\\n/// Keyed rate limiters can be used to e.g. enforce a per-IP address\\n\\n/// or a per-customer request limit on the server side.\\n\\n///\\n\\n/// This implementation of the keyed rate limiter uses\\n\\n/// [`evmap`](../../../evmap/index.html), a read lock-free, concurrent\\n\\n/// hash map. Addition of new keys (e.g. a new customer making their\\n\\n/// first request) is synchronized and happens one at a time (it\\n\\n/// synchronizes writes to minimize the effects from `evmap`'s\\n\\n/// eventually consistent behavior on key addition), while reads of\\n\\n/// existing keys all happen simultaneously, then get synchronized by\\n\\n/// the rate limiting algorithm itself.\\n\\n///\\n\\n/// ```\\n\\n/// # use std::num::NonZeroU32;\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 47,\n \"score\": 37306.38464417921\n },\n {\n \"content\": \"use crate::lib::*;\\n\\n\\n\\n/// The default time representation in use by rate limiters. To\\n\\n/// override it, pass a different `P` type argument to the algorithm\\n\\n/// and rate limiter bucket.\\n\\n///\\n\\n/// ## When using `std`\\n\\n/// The default time source is `Instant` when using std.\\n\\n///\\n\\n/// ## When using `no_std`\\n\\n/// In situations where `std` is not available, the fallback default\\n\\n/// time source is Duration. It only allows comparisons to a relative,\\n\\n/// fixed, point in time. Users are expected to determine that point\\n\\n/// in time and stick to it.\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\npub type TimeSource = Instant;\\n\\n#[cfg(not(feature = \\\"std\\\"))]\\n\\npub type TimeSource = Duration;\\n\\n\\n\\n/// A point in time that is used as a reference for measuring a rate\\n\\n/// limit. On the clock, it has meaning only relative to some other point in time.\\n\\n///\\n\\n/// When using `no_std`, users of this crate are expected to provide\\n\\n/// an impl of `Relative` that corresponds to their system's time source.\\n\",\n \"file_path\": \"src/instant.rs\",\n \"rank\": 48,\n \"score\": 30060.91376934474\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n use std::time::SystemTime;\\n\\n\\n\\n impl super::Relative for SystemTime {\\n\\n /// Returns the difference in times between the two\\n\\n /// SystemTimes. Due to the fallible nature of SystemTimes,\\n\\n /// returns the zero duration if a negative duration would\\n\\n /// result (e.g. due to system clock adjustments).\\n\\n fn duration_since(&self, earlier: Self) -> Duration {\\n\\n self.duration_since(earlier)\\n\\n .unwrap_or_else(|_| Duration::new(0, 0))\\n\\n }\\n\\n }\\n\\n\\n\\n impl super::Absolute for SystemTime {\\n\\n #[inline]\\n\\n fn now() -> Self {\\n\\n SystemTime::now()\\n\",\n \"file_path\": \"src/instant.rs\",\n \"rank\": 49,\n \"score\": 30054.390020360617\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Relative for Duration {\\n\\n fn duration_since(&self, earlier: Self) -> Duration {\\n\\n *self - earlier\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/instant.rs\",\n \"rank\": 50,\n \"score\": 30046.95033589908\n },\n {\n \"content\": \"[](https://travis-ci.org/antifuchs/ratelimit_meter) [](https://docs.rs/ratelimit_meter/) [](https://crates.io/crates/ratelimit_meter)\\n\\n\\n\\n# Rate-Limiting with leaky buckets in Rust\\n\\n\\n\\nThis crate implements two rate-limiting algorithms in Rust:\\n\\n* a [leaky bucket](https://en.wikipedia.org/wiki/Leaky_bucket#As_a_meter) and\\n\\n* a variation on the leaky bucket, the\\n\\n [generic cell rate algorithm](https://en.wikipedia.org/wiki/Generic_cell_rate_algorithm) (GCRA)\\n\\n for rate-limiting and scheduling.\\n\\n\\n\\n`ratelimit_meter` is usable in `no_std` mode, with a few trade-offs on\\n\\nfeatures.\\n\\n\\n\\n## Installation\\n\\n\\n\\nAdd the crate `ratelimit_meter` to your `Cargo.toml`\\n\\nfile; [the crates.io page](https://crates.io/crates/ratelimit_meter)\\n\\ncan give you the exact thing to paste.\\n\\n\\n\\n## API Docs\\n\\n\\n\\nFind them [on docs.rs](https://docs.rs/ratelimit_meter/) for the latest version!\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 51,\n \"score\": 18969.353158102935\n },\n {\n \"content\": \"## Design and implementation\\n\\n\\n\\nUnlike some other token bucket algorithms, the GCRA one assumes that\\n\\nall units of work are of the same \\\"weight\\\", and so allows some\\n\\noptimizations which result in much more concise and fast code (it does\\n\\nnot even use multiplication or division in the \\\"hot\\\" path for a\\n\\nsingle-cell decision).\\n\\n\\n\\nAll rate-limiting algorithm implementations in this crate are\\n\\nthread-safe. Here are some benchmarks for repeated decisions (run on\\n\\nmy macbook pro, this will differ on your hardware, etc etc):\\n\\n\\n\\n```\\n\\n$ cargo bench\\n\\n Finished release [optimized] target(s) in 0.16s\\n\\n Running target/release/deps/ratelimit_meter-9874176533f7e1a0\\n\\n\\n\\nrunning 1 test\\n\\ntest test_wait_time_from ... ignored\\n\\n\\n\\ntest result: ok. 0 passed; 0 failed; 1 ignored; 0 measured; 0 filtered out\\n\\n\\n\\n Running target/release/deps/criterion-67011381a5f6ed00\\n\\nmulti_threaded/20_threads/GCRA\\n\\n time: [1.9664 us 2.0747 us 2.1503 us]\\n\\n thrpt: [465.04 Kelem/s 482.00 Kelem/s 508.55 Kelem/s]\\n\\nFound 10 outliers among 100 measurements (10.00%)\\n\\n 4 (4.00%) low severe\\n\\n 4 (4.00%) low mild\\n\\n 2 (2.00%) high mild\\n\\nmulti_threaded/20_threads/LeakyBucket\\n\\n time: [2.4536 us 2.4878 us 2.5189 us]\\n\\n thrpt: [396.99 Kelem/s 401.96 Kelem/s 407.56 Kelem/s]\\n\\nFound 8 outliers among 100 measurements (8.00%)\\n\\n 5 (5.00%) low severe\\n\\n 3 (3.00%) low mild\\n\\n\\n\\nsingle_threaded/1_element/GCRA\\n\\n time: [68.613 ns 68.779 ns 68.959 ns]\\n\\n thrpt: [14.501 Melem/s 14.539 Melem/s 14.575 Melem/s]\\n\\nFound 13 outliers among 100 measurements (13.00%)\\n\\n 9 (9.00%) high mild\\n\\n 4 (4.00%) high severe\\n\\nsingle_threaded/1_element/LeakyBucket\\n\\n time: [64.513 ns 64.855 ns 65.272 ns]\\n\\n thrpt: [15.321 Melem/s 15.419 Melem/s 15.501 Melem/s]\\n\\nFound 16 outliers among 100 measurements (16.00%)\\n\\n 4 (4.00%) high mild\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 52,\n \"score\": 18965.72636748784\n },\n {\n \"content\": \"# Thanks for contributing to this project!\\n\\n\\n\\nI'm completely thrilled that you find this project useful enough to\\n\\nspend your time on!\\n\\n\\n\\n## Code of Conduct\\n\\n\\n\\nContributors are expected to adhere to the\\n\\n[Contributor Covenant Code of Conduct](http://contributor-covenant.org/version/1/4/),\\n\\nversion 1.4. See [CoC.md](CoC.md) for the full text.\\n\\n\\n\\n## Things you might do\\n\\n\\n\\nFeel free to:\\n\\n\\n\\n* [Report issues](../../issues)\\n\\n* [Send me a pull request](../../pulls) or\\n\\n* Just get in touch with me: asf@boinkor.net!\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 53,\n \"score\": 18965.015095831455\n },\n {\n \"content\": \" 12 (12.00%) high severe\\n\\n\\n\\nsingle_threaded/multi_element/GCRA\\n\\n time: [96.461 ns 96.976 ns 97.578 ns]\\n\\n thrpt: [102.48 Melem/s 103.12 Melem/s 103.67 Melem/s]\\n\\nFound 11 outliers among 100 measurements (11.00%)\\n\\n 4 (4.00%) high mild\\n\\n 7 (7.00%) high severe\\n\\nsingle_threaded/multi_element/LeakyBucket\\n\\n time: [69.500 ns 70.359 ns 71.349 ns]\\n\\n thrpt: [140.16 Melem/s 142.13 Melem/s 143.88 Melem/s]\\n\\nFound 9 outliers among 100 measurements (9.00%)\\n\\n 6 (6.00%) high mild\\n\\n 3 (3.00%) high severe\\n\\n\\n\\nno-op single-element decision\\n\\n time: [23.755 ns 23.817 ns 23.883 ns]\\n\\nFound 11 outliers among 100 measurements (11.00%)\\n\\n 5 (5.00%) high mild\\n\\n 6 (6.00%) high severe\\n\\n\\n\\nno-op multi-element decision\\n\\n time: [22.772 ns 22.940 ns 23.125 ns]\\n\\nFound 5 outliers among 100 measurements (5.00%)\\n\\n 5 (5.00%) high mild\\n\\n```\\n\\n\\n\\n## Contributions welcome!\\n\\n\\n\\nI am actively hoping that this project gives people joy in using\\n\\nrate-limiting techniques. You can use these techniques for so many\\n\\nthings (from throttling API requests to ensuring you don't spam people\\n\\nwith emails about the same thing)!\\n\\n\\n\\nSo if you have any thoughts about the API design, the internals, or\\n\\nyou want to implement other rate-limiting algotrithms, I would be\\n\\nthrilled to have your input. See [CONTRIBUTING.md](CONTRIBUTING.md)\\n\\nfor details!\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 54,\n \"score\": 18962.89914375821\n },\n {\n \"content\": \"# Contributor Covenant Code of Conduct\\n\\n\\n\\n## Our Pledge\\n\\n\\n\\nIn the interest of fostering an open and welcoming environment, we as\\n\\ncontributors and maintainers pledge to making participation in our project and\\n\\nour community a harassment-free experience for everyone, regardless of age, body\\n\\nsize, disability, ethnicity, gender identity and expression, level of experience,\\n\\nnationality, personal appearance, race, religion, or sexual identity and\\n\\norientation.\\n\\n\\n\\n## Our Standards\\n\\n\\n\\nExamples of behavior that contributes to creating a positive environment\\n\\ninclude:\\n\\n\\n\\n* Using welcoming and inclusive language\\n\\n* Being respectful of differing viewpoints and experiences\\n\\n* Gracefully accepting constructive criticism\\n\\n* Focusing on what is best for the community\\n\\n* Showing empathy towards other community members\\n\\n\\n\\nExamples of unacceptable behavior by participants include:\\n\\n\\n\\n* The use of sexualized language or imagery and unwelcome sexual attention or\\n\\nadvances\\n\\n* Trolling, insulting/derogatory comments, and personal or political attacks\\n\\n* Public or private harassment\\n\\n* Publishing others' private information, such as a physical or electronic\\n\\n address, without explicit permission\\n\\n* Other conduct which could reasonably be considered inappropriate in a\\n\\n professional setting\\n\\n\\n\\n## Our Responsibilities\\n\\n\\n\\nProject maintainers are responsible for clarifying the standards of acceptable\\n\\nbehavior and are expected to take appropriate and fair corrective action in\\n\\nresponse to any instances of unacceptable behavior.\\n\\n\\n\\nProject maintainers have the right and responsibility to remove, edit, or\\n\\nreject comments, commits, code, wiki edits, issues, and other contributions\\n\\nthat are not aligned to this Code of Conduct, or to ban temporarily or\\n\\npermanently any contributor for other behaviors that they deem inappropriate,\\n\\nthreatening, offensive, or harmful.\\n\\n\\n\",\n \"file_path\": \"CoC.md\",\n \"rank\": 55,\n \"score\": 18338.047629384757\n },\n {\n \"content\": \"## Scope\\n\\n\\n\\nThis Code of Conduct applies both within project spaces and in public spaces\\n\\nwhen an individual is representing the project or its community. Examples of\\n\\nrepresenting a project or community include using an official project e-mail\\n\\naddress, posting via an official social media account, or acting as an appointed\\n\\nrepresentative at an online or offline event. Representation of a project may be\\n\\nfurther defined and clarified by project maintainers.\\n\\n\\n\\n## Enforcement\\n\\n\\n\\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\\n\\nreported by contacting the project team at asf@boinkor.net. All\\n\\ncomplaints will be reviewed and investigated and will result in a response that\\n\\nis deemed necessary and appropriate to the circumstances. The project team is\\n\\nobligated to maintain confidentiality with regard to the reporter of an incident.\\n\\nFurther details of specific enforcement policies may be posted separately.\\n\\n\\n\\nProject maintainers who do not follow or enforce the Code of Conduct in good\\n\\nfaith may face temporary or permanent repercussions as determined by other\\n\\nmembers of the project's leadership.\\n\\n\\n\\n## Attribution\\n\\n\\n\\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,\\n\\navailable at [http://contributor-covenant.org/version/1/4][version]\\n\\n\\n\\n[homepage]: http://contributor-covenant.org\\n\\n[version]: http://contributor-covenant.org/version/1/4/\\n\",\n \"file_path\": \"CoC.md\",\n \"rank\": 56,\n \"score\": 18337.627411178226\n },\n {\n \"content\": \"/// ```\\n\\n/// # use std::num::NonZeroU32;\\n\\n/// # use std::time::Duration;\\n\\n/// use ratelimit_meter::{KeyedRateLimiter};\\n\\n/// # #[macro_use] extern crate nonzero_ext;\\n\\n/// # extern crate ratelimit_meter;\\n\\n/// # fn main () {\\n\\n/// let mut limiter = KeyedRateLimiter::<&str>::new(nonzero!(100u32), Duration::from_secs(5));\\n\\n/// limiter.check(\\\"hi there\\\");\\n\\n/// // time passes...\\n\\n///\\n\\n/// // remove all keys that have been expireable for 10 minutes:\\n\\n/// limiter.cleanup(Duration::from_secs(600));\\n\\n/// # }\\n\\n/// ```\\n\\n#[derive(Clone)]\\n\\npub struct KeyedRateLimiter<\\n\\n K: Eq + Hash + Clone,\\n\\n A: Algorithm<P> = DefaultAlgorithm,\\n\\n P: instant::Absolute = Instant,\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 58,\n \"score\": 28.710847934759506\n },\n {\n \"content\": \"//! The Generic Cell Rate Algorithm\\n\\n\\n\\nuse crate::lib::*;\\n\\n\\n\\nuse crate::{\\n\\n algorithms::{Algorithm, NonConformance, RateLimitState, RateLimitStateWithClock},\\n\\n instant,\\n\\n thread_safety::ThreadsafeWrapper,\\n\\n InconsistentCapacity, NegativeMultiDecision,\\n\\n};\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nmod std {\\n\\n use crate::instant::Relative;\\n\\n use evmap::ShallowCopy;\\n\\n\\n\\n impl<P: Relative> ShallowCopy for super::State<P> {\\n\\n unsafe fn shallow_copy(&mut self) -> Self {\\n\\n super::State(self.0.shallow_copy())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, Clone)]\\n\",\n \"file_path\": \"src/algorithms/gcra.rs\",\n \"rank\": 59,\n \"score\": 25.9584064230702\n },\n {\n \"content\": \"impl<T> Eq for ThreadsafeWrapper<T> where T: fmt::Debug + Default + Clone + PartialEq + Eq {}\\n\\n\\n\\nimpl<T> fmt::Debug for ThreadsafeWrapper<T>\\n\\nwhere\\n\\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\\n\\n{\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\\n\\n let data = self.data.lock();\\n\\n data.fmt(f)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nmod std {\\n\\n use super::*;\\n\\n use evmap::ShallowCopy;\\n\\n\\n\\n impl<T> ShallowCopy for ThreadsafeWrapper<T>\\n\\n where\\n\\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\\n\",\n \"file_path\": \"src/thread_safety.rs\",\n \"rank\": 61,\n \"score\": 23.908005863300627\n },\n {\n \"content\": \"\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\npub use self::state::KeyedRateLimiter;\\n\\n\\n\\npub use self::errors::*;\\n\\n\\n\\n/// A facade around all the types we need from std/core crates, to\\n\\n/// avoid unnecessary cfg-conditionalization everywhere.\\n\\nmod lib {\\n\\n mod core {\\n\\n #[cfg(not(feature = \\\"std\\\"))]\\n\\n pub use core::*;\\n\\n\\n\\n #[cfg(feature = \\\"std\\\")]\\n\\n pub use std::*;\\n\\n }\\n\\n\\n\\n pub use self::core::clone::Clone;\\n\\n pub use self::core::cmp::{Eq, Ord, PartialEq};\\n\\n pub use self::core::default::Default;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 62,\n \"score\": 23.615734455797163\n },\n {\n \"content\": \" /// # #[macro_use] extern crate nonzero_ext;\\n\\n /// # extern crate ratelimit_meter;\\n\\n /// # fn main () {\\n\\n /// let _gcra = DirectRateLimiter::<LeakyBucket>::per_second(nonzero!(100u32));\\n\\n /// # }\\n\\n /// ```\\n\\n pub fn per_second(capacity: NonZeroU32) -> Self {\\n\\n Self::new(capacity, Duration::from_secs(1))\\n\\n }\\n\\n\\n\\n /// Return a builder that can be used to construct a rate limiter using\\n\\n /// the parameters passed to the Builder.\\n\\n pub fn build_with_capacity(capacity: NonZeroU32) -> Builder<P, A> {\\n\\n Builder {\\n\\n capacity,\\n\\n cell_weight: nonzero!(1u32),\\n\\n time_unit: Duration::from_secs(1),\\n\\n end_result: PhantomData,\\n\\n point_result: PhantomData,\\n\\n }\\n\",\n \"file_path\": \"src/state/direct.rs\",\n \"rank\": 63,\n \"score\": 23.460696391772323\n },\n {\n \"content\": \"use crate::lib::*;\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nuse parking_lot::Mutex;\\n\\n\\n\\n#[cfg(not(feature = \\\"std\\\"))]\\n\\nuse spin::Mutex;\\n\\n\\n\\n#[derive(Clone)]\\n\\n/// Wraps the atomic operations on a Decider's state in a threadsafe\\n\\n/// fashion.\\n\\npub(crate) struct ThreadsafeWrapper<T>\\n\\nwhere\\n\\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\\n\\n{\\n\\n data: Arc<Mutex<T>>,\\n\\n}\\n\\n\\n\\nimpl<T> Default for ThreadsafeWrapper<T>\\n\\nwhere\\n\",\n \"file_path\": \"src/thread_safety.rs\",\n \"rank\": 64,\n \"score\": 22.0587262527091\n },\n {\n \"content\": \"impl<P, A, K> KeyedRateLimiter<K, A, P>\\n\\nwhere\\n\\n P: instant::Absolute,\\n\\n A: Algorithm<P>,\\n\\n A::BucketState: KeyableRateLimitState<A, P>,\\n\\n K: Eq + Hash + Clone,\\n\\n{\\n\\n /// Construct a new rate limiter that allows `capacity` cells per\\n\\n /// time unit through.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use std::num::NonZeroU32;\\n\\n /// # use std::time::Duration;\\n\\n /// use ratelimit_meter::{KeyedRateLimiter};\\n\\n /// # #[macro_use] extern crate nonzero_ext;\\n\\n /// # extern crate ratelimit_meter;\\n\\n /// # fn main () {\\n\\n /// let _limiter = KeyedRateLimiter::<&str>::new(nonzero!(100u32), Duration::from_secs(5));\\n\\n /// # }\\n\\n /// ```\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 65,\n \"score\": 21.889820355539253\n },\n {\n \"content\": \"/// // After a sufficient time period, cells are allowed again:\\n\\n/// assert_eq!(Ok(()), limiter.check_at(now + ms*50));\\n\\n/// # }\\n\\n/// # #[cfg(not(feature = \\\"std\\\"))] fn main() {}\\n\\n/// ```\\n\\n#[derive(Debug, Clone)]\\n\\npub struct GCRA<P: instant::Relative = instant::TimeSource> {\\n\\n // The \\\"weight\\\" of a single packet in units of time.\\n\\n t: Duration,\\n\\n\\n\\n // The \\\"capacity\\\" of the bucket.\\n\\n tau: Duration,\\n\\n\\n\\n point: PhantomData<P>,\\n\\n}\\n\\n\\n\\nimpl<P: instant::Relative> Algorithm<P> for GCRA<P> {\\n\\n type BucketState = State<P>;\\n\\n\\n\\n type NegativeDecision = NotUntil<P>;\\n\",\n \"file_path\": \"src/algorithms/gcra.rs\",\n \"rank\": 66,\n \"score\": 21.740449115466646\n },\n {\n \"content\": \" ///\\n\\n /// # Panics\\n\\n /// Panics if an error occurs in acquiring any locks.\\n\\n pub(crate) fn measure_and_replace<F, E>(&self, f: F) -> Result<(), E>\\n\\n where\\n\\n F: Fn(&T) -> (Result<(), E>, Option<T>),\\n\\n {\\n\\n let mut data = self.data.lock();\\n\\n let (decision, new_data) = f(&*data);\\n\\n if let Some(new_data) = new_data {\\n\\n *data = new_data;\\n\\n }\\n\\n decision\\n\\n }\\n\\n\\n\\n /// Retrieves and returns a snapshot of the bucket state. This\\n\\n /// isn't thread safe, but can be used to restore an old copy of\\n\\n /// the bucket if necessary.\\n\\n ///\\n\\n /// # Thread safety\\n\\n /// This function operates threadsafely, but you're literally\\n\\n /// taking a copy of data that will change. Relying on the data\\n\\n /// that is returned *will* race.\\n\\n pub(crate) fn snapshot(&self) -> T {\\n\\n let data = self.data.lock();\\n\\n data.clone()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/thread_safety.rs\",\n \"rank\": 67,\n \"score\": 21.351725284997993\n },\n {\n \"content\": \"//! use std::time::Duration;\\n\\n//! use ratelimit_meter::{DirectRateLimiter, GCRA};\\n\\n//!\\n\\n//! # #[macro_use] extern crate nonzero_ext;\\n\\n//! # extern crate ratelimit_meter;\\n\\n//! # #[cfg(feature = \\\"std\\\")]\\n\\n//! # fn main () {\\n\\n//! // Allow 50 units/second across all threads:\\n\\n//! let mut lim = DirectRateLimiter::<GCRA>::per_second(nonzero!(50u32));\\n\\n//! let mut thread_lim = lim.clone();\\n\\n//! thread::spawn(move || { assert_eq!(Ok(()), thread_lim.check());});\\n\\n//! assert_eq!(Ok(()), lim.check());\\n\\n//! # }\\n\\n//! # #[cfg(not(feature = \\\"std\\\"))]\\n\\n//! # fn main() {}\\n\\n//! ```\\n\\n//!\\n\\n//! ## Usage with `no_std`\\n\\n//!\\n\\n//! `ratelimit_meter` can be used in `no_std` crates, with a reduced\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 68,\n \"score\": 21.17109467435181\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// # use std::time::Duration;\\n\\n /// use ratelimit_meter::{KeyedRateLimiter, GCRA};\\n\\n /// # #[macro_use] extern crate nonzero_ext;\\n\\n /// # extern crate ratelimit_meter;\\n\\n /// # fn main () {\\n\\n /// let _limiter = KeyedRateLimiter::<&str, GCRA>::per_second(nonzero!(100u32));\\n\\n /// # }\\n\\n /// ```\\n\\n pub fn per_second(capacity: NonZeroU32) -> Self {\\n\\n Self::new(capacity, Duration::from_secs(1))\\n\\n }\\n\\n\\n\\n /// Return a constructor that can be used to construct a keyed\\n\\n /// rate limiter with the builder pattern.\\n\\n pub fn build_with_capacity(capacity: NonZeroU32) -> Builder<K, P, A, RandomState> {\\n\\n Builder {\\n\\n capacity,\\n\\n ..Default::default()\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 70,\n \"score\": 21.08975637377748\n },\n {\n \"content\": \"use crate::lib::*;\\n\\nuse crate::{algorithms::Algorithm, instant, NegativeMultiDecision};\\n\\n\\n\\n/// A representation of a bare in-memory algorithm, without any bucket\\n\\n/// attached.\\n\\n#[derive(Debug)]\\n\\npub struct AlgorithmForTest<A: Algorithm<P>, P: instant::Relative>(A, PhantomData<P>);\\n\\n\\n\\nimpl<'a, A, P> AlgorithmForTest<A, P>\\n\\nwhere\\n\\n A: Algorithm<P>,\\n\\n P: instant::Relative,\\n\\n{\\n\\n pub fn new<U: Into<Option<NonZeroU32>>, D: Into<Option<Duration>>>(\\n\\n cap: NonZeroU32,\\n\\n weight: U,\\n\\n duration: D,\\n\\n ) -> Self {\\n\\n AlgorithmForTest(\\n\\n A::construct(\\n\",\n \"file_path\": \"src/test_utilities/algorithms.rs\",\n \"rank\": 71,\n \"score\": 21.035475491519005\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n/// A constructor for keyed rate limiters.\\n\\npub struct Builder<K: Eq + Hash + Clone, P: instant::Absolute, A: Algorithm<P>, H: BuildHasher> {\\n\\n end_result: PhantomData<(K, P, A)>,\\n\\n capacity: NonZeroU32,\\n\\n cell_weight: NonZeroU32,\\n\\n per_time_unit: Duration,\\n\\n hasher: H,\\n\\n map_capacity: Option<usize>,\\n\\n}\\n\\n\\n\\nimpl<K, A, P> Default for Builder<K, P, A, RandomState>\\n\\nwhere\\n\\n K: Eq + Hash + Clone,\\n\\n P: instant::Absolute,\\n\\n A: Algorithm<P>,\\n\\n A::BucketState: KeyableRateLimitState<A, P>,\\n\\n{\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 72,\n \"score\": 20.834384360374457\n },\n {\n \"content\": \" fn default() -> Self {\\n\\n DirectBucket(DirectRateLimiter::per_second(nonzero!(50u32)))\\n\\n }\\n\\n}\\n\\nimpl<A, P> DirectBucket<A, P>\\n\\nwhere\\n\\n P: instant::Relative,\\n\\n A: Algorithm<P>,\\n\\n{\\n\\n pub fn limiter(self) -> DirectRateLimiter<A, P> {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nmod std {\\n\\n use super::*;\\n\\n use crate::{algorithms::KeyableRateLimitState, instant::Absolute, KeyedRateLimiter};\\n\\n\\n\\n pub struct KeyedBucket<A: Algorithm<P>, P: Absolute>(KeyedRateLimiter<u32, A, P>)\\n\",\n \"file_path\": \"src/test_utilities/variants.rs\",\n \"rank\": 73,\n \"score\": 20.491963677853345\n },\n {\n \"content\": \" /// Allows all cells through unconditionally.\\n\\n fn test_n_and_update(\\n\\n &self,\\n\\n _state: &Self::BucketState,\\n\\n _n: u32,\\n\\n _t0: Always,\\n\\n ) -> Result<(), NegativeMultiDecision<Impossible>> {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n/// A pseudo-instant that never changes.\\n\\n///\\n\\n/// It is used to implement the `Allower` rate-limiter type, which\\n\\n/// never denies any requests.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\\n\\npub struct Always();\\n\\nimpl instant::Relative for Always {\\n\\n fn duration_since(&self, _other: Self) -> Duration {\\n\\n Duration::new(0, 0)\\n\",\n \"file_path\": \"src/example_algorithms.rs\",\n \"rank\": 74,\n \"score\": 19.808726105280748\n },\n {\n \"content\": \"///\\n\\n/// ```\\n\\n/// # use ratelimit_meter::{DirectRateLimiter, GCRA};\\n\\n/// # use std::num::NonZeroU32;\\n\\n/// # use std::time::{Instant, Duration};\\n\\n/// # #[macro_use] extern crate nonzero_ext;\\n\\n/// # extern crate ratelimit_meter;\\n\\n/// # #[cfg(feature = \\\"std\\\")]\\n\\n/// # fn main () {\\n\\n/// let mut limiter = DirectRateLimiter::<GCRA>::per_second(nonzero!(20u32));\\n\\n/// let now = Instant::now();\\n\\n/// let ms = Duration::from_millis(1);\\n\\n/// assert_eq!(Ok(()), limiter.check_at(now)); // the first cell is free\\n\\n/// for i in 0..20 {\\n\\n/// // Spam a lot:\\n\\n/// assert!(limiter.check_at(now).is_ok(), \\\"at {}\\\", i);\\n\\n/// }\\n\\n/// // We have exceeded the bucket capacity:\\n\\n/// assert!(limiter.check_at(now).is_err());\\n\\n///\\n\",\n \"file_path\": \"src/algorithms/gcra.rs\",\n \"rank\": 75,\n \"score\": 19.62834894516806\n },\n {\n \"content\": \" {\\n\\n unsafe fn shallow_copy(&mut self) -> Self {\\n\\n ThreadsafeWrapper {\\n\\n data: self.data.shallow_copy(),\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> ThreadsafeWrapper<T>\\n\\nwhere\\n\\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\\n\\n{\\n\\n #[inline]\\n\\n /// Wraps retrieving a bucket's data, calls a function to make a\\n\\n /// decision and return a new state, and then tries to set the\\n\\n /// state on the bucket.\\n\\n ///\\n\\n /// This function can loop and call the decision closure again if\\n\\n /// the bucket state couldn't be set.\\n\",\n \"file_path\": \"src/thread_safety.rs\",\n \"rank\": 76,\n \"score\": 19.44059592608305\n },\n {\n \"content\": \"use crate::lib::*;\\n\\nuse crate::{\\n\\n algorithms::{Algorithm, RateLimitState, RateLimitStateWithClock},\\n\\n instant,\\n\\n instant::Absolute,\\n\\n DirectRateLimiter, InconsistentCapacity, NegativeMultiDecision,\\n\\n};\\n\\n\\n\\n/// The most naive implementation of a rate-limiter ever: Always\\n\\n/// allows every cell through.\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use ratelimit_meter::DirectRateLimiter;\\n\\n/// use ratelimit_meter::example_algorithms::Allower;\\n\\n/// let mut allower = Allower::ratelimiter();\\n\\n/// assert!(allower.check().is_ok());\\n\\n/// ```\\n\\n#[derive(Default, Copy, Clone, Debug)]\\n\\npub struct Allower {}\\n\\n\\n\",\n \"file_path\": \"src/example_algorithms.rs\",\n \"rank\": 77,\n \"score\": 19.204893846907993\n },\n {\n \"content\": \" pub use self::core::fmt::Debug;\\n\\n pub use self::core::marker::{Copy, PhantomData, Send, Sized, Sync};\\n\\n pub use self::core::num::NonZeroU32;\\n\\n pub use self::core::ops::{Add, Sub};\\n\\n pub use self::core::time::Duration;\\n\\n\\n\\n pub use self::core::cmp;\\n\\n pub use self::core::fmt;\\n\\n\\n\\n /// Imports that are only available on std.\\n\\n #[cfg(feature = \\\"std\\\")]\\n\\n mod std {\\n\\n pub use std::collections::hash_map::RandomState;\\n\\n pub use std::hash::{BuildHasher, Hash};\\n\\n pub use std::sync::Arc;\\n\\n pub use std::time::Instant;\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"no_std\\\")]\\n\\n mod no_std {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 78,\n \"score\": 19.143042328014413\n },\n {\n \"content\": \"/// An object that allows incrementally constructing rate Limiter\\n\\n/// objects.\\n\\npub struct Builder<P, A>\\n\\nwhere\\n\\n P: instant::Relative,\\n\\n A: Algorithm<P> + Sized,\\n\\n{\\n\\n capacity: NonZeroU32,\\n\\n cell_weight: NonZeroU32,\\n\\n time_unit: Duration,\\n\\n end_result: PhantomData<A>,\\n\\n point_result: PhantomData<P>,\\n\\n}\\n\\n\\n\\nimpl<P, A> Builder<P, A>\\n\\nwhere\\n\\n P: instant::Relative,\\n\\n A: Algorithm<P> + Sized,\\n\\n{\\n\\n /// Sets the \\\"weight\\\" of each cell being checked against the\\n\",\n \"file_path\": \"src/state/direct.rs\",\n \"rank\": 79,\n \"score\": 19.101538227945493\n },\n {\n \"content\": \"#![cfg(feature = \\\"std\\\")]\\n\\n\\n\\nextern crate ratelimit_meter;\\n\\n#[macro_use]\\n\\nextern crate nonzero_ext;\\n\\n\\n\\nuse ratelimit_meter::{KeyedRateLimiter, GCRA};\\n\\nuse std::thread;\\n\\nuse std::time::{Duration, Instant};\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/keyed.rs\",\n \"rank\": 80,\n \"score\": 18.74248605809714\n },\n {\n \"content\": \"use crate::algorithms::Algorithm;\\n\\nuse crate::instant;\\n\\nuse crate::state::DirectRateLimiter;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Variant {\\n\\n GCRA,\\n\\n LeakyBucket,\\n\\n}\\n\\n\\n\\nimpl Variant {\\n\\n pub const ALL: &'static [Variant; 2] = &[Variant::GCRA, Variant::LeakyBucket];\\n\\n}\\n\\n\\n\\npub struct DirectBucket<A: Algorithm<P>, P: instant::Relative>(DirectRateLimiter<A, P>);\\n\\nimpl<A, P> Default for DirectBucket<A, P>\\n\\nwhere\\n\\n P: instant::Relative,\\n\\n A: Algorithm<P>,\\n\\n{\\n\",\n \"file_path\": \"src/test_utilities/variants.rs\",\n \"rank\": 81,\n \"score\": 18.619089299560475\n },\n {\n \"content\": \" state: A::BucketState,\\n\\n algorithm: A,\\n\\n}\\n\\n\\n\\nimpl<A, P> DirectRateLimiter<A, P>\\n\\nwhere\\n\\n P: instant::Relative,\\n\\n A: Algorithm<P>,\\n\\n{\\n\\n /// Construct a new rate limiter that allows `capacity` cells per\\n\\n /// time unit through.\\n\\n /// # Examples\\n\\n /// You can construct a GCRA rate limiter like so:\\n\\n /// ```\\n\\n /// # use std::num::NonZeroU32;\\n\\n /// # use std::time::Duration;\\n\\n /// use ratelimit_meter::{DirectRateLimiter, GCRA};\\n\\n /// # #[macro_use] extern crate nonzero_ext;\\n\\n /// # extern crate ratelimit_meter;\\n\\n /// # fn main () {\\n\",\n \"file_path\": \"src/state/direct.rs\",\n \"rank\": 82,\n \"score\": 18.442602500029345\n },\n {\n \"content\": \"\\n\\npub mod algorithms;\\n\\nmod errors;\\n\\npub mod example_algorithms;\\n\\npub mod instant;\\n\\npub mod state;\\n\\npub mod test_utilities;\\n\\nmod thread_safety;\\n\\n\\n\\n#[macro_use]\\n\\nextern crate nonzero_ext;\\n\\n\\n\\n#[cfg(not(feature = \\\"std\\\"))]\\n\\nextern crate alloc;\\n\\n\\n\\npub use self::algorithms::LeakyBucket;\\n\\npub use self::algorithms::NonConformance;\\n\\npub use self::algorithms::GCRA;\\n\\n\\n\\npub use self::state::DirectRateLimiter;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 83,\n \"score\": 18.305046802853873\n },\n {\n \"content\": \" /// let _gcra = DirectRateLimiter::<GCRA>::new(nonzero!(100u32), Duration::from_secs(5));\\n\\n /// # }\\n\\n /// ```\\n\\n ///\\n\\n /// and similarly, for a leaky bucket:\\n\\n /// ```\\n\\n /// # use std::time::Duration;\\n\\n /// use ratelimit_meter::{DirectRateLimiter, LeakyBucket};\\n\\n /// # #[macro_use] extern crate nonzero_ext;\\n\\n /// # extern crate ratelimit_meter;\\n\\n /// # fn main () {\\n\\n /// let _lb = DirectRateLimiter::<LeakyBucket>::new(nonzero!(100u32), Duration::from_secs(5));\\n\\n /// # }\\n\\n /// ```\\n\\n pub fn new(capacity: NonZeroU32, per_time_unit: Duration) -> Self {\\n\\n DirectRateLimiter {\\n\\n state: <A as Algorithm<P>>::BucketState::default(),\\n\\n algorithm: <A as Algorithm<P>>::construct(capacity, nonzero!(1u32), per_time_unit)\\n\\n .unwrap(),\\n\\n }\\n\",\n \"file_path\": \"src/state/direct.rs\",\n \"rank\": 84,\n \"score\": 18.244131637078375\n },\n {\n \"content\": \"//! An in-memory rate limiter that can make decisions for a single\\n\\n//! situation.\\n\\n\\n\\nuse crate::lib::*;\\n\\n\\n\\nuse crate::{\\n\\n algorithms::{Algorithm, DefaultAlgorithm},\\n\\n instant, InconsistentCapacity, NegativeMultiDecision,\\n\\n};\\n\\n\\n\\n/// An in-memory rate limiter that makes direct (un-keyed)\\n\\n/// rate-limiting decisions. Direct rate limiters can be used to\\n\\n/// e.g. regulate the transmission of packets on a single connection,\\n\\n/// or to ensure that an API client stays within a server's rate\\n\\n/// limit.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct DirectRateLimiter<\\n\\n A: Algorithm<P> = DefaultAlgorithm,\\n\\n P: instant::Relative = instant::TimeSource,\\n\\n> {\\n\",\n \"file_path\": \"src/state/direct.rs\",\n \"rank\": 85,\n \"score\": 17.422378766741474\n },\n {\n \"content\": \" T: fmt::Debug + Default + Clone + PartialEq + Eq,\\n\\n{\\n\\n fn default() -> Self {\\n\\n ThreadsafeWrapper {\\n\\n data: Arc::new(Mutex::new(T::default())),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> PartialEq<Self> for ThreadsafeWrapper<T>\\n\\nwhere\\n\\n T: fmt::Debug + Default + Clone + PartialEq + Eq,\\n\\n{\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n let mine = self.data.lock();\\n\\n let other = other.data.lock();\\n\\n *other == *mine\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/thread_safety.rs\",\n \"rank\": 86,\n \"score\": 17.13876654596169\n },\n {\n \"content\": \"//! fn sub(self, rhs: Duration) -> Always {\\n\\n//! self.0 - rhs\\n\\n//! }\\n\\n//! }\\n\\n//! ```\\n\\n//!\\n\\n//! Then, using that type to create a rate limiter with that time\\n\\n//! source is a little more verbose. It looks like this:\\n\\n//!\\n\\n//! ```rust,ignore\\n\\n//! let mut lim = DirectRateLimiter::<GCRA<MyInstant>,MyInstant>::per_second(nonzero!(50u32));\\n\\n//! lim.check().ok();\\n\\n//! ```\\n\\n\\n\\n// Allow using the alloc crate\\n\\n#![cfg_attr(not(feature = \\\"std\\\"), feature(alloc))]\\n\\n// Allow using ratelimit_meter without std\\n\\n#![cfg_attr(not(feature = \\\"std\\\"), no_std)]\\n\\n// Deny warnings\\n\\n#![cfg_attr(feature = \\\"cargo-clippy\\\", deny(warnings))]\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 87,\n \"score\": 16.400751236142703\n },\n {\n \"content\": \"#![doc(hidden)]\\n\\n//! A module for code shared between integration tests & benchmarks in this crate.\\n\\n\\n\\npub mod algorithms;\\n\\npub mod variants;\\n\\n\\n\\nuse crate::lib::*;\\n\\n\\n\\nuse crate::instant;\\n\\n\\n\\n/// Returns a \\\"current\\\" moment that's suitable for tests.\\n\",\n \"file_path\": \"src/test_utilities.rs\",\n \"rank\": 88,\n \"score\": 16.361968665074052\n },\n {\n \"content\": \" cap,\\n\\n weight.into().unwrap_or(nonzero!(1u32)),\\n\\n duration\\n\\n .into()\\n\\n .unwrap_or(crate::lib::Duration::from_secs(1)),\\n\\n )\\n\\n .unwrap(),\\n\\n PhantomData,\\n\\n )\\n\\n }\\n\\n\\n\\n pub fn algorithm(&'a self) -> &'a A {\\n\\n &self.0\\n\\n }\\n\\n\\n\\n pub fn state(&self) -> A::BucketState {\\n\\n A::BucketState::default()\\n\\n }\\n\\n\\n\\n pub fn check(&self, state: &A::BucketState, t0: P) -> Result<(), A::NegativeDecision> {\\n\",\n \"file_path\": \"src/test_utilities/algorithms.rs\",\n \"rank\": 89,\n \"score\": 16.328230948686638\n },\n {\n \"content\": \" self.0\\n\\n }\\n\\n }\\n\\n}\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\npub use self::std::*;\\n\\n\\n\\n// I really wish I could just have a function that returns an impl\\n\\n// Trait that was usable in all the benchmarks, but alas it should not\\n\\n// be so.\\n\\n#[doc(hidden)]\\n\\n#[macro_export]\\n\\nmacro_rules! bench_with_variants {\\n\\n ($variant:expr, $var:ident : $bucket:tt, $code:block) => {\\n\\n match $variant {\\n\\n $crate::test_utilities::variants::Variant::GCRA => {\\n\\n let mut $var =\\n\\n $bucket::<::ratelimit_meter::GCRA<Instant>, Instant>::default().limiter();\\n\\n $code\\n\\n }\\n\",\n \"file_path\": \"src/test_utilities/variants.rs\",\n \"rank\": 90,\n \"score\": 16.186615322549\n },\n {\n \"content\": \"impl<P: instant::Absolute> RateLimitStateWithClock<GCRA<P>, P> for State<P> {\\n\\n fn last_touched(&self, params: &GCRA<P>) -> P {\\n\\n let data = self.0.snapshot();\\n\\n data.0.unwrap_or_else(P::now) + params.tau\\n\\n }\\n\\n}\\n\\n\\n\\n/// Returned in case of a negative rate-limiting decision. Indicates\\n\\n/// the earliest instant that a cell might get accepted again.\\n\\n///\\n\\n/// To avoid thundering herd effects, client code should always add a\\n\\n/// random amount of jitter to wait time estimates.\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct NotUntil<P: instant::Relative>(P);\\n\\n\\n\\nimpl<P: instant::Relative> fmt::Display for NotUntil<P> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\\n\\n write!(f, \\\"rate-limited until {:?}\\\", self.0)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/algorithms/gcra.rs\",\n \"rank\": 91,\n \"score\": 16.13076406813945\n },\n {\n \"content\": \" self.0.test_and_update(state, t0)\\n\\n }\\n\\n\\n\\n pub fn check_n(\\n\\n &self,\\n\\n state: &A::BucketState,\\n\\n n: u32,\\n\\n t0: P,\\n\\n ) -> Result<(), NegativeMultiDecision<A::NegativeDecision>> {\\n\\n self.0.test_n_and_update(state, n, t0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<A, P> Default for AlgorithmForTest<A, P>\\n\\nwhere\\n\\n A: Algorithm<P>,\\n\\n P: instant::Relative,\\n\\n{\\n\\n fn default() -> Self {\\n\\n Self::new(nonzero!(1u32), None, None)\\n\",\n \"file_path\": \"src/test_utilities/algorithms.rs\",\n \"rank\": 92,\n \"score\": 15.839489085771632\n },\n {\n \"content\": \" fn default() -> Builder<K, P, A, RandomState> {\\n\\n Builder {\\n\\n end_result: PhantomData,\\n\\n map_capacity: None,\\n\\n capacity: nonzero!(1u32),\\n\\n cell_weight: nonzero!(1u32),\\n\\n per_time_unit: Duration::from_secs(1),\\n\\n hasher: RandomState::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<K, P, A, H> Builder<K, P, A, H>\\n\\nwhere\\n\\n K: Eq + Hash + Clone,\\n\\n P: instant::Absolute,\\n\\n A: Algorithm<P>,\\n\\n A::BucketState: KeyableRateLimitState<A, P>,\\n\\n H: BuildHasher,\\n\\n{\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 93,\n \"score\": 15.638373761470937\n },\n {\n \"content\": \"extern crate ratelimit_meter;\\n\\n#[macro_use]\\n\\nextern crate nonzero_ext;\\n\\n\\n\\nuse ratelimit_meter::{\\n\\n algorithms::Algorithm, test_utilities::current_moment, NegativeMultiDecision, NonConformance,\\n\\n GCRA,\\n\\n};\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/gcra.rs\",\n \"rank\": 94,\n \"score\": 15.488252300536889\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Tests whether a single cell can be accommodated at the given\\n\\n /// time stamp. See [`check`](#method.check).\\n\\n pub fn check_at(&mut self, at: P) -> Result<(), <A as Algorithm<P>>::NegativeDecision> {\\n\\n self.algorithm.test_and_update(&self.state, at)\\n\\n }\\n\\n\\n\\n /// Tests if `n` cells can be accommodated at the given time\\n\\n /// (`Instant::now()`), using [`check_n`](#method.check_n)\\n\\n pub fn check_n_at(\\n\\n &mut self,\\n\\n n: u32,\\n\\n at: P,\\n\\n ) -> Result<(), NegativeMultiDecision<<A as Algorithm<P>>::NegativeDecision>> {\\n\\n self.algorithm.test_n_and_update(&self.state, n, at)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<A, P> DirectRateLimiter<A, P>\\n\",\n \"file_path\": \"src/state/direct.rs\",\n \"rank\": 95,\n \"score\": 15.36191100649631\n },\n {\n \"content\": \"/// # use std::time::Duration;\\n\\n/// use ratelimit_meter::{KeyedRateLimiter};\\n\\n/// # #[macro_use] extern crate nonzero_ext;\\n\\n/// # extern crate ratelimit_meter;\\n\\n/// # fn main () {\\n\\n/// let mut limiter = KeyedRateLimiter::<&str>::new(nonzero!(1u32), Duration::from_secs(5));\\n\\n/// assert_eq!(Ok(()), limiter.check(\\\"customer1\\\")); // allowed!\\n\\n/// assert_ne!(Ok(()), limiter.check(\\\"customer1\\\")); // ...but now customer1 must wait 5 seconds.\\n\\n///\\n\\n/// assert_eq!(Ok(()), limiter.check(\\\"customer2\\\")); // it's customer2's first request!\\n\\n/// # }\\n\\n/// ```\\n\\n///\\n\\n/// # Expiring old keys\\n\\n/// If a key has not been checked in a long time, that key can be\\n\\n/// expired safely (the next rate limit check for that key would\\n\\n/// behave as if the key was not present in the map, after all). To\\n\\n/// remove the unused keys and free up space, use the\\n\\n/// [`cleanup`](method.cleanup) method:\\n\\n///\\n\",\n \"file_path\": \"src/state/keyed.rs\",\n \"rank\": 96,\n \"score\": 15.322748381475622\n },\n {\n \"content\": \"extern crate ratelimit_meter;\\n\\n#[macro_use]\\n\\nextern crate nonzero_ext;\\n\\n\\n\\nuse ratelimit_meter::{\\n\\n algorithms::Algorithm, test_utilities::current_moment, DirectRateLimiter, LeakyBucket,\\n\\n NegativeMultiDecision, NonConformance,\\n\\n};\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/leaky_bucket.rs\",\n \"rank\": 97,\n \"score\": 15.094237116391549\n },\n {\n \"content\": \"pub mod gcra;\\n\\npub mod leaky_bucket;\\n\\n\\n\\npub use self::gcra::*;\\n\\npub use self::leaky_bucket::*;\\n\\n\\n\\nuse crate::{instant, InconsistentCapacity, NegativeMultiDecision};\\n\\n\\n\\nuse crate::lib::*;\\n\\n\\n\\n/// The default rate limiting algorithm in this crate: The [\\\"leaky\\n\\n/// bucket\\\"](leaky_bucket/struct.LeakyBucket.html).\\n\\n///\\n\\n/// The leaky bucket algorithm is fairly easy to understand and has\\n\\n/// decent performance in most cases. If better threaded performance\\n\\n/// is needed, this crate also offers the\\n\\n/// [`GCRA`](gcra/struct.GCRA.html) algorithm.\\n\\npub type DefaultAlgorithm = LeakyBucket;\\n\\n\\n\\n/// Provides additional information about non-conforming cells, most\\n\\n/// importantly the earliest time until the next cell could be\\n\\n/// considered conforming.\\n\\n///\\n\\n/// Since this does not account for effects like thundering herds,\\n\\n/// users should always add random jitter to the times given.\\n\",\n \"file_path\": \"src/algorithms.rs\",\n \"rank\": 98,\n \"score\": 14.763519196033764\n },\n {\n \"content\": \"use std::time::Duration;\\n\\n\\n\\nuse ratelimit_meter::example_algorithms::{Allower, Always};\\n\\nuse ratelimit_meter::instant::Absolute;\\n\\nuse ratelimit_meter::test_utilities::algorithms::AlgorithmForTest;\\n\\n\\n\\nuse criterion::{black_box, Benchmark, Criterion, Throughput};\\n\\n\\n\",\n \"file_path\": \"benches/no_op.rs\",\n \"rank\": 99,\n \"score\": 14.701144375495856\n }\n]","isConversational":false}}},{"rowIdx":1178,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"languages/idl_gen/src/rust/con_idl.rs"},"repo_name":{"kind":"string","value":"adrianos42/native_idl"},"commit":{"kind":"string","value":"688de924e1e2244719a33aba40aae8b9dd10ede9"},"file_code":{"kind":"string","value":"use idl::idl_nodes::*;\nuse proc_macro2::{self, TokenStream};\nuse quote::format_ident;\n\npub(crate) fn get_rust_ty_ref(ty: &TypeName, references: bool) -> TokenStream {\n match ty {\n TypeName::Types(types) => match types {\n Types::NatInt => quote! { i64 },\n Types::NatFloat => quote! { f64 },\n Types::NatString => quote! { String },\n Types::NatBytes => quote! { Vec<u8> },\n Types::NatBool => quote! { bool },\n Types::NatUUID => quote! { Uuid },\n Types::NatNone => quote! { () },\n },\n TypeName::TypeFunction(value) => {\n let args = get_rust_ty_ref(&value.args, references);\n let ret = get_rust_ty_ref(&value.return_ty, references);\n quote! { #args -> #ret }\n }\n TypeName::TypeTuple(value) => {\n \n let mut fields_t = vec![];\n for ty in &value.fields {\n let ident = format_ident!(\"{}\", &ty.ident);\n let ty_ident = get_rust_ty_ref(&ty.ty, references);\n fields_t.push(quote! { #ident: #ty_ident })\n }\n let fields = fields_t.into_iter();\n quote! { ( #( #fields ),* ) }\n }\n TypeName::TypeArray(value) => {\n let ty = get_rust_ty_ref(&value.ty, references);\n quote! { Vec<#ty> }\n }\n TypeName::TypeMap(value) => {\n let ty = get_rust_ty_ref(&value.map_ty, references);\n let index_ty = get_rust_ty_ref(&value.index_ty, references);\n quote! { ::std::collections::HashMap<#index_ty, #ty> }\n }\n TypeName::TypeResult(value) => {\n let ok_ty = get_rust_ty_ref(&value.ok_ty, references);\n let err_ty = get_rust_ty_ref(&value.err_ty, references);\n quote! { Result<#ok_ty, #err_ty> }\n }\n TypeName::TypePair(value) => {\n let first_ty = get_rust_ty_ref(&value.first_ty, references);\n let second_ty = get_rust_ty_ref(&value.second_ty, references);\n quote! { (#first_ty, #second_ty) }\n }\n TypeName::TypeOption(value) => {\n let some_ty = get_rust_ty_ref(&value.some_ty, references);\n quote! { Option<#some_ty> }\n }\n TypeName::ListTypeName(value)\n | TypeName::EnumTypeName(value)\n | TypeName::StructTypeName(value)\n | TypeName::ConstTypeName(value) => {\n let ident = format_ident!(\"{}\", &value);\n if references {\n quote! { super::#ident }\n } else {\n quote! { #ident }\n }\n }\n TypeName::TypeStream(_) => {\n quote! { Box<dyn StreamInstance + Send + Sync> }\n }\n TypeName::InterfaceTypeName(value) => {\n let ident = format_ident!(\"{}Instance\", value);\n quote! { Box<dyn super::idl_impl::#ident> }\n }\n }\n}\n\npub(crate) fn get_rust_ty_name(ty: &TypeName) -> String {\n match ty {\n TypeName::Types(types) => match types {\n Types::NatInt => \"i64\".to_owned(),\n Types::NatFloat => \"f64\".to_owned(),\n Types::NatString => \"String\".to_owned(),\n Types::NatBytes => \"Vecu8\".to_owned(),\n Types::NatBool => \"bool\".to_owned(),\n Types::NatUUID => \"Uuid\".to_owned(),\n Types::NatNone => \"none\".to_owned(),\n },\n TypeName::TypeFunction(value) => {\n let args = get_rust_ty_name(&value.args);\n let ret = get_rust_ty_name(&value.return_ty);\n format!(\"Func{}Ret{}_\", args, ret)\n }\n TypeName::TypeTuple(value) => {\n \n let mut fields_t = String::new();\n for ty in &value.fields {\n let ty_ident = get_rust_ty_name(&ty.ty);\n fields_t.push_str(&ty_ident);\n }\n format!(\"Args{}_\", fields_t)\n }\n TypeName::TypeArray(value) => {\n let ty = get_rust_ty_name(&value.ty);\n format!(\"Vec{}_\", ty)\n }\n TypeName::TypeMap(value) => {\n let ty = get_rust_ty_name(&value.map_ty);\n let index_ty = get_rust_ty_name(&value.index_ty);\n format!(\"Map{}{}_\", ty, index_ty)\n }\n TypeName::TypeResult(value) => {\n let ok_ty = get_rust_ty_name(&value.ok_ty);\n let err_ty = get_rust_ty_name(&value.err_ty);\n format!(\"Result{}{}_\", ok_ty, err_ty)\n }\n TypeName::TypePair(value) => {\n let first_ty = get_rust_ty_name(&value.first_ty);\n let second_ty = get_rust_ty_name(&value.second_ty);\n format!(\"Pair{}{}_\", first_ty, second_ty)\n }\n TypeName::TypeOption(value) => {\n let some_ty = get_rust_ty_name(&value.some_ty);\n format!(\"Option{}_\", some_ty)\n }\n TypeName::ListTypeName(value)\n | TypeName::EnumTypeName(value)\n | TypeName::StructTypeName(value)\n | TypeName::ConstTypeName(value) => value.to_owned(),\n TypeName::TypeStream(value) => {\n let stream_ty = get_rust_ty_name(&value.s_ty);\n format!(\"Stream{}_\", stream_ty)\n }\n TypeName::InterfaceTypeName(value) => value.to_owned(),\n }\n}"},"prefix":{"kind":"string","value":"use idl::idl_nodes::*;\nuse proc_macro2::{self, TokenStream};\nuse quote::format_ident;\n\npub(crate) fn get_rust_ty_ref(ty: &TypeName, references: bool) -> TokenStream {\n match ty {\n TypeName::Types(types) => match types {\n Types::NatInt => quote! { i64 },\n Types::NatFloat => quote! { f64 },\n Types::NatString => quote! { String },\n Types::NatBytes => quote! { Vec<u8> },\n Types::NatBool => quote! { bool },\n Types::NatUUID => quote! { Uuid },\n Types::NatNone => quote! { () },\n },\n TypeName::TypeFunction(value) => {\n let args = get_rust_ty_ref(&value.args, references);\n let ret = get_rust_ty_ref(&value.return_ty, references);\n quote! { #args -> #ret }\n }\n TypeName::TypeTuple(value) => {\n \n let mut fields_t = vec![];\n for ty in &value.fields {\n let ident = format_ident!(\"{}\", &ty.ident);\n let ty_ident = get_rust_ty_ref(&ty.ty, references);\n fields_t.push(quote! { #ident: #ty_ident })\n }\n let fields = fields_t.into_iter();\n quote! { ( #( #fields ),* ) }\n }\n TypeName::TypeArray(value) => {\n let ty = get_rust_ty_ref(&value.ty, references);\n quote! { Vec<#ty> }\n }\n TypeName::TypeMap(value) => {\n let ty = get_rust_ty_ref(&value.map_ty, references);\n let index_ty = get_rust_ty_ref(&value.index_ty, references);\n quote! { ::std::collections::HashMap<#index_ty, #ty> }\n }\n TypeName::TypeResult(value) => {\n let ok_ty = get_rust_ty_ref(&value.ok_ty, references);\n let err_ty = get_rust_ty_ref(&value.err_ty, references);\n quote! { Result<#ok_ty, #err_ty> }\n }\n TypeName::TypePair(value) => {\n let first_ty = get_rust_ty_ref(&value.first_ty, references);\n let second_ty = get_rust_ty_ref(&value.second_ty, references);\n quote! { (#first_ty, #second_ty) }\n }\n TypeName::TypeOption(value) => {\n let some_ty = get_rust_ty_ref(&value.some_ty, references);\n quote! { Option<#some_ty> }\n }\n TypeName::ListTypeName(value)\n | TypeName::EnumTypeName(value)\n | TypeName::StructTypeName(value)\n | TypeName::ConstTypeName("},"suffix":{"kind":"string","value":" TypeName::InterfaceTypeName(value) => {\n let ident = format_ident!(\"{}Instance\", value);\n quote! { Box<dyn super::idl_impl::#ident> }\n }\n }\n}\n\npub(crate) fn get_rust_ty_name(ty: &TypeName) -> String {\n match ty {\n TypeName::Types(types) => match types {\n Types::NatInt => \"i64\".to_owned(),\n Types::NatFloat => \"f64\".to_owned(),\n Types::NatString => \"String\".to_owned(),\n Types::NatBytes => \"Vecu8\".to_owned(),\n Types::NatBool => \"bool\".to_owned(),\n Types::NatUUID => \"Uuid\".to_owned(),\n Types::NatNone => \"none\".to_owned(),\n },\n TypeName::TypeFunction(value) => {\n let args = get_rust_ty_name(&value.args);\n let ret = get_rust_ty_name(&value.return_ty);\n format!(\"Func{}Ret{}_\", args, ret)\n }\n TypeName::TypeTuple(value) => {\n \n let mut fields_t = String::new();\n for ty in &value.fields {\n let ty_ident = get_rust_ty_name(&ty.ty);\n fields_t.push_str(&ty_ident);\n }\n format!(\"Args{}_\", fields_t)\n }\n TypeName::TypeArray(value) => {\n let ty = get_rust_ty_name(&value.ty);\n format!(\"Vec{}_\", ty)\n }\n TypeName::TypeMap(value) => {\n let ty = get_rust_ty_name(&value.map_ty);\n let index_ty = get_rust_ty_name(&value.index_ty);\n format!(\"Map{}{}_\", ty, index_ty)\n }\n TypeName::TypeResult(value) => {\n let ok_ty = get_rust_ty_name(&value.ok_ty);\n let err_ty = get_rust_ty_name(&value.err_ty);\n format!(\"Result{}{}_\", ok_ty, err_ty)\n }\n TypeName::TypePair(value) => {\n let first_ty = get_rust_ty_name(&value.first_ty);\n let second_ty = get_rust_ty_name(&value.second_ty);\n format!(\"Pair{}{}_\", first_ty, second_ty)\n }\n TypeName::TypeOption(value) => {\n let some_ty = get_rust_ty_name(&value.some_ty);\n format!(\"Option{}_\", some_ty)\n }\n TypeName::ListTypeName(value)\n | TypeName::EnumTypeName(value)\n | TypeName::StructTypeName(value)\n | TypeName::ConstTypeName(value) => value.to_owned(),\n TypeName::TypeStream(value) => {\n let stream_ty = get_rust_ty_name(&value.s_ty);\n format!(\"Stream{}_\", stream_ty)\n }\n TypeName::InterfaceTypeName(value) => value.to_owned(),\n }\n}"},"middle":{"kind":"string","value":"value) => {\n let ident = format_ident!(\"{}\", &value);\n if references {\n quote! { super::#ident }\n } else {\n quote! { #ident }\n }\n }\n TypeName::TypeStream(_) => {\n quote! { Box<dyn StreamInstance + Send + Sync> }\n }\n"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1179,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/mqtt/listener.rs"},"repo_name":{"kind":"string","value":"Galhad/ratelmq"},"commit":{"kind":"string","value":"15395108681aa97b861d0364263ac7cd123d2b11"},"file_code":{"kind":"string","value":"use crate::mqtt::events::{ClientEvent, ServerEvent};\nuse crate::mqtt::packets::ControlPacket;\nuse crate::mqtt::transport::mqtt_bytes_stream::{MqttBytesReadStream, MqttBytesWriteStream};\nuse crate::mqtt::transport::packet_decoder::read_packet;\nuse crate::mqtt::transport::packet_encoder::write_packet;\nuse log::{debug, error, info, trace, warn};\nuse std::net::SocketAddr;\nuse tokio::io::Error;\nuse tokio::net::{TcpListener, TcpStream};\nuse tokio::select;\nuse tokio::sync::mpsc::{Receiver, Sender};\nuse tokio::sync::{broadcast, mpsc};\n\npub struct MqttListener {\n listener: TcpListener,\n client_event_tx: mpsc::Sender<ClientEvent>,\n ctrl_c_rx: broadcast::Receiver<()>,\n}\n\nimpl MqttListener {\n pub async fn bind(\n address: &str,\n client_event_tx: mpsc::Sender<ClientEvent>,\n ctrl_c_rx: broadcast::Receiver<()>,\n ) -> Result<MqttListener, Error> {\n debug!(\"Binding MQTT TCP to {}\", &address);\n\n let listener = TcpListener::bind(address).await.unwrap();\n info!(\"Listening for MQTT TCP connections on {}\", &address);\n\n let mqtt_listener = MqttListener {\n listener,\n client_event_tx,\n ctrl_c_rx,\n };\n Ok(mqtt_listener)\n }\n\n pub async fn start_accepting(mut self) {\n loop {\n select! {\n _ = self.ctrl_c_rx.recv() => {\n trace!(\"Stopping listener\");\n break;\n }\n _ = Self::accept(&self.listener, &self.client_event_tx) => {}\n }\n }\n }\n\n async fn accept(listener: &TcpListener, client_event_tx: &mpsc::Sender<ClientEvent>) {\n match listener.accept().await {\n Ok((socket, address)) => {\n let client_event_tx = client_event_tx.clone();\n tokio::spawn(async move {\n Self::handle_connection(socket, client_event_tx, address).await;\n });\n }\n Err(e) => {\n error!(\"Error while accepting connection: {:?}\", e);\n }\n }\n }\n\n async fn handle_connection(\n socket: TcpStream,\n client_event_tx: Sender<ClientEvent>,\n address: SocketAddr,\n ) {\n let (tcp_read, tcp_write) = socket.into_split();\n let (server_event_tx, server_event_rx) = mpsc::channel(32);\n\n let mut write_stream = MqttBytesWriteStream::new(4096, tcp_write);\n\n tokio::spawn(async move {\n Self::connection_write_loop(server_event_rx, &mut write_stream).await;\n });\n\n let mut read_stream = MqttBytesReadStream::new(4096, tcp_read);\n\n tokio::spawn(async move {\n Self::connection_read_loop(client_event_tx, server_event_tx, &mut read_stream, address)\n .await;\n });\n }\n\n async fn connection_read_loop(\n client_event_tx: Sender<ClientEvent>,\n server_event_tx: Sender<ServerEvent>,\n mut read_stream: &mut MqttBytesReadStream,\n address: SocketAddr,\n ) {\n \n let client_id;\n if let Ok(packet) = read_packet(&mut read_stream).await {\n trace!(\"Read the first packet: {:?}\", &packet);\n\n if let ControlPacket::Connect(c) = packet {\n \n client_id = c.client_id.clone();\n let event = ClientEvent::Connected(c, address, server_event_tx.clone());\n if let Err(e) = client_event_tx.send(event).await {\n error!(\"Error while sending client event to be processed: {}\", &e);\n }\n } else {\n warn!(\"The first received packet is not CONNECT\");\n return;\n }\n } else {\n return;\n }\n\n while let Ok(packet) = read_packet(&mut read_stream).await {\n trace!(\"Read packet: {:?}\", &packet);\n\n let event =\n ClientEvent::ControlPacket(client_id.clone(), packet, server_event_tx.clone());\n if let Err(e) = client_event_tx.send(event).await {\n error!(\"Error while sending client event to be processed: {}\", &e);\n }\n }\n trace!(\"Client read task ended\");\n }\n\n async fn connection_write_loop(\n mut server_event_rx: Receiver<ServerEvent>,\n mut write_stream: &mut MqttBytesWriteStream,\n ) {\n while let Some(event) = server_event_rx.recv().await {\n trace!(\"Received server event: {:?}\", &event);\n\n match event {\n ServerEvent::ControlPacket(packet) => {\n trace!(\"Writing packet: {:?}\", &packet);\n if let Err(e) = write_packet(&mut write_stream, packet).await {\n error!(\"Error while writing packet: {:?}\", &e);\n }\n }\n ServerEvent::Disconnect => {\n break;\n }\n }\n }\n\n trace!(\"Client write task ended\");\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::mqtt::events::{ClientEvent, ServerEvent};\nuse crate::mqtt::packets::ControlPacket;\nuse crate::mqtt::transport::mqtt_bytes_stream::{MqttBytesReadStream, MqttBytesWriteStream};\nuse crate::mqtt::transport::packet_decoder::read_packet;\nuse crate::mqtt::transport::packet_encoder::write_packet;\nuse log::{debug, error, info, trace, warn};\nuse std::net::SocketAddr;\nuse tokio::io::Error;\nuse tokio::net::{TcpListener, TcpStream};\nuse tokio::select;\nuse toki"},"suffix":{"kind":"string","value":"_tx = client_event_tx.clone();\n tokio::spawn(async move {\n Self::handle_connection(socket, client_event_tx, address).await;\n });\n }\n Err(e) => {\n error!(\"Error while accepting connection: {:?}\", e);\n }\n }\n }\n\n async fn handle_connection(\n socket: TcpStream,\n client_event_tx: Sender<ClientEvent>,\n address: SocketAddr,\n ) {\n let (tcp_read, tcp_write) = socket.into_split();\n let (server_event_tx, server_event_rx) = mpsc::channel(32);\n\n let mut write_stream = MqttBytesWriteStream::new(4096, tcp_write);\n\n tokio::spawn(async move {\n Self::connection_write_loop(server_event_rx, &mut write_stream).await;\n });\n\n let mut read_stream = MqttBytesReadStream::new(4096, tcp_read);\n\n tokio::spawn(async move {\n Self::connection_read_loop(client_event_tx, server_event_tx, &mut read_stream, address)\n .await;\n });\n }\n\n async fn connection_read_loop(\n client_event_tx: Sender<ClientEvent>,\n server_event_tx: Sender<ServerEvent>,\n mut read_stream: &mut MqttBytesReadStream,\n address: SocketAddr,\n ) {\n \n let client_id;\n if let Ok(packet) = read_packet(&mut read_stream).await {\n trace!(\"Read the first packet: {:?}\", &packet);\n\n if let ControlPacket::Connect(c) = packet {\n \n client_id = c.client_id.clone();\n let event = ClientEvent::Connected(c, address, server_event_tx.clone());\n if let Err(e) = client_event_tx.send(event).await {\n error!(\"Error while sending client event to be processed: {}\", &e);\n }\n } else {\n warn!(\"The first received packet is not CONNECT\");\n return;\n }\n } else {\n return;\n }\n\n while let Ok(packet) = read_packet(&mut read_stream).await {\n trace!(\"Read packet: {:?}\", &packet);\n\n let event =\n ClientEvent::ControlPacket(client_id.clone(), packet, server_event_tx.clone());\n if let Err(e) = client_event_tx.send(event).await {\n error!(\"Error while sending client event to be processed: {}\", &e);\n }\n }\n trace!(\"Client read task ended\");\n }\n\n async fn connection_write_loop(\n mut server_event_rx: Receiver<ServerEvent>,\n mut write_stream: &mut MqttBytesWriteStream,\n ) {\n while let Some(event) = server_event_rx.recv().await {\n trace!(\"Received server event: {:?}\", &event);\n\n match event {\n ServerEvent::ControlPacket(packet) => {\n trace!(\"Writing packet: {:?}\", &packet);\n if let Err(e) = write_packet(&mut write_stream, packet).await {\n error!(\"Error while writing packet: {:?}\", &e);\n }\n }\n ServerEvent::Disconnect => {\n break;\n }\n }\n }\n\n trace!(\"Client write task ended\");\n }\n}\n"},"middle":{"kind":"string","value":"o::sync::mpsc::{Receiver, Sender};\nuse tokio::sync::{broadcast, mpsc};\n\npub struct MqttListener {\n listener: TcpListener,\n client_event_tx: mpsc::Sender<ClientEvent>,\n ctrl_c_rx: broadcast::Receiver<()>,\n}\n\nimpl MqttListener {\n pub async fn bind(\n address: &str,\n client_event_tx: mpsc::Sender<ClientEvent>,\n ctrl_c_rx: broadcast::Receiver<()>,\n ) -> Result<MqttListener, Error> {\n debug!(\"Binding MQTT TCP to {}\", &address);\n\n let listener = TcpListener::bind(address).await.unwrap();\n info!(\"Listening for MQTT TCP connections on {}\", &address);\n\n let mqtt_listener = MqttListener {\n listener,\n client_event_tx,\n ctrl_c_rx,\n };\n Ok(mqtt_listener)\n }\n\n pub async fn start_accepting(mut self) {\n loop {\n select! {\n _ = self.ctrl_c_rx.recv() => {\n trace!(\"Stopping listener\");\n break;\n }\n _ = Self::accept(&self.listener, &self.client_event_tx) => {}\n }\n }\n }\n\n async fn accept(listener: &TcpListener, client_event_tx: &mpsc::Sender<ClientEvent>) {\n match listener.accept().await {\n Ok((socket, address)) => {\n let client_event"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#[derive(Debug)]\n\npub struct BuildInfo {\n\n pub version: &'static str,\n\n pub commit_hash: &'static str,\n\n}\n\n\n\npub const BUILD_INFO: BuildInfo = BuildInfo {\n\n version: env!(\"CARGO_PKG_VERSION\"),\n\n commit_hash: env!(\"BUILD_GIT_HASH\"),\n\n};\n","file_path":"src/config/build_info.rs","rank":0,"score":29942.31485936127},{"content":"fn validate_first_byte(actual: u8, expected: u8) -> Result<(), Error> {\n\n if actual == expected {\n\n Ok(())\n\n } else {\n\n Err(tokio::io::Error::new(\n\n ErrorKind::InvalidData,\n\n \"Malformed fixed header\",\n\n ))\n\n }\n\n}\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":1,"score":28100.719076282097},{"content":"use std::net::SocketAddr;\n\n\n\nuse log::{debug, error, info, trace};\n\nuse tokio::select;\n\nuse tokio::sync::mpsc::{Receiver, Sender};\n\nuse tokio::sync::{broadcast, mpsc};\n\n\n\nuse crate::broker::authentication::{FileIdentityManager, IdentityProvider};\n\nuse crate::broker::messaging::MessagingService;\n\nuse crate::broker::session::Session;\n\nuse crate::mqtt::events::{ClientEvent, ServerEvent};\n\nuse crate::mqtt::packets::connack::ConnAckReturnCode;\n\nuse crate::mqtt::packets::suback::SubAckPacket;\n\nuse crate::mqtt::packets::subscribe::SubscribePacket;\n\nuse crate::mqtt::packets::unsuback::UnSubAckPacket;\n\nuse crate::mqtt::packets::unsubscribe::UnsubscribePacket;\n\nuse crate::mqtt::packets::ControlPacket::{ConnAck, PingResp, SubAck, UnsubAck};\n\nuse crate::mqtt::packets::*;\n\nuse crate::settings::Settings;\n\n\n","file_path":"src/broker/manager.rs","rank":3,"score":8.31002326166239},{"content":"use crate::broker::authentication::FileIdentityManager;\n\nuse crate::broker::manager::Manager;\n\nuse crate::config::build_info::BUILD_INFO;\n\nuse crate::mqtt::listener::MqttListener;\n\nuse crate::settings::Settings;\n\nuse futures::future::join_all;\n\nuse log::{debug, info};\n\nuse tokio::signal;\n\nuse tokio::sync::broadcast;\n\nuse tokio::sync::mpsc;\n\n\n\npub async fn run(config_filename: &str) {\n\n info!(\n\n \"Initializing RatelMQ v{} ({})...\",\n\n BUILD_INFO.version,\n\n &BUILD_INFO.commit_hash[..10]\n\n );\n\n\n\n debug!(\"Using configuration file {}\", config_filename);\n\n let settings = Settings::new(config_filename).unwrap();\n","file_path":"src/application.rs","rank":4,"score":8.05011268131039},{"content":"use bytes::{Buf, BufMut, BytesMut};\n\nuse log::trace;\n\nuse tokio::io::{AsyncReadExt, AsyncWriteExt, Error, ErrorKind};\n\nuse tokio::net::tcp::{OwnedReadHalf, OwnedWriteHalf};\n\nuse tokio::net::TcpStream;\n\n\n\npub struct MqttBytesStream {\n\n read_buffer: BytesMut,\n\n write_buffer: BytesMut,\n\n tcp_stream: TcpStream,\n\n}\n\n\n\npub struct MqttBytesWriteStream {\n\n write_buffer: BytesMut,\n\n write_stream: OwnedWriteHalf,\n\n}\n\n\n\npub struct MqttBytesReadStream {\n\n read_buffer: BytesMut,\n\n read_stream: OwnedReadHalf,\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":5,"score":7.640292745878708},{"content":"// pub use self::build_info::*;\n\npub mod build_info;\n","file_path":"src/config/mod.rs","rank":6,"score":7.466998155383734},{"content":"use crate::broker::authentication::AuthenticationError::InvalidPassword;\n\nuse crate::broker::authentication::FileIdentityManagerError::InvalidEntry;\n\nuse std::collections::HashMap;\n\nuse std::io::Error;\n\nuse AuthenticationError::UserNotFound;\n\n\n\n#[derive(Debug)]\n\npub enum AuthenticationError {\n\n // UserNotFound(UserNotFound),\n\n // InvalidPassword(InvalidPassword),\n\n UserNotFound,\n\n InvalidPassword,\n\n}\n\n\n\n// #[derive(Debug, Clone)]\n\n// pub struct UserNotFound {\n\n// // pub username: &'static str,\n\n// }\n\n//\n\n// #[derive(Debug, Clone)]\n\n// pub struct InvalidPassword;\n\n\n","file_path":"src/broker/authentication.rs","rank":7,"score":7.305210950702282},{"content":"use clap::{App, Arg};\n\nuse dotenv::dotenv;\n\n\n\nuse ratelmq::config::build_info::BUILD_INFO;\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n dotenv().ok();\n\n env_logger::init();\n\n\n\n let version = format!(\"v{}({})\", BUILD_INFO.version, &BUILD_INFO.commit_hash[..10]);\n\n\n\n let argument_name_config = \"config\";\n\n\n\n let arguments = App::new(\"RatelMQ\")\n\n .version(version.as_str())\n\n .about(\"Efficient, reliable & scalable MQTT broker.\")\n\n .arg(\n\n Arg::new(argument_name_config)\n\n .short('c')\n","file_path":"src/main.rs","rank":9,"score":7.026954965850307},{"content":"use async_trait::async_trait;\n\nuse tokio::io::Error;\n\n\n\nuse crate::mqtt::transport::packet_decoder::PacketDecoder;\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct DisconnectPacket {}\n\n\n\n#[async_trait]\n\nimpl PacketDecoder for DisconnectPacket {\n\n fn parse_fixed_header_flags(&mut self, _: u8) -> Result<(), Error> {\n\n Ok(())\n\n }\n\n}\n","file_path":"src/mqtt/packets/disconnect.rs","rank":10,"score":6.563184976559407},{"content":" Ok(self.read_buffer.get_u8())\n\n }\n\n\n\n pub async fn get_u16(&mut self) -> Result<u16, Error> {\n\n self.wait_for_data(2).await?;\n\n\n\n Ok(self.read_buffer.get_u16())\n\n }\n\n\n\n pub async fn get_string(&mut self) -> Result<String, Error> {\n\n trace!(\"Parsing string size\");\n\n let string_size = self.get_u16().await? as usize;\n\n trace!(\"String size: {} ({:#04x})\", string_size, string_size);\n\n trace!(\"Parsing string buf\");\n\n let str_buf = self.get_bytes(string_size).await?;\n\n\n\n let str = std::str::from_utf8(str_buf.as_ref()).map_err(|e| {\n\n Error::new(\n\n ErrorKind::InvalidData,\n\n format!(\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":11,"score":6.456973949542382},{"content":" trace!(\"String size: {} ({:#04x})\", string_size, string_size);\n\n trace!(\"Parsing string buf\");\n\n let str_buf = self.get_bytes(string_size).await?;\n\n\n\n let str = std::str::from_utf8(str_buf.as_ref()).map_err(|e| {\n\n Error::new(\n\n ErrorKind::InvalidData,\n\n format!(\n\n \"Invalid UTF8 String: error at position {}\",\n\n e.valid_up_to() + 1\n\n ),\n\n )\n\n })?;\n\n\n\n Ok(String::from(str))\n\n }\n\n\n\n pub async fn get_bytes(&mut self, size: usize) -> Result<BytesMut, Error> {\n\n let mut bytes = BytesMut::with_capacity(size);\n\n\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":12,"score":6.318806721891911},{"content":"use crate::mqtt::packets::puback::PubAckPacket;\n\nuse crate::mqtt::packets::pubcomp::PubCompPacket;\n\nuse crate::mqtt::packets::pubrec::PubRecPacket;\n\nuse crate::mqtt::packets::pubrel::PubRelPacket;\n\nuse crate::mqtt::packets::subscribe::SubscribePacket;\n\nuse crate::mqtt::packets::unsubscribe::UnsubscribePacket;\n\nuse crate::mqtt::packets::{\n\n ConnectPacket, ControlPacket, DisconnectPacket, ProtocolVersion, PublishPacket, QoS,\n\n};\n\nuse crate::mqtt::packets::{\n\n PACKET_TYPE_CONNECT, PACKET_TYPE_DISCONNECT, PACKET_TYPE_PING_REQ, PACKET_TYPE_PUBLISH,\n\n PACKET_TYPE_PUB_ACK, PACKET_TYPE_PUB_COMP, PACKET_TYPE_PUB_REC, PACKET_TYPE_PUB_REL,\n\n PACKET_TYPE_SUBSCRIBE, PACKET_TYPE_UNSUBSCRIBE,\n\n};\n\nuse crate::mqtt::subscription::Subscription;\n\nuse crate::mqtt::transport::mqtt_bytes_stream::MqttBytesReadStream;\n\nuse async_trait::async_trait;\n\nuse bitflags::bitflags;\n\nuse tokio::io::{Error, ErrorKind};\n\n\n\n#[async_trait]\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":14,"score":5.881202332791689},{"content":"use log::warn;\n\n\n\nuse crate::broker::messaging::subscriptions_repository::SubscriptionsRepository;\n\nuse crate::broker::session::session_repository::SessionRepository;\n\nuse crate::broker::session::{InMemorySessionRepository, Session};\n\nuse crate::mqtt::events::ServerEvent;\n\nuse crate::mqtt::message::Message;\n\nuse crate::mqtt::packets::suback::SubAckReturnCode;\n\nuse crate::mqtt::packets::ControlPacket::Publish;\n\nuse crate::mqtt::packets::{ClientId, PublishPacket};\n\nuse crate::mqtt::subscription::Subscription;\n\n\n\npub struct MessagingService {\n\n sessions: InMemorySessionRepository,\n\n subscriptions: SubscriptionsRepository,\n\n}\n\n\n\nimpl MessagingService {\n\n pub fn new() -> Self {\n\n MessagingService {\n","file_path":"src/broker/messaging/messaging_service.rs","rank":15,"score":5.750015083155831},{"content":" read_buffer: BytesMut::with_capacity(buffer_size),\n\n read_stream,\n\n }\n\n }\n\n\n\n pub async fn get_u8(&mut self) -> Result<u8, Error> {\n\n self.wait_for_data(1).await?;\n\n\n\n Ok(self.read_buffer.get_u8())\n\n }\n\n\n\n pub async fn get_u16(&mut self) -> Result<u16, Error> {\n\n self.wait_for_data(2).await?;\n\n\n\n Ok(self.read_buffer.get_u16())\n\n }\n\n\n\n pub async fn get_string(&mut self) -> Result<String, Error> {\n\n trace!(\"Parsing string size\");\n\n let string_size = self.get_u16().await? as usize;\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":16,"score":5.190599357919163},{"content":" \"Invalid UTF8 String: error at position {}\",\n\n e.valid_up_to() + 1\n\n ),\n\n )\n\n })?;\n\n\n\n Ok(String::from(str))\n\n }\n\n\n\n pub async fn get_bytes(&mut self, size: usize) -> Result<BytesMut, Error> {\n\n let mut bytes = BytesMut::with_capacity(size);\n\n\n\n let mut remaining_length = size;\n\n\n\n while remaining_length > 0 {\n\n // todo: use clamp when stabilized\n\n let wait_for_bytes = {\n\n if remaining_length > self.read_buffer.capacity() {\n\n self.read_buffer.capacity()\n\n } else {\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":17,"score":5.133721816412278},{"content":"use async_trait::async_trait;\n\nuse bitflags::bitflags;\n\nuse tokio::io::Error;\n\n\n\nuse crate::mqtt::packets::puback::PubAckPacket;\n\nuse crate::mqtt::packets::pubcomp::PubCompPacket;\n\nuse crate::mqtt::packets::pubrec::PubRecPacket;\n\nuse crate::mqtt::packets::pubrel::PubRelPacket;\n\nuse crate::mqtt::packets::suback::SubAckPacket;\n\nuse crate::mqtt::packets::unsuback::UnSubAckPacket;\n\nuse crate::mqtt::packets::{\n\n ConnAckPacket, ControlPacket, PublishPacket, QoS, PACKET_TYPE_CONN_ACK, PACKET_TYPE_PING_RESP,\n\n PACKET_TYPE_PUBLISH, PACKET_TYPE_PUB_ACK, PACKET_TYPE_PUB_COMP, PACKET_TYPE_PUB_REC,\n\n PACKET_TYPE_PUB_REL, PACKET_TYPE_SUB_ACK, PACKET_TYPE_UNSUB_ACK,\n\n};\n\nuse crate::mqtt::transport::mqtt_bytes_stream::{MqttBytesStream, MqttBytesWriteStream};\n\n\n\n#[async_trait]\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":18,"score":5.129927965350056},{"content":"use config::{Config, ConfigError, Environment, File, FileFormat};\n\nuse serde::Deserialize;\n\n\n\n#[derive(Debug, Deserialize)]\n\npub struct MqttSettings {\n\n pub listeners_tcp: Vec<String>,\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\npub struct AuthenticationSettings {\n\n pub password_file: String,\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\npub struct Settings {\n\n pub mqtt: MqttSettings,\n\n pub authentication: AuthenticationSettings,\n\n}\n\n\n\nimpl Settings {\n","file_path":"src/settings/mod.rs","rank":19,"score":5.078869965692634},{"content":"pub use crate::mqtt::packets::connack::ConnAckPacket;\n\npub use crate::mqtt::packets::connect::ConnectPacket;\n\npub use crate::mqtt::packets::disconnect::DisconnectPacket;\n\nuse crate::mqtt::packets::puback::PubAckPacket;\n\nuse crate::mqtt::packets::pubcomp::PubCompPacket;\n\npub use crate::mqtt::packets::publish::PublishPacket;\n\nuse crate::mqtt::packets::pubrec::PubRecPacket;\n\nuse crate::mqtt::packets::pubrel::PubRelPacket;\n\nuse crate::mqtt::packets::suback::SubAckPacket;\n\nuse crate::mqtt::packets::subscribe::SubscribePacket;\n\nuse crate::mqtt::packets::unsuback::UnSubAckPacket;\n\nuse crate::mqtt::packets::unsubscribe::UnsubscribePacket;\n\nuse crate::mqtt::packets::ControlPacket::{\n\n ConnAck, Connect, Disconnect, PingReq, PingResp, PubAck, PubComp, PubRec, PubRel, Publish,\n\n SubAck, Subscribe, UnsubAck, Unsubscribe,\n\n};\n\nuse crate::mqtt::packets::ProtocolVersion::Mqtt3;\n\nuse crate::mqtt::packets::QoS::{AtLeastOnce, AtMostOnce, ExactlyOnce};\n\nuse std::fmt;\n\nuse std::fmt::{Display, Formatter};\n","file_path":"src/mqtt/packets/mod.rs","rank":21,"score":4.104120113332452},{"content":"use crate::broker::session::Session;\n\nuse crate::mqtt::packets::ClientId;\n\nuse std::collections::HashMap;\n\n\n","file_path":"src/broker/session/session_repository.rs","rank":22,"score":4.0604927596834575},{"content":"use bytes::BytesMut;\n\nuse tokio::io::AsyncReadExt;\n\nuse tokio::net::{TcpListener, TcpStream};\n\n\n\nuse ratelmq::mqtt::packets::puback::PubAckPacket;\n\nuse ratelmq::mqtt::packets::pubcomp::PubCompPacket;\n\nuse ratelmq::mqtt::packets::pubrec::PubRecPacket;\n\nuse ratelmq::mqtt::packets::pubrel::PubRelPacket;\n\nuse ratelmq::mqtt::packets::suback::{SubAckPacket, SubAckReturnCode};\n\nuse ratelmq::mqtt::packets::unsuback::UnSubAckPacket;\n\nuse ratelmq::mqtt::packets::{ConnAckPacket, ControlPacket, PublishPacket, QoS};\n\nuse ratelmq::mqtt::transport::mqtt_bytes_stream::MqttBytesWriteStream;\n\nuse ratelmq::mqtt::transport::packet_encoder;\n\n\n\n#[tokio::test]\n\nasync fn it_write_conn_ack() {\n\n let conn_ack = ConnAckPacket::default();\n\n\n\n let data = write_packet(ControlPacket::ConnAck(conn_ack)).await;\n\n assert_bytes(data, vec![0x20, 0x02, 0x00, 0x00])\n","file_path":"tests/write_packets.rs","rank":24,"score":3.9358113007900766},{"content":"mod session_entity;\n\npub(crate) mod session_repository;\n\nmod session_service;\n\n\n\npub use self::session_entity::Session;\n\npub use self::session_repository::InMemorySessionRepository;\n\npub use self::session_repository::SessionRepository;\n\npub use self::session_service::SessionService;\n","file_path":"src/broker/session/mod.rs","rank":25,"score":3.913635549514639},{"content":"use std::collections::HashMap;\n\nuse std::fs::remove_dir;\n\n\n\nuse crate::mqtt::packets::suback::SubAckReturnCode;\n\nuse crate::mqtt::packets::ClientId;\n\nuse crate::mqtt::subscription::Subscription;\n\n\n\npub struct SubscriptionsRepository {\n\n root: SubscriptionNode,\n\n}\n\n\n\nimpl SubscriptionsRepository {\n\n pub fn new() -> SubscriptionsRepository {\n\n SubscriptionsRepository {\n\n root: SubscriptionNode::new(),\n\n }\n\n }\n\n\n\n pub fn subscribe(\n\n &mut self,\n","file_path":"src/broker/messaging/subscriptions_repository.rs","rank":26,"score":3.855287358356077},{"content":" return if clean_shutdown {\n\n Err(tokio::io::Error::new(\n\n ErrorKind::ConnectionReset,\n\n \"connection reset by peer\",\n\n ))\n\n } else {\n\n // closed while sending\n\n Err(tokio::io::Error::new(\n\n ErrorKind::ConnectionReset,\n\n \"connection interrupted, reset by peer\",\n\n ))\n\n };\n\n }\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl MqttBytesStream {\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":27,"score":3.829622344600214},{"content":" listeners.push(tokio::spawn(listener.start_accepting()));\n\n }\n\n\n\n info!(\"Initialized RatelMQ\");\n\n\n\n signal::ctrl_c().await.unwrap();\n\n\n\n info!(\"Stopping RatelMQ\");\n\n ctrl_c_tx.send(()).unwrap();\n\n\n\n join_all(listeners).await;\n\n\n\n manager_future.await.unwrap();\n\n\n\n info!(\"RatelMQ stopped\");\n\n}\n","file_path":"src/application.rs","rank":28,"score":3.8013587968646},{"content":" };\n\n }\n\n\n\n async fn on_connect(\n\n &mut self,\n\n sender: Sender<ServerEvent>,\n\n packet: ConnectPacket,\n\n address: SocketAddr,\n\n ) {\n\n debug!(\"New client {:?} connected\", &packet.client_id);\n\n\n\n if let Some(user_name) = packet.user_name {\n\n let password = packet.password.unwrap();\n\n if let Err(e) = self.identity_provider.authenticate(&user_name, &password) {\n\n info!(\"Client {} authentication error: {:?}\", &user_name, &e);\n\n\n\n let conn_ack = ConnAckPacket::new(false, ConnAckReturnCode::NotAuthorized);\n\n sender\n\n .send(ServerEvent::ControlPacket(ControlPacket::ConnAck(conn_ack)))\n\n .await\n","file_path":"src/broker/manager.rs","rank":29,"score":3.6771623722735436},{"content":"use crate::mqtt::events::ServerEvent;\n\nuse crate::mqtt::packets::ClientId;\n\nuse std::net::IpAddr;\n\nuse tokio::sync::mpsc::Sender;\n\n\n\npub struct Session {\n\n client_id: ClientId,\n\n ip: IpAddr,\n\n persistent: bool,\n\n sender: Sender<ServerEvent>,\n\n}\n\n\n\nimpl Session {\n\n pub fn new(\n\n client_id: ClientId,\n\n ip: IpAddr,\n\n persistent: bool,\n\n sender: Sender<ServerEvent>,\n\n ) -> Self {\n\n Session {\n","file_path":"src/broker/session/session_entity.rs","rank":30,"score":3.6031310694014254},{"content":" async fn wait_for_data(&mut self, bytes: usize) -> Result<(), Error> {\n\n while self.read_buffer.len() < bytes {\n\n let read_bytes_num = self.read_stream.read_buf(&mut self.read_buffer).await?;\n\n\n\n // todo: Handle better?\n\n let connection_closed = read_bytes_num == 0; // end of file\n\n if connection_closed {\n\n let clean_shutdown = self.read_buffer.is_empty();\n\n return if clean_shutdown {\n\n Err(tokio::io::Error::new(\n\n ErrorKind::ConnectionReset,\n\n \"connection reset by peer\",\n\n ))\n\n } else {\n\n // closed while sending\n\n Err(tokio::io::Error::new(\n\n ErrorKind::ConnectionReset,\n\n \"connection interrupted, reset by peer\",\n\n ))\n\n };\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":31,"score":3.572207518283132},{"content":"use std::process::Command;\n\n\n","file_path":"build.rs","rank":32,"score":3.5537417262102156},{"content":"use tokio::io::AsyncWriteExt;\n\nuse tokio::net::{TcpListener, TcpStream};\n\n\n\nuse ratelmq::mqtt::packets::{ControlPacket, ProtocolVersion, QoS};\n\nuse ratelmq::mqtt::subscription::Subscription;\n\nuse ratelmq::mqtt::transport::mqtt_bytes_stream::MqttBytesReadStream;\n\nuse ratelmq::mqtt::transport::packet_decoder;\n\n\n\n#[tokio::test]\n\nasync fn it_read_connect_min() {\n\n const DATA: &[u8] = &[\n\n 0x10, 0x23, 0x00, 0x04, 0x4d, 0x51, 0x54, 0x54, 0x04, 0x02, 0x00, 0x3c, 0x00, 0x17, 0x6d,\n\n 0x6f, 0x73, 0x71, 0x2d, 0x6e, 0x73, 0x36, 0x73, 0x7a, 0x33, 0x6b, 0x33, 0x6c, 0x62, 0x66,\n\n 0x4d, 0x31, 0x49, 0x66, 0x62, 0x63, 0x52,\n\n ];\n\n\n\n let packet = read_packet(DATA).await;\n\n\n\n match packet {\n\n ControlPacket::Connect(connect) => {\n","file_path":"tests/read_packets.rs","rank":33,"score":3.5170258650180655},{"content":" return Err(tokio::io::Error::new(\n\n ErrorKind::InvalidData,\n\n \"Malformed payload\",\n\n ));\n\n }\n\n\n\n let mut subscriptions = Vec::new();\n\n while remaining_length > 0 {\n\n let topic = buffer.get_string().await?;\n\n let qos = buffer.get_u8().await?;\n\n if qos > 2 {\n\n return Err(tokio::io::Error::new(\n\n ErrorKind::InvalidData,\n\n \"Malformed QoS\",\n\n ));\n\n }\n\n\n\n remaining_length -= topic.len() as u64 + 3u64 /* 2 topic length + QoS*/;\n\n\n\n let subscription = Subscription::new(topic, QoS::from_bits(qos));\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":34,"score":3.4849819764707277},{"content":"use crate::broker::session::session_repository::SessionRepository;\n\nuse crate::broker::session::Session;\n\nuse crate::mqtt::packets::ClientId;\n\n\n\n#[derive(Default)]\n\npub struct SessionService<T>\n\nwhere\n\n T: SessionRepository,\n\n{\n\n repository: T,\n\n}\n\n\n\nimpl<T> SessionService<T>\n\nwhere\n\n T: SessionRepository,\n\n{\n\n pub fn new(repository: T) -> Self {\n\n SessionService { repository }\n\n }\n\n\n","file_path":"src/broker/session/session_service.rs","rank":35,"score":3.469602781372993},{"content":"\n\nimpl Default for InMemorySessionRepository {\n\n fn default() -> Self {\n\n InMemorySessionRepository {\n\n sessions: HashMap::new(),\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::net::{IpAddr, Ipv4Addr};\n\n use tokio::sync::mpsc;\n\n\n\n fn create_session() -> Session {\n\n let (tx, _rx) = mpsc::channel(32);\n\n Session::new(\n\n \"client-1\".to_string(),\n\n IpAddr::V4(Ipv4Addr::LOCALHOST),\n","file_path":"src/broker/session/session_repository.rs","rank":36,"score":3.4362660203051827},{"content":"use crate::mqtt::packets::QoS;\n\nuse bytes::BytesMut;\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct Message {\n\n pub topic: String,\n\n pub payload: BytesMut,\n\n pub qos: QoS,\n\n pub retain: bool,\n\n}\n","file_path":"src/mqtt/message.rs","rank":37,"score":3.320150933331645},{"content":" }\n\n}\n\n\n\npub async fn decode_remaining_length(buffer: &mut MqttBytesReadStream) -> Result<u64, Error> {\n\n let mut remaining_length = 0u64;\n\n let mut multiplier = 1u64;\n\n\n\n loop {\n\n let byte = buffer.get_u8().await?;\n\n remaining_length += (byte & 127) as u64 * multiplier;\n\n multiplier *= 128;\n\n\n\n if multiplier > 128 * 128 * 128 {\n\n return Err(tokio::io::Error::new(\n\n ErrorKind::InvalidData,\n\n \"Malformed remaining length multiplier\",\n\n ));\n\n }\n\n\n\n let continuation_bit = byte & 128;\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":38,"score":3.3168330273709183},{"content":"use crate::mqtt::message::Message;\n\nuse crate::mqtt::packets::QoS;\n\nuse bytes::BytesMut;\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct PublishPacket {\n\n pub packet_id: Option<u16>,\n\n pub dup: bool,\n\n\n\n pub message: Message,\n\n}\n\n\n\nimpl PublishPacket {\n\n pub fn new(\n\n topic: String,\n\n body: BytesMut,\n\n qos: QoS,\n\n retain: bool,\n\n packet_id: Option<u16>,\n\n dup: bool,\n","file_path":"src/mqtt/packets/publish.rs","rank":39,"score":3.3090880302382617},{"content":"use crate::mqtt::packets::{ClientId, ConnectPacket, ControlPacket};\n\nuse std::net::SocketAddr;\n\nuse tokio::sync::mpsc::Sender;\n\n\n\n#[derive(Debug)]\n\npub enum ClientEvent {\n\n Connected(ConnectPacket, SocketAddr, Sender<ServerEvent>),\n\n ControlPacket(ClientId, ControlPacket, Sender<ServerEvent>),\n\n Disconnected(ClientId),\n\n ConnectionLost(ClientId),\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum ServerEvent {\n\n ControlPacket(ControlPacket),\n\n Disconnect,\n\n}\n","file_path":"src/mqtt/events.rs","rank":40,"score":3.2637900681751377},{"content":"use crate::mqtt::packets::QoS;\n\nuse std::fmt;\n\nuse std::fmt::{Display, Formatter};\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct Subscription {\n\n topic: String,\n\n qos: QoS,\n\n}\n\n\n\nimpl Display for Subscription {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n write!(f, \"topic: '{}' QoS: {}\", self.topic, self.qos)\n\n }\n\n}\n\n\n\nimpl Subscription {\n\n pub fn new(topic: String, qos: QoS) -> Subscription {\n\n Subscription { topic, qos }\n\n }\n\n\n\n pub fn topic(&self) -> &str {\n\n self.topic.as_str()\n\n }\n\n}\n","file_path":"src/mqtt/subscription.rs","rank":41,"score":3.2637900681751377},{"content":" pub async fn put_u8(&mut self, n: u8) -> Result<(), Error> {\n\n self.write_buffer_if_too_small(1).await?;\n\n\n\n self.write_buffer.put_u8(n);\n\n Ok(())\n\n }\n\n\n\n pub async fn put_u16(&mut self, n: u16) -> Result<(), Error> {\n\n self.write_buffer_if_too_small(2).await?;\n\n\n\n self.write_buffer.put_u16(n);\n\n Ok(())\n\n }\n\n\n\n pub async fn put_string(&mut self, string: &str) -> Result<(), Error> {\n\n self.put_u16(string.len() as u16).await?;\n\n self.put_bytes(BytesMut::from(string.as_bytes())).await?;\n\n\n\n Ok(())\n\n }\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":42,"score":3.209914666530279},{"content":" }\n\n\n\n pub async fn put_u16(&mut self, n: u16) -> Result<(), Error> {\n\n self.write_buffer_if_too_small(2).await?;\n\n\n\n self.write_buffer.put_u16(n);\n\n Ok(())\n\n }\n\n\n\n pub async fn put_string(&mut self, string: &str) -> Result<(), Error> {\n\n self.put_u16(string.len() as u16).await?;\n\n self.put_bytes(BytesMut::from(string.as_bytes())).await?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub async fn put_bytes(&mut self, mut bytes: BytesMut) -> Result<(), Error> {\n\n let mut remaining_size = bytes.len();\n\n\n\n while remaining_size > 0 {\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":43,"score":3.19520073299748},{"content":"mod messaging_service;\n\n\n\nmod subscriptions_repository;\n\n\n\npub use self::messaging_service::MessagingService;\n","file_path":"src/broker/messaging/mod.rs","rank":44,"score":3.1751366783827146},{"content":" subscriptions.push(subscription);\n\n }\n\n\n\n let packet = SubscribePacket::new(packet_id, subscriptions);\n\n Ok(ControlPacket::Subscribe(packet))\n\n}\n\n\n\nasync fn decode_unsubscribe(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n mut remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b10100010).await?;\n\n remaining_length -= 2;\n\n\n\n if remaining_length == 0 {\n\n return Err(tokio::io::Error::new(\n\n ErrorKind::InvalidData,\n\n \"Malformed payload\",\n\n ));\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":45,"score":3.1518573199213447},{"content":" trace!(\"Got packet {:?}\", packet);\n\n\n\n match packet {\n\n // ControlPacket::Connect(c) => {\n\n // self.on_connect(action.response, c, &mut sessions).await\n\n // }\n\n // ControlPacket::ConnAck(_) => {}\n\n ControlPacket::Publish(p) => self.on_publish(tx, p, client_id).await,\n\n // ControlPacket::PubAck(_) => {}\n\n // ControlPacket::PubRec(_) => {}\n\n // ControlPacket::PubRel(_) => {}\n\n // ControlPacket::PubComp(_) => {}\n\n ControlPacket::Subscribe(p) => self.on_subscribe(tx, p, &client_id).await,\n\n // ControlPacket::SubAck(_) => {}\n\n ControlPacket::Unsubscribe(p) => self.on_unsubscribe(tx, p, &client_id).await,\n\n // ControlPacket::UnsubAck(_) => {}\n\n ControlPacket::PingReq => self.on_ping_req(tx).await,\n\n // ControlPacket::PingResp() => {}\n\n ControlPacket::Disconnect(_) => self.on_disconnect(client_id).await,\n\n _ => error!(\"Packet {} not supported\", &packet),\n","file_path":"src/broker/manager.rs","rank":46,"score":3.12068885036652},{"content":" ctrl_c_rx,\n\n // sessions: SessionService::default(),\n\n messaging: MessagingService::new(),\n\n identity_provider,\n\n }\n\n }\n\n\n\n pub async fn run(mut self) {\n\n loop {\n\n select! {\n\n _ = self.ctrl_c_rx.recv() => {\n\n trace!(\"Stopping manager\");\n\n break;\n\n }\n\n maybe_event = self.rx.recv() => {\n\n if let Some(event) = maybe_event {\n\n trace!(\"Got event {:?}\", &event);\n\n\n\n match event {\n\n ClientEvent::Connected(c, address, tx) => self.on_connect(tx, c, address).await,\n","file_path":"src/broker/manager.rs","rank":47,"score":3.094138629880727},{"content":"async fn write_pub_ack(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: PubAckPacket,\n\n) -> Result<(), Error> {\n\n write_packet_with_packet_id(buffer, PACKET_TYPE_PUB_ACK << 4, packet.packet_id).await?;\n\n Ok(())\n\n}\n\n\n\nasync fn write_pub_rec(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: PubRecPacket,\n\n) -> Result<(), Error> {\n\n write_packet_with_packet_id(buffer, PACKET_TYPE_PUB_REC << 4, packet.packet_id).await?;\n\n Ok(())\n\n}\n\n\n\nasync fn write_pub_rel(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: PubRelPacket,\n\n) -> Result<(), Error> {\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":48,"score":2.951658689931886},{"content":"use crate::mqtt::packets::{ClientId, ProtocolVersion};\n\n\n\nuse crate::mqtt::message::Message;\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct ConnectPacket {\n\n pub version: ProtocolVersion,\n\n pub client_id: ClientId,\n\n pub keep_alive_seconds: u16,\n\n pub clean_session: bool,\n\n\n\n pub will_message: Option<Message>,\n\n\n\n pub user_name: Option<String>,\n\n pub password: Option<String>,\n\n}\n\n\n\nimpl ConnectPacket {\n\n pub fn new(\n\n version: ProtocolVersion,\n","file_path":"src/mqtt/packets/connect.rs","rank":49,"score":2.7464681902971733},{"content":" }\n\n\n\n pub async fn finish_packet(&mut self) -> Result<(), Error> {\n\n self.tcp_stream.write_buf(&mut self.write_buffer).await?;\n\n // self.tcp_stream.flush().await?;\n\n Ok(())\n\n }\n\n\n\n async fn write_buffer_if_too_small(&mut self, size: usize) -> Result<(), Error> {\n\n if self.write_buffer.len() + size >= self.write_buffer.capacity() {\n\n self.tcp_stream.write_buf(&mut self.write_buffer).await?;\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl MqttBytesReadStream {\n\n pub fn new(buffer_size: usize, read_stream: OwnedReadHalf) -> Self {\n\n MqttBytesReadStream {\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":50,"score":2.631020846668261},{"content":" Ok(())\n\n }\n\n\n\n async fn write_buffer_if_too_small(&mut self, size: usize) -> Result<(), Error> {\n\n if self.write_buffer.len() + size >= self.write_buffer.capacity() {\n\n self.write_stream.write_buf(&mut self.write_buffer).await?;\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":51,"score":2.607993115325768},{"content":" packet: UnSubAckPacket,\n\n) -> Result<(), Error> {\n\n // fixed header\n\n write_packet_with_packet_id(buffer, PACKET_TYPE_UNSUB_ACK << 4, packet.packet_id).await?;\n\n\n\n Ok(())\n\n}\n\n\n\nasync fn write_ping_resp(buffer: &mut MqttBytesWriteStream) -> Result<(), Error> {\n\n // fixed header\n\n buffer.put_u8(PACKET_TYPE_PING_RESP << 4).await?;\n\n\n\n const REMAINING_LENGTH: u64 = 0;\n\n encode_remaining_length(REMAINING_LENGTH, buffer).await?;\n\n\n\n Ok(())\n\n}\n\n\n\nasync fn write_packet_with_packet_id(\n\n buffer: &mut MqttBytesWriteStream,\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":52,"score":2.6015619235411465},{"content":" }\n\n}\n\n\n\nimpl IdentityProvider for FileIdentityManager {\n\n fn authenticate(&self, username: &str, password: &str) -> Result<(), AuthenticationError> {\n\n // todo: encryption\n\n\n\n self.passwords_by_username\n\n .get(username)\n\n .ok_or(UserNotFound)?\n\n .eq(password)\n\n .then(|| ())\n\n .ok_or(InvalidPassword)\n\n }\n\n}\n","file_path":"src/broker/authentication.rs","rank":53,"score":2.5507320162134097},{"content":"async fn decode_pub_comp(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n _remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01110000).await?;\n\n Ok(ControlPacket::PubComp(PubCompPacket::new(packet_id)))\n\n}\n\n\n\nasync fn decode_subscribe(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n mut remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b10000010).await?;\n\n remaining_length -= 2;\n\n\n\n // payload\n\n\n\n if remaining_length == 0 {\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":54,"score":2.4506457437345954},{"content":" let mut first_byte = PACKET_TYPE_PUB_REL << 4;\n\n first_byte |= 0b10;\n\n write_packet_with_packet_id(buffer, first_byte, packet.packet_id).await?;\n\n Ok(())\n\n}\n\n\n\nasync fn write_pub_comp(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: PubCompPacket,\n\n) -> Result<(), Error> {\n\n write_packet_with_packet_id(buffer, PACKET_TYPE_PUB_COMP << 4, packet.packet_id).await?;\n\n Ok(())\n\n}\n\n\n\nasync fn write_sub_ack(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: SubAckPacket,\n\n) -> Result<(), Error> {\n\n // fixed header\n\n buffer.put_u8(PACKET_TYPE_SUB_ACK << 4).await?;\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":55,"score":2.4506457437345954},{"content":" pub fn new(config_filename: &str) -> Result<Self, ConfigError> {\n\n let mut config = Config::new();\n\n\n\n config.merge(File::with_name(config_filename).format(FileFormat::Toml))?;\n\n config.merge(Environment::with_prefix(\"ratelmq\").separator(\"__\"))?;\n\n\n\n config.try_into()\n\n }\n\n}\n\n\n\n// todo: tests for envs precedence\n","file_path":"src/settings/mod.rs","rank":56,"score":2.39310309527849},{"content":"}\n\n\n\nasync fn decode_pub_rec(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n _remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01010000).await?;\n\n Ok(ControlPacket::PubRec(PubRecPacket::new(packet_id)))\n\n}\n\n\n\nasync fn decode_pub_rel(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n _remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01100010).await?;\n\n Ok(ControlPacket::PubRel(PubRelPacket::new(packet_id)))\n\n}\n\n\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":57,"score":2.375481405853452},{"content":" first_byte: u8,\n\n packet_id: u16,\n\n) -> Result<(), Error> {\n\n // fixed header\n\n buffer.put_u8(first_byte).await?;\n\n\n\n const REMAINING_LENGTH: u64 = 2;\n\n encode_remaining_length(REMAINING_LENGTH, buffer).await?;\n\n\n\n // variable header\n\n buffer.put_u16(packet_id).await?;\n\n\n\n Ok(())\n\n}\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":58,"score":2.3687063971915863},{"content":"use crate::mqtt::subscription::Subscription;\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct SubscribePacket {\n\n pub packet_id: u16,\n\n\n\n pub subscriptions: Vec<Subscription>,\n\n}\n\n\n\nimpl SubscribePacket {\n\n pub fn new(packet_id: u16, subscriptions: Vec<Subscription>) -> Self {\n\n SubscribePacket {\n\n packet_id,\n\n subscriptions,\n\n }\n\n }\n\n}\n","file_path":"src/mqtt/packets/subscribe.rs","rank":59,"score":2.3354107111220164},{"content":" let mut remaining_length = size;\n\n\n\n while remaining_length > 0 {\n\n // todo: use clamp when stabilized\n\n let wait_for_bytes = {\n\n if remaining_length > self.read_buffer.capacity() {\n\n self.read_buffer.capacity()\n\n } else {\n\n remaining_length\n\n }\n\n };\n\n\n\n self.wait_for_data(wait_for_bytes).await?;\n\n bytes.put(self.read_buffer.split_to(wait_for_bytes));\n\n remaining_length -= wait_for_bytes;\n\n }\n\n\n\n Ok(bytes)\n\n }\n\n\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":60,"score":2.312756894608573},{"content":" async fn on_connection_lost(&mut self, client_id: ClientId) {\n\n info!(\"Client {:?} disconnected unexpectedly\", &client_id);\n\n self.messaging.connection_lost(&client_id);\n\n\n\n debug!(\n\n \"Active sessions count: {:?}\",\n\n self.messaging.session_count()\n\n );\n\n }\n\n\n\n async fn on_publish(\n\n &self,\n\n _sender: Sender<ServerEvent>,\n\n publish: PublishPacket,\n\n client_id: ClientId,\n\n ) {\n\n debug!(\n\n \"Client {:?} published message on topic {:?}\",\n\n &client_id, &publish.message.topic\n\n );\n","file_path":"src/broker/manager.rs","rank":61,"score":2.194794513331142},{"content":" ProtocolVersion::Mqtt3,\n\n client_id,\n\n keep_alive_seconds,\n\n clean_session,\n\n None,\n\n user_name,\n\n password,\n\n );\n\n\n\n Ok(ControlPacket::Connect(connect_packet))\n\n}\n\n\n\nasync fn decode_publish(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n mut remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n bitflags! {\n\n struct FixedHeaderFlags: u8 {\n\n const RETAIN = 0b00000001;\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":62,"score":2.110516289953459},{"content":" }\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl MqttBytesWriteStream {\n\n pub fn new(buffer_size: usize, write_stream: OwnedWriteHalf) -> Self {\n\n MqttBytesWriteStream {\n\n write_buffer: BytesMut::with_capacity(buffer_size),\n\n write_stream,\n\n }\n\n }\n\n\n\n pub async fn put_u8(&mut self, n: u8) -> Result<(), Error> {\n\n self.write_buffer_if_too_small(1).await?;\n\n\n\n self.write_buffer.put_u8(n);\n\n Ok(())\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":63,"score":2.110516289953459},{"content":"\n\n pub async fn put_bytes(&mut self, mut bytes: BytesMut) -> Result<(), Error> {\n\n let mut remaining_size = bytes.len();\n\n\n\n while remaining_size > 0 {\n\n let bytes_to_write = {\n\n if remaining_size > self.write_buffer.capacity() {\n\n self.write_buffer.capacity()\n\n } else {\n\n remaining_size\n\n }\n\n };\n\n self.write_buffer_if_too_small(bytes_to_write).await?;\n\n\n\n self.write_buffer.put(bytes.split_to(bytes_to_write));\n\n\n\n remaining_size -= bytes_to_write;\n\n }\n\n\n\n Ok(())\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":64,"score":2.091518250836893},{"content":" let bytes_to_write = {\n\n if remaining_size > self.write_buffer.capacity() {\n\n self.write_buffer.capacity()\n\n } else {\n\n remaining_size\n\n }\n\n };\n\n self.write_buffer_if_too_small(bytes_to_write).await?;\n\n\n\n self.write_buffer.put(bytes.split_to(bytes_to_write));\n\n\n\n remaining_size -= bytes_to_write;\n\n }\n\n\n\n Ok(())\n\n }\n\n\n\n pub async fn finish_packet(&mut self) -> Result<(), Error> {\n\n self.write_stream.write_buf(&mut self.write_buffer).await?;\n\n // self.tcp_stream.flush().await?;\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":65,"score":2.0728591861853936},{"content":"\n\n pub fn unsubscribe(&mut self, client_id: &ClientId, topics: &Vec<String>) {\n\n self.subscriptions.unsubscribe(client_id, topics);\n\n }\n\n\n\n pub async fn publish(&self, message: &Message, publish: &PublishPacket) {\n\n if let Some(client_ids) = self.subscriptions.subscribed_clients(&message.topic) {\n\n for c in &client_ids {\n\n match self.sessions.get(c) {\n\n Some(session) => {\n\n let event = ServerEvent::ControlPacket(Publish(publish.clone()));\n\n session.sender().send(event).await.unwrap();\n\n }\n\n None => {\n\n warn!(\n\n \"Tried to send message, but session for client {:?} not found\",\n\n c\n\n );\n\n }\n\n }\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/broker/messaging/messaging_service.rs","rank":66,"score":2.0466638067941787},{"content":"use crate::mqtt::packets::suback::SubAckReturnCode::Failure;\n\n\n\n#[derive(Debug, PartialEq, Clone)]\n\npub enum SubAckReturnCode {\n\n SuccessQoS0 = 0x00,\n\n SuccessQoS1 = 0x01,\n\n SuccessQoS2 = 0x02,\n\n Failure = 0x80,\n\n}\n\n\n\nimpl Default for SubAckReturnCode {\n\n fn default() -> Self {\n\n Failure\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Clone, Default)]\n\npub struct SubAckPacket {\n\n pub packet_id: u16,\n\n\n","file_path":"src/mqtt/packets/suback.rs","rank":67,"score":1.985365342663851},{"content":" const REMAINING_LENGTH: u64 = 2;\n\n encode_remaining_length(REMAINING_LENGTH, buffer).await?;\n\n\n\n // variable header\n\n buffer.put_u8(packet.session_present as u8).await?;\n\n buffer.put_u8(packet.return_code.clone() as u8).await?;\n\n\n\n Ok(())\n\n}\n\n\n\nasync fn write_publish(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: PublishPacket,\n\n) -> Result<(), Error> {\n\n bitflags! {\n\n struct FixedHeaderFlags: u8 {\n\n const RETAIN = 0b00000001;\n\n const QOS_1 = 0b00000010;\n\n const QOS_2 = 0b00000100;\n\n const DUP = 0b00001000;\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":68,"score":1.9510197405011103},{"content":"}\n\n\n\nimpl MqttBytesStream {\n\n pub fn new(\n\n read_buffer_size: usize,\n\n write_buffer_size: usize,\n\n tcp_stream: TcpStream,\n\n ) -> MqttBytesStream {\n\n MqttBytesStream {\n\n read_buffer: BytesMut::with_capacity(read_buffer_size),\n\n write_buffer: BytesMut::with_capacity(write_buffer_size),\n\n tcp_stream,\n\n }\n\n }\n\n}\n\n\n\nimpl MqttBytesStream {\n\n pub async fn get_u8(&mut self) -> Result<u8, Error> {\n\n self.wait_for_data(1).await?;\n\n\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":69,"score":1.934773599186426},{"content":"\n\nimpl FileIdentityManager {\n\n pub fn new(filename: &str) -> Result<FileIdentityManager, FileIdentityManagerError> {\n\n let credentials = std::fs::read_to_string(filename)?;\n\n\n\n let mut passwords_by_username = HashMap::with_capacity(credentials.lines().count());\n\n\n\n for line in credentials.lines() {\n\n let credential = line.split_once(':').ok_or(InvalidEntry)?;\n\n let username = credential.0;\n\n let password = credential.1;\n\n\n\n passwords_by_username.insert(username.to_owned(), password.to_owned());\n\n }\n\n\n\n let manager = FileIdentityManager {\n\n passwords_by_username,\n\n };\n\n\n\n Ok(manager)\n","file_path":"src/broker/authentication.rs","rank":70,"score":1.903079709824774},{"content":" remaining_length\n\n }\n\n };\n\n\n\n self.wait_for_data(wait_for_bytes).await?;\n\n bytes.put(self.read_buffer.split_to(wait_for_bytes));\n\n remaining_length -= wait_for_bytes;\n\n }\n\n\n\n Ok(bytes)\n\n }\n\n\n\n async fn wait_for_data(&mut self, bytes: usize) -> Result<(), Error> {\n\n while self.read_buffer.len() < bytes {\n\n let read_bytes_num = self.tcp_stream.read_buf(&mut self.read_buffer).await?;\n\n\n\n // todo: Handle better?\n\n let connection_closed = read_bytes_num == 0; // end of file\n\n if connection_closed {\n\n let clean_shutdown = self.read_buffer.is_empty();\n","file_path":"src/mqtt/transport/mqtt_bytes_stream.rs","rank":71,"score":1.903079709824774},{"content":" PACKET_TYPE_SUBSCRIBE => {\n\n decode_subscribe(mqtt_stream, first_byte, remaining_length).await?\n\n }\n\n PACKET_TYPE_UNSUBSCRIBE => {\n\n decode_unsubscribe(mqtt_stream, first_byte, remaining_length).await?\n\n }\n\n PACKET_TYPE_PING_REQ => ControlPacket::PingReq,\n\n PACKET_TYPE_DISCONNECT => ControlPacket::Disconnect(DisconnectPacket::default()),\n\n _ => unimplemented!(),\n\n };\n\n\n\n Ok(packet)\n\n}\n\n\n\nasync fn decode_connect(\n\n buffer: &mut MqttBytesReadStream,\n\n _first_byte: u8,\n\n _remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n bitflags! {\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":72,"score":1.828209118312012},{"content":" }\n\n\n\n let mut topics = Vec::new();\n\n while remaining_length > 0 {\n\n let topic = buffer.get_string().await?;\n\n\n\n remaining_length -= topic.len() as u64 + 2u64/* 2 topic length */;\n\n\n\n topics.push(topic);\n\n }\n\n\n\n let packet = UnsubscribePacket::new(packet_id, topics);\n\n Ok(ControlPacket::Unsubscribe(packet))\n\n}\n\n\n\nasync fn decode_packet_with_packet_id(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n expected_first_byte: u8,\n\n) -> Result<u16, Error> {\n\n validate_first_byte(first_byte, expected_first_byte)?;\n\n\n\n let packet_id = buffer.get_u16().await?;\n\n Ok(packet_id)\n\n}\n\n\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":73,"score":1.719943995305314},{"content":" remaining_length -= 2;\n\n Some(buffer.get_u16().await?)\n\n } else {\n\n None\n\n };\n\n\n\n // payload\n\n let body = buffer.get_bytes(remaining_length as usize).await?;\n\n\n\n let packet = PublishPacket::new(topic, body, qos, retain, packet_id, dup);\n\n Ok(ControlPacket::Publish(packet))\n\n}\n\n\n\nasync fn decode_pub_ack(\n\n buffer: &mut MqttBytesReadStream,\n\n first_byte: u8,\n\n _remaining_length: u64,\n\n) -> Result<ControlPacket, Error> {\n\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01000000).await?;\n\n Ok(ControlPacket::PubAck(PubAckPacket::new(packet_id)))\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":75,"score":1.694852040182326},{"content":" }\n\n\n\n buffer.put_u8(encoded_byte).await?;\n\n\n\n if remaining_length == 0 {\n\n break;\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n\npub async fn write_packet(\n\n mqtt_stream: &mut MqttBytesWriteStream,\n\n packet: ControlPacket,\n\n) -> Result<(), Error> {\n\n match packet {\n\n ControlPacket::ConnAck(conn_ack) => write_conn_ack(mqtt_stream, conn_ack).await?,\n\n ControlPacket::Publish(publish) => write_publish(mqtt_stream, publish).await?,\n\n ControlPacket::PubAck(pub_ack) => write_pub_ack(mqtt_stream, pub_ack).await?,\n\n ControlPacket::PubRec(pub_rec) => write_pub_rec(mqtt_stream, pub_rec).await?,\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":76,"score":1.6237847259263658},{"content":" ControlPacket::PubRel(pub_rel) => write_pub_rel(mqtt_stream, pub_rel).await?,\n\n ControlPacket::PubComp(pub_comp) => write_pub_comp(mqtt_stream, pub_comp).await?,\n\n ControlPacket::SubAck(sub_ack) => write_sub_ack(mqtt_stream, sub_ack).await?,\n\n ControlPacket::UnsubAck(unsub_ack) => write_unsub_ack(mqtt_stream, unsub_ack).await?,\n\n ControlPacket::PingResp => write_ping_resp(mqtt_stream).await?,\n\n _ => unimplemented!(),\n\n };\n\n\n\n mqtt_stream.finish_packet().await?;\n\n\n\n Ok(())\n\n}\n\n\n\nasync fn write_conn_ack(\n\n buffer: &mut MqttBytesWriteStream,\n\n packet: ConnAckPacket,\n\n) -> Result<(), Error> {\n\n // fixed header\n\n buffer.put_u8(PACKET_TYPE_CONN_ACK << 4).await?;\n\n\n","file_path":"src/mqtt/transport/packet_encoder.rs","rank":77,"score":1.4334480728616255},{"content":" if continuation_bit == 0 {\n\n break;\n\n }\n\n }\n\n\n\n Ok(remaining_length)\n\n}\n\n\n\npub async fn read_packet(mqtt_stream: &mut MqttBytesReadStream) -> Result<ControlPacket, Error> {\n\n let first_byte = mqtt_stream.get_u8().await?;\n\n let packet_type = first_byte >> 4;\n\n let remaining_length = decode_remaining_length(mqtt_stream).await?;\n\n\n\n let packet = match packet_type {\n\n PACKET_TYPE_CONNECT => decode_connect(mqtt_stream, first_byte, remaining_length).await?,\n\n PACKET_TYPE_PUBLISH => decode_publish(mqtt_stream, first_byte, remaining_length).await?,\n\n PACKET_TYPE_PUB_ACK => decode_pub_ack(mqtt_stream, first_byte, remaining_length).await?,\n\n PACKET_TYPE_PUB_REC => decode_pub_rec(mqtt_stream, first_byte, remaining_length).await?,\n\n PACKET_TYPE_PUB_REL => decode_pub_rel(mqtt_stream, first_byte, remaining_length).await?,\n\n PACKET_TYPE_PUB_COMP => decode_pub_comp(mqtt_stream, first_byte, remaining_length).await?,\n","file_path":"src/mqtt/transport/packet_decoder.rs","rank":78,"score":1.2419041175934593},{"content":"# RatelMQ\n\n\n\n\n\n\n\n\n\n\n\n**RatelMQ is an efficient, reliable & scalable MQTT broker.**\n\n\n\n---\n\n\n\n## Installation\n\n\n\n### Docker image\n\n\n\nRatelMQ images are available on [Docker Hub](https://hub.docker.com/r/ratelmq/ratelmq).\n\n\n\nStart container: `docker run --name ratelmq -p 1883:1883 ratelmq/ratelmq:main`\n\n\n\n### Precompiled binaries\n\n\n\nTBD\n\n\n\n### Building from sources\n\n\n\nTBD\n\n\n\n## Configuration\n\n\n\nThe main configuration file is located in the `/etc/ratelmq/ratelmq.conf`.\n\nRatelMQ supports configuration via a [TOML](https://github.com/toml-lang/toml) file and environment variables.\n\n\n\nEnvironment variables take precedence and overwrites those from the configuration file.\n\nWhen using environment variables:\n\n\n\n* add `RATELMQ_` prefix\n\n* separate nested items with `__`, e.g. `RATELMQ_MQTT__SOMETHING`\n\n\n\nFor the default values with description please see [config/ratelmq.toml](config/ratelmq.toml).\n\n\n\n## Changelog\n\n\n\nSee [CHANGELOG.md](CHANGELOG.md) for details.\n\n\n\n## Roadmap\n\n\n\nSee [ROADMAP.md](ROADMAP.md) for details.\n\n\n\n## Versioning\n\n\n\nTBD\n\n\n\n## Resources\n\n\n\n* MQTT 3.1.1 spec: <https://docs.oasis-open.org/mqtt/mqtt/v3.1.1/os/mqtt-v3.1.1-os.html>\n\n\n\n## Contributing\n\n\n\nTBD\n\n\n\n## License\n\n\n\nThe project is licensed under the Apache License 2.0, see [LICENSE](LICENSE).\n","file_path":"README.md","rank":79,"score":1.0453054396394528}],"string":"[\n {\n \"content\": \"#[derive(Debug)]\\n\\npub struct BuildInfo {\\n\\n pub version: &'static str,\\n\\n pub commit_hash: &'static str,\\n\\n}\\n\\n\\n\\npub const BUILD_INFO: BuildInfo = BuildInfo {\\n\\n version: env!(\\\"CARGO_PKG_VERSION\\\"),\\n\\n commit_hash: env!(\\\"BUILD_GIT_HASH\\\"),\\n\\n};\\n\",\n \"file_path\": \"src/config/build_info.rs\",\n \"rank\": 0,\n \"score\": 29942.31485936127\n },\n {\n \"content\": \"fn validate_first_byte(actual: u8, expected: u8) -> Result<(), Error> {\\n\\n if actual == expected {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(tokio::io::Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n \\\"Malformed fixed header\\\",\\n\\n ))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 1,\n \"score\": 28100.719076282097\n },\n {\n \"content\": \"use std::net::SocketAddr;\\n\\n\\n\\nuse log::{debug, error, info, trace};\\n\\nuse tokio::select;\\n\\nuse tokio::sync::mpsc::{Receiver, Sender};\\n\\nuse tokio::sync::{broadcast, mpsc};\\n\\n\\n\\nuse crate::broker::authentication::{FileIdentityManager, IdentityProvider};\\n\\nuse crate::broker::messaging::MessagingService;\\n\\nuse crate::broker::session::Session;\\n\\nuse crate::mqtt::events::{ClientEvent, ServerEvent};\\n\\nuse crate::mqtt::packets::connack::ConnAckReturnCode;\\n\\nuse crate::mqtt::packets::suback::SubAckPacket;\\n\\nuse crate::mqtt::packets::subscribe::SubscribePacket;\\n\\nuse crate::mqtt::packets::unsuback::UnSubAckPacket;\\n\\nuse crate::mqtt::packets::unsubscribe::UnsubscribePacket;\\n\\nuse crate::mqtt::packets::ControlPacket::{ConnAck, PingResp, SubAck, UnsubAck};\\n\\nuse crate::mqtt::packets::*;\\n\\nuse crate::settings::Settings;\\n\\n\\n\",\n \"file_path\": \"src/broker/manager.rs\",\n \"rank\": 3,\n \"score\": 8.31002326166239\n },\n {\n \"content\": \"use crate::broker::authentication::FileIdentityManager;\\n\\nuse crate::broker::manager::Manager;\\n\\nuse crate::config::build_info::BUILD_INFO;\\n\\nuse crate::mqtt::listener::MqttListener;\\n\\nuse crate::settings::Settings;\\n\\nuse futures::future::join_all;\\n\\nuse log::{debug, info};\\n\\nuse tokio::signal;\\n\\nuse tokio::sync::broadcast;\\n\\nuse tokio::sync::mpsc;\\n\\n\\n\\npub async fn run(config_filename: &str) {\\n\\n info!(\\n\\n \\\"Initializing RatelMQ v{} ({})...\\\",\\n\\n BUILD_INFO.version,\\n\\n &BUILD_INFO.commit_hash[..10]\\n\\n );\\n\\n\\n\\n debug!(\\\"Using configuration file {}\\\", config_filename);\\n\\n let settings = Settings::new(config_filename).unwrap();\\n\",\n \"file_path\": \"src/application.rs\",\n \"rank\": 4,\n \"score\": 8.05011268131039\n },\n {\n \"content\": \"use bytes::{Buf, BufMut, BytesMut};\\n\\nuse log::trace;\\n\\nuse tokio::io::{AsyncReadExt, AsyncWriteExt, Error, ErrorKind};\\n\\nuse tokio::net::tcp::{OwnedReadHalf, OwnedWriteHalf};\\n\\nuse tokio::net::TcpStream;\\n\\n\\n\\npub struct MqttBytesStream {\\n\\n read_buffer: BytesMut,\\n\\n write_buffer: BytesMut,\\n\\n tcp_stream: TcpStream,\\n\\n}\\n\\n\\n\\npub struct MqttBytesWriteStream {\\n\\n write_buffer: BytesMut,\\n\\n write_stream: OwnedWriteHalf,\\n\\n}\\n\\n\\n\\npub struct MqttBytesReadStream {\\n\\n read_buffer: BytesMut,\\n\\n read_stream: OwnedReadHalf,\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 5,\n \"score\": 7.640292745878708\n },\n {\n \"content\": \"// pub use self::build_info::*;\\n\\npub mod build_info;\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 6,\n \"score\": 7.466998155383734\n },\n {\n \"content\": \"use crate::broker::authentication::AuthenticationError::InvalidPassword;\\n\\nuse crate::broker::authentication::FileIdentityManagerError::InvalidEntry;\\n\\nuse std::collections::HashMap;\\n\\nuse std::io::Error;\\n\\nuse AuthenticationError::UserNotFound;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum AuthenticationError {\\n\\n // UserNotFound(UserNotFound),\\n\\n // InvalidPassword(InvalidPassword),\\n\\n UserNotFound,\\n\\n InvalidPassword,\\n\\n}\\n\\n\\n\\n// #[derive(Debug, Clone)]\\n\\n// pub struct UserNotFound {\\n\\n// // pub username: &'static str,\\n\\n// }\\n\\n//\\n\\n// #[derive(Debug, Clone)]\\n\\n// pub struct InvalidPassword;\\n\\n\\n\",\n \"file_path\": \"src/broker/authentication.rs\",\n \"rank\": 7,\n \"score\": 7.305210950702282\n },\n {\n \"content\": \"use clap::{App, Arg};\\n\\nuse dotenv::dotenv;\\n\\n\\n\\nuse ratelmq::config::build_info::BUILD_INFO;\\n\\n\\n\\n#[tokio::main]\\n\\nasync fn main() {\\n\\n dotenv().ok();\\n\\n env_logger::init();\\n\\n\\n\\n let version = format!(\\\"v{}({})\\\", BUILD_INFO.version, &BUILD_INFO.commit_hash[..10]);\\n\\n\\n\\n let argument_name_config = \\\"config\\\";\\n\\n\\n\\n let arguments = App::new(\\\"RatelMQ\\\")\\n\\n .version(version.as_str())\\n\\n .about(\\\"Efficient, reliable & scalable MQTT broker.\\\")\\n\\n .arg(\\n\\n Arg::new(argument_name_config)\\n\\n .short('c')\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 9,\n \"score\": 7.026954965850307\n },\n {\n \"content\": \"use async_trait::async_trait;\\n\\nuse tokio::io::Error;\\n\\n\\n\\nuse crate::mqtt::transport::packet_decoder::PacketDecoder;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct DisconnectPacket {}\\n\\n\\n\\n#[async_trait]\\n\\nimpl PacketDecoder for DisconnectPacket {\\n\\n fn parse_fixed_header_flags(&mut self, _: u8) -> Result<(), Error> {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/packets/disconnect.rs\",\n \"rank\": 10,\n \"score\": 6.563184976559407\n },\n {\n \"content\": \" Ok(self.read_buffer.get_u8())\\n\\n }\\n\\n\\n\\n pub async fn get_u16(&mut self) -> Result<u16, Error> {\\n\\n self.wait_for_data(2).await?;\\n\\n\\n\\n Ok(self.read_buffer.get_u16())\\n\\n }\\n\\n\\n\\n pub async fn get_string(&mut self) -> Result<String, Error> {\\n\\n trace!(\\\"Parsing string size\\\");\\n\\n let string_size = self.get_u16().await? as usize;\\n\\n trace!(\\\"String size: {} ({:#04x})\\\", string_size, string_size);\\n\\n trace!(\\\"Parsing string buf\\\");\\n\\n let str_buf = self.get_bytes(string_size).await?;\\n\\n\\n\\n let str = std::str::from_utf8(str_buf.as_ref()).map_err(|e| {\\n\\n Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n format!(\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 11,\n \"score\": 6.456973949542382\n },\n {\n \"content\": \" trace!(\\\"String size: {} ({:#04x})\\\", string_size, string_size);\\n\\n trace!(\\\"Parsing string buf\\\");\\n\\n let str_buf = self.get_bytes(string_size).await?;\\n\\n\\n\\n let str = std::str::from_utf8(str_buf.as_ref()).map_err(|e| {\\n\\n Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n format!(\\n\\n \\\"Invalid UTF8 String: error at position {}\\\",\\n\\n e.valid_up_to() + 1\\n\\n ),\\n\\n )\\n\\n })?;\\n\\n\\n\\n Ok(String::from(str))\\n\\n }\\n\\n\\n\\n pub async fn get_bytes(&mut self, size: usize) -> Result<BytesMut, Error> {\\n\\n let mut bytes = BytesMut::with_capacity(size);\\n\\n\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 12,\n \"score\": 6.318806721891911\n },\n {\n \"content\": \"use crate::mqtt::packets::puback::PubAckPacket;\\n\\nuse crate::mqtt::packets::pubcomp::PubCompPacket;\\n\\nuse crate::mqtt::packets::pubrec::PubRecPacket;\\n\\nuse crate::mqtt::packets::pubrel::PubRelPacket;\\n\\nuse crate::mqtt::packets::subscribe::SubscribePacket;\\n\\nuse crate::mqtt::packets::unsubscribe::UnsubscribePacket;\\n\\nuse crate::mqtt::packets::{\\n\\n ConnectPacket, ControlPacket, DisconnectPacket, ProtocolVersion, PublishPacket, QoS,\\n\\n};\\n\\nuse crate::mqtt::packets::{\\n\\n PACKET_TYPE_CONNECT, PACKET_TYPE_DISCONNECT, PACKET_TYPE_PING_REQ, PACKET_TYPE_PUBLISH,\\n\\n PACKET_TYPE_PUB_ACK, PACKET_TYPE_PUB_COMP, PACKET_TYPE_PUB_REC, PACKET_TYPE_PUB_REL,\\n\\n PACKET_TYPE_SUBSCRIBE, PACKET_TYPE_UNSUBSCRIBE,\\n\\n};\\n\\nuse crate::mqtt::subscription::Subscription;\\n\\nuse crate::mqtt::transport::mqtt_bytes_stream::MqttBytesReadStream;\\n\\nuse async_trait::async_trait;\\n\\nuse bitflags::bitflags;\\n\\nuse tokio::io::{Error, ErrorKind};\\n\\n\\n\\n#[async_trait]\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 14,\n \"score\": 5.881202332791689\n },\n {\n \"content\": \"use log::warn;\\n\\n\\n\\nuse crate::broker::messaging::subscriptions_repository::SubscriptionsRepository;\\n\\nuse crate::broker::session::session_repository::SessionRepository;\\n\\nuse crate::broker::session::{InMemorySessionRepository, Session};\\n\\nuse crate::mqtt::events::ServerEvent;\\n\\nuse crate::mqtt::message::Message;\\n\\nuse crate::mqtt::packets::suback::SubAckReturnCode;\\n\\nuse crate::mqtt::packets::ControlPacket::Publish;\\n\\nuse crate::mqtt::packets::{ClientId, PublishPacket};\\n\\nuse crate::mqtt::subscription::Subscription;\\n\\n\\n\\npub struct MessagingService {\\n\\n sessions: InMemorySessionRepository,\\n\\n subscriptions: SubscriptionsRepository,\\n\\n}\\n\\n\\n\\nimpl MessagingService {\\n\\n pub fn new() -> Self {\\n\\n MessagingService {\\n\",\n \"file_path\": \"src/broker/messaging/messaging_service.rs\",\n \"rank\": 15,\n \"score\": 5.750015083155831\n },\n {\n \"content\": \" read_buffer: BytesMut::with_capacity(buffer_size),\\n\\n read_stream,\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn get_u8(&mut self) -> Result<u8, Error> {\\n\\n self.wait_for_data(1).await?;\\n\\n\\n\\n Ok(self.read_buffer.get_u8())\\n\\n }\\n\\n\\n\\n pub async fn get_u16(&mut self) -> Result<u16, Error> {\\n\\n self.wait_for_data(2).await?;\\n\\n\\n\\n Ok(self.read_buffer.get_u16())\\n\\n }\\n\\n\\n\\n pub async fn get_string(&mut self) -> Result<String, Error> {\\n\\n trace!(\\\"Parsing string size\\\");\\n\\n let string_size = self.get_u16().await? as usize;\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 16,\n \"score\": 5.190599357919163\n },\n {\n \"content\": \" \\\"Invalid UTF8 String: error at position {}\\\",\\n\\n e.valid_up_to() + 1\\n\\n ),\\n\\n )\\n\\n })?;\\n\\n\\n\\n Ok(String::from(str))\\n\\n }\\n\\n\\n\\n pub async fn get_bytes(&mut self, size: usize) -> Result<BytesMut, Error> {\\n\\n let mut bytes = BytesMut::with_capacity(size);\\n\\n\\n\\n let mut remaining_length = size;\\n\\n\\n\\n while remaining_length > 0 {\\n\\n // todo: use clamp when stabilized\\n\\n let wait_for_bytes = {\\n\\n if remaining_length > self.read_buffer.capacity() {\\n\\n self.read_buffer.capacity()\\n\\n } else {\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 17,\n \"score\": 5.133721816412278\n },\n {\n \"content\": \"use async_trait::async_trait;\\n\\nuse bitflags::bitflags;\\n\\nuse tokio::io::Error;\\n\\n\\n\\nuse crate::mqtt::packets::puback::PubAckPacket;\\n\\nuse crate::mqtt::packets::pubcomp::PubCompPacket;\\n\\nuse crate::mqtt::packets::pubrec::PubRecPacket;\\n\\nuse crate::mqtt::packets::pubrel::PubRelPacket;\\n\\nuse crate::mqtt::packets::suback::SubAckPacket;\\n\\nuse crate::mqtt::packets::unsuback::UnSubAckPacket;\\n\\nuse crate::mqtt::packets::{\\n\\n ConnAckPacket, ControlPacket, PublishPacket, QoS, PACKET_TYPE_CONN_ACK, PACKET_TYPE_PING_RESP,\\n\\n PACKET_TYPE_PUBLISH, PACKET_TYPE_PUB_ACK, PACKET_TYPE_PUB_COMP, PACKET_TYPE_PUB_REC,\\n\\n PACKET_TYPE_PUB_REL, PACKET_TYPE_SUB_ACK, PACKET_TYPE_UNSUB_ACK,\\n\\n};\\n\\nuse crate::mqtt::transport::mqtt_bytes_stream::{MqttBytesStream, MqttBytesWriteStream};\\n\\n\\n\\n#[async_trait]\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 18,\n \"score\": 5.129927965350056\n },\n {\n \"content\": \"use config::{Config, ConfigError, Environment, File, FileFormat};\\n\\nuse serde::Deserialize;\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\npub struct MqttSettings {\\n\\n pub listeners_tcp: Vec<String>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\npub struct AuthenticationSettings {\\n\\n pub password_file: String,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\npub struct Settings {\\n\\n pub mqtt: MqttSettings,\\n\\n pub authentication: AuthenticationSettings,\\n\\n}\\n\\n\\n\\nimpl Settings {\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 19,\n \"score\": 5.078869965692634\n },\n {\n \"content\": \"pub use crate::mqtt::packets::connack::ConnAckPacket;\\n\\npub use crate::mqtt::packets::connect::ConnectPacket;\\n\\npub use crate::mqtt::packets::disconnect::DisconnectPacket;\\n\\nuse crate::mqtt::packets::puback::PubAckPacket;\\n\\nuse crate::mqtt::packets::pubcomp::PubCompPacket;\\n\\npub use crate::mqtt::packets::publish::PublishPacket;\\n\\nuse crate::mqtt::packets::pubrec::PubRecPacket;\\n\\nuse crate::mqtt::packets::pubrel::PubRelPacket;\\n\\nuse crate::mqtt::packets::suback::SubAckPacket;\\n\\nuse crate::mqtt::packets::subscribe::SubscribePacket;\\n\\nuse crate::mqtt::packets::unsuback::UnSubAckPacket;\\n\\nuse crate::mqtt::packets::unsubscribe::UnsubscribePacket;\\n\\nuse crate::mqtt::packets::ControlPacket::{\\n\\n ConnAck, Connect, Disconnect, PingReq, PingResp, PubAck, PubComp, PubRec, PubRel, Publish,\\n\\n SubAck, Subscribe, UnsubAck, Unsubscribe,\\n\\n};\\n\\nuse crate::mqtt::packets::ProtocolVersion::Mqtt3;\\n\\nuse crate::mqtt::packets::QoS::{AtLeastOnce, AtMostOnce, ExactlyOnce};\\n\\nuse std::fmt;\\n\\nuse std::fmt::{Display, Formatter};\\n\",\n \"file_path\": \"src/mqtt/packets/mod.rs\",\n \"rank\": 21,\n \"score\": 4.104120113332452\n },\n {\n \"content\": \"use crate::broker::session::Session;\\n\\nuse crate::mqtt::packets::ClientId;\\n\\nuse std::collections::HashMap;\\n\\n\\n\",\n \"file_path\": \"src/broker/session/session_repository.rs\",\n \"rank\": 22,\n \"score\": 4.0604927596834575\n },\n {\n \"content\": \"use bytes::BytesMut;\\n\\nuse tokio::io::AsyncReadExt;\\n\\nuse tokio::net::{TcpListener, TcpStream};\\n\\n\\n\\nuse ratelmq::mqtt::packets::puback::PubAckPacket;\\n\\nuse ratelmq::mqtt::packets::pubcomp::PubCompPacket;\\n\\nuse ratelmq::mqtt::packets::pubrec::PubRecPacket;\\n\\nuse ratelmq::mqtt::packets::pubrel::PubRelPacket;\\n\\nuse ratelmq::mqtt::packets::suback::{SubAckPacket, SubAckReturnCode};\\n\\nuse ratelmq::mqtt::packets::unsuback::UnSubAckPacket;\\n\\nuse ratelmq::mqtt::packets::{ConnAckPacket, ControlPacket, PublishPacket, QoS};\\n\\nuse ratelmq::mqtt::transport::mqtt_bytes_stream::MqttBytesWriteStream;\\n\\nuse ratelmq::mqtt::transport::packet_encoder;\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn it_write_conn_ack() {\\n\\n let conn_ack = ConnAckPacket::default();\\n\\n\\n\\n let data = write_packet(ControlPacket::ConnAck(conn_ack)).await;\\n\\n assert_bytes(data, vec![0x20, 0x02, 0x00, 0x00])\\n\",\n \"file_path\": \"tests/write_packets.rs\",\n \"rank\": 24,\n \"score\": 3.9358113007900766\n },\n {\n \"content\": \"mod session_entity;\\n\\npub(crate) mod session_repository;\\n\\nmod session_service;\\n\\n\\n\\npub use self::session_entity::Session;\\n\\npub use self::session_repository::InMemorySessionRepository;\\n\\npub use self::session_repository::SessionRepository;\\n\\npub use self::session_service::SessionService;\\n\",\n \"file_path\": \"src/broker/session/mod.rs\",\n \"rank\": 25,\n \"score\": 3.913635549514639\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::fs::remove_dir;\\n\\n\\n\\nuse crate::mqtt::packets::suback::SubAckReturnCode;\\n\\nuse crate::mqtt::packets::ClientId;\\n\\nuse crate::mqtt::subscription::Subscription;\\n\\n\\n\\npub struct SubscriptionsRepository {\\n\\n root: SubscriptionNode,\\n\\n}\\n\\n\\n\\nimpl SubscriptionsRepository {\\n\\n pub fn new() -> SubscriptionsRepository {\\n\\n SubscriptionsRepository {\\n\\n root: SubscriptionNode::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn subscribe(\\n\\n &mut self,\\n\",\n \"file_path\": \"src/broker/messaging/subscriptions_repository.rs\",\n \"rank\": 26,\n \"score\": 3.855287358356077\n },\n {\n \"content\": \" return if clean_shutdown {\\n\\n Err(tokio::io::Error::new(\\n\\n ErrorKind::ConnectionReset,\\n\\n \\\"connection reset by peer\\\",\\n\\n ))\\n\\n } else {\\n\\n // closed while sending\\n\\n Err(tokio::io::Error::new(\\n\\n ErrorKind::ConnectionReset,\\n\\n \\\"connection interrupted, reset by peer\\\",\\n\\n ))\\n\\n };\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MqttBytesStream {\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 27,\n \"score\": 3.829622344600214\n },\n {\n \"content\": \" listeners.push(tokio::spawn(listener.start_accepting()));\\n\\n }\\n\\n\\n\\n info!(\\\"Initialized RatelMQ\\\");\\n\\n\\n\\n signal::ctrl_c().await.unwrap();\\n\\n\\n\\n info!(\\\"Stopping RatelMQ\\\");\\n\\n ctrl_c_tx.send(()).unwrap();\\n\\n\\n\\n join_all(listeners).await;\\n\\n\\n\\n manager_future.await.unwrap();\\n\\n\\n\\n info!(\\\"RatelMQ stopped\\\");\\n\\n}\\n\",\n \"file_path\": \"src/application.rs\",\n \"rank\": 28,\n \"score\": 3.8013587968646\n },\n {\n \"content\": \" };\\n\\n }\\n\\n\\n\\n async fn on_connect(\\n\\n &mut self,\\n\\n sender: Sender<ServerEvent>,\\n\\n packet: ConnectPacket,\\n\\n address: SocketAddr,\\n\\n ) {\\n\\n debug!(\\\"New client {:?} connected\\\", &packet.client_id);\\n\\n\\n\\n if let Some(user_name) = packet.user_name {\\n\\n let password = packet.password.unwrap();\\n\\n if let Err(e) = self.identity_provider.authenticate(&user_name, &password) {\\n\\n info!(\\\"Client {} authentication error: {:?}\\\", &user_name, &e);\\n\\n\\n\\n let conn_ack = ConnAckPacket::new(false, ConnAckReturnCode::NotAuthorized);\\n\\n sender\\n\\n .send(ServerEvent::ControlPacket(ControlPacket::ConnAck(conn_ack)))\\n\\n .await\\n\",\n \"file_path\": \"src/broker/manager.rs\",\n \"rank\": 29,\n \"score\": 3.6771623722735436\n },\n {\n \"content\": \"use crate::mqtt::events::ServerEvent;\\n\\nuse crate::mqtt::packets::ClientId;\\n\\nuse std::net::IpAddr;\\n\\nuse tokio::sync::mpsc::Sender;\\n\\n\\n\\npub struct Session {\\n\\n client_id: ClientId,\\n\\n ip: IpAddr,\\n\\n persistent: bool,\\n\\n sender: Sender<ServerEvent>,\\n\\n}\\n\\n\\n\\nimpl Session {\\n\\n pub fn new(\\n\\n client_id: ClientId,\\n\\n ip: IpAddr,\\n\\n persistent: bool,\\n\\n sender: Sender<ServerEvent>,\\n\\n ) -> Self {\\n\\n Session {\\n\",\n \"file_path\": \"src/broker/session/session_entity.rs\",\n \"rank\": 30,\n \"score\": 3.6031310694014254\n },\n {\n \"content\": \" async fn wait_for_data(&mut self, bytes: usize) -> Result<(), Error> {\\n\\n while self.read_buffer.len() < bytes {\\n\\n let read_bytes_num = self.read_stream.read_buf(&mut self.read_buffer).await?;\\n\\n\\n\\n // todo: Handle better?\\n\\n let connection_closed = read_bytes_num == 0; // end of file\\n\\n if connection_closed {\\n\\n let clean_shutdown = self.read_buffer.is_empty();\\n\\n return if clean_shutdown {\\n\\n Err(tokio::io::Error::new(\\n\\n ErrorKind::ConnectionReset,\\n\\n \\\"connection reset by peer\\\",\\n\\n ))\\n\\n } else {\\n\\n // closed while sending\\n\\n Err(tokio::io::Error::new(\\n\\n ErrorKind::ConnectionReset,\\n\\n \\\"connection interrupted, reset by peer\\\",\\n\\n ))\\n\\n };\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 31,\n \"score\": 3.572207518283132\n },\n {\n \"content\": \"use std::process::Command;\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 32,\n \"score\": 3.5537417262102156\n },\n {\n \"content\": \"use tokio::io::AsyncWriteExt;\\n\\nuse tokio::net::{TcpListener, TcpStream};\\n\\n\\n\\nuse ratelmq::mqtt::packets::{ControlPacket, ProtocolVersion, QoS};\\n\\nuse ratelmq::mqtt::subscription::Subscription;\\n\\nuse ratelmq::mqtt::transport::mqtt_bytes_stream::MqttBytesReadStream;\\n\\nuse ratelmq::mqtt::transport::packet_decoder;\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn it_read_connect_min() {\\n\\n const DATA: &[u8] = &[\\n\\n 0x10, 0x23, 0x00, 0x04, 0x4d, 0x51, 0x54, 0x54, 0x04, 0x02, 0x00, 0x3c, 0x00, 0x17, 0x6d,\\n\\n 0x6f, 0x73, 0x71, 0x2d, 0x6e, 0x73, 0x36, 0x73, 0x7a, 0x33, 0x6b, 0x33, 0x6c, 0x62, 0x66,\\n\\n 0x4d, 0x31, 0x49, 0x66, 0x62, 0x63, 0x52,\\n\\n ];\\n\\n\\n\\n let packet = read_packet(DATA).await;\\n\\n\\n\\n match packet {\\n\\n ControlPacket::Connect(connect) => {\\n\",\n \"file_path\": \"tests/read_packets.rs\",\n \"rank\": 33,\n \"score\": 3.5170258650180655\n },\n {\n \"content\": \" return Err(tokio::io::Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n \\\"Malformed payload\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n let mut subscriptions = Vec::new();\\n\\n while remaining_length > 0 {\\n\\n let topic = buffer.get_string().await?;\\n\\n let qos = buffer.get_u8().await?;\\n\\n if qos > 2 {\\n\\n return Err(tokio::io::Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n \\\"Malformed QoS\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n remaining_length -= topic.len() as u64 + 3u64 /* 2 topic length + QoS*/;\\n\\n\\n\\n let subscription = Subscription::new(topic, QoS::from_bits(qos));\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 34,\n \"score\": 3.4849819764707277\n },\n {\n \"content\": \"use crate::broker::session::session_repository::SessionRepository;\\n\\nuse crate::broker::session::Session;\\n\\nuse crate::mqtt::packets::ClientId;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct SessionService<T>\\n\\nwhere\\n\\n T: SessionRepository,\\n\\n{\\n\\n repository: T,\\n\\n}\\n\\n\\n\\nimpl<T> SessionService<T>\\n\\nwhere\\n\\n T: SessionRepository,\\n\\n{\\n\\n pub fn new(repository: T) -> Self {\\n\\n SessionService { repository }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/broker/session/session_service.rs\",\n \"rank\": 35,\n \"score\": 3.469602781372993\n },\n {\n \"content\": \"\\n\\nimpl Default for InMemorySessionRepository {\\n\\n fn default() -> Self {\\n\\n InMemorySessionRepository {\\n\\n sessions: HashMap::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::net::{IpAddr, Ipv4Addr};\\n\\n use tokio::sync::mpsc;\\n\\n\\n\\n fn create_session() -> Session {\\n\\n let (tx, _rx) = mpsc::channel(32);\\n\\n Session::new(\\n\\n \\\"client-1\\\".to_string(),\\n\\n IpAddr::V4(Ipv4Addr::LOCALHOST),\\n\",\n \"file_path\": \"src/broker/session/session_repository.rs\",\n \"rank\": 36,\n \"score\": 3.4362660203051827\n },\n {\n \"content\": \"use crate::mqtt::packets::QoS;\\n\\nuse bytes::BytesMut;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct Message {\\n\\n pub topic: String,\\n\\n pub payload: BytesMut,\\n\\n pub qos: QoS,\\n\\n pub retain: bool,\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/message.rs\",\n \"rank\": 37,\n \"score\": 3.320150933331645\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\npub async fn decode_remaining_length(buffer: &mut MqttBytesReadStream) -> Result<u64, Error> {\\n\\n let mut remaining_length = 0u64;\\n\\n let mut multiplier = 1u64;\\n\\n\\n\\n loop {\\n\\n let byte = buffer.get_u8().await?;\\n\\n remaining_length += (byte & 127) as u64 * multiplier;\\n\\n multiplier *= 128;\\n\\n\\n\\n if multiplier > 128 * 128 * 128 {\\n\\n return Err(tokio::io::Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n \\\"Malformed remaining length multiplier\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n let continuation_bit = byte & 128;\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 38,\n \"score\": 3.3168330273709183\n },\n {\n \"content\": \"use crate::mqtt::message::Message;\\n\\nuse crate::mqtt::packets::QoS;\\n\\nuse bytes::BytesMut;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct PublishPacket {\\n\\n pub packet_id: Option<u16>,\\n\\n pub dup: bool,\\n\\n\\n\\n pub message: Message,\\n\\n}\\n\\n\\n\\nimpl PublishPacket {\\n\\n pub fn new(\\n\\n topic: String,\\n\\n body: BytesMut,\\n\\n qos: QoS,\\n\\n retain: bool,\\n\\n packet_id: Option<u16>,\\n\\n dup: bool,\\n\",\n \"file_path\": \"src/mqtt/packets/publish.rs\",\n \"rank\": 39,\n \"score\": 3.3090880302382617\n },\n {\n \"content\": \"use crate::mqtt::packets::{ClientId, ConnectPacket, ControlPacket};\\n\\nuse std::net::SocketAddr;\\n\\nuse tokio::sync::mpsc::Sender;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum ClientEvent {\\n\\n Connected(ConnectPacket, SocketAddr, Sender<ServerEvent>),\\n\\n ControlPacket(ClientId, ControlPacket, Sender<ServerEvent>),\\n\\n Disconnected(ClientId),\\n\\n ConnectionLost(ClientId),\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum ServerEvent {\\n\\n ControlPacket(ControlPacket),\\n\\n Disconnect,\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/events.rs\",\n \"rank\": 40,\n \"score\": 3.2637900681751377\n },\n {\n \"content\": \"use crate::mqtt::packets::QoS;\\n\\nuse std::fmt;\\n\\nuse std::fmt::{Display, Formatter};\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct Subscription {\\n\\n topic: String,\\n\\n qos: QoS,\\n\\n}\\n\\n\\n\\nimpl Display for Subscription {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"topic: '{}' QoS: {}\\\", self.topic, self.qos)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Subscription {\\n\\n pub fn new(topic: String, qos: QoS) -> Subscription {\\n\\n Subscription { topic, qos }\\n\\n }\\n\\n\\n\\n pub fn topic(&self) -> &str {\\n\\n self.topic.as_str()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/subscription.rs\",\n \"rank\": 41,\n \"score\": 3.2637900681751377\n },\n {\n \"content\": \" pub async fn put_u8(&mut self, n: u8) -> Result<(), Error> {\\n\\n self.write_buffer_if_too_small(1).await?;\\n\\n\\n\\n self.write_buffer.put_u8(n);\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn put_u16(&mut self, n: u16) -> Result<(), Error> {\\n\\n self.write_buffer_if_too_small(2).await?;\\n\\n\\n\\n self.write_buffer.put_u16(n);\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn put_string(&mut self, string: &str) -> Result<(), Error> {\\n\\n self.put_u16(string.len() as u16).await?;\\n\\n self.put_bytes(BytesMut::from(string.as_bytes())).await?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 42,\n \"score\": 3.209914666530279\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub async fn put_u16(&mut self, n: u16) -> Result<(), Error> {\\n\\n self.write_buffer_if_too_small(2).await?;\\n\\n\\n\\n self.write_buffer.put_u16(n);\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn put_string(&mut self, string: &str) -> Result<(), Error> {\\n\\n self.put_u16(string.len() as u16).await?;\\n\\n self.put_bytes(BytesMut::from(string.as_bytes())).await?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn put_bytes(&mut self, mut bytes: BytesMut) -> Result<(), Error> {\\n\\n let mut remaining_size = bytes.len();\\n\\n\\n\\n while remaining_size > 0 {\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 43,\n \"score\": 3.19520073299748\n },\n {\n \"content\": \"mod messaging_service;\\n\\n\\n\\nmod subscriptions_repository;\\n\\n\\n\\npub use self::messaging_service::MessagingService;\\n\",\n \"file_path\": \"src/broker/messaging/mod.rs\",\n \"rank\": 44,\n \"score\": 3.1751366783827146\n },\n {\n \"content\": \" subscriptions.push(subscription);\\n\\n }\\n\\n\\n\\n let packet = SubscribePacket::new(packet_id, subscriptions);\\n\\n Ok(ControlPacket::Subscribe(packet))\\n\\n}\\n\\n\\n\\nasync fn decode_unsubscribe(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n mut remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b10100010).await?;\\n\\n remaining_length -= 2;\\n\\n\\n\\n if remaining_length == 0 {\\n\\n return Err(tokio::io::Error::new(\\n\\n ErrorKind::InvalidData,\\n\\n \\\"Malformed payload\\\",\\n\\n ));\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 45,\n \"score\": 3.1518573199213447\n },\n {\n \"content\": \" trace!(\\\"Got packet {:?}\\\", packet);\\n\\n\\n\\n match packet {\\n\\n // ControlPacket::Connect(c) => {\\n\\n // self.on_connect(action.response, c, &mut sessions).await\\n\\n // }\\n\\n // ControlPacket::ConnAck(_) => {}\\n\\n ControlPacket::Publish(p) => self.on_publish(tx, p, client_id).await,\\n\\n // ControlPacket::PubAck(_) => {}\\n\\n // ControlPacket::PubRec(_) => {}\\n\\n // ControlPacket::PubRel(_) => {}\\n\\n // ControlPacket::PubComp(_) => {}\\n\\n ControlPacket::Subscribe(p) => self.on_subscribe(tx, p, &client_id).await,\\n\\n // ControlPacket::SubAck(_) => {}\\n\\n ControlPacket::Unsubscribe(p) => self.on_unsubscribe(tx, p, &client_id).await,\\n\\n // ControlPacket::UnsubAck(_) => {}\\n\\n ControlPacket::PingReq => self.on_ping_req(tx).await,\\n\\n // ControlPacket::PingResp() => {}\\n\\n ControlPacket::Disconnect(_) => self.on_disconnect(client_id).await,\\n\\n _ => error!(\\\"Packet {} not supported\\\", &packet),\\n\",\n \"file_path\": \"src/broker/manager.rs\",\n \"rank\": 46,\n \"score\": 3.12068885036652\n },\n {\n \"content\": \" ctrl_c_rx,\\n\\n // sessions: SessionService::default(),\\n\\n messaging: MessagingService::new(),\\n\\n identity_provider,\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn run(mut self) {\\n\\n loop {\\n\\n select! {\\n\\n _ = self.ctrl_c_rx.recv() => {\\n\\n trace!(\\\"Stopping manager\\\");\\n\\n break;\\n\\n }\\n\\n maybe_event = self.rx.recv() => {\\n\\n if let Some(event) = maybe_event {\\n\\n trace!(\\\"Got event {:?}\\\", &event);\\n\\n\\n\\n match event {\\n\\n ClientEvent::Connected(c, address, tx) => self.on_connect(tx, c, address).await,\\n\",\n \"file_path\": \"src/broker/manager.rs\",\n \"rank\": 47,\n \"score\": 3.094138629880727\n },\n {\n \"content\": \"async fn write_pub_ack(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: PubAckPacket,\\n\\n) -> Result<(), Error> {\\n\\n write_packet_with_packet_id(buffer, PACKET_TYPE_PUB_ACK << 4, packet.packet_id).await?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_pub_rec(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: PubRecPacket,\\n\\n) -> Result<(), Error> {\\n\\n write_packet_with_packet_id(buffer, PACKET_TYPE_PUB_REC << 4, packet.packet_id).await?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_pub_rel(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: PubRelPacket,\\n\\n) -> Result<(), Error> {\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 48,\n \"score\": 2.951658689931886\n },\n {\n \"content\": \"use crate::mqtt::packets::{ClientId, ProtocolVersion};\\n\\n\\n\\nuse crate::mqtt::message::Message;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct ConnectPacket {\\n\\n pub version: ProtocolVersion,\\n\\n pub client_id: ClientId,\\n\\n pub keep_alive_seconds: u16,\\n\\n pub clean_session: bool,\\n\\n\\n\\n pub will_message: Option<Message>,\\n\\n\\n\\n pub user_name: Option<String>,\\n\\n pub password: Option<String>,\\n\\n}\\n\\n\\n\\nimpl ConnectPacket {\\n\\n pub fn new(\\n\\n version: ProtocolVersion,\\n\",\n \"file_path\": \"src/mqtt/packets/connect.rs\",\n \"rank\": 49,\n \"score\": 2.7464681902971733\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub async fn finish_packet(&mut self) -> Result<(), Error> {\\n\\n self.tcp_stream.write_buf(&mut self.write_buffer).await?;\\n\\n // self.tcp_stream.flush().await?;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n async fn write_buffer_if_too_small(&mut self, size: usize) -> Result<(), Error> {\\n\\n if self.write_buffer.len() + size >= self.write_buffer.capacity() {\\n\\n self.tcp_stream.write_buf(&mut self.write_buffer).await?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MqttBytesReadStream {\\n\\n pub fn new(buffer_size: usize, read_stream: OwnedReadHalf) -> Self {\\n\\n MqttBytesReadStream {\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 50,\n \"score\": 2.631020846668261\n },\n {\n \"content\": \" Ok(())\\n\\n }\\n\\n\\n\\n async fn write_buffer_if_too_small(&mut self, size: usize) -> Result<(), Error> {\\n\\n if self.write_buffer.len() + size >= self.write_buffer.capacity() {\\n\\n self.write_stream.write_buf(&mut self.write_buffer).await?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 51,\n \"score\": 2.607993115325768\n },\n {\n \"content\": \" packet: UnSubAckPacket,\\n\\n) -> Result<(), Error> {\\n\\n // fixed header\\n\\n write_packet_with_packet_id(buffer, PACKET_TYPE_UNSUB_ACK << 4, packet.packet_id).await?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_ping_resp(buffer: &mut MqttBytesWriteStream) -> Result<(), Error> {\\n\\n // fixed header\\n\\n buffer.put_u8(PACKET_TYPE_PING_RESP << 4).await?;\\n\\n\\n\\n const REMAINING_LENGTH: u64 = 0;\\n\\n encode_remaining_length(REMAINING_LENGTH, buffer).await?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_packet_with_packet_id(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 52,\n \"score\": 2.6015619235411465\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl IdentityProvider for FileIdentityManager {\\n\\n fn authenticate(&self, username: &str, password: &str) -> Result<(), AuthenticationError> {\\n\\n // todo: encryption\\n\\n\\n\\n self.passwords_by_username\\n\\n .get(username)\\n\\n .ok_or(UserNotFound)?\\n\\n .eq(password)\\n\\n .then(|| ())\\n\\n .ok_or(InvalidPassword)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/broker/authentication.rs\",\n \"rank\": 53,\n \"score\": 2.5507320162134097\n },\n {\n \"content\": \"async fn decode_pub_comp(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n _remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01110000).await?;\\n\\n Ok(ControlPacket::PubComp(PubCompPacket::new(packet_id)))\\n\\n}\\n\\n\\n\\nasync fn decode_subscribe(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n mut remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b10000010).await?;\\n\\n remaining_length -= 2;\\n\\n\\n\\n // payload\\n\\n\\n\\n if remaining_length == 0 {\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 54,\n \"score\": 2.4506457437345954\n },\n {\n \"content\": \" let mut first_byte = PACKET_TYPE_PUB_REL << 4;\\n\\n first_byte |= 0b10;\\n\\n write_packet_with_packet_id(buffer, first_byte, packet.packet_id).await?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_pub_comp(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: PubCompPacket,\\n\\n) -> Result<(), Error> {\\n\\n write_packet_with_packet_id(buffer, PACKET_TYPE_PUB_COMP << 4, packet.packet_id).await?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_sub_ack(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: SubAckPacket,\\n\\n) -> Result<(), Error> {\\n\\n // fixed header\\n\\n buffer.put_u8(PACKET_TYPE_SUB_ACK << 4).await?;\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 55,\n \"score\": 2.4506457437345954\n },\n {\n \"content\": \" pub fn new(config_filename: &str) -> Result<Self, ConfigError> {\\n\\n let mut config = Config::new();\\n\\n\\n\\n config.merge(File::with_name(config_filename).format(FileFormat::Toml))?;\\n\\n config.merge(Environment::with_prefix(\\\"ratelmq\\\").separator(\\\"__\\\"))?;\\n\\n\\n\\n config.try_into()\\n\\n }\\n\\n}\\n\\n\\n\\n// todo: tests for envs precedence\\n\",\n \"file_path\": \"src/settings/mod.rs\",\n \"rank\": 56,\n \"score\": 2.39310309527849\n },\n {\n \"content\": \"}\\n\\n\\n\\nasync fn decode_pub_rec(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n _remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01010000).await?;\\n\\n Ok(ControlPacket::PubRec(PubRecPacket::new(packet_id)))\\n\\n}\\n\\n\\n\\nasync fn decode_pub_rel(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n _remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01100010).await?;\\n\\n Ok(ControlPacket::PubRel(PubRelPacket::new(packet_id)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 57,\n \"score\": 2.375481405853452\n },\n {\n \"content\": \" first_byte: u8,\\n\\n packet_id: u16,\\n\\n) -> Result<(), Error> {\\n\\n // fixed header\\n\\n buffer.put_u8(first_byte).await?;\\n\\n\\n\\n const REMAINING_LENGTH: u64 = 2;\\n\\n encode_remaining_length(REMAINING_LENGTH, buffer).await?;\\n\\n\\n\\n // variable header\\n\\n buffer.put_u16(packet_id).await?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 58,\n \"score\": 2.3687063971915863\n },\n {\n \"content\": \"use crate::mqtt::subscription::Subscription;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct SubscribePacket {\\n\\n pub packet_id: u16,\\n\\n\\n\\n pub subscriptions: Vec<Subscription>,\\n\\n}\\n\\n\\n\\nimpl SubscribePacket {\\n\\n pub fn new(packet_id: u16, subscriptions: Vec<Subscription>) -> Self {\\n\\n SubscribePacket {\\n\\n packet_id,\\n\\n subscriptions,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mqtt/packets/subscribe.rs\",\n \"rank\": 59,\n \"score\": 2.3354107111220164\n },\n {\n \"content\": \" let mut remaining_length = size;\\n\\n\\n\\n while remaining_length > 0 {\\n\\n // todo: use clamp when stabilized\\n\\n let wait_for_bytes = {\\n\\n if remaining_length > self.read_buffer.capacity() {\\n\\n self.read_buffer.capacity()\\n\\n } else {\\n\\n remaining_length\\n\\n }\\n\\n };\\n\\n\\n\\n self.wait_for_data(wait_for_bytes).await?;\\n\\n bytes.put(self.read_buffer.split_to(wait_for_bytes));\\n\\n remaining_length -= wait_for_bytes;\\n\\n }\\n\\n\\n\\n Ok(bytes)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 60,\n \"score\": 2.312756894608573\n },\n {\n \"content\": \" async fn on_connection_lost(&mut self, client_id: ClientId) {\\n\\n info!(\\\"Client {:?} disconnected unexpectedly\\\", &client_id);\\n\\n self.messaging.connection_lost(&client_id);\\n\\n\\n\\n debug!(\\n\\n \\\"Active sessions count: {:?}\\\",\\n\\n self.messaging.session_count()\\n\\n );\\n\\n }\\n\\n\\n\\n async fn on_publish(\\n\\n &self,\\n\\n _sender: Sender<ServerEvent>,\\n\\n publish: PublishPacket,\\n\\n client_id: ClientId,\\n\\n ) {\\n\\n debug!(\\n\\n \\\"Client {:?} published message on topic {:?}\\\",\\n\\n &client_id, &publish.message.topic\\n\\n );\\n\",\n \"file_path\": \"src/broker/manager.rs\",\n \"rank\": 61,\n \"score\": 2.194794513331142\n },\n {\n \"content\": \" ProtocolVersion::Mqtt3,\\n\\n client_id,\\n\\n keep_alive_seconds,\\n\\n clean_session,\\n\\n None,\\n\\n user_name,\\n\\n password,\\n\\n );\\n\\n\\n\\n Ok(ControlPacket::Connect(connect_packet))\\n\\n}\\n\\n\\n\\nasync fn decode_publish(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n mut remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n bitflags! {\\n\\n struct FixedHeaderFlags: u8 {\\n\\n const RETAIN = 0b00000001;\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 62,\n \"score\": 2.110516289953459\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MqttBytesWriteStream {\\n\\n pub fn new(buffer_size: usize, write_stream: OwnedWriteHalf) -> Self {\\n\\n MqttBytesWriteStream {\\n\\n write_buffer: BytesMut::with_capacity(buffer_size),\\n\\n write_stream,\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn put_u8(&mut self, n: u8) -> Result<(), Error> {\\n\\n self.write_buffer_if_too_small(1).await?;\\n\\n\\n\\n self.write_buffer.put_u8(n);\\n\\n Ok(())\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 63,\n \"score\": 2.110516289953459\n },\n {\n \"content\": \"\\n\\n pub async fn put_bytes(&mut self, mut bytes: BytesMut) -> Result<(), Error> {\\n\\n let mut remaining_size = bytes.len();\\n\\n\\n\\n while remaining_size > 0 {\\n\\n let bytes_to_write = {\\n\\n if remaining_size > self.write_buffer.capacity() {\\n\\n self.write_buffer.capacity()\\n\\n } else {\\n\\n remaining_size\\n\\n }\\n\\n };\\n\\n self.write_buffer_if_too_small(bytes_to_write).await?;\\n\\n\\n\\n self.write_buffer.put(bytes.split_to(bytes_to_write));\\n\\n\\n\\n remaining_size -= bytes_to_write;\\n\\n }\\n\\n\\n\\n Ok(())\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 64,\n \"score\": 2.091518250836893\n },\n {\n \"content\": \" let bytes_to_write = {\\n\\n if remaining_size > self.write_buffer.capacity() {\\n\\n self.write_buffer.capacity()\\n\\n } else {\\n\\n remaining_size\\n\\n }\\n\\n };\\n\\n self.write_buffer_if_too_small(bytes_to_write).await?;\\n\\n\\n\\n self.write_buffer.put(bytes.split_to(bytes_to_write));\\n\\n\\n\\n remaining_size -= bytes_to_write;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn finish_packet(&mut self) -> Result<(), Error> {\\n\\n self.write_stream.write_buf(&mut self.write_buffer).await?;\\n\\n // self.tcp_stream.flush().await?;\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 65,\n \"score\": 2.0728591861853936\n },\n {\n \"content\": \"\\n\\n pub fn unsubscribe(&mut self, client_id: &ClientId, topics: &Vec<String>) {\\n\\n self.subscriptions.unsubscribe(client_id, topics);\\n\\n }\\n\\n\\n\\n pub async fn publish(&self, message: &Message, publish: &PublishPacket) {\\n\\n if let Some(client_ids) = self.subscriptions.subscribed_clients(&message.topic) {\\n\\n for c in &client_ids {\\n\\n match self.sessions.get(c) {\\n\\n Some(session) => {\\n\\n let event = ServerEvent::ControlPacket(Publish(publish.clone()));\\n\\n session.sender().send(event).await.unwrap();\\n\\n }\\n\\n None => {\\n\\n warn!(\\n\\n \\\"Tried to send message, but session for client {:?} not found\\\",\\n\\n c\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/broker/messaging/messaging_service.rs\",\n \"rank\": 66,\n \"score\": 2.0466638067941787\n },\n {\n \"content\": \"use crate::mqtt::packets::suback::SubAckReturnCode::Failure;\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone)]\\n\\npub enum SubAckReturnCode {\\n\\n SuccessQoS0 = 0x00,\\n\\n SuccessQoS1 = 0x01,\\n\\n SuccessQoS2 = 0x02,\\n\\n Failure = 0x80,\\n\\n}\\n\\n\\n\\nimpl Default for SubAckReturnCode {\\n\\n fn default() -> Self {\\n\\n Failure\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone, Default)]\\n\\npub struct SubAckPacket {\\n\\n pub packet_id: u16,\\n\\n\\n\",\n \"file_path\": \"src/mqtt/packets/suback.rs\",\n \"rank\": 67,\n \"score\": 1.985365342663851\n },\n {\n \"content\": \" const REMAINING_LENGTH: u64 = 2;\\n\\n encode_remaining_length(REMAINING_LENGTH, buffer).await?;\\n\\n\\n\\n // variable header\\n\\n buffer.put_u8(packet.session_present as u8).await?;\\n\\n buffer.put_u8(packet.return_code.clone() as u8).await?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_publish(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: PublishPacket,\\n\\n) -> Result<(), Error> {\\n\\n bitflags! {\\n\\n struct FixedHeaderFlags: u8 {\\n\\n const RETAIN = 0b00000001;\\n\\n const QOS_1 = 0b00000010;\\n\\n const QOS_2 = 0b00000100;\\n\\n const DUP = 0b00001000;\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 68,\n \"score\": 1.9510197405011103\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl MqttBytesStream {\\n\\n pub fn new(\\n\\n read_buffer_size: usize,\\n\\n write_buffer_size: usize,\\n\\n tcp_stream: TcpStream,\\n\\n ) -> MqttBytesStream {\\n\\n MqttBytesStream {\\n\\n read_buffer: BytesMut::with_capacity(read_buffer_size),\\n\\n write_buffer: BytesMut::with_capacity(write_buffer_size),\\n\\n tcp_stream,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MqttBytesStream {\\n\\n pub async fn get_u8(&mut self) -> Result<u8, Error> {\\n\\n self.wait_for_data(1).await?;\\n\\n\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 69,\n \"score\": 1.934773599186426\n },\n {\n \"content\": \"\\n\\nimpl FileIdentityManager {\\n\\n pub fn new(filename: &str) -> Result<FileIdentityManager, FileIdentityManagerError> {\\n\\n let credentials = std::fs::read_to_string(filename)?;\\n\\n\\n\\n let mut passwords_by_username = HashMap::with_capacity(credentials.lines().count());\\n\\n\\n\\n for line in credentials.lines() {\\n\\n let credential = line.split_once(':').ok_or(InvalidEntry)?;\\n\\n let username = credential.0;\\n\\n let password = credential.1;\\n\\n\\n\\n passwords_by_username.insert(username.to_owned(), password.to_owned());\\n\\n }\\n\\n\\n\\n let manager = FileIdentityManager {\\n\\n passwords_by_username,\\n\\n };\\n\\n\\n\\n Ok(manager)\\n\",\n \"file_path\": \"src/broker/authentication.rs\",\n \"rank\": 70,\n \"score\": 1.903079709824774\n },\n {\n \"content\": \" remaining_length\\n\\n }\\n\\n };\\n\\n\\n\\n self.wait_for_data(wait_for_bytes).await?;\\n\\n bytes.put(self.read_buffer.split_to(wait_for_bytes));\\n\\n remaining_length -= wait_for_bytes;\\n\\n }\\n\\n\\n\\n Ok(bytes)\\n\\n }\\n\\n\\n\\n async fn wait_for_data(&mut self, bytes: usize) -> Result<(), Error> {\\n\\n while self.read_buffer.len() < bytes {\\n\\n let read_bytes_num = self.tcp_stream.read_buf(&mut self.read_buffer).await?;\\n\\n\\n\\n // todo: Handle better?\\n\\n let connection_closed = read_bytes_num == 0; // end of file\\n\\n if connection_closed {\\n\\n let clean_shutdown = self.read_buffer.is_empty();\\n\",\n \"file_path\": \"src/mqtt/transport/mqtt_bytes_stream.rs\",\n \"rank\": 71,\n \"score\": 1.903079709824774\n },\n {\n \"content\": \" PACKET_TYPE_SUBSCRIBE => {\\n\\n decode_subscribe(mqtt_stream, first_byte, remaining_length).await?\\n\\n }\\n\\n PACKET_TYPE_UNSUBSCRIBE => {\\n\\n decode_unsubscribe(mqtt_stream, first_byte, remaining_length).await?\\n\\n }\\n\\n PACKET_TYPE_PING_REQ => ControlPacket::PingReq,\\n\\n PACKET_TYPE_DISCONNECT => ControlPacket::Disconnect(DisconnectPacket::default()),\\n\\n _ => unimplemented!(),\\n\\n };\\n\\n\\n\\n Ok(packet)\\n\\n}\\n\\n\\n\\nasync fn decode_connect(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n _first_byte: u8,\\n\\n _remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n bitflags! {\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 72,\n \"score\": 1.828209118312012\n },\n {\n \"content\": \" }\\n\\n\\n\\n let mut topics = Vec::new();\\n\\n while remaining_length > 0 {\\n\\n let topic = buffer.get_string().await?;\\n\\n\\n\\n remaining_length -= topic.len() as u64 + 2u64/* 2 topic length */;\\n\\n\\n\\n topics.push(topic);\\n\\n }\\n\\n\\n\\n let packet = UnsubscribePacket::new(packet_id, topics);\\n\\n Ok(ControlPacket::Unsubscribe(packet))\\n\\n}\\n\\n\\n\\nasync fn decode_packet_with_packet_id(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n expected_first_byte: u8,\\n\\n) -> Result<u16, Error> {\\n\\n validate_first_byte(first_byte, expected_first_byte)?;\\n\\n\\n\\n let packet_id = buffer.get_u16().await?;\\n\\n Ok(packet_id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 73,\n \"score\": 1.719943995305314\n },\n {\n \"content\": \" remaining_length -= 2;\\n\\n Some(buffer.get_u16().await?)\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n // payload\\n\\n let body = buffer.get_bytes(remaining_length as usize).await?;\\n\\n\\n\\n let packet = PublishPacket::new(topic, body, qos, retain, packet_id, dup);\\n\\n Ok(ControlPacket::Publish(packet))\\n\\n}\\n\\n\\n\\nasync fn decode_pub_ack(\\n\\n buffer: &mut MqttBytesReadStream,\\n\\n first_byte: u8,\\n\\n _remaining_length: u64,\\n\\n) -> Result<ControlPacket, Error> {\\n\\n let packet_id = decode_packet_with_packet_id(buffer, first_byte, 0b01000000).await?;\\n\\n Ok(ControlPacket::PubAck(PubAckPacket::new(packet_id)))\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 75,\n \"score\": 1.694852040182326\n },\n {\n \"content\": \" }\\n\\n\\n\\n buffer.put_u8(encoded_byte).await?;\\n\\n\\n\\n if remaining_length == 0 {\\n\\n break;\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\npub async fn write_packet(\\n\\n mqtt_stream: &mut MqttBytesWriteStream,\\n\\n packet: ControlPacket,\\n\\n) -> Result<(), Error> {\\n\\n match packet {\\n\\n ControlPacket::ConnAck(conn_ack) => write_conn_ack(mqtt_stream, conn_ack).await?,\\n\\n ControlPacket::Publish(publish) => write_publish(mqtt_stream, publish).await?,\\n\\n ControlPacket::PubAck(pub_ack) => write_pub_ack(mqtt_stream, pub_ack).await?,\\n\\n ControlPacket::PubRec(pub_rec) => write_pub_rec(mqtt_stream, pub_rec).await?,\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 76,\n \"score\": 1.6237847259263658\n },\n {\n \"content\": \" ControlPacket::PubRel(pub_rel) => write_pub_rel(mqtt_stream, pub_rel).await?,\\n\\n ControlPacket::PubComp(pub_comp) => write_pub_comp(mqtt_stream, pub_comp).await?,\\n\\n ControlPacket::SubAck(sub_ack) => write_sub_ack(mqtt_stream, sub_ack).await?,\\n\\n ControlPacket::UnsubAck(unsub_ack) => write_unsub_ack(mqtt_stream, unsub_ack).await?,\\n\\n ControlPacket::PingResp => write_ping_resp(mqtt_stream).await?,\\n\\n _ => unimplemented!(),\\n\\n };\\n\\n\\n\\n mqtt_stream.finish_packet().await?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn write_conn_ack(\\n\\n buffer: &mut MqttBytesWriteStream,\\n\\n packet: ConnAckPacket,\\n\\n) -> Result<(), Error> {\\n\\n // fixed header\\n\\n buffer.put_u8(PACKET_TYPE_CONN_ACK << 4).await?;\\n\\n\\n\",\n \"file_path\": \"src/mqtt/transport/packet_encoder.rs\",\n \"rank\": 77,\n \"score\": 1.4334480728616255\n },\n {\n \"content\": \" if continuation_bit == 0 {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(remaining_length)\\n\\n}\\n\\n\\n\\npub async fn read_packet(mqtt_stream: &mut MqttBytesReadStream) -> Result<ControlPacket, Error> {\\n\\n let first_byte = mqtt_stream.get_u8().await?;\\n\\n let packet_type = first_byte >> 4;\\n\\n let remaining_length = decode_remaining_length(mqtt_stream).await?;\\n\\n\\n\\n let packet = match packet_type {\\n\\n PACKET_TYPE_CONNECT => decode_connect(mqtt_stream, first_byte, remaining_length).await?,\\n\\n PACKET_TYPE_PUBLISH => decode_publish(mqtt_stream, first_byte, remaining_length).await?,\\n\\n PACKET_TYPE_PUB_ACK => decode_pub_ack(mqtt_stream, first_byte, remaining_length).await?,\\n\\n PACKET_TYPE_PUB_REC => decode_pub_rec(mqtt_stream, first_byte, remaining_length).await?,\\n\\n PACKET_TYPE_PUB_REL => decode_pub_rel(mqtt_stream, first_byte, remaining_length).await?,\\n\\n PACKET_TYPE_PUB_COMP => decode_pub_comp(mqtt_stream, first_byte, remaining_length).await?,\\n\",\n \"file_path\": \"src/mqtt/transport/packet_decoder.rs\",\n \"rank\": 78,\n \"score\": 1.2419041175934593\n },\n {\n \"content\": \"# RatelMQ\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n**RatelMQ is an efficient, reliable & scalable MQTT broker.**\\n\\n\\n\\n---\\n\\n\\n\\n## Installation\\n\\n\\n\\n### Docker image\\n\\n\\n\\nRatelMQ images are available on [Docker Hub](https://hub.docker.com/r/ratelmq/ratelmq).\\n\\n\\n\\nStart container: `docker run --name ratelmq -p 1883:1883 ratelmq/ratelmq:main`\\n\\n\\n\\n### Precompiled binaries\\n\\n\\n\\nTBD\\n\\n\\n\\n### Building from sources\\n\\n\\n\\nTBD\\n\\n\\n\\n## Configuration\\n\\n\\n\\nThe main configuration file is located in the `/etc/ratelmq/ratelmq.conf`.\\n\\nRatelMQ supports configuration via a [TOML](https://github.com/toml-lang/toml) file and environment variables.\\n\\n\\n\\nEnvironment variables take precedence and overwrites those from the configuration file.\\n\\nWhen using environment variables:\\n\\n\\n\\n* add `RATELMQ_` prefix\\n\\n* separate nested items with `__`, e.g. `RATELMQ_MQTT__SOMETHING`\\n\\n\\n\\nFor the default values with description please see [config/ratelmq.toml](config/ratelmq.toml).\\n\\n\\n\\n## Changelog\\n\\n\\n\\nSee [CHANGELOG.md](CHANGELOG.md) for details.\\n\\n\\n\\n## Roadmap\\n\\n\\n\\nSee [ROADMAP.md](ROADMAP.md) for details.\\n\\n\\n\\n## Versioning\\n\\n\\n\\nTBD\\n\\n\\n\\n## Resources\\n\\n\\n\\n* MQTT 3.1.1 spec: <https://docs.oasis-open.org/mqtt/mqtt/v3.1.1/os/mqtt-v3.1.1-os.html>\\n\\n\\n\\n## Contributing\\n\\n\\n\\nTBD\\n\\n\\n\\n## License\\n\\n\\n\\nThe project is licensed under the Apache License 2.0, see [LICENSE](LICENSE).\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 79,\n \"score\": 1.0453054396394528\n }\n]","isConversational":false}}},{"rowIdx":1180,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/utils.rs"},"repo_name":{"kind":"string","value":"KaiWitt/kalayo"},"commit":{"kind":"string","value":"5498ed501cb7799cacb709403ba8a6141dc3e2e4"},"file_code":{"kind":"string","value":"use bitcoin::util::address::Address;\nuse bitcoin::{AddressType, Network};\nuse std::str::FromStr;\nuse warp::hyper::StatusCode;\nuse warp::Rejection;\n\nuse crate::error::ErrorMsg;\n\npub fn validate_address(address: Address) -> Result<Address, Rejection> {\n if address.network != Network::Bitcoin {\n return Err(ErrorMsg::reject_new(\n StatusCode::BAD_REQUEST,\n format!(\"Address [{}] is not a Bitcoin mainnet address.\", address),\n ));\n }\n if let Some(addr_type) = address.address_type() {\n if addr_type != AddressType::P2wpkh {\n let msg = format!(\"[{}] is not a P2WPKH Bitcoin mainnet address.\", &address);\n return Err(ErrorMsg::reject_new(StatusCode::BAD_REQUEST, msg));\n }\n\n return Ok(address);\n }\n\n log::warn!(\"Adress [{}] has no address type\", address);\n Err(ErrorMsg::reject_new(\n StatusCode::BAD_REQUEST,\n format!(\"Address [{}] has no address type.\", address),\n ))\n}\n\npub fn validate_address_str(address: &str) -> Result<Address, Rejection> {\n match Address::from_str(address) {\n Ok(address) => validate_address(address),\n Err(_) => {\n let msg = format!(\"[{}] is not a valid Bitcoin address.\", &address);\n Err(ErrorMsg::reject_new(StatusCode::BAD_REQUEST, msg))\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use std::str::FromStr;\n\n use bitcoin::Address;\n\n use crate::utils::{validate_address, validate_address_str};\n\n #[test]\n fn validate_address_returns_address_when_address_is_mainnet_p2wpkh() {\n let p2wpkh = Address::from_str(\"bc1qx46k3hyr7pu83vj3srapz0hdht3gzy8j3yplmp\").unwrap();\n\n let p2wpkh_validated = validate_address(p2wpkh.clone()).unwrap();\n\n assert_eq!(p2wpkh_validated, p2wpkh);\n }\n\n #[test]\n fn validate_address_returns_err_when_address_is_not_p2wpkh() {\n let p2pkh = Address::from_str(\"1P5ZEDWTKTFGxQjZphgWPQUpe554WKDfHQ\").unwrap();\n let p2sh = Address::from_str(\"34xp4vRoCGJym3xR7yCVPFHoCNxv4Twseo\").unwrap();\n let p2wsh =\n Address::from_str(\"bc1q8500kqh90vgkgsdnsw6a84mrzmgwwnhtxuu5wy347wuxk0g08e4smc3tl9\")\n .unwrap();\n\n let p2pkh_validated = validate_address(p2pkh.clone());\n let p2sh_validated = validate_address(p2sh.clone());\n let p2wsh_validated = validate_address(p2wsh.clone());\n\n assert!(p2pkh_validated.is_err());\n assert!(p2sh_validated.is_err());\n assert!(p2wsh_validated.is_err());\n }\n\n #[test]\n fn validate_address_returns_err_when_address_is_not_mainnet() {\n let testnet_addr = Address::from_str(\"tb1qt25c7aencjadsva2tkzmkc9juqslnn2e0kug4h\").unwrap();\n\n let validated = validate_address(testnet_addr.clone());\n\n assert!(validated.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_address_when_address_is_mainnet_p2wpkh() {\n let p2wpkh = Address::from_str(\"bc1qx46k3hyr7pu83vj3srapz0hdht3gzy8j3yplmp\").unwrap();\n\n let p2wpkh_validated =\n validate_address_str(\"bc1qx46k3hyr7pu83vj3srapz0hdht3gzy8j3yplmp\").unwrap();\n\n assert_eq!(p2wpkh_validated, p2wpkh);\n }\n\n #[test]\n fn validate_address_str_returns_err_when_address_is_not_p2wpkh() {\n let p2pkh = validate_address_str(\"1P5ZEDWTKTFGxQjZphgWPQUpe554WKDfHQ\");\n let p2sh = validate_address_str(\"34xp4vRoCGJym3xR7yCVPFHoCNxv4Twseo\");\n\n assert!(p2pkh.is_err());\n assert!(p2sh.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_err_when_address_is_not_mainnet() {\n let validated = validate_address_str(\"tb1qt25c7aencjadsva2tkzmkc9juqslnn2e0kug4h\");\n\n assert!(validated.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_err_when_input_is_not_an_address() {\n let validated = validate_address_str(\"notanaddress\");\n\n assert!(validated.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_err_when_input_is_empty() {\n let validated = validate_address_str(\"\");\n\n assert!(validated.is_err());\n }\n}\n"},"prefix":{"kind":"string","value":"use bitcoin::util::address::Address;\nuse bitcoin::{AddressType, Network};\nuse std::str::FromStr;\nuse warp::hyper::StatusCode;\nuse warp::Rejection;\n\nuse crate::error::ErrorMsg;\n\npub fn validate_address(address: Address) -> Result<Address, Rejection> {\n if address.network != Network::Bitcoin {\n return Err(ErrorMsg::reject_new(\n StatusCode::BAD_REQUEST,\n format!(\"Address [{}] is not a Bitcoin mainnet address.\", address),\n ));\n }\n "},"suffix":{"kind":"string","value":"\n\npub fn validate_address_str(address: &str) -> Result<Address, Rejection> {\n match Address::from_str(address) {\n Ok(address) => validate_address(address),\n Err(_) => {\n let msg = format!(\"[{}] is not a valid Bitcoin address.\", &address);\n Err(ErrorMsg::reject_new(StatusCode::BAD_REQUEST, msg))\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use std::str::FromStr;\n\n use bitcoin::Address;\n\n use crate::utils::{validate_address, validate_address_str};\n\n #[test]\n fn validate_address_returns_address_when_address_is_mainnet_p2wpkh() {\n let p2wpkh = Address::from_str(\"bc1qx46k3hyr7pu83vj3srapz0hdht3gzy8j3yplmp\").unwrap();\n\n let p2wpkh_validated = validate_address(p2wpkh.clone()).unwrap();\n\n assert_eq!(p2wpkh_validated, p2wpkh);\n }\n\n #[test]\n fn validate_address_returns_err_when_address_is_not_p2wpkh() {\n let p2pkh = Address::from_str(\"1P5ZEDWTKTFGxQjZphgWPQUpe554WKDfHQ\").unwrap();\n let p2sh = Address::from_str(\"34xp4vRoCGJym3xR7yCVPFHoCNxv4Twseo\").unwrap();\n let p2wsh =\n Address::from_str(\"bc1q8500kqh90vgkgsdnsw6a84mrzmgwwnhtxuu5wy347wuxk0g08e4smc3tl9\")\n .unwrap();\n\n let p2pkh_validated = validate_address(p2pkh.clone());\n let p2sh_validated = validate_address(p2sh.clone());\n let p2wsh_validated = validate_address(p2wsh.clone());\n\n assert!(p2pkh_validated.is_err());\n assert!(p2sh_validated.is_err());\n assert!(p2wsh_validated.is_err());\n }\n\n #[test]\n fn validate_address_returns_err_when_address_is_not_mainnet() {\n let testnet_addr = Address::from_str(\"tb1qt25c7aencjadsva2tkzmkc9juqslnn2e0kug4h\").unwrap();\n\n let validated = validate_address(testnet_addr.clone());\n\n assert!(validated.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_address_when_address_is_mainnet_p2wpkh() {\n let p2wpkh = Address::from_str(\"bc1qx46k3hyr7pu83vj3srapz0hdht3gzy8j3yplmp\").unwrap();\n\n let p2wpkh_validated =\n validate_address_str(\"bc1qx46k3hyr7pu83vj3srapz0hdht3gzy8j3yplmp\").unwrap();\n\n assert_eq!(p2wpkh_validated, p2wpkh);\n }\n\n #[test]\n fn validate_address_str_returns_err_when_address_is_not_p2wpkh() {\n let p2pkh = validate_address_str(\"1P5ZEDWTKTFGxQjZphgWPQUpe554WKDfHQ\");\n let p2sh = validate_address_str(\"34xp4vRoCGJym3xR7yCVPFHoCNxv4Twseo\");\n\n assert!(p2pkh.is_err());\n assert!(p2sh.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_err_when_address_is_not_mainnet() {\n let validated = validate_address_str(\"tb1qt25c7aencjadsva2tkzmkc9juqslnn2e0kug4h\");\n\n assert!(validated.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_err_when_input_is_not_an_address() {\n let validated = validate_address_str(\"notanaddress\");\n\n assert!(validated.is_err());\n }\n\n #[test]\n fn validate_address_str_returns_err_when_input_is_empty() {\n let validated = validate_address_str(\"\");\n\n assert!(validated.is_err());\n }\n}\n"},"middle":{"kind":"string","value":"if let Some(addr_type) = address.address_type() {\n if addr_type != AddressType::P2wpkh {\n let msg = format!(\"[{}] is not a P2WPKH Bitcoin mainnet address.\", &address);\n return Err(ErrorMsg::reject_new(StatusCode::BAD_REQUEST, msg));\n }\n\n return Ok(address);\n }\n\n log::warn!(\"Adress [{}] has no address type\", address);\n Err(ErrorMsg::reject_new(\n StatusCode::BAD_REQUEST,\n format!(\"Address [{}] has no address type.\", address),\n ))\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1181,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"vendor/rust-cdk/src/ic_cdk_macros/src/import.rs"},"repo_name":{"kind":"string","value":"dfinity/bigmap-poc"},"commit":{"kind":"string","value":"177e3be92316064d62e6e31538f01dded65b9ccb"},"file_code":{"kind":"string","value":"use crate::error::Errors;\nuse quote::quote;\nuse serde::Deserialize;\nuse serde_tokenstream::from_tokenstream;\nuse std::path::PathBuf;\nuse std::str::FromStr;\n\n#[derive(Default, Deserialize)]\nstruct ImportAttributes {\n pub canister: Option<String>,\n pub canister_id: Option<String>,\n pub candid_path: Option<PathBuf>,\n}\n\nfn get_env_id_and_candid(canister_name: &str) -> Result<(String, PathBuf), Errors> {\n let canister_id_var_name = format!(\"CANISTER_ID_{}\", canister_name);\n let candid_path_var_name = format!(\"CANISTER_CANDID_{}\", canister_name);\n\n Ok((\n std::env::var(canister_id_var_name).map_err(|_| {\n Errors::message(&format!(\n \"Could not find DFX bindings for canister named '{}'. Did you build using DFX?\",\n canister_name\n ))\n })?,\n std::env::var_os(candid_path_var_name)\n .ok_or_else(|| Errors::message(\"Could not find DFX bindings.\"))\n .map(|p| PathBuf::from(p))?,\n ))\n}\n\nstruct RustLanguageBinding {\n visibility: String,\n canister_id: String,\n}\n\nimpl candid::codegen::rust::RustBindings for RustLanguageBinding {\n fn record(\n &self,\n id: &str,\n fields: &[(String, String)],\n ) -> Result<String, candid::error::Error> {\n let all_fields = fields\n .iter()\n .map(|(name, ty)| format!(\"pub {} : {}\", name, ty))\n .collect::<Vec<String>>()\n .join(\" , \");\n Ok(format!(\n r#\"\n #[derive(Clone, Debug, Default, CandidType, serde::Deserialize)]\n pub struct {} {{ {} }}\n \"#,\n id, all_fields\n ))\n }\n\n fn actor(&self, name: &str, all_functions: &[String]) -> Result<String, candid::error::Error> {\n let mut all_functions_str = String::new();\n for f in all_functions {\n all_functions_str += f;\n }\n\n Ok(format!(\n r#\"{vis} struct {name} {{ }}\n impl {name} {{\n {functions}\n }}\"#,\n vis = self.visibility,\n name = name,\n functions = all_functions_str\n ))\n }\n\n fn actor_function_body(\n &self,\n name: &str,\n arguments: &[(String, String)],\n return_type: &str,\n _is_query: bool,\n ) -> Result<String, candid::error::Error> {\n let canister_id = &self.canister_id;\n\n let arguments = if arguments.is_empty() {\n \"Option::<()>::None\".to_string()\n } else if arguments.len() == 1 {\n format!(\"Some({})\", arguments[0].0)\n } else {\n format!(\n \"Some(({}))\",\n arguments\n .iter()\n .map(|(name, _)| name.clone())\n .collect::<Vec<String>>()\n .join(\",\")\n )\n };\n\n let call = if return_type.is_empty() {\n \"ic_cdk::call_no_return\"\n } else {\n \"ic_cdk::call\"\n };\n\n Ok(format!(\n r#\"\n {{\n {call}(\n ic_cdk::CanisterId::from_str(\"{canister_id}\").unwrap(),\n \"{name}\",\n {arguments}\n )\n .await\n .unwrap()\n }}\n \"#,\n call = call,\n canister_id = canister_id,\n name = name.escape_debug(),\n arguments = arguments,\n ))\n }\n\n fn actor_function(\n &self,\n name: &str,\n arguments: &[(String, String)],\n returns: &[String],\n is_query: bool,\n ) -> Result<String, candid::error::Error> {\n let id = candid::codegen::rust::candid_id_to_rust(name);\n\n \n let return_type = if returns.is_empty() {\n \"\".to_string()\n } else if returns.len() == 1 {\n returns[0].clone()\n } else {\n format!(\"( {} )\", returns.join(\" , \"))\n };\n\n let arguments_list = arguments\n .iter()\n .map(|(name, ty)| format!(\"{} : {}\", name, ty))\n .collect::<Vec<String>>()\n .join(\" , \");\n\n let body = self.actor_function_body(name, arguments, &return_type, is_query)?;\n\n Ok(format!(\n \"async fn {id}( {arguments} ) {return_type} {body}\",\n id = id,\n arguments = arguments_list,\n body = body,\n return_type = if return_type == \"\" {\n format!(\"\")\n } else {\n format!(\" -> {}\", return_type)\n }\n ))\n }\n}\n\npub(crate) fn ic_import(\n attr: proc_macro::TokenStream,\n item: proc_macro::TokenStream,\n) -> Result<proc_macro::TokenStream, Errors> {\n let config = match from_tokenstream::<ImportAttributes>(&proc_macro2::TokenStream::from(attr)) {\n Ok(c) => c,\n Err(err) => return Err(Errors::message(format!(\"{}\", err.to_compile_error()))),\n };\n\n \n let (canister_id, candid_path) = {\n if let Some(canister_name) = config.canister {\n get_env_id_and_candid(&canister_name)?\n } else if let Some(canister_id) = config.canister_id {\n if let Some(candid_path) = config.candid_path {\n (canister_id, candid_path)\n } else {\n return Err(Errors::message(\"Must specify both candid and canister_id.\"));\n }\n } else {\n return Err(Errors::message(\"Must specify both candid and canister_id.\"));\n }\n };\n\n let item =\n syn::parse2::<syn::Item>(proc_macro2::TokenStream::from(item)).map_err(Errors::from)?;\n\n \n let item = match item {\n syn::Item::Struct(item) => item,\n _ => return Err(Errors::message(\"import must be used on a struct.\")),\n };\n\n let visibility = {\n let vis = item.vis;\n format!(\"{}\", quote! { #vis })\n };\n let struct_name = item.ident.to_string();\n\n let candid_str = std::fs::read_to_string(&candid_path).unwrap();\n let prog = candid::IDLProg::from_str(&candid_str)\n .map_err(|e| Errors::message(format!(\"Could not parse the candid file: {}\", e)))?;\n\n let bindings = Box::new(RustLanguageBinding {\n visibility,\n canister_id: canister_id.clone(),\n });\n\n let config = candid::codegen::rust::Config::default()\n .with_actor_name(struct_name)\n .with_biguint_type(\"candid::Nat\".to_string())\n .with_bigint_type(\"candid::Int\".to_string())\n .with_bindings(bindings);\n\n let rust_str =\n candid::codegen::idl_to_rust(&prog, &config).map_err(|e| Errors::message(e.to_string()))?;\n\n let rust_str = format!(\"{} {}\", \"type principal = Vec<u8>;\", rust_str);\n\n Ok(proc_macro::TokenStream::from_str(&rust_str).unwrap())\n}\n"},"prefix":{"kind":"string","value":"use crate::error::Errors;\nuse quote::quote;\nuse serde::Deserialize;\nuse serde_tokenstream::from_tokenstream;\nuse std::path::PathBuf;\nuse std::str::FromStr;\n\n#[derive(Default, Deserialize)]\nstruct ImportAttributes {\n pub canister: Option<String>,\n pub canister_id: Option<String>,\n pub candid_path: Option<PathBuf>,\n}\n\n"},"suffix":{"kind":"string","value":"\n\nstruct RustLanguageBinding {\n visibility: String,\n canister_id: String,\n}\n\nimpl candid::codegen::rust::RustBindings for RustLanguageBinding {\n fn record(\n &self,\n id: &str,\n fields: &[(String, String)],\n ) -> Result<String, candid::error::Error> {\n let all_fields = fields\n .iter()\n .map(|(name, ty)| format!(\"pub {} : {}\", name, ty))\n .collect::<Vec<String>>()\n .join(\" , \");\n Ok(format!(\n r#\"\n #[derive(Clone, Debug, Default, CandidType, serde::Deserialize)]\n pub struct {} {{ {} }}\n \"#,\n id, all_fields\n ))\n }\n\n fn actor(&self, name: &str, all_functions: &[String]) -> Result<String, candid::error::Error> {\n let mut all_functions_str = String::new();\n for f in all_functions {\n all_functions_str += f;\n }\n\n Ok(format!(\n r#\"{vis} struct {name} {{ }}\n impl {name} {{\n {functions}\n }}\"#,\n vis = self.visibility,\n name = name,\n functions = all_functions_str\n ))\n }\n\n fn actor_function_body(\n &self,\n name: &str,\n arguments: &[(String, String)],\n return_type: &str,\n _is_query: bool,\n ) -> Result<String, candid::error::Error> {\n let canister_id = &self.canister_id;\n\n let arguments = if arguments.is_empty() {\n \"Option::<()>::None\".to_string()\n } else if arguments.len() == 1 {\n format!(\"Some({})\", arguments[0].0)\n } else {\n format!(\n \"Some(({}))\",\n arguments\n .iter()\n .map(|(name, _)| name.clone())\n .collect::<Vec<String>>()\n .join(\",\")\n )\n };\n\n let call = if return_type.is_empty() {\n \"ic_cdk::call_no_return\"\n } else {\n \"ic_cdk::call\"\n };\n\n Ok(format!(\n r#\"\n {{\n {call}(\n ic_cdk::CanisterId::from_str(\"{canister_id}\").unwrap(),\n \"{name}\",\n {arguments}\n )\n .await\n .unwrap()\n }}\n \"#,\n call = call,\n canister_id = canister_id,\n name = name.escape_debug(),\n arguments = arguments,\n ))\n }\n\n fn actor_function(\n &self,\n name: &str,\n arguments: &[(String, String)],\n returns: &[String],\n is_query: bool,\n ) -> Result<String, candid::error::Error> {\n let id = candid::codegen::rust::candid_id_to_rust(name);\n\n \n let return_type = if returns.is_empty() {\n \"\".to_string()\n } else if returns.len() == 1 {\n returns[0].clone()\n } else {\n format!(\"( {} )\", returns.join(\" , \"))\n };\n\n let arguments_list = arguments\n .iter()\n .map(|(name, ty)| format!(\"{} : {}\", name, ty))\n .collect::<Vec<String>>()\n .join(\" , \");\n\n let body = self.actor_function_body(name, arguments, &return_type, is_query)?;\n\n Ok(format!(\n \"async fn {id}( {arguments} ) {return_type} {body}\",\n id = id,\n arguments = arguments_list,\n body = body,\n return_type = if return_type == \"\" {\n format!(\"\")\n } else {\n format!(\" -> {}\", return_type)\n }\n ))\n }\n}\n\npub(crate) fn ic_import(\n attr: proc_macro::TokenStream,\n item: proc_macro::TokenStream,\n) -> Result<proc_macro::TokenStream, Errors> {\n let config = match from_tokenstream::<ImportAttributes>(&proc_macro2::TokenStream::from(attr)) {\n Ok(c) => c,\n Err(err) => return Err(Errors::message(format!(\"{}\", err.to_compile_error()))),\n };\n\n \n let (canister_id, candid_path) = {\n if let Some(canister_name) = config.canister {\n get_env_id_and_candid(&canister_name)?\n } else if let Some(canister_id) = config.canister_id {\n if let Some(candid_path) = config.candid_path {\n (canister_id, candid_path)\n } else {\n return Err(Errors::message(\"Must specify both candid and canister_id.\"));\n }\n } else {\n return Err(Errors::message(\"Must specify both candid and canister_id.\"));\n }\n };\n\n let item =\n syn::parse2::<syn::Item>(proc_macro2::TokenStream::from(item)).map_err(Errors::from)?;\n\n \n let item = match item {\n syn::Item::Struct(item) => item,\n _ => return Err(Errors::message(\"import must be used on a struct.\")),\n };\n\n let visibility = {\n let vis = item.vis;\n format!(\"{}\", quote! { #vis })\n };\n let struct_name = item.ident.to_string();\n\n let candid_str = std::fs::read_to_string(&candid_path).unwrap();\n let prog = candid::IDLProg::from_str(&candid_str)\n .map_err(|e| Errors::message(format!(\"Could not parse the candid file: {}\", e)))?;\n\n let bindings = Box::new(RustLanguageBinding {\n visibility,\n canister_id: canister_id.clone(),\n });\n\n let config = candid::codegen::rust::Config::default()\n .with_actor_name(struct_name)\n .with_biguint_type(\"candid::Nat\".to_string())\n .with_bigint_type(\"candid::Int\".to_string())\n .with_bindings(bindings);\n\n let rust_str =\n candid::codegen::idl_to_rust(&prog, &config).map_err(|e| Errors::message(e.to_string()))?;\n\n let rust_str = format!(\"{} {}\", \"type principal = Vec<u8>;\", rust_str);\n\n Ok(proc_macro::TokenStream::from_str(&rust_str).unwrap())\n}\n"},"middle":{"kind":"string","value":"fn get_env_id_and_candid(canister_name: &str) -> Result<(String, PathBuf), Errors> {\n let canister_id_var_name = format!(\"CANISTER_ID_{}\", canister_name);\n let candid_path_var_name = format!(\"CANISTER_CANDID_{}\", canister_name);\n\n Ok((\n std::env::var(canister_id_var_name).map_err(|_| {\n Errors::message(&format!(\n \"Could not find DFX bindings for canister named '{}'. Did you build using DFX?\",\n canister_name\n ))\n })?,\n std::env::var_os(candid_path_var_name)\n .ok_or_else(|| Errors::message(\"Could not find DFX bindings.\"))\n .map(|p| PathBuf::from(p))?,\n ))\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[derive(CandidType, serde::Deserialize, Debug)]\n\nstruct CanisterIdRecord {\n\n canister_id: candid::Principal,\n\n}\n\n\n\npub async fn subnet_create_new_canister() -> Result<CanisterId, String> {\n\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\n\n let new_can_id_record: CanisterIdRecord =\n\n match ic_cdk::call(management_canister, \"create_canister\", Some(())).await {\n\n Ok(res) => res,\n\n Err(err) => {\n\n ic_cdk::println!(\"Error invoking create_canister: {:?} {}\", err.0, err.1);\n\n return Err(err.1);\n\n }\n\n };\n\n\n\n let new_can_id = CanisterId::from(new_can_id_record.canister_id.as_slice());\n\n Ok(new_can_id)\n\n}\n\n\n\nuse serde::{Deserialize, Serialize};\n","file_path":"src/canister_management.rs","rank":0,"score":99287.38771718356},{"content":"#[derive(Copy, Clone, Default, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\nstruct CanisterPtr(u32);\n\npub type DetHashSet<K> = HashSet<K, BuildHasherDefault<WyHash>>;\n\npub type DetHashMap<K, V> = HashMap<K, V, BuildHasherDefault<WyHash>>;\n\n\n","file_path":"src/index.rs","rank":1,"score":88478.53263966288},{"content":"/// Returns the canister id as a blob.\n\npub fn id() -> CanisterId {\n\n let len: u32 = unsafe { ic0::canister_self_size() };\n\n let mut bytes = vec![0; len as usize];\n\n unsafe {\n\n ic0::canister_self_copy(bytes.as_mut_ptr() as u32, 0, len);\n\n }\n\n CanisterId(bytes)\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":2,"score":80186.14815992407},{"content":"pub fn to_input<Input: DeserializeOwned>(inp: Vec<u8>) -> Input {\n\n let mut d = IDLDeserialize::new(&inp).unwrap();\n\n let v = d.get_value().unwrap();\n\n d.done().unwrap();\n\n v\n\n}\n\n\n","file_path":"src/dfn_candid.rs","rank":3,"score":63344.717073733926},{"content":"#[derive(Default)]\n\nstruct TermData {\n\n frequency: usize,\n\n inverted_index: RoaringBitmap,\n\n}\n\n\n\npub struct SearchIndexer {\n\n key_to_doc_id: DetHashMap<Key, DocumentId>,\n\n doc_id_to_key: DetHashMap<DocumentId, Key>,\n\n terms: DetHashMap<Term, TermData>,\n\n stemmer: Stemmer,\n\n}\n\n\n\nimpl Default for SearchIndexer {\n\n fn default() -> Self {\n\n Self {\n\n key_to_doc_id: DetHashMap::default(),\n\n doc_id_to_key: DetHashMap::default(),\n\n terms: DetHashMap::default(),\n\n stemmer: Stemmer::create(Algorithm::English),\n\n }\n","file_path":"src/search.rs","rank":4,"score":61560.892788827776},{"content":"/// Calls another canister and executes one of the callbacks.\n\npub fn call_with_callbacks(\n\n id: CanisterId,\n\n method: &str,\n\n data: &[u8],\n\n reply: impl FnOnce() + 'static,\n\n reject: impl FnOnce() + 'static,\n\n) -> i32 {\n\n type Closures = (Box<dyn FnOnce() + 'static>, Box<dyn FnOnce() + 'static>);\n\n fn on_reply(env: u32) {\n\n let closure = unsafe { Box::from_raw(env as *mut Closures) }.0;\n\n closure();\n\n }\n\n fn on_reject(env: u32) {\n\n let closure = unsafe { Box::from_raw(env as *mut Closures) }.1;\n\n closure();\n\n }\n\n let callee = id.0;\n\n let boxed_closures: Box<Closures> = Box::new((Box::new(reply), Box::new(reject)));\n\n let env = Box::into_raw(boxed_closures);\n\n\n","file_path":"src/dfn_core.rs","rank":5,"score":54442.48586923211},{"content":"/// Calls another canister and returns a future.\n\npub fn call(id: CanisterId, method: &str, data: &[u8]) -> impl Future<Output = FutureResult> {\n\n // the callback from IC dereferences the future from a raw pointer, assigns the\n\n // result and calls the waker\n\n fn callback(future_ptr: u32) {\n\n let waker = {\n\n let ref_counted =\n\n unsafe { RefCounted::from_raw(future_ptr as *const RefCell<CallFuture>) };\n\n let mut future = ref_counted.borrow_mut();\n\n future.result = Some(match reject_code() {\n\n 0 => Ok(arg_data()),\n\n n => Err((n, reject_message())),\n\n });\n\n future.waker.clone()\n\n };\n\n waker.expect(\"there is a waker\").wake();\n\n };\n\n let callee = id.0;\n\n let future_for_closure = RefCounted::new(CallFuture::new());\n\n let future = future_for_closure.clone();\n\n let future_ptr = future_for_closure.into_raw();\n","file_path":"src/dfn_core.rs","rank":6,"score":53303.998411702974},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrUsedBytes = Box<dyn Fn(CanisterId) -> usize>;\n","file_path":"src/index.rs","rank":7,"score":50520.909770471524},{"content":"/// Returns the rejection code.\n\npub fn reject_code() -> i32 {\n\n unsafe { ic0::msg_reject_code() }\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":8,"score":50418.38028017041},{"content":"/// Returns the rejection message.\n\npub fn reject_message() -> String {\n\n let len: u32 = unsafe { ic0::msg_reject_msg_size() };\n\n let mut bytes = vec![0; len as usize];\n\n unsafe {\n\n ic0::msg_reject_msg_copy(bytes.as_mut_ptr() as u32, 0, len);\n\n }\n\n String::from_utf8_lossy(&bytes).to_string()\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":9,"score":50418.38028017041},{"content":"/// Replies with the given byte array.\n\n/// Note, currently we do not support chunkwise assemlbing of the response.\n\npub fn reply(payload: &[u8]) {\n\n unsafe {\n\n ic0::msg_reply_data_append(payload.as_ptr() as u32, payload.len() as u32);\n\n ic0::msg_reply();\n\n }\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":10,"score":48172.10060543954},{"content":"/// Returns the caller of the current call.\n\npub fn caller() -> Vec<u8> {\n\n let len: u32 = unsafe { ic0::msg_caller_size() };\n\n let mut bytes = vec![0; len as usize];\n\n unsafe {\n\n ic0::msg_caller_copy(bytes.as_mut_ptr() as u32, 0, len);\n\n }\n\n bytes\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":11,"score":48172.10060543954},{"content":"pub trait OverCandid<Arguments, Output> {\n\n fn over_candid(self, _: IDLDeserialize<'_>) -> Vec<u8>;\n\n}\n\n\n\nimpl<C: CandidType, F: FnOnce() -> C> OverCandid<(), C> for F {\n\n fn over_candid(self, _: IDLDeserialize<'_>) -> Vec<u8> {\n\n from_output(self())\n\n }\n\n}\n\n\n\nimpl<A1: DeserializeOwned, C: CandidType, F: FnOnce(A1) -> C> OverCandid<(A1,), C> for F {\n\n fn over_candid(self, d: IDLDeserialize<'_>) -> Vec<u8> {\n\n let ((a1,), _) = extract_arg_1(d);\n\n from_output(self(a1))\n\n }\n\n}\n\n\n\nimpl<A1: DeserializeOwned, A2: DeserializeOwned, C: CandidType, F: FnOnce(A1, A2) -> C>\n\n OverCandid<(A1, A2), C> for F\n\n{\n","file_path":"src/dfn_candid.rs","rank":12,"score":48172.10060543954},{"content":"/// Traps with the given message.\n\npub fn trap_with(message: &str) {\n\n unsafe {\n\n ic0::trap(message.as_ptr() as u32, message.len() as u32);\n\n }\n\n}\n\n\n\n// This module contains all mechanisms required to enable asynchronous\n\n// programming in Rust, based on native async Rust capabilities:\n\n//\n\n// - the future returned by the asynchronous System API call, and\n\n// - the kickstarting/waker implementations to advance top level futures on\n\n// every inter-canister callback call.\n\n\n\nuse std::{\n\n cell::RefMut,\n\n pin::Pin,\n\n rc::Rc,\n\n task::{Context, Poll, Waker},\n\n};\n\n\n","file_path":"src/dfn_core.rs","rank":13,"score":48172.10060543954},{"content":"/// Returns the argument extracted from the message payload.\n\npub fn arg_data() -> Vec<u8> {\n\n let len: u32 = unsafe { ic0::msg_arg_data_size() };\n\n let mut bytes = vec![0; len as usize];\n\n unsafe {\n\n ic0::msg_arg_data_copy(bytes.as_mut_ptr() as u32, 0, len);\n\n }\n\n bytes\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":14,"score":47107.513946503575},{"content":"/// Rejects the current call with the given message.\n\npub fn reject(err_message: &str) {\n\n let err_message = err_message.as_bytes();\n\n unsafe {\n\n ic0::msg_reject(err_message.as_ptr() as u32, err_message.len() as u32);\n\n }\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":15,"score":47107.513946503575},{"content":"pub fn biguint_to_sha256_digest(bigint: &BigUint) -> Sha256Digest {\n\n let mut key = bigint.to_radix_be(256);\n\n key.resize(32, 0);\n\n *Sha256Digest::from_slice(&key)\n\n}\n\n\n\nuse lazy_static::lazy_static;\n\n\n\nlazy_static! {\n\n pub static ref SHA256_DIGEST_MIN: Sha256Digest = biguint_to_sha256_digest(&BigUint::from(0u64));\n\n pub static ref SHA256_DIGEST_MAX: Sha256Digest =\n\n biguint_to_sha256_digest(&BigUint::parse_bytes(b\"f\".repeat(64).as_slice(), 16).unwrap());\n\n}\n\n\n\npub(crate) fn sha256_range_half(\n\n sha256_lower: &Sha256Digest,\n\n sha256_upper: &Sha256Digest,\n\n) -> Sha256Digest {\n\n let i_prev = biguint_from_slice256(sha256_lower.as_slice());\n\n let i = biguint_from_slice256(sha256_upper.as_slice());\n","file_path":"src/hashring_sha256.rs","rank":16,"score":41709.769927113986},{"content":"pub fn sha256_digest_to_biguint(val: Sha256Digest) -> BigUint {\n\n biguint_from_slice256(val.as_slice())\n\n}\n\n\n","file_path":"src/hashring_sha256.rs","rank":17,"score":41709.769927113986},{"content":"fn extract_arg_3<A1: DeserializeOwned, A2: DeserializeOwned, A3: DeserializeOwned>(\n\n de: IDLDeserialize<'_>,\n\n) -> ((A1, A2, A3), IDLDeserialize<'_>) {\n\n let ((a1, a2), mut de) = extract_arg_2(de);\n\n let a_new = de.get_value().unwrap();\n\n ((a1, a2, a_new), de)\n\n}\n\n\n","file_path":"src/dfn_candid.rs","rank":18,"score":39508.703349400836},{"content":"fn extract_arg_1<A1: DeserializeOwned>(mut de: IDLDeserialize<'_>) -> ((A1,), IDLDeserialize<'_>) {\n\n let a1 = de.get_value().unwrap();\n\n ((a1,), de)\n\n}\n\n\n","file_path":"src/dfn_candid.rs","rank":19,"score":38879.65911159082},{"content":"/// Must be called on every top-level future corresponding to a method call of a\n\n/// canister by the IC.\n\n///\n\n/// Saves the pointer to the future on the heap and kickstarts the future by\n\n/// polling it once. During the polling we also need to provide the waker\n\n/// callback which is triggered after the future made progress. The waker would\n\n/// then. The waker would then poll the future one last time to advance it to\n\n/// the final state. For that, we pass the future pointer to the waker, so that\n\n/// it can be restored into a box from a raw pointer and then dropped if not\n\n/// needed anymore.\n\n///\n\n/// Technically, we store 2 pointers on the heap: the pointer to the future\n\n/// itself, and a pointer to that pointer. The reason for this is that the waker\n\n/// API requires us to pass one thin pointer, while a a pointer to a `dyn Trait`\n\n/// can only be fat. So we create one additional thin pointer, pointing to the\n\n/// fat pointer and pass it instead.\n\npub fn kickstart<F: 'static + Future<Output = ()>>(future: F) {\n\n let future_ptr = Box::into_raw(Box::new(future));\n\n let future_ptr_ptr: *mut *mut dyn Future<Output = ()> = Box::into_raw(Box::new(future_ptr));\n\n let mut pinned_future = unsafe { Pin::new_unchecked(&mut *future_ptr) };\n\n if let Poll::Ready(_) = pinned_future\n\n .as_mut()\n\n .poll(&mut Context::from_waker(&waker::waker(\n\n future_ptr_ptr as *const (),\n\n )))\n\n {\n\n unsafe {\n\n let _ = Box::from_raw(future_ptr);\n\n let _ = Box::from_raw(future_ptr_ptr);\n\n }\n\n }\n\n}\n\n\n\n// This module conatins the implementation of a waker we're using for waking\n\n// top-level futures (the ones returned by canister methods). The waker polls\n\n// the future once and re-pins it on the heap, if it's pending. If the future is\n","file_path":"src/dfn_core.rs","rank":20,"score":38757.2230849286},{"content":"/// Must be called on every top-level future corresponding to a method call of a\n\n/// canister by the IC.\n\n///\n\n/// Saves the pointer to the future on the heap and kickstarts the future by\n\n/// polling it once. During the polling we also need to provide the waker\n\n/// callback which is triggered after the future made progress. The waker would\n\n/// then. The waker would then poll the future one last time to advance it to\n\n/// the final state. For that, we pass the future pointer to the waker, so that\n\n/// it can be restored into a box from a raw pointer and then dropped if not\n\n/// needed anymore.\n\n///\n\n/// Technically, we store 2 pointers on the heap: the pointer to the future\n\n/// itself, and a pointer to that pointer. The reason for this is that the waker\n\n/// API requires us to pass one thin pointer, while a a pointer to a `dyn Trait`\n\n/// can only be fat. So we create one additional thin pointer, pointing to the\n\n/// fat pointer and pass it instead.\n\npub fn kickstart<F: 'static + Future<Output = ()>>(future: F) {\n\n let future_ptr = Box::into_raw(Box::new(future));\n\n let future_ptr_ptr: *mut *mut dyn Future<Output = ()> = Box::into_raw(Box::new(future_ptr));\n\n let mut pinned_future = unsafe { Pin::new_unchecked(&mut *future_ptr) };\n\n if let Poll::Ready(_) = pinned_future\n\n .as_mut()\n\n .poll(&mut Context::from_waker(&waker::waker(\n\n future_ptr_ptr as *const (),\n\n )))\n\n {\n\n unsafe {\n\n let _ = Box::from_raw(future_ptr);\n\n let _ = Box::from_raw(future_ptr_ptr);\n\n }\n\n }\n\n}\n\n\n\n// This module conatins the implementation of a waker we're using for waking\n\n// top-level futures (the ones returned by canister methods). The waker polls\n\n// the future once and re-pins it on the heap, if it's pending. If the future is\n","file_path":"src/dfn_futures.rs","rank":21,"score":38757.2230849286},{"content":"pub fn from_output<Output: CandidType>(payload: Output) -> Vec<u8> {\n\n candid::ser::IDLBuilder::new()\n\n .arg(&payload)\n\n .unwrap()\n\n .serialize_to_vec()\n\n .unwrap()\n\n}\n\n\n","file_path":"src/dfn_candid.rs","rank":22,"score":37943.922055183255},{"content":"/// This allows you to wrap regular rust functions and have them take and return\n\n/// candid\n\n/// Currently it will only return one argument\n\npub fn candid<A, O, F: OverCandid<A, O>>(f: F) {\n\n dfn_core::bytes(|bs| {\n\n let de = candid::de::IDLDeserialize::new(&bs).unwrap();\n\n f.over_candid(de)\n\n })\n\n}\n\n\n\n// TODO turn this into a trait with call_json, unless the type complexity is\n\n// more trouble than it's worth\n\npub async fn call_candid<Input: DeserializeOwned, Output: CandidType>(\n\n canister_id: Vec<u8>,\n\n method_name: &str,\n\n payload: Output,\n\n) -> Result<Input, (i32, String)> {\n\n let result = dfn_core::call(\n\n dfn_core::CanisterId(canister_id),\n\n method_name,\n\n &from_output(payload),\n\n )\n\n .await;\n\n result.map(to_input)\n\n}\n","file_path":"src/dfn_candid.rs","rank":23,"score":37939.07176137015},{"content":"/// Prints the given message.\n\npub fn print<S: std::convert::AsRef<str>>(s: S) {\n\n let s = s.as_ref();\n\n unsafe {\n\n ic0::debug_print(s.as_ptr() as u32, s.len() as u32);\n\n }\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":24,"score":37855.05628571828},{"content":"/// Useful for writing endpoints that take a set of bytes and return a set of\n\n/// bytes Check test/reverse_blob_bin.rs for a usage example\n\npub fn bytes<F: FnOnce(Vec<u8>) -> Vec<u8>>(f: F) {\n\n let bs = arg_data();\n\n let res = f(bs);\n\n reply(&res);\n\n}\n","file_path":"src/dfn_core.rs","rank":25,"score":36264.916127476456},{"content":"fn extract_arg_2<A1: DeserializeOwned, A2: DeserializeOwned>(\n\n de: IDLDeserialize<'_>,\n\n) -> ((A1, A2), IDLDeserialize<'_>) {\n\n let ((a1,), mut de) = extract_arg_1(de);\n\n let a_new = de.get_value().unwrap();\n\n ((a1, a_new), de)\n\n}\n\n\n","file_path":"src/dfn_candid.rs","rank":26,"score":36236.03731328285},{"content":"/// The mode with which a canister is installed.\n\n#[derive(Clone, Debug, Deserialize, PartialEq, Serialize, Eq, Hash, CandidType)]\n\npub enum CanisterInstallMode {\n\n /// A fresh install of a new canister.\n\n #[serde(rename = \"install\")]\n\n Install,\n\n /// Reinstalling a canister that was already installed.\n\n #[serde(rename = \"reinstall\")]\n\n Reinstall,\n\n /// Upgrade an existing canister.\n\n #[serde(rename = \"upgrade\")]\n\n Upgrade,\n\n}\n\n\n\n#[derive(CandidType, Deserialize, Debug)]\n\npub struct InstallCodeArgs {\n\n pub mode: CanisterInstallMode,\n\n pub canister_id: candid::Principal,\n\n pub wasm_module: Vec<u8>,\n\n pub arg: Vec<u8>,\n","file_path":"src/canister_management.rs","rank":27,"score":34941.36363173804},{"content":"use crate::CanisterId;\n\nuse candid::CandidType;\n\n\n\n#[derive(CandidType, serde::Deserialize, Debug)]\n","file_path":"src/canister_management.rs","rank":28,"score":34941.04682362181},{"content":" pub compute_allocation: Option<u64>,\n\n pub memory_allocation: Option<u64>,\n\n}\n\nuse std::convert::TryFrom;\n\n\n\npub async fn subnet_install_canister_code(\n\n canister_id: CanisterId,\n\n wasm_module: Vec<u8>,\n\n) -> Result<(), String> {\n\n if wasm_module.is_empty() {\n\n return Err(\"Empty wasm module provided for canister installation\".to_string());\n\n }\n\n\n\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\n\n\n\n let install_code_args = InstallCodeArgs {\n\n mode: CanisterInstallMode::Install,\n\n canister_id: candid::Principal::try_from(canister_id.0)\n\n .expect(\"Failed to make principal from canister_id\"),\n\n wasm_module,\n","file_path":"src/canister_management.rs","rank":29,"score":34939.71467090449},{"content":" arg: Vec::new(),\n\n compute_allocation: None,\n\n memory_allocation: None,\n\n };\n\n\n\n match ic_cdk::call_no_return(management_canister, \"install_code\", Some(install_code_args)).await\n\n {\n\n Ok(res) => res,\n\n Err(err) => {\n\n ic_cdk::println!(\"Error invoking install_code: {:?} {}\", err.0, err.1);\n\n return Err(err.1);\n\n }\n\n };\n\n\n\n Ok(())\n\n}\n\n\n\npub async fn subnet_raw_rand() -> Result<Vec<u8>, String> {\n\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\n\n let rnd_buffer: Vec<u8> = match ic_cdk::call(management_canister, \"raw_rand\", Some(())).await {\n","file_path":"src/canister_management.rs","rank":30,"score":34935.72693846325},{"content":" Ok(result) => result,\n\n Err(err) => {\n\n ic_cdk::println!(\"Error invoking raw_rand: {:?} {}\", err.0, err.1);\n\n return Err(err.1);\n\n }\n\n };\n\n\n\n Ok(rnd_buffer.to_vec())\n\n}\n","file_path":"src/canister_management.rs","rank":31,"score":34930.36736215424},{"content":"#[query]\n\nfn used_bytes() -> u64 {\n\n let search = storage::get::<SearchIndexer>();\n\n\n\n search.used_bytes() as u64\n\n}\n\n\n","file_path":"src/bigmap_search.rs","rank":32,"score":31252.303046017067},{"content":"#[query]\n\nfn used_bytes(_: ()) -> u64 {\n\n let bm_data = storage::get::<DataBucket>();\n\n\n\n bm_data.used_bytes() as u64\n\n}\n\n\n","file_path":"src/bigmap_data.rs","rank":33,"score":31252.303046017067},{"content":"#[update]\n\nfn set_used_bytes_threshold(threshold: u32) {\n\n let bigmap_idx = storage::get_mut::<BigmapIdx>();\n\n\n\n bigmap_idx.set_used_bytes_threshold(threshold);\n\n}\n\n\n\n#[update]\n\nasync fn maintenance() -> String {\n\n let bigmap_idx = storage::get_mut::<BigmapIdx>();\n\n\n\n bigmap_idx.maintenance().await\n\n}\n\n\n\n#[query]\n\nasync fn status() -> String {\n\n let bigmap_idx = storage::get::<BigmapIdx>();\n\n\n\n bigmap_idx.status().await\n\n}\n\n\n","file_path":"src/bigmap_index.rs","rank":34,"score":28024.35773679214},{"content":"const getCanister = (\n\n canisterName,\n\n host = DEFAULT_HOST,\n\n keypair = generateKeyPair()\n\n) => {\n\n const candid = eval(getCandid(canisterName));\n\n const canisterId = getCanisterId(canisterName);\n\n const principal = Principal.selfAuthenticating(keypair.publicKey);\n\n const config = { fetch, host, principal };\n\n if (credentials.name && credentials.password) {\n\n config.credentials = credentials;\n\n }\n\n const agent = new HttpAgent(config);\n\n agent.addTransform(makeNonceTransform());\n\n agent.addTransform(makeExpiryTransform(5 * 60 * 1000));\n\n agent.addTransform(makeAuthTransform(keypair));\n\n\n\n return makeActorFactory(candid)({ canisterId, agent });\n","file_path":"cli/bigmap_functions.js","rank":35,"score":27714.686949088544},{"content":"const DATA_CANISTER_ACTORS = new Map(); // A map of CanisterId => DataCanisterActor\n","file_path":"cli/bigmap_functions.js","rank":36,"score":26792.259480966884},{"content":"const getCanisterPath = (canisterName) => {\n\n return path.join(\n\n outputRoot,\n\n \"canisters\",\n\n canisterName\n\n );\n","file_path":"cli/bigmap_functions.js","rank":37,"score":26792.259480966884},{"content":"const getCanisterId = (canisterName) => {\n\n const canisterIdsPath = networkName === 'local' ? outputRoot : '.';\n\n let manifest = JSON.parse(\n\n fs.readFileSync(path.resolve(canisterIdsPath, 'canister_ids.json'))\n\n );\n\n return manifest[canisterName][networkName];\n","file_path":"cli/bigmap_functions.js","rank":38,"score":26792.259480966884},{"content":"const bigMapDataCanisterIdToActor = async (canisterId) => {\n\n let cacheLookup = DATA_CANISTER_ACTORS.get(canisterId);\n\n if (cacheLookup) {\n\n return cacheLookup;\n\n } else {\n\n let canisterActor = getBigMapDataActor(canisterId);\n\n DATA_CANISTER_ACTORS.set(canisterId, canisterActor);\n\n return canisterActor;\n\n }\n","file_path":"cli/bigmap_functions.js","rank":39,"score":24364.036174616827},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrHoldsKey = Box<dyn Fn(CanisterId, &Key) -> bool>;\n","file_path":"src/index.rs","rank":40,"score":24359.944581127264},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrList = Box<dyn Fn(CanisterId, &Key) -> Vec<Key>>;\n","file_path":"src/index.rs","rank":41,"score":24359.944581127264},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrRemoveFromSearchIndex = Box<dyn Fn(CanisterId, &Key)>;\n","file_path":"src/index.rs","rank":42,"score":24359.944581127264},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrAddToSearchIndex = Box<dyn Fn(CanisterId, &Key, &String)>;\n","file_path":"src/index.rs","rank":43,"score":23644.43069524631},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrDeleteEntries = Box<dyn Fn(CanisterId, &Vec<Vec<u8>>)>;\n\n\n\n#[derive(Default)]\n\npub struct BigmapIdx {\n\n idx: Vec<CanisterId>, // indirection for CanisterId, to avoid many copies of CanisterIds\n\n hash_ring: hashring_sha256::HashRing<CanisterPtr>,\n\n now_rebalancing_src_dst: Option<(CanisterPtr, CanisterPtr)>,\n\n is_maintenance_active: bool,\n\n creating_data_canister: bool,\n\n creating_search_canister: bool,\n\n batch_limit_bytes: u64,\n\n canister_available_queue: VecDeque<CanisterId>,\n\n used_bytes_threshold: u32,\n\n used_bytes_total: u64,\n\n search_canisters: Vec<CanisterId>,\n\n data_bucket_canister_wasm_binary: Vec<u8>,\n\n search_canister_wasm_binary: Vec<u8>,\n\n id: CanisterId,\n\n // Testing functions\n\n #[cfg(not(target_arch = \"wasm32\"))]\n","file_path":"src/index.rs","rank":44,"score":23644.43069524631},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrSearchKeysByQuery = Box<dyn Fn(CanisterId, &String) -> Vec<Key>>;\n","file_path":"src/index.rs","rank":45,"score":22969.750369522342},{"content":"type DataBucketMap = Arc<RwLock<IndexMap<CanisterId, DataBucket>>>;\n\n\n\n#[actix_rt::test]\n\nasync fn bigmap_put_get() {\n\n // Insert key&value pairs and then get the value, and verify the correctness\n\n\n\n let num_data_canisters_initial = 11;\n\n\n\n let (mut bm_idx, db_map) = alloc_bigmap_index_and_data(num_data_canisters_initial).await;\n\n\n\n bm_idx.maintenance().await;\n\n\n\n for i in 0..1001 {\n\n let key = format!(\"key-{}\", i).into_bytes();\n\n let value = vec![(i % 256) as u8; 200_000];\n\n\n\n let can_data_id = bm_idx.lookup_put(&key).unwrap();\n\n assert_ne!(can_data_id, Default::default());\n\n db_map\n\n .write()\n","file_path":"src/index/tests.rs","rank":46,"score":22969.750369522342},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrSetRange = Box<dyn Fn(CanisterId, Sha256Digest, Sha256Digest)>;\n","file_path":"src/index.rs","rank":47,"score":22969.750369522342},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrBatchAddToSearchIndex = Box<dyn Fn(CanisterId, &Vec<(Key, String)>) -> u64>;\n","file_path":"src/index.rs","rank":48,"score":21729.663305807844},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrPutRelocationBatch = Box<dyn Fn(CanisterId, &Vec<(Sha2Vec, Key, Val)>) -> u64>;\n","file_path":"src/index.rs","rank":49,"score":21158.512186873566},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\ntype FnPtrGetRelocationBatch = Box<dyn Fn(CanisterId, u64) -> Vec<(Sha2Vec, Key, Val)>>;\n","file_path":"src/index.rs","rank":50,"score":21158.512186873566},{"content":"// pub type CanisterId = u64;\n\nuse crate::data::DataBucket;\n\nuse crate::index::BigmapIdx;\n\nuse serde::{Deserialize, Serialize};\n\nuse std::convert::From;\n\n\n\n#[derive(Clone, Default, Hash, Serialize, Deserialize, candid::CandidType, Eq, PartialEq)]\n\n#[repr(transparent)]\n\npub struct CanisterId(pub Vec<u8>);\n\n\n\nimpl From<DataBucket> for CanisterId {\n\n fn from(item: DataBucket) -> Self {\n\n Self {\n\n 0: item.canister_id().0,\n\n }\n\n }\n\n}\n\n\n\nimpl From<u64> for CanisterId {\n\n fn from(item: u64) -> Self {\n","file_path":"src/lib_native.rs","rank":51,"score":14.097668457289203},{"content":"// pub type CanisterId = Vec<u8>;\n\nuse crate::data::DataBucket;\n\nuse crate::index::BigmapIdx;\n\nuse serde::{Deserialize, Serialize};\n\nuse std::convert::From;\n\n\n\n#[derive(Clone, Default, Hash, Serialize, Deserialize, candid::CandidType, Eq, PartialEq)]\n\n#[repr(transparent)]\n\npub struct CanisterId(pub Vec<u8>);\n\n\n\nimpl From<DataBucket> for CanisterId {\n\n fn from(item: DataBucket) -> Self {\n\n Self {\n\n 0: item.canister_id().0,\n\n }\n\n }\n\n}\n\n\n\nimpl From<BigmapIdx> for CanisterId {\n\n fn from(item: BigmapIdx) -> Self {\n","file_path":"src/lib_wasm32.rs","rank":52,"score":13.91946524104262},{"content":"\n\n let hr_idx = self\n\n .hash_ring\n\n .get_idx_key_node_for_node(&ptr_new)\n\n .unwrap()\n\n .0;\n\n self.hash_ring.get_key_range_for_idx(hr_idx)\n\n }\n\n\n\n pub fn set_used_bytes_threshold(&mut self, used_bytes_threshold: u32) {\n\n self.used_bytes_threshold = used_bytes_threshold;\n\n }\n\n\n\n pub fn set_canister_id(&mut self, can_id: CanisterId) {\n\n self.id = can_id\n\n }\n\n\n\n pub fn canister_id(&self) -> CanisterId {\n\n self.id.clone()\n\n }\n","file_path":"src/index.rs","rank":53,"score":11.041675890628616},{"content":"mod canister_management;\n\npub use canister_management::{\n\n subnet_create_new_canister, subnet_install_canister_code, subnet_raw_rand,\n\n};\n\n\n\n#[cfg(not(target_arch = \"wasm32\"))]\n\nmod lib_native;\n\n#[cfg(not(target_arch = \"wasm32\"))]\n\npub use lib_native::*;\n\n\n\npub type Key = Vec<u8>;\n\npub type Val = Vec<u8>;\n\npub type Sha2Vec = Vec<u8>;\n\n\n\npub type Sha256Digest = GenericArray<u8, <Sha256 as Digest>::OutputSize>;\n\n\n","file_path":"src/lib.rs","rank":54,"score":10.869855589151026},{"content":" pub fn used_bytes(&self) -> usize {\n\n // We use DataBucket with BTreeMap, and the size is precalculated\n\n // For DataBucket configuration with HashMap, usage can be calculated as:\n\n // (key_size + value_size + 8) bytes * 1.1\n\n // https://github.com/servo/servo/issues/6908\n\n self.used_bytes\n\n }\n\n\n\n pub fn canister_id(&self) -> CanisterId {\n\n self.id.clone()\n\n }\n\n\n\n pub fn set_canister_id(&mut self, can_id: CanisterId) {\n\n self.id = can_id\n\n }\n\n\n\n pub fn get_key_hash_range(&self) -> Option<(Sha256Digest, Sha256Digest)> {\n\n match (self.entries.keys().min(), self.entries.keys().max()) {\n\n (Some(min), Some(max)) => Some((*min, *max)),\n\n _ => None,\n","file_path":"src/data.rs","rank":55,"score":10.23702809853589},{"content":"\n\n for can_id in self.search_canisters.iter() {\n\n let used_bytes = self.qcall_canister_used_bytes(can_id).await as u32;\n\n self.used_bytes_total += used_bytes as u64;\n\n }\n\n\n\n println!(\"Total capacity used {}\", ByteSize(self.used_bytes_total));\n\n\n\n self.is_maintenance_active = false;\n\n\n\n serde_json_wasm::to_string(&Status {\n\n status: \"Good\",\n\n message: \"Finished maintenance\",\n\n })\n\n .unwrap()\n\n }\n\n\n\n pub async fn status(&self) -> String {\n\n #[derive(serde::Serialize, Default)]\n\n struct DataBucketStatus {\n","file_path":"src/index.rs","rank":56,"score":9.260298260637123},{"content":"use crate::{calc_sha256, sha256_digest_from_vec, CanisterId, Key, Sha256Digest, Sha2Vec, Val};\n\n#[cfg(target_arch = \"wasm32\")]\n\nuse ic_cdk::println;\n\nuse std::collections::BTreeMap;\n\n// use std::hash::{BuildHasherDefault, Hash, Hasher};\n\n// use wyhash::WyHash;\n\n\n\n// pub type DetHashMap<K, V> = HashMap<K, V, BuildHasherDefault<WyHash>>;\n\n\n\n#[derive(Clone, Debug, Default)]\n\npub struct DataBucket {\n\n pub entries: BTreeMap<Sha256Digest, (Key, Val)>, // Can be DetHashMap\n\n range_start: Sha256Digest, // This DataBucket holds entries\n\n range_end: Sha256Digest, // in [range_start..range_end]\n\n used_bytes: usize,\n\n bytes_to_send: usize,\n\n id: CanisterId,\n\n}\n\n\n\n#[allow(dead_code)]\n","file_path":"src/data.rs","rank":57,"score":8.81740889303152},{"content":" | Canister | +------->---------------+\n\n +-------+-------+ | +--------------+\n\n ^ | | BigMap Data |\n\n | +------->+ Bucket Can. |\n\n | | +--------------+\n\n +-------+-------+ | +--------------+\n\n | BigMap client +---------+--------+ BigMap Data |\n\n | App Canister | | Bucket Can. |\n\n +---------------+ +--------------+\n\n .\n\n .\n\n .\n\n\n\n********************************************************************/\n\n\n\n#[cfg(target_arch = \"wasm32\")]\n\nmod lib_wasm32;\n\n#[cfg(target_arch = \"wasm32\")]\n\npub use lib_wasm32::*;\n\n\n","file_path":"src/lib.rs","rank":58,"score":8.757752914151155},{"content":"use crate::dfn_core;\n\nuse candid::de::IDLDeserialize;\n\nuse candid::CandidType;\n\nuse serde::de::DeserializeOwned;\n\n\n","file_path":"src/dfn_candid.rs","rank":59,"score":8.674267525782042},{"content":" println!(\"Error adding canisters: {}\", err);\n\n }\n\n }\n\n\n\n fn print_canister_utilization(&self, can_id: &CanisterId, used_bytes: u64) {\n\n println!(\n\n \"CanisterId {} used {}\",\n\n can_id.clone(),\n\n ByteSize(used_bytes)\n\n );\n\n }\n\n\n\n // Returns a randomly generated and unused key\n\n pub async fn get_random_key(&self) -> String {\n\n let time_bytes = ic_cdk::time().to_be_bytes();\n\n let mut rand_key = calc_sha256(&time_bytes.to_vec());\n\n for i in 0..100u32 {\n\n // Only try this a limited number of times\n\n let rand_key_hash = calc_sha256(&rand_key);\n\n let (_, can_ptr) = match self.hash_ring.get_idx_node_for_key(&rand_key_hash) {\n","file_path":"src/index.rs","rank":60,"score":8.493807813095419},{"content":"// Load the allocator\n\ncfg_if::cfg_if! {\n\n // When the `wee_alloc` feature is enabled, use `wee_alloc` as the global\n\n // allocator.\n\n if #[cfg(feature = \"wee_alloc\")] {\n\n use wee_alloc;\n\n #[global_allocator]\n\n static ALLOC: wee_alloc::WeeAlloc<'_> = wee_alloc::WeeAlloc::INIT;\n\n }\n\n}\n\n\n\n// use futures::{CallFuture, RefCounted};\n\nuse std::{cell::RefCell, future::Future};\n\n\n\n#[derive(PartialEq, Clone, Eq)]\n\n#[repr(transparent)]\n\npub struct CanisterId(pub Vec<u8>);\n\n\n\n#[allow(dead_code)]\n\n#[cfg(target_arch = \"wasm32\")]\n","file_path":"src/dfn_core.rs","rank":61,"score":8.40824401789871},{"content":" let used_bytes = self.qcall_canister_used_bytes(can_id).await as u32;\n\n status.data_buckets.push(DataBucketStatus {\n\n canister_id: can_id.to_string(),\n\n used_bytes,\n\n });\n\n status.used_bytes_total += used_bytes as u64;\n\n }\n\n\n\n for can_id in self.search_canisters.iter() {\n\n let used_bytes = self.qcall_canister_used_bytes(can_id).await as u32;\n\n status.search_canisters.push(SearchCanisterStatus {\n\n canister_id: can_id.to_string(),\n\n used_bytes,\n\n });\n\n status.used_bytes_total += used_bytes as u64;\n\n }\n\n\n\n serde_json_wasm::to_string(&status).unwrap()\n\n }\n\n\n","file_path":"src/index.rs","rank":62,"score":8.398953566083344},{"content":"\n\n self.print_canister_utilization(&can_id, used_bytes);\n\n\n\n if used_bytes as u32 > self.used_bytes_threshold {\n\n println!(\n\n \"BigMap Index: CanisterId {} used bytes {} is over threshold {}\",\n\n can_id, used_bytes, self.used_bytes_threshold\n\n );\n\n\n\n // This canister should be rebalanced. We'll do these steps:\n\n // - Create destination canister, to which half of the data from the source canister will go\n\n // - Move batches of objects from source canister to the destination canister\n\n // We're just starting to rebalance, create the destination canister\n\n let src_canister_ptr = can_ptr.clone();\n\n let src_canister = self.can_ptr_to_canister_id(&src_canister_ptr);\n\n let dst_canister = self\n\n .create_data_bucket_canister()\n\n .await\n\n .expect(\"create_data_bucket_canister failed\");\n\n\n","file_path":"src/index.rs","rank":63,"score":8.310365502134749},{"content":"/// A reference counter wrapper we use with the CallFuture.\n\n/// This is required, because the future we return from the `call` method can\n\n/// either have two owners (the callback closure and the canister runtime) if\n\n/// the underlying system call succeeded, or just one (the canister runtime) it\n\n/// the system call failed.\n\npub struct RefCounted<T>(Rc<RefCell<T>>);\n\n\n\nimpl<T> RefCounted<T> {\n\n pub fn new(val: T) -> Self {\n\n RefCounted(Rc::new(RefCell::new(val)))\n\n }\n\n pub fn into_raw(self) -> *const RefCell<T> {\n\n Rc::into_raw(self.0)\n\n }\n\n pub unsafe fn from_raw(ptr: *const RefCell<T>) -> Self {\n\n Self(Rc::from_raw(ptr))\n\n }\n\n pub fn borrow_mut(&self) -> RefMut<'_, T> {\n\n self.0.borrow_mut()\n\n }\n","file_path":"src/dfn_core.rs","rank":64,"score":7.947398159275512},{"content":" canister_id: String,\n\n used_bytes: u32,\n\n };\n\n\n\n #[derive(serde::Serialize, Default)]\n\n struct SearchCanisterStatus {\n\n canister_id: String,\n\n used_bytes: u32,\n\n };\n\n\n\n #[derive(serde::Serialize, Default)]\n\n struct Status {\n\n data_buckets: Vec<DataBucketStatus>,\n\n search_canisters: Vec<SearchCanisterStatus>,\n\n used_bytes_total: u64,\n\n };\n\n\n\n let mut status = Status::default();\n\n\n\n for can_id in self.idx.iter() {\n","file_path":"src/index.rs","rank":65,"score":7.6142607316905915},{"content":"use digest::generic_array::GenericArray;\n\nuse sha2::{Digest, Sha256};\n\npub mod data;\n\npub(crate) mod hashring;\n\n#[allow(dead_code)]\n\npub(crate) mod hashring_sha256;\n\npub mod index;\n\npub mod search;\n\n\n\n/********************************************************************\n\n ____ _ __ __\n\n + __ )(_) __ _ + \\/ + __ _ _ __\n\n | _ \\+ +/ _` + | +\\/+ |/ _` + '_ \\\n\n | +_) | | (_+ | | | | | (_+ | +_) +\n\n +____/+_+\\__, + +_+ +_+\\__,_| .__/\n\n +___/ +_+\n\n Application architecture\n\n +--------------+\n\n +---------------+ | BigMap Data |\n\n | BigMap Index | | Bucket Can. |\n","file_path":"src/lib.rs","rank":66,"score":7.593805773222115},{"content":" self.is_maintenance_active = true;\n\n\n\n if let Err(_) = self.ensure_at_least_one_data_canister().await {\n\n self.is_maintenance_active = false;\n\n return serde_json_wasm::to_string(&Status {\n\n status: \"Unknown\",\n\n message: \"Error trying to ensure at least one data canister\",\n\n })\n\n .unwrap();\n\n }\n\n\n\n println!(\"BigMap Index: starting maintenance\");\n\n\n\n self.used_bytes_total = 0;\n\n\n\n for i in 0..self.idx.len() {\n\n let can_id = self.idx[i].clone();\n\n let can_ptr = CanisterPtr { 0: i as u32 };\n\n let used_bytes = self.qcall_canister_used_bytes(&can_id).await as u64;\n\n self.used_bytes_total += used_bytes;\n","file_path":"src/index.rs","rank":67,"score":7.494689608432236},{"content":"use crate::{\n\n calc_sha256, hashring_sha256, subnet_create_new_canister, subnet_install_canister_code,\n\n CanisterId, Key, Sha256Digest, Sha2Vec, Val,\n\n};\n\nuse bytesize::ByteSize;\n\n#[cfg(target_arch = \"wasm32\")]\n\nuse ic_cdk::println;\n\nuse std::collections::{BTreeSet, HashMap, HashSet, VecDeque};\n\nuse std::hash::BuildHasherDefault;\n\nuse wyhash::WyHash;\n\n\n\n// CanisterPtr allows us to have u64 instead of a full CanisterId\n\n// in various parts of the BigMap Index\n\n#[derive(Copy, Clone, Default, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]\n","file_path":"src/index.rs","rank":68,"score":7.486899396986052},{"content":"///////////////////////////////////////////////////////////////\n\n// Consistent Hash implementation, based on the HashRing crate\n\n// https://github.com/jeromefroe/hashring-rs/\n\n// but using SHA-256 for keys\n\n///////////////////////////////////////////////////////////////\n\nuse crate::Sha256Digest;\n\nuse num_bigint::BigUint;\n\nuse std::cmp::Ordering;\n\n\n\n// Node is an internal struct used to encapsulate the nodes that will be added\n\n// and removed from `HashRing`\n\n#[derive(Debug, Clone)]\n\npub(crate) struct Node<T: Clone> {\n\n pub(crate) key: Sha256Digest,\n\n pub(crate) node: T,\n\n}\n\n\n\nimpl<T: Clone> Node<T> {\n\n fn new(key: Sha256Digest, node: T) -> Node<T> {\n\n Node { key, node }\n","file_path":"src/hashring_sha256.rs","rank":69,"score":7.144214397634398},{"content":" }\n\n\n\n pub fn set_fn_ptr_used_bytes(&mut self, fn_ptr: FnPtrUsedBytes) {\n\n self.fn_ptr_used_bytes = Some(fn_ptr);\n\n }\n\n\n\n pub fn set_fn_ptr_set_range(&mut self, fn_ptr: FnPtrSetRange) {\n\n self.fn_ptr_set_range = Some(fn_ptr);\n\n }\n\n\n\n pub fn set_fn_ptr_list(&mut self, fn_ptr: FnPtrList) {\n\n self.fn_ptr_list = Some(fn_ptr);\n\n }\n\n\n\n pub fn set_fn_ptr_holds_key(&mut self, fn_ptr: FnPtrHoldsKey) {\n\n self.fn_ptr_holds_key = Some(fn_ptr);\n\n }\n\n\n\n pub fn set_fn_ptr_get_relocation_batch(&mut self, fn_ptr: FnPtrGetRelocationBatch) {\n\n self.fn_ptr_get_relocation_batch = Some(fn_ptr);\n","file_path":"src/index.rs","rank":70,"score":6.935499123472125},{"content":"use crate::data::DataBucket;\n\nuse crate::index::BigmapIdx;\n\nuse crate::{CanisterId, Key, Sha256Digest, Sha2Vec, Val};\n\nuse indexmap::IndexMap;\n\nuse std::collections::BTreeSet;\n\nuse std::sync::{Arc, RwLock};\n\n// use std::time::Instant;\n\n\n","file_path":"src/index/tests.rs","rank":71,"score":6.863659161145174},{"content":" fn_ptr(can_id.clone(), key)\n\n }\n\n\n\n async fn qcall_s_can_search_keys_by_query(\n\n &self,\n\n can_id: &CanisterId,\n\n search_query: &String,\n\n ) -> Vec<Key> {\n\n let fn_ptr = self\n\n .fn_ptr_search_keys_by_query\n\n .as_ref()\n\n .expect(\"fn_ptr_search_keys_by_query is not set\");\n\n fn_ptr(can_id.clone(), search_query)\n\n }\n\n\n\n async fn qcall_canister_used_bytes(&self, can_id: &CanisterId) -> usize {\n\n let fn_ptr = self\n\n .fn_ptr_used_bytes\n\n .as_ref()\n\n .expect(\"fn_ptr_used_bytes is not set\");\n","file_path":"src/index.rs","rank":72,"score":6.8051680143943205},{"content":" .await\n\n .expect(\"list call failed\")\n\n }\n\n\n\n async fn qcall_canister_used_bytes(&self, can_id: &CanisterId) -> usize {\n\n ic_cdk::call(can_id.clone().0.into(), \"used_bytes\", Some(()))\n\n .await\n\n .expect(\"used_bytes call failed\")\n\n }\n\n\n\n async fn qcall_dcan_holds_key(&self, can_id: &CanisterId, key: &Key) -> bool {\n\n ic_cdk::call(can_id.clone().0.into(), \"holds_key\", Some(key))\n\n .await\n\n .expect(\"holds_key call failed\")\n\n }\n\n\n\n async fn ucall_dcan_set_range(\n\n &self,\n\n can_id: &CanisterId,\n\n range_start: Sha256Digest,\n","file_path":"src/index.rs","rank":73,"score":6.79220862863693},{"content":" let can_id = CanisterId::from(i);\n\n db_map\n\n .write()\n\n .unwrap()\n\n .insert(can_id.clone(), DataBucket::new(can_id));\n\n }\n\n\n\n let db_map_ref = db_map.clone();\n\n let fn_ptr_used_bytes = move |can_id: CanisterId| {\n\n db_map_ref\n\n .read()\n\n .unwrap()\n\n .get(&can_id)\n\n .unwrap()\n\n .used_bytes()\n\n };\n\n bm_idx.set_fn_ptr_used_bytes(Box::new(fn_ptr_used_bytes));\n\n\n\n let db_map_ref = db_map.clone();\n\n let fn_ptr_holds_key = move |can_id: CanisterId, key: &Key| {\n","file_path":"src/index/tests.rs","rank":74,"score":6.785556427147117},{"content":" \"CanisterId {}: code install failed with error {}\",\n\n new_can_id, err\n\n ),\n\n };\n\n Ok(new_can_id)\n\n }\n\n Err(err) => Err(err),\n\n }\n\n }\n\n\n\n pub async fn set_data_bucket_canister_wasm_binary(&mut self, wasm_binary: Vec<u8>) {\n\n self.data_bucket_canister_wasm_binary = wasm_binary;\n\n if let Err(err) = self.ensure_at_least_one_data_canister().await {\n\n println!(\"Error adding canisters: {}\", err);\n\n }\n\n }\n\n\n\n pub async fn set_search_canister_wasm_binary(&mut self, wasm_binary: Vec<u8>) {\n\n self.search_canister_wasm_binary = wasm_binary;\n\n if let Err(err) = self.ensure_at_least_one_search_canister().await {\n","file_path":"src/index.rs","rank":75,"score":6.678816079614915},{"content":"// Full Text Search\n\n// Input: (doc_id: Vec<u8>, document: String)\n\n//\n\n// Steps:\n\n// - Split string into tokens,\n\n// - Normalize tokens,\n\n// - Get or assign a unique ID for each token,\n\n// -\n\n\n\nuse lazy_static::lazy_static;\n\nuse regex::Regex;\n\nuse roaring::RoaringBitmap;\n\nuse rust_stemmers::{Algorithm, Stemmer};\n\nuse std::collections::{HashMap, HashSet};\n\nuse std::hash::BuildHasherDefault;\n\nuse wyhash::WyHash;\n\n\n\npub type DetHashMap<K, V> = HashMap<K, V, BuildHasherDefault<WyHash>>;\n\npub type DetHashSet<K> = HashSet<K, BuildHasherDefault<WyHash>>;\n\n\n\n// #[cfg(target_arch = \"wasm32\")]\n\n// use ic_cdk::println;\n\n\n\nuse crate::Key;\n\n\n\n// Roaring Bitmaps only support 32-bit integers\n","file_path":"src/search.rs","rank":76,"score":6.591251073216856},{"content":"mod ic0 {\n\n #[link(wasm_import_module = \"ic0\")]\n\n extern \"C\" {\n\n pub fn canister_self_copy(dst: u32, offset: u32, size: u32) -> ();\n\n pub fn canister_self_size() -> u32;\n\n pub fn debug_print(offset: u32, size: u32) -> ();\n\n pub fn msg_arg_data_copy(dst: u32, offset: u32, size: u32) -> ();\n\n pub fn msg_arg_data_size() -> u32;\n\n pub fn msg_caller_copy(dst: u32, offset: u32, size: u32) -> ();\n\n pub fn msg_caller_size() -> u32;\n\n pub fn msg_reject(src: u32, size: u32) -> ();\n\n pub fn msg_reject_code() -> i32;\n\n pub fn msg_reject_msg_copy(dst: u32, offset: u32, size: u32) -> ();\n\n pub fn msg_reject_msg_size() -> u32;\n\n pub fn msg_reply() -> ();\n\n pub fn msg_reply_data_append(offset: u32, size: u32) -> ();\n\n pub fn trap(offset: u32, size: u32) -> ();\n\n pub fn call_simple(\n\n callee_src: u32,\n\n callee_size: u32,\n","file_path":"src/dfn_core.rs","rank":77,"score":6.482820274497623},{"content":" .expect(&format!(\n\n \"BigMap index: append call to CanisterId {} failed\",\n\n can_id\n\n ))\n\n }\n\n None => {\n\n println!(\n\n \"BigMap Index: no data canister suitable for key {}\",\n\n String::from_utf8_lossy(&key)\n\n );\n\n 0\n\n }\n\n }\n\n }\n\n\n\n fn can_ptr_to_canister_id(&self, can_ptr: &CanisterPtr) -> CanisterId {\n\n self.idx[can_ptr.0 as usize].clone()\n\n }\n\n\n\n pub async fn add_canisters(&mut self, can_ids: Vec<CanisterId>) {\n","file_path":"src/index.rs","rank":78,"score":6.390138090635031},{"content":" unsafe { Pin::new_unchecked(&mut *self.0.borrow_mut()) }.poll(ctx)\n\n }\n\n}\n\n\n\nimpl<T> Clone for RefCounted<T> {\n\n fn clone(&self) -> Self {\n\n RefCounted(Rc::clone(&self.0))\n\n }\n\n}\n\n\n\n/// The result type of the CallFuture.\n\npub(super) type FutureResult = Result<Vec<u8>, (i32, String)>;\n\n\n\n/// The Future trait implemenation, returned by the asynchronous inter-canister\n\n/// call.\n\n#[derive(Default)]\n\npub(super) struct CallFuture {\n\n /// result of the canister call\n\n pub result: Option<FutureResult>,\n\n /// waker (callback)\n","file_path":"src/dfn_futures.rs","rank":79,"score":6.333373510240887},{"content":" println!(\"BigMap Index: Created Data CanisterId {}\", can_id);\n\n\n\n // Add all canisters to the available queue\n\n self.canister_available_queue.push_back(can_id);\n\n }\n\n\n\n if let Err(err) = self.ensure_at_least_one_data_canister().await {\n\n self.is_maintenance_active = false;\n\n println!(\"Error adding canisters: {}\", err);\n\n }\n\n }\n\n\n\n pub async fn ensure_at_least_one_data_canister(&mut self) -> Result<(), String> {\n\n if self.hash_ring.is_empty() {\n\n if self.creating_data_canister {\n\n return Err(\n\n \"Already creating data canister, concurrent calls are not allowed\".to_string(),\n\n );\n\n }\n\n self.creating_data_canister = true;\n","file_path":"src/index.rs","rank":80,"score":6.130776891392326},{"content":" fn_ptr_delete_entries: Option<FnPtrDeleteEntries>,\n\n}\n\n\n\n#[allow(dead_code)]\n\nimpl BigmapIdx {\n\n pub fn new() -> Self {\n\n let mut result: BigmapIdx = BigmapIdx::default();\n\n result.reset();\n\n result\n\n }\n\n\n\n pub fn reset(&mut self) {\n\n *self = Self {\n\n used_bytes_threshold: 3 * 1024 * 1024 * 1024,\n\n batch_limit_bytes: 1024 * 1024,\n\n ..Default::default()\n\n }\n\n }\n\n\n\n pub async fn get(&self, key: &Key) -> Option<Val> {\n","file_path":"src/index.rs","rank":81,"score":6.0156338085687295},{"content":" }\n\n\n\n pub fn used_bytes(&self) -> usize {\n\n std::mem::size_of_val(self)\n\n }\n\n\n\n fn normalize_to_string(&self, input: &str) -> String {\n\n String::from(self.stemmer.stem(&input.to_lowercase()))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"src/search.rs","rank":82,"score":5.97172633989585},{"content":"\n\n /// Get the Option<node> at position `idx - 1`.\n\n /// Returns `None` if `idx - 1` is out of bounds\n\n pub fn get_prev_key_node_at_idx(&self, idx: usize) -> Option<(Sha256Digest, &T)> {\n\n if idx < 1 {\n\n return None;\n\n }\n\n\n\n match self.get_key_node_at_idx(idx - 1) {\n\n Some(e) => Some(e),\n\n None => None,\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::biguint_to_sha256_digest;\n\n use super::BigUint;\n\n use super::HashRing;\n","file_path":"src/hashring_sha256.rs","rank":83,"score":5.9496293991490266},{"content":" println!(\"BigMap Index: No Data Canisters, creating one!\");\n\n match self.create_data_bucket_canister().await {\n\n Ok(can_id) => {\n\n println!(\"BigMap Index: Activating Data CanisterId {}\", can_id);\n\n\n\n let range = self.hash_ring_add_canister_id(&can_id);\n\n self.ucall_dcan_set_range(&can_id, range.0, range.1).await;\n\n }\n\n Err(err) => {\n\n println!(\"BigMap Index: Error creating a new Data Canister {}\", err);\n\n }\n\n }\n\n self.creating_data_canister = false;\n\n };\n\n Ok(())\n\n }\n\n\n\n pub async fn ensure_at_least_one_search_canister(&mut self) -> Result<(), String> {\n\n if self.search_canisters.is_empty() {\n\n if self.creating_search_canister {\n","file_path":"src/index.rs","rank":84,"score":5.887993991980675},{"content":"///////////////////////////////////////////////////////////////\n\n// Consistent Hash implementation, based on the HashRing crate\n\n// https://github.com/jeromefroe/hashring-rs/\n\n///////////////////////////////////////////////////////////////\n\nuse std::cmp::Ordering;\n\nuse std::hash::{BuildHasher, Hash, Hasher};\n\nuse wyhash::WyHash;\n\n\n\n#[derive(Debug, Default, Clone)]\n\npub struct WyHashBuilder;\n\n\n\nimpl BuildHasher for WyHashBuilder {\n\n type Hasher = WyHash;\n\n\n\n fn build_hasher(&self) -> Self::Hasher {\n\n WyHash::with_seed(3)\n\n }\n\n}\n\n\n\n// Node is an internal struct used to encapsulate the nodes that will be added\n","file_path":"src/hashring.rs","rank":85,"score":5.879382241114167},{"content":"use super::{calc_sha256, CanisterId, DataBucket};\n\nuse crate::hashring_sha256::{SHA256_DIGEST_MAX, SHA256_DIGEST_MIN};\n\n\n\n#[actix_rt::test]\n\nasync fn bm_data_put_get() {\n\n // Insert key&value pairs and then get the value, and verify the correctness\n\n let mut d = DataBucket::new(CanisterId::from(42));\n\n d.set_range(&SHA256_DIGEST_MIN, &SHA256_DIGEST_MAX);\n\n for i in 0..100 as u8 {\n\n let key = format!(\"key-{}\", i).into_bytes();\n\n let value = vec![i; 200_000];\n\n\n\n d.put(&key, &value, false).expect(\"DataBucket put failed\");\n\n assert!(d.used_bytes() >= i as usize * 200_000);\n\n }\n\n\n\n for i in 0..100 as u8 {\n\n let key = format!(\"key-{}\", i).into_bytes();\n\n let value = vec![i; 200_000];\n\n\n","file_path":"src/data/tests.rs","rank":86,"score":5.814578232076362},{"content":" }\n\n\n\n for can_id in self.search_canisters.iter() {\n\n self.ucall_s_can_remove_from_search_index(can_id, key).await\n\n }\n\n }\n\n\n\n pub async fn search(&self, search_query: &String) -> (u64, Vec<(Key, Val)>) {\n\n if self.search_canisters.is_empty() {\n\n return (0, Vec::new());\n\n }\n\n\n\n let mut results = Vec::new();\n\n let mut results_len = 0;\n\n\n\n for can_id in self.search_canisters.iter() {\n\n let results_per_canister = self\n\n .qcall_s_can_search_keys_by_query(can_id, search_query)\n\n .await;\n\n results_len += results_per_canister.len() as u64;\n","file_path":"src/index.rs","rank":87,"score":5.801019580614045},{"content":" // The destination canister doesn't have the key but it's currently rebalancing.\n\n // The key may not have been moved yet from the source canister\n\n\n\n let can_id = self.can_ptr_to_canister_id(&rebalance_dst_ptr);\n\n if self.qcall_dcan_holds_key(&can_id, key).await {\n\n println!(\n\n \"BigMap Index: lookup_get @key {} from a relocation destination {}\",\n\n String::from_utf8_lossy(key),\n\n can_id\n\n );\n\n return Some(can_id);\n\n }\n\n }\n\n }\n\n\n\n None\n\n }\n\n\n\n // Find the data bucket canister into which the object with the provided key should go\n\n pub fn lookup_put(&self, key: &Key) -> Option<CanisterId> {\n","file_path":"src/index.rs","rank":88,"score":5.772658101326881},{"content":"There are two major parts of the BigMap architecture: 1) Index canister, and 2) Data Bucket canisters. In the current implementation there is only one Index canister and there can be a large number of Data Bucket canisters, to which the Index canister has pointers.\n\n\n\nThe *Index* canister is implemented as a [Hash Ring](https://en.wikipedia.org/wiki/Consistent_hashing) for which the code is in [this Rust file](../src/hashring_sha256.rs). The implementation is based using a Rust vector with Sha256 hashing of keys and Canister Ids.\n\n\n\n<br>\n\n*Hash Ring with Sha256 hashing. Sha256 hashes are shortened to 8 characters to simplify the illustration. The full hash (32 bytes) is used in the implementation.*\n\n\n\nIn the illustration, the entry's hash is `b6cdd8c1`, and the Hash Ring does not have that exact value. To determine the Data Bucket CanisterId that handles the particular entry is: the Hash Ring is searched for the *first hash which is larger or equal to the entry's hash*. Since the Hash Ring holds `34f444af` as the first entry, that entry is skipped since it's less than `b6cdd8c1`). After that, the Hash Ring holds `bda57583` -- which is the first hash larger or equal to the entry's hash `b6cdd8c1`, and therefore it's determined that `CanId1` handles the entry. Note that Hash Ring is maintained in a sorted order and due to this it is possible to perform Hash Ring lookups with binary search. Therefore, Hash Ring lookups take approximately `log(N)` time for `N` entries (Data Bucket canisters).\n\n\n\nBeside the Index canister, there is a variable number of Data Bucket canisters. BigMap starts with a single Data Bucket canister and these canisters are added one at a time as the capacity of a Data Bucket canister is exhausted. The ultimate objective of the `User Agent` is to get data from or to store data at a Data Bucket canister. It can achieve this in two ways:\n\n\n\n1. By communicating through the BigMap Index, or\n\n2. By communicating directly with the Data Bucket canisters, and using the BigMap Index only for lookups.\n\n\n\nIn the following sections we describe these two options.\n\n\n","file_path":"docs/bigmap.md","rank":89,"score":5.768913110225878},{"content":"//! This module contains all mechanisms required to enable asynchronous\n\n//! programming in Rust, based on native async Rust capabilities:\n\n//!\n\n//! - the future returned by the asynchronous System API call, and\n\n//! - the kickstarting/waker implementations to advance top level futures on\n\n//! every inter-canister callback call.\n\n\n\nuse std::{\n\n cell::{RefCell, RefMut},\n\n future::Future,\n\n pin::Pin,\n\n rc::Rc,\n\n task::{Context, Poll, Waker},\n\n};\n\n\n\n/// A reference counter wrapper we use with the CallFuture.\n\n/// This is required, because the future we return from the `call` method can\n\n/// either have two owners (the callback closure and the canister runtime) if\n\n/// the underlying system call succeeded, or just one (the canister runtime) it\n\n/// the system call failed.\n","file_path":"src/dfn_futures.rs","rank":90,"score":5.754992150174095},{"content":"#[derive(Default)]\n\npub(super) struct CallFuture {\n\n /// result of the canister call\n\n pub result: Option<FutureResult>,\n\n /// waker (callback)\n\n pub waker: Option<Waker>,\n\n}\n\n\n\nimpl CallFuture {\n\n pub fn new() -> Self {\n\n CallFuture::default()\n\n }\n\n}\n\n\n\nimpl Future for CallFuture {\n\n type Output = FutureResult;\n\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\n\n if let Some(result) = self.result.take() {\n\n return Poll::Ready(result);\n\n }\n\n self.waker = Some(cx.waker().clone());\n\n Poll::Pending\n\n }\n\n}\n\n\n","file_path":"src/dfn_core.rs","rank":91,"score":5.737797716719763},{"content":"# (opt vec { 4; 5; 6; })\n\n```\n\n\n\nIt is also possible to talk directly to the data bucket canisters, but this is likely only useful during development or debugging.\n\nIn this case it's necessary to know the CanisterId, which is printed in the replica debug logs during creation.\n\n\n\nFor example:\n\n```bash\n\ndfx canister call tup4c-ks6aa-aaaaa-aaaaa-aaaaa-aaaaa-aaaaa-q get '(vec { 97; 98; 99; })'\n\n# (null)\n\ndfx canister call tup4c-ks6aa-aaaaa-aaaaa-aaaaa-aaaaa-aaaaa-q put '(vec { 97; 98; 99; }, vec { 100; 101; 102; })'\n\n# ()\n\ndfx canister call tup4c-ks6aa-aaaaa-aaaaa-aaaaa-aaaaa-aaaaa-q get '(vec { 97; 98; 99; })'\n\n# (opt vec { 4; 5; 6; })\n\n```\n","file_path":"README.md","rank":92,"score":5.707129795481315},{"content":" name_src: u32,\n\n name_size: u32,\n\n reply_fun: usize,\n\n reply_env: u32,\n\n reject_fun: usize,\n\n reject_env: u32,\n\n data_src: u32,\n\n data_size: u32,\n\n ) -> i32;\n\n pub fn stable_size() -> u32;\n\n pub fn ic0_stable_grow(additional_pages: u32) -> i32;\n\n pub fn ic0_stable_read(dst: u32, offset: u32, size: u32) -> ();\n\n pub fn ic0_stable_write(offset: u32, src: u32, size: u32) -> ();\n\n }\n\n}\n\n\n\n/*\n\nThese stubs exist for when you're compiling this code not on a canister. If you\n","file_path":"src/dfn_core.rs","rank":93,"score":5.618737878868154},{"content":" self.used_bytes -= 32; // for the Sha256 of the key (=32 bytes)\n\n }\n\n None => {}\n\n }\n\n }\n\n }\n\n\n\n pub fn get(&self, key: Key) -> Result<&Val, String> {\n\n // println!(\n\n // \"BigMap Data: get {}\",\n\n // String::from_utf8_lossy(&key)\n\n // );\n\n let key_sha2 = calc_sha256(&key);\n\n match self.entries.get(&key_sha2) {\n\n Some((_, v)) => Ok(v),\n\n None => Err(\"Entry not found\".to_string()),\n\n }\n\n }\n\n\n\n pub fn list(&self, key_prefix: &Key) -> Vec<Key> {\n","file_path":"src/data.rs","rank":94,"score":5.58247468700766},{"content":" pub unsafe fn debug_print(_offset: u32, _size: u32) {\n\n wrong_arch(\"debug_print\")\n\n }\n\n pub unsafe fn msg_arg_data_copy(_dst: u32, _offset: u32, _size: u32) {\n\n wrong_arch(\"msg_arg_data_copy\")\n\n }\n\n pub unsafe fn msg_arg_data_size() -> u32 {\n\n wrong_arch(\"canister_self_copy\")\n\n }\n\n pub unsafe fn msg_caller_copy(_dst: u32, _offset: u32, _size: u32) {\n\n wrong_arch(\"msg_caller_copy\")\n\n }\n\n pub unsafe fn msg_caller_size() -> u32 {\n\n wrong_arch(\"msg_caller_size\")\n\n }\n\n pub unsafe fn msg_reject(_src: u32, _size: u32) {\n\n wrong_arch(\"msg_reject\")\n\n }\n\n pub unsafe fn msg_reject_code() -> i32 {\n\n wrong_arch(\"msg_reject_code\")\n","file_path":"src/dfn_core.rs","rank":95,"score":5.507571279895802},{"content":"use ::bigmap::{index::BigmapIdx, CanisterId, Key, Val};\n\n#[cfg(target_arch = \"wasm32\")]\n\nuse ic_cdk::println;\n\nuse ic_cdk::storage;\n\nuse ic_cdk_macros::*;\n\n\n\n#[query]\n\nasync fn get(key: Key) -> Option<Val> {\n\n let bigmap_idx = storage::get::<BigmapIdx>();\n\n\n\n bigmap_idx.get(&key).await\n\n}\n\n\n\n#[update]\n\nasync fn put(key: Key, value: Val) -> u64 {\n\n let bigmap_idx = storage::get_mut::<BigmapIdx>();\n\n\n\n println!(\"BigMap Index: put key {}\", String::from_utf8_lossy(&key));\n\n\n\n bigmap_idx.put(&key, &value).await\n","file_path":"src/bigmap_index.rs","rank":96,"score":5.350625850631953},{"content":"impl DataBucket {\n\n pub fn new(id: CanisterId) -> Self {\n\n // println!(\"BigMap Data {}: new\", id);\n\n Self {\n\n id,\n\n ..Default::default()\n\n }\n\n }\n\n\n\n pub fn set_range(&mut self, range_start: &Sha256Digest, range_end: &Sha256Digest) {\n\n println!(\n\n \"BigMap Data: set_range {} .. {}\",\n\n hex::encode(range_start),\n\n hex::encode(range_end)\n\n );\n\n self.range_start = range_start.clone();\n\n self.range_end = range_end.clone();\n\n }\n\n\n\n pub fn is_in_range(&self, key_sha2: &Sha256Digest) -> bool {\n","file_path":"src/data.rs","rank":97,"score":5.322656424767349},{"content":" Some(v) => v,\n\n None => return hex::encode(rand_key),\n\n };\n\n\n\n let can_id = self.can_ptr_to_canister_id(can_ptr);\n\n\n\n let key_is_used = self\n\n .qcall_dcan_holds_key(&can_id, &Vec::from(rand_key.as_slice()))\n\n .await;\n\n\n\n if !key_is_used {\n\n let result = hex::encode(rand_key);\n\n println!(\n\n \"get_random_key: after {} attempts found {} which maps to {}\",\n\n i, result, can_id\n\n );\n\n return result;\n\n }\n\n\n\n rand_key = rand_key_hash;\n","file_path":"src/index.rs","rank":98,"score":5.30669293670331},{"content":" .collect();\n\n\n\n self.batch_put(&batch_as_bytes).await;\n\n\n\n // FIXME: Ensure the search canister has enough space and allocate a new one if necessary\n\n let search_can_id = &self.search_canisters[0].clone();\n\n self.ucall_s_can_batch_add_to_search_index(&search_can_id, batch)\n\n .await;\n\n\n\n batch.len() as u64\n\n }\n\n\n\n pub async fn remove_from_fts_index(&mut self, key: &Key) {\n\n if let Err(err) = self.ensure_at_least_one_search_canister().await {\n\n println!(\n\n \"Error removing key {} => {}\",\n\n String::from_utf8_lossy(key),\n\n err\n\n );\n\n return;\n","file_path":"src/index.rs","rank":99,"score":5.2806497120673965}],"string":"[\n {\n \"content\": \"#[derive(CandidType, serde::Deserialize, Debug)]\\n\\nstruct CanisterIdRecord {\\n\\n canister_id: candid::Principal,\\n\\n}\\n\\n\\n\\npub async fn subnet_create_new_canister() -> Result<CanisterId, String> {\\n\\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\\n\\n let new_can_id_record: CanisterIdRecord =\\n\\n match ic_cdk::call(management_canister, \\\"create_canister\\\", Some(())).await {\\n\\n Ok(res) => res,\\n\\n Err(err) => {\\n\\n ic_cdk::println!(\\\"Error invoking create_canister: {:?} {}\\\", err.0, err.1);\\n\\n return Err(err.1);\\n\\n }\\n\\n };\\n\\n\\n\\n let new_can_id = CanisterId::from(new_can_id_record.canister_id.as_slice());\\n\\n Ok(new_can_id)\\n\\n}\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\",\n \"file_path\": \"src/canister_management.rs\",\n \"rank\": 0,\n \"score\": 99287.38771718356\n },\n {\n \"content\": \"#[derive(Copy, Clone, Default, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\nstruct CanisterPtr(u32);\\n\\npub type DetHashSet<K> = HashSet<K, BuildHasherDefault<WyHash>>;\\n\\npub type DetHashMap<K, V> = HashMap<K, V, BuildHasherDefault<WyHash>>;\\n\\n\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 1,\n \"score\": 88478.53263966288\n },\n {\n \"content\": \"/// Returns the canister id as a blob.\\n\\npub fn id() -> CanisterId {\\n\\n let len: u32 = unsafe { ic0::canister_self_size() };\\n\\n let mut bytes = vec![0; len as usize];\\n\\n unsafe {\\n\\n ic0::canister_self_copy(bytes.as_mut_ptr() as u32, 0, len);\\n\\n }\\n\\n CanisterId(bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 2,\n \"score\": 80186.14815992407\n },\n {\n \"content\": \"pub fn to_input<Input: DeserializeOwned>(inp: Vec<u8>) -> Input {\\n\\n let mut d = IDLDeserialize::new(&inp).unwrap();\\n\\n let v = d.get_value().unwrap();\\n\\n d.done().unwrap();\\n\\n v\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 3,\n \"score\": 63344.717073733926\n },\n {\n \"content\": \"#[derive(Default)]\\n\\nstruct TermData {\\n\\n frequency: usize,\\n\\n inverted_index: RoaringBitmap,\\n\\n}\\n\\n\\n\\npub struct SearchIndexer {\\n\\n key_to_doc_id: DetHashMap<Key, DocumentId>,\\n\\n doc_id_to_key: DetHashMap<DocumentId, Key>,\\n\\n terms: DetHashMap<Term, TermData>,\\n\\n stemmer: Stemmer,\\n\\n}\\n\\n\\n\\nimpl Default for SearchIndexer {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n key_to_doc_id: DetHashMap::default(),\\n\\n doc_id_to_key: DetHashMap::default(),\\n\\n terms: DetHashMap::default(),\\n\\n stemmer: Stemmer::create(Algorithm::English),\\n\\n }\\n\",\n \"file_path\": \"src/search.rs\",\n \"rank\": 4,\n \"score\": 61560.892788827776\n },\n {\n \"content\": \"/// Calls another canister and executes one of the callbacks.\\n\\npub fn call_with_callbacks(\\n\\n id: CanisterId,\\n\\n method: &str,\\n\\n data: &[u8],\\n\\n reply: impl FnOnce() + 'static,\\n\\n reject: impl FnOnce() + 'static,\\n\\n) -> i32 {\\n\\n type Closures = (Box<dyn FnOnce() + 'static>, Box<dyn FnOnce() + 'static>);\\n\\n fn on_reply(env: u32) {\\n\\n let closure = unsafe { Box::from_raw(env as *mut Closures) }.0;\\n\\n closure();\\n\\n }\\n\\n fn on_reject(env: u32) {\\n\\n let closure = unsafe { Box::from_raw(env as *mut Closures) }.1;\\n\\n closure();\\n\\n }\\n\\n let callee = id.0;\\n\\n let boxed_closures: Box<Closures> = Box::new((Box::new(reply), Box::new(reject)));\\n\\n let env = Box::into_raw(boxed_closures);\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 5,\n \"score\": 54442.48586923211\n },\n {\n \"content\": \"/// Calls another canister and returns a future.\\n\\npub fn call(id: CanisterId, method: &str, data: &[u8]) -> impl Future<Output = FutureResult> {\\n\\n // the callback from IC dereferences the future from a raw pointer, assigns the\\n\\n // result and calls the waker\\n\\n fn callback(future_ptr: u32) {\\n\\n let waker = {\\n\\n let ref_counted =\\n\\n unsafe { RefCounted::from_raw(future_ptr as *const RefCell<CallFuture>) };\\n\\n let mut future = ref_counted.borrow_mut();\\n\\n future.result = Some(match reject_code() {\\n\\n 0 => Ok(arg_data()),\\n\\n n => Err((n, reject_message())),\\n\\n });\\n\\n future.waker.clone()\\n\\n };\\n\\n waker.expect(\\\"there is a waker\\\").wake();\\n\\n };\\n\\n let callee = id.0;\\n\\n let future_for_closure = RefCounted::new(CallFuture::new());\\n\\n let future = future_for_closure.clone();\\n\\n let future_ptr = future_for_closure.into_raw();\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 6,\n \"score\": 53303.998411702974\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrUsedBytes = Box<dyn Fn(CanisterId) -> usize>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 7,\n \"score\": 50520.909770471524\n },\n {\n \"content\": \"/// Returns the rejection code.\\n\\npub fn reject_code() -> i32 {\\n\\n unsafe { ic0::msg_reject_code() }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 8,\n \"score\": 50418.38028017041\n },\n {\n \"content\": \"/// Returns the rejection message.\\n\\npub fn reject_message() -> String {\\n\\n let len: u32 = unsafe { ic0::msg_reject_msg_size() };\\n\\n let mut bytes = vec![0; len as usize];\\n\\n unsafe {\\n\\n ic0::msg_reject_msg_copy(bytes.as_mut_ptr() as u32, 0, len);\\n\\n }\\n\\n String::from_utf8_lossy(&bytes).to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 9,\n \"score\": 50418.38028017041\n },\n {\n \"content\": \"/// Replies with the given byte array.\\n\\n/// Note, currently we do not support chunkwise assemlbing of the response.\\n\\npub fn reply(payload: &[u8]) {\\n\\n unsafe {\\n\\n ic0::msg_reply_data_append(payload.as_ptr() as u32, payload.len() as u32);\\n\\n ic0::msg_reply();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 10,\n \"score\": 48172.10060543954\n },\n {\n \"content\": \"/// Returns the caller of the current call.\\n\\npub fn caller() -> Vec<u8> {\\n\\n let len: u32 = unsafe { ic0::msg_caller_size() };\\n\\n let mut bytes = vec![0; len as usize];\\n\\n unsafe {\\n\\n ic0::msg_caller_copy(bytes.as_mut_ptr() as u32, 0, len);\\n\\n }\\n\\n bytes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 11,\n \"score\": 48172.10060543954\n },\n {\n \"content\": \"pub trait OverCandid<Arguments, Output> {\\n\\n fn over_candid(self, _: IDLDeserialize<'_>) -> Vec<u8>;\\n\\n}\\n\\n\\n\\nimpl<C: CandidType, F: FnOnce() -> C> OverCandid<(), C> for F {\\n\\n fn over_candid(self, _: IDLDeserialize<'_>) -> Vec<u8> {\\n\\n from_output(self())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<A1: DeserializeOwned, C: CandidType, F: FnOnce(A1) -> C> OverCandid<(A1,), C> for F {\\n\\n fn over_candid(self, d: IDLDeserialize<'_>) -> Vec<u8> {\\n\\n let ((a1,), _) = extract_arg_1(d);\\n\\n from_output(self(a1))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<A1: DeserializeOwned, A2: DeserializeOwned, C: CandidType, F: FnOnce(A1, A2) -> C>\\n\\n OverCandid<(A1, A2), C> for F\\n\\n{\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 12,\n \"score\": 48172.10060543954\n },\n {\n \"content\": \"/// Traps with the given message.\\n\\npub fn trap_with(message: &str) {\\n\\n unsafe {\\n\\n ic0::trap(message.as_ptr() as u32, message.len() as u32);\\n\\n }\\n\\n}\\n\\n\\n\\n// This module contains all mechanisms required to enable asynchronous\\n\\n// programming in Rust, based on native async Rust capabilities:\\n\\n//\\n\\n// - the future returned by the asynchronous System API call, and\\n\\n// - the kickstarting/waker implementations to advance top level futures on\\n\\n// every inter-canister callback call.\\n\\n\\n\\nuse std::{\\n\\n cell::RefMut,\\n\\n pin::Pin,\\n\\n rc::Rc,\\n\\n task::{Context, Poll, Waker},\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 13,\n \"score\": 48172.10060543954\n },\n {\n \"content\": \"/// Returns the argument extracted from the message payload.\\n\\npub fn arg_data() -> Vec<u8> {\\n\\n let len: u32 = unsafe { ic0::msg_arg_data_size() };\\n\\n let mut bytes = vec![0; len as usize];\\n\\n unsafe {\\n\\n ic0::msg_arg_data_copy(bytes.as_mut_ptr() as u32, 0, len);\\n\\n }\\n\\n bytes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 14,\n \"score\": 47107.513946503575\n },\n {\n \"content\": \"/// Rejects the current call with the given message.\\n\\npub fn reject(err_message: &str) {\\n\\n let err_message = err_message.as_bytes();\\n\\n unsafe {\\n\\n ic0::msg_reject(err_message.as_ptr() as u32, err_message.len() as u32);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 15,\n \"score\": 47107.513946503575\n },\n {\n \"content\": \"pub fn biguint_to_sha256_digest(bigint: &BigUint) -> Sha256Digest {\\n\\n let mut key = bigint.to_radix_be(256);\\n\\n key.resize(32, 0);\\n\\n *Sha256Digest::from_slice(&key)\\n\\n}\\n\\n\\n\\nuse lazy_static::lazy_static;\\n\\n\\n\\nlazy_static! {\\n\\n pub static ref SHA256_DIGEST_MIN: Sha256Digest = biguint_to_sha256_digest(&BigUint::from(0u64));\\n\\n pub static ref SHA256_DIGEST_MAX: Sha256Digest =\\n\\n biguint_to_sha256_digest(&BigUint::parse_bytes(b\\\"f\\\".repeat(64).as_slice(), 16).unwrap());\\n\\n}\\n\\n\\n\\npub(crate) fn sha256_range_half(\\n\\n sha256_lower: &Sha256Digest,\\n\\n sha256_upper: &Sha256Digest,\\n\\n) -> Sha256Digest {\\n\\n let i_prev = biguint_from_slice256(sha256_lower.as_slice());\\n\\n let i = biguint_from_slice256(sha256_upper.as_slice());\\n\",\n \"file_path\": \"src/hashring_sha256.rs\",\n \"rank\": 16,\n \"score\": 41709.769927113986\n },\n {\n \"content\": \"pub fn sha256_digest_to_biguint(val: Sha256Digest) -> BigUint {\\n\\n biguint_from_slice256(val.as_slice())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/hashring_sha256.rs\",\n \"rank\": 17,\n \"score\": 41709.769927113986\n },\n {\n \"content\": \"fn extract_arg_3<A1: DeserializeOwned, A2: DeserializeOwned, A3: DeserializeOwned>(\\n\\n de: IDLDeserialize<'_>,\\n\\n) -> ((A1, A2, A3), IDLDeserialize<'_>) {\\n\\n let ((a1, a2), mut de) = extract_arg_2(de);\\n\\n let a_new = de.get_value().unwrap();\\n\\n ((a1, a2, a_new), de)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 18,\n \"score\": 39508.703349400836\n },\n {\n \"content\": \"fn extract_arg_1<A1: DeserializeOwned>(mut de: IDLDeserialize<'_>) -> ((A1,), IDLDeserialize<'_>) {\\n\\n let a1 = de.get_value().unwrap();\\n\\n ((a1,), de)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 19,\n \"score\": 38879.65911159082\n },\n {\n \"content\": \"/// Must be called on every top-level future corresponding to a method call of a\\n\\n/// canister by the IC.\\n\\n///\\n\\n/// Saves the pointer to the future on the heap and kickstarts the future by\\n\\n/// polling it once. During the polling we also need to provide the waker\\n\\n/// callback which is triggered after the future made progress. The waker would\\n\\n/// then. The waker would then poll the future one last time to advance it to\\n\\n/// the final state. For that, we pass the future pointer to the waker, so that\\n\\n/// it can be restored into a box from a raw pointer and then dropped if not\\n\\n/// needed anymore.\\n\\n///\\n\\n/// Technically, we store 2 pointers on the heap: the pointer to the future\\n\\n/// itself, and a pointer to that pointer. The reason for this is that the waker\\n\\n/// API requires us to pass one thin pointer, while a a pointer to a `dyn Trait`\\n\\n/// can only be fat. So we create one additional thin pointer, pointing to the\\n\\n/// fat pointer and pass it instead.\\n\\npub fn kickstart<F: 'static + Future<Output = ()>>(future: F) {\\n\\n let future_ptr = Box::into_raw(Box::new(future));\\n\\n let future_ptr_ptr: *mut *mut dyn Future<Output = ()> = Box::into_raw(Box::new(future_ptr));\\n\\n let mut pinned_future = unsafe { Pin::new_unchecked(&mut *future_ptr) };\\n\\n if let Poll::Ready(_) = pinned_future\\n\\n .as_mut()\\n\\n .poll(&mut Context::from_waker(&waker::waker(\\n\\n future_ptr_ptr as *const (),\\n\\n )))\\n\\n {\\n\\n unsafe {\\n\\n let _ = Box::from_raw(future_ptr);\\n\\n let _ = Box::from_raw(future_ptr_ptr);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// This module conatins the implementation of a waker we're using for waking\\n\\n// top-level futures (the ones returned by canister methods). The waker polls\\n\\n// the future once and re-pins it on the heap, if it's pending. If the future is\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 20,\n \"score\": 38757.2230849286\n },\n {\n \"content\": \"/// Must be called on every top-level future corresponding to a method call of a\\n\\n/// canister by the IC.\\n\\n///\\n\\n/// Saves the pointer to the future on the heap and kickstarts the future by\\n\\n/// polling it once. During the polling we also need to provide the waker\\n\\n/// callback which is triggered after the future made progress. The waker would\\n\\n/// then. The waker would then poll the future one last time to advance it to\\n\\n/// the final state. For that, we pass the future pointer to the waker, so that\\n\\n/// it can be restored into a box from a raw pointer and then dropped if not\\n\\n/// needed anymore.\\n\\n///\\n\\n/// Technically, we store 2 pointers on the heap: the pointer to the future\\n\\n/// itself, and a pointer to that pointer. The reason for this is that the waker\\n\\n/// API requires us to pass one thin pointer, while a a pointer to a `dyn Trait`\\n\\n/// can only be fat. So we create one additional thin pointer, pointing to the\\n\\n/// fat pointer and pass it instead.\\n\\npub fn kickstart<F: 'static + Future<Output = ()>>(future: F) {\\n\\n let future_ptr = Box::into_raw(Box::new(future));\\n\\n let future_ptr_ptr: *mut *mut dyn Future<Output = ()> = Box::into_raw(Box::new(future_ptr));\\n\\n let mut pinned_future = unsafe { Pin::new_unchecked(&mut *future_ptr) };\\n\\n if let Poll::Ready(_) = pinned_future\\n\\n .as_mut()\\n\\n .poll(&mut Context::from_waker(&waker::waker(\\n\\n future_ptr_ptr as *const (),\\n\\n )))\\n\\n {\\n\\n unsafe {\\n\\n let _ = Box::from_raw(future_ptr);\\n\\n let _ = Box::from_raw(future_ptr_ptr);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// This module conatins the implementation of a waker we're using for waking\\n\\n// top-level futures (the ones returned by canister methods). The waker polls\\n\\n// the future once and re-pins it on the heap, if it's pending. If the future is\\n\",\n \"file_path\": \"src/dfn_futures.rs\",\n \"rank\": 21,\n \"score\": 38757.2230849286\n },\n {\n \"content\": \"pub fn from_output<Output: CandidType>(payload: Output) -> Vec<u8> {\\n\\n candid::ser::IDLBuilder::new()\\n\\n .arg(&payload)\\n\\n .unwrap()\\n\\n .serialize_to_vec()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 22,\n \"score\": 37943.922055183255\n },\n {\n \"content\": \"/// This allows you to wrap regular rust functions and have them take and return\\n\\n/// candid\\n\\n/// Currently it will only return one argument\\n\\npub fn candid<A, O, F: OverCandid<A, O>>(f: F) {\\n\\n dfn_core::bytes(|bs| {\\n\\n let de = candid::de::IDLDeserialize::new(&bs).unwrap();\\n\\n f.over_candid(de)\\n\\n })\\n\\n}\\n\\n\\n\\n// TODO turn this into a trait with call_json, unless the type complexity is\\n\\n// more trouble than it's worth\\n\\npub async fn call_candid<Input: DeserializeOwned, Output: CandidType>(\\n\\n canister_id: Vec<u8>,\\n\\n method_name: &str,\\n\\n payload: Output,\\n\\n) -> Result<Input, (i32, String)> {\\n\\n let result = dfn_core::call(\\n\\n dfn_core::CanisterId(canister_id),\\n\\n method_name,\\n\\n &from_output(payload),\\n\\n )\\n\\n .await;\\n\\n result.map(to_input)\\n\\n}\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 23,\n \"score\": 37939.07176137015\n },\n {\n \"content\": \"/// Prints the given message.\\n\\npub fn print<S: std::convert::AsRef<str>>(s: S) {\\n\\n let s = s.as_ref();\\n\\n unsafe {\\n\\n ic0::debug_print(s.as_ptr() as u32, s.len() as u32);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 24,\n \"score\": 37855.05628571828\n },\n {\n \"content\": \"/// Useful for writing endpoints that take a set of bytes and return a set of\\n\\n/// bytes Check test/reverse_blob_bin.rs for a usage example\\n\\npub fn bytes<F: FnOnce(Vec<u8>) -> Vec<u8>>(f: F) {\\n\\n let bs = arg_data();\\n\\n let res = f(bs);\\n\\n reply(&res);\\n\\n}\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 25,\n \"score\": 36264.916127476456\n },\n {\n \"content\": \"fn extract_arg_2<A1: DeserializeOwned, A2: DeserializeOwned>(\\n\\n de: IDLDeserialize<'_>,\\n\\n) -> ((A1, A2), IDLDeserialize<'_>) {\\n\\n let ((a1,), mut de) = extract_arg_1(de);\\n\\n let a_new = de.get_value().unwrap();\\n\\n ((a1, a_new), de)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 26,\n \"score\": 36236.03731328285\n },\n {\n \"content\": \"/// The mode with which a canister is installed.\\n\\n#[derive(Clone, Debug, Deserialize, PartialEq, Serialize, Eq, Hash, CandidType)]\\n\\npub enum CanisterInstallMode {\\n\\n /// A fresh install of a new canister.\\n\\n #[serde(rename = \\\"install\\\")]\\n\\n Install,\\n\\n /// Reinstalling a canister that was already installed.\\n\\n #[serde(rename = \\\"reinstall\\\")]\\n\\n Reinstall,\\n\\n /// Upgrade an existing canister.\\n\\n #[serde(rename = \\\"upgrade\\\")]\\n\\n Upgrade,\\n\\n}\\n\\n\\n\\n#[derive(CandidType, Deserialize, Debug)]\\n\\npub struct InstallCodeArgs {\\n\\n pub mode: CanisterInstallMode,\\n\\n pub canister_id: candid::Principal,\\n\\n pub wasm_module: Vec<u8>,\\n\\n pub arg: Vec<u8>,\\n\",\n \"file_path\": \"src/canister_management.rs\",\n \"rank\": 27,\n \"score\": 34941.36363173804\n },\n {\n \"content\": \"use crate::CanisterId;\\n\\nuse candid::CandidType;\\n\\n\\n\\n#[derive(CandidType, serde::Deserialize, Debug)]\\n\",\n \"file_path\": \"src/canister_management.rs\",\n \"rank\": 28,\n \"score\": 34941.04682362181\n },\n {\n \"content\": \" pub compute_allocation: Option<u64>,\\n\\n pub memory_allocation: Option<u64>,\\n\\n}\\n\\nuse std::convert::TryFrom;\\n\\n\\n\\npub async fn subnet_install_canister_code(\\n\\n canister_id: CanisterId,\\n\\n wasm_module: Vec<u8>,\\n\\n) -> Result<(), String> {\\n\\n if wasm_module.is_empty() {\\n\\n return Err(\\\"Empty wasm module provided for canister installation\\\".to_string());\\n\\n }\\n\\n\\n\\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\\n\\n\\n\\n let install_code_args = InstallCodeArgs {\\n\\n mode: CanisterInstallMode::Install,\\n\\n canister_id: candid::Principal::try_from(canister_id.0)\\n\\n .expect(\\\"Failed to make principal from canister_id\\\"),\\n\\n wasm_module,\\n\",\n \"file_path\": \"src/canister_management.rs\",\n \"rank\": 29,\n \"score\": 34939.71467090449\n },\n {\n \"content\": \" arg: Vec::new(),\\n\\n compute_allocation: None,\\n\\n memory_allocation: None,\\n\\n };\\n\\n\\n\\n match ic_cdk::call_no_return(management_canister, \\\"install_code\\\", Some(install_code_args)).await\\n\\n {\\n\\n Ok(res) => res,\\n\\n Err(err) => {\\n\\n ic_cdk::println!(\\\"Error invoking install_code: {:?} {}\\\", err.0, err.1);\\n\\n return Err(err.1);\\n\\n }\\n\\n };\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\npub async fn subnet_raw_rand() -> Result<Vec<u8>, String> {\\n\\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\\n\\n let rnd_buffer: Vec<u8> = match ic_cdk::call(management_canister, \\\"raw_rand\\\", Some(())).await {\\n\",\n \"file_path\": \"src/canister_management.rs\",\n \"rank\": 30,\n \"score\": 34935.72693846325\n },\n {\n \"content\": \" Ok(result) => result,\\n\\n Err(err) => {\\n\\n ic_cdk::println!(\\\"Error invoking raw_rand: {:?} {}\\\", err.0, err.1);\\n\\n return Err(err.1);\\n\\n }\\n\\n };\\n\\n\\n\\n Ok(rnd_buffer.to_vec())\\n\\n}\\n\",\n \"file_path\": \"src/canister_management.rs\",\n \"rank\": 31,\n \"score\": 34930.36736215424\n },\n {\n \"content\": \"#[query]\\n\\nfn used_bytes() -> u64 {\\n\\n let search = storage::get::<SearchIndexer>();\\n\\n\\n\\n search.used_bytes() as u64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bigmap_search.rs\",\n \"rank\": 32,\n \"score\": 31252.303046017067\n },\n {\n \"content\": \"#[query]\\n\\nfn used_bytes(_: ()) -> u64 {\\n\\n let bm_data = storage::get::<DataBucket>();\\n\\n\\n\\n bm_data.used_bytes() as u64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bigmap_data.rs\",\n \"rank\": 33,\n \"score\": 31252.303046017067\n },\n {\n \"content\": \"#[update]\\n\\nfn set_used_bytes_threshold(threshold: u32) {\\n\\n let bigmap_idx = storage::get_mut::<BigmapIdx>();\\n\\n\\n\\n bigmap_idx.set_used_bytes_threshold(threshold);\\n\\n}\\n\\n\\n\\n#[update]\\n\\nasync fn maintenance() -> String {\\n\\n let bigmap_idx = storage::get_mut::<BigmapIdx>();\\n\\n\\n\\n bigmap_idx.maintenance().await\\n\\n}\\n\\n\\n\\n#[query]\\n\\nasync fn status() -> String {\\n\\n let bigmap_idx = storage::get::<BigmapIdx>();\\n\\n\\n\\n bigmap_idx.status().await\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bigmap_index.rs\",\n \"rank\": 34,\n \"score\": 28024.35773679214\n },\n {\n \"content\": \"const getCanister = (\\n\\n canisterName,\\n\\n host = DEFAULT_HOST,\\n\\n keypair = generateKeyPair()\\n\\n) => {\\n\\n const candid = eval(getCandid(canisterName));\\n\\n const canisterId = getCanisterId(canisterName);\\n\\n const principal = Principal.selfAuthenticating(keypair.publicKey);\\n\\n const config = { fetch, host, principal };\\n\\n if (credentials.name && credentials.password) {\\n\\n config.credentials = credentials;\\n\\n }\\n\\n const agent = new HttpAgent(config);\\n\\n agent.addTransform(makeNonceTransform());\\n\\n agent.addTransform(makeExpiryTransform(5 * 60 * 1000));\\n\\n agent.addTransform(makeAuthTransform(keypair));\\n\\n\\n\\n return makeActorFactory(candid)({ canisterId, agent });\\n\",\n \"file_path\": \"cli/bigmap_functions.js\",\n \"rank\": 35,\n \"score\": 27714.686949088544\n },\n {\n \"content\": \"const DATA_CANISTER_ACTORS = new Map(); // A map of CanisterId => DataCanisterActor\\n\",\n \"file_path\": \"cli/bigmap_functions.js\",\n \"rank\": 36,\n \"score\": 26792.259480966884\n },\n {\n \"content\": \"const getCanisterPath = (canisterName) => {\\n\\n return path.join(\\n\\n outputRoot,\\n\\n \\\"canisters\\\",\\n\\n canisterName\\n\\n );\\n\",\n \"file_path\": \"cli/bigmap_functions.js\",\n \"rank\": 37,\n \"score\": 26792.259480966884\n },\n {\n \"content\": \"const getCanisterId = (canisterName) => {\\n\\n const canisterIdsPath = networkName === 'local' ? outputRoot : '.';\\n\\n let manifest = JSON.parse(\\n\\n fs.readFileSync(path.resolve(canisterIdsPath, 'canister_ids.json'))\\n\\n );\\n\\n return manifest[canisterName][networkName];\\n\",\n \"file_path\": \"cli/bigmap_functions.js\",\n \"rank\": 38,\n \"score\": 26792.259480966884\n },\n {\n \"content\": \"const bigMapDataCanisterIdToActor = async (canisterId) => {\\n\\n let cacheLookup = DATA_CANISTER_ACTORS.get(canisterId);\\n\\n if (cacheLookup) {\\n\\n return cacheLookup;\\n\\n } else {\\n\\n let canisterActor = getBigMapDataActor(canisterId);\\n\\n DATA_CANISTER_ACTORS.set(canisterId, canisterActor);\\n\\n return canisterActor;\\n\\n }\\n\",\n \"file_path\": \"cli/bigmap_functions.js\",\n \"rank\": 39,\n \"score\": 24364.036174616827\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrHoldsKey = Box<dyn Fn(CanisterId, &Key) -> bool>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 40,\n \"score\": 24359.944581127264\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrList = Box<dyn Fn(CanisterId, &Key) -> Vec<Key>>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 41,\n \"score\": 24359.944581127264\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrRemoveFromSearchIndex = Box<dyn Fn(CanisterId, &Key)>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 42,\n \"score\": 24359.944581127264\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrAddToSearchIndex = Box<dyn Fn(CanisterId, &Key, &String)>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 43,\n \"score\": 23644.43069524631\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrDeleteEntries = Box<dyn Fn(CanisterId, &Vec<Vec<u8>>)>;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct BigmapIdx {\\n\\n idx: Vec<CanisterId>, // indirection for CanisterId, to avoid many copies of CanisterIds\\n\\n hash_ring: hashring_sha256::HashRing<CanisterPtr>,\\n\\n now_rebalancing_src_dst: Option<(CanisterPtr, CanisterPtr)>,\\n\\n is_maintenance_active: bool,\\n\\n creating_data_canister: bool,\\n\\n creating_search_canister: bool,\\n\\n batch_limit_bytes: u64,\\n\\n canister_available_queue: VecDeque<CanisterId>,\\n\\n used_bytes_threshold: u32,\\n\\n used_bytes_total: u64,\\n\\n search_canisters: Vec<CanisterId>,\\n\\n data_bucket_canister_wasm_binary: Vec<u8>,\\n\\n search_canister_wasm_binary: Vec<u8>,\\n\\n id: CanisterId,\\n\\n // Testing functions\\n\\n #[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 44,\n \"score\": 23644.43069524631\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrSearchKeysByQuery = Box<dyn Fn(CanisterId, &String) -> Vec<Key>>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 45,\n \"score\": 22969.750369522342\n },\n {\n \"content\": \"type DataBucketMap = Arc<RwLock<IndexMap<CanisterId, DataBucket>>>;\\n\\n\\n\\n#[actix_rt::test]\\n\\nasync fn bigmap_put_get() {\\n\\n // Insert key&value pairs and then get the value, and verify the correctness\\n\\n\\n\\n let num_data_canisters_initial = 11;\\n\\n\\n\\n let (mut bm_idx, db_map) = alloc_bigmap_index_and_data(num_data_canisters_initial).await;\\n\\n\\n\\n bm_idx.maintenance().await;\\n\\n\\n\\n for i in 0..1001 {\\n\\n let key = format!(\\\"key-{}\\\", i).into_bytes();\\n\\n let value = vec![(i % 256) as u8; 200_000];\\n\\n\\n\\n let can_data_id = bm_idx.lookup_put(&key).unwrap();\\n\\n assert_ne!(can_data_id, Default::default());\\n\\n db_map\\n\\n .write()\\n\",\n \"file_path\": \"src/index/tests.rs\",\n \"rank\": 46,\n \"score\": 22969.750369522342\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrSetRange = Box<dyn Fn(CanisterId, Sha256Digest, Sha256Digest)>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 47,\n \"score\": 22969.750369522342\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrBatchAddToSearchIndex = Box<dyn Fn(CanisterId, &Vec<(Key, String)>) -> u64>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 48,\n \"score\": 21729.663305807844\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrPutRelocationBatch = Box<dyn Fn(CanisterId, &Vec<(Sha2Vec, Key, Val)>) -> u64>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 49,\n \"score\": 21158.512186873566\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\ntype FnPtrGetRelocationBatch = Box<dyn Fn(CanisterId, u64) -> Vec<(Sha2Vec, Key, Val)>>;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 50,\n \"score\": 21158.512186873566\n },\n {\n \"content\": \"// pub type CanisterId = u64;\\n\\nuse crate::data::DataBucket;\\n\\nuse crate::index::BigmapIdx;\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse std::convert::From;\\n\\n\\n\\n#[derive(Clone, Default, Hash, Serialize, Deserialize, candid::CandidType, Eq, PartialEq)]\\n\\n#[repr(transparent)]\\n\\npub struct CanisterId(pub Vec<u8>);\\n\\n\\n\\nimpl From<DataBucket> for CanisterId {\\n\\n fn from(item: DataBucket) -> Self {\\n\\n Self {\\n\\n 0: item.canister_id().0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u64> for CanisterId {\\n\\n fn from(item: u64) -> Self {\\n\",\n \"file_path\": \"src/lib_native.rs\",\n \"rank\": 51,\n \"score\": 14.097668457289203\n },\n {\n \"content\": \"// pub type CanisterId = Vec<u8>;\\n\\nuse crate::data::DataBucket;\\n\\nuse crate::index::BigmapIdx;\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse std::convert::From;\\n\\n\\n\\n#[derive(Clone, Default, Hash, Serialize, Deserialize, candid::CandidType, Eq, PartialEq)]\\n\\n#[repr(transparent)]\\n\\npub struct CanisterId(pub Vec<u8>);\\n\\n\\n\\nimpl From<DataBucket> for CanisterId {\\n\\n fn from(item: DataBucket) -> Self {\\n\\n Self {\\n\\n 0: item.canister_id().0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<BigmapIdx> for CanisterId {\\n\\n fn from(item: BigmapIdx) -> Self {\\n\",\n \"file_path\": \"src/lib_wasm32.rs\",\n \"rank\": 52,\n \"score\": 13.91946524104262\n },\n {\n \"content\": \"\\n\\n let hr_idx = self\\n\\n .hash_ring\\n\\n .get_idx_key_node_for_node(&ptr_new)\\n\\n .unwrap()\\n\\n .0;\\n\\n self.hash_ring.get_key_range_for_idx(hr_idx)\\n\\n }\\n\\n\\n\\n pub fn set_used_bytes_threshold(&mut self, used_bytes_threshold: u32) {\\n\\n self.used_bytes_threshold = used_bytes_threshold;\\n\\n }\\n\\n\\n\\n pub fn set_canister_id(&mut self, can_id: CanisterId) {\\n\\n self.id = can_id\\n\\n }\\n\\n\\n\\n pub fn canister_id(&self) -> CanisterId {\\n\\n self.id.clone()\\n\\n }\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 53,\n \"score\": 11.041675890628616\n },\n {\n \"content\": \"mod canister_management;\\n\\npub use canister_management::{\\n\\n subnet_create_new_canister, subnet_install_canister_code, subnet_raw_rand,\\n\\n};\\n\\n\\n\\n#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\nmod lib_native;\\n\\n#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\npub use lib_native::*;\\n\\n\\n\\npub type Key = Vec<u8>;\\n\\npub type Val = Vec<u8>;\\n\\npub type Sha2Vec = Vec<u8>;\\n\\n\\n\\npub type Sha256Digest = GenericArray<u8, <Sha256 as Digest>::OutputSize>;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 54,\n \"score\": 10.869855589151026\n },\n {\n \"content\": \" pub fn used_bytes(&self) -> usize {\\n\\n // We use DataBucket with BTreeMap, and the size is precalculated\\n\\n // For DataBucket configuration with HashMap, usage can be calculated as:\\n\\n // (key_size + value_size + 8) bytes * 1.1\\n\\n // https://github.com/servo/servo/issues/6908\\n\\n self.used_bytes\\n\\n }\\n\\n\\n\\n pub fn canister_id(&self) -> CanisterId {\\n\\n self.id.clone()\\n\\n }\\n\\n\\n\\n pub fn set_canister_id(&mut self, can_id: CanisterId) {\\n\\n self.id = can_id\\n\\n }\\n\\n\\n\\n pub fn get_key_hash_range(&self) -> Option<(Sha256Digest, Sha256Digest)> {\\n\\n match (self.entries.keys().min(), self.entries.keys().max()) {\\n\\n (Some(min), Some(max)) => Some((*min, *max)),\\n\\n _ => None,\\n\",\n \"file_path\": \"src/data.rs\",\n \"rank\": 55,\n \"score\": 10.23702809853589\n },\n {\n \"content\": \"\\n\\n for can_id in self.search_canisters.iter() {\\n\\n let used_bytes = self.qcall_canister_used_bytes(can_id).await as u32;\\n\\n self.used_bytes_total += used_bytes as u64;\\n\\n }\\n\\n\\n\\n println!(\\\"Total capacity used {}\\\", ByteSize(self.used_bytes_total));\\n\\n\\n\\n self.is_maintenance_active = false;\\n\\n\\n\\n serde_json_wasm::to_string(&Status {\\n\\n status: \\\"Good\\\",\\n\\n message: \\\"Finished maintenance\\\",\\n\\n })\\n\\n .unwrap()\\n\\n }\\n\\n\\n\\n pub async fn status(&self) -> String {\\n\\n #[derive(serde::Serialize, Default)]\\n\\n struct DataBucketStatus {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 56,\n \"score\": 9.260298260637123\n },\n {\n \"content\": \"use crate::{calc_sha256, sha256_digest_from_vec, CanisterId, Key, Sha256Digest, Sha2Vec, Val};\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\nuse ic_cdk::println;\\n\\nuse std::collections::BTreeMap;\\n\\n// use std::hash::{BuildHasherDefault, Hash, Hasher};\\n\\n// use wyhash::WyHash;\\n\\n\\n\\n// pub type DetHashMap<K, V> = HashMap<K, V, BuildHasherDefault<WyHash>>;\\n\\n\\n\\n#[derive(Clone, Debug, Default)]\\n\\npub struct DataBucket {\\n\\n pub entries: BTreeMap<Sha256Digest, (Key, Val)>, // Can be DetHashMap\\n\\n range_start: Sha256Digest, // This DataBucket holds entries\\n\\n range_end: Sha256Digest, // in [range_start..range_end]\\n\\n used_bytes: usize,\\n\\n bytes_to_send: usize,\\n\\n id: CanisterId,\\n\\n}\\n\\n\\n\\n#[allow(dead_code)]\\n\",\n \"file_path\": \"src/data.rs\",\n \"rank\": 57,\n \"score\": 8.81740889303152\n },\n {\n \"content\": \" | Canister | +------->---------------+\\n\\n +-------+-------+ | +--------------+\\n\\n ^ | | BigMap Data |\\n\\n | +------->+ Bucket Can. |\\n\\n | | +--------------+\\n\\n +-------+-------+ | +--------------+\\n\\n | BigMap client +---------+--------+ BigMap Data |\\n\\n | App Canister | | Bucket Can. |\\n\\n +---------------+ +--------------+\\n\\n .\\n\\n .\\n\\n .\\n\\n\\n\\n********************************************************************/\\n\\n\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\nmod lib_wasm32;\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\npub use lib_wasm32::*;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 58,\n \"score\": 8.757752914151155\n },\n {\n \"content\": \"use crate::dfn_core;\\n\\nuse candid::de::IDLDeserialize;\\n\\nuse candid::CandidType;\\n\\nuse serde::de::DeserializeOwned;\\n\\n\\n\",\n \"file_path\": \"src/dfn_candid.rs\",\n \"rank\": 59,\n \"score\": 8.674267525782042\n },\n {\n \"content\": \" println!(\\\"Error adding canisters: {}\\\", err);\\n\\n }\\n\\n }\\n\\n\\n\\n fn print_canister_utilization(&self, can_id: &CanisterId, used_bytes: u64) {\\n\\n println!(\\n\\n \\\"CanisterId {} used {}\\\",\\n\\n can_id.clone(),\\n\\n ByteSize(used_bytes)\\n\\n );\\n\\n }\\n\\n\\n\\n // Returns a randomly generated and unused key\\n\\n pub async fn get_random_key(&self) -> String {\\n\\n let time_bytes = ic_cdk::time().to_be_bytes();\\n\\n let mut rand_key = calc_sha256(&time_bytes.to_vec());\\n\\n for i in 0..100u32 {\\n\\n // Only try this a limited number of times\\n\\n let rand_key_hash = calc_sha256(&rand_key);\\n\\n let (_, can_ptr) = match self.hash_ring.get_idx_node_for_key(&rand_key_hash) {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 60,\n \"score\": 8.493807813095419\n },\n {\n \"content\": \"// Load the allocator\\n\\ncfg_if::cfg_if! {\\n\\n // When the `wee_alloc` feature is enabled, use `wee_alloc` as the global\\n\\n // allocator.\\n\\n if #[cfg(feature = \\\"wee_alloc\\\")] {\\n\\n use wee_alloc;\\n\\n #[global_allocator]\\n\\n static ALLOC: wee_alloc::WeeAlloc<'_> = wee_alloc::WeeAlloc::INIT;\\n\\n }\\n\\n}\\n\\n\\n\\n// use futures::{CallFuture, RefCounted};\\n\\nuse std::{cell::RefCell, future::Future};\\n\\n\\n\\n#[derive(PartialEq, Clone, Eq)]\\n\\n#[repr(transparent)]\\n\\npub struct CanisterId(pub Vec<u8>);\\n\\n\\n\\n#[allow(dead_code)]\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 61,\n \"score\": 8.40824401789871\n },\n {\n \"content\": \" let used_bytes = self.qcall_canister_used_bytes(can_id).await as u32;\\n\\n status.data_buckets.push(DataBucketStatus {\\n\\n canister_id: can_id.to_string(),\\n\\n used_bytes,\\n\\n });\\n\\n status.used_bytes_total += used_bytes as u64;\\n\\n }\\n\\n\\n\\n for can_id in self.search_canisters.iter() {\\n\\n let used_bytes = self.qcall_canister_used_bytes(can_id).await as u32;\\n\\n status.search_canisters.push(SearchCanisterStatus {\\n\\n canister_id: can_id.to_string(),\\n\\n used_bytes,\\n\\n });\\n\\n status.used_bytes_total += used_bytes as u64;\\n\\n }\\n\\n\\n\\n serde_json_wasm::to_string(&status).unwrap()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 62,\n \"score\": 8.398953566083344\n },\n {\n \"content\": \"\\n\\n self.print_canister_utilization(&can_id, used_bytes);\\n\\n\\n\\n if used_bytes as u32 > self.used_bytes_threshold {\\n\\n println!(\\n\\n \\\"BigMap Index: CanisterId {} used bytes {} is over threshold {}\\\",\\n\\n can_id, used_bytes, self.used_bytes_threshold\\n\\n );\\n\\n\\n\\n // This canister should be rebalanced. We'll do these steps:\\n\\n // - Create destination canister, to which half of the data from the source canister will go\\n\\n // - Move batches of objects from source canister to the destination canister\\n\\n // We're just starting to rebalance, create the destination canister\\n\\n let src_canister_ptr = can_ptr.clone();\\n\\n let src_canister = self.can_ptr_to_canister_id(&src_canister_ptr);\\n\\n let dst_canister = self\\n\\n .create_data_bucket_canister()\\n\\n .await\\n\\n .expect(\\\"create_data_bucket_canister failed\\\");\\n\\n\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 63,\n \"score\": 8.310365502134749\n },\n {\n \"content\": \"/// A reference counter wrapper we use with the CallFuture.\\n\\n/// This is required, because the future we return from the `call` method can\\n\\n/// either have two owners (the callback closure and the canister runtime) if\\n\\n/// the underlying system call succeeded, or just one (the canister runtime) it\\n\\n/// the system call failed.\\n\\npub struct RefCounted<T>(Rc<RefCell<T>>);\\n\\n\\n\\nimpl<T> RefCounted<T> {\\n\\n pub fn new(val: T) -> Self {\\n\\n RefCounted(Rc::new(RefCell::new(val)))\\n\\n }\\n\\n pub fn into_raw(self) -> *const RefCell<T> {\\n\\n Rc::into_raw(self.0)\\n\\n }\\n\\n pub unsafe fn from_raw(ptr: *const RefCell<T>) -> Self {\\n\\n Self(Rc::from_raw(ptr))\\n\\n }\\n\\n pub fn borrow_mut(&self) -> RefMut<'_, T> {\\n\\n self.0.borrow_mut()\\n\\n }\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 64,\n \"score\": 7.947398159275512\n },\n {\n \"content\": \" canister_id: String,\\n\\n used_bytes: u32,\\n\\n };\\n\\n\\n\\n #[derive(serde::Serialize, Default)]\\n\\n struct SearchCanisterStatus {\\n\\n canister_id: String,\\n\\n used_bytes: u32,\\n\\n };\\n\\n\\n\\n #[derive(serde::Serialize, Default)]\\n\\n struct Status {\\n\\n data_buckets: Vec<DataBucketStatus>,\\n\\n search_canisters: Vec<SearchCanisterStatus>,\\n\\n used_bytes_total: u64,\\n\\n };\\n\\n\\n\\n let mut status = Status::default();\\n\\n\\n\\n for can_id in self.idx.iter() {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 65,\n \"score\": 7.6142607316905915\n },\n {\n \"content\": \"use digest::generic_array::GenericArray;\\n\\nuse sha2::{Digest, Sha256};\\n\\npub mod data;\\n\\npub(crate) mod hashring;\\n\\n#[allow(dead_code)]\\n\\npub(crate) mod hashring_sha256;\\n\\npub mod index;\\n\\npub mod search;\\n\\n\\n\\n/********************************************************************\\n\\n ____ _ __ __\\n\\n + __ )(_) __ _ + \\\\/ + __ _ _ __\\n\\n | _ \\\\+ +/ _` + | +\\\\/+ |/ _` + '_ \\\\\\n\\n | +_) | | (_+ | | | | | (_+ | +_) +\\n\\n +____/+_+\\\\__, + +_+ +_+\\\\__,_| .__/\\n\\n +___/ +_+\\n\\n Application architecture\\n\\n +--------------+\\n\\n +---------------+ | BigMap Data |\\n\\n | BigMap Index | | Bucket Can. |\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 66,\n \"score\": 7.593805773222115\n },\n {\n \"content\": \" self.is_maintenance_active = true;\\n\\n\\n\\n if let Err(_) = self.ensure_at_least_one_data_canister().await {\\n\\n self.is_maintenance_active = false;\\n\\n return serde_json_wasm::to_string(&Status {\\n\\n status: \\\"Unknown\\\",\\n\\n message: \\\"Error trying to ensure at least one data canister\\\",\\n\\n })\\n\\n .unwrap();\\n\\n }\\n\\n\\n\\n println!(\\\"BigMap Index: starting maintenance\\\");\\n\\n\\n\\n self.used_bytes_total = 0;\\n\\n\\n\\n for i in 0..self.idx.len() {\\n\\n let can_id = self.idx[i].clone();\\n\\n let can_ptr = CanisterPtr { 0: i as u32 };\\n\\n let used_bytes = self.qcall_canister_used_bytes(&can_id).await as u64;\\n\\n self.used_bytes_total += used_bytes;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 67,\n \"score\": 7.494689608432236\n },\n {\n \"content\": \"use crate::{\\n\\n calc_sha256, hashring_sha256, subnet_create_new_canister, subnet_install_canister_code,\\n\\n CanisterId, Key, Sha256Digest, Sha2Vec, Val,\\n\\n};\\n\\nuse bytesize::ByteSize;\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\nuse ic_cdk::println;\\n\\nuse std::collections::{BTreeSet, HashMap, HashSet, VecDeque};\\n\\nuse std::hash::BuildHasherDefault;\\n\\nuse wyhash::WyHash;\\n\\n\\n\\n// CanisterPtr allows us to have u64 instead of a full CanisterId\\n\\n// in various parts of the BigMap Index\\n\\n#[derive(Copy, Clone, Default, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 68,\n \"score\": 7.486899396986052\n },\n {\n \"content\": \"///////////////////////////////////////////////////////////////\\n\\n// Consistent Hash implementation, based on the HashRing crate\\n\\n// https://github.com/jeromefroe/hashring-rs/\\n\\n// but using SHA-256 for keys\\n\\n///////////////////////////////////////////////////////////////\\n\\nuse crate::Sha256Digest;\\n\\nuse num_bigint::BigUint;\\n\\nuse std::cmp::Ordering;\\n\\n\\n\\n// Node is an internal struct used to encapsulate the nodes that will be added\\n\\n// and removed from `HashRing`\\n\\n#[derive(Debug, Clone)]\\n\\npub(crate) struct Node<T: Clone> {\\n\\n pub(crate) key: Sha256Digest,\\n\\n pub(crate) node: T,\\n\\n}\\n\\n\\n\\nimpl<T: Clone> Node<T> {\\n\\n fn new(key: Sha256Digest, node: T) -> Node<T> {\\n\\n Node { key, node }\\n\",\n \"file_path\": \"src/hashring_sha256.rs\",\n \"rank\": 69,\n \"score\": 7.144214397634398\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn set_fn_ptr_used_bytes(&mut self, fn_ptr: FnPtrUsedBytes) {\\n\\n self.fn_ptr_used_bytes = Some(fn_ptr);\\n\\n }\\n\\n\\n\\n pub fn set_fn_ptr_set_range(&mut self, fn_ptr: FnPtrSetRange) {\\n\\n self.fn_ptr_set_range = Some(fn_ptr);\\n\\n }\\n\\n\\n\\n pub fn set_fn_ptr_list(&mut self, fn_ptr: FnPtrList) {\\n\\n self.fn_ptr_list = Some(fn_ptr);\\n\\n }\\n\\n\\n\\n pub fn set_fn_ptr_holds_key(&mut self, fn_ptr: FnPtrHoldsKey) {\\n\\n self.fn_ptr_holds_key = Some(fn_ptr);\\n\\n }\\n\\n\\n\\n pub fn set_fn_ptr_get_relocation_batch(&mut self, fn_ptr: FnPtrGetRelocationBatch) {\\n\\n self.fn_ptr_get_relocation_batch = Some(fn_ptr);\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 70,\n \"score\": 6.935499123472125\n },\n {\n \"content\": \"use crate::data::DataBucket;\\n\\nuse crate::index::BigmapIdx;\\n\\nuse crate::{CanisterId, Key, Sha256Digest, Sha2Vec, Val};\\n\\nuse indexmap::IndexMap;\\n\\nuse std::collections::BTreeSet;\\n\\nuse std::sync::{Arc, RwLock};\\n\\n// use std::time::Instant;\\n\\n\\n\",\n \"file_path\": \"src/index/tests.rs\",\n \"rank\": 71,\n \"score\": 6.863659161145174\n },\n {\n \"content\": \" fn_ptr(can_id.clone(), key)\\n\\n }\\n\\n\\n\\n async fn qcall_s_can_search_keys_by_query(\\n\\n &self,\\n\\n can_id: &CanisterId,\\n\\n search_query: &String,\\n\\n ) -> Vec<Key> {\\n\\n let fn_ptr = self\\n\\n .fn_ptr_search_keys_by_query\\n\\n .as_ref()\\n\\n .expect(\\\"fn_ptr_search_keys_by_query is not set\\\");\\n\\n fn_ptr(can_id.clone(), search_query)\\n\\n }\\n\\n\\n\\n async fn qcall_canister_used_bytes(&self, can_id: &CanisterId) -> usize {\\n\\n let fn_ptr = self\\n\\n .fn_ptr_used_bytes\\n\\n .as_ref()\\n\\n .expect(\\\"fn_ptr_used_bytes is not set\\\");\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 72,\n \"score\": 6.8051680143943205\n },\n {\n \"content\": \" .await\\n\\n .expect(\\\"list call failed\\\")\\n\\n }\\n\\n\\n\\n async fn qcall_canister_used_bytes(&self, can_id: &CanisterId) -> usize {\\n\\n ic_cdk::call(can_id.clone().0.into(), \\\"used_bytes\\\", Some(()))\\n\\n .await\\n\\n .expect(\\\"used_bytes call failed\\\")\\n\\n }\\n\\n\\n\\n async fn qcall_dcan_holds_key(&self, can_id: &CanisterId, key: &Key) -> bool {\\n\\n ic_cdk::call(can_id.clone().0.into(), \\\"holds_key\\\", Some(key))\\n\\n .await\\n\\n .expect(\\\"holds_key call failed\\\")\\n\\n }\\n\\n\\n\\n async fn ucall_dcan_set_range(\\n\\n &self,\\n\\n can_id: &CanisterId,\\n\\n range_start: Sha256Digest,\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 73,\n \"score\": 6.79220862863693\n },\n {\n \"content\": \" let can_id = CanisterId::from(i);\\n\\n db_map\\n\\n .write()\\n\\n .unwrap()\\n\\n .insert(can_id.clone(), DataBucket::new(can_id));\\n\\n }\\n\\n\\n\\n let db_map_ref = db_map.clone();\\n\\n let fn_ptr_used_bytes = move |can_id: CanisterId| {\\n\\n db_map_ref\\n\\n .read()\\n\\n .unwrap()\\n\\n .get(&can_id)\\n\\n .unwrap()\\n\\n .used_bytes()\\n\\n };\\n\\n bm_idx.set_fn_ptr_used_bytes(Box::new(fn_ptr_used_bytes));\\n\\n\\n\\n let db_map_ref = db_map.clone();\\n\\n let fn_ptr_holds_key = move |can_id: CanisterId, key: &Key| {\\n\",\n \"file_path\": \"src/index/tests.rs\",\n \"rank\": 74,\n \"score\": 6.785556427147117\n },\n {\n \"content\": \" \\\"CanisterId {}: code install failed with error {}\\\",\\n\\n new_can_id, err\\n\\n ),\\n\\n };\\n\\n Ok(new_can_id)\\n\\n }\\n\\n Err(err) => Err(err),\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn set_data_bucket_canister_wasm_binary(&mut self, wasm_binary: Vec<u8>) {\\n\\n self.data_bucket_canister_wasm_binary = wasm_binary;\\n\\n if let Err(err) = self.ensure_at_least_one_data_canister().await {\\n\\n println!(\\\"Error adding canisters: {}\\\", err);\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn set_search_canister_wasm_binary(&mut self, wasm_binary: Vec<u8>) {\\n\\n self.search_canister_wasm_binary = wasm_binary;\\n\\n if let Err(err) = self.ensure_at_least_one_search_canister().await {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 75,\n \"score\": 6.678816079614915\n },\n {\n \"content\": \"// Full Text Search\\n\\n// Input: (doc_id: Vec<u8>, document: String)\\n\\n//\\n\\n// Steps:\\n\\n// - Split string into tokens,\\n\\n// - Normalize tokens,\\n\\n// - Get or assign a unique ID for each token,\\n\\n// -\\n\\n\\n\\nuse lazy_static::lazy_static;\\n\\nuse regex::Regex;\\n\\nuse roaring::RoaringBitmap;\\n\\nuse rust_stemmers::{Algorithm, Stemmer};\\n\\nuse std::collections::{HashMap, HashSet};\\n\\nuse std::hash::BuildHasherDefault;\\n\\nuse wyhash::WyHash;\\n\\n\\n\\npub type DetHashMap<K, V> = HashMap<K, V, BuildHasherDefault<WyHash>>;\\n\\npub type DetHashSet<K> = HashSet<K, BuildHasherDefault<WyHash>>;\\n\\n\\n\\n// #[cfg(target_arch = \\\"wasm32\\\")]\\n\\n// use ic_cdk::println;\\n\\n\\n\\nuse crate::Key;\\n\\n\\n\\n// Roaring Bitmaps only support 32-bit integers\\n\",\n \"file_path\": \"src/search.rs\",\n \"rank\": 76,\n \"score\": 6.591251073216856\n },\n {\n \"content\": \"mod ic0 {\\n\\n #[link(wasm_import_module = \\\"ic0\\\")]\\n\\n extern \\\"C\\\" {\\n\\n pub fn canister_self_copy(dst: u32, offset: u32, size: u32) -> ();\\n\\n pub fn canister_self_size() -> u32;\\n\\n pub fn debug_print(offset: u32, size: u32) -> ();\\n\\n pub fn msg_arg_data_copy(dst: u32, offset: u32, size: u32) -> ();\\n\\n pub fn msg_arg_data_size() -> u32;\\n\\n pub fn msg_caller_copy(dst: u32, offset: u32, size: u32) -> ();\\n\\n pub fn msg_caller_size() -> u32;\\n\\n pub fn msg_reject(src: u32, size: u32) -> ();\\n\\n pub fn msg_reject_code() -> i32;\\n\\n pub fn msg_reject_msg_copy(dst: u32, offset: u32, size: u32) -> ();\\n\\n pub fn msg_reject_msg_size() -> u32;\\n\\n pub fn msg_reply() -> ();\\n\\n pub fn msg_reply_data_append(offset: u32, size: u32) -> ();\\n\\n pub fn trap(offset: u32, size: u32) -> ();\\n\\n pub fn call_simple(\\n\\n callee_src: u32,\\n\\n callee_size: u32,\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 77,\n \"score\": 6.482820274497623\n },\n {\n \"content\": \" .expect(&format!(\\n\\n \\\"BigMap index: append call to CanisterId {} failed\\\",\\n\\n can_id\\n\\n ))\\n\\n }\\n\\n None => {\\n\\n println!(\\n\\n \\\"BigMap Index: no data canister suitable for key {}\\\",\\n\\n String::from_utf8_lossy(&key)\\n\\n );\\n\\n 0\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn can_ptr_to_canister_id(&self, can_ptr: &CanisterPtr) -> CanisterId {\\n\\n self.idx[can_ptr.0 as usize].clone()\\n\\n }\\n\\n\\n\\n pub async fn add_canisters(&mut self, can_ids: Vec<CanisterId>) {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 78,\n \"score\": 6.390138090635031\n },\n {\n \"content\": \" unsafe { Pin::new_unchecked(&mut *self.0.borrow_mut()) }.poll(ctx)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Clone for RefCounted<T> {\\n\\n fn clone(&self) -> Self {\\n\\n RefCounted(Rc::clone(&self.0))\\n\\n }\\n\\n}\\n\\n\\n\\n/// The result type of the CallFuture.\\n\\npub(super) type FutureResult = Result<Vec<u8>, (i32, String)>;\\n\\n\\n\\n/// The Future trait implemenation, returned by the asynchronous inter-canister\\n\\n/// call.\\n\\n#[derive(Default)]\\n\\npub(super) struct CallFuture {\\n\\n /// result of the canister call\\n\\n pub result: Option<FutureResult>,\\n\\n /// waker (callback)\\n\",\n \"file_path\": \"src/dfn_futures.rs\",\n \"rank\": 79,\n \"score\": 6.333373510240887\n },\n {\n \"content\": \" println!(\\\"BigMap Index: Created Data CanisterId {}\\\", can_id);\\n\\n\\n\\n // Add all canisters to the available queue\\n\\n self.canister_available_queue.push_back(can_id);\\n\\n }\\n\\n\\n\\n if let Err(err) = self.ensure_at_least_one_data_canister().await {\\n\\n self.is_maintenance_active = false;\\n\\n println!(\\\"Error adding canisters: {}\\\", err);\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn ensure_at_least_one_data_canister(&mut self) -> Result<(), String> {\\n\\n if self.hash_ring.is_empty() {\\n\\n if self.creating_data_canister {\\n\\n return Err(\\n\\n \\\"Already creating data canister, concurrent calls are not allowed\\\".to_string(),\\n\\n );\\n\\n }\\n\\n self.creating_data_canister = true;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 80,\n \"score\": 6.130776891392326\n },\n {\n \"content\": \" fn_ptr_delete_entries: Option<FnPtrDeleteEntries>,\\n\\n}\\n\\n\\n\\n#[allow(dead_code)]\\n\\nimpl BigmapIdx {\\n\\n pub fn new() -> Self {\\n\\n let mut result: BigmapIdx = BigmapIdx::default();\\n\\n result.reset();\\n\\n result\\n\\n }\\n\\n\\n\\n pub fn reset(&mut self) {\\n\\n *self = Self {\\n\\n used_bytes_threshold: 3 * 1024 * 1024 * 1024,\\n\\n batch_limit_bytes: 1024 * 1024,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn get(&self, key: &Key) -> Option<Val> {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 81,\n \"score\": 6.0156338085687295\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn used_bytes(&self) -> usize {\\n\\n std::mem::size_of_val(self)\\n\\n }\\n\\n\\n\\n fn normalize_to_string(&self, input: &str) -> String {\\n\\n String::from(self.stemmer.stem(&input.to_lowercase()))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"src/search.rs\",\n \"rank\": 82,\n \"score\": 5.97172633989585\n },\n {\n \"content\": \"\\n\\n /// Get the Option<node> at position `idx - 1`.\\n\\n /// Returns `None` if `idx - 1` is out of bounds\\n\\n pub fn get_prev_key_node_at_idx(&self, idx: usize) -> Option<(Sha256Digest, &T)> {\\n\\n if idx < 1 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n match self.get_key_node_at_idx(idx - 1) {\\n\\n Some(e) => Some(e),\\n\\n None => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::biguint_to_sha256_digest;\\n\\n use super::BigUint;\\n\\n use super::HashRing;\\n\",\n \"file_path\": \"src/hashring_sha256.rs\",\n \"rank\": 83,\n \"score\": 5.9496293991490266\n },\n {\n \"content\": \" println!(\\\"BigMap Index: No Data Canisters, creating one!\\\");\\n\\n match self.create_data_bucket_canister().await {\\n\\n Ok(can_id) => {\\n\\n println!(\\\"BigMap Index: Activating Data CanisterId {}\\\", can_id);\\n\\n\\n\\n let range = self.hash_ring_add_canister_id(&can_id);\\n\\n self.ucall_dcan_set_range(&can_id, range.0, range.1).await;\\n\\n }\\n\\n Err(err) => {\\n\\n println!(\\\"BigMap Index: Error creating a new Data Canister {}\\\", err);\\n\\n }\\n\\n }\\n\\n self.creating_data_canister = false;\\n\\n };\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn ensure_at_least_one_search_canister(&mut self) -> Result<(), String> {\\n\\n if self.search_canisters.is_empty() {\\n\\n if self.creating_search_canister {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 84,\n \"score\": 5.887993991980675\n },\n {\n \"content\": \"///////////////////////////////////////////////////////////////\\n\\n// Consistent Hash implementation, based on the HashRing crate\\n\\n// https://github.com/jeromefroe/hashring-rs/\\n\\n///////////////////////////////////////////////////////////////\\n\\nuse std::cmp::Ordering;\\n\\nuse std::hash::{BuildHasher, Hash, Hasher};\\n\\nuse wyhash::WyHash;\\n\\n\\n\\n#[derive(Debug, Default, Clone)]\\n\\npub struct WyHashBuilder;\\n\\n\\n\\nimpl BuildHasher for WyHashBuilder {\\n\\n type Hasher = WyHash;\\n\\n\\n\\n fn build_hasher(&self) -> Self::Hasher {\\n\\n WyHash::with_seed(3)\\n\\n }\\n\\n}\\n\\n\\n\\n// Node is an internal struct used to encapsulate the nodes that will be added\\n\",\n \"file_path\": \"src/hashring.rs\",\n \"rank\": 85,\n \"score\": 5.879382241114167\n },\n {\n \"content\": \"use super::{calc_sha256, CanisterId, DataBucket};\\n\\nuse crate::hashring_sha256::{SHA256_DIGEST_MAX, SHA256_DIGEST_MIN};\\n\\n\\n\\n#[actix_rt::test]\\n\\nasync fn bm_data_put_get() {\\n\\n // Insert key&value pairs and then get the value, and verify the correctness\\n\\n let mut d = DataBucket::new(CanisterId::from(42));\\n\\n d.set_range(&SHA256_DIGEST_MIN, &SHA256_DIGEST_MAX);\\n\\n for i in 0..100 as u8 {\\n\\n let key = format!(\\\"key-{}\\\", i).into_bytes();\\n\\n let value = vec![i; 200_000];\\n\\n\\n\\n d.put(&key, &value, false).expect(\\\"DataBucket put failed\\\");\\n\\n assert!(d.used_bytes() >= i as usize * 200_000);\\n\\n }\\n\\n\\n\\n for i in 0..100 as u8 {\\n\\n let key = format!(\\\"key-{}\\\", i).into_bytes();\\n\\n let value = vec![i; 200_000];\\n\\n\\n\",\n \"file_path\": \"src/data/tests.rs\",\n \"rank\": 86,\n \"score\": 5.814578232076362\n },\n {\n \"content\": \" }\\n\\n\\n\\n for can_id in self.search_canisters.iter() {\\n\\n self.ucall_s_can_remove_from_search_index(can_id, key).await\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn search(&self, search_query: &String) -> (u64, Vec<(Key, Val)>) {\\n\\n if self.search_canisters.is_empty() {\\n\\n return (0, Vec::new());\\n\\n }\\n\\n\\n\\n let mut results = Vec::new();\\n\\n let mut results_len = 0;\\n\\n\\n\\n for can_id in self.search_canisters.iter() {\\n\\n let results_per_canister = self\\n\\n .qcall_s_can_search_keys_by_query(can_id, search_query)\\n\\n .await;\\n\\n results_len += results_per_canister.len() as u64;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 87,\n \"score\": 5.801019580614045\n },\n {\n \"content\": \" // The destination canister doesn't have the key but it's currently rebalancing.\\n\\n // The key may not have been moved yet from the source canister\\n\\n\\n\\n let can_id = self.can_ptr_to_canister_id(&rebalance_dst_ptr);\\n\\n if self.qcall_dcan_holds_key(&can_id, key).await {\\n\\n println!(\\n\\n \\\"BigMap Index: lookup_get @key {} from a relocation destination {}\\\",\\n\\n String::from_utf8_lossy(key),\\n\\n can_id\\n\\n );\\n\\n return Some(can_id);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n None\\n\\n }\\n\\n\\n\\n // Find the data bucket canister into which the object with the provided key should go\\n\\n pub fn lookup_put(&self, key: &Key) -> Option<CanisterId> {\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 88,\n \"score\": 5.772658101326881\n },\n {\n \"content\": \"There are two major parts of the BigMap architecture: 1) Index canister, and 2) Data Bucket canisters. In the current implementation there is only one Index canister and there can be a large number of Data Bucket canisters, to which the Index canister has pointers.\\n\\n\\n\\nThe *Index* canister is implemented as a [Hash Ring](https://en.wikipedia.org/wiki/Consistent_hashing) for which the code is in [this Rust file](../src/hashring_sha256.rs). The implementation is based using a Rust vector with Sha256 hashing of keys and Canister Ids.\\n\\n\\n\\n<br>\\n\\n*Hash Ring with Sha256 hashing. Sha256 hashes are shortened to 8 characters to simplify the illustration. The full hash (32 bytes) is used in the implementation.*\\n\\n\\n\\nIn the illustration, the entry's hash is `b6cdd8c1`, and the Hash Ring does not have that exact value. To determine the Data Bucket CanisterId that handles the particular entry is: the Hash Ring is searched for the *first hash which is larger or equal to the entry's hash*. Since the Hash Ring holds `34f444af` as the first entry, that entry is skipped since it's less than `b6cdd8c1`). After that, the Hash Ring holds `bda57583` -- which is the first hash larger or equal to the entry's hash `b6cdd8c1`, and therefore it's determined that `CanId1` handles the entry. Note that Hash Ring is maintained in a sorted order and due to this it is possible to perform Hash Ring lookups with binary search. Therefore, Hash Ring lookups take approximately `log(N)` time for `N` entries (Data Bucket canisters).\\n\\n\\n\\nBeside the Index canister, there is a variable number of Data Bucket canisters. BigMap starts with a single Data Bucket canister and these canisters are added one at a time as the capacity of a Data Bucket canister is exhausted. The ultimate objective of the `User Agent` is to get data from or to store data at a Data Bucket canister. It can achieve this in two ways:\\n\\n\\n\\n1. By communicating through the BigMap Index, or\\n\\n2. By communicating directly with the Data Bucket canisters, and using the BigMap Index only for lookups.\\n\\n\\n\\nIn the following sections we describe these two options.\\n\\n\\n\",\n \"file_path\": \"docs/bigmap.md\",\n \"rank\": 89,\n \"score\": 5.768913110225878\n },\n {\n \"content\": \"//! This module contains all mechanisms required to enable asynchronous\\n\\n//! programming in Rust, based on native async Rust capabilities:\\n\\n//!\\n\\n//! - the future returned by the asynchronous System API call, and\\n\\n//! - the kickstarting/waker implementations to advance top level futures on\\n\\n//! every inter-canister callback call.\\n\\n\\n\\nuse std::{\\n\\n cell::{RefCell, RefMut},\\n\\n future::Future,\\n\\n pin::Pin,\\n\\n rc::Rc,\\n\\n task::{Context, Poll, Waker},\\n\\n};\\n\\n\\n\\n/// A reference counter wrapper we use with the CallFuture.\\n\\n/// This is required, because the future we return from the `call` method can\\n\\n/// either have two owners (the callback closure and the canister runtime) if\\n\\n/// the underlying system call succeeded, or just one (the canister runtime) it\\n\\n/// the system call failed.\\n\",\n \"file_path\": \"src/dfn_futures.rs\",\n \"rank\": 90,\n \"score\": 5.754992150174095\n },\n {\n \"content\": \"#[derive(Default)]\\n\\npub(super) struct CallFuture {\\n\\n /// result of the canister call\\n\\n pub result: Option<FutureResult>,\\n\\n /// waker (callback)\\n\\n pub waker: Option<Waker>,\\n\\n}\\n\\n\\n\\nimpl CallFuture {\\n\\n pub fn new() -> Self {\\n\\n CallFuture::default()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Future for CallFuture {\\n\\n type Output = FutureResult;\\n\\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\\n\\n if let Some(result) = self.result.take() {\\n\\n return Poll::Ready(result);\\n\\n }\\n\\n self.waker = Some(cx.waker().clone());\\n\\n Poll::Pending\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 91,\n \"score\": 5.737797716719763\n },\n {\n \"content\": \"# (opt vec { 4; 5; 6; })\\n\\n```\\n\\n\\n\\nIt is also possible to talk directly to the data bucket canisters, but this is likely only useful during development or debugging.\\n\\nIn this case it's necessary to know the CanisterId, which is printed in the replica debug logs during creation.\\n\\n\\n\\nFor example:\\n\\n```bash\\n\\ndfx canister call tup4c-ks6aa-aaaaa-aaaaa-aaaaa-aaaaa-aaaaa-q get '(vec { 97; 98; 99; })'\\n\\n# (null)\\n\\ndfx canister call tup4c-ks6aa-aaaaa-aaaaa-aaaaa-aaaaa-aaaaa-q put '(vec { 97; 98; 99; }, vec { 100; 101; 102; })'\\n\\n# ()\\n\\ndfx canister call tup4c-ks6aa-aaaaa-aaaaa-aaaaa-aaaaa-aaaaa-q get '(vec { 97; 98; 99; })'\\n\\n# (opt vec { 4; 5; 6; })\\n\\n```\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 92,\n \"score\": 5.707129795481315\n },\n {\n \"content\": \" name_src: u32,\\n\\n name_size: u32,\\n\\n reply_fun: usize,\\n\\n reply_env: u32,\\n\\n reject_fun: usize,\\n\\n reject_env: u32,\\n\\n data_src: u32,\\n\\n data_size: u32,\\n\\n ) -> i32;\\n\\n pub fn stable_size() -> u32;\\n\\n pub fn ic0_stable_grow(additional_pages: u32) -> i32;\\n\\n pub fn ic0_stable_read(dst: u32, offset: u32, size: u32) -> ();\\n\\n pub fn ic0_stable_write(offset: u32, src: u32, size: u32) -> ();\\n\\n }\\n\\n}\\n\\n\\n\\n/*\\n\\nThese stubs exist for when you're compiling this code not on a canister. If you\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 93,\n \"score\": 5.618737878868154\n },\n {\n \"content\": \" self.used_bytes -= 32; // for the Sha256 of the key (=32 bytes)\\n\\n }\\n\\n None => {}\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get(&self, key: Key) -> Result<&Val, String> {\\n\\n // println!(\\n\\n // \\\"BigMap Data: get {}\\\",\\n\\n // String::from_utf8_lossy(&key)\\n\\n // );\\n\\n let key_sha2 = calc_sha256(&key);\\n\\n match self.entries.get(&key_sha2) {\\n\\n Some((_, v)) => Ok(v),\\n\\n None => Err(\\\"Entry not found\\\".to_string()),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn list(&self, key_prefix: &Key) -> Vec<Key> {\\n\",\n \"file_path\": \"src/data.rs\",\n \"rank\": 94,\n \"score\": 5.58247468700766\n },\n {\n \"content\": \" pub unsafe fn debug_print(_offset: u32, _size: u32) {\\n\\n wrong_arch(\\\"debug_print\\\")\\n\\n }\\n\\n pub unsafe fn msg_arg_data_copy(_dst: u32, _offset: u32, _size: u32) {\\n\\n wrong_arch(\\\"msg_arg_data_copy\\\")\\n\\n }\\n\\n pub unsafe fn msg_arg_data_size() -> u32 {\\n\\n wrong_arch(\\\"canister_self_copy\\\")\\n\\n }\\n\\n pub unsafe fn msg_caller_copy(_dst: u32, _offset: u32, _size: u32) {\\n\\n wrong_arch(\\\"msg_caller_copy\\\")\\n\\n }\\n\\n pub unsafe fn msg_caller_size() -> u32 {\\n\\n wrong_arch(\\\"msg_caller_size\\\")\\n\\n }\\n\\n pub unsafe fn msg_reject(_src: u32, _size: u32) {\\n\\n wrong_arch(\\\"msg_reject\\\")\\n\\n }\\n\\n pub unsafe fn msg_reject_code() -> i32 {\\n\\n wrong_arch(\\\"msg_reject_code\\\")\\n\",\n \"file_path\": \"src/dfn_core.rs\",\n \"rank\": 95,\n \"score\": 5.507571279895802\n },\n {\n \"content\": \"use ::bigmap::{index::BigmapIdx, CanisterId, Key, Val};\\n\\n#[cfg(target_arch = \\\"wasm32\\\")]\\n\\nuse ic_cdk::println;\\n\\nuse ic_cdk::storage;\\n\\nuse ic_cdk_macros::*;\\n\\n\\n\\n#[query]\\n\\nasync fn get(key: Key) -> Option<Val> {\\n\\n let bigmap_idx = storage::get::<BigmapIdx>();\\n\\n\\n\\n bigmap_idx.get(&key).await\\n\\n}\\n\\n\\n\\n#[update]\\n\\nasync fn put(key: Key, value: Val) -> u64 {\\n\\n let bigmap_idx = storage::get_mut::<BigmapIdx>();\\n\\n\\n\\n println!(\\\"BigMap Index: put key {}\\\", String::from_utf8_lossy(&key));\\n\\n\\n\\n bigmap_idx.put(&key, &value).await\\n\",\n \"file_path\": \"src/bigmap_index.rs\",\n \"rank\": 96,\n \"score\": 5.350625850631953\n },\n {\n \"content\": \"impl DataBucket {\\n\\n pub fn new(id: CanisterId) -> Self {\\n\\n // println!(\\\"BigMap Data {}: new\\\", id);\\n\\n Self {\\n\\n id,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_range(&mut self, range_start: &Sha256Digest, range_end: &Sha256Digest) {\\n\\n println!(\\n\\n \\\"BigMap Data: set_range {} .. {}\\\",\\n\\n hex::encode(range_start),\\n\\n hex::encode(range_end)\\n\\n );\\n\\n self.range_start = range_start.clone();\\n\\n self.range_end = range_end.clone();\\n\\n }\\n\\n\\n\\n pub fn is_in_range(&self, key_sha2: &Sha256Digest) -> bool {\\n\",\n \"file_path\": \"src/data.rs\",\n \"rank\": 97,\n \"score\": 5.322656424767349\n },\n {\n \"content\": \" Some(v) => v,\\n\\n None => return hex::encode(rand_key),\\n\\n };\\n\\n\\n\\n let can_id = self.can_ptr_to_canister_id(can_ptr);\\n\\n\\n\\n let key_is_used = self\\n\\n .qcall_dcan_holds_key(&can_id, &Vec::from(rand_key.as_slice()))\\n\\n .await;\\n\\n\\n\\n if !key_is_used {\\n\\n let result = hex::encode(rand_key);\\n\\n println!(\\n\\n \\\"get_random_key: after {} attempts found {} which maps to {}\\\",\\n\\n i, result, can_id\\n\\n );\\n\\n return result;\\n\\n }\\n\\n\\n\\n rand_key = rand_key_hash;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 98,\n \"score\": 5.30669293670331\n },\n {\n \"content\": \" .collect();\\n\\n\\n\\n self.batch_put(&batch_as_bytes).await;\\n\\n\\n\\n // FIXME: Ensure the search canister has enough space and allocate a new one if necessary\\n\\n let search_can_id = &self.search_canisters[0].clone();\\n\\n self.ucall_s_can_batch_add_to_search_index(&search_can_id, batch)\\n\\n .await;\\n\\n\\n\\n batch.len() as u64\\n\\n }\\n\\n\\n\\n pub async fn remove_from_fts_index(&mut self, key: &Key) {\\n\\n if let Err(err) = self.ensure_at_least_one_search_canister().await {\\n\\n println!(\\n\\n \\\"Error removing key {} => {}\\\",\\n\\n String::from_utf8_lossy(key),\\n\\n err\\n\\n );\\n\\n return;\\n\",\n \"file_path\": \"src/index.rs\",\n \"rank\": 99,\n \"score\": 5.2806497120673965\n }\n]","isConversational":false}}},{"rowIdx":1182,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/k8-client/src/client/config_rustls.rs"},"repo_name":{"kind":"string","value":"simlay/k8-api"},"commit":{"kind":"string","value":"3a69671c469c46757e489f4ab6919f6601e0e514"},"file_code":{"kind":"string","value":"use std::io::{Error as IoError, ErrorKind, Result as IoResult};\nuse std::net::ToSocketAddrs;\nuse std::path::Path;\nuse std::pin::Pin;\nuse std::sync::Arc;\nuse std::task::{Context, Poll};\n\nuse futures_util::future::Future;\nuse futures_util::io::{AsyncRead as StdAsyncRead, AsyncWrite as StdAsyncWrite};\nuse http::Uri;\nuse tracing::debug;\n\nuse hyper::client::connect::{Connected, Connection};\nuse hyper::service::Service;\nuse hyper::Body;\nuse hyper::Client;\nuse tokio::io::{AsyncRead, AsyncWrite, ReadBuf};\n\nuse fluvio_future::net::TcpStream;\nuse fluvio_future::rust_tls::{ConnectorBuilder, DefaultClientTlsStream, TlsConnector};\n\nuse super::executor::FluvioHyperExecutor;\nuse crate::cert::{ClientConfigBuilder, ConfigBuilder};\nuse crate::ClientError;\n\npub type HyperClient = Client<TlsHyperConnector, Body>;\n\npub type HyperConfigBuilder = ClientConfigBuilder<HyperClientBuilder>;\n\npub struct HyperTlsStream(DefaultClientTlsStream);\n\nimpl Connection for HyperTlsStream {\n fn connected(&self) -> Connected {\n Connected::new()\n }\n}\n\nimpl AsyncRead for HyperTlsStream {\n fn poll_read(\n mut self: Pin<&mut Self>,\n cx: &mut Context<'_>,\n buf: &mut ReadBuf<'_>,\n ) -> Poll<IoResult<()>> {\n match Pin::new(&mut self.0).poll_read(cx, buf.initialize_unfilled())? {\n Poll::Ready(bytes_read) => {\n buf.advance(bytes_read);\n Poll::Ready(Ok(()))\n }\n Poll::Pending => Poll::Pending,\n }\n }\n}\n\nimpl AsyncWrite for HyperTlsStream {\n fn poll_write(\n mut self: Pin<&mut Self>,\n cx: &mut Context<'_>,\n buf: &[u8],\n ) -> Poll<IoResult<usize>> {\n Pin::new(&mut self.0).poll_write(cx, buf)\n }\n\n fn poll_flush(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<IoResult<()>> {\n Pin::new(&mut self.0).poll_flush(cx)\n }\n\n fn poll_shutdown(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<IoResult<()>> {\n Pin::new(&mut self.0).poll_close(cx)\n }\n}\n\n#[derive(Clone)]\npub struct TlsHyperConnector(Arc<TlsConnector>);\n\nimpl TlsHyperConnector {\n fn new(connector: TlsConnector) -> Self {\n Self(Arc::new(connector))\n }\n}\n\nimpl Service<Uri> for TlsHyperConnector {\n type Response = HyperTlsStream;\n type Error = ClientError;\n\n type Future = Pin<Box<dyn Future<Output = Result<Self::Response, Self::Error>> + Send>>;\n\n fn poll_ready(&mut self, _: &mut Context<'_>) -> Poll<Result<(), Self::Error>> {\n Poll::Ready(Ok(()))\n }\n\n fn call(&mut self, uri: Uri) -> Self::Future {\n let connector = self.0.clone();\n\n Box::pin(async move {\n let host = match uri.host() {\n Some(h) => h,\n None => return Err(ClientError::Other(\"no host\".to_string())),\n };\n\n match uri.scheme_str() {\n Some(\"http\") => Err(ClientError::Other(\"http not supported\".to_string())),\n Some(\"https\") => {\n let socket_addr = {\n let host = host.to_string();\n let port = uri.port_u16().unwrap_or(443);\n match (host.as_str(), port).to_socket_addrs()?.next() {\n Some(addr) => addr,\n None => {\n return Err(ClientError::Other(format!(\n \"host resolution: {} failed\",\n host\n )))\n }\n }\n };\n debug!(\"socket address to: {}\", socket_addr);\n let tcp_stream = TcpStream::connect(&socket_addr).await?;\n\n let stream = connector.connect(host, tcp_stream).await.map_err(|err| {\n IoError::new(ErrorKind::Other, format!(\"tls handshake: {}\", err))\n })?;\n Ok(HyperTlsStream(stream))\n }\n scheme => Err(ClientError::Other(format!(\"{:?}\", scheme))),\n }\n })\n }\n}\n\npub struct HyperClientBuilder(ConnectorBuilder);\n\nimpl ConfigBuilder for HyperClientBuilder {\n type Client = HyperClient;\n\n fn new() -> Self {\n Self(ConnectorBuilder::new())\n }\n\n fn build(self) -> Result<Self::Client, ClientError> {\n let connector = self.0.build();\n\n Ok(Client::builder()\n .executor(FluvioHyperExecutor)\n .build::<_, Body>(TlsHyperConnector::new(connector)))\n }\n\n fn load_ca_certificate(self, ca_path: impl AsRef<Path>) -> Result<Self, IoError> {\n Ok(Self(self.0.load_ca_cert(ca_path)?))\n }\n\n fn load_client_certificate<P: AsRef<Path>>(\n self,\n client_crt_path: P,\n client_key_path: P,\n ) -> Result<Self, IoError> {\n Ok(Self(\n self.0.load_client_certs(client_crt_path, client_key_path)?,\n ))\n }\n}\n"},"prefix":{"kind":"string","value":"use std::io::{Error as IoError, ErrorKind, Result as IoResult};\nuse std::net::ToSocketAddrs;\nuse std::path::Path;\nuse std::pin::Pin;\nuse std::sync::Arc;\nuse std::task::{Context, Poll};\n\nuse futures_util::future::Future;\nuse futures_util::io::{AsyncRead as StdAsyncRead, AsyncWrite as StdAsyncWrite};\nuse http::Uri;\nuse tracing::debug;\n\nuse hyper::client::connect::{Connected, Connection};\nuse hyper::service::Service;\nuse hyper::Body;\nuse hyper::Client;\nuse tokio::io::{AsyncRead, AsyncWrite, ReadBuf};\n\nuse fluvio_future::net::TcpStream;\nuse fluvio_future::rust_tls::{ConnectorBuilder, DefaultClientTlsStream, TlsConnector};\n\nuse super::executor::FluvioHyperExecutor;\nuse crate::cert::{ClientConfigBuilder, ConfigBuilder};\nuse crate::ClientError;\n\npub type HyperClient = Client<TlsHyperConnector, Body>;\n\npub type HyperConfigBuilder = ClientConfigBuilder<HyperClientBuilder>;\n\npub struct HyperTlsStream(DefaultClientTlsStream);\n\nimpl Connection for HyperTlsStream {\n fn connected(&self) -> Connected {\n Connected::new()\n }\n}\n\nimpl AsyncRead for HyperTlsStream {\n fn poll_read(\n mut self: Pin<&mut Self>,\n cx: &mut Context<'_>,\n buf: &mut ReadBuf<'_>,\n ) -> Poll<IoResult<()>> {\n match Pin::new(&mut self.0).poll_read(cx, buf.initialize_unfilled())? {\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl AsyncWrite for HyperTlsStream {\n fn poll_write(\n mut self: Pin<&mut Self>,\n cx: &mut Context<'_>,\n buf: &[u8],\n ) -> Poll<IoResult<usize>> {\n Pin::new(&mut self.0).poll_write(cx, buf)\n }\n\n fn poll_flush(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<IoResult<()>> {\n Pin::new(&mut self.0).poll_flush(cx)\n }\n\n fn poll_shutdown(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<IoResult<()>> {\n Pin::new(&mut self.0).poll_close(cx)\n }\n}\n\n#[derive(Clone)]\npub struct TlsHyperConnector(Arc<TlsConnector>);\n\nimpl TlsHyperConnector {\n fn new(connector: TlsConnector) -> Self {\n Self(Arc::new(connector))\n }\n}\n\nimpl Service<Uri> for TlsHyperConnector {\n type Response = HyperTlsStream;\n type Error = ClientError;\n\n type Future = Pin<Box<dyn Future<Output = Result<Self::Response, Self::Error>> + Send>>;\n\n fn poll_ready(&mut self, _: &mut Context<'_>) -> Poll<Result<(), Self::Error>> {\n Poll::Ready(Ok(()))\n }\n\n fn call(&mut self, uri: Uri) -> Self::Future {\n let connector = self.0.clone();\n\n Box::pin(async move {\n let host = match uri.host() {\n Some(h) => h,\n None => return Err(ClientError::Other(\"no host\".to_string())),\n };\n\n match uri.scheme_str() {\n Some(\"http\") => Err(ClientError::Other(\"http not supported\".to_string())),\n Some(\"https\") => {\n let socket_addr = {\n let host = host.to_string();\n let port = uri.port_u16().unwrap_or(443);\n match (host.as_str(), port).to_socket_addrs()?.next() {\n Some(addr) => addr,\n None => {\n return Err(ClientError::Other(format!(\n \"host resolution: {} failed\",\n host\n )))\n }\n }\n };\n debug!(\"socket address to: {}\", socket_addr);\n let tcp_stream = TcpStream::connect(&socket_addr).await?;\n\n let stream = connector.connect(host, tcp_stream).await.map_err(|err| {\n IoError::new(ErrorKind::Other, format!(\"tls handshake: {}\", err))\n })?;\n Ok(HyperTlsStream(stream))\n }\n scheme => Err(ClientError::Other(format!(\"{:?}\", scheme))),\n }\n })\n }\n}\n\npub struct HyperClientBuilder(ConnectorBuilder);\n\nimpl ConfigBuilder for HyperClientBuilder {\n type Client = HyperClient;\n\n fn new() -> Self {\n Self(ConnectorBuilder::new())\n }\n\n fn build(self) -> Result<Self::Client, ClientError> {\n let connector = self.0.build();\n\n Ok(Client::builder()\n .executor(FluvioHyperExecutor)\n .build::<_, Body>(TlsHyperConnector::new(connector)))\n }\n\n fn load_ca_certificate(self, ca_path: impl AsRef<Path>) -> Result<Self, IoError> {\n Ok(Self(self.0.load_ca_cert(ca_path)?))\n }\n\n fn load_client_certificate<P: AsRef<Path>>(\n self,\n client_crt_path: P,\n client_key_path: P,\n ) -> Result<Self, IoError> {\n Ok(Self(\n self.0.load_client_certs(client_crt_path, client_key_path)?,\n ))\n }\n}\n"},"middle":{"kind":"string","value":"Poll::Ready(bytes_read) => {\n buf.advance(bytes_read);\n Poll::Ready(Ok(()))\n }\n Poll::Pending => Poll::Pending,\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"pub fn create_topic_stream_result(\n\n ttw_list: &TestTopicWatchList,\n\n) -> TokenStreamResult<TopicSpec, TopicStatus,ClientError> {\n\n let mut topic_watch_list = vec![];\n\n for ttw in ttw_list {\n\n topic_watch_list.push(Ok(create_topic_watch(&ttw)));\n\n }\n\n Ok(topic_watch_list)\n\n}\n\n\n\n//\n\n// Utility APIs\n\n//\n\n\n","file_path":"src/k8-client/k8-fixtures/src/test_fixtures.rs","rank":0,"score":111312.28505213931},{"content":"fn run() -> Result<(), ConfigError> {\n\n let context = MinikubeContext::try_from_system()?;\n\n context.save()?;\n\n Ok(())\n\n}\n","file_path":"src/k8-ctx-util/src/main.rs","rank":1,"score":91249.77959039006},{"content":"#[allow(clippy::redundant_closure)]\n\npub fn as_token_stream_result<S, E>(events: Vec<K8Watch<S>>) -> TokenStreamResult<S, E>\n\nwhere\n\n S: Spec,\n\n S::Status: Serialize + DeserializeOwned,\n\n S::Header: Serialize + DeserializeOwned,\n\n{\n\n Ok(events.into_iter().map(|event| Ok(event)).collect())\n\n}\n\n\n","file_path":"src/k8-metadata-client/src/client.rs","rank":2,"score":89832.7100231961},{"content":"#[proc_macro_derive(Difference)]\n\npub fn diff(input: TokenStream1) -> TokenStream1 {\n\n\n\n // Parse the string representation\n\n let ast: DeriveInput = syn::parse(input).unwrap();\n\n\n\n let expanded = diff::geneate_diff_trait(&ast);\n\n expanded.into()\n\n}\n\n\n\n\n","file_path":"src/k8-diff/k8-dderive/src/lib.rs","rank":3,"score":77195.16997633707},{"content":" /// Kubernetes Spec\n\n pub trait Spec:\n\n Sized + Debug + Clone + Default + Serialize + DeserializeOwned + Send + Sync\n\n {\n\n type Status: Status;\n\n\n\n type Header: Header;\n\n\n\n /// if true, spec is namespaced\n\n const NAME_SPACED: bool = true;\n\n\n\n /// return uri for single instance\n\n fn metadata() -> &'static Crd;\n\n\n\n fn label() -> &'static str {\n\n Self::metadata().names.kind\n\n }\n\n\n\n fn api_version() -> String {\n\n let metadata = Self::metadata();\n\n if metadata.group == \"core\" {\n","file_path":"src/k8-types/src/lib.rs","rank":4,"score":76313.4596724619},{"content":" pub trait Status:\n\n Sized + Debug + Clone + Default + Serialize + DeserializeOwned + Send + Sync\n\n {\n\n }\n\n\n","file_path":"src/k8-types/src/lib.rs","rank":5,"score":76313.4596724619},{"content":" pub trait Header:\n\n Sized + Debug + Clone + Default + Serialize + DeserializeOwned + Send + Sync\n\n {\n\n }\n\n\n","file_path":"src/k8-types/src/lib.rs","rank":6,"score":76313.4596724619},{"content":"pub fn geneate_diff_trait(input: &DeriveInput) -> TokenStream {\n\n let name = &input.ident;\n\n let decoded_field_tokens = decode_fields(&input.data);\n\n\n\n quote! {\n\n\n\n impl <'a>k8_diff::Changes<'a> for #name {\n\n\n\n fn diff(&self, new: &'a Self) -> k8_diff::Diff {\n\n\n\n let mut s_diff = k8_diff::DiffStruct::new();\n\n\n\n #decoded_field_tokens\n\n \n\n if s_diff.no_change() {\n\n return k8_diff::Diff::None\n\n }\n\n \n\n k8_diff::Diff::Change(k8_diff::DiffValue::Struct(s_diff))\n\n }\n\n }\n\n\n\n }\n\n}\n\n\n","file_path":"src/k8-diff/k8-dderive/src/diff.rs","rank":7,"score":74593.48713464057},{"content":"pub trait K8Meta {\n\n /// resource name\n\n fn name(&self) -> &str;\n\n\n\n /// namespace\n\n fn namespace(&self) -> &str;\n\n}\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":8,"score":74320.8383027833},{"content":"pub trait DeserializeWith: Sized {\n\n fn deserialize_with<'de, D>(de: D) -> Result<Self, D::Error>\n\n where\n\n D: Deserializer<'de>;\n\n}\n\n\n\n#[allow(clippy::upper_case_acronyms)]\n\n#[derive(Deserialize, Debug, Clone)]\n\n#[serde(tag = \"type\", content = \"object\")]\n\n#[serde(bound(serialize = \"K8Obj<S>: Serialize\"))]\n\n#[serde(bound(deserialize = \"K8Obj<S>: DeserializeOwned\"))]\n\npub enum K8Watch<S>\n\nwhere\n\n S: Spec,\n\n{\n\n ADDED(K8Obj<S>),\n\n MODIFIED(K8Obj<S>),\n\n DELETED(K8Obj<S>),\n\n}\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":9,"score":72936.74817911725},{"content":"pub trait LabelProvider: Sized {\n\n fn set_label_map(self, labels: HashMap<String, String>) -> Self;\n\n\n\n /// helper for setting list of labels\n\n fn set_labels<T: ToString>(self, labels: Vec<(T, T)>) -> Self {\n\n let mut label_map = HashMap::new();\n\n for (key, value) in labels {\n\n label_map.insert(key.to_string(), value.to_string());\n\n }\n\n self.set_label_map(label_map)\n\n }\n\n}\n\n\n\n/// metadata associated with object when returned\n\n/// here name and namespace must be populated\n\n#[derive(Deserialize, Serialize, PartialEq, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\", default)]\n\npub struct ObjectMeta {\n\n // mandatory fields\n\n pub name: String,\n","file_path":"src/k8-types/src/metadata.rs","rank":10,"score":71074.35258810218},{"content":"type K8ListImpl<'a, S> =\n\n Option<Pin<Box<dyn Future<Output = Result<K8List<S>, ClientError>> + Send + 'a>>>;\n\n\n\npub struct ListStream<'a, S>\n\nwhere\n\n S: Spec,\n\n{\n\n arg: Option<ListArg>,\n\n limit: u32,\n\n done: bool,\n\n namespace: NameSpace,\n\n client: SharedK8Client,\n\n inner: K8ListImpl<'a, S>,\n\n data1: PhantomData<S>,\n\n}\n\n\n\nimpl<S> ListStream<'_, S>\n\nwhere\n\n S: Spec,\n\n{\n","file_path":"src/k8-client/src/client/list_stream.rs","rank":11,"score":70788.7058916614},{"content":"// Get absolute path to the \"target\" directory (\"build\" dir)\n\nfn get_target_dir() -> PathBuf {\n\n let bin = env::current_exe().expect(\"exe path\");\n\n let mut target_dir = PathBuf::from(bin.parent().expect(\"bin parent\"));\n\n while target_dir.file_name() != Some(OsStr::new(\"target\")) {\n\n target_dir.pop();\n\n }\n\n target_dir\n\n}\n\n\n","file_path":"src/k8-client/k8-fixtures/src/test_fixtures.rs","rank":12,"score":68890.03992445287},{"content":"/// Gets the current entry for a given host in `/etc/hosts` if there is one\n\nfn get_host_entry(hostname: &str) -> Result<std::option::Option<IpAddr>, ConfigError> {\n\n // Get all of the host entries\n\n let hosts = hostfile::parse_hostfile()\n\n .map_err(|e| ConfigError::Other(format!(\"failed to get /etc/hosts entries: {}\", e)))?;\n\n // Try to find a host entry with the given hostname\n\n let minikube_entry = hosts\n\n .into_iter()\n\n .find(|entry| entry.names.iter().any(|name| name == hostname));\n\n Ok(minikube_entry.map(|entry| entry.ip))\n\n}\n\n\n\n/// *Deprecated*: use [`MinikubeContext`] instead\n\n///\n\n/// Updates kubectl context settings\n\n///\n\n/// [`MinikubeContext`]: ./struct.MinikubeContext\n\npub mod v1 {\n\n use std::env;\n\n use std::fs::OpenOptions;\n\n use std::io;\n","file_path":"src/k8-config/src/context.rs","rank":13,"score":68434.2308678135},{"content":"pub fn create_topic_watch(ttw: &TestTopicWatch) -> K8Watch<TopicSpec, TopicStatus> {\n\n let target_dir = get_target_dir();\n\n let path = get_top_dir(&target_dir);\n\n let mut contents = String::new();\n\n let (filename, file_has_options) = if ttw.ignore_rack_assignment.is_none() {\n\n (\n\n String::from(\"k8-client/k8-fixtures/data/topic_no_options.tmpl\"),\n\n false,\n\n )\n\n } else {\n\n (\n\n String::from(\"k8-client/k8-fixtures/data/topic_all.tmpl\"),\n\n true,\n\n )\n\n };\n\n let f = File::open(path.join(filename));\n\n f.unwrap().read_to_string(&mut contents).unwrap();\n\n\n\n contents = contents.replace(\"{type}\", &*ttw.operation);\n\n contents = contents.replace(\"{name}\", &*ttw.name);\n","file_path":"src/k8-client/k8-fixtures/src/test_fixtures.rs","rank":14,"score":64796.4136535382},{"content":"// Spec that can store in meta store\n\npub trait StoreSpec: Sized + Default + Debug + Clone {\n\n type K8Spec: Spec;\n\n type Status: Sized + Clone + Default + Debug;\n\n type Key: Ord + Clone + Debug + ToString;\n\n type Owner: StoreSpec;\n\n\n\n const LABEL: &'static str;\n\n\n\n // convert kubernetes objects into KV value\n\n fn convert_from_k8(k8_obj: K8Obj<Self::K8Spec>) -> Result<Option<MetaItem<Self>>, IoError>;\n\n}\n\n\n\n/// Metadata object. Used to be KVObject int sc-core\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct MetaItem<S>\n\nwhere\n\n S: StoreSpec,\n\n{\n\n pub spec: S,\n\n pub status: S::Status,\n","file_path":"src/k8-types/src/store.rs","rank":15,"score":63070.26091228848},{"content":"/// items uri\n\npub fn items_uri<S>(host: &str, namespace: NameSpace, list_options: Option<ListOptions>) -> Uri\n\nwhere\n\n S: Spec,\n\n{\n\n let ns = if S::NAME_SPACED {\n\n namespace\n\n } else {\n\n NameSpace::All\n\n };\n\n let crd = S::metadata();\n\n let uri_value = prefix_uri(crd, host, ns, list_options);\n\n let uri: Uri = uri_value.parse().unwrap();\n\n uri\n\n}\n\n\n\n/// related to query parameters and uri\n\n///\n\n///\n\n///\n\n/// generate prefix for given crd\n\n/// if crd group is core then /api is used otherwise /apis + group\n\n\n","file_path":"src/k8-client/src/uri.rs","rank":16,"score":61870.900118868216},{"content":"/// items uri\n\npub fn item_uri<S>(host: &str, name: &str, namespace: &str, sub_resource: Option<&str>) -> Uri\n\nwhere\n\n S: Spec,\n\n{\n\n let ns = if S::NAME_SPACED {\n\n NameSpace::Named(namespace.to_owned())\n\n } else {\n\n NameSpace::All\n\n };\n\n let crd = S::metadata();\n\n let prefix = prefix_uri(crd, host, ns, None);\n\n let uri_value = format!(\"{}/{}{}\", prefix, name, sub_resource.unwrap_or(\"\"));\n\n let uri: Uri = uri_value.parse().unwrap();\n\n uri\n\n}\n\n\n","file_path":"src/k8-client/src/uri.rs","rank":17,"score":60093.64851747533},{"content":"pub fn prefix_uri<N>(crd: &Crd, host: &str, ns: N, options: Option<ListOptions>) -> String\n\nwhere\n\n N: Into<NameSpace>,\n\n{\n\n let namespace = ns.into();\n\n let version = crd.version;\n\n let plural = crd.names.plural;\n\n let group = crd.group;\n\n let api_prefix = match group {\n\n \"core\" => \"api\".to_owned(),\n\n _ => format!(\"apis/{}\", group),\n\n };\n\n\n\n let query = if let Some(opt) = options {\n\n let mut query = \"?\".to_owned();\n\n let qs = serde_qs::to_string(&opt).unwrap();\n\n query.push_str(&qs);\n\n query\n\n } else {\n\n \"\".to_owned()\n","file_path":"src/k8-client/src/uri.rs","rank":18,"score":60093.64851747533},{"content":"#[derive(Debug, Deserialize)]\n\nstruct MinikubeConfig {\n\n #[serde(rename = \"Name\")]\n\n name: String,\n\n #[serde(rename = \"Nodes\")]\n\n nodes: Vec<MinikubeNode>,\n\n}\n\n\n","file_path":"src/k8-config/src/context.rs","rank":19,"score":52603.177180075654},{"content":"#[derive(Debug, Deserialize)]\n\nstruct MinikubeNode {\n\n #[serde(rename = \"IP\")]\n\n ip: IpAddr,\n\n #[serde(rename = \"Port\")]\n\n port: u16,\n\n}\n\n\n","file_path":"src/k8-config/src/context.rs","rank":20,"score":52603.177180075654},{"content":"#[derive(Debug)]\n\nstruct MinikubeProfile {\n\n /// The name of the minikube profile, usually \"minikube\"\n\n name: String,\n\n /// The active minikube node, with IP and port\n\n node: MinikubeNode,\n\n}\n\n\n\nimpl MinikubeProfile {\n\n /// Gets minikube's current profile\n\n fn load() -> Result<MinikubeProfile, ConfigError> {\n\n let output = Command::new(\"minikube\")\n\n .args(&[\"profile\", \"list\", \"-o\", \"json\"])\n\n .output()?;\n\n let output_string = String::from_utf8(output.stdout).map_err(|e| {\n\n ConfigError::Other(format!(\n\n \"`minikube profile list -o json` did not give UTF-8: {}\",\n\n e\n\n ))\n\n })?;\n\n let profiles: MinikubeProfileWrapper =\n","file_path":"src/k8-config/src/context.rs","rank":21,"score":52603.177180075654},{"content":"#[derive(Debug, Deserialize)]\n\nstruct MinikubeProfileJson {\n\n #[serde(rename = \"Name\")]\n\n name: String,\n\n #[serde(rename = \"Status\")]\n\n status: String,\n\n #[serde(rename = \"Config\")]\n\n config: MinikubeConfig,\n\n}\n\n\n\n/// A description of the active Minikube instance, including IP and port\n","file_path":"src/k8-config/src/context.rs","rank":22,"score":51568.77419488529},{"content":"#[derive(Debug, Deserialize)]\n\nstruct MinikubeProfileWrapper {\n\n valid: Vec<MinikubeProfileJson>,\n\n}\n\n\n","file_path":"src/k8-config/src/context.rs","rank":23,"score":51568.77419488529},{"content":"/// Performs following\n\n/// add minikube IP address to /etc/host\n\n/// create new kubectl cluster and context which uses minikube name\n\nfn main() {\n\n if let Err(e) = run() {\n\n println!(\"{}\", e);\n\n }\n\n}\n\n\n","file_path":"src/k8-ctx-util/src/main.rs","rank":24,"score":50539.781489451634},{"content":"struct FluvioHyperExecutor;\n\n\n\nimpl<F: Future + Send + 'static> Executor<F> for FluvioHyperExecutor {\n\n fn execute(&self, fut: F) {\n\n spawn(async { drop(fut.await) });\n\n }\n\n}\n\n\n\n/// hyper connector that uses fluvio TLS\n\n#[derive(Clone)]\n\npub struct TlsHyperConnector(Arc<TlsConnector>);\n\n\n\nimpl TlsHyperConnector {\n\n fn new(connector: TlsConnector) -> Self {\n\n Self(Arc::new(connector))\n\n }\n\n}\n\n\n\n#[allow(clippy::type_complexity)]\n\nimpl Service<Uri> for TlsHyperConnector {\n","file_path":"src/k8-client/src/client/config_native.rs","rank":25,"score":49696.357919055896},{"content":"pub trait Changes {\n\n type Replace;\n\n type Patch;\n\n\n\n fn diff(&self, new: &Self) -> Result<Diff<Self::Replace, Self::Patch>, DiffError>;\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum DiffError {\n\n DiffValue, // json values are different\n\n}\n\n\n\nimpl std::fmt::Display for DiffError {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"JSON value types are different\")\n\n }\n\n}\n\n\n\nimpl std::error::Error for DiffError {}\n\n\n","file_path":"src/k8-diff/src/lib.rs","rank":26,"score":47737.00958970103},{"content":"pub trait ConfigBuilder: Sized {\n\n type Client;\n\n\n\n fn new() -> Self;\n\n\n\n fn build(self) -> Result<Self::Client, ClientError>;\n\n\n\n fn load_ca_certificate(self, ca_path: impl AsRef<Path>) -> Result<Self, IoError>;\n\n\n\n // load from ca data\n\n fn load_ca_cert_with_data(self, data: Vec<u8>) -> Result<Self, IoError>;\n\n\n\n // load client certificate (crt) and private key\n\n fn load_client_certificate<P: AsRef<Path>>(\n\n self,\n\n client_crt_path: P,\n\n client_key_path: P,\n\n ) -> Result<Self, IoError>;\n\n\n\n fn load_client_certificate_with_data(\n","file_path":"src/k8-client/src/cert.rs","rank":27,"score":44365.48784799347},{"content":"type SerdeObj = Map<String, Value>;\n\npub type JsonDiff = Diff<Value, PatchObject>;\n\n\n\n#[derive(Debug)]\n\npub struct PatchObject(HashMap<String, JsonDiff>);\n\n\n\nimpl PatchObject {\n\n // diff { \"a\": 1,\"b\": 2}, { \"a\": 3, \"b\": 2} => { \"a\": 1}\n\n fn diff(old: &SerdeObj, new: &SerdeObj) -> Result<Self, DiffError> {\n\n let mut map: HashMap<String, JsonDiff> = HashMap::new();\n\n\n\n for (key, new_val) in new.iter() {\n\n match old.get(key) {\n\n Some(old_val) => {\n\n if old_val != new_val {\n\n let diff_value = old_val.diff(new_val)?;\n\n map.insert(key.clone(), diff_value);\n\n }\n\n }\n\n _ => {\n","file_path":"src/k8-diff/src/json/mod.rs","rank":28,"score":42727.992900325204},{"content":"#[async_trait]\n\npub trait MetadataClient: Send + Sync {\n\n type MetadataClientError: MetadataClientError\n\n + Send\n\n + Display\n\n + From<IoError>\n\n + From<DiffError>\n\n + From<SerdeJsonError>;\n\n\n\n /// retrieval a single item\n\n async fn retrieve_item<S, M>(\n\n &self,\n\n metadata: &M,\n\n ) -> Result<K8Obj<S>, Self::MetadataClientError>\n\n where\n\n S: Spec,\n\n M: K8Meta + Send + Sync;\n\n\n\n /// retrieve all items a single chunk\n\n /// this may cause client to hang if there are too many items\n\n async fn retrieve_items<S, N>(\n","file_path":"src/k8-metadata-client/src/client.rs","rank":29,"score":41442.573065625955},{"content":"// read file\n\nfn read_file(name: &str) -> Option<String> {\n\n let full_path = format!(\"{}/{}\", BASE_DIR, name);\n\n match read_to_string(&full_path) {\n\n Ok(value) => Some(value),\n\n Err(err) => {\n\n error!(\"no {} founded as pod in {}\", name, full_path);\n\n trace!(\"unable to read pod: {} value: {}\", name, err);\n\n None\n\n }\n\n }\n\n}\n","file_path":"src/k8-config/src/pod.rs","rank":30,"score":41270.48395798693},{"content":"fn decode_fields(data: &Data) -> TokenStream {\n\n match *data {\n\n Data::Struct(ref data) => {\n\n match data.fields {\n\n Fields::Named(ref fields) => {\n\n let recurse = fields.named.iter().map(|f| {\n\n let fname = &f.ident;\n\n \n\n quote! {\n\n // s_diff.insert(\"replicas\".to_owned(), self.replicas.diff(&new.replicas));\n\n s_diff.insert(stringify!(#fname).to_owned(), self.#fname.diff(&new.#fname));\n\n \n\n }\n\n \n\n });\n\n\n\n quote! {\n\n #(#recurse)*\n\n }\n\n }\n\n _ => unimplemented!(),\n\n }\n\n }\n\n _ => unimplemented!(),\n\n }\n\n}\n\n\n\n\n","file_path":"src/k8-diff/k8-dderive/src/diff.rs","rank":31,"score":40800.21698931014},{"content":"/// trait for metadata client\n\npub trait MetadataClientError: Debug + Display {\n\n /// is not founded\n\n fn not_founded(&self) -> bool;\n\n\n\n // create new patch error\n\n fn patch_error() -> Self;\n\n}\n\n\n\n// For error mapping: see: https://doc.rust-lang.org/nightly/core/convert/trait.From.html\n\n\n\npub type TokenStreamResult<S, E> = Result<Vec<Result<K8Watch<S>, E>>, E>;\n\n\n","file_path":"src/k8-metadata-client/src/client.rs","rank":32,"score":40648.60907259954},{"content":"// Get absolute path to the project's top dir, given target dir\n\nfn get_top_dir<'a>(target_dir: &'a Path) -> &'a Path {\n\n target_dir.parent().expect(\"target parent\")\n\n}\n","file_path":"src/k8-client/k8-fixtures/src/test_fixtures.rs","rank":33,"score":36588.94995819749},{"content":" pub name: String,\n\n pub labels: HashMap<String, String>,\n\n pub namespace: String,\n\n pub owner_references: Vec<OwnerReferences>,\n\n pub finalizers: Vec<String>,\n\n pub annotations: HashMap<String, String>,\n\n}\n\n\n\nimpl LabelProvider for InputObjectMeta {\n\n fn set_label_map(mut self, labels: HashMap<String, String>) -> Self {\n\n self.labels = labels;\n\n self\n\n }\n\n}\n\n\n\nimpl fmt::Display for InputObjectMeta {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"{}:{}\", self.name, self.namespace)\n\n }\n\n}\n","file_path":"src/k8-types/src/metadata.rs","rank":34,"score":30739.540383184172},{"content":"#[derive(Deserialize, Serialize, Debug, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct ListMetadata {\n\n pub _continue: Option<String>,\n\n pub resource_version: String,\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Default, Debug, PartialEq, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct LabelSelector {\n\n pub match_labels: HashMap<String, String>,\n\n}\n\n\n\nimpl LabelSelector {\n\n pub fn new_labels<T: Into<String>>(labels: Vec<(T, T)>) -> Self {\n\n let mut match_labels = HashMap::new();\n\n for (key, value) in labels {\n\n match_labels.insert(key.into(), value.into());\n\n }\n\n LabelSelector { match_labels }\n","file_path":"src/k8-types/src/metadata.rs","rank":35,"score":30738.67281548348},{"content":"pub struct MetaItemContext {\n\n pub item_ctx: Option<ObjectMeta>,\n\n pub parent_ctx: Option<ObjectMeta>,\n\n}\n\n\n\nimpl MetaItemContext {\n\n pub fn with_ctx(mut self, ctx: ObjectMeta) -> Self {\n\n self.item_ctx = Some(ctx);\n\n self\n\n }\n\n\n\n pub fn with_parent_ctx(mut self, ctx: ObjectMeta) -> Self {\n\n self.parent_ctx = Some(ctx);\n\n self\n\n }\n\n\n\n pub fn make_parent_ctx(&self) -> Self {\n\n if self.item_ctx.is_some() {\n\n Self::default().with_parent_ctx(self.item_ctx.as_ref().unwrap().clone())\n\n } else {\n","file_path":"src/k8-types/src/store.rs","rank":36,"score":30738.55506451868},{"content":"impl From<ObjectMeta> for ItemMeta {\n\n fn from(meta: ObjectMeta) -> Self {\n\n Self {\n\n name: meta.name,\n\n namespace: meta.namespace,\n\n }\n\n }\n\n}\n\n\n\n/// used for updating item\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct UpdateItemMeta {\n\n pub name: String,\n\n pub namespace: String,\n\n pub resource_version: String,\n\n}\n\n\n\nimpl From<ObjectMeta> for UpdateItemMeta {\n\n fn from(meta: ObjectMeta) -> Self {\n","file_path":"src/k8-types/src/metadata.rs","rank":37,"score":30737.953773522997},{"content":" fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\n\n where D: Deserializer<'de>,\n\n {\n\n use serde::de::{ Visitor, MapAccess};\n\n\n\n struct StatusVisitor<S: Spec>(PhantomData<fn() -> S>);\n\n\n\n impl<'de,S> Visitor<'de> for StatusVisitor<S>\n\n where\n\n S: Spec,\n\n DeleteResponse<S>: Deserialize<'de>,\n\n {\n\n type Value = DeleteResponse<S>;\n\n\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n\n formatter.write_str(\"string or json\")\n\n }\n\n\n\n fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>\n\n where\n","file_path":"src/k8-types/src/metadata.rs","rank":38,"score":30737.73590184691},{"content":"}\n\n\n\nimpl From<ObjectMeta> for InputObjectMeta {\n\n fn from(meta: ObjectMeta) -> Self {\n\n Self {\n\n name: meta.name,\n\n namespace: meta.namespace,\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\n/// used for retrieving,updating and deleting item\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct ItemMeta {\n\n pub name: String,\n\n pub namespace: String,\n\n}\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":39,"score":30737.0165415251},{"content":"impl<S> K8Obj<S>\n\nwhere\n\n S: Spec,\n\n{\n\n #[allow(dead_code)]\n\n pub fn new<N>(name: N, spec: S) -> Self\n\n where\n\n N: Into<String>,\n\n {\n\n Self {\n\n api_version: S::api_version(),\n\n kind: S::kind(),\n\n metadata: ObjectMeta::named(name),\n\n spec,\n\n ..Default::default()\n\n }\n\n }\n\n\n\n #[allow(dead_code)]\n\n pub fn set_status(mut self, status: S::Status) -> Self {\n","file_path":"src/k8-types/src/metadata.rs","rank":40,"score":30736.701645400542},{"content":"}\n\n\n\n/// name is optional for template\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone, PartialEq)]\n\n#[serde(rename_all = \"camelCase\", default)]\n\npub struct TemplateMeta {\n\n pub name: Option<String>,\n\n pub creation_timestamp: Option<String>,\n\n pub labels: HashMap<String, String>,\n\n}\n\n\n\nimpl LabelProvider for TemplateMeta {\n\n fn set_label_map(mut self, labels: HashMap<String, String>) -> Self {\n\n self.labels = labels;\n\n self\n\n }\n\n}\n\n\n\nimpl TemplateMeta {\n\n /// create with name and default namespace\n","file_path":"src/k8-types/src/metadata.rs","rank":41,"score":30736.242170680674},{"content":" return metadata.version.to_owned();\n\n }\n\n format!(\"{}/{}\", metadata.group, metadata.version)\n\n }\n\n\n\n fn kind() -> String {\n\n Self::metadata().names.kind.to_owned()\n\n }\n\n\n\n /// in case of applying, we have some fields that are generated\n\n /// or override. So need to special logic to reset them so we can do proper comparison\n\n fn make_same(&mut self, _other: &Self) {}\n\n }\n\n\n\n #[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n pub struct DefaultHeader {}\n\n\n\n impl Header for DefaultHeader {}\n\n}\n","file_path":"src/k8-types/src/lib.rs","rank":42,"score":30735.840343571683},{"content":"use std::collections::HashMap;\n\nuse std::fmt;\n\nuse std::fmt::Debug;\n\nuse std::marker::PhantomData;\n\n\n\nuse serde::de::{DeserializeOwned, Deserializer};\n\nuse serde::Deserialize;\n\nuse serde::Serialize;\n\n\n\nuse crate::Spec;\n\n\n\npub const DEFAULT_NS: &str = \"default\";\n\npub const TYPE_OPAQUE: &str = \"Opaque\";\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":43,"score":30735.519955589494},{"content":" ..Default::default()\n\n }\n\n }\n\n\n\n /// provide builder pattern setter\n\n pub fn set_labels<T: Into<String>>(mut self, labels: Vec<(T, T)>) -> Self {\n\n let mut label_map = HashMap::new();\n\n for (key, value) in labels {\n\n label_map.insert(key.into(), value.into());\n\n }\n\n self.labels = label_map;\n\n self\n\n }\n\n\n\n /// create with name and default namespace\n\n pub fn named<S>(name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n Self {\n","file_path":"src/k8-types/src/metadata.rs","rank":44,"score":30735.339093994397},{"content":" pub fn named<S>(name: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n Self {\n\n name: Some(name.into()),\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone, PartialEq)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct TemplateSpec<S> {\n\n pub metadata: Option<TemplateMeta>,\n\n pub spec: S,\n\n}\n\n\n\nimpl<S> TemplateSpec<S> {\n\n pub fn new(spec: S) -> Self {\n","file_path":"src/k8-types/src/metadata.rs","rank":45,"score":30735.27827500885},{"content":" pub namespace: String,\n\n pub uid: String,\n\n pub creation_timestamp: String,\n\n pub generation: Option<i32>,\n\n pub resource_version: String,\n\n // optional\n\n pub cluster_name: Option<String>,\n\n pub deletion_timestamp: Option<String>,\n\n pub deletion_grace_period_seconds: Option<u32>,\n\n pub labels: HashMap<String, String>,\n\n pub owner_references: Vec<OwnerReferences>,\n\n pub annotations: HashMap<String, String>,\n\n pub finalizers: Vec<String>,\n\n}\n\n\n\nimpl LabelProvider for ObjectMeta {\n\n fn set_label_map(mut self, labels: HashMap<String, String>) -> Self {\n\n self.labels = labels;\n\n self\n\n }\n","file_path":"src/k8-types/src/metadata.rs","rank":46,"score":30735.22614960466},{"content":" pub fn with_ctx(mut self, ctx: MetaItemContext) -> Self {\n\n self.ctx = ctx;\n\n self\n\n }\n\n\n\n pub fn key(&self) -> &S::Key {\n\n &self.key\n\n }\n\n\n\n pub fn key_owned(&self) -> S::Key {\n\n self.key.clone()\n\n }\n\n\n\n pub fn my_key(self) -> S::Key {\n\n self.key\n\n }\n\n\n\n pub fn spec(&self) -> &S {\n\n &self.spec\n\n }\n","file_path":"src/k8-types/src/store.rs","rank":47,"score":30734.98902594919},{"content":"}\n\n\n\nimpl K8Meta for ObjectMeta {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n\n\n fn namespace(&self) -> &str {\n\n &self.namespace\n\n }\n\n}\n\n\n\nimpl ObjectMeta {\n\n pub fn new<S>(name: S, name_space: S) -> Self\n\n where\n\n S: Into<String>,\n\n {\n\n Self {\n\n name: name.into(),\n\n namespace: name_space.into(),\n","file_path":"src/k8-types/src/metadata.rs","rank":48,"score":30734.975549138417},{"content":" pub kind: String,\n\n pub metadata: M,\n\n pub spec: S,\n\n #[serde(flatten)]\n\n pub header: S::Header,\n\n}\n\n\n\nimpl<S, M> K8SpecObj<S, M>\n\nwhere\n\n S: Spec,\n\n{\n\n pub fn new(spec: S, metadata: M) -> Self\n\n where\n\n M: Default,\n\n {\n\n Self {\n\n api_version: S::api_version(),\n\n kind: S::kind(),\n\n metadata,\n\n spec,\n","file_path":"src/k8-types/src/metadata.rs","rank":49,"score":30734.89946538372},{"content":"impl<S> fmt::Display for MetaItem<S>\n\nwhere\n\n S: StoreSpec,\n\n S::Key: Display,\n\n{\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(f, \"MetaItem {} key: {}\", S::LABEL, self.key())\n\n }\n\n}\n\n\n\nimpl<S> From<MetaItem<S>> for (S::Key, S, S::Status)\n\nwhere\n\n S: StoreSpec,\n\n{\n\n fn from(val: MetaItem<S>) -> Self {\n\n (val.key, val.spec, val.status)\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Clone)]\n","file_path":"src/k8-types/src/store.rs","rank":50,"score":30734.837686964176},{"content":" pub key: S::Key,\n\n pub ctx: MetaItemContext,\n\n}\n\n\n\nimpl<S> MetaItem<S>\n\nwhere\n\n S: StoreSpec,\n\n{\n\n pub fn new<J>(key: J, spec: S, status: S::Status, ctx: MetaItemContext) -> Self\n\n where\n\n J: Into<S::Key>,\n\n {\n\n Self {\n\n key: key.into(),\n\n spec,\n\n status,\n\n ctx,\n\n }\n\n }\n\n\n","file_path":"src/k8-types/src/store.rs","rank":51,"score":30734.666219566832},{"content":" pub fn is_owned(&self, uid: &str) -> bool {\n\n match &self.ctx.parent_ctx {\n\n Some(parent) => parent.uid == uid,\n\n None => false,\n\n }\n\n }\n\n\n\n pub fn with_spec<J>(key: J, spec: S) -> Self\n\n where\n\n J: Into<S::Key>,\n\n {\n\n Self::new(\n\n key.into(),\n\n spec,\n\n S::Status::default(),\n\n MetaItemContext::default(),\n\n )\n\n }\n\n}\n\n\n","file_path":"src/k8-types/src/store.rs","rank":52,"score":30734.5766708061},{"content":"\n\nimpl<S> K8List<S>\n\nwhere\n\n S: Spec,\n\n{\n\n #[allow(dead_code)]\n\n pub fn new() -> Self {\n\n K8List {\n\n api_version: S::api_version(),\n\n items: vec![],\n\n kind: S::kind(),\n\n metadata: ListMetadata {\n\n _continue: None,\n\n resource_version: S::api_version(),\n\n },\n\n }\n\n }\n\n}\n\n\n\nimpl<S> Default for K8List<S>\n\nwhere\n\n S: Spec,\n\n{\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":53,"score":30734.333537546394},{"content":"}\n\n\n\nimpl<S> UpdateK8ObjStatus<S>\n\nwhere\n\n S: Spec,\n\n{\n\n pub fn new(status: S::Status, metadata: UpdateItemMeta) -> Self {\n\n Self {\n\n api_version: S::api_version(),\n\n kind: S::kind(),\n\n metadata,\n\n status,\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\nimpl<S> From<UpdateK8Obj<S>> for InputK8Obj<S>\n\nwhere\n\n S: Spec,\n","file_path":"src/k8-types/src/metadata.rs","rank":54,"score":30734.033072491125},{"content":"pub struct DeleteOptions {\n\n pub kind: &'static str,\n\n pub api_version: &'static str,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub pretty: Option<bool>,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub dry_run: Option<String>,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub grace_period_seconds: Option<u64>,\n\n #[serde(skip_serializing_if = \"Option::is_none\")]\n\n pub propagation_policy: Option<PropogationPolicy>,\n\n}\n\n\n\nimpl Default for DeleteOptions {\n\n fn default() -> Self {\n\n Self {\n\n kind: \"DeleteOptions\",\n\n api_version: \"v1\",\n\n pretty: None,\n\n dry_run: None,\n","file_path":"src/k8-types/src/options.rs","rank":55,"score":30733.928766177363},{"content":" }\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Env {\n\n pub name: String,\n\n pub value: Option<String>,\n\n pub value_from: Option<EnvVarSource>,\n\n}\n\n\n\nimpl Env {\n\n pub fn key_value<T: Into<String>>(name: T, value: T) -> Self {\n\n Env {\n\n name: name.into(),\n\n value: Some(value.into()),\n\n value_from: None,\n\n }\n\n }\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":56,"score":30733.913783039086},{"content":"mod crd;\n\nmod metadata;\n\npub mod options;\n\npub mod store;\n\n#[cfg(feature = \"core\")]\n\npub mod core;\n\n#[cfg(feature = \"app\")]\n\npub mod app;\n\n#[cfg(feature = \"storage\")]\n\npub mod storage;\n\n#[cfg(feature = \"batch\")]\n\npub mod batch;\n\n\n\npub use self::crd::*;\n\npub use self::metadata::*;\n\npub use self::spec_def::*;\n\n\n\nmod spec_def {\n\n\n\n use std::fmt::Debug;\n\n\n\n use serde::de::DeserializeOwned;\n\n use serde::Deserialize;\n\n use serde::Serialize;\n\n\n\n use super::Crd;\n\n\n","file_path":"src/k8-types/src/lib.rs","rank":57,"score":30733.78785751604},{"content":"\n\nimpl K8Meta for InputObjectMeta {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n\n\n fn namespace(&self) -> &str {\n\n &self.namespace\n\n }\n\n}\n\n\n\nimpl InputObjectMeta {\n\n // shorthand to create just with name and metadata\n\n pub fn named<S: Into<String>>(name: S, namespace: S) -> Self {\n\n InputObjectMeta {\n\n name: name.into(),\n\n namespace: namespace.into(),\n\n ..Default::default()\n\n }\n\n }\n","file_path":"src/k8-types/src/metadata.rs","rank":58,"score":30733.455603332113},{"content":"impl Default for OwnerReferences {\n\n fn default() -> Self {\n\n Self {\n\n api_version: \"v1\".to_owned(),\n\n block_owner_deletion: false,\n\n controller: None,\n\n kind: \"\".to_owned(),\n\n uid: \"\".to_owned(),\n\n name: \"\".to_owned(),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub enum DeleteStatus<S>\n\nwhere\n\n S: Spec,\n\n{\n\n Deleted(DeletedStatus),\n\n ForegroundDelete(K8Obj<S>),\n","file_path":"src/k8-types/src/metadata.rs","rank":59,"score":30733.384961331925},{"content":" pub fn status(&self) -> &S::Status {\n\n &self.status\n\n }\n\n\n\n pub fn set_status(&mut self, status: S::Status) {\n\n self.status = status;\n\n }\n\n\n\n pub fn ctx(&self) -> &MetaItemContext {\n\n &self.ctx\n\n }\n\n\n\n pub fn set_ctx(&mut self, ctx: MetaItemContext) {\n\n self.ctx = ctx;\n\n }\n\n\n\n pub fn parts(self) -> (S::Key, S, MetaItemContext) {\n\n (self.key, self.spec, self.ctx)\n\n }\n\n\n","file_path":"src/k8-types/src/store.rs","rank":60,"score":30732.702459431544},{"content":" Self::default()\n\n }\n\n }\n\n}\n\n\n\nimpl ::std::default::Default for MetaItemContext {\n\n fn default() -> Self {\n\n Self {\n\n item_ctx: None,\n\n parent_ctx: None,\n\n }\n\n }\n\n}\n\n\n\n/// define default store spec assuming key is string\n\n#[macro_export]\n\nmacro_rules! default_store_spec {\n\n ($spec:ident,$status:ident,$name:expr) => {\n\n impl crate::store::StoreSpec for $spec {\n\n const LABEL: &'static str = $name;\n","file_path":"src/k8-types/src/store.rs","rank":61,"score":30731.96679488353},{"content":" Self {\n\n name: meta.name,\n\n namespace: meta.namespace,\n\n resource_version: meta.resource_version,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Debug, Clone, PartialEq)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct OwnerReferences {\n\n pub api_version: String,\n\n #[serde(default)]\n\n pub block_owner_deletion: bool,\n\n pub controller: Option<bool>,\n\n pub kind: String,\n\n pub name: String,\n\n pub uid: String,\n\n}\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":62,"score":30731.614124288968},{"content":"{\n\n fn from(update: UpdateK8Obj<S>) -> Self {\n\n Self {\n\n api_version: update.api_version,\n\n kind: update.kind,\n\n metadata: update.metadata.into(),\n\n spec: update.spec,\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\nimpl From<ItemMeta> for InputObjectMeta {\n\n fn from(update: ItemMeta) -> Self {\n\n Self {\n\n name: update.name,\n\n namespace: update.namespace,\n\n ..Default::default()\n\n }\n\n }\n","file_path":"src/k8-types/src/metadata.rs","rank":63,"score":30731.578737781125},{"content":" E: de::Error,\n\n {\n\n match value {\n\n \"Success\" => Ok(DeleteResponse::OkStatus(StatusEnum::SUCCESS)),\n\n \"Failure\" => Ok(DeleteResponse::OkStatus(StatusEnum::FAILURE)),\n\n _ => Err(de::Error::custom(format!(\"unrecognized status: {}\",value)))\n\n }\n\n\n\n\n\n }\n\n\n\n fn visit_map<M>(self, map: M) -> Result<Self::Value, M::Error>\n\n where\n\n M: MapAccess<'de>,\n\n {\n\n Deserialize::deserialize(de::value::MapAccessDeserializer::new(map))\n\n }\n\n }\n\n\n\n deserializer.deserialize_any(StatusVisitor(PhantomData))\n\n }\n\n\n\n}\n\n*/\n","file_path":"src/k8-types/src/metadata.rs","rank":64,"score":30731.39421833043},{"content":"use serde::Serialize;\n\n\n\n/// goes as query parameter\n\n#[derive(Serialize, Default, Debug)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct ListOptions {\n\n pub pretty: Option<bool>,\n\n #[serde(rename = \"continue\")]\n\n pub continu: Option<String>,\n\n pub field_selector: Option<String>,\n\n pub include_uninitialized: Option<bool>,\n\n pub label_selector: Option<String>,\n\n pub limit: Option<u32>,\n\n pub resource_version: Option<String>,\n\n pub timeout_seconds: Option<u32>,\n\n pub watch: Option<bool>,\n\n}\n\n\n\n#[derive(Serialize, Debug)]\n\n#[serde(rename_all = \"camelCase\")]\n","file_path":"src/k8-types/src/options.rs","rank":65,"score":30731.355977690648},{"content":" ..Default::default()\n\n }\n\n }\n\n}\n\n\n\npub type InputK8Obj<S> = K8SpecObj<S, InputObjectMeta>;\n\npub type UpdateK8Obj<S> = K8SpecObj<S, ItemMeta>;\n\n\n\n/// Used for updating k8obj\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct UpdateK8ObjStatus<S>\n\nwhere\n\n S: Spec,\n\n{\n\n pub api_version: String,\n\n pub kind: String,\n\n pub metadata: UpdateItemMeta,\n\n pub status: S::Status,\n\n pub data: PhantomData<S>,\n","file_path":"src/k8-types/src/metadata.rs","rank":66,"score":30731.223825409037},{"content":"#[serde(rename_all = \"camelCase\")]\n\npub struct ObjectFieldSelector {\n\n pub field_path: String,\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n\n\n use super::Env;\n\n use super::ObjectMeta;\n\n\n\n #[test]\n\n fn test_metadata_label() {\n\n let metadata =\n\n ObjectMeta::default().set_labels(vec![(\"app\".to_owned(), \"test\".to_owned())]);\n\n\n\n let maps = metadata.labels;\n\n assert_eq!(maps.len(), 1);\n\n assert_eq!(maps.get(\"app\").unwrap(), \"test\");\n\n }\n","file_path":"src/k8-types/src/metadata.rs","rank":67,"score":30731.189865587978},{"content":"\n\n type K8Spec = Self;\n\n type Status = $status;\n\n type Key = String;\n\n type Owner = Self;\n\n\n\n fn convert_from_k8(\n\n k8_obj: crate::K8Obj<Self::K8Spec>,\n\n ) -> Result<Option<crate::store::MetaItem<Self>>, std::io::Error> {\n\n let ctx =\n\n crate::store::MetaItemContext::default().with_ctx(k8_obj.metadata.clone());\n\n Ok(Some(crate::store::MetaItem::new(\n\n k8_obj.metadata.name,\n\n k8_obj.spec,\n\n k8_obj.status,\n\n ctx,\n\n )))\n\n }\n\n }\n\n };\n\n}\n","file_path":"src/k8-types/src/store.rs","rank":68,"score":30731.01969596139},{"content":" self.status = status;\n\n self\n\n }\n\n\n\n pub fn as_status_update(&self, status: S::Status) -> UpdateK8ObjStatus<S> {\n\n UpdateK8ObjStatus {\n\n api_version: S::api_version(),\n\n kind: S::kind(),\n\n metadata: self.metadata.as_update(),\n\n status,\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\nimpl<S> K8Obj<S>\n\nwhere\n\n S: Spec,\n\n{\n\n pub fn as_input(&self) -> InputK8Obj<S> {\n","file_path":"src/k8-types/src/metadata.rs","rank":69,"score":30730.605684508322},{"content":" pub fn key_field_ref<T: Into<String>>(name: T, field_path: T) -> Self {\n\n Env {\n\n name: name.into(),\n\n value: None,\n\n value_from: Some(EnvVarSource {\n\n field_ref: Some(ObjectFieldSelector {\n\n field_path: field_path.into(),\n\n }),\n\n }),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct EnvVarSource {\n\n field_ref: Option<ObjectFieldSelector>,\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq)]\n","file_path":"src/k8-types/src/metadata.rs","rank":70,"score":30729.985378842364},{"content":"use std::fmt;\n\nuse std::fmt::Debug;\n\nuse std::fmt::Display;\n\nuse std::io::Error as IoError;\n\n\n\nuse crate::K8Obj;\n\nuse crate::ObjectMeta;\n\nuse crate::Spec;\n\n\n\n// Spec that can store in meta store\n","file_path":"src/k8-types/src/store.rs","rank":71,"score":30729.587633750838},{"content":"//!\n\n//! # CRD Definition\n\n//!\n\n//! Interface to the CRD header definition in K8 key value store\n\n//!\n\n#[derive(Debug)]\n\npub struct Crd {\n\n pub group: &'static str,\n\n pub version: &'static str,\n\n pub names: CrdNames,\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct CrdNames {\n\n pub kind: &'static str,\n\n pub plural: &'static str,\n\n pub singular: &'static str,\n\n}\n\n\n\npub const GROUP: &str = \"fluvio.infinyon.com\";\n\npub const V1: &str = \"v1\";\n","file_path":"src/k8-types/src/crd.rs","rank":72,"score":30729.467827444078},{"content":"}\n\n\n\n/// status for actual deletion\n\n#[derive(Deserialize, Debug, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct DeletedStatus {\n\n pub api_version: String,\n\n pub code: Option<u16>,\n\n pub details: Option<StatusDetails>,\n\n pub kind: String,\n\n pub message: Option<String>,\n\n pub reason: Option<String>,\n\n pub status: StatusEnum,\n\n}\n\n\n\n/// Default status implementation\n\n#[allow(clippy::upper_case_acronyms)]\n\n#[derive(Deserialize, Debug, Eq, PartialEq, Clone)]\n\npub enum StatusEnum {\n\n #[serde(rename = \"Success\")]\n","file_path":"src/k8-types/src/metadata.rs","rank":73,"score":30729.318546093928},{"content":" SUCCESS,\n\n #[serde(rename = \"Failure\")]\n\n FAILURE,\n\n}\n\n\n\n/*\n\n#[serde(deserialize_with = \"StatusEnum::deserialize_with\")]\n\n pub status: StatusEnum,\n\n*/\n\n\n\n#[derive(Deserialize, Serialize, Debug, Clone)]\n\npub struct StatusDetails {\n\n pub name: String,\n\n pub group: Option<String>,\n\n pub kind: String,\n\n pub uid: String,\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n","file_path":"src/k8-types/src/metadata.rs","rank":74,"score":30729.218716421405},{"content":"#[serde(bound(serialize = \"S: Serialize\"))]\n\n#[serde(bound(deserialize = \"S: DeserializeOwned\"))]\n\npub struct K8Obj<S>\n\nwhere\n\n S: Spec,\n\n{\n\n #[serde(default = \"S::api_version\")]\n\n pub api_version: String,\n\n #[serde(default = \"S::kind\")]\n\n pub kind: String,\n\n #[serde(default)]\n\n pub metadata: ObjectMeta,\n\n #[serde(default)]\n\n pub spec: S,\n\n #[serde(flatten)]\n\n pub header: S::Header,\n\n #[serde(default)]\n\n pub status: S::Status,\n\n}\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":75,"score":30729.20764585802},{"content":"\n\n #[test]\n\n fn test_env() {\n\n let env = Env::key_value(\"lang\", \"english\");\n\n assert_eq!(env.name, \"lang\");\n\n assert_eq!(env.value, Some(\"english\".to_owned()));\n\n }\n\n}\n\n\n\n/*\n\n#[cfg(test)]\n\nmod test_delete {\n\n\n\n\n\n\n\n use serde_json;\n\n use serde::{ Serialize,Deserialize};\n\n\n\n use crate::{ Spec,Status, DefaultHeader, Crd, CrdNames};\n\n use super::DeleteResponse;\n","file_path":"src/k8-types/src/metadata.rs","rank":76,"score":30728.986542946157},{"content":" TemplateSpec {\n\n metadata: None,\n\n spec,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Debug, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\n#[serde(bound(serialize = \"K8Obj<S>: Serialize\"))]\n\n#[serde(bound(deserialize = \"K8Obj<S>: DeserializeOwned\"))]\n\npub struct K8List<S>\n\nwhere\n\n S: Spec,\n\n{\n\n pub api_version: String,\n\n pub kind: String,\n\n pub metadata: ListMetadata,\n\n pub items: Vec<K8Obj<S>>,\n\n}\n","file_path":"src/k8-types/src/metadata.rs","rank":77,"score":30728.98115569321},{"content":" grace_period_seconds: None,\n\n propagation_policy: None,\n\n }\n\n }\n\n}\n\n#[derive(Serialize, Debug)]\n\npub enum PropogationPolicy {\n\n Orphan,\n\n Background,\n\n Foreground,\n\n}\n\n\n\n#[derive(Serialize, Default)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Precondition {\n\n pub uid: String,\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n","file_path":"src/k8-types/src/options.rs","rank":78,"score":30728.83862324118},{"content":"\n\n pub fn as_item(&self) -> ItemMeta {\n\n ItemMeta {\n\n name: self.name.clone(),\n\n namespace: self.namespace.clone(),\n\n }\n\n }\n\n\n\n pub fn as_update(&self) -> UpdateItemMeta {\n\n UpdateItemMeta {\n\n name: self.name.clone(),\n\n namespace: self.namespace.clone(),\n\n resource_version: self.resource_version.clone(),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct InputObjectMeta {\n","file_path":"src/k8-types/src/metadata.rs","rank":79,"score":30728.587778460464},{"content":" name: name.into(),\n\n ..Default::default()\n\n }\n\n }\n\n\n\n /// create owner references point to this metadata\n\n /// if name or uid doesn't exists return none\n\n pub fn make_owner_reference<S: Spec>(&self) -> OwnerReferences {\n\n OwnerReferences {\n\n kind: S::kind(),\n\n name: self.name.clone(),\n\n uid: self.uid.clone(),\n\n // controller: Some(true),\n\n ..Default::default()\n\n }\n\n }\n\n\n\n pub fn namespace(&self) -> &str {\n\n &self.namespace\n\n }\n","file_path":"src/k8-types/src/metadata.rs","rank":80,"score":30728.2229799188},{"content":"\n\n /// create child references that points to this\n\n pub fn make_child_input_metadata<S: Spec>(&self, childname: String) -> InputObjectMeta {\n\n let owner_references: Vec<OwnerReferences> = vec![self.make_owner_reference::<S>()];\n\n\n\n InputObjectMeta {\n\n name: childname,\n\n namespace: self.namespace().to_owned(),\n\n owner_references,\n\n ..Default::default()\n\n }\n\n }\n\n\n\n pub fn as_input(&self) -> InputObjectMeta {\n\n InputObjectMeta {\n\n name: self.name.clone(),\n\n namespace: self.namespace.clone(),\n\n ..Default::default()\n\n }\n\n }\n","file_path":"src/k8-types/src/metadata.rs","rank":81,"score":30727.9772027376},{"content":" K8SpecObj {\n\n api_version: self.api_version.clone(),\n\n kind: self.kind.clone(),\n\n metadata: self.metadata.as_input(),\n\n spec: self.spec.clone(),\n\n ..Default::default()\n\n }\n\n }\n\n}\n\n\n\n/// For creating, only need spec\n\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\n#[serde(bound(serialize = \"S: Serialize, M: Serialize\"))]\n\n#[serde(bound(deserialize = \"S: DeserializeOwned, M: DeserializeOwned\"))]\n\npub struct K8SpecObj<S, M>\n\nwhere\n\n S: Spec,\n\n{\n\n pub api_version: String,\n","file_path":"src/k8-types/src/metadata.rs","rank":82,"score":30727.832318882545},{"content":" &TEST_API\n\n }\n\n }\n\n\n\n #[derive(Deserialize, Serialize,Debug, Default,Clone)]\n\n struct TestStatus(bool);\n\n\n\n impl Status for TestStatus{}\n\n\n\n #[test]\n\n fn test_deserialize_test_options() {\n\n let data = r#\"\n\n {\n\n \"kind\": \"Status\",\n\n \"apiVersion\": \"v1\",\n\n \"metadata\": {\n\n\n\n },\n\n \"status\": \"Success\",\n\n \"details\": {\n","file_path":"src/k8-types/src/metadata.rs","rank":83,"score":30727.685785831705},{"content":"\n\n use super::ListOptions;\n\n\n\n #[test]\n\n fn test_list_query() {\n\n let opt = ListOptions {\n\n pretty: Some(true),\n\n watch: Some(true),\n\n ..Default::default()\n\n };\n\n\n\n let qs = serde_qs::to_string(&opt).unwrap();\n\n assert_eq!(qs, \"pretty=true&watch=true\")\n\n }\n\n}\n","file_path":"src/k8-types/src/options.rs","rank":84,"score":30727.671774351515},{"content":"\n\n const TEST_API: Crd = Crd {\n\n group: \"test\",\n\n version: \"v1\",\n\n names: CrdNames {\n\n kind: \"test\",\n\n plural: \"test\",\n\n singular: \"test\",\n\n },\n\n };\n\n\n\n\n\n #[derive(Deserialize, Serialize, Default, Debug, Clone)]\n\n struct TestSpec {}\n\n\n\n impl Spec for TestSpec {\n\n type Status = TestStatus;\n\n type Header = DefaultHeader;\n\n\n\n fn metadata() -> &'static Crd {\n","file_path":"src/k8-types/src/metadata.rs","rank":85,"score":30727.462664714938},{"content":" \"name\": \"test\",\n\n \"group\": \"test.infinyon.com\",\n\n \"kind\": \"test\",\n\n \"uid\": \"62fc6733-c505-40c1-9dbb-dcd71e93528f\"\n\n }\"#;\n\n\n\n // Parse the string of data into serde_json::Value.\n\n let _status: DeleteResponse<TestSpec> = serde_json::from_str(data).expect(\"response\");\n\n }\n\n}\n\n*/\n\n\n\n/*\n\n\n\n\n\nimpl<'de, S> Deserialize<'de> for DeleteResponse<S>\n\n where\n\n S: Spec\n\n{\n\n\n","file_path":"src/k8-types/src/metadata.rs","rank":86,"score":30727.38778157146},{"content":" debug!(\"using k8 token: {:#?}\", token);\n\n Ok(Self {\n\n client,\n\n host,\n\n token,\n\n })\n\n }\n\n\n\n fn hostname(&self) -> &str {\n\n &self.host\n\n }\n\n\n\n fn finish_request<B>(&self, request: &mut Request<B>) -> Result<(), ClientError>\n\n where\n\n B: Into<Body>,\n\n {\n\n if let Some(ref token) = self.token {\n\n let full_token = format!(\"Bearer {}\", token);\n\n request\n\n .headers_mut()\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":87,"score":30391.678686210642},{"content":"/// K8 Cluster accessible thru API\n\n#[derive(Debug)]\n\npub struct K8Client {\n\n client: HyperClient,\n\n host: String,\n\n token: Option<String>,\n\n}\n\n\n\nimpl K8Client {\n\n // load using default k8 config\n\n pub fn default() -> Result<Self, ClientError> {\n\n let config = K8Config::load()?;\n\n Self::new(config)\n\n }\n\n\n\n pub fn new(config: K8Config) -> Result<Self, ClientError> {\n\n let helper = HyperConfigBuilder::new(config)?;\n\n let host = helper.host();\n\n let token = helper.token();\n\n let client = helper.build()?;\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":88,"score":30391.402448571487},{"content":"use std::fmt::Debug;\n\nuse std::fmt::Display;\n\nuse std::sync::Arc;\n\n\n\nuse async_trait::async_trait;\n\nuse bytes::Buf;\n\nuse futures_util::future::FutureExt;\n\nuse futures_util::stream::empty;\n\nuse futures_util::stream::BoxStream;\n\nuse futures_util::stream::Stream;\n\nuse futures_util::stream::StreamExt;\n\nuse futures_util::stream::TryStreamExt;\n\nuse hyper::body::aggregate;\n\nuse hyper::body::Bytes;\n\nuse hyper::header::HeaderValue;\n\nuse hyper::header::ACCEPT;\n\nuse hyper::header::AUTHORIZATION;\n\nuse hyper::header::CONTENT_TYPE;\n\nuse hyper::Body;\n\nuse hyper::Request;\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":89,"score":30389.11823791845},{"content":" .insert(AUTHORIZATION, HeaderValue::from_str(&full_token)?);\n\n }\n\n Ok(())\n\n }\n\n\n\n /// handle request. this is async function\n\n async fn handle_request<T>(&self, mut request: Request<Body>) -> Result<T, ClientError>\n\n where\n\n T: DeserializeOwned,\n\n {\n\n use std::io::Read;\n\n\n\n self.finish_request(&mut request)?;\n\n\n\n let resp = self.client.request(request).await?;\n\n\n\n let status = resp.status();\n\n debug!(\"response status: {:#?}\", status);\n\n\n\n if status.is_success() {\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":90,"score":30387.770633088207},{"content":"\n\n /// return stream of chunks, chunk is a bytes that are stream thru http channel\n\n #[allow(clippy::useless_conversion)]\n\n fn stream_of_chunks<S>(&self, uri: Uri) -> impl Stream<Item = Bytes> + '_\n\n where\n\n S: Spec,\n\n K8Watch<S>: DeserializeOwned,\n\n {\n\n debug!(\"streaming: {}\", uri);\n\n\n\n let ft = async move {\n\n let mut request = match http::Request::get(uri).body(Body::empty()) {\n\n Ok(req) => req,\n\n Err(err) => {\n\n error!(\"error uri err: {}\", err);\n\n return empty().right_stream();\n\n }\n\n };\n\n\n\n if let Err(err) = self.finish_request(&mut request) {\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":91,"score":30387.73884881246},{"content":" &self,\n\n metadata: &M,\n\n option: Option<DeleteOptions>,\n\n ) -> Result<DeleteStatus<S>, ClientError>\n\n where\n\n S: Spec,\n\n M: K8Meta + Send + Sync,\n\n {\n\n use crate::k8_types::DeletedStatus;\n\n\n\n let uri = item_uri::<S>(self.hostname(), metadata.name(), metadata.namespace(), None);\n\n debug!(\"{}: delete item on url: {}\", S::label(), uri);\n\n\n\n let body = if let Some(option_value) = option {\n\n let bytes = serde_json::to_vec(&option_value)?;\n\n trace!(\"delete raw : {}\", String::from_utf8_lossy(&bytes));\n\n\n\n bytes.into()\n\n } else {\n\n Body::empty()\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":92,"score":30386.81527696335},{"content":"use hyper::Uri;\n\nuse serde::de::DeserializeOwned;\n\nuse serde_json::Value;\n\nuse tracing::debug;\n\nuse tracing::error;\n\nuse tracing::trace;\n\n\n\nuse k8_config::K8Config;\n\nuse crate::meta_client::{ListArg, MetadataClient, NameSpace, PatchMergeType, TokenStreamResult};\n\nuse crate::k8_types::{\n\n InputK8Obj, K8List, K8Meta, K8Obj, DeleteStatus, K8Watch, Spec, UpdateK8ObjStatus,\n\n};\n\nuse crate::k8_types::options::{ListOptions, DeleteOptions};\n\n\n\nuse crate::uri::{item_uri, items_uri};\n\nuse crate::ClientError;\n\n\n\nuse super::wstream::WatchStream;\n\nuse super::{HyperClient, HyperConfigBuilder, ListStream};\n\n\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":93,"score":30386.664804760545},{"content":" );\n\n err\n\n });\n\n Ok(vec![match result {\n\n Ok(obj) => {\n\n trace!(\"de serialized: {:#?}\", obj);\n\n Ok(obj)\n\n }\n\n Err(err) => Err(err.into()),\n\n }])\n\n })\n\n }\n\n\n\n pub async fn retrieve_items_inner<S, N>(\n\n &self,\n\n namespace: N,\n\n options: Option<ListOptions>,\n\n ) -> Result<K8List<S>, ClientError>\n\n where\n\n S: Spec,\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":94,"score":30385.962187560515},{"content":" let bytes = serde_json::to_vec(&value)?;\n\n trace!(\n\n \"update raw: {}\",\n\n String::from_utf8_lossy(&bytes).to_string()\n\n );\n\n\n\n let request = Request::put(uri)\n\n .header(CONTENT_TYPE, \"application/json\")\n\n .body(bytes.into())?;\n\n\n\n self.handle_request(request).await\n\n }\n\n\n\n /// patch existing with spec\n\n async fn patch<S, M>(\n\n &self,\n\n metadata: &M,\n\n patch: &Value,\n\n merge_type: PatchMergeType,\n\n ) -> Result<K8Obj<S>, ClientError>\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":95,"score":30385.91696484715},{"content":" N: Into<NameSpace> + Send + Sync,\n\n {\n\n let uri = items_uri::<S>(self.hostname(), namespace.into(), options);\n\n debug!(\"{}: retrieving items: {}\", S::label(), uri);\n\n let items = self\n\n .handle_request(Request::get(uri).body(Body::empty())?)\n\n .await?;\n\n trace!(\"items retrieved: {:#?}\", items);\n\n Ok(items)\n\n }\n\n}\n\n\n\n#[async_trait]\n\nimpl MetadataClient for K8Client {\n\n type MetadataClientError = ClientError;\n\n\n\n /// retrieval a single item\n\n async fn retrieve_item<S, M>(&self, metadata: &M) -> Result<K8Obj<S>, ClientError>\n\n where\n\n S: Spec,\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":96,"score":30384.51603506919},{"content":" .header(CONTENT_TYPE, \"application/json\")\n\n .body(bytes.into())?;\n\n\n\n self.handle_request(request).await\n\n }\n\n\n\n /// update status\n\n async fn update_status<S>(&self, value: &UpdateK8ObjStatus<S>) -> Result<K8Obj<S>, ClientError>\n\n where\n\n S: Spec,\n\n {\n\n let uri = item_uri::<S>(\n\n self.hostname(),\n\n &value.metadata.name,\n\n &value.metadata.namespace,\n\n Some(\"/status\"),\n\n );\n\n debug!(\"updating '{}' status - uri: {}\", value.metadata.name, uri);\n\n trace!(\"update status: {:#?}\", &value);\n\n\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":97,"score":30384.120343108218},{"content":" where\n\n S: Spec,\n\n M: K8Meta + Display + Send + Sync,\n\n {\n\n debug!(\"patching item at '{}'\", metadata);\n\n trace!(\"patch json value: {:#?}\", patch);\n\n let uri = item_uri::<S>(self.hostname(), metadata.name(), metadata.namespace(), None);\n\n\n\n let bytes = serde_json::to_vec(&patch)?;\n\n\n\n trace!(\n\n \"patch uri: {}, raw: {}\",\n\n uri,\n\n String::from_utf8_lossy(&bytes).to_string()\n\n );\n\n\n\n let request = Request::patch(uri)\n\n .header(ACCEPT, \"application/json\")\n\n .header(CONTENT_TYPE, merge_type.content_type())\n\n .body(bytes.into())?;\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":98,"score":30383.21367020921},{"content":" /// return get stream of uri\n\n fn stream<S>(&self, uri: Uri) -> impl Stream<Item = TokenStreamResult<S, ClientError>> + '_\n\n where\n\n K8Watch<S>: DeserializeOwned,\n\n S: Spec + 'static,\n\n S::Status: 'static,\n\n S::Header: 'static,\n\n {\n\n self.stream_of_chunks(uri).map(move |chunk| {\n\n trace!(\n\n \"decoding raw stream : {}\",\n\n String::from_utf8_lossy(&chunk).to_string()\n\n );\n\n\n\n let result: Result<K8Watch<S>, serde_json::Error> = serde_json::from_slice(&chunk)\n\n .map_err(|err| {\n\n error!(\"parsing error, chunk_len: {}, error: {}\", chunk.len(), err);\n\n error!(\n\n \"error raw stream {}\",\n\n String::from_utf8_lossy(&chunk).to_string()\n","file_path":"src/k8-client/src/client/client_impl.rs","rank":99,"score":30382.400673701522}],"string":"[\n {\n \"content\": \"pub fn create_topic_stream_result(\\n\\n ttw_list: &TestTopicWatchList,\\n\\n) -> TokenStreamResult<TopicSpec, TopicStatus,ClientError> {\\n\\n let mut topic_watch_list = vec![];\\n\\n for ttw in ttw_list {\\n\\n topic_watch_list.push(Ok(create_topic_watch(&ttw)));\\n\\n }\\n\\n Ok(topic_watch_list)\\n\\n}\\n\\n\\n\\n//\\n\\n// Utility APIs\\n\\n//\\n\\n\\n\",\n \"file_path\": \"src/k8-client/k8-fixtures/src/test_fixtures.rs\",\n \"rank\": 0,\n \"score\": 111312.28505213931\n },\n {\n \"content\": \"fn run() -> Result<(), ConfigError> {\\n\\n let context = MinikubeContext::try_from_system()?;\\n\\n context.save()?;\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/k8-ctx-util/src/main.rs\",\n \"rank\": 1,\n \"score\": 91249.77959039006\n },\n {\n \"content\": \"#[allow(clippy::redundant_closure)]\\n\\npub fn as_token_stream_result<S, E>(events: Vec<K8Watch<S>>) -> TokenStreamResult<S, E>\\n\\nwhere\\n\\n S: Spec,\\n\\n S::Status: Serialize + DeserializeOwned,\\n\\n S::Header: Serialize + DeserializeOwned,\\n\\n{\\n\\n Ok(events.into_iter().map(|event| Ok(event)).collect())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-metadata-client/src/client.rs\",\n \"rank\": 2,\n \"score\": 89832.7100231961\n },\n {\n \"content\": \"#[proc_macro_derive(Difference)]\\n\\npub fn diff(input: TokenStream1) -> TokenStream1 {\\n\\n\\n\\n // Parse the string representation\\n\\n let ast: DeriveInput = syn::parse(input).unwrap();\\n\\n\\n\\n let expanded = diff::geneate_diff_trait(&ast);\\n\\n expanded.into()\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/k8-diff/k8-dderive/src/lib.rs\",\n \"rank\": 3,\n \"score\": 77195.16997633707\n },\n {\n \"content\": \" /// Kubernetes Spec\\n\\n pub trait Spec:\\n\\n Sized + Debug + Clone + Default + Serialize + DeserializeOwned + Send + Sync\\n\\n {\\n\\n type Status: Status;\\n\\n\\n\\n type Header: Header;\\n\\n\\n\\n /// if true, spec is namespaced\\n\\n const NAME_SPACED: bool = true;\\n\\n\\n\\n /// return uri for single instance\\n\\n fn metadata() -> &'static Crd;\\n\\n\\n\\n fn label() -> &'static str {\\n\\n Self::metadata().names.kind\\n\\n }\\n\\n\\n\\n fn api_version() -> String {\\n\\n let metadata = Self::metadata();\\n\\n if metadata.group == \\\"core\\\" {\\n\",\n \"file_path\": \"src/k8-types/src/lib.rs\",\n \"rank\": 4,\n \"score\": 76313.4596724619\n },\n {\n \"content\": \" pub trait Status:\\n\\n Sized + Debug + Clone + Default + Serialize + DeserializeOwned + Send + Sync\\n\\n {\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/lib.rs\",\n \"rank\": 5,\n \"score\": 76313.4596724619\n },\n {\n \"content\": \" pub trait Header:\\n\\n Sized + Debug + Clone + Default + Serialize + DeserializeOwned + Send + Sync\\n\\n {\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/lib.rs\",\n \"rank\": 6,\n \"score\": 76313.4596724619\n },\n {\n \"content\": \"pub fn geneate_diff_trait(input: &DeriveInput) -> TokenStream {\\n\\n let name = &input.ident;\\n\\n let decoded_field_tokens = decode_fields(&input.data);\\n\\n\\n\\n quote! {\\n\\n\\n\\n impl <'a>k8_diff::Changes<'a> for #name {\\n\\n\\n\\n fn diff(&self, new: &'a Self) -> k8_diff::Diff {\\n\\n\\n\\n let mut s_diff = k8_diff::DiffStruct::new();\\n\\n\\n\\n #decoded_field_tokens\\n\\n \\n\\n if s_diff.no_change() {\\n\\n return k8_diff::Diff::None\\n\\n }\\n\\n \\n\\n k8_diff::Diff::Change(k8_diff::DiffValue::Struct(s_diff))\\n\\n }\\n\\n }\\n\\n\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-diff/k8-dderive/src/diff.rs\",\n \"rank\": 7,\n \"score\": 74593.48713464057\n },\n {\n \"content\": \"pub trait K8Meta {\\n\\n /// resource name\\n\\n fn name(&self) -> &str;\\n\\n\\n\\n /// namespace\\n\\n fn namespace(&self) -> &str;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 8,\n \"score\": 74320.8383027833\n },\n {\n \"content\": \"pub trait DeserializeWith: Sized {\\n\\n fn deserialize_with<'de, D>(de: D) -> Result<Self, D::Error>\\n\\n where\\n\\n D: Deserializer<'de>;\\n\\n}\\n\\n\\n\\n#[allow(clippy::upper_case_acronyms)]\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\n#[serde(tag = \\\"type\\\", content = \\\"object\\\")]\\n\\n#[serde(bound(serialize = \\\"K8Obj<S>: Serialize\\\"))]\\n\\n#[serde(bound(deserialize = \\\"K8Obj<S>: DeserializeOwned\\\"))]\\n\\npub enum K8Watch<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n ADDED(K8Obj<S>),\\n\\n MODIFIED(K8Obj<S>),\\n\\n DELETED(K8Obj<S>),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 9,\n \"score\": 72936.74817911725\n },\n {\n \"content\": \"pub trait LabelProvider: Sized {\\n\\n fn set_label_map(self, labels: HashMap<String, String>) -> Self;\\n\\n\\n\\n /// helper for setting list of labels\\n\\n fn set_labels<T: ToString>(self, labels: Vec<(T, T)>) -> Self {\\n\\n let mut label_map = HashMap::new();\\n\\n for (key, value) in labels {\\n\\n label_map.insert(key.to_string(), value.to_string());\\n\\n }\\n\\n self.set_label_map(label_map)\\n\\n }\\n\\n}\\n\\n\\n\\n/// metadata associated with object when returned\\n\\n/// here name and namespace must be populated\\n\\n#[derive(Deserialize, Serialize, PartialEq, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\", default)]\\n\\npub struct ObjectMeta {\\n\\n // mandatory fields\\n\\n pub name: String,\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 10,\n \"score\": 71074.35258810218\n },\n {\n \"content\": \"type K8ListImpl<'a, S> =\\n\\n Option<Pin<Box<dyn Future<Output = Result<K8List<S>, ClientError>> + Send + 'a>>>;\\n\\n\\n\\npub struct ListStream<'a, S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n arg: Option<ListArg>,\\n\\n limit: u32,\\n\\n done: bool,\\n\\n namespace: NameSpace,\\n\\n client: SharedK8Client,\\n\\n inner: K8ListImpl<'a, S>,\\n\\n data1: PhantomData<S>,\\n\\n}\\n\\n\\n\\nimpl<S> ListStream<'_, S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\",\n \"file_path\": \"src/k8-client/src/client/list_stream.rs\",\n \"rank\": 11,\n \"score\": 70788.7058916614\n },\n {\n \"content\": \"// Get absolute path to the \\\"target\\\" directory (\\\"build\\\" dir)\\n\\nfn get_target_dir() -> PathBuf {\\n\\n let bin = env::current_exe().expect(\\\"exe path\\\");\\n\\n let mut target_dir = PathBuf::from(bin.parent().expect(\\\"bin parent\\\"));\\n\\n while target_dir.file_name() != Some(OsStr::new(\\\"target\\\")) {\\n\\n target_dir.pop();\\n\\n }\\n\\n target_dir\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-client/k8-fixtures/src/test_fixtures.rs\",\n \"rank\": 12,\n \"score\": 68890.03992445287\n },\n {\n \"content\": \"/// Gets the current entry for a given host in `/etc/hosts` if there is one\\n\\nfn get_host_entry(hostname: &str) -> Result<std::option::Option<IpAddr>, ConfigError> {\\n\\n // Get all of the host entries\\n\\n let hosts = hostfile::parse_hostfile()\\n\\n .map_err(|e| ConfigError::Other(format!(\\\"failed to get /etc/hosts entries: {}\\\", e)))?;\\n\\n // Try to find a host entry with the given hostname\\n\\n let minikube_entry = hosts\\n\\n .into_iter()\\n\\n .find(|entry| entry.names.iter().any(|name| name == hostname));\\n\\n Ok(minikube_entry.map(|entry| entry.ip))\\n\\n}\\n\\n\\n\\n/// *Deprecated*: use [`MinikubeContext`] instead\\n\\n///\\n\\n/// Updates kubectl context settings\\n\\n///\\n\\n/// [`MinikubeContext`]: ./struct.MinikubeContext\\n\\npub mod v1 {\\n\\n use std::env;\\n\\n use std::fs::OpenOptions;\\n\\n use std::io;\\n\",\n \"file_path\": \"src/k8-config/src/context.rs\",\n \"rank\": 13,\n \"score\": 68434.2308678135\n },\n {\n \"content\": \"pub fn create_topic_watch(ttw: &TestTopicWatch) -> K8Watch<TopicSpec, TopicStatus> {\\n\\n let target_dir = get_target_dir();\\n\\n let path = get_top_dir(&target_dir);\\n\\n let mut contents = String::new();\\n\\n let (filename, file_has_options) = if ttw.ignore_rack_assignment.is_none() {\\n\\n (\\n\\n String::from(\\\"k8-client/k8-fixtures/data/topic_no_options.tmpl\\\"),\\n\\n false,\\n\\n )\\n\\n } else {\\n\\n (\\n\\n String::from(\\\"k8-client/k8-fixtures/data/topic_all.tmpl\\\"),\\n\\n true,\\n\\n )\\n\\n };\\n\\n let f = File::open(path.join(filename));\\n\\n f.unwrap().read_to_string(&mut contents).unwrap();\\n\\n\\n\\n contents = contents.replace(\\\"{type}\\\", &*ttw.operation);\\n\\n contents = contents.replace(\\\"{name}\\\", &*ttw.name);\\n\",\n \"file_path\": \"src/k8-client/k8-fixtures/src/test_fixtures.rs\",\n \"rank\": 14,\n \"score\": 64796.4136535382\n },\n {\n \"content\": \"// Spec that can store in meta store\\n\\npub trait StoreSpec: Sized + Default + Debug + Clone {\\n\\n type K8Spec: Spec;\\n\\n type Status: Sized + Clone + Default + Debug;\\n\\n type Key: Ord + Clone + Debug + ToString;\\n\\n type Owner: StoreSpec;\\n\\n\\n\\n const LABEL: &'static str;\\n\\n\\n\\n // convert kubernetes objects into KV value\\n\\n fn convert_from_k8(k8_obj: K8Obj<Self::K8Spec>) -> Result<Option<MetaItem<Self>>, IoError>;\\n\\n}\\n\\n\\n\\n/// Metadata object. Used to be KVObject int sc-core\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct MetaItem<S>\\n\\nwhere\\n\\n S: StoreSpec,\\n\\n{\\n\\n pub spec: S,\\n\\n pub status: S::Status,\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 15,\n \"score\": 63070.26091228848\n },\n {\n \"content\": \"/// items uri\\n\\npub fn items_uri<S>(host: &str, namespace: NameSpace, list_options: Option<ListOptions>) -> Uri\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n let ns = if S::NAME_SPACED {\\n\\n namespace\\n\\n } else {\\n\\n NameSpace::All\\n\\n };\\n\\n let crd = S::metadata();\\n\\n let uri_value = prefix_uri(crd, host, ns, list_options);\\n\\n let uri: Uri = uri_value.parse().unwrap();\\n\\n uri\\n\\n}\\n\\n\\n\\n/// related to query parameters and uri\\n\\n///\\n\\n///\\n\\n///\\n\\n/// generate prefix for given crd\\n\\n/// if crd group is core then /api is used otherwise /apis + group\\n\\n\\n\",\n \"file_path\": \"src/k8-client/src/uri.rs\",\n \"rank\": 16,\n \"score\": 61870.900118868216\n },\n {\n \"content\": \"/// items uri\\n\\npub fn item_uri<S>(host: &str, name: &str, namespace: &str, sub_resource: Option<&str>) -> Uri\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n let ns = if S::NAME_SPACED {\\n\\n NameSpace::Named(namespace.to_owned())\\n\\n } else {\\n\\n NameSpace::All\\n\\n };\\n\\n let crd = S::metadata();\\n\\n let prefix = prefix_uri(crd, host, ns, None);\\n\\n let uri_value = format!(\\\"{}/{}{}\\\", prefix, name, sub_resource.unwrap_or(\\\"\\\"));\\n\\n let uri: Uri = uri_value.parse().unwrap();\\n\\n uri\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-client/src/uri.rs\",\n \"rank\": 17,\n \"score\": 60093.64851747533\n },\n {\n \"content\": \"pub fn prefix_uri<N>(crd: &Crd, host: &str, ns: N, options: Option<ListOptions>) -> String\\n\\nwhere\\n\\n N: Into<NameSpace>,\\n\\n{\\n\\n let namespace = ns.into();\\n\\n let version = crd.version;\\n\\n let plural = crd.names.plural;\\n\\n let group = crd.group;\\n\\n let api_prefix = match group {\\n\\n \\\"core\\\" => \\\"api\\\".to_owned(),\\n\\n _ => format!(\\\"apis/{}\\\", group),\\n\\n };\\n\\n\\n\\n let query = if let Some(opt) = options {\\n\\n let mut query = \\\"?\\\".to_owned();\\n\\n let qs = serde_qs::to_string(&opt).unwrap();\\n\\n query.push_str(&qs);\\n\\n query\\n\\n } else {\\n\\n \\\"\\\".to_owned()\\n\",\n \"file_path\": \"src/k8-client/src/uri.rs\",\n \"rank\": 18,\n \"score\": 60093.64851747533\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\nstruct MinikubeConfig {\\n\\n #[serde(rename = \\\"Name\\\")]\\n\\n name: String,\\n\\n #[serde(rename = \\\"Nodes\\\")]\\n\\n nodes: Vec<MinikubeNode>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-config/src/context.rs\",\n \"rank\": 19,\n \"score\": 52603.177180075654\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\nstruct MinikubeNode {\\n\\n #[serde(rename = \\\"IP\\\")]\\n\\n ip: IpAddr,\\n\\n #[serde(rename = \\\"Port\\\")]\\n\\n port: u16,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-config/src/context.rs\",\n \"rank\": 20,\n \"score\": 52603.177180075654\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct MinikubeProfile {\\n\\n /// The name of the minikube profile, usually \\\"minikube\\\"\\n\\n name: String,\\n\\n /// The active minikube node, with IP and port\\n\\n node: MinikubeNode,\\n\\n}\\n\\n\\n\\nimpl MinikubeProfile {\\n\\n /// Gets minikube's current profile\\n\\n fn load() -> Result<MinikubeProfile, ConfigError> {\\n\\n let output = Command::new(\\\"minikube\\\")\\n\\n .args(&[\\\"profile\\\", \\\"list\\\", \\\"-o\\\", \\\"json\\\"])\\n\\n .output()?;\\n\\n let output_string = String::from_utf8(output.stdout).map_err(|e| {\\n\\n ConfigError::Other(format!(\\n\\n \\\"`minikube profile list -o json` did not give UTF-8: {}\\\",\\n\\n e\\n\\n ))\\n\\n })?;\\n\\n let profiles: MinikubeProfileWrapper =\\n\",\n \"file_path\": \"src/k8-config/src/context.rs\",\n \"rank\": 21,\n \"score\": 52603.177180075654\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\nstruct MinikubeProfileJson {\\n\\n #[serde(rename = \\\"Name\\\")]\\n\\n name: String,\\n\\n #[serde(rename = \\\"Status\\\")]\\n\\n status: String,\\n\\n #[serde(rename = \\\"Config\\\")]\\n\\n config: MinikubeConfig,\\n\\n}\\n\\n\\n\\n/// A description of the active Minikube instance, including IP and port\\n\",\n \"file_path\": \"src/k8-config/src/context.rs\",\n \"rank\": 22,\n \"score\": 51568.77419488529\n },\n {\n \"content\": \"#[derive(Debug, Deserialize)]\\n\\nstruct MinikubeProfileWrapper {\\n\\n valid: Vec<MinikubeProfileJson>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-config/src/context.rs\",\n \"rank\": 23,\n \"score\": 51568.77419488529\n },\n {\n \"content\": \"/// Performs following\\n\\n/// add minikube IP address to /etc/host\\n\\n/// create new kubectl cluster and context which uses minikube name\\n\\nfn main() {\\n\\n if let Err(e) = run() {\\n\\n println!(\\\"{}\\\", e);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-ctx-util/src/main.rs\",\n \"rank\": 24,\n \"score\": 50539.781489451634\n },\n {\n \"content\": \"struct FluvioHyperExecutor;\\n\\n\\n\\nimpl<F: Future + Send + 'static> Executor<F> for FluvioHyperExecutor {\\n\\n fn execute(&self, fut: F) {\\n\\n spawn(async { drop(fut.await) });\\n\\n }\\n\\n}\\n\\n\\n\\n/// hyper connector that uses fluvio TLS\\n\\n#[derive(Clone)]\\n\\npub struct TlsHyperConnector(Arc<TlsConnector>);\\n\\n\\n\\nimpl TlsHyperConnector {\\n\\n fn new(connector: TlsConnector) -> Self {\\n\\n Self(Arc::new(connector))\\n\\n }\\n\\n}\\n\\n\\n\\n#[allow(clippy::type_complexity)]\\n\\nimpl Service<Uri> for TlsHyperConnector {\\n\",\n \"file_path\": \"src/k8-client/src/client/config_native.rs\",\n \"rank\": 25,\n \"score\": 49696.357919055896\n },\n {\n \"content\": \"pub trait Changes {\\n\\n type Replace;\\n\\n type Patch;\\n\\n\\n\\n fn diff(&self, new: &Self) -> Result<Diff<Self::Replace, Self::Patch>, DiffError>;\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum DiffError {\\n\\n DiffValue, // json values are different\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for DiffError {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"JSON value types are different\\\")\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::error::Error for DiffError {}\\n\\n\\n\",\n \"file_path\": \"src/k8-diff/src/lib.rs\",\n \"rank\": 26,\n \"score\": 47737.00958970103\n },\n {\n \"content\": \"pub trait ConfigBuilder: Sized {\\n\\n type Client;\\n\\n\\n\\n fn new() -> Self;\\n\\n\\n\\n fn build(self) -> Result<Self::Client, ClientError>;\\n\\n\\n\\n fn load_ca_certificate(self, ca_path: impl AsRef<Path>) -> Result<Self, IoError>;\\n\\n\\n\\n // load from ca data\\n\\n fn load_ca_cert_with_data(self, data: Vec<u8>) -> Result<Self, IoError>;\\n\\n\\n\\n // load client certificate (crt) and private key\\n\\n fn load_client_certificate<P: AsRef<Path>>(\\n\\n self,\\n\\n client_crt_path: P,\\n\\n client_key_path: P,\\n\\n ) -> Result<Self, IoError>;\\n\\n\\n\\n fn load_client_certificate_with_data(\\n\",\n \"file_path\": \"src/k8-client/src/cert.rs\",\n \"rank\": 27,\n \"score\": 44365.48784799347\n },\n {\n \"content\": \"type SerdeObj = Map<String, Value>;\\n\\npub type JsonDiff = Diff<Value, PatchObject>;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct PatchObject(HashMap<String, JsonDiff>);\\n\\n\\n\\nimpl PatchObject {\\n\\n // diff { \\\"a\\\": 1,\\\"b\\\": 2}, { \\\"a\\\": 3, \\\"b\\\": 2} => { \\\"a\\\": 1}\\n\\n fn diff(old: &SerdeObj, new: &SerdeObj) -> Result<Self, DiffError> {\\n\\n let mut map: HashMap<String, JsonDiff> = HashMap::new();\\n\\n\\n\\n for (key, new_val) in new.iter() {\\n\\n match old.get(key) {\\n\\n Some(old_val) => {\\n\\n if old_val != new_val {\\n\\n let diff_value = old_val.diff(new_val)?;\\n\\n map.insert(key.clone(), diff_value);\\n\\n }\\n\\n }\\n\\n _ => {\\n\",\n \"file_path\": \"src/k8-diff/src/json/mod.rs\",\n \"rank\": 28,\n \"score\": 42727.992900325204\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait MetadataClient: Send + Sync {\\n\\n type MetadataClientError: MetadataClientError\\n\\n + Send\\n\\n + Display\\n\\n + From<IoError>\\n\\n + From<DiffError>\\n\\n + From<SerdeJsonError>;\\n\\n\\n\\n /// retrieval a single item\\n\\n async fn retrieve_item<S, M>(\\n\\n &self,\\n\\n metadata: &M,\\n\\n ) -> Result<K8Obj<S>, Self::MetadataClientError>\\n\\n where\\n\\n S: Spec,\\n\\n M: K8Meta + Send + Sync;\\n\\n\\n\\n /// retrieve all items a single chunk\\n\\n /// this may cause client to hang if there are too many items\\n\\n async fn retrieve_items<S, N>(\\n\",\n \"file_path\": \"src/k8-metadata-client/src/client.rs\",\n \"rank\": 29,\n \"score\": 41442.573065625955\n },\n {\n \"content\": \"// read file\\n\\nfn read_file(name: &str) -> Option<String> {\\n\\n let full_path = format!(\\\"{}/{}\\\", BASE_DIR, name);\\n\\n match read_to_string(&full_path) {\\n\\n Ok(value) => Some(value),\\n\\n Err(err) => {\\n\\n error!(\\\"no {} founded as pod in {}\\\", name, full_path);\\n\\n trace!(\\\"unable to read pod: {} value: {}\\\", name, err);\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/k8-config/src/pod.rs\",\n \"rank\": 30,\n \"score\": 41270.48395798693\n },\n {\n \"content\": \"fn decode_fields(data: &Data) -> TokenStream {\\n\\n match *data {\\n\\n Data::Struct(ref data) => {\\n\\n match data.fields {\\n\\n Fields::Named(ref fields) => {\\n\\n let recurse = fields.named.iter().map(|f| {\\n\\n let fname = &f.ident;\\n\\n \\n\\n quote! {\\n\\n // s_diff.insert(\\\"replicas\\\".to_owned(), self.replicas.diff(&new.replicas));\\n\\n s_diff.insert(stringify!(#fname).to_owned(), self.#fname.diff(&new.#fname));\\n\\n \\n\\n }\\n\\n \\n\\n });\\n\\n\\n\\n quote! {\\n\\n #(#recurse)*\\n\\n }\\n\\n }\\n\\n _ => unimplemented!(),\\n\\n }\\n\\n }\\n\\n _ => unimplemented!(),\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/k8-diff/k8-dderive/src/diff.rs\",\n \"rank\": 31,\n \"score\": 40800.21698931014\n },\n {\n \"content\": \"/// trait for metadata client\\n\\npub trait MetadataClientError: Debug + Display {\\n\\n /// is not founded\\n\\n fn not_founded(&self) -> bool;\\n\\n\\n\\n // create new patch error\\n\\n fn patch_error() -> Self;\\n\\n}\\n\\n\\n\\n// For error mapping: see: https://doc.rust-lang.org/nightly/core/convert/trait.From.html\\n\\n\\n\\npub type TokenStreamResult<S, E> = Result<Vec<Result<K8Watch<S>, E>>, E>;\\n\\n\\n\",\n \"file_path\": \"src/k8-metadata-client/src/client.rs\",\n \"rank\": 32,\n \"score\": 40648.60907259954\n },\n {\n \"content\": \"// Get absolute path to the project's top dir, given target dir\\n\\nfn get_top_dir<'a>(target_dir: &'a Path) -> &'a Path {\\n\\n target_dir.parent().expect(\\\"target parent\\\")\\n\\n}\\n\",\n \"file_path\": \"src/k8-client/k8-fixtures/src/test_fixtures.rs\",\n \"rank\": 33,\n \"score\": 36588.94995819749\n },\n {\n \"content\": \" pub name: String,\\n\\n pub labels: HashMap<String, String>,\\n\\n pub namespace: String,\\n\\n pub owner_references: Vec<OwnerReferences>,\\n\\n pub finalizers: Vec<String>,\\n\\n pub annotations: HashMap<String, String>,\\n\\n}\\n\\n\\n\\nimpl LabelProvider for InputObjectMeta {\\n\\n fn set_label_map(mut self, labels: HashMap<String, String>) -> Self {\\n\\n self.labels = labels;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for InputObjectMeta {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{}:{}\\\", self.name, self.namespace)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 34,\n \"score\": 30739.540383184172\n },\n {\n \"content\": \"#[derive(Deserialize, Serialize, Debug, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct ListMetadata {\\n\\n pub _continue: Option<String>,\\n\\n pub resource_version: String,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Default, Debug, PartialEq, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct LabelSelector {\\n\\n pub match_labels: HashMap<String, String>,\\n\\n}\\n\\n\\n\\nimpl LabelSelector {\\n\\n pub fn new_labels<T: Into<String>>(labels: Vec<(T, T)>) -> Self {\\n\\n let mut match_labels = HashMap::new();\\n\\n for (key, value) in labels {\\n\\n match_labels.insert(key.into(), value.into());\\n\\n }\\n\\n LabelSelector { match_labels }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 35,\n \"score\": 30738.67281548348\n },\n {\n \"content\": \"pub struct MetaItemContext {\\n\\n pub item_ctx: Option<ObjectMeta>,\\n\\n pub parent_ctx: Option<ObjectMeta>,\\n\\n}\\n\\n\\n\\nimpl MetaItemContext {\\n\\n pub fn with_ctx(mut self, ctx: ObjectMeta) -> Self {\\n\\n self.item_ctx = Some(ctx);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn with_parent_ctx(mut self, ctx: ObjectMeta) -> Self {\\n\\n self.parent_ctx = Some(ctx);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn make_parent_ctx(&self) -> Self {\\n\\n if self.item_ctx.is_some() {\\n\\n Self::default().with_parent_ctx(self.item_ctx.as_ref().unwrap().clone())\\n\\n } else {\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 36,\n \"score\": 30738.55506451868\n },\n {\n \"content\": \"impl From<ObjectMeta> for ItemMeta {\\n\\n fn from(meta: ObjectMeta) -> Self {\\n\\n Self {\\n\\n name: meta.name,\\n\\n namespace: meta.namespace,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// used for updating item\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct UpdateItemMeta {\\n\\n pub name: String,\\n\\n pub namespace: String,\\n\\n pub resource_version: String,\\n\\n}\\n\\n\\n\\nimpl From<ObjectMeta> for UpdateItemMeta {\\n\\n fn from(meta: ObjectMeta) -> Self {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 37,\n \"score\": 30737.953773522997\n },\n {\n \"content\": \" fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\\n\\n where D: Deserializer<'de>,\\n\\n {\\n\\n use serde::de::{ Visitor, MapAccess};\\n\\n\\n\\n struct StatusVisitor<S: Spec>(PhantomData<fn() -> S>);\\n\\n\\n\\n impl<'de,S> Visitor<'de> for StatusVisitor<S>\\n\\n where\\n\\n S: Spec,\\n\\n DeleteResponse<S>: Deserialize<'de>,\\n\\n {\\n\\n type Value = DeleteResponse<S>;\\n\\n\\n\\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\\n\\n formatter.write_str(\\\"string or json\\\")\\n\\n }\\n\\n\\n\\n fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>\\n\\n where\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 38,\n \"score\": 30737.73590184691\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl From<ObjectMeta> for InputObjectMeta {\\n\\n fn from(meta: ObjectMeta) -> Self {\\n\\n Self {\\n\\n name: meta.name,\\n\\n namespace: meta.namespace,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// used for retrieving,updating and deleting item\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct ItemMeta {\\n\\n pub name: String,\\n\\n pub namespace: String,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 39,\n \"score\": 30737.0165415251\n },\n {\n \"content\": \"impl<S> K8Obj<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n #[allow(dead_code)]\\n\\n pub fn new<N>(name: N, spec: S) -> Self\\n\\n where\\n\\n N: Into<String>,\\n\\n {\\n\\n Self {\\n\\n api_version: S::api_version(),\\n\\n kind: S::kind(),\\n\\n metadata: ObjectMeta::named(name),\\n\\n spec,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n #[allow(dead_code)]\\n\\n pub fn set_status(mut self, status: S::Status) -> Self {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 40,\n \"score\": 30736.701645400542\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// name is optional for template\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone, PartialEq)]\\n\\n#[serde(rename_all = \\\"camelCase\\\", default)]\\n\\npub struct TemplateMeta {\\n\\n pub name: Option<String>,\\n\\n pub creation_timestamp: Option<String>,\\n\\n pub labels: HashMap<String, String>,\\n\\n}\\n\\n\\n\\nimpl LabelProvider for TemplateMeta {\\n\\n fn set_label_map(mut self, labels: HashMap<String, String>) -> Self {\\n\\n self.labels = labels;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TemplateMeta {\\n\\n /// create with name and default namespace\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 41,\n \"score\": 30736.242170680674\n },\n {\n \"content\": \" return metadata.version.to_owned();\\n\\n }\\n\\n format!(\\\"{}/{}\\\", metadata.group, metadata.version)\\n\\n }\\n\\n\\n\\n fn kind() -> String {\\n\\n Self::metadata().names.kind.to_owned()\\n\\n }\\n\\n\\n\\n /// in case of applying, we have some fields that are generated\\n\\n /// or override. So need to special logic to reset them so we can do proper comparison\\n\\n fn make_same(&mut self, _other: &Self) {}\\n\\n }\\n\\n\\n\\n #[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n pub struct DefaultHeader {}\\n\\n\\n\\n impl Header for DefaultHeader {}\\n\\n}\\n\",\n \"file_path\": \"src/k8-types/src/lib.rs\",\n \"rank\": 42,\n \"score\": 30735.840343571683\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::fmt;\\n\\nuse std::fmt::Debug;\\n\\nuse std::marker::PhantomData;\\n\\n\\n\\nuse serde::de::{DeserializeOwned, Deserializer};\\n\\nuse serde::Deserialize;\\n\\nuse serde::Serialize;\\n\\n\\n\\nuse crate::Spec;\\n\\n\\n\\npub const DEFAULT_NS: &str = \\\"default\\\";\\n\\npub const TYPE_OPAQUE: &str = \\\"Opaque\\\";\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 43,\n \"score\": 30735.519955589494\n },\n {\n \"content\": \" ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n /// provide builder pattern setter\\n\\n pub fn set_labels<T: Into<String>>(mut self, labels: Vec<(T, T)>) -> Self {\\n\\n let mut label_map = HashMap::new();\\n\\n for (key, value) in labels {\\n\\n label_map.insert(key.into(), value.into());\\n\\n }\\n\\n self.labels = label_map;\\n\\n self\\n\\n }\\n\\n\\n\\n /// create with name and default namespace\\n\\n pub fn named<S>(name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n Self {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 44,\n \"score\": 30735.339093994397\n },\n {\n \"content\": \" pub fn named<S>(name: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n Self {\\n\\n name: Some(name.into()),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone, PartialEq)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct TemplateSpec<S> {\\n\\n pub metadata: Option<TemplateMeta>,\\n\\n pub spec: S,\\n\\n}\\n\\n\\n\\nimpl<S> TemplateSpec<S> {\\n\\n pub fn new(spec: S) -> Self {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 45,\n \"score\": 30735.27827500885\n },\n {\n \"content\": \" pub namespace: String,\\n\\n pub uid: String,\\n\\n pub creation_timestamp: String,\\n\\n pub generation: Option<i32>,\\n\\n pub resource_version: String,\\n\\n // optional\\n\\n pub cluster_name: Option<String>,\\n\\n pub deletion_timestamp: Option<String>,\\n\\n pub deletion_grace_period_seconds: Option<u32>,\\n\\n pub labels: HashMap<String, String>,\\n\\n pub owner_references: Vec<OwnerReferences>,\\n\\n pub annotations: HashMap<String, String>,\\n\\n pub finalizers: Vec<String>,\\n\\n}\\n\\n\\n\\nimpl LabelProvider for ObjectMeta {\\n\\n fn set_label_map(mut self, labels: HashMap<String, String>) -> Self {\\n\\n self.labels = labels;\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 46,\n \"score\": 30735.22614960466\n },\n {\n \"content\": \" pub fn with_ctx(mut self, ctx: MetaItemContext) -> Self {\\n\\n self.ctx = ctx;\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn key(&self) -> &S::Key {\\n\\n &self.key\\n\\n }\\n\\n\\n\\n pub fn key_owned(&self) -> S::Key {\\n\\n self.key.clone()\\n\\n }\\n\\n\\n\\n pub fn my_key(self) -> S::Key {\\n\\n self.key\\n\\n }\\n\\n\\n\\n pub fn spec(&self) -> &S {\\n\\n &self.spec\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 47,\n \"score\": 30734.98902594919\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl K8Meta for ObjectMeta {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n\\n\\n fn namespace(&self) -> &str {\\n\\n &self.namespace\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ObjectMeta {\\n\\n pub fn new<S>(name: S, name_space: S) -> Self\\n\\n where\\n\\n S: Into<String>,\\n\\n {\\n\\n Self {\\n\\n name: name.into(),\\n\\n namespace: name_space.into(),\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 48,\n \"score\": 30734.975549138417\n },\n {\n \"content\": \" pub kind: String,\\n\\n pub metadata: M,\\n\\n pub spec: S,\\n\\n #[serde(flatten)]\\n\\n pub header: S::Header,\\n\\n}\\n\\n\\n\\nimpl<S, M> K8SpecObj<S, M>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n pub fn new(spec: S, metadata: M) -> Self\\n\\n where\\n\\n M: Default,\\n\\n {\\n\\n Self {\\n\\n api_version: S::api_version(),\\n\\n kind: S::kind(),\\n\\n metadata,\\n\\n spec,\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 49,\n \"score\": 30734.89946538372\n },\n {\n \"content\": \"impl<S> fmt::Display for MetaItem<S>\\n\\nwhere\\n\\n S: StoreSpec,\\n\\n S::Key: Display,\\n\\n{\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"MetaItem {} key: {}\\\", S::LABEL, self.key())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S> From<MetaItem<S>> for (S::Key, S, S::Status)\\n\\nwhere\\n\\n S: StoreSpec,\\n\\n{\\n\\n fn from(val: MetaItem<S>) -> Self {\\n\\n (val.key, val.spec, val.status)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone)]\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 50,\n \"score\": 30734.837686964176\n },\n {\n \"content\": \" pub key: S::Key,\\n\\n pub ctx: MetaItemContext,\\n\\n}\\n\\n\\n\\nimpl<S> MetaItem<S>\\n\\nwhere\\n\\n S: StoreSpec,\\n\\n{\\n\\n pub fn new<J>(key: J, spec: S, status: S::Status, ctx: MetaItemContext) -> Self\\n\\n where\\n\\n J: Into<S::Key>,\\n\\n {\\n\\n Self {\\n\\n key: key.into(),\\n\\n spec,\\n\\n status,\\n\\n ctx,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 51,\n \"score\": 30734.666219566832\n },\n {\n \"content\": \" pub fn is_owned(&self, uid: &str) -> bool {\\n\\n match &self.ctx.parent_ctx {\\n\\n Some(parent) => parent.uid == uid,\\n\\n None => false,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn with_spec<J>(key: J, spec: S) -> Self\\n\\n where\\n\\n J: Into<S::Key>,\\n\\n {\\n\\n Self::new(\\n\\n key.into(),\\n\\n spec,\\n\\n S::Status::default(),\\n\\n MetaItemContext::default(),\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 52,\n \"score\": 30734.5766708061\n },\n {\n \"content\": \"\\n\\nimpl<S> K8List<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n #[allow(dead_code)]\\n\\n pub fn new() -> Self {\\n\\n K8List {\\n\\n api_version: S::api_version(),\\n\\n items: vec![],\\n\\n kind: S::kind(),\\n\\n metadata: ListMetadata {\\n\\n _continue: None,\\n\\n resource_version: S::api_version(),\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S> Default for K8List<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 53,\n \"score\": 30734.333537546394\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<S> UpdateK8ObjStatus<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n pub fn new(status: S::Status, metadata: UpdateItemMeta) -> Self {\\n\\n Self {\\n\\n api_version: S::api_version(),\\n\\n kind: S::kind(),\\n\\n metadata,\\n\\n status,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S> From<UpdateK8Obj<S>> for InputK8Obj<S>\\n\\nwhere\\n\\n S: Spec,\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 54,\n \"score\": 30734.033072491125\n },\n {\n \"content\": \"pub struct DeleteOptions {\\n\\n pub kind: &'static str,\\n\\n pub api_version: &'static str,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub pretty: Option<bool>,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub dry_run: Option<String>,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub grace_period_seconds: Option<u64>,\\n\\n #[serde(skip_serializing_if = \\\"Option::is_none\\\")]\\n\\n pub propagation_policy: Option<PropogationPolicy>,\\n\\n}\\n\\n\\n\\nimpl Default for DeleteOptions {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n kind: \\\"DeleteOptions\\\",\\n\\n api_version: \\\"v1\\\",\\n\\n pretty: None,\\n\\n dry_run: None,\\n\",\n \"file_path\": \"src/k8-types/src/options.rs\",\n \"rank\": 55,\n \"score\": 30733.928766177363\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Env {\\n\\n pub name: String,\\n\\n pub value: Option<String>,\\n\\n pub value_from: Option<EnvVarSource>,\\n\\n}\\n\\n\\n\\nimpl Env {\\n\\n pub fn key_value<T: Into<String>>(name: T, value: T) -> Self {\\n\\n Env {\\n\\n name: name.into(),\\n\\n value: Some(value.into()),\\n\\n value_from: None,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 56,\n \"score\": 30733.913783039086\n },\n {\n \"content\": \"mod crd;\\n\\nmod metadata;\\n\\npub mod options;\\n\\npub mod store;\\n\\n#[cfg(feature = \\\"core\\\")]\\n\\npub mod core;\\n\\n#[cfg(feature = \\\"app\\\")]\\n\\npub mod app;\\n\\n#[cfg(feature = \\\"storage\\\")]\\n\\npub mod storage;\\n\\n#[cfg(feature = \\\"batch\\\")]\\n\\npub mod batch;\\n\\n\\n\\npub use self::crd::*;\\n\\npub use self::metadata::*;\\n\\npub use self::spec_def::*;\\n\\n\\n\\nmod spec_def {\\n\\n\\n\\n use std::fmt::Debug;\\n\\n\\n\\n use serde::de::DeserializeOwned;\\n\\n use serde::Deserialize;\\n\\n use serde::Serialize;\\n\\n\\n\\n use super::Crd;\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/lib.rs\",\n \"rank\": 57,\n \"score\": 30733.78785751604\n },\n {\n \"content\": \"\\n\\nimpl K8Meta for InputObjectMeta {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n\\n\\n fn namespace(&self) -> &str {\\n\\n &self.namespace\\n\\n }\\n\\n}\\n\\n\\n\\nimpl InputObjectMeta {\\n\\n // shorthand to create just with name and metadata\\n\\n pub fn named<S: Into<String>>(name: S, namespace: S) -> Self {\\n\\n InputObjectMeta {\\n\\n name: name.into(),\\n\\n namespace: namespace.into(),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 58,\n \"score\": 30733.455603332113\n },\n {\n \"content\": \"impl Default for OwnerReferences {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n api_version: \\\"v1\\\".to_owned(),\\n\\n block_owner_deletion: false,\\n\\n controller: None,\\n\\n kind: \\\"\\\".to_owned(),\\n\\n uid: \\\"\\\".to_owned(),\\n\\n name: \\\"\\\".to_owned(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub enum DeleteStatus<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n Deleted(DeletedStatus),\\n\\n ForegroundDelete(K8Obj<S>),\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 59,\n \"score\": 30733.384961331925\n },\n {\n \"content\": \" pub fn status(&self) -> &S::Status {\\n\\n &self.status\\n\\n }\\n\\n\\n\\n pub fn set_status(&mut self, status: S::Status) {\\n\\n self.status = status;\\n\\n }\\n\\n\\n\\n pub fn ctx(&self) -> &MetaItemContext {\\n\\n &self.ctx\\n\\n }\\n\\n\\n\\n pub fn set_ctx(&mut self, ctx: MetaItemContext) {\\n\\n self.ctx = ctx;\\n\\n }\\n\\n\\n\\n pub fn parts(self) -> (S::Key, S, MetaItemContext) {\\n\\n (self.key, self.spec, self.ctx)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 60,\n \"score\": 30732.702459431544\n },\n {\n \"content\": \" Self::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ::std::default::Default for MetaItemContext {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n item_ctx: None,\\n\\n parent_ctx: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// define default store spec assuming key is string\\n\\n#[macro_export]\\n\\nmacro_rules! default_store_spec {\\n\\n ($spec:ident,$status:ident,$name:expr) => {\\n\\n impl crate::store::StoreSpec for $spec {\\n\\n const LABEL: &'static str = $name;\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 61,\n \"score\": 30731.96679488353\n },\n {\n \"content\": \" Self {\\n\\n name: meta.name,\\n\\n namespace: meta.namespace,\\n\\n resource_version: meta.resource_version,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Debug, Clone, PartialEq)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct OwnerReferences {\\n\\n pub api_version: String,\\n\\n #[serde(default)]\\n\\n pub block_owner_deletion: bool,\\n\\n pub controller: Option<bool>,\\n\\n pub kind: String,\\n\\n pub name: String,\\n\\n pub uid: String,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 62,\n \"score\": 30731.614124288968\n },\n {\n \"content\": \"{\\n\\n fn from(update: UpdateK8Obj<S>) -> Self {\\n\\n Self {\\n\\n api_version: update.api_version,\\n\\n kind: update.kind,\\n\\n metadata: update.metadata.into(),\\n\\n spec: update.spec,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ItemMeta> for InputObjectMeta {\\n\\n fn from(update: ItemMeta) -> Self {\\n\\n Self {\\n\\n name: update.name,\\n\\n namespace: update.namespace,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 63,\n \"score\": 30731.578737781125\n },\n {\n \"content\": \" E: de::Error,\\n\\n {\\n\\n match value {\\n\\n \\\"Success\\\" => Ok(DeleteResponse::OkStatus(StatusEnum::SUCCESS)),\\n\\n \\\"Failure\\\" => Ok(DeleteResponse::OkStatus(StatusEnum::FAILURE)),\\n\\n _ => Err(de::Error::custom(format!(\\\"unrecognized status: {}\\\",value)))\\n\\n }\\n\\n\\n\\n\\n\\n }\\n\\n\\n\\n fn visit_map<M>(self, map: M) -> Result<Self::Value, M::Error>\\n\\n where\\n\\n M: MapAccess<'de>,\\n\\n {\\n\\n Deserialize::deserialize(de::value::MapAccessDeserializer::new(map))\\n\\n }\\n\\n }\\n\\n\\n\\n deserializer.deserialize_any(StatusVisitor(PhantomData))\\n\\n }\\n\\n\\n\\n}\\n\\n*/\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 64,\n \"score\": 30731.39421833043\n },\n {\n \"content\": \"use serde::Serialize;\\n\\n\\n\\n/// goes as query parameter\\n\\n#[derive(Serialize, Default, Debug)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct ListOptions {\\n\\n pub pretty: Option<bool>,\\n\\n #[serde(rename = \\\"continue\\\")]\\n\\n pub continu: Option<String>,\\n\\n pub field_selector: Option<String>,\\n\\n pub include_uninitialized: Option<bool>,\\n\\n pub label_selector: Option<String>,\\n\\n pub limit: Option<u32>,\\n\\n pub resource_version: Option<String>,\\n\\n pub timeout_seconds: Option<u32>,\\n\\n pub watch: Option<bool>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Debug)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\",\n \"file_path\": \"src/k8-types/src/options.rs\",\n \"rank\": 65,\n \"score\": 30731.355977690648\n },\n {\n \"content\": \" ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub type InputK8Obj<S> = K8SpecObj<S, InputObjectMeta>;\\n\\npub type UpdateK8Obj<S> = K8SpecObj<S, ItemMeta>;\\n\\n\\n\\n/// Used for updating k8obj\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct UpdateK8ObjStatus<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n pub api_version: String,\\n\\n pub kind: String,\\n\\n pub metadata: UpdateItemMeta,\\n\\n pub status: S::Status,\\n\\n pub data: PhantomData<S>,\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 66,\n \"score\": 30731.223825409037\n },\n {\n \"content\": \"#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct ObjectFieldSelector {\\n\\n pub field_path: String,\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n\\n\\n use super::Env;\\n\\n use super::ObjectMeta;\\n\\n\\n\\n #[test]\\n\\n fn test_metadata_label() {\\n\\n let metadata =\\n\\n ObjectMeta::default().set_labels(vec![(\\\"app\\\".to_owned(), \\\"test\\\".to_owned())]);\\n\\n\\n\\n let maps = metadata.labels;\\n\\n assert_eq!(maps.len(), 1);\\n\\n assert_eq!(maps.get(\\\"app\\\").unwrap(), \\\"test\\\");\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 67,\n \"score\": 30731.189865587978\n },\n {\n \"content\": \"\\n\\n type K8Spec = Self;\\n\\n type Status = $status;\\n\\n type Key = String;\\n\\n type Owner = Self;\\n\\n\\n\\n fn convert_from_k8(\\n\\n k8_obj: crate::K8Obj<Self::K8Spec>,\\n\\n ) -> Result<Option<crate::store::MetaItem<Self>>, std::io::Error> {\\n\\n let ctx =\\n\\n crate::store::MetaItemContext::default().with_ctx(k8_obj.metadata.clone());\\n\\n Ok(Some(crate::store::MetaItem::new(\\n\\n k8_obj.metadata.name,\\n\\n k8_obj.spec,\\n\\n k8_obj.status,\\n\\n ctx,\\n\\n )))\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 68,\n \"score\": 30731.01969596139\n },\n {\n \"content\": \" self.status = status;\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn as_status_update(&self, status: S::Status) -> UpdateK8ObjStatus<S> {\\n\\n UpdateK8ObjStatus {\\n\\n api_version: S::api_version(),\\n\\n kind: S::kind(),\\n\\n metadata: self.metadata.as_update(),\\n\\n status,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S> K8Obj<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n pub fn as_input(&self) -> InputK8Obj<S> {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 69,\n \"score\": 30730.605684508322\n },\n {\n \"content\": \" pub fn key_field_ref<T: Into<String>>(name: T, field_path: T) -> Self {\\n\\n Env {\\n\\n name: name.into(),\\n\\n value: None,\\n\\n value_from: Some(EnvVarSource {\\n\\n field_ref: Some(ObjectFieldSelector {\\n\\n field_path: field_path.into(),\\n\\n }),\\n\\n }),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct EnvVarSource {\\n\\n field_ref: Option<ObjectFieldSelector>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq)]\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 70,\n \"score\": 30729.985378842364\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::fmt::Debug;\\n\\nuse std::fmt::Display;\\n\\nuse std::io::Error as IoError;\\n\\n\\n\\nuse crate::K8Obj;\\n\\nuse crate::ObjectMeta;\\n\\nuse crate::Spec;\\n\\n\\n\\n// Spec that can store in meta store\\n\",\n \"file_path\": \"src/k8-types/src/store.rs\",\n \"rank\": 71,\n \"score\": 30729.587633750838\n },\n {\n \"content\": \"//!\\n\\n//! # CRD Definition\\n\\n//!\\n\\n//! Interface to the CRD header definition in K8 key value store\\n\\n//!\\n\\n#[derive(Debug)]\\n\\npub struct Crd {\\n\\n pub group: &'static str,\\n\\n pub version: &'static str,\\n\\n pub names: CrdNames,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct CrdNames {\\n\\n pub kind: &'static str,\\n\\n pub plural: &'static str,\\n\\n pub singular: &'static str,\\n\\n}\\n\\n\\n\\npub const GROUP: &str = \\\"fluvio.infinyon.com\\\";\\n\\npub const V1: &str = \\\"v1\\\";\\n\",\n \"file_path\": \"src/k8-types/src/crd.rs\",\n \"rank\": 72,\n \"score\": 30729.467827444078\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// status for actual deletion\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct DeletedStatus {\\n\\n pub api_version: String,\\n\\n pub code: Option<u16>,\\n\\n pub details: Option<StatusDetails>,\\n\\n pub kind: String,\\n\\n pub message: Option<String>,\\n\\n pub reason: Option<String>,\\n\\n pub status: StatusEnum,\\n\\n}\\n\\n\\n\\n/// Default status implementation\\n\\n#[allow(clippy::upper_case_acronyms)]\\n\\n#[derive(Deserialize, Debug, Eq, PartialEq, Clone)]\\n\\npub enum StatusEnum {\\n\\n #[serde(rename = \\\"Success\\\")]\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 73,\n \"score\": 30729.318546093928\n },\n {\n \"content\": \" SUCCESS,\\n\\n #[serde(rename = \\\"Failure\\\")]\\n\\n FAILURE,\\n\\n}\\n\\n\\n\\n/*\\n\\n#[serde(deserialize_with = \\\"StatusEnum::deserialize_with\\\")]\\n\\n pub status: StatusEnum,\\n\\n*/\\n\\n\\n\\n#[derive(Deserialize, Serialize, Debug, Clone)]\\n\\npub struct StatusDetails {\\n\\n pub name: String,\\n\\n pub group: Option<String>,\\n\\n pub kind: String,\\n\\n pub uid: String,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 74,\n \"score\": 30729.218716421405\n },\n {\n \"content\": \"#[serde(bound(serialize = \\\"S: Serialize\\\"))]\\n\\n#[serde(bound(deserialize = \\\"S: DeserializeOwned\\\"))]\\n\\npub struct K8Obj<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n #[serde(default = \\\"S::api_version\\\")]\\n\\n pub api_version: String,\\n\\n #[serde(default = \\\"S::kind\\\")]\\n\\n pub kind: String,\\n\\n #[serde(default)]\\n\\n pub metadata: ObjectMeta,\\n\\n #[serde(default)]\\n\\n pub spec: S,\\n\\n #[serde(flatten)]\\n\\n pub header: S::Header,\\n\\n #[serde(default)]\\n\\n pub status: S::Status,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 75,\n \"score\": 30729.20764585802\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_env() {\\n\\n let env = Env::key_value(\\\"lang\\\", \\\"english\\\");\\n\\n assert_eq!(env.name, \\\"lang\\\");\\n\\n assert_eq!(env.value, Some(\\\"english\\\".to_owned()));\\n\\n }\\n\\n}\\n\\n\\n\\n/*\\n\\n#[cfg(test)]\\n\\nmod test_delete {\\n\\n\\n\\n\\n\\n\\n\\n use serde_json;\\n\\n use serde::{ Serialize,Deserialize};\\n\\n\\n\\n use crate::{ Spec,Status, DefaultHeader, Crd, CrdNames};\\n\\n use super::DeleteResponse;\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 76,\n \"score\": 30728.986542946157\n },\n {\n \"content\": \" TemplateSpec {\\n\\n metadata: None,\\n\\n spec,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Debug, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\n#[serde(bound(serialize = \\\"K8Obj<S>: Serialize\\\"))]\\n\\n#[serde(bound(deserialize = \\\"K8Obj<S>: DeserializeOwned\\\"))]\\n\\npub struct K8List<S>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n pub api_version: String,\\n\\n pub kind: String,\\n\\n pub metadata: ListMetadata,\\n\\n pub items: Vec<K8Obj<S>>,\\n\\n}\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 77,\n \"score\": 30728.98115569321\n },\n {\n \"content\": \" grace_period_seconds: None,\\n\\n propagation_policy: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n#[derive(Serialize, Debug)]\\n\\npub enum PropogationPolicy {\\n\\n Orphan,\\n\\n Background,\\n\\n Foreground,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Default)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Precondition {\\n\\n pub uid: String,\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\",\n \"file_path\": \"src/k8-types/src/options.rs\",\n \"rank\": 78,\n \"score\": 30728.83862324118\n },\n {\n \"content\": \"\\n\\n pub fn as_item(&self) -> ItemMeta {\\n\\n ItemMeta {\\n\\n name: self.name.clone(),\\n\\n namespace: self.namespace.clone(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn as_update(&self) -> UpdateItemMeta {\\n\\n UpdateItemMeta {\\n\\n name: self.name.clone(),\\n\\n namespace: self.namespace.clone(),\\n\\n resource_version: self.resource_version.clone(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct InputObjectMeta {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 79,\n \"score\": 30728.587778460464\n },\n {\n \"content\": \" name: name.into(),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n /// create owner references point to this metadata\\n\\n /// if name or uid doesn't exists return none\\n\\n pub fn make_owner_reference<S: Spec>(&self) -> OwnerReferences {\\n\\n OwnerReferences {\\n\\n kind: S::kind(),\\n\\n name: self.name.clone(),\\n\\n uid: self.uid.clone(),\\n\\n // controller: Some(true),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn namespace(&self) -> &str {\\n\\n &self.namespace\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 80,\n \"score\": 30728.2229799188\n },\n {\n \"content\": \"\\n\\n /// create child references that points to this\\n\\n pub fn make_child_input_metadata<S: Spec>(&self, childname: String) -> InputObjectMeta {\\n\\n let owner_references: Vec<OwnerReferences> = vec![self.make_owner_reference::<S>()];\\n\\n\\n\\n InputObjectMeta {\\n\\n name: childname,\\n\\n namespace: self.namespace().to_owned(),\\n\\n owner_references,\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn as_input(&self) -> InputObjectMeta {\\n\\n InputObjectMeta {\\n\\n name: self.name.clone(),\\n\\n namespace: self.namespace.clone(),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 81,\n \"score\": 30727.9772027376\n },\n {\n \"content\": \" K8SpecObj {\\n\\n api_version: self.api_version.clone(),\\n\\n kind: self.kind.clone(),\\n\\n metadata: self.metadata.as_input(),\\n\\n spec: self.spec.clone(),\\n\\n ..Default::default()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// For creating, only need spec\\n\\n#[derive(Deserialize, Serialize, Debug, Default, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\n#[serde(bound(serialize = \\\"S: Serialize, M: Serialize\\\"))]\\n\\n#[serde(bound(deserialize = \\\"S: DeserializeOwned, M: DeserializeOwned\\\"))]\\n\\npub struct K8SpecObj<S, M>\\n\\nwhere\\n\\n S: Spec,\\n\\n{\\n\\n pub api_version: String,\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 82,\n \"score\": 30727.832318882545\n },\n {\n \"content\": \" &TEST_API\\n\\n }\\n\\n }\\n\\n\\n\\n #[derive(Deserialize, Serialize,Debug, Default,Clone)]\\n\\n struct TestStatus(bool);\\n\\n\\n\\n impl Status for TestStatus{}\\n\\n\\n\\n #[test]\\n\\n fn test_deserialize_test_options() {\\n\\n let data = r#\\\"\\n\\n {\\n\\n \\\"kind\\\": \\\"Status\\\",\\n\\n \\\"apiVersion\\\": \\\"v1\\\",\\n\\n \\\"metadata\\\": {\\n\\n\\n\\n },\\n\\n \\\"status\\\": \\\"Success\\\",\\n\\n \\\"details\\\": {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 83,\n \"score\": 30727.685785831705\n },\n {\n \"content\": \"\\n\\n use super::ListOptions;\\n\\n\\n\\n #[test]\\n\\n fn test_list_query() {\\n\\n let opt = ListOptions {\\n\\n pretty: Some(true),\\n\\n watch: Some(true),\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let qs = serde_qs::to_string(&opt).unwrap();\\n\\n assert_eq!(qs, \\\"pretty=true&watch=true\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/k8-types/src/options.rs\",\n \"rank\": 84,\n \"score\": 30727.671774351515\n },\n {\n \"content\": \"\\n\\n const TEST_API: Crd = Crd {\\n\\n group: \\\"test\\\",\\n\\n version: \\\"v1\\\",\\n\\n names: CrdNames {\\n\\n kind: \\\"test\\\",\\n\\n plural: \\\"test\\\",\\n\\n singular: \\\"test\\\",\\n\\n },\\n\\n };\\n\\n\\n\\n\\n\\n #[derive(Deserialize, Serialize, Default, Debug, Clone)]\\n\\n struct TestSpec {}\\n\\n\\n\\n impl Spec for TestSpec {\\n\\n type Status = TestStatus;\\n\\n type Header = DefaultHeader;\\n\\n\\n\\n fn metadata() -> &'static Crd {\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 85,\n \"score\": 30727.462664714938\n },\n {\n \"content\": \" \\\"name\\\": \\\"test\\\",\\n\\n \\\"group\\\": \\\"test.infinyon.com\\\",\\n\\n \\\"kind\\\": \\\"test\\\",\\n\\n \\\"uid\\\": \\\"62fc6733-c505-40c1-9dbb-dcd71e93528f\\\"\\n\\n }\\\"#;\\n\\n\\n\\n // Parse the string of data into serde_json::Value.\\n\\n let _status: DeleteResponse<TestSpec> = serde_json::from_str(data).expect(\\\"response\\\");\\n\\n }\\n\\n}\\n\\n*/\\n\\n\\n\\n/*\\n\\n\\n\\n\\n\\nimpl<'de, S> Deserialize<'de> for DeleteResponse<S>\\n\\n where\\n\\n S: Spec\\n\\n{\\n\\n\\n\",\n \"file_path\": \"src/k8-types/src/metadata.rs\",\n \"rank\": 86,\n \"score\": 30727.38778157146\n },\n {\n \"content\": \" debug!(\\\"using k8 token: {:#?}\\\", token);\\n\\n Ok(Self {\\n\\n client,\\n\\n host,\\n\\n token,\\n\\n })\\n\\n }\\n\\n\\n\\n fn hostname(&self) -> &str {\\n\\n &self.host\\n\\n }\\n\\n\\n\\n fn finish_request<B>(&self, request: &mut Request<B>) -> Result<(), ClientError>\\n\\n where\\n\\n B: Into<Body>,\\n\\n {\\n\\n if let Some(ref token) = self.token {\\n\\n let full_token = format!(\\\"Bearer {}\\\", token);\\n\\n request\\n\\n .headers_mut()\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 87,\n \"score\": 30391.678686210642\n },\n {\n \"content\": \"/// K8 Cluster accessible thru API\\n\\n#[derive(Debug)]\\n\\npub struct K8Client {\\n\\n client: HyperClient,\\n\\n host: String,\\n\\n token: Option<String>,\\n\\n}\\n\\n\\n\\nimpl K8Client {\\n\\n // load using default k8 config\\n\\n pub fn default() -> Result<Self, ClientError> {\\n\\n let config = K8Config::load()?;\\n\\n Self::new(config)\\n\\n }\\n\\n\\n\\n pub fn new(config: K8Config) -> Result<Self, ClientError> {\\n\\n let helper = HyperConfigBuilder::new(config)?;\\n\\n let host = helper.host();\\n\\n let token = helper.token();\\n\\n let client = helper.build()?;\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 88,\n \"score\": 30391.402448571487\n },\n {\n \"content\": \"use std::fmt::Debug;\\n\\nuse std::fmt::Display;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse async_trait::async_trait;\\n\\nuse bytes::Buf;\\n\\nuse futures_util::future::FutureExt;\\n\\nuse futures_util::stream::empty;\\n\\nuse futures_util::stream::BoxStream;\\n\\nuse futures_util::stream::Stream;\\n\\nuse futures_util::stream::StreamExt;\\n\\nuse futures_util::stream::TryStreamExt;\\n\\nuse hyper::body::aggregate;\\n\\nuse hyper::body::Bytes;\\n\\nuse hyper::header::HeaderValue;\\n\\nuse hyper::header::ACCEPT;\\n\\nuse hyper::header::AUTHORIZATION;\\n\\nuse hyper::header::CONTENT_TYPE;\\n\\nuse hyper::Body;\\n\\nuse hyper::Request;\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 89,\n \"score\": 30389.11823791845\n },\n {\n \"content\": \" .insert(AUTHORIZATION, HeaderValue::from_str(&full_token)?);\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// handle request. this is async function\\n\\n async fn handle_request<T>(&self, mut request: Request<Body>) -> Result<T, ClientError>\\n\\n where\\n\\n T: DeserializeOwned,\\n\\n {\\n\\n use std::io::Read;\\n\\n\\n\\n self.finish_request(&mut request)?;\\n\\n\\n\\n let resp = self.client.request(request).await?;\\n\\n\\n\\n let status = resp.status();\\n\\n debug!(\\\"response status: {:#?}\\\", status);\\n\\n\\n\\n if status.is_success() {\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 90,\n \"score\": 30387.770633088207\n },\n {\n \"content\": \"\\n\\n /// return stream of chunks, chunk is a bytes that are stream thru http channel\\n\\n #[allow(clippy::useless_conversion)]\\n\\n fn stream_of_chunks<S>(&self, uri: Uri) -> impl Stream<Item = Bytes> + '_\\n\\n where\\n\\n S: Spec,\\n\\n K8Watch<S>: DeserializeOwned,\\n\\n {\\n\\n debug!(\\\"streaming: {}\\\", uri);\\n\\n\\n\\n let ft = async move {\\n\\n let mut request = match http::Request::get(uri).body(Body::empty()) {\\n\\n Ok(req) => req,\\n\\n Err(err) => {\\n\\n error!(\\\"error uri err: {}\\\", err);\\n\\n return empty().right_stream();\\n\\n }\\n\\n };\\n\\n\\n\\n if let Err(err) = self.finish_request(&mut request) {\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 91,\n \"score\": 30387.73884881246\n },\n {\n \"content\": \" &self,\\n\\n metadata: &M,\\n\\n option: Option<DeleteOptions>,\\n\\n ) -> Result<DeleteStatus<S>, ClientError>\\n\\n where\\n\\n S: Spec,\\n\\n M: K8Meta + Send + Sync,\\n\\n {\\n\\n use crate::k8_types::DeletedStatus;\\n\\n\\n\\n let uri = item_uri::<S>(self.hostname(), metadata.name(), metadata.namespace(), None);\\n\\n debug!(\\\"{}: delete item on url: {}\\\", S::label(), uri);\\n\\n\\n\\n let body = if let Some(option_value) = option {\\n\\n let bytes = serde_json::to_vec(&option_value)?;\\n\\n trace!(\\\"delete raw : {}\\\", String::from_utf8_lossy(&bytes));\\n\\n\\n\\n bytes.into()\\n\\n } else {\\n\\n Body::empty()\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 92,\n \"score\": 30386.81527696335\n },\n {\n \"content\": \"use hyper::Uri;\\n\\nuse serde::de::DeserializeOwned;\\n\\nuse serde_json::Value;\\n\\nuse tracing::debug;\\n\\nuse tracing::error;\\n\\nuse tracing::trace;\\n\\n\\n\\nuse k8_config::K8Config;\\n\\nuse crate::meta_client::{ListArg, MetadataClient, NameSpace, PatchMergeType, TokenStreamResult};\\n\\nuse crate::k8_types::{\\n\\n InputK8Obj, K8List, K8Meta, K8Obj, DeleteStatus, K8Watch, Spec, UpdateK8ObjStatus,\\n\\n};\\n\\nuse crate::k8_types::options::{ListOptions, DeleteOptions};\\n\\n\\n\\nuse crate::uri::{item_uri, items_uri};\\n\\nuse crate::ClientError;\\n\\n\\n\\nuse super::wstream::WatchStream;\\n\\nuse super::{HyperClient, HyperConfigBuilder, ListStream};\\n\\n\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 93,\n \"score\": 30386.664804760545\n },\n {\n \"content\": \" );\\n\\n err\\n\\n });\\n\\n Ok(vec![match result {\\n\\n Ok(obj) => {\\n\\n trace!(\\\"de serialized: {:#?}\\\", obj);\\n\\n Ok(obj)\\n\\n }\\n\\n Err(err) => Err(err.into()),\\n\\n }])\\n\\n })\\n\\n }\\n\\n\\n\\n pub async fn retrieve_items_inner<S, N>(\\n\\n &self,\\n\\n namespace: N,\\n\\n options: Option<ListOptions>,\\n\\n ) -> Result<K8List<S>, ClientError>\\n\\n where\\n\\n S: Spec,\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 94,\n \"score\": 30385.962187560515\n },\n {\n \"content\": \" let bytes = serde_json::to_vec(&value)?;\\n\\n trace!(\\n\\n \\\"update raw: {}\\\",\\n\\n String::from_utf8_lossy(&bytes).to_string()\\n\\n );\\n\\n\\n\\n let request = Request::put(uri)\\n\\n .header(CONTENT_TYPE, \\\"application/json\\\")\\n\\n .body(bytes.into())?;\\n\\n\\n\\n self.handle_request(request).await\\n\\n }\\n\\n\\n\\n /// patch existing with spec\\n\\n async fn patch<S, M>(\\n\\n &self,\\n\\n metadata: &M,\\n\\n patch: &Value,\\n\\n merge_type: PatchMergeType,\\n\\n ) -> Result<K8Obj<S>, ClientError>\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 95,\n \"score\": 30385.91696484715\n },\n {\n \"content\": \" N: Into<NameSpace> + Send + Sync,\\n\\n {\\n\\n let uri = items_uri::<S>(self.hostname(), namespace.into(), options);\\n\\n debug!(\\\"{}: retrieving items: {}\\\", S::label(), uri);\\n\\n let items = self\\n\\n .handle_request(Request::get(uri).body(Body::empty())?)\\n\\n .await?;\\n\\n trace!(\\\"items retrieved: {:#?}\\\", items);\\n\\n Ok(items)\\n\\n }\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\\nimpl MetadataClient for K8Client {\\n\\n type MetadataClientError = ClientError;\\n\\n\\n\\n /// retrieval a single item\\n\\n async fn retrieve_item<S, M>(&self, metadata: &M) -> Result<K8Obj<S>, ClientError>\\n\\n where\\n\\n S: Spec,\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 96,\n \"score\": 30384.51603506919\n },\n {\n \"content\": \" .header(CONTENT_TYPE, \\\"application/json\\\")\\n\\n .body(bytes.into())?;\\n\\n\\n\\n self.handle_request(request).await\\n\\n }\\n\\n\\n\\n /// update status\\n\\n async fn update_status<S>(&self, value: &UpdateK8ObjStatus<S>) -> Result<K8Obj<S>, ClientError>\\n\\n where\\n\\n S: Spec,\\n\\n {\\n\\n let uri = item_uri::<S>(\\n\\n self.hostname(),\\n\\n &value.metadata.name,\\n\\n &value.metadata.namespace,\\n\\n Some(\\\"/status\\\"),\\n\\n );\\n\\n debug!(\\\"updating '{}' status - uri: {}\\\", value.metadata.name, uri);\\n\\n trace!(\\\"update status: {:#?}\\\", &value);\\n\\n\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 97,\n \"score\": 30384.120343108218\n },\n {\n \"content\": \" where\\n\\n S: Spec,\\n\\n M: K8Meta + Display + Send + Sync,\\n\\n {\\n\\n debug!(\\\"patching item at '{}'\\\", metadata);\\n\\n trace!(\\\"patch json value: {:#?}\\\", patch);\\n\\n let uri = item_uri::<S>(self.hostname(), metadata.name(), metadata.namespace(), None);\\n\\n\\n\\n let bytes = serde_json::to_vec(&patch)?;\\n\\n\\n\\n trace!(\\n\\n \\\"patch uri: {}, raw: {}\\\",\\n\\n uri,\\n\\n String::from_utf8_lossy(&bytes).to_string()\\n\\n );\\n\\n\\n\\n let request = Request::patch(uri)\\n\\n .header(ACCEPT, \\\"application/json\\\")\\n\\n .header(CONTENT_TYPE, merge_type.content_type())\\n\\n .body(bytes.into())?;\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 98,\n \"score\": 30383.21367020921\n },\n {\n \"content\": \" /// return get stream of uri\\n\\n fn stream<S>(&self, uri: Uri) -> impl Stream<Item = TokenStreamResult<S, ClientError>> + '_\\n\\n where\\n\\n K8Watch<S>: DeserializeOwned,\\n\\n S: Spec + 'static,\\n\\n S::Status: 'static,\\n\\n S::Header: 'static,\\n\\n {\\n\\n self.stream_of_chunks(uri).map(move |chunk| {\\n\\n trace!(\\n\\n \\\"decoding raw stream : {}\\\",\\n\\n String::from_utf8_lossy(&chunk).to_string()\\n\\n );\\n\\n\\n\\n let result: Result<K8Watch<S>, serde_json::Error> = serde_json::from_slice(&chunk)\\n\\n .map_err(|err| {\\n\\n error!(\\\"parsing error, chunk_len: {}, error: {}\\\", chunk.len(), err);\\n\\n error!(\\n\\n \\\"error raw stream {}\\\",\\n\\n String::from_utf8_lossy(&chunk).to_string()\\n\",\n \"file_path\": \"src/k8-client/src/client/client_impl.rs\",\n \"rank\": 99,\n \"score\": 30382.400673701522\n }\n]","isConversational":false}}},{"rowIdx":1183,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"samples/command_executer/src/lib.rs"},"repo_name":{"kind":"string","value":"costisin/aws-nitro-enclaves-cli"},"commit":{"kind":"string","value":"de77067677ef2287661063b4529e937b52115a60"},"file_code":{"kind":"string","value":"pub mod command_parser;\npub mod protocol_helpers;\npub mod utils;\n\nuse command_parser::{CommandOutput, FileArgs, ListenArgs, RunArgs};\nuse protocol_helpers::{recv_loop, recv_u64, send_loop, send_u64};\n\nuse nix::sys::socket::listen as listen_vsock;\nuse nix::sys::socket::{accept, bind, connect, shutdown, socket};\nuse nix::sys::socket::{AddressFamily, Shutdown, SockAddr, SockFlag, SockType};\nuse nix::unistd::close;\nuse num_derive::FromPrimitive;\nuse num_traits::FromPrimitive;\nuse std::cmp::min;\nuse std::convert::TryInto;\nuse std::fs::File;\nuse std::io::{Read, Write};\nuse std::os::unix::io::{AsRawFd, RawFd};\nuse std::process::Command;\n\npub const VMADDR_CID_ANY: u32 = 0xFFFFFFFF;\npub const BUF_MAX_LEN: usize = 8192;\npub const BACKLOG: usize = 128;\nconst MAX_CONNECTION_ATTEMPTS: usize = 5;\n\n#[derive(Debug, Clone, FromPrimitive)]\nenum CmdId {\n RunCmd = 0,\n RecvFile,\n SendFile,\n RunCmdNoWait,\n}\n\nstruct VsockSocket {\n socket_fd: RawFd,\n}\n\nimpl VsockSocket {\n fn new(socket_fd: RawFd) -> Self {\n VsockSocket { socket_fd }\n }\n}\n\nimpl Drop for VsockSocket {\n fn drop(&mut self) {\n shutdown(self.socket_fd, Shutdown::Both)\n .unwrap_or_else(|e| eprintln!(\"Failed to shut socket down: {:?}\", e));\n close(self.socket_fd).unwrap_or_else(|e| eprintln!(\"Failed to close socket: {:?}\", e));\n }\n}\n\nimpl AsRawFd for VsockSocket {\n fn as_raw_fd(&self) -> RawFd {\n self.socket_fd\n }\n}\n\nfn vsock_connect(cid: u32, port: u32) -> Result<VsockSocket, String> {\n let sockaddr = SockAddr::new_vsock(cid, port);\n let mut err_msg = String::new();\n\n for i in 0..MAX_CONNECTION_ATTEMPTS {\n let vsocket = VsockSocket::new(\n socket(\n AddressFamily::Vsock,\n SockType::Stream,\n SockFlag::empty(),\n None,\n )\n .map_err(|err| format!(\"Failed to create the socket: {:?}\", err))?,\n );\n match connect(vsocket.as_raw_fd(), &sockaddr) {\n Ok(_) => return Ok(vsocket),\n Err(e) => err_msg = format!(\"Failed to connect: {}\", e),\n }\n\n std::thread::sleep(std::time::Duration::from_secs(1 << i));\n }\n\n Err(err_msg)\n}\n\nfn run_server(fd: RawFd, no_wait: bool) -> Result<(), String> {\n \n let len = recv_u64(fd)?;\n let mut buf = [0u8; BUF_MAX_LEN];\n recv_loop(fd, &mut buf, len)?;\n\n let len_usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n let command = std::str::from_utf8(&buf[0..len_usize]).map_err(|err| format!(\"{:?}\", err))?;\n\n \n let command_output = if no_wait {\n #[rustfmt::skip]\n let output = Command::new(\"sh\")\n .arg(\"-c\")\n .arg(command)\n .spawn();\n if output.is_err() {\n CommandOutput::new(\n String::new(),\n format!(\"Could not execute the command {}\", command),\n 1,\n )\n } else {\n CommandOutput::new(String::new(), String::new(), 0)\n }\n } else {\n let output = Command::new(\"sh\")\n .arg(\"-c\")\n .arg(command)\n .output()\n .map_err(|err| format!(\"Could not execute the command {}: {:?}\", command, err))?;\n CommandOutput::new_from(output)?\n };\n\n \n let json_output = serde_json::to_string(&command_output)\n .map_err(|err| format!(\"Could not serialize the output: {:?}\", err))?;\n let buf = json_output.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(fd, len)?;\n send_loop(fd, &buf, len)?;\n Ok(())\n}\n\nfn recv_file_server(fd: RawFd) -> Result<(), String> {\n \n let len = recv_u64(fd)?;\n let mut buf = [0u8; BUF_MAX_LEN];\n recv_loop(fd, &mut buf, len)?;\n let len_usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n let path = std::str::from_utf8(&buf[0..len_usize]).map_err(|err| format!(\"{:?}\", err))?;\n\n let mut file = File::open(path).map_err(|err| format!(\"Could not open file {:?}\", err))?;\n\n let filesize = file\n .metadata()\n .map_err(|err| format!(\"Could not get file metadata {:?}\", err))?\n .len();\n\n send_u64(fd, filesize)?;\n println!(\"Sending file {} - size {}\", path, filesize);\n\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n file.read_exact(&mut buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not read {:?}\", err))?;\n send_loop(fd, &buf, tmpsize)?;\n progress += tmpsize\n }\n\n Ok(())\n}\n\nfn send_file_server(fd: RawFd) -> Result<(), String> {\n \n let len = recv_u64(fd)?;\n let mut buf = [0u8; BUF_MAX_LEN];\n recv_loop(fd, &mut buf, len)?;\n let len_usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n let path = std::str::from_utf8(&buf[0..len_usize]).map_err(|err| format!(\"{:?}\", err))?;\n\n let mut file = File::create(path).map_err(|err| format!(\"Could not open file {:?}\", err))?;\n\n \n let filesize = recv_u64(fd)?;\n println!(\"Receiving file {} - size {}\", path, filesize);\n\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n recv_loop(fd, &mut buf, tmpsize)?;\n file.write_all(&buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not write {:?}\", err))?;\n progress += tmpsize\n }\n\n Ok(())\n}\n\npub fn listen(args: ListenArgs) -> Result<(), String> {\n let socket_fd = socket(\n AddressFamily::Vsock,\n SockType::Stream,\n SockFlag::empty(),\n None,\n )\n .map_err(|err| format!(\"Create socket failed: {:?}\", err))?;\n\n let sockaddr = SockAddr::new_vsock(VMADDR_CID_ANY, args.port);\n\n bind(socket_fd, &sockaddr).map_err(|err| format!(\"Bind failed: {:?}\", err))?;\n\n listen_vsock(socket_fd, BACKLOG).map_err(|err| format!(\"Listen failed: {:?}\", err))?;\n\n loop {\n let fd = accept(socket_fd).map_err(|err| format!(\"Accept failed: {:?}\", err))?;\n\n \n let cmdid = match recv_u64(fd) {\n Ok(id_u64) => match CmdId::from_u64(id_u64) {\n Some(c) => c,\n _ => {\n eprintln!(\"Error no such command\");\n continue;\n }\n },\n Err(e) => {\n eprintln!(\"Error {}\", e);\n continue;\n }\n };\n\n match cmdid {\n CmdId::RunCmd => {\n if let Err(e) = run_server(fd, false) {\n eprintln!(\"Error {}\", e);\n }\n }\n CmdId::RecvFile => {\n if let Err(e) = recv_file_server(fd) {\n eprintln!(\"Error {}\", e);\n }\n }\n CmdId::SendFile => {\n if let Err(e) = send_file_server(fd) {\n eprintln!(\"Error {}\", e);\n }\n }\n CmdId::RunCmdNoWait => {\n if let Err(e) = run_server(fd, true) {\n eprintln!(\"Error {}\", e);\n }\n }\n }\n }\n}\n\npub fn run(args: RunArgs) -> Result<i32, String> {\n let vsocket = vsock_connect(args.cid, args.port)?;\n let socket_fd = vsocket.as_raw_fd();\n\n \n if args.no_wait {\n send_u64(socket_fd, CmdId::RunCmdNoWait as u64)?;\n } else {\n send_u64(socket_fd, CmdId::RunCmd as u64)?;\n }\n\n \n let buf = args.command.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(socket_fd, len)?;\n send_loop(socket_fd, &buf, len)?;\n\n \n let mut buf = [0u8; BUF_MAX_LEN];\n let len = recv_u64(socket_fd)?;\n let mut json_output = String::new();\n let mut to_recv = len;\n while to_recv > 0 {\n let recv_len = min(BUF_MAX_LEN as u64, to_recv);\n recv_loop(socket_fd, &mut buf, recv_len)?;\n to_recv -= recv_len;\n let to_recv_usize: usize = recv_len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n json_output.push_str(\n std::str::from_utf8(&buf[0..to_recv_usize]).map_err(|err| format!(\"{:?}\", err))?,\n );\n }\n\n let output: CommandOutput = serde_json::from_str(json_output.as_str())\n .map_err(|err| format!(\"Could not deserialize the output: {:?}\", err))?;\n print!(\"{}\", output.stdout);\n eprint!(\"{}\", output.stderr);\n\n let rc = match output.rc {\n Some(code) => code,\n _ => 0,\n };\n\n Ok(rc)\n}\n\npub fn recv_file(args: FileArgs) -> Result<(), String> {\n let mut file = File::create(&args.localfile)\n .map_err(|err| format!(\"Could not open localfile {:?}\", err))?;\n let vsocket = vsock_connect(args.cid, args.port)?;\n let socket_fd = vsocket.as_raw_fd();\n\n \n send_u64(socket_fd, CmdId::RecvFile as u64)?;\n\n \n let buf = args.remotefile.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(socket_fd, len)?;\n send_loop(socket_fd, &buf, len)?;\n\n \n let filesize = recv_u64(socket_fd)?;\n println!(\n \"Receiving file {}(saving to {}) - size {}\",\n &args.remotefile,\n &args.localfile[..],\n filesize\n );\n\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n let mut buf = [0u8; BUF_MAX_LEN];\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n recv_loop(socket_fd, &mut buf, tmpsize)?;\n file.write_all(&buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not write {:?}\", err))?;\n progress += tmpsize\n }\n Ok(())\n}\n\npub fn send_file(args: FileArgs) -> Result<(), String> {\n let mut file =\n File::open(&args.localfile).map_err(|err| format!(\"Could not open localfile {:?}\", err))?;\n let vsocket = vsock_connect(args.cid, args.port)?;\n let socket_fd = vsocket.as_raw_fd();\n\n \n send_u64(socket_fd, CmdId::SendFile as u64)?;\n\n \n let buf = args.remotefile.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(socket_fd, len)?;\n send_loop(socket_fd, &buf, len)?;\n\n let filesize = file\n .metadata()\n .map_err(|err| format!(\"Could not get file metadate {:?}\", err))?\n .len();\n\n send_u64(socket_fd, filesize)?;\n println!(\n \"Sending file {}(sending to {}) - size {}\",\n &args.localfile,\n &args.remotefile[..],\n filesize\n );\n\n let mut buf = [0u8; BUF_MAX_LEN];\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n file.read_exact(&mut buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not read {:?}\", err))?;\n send_loop(socket_fd, &buf, tmpsize)?;\n progress += tmpsize\n }\n\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"pub mod command_parser;\npub mod protocol_helpers;\npub mod utils;\n\nuse command_parser::{CommandOutput, FileArgs, ListenArgs, RunArgs};\nuse protocol_helpers::{recv_loop, recv_u64, send_loop, send_u64};\n\nuse nix::sys::socket::listen as listen_vsock;\nuse nix::sys::socket::{accept, bind, connect, shutdown, socket};\nuse nix::sys::socket::{AddressFamily, Shutdown, SockAddr, SockFlag, SockType};\nuse nix::unistd::close;\nuse num_derive::FromPrimitive;\nuse num_traits::FromPrimitive;\nuse std::cmp::min;\nuse std::convert::TryInto;\nuse std::fs::File;\nuse std::io::{Read, Write};\nuse std::os::unix::io::{AsRawFd, RawFd};\nuse std::process::Command;\n\npub const VMADDR_CID_ANY: u32 = 0xFFFFFFFF;\npub const BUF_MAX_LEN: usize = 8192;\npub const BACKLOG: usize = 128;\nconst MAX_CONNECTION_ATTEMPTS: usize = 5;\n\n#[derive(Debug, Clone, FromPrimitive)]\nenum CmdId {\n RunCmd = 0,\n RecvFile,\n SendFile,\n RunCmdNoWait,\n}\n\nstruct VsockSocket {\n socket_fd: RawFd,\n}\n\nimpl VsockSocket {\n fn new(socket_fd: RawFd) -> Self {\n VsockSocket { socket_fd }\n }\n}\n\nimpl Drop for VsockSocket {\n fn drop(&mut self) {\n shutdown(self.socket_fd, Shutdown::Both)\n .unwrap_or_else(|e| eprintln!(\"Failed to shut socket down: {:?}\", e));\n close(self.socket_fd).unwrap_or_else(|e| eprintln!(\"Failed to close socket: {:?}\", e));\n }\n}\n\nimpl AsRawFd for VsockSocket {\n fn as_raw_fd(&self) -> RawFd {\n self.socket_fd\n }\n}\n\nfn vsock_connect(cid: u32, port: u32) -> Result<VsockSocket, String> {\n let sockaddr = SockAddr::new_vsock(cid, port);\n let mut err_msg = String::new();\n\n for i in 0..MAX_CONNECTION_ATTEMPTS {\n let vsocket = VsockSocket::new(\n socket(\n AddressFamily::Vsock,\n SockType::Stream,\n SockFlag::empty(),\n None,\n )\n .map_err(|err| format!(\"Failed to create the socket: {:?}\", err))?,\n );\n match connect(vsocket.as_raw_fd(), &sockaddr) {\n Ok(_) => return Ok(vsocket),\n Err(e) => err_msg = format!(\"Failed to connect: {}\", e),\n }\n\n std::thread::sleep(std::time::Duration::from_secs(1 << i));\n }\n\n Err(err_msg)\n}\n\nfn run_server(fd: RawFd, no_wait: bool) -> Result<(), String> {\n \n let len = recv_u64(fd)?;\n let mut buf = [0u8; BUF_MAX_LEN];\n recv_loop(fd, &mut buf, len)?;\n\n let len_usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n let command = std::str::from_utf8(&buf[0..len_usize]).map_err(|err| format!(\"{:?}\", err))?;\n\n \n let command_output = if no_wait {\n #[rustfmt::skip]\n let output = Command::new(\"sh\")\n .arg(\"-c\")\n .arg(command)\n .spawn();\n if output.is_err() {\n CommandOutput::new(\n String::new(),\n format!(\"Could not execute the command {}\", command),\n 1,\n )\n } else {\n CommandOutput::new(String::new(), String::new(), 0)\n }\n } else {\n let output = Command::new(\"sh\")\n .arg(\"-c\")\n .arg(command)\n .output()\n .map_err(|err| format!(\"Could not execute the command {}: {:?}\", command, err))?;\n CommandOutput::new_from(output)?\n };\n\n \n let json_output = serde_json::to_string(&command_output)\n .map_err(|err| format!(\"Could not serialize the output: {:?}\", err))?;\n let buf = json_output.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(fd, len)?;\n send_loop(fd, &buf, len)?;\n Ok(())\n}\n\nfn recv_file_server(fd: RawFd) -> Result<(), String> {\n \n let len = recv_u64(fd)?;\n let mut buf = [0u8; BUF_MAX_LEN];\n recv_loop(fd, &mut buf, len)?;\n let len_usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n let path = std::str::from_utf8(&buf[0..len_usize]).map_err(|err| format!(\"{:?}\", err))?;\n\n let mut file = File::open(path).map_err(|err| format!(\"Could not open file {:?}\", err))?;\n\n let filesize = file\n .metadata()\n .map_err(|err| format!(\"Could not get file metadata {:?}\", err))?\n .len();\n\n send_u64(fd, filesize)?;\n println!(\"Sending file {} - size {}\", path, filesize);\n\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n file.read_exact(&mut buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not read {:?}\", err))?;\n send_loop(fd, &buf, tmpsize)?;\n progress += tmpsize\n }\n\n Ok(())\n}\n\nfn send_file_server(fd: RawFd) -> Result<(), String> {\n \n let len = recv_u64(fd)?;\n let mut buf = [0u8; BUF_MAX_LEN];\n recv_loop(fd, &mut buf, len)?;\n let len_usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n let path = std::str::from_utf8(&buf[0..len_usize]).map_err(|err| format!(\"{:?}\", err))?;\n\n let mut file = File::create(path).map_err(|err| format!(\"Could not open file {:?}\", err))?;\n\n \n let filesize = recv_u64(fd)?;\n println!(\"Receiving file {} - size {}\", path, filesize);\n\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n recv_loop(fd, &mut buf, tmpsize)?;\n file.write_all(&buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not write {:?}\", err))?;\n progress += tmpsize\n }\n\n Ok(())\n}\n\npub fn listen(args: ListenArgs) -> Result<(), String> {\n let socket_fd = socket(\n AddressFamily::Vsock,\n SockType::Stream,\n SockFlag::empty(),\n None,\n )\n .map_err(|err| format!(\"Create socket failed: {:?}\", err))?;\n\n let sockaddr = SockAddr::new_vsock(VMADDR_CID_ANY, args.port);\n\n bind(socket_fd, &sockaddr).map_err(|err| format!(\"Bind failed: {:?}\", err))?;\n\n listen_vsock(socket_fd, BACKLOG).map_err(|err| format!(\"Listen failed: {:?}\", err))?;\n\n loop {\n let fd = accept(socket_fd).map_err(|err| format!(\"Accept failed: {:?}\", err))?;\n\n \n let cmdid = match recv_u64(fd) {\n Ok(id_u64) => match CmdId::from_u64(id_u64) {\n Some(c) => c,\n _ => {\n eprintln!(\"Error no such command\");\n continue;\n }\n },\n Err(e) => {\n eprintln!(\"Error {}\", e);\n continue;\n }\n };\n\n match cmdid {\n CmdId::RunCmd => {\n if let Err(e) = run_server(fd, false) {\n eprintln!(\"Error {}\", e);\n }\n }\n CmdId::RecvFile => {\n if let Err(e) = recv_file_server(fd) {\n eprintln!(\"Error {}\", e);\n }\n }\n CmdId::SendFile => {\n if let Err(e) = send_file_server(fd) {\n eprintln!(\"Error {}\", e);\n }\n }\n CmdId::RunCmdNoWait => {\n if let Err(e) = run_server(fd, true) {\n eprintln!(\"Error {}\", e);\n }\n }\n }\n }\n}\n\npub fn run(args: RunArgs) -> Result<i32, String> {\n let vsocket = vsock_connect(args.cid, args.port)?;\n let socket_fd = vsocket.as_raw_fd();\n\n \n if args.no_wait {\n send_u64(socket_fd, CmdId::RunCmdNoWait as u64)?;\n } else {\n send_u64(socket_fd, CmdId::RunCmd as u64)?;\n }\n\n \n let buf = args.command.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(socket_fd, len)?;\n send_loop(socket_fd, &buf, len)?;\n\n \n let mut buf = [0u8; BUF_MAX_LEN];\n let len = recv_u64(socket_fd)?;\n let mut json_output = String::new();\n let mut to_recv = len;\n while to_recv > 0 {\n let recv_len = min(BUF_MAX_LEN as u64, to_recv);\n recv_loop(socket_fd, &mut buf, recv_len)?;\n to_recv -= recv_len;\n let to_recv_usize: usize = recv_len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n json_output.push_str(\n std::str::from_utf8(&buf[0..to_recv_usize]).map_err(|err| format!(\"{:?}\", err))?,\n );\n }\n\n let output: CommandOutput = serde_json::from_str(json_output.as_str())\n .map_err(|err| format!(\"Could not deserialize the output: {:?}\", err))?;\n print!(\"{}\", output.stdout);\n eprint!(\"{}\", output.stderr);\n\n let rc = match output.rc {\n Some(code) => code,\n _ => 0,\n };\n\n Ok(rc)\n}\n\npub fn recv_file(args: FileArgs) -> Result<(), String> {\n let mut file = File::create(&args.localfile)\n .map_err(|err| format!(\"Could not open localfile {:?}\", err))?;\n let vsocket = vsock_connect(args.cid, args.port)?;\n let socket_fd = vsocket.as_raw_fd();\n\n \n send_u64(socket_fd, CmdId::RecvFile as u64)?;\n\n \n let buf = args.remotefile.as_bytes();\n let len: u64 = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n send_u64(socket_fd, len)?;\n send_loop(socket_fd, &buf, len)?;\n\n \n let filesize = recv_u64(socket_fd)?;\n println!(\n \"Receiving file {}(saving to {}) - size {}\",\n &args.remotefile,\n &args.localfile[..],\n filesize\n );\n\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n let mut buf = [0u8; BUF_MAX_LEN];\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n recv_loop(socket_fd, &mut buf, tmpsize)?;\n file.write_all(&buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could n"},"suffix":{"kind":"string","value":"r(|err| format!(\"{:?}\", err))?;\n send_u64(socket_fd, len)?;\n send_loop(socket_fd, &buf, len)?;\n\n let filesize = file\n .metadata()\n .map_err(|err| format!(\"Could not get file metadate {:?}\", err))?\n .len();\n\n send_u64(socket_fd, filesize)?;\n println!(\n \"Sending file {}(sending to {}) - size {}\",\n &args.localfile,\n &args.remotefile[..],\n filesize\n );\n\n let mut buf = [0u8; BUF_MAX_LEN];\n let mut progress: u64 = 0;\n let mut tmpsize: u64;\n\n while progress < filesize {\n tmpsize = buf.len().try_into().map_err(|err| format!(\"{:?}\", err))?;\n tmpsize = min(tmpsize, filesize - progress);\n\n file.read_exact(&mut buf[..tmpsize.try_into().map_err(|err| format!(\"{:?}\", err))?])\n .map_err(|err| format!(\"Could not read {:?}\", err))?;\n send_loop(socket_fd, &buf, tmpsize)?;\n progress += tmpsize\n }\n\n Ok(())\n}\n"},"middle":{"kind":"string","value":"ot write {:?}\", err))?;\n progress += tmpsize\n }\n Ok(())\n}\n\npub fn send_file(args: FileArgs) -> Result<(), String> {\n let mut file =\n File::open(&args.localfile).map_err(|err| format!(\"Could not open localfile {:?}\", err))?;\n let vsocket = vsock_connect(args.cid, args.port)?;\n let socket_fd = vsocket.as_raw_fd();\n\n \n send_u64(socket_fd, CmdId::SendFile as u64)?;\n\n \n let buf = args.remotefile.as_bytes();\n let len: u64 = buf.len().try_into().map_er"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn recv_loop(fd: RawFd, buf: &mut [u8], len: u64) -> Result<(), String> {\n\n let len: usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n\n let mut recv_bytes = 0;\n\n\n\n while recv_bytes < len {\n\n let size = match recv(fd, &mut buf[recv_bytes..len], MsgFlags::empty()) {\n\n Ok(size) => size,\n\n Err(nix::Error::Sys(EINTR)) => 0,\n\n Err(err) => return Err(format!(\"{:?}\", err)),\n\n };\n\n recv_bytes += size;\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"samples/command_executer/src/protocol_helpers.rs","rank":0,"score":456102.1243507443},{"content":"pub fn send_loop(fd: RawFd, buf: &[u8], len: u64) -> Result<(), String> {\n\n let len: usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n\n let mut send_bytes = 0;\n\n\n\n while send_bytes < len {\n\n let size = match send(fd, &buf[send_bytes..len], MsgFlags::empty()) {\n\n Ok(size) => size,\n\n Err(nix::Error::Sys(EINTR)) => 0,\n\n Err(err) => return Err(format!(\"{:?}\", err)),\n\n };\n\n send_bytes += size;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"samples/command_executer/src/protocol_helpers.rs","rank":1,"score":445150.83098310913},{"content":"pub fn recv_u64(fd: RawFd) -> Result<u64, String> {\n\n let mut buf = [0u8; 9];\n\n recv_loop(fd, &mut buf, 9)?;\n\n let val = LittleEndian::read_u64(&buf);\n\n Ok(val)\n\n}\n\n\n","file_path":"samples/command_executer/src/protocol_helpers.rs","rank":2,"score":390323.5686168078},{"content":"pub fn send_u64(fd: RawFd, val: u64) -> Result<(), String> {\n\n let mut buf = [0u8; 9];\n\n LittleEndian::write_u64(&mut buf, val);\n\n send_loop(fd, &mut buf, 9)?;\n\n Ok(())\n\n}\n\n\n","file_path":"samples/command_executer/src/protocol_helpers.rs","rank":4,"score":374686.06376070296},{"content":"/// Read a LE-encoded 64-bit unsigned value from a socket.\n\npub fn read_u64_le(socket: &mut dyn Read) -> NitroCliResult<u64> {\n\n let mut bytes = [0u8; std::mem::size_of::<u64>()];\n\n socket.read_exact(&mut bytes).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\n\n \"Failed to read {} bytes from the given socket: {:?}\",\n\n std::mem::size_of::<u64>(),\n\n e\n\n ),\n\n NitroCliErrorEnum::SocketError\n\n )\n\n })?;\n\n\n\n Ok(u64::from_le_bytes(bytes))\n\n}\n\n\n","file_path":"src/common/mod.rs","rank":7,"score":349482.77920560504},{"content":"/// Write a LE-encoded 64-bit unsigned value to a socket.\n\npub fn write_u64_le(socket: &mut dyn Write, value: u64) -> NitroCliResult<()> {\n\n let bytes = value.to_le_bytes();\n\n socket.write_all(&bytes).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\n\n \"Failed to write {} bytes to the given socket: {:?}\",\n\n std::mem::size_of::<u64>(),\n\n e\n\n ),\n\n NitroCliErrorEnum::SocketError\n\n )\n\n })\n\n}\n\n\n","file_path":"src/common/mod.rs","rank":11,"score":337240.1688863947},{"content":"fn parse_port(args: &ArgMatches) -> Result<u32, String> {\n\n let port = args\n\n .value_of(\"port\")\n\n .ok_or(\"Could not find port argument\")?;\n\n port.parse()\n\n .map_err(|_err| \"port is not a number\".to_string())\n\n}\n\n\n","file_path":"samples/command_executer/src/command_parser.rs","rank":12,"score":321514.9474942394},{"content":"pub fn recv_i32(fd: RawFd) -> Result<i32, String> {\n\n let mut buf = [0u8; 4];\n\n recv_loop(fd, &mut buf, 4)?;\n\n let val = LittleEndian::read_i32(&buf);\n\n Ok(val)\n\n}\n\n\n","file_path":"samples/command_executer/src/protocol_helpers.rs","rank":13,"score":314959.92352139205},{"content":"/// Obtain an enclave's slot ID from its full ID.\n\npub fn get_slot_id(enclave_id: String) -> Result<u64, String> {\n\n let tokens: Vec<&str> = enclave_id.split(\"-enc\").collect();\n\n\n\n match tokens.get(1) {\n\n Some(slot_id) => u64::from_str_radix(*slot_id, 16)\n\n .map_err(|_err| \"Invalid enclave id format\".to_string()),\n\n None => Err(\"Invalid enclave_id.\".to_string()),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_generate_enclave_id() {\n\n let slot_id: u64 = 7;\n\n let enc_id = generate_enclave_id(slot_id);\n\n let file_path = \"/sys/devices/virtual/dmi/id/board_asset_tag\";\n\n\n","file_path":"src/enclave_proc/utils.rs","rank":14,"score":312612.61564890726},{"content":"/// Get the directory containing Nitro CLI related log files.\n\npub fn get_log_file_base_path() -> String {\n\n match env::var(LOGS_DIR_PATH_ENV_VAR) {\n\n Ok(env_path) => env_path,\n\n Err(_) => LOGS_DIR_PATH.to_string(),\n\n }\n\n}\n\n\n","file_path":"src/common/logger.rs","rank":15,"score":305114.7756890998},{"content":"pub fn send_i32(fd: RawFd, val: i32) -> Result<(), String> {\n\n let mut buf = [0u8; 4];\n\n LittleEndian::write_i32(&mut buf, val);\n\n send_loop(fd, &mut buf, 4)?;\n\n Ok(())\n\n}\n\n\n","file_path":"samples/command_executer/src/protocol_helpers.rs","rank":16,"score":302530.58571570984},{"content":"fn parse_localfile(args: &ArgMatches) -> Result<String, String> {\n\n let output = args\n\n .value_of(\"localpath\")\n\n .ok_or(\"Could not find localpath\")?;\n\n Ok(String::from(output))\n\n}\n\n\n","file_path":"samples/command_executer/src/command_parser.rs","rank":17,"score":294008.1266718526},{"content":"/// Get the path to the directory containing the Unix sockets owned by all enclave processes.\n\npub fn get_sockets_dir_path() -> PathBuf {\n\n let log_path = match env::var(SOCKETS_DIR_PATH_ENV_VAR) {\n\n Ok(env_path) => env_path,\n\n Err(_) => SOCKETS_DIR_PATH.to_string(),\n\n };\n\n Path::new(&log_path).to_path_buf()\n\n}\n\n\n","file_path":"src/common/mod.rs","rank":18,"score":291844.26005000225},{"content":"fn parse_cid(args: &ArgMatches) -> Result<u32, String> {\n\n let port = args.value_of(\"cid\").ok_or(\"Could not find cid argument\")?;\n\n port.parse()\n\n .map_err(|_err| \"cid is not a number\".to_string())\n\n}\n\n\n","file_path":"samples/command_executer/src/command_parser.rs","rank":19,"score":291730.3607781278},{"content":"/// Open a file at a given location for writing and appending.\n\nfn open_log_file(file_path: &Path) -> NitroCliResult<File> {\n\n let file = OpenOptions::new()\n\n .create(true)\n\n .append(true)\n\n .read(false)\n\n .open(file_path)\n\n .map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to open log file: {:?}\", e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![\n\n file_path\n\n .to_str()\n\n .unwrap_or(\"Invalid unicode log file name\"),\n\n \"Open\",\n\n ])\n\n })?;\n\n\n\n let log_file_uid = Uid::from_raw(\n","file_path":"src/common/logger.rs","rank":20,"score":290522.19917322195},{"content":"/// Get the path to the Unix socket owned by an enclave process which also owns the enclave with the given ID.\n\npub fn get_socket_path(enclave_id: &str) -> NitroCliResult<PathBuf> {\n\n // The full enclave ID is \"i-(...)-enc<enc_id>\" and we want to extract only <enc_id>.\n\n let tokens: Vec<_> = enclave_id.rsplit(\"-enc\").collect();\n\n let sockets_path = get_sockets_dir_path();\n\n Ok(sockets_path.join(tokens[0]).with_extension(\"sock\"))\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n #[allow(unused_imports)]\n\n use super::*;\n\n\n\n use crate::common::commands_parser::EmptyArgs;\n\n\n\n const TMP_DIR_STR: &str = \"./tmp_sock_dir\";\n\n\n\n fn unset_envvar(varname: &String) {\n\n let _ = unsafe {\n\n libc::unsetenv(varname.as_ptr() as *const i8);\n\n };\n","file_path":"src/common/mod.rs","rank":21,"score":278296.61879317404},{"content":"fn parse_command(args: &ArgMatches) -> Result<String, String> {\n\n let command = args\n\n .value_of(\"command\")\n\n .ok_or(\"Could not find command argument\")?;\n\n Ok(String::from(command))\n\n}\n\n\n","file_path":"samples/command_executer/src/command_parser.rs","rank":22,"score":270324.7679897451},{"content":"fn parse_remotefile(args: &ArgMatches) -> Result<String, String> {\n\n let output = args\n\n .value_of(\"remotepath\")\n\n .ok_or(\"Could not find remotepath\")?;\n\n Ok(String::from(output))\n\n}\n","file_path":"samples/command_executer/src/command_parser.rs","rank":23,"score":264208.377040709},{"content":"/// Get a string representation of the bit-mask which holds the enclave launch flags.\n\npub fn flags_to_string(flags: u64) -> String {\n\n if flags & NE_ENCLAVE_DEBUG_MODE == NE_ENCLAVE_DEBUG_MODE {\n\n \"DEBUG_MODE\"\n\n } else {\n\n \"NONE\"\n\n }\n\n .to_string()\n\n}\n\n\n","file_path":"src/enclave_proc/utils.rs","rank":25,"score":256821.1862585495},{"content":"/// Receive an object of a specified type from an input stream.\n\npub fn receive_from_stream<T>(input_stream: &mut dyn Read) -> NitroCliResult<T>\n\nwhere\n\n T: DeserializeOwned,\n\n{\n\n let size = read_u64_le(input_stream)\n\n .map_err(|e| e.add_subaction(\"Failed to receive data size\".to_string()))?\n\n as usize;\n\n let mut raw_data: Vec<u8> = vec![0; size];\n\n input_stream.read_exact(&mut raw_data[..]).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to receive data: {:?}\", e),\n\n NitroCliErrorEnum::SocketError\n\n )\n\n })?;\n\n let data: T = serde_cbor::from_slice(&raw_data[..]).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to decode received data: {:?}\", e),\n\n NitroCliErrorEnum::SerdeError\n\n )\n\n })?;\n\n Ok(data)\n\n}\n\n\n","file_path":"src/common/mod.rs","rank":26,"score":255605.49167782674},{"content":"/// Generate a unique ID for a new enclave with the specified slot ID.\n\npub fn generate_enclave_id(slot_id: u64) -> NitroCliResult<String> {\n\n let file_path = \"/sys/devices/virtual/dmi/id/board_asset_tag\";\n\n if metadata(file_path).is_ok() {\n\n let mut file = File::open(file_path).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to open file: {:?}\", e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![file_path, \"Open\"])\n\n })?;\n\n let mut contents = String::new();\n\n file.read_to_string(&mut contents).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to read from file: {:?}\", e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![file_path, \"Read\"])\n\n })?;\n\n contents.retain(|c| !c.is_whitespace());\n\n return Ok(format!(\"{}-enc{:x}\", contents, slot_id));\n\n }\n\n Ok(format!(\"i-0000000000000000-enc{:x}\", slot_id))\n\n}\n\n\n","file_path":"src/enclave_proc/utils.rs","rank":28,"score":245744.39163337369},{"content":"/// Get the path to the log file.\n\nfn get_log_file_path() -> PathBuf {\n\n Path::new(&get_log_file_base_path()).join(LOG_FILE_NAME)\n\n}\n\n\n","file_path":"src/common/logger.rs","rank":29,"score":243701.76184568394},{"content":"/// Transfers a chunck of maximum 4KB from src to dst\n\n/// If no error occurs, returns true if the source disconnects and false otherwise\n\nfn transfer(src: &mut dyn Read, dst: &mut dyn Write) -> bool {\n\n let mut buffer = [0u8; BUFF_SIZE];\n\n\n\n let nbytes = src.read(&mut buffer);\n\n let nbytes = nbytes.unwrap_or(0);\n\n\n\n if nbytes == 0 {\n\n return true;\n\n }\n\n\n\n dst.write_all(&buffer[..nbytes]).is_err()\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use rand;\n\n use std::fs;\n\n use std::fs::File;\n\n use std::io::Write;\n\n use std::process::Command;\n","file_path":"vsock_proxy/src/starter.rs","rank":30,"score":238601.75498446682},{"content":"fn write_config(config: Vec<String>) -> Result<NamedTempFile, DockerError> {\n\n let mut file = NamedTempFile::new().map_err(|_| DockerError::TempfileError)?;\n\n\n\n for line in config {\n\n file.write_fmt(format_args!(\"{}\\n\", line))\n\n .map_err(|_| DockerError::TempfileError)?;\n\n }\n\n\n\n Ok(file)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::io::Read;\n\n\n\n /// Test extracted configuration is as expected\n\n #[test]\n\n fn test_config() {\n\n let docker = DockerUtil::new(String::from(\n","file_path":"enclave_build/src/docker.rs","rank":31,"score":223651.1808087624},{"content":"/// Returns detailed error information based on supplied arguments.\n\npub fn get_detailed_info(error_code_str: String, additional_info: &[String]) -> String {\n\n let mut ret = format!(\"[ {} ] \", error_code_str);\n\n let info_placeholder = \"MISSING_INFO\".to_string();\n\n\n\n match error_code_str.as_str() {\n\n \"E00\" => {\n\n ret.push_str(\"Unspecified error. This is used as a catch-all error and should not be used in the code.\");\n\n }\n\n \"E01\" => {\n\n ret.push_str(\n\n format!(\n\n \"Missing mandatory argument. User did not provide the `{}` argument.\",\n\n additional_info.get(0).unwrap_or(&info_placeholder)\n\n )\n\n .as_str(),\n\n );\n\n }\n\n \"E02\" => {\n\n ret.push_str(\n\n format!(\n","file_path":"src/common/document_errors.rs","rank":32,"score":223649.79785453266},{"content":"/// Parse the enclave image file path from the command-line arguments.\n\nfn parse_eif_path(args: &ArgMatches) -> NitroCliResult<String> {\n\n let eif_path = args.value_of(\"eif-path\").ok_or_else(|| {\n\n new_nitro_cli_failure!(\n\n \"`eif-path` argument not found\",\n\n NitroCliErrorEnum::MissingArgument\n\n )\n\n })?;\n\n Ok(eif_path.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":33,"score":216462.43441406902},{"content":"/// Computes the ceil of `lhs / rhs`. Used for reporting the lower\n\n/// limit of enclave memory based on the EIF file size.\n\npub fn ceil_div(lhs: u64, rhs: u64) -> u64 {\n\n if rhs == 0 {\n\n return std::u64::MAX;\n\n }\n\n\n\n lhs / rhs\n\n + match lhs % rhs {\n\n 0 => 0,\n\n _ => 1,\n\n }\n\n}\n","file_path":"src/utils.rs","rank":34,"score":215401.6304980404},{"content":"/// Set a timeout on a vsock connection.\n\nfn vsock_set_connect_timeout(fd: RawFd, millis: i64) -> NitroCliResult<()> {\n\n let timeval = TimeVal::milliseconds(millis);\n\n let ret = unsafe {\n\n libc::setsockopt(\n\n fd as i32,\n\n libc::AF_VSOCK,\n\n SO_VM_SOCKETS_CONNECT_TIMEOUT,\n\n &timeval as *const _ as *const c_void,\n\n size_of::<TimeVal>() as u32,\n\n )\n\n };\n\n\n\n match ret {\n\n 0 => Ok(()),\n\n _ => Err(new_nitro_cli_failure!(\n\n &format!(\n\n \"Failed to configure SO_VM_SOCKETS_CONNECT_TIMEOUT: {:?}\",\n\n ret\n\n ),\n\n NitroCliErrorEnum::SocketConnectTimeoutError\n\n )),\n\n }\n\n}\n\n\n","file_path":"src/utils.rs","rank":35,"score":214504.51179054595},{"content":"fn parse_error_code_str(args: &ArgMatches) -> NitroCliResult<String> {\n\n let error_code_str = args.value_of(\"error-code\").ok_or_else(|| {\n\n new_nitro_cli_failure!(\n\n \"`error-code` argument not found\",\n\n NitroCliErrorEnum::MissingArgument\n\n )\n\n })?;\n\n Ok(error_code_str.to_string())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n use crate::common::construct_error_message;\n\n use crate::create_app;\n\n\n\n use clap::{App, AppSettings, Arg, SubCommand};\n\n\n\n /// Parse the path of the JSON config file\n","file_path":"src/common/commands_parser.rs","rank":36,"score":211812.37595081294},{"content":"fn parse_no_wait(args: &ArgMatches) -> bool {\n\n if args.is_present(\"no-wait\") {\n\n true\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"samples/command_executer/src/command_parser.rs","rank":37,"score":211104.9929373604},{"content":"pub trait ExitGracefully<T, E> {\n\n fn ok_or_exit(self, message: &str) -> T;\n\n}\n\n\n\nimpl<T, E: std::fmt::Debug> ExitGracefully<T, E> for Result<T, E> {\n\n fn ok_or_exit(self, message: &str) -> T {\n\n match self {\n\n Ok(val) => val,\n\n Err(err) => {\n\n error!(\"{:?}: {}\", err, message);\n\n std::process::exit(1);\n\n }\n\n }\n\n }\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! create_app {\n\n () => {\n\n App::new(\"Vsock Tool\")\n","file_path":"samples/command_executer/src/utils.rs","rank":39,"score":210145.411365818},{"content":"fn vsock_connect(port: u32) -> VsockStream {\n\n let sockaddr = SockAddr::new_vsock(vsock_proxy::starter::VSOCK_PROXY_CID, port);\n\n VsockStream::connect(&sockaddr).expect(\"Could not connect\")\n\n}\n\n\n\n/// Test connection with both client and server sending each other messages\n","file_path":"vsock_proxy/tests/connection_test.rs","rank":40,"score":206599.2234807593},{"content":"/// Get the action associated with `cmd` as a String.\n\nfn get_command_action(cmd: EnclaveProcessCommandType) -> String {\n\n match cmd {\n\n EnclaveProcessCommandType::Run => \"Run Enclave\".to_string(),\n\n EnclaveProcessCommandType::Terminate | EnclaveProcessCommandType::TerminateComplete => {\n\n \"Terminate Enclave\".to_string()\n\n }\n\n EnclaveProcessCommandType::Describe => \"Describe Enclaves\".to_string(),\n\n EnclaveProcessCommandType::GetEnclaveCID => \"Get Enclave CID\".to_string(),\n\n EnclaveProcessCommandType::GetEnclaveFlags => \"Get Enclave Flags\".to_string(),\n\n EnclaveProcessCommandType::ConnectionListenerStop => \"Stop Connection Listener\".to_string(),\n\n _ => \"Unknown Command\".to_string(),\n\n }\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":41,"score":206117.48345520865},{"content":"/// Notify both the user and the logger of an error.\n\npub fn notify_error(err_msg: &str) {\n\n eprintln!(\"{}\", err_msg);\n\n error!(\"{}\", err_msg);\n\n}\n\n\n","file_path":"src/common/mod.rs","rank":42,"score":202411.94333331526},{"content":"/// Returns a link with more detailed information regarding a specific error.\n\npub fn construct_help_link(error_code_str: String) -> String {\n\n format!(\n\n \"https://docs.aws.amazon.com/enclaves/latest/user/cli-errors.html#{}\",\n\n error_code_str\n\n )\n\n}\n\n\n","file_path":"src/common/document_errors.rs","rank":43,"score":202147.8855068369},{"content":"/// Parse the path of an output file from the command-line arguments.\n\nfn parse_output(args: &ArgMatches) -> Option<String> {\n\n args.value_of(\"output-file\").map(|val| val.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":44,"score":199975.10828951874},{"content":"/// Logs the given backtrace string to a separate, backtrace-specific file.\n\n/// Returns a string denoting the path to the corresponding log file.\n\nfn log_backtrace(backtrace: String) -> Result<String, &'static str> {\n\n let log_path_base = get_log_file_base_path();\n\n\n\n // Check if backtrace logs location exists and create it if necessary.\n\n if !Path::new(&log_path_base).exists() {\n\n let create_logs_dir = std::fs::create_dir_all(&log_path_base);\n\n if create_logs_dir.is_err() {\n\n return Err(\"Could not create backtrace logs directory\");\n\n }\n\n }\n\n\n\n let utc_time_now = Utc::now().to_rfc3339();\n\n let log_path_str = format!(\"{}/err{}.log\", &log_path_base, utc_time_now);\n\n let log_path = Path::new(&log_path_str);\n\n let log_file = std::fs::File::create(log_path);\n\n if log_file.is_err() {\n\n return Err(\"Could not create backtrace log file\");\n\n }\n\n\n\n let write_result = log_file.unwrap().write_all(&backtrace.as_bytes());\n\n if write_result.is_err() {\n\n return Err(\"Could not write to backtrace log file\");\n\n }\n\n\n\n match log_path.to_str() {\n\n Some(log_path) => Ok(log_path.to_string()),\n\n None => Err(\"Could not return log file path\"),\n\n }\n\n}\n\n\n","file_path":"src/common/mod.rs","rank":45,"score":199689.47802320786},{"content":"/// Obtain an enclave's CID given its full ID.\n\npub fn enclave_proc_get_cid(enclave_id: &str) -> NitroCliResult<u64> {\n\n let mut comm = enclave_proc_connect_to_single(enclave_id)\n\n .map_err(|e| e.add_subaction(\"Failed to connect to enclave process\".to_string()))?;\n\n // TODO: Replicate output of old CLI on invalid enclave IDs.\n\n enclave_proc_command_send_single::<EmptyArgs>(\n\n EnclaveProcessCommandType::GetEnclaveCID,\n\n None,\n\n &mut comm,\n\n )\n\n .map_err(|e| e.add_subaction(\"Failed to send CID request to enclave process\".to_string()))?;\n\n\n\n info!(\"Sent command: GetEnclaveCID\");\n\n let enclave_cid = read_u64_le(&mut comm)\n\n .map_err(|e| e.add_subaction(String::from(\"Failed to read CID from enclave process\")))?;\n\n\n\n // We got the CID, so shut the connection down.\n\n comm.shutdown(std::net::Shutdown::Both).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\n\n \"Failed to shut down connection after obtaining enclave CID: {:?}\",\n\n e\n\n ),\n\n NitroCliErrorEnum::SocketError\n\n )\n\n })?;\n\n\n\n Ok(enclave_cid)\n\n}\n\n\n","file_path":"src/enclave_proc_comm.rs","rank":46,"score":194958.5113902629},{"content":"/// Obtain an enclave's flags given its full ID.\n\npub fn enclave_proc_get_flags(enclave_id: &str) -> NitroCliResult<u64> {\n\n let mut comm = enclave_proc_connect_to_single(enclave_id)\n\n .map_err(|e| e.add_subaction(\"Failed to connect to enclave process\".to_string()))?;\n\n // TODO: Replicate output of old CLI on invalid enclave IDs.\n\n enclave_proc_command_send_single::<EmptyArgs>(\n\n EnclaveProcessCommandType::GetEnclaveFlags,\n\n None,\n\n &mut comm,\n\n )\n\n .map_err(|e| e.add_subaction(\"Failed to send flags request to enclave process\".to_string()))?;\n\n\n\n info!(\"Sent command: GetEnclaveFlags\");\n\n let enclave_flags = read_u64_le(&mut comm)\n\n .map_err(|e| e.add_subaction(String::from(\"Failed to read flags from enclave process\")))?;\n\n\n\n // We got the flags, so shut the connection down.\n\n comm.shutdown(std::net::Shutdown::Both).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\n\n \"Failed to shut down connection after obtaining enclave flags: {:?}\",\n\n e\n\n ),\n\n NitroCliErrorEnum::SocketError\n\n )\n\n })?;\n\n\n\n Ok(enclave_flags)\n\n}\n","file_path":"src/enclave_proc_comm.rs","rank":47,"score":194958.5113902629},{"content":"/// Detailed information based on user-provided error code.\n\npub fn explain_error(error_code_str: String) {\n\n match error_code_str.as_str() {\n\n \"E00\" => {\n\n eprintln!(\"Unspecified error. This is used as a catch-all error and should not be used in the code.\");\n\n }\n\n \"E01\" => {\n\n eprintln!(\"Missing mandatory argument. Such error appears when the Nitro CLI is requested to perform an operation, but not all of the mandatory arguments were supplied.\\n\\tExample: `nitro-cli run-enclave --cpu-count 2 --eif-path /path/to/my/eif`. Note that in this case, the mandatory parameter `--memory` is missing a value.\");\n\n }\n\n \"E02\" => {\n\n eprintln!(\"CLI conflicting arguments. Such error appears when the Nitro CLI is supplied two contradicting arguments at the same time, such as `--cpu-count` and `--cpu-ids`.\\nIn this case, only one of the parameters should be supplied.\");\n\n }\n\n \"E03\" => {\n\n eprintln!(\"Invalid argument provided. Such error appears when the type of at least one of the arguments provided to the Nitro CLI does not match the expected type of that parameter.\\n\\tExample: `nitro-cli run-enclave --cpu-count 1z --memory 80 --eif-path /path/to/my/eif`. In this case, `cpu-count` is not a valid integer value.\" );\n\n }\n\n \"E04\" => {\n\n eprintln!(\"Socket pair creation failure. Such error apears when the Nitro CLI process attempts to open a stream pair in order to send a command to the enclave process, but the stream initialization fails.\");\n\n }\n\n \"E05\" => {\n\n eprintln!(\"Process spawn failure. Such error appears when the main Nitro CLI process failed to spawn the enclave process, in order to complete a `run-enclave` command.\");\n\n }\n","file_path":"src/common/document_errors.rs","rank":48,"score":193970.88513532546},{"content":"/// Parse the requested amount of enclave memory from the command-line arguments.\n\nfn parse_memory(args: &ArgMatches) -> NitroCliResult<u64> {\n\n let memory = args.value_of(\"memory\").ok_or_else(|| {\n\n new_nitro_cli_failure!(\n\n \"`memory` argument not found\",\n\n NitroCliErrorEnum::MissingArgument\n\n )\n\n })?;\n\n memory.parse().map_err(|_| {\n\n new_nitro_cli_failure!(\n\n \"`memory` is not a number\",\n\n NitroCliErrorEnum::InvalidArgument\n\n )\n\n .add_info(vec![\"memory\", memory])\n\n })\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":49,"score":191218.07820984133},{"content":"/// Obtain the enclave information requested by the `describe-enclaves` command.\n\npub fn get_enclave_describe_info(\n\n enclave_manager: &EnclaveManager,\n\n) -> NitroCliResult<EnclaveDescribeInfo> {\n\n let (slot_uid, enclave_cid, cpus_count, cpu_ids, memory_mib, flags, state) =\n\n enclave_manager.get_description_resources()?;\n\n let info = EnclaveDescribeInfo::new(\n\n generate_enclave_id(slot_uid)?,\n\n enclave_cid,\n\n cpus_count,\n\n cpu_ids,\n\n memory_mib,\n\n state.to_string(),\n\n flags_to_string(flags),\n\n );\n\n Ok(info)\n\n}\n\n\n","file_path":"src/enclave_proc/utils.rs","rank":50,"score":190436.16568337823},{"content":"/// Obtain the enclave information requested by the `run-enclaves` command.\n\npub fn get_run_enclaves_info(\n\n enclave_cid: u64,\n\n slot_id: u64,\n\n cpu_ids: Vec<u32>,\n\n memory: u64,\n\n) -> NitroCliResult<EnclaveRunInfo> {\n\n let info = EnclaveRunInfo::new(\n\n generate_enclave_id(slot_id)?,\n\n enclave_cid,\n\n cpu_ids.len(),\n\n cpu_ids,\n\n memory,\n\n );\n\n Ok(info)\n\n}\n\n\n","file_path":"src/enclave_proc/utils.rs","rank":51,"score":190436.16568337823},{"content":"/// Returns the value of the `NITRO_CLI_ARTIFACTS` environment variable.\n\n///\n\n/// This variable configures the path where the build artifacts should be saved.\n\nfn artifacts_path() -> NitroCliResult<String> {\n\n if let Ok(artifacts) = std::env::var(\"NITRO_CLI_ARTIFACTS\") {\n\n std::fs::create_dir_all(artifacts.clone()).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Could not create artifacts path {}: {:?}\", artifacts, e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![&artifacts, \"Create\"])\n\n })?;\n\n Ok(artifacts)\n\n } else if let Ok(home) = std::env::var(\"HOME\") {\n\n let artifacts = format!(\"{}/.nitro_cli/\", home);\n\n std::fs::create_dir_all(artifacts.clone()).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Could not create artifacts path {}: {:?}\", artifacts, e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![&artifacts, \"Create\"])\n\n })?;\n\n Ok(artifacts)\n\n } else {\n\n Err(new_nitro_cli_failure!(\n\n \"Could not find a folder for the CLI artifacts, set either HOME or NITRO_CLI_ARTIFACTS\",\n\n NitroCliErrorEnum::ArtifactsPathNotSet\n\n ))\n\n }\n\n}\n\n\n","file_path":"src/lib.rs","rank":52,"score":189192.02763545213},{"content":"/// Returns the value of the `NITRO_CLI_BLOBS` environment variable.\n\n///\n\n/// This variable specifies where all the blobs necessary for building\n\n/// an enclave image are stored. As of now the blobs are:\n\n/// - *bzImage*: A kernel image.\n\n/// - *init*: The initial init process that is bootstraping the environment.\n\n/// - *linuxkit*: A slightly modified version of linuxkit.\n\n/// - *cmdline*: A file containing the kernel commandline.\n\nfn blobs_path() -> NitroCliResult<String> {\n\n // TODO Improve error message with a suggestion to the user\n\n // consider using the default path used by rpm install\n\n let blobs_res = std::env::var(\"NITRO_CLI_BLOBS\");\n\n\n\n Ok(blobs_res.unwrap_or_else(|_| DEFAULT_BLOBS_PATH.to_string()))\n\n}\n\n\n","file_path":"src/lib.rs","rank":53,"score":189188.95472537228},{"content":"/// Connects to the enclave console and prints it continously.\n\npub fn enclave_console(enclave_cid: u64) -> NitroCliResult<()> {\n\n let console = Console::new(\n\n VMADDR_CID_HYPERVISOR,\n\n u32::try_from(enclave_cid).map_err(|err| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to parse enclave CID: {:?}\", err),\n\n NitroCliErrorEnum::IntegerParsingError\n\n )\n\n })? + CID_TO_CONSOLE_PORT_OFFSET,\n\n )\n\n .map_err(|e| e.add_subaction(\"Connect to enclave console\".to_string()))?;\n\n println!(\"Successfully connected to the console.\");\n\n console\n\n .read_to(io::stdout().by_ref())\n\n .map_err(|e| e.add_subaction(\"Connect to enclave console\".to_string()))?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/lib.rs","rank":54,"score":188229.86357751844},{"content":"/// Wrapper over the console connection function.\n\npub fn console_enclaves(enclave_cid: u64) -> NitroCliResult<()> {\n\n debug!(\"console_enclaves\");\n\n println!(\"Connecting to the console for enclave {}...\", enclave_cid);\n\n enclave_console(enclave_cid)?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/lib.rs","rank":55,"score":188225.23326100764},{"content":"/// Send the given command, then close the channel that was used for sending it.\n\nfn send_command_and_close(cmd: EnclaveProcessCommandType, stream: &mut UnixStream) {\n\n let action_str = &get_command_action(cmd);\n\n\n\n enclave_proc_command_send_single::<EmptyArgs>(cmd, None, stream)\n\n .ok_or_exit_with_errno(Some(\"Failed to send command\"));\n\n stream\n\n .shutdown(std::net::Shutdown::Both)\n\n .map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to close stream after sending command: {:?}\", e),\n\n NitroCliErrorEnum::SocketCloseError\n\n )\n\n .set_action(action_str.to_string())\n\n })\n\n .ok_or_exit_with_errno(Some(\"Failed to shut down stream\"));\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":56,"score":187923.6834556615},{"content":"/// Parse the enclave's ID from the command-line arguments.\n\nfn parse_enclave_id(args: &ArgMatches) -> NitroCliResult<String> {\n\n let enclave_id = args.value_of(\"enclave-id\").ok_or_else(|| {\n\n new_nitro_cli_failure!(\n\n \"`enclave-id` argument not found\",\n\n NitroCliErrorEnum::MissingArgument\n\n )\n\n })?;\n\n Ok(enclave_id.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":57,"score":186703.15246554997},{"content":"/// Assembles the error message which gets displayed to the user.\n\npub fn construct_error_message(failure: &NitroCliFailure) -> String {\n\n // Suggestive error description comes first.\n\n let error_info: String = document_errors::get_detailed_info(\n\n (*ERROR_CODES.get(&failure.error_code).unwrap_or(&\"E00\")).to_string(),\n\n &failure.additional_info,\n\n );\n\n\n\n // Include a link to the documentation page.\n\n let help_link: String = document_errors::construct_help_link(\n\n (*ERROR_CODES.get(&failure.error_code).unwrap_or(&\"E00\")).to_string(),\n\n );\n\n let backtrace: String = document_errors::construct_backtrace(&failure);\n\n\n\n // Write backtrace to a log file.\n\n let log_path = log_backtrace(backtrace.clone());\n\n\n\n // Return final output, depending on whether the user requested the backtrace or not.\n\n match std::env::var(BACKTRACE_VAR) {\n\n Ok(display_backtrace) => match display_backtrace.as_str() {\n\n \"1\" => {\n","file_path":"src/common/mod.rs","rank":58,"score":184099.7492710174},{"content":"/// Print a message to a connection's standard output, if the connection is available.\n\npub fn safe_conn_println(conn: Option<&Connection>, msg: &str) -> NitroCliResult<()> {\n\n if conn.is_none() {\n\n return Ok(());\n\n }\n\n\n\n conn.unwrap().println(msg)\n\n}\n\n\n","file_path":"src/enclave_proc/connection.rs","rank":59,"score":182576.37163121035},{"content":"/// The default POSIX signal handling function, which notifies the enclave process to shut down gracefully.\n\nfn enclave_proc_handle_signals(comm_fd: RawFd, signal: Signal) -> bool {\n\n let mut stream = unsafe { UnixStream::from_raw_fd(comm_fd) };\n\n\n\n warn!(\n\n \"Received signal {:?}. The enclave process will now close.\",\n\n signal\n\n );\n\n send_command_and_close(\n\n EnclaveProcessCommandType::ConnectionListenerStop,\n\n &mut stream,\n\n );\n\n\n\n true\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":60,"score":182203.23211186967},{"content":"/// Parse the requested number of CPUs from the command-line arguments.\n\nfn parse_cpu_count(args: &ArgMatches) -> NitroCliResult<Option<u32>> {\n\n let cpu_count = if let Some(cpu_count) = args.value_of(\"cpu-count\") {\n\n let cpu_count: u32 = cpu_count.parse().map_err(|_| {\n\n new_nitro_cli_failure!(\n\n \"`cpu-count` is not a number\",\n\n NitroCliErrorEnum::InvalidArgument\n\n )\n\n .add_info(vec![\"cpu-count\", cpu_count])\n\n })?;\n\n Some(cpu_count)\n\n } else {\n\n None\n\n };\n\n Ok(cpu_count)\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":61,"score":180083.07049423349},{"content":"/// Parse the enclave's required CID from the command-line arguments.\n\nfn parse_enclave_cid(args: &ArgMatches) -> NitroCliResult<Option<u64>> {\n\n let enclave_cid = if let Some(enclave_cid) = args.value_of(\"enclave-cid\") {\n\n let enclave_cid: u64 = enclave_cid.parse().map_err(|_| {\n\n new_nitro_cli_failure!(\n\n \"`enclave-cid` is not a number\",\n\n NitroCliErrorEnum::InvalidArgument\n\n )\n\n .add_info(vec![\"enclave-cid\", enclave_cid])\n\n })?;\n\n\n\n // Do not use well-known CID values - 0, 1, 2 - as the enclave CID.\n\n // VMADDR_CID_ANY = -1U\n\n // VMADDR_CID_HYPERVISOR = 0\n\n // VMADDR_CID_LOCAL = 1\n\n // VMADDR_CID_HOST = 2\n\n // Note: 0 is used as a placeholder to auto-generate a CID.\n\n // <http://man7.org/linux/man-pages/man7/vsock.7.html>\n\n if enclave_cid == 0 {\n\n eprintln!(\"The enclave CID will be auto-generated as the provided CID is 0\");\n\n }\n","file_path":"src/common/commands_parser.rs","rank":62,"score":179940.22117352605},{"content":"/// Send a command to a single socket.\n\npub fn enclave_proc_command_send_single<T>(\n\n cmd: EnclaveProcessCommandType,\n\n args: Option<&T>,\n\n mut socket: &mut UnixStream,\n\n) -> NitroCliResult<()>\n\nwhere\n\n T: Serialize,\n\n{\n\n // Serialize the command type.\n\n let cmd_bytes = serde_cbor::to_vec(&cmd).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Invalid command format: {:?}\", e),\n\n NitroCliErrorEnum::InvalidCommand\n\n )\n\n })?;\n\n\n\n // The command is written twice. The first read is done by the connection listener to check if this is\n\n // a shut-down command. The second read is done by the enclave process for all non-shut-down commands.\n\n for _ in 0..2 {\n\n write_u64_le(&mut socket, cmd_bytes.len() as u64)\n","file_path":"src/common/mod.rs","rank":63,"score":179723.41636068115},{"content":"/// Parse the list of requested CPU IDs from the command-line arguments.\n\nfn parse_cpu_ids(args: &ArgMatches) -> NitroCliResult<Option<Vec<u32>>> {\n\n let cpu_ids_arg = args.values_of(\"cpu-ids\");\n\n match cpu_ids_arg {\n\n Some(iterator) => {\n\n let mut cpu_ids = Vec::new();\n\n for cpu_id in iterator {\n\n cpu_ids.push(cpu_id.parse().map_err(|_| {\n\n new_nitro_cli_failure!(\n\n \"`cpu-id` is not a number\",\n\n NitroCliErrorEnum::InvalidArgument\n\n )\n\n .add_info(vec![\"cpu-id\", cpu_id])\n\n })?);\n\n }\n\n Ok(Some(cpu_ids))\n\n }\n\n None => Ok(None),\n\n }\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":65,"score":173600.94557532776},{"content":"/// Obtain the logger ID from the full enclave ID.\n\nfn get_logger_id(enclave_id: &str) -> String {\n\n // The full enclave ID is \"i-(...)-enc<enc_id>\" and we want to extract only <enc_id>.\n\n let tokens: Vec<_> = enclave_id.rsplit(\"-enc\").collect();\n\n format!(\"enc-{}:{}\", tokens[0], std::process::id())\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":66,"score":171866.5851447145},{"content":"// Generate the sysroot path based on the architecture the program is built.\n\n// This is needed for the compiler to locate the architecture dependent\n\n// header files.\n\nfn get_gcc_sysroot() -> String {\n\n // Initialize the output because it might remain uninitialized with the\n\n // current control flow\n\n let mut output = Err(io::Error::from(io::ErrorKind::NotFound));\n\n\n\n // Use the `CC` environment variable if existing\n\n // which should give us directly the compiler's name\n\n let cc = env::var(\"CC\");\n\n if let Ok(cc) = cc {\n\n output = Command::new(cc).arg(\"--print-sysroot\").output();\n\n }\n\n\n\n if output.is_err() {\n\n // Otherwise, try to guess the compiler's name by the name\n\n // $TARGET-gcc, where $TARGET represents the target architecture\n\n // that was specified for build\n\n let target = env::var(\"TARGET\").unwrap();\n\n output = Command::new(format!(\"{}-gcc\", target))\n\n .arg(\"--print-sysroot\")\n\n .output();\n","file_path":"build.rs","rank":67,"score":171210.34214012095},{"content":"/// Notify that an error has occurred, also forwarding the error message to a connection.\n\nfn notify_error_with_conn(err_msg: &str, conn: &Connection, action: EnclaveProcessCommandType) {\n\n let action_str = &get_command_action(action);\n\n\n\n notify_error(err_msg);\n\n conn.eprintln(err_msg)\n\n .map_err(|e| e.set_action(action_str.to_string()))\n\n .ok_or_exit_with_errno(Some(\"Failed to forward error message to connection\"));\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":68,"score":169920.20575970813},{"content":"/// Parse the debug-mode flag from the command-line arguments.\n\nfn debug_mode(args: &ArgMatches) -> Option<bool> {\n\n let val = args.is_present(\"debug-mode\");\n\n if val {\n\n Some(val)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":69,"score":168185.5179805259},{"content":"/// Parse the Docker tag from the command-line arguments.\n\nfn parse_docker_tag(args: &ArgMatches) -> Option<String> {\n\n args.value_of(\"docker-uri\").map(|val| val.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":70,"score":163904.774072956},{"content":"/// Parse the Docker directory from the command-line arguments.\n\nfn parse_docker_dir(args: &ArgMatches) -> Option<String> {\n\n args.value_of(\"docker-dir\").map(|val| val.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":71,"score":163904.774072956},{"content":"fn parse_signing_certificate(args: &ArgMatches) -> Option<String> {\n\n args.value_of(\"signing-certificate\")\n\n .map(|val| val.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":72,"score":163900.29502817985},{"content":"fn parse_private_key(args: &ArgMatches) -> Option<String> {\n\n args.value_of(\"private-key\").map(|val| val.to_string())\n\n}\n\n\n","file_path":"src/common/commands_parser.rs","rank":73,"score":163900.29502817985},{"content":"/// Obtain an enclave's description and provide it through the given connection.\n\npub fn describe_enclaves(\n\n enclave_manager: &EnclaveManager,\n\n connection: &Connection,\n\n) -> NitroCliResult<()> {\n\n debug!(\"describe_enclaves\");\n\n\n\n let info = get_enclave_describe_info(enclave_manager)\n\n .map_err(|e| e.add_subaction(String::from(\"Execute Describe Enclave command\")))?;\n\n connection.println(\n\n serde_json::to_string_pretty(&info)\n\n .map_err(|err| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to display enclave describe data: {:?}\", err),\n\n NitroCliErrorEnum::SerdeError\n\n )\n\n })?\n\n .as_str(),\n\n )\n\n}\n","file_path":"src/enclave_proc/commands.rs","rank":74,"score":162457.18201980533},{"content":"/// Terminate an enclave and provide the termination status through the given connection.\n\npub fn terminate_enclaves(\n\n enclave_manager: &mut EnclaveManager,\n\n connection: Option<&Connection>,\n\n) -> NitroCliResult<()> {\n\n let enclave_id = enclave_manager.enclave_id.clone();\n\n\n\n debug!(\"terminate_enclaves\");\n\n enclave_manager\n\n .update_state(EnclaveState::Terminating)\n\n .map_err(|e| e.add_subaction(\"Failed to update enclave state\".to_string()))?;\n\n if let Err(error_info) = enclave_manager.terminate_enclave() {\n\n safe_conn_eprintln(\n\n connection,\n\n format!(\n\n \"Warning: Failed to stop enclave {}\\nError message: {:?}\",\n\n enclave_manager.enclave_id,\n\n construct_error_message(&error_info).as_str()\n\n )\n\n .as_str(),\n\n )?;\n","file_path":"src/enclave_proc/commands.rs","rank":75,"score":162457.1173388776},{"content":"/// Launch an enclave with the specified arguments and provide the launch status through the given connection.\n\npub fn run_enclaves(\n\n args: &RunEnclavesArgs,\n\n connection: Option<&Connection>,\n\n) -> NitroCliResult<EnclaveManager> {\n\n debug!(\"run_enclaves\");\n\n\n\n let eif_file = File::open(&args.eif_path).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to open the EIF file: {:?}\", e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![&args.eif_path, \"Open\"])\n\n })?;\n\n\n\n let cpu_ids = CpuInfo::new()\n\n .map_err(|e| e.add_subaction(\"Failed to construct CPU information\".to_string()))?\n\n .get_cpu_config(args)\n\n .map_err(|e| e.add_subaction(\"Failed to get CPU configuration\".to_string()))?;\n\n let mut enclave_manager = EnclaveManager::new(\n\n args.enclave_cid,\n","file_path":"src/enclave_proc/commands.rs","rank":76,"score":162456.99339108064},{"content":"/// Connect to all existing enclave processes, returning a connection to each.\n\npub fn enclave_proc_connect_to_all() -> NitroCliResult<Vec<UnixStream>> {\n\n let paths = fs::read_dir(get_sockets_dir_path()).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to access sockets directory: {:?}\", e),\n\n NitroCliErrorEnum::ReadFromDiskFailure\n\n )\n\n })?;\n\n Ok(paths\n\n .filter_map(|path| path.ok())\n\n .map(|path| path.path())\n\n .filter(|path| !path.is_dir())\n\n .filter_map(|path| {\n\n // Get the file path string.\n\n if let Some(path_str) = path.to_str() {\n\n // Enclave process sockets are named \"<enclave_id>.sock\".\n\n if !path_str.ends_with(\".sock\") {\n\n return None;\n\n }\n\n\n\n // At this point we have found a potential socket.\n","file_path":"src/enclave_proc_comm.rs","rank":77,"score":157136.61555515556},{"content":"/// Print a message to a connection's standard error, if the connection is available.\n\npub fn safe_conn_eprintln(conn: Option<&Connection>, msg: &str) -> NitroCliResult<()> {\n\n if conn.is_none() {\n\n return Ok(());\n\n }\n\n\n\n conn.unwrap().eprintln(msg)\n\n}\n","file_path":"src/enclave_proc/connection.rs","rank":78,"score":154302.520015678},{"content":"/// Terminates all enclave instances belonging to the current user (or all\n\n/// instances, if the current user has `root` permissions).\n\npub fn terminate_all_enclaves() -> NitroCliResult<()> {\n\n let sockets_dir = get_sockets_dir_path();\n\n let mut replies: Vec<UnixStream> = vec![];\n\n let sockets = std::fs::read_dir(sockets_dir.as_path()).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Error while accessing sockets directory: {:?}\", e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![\n\n sockets_dir\n\n .as_path()\n\n .to_str()\n\n .unwrap_or(\"Invalid unicode directory name\"),\n\n \"Read\",\n\n ])\n\n })?;\n\n\n\n let mut err_socket_files: usize = 0;\n\n let mut failed_connections: Vec<PathBuf> = Vec::new();\n\n for socket in sockets {\n","file_path":"src/lib.rs","rank":79,"score":153442.62248582617},{"content":"/// Fetch JSON objects and statuses from all connected enclave processes.\n\npub fn enclave_proc_handle_outputs<T>(conns: &mut [UnixStream]) -> Vec<(T, i32)>\n\nwhere\n\n T: DeserializeOwned,\n\n{\n\n let mut objects: Vec<(T, i32)> = Vec::new();\n\n\n\n for conn in conns.iter_mut() {\n\n // We only count connections that have yielded a valid JSON object and a status\n\n let (object, status) = enclave_proc_handle_output::<T>(conn);\n\n if let Some(object) = object {\n\n if let Some(status) = status {\n\n objects.push((object, status));\n\n }\n\n }\n\n }\n\n\n\n objects\n\n}\n\n\n","file_path":"src/enclave_proc_comm.rs","rank":80,"score":153375.00721340787},{"content":"/// Returns a string containing the backtrace recorded during propagating an error message\n\npub fn construct_backtrace(failure_info: &NitroCliFailure) -> String {\n\n let mut ret = String::new();\n\n let commit_id = env!(\"COMMIT_ID\");\n\n\n\n ret.push_str(&format!(\" Action: {}\\n Subactions:\", failure_info.action));\n\n for subaction in failure_info.subactions.iter().rev() {\n\n ret.push_str(&format!(\"\\n {}\", subaction));\n\n }\n\n ret.push_str(&format!(\"\\n Root error file: {}\", failure_info.file));\n\n ret.push_str(&format!(\"\\n Root error line: {}\", failure_info.line));\n\n\n\n ret.push_str(&format!(\n\n \"\\n Build commit: {}\",\n\n match commit_id.len() {\n\n 0 => \"not available\",\n\n _ => commit_id,\n\n }\n\n ));\n\n\n\n ret\n\n}\n\n\n","file_path":"src/common/document_errors.rs","rank":81,"score":150303.09045517482},{"content":"/// Broadcast a command to all available enclave processes.\n\npub fn enclave_proc_command_send_all<T>(\n\n cmd: EnclaveProcessCommandType,\n\n args: Option<&T>,\n\n) -> NitroCliResult<(Vec<UnixStream>, usize)>\n\nwhere\n\n T: Serialize,\n\n{\n\n // Open a connection to each valid socket.\n\n let mut replies: Vec<UnixStream> = vec![];\n\n let epoll_fd = epoll::epoll_create().map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to create epoll: {:?}\", e),\n\n NitroCliErrorEnum::EpollError\n\n )\n\n })?;\n\n let comms: Vec<NitroCliResult<()>> = enclave_proc_connect_to_all()\n\n .map_err(|e| {\n\n e.add_subaction(\"Failed to send command to all enclave processes\".to_string())\n\n })?\n\n .iter_mut()\n","file_path":"src/enclave_proc_comm.rs","rank":82,"score":146623.69795728917},{"content":"/// Open a connection to an enclave-specific socket.\n\npub fn enclave_proc_connect_to_single(enclave_id: &str) -> NitroCliResult<UnixStream> {\n\n let socket_path = get_socket_path(enclave_id).map_err(|e| {\n\n e.add_subaction(\"Connect to specific enclave process\".to_string())\n\n .set_error_code(NitroCliErrorEnum::SocketError)\n\n })?;\n\n UnixStream::connect(socket_path).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to connect to specific enclave process: {:?}\", e),\n\n NitroCliErrorEnum::SocketError\n\n )\n\n })\n\n}\n\n\n","file_path":"src/enclave_proc_comm.rs","rank":83,"score":145033.0655005389},{"content":"/// Spawn an enclave process and wait until it has detached and has\n\n/// taken ownership of its communication socket.\n\npub fn enclave_proc_spawn(logger: &EnclaveProcLogWriter) -> NitroCliResult<UnixStream> {\n\n let (cli_socket, enclave_proc_socket) = UnixStream::pair().map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Could not create a socket pair: {:?}\", e),\n\n NitroCliErrorEnum::SocketPairCreationFailure\n\n )\n\n })?;\n\n\n\n // Prevent the descriptor from being closed when calling exec().\n\n let enclave_proc_fd = enclave_proc_socket.as_raw_fd();\n\n unsafe {\n\n let flags = libc::fcntl(enclave_proc_fd, libc::F_GETFD);\n\n libc::fcntl(enclave_proc_fd, libc::F_SETFD, flags & !libc::FD_CLOEXEC);\n\n }\n\n\n\n // Spawn an intermediate child process. This will fork again in order to\n\n // create the detached enclave process.\n\n let fork_status = fork();\n\n\n\n if let Ok(ForkResult::Child) = fork_status {\n","file_path":"src/enclave_proc_comm.rs","rank":84,"score":142648.9093656653},{"content":"/// Handle an event coming from an enclave.\n\nfn try_handle_enclave_event(connection: &Connection) -> NitroCliResult<HandledEnclaveEvent> {\n\n // Check if this is an enclave connection.\n\n if let Some(mut enc_events) = connection\n\n .get_enclave_event_flags()\n\n .map_err(|e| e.add_subaction(\"Failed to get enclave events flag\".to_string()))?\n\n {\n\n let enc_hup = enc_events.contains(EpollFlags::EPOLLHUP);\n\n\n\n // Check if non-hang-up events have occurred.\n\n enc_events.remove(EpollFlags::EPOLLHUP);\n\n if !enc_events.is_empty() {\n\n warn!(\"Received unexpected enclave event(s): {:?}\", enc_events);\n\n }\n\n\n\n // If we received the hang-up event we need to terminate cleanly.\n\n if enc_hup {\n\n warn!(\"Received hang-up event from the enclave. Enclave process will shut down.\");\n\n return Ok(HandledEnclaveEvent::HangUp);\n\n }\n\n\n\n // Non-hang-up enclave events are not fatal.\n\n return Ok(HandledEnclaveEvent::Unexpected);\n\n }\n\n\n\n Ok(HandledEnclaveEvent::None)\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":85,"score":142642.147749677},{"content":"fn main() {\n\n let app = create_app!();\n\n let args = app.get_matches();\n\n\n\n match args.subcommand() {\n\n (\"listen\", Some(args)) => {\n\n let listen_args = ListenArgs::new_with(args).ok_or_exit(args.usage());\n\n listen(listen_args).ok_or_exit(args.usage());\n\n }\n\n (\"run\", Some(args)) => {\n\n let run_args = RunArgs::new_with(args).ok_or_exit(args.usage());\n\n let rc = run(run_args).ok_or_exit(args.usage());\n\n std::process::exit(rc);\n\n }\n\n (\"recv-file\", Some(args)) => {\n\n let subcmd_args = FileArgs::new_with(args).ok_or_exit(args.usage());\n\n recv_file(subcmd_args).ok_or_exit(args.usage());\n\n }\n\n (\"send-file\", Some(args)) => {\n\n let subcmd_args = FileArgs::new_with(args).ok_or_exit(args.usage());\n\n send_file(subcmd_args).ok_or_exit(args.usage());\n\n }\n\n (&_, _) => {}\n\n }\n\n}\n","file_path":"samples/command_executer/src/main.rs","rank":86,"score":142538.0422475175},{"content":"/// Handle a single command, returning whenever an error occurs.\n\nfn handle_command(\n\n cmd: EnclaveProcessCommandType,\n\n logger: &EnclaveProcLogWriter,\n\n connection: &Connection,\n\n conn_listener: &mut ConnectionListener,\n\n enclave_manager: &mut EnclaveManager,\n\n terminate_thread: &mut Option<std::thread::JoinHandle<()>>,\n\n) -> NitroCliResult<(i32, bool)> {\n\n Ok(match cmd {\n\n EnclaveProcessCommandType::Run => {\n\n // We should never receive a Run command if we are already running.\n\n if !enclave_manager.enclave_id.is_empty() {\n\n (libc::EEXIST, false)\n\n } else {\n\n let run_args = connection.read::<RunEnclavesArgs>().map_err(|e| {\n\n e.add_subaction(\"Failed to get run arguments\".to_string())\n\n .set_action(\"Run Enclave\".to_string())\n\n })?;\n\n info!(\"Run args = {:?}\", run_args);\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":87,"score":142470.63699953142},{"content":"#[derive(Debug, Serialize, Deserialize)]\n\nstruct FileTemplate {\n\n path: String,\n\n source: String,\n\n mode: String,\n\n}\n\n\n","file_path":"enclave_build/src/yaml_generator.rs","rank":88,"score":142274.7872550611},{"content":"/// Release the enclave descriptor.\n\nfn release_enclave_descriptor(enc_fd: RawFd) -> NitroCliResult<()> {\n\n // Close enclave descriptor.\n\n let rc = unsafe { libc::close(enc_fd) };\n\n if rc < 0 {\n\n return Err(new_nitro_cli_failure!(\n\n \"Failed to close enclave descriptor\",\n\n NitroCliErrorEnum::FileOperationFailure\n\n ));\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/enclave_proc/resource_manager.rs","rank":89,"score":141631.91017884453},{"content":"#[derive(PartialEq, Eq, Hash)]\n\nenum CommandRequesterType {\n\n /// The requester is the user with the given UID.\n\n User(libc::uid_t),\n\n /// The requester is the group with the given GID.\n\n Group(libc::gid_t),\n\n /// The requester is any other user.\n\n Others,\n\n}\n\n\n","file_path":"src/enclave_proc/connection.rs","rank":90,"score":141333.74682927865},{"content":"/// The policy used to filter received commands based on the requester's type.\n\nstruct CommandRequesterPolicy {\n\n /// A mapping between a requester's type and all of its allowed commands.\n\n policy: HashMap<CommandRequesterType, Vec<EnclaveProcessCommandType>>,\n\n}\n\n\n","file_path":"src/enclave_proc/connection.rs","rank":91,"score":141213.28932311328},{"content":"/// The main event loop of the enclave process.\n\nfn process_event_loop(\n\n comm_stream: UnixStream,\n\n logger: &EnclaveProcLogWriter,\n\n) -> NitroCliResult<()> {\n\n let mut conn_listener = ConnectionListener::new()?;\n\n let mut enclave_manager = EnclaveManager::default();\n\n let mut terminate_thread: Option<std::thread::JoinHandle<()>> = None;\n\n let mut done = false;\n\n let mut ret_value = Ok(());\n\n\n\n // Start the signal handler before spawning any other threads. This is done since the\n\n // handler will mask all relevant signals from the current thread and this setting will\n\n // be automatically inherited by all threads spawned from this point on; we want this\n\n // because only the dedicated thread spawned by the handler should listen for signals.\n\n enclave_proc_configure_signal_handler(&conn_listener)\n\n .map_err(|e| e.add_subaction(\"Failed to configure signal handler\".to_string()))?;\n\n\n\n // Add the CLI communication channel to epoll.\n\n conn_listener\n\n .handle_new_connection(comm_stream)\n","file_path":"src/enclave_proc/mod.rs","rank":92,"score":139492.32476167358},{"content":"fn initial_digest(len: usize) -> Vec<u8> {\n\n vec![0; len]\n\n}\n\n\n\nimpl<T: Digest + Debug + Write + Clone> EifHasher<T> {\n\n pub fn new(block_size: usize, mut hasher: T) -> Result<Self, String> {\n\n let output_size = hasher.finalize_reset().len();\n\n if block_size > 0 && output_size * 2 > block_size {\n\n return Err(\"Invalid block_size\".to_string());\n\n }\n\n\n\n Ok(EifHasher {\n\n block: Vec::with_capacity(block_size),\n\n digest: initial_digest(output_size),\n\n block_size,\n\n output_size,\n\n hasher,\n\n })\n\n }\n\n\n","file_path":"eif_defs/src/eif_hasher.rs","rank":93,"score":136567.99369531134},{"content":"/// Create the enclave process.\n\nfn create_enclave_process(logger: &EnclaveProcLogWriter) -> NitroCliResult<()> {\n\n // To get a detached process, we first:\n\n // (1) Temporarily ignore specific signals (SIGHUP).\n\n // (2) Daemonize the current process.\n\n // (3) Wait until the detached process is orphaned.\n\n // (4) Restore signal handlers.\n\n let signal_handler = SignalHandler::new(&[SIGHUP])\n\n .mask_all()\n\n .map_err(|e| e.add_subaction(\"Failed to mask signals\".to_string()))?;\n\n let ppid = getpid();\n\n\n\n // Daemonize the current process. The working directory remains\n\n // unchanged and the standard descriptors are routed to '/dev/null'.\n\n daemon(true, false).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to daemonize enclave process: {:?}\", e),\n\n NitroCliErrorEnum::DaemonizeProcessFailure\n\n )\n\n })?;\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":94,"score":136203.09893500863},{"content":"/// Initialize logging.\n\npub fn init_logger() -> NitroCliResult<EnclaveProcLogWriter> {\n\n // The log file is \"nitro-cli.log\" and is stored in the NPE resources directory.\n\n let log_writer = EnclaveProcLogWriter::new()?;\n\n\n\n // Initialize logging with the new log writer.\n\n flexi_logger::Logger::with_env_or_str(DEFAULT_LOG_LEVEL)\n\n .log_target(LogTarget::Writer(Box::new(log_writer.clone())))\n\n .start()\n\n .map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to initialize enclave process logger: {:?}\", e),\n\n NitroCliErrorEnum::LoggerError\n\n )\n\n })?;\n\n\n\n // The log writer is provided for sharing between CLI-related processes.\n\n Ok(log_writer)\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"src/common/logger.rs","rank":95,"score":134003.50277494703},{"content":"/// The internal data type needed for describing an enclave.\n\ntype UnpackedHandle = (u64, u64, u64, Vec<u32>, u64, u64, EnclaveState);\n\n\n\n/// The bit indicating if an enclave has been launched in debug mode.\n\npub const NE_ENCLAVE_DEBUG_MODE: u64 = 0x1;\n\n\n\n/// Constant number used for computing the lower memory limit.\n\nconst ENCLAVE_MEMORY_EIF_SIZE_RATIO: u64 = 4;\n\n\n\n/// Enclave Image Format (EIF) flag.\n\nconst NE_EIF_IMAGE: u64 = 0x01;\n\n\n\n/// Flag indicating a memory region for enclave general usage.\n\nconst NE_DEFAULT_MEMORY_REGION: u64 = 0;\n\n\n\n/// Magic number for Nitro Enclave IOCTL codes.\n\nconst NE_MAGIC: u64 = 0xAE;\n\n\n\n/// Path corresponding to the Nitro Enclaves device file.\n\nconst NE_DEV_FILEPATH: &str = \"/dev/nitro_enclaves\";\n\n\n","file_path":"src/enclave_proc/resource_manager.rs","rank":96,"score":133293.4558794103},{"content":"/// Launch the POSIX signal handler on a dedicated thread and ensure its events are accessible.\n\nfn enclave_proc_configure_signal_handler(conn_listener: &ConnectionListener) -> NitroCliResult<()> {\n\n let mut signal_handler = SignalHandler::new_with_defaults()\n\n .mask_all()\n\n .map_err(|e| e.add_subaction(\"Failed to configure signal handler\".to_string()))?;\n\n let (local_stream, thread_stream) = UnixStream::pair()\n\n .map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Failed to create stream pair: {:?}\", e),\n\n NitroCliErrorEnum::SocketPairCreationFailure\n\n )\n\n .set_action(\"Run Enclave\".to_string())\n\n })\n\n .ok_or_exit_with_errno(Some(\"Failed to create stream pair\"));\n\n\n\n conn_listener\n\n .add_stream_to_epoll(local_stream)\n\n .map_err(|e| {\n\n e.add_subaction(\n\n \"Failed to add stream to epoll when configuring signal handler\".to_string(),\n\n )\n\n })?;\n\n signal_handler.start_handler(thread_stream.into_raw_fd(), enclave_proc_handle_signals);\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"src/enclave_proc/mod.rs","rank":97,"score":132958.43294987327},{"content":"/// Build an enclave image file with the provided arguments.\n\npub fn build_enclaves(args: BuildEnclavesArgs) -> NitroCliResult<()> {\n\n debug!(\"build_enclaves\");\n\n eprintln!(\"Start building the Enclave Image...\");\n\n build_from_docker(\n\n &args.docker_uri,\n\n &args.docker_dir,\n\n &args.output,\n\n &args.signing_certificate,\n\n &args.private_key,\n\n )\n\n .map_err(|e| e.add_subaction(\"Failed to build EIF from docker\".to_string()))?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/lib.rs","rank":98,"score":132705.26185186612},{"content":"/// Build an enclave image file from a Docker image.\n\npub fn build_from_docker(\n\n docker_uri: &str,\n\n docker_dir: &Option<String>,\n\n output_path: &str,\n\n signing_certificate: &Option<String>,\n\n private_key: &Option<String>,\n\n) -> NitroCliResult<(File, BTreeMap<String, String>)> {\n\n let blobs_path =\n\n blobs_path().map_err(|e| e.add_subaction(\"Failed to retrieve blobs path\".to_string()))?;\n\n let cmdline_file_path = format!(\"{}/cmdline\", blobs_path);\n\n let mut cmdline_file = File::open(cmdline_file_path.clone()).map_err(|e| {\n\n new_nitro_cli_failure!(\n\n &format!(\"Could not open kernel command line file: {:?}\", e),\n\n NitroCliErrorEnum::FileOperationFailure\n\n )\n\n .add_info(vec![&cmdline_file_path, \"Open\"])\n\n })?;\n\n\n\n let mut cmdline = String::new();\n\n cmdline_file.read_to_string(&mut cmdline).map_err(|e| {\n","file_path":"src/lib.rs","rank":99,"score":131675.36271220143}],"string":"[\n {\n \"content\": \"pub fn recv_loop(fd: RawFd, buf: &mut [u8], len: u64) -> Result<(), String> {\\n\\n let len: usize = len.try_into().map_err(|err| format!(\\\"{:?}\\\", err))?;\\n\\n let mut recv_bytes = 0;\\n\\n\\n\\n while recv_bytes < len {\\n\\n let size = match recv(fd, &mut buf[recv_bytes..len], MsgFlags::empty()) {\\n\\n Ok(size) => size,\\n\\n Err(nix::Error::Sys(EINTR)) => 0,\\n\\n Err(err) => return Err(format!(\\\"{:?}\\\", err)),\\n\\n };\\n\\n recv_bytes += size;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"samples/command_executer/src/protocol_helpers.rs\",\n \"rank\": 0,\n \"score\": 456102.1243507443\n },\n {\n \"content\": \"pub fn send_loop(fd: RawFd, buf: &[u8], len: u64) -> Result<(), String> {\\n\\n let len: usize = len.try_into().map_err(|err| format!(\\\"{:?}\\\", err))?;\\n\\n let mut send_bytes = 0;\\n\\n\\n\\n while send_bytes < len {\\n\\n let size = match send(fd, &buf[send_bytes..len], MsgFlags::empty()) {\\n\\n Ok(size) => size,\\n\\n Err(nix::Error::Sys(EINTR)) => 0,\\n\\n Err(err) => return Err(format!(\\\"{:?}\\\", err)),\\n\\n };\\n\\n send_bytes += size;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/protocol_helpers.rs\",\n \"rank\": 1,\n \"score\": 445150.83098310913\n },\n {\n \"content\": \"pub fn recv_u64(fd: RawFd) -> Result<u64, String> {\\n\\n let mut buf = [0u8; 9];\\n\\n recv_loop(fd, &mut buf, 9)?;\\n\\n let val = LittleEndian::read_u64(&buf);\\n\\n Ok(val)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/protocol_helpers.rs\",\n \"rank\": 2,\n \"score\": 390323.5686168078\n },\n {\n \"content\": \"pub fn send_u64(fd: RawFd, val: u64) -> Result<(), String> {\\n\\n let mut buf = [0u8; 9];\\n\\n LittleEndian::write_u64(&mut buf, val);\\n\\n send_loop(fd, &mut buf, 9)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/protocol_helpers.rs\",\n \"rank\": 4,\n \"score\": 374686.06376070296\n },\n {\n \"content\": \"/// Read a LE-encoded 64-bit unsigned value from a socket.\\n\\npub fn read_u64_le(socket: &mut dyn Read) -> NitroCliResult<u64> {\\n\\n let mut bytes = [0u8; std::mem::size_of::<u64>()];\\n\\n socket.read_exact(&mut bytes).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\n\\n \\\"Failed to read {} bytes from the given socket: {:?}\\\",\\n\\n std::mem::size_of::<u64>(),\\n\\n e\\n\\n ),\\n\\n NitroCliErrorEnum::SocketError\\n\\n )\\n\\n })?;\\n\\n\\n\\n Ok(u64::from_le_bytes(bytes))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 7,\n \"score\": 349482.77920560504\n },\n {\n \"content\": \"/// Write a LE-encoded 64-bit unsigned value to a socket.\\n\\npub fn write_u64_le(socket: &mut dyn Write, value: u64) -> NitroCliResult<()> {\\n\\n let bytes = value.to_le_bytes();\\n\\n socket.write_all(&bytes).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\n\\n \\\"Failed to write {} bytes to the given socket: {:?}\\\",\\n\\n std::mem::size_of::<u64>(),\\n\\n e\\n\\n ),\\n\\n NitroCliErrorEnum::SocketError\\n\\n )\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 11,\n \"score\": 337240.1688863947\n },\n {\n \"content\": \"fn parse_port(args: &ArgMatches) -> Result<u32, String> {\\n\\n let port = args\\n\\n .value_of(\\\"port\\\")\\n\\n .ok_or(\\\"Could not find port argument\\\")?;\\n\\n port.parse()\\n\\n .map_err(|_err| \\\"port is not a number\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/command_parser.rs\",\n \"rank\": 12,\n \"score\": 321514.9474942394\n },\n {\n \"content\": \"pub fn recv_i32(fd: RawFd) -> Result<i32, String> {\\n\\n let mut buf = [0u8; 4];\\n\\n recv_loop(fd, &mut buf, 4)?;\\n\\n let val = LittleEndian::read_i32(&buf);\\n\\n Ok(val)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/protocol_helpers.rs\",\n \"rank\": 13,\n \"score\": 314959.92352139205\n },\n {\n \"content\": \"/// Obtain an enclave's slot ID from its full ID.\\n\\npub fn get_slot_id(enclave_id: String) -> Result<u64, String> {\\n\\n let tokens: Vec<&str> = enclave_id.split(\\\"-enc\\\").collect();\\n\\n\\n\\n match tokens.get(1) {\\n\\n Some(slot_id) => u64::from_str_radix(*slot_id, 16)\\n\\n .map_err(|_err| \\\"Invalid enclave id format\\\".to_string()),\\n\\n None => Err(\\\"Invalid enclave_id.\\\".to_string()),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_generate_enclave_id() {\\n\\n let slot_id: u64 = 7;\\n\\n let enc_id = generate_enclave_id(slot_id);\\n\\n let file_path = \\\"/sys/devices/virtual/dmi/id/board_asset_tag\\\";\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/utils.rs\",\n \"rank\": 14,\n \"score\": 312612.61564890726\n },\n {\n \"content\": \"/// Get the directory containing Nitro CLI related log files.\\n\\npub fn get_log_file_base_path() -> String {\\n\\n match env::var(LOGS_DIR_PATH_ENV_VAR) {\\n\\n Ok(env_path) => env_path,\\n\\n Err(_) => LOGS_DIR_PATH.to_string(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/logger.rs\",\n \"rank\": 15,\n \"score\": 305114.7756890998\n },\n {\n \"content\": \"pub fn send_i32(fd: RawFd, val: i32) -> Result<(), String> {\\n\\n let mut buf = [0u8; 4];\\n\\n LittleEndian::write_i32(&mut buf, val);\\n\\n send_loop(fd, &mut buf, 4)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/protocol_helpers.rs\",\n \"rank\": 16,\n \"score\": 302530.58571570984\n },\n {\n \"content\": \"fn parse_localfile(args: &ArgMatches) -> Result<String, String> {\\n\\n let output = args\\n\\n .value_of(\\\"localpath\\\")\\n\\n .ok_or(\\\"Could not find localpath\\\")?;\\n\\n Ok(String::from(output))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/command_parser.rs\",\n \"rank\": 17,\n \"score\": 294008.1266718526\n },\n {\n \"content\": \"/// Get the path to the directory containing the Unix sockets owned by all enclave processes.\\n\\npub fn get_sockets_dir_path() -> PathBuf {\\n\\n let log_path = match env::var(SOCKETS_DIR_PATH_ENV_VAR) {\\n\\n Ok(env_path) => env_path,\\n\\n Err(_) => SOCKETS_DIR_PATH.to_string(),\\n\\n };\\n\\n Path::new(&log_path).to_path_buf()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 18,\n \"score\": 291844.26005000225\n },\n {\n \"content\": \"fn parse_cid(args: &ArgMatches) -> Result<u32, String> {\\n\\n let port = args.value_of(\\\"cid\\\").ok_or(\\\"Could not find cid argument\\\")?;\\n\\n port.parse()\\n\\n .map_err(|_err| \\\"cid is not a number\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/command_parser.rs\",\n \"rank\": 19,\n \"score\": 291730.3607781278\n },\n {\n \"content\": \"/// Open a file at a given location for writing and appending.\\n\\nfn open_log_file(file_path: &Path) -> NitroCliResult<File> {\\n\\n let file = OpenOptions::new()\\n\\n .create(true)\\n\\n .append(true)\\n\\n .read(false)\\n\\n .open(file_path)\\n\\n .map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to open log file: {:?}\\\", e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![\\n\\n file_path\\n\\n .to_str()\\n\\n .unwrap_or(\\\"Invalid unicode log file name\\\"),\\n\\n \\\"Open\\\",\\n\\n ])\\n\\n })?;\\n\\n\\n\\n let log_file_uid = Uid::from_raw(\\n\",\n \"file_path\": \"src/common/logger.rs\",\n \"rank\": 20,\n \"score\": 290522.19917322195\n },\n {\n \"content\": \"/// Get the path to the Unix socket owned by an enclave process which also owns the enclave with the given ID.\\n\\npub fn get_socket_path(enclave_id: &str) -> NitroCliResult<PathBuf> {\\n\\n // The full enclave ID is \\\"i-(...)-enc<enc_id>\\\" and we want to extract only <enc_id>.\\n\\n let tokens: Vec<_> = enclave_id.rsplit(\\\"-enc\\\").collect();\\n\\n let sockets_path = get_sockets_dir_path();\\n\\n Ok(sockets_path.join(tokens[0]).with_extension(\\\"sock\\\"))\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n #[allow(unused_imports)]\\n\\n use super::*;\\n\\n\\n\\n use crate::common::commands_parser::EmptyArgs;\\n\\n\\n\\n const TMP_DIR_STR: &str = \\\"./tmp_sock_dir\\\";\\n\\n\\n\\n fn unset_envvar(varname: &String) {\\n\\n let _ = unsafe {\\n\\n libc::unsetenv(varname.as_ptr() as *const i8);\\n\\n };\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 21,\n \"score\": 278296.61879317404\n },\n {\n \"content\": \"fn parse_command(args: &ArgMatches) -> Result<String, String> {\\n\\n let command = args\\n\\n .value_of(\\\"command\\\")\\n\\n .ok_or(\\\"Could not find command argument\\\")?;\\n\\n Ok(String::from(command))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/command_parser.rs\",\n \"rank\": 22,\n \"score\": 270324.7679897451\n },\n {\n \"content\": \"fn parse_remotefile(args: &ArgMatches) -> Result<String, String> {\\n\\n let output = args\\n\\n .value_of(\\\"remotepath\\\")\\n\\n .ok_or(\\\"Could not find remotepath\\\")?;\\n\\n Ok(String::from(output))\\n\\n}\\n\",\n \"file_path\": \"samples/command_executer/src/command_parser.rs\",\n \"rank\": 23,\n \"score\": 264208.377040709\n },\n {\n \"content\": \"/// Get a string representation of the bit-mask which holds the enclave launch flags.\\n\\npub fn flags_to_string(flags: u64) -> String {\\n\\n if flags & NE_ENCLAVE_DEBUG_MODE == NE_ENCLAVE_DEBUG_MODE {\\n\\n \\\"DEBUG_MODE\\\"\\n\\n } else {\\n\\n \\\"NONE\\\"\\n\\n }\\n\\n .to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/utils.rs\",\n \"rank\": 25,\n \"score\": 256821.1862585495\n },\n {\n \"content\": \"/// Receive an object of a specified type from an input stream.\\n\\npub fn receive_from_stream<T>(input_stream: &mut dyn Read) -> NitroCliResult<T>\\n\\nwhere\\n\\n T: DeserializeOwned,\\n\\n{\\n\\n let size = read_u64_le(input_stream)\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to receive data size\\\".to_string()))?\\n\\n as usize;\\n\\n let mut raw_data: Vec<u8> = vec![0; size];\\n\\n input_stream.read_exact(&mut raw_data[..]).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to receive data: {:?}\\\", e),\\n\\n NitroCliErrorEnum::SocketError\\n\\n )\\n\\n })?;\\n\\n let data: T = serde_cbor::from_slice(&raw_data[..]).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to decode received data: {:?}\\\", e),\\n\\n NitroCliErrorEnum::SerdeError\\n\\n )\\n\\n })?;\\n\\n Ok(data)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 26,\n \"score\": 255605.49167782674\n },\n {\n \"content\": \"/// Generate a unique ID for a new enclave with the specified slot ID.\\n\\npub fn generate_enclave_id(slot_id: u64) -> NitroCliResult<String> {\\n\\n let file_path = \\\"/sys/devices/virtual/dmi/id/board_asset_tag\\\";\\n\\n if metadata(file_path).is_ok() {\\n\\n let mut file = File::open(file_path).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to open file: {:?}\\\", e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![file_path, \\\"Open\\\"])\\n\\n })?;\\n\\n let mut contents = String::new();\\n\\n file.read_to_string(&mut contents).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to read from file: {:?}\\\", e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![file_path, \\\"Read\\\"])\\n\\n })?;\\n\\n contents.retain(|c| !c.is_whitespace());\\n\\n return Ok(format!(\\\"{}-enc{:x}\\\", contents, slot_id));\\n\\n }\\n\\n Ok(format!(\\\"i-0000000000000000-enc{:x}\\\", slot_id))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/utils.rs\",\n \"rank\": 28,\n \"score\": 245744.39163337369\n },\n {\n \"content\": \"/// Get the path to the log file.\\n\\nfn get_log_file_path() -> PathBuf {\\n\\n Path::new(&get_log_file_base_path()).join(LOG_FILE_NAME)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/logger.rs\",\n \"rank\": 29,\n \"score\": 243701.76184568394\n },\n {\n \"content\": \"/// Transfers a chunck of maximum 4KB from src to dst\\n\\n/// If no error occurs, returns true if the source disconnects and false otherwise\\n\\nfn transfer(src: &mut dyn Read, dst: &mut dyn Write) -> bool {\\n\\n let mut buffer = [0u8; BUFF_SIZE];\\n\\n\\n\\n let nbytes = src.read(&mut buffer);\\n\\n let nbytes = nbytes.unwrap_or(0);\\n\\n\\n\\n if nbytes == 0 {\\n\\n return true;\\n\\n }\\n\\n\\n\\n dst.write_all(&buffer[..nbytes]).is_err()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use rand;\\n\\n use std::fs;\\n\\n use std::fs::File;\\n\\n use std::io::Write;\\n\\n use std::process::Command;\\n\",\n \"file_path\": \"vsock_proxy/src/starter.rs\",\n \"rank\": 30,\n \"score\": 238601.75498446682\n },\n {\n \"content\": \"fn write_config(config: Vec<String>) -> Result<NamedTempFile, DockerError> {\\n\\n let mut file = NamedTempFile::new().map_err(|_| DockerError::TempfileError)?;\\n\\n\\n\\n for line in config {\\n\\n file.write_fmt(format_args!(\\\"{}\\\\n\\\", line))\\n\\n .map_err(|_| DockerError::TempfileError)?;\\n\\n }\\n\\n\\n\\n Ok(file)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::io::Read;\\n\\n\\n\\n /// Test extracted configuration is as expected\\n\\n #[test]\\n\\n fn test_config() {\\n\\n let docker = DockerUtil::new(String::from(\\n\",\n \"file_path\": \"enclave_build/src/docker.rs\",\n \"rank\": 31,\n \"score\": 223651.1808087624\n },\n {\n \"content\": \"/// Returns detailed error information based on supplied arguments.\\n\\npub fn get_detailed_info(error_code_str: String, additional_info: &[String]) -> String {\\n\\n let mut ret = format!(\\\"[ {} ] \\\", error_code_str);\\n\\n let info_placeholder = \\\"MISSING_INFO\\\".to_string();\\n\\n\\n\\n match error_code_str.as_str() {\\n\\n \\\"E00\\\" => {\\n\\n ret.push_str(\\\"Unspecified error. This is used as a catch-all error and should not be used in the code.\\\");\\n\\n }\\n\\n \\\"E01\\\" => {\\n\\n ret.push_str(\\n\\n format!(\\n\\n \\\"Missing mandatory argument. User did not provide the `{}` argument.\\\",\\n\\n additional_info.get(0).unwrap_or(&info_placeholder)\\n\\n )\\n\\n .as_str(),\\n\\n );\\n\\n }\\n\\n \\\"E02\\\" => {\\n\\n ret.push_str(\\n\\n format!(\\n\",\n \"file_path\": \"src/common/document_errors.rs\",\n \"rank\": 32,\n \"score\": 223649.79785453266\n },\n {\n \"content\": \"/// Parse the enclave image file path from the command-line arguments.\\n\\nfn parse_eif_path(args: &ArgMatches) -> NitroCliResult<String> {\\n\\n let eif_path = args.value_of(\\\"eif-path\\\").ok_or_else(|| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`eif-path` argument not found\\\",\\n\\n NitroCliErrorEnum::MissingArgument\\n\\n )\\n\\n })?;\\n\\n Ok(eif_path.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 33,\n \"score\": 216462.43441406902\n },\n {\n \"content\": \"/// Computes the ceil of `lhs / rhs`. Used for reporting the lower\\n\\n/// limit of enclave memory based on the EIF file size.\\n\\npub fn ceil_div(lhs: u64, rhs: u64) -> u64 {\\n\\n if rhs == 0 {\\n\\n return std::u64::MAX;\\n\\n }\\n\\n\\n\\n lhs / rhs\\n\\n + match lhs % rhs {\\n\\n 0 => 0,\\n\\n _ => 1,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 34,\n \"score\": 215401.6304980404\n },\n {\n \"content\": \"/// Set a timeout on a vsock connection.\\n\\nfn vsock_set_connect_timeout(fd: RawFd, millis: i64) -> NitroCliResult<()> {\\n\\n let timeval = TimeVal::milliseconds(millis);\\n\\n let ret = unsafe {\\n\\n libc::setsockopt(\\n\\n fd as i32,\\n\\n libc::AF_VSOCK,\\n\\n SO_VM_SOCKETS_CONNECT_TIMEOUT,\\n\\n &timeval as *const _ as *const c_void,\\n\\n size_of::<TimeVal>() as u32,\\n\\n )\\n\\n };\\n\\n\\n\\n match ret {\\n\\n 0 => Ok(()),\\n\\n _ => Err(new_nitro_cli_failure!(\\n\\n &format!(\\n\\n \\\"Failed to configure SO_VM_SOCKETS_CONNECT_TIMEOUT: {:?}\\\",\\n\\n ret\\n\\n ),\\n\\n NitroCliErrorEnum::SocketConnectTimeoutError\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 35,\n \"score\": 214504.51179054595\n },\n {\n \"content\": \"fn parse_error_code_str(args: &ArgMatches) -> NitroCliResult<String> {\\n\\n let error_code_str = args.value_of(\\\"error-code\\\").ok_or_else(|| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`error-code` argument not found\\\",\\n\\n NitroCliErrorEnum::MissingArgument\\n\\n )\\n\\n })?;\\n\\n Ok(error_code_str.to_string())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n use crate::common::construct_error_message;\\n\\n use crate::create_app;\\n\\n\\n\\n use clap::{App, AppSettings, Arg, SubCommand};\\n\\n\\n\\n /// Parse the path of the JSON config file\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 36,\n \"score\": 211812.37595081294\n },\n {\n \"content\": \"fn parse_no_wait(args: &ArgMatches) -> bool {\\n\\n if args.is_present(\\\"no-wait\\\") {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/command_executer/src/command_parser.rs\",\n \"rank\": 37,\n \"score\": 211104.9929373604\n },\n {\n \"content\": \"pub trait ExitGracefully<T, E> {\\n\\n fn ok_or_exit(self, message: &str) -> T;\\n\\n}\\n\\n\\n\\nimpl<T, E: std::fmt::Debug> ExitGracefully<T, E> for Result<T, E> {\\n\\n fn ok_or_exit(self, message: &str) -> T {\\n\\n match self {\\n\\n Ok(val) => val,\\n\\n Err(err) => {\\n\\n error!(\\\"{:?}: {}\\\", err, message);\\n\\n std::process::exit(1);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! create_app {\\n\\n () => {\\n\\n App::new(\\\"Vsock Tool\\\")\\n\",\n \"file_path\": \"samples/command_executer/src/utils.rs\",\n \"rank\": 39,\n \"score\": 210145.411365818\n },\n {\n \"content\": \"fn vsock_connect(port: u32) -> VsockStream {\\n\\n let sockaddr = SockAddr::new_vsock(vsock_proxy::starter::VSOCK_PROXY_CID, port);\\n\\n VsockStream::connect(&sockaddr).expect(\\\"Could not connect\\\")\\n\\n}\\n\\n\\n\\n/// Test connection with both client and server sending each other messages\\n\",\n \"file_path\": \"vsock_proxy/tests/connection_test.rs\",\n \"rank\": 40,\n \"score\": 206599.2234807593\n },\n {\n \"content\": \"/// Get the action associated with `cmd` as a String.\\n\\nfn get_command_action(cmd: EnclaveProcessCommandType) -> String {\\n\\n match cmd {\\n\\n EnclaveProcessCommandType::Run => \\\"Run Enclave\\\".to_string(),\\n\\n EnclaveProcessCommandType::Terminate | EnclaveProcessCommandType::TerminateComplete => {\\n\\n \\\"Terminate Enclave\\\".to_string()\\n\\n }\\n\\n EnclaveProcessCommandType::Describe => \\\"Describe Enclaves\\\".to_string(),\\n\\n EnclaveProcessCommandType::GetEnclaveCID => \\\"Get Enclave CID\\\".to_string(),\\n\\n EnclaveProcessCommandType::GetEnclaveFlags => \\\"Get Enclave Flags\\\".to_string(),\\n\\n EnclaveProcessCommandType::ConnectionListenerStop => \\\"Stop Connection Listener\\\".to_string(),\\n\\n _ => \\\"Unknown Command\\\".to_string(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 41,\n \"score\": 206117.48345520865\n },\n {\n \"content\": \"/// Notify both the user and the logger of an error.\\n\\npub fn notify_error(err_msg: &str) {\\n\\n eprintln!(\\\"{}\\\", err_msg);\\n\\n error!(\\\"{}\\\", err_msg);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 42,\n \"score\": 202411.94333331526\n },\n {\n \"content\": \"/// Returns a link with more detailed information regarding a specific error.\\n\\npub fn construct_help_link(error_code_str: String) -> String {\\n\\n format!(\\n\\n \\\"https://docs.aws.amazon.com/enclaves/latest/user/cli-errors.html#{}\\\",\\n\\n error_code_str\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/document_errors.rs\",\n \"rank\": 43,\n \"score\": 202147.8855068369\n },\n {\n \"content\": \"/// Parse the path of an output file from the command-line arguments.\\n\\nfn parse_output(args: &ArgMatches) -> Option<String> {\\n\\n args.value_of(\\\"output-file\\\").map(|val| val.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 44,\n \"score\": 199975.10828951874\n },\n {\n \"content\": \"/// Logs the given backtrace string to a separate, backtrace-specific file.\\n\\n/// Returns a string denoting the path to the corresponding log file.\\n\\nfn log_backtrace(backtrace: String) -> Result<String, &'static str> {\\n\\n let log_path_base = get_log_file_base_path();\\n\\n\\n\\n // Check if backtrace logs location exists and create it if necessary.\\n\\n if !Path::new(&log_path_base).exists() {\\n\\n let create_logs_dir = std::fs::create_dir_all(&log_path_base);\\n\\n if create_logs_dir.is_err() {\\n\\n return Err(\\\"Could not create backtrace logs directory\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n let utc_time_now = Utc::now().to_rfc3339();\\n\\n let log_path_str = format!(\\\"{}/err{}.log\\\", &log_path_base, utc_time_now);\\n\\n let log_path = Path::new(&log_path_str);\\n\\n let log_file = std::fs::File::create(log_path);\\n\\n if log_file.is_err() {\\n\\n return Err(\\\"Could not create backtrace log file\\\");\\n\\n }\\n\\n\\n\\n let write_result = log_file.unwrap().write_all(&backtrace.as_bytes());\\n\\n if write_result.is_err() {\\n\\n return Err(\\\"Could not write to backtrace log file\\\");\\n\\n }\\n\\n\\n\\n match log_path.to_str() {\\n\\n Some(log_path) => Ok(log_path.to_string()),\\n\\n None => Err(\\\"Could not return log file path\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 45,\n \"score\": 199689.47802320786\n },\n {\n \"content\": \"/// Obtain an enclave's CID given its full ID.\\n\\npub fn enclave_proc_get_cid(enclave_id: &str) -> NitroCliResult<u64> {\\n\\n let mut comm = enclave_proc_connect_to_single(enclave_id)\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to connect to enclave process\\\".to_string()))?;\\n\\n // TODO: Replicate output of old CLI on invalid enclave IDs.\\n\\n enclave_proc_command_send_single::<EmptyArgs>(\\n\\n EnclaveProcessCommandType::GetEnclaveCID,\\n\\n None,\\n\\n &mut comm,\\n\\n )\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to send CID request to enclave process\\\".to_string()))?;\\n\\n\\n\\n info!(\\\"Sent command: GetEnclaveCID\\\");\\n\\n let enclave_cid = read_u64_le(&mut comm)\\n\\n .map_err(|e| e.add_subaction(String::from(\\\"Failed to read CID from enclave process\\\")))?;\\n\\n\\n\\n // We got the CID, so shut the connection down.\\n\\n comm.shutdown(std::net::Shutdown::Both).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\n\\n \\\"Failed to shut down connection after obtaining enclave CID: {:?}\\\",\\n\\n e\\n\\n ),\\n\\n NitroCliErrorEnum::SocketError\\n\\n )\\n\\n })?;\\n\\n\\n\\n Ok(enclave_cid)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 46,\n \"score\": 194958.5113902629\n },\n {\n \"content\": \"/// Obtain an enclave's flags given its full ID.\\n\\npub fn enclave_proc_get_flags(enclave_id: &str) -> NitroCliResult<u64> {\\n\\n let mut comm = enclave_proc_connect_to_single(enclave_id)\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to connect to enclave process\\\".to_string()))?;\\n\\n // TODO: Replicate output of old CLI on invalid enclave IDs.\\n\\n enclave_proc_command_send_single::<EmptyArgs>(\\n\\n EnclaveProcessCommandType::GetEnclaveFlags,\\n\\n None,\\n\\n &mut comm,\\n\\n )\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to send flags request to enclave process\\\".to_string()))?;\\n\\n\\n\\n info!(\\\"Sent command: GetEnclaveFlags\\\");\\n\\n let enclave_flags = read_u64_le(&mut comm)\\n\\n .map_err(|e| e.add_subaction(String::from(\\\"Failed to read flags from enclave process\\\")))?;\\n\\n\\n\\n // We got the flags, so shut the connection down.\\n\\n comm.shutdown(std::net::Shutdown::Both).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\n\\n \\\"Failed to shut down connection after obtaining enclave flags: {:?}\\\",\\n\\n e\\n\\n ),\\n\\n NitroCliErrorEnum::SocketError\\n\\n )\\n\\n })?;\\n\\n\\n\\n Ok(enclave_flags)\\n\\n}\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 47,\n \"score\": 194958.5113902629\n },\n {\n \"content\": \"/// Detailed information based on user-provided error code.\\n\\npub fn explain_error(error_code_str: String) {\\n\\n match error_code_str.as_str() {\\n\\n \\\"E00\\\" => {\\n\\n eprintln!(\\\"Unspecified error. This is used as a catch-all error and should not be used in the code.\\\");\\n\\n }\\n\\n \\\"E01\\\" => {\\n\\n eprintln!(\\\"Missing mandatory argument. Such error appears when the Nitro CLI is requested to perform an operation, but not all of the mandatory arguments were supplied.\\\\n\\\\tExample: `nitro-cli run-enclave --cpu-count 2 --eif-path /path/to/my/eif`. Note that in this case, the mandatory parameter `--memory` is missing a value.\\\");\\n\\n }\\n\\n \\\"E02\\\" => {\\n\\n eprintln!(\\\"CLI conflicting arguments. Such error appears when the Nitro CLI is supplied two contradicting arguments at the same time, such as `--cpu-count` and `--cpu-ids`.\\\\nIn this case, only one of the parameters should be supplied.\\\");\\n\\n }\\n\\n \\\"E03\\\" => {\\n\\n eprintln!(\\\"Invalid argument provided. Such error appears when the type of at least one of the arguments provided to the Nitro CLI does not match the expected type of that parameter.\\\\n\\\\tExample: `nitro-cli run-enclave --cpu-count 1z --memory 80 --eif-path /path/to/my/eif`. In this case, `cpu-count` is not a valid integer value.\\\" );\\n\\n }\\n\\n \\\"E04\\\" => {\\n\\n eprintln!(\\\"Socket pair creation failure. Such error apears when the Nitro CLI process attempts to open a stream pair in order to send a command to the enclave process, but the stream initialization fails.\\\");\\n\\n }\\n\\n \\\"E05\\\" => {\\n\\n eprintln!(\\\"Process spawn failure. Such error appears when the main Nitro CLI process failed to spawn the enclave process, in order to complete a `run-enclave` command.\\\");\\n\\n }\\n\",\n \"file_path\": \"src/common/document_errors.rs\",\n \"rank\": 48,\n \"score\": 193970.88513532546\n },\n {\n \"content\": \"/// Parse the requested amount of enclave memory from the command-line arguments.\\n\\nfn parse_memory(args: &ArgMatches) -> NitroCliResult<u64> {\\n\\n let memory = args.value_of(\\\"memory\\\").ok_or_else(|| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`memory` argument not found\\\",\\n\\n NitroCliErrorEnum::MissingArgument\\n\\n )\\n\\n })?;\\n\\n memory.parse().map_err(|_| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`memory` is not a number\\\",\\n\\n NitroCliErrorEnum::InvalidArgument\\n\\n )\\n\\n .add_info(vec![\\\"memory\\\", memory])\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 49,\n \"score\": 191218.07820984133\n },\n {\n \"content\": \"/// Obtain the enclave information requested by the `describe-enclaves` command.\\n\\npub fn get_enclave_describe_info(\\n\\n enclave_manager: &EnclaveManager,\\n\\n) -> NitroCliResult<EnclaveDescribeInfo> {\\n\\n let (slot_uid, enclave_cid, cpus_count, cpu_ids, memory_mib, flags, state) =\\n\\n enclave_manager.get_description_resources()?;\\n\\n let info = EnclaveDescribeInfo::new(\\n\\n generate_enclave_id(slot_uid)?,\\n\\n enclave_cid,\\n\\n cpus_count,\\n\\n cpu_ids,\\n\\n memory_mib,\\n\\n state.to_string(),\\n\\n flags_to_string(flags),\\n\\n );\\n\\n Ok(info)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/utils.rs\",\n \"rank\": 50,\n \"score\": 190436.16568337823\n },\n {\n \"content\": \"/// Obtain the enclave information requested by the `run-enclaves` command.\\n\\npub fn get_run_enclaves_info(\\n\\n enclave_cid: u64,\\n\\n slot_id: u64,\\n\\n cpu_ids: Vec<u32>,\\n\\n memory: u64,\\n\\n) -> NitroCliResult<EnclaveRunInfo> {\\n\\n let info = EnclaveRunInfo::new(\\n\\n generate_enclave_id(slot_id)?,\\n\\n enclave_cid,\\n\\n cpu_ids.len(),\\n\\n cpu_ids,\\n\\n memory,\\n\\n );\\n\\n Ok(info)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/utils.rs\",\n \"rank\": 51,\n \"score\": 190436.16568337823\n },\n {\n \"content\": \"/// Returns the value of the `NITRO_CLI_ARTIFACTS` environment variable.\\n\\n///\\n\\n/// This variable configures the path where the build artifacts should be saved.\\n\\nfn artifacts_path() -> NitroCliResult<String> {\\n\\n if let Ok(artifacts) = std::env::var(\\\"NITRO_CLI_ARTIFACTS\\\") {\\n\\n std::fs::create_dir_all(artifacts.clone()).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Could not create artifacts path {}: {:?}\\\", artifacts, e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![&artifacts, \\\"Create\\\"])\\n\\n })?;\\n\\n Ok(artifacts)\\n\\n } else if let Ok(home) = std::env::var(\\\"HOME\\\") {\\n\\n let artifacts = format!(\\\"{}/.nitro_cli/\\\", home);\\n\\n std::fs::create_dir_all(artifacts.clone()).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Could not create artifacts path {}: {:?}\\\", artifacts, e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![&artifacts, \\\"Create\\\"])\\n\\n })?;\\n\\n Ok(artifacts)\\n\\n } else {\\n\\n Err(new_nitro_cli_failure!(\\n\\n \\\"Could not find a folder for the CLI artifacts, set either HOME or NITRO_CLI_ARTIFACTS\\\",\\n\\n NitroCliErrorEnum::ArtifactsPathNotSet\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 52,\n \"score\": 189192.02763545213\n },\n {\n \"content\": \"/// Returns the value of the `NITRO_CLI_BLOBS` environment variable.\\n\\n///\\n\\n/// This variable specifies where all the blobs necessary for building\\n\\n/// an enclave image are stored. As of now the blobs are:\\n\\n/// - *bzImage*: A kernel image.\\n\\n/// - *init*: The initial init process that is bootstraping the environment.\\n\\n/// - *linuxkit*: A slightly modified version of linuxkit.\\n\\n/// - *cmdline*: A file containing the kernel commandline.\\n\\nfn blobs_path() -> NitroCliResult<String> {\\n\\n // TODO Improve error message with a suggestion to the user\\n\\n // consider using the default path used by rpm install\\n\\n let blobs_res = std::env::var(\\\"NITRO_CLI_BLOBS\\\");\\n\\n\\n\\n Ok(blobs_res.unwrap_or_else(|_| DEFAULT_BLOBS_PATH.to_string()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 53,\n \"score\": 189188.95472537228\n },\n {\n \"content\": \"/// Connects to the enclave console and prints it continously.\\n\\npub fn enclave_console(enclave_cid: u64) -> NitroCliResult<()> {\\n\\n let console = Console::new(\\n\\n VMADDR_CID_HYPERVISOR,\\n\\n u32::try_from(enclave_cid).map_err(|err| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to parse enclave CID: {:?}\\\", err),\\n\\n NitroCliErrorEnum::IntegerParsingError\\n\\n )\\n\\n })? + CID_TO_CONSOLE_PORT_OFFSET,\\n\\n )\\n\\n .map_err(|e| e.add_subaction(\\\"Connect to enclave console\\\".to_string()))?;\\n\\n println!(\\\"Successfully connected to the console.\\\");\\n\\n console\\n\\n .read_to(io::stdout().by_ref())\\n\\n .map_err(|e| e.add_subaction(\\\"Connect to enclave console\\\".to_string()))?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 54,\n \"score\": 188229.86357751844\n },\n {\n \"content\": \"/// Wrapper over the console connection function.\\n\\npub fn console_enclaves(enclave_cid: u64) -> NitroCliResult<()> {\\n\\n debug!(\\\"console_enclaves\\\");\\n\\n println!(\\\"Connecting to the console for enclave {}...\\\", enclave_cid);\\n\\n enclave_console(enclave_cid)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 55,\n \"score\": 188225.23326100764\n },\n {\n \"content\": \"/// Send the given command, then close the channel that was used for sending it.\\n\\nfn send_command_and_close(cmd: EnclaveProcessCommandType, stream: &mut UnixStream) {\\n\\n let action_str = &get_command_action(cmd);\\n\\n\\n\\n enclave_proc_command_send_single::<EmptyArgs>(cmd, None, stream)\\n\\n .ok_or_exit_with_errno(Some(\\\"Failed to send command\\\"));\\n\\n stream\\n\\n .shutdown(std::net::Shutdown::Both)\\n\\n .map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to close stream after sending command: {:?}\\\", e),\\n\\n NitroCliErrorEnum::SocketCloseError\\n\\n )\\n\\n .set_action(action_str.to_string())\\n\\n })\\n\\n .ok_or_exit_with_errno(Some(\\\"Failed to shut down stream\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 56,\n \"score\": 187923.6834556615\n },\n {\n \"content\": \"/// Parse the enclave's ID from the command-line arguments.\\n\\nfn parse_enclave_id(args: &ArgMatches) -> NitroCliResult<String> {\\n\\n let enclave_id = args.value_of(\\\"enclave-id\\\").ok_or_else(|| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`enclave-id` argument not found\\\",\\n\\n NitroCliErrorEnum::MissingArgument\\n\\n )\\n\\n })?;\\n\\n Ok(enclave_id.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 57,\n \"score\": 186703.15246554997\n },\n {\n \"content\": \"/// Assembles the error message which gets displayed to the user.\\n\\npub fn construct_error_message(failure: &NitroCliFailure) -> String {\\n\\n // Suggestive error description comes first.\\n\\n let error_info: String = document_errors::get_detailed_info(\\n\\n (*ERROR_CODES.get(&failure.error_code).unwrap_or(&\\\"E00\\\")).to_string(),\\n\\n &failure.additional_info,\\n\\n );\\n\\n\\n\\n // Include a link to the documentation page.\\n\\n let help_link: String = document_errors::construct_help_link(\\n\\n (*ERROR_CODES.get(&failure.error_code).unwrap_or(&\\\"E00\\\")).to_string(),\\n\\n );\\n\\n let backtrace: String = document_errors::construct_backtrace(&failure);\\n\\n\\n\\n // Write backtrace to a log file.\\n\\n let log_path = log_backtrace(backtrace.clone());\\n\\n\\n\\n // Return final output, depending on whether the user requested the backtrace or not.\\n\\n match std::env::var(BACKTRACE_VAR) {\\n\\n Ok(display_backtrace) => match display_backtrace.as_str() {\\n\\n \\\"1\\\" => {\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 58,\n \"score\": 184099.7492710174\n },\n {\n \"content\": \"/// Print a message to a connection's standard output, if the connection is available.\\n\\npub fn safe_conn_println(conn: Option<&Connection>, msg: &str) -> NitroCliResult<()> {\\n\\n if conn.is_none() {\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n conn.unwrap().println(msg)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/connection.rs\",\n \"rank\": 59,\n \"score\": 182576.37163121035\n },\n {\n \"content\": \"/// The default POSIX signal handling function, which notifies the enclave process to shut down gracefully.\\n\\nfn enclave_proc_handle_signals(comm_fd: RawFd, signal: Signal) -> bool {\\n\\n let mut stream = unsafe { UnixStream::from_raw_fd(comm_fd) };\\n\\n\\n\\n warn!(\\n\\n \\\"Received signal {:?}. The enclave process will now close.\\\",\\n\\n signal\\n\\n );\\n\\n send_command_and_close(\\n\\n EnclaveProcessCommandType::ConnectionListenerStop,\\n\\n &mut stream,\\n\\n );\\n\\n\\n\\n true\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 60,\n \"score\": 182203.23211186967\n },\n {\n \"content\": \"/// Parse the requested number of CPUs from the command-line arguments.\\n\\nfn parse_cpu_count(args: &ArgMatches) -> NitroCliResult<Option<u32>> {\\n\\n let cpu_count = if let Some(cpu_count) = args.value_of(\\\"cpu-count\\\") {\\n\\n let cpu_count: u32 = cpu_count.parse().map_err(|_| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`cpu-count` is not a number\\\",\\n\\n NitroCliErrorEnum::InvalidArgument\\n\\n )\\n\\n .add_info(vec![\\\"cpu-count\\\", cpu_count])\\n\\n })?;\\n\\n Some(cpu_count)\\n\\n } else {\\n\\n None\\n\\n };\\n\\n Ok(cpu_count)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 61,\n \"score\": 180083.07049423349\n },\n {\n \"content\": \"/// Parse the enclave's required CID from the command-line arguments.\\n\\nfn parse_enclave_cid(args: &ArgMatches) -> NitroCliResult<Option<u64>> {\\n\\n let enclave_cid = if let Some(enclave_cid) = args.value_of(\\\"enclave-cid\\\") {\\n\\n let enclave_cid: u64 = enclave_cid.parse().map_err(|_| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`enclave-cid` is not a number\\\",\\n\\n NitroCliErrorEnum::InvalidArgument\\n\\n )\\n\\n .add_info(vec![\\\"enclave-cid\\\", enclave_cid])\\n\\n })?;\\n\\n\\n\\n // Do not use well-known CID values - 0, 1, 2 - as the enclave CID.\\n\\n // VMADDR_CID_ANY = -1U\\n\\n // VMADDR_CID_HYPERVISOR = 0\\n\\n // VMADDR_CID_LOCAL = 1\\n\\n // VMADDR_CID_HOST = 2\\n\\n // Note: 0 is used as a placeholder to auto-generate a CID.\\n\\n // <http://man7.org/linux/man-pages/man7/vsock.7.html>\\n\\n if enclave_cid == 0 {\\n\\n eprintln!(\\\"The enclave CID will be auto-generated as the provided CID is 0\\\");\\n\\n }\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 62,\n \"score\": 179940.22117352605\n },\n {\n \"content\": \"/// Send a command to a single socket.\\n\\npub fn enclave_proc_command_send_single<T>(\\n\\n cmd: EnclaveProcessCommandType,\\n\\n args: Option<&T>,\\n\\n mut socket: &mut UnixStream,\\n\\n) -> NitroCliResult<()>\\n\\nwhere\\n\\n T: Serialize,\\n\\n{\\n\\n // Serialize the command type.\\n\\n let cmd_bytes = serde_cbor::to_vec(&cmd).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Invalid command format: {:?}\\\", e),\\n\\n NitroCliErrorEnum::InvalidCommand\\n\\n )\\n\\n })?;\\n\\n\\n\\n // The command is written twice. The first read is done by the connection listener to check if this is\\n\\n // a shut-down command. The second read is done by the enclave process for all non-shut-down commands.\\n\\n for _ in 0..2 {\\n\\n write_u64_le(&mut socket, cmd_bytes.len() as u64)\\n\",\n \"file_path\": \"src/common/mod.rs\",\n \"rank\": 63,\n \"score\": 179723.41636068115\n },\n {\n \"content\": \"/// Parse the list of requested CPU IDs from the command-line arguments.\\n\\nfn parse_cpu_ids(args: &ArgMatches) -> NitroCliResult<Option<Vec<u32>>> {\\n\\n let cpu_ids_arg = args.values_of(\\\"cpu-ids\\\");\\n\\n match cpu_ids_arg {\\n\\n Some(iterator) => {\\n\\n let mut cpu_ids = Vec::new();\\n\\n for cpu_id in iterator {\\n\\n cpu_ids.push(cpu_id.parse().map_err(|_| {\\n\\n new_nitro_cli_failure!(\\n\\n \\\"`cpu-id` is not a number\\\",\\n\\n NitroCliErrorEnum::InvalidArgument\\n\\n )\\n\\n .add_info(vec![\\\"cpu-id\\\", cpu_id])\\n\\n })?);\\n\\n }\\n\\n Ok(Some(cpu_ids))\\n\\n }\\n\\n None => Ok(None),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 65,\n \"score\": 173600.94557532776\n },\n {\n \"content\": \"/// Obtain the logger ID from the full enclave ID.\\n\\nfn get_logger_id(enclave_id: &str) -> String {\\n\\n // The full enclave ID is \\\"i-(...)-enc<enc_id>\\\" and we want to extract only <enc_id>.\\n\\n let tokens: Vec<_> = enclave_id.rsplit(\\\"-enc\\\").collect();\\n\\n format!(\\\"enc-{}:{}\\\", tokens[0], std::process::id())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 66,\n \"score\": 171866.5851447145\n },\n {\n \"content\": \"// Generate the sysroot path based on the architecture the program is built.\\n\\n// This is needed for the compiler to locate the architecture dependent\\n\\n// header files.\\n\\nfn get_gcc_sysroot() -> String {\\n\\n // Initialize the output because it might remain uninitialized with the\\n\\n // current control flow\\n\\n let mut output = Err(io::Error::from(io::ErrorKind::NotFound));\\n\\n\\n\\n // Use the `CC` environment variable if existing\\n\\n // which should give us directly the compiler's name\\n\\n let cc = env::var(\\\"CC\\\");\\n\\n if let Ok(cc) = cc {\\n\\n output = Command::new(cc).arg(\\\"--print-sysroot\\\").output();\\n\\n }\\n\\n\\n\\n if output.is_err() {\\n\\n // Otherwise, try to guess the compiler's name by the name\\n\\n // $TARGET-gcc, where $TARGET represents the target architecture\\n\\n // that was specified for build\\n\\n let target = env::var(\\\"TARGET\\\").unwrap();\\n\\n output = Command::new(format!(\\\"{}-gcc\\\", target))\\n\\n .arg(\\\"--print-sysroot\\\")\\n\\n .output();\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 67,\n \"score\": 171210.34214012095\n },\n {\n \"content\": \"/// Notify that an error has occurred, also forwarding the error message to a connection.\\n\\nfn notify_error_with_conn(err_msg: &str, conn: &Connection, action: EnclaveProcessCommandType) {\\n\\n let action_str = &get_command_action(action);\\n\\n\\n\\n notify_error(err_msg);\\n\\n conn.eprintln(err_msg)\\n\\n .map_err(|e| e.set_action(action_str.to_string()))\\n\\n .ok_or_exit_with_errno(Some(\\\"Failed to forward error message to connection\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 68,\n \"score\": 169920.20575970813\n },\n {\n \"content\": \"/// Parse the debug-mode flag from the command-line arguments.\\n\\nfn debug_mode(args: &ArgMatches) -> Option<bool> {\\n\\n let val = args.is_present(\\\"debug-mode\\\");\\n\\n if val {\\n\\n Some(val)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 69,\n \"score\": 168185.5179805259\n },\n {\n \"content\": \"/// Parse the Docker tag from the command-line arguments.\\n\\nfn parse_docker_tag(args: &ArgMatches) -> Option<String> {\\n\\n args.value_of(\\\"docker-uri\\\").map(|val| val.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 70,\n \"score\": 163904.774072956\n },\n {\n \"content\": \"/// Parse the Docker directory from the command-line arguments.\\n\\nfn parse_docker_dir(args: &ArgMatches) -> Option<String> {\\n\\n args.value_of(\\\"docker-dir\\\").map(|val| val.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 71,\n \"score\": 163904.774072956\n },\n {\n \"content\": \"fn parse_signing_certificate(args: &ArgMatches) -> Option<String> {\\n\\n args.value_of(\\\"signing-certificate\\\")\\n\\n .map(|val| val.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 72,\n \"score\": 163900.29502817985\n },\n {\n \"content\": \"fn parse_private_key(args: &ArgMatches) -> Option<String> {\\n\\n args.value_of(\\\"private-key\\\").map(|val| val.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/commands_parser.rs\",\n \"rank\": 73,\n \"score\": 163900.29502817985\n },\n {\n \"content\": \"/// Obtain an enclave's description and provide it through the given connection.\\n\\npub fn describe_enclaves(\\n\\n enclave_manager: &EnclaveManager,\\n\\n connection: &Connection,\\n\\n) -> NitroCliResult<()> {\\n\\n debug!(\\\"describe_enclaves\\\");\\n\\n\\n\\n let info = get_enclave_describe_info(enclave_manager)\\n\\n .map_err(|e| e.add_subaction(String::from(\\\"Execute Describe Enclave command\\\")))?;\\n\\n connection.println(\\n\\n serde_json::to_string_pretty(&info)\\n\\n .map_err(|err| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to display enclave describe data: {:?}\\\", err),\\n\\n NitroCliErrorEnum::SerdeError\\n\\n )\\n\\n })?\\n\\n .as_str(),\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"src/enclave_proc/commands.rs\",\n \"rank\": 74,\n \"score\": 162457.18201980533\n },\n {\n \"content\": \"/// Terminate an enclave and provide the termination status through the given connection.\\n\\npub fn terminate_enclaves(\\n\\n enclave_manager: &mut EnclaveManager,\\n\\n connection: Option<&Connection>,\\n\\n) -> NitroCliResult<()> {\\n\\n let enclave_id = enclave_manager.enclave_id.clone();\\n\\n\\n\\n debug!(\\\"terminate_enclaves\\\");\\n\\n enclave_manager\\n\\n .update_state(EnclaveState::Terminating)\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to update enclave state\\\".to_string()))?;\\n\\n if let Err(error_info) = enclave_manager.terminate_enclave() {\\n\\n safe_conn_eprintln(\\n\\n connection,\\n\\n format!(\\n\\n \\\"Warning: Failed to stop enclave {}\\\\nError message: {:?}\\\",\\n\\n enclave_manager.enclave_id,\\n\\n construct_error_message(&error_info).as_str()\\n\\n )\\n\\n .as_str(),\\n\\n )?;\\n\",\n \"file_path\": \"src/enclave_proc/commands.rs\",\n \"rank\": 75,\n \"score\": 162457.1173388776\n },\n {\n \"content\": \"/// Launch an enclave with the specified arguments and provide the launch status through the given connection.\\n\\npub fn run_enclaves(\\n\\n args: &RunEnclavesArgs,\\n\\n connection: Option<&Connection>,\\n\\n) -> NitroCliResult<EnclaveManager> {\\n\\n debug!(\\\"run_enclaves\\\");\\n\\n\\n\\n let eif_file = File::open(&args.eif_path).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to open the EIF file: {:?}\\\", e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![&args.eif_path, \\\"Open\\\"])\\n\\n })?;\\n\\n\\n\\n let cpu_ids = CpuInfo::new()\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to construct CPU information\\\".to_string()))?\\n\\n .get_cpu_config(args)\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to get CPU configuration\\\".to_string()))?;\\n\\n let mut enclave_manager = EnclaveManager::new(\\n\\n args.enclave_cid,\\n\",\n \"file_path\": \"src/enclave_proc/commands.rs\",\n \"rank\": 76,\n \"score\": 162456.99339108064\n },\n {\n \"content\": \"/// Connect to all existing enclave processes, returning a connection to each.\\n\\npub fn enclave_proc_connect_to_all() -> NitroCliResult<Vec<UnixStream>> {\\n\\n let paths = fs::read_dir(get_sockets_dir_path()).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to access sockets directory: {:?}\\\", e),\\n\\n NitroCliErrorEnum::ReadFromDiskFailure\\n\\n )\\n\\n })?;\\n\\n Ok(paths\\n\\n .filter_map(|path| path.ok())\\n\\n .map(|path| path.path())\\n\\n .filter(|path| !path.is_dir())\\n\\n .filter_map(|path| {\\n\\n // Get the file path string.\\n\\n if let Some(path_str) = path.to_str() {\\n\\n // Enclave process sockets are named \\\"<enclave_id>.sock\\\".\\n\\n if !path_str.ends_with(\\\".sock\\\") {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // At this point we have found a potential socket.\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 77,\n \"score\": 157136.61555515556\n },\n {\n \"content\": \"/// Print a message to a connection's standard error, if the connection is available.\\n\\npub fn safe_conn_eprintln(conn: Option<&Connection>, msg: &str) -> NitroCliResult<()> {\\n\\n if conn.is_none() {\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n conn.unwrap().eprintln(msg)\\n\\n}\\n\",\n \"file_path\": \"src/enclave_proc/connection.rs\",\n \"rank\": 78,\n \"score\": 154302.520015678\n },\n {\n \"content\": \"/// Terminates all enclave instances belonging to the current user (or all\\n\\n/// instances, if the current user has `root` permissions).\\n\\npub fn terminate_all_enclaves() -> NitroCliResult<()> {\\n\\n let sockets_dir = get_sockets_dir_path();\\n\\n let mut replies: Vec<UnixStream> = vec![];\\n\\n let sockets = std::fs::read_dir(sockets_dir.as_path()).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Error while accessing sockets directory: {:?}\\\", e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![\\n\\n sockets_dir\\n\\n .as_path()\\n\\n .to_str()\\n\\n .unwrap_or(\\\"Invalid unicode directory name\\\"),\\n\\n \\\"Read\\\",\\n\\n ])\\n\\n })?;\\n\\n\\n\\n let mut err_socket_files: usize = 0;\\n\\n let mut failed_connections: Vec<PathBuf> = Vec::new();\\n\\n for socket in sockets {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 79,\n \"score\": 153442.62248582617\n },\n {\n \"content\": \"/// Fetch JSON objects and statuses from all connected enclave processes.\\n\\npub fn enclave_proc_handle_outputs<T>(conns: &mut [UnixStream]) -> Vec<(T, i32)>\\n\\nwhere\\n\\n T: DeserializeOwned,\\n\\n{\\n\\n let mut objects: Vec<(T, i32)> = Vec::new();\\n\\n\\n\\n for conn in conns.iter_mut() {\\n\\n // We only count connections that have yielded a valid JSON object and a status\\n\\n let (object, status) = enclave_proc_handle_output::<T>(conn);\\n\\n if let Some(object) = object {\\n\\n if let Some(status) = status {\\n\\n objects.push((object, status));\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n objects\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 80,\n \"score\": 153375.00721340787\n },\n {\n \"content\": \"/// Returns a string containing the backtrace recorded during propagating an error message\\n\\npub fn construct_backtrace(failure_info: &NitroCliFailure) -> String {\\n\\n let mut ret = String::new();\\n\\n let commit_id = env!(\\\"COMMIT_ID\\\");\\n\\n\\n\\n ret.push_str(&format!(\\\" Action: {}\\\\n Subactions:\\\", failure_info.action));\\n\\n for subaction in failure_info.subactions.iter().rev() {\\n\\n ret.push_str(&format!(\\\"\\\\n {}\\\", subaction));\\n\\n }\\n\\n ret.push_str(&format!(\\\"\\\\n Root error file: {}\\\", failure_info.file));\\n\\n ret.push_str(&format!(\\\"\\\\n Root error line: {}\\\", failure_info.line));\\n\\n\\n\\n ret.push_str(&format!(\\n\\n \\\"\\\\n Build commit: {}\\\",\\n\\n match commit_id.len() {\\n\\n 0 => \\\"not available\\\",\\n\\n _ => commit_id,\\n\\n }\\n\\n ));\\n\\n\\n\\n ret\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/common/document_errors.rs\",\n \"rank\": 81,\n \"score\": 150303.09045517482\n },\n {\n \"content\": \"/// Broadcast a command to all available enclave processes.\\n\\npub fn enclave_proc_command_send_all<T>(\\n\\n cmd: EnclaveProcessCommandType,\\n\\n args: Option<&T>,\\n\\n) -> NitroCliResult<(Vec<UnixStream>, usize)>\\n\\nwhere\\n\\n T: Serialize,\\n\\n{\\n\\n // Open a connection to each valid socket.\\n\\n let mut replies: Vec<UnixStream> = vec![];\\n\\n let epoll_fd = epoll::epoll_create().map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to create epoll: {:?}\\\", e),\\n\\n NitroCliErrorEnum::EpollError\\n\\n )\\n\\n })?;\\n\\n let comms: Vec<NitroCliResult<()>> = enclave_proc_connect_to_all()\\n\\n .map_err(|e| {\\n\\n e.add_subaction(\\\"Failed to send command to all enclave processes\\\".to_string())\\n\\n })?\\n\\n .iter_mut()\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 82,\n \"score\": 146623.69795728917\n },\n {\n \"content\": \"/// Open a connection to an enclave-specific socket.\\n\\npub fn enclave_proc_connect_to_single(enclave_id: &str) -> NitroCliResult<UnixStream> {\\n\\n let socket_path = get_socket_path(enclave_id).map_err(|e| {\\n\\n e.add_subaction(\\\"Connect to specific enclave process\\\".to_string())\\n\\n .set_error_code(NitroCliErrorEnum::SocketError)\\n\\n })?;\\n\\n UnixStream::connect(socket_path).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to connect to specific enclave process: {:?}\\\", e),\\n\\n NitroCliErrorEnum::SocketError\\n\\n )\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 83,\n \"score\": 145033.0655005389\n },\n {\n \"content\": \"/// Spawn an enclave process and wait until it has detached and has\\n\\n/// taken ownership of its communication socket.\\n\\npub fn enclave_proc_spawn(logger: &EnclaveProcLogWriter) -> NitroCliResult<UnixStream> {\\n\\n let (cli_socket, enclave_proc_socket) = UnixStream::pair().map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Could not create a socket pair: {:?}\\\", e),\\n\\n NitroCliErrorEnum::SocketPairCreationFailure\\n\\n )\\n\\n })?;\\n\\n\\n\\n // Prevent the descriptor from being closed when calling exec().\\n\\n let enclave_proc_fd = enclave_proc_socket.as_raw_fd();\\n\\n unsafe {\\n\\n let flags = libc::fcntl(enclave_proc_fd, libc::F_GETFD);\\n\\n libc::fcntl(enclave_proc_fd, libc::F_SETFD, flags & !libc::FD_CLOEXEC);\\n\\n }\\n\\n\\n\\n // Spawn an intermediate child process. This will fork again in order to\\n\\n // create the detached enclave process.\\n\\n let fork_status = fork();\\n\\n\\n\\n if let Ok(ForkResult::Child) = fork_status {\\n\",\n \"file_path\": \"src/enclave_proc_comm.rs\",\n \"rank\": 84,\n \"score\": 142648.9093656653\n },\n {\n \"content\": \"/// Handle an event coming from an enclave.\\n\\nfn try_handle_enclave_event(connection: &Connection) -> NitroCliResult<HandledEnclaveEvent> {\\n\\n // Check if this is an enclave connection.\\n\\n if let Some(mut enc_events) = connection\\n\\n .get_enclave_event_flags()\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to get enclave events flag\\\".to_string()))?\\n\\n {\\n\\n let enc_hup = enc_events.contains(EpollFlags::EPOLLHUP);\\n\\n\\n\\n // Check if non-hang-up events have occurred.\\n\\n enc_events.remove(EpollFlags::EPOLLHUP);\\n\\n if !enc_events.is_empty() {\\n\\n warn!(\\\"Received unexpected enclave event(s): {:?}\\\", enc_events);\\n\\n }\\n\\n\\n\\n // If we received the hang-up event we need to terminate cleanly.\\n\\n if enc_hup {\\n\\n warn!(\\\"Received hang-up event from the enclave. Enclave process will shut down.\\\");\\n\\n return Ok(HandledEnclaveEvent::HangUp);\\n\\n }\\n\\n\\n\\n // Non-hang-up enclave events are not fatal.\\n\\n return Ok(HandledEnclaveEvent::Unexpected);\\n\\n }\\n\\n\\n\\n Ok(HandledEnclaveEvent::None)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 85,\n \"score\": 142642.147749677\n },\n {\n \"content\": \"fn main() {\\n\\n let app = create_app!();\\n\\n let args = app.get_matches();\\n\\n\\n\\n match args.subcommand() {\\n\\n (\\\"listen\\\", Some(args)) => {\\n\\n let listen_args = ListenArgs::new_with(args).ok_or_exit(args.usage());\\n\\n listen(listen_args).ok_or_exit(args.usage());\\n\\n }\\n\\n (\\\"run\\\", Some(args)) => {\\n\\n let run_args = RunArgs::new_with(args).ok_or_exit(args.usage());\\n\\n let rc = run(run_args).ok_or_exit(args.usage());\\n\\n std::process::exit(rc);\\n\\n }\\n\\n (\\\"recv-file\\\", Some(args)) => {\\n\\n let subcmd_args = FileArgs::new_with(args).ok_or_exit(args.usage());\\n\\n recv_file(subcmd_args).ok_or_exit(args.usage());\\n\\n }\\n\\n (\\\"send-file\\\", Some(args)) => {\\n\\n let subcmd_args = FileArgs::new_with(args).ok_or_exit(args.usage());\\n\\n send_file(subcmd_args).ok_or_exit(args.usage());\\n\\n }\\n\\n (&_, _) => {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"samples/command_executer/src/main.rs\",\n \"rank\": 86,\n \"score\": 142538.0422475175\n },\n {\n \"content\": \"/// Handle a single command, returning whenever an error occurs.\\n\\nfn handle_command(\\n\\n cmd: EnclaveProcessCommandType,\\n\\n logger: &EnclaveProcLogWriter,\\n\\n connection: &Connection,\\n\\n conn_listener: &mut ConnectionListener,\\n\\n enclave_manager: &mut EnclaveManager,\\n\\n terminate_thread: &mut Option<std::thread::JoinHandle<()>>,\\n\\n) -> NitroCliResult<(i32, bool)> {\\n\\n Ok(match cmd {\\n\\n EnclaveProcessCommandType::Run => {\\n\\n // We should never receive a Run command if we are already running.\\n\\n if !enclave_manager.enclave_id.is_empty() {\\n\\n (libc::EEXIST, false)\\n\\n } else {\\n\\n let run_args = connection.read::<RunEnclavesArgs>().map_err(|e| {\\n\\n e.add_subaction(\\\"Failed to get run arguments\\\".to_string())\\n\\n .set_action(\\\"Run Enclave\\\".to_string())\\n\\n })?;\\n\\n info!(\\\"Run args = {:?}\\\", run_args);\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 87,\n \"score\": 142470.63699953142\n },\n {\n \"content\": \"#[derive(Debug, Serialize, Deserialize)]\\n\\nstruct FileTemplate {\\n\\n path: String,\\n\\n source: String,\\n\\n mode: String,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"enclave_build/src/yaml_generator.rs\",\n \"rank\": 88,\n \"score\": 142274.7872550611\n },\n {\n \"content\": \"/// Release the enclave descriptor.\\n\\nfn release_enclave_descriptor(enc_fd: RawFd) -> NitroCliResult<()> {\\n\\n // Close enclave descriptor.\\n\\n let rc = unsafe { libc::close(enc_fd) };\\n\\n if rc < 0 {\\n\\n return Err(new_nitro_cli_failure!(\\n\\n \\\"Failed to close enclave descriptor\\\",\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n ));\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/resource_manager.rs\",\n \"rank\": 89,\n \"score\": 141631.91017884453\n },\n {\n \"content\": \"#[derive(PartialEq, Eq, Hash)]\\n\\nenum CommandRequesterType {\\n\\n /// The requester is the user with the given UID.\\n\\n User(libc::uid_t),\\n\\n /// The requester is the group with the given GID.\\n\\n Group(libc::gid_t),\\n\\n /// The requester is any other user.\\n\\n Others,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/connection.rs\",\n \"rank\": 90,\n \"score\": 141333.74682927865\n },\n {\n \"content\": \"/// The policy used to filter received commands based on the requester's type.\\n\\nstruct CommandRequesterPolicy {\\n\\n /// A mapping between a requester's type and all of its allowed commands.\\n\\n policy: HashMap<CommandRequesterType, Vec<EnclaveProcessCommandType>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/connection.rs\",\n \"rank\": 91,\n \"score\": 141213.28932311328\n },\n {\n \"content\": \"/// The main event loop of the enclave process.\\n\\nfn process_event_loop(\\n\\n comm_stream: UnixStream,\\n\\n logger: &EnclaveProcLogWriter,\\n\\n) -> NitroCliResult<()> {\\n\\n let mut conn_listener = ConnectionListener::new()?;\\n\\n let mut enclave_manager = EnclaveManager::default();\\n\\n let mut terminate_thread: Option<std::thread::JoinHandle<()>> = None;\\n\\n let mut done = false;\\n\\n let mut ret_value = Ok(());\\n\\n\\n\\n // Start the signal handler before spawning any other threads. This is done since the\\n\\n // handler will mask all relevant signals from the current thread and this setting will\\n\\n // be automatically inherited by all threads spawned from this point on; we want this\\n\\n // because only the dedicated thread spawned by the handler should listen for signals.\\n\\n enclave_proc_configure_signal_handler(&conn_listener)\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to configure signal handler\\\".to_string()))?;\\n\\n\\n\\n // Add the CLI communication channel to epoll.\\n\\n conn_listener\\n\\n .handle_new_connection(comm_stream)\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 92,\n \"score\": 139492.32476167358\n },\n {\n \"content\": \"fn initial_digest(len: usize) -> Vec<u8> {\\n\\n vec![0; len]\\n\\n}\\n\\n\\n\\nimpl<T: Digest + Debug + Write + Clone> EifHasher<T> {\\n\\n pub fn new(block_size: usize, mut hasher: T) -> Result<Self, String> {\\n\\n let output_size = hasher.finalize_reset().len();\\n\\n if block_size > 0 && output_size * 2 > block_size {\\n\\n return Err(\\\"Invalid block_size\\\".to_string());\\n\\n }\\n\\n\\n\\n Ok(EifHasher {\\n\\n block: Vec::with_capacity(block_size),\\n\\n digest: initial_digest(output_size),\\n\\n block_size,\\n\\n output_size,\\n\\n hasher,\\n\\n })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"eif_defs/src/eif_hasher.rs\",\n \"rank\": 93,\n \"score\": 136567.99369531134\n },\n {\n \"content\": \"/// Create the enclave process.\\n\\nfn create_enclave_process(logger: &EnclaveProcLogWriter) -> NitroCliResult<()> {\\n\\n // To get a detached process, we first:\\n\\n // (1) Temporarily ignore specific signals (SIGHUP).\\n\\n // (2) Daemonize the current process.\\n\\n // (3) Wait until the detached process is orphaned.\\n\\n // (4) Restore signal handlers.\\n\\n let signal_handler = SignalHandler::new(&[SIGHUP])\\n\\n .mask_all()\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to mask signals\\\".to_string()))?;\\n\\n let ppid = getpid();\\n\\n\\n\\n // Daemonize the current process. The working directory remains\\n\\n // unchanged and the standard descriptors are routed to '/dev/null'.\\n\\n daemon(true, false).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to daemonize enclave process: {:?}\\\", e),\\n\\n NitroCliErrorEnum::DaemonizeProcessFailure\\n\\n )\\n\\n })?;\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 94,\n \"score\": 136203.09893500863\n },\n {\n \"content\": \"/// Initialize logging.\\n\\npub fn init_logger() -> NitroCliResult<EnclaveProcLogWriter> {\\n\\n // The log file is \\\"nitro-cli.log\\\" and is stored in the NPE resources directory.\\n\\n let log_writer = EnclaveProcLogWriter::new()?;\\n\\n\\n\\n // Initialize logging with the new log writer.\\n\\n flexi_logger::Logger::with_env_or_str(DEFAULT_LOG_LEVEL)\\n\\n .log_target(LogTarget::Writer(Box::new(log_writer.clone())))\\n\\n .start()\\n\\n .map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to initialize enclave process logger: {:?}\\\", e),\\n\\n NitroCliErrorEnum::LoggerError\\n\\n )\\n\\n })?;\\n\\n\\n\\n // The log writer is provided for sharing between CLI-related processes.\\n\\n Ok(log_writer)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/common/logger.rs\",\n \"rank\": 95,\n \"score\": 134003.50277494703\n },\n {\n \"content\": \"/// The internal data type needed for describing an enclave.\\n\\ntype UnpackedHandle = (u64, u64, u64, Vec<u32>, u64, u64, EnclaveState);\\n\\n\\n\\n/// The bit indicating if an enclave has been launched in debug mode.\\n\\npub const NE_ENCLAVE_DEBUG_MODE: u64 = 0x1;\\n\\n\\n\\n/// Constant number used for computing the lower memory limit.\\n\\nconst ENCLAVE_MEMORY_EIF_SIZE_RATIO: u64 = 4;\\n\\n\\n\\n/// Enclave Image Format (EIF) flag.\\n\\nconst NE_EIF_IMAGE: u64 = 0x01;\\n\\n\\n\\n/// Flag indicating a memory region for enclave general usage.\\n\\nconst NE_DEFAULT_MEMORY_REGION: u64 = 0;\\n\\n\\n\\n/// Magic number for Nitro Enclave IOCTL codes.\\n\\nconst NE_MAGIC: u64 = 0xAE;\\n\\n\\n\\n/// Path corresponding to the Nitro Enclaves device file.\\n\\nconst NE_DEV_FILEPATH: &str = \\\"/dev/nitro_enclaves\\\";\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/resource_manager.rs\",\n \"rank\": 96,\n \"score\": 133293.4558794103\n },\n {\n \"content\": \"/// Launch the POSIX signal handler on a dedicated thread and ensure its events are accessible.\\n\\nfn enclave_proc_configure_signal_handler(conn_listener: &ConnectionListener) -> NitroCliResult<()> {\\n\\n let mut signal_handler = SignalHandler::new_with_defaults()\\n\\n .mask_all()\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to configure signal handler\\\".to_string()))?;\\n\\n let (local_stream, thread_stream) = UnixStream::pair()\\n\\n .map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Failed to create stream pair: {:?}\\\", e),\\n\\n NitroCliErrorEnum::SocketPairCreationFailure\\n\\n )\\n\\n .set_action(\\\"Run Enclave\\\".to_string())\\n\\n })\\n\\n .ok_or_exit_with_errno(Some(\\\"Failed to create stream pair\\\"));\\n\\n\\n\\n conn_listener\\n\\n .add_stream_to_epoll(local_stream)\\n\\n .map_err(|e| {\\n\\n e.add_subaction(\\n\\n \\\"Failed to add stream to epoll when configuring signal handler\\\".to_string(),\\n\\n )\\n\\n })?;\\n\\n signal_handler.start_handler(thread_stream.into_raw_fd(), enclave_proc_handle_signals);\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/enclave_proc/mod.rs\",\n \"rank\": 97,\n \"score\": 132958.43294987327\n },\n {\n \"content\": \"/// Build an enclave image file with the provided arguments.\\n\\npub fn build_enclaves(args: BuildEnclavesArgs) -> NitroCliResult<()> {\\n\\n debug!(\\\"build_enclaves\\\");\\n\\n eprintln!(\\\"Start building the Enclave Image...\\\");\\n\\n build_from_docker(\\n\\n &args.docker_uri,\\n\\n &args.docker_dir,\\n\\n &args.output,\\n\\n &args.signing_certificate,\\n\\n &args.private_key,\\n\\n )\\n\\n .map_err(|e| e.add_subaction(\\\"Failed to build EIF from docker\\\".to_string()))?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 98,\n \"score\": 132705.26185186612\n },\n {\n \"content\": \"/// Build an enclave image file from a Docker image.\\n\\npub fn build_from_docker(\\n\\n docker_uri: &str,\\n\\n docker_dir: &Option<String>,\\n\\n output_path: &str,\\n\\n signing_certificate: &Option<String>,\\n\\n private_key: &Option<String>,\\n\\n) -> NitroCliResult<(File, BTreeMap<String, String>)> {\\n\\n let blobs_path =\\n\\n blobs_path().map_err(|e| e.add_subaction(\\\"Failed to retrieve blobs path\\\".to_string()))?;\\n\\n let cmdline_file_path = format!(\\\"{}/cmdline\\\", blobs_path);\\n\\n let mut cmdline_file = File::open(cmdline_file_path.clone()).map_err(|e| {\\n\\n new_nitro_cli_failure!(\\n\\n &format!(\\\"Could not open kernel command line file: {:?}\\\", e),\\n\\n NitroCliErrorEnum::FileOperationFailure\\n\\n )\\n\\n .add_info(vec![&cmdline_file_path, \\\"Open\\\"])\\n\\n })?;\\n\\n\\n\\n let mut cmdline = String::new();\\n\\n cmdline_file.read_to_string(&mut cmdline).map_err(|e| {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 99,\n \"score\": 131675.36271220143\n }\n]","isConversational":false}}},{"rowIdx":1184,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/test/spec/unified_runner/mod.rs"},"repo_name":{"kind":"string","value":"awitten1/mongo-rust-driver"},"commit":{"kind":"string","value":"5a0192cf1ba11d9e44c453e14f90d32231689166"},"file_code":{"kind":"string","value":"mod entity;\nmod matcher;\nmod operation;\nmod test_event;\nmod test_file;\nmod test_runner;\n\nuse std::{convert::TryFrom, ffi::OsStr, fs::read_dir, path::PathBuf, time::Duration};\n\nuse futures::{future::FutureExt, stream::TryStreamExt};\nuse semver::Version;\nuse tokio::sync::RwLockWriteGuard;\n\nuse crate::{\n bson::{doc, Document},\n options::{CollectionOptions, FindOptions, ReadConcern, ReadPreference, SelectionCriteria},\n test::{run_single_test, run_spec_test, LOCK},\n RUNTIME,\n};\n\npub use self::{\n entity::{ClientEntity, Entity, FindCursor, SessionEntity},\n matcher::{events_match, results_match},\n operation::{Operation, OperationObject},\n test_event::{ExpectedCmapEvent, ExpectedCommandEvent, ExpectedEvent, ObserveEvent},\n test_file::{\n merge_uri_options,\n CollectionData,\n ExpectError,\n ExpectedEventType,\n TestFile,\n TestFileEntity,\n Topology,\n },\n test_runner::{EntityMap, TestRunner},\n};\n\nuse self::operation::Expectation;\n\nstatic SPEC_VERSIONS: &[Version] = &[\n Version::new(1, 0, 0),\n Version::new(1, 1, 0),\n Version::new(1, 4, 0),\n Version::new(1, 5, 0),\n];\n\nconst SKIPPED_OPERATIONS: &[&str] = &[\n \"bulkWrite\",\n \"count\",\n \"download\",\n \"download_by_name\",\n \"listCollectionObjects\",\n \"listDatabaseObjects\",\n \"mapReduce\",\n \"watch\",\n];\n\npub async fn run_unified_format_test(test_file: TestFile) {\n let version_matches = SPEC_VERSIONS.iter().any(|req| {\n if req.major != test_file.schema_version.major {\n return false;\n }\n if req.minor < test_file.schema_version.minor {\n return false;\n }\n \n true\n });\n if !version_matches {\n panic!(\n \"Test runner not compatible with specification version {}\",\n &test_file.schema_version\n );\n }\n\n let mut test_runner = TestRunner::new().await;\n\n if let Some(requirements) = test_file.run_on_requirements {\n let mut can_run_on = false;\n for requirement in requirements {\n if requirement.can_run_on(&test_runner.internal_client).await {\n can_run_on = true;\n }\n }\n if !can_run_on {\n println!(\"Client topology not compatible with test\");\n return;\n }\n }\n\n for test_case in test_file.tests {\n if let Some(skip_reason) = test_case.skip_reason {\n println!(\"Skipping {}: {}\", &test_case.description, skip_reason);\n continue;\n }\n\n if test_case\n .operations\n .iter()\n .any(|op| SKIPPED_OPERATIONS.contains(&op.name.as_str()))\n {\n println!(\"Skipping {}\", &test_case.description);\n continue;\n }\n\n println!(\"Running {}\", &test_case.description);\n\n if let Some(requirements) = test_case.run_on_requirements {\n let mut can_run_on = false;\n for requirement in requirements {\n if requirement.can_run_on(&test_runner.internal_client).await {\n can_run_on = true;\n }\n }\n if !can_run_on {\n println!(\n \"{}: client topology not compatible with test\",\n &test_case.description\n );\n return;\n }\n }\n\n if let Some(ref initial_data) = test_file.initial_data {\n for data in initial_data {\n test_runner.insert_initial_data(data).await;\n }\n }\n\n if let Some(ref create_entities) = test_file.create_entities {\n test_runner.populate_entity_map(create_entities).await;\n }\n\n for operation in test_case.operations {\n match operation.object {\n OperationObject::TestRunner => {\n operation\n .execute_test_runner_operation(&mut test_runner)\n .await;\n }\n OperationObject::Entity(ref id) => {\n let result = operation\n .execute_entity_operation(id, &mut test_runner)\n .await;\n\n match &operation.expectation {\n Expectation::Result {\n expected_value,\n save_as_entity,\n } => {\n let opt_entity = result.unwrap_or_else(|e| {\n panic!(\n \"{} should succeed, but failed with the following error: {}\",\n operation.name, e\n )\n });\n if expected_value.is_some() || save_as_entity.is_some() {\n let entity = opt_entity.unwrap_or_else(|| {\n panic!(\"{} did not return an entity\", operation.name)\n });\n if let Some(expected_bson) = expected_value {\n if let Entity::Bson(actual) = &entity {\n assert!(\n results_match(\n Some(actual),\n expected_bson,\n operation.returns_root_documents(),\n Some(&test_runner.entities),\n ),\n \"result mismatch, expected = {:#?} actual = {:#?}\",\n expected_bson,\n actual,\n );\n } else {\n panic!(\n \"Incorrect entity type returned from {}, expected BSON\",\n operation.name\n );\n }\n }\n if let Some(id) = save_as_entity {\n if test_runner.entities.insert(id.clone(), entity).is_some() {\n panic!(\n \"Entity with id {} already present in entity map\",\n id\n );\n }\n }\n }\n }\n Expectation::Error(expect_error) => {\n let error = result\n .expect_err(&format!(\"{} should return an error\", operation.name));\n expect_error.verify_result(error);\n }\n Expectation::Ignore => (),\n }\n }\n }\n \n \n \n \n \n if test_case.description == \"Server supports implicit sessions\" {\n RUNTIME.delay_for(Duration::from_secs(1)).await;\n }\n }\n\n test_runner.fail_point_guards.clear();\n\n if let Some(ref events) = test_case.expect_events {\n for expected in events {\n let entity = test_runner.entities.get(&expected.client).unwrap();\n let client = entity.as_client();\n client.sync_workers().await;\n let event_type = expected\n .event_type\n .unwrap_or(test_file::ExpectedEventType::Command);\n\n let actual_events: Vec<ExpectedEvent> = client\n .get_filtered_events(event_type)\n .into_iter()\n .map(Into::into)\n .collect();\n\n let expected_events = &expected.events;\n\n assert_eq!(\n actual_events.len(),\n expected_events.len(),\n \"actual:\\n{:#?}\\nexpected:\\n{:#?}\",\n actual_events,\n expected_events\n );\n\n for (actual, expected) in actual_events.iter().zip(expected_events) {\n assert!(\n events_match(actual, expected, Some(&test_runner.entities)),\n \"event mismatch: expected = {:#?}, actual = {:#?}\",\n expected,\n actual,\n );\n }\n }\n }\n\n if let Some(ref outcome) = test_case.outcome {\n for expected_data in outcome {\n let db_name = &expected_data.database_name;\n let coll_name = &expected_data.collection_name;\n\n let selection_criteria = SelectionCriteria::ReadPreference(ReadPreference::Primary);\n let read_concern = ReadConcern::local();\n\n let options = CollectionOptions::builder()\n .selection_criteria(selection_criteria)\n .read_concern(read_concern)\n .build();\n let collection = test_runner\n .internal_client\n .get_coll_with_options(db_name, coll_name, options);\n\n let options = FindOptions::builder().sort(doc! { \"_id\": 1 }).build();\n let actual_data: Vec<Document> = collection\n .find(doc! {}, options)\n .await\n .unwrap()\n .try_collect()\n .await\n .unwrap();\n\n assert_eq!(expected_data.documents, actual_data);\n }\n }\n\n println!(\"{} succeeded\", &test_case.description);\n }\n}\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn test_examples() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n run_spec_test(\n &[\"unified-test-format\", \"examples\"],\n run_unified_format_test,\n )\n .await;\n}\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn valid_fail() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n\n let path: PathBuf = [\n env!(\"CARGO_MANIFEST_DIR\"),\n \"src\",\n \"test\",\n \"spec\",\n \"json\",\n \"unified-test-format\",\n \"valid-fail\",\n ]\n .iter()\n .collect();\n\n for entry in read_dir(&path).unwrap() {\n let test_file_path = PathBuf::from(entry.unwrap().file_name());\n let path = path.join(&test_file_path);\n let path_display = path.display().to_string();\n\n std::panic::AssertUnwindSafe(run_single_test(path, &run_unified_format_test))\n .catch_unwind()\n .await\n .expect_err(&format!(\"tests from {} should have failed\", path_display));\n }\n}\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn valid_pass() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n run_spec_test(\n &[\"unified-test-format\", \"valid-pass\"],\n run_unified_format_test,\n )\n .await;\n}\n\nconst SKIPPED_INVALID_TESTS: &[&str] = &[\n \n \"expectedEventsForClient-events_conflicts_with_cmap_eventType.json\",\n \"expectedEventsForClient-events_conflicts_with_command_eventType.json\",\n \"expectedEventsForClient-events_conflicts_with_default_eventType.json\",\n];\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn invalid() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n\n let path: PathBuf = [\n env!(\"CARGO_MANIFEST_DIR\"),\n \"src\",\n \"test\",\n \"spec\",\n \"json\",\n \"unified-test-format\",\n \"invalid\",\n ]\n .iter()\n .collect();\n\n for entry in read_dir(&path).unwrap() {\n let test_file = entry.unwrap();\n if !test_file.file_type().unwrap().is_file() {\n continue;\n }\n let test_file_path = PathBuf::from(test_file.file_name());\n if test_file_path.extension().and_then(OsStr::to_str) != Some(\"json\") {\n continue;\n }\n let test_file_str = test_file_path.as_os_str().to_str().unwrap();\n if SKIPPED_INVALID_TESTS\n .iter()\n .any(|skip| *skip == test_file_str)\n {\n println!(\"Skipping {}\", test_file_str);\n continue;\n }\n let path = path.join(&test_file_path);\n let path_display = path.display().to_string();\n\n let json: serde_json::Value =\n serde_json::from_reader(std::fs::File::open(path.as_path()).unwrap()).unwrap();\n let result: Result<TestFile, _> = bson::from_bson(\n bson::Bson::try_from(json).unwrap_or_else(|_| panic!(\"{}\", path_display)),\n );\n if let Ok(test_file) = result {\n panic!(\n \"{}: should be invalid, parsed to:\\n{:#?}\",\n path_display, test_file\n );\n }\n }\n}\n"},"prefix":{"kind":"string","value":"mod entity;\nmod matcher;\nmod operation;\nmod test_event;\nmod test_file;\nmod test_runner;\n\nuse std::{convert::TryFrom, ffi::OsStr, fs::read_dir, path::PathBuf, time::Duration};\n\nuse futures::{future::FutureExt, stream::TryStreamExt};\nuse semver::Version;\nuse tokio::sync::RwLockWriteGuard;\n\nuse crate::{\n bson::{doc, Document},\n options::{CollectionOptions, FindOptions, ReadConcern, ReadPreference, SelectionCriteria},\n test::{run_single_test, run_spec_test, LOCK},\n RUNTIME,\n};\n\npub use self::{\n entity::{ClientEntity, Entity, FindCursor, SessionEntity},\n matcher::{events_match, results_match},\n operation::{Operation, OperationObject},\n test_event::{ExpectedCmapEvent, ExpectedCommandEvent, ExpectedEvent, ObserveEvent},\n test_file::{\n merge_uri_options,\n CollectionData,\n ExpectError,\n ExpectedEventType,\n TestFile,\n TestFileEntity,\n Topology,\n },\n test_runner::{EntityMap, TestRunner},\n};\n\nuse self::operation::Expectation;\n\nstatic SPEC_VERSIONS: &[Version] = &[\n Version::new(1, 0, 0),\n Version::new(1, 1, 0),\n Version::new(1, 4, 0),\n Version::new(1, 5, 0),\n];\n\nconst SKIPPED_OPERATIONS: &[&str] = &[\n \"bulkWrite\",\n \"count\",\n \"download\",\n \"download_by_name\",\n \"listCollectionObjects\",\n \"listDatabaseObjects\",\n \"mapReduce\",\n \"watch\",\n];\n\npub async fn run_unified_format_test(test_file: TestFile) {\n let version_matches = SPEC_VERSIONS.iter().any(|req| {\n if req.major != test_file.schema_version.major {\n return false;\n }\n if req.minor < test_file.schema_version.minor {\n return false;\n }\n \n true\n });\n if !version_matches {\n panic!(\n \"Test runner not compatible with specification version {}\",\n &test_file.schema_version\n );\n }\n\n let mut test_runner = TestRunner::new().await;\n\n if let Some(requirements) = test_file.run_on_requirements {\n let mut can_run_on = false;\n for requirement in requirements {\n if requirement.can_run_on(&test_runner.internal_client).await {\n can_run_on = true;\n }\n }\n if !can_run_on {\n println!(\"Client topology not compatible with test\");\n return;\n }\n }\n\n for test_case in test_file.tests {\n if let Some(skip_reason) = test_case.skip_reason {\n println!(\"Skipping {}: {}\", &test_case.description, skip_reason);\n continue;\n }\n\n if test_case\n .operations\n .iter()\n .any(|op| SKIPPED_OPERATIONS.contains(&op.name.as_str()))\n {\n println!(\"Skipping {}\", &test_case.description);\n continue;\n }\n\n println!(\"Running {}\", &test_case.description);\n\n if let Some(requirements) = test_case.run_on_requirements {\n let mut can_run_on = false;\n for requirement in requirements {\n if requirement.can_run_on(&test_runner.internal_client).await {\n can_run_on = true;\n }\n }\n if !can_run_on {\n println!(\n \"{}: client topology not compatible with test\",\n &test_case.description\n );\n return;\n }\n }\n\n if let Some(ref initial_data) = test_file.initial_data {\n for data in initial_data {\n test_runner.insert_initial_data(data).await;\n }\n }\n\n if let Some(ref create_entities) = test_file.create_entities {\n test_runner.populate_entity_map(create_entities).await;\n }\n\n for operation in test_case.operations {\n match operation.object {\n OperationObject::TestRunner => {\n operation\n .execute_test_runner_operation(&mut test_runner)\n .await;\n }\n OperationObject::Entity(ref id) => {\n let result = operation\n .execute_entity_operation(id, &mut test_runner)\n .await;\n\n match &operation.expectation {\n Expectation::Result {\n expected_value,\n save_as_entity,\n } => {\n let opt_entity = result.unwrap_or_else(|e| {\n panic!(\n \"{} should succeed, but failed with the following error: {}\",\n operation.name, e\n )\n });\n if expected_value.is_some() || save_as_entity.is_some() {\n let entity = opt_entity.unwrap_or_else(|| {\n panic!(\"{} did not return an entity\", operation.name)\n });\n if let Some(expected_bson) = expected_value {\n if let Entity::Bson(actual) = &entity {\n assert!(\n results_match(\n Some(actual),\n expected_bson,\n operation.returns_root_documents(),\n Some(&test_runner.entities),\n ),\n \"result mismatch, expected = {:#?} actual = {:#?}\",\n expected_bson,\n actual,\n );\n } else {\n panic!(\n \"Incorrect entity type returned from {}, expected BSON\",\n operation.name\n );\n }\n }\n if let Some(id) = save_as_entity {\n if test_runner.entities.insert(id.clone(), entity).is_some() {\n panic!(\n \"Entity with id {} already present in entity map\",\n id\n );\n }\n }\n }\n }\n Expectation::Error(expect_error) => {\n let error = result\n .expect_err(&format!(\"{} should return an error\", operation.name));\n expect_error.verify_result(error);\n }\n Expectation::Ignore => (),\n }\n }\n }\n \n \n \n \n \n if test_case.description == \"Server supports implicit sessions\" {\n RUNTIME.delay_for(Duration::from_secs(1)).await;\n }\n }\n\n test_runner.fail_point_guards.clear();\n\n if let Some(ref events) = test_case.expect_events {\n for expected in events {\n let entity = test_runner.entities.get(&expected.client).unwrap();\n let client = entity.as_client();\n client.sync_workers().await;\n let event_type = expected\n .event_type\n .unwrap_or(test_file::ExpectedEventType::Command);\n\n let actual_events: Vec<ExpectedEvent> = client\n .get_filtered_events(event_type)\n .into_iter()\n .map(Into::into)\n .collect();\n\n let expected_events = &expected.events;\n\n assert_eq!(\n actual_events.len(),\n expected_events.len(),\n \"actual:\\n{:#?}\\nexpected:\\n{:#?}\",\n actual_events,\n expected_events\n );\n\n for (actual, expected) in actual_events.iter().zip(expected_events) {\n assert!(\n events_match(actual, expected, Some(&test_runner.entities)),\n \"event mismatch: expected = {:#?}, actual = {:#?}\",\n expected,\n actual,\n );\n }\n }\n }\n\n if let Some(ref outcome) = test_case.outcome {\n for expected_data in outcome {\n let db_name = &expected_data.database_name;\n let coll_name = &expected_data.collection_name;\n\n let selection_criteria = SelectionCriteria::ReadPreference(ReadPreference::Primary);\n let read_concern = ReadConcern::local();\n\n let options = CollectionOptions::builder()\n .selection_criteria(selection_criteria)\n .read_concern(read_concern)\n .build();\n let collection = test_runner\n .internal_client\n .get_coll_with_options(db_name, coll_name, options);\n\n let options = FindOptions::builder().sort(doc! { \"_id\": 1 }).build();\n let actual_data: Vec<Document> = collection\n .find(doc! {}, options)\n .await\n .unwrap()\n .try_collect()\n .await\n .unwrap();\n\n assert_eq!(expected_data.documents, actual_data);\n }\n }\n\n println!(\"{} succeeded\", &test_case.description);\n }\n}\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn test_examples() {\n let _guar"},"suffix":{"kind":"string","value":"\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn valid_fail() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n\n let path: PathBuf = [\n env!(\"CARGO_MANIFEST_DIR\"),\n \"src\",\n \"test\",\n \"spec\",\n \"json\",\n \"unified-test-format\",\n \"valid-fail\",\n ]\n .iter()\n .collect();\n\n for entry in read_dir(&path).unwrap() {\n let test_file_path = PathBuf::from(entry.unwrap().file_name());\n let path = path.join(&test_file_path);\n let path_display = path.display().to_string();\n\n std::panic::AssertUnwindSafe(run_single_test(path, &run_unified_format_test))\n .catch_unwind()\n .await\n .expect_err(&format!(\"tests from {} should have failed\", path_display));\n }\n}\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn valid_pass() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n run_spec_test(\n &[\"unified-test-format\", \"valid-pass\"],\n run_unified_format_test,\n )\n .await;\n}\n\nconst SKIPPED_INVALID_TESTS: &[&str] = &[\n \n \"expectedEventsForClient-events_conflicts_with_cmap_eventType.json\",\n \"expectedEventsForClient-events_conflicts_with_command_eventType.json\",\n \"expectedEventsForClient-events_conflicts_with_default_eventType.json\",\n];\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test(flavor = \"multi_thread\"))]\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\nasync fn invalid() {\n let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n\n let path: PathBuf = [\n env!(\"CARGO_MANIFEST_DIR\"),\n \"src\",\n \"test\",\n \"spec\",\n \"json\",\n \"unified-test-format\",\n \"invalid\",\n ]\n .iter()\n .collect();\n\n for entry in read_dir(&path).unwrap() {\n let test_file = entry.unwrap();\n if !test_file.file_type().unwrap().is_file() {\n continue;\n }\n let test_file_path = PathBuf::from(test_file.file_name());\n if test_file_path.extension().and_then(OsStr::to_str) != Some(\"json\") {\n continue;\n }\n let test_file_str = test_file_path.as_os_str().to_str().unwrap();\n if SKIPPED_INVALID_TESTS\n .iter()\n .any(|skip| *skip == test_file_str)\n {\n println!(\"Skipping {}\", test_file_str);\n continue;\n }\n let path = path.join(&test_file_path);\n let path_display = path.display().to_string();\n\n let json: serde_json::Value =\n serde_json::from_reader(std::fs::File::open(path.as_path()).unwrap()).unwrap();\n let result: Result<TestFile, _> = bson::from_bson(\n bson::Bson::try_from(json).unwrap_or_else(|_| panic!(\"{}\", path_display)),\n );\n if let Ok(test_file) = result {\n panic!(\n \"{}: should be invalid, parsed to:\\n{:#?}\",\n path_display, test_file\n );\n }\n }\n}\n"},"middle":{"kind":"string","value":"d: RwLockWriteGuard<_> = LOCK.run_exclusively().await;\n run_spec_test(\n &[\"unified-test-format\", \"examples\"],\n run_unified_format_test,\n )\n .await;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"fn entity_matches(id: &str, actual: Option<&Bson>, entities: &EntityMap) -> bool {\n\n let bson = entities.get(id).unwrap().as_bson();\n\n results_match_inner(actual, bson, false, false, Some(entities))\n\n}\n\n\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":0,"score":609087.4541693649},{"content":"fn type_matches(types: &Bson, actual: &Bson) -> bool {\n\n match types {\n\n Bson::Array(types) => types.iter().any(|t| type_matches(t, actual)),\n\n Bson::String(str) => match str.as_ref() {\n\n \"double\" => actual.element_type() == ElementType::Double,\n\n \"string\" => actual.element_type() == ElementType::String,\n\n \"object\" => actual.element_type() == ElementType::EmbeddedDocument,\n\n \"array\" => actual.element_type() == ElementType::Array,\n\n \"binData\" => actual.element_type() == ElementType::Binary,\n\n \"undefined\" => actual.element_type() == ElementType::Undefined,\n\n \"objectId\" => actual.element_type() == ElementType::ObjectId,\n\n \"bool\" => actual.element_type() == ElementType::Boolean,\n\n \"date\" => actual.element_type() == ElementType::DateTime,\n\n \"null\" => actual.element_type() == ElementType::Null,\n\n \"regex\" => actual.element_type() == ElementType::RegularExpression,\n\n \"dbPointer\" => actual.element_type() == ElementType::DbPointer,\n\n \"javascript\" => actual.element_type() == ElementType::JavaScriptCode,\n\n \"symbol\" => actual.element_type() == ElementType::Symbol,\n\n \"javascriptWithScope\" => actual.element_type() == ElementType::JavaScriptCodeWithScope,\n\n \"int\" => actual.element_type() == ElementType::Int32,\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":1,"score":441339.26920310047},{"content":"fn numbers_match(actual: &Bson, expected: &Bson) -> bool {\n\n if actual.element_type() == expected.element_type() {\n\n return actual == expected;\n\n }\n\n\n\n match (get_int(actual), get_int(expected)) {\n\n (Some(actual), Some(expected)) => actual == expected,\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":2,"score":428527.8816444054},{"content":"pub fn results_match(\n\n actual: Option<&Bson>,\n\n expected: &Bson,\n\n returns_root_documents: bool,\n\n entities: Option<&EntityMap>,\n\n) -> bool {\n\n results_match_inner(actual, expected, returns_root_documents, true, entities)\n\n}\n\n\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":3,"score":411198.8854408264},{"content":"fn server_type_from_str(s: &str) -> Option<ServerType> {\n\n let t = match s {\n\n \"Standalone\" => ServerType::Standalone,\n\n \"Mongos\" => ServerType::Mongos,\n\n \"RSPrimary\" => ServerType::RsPrimary,\n\n \"RSSecondary\" => ServerType::RsSecondary,\n\n \"RSArbiter\" => ServerType::RsArbiter,\n\n \"RSOther\" => ServerType::RsOther,\n\n \"RSGhost\" => ServerType::RsGhost,\n\n \"LoadBalancer\" => ServerType::LoadBalancer,\n\n \"Unknown\" | \"PossiblePrimary\" => ServerType::Unknown,\n\n _ => return None,\n\n };\n\n\n\n Some(t)\n\n}\n\n\n\nasync fn run_test(test_file: TestFile) {\n\n let test_description = &test_file.description;\n\n\n","file_path":"src/sdam/description/topology/test/sdam.rs","rank":4,"score":406006.9380474634},{"content":"pub fn merge_uri_options(given_uri: &str, uri_options: Option<&Document>) -> String {\n\n let uri_options = match uri_options {\n\n Some(opts) => opts,\n\n None => return given_uri.to_string(),\n\n };\n\n let mut given_uri_parts = given_uri.split('?');\n\n\n\n let mut uri = String::from(given_uri_parts.next().unwrap());\n\n // A connection string has two slashes before the host list and one slash before the auth db\n\n // name. If an auth db name is not provided the latter slash might not be present, so it needs\n\n // to be added manually.\n\n if uri.chars().filter(|c| *c == '/').count() < 3 {\n\n uri.push('/');\n\n }\n\n uri.push('?');\n\n\n\n if let Some(options) = given_uri_parts.next() {\n\n let options = options.split('&');\n\n for option in options {\n\n let key = option.split('=').next().unwrap();\n","file_path":"src/test/spec/unified_runner/test_file.rs","rank":5,"score":398817.15797154745},{"content":"fn validate_userinfo(s: &str, userinfo_type: &str) -> Result<()> {\n\n if s.chars().any(|c| USERINFO_RESERVED_CHARACTERS.contains(&c)) {\n\n return Err(ErrorKind::InvalidArgument {\n\n message: format!(\"{} must be URL encoded\", userinfo_type),\n\n }\n\n .into());\n\n }\n\n\n\n // All instances of '%' in the username must be part of an percent-encoded substring. This means\n\n // that there must be two hexidecimal digits following any '%' in the username.\n\n if s.split('%')\n\n .skip(1)\n\n .any(|part| part.len() < 2 || part[0..2].chars().any(|c| !c.is_ascii_hexdigit()))\n\n {\n\n return Err(ErrorKind::InvalidArgument {\n\n message: \"username/password cannot contain unescaped %\".to_string(),\n\n }\n\n .into());\n\n }\n\n\n","file_path":"src/client/options/mod.rs","rank":6,"score":398156.28527851764},{"content":"fn verify_max_staleness(max_staleness: Option<Duration>) -> crate::error::Result<()> {\n\n verify_max_staleness_inner(max_staleness)\n\n .map_err(|s| crate::error::ErrorKind::InvalidArgument { message: s }.into())\n\n}\n\n\n","file_path":"src/sdam/description/topology/mod.rs","rank":7,"score":394795.7629048139},{"content":"fn cmap_events_match(actual: &ExpectedCmapEvent, expected: &ExpectedCmapEvent) -> bool {\n\n match (actual, expected) {\n\n (\n\n ExpectedCmapEvent::PoolCleared {\n\n has_service_id: actual_has_service_id,\n\n },\n\n ExpectedCmapEvent::PoolCleared {\n\n has_service_id: expected_has_service_id,\n\n },\n\n ) => {\n\n expected_has_service_id.is_none() || (actual_has_service_id == expected_has_service_id)\n\n }\n\n (\n\n ExpectedCmapEvent::ConnectionClosed {\n\n reason: actual_reason,\n\n },\n\n ExpectedCmapEvent::ConnectionClosed {\n\n reason: expected_reason,\n\n },\n\n ) => expected_reason.is_none() || (actual_reason == expected_reason),\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":8,"score":391597.10732761415},{"content":"fn init_db_and_coll(client: &Client, db_name: &str, coll_name: &str) -> Collection<Document> {\n\n let coll = client.database(db_name).collection(coll_name);\n\n coll.drop(None).unwrap();\n\n coll\n\n}\n\n\n","file_path":"src/sync/test.rs","rank":9,"score":380733.3938628146},{"content":"pub fn events_match(\n\n actual: &ExpectedEvent,\n\n expected: &ExpectedEvent,\n\n entities: Option<&EntityMap>,\n\n) -> bool {\n\n match (actual, expected) {\n\n (ExpectedEvent::Command(act), ExpectedEvent::Command(exp)) => {\n\n command_events_match(act, exp, entities)\n\n }\n\n (ExpectedEvent::Cmap(act), ExpectedEvent::Cmap(exp)) => cmap_events_match(act, exp),\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":10,"score":379340.78567052225},{"content":"fn assert_same_lsid_on_last_two_commands(client: &EventClient) {\n\n let events = client.get_all_command_started_events();\n\n let lsid1 = events[events.len() - 1].command.get(\"lsid\").unwrap();\n\n let lsid2 = events[events.len() - 2].command.get(\"lsid\").unwrap();\n\n assert_eq!(lsid1, lsid2);\n\n}\n","file_path":"src/test/spec/v2_runner/mod.rs","rank":11,"score":353694.8160360554},{"content":"fn command_write_concerns(client: &EventClient, key: &str) -> Vec<Document> {\n\n client\n\n .get_command_started_events(&[key])\n\n .into_iter()\n\n .map(|d| d.command.get_document(\"writeConcern\").unwrap().clone())\n\n .collect()\n\n}\n","file_path":"src/concern/test.rs","rank":12,"score":351606.9818659642},{"content":"fn is_master_response_from_server_type(server_type: ServerType) -> Option<IsMasterCommandResponse> {\n\n let mut response = IsMasterCommandResponse::default();\n\n\n\n match server_type {\n\n ServerType::Unknown => {\n\n return None;\n\n }\n\n ServerType::Mongos => {\n\n response.msg = Some(\"isdbgrid\".into());\n\n }\n\n ServerType::RsPrimary => {\n\n response.set_name = Some(\"foo\".into());\n\n response.is_writable_primary = Some(true);\n\n }\n\n ServerType::RsOther => {\n\n response.set_name = Some(\"foo\".into());\n\n response.hidden = Some(true);\n\n }\n\n ServerType::RsSecondary => {\n\n response.set_name = Some(\"foo\".into());\n","file_path":"src/sdam/description/topology/server_selection/test/mod.rs","rank":13,"score":349090.741245168},{"content":"fn init_db_and_typed_coll<T>(client: &Client, db_name: &str, coll_name: &str) -> Collection<T>\n\nwhere\n\n T: Serialize + DeserializeOwned + Unpin + Debug,\n\n{\n\n let coll = client.database(db_name).collection(coll_name);\n\n coll.drop(None).unwrap();\n\n coll\n\n}\n\n\n","file_path":"src/sync/test.rs","rank":14,"score":348320.2858046061},{"content":"fn assert_different_lsid_on_last_two_commands(client: &EventClient) {\n\n let events = client.get_all_command_started_events();\n\n let lsid1 = events[events.len() - 1].command.get(\"lsid\").unwrap();\n\n let lsid2 = events[events.len() - 2].command.get(\"lsid\").unwrap();\n\n assert_ne!(lsid1, lsid2);\n\n}\n\n\n","file_path":"src/test/spec/v2_runner/mod.rs","rank":15,"score":348289.0003839334},{"content":"fn percent_decode(s: &str, err_message: &str) -> Result<String> {\n\n match percent_encoding::percent_decode_str(s).decode_utf8() {\n\n Ok(result) => Ok(result.to_string()),\n\n Err(_) => Err(ErrorKind::InvalidArgument {\n\n message: err_message.to_string(),\n\n }\n\n .into()),\n\n }\n\n}\n\n\n","file_path":"src/client/options/mod.rs","rank":16,"score":344638.1478110225},{"content":"fn lists_eq(actual: &Option<Vec<String>>, expected: &[String]) -> bool {\n\n if let Some(actual) = actual {\n\n actual.as_slice() == expected\n\n } else {\n\n expected.is_empty()\n\n }\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"camelCase\", deny_unknown_fields)]\n\npub struct TestTopologyDescription {\n\n topology_type: String,\n\n set_name: Option<String>,\n\n servers: Vec<TestServerDescription>,\n\n}\n\n\n\nimpl PartialEq<TestTopologyDescription> for TopologyDescription {\n\n fn eq(&self, other: &TestTopologyDescription) -> bool {\n\n if self.topology_type.as_str() != other.topology_type.as_str()\n\n || self.set_name != other.set_name\n","file_path":"src/sdam/description/topology/test/event.rs","rank":17,"score":344578.73399559717},{"content":"fn deserialize_schema_version<'de, D>(deserializer: D) -> std::result::Result<Version, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let mut schema_version = String::deserialize(deserializer)?;\n\n // If the schema version does not contain a minor or patch version, append as necessary to\n\n // ensure the String parses correctly into a semver::Version.\n\n let count = schema_version.split('.').count();\n\n if count == 1 {\n\n schema_version.push_str(\".0.0\");\n\n } else if count == 2 {\n\n schema_version.push_str(\".0\");\n\n }\n\n Version::parse(&schema_version).map_err(|e| serde::de::Error::custom(format!(\"{}\", e)))\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\n#[serde(rename_all = \"camelCase\", deny_unknown_fields)]\n\npub struct RunOnRequirement {\n\n min_server_version: Option<String>,\n","file_path":"src/test/spec/unified_runner/test_file.rs","rank":18,"score":340753.9156450671},{"content":"/// Splits a string into a section before a given index and a section exclusively after the index.\n\n/// Empty portions are returned as `None`.\n\nfn exclusive_split_at(s: &str, i: usize) -> (Option<&str>, Option<&str>) {\n\n let (l, r) = s.split_at(i);\n\n\n\n let lout = if !l.is_empty() { Some(l) } else { None };\n\n let rout = if r.len() > 1 { Some(&r[1..]) } else { None };\n\n\n\n (lout, rout)\n\n}\n\n\n","file_path":"src/client/options/mod.rs","rank":19,"score":333294.83651614044},{"content":"fn verify_max_await_time(max_await_time: Option<Duration>, cursor_type: Option<CursorType>) {\n\n let ns = Namespace::empty();\n\n let find = Find::<Document>::new(\n\n ns,\n\n None,\n\n Some(FindOptions {\n\n cursor_type,\n\n max_await_time,\n\n ..Default::default()\n\n }),\n\n );\n\n\n\n let spec = handle_response_test(\n\n &find,\n\n doc! {\n\n \"cursor\": {\n\n \"id\": 123,\n\n \"ns\": \"a.b\",\n\n \"firstBatch\": [],\n\n },\n","file_path":"src/operation/find/test.rs","rank":20,"score":319544.87818368414},{"content":"pub fn assert_matches<A: Matchable + Debug, E: Matchable + Debug>(\n\n actual: &A,\n\n expected: &E,\n\n description: Option<&str>,\n\n) {\n\n let result = actual.matches(expected);\n\n assert!(\n\n result.is_ok(),\n\n \"{}\\n{:#?}\\n did not MATCH \\n{:#?}\\n MATCH failure: {}\",\n\n description.unwrap_or(\"\"),\n\n actual,\n\n expected,\n\n result.unwrap_err(),\n\n );\n\n}\n\n\n","file_path":"src/test/util/matchable.rs","rank":21,"score":319526.9317448953},{"content":"fn return_document_to_bool(return_document: Option<ReturnDocument>) -> Option<bool> {\n\n if let Some(return_document) = return_document {\n\n return match return_document {\n\n ReturnDocument::After => Some(true),\n\n ReturnDocument::Before => Some(false),\n\n };\n\n }\n\n None\n\n}\n","file_path":"src/operation/find_and_modify/options.rs","rank":22,"score":315706.8189558727},{"content":"fn serialize_true<S: Serializer>(s: S) -> std::result::Result<S::Ok, S::Error> {\n\n s.serialize_bool(true)\n\n}\n\n\n\n#[serde_with::skip_serializing_none]\n\n#[derive(Debug, TypedBuilder, Serialize)]\n\n#[builder(field_defaults(setter(into)))]\n\n#[serde(rename_all = \"camelCase\")]\n\npub(super) struct FindAndModifyOptions {\n\n #[serde(flatten)]\n\n pub(crate) modification: Modification,\n\n\n\n #[builder(default)]\n\n pub(crate) sort: Option<Document>,\n\n\n\n #[builder(default)]\n\n pub(crate) new: Option<bool>,\n\n\n\n #[builder(default)]\n\n pub(crate) upsert: Option<bool>,\n","file_path":"src/operation/find_and_modify/options.rs","rank":23,"score":308281.2752775359},{"content":"/// Validates that a `saslStart` or `saslContinue` command response is successful.\n\nfn validate_command_success(auth_mechanism: &str, response: &Document) -> Result<()> {\n\n let ok = match response.get(\"ok\") {\n\n Some(ok) => ok,\n\n None => return Ok(()),\n\n };\n\n\n\n match bson_util::get_int(ok) {\n\n Some(1) => Ok(()),\n\n Some(_) => Err(Error::authentication_error(\n\n auth_mechanism,\n\n response\n\n .get_str(\"errmsg\")\n\n .unwrap_or(\"Authentication failure\"),\n\n )),\n\n _ => Err(Error::invalid_authentication_response(auth_mechanism)),\n\n }\n\n}\n\n\n\n/// Encapsulates the parsing of the response to a `saslStart` or `saslContinue` command.\n\npub(super) struct SaslResponse {\n","file_path":"src/client/auth/sasl.rs","rank":24,"score":305110.2171570327},{"content":"fn results_match_inner(\n\n actual: Option<&Bson>,\n\n expected: &Bson,\n\n returns_root_documents: bool,\n\n root: bool,\n\n entities: Option<&EntityMap>,\n\n) -> bool {\n\n match expected {\n\n Bson::Document(expected_doc) => {\n\n if let Some((key, value)) = expected_doc.iter().next() {\n\n if key.starts_with(\"$$\") && expected_doc.len() == 1 {\n\n return special_operator_matches((key, value), actual, entities);\n\n }\n\n }\n\n\n\n let actual_doc = match actual {\n\n Some(Bson::Document(actual)) => actual,\n\n // The only case in which None is an acceptable value is if the expected document\n\n // is a special operator; otherwise, the two documents do not match.\n\n _ => return false,\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":25,"score":304289.13375166955},{"content":"fn command_events_match(\n\n actual: &ExpectedCommandEvent,\n\n expected: &ExpectedCommandEvent,\n\n entities: Option<&EntityMap>,\n\n) -> bool {\n\n match (actual, expected) {\n\n (\n\n ExpectedCommandEvent::Started {\n\n command_name: actual_command_name,\n\n database_name: actual_database_name,\n\n command: actual_command,\n\n has_service_id: actual_has_service_id,\n\n },\n\n ExpectedCommandEvent::Started {\n\n command_name: expected_command_name,\n\n database_name: expected_database_name,\n\n command: expected_command,\n\n has_service_id: expected_has_service_id,\n\n },\n\n ) => {\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":26,"score":304110.988217795},{"content":"fn special_operator_matches(\n\n (key, value): (&String, &Bson),\n\n actual: Option<&Bson>,\n\n entities: Option<&EntityMap>,\n\n) -> bool {\n\n match key.as_ref() {\n\n \"$$exists\" => value.as_bool().unwrap() == actual.is_some(),\n\n \"$$type\" => type_matches(value, actual.unwrap()),\n\n \"$$unsetOrMatches\" => {\n\n if actual.is_some() {\n\n results_match_inner(actual, value, false, false, entities)\n\n } else {\n\n true\n\n }\n\n }\n\n \"$$matchesEntity\" => {\n\n let id = value.as_str().unwrap();\n\n entity_matches(id, actual, entities.unwrap())\n\n }\n\n \"$$matchesHexBytes\" => panic!(\"GridFS not implemented\"),\n","file_path":"src/test/spec/unified_runner/matcher.rs","rank":27,"score":303143.95280064456},{"content":"/// Parses a string slice of the form \"<expected_key>=<body>\" into \"<body>\", if possible.\n\nfn parse_kvp(str: &str, expected_key: char) -> Result<String> {\n\n if !str.starts_with(expected_key) || str.chars().nth(1) != Some('=') {\n\n Err(Error::invalid_authentication_response(\"SCRAM\"))\n\n } else {\n\n Ok(str.chars().skip(2).collect())\n\n }\n\n}\n\n\n\n/// Model of the first message sent by the client.\n\n#[derive(Debug)]\n\npub(crate) struct ClientFirst {\n\n source: String,\n\n\n\n message: String,\n\n\n\n gs2_header: Range<usize>,\n\n\n\n bare: Range<usize>,\n\n\n\n nonce: String,\n","file_path":"src/client/auth/scram.rs","rank":28,"score":299435.13086473104},{"content":"pub fn get_default_name(description: &str) -> String {\n\n let mut db_name = description\n\n .replace('$', \"%\")\n\n .replace(' ', \"_\")\n\n .replace('.', \"_\");\n\n // database names must have fewer than 64 characters\n\n db_name.truncate(63);\n\n db_name\n\n}\n","file_path":"src/test/util/mod.rs","rank":29,"score":289962.7027574483},{"content":"/// Choose a server from several suitable choices within the latency window according to\n\n/// the algorithm laid out in the server selection specification.\n\nfn select_server_in_latency_window(in_window: Vec<&Arc<Server>>) -> Option<Arc<Server>> {\n\n if in_window.is_empty() {\n\n return None;\n\n } else if in_window.len() == 1 {\n\n return Some(in_window[0].clone());\n\n }\n\n\n\n let mut rng = SmallRng::from_entropy();\n\n in_window\n\n .choose_multiple(&mut rng, 2)\n\n .min_by_key(|s| s.operation_count())\n\n .map(|server| (*server).clone())\n\n}\n\n\n\nimpl TopologyDescription {\n\n pub(crate) fn server_selection_timeout_error_message(\n\n &self,\n\n criteria: &SelectionCriteria,\n\n ) -> String {\n\n if self.has_available_servers() {\n","file_path":"src/sdam/description/topology/server_selection/mod.rs","rank":30,"score":286272.05659868254},{"content":"fn write_concern_to_document(write_concern: &WriteConcern) -> Result<Document> {\n\n match bson::to_bson(&write_concern)? {\n\n Bson::Document(doc) => Ok(doc),\n\n _ => unreachable!(),\n\n }\n\n}\n","file_path":"src/test/spec/read_write_concern/mod.rs","rank":31,"score":282498.92169344064},{"content":"fn verify_max_staleness_inner(max_staleness: Option<Duration>) -> std::result::Result<(), String> {\n\n if max_staleness\n\n .map(|staleness| staleness > Duration::from_secs(0) && staleness < Duration::from_secs(90))\n\n .unwrap_or(false)\n\n {\n\n return Err(\"max staleness cannot be both positive and below 90 seconds\".into());\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"src/sdam/description/topology/mod.rs","rank":32,"score":278812.47671202},{"content":"fn build_test(\n\n db_name: &str,\n\n mut list_collections: ListCollections<Document>,\n\n mut expected_body: Document,\n\n) {\n\n let mut cmd = list_collections\n\n .build(&StreamDescription::new_testing())\n\n .expect(\"build should succeed\");\n\n assert_eq!(cmd.name, \"listCollections\");\n\n assert_eq!(cmd.target_db, db_name);\n\n\n\n bson_util::sort_document(&mut cmd.body);\n\n bson_util::sort_document(&mut expected_body);\n\n\n\n assert_eq!(cmd.body, expected_body);\n\n}\n\n\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test)]\n\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\n\nasync fn build() {\n","file_path":"src/operation/list_collections/test.rs","rank":33,"score":278550.35175049736},{"content":"pub fn deserialize_server_api_test_format<'de, D>(\n\n deserializer: D,\n\n) -> std::result::Result<Option<ServerApi>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n #[derive(Debug, Deserialize)]\n\n #[serde(rename_all = \"camelCase\", deny_unknown_fields)]\n\n struct ApiHelper {\n\n version: ServerApiVersion,\n\n strict: Option<bool>,\n\n deprecation_errors: Option<bool>,\n\n }\n\n\n\n let h = ApiHelper::deserialize(deserializer)?;\n\n Ok(Some(ServerApi {\n\n version: h.version,\n\n strict: h.strict,\n\n deprecation_errors: h.deprecation_errors,\n\n }))\n\n}\n\n\n","file_path":"src/test/spec/unified_runner/test_file.rs","rank":34,"score":270240.0075215334},{"content":"/// A `GenericCursor` that optionally owns its own sessions.\n\n/// This is to be used by cursors associated with implicit sessions.\n\ntype ImplicitSessionCursor<T> = GenericCursor<ImplicitSessionGetMoreProvider<T>, T>;\n\n\n","file_path":"src/cursor/mod.rs","rank":35,"score":265974.0368641804},{"content":"fn deserialize_pool_created<'de, D>(deserializer: D) -> Result<PoolCreatedEvent, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let helper = PoolCreatedEventHelper::deserialize(deserializer)?;\n\n\n\n // The CMAP spec tests use \"42\" as a placeholder in the expected events to indicate that the\n\n // driver should assert that a value is present without any constraints on the value itself.\n\n // This idiom is used for the connection pool creation options even when no options are\n\n // specified, meaning that there isn't any useful assertion we can do based on this value.\n\n // Because of this, we deserialize the value `42` into `None` for the options, which prevents\n\n // deserialization failure due to an unexpected type. For other integer values, we raise an\n\n // error indicating that we expect `42` instead.\n\n let options = match helper.options {\n\n Some(PoolOptionsHelper::Options(opts)) => Some(opts),\n\n Some(PoolOptionsHelper::Number(42)) | None => None,\n\n Some(PoolOptionsHelper::Number(other)) => {\n\n return Err(serde::de::Error::invalid_value(\n\n Unexpected::Unsigned(other),\n\n &\"42\",\n","file_path":"src/cmap/test/event.rs","rank":36,"score":265779.7435372267},{"content":"fn is_auth_error(error: Error) -> bool {\n\n matches!(*error.kind, ErrorKind::Authentication { .. })\n\n}\n\n\n\n/// Performs an operation that requires authentication and verifies that it either succeeded or\n\n/// failed with an authentication error according to the `should_succeed` parameter.\n\nasync fn auth_test(client: Client, should_succeed: bool) {\n\n let result = client.list_database_names(None, None).await;\n\n if should_succeed {\n\n result.expect(\"operation should have succeeded\");\n\n } else {\n\n assert!(is_auth_error(result.unwrap_err()));\n\n }\n\n}\n\n\n\n/// Attempts to authenticate using the given username/password, optionally specifying a mechanism\n\n/// via the `ClientOptions` api.\n\n///\n\n/// Asserts that the authentication's success matches the provided parameter.\n\nasync fn auth_test_options(\n","file_path":"src/test/client.rs","rank":37,"score":262535.1168613922},{"content":"fn default_hosts() -> Vec<ServerAddress> {\n\n vec![ServerAddress::default()]\n\n}\n\n\n\nimpl Default for ClientOptions {\n\n fn default() -> Self {\n\n Self::builder().build()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nimpl Serialize for ClientOptions {\n\n fn serialize<S>(&self, serializer: S) -> std::result::Result<S::Ok, S::Error>\n\n where\n\n S: serde::Serializer,\n\n {\n\n #[derive(Serialize)]\n\n struct ClientOptionsHelper<'a> {\n\n appname: &'a Option<String>,\n\n\n","file_path":"src/client/options/mod.rs","rank":38,"score":254091.44293305412},{"content":"fn filter_servers_by_tag_sets(servers: &mut Vec<&ServerDescription>, tag_sets: &[TagSet]) {\n\n if tag_sets.is_empty() {\n\n return;\n\n }\n\n\n\n for tag_set in tag_sets {\n\n let matches_tag_set = |server: &&ServerDescription| server.matches_tag_set(tag_set);\n\n\n\n if servers.iter().any(matches_tag_set) {\n\n servers.retain(matches_tag_set);\n\n\n\n return;\n\n }\n\n }\n\n\n\n servers.clear();\n\n}\n","file_path":"src/sdam/description/topology/server_selection/mod.rs","rank":39,"score":252211.84989622014},{"content":"fn get_int(value: &Bson) -> Option<i64> {\n\n bson_util::get_int(value).or_else(|| value.as_document().and_then(parse_i64_ext_json))\n\n}\n","file_path":"src/test/util/matchable.rs","rank":40,"score":250946.94710038512},{"content":"fn convert_read_preference(test_read_pref: TestReadPreference) -> Option<ReadPreference> {\n\n let max_staleness = test_read_pref\n\n .max_staleness_seconds\n\n .map(Duration::from_secs);\n\n let options = ReadPreferenceOptions::builder()\n\n .tag_sets(test_read_pref.tag_sets)\n\n .max_staleness(max_staleness)\n\n .build();\n\n\n\n let read_pref = match &test_read_pref.mode.as_ref()?[..] {\n\n \"Primary\" => ReadPreference::Primary,\n\n \"Secondary\" => ReadPreference::Secondary { options },\n\n \"PrimaryPreferred\" => ReadPreference::PrimaryPreferred { options },\n\n \"SecondaryPreferred\" => ReadPreference::SecondaryPreferred { options },\n\n \"Nearest\" => ReadPreference::Nearest { options },\n\n m => panic!(\"invalid read preference mode: {}\", m),\n\n };\n\n\n\n Some(read_pref)\n\n}\n","file_path":"src/sdam/description/topology/server_selection/test/logic.rs","rank":41,"score":249932.87804179374},{"content":"fn normalize_write_concern_doc(mut write_concern_doc: Document) -> Document {\n\n if let Some(w_timeout) = write_concern_doc.remove(\"wtimeout\") {\n\n write_concern_doc.insert(\"wtimeoutMS\", w_timeout);\n\n }\n\n\n\n if let Some(j) = write_concern_doc.remove(\"j\") {\n\n write_concern_doc.insert(\"journal\", j);\n\n }\n\n\n\n write_concern_doc\n\n}\n\n\n\nasync fn run_connection_string_test(test_file: TestFile) {\n\n for test_case in test_file.tests {\n\n match ClientOptions::parse(&test_case.uri).await {\n\n Ok(options) => {\n\n assert!(test_case.valid);\n\n\n\n if let Some(ref expected_read_concern) = test_case.read_concern {\n\n let mut actual_read_concern = Document::new();\n","file_path":"src/test/spec/read_write_concern/connection_string.rs","rank":42,"score":247860.92137991614},{"content":"fn write_concern_from_document(write_concern_doc: Document) -> Option<WriteConcern> {\n\n let mut write_concern = WriteConcern::default();\n\n\n\n for (key, value) in write_concern_doc {\n\n match (&key[..], value) {\n\n (\"w\", Bson::Int32(i)) => {\n\n write_concern.w = Some(Acknowledgment::from(i as u32));\n\n }\n\n (\"w\", Bson::String(s)) => {\n\n write_concern.w = Some(Acknowledgment::from(s));\n\n }\n\n (\"journal\", Bson::Boolean(b)) => {\n\n write_concern.journal = Some(b);\n\n }\n\n (\"wtimeoutMS\", Bson::Int32(i)) if i > 0 => {\n\n write_concern.w_timeout = Some(Duration::from_millis(i as u64));\n\n }\n\n (\"wtimeoutMS\", Bson::Int32(_)) => {\n\n // WriteConcern has an unsigned integer for the wtimeout field, so this is\n\n // impossible to test.\n","file_path":"src/test/spec/read_write_concern/document.rs","rank":43,"score":247430.51792253018},{"content":"fn parse_i64_ext_json(doc: &Document) -> Option<i64> {\n\n let number_string = doc.get(\"$numberLong\").and_then(Bson::as_str)?;\n\n number_string.parse::<i64>().ok()\n\n}\n\n\n","file_path":"src/test/util/matchable.rs","rank":44,"score":243411.76368410868},{"content":"fn kill_cursors_sent(client: &EventClient) -> bool {\n\n !client\n\n .get_command_started_events(&[\"killCursors\"])\n\n .is_empty()\n\n}\n\n\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test)]\n\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\n\n#[function_name::named]\n\nasync fn kill_cursors_on_drop() {\n\n let _guard: RwLockReadGuard<()> = LOCK.run_concurrently().await;\n\n\n\n let client = TestClient::new().await;\n\n let db = client.database(function_name!());\n\n let coll = db.collection(function_name!());\n\n\n\n drop_collection(&coll).await;\n\n\n\n coll.insert_many(vec![doc! { \"x\": 1 }, doc! { \"x\": 2 }], None)\n\n .await\n","file_path":"src/test/coll.rs","rank":45,"score":240330.6499468784},{"content":"#[derive(Clone, Copy, Debug, Deserialize)]\n\nenum TestServerType {\n\n Standalone,\n\n Mongos,\n\n #[serde(rename = \"RSPrimary\")]\n\n RsPrimary,\n\n #[serde(rename = \"RSSecondary\")]\n\n RsSecondary,\n\n #[serde(rename = \"RSArbiter\")]\n\n RsArbiter,\n\n #[serde(rename = \"RSOther\")]\n\n RsOther,\n\n #[serde(rename = \"RSGhost\")]\n\n RsGhost,\n\n LoadBalancer,\n\n Unknown,\n\n PossiblePrimary,\n\n}\n\n\n\nimpl TestServerType {\n\n fn into_server_type(self) -> Option<ServerType> {\n","file_path":"src/sdam/description/topology/server_selection/test/mod.rs","rank":46,"score":240095.55947482245},{"content":"/// A `GenericCursor` that borrows its session.\n\n/// This is to be used with cursors associated with explicit sessions borrowed from the user.\n\ntype ExplicitSessionCursor<'session, T> =\n\n GenericCursor<ExplicitSessionGetMoreProvider<'session, T>, T>;\n\n\n\n/// A type that implements [`Stream`](https://docs.rs/futures/latest/futures/stream/index.html) which can be used to\n\n/// stream the results of a [`SessionCursor`]. Returned from [`SessionCursor::stream`].\n\n///\n\n/// This updates the buffer of the parent [`SessionCursor`] when dropped. [`SessionCursor::next`] or\n\n/// any further streams created from [`SessionCursor::stream`] will pick up where this one left off.\n\npub struct SessionCursorStream<'cursor, 'session, T = Document>\n\nwhere\n\n T: DeserializeOwned + Unpin + Send + Sync,\n\n{\n\n session_cursor: &'cursor mut SessionCursor<T>,\n\n generic_cursor: ExplicitSessionCursor<'session, T>,\n\n}\n\n\n\nimpl<'cursor, 'session, T> Stream for SessionCursorStream<'cursor, 'session, T>\n\nwhere\n\n T: DeserializeOwned + Unpin + Send + Sync,\n\n{\n","file_path":"src/cursor/session.rs","rank":47,"score":235125.57083806815},{"content":"struct ImplicitSessionGetMoreResult<T> {\n\n get_more_result: Result<GetMoreResult<T>>,\n\n session: Option<Box<ClientSession>>,\n\n}\n\n\n\nimpl<T> GetMoreProviderResult for ImplicitSessionGetMoreResult<T> {\n\n type Session = Option<Box<ClientSession>>;\n\n type DocumentType = T;\n\n\n\n fn as_ref(&self) -> std::result::Result<&GetMoreResult<T>, &Error> {\n\n self.get_more_result.as_ref()\n\n }\n\n\n\n fn into_parts(self) -> (Result<GetMoreResult<T>>, Self::Session) {\n\n (self.get_more_result, self.session)\n\n }\n\n}\n\n\n","file_path":"src/cursor/mod.rs","rank":48,"score":234431.21157068707},{"content":"fn build_test(\n\n ns: Namespace,\n\n filter: Option<Document>,\n\n options: Option<FindOptions>,\n\n mut expected_body: Document,\n\n) {\n\n let mut find = Find::<Document>::new(ns.clone(), filter, options);\n\n\n\n let mut cmd = find.build(&StreamDescription::new_testing()).unwrap();\n\n\n\n assert_eq!(cmd.name.as_str(), \"find\");\n\n assert_eq!(cmd.target_db.as_str(), ns.db.as_str());\n\n\n\n bson_util::sort_document(&mut expected_body);\n\n bson_util::sort_document(&mut cmd.body);\n\n\n\n assert_eq!(cmd.body, expected_body);\n\n}\n\n\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test)]\n","file_path":"src/operation/find/test.rs","rank":49,"score":234279.07089266842},{"content":"fn build_test(\n\n target: impl Into<AggregateTarget>,\n\n pipeline: Vec<Document>,\n\n options: Option<AggregateOptions>,\n\n mut expected_body: Document,\n\n) {\n\n let target = target.into();\n\n\n\n let mut aggregate = Aggregate::new(target.clone(), pipeline, options);\n\n\n\n let mut cmd = aggregate.build(&StreamDescription::new_testing()).unwrap();\n\n\n\n assert_eq!(cmd.name.as_str(), \"aggregate\");\n\n assert_eq!(cmd.target_db.as_str(), target.db_name());\n\n\n\n bson_util::sort_document(&mut expected_body);\n\n bson_util::sort_document(&mut cmd.body);\n\n\n\n assert_eq!(cmd.body, expected_body);\n\n}\n","file_path":"src/operation/aggregate/test.rs","rank":50,"score":234279.07089266842},{"content":"fn build_test(\n\n ns: Namespace,\n\n cursor_id: i64,\n\n address: ServerAddress,\n\n batch_size: Option<u32>,\n\n max_time: Option<Duration>,\n\n mut expected_body: Document,\n\n) {\n\n let info = CursorInformation {\n\n ns: ns.clone(),\n\n id: cursor_id,\n\n address,\n\n batch_size,\n\n max_time,\n\n };\n\n let mut get_more = GetMore::<Document>::new(info, None);\n\n\n\n let build_result = get_more.build(&StreamDescription::new_testing());\n\n assert!(build_result.is_ok());\n\n\n","file_path":"src/operation/get_more/test.rs","rank":51,"score":234279.07089266842},{"content":"#[test]\n\n#[function_name::named]\n\nfn typed_collection() {\n\n let _guard: RwLockReadGuard<()> = RUNTIME.block_on(async { LOCK.run_concurrently().await });\n\n\n\n let options = CLIENT_OPTIONS.clone();\n\n let client = Client::with_options(options).expect(\"client creation should succeed\");\n\n let coll = init_db_and_typed_coll(&client, function_name!(), function_name!());\n\n\n\n #[derive(Serialize, Deserialize, Debug)]\n\n struct MyType {\n\n x: i32,\n\n str: String,\n\n }\n\n let my_type = MyType {\n\n x: 1,\n\n str: \"hello\".into(),\n\n };\n\n\n\n assert!(coll.insert_one(my_type, None).is_ok());\n\n}\n\n\n","file_path":"src/sync/test.rs","rank":52,"score":229626.1076862439},{"content":"pub trait TestOperation: Debug {\n\n fn execute_on_collection<'a>(\n\n &'a self,\n\n _collection: &'a Collection<Document>,\n\n _session: Option<&'a mut ClientSession>,\n\n ) -> BoxFuture<'a, Result<Option<Bson>>> {\n\n todo!()\n\n }\n\n\n\n fn execute_on_database<'a>(\n\n &'a self,\n\n _database: &'a Database,\n\n _session: Option<&'a mut ClientSession>,\n\n ) -> BoxFuture<'a, Result<Option<Bson>>> {\n\n todo!()\n\n }\n\n\n\n fn execute_on_client<'a>(\n\n &'a self,\n\n _client: &'a TestClient,\n","file_path":"src/test/spec/v2_runner/operation.rs","rank":53,"score":228478.58809445353},{"content":"pub trait TestOperation: Debug {\n\n fn execute_test_runner_operation<'a>(\n\n &'a self,\n\n _test_runner: &'a mut TestRunner,\n\n ) -> BoxFuture<'a, ()> {\n\n todo!()\n\n }\n\n\n\n fn execute_entity_operation<'a>(\n\n &'a self,\n\n _id: &'a str,\n\n _test_runner: &'a mut TestRunner,\n\n ) -> BoxFuture<'a, Result<Option<Entity>>> {\n\n todo!()\n\n }\n\n\n\n /// Whether or not this operation returns an array of root documents. This information is\n\n /// necessary to determine how the return value of an operation should be compared to the\n\n /// expected value.\n\n fn returns_root_documents(&self) -> bool {\n","file_path":"src/test/spec/unified_runner/operation.rs","rank":54,"score":228478.58809445353},{"content":"#[test]\n\nfn client_options() {\n\n let _guard: RwLockReadGuard<()> = RUNTIME.block_on(async { LOCK.run_concurrently().await });\n\n\n\n let mut options = ClientOptions::parse(\"mongodb://localhost:27017/\").unwrap();\n\n\n\n options.original_uri.take();\n\n\n\n assert_eq!(\n\n options,\n\n ClientOptions::builder()\n\n .hosts(vec![ServerAddress::Tcp {\n\n host: \"localhost\".into(),\n\n port: Some(27017)\n\n }])\n\n .build()\n\n );\n\n}\n\n\n","file_path":"src/sync/test.rs","rank":55,"score":228031.369062021},{"content":"/// The number of digits in `n` in base 10.\n\n/// Useful for calculating the size of an array entry in BSON.\n\nfn num_decimal_digits(mut n: usize) -> u64 {\n\n let mut digits = 0;\n\n\n\n loop {\n\n n /= 10;\n\n digits += 1;\n\n\n\n if n == 0 {\n\n return digits;\n\n }\n\n }\n\n}\n\n\n\n/// Read a document's raw BSON bytes from the provided reader.\n\npub(crate) fn read_document_bytes<R: Read>(mut reader: R) -> Result<Vec<u8>> {\n\n let length = reader.read_i32()?;\n\n\n\n let mut bytes = Vec::with_capacity(length as usize);\n\n bytes.write_i32(length)?;\n\n\n","file_path":"src/bson_util/mod.rs","rank":56,"score":227748.84857047375},{"content":"struct DroppedClientSession {\n\n cluster_time: Option<ClusterTime>,\n\n server_session: ServerSession,\n\n client: Client,\n\n is_implicit: bool,\n\n options: Option<SessionOptions>,\n\n transaction: Transaction,\n\n snapshot_time: Option<Timestamp>,\n\n}\n\n\n\nimpl From<DroppedClientSession> for ClientSession {\n\n fn from(dropped_session: DroppedClientSession) -> Self {\n\n Self {\n\n cluster_time: dropped_session.cluster_time,\n\n server_session: dropped_session.server_session,\n\n client: dropped_session.client,\n\n is_implicit: dropped_session.is_implicit,\n\n options: dropped_session.options,\n\n transaction: dropped_session.transaction,\n\n snapshot_time: dropped_session.snapshot_time,\n","file_path":"src/client/session/mod.rs","rank":57,"score":225096.78556242224},{"content":"pub fn eq_matches<T: PartialEq + Debug>(\n\n name: &str,\n\n actual: &T,\n\n expected: &T,\n\n) -> Result<(), String> {\n\n if actual != expected {\n\n return Err(format!(\n\n \"expected {} {:?}, got {:?}\",\n\n name, expected, actual\n\n ));\n\n }\n\n Ok(())\n\n}\n\n\n\nimpl Matchable for Bson {\n\n fn is_placeholder(&self) -> bool {\n\n if let Bson::String(string) = self {\n\n string.as_str() == \"42\" || string.as_str() == \"\"\n\n } else {\n\n get_int(self) == Some(42)\n","file_path":"src/test/util/matchable.rs","rank":58,"score":222204.0593616229},{"content":"#[test]\n\n#[function_name::named]\n\nfn client() {\n\n let _guard: RwLockReadGuard<()> = RUNTIME.block_on(async { LOCK.run_concurrently().await });\n\n\n\n let options = CLIENT_OPTIONS.clone();\n\n let client = Client::with_options(options).expect(\"client creation should succeed\");\n\n\n\n client\n\n .database(function_name!())\n\n .collection(function_name!())\n\n .insert_one(Document::new(), None)\n\n .expect(\"insert should succeed\");\n\n\n\n let db_names = client\n\n .list_database_names(None, None)\n\n .expect(\"list_database_names should succeed\");\n\n assert!(db_names.contains(&function_name!().to_string()));\n\n}\n\n\n","file_path":"src/sync/test.rs","rank":59,"score":215615.55225592648},{"content":"fn verify_description_outcome(\n\n outcome: DescriptionOutcome,\n\n topology_description: TopologyDescription,\n\n test_description: &str,\n\n phase_description: String,\n\n) {\n\n assert_eq!(\n\n topology_description.topology_type, outcome.topology_type,\n\n \"{}: {}\",\n\n test_description, phase_description\n\n );\n\n\n\n assert_eq!(\n\n topology_description.set_name, outcome.set_name,\n\n \"{}: {}\",\n\n test_description, phase_description,\n\n );\n\n\n\n let expected_timeout = outcome\n\n .logical_session_timeout_minutes\n","file_path":"src/sdam/description/topology/test/sdam.rs","rank":60,"score":212007.03715108067},{"content":"fn deserialize_uri_options_to_uri_string_option<'de, D>(\n\n deserializer: D,\n\n) -> std::result::Result<Option<String>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let uri_options = Document::deserialize(deserializer)?;\n\n Ok(Some(merge_uri_options(&DEFAULT_URI, Some(&uri_options))))\n\n}\n\n\n\n#[derive(Debug, Deserialize)]\n\npub struct Outcome {\n\n pub collection: CollectionOutcome,\n\n}\n\n\n\nimpl Outcome {\n\n pub async fn matches_actual(\n\n self,\n\n db_name: String,\n\n coll_name: String,\n","file_path":"src/test/spec/v2_runner/test_file.rs","rank":61,"score":210670.0606849346},{"content":"#[allow(dead_code)]\n\ntype Result<T> = std::result::Result<T, Err>;\n\n\n\n#[cfg(not(feature = \"sync\"))]\n\nasync fn _connecting() -> Result<()> {\n\n use mongodb::{options::ClientOptions, Client};\n\n\n\n // Parse a connection string into an options struct.\n\n let mut client_options = ClientOptions::parse(\"mongodb://localhost:27017\").await?;\n\n\n\n // Manually set an option.\n\n client_options.app_name = Some(\"My App\".to_string());\n\n\n\n // Get a handle to the deployment.\n\n let client = Client::with_options(client_options)?;\n\n\n\n // List the names of the databases in that deployment.\n\n for db_name in client.list_database_names(None, None).await? {\n\n println!(\"{}\", db_name);\n\n }\n\n\n","file_path":"tests/readme_examples.rs","rank":62,"score":209863.59493974975},{"content":"fn deserialize_checkout_failed<'de, D>(\n\n deserializer: D,\n\n) -> Result<ConnectionCheckoutFailedEvent, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let helper = ConnectionCheckoutFailedHelper::deserialize(deserializer)?;\n\n\n\n // The driver doesn't have a concept of a \"closed pool\", instead having the pool closed when the\n\n // pool is dropped. Because of this, the driver doesn't implement the \"poolClosed\" reason for a\n\n // connection checkout failure. While we skip over the corresponding tests in our spec test\n\n // runner, we still need to be able to deserialize the \"poolClosed\" reason to avoid the test\n\n // harness panicking, so we arbitrarily map the \"poolClosed\" to \"connectionError\".\n\n let reason = match helper.reason {\n\n CheckoutFailedReasonHelper::PoolClosed | CheckoutFailedReasonHelper::ConnectionError => {\n\n ConnectionCheckoutFailedReason::ConnectionError\n\n }\n\n CheckoutFailedReasonHelper::Timeout => ConnectionCheckoutFailedReason::Timeout,\n\n };\n\n\n\n Ok(ConnectionCheckoutFailedEvent {\n\n address: ServerAddress::Tcp {\n\n host: Default::default(),\n\n port: None,\n\n },\n\n reason,\n\n })\n\n}\n","file_path":"src/cmap/test/event.rs","rank":63,"score":207615.16110561707},{"content":"fn deserialize_op<'de, 'a, T: 'a + Deserialize<'de> + TestOperation>(\n\n value: Bson,\n\n) -> std::result::Result<Box<dyn TestOperation + 'a>, bson::de::Error> {\n\n T::deserialize(BsonDeserializer::new(value)).map(|op| Box::new(op) as Box<dyn TestOperation>)\n\n}\n\n\n\nimpl<'de> Deserialize<'de> for Operation {\n\n fn deserialize<D: Deserializer<'de>>(deserializer: D) -> std::result::Result<Self, D::Error> {\n\n #[derive(Debug, Deserialize)]\n\n #[serde(rename_all = \"camelCase\", deny_unknown_fields)]\n\n struct OperationDefinition {\n\n pub name: String,\n\n pub object: OperationObject,\n\n #[serde(default = \"default_arguments\")]\n\n pub arguments: Bson,\n\n pub expect_error: Option<ExpectError>,\n\n pub expect_result: Option<Bson>,\n\n pub save_result_as_entity: Option<String>,\n\n pub ignore_result_and_error: Option<bool>,\n\n }\n","file_path":"src/test/spec/unified_runner/operation.rs","rank":64,"score":205825.41871324176},{"content":"fn make_lookup_hosts(hosts: Vec<ServerAddress>) -> Result<LookupHosts> {\n\n Ok(LookupHosts {\n\n hosts: hosts.into_iter().map(Result::Ok).collect(),\n\n min_ttl: Duration::from_secs(60),\n\n })\n\n}\n\n\n\n// If a new DNS record is returned, it should be reflected in the topology.\n\n#[cfg_attr(feature = \"tokio-runtime\", tokio::test)]\n\n#[cfg_attr(feature = \"async-std-runtime\", async_std::test)]\n\nasync fn add_new_dns_record() {\n\n let hosts = vec![\n\n localhost_test_build_10gen(27017),\n\n localhost_test_build_10gen(27018),\n\n localhost_test_build_10gen(27019),\n\n ];\n\n\n\n run_test(Ok(hosts.clone()), hosts.into_iter().collect()).await;\n\n}\n\n\n","file_path":"src/sdam/srv_polling/test.rs","rank":65,"score":205743.22237066732},{"content":" ///\n\n /// ```rust\n\n /// # use mongodb::{bson::{doc, Document}, error::Result, Client, ClientSession};\n\n /// #\n\n /// # async fn do_stuff() -> Result<()> {\n\n /// # let client = Client::with_uri_str(\"mongodb://example.com\").await?;\n\n /// # let coll = client.database(\"foo\").collection::<Document>(\"bar\");\n\n /// # let mut session = client.start_session(None).await?;\n\n /// session.start_transaction(None).await?;\n\n /// let result = coll.insert_one_with_session(doc! { \"x\": 1 }, None, &mut session).await?;\n\n /// session.commit_transaction().await?;\n\n /// # Ok(())\n\n /// # }\n\n /// ```\n\n ///\n\n /// This operation will retry once upon failure if the connection and encountered error support\n\n /// retryability. See the documentation\n\n /// [here](https://docs.mongodb.com/manual/core/retryable-writes/) for more information on\n\n /// retryable writes.\n\n pub async fn commit_transaction(&mut self) -> Result<()> {\n","file_path":"src/client/session/mod.rs","rank":66,"score":204404.15752563634},{"content":" /// ```rust\n\n /// # use mongodb::{bson::{doc, Document}, error::Result, Client, ClientSession};\n\n /// #\n\n /// # async fn do_stuff() -> Result<()> {\n\n /// # let client = Client::with_uri_str(\"mongodb://example.com\").await?;\n\n /// # let coll = client.database(\"foo\").collection::<Document>(\"bar\");\n\n /// # let mut session = client.start_session(None).await?;\n\n /// session.start_transaction(None).await?;\n\n /// let result = coll.insert_one_with_session(doc! { \"x\": 1 }, None, &mut session).await?;\n\n /// session.commit_transaction().await?;\n\n /// # Ok(())\n\n /// # }\n\n /// ```\n\n pub async fn start_transaction(\n\n &mut self,\n\n options: impl Into<Option<TransactionOptions>>,\n\n ) -> Result<()> {\n\n if self\n\n .options\n\n .as_ref()\n","file_path":"src/client/session/mod.rs","rank":67,"score":204403.84029220615},{"content":"/// # Client,\n\n/// ClientSession,\n\n/// Collection,\n\n/// };\n\n///\n\n/// # async fn do_stuff() -> Result<()> {\n\n/// # let client = Client::with_uri_str(\"mongodb://example.com\").await?;\n\n/// # let coll: Collection<Document> = client.database(\"foo\").collection(\"bar\");\n\n/// let mut session = client.start_session(None).await?;\n\n/// let options = TransactionOptions::builder()\n\n/// .read_concern(ReadConcern::majority())\n\n/// .write_concern(WriteConcern::builder().w(Acknowledgment::Majority).build())\n\n/// .build();\n\n/// session.start_transaction(options).await?;\n\n/// // A \"TransientTransactionError\" label indicates that the entire transaction can be retried\n\n/// // with a reasonable expectation that it will succeed.\n\n/// while let Err(error) = execute_transaction(&coll, &mut session).await {\n\n/// if !error.contains_label(TRANSIENT_TRANSACTION_ERROR) {\n\n/// break;\n\n/// }\n","file_path":"src/client/session/mod.rs","rank":68,"score":204400.3539588376},{"content":" ///\n\n /// ```rust\n\n /// # use mongodb::{bson::{doc, Document}, error::Result, Client, ClientSession, Collection};\n\n /// #\n\n /// # async fn do_stuff() -> Result<()> {\n\n /// # let client = Client::with_uri_str(\"mongodb://example.com\").await?;\n\n /// # let coll = client.database(\"foo\").collection::<Document>(\"bar\");\n\n /// # let mut session = client.start_session(None).await?;\n\n /// session.start_transaction(None).await?;\n\n /// match execute_transaction(&coll, &mut session).await {\n\n /// Ok(_) => session.commit_transaction().await?,\n\n /// Err(_) => session.abort_transaction().await?,\n\n /// }\n\n /// # Ok(())\n\n /// # }\n\n ///\n\n /// async fn execute_transaction(coll: &Collection<Document>, session: &mut ClientSession) -> Result<()> {\n\n /// coll.insert_one_with_session(doc! { \"x\": 1 }, None, session).await?;\n\n /// coll.delete_one_with_session(doc! { \"y\": 2 }, None, session).await?;\n\n /// Ok(())\n","file_path":"src/client/session/mod.rs","rank":69,"score":204398.21583642391},{"content":"mod cluster_time;\n\nmod pool;\n\n#[cfg(test)]\n\nmod test;\n\n\n\nuse std::{\n\n collections::HashSet,\n\n sync::Arc,\n\n time::{Duration, Instant},\n\n};\n\n\n\nuse lazy_static::lazy_static;\n\nuse uuid::Uuid;\n\n\n\nuse crate::{\n\n bson::{doc, spec::BinarySubtype, Binary, Bson, Document, Timestamp},\n\n cmap::conn::PinnedConnectionHandle,\n\n error::{ErrorKind, Result},\n\n operation::{AbortTransaction, CommitTransaction, Operation},\n\n options::{SessionOptions, TransactionOptions},\n","file_path":"src/client/session/mod.rs","rank":70,"score":204395.75308719042},{"content":" } else {\n\n let client = self.client.clone();\n\n let server_session = self.server_session.clone();\n\n RUNTIME.execute(async move {\n\n client.check_in_server_session(server_session).await;\n\n });\n\n }\n\n }\n\n}\n\n\n\n/// Client side abstraction of a server session. These are pooled and may be associated with\n\n/// multiple `ClientSession`s over the course of their lifetime.\n\n#[derive(Clone, Debug)]\n\npub(crate) struct ServerSession {\n\n /// The id of the server session to which this corresponds.\n\n id: Document,\n\n\n\n /// The last time an operation was executed with this session.\n\n last_use: std::time::Instant,\n\n\n","file_path":"src/client/session/mod.rs","rank":71,"score":204391.69299058433},{"content":" sdam::{ServerInfo, TransactionSupportStatus},\n\n selection_criteria::SelectionCriteria,\n\n Client,\n\n RUNTIME,\n\n};\n\npub use cluster_time::ClusterTime;\n\npub(super) use pool::ServerSessionPool;\n\n\n\nuse super::options::ServerAddress;\n\n\n\nlazy_static! {\n\n pub(crate) static ref SESSIONS_UNSUPPORTED_COMMANDS: HashSet<&'static str> = {\n\n let mut hash_set = HashSet::new();\n\n hash_set.insert(\"killcursors\");\n\n hash_set.insert(\"parallelcollectionscan\");\n\n hash_set\n\n };\n\n}\n\n\n\n/// A MongoDB client session. This struct represents a logical session used for ordering sequential\n","file_path":"src/client/session/mod.rs","rank":72,"score":204390.31134917526},{"content":" }\n\n\n\n /// Whether this session is dirty.\n\n #[cfg(test)]\n\n pub(crate) fn is_dirty(&self) -> bool {\n\n self.server_session.dirty\n\n }\n\n\n\n /// Starts a new transaction on this session with the given `TransactionOptions`. If no options\n\n /// are provided, the session's `defaultTransactionOptions` will be used. This session must\n\n /// be passed into each operation within the transaction; otherwise, the operation will be\n\n /// executed outside of the transaction.\n\n ///\n\n /// Errors returned from operations executed within a transaction may include a\n\n /// [`crate::error::TRANSIENT_TRANSACTION_ERROR`] label. This label indicates that the entire\n\n /// transaction can be retried with a reasonable expectation that it will succeed.\n\n ///\n\n /// Transactions are supported on MongoDB 4.0+. The Rust driver currently only supports\n\n /// transactions on replica sets.\n\n ///\n","file_path":"src/client/session/mod.rs","rank":73,"score":204388.8334171932},{"content":"/// operations. To create a `ClientSession`, call `start_session` on a `Client`.\n\n///\n\n/// `ClientSession` instances are not thread safe or fork safe. They can only be used by one thread\n\n/// or process at a time.\n\n///\n\n/// ## Transactions\n\n/// Transactions are used to execute a series of operations across multiple documents and\n\n/// collections atomically. For more information about when and how to use transactions in MongoDB,\n\n/// see the [manual](https://docs.mongodb.com/manual/core/transactions/).\n\n///\n\n/// Replica set transactions are supported on MongoDB 4.0+. Sharded transactions are supported on\n\n/// MongoDDB 4.2+. Transactions are associated with a `ClientSession`. To begin a transaction, call\n\n/// [`ClientSession::start_transaction`] on a `ClientSession`. The `ClientSession` must be passed to\n\n/// operations to be executed within the transaction.\n\n///\n\n/// ```rust\n\n/// use mongodb::{\n\n/// bson::{doc, Document},\n\n/// error::{Result, TRANSIENT_TRANSACTION_ERROR, UNKNOWN_TRANSACTION_COMMIT_RESULT},\n\n/// options::{Acknowledgment, ReadConcern, TransactionOptions, WriteConcern},\n","file_path":"src/client/session/mod.rs","rank":74,"score":204385.32189611052},{"content":" }\n\n }\n\n}\n\n\n\nimpl Drop for ClientSession {\n\n fn drop(&mut self) {\n\n if self.transaction.state == TransactionState::InProgress {\n\n let dropped_session = DroppedClientSession {\n\n cluster_time: self.cluster_time.clone(),\n\n server_session: self.server_session.clone(),\n\n client: self.client.clone(),\n\n is_implicit: self.is_implicit,\n\n options: self.options.clone(),\n\n transaction: self.transaction.take(),\n\n snapshot_time: self.snapshot_time,\n\n };\n\n RUNTIME.execute(async move {\n\n let mut session: ClientSession = dropped_session.into();\n\n let _result = session.abort_transaction().await;\n\n });\n","file_path":"src/client/session/mod.rs","rank":75,"score":204383.52251215195},{"content":"impl ClientSession {\n\n /// Creates a new `ClientSession` wrapping the provided server session.\n\n pub(crate) fn new(\n\n server_session: ServerSession,\n\n client: Client,\n\n options: Option<SessionOptions>,\n\n is_implicit: bool,\n\n ) -> Self {\n\n Self {\n\n client,\n\n server_session,\n\n cluster_time: None,\n\n is_implicit,\n\n options,\n\n transaction: Default::default(),\n\n snapshot_time: None,\n\n }\n\n }\n\n\n\n /// The client used to create this session.\n","file_path":"src/client/session/mod.rs","rank":76,"score":204382.5026337076},{"content":"/// }\n\n/// # Ok(())\n\n/// # }\n\n///\n\n/// async fn execute_transaction(coll: &Collection<Document>, session: &mut ClientSession) -> Result<()> {\n\n/// coll.insert_one_with_session(doc! { \"x\": 1 }, None, session).await?;\n\n/// coll.delete_one_with_session(doc! { \"y\": 2 }, None, session).await?;\n\n/// // An \"UnknownTransactionCommitResult\" label indicates that it is unknown whether the\n\n/// // commit has satisfied the write concern associated with the transaction. If an error\n\n/// // with this label is returned, it is safe to retry the commit until the write concern is\n\n/// // satisfied or an error without the label is returned.\n\n/// loop {\n\n/// let result = session.commit_transaction().await;\n\n/// if let Err(ref error) = result {\n\n/// if error.contains_label(UNKNOWN_TRANSACTION_COMMIT_RESULT) {\n\n/// continue;\n\n/// }\n\n/// }\n\n/// result?\n\n/// }\n","file_path":"src/client/session/mod.rs","rank":77,"score":204380.0417530508},{"content":" /// The highest seen cluster time this session has seen so far.\n\n /// This will be `None` if this session has not been used in an operation yet.\n\n pub fn cluster_time(&self) -> Option<&ClusterTime> {\n\n self.cluster_time.as_ref()\n\n }\n\n\n\n /// The options used to create this session.\n\n pub fn options(&self) -> Option<&SessionOptions> {\n\n self.options.as_ref()\n\n }\n\n\n\n /// Set the cluster time to the provided one if it is greater than this session's highest seen\n\n /// cluster time or if this session's cluster time is `None`.\n\n pub fn advance_cluster_time(&mut self, to: &ClusterTime) {\n\n if self.cluster_time().map(|ct| ct < to).unwrap_or(true) {\n\n self.cluster_time = Some(to.clone());\n\n }\n\n }\n\n\n\n /// Mark this session (and the underlying server session) as dirty.\n","file_path":"src/client/session/mod.rs","rank":78,"score":204379.49677274146},{"content":" pub fn client(&self) -> Client {\n\n self.client.clone()\n\n }\n\n\n\n /// The id of this session.\n\n pub fn id(&self) -> &Document {\n\n &self.server_session.id\n\n }\n\n\n\n /// Whether this session was created implicitly by the driver or explcitly by the user.\n\n pub(crate) fn is_implicit(&self) -> bool {\n\n self.is_implicit\n\n }\n\n\n\n /// Whether this session is currently in a transaction.\n\n pub(crate) fn in_transaction(&self) -> bool {\n\n self.transaction.state == TransactionState::Starting\n\n || self.transaction.state == TransactionState::InProgress\n\n }\n\n\n","file_path":"src/client/session/mod.rs","rank":79,"score":204377.2174346093},{"content":" pub(crate) fn mark_dirty(&mut self) {\n\n self.server_session.dirty = true;\n\n }\n\n\n\n /// Updates the date that the underlying server session was last used as part of an operation\n\n /// sent to the server.\n\n pub(crate) fn update_last_use(&mut self) {\n\n self.server_session.last_use = Instant::now();\n\n }\n\n\n\n /// Gets the current txn_number.\n\n pub(crate) fn txn_number(&self) -> i64 {\n\n self.server_session.txn_number\n\n }\n\n\n\n /// Increments the txn_number.\n\n pub(crate) fn increment_txn_number(&mut self) {\n\n self.server_session.txn_number += 1;\n\n }\n\n\n","file_path":"src/client/session/mod.rs","rank":80,"score":204377.20365383694},{"content":"/// }\n\n/// ```\n\n#[derive(Debug)]\n\npub struct ClientSession {\n\n cluster_time: Option<ClusterTime>,\n\n server_session: ServerSession,\n\n client: Client,\n\n is_implicit: bool,\n\n options: Option<SessionOptions>,\n\n pub(crate) transaction: Transaction,\n\n pub(crate) snapshot_time: Option<Timestamp>,\n\n}\n\n\n\n#[derive(Debug)]\n\npub(crate) struct Transaction {\n\n pub(crate) state: TransactionState,\n\n pub(crate) options: Option<TransactionOptions>,\n\n pub(crate) pinned: Option<TransactionPin>,\n\n pub(crate) recovery_token: Option<Document>,\n\n}\n","file_path":"src/client/session/mod.rs","rank":81,"score":204376.82430324852},{"content":" /// Whether a network error was encountered while using this session.\n\n dirty: bool,\n\n\n\n /// A monotonically increasing transaction number for this session.\n\n txn_number: i64,\n\n}\n\n\n\nimpl ServerSession {\n\n /// Creates a new session, generating the id client side.\n\n fn new() -> Self {\n\n let binary = Bson::Binary(Binary {\n\n subtype: BinarySubtype::Uuid,\n\n bytes: Uuid::new_v4().as_bytes().to_vec(),\n\n });\n\n\n\n Self {\n\n id: doc! { \"id\": binary },\n\n last_use: Instant::now(),\n\n dirty: false,\n\n txn_number: 0,\n","file_path":"src/client/session/mod.rs","rank":82,"score":204371.5235893396},{"content":" }\n\n TransactionState::Committed {\n\n data_committed: true,\n\n } => {\n\n let mut commit_transaction =\n\n CommitTransaction::new(self.transaction.options.clone());\n\n commit_transaction.update_for_retry();\n\n self.client\n\n .clone()\n\n .execute_operation(commit_transaction, self)\n\n .await\n\n }\n\n TransactionState::Committed {\n\n data_committed: false,\n\n } => Ok(()),\n\n }\n\n }\n\n\n\n /// Aborts the transaction that is currently active on this session. Any open transaction will\n\n /// be aborted automatically in the `Drop` implementation of `ClientSession`.\n","file_path":"src/client/session/mod.rs","rank":83,"score":204368.9533130391},{"content":" .and_then(|o| o.snapshot)\n\n .unwrap_or(false)\n\n {\n\n return Err(ErrorKind::Transaction {\n\n message: \"Transactions are not supported in snapshot sessions\".into(),\n\n }\n\n .into());\n\n }\n\n match self.transaction.state {\n\n TransactionState::Starting | TransactionState::InProgress => {\n\n return Err(ErrorKind::Transaction {\n\n message: \"transaction already in progress\".into(),\n\n }\n\n .into());\n\n }\n\n TransactionState::Committed { .. } => {\n\n self.unpin(); // Unpin session if previous transaction is committed.\n\n }\n\n _ => {}\n\n }\n","file_path":"src/client/session/mod.rs","rank":84,"score":204360.48071226708},{"content":" /// Increments the txn_number and returns the new value.\n\n pub(crate) fn get_and_increment_txn_number(&mut self) -> i64 {\n\n self.increment_txn_number();\n\n self.server_session.txn_number\n\n }\n\n\n\n /// Pin mongos to session.\n\n pub(crate) fn pin_mongos(&mut self, address: ServerAddress) {\n\n self.transaction.pinned = Some(TransactionPin::Mongos(SelectionCriteria::Predicate(\n\n Arc::new(move |server_info: &ServerInfo| *server_info.address() == address),\n\n )));\n\n }\n\n\n\n /// Pin the connection to the session.\n\n pub(crate) fn pin_connection(&mut self, handle: PinnedConnectionHandle) {\n\n self.transaction.pinned = Some(TransactionPin::Connection(handle));\n\n }\n\n\n\n pub(crate) fn unpin(&mut self) {\n\n self.transaction.pinned = None;\n","file_path":"src/client/session/mod.rs","rank":85,"score":204360.28378508828},{"content":" resolve_options!(\n\n self.client,\n\n options,\n\n [read_concern, write_concern, selection_criteria]\n\n );\n\n\n\n if let Some(ref options) = options {\n\n if !options\n\n .write_concern\n\n .as_ref()\n\n .map(|wc| wc.is_acknowledged())\n\n .unwrap_or(true)\n\n {\n\n return Err(ErrorKind::Transaction {\n\n message: \"transactions do not support unacknowledged write concerns\"\n\n .into(),\n\n }\n\n .into());\n\n }\n\n }\n","file_path":"src/client/session/mod.rs","rank":86,"score":204359.4116400474},{"content":" match &mut self.transaction.state {\n\n TransactionState::None => Err(ErrorKind::Transaction {\n\n message: \"no transaction started\".into(),\n\n }\n\n .into()),\n\n TransactionState::Aborted => Err(ErrorKind::Transaction {\n\n message: \"Cannot call commitTransaction after calling abortTransaction\".into(),\n\n }\n\n .into()),\n\n TransactionState::Starting => {\n\n self.transaction.commit(false);\n\n Ok(())\n\n }\n\n TransactionState::InProgress => {\n\n let commit_transaction = CommitTransaction::new(self.transaction.options.clone());\n\n self.transaction.commit(true);\n\n self.client\n\n .clone()\n\n .execute_operation(commit_transaction, self)\n\n .await\n","file_path":"src/client/session/mod.rs","rank":87,"score":204359.20286078253},{"content":" /// }\n\n /// ```\n\n ///\n\n /// This operation will retry once upon failure if the connection and encountered error support\n\n /// retryability. See the documentation\n\n /// [here](https://docs.mongodb.com/manual/core/retryable-writes/) for more information on\n\n /// retryable writes.\n\n pub async fn abort_transaction(&mut self) -> Result<()> {\n\n match self.transaction.state {\n\n TransactionState::None => Err(ErrorKind::Transaction {\n\n message: \"no transaction started\".into(),\n\n }\n\n .into()),\n\n TransactionState::Committed { .. } => Err(ErrorKind::Transaction {\n\n message: \"Cannot call abortTransaction after calling commitTransaction\".into(),\n\n }\n\n .into()),\n\n TransactionState::Aborted => Err(ErrorKind::Transaction {\n\n message: \"cannot call abortTransaction twice\".into(),\n\n }\n","file_path":"src/client/session/mod.rs","rank":88,"score":204358.57152605517},{"content":" match self.client.transaction_support_status().await? {\n\n TransactionSupportStatus::Supported => {\n\n let mut options = match options.into() {\n\n Some(mut options) => {\n\n if let Some(defaults) = self.default_transaction_options() {\n\n merge_options!(\n\n defaults,\n\n &mut options,\n\n [\n\n read_concern,\n\n write_concern,\n\n selection_criteria,\n\n max_commit_time\n\n ]\n\n );\n\n }\n\n Some(options)\n\n }\n\n None => self.default_transaction_options().cloned(),\n\n };\n","file_path":"src/client/session/mod.rs","rank":89,"score":204357.92850366785},{"content":" self.options = None;\n\n self.pinned = None;\n\n self.recovery_token = None;\n\n }\n\n\n\n pub(crate) fn pinned_mongos(&self) -> Option<&SelectionCriteria> {\n\n match &self.pinned {\n\n Some(TransactionPin::Mongos(s)) => Some(s),\n\n _ => None,\n\n }\n\n }\n\n\n\n pub(crate) fn pinned_connection(&self) -> Option<&PinnedConnectionHandle> {\n\n match &self.pinned {\n\n Some(TransactionPin::Connection(c)) => Some(c),\n\n _ => None,\n\n }\n\n }\n\n\n\n fn take(&mut self) -> Self {\n","file_path":"src/client/session/mod.rs","rank":90,"score":204356.56211747119},{"content":"\n\n self.increment_txn_number();\n\n self.transaction.start(options);\n\n Ok(())\n\n }\n\n _ => Err(ErrorKind::Transaction {\n\n message: \"Transactions are not supported by this deployment\".into(),\n\n }\n\n .into()),\n\n }\n\n }\n\n\n\n /// Commits the transaction that is currently active on this session.\n\n ///\n\n ///\n\n /// This method may return an error with a [`crate::error::UNKNOWN_TRANSACTION_COMMIT_RESULT`]\n\n /// label. This label indicates that it is unknown whether the commit has satisfied the write\n\n /// concern associated with the transaction. If an error with this label is returned, it is\n\n /// safe to retry the commit until the write concern is satisfied or an error without the label\n\n /// is returned.\n","file_path":"src/client/session/mod.rs","rank":91,"score":204356.5174232354},{"content":" }\n\n }\n\n\n\n /// Determines if this server session is about to expire in a short amount of time (1 minute).\n\n fn is_about_to_expire(&self, logical_session_timeout: Option<Duration>) -> bool {\n\n let timeout = match logical_session_timeout {\n\n Some(t) => t,\n\n None => return false,\n\n };\n\n let expiration_date = self.last_use + timeout;\n\n expiration_date < Instant::now() + Duration::from_secs(60)\n\n }\n\n}\n","file_path":"src/client/session/mod.rs","rank":92,"score":204355.6609242132},{"content":"\n\nimpl Transaction {\n\n pub(crate) fn start(&mut self, options: Option<TransactionOptions>) {\n\n self.state = TransactionState::Starting;\n\n self.options = options;\n\n self.recovery_token = None;\n\n }\n\n\n\n pub(crate) fn commit(&mut self, data_committed: bool) {\n\n self.state = TransactionState::Committed { data_committed };\n\n }\n\n\n\n pub(crate) fn abort(&mut self) {\n\n self.state = TransactionState::Aborted;\n\n self.options = None;\n\n self.pinned = None;\n\n }\n\n\n\n pub(crate) fn reset(&mut self) {\n\n self.state = TransactionState::None;\n","file_path":"src/client/session/mod.rs","rank":93,"score":204354.8621068988},{"content":" .into()),\n\n TransactionState::Starting => {\n\n self.transaction.abort();\n\n Ok(())\n\n }\n\n TransactionState::InProgress => {\n\n let write_concern = self\n\n .transaction\n\n .options\n\n .as_ref()\n\n .and_then(|options| options.write_concern.as_ref())\n\n .cloned();\n\n let abort_transaction =\n\n AbortTransaction::new(write_concern, self.transaction.pinned.take());\n\n self.transaction.abort();\n\n // Errors returned from running an abortTransaction command should be ignored.\n\n let _result = self\n\n .client\n\n .clone()\n\n .execute_operation(abort_transaction, &mut *self)\n","file_path":"src/client/session/mod.rs","rank":94,"score":204351.86161898327},{"content":"#[derive(Clone, Debug, PartialEq)]\n\npub(crate) enum TransactionState {\n\n None,\n\n Starting,\n\n InProgress,\n\n Committed {\n\n /// Whether any data was committed when commit_transaction was initially called. This is\n\n /// required to determine whether a commitTransaction command should be run if the user\n\n /// calls commit_transaction again.\n\n data_committed: bool,\n\n },\n\n Aborted,\n\n}\n\n\n\n#[derive(Debug)]\n\npub(crate) enum TransactionPin {\n\n Mongos(SelectionCriteria),\n\n Connection(PinnedConnectionHandle),\n\n}\n\n\n","file_path":"src/client/session/mod.rs","rank":95,"score":204345.20087562938},{"content":" Transaction {\n\n state: self.state.clone(),\n\n options: self.options.take(),\n\n pinned: self.pinned.take(),\n\n recovery_token: self.recovery_token.take(),\n\n }\n\n }\n\n}\n\n\n\nimpl Default for Transaction {\n\n fn default() -> Self {\n\n Self {\n\n state: TransactionState::None,\n\n options: None,\n\n pinned: None,\n\n recovery_token: None,\n\n }\n\n }\n\n}\n\n\n","file_path":"src/client/session/mod.rs","rank":96,"score":204335.53881385186},{"content":" .await;\n\n Ok(())\n\n }\n\n }\n\n }\n\n\n\n fn default_transaction_options(&self) -> Option<&TransactionOptions> {\n\n self.options\n\n .as_ref()\n\n .and_then(|options| options.default_transaction_options.as_ref())\n\n }\n\n}\n\n\n","file_path":"src/client/session/mod.rs","rank":97,"score":204335.40272879248},{"content":"fn deserialize_command_started_events<'de, D>(\n\n deserializer: D,\n\n) -> std::result::Result<Option<Vec<CommandStartedEvent>>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let docs = Vec::<Document>::deserialize(deserializer)?;\n\n Ok(Some(\n\n docs.iter()\n\n .map(|doc| {\n\n let event = doc.get_document(\"command_started_event\").unwrap();\n\n from_document(event.clone()).unwrap()\n\n })\n\n .collect(),\n\n ))\n\n}\n","file_path":"src/test/spec/v2_runner/test_file.rs","rank":98,"score":204237.2895941221},{"content":"fn localhost_test_build_10gen(port: u16) -> ServerAddress {\n\n ServerAddress::Tcp {\n\n host: \"localhost.test.build.10gen.cc\".into(),\n\n port: Some(port),\n\n }\n\n}\n\n\n\nlazy_static::lazy_static! {\n\n static ref DEFAULT_HOSTS: Vec<ServerAddress> = vec![\n\n localhost_test_build_10gen(27017),\n\n localhost_test_build_10gen(27108),\n\n ];\n\n}\n\n\n\nasync fn run_test(new_hosts: Result<Vec<ServerAddress>>, expected_hosts: HashSet<ServerAddress>) {\n\n let mut options = ClientOptions::new_srv();\n\n options.hosts = DEFAULT_HOSTS.clone();\n\n options.test_options_mut().disable_monitoring_threads = true;\n\n let topology = Topology::new(options).unwrap();\n\n let mut monitor = SrvPollingMonitor::new(topology.downgrade()).unwrap();\n\n monitor\n\n .update_hosts(new_hosts.and_then(make_lookup_hosts), topology.clone())\n\n .await;\n\n\n\n assert_eq!(expected_hosts, topology.servers().await);\n\n}\n\n\n","file_path":"src/sdam/srv_polling/test.rs","rank":99,"score":203111.57401187054}],"string":"[\n {\n \"content\": \"fn entity_matches(id: &str, actual: Option<&Bson>, entities: &EntityMap) -> bool {\\n\\n let bson = entities.get(id).unwrap().as_bson();\\n\\n results_match_inner(actual, bson, false, false, Some(entities))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 0,\n \"score\": 609087.4541693649\n },\n {\n \"content\": \"fn type_matches(types: &Bson, actual: &Bson) -> bool {\\n\\n match types {\\n\\n Bson::Array(types) => types.iter().any(|t| type_matches(t, actual)),\\n\\n Bson::String(str) => match str.as_ref() {\\n\\n \\\"double\\\" => actual.element_type() == ElementType::Double,\\n\\n \\\"string\\\" => actual.element_type() == ElementType::String,\\n\\n \\\"object\\\" => actual.element_type() == ElementType::EmbeddedDocument,\\n\\n \\\"array\\\" => actual.element_type() == ElementType::Array,\\n\\n \\\"binData\\\" => actual.element_type() == ElementType::Binary,\\n\\n \\\"undefined\\\" => actual.element_type() == ElementType::Undefined,\\n\\n \\\"objectId\\\" => actual.element_type() == ElementType::ObjectId,\\n\\n \\\"bool\\\" => actual.element_type() == ElementType::Boolean,\\n\\n \\\"date\\\" => actual.element_type() == ElementType::DateTime,\\n\\n \\\"null\\\" => actual.element_type() == ElementType::Null,\\n\\n \\\"regex\\\" => actual.element_type() == ElementType::RegularExpression,\\n\\n \\\"dbPointer\\\" => actual.element_type() == ElementType::DbPointer,\\n\\n \\\"javascript\\\" => actual.element_type() == ElementType::JavaScriptCode,\\n\\n \\\"symbol\\\" => actual.element_type() == ElementType::Symbol,\\n\\n \\\"javascriptWithScope\\\" => actual.element_type() == ElementType::JavaScriptCodeWithScope,\\n\\n \\\"int\\\" => actual.element_type() == ElementType::Int32,\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 1,\n \"score\": 441339.26920310047\n },\n {\n \"content\": \"fn numbers_match(actual: &Bson, expected: &Bson) -> bool {\\n\\n if actual.element_type() == expected.element_type() {\\n\\n return actual == expected;\\n\\n }\\n\\n\\n\\n match (get_int(actual), get_int(expected)) {\\n\\n (Some(actual), Some(expected)) => actual == expected,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 2,\n \"score\": 428527.8816444054\n },\n {\n \"content\": \"pub fn results_match(\\n\\n actual: Option<&Bson>,\\n\\n expected: &Bson,\\n\\n returns_root_documents: bool,\\n\\n entities: Option<&EntityMap>,\\n\\n) -> bool {\\n\\n results_match_inner(actual, expected, returns_root_documents, true, entities)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 3,\n \"score\": 411198.8854408264\n },\n {\n \"content\": \"fn server_type_from_str(s: &str) -> Option<ServerType> {\\n\\n let t = match s {\\n\\n \\\"Standalone\\\" => ServerType::Standalone,\\n\\n \\\"Mongos\\\" => ServerType::Mongos,\\n\\n \\\"RSPrimary\\\" => ServerType::RsPrimary,\\n\\n \\\"RSSecondary\\\" => ServerType::RsSecondary,\\n\\n \\\"RSArbiter\\\" => ServerType::RsArbiter,\\n\\n \\\"RSOther\\\" => ServerType::RsOther,\\n\\n \\\"RSGhost\\\" => ServerType::RsGhost,\\n\\n \\\"LoadBalancer\\\" => ServerType::LoadBalancer,\\n\\n \\\"Unknown\\\" | \\\"PossiblePrimary\\\" => ServerType::Unknown,\\n\\n _ => return None,\\n\\n };\\n\\n\\n\\n Some(t)\\n\\n}\\n\\n\\n\\nasync fn run_test(test_file: TestFile) {\\n\\n let test_description = &test_file.description;\\n\\n\\n\",\n \"file_path\": \"src/sdam/description/topology/test/sdam.rs\",\n \"rank\": 4,\n \"score\": 406006.9380474634\n },\n {\n \"content\": \"pub fn merge_uri_options(given_uri: &str, uri_options: Option<&Document>) -> String {\\n\\n let uri_options = match uri_options {\\n\\n Some(opts) => opts,\\n\\n None => return given_uri.to_string(),\\n\\n };\\n\\n let mut given_uri_parts = given_uri.split('?');\\n\\n\\n\\n let mut uri = String::from(given_uri_parts.next().unwrap());\\n\\n // A connection string has two slashes before the host list and one slash before the auth db\\n\\n // name. If an auth db name is not provided the latter slash might not be present, so it needs\\n\\n // to be added manually.\\n\\n if uri.chars().filter(|c| *c == '/').count() < 3 {\\n\\n uri.push('/');\\n\\n }\\n\\n uri.push('?');\\n\\n\\n\\n if let Some(options) = given_uri_parts.next() {\\n\\n let options = options.split('&');\\n\\n for option in options {\\n\\n let key = option.split('=').next().unwrap();\\n\",\n \"file_path\": \"src/test/spec/unified_runner/test_file.rs\",\n \"rank\": 5,\n \"score\": 398817.15797154745\n },\n {\n \"content\": \"fn validate_userinfo(s: &str, userinfo_type: &str) -> Result<()> {\\n\\n if s.chars().any(|c| USERINFO_RESERVED_CHARACTERS.contains(&c)) {\\n\\n return Err(ErrorKind::InvalidArgument {\\n\\n message: format!(\\\"{} must be URL encoded\\\", userinfo_type),\\n\\n }\\n\\n .into());\\n\\n }\\n\\n\\n\\n // All instances of '%' in the username must be part of an percent-encoded substring. This means\\n\\n // that there must be two hexidecimal digits following any '%' in the username.\\n\\n if s.split('%')\\n\\n .skip(1)\\n\\n .any(|part| part.len() < 2 || part[0..2].chars().any(|c| !c.is_ascii_hexdigit()))\\n\\n {\\n\\n return Err(ErrorKind::InvalidArgument {\\n\\n message: \\\"username/password cannot contain unescaped %\\\".to_string(),\\n\\n }\\n\\n .into());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/client/options/mod.rs\",\n \"rank\": 6,\n \"score\": 398156.28527851764\n },\n {\n \"content\": \"fn verify_max_staleness(max_staleness: Option<Duration>) -> crate::error::Result<()> {\\n\\n verify_max_staleness_inner(max_staleness)\\n\\n .map_err(|s| crate::error::ErrorKind::InvalidArgument { message: s }.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sdam/description/topology/mod.rs\",\n \"rank\": 7,\n \"score\": 394795.7629048139\n },\n {\n \"content\": \"fn cmap_events_match(actual: &ExpectedCmapEvent, expected: &ExpectedCmapEvent) -> bool {\\n\\n match (actual, expected) {\\n\\n (\\n\\n ExpectedCmapEvent::PoolCleared {\\n\\n has_service_id: actual_has_service_id,\\n\\n },\\n\\n ExpectedCmapEvent::PoolCleared {\\n\\n has_service_id: expected_has_service_id,\\n\\n },\\n\\n ) => {\\n\\n expected_has_service_id.is_none() || (actual_has_service_id == expected_has_service_id)\\n\\n }\\n\\n (\\n\\n ExpectedCmapEvent::ConnectionClosed {\\n\\n reason: actual_reason,\\n\\n },\\n\\n ExpectedCmapEvent::ConnectionClosed {\\n\\n reason: expected_reason,\\n\\n },\\n\\n ) => expected_reason.is_none() || (actual_reason == expected_reason),\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 8,\n \"score\": 391597.10732761415\n },\n {\n \"content\": \"fn init_db_and_coll(client: &Client, db_name: &str, coll_name: &str) -> Collection<Document> {\\n\\n let coll = client.database(db_name).collection(coll_name);\\n\\n coll.drop(None).unwrap();\\n\\n coll\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/test.rs\",\n \"rank\": 9,\n \"score\": 380733.3938628146\n },\n {\n \"content\": \"pub fn events_match(\\n\\n actual: &ExpectedEvent,\\n\\n expected: &ExpectedEvent,\\n\\n entities: Option<&EntityMap>,\\n\\n) -> bool {\\n\\n match (actual, expected) {\\n\\n (ExpectedEvent::Command(act), ExpectedEvent::Command(exp)) => {\\n\\n command_events_match(act, exp, entities)\\n\\n }\\n\\n (ExpectedEvent::Cmap(act), ExpectedEvent::Cmap(exp)) => cmap_events_match(act, exp),\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 10,\n \"score\": 379340.78567052225\n },\n {\n \"content\": \"fn assert_same_lsid_on_last_two_commands(client: &EventClient) {\\n\\n let events = client.get_all_command_started_events();\\n\\n let lsid1 = events[events.len() - 1].command.get(\\\"lsid\\\").unwrap();\\n\\n let lsid2 = events[events.len() - 2].command.get(\\\"lsid\\\").unwrap();\\n\\n assert_eq!(lsid1, lsid2);\\n\\n}\\n\",\n \"file_path\": \"src/test/spec/v2_runner/mod.rs\",\n \"rank\": 11,\n \"score\": 353694.8160360554\n },\n {\n \"content\": \"fn command_write_concerns(client: &EventClient, key: &str) -> Vec<Document> {\\n\\n client\\n\\n .get_command_started_events(&[key])\\n\\n .into_iter()\\n\\n .map(|d| d.command.get_document(\\\"writeConcern\\\").unwrap().clone())\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"src/concern/test.rs\",\n \"rank\": 12,\n \"score\": 351606.9818659642\n },\n {\n \"content\": \"fn is_master_response_from_server_type(server_type: ServerType) -> Option<IsMasterCommandResponse> {\\n\\n let mut response = IsMasterCommandResponse::default();\\n\\n\\n\\n match server_type {\\n\\n ServerType::Unknown => {\\n\\n return None;\\n\\n }\\n\\n ServerType::Mongos => {\\n\\n response.msg = Some(\\\"isdbgrid\\\".into());\\n\\n }\\n\\n ServerType::RsPrimary => {\\n\\n response.set_name = Some(\\\"foo\\\".into());\\n\\n response.is_writable_primary = Some(true);\\n\\n }\\n\\n ServerType::RsOther => {\\n\\n response.set_name = Some(\\\"foo\\\".into());\\n\\n response.hidden = Some(true);\\n\\n }\\n\\n ServerType::RsSecondary => {\\n\\n response.set_name = Some(\\\"foo\\\".into());\\n\",\n \"file_path\": \"src/sdam/description/topology/server_selection/test/mod.rs\",\n \"rank\": 13,\n \"score\": 349090.741245168\n },\n {\n \"content\": \"fn init_db_and_typed_coll<T>(client: &Client, db_name: &str, coll_name: &str) -> Collection<T>\\n\\nwhere\\n\\n T: Serialize + DeserializeOwned + Unpin + Debug,\\n\\n{\\n\\n let coll = client.database(db_name).collection(coll_name);\\n\\n coll.drop(None).unwrap();\\n\\n coll\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/test.rs\",\n \"rank\": 14,\n \"score\": 348320.2858046061\n },\n {\n \"content\": \"fn assert_different_lsid_on_last_two_commands(client: &EventClient) {\\n\\n let events = client.get_all_command_started_events();\\n\\n let lsid1 = events[events.len() - 1].command.get(\\\"lsid\\\").unwrap();\\n\\n let lsid2 = events[events.len() - 2].command.get(\\\"lsid\\\").unwrap();\\n\\n assert_ne!(lsid1, lsid2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/spec/v2_runner/mod.rs\",\n \"rank\": 15,\n \"score\": 348289.0003839334\n },\n {\n \"content\": \"fn percent_decode(s: &str, err_message: &str) -> Result<String> {\\n\\n match percent_encoding::percent_decode_str(s).decode_utf8() {\\n\\n Ok(result) => Ok(result.to_string()),\\n\\n Err(_) => Err(ErrorKind::InvalidArgument {\\n\\n message: err_message.to_string(),\\n\\n }\\n\\n .into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/client/options/mod.rs\",\n \"rank\": 16,\n \"score\": 344638.1478110225\n },\n {\n \"content\": \"fn lists_eq(actual: &Option<Vec<String>>, expected: &[String]) -> bool {\\n\\n if let Some(actual) = actual {\\n\\n actual.as_slice() == expected\\n\\n } else {\\n\\n expected.is_empty()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\", deny_unknown_fields)]\\n\\npub struct TestTopologyDescription {\\n\\n topology_type: String,\\n\\n set_name: Option<String>,\\n\\n servers: Vec<TestServerDescription>,\\n\\n}\\n\\n\\n\\nimpl PartialEq<TestTopologyDescription> for TopologyDescription {\\n\\n fn eq(&self, other: &TestTopologyDescription) -> bool {\\n\\n if self.topology_type.as_str() != other.topology_type.as_str()\\n\\n || self.set_name != other.set_name\\n\",\n \"file_path\": \"src/sdam/description/topology/test/event.rs\",\n \"rank\": 17,\n \"score\": 344578.73399559717\n },\n {\n \"content\": \"fn deserialize_schema_version<'de, D>(deserializer: D) -> std::result::Result<Version, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let mut schema_version = String::deserialize(deserializer)?;\\n\\n // If the schema version does not contain a minor or patch version, append as necessary to\\n\\n // ensure the String parses correctly into a semver::Version.\\n\\n let count = schema_version.split('.').count();\\n\\n if count == 1 {\\n\\n schema_version.push_str(\\\".0.0\\\");\\n\\n } else if count == 2 {\\n\\n schema_version.push_str(\\\".0\\\");\\n\\n }\\n\\n Version::parse(&schema_version).map_err(|e| serde::de::Error::custom(format!(\\\"{}\\\", e)))\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\", deny_unknown_fields)]\\n\\npub struct RunOnRequirement {\\n\\n min_server_version: Option<String>,\\n\",\n \"file_path\": \"src/test/spec/unified_runner/test_file.rs\",\n \"rank\": 18,\n \"score\": 340753.9156450671\n },\n {\n \"content\": \"/// Splits a string into a section before a given index and a section exclusively after the index.\\n\\n/// Empty portions are returned as `None`.\\n\\nfn exclusive_split_at(s: &str, i: usize) -> (Option<&str>, Option<&str>) {\\n\\n let (l, r) = s.split_at(i);\\n\\n\\n\\n let lout = if !l.is_empty() { Some(l) } else { None };\\n\\n let rout = if r.len() > 1 { Some(&r[1..]) } else { None };\\n\\n\\n\\n (lout, rout)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/client/options/mod.rs\",\n \"rank\": 19,\n \"score\": 333294.83651614044\n },\n {\n \"content\": \"fn verify_max_await_time(max_await_time: Option<Duration>, cursor_type: Option<CursorType>) {\\n\\n let ns = Namespace::empty();\\n\\n let find = Find::<Document>::new(\\n\\n ns,\\n\\n None,\\n\\n Some(FindOptions {\\n\\n cursor_type,\\n\\n max_await_time,\\n\\n ..Default::default()\\n\\n }),\\n\\n );\\n\\n\\n\\n let spec = handle_response_test(\\n\\n &find,\\n\\n doc! {\\n\\n \\\"cursor\\\": {\\n\\n \\\"id\\\": 123,\\n\\n \\\"ns\\\": \\\"a.b\\\",\\n\\n \\\"firstBatch\\\": [],\\n\\n },\\n\",\n \"file_path\": \"src/operation/find/test.rs\",\n \"rank\": 20,\n \"score\": 319544.87818368414\n },\n {\n \"content\": \"pub fn assert_matches<A: Matchable + Debug, E: Matchable + Debug>(\\n\\n actual: &A,\\n\\n expected: &E,\\n\\n description: Option<&str>,\\n\\n) {\\n\\n let result = actual.matches(expected);\\n\\n assert!(\\n\\n result.is_ok(),\\n\\n \\\"{}\\\\n{:#?}\\\\n did not MATCH \\\\n{:#?}\\\\n MATCH failure: {}\\\",\\n\\n description.unwrap_or(\\\"\\\"),\\n\\n actual,\\n\\n expected,\\n\\n result.unwrap_err(),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/util/matchable.rs\",\n \"rank\": 21,\n \"score\": 319526.9317448953\n },\n {\n \"content\": \"fn return_document_to_bool(return_document: Option<ReturnDocument>) -> Option<bool> {\\n\\n if let Some(return_document) = return_document {\\n\\n return match return_document {\\n\\n ReturnDocument::After => Some(true),\\n\\n ReturnDocument::Before => Some(false),\\n\\n };\\n\\n }\\n\\n None\\n\\n}\\n\",\n \"file_path\": \"src/operation/find_and_modify/options.rs\",\n \"rank\": 22,\n \"score\": 315706.8189558727\n },\n {\n \"content\": \"fn serialize_true<S: Serializer>(s: S) -> std::result::Result<S::Ok, S::Error> {\\n\\n s.serialize_bool(true)\\n\\n}\\n\\n\\n\\n#[serde_with::skip_serializing_none]\\n\\n#[derive(Debug, TypedBuilder, Serialize)]\\n\\n#[builder(field_defaults(setter(into)))]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub(super) struct FindAndModifyOptions {\\n\\n #[serde(flatten)]\\n\\n pub(crate) modification: Modification,\\n\\n\\n\\n #[builder(default)]\\n\\n pub(crate) sort: Option<Document>,\\n\\n\\n\\n #[builder(default)]\\n\\n pub(crate) new: Option<bool>,\\n\\n\\n\\n #[builder(default)]\\n\\n pub(crate) upsert: Option<bool>,\\n\",\n \"file_path\": \"src/operation/find_and_modify/options.rs\",\n \"rank\": 23,\n \"score\": 308281.2752775359\n },\n {\n \"content\": \"/// Validates that a `saslStart` or `saslContinue` command response is successful.\\n\\nfn validate_command_success(auth_mechanism: &str, response: &Document) -> Result<()> {\\n\\n let ok = match response.get(\\\"ok\\\") {\\n\\n Some(ok) => ok,\\n\\n None => return Ok(()),\\n\\n };\\n\\n\\n\\n match bson_util::get_int(ok) {\\n\\n Some(1) => Ok(()),\\n\\n Some(_) => Err(Error::authentication_error(\\n\\n auth_mechanism,\\n\\n response\\n\\n .get_str(\\\"errmsg\\\")\\n\\n .unwrap_or(\\\"Authentication failure\\\"),\\n\\n )),\\n\\n _ => Err(Error::invalid_authentication_response(auth_mechanism)),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Encapsulates the parsing of the response to a `saslStart` or `saslContinue` command.\\n\\npub(super) struct SaslResponse {\\n\",\n \"file_path\": \"src/client/auth/sasl.rs\",\n \"rank\": 24,\n \"score\": 305110.2171570327\n },\n {\n \"content\": \"fn results_match_inner(\\n\\n actual: Option<&Bson>,\\n\\n expected: &Bson,\\n\\n returns_root_documents: bool,\\n\\n root: bool,\\n\\n entities: Option<&EntityMap>,\\n\\n) -> bool {\\n\\n match expected {\\n\\n Bson::Document(expected_doc) => {\\n\\n if let Some((key, value)) = expected_doc.iter().next() {\\n\\n if key.starts_with(\\\"$$\\\") && expected_doc.len() == 1 {\\n\\n return special_operator_matches((key, value), actual, entities);\\n\\n }\\n\\n }\\n\\n\\n\\n let actual_doc = match actual {\\n\\n Some(Bson::Document(actual)) => actual,\\n\\n // The only case in which None is an acceptable value is if the expected document\\n\\n // is a special operator; otherwise, the two documents do not match.\\n\\n _ => return false,\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 25,\n \"score\": 304289.13375166955\n },\n {\n \"content\": \"fn command_events_match(\\n\\n actual: &ExpectedCommandEvent,\\n\\n expected: &ExpectedCommandEvent,\\n\\n entities: Option<&EntityMap>,\\n\\n) -> bool {\\n\\n match (actual, expected) {\\n\\n (\\n\\n ExpectedCommandEvent::Started {\\n\\n command_name: actual_command_name,\\n\\n database_name: actual_database_name,\\n\\n command: actual_command,\\n\\n has_service_id: actual_has_service_id,\\n\\n },\\n\\n ExpectedCommandEvent::Started {\\n\\n command_name: expected_command_name,\\n\\n database_name: expected_database_name,\\n\\n command: expected_command,\\n\\n has_service_id: expected_has_service_id,\\n\\n },\\n\\n ) => {\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 26,\n \"score\": 304110.988217795\n },\n {\n \"content\": \"fn special_operator_matches(\\n\\n (key, value): (&String, &Bson),\\n\\n actual: Option<&Bson>,\\n\\n entities: Option<&EntityMap>,\\n\\n) -> bool {\\n\\n match key.as_ref() {\\n\\n \\\"$$exists\\\" => value.as_bool().unwrap() == actual.is_some(),\\n\\n \\\"$$type\\\" => type_matches(value, actual.unwrap()),\\n\\n \\\"$$unsetOrMatches\\\" => {\\n\\n if actual.is_some() {\\n\\n results_match_inner(actual, value, false, false, entities)\\n\\n } else {\\n\\n true\\n\\n }\\n\\n }\\n\\n \\\"$$matchesEntity\\\" => {\\n\\n let id = value.as_str().unwrap();\\n\\n entity_matches(id, actual, entities.unwrap())\\n\\n }\\n\\n \\\"$$matchesHexBytes\\\" => panic!(\\\"GridFS not implemented\\\"),\\n\",\n \"file_path\": \"src/test/spec/unified_runner/matcher.rs\",\n \"rank\": 27,\n \"score\": 303143.95280064456\n },\n {\n \"content\": \"/// Parses a string slice of the form \\\"<expected_key>=<body>\\\" into \\\"<body>\\\", if possible.\\n\\nfn parse_kvp(str: &str, expected_key: char) -> Result<String> {\\n\\n if !str.starts_with(expected_key) || str.chars().nth(1) != Some('=') {\\n\\n Err(Error::invalid_authentication_response(\\\"SCRAM\\\"))\\n\\n } else {\\n\\n Ok(str.chars().skip(2).collect())\\n\\n }\\n\\n}\\n\\n\\n\\n/// Model of the first message sent by the client.\\n\\n#[derive(Debug)]\\n\\npub(crate) struct ClientFirst {\\n\\n source: String,\\n\\n\\n\\n message: String,\\n\\n\\n\\n gs2_header: Range<usize>,\\n\\n\\n\\n bare: Range<usize>,\\n\\n\\n\\n nonce: String,\\n\",\n \"file_path\": \"src/client/auth/scram.rs\",\n \"rank\": 28,\n \"score\": 299435.13086473104\n },\n {\n \"content\": \"pub fn get_default_name(description: &str) -> String {\\n\\n let mut db_name = description\\n\\n .replace('$', \\\"%\\\")\\n\\n .replace(' ', \\\"_\\\")\\n\\n .replace('.', \\\"_\\\");\\n\\n // database names must have fewer than 64 characters\\n\\n db_name.truncate(63);\\n\\n db_name\\n\\n}\\n\",\n \"file_path\": \"src/test/util/mod.rs\",\n \"rank\": 29,\n \"score\": 289962.7027574483\n },\n {\n \"content\": \"/// Choose a server from several suitable choices within the latency window according to\\n\\n/// the algorithm laid out in the server selection specification.\\n\\nfn select_server_in_latency_window(in_window: Vec<&Arc<Server>>) -> Option<Arc<Server>> {\\n\\n if in_window.is_empty() {\\n\\n return None;\\n\\n } else if in_window.len() == 1 {\\n\\n return Some(in_window[0].clone());\\n\\n }\\n\\n\\n\\n let mut rng = SmallRng::from_entropy();\\n\\n in_window\\n\\n .choose_multiple(&mut rng, 2)\\n\\n .min_by_key(|s| s.operation_count())\\n\\n .map(|server| (*server).clone())\\n\\n}\\n\\n\\n\\nimpl TopologyDescription {\\n\\n pub(crate) fn server_selection_timeout_error_message(\\n\\n &self,\\n\\n criteria: &SelectionCriteria,\\n\\n ) -> String {\\n\\n if self.has_available_servers() {\\n\",\n \"file_path\": \"src/sdam/description/topology/server_selection/mod.rs\",\n \"rank\": 30,\n \"score\": 286272.05659868254\n },\n {\n \"content\": \"fn write_concern_to_document(write_concern: &WriteConcern) -> Result<Document> {\\n\\n match bson::to_bson(&write_concern)? {\\n\\n Bson::Document(doc) => Ok(doc),\\n\\n _ => unreachable!(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/test/spec/read_write_concern/mod.rs\",\n \"rank\": 31,\n \"score\": 282498.92169344064\n },\n {\n \"content\": \"fn verify_max_staleness_inner(max_staleness: Option<Duration>) -> std::result::Result<(), String> {\\n\\n if max_staleness\\n\\n .map(|staleness| staleness > Duration::from_secs(0) && staleness < Duration::from_secs(90))\\n\\n .unwrap_or(false)\\n\\n {\\n\\n return Err(\\\"max staleness cannot be both positive and below 90 seconds\\\".into());\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/sdam/description/topology/mod.rs\",\n \"rank\": 32,\n \"score\": 278812.47671202\n },\n {\n \"content\": \"fn build_test(\\n\\n db_name: &str,\\n\\n mut list_collections: ListCollections<Document>,\\n\\n mut expected_body: Document,\\n\\n) {\\n\\n let mut cmd = list_collections\\n\\n .build(&StreamDescription::new_testing())\\n\\n .expect(\\\"build should succeed\\\");\\n\\n assert_eq!(cmd.name, \\\"listCollections\\\");\\n\\n assert_eq!(cmd.target_db, db_name);\\n\\n\\n\\n bson_util::sort_document(&mut cmd.body);\\n\\n bson_util::sort_document(&mut expected_body);\\n\\n\\n\\n assert_eq!(cmd.body, expected_body);\\n\\n}\\n\\n\\n\\n#[cfg_attr(feature = \\\"tokio-runtime\\\", tokio::test)]\\n\\n#[cfg_attr(feature = \\\"async-std-runtime\\\", async_std::test)]\\n\\nasync fn build() {\\n\",\n \"file_path\": \"src/operation/list_collections/test.rs\",\n \"rank\": 33,\n \"score\": 278550.35175049736\n },\n {\n \"content\": \"pub fn deserialize_server_api_test_format<'de, D>(\\n\\n deserializer: D,\\n\\n) -> std::result::Result<Option<ServerApi>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n #[derive(Debug, Deserialize)]\\n\\n #[serde(rename_all = \\\"camelCase\\\", deny_unknown_fields)]\\n\\n struct ApiHelper {\\n\\n version: ServerApiVersion,\\n\\n strict: Option<bool>,\\n\\n deprecation_errors: Option<bool>,\\n\\n }\\n\\n\\n\\n let h = ApiHelper::deserialize(deserializer)?;\\n\\n Ok(Some(ServerApi {\\n\\n version: h.version,\\n\\n strict: h.strict,\\n\\n deprecation_errors: h.deprecation_errors,\\n\\n }))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/spec/unified_runner/test_file.rs\",\n \"rank\": 34,\n \"score\": 270240.0075215334\n },\n {\n \"content\": \"/// A `GenericCursor` that optionally owns its own sessions.\\n\\n/// This is to be used by cursors associated with implicit sessions.\\n\\ntype ImplicitSessionCursor<T> = GenericCursor<ImplicitSessionGetMoreProvider<T>, T>;\\n\\n\\n\",\n \"file_path\": \"src/cursor/mod.rs\",\n \"rank\": 35,\n \"score\": 265974.0368641804\n },\n {\n \"content\": \"fn deserialize_pool_created<'de, D>(deserializer: D) -> Result<PoolCreatedEvent, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let helper = PoolCreatedEventHelper::deserialize(deserializer)?;\\n\\n\\n\\n // The CMAP spec tests use \\\"42\\\" as a placeholder in the expected events to indicate that the\\n\\n // driver should assert that a value is present without any constraints on the value itself.\\n\\n // This idiom is used for the connection pool creation options even when no options are\\n\\n // specified, meaning that there isn't any useful assertion we can do based on this value.\\n\\n // Because of this, we deserialize the value `42` into `None` for the options, which prevents\\n\\n // deserialization failure due to an unexpected type. For other integer values, we raise an\\n\\n // error indicating that we expect `42` instead.\\n\\n let options = match helper.options {\\n\\n Some(PoolOptionsHelper::Options(opts)) => Some(opts),\\n\\n Some(PoolOptionsHelper::Number(42)) | None => None,\\n\\n Some(PoolOptionsHelper::Number(other)) => {\\n\\n return Err(serde::de::Error::invalid_value(\\n\\n Unexpected::Unsigned(other),\\n\\n &\\\"42\\\",\\n\",\n \"file_path\": \"src/cmap/test/event.rs\",\n \"rank\": 36,\n \"score\": 265779.7435372267\n },\n {\n \"content\": \"fn is_auth_error(error: Error) -> bool {\\n\\n matches!(*error.kind, ErrorKind::Authentication { .. })\\n\\n}\\n\\n\\n\\n/// Performs an operation that requires authentication and verifies that it either succeeded or\\n\\n/// failed with an authentication error according to the `should_succeed` parameter.\\n\\nasync fn auth_test(client: Client, should_succeed: bool) {\\n\\n let result = client.list_database_names(None, None).await;\\n\\n if should_succeed {\\n\\n result.expect(\\\"operation should have succeeded\\\");\\n\\n } else {\\n\\n assert!(is_auth_error(result.unwrap_err()));\\n\\n }\\n\\n}\\n\\n\\n\\n/// Attempts to authenticate using the given username/password, optionally specifying a mechanism\\n\\n/// via the `ClientOptions` api.\\n\\n///\\n\\n/// Asserts that the authentication's success matches the provided parameter.\\n\\nasync fn auth_test_options(\\n\",\n \"file_path\": \"src/test/client.rs\",\n \"rank\": 37,\n \"score\": 262535.1168613922\n },\n {\n \"content\": \"fn default_hosts() -> Vec<ServerAddress> {\\n\\n vec![ServerAddress::default()]\\n\\n}\\n\\n\\n\\nimpl Default for ClientOptions {\\n\\n fn default() -> Self {\\n\\n Self::builder().build()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nimpl Serialize for ClientOptions {\\n\\n fn serialize<S>(&self, serializer: S) -> std::result::Result<S::Ok, S::Error>\\n\\n where\\n\\n S: serde::Serializer,\\n\\n {\\n\\n #[derive(Serialize)]\\n\\n struct ClientOptionsHelper<'a> {\\n\\n appname: &'a Option<String>,\\n\\n\\n\",\n \"file_path\": \"src/client/options/mod.rs\",\n \"rank\": 38,\n \"score\": 254091.44293305412\n },\n {\n \"content\": \"fn filter_servers_by_tag_sets(servers: &mut Vec<&ServerDescription>, tag_sets: &[TagSet]) {\\n\\n if tag_sets.is_empty() {\\n\\n return;\\n\\n }\\n\\n\\n\\n for tag_set in tag_sets {\\n\\n let matches_tag_set = |server: &&ServerDescription| server.matches_tag_set(tag_set);\\n\\n\\n\\n if servers.iter().any(matches_tag_set) {\\n\\n servers.retain(matches_tag_set);\\n\\n\\n\\n return;\\n\\n }\\n\\n }\\n\\n\\n\\n servers.clear();\\n\\n}\\n\",\n \"file_path\": \"src/sdam/description/topology/server_selection/mod.rs\",\n \"rank\": 39,\n \"score\": 252211.84989622014\n },\n {\n \"content\": \"fn get_int(value: &Bson) -> Option<i64> {\\n\\n bson_util::get_int(value).or_else(|| value.as_document().and_then(parse_i64_ext_json))\\n\\n}\\n\",\n \"file_path\": \"src/test/util/matchable.rs\",\n \"rank\": 40,\n \"score\": 250946.94710038512\n },\n {\n \"content\": \"fn convert_read_preference(test_read_pref: TestReadPreference) -> Option<ReadPreference> {\\n\\n let max_staleness = test_read_pref\\n\\n .max_staleness_seconds\\n\\n .map(Duration::from_secs);\\n\\n let options = ReadPreferenceOptions::builder()\\n\\n .tag_sets(test_read_pref.tag_sets)\\n\\n .max_staleness(max_staleness)\\n\\n .build();\\n\\n\\n\\n let read_pref = match &test_read_pref.mode.as_ref()?[..] {\\n\\n \\\"Primary\\\" => ReadPreference::Primary,\\n\\n \\\"Secondary\\\" => ReadPreference::Secondary { options },\\n\\n \\\"PrimaryPreferred\\\" => ReadPreference::PrimaryPreferred { options },\\n\\n \\\"SecondaryPreferred\\\" => ReadPreference::SecondaryPreferred { options },\\n\\n \\\"Nearest\\\" => ReadPreference::Nearest { options },\\n\\n m => panic!(\\\"invalid read preference mode: {}\\\", m),\\n\\n };\\n\\n\\n\\n Some(read_pref)\\n\\n}\\n\",\n \"file_path\": \"src/sdam/description/topology/server_selection/test/logic.rs\",\n \"rank\": 41,\n \"score\": 249932.87804179374\n },\n {\n \"content\": \"fn normalize_write_concern_doc(mut write_concern_doc: Document) -> Document {\\n\\n if let Some(w_timeout) = write_concern_doc.remove(\\\"wtimeout\\\") {\\n\\n write_concern_doc.insert(\\\"wtimeoutMS\\\", w_timeout);\\n\\n }\\n\\n\\n\\n if let Some(j) = write_concern_doc.remove(\\\"j\\\") {\\n\\n write_concern_doc.insert(\\\"journal\\\", j);\\n\\n }\\n\\n\\n\\n write_concern_doc\\n\\n}\\n\\n\\n\\nasync fn run_connection_string_test(test_file: TestFile) {\\n\\n for test_case in test_file.tests {\\n\\n match ClientOptions::parse(&test_case.uri).await {\\n\\n Ok(options) => {\\n\\n assert!(test_case.valid);\\n\\n\\n\\n if let Some(ref expected_read_concern) = test_case.read_concern {\\n\\n let mut actual_read_concern = Document::new();\\n\",\n \"file_path\": \"src/test/spec/read_write_concern/connection_string.rs\",\n \"rank\": 42,\n \"score\": 247860.92137991614\n },\n {\n \"content\": \"fn write_concern_from_document(write_concern_doc: Document) -> Option<WriteConcern> {\\n\\n let mut write_concern = WriteConcern::default();\\n\\n\\n\\n for (key, value) in write_concern_doc {\\n\\n match (&key[..], value) {\\n\\n (\\\"w\\\", Bson::Int32(i)) => {\\n\\n write_concern.w = Some(Acknowledgment::from(i as u32));\\n\\n }\\n\\n (\\\"w\\\", Bson::String(s)) => {\\n\\n write_concern.w = Some(Acknowledgment::from(s));\\n\\n }\\n\\n (\\\"journal\\\", Bson::Boolean(b)) => {\\n\\n write_concern.journal = Some(b);\\n\\n }\\n\\n (\\\"wtimeoutMS\\\", Bson::Int32(i)) if i > 0 => {\\n\\n write_concern.w_timeout = Some(Duration::from_millis(i as u64));\\n\\n }\\n\\n (\\\"wtimeoutMS\\\", Bson::Int32(_)) => {\\n\\n // WriteConcern has an unsigned integer for the wtimeout field, so this is\\n\\n // impossible to test.\\n\",\n \"file_path\": \"src/test/spec/read_write_concern/document.rs\",\n \"rank\": 43,\n \"score\": 247430.51792253018\n },\n {\n \"content\": \"fn parse_i64_ext_json(doc: &Document) -> Option<i64> {\\n\\n let number_string = doc.get(\\\"$numberLong\\\").and_then(Bson::as_str)?;\\n\\n number_string.parse::<i64>().ok()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/util/matchable.rs\",\n \"rank\": 44,\n \"score\": 243411.76368410868\n },\n {\n \"content\": \"fn kill_cursors_sent(client: &EventClient) -> bool {\\n\\n !client\\n\\n .get_command_started_events(&[\\\"killCursors\\\"])\\n\\n .is_empty()\\n\\n}\\n\\n\\n\\n#[cfg_attr(feature = \\\"tokio-runtime\\\", tokio::test)]\\n\\n#[cfg_attr(feature = \\\"async-std-runtime\\\", async_std::test)]\\n\\n#[function_name::named]\\n\\nasync fn kill_cursors_on_drop() {\\n\\n let _guard: RwLockReadGuard<()> = LOCK.run_concurrently().await;\\n\\n\\n\\n let client = TestClient::new().await;\\n\\n let db = client.database(function_name!());\\n\\n let coll = db.collection(function_name!());\\n\\n\\n\\n drop_collection(&coll).await;\\n\\n\\n\\n coll.insert_many(vec![doc! { \\\"x\\\": 1 }, doc! { \\\"x\\\": 2 }], None)\\n\\n .await\\n\",\n \"file_path\": \"src/test/coll.rs\",\n \"rank\": 45,\n \"score\": 240330.6499468784\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug, Deserialize)]\\n\\nenum TestServerType {\\n\\n Standalone,\\n\\n Mongos,\\n\\n #[serde(rename = \\\"RSPrimary\\\")]\\n\\n RsPrimary,\\n\\n #[serde(rename = \\\"RSSecondary\\\")]\\n\\n RsSecondary,\\n\\n #[serde(rename = \\\"RSArbiter\\\")]\\n\\n RsArbiter,\\n\\n #[serde(rename = \\\"RSOther\\\")]\\n\\n RsOther,\\n\\n #[serde(rename = \\\"RSGhost\\\")]\\n\\n RsGhost,\\n\\n LoadBalancer,\\n\\n Unknown,\\n\\n PossiblePrimary,\\n\\n}\\n\\n\\n\\nimpl TestServerType {\\n\\n fn into_server_type(self) -> Option<ServerType> {\\n\",\n \"file_path\": \"src/sdam/description/topology/server_selection/test/mod.rs\",\n \"rank\": 46,\n \"score\": 240095.55947482245\n },\n {\n \"content\": \"/// A `GenericCursor` that borrows its session.\\n\\n/// This is to be used with cursors associated with explicit sessions borrowed from the user.\\n\\ntype ExplicitSessionCursor<'session, T> =\\n\\n GenericCursor<ExplicitSessionGetMoreProvider<'session, T>, T>;\\n\\n\\n\\n/// A type that implements [`Stream`](https://docs.rs/futures/latest/futures/stream/index.html) which can be used to\\n\\n/// stream the results of a [`SessionCursor`]. Returned from [`SessionCursor::stream`].\\n\\n///\\n\\n/// This updates the buffer of the parent [`SessionCursor`] when dropped. [`SessionCursor::next`] or\\n\\n/// any further streams created from [`SessionCursor::stream`] will pick up where this one left off.\\n\\npub struct SessionCursorStream<'cursor, 'session, T = Document>\\n\\nwhere\\n\\n T: DeserializeOwned + Unpin + Send + Sync,\\n\\n{\\n\\n session_cursor: &'cursor mut SessionCursor<T>,\\n\\n generic_cursor: ExplicitSessionCursor<'session, T>,\\n\\n}\\n\\n\\n\\nimpl<'cursor, 'session, T> Stream for SessionCursorStream<'cursor, 'session, T>\\n\\nwhere\\n\\n T: DeserializeOwned + Unpin + Send + Sync,\\n\\n{\\n\",\n \"file_path\": \"src/cursor/session.rs\",\n \"rank\": 47,\n \"score\": 235125.57083806815\n },\n {\n \"content\": \"struct ImplicitSessionGetMoreResult<T> {\\n\\n get_more_result: Result<GetMoreResult<T>>,\\n\\n session: Option<Box<ClientSession>>,\\n\\n}\\n\\n\\n\\nimpl<T> GetMoreProviderResult for ImplicitSessionGetMoreResult<T> {\\n\\n type Session = Option<Box<ClientSession>>;\\n\\n type DocumentType = T;\\n\\n\\n\\n fn as_ref(&self) -> std::result::Result<&GetMoreResult<T>, &Error> {\\n\\n self.get_more_result.as_ref()\\n\\n }\\n\\n\\n\\n fn into_parts(self) -> (Result<GetMoreResult<T>>, Self::Session) {\\n\\n (self.get_more_result, self.session)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cursor/mod.rs\",\n \"rank\": 48,\n \"score\": 234431.21157068707\n },\n {\n \"content\": \"fn build_test(\\n\\n ns: Namespace,\\n\\n filter: Option<Document>,\\n\\n options: Option<FindOptions>,\\n\\n mut expected_body: Document,\\n\\n) {\\n\\n let mut find = Find::<Document>::new(ns.clone(), filter, options);\\n\\n\\n\\n let mut cmd = find.build(&StreamDescription::new_testing()).unwrap();\\n\\n\\n\\n assert_eq!(cmd.name.as_str(), \\\"find\\\");\\n\\n assert_eq!(cmd.target_db.as_str(), ns.db.as_str());\\n\\n\\n\\n bson_util::sort_document(&mut expected_body);\\n\\n bson_util::sort_document(&mut cmd.body);\\n\\n\\n\\n assert_eq!(cmd.body, expected_body);\\n\\n}\\n\\n\\n\\n#[cfg_attr(feature = \\\"tokio-runtime\\\", tokio::test)]\\n\",\n \"file_path\": \"src/operation/find/test.rs\",\n \"rank\": 49,\n \"score\": 234279.07089266842\n },\n {\n \"content\": \"fn build_test(\\n\\n target: impl Into<AggregateTarget>,\\n\\n pipeline: Vec<Document>,\\n\\n options: Option<AggregateOptions>,\\n\\n mut expected_body: Document,\\n\\n) {\\n\\n let target = target.into();\\n\\n\\n\\n let mut aggregate = Aggregate::new(target.clone(), pipeline, options);\\n\\n\\n\\n let mut cmd = aggregate.build(&StreamDescription::new_testing()).unwrap();\\n\\n\\n\\n assert_eq!(cmd.name.as_str(), \\\"aggregate\\\");\\n\\n assert_eq!(cmd.target_db.as_str(), target.db_name());\\n\\n\\n\\n bson_util::sort_document(&mut expected_body);\\n\\n bson_util::sort_document(&mut cmd.body);\\n\\n\\n\\n assert_eq!(cmd.body, expected_body);\\n\\n}\\n\",\n \"file_path\": \"src/operation/aggregate/test.rs\",\n \"rank\": 50,\n \"score\": 234279.07089266842\n },\n {\n \"content\": \"fn build_test(\\n\\n ns: Namespace,\\n\\n cursor_id: i64,\\n\\n address: ServerAddress,\\n\\n batch_size: Option<u32>,\\n\\n max_time: Option<Duration>,\\n\\n mut expected_body: Document,\\n\\n) {\\n\\n let info = CursorInformation {\\n\\n ns: ns.clone(),\\n\\n id: cursor_id,\\n\\n address,\\n\\n batch_size,\\n\\n max_time,\\n\\n };\\n\\n let mut get_more = GetMore::<Document>::new(info, None);\\n\\n\\n\\n let build_result = get_more.build(&StreamDescription::new_testing());\\n\\n assert!(build_result.is_ok());\\n\\n\\n\",\n \"file_path\": \"src/operation/get_more/test.rs\",\n \"rank\": 51,\n \"score\": 234279.07089266842\n },\n {\n \"content\": \"#[test]\\n\\n#[function_name::named]\\n\\nfn typed_collection() {\\n\\n let _guard: RwLockReadGuard<()> = RUNTIME.block_on(async { LOCK.run_concurrently().await });\\n\\n\\n\\n let options = CLIENT_OPTIONS.clone();\\n\\n let client = Client::with_options(options).expect(\\\"client creation should succeed\\\");\\n\\n let coll = init_db_and_typed_coll(&client, function_name!(), function_name!());\\n\\n\\n\\n #[derive(Serialize, Deserialize, Debug)]\\n\\n struct MyType {\\n\\n x: i32,\\n\\n str: String,\\n\\n }\\n\\n let my_type = MyType {\\n\\n x: 1,\\n\\n str: \\\"hello\\\".into(),\\n\\n };\\n\\n\\n\\n assert!(coll.insert_one(my_type, None).is_ok());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/test.rs\",\n \"rank\": 52,\n \"score\": 229626.1076862439\n },\n {\n \"content\": \"pub trait TestOperation: Debug {\\n\\n fn execute_on_collection<'a>(\\n\\n &'a self,\\n\\n _collection: &'a Collection<Document>,\\n\\n _session: Option<&'a mut ClientSession>,\\n\\n ) -> BoxFuture<'a, Result<Option<Bson>>> {\\n\\n todo!()\\n\\n }\\n\\n\\n\\n fn execute_on_database<'a>(\\n\\n &'a self,\\n\\n _database: &'a Database,\\n\\n _session: Option<&'a mut ClientSession>,\\n\\n ) -> BoxFuture<'a, Result<Option<Bson>>> {\\n\\n todo!()\\n\\n }\\n\\n\\n\\n fn execute_on_client<'a>(\\n\\n &'a self,\\n\\n _client: &'a TestClient,\\n\",\n \"file_path\": \"src/test/spec/v2_runner/operation.rs\",\n \"rank\": 53,\n \"score\": 228478.58809445353\n },\n {\n \"content\": \"pub trait TestOperation: Debug {\\n\\n fn execute_test_runner_operation<'a>(\\n\\n &'a self,\\n\\n _test_runner: &'a mut TestRunner,\\n\\n ) -> BoxFuture<'a, ()> {\\n\\n todo!()\\n\\n }\\n\\n\\n\\n fn execute_entity_operation<'a>(\\n\\n &'a self,\\n\\n _id: &'a str,\\n\\n _test_runner: &'a mut TestRunner,\\n\\n ) -> BoxFuture<'a, Result<Option<Entity>>> {\\n\\n todo!()\\n\\n }\\n\\n\\n\\n /// Whether or not this operation returns an array of root documents. This information is\\n\\n /// necessary to determine how the return value of an operation should be compared to the\\n\\n /// expected value.\\n\\n fn returns_root_documents(&self) -> bool {\\n\",\n \"file_path\": \"src/test/spec/unified_runner/operation.rs\",\n \"rank\": 54,\n \"score\": 228478.58809445353\n },\n {\n \"content\": \"#[test]\\n\\nfn client_options() {\\n\\n let _guard: RwLockReadGuard<()> = RUNTIME.block_on(async { LOCK.run_concurrently().await });\\n\\n\\n\\n let mut options = ClientOptions::parse(\\\"mongodb://localhost:27017/\\\").unwrap();\\n\\n\\n\\n options.original_uri.take();\\n\\n\\n\\n assert_eq!(\\n\\n options,\\n\\n ClientOptions::builder()\\n\\n .hosts(vec![ServerAddress::Tcp {\\n\\n host: \\\"localhost\\\".into(),\\n\\n port: Some(27017)\\n\\n }])\\n\\n .build()\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/test.rs\",\n \"rank\": 55,\n \"score\": 228031.369062021\n },\n {\n \"content\": \"/// The number of digits in `n` in base 10.\\n\\n/// Useful for calculating the size of an array entry in BSON.\\n\\nfn num_decimal_digits(mut n: usize) -> u64 {\\n\\n let mut digits = 0;\\n\\n\\n\\n loop {\\n\\n n /= 10;\\n\\n digits += 1;\\n\\n\\n\\n if n == 0 {\\n\\n return digits;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Read a document's raw BSON bytes from the provided reader.\\n\\npub(crate) fn read_document_bytes<R: Read>(mut reader: R) -> Result<Vec<u8>> {\\n\\n let length = reader.read_i32()?;\\n\\n\\n\\n let mut bytes = Vec::with_capacity(length as usize);\\n\\n bytes.write_i32(length)?;\\n\\n\\n\",\n \"file_path\": \"src/bson_util/mod.rs\",\n \"rank\": 56,\n \"score\": 227748.84857047375\n },\n {\n \"content\": \"struct DroppedClientSession {\\n\\n cluster_time: Option<ClusterTime>,\\n\\n server_session: ServerSession,\\n\\n client: Client,\\n\\n is_implicit: bool,\\n\\n options: Option<SessionOptions>,\\n\\n transaction: Transaction,\\n\\n snapshot_time: Option<Timestamp>,\\n\\n}\\n\\n\\n\\nimpl From<DroppedClientSession> for ClientSession {\\n\\n fn from(dropped_session: DroppedClientSession) -> Self {\\n\\n Self {\\n\\n cluster_time: dropped_session.cluster_time,\\n\\n server_session: dropped_session.server_session,\\n\\n client: dropped_session.client,\\n\\n is_implicit: dropped_session.is_implicit,\\n\\n options: dropped_session.options,\\n\\n transaction: dropped_session.transaction,\\n\\n snapshot_time: dropped_session.snapshot_time,\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 57,\n \"score\": 225096.78556242224\n },\n {\n \"content\": \"pub fn eq_matches<T: PartialEq + Debug>(\\n\\n name: &str,\\n\\n actual: &T,\\n\\n expected: &T,\\n\\n) -> Result<(), String> {\\n\\n if actual != expected {\\n\\n return Err(format!(\\n\\n \\\"expected {} {:?}, got {:?}\\\",\\n\\n name, expected, actual\\n\\n ));\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nimpl Matchable for Bson {\\n\\n fn is_placeholder(&self) -> bool {\\n\\n if let Bson::String(string) = self {\\n\\n string.as_str() == \\\"42\\\" || string.as_str() == \\\"\\\"\\n\\n } else {\\n\\n get_int(self) == Some(42)\\n\",\n \"file_path\": \"src/test/util/matchable.rs\",\n \"rank\": 58,\n \"score\": 222204.0593616229\n },\n {\n \"content\": \"#[test]\\n\\n#[function_name::named]\\n\\nfn client() {\\n\\n let _guard: RwLockReadGuard<()> = RUNTIME.block_on(async { LOCK.run_concurrently().await });\\n\\n\\n\\n let options = CLIENT_OPTIONS.clone();\\n\\n let client = Client::with_options(options).expect(\\\"client creation should succeed\\\");\\n\\n\\n\\n client\\n\\n .database(function_name!())\\n\\n .collection(function_name!())\\n\\n .insert_one(Document::new(), None)\\n\\n .expect(\\\"insert should succeed\\\");\\n\\n\\n\\n let db_names = client\\n\\n .list_database_names(None, None)\\n\\n .expect(\\\"list_database_names should succeed\\\");\\n\\n assert!(db_names.contains(&function_name!().to_string()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/test.rs\",\n \"rank\": 59,\n \"score\": 215615.55225592648\n },\n {\n \"content\": \"fn verify_description_outcome(\\n\\n outcome: DescriptionOutcome,\\n\\n topology_description: TopologyDescription,\\n\\n test_description: &str,\\n\\n phase_description: String,\\n\\n) {\\n\\n assert_eq!(\\n\\n topology_description.topology_type, outcome.topology_type,\\n\\n \\\"{}: {}\\\",\\n\\n test_description, phase_description\\n\\n );\\n\\n\\n\\n assert_eq!(\\n\\n topology_description.set_name, outcome.set_name,\\n\\n \\\"{}: {}\\\",\\n\\n test_description, phase_description,\\n\\n );\\n\\n\\n\\n let expected_timeout = outcome\\n\\n .logical_session_timeout_minutes\\n\",\n \"file_path\": \"src/sdam/description/topology/test/sdam.rs\",\n \"rank\": 60,\n \"score\": 212007.03715108067\n },\n {\n \"content\": \"fn deserialize_uri_options_to_uri_string_option<'de, D>(\\n\\n deserializer: D,\\n\\n) -> std::result::Result<Option<String>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let uri_options = Document::deserialize(deserializer)?;\\n\\n Ok(Some(merge_uri_options(&DEFAULT_URI, Some(&uri_options))))\\n\\n}\\n\\n\\n\\n#[derive(Debug, Deserialize)]\\n\\npub struct Outcome {\\n\\n pub collection: CollectionOutcome,\\n\\n}\\n\\n\\n\\nimpl Outcome {\\n\\n pub async fn matches_actual(\\n\\n self,\\n\\n db_name: String,\\n\\n coll_name: String,\\n\",\n \"file_path\": \"src/test/spec/v2_runner/test_file.rs\",\n \"rank\": 61,\n \"score\": 210670.0606849346\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\ntype Result<T> = std::result::Result<T, Err>;\\n\\n\\n\\n#[cfg(not(feature = \\\"sync\\\"))]\\n\\nasync fn _connecting() -> Result<()> {\\n\\n use mongodb::{options::ClientOptions, Client};\\n\\n\\n\\n // Parse a connection string into an options struct.\\n\\n let mut client_options = ClientOptions::parse(\\\"mongodb://localhost:27017\\\").await?;\\n\\n\\n\\n // Manually set an option.\\n\\n client_options.app_name = Some(\\\"My App\\\".to_string());\\n\\n\\n\\n // Get a handle to the deployment.\\n\\n let client = Client::with_options(client_options)?;\\n\\n\\n\\n // List the names of the databases in that deployment.\\n\\n for db_name in client.list_database_names(None, None).await? {\\n\\n println!(\\\"{}\\\", db_name);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/readme_examples.rs\",\n \"rank\": 62,\n \"score\": 209863.59493974975\n },\n {\n \"content\": \"fn deserialize_checkout_failed<'de, D>(\\n\\n deserializer: D,\\n\\n) -> Result<ConnectionCheckoutFailedEvent, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let helper = ConnectionCheckoutFailedHelper::deserialize(deserializer)?;\\n\\n\\n\\n // The driver doesn't have a concept of a \\\"closed pool\\\", instead having the pool closed when the\\n\\n // pool is dropped. Because of this, the driver doesn't implement the \\\"poolClosed\\\" reason for a\\n\\n // connection checkout failure. While we skip over the corresponding tests in our spec test\\n\\n // runner, we still need to be able to deserialize the \\\"poolClosed\\\" reason to avoid the test\\n\\n // harness panicking, so we arbitrarily map the \\\"poolClosed\\\" to \\\"connectionError\\\".\\n\\n let reason = match helper.reason {\\n\\n CheckoutFailedReasonHelper::PoolClosed | CheckoutFailedReasonHelper::ConnectionError => {\\n\\n ConnectionCheckoutFailedReason::ConnectionError\\n\\n }\\n\\n CheckoutFailedReasonHelper::Timeout => ConnectionCheckoutFailedReason::Timeout,\\n\\n };\\n\\n\\n\\n Ok(ConnectionCheckoutFailedEvent {\\n\\n address: ServerAddress::Tcp {\\n\\n host: Default::default(),\\n\\n port: None,\\n\\n },\\n\\n reason,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/cmap/test/event.rs\",\n \"rank\": 63,\n \"score\": 207615.16110561707\n },\n {\n \"content\": \"fn deserialize_op<'de, 'a, T: 'a + Deserialize<'de> + TestOperation>(\\n\\n value: Bson,\\n\\n) -> std::result::Result<Box<dyn TestOperation + 'a>, bson::de::Error> {\\n\\n T::deserialize(BsonDeserializer::new(value)).map(|op| Box::new(op) as Box<dyn TestOperation>)\\n\\n}\\n\\n\\n\\nimpl<'de> Deserialize<'de> for Operation {\\n\\n fn deserialize<D: Deserializer<'de>>(deserializer: D) -> std::result::Result<Self, D::Error> {\\n\\n #[derive(Debug, Deserialize)]\\n\\n #[serde(rename_all = \\\"camelCase\\\", deny_unknown_fields)]\\n\\n struct OperationDefinition {\\n\\n pub name: String,\\n\\n pub object: OperationObject,\\n\\n #[serde(default = \\\"default_arguments\\\")]\\n\\n pub arguments: Bson,\\n\\n pub expect_error: Option<ExpectError>,\\n\\n pub expect_result: Option<Bson>,\\n\\n pub save_result_as_entity: Option<String>,\\n\\n pub ignore_result_and_error: Option<bool>,\\n\\n }\\n\",\n \"file_path\": \"src/test/spec/unified_runner/operation.rs\",\n \"rank\": 64,\n \"score\": 205825.41871324176\n },\n {\n \"content\": \"fn make_lookup_hosts(hosts: Vec<ServerAddress>) -> Result<LookupHosts> {\\n\\n Ok(LookupHosts {\\n\\n hosts: hosts.into_iter().map(Result::Ok).collect(),\\n\\n min_ttl: Duration::from_secs(60),\\n\\n })\\n\\n}\\n\\n\\n\\n// If a new DNS record is returned, it should be reflected in the topology.\\n\\n#[cfg_attr(feature = \\\"tokio-runtime\\\", tokio::test)]\\n\\n#[cfg_attr(feature = \\\"async-std-runtime\\\", async_std::test)]\\n\\nasync fn add_new_dns_record() {\\n\\n let hosts = vec![\\n\\n localhost_test_build_10gen(27017),\\n\\n localhost_test_build_10gen(27018),\\n\\n localhost_test_build_10gen(27019),\\n\\n ];\\n\\n\\n\\n run_test(Ok(hosts.clone()), hosts.into_iter().collect()).await;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sdam/srv_polling/test.rs\",\n \"rank\": 65,\n \"score\": 205743.22237066732\n },\n {\n \"content\": \" ///\\n\\n /// ```rust\\n\\n /// # use mongodb::{bson::{doc, Document}, error::Result, Client, ClientSession};\\n\\n /// #\\n\\n /// # async fn do_stuff() -> Result<()> {\\n\\n /// # let client = Client::with_uri_str(\\\"mongodb://example.com\\\").await?;\\n\\n /// # let coll = client.database(\\\"foo\\\").collection::<Document>(\\\"bar\\\");\\n\\n /// # let mut session = client.start_session(None).await?;\\n\\n /// session.start_transaction(None).await?;\\n\\n /// let result = coll.insert_one_with_session(doc! { \\\"x\\\": 1 }, None, &mut session).await?;\\n\\n /// session.commit_transaction().await?;\\n\\n /// # Ok(())\\n\\n /// # }\\n\\n /// ```\\n\\n ///\\n\\n /// This operation will retry once upon failure if the connection and encountered error support\\n\\n /// retryability. See the documentation\\n\\n /// [here](https://docs.mongodb.com/manual/core/retryable-writes/) for more information on\\n\\n /// retryable writes.\\n\\n pub async fn commit_transaction(&mut self) -> Result<()> {\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 66,\n \"score\": 204404.15752563634\n },\n {\n \"content\": \" /// ```rust\\n\\n /// # use mongodb::{bson::{doc, Document}, error::Result, Client, ClientSession};\\n\\n /// #\\n\\n /// # async fn do_stuff() -> Result<()> {\\n\\n /// # let client = Client::with_uri_str(\\\"mongodb://example.com\\\").await?;\\n\\n /// # let coll = client.database(\\\"foo\\\").collection::<Document>(\\\"bar\\\");\\n\\n /// # let mut session = client.start_session(None).await?;\\n\\n /// session.start_transaction(None).await?;\\n\\n /// let result = coll.insert_one_with_session(doc! { \\\"x\\\": 1 }, None, &mut session).await?;\\n\\n /// session.commit_transaction().await?;\\n\\n /// # Ok(())\\n\\n /// # }\\n\\n /// ```\\n\\n pub async fn start_transaction(\\n\\n &mut self,\\n\\n options: impl Into<Option<TransactionOptions>>,\\n\\n ) -> Result<()> {\\n\\n if self\\n\\n .options\\n\\n .as_ref()\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 67,\n \"score\": 204403.84029220615\n },\n {\n \"content\": \"/// # Client,\\n\\n/// ClientSession,\\n\\n/// Collection,\\n\\n/// };\\n\\n///\\n\\n/// # async fn do_stuff() -> Result<()> {\\n\\n/// # let client = Client::with_uri_str(\\\"mongodb://example.com\\\").await?;\\n\\n/// # let coll: Collection<Document> = client.database(\\\"foo\\\").collection(\\\"bar\\\");\\n\\n/// let mut session = client.start_session(None).await?;\\n\\n/// let options = TransactionOptions::builder()\\n\\n/// .read_concern(ReadConcern::majority())\\n\\n/// .write_concern(WriteConcern::builder().w(Acknowledgment::Majority).build())\\n\\n/// .build();\\n\\n/// session.start_transaction(options).await?;\\n\\n/// // A \\\"TransientTransactionError\\\" label indicates that the entire transaction can be retried\\n\\n/// // with a reasonable expectation that it will succeed.\\n\\n/// while let Err(error) = execute_transaction(&coll, &mut session).await {\\n\\n/// if !error.contains_label(TRANSIENT_TRANSACTION_ERROR) {\\n\\n/// break;\\n\\n/// }\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 68,\n \"score\": 204400.3539588376\n },\n {\n \"content\": \" ///\\n\\n /// ```rust\\n\\n /// # use mongodb::{bson::{doc, Document}, error::Result, Client, ClientSession, Collection};\\n\\n /// #\\n\\n /// # async fn do_stuff() -> Result<()> {\\n\\n /// # let client = Client::with_uri_str(\\\"mongodb://example.com\\\").await?;\\n\\n /// # let coll = client.database(\\\"foo\\\").collection::<Document>(\\\"bar\\\");\\n\\n /// # let mut session = client.start_session(None).await?;\\n\\n /// session.start_transaction(None).await?;\\n\\n /// match execute_transaction(&coll, &mut session).await {\\n\\n /// Ok(_) => session.commit_transaction().await?,\\n\\n /// Err(_) => session.abort_transaction().await?,\\n\\n /// }\\n\\n /// # Ok(())\\n\\n /// # }\\n\\n ///\\n\\n /// async fn execute_transaction(coll: &Collection<Document>, session: &mut ClientSession) -> Result<()> {\\n\\n /// coll.insert_one_with_session(doc! { \\\"x\\\": 1 }, None, session).await?;\\n\\n /// coll.delete_one_with_session(doc! { \\\"y\\\": 2 }, None, session).await?;\\n\\n /// Ok(())\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 69,\n \"score\": 204398.21583642391\n },\n {\n \"content\": \"mod cluster_time;\\n\\nmod pool;\\n\\n#[cfg(test)]\\n\\nmod test;\\n\\n\\n\\nuse std::{\\n\\n collections::HashSet,\\n\\n sync::Arc,\\n\\n time::{Duration, Instant},\\n\\n};\\n\\n\\n\\nuse lazy_static::lazy_static;\\n\\nuse uuid::Uuid;\\n\\n\\n\\nuse crate::{\\n\\n bson::{doc, spec::BinarySubtype, Binary, Bson, Document, Timestamp},\\n\\n cmap::conn::PinnedConnectionHandle,\\n\\n error::{ErrorKind, Result},\\n\\n operation::{AbortTransaction, CommitTransaction, Operation},\\n\\n options::{SessionOptions, TransactionOptions},\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 70,\n \"score\": 204395.75308719042\n },\n {\n \"content\": \" } else {\\n\\n let client = self.client.clone();\\n\\n let server_session = self.server_session.clone();\\n\\n RUNTIME.execute(async move {\\n\\n client.check_in_server_session(server_session).await;\\n\\n });\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Client side abstraction of a server session. These are pooled and may be associated with\\n\\n/// multiple `ClientSession`s over the course of their lifetime.\\n\\n#[derive(Clone, Debug)]\\n\\npub(crate) struct ServerSession {\\n\\n /// The id of the server session to which this corresponds.\\n\\n id: Document,\\n\\n\\n\\n /// The last time an operation was executed with this session.\\n\\n last_use: std::time::Instant,\\n\\n\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 71,\n \"score\": 204391.69299058433\n },\n {\n \"content\": \" sdam::{ServerInfo, TransactionSupportStatus},\\n\\n selection_criteria::SelectionCriteria,\\n\\n Client,\\n\\n RUNTIME,\\n\\n};\\n\\npub use cluster_time::ClusterTime;\\n\\npub(super) use pool::ServerSessionPool;\\n\\n\\n\\nuse super::options::ServerAddress;\\n\\n\\n\\nlazy_static! {\\n\\n pub(crate) static ref SESSIONS_UNSUPPORTED_COMMANDS: HashSet<&'static str> = {\\n\\n let mut hash_set = HashSet::new();\\n\\n hash_set.insert(\\\"killcursors\\\");\\n\\n hash_set.insert(\\\"parallelcollectionscan\\\");\\n\\n hash_set\\n\\n };\\n\\n}\\n\\n\\n\\n/// A MongoDB client session. This struct represents a logical session used for ordering sequential\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 72,\n \"score\": 204390.31134917526\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Whether this session is dirty.\\n\\n #[cfg(test)]\\n\\n pub(crate) fn is_dirty(&self) -> bool {\\n\\n self.server_session.dirty\\n\\n }\\n\\n\\n\\n /// Starts a new transaction on this session with the given `TransactionOptions`. If no options\\n\\n /// are provided, the session's `defaultTransactionOptions` will be used. This session must\\n\\n /// be passed into each operation within the transaction; otherwise, the operation will be\\n\\n /// executed outside of the transaction.\\n\\n ///\\n\\n /// Errors returned from operations executed within a transaction may include a\\n\\n /// [`crate::error::TRANSIENT_TRANSACTION_ERROR`] label. This label indicates that the entire\\n\\n /// transaction can be retried with a reasonable expectation that it will succeed.\\n\\n ///\\n\\n /// Transactions are supported on MongoDB 4.0+. The Rust driver currently only supports\\n\\n /// transactions on replica sets.\\n\\n ///\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 73,\n \"score\": 204388.8334171932\n },\n {\n \"content\": \"/// operations. To create a `ClientSession`, call `start_session` on a `Client`.\\n\\n///\\n\\n/// `ClientSession` instances are not thread safe or fork safe. They can only be used by one thread\\n\\n/// or process at a time.\\n\\n///\\n\\n/// ## Transactions\\n\\n/// Transactions are used to execute a series of operations across multiple documents and\\n\\n/// collections atomically. For more information about when and how to use transactions in MongoDB,\\n\\n/// see the [manual](https://docs.mongodb.com/manual/core/transactions/).\\n\\n///\\n\\n/// Replica set transactions are supported on MongoDB 4.0+. Sharded transactions are supported on\\n\\n/// MongoDDB 4.2+. Transactions are associated with a `ClientSession`. To begin a transaction, call\\n\\n/// [`ClientSession::start_transaction`] on a `ClientSession`. The `ClientSession` must be passed to\\n\\n/// operations to be executed within the transaction.\\n\\n///\\n\\n/// ```rust\\n\\n/// use mongodb::{\\n\\n/// bson::{doc, Document},\\n\\n/// error::{Result, TRANSIENT_TRANSACTION_ERROR, UNKNOWN_TRANSACTION_COMMIT_RESULT},\\n\\n/// options::{Acknowledgment, ReadConcern, TransactionOptions, WriteConcern},\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 74,\n \"score\": 204385.32189611052\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for ClientSession {\\n\\n fn drop(&mut self) {\\n\\n if self.transaction.state == TransactionState::InProgress {\\n\\n let dropped_session = DroppedClientSession {\\n\\n cluster_time: self.cluster_time.clone(),\\n\\n server_session: self.server_session.clone(),\\n\\n client: self.client.clone(),\\n\\n is_implicit: self.is_implicit,\\n\\n options: self.options.clone(),\\n\\n transaction: self.transaction.take(),\\n\\n snapshot_time: self.snapshot_time,\\n\\n };\\n\\n RUNTIME.execute(async move {\\n\\n let mut session: ClientSession = dropped_session.into();\\n\\n let _result = session.abort_transaction().await;\\n\\n });\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 75,\n \"score\": 204383.52251215195\n },\n {\n \"content\": \"impl ClientSession {\\n\\n /// Creates a new `ClientSession` wrapping the provided server session.\\n\\n pub(crate) fn new(\\n\\n server_session: ServerSession,\\n\\n client: Client,\\n\\n options: Option<SessionOptions>,\\n\\n is_implicit: bool,\\n\\n ) -> Self {\\n\\n Self {\\n\\n client,\\n\\n server_session,\\n\\n cluster_time: None,\\n\\n is_implicit,\\n\\n options,\\n\\n transaction: Default::default(),\\n\\n snapshot_time: None,\\n\\n }\\n\\n }\\n\\n\\n\\n /// The client used to create this session.\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 76,\n \"score\": 204382.5026337076\n },\n {\n \"content\": \"/// }\\n\\n/// # Ok(())\\n\\n/// # }\\n\\n///\\n\\n/// async fn execute_transaction(coll: &Collection<Document>, session: &mut ClientSession) -> Result<()> {\\n\\n/// coll.insert_one_with_session(doc! { \\\"x\\\": 1 }, None, session).await?;\\n\\n/// coll.delete_one_with_session(doc! { \\\"y\\\": 2 }, None, session).await?;\\n\\n/// // An \\\"UnknownTransactionCommitResult\\\" label indicates that it is unknown whether the\\n\\n/// // commit has satisfied the write concern associated with the transaction. If an error\\n\\n/// // with this label is returned, it is safe to retry the commit until the write concern is\\n\\n/// // satisfied or an error without the label is returned.\\n\\n/// loop {\\n\\n/// let result = session.commit_transaction().await;\\n\\n/// if let Err(ref error) = result {\\n\\n/// if error.contains_label(UNKNOWN_TRANSACTION_COMMIT_RESULT) {\\n\\n/// continue;\\n\\n/// }\\n\\n/// }\\n\\n/// result?\\n\\n/// }\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 77,\n \"score\": 204380.0417530508\n },\n {\n \"content\": \" /// The highest seen cluster time this session has seen so far.\\n\\n /// This will be `None` if this session has not been used in an operation yet.\\n\\n pub fn cluster_time(&self) -> Option<&ClusterTime> {\\n\\n self.cluster_time.as_ref()\\n\\n }\\n\\n\\n\\n /// The options used to create this session.\\n\\n pub fn options(&self) -> Option<&SessionOptions> {\\n\\n self.options.as_ref()\\n\\n }\\n\\n\\n\\n /// Set the cluster time to the provided one if it is greater than this session's highest seen\\n\\n /// cluster time or if this session's cluster time is `None`.\\n\\n pub fn advance_cluster_time(&mut self, to: &ClusterTime) {\\n\\n if self.cluster_time().map(|ct| ct < to).unwrap_or(true) {\\n\\n self.cluster_time = Some(to.clone());\\n\\n }\\n\\n }\\n\\n\\n\\n /// Mark this session (and the underlying server session) as dirty.\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 78,\n \"score\": 204379.49677274146\n },\n {\n \"content\": \" pub fn client(&self) -> Client {\\n\\n self.client.clone()\\n\\n }\\n\\n\\n\\n /// The id of this session.\\n\\n pub fn id(&self) -> &Document {\\n\\n &self.server_session.id\\n\\n }\\n\\n\\n\\n /// Whether this session was created implicitly by the driver or explcitly by the user.\\n\\n pub(crate) fn is_implicit(&self) -> bool {\\n\\n self.is_implicit\\n\\n }\\n\\n\\n\\n /// Whether this session is currently in a transaction.\\n\\n pub(crate) fn in_transaction(&self) -> bool {\\n\\n self.transaction.state == TransactionState::Starting\\n\\n || self.transaction.state == TransactionState::InProgress\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 79,\n \"score\": 204377.2174346093\n },\n {\n \"content\": \" pub(crate) fn mark_dirty(&mut self) {\\n\\n self.server_session.dirty = true;\\n\\n }\\n\\n\\n\\n /// Updates the date that the underlying server session was last used as part of an operation\\n\\n /// sent to the server.\\n\\n pub(crate) fn update_last_use(&mut self) {\\n\\n self.server_session.last_use = Instant::now();\\n\\n }\\n\\n\\n\\n /// Gets the current txn_number.\\n\\n pub(crate) fn txn_number(&self) -> i64 {\\n\\n self.server_session.txn_number\\n\\n }\\n\\n\\n\\n /// Increments the txn_number.\\n\\n pub(crate) fn increment_txn_number(&mut self) {\\n\\n self.server_session.txn_number += 1;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 80,\n \"score\": 204377.20365383694\n },\n {\n \"content\": \"/// }\\n\\n/// ```\\n\\n#[derive(Debug)]\\n\\npub struct ClientSession {\\n\\n cluster_time: Option<ClusterTime>,\\n\\n server_session: ServerSession,\\n\\n client: Client,\\n\\n is_implicit: bool,\\n\\n options: Option<SessionOptions>,\\n\\n pub(crate) transaction: Transaction,\\n\\n pub(crate) snapshot_time: Option<Timestamp>,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub(crate) struct Transaction {\\n\\n pub(crate) state: TransactionState,\\n\\n pub(crate) options: Option<TransactionOptions>,\\n\\n pub(crate) pinned: Option<TransactionPin>,\\n\\n pub(crate) recovery_token: Option<Document>,\\n\\n}\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 81,\n \"score\": 204376.82430324852\n },\n {\n \"content\": \" /// Whether a network error was encountered while using this session.\\n\\n dirty: bool,\\n\\n\\n\\n /// A monotonically increasing transaction number for this session.\\n\\n txn_number: i64,\\n\\n}\\n\\n\\n\\nimpl ServerSession {\\n\\n /// Creates a new session, generating the id client side.\\n\\n fn new() -> Self {\\n\\n let binary = Bson::Binary(Binary {\\n\\n subtype: BinarySubtype::Uuid,\\n\\n bytes: Uuid::new_v4().as_bytes().to_vec(),\\n\\n });\\n\\n\\n\\n Self {\\n\\n id: doc! { \\\"id\\\": binary },\\n\\n last_use: Instant::now(),\\n\\n dirty: false,\\n\\n txn_number: 0,\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 82,\n \"score\": 204371.5235893396\n },\n {\n \"content\": \" }\\n\\n TransactionState::Committed {\\n\\n data_committed: true,\\n\\n } => {\\n\\n let mut commit_transaction =\\n\\n CommitTransaction::new(self.transaction.options.clone());\\n\\n commit_transaction.update_for_retry();\\n\\n self.client\\n\\n .clone()\\n\\n .execute_operation(commit_transaction, self)\\n\\n .await\\n\\n }\\n\\n TransactionState::Committed {\\n\\n data_committed: false,\\n\\n } => Ok(()),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Aborts the transaction that is currently active on this session. Any open transaction will\\n\\n /// be aborted automatically in the `Drop` implementation of `ClientSession`.\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 83,\n \"score\": 204368.9533130391\n },\n {\n \"content\": \" .and_then(|o| o.snapshot)\\n\\n .unwrap_or(false)\\n\\n {\\n\\n return Err(ErrorKind::Transaction {\\n\\n message: \\\"Transactions are not supported in snapshot sessions\\\".into(),\\n\\n }\\n\\n .into());\\n\\n }\\n\\n match self.transaction.state {\\n\\n TransactionState::Starting | TransactionState::InProgress => {\\n\\n return Err(ErrorKind::Transaction {\\n\\n message: \\\"transaction already in progress\\\".into(),\\n\\n }\\n\\n .into());\\n\\n }\\n\\n TransactionState::Committed { .. } => {\\n\\n self.unpin(); // Unpin session if previous transaction is committed.\\n\\n }\\n\\n _ => {}\\n\\n }\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 84,\n \"score\": 204360.48071226708\n },\n {\n \"content\": \" /// Increments the txn_number and returns the new value.\\n\\n pub(crate) fn get_and_increment_txn_number(&mut self) -> i64 {\\n\\n self.increment_txn_number();\\n\\n self.server_session.txn_number\\n\\n }\\n\\n\\n\\n /// Pin mongos to session.\\n\\n pub(crate) fn pin_mongos(&mut self, address: ServerAddress) {\\n\\n self.transaction.pinned = Some(TransactionPin::Mongos(SelectionCriteria::Predicate(\\n\\n Arc::new(move |server_info: &ServerInfo| *server_info.address() == address),\\n\\n )));\\n\\n }\\n\\n\\n\\n /// Pin the connection to the session.\\n\\n pub(crate) fn pin_connection(&mut self, handle: PinnedConnectionHandle) {\\n\\n self.transaction.pinned = Some(TransactionPin::Connection(handle));\\n\\n }\\n\\n\\n\\n pub(crate) fn unpin(&mut self) {\\n\\n self.transaction.pinned = None;\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 85,\n \"score\": 204360.28378508828\n },\n {\n \"content\": \" resolve_options!(\\n\\n self.client,\\n\\n options,\\n\\n [read_concern, write_concern, selection_criteria]\\n\\n );\\n\\n\\n\\n if let Some(ref options) = options {\\n\\n if !options\\n\\n .write_concern\\n\\n .as_ref()\\n\\n .map(|wc| wc.is_acknowledged())\\n\\n .unwrap_or(true)\\n\\n {\\n\\n return Err(ErrorKind::Transaction {\\n\\n message: \\\"transactions do not support unacknowledged write concerns\\\"\\n\\n .into(),\\n\\n }\\n\\n .into());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 86,\n \"score\": 204359.4116400474\n },\n {\n \"content\": \" match &mut self.transaction.state {\\n\\n TransactionState::None => Err(ErrorKind::Transaction {\\n\\n message: \\\"no transaction started\\\".into(),\\n\\n }\\n\\n .into()),\\n\\n TransactionState::Aborted => Err(ErrorKind::Transaction {\\n\\n message: \\\"Cannot call commitTransaction after calling abortTransaction\\\".into(),\\n\\n }\\n\\n .into()),\\n\\n TransactionState::Starting => {\\n\\n self.transaction.commit(false);\\n\\n Ok(())\\n\\n }\\n\\n TransactionState::InProgress => {\\n\\n let commit_transaction = CommitTransaction::new(self.transaction.options.clone());\\n\\n self.transaction.commit(true);\\n\\n self.client\\n\\n .clone()\\n\\n .execute_operation(commit_transaction, self)\\n\\n .await\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 87,\n \"score\": 204359.20286078253\n },\n {\n \"content\": \" /// }\\n\\n /// ```\\n\\n ///\\n\\n /// This operation will retry once upon failure if the connection and encountered error support\\n\\n /// retryability. See the documentation\\n\\n /// [here](https://docs.mongodb.com/manual/core/retryable-writes/) for more information on\\n\\n /// retryable writes.\\n\\n pub async fn abort_transaction(&mut self) -> Result<()> {\\n\\n match self.transaction.state {\\n\\n TransactionState::None => Err(ErrorKind::Transaction {\\n\\n message: \\\"no transaction started\\\".into(),\\n\\n }\\n\\n .into()),\\n\\n TransactionState::Committed { .. } => Err(ErrorKind::Transaction {\\n\\n message: \\\"Cannot call abortTransaction after calling commitTransaction\\\".into(),\\n\\n }\\n\\n .into()),\\n\\n TransactionState::Aborted => Err(ErrorKind::Transaction {\\n\\n message: \\\"cannot call abortTransaction twice\\\".into(),\\n\\n }\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 88,\n \"score\": 204358.57152605517\n },\n {\n \"content\": \" match self.client.transaction_support_status().await? {\\n\\n TransactionSupportStatus::Supported => {\\n\\n let mut options = match options.into() {\\n\\n Some(mut options) => {\\n\\n if let Some(defaults) = self.default_transaction_options() {\\n\\n merge_options!(\\n\\n defaults,\\n\\n &mut options,\\n\\n [\\n\\n read_concern,\\n\\n write_concern,\\n\\n selection_criteria,\\n\\n max_commit_time\\n\\n ]\\n\\n );\\n\\n }\\n\\n Some(options)\\n\\n }\\n\\n None => self.default_transaction_options().cloned(),\\n\\n };\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 89,\n \"score\": 204357.92850366785\n },\n {\n \"content\": \" self.options = None;\\n\\n self.pinned = None;\\n\\n self.recovery_token = None;\\n\\n }\\n\\n\\n\\n pub(crate) fn pinned_mongos(&self) -> Option<&SelectionCriteria> {\\n\\n match &self.pinned {\\n\\n Some(TransactionPin::Mongos(s)) => Some(s),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn pinned_connection(&self) -> Option<&PinnedConnectionHandle> {\\n\\n match &self.pinned {\\n\\n Some(TransactionPin::Connection(c)) => Some(c),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn take(&mut self) -> Self {\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 90,\n \"score\": 204356.56211747119\n },\n {\n \"content\": \"\\n\\n self.increment_txn_number();\\n\\n self.transaction.start(options);\\n\\n Ok(())\\n\\n }\\n\\n _ => Err(ErrorKind::Transaction {\\n\\n message: \\\"Transactions are not supported by this deployment\\\".into(),\\n\\n }\\n\\n .into()),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Commits the transaction that is currently active on this session.\\n\\n ///\\n\\n ///\\n\\n /// This method may return an error with a [`crate::error::UNKNOWN_TRANSACTION_COMMIT_RESULT`]\\n\\n /// label. This label indicates that it is unknown whether the commit has satisfied the write\\n\\n /// concern associated with the transaction. If an error with this label is returned, it is\\n\\n /// safe to retry the commit until the write concern is satisfied or an error without the label\\n\\n /// is returned.\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 91,\n \"score\": 204356.5174232354\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /// Determines if this server session is about to expire in a short amount of time (1 minute).\\n\\n fn is_about_to_expire(&self, logical_session_timeout: Option<Duration>) -> bool {\\n\\n let timeout = match logical_session_timeout {\\n\\n Some(t) => t,\\n\\n None => return false,\\n\\n };\\n\\n let expiration_date = self.last_use + timeout;\\n\\n expiration_date < Instant::now() + Duration::from_secs(60)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 92,\n \"score\": 204355.6609242132\n },\n {\n \"content\": \"\\n\\nimpl Transaction {\\n\\n pub(crate) fn start(&mut self, options: Option<TransactionOptions>) {\\n\\n self.state = TransactionState::Starting;\\n\\n self.options = options;\\n\\n self.recovery_token = None;\\n\\n }\\n\\n\\n\\n pub(crate) fn commit(&mut self, data_committed: bool) {\\n\\n self.state = TransactionState::Committed { data_committed };\\n\\n }\\n\\n\\n\\n pub(crate) fn abort(&mut self) {\\n\\n self.state = TransactionState::Aborted;\\n\\n self.options = None;\\n\\n self.pinned = None;\\n\\n }\\n\\n\\n\\n pub(crate) fn reset(&mut self) {\\n\\n self.state = TransactionState::None;\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 93,\n \"score\": 204354.8621068988\n },\n {\n \"content\": \" .into()),\\n\\n TransactionState::Starting => {\\n\\n self.transaction.abort();\\n\\n Ok(())\\n\\n }\\n\\n TransactionState::InProgress => {\\n\\n let write_concern = self\\n\\n .transaction\\n\\n .options\\n\\n .as_ref()\\n\\n .and_then(|options| options.write_concern.as_ref())\\n\\n .cloned();\\n\\n let abort_transaction =\\n\\n AbortTransaction::new(write_concern, self.transaction.pinned.take());\\n\\n self.transaction.abort();\\n\\n // Errors returned from running an abortTransaction command should be ignored.\\n\\n let _result = self\\n\\n .client\\n\\n .clone()\\n\\n .execute_operation(abort_transaction, &mut *self)\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 94,\n \"score\": 204351.86161898327\n },\n {\n \"content\": \"#[derive(Clone, Debug, PartialEq)]\\n\\npub(crate) enum TransactionState {\\n\\n None,\\n\\n Starting,\\n\\n InProgress,\\n\\n Committed {\\n\\n /// Whether any data was committed when commit_transaction was initially called. This is\\n\\n /// required to determine whether a commitTransaction command should be run if the user\\n\\n /// calls commit_transaction again.\\n\\n data_committed: bool,\\n\\n },\\n\\n Aborted,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub(crate) enum TransactionPin {\\n\\n Mongos(SelectionCriteria),\\n\\n Connection(PinnedConnectionHandle),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 95,\n \"score\": 204345.20087562938\n },\n {\n \"content\": \" Transaction {\\n\\n state: self.state.clone(),\\n\\n options: self.options.take(),\\n\\n pinned: self.pinned.take(),\\n\\n recovery_token: self.recovery_token.take(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for Transaction {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n state: TransactionState::None,\\n\\n options: None,\\n\\n pinned: None,\\n\\n recovery_token: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 96,\n \"score\": 204335.53881385186\n },\n {\n \"content\": \" .await;\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn default_transaction_options(&self) -> Option<&TransactionOptions> {\\n\\n self.options\\n\\n .as_ref()\\n\\n .and_then(|options| options.default_transaction_options.as_ref())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/client/session/mod.rs\",\n \"rank\": 97,\n \"score\": 204335.40272879248\n },\n {\n \"content\": \"fn deserialize_command_started_events<'de, D>(\\n\\n deserializer: D,\\n\\n) -> std::result::Result<Option<Vec<CommandStartedEvent>>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let docs = Vec::<Document>::deserialize(deserializer)?;\\n\\n Ok(Some(\\n\\n docs.iter()\\n\\n .map(|doc| {\\n\\n let event = doc.get_document(\\\"command_started_event\\\").unwrap();\\n\\n from_document(event.clone()).unwrap()\\n\\n })\\n\\n .collect(),\\n\\n ))\\n\\n}\\n\",\n \"file_path\": \"src/test/spec/v2_runner/test_file.rs\",\n \"rank\": 98,\n \"score\": 204237.2895941221\n },\n {\n \"content\": \"fn localhost_test_build_10gen(port: u16) -> ServerAddress {\\n\\n ServerAddress::Tcp {\\n\\n host: \\\"localhost.test.build.10gen.cc\\\".into(),\\n\\n port: Some(port),\\n\\n }\\n\\n}\\n\\n\\n\\nlazy_static::lazy_static! {\\n\\n static ref DEFAULT_HOSTS: Vec<ServerAddress> = vec![\\n\\n localhost_test_build_10gen(27017),\\n\\n localhost_test_build_10gen(27108),\\n\\n ];\\n\\n}\\n\\n\\n\\nasync fn run_test(new_hosts: Result<Vec<ServerAddress>>, expected_hosts: HashSet<ServerAddress>) {\\n\\n let mut options = ClientOptions::new_srv();\\n\\n options.hosts = DEFAULT_HOSTS.clone();\\n\\n options.test_options_mut().disable_monitoring_threads = true;\\n\\n let topology = Topology::new(options).unwrap();\\n\\n let mut monitor = SrvPollingMonitor::new(topology.downgrade()).unwrap();\\n\\n monitor\\n\\n .update_hosts(new_hosts.and_then(make_lookup_hosts), topology.clone())\\n\\n .await;\\n\\n\\n\\n assert_eq!(expected_hosts, topology.servers().await);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sdam/srv_polling/test.rs\",\n \"rank\": 99,\n \"score\": 203111.57401187054\n }\n]","isConversational":false}}},{"rowIdx":1185,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/cache/file_manager.rs"},"repo_name":{"kind":"string","value":"cloudfuse-io/cloud-readers-rs"},"commit":{"kind":"string","value":"498ae2e6bbcdc170659bb76d428e5135f8041724"},"file_code":{"kind":"string","value":"use std::collections::BTreeMap;\nuse std::fmt;\nuse std::sync::{Arc, Condvar, Mutex};\n\nuse anyhow::{anyhow, bail, ensure, Result};\nuse itertools::Itertools;\nuse tokio::sync::mpsc::UnboundedSender;\n\nuse super::Range;\n\n#[derive(Clone)]\npub(crate) enum Download {\n Pending(usize),\n Done(Arc<Vec<u8>>),\n Error(String),\n}\n\nimpl fmt::Debug for Download {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n match self {\n Download::Pending(len) => write!(f, \"Pending({} bytes)\", len),\n Download::Done(data) => write!(f, \"Done({} bytes)\", data.len()),\n Download::Error(error) => write!(f, \"Error({:?})\", error),\n }\n }\n}\n\npub(crate) struct RangeCursor {\n data: Arc<Vec<u8>>,\n offset: u64,\n}\n\nimpl fmt::Debug for RangeCursor {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n f.debug_struct(\"RangeCursor\")\n .field(\"data\", &format!(\"vec![x;{}]\", self.data.len()))\n .field(\"offset\", &self.offset)\n .finish()\n }\n}\n\nimpl RangeCursor {\n \n fn try_new(data: Arc<Vec<u8>>, offset: u64) -> Result<Self> {\n ensure!(\n data.len() > offset as usize,\n \"Out of bound in RangeCursor: (offset={}) >= (length={})\",\n offset,\n data.len(),\n );\n Ok(Self { data, offset })\n }\n \n pub(crate) fn read(self, buf: &mut [u8]) -> usize {\n \n let len = std::cmp::min(buf.len(), self.data.len() - self.offset as usize);\n \n buf[0..len]\n .clone_from_slice(&self.data[self.offset as usize..(self.offset as usize + len)]);\n len\n }\n}\n\n#[derive(Clone)]\npub(crate) struct FileCache {\n ranges: Arc<Mutex<BTreeMap<u64, Download>>>,\n cv: Arc<Condvar>,\n file_size: u64,\n}\n\nfn fmt_debug(map: &BTreeMap<u64, Download>) -> String {\n map.iter()\n .map(|(pos, dl)| format!(\"-- Start={:0>10} Status={:?}\", pos, dl))\n .join(\"\\n\")\n}\n\nimpl fmt::Debug for FileCache {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n let range_guard = self.ranges.lock().unwrap();\n write!(f, \"{}\", fmt_debug(&*range_guard))\n }\n}\n\nimpl FileCache {\n pub(crate) fn new(file_size: u64) -> Self {\n Self {\n ranges: Arc::new(Mutex::new(BTreeMap::new())),\n cv: Arc::new(Condvar::new()),\n file_size,\n }\n }\n\n \n pub(crate) fn insert(&self, start: u64, download: Download) {\n let mut range_guard = self.ranges.lock().unwrap();\n range_guard.insert(start, download);\n self.cv.notify_all()\n }\n\n fn get_range(&self, start: u64) -> Result<RangeCursor> {\n use std::ops::Bound::{Included, Unbounded};\n let mut ranges_guard = self.ranges.lock().unwrap();\n\n ensure!(ranges_guard.len() > 0, \"No download scheduled\");\n\n let mut before = ranges_guard\n .range((Unbounded, Included(start)))\n .next_back()\n .map(|(start, dl)| (*start, dl.clone()));\n\n while let Some((_, Download::Pending(_))) = before {\n \n ranges_guard = self.cv.wait(ranges_guard).unwrap();\n before = ranges_guard\n .range((Unbounded, Included(start)))\n .next_back()\n .map(|(start, dl)| (*start, dl.clone()));\n }\n\n let before = before.ok_or_else(|| {\n anyhow!(\n \"Download not scheduled at position {}, scheduled ranges are:\\n{}\",\n start,\n fmt_debug(&*ranges_guard),\n )\n })?;\n\n match before.1 {\n Download::Done(bytes) => {\n ensure!(\n before.0 + bytes.len() as u64 > start,\n \"Download not scheduled at position {}, scheduled ranges are:\\n{}\",\n start,\n fmt_debug(&*ranges_guard),\n );\n RangeCursor::try_new(bytes, start - before.0)\n }\n Download::Error(err) => bail!(err),\n Download::Pending(_) => unreachable!(),\n }\n }\n}\n\n#[derive(Clone)]\npub struct FileManager {\n cache: FileCache,\n tx: UnboundedSender<Range>,\n}\n\nimpl FileManager {\n pub(crate) fn new(cache: FileCache, tx: UnboundedSender<Range>) -> Self {\n Self { cache, tx }\n }\n\n \n \n pub fn queue_download(&self, ranges: Vec<Range>) -> Result<()> {\n for range in ranges {\n self.cache\n .insert(range.start, Download::Pending(range.length));\n self.tx.send(range).map_err(|e| anyhow!(e.to_string()))?;\n }\n Ok(())\n }\n\n \n \n \n pub(crate) fn get_range(&self, start: u64) -> Result<RangeCursor> {\n self.cache.get_range(start)\n }\n\n pub fn get_file_size(&self) -> u64 {\n self.cache.file_size\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::super::mock::*;\n use super::super::DownloadCache;\n use super::*;\n\n #[tokio::test]\n async fn test_read_at_0() {\n let file_manager = init_mock(1000).await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n assert_cursor(file_manager, 0, pattern(0, 100))\n .await\n .expect(\"Could not get range at 0 with download of [0:100[\");\n }\n\n #[tokio::test]\n async fn test_read_with_offset() {\n let file_manager = init_mock(1000).await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n assert_cursor(file_manager, 50, pattern(50, 100))\n .await\n .expect(\"Could not get range at 50 with download of [0:100[\");\n }\n\n #[tokio::test]\n async fn test_read_uninited() {\n let file_manager = init_mock(1000).await;\n let err_msg = assert_cursor(file_manager, 0, pattern(0, 100))\n .await\n .expect_err(\"Read file without queued downloads should fail\")\n .to_string();\n\n assert_eq!(err_msg, \"No download scheduled\");\n }\n\n #[tokio::test]\n async fn test_read_outside_download() {\n let file_manager = init_mock(1000).await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n let err_msg = assert_cursor(file_manager, 120, pattern(120, 200))\n .await\n .expect_err(\"Read file without scheduled downloads should fail\")\n .to_string();\n\n assert_eq!(\n err_msg,\n \"\\\nDownload not scheduled at position 120, scheduled ranges are:\n-- Start=0000000000 Status=Done(100 bytes)\"\n );\n }\n\n #[tokio::test]\n async fn test_read_error_downloader() {\n let mut download_cache = DownloadCache::new(1);\n\n let file_manager = download_cache\n .register(Box::new(ErrorFileDescription {}))\n .await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n let error = tokio::task::spawn_blocking(move || -> Result<RangeCursor> {\n file_manager.get_range(0)\n })\n .await\n .unwrap()\n .unwrap_err();\n\n assert_eq!(\n format!(\"{:?}\", error),\n \"Error in ErrorDownloader\\n\\nCaused by:\\n Download Failed\"\n );\n }\n\n async fn init_mock(len: u64) -> FileManager {\n let mut download_cache = DownloadCache::new(1);\n\n let pattern_file_description = PatternFileDescription::new(len);\n\n download_cache\n .register(Box::new(pattern_file_description))\n .await\n }\n\n \n \n async fn assert_cursor(file_manager: FileManager, start: u64, target: Vec<u8>) -> Result<()> {\n let target_length = target.len();\n \n let cursor = tokio::task::spawn_blocking(move || -> Result<RangeCursor> {\n file_manager.get_range(start)\n })\n .await\n .unwrap()?;\n \n let mut content = vec![0u8; target_length];\n cursor.read(&mut content);\n assert_eq!(content, target);\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"use std::collections::BTreeMap;\nuse std::fmt;\nuse std::sync::{Arc, Condvar, Mutex};\n\nuse anyhow::{anyhow, bail, ensure, Result};\nuse itertools::Itertools;\nuse tokio::sync::mpsc::UnboundedSender;\n\nuse super::Range;\n\n#[derive(Clone)]\npub(crate) enum Download {\n Pending(usize),\n Done(Arc<Vec<u8>>),\n Error(String),\n}\n\nimpl fmt::Debug for Download {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n match self {\n Download::Pending(len) => write!(f, \"Pending({} bytes)\", len),\n Download::Done(data) => write!(f, \"Done({} bytes)\", data.len()),\n Download::Error(error) => write!(f, \"Error({:?})\", error),\n }\n }\n}\n\npub(crate) struct RangeCursor {\n data: Arc<Vec<u8>>,\n offset: u64,\n}\n\nimpl fmt::Debug for RangeCursor {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n f.debug_struct(\"RangeCursor\")\n .field(\"data\", &format!(\"vec![x;{}]\", self.data.len()))\n .field(\"offset\", &self.offset)\n .finish()\n }\n}\n\nimpl RangeCursor {\n \n fn try_new(data: Arc<Vec<u8>>, offse"},"suffix":{"kind":"string","value":"\n \n pub(crate) fn read(self, buf: &mut [u8]) -> usize {\n \n let len = std::cmp::min(buf.len(), self.data.len() - self.offset as usize);\n \n buf[0..len]\n .clone_from_slice(&self.data[self.offset as usize..(self.offset as usize + len)]);\n len\n }\n}\n\n#[derive(Clone)]\npub(crate) struct FileCache {\n ranges: Arc<Mutex<BTreeMap<u64, Download>>>,\n cv: Arc<Condvar>,\n file_size: u64,\n}\n\nfn fmt_debug(map: &BTreeMap<u64, Download>) -> String {\n map.iter()\n .map(|(pos, dl)| format!(\"-- Start={:0>10} Status={:?}\", pos, dl))\n .join(\"\\n\")\n}\n\nimpl fmt::Debug for FileCache {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n let range_guard = self.ranges.lock().unwrap();\n write!(f, \"{}\", fmt_debug(&*range_guard))\n }\n}\n\nimpl FileCache {\n pub(crate) fn new(file_size: u64) -> Self {\n Self {\n ranges: Arc::new(Mutex::new(BTreeMap::new())),\n cv: Arc::new(Condvar::new()),\n file_size,\n }\n }\n\n \n pub(crate) fn insert(&self, start: u64, download: Download) {\n let mut range_guard = self.ranges.lock().unwrap();\n range_guard.insert(start, download);\n self.cv.notify_all()\n }\n\n fn get_range(&self, start: u64) -> Result<RangeCursor> {\n use std::ops::Bound::{Included, Unbounded};\n let mut ranges_guard = self.ranges.lock().unwrap();\n\n ensure!(ranges_guard.len() > 0, \"No download scheduled\");\n\n let mut before = ranges_guard\n .range((Unbounded, Included(start)))\n .next_back()\n .map(|(start, dl)| (*start, dl.clone()));\n\n while let Some((_, Download::Pending(_))) = before {\n \n ranges_guard = self.cv.wait(ranges_guard).unwrap();\n before = ranges_guard\n .range((Unbounded, Included(start)))\n .next_back()\n .map(|(start, dl)| (*start, dl.clone()));\n }\n\n let before = before.ok_or_else(|| {\n anyhow!(\n \"Download not scheduled at position {}, scheduled ranges are:\\n{}\",\n start,\n fmt_debug(&*ranges_guard),\n )\n })?;\n\n match before.1 {\n Download::Done(bytes) => {\n ensure!(\n before.0 + bytes.len() as u64 > start,\n \"Download not scheduled at position {}, scheduled ranges are:\\n{}\",\n start,\n fmt_debug(&*ranges_guard),\n );\n RangeCursor::try_new(bytes, start - before.0)\n }\n Download::Error(err) => bail!(err),\n Download::Pending(_) => unreachable!(),\n }\n }\n}\n\n#[derive(Clone)]\npub struct FileManager {\n cache: FileCache,\n tx: UnboundedSender<Range>,\n}\n\nimpl FileManager {\n pub(crate) fn new(cache: FileCache, tx: UnboundedSender<Range>) -> Self {\n Self { cache, tx }\n }\n\n \n \n pub fn queue_download(&self, ranges: Vec<Range>) -> Result<()> {\n for range in ranges {\n self.cache\n .insert(range.start, Download::Pending(range.length));\n self.tx.send(range).map_err(|e| anyhow!(e.to_string()))?;\n }\n Ok(())\n }\n\n \n \n \n pub(crate) fn get_range(&self, start: u64) -> Result<RangeCursor> {\n self.cache.get_range(start)\n }\n\n pub fn get_file_size(&self) -> u64 {\n self.cache.file_size\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::super::mock::*;\n use super::super::DownloadCache;\n use super::*;\n\n #[tokio::test]\n async fn test_read_at_0() {\n let file_manager = init_mock(1000).await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n assert_cursor(file_manager, 0, pattern(0, 100))\n .await\n .expect(\"Could not get range at 0 with download of [0:100[\");\n }\n\n #[tokio::test]\n async fn test_read_with_offset() {\n let file_manager = init_mock(1000).await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n assert_cursor(file_manager, 50, pattern(50, 100))\n .await\n .expect(\"Could not get range at 50 with download of [0:100[\");\n }\n\n #[tokio::test]\n async fn test_read_uninited() {\n let file_manager = init_mock(1000).await;\n let err_msg = assert_cursor(file_manager, 0, pattern(0, 100))\n .await\n .expect_err(\"Read file without queued downloads should fail\")\n .to_string();\n\n assert_eq!(err_msg, \"No download scheduled\");\n }\n\n #[tokio::test]\n async fn test_read_outside_download() {\n let file_manager = init_mock(1000).await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n let err_msg = assert_cursor(file_manager, 120, pattern(120, 200))\n .await\n .expect_err(\"Read file without scheduled downloads should fail\")\n .to_string();\n\n assert_eq!(\n err_msg,\n \"\\\nDownload not scheduled at position 120, scheduled ranges are:\n-- Start=0000000000 Status=Done(100 bytes)\"\n );\n }\n\n #[tokio::test]\n async fn test_read_error_downloader() {\n let mut download_cache = DownloadCache::new(1);\n\n let file_manager = download_cache\n .register(Box::new(ErrorFileDescription {}))\n .await;\n\n file_manager\n .queue_download(vec![Range {\n start: 0,\n length: 100,\n }])\n .expect(\"Could not queue Range on handle\");\n\n let error = tokio::task::spawn_blocking(move || -> Result<RangeCursor> {\n file_manager.get_range(0)\n })\n .await\n .unwrap()\n .unwrap_err();\n\n assert_eq!(\n format!(\"{:?}\", error),\n \"Error in ErrorDownloader\\n\\nCaused by:\\n Download Failed\"\n );\n }\n\n async fn init_mock(len: u64) -> FileManager {\n let mut download_cache = DownloadCache::new(1);\n\n let pattern_file_description = PatternFileDescription::new(len);\n\n download_cache\n .register(Box::new(pattern_file_description))\n .await\n }\n\n \n \n async fn assert_cursor(file_manager: FileManager, start: u64, target: Vec<u8>) -> Result<()> {\n let target_length = target.len();\n \n let cursor = tokio::task::spawn_blocking(move || -> Result<RangeCursor> {\n file_manager.get_range(start)\n })\n .await\n .unwrap()?;\n \n let mut content = vec![0u8; target_length];\n cursor.read(&mut content);\n assert_eq!(content, target);\n Ok(())\n }\n}\n"},"middle":{"kind":"string","value":"t: u64) -> Result<Self> {\n ensure!(\n data.len() > offset as usize,\n \"Out of bound in RangeCursor: (offset={}) >= (length={})\",\n offset,\n data.len(),\n );\n Ok(Self { data, offset })\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// A downloader that always returns an error\n\nstruct ErrorDownloader;\n\n\n\n#[async_trait]\n\nimpl Downloader for ErrorDownloader {\n\n async fn download(&self, _file: String, _start: u64, _length: usize) -> Result<Vec<u8>> {\n\n Err(anyhow!(\"Download Failed\").context(\"Error in ErrorDownloader\"))\n\n }\n\n}\n\n\n\n/// A FileDescription implementation that uses [`ErrorDownloader`] to always fail.\n\npub struct ErrorFileDescription {}\n\n\n\nimpl FileDescription for ErrorFileDescription {\n\n fn get_downloader(&self) -> Arc<dyn Downloader> {\n\n Arc::new(ErrorDownloader)\n\n }\n\n\n\n fn get_downloader_id(&self) -> String {\n\n \"error_downloader\".to_owned()\n\n }\n\n\n\n fn get_uri(&self) -> String {\n\n \"error_uri\".to_owned()\n\n }\n\n\n\n fn get_file_size(&self) -> u64 {\n\n 1000\n\n }\n\n}\n","file_path":"src/cache/mock.rs","rank":0,"score":75372.59698021025},{"content":"/// A downloader that returns a simple pattern (1,2,3...254,255,1,2...)\n\n/// Waits for 10ms before returning its result to trigger cache misses\n\nstruct PatternDownloader;\n\n\n","file_path":"src/cache/mock.rs","rank":2,"score":54485.044586960255},{"content":"#[derive(Hash, PartialEq, Eq)]\n\nstruct CacheKey {\n\n pub downloader_id: String,\n\n pub uri: String,\n\n}\n\n\n","file_path":"src/cache/download_cache.rs","rank":3,"score":52488.99767586982},{"content":"type DownloaderMap = Arc<Mutex<HashMap<String, Arc<dyn Downloader>>>>;\n\n\n","file_path":"src/cache/download_cache.rs","rank":4,"score":46255.51126341609},{"content":"type DownloaderFactory = Box<dyn Fn(&str) -> Arc<dyn Downloader> + Send>;\n\n\n\npub struct S3FileDescription {\n\n region: String,\n\n bucket: String,\n\n key: String,\n\n size: u64,\n\n downloader_factory: DownloaderFactory,\n\n}\n\n\n\nimpl S3FileDescription {\n\n pub fn new(region: String, bucket: String, key: String, size: u64) -> Self {\n\n S3FileDescription {\n\n region,\n\n bucket,\n\n key,\n\n size,\n\n downloader_factory: Box::new(move |reg| Arc::new(S3Downloader::new(new_client(reg)))),\n\n }\n\n }\n","file_path":"src/s3_rusoto/file_description.rs","rank":5,"score":40103.426348261106},{"content":"type FileCacheMap = Arc<Mutex<HashMap<CacheKey, FileCache>>>;\n\n\n\n/// [Start Here] Structure for caching download clients and downloaded data chunks.\n\n///\n\n/// The Download cache converts [`FileDescription`] trait objects into instances of [`FileManager`],\n\n/// registering the downloader and the file URI while doing so.\n\n/// The actual download strategy is specified on the [`FileManager`] object.\n\npub struct DownloadCache {\n\n data: FileCacheMap,\n\n downloaders: DownloaderMap,\n\n semaphore: Arc<Semaphore>,\n\n stats: CacheStats,\n\n release_rate: usize,\n\n current_max_parallel: Arc<AtomicUsize>,\n\n absolute_max_parallel: usize,\n\n}\n\n\n\nimpl DownloadCache {\n\n /// Create a cache capable of storing data chunks for multiple files.\n\n /// * `max_parallel` - The maximum number of parallel downloads\n","file_path":"src/cache/download_cache.rs","rank":6,"score":35935.1701377106},{"content":"fn new_client(region: &str) -> S3Client {\n\n let region = Region::from_str(region).unwrap();\n\n S3Client::new(region)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use rusoto_core::signature::SignedRequest;\n\n use rusoto_mock::{MockCredentialsProvider, MockRequestDispatcher};\n\n use rusoto_s3::S3Client;\n\n\n\n #[tokio::test]\n\n async fn test_file_description() {\n\n let mut file_description = S3FileDescription::new(\n\n \"test-region-1\".to_owned(),\n\n \"test_bucket\".to_owned(),\n\n \"test_key\".to_owned(),\n\n 1000,\n\n );\n","file_path":"src/s3_rusoto/file_description.rs","rank":7,"score":26044.529046775857},{"content":"/// The pattern (1,2,3...254,255,1,2...) in the range [start,end[\n\npub fn pattern(start: usize, end: usize) -> Vec<u8> {\n\n (start..end).map(|i| (i % 256) as u8).collect::<Vec<_>>()\n\n}\n\n\n\n#[async_trait]\n\nimpl Downloader for PatternDownloader {\n\n async fn download(&self, _file: String, start: u64, length: usize) -> Result<Vec<u8>> {\n\n tokio::time::sleep(Duration::from_millis(10)).await;\n\n Ok(pattern(start as usize, start as usize + length))\n\n }\n\n}\n\n\n\n/// A FileDescription implementation that uses [`PatternDownloader`] to generate mock bytes\n\npub struct PatternFileDescription {\n\n length: u64,\n\n}\n\n\n\nimpl PatternFileDescription {\n\n #[allow(dead_code)]\n\n pub fn new(length: u64) -> Self {\n","file_path":"src/cache/mock.rs","rank":8,"score":23448.402518127063},{"content":"use std::sync::Arc;\n\n\n\nuse anyhow::{ensure, Context, Result};\n\nuse async_trait::async_trait;\n\nuse rusoto_s3::{GetObjectOutput, GetObjectRequest, S3Client, S3};\n\nuse tokio::io::AsyncReadExt;\n\n\n\nuse crate::Downloader;\n\n\n\n//// Implementation of the `download` function used by the range cache to fetch data\n\n\n\n#[derive(Clone)]\n\npub struct S3Downloader {\n\n client: Arc<S3Client>,\n\n}\n\n\n\n#[async_trait]\n\nimpl Downloader for S3Downloader {\n\n async fn download(&self, uri: String, start: u64, length: usize) -> Result<Vec<u8>> {\n\n let mut file_id_split = uri.split(\"/\");\n","file_path":"src/s3_rusoto/downloader.rs","rank":9,"score":20452.74304578991},{"content":" let range = format!(\"bytes={}-{}\", start, start + length as u64 - 1);\n\n let get_obj_req = GetObjectRequest {\n\n bucket: file_id_split.next().unwrap().to_owned(),\n\n key: file_id_split.collect::<Vec<&str>>().join(\"/\"),\n\n range: Some(range),\n\n ..Default::default()\n\n };\n\n let obj: GetObjectOutput = self\n\n .client\n\n .get_object(get_obj_req)\n\n .await\n\n .context(\"Rusoto GetObject error\")?;\n\n let mut reader = obj.body.unwrap().into_async_read();\n\n let mut res = vec![];\n\n res.reserve(length);\n\n let bytes_read = reader\n\n .read_to_end(&mut res)\n\n .await\n\n .context(\"Rusoto buffer read error\")?;\n\n ensure!(bytes_read == length, \"Not the expected number of bytes\");\n","file_path":"src/s3_rusoto/downloader.rs","rank":10,"score":20448.79090435124},{"content":" Some(x + release_rate)\n\n }\n\n })\n\n .unwrap();\n\n std::cmp::min(\n\n release_rate,\n\n std::cmp::max(absolute_max_parallel - old_current, 1),\n\n )\n\n }\n\n}\n\n\n\nimpl fmt::Debug for DownloadCache {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n let data_guard = self.data.lock().unwrap();\n\n for (key, file_cache) in &*data_guard {\n\n write!(\n\n f,\n\n \"file = {} / {}:\\n{:?}\",\n\n key.downloader_id, key.uri, file_cache\n\n )?;\n","file_path":"src/cache/download_cache.rs","rank":11,"score":20448.550671153098},{"content":" Download::Done(Arc::new(downloaded_chunk))\n\n }\n\n Err(err) => Download::Error(format!(\"{:?}\", err)),\n\n };\n\n file_cache.insert(message.start, dl_enum);\n\n });\n\n }\n\n });\n\n file_manager\n\n }\n\n\n\n /// Provides a reference that gives access to the internal statistics in a synchronized fashion.\n\n pub fn get_stats(&self) -> &CacheStats {\n\n &self.stats\n\n }\n\n\n\n fn register_downloader(&self, file_description: &dyn FileDescription) -> Arc<dyn Downloader> {\n\n let downloader_id = file_description.get_downloader_id();\n\n let mut dls_guard = self.downloaders.lock().unwrap();\n\n let current = dls_guard.get(&downloader_id);\n","file_path":"src/cache/download_cache.rs","rank":12,"score":20447.580168283923},{"content":" let dl_start_time = Instant::now();\n\n\n\n let dl_res = downloader_ref\n\n .download(uri.clone(), message.start, message.length)\n\n .await;\n\n // once the download is completed, release the permit at the configured rate\n\n let new_permits = DownloadCache::permit_leap(\n\n ¤t_max_parallel,\n\n absolute_max_parallel,\n\n release_rate,\n\n );\n\n semaphore_ref.add_permits(new_permits);\n\n let dl_enum = match dl_res {\n\n Ok(downloaded_chunk) => {\n\n stats_ref.record_download(DownloadStat {\n\n dl_duration: dl_start_time.elapsed().as_millis() as u64,\n\n size: downloaded_chunk.len() as u64,\n\n dl_start: dl_start_time.duration_since(register_time).as_millis()\n\n as u64,\n\n });\n","file_path":"src/cache/download_cache.rs","rank":13,"score":20447.440438348804},{"content":" Ok(res)\n\n }\n\n}\n\n\n\nimpl S3Downloader {\n\n pub fn new(client: S3Client) -> Self {\n\n S3Downloader {\n\n client: Arc::new(client),\n\n }\n\n }\n\n}\n","file_path":"src/s3_rusoto/downloader.rs","rank":14,"score":20446.768258835295},{"content":"use std::collections::HashMap;\n\nuse std::fmt;\n\nuse std::sync::atomic::{AtomicUsize, Ordering};\n\nuse std::sync::{Arc, Mutex};\n\nuse std::time::Instant;\n\n\n\nuse tokio::sync::{mpsc::unbounded_channel, Semaphore};\n\n\n\nuse super::file_manager::{Download, FileCache, FileManager};\n\nuse super::{CacheStats, DownloadStat};\n\nuse super::{Downloader, FileDescription, Range};\n\n\n","file_path":"src/cache/download_cache.rs","rank":15,"score":20446.627855339495},{"content":" pub fn new(max_parallel: usize) -> Self {\n\n DownloadCache::new_with(max_parallel, 1, max_parallel)\n\n }\n\n\n\n /// Same as `new(max_parallel)`, but with finer options:\n\n /// * `initial_permits` - The maximum number of parallel downloads initially\n\n /// * `release_rate` - The number of new downloads that can be started each time a download finishes.\n\n /// A `release_rate` of 1 maintains the maximum parallel downloads to the `initial_permits`.\n\n /// * `max_parallel` - The maximum number of parallel downloads\n\n pub fn new_with(initial_permits: usize, release_rate: usize, max_parallel: usize) -> Self {\n\n Self {\n\n data: Arc::new(Mutex::new(HashMap::new())),\n\n downloaders: Arc::new(Mutex::new(HashMap::new())),\n\n semaphore: Arc::new(tokio::sync::Semaphore::new(initial_permits)),\n\n stats: CacheStats::new(),\n\n release_rate,\n\n current_max_parallel: Arc::new(AtomicUsize::new(initial_permits)),\n\n absolute_max_parallel: max_parallel,\n\n }\n\n }\n","file_path":"src/cache/download_cache.rs","rank":16,"score":20445.330519884876},{"content":"\n\n /// Converts a [`FileDescription`] trait object into a [`FileManager`].\n\n /// Spawns a task that will download the file chunks queued on the [`FileManager`].\n\n /// TODO do not re-download chunks if same file was already registered\n\n pub async fn register(&mut self, file_description: Box<dyn FileDescription>) -> FileManager {\n\n let register_time = Instant::now();\n\n let (tx, mut rx) = unbounded_channel::<Range>();\n\n let file_cache;\n\n {\n\n let mut data_guard = self.data.lock().unwrap();\n\n file_cache = data_guard\n\n .entry(CacheKey {\n\n downloader_id: file_description.get_downloader_id(),\n\n uri: file_description.get_uri(),\n\n })\n\n .or_insert_with(|| FileCache::new(file_description.get_file_size()))\n\n .clone();\n\n }\n\n let file_manager = FileManager::new(file_cache.clone(), tx);\n\n let downloader_ref = self.register_downloader(&*file_description);\n","file_path":"src/cache/download_cache.rs","rank":17,"score":20445.273058009738},{"content":" match ¤t {\n\n Some(downloader) => Arc::clone(downloader),\n\n None => {\n\n let new_downloader = file_description.get_downloader();\n\n dls_guard.insert(downloader_id, Arc::clone(&new_downloader));\n\n new_downloader\n\n }\n\n }\n\n }\n\n\n\n fn permit_leap(\n\n current_max_parallel: &AtomicUsize,\n\n absolute_max_parallel: usize,\n\n release_rate: usize,\n\n ) -> usize {\n\n let old_current = current_max_parallel\n\n .fetch_update(Ordering::Relaxed, Ordering::Relaxed, |x| {\n\n if x + release_rate >= absolute_max_parallel {\n\n Some(absolute_max_parallel)\n\n } else {\n","file_path":"src/cache/download_cache.rs","rank":18,"score":20443.44372585098},{"content":" }\n\n Ok(())\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[tokio::test]\n\n async fn test_permit_leap() {\n\n // follow release rate if you can\n\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 3, 1), 1);\n\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 3, 2), 2);\n\n // release what remains before reaching max otherwise\n\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 3, 3), 2);\n\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 2, 3), 1);\n\n // permit leap must be at least one\n\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(3), 3, 3), 1);\n\n }\n\n}\n","file_path":"src/cache/download_cache.rs","rank":19,"score":20443.207651646757},{"content":" let semaphore_ref = Arc::clone(&self.semaphore);\n\n let stat_ref = self.stats.clone();\n\n let release_rate = self.release_rate;\n\n let absolute_max_parallel = self.absolute_max_parallel;\n\n let current_max_parallel = Arc::clone(&self.current_max_parallel);\n\n let uri = file_description.get_uri();\n\n tokio::spawn(async move {\n\n while let Some(message) = rx.recv().await {\n\n // obtain a permit, it will be released once the download completes\n\n let permit = semaphore_ref.acquire().await.unwrap();\n\n permit.forget();\n\n // run download in a dedicated task\n\n let downloader_ref = Arc::clone(&downloader_ref);\n\n let semaphore_ref = Arc::clone(&semaphore_ref);\n\n let current_max_parallel = Arc::clone(¤t_max_parallel);\n\n let stats_ref = stat_ref.clone();\n\n let file_cache = file_cache.clone();\n\n let uri = uri.clone();\n\n tokio::spawn(async move {\n\n // start the actual download\n","file_path":"src/cache/download_cache.rs","rank":20,"score":20439.929895269233},{"content":"#[async_trait]\n\npub trait Downloader: Send + Sync {\n\n async fn download(&self, uri: String, start: u64, length: usize) -> Result<Vec<u8>>;\n\n}\n\n\n\n/// Start and length of a file chunk\n\n#[derive(Deserialize, Clone)]\n\npub struct Range {\n\n pub start: u64,\n\n pub length: usize,\n\n}\n\n\n","file_path":"src/cache/models.rs","rank":21,"score":17538.913343002067},{"content":" }\n\n let cache_cursor = self\n\n .cache\n\n .get_range(self.position)\n\n .map_err(|e| io::Error::new(io::ErrorKind::Other, e))?;\n\n\n\n let bytes_read = cache_cursor.read(buf);\n\n\n\n // update reader position\n\n self.position += bytes_read as u64;\n\n Ok(bytes_read)\n\n }\n\n}\n\n\n\nimpl Seek for CacheCursor {\n\n /// implementation inspired from std::io::Cursor\n\n fn seek(&mut self, pos: io::SeekFrom) -> io::Result<u64> {\n\n let (base_pos, offset) = match pos {\n\n SeekFrom::Start(n) => {\n\n self.position = n;\n","file_path":"src/cache/cursor.rs","rank":26,"score":14.186048883935563},{"content":"\n\n async fn init_mock(len: u64) -> (DownloadCache, FileManager) {\n\n let mut download_cache = DownloadCache::new(2);\n\n\n\n let mock_file_description = PatternFileDescription::new(len);\n\n\n\n let file_manager = download_cache\n\n .register(Box::new(mock_file_description))\n\n .await;\n\n\n\n (download_cache, file_manager)\n\n }\n\n\n\n /// Assert that the next `target.len()` bytes of `cursor` match the bytes in `target`\n\n /// SPAWNS A NEW THREAD TO PERFORM THE READ BECAUSE IT IS BLOCKING!\n\n async fn assert_cursor(cursor: &CacheCursor, target: Vec<u8>) -> io::Result<()> {\n\n let target_length = target.len();\n\n let mut cursor = cursor.clone();\n\n // perform blocking read in separate thread!\n\n let result = tokio::task::spawn_blocking(move || -> io::Result<Vec<u8>> {\n","file_path":"src/cache/cursor.rs","rank":28,"score":11.576447861305667},{"content":" pub(crate) fn record_download(&self, _: DownloadStat) {}\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[tokio::test]\n\n #[cfg(feature = \"stats\")]\n\n async fn test_sync() {\n\n let stats = CacheStats::new();\n\n for d in mock_data() {\n\n stats.record_download(d);\n\n }\n\n let result = stats.recorded_downloads();\n\n assert_eq!(result.len(), mock_data().len())\n\n }\n\n\n\n #[tokio::test]\n","file_path":"src/cache/stats.rs","rank":30,"score":10.859020455107002},{"content":"use std::io::{self, Read, Seek, SeekFrom};\n\n\n\nuse anyhow::anyhow;\n\n\n\nuse super::FileManager;\n\n\n\n/// Cursor that allows the to Read/Seek through a [`FileManager`].\n\n///\n\n/// Blocks if bytes are read that were not yet downloaded\n\n/// Fails if bytes are read that were not scheduled for downloading\n\n#[derive(Clone)]\n\npub struct CacheCursor {\n\n pub cache: FileManager,\n\n pub position: u64,\n\n}\n\n\n\nimpl Read for CacheCursor {\n\n fn read(&mut self, buf: &mut [u8]) -> io::Result<usize> {\n\n if self.position == self.cache.get_file_size() {\n\n return Ok(0);\n","file_path":"src/cache/cursor.rs","rank":32,"score":10.638640585934107},{"content":" impl CacheStats {\n\n pub(crate) fn new() -> Self {\n\n Self {\n\n inner: Arc::new(InnerCacheStats {\n\n downloads: Mutex::new(vec![]),\n\n }),\n\n }\n\n }\n\n\n\n pub fn recorded_downloads(&self) -> Vec<DownloadStat> {\n\n let guard = self.inner.downloads.lock().unwrap();\n\n guard.clone()\n\n }\n\n\n\n pub(crate) fn record_download(&self, dl: DownloadStat) {\n\n let mut guard = self.inner.downloads.lock().unwrap();\n\n guard.push(dl);\n\n }\n\n }\n\n}\n","file_path":"src/cache/stats.rs","rank":36,"score":9.285300114561458},{"content":" cache: file_manager,\n\n position: 0,\n\n };\n\n\n\n let target = pattern(0, file_size as usize);\n\n // perform blocking read in separate thread!\n\n let result = tokio::task::spawn_blocking(move || -> io::Result<Vec<u8>> {\n\n let mut content = vec![];\n\n // we try to read the whole file\n\n cursor.read_to_end(&mut content)?;\n\n Ok(content)\n\n })\n\n .await\n\n .unwrap()\n\n .expect(&format!(\n\n \"Could not read bytes bytes [0:{len}[ in download [0:{len}[\",\n\n len = file_size,\n\n ));\n\n assert_eq!(result, target);\n\n\n","file_path":"src/cache/cursor.rs","rank":37,"score":9.255917967447855},{"content":" return Ok(n);\n\n }\n\n SeekFrom::End(n) => (self.cache.get_file_size(), n),\n\n SeekFrom::Current(n) => (self.position, n),\n\n };\n\n let new_pos = if offset >= 0 {\n\n base_pos.checked_add(offset as u64)\n\n } else {\n\n base_pos.checked_sub((offset.wrapping_neg()) as u64)\n\n };\n\n match new_pos {\n\n Some(n) => {\n\n self.position = n;\n\n Ok(self.position)\n\n }\n\n None => Err(io::Error::new(\n\n io::ErrorKind::InvalidInput,\n\n anyhow!(\"invalid seek to a negative or overflowing position\"),\n\n )),\n\n }\n","file_path":"src/cache/cursor.rs","rank":38,"score":8.833679082587128},{"content":" #[cfg(not(feature = \"stats\"))]\n\n async fn test_noop() {\n\n let stats = CacheStats::new();\n\n for d in mock_data() {\n\n stats.record_download(d);\n\n }\n\n let result = stats.recorded_downloads();\n\n assert_eq!(result.len(), 0)\n\n }\n\n\n\n fn mock_data() -> Vec<DownloadStat> {\n\n vec![\n\n DownloadStat {\n\n dl_duration: 231,\n\n dl_start: 4564,\n\n size: 10000000,\n\n },\n\n DownloadStat {\n\n dl_duration: 123,\n\n dl_start: 6547,\n\n size: 10000000,\n\n },\n\n ]\n\n }\n\n}\n","file_path":"src/cache/stats.rs","rank":39,"score":8.623450234918414},{"content":" Self { length }\n\n }\n\n}\n\n\n\nimpl FileDescription for PatternFileDescription {\n\n fn get_downloader(&self) -> Arc<dyn Downloader> {\n\n Arc::new(PatternDownloader)\n\n }\n\n\n\n fn get_downloader_id(&self) -> String {\n\n \"pattern_downloader\".to_owned()\n\n }\n\n\n\n fn get_uri(&self) -> String {\n\n \"pattern_uri\".to_owned()\n\n }\n\n\n\n fn get_file_size(&self) -> u64 {\n\n self.length\n\n }\n\n}\n\n\n","file_path":"src/cache/mock.rs","rank":41,"score":7.873804320538786},{"content":"\n\n#[allow(dead_code)]\n\npub mod noop {\n\n use super::DownloadStat;\n\n\n\n /// A structure that does noop when called to collect stats.\n\n ///\n\n /// Calls to on this structure will mostly be optimized out by the compiler.\n\n #[derive(Clone)]\n\n pub struct CacheStats;\n\n\n\n impl CacheStats {\n\n pub(crate) fn new() -> Self {\n\n Self\n\n }\n\n\n\n pub fn recorded_downloads(&self) -> Vec<DownloadStat> {\n\n vec![]\n\n }\n\n\n","file_path":"src/cache/stats.rs","rank":42,"score":7.754221970600429},{"content":"-- Start=0000000000 Status=Done(100 bytes)\n\n-- Start=0000000100 Status=Done(100 bytes)\n\n-- Start=0000000200 Status=Done(100 bytes)\"\n\n );\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_read_complete_file() {\n\n let file_size = 100;\n\n let (download_cache, file_manager) = init_mock(file_size).await;\n\n\n\n // we schedule the download of the whole file\n\n file_manager\n\n .queue_download(vec![Range {\n\n start: 0,\n\n length: file_size as usize,\n\n }])\n\n .expect(\"Could not queue Range on handle\");\n\n\n\n let mut cursor = CacheCursor {\n","file_path":"src/cache/cursor.rs","rank":43,"score":7.717175464496954},{"content":" pub fn set_downloader_factory(&mut self, factory: DownloaderFactory) {\n\n self.downloader_factory = factory;\n\n }\n\n}\n\n\n\nimpl FileDescription for S3FileDescription {\n\n fn get_downloader(&self) -> Arc<dyn Downloader> {\n\n (self.downloader_factory)(&self.region)\n\n }\n\n\n\n fn get_downloader_id(&self) -> String {\n\n format!(\"s3_rusoto:{}\", &self.region)\n\n }\n\n\n\n fn get_uri(&self) -> String {\n\n format!(\"{}/{}\", self.bucket, self.key)\n\n }\n\n\n\n fn get_file_size(&self) -> u64 {\n\n self.size\n\n }\n\n}\n\n\n","file_path":"src/s3_rusoto/file_description.rs","rank":44,"score":7.1509586450538745},{"content":"-- Start=0000000200 Status=Pending(100 bytes)\"\n\n );\n\n\n\n // try reading after of downloaded range\n\n cursor\n\n .seek(SeekFrom::Start(280))\n\n .expect(\"Cursor could not be moved\");\n\n let err_msg = assert_cursor(&cursor, pattern(0, 50))\n\n .await\n\n .expect_err(\"Read of [280:320[ should fail, only [200,300[ was downloaded\")\n\n .to_string();\n\n assert_eq!(\n\n err_msg,\n\n \"\\\n\nDownload not scheduled at position 300, scheduled ranges are:\n\n-- Start=0000000200 Status=Done(100 bytes)\"\n\n );\n\n }\n\n\n\n #[tokio::test]\n","file_path":"src/cache/cursor.rs","rank":45,"score":7.041952365065509},{"content":"use super::super::{Downloader, FileDescription};\n\nuse anyhow::{anyhow, Result};\n\nuse async_trait::async_trait;\n\nuse std::sync::Arc;\n\n\n\nuse tokio::time::Duration;\n\n\n\n/// A downloader that returns a simple pattern (1,2,3...254,255,1,2...)\n\n/// Waits for 10ms before returning its result to trigger cache misses\n","file_path":"src/cache/mock.rs","rank":46,"score":6.903894322400914},{"content":"pub use sync::CacheStats;\n\n\n\n#[allow(dead_code)]\n\npub mod sync {\n\n use super::DownloadStat;\n\n use std::sync::{Arc, Mutex};\n\n\n\n struct InnerCacheStats {\n\n downloads: Mutex<Vec<DownloadStat>>,\n\n }\n\n\n\n /// Reference to a synchronized container with inner statistics of the caching system.\n\n ///\n\n /// You can get these stats from the [`DownloadCache`](super::super::DownloadCache) directly.\n\n /// Clonig this object only clones the reference.\n\n #[derive(Clone)]\n\n pub struct CacheStats {\n\n inner: Arc<InnerCacheStats>,\n\n }\n\n\n","file_path":"src/cache/stats.rs","rank":48,"score":6.6118153862566285},{"content":"//! The stats module has two implementations that you can switch with the `stats` feature:\n\n//! - the `sync` module is a shared reference to synchronized statistics collectors\n\n//! - the `noop` module is an empty structure that does not collect any statistics\n\n\n\nuse serde::Serialize;\n\n\n\n/// KPIs relative to one specific range download\n\n#[derive(Clone, Serialize)]\n\npub struct DownloadStat {\n\n // range size in bytes\n\n pub size: u64,\n\n /// ms spent inside download function\n\n pub dl_duration: u64,\n\n /// ms elapsed since registering\n\n pub dl_start: u64,\n\n}\n\n\n\n#[cfg(not(feature = \"stats\"))]\n\npub use noop::CacheStats;\n\n#[cfg(feature = \"stats\")]\n","file_path":"src/cache/stats.rs","rank":49,"score":6.485771552041668},{"content":" // check the debug output for the cache\n\n assert_eq!(\n\n format!(\"{:?}\", download_cache),\n\n \"\\\n\nfile = pattern_downloader / pattern_uri:\n\n-- Start=0000000000 Status=Done(100 bytes)\"\n\n );\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_read_uninit() {\n\n let (_, file_manager) = init_mock(1000).await;\n\n\n\n let mut cursor = CacheCursor {\n\n cache: file_manager.clone(),\n\n position: 0,\n\n };\n\n\n\n // try reading whithout starting any download\n\n let err_msg = assert_cursor(&cursor, pattern(0, 50))\n","file_path":"src/cache/cursor.rs","rank":50,"score":5.8582336259571095},{"content":"file = pattern_downloader / pattern_uri:\n\n-- Start=0000000000 Status=Done(100 bytes)\"\n\n );\n\n }\n\n\n\n #[tokio::test]\n\n async fn test_read_accross_ranges() {\n\n let (download_cache, file_manager) = init_mock(1000).await;\n\n\n\n file_manager\n\n .queue_download(vec![\n\n Range {\n\n start: 200,\n\n length: 100,\n\n },\n\n Range {\n\n start: 0,\n\n length: 100,\n\n },\n\n Range {\n","file_path":"src/cache/cursor.rs","rank":51,"score":5.501665488483848},{"content":"use std::str::FromStr;\n\nuse std::sync::Arc;\n\n\n\nuse super::S3Downloader;\n\nuse crate::{Downloader, FileDescription};\n\n\n\nuse rusoto_core::Region;\n\nuse rusoto_s3::S3Client;\n\n\n","file_path":"src/s3_rusoto/file_description.rs","rank":52,"score":5.253599702680495},{"content":"use std::sync::Arc;\n\n\n\nuse anyhow::Result;\n\nuse async_trait::async_trait;\n\nuse serde::Deserialize;\n\n\n\n/// Connection to a server that allows to download chunks of files\n\n#[async_trait]\n","file_path":"src/cache/models.rs","rank":53,"score":5.133833358947118},{"content":"//! Optimized and flexible helpers for reading large data files from cloud storages (or more generally, from the network).\n\n//!\n\n//! To get started, create an instance of `DownloadCache` and start registering `FileDescription` trait objects.\n\n\n\nmod cache;\n\npub use cache::*;\n\n\n\n#[cfg(feature = \"s3_rusoto\")]\n\npub mod s3_rusoto;\n","file_path":"src/lib.rs","rank":54,"score":4.917701686478408},{"content":" let mut content = vec![0u8; target_length];\n\n cursor.read_exact(&mut content)?;\n\n Ok(content)\n\n })\n\n .await\n\n .unwrap()?;\n\n assert_eq!(result, target);\n\n Ok(())\n\n }\n\n}\n","file_path":"src/cache/cursor.rs","rank":55,"score":4.831788915809531},{"content":"mod cursor;\n\nmod download_cache;\n\nmod file_manager;\n\nmod mock;\n\nmod models;\n\nmod stats;\n\n\n\npub use cursor::CacheCursor;\n\npub use download_cache::DownloadCache;\n\npub use file_manager::FileManager;\n\npub use models::*;\n\npub use stats::{CacheStats, DownloadStat};\n","file_path":"src/cache/mod.rs","rank":56,"score":4.748978773332439},{"content":"//! [`FileDescription`](`crate::FileDescription`) implementation for downloading from S3 using Rusoto\n\n\n\nmod downloader;\n\nmod file_description;\n\n\n\nuse downloader::S3Downloader;\n\npub use file_description::S3FileDescription;\n","file_path":"src/s3_rusoto/mod.rs","rank":57,"score":4.371164331221088},{"content":" file_description.set_downloader_factory(Box::new(|_| {\n\n let client = S3Client::new_with(\n\n MockRequestDispatcher::default()\n\n .with_body(\"\")\n\n .with_request_checker(|request: &SignedRequest| {\n\n assert_eq!(request.path, \"/test_bucket/test_key\");\n\n assert_eq!(\n\n std::str::from_utf8(&request.headers.get(\"range\").unwrap()[0]).unwrap(),\n\n \"bytes=50-149\"\n\n );\n\n }),\n\n MockCredentialsProvider,\n\n Default::default(),\n\n );\n\n Arc::new(S3Downloader::new(client))\n\n }));\n\n\n\n #[allow(unused_must_use)]\n\n {\n\n file_description\n\n .get_downloader()\n\n .download(file_description.get_uri(), 50, 100)\n\n .await;\n\n }\n\n }\n\n}\n","file_path":"src/s3_rusoto/file_description.rs","rank":58,"score":4.365753906086436},{"content":" }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::super::{mock::*, DownloadCache, Range};\n\n use super::*;\n\n\n\n use std::io::{self, Read, Seek, SeekFrom};\n\n\n\n #[tokio::test]\n\n async fn test_read_within_range() {\n\n let (download_cache, file_manager) = init_mock(1000).await;\n\n\n\n file_manager\n\n .queue_download(vec![Range {\n\n start: 0,\n\n length: 100,\n\n }])\n\n .expect(\"Could not queue Range on handle\");\n","file_path":"src/cache/cursor.rs","rank":59,"score":4.2687405505020415},{"content":"\n\n let mut cursor = CacheCursor {\n\n cache: file_manager,\n\n position: 0,\n\n };\n\n\n\n assert_cursor(&cursor, pattern(0, 50))\n\n .await\n\n .expect(\"could not read enough bytes [0:50[ in download [0:100[\");\n\n cursor\n\n .seek(SeekFrom::Start(20))\n\n .expect(\"Cursor could not be moved\");\n\n assert_cursor(&cursor, pattern(20, 70))\n\n .await\n\n .expect(\"Could not read bytes bytes [20:70[ in download [0:100[\");\n\n\n\n // check the debug output for the cache\n\n assert_eq!(\n\n format!(\"{:?}\", download_cache),\n\n \"\\\n","file_path":"src/cache/cursor.rs","rank":60,"score":4.234722579987321},{"content":"## Proposed solution\n\n\n\nThe proposed solution is to introduce a dedicated data structure that takes care of scheduling the downloads and caching the results, while providing a blocking API that implements the `std::io::Read` trait. The scheduling strategy remains customizable to adapt to different types of reads (chunks of a Parquet file will be read in a different order thant those of a CSV file) and different infrastructures (Cloud storage will behave differently from an on-premise HDFS). But most of the caching and synchronization mechanismes will be common to all the use cases.\n\n\n\nThe proposed strategy is the following one:\n\n\n\n\n\n\n\nIf we apply it to the specific usecase of [Buzz](https://github.com/cloudfuse-io/buzz-rust), it boils down to this:\n\n\n\n\n\n\n\n## Using the library\n\n\n\nThe library has a `stats` feature flag that allows to control whether it should collect execution statistics or not.\n","file_path":"README.md","rank":61,"score":3.947601724587573},{"content":"/// Fully specified description of a downloadable file\n\n///\n\n/// To make it fully generic, a FileDescription provides its own downloader.\n\n/// It also provides a downloader_id to allow the [`DownloadCache`](super::DownloadCache) to cache the downloader.\n\n/// It is not the responsability of the FileDescription to cache the downloader.\n\n/// Downloaders that will most efficiently be re-usable for a given set of files should be assigned the same id.\n\n/// For instance for AWS S3, this will be by region as the domain will be the same, which allows full re-use of\n\n/// the SSL connection (TODO: verify if it is not actually by bucket).\n\npub trait FileDescription: Send {\n\n fn get_downloader(&self) -> Arc<dyn Downloader>;\n\n\n\n fn get_downloader_id(&self) -> String;\n\n\n\n fn get_uri(&self) -> String;\n\n\n\n fn get_file_size(&self) -> u64;\n\n}\n","file_path":"src/cache/models.rs","rank":62,"score":3.8157021417133747},{"content":"# :cloud: Rust Cloud Readers :cloud:\n\n\n\n[](LICENSE)\n\n\n\n[](https://codecov.io/gh/cloudfuse-io/cloud-readers-rs)\n\n\n\nOptimized and flexible helpers for reading large data files from cloud storages (or more generally, from the network).\n\n\n\n## Context\n\n\n\nMost client libraries to read from the network in Rust are async. One example is the AWS S3 client library. On the other hand, data processing systems prefer to read data using the `std::io::Read` trait that is blocking, partly because it is more performant for large files, partly beacause many data processing libraries such as protobuf use that trait in their interfaces. In that case, the data processing flow looks like this:\n\n\n\n\n\n\n\nIf we apply this to the example of [Buzz](https://github.com/cloudfuse-io/buzz-rust), we get the following flow:\n\n\n\n\n\n\n\nAdditionally, the strategy to fetch data from the network will be different from reading from a high bandwith hard drive. When reading local data, the bottleneck might be the CPU and not the disk bandwidth, and even if that is not the case, you will usually not get much benefit from reading multiple chunks in parallel as one read stream will already fully utilizes the bandwidth of the disk (this might not be completely true when multiple drives are attached). The situation is completely different when reading from the network. Each read will usually be throttled on the data provider side. When using AWS S3 for instance, you get a much better overall bandwidth if you read 8 chunks in parallel (even for a single file). This means that it is worth decoupling the read strategy from the processing by eagerly downloading and caching in memory for future processings.\n\n\n","file_path":"README.md","rank":63,"score":3.7891082396953326},{"content":" start: 100,\n\n length: 100,\n\n },\n\n ])\n\n .expect(\"Could not queue Range on handle\");\n\n\n\n let cursor = CacheCursor {\n\n cache: file_manager,\n\n position: 0,\n\n };\n\n\n\n assert_cursor(&cursor, pattern(0, 300))\n\n .await\n\n .expect(\"Could not read bytes bytes [0:300[ in download [0:100[+[100:200[+[200:300[\");\n\n\n\n // check the debug output for the cache\n\n assert_eq!(\n\n format!(\"{:?}\", download_cache),\n\n \"\\\n\nfile = pattern_downloader / pattern_uri:\n","file_path":"src/cache/cursor.rs","rank":64,"score":3.7327737049963927},{"content":"# Notebook folder\n\n\n\nThis folder contains the results of some performance tests conducted on the library when using cloud storage. To make them easily readeable and reproduceable, we used Jupyter notebooks and Docker.\n\n\n\n## Deploying the infrastructure\n\n\n\nTo be able to run the tests with a cloud storage, you first need to deploy the benchmarking executable otherwise you would mainly be measuring your network latency to the cloud.\n\n\n\nTo run the notebooks, install Jupyter and run `jupyter lab` at the root of the project.\n\n\n\nThe notebook [`infra.ipynb`](infra.ipynb) helps you deploy an AWS Lambda function into one of your AWS accounts. You just need your credentials to be configured in the default AWS credentials file and change the `AWS_PROFILE` environment variable before starting jupyter to match your setup.\n\n\n\nWith the same notbook, you can also tear down the infrastructure that was deployed previously. The Terraform state is stored on a local docker volume. If you delete it before running `terraform destroy`, you won't be able to tear down the infrastructure automatically any more.\n\n\n\n## Running the benchmarks\n\n\n\nYou can run the tests by calling the AWS Lambda function deployed previously. \n\n\n\nNote that if you want to run tests on files that are not publicly exposed, you will need to provide the appropriate policy to the Lambda function in the Terraform script.\n\n\n","file_path":"notebooks/README.md","rank":66,"score":3.1375168109905305},{"content":" .await\n\n .expect_err(\"Read should fail if no download was scheduled\")\n\n .to_string();\n\n assert_eq!(err_msg, \"No download scheduled\");\n\n\n\n // try reading before of downloaded range\n\n file_manager\n\n .queue_download(vec![Range {\n\n start: 200,\n\n length: 100,\n\n }])\n\n .expect(\"Could not queue Range on handle\");\n\n let err_msg = assert_cursor(&cursor, pattern(0, 50))\n\n .await\n\n .expect_err(\"Read of [0:50[ should fail, only [200,300[ was downloaded\")\n\n .to_string();\n\n assert_eq!(\n\n err_msg,\n\n \"\\\n\nDownload not scheduled at position 0, scheduled ranges are:\n","file_path":"src/cache/cursor.rs","rank":68,"score":1.6394254704938664},{"content":" async fn test_seek() {\n\n let mut cursor = CacheCursor {\n\n cache: init_mock(100).await.1,\n\n position: 0,\n\n };\n\n\n\n cursor.seek(SeekFrom::Start(10)).unwrap();\n\n\n\n assert_eq!(cursor.position, 10);\n\n\n\n cursor.seek(SeekFrom::Current(10)).unwrap();\n\n\n\n assert_eq!(cursor.position, 20);\n\n\n\n cursor.seek(SeekFrom::End(-10)).unwrap();\n\n\n\n assert_eq!(cursor.position, 90);\n\n }\n\n\n\n //// Test Fixtures: ////\n","file_path":"src/cache/cursor.rs","rank":69,"score":1.6275246397173198}],"string":"[\n {\n \"content\": \"/// A downloader that always returns an error\\n\\nstruct ErrorDownloader;\\n\\n\\n\\n#[async_trait]\\n\\nimpl Downloader for ErrorDownloader {\\n\\n async fn download(&self, _file: String, _start: u64, _length: usize) -> Result<Vec<u8>> {\\n\\n Err(anyhow!(\\\"Download Failed\\\").context(\\\"Error in ErrorDownloader\\\"))\\n\\n }\\n\\n}\\n\\n\\n\\n/// A FileDescription implementation that uses [`ErrorDownloader`] to always fail.\\n\\npub struct ErrorFileDescription {}\\n\\n\\n\\nimpl FileDescription for ErrorFileDescription {\\n\\n fn get_downloader(&self) -> Arc<dyn Downloader> {\\n\\n Arc::new(ErrorDownloader)\\n\\n }\\n\\n\\n\\n fn get_downloader_id(&self) -> String {\\n\\n \\\"error_downloader\\\".to_owned()\\n\\n }\\n\\n\\n\\n fn get_uri(&self) -> String {\\n\\n \\\"error_uri\\\".to_owned()\\n\\n }\\n\\n\\n\\n fn get_file_size(&self) -> u64 {\\n\\n 1000\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cache/mock.rs\",\n \"rank\": 0,\n \"score\": 75372.59698021025\n },\n {\n \"content\": \"/// A downloader that returns a simple pattern (1,2,3...254,255,1,2...)\\n\\n/// Waits for 10ms before returning its result to trigger cache misses\\n\\nstruct PatternDownloader;\\n\\n\\n\",\n \"file_path\": \"src/cache/mock.rs\",\n \"rank\": 2,\n \"score\": 54485.044586960255\n },\n {\n \"content\": \"#[derive(Hash, PartialEq, Eq)]\\n\\nstruct CacheKey {\\n\\n pub downloader_id: String,\\n\\n pub uri: String,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 3,\n \"score\": 52488.99767586982\n },\n {\n \"content\": \"type DownloaderMap = Arc<Mutex<HashMap<String, Arc<dyn Downloader>>>>;\\n\\n\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 4,\n \"score\": 46255.51126341609\n },\n {\n \"content\": \"type DownloaderFactory = Box<dyn Fn(&str) -> Arc<dyn Downloader> + Send>;\\n\\n\\n\\npub struct S3FileDescription {\\n\\n region: String,\\n\\n bucket: String,\\n\\n key: String,\\n\\n size: u64,\\n\\n downloader_factory: DownloaderFactory,\\n\\n}\\n\\n\\n\\nimpl S3FileDescription {\\n\\n pub fn new(region: String, bucket: String, key: String, size: u64) -> Self {\\n\\n S3FileDescription {\\n\\n region,\\n\\n bucket,\\n\\n key,\\n\\n size,\\n\\n downloader_factory: Box::new(move |reg| Arc::new(S3Downloader::new(new_client(reg)))),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/s3_rusoto/file_description.rs\",\n \"rank\": 5,\n \"score\": 40103.426348261106\n },\n {\n \"content\": \"type FileCacheMap = Arc<Mutex<HashMap<CacheKey, FileCache>>>;\\n\\n\\n\\n/// [Start Here] Structure for caching download clients and downloaded data chunks.\\n\\n///\\n\\n/// The Download cache converts [`FileDescription`] trait objects into instances of [`FileManager`],\\n\\n/// registering the downloader and the file URI while doing so.\\n\\n/// The actual download strategy is specified on the [`FileManager`] object.\\n\\npub struct DownloadCache {\\n\\n data: FileCacheMap,\\n\\n downloaders: DownloaderMap,\\n\\n semaphore: Arc<Semaphore>,\\n\\n stats: CacheStats,\\n\\n release_rate: usize,\\n\\n current_max_parallel: Arc<AtomicUsize>,\\n\\n absolute_max_parallel: usize,\\n\\n}\\n\\n\\n\\nimpl DownloadCache {\\n\\n /// Create a cache capable of storing data chunks for multiple files.\\n\\n /// * `max_parallel` - The maximum number of parallel downloads\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 6,\n \"score\": 35935.1701377106\n },\n {\n \"content\": \"fn new_client(region: &str) -> S3Client {\\n\\n let region = Region::from_str(region).unwrap();\\n\\n S3Client::new(region)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use rusoto_core::signature::SignedRequest;\\n\\n use rusoto_mock::{MockCredentialsProvider, MockRequestDispatcher};\\n\\n use rusoto_s3::S3Client;\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_file_description() {\\n\\n let mut file_description = S3FileDescription::new(\\n\\n \\\"test-region-1\\\".to_owned(),\\n\\n \\\"test_bucket\\\".to_owned(),\\n\\n \\\"test_key\\\".to_owned(),\\n\\n 1000,\\n\\n );\\n\",\n \"file_path\": \"src/s3_rusoto/file_description.rs\",\n \"rank\": 7,\n \"score\": 26044.529046775857\n },\n {\n \"content\": \"/// The pattern (1,2,3...254,255,1,2...) in the range [start,end[\\n\\npub fn pattern(start: usize, end: usize) -> Vec<u8> {\\n\\n (start..end).map(|i| (i % 256) as u8).collect::<Vec<_>>()\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\\nimpl Downloader for PatternDownloader {\\n\\n async fn download(&self, _file: String, start: u64, length: usize) -> Result<Vec<u8>> {\\n\\n tokio::time::sleep(Duration::from_millis(10)).await;\\n\\n Ok(pattern(start as usize, start as usize + length))\\n\\n }\\n\\n}\\n\\n\\n\\n/// A FileDescription implementation that uses [`PatternDownloader`] to generate mock bytes\\n\\npub struct PatternFileDescription {\\n\\n length: u64,\\n\\n}\\n\\n\\n\\nimpl PatternFileDescription {\\n\\n #[allow(dead_code)]\\n\\n pub fn new(length: u64) -> Self {\\n\",\n \"file_path\": \"src/cache/mock.rs\",\n \"rank\": 8,\n \"score\": 23448.402518127063\n },\n {\n \"content\": \"use std::sync::Arc;\\n\\n\\n\\nuse anyhow::{ensure, Context, Result};\\n\\nuse async_trait::async_trait;\\n\\nuse rusoto_s3::{GetObjectOutput, GetObjectRequest, S3Client, S3};\\n\\nuse tokio::io::AsyncReadExt;\\n\\n\\n\\nuse crate::Downloader;\\n\\n\\n\\n//// Implementation of the `download` function used by the range cache to fetch data\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct S3Downloader {\\n\\n client: Arc<S3Client>,\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\\nimpl Downloader for S3Downloader {\\n\\n async fn download(&self, uri: String, start: u64, length: usize) -> Result<Vec<u8>> {\\n\\n let mut file_id_split = uri.split(\\\"/\\\");\\n\",\n \"file_path\": \"src/s3_rusoto/downloader.rs\",\n \"rank\": 9,\n \"score\": 20452.74304578991\n },\n {\n \"content\": \" let range = format!(\\\"bytes={}-{}\\\", start, start + length as u64 - 1);\\n\\n let get_obj_req = GetObjectRequest {\\n\\n bucket: file_id_split.next().unwrap().to_owned(),\\n\\n key: file_id_split.collect::<Vec<&str>>().join(\\\"/\\\"),\\n\\n range: Some(range),\\n\\n ..Default::default()\\n\\n };\\n\\n let obj: GetObjectOutput = self\\n\\n .client\\n\\n .get_object(get_obj_req)\\n\\n .await\\n\\n .context(\\\"Rusoto GetObject error\\\")?;\\n\\n let mut reader = obj.body.unwrap().into_async_read();\\n\\n let mut res = vec![];\\n\\n res.reserve(length);\\n\\n let bytes_read = reader\\n\\n .read_to_end(&mut res)\\n\\n .await\\n\\n .context(\\\"Rusoto buffer read error\\\")?;\\n\\n ensure!(bytes_read == length, \\\"Not the expected number of bytes\\\");\\n\",\n \"file_path\": \"src/s3_rusoto/downloader.rs\",\n \"rank\": 10,\n \"score\": 20448.79090435124\n },\n {\n \"content\": \" Some(x + release_rate)\\n\\n }\\n\\n })\\n\\n .unwrap();\\n\\n std::cmp::min(\\n\\n release_rate,\\n\\n std::cmp::max(absolute_max_parallel - old_current, 1),\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for DownloadCache {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n let data_guard = self.data.lock().unwrap();\\n\\n for (key, file_cache) in &*data_guard {\\n\\n write!(\\n\\n f,\\n\\n \\\"file = {} / {}:\\\\n{:?}\\\",\\n\\n key.downloader_id, key.uri, file_cache\\n\\n )?;\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 11,\n \"score\": 20448.550671153098\n },\n {\n \"content\": \" Download::Done(Arc::new(downloaded_chunk))\\n\\n }\\n\\n Err(err) => Download::Error(format!(\\\"{:?}\\\", err)),\\n\\n };\\n\\n file_cache.insert(message.start, dl_enum);\\n\\n });\\n\\n }\\n\\n });\\n\\n file_manager\\n\\n }\\n\\n\\n\\n /// Provides a reference that gives access to the internal statistics in a synchronized fashion.\\n\\n pub fn get_stats(&self) -> &CacheStats {\\n\\n &self.stats\\n\\n }\\n\\n\\n\\n fn register_downloader(&self, file_description: &dyn FileDescription) -> Arc<dyn Downloader> {\\n\\n let downloader_id = file_description.get_downloader_id();\\n\\n let mut dls_guard = self.downloaders.lock().unwrap();\\n\\n let current = dls_guard.get(&downloader_id);\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 12,\n \"score\": 20447.580168283923\n },\n {\n \"content\": \" let dl_start_time = Instant::now();\\n\\n\\n\\n let dl_res = downloader_ref\\n\\n .download(uri.clone(), message.start, message.length)\\n\\n .await;\\n\\n // once the download is completed, release the permit at the configured rate\\n\\n let new_permits = DownloadCache::permit_leap(\\n\\n ¤t_max_parallel,\\n\\n absolute_max_parallel,\\n\\n release_rate,\\n\\n );\\n\\n semaphore_ref.add_permits(new_permits);\\n\\n let dl_enum = match dl_res {\\n\\n Ok(downloaded_chunk) => {\\n\\n stats_ref.record_download(DownloadStat {\\n\\n dl_duration: dl_start_time.elapsed().as_millis() as u64,\\n\\n size: downloaded_chunk.len() as u64,\\n\\n dl_start: dl_start_time.duration_since(register_time).as_millis()\\n\\n as u64,\\n\\n });\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 13,\n \"score\": 20447.440438348804\n },\n {\n \"content\": \" Ok(res)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl S3Downloader {\\n\\n pub fn new(client: S3Client) -> Self {\\n\\n S3Downloader {\\n\\n client: Arc::new(client),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/s3_rusoto/downloader.rs\",\n \"rank\": 14,\n \"score\": 20446.768258835295\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::fmt;\\n\\nuse std::sync::atomic::{AtomicUsize, Ordering};\\n\\nuse std::sync::{Arc, Mutex};\\n\\nuse std::time::Instant;\\n\\n\\n\\nuse tokio::sync::{mpsc::unbounded_channel, Semaphore};\\n\\n\\n\\nuse super::file_manager::{Download, FileCache, FileManager};\\n\\nuse super::{CacheStats, DownloadStat};\\n\\nuse super::{Downloader, FileDescription, Range};\\n\\n\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 15,\n \"score\": 20446.627855339495\n },\n {\n \"content\": \" pub fn new(max_parallel: usize) -> Self {\\n\\n DownloadCache::new_with(max_parallel, 1, max_parallel)\\n\\n }\\n\\n\\n\\n /// Same as `new(max_parallel)`, but with finer options:\\n\\n /// * `initial_permits` - The maximum number of parallel downloads initially\\n\\n /// * `release_rate` - The number of new downloads that can be started each time a download finishes.\\n\\n /// A `release_rate` of 1 maintains the maximum parallel downloads to the `initial_permits`.\\n\\n /// * `max_parallel` - The maximum number of parallel downloads\\n\\n pub fn new_with(initial_permits: usize, release_rate: usize, max_parallel: usize) -> Self {\\n\\n Self {\\n\\n data: Arc::new(Mutex::new(HashMap::new())),\\n\\n downloaders: Arc::new(Mutex::new(HashMap::new())),\\n\\n semaphore: Arc::new(tokio::sync::Semaphore::new(initial_permits)),\\n\\n stats: CacheStats::new(),\\n\\n release_rate,\\n\\n current_max_parallel: Arc::new(AtomicUsize::new(initial_permits)),\\n\\n absolute_max_parallel: max_parallel,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 16,\n \"score\": 20445.330519884876\n },\n {\n \"content\": \"\\n\\n /// Converts a [`FileDescription`] trait object into a [`FileManager`].\\n\\n /// Spawns a task that will download the file chunks queued on the [`FileManager`].\\n\\n /// TODO do not re-download chunks if same file was already registered\\n\\n pub async fn register(&mut self, file_description: Box<dyn FileDescription>) -> FileManager {\\n\\n let register_time = Instant::now();\\n\\n let (tx, mut rx) = unbounded_channel::<Range>();\\n\\n let file_cache;\\n\\n {\\n\\n let mut data_guard = self.data.lock().unwrap();\\n\\n file_cache = data_guard\\n\\n .entry(CacheKey {\\n\\n downloader_id: file_description.get_downloader_id(),\\n\\n uri: file_description.get_uri(),\\n\\n })\\n\\n .or_insert_with(|| FileCache::new(file_description.get_file_size()))\\n\\n .clone();\\n\\n }\\n\\n let file_manager = FileManager::new(file_cache.clone(), tx);\\n\\n let downloader_ref = self.register_downloader(&*file_description);\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 17,\n \"score\": 20445.273058009738\n },\n {\n \"content\": \" match ¤t {\\n\\n Some(downloader) => Arc::clone(downloader),\\n\\n None => {\\n\\n let new_downloader = file_description.get_downloader();\\n\\n dls_guard.insert(downloader_id, Arc::clone(&new_downloader));\\n\\n new_downloader\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn permit_leap(\\n\\n current_max_parallel: &AtomicUsize,\\n\\n absolute_max_parallel: usize,\\n\\n release_rate: usize,\\n\\n ) -> usize {\\n\\n let old_current = current_max_parallel\\n\\n .fetch_update(Ordering::Relaxed, Ordering::Relaxed, |x| {\\n\\n if x + release_rate >= absolute_max_parallel {\\n\\n Some(absolute_max_parallel)\\n\\n } else {\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 18,\n \"score\": 20443.44372585098\n },\n {\n \"content\": \" }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_permit_leap() {\\n\\n // follow release rate if you can\\n\\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 3, 1), 1);\\n\\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 3, 2), 2);\\n\\n // release what remains before reaching max otherwise\\n\\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 3, 3), 2);\\n\\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(1), 2, 3), 1);\\n\\n // permit leap must be at least one\\n\\n assert_eq!(DownloadCache::permit_leap(&AtomicUsize::new(3), 3, 3), 1);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 19,\n \"score\": 20443.207651646757\n },\n {\n \"content\": \" let semaphore_ref = Arc::clone(&self.semaphore);\\n\\n let stat_ref = self.stats.clone();\\n\\n let release_rate = self.release_rate;\\n\\n let absolute_max_parallel = self.absolute_max_parallel;\\n\\n let current_max_parallel = Arc::clone(&self.current_max_parallel);\\n\\n let uri = file_description.get_uri();\\n\\n tokio::spawn(async move {\\n\\n while let Some(message) = rx.recv().await {\\n\\n // obtain a permit, it will be released once the download completes\\n\\n let permit = semaphore_ref.acquire().await.unwrap();\\n\\n permit.forget();\\n\\n // run download in a dedicated task\\n\\n let downloader_ref = Arc::clone(&downloader_ref);\\n\\n let semaphore_ref = Arc::clone(&semaphore_ref);\\n\\n let current_max_parallel = Arc::clone(¤t_max_parallel);\\n\\n let stats_ref = stat_ref.clone();\\n\\n let file_cache = file_cache.clone();\\n\\n let uri = uri.clone();\\n\\n tokio::spawn(async move {\\n\\n // start the actual download\\n\",\n \"file_path\": \"src/cache/download_cache.rs\",\n \"rank\": 20,\n \"score\": 20439.929895269233\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait Downloader: Send + Sync {\\n\\n async fn download(&self, uri: String, start: u64, length: usize) -> Result<Vec<u8>>;\\n\\n}\\n\\n\\n\\n/// Start and length of a file chunk\\n\\n#[derive(Deserialize, Clone)]\\n\\npub struct Range {\\n\\n pub start: u64,\\n\\n pub length: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/models.rs\",\n \"rank\": 21,\n \"score\": 17538.913343002067\n },\n {\n \"content\": \" }\\n\\n let cache_cursor = self\\n\\n .cache\\n\\n .get_range(self.position)\\n\\n .map_err(|e| io::Error::new(io::ErrorKind::Other, e))?;\\n\\n\\n\\n let bytes_read = cache_cursor.read(buf);\\n\\n\\n\\n // update reader position\\n\\n self.position += bytes_read as u64;\\n\\n Ok(bytes_read)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Seek for CacheCursor {\\n\\n /// implementation inspired from std::io::Cursor\\n\\n fn seek(&mut self, pos: io::SeekFrom) -> io::Result<u64> {\\n\\n let (base_pos, offset) = match pos {\\n\\n SeekFrom::Start(n) => {\\n\\n self.position = n;\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 26,\n \"score\": 14.186048883935563\n },\n {\n \"content\": \"\\n\\n async fn init_mock(len: u64) -> (DownloadCache, FileManager) {\\n\\n let mut download_cache = DownloadCache::new(2);\\n\\n\\n\\n let mock_file_description = PatternFileDescription::new(len);\\n\\n\\n\\n let file_manager = download_cache\\n\\n .register(Box::new(mock_file_description))\\n\\n .await;\\n\\n\\n\\n (download_cache, file_manager)\\n\\n }\\n\\n\\n\\n /// Assert that the next `target.len()` bytes of `cursor` match the bytes in `target`\\n\\n /// SPAWNS A NEW THREAD TO PERFORM THE READ BECAUSE IT IS BLOCKING!\\n\\n async fn assert_cursor(cursor: &CacheCursor, target: Vec<u8>) -> io::Result<()> {\\n\\n let target_length = target.len();\\n\\n let mut cursor = cursor.clone();\\n\\n // perform blocking read in separate thread!\\n\\n let result = tokio::task::spawn_blocking(move || -> io::Result<Vec<u8>> {\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 28,\n \"score\": 11.576447861305667\n },\n {\n \"content\": \" pub(crate) fn record_download(&self, _: DownloadStat) {}\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[tokio::test]\\n\\n #[cfg(feature = \\\"stats\\\")]\\n\\n async fn test_sync() {\\n\\n let stats = CacheStats::new();\\n\\n for d in mock_data() {\\n\\n stats.record_download(d);\\n\\n }\\n\\n let result = stats.recorded_downloads();\\n\\n assert_eq!(result.len(), mock_data().len())\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\",\n \"file_path\": \"src/cache/stats.rs\",\n \"rank\": 30,\n \"score\": 10.859020455107002\n },\n {\n \"content\": \"use std::io::{self, Read, Seek, SeekFrom};\\n\\n\\n\\nuse anyhow::anyhow;\\n\\n\\n\\nuse super::FileManager;\\n\\n\\n\\n/// Cursor that allows the to Read/Seek through a [`FileManager`].\\n\\n///\\n\\n/// Blocks if bytes are read that were not yet downloaded\\n\\n/// Fails if bytes are read that were not scheduled for downloading\\n\\n#[derive(Clone)]\\n\\npub struct CacheCursor {\\n\\n pub cache: FileManager,\\n\\n pub position: u64,\\n\\n}\\n\\n\\n\\nimpl Read for CacheCursor {\\n\\n fn read(&mut self, buf: &mut [u8]) -> io::Result<usize> {\\n\\n if self.position == self.cache.get_file_size() {\\n\\n return Ok(0);\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 32,\n \"score\": 10.638640585934107\n },\n {\n \"content\": \" impl CacheStats {\\n\\n pub(crate) fn new() -> Self {\\n\\n Self {\\n\\n inner: Arc::new(InnerCacheStats {\\n\\n downloads: Mutex::new(vec![]),\\n\\n }),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn recorded_downloads(&self) -> Vec<DownloadStat> {\\n\\n let guard = self.inner.downloads.lock().unwrap();\\n\\n guard.clone()\\n\\n }\\n\\n\\n\\n pub(crate) fn record_download(&self, dl: DownloadStat) {\\n\\n let mut guard = self.inner.downloads.lock().unwrap();\\n\\n guard.push(dl);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cache/stats.rs\",\n \"rank\": 36,\n \"score\": 9.285300114561458\n },\n {\n \"content\": \" cache: file_manager,\\n\\n position: 0,\\n\\n };\\n\\n\\n\\n let target = pattern(0, file_size as usize);\\n\\n // perform blocking read in separate thread!\\n\\n let result = tokio::task::spawn_blocking(move || -> io::Result<Vec<u8>> {\\n\\n let mut content = vec![];\\n\\n // we try to read the whole file\\n\\n cursor.read_to_end(&mut content)?;\\n\\n Ok(content)\\n\\n })\\n\\n .await\\n\\n .unwrap()\\n\\n .expect(&format!(\\n\\n \\\"Could not read bytes bytes [0:{len}[ in download [0:{len}[\\\",\\n\\n len = file_size,\\n\\n ));\\n\\n assert_eq!(result, target);\\n\\n\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 37,\n \"score\": 9.255917967447855\n },\n {\n \"content\": \" return Ok(n);\\n\\n }\\n\\n SeekFrom::End(n) => (self.cache.get_file_size(), n),\\n\\n SeekFrom::Current(n) => (self.position, n),\\n\\n };\\n\\n let new_pos = if offset >= 0 {\\n\\n base_pos.checked_add(offset as u64)\\n\\n } else {\\n\\n base_pos.checked_sub((offset.wrapping_neg()) as u64)\\n\\n };\\n\\n match new_pos {\\n\\n Some(n) => {\\n\\n self.position = n;\\n\\n Ok(self.position)\\n\\n }\\n\\n None => Err(io::Error::new(\\n\\n io::ErrorKind::InvalidInput,\\n\\n anyhow!(\\\"invalid seek to a negative or overflowing position\\\"),\\n\\n )),\\n\\n }\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 38,\n \"score\": 8.833679082587128\n },\n {\n \"content\": \" #[cfg(not(feature = \\\"stats\\\"))]\\n\\n async fn test_noop() {\\n\\n let stats = CacheStats::new();\\n\\n for d in mock_data() {\\n\\n stats.record_download(d);\\n\\n }\\n\\n let result = stats.recorded_downloads();\\n\\n assert_eq!(result.len(), 0)\\n\\n }\\n\\n\\n\\n fn mock_data() -> Vec<DownloadStat> {\\n\\n vec![\\n\\n DownloadStat {\\n\\n dl_duration: 231,\\n\\n dl_start: 4564,\\n\\n size: 10000000,\\n\\n },\\n\\n DownloadStat {\\n\\n dl_duration: 123,\\n\\n dl_start: 6547,\\n\\n size: 10000000,\\n\\n },\\n\\n ]\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cache/stats.rs\",\n \"rank\": 39,\n \"score\": 8.623450234918414\n },\n {\n \"content\": \" Self { length }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FileDescription for PatternFileDescription {\\n\\n fn get_downloader(&self) -> Arc<dyn Downloader> {\\n\\n Arc::new(PatternDownloader)\\n\\n }\\n\\n\\n\\n fn get_downloader_id(&self) -> String {\\n\\n \\\"pattern_downloader\\\".to_owned()\\n\\n }\\n\\n\\n\\n fn get_uri(&self) -> String {\\n\\n \\\"pattern_uri\\\".to_owned()\\n\\n }\\n\\n\\n\\n fn get_file_size(&self) -> u64 {\\n\\n self.length\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/mock.rs\",\n \"rank\": 41,\n \"score\": 7.873804320538786\n },\n {\n \"content\": \"\\n\\n#[allow(dead_code)]\\n\\npub mod noop {\\n\\n use super::DownloadStat;\\n\\n\\n\\n /// A structure that does noop when called to collect stats.\\n\\n ///\\n\\n /// Calls to on this structure will mostly be optimized out by the compiler.\\n\\n #[derive(Clone)]\\n\\n pub struct CacheStats;\\n\\n\\n\\n impl CacheStats {\\n\\n pub(crate) fn new() -> Self {\\n\\n Self\\n\\n }\\n\\n\\n\\n pub fn recorded_downloads(&self) -> Vec<DownloadStat> {\\n\\n vec![]\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/cache/stats.rs\",\n \"rank\": 42,\n \"score\": 7.754221970600429\n },\n {\n \"content\": \"-- Start=0000000000 Status=Done(100 bytes)\\n\\n-- Start=0000000100 Status=Done(100 bytes)\\n\\n-- Start=0000000200 Status=Done(100 bytes)\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_read_complete_file() {\\n\\n let file_size = 100;\\n\\n let (download_cache, file_manager) = init_mock(file_size).await;\\n\\n\\n\\n // we schedule the download of the whole file\\n\\n file_manager\\n\\n .queue_download(vec![Range {\\n\\n start: 0,\\n\\n length: file_size as usize,\\n\\n }])\\n\\n .expect(\\\"Could not queue Range on handle\\\");\\n\\n\\n\\n let mut cursor = CacheCursor {\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 43,\n \"score\": 7.717175464496954\n },\n {\n \"content\": \" pub fn set_downloader_factory(&mut self, factory: DownloaderFactory) {\\n\\n self.downloader_factory = factory;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FileDescription for S3FileDescription {\\n\\n fn get_downloader(&self) -> Arc<dyn Downloader> {\\n\\n (self.downloader_factory)(&self.region)\\n\\n }\\n\\n\\n\\n fn get_downloader_id(&self) -> String {\\n\\n format!(\\\"s3_rusoto:{}\\\", &self.region)\\n\\n }\\n\\n\\n\\n fn get_uri(&self) -> String {\\n\\n format!(\\\"{}/{}\\\", self.bucket, self.key)\\n\\n }\\n\\n\\n\\n fn get_file_size(&self) -> u64 {\\n\\n self.size\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/s3_rusoto/file_description.rs\",\n \"rank\": 44,\n \"score\": 7.1509586450538745\n },\n {\n \"content\": \"-- Start=0000000200 Status=Pending(100 bytes)\\\"\\n\\n );\\n\\n\\n\\n // try reading after of downloaded range\\n\\n cursor\\n\\n .seek(SeekFrom::Start(280))\\n\\n .expect(\\\"Cursor could not be moved\\\");\\n\\n let err_msg = assert_cursor(&cursor, pattern(0, 50))\\n\\n .await\\n\\n .expect_err(\\\"Read of [280:320[ should fail, only [200,300[ was downloaded\\\")\\n\\n .to_string();\\n\\n assert_eq!(\\n\\n err_msg,\\n\\n \\\"\\\\\\n\\nDownload not scheduled at position 300, scheduled ranges are:\\n\\n-- Start=0000000200 Status=Done(100 bytes)\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 45,\n \"score\": 7.041952365065509\n },\n {\n \"content\": \"use super::super::{Downloader, FileDescription};\\n\\nuse anyhow::{anyhow, Result};\\n\\nuse async_trait::async_trait;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse tokio::time::Duration;\\n\\n\\n\\n/// A downloader that returns a simple pattern (1,2,3...254,255,1,2...)\\n\\n/// Waits for 10ms before returning its result to trigger cache misses\\n\",\n \"file_path\": \"src/cache/mock.rs\",\n \"rank\": 46,\n \"score\": 6.903894322400914\n },\n {\n \"content\": \"pub use sync::CacheStats;\\n\\n\\n\\n#[allow(dead_code)]\\n\\npub mod sync {\\n\\n use super::DownloadStat;\\n\\n use std::sync::{Arc, Mutex};\\n\\n\\n\\n struct InnerCacheStats {\\n\\n downloads: Mutex<Vec<DownloadStat>>,\\n\\n }\\n\\n\\n\\n /// Reference to a synchronized container with inner statistics of the caching system.\\n\\n ///\\n\\n /// You can get these stats from the [`DownloadCache`](super::super::DownloadCache) directly.\\n\\n /// Clonig this object only clones the reference.\\n\\n #[derive(Clone)]\\n\\n pub struct CacheStats {\\n\\n inner: Arc<InnerCacheStats>,\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/cache/stats.rs\",\n \"rank\": 48,\n \"score\": 6.6118153862566285\n },\n {\n \"content\": \"//! The stats module has two implementations that you can switch with the `stats` feature:\\n\\n//! - the `sync` module is a shared reference to synchronized statistics collectors\\n\\n//! - the `noop` module is an empty structure that does not collect any statistics\\n\\n\\n\\nuse serde::Serialize;\\n\\n\\n\\n/// KPIs relative to one specific range download\\n\\n#[derive(Clone, Serialize)]\\n\\npub struct DownloadStat {\\n\\n // range size in bytes\\n\\n pub size: u64,\\n\\n /// ms spent inside download function\\n\\n pub dl_duration: u64,\\n\\n /// ms elapsed since registering\\n\\n pub dl_start: u64,\\n\\n}\\n\\n\\n\\n#[cfg(not(feature = \\\"stats\\\"))]\\n\\npub use noop::CacheStats;\\n\\n#[cfg(feature = \\\"stats\\\")]\\n\",\n \"file_path\": \"src/cache/stats.rs\",\n \"rank\": 49,\n \"score\": 6.485771552041668\n },\n {\n \"content\": \" // check the debug output for the cache\\n\\n assert_eq!(\\n\\n format!(\\\"{:?}\\\", download_cache),\\n\\n \\\"\\\\\\n\\nfile = pattern_downloader / pattern_uri:\\n\\n-- Start=0000000000 Status=Done(100 bytes)\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_read_uninit() {\\n\\n let (_, file_manager) = init_mock(1000).await;\\n\\n\\n\\n let mut cursor = CacheCursor {\\n\\n cache: file_manager.clone(),\\n\\n position: 0,\\n\\n };\\n\\n\\n\\n // try reading whithout starting any download\\n\\n let err_msg = assert_cursor(&cursor, pattern(0, 50))\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 50,\n \"score\": 5.8582336259571095\n },\n {\n \"content\": \"file = pattern_downloader / pattern_uri:\\n\\n-- Start=0000000000 Status=Done(100 bytes)\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_read_accross_ranges() {\\n\\n let (download_cache, file_manager) = init_mock(1000).await;\\n\\n\\n\\n file_manager\\n\\n .queue_download(vec![\\n\\n Range {\\n\\n start: 200,\\n\\n length: 100,\\n\\n },\\n\\n Range {\\n\\n start: 0,\\n\\n length: 100,\\n\\n },\\n\\n Range {\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 51,\n \"score\": 5.501665488483848\n },\n {\n \"content\": \"use std::str::FromStr;\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse super::S3Downloader;\\n\\nuse crate::{Downloader, FileDescription};\\n\\n\\n\\nuse rusoto_core::Region;\\n\\nuse rusoto_s3::S3Client;\\n\\n\\n\",\n \"file_path\": \"src/s3_rusoto/file_description.rs\",\n \"rank\": 52,\n \"score\": 5.253599702680495\n },\n {\n \"content\": \"use std::sync::Arc;\\n\\n\\n\\nuse anyhow::Result;\\n\\nuse async_trait::async_trait;\\n\\nuse serde::Deserialize;\\n\\n\\n\\n/// Connection to a server that allows to download chunks of files\\n\\n#[async_trait]\\n\",\n \"file_path\": \"src/cache/models.rs\",\n \"rank\": 53,\n \"score\": 5.133833358947118\n },\n {\n \"content\": \"//! Optimized and flexible helpers for reading large data files from cloud storages (or more generally, from the network).\\n\\n//!\\n\\n//! To get started, create an instance of `DownloadCache` and start registering `FileDescription` trait objects.\\n\\n\\n\\nmod cache;\\n\\npub use cache::*;\\n\\n\\n\\n#[cfg(feature = \\\"s3_rusoto\\\")]\\n\\npub mod s3_rusoto;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 54,\n \"score\": 4.917701686478408\n },\n {\n \"content\": \" let mut content = vec![0u8; target_length];\\n\\n cursor.read_exact(&mut content)?;\\n\\n Ok(content)\\n\\n })\\n\\n .await\\n\\n .unwrap()?;\\n\\n assert_eq!(result, target);\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 55,\n \"score\": 4.831788915809531\n },\n {\n \"content\": \"mod cursor;\\n\\nmod download_cache;\\n\\nmod file_manager;\\n\\nmod mock;\\n\\nmod models;\\n\\nmod stats;\\n\\n\\n\\npub use cursor::CacheCursor;\\n\\npub use download_cache::DownloadCache;\\n\\npub use file_manager::FileManager;\\n\\npub use models::*;\\n\\npub use stats::{CacheStats, DownloadStat};\\n\",\n \"file_path\": \"src/cache/mod.rs\",\n \"rank\": 56,\n \"score\": 4.748978773332439\n },\n {\n \"content\": \"//! [`FileDescription`](`crate::FileDescription`) implementation for downloading from S3 using Rusoto\\n\\n\\n\\nmod downloader;\\n\\nmod file_description;\\n\\n\\n\\nuse downloader::S3Downloader;\\n\\npub use file_description::S3FileDescription;\\n\",\n \"file_path\": \"src/s3_rusoto/mod.rs\",\n \"rank\": 57,\n \"score\": 4.371164331221088\n },\n {\n \"content\": \" file_description.set_downloader_factory(Box::new(|_| {\\n\\n let client = S3Client::new_with(\\n\\n MockRequestDispatcher::default()\\n\\n .with_body(\\\"\\\")\\n\\n .with_request_checker(|request: &SignedRequest| {\\n\\n assert_eq!(request.path, \\\"/test_bucket/test_key\\\");\\n\\n assert_eq!(\\n\\n std::str::from_utf8(&request.headers.get(\\\"range\\\").unwrap()[0]).unwrap(),\\n\\n \\\"bytes=50-149\\\"\\n\\n );\\n\\n }),\\n\\n MockCredentialsProvider,\\n\\n Default::default(),\\n\\n );\\n\\n Arc::new(S3Downloader::new(client))\\n\\n }));\\n\\n\\n\\n #[allow(unused_must_use)]\\n\\n {\\n\\n file_description\\n\\n .get_downloader()\\n\\n .download(file_description.get_uri(), 50, 100)\\n\\n .await;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/s3_rusoto/file_description.rs\",\n \"rank\": 58,\n \"score\": 4.365753906086436\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::super::{mock::*, DownloadCache, Range};\\n\\n use super::*;\\n\\n\\n\\n use std::io::{self, Read, Seek, SeekFrom};\\n\\n\\n\\n #[tokio::test]\\n\\n async fn test_read_within_range() {\\n\\n let (download_cache, file_manager) = init_mock(1000).await;\\n\\n\\n\\n file_manager\\n\\n .queue_download(vec![Range {\\n\\n start: 0,\\n\\n length: 100,\\n\\n }])\\n\\n .expect(\\\"Could not queue Range on handle\\\");\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 59,\n \"score\": 4.2687405505020415\n },\n {\n \"content\": \"\\n\\n let mut cursor = CacheCursor {\\n\\n cache: file_manager,\\n\\n position: 0,\\n\\n };\\n\\n\\n\\n assert_cursor(&cursor, pattern(0, 50))\\n\\n .await\\n\\n .expect(\\\"could not read enough bytes [0:50[ in download [0:100[\\\");\\n\\n cursor\\n\\n .seek(SeekFrom::Start(20))\\n\\n .expect(\\\"Cursor could not be moved\\\");\\n\\n assert_cursor(&cursor, pattern(20, 70))\\n\\n .await\\n\\n .expect(\\\"Could not read bytes bytes [20:70[ in download [0:100[\\\");\\n\\n\\n\\n // check the debug output for the cache\\n\\n assert_eq!(\\n\\n format!(\\\"{:?}\\\", download_cache),\\n\\n \\\"\\\\\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 60,\n \"score\": 4.234722579987321\n },\n {\n \"content\": \"## Proposed solution\\n\\n\\n\\nThe proposed solution is to introduce a dedicated data structure that takes care of scheduling the downloads and caching the results, while providing a blocking API that implements the `std::io::Read` trait. The scheduling strategy remains customizable to adapt to different types of reads (chunks of a Parquet file will be read in a different order thant those of a CSV file) and different infrastructures (Cloud storage will behave differently from an on-premise HDFS). But most of the caching and synchronization mechanismes will be common to all the use cases.\\n\\n\\n\\nThe proposed strategy is the following one:\\n\\n\\n\\n\\n\\n\\n\\nIf we apply it to the specific usecase of [Buzz](https://github.com/cloudfuse-io/buzz-rust), it boils down to this:\\n\\n\\n\\n\\n\\n\\n\\n## Using the library\\n\\n\\n\\nThe library has a `stats` feature flag that allows to control whether it should collect execution statistics or not.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 61,\n \"score\": 3.947601724587573\n },\n {\n \"content\": \"/// Fully specified description of a downloadable file\\n\\n///\\n\\n/// To make it fully generic, a FileDescription provides its own downloader.\\n\\n/// It also provides a downloader_id to allow the [`DownloadCache`](super::DownloadCache) to cache the downloader.\\n\\n/// It is not the responsability of the FileDescription to cache the downloader.\\n\\n/// Downloaders that will most efficiently be re-usable for a given set of files should be assigned the same id.\\n\\n/// For instance for AWS S3, this will be by region as the domain will be the same, which allows full re-use of\\n\\n/// the SSL connection (TODO: verify if it is not actually by bucket).\\n\\npub trait FileDescription: Send {\\n\\n fn get_downloader(&self) -> Arc<dyn Downloader>;\\n\\n\\n\\n fn get_downloader_id(&self) -> String;\\n\\n\\n\\n fn get_uri(&self) -> String;\\n\\n\\n\\n fn get_file_size(&self) -> u64;\\n\\n}\\n\",\n \"file_path\": \"src/cache/models.rs\",\n \"rank\": 62,\n \"score\": 3.8157021417133747\n },\n {\n \"content\": \"# :cloud: Rust Cloud Readers :cloud:\\n\\n\\n\\n[](LICENSE)\\n\\n\\n\\n[](https://codecov.io/gh/cloudfuse-io/cloud-readers-rs)\\n\\n\\n\\nOptimized and flexible helpers for reading large data files from cloud storages (or more generally, from the network).\\n\\n\\n\\n## Context\\n\\n\\n\\nMost client libraries to read from the network in Rust are async. One example is the AWS S3 client library. On the other hand, data processing systems prefer to read data using the `std::io::Read` trait that is blocking, partly because it is more performant for large files, partly beacause many data processing libraries such as protobuf use that trait in their interfaces. In that case, the data processing flow looks like this:\\n\\n\\n\\n\\n\\n\\n\\nIf we apply this to the example of [Buzz](https://github.com/cloudfuse-io/buzz-rust), we get the following flow:\\n\\n\\n\\n\\n\\n\\n\\nAdditionally, the strategy to fetch data from the network will be different from reading from a high bandwith hard drive. When reading local data, the bottleneck might be the CPU and not the disk bandwidth, and even if that is not the case, you will usually not get much benefit from reading multiple chunks in parallel as one read stream will already fully utilizes the bandwidth of the disk (this might not be completely true when multiple drives are attached). The situation is completely different when reading from the network. Each read will usually be throttled on the data provider side. When using AWS S3 for instance, you get a much better overall bandwidth if you read 8 chunks in parallel (even for a single file). This means that it is worth decoupling the read strategy from the processing by eagerly downloading and caching in memory for future processings.\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 63,\n \"score\": 3.7891082396953326\n },\n {\n \"content\": \" start: 100,\\n\\n length: 100,\\n\\n },\\n\\n ])\\n\\n .expect(\\\"Could not queue Range on handle\\\");\\n\\n\\n\\n let cursor = CacheCursor {\\n\\n cache: file_manager,\\n\\n position: 0,\\n\\n };\\n\\n\\n\\n assert_cursor(&cursor, pattern(0, 300))\\n\\n .await\\n\\n .expect(\\\"Could not read bytes bytes [0:300[ in download [0:100[+[100:200[+[200:300[\\\");\\n\\n\\n\\n // check the debug output for the cache\\n\\n assert_eq!(\\n\\n format!(\\\"{:?}\\\", download_cache),\\n\\n \\\"\\\\\\n\\nfile = pattern_downloader / pattern_uri:\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 64,\n \"score\": 3.7327737049963927\n },\n {\n \"content\": \"# Notebook folder\\n\\n\\n\\nThis folder contains the results of some performance tests conducted on the library when using cloud storage. To make them easily readeable and reproduceable, we used Jupyter notebooks and Docker.\\n\\n\\n\\n## Deploying the infrastructure\\n\\n\\n\\nTo be able to run the tests with a cloud storage, you first need to deploy the benchmarking executable otherwise you would mainly be measuring your network latency to the cloud.\\n\\n\\n\\nTo run the notebooks, install Jupyter and run `jupyter lab` at the root of the project.\\n\\n\\n\\nThe notebook [`infra.ipynb`](infra.ipynb) helps you deploy an AWS Lambda function into one of your AWS accounts. You just need your credentials to be configured in the default AWS credentials file and change the `AWS_PROFILE` environment variable before starting jupyter to match your setup.\\n\\n\\n\\nWith the same notbook, you can also tear down the infrastructure that was deployed previously. The Terraform state is stored on a local docker volume. If you delete it before running `terraform destroy`, you won't be able to tear down the infrastructure automatically any more.\\n\\n\\n\\n## Running the benchmarks\\n\\n\\n\\nYou can run the tests by calling the AWS Lambda function deployed previously. \\n\\n\\n\\nNote that if you want to run tests on files that are not publicly exposed, you will need to provide the appropriate policy to the Lambda function in the Terraform script.\\n\\n\\n\",\n \"file_path\": \"notebooks/README.md\",\n \"rank\": 66,\n \"score\": 3.1375168109905305\n },\n {\n \"content\": \" .await\\n\\n .expect_err(\\\"Read should fail if no download was scheduled\\\")\\n\\n .to_string();\\n\\n assert_eq!(err_msg, \\\"No download scheduled\\\");\\n\\n\\n\\n // try reading before of downloaded range\\n\\n file_manager\\n\\n .queue_download(vec![Range {\\n\\n start: 200,\\n\\n length: 100,\\n\\n }])\\n\\n .expect(\\\"Could not queue Range on handle\\\");\\n\\n let err_msg = assert_cursor(&cursor, pattern(0, 50))\\n\\n .await\\n\\n .expect_err(\\\"Read of [0:50[ should fail, only [200,300[ was downloaded\\\")\\n\\n .to_string();\\n\\n assert_eq!(\\n\\n err_msg,\\n\\n \\\"\\\\\\n\\nDownload not scheduled at position 0, scheduled ranges are:\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 68,\n \"score\": 1.6394254704938664\n },\n {\n \"content\": \" async fn test_seek() {\\n\\n let mut cursor = CacheCursor {\\n\\n cache: init_mock(100).await.1,\\n\\n position: 0,\\n\\n };\\n\\n\\n\\n cursor.seek(SeekFrom::Start(10)).unwrap();\\n\\n\\n\\n assert_eq!(cursor.position, 10);\\n\\n\\n\\n cursor.seek(SeekFrom::Current(10)).unwrap();\\n\\n\\n\\n assert_eq!(cursor.position, 20);\\n\\n\\n\\n cursor.seek(SeekFrom::End(-10)).unwrap();\\n\\n\\n\\n assert_eq!(cursor.position, 90);\\n\\n }\\n\\n\\n\\n //// Test Fixtures: ////\\n\",\n \"file_path\": \"src/cache/cursor.rs\",\n \"rank\": 69,\n \"score\": 1.6275246397173198\n }\n]","isConversational":false}}},{"rowIdx":1186,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/asset/tileset.rs"},"repo_name":{"kind":"string","value":"B-Reif/bevy_asefile"},"commit":{"kind":"string","value":"51d8abfc51aa9e406dad2e5cad4b93c22e7b3fc6"},"file_code":{"kind":"string","value":"use asefile::{AsepriteFile, TilesetImageError};\nuse bevy::{\n prelude::*,\n reflect::TypeUuid,\n render::texture::{Extent3d, TextureDimension, TextureFormat},\n};\nuse std::fmt;\n\npub(crate) type TilesetResult<T> = std::result::Result<T, TilesetError>;\n\n#[derive(Debug)]\npub enum TilesetError {\n MissingId(asefile::TilesetId),\n NoPixels(asefile::TilesetId),\n}\nimpl fmt::Display for TilesetError {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n match self {\n TilesetError::MissingId(tileset_id) => {\n write!(f, \"No tileset found with id: {}\", tileset_id)\n }\n TilesetError::NoPixels(tileset_id) => {\n write!(f, \"No pixel data for tileset with id: {}\", tileset_id)\n }\n }\n }\n}\nimpl From<&TilesetImageError> for TilesetError {\n fn from(e: &TilesetImageError) -> Self {\n match e {\n TilesetImageError::MissingTilesetId(id) => Self::MissingId(*id),\n TilesetImageError::NoPixelsInTileset(id) => Self::NoPixels(*id),\n }\n }\n}\nimpl From<TilesetImageError> for TilesetError {\n fn from(e: TilesetImageError) -> Self {\n Self::from(&e)\n }\n}\n\nfn texture_from(ase: &AsepriteFile, tileset: &asefile::Tileset) -> TilesetResult<Texture> {\n let tileset_id = tileset.id();\n let image = ase.tileset_image(&tileset_id)?;\n let size = Extent3d {\n width: image.width(),\n height: image.height(),\n depth: 1,\n };\n Ok(Texture::new_fill(\n size,\n TextureDimension::D2,\n image.as_raw(),\n TextureFormat::Rgba8UnormSrgb,\n ))\n}\n\n#[derive(Debug)]\npub struct TileSize {\n \n pub width: u16,\n \n pub height: u16,\n}\nimpl TileSize {\n fn from_ase(ase_size: &asefile::TileSize) -> Self {\n Self {\n width: *ase_size.width(),\n height: *ase_size.height(),\n }\n }\n}\n\n#[derive(Debug, TypeUuid)]\n#[uuid = \"0e2dbd05-dbad-46c9-a943-395f83dfa4ba\"]\npub struct Tileset {\n \n pub tile_count: u32,\n \n pub tile_size: TileSize,\n \n pub name: String,\n \n pub texture: Handle<Texture>,\n}\nimpl Tileset {\n \n \n \n pub fn texture_size(&self) -> Vec2 {\n let TileSize { width, height } = self.tile_size;\n let tile_count = self.tile_count as f32;\n Vec2::new(width as f32, height as f32 * tile_count)\n }\n}\n\n#[derive(Debug)]\npub(crate) struct TilesetData<T> {\n pub(crate) tile_count: u32,\n pub(crate) tile_size: TileSize,\n pub(crate) name: String,\n pub(crate) texture: T,\n}\nimpl<T> TilesetData<T> {\n fn from_ase<F>(f: F, ase: &AsepriteFile, ase_tileset: &asefile::Tileset) -> TilesetResult<Self>\n where\n F: FnOnce(&AsepriteFile, &asefile::Tileset) -> TilesetResult<T>,\n {\n let texture = f(ase, ase_tileset)?;\n let ase_size = ase_tileset.tile_size();\n Ok(Self {\n tile_count: *ase_tileset.tile_count(),\n tile_size: TileSize::from_ase(ase_size),\n name: ase_tileset.name().to_string(),\n texture,\n })\n }\n}\nimpl TilesetData<Texture> {\n pub(crate) fn from_ase_with_texture(\n ase: &AsepriteFile,\n ase_tileset: &asefile::Tileset,\n ) -> TilesetResult<Self> {\n TilesetData::<Texture>::from_ase(texture_from, ase, ase_tileset)\n }\n}\n"},"prefix":{"kind":"string","value":"use asefile::{AsepriteFile, TilesetImageError};\nuse bevy::{\n prelude::*,\n reflect::T"},"suffix":{"kind":"string","value":" width, height } = self.tile_size;\n let tile_count = self.tile_count as f32;\n Vec2::new(width as f32, height as f32 * tile_count)\n }\n}\n\n#[derive(Debug)]\npub(crate) struct TilesetData<T> {\n pub(crate) tile_count: u32,\n pub(crate) tile_size: TileSize,\n pub(crate) name: String,\n pub(crate) texture: T,\n}\nimpl<T> TilesetData<T> {\n fn from_ase<F>(f: F, ase: &AsepriteFile, ase_tileset: &asefile::Tileset) -> TilesetResult<Self>\n where\n F: FnOnce(&AsepriteFile, &asefile::Tileset) -> TilesetResult<T>,\n {\n let texture = f(ase, ase_tileset)?;\n let ase_size = ase_tileset.tile_size();\n Ok(Self {\n tile_count: *ase_tileset.tile_count(),\n tile_size: TileSize::from_ase(ase_size),\n name: ase_tileset.name().to_string(),\n texture,\n })\n }\n}\nimpl TilesetData<Texture> {\n pub(crate) fn from_ase_with_texture(\n ase: &AsepriteFile,\n ase_tileset: &asefile::Tileset,\n ) -> TilesetResult<Self> {\n TilesetData::<Texture>::from_ase(texture_from, ase, ase_tileset)\n }\n}\n"},"middle":{"kind":"string","value":"ypeUuid,\n render::texture::{Extent3d, TextureDimension, TextureFormat},\n};\nuse std::fmt;\n\npub(crate) type TilesetResult<T> = std::result::Result<T, TilesetError>;\n\n#[derive(Debug)]\npub enum TilesetError {\n MissingId(asefile::TilesetId),\n NoPixels(asefile::TilesetId),\n}\nimpl fmt::Display for TilesetError {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n match self {\n TilesetError::MissingId(tileset_id) => {\n write!(f, \"No tileset found with id: {}\", tileset_id)\n }\n TilesetError::NoPixels(tileset_id) => {\n write!(f, \"No pixel data for tileset with id: {}\", tileset_id)\n }\n }\n }\n}\nimpl From<&TilesetImageError> for TilesetError {\n fn from(e: &TilesetImageError) -> Self {\n match e {\n TilesetImageError::MissingTilesetId(id) => Self::MissingId(*id),\n TilesetImageError::NoPixelsInTileset(id) => Self::NoPixels(*id),\n }\n }\n}\nimpl From<TilesetImageError> for TilesetError {\n fn from(e: TilesetImageError) -> Self {\n Self::from(&e)\n }\n}\n\nfn texture_from(ase: &AsepriteFile, tileset: &asefile::Tileset) -> TilesetResult<Texture> {\n let tileset_id = tileset.id();\n let image = ase.tileset_image(&tileset_id)?;\n let size = Extent3d {\n width: image.width(),\n height: image.height(),\n depth: 1,\n };\n Ok(Texture::new_fill(\n size,\n TextureDimension::D2,\n image.as_raw(),\n TextureFormat::Rgba8UnormSrgb,\n ))\n}\n\n#[derive(Debug)]\npub struct TileSize {\n \n pub width: u16,\n \n pub height: u16,\n}\nimpl TileSize {\n fn from_ase(ase_size: &asefile::TileSize) -> Self {\n Self {\n width: *ase_size.width(),\n height: *ase_size.height(),\n }\n }\n}\n\n#[derive(Debug, TypeUuid)]\n#[uuid = \"0e2dbd05-dbad-46c9-a943-395f83dfa4ba\"]\npub struct Tileset {\n \n pub tile_count: u32,\n \n pub tile_size: TileSize,\n \n pub name: String,\n \n pub texture: Handle<Texture>,\n}\nimpl Tileset {\n \n \n \n pub fn texture_size(&self) -> Vec2 {\n let TileSize {"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"use crate::asset::{TileSize, Tileset};\n\nuse bevy::math::{UVec2, Vec2};\n\nuse bevy_ecs_tilemap::prelude::*;\n\n\n\nimpl From<TileSize> for Vec2 {\n\n fn from(tile_size: TileSize) -> Self {\n\n Vec2::new(tile_size.width as f32, tile_size.height as f32)\n\n }\n\n}\n\n\n\nimpl Tileset {\n\n /// Creates new [LayerSettings] using the [Tileset's](Tileset) own tile size and texture size.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// #[cfg(feature = \"bevy_ecs_tilemap\")]\n\n /// use bevy_ase::asset::Tileset;\n\n /// use bevy_ecs_tilemap::LayerSettings;\n\n /// use bevy::math::UVec2;\n","file_path":"src/bevy_ecs_tilemap.rs","rank":0,"score":22379.489292726226},{"content":" ///\n\n /// // Create new layer settings from a tileset, with specified map size and chunk size.\n\n /// fn my_layer_settings(tileset: &Tileset) -> LayerSettings {\n\n /// let map_size = UVec2::new(30, 30);\n\n /// let chunk_size = UVec2::new(15, 15);\n\n /// tileset.layer_settings(map_size, chunk_size) \n\n /// }\n\n /// ```\n\n pub fn layer_settings(&self, map_size: UVec2, chunk_size: UVec2) -> LayerSettings {\n\n LayerSettings::new(\n\n map_size,\n\n chunk_size,\n\n Vec2::new(self.tile_size.width as f32, self.tile_size.height as f32),\n\n self.texture_size(),\n\n )\n\n }\n\n}\n","file_path":"src/bevy_ecs_tilemap.rs","rank":1,"score":22372.745362086793},{"content":"Utilities for loading Aseprite files into a Bevy application.\n\n\n\nProvides an AssetLoader struct which directly\n\nreads .aseprite files without an intermediate import step.\n\nThe loader adds Resources generated by the files' data.\n\nSystems can invoke the loader's methods to start loading files,\n\nor query the loading state.\n\n\n\n# Resources\n\n\n\nThis library creates several types of resources:\n\n\n\n- Texture data, which contains the file's images.\n\n- TextureAtlas data, which contains mapping information for each sprite in a spritesheet.\n\n- Animation data.\n\n- Slice data.\n\n- Tileset data (from files created in Aseprite v1.3 beta).\n\n\n\n# Configuration\n\n\n\nThis library exposes AseLoaderDefaultPlugin with default settings.\n\nThis plugin initializes all of the above resources as Asset types, adds Loader and AseAssetLoader resources,\n\nand adds an importer system function to process loaded ase data.\n\n\n\nFor a custom configuration, import the constituent parts and add them to AppBuilder directly.\n\nThe Texture resource is required to be initialized. Other asset types are optional.\n\n\n\n# Examples\n\n\n\n```rs\n\nuse bevy::prelude::*;\n\nuse bevy_ase::asset::AseAsset;\n\nuse bevy_ase::loader::{AseLoaderDefaultPlugin, Loader};\n\nuse std::path::Path;\n\n\n\n// Initialize and run a bevy app with the default bevy_ase configuration.\n\nfn main() {\n\n App::build()\n\n .add_plugins(DefaultPlugins)\n\n .add_plugin(AseLoaderDefaultPlugin)\n\n .add_system(load_sprites.system());\n\n}\n\n\n\n// Get an aseprite asset and send it to the loader.\n\npub fn load_sprites(asset_server: Res<AssetServer>, mut loader: ResMut<Loader>) {\n\n let h: Handle<AseAsset> = asset_server.load(Path::new(\"sprites/hello.aseprite\"));\n\n loader.add(h.clone());\n\n}\n\n```\n\nSee the documentation for lib.rs for more information.\n\n\n\nForked from https://github.com/alpine-alpaca/bevy_proto_aseprite.\n\n\n\n# Example\n\n\n\n```\n\ncargo run --example animated --features=\"benimator\"\n\n```\n\n\n\n# TODOs\n\n\n\n- Improve error handling.\n\n\n\n- Atlas creation fails if there are too many / too big sprites.\n\n\n\n- Hot reloading. This requires dynamic atlas reconstruction.\n","file_path":"README.md","rank":2,"score":14308.387235882661},{"content":"use std::path::Path;\n\n\n\nuse bevy::{input::system::exit_on_esc_system, prelude::*};\n\nuse bevy_ase::{\n\n self,\n\n asset::{AseAsset, Tileset},\n\n loader,\n\n loader::Loader,\n\n};\n\nuse bevy_ecs_tilemap::prelude::*;\n\n\n","file_path":"examples/tilemap/main.rs","rank":3,"score":8.295252508764376},{"content":"use std::path::Path;\n\n\n\nuse bevy::{input::system::exit_on_esc_system, prelude::*, sprite::entity::SpriteSheetBundle};\n\nuse bevy_ase::{\n\n self,\n\n asset::{Animation, AseAsset},\n\n loader::{self, Loader},\n\n};\n\n\n","file_path":"examples/animated/main.rs","rank":4,"score":7.205513123270655},{"content":"/// The default AseAssetLoader loads files with extensions \"aseprite\" and \"ase\".\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::loader::AseAssetLoader;\n\n///\n\n/// fn build(app: &mut AppBuilder) {\n\n/// app.init_asset_loader::<AseAssetLoader>();\n\n/// }\n\n/// ```\n\n/// ## Custom extensions\n\n/// The AseAssetLoader can be instantiated with a custom set of targeted file extensions.\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::loader::AseAssetLoader;\n\n///\n\n/// fn build(app: &mut AppBuilder) {\n\n/// let my_loader = AseAssetLoader {\n\n/// extensions: &[\"aseprite\", \"my_custom_extension\"]\n\n/// };\n\n/// app.add_asset_loader(my_loader);\n","file_path":"src/loader.rs","rank":5,"score":6.620532200948027},{"content":"impl Default for Loader {\n\n fn default() -> Self {\n\n Self {\n\n todo_handles: Vec::new(),\n\n in_progress: Arc::new(AtomicU32::new(0)),\n\n done: Arc::new(Mutex::new(Vec::new())),\n\n }\n\n }\n\n}\n\n\n\nimpl Loader {\n\n /// Adds an [AseAsset] to the [Loader] for loading.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use bevy::prelude::*;\n\n /// use bevy_ase::asset::AseAsset;\n\n /// use bevy_ase::loader::Loader;\n\n /// use std::path::Path;\n","file_path":"src/loader.rs","rank":6,"score":6.535257345469066},{"content":"use crate::asset::{\n\n animation::{Animation, AnimationData, Frame, Sprite, SpriteData},\n\n slice::Slice,\n\n tileset::{TilesetData, TilesetResult},\n\n AseAssetMap, Tileset,\n\n};\n\nuse crate::loader::AseAssetResources;\n\nuse asefile::AsepriteFile;\n\nuse bevy::sprite::TextureAtlasBuilder;\n\nuse bevy::{prelude::*, utils::HashMap};\n\nuse std::path::{Path, PathBuf};\n\n\n","file_path":"src/processing.rs","rank":7,"score":6.41817585559359},{"content":"/// System function for moving loaded Aseprite assets into Resoures.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::loader::ase_importer;\n\n///\n\n/// // Creates a Bevy app and adds the ase_importer system.\n\n/// // This system is already added by default in AseLoaderPlugin.\n\n/// fn app() {\n\n/// App::build().add_system(ase_importer.system());\n\n/// }\n\n/// ```\n\npub fn ase_importer(\n\n mut loader: ResMut<Loader>,\n\n task_pool: ResMut<AsyncComputeTaskPool>,\n\n mut aseassets: ResMut<Assets<AseAsset>>,\n\n asset_server: Res<AssetServer>,\n\n resources: AseAssetResources,\n\n) {\n\n let pending = loader.pending_count();\n\n if pending > 0 {\n\n debug!(\"Processing asefiles (batches: {})\", pending);\n\n }\n\n if loader.all_todo_handles_ready(&asset_server) {\n\n loader.spawn_tasks(&task_pool, &mut aseassets);\n\n }\n\n loader.move_finished_into_resources(resources);\n\n}\n","file_path":"src/loader.rs","rank":8,"score":6.37311418217673},{"content":"use asefile::AsepriteFile;\n\nuse bevy::reflect::TypeUuid;\n\nuse std::path::PathBuf;\n\n\n\n/// Handle type for ase assets.\n\n///\n\n/// [crate::loader::Loader] processes [AseAsset] instances and stores their data\n\n/// as various other data types in bevy's Assets resources.\n\n///\n\n/// Once an AseAsset has been processed into other resource types, its data is dropped.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::asset::AseAsset;\n\n///\n\n/// // Convert an untyped handle into an AseAsset handle.\n\n/// pub fn to_typed(handle: HandleUntyped) -> Handle<AseAsset> {\n\n/// handle.clone().typed::<AseAsset>()\n","file_path":"src/asset/ase.rs","rank":9,"score":6.35858227759487},{"content":"//! Index for assets created by this library.\n\nuse super::{animation::Animation, slice::Slice, tileset::Tileset};\n\nuse bevy::utils::HashMap;\n\nuse bevy::{asset::Asset, prelude::*};\n\nuse std::path::{Path, PathBuf};\n\n\n\n/// Provides a map to [Handles](Handle) for an Ase file's assets.\n\n///\n\n/// Instances of this type are owned by [AseFileMap]. To access them during runtime,\n\n/// use the AseFileMap as a system parameter, and index each AseAssetMap by\n\n/// using the file's path as a key.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use bevy_ase::asset::{AseAssetMap, Animation, Tileset};\n\n/// use bevy::asset::Handle;\n\n/// // Get all animations in this file with the name \"foo\".\n\n/// fn get_foo_animations(ase_asset_map: &AseAssetMap) -> Option<&Vec<Handle<Animation>>> {\n\n/// ase_asset_map.animations(\"foo\")\n","file_path":"src/asset/asset_index.rs","rank":10,"score":5.950249292863557},{"content":"use crate::asset::asset_index::AseFileMap;\n\nuse crate::asset::{ase::AseData, slice::Slice, Animation, AseAsset, Tileset};\n\nuse crate::processing::{self, ResourceDataByFile};\n\nuse asefile::AsepriteFile;\n\nuse bevy::{\n\n asset::{AssetLoader, BoxedFuture, LoadState, LoadedAsset},\n\n ecs::system::Res,\n\n prelude::*,\n\n tasks::AsyncComputeTaskPool,\n\n};\n\nuse std::{\n\n path::PathBuf,\n\n sync::{\n\n atomic::{AtomicU32, Ordering},\n\n Arc, Mutex,\n\n },\n\n};\n\n\n\n/// Provides a default Bevy app configuration for loading Aseprite files.\n\n///\n","file_path":"src/loader.rs","rank":11,"score":5.71277533712607},{"content":"//!\n\n//! This library exposes [a plugin](loader::AseLoaderDefaultPlugin) with default settings.\n\n//! This plugin initializes all of the above resources as Asset types,\n\n//! adds [Loader](loader::Loader) and [AseAssetLoader](loader::AseAssetLoader) resources,\n\n//! and adds an [importer system function](loader::ase_importer) to process loaded ase data.\n\n//! For a custom configuration, import the constituent parts and add them to AppBuilder directly.\n\n//! The Texture resource is required to be initialized. Other asset types are optional.\n\n//!\n\n//! # Examples\n\n//!\n\n//! ```\n\n//! use bevy::prelude::*;\n\n//! use bevy_ase::asset::AseAsset;\n\n//! use bevy_ase::loader::{AseLoaderDefaultPlugin, Loader};\n\n//! use std::path::Path;\n\n//!\n\n//! // Initialize and run a bevy app with the default bevy_ase configuration.\n\n//! fn main() {\n\n//! App::build()\n\n//! .add_plugins(DefaultPlugins)\n","file_path":"src/lib.rs","rank":12,"score":5.648164154409089},{"content":"//! ```\n\n//! use bevy::prelude::*;\n\n//! use bevy_ase;\n\n//! #[cfg(feature = \"benimator\")]\n\n//! use benimator;\n\n//!\n\n//! // Creates a benimator animation asset whenever a bevy_ase animation asset is created.\n\n//! #[cfg(feature = \"benimator\")]\n\n//! pub fn convert_animation(\n\n//! mut event_reader: EventReader<AssetEvent<bevy_ase::asset::Animation>>,\n\n//! animations: Res<Assets<bevy_ase::asset::Animation>>,\n\n//! mut sprite_sheet_animations: ResMut<Assets<benimator::SpriteSheetAnimation>>,\n\n//! ) {\n\n//! for evt in event_reader.iter() {\n\n//! if let AssetEvent::Created { handle } = evt {\n\n//! // Unwrap: Responding to Asset Created event, so asset exists\n\n//! let anim = animations.get(handle).unwrap();\n\n//! let converted_animation = anim.into();\n\n//! sprite_sheet_animations.add(converted_animation);\n\n//! }\n","file_path":"src/lib.rs","rank":13,"score":5.486129962113589},{"content":"/// This initializes all of bevy_ase's asset types, a [Loader] resource,\n\n/// an [AseAssetLoader] asset loader, and the [ase_importer] system function.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::loader::AseLoaderDefaultPlugin;\n\n/// fn app() {\n\n/// App::build()\n\n/// .add_plugins(DefaultPlugins)\n\n/// // Add the default plugin to the bevy app build.\n\n/// .add_plugin(AseLoaderDefaultPlugin);\n\n/// }\n\n/// ```\n\npub struct AseLoaderDefaultPlugin;\n\n\n\nimpl Plugin for AseLoaderDefaultPlugin {\n\n fn build(&self, app: &mut AppBuilder) {\n\n app.add_asset::<AseAsset>()\n","file_path":"src/loader.rs","rank":14,"score":5.483701394563448},{"content":"// Data used to move animations into Bevy.\n\nstruct AnimationImportData<'a> {\n\n animation_data: Vec<AnimationData>,\n\n sprite_data: Vec<SpriteData<Handle<Texture>>>,\n\n atlas: &'a TextureAtlas,\n\n atlas_handle: Handle<TextureAtlas>,\n\n}\n\n\n","file_path":"src/processing.rs","rank":15,"score":5.188862181002882},{"content":"/// To load Aseprite files, or check their loading status, a system can accept the [Loader] as a parameter.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::loader::Loader;\n\n/// // Adds a Loader instance to the app's resources.\n\n/// // The AseLoaderDefaultPlugin already does this by default.\n\n/// fn build(app: &mut AppBuilder) {\n\n/// app.init_resource::<Loader>();\n\n/// }\n\n/// ```\n\n\n\npub struct Loader {\n\n todo_handles: Vec<Handle<AseAsset>>,\n\n in_progress: Arc<AtomicU32>,\n\n done: Arc<Mutex<Vec<processing::ResourceDataByFile>>>,\n\n}\n\n\n","file_path":"src/loader.rs","rank":16,"score":5.076758163772416},{"content":" ///\n\n /// // System function which sends ase assets in the \"sprites\" folder to the loader.\n\n /// pub fn load_sprites(asset_server: Res<AssetServer>, mut aseloader: ResMut<Loader>) {\n\n /// let handles = asset_server.load_folder(std::path::Path::new(\"sprites\")).unwrap();\n\n /// for h in &handles {\n\n /// aseloader.add(h.clone().typed::<AseAsset>());\n\n /// }\n\n /// }\n\n /// ```\n\n pub fn add(&mut self, handle: Handle<AseAsset>) {\n\n self.todo_handles.push(handle);\n\n }\n\n\n\n /// Returns the number of [AseAsset] handles currently being processed.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use bevy::prelude::*;\n\n /// use bevy_ase::loader::Loader;\n","file_path":"src/loader.rs","rank":17,"score":4.929419845592352},{"content":" }\n\n }\n\n }\n\n}\n\n\n\n// Tuple of all resource types to move data into.\n\npub(crate) type AseAssetResources<'a> = (\n\n ResMut<'a, Assets<Texture>>,\n\n Option<ResMut<'a, Assets<Animation>>>,\n\n Option<ResMut<'a, Assets<TextureAtlas>>>,\n\n Option<ResMut<'a, Assets<Tileset>>>,\n\n Option<ResMut<'a, Assets<Slice>>>,\n\n Option<ResMut<'a, AseFileMap>>,\n\n);\n\n\n\n/// System function for moving loaded Aseprite assets into Resoures.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use bevy::prelude::*;\n\n/// use bevy_ase::loader::ase_importer;\n\n///\n\n/// // Creates a Bevy app and adds the ase_importer system.\n\n/// // This system is already added by default in AseLoaderPlugin.\n\n/// fn app() {\n\n/// App::build().add_system(ase_importer.system());\n\n/// }\n\n/// ```\n","file_path":"src/loader.rs","rank":18,"score":4.850926104836984},{"content":"/// # Examples\n\n///\n\n/// ```\n\n/// #[cfg(feature = \"benimator\")]\n\n/// use bevy_ase::asset::{Animation, Frame};\n\n/// use benimator::SpriteSheetAnimation;\n\n///\n\n/// // Create a benimator SpriteSheetAnimation from a reference to a bevy_ase Animation.\n\n/// fn to_benimator_anim(animation: &Animation) -> SpriteSheetAnimation {\n\n/// animation.into() \n\n/// }\n\n///\n\n/// // Create a benimator Frame from a a reference to a bevy_ase Frame.\n\n/// fn to_benimator_frame(frame: &Frame) -> benimator::Frame {\n\n/// frame.into() \n\n/// }\n\n/// ```\n\npub mod benimator;\n\n\n\n#[cfg(feature = \"bevy_ecs_tilemap\")]\n","file_path":"src/lib.rs","rank":19,"score":4.557082994330216},{"content":"use asefile::{AsepriteFile, Tag};\n\nuse bevy::{\n\n prelude::*,\n\n reflect::TypeUuid,\n\n render::texture::{Extent3d, TextureDimension, TextureFormat},\n\n sprite::TextureAtlas,\n\n};\n\nuse std::path::{Path, PathBuf};\n\n\n\n/// A sprite-based animation.\n\n#[derive(Debug, TypeUuid)]\n\n#[uuid = \"49c1ff21-7abe-4167-b25b-f3730763e348\"]\n\npub struct Animation {\n\n frames: Vec<Frame>,\n\n atlas: Handle<TextureAtlas>,\n\n}\n\nimpl Animation {\n\n /// Creates a new Animation with a [Frame] vec and a [TextureAtlas] handle.\n\n pub fn new(frames: Vec<Frame>, atlas: Handle<TextureAtlas>) -> Self {\n\n Animation { frames, atlas }\n","file_path":"src/asset/animation.rs","rank":20,"score":4.494890589125802},{"content":"use std::path::PathBuf;\n\n\n\nuse asefile::AsepriteFile;\n\n\n\nuse crate::processing::{self, ResourceData};\n\n\n","file_path":"src/tests.rs","rank":22,"score":3.04630260626598},{"content":"pub(crate) mod animation;\n\npub(crate) mod ase;\n\npub(crate) mod asset_index;\n\npub mod slice;\n\npub(crate) mod tileset;\n\n\n\npub use animation::{Animation, Frame, Sprite};\n\npub use ase::AseAsset;\n\npub use asefile::UserData;\n\npub use asset_index::{AseAssetMap, AseFileMap};\n\npub use tileset::{TileSize, Tileset};\n","file_path":"src/asset.rs","rank":23,"score":2.7828871002647695},{"content":"//! Types for slice data.\n\npub use asefile::{Slice9, SliceKey, SliceOrigin, SlicePivot, SliceSize};\n\nuse bevy::reflect::TypeUuid;\n\n\n\n/// A slice is a region of an Ase sprite with a name and optional user data.\n\n#[derive(Debug, TypeUuid)]\n\n#[uuid = \"d12e0ddb-b47b-4d50-ae12-73eb970feae2\"]\n\npub struct Slice {\n\n /// The name of the slice. Not guaranteed to be unique.\n\n pub name: String,\n\n /// A set of [asefile::SliceKey] structs. Together, these describe the shape and position of a slice during animation.\n\n pub keys: Vec<asefile::SliceKey>,\n\n /// Optional [asefile::UserData] associated with this slice.\n\n pub user_data: Option<asefile::UserData>,\n\n}\n\nimpl Slice {\n\n pub(crate) fn from_ase(ase_slice: &asefile::Slice) -> Self {\n\n let asefile::Slice {\n\n name,\n\n keys,\n","file_path":"src/asset/slice.rs","rank":24,"score":2.5636228845186624},{"content":"/// Implements conversions from bevy_ase assets into bevy_ecs_tilemap assets.\n\n///\n\n/// Adds the [layer_settings](asset::Tileset::layer_settings) method to [Tileset](asset::Tileset).\n\npub mod bevy_ecs_tilemap;\n\n\n\n/// Provides systems and resources for loading Aseprite files.\n\n///\n\n/// The default loader configuration provided by [loader::AseLoaderDefaultPlugin] contains\n\n/// asset types and processing for all Aseprite data types provided by this library.\n\npub mod loader;\n\nmod processing;\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"src/lib.rs","rank":25,"score":2.3091351182902136},{"content":"#![warn(missing_docs)]\n\n//! Utilities for loading [`Aseprite`] files into a [`Bevy`] application.\n\n//!\n\n//! Provides [Loader](loader::Loader), an [AssetLoader](bevy::asset::AssetLoader) struct which directly\n\n//! reads .aseprite files without an intermediate import step.\n\n//! The loader adds [`Resources`] generated by the files' data.\n\n//! Systems can invoke the loader's methods to start loading files,\n\n//! or query the loading state.\n\n//!\n\n//! # Resources\n\n//!\n\n//! This library creates several types of resources:\n\n//!\n\n//! - [Texture](bevy::render::texture::Texture) data, which contains the file's images.\n\n//! - [TextureAtlas](bevy::sprite::TextureAtlas) data, which contains mapping information for each sprite in a spritesheet.\n\n//! - [Animation](asset::Animation) data.\n\n//! - [Slice](asset::slice::Slice) data.\n\n//! - [Tileset](asset::Tileset) data (from files created in Aseprite v1.3 beta).\n\n//!\n\n//! # Configuration\n","file_path":"src/lib.rs","rank":26,"score":2.2094136875323804},{"content":"use crate::asset::{Animation, Frame};\n\nuse std::time::Duration;\n\n\n\nimpl From<&Frame> for benimator::Frame {\n\n fn from(f: &Frame) -> Self {\n\n benimator::Frame {\n\n duration: Duration::from_millis(f.duration_ms as u64),\n\n index: f.sprite.atlas_index,\n\n }\n\n }\n\n}\n\nimpl From<&Animation> for benimator::SpriteSheetAnimation {\n\n fn from(a: &Animation) -> Self {\n\n let frames = a.frames().iter().map(|f| f.into()).collect();\n\n benimator::SpriteSheetAnimation::from_frames(frames)\n\n }\n\n}\n","file_path":"src/benimator.rs","rank":27,"score":2.104295682863823},{"content":"//! }\n\n//! }\n\n//! ```\n\n//! [`Bevy`]: https://bevyengine.org/\n\n//! [`Aseprite`]: https://www.aseprite.org/\n\n//! [`Resources`]: https://bevyengine.org/learn/book/getting-started/resources/\n\n\n\n/// Provides asset types for working with Aseprite data.\n\n///\n\n/// Data from Aseprite files moved into Bevy includes Textures, [Animations](asset::Animation),\n\n/// [Slices](asset::slice::Slice), and [Tilesets](asset::Tileset). This module also provides\n\n/// map resources to access assets by keying with a file path and an asset name.\n\npub mod asset;\n\n#[cfg(feature = \"benimator\")]\n\n/// Implements conversions from bevy_ase assets into benimator assets.\n\n///\n\n/// Enabled by the \"benimator\" feature. Provides a [From] &[Animation](asset::Animation)\n\n/// implementation for benimator's SpriteSheetAnimation type,\n\n/// and [From] &[Frame](asset::Frame) implementation for benimator's Frame type.\n\n///\n","file_path":"src/lib.rs","rank":28,"score":2.013622822076464},{"content":" .add_asset::<Texture>()\n\n .add_asset::<TextureAtlas>()\n\n .add_asset::<Animation>()\n\n .add_asset::<Tileset>()\n\n .add_asset::<Slice>()\n\n .init_resource::<Loader>()\n\n .init_resource::<AseFileMap>()\n\n .init_asset_loader::<AseAssetLoader>()\n\n .add_system(ase_importer.system());\n\n }\n\n}\n\n\n\nconst DEFAULT_EXTENSIONS: &[&str; 2] = &[\"aseprite\", \"ase\"];\n\n\n\n/// Asset loader resource for bevy files.\n\n///\n\n/// A default AseAssetLoader instance is already initialized in the AseLoaderDefaultPlugin.\n\n/// # Examples\n\n///\n\n/// ## Default\n","file_path":"src/loader.rs","rank":29,"score":1.289734324021496},{"content":" load_context: &'a mut bevy::asset::LoadContext,\n\n ) -> BoxedFuture<'a, Result<(), anyhow::Error>> {\n\n Box::pin(async move {\n\n debug!(\"Loading/parsing asefile: {}\", load_context.path().display());\n\n let ase = AseAsset {\n\n data: AseData::Loaded(AsepriteFile::read(bytes)?),\n\n name: load_context.path().to_owned(),\n\n };\n\n load_context.set_default_asset(LoadedAsset::new(ase));\n\n Ok(())\n\n })\n\n }\n\n\n\n fn extensions(&self) -> &[&str] {\n\n self.extensions\n\n }\n\n}\n\n/// Provides methods for loading [AseAsset].\n\n///\n\n/// The [AseLoaderDefaultPlugin] adds this as a resource by default.\n","file_path":"src/loader.rs","rank":30,"score":1.2096488748005134},{"content":"/// }\n\n///\n\n/// // Get the first tileset in this file with the name \"bar\".\n\n/// fn get_bar_tileset(ase_asset_map: &AseAssetMap) -> Option<Handle<Tileset>> {\n\n/// ase_asset_map.tilesets(\"foo\")?.first().map(Handle::clone)\n\n/// }\n\n/// ```\n\n///\n\n/// # Notes\n\n///\n\n/// The owning AseFileMap instance provides convenience methods to index a file\n\n/// and an asset simultaneously. These methods also clone the Handle value before returning.\n\n///\n\n/// [Texture] assets are mapped to their frame index. This map does not include Textures\n\n/// rendered from [Tileset] assets. To access a Tileset's Texture, use the texture field\n\n/// on a tileset asset.\n\n///\n\n/// [Animation], [Slice], and Tileset assets are mapped to their string name. There may be\n\n/// more than one asset with the same name. If just one asset is expected,\n\n/// compose the result with `first()`.\n","file_path":"src/asset/asset_index.rs","rank":31,"score":1.0418957777152622}],"string":"[\n {\n \"content\": \"use crate::asset::{TileSize, Tileset};\\n\\nuse bevy::math::{UVec2, Vec2};\\n\\nuse bevy_ecs_tilemap::prelude::*;\\n\\n\\n\\nimpl From<TileSize> for Vec2 {\\n\\n fn from(tile_size: TileSize) -> Self {\\n\\n Vec2::new(tile_size.width as f32, tile_size.height as f32)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Tileset {\\n\\n /// Creates new [LayerSettings] using the [Tileset's](Tileset) own tile size and texture size.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// #[cfg(feature = \\\"bevy_ecs_tilemap\\\")]\\n\\n /// use bevy_ase::asset::Tileset;\\n\\n /// use bevy_ecs_tilemap::LayerSettings;\\n\\n /// use bevy::math::UVec2;\\n\",\n \"file_path\": \"src/bevy_ecs_tilemap.rs\",\n \"rank\": 0,\n \"score\": 22379.489292726226\n },\n {\n \"content\": \" ///\\n\\n /// // Create new layer settings from a tileset, with specified map size and chunk size.\\n\\n /// fn my_layer_settings(tileset: &Tileset) -> LayerSettings {\\n\\n /// let map_size = UVec2::new(30, 30);\\n\\n /// let chunk_size = UVec2::new(15, 15);\\n\\n /// tileset.layer_settings(map_size, chunk_size) \\n\\n /// }\\n\\n /// ```\\n\\n pub fn layer_settings(&self, map_size: UVec2, chunk_size: UVec2) -> LayerSettings {\\n\\n LayerSettings::new(\\n\\n map_size,\\n\\n chunk_size,\\n\\n Vec2::new(self.tile_size.width as f32, self.tile_size.height as f32),\\n\\n self.texture_size(),\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/bevy_ecs_tilemap.rs\",\n \"rank\": 1,\n \"score\": 22372.745362086793\n },\n {\n \"content\": \"Utilities for loading Aseprite files into a Bevy application.\\n\\n\\n\\nProvides an AssetLoader struct which directly\\n\\nreads .aseprite files without an intermediate import step.\\n\\nThe loader adds Resources generated by the files' data.\\n\\nSystems can invoke the loader's methods to start loading files,\\n\\nor query the loading state.\\n\\n\\n\\n# Resources\\n\\n\\n\\nThis library creates several types of resources:\\n\\n\\n\\n- Texture data, which contains the file's images.\\n\\n- TextureAtlas data, which contains mapping information for each sprite in a spritesheet.\\n\\n- Animation data.\\n\\n- Slice data.\\n\\n- Tileset data (from files created in Aseprite v1.3 beta).\\n\\n\\n\\n# Configuration\\n\\n\\n\\nThis library exposes AseLoaderDefaultPlugin with default settings.\\n\\nThis plugin initializes all of the above resources as Asset types, adds Loader and AseAssetLoader resources,\\n\\nand adds an importer system function to process loaded ase data.\\n\\n\\n\\nFor a custom configuration, import the constituent parts and add them to AppBuilder directly.\\n\\nThe Texture resource is required to be initialized. Other asset types are optional.\\n\\n\\n\\n# Examples\\n\\n\\n\\n```rs\\n\\nuse bevy::prelude::*;\\n\\nuse bevy_ase::asset::AseAsset;\\n\\nuse bevy_ase::loader::{AseLoaderDefaultPlugin, Loader};\\n\\nuse std::path::Path;\\n\\n\\n\\n// Initialize and run a bevy app with the default bevy_ase configuration.\\n\\nfn main() {\\n\\n App::build()\\n\\n .add_plugins(DefaultPlugins)\\n\\n .add_plugin(AseLoaderDefaultPlugin)\\n\\n .add_system(load_sprites.system());\\n\\n}\\n\\n\\n\\n// Get an aseprite asset and send it to the loader.\\n\\npub fn load_sprites(asset_server: Res<AssetServer>, mut loader: ResMut<Loader>) {\\n\\n let h: Handle<AseAsset> = asset_server.load(Path::new(\\\"sprites/hello.aseprite\\\"));\\n\\n loader.add(h.clone());\\n\\n}\\n\\n```\\n\\nSee the documentation for lib.rs for more information.\\n\\n\\n\\nForked from https://github.com/alpine-alpaca/bevy_proto_aseprite.\\n\\n\\n\\n# Example\\n\\n\\n\\n```\\n\\ncargo run --example animated --features=\\\"benimator\\\"\\n\\n```\\n\\n\\n\\n# TODOs\\n\\n\\n\\n- Improve error handling.\\n\\n\\n\\n- Atlas creation fails if there are too many / too big sprites.\\n\\n\\n\\n- Hot reloading. This requires dynamic atlas reconstruction.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 2,\n \"score\": 14308.387235882661\n },\n {\n \"content\": \"use std::path::Path;\\n\\n\\n\\nuse bevy::{input::system::exit_on_esc_system, prelude::*};\\n\\nuse bevy_ase::{\\n\\n self,\\n\\n asset::{AseAsset, Tileset},\\n\\n loader,\\n\\n loader::Loader,\\n\\n};\\n\\nuse bevy_ecs_tilemap::prelude::*;\\n\\n\\n\",\n \"file_path\": \"examples/tilemap/main.rs\",\n \"rank\": 3,\n \"score\": 8.295252508764376\n },\n {\n \"content\": \"use std::path::Path;\\n\\n\\n\\nuse bevy::{input::system::exit_on_esc_system, prelude::*, sprite::entity::SpriteSheetBundle};\\n\\nuse bevy_ase::{\\n\\n self,\\n\\n asset::{Animation, AseAsset},\\n\\n loader::{self, Loader},\\n\\n};\\n\\n\\n\",\n \"file_path\": \"examples/animated/main.rs\",\n \"rank\": 4,\n \"score\": 7.205513123270655\n },\n {\n \"content\": \"/// The default AseAssetLoader loads files with extensions \\\"aseprite\\\" and \\\"ase\\\".\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::loader::AseAssetLoader;\\n\\n///\\n\\n/// fn build(app: &mut AppBuilder) {\\n\\n/// app.init_asset_loader::<AseAssetLoader>();\\n\\n/// }\\n\\n/// ```\\n\\n/// ## Custom extensions\\n\\n/// The AseAssetLoader can be instantiated with a custom set of targeted file extensions.\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::loader::AseAssetLoader;\\n\\n///\\n\\n/// fn build(app: &mut AppBuilder) {\\n\\n/// let my_loader = AseAssetLoader {\\n\\n/// extensions: &[\\\"aseprite\\\", \\\"my_custom_extension\\\"]\\n\\n/// };\\n\\n/// app.add_asset_loader(my_loader);\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 5,\n \"score\": 6.620532200948027\n },\n {\n \"content\": \"impl Default for Loader {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n todo_handles: Vec::new(),\\n\\n in_progress: Arc::new(AtomicU32::new(0)),\\n\\n done: Arc::new(Mutex::new(Vec::new())),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Loader {\\n\\n /// Adds an [AseAsset] to the [Loader] for loading.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use bevy::prelude::*;\\n\\n /// use bevy_ase::asset::AseAsset;\\n\\n /// use bevy_ase::loader::Loader;\\n\\n /// use std::path::Path;\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 6,\n \"score\": 6.535257345469066\n },\n {\n \"content\": \"use crate::asset::{\\n\\n animation::{Animation, AnimationData, Frame, Sprite, SpriteData},\\n\\n slice::Slice,\\n\\n tileset::{TilesetData, TilesetResult},\\n\\n AseAssetMap, Tileset,\\n\\n};\\n\\nuse crate::loader::AseAssetResources;\\n\\nuse asefile::AsepriteFile;\\n\\nuse bevy::sprite::TextureAtlasBuilder;\\n\\nuse bevy::{prelude::*, utils::HashMap};\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\",\n \"file_path\": \"src/processing.rs\",\n \"rank\": 7,\n \"score\": 6.41817585559359\n },\n {\n \"content\": \"/// System function for moving loaded Aseprite assets into Resoures.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::loader::ase_importer;\\n\\n///\\n\\n/// // Creates a Bevy app and adds the ase_importer system.\\n\\n/// // This system is already added by default in AseLoaderPlugin.\\n\\n/// fn app() {\\n\\n/// App::build().add_system(ase_importer.system());\\n\\n/// }\\n\\n/// ```\\n\\npub fn ase_importer(\\n\\n mut loader: ResMut<Loader>,\\n\\n task_pool: ResMut<AsyncComputeTaskPool>,\\n\\n mut aseassets: ResMut<Assets<AseAsset>>,\\n\\n asset_server: Res<AssetServer>,\\n\\n resources: AseAssetResources,\\n\\n) {\\n\\n let pending = loader.pending_count();\\n\\n if pending > 0 {\\n\\n debug!(\\\"Processing asefiles (batches: {})\\\", pending);\\n\\n }\\n\\n if loader.all_todo_handles_ready(&asset_server) {\\n\\n loader.spawn_tasks(&task_pool, &mut aseassets);\\n\\n }\\n\\n loader.move_finished_into_resources(resources);\\n\\n}\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 8,\n \"score\": 6.37311418217673\n },\n {\n \"content\": \"use asefile::AsepriteFile;\\n\\nuse bevy::reflect::TypeUuid;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n/// Handle type for ase assets.\\n\\n///\\n\\n/// [crate::loader::Loader] processes [AseAsset] instances and stores their data\\n\\n/// as various other data types in bevy's Assets resources.\\n\\n///\\n\\n/// Once an AseAsset has been processed into other resource types, its data is dropped.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::asset::AseAsset;\\n\\n///\\n\\n/// // Convert an untyped handle into an AseAsset handle.\\n\\n/// pub fn to_typed(handle: HandleUntyped) -> Handle<AseAsset> {\\n\\n/// handle.clone().typed::<AseAsset>()\\n\",\n \"file_path\": \"src/asset/ase.rs\",\n \"rank\": 9,\n \"score\": 6.35858227759487\n },\n {\n \"content\": \"//! Index for assets created by this library.\\n\\nuse super::{animation::Animation, slice::Slice, tileset::Tileset};\\n\\nuse bevy::utils::HashMap;\\n\\nuse bevy::{asset::Asset, prelude::*};\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\n/// Provides a map to [Handles](Handle) for an Ase file's assets.\\n\\n///\\n\\n/// Instances of this type are owned by [AseFileMap]. To access them during runtime,\\n\\n/// use the AseFileMap as a system parameter, and index each AseAssetMap by\\n\\n/// using the file's path as a key.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use bevy_ase::asset::{AseAssetMap, Animation, Tileset};\\n\\n/// use bevy::asset::Handle;\\n\\n/// // Get all animations in this file with the name \\\"foo\\\".\\n\\n/// fn get_foo_animations(ase_asset_map: &AseAssetMap) -> Option<&Vec<Handle<Animation>>> {\\n\\n/// ase_asset_map.animations(\\\"foo\\\")\\n\",\n \"file_path\": \"src/asset/asset_index.rs\",\n \"rank\": 10,\n \"score\": 5.950249292863557\n },\n {\n \"content\": \"use crate::asset::asset_index::AseFileMap;\\n\\nuse crate::asset::{ase::AseData, slice::Slice, Animation, AseAsset, Tileset};\\n\\nuse crate::processing::{self, ResourceDataByFile};\\n\\nuse asefile::AsepriteFile;\\n\\nuse bevy::{\\n\\n asset::{AssetLoader, BoxedFuture, LoadState, LoadedAsset},\\n\\n ecs::system::Res,\\n\\n prelude::*,\\n\\n tasks::AsyncComputeTaskPool,\\n\\n};\\n\\nuse std::{\\n\\n path::PathBuf,\\n\\n sync::{\\n\\n atomic::{AtomicU32, Ordering},\\n\\n Arc, Mutex,\\n\\n },\\n\\n};\\n\\n\\n\\n/// Provides a default Bevy app configuration for loading Aseprite files.\\n\\n///\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 11,\n \"score\": 5.71277533712607\n },\n {\n \"content\": \"//!\\n\\n//! This library exposes [a plugin](loader::AseLoaderDefaultPlugin) with default settings.\\n\\n//! This plugin initializes all of the above resources as Asset types,\\n\\n//! adds [Loader](loader::Loader) and [AseAssetLoader](loader::AseAssetLoader) resources,\\n\\n//! and adds an [importer system function](loader::ase_importer) to process loaded ase data.\\n\\n//! For a custom configuration, import the constituent parts and add them to AppBuilder directly.\\n\\n//! The Texture resource is required to be initialized. Other asset types are optional.\\n\\n//!\\n\\n//! # Examples\\n\\n//!\\n\\n//! ```\\n\\n//! use bevy::prelude::*;\\n\\n//! use bevy_ase::asset::AseAsset;\\n\\n//! use bevy_ase::loader::{AseLoaderDefaultPlugin, Loader};\\n\\n//! use std::path::Path;\\n\\n//!\\n\\n//! // Initialize and run a bevy app with the default bevy_ase configuration.\\n\\n//! fn main() {\\n\\n//! App::build()\\n\\n//! .add_plugins(DefaultPlugins)\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 12,\n \"score\": 5.648164154409089\n },\n {\n \"content\": \"//! ```\\n\\n//! use bevy::prelude::*;\\n\\n//! use bevy_ase;\\n\\n//! #[cfg(feature = \\\"benimator\\\")]\\n\\n//! use benimator;\\n\\n//!\\n\\n//! // Creates a benimator animation asset whenever a bevy_ase animation asset is created.\\n\\n//! #[cfg(feature = \\\"benimator\\\")]\\n\\n//! pub fn convert_animation(\\n\\n//! mut event_reader: EventReader<AssetEvent<bevy_ase::asset::Animation>>,\\n\\n//! animations: Res<Assets<bevy_ase::asset::Animation>>,\\n\\n//! mut sprite_sheet_animations: ResMut<Assets<benimator::SpriteSheetAnimation>>,\\n\\n//! ) {\\n\\n//! for evt in event_reader.iter() {\\n\\n//! if let AssetEvent::Created { handle } = evt {\\n\\n//! // Unwrap: Responding to Asset Created event, so asset exists\\n\\n//! let anim = animations.get(handle).unwrap();\\n\\n//! let converted_animation = anim.into();\\n\\n//! sprite_sheet_animations.add(converted_animation);\\n\\n//! }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 13,\n \"score\": 5.486129962113589\n },\n {\n \"content\": \"/// This initializes all of bevy_ase's asset types, a [Loader] resource,\\n\\n/// an [AseAssetLoader] asset loader, and the [ase_importer] system function.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::loader::AseLoaderDefaultPlugin;\\n\\n/// fn app() {\\n\\n/// App::build()\\n\\n/// .add_plugins(DefaultPlugins)\\n\\n/// // Add the default plugin to the bevy app build.\\n\\n/// .add_plugin(AseLoaderDefaultPlugin);\\n\\n/// }\\n\\n/// ```\\n\\npub struct AseLoaderDefaultPlugin;\\n\\n\\n\\nimpl Plugin for AseLoaderDefaultPlugin {\\n\\n fn build(&self, app: &mut AppBuilder) {\\n\\n app.add_asset::<AseAsset>()\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 14,\n \"score\": 5.483701394563448\n },\n {\n \"content\": \"// Data used to move animations into Bevy.\\n\\nstruct AnimationImportData<'a> {\\n\\n animation_data: Vec<AnimationData>,\\n\\n sprite_data: Vec<SpriteData<Handle<Texture>>>,\\n\\n atlas: &'a TextureAtlas,\\n\\n atlas_handle: Handle<TextureAtlas>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/processing.rs\",\n \"rank\": 15,\n \"score\": 5.188862181002882\n },\n {\n \"content\": \"/// To load Aseprite files, or check their loading status, a system can accept the [Loader] as a parameter.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::loader::Loader;\\n\\n/// // Adds a Loader instance to the app's resources.\\n\\n/// // The AseLoaderDefaultPlugin already does this by default.\\n\\n/// fn build(app: &mut AppBuilder) {\\n\\n/// app.init_resource::<Loader>();\\n\\n/// }\\n\\n/// ```\\n\\n\\n\\npub struct Loader {\\n\\n todo_handles: Vec<Handle<AseAsset>>,\\n\\n in_progress: Arc<AtomicU32>,\\n\\n done: Arc<Mutex<Vec<processing::ResourceDataByFile>>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 16,\n \"score\": 5.076758163772416\n },\n {\n \"content\": \" ///\\n\\n /// // System function which sends ase assets in the \\\"sprites\\\" folder to the loader.\\n\\n /// pub fn load_sprites(asset_server: Res<AssetServer>, mut aseloader: ResMut<Loader>) {\\n\\n /// let handles = asset_server.load_folder(std::path::Path::new(\\\"sprites\\\")).unwrap();\\n\\n /// for h in &handles {\\n\\n /// aseloader.add(h.clone().typed::<AseAsset>());\\n\\n /// }\\n\\n /// }\\n\\n /// ```\\n\\n pub fn add(&mut self, handle: Handle<AseAsset>) {\\n\\n self.todo_handles.push(handle);\\n\\n }\\n\\n\\n\\n /// Returns the number of [AseAsset] handles currently being processed.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use bevy::prelude::*;\\n\\n /// use bevy_ase::loader::Loader;\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 17,\n \"score\": 4.929419845592352\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Tuple of all resource types to move data into.\\n\\npub(crate) type AseAssetResources<'a> = (\\n\\n ResMut<'a, Assets<Texture>>,\\n\\n Option<ResMut<'a, Assets<Animation>>>,\\n\\n Option<ResMut<'a, Assets<TextureAtlas>>>,\\n\\n Option<ResMut<'a, Assets<Tileset>>>,\\n\\n Option<ResMut<'a, Assets<Slice>>>,\\n\\n Option<ResMut<'a, AseFileMap>>,\\n\\n);\\n\\n\\n\\n/// System function for moving loaded Aseprite assets into Resoures.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use bevy::prelude::*;\\n\\n/// use bevy_ase::loader::ase_importer;\\n\\n///\\n\\n/// // Creates a Bevy app and adds the ase_importer system.\\n\\n/// // This system is already added by default in AseLoaderPlugin.\\n\\n/// fn app() {\\n\\n/// App::build().add_system(ase_importer.system());\\n\\n/// }\\n\\n/// ```\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 18,\n \"score\": 4.850926104836984\n },\n {\n \"content\": \"/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// #[cfg(feature = \\\"benimator\\\")]\\n\\n/// use bevy_ase::asset::{Animation, Frame};\\n\\n/// use benimator::SpriteSheetAnimation;\\n\\n///\\n\\n/// // Create a benimator SpriteSheetAnimation from a reference to a bevy_ase Animation.\\n\\n/// fn to_benimator_anim(animation: &Animation) -> SpriteSheetAnimation {\\n\\n/// animation.into() \\n\\n/// }\\n\\n///\\n\\n/// // Create a benimator Frame from a a reference to a bevy_ase Frame.\\n\\n/// fn to_benimator_frame(frame: &Frame) -> benimator::Frame {\\n\\n/// frame.into() \\n\\n/// }\\n\\n/// ```\\n\\npub mod benimator;\\n\\n\\n\\n#[cfg(feature = \\\"bevy_ecs_tilemap\\\")]\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 19,\n \"score\": 4.557082994330216\n },\n {\n \"content\": \"use asefile::{AsepriteFile, Tag};\\n\\nuse bevy::{\\n\\n prelude::*,\\n\\n reflect::TypeUuid,\\n\\n render::texture::{Extent3d, TextureDimension, TextureFormat},\\n\\n sprite::TextureAtlas,\\n\\n};\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\n/// A sprite-based animation.\\n\\n#[derive(Debug, TypeUuid)]\\n\\n#[uuid = \\\"49c1ff21-7abe-4167-b25b-f3730763e348\\\"]\\n\\npub struct Animation {\\n\\n frames: Vec<Frame>,\\n\\n atlas: Handle<TextureAtlas>,\\n\\n}\\n\\nimpl Animation {\\n\\n /// Creates a new Animation with a [Frame] vec and a [TextureAtlas] handle.\\n\\n pub fn new(frames: Vec<Frame>, atlas: Handle<TextureAtlas>) -> Self {\\n\\n Animation { frames, atlas }\\n\",\n \"file_path\": \"src/asset/animation.rs\",\n \"rank\": 20,\n \"score\": 4.494890589125802\n },\n {\n \"content\": \"use std::path::PathBuf;\\n\\n\\n\\nuse asefile::AsepriteFile;\\n\\n\\n\\nuse crate::processing::{self, ResourceData};\\n\\n\\n\",\n \"file_path\": \"src/tests.rs\",\n \"rank\": 22,\n \"score\": 3.04630260626598\n },\n {\n \"content\": \"pub(crate) mod animation;\\n\\npub(crate) mod ase;\\n\\npub(crate) mod asset_index;\\n\\npub mod slice;\\n\\npub(crate) mod tileset;\\n\\n\\n\\npub use animation::{Animation, Frame, Sprite};\\n\\npub use ase::AseAsset;\\n\\npub use asefile::UserData;\\n\\npub use asset_index::{AseAssetMap, AseFileMap};\\n\\npub use tileset::{TileSize, Tileset};\\n\",\n \"file_path\": \"src/asset.rs\",\n \"rank\": 23,\n \"score\": 2.7828871002647695\n },\n {\n \"content\": \"//! Types for slice data.\\n\\npub use asefile::{Slice9, SliceKey, SliceOrigin, SlicePivot, SliceSize};\\n\\nuse bevy::reflect::TypeUuid;\\n\\n\\n\\n/// A slice is a region of an Ase sprite with a name and optional user data.\\n\\n#[derive(Debug, TypeUuid)]\\n\\n#[uuid = \\\"d12e0ddb-b47b-4d50-ae12-73eb970feae2\\\"]\\n\\npub struct Slice {\\n\\n /// The name of the slice. Not guaranteed to be unique.\\n\\n pub name: String,\\n\\n /// A set of [asefile::SliceKey] structs. Together, these describe the shape and position of a slice during animation.\\n\\n pub keys: Vec<asefile::SliceKey>,\\n\\n /// Optional [asefile::UserData] associated with this slice.\\n\\n pub user_data: Option<asefile::UserData>,\\n\\n}\\n\\nimpl Slice {\\n\\n pub(crate) fn from_ase(ase_slice: &asefile::Slice) -> Self {\\n\\n let asefile::Slice {\\n\\n name,\\n\\n keys,\\n\",\n \"file_path\": \"src/asset/slice.rs\",\n \"rank\": 24,\n \"score\": 2.5636228845186624\n },\n {\n \"content\": \"/// Implements conversions from bevy_ase assets into bevy_ecs_tilemap assets.\\n\\n///\\n\\n/// Adds the [layer_settings](asset::Tileset::layer_settings) method to [Tileset](asset::Tileset).\\n\\npub mod bevy_ecs_tilemap;\\n\\n\\n\\n/// Provides systems and resources for loading Aseprite files.\\n\\n///\\n\\n/// The default loader configuration provided by [loader::AseLoaderDefaultPlugin] contains\\n\\n/// asset types and processing for all Aseprite data types provided by this library.\\n\\npub mod loader;\\n\\nmod processing;\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 25,\n \"score\": 2.3091351182902136\n },\n {\n \"content\": \"#![warn(missing_docs)]\\n\\n//! Utilities for loading [`Aseprite`] files into a [`Bevy`] application.\\n\\n//!\\n\\n//! Provides [Loader](loader::Loader), an [AssetLoader](bevy::asset::AssetLoader) struct which directly\\n\\n//! reads .aseprite files without an intermediate import step.\\n\\n//! The loader adds [`Resources`] generated by the files' data.\\n\\n//! Systems can invoke the loader's methods to start loading files,\\n\\n//! or query the loading state.\\n\\n//!\\n\\n//! # Resources\\n\\n//!\\n\\n//! This library creates several types of resources:\\n\\n//!\\n\\n//! - [Texture](bevy::render::texture::Texture) data, which contains the file's images.\\n\\n//! - [TextureAtlas](bevy::sprite::TextureAtlas) data, which contains mapping information for each sprite in a spritesheet.\\n\\n//! - [Animation](asset::Animation) data.\\n\\n//! - [Slice](asset::slice::Slice) data.\\n\\n//! - [Tileset](asset::Tileset) data (from files created in Aseprite v1.3 beta).\\n\\n//!\\n\\n//! # Configuration\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 26,\n \"score\": 2.2094136875323804\n },\n {\n \"content\": \"use crate::asset::{Animation, Frame};\\n\\nuse std::time::Duration;\\n\\n\\n\\nimpl From<&Frame> for benimator::Frame {\\n\\n fn from(f: &Frame) -> Self {\\n\\n benimator::Frame {\\n\\n duration: Duration::from_millis(f.duration_ms as u64),\\n\\n index: f.sprite.atlas_index,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl From<&Animation> for benimator::SpriteSheetAnimation {\\n\\n fn from(a: &Animation) -> Self {\\n\\n let frames = a.frames().iter().map(|f| f.into()).collect();\\n\\n benimator::SpriteSheetAnimation::from_frames(frames)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/benimator.rs\",\n \"rank\": 27,\n \"score\": 2.104295682863823\n },\n {\n \"content\": \"//! }\\n\\n//! }\\n\\n//! ```\\n\\n//! [`Bevy`]: https://bevyengine.org/\\n\\n//! [`Aseprite`]: https://www.aseprite.org/\\n\\n//! [`Resources`]: https://bevyengine.org/learn/book/getting-started/resources/\\n\\n\\n\\n/// Provides asset types for working with Aseprite data.\\n\\n///\\n\\n/// Data from Aseprite files moved into Bevy includes Textures, [Animations](asset::Animation),\\n\\n/// [Slices](asset::slice::Slice), and [Tilesets](asset::Tileset). This module also provides\\n\\n/// map resources to access assets by keying with a file path and an asset name.\\n\\npub mod asset;\\n\\n#[cfg(feature = \\\"benimator\\\")]\\n\\n/// Implements conversions from bevy_ase assets into benimator assets.\\n\\n///\\n\\n/// Enabled by the \\\"benimator\\\" feature. Provides a [From] &[Animation](asset::Animation)\\n\\n/// implementation for benimator's SpriteSheetAnimation type,\\n\\n/// and [From] &[Frame](asset::Frame) implementation for benimator's Frame type.\\n\\n///\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 28,\n \"score\": 2.013622822076464\n },\n {\n \"content\": \" .add_asset::<Texture>()\\n\\n .add_asset::<TextureAtlas>()\\n\\n .add_asset::<Animation>()\\n\\n .add_asset::<Tileset>()\\n\\n .add_asset::<Slice>()\\n\\n .init_resource::<Loader>()\\n\\n .init_resource::<AseFileMap>()\\n\\n .init_asset_loader::<AseAssetLoader>()\\n\\n .add_system(ase_importer.system());\\n\\n }\\n\\n}\\n\\n\\n\\nconst DEFAULT_EXTENSIONS: &[&str; 2] = &[\\\"aseprite\\\", \\\"ase\\\"];\\n\\n\\n\\n/// Asset loader resource for bevy files.\\n\\n///\\n\\n/// A default AseAssetLoader instance is already initialized in the AseLoaderDefaultPlugin.\\n\\n/// # Examples\\n\\n///\\n\\n/// ## Default\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 29,\n \"score\": 1.289734324021496\n },\n {\n \"content\": \" load_context: &'a mut bevy::asset::LoadContext,\\n\\n ) -> BoxedFuture<'a, Result<(), anyhow::Error>> {\\n\\n Box::pin(async move {\\n\\n debug!(\\\"Loading/parsing asefile: {}\\\", load_context.path().display());\\n\\n let ase = AseAsset {\\n\\n data: AseData::Loaded(AsepriteFile::read(bytes)?),\\n\\n name: load_context.path().to_owned(),\\n\\n };\\n\\n load_context.set_default_asset(LoadedAsset::new(ase));\\n\\n Ok(())\\n\\n })\\n\\n }\\n\\n\\n\\n fn extensions(&self) -> &[&str] {\\n\\n self.extensions\\n\\n }\\n\\n}\\n\\n/// Provides methods for loading [AseAsset].\\n\\n///\\n\\n/// The [AseLoaderDefaultPlugin] adds this as a resource by default.\\n\",\n \"file_path\": \"src/loader.rs\",\n \"rank\": 30,\n \"score\": 1.2096488748005134\n },\n {\n \"content\": \"/// }\\n\\n///\\n\\n/// // Get the first tileset in this file with the name \\\"bar\\\".\\n\\n/// fn get_bar_tileset(ase_asset_map: &AseAssetMap) -> Option<Handle<Tileset>> {\\n\\n/// ase_asset_map.tilesets(\\\"foo\\\")?.first().map(Handle::clone)\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// # Notes\\n\\n///\\n\\n/// The owning AseFileMap instance provides convenience methods to index a file\\n\\n/// and an asset simultaneously. These methods also clone the Handle value before returning.\\n\\n///\\n\\n/// [Texture] assets are mapped to their frame index. This map does not include Textures\\n\\n/// rendered from [Tileset] assets. To access a Tileset's Texture, use the texture field\\n\\n/// on a tileset asset.\\n\\n///\\n\\n/// [Animation], [Slice], and Tileset assets are mapped to their string name. There may be\\n\\n/// more than one asset with the same name. If just one asset is expected,\\n\\n/// compose the result with `first()`.\\n\",\n \"file_path\": \"src/asset/asset_index.rs\",\n \"rank\": 31,\n \"score\": 1.0418957777152622\n }\n]","isConversational":false}}},{"rowIdx":1187,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"justanotherdot/cargo-watch"},"commit":{"kind":"string","value":"ac0a403e0c6b64a60dd7f5f78c049301ce092b4f"},"file_code":{"kind":"string","value":"\n#![forbid(unsafe_code, clippy::pedantic)]\n#![allow(\n clippy::non_ascii_literal,\n clippy::cast_sign_loss,\n clippy::cast_possible_truncation\n)]\n\n#[macro_use]\nextern crate clap;\nextern crate watchexec;\n\nuse clap::{ArgMatches, Error, ErrorKind};\nuse std::{env::set_current_dir, path::MAIN_SEPARATOR};\nuse watchexec::{Args, ArgsBuilder};\n\npub mod args;\npub mod cargo;\npub mod watch;\n\npub fn change_dir() {\n cargo::root()\n .and_then(|p| set_current_dir(p).ok())\n .unwrap_or_else(|| {\n Error::with_description(\"Not a Cargo project, aborting.\", ErrorKind::Io).exit();\n });\n}\n\npub fn set_commands(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n let mut commands: Vec<String> = Vec::new();\n\n \n if matches.is_present(\"cmd:cargo\") {\n for cargo in values_t!(matches, \"cmd:cargo\", String).unwrap_or_else(|e| e.exit()) {\n let mut cmd: String = \"cargo \".into();\n cmd.push_str(&cargo);\n commands.push(cmd);\n }\n }\n\n \n if matches.is_present(\"cmd:shell\") {\n for shell in values_t!(matches, \"cmd:shell\", String).unwrap_or_else(|e| e.exit()) {\n commands.push(shell);\n }\n }\n\n \n if commands.is_empty() {\n commands.push(\"cargo check\".into());\n }\n\n if debug {\n println!(\">>> Commands: {:?}\", commands);\n }\n\n builder.cmd(commands);\n}\n\npub fn set_ignores(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n if matches.is_present(\"ignore-nothing\") {\n if debug {\n println!(\">>> Ignoring nothing\");\n }\n\n builder.no_vcs_ignore(true);\n return;\n }\n\n let novcs = matches.is_present(\"no-gitignore\");\n builder.no_vcs_ignore(novcs);\n if debug {\n println!(\">>> Load Git/VCS ignores: {:?}\", !novcs);\n }\n\n let mut list = vec![\n \n format!(\"*{}.DS_Store\", MAIN_SEPARATOR),\n \n \"*.sw?\".into(),\n \"*.sw?x\".into(),\n \n \"#*#\".into(),\n \".#*\".into(),\n \n \".*.kate-swp\".into(),\n \n format!(\"*{s}.hg{s}**\", s = MAIN_SEPARATOR),\n format!(\"*{s}.git{s}**\", s = MAIN_SEPARATOR),\n format!(\"*{s}.svn{s}**\", s = MAIN_SEPARATOR),\n \n \"*.db\".into(),\n \"*.db-*\".into(),\n format!(\"*{s}*.db-journal{s}**\", s = MAIN_SEPARATOR),\n \n format!(\"*{s}target{s}**\", s = MAIN_SEPARATOR),\n ];\n\n if debug {\n println!(\">>> Default ignores: {:?}\", list);\n }\n\n if matches.is_present(\"ignore\") {\n for ignore in values_t!(matches, \"ignore\", String).unwrap_or_else(|e| e.exit()) {\n #[cfg(windows)]\n let ignore = ignore.replace(\"/\", &MAIN_SEPARATOR.to_string());\n list.push(ignore);\n }\n }\n\n if debug {\n println!(\">>> All ignores: {:?}\", list);\n }\n\n builder.ignores(list);\n}\n\npub fn set_debounce(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n let d = if matches.is_present(\"delay\") {\n let debounce = value_t!(matches, \"delay\", f32).unwrap_or_else(|e| e.exit());\n if debug {\n println!(\">>> File updates debounce: {} seconds\", debounce);\n }\n (debounce * 1000.0) as u32\n } else {\n 500\n };\n\n builder.poll_interval(d).debounce(d);\n}\n\npub fn set_watches(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n let mut opts = Vec::new();\n if matches.is_present(\"watch\") {\n for watch in values_t!(matches, \"watch\", String).unwrap_or_else(|e| e.exit()) {\n opts.push(watch.into());\n }\n }\n\n if opts.is_empty() {\n opts.push(\".\".into());\n }\n\n if debug {\n println!(\">>> Watches: {:?}\", opts);\n }\n\n builder.paths(opts);\n}\n\npub fn get_options(debug: bool, matches: &ArgMatches) -> Args {\n let mut builder = ArgsBuilder::default();\n builder\n .restart(!matches.is_present(\"no-restart\"))\n .poll(matches.is_present(\"poll\"))\n .clear_screen(matches.is_present(\"clear\"))\n .debug(debug)\n .run_initially(!matches.is_present(\"postpone\"));\n\n set_ignores(debug, &mut builder, &matches);\n set_debounce(debug, &mut builder, &matches);\n set_watches(debug, &mut builder, &matches);\n set_commands(debug, &mut builder, &matches);\n\n let mut args = builder.build().unwrap();\n args.once = matches.is_present(\"once\");\n\n if debug {\n println!(\">>> Watchexec arguments: {:?}\", args);\n }\n\n args\n}\n"},"prefix":{"kind":"string","value":"\n#![forbid(unsafe_code, clippy::pedantic)]\n#![allow(\n clippy::non_ascii_literal,\n clippy::cast_sign_loss,\n clippy::cast_possible_truncation\n)]\n\n#[macro_use]\nextern crate clap;\nextern crate watchexec;\n\nuse clap::{ArgMatches, Error, ErrorKind};\nuse std::{env::set_current_dir, path::MAIN_SEPARATOR};\nuse watchexec::{Args, ArgsBuilder};\n\npub mod args;\npub mod cargo;\npub mod watch;\n\n"},"suffix":{"kind":"string","value":"\n\npub fn set_commands(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n let mut commands: Vec<String> = Vec::new();\n\n \n if matches.is_present(\"cmd:cargo\") {\n for cargo in values_t!(matches, \"cmd:cargo\", String).unwrap_or_else(|e| e.exit()) {\n let mut cmd: String = \"cargo \".into();\n cmd.push_str(&cargo);\n commands.push(cmd);\n }\n }\n\n \n if matches.is_present(\"cmd:shell\") {\n for shell in values_t!(matches, \"cmd:shell\", String).unwrap_or_else(|e| e.exit()) {\n commands.push(shell);\n }\n }\n\n \n if commands.is_empty() {\n commands.push(\"cargo check\".into());\n }\n\n if debug {\n println!(\">>> Commands: {:?}\", commands);\n }\n\n builder.cmd(commands);\n}\n\npub fn set_ignores(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n if matches.is_present(\"ignore-nothing\") {\n if debug {\n println!(\">>> Ignoring nothing\");\n }\n\n builder.no_vcs_ignore(true);\n return;\n }\n\n let novcs = matches.is_present(\"no-gitignore\");\n builder.no_vcs_ignore(novcs);\n if debug {\n println!(\">>> Load Git/VCS ignores: {:?}\", !novcs);\n }\n\n let mut list = vec![\n \n format!(\"*{}.DS_Store\", MAIN_SEPARATOR),\n \n \"*.sw?\".into(),\n \"*.sw?x\".into(),\n \n \"#*#\".into(),\n \".#*\".into(),\n \n \".*.kate-swp\".into(),\n \n format!(\"*{s}.hg{s}**\", s = MAIN_SEPARATOR),\n format!(\"*{s}.git{s}**\", s = MAIN_SEPARATOR),\n format!(\"*{s}.svn{s}**\", s = MAIN_SEPARATOR),\n \n \"*.db\".into(),\n \"*.db-*\".into(),\n format!(\"*{s}*.db-journal{s}**\", s = MAIN_SEPARATOR),\n \n format!(\"*{s}target{s}**\", s = MAIN_SEPARATOR),\n ];\n\n if debug {\n println!(\">>> Default ignores: {:?}\", list);\n }\n\n if matches.is_present(\"ignore\") {\n for ignore in values_t!(matches, \"ignore\", String).unwrap_or_else(|e| e.exit()) {\n #[cfg(windows)]\n let ignore = ignore.replace(\"/\", &MAIN_SEPARATOR.to_string());\n list.push(ignore);\n }\n }\n\n if debug {\n println!(\">>> All ignores: {:?}\", list);\n }\n\n builder.ignores(list);\n}\n\npub fn set_debounce(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n let d = if matches.is_present(\"delay\") {\n let debounce = value_t!(matches, \"delay\", f32).unwrap_or_else(|e| e.exit());\n if debug {\n println!(\">>> File updates debounce: {} seconds\", debounce);\n }\n (debounce * 1000.0) as u32\n } else {\n 500\n };\n\n builder.poll_interval(d).debounce(d);\n}\n\npub fn set_watches(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {\n let mut opts = Vec::new();\n if matches.is_present(\"watch\") {\n for watch in values_t!(matches, \"watch\", String).unwrap_or_else(|e| e.exit()) {\n opts.push(watch.into());\n }\n }\n\n if opts.is_empty() {\n opts.push(\".\".into());\n }\n\n if debug {\n println!(\">>> Watches: {:?}\", opts);\n }\n\n builder.paths(opts);\n}\n\npub fn get_options(debug: bool, matches: &ArgMatches) -> Args {\n let mut builder = ArgsBuilder::default();\n builder\n .restart(!matches.is_present(\"no-restart\"))\n .poll(matches.is_present(\"poll\"))\n .clear_screen(matches.is_present(\"clear\"))\n .debug(debug)\n .run_initially(!matches.is_present(\"postpone\"));\n\n set_ignores(debug, &mut builder, &matches);\n set_debounce(debug, &mut builder, &matches);\n set_watches(debug, &mut builder, &matches);\n set_commands(debug, &mut builder, &matches);\n\n let mut args = builder.build().unwrap();\n args.once = matches.is_present(\"once\");\n\n if debug {\n println!(\">>> Watchexec arguments: {:?}\", args);\n }\n\n args\n}\n"},"middle":{"kind":"string","value":"pub fn change_dir() {\n cargo::root()\n .and_then(|p| set_current_dir(p).ok())\n .unwrap_or_else(|| {\n Error::with_description(\"Not a Cargo project, aborting.\", ErrorKind::Io).exit();\n });\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"fn main() -> watchexec::error::Result<()> {\n\n let matches = cargo_watch::args::parse();\n\n\n\n cargo_watch::change_dir();\n\n\n\n let quiet = matches.is_present(\"quiet\");\n\n let debug = matches.is_present(\"debug\");\n\n let opts = cargo_watch::get_options(debug, &matches);\n\n let handler = cargo_watch::watch::CwHandler::new(opts, quiet)?;\n\n watchexec::run::watch(&handler)\n\n}\n","file_path":"src/main.rs","rank":0,"score":75551.95326953352},{"content":"pub fn parse() -> ArgMatches<'static> {\n\n let footnote = \"Cargo commands (-x) are always executed before shell commands (-s).\\n\\nBy default, your entire project is watched, except for the target/ and .git/ folders, and your .gitignore files are used to filter paths.\".to_owned();\n\n\n\n #[cfg(windows)] let footnote = format!(\"{}\\n\\nOn Windows, patterns given to -i have forward slashes (/) automatically converted to backward ones (\\\\) to ease command portability.\", footnote);\n\n\n\n let mut app = App::new(env!(\"CARGO_PKG_NAME\"))\n\n .bin_name(\"cargo\")\n\n .version(env!(\"CARGO_PKG_VERSION\"))\n\n .help_message(\"\")\n\n .version_message(\"\")\n\n .setting(AppSettings::ArgsNegateSubcommands)\n\n .setting(AppSettings::DisableHelpSubcommand)\n\n .setting(AppSettings::DontCollapseArgsInUsage)\n\n .setting(AppSettings::GlobalVersion)\n\n .setting(AppSettings::StrictUtf8)\n\n .setting(AppSettings::SubcommandRequired)\n\n .setting(AppSettings::SubcommandRequiredElseHelp)\n\n .subcommand(\n\n SubCommand::with_name(\"watch\")\n\n .author(env!(\"CARGO_PKG_HOMEPAGE\"))\n","file_path":"src/args.rs","rank":2,"score":62194.80342345011},{"content":"/// Returns the closest ancestor path containing a `Cargo.toml`.\n\n///\n\n/// Returns `None` if no ancestor path contains a `Cargo.toml`, or if\n\n/// the limit of `MAX_ANCESTORS` ancestors has been reached.\n\n///\n\n/// TODO: #52 Parse toml to get to workspace root\n\npub fn root() -> Option<PathBuf> {\n\n /// Checks if the directory contains `Cargo.toml`\n\n fn contains_manifest(path: &PathBuf) -> bool {\n\n fs::read_dir(path)\n\n .map(|entries| {\n\n entries\n\n .filter_map(Result::ok)\n\n .any(|ent| &ent.file_name() == \"Cargo.toml\")\n\n })\n\n .unwrap_or(false)\n\n }\n\n\n\n // From the current directory we work our way up, looking for `Cargo.toml`\n\n env::current_dir().ok().and_then(|mut wd| {\n\n for _ in 0..MAX_ANCESTORS {\n\n if contains_manifest(&wd) {\n\n return Some(wd);\n\n }\n\n if !wd.pop() {\n\n break;\n\n }\n\n }\n\n\n\n None\n\n })\n\n}\n","file_path":"src/cargo.rs","rank":4,"score":54124.23447199364},{"content":"### RLS is slow while using cargo watch, or vice versa, or it's waiting for the project lock a lot\n\n\n\nCargo builds (and checks, and clippy, and tests because the tests have to be\n\nbuilt) take out a lock on the project so two cargo instances don't run at the\n\nsame time. That may include language servers like RLS (and possibly RA)! So\n\nyour editor might be fighting with cargo watch for the lock when you save.\n\n\n\nThere's not really a way around this. Either stop using cargo watch, or stop\n\nusing RLS/RA, or accept that whenever you save there may be some slowdown for a\n\nlittle while. While I'm investigating ways to make this less of an issue,\n\nthere's not going to be a quick fix anytime soon.\n\n\n\n### On Windows 7 (or lower): \"failed to add to job object: Access denied (OS Error 5)\"\n\n\n\nCargo Watch versions 5.0.0 and up (and watchexec versions 1.3.0 and up) [do not\n\nsupport Windows 7 or lower][i-69]. There are no plans at the moment to add such\n\nsupport.\n\n\n\nYou can downgrade to the last version which did support Windows 7 (and lower),\n\nbut do keep in mind that many bug fixes and features are missing there:\n\n\n\n```\n\n$ cargo install --force --vers 4.0.3 cargo-watch\n\n```\n\n\n\n[i-69]: https://github.com/passcod/cargo-watch/issues/69\n\n\n\n### If running cargo watch errors with \"Found argument 'build' which wasn't expected\" (or similar)\n\n\n\nYou're probably using **version 4** (or higher) but using the **version 3** (or\n\nlower) style of arguments. The interface changed! Refer to the sections above\n\nfor new usage guidelines, or to the help message:\n\n\n\n```\n\n$ cargo watch --help\n\n```\n\n\n\n### I want to run cargo-watch directly, without going through cargo\n\n\n\nYou can! But you'll have to specify the `watch` subcommand as the first\n\nargument, like so:\n\n\n\n```\n\n$ /path/to/cargo-watch watch -x build\n\n```\n\n\n\n### I want to run cargo-watch outside of a Cargo project\n\n\n\nThat's not supported. If you have a good reason to use a Cargo-specific tool\n\noutside a Cargo project, please open an issue! Otherwise, you'll probably be\n\nbest served with using [Watchexec].\n\n\n","file_path":"README.md","rank":9,"score":32793.71443789474},{"content":"# $ cargo watch\n\n\n\n[](https://crates.io/crates/cargo-watch)\n\n[](https://creativecommons.org/publicdomain/zero/1.0/)\n\n[](https://crates.io/crates/cargo-watch)\n\n[](https://travis-ci.org/passcod/cargo-watch)\n\n\n\nCargo Watch watches over your project's source for changes, and runs Cargo\n\ncommands when they occur.\n\n\n\nIf you've used [nodemon], [gulp], [guard], [watchman], or similar others,\n\nit will probably feel familiar.\n\n\n\n[nodemon]: http://nodemon.io/\n\n[gulp]: http://gulpjs.com/\n\n[guard]: http://guardgem.org/\n\n[watchman]: https://facebook.github.io/watchman/\n\n\n\n## Install\n\n\n\nPre-built binaries are available [on the Github Releases tab](https://github.com/passcod/cargo-watch/releases).\n\n\n\n```\n\n$ cargo install cargo-watch\n\n```\n\n\n\nTo upgrade:\n\n\n\n```\n\n$ cargo install --force cargo-watch\n\n```\n\n\n\nOr clone and build with `$ cargo build` then place in your $PATH.\n\n\n\n## Usage\n\n\n\nBy default, it runs `check` (which is available [since Rust 1.16][st-check]).\n\nYou can easily override this, though:\n\n\n\n```\n\n$ cargo watch [-x command]...\n\n```\n\n\n\n[st-check]: https://blog.rust-lang.org/2017/03/16/Rust-1.16.html\n\n\n\nA few examples:\n\n\n\n```\n\n# Run tests only\n\n$ cargo watch -x test\n\n\n\n# Run check then tests\n\n$ cargo watch -x check -x test\n\n\n\n# Run run with arguments\n\n$ cargo watch -x 'run -- --some-arg'\n\n\n","file_path":"README.md","rank":10,"score":32793.288016506194},{"content":"### Something not covered above / I have a feature request\n\n\n\nPlease [open an issue][watch-issues], or look through the existing ones. You\n\nmay also want to look through [issues for the Notify library][notify-issues]\n\nthis tool depends on, or the [issues for the Watchexec tool][watchexec-issues]\n\nthat we use under the covers.\n\n\n\nIf you want more verbose output, try running with the `--debug` flag. Note that\n\nthis will also enable debug mode for watchexec. When filing an issue, **make\n\nsure to include a log with `--debug` enabled so problems can be diagnosed.**\n\n\n\n[notify-issues]: https://github.com/passcod/notify/issues\n\n[watch-issues]: https://github.com/passcod/cargo-watch/issues\n\n[watchexec-issues]: https://github.com/mattgreen/watchexec/issues\n\n\n\n### I want to embed Cargo Watch in my own (Rust) tool\n\n\n\nYou cannot do that directly. You may of course call `cargo-watch` as any other\n\nprogram, but if you want to directly / statically embed it, that's not\n\npossible. But! Cargo Watch is built on top of [Watchexec], Watchexec is itself\n\nbuilt on [Notify], and both of these can be used as Rust libraries.\n\n\n\n- If you want to build a tool that runs, restarts, and otherwise manages\n\n commands in response to file changes, you'll most probably want to use\n\n **Watchexec**.\n\n\n\n- If you want to build a tool that responds to file changes, but does not need\n\n to run commands, or does so in a way that is not well-supported by Watchexec,\n\n then **Notify** is your ticket.\n\n\n\n[Notify]: https://github.com/passcod/notify\n\n[Watchexec]: https://github.com/mattgreen/watchexec\n\n\n\n### Wait, is this just a wrapper on top of watchexec?\n\n\n\nIt is! [Watchexec] does a really good job of watching files and running commands\n\nand all the details that go with this. Cargo watch simply embeds watchexec and\n\ncalls it with its own custom options and defaults, so you can just run\n\n`cargo-watch` in your project and be in business.\n\n\n\n## About\n\n\n\nCreated by [Félix Saparelli][passcod] and [awesome contributors][contributors].\n\n\n\n[contributors]: https://github.com/passcod/cargo-watch/network/members\n\n[passcod]: https://passcod.name\n","file_path":"README.md","rank":11,"score":32792.33271444406},{"content":"### Ignore syntax\n\n\n\nSee the [`glob::Pattern` docs][glob::Pattern] for a more detailed\n\nspecification of the glob matching syntax used for `--ignore`.\n\n\n\nOn Windows, patterns should be specified with Windows-style (`\\\\`) separators.\n\nUnix-style separators (`/`) would not match Windows paths, which could be\n\nconfusing and give the appearance of commandline ignores not working.\n\n\n\nFrom Cargo Watch 7.0.0, `/` in commandline ignores are automatically translated\n\nto `\\\\` when running on Windows, but one should still try to write the correct\n\npatterns for the platform, as there may be more subtle differences.\n\n\n\n[glob::Pattern]: https://doc.rust-lang.org/glob/glob/struct.Pattern.html\n\n\n\n### Reloading servers seamlessly\n\n\n\nCargo Watch pairs very well with [Catflap], a tool for Unixy platforms that\n\nlets one spawn a socket before the watcher runs that Rust servers can then bind\n\nto, avoiding request-dropping and the infamous ADDRINUSE error. For example:\n\n\n\n```\n\n$ catflap -- cargo watch -x run\n\n```\n\n\n\n[Catflap]: https://github.com/passcod/catflap\n\n\n\nOf course, if you don't need to guard against these issues or don't want to\n\nmodify your program to grab sockets instead of ports, you can use Cargo Watch\n\nas-is: it will happily just restart your server normally.\n\n\n","file_path":"README.md","rank":12,"score":32789.983120353536},{"content":"# Run an arbitrary command\n\n$ cargo watch -s 'echo Hello world'\n\n```\n\n\n\nThere's a lot more you can do! Here's a copy of the help:\n\n\n\n```\n\nUSAGE:\n\n cargo watch [FLAGS] [OPTIONS]\n\n\n\nFLAGS:\n\n -c, --clear Clear the screen before each run\n\n --debug Display debug output\n\n -h, --help Display this message\n\n --ignore-nothing Ignore nothing, not even target/ and .git/\n\n --no-gitignore Don’t use .gitignore files\n\n --no-restart Don’t restart command while it’s still running\n\n --poll Force use of polling for file changes\n\n --postpone Postpone first run until a file changes\n\n -q, --quiet Suppress output from cargo-watch itself\n\n -V, --version Display version information\n\n\n\nOPTIONS:\n\n -x, --exec <cmd>...\n\n Cargo command(s) to execute on changes [default: check]\n\n -s, --shell <cmd>...\n\n Shell command(s) to execute on changes\n\n -d, --delay <delay>\n\n File updates debounce delay in seconds [default: 0.5]\n\n -i, --ignore <pattern>...\n\n Ignore a glob/gitignore-style pattern\n\n -w, --watch <watch>...\n\n Watch specific file(s) or folder(s) [default: .]\n\n\n\nCargo commands (-x) are always executed before shell commands (-s).\n\n\n\nBy default, your entire project is watched, except for the target/\n\nand .git/ folders, and your .gitignore files are used to filter paths.\n\n```\n\n\n","file_path":"README.md","rank":13,"score":32789.524519034916},{"content":"### If file updates seems to never trigger\n\n\n\nTry using `--poll` to force the polling fallback.\n\n\n\nIf that still doesn't work, and you're using an editor that does \"safe saving\",\n\nlike IntelliJ / PyCharm, you may have to disable \"safe saving\" as that may\n\nprevent file notifications from being generated properly.\n\n\n\n### Linux: If it fails to watch some deep directories but not others / \"No space left on device\"\n\n\n\nYou may have hit the inotify watch limit. [Here's a summary of what this means\n\nand how to increase it.][inotify limit]\n\n\n\n[inotify limit]: https://blog.passcod.name/2017/jun/25/inotify-watch-limit\n\n\n\n### If you want to only recompile one Cargo workspace\n\n\n\nCargo workspaces [are not natively supported yet][i-52].\n\n\n\nHowever, as you can run \"arbitrary commands\" with the `-s` option, you can\n\nwrite workspace-aware commands manually.\n\n\n\n[i-52]: https://github.com/passcod/cargo-watch/issues/52\n\n\n\n### If it runs repeatedly without touching anything\n\n\n\nThat can happen when watching files that are modified by the command you're\n\nrunning.\n\n\n\nIf you're only running compiles or checks (i.e. any command that only affects\n\nthe target/ folder) and you're using `-w`, you might be confusing the\n\ntarget-folder-ignorer. Check your options and paths.\n\n\n\n### If it runs repeatedly only touching ignored files\n\n\n\nMake sure the files you ignored are the only ones being touched. Use the\n\n`--debug` option to see exactly which files were modified and triggered the\n\nrestart (or were ignored). Some programs and libraries create temporary files\n\nthat may not match a simple ignore pattern.\n\n\n\n### I don't have colour in my cargo output / for cargo test\n\n\n\nThis sometimes happens on some terminal configurations. A quick workaround\n\n(instead of going down the rabbit hole of debugging your console settings) is\n\nto pass `--color=always` to the command. E.g.\n\n\n\n```\n\n$ cargo watch -x 'check --color=always'\n\n```\n\n\n\nFor test (and bench) commands, you'll need to pass the flag to the underlying\n\nprogram instead of cargo:\n\n\n\n```\n\n$ cargo watch -x 'test -- --color=always'\n\n```\n\n\n","file_path":"README.md","rank":14,"score":32789.1966614176},{"content":"### Restarting an application only if the build/check succeeds\n\n\n\n[Brought up by @LeDominik](https://github.com/passcod/cargo-watch/issues/75),\n\nhere's a pattern that may be very useful: you're working on a server or app,\n\nbut want it to keep running while you're writing a new feature or fixing a bug,\n\npotentially causing the code not to compile anymore in the meantime.\n\n\n\nIn this case, you can use this strategy: run a first `cargo watch` with check,\n\nbuild, test, or whatever you want, and append `-s 'touch .trigger` (or equivalent\n\nfor your platform). Then, run a second `cargo watch` simultaneously that _only_\n\nwatches that `.trigger` file. For example:\n\n\n\n```\n\n$ cargo watch -x check -s 'touch .trigger'\n\n```\n\n\n\nand\n\n\n\n```\n\n$ cargo watch --no-gitignore -w .trigger -x run\n\n```\n\n\n\nThe `--no-gitignore` flag ensures that you can safely add `.trigger` to your\n\n`.gitignore` file to avoid mistakenly committing it.\n\n\n\n## Contributing\n\n\n\nThe Cargo Watch team enthusiastically welcomes contributions and project\n\nparticipation! There's a bunch of things you can do if you want to contribute!\n\nThe [Contributor Guide](./CONTRIBUTING.md) has all the information you need for\n\neverything from reporting bugs to contributing entire new features. Please\n\ndon't hesitate to jump in if you'd like to, or even ask us questions if\n\nsomething isn't clear. <sub>{[attribution](https://github.com/zkat/pacote#contributing)}</sub>\n\n\n\nYou can also contribute financially with [Patreon] or [GitHub Sponsorship].\n\n\n\n[Patreon]: https://www.patreon.com/passcod\n\n[GitHub Sponsors]: https://github.com/users/passcod/sponsorship\n\n\n\n## Troubleshooting\n\n\n\nIn all cases, start by checking your version with `cargo watch --version` and,\n\nif necessary, upgrading to [the latest one][releases].\n\n\n\n[releases]: https://github.com/passcod/cargo-watch/releases\n\n\n","file_path":"README.md","rank":15,"score":32788.99377123207},{"content":"## Request Support\n\n\n\nIf you have a question about this project, how to use it, or just need clarification about something:\n\n\n\n* Open an Issue at https://github.com/passcod/cargo-watch/issues\n\n* Provide as much context as you can about what you're running into.\n\n* Provide project and platform versions (rustc, cargo, etc), depending on what seems relevant. If not, please be ready to provide that information if maintainers ask for it.\n\n\n\nOnce it's filed:\n\n\n\n* The project team will [label the issue](#label-issues).\n\n* Someone will try to have a response soon.\n\n* If you or the maintainers don't respond to an issue for 30 days, the [issue will be closed](#clean-up-issues-and-prs). If you want to come back to it, reply (once, please), and we'll reopen the existing issue. Please avoid filing new issues as extensions of one you already made.\n\n\n\n## Report an Error or Bug\n\n\n\nIf you run into an error or bug with the project:\n\n\n\n* Open an Issue at https://github.com/passcod/cargo-watch/issues\n\n* Include *reproduction steps* that someone else can follow to recreate the bug or error on their own.\n\n* Include a log by running the same command with `--debug` enabled.\n\n* Provide project and platform versions (rustc, cargo, etc), depending on what seems relevant. If not, please be ready to provide that information if maintainers ask for it.\n\n\n\nOnce it's filed:\n\n\n\n* The project team will [label the issue](#label-issues).\n\n* A team member will try to reproduce the issue with your provided steps. If there are no repro steps or no obvious way to reproduce the issue, the team will ask you for those steps and mark the issue as `needs-repro`. Bugs with the `needs-repro` tag will not be addressed until they are reproduced.\n\n* If the team is able to reproduce the issue, it will be marked `needs-fix`, as well as possibly other tags (such as `critical`), and the issue will be left to be [implemented by someone](#contribute-code).\n\n* If you don't respond to an issue for 30 days, the [issue will be closed](#clean-up-issues-and-prs). If you want to come back to it, reply (once, please), and we'll reopen the existing issue. Please avoid filing new issues as extensions of one you already made.\n\n* `critical` issues may be left open, depending on perceived immediacy and severity, even past the 30 day deadline.\n\n\n","file_path":"CONTRIBUTING.md","rank":16,"score":32788.05276807255},{"content":"## Request a Feature\n\n\n\nIf the project doesn't do something you need or want it to do:\n\n\n\n* Open an Issue at https://github.com/passcod/cargo-watch/issues\n\n* Provide as much context as you can about what you're running into.\n\n* Please try and be clear about why existing features and alternatives would not work for you.\n\n\n\nOnce it's filed:\n\n\n\n* The project team will [label the issue](#label-issues).\n\n* The project team will evaluate the feature request, possibly asking you more questions to understand its purpose and any relevant requirements. If the issue is closed, the team will convey their reasoning and suggest an alternative path forward.\n\n* If the feature request is accepted, it will be marked for implementation with `feature-accepted`, which can then be done by either by a core team member or by anyone in the community who wants to [contribute code](#contribute-code).\n\n\n\nNote: The team is unlikely to be able to accept every single feature request that is filed. Please understand if they need to say no.\n\n\n\n## Project Setup\n\n\n\nSo you wanna contribute some code! That's great! This project uses GitHub Pull Requests to manage contributions, so [read up on how to fork a GitHub project and file a PR](https://guides.github.com/activities/forking) if you've never done it before.\n\n\n\nIf this seems like a lot or you aren't able to do all this setup, you might also be able to [edit the files directly](https://help.github.com/articles/editing-files-in-another-user-s-repository/) without having to do any of this setup. Yes, [even code](#contribute-code).\n\n\n\nIf you want to go the usual route and run the project locally, though:\n\n\n\n* [Install Rust](https://www.rustup.rs/)\n\n* [Fork the project](https://guides.github.com/activities/forking/#fork)\n\n\n\nThen in your terminal:\n\n* `cd path/to/your/clone`\n\n* `cargo build`\n\n* `cargo run -- watch`\n\n\n\nAnd you should be ready to go!\n\n\n","file_path":"CONTRIBUTING.md","rank":17,"score":32786.325732312},{"content":"## Contribute Code\n\n\n\nWe like code commits a lot! They're super handy, and they keep the project going and doing the work it needs to do to be useful to others.\n\n\n\nCode contributions of just about any size are acceptable!\n\n\n\nTo contribute code:\n\n\n\n* [Set up the project](#project-setup).\n\n* Make any necessary changes to the source code.\n\n* Include any [additional documentation](#contribute-documentation) the changes might need.\n\n* Write clear, concise commit message(s).\n\n* Dependency updates, additions, or removals must be in individual commits.\n\n* Go to https://github.com/passcod/cargo-watch/pulls and open a new pull request with your changes.\n\n* If your PR is connected to an open issue, add a line in your PR's description that says `Fixes: #123`, where `#123` is the number of the issue you're fixing.\n\n\n\nOnce you've filed the PR:\n\n\n\n* Barring special circumstances, maintainers will not review PRs until all checks pass (Travis, AppVeyor, etc).\n\n* One or more maintainers will use GitHub's review feature to review your PR.\n\n* If the maintainer asks for any changes, edit your changes, push, and ask for another review. Additional tags (such as `needs-docs`) will be added depending on the review.\n\n* If the maintainer decides to pass on your PR, they will thank you for the contribution and explain why they won't be accepting the changes. That's ok! We still really appreciate you taking the time to do it, and we don't take that lightly. 💚\n\n* If your PR gets accepted, it will be marked as such, and merged into the `latest` branch soon after. Your contribution will be distributed to the masses next time the maintainers [tag a release](#tag-a-release)\n\n\n","file_path":"CONTRIBUTING.md","rank":18,"score":32785.69153589085},{"content":"## Tag A Release\n\n\n\n[Needs Collaborator](#join-the-project-team): Maintainer\n\n\n\nTo tag a release:\n\n\n\n1. Make sure everything works and there are no compile warnings.\n\n2. Read over the README.md to make sure it is updated for this new version.\n\n3. Checkout the `master` branch, and `git pull` all changes.\n\n4. If you have some changes pending to be committed, do this now.\n\n5. Change the version number in the Cargo.toml.\n\n6. Run `cargo update` to update the Cargo.lock.\n\n7. Commit both of these with the message `1.2.3` (where that is the new version number).\n\n8. Tag the commit with `v1.2.3`.\n\n9. Push the commit and the tag: `git push --follow-tags`.\n\n10. Publish the crate: `cargo publish`.\n\n\n\nYou may chime into issues or PRs that were resolved by this release to let\n\npeople involved that the fix or feature is out, now.\n\n\n\nYou may also want to tweet about the release, and/or announce it on\n\n[Reddit](https://reddit.com/r/rust).\n\n\n\n## Join the Project Team\n\n\n\n### Ways to Join\n\n\n\nThere are many ways to contribute! Most of them don't require any official status unless otherwise noted. That said, there's a couple of positions that grant special repository abilities, and this section describes how they're granted and what they do.\n\n\n\nAll of the below positions are granted based on the project team's needs, as well as their consensus opinion about whether they would like to work with the person and think that they would fit well into that position. The process is relatively informal, and it's likely that people who express interest in participating can just be granted the permissions they'd like.\n\n\n","file_path":"CONTRIBUTING.md","rank":19,"score":32785.474101386644},{"content":"## Contribute Documentation\n\n\n\nDocumentation contributions of any size are welcome! Feel free to file a PR even if you're just rewording a sentence to be more clear, or fixing a spelling mistake!\n\n\n\nTo contribute documentation:\n\n\n\n* [Set up the project](#project-setup).\n\n* Edit or add any relevant documentation.\n\n* Make sure your changes are formatted correctly and consistently with the rest of the documentation.\n\n* Re-read what you wrote, and run a spellchecker on it to make sure you didn't miss anything.\n\n* Write clear, concise commit message(s).\n\n* Go to https://github.com/passcod/cargo-watch/pulls and open a new pull request with your changes.\n\n* If your PR is connected to an open issue, add a line in your PR's description that says `Fixes: #123`, where `#123` is the number of the issue you're fixing.\n\n\n\nOnce you've filed the PR:\n\n\n\n* One or more maintainers will use GitHub's review feature to review your PR.\n\n* If the maintainer asks for any changes, edit your changes, push, and ask for another review.\n\n* If the maintainer decides to pass on your PR, they will thank you for the contribution and explain why they won't be accepting the changes. That's ok! We still really appreciate you taking the time to do it, and we don't take that lightly. 💚\n\n* If your PR gets accepted, it will be marked as such, and merged into the `latest` branch soon after. Your contribution will be distributed to the masses next time the maintainers [tag a release](#tag-a-release)\n\n\n","file_path":"CONTRIBUTING.md","rank":20,"score":32785.419467195},{"content":"# Contributing\n\n\n\n## How do I... <a name=\"toc\"></a>\n\n\n\n* [Use This Guide](#introduction)?\n\n* Ask or Say Something? 🤔🐛😱\n\n * [Request Support](#request-support)\n\n * [Report an Error or Bug](#report-an-error-or-bug)\n\n * [Request a Feature](#request-a-feature)\n\n* Make Something? 🤓👩🏽💻📜🍳\n\n * [Project Setup](#project-setup)\n\n * [Contribute Documentation](#contribute-documentation)\n\n * [Contribute Code](#contribute-code)\n\n* Manage Something ✅🙆🏼💃👔\n\n * [Provide Support on Issues](#provide-support-on-issues)\n\n * [Label Issues](#label-issues)\n\n * [Clean Up Issues and PRs](#clean-up-issues-and-prs)\n\n * [Review Pull Requests](#review-pull-requests)\n\n * [Merge Pull Requests](#merge-pull-requests)\n\n * [Tag a Release](#tag-a-release)\n\n * [Join the Project Team](#join-the-project-team)\n\n* Add a Guide Like This One [To My Project](#attribution)? 🤖😻👻\n\n\n\n## Introduction\n\n\n\nThank you so much for your interest in contributing!. All types of contributions are encouraged and valued. See the [table of contents](#toc) for different ways to help and details about how this project handles them!📝\n\n\n\nPlease make sure to read the relevant section before making your contribution! It will make it a lot easier for us maintainers to make the most of it and smooth out the experience for all involved. 💚\n\n\n\nThe [Project Team](#join-the-project-team) looks forward to your contributions. 🙌🏾✨\n\n\n","file_path":"CONTRIBUTING.md","rank":21,"score":32785.16504660375},{"content":"## Label Issues\n\n\n\n[Needs Collaborator](#join-the-project-team): Issue Tracker\n\n\n\nOne of the most important tasks in handling issues is labeling them usefully and accurately. All other tasks involving issues ultimately rely on the issue being classified in such a way that relevant parties looking to do their own tasks can find them quickly and easily.\n\n\n\nIn order to label issues, [open up the list of unlabeled issues](https://github.com/passcod/cargo-watch/issues?q=is%3Aopen+is%3Aissue+no%3Alabel) and, **from newest to oldest**, read through each one and apply issue labels according to the table below. If you're unsure about what label to apply, skip the issue and try the next one: don't feel obligated to label each and every issue yourself!\n\n\n\nLabel | Apply When | Notes\n\n--- | --- | ---\n\n`bug` | Cases where the code (or documentation) is behaving in a way it wasn't intended to. | If something is happening that surprises the *user* but does not go against the way the code is designed, it should use the `enhancement` label.\n\n`critical` | Added to `bug` issues if the problem described makes the code completely unusable in a common situation. |\n\n`documentation` | Added to issues or pull requests that affect any of the documentation for the project. | Can be combined with other labels, such as `bug` or `enhancement`.\n\n`duplicate` | Added to issues or PRs that refer to the exact same issue as another one that's been previously labeled. | Duplicate issues should be marked and closed right away, with a message referencing the issue it's a duplicate of (with `#123`)\n\n`enhancement` | Added to [feature requests](#request-a-feature), PRs, or documentation issues that are purely additive: the code or docs currently work as expected, but a change is being requested or suggested. |\n\n`help wanted` | Applied by [Committers](#join-the-project-team) to issues and PRs that they would like to get outside help for. Generally, this means it's lower priority for the maintainer team to itself implement, but that the community is encouraged to pick up if they so desire | Never applied on first-pass labeling.\n\n`in-progress` | Applied by [Committers](#join-the-project-team) to PRs that are pending some work before they're ready for review. | The original PR submitter should @mention the team member that applied the label once the PR is complete.\n\n`performance` | This issue or PR is directly related to improving performance. |\n\n`refactor` | Added to issues or PRs that deal with cleaning up or modifying the project for the betterment of it. |\n\n`starter` | Applied by [Committers](#join-the-project-team) to issues that they consider good introductions to the project for people who have not contributed before. These are not necessarily \"easy\", but rather focused around how much context is necessary in order to understand what needs to be done for this project in particular. | Existing project members are expected to stay away from these unless they increase in priority.\n\n`support` | This issue is either asking a question about how to use the project, clarifying the reason for unexpected behavior, or possibly reporting a `bug` but does not have enough detail yet to determine whether it would count as such. | The label should be switched to `bug` if reliable reproduction steps are provided. Issues primarily with unintended configurations of a user's environment are not considered bugs, even if they cause crashes.\n\n`wontfix` | Labelers may apply this label to issues that clearly have nothing at all to do with the project or are otherwise entirely outside of its scope/sphere of influence. [Committers](#join-the-project-team) may apply this label and close an issue or PR if they decide to pass on an otherwise relevant issue. | The issue or PR should be closed as soon as the label is applied, and a clear explanation provided of why the label was used. Contributors are free to contest the labeling, but the decision ultimately falls on committers as to whether to accept something or not.\n\n\n","file_path":"CONTRIBUTING.md","rank":22,"score":32784.77634356301},{"content":"## Clean Up Issues and PRs\n\n\n\n[Needs Collaborator](#join-the-project-team): Issue Tracker\n\n\n\nIssues and PRs can go stale after a while. Maybe they're abandoned. Maybe the team will just plain not have time to address them any time soon.\n\n\n\nIn these cases, they should be closed until they're brought up again or the interaction starts over.\n\n\n\nTo clean up issues and PRs:\n\n\n\n* Search the issue tracker for issues or PRs, and add the term `updated:<=YYYY-MM-DD`, where the date is 30 days before today.\n\n* Go through each issue *from oldest to newest*, and close them if **all of the following are true**:\n\n * not opened by a maintainer\n\n * not marked as `critical`\n\n * not marked as `starter` or `help wanted` (these might stick around for a while, in general, as they're intended to be available)\n\n * no explicit messages in the comments asking for it to be left open\n\n * does not belong to a milestone\n\n* Leave a message when closing saying \"Cleaning up stale issue. Please reopen or ping us if and when you're ready to resume this. See https://github.com/passcod/cargo-watch/blob/latest/CONTRIBUTING.md#clean-up-issues-and-prs for more details.\"\n\n\n","file_path":"CONTRIBUTING.md","rank":23,"score":32784.610448783686},{"content":"## Attribution\n\n\n\nThis guide was generated using the WeAllJS `CONTRIBUTING.md` generator. [Make your own](https://npm.im/weallcontribute)!\n","file_path":"CONTRIBUTING.md","rank":24,"score":32784.38824153427},{"content":"## Provide Support on Issues\n\n\n\n[Needs Collaborator](#join-the-project-team): none\n\n\n\nHelping out other users with their questions is a really awesome way of contributing to any community. It's not uncommon for most of the issues on an open source projects being support-related questions by users trying to understand something they ran into, or find their way around a known bug.\n\n\n\nSometimes, the `support` label will be added to things that turn out to actually be other things, like bugs or feature requests. In that case, suss out the details with the person who filed the original issue, add a comment explaining what the bug is, and change the label from `support` to `bug` or `feature`. If you can't do this yourself, @mention a maintainer so they can do it.\n\n\n\nIn order to help other folks out with their questions:\n\n\n\n* Go to the issue tracker and [filter open issues by the `support` label](https://github.com/passcod/cargo-watch/issues?q=is%3Aopen+is%3Aissue+label%3Asupport).\n\n* Read through the list until you find something that you're familiar enough with to give an answer to.\n\n* Respond to the issue with whatever details are needed to clarify the question, or get more details about what's going on.\n\n* Once the discussion wraps up and things are clarified, either close the issue, or ask the original issue filer (or a maintainer) to close it for you.\n\n\n\nSome notes on picking up support issues:\n\n\n\n* Avoid responding to issues you don't know you can answer accurately.\n\n* As much as possible, try to refer to past issues with accepted answers. Link to them from your replies with the `#123` format.\n\n* Be kind and patient with users -- often, folks who have run into confusing things might be upset or impatient. This is ok. Try to understand where they're coming from, and if you're too uncomfortable with the tone, feel free to stay away or withdraw from the issue. (note: if the user is outright hostile or is violating the CoC, [refer to the Code of Conduct](CODE_OF_CONDUCT.md) to resolve the conflict).\n\n\n","file_path":"CONTRIBUTING.md","rank":25,"score":32783.95201803785},{"content":"You can spot a collaborator on the repo by looking for the `[Collaborator]` or `[Owner]` tags next to their names.\n\n\n\nPermission | Description\n\n--- | ---\n\nIssue Tracker | Granted to contributors who express a strong interest in spending time on the project's issue tracker. These tasks are mainly [labeling issues](#label-issues), [cleaning up old ones](#clean-up-issues-and-prs), and [reviewing pull requests](#review-pull-requests), as well as all the usual things non-team-member contributors can do. Issue handlers should not merge pull requests, tag releases, or directly commit code themselves: that should still be done through the usual pull request process. Becoming an Issue Handler means the project team trusts you to understand enough of the team's process and context to implement it on the issue tracker.\n\nCommitter | Granted to contributors who want to handle the actual pull request merges, etc. Committers should have a good level of familiarity with the codebase, and enough context to understand the implications of various changes, as well as a good sense of the will and expectations of the project team.\n\nMaintainer | Very similar to Committer but with the added privilege of being able to tag new releases and publish to https://crates.io/.\n\nAdmin/Owner | Granted to people ultimately responsible for the project, its community, etc.\n\n\n","file_path":"CONTRIBUTING.md","rank":26,"score":32783.4126981656},{"content":"## Review Pull Requests\n\n\n\n[Needs Collaborator](#join-the-project-team): Issue Tracker\n\n\n\nWhile anyone can comment on a PR, add feedback, etc, PRs are only *approved* by team members with Issue Tracker or higher permissions.\n\n\n\nPR reviews use [GitHub's own review feature](https://help.github.com/articles/about-pull-request-reviews/), which manages comments, approval, and review iteration.\n\n\n\nSome notes:\n\n\n\n* You may ask for minor changes (\"nitpicks\"), but consider whether they are really blockers to merging: try to err on the side of \"approve, with comments\".\n\n* Please make sure you're familiar with the code or documentation being updated, unless it's a minor change (spellchecking, minor formatting, etc). You may @mention another project member who you think is better suited for the review, but still provide a non-approving review of your own.\n\n* Be extra kind: people who submit code/doc contributions are putting themselves in a pretty vulnerable position, and have put time and care into what they've done (even if that's not obvious to you!) -- always respond with respect, be understanding, but don't feel like you need to sacrifice your standards for their sake, either. Just don't be a jerk about it?\n\n\n\n## Merge Pull Requests\n\n\n\n[Needs Collaborator](#join-the-project-team): Committer\n\n\n\nTBD - need to hash out a bit more of this process.\n\n\n","file_path":"CONTRIBUTING.md","rank":27,"score":32783.15027578887},{"content":"### Further Enforcement\n\n\n\nIf you've already followed the [initial enforcement steps](#enforcement), these are the steps maintainers will take for further enforcement, as needed:\n\n\n\n 1. Repeat the request to stop.\n\n 2. If the person doubles down, they will have offending messages removed or edited by a maintainers given an official warning. The PR or Issue may be locked.\n\n 3. If the behavior continues or is repeated later, the person will be blocked from participating for 24 hours.\n\n 4. If the behavior continues or is repeated after the temporary block, a long-term (6-12mo) ban will be used.\n\n\n\nOn top of this, maintainers may remove any offending messages, images, contributions, etc, as they deem necessary.\n\n\n\nMaintainers reserve full rights to skip any of these steps, at their discretion, if the violation is considered to be a serious and/or immediate threat to the health and well-being of members of the community. These include any threats, serious physical or verbal attacks, and other such behavior that would be completely unacceptable in any social setting that puts our members at risk.\n\n\n\nMembers expelled from events or venues with any sort of paid attendance will not be refunded.\n\n\n\n### Who Watches the Watchers?\n\n\n\nMaintainers and other leaders who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership. These may include anything from removal from the maintainer team to a permanent ban from the community.\n\n\n\nAdditionally, as a project hosted on GitHub and part of the Rust community, [their own Codes of Conducts may be applied against maintainers of this project](#other-community-standards), externally of this project's procedures.\n\n\n\n### Enforcement Examples\n\n\n","file_path":"CODE_OF_CONDUCT.md","rank":28,"score":31883.534685339037},{"content":"#### The Best Case\n\n\n\nThe vast majority of situations work out like this. This interaction is common, and generally positive.\n\n\n\n> Alex: \"Yeah I used X and it was retarded!\"\n\n\n\n> Patt (not a maintainer): \"Hey, could you not use that word? What about 'ridiculous' instead?\"\n\n\n\n> Alex: \"oh sorry, sure.\" -> edits old comment to say \"it was really confusing!\"\n\n\n\n#### The Maintainer Case\n\n\n\nSometimes, though, you need to get maintainers involved. Maintainers will do their best to resolve conflicts, but people who were harmed by something **will take priority**.\n\n\n\n> Patt: \"Honestly, sometimes I just really hate using $library and anyone who uses it probably sucks at their job.\"\n\n\n\n> Alex: \"Whoa there, could you dial it back a bit? There's a CoC thing about attacking folks' tech use like that.\"\n\n\n\n> Patt: \"I'm not attacking anyone, what's your problem?\"\n\n\n\n> Alex: \"@maintainers hey uh. Can someone look at this issue? Patt is getting a bit aggro. I tried to nudge them about it, but nope.\"\n\n\n\n> KeeperOfCommitBits: (on issue) \"Hey Patt, maintainer here. Could you tone it down? This sort of attack is really not okay in this space.\"\n\n\n\n> Patt: \"Leave me alone I haven't said anything bad wtf is wrong with you.\"\n\n\n\n> KeeperOfCommitBits: (deletes user's comment), \"@patt I mean it. Please refer to the CoC over at (URL to this CoC) if you have questions, but you can consider this an actual warning. I'd appreciate it if you reworded your messages in this thread, since they made folks there uncomfortable. Let's try and be kind, yeah?\"\n\n\n\n> Patt: \"@keeperofbits Okay sorry. I'm just frustrated and I'm kinda burnt out and I guess I got carried away. I'll DM Alex a note apologizing and edit my messages. Sorry for the trouble.\"\n\n\n\n> KeeperOfCommitBits: \"@patt Thanks for that. I hear you on the stress. Burnout sucks :/. Have a good one!\"\n\n\n","file_path":"CODE_OF_CONDUCT.md","rank":29,"score":31882.389222305297},{"content":"## Our Standards\n\n\n\nExamples of behavior that contributes to creating a positive environment include:\n\n\n\n * Using welcoming and inclusive language.\n\n * Being respectful of differing viewpoints and experiences.\n\n * Gracefully accepting constructive feedback.\n\n * Focusing on what is best for the community.\n\n * Showing empathy and kindness towards other community members.\n\n * Encouraging and raising up your peers in the project so you can all bask in hacks and glory.\n\n\n\nExamples of unacceptable behavior by participants include:\n\n\n\n * The use of sexualized language or imagery and unwelcome sexual attention or advances, including when simulated online. The only exception to sexual topics is channels/spaces specifically for topics of sexual identity.\n\n * Trolling, insulting/derogatory comments, and personal or political attacks.\n\n * Public or private harassment, deliberate intimidation, or threats.\n\n * Publishing others' private information, such as a physical or electronic address, without explicit permission. This includes any sort of \"outing\" of any aspect of someone's identity without their consent.\n\n * Publishing private screenshots or quotes of interactions in the context of this project without all quoted users' *explicit* consent.\n\n * Publishing of private communication that doesn't have to do with reporting harrassment.\n\n * Any of the above even when [presented as \"ironic\" or \"joking\"](https://en.wikipedia.org/wiki/Hipster_racism).\n\n * Any attempt to present \"reverse-ism\" versions of the above as violations. Examples of reverse-isms are \"reverse racism\", \"reverse sexism\", \"heterophobia\", and \"cisphobia\".\n\n * Unsolicited explanations under the assumption that someone doesn't already know it. Ask before you teach! Don't assume what people's knowledge gaps are.\n\n * [Feigning or exaggerating surprise](https://www.recurse.com/manual#no-feigned-surprise) when someone admits to not knowing something.\n\n * \"[Well-actuallies](https://www.recurse.com/manual#no-well-actuallys)\"\n\n * Other conduct which could reasonably be considered inappropriate in a professional or community setting.\n\n\n","file_path":"CODE_OF_CONDUCT.md","rank":30,"score":31881.622338999852},{"content":"#### The Nope Case\n\n\n\n> PepeTheFrog🐸: \"Hi, I am a literal actual nazi and I think white supremacists are quite fashionable.\"\n\n\n\n> Patt: \"NOOOOPE. OH NOPE NOPE.\"\n\n\n\n> Alex: \"JFC NO. NOPE. @keeperofbits NOPE NOPE LOOK HERE\"\n\n\n\n> KeeperOfCommitBits: \"👀 Nope. NOPE NOPE NOPE. 🔥\"\n\n\n\n> PepeTheFrog🐸 has been banned from all organization or user repositories belonging to KeeperOfCommitBits.\n\n\n\n## Attribution\n\n\n\nThis Code of Conduct was generated (and then adapted) using [WeAllJS Code of Conduct Generator](https://npm.im/weallbehave), which is based on the [WeAllJS Code of\n\nConduct](https://wealljs.org/code-of-conduct), which is itself based on\n\n[Contributor Covenant](http://contributor-covenant.org), version 1.4, available\n\nat\n\n[http://contributor-covenant.org/version/1/4](http://contributor-covenant.org/version/1/4),\n\nand the LGBTQ in Technology Slack [Code of\n\nConduct](http://lgbtq.technology/coc.html).\n","file_path":"CODE_OF_CONDUCT.md","rank":31,"score":31881.506536373923},{"content":"# Code of Conduct\n\n\n\n## When Something Happens\n\n\n\nIf you see a Code of Conduct violation, follow these steps:\n\n\n\n1. Let the person know that what they did is not appropriate and ask them to stop and/or edit their message(s) or commits.\n\n2. That person should immediately stop the behavior and correct the issue.\n\n3. If this doesn’t happen, or if you're uncomfortable speaking up, [contact the maintainers](#contacting-maintainers).\n\n4. As soon as available, a maintainer will look into the issue, and take [further action (see below)](#further-enforcement), starting with a warning, then temporary block, then long-term repo or organization ban.\n\n\n\nWhen reporting, please include any relevant details, links, screenshots, context, or other information that may be used to better understand and resolve the situation.\n\n\n\n**The maintainer team will prioritize the well-being and comfort of the recipients of the violation over the comfort of the violator.** See [some examples below](#enforcement-examples).\n\n\n\n## Our Pledge\n\n\n\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers of this project pledge to making participation in our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, technical preferences, nationality, personal appearance, race, religion, or sexual identity and orientation.\n\n\n","file_path":"CODE_OF_CONDUCT.md","rank":32,"score":31881.34408844467},{"content":"## Scope\n\n\n\nThis Code of Conduct applies both within spaces involving this project and in other spaces involving community members. This includes the repository, its Pull Requests and Issue tracker, its Twitter community, private email communications in the context of the project, and any events where members of the project are participating, as well as adjacent communities and venues affecting the project's members.\n\n\n\nDepending on the violation, the maintainers may decide that violations of this code of conduct that have happened outside of the scope of the community may deem an individual unwelcome, and take appropriate action to maintain the comfort and safety of its members.\n\n\n\n### Other Community Standards\n\n\n\nAs a project on GitHub, this project is additionally covered by the [GitHub Community Guidelines](https://help.github.com/articles/github-community-guidelines/).\n\n\n\nWhile not directly under the umbrella of the Rust Project, it is a part of the Rust community and [its Code of Conduct](https://www.rust-lang.org/conduct.html) may be applicable in some instances.\n\n\n\nEnforcement of those guidelines after violations overlapping with the above are the responsibility of the entities, and enforcement may happen in any or all of the services/communities.\n\n\n\n## Maintainer Enforcement Process\n\n\n\nOnce the maintainers get involved, they will follow a documented series of steps and do their best to preserve the well-being of project members. This section covers actual concrete steps.\n\n\n\n### Contacting Maintainers\n\n\n\nRefer to the GitHub repository for collaborator/maintainer information and email someone there.\n","file_path":"CODE_OF_CONDUCT.md","rank":33,"score":31880.129776642083},{"content":"#[cfg(unix)]\n\n#[test]\n\nfn with_error() {\n\n let mut main = Command::cargo_bin(\"cargo-watch\")\n\n .unwrap()\n\n .stderr(Stdio::piped())\n\n .stdout(Stdio::piped())\n\n .args(&[\n\n \"--testing-only--once\",\n\n \"--no-gitignore\",\n\n \"--poll\",\n\n \"-w\",\n\n \"./tests/touchdata/\",\n\n \"-s\",\n\n \"echo with error\",\n\n \"-s\",\n\n \"false\",\n\n ])\n\n .spawn()\n\n .unwrap();\n\n\n\n sleep(Duration::from_millis(50));\n","file_path":"tests/echo.rs","rank":34,"score":26073.414122569295},{"content":" .multiple(true)\n\n .empty_values(false)\n\n .min_values(1)\n\n .number_of_values(1)\n\n .default_value(\".\")\n\n .help(\"Watch specific file(s) or folder(s)\"),\n\n )\n\n .after_help(footnote.as_str()),\n\n );\n\n\n\n // Allow invocation of cargo-watch with both `cargo-watch watch ARGS`\n\n // (as invoked by cargo) and `cargo-watch ARGS`.\n\n let mut args: Vec<String> = env::args().collect();\n\n args.insert(1, \"watch\".into());\n\n\n\n let matches = match app.get_matches_from_safe_borrow(args) {\n\n Ok(matches) => matches,\n\n Err(err) => {\n\n match err.kind {\n\n ErrorKind::HelpDisplayed => {\n","file_path":"src/args.rs","rank":35,"score":25778.05766462906},{"content":"use clap::{App, AppSettings, Arg, ArgMatches, ErrorKind, SubCommand};\n\nuse std::{env, process};\n\n\n","file_path":"src/args.rs","rank":36,"score":25776.31383421662},{"content":" .help(\"Reserved for workspace support\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"poll\")\n\n .long(\"poll\")\n\n .help(\"Force use of polling for file changes\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"postpone\")\n\n .long(\"postpone\")\n\n .help(\"Postpone first run until a file changes\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"quiet\")\n\n .short(\"q\")\n\n .long(\"quiet\")\n\n .help(\"Suppress output from cargo-watch itself\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"cmd:cargo\")\n","file_path":"src/args.rs","rank":37,"score":25774.87072285329},{"content":" .about(env!(\"CARGO_PKG_DESCRIPTION\"))\n\n .usage(\"cargo watch [FLAGS] [OPTIONS]\")\n\n .help_message(\"Display this message\")\n\n .version_message(\"Display version information\")\n\n .arg(\n\n Arg::with_name(\"once\")\n\n .long(\"testing-only--once\")\n\n .hidden(true),\n\n )\n\n .arg(\n\n Arg::with_name(\"clear\")\n\n .short(\"c\")\n\n .long(\"clear\")\n\n .help(\"Clear the screen before each run\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"debug\")\n\n .long(\"debug\")\n\n .help(\"Show debug output\"),\n\n )\n","file_path":"src/args.rs","rank":38,"score":25772.888259560805},{"content":" .number_of_values(1)\n\n .help(\"Ignore a glob/gitignore-style pattern\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"packages:one\")\n\n .short(\"p\")\n\n .long(\"package\")\n\n .takes_value(true)\n\n .value_name(\"spec\")\n\n .multiple(true)\n\n .empty_values(false)\n\n .min_values(1)\n\n .hidden(true)\n\n .help(\"Reserved for workspace support\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"watch\")\n\n .short(\"w\")\n\n .long(\"watch\")\n\n .takes_value(true)\n","file_path":"src/args.rs","rank":39,"score":25770.896501443553},{"content":" .arg(\n\n Arg::with_name(\"ignore-nothing\")\n\n .long(\"ignore-nothing\")\n\n .help(\"Ignore nothing, not even target/ and .git/\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"no-gitignore\")\n\n .long(\"no-gitignore\")\n\n .help(\"Don’t use .gitignore files\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"no-restart\")\n\n .long(\"no-restart\")\n\n .help(\"Don’t restart command while it’s still running\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"packages:all\")\n\n .long(\"all\")\n\n .conflicts_with(\"packages:one\")\n\n .hidden(true)\n","file_path":"src/args.rs","rank":40,"score":25770.505979650774},{"content":" println!(\"{}\", err);\n\n process::exit(0);\n\n }\n\n\n\n ErrorKind::VersionDisplayed => {\n\n // Unlike HelpDisplayed, VersionDisplayed emits the output\n\n // by itself (clap-rs/clap#1390). It also does so without a\n\n // trailing newline, so we print one ourselves.\n\n println!();\n\n process::exit(0);\n\n }\n\n\n\n _ => app.get_matches(),\n\n }\n\n }\n\n };\n\n\n\n matches.subcommand.unwrap().matches\n\n}\n","file_path":"src/args.rs","rank":41,"score":25770.3671676793},{"content":" .short(\"x\")\n\n .long(\"exec\")\n\n .takes_value(true)\n\n .value_name(\"cmd\")\n\n .multiple(true)\n\n .empty_values(false)\n\n .min_values(1)\n\n .number_of_values(1)\n\n .help(\"Cargo command(s) to execute on changes [default: check]\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"cmd:shell\")\n\n .short(\"s\")\n\n .long(\"shell\")\n\n .takes_value(true)\n\n .value_name(\"cmd\")\n\n .multiple(true)\n\n .empty_values(false)\n\n .min_values(1)\n\n .number_of_values(1)\n","file_path":"src/args.rs","rank":42,"score":25769.66813481263},{"content":" .help(\"Shell command(s) to execute on changes\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"delay\")\n\n .short(\"d\")\n\n .long(\"delay\")\n\n .takes_value(true)\n\n .empty_values(false)\n\n .default_value(\"0.5\")\n\n .help(\"File updates debounce delay in seconds\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"ignore\")\n\n .short(\"i\")\n\n .long(\"ignore\")\n\n .takes_value(true)\n\n .value_name(\"pattern\")\n\n .multiple(true)\n\n .empty_values(false)\n\n .min_values(1)\n","file_path":"src/args.rs","rank":43,"score":25768.34318953137},{"content":"//! Utilities for working with cargo and rust files\n\n\n\nuse std::env;\n\nuse std::fs;\n\nuse std::path::PathBuf;\n\n\n\n/// How many parent folders are searched for a `Cargo.toml`\n\nconst MAX_ANCESTORS: u32 = 10;\n\n\n\n/// Returns the closest ancestor path containing a `Cargo.toml`.\n\n///\n\n/// Returns `None` if no ancestor path contains a `Cargo.toml`, or if\n\n/// the limit of `MAX_ANCESTORS` ancestors has been reached.\n\n///\n\n/// TODO: #52 Parse toml to get to workspace root\n","file_path":"src/cargo.rs","rank":44,"score":23881.10575787579},{"content":"use watchexec::{\n\n error::Result,\n\n pathop::PathOp,\n\n run::{ExecHandler, Handler},\n\n Args,\n\n};\n\n\n\npub struct CwHandler {\n\n cmd: String,\n\n once: bool,\n\n quiet: bool,\n\n inner: ExecHandler,\n\n}\n\n\n\nimpl Handler for CwHandler {\n\n fn args(&self) -> Args {\n\n self.inner.args()\n\n }\n\n\n\n fn on_manual(&self) -> Result<bool> {\n","file_path":"src/watch.rs","rank":45,"score":23728.954811474552},{"content":" if self.once {\n\n Ok(true)\n\n } else {\n\n self.start();\n\n self.inner.on_manual()\n\n }\n\n }\n\n\n\n fn on_update(&self, ops: &[PathOp]) -> Result<bool> {\n\n self.start();\n\n self.inner.on_update(ops)\n\n }\n\n}\n\n\n\nimpl CwHandler {\n\n pub fn new(mut args: Args, quiet: bool) -> Result<Self> {\n\n let cmd = args.cmd.join(\" && \");\n\n let mut final_cmd = cmd.clone();\n\n if !quiet {\n\n #[cfg(unix)]\n","file_path":"src/watch.rs","rank":46,"score":23722.136253996458},{"content":" final_cmd.push_str(\"; echo [Finished running. Exit status: $?]\");\n\n #[cfg(windows)]\n\n final_cmd.push_str(\" & echo [Finished running. Exit status: %ERRORLEVEL%]\");\n\n #[cfg(not(any(unix, windows)))]\n\n final_cmd.push_str(\" ; echo [Finished running]\");\n\n // ^ could be wrong depending on the platform, to be fixed on demand\n\n }\n\n\n\n args.cmd = vec![final_cmd];\n\n\n\n Ok(Self {\n\n once: args.once,\n\n cmd,\n\n inner: ExecHandler::new(args)?,\n\n quiet,\n\n })\n\n }\n\n\n\n fn start(&self) {\n\n if !self.quiet {\n\n println!(\"[Running '{}']\", self.cmd);\n\n }\n\n }\n\n}\n","file_path":"src/watch.rs","rank":47,"score":23719.72912772339},{"content":"#[test]\n\nfn with_cargo() {\n\n let mut main = Command::new(\"cargo\")\n\n .stderr(Stdio::piped())\n\n .stdout(Stdio::piped())\n\n .args(&[\"watch\", \"--version\"])\n\n .spawn()\n\n .unwrap();\n\n\n\n if main.wait_timeout(Duration::from_secs(1)).unwrap().is_none() {\n\n main.kill().unwrap();\n\n }\n\n\n\n main.wait_with_output()\n\n .unwrap()\n\n .assert()\n\n .success()\n\n .stdout(is_match(r\"cargo-watch \\d+\\.\\d+\\.\\d+\\n\").unwrap());\n\n}\n\n\n","file_path":"tests/exec.rs","rank":48,"score":22933.70043032941},{"content":"#[test]\n\nfn without_cargo() {\n\n let mut main = Command::cargo_bin(\"cargo-watch\")\n\n .unwrap()\n\n .stderr(Stdio::piped())\n\n .stdout(Stdio::piped())\n\n .args(&[\"watch\", \"--version\"])\n\n .spawn()\n\n .unwrap();\n\n\n\n if main.wait_timeout(Duration::from_secs(1)).unwrap().is_none() {\n\n main.kill().unwrap();\n\n }\n\n\n\n main.wait_with_output()\n\n .unwrap()\n\n .assert()\n\n .success()\n\n .stdout(is_match(r\"cargo-watch \\d+\\.\\d+\\.\\d+\\n\").unwrap());\n\n}\n\n\n","file_path":"tests/exec.rs","rank":49,"score":22063.279456901066},{"content":"#[test]\n\nfn without_watch() {\n\n let mut main = Command::cargo_bin(\"cargo-watch\")\n\n .unwrap()\n\n .stderr(Stdio::piped())\n\n .stdout(Stdio::piped())\n\n .args(&[\"--version\"])\n\n .spawn()\n\n .unwrap();\n\n\n\n if main.wait_timeout(Duration::from_secs(1)).unwrap().is_none() {\n\n main.kill().unwrap();\n\n }\n\n\n\n main.wait_with_output()\n\n .unwrap()\n\n .assert()\n\n .success()\n\n .stdout(is_match(r\"cargo-watch \\d+\\.\\d+\\.\\d+\\n\").unwrap());\n\n}\n","file_path":"tests/exec.rs","rank":50,"score":21916.569541898905},{"content":"extern crate assert_cmd;\n\nextern crate cargo_watch;\n\nextern crate predicates;\n\nextern crate wait_timeout;\n\nextern crate watchexec;\n\n\n\nuse assert_cmd::prelude::*;\n\nuse predicates::str::is_match;\n\nuse std::{\n\n process::{Command, Stdio},\n\n time::Duration,\n\n};\n\nuse wait_timeout::ChildExt;\n\n\n\n#[test]\n","file_path":"tests/exec.rs","rank":52,"score":15.913362977949527},{"content":"extern crate assert_cmd;\n\nextern crate cargo_watch;\n\n#[macro_use]\n\nextern crate insta;\n\nextern crate wait_timeout;\n\nextern crate watchexec;\n\n\n\nuse assert_cmd::prelude::*;\n\nuse std::{\n\n fs::OpenOptions,\n\n io,\n\n path::PathBuf,\n\n process::{Command, Stdio},\n\n thread::sleep,\n\n time::Duration,\n\n};\n\nuse wait_timeout::ChildExt;\n\n\n","file_path":"tests/echo.rs","rank":53,"score":15.52257259642404},{"content":"//! Watch files in a Cargo project and compile it when they change\n\n#![forbid(unsafe_code, clippy::pedantic)]\n\n\n\nextern crate cargo_watch;\n\nextern crate watchexec;\n\n\n","file_path":"src/main.rs","rank":54,"score":14.527136378945944},{"content":" touch(4).unwrap();\n\n\n\n if main\n\n .wait_timeout(Duration::from_secs(30))\n\n .unwrap()\n\n .is_none()\n\n {\n\n main.kill().unwrap();\n\n }\n\n\n\n assert_snapshot_matches!(\"with_error.stderr\", std_to_string(&mut main.stderr));\n\n assert_snapshot_matches!(\"with_error.stdout\", std_to_string(&mut main.stdout));\n\n}\n","file_path":"tests/echo.rs","rank":55,"score":2.8829744584738446}],"string":"[\n {\n \"content\": \"fn main() -> watchexec::error::Result<()> {\\n\\n let matches = cargo_watch::args::parse();\\n\\n\\n\\n cargo_watch::change_dir();\\n\\n\\n\\n let quiet = matches.is_present(\\\"quiet\\\");\\n\\n let debug = matches.is_present(\\\"debug\\\");\\n\\n let opts = cargo_watch::get_options(debug, &matches);\\n\\n let handler = cargo_watch::watch::CwHandler::new(opts, quiet)?;\\n\\n watchexec::run::watch(&handler)\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 0,\n \"score\": 75551.95326953352\n },\n {\n \"content\": \"pub fn parse() -> ArgMatches<'static> {\\n\\n let footnote = \\\"Cargo commands (-x) are always executed before shell commands (-s).\\\\n\\\\nBy default, your entire project is watched, except for the target/ and .git/ folders, and your .gitignore files are used to filter paths.\\\".to_owned();\\n\\n\\n\\n #[cfg(windows)] let footnote = format!(\\\"{}\\\\n\\\\nOn Windows, patterns given to -i have forward slashes (/) automatically converted to backward ones (\\\\\\\\) to ease command portability.\\\", footnote);\\n\\n\\n\\n let mut app = App::new(env!(\\\"CARGO_PKG_NAME\\\"))\\n\\n .bin_name(\\\"cargo\\\")\\n\\n .version(env!(\\\"CARGO_PKG_VERSION\\\"))\\n\\n .help_message(\\\"\\\")\\n\\n .version_message(\\\"\\\")\\n\\n .setting(AppSettings::ArgsNegateSubcommands)\\n\\n .setting(AppSettings::DisableHelpSubcommand)\\n\\n .setting(AppSettings::DontCollapseArgsInUsage)\\n\\n .setting(AppSettings::GlobalVersion)\\n\\n .setting(AppSettings::StrictUtf8)\\n\\n .setting(AppSettings::SubcommandRequired)\\n\\n .setting(AppSettings::SubcommandRequiredElseHelp)\\n\\n .subcommand(\\n\\n SubCommand::with_name(\\\"watch\\\")\\n\\n .author(env!(\\\"CARGO_PKG_HOMEPAGE\\\"))\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 2,\n \"score\": 62194.80342345011\n },\n {\n \"content\": \"/// Returns the closest ancestor path containing a `Cargo.toml`.\\n\\n///\\n\\n/// Returns `None` if no ancestor path contains a `Cargo.toml`, or if\\n\\n/// the limit of `MAX_ANCESTORS` ancestors has been reached.\\n\\n///\\n\\n/// TODO: #52 Parse toml to get to workspace root\\n\\npub fn root() -> Option<PathBuf> {\\n\\n /// Checks if the directory contains `Cargo.toml`\\n\\n fn contains_manifest(path: &PathBuf) -> bool {\\n\\n fs::read_dir(path)\\n\\n .map(|entries| {\\n\\n entries\\n\\n .filter_map(Result::ok)\\n\\n .any(|ent| &ent.file_name() == \\\"Cargo.toml\\\")\\n\\n })\\n\\n .unwrap_or(false)\\n\\n }\\n\\n\\n\\n // From the current directory we work our way up, looking for `Cargo.toml`\\n\\n env::current_dir().ok().and_then(|mut wd| {\\n\\n for _ in 0..MAX_ANCESTORS {\\n\\n if contains_manifest(&wd) {\\n\\n return Some(wd);\\n\\n }\\n\\n if !wd.pop() {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n None\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/cargo.rs\",\n \"rank\": 4,\n \"score\": 54124.23447199364\n },\n {\n \"content\": \"### RLS is slow while using cargo watch, or vice versa, or it's waiting for the project lock a lot\\n\\n\\n\\nCargo builds (and checks, and clippy, and tests because the tests have to be\\n\\nbuilt) take out a lock on the project so two cargo instances don't run at the\\n\\nsame time. That may include language servers like RLS (and possibly RA)! So\\n\\nyour editor might be fighting with cargo watch for the lock when you save.\\n\\n\\n\\nThere's not really a way around this. Either stop using cargo watch, or stop\\n\\nusing RLS/RA, or accept that whenever you save there may be some slowdown for a\\n\\nlittle while. While I'm investigating ways to make this less of an issue,\\n\\nthere's not going to be a quick fix anytime soon.\\n\\n\\n\\n### On Windows 7 (or lower): \\\"failed to add to job object: Access denied (OS Error 5)\\\"\\n\\n\\n\\nCargo Watch versions 5.0.0 and up (and watchexec versions 1.3.0 and up) [do not\\n\\nsupport Windows 7 or lower][i-69]. There are no plans at the moment to add such\\n\\nsupport.\\n\\n\\n\\nYou can downgrade to the last version which did support Windows 7 (and lower),\\n\\nbut do keep in mind that many bug fixes and features are missing there:\\n\\n\\n\\n```\\n\\n$ cargo install --force --vers 4.0.3 cargo-watch\\n\\n```\\n\\n\\n\\n[i-69]: https://github.com/passcod/cargo-watch/issues/69\\n\\n\\n\\n### If running cargo watch errors with \\\"Found argument 'build' which wasn't expected\\\" (or similar)\\n\\n\\n\\nYou're probably using **version 4** (or higher) but using the **version 3** (or\\n\\nlower) style of arguments. The interface changed! Refer to the sections above\\n\\nfor new usage guidelines, or to the help message:\\n\\n\\n\\n```\\n\\n$ cargo watch --help\\n\\n```\\n\\n\\n\\n### I want to run cargo-watch directly, without going through cargo\\n\\n\\n\\nYou can! But you'll have to specify the `watch` subcommand as the first\\n\\nargument, like so:\\n\\n\\n\\n```\\n\\n$ /path/to/cargo-watch watch -x build\\n\\n```\\n\\n\\n\\n### I want to run cargo-watch outside of a Cargo project\\n\\n\\n\\nThat's not supported. If you have a good reason to use a Cargo-specific tool\\n\\noutside a Cargo project, please open an issue! Otherwise, you'll probably be\\n\\nbest served with using [Watchexec].\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 9,\n \"score\": 32793.71443789474\n },\n {\n \"content\": \"# $ cargo watch\\n\\n\\n\\n[](https://crates.io/crates/cargo-watch)\\n\\n[](https://creativecommons.org/publicdomain/zero/1.0/)\\n\\n[](https://crates.io/crates/cargo-watch)\\n\\n[](https://travis-ci.org/passcod/cargo-watch)\\n\\n\\n\\nCargo Watch watches over your project's source for changes, and runs Cargo\\n\\ncommands when they occur.\\n\\n\\n\\nIf you've used [nodemon], [gulp], [guard], [watchman], or similar others,\\n\\nit will probably feel familiar.\\n\\n\\n\\n[nodemon]: http://nodemon.io/\\n\\n[gulp]: http://gulpjs.com/\\n\\n[guard]: http://guardgem.org/\\n\\n[watchman]: https://facebook.github.io/watchman/\\n\\n\\n\\n## Install\\n\\n\\n\\nPre-built binaries are available [on the Github Releases tab](https://github.com/passcod/cargo-watch/releases).\\n\\n\\n\\n```\\n\\n$ cargo install cargo-watch\\n\\n```\\n\\n\\n\\nTo upgrade:\\n\\n\\n\\n```\\n\\n$ cargo install --force cargo-watch\\n\\n```\\n\\n\\n\\nOr clone and build with `$ cargo build` then place in your $PATH.\\n\\n\\n\\n## Usage\\n\\n\\n\\nBy default, it runs `check` (which is available [since Rust 1.16][st-check]).\\n\\nYou can easily override this, though:\\n\\n\\n\\n```\\n\\n$ cargo watch [-x command]...\\n\\n```\\n\\n\\n\\n[st-check]: https://blog.rust-lang.org/2017/03/16/Rust-1.16.html\\n\\n\\n\\nA few examples:\\n\\n\\n\\n```\\n\\n# Run tests only\\n\\n$ cargo watch -x test\\n\\n\\n\\n# Run check then tests\\n\\n$ cargo watch -x check -x test\\n\\n\\n\\n# Run run with arguments\\n\\n$ cargo watch -x 'run -- --some-arg'\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 10,\n \"score\": 32793.288016506194\n },\n {\n \"content\": \"### Something not covered above / I have a feature request\\n\\n\\n\\nPlease [open an issue][watch-issues], or look through the existing ones. You\\n\\nmay also want to look through [issues for the Notify library][notify-issues]\\n\\nthis tool depends on, or the [issues for the Watchexec tool][watchexec-issues]\\n\\nthat we use under the covers.\\n\\n\\n\\nIf you want more verbose output, try running with the `--debug` flag. Note that\\n\\nthis will also enable debug mode for watchexec. When filing an issue, **make\\n\\nsure to include a log with `--debug` enabled so problems can be diagnosed.**\\n\\n\\n\\n[notify-issues]: https://github.com/passcod/notify/issues\\n\\n[watch-issues]: https://github.com/passcod/cargo-watch/issues\\n\\n[watchexec-issues]: https://github.com/mattgreen/watchexec/issues\\n\\n\\n\\n### I want to embed Cargo Watch in my own (Rust) tool\\n\\n\\n\\nYou cannot do that directly. You may of course call `cargo-watch` as any other\\n\\nprogram, but if you want to directly / statically embed it, that's not\\n\\npossible. But! Cargo Watch is built on top of [Watchexec], Watchexec is itself\\n\\nbuilt on [Notify], and both of these can be used as Rust libraries.\\n\\n\\n\\n- If you want to build a tool that runs, restarts, and otherwise manages\\n\\n commands in response to file changes, you'll most probably want to use\\n\\n **Watchexec**.\\n\\n\\n\\n- If you want to build a tool that responds to file changes, but does not need\\n\\n to run commands, or does so in a way that is not well-supported by Watchexec,\\n\\n then **Notify** is your ticket.\\n\\n\\n\\n[Notify]: https://github.com/passcod/notify\\n\\n[Watchexec]: https://github.com/mattgreen/watchexec\\n\\n\\n\\n### Wait, is this just a wrapper on top of watchexec?\\n\\n\\n\\nIt is! [Watchexec] does a really good job of watching files and running commands\\n\\nand all the details that go with this. Cargo watch simply embeds watchexec and\\n\\ncalls it with its own custom options and defaults, so you can just run\\n\\n`cargo-watch` in your project and be in business.\\n\\n\\n\\n## About\\n\\n\\n\\nCreated by [Félix Saparelli][passcod] and [awesome contributors][contributors].\\n\\n\\n\\n[contributors]: https://github.com/passcod/cargo-watch/network/members\\n\\n[passcod]: https://passcod.name\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 11,\n \"score\": 32792.33271444406\n },\n {\n \"content\": \"### Ignore syntax\\n\\n\\n\\nSee the [`glob::Pattern` docs][glob::Pattern] for a more detailed\\n\\nspecification of the glob matching syntax used for `--ignore`.\\n\\n\\n\\nOn Windows, patterns should be specified with Windows-style (`\\\\\\\\`) separators.\\n\\nUnix-style separators (`/`) would not match Windows paths, which could be\\n\\nconfusing and give the appearance of commandline ignores not working.\\n\\n\\n\\nFrom Cargo Watch 7.0.0, `/` in commandline ignores are automatically translated\\n\\nto `\\\\\\\\` when running on Windows, but one should still try to write the correct\\n\\npatterns for the platform, as there may be more subtle differences.\\n\\n\\n\\n[glob::Pattern]: https://doc.rust-lang.org/glob/glob/struct.Pattern.html\\n\\n\\n\\n### Reloading servers seamlessly\\n\\n\\n\\nCargo Watch pairs very well with [Catflap], a tool for Unixy platforms that\\n\\nlets one spawn a socket before the watcher runs that Rust servers can then bind\\n\\nto, avoiding request-dropping and the infamous ADDRINUSE error. For example:\\n\\n\\n\\n```\\n\\n$ catflap -- cargo watch -x run\\n\\n```\\n\\n\\n\\n[Catflap]: https://github.com/passcod/catflap\\n\\n\\n\\nOf course, if you don't need to guard against these issues or don't want to\\n\\nmodify your program to grab sockets instead of ports, you can use Cargo Watch\\n\\nas-is: it will happily just restart your server normally.\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 12,\n \"score\": 32789.983120353536\n },\n {\n \"content\": \"# Run an arbitrary command\\n\\n$ cargo watch -s 'echo Hello world'\\n\\n```\\n\\n\\n\\nThere's a lot more you can do! Here's a copy of the help:\\n\\n\\n\\n```\\n\\nUSAGE:\\n\\n cargo watch [FLAGS] [OPTIONS]\\n\\n\\n\\nFLAGS:\\n\\n -c, --clear Clear the screen before each run\\n\\n --debug Display debug output\\n\\n -h, --help Display this message\\n\\n --ignore-nothing Ignore nothing, not even target/ and .git/\\n\\n --no-gitignore Don’t use .gitignore files\\n\\n --no-restart Don’t restart command while it’s still running\\n\\n --poll Force use of polling for file changes\\n\\n --postpone Postpone first run until a file changes\\n\\n -q, --quiet Suppress output from cargo-watch itself\\n\\n -V, --version Display version information\\n\\n\\n\\nOPTIONS:\\n\\n -x, --exec <cmd>...\\n\\n Cargo command(s) to execute on changes [default: check]\\n\\n -s, --shell <cmd>...\\n\\n Shell command(s) to execute on changes\\n\\n -d, --delay <delay>\\n\\n File updates debounce delay in seconds [default: 0.5]\\n\\n -i, --ignore <pattern>...\\n\\n Ignore a glob/gitignore-style pattern\\n\\n -w, --watch <watch>...\\n\\n Watch specific file(s) or folder(s) [default: .]\\n\\n\\n\\nCargo commands (-x) are always executed before shell commands (-s).\\n\\n\\n\\nBy default, your entire project is watched, except for the target/\\n\\nand .git/ folders, and your .gitignore files are used to filter paths.\\n\\n```\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 13,\n \"score\": 32789.524519034916\n },\n {\n \"content\": \"### If file updates seems to never trigger\\n\\n\\n\\nTry using `--poll` to force the polling fallback.\\n\\n\\n\\nIf that still doesn't work, and you're using an editor that does \\\"safe saving\\\",\\n\\nlike IntelliJ / PyCharm, you may have to disable \\\"safe saving\\\" as that may\\n\\nprevent file notifications from being generated properly.\\n\\n\\n\\n### Linux: If it fails to watch some deep directories but not others / \\\"No space left on device\\\"\\n\\n\\n\\nYou may have hit the inotify watch limit. [Here's a summary of what this means\\n\\nand how to increase it.][inotify limit]\\n\\n\\n\\n[inotify limit]: https://blog.passcod.name/2017/jun/25/inotify-watch-limit\\n\\n\\n\\n### If you want to only recompile one Cargo workspace\\n\\n\\n\\nCargo workspaces [are not natively supported yet][i-52].\\n\\n\\n\\nHowever, as you can run \\\"arbitrary commands\\\" with the `-s` option, you can\\n\\nwrite workspace-aware commands manually.\\n\\n\\n\\n[i-52]: https://github.com/passcod/cargo-watch/issues/52\\n\\n\\n\\n### If it runs repeatedly without touching anything\\n\\n\\n\\nThat can happen when watching files that are modified by the command you're\\n\\nrunning.\\n\\n\\n\\nIf you're only running compiles or checks (i.e. any command that only affects\\n\\nthe target/ folder) and you're using `-w`, you might be confusing the\\n\\ntarget-folder-ignorer. Check your options and paths.\\n\\n\\n\\n### If it runs repeatedly only touching ignored files\\n\\n\\n\\nMake sure the files you ignored are the only ones being touched. Use the\\n\\n`--debug` option to see exactly which files were modified and triggered the\\n\\nrestart (or were ignored). Some programs and libraries create temporary files\\n\\nthat may not match a simple ignore pattern.\\n\\n\\n\\n### I don't have colour in my cargo output / for cargo test\\n\\n\\n\\nThis sometimes happens on some terminal configurations. A quick workaround\\n\\n(instead of going down the rabbit hole of debugging your console settings) is\\n\\nto pass `--color=always` to the command. E.g.\\n\\n\\n\\n```\\n\\n$ cargo watch -x 'check --color=always'\\n\\n```\\n\\n\\n\\nFor test (and bench) commands, you'll need to pass the flag to the underlying\\n\\nprogram instead of cargo:\\n\\n\\n\\n```\\n\\n$ cargo watch -x 'test -- --color=always'\\n\\n```\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 14,\n \"score\": 32789.1966614176\n },\n {\n \"content\": \"### Restarting an application only if the build/check succeeds\\n\\n\\n\\n[Brought up by @LeDominik](https://github.com/passcod/cargo-watch/issues/75),\\n\\nhere's a pattern that may be very useful: you're working on a server or app,\\n\\nbut want it to keep running while you're writing a new feature or fixing a bug,\\n\\npotentially causing the code not to compile anymore in the meantime.\\n\\n\\n\\nIn this case, you can use this strategy: run a first `cargo watch` with check,\\n\\nbuild, test, or whatever you want, and append `-s 'touch .trigger` (or equivalent\\n\\nfor your platform). Then, run a second `cargo watch` simultaneously that _only_\\n\\nwatches that `.trigger` file. For example:\\n\\n\\n\\n```\\n\\n$ cargo watch -x check -s 'touch .trigger'\\n\\n```\\n\\n\\n\\nand\\n\\n\\n\\n```\\n\\n$ cargo watch --no-gitignore -w .trigger -x run\\n\\n```\\n\\n\\n\\nThe `--no-gitignore` flag ensures that you can safely add `.trigger` to your\\n\\n`.gitignore` file to avoid mistakenly committing it.\\n\\n\\n\\n## Contributing\\n\\n\\n\\nThe Cargo Watch team enthusiastically welcomes contributions and project\\n\\nparticipation! There's a bunch of things you can do if you want to contribute!\\n\\nThe [Contributor Guide](./CONTRIBUTING.md) has all the information you need for\\n\\neverything from reporting bugs to contributing entire new features. Please\\n\\ndon't hesitate to jump in if you'd like to, or even ask us questions if\\n\\nsomething isn't clear. <sub>{[attribution](https://github.com/zkat/pacote#contributing)}</sub>\\n\\n\\n\\nYou can also contribute financially with [Patreon] or [GitHub Sponsorship].\\n\\n\\n\\n[Patreon]: https://www.patreon.com/passcod\\n\\n[GitHub Sponsors]: https://github.com/users/passcod/sponsorship\\n\\n\\n\\n## Troubleshooting\\n\\n\\n\\nIn all cases, start by checking your version with `cargo watch --version` and,\\n\\nif necessary, upgrading to [the latest one][releases].\\n\\n\\n\\n[releases]: https://github.com/passcod/cargo-watch/releases\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 15,\n \"score\": 32788.99377123207\n },\n {\n \"content\": \"## Request Support\\n\\n\\n\\nIf you have a question about this project, how to use it, or just need clarification about something:\\n\\n\\n\\n* Open an Issue at https://github.com/passcod/cargo-watch/issues\\n\\n* Provide as much context as you can about what you're running into.\\n\\n* Provide project and platform versions (rustc, cargo, etc), depending on what seems relevant. If not, please be ready to provide that information if maintainers ask for it.\\n\\n\\n\\nOnce it's filed:\\n\\n\\n\\n* The project team will [label the issue](#label-issues).\\n\\n* Someone will try to have a response soon.\\n\\n* If you or the maintainers don't respond to an issue for 30 days, the [issue will be closed](#clean-up-issues-and-prs). If you want to come back to it, reply (once, please), and we'll reopen the existing issue. Please avoid filing new issues as extensions of one you already made.\\n\\n\\n\\n## Report an Error or Bug\\n\\n\\n\\nIf you run into an error or bug with the project:\\n\\n\\n\\n* Open an Issue at https://github.com/passcod/cargo-watch/issues\\n\\n* Include *reproduction steps* that someone else can follow to recreate the bug or error on their own.\\n\\n* Include a log by running the same command with `--debug` enabled.\\n\\n* Provide project and platform versions (rustc, cargo, etc), depending on what seems relevant. If not, please be ready to provide that information if maintainers ask for it.\\n\\n\\n\\nOnce it's filed:\\n\\n\\n\\n* The project team will [label the issue](#label-issues).\\n\\n* A team member will try to reproduce the issue with your provided steps. If there are no repro steps or no obvious way to reproduce the issue, the team will ask you for those steps and mark the issue as `needs-repro`. Bugs with the `needs-repro` tag will not be addressed until they are reproduced.\\n\\n* If the team is able to reproduce the issue, it will be marked `needs-fix`, as well as possibly other tags (such as `critical`), and the issue will be left to be [implemented by someone](#contribute-code).\\n\\n* If you don't respond to an issue for 30 days, the [issue will be closed](#clean-up-issues-and-prs). If you want to come back to it, reply (once, please), and we'll reopen the existing issue. Please avoid filing new issues as extensions of one you already made.\\n\\n* `critical` issues may be left open, depending on perceived immediacy and severity, even past the 30 day deadline.\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 16,\n \"score\": 32788.05276807255\n },\n {\n \"content\": \"## Request a Feature\\n\\n\\n\\nIf the project doesn't do something you need or want it to do:\\n\\n\\n\\n* Open an Issue at https://github.com/passcod/cargo-watch/issues\\n\\n* Provide as much context as you can about what you're running into.\\n\\n* Please try and be clear about why existing features and alternatives would not work for you.\\n\\n\\n\\nOnce it's filed:\\n\\n\\n\\n* The project team will [label the issue](#label-issues).\\n\\n* The project team will evaluate the feature request, possibly asking you more questions to understand its purpose and any relevant requirements. If the issue is closed, the team will convey their reasoning and suggest an alternative path forward.\\n\\n* If the feature request is accepted, it will be marked for implementation with `feature-accepted`, which can then be done by either by a core team member or by anyone in the community who wants to [contribute code](#contribute-code).\\n\\n\\n\\nNote: The team is unlikely to be able to accept every single feature request that is filed. Please understand if they need to say no.\\n\\n\\n\\n## Project Setup\\n\\n\\n\\nSo you wanna contribute some code! That's great! This project uses GitHub Pull Requests to manage contributions, so [read up on how to fork a GitHub project and file a PR](https://guides.github.com/activities/forking) if you've never done it before.\\n\\n\\n\\nIf this seems like a lot or you aren't able to do all this setup, you might also be able to [edit the files directly](https://help.github.com/articles/editing-files-in-another-user-s-repository/) without having to do any of this setup. Yes, [even code](#contribute-code).\\n\\n\\n\\nIf you want to go the usual route and run the project locally, though:\\n\\n\\n\\n* [Install Rust](https://www.rustup.rs/)\\n\\n* [Fork the project](https://guides.github.com/activities/forking/#fork)\\n\\n\\n\\nThen in your terminal:\\n\\n* `cd path/to/your/clone`\\n\\n* `cargo build`\\n\\n* `cargo run -- watch`\\n\\n\\n\\nAnd you should be ready to go!\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 17,\n \"score\": 32786.325732312\n },\n {\n \"content\": \"## Contribute Code\\n\\n\\n\\nWe like code commits a lot! They're super handy, and they keep the project going and doing the work it needs to do to be useful to others.\\n\\n\\n\\nCode contributions of just about any size are acceptable!\\n\\n\\n\\nTo contribute code:\\n\\n\\n\\n* [Set up the project](#project-setup).\\n\\n* Make any necessary changes to the source code.\\n\\n* Include any [additional documentation](#contribute-documentation) the changes might need.\\n\\n* Write clear, concise commit message(s).\\n\\n* Dependency updates, additions, or removals must be in individual commits.\\n\\n* Go to https://github.com/passcod/cargo-watch/pulls and open a new pull request with your changes.\\n\\n* If your PR is connected to an open issue, add a line in your PR's description that says `Fixes: #123`, where `#123` is the number of the issue you're fixing.\\n\\n\\n\\nOnce you've filed the PR:\\n\\n\\n\\n* Barring special circumstances, maintainers will not review PRs until all checks pass (Travis, AppVeyor, etc).\\n\\n* One or more maintainers will use GitHub's review feature to review your PR.\\n\\n* If the maintainer asks for any changes, edit your changes, push, and ask for another review. Additional tags (such as `needs-docs`) will be added depending on the review.\\n\\n* If the maintainer decides to pass on your PR, they will thank you for the contribution and explain why they won't be accepting the changes. That's ok! We still really appreciate you taking the time to do it, and we don't take that lightly. 💚\\n\\n* If your PR gets accepted, it will be marked as such, and merged into the `latest` branch soon after. Your contribution will be distributed to the masses next time the maintainers [tag a release](#tag-a-release)\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 18,\n \"score\": 32785.69153589085\n },\n {\n \"content\": \"## Tag A Release\\n\\n\\n\\n[Needs Collaborator](#join-the-project-team): Maintainer\\n\\n\\n\\nTo tag a release:\\n\\n\\n\\n1. Make sure everything works and there are no compile warnings.\\n\\n2. Read over the README.md to make sure it is updated for this new version.\\n\\n3. Checkout the `master` branch, and `git pull` all changes.\\n\\n4. If you have some changes pending to be committed, do this now.\\n\\n5. Change the version number in the Cargo.toml.\\n\\n6. Run `cargo update` to update the Cargo.lock.\\n\\n7. Commit both of these with the message `1.2.3` (where that is the new version number).\\n\\n8. Tag the commit with `v1.2.3`.\\n\\n9. Push the commit and the tag: `git push --follow-tags`.\\n\\n10. Publish the crate: `cargo publish`.\\n\\n\\n\\nYou may chime into issues or PRs that were resolved by this release to let\\n\\npeople involved that the fix or feature is out, now.\\n\\n\\n\\nYou may also want to tweet about the release, and/or announce it on\\n\\n[Reddit](https://reddit.com/r/rust).\\n\\n\\n\\n## Join the Project Team\\n\\n\\n\\n### Ways to Join\\n\\n\\n\\nThere are many ways to contribute! Most of them don't require any official status unless otherwise noted. That said, there's a couple of positions that grant special repository abilities, and this section describes how they're granted and what they do.\\n\\n\\n\\nAll of the below positions are granted based on the project team's needs, as well as their consensus opinion about whether they would like to work with the person and think that they would fit well into that position. The process is relatively informal, and it's likely that people who express interest in participating can just be granted the permissions they'd like.\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 19,\n \"score\": 32785.474101386644\n },\n {\n \"content\": \"## Contribute Documentation\\n\\n\\n\\nDocumentation contributions of any size are welcome! Feel free to file a PR even if you're just rewording a sentence to be more clear, or fixing a spelling mistake!\\n\\n\\n\\nTo contribute documentation:\\n\\n\\n\\n* [Set up the project](#project-setup).\\n\\n* Edit or add any relevant documentation.\\n\\n* Make sure your changes are formatted correctly and consistently with the rest of the documentation.\\n\\n* Re-read what you wrote, and run a spellchecker on it to make sure you didn't miss anything.\\n\\n* Write clear, concise commit message(s).\\n\\n* Go to https://github.com/passcod/cargo-watch/pulls and open a new pull request with your changes.\\n\\n* If your PR is connected to an open issue, add a line in your PR's description that says `Fixes: #123`, where `#123` is the number of the issue you're fixing.\\n\\n\\n\\nOnce you've filed the PR:\\n\\n\\n\\n* One or more maintainers will use GitHub's review feature to review your PR.\\n\\n* If the maintainer asks for any changes, edit your changes, push, and ask for another review.\\n\\n* If the maintainer decides to pass on your PR, they will thank you for the contribution and explain why they won't be accepting the changes. That's ok! We still really appreciate you taking the time to do it, and we don't take that lightly. 💚\\n\\n* If your PR gets accepted, it will be marked as such, and merged into the `latest` branch soon after. Your contribution will be distributed to the masses next time the maintainers [tag a release](#tag-a-release)\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 20,\n \"score\": 32785.419467195\n },\n {\n \"content\": \"# Contributing\\n\\n\\n\\n## How do I... <a name=\\\"toc\\\"></a>\\n\\n\\n\\n* [Use This Guide](#introduction)?\\n\\n* Ask or Say Something? 🤔🐛😱\\n\\n * [Request Support](#request-support)\\n\\n * [Report an Error or Bug](#report-an-error-or-bug)\\n\\n * [Request a Feature](#request-a-feature)\\n\\n* Make Something? 🤓👩🏽💻📜🍳\\n\\n * [Project Setup](#project-setup)\\n\\n * [Contribute Documentation](#contribute-documentation)\\n\\n * [Contribute Code](#contribute-code)\\n\\n* Manage Something ✅🙆🏼💃👔\\n\\n * [Provide Support on Issues](#provide-support-on-issues)\\n\\n * [Label Issues](#label-issues)\\n\\n * [Clean Up Issues and PRs](#clean-up-issues-and-prs)\\n\\n * [Review Pull Requests](#review-pull-requests)\\n\\n * [Merge Pull Requests](#merge-pull-requests)\\n\\n * [Tag a Release](#tag-a-release)\\n\\n * [Join the Project Team](#join-the-project-team)\\n\\n* Add a Guide Like This One [To My Project](#attribution)? 🤖😻👻\\n\\n\\n\\n## Introduction\\n\\n\\n\\nThank you so much for your interest in contributing!. All types of contributions are encouraged and valued. See the [table of contents](#toc) for different ways to help and details about how this project handles them!📝\\n\\n\\n\\nPlease make sure to read the relevant section before making your contribution! It will make it a lot easier for us maintainers to make the most of it and smooth out the experience for all involved. 💚\\n\\n\\n\\nThe [Project Team](#join-the-project-team) looks forward to your contributions. 🙌🏾✨\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 21,\n \"score\": 32785.16504660375\n },\n {\n \"content\": \"## Label Issues\\n\\n\\n\\n[Needs Collaborator](#join-the-project-team): Issue Tracker\\n\\n\\n\\nOne of the most important tasks in handling issues is labeling them usefully and accurately. All other tasks involving issues ultimately rely on the issue being classified in such a way that relevant parties looking to do their own tasks can find them quickly and easily.\\n\\n\\n\\nIn order to label issues, [open up the list of unlabeled issues](https://github.com/passcod/cargo-watch/issues?q=is%3Aopen+is%3Aissue+no%3Alabel) and, **from newest to oldest**, read through each one and apply issue labels according to the table below. If you're unsure about what label to apply, skip the issue and try the next one: don't feel obligated to label each and every issue yourself!\\n\\n\\n\\nLabel | Apply When | Notes\\n\\n--- | --- | ---\\n\\n`bug` | Cases where the code (or documentation) is behaving in a way it wasn't intended to. | If something is happening that surprises the *user* but does not go against the way the code is designed, it should use the `enhancement` label.\\n\\n`critical` | Added to `bug` issues if the problem described makes the code completely unusable in a common situation. |\\n\\n`documentation` | Added to issues or pull requests that affect any of the documentation for the project. | Can be combined with other labels, such as `bug` or `enhancement`.\\n\\n`duplicate` | Added to issues or PRs that refer to the exact same issue as another one that's been previously labeled. | Duplicate issues should be marked and closed right away, with a message referencing the issue it's a duplicate of (with `#123`)\\n\\n`enhancement` | Added to [feature requests](#request-a-feature), PRs, or documentation issues that are purely additive: the code or docs currently work as expected, but a change is being requested or suggested. |\\n\\n`help wanted` | Applied by [Committers](#join-the-project-team) to issues and PRs that they would like to get outside help for. Generally, this means it's lower priority for the maintainer team to itself implement, but that the community is encouraged to pick up if they so desire | Never applied on first-pass labeling.\\n\\n`in-progress` | Applied by [Committers](#join-the-project-team) to PRs that are pending some work before they're ready for review. | The original PR submitter should @mention the team member that applied the label once the PR is complete.\\n\\n`performance` | This issue or PR is directly related to improving performance. |\\n\\n`refactor` | Added to issues or PRs that deal with cleaning up or modifying the project for the betterment of it. |\\n\\n`starter` | Applied by [Committers](#join-the-project-team) to issues that they consider good introductions to the project for people who have not contributed before. These are not necessarily \\\"easy\\\", but rather focused around how much context is necessary in order to understand what needs to be done for this project in particular. | Existing project members are expected to stay away from these unless they increase in priority.\\n\\n`support` | This issue is either asking a question about how to use the project, clarifying the reason for unexpected behavior, or possibly reporting a `bug` but does not have enough detail yet to determine whether it would count as such. | The label should be switched to `bug` if reliable reproduction steps are provided. Issues primarily with unintended configurations of a user's environment are not considered bugs, even if they cause crashes.\\n\\n`wontfix` | Labelers may apply this label to issues that clearly have nothing at all to do with the project or are otherwise entirely outside of its scope/sphere of influence. [Committers](#join-the-project-team) may apply this label and close an issue or PR if they decide to pass on an otherwise relevant issue. | The issue or PR should be closed as soon as the label is applied, and a clear explanation provided of why the label was used. Contributors are free to contest the labeling, but the decision ultimately falls on committers as to whether to accept something or not.\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 22,\n \"score\": 32784.77634356301\n },\n {\n \"content\": \"## Clean Up Issues and PRs\\n\\n\\n\\n[Needs Collaborator](#join-the-project-team): Issue Tracker\\n\\n\\n\\nIssues and PRs can go stale after a while. Maybe they're abandoned. Maybe the team will just plain not have time to address them any time soon.\\n\\n\\n\\nIn these cases, they should be closed until they're brought up again or the interaction starts over.\\n\\n\\n\\nTo clean up issues and PRs:\\n\\n\\n\\n* Search the issue tracker for issues or PRs, and add the term `updated:<=YYYY-MM-DD`, where the date is 30 days before today.\\n\\n* Go through each issue *from oldest to newest*, and close them if **all of the following are true**:\\n\\n * not opened by a maintainer\\n\\n * not marked as `critical`\\n\\n * not marked as `starter` or `help wanted` (these might stick around for a while, in general, as they're intended to be available)\\n\\n * no explicit messages in the comments asking for it to be left open\\n\\n * does not belong to a milestone\\n\\n* Leave a message when closing saying \\\"Cleaning up stale issue. Please reopen or ping us if and when you're ready to resume this. See https://github.com/passcod/cargo-watch/blob/latest/CONTRIBUTING.md#clean-up-issues-and-prs for more details.\\\"\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 23,\n \"score\": 32784.610448783686\n },\n {\n \"content\": \"## Attribution\\n\\n\\n\\nThis guide was generated using the WeAllJS `CONTRIBUTING.md` generator. [Make your own](https://npm.im/weallcontribute)!\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 24,\n \"score\": 32784.38824153427\n },\n {\n \"content\": \"## Provide Support on Issues\\n\\n\\n\\n[Needs Collaborator](#join-the-project-team): none\\n\\n\\n\\nHelping out other users with their questions is a really awesome way of contributing to any community. It's not uncommon for most of the issues on an open source projects being support-related questions by users trying to understand something they ran into, or find their way around a known bug.\\n\\n\\n\\nSometimes, the `support` label will be added to things that turn out to actually be other things, like bugs or feature requests. In that case, suss out the details with the person who filed the original issue, add a comment explaining what the bug is, and change the label from `support` to `bug` or `feature`. If you can't do this yourself, @mention a maintainer so they can do it.\\n\\n\\n\\nIn order to help other folks out with their questions:\\n\\n\\n\\n* Go to the issue tracker and [filter open issues by the `support` label](https://github.com/passcod/cargo-watch/issues?q=is%3Aopen+is%3Aissue+label%3Asupport).\\n\\n* Read through the list until you find something that you're familiar enough with to give an answer to.\\n\\n* Respond to the issue with whatever details are needed to clarify the question, or get more details about what's going on.\\n\\n* Once the discussion wraps up and things are clarified, either close the issue, or ask the original issue filer (or a maintainer) to close it for you.\\n\\n\\n\\nSome notes on picking up support issues:\\n\\n\\n\\n* Avoid responding to issues you don't know you can answer accurately.\\n\\n* As much as possible, try to refer to past issues with accepted answers. Link to them from your replies with the `#123` format.\\n\\n* Be kind and patient with users -- often, folks who have run into confusing things might be upset or impatient. This is ok. Try to understand where they're coming from, and if you're too uncomfortable with the tone, feel free to stay away or withdraw from the issue. (note: if the user is outright hostile or is violating the CoC, [refer to the Code of Conduct](CODE_OF_CONDUCT.md) to resolve the conflict).\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 25,\n \"score\": 32783.95201803785\n },\n {\n \"content\": \"You can spot a collaborator on the repo by looking for the `[Collaborator]` or `[Owner]` tags next to their names.\\n\\n\\n\\nPermission | Description\\n\\n--- | ---\\n\\nIssue Tracker | Granted to contributors who express a strong interest in spending time on the project's issue tracker. These tasks are mainly [labeling issues](#label-issues), [cleaning up old ones](#clean-up-issues-and-prs), and [reviewing pull requests](#review-pull-requests), as well as all the usual things non-team-member contributors can do. Issue handlers should not merge pull requests, tag releases, or directly commit code themselves: that should still be done through the usual pull request process. Becoming an Issue Handler means the project team trusts you to understand enough of the team's process and context to implement it on the issue tracker.\\n\\nCommitter | Granted to contributors who want to handle the actual pull request merges, etc. Committers should have a good level of familiarity with the codebase, and enough context to understand the implications of various changes, as well as a good sense of the will and expectations of the project team.\\n\\nMaintainer | Very similar to Committer but with the added privilege of being able to tag new releases and publish to https://crates.io/.\\n\\nAdmin/Owner | Granted to people ultimately responsible for the project, its community, etc.\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 26,\n \"score\": 32783.4126981656\n },\n {\n \"content\": \"## Review Pull Requests\\n\\n\\n\\n[Needs Collaborator](#join-the-project-team): Issue Tracker\\n\\n\\n\\nWhile anyone can comment on a PR, add feedback, etc, PRs are only *approved* by team members with Issue Tracker or higher permissions.\\n\\n\\n\\nPR reviews use [GitHub's own review feature](https://help.github.com/articles/about-pull-request-reviews/), which manages comments, approval, and review iteration.\\n\\n\\n\\nSome notes:\\n\\n\\n\\n* You may ask for minor changes (\\\"nitpicks\\\"), but consider whether they are really blockers to merging: try to err on the side of \\\"approve, with comments\\\".\\n\\n* Please make sure you're familiar with the code or documentation being updated, unless it's a minor change (spellchecking, minor formatting, etc). You may @mention another project member who you think is better suited for the review, but still provide a non-approving review of your own.\\n\\n* Be extra kind: people who submit code/doc contributions are putting themselves in a pretty vulnerable position, and have put time and care into what they've done (even if that's not obvious to you!) -- always respond with respect, be understanding, but don't feel like you need to sacrifice your standards for their sake, either. Just don't be a jerk about it?\\n\\n\\n\\n## Merge Pull Requests\\n\\n\\n\\n[Needs Collaborator](#join-the-project-team): Committer\\n\\n\\n\\nTBD - need to hash out a bit more of this process.\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 27,\n \"score\": 32783.15027578887\n },\n {\n \"content\": \"### Further Enforcement\\n\\n\\n\\nIf you've already followed the [initial enforcement steps](#enforcement), these are the steps maintainers will take for further enforcement, as needed:\\n\\n\\n\\n 1. Repeat the request to stop.\\n\\n 2. If the person doubles down, they will have offending messages removed or edited by a maintainers given an official warning. The PR or Issue may be locked.\\n\\n 3. If the behavior continues or is repeated later, the person will be blocked from participating for 24 hours.\\n\\n 4. If the behavior continues or is repeated after the temporary block, a long-term (6-12mo) ban will be used.\\n\\n\\n\\nOn top of this, maintainers may remove any offending messages, images, contributions, etc, as they deem necessary.\\n\\n\\n\\nMaintainers reserve full rights to skip any of these steps, at their discretion, if the violation is considered to be a serious and/or immediate threat to the health and well-being of members of the community. These include any threats, serious physical or verbal attacks, and other such behavior that would be completely unacceptable in any social setting that puts our members at risk.\\n\\n\\n\\nMembers expelled from events or venues with any sort of paid attendance will not be refunded.\\n\\n\\n\\n### Who Watches the Watchers?\\n\\n\\n\\nMaintainers and other leaders who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership. These may include anything from removal from the maintainer team to a permanent ban from the community.\\n\\n\\n\\nAdditionally, as a project hosted on GitHub and part of the Rust community, [their own Codes of Conducts may be applied against maintainers of this project](#other-community-standards), externally of this project's procedures.\\n\\n\\n\\n### Enforcement Examples\\n\\n\\n\",\n \"file_path\": \"CODE_OF_CONDUCT.md\",\n \"rank\": 28,\n \"score\": 31883.534685339037\n },\n {\n \"content\": \"#### The Best Case\\n\\n\\n\\nThe vast majority of situations work out like this. This interaction is common, and generally positive.\\n\\n\\n\\n> Alex: \\\"Yeah I used X and it was retarded!\\\"\\n\\n\\n\\n> Patt (not a maintainer): \\\"Hey, could you not use that word? What about 'ridiculous' instead?\\\"\\n\\n\\n\\n> Alex: \\\"oh sorry, sure.\\\" -> edits old comment to say \\\"it was really confusing!\\\"\\n\\n\\n\\n#### The Maintainer Case\\n\\n\\n\\nSometimes, though, you need to get maintainers involved. Maintainers will do their best to resolve conflicts, but people who were harmed by something **will take priority**.\\n\\n\\n\\n> Patt: \\\"Honestly, sometimes I just really hate using $library and anyone who uses it probably sucks at their job.\\\"\\n\\n\\n\\n> Alex: \\\"Whoa there, could you dial it back a bit? There's a CoC thing about attacking folks' tech use like that.\\\"\\n\\n\\n\\n> Patt: \\\"I'm not attacking anyone, what's your problem?\\\"\\n\\n\\n\\n> Alex: \\\"@maintainers hey uh. Can someone look at this issue? Patt is getting a bit aggro. I tried to nudge them about it, but nope.\\\"\\n\\n\\n\\n> KeeperOfCommitBits: (on issue) \\\"Hey Patt, maintainer here. Could you tone it down? This sort of attack is really not okay in this space.\\\"\\n\\n\\n\\n> Patt: \\\"Leave me alone I haven't said anything bad wtf is wrong with you.\\\"\\n\\n\\n\\n> KeeperOfCommitBits: (deletes user's comment), \\\"@patt I mean it. Please refer to the CoC over at (URL to this CoC) if you have questions, but you can consider this an actual warning. I'd appreciate it if you reworded your messages in this thread, since they made folks there uncomfortable. Let's try and be kind, yeah?\\\"\\n\\n\\n\\n> Patt: \\\"@keeperofbits Okay sorry. I'm just frustrated and I'm kinda burnt out and I guess I got carried away. I'll DM Alex a note apologizing and edit my messages. Sorry for the trouble.\\\"\\n\\n\\n\\n> KeeperOfCommitBits: \\\"@patt Thanks for that. I hear you on the stress. Burnout sucks :/. Have a good one!\\\"\\n\\n\\n\",\n \"file_path\": \"CODE_OF_CONDUCT.md\",\n \"rank\": 29,\n \"score\": 31882.389222305297\n },\n {\n \"content\": \"## Our Standards\\n\\n\\n\\nExamples of behavior that contributes to creating a positive environment include:\\n\\n\\n\\n * Using welcoming and inclusive language.\\n\\n * Being respectful of differing viewpoints and experiences.\\n\\n * Gracefully accepting constructive feedback.\\n\\n * Focusing on what is best for the community.\\n\\n * Showing empathy and kindness towards other community members.\\n\\n * Encouraging and raising up your peers in the project so you can all bask in hacks and glory.\\n\\n\\n\\nExamples of unacceptable behavior by participants include:\\n\\n\\n\\n * The use of sexualized language or imagery and unwelcome sexual attention or advances, including when simulated online. The only exception to sexual topics is channels/spaces specifically for topics of sexual identity.\\n\\n * Trolling, insulting/derogatory comments, and personal or political attacks.\\n\\n * Public or private harassment, deliberate intimidation, or threats.\\n\\n * Publishing others' private information, such as a physical or electronic address, without explicit permission. This includes any sort of \\\"outing\\\" of any aspect of someone's identity without their consent.\\n\\n * Publishing private screenshots or quotes of interactions in the context of this project without all quoted users' *explicit* consent.\\n\\n * Publishing of private communication that doesn't have to do with reporting harrassment.\\n\\n * Any of the above even when [presented as \\\"ironic\\\" or \\\"joking\\\"](https://en.wikipedia.org/wiki/Hipster_racism).\\n\\n * Any attempt to present \\\"reverse-ism\\\" versions of the above as violations. Examples of reverse-isms are \\\"reverse racism\\\", \\\"reverse sexism\\\", \\\"heterophobia\\\", and \\\"cisphobia\\\".\\n\\n * Unsolicited explanations under the assumption that someone doesn't already know it. Ask before you teach! Don't assume what people's knowledge gaps are.\\n\\n * [Feigning or exaggerating surprise](https://www.recurse.com/manual#no-feigned-surprise) when someone admits to not knowing something.\\n\\n * \\\"[Well-actuallies](https://www.recurse.com/manual#no-well-actuallys)\\\"\\n\\n * Other conduct which could reasonably be considered inappropriate in a professional or community setting.\\n\\n\\n\",\n \"file_path\": \"CODE_OF_CONDUCT.md\",\n \"rank\": 30,\n \"score\": 31881.622338999852\n },\n {\n \"content\": \"#### The Nope Case\\n\\n\\n\\n> PepeTheFrog🐸: \\\"Hi, I am a literal actual nazi and I think white supremacists are quite fashionable.\\\"\\n\\n\\n\\n> Patt: \\\"NOOOOPE. OH NOPE NOPE.\\\"\\n\\n\\n\\n> Alex: \\\"JFC NO. NOPE. @keeperofbits NOPE NOPE LOOK HERE\\\"\\n\\n\\n\\n> KeeperOfCommitBits: \\\"👀 Nope. NOPE NOPE NOPE. 🔥\\\"\\n\\n\\n\\n> PepeTheFrog🐸 has been banned from all organization or user repositories belonging to KeeperOfCommitBits.\\n\\n\\n\\n## Attribution\\n\\n\\n\\nThis Code of Conduct was generated (and then adapted) using [WeAllJS Code of Conduct Generator](https://npm.im/weallbehave), which is based on the [WeAllJS Code of\\n\\nConduct](https://wealljs.org/code-of-conduct), which is itself based on\\n\\n[Contributor Covenant](http://contributor-covenant.org), version 1.4, available\\n\\nat\\n\\n[http://contributor-covenant.org/version/1/4](http://contributor-covenant.org/version/1/4),\\n\\nand the LGBTQ in Technology Slack [Code of\\n\\nConduct](http://lgbtq.technology/coc.html).\\n\",\n \"file_path\": \"CODE_OF_CONDUCT.md\",\n \"rank\": 31,\n \"score\": 31881.506536373923\n },\n {\n \"content\": \"# Code of Conduct\\n\\n\\n\\n## When Something Happens\\n\\n\\n\\nIf you see a Code of Conduct violation, follow these steps:\\n\\n\\n\\n1. Let the person know that what they did is not appropriate and ask them to stop and/or edit their message(s) or commits.\\n\\n2. That person should immediately stop the behavior and correct the issue.\\n\\n3. If this doesn’t happen, or if you're uncomfortable speaking up, [contact the maintainers](#contacting-maintainers).\\n\\n4. As soon as available, a maintainer will look into the issue, and take [further action (see below)](#further-enforcement), starting with a warning, then temporary block, then long-term repo or organization ban.\\n\\n\\n\\nWhen reporting, please include any relevant details, links, screenshots, context, or other information that may be used to better understand and resolve the situation.\\n\\n\\n\\n**The maintainer team will prioritize the well-being and comfort of the recipients of the violation over the comfort of the violator.** See [some examples below](#enforcement-examples).\\n\\n\\n\\n## Our Pledge\\n\\n\\n\\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers of this project pledge to making participation in our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, technical preferences, nationality, personal appearance, race, religion, or sexual identity and orientation.\\n\\n\\n\",\n \"file_path\": \"CODE_OF_CONDUCT.md\",\n \"rank\": 32,\n \"score\": 31881.34408844467\n },\n {\n \"content\": \"## Scope\\n\\n\\n\\nThis Code of Conduct applies both within spaces involving this project and in other spaces involving community members. This includes the repository, its Pull Requests and Issue tracker, its Twitter community, private email communications in the context of the project, and any events where members of the project are participating, as well as adjacent communities and venues affecting the project's members.\\n\\n\\n\\nDepending on the violation, the maintainers may decide that violations of this code of conduct that have happened outside of the scope of the community may deem an individual unwelcome, and take appropriate action to maintain the comfort and safety of its members.\\n\\n\\n\\n### Other Community Standards\\n\\n\\n\\nAs a project on GitHub, this project is additionally covered by the [GitHub Community Guidelines](https://help.github.com/articles/github-community-guidelines/).\\n\\n\\n\\nWhile not directly under the umbrella of the Rust Project, it is a part of the Rust community and [its Code of Conduct](https://www.rust-lang.org/conduct.html) may be applicable in some instances.\\n\\n\\n\\nEnforcement of those guidelines after violations overlapping with the above are the responsibility of the entities, and enforcement may happen in any or all of the services/communities.\\n\\n\\n\\n## Maintainer Enforcement Process\\n\\n\\n\\nOnce the maintainers get involved, they will follow a documented series of steps and do their best to preserve the well-being of project members. This section covers actual concrete steps.\\n\\n\\n\\n### Contacting Maintainers\\n\\n\\n\\nRefer to the GitHub repository for collaborator/maintainer information and email someone there.\\n\",\n \"file_path\": \"CODE_OF_CONDUCT.md\",\n \"rank\": 33,\n \"score\": 31880.129776642083\n },\n {\n \"content\": \"#[cfg(unix)]\\n\\n#[test]\\n\\nfn with_error() {\\n\\n let mut main = Command::cargo_bin(\\\"cargo-watch\\\")\\n\\n .unwrap()\\n\\n .stderr(Stdio::piped())\\n\\n .stdout(Stdio::piped())\\n\\n .args(&[\\n\\n \\\"--testing-only--once\\\",\\n\\n \\\"--no-gitignore\\\",\\n\\n \\\"--poll\\\",\\n\\n \\\"-w\\\",\\n\\n \\\"./tests/touchdata/\\\",\\n\\n \\\"-s\\\",\\n\\n \\\"echo with error\\\",\\n\\n \\\"-s\\\",\\n\\n \\\"false\\\",\\n\\n ])\\n\\n .spawn()\\n\\n .unwrap();\\n\\n\\n\\n sleep(Duration::from_millis(50));\\n\",\n \"file_path\": \"tests/echo.rs\",\n \"rank\": 34,\n \"score\": 26073.414122569295\n },\n {\n \"content\": \" .multiple(true)\\n\\n .empty_values(false)\\n\\n .min_values(1)\\n\\n .number_of_values(1)\\n\\n .default_value(\\\".\\\")\\n\\n .help(\\\"Watch specific file(s) or folder(s)\\\"),\\n\\n )\\n\\n .after_help(footnote.as_str()),\\n\\n );\\n\\n\\n\\n // Allow invocation of cargo-watch with both `cargo-watch watch ARGS`\\n\\n // (as invoked by cargo) and `cargo-watch ARGS`.\\n\\n let mut args: Vec<String> = env::args().collect();\\n\\n args.insert(1, \\\"watch\\\".into());\\n\\n\\n\\n let matches = match app.get_matches_from_safe_borrow(args) {\\n\\n Ok(matches) => matches,\\n\\n Err(err) => {\\n\\n match err.kind {\\n\\n ErrorKind::HelpDisplayed => {\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 35,\n \"score\": 25778.05766462906\n },\n {\n \"content\": \"use clap::{App, AppSettings, Arg, ArgMatches, ErrorKind, SubCommand};\\n\\nuse std::{env, process};\\n\\n\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 36,\n \"score\": 25776.31383421662\n },\n {\n \"content\": \" .help(\\\"Reserved for workspace support\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"poll\\\")\\n\\n .long(\\\"poll\\\")\\n\\n .help(\\\"Force use of polling for file changes\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"postpone\\\")\\n\\n .long(\\\"postpone\\\")\\n\\n .help(\\\"Postpone first run until a file changes\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"quiet\\\")\\n\\n .short(\\\"q\\\")\\n\\n .long(\\\"quiet\\\")\\n\\n .help(\\\"Suppress output from cargo-watch itself\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"cmd:cargo\\\")\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 37,\n \"score\": 25774.87072285329\n },\n {\n \"content\": \" .about(env!(\\\"CARGO_PKG_DESCRIPTION\\\"))\\n\\n .usage(\\\"cargo watch [FLAGS] [OPTIONS]\\\")\\n\\n .help_message(\\\"Display this message\\\")\\n\\n .version_message(\\\"Display version information\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"once\\\")\\n\\n .long(\\\"testing-only--once\\\")\\n\\n .hidden(true),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"clear\\\")\\n\\n .short(\\\"c\\\")\\n\\n .long(\\\"clear\\\")\\n\\n .help(\\\"Clear the screen before each run\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"debug\\\")\\n\\n .long(\\\"debug\\\")\\n\\n .help(\\\"Show debug output\\\"),\\n\\n )\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 38,\n \"score\": 25772.888259560805\n },\n {\n \"content\": \" .number_of_values(1)\\n\\n .help(\\\"Ignore a glob/gitignore-style pattern\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"packages:one\\\")\\n\\n .short(\\\"p\\\")\\n\\n .long(\\\"package\\\")\\n\\n .takes_value(true)\\n\\n .value_name(\\\"spec\\\")\\n\\n .multiple(true)\\n\\n .empty_values(false)\\n\\n .min_values(1)\\n\\n .hidden(true)\\n\\n .help(\\\"Reserved for workspace support\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"watch\\\")\\n\\n .short(\\\"w\\\")\\n\\n .long(\\\"watch\\\")\\n\\n .takes_value(true)\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 39,\n \"score\": 25770.896501443553\n },\n {\n \"content\": \" .arg(\\n\\n Arg::with_name(\\\"ignore-nothing\\\")\\n\\n .long(\\\"ignore-nothing\\\")\\n\\n .help(\\\"Ignore nothing, not even target/ and .git/\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"no-gitignore\\\")\\n\\n .long(\\\"no-gitignore\\\")\\n\\n .help(\\\"Don’t use .gitignore files\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"no-restart\\\")\\n\\n .long(\\\"no-restart\\\")\\n\\n .help(\\\"Don’t restart command while it’s still running\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"packages:all\\\")\\n\\n .long(\\\"all\\\")\\n\\n .conflicts_with(\\\"packages:one\\\")\\n\\n .hidden(true)\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 40,\n \"score\": 25770.505979650774\n },\n {\n \"content\": \" println!(\\\"{}\\\", err);\\n\\n process::exit(0);\\n\\n }\\n\\n\\n\\n ErrorKind::VersionDisplayed => {\\n\\n // Unlike HelpDisplayed, VersionDisplayed emits the output\\n\\n // by itself (clap-rs/clap#1390). It also does so without a\\n\\n // trailing newline, so we print one ourselves.\\n\\n println!();\\n\\n process::exit(0);\\n\\n }\\n\\n\\n\\n _ => app.get_matches(),\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n matches.subcommand.unwrap().matches\\n\\n}\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 41,\n \"score\": 25770.3671676793\n },\n {\n \"content\": \" .short(\\\"x\\\")\\n\\n .long(\\\"exec\\\")\\n\\n .takes_value(true)\\n\\n .value_name(\\\"cmd\\\")\\n\\n .multiple(true)\\n\\n .empty_values(false)\\n\\n .min_values(1)\\n\\n .number_of_values(1)\\n\\n .help(\\\"Cargo command(s) to execute on changes [default: check]\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"cmd:shell\\\")\\n\\n .short(\\\"s\\\")\\n\\n .long(\\\"shell\\\")\\n\\n .takes_value(true)\\n\\n .value_name(\\\"cmd\\\")\\n\\n .multiple(true)\\n\\n .empty_values(false)\\n\\n .min_values(1)\\n\\n .number_of_values(1)\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 42,\n \"score\": 25769.66813481263\n },\n {\n \"content\": \" .help(\\\"Shell command(s) to execute on changes\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"delay\\\")\\n\\n .short(\\\"d\\\")\\n\\n .long(\\\"delay\\\")\\n\\n .takes_value(true)\\n\\n .empty_values(false)\\n\\n .default_value(\\\"0.5\\\")\\n\\n .help(\\\"File updates debounce delay in seconds\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"ignore\\\")\\n\\n .short(\\\"i\\\")\\n\\n .long(\\\"ignore\\\")\\n\\n .takes_value(true)\\n\\n .value_name(\\\"pattern\\\")\\n\\n .multiple(true)\\n\\n .empty_values(false)\\n\\n .min_values(1)\\n\",\n \"file_path\": \"src/args.rs\",\n \"rank\": 43,\n \"score\": 25768.34318953137\n },\n {\n \"content\": \"//! Utilities for working with cargo and rust files\\n\\n\\n\\nuse std::env;\\n\\nuse std::fs;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n/// How many parent folders are searched for a `Cargo.toml`\\n\\nconst MAX_ANCESTORS: u32 = 10;\\n\\n\\n\\n/// Returns the closest ancestor path containing a `Cargo.toml`.\\n\\n///\\n\\n/// Returns `None` if no ancestor path contains a `Cargo.toml`, or if\\n\\n/// the limit of `MAX_ANCESTORS` ancestors has been reached.\\n\\n///\\n\\n/// TODO: #52 Parse toml to get to workspace root\\n\",\n \"file_path\": \"src/cargo.rs\",\n \"rank\": 44,\n \"score\": 23881.10575787579\n },\n {\n \"content\": \"use watchexec::{\\n\\n error::Result,\\n\\n pathop::PathOp,\\n\\n run::{ExecHandler, Handler},\\n\\n Args,\\n\\n};\\n\\n\\n\\npub struct CwHandler {\\n\\n cmd: String,\\n\\n once: bool,\\n\\n quiet: bool,\\n\\n inner: ExecHandler,\\n\\n}\\n\\n\\n\\nimpl Handler for CwHandler {\\n\\n fn args(&self) -> Args {\\n\\n self.inner.args()\\n\\n }\\n\\n\\n\\n fn on_manual(&self) -> Result<bool> {\\n\",\n \"file_path\": \"src/watch.rs\",\n \"rank\": 45,\n \"score\": 23728.954811474552\n },\n {\n \"content\": \" if self.once {\\n\\n Ok(true)\\n\\n } else {\\n\\n self.start();\\n\\n self.inner.on_manual()\\n\\n }\\n\\n }\\n\\n\\n\\n fn on_update(&self, ops: &[PathOp]) -> Result<bool> {\\n\\n self.start();\\n\\n self.inner.on_update(ops)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl CwHandler {\\n\\n pub fn new(mut args: Args, quiet: bool) -> Result<Self> {\\n\\n let cmd = args.cmd.join(\\\" && \\\");\\n\\n let mut final_cmd = cmd.clone();\\n\\n if !quiet {\\n\\n #[cfg(unix)]\\n\",\n \"file_path\": \"src/watch.rs\",\n \"rank\": 46,\n \"score\": 23722.136253996458\n },\n {\n \"content\": \" final_cmd.push_str(\\\"; echo [Finished running. Exit status: $?]\\\");\\n\\n #[cfg(windows)]\\n\\n final_cmd.push_str(\\\" & echo [Finished running. Exit status: %ERRORLEVEL%]\\\");\\n\\n #[cfg(not(any(unix, windows)))]\\n\\n final_cmd.push_str(\\\" ; echo [Finished running]\\\");\\n\\n // ^ could be wrong depending on the platform, to be fixed on demand\\n\\n }\\n\\n\\n\\n args.cmd = vec![final_cmd];\\n\\n\\n\\n Ok(Self {\\n\\n once: args.once,\\n\\n cmd,\\n\\n inner: ExecHandler::new(args)?,\\n\\n quiet,\\n\\n })\\n\\n }\\n\\n\\n\\n fn start(&self) {\\n\\n if !self.quiet {\\n\\n println!(\\\"[Running '{}']\\\", self.cmd);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/watch.rs\",\n \"rank\": 47,\n \"score\": 23719.72912772339\n },\n {\n \"content\": \"#[test]\\n\\nfn with_cargo() {\\n\\n let mut main = Command::new(\\\"cargo\\\")\\n\\n .stderr(Stdio::piped())\\n\\n .stdout(Stdio::piped())\\n\\n .args(&[\\\"watch\\\", \\\"--version\\\"])\\n\\n .spawn()\\n\\n .unwrap();\\n\\n\\n\\n if main.wait_timeout(Duration::from_secs(1)).unwrap().is_none() {\\n\\n main.kill().unwrap();\\n\\n }\\n\\n\\n\\n main.wait_with_output()\\n\\n .unwrap()\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(is_match(r\\\"cargo-watch \\\\d+\\\\.\\\\d+\\\\.\\\\d+\\\\n\\\").unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/exec.rs\",\n \"rank\": 48,\n \"score\": 22933.70043032941\n },\n {\n \"content\": \"#[test]\\n\\nfn without_cargo() {\\n\\n let mut main = Command::cargo_bin(\\\"cargo-watch\\\")\\n\\n .unwrap()\\n\\n .stderr(Stdio::piped())\\n\\n .stdout(Stdio::piped())\\n\\n .args(&[\\\"watch\\\", \\\"--version\\\"])\\n\\n .spawn()\\n\\n .unwrap();\\n\\n\\n\\n if main.wait_timeout(Duration::from_secs(1)).unwrap().is_none() {\\n\\n main.kill().unwrap();\\n\\n }\\n\\n\\n\\n main.wait_with_output()\\n\\n .unwrap()\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(is_match(r\\\"cargo-watch \\\\d+\\\\.\\\\d+\\\\.\\\\d+\\\\n\\\").unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/exec.rs\",\n \"rank\": 49,\n \"score\": 22063.279456901066\n },\n {\n \"content\": \"#[test]\\n\\nfn without_watch() {\\n\\n let mut main = Command::cargo_bin(\\\"cargo-watch\\\")\\n\\n .unwrap()\\n\\n .stderr(Stdio::piped())\\n\\n .stdout(Stdio::piped())\\n\\n .args(&[\\\"--version\\\"])\\n\\n .spawn()\\n\\n .unwrap();\\n\\n\\n\\n if main.wait_timeout(Duration::from_secs(1)).unwrap().is_none() {\\n\\n main.kill().unwrap();\\n\\n }\\n\\n\\n\\n main.wait_with_output()\\n\\n .unwrap()\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(is_match(r\\\"cargo-watch \\\\d+\\\\.\\\\d+\\\\.\\\\d+\\\\n\\\").unwrap());\\n\\n}\\n\",\n \"file_path\": \"tests/exec.rs\",\n \"rank\": 50,\n \"score\": 21916.569541898905\n },\n {\n \"content\": \"extern crate assert_cmd;\\n\\nextern crate cargo_watch;\\n\\nextern crate predicates;\\n\\nextern crate wait_timeout;\\n\\nextern crate watchexec;\\n\\n\\n\\nuse assert_cmd::prelude::*;\\n\\nuse predicates::str::is_match;\\n\\nuse std::{\\n\\n process::{Command, Stdio},\\n\\n time::Duration,\\n\\n};\\n\\nuse wait_timeout::ChildExt;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"tests/exec.rs\",\n \"rank\": 52,\n \"score\": 15.913362977949527\n },\n {\n \"content\": \"extern crate assert_cmd;\\n\\nextern crate cargo_watch;\\n\\n#[macro_use]\\n\\nextern crate insta;\\n\\nextern crate wait_timeout;\\n\\nextern crate watchexec;\\n\\n\\n\\nuse assert_cmd::prelude::*;\\n\\nuse std::{\\n\\n fs::OpenOptions,\\n\\n io,\\n\\n path::PathBuf,\\n\\n process::{Command, Stdio},\\n\\n thread::sleep,\\n\\n time::Duration,\\n\\n};\\n\\nuse wait_timeout::ChildExt;\\n\\n\\n\",\n \"file_path\": \"tests/echo.rs\",\n \"rank\": 53,\n \"score\": 15.52257259642404\n },\n {\n \"content\": \"//! Watch files in a Cargo project and compile it when they change\\n\\n#![forbid(unsafe_code, clippy::pedantic)]\\n\\n\\n\\nextern crate cargo_watch;\\n\\nextern crate watchexec;\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 54,\n \"score\": 14.527136378945944\n },\n {\n \"content\": \" touch(4).unwrap();\\n\\n\\n\\n if main\\n\\n .wait_timeout(Duration::from_secs(30))\\n\\n .unwrap()\\n\\n .is_none()\\n\\n {\\n\\n main.kill().unwrap();\\n\\n }\\n\\n\\n\\n assert_snapshot_matches!(\\\"with_error.stderr\\\", std_to_string(&mut main.stderr));\\n\\n assert_snapshot_matches!(\\\"with_error.stdout\\\", std_to_string(&mut main.stdout));\\n\\n}\\n\",\n \"file_path\": \"tests/echo.rs\",\n \"rank\": 55,\n \"score\": 2.8829744584738446\n }\n]","isConversational":false}}},{"rowIdx":1188,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"fastpay_core/src/authority.rs"},"repo_name":{"kind":"string","value":"mahimna-fb/fastpay"},"commit":{"kind":"string","value":"413826688d365ad597acb002213704378e9b2efc"},"file_code":{"kind":"string","value":"\n\nuse crate::{base_types::*, committee::Committee, error::FastPayError, messages::*};\nuse std::{collections::BTreeMap, convert::TryInto};\n\n#[cfg(test)]\n#[path = \"unit_tests/authority_tests.rs\"]\nmod authority_tests;\n\n#[derive(Eq, PartialEq, Debug)]\npub struct AccountOffchainState {\n \n pub balance: Balance,\n \n pub next_sequence_number: SequenceNumber,\n \n pub pending_confirmation: Option<SignedTransferOrder>,\n \n pub confirmed_log: Vec<CertifiedTransferOrder>,\n \n pub synchronization_log: Vec<PrimarySynchronizationOrder>,\n \n pub received_log: Vec<CertifiedTransferOrder>,\n}\n\npub struct AuthorityState {\n \n pub name: AuthorityName,\n \n pub committee: Committee,\n \n pub secret: SecretKey,\n \n pub accounts: BTreeMap<FastPayAddress, AccountOffchainState>,\n \n pub last_transaction_index: VersionNumber,\n \n pub shard_id: ShardId,\n \n pub number_of_shards: u32,\n}\n\npub trait Authority {\n \n fn handle_transfer_order(\n &mut self,\n order: TransferOrder,\n ) -> Result<AccountInfoResponse, FastPayError>;\n\n \n fn handle_confirmation_order(\n &mut self,\n order: ConfirmationOrder,\n ) -> Result<(AccountInfoResponse, Option<CrossShardUpdate>), FastPayError>;\n\n \n fn handle_primary_synchronization_order(\n &mut self,\n order: PrimarySynchronizationOrder,\n ) -> Result<AccountInfoResponse, FastPayError>;\n\n \n fn handle_account_info_request(\n &self,\n request: AccountInfoRequest,\n ) -> Result<AccountInfoResponse, FastPayError>;\n\n \n \n fn handle_cross_shard_recipient_commit(\n &mut self,\n certificate: CertifiedTransferOrder,\n ) -> Result<(), FastPayError>;\n}\n\nimpl Authority for AuthorityState {\n \n fn handle_transfer_order(\n &mut self,\n order: TransferOrder,\n ) -> Result<AccountInfoResponse, FastPayError> {\n \n fp_ensure!(\n self.in_shard(&order.transfer.sender),\n FastPayError::WrongShard\n );\n order.check_signature()?;\n let transfer = &order.transfer;\n let sender = transfer.sender;\n fp_ensure!(\n transfer.sequence_number <= SequenceNumber::max(),\n FastPayError::InvalidSequenceNumber\n );\n fp_ensure!(\n transfer.amount > Amount::zero(),\n FastPayError::IncorrectTransferAmount\n );\n match self.accounts.get_mut(&sender) {\n None => fp_bail!(FastPayError::UnknownSenderAccount),\n Some(account) => {\n if let Some(pending_confirmation) = &account.pending_confirmation {\n fp_ensure!(\n &pending_confirmation.value.transfer == transfer,\n FastPayError::PreviousTransferMustBeConfirmedFirst {\n pending_confirmation: pending_confirmation.value.clone()\n }\n );\n \n return Ok(account.make_account_info(sender));\n }\n fp_ensure!(\n account.next_sequence_number == transfer.sequence_number,\n FastPayError::UnexpectedSequenceNumber\n );\n fp_ensure!(\n account.balance >= transfer.amount.into(),\n FastPayError::InsufficientFunding {\n current_balance: account.balance\n }\n );\n let signed_order = SignedTransferOrder::new(order, self.name, &self.secret);\n account.pending_confirmation = Some(signed_order);\n Ok(account.make_account_info(sender))\n }\n }\n }\n\n \n fn handle_confirmation_order(\n &mut self,\n confirmation_order: ConfirmationOrder,\n ) -> Result<(AccountInfoResponse, Option<CrossShardUpdate>), FastPayError> {\n let certificate = confirmation_order.transfer_certificate;\n \n fp_ensure!(\n self.in_shard(&certificate.value.transfer.sender),\n FastPayError::WrongShard\n );\n certificate.check(&self.committee)?;\n let transfer = certificate.value.transfer.clone();\n\n \n let mut sender_account = self\n .accounts\n .entry(transfer.sender)\n .or_insert_with(AccountOffchainState::new);\n let mut sender_sequence_number = sender_account.next_sequence_number;\n let mut sender_balance = sender_account.balance;\n\n \n if sender_sequence_number < transfer.sequence_number {\n fp_bail!(FastPayError::MissingEalierConfirmations {\n current_sequence_number: sender_sequence_number\n });\n }\n if sender_sequence_number > transfer.sequence_number {\n \n return Ok((sender_account.make_account_info(transfer.sender), None));\n }\n sender_balance = sender_balance.try_sub(transfer.amount.into())?;\n sender_sequence_number = sender_sequence_number.increment()?;\n\n \n sender_account.balance = sender_balance;\n sender_account.next_sequence_number = sender_sequence_number;\n sender_account.pending_confirmation = None;\n sender_account.confirmed_log.push(certificate.clone());\n let info = sender_account.make_account_info(transfer.sender);\n\n \n let recipient = match transfer.recipient {\n Address::FastPay(recipient) => recipient,\n Address::Primary(_) => {\n \n return Ok((info, None));\n }\n };\n \n if self.in_shard(&recipient) {\n let recipient_account = self\n .accounts\n .entry(recipient)\n .or_insert_with(AccountOffchainState::new);\n recipient_account.balance = recipient_account\n .balance\n .try_add(transfer.amount.into())\n .unwrap_or_else(|_| Balance::max());\n recipient_account.received_log.push(certificate);\n \n return Ok((info, None));\n }\n \n let cross_shard = Some(CrossShardUpdate {\n shard_id: self.which_shard(&recipient),\n transfer_certificate: certificate,\n });\n Ok((info, cross_shard))\n }\n\n \n fn handle_cross_shard_recipient_commit(\n &mut self,\n certificate: CertifiedTransferOrder,\n ) -> Result<(), FastPayError> {\n \n let transfer = &certificate.value.transfer;\n\n let recipient = match transfer.recipient {\n Address::FastPay(recipient) => recipient,\n Address::Primary(_) => {\n fp_bail!(FastPayError::InvalidCrossShardUpdate);\n }\n };\n fp_ensure!(self.in_shard(&recipient), FastPayError::WrongShard);\n let recipient_account = self\n .accounts\n .entry(recipient)\n .or_insert_with(AccountOffchainState::new);\n recipient_account.balance = recipient_account\n .balance\n .try_add(transfer.amount.into())\n .unwrap_or_else(|_| Balance::max());\n recipient_account.received_log.push(certificate);\n Ok(())\n }\n\n \n fn handle_primary_synchronization_order(\n &mut self,\n order: PrimarySynchronizationOrder,\n ) -> Result<AccountInfoResponse, FastPayError> {\n \n let recipient = order.recipient;\n fp_ensure!(self.in_shard(&recipient), FastPayError::WrongShard);\n\n let recipient_account = self\n .accounts\n .entry(recipient)\n .or_insert_with(AccountOffchainState::new);\n if order.transaction_index <= self.last_transaction_index {\n \n return Ok(recipient_account.make_account_info(recipient));\n }\n fp_ensure!(\n order.transaction_index == self.last_transaction_index.increment()?,\n FastPayError::UnexpectedTransactionIndex\n );\n let recipient_balance = recipient_account.balance.try_add(order.amount.into())?;\n let last_transaction_index = self.last_transaction_index.increment()?;\n recipient_account.balance = recipient_balance;\n recipient_account.synchronization_log.push(order);\n self.last_transaction_index = last_transaction_index;\n Ok(recipient_account.make_account_info(recipient))\n }\n\n fn handle_account_info_request(\n &self,\n request: AccountInfoRequest,\n ) -> Result<AccountInfoResponse, FastPayError> {\n fp_ensure!(self.in_shard(&request.sender), FastPayError::WrongShard);\n let account = self.account_state(&request.sender)?;\n let mut response = account.make_account_info(request.sender);\n if let Some(seq) = request.request_sequence_number {\n if let Some(cert) = account.confirmed_log.get(usize::from(seq)) {\n response.requested_certificate = Some(cert.clone());\n } else {\n fp_bail!(FastPayError::CertificateNotfound)\n }\n }\n if let Some(idx) = request.request_received_transfers_excluding_first_nth {\n response.requested_received_transfers = account.received_log[idx..].to_vec();\n }\n Ok(response)\n }\n}\n\nimpl Default for AccountOffchainState {\n fn default() -> Self {\n Self {\n balance: Balance::zero(),\n next_sequence_number: SequenceNumber::new(),\n pending_confirmation: None,\n confirmed_log: Vec::new(),\n synchronization_log: Vec::new(),\n received_log: Vec::new(),\n }\n }\n}\n\nimpl AccountOffchainState {\n pub fn new() -> Self {\n Self::default()\n }\n\n fn make_account_info(&self, sender: FastPayAddress) -> AccountInfoResponse {\n AccountInfoResponse {\n sender,\n balance: self.balance,\n next_sequence_number: self.next_sequence_number,\n pending_confirmation: self.pending_confirmation.clone(),\n requested_certificate: None,\n requested_received_transfers: Vec::new(),\n }\n }\n\n #[cfg(test)]\n pub fn new_with_balance(balance: Balance, received_log: Vec<CertifiedTransferOrder>) -> Self {\n Self {\n balance,\n next_sequence_number: SequenceNumber::new(),\n pending_confirmation: None,\n confirmed_log: Vec::new(),\n synchronization_log: Vec::new(),\n received_log,\n }\n }\n}\n\nimpl AuthorityState {\n pub fn new(committee: Committee, name: AuthorityName, secret: SecretKey) -> Self {\n AuthorityState {\n committee,\n name,\n secret,\n accounts: BTreeMap::new(),\n last_transaction_index: VersionNumber::new(),\n shard_id: 0,\n number_of_shards: 1,\n }\n }\n\n pub fn new_shard(\n committee: Committee,\n name: AuthorityName,\n secret: SecretKey,\n shard_id: u32,\n number_of_shards: u32,\n ) -> Self {\n AuthorityState {\n committee,\n name,\n secret,\n accounts: BTreeMap::new(),\n last_transaction_index: VersionNumber::new(),\n shard_id,\n number_of_shards,\n }\n }\n\n pub fn in_shard(&self, address: &FastPayAddress) -> bool {\n self.which_shard(address) == self.shard_id\n }\n\n pub fn get_shard(num_shards: u32, address: &FastPayAddress) -> u32 {\n const LAST_INTEGER_INDEX: usize = std::mem::size_of::<FastPayAddress>() - 4;\n u32::from_le_bytes(address.0[LAST_INTEGER_INDEX..].try_into().expect(\"4 bytes\"))\n % num_shards\n }\n\n pub fn which_shard(&self, address: &FastPayAddress) -> u32 {\n Self::get_shard(self.number_of_shards, address)\n }\n\n fn account_state(\n &self,\n address: &FastPayAddress,\n ) -> Result<&AccountOffchainState, FastPayError> {\n self.accounts\n .get(address)\n .ok_or(FastPayError::UnknownSenderAccount)\n }\n\n #[cfg(test)]\n pub fn accounts_mut(&mut self) -> &mut BTreeMap<FastPayAddress, AccountOffchainState> {\n &mut self.accounts\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::{base_types::*, committee::Committee, error::FastPayError, messages::*};\nuse std::{collections::BTreeMap, convert::TryInto};\n\n#[cfg(test)]\n#[path = \"unit_tests/authority_tests.rs\"]\nmod authority_tests;\n\n#[derive(Eq, PartialEq, Debug)]\npub struct AccountOffchainState {\n \n pub balance: Balance,\n \n pub next_sequence_number: SequenceNumber,\n \n pub pending_confirmation: Option<SignedTransferOrder>,\n \n pub confirmed_log: Vec<CertifiedTransferOrder>,\n \n pub synchronization_log: Vec<PrimarySynchronizationOrder>,\n \n pub received_log: Vec<CertifiedTransferOrder>,\n}\n\npub struct AuthorityState {\n \n pub name: AuthorityName,\n \n pub committee: Committee,\n \n pub secret: SecretKey,\n \n pub accounts: BTreeMap<FastPayAddress, AccountOffchainState>,\n \n pub last_transaction_index: VersionNumber,\n \n pub shard_id: ShardId,\n \n pub number_of_shards: u32,\n}\n\npub trait Authority {\n \n fn handle_transfer_order(\n &mut self,\n order: TransferOrder,\n ) -> Result<AccountInfoResponse, FastPayError>;\n\n \n fn handle_confirmation_order(\n &mut self,\n order: ConfirmationOrder,\n ) -> Result<(AccountInfoResponse, Option<CrossShardUpdate>), FastPayError>;\n\n \n fn handle_primary_synchronization_order(\n &mut self,\n order: PrimarySynchronizationOrder,\n ) -> Result<AccountInfoResponse, FastPayError>;\n\n \n fn handle_account_info_request(\n &self,\n request: AccountInfoRequest,\n ) -> Result<AccountInfoResponse, FastPayError>;\n\n \n \n fn handle_cross_shard_recipient_commit(\n &mut self,\n certificate: CertifiedTransferOrder,\n ) -> Result<(), FastPayError>;\n}\n\nimpl Authority for AuthorityState {\n \n fn handle_transfer_order(\n &mut self,\n order: TransferOrder,\n ) -> Result<AccountInfoResponse, FastPayError> {\n \n fp_ensure!(\n self.in_shard(&order.transfer.sender),\n FastPayError::WrongShard\n );\n order.check_signature()?;\n let transfer = &order.transfer;\n let sender = transfer.sender;\n fp_ensure!(\n transfer.sequence_number <= SequenceNumber::max(),\n FastPayError::InvalidSequenceNumber\n );\n fp_ensure!(\n transfer.amount > Amount::zero(),\n FastPayError::IncorrectTransferAmount\n );\n match self.accounts.get_mut(&sender) {\n None => fp_bail!(FastPayError::UnknownSenderAccount),\n Some(account) => {\n if let Some(pending_confirmation) = &account.pending_confirmation {\n fp_ensure!(\n &pending_confirmation.value.transfer == transfer,\n FastPayError::PreviousTransferMustBeConfirmedFirst {\n pending_confirmation: pending_confirmation.value.clone()\n }\n );\n \n return Ok(account.make_account_info(sender));\n }\n fp_ensure!(\n account.next_sequence_number == transfer.sequence_number,\n FastPayError::UnexpectedSequenceNumber\n );\n fp_ensure!(\n account.balance >= transfer.amount.into(),\n FastPayError::InsufficientFunding {\n current_balance: account.balance\n }\n );\n let signed_order = SignedTransferOrder::new(order, self.name, &self.secret);\n account.pending_confirmation = Some(signed_order);\n Ok(account.make_account_info(sender))\n }\n }\n }\n\n \n fn handle_confirmation_order(\n &mut self,\n confirmation_order: ConfirmationOrder,\n ) -> Result<(AccountInfoResponse, Option<CrossShardUpdate>), FastPayError> {\n let certificate = confirmation_order.transfer_certificate;\n \n fp_ensure!(\n self.in_shard(&certificate.value.transfer.sender),\n FastPayError::WrongShard\n );\n certificate.check(&self.committee)?;\n let transfer = certificate.value.transfer.clone();\n\n \n let mut sender_account = self\n .accounts\n .entry(transfer.sender)\n .or_insert_with(AccountOffchainState::new);\n let mut sender_sequence_number = sender_account.next_sequence_number;\n let mut sender_balance = sender_account.balance;\n\n \n if sender_sequence_number < transfer.sequence_number {\n fp_bail!(FastPayError::MissingEalierConfirmations {\n current_sequence_number: sender_sequence_number\n });\n }\n if sender_sequence_number > transfer.sequence_number {\n \n return Ok((sender_account.make_account_info(transfer.sender), None));\n }\n sender_balance = sender_balance.try_sub(transfer.amount.into())?;\n sender_sequence_number = sender_sequence_number.increment()?;\n\n \n sender_account.balance = sender_balance;\n sender_account.next_sequence_number = sender_sequence_number;\n sender_account.pending_confirmation = None;\n sender_account.confirmed_log.push(certificate.clone());\n let info = sender_account.make_account_info(transfer.sender);\n\n \n let recipient = match transfer.recipient {\n Address::FastPay(recipient) => recipient,\n Address::Primary(_) => {\n \n return Ok((info, None));\n }\n };\n \n if self.in_shard(&recipient) {\n let recipient_account = self\n .accounts\n .entry(recipient)\n .or_insert_with(AccountOffchainState::new);\n recipient_account.balance = recipient_account\n .balance\n .try_add(transfer.amount.into())\n .unwrap_or_else(|_| Balance::max());\n recipient_account.received_log.push(certificate);\n \n return Ok((info, None));\n }\n \n let cross_shard = Some(CrossShardUpdate {\n shard_id: self.which_shard(&recipient),\n transfer_certificate: certificate,\n });\n Ok((info, cross_shard))\n }\n\n \n fn handle_cross_shard_recipient_commit(\n &mut self,\n "},"suffix":{"kind":"string","value":" requested_certificate: None,\n requested_received_transfers: Vec::new(),\n }\n }\n\n #[cfg(test)]\n pub fn new_with_balance(balance: Balance, received_log: Vec<CertifiedTransferOrder>) -> Self {\n Self {\n balance,\n next_sequence_number: SequenceNumber::new(),\n pending_confirmation: None,\n confirmed_log: Vec::new(),\n synchronization_log: Vec::new(),\n received_log,\n }\n }\n}\n\nimpl AuthorityState {\n pub fn new(committee: Committee, name: AuthorityName, secret: SecretKey) -> Self {\n AuthorityState {\n committee,\n name,\n secret,\n accounts: BTreeMap::new(),\n last_transaction_index: VersionNumber::new(),\n shard_id: 0,\n number_of_shards: 1,\n }\n }\n\n pub fn new_shard(\n committee: Committee,\n name: AuthorityName,\n secret: SecretKey,\n shard_id: u32,\n number_of_shards: u32,\n ) -> Self {\n AuthorityState {\n committee,\n name,\n secret,\n accounts: BTreeMap::new(),\n last_transaction_index: VersionNumber::new(),\n shard_id,\n number_of_shards,\n }\n }\n\n pub fn in_shard(&self, address: &FastPayAddress) -> bool {\n self.which_shard(address) == self.shard_id\n }\n\n pub fn get_shard(num_shards: u32, address: &FastPayAddress) -> u32 {\n const LAST_INTEGER_INDEX: usize = std::mem::size_of::<FastPayAddress>() - 4;\n u32::from_le_bytes(address.0[LAST_INTEGER_INDEX..].try_into().expect(\"4 bytes\"))\n % num_shards\n }\n\n pub fn which_shard(&self, address: &FastPayAddress) -> u32 {\n Self::get_shard(self.number_of_shards, address)\n }\n\n fn account_state(\n &self,\n address: &FastPayAddress,\n ) -> Result<&AccountOffchainState, FastPayError> {\n self.accounts\n .get(address)\n .ok_or(FastPayError::UnknownSenderAccount)\n }\n\n #[cfg(test)]\n pub fn accounts_mut(&mut self) -> &mut BTreeMap<FastPayAddress, AccountOffchainState> {\n &mut self.accounts\n }\n}\n"},"middle":{"kind":"string","value":" certificate: CertifiedTransferOrder,\n ) -> Result<(), FastPayError> {\n \n let transfer = &certificate.value.transfer;\n\n let recipient = match transfer.recipient {\n Address::FastPay(recipient) => recipient,\n Address::Primary(_) => {\n fp_bail!(FastPayError::InvalidCrossShardUpdate);\n }\n };\n fp_ensure!(self.in_shard(&recipient), FastPayError::WrongShard);\n let recipient_account = self\n .accounts\n .entry(recipient)\n .or_insert_with(AccountOffchainState::new);\n recipient_account.balance = recipient_account\n .balance\n .try_add(transfer.amount.into())\n .unwrap_or_else(|_| Balance::max());\n recipient_account.received_log.push(certificate);\n Ok(())\n }\n\n \n fn handle_primary_synchronization_order(\n &mut self,\n order: PrimarySynchronizationOrder,\n ) -> Result<AccountInfoResponse, FastPayError> {\n \n let recipient = order.recipient;\n fp_ensure!(self.in_shard(&recipient), FastPayError::WrongShard);\n\n let recipient_account = self\n .accounts\n .entry(recipient)\n .or_insert_with(AccountOffchainState::new);\n if order.transaction_index <= self.last_transaction_index {\n \n return Ok(recipient_account.make_account_info(recipient));\n }\n fp_ensure!(\n order.transaction_index == self.last_transaction_index.increment()?,\n FastPayError::UnexpectedTransactionIndex\n );\n let recipient_balance = recipient_account.balance.try_add(order.amount.into())?;\n let last_transaction_index = self.last_transaction_index.increment()?;\n recipient_account.balance = recipient_balance;\n recipient_account.synchronization_log.push(order);\n self.last_transaction_index = last_transaction_index;\n Ok(recipient_account.make_account_info(recipient))\n }\n\n fn handle_account_info_request(\n &self,\n request: AccountInfoRequest,\n ) -> Result<AccountInfoResponse, FastPayError> {\n fp_ensure!(self.in_shard(&request.sender), FastPayError::WrongShard);\n let account = self.account_state(&request.sender)?;\n let mut response = account.make_account_info(request.sender);\n if let Some(seq) = request.request_sequence_number {\n if let Some(cert) = account.confirmed_log.get(usize::from(seq)) {\n response.requested_certificate = Some(cert.clone());\n } else {\n fp_bail!(FastPayError::CertificateNotfound)\n }\n }\n if let Some(idx) = request.request_received_transfers_excluding_first_nth {\n response.requested_received_transfers = account.received_log[idx..].to_vec();\n }\n Ok(response)\n }\n}\n\nimpl Default for AccountOffchainState {\n fn default() -> Self {\n Self {\n balance: Balance::zero(),\n next_sequence_number: SequenceNumber::new(),\n pending_confirmation: None,\n confirmed_log: Vec::new(),\n synchronization_log: Vec::new(),\n received_log: Vec::new(),\n }\n }\n}\n\nimpl AccountOffchainState {\n pub fn new() -> Self {\n Self::default()\n }\n\n fn make_account_info(&self, sender: FastPayAddress) -> AccountInfoResponse {\n AccountInfoResponse {\n sender,\n balance: self.balance,\n next_sequence_number: self.next_sequence_number,\n pending_confirmation: self.pending_confirmation.clone(),\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn serialize_info_request(value: &AccountInfoRequest) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::InfoReq(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":0,"score":194362.98059485495},{"content":"pub fn serialize_transfer_order_into<W>(\n\n writer: W,\n\n value: &TransferOrder,\n\n) -> Result<(), failure::Error>\n\nwhere\n\n W: std::io::Write,\n\n{\n\n serialize_into(writer, &ShallowSerializedMessage::Order(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":1,"score":157893.60208946266},{"content":"pub fn serialize_transfer_order(value: &TransferOrder) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::Order(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":3,"score":154285.15679357952},{"content":"#[test]\n\nfn test_handle_transfer_order_unknown_sender() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\n\n let (unknown_address, unknown_key) = get_key_pair();\n\n\n\n let mut unknown_sender_transfer = transfer_order.transfer;\n\n unknown_sender_transfer.sender = unknown_address;\n\n let unknown_sender_transfer_order = TransferOrder::new(unknown_sender_transfer, &unknown_key);\n\n assert!(authority_state\n\n .handle_transfer_order(unknown_sender_transfer_order)\n\n .is_err());\n\n assert!(authority_state\n\n .accounts\n\n .get(&sender)\n\n .unwrap()\n\n .pending_confirmation\n\n .is_none());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":4,"score":153592.5007522364},{"content":"#[test]\n\nfn test_handle_transfer_order_exceed_balance() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(1000));\n\n assert!(authority_state\n\n .handle_transfer_order(transfer_order)\n\n .is_err());\n\n assert!(authority_state\n\n .accounts\n\n .get(&sender)\n\n .unwrap()\n\n .pending_confirmation\n\n .is_none());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":5,"score":153527.35173890644},{"content":"pub fn serialize_vote_into<W>(writer: W, value: &SignedTransferOrder) -> Result<(), failure::Error>\n\nwhere\n\n W: std::io::Write,\n\n{\n\n serialize_into(writer, &ShallowSerializedMessage::Vote(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":6,"score":151376.43877805182},{"content":"/// The underlying data-fetching mechanism to be provided by the user.\n\npub trait Requester {\n\n type Key: std::cmp::Ord + Send + Sync + Clone + 'static;\n\n type Value: std::fmt::Debug + Send + Clone + 'static;\n\n\n\n /// Request the value corresponding to the given key.\n\n fn query(&mut self, key: Self::Key) -> future::BoxFuture<Self::Value>;\n\n}\n\n\n\n/// Channel for using code to send requests and stop the downloader task.\n\n#[derive(Clone)]\n\npub struct DownloadHandle<K, V>(mpsc::UnboundedSender<DownloadCommand<K, V>>);\n\n\n","file_path":"fastpay_core/src/downloader.rs","rank":7,"score":147933.240499813},{"content":"/// The handler required to create a service.\n\npub trait MessageHandler {\n\n fn handle_message<'a>(&'a mut self, buffer: &'a [u8])\n\n -> future::BoxFuture<'a, Option<Vec<u8>>>;\n\n}\n\n\n\n/// The result of spawning a server is oneshot channel to kill it and a handle to track completion.\n\npub struct SpawnedServer {\n\n complete: futures::channel::oneshot::Sender<()>,\n\n handle: tokio::task::JoinHandle<Result<(), std::io::Error>>,\n\n}\n\n\n\nimpl SpawnedServer {\n\n pub async fn join(self) -> Result<(), std::io::Error> {\n\n // Note that dropping `self.complete` would terminate the server.\n\n self.handle.await??;\n\n Ok(())\n\n }\n\n\n\n pub async fn kill(self) -> Result<(), std::io::Error> {\n\n self.complete.send(()).unwrap();\n","file_path":"fastpay/src/transport.rs","rank":8,"score":147642.62443053542},{"content":"pub fn deserialize_message<R>(reader: R) -> Result<SerializedMessage, failure::Error>\n\nwhere\n\n R: std::io::Read,\n\n{\n\n bincode::deserialize_from(reader).map_err(|err| format_err!(\"{}\", err))\n\n}\n","file_path":"fastpay_core/src/serialize.rs","rank":9,"score":145995.2734671379},{"content":"pub trait AuthorityClient {\n\n /// Initiate a new transfer to a FastPay or Primary account.\n\n fn handle_transfer_order(\n\n &mut self,\n\n order: TransferOrder,\n\n ) -> AsyncResult<AccountInfoResponse, FastPayError>;\n\n\n\n /// Confirm a transfer to a FastPay or Primary account.\n\n fn handle_confirmation_order(\n\n &mut self,\n\n order: ConfirmationOrder,\n\n ) -> AsyncResult<AccountInfoResponse, FastPayError>;\n\n\n\n /// Handle information requests for this account.\n\n fn handle_account_info_request(\n\n &mut self,\n\n request: AccountInfoRequest,\n\n ) -> AsyncResult<AccountInfoResponse, FastPayError>;\n\n}\n\n\n","file_path":"fastpay_core/src/client.rs","rank":10,"score":143749.28027373744},{"content":"pub fn serialize_info_response(value: &AccountInfoResponse) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::InfoResp(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":11,"score":141705.35152617618},{"content":"#[cfg(test)]\n\nfn init_transfer_order(\n\n sender: FastPayAddress,\n\n secret: &SecretKey,\n\n recipient: Address,\n\n amount: Amount,\n\n) -> TransferOrder {\n\n let transfer = Transfer {\n\n sender,\n\n recipient,\n\n amount,\n\n sequence_number: SequenceNumber::new(),\n\n user_data: UserData::default(),\n\n };\n\n TransferOrder::new(transfer, &secret)\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":12,"score":137332.08736607034},{"content":"pub fn serialize_vote(value: &SignedTransferOrder) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::Vote(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":13,"score":133899.66218099496},{"content":"pub fn serialize_cert(value: &CertifiedTransferOrder) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::Cert(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":14,"score":133899.66218099496},{"content":"#[cfg(test)]\n\nfn init_certified_transfer_order(\n\n sender: FastPayAddress,\n\n secret: &SecretKey,\n\n recipient: Address,\n\n amount: Amount,\n\n authority_state: &AuthorityState,\n\n) -> CertifiedTransferOrder {\n\n let transfer_order = init_transfer_order(sender, secret, recipient, amount);\n\n let vote = SignedTransferOrder::new(\n\n transfer_order.clone(),\n\n authority_state.name,\n\n &authority_state.secret,\n\n );\n\n let mut builder =\n\n SignatureAggregator::try_new(transfer_order, &authority_state.committee).unwrap();\n\n builder\n\n .append(vote.authority, vote.signature)\n\n .unwrap()\n\n .unwrap()\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":15,"score":133879.92879010906},{"content":"pub fn get_key_pair() -> (FastPayAddress, SecretKey) {\n\n let mut csprng = OsRng;\n\n let keypair = dalek::Keypair::generate(&mut csprng);\n\n (\n\n EdPublicKeyBytes(keypair.public.to_bytes()),\n\n SecretKey(keypair.to_bytes()),\n\n )\n\n}\n\n\n","file_path":"fastpay_core/src/base_types.rs","rank":16,"score":133016.43165214764},{"content":"pub fn serialize_cross_shard(value: &CertifiedTransferOrder) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::CrossShard(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":17,"score":131006.42165221006},{"content":"#[test]\n\nfn test_handle_transfer_order_ok() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\n\n\n\n let account_info = authority_state\n\n .handle_transfer_order(transfer_order)\n\n .unwrap();\n\n let pending_confirmation = authority_state\n\n .accounts\n\n .get(&sender)\n\n .unwrap()\n\n .pending_confirmation\n\n .clone()\n\n .unwrap();\n\n assert_eq!(\n\n account_info.pending_confirmation.unwrap(),\n\n pending_confirmation\n\n );\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":18,"score":130634.95038400369},{"content":"#[cfg(test)]\n\npub fn dbg_addr(name: u8) -> FastPayAddress {\n\n let addr = [name; dalek::PUBLIC_KEY_LENGTH];\n\n EdPublicKeyBytes(addr)\n\n}\n\n\n\n// TODO: Remove Eq, PartialEq, Ord, PartialOrd and Hash from signatures.\n\n#[derive(Eq, PartialEq, Ord, PartialOrd, Copy, Clone, Hash, Serialize, Deserialize)]\n\npub struct Signature {\n\n pub part1: [u8; dalek::SIGNATURE_LENGTH / 2],\n\n pub part2: [u8; dalek::SIGNATURE_LENGTH / 2],\n\n}\n\n\n\n// Zero the secret key when unallocating.\n\nimpl Drop for SecretKey {\n\n fn drop(&mut self) {\n\n for i in 0..dalek::KEYPAIR_LENGTH {\n\n self.0[i] = 0;\n\n }\n\n }\n\n}\n","file_path":"fastpay_core/src/base_types.rs","rank":19,"score":129913.04456752786},{"content":"#[test]\n\nfn test_handle_confirmation_order_unknown_sender() {\n\n let recipient = dbg_addr(2);\n\n let (sender, sender_key) = get_key_pair();\n\n let mut authority_state = init_state();\n\n let certified_transfer_order = init_certified_transfer_order(\n\n sender,\n\n &sender_key,\n\n Address::FastPay(recipient),\n\n Amount::from(5),\n\n &authority_state,\n\n );\n\n\n\n assert!(authority_state\n\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\n\n .is_ok());\n\n assert!(authority_state.accounts.get(&recipient).is_some());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":20,"score":127810.01687466819},{"content":"#[test]\n\nfn test_handle_confirmation_order_exceed_balance() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = dbg_addr(2);\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n\n\n let certified_transfer_order = init_certified_transfer_order(\n\n sender,\n\n &sender_key,\n\n Address::FastPay(recipient),\n\n Amount::from(1000),\n\n &authority_state,\n\n );\n\n assert!(authority_state\n\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\n\n .is_ok());\n\n let new_account = authority_state.accounts.get(&sender).unwrap();\n\n assert_eq!(Balance::from(-995), new_account.balance);\n\n assert_eq!(SequenceNumber::from(1), new_account.next_sequence_number);\n\n assert_eq!(new_account.confirmed_log.len(), 1);\n\n assert!(authority_state.accounts.get(&recipient).is_some());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":21,"score":127744.86786133825},{"content":"#[test]\n\nfn test_handle_transfer_order_zero_amount() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\n\n\n\n // test transfer non-positive amount\n\n let mut zero_amount_transfer = transfer_order.transfer;\n\n zero_amount_transfer.amount = Amount::zero();\n\n let zero_amount_transfer_order = TransferOrder::new(zero_amount_transfer, &sender_key);\n\n assert!(authority_state\n\n .handle_transfer_order(zero_amount_transfer_order)\n\n .is_err());\n\n assert!(authority_state\n\n .accounts\n\n .get(&sender)\n\n .unwrap()\n\n .pending_confirmation\n\n .is_none());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":22,"score":127579.04472782314},{"content":"#[test]\n\nfn test_handle_transfer_order_bad_signature() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\n\n let (_unknown_address, unknown_key) = get_key_pair();\n\n let mut bad_signature_transfer_order = transfer_order.clone();\n\n bad_signature_transfer_order.signature = Signature::new(&transfer_order.transfer, &unknown_key);\n\n assert!(authority_state\n\n .handle_transfer_order(bad_signature_transfer_order)\n\n .is_err());\n\n assert!(authority_state\n\n .accounts\n\n .get(&sender)\n\n .unwrap()\n\n .pending_confirmation\n\n .is_none());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":23,"score":127579.04472782314},{"content":"#[test]\n\nfn test_handle_transfer_order_double_spend() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\n\n\n\n let signed_order = authority_state\n\n .handle_transfer_order(transfer_order.clone())\n\n .unwrap();\n\n let double_spend_signed_order = authority_state\n\n .handle_transfer_order(transfer_order)\n\n .unwrap();\n\n assert_eq!(signed_order, double_spend_signed_order);\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":24,"score":127579.04472782314},{"content":"#[test]\n\nfn test_receiving_unconfirmed_transfer_with_lagging_sender_balances() {\n\n let mut rt = Runtime::new().unwrap();\n\n let (mut authority_clients, committee) = init_local_authorities(4);\n\n let mut client0 = make_client(authority_clients.clone(), committee.clone());\n\n let mut client1 = make_client(authority_clients.clone(), committee.clone());\n\n let mut client2 = make_client(authority_clients.clone(), committee);\n\n fund_account(&mut authority_clients, client0.address, vec![2, 3, 4, 4]);\n\n // not updating client balances\n\n\n\n // transferring funds from client0 to client1.\n\n // confirming to a quorum of node only at the end.\n\n rt.block_on(async {\n\n client0\n\n .transfer_to_fastpay_unsafe_unconfirmed(\n\n Amount::from(1),\n\n client1.address,\n\n UserData::default(),\n\n )\n\n .await\n\n .unwrap();\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":25,"score":125491.87557924891},{"content":"#[test]\n\nfn test_handle_confirmation_order_receiver_equal_sender() {\n\n let (address, key) = get_key_pair();\n\n let mut authority_state = init_state_with_account(address, Balance::from(1));\n\n\n\n let certified_transfer_order = init_certified_transfer_order(\n\n address,\n\n &key,\n\n Address::FastPay(address),\n\n Amount::from(10),\n\n &authority_state,\n\n );\n\n assert!(authority_state\n\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\n\n .is_ok());\n\n let account = authority_state.accounts.get(&address).unwrap();\n\n assert_eq!(Balance::from(1), account.balance);\n\n assert_eq!(SequenceNumber::from(1), account.next_sequence_number);\n\n assert_eq!(account.confirmed_log.len(), 1);\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":26,"score":124920.58846230656},{"content":"#[test]\n\nfn test_handle_confirmation_order_receiver_balance_overflow() {\n\n let (sender, sender_key) = get_key_pair();\n\n let (recipient, _) = get_key_pair();\n\n let mut authority_state = init_state_with_accounts(vec![\n\n (sender, Balance::from(1)),\n\n (recipient, Balance::max()),\n\n ]);\n\n\n\n let certified_transfer_order = init_certified_transfer_order(\n\n sender,\n\n &sender_key,\n\n Address::FastPay(recipient),\n\n Amount::from(1),\n\n &authority_state,\n\n );\n\n assert!(authority_state\n\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\n\n .is_ok());\n\n let new_sender_account = authority_state.accounts.get(&sender).unwrap();\n\n assert_eq!(Balance::from(0), new_sender_account.balance);\n\n assert_eq!(\n\n SequenceNumber::from(1),\n\n new_sender_account.next_sequence_number\n\n );\n\n assert_eq!(new_sender_account.confirmed_log.len(), 1);\n\n let new_recipient_account = authority_state.accounts.get(&recipient).unwrap();\n\n assert_eq!(Balance::max(), new_recipient_account.balance);\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":27,"score":124857.28371437336},{"content":"#[test]\n\nfn test_handle_transfer_order_bad_sequence_number() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = Address::FastPay(dbg_addr(2));\n\n let authority_state = init_state_with_account(sender, Balance::from(5));\n\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\n\n\n\n let mut sequence_number_state = authority_state;\n\n let sequence_number_state_sender_account =\n\n sequence_number_state.accounts.get_mut(&sender).unwrap();\n\n sequence_number_state_sender_account.next_sequence_number =\n\n sequence_number_state_sender_account\n\n .next_sequence_number\n\n .increment()\n\n .unwrap();\n\n assert!(sequence_number_state\n\n .handle_transfer_order(transfer_order)\n\n .is_err());\n\n assert!(sequence_number_state\n\n .accounts\n\n .get(&sender)\n\n .unwrap()\n\n .pending_confirmation\n\n .is_none());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":28,"score":124696.15477116886},{"content":"#[cfg(test)]\n\nfn init_state_with_account(address: FastPayAddress, balance: Balance) -> AuthorityState {\n\n init_state_with_accounts(std::iter::once((address, balance)))\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":29,"score":124511.14023599261},{"content":"#[cfg(test)]\n\nfn init_contract() -> (FastPaySmartContractState, AuthorityName, SecretKey) {\n\n let (authority_address, authority_key) = get_key_pair();\n\n let mut authorities = BTreeMap::new();\n\n authorities.insert(\n\n /* address */ authority_address,\n\n /* voting right */ 1,\n\n );\n\n let committee = Committee::new(authorities);\n\n (\n\n FastPaySmartContractState::new(committee),\n\n authority_address,\n\n authority_key,\n\n )\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/fastpay_smart_contract_tests.rs","rank":30,"score":123562.683706282},{"content":"#[derive(Clone)]\n\nstruct CertificateRequester<A> {\n\n committee: Committee,\n\n authority_clients: Vec<A>,\n\n sender: FastPayAddress,\n\n}\n\n\n\nimpl<A> CertificateRequester<A> {\n\n fn new(committee: Committee, authority_clients: Vec<A>, sender: FastPayAddress) -> Self {\n\n Self {\n\n committee,\n\n authority_clients,\n\n sender,\n\n }\n\n }\n\n}\n\n\n\nimpl<A> Requester for CertificateRequester<A>\n\nwhere\n\n A: AuthorityClient + Send + Sync + 'static + Clone,\n\n{\n","file_path":"fastpay_core/src/client.rs","rank":31,"score":123220.72010583986},{"content":"pub fn serialize_message(msg: &SerializedMessage) -> Vec<u8> {\n\n serialize(msg)\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":32,"score":120601.69925994126},{"content":"/// Make one transfer order per account, up to `max_orders` transfers.\n\nfn make_benchmark_transfer_orders(\n\n accounts_config: &mut AccountsConfig,\n\n max_orders: usize,\n\n) -> (Vec<TransferOrder>, Vec<(FastPayAddress, Bytes)>) {\n\n let mut orders = Vec::new();\n\n let mut serialized_orders = Vec::new();\n\n // TODO: deterministic sequence of orders to recover from interrupted benchmarks.\n\n let mut next_recipient = get_key_pair().0;\n\n for account in accounts_config.accounts_mut() {\n\n let transfer = Transfer {\n\n sender: account.address,\n\n recipient: Address::FastPay(next_recipient),\n\n amount: Amount::from(1),\n\n sequence_number: account.next_sequence_number,\n\n user_data: UserData::default(),\n\n };\n\n debug!(\"Preparing transfer order: {:?}\", transfer);\n\n account.next_sequence_number = account.next_sequence_number.increment().unwrap();\n\n next_recipient = account.address;\n\n let order = TransferOrder::new(transfer.clone(), &account.key);\n\n orders.push(order.clone());\n\n let serialized_order = serialize_transfer_order(&order);\n\n serialized_orders.push((account.address, serialized_order.into()));\n\n if serialized_orders.len() >= max_orders {\n\n break;\n\n }\n\n }\n\n (orders, serialized_orders)\n\n}\n\n\n","file_path":"fastpay/src/client.rs","rank":33,"score":118390.0622811185},{"content":"#[cfg(test)]\n\nfn init_primary_synchronization_order(recipient: FastPayAddress) -> PrimarySynchronizationOrder {\n\n let mut transaction_index = VersionNumber::new();\n\n transaction_index = transaction_index.increment().unwrap();\n\n PrimarySynchronizationOrder {\n\n recipient,\n\n amount: Amount::from(5),\n\n transaction_index,\n\n }\n\n}\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":34,"score":117298.5403015507},{"content":"// Operations are considered successful when they successfully reach a quorum of authorities.\n\npub trait Client {\n\n /// Send money to a FastPay account.\n\n fn transfer_to_fastpay(\n\n &mut self,\n\n amount: Amount,\n\n recipient: FastPayAddress,\n\n user_data: UserData,\n\n ) -> AsyncResult<CertifiedTransferOrder, failure::Error>;\n\n\n\n /// Send money to a Primary account.\n\n fn transfer_to_primary(\n\n &mut self,\n\n amount: Amount,\n\n recipient: PrimaryAddress,\n\n user_data: UserData,\n\n ) -> AsyncResult<CertifiedTransferOrder, failure::Error>;\n\n\n\n /// Receive money from FastPay.\n\n fn receive_from_fastpay(\n\n &mut self,\n","file_path":"fastpay_core/src/client.rs","rank":35,"score":115273.27480709559},{"content":"#[test]\n\nfn test_account_state_unknown_account() {\n\n let sender = dbg_addr(1);\n\n let unknown_address = dbg_addr(99);\n\n let authority_state = init_state_with_account(sender, Balance::from(5));\n\n assert!(authority_state.account_state(&unknown_address).is_err());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":36,"score":114553.32958012784},{"content":"pub trait Digestible {\n\n fn digest(&self) -> [u8; 32];\n\n}\n\n\n\nimpl Digestible for [u8; 5] {\n\n fn digest(self: &[u8; 5]) -> [u8; 32] {\n\n let mut h = dalek::Sha512::new();\n\n let mut hash = [0u8; 64];\n\n let mut digest = [0u8; 32];\n\n h.update(&self);\n\n hash.copy_from_slice(h.finalize().as_slice());\n\n digest.copy_from_slice(&hash[..32]);\n\n digest\n\n }\n\n}\n\n\n\nimpl Signature {\n\n pub fn to_array(&self) -> [u8; 64] {\n\n let mut sig: [u8; 64] = [0; 64];\n\n sig[0..32].clone_from_slice(&self.part1);\n","file_path":"fastpay_core/src/base_types.rs","rank":37,"score":112975.84464491416},{"content":"#[test]\n\nfn test_certificates() {\n\n let (a1, sec1) = get_key_pair();\n\n let (a2, sec2) = get_key_pair();\n\n let (a3, sec3) = get_key_pair();\n\n\n\n let mut authorities = BTreeMap::new();\n\n authorities.insert(/* address */ a1, /* voting right */ 1);\n\n authorities.insert(/* address */ a2, /* voting right */ 1);\n\n let committee = Committee::new(authorities);\n\n\n\n let transfer = Transfer {\n\n sender: a1,\n\n recipient: Address::FastPay(a2),\n\n amount: Amount::from(1),\n\n sequence_number: SequenceNumber::new(),\n\n user_data: UserData::default(),\n\n };\n\n let order = TransferOrder::new(transfer.clone(), &sec1);\n\n let bad_order = TransferOrder::new(transfer, &sec2);\n\n\n","file_path":"fastpay_core/src/unit_tests/messages_tests.rs","rank":38,"score":112555.10147777494},{"content":"/// Try to make certificates from orders and server configs\n\nfn make_benchmark_certificates_from_orders_and_server_configs(\n\n orders: Vec<TransferOrder>,\n\n server_config: Vec<&str>,\n\n) -> Vec<(FastPayAddress, Bytes)> {\n\n let mut keys = Vec::new();\n\n for file in server_config {\n\n let server_config = AuthorityServerConfig::read(file).expect(\"Fail to read server config\");\n\n keys.push((server_config.authority.address, server_config.key));\n\n }\n\n let mut serialized_certificates = Vec::new();\n\n for order in orders {\n\n let mut certificate = CertifiedTransferOrder {\n\n value: order.clone(),\n\n signatures: Vec::new(),\n\n };\n\n let committee = Committee {\n\n voting_rights: keys.iter().map(|(k, _)| (*k, 1)).collect(),\n\n total_votes: keys.len(),\n\n };\n\n for i in 0..committee.quorum_threshold() {\n\n let (pubx, secx) = keys.get(i).unwrap();\n\n let sig = Signature::new(&certificate.value, secx);\n\n certificate.signatures.push((*pubx, sig));\n\n }\n\n let serialized_certificate = serialize_cert(&certificate);\n\n serialized_certificates.push((order.transfer.sender, serialized_certificate.into()));\n\n }\n\n serialized_certificates\n\n}\n\n\n","file_path":"fastpay/src/client.rs","rank":39,"score":112537.19933158555},{"content":"pub fn decode_address(s: &str) -> Result<EdPublicKeyBytes, failure::Error> {\n\n let value = base64::decode(s)?;\n\n let mut address = [0u8; dalek::PUBLIC_KEY_LENGTH];\n\n address.copy_from_slice(&value[..dalek::PUBLIC_KEY_LENGTH]);\n\n Ok(EdPublicKeyBytes(address))\n\n}\n\n\n","file_path":"fastpay_core/src/base_types.rs","rank":40,"score":112269.51660529662},{"content":"#[test]\n\nfn test_info_request() {\n\n let req1 = AccountInfoRequest {\n\n sender: dbg_addr(0x20),\n\n request_sequence_number: None,\n\n request_received_transfers_excluding_first_nth: None,\n\n };\n\n let req2 = AccountInfoRequest {\n\n sender: dbg_addr(0x20),\n\n request_sequence_number: Some(SequenceNumber::from(129)),\n\n request_received_transfers_excluding_first_nth: None,\n\n };\n\n\n\n let buf1 = serialize_info_request(&req1);\n\n let buf2 = serialize_info_request(&req2);\n\n\n\n let result1 = deserialize_message(buf1.as_slice());\n\n let result2 = deserialize_message(buf2.as_slice());\n\n assert!(result1.is_ok());\n\n assert!(result2.is_ok());\n\n\n","file_path":"fastpay_core/src/unit_tests/serialize_tests.rs","rank":41,"score":110001.49663798866},{"content":"#[cfg(test)]\n\nfn init_state_with_accounts<I: IntoIterator<Item = (FastPayAddress, Balance)>>(\n\n balances: I,\n\n) -> AuthorityState {\n\n let mut state = init_state();\n\n for (address, balance) in balances {\n\n let account = state\n\n .accounts\n\n .entry(address)\n\n .or_insert_with(AccountOffchainState::new);\n\n account.balance = balance;\n\n }\n\n state\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":42,"score":109064.62808752991},{"content":"/// How to send and obtain data packets over an \"active socket\".\n\npub trait DataStream: Send {\n\n fn write_data<'a>(\n\n &'a mut self,\n\n buffer: &'a [u8],\n\n ) -> future::BoxFuture<'a, Result<(), std::io::Error>>;\n\n fn read_data(&mut self) -> future::BoxFuture<Result<Vec<u8>, std::io::Error>>;\n\n}\n\n\n","file_path":"fastpay/src/transport.rs","rank":43,"score":107414.47643578096},{"content":"#[test]\n\nfn test_account_state_ok() {\n\n let sender = dbg_addr(1);\n\n let authority_state = init_state_with_account(sender, Balance::from(5));\n\n assert_eq!(\n\n authority_state.accounts.get(&sender).unwrap(),\n\n authority_state.account_state(&sender).unwrap()\n\n );\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":44,"score":106737.39241712165},{"content":"/// A pool of (outgoing) data streams.\n\npub trait DataStreamPool: Send {\n\n fn send_data_to<'a>(\n\n &'a mut self,\n\n buffer: &'a [u8],\n\n address: &'a str,\n\n ) -> future::BoxFuture<'a, Result<(), io::Error>>;\n\n}\n\n\n","file_path":"fastpay/src/transport.rs","rank":45,"score":105277.25146172913},{"content":"pub trait FastPaySmartContract {\n\n /// Initiate a transfer from Primary to FastPay.\n\n fn handle_funding_transaction(\n\n &mut self,\n\n transaction: FundingTransaction,\n\n ) -> Result<(), failure::Error>;\n\n\n\n /// Finalize a transfer from FastPay to Primary.\n\n fn handle_redeem_transaction(\n\n &mut self,\n\n transaction: RedeemTransaction,\n\n ) -> Result<(), failure::Error>;\n\n}\n\n\n\nimpl FastPaySmartContract for FastPaySmartContractState {\n\n /// Initiate a transfer to FastPay.\n\n fn handle_funding_transaction(\n\n &mut self,\n\n transaction: FundingTransaction,\n\n ) -> Result<(), failure::Error> {\n","file_path":"fastpay_core/src/fastpay_smart_contract.rs","rank":46,"score":105220.34163038354},{"content":"#[test]\n\nfn test_handle_confirmation_order_ok() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = dbg_addr(2);\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let certified_transfer_order = init_certified_transfer_order(\n\n sender,\n\n &sender_key,\n\n Address::FastPay(recipient),\n\n Amount::from(5),\n\n &authority_state,\n\n );\n\n\n\n let old_account = authority_state.accounts.get_mut(&sender).unwrap();\n\n let mut next_sequence_number = old_account.next_sequence_number;\n\n next_sequence_number = next_sequence_number.increment().unwrap();\n\n let mut remaining_balance = old_account.balance;\n\n remaining_balance = remaining_balance\n\n .try_sub(certified_transfer_order.value.transfer.amount.into())\n\n .unwrap();\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":47,"score":104078.80283028545},{"content":"#[derive(Clone)]\n\nstruct LocalRequester(Arc<AtomicU32>);\n\n\n\nimpl LocalRequester {\n\n fn new() -> Self {\n\n Self(Arc::new(AtomicU32::new(0)))\n\n }\n\n}\n\n\n\nimpl Requester for LocalRequester {\n\n type Key = &'static str;\n\n type Value = u32;\n\n\n\n fn query(&mut self, _key: Self::Key) -> future::BoxFuture<Self::Value> {\n\n Box::pin(future::ready(self.0.fetch_add(1, Ordering::Relaxed)))\n\n }\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/downloader_tests.rs","rank":48,"score":102829.52628301513},{"content":"#[test]\n\nfn test_handle_cross_shard_recipient_commit() {\n\n let (sender, sender_key) = get_key_pair();\n\n let (recipient, _) = get_key_pair();\n\n // Sender has no account on this shard.\n\n let mut authority_state = init_state_with_account(recipient, Balance::from(1));\n\n let certified_transfer_order = init_certified_transfer_order(\n\n sender,\n\n &sender_key,\n\n Address::FastPay(recipient),\n\n Amount::from(10),\n\n &authority_state,\n\n );\n\n assert!(authority_state\n\n .handle_cross_shard_recipient_commit(certified_transfer_order)\n\n .is_ok());\n\n let account = authority_state.accounts.get(&recipient).unwrap();\n\n assert_eq!(Balance::from(11), account.balance);\n\n assert_eq!(SequenceNumber::from(0), account.next_sequence_number);\n\n assert_eq!(account.confirmed_log.len(), 0);\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":49,"score":102072.42191525464},{"content":"pub fn address_from_base64<'de, D>(deserializer: D) -> Result<EdPublicKeyBytes, D::Error>\n\nwhere\n\n D: serde::de::Deserializer<'de>,\n\n{\n\n let s = String::deserialize(deserializer)?;\n\n let value = decode_address(&s).map_err(|err| serde::de::Error::custom(err.to_string()))?;\n\n Ok(value)\n\n}\n\n\n","file_path":"fastpay_core/src/base_types.rs","rank":50,"score":101818.18592614247},{"content":"#[test]\n\nfn test_handle_primary_synchronization_order_update() {\n\n let mut state = init_state();\n\n let mut updated_transaction_index = state.last_transaction_index;\n\n let address = dbg_addr(1);\n\n let order = init_primary_synchronization_order(address);\n\n\n\n assert!(state\n\n .handle_primary_synchronization_order(order.clone())\n\n .is_ok());\n\n updated_transaction_index = updated_transaction_index.increment().unwrap();\n\n assert_eq!(state.last_transaction_index, updated_transaction_index);\n\n let account = state.accounts.get(&address).unwrap();\n\n assert_eq!(account.balance, order.amount.into());\n\n assert_eq!(state.accounts.len(), 1);\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":51,"score":101796.56085025496},{"content":"pub fn serialize_cert_into<W>(\n\n writer: W,\n\n value: &CertifiedTransferOrder,\n\n) -> Result<(), failure::Error>\n\nwhere\n\n W: std::io::Write,\n\n{\n\n serialize_into(writer, &ShallowSerializedMessage::Cert(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":52,"score":101521.3038620875},{"content":"#[test]\n\nfn test_initiating_valid_transfer_despite_bad_authority() {\n\n let mut rt = Runtime::new().unwrap();\n\n let (recipient, _) = get_key_pair();\n\n\n\n let mut sender = init_local_client_state_with_bad_authority(vec![4, 4, 4, 4]);\n\n sender.balance = Balance::from(4);\n\n let certificate = rt\n\n .block_on(sender.transfer_to_fastpay(\n\n Amount::from(3),\n\n recipient,\n\n UserData(Some(*b\"hello...........hello...........\")),\n\n ))\n\n .unwrap();\n\n assert_eq!(sender.next_sequence_number, SequenceNumber::from(1));\n\n assert_eq!(sender.pending_transfer, None);\n\n assert_eq!(\n\n rt.block_on(sender.get_strong_majority_balance()),\n\n Balance::from(1)\n\n );\n\n assert_eq!(\n\n rt.block_on(sender.request_certificate(sender.address, SequenceNumber::from(0)))\n\n .unwrap(),\n\n certificate\n\n );\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":53,"score":99676.47279025259},{"content":"#[test]\n\nfn test_handle_primary_synchronization_order_double_spend() {\n\n let mut state = init_state();\n\n let mut updated_transaction_index = state.last_transaction_index;\n\n let address = dbg_addr(1);\n\n let order = init_primary_synchronization_order(address);\n\n\n\n assert!(state\n\n .handle_primary_synchronization_order(order.clone())\n\n .is_ok());\n\n updated_transaction_index = updated_transaction_index.increment().unwrap();\n\n // Replays are ignored.\n\n assert!(state\n\n .handle_primary_synchronization_order(order.clone())\n\n .is_ok());\n\n assert_eq!(state.last_transaction_index, updated_transaction_index);\n\n let account = state.accounts.get(&address).unwrap();\n\n assert_eq!(account.balance, order.amount.into());\n\n assert_eq!(state.accounts.len(), 1);\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":54,"score":99643.53218277049},{"content":"#[test]\n\nfn test_handle_confirmation_order_bad_sequence_number() {\n\n let (sender, sender_key) = get_key_pair();\n\n let recipient = dbg_addr(2);\n\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\n\n let sender_account = authority_state.accounts.get_mut(&sender).unwrap();\n\n sender_account.next_sequence_number = sender_account.next_sequence_number.increment().unwrap();\n\n // let old_account = sender_account;\n\n\n\n let old_balance;\n\n let old_seq_num;\n\n {\n\n let old_account = authority_state.accounts.get_mut(&sender).unwrap();\n\n old_balance = old_account.balance;\n\n old_seq_num = old_account.next_sequence_number;\n\n }\n\n\n\n let certified_transfer_order = init_certified_transfer_order(\n\n sender,\n\n &sender_key,\n\n Address::FastPay(recipient),\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":55,"score":99643.53218277049},{"content":"pub fn serialize_error(value: &FastPayError) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::Error(value))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":56,"score":99460.16962083962},{"content":"fn deserialize_response(response: &[u8]) -> Option<AccountInfoResponse> {\n\n match deserialize_message(response) {\n\n Ok(SerializedMessage::InfoResp(info)) => Some(*info),\n\n Ok(SerializedMessage::Error(error)) => {\n\n error!(\"Received error value: {}\", error);\n\n None\n\n }\n\n Ok(_) => {\n\n error!(\"Unexpected return value\");\n\n None\n\n }\n\n Err(error) => {\n\n error!(\n\n \"Unexpected error: {} while deserializing {:?}\",\n\n error, response\n\n );\n\n None\n\n }\n\n }\n\n}\n\n\n\n#[derive(StructOpt)]\n\n#[structopt(\n\n name = \"FastPay Client\",\n\n about = \"A Byzantine fault tolerant payments sidechain with low-latency finality and high throughput\"\n\n)]\n","file_path":"fastpay/src/client.rs","rank":57,"score":98038.06714419808},{"content":"pub fn address_as_base64<S>(key: &EdPublicKeyBytes, serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: serde::ser::Serializer,\n\n{\n\n serializer.serialize_str(&encode_address(key))\n\n}\n\n\n","file_path":"fastpay_core/src/base_types.rs","rank":58,"score":94682.3675147789},{"content":"fn mass_update_recipients(\n\n accounts_config: &mut AccountsConfig,\n\n certificates: Vec<(FastPayAddress, Bytes)>,\n\n) {\n\n for (_sender, buf) in certificates {\n\n if let Ok(SerializedMessage::Cert(certificate)) = deserialize_message(&buf[..]) {\n\n accounts_config.update_for_received_transfer(*certificate);\n\n }\n\n }\n\n}\n\n\n","file_path":"fastpay/src/client.rs","rank":59,"score":89727.06094387716},{"content":"fn make_authority_clients(\n\n committee_config: &CommitteeConfig,\n\n buffer_size: usize,\n\n send_timeout: std::time::Duration,\n\n recv_timeout: std::time::Duration,\n\n) -> HashMap<AuthorityName, network::Client> {\n\n let mut authority_clients = HashMap::new();\n\n for config in &committee_config.authorities {\n\n let config = config.clone();\n\n let client = network::Client::new(\n\n config.network_protocol,\n\n config.host,\n\n config.base_port,\n\n config.num_shards,\n\n buffer_size,\n\n send_timeout,\n\n recv_timeout,\n\n );\n\n authority_clients.insert(config.address, client);\n\n }\n\n authority_clients\n\n}\n\n\n","file_path":"fastpay/src/client.rs","rank":60,"score":88935.46046142447},{"content":"/// Try to aggregate votes into certificates.\n\nfn make_benchmark_certificates_from_votes(\n\n committee_config: &CommitteeConfig,\n\n votes: Vec<SignedTransferOrder>,\n\n) -> Vec<(FastPayAddress, Bytes)> {\n\n let committee = Committee::new(committee_config.voting_rights());\n\n let mut aggregators = HashMap::new();\n\n let mut certificates = Vec::new();\n\n let mut done_senders = HashSet::new();\n\n for vote in votes {\n\n // We aggregate votes indexed by sender.\n\n let address = vote.value.transfer.sender;\n\n if done_senders.contains(&address) {\n\n continue;\n\n }\n\n debug!(\n\n \"Processing vote on {}'s transfer by {}\",\n\n encode_address(&address),\n\n encode_address(&vote.authority)\n\n );\n\n let value = vote.value;\n","file_path":"fastpay/src/client.rs","rank":61,"score":87458.74961394479},{"content":"fn make_authority_mass_clients(\n\n committee_config: &CommitteeConfig,\n\n buffer_size: usize,\n\n send_timeout: std::time::Duration,\n\n recv_timeout: std::time::Duration,\n\n max_in_flight: u64,\n\n) -> Vec<(u32, network::MassClient)> {\n\n let mut authority_clients = Vec::new();\n\n for config in &committee_config.authorities {\n\n let client = network::MassClient::new(\n\n config.network_protocol,\n\n config.host.clone(),\n\n config.base_port,\n\n buffer_size,\n\n send_timeout,\n\n recv_timeout,\n\n max_in_flight / config.num_shards as u64, // Distribute window to diff shards\n\n );\n\n authority_clients.push((config.num_shards, client));\n\n }\n\n authority_clients\n\n}\n\n\n","file_path":"fastpay/src/client.rs","rank":62,"score":86704.40581068787},{"content":"#[cfg(test)]\n\nfn init_state() -> AuthorityState {\n\n let (authority_address, authority_key) = get_key_pair();\n\n let mut authorities = BTreeMap::new();\n\n authorities.insert(\n\n /* address */ authority_address,\n\n /* voting right */ 1,\n\n );\n\n let committee = Committee::new(authorities);\n\n AuthorityState::new(committee, authority_address, authority_key)\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":63,"score":85937.62448489615},{"content":"pub fn encode_address(key: &EdPublicKeyBytes) -> String {\n\n base64::encode(&key.0[..])\n\n}\n\n\n","file_path":"fastpay_core/src/base_types.rs","rank":64,"score":83803.83663299639},{"content":"#[test]\n\nfn test_order() {\n\n let (sender_name, sender_key) = get_key_pair();\n\n\n\n let transfer = Transfer {\n\n sender: sender_name,\n\n recipient: Address::Primary(dbg_addr(0x20)),\n\n amount: Amount::from(5),\n\n sequence_number: SequenceNumber::new(),\n\n user_data: UserData::default(),\n\n };\n\n let transfer_order = TransferOrder::new(transfer, &sender_key);\n\n\n\n let buf = serialize_transfer_order(&transfer_order);\n\n let result = deserialize_message(buf.as_slice());\n\n assert!(result.is_ok());\n\n if let SerializedMessage::Order(o) = result.unwrap() {\n\n assert!(*o == transfer_order);\n\n } else {\n\n panic!()\n\n }\n","file_path":"fastpay_core/src/unit_tests/serialize_tests.rs","rank":65,"score":83084.76378433095},{"content":"#[test]\n\nfn test_info_response() {\n\n let (sender_name, sender_key) = get_key_pair();\n\n let transfer = Transfer {\n\n sender: sender_name,\n\n recipient: Address::Primary(dbg_addr(0x20)),\n\n amount: Amount::from(5),\n\n sequence_number: SequenceNumber::new(),\n\n user_data: UserData::default(),\n\n };\n\n let order = TransferOrder::new(transfer, &sender_key);\n\n\n\n let (auth_name, auth_key) = get_key_pair();\n\n let vote = SignedTransferOrder::new(order.clone(), auth_name, &auth_key);\n\n\n\n let mut cert = CertifiedTransferOrder {\n\n value: order,\n\n signatures: Vec::new(),\n\n };\n\n\n\n for _ in 0..3 {\n","file_path":"fastpay_core/src/unit_tests/serialize_tests.rs","rank":66,"score":81508.67898769425},{"content":"#[test]\n\nfn test_bidirectional_transfer() {\n\n let mut rt = Runtime::new().unwrap();\n\n let (mut authority_clients, committee) = init_local_authorities(4);\n\n let mut client1 = make_client(authority_clients.clone(), committee.clone());\n\n let mut client2 = make_client(authority_clients.clone(), committee);\n\n fund_account(&mut authority_clients, client1.address, vec![2, 3, 4, 4]);\n\n // Update client1's local balance accordingly.\n\n client1.balance = rt.block_on(client1.get_strong_majority_balance());\n\n assert_eq!(client1.balance, Balance::from(3));\n\n\n\n let certificate = rt\n\n .block_on(client1.transfer_to_fastpay(\n\n Amount::from(3),\n\n client2.address,\n\n UserData::default(),\n\n ))\n\n .unwrap();\n\n\n\n assert_eq!(client1.next_sequence_number, SequenceNumber::from(1));\n\n assert_eq!(client1.pending_transfer, None);\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":67,"score":81291.29615312966},{"content":"#[test]\n\nfn test_signed_values() {\n\n let mut authorities = BTreeMap::new();\n\n let (a1, sec1) = get_key_pair();\n\n let (a2, sec2) = get_key_pair();\n\n let (a3, sec3) = get_key_pair();\n\n\n\n authorities.insert(/* address */ a1, /* voting right */ 1);\n\n authorities.insert(/* address */ a2, /* voting right */ 0);\n\n let committee = Committee::new(authorities);\n\n\n\n let transfer = Transfer {\n\n sender: a1,\n\n recipient: Address::FastPay(a2),\n\n amount: Amount::from(1),\n\n sequence_number: SequenceNumber::new(),\n\n user_data: UserData::default(),\n\n };\n\n let order = TransferOrder::new(transfer.clone(), &sec1);\n\n let bad_order = TransferOrder::new(transfer, &sec2);\n\n\n","file_path":"fastpay_core/src/unit_tests/messages_tests.rs","rank":68,"score":81278.94549656911},{"content":"#[test]\n\nfn test_time_order() {\n\n let (sender_name, sender_key) = get_key_pair();\n\n let transfer = Transfer {\n\n sender: sender_name,\n\n recipient: Address::Primary(dbg_addr(0x20)),\n\n amount: Amount::from(5),\n\n sequence_number: SequenceNumber::new(),\n\n user_data: UserData::default(),\n\n };\n\n\n\n let mut buf = Vec::new();\n\n let now = Instant::now();\n\n for _ in 0..100 {\n\n let transfer_order = TransferOrder::new(transfer.clone(), &sender_key);\n\n serialize_transfer_order_into(&mut buf, &transfer_order).unwrap();\n\n }\n\n println!(\"Write Order: {} microsec\", now.elapsed().as_micros() / 100);\n\n\n\n let mut buf2 = buf.as_slice();\n\n let now = Instant::now();\n","file_path":"fastpay_core/src/unit_tests/serialize_tests.rs","rank":69,"score":81254.14926763935},{"content":"#[cfg(test)]\n\nfn init_local_authorities(\n\n count: usize,\n\n) -> (HashMap<AuthorityName, LocalAuthorityClient>, Committee) {\n\n let mut key_pairs = Vec::new();\n\n let mut voting_rights = BTreeMap::new();\n\n for _ in 0..count {\n\n let key_pair = get_key_pair();\n\n voting_rights.insert(key_pair.0, 1);\n\n key_pairs.push(key_pair);\n\n }\n\n let committee = Committee::new(voting_rights);\n\n\n\n let mut clients = HashMap::new();\n\n for (address, secret) in key_pairs {\n\n let state = AuthorityState::new(committee.clone(), address, secret);\n\n clients.insert(address, LocalAuthorityClient::new(state));\n\n }\n\n (clients, committee)\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":70,"score":80865.91062415196},{"content":"#[test]\n\nfn test_get_shards() {\n\n let num_shards = 16u32;\n\n let mut found = vec![false; num_shards as usize];\n\n let mut left = num_shards;\n\n loop {\n\n let (address, _) = get_key_pair();\n\n let shard = AuthorityState::get_shard(num_shards, &address) as usize;\n\n println!(\"found {}\", shard);\n\n if !found[shard] {\n\n found[shard] = true;\n\n left -= 1;\n\n if left == 0 {\n\n break;\n\n }\n\n }\n\n }\n\n}\n\n\n\n// helpers\n\n\n","file_path":"fastpay_core/src/unit_tests/authority_tests.rs","rank":71,"score":80865.91062415196},{"content":"#[derive(Clone)]\n\nstruct LocalAuthorityClient(Arc<Mutex<AuthorityState>>);\n\n\n\nimpl AuthorityClient for LocalAuthorityClient {\n\n fn handle_transfer_order(\n\n &mut self,\n\n order: TransferOrder,\n\n ) -> AsyncResult<AccountInfoResponse, FastPayError> {\n\n let state = self.0.clone();\n\n Box::pin(async move { state.lock().await.handle_transfer_order(order) })\n\n }\n\n\n\n fn handle_confirmation_order(\n\n &mut self,\n\n order: ConfirmationOrder,\n\n ) -> AsyncResult<AccountInfoResponse, FastPayError> {\n\n let state = self.0.clone();\n\n Box::pin(async move {\n\n state\n\n .lock()\n\n .await\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":72,"score":80198.26041965821},{"content":"#[cfg(test)]\n\nfn init_local_client_state(balances: Vec<i128>) -> ClientState<LocalAuthorityClient> {\n\n let (mut authority_clients, committee) = init_local_authorities(balances.len());\n\n let client = make_client(authority_clients.clone(), committee);\n\n fund_account(&mut authority_clients, client.address, balances);\n\n client\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":73,"score":79964.83733227543},{"content":"#[test]\n\nfn test_receiving_unconfirmed_transfer() {\n\n let mut rt = Runtime::new().unwrap();\n\n let (mut authority_clients, committee) = init_local_authorities(4);\n\n let mut client1 = make_client(authority_clients.clone(), committee.clone());\n\n let mut client2 = make_client(authority_clients.clone(), committee);\n\n fund_account(&mut authority_clients, client1.address, vec![2, 3, 4, 4]);\n\n // not updating client1.balance\n\n\n\n let certificate = rt\n\n .block_on(client1.transfer_to_fastpay_unsafe_unconfirmed(\n\n Amount::from(2),\n\n client2.address,\n\n UserData::default(),\n\n ))\n\n .unwrap();\n\n // Transfer was executed locally, creating negative balance.\n\n assert_eq!(client1.balance, Balance::from(-2));\n\n assert_eq!(client1.next_sequence_number, SequenceNumber::from(1));\n\n assert_eq!(client1.pending_transfer, None);\n\n // ..but not confirmed remotely, hence an unchanged balance and sequence number.\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":74,"score":79572.79491066001},{"content":"#[test]\n\nfn test_initiating_valid_transfer() {\n\n let mut rt = Runtime::new().unwrap();\n\n let (recipient, _) = get_key_pair();\n\n\n\n let mut sender = init_local_client_state(vec![2, 4, 4, 4]);\n\n sender.balance = Balance::from(4);\n\n let certificate = rt\n\n .block_on(sender.transfer_to_fastpay(\n\n Amount::from(3),\n\n recipient,\n\n UserData(Some(*b\"hello...........hello...........\")),\n\n ))\n\n .unwrap();\n\n assert_eq!(sender.next_sequence_number, SequenceNumber::from(1));\n\n assert_eq!(sender.pending_transfer, None);\n\n assert_eq!(\n\n rt.block_on(sender.get_strong_majority_balance()),\n\n Balance::from(1)\n\n );\n\n assert_eq!(\n\n rt.block_on(sender.request_certificate(sender.address, SequenceNumber::from(0)))\n\n .unwrap(),\n\n certificate\n\n );\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":75,"score":79572.79491066001},{"content":"#[cfg(test)]\n\nfn init_local_authorities_bad_1(\n\n count: usize,\n\n) -> (HashMap<AuthorityName, LocalAuthorityClient>, Committee) {\n\n let mut key_pairs = Vec::new();\n\n let mut voting_rights = BTreeMap::new();\n\n for i in 0..count {\n\n let key_pair = get_key_pair();\n\n voting_rights.insert(key_pair.0, 1);\n\n if i + 1 < (count + 2) / 3 {\n\n // init 1 authority with a bad keypair\n\n key_pairs.push(get_key_pair());\n\n } else {\n\n key_pairs.push(key_pair);\n\n }\n\n }\n\n let committee = Committee::new(voting_rights);\n\n\n\n let mut clients = HashMap::new();\n\n for (address, secret) in key_pairs {\n\n let state = AuthorityState::new(committee.clone(), address, secret);\n\n clients.insert(address, LocalAuthorityClient::new(state));\n\n }\n\n (clients, committee)\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":76,"score":79160.56895216502},{"content":"#[test]\n\nfn test_get_strong_majority_balance() {\n\n let mut rt = Runtime::new().unwrap();\n\n rt.block_on(async {\n\n let mut client = init_local_client_state(vec![3, 4, 4, 4]);\n\n assert_eq!(client.get_strong_majority_balance().await, Balance::from(4));\n\n\n\n let mut client = init_local_client_state(vec![0, 3, 4, 4]);\n\n assert_eq!(client.get_strong_majority_balance().await, Balance::from(3));\n\n\n\n let mut client = init_local_client_state(vec![0, 3, 4]);\n\n assert_eq!(client.get_strong_majority_balance().await, Balance::from(0));\n\n });\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":77,"score":78128.22800331571},{"content":"#[test]\n\nfn test_initiating_transfer_low_funds() {\n\n let mut rt = Runtime::new().unwrap();\n\n let (recipient, _) = get_key_pair();\n\n\n\n let mut sender = init_local_client_state(vec![2, 2, 4, 4]);\n\n sender.balance = Balance::from(2);\n\n assert!(rt\n\n .block_on(sender.transfer_to_fastpay(Amount::from(3), recipient, UserData::default()))\n\n .is_err());\n\n // Trying to overspend does not block an account.\n\n assert_eq!(sender.next_sequence_number, SequenceNumber::from(0));\n\n assert_eq!(sender.pending_transfer, None);\n\n assert_eq!(\n\n rt.block_on(sender.get_strong_majority_balance()),\n\n Balance::from(2)\n\n );\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":78,"score":77957.42895919111},{"content":"#[cfg(test)]\n\nfn init_local_client_state_with_bad_authority(\n\n balances: Vec<i128>,\n\n) -> ClientState<LocalAuthorityClient> {\n\n let (mut authority_clients, committee) = init_local_authorities_bad_1(balances.len());\n\n let client = make_client(authority_clients.clone(), committee);\n\n fund_account(&mut authority_clients, client.address, balances);\n\n client\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":79,"score":76047.97724314062},{"content":"#[test]\n\nfn test_handle_redeem_transaction_negative_balance() {\n\n let (mut contract_state, name, secret) = init_contract();\n\n let mut redeem_transaction =\n\n init_redeem_transaction(contract_state.committee.clone(), name, secret);\n\n let funding_transaction = init_funding_transaction();\n\n let too_much_money = Amount::from(1000);\n\n assert!(contract_state\n\n .handle_funding_transaction(funding_transaction)\n\n .is_ok());\n\n let old_balance = contract_state.total_balance;\n\n\n\n redeem_transaction\n\n .transfer_certificate\n\n .value\n\n .transfer\n\n .amount = redeem_transaction\n\n .transfer_certificate\n\n .value\n\n .transfer\n\n .amount\n\n .try_add(too_much_money)\n\n .unwrap();\n\n assert!(contract_state\n\n .handle_redeem_transaction(redeem_transaction)\n\n .is_err());\n\n assert_eq!(old_balance, contract_state.total_balance);\n\n assert!(contract_state.accounts.is_empty());\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/fastpay_smart_contract_tests.rs","rank":80,"score":73801.65937167729},{"content":"fn serialize_into<T, W>(writer: W, msg: &T) -> Result<(), failure::Error>\n\nwhere\n\n W: std::io::Write,\n\n T: Serialize,\n\n{\n\n bincode::serialize_into(writer, msg).map_err(|err| format_err!(\"{}\", err))\n\n}\n\n\n","file_path":"fastpay_core/src/serialize.rs","rank":81,"score":73532.4071043628},{"content":"#[cfg(test)]\n\nfn fund_account<I: IntoIterator<Item = i128>>(\n\n clients: &mut HashMap<AuthorityName, LocalAuthorityClient>,\n\n address: FastPayAddress,\n\n balances: I,\n\n) {\n\n let mut balances = balances.into_iter().map(Balance::from);\n\n for (_, client) in clients.iter_mut() {\n\n client.0.as_ref().try_lock().unwrap().accounts_mut().insert(\n\n address,\n\n AccountOffchainState::new_with_balance(\n\n balances.next().unwrap_or_else(Balance::zero),\n\n /* no receive log to justify the balances */ Vec::new(),\n\n ),\n\n );\n\n }\n\n}\n\n\n","file_path":"fastpay_core/src/unit_tests/client_tests.rs","rank":82,"score":68828.38865156738},{"content":"def info():\n\n\tset_hosts()\n\n\n\n\tprint('\\nclients:')\n\n\tfor client in env.roledefs['client']:\n\n\t\tprint('\\t ssh -i '+env.key_filename+' '+env.user+'@'+client)\n\n\n\n\tprint('\\nservers:')\n\n\tfor server in env.roledefs['authority']:\n\n\t\tprint('\\t ssh -i '+env.key_filename+' '+env.user+'@'+server)\n\n\n\n\tprint('\\nthroughput:')\n\n\tfor server in env.roledefs['throughput']:\n","file_path":"scripts/fabfile.py","rank":83,"score":65504.587213338425},{"content":"def transfer(remote_client=remote_client):\n\n\texecute(initialize_client, remote_client)\n\n\n\n\tf = open(initial_accounts, 'r')\n\n\taddresses = f.read().splitlines()\n\n\tf.close()\n\n\tassert len(addresses) > 0\n\n\n\n\tfor i, sender in enumerate(addresses):\n\n\t\tcommand = './client --committee %s --accounts %s transfer --from %s --to %s 1' \\\n\n\t\t\t% (committee_config, accounts, sender, sender)\n\n\t\tif remote_client:\n\n\t\t\trun(command)\n\n\t\telse:\n","file_path":"scripts/fabfile.py","rank":84,"score":65300.420528393},{"content":"def info():\n\n\tset_hosts()\n\n\n\n\tprint('\\ndev:')\n\n\tfor dev in env.roledefs['dev']:\n","file_path":"scripts/aws_plot.py","rank":85,"score":64430.96114254334},{"content":"struct ServerOpt {\n\n /// Path to the file containing the server configuration of this FastPay authority (including its secret key)\n\n #[structopt(long = \"server\")]\n\n server: String,\n\n\n\n /// Subcommands. Acceptable values are run and generate.\n\n #[structopt(subcommand)]\n\n cmd: ServerCommands,\n\n}\n\n\n","file_path":"fastpay/src/server.rs","rank":86,"score":62709.62578673629},{"content":"struct ClientOpt {\n\n /// Sets the file storing the state of our user accounts (an empty one will be created if missing)\n\n #[structopt(long = \"accounts\")]\n\n accounts: String,\n\n\n\n /// Sets the file describing the public configurations of all authorities\n\n #[structopt(long = \"committee\")]\n\n committee: String,\n\n\n\n /// Timeout for sending queries (us)\n\n #[structopt(long = \"send_timeout\", default_value = \"4000000\")]\n\n send_timeout: u64,\n\n\n\n /// Timeout for receiving responses (us)\n\n #[structopt(long = \"recv_timeout\", default_value = \"4000000\")]\n\n recv_timeout: u64,\n\n\n\n /// Maximum size of datagrams received and sent (bytes)\n\n #[structopt(long = \"buffer_size\", default_value = transport::DEFAULT_MAX_DATAGRAM_SIZE)]\n\n buffer_size: String,\n\n\n\n /// Subcommands. Acceptable values are transfer, query_balance, benchmark, and create_accounts.\n\n #[structopt(subcommand)]\n\n cmd: ClientCommands,\n\n}\n\n\n","file_path":"fastpay/src/client.rs","rank":87,"score":62709.62578673629},{"content":"#[derive(Debug, Clone)]\n\nstruct ClientServerBenchmark {\n\n network_protocol: transport::NetworkProtocol,\n\n host: String,\n\n port: u32,\n\n committee_size: usize,\n\n num_shards: u32,\n\n max_in_flight: usize,\n\n num_accounts: usize,\n\n send_timeout: Duration,\n\n recv_timeout: Duration,\n\n buffer_size: usize,\n\n cross_shard_queue_size: usize,\n\n}\n\n\n","file_path":"fastpay/src/bench.rs","rank":88,"score":61476.65692083484},{"content":"/// An implementation of DataStream based on UDP.\n\nstruct UdpDataStream {\n\n socket: UdpSocket,\n\n address: String,\n\n buffer: Vec<u8>,\n\n}\n\n\n\nimpl UdpDataStream {\n\n async fn connect(address: String, max_data_size: usize) -> Result<Self, std::io::Error> {\n\n let socket = UdpSocket::bind(&\"0.0.0.0:0\").await?;\n\n let buffer = vec![0u8; max_data_size];\n\n Ok(Self {\n\n socket,\n\n address,\n\n buffer,\n\n })\n\n }\n\n}\n\n\n\nimpl DataStream for UdpDataStream {\n\n fn write_data<'a>(\n","file_path":"fastpay/src/transport.rs","rank":89,"score":61472.475167669756},{"content":"/// An implementation of DataStream based on TCP.\n\nstruct TcpDataStream {\n\n stream: TcpStream,\n\n max_data_size: usize,\n\n}\n\n\n\nimpl TcpDataStream {\n\n async fn connect(address: String, max_data_size: usize) -> Result<Self, std::io::Error> {\n\n let stream = TcpStream::connect(address).await?;\n\n stream.set_send_buffer_size(max_data_size)?;\n\n stream.set_recv_buffer_size(max_data_size)?;\n\n Ok(Self {\n\n stream,\n\n max_data_size,\n\n })\n\n }\n\n\n\n async fn tcp_write_data<S>(stream: &mut S, buffer: &[u8]) -> Result<(), std::io::Error>\n\n where\n\n S: AsyncWrite + Unpin,\n\n {\n","file_path":"fastpay/src/transport.rs","rank":90,"score":61472.475167669756},{"content":"struct RunningServerState {\n\n server: Server,\n\n cross_shard_sender: mpsc::Sender<(Vec<u8>, ShardId)>,\n\n}\n\n\n\nimpl MessageHandler for RunningServerState {\n\n fn handle_message<'a>(\n\n &'a mut self,\n\n buffer: &'a [u8],\n\n ) -> futures::future::BoxFuture<'a, Option<Vec<u8>>> {\n\n Box::pin(async move {\n\n let result = deserialize_message(buffer);\n\n let reply = match result {\n\n Err(_) => Err(FastPayError::InvalidDecoding),\n\n Ok(result) => {\n\n match result {\n\n SerializedMessage::Order(message) => self\n\n .server\n\n .state\n\n .handle_transfer_order(*message)\n","file_path":"fastpay/src/network.rs","rank":91,"score":61472.475167669756},{"content":"/// An implementation of DataStreamPool based on UDP.\n\nstruct UdpDataStreamPool {\n\n socket: UdpSocket,\n\n}\n\n\n\nimpl UdpDataStreamPool {\n\n async fn new() -> Result<Self, std::io::Error> {\n\n let socket = UdpSocket::bind(&\"0.0.0.0:0\").await?;\n\n Ok(Self { socket })\n\n }\n\n}\n\n\n\nimpl DataStreamPool for UdpDataStreamPool {\n\n fn send_data_to<'a>(\n\n &'a mut self,\n\n buffer: &'a [u8],\n\n address: &'a str,\n\n ) -> future::BoxFuture<'a, Result<(), std::io::Error>> {\n\n Box::pin(async move {\n\n self.socket.send_to(buffer, address).await?;\n\n Ok(())\n","file_path":"fastpay/src/transport.rs","rank":92,"score":60322.67795442079},{"content":"/// An implementation of DataStreamPool based on TCP.\n\nstruct TcpDataStreamPool {\n\n streams: HashMap<String, TcpStream>,\n\n}\n\n\n\nimpl TcpDataStreamPool {\n\n async fn new() -> Result<Self, std::io::Error> {\n\n let streams = HashMap::new();\n\n Ok(Self { streams })\n\n }\n\n\n\n async fn get_stream(&mut self, address: &str) -> Result<&mut TcpStream, io::Error> {\n\n if !self.streams.contains_key(address) {\n\n match TcpStream::connect(address).await {\n\n Ok(s) => {\n\n self.streams.insert(address.to_string(), s);\n\n }\n\n Err(error) => {\n\n error!(\"Failed to open connection to {}: {}\", address, error);\n\n return Err(error);\n\n }\n","file_path":"fastpay/src/transport.rs","rank":93,"score":60322.67795442079},{"content":"fn main() {\n\n env_logger::from_env(env_logger::Env::default().default_filter_or(\"info\")).init();\n\n let benchmark = ClientServerBenchmark::from_command_line();\n\n\n\n let (states, orders) = benchmark.make_structures();\n\n\n\n // Start the servers on the thread pool\n\n for state in states {\n\n // Make special single-core runtime for each server\n\n let b = benchmark.clone();\n\n thread::spawn(move || {\n\n let mut runtime = Builder::new()\n\n .enable_all()\n\n .basic_scheduler()\n\n .thread_stack_size(15 * 1024 * 1024)\n\n .build()\n\n .unwrap();\n\n\n\n runtime.block_on(async move {\n\n let server = b.spawn_server(state).await;\n","file_path":"fastpay/src/bench.rs","rank":94,"score":59507.31646621789},{"content":"fn main() {\n\n env_logger::from_env(env_logger::Env::default().default_filter_or(\"info\")).init();\n\n let matches = ClientOpt::from_args();\n\n\n\n let send_timeout = Duration::from_micros(matches.send_timeout);\n\n let recv_timeout = Duration::from_micros(matches.recv_timeout);\n\n let accounts_config_path = &matches.accounts;\n\n let committee_config_path = &matches.committee;\n\n let buffer_size = matches.buffer_size.parse::<usize>().unwrap();\n\n\n\n let mut accounts_config =\n\n AccountsConfig::read_or_create(accounts_config_path).expect(\"Unable to read user accounts\");\n\n let committee_config =\n\n CommitteeConfig::read(committee_config_path).expect(\"Unable to read committee config file\");\n\n\n\n match matches.cmd {\n\n ClientCommands::Transfer { from, to, amount } => {\n\n let sender = decode_address(&from).expect(\"Failed to decode sender's address\");\n\n let recipient = decode_address(&to).expect(\"Failed to decode recipient's address\");\n\n let amount = Amount::from(amount);\n","file_path":"fastpay/src/client.rs","rank":95,"score":59507.31646621789},{"content":"fn main() {\n\n env_logger::from_env(env_logger::Env::default().default_filter_or(\"info\")).init();\n\n let matches = ServerOpt::from_args();\n\n\n\n let server_config_path = &matches.server;\n\n\n\n match matches.cmd {\n\n ServerCommands::Run {\n\n buffer_size,\n\n cross_shard_queue_size,\n\n committee,\n\n initial_accounts,\n\n initial_balance,\n\n shard,\n\n } => {\n\n let committee_config_path = &committee;\n\n let initial_accounts_config_path = &initial_accounts;\n\n let initial_balance = Balance::from(initial_balance.parse::<i128>().unwrap());\n\n let buffer_size = buffer_size.parse::<usize>().unwrap();\n\n // let parsed_cross_shard_queue_size = cross_shard_queue_size.parse::<usize>().unwrap();\n","file_path":"fastpay/src/server.rs","rank":96,"score":59507.31646621789},{"content":"struct TestService {\n\n counter: Arc<AtomicUsize>,\n\n}\n\n\n\nimpl TestService {\n\n fn new(counter: Arc<AtomicUsize>) -> Self {\n\n TestService { counter }\n\n }\n\n}\n\n\n\nimpl MessageHandler for TestService {\n\n fn handle_message<'a>(\n\n &'a mut self,\n\n buffer: &'a [u8],\n\n ) -> future::BoxFuture<'a, Option<Vec<u8>>> {\n\n self.counter.fetch_add(buffer.len(), Ordering::Relaxed);\n\n Box::pin(async move { Some(Vec::from(buffer)) })\n\n }\n\n}\n\n\n","file_path":"fastpay/src/unit_tests/transport_tests.rs","rank":97,"score":59251.297793067555},{"content":"fn make_servers(\n\n local_ip_addr: &str,\n\n server_config_path: &str,\n\n committee_config_path: &str,\n\n initial_accounts_config_path: &str,\n\n initial_balance: Balance,\n\n buffer_size: usize,\n\n cross_shard_queue_size: usize,\n\n) -> Vec<network::Server> {\n\n let server_config =\n\n AuthorityServerConfig::read(server_config_path).expect(\"Fail to read server config\");\n\n let num_shards = server_config.authority.num_shards;\n\n\n\n let mut servers = Vec::new();\n\n for shard in 0..num_shards {\n\n servers.push(make_shard_server(\n\n local_ip_addr,\n\n server_config_path,\n\n committee_config_path,\n\n initial_accounts_config_path,\n","file_path":"fastpay/src/server.rs","rank":98,"score":58224.63259561843},{"content":"#[allow(clippy::too_many_arguments)]\n\nfn make_shard_server(\n\n local_ip_addr: &str,\n\n server_config_path: &str,\n\n committee_config_path: &str,\n\n initial_accounts_config_path: &str,\n\n initial_balance: Balance,\n\n buffer_size: usize,\n\n cross_shard_queue_size: usize,\n\n shard: u32,\n\n) -> network::Server {\n\n let server_config =\n\n AuthorityServerConfig::read(server_config_path).expect(\"Fail to read server config\");\n\n let committee_config =\n\n CommitteeConfig::read(committee_config_path).expect(\"Fail to read committee config\");\n\n let initial_accounts_config = InitialStateConfig::read(initial_accounts_config_path)\n\n .expect(\"Fail to read initial account config\");\n\n\n\n let committee = Committee::new(committee_config.voting_rights());\n\n let num_shards = server_config.authority.num_shards;\n\n\n","file_path":"fastpay/src/server.rs","rank":99,"score":57035.83163537602}],"string":"[\n {\n \"content\": \"pub fn serialize_info_request(value: &AccountInfoRequest) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::InfoReq(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 0,\n \"score\": 194362.98059485495\n },\n {\n \"content\": \"pub fn serialize_transfer_order_into<W>(\\n\\n writer: W,\\n\\n value: &TransferOrder,\\n\\n) -> Result<(), failure::Error>\\n\\nwhere\\n\\n W: std::io::Write,\\n\\n{\\n\\n serialize_into(writer, &ShallowSerializedMessage::Order(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 1,\n \"score\": 157893.60208946266\n },\n {\n \"content\": \"pub fn serialize_transfer_order(value: &TransferOrder) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::Order(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 3,\n \"score\": 154285.15679357952\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_unknown_sender() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\\n\\n let (unknown_address, unknown_key) = get_key_pair();\\n\\n\\n\\n let mut unknown_sender_transfer = transfer_order.transfer;\\n\\n unknown_sender_transfer.sender = unknown_address;\\n\\n let unknown_sender_transfer_order = TransferOrder::new(unknown_sender_transfer, &unknown_key);\\n\\n assert!(authority_state\\n\\n .handle_transfer_order(unknown_sender_transfer_order)\\n\\n .is_err());\\n\\n assert!(authority_state\\n\\n .accounts\\n\\n .get(&sender)\\n\\n .unwrap()\\n\\n .pending_confirmation\\n\\n .is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 4,\n \"score\": 153592.5007522364\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_exceed_balance() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(1000));\\n\\n assert!(authority_state\\n\\n .handle_transfer_order(transfer_order)\\n\\n .is_err());\\n\\n assert!(authority_state\\n\\n .accounts\\n\\n .get(&sender)\\n\\n .unwrap()\\n\\n .pending_confirmation\\n\\n .is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 5,\n \"score\": 153527.35173890644\n },\n {\n \"content\": \"pub fn serialize_vote_into<W>(writer: W, value: &SignedTransferOrder) -> Result<(), failure::Error>\\n\\nwhere\\n\\n W: std::io::Write,\\n\\n{\\n\\n serialize_into(writer, &ShallowSerializedMessage::Vote(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 6,\n \"score\": 151376.43877805182\n },\n {\n \"content\": \"/// The underlying data-fetching mechanism to be provided by the user.\\n\\npub trait Requester {\\n\\n type Key: std::cmp::Ord + Send + Sync + Clone + 'static;\\n\\n type Value: std::fmt::Debug + Send + Clone + 'static;\\n\\n\\n\\n /// Request the value corresponding to the given key.\\n\\n fn query(&mut self, key: Self::Key) -> future::BoxFuture<Self::Value>;\\n\\n}\\n\\n\\n\\n/// Channel for using code to send requests and stop the downloader task.\\n\\n#[derive(Clone)]\\n\\npub struct DownloadHandle<K, V>(mpsc::UnboundedSender<DownloadCommand<K, V>>);\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/downloader.rs\",\n \"rank\": 7,\n \"score\": 147933.240499813\n },\n {\n \"content\": \"/// The handler required to create a service.\\n\\npub trait MessageHandler {\\n\\n fn handle_message<'a>(&'a mut self, buffer: &'a [u8])\\n\\n -> future::BoxFuture<'a, Option<Vec<u8>>>;\\n\\n}\\n\\n\\n\\n/// The result of spawning a server is oneshot channel to kill it and a handle to track completion.\\n\\npub struct SpawnedServer {\\n\\n complete: futures::channel::oneshot::Sender<()>,\\n\\n handle: tokio::task::JoinHandle<Result<(), std::io::Error>>,\\n\\n}\\n\\n\\n\\nimpl SpawnedServer {\\n\\n pub async fn join(self) -> Result<(), std::io::Error> {\\n\\n // Note that dropping `self.complete` would terminate the server.\\n\\n self.handle.await??;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub async fn kill(self) -> Result<(), std::io::Error> {\\n\\n self.complete.send(()).unwrap();\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 8,\n \"score\": 147642.62443053542\n },\n {\n \"content\": \"pub fn deserialize_message<R>(reader: R) -> Result<SerializedMessage, failure::Error>\\n\\nwhere\\n\\n R: std::io::Read,\\n\\n{\\n\\n bincode::deserialize_from(reader).map_err(|err| format_err!(\\\"{}\\\", err))\\n\\n}\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 9,\n \"score\": 145995.2734671379\n },\n {\n \"content\": \"pub trait AuthorityClient {\\n\\n /// Initiate a new transfer to a FastPay or Primary account.\\n\\n fn handle_transfer_order(\\n\\n &mut self,\\n\\n order: TransferOrder,\\n\\n ) -> AsyncResult<AccountInfoResponse, FastPayError>;\\n\\n\\n\\n /// Confirm a transfer to a FastPay or Primary account.\\n\\n fn handle_confirmation_order(\\n\\n &mut self,\\n\\n order: ConfirmationOrder,\\n\\n ) -> AsyncResult<AccountInfoResponse, FastPayError>;\\n\\n\\n\\n /// Handle information requests for this account.\\n\\n fn handle_account_info_request(\\n\\n &mut self,\\n\\n request: AccountInfoRequest,\\n\\n ) -> AsyncResult<AccountInfoResponse, FastPayError>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/client.rs\",\n \"rank\": 10,\n \"score\": 143749.28027373744\n },\n {\n \"content\": \"pub fn serialize_info_response(value: &AccountInfoResponse) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::InfoResp(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 11,\n \"score\": 141705.35152617618\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_transfer_order(\\n\\n sender: FastPayAddress,\\n\\n secret: &SecretKey,\\n\\n recipient: Address,\\n\\n amount: Amount,\\n\\n) -> TransferOrder {\\n\\n let transfer = Transfer {\\n\\n sender,\\n\\n recipient,\\n\\n amount,\\n\\n sequence_number: SequenceNumber::new(),\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n TransferOrder::new(transfer, &secret)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 12,\n \"score\": 137332.08736607034\n },\n {\n \"content\": \"pub fn serialize_vote(value: &SignedTransferOrder) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::Vote(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 13,\n \"score\": 133899.66218099496\n },\n {\n \"content\": \"pub fn serialize_cert(value: &CertifiedTransferOrder) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::Cert(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 14,\n \"score\": 133899.66218099496\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_certified_transfer_order(\\n\\n sender: FastPayAddress,\\n\\n secret: &SecretKey,\\n\\n recipient: Address,\\n\\n amount: Amount,\\n\\n authority_state: &AuthorityState,\\n\\n) -> CertifiedTransferOrder {\\n\\n let transfer_order = init_transfer_order(sender, secret, recipient, amount);\\n\\n let vote = SignedTransferOrder::new(\\n\\n transfer_order.clone(),\\n\\n authority_state.name,\\n\\n &authority_state.secret,\\n\\n );\\n\\n let mut builder =\\n\\n SignatureAggregator::try_new(transfer_order, &authority_state.committee).unwrap();\\n\\n builder\\n\\n .append(vote.authority, vote.signature)\\n\\n .unwrap()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 15,\n \"score\": 133879.92879010906\n },\n {\n \"content\": \"pub fn get_key_pair() -> (FastPayAddress, SecretKey) {\\n\\n let mut csprng = OsRng;\\n\\n let keypair = dalek::Keypair::generate(&mut csprng);\\n\\n (\\n\\n EdPublicKeyBytes(keypair.public.to_bytes()),\\n\\n SecretKey(keypair.to_bytes()),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 16,\n \"score\": 133016.43165214764\n },\n {\n \"content\": \"pub fn serialize_cross_shard(value: &CertifiedTransferOrder) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::CrossShard(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 17,\n \"score\": 131006.42165221006\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_ok() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\\n\\n\\n\\n let account_info = authority_state\\n\\n .handle_transfer_order(transfer_order)\\n\\n .unwrap();\\n\\n let pending_confirmation = authority_state\\n\\n .accounts\\n\\n .get(&sender)\\n\\n .unwrap()\\n\\n .pending_confirmation\\n\\n .clone()\\n\\n .unwrap();\\n\\n assert_eq!(\\n\\n account_info.pending_confirmation.unwrap(),\\n\\n pending_confirmation\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 18,\n \"score\": 130634.95038400369\n },\n {\n \"content\": \"#[cfg(test)]\\n\\npub fn dbg_addr(name: u8) -> FastPayAddress {\\n\\n let addr = [name; dalek::PUBLIC_KEY_LENGTH];\\n\\n EdPublicKeyBytes(addr)\\n\\n}\\n\\n\\n\\n// TODO: Remove Eq, PartialEq, Ord, PartialOrd and Hash from signatures.\\n\\n#[derive(Eq, PartialEq, Ord, PartialOrd, Copy, Clone, Hash, Serialize, Deserialize)]\\n\\npub struct Signature {\\n\\n pub part1: [u8; dalek::SIGNATURE_LENGTH / 2],\\n\\n pub part2: [u8; dalek::SIGNATURE_LENGTH / 2],\\n\\n}\\n\\n\\n\\n// Zero the secret key when unallocating.\\n\\nimpl Drop for SecretKey {\\n\\n fn drop(&mut self) {\\n\\n for i in 0..dalek::KEYPAIR_LENGTH {\\n\\n self.0[i] = 0;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 19,\n \"score\": 129913.04456752786\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_confirmation_order_unknown_sender() {\\n\\n let recipient = dbg_addr(2);\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let mut authority_state = init_state();\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n sender,\\n\\n &sender_key,\\n\\n Address::FastPay(recipient),\\n\\n Amount::from(5),\\n\\n &authority_state,\\n\\n );\\n\\n\\n\\n assert!(authority_state\\n\\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\\n\\n .is_ok());\\n\\n assert!(authority_state.accounts.get(&recipient).is_some());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 20,\n \"score\": 127810.01687466819\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_confirmation_order_exceed_balance() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = dbg_addr(2);\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n sender,\\n\\n &sender_key,\\n\\n Address::FastPay(recipient),\\n\\n Amount::from(1000),\\n\\n &authority_state,\\n\\n );\\n\\n assert!(authority_state\\n\\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\\n\\n .is_ok());\\n\\n let new_account = authority_state.accounts.get(&sender).unwrap();\\n\\n assert_eq!(Balance::from(-995), new_account.balance);\\n\\n assert_eq!(SequenceNumber::from(1), new_account.next_sequence_number);\\n\\n assert_eq!(new_account.confirmed_log.len(), 1);\\n\\n assert!(authority_state.accounts.get(&recipient).is_some());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 21,\n \"score\": 127744.86786133825\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_zero_amount() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\\n\\n\\n\\n // test transfer non-positive amount\\n\\n let mut zero_amount_transfer = transfer_order.transfer;\\n\\n zero_amount_transfer.amount = Amount::zero();\\n\\n let zero_amount_transfer_order = TransferOrder::new(zero_amount_transfer, &sender_key);\\n\\n assert!(authority_state\\n\\n .handle_transfer_order(zero_amount_transfer_order)\\n\\n .is_err());\\n\\n assert!(authority_state\\n\\n .accounts\\n\\n .get(&sender)\\n\\n .unwrap()\\n\\n .pending_confirmation\\n\\n .is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 22,\n \"score\": 127579.04472782314\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_bad_signature() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\\n\\n let (_unknown_address, unknown_key) = get_key_pair();\\n\\n let mut bad_signature_transfer_order = transfer_order.clone();\\n\\n bad_signature_transfer_order.signature = Signature::new(&transfer_order.transfer, &unknown_key);\\n\\n assert!(authority_state\\n\\n .handle_transfer_order(bad_signature_transfer_order)\\n\\n .is_err());\\n\\n assert!(authority_state\\n\\n .accounts\\n\\n .get(&sender)\\n\\n .unwrap()\\n\\n .pending_confirmation\\n\\n .is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 23,\n \"score\": 127579.04472782314\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_double_spend() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\\n\\n\\n\\n let signed_order = authority_state\\n\\n .handle_transfer_order(transfer_order.clone())\\n\\n .unwrap();\\n\\n let double_spend_signed_order = authority_state\\n\\n .handle_transfer_order(transfer_order)\\n\\n .unwrap();\\n\\n assert_eq!(signed_order, double_spend_signed_order);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 24,\n \"score\": 127579.04472782314\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receiving_unconfirmed_transfer_with_lagging_sender_balances() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n let (mut authority_clients, committee) = init_local_authorities(4);\\n\\n let mut client0 = make_client(authority_clients.clone(), committee.clone());\\n\\n let mut client1 = make_client(authority_clients.clone(), committee.clone());\\n\\n let mut client2 = make_client(authority_clients.clone(), committee);\\n\\n fund_account(&mut authority_clients, client0.address, vec![2, 3, 4, 4]);\\n\\n // not updating client balances\\n\\n\\n\\n // transferring funds from client0 to client1.\\n\\n // confirming to a quorum of node only at the end.\\n\\n rt.block_on(async {\\n\\n client0\\n\\n .transfer_to_fastpay_unsafe_unconfirmed(\\n\\n Amount::from(1),\\n\\n client1.address,\\n\\n UserData::default(),\\n\\n )\\n\\n .await\\n\\n .unwrap();\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 25,\n \"score\": 125491.87557924891\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_confirmation_order_receiver_equal_sender() {\\n\\n let (address, key) = get_key_pair();\\n\\n let mut authority_state = init_state_with_account(address, Balance::from(1));\\n\\n\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n address,\\n\\n &key,\\n\\n Address::FastPay(address),\\n\\n Amount::from(10),\\n\\n &authority_state,\\n\\n );\\n\\n assert!(authority_state\\n\\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\\n\\n .is_ok());\\n\\n let account = authority_state.accounts.get(&address).unwrap();\\n\\n assert_eq!(Balance::from(1), account.balance);\\n\\n assert_eq!(SequenceNumber::from(1), account.next_sequence_number);\\n\\n assert_eq!(account.confirmed_log.len(), 1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 26,\n \"score\": 124920.58846230656\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_confirmation_order_receiver_balance_overflow() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let (recipient, _) = get_key_pair();\\n\\n let mut authority_state = init_state_with_accounts(vec![\\n\\n (sender, Balance::from(1)),\\n\\n (recipient, Balance::max()),\\n\\n ]);\\n\\n\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n sender,\\n\\n &sender_key,\\n\\n Address::FastPay(recipient),\\n\\n Amount::from(1),\\n\\n &authority_state,\\n\\n );\\n\\n assert!(authority_state\\n\\n .handle_confirmation_order(ConfirmationOrder::new(certified_transfer_order))\\n\\n .is_ok());\\n\\n let new_sender_account = authority_state.accounts.get(&sender).unwrap();\\n\\n assert_eq!(Balance::from(0), new_sender_account.balance);\\n\\n assert_eq!(\\n\\n SequenceNumber::from(1),\\n\\n new_sender_account.next_sequence_number\\n\\n );\\n\\n assert_eq!(new_sender_account.confirmed_log.len(), 1);\\n\\n let new_recipient_account = authority_state.accounts.get(&recipient).unwrap();\\n\\n assert_eq!(Balance::max(), new_recipient_account.balance);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 27,\n \"score\": 124857.28371437336\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_transfer_order_bad_sequence_number() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = Address::FastPay(dbg_addr(2));\\n\\n let authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let transfer_order = init_transfer_order(sender, &sender_key, recipient, Amount::from(5));\\n\\n\\n\\n let mut sequence_number_state = authority_state;\\n\\n let sequence_number_state_sender_account =\\n\\n sequence_number_state.accounts.get_mut(&sender).unwrap();\\n\\n sequence_number_state_sender_account.next_sequence_number =\\n\\n sequence_number_state_sender_account\\n\\n .next_sequence_number\\n\\n .increment()\\n\\n .unwrap();\\n\\n assert!(sequence_number_state\\n\\n .handle_transfer_order(transfer_order)\\n\\n .is_err());\\n\\n assert!(sequence_number_state\\n\\n .accounts\\n\\n .get(&sender)\\n\\n .unwrap()\\n\\n .pending_confirmation\\n\\n .is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 28,\n \"score\": 124696.15477116886\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_state_with_account(address: FastPayAddress, balance: Balance) -> AuthorityState {\\n\\n init_state_with_accounts(std::iter::once((address, balance)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 29,\n \"score\": 124511.14023599261\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_contract() -> (FastPaySmartContractState, AuthorityName, SecretKey) {\\n\\n let (authority_address, authority_key) = get_key_pair();\\n\\n let mut authorities = BTreeMap::new();\\n\\n authorities.insert(\\n\\n /* address */ authority_address,\\n\\n /* voting right */ 1,\\n\\n );\\n\\n let committee = Committee::new(authorities);\\n\\n (\\n\\n FastPaySmartContractState::new(committee),\\n\\n authority_address,\\n\\n authority_key,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/fastpay_smart_contract_tests.rs\",\n \"rank\": 30,\n \"score\": 123562.683706282\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct CertificateRequester<A> {\\n\\n committee: Committee,\\n\\n authority_clients: Vec<A>,\\n\\n sender: FastPayAddress,\\n\\n}\\n\\n\\n\\nimpl<A> CertificateRequester<A> {\\n\\n fn new(committee: Committee, authority_clients: Vec<A>, sender: FastPayAddress) -> Self {\\n\\n Self {\\n\\n committee,\\n\\n authority_clients,\\n\\n sender,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<A> Requester for CertificateRequester<A>\\n\\nwhere\\n\\n A: AuthorityClient + Send + Sync + 'static + Clone,\\n\\n{\\n\",\n \"file_path\": \"fastpay_core/src/client.rs\",\n \"rank\": 31,\n \"score\": 123220.72010583986\n },\n {\n \"content\": \"pub fn serialize_message(msg: &SerializedMessage) -> Vec<u8> {\\n\\n serialize(msg)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 32,\n \"score\": 120601.69925994126\n },\n {\n \"content\": \"/// Make one transfer order per account, up to `max_orders` transfers.\\n\\nfn make_benchmark_transfer_orders(\\n\\n accounts_config: &mut AccountsConfig,\\n\\n max_orders: usize,\\n\\n) -> (Vec<TransferOrder>, Vec<(FastPayAddress, Bytes)>) {\\n\\n let mut orders = Vec::new();\\n\\n let mut serialized_orders = Vec::new();\\n\\n // TODO: deterministic sequence of orders to recover from interrupted benchmarks.\\n\\n let mut next_recipient = get_key_pair().0;\\n\\n for account in accounts_config.accounts_mut() {\\n\\n let transfer = Transfer {\\n\\n sender: account.address,\\n\\n recipient: Address::FastPay(next_recipient),\\n\\n amount: Amount::from(1),\\n\\n sequence_number: account.next_sequence_number,\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n debug!(\\\"Preparing transfer order: {:?}\\\", transfer);\\n\\n account.next_sequence_number = account.next_sequence_number.increment().unwrap();\\n\\n next_recipient = account.address;\\n\\n let order = TransferOrder::new(transfer.clone(), &account.key);\\n\\n orders.push(order.clone());\\n\\n let serialized_order = serialize_transfer_order(&order);\\n\\n serialized_orders.push((account.address, serialized_order.into()));\\n\\n if serialized_orders.len() >= max_orders {\\n\\n break;\\n\\n }\\n\\n }\\n\\n (orders, serialized_orders)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 33,\n \"score\": 118390.0622811185\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_primary_synchronization_order(recipient: FastPayAddress) -> PrimarySynchronizationOrder {\\n\\n let mut transaction_index = VersionNumber::new();\\n\\n transaction_index = transaction_index.increment().unwrap();\\n\\n PrimarySynchronizationOrder {\\n\\n recipient,\\n\\n amount: Amount::from(5),\\n\\n transaction_index,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 34,\n \"score\": 117298.5403015507\n },\n {\n \"content\": \"// Operations are considered successful when they successfully reach a quorum of authorities.\\n\\npub trait Client {\\n\\n /// Send money to a FastPay account.\\n\\n fn transfer_to_fastpay(\\n\\n &mut self,\\n\\n amount: Amount,\\n\\n recipient: FastPayAddress,\\n\\n user_data: UserData,\\n\\n ) -> AsyncResult<CertifiedTransferOrder, failure::Error>;\\n\\n\\n\\n /// Send money to a Primary account.\\n\\n fn transfer_to_primary(\\n\\n &mut self,\\n\\n amount: Amount,\\n\\n recipient: PrimaryAddress,\\n\\n user_data: UserData,\\n\\n ) -> AsyncResult<CertifiedTransferOrder, failure::Error>;\\n\\n\\n\\n /// Receive money from FastPay.\\n\\n fn receive_from_fastpay(\\n\\n &mut self,\\n\",\n \"file_path\": \"fastpay_core/src/client.rs\",\n \"rank\": 35,\n \"score\": 115273.27480709559\n },\n {\n \"content\": \"#[test]\\n\\nfn test_account_state_unknown_account() {\\n\\n let sender = dbg_addr(1);\\n\\n let unknown_address = dbg_addr(99);\\n\\n let authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n assert!(authority_state.account_state(&unknown_address).is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 36,\n \"score\": 114553.32958012784\n },\n {\n \"content\": \"pub trait Digestible {\\n\\n fn digest(&self) -> [u8; 32];\\n\\n}\\n\\n\\n\\nimpl Digestible for [u8; 5] {\\n\\n fn digest(self: &[u8; 5]) -> [u8; 32] {\\n\\n let mut h = dalek::Sha512::new();\\n\\n let mut hash = [0u8; 64];\\n\\n let mut digest = [0u8; 32];\\n\\n h.update(&self);\\n\\n hash.copy_from_slice(h.finalize().as_slice());\\n\\n digest.copy_from_slice(&hash[..32]);\\n\\n digest\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Signature {\\n\\n pub fn to_array(&self) -> [u8; 64] {\\n\\n let mut sig: [u8; 64] = [0; 64];\\n\\n sig[0..32].clone_from_slice(&self.part1);\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 37,\n \"score\": 112975.84464491416\n },\n {\n \"content\": \"#[test]\\n\\nfn test_certificates() {\\n\\n let (a1, sec1) = get_key_pair();\\n\\n let (a2, sec2) = get_key_pair();\\n\\n let (a3, sec3) = get_key_pair();\\n\\n\\n\\n let mut authorities = BTreeMap::new();\\n\\n authorities.insert(/* address */ a1, /* voting right */ 1);\\n\\n authorities.insert(/* address */ a2, /* voting right */ 1);\\n\\n let committee = Committee::new(authorities);\\n\\n\\n\\n let transfer = Transfer {\\n\\n sender: a1,\\n\\n recipient: Address::FastPay(a2),\\n\\n amount: Amount::from(1),\\n\\n sequence_number: SequenceNumber::new(),\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n let order = TransferOrder::new(transfer.clone(), &sec1);\\n\\n let bad_order = TransferOrder::new(transfer, &sec2);\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/messages_tests.rs\",\n \"rank\": 38,\n \"score\": 112555.10147777494\n },\n {\n \"content\": \"/// Try to make certificates from orders and server configs\\n\\nfn make_benchmark_certificates_from_orders_and_server_configs(\\n\\n orders: Vec<TransferOrder>,\\n\\n server_config: Vec<&str>,\\n\\n) -> Vec<(FastPayAddress, Bytes)> {\\n\\n let mut keys = Vec::new();\\n\\n for file in server_config {\\n\\n let server_config = AuthorityServerConfig::read(file).expect(\\\"Fail to read server config\\\");\\n\\n keys.push((server_config.authority.address, server_config.key));\\n\\n }\\n\\n let mut serialized_certificates = Vec::new();\\n\\n for order in orders {\\n\\n let mut certificate = CertifiedTransferOrder {\\n\\n value: order.clone(),\\n\\n signatures: Vec::new(),\\n\\n };\\n\\n let committee = Committee {\\n\\n voting_rights: keys.iter().map(|(k, _)| (*k, 1)).collect(),\\n\\n total_votes: keys.len(),\\n\\n };\\n\\n for i in 0..committee.quorum_threshold() {\\n\\n let (pubx, secx) = keys.get(i).unwrap();\\n\\n let sig = Signature::new(&certificate.value, secx);\\n\\n certificate.signatures.push((*pubx, sig));\\n\\n }\\n\\n let serialized_certificate = serialize_cert(&certificate);\\n\\n serialized_certificates.push((order.transfer.sender, serialized_certificate.into()));\\n\\n }\\n\\n serialized_certificates\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 39,\n \"score\": 112537.19933158555\n },\n {\n \"content\": \"pub fn decode_address(s: &str) -> Result<EdPublicKeyBytes, failure::Error> {\\n\\n let value = base64::decode(s)?;\\n\\n let mut address = [0u8; dalek::PUBLIC_KEY_LENGTH];\\n\\n address.copy_from_slice(&value[..dalek::PUBLIC_KEY_LENGTH]);\\n\\n Ok(EdPublicKeyBytes(address))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 40,\n \"score\": 112269.51660529662\n },\n {\n \"content\": \"#[test]\\n\\nfn test_info_request() {\\n\\n let req1 = AccountInfoRequest {\\n\\n sender: dbg_addr(0x20),\\n\\n request_sequence_number: None,\\n\\n request_received_transfers_excluding_first_nth: None,\\n\\n };\\n\\n let req2 = AccountInfoRequest {\\n\\n sender: dbg_addr(0x20),\\n\\n request_sequence_number: Some(SequenceNumber::from(129)),\\n\\n request_received_transfers_excluding_first_nth: None,\\n\\n };\\n\\n\\n\\n let buf1 = serialize_info_request(&req1);\\n\\n let buf2 = serialize_info_request(&req2);\\n\\n\\n\\n let result1 = deserialize_message(buf1.as_slice());\\n\\n let result2 = deserialize_message(buf2.as_slice());\\n\\n assert!(result1.is_ok());\\n\\n assert!(result2.is_ok());\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/serialize_tests.rs\",\n \"rank\": 41,\n \"score\": 110001.49663798866\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_state_with_accounts<I: IntoIterator<Item = (FastPayAddress, Balance)>>(\\n\\n balances: I,\\n\\n) -> AuthorityState {\\n\\n let mut state = init_state();\\n\\n for (address, balance) in balances {\\n\\n let account = state\\n\\n .accounts\\n\\n .entry(address)\\n\\n .or_insert_with(AccountOffchainState::new);\\n\\n account.balance = balance;\\n\\n }\\n\\n state\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 42,\n \"score\": 109064.62808752991\n },\n {\n \"content\": \"/// How to send and obtain data packets over an \\\"active socket\\\".\\n\\npub trait DataStream: Send {\\n\\n fn write_data<'a>(\\n\\n &'a mut self,\\n\\n buffer: &'a [u8],\\n\\n ) -> future::BoxFuture<'a, Result<(), std::io::Error>>;\\n\\n fn read_data(&mut self) -> future::BoxFuture<Result<Vec<u8>, std::io::Error>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 43,\n \"score\": 107414.47643578096\n },\n {\n \"content\": \"#[test]\\n\\nfn test_account_state_ok() {\\n\\n let sender = dbg_addr(1);\\n\\n let authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n assert_eq!(\\n\\n authority_state.accounts.get(&sender).unwrap(),\\n\\n authority_state.account_state(&sender).unwrap()\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 44,\n \"score\": 106737.39241712165\n },\n {\n \"content\": \"/// A pool of (outgoing) data streams.\\n\\npub trait DataStreamPool: Send {\\n\\n fn send_data_to<'a>(\\n\\n &'a mut self,\\n\\n buffer: &'a [u8],\\n\\n address: &'a str,\\n\\n ) -> future::BoxFuture<'a, Result<(), io::Error>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 45,\n \"score\": 105277.25146172913\n },\n {\n \"content\": \"pub trait FastPaySmartContract {\\n\\n /// Initiate a transfer from Primary to FastPay.\\n\\n fn handle_funding_transaction(\\n\\n &mut self,\\n\\n transaction: FundingTransaction,\\n\\n ) -> Result<(), failure::Error>;\\n\\n\\n\\n /// Finalize a transfer from FastPay to Primary.\\n\\n fn handle_redeem_transaction(\\n\\n &mut self,\\n\\n transaction: RedeemTransaction,\\n\\n ) -> Result<(), failure::Error>;\\n\\n}\\n\\n\\n\\nimpl FastPaySmartContract for FastPaySmartContractState {\\n\\n /// Initiate a transfer to FastPay.\\n\\n fn handle_funding_transaction(\\n\\n &mut self,\\n\\n transaction: FundingTransaction,\\n\\n ) -> Result<(), failure::Error> {\\n\",\n \"file_path\": \"fastpay_core/src/fastpay_smart_contract.rs\",\n \"rank\": 46,\n \"score\": 105220.34163038354\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_confirmation_order_ok() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = dbg_addr(2);\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n sender,\\n\\n &sender_key,\\n\\n Address::FastPay(recipient),\\n\\n Amount::from(5),\\n\\n &authority_state,\\n\\n );\\n\\n\\n\\n let old_account = authority_state.accounts.get_mut(&sender).unwrap();\\n\\n let mut next_sequence_number = old_account.next_sequence_number;\\n\\n next_sequence_number = next_sequence_number.increment().unwrap();\\n\\n let mut remaining_balance = old_account.balance;\\n\\n remaining_balance = remaining_balance\\n\\n .try_sub(certified_transfer_order.value.transfer.amount.into())\\n\\n .unwrap();\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 47,\n \"score\": 104078.80283028545\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct LocalRequester(Arc<AtomicU32>);\\n\\n\\n\\nimpl LocalRequester {\\n\\n fn new() -> Self {\\n\\n Self(Arc::new(AtomicU32::new(0)))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Requester for LocalRequester {\\n\\n type Key = &'static str;\\n\\n type Value = u32;\\n\\n\\n\\n fn query(&mut self, _key: Self::Key) -> future::BoxFuture<Self::Value> {\\n\\n Box::pin(future::ready(self.0.fetch_add(1, Ordering::Relaxed)))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/downloader_tests.rs\",\n \"rank\": 48,\n \"score\": 102829.52628301513\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_cross_shard_recipient_commit() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let (recipient, _) = get_key_pair();\\n\\n // Sender has no account on this shard.\\n\\n let mut authority_state = init_state_with_account(recipient, Balance::from(1));\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n sender,\\n\\n &sender_key,\\n\\n Address::FastPay(recipient),\\n\\n Amount::from(10),\\n\\n &authority_state,\\n\\n );\\n\\n assert!(authority_state\\n\\n .handle_cross_shard_recipient_commit(certified_transfer_order)\\n\\n .is_ok());\\n\\n let account = authority_state.accounts.get(&recipient).unwrap();\\n\\n assert_eq!(Balance::from(11), account.balance);\\n\\n assert_eq!(SequenceNumber::from(0), account.next_sequence_number);\\n\\n assert_eq!(account.confirmed_log.len(), 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 49,\n \"score\": 102072.42191525464\n },\n {\n \"content\": \"pub fn address_from_base64<'de, D>(deserializer: D) -> Result<EdPublicKeyBytes, D::Error>\\n\\nwhere\\n\\n D: serde::de::Deserializer<'de>,\\n\\n{\\n\\n let s = String::deserialize(deserializer)?;\\n\\n let value = decode_address(&s).map_err(|err| serde::de::Error::custom(err.to_string()))?;\\n\\n Ok(value)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 50,\n \"score\": 101818.18592614247\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_primary_synchronization_order_update() {\\n\\n let mut state = init_state();\\n\\n let mut updated_transaction_index = state.last_transaction_index;\\n\\n let address = dbg_addr(1);\\n\\n let order = init_primary_synchronization_order(address);\\n\\n\\n\\n assert!(state\\n\\n .handle_primary_synchronization_order(order.clone())\\n\\n .is_ok());\\n\\n updated_transaction_index = updated_transaction_index.increment().unwrap();\\n\\n assert_eq!(state.last_transaction_index, updated_transaction_index);\\n\\n let account = state.accounts.get(&address).unwrap();\\n\\n assert_eq!(account.balance, order.amount.into());\\n\\n assert_eq!(state.accounts.len(), 1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 51,\n \"score\": 101796.56085025496\n },\n {\n \"content\": \"pub fn serialize_cert_into<W>(\\n\\n writer: W,\\n\\n value: &CertifiedTransferOrder,\\n\\n) -> Result<(), failure::Error>\\n\\nwhere\\n\\n W: std::io::Write,\\n\\n{\\n\\n serialize_into(writer, &ShallowSerializedMessage::Cert(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 52,\n \"score\": 101521.3038620875\n },\n {\n \"content\": \"#[test]\\n\\nfn test_initiating_valid_transfer_despite_bad_authority() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n let (recipient, _) = get_key_pair();\\n\\n\\n\\n let mut sender = init_local_client_state_with_bad_authority(vec![4, 4, 4, 4]);\\n\\n sender.balance = Balance::from(4);\\n\\n let certificate = rt\\n\\n .block_on(sender.transfer_to_fastpay(\\n\\n Amount::from(3),\\n\\n recipient,\\n\\n UserData(Some(*b\\\"hello...........hello...........\\\")),\\n\\n ))\\n\\n .unwrap();\\n\\n assert_eq!(sender.next_sequence_number, SequenceNumber::from(1));\\n\\n assert_eq!(sender.pending_transfer, None);\\n\\n assert_eq!(\\n\\n rt.block_on(sender.get_strong_majority_balance()),\\n\\n Balance::from(1)\\n\\n );\\n\\n assert_eq!(\\n\\n rt.block_on(sender.request_certificate(sender.address, SequenceNumber::from(0)))\\n\\n .unwrap(),\\n\\n certificate\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 53,\n \"score\": 99676.47279025259\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_primary_synchronization_order_double_spend() {\\n\\n let mut state = init_state();\\n\\n let mut updated_transaction_index = state.last_transaction_index;\\n\\n let address = dbg_addr(1);\\n\\n let order = init_primary_synchronization_order(address);\\n\\n\\n\\n assert!(state\\n\\n .handle_primary_synchronization_order(order.clone())\\n\\n .is_ok());\\n\\n updated_transaction_index = updated_transaction_index.increment().unwrap();\\n\\n // Replays are ignored.\\n\\n assert!(state\\n\\n .handle_primary_synchronization_order(order.clone())\\n\\n .is_ok());\\n\\n assert_eq!(state.last_transaction_index, updated_transaction_index);\\n\\n let account = state.accounts.get(&address).unwrap();\\n\\n assert_eq!(account.balance, order.amount.into());\\n\\n assert_eq!(state.accounts.len(), 1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 54,\n \"score\": 99643.53218277049\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_confirmation_order_bad_sequence_number() {\\n\\n let (sender, sender_key) = get_key_pair();\\n\\n let recipient = dbg_addr(2);\\n\\n let mut authority_state = init_state_with_account(sender, Balance::from(5));\\n\\n let sender_account = authority_state.accounts.get_mut(&sender).unwrap();\\n\\n sender_account.next_sequence_number = sender_account.next_sequence_number.increment().unwrap();\\n\\n // let old_account = sender_account;\\n\\n\\n\\n let old_balance;\\n\\n let old_seq_num;\\n\\n {\\n\\n let old_account = authority_state.accounts.get_mut(&sender).unwrap();\\n\\n old_balance = old_account.balance;\\n\\n old_seq_num = old_account.next_sequence_number;\\n\\n }\\n\\n\\n\\n let certified_transfer_order = init_certified_transfer_order(\\n\\n sender,\\n\\n &sender_key,\\n\\n Address::FastPay(recipient),\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 55,\n \"score\": 99643.53218277049\n },\n {\n \"content\": \"pub fn serialize_error(value: &FastPayError) -> Vec<u8> {\\n\\n serialize(&ShallowSerializedMessage::Error(value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 56,\n \"score\": 99460.16962083962\n },\n {\n \"content\": \"fn deserialize_response(response: &[u8]) -> Option<AccountInfoResponse> {\\n\\n match deserialize_message(response) {\\n\\n Ok(SerializedMessage::InfoResp(info)) => Some(*info),\\n\\n Ok(SerializedMessage::Error(error)) => {\\n\\n error!(\\\"Received error value: {}\\\", error);\\n\\n None\\n\\n }\\n\\n Ok(_) => {\\n\\n error!(\\\"Unexpected return value\\\");\\n\\n None\\n\\n }\\n\\n Err(error) => {\\n\\n error!(\\n\\n \\\"Unexpected error: {} while deserializing {:?}\\\",\\n\\n error, response\\n\\n );\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(StructOpt)]\\n\\n#[structopt(\\n\\n name = \\\"FastPay Client\\\",\\n\\n about = \\\"A Byzantine fault tolerant payments sidechain with low-latency finality and high throughput\\\"\\n\\n)]\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 57,\n \"score\": 98038.06714419808\n },\n {\n \"content\": \"pub fn address_as_base64<S>(key: &EdPublicKeyBytes, serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: serde::ser::Serializer,\\n\\n{\\n\\n serializer.serialize_str(&encode_address(key))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 58,\n \"score\": 94682.3675147789\n },\n {\n \"content\": \"fn mass_update_recipients(\\n\\n accounts_config: &mut AccountsConfig,\\n\\n certificates: Vec<(FastPayAddress, Bytes)>,\\n\\n) {\\n\\n for (_sender, buf) in certificates {\\n\\n if let Ok(SerializedMessage::Cert(certificate)) = deserialize_message(&buf[..]) {\\n\\n accounts_config.update_for_received_transfer(*certificate);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 59,\n \"score\": 89727.06094387716\n },\n {\n \"content\": \"fn make_authority_clients(\\n\\n committee_config: &CommitteeConfig,\\n\\n buffer_size: usize,\\n\\n send_timeout: std::time::Duration,\\n\\n recv_timeout: std::time::Duration,\\n\\n) -> HashMap<AuthorityName, network::Client> {\\n\\n let mut authority_clients = HashMap::new();\\n\\n for config in &committee_config.authorities {\\n\\n let config = config.clone();\\n\\n let client = network::Client::new(\\n\\n config.network_protocol,\\n\\n config.host,\\n\\n config.base_port,\\n\\n config.num_shards,\\n\\n buffer_size,\\n\\n send_timeout,\\n\\n recv_timeout,\\n\\n );\\n\\n authority_clients.insert(config.address, client);\\n\\n }\\n\\n authority_clients\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 60,\n \"score\": 88935.46046142447\n },\n {\n \"content\": \"/// Try to aggregate votes into certificates.\\n\\nfn make_benchmark_certificates_from_votes(\\n\\n committee_config: &CommitteeConfig,\\n\\n votes: Vec<SignedTransferOrder>,\\n\\n) -> Vec<(FastPayAddress, Bytes)> {\\n\\n let committee = Committee::new(committee_config.voting_rights());\\n\\n let mut aggregators = HashMap::new();\\n\\n let mut certificates = Vec::new();\\n\\n let mut done_senders = HashSet::new();\\n\\n for vote in votes {\\n\\n // We aggregate votes indexed by sender.\\n\\n let address = vote.value.transfer.sender;\\n\\n if done_senders.contains(&address) {\\n\\n continue;\\n\\n }\\n\\n debug!(\\n\\n \\\"Processing vote on {}'s transfer by {}\\\",\\n\\n encode_address(&address),\\n\\n encode_address(&vote.authority)\\n\\n );\\n\\n let value = vote.value;\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 61,\n \"score\": 87458.74961394479\n },\n {\n \"content\": \"fn make_authority_mass_clients(\\n\\n committee_config: &CommitteeConfig,\\n\\n buffer_size: usize,\\n\\n send_timeout: std::time::Duration,\\n\\n recv_timeout: std::time::Duration,\\n\\n max_in_flight: u64,\\n\\n) -> Vec<(u32, network::MassClient)> {\\n\\n let mut authority_clients = Vec::new();\\n\\n for config in &committee_config.authorities {\\n\\n let client = network::MassClient::new(\\n\\n config.network_protocol,\\n\\n config.host.clone(),\\n\\n config.base_port,\\n\\n buffer_size,\\n\\n send_timeout,\\n\\n recv_timeout,\\n\\n max_in_flight / config.num_shards as u64, // Distribute window to diff shards\\n\\n );\\n\\n authority_clients.push((config.num_shards, client));\\n\\n }\\n\\n authority_clients\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 62,\n \"score\": 86704.40581068787\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_state() -> AuthorityState {\\n\\n let (authority_address, authority_key) = get_key_pair();\\n\\n let mut authorities = BTreeMap::new();\\n\\n authorities.insert(\\n\\n /* address */ authority_address,\\n\\n /* voting right */ 1,\\n\\n );\\n\\n let committee = Committee::new(authorities);\\n\\n AuthorityState::new(committee, authority_address, authority_key)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 63,\n \"score\": 85937.62448489615\n },\n {\n \"content\": \"pub fn encode_address(key: &EdPublicKeyBytes) -> String {\\n\\n base64::encode(&key.0[..])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/base_types.rs\",\n \"rank\": 64,\n \"score\": 83803.83663299639\n },\n {\n \"content\": \"#[test]\\n\\nfn test_order() {\\n\\n let (sender_name, sender_key) = get_key_pair();\\n\\n\\n\\n let transfer = Transfer {\\n\\n sender: sender_name,\\n\\n recipient: Address::Primary(dbg_addr(0x20)),\\n\\n amount: Amount::from(5),\\n\\n sequence_number: SequenceNumber::new(),\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n let transfer_order = TransferOrder::new(transfer, &sender_key);\\n\\n\\n\\n let buf = serialize_transfer_order(&transfer_order);\\n\\n let result = deserialize_message(buf.as_slice());\\n\\n assert!(result.is_ok());\\n\\n if let SerializedMessage::Order(o) = result.unwrap() {\\n\\n assert!(*o == transfer_order);\\n\\n } else {\\n\\n panic!()\\n\\n }\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/serialize_tests.rs\",\n \"rank\": 65,\n \"score\": 83084.76378433095\n },\n {\n \"content\": \"#[test]\\n\\nfn test_info_response() {\\n\\n let (sender_name, sender_key) = get_key_pair();\\n\\n let transfer = Transfer {\\n\\n sender: sender_name,\\n\\n recipient: Address::Primary(dbg_addr(0x20)),\\n\\n amount: Amount::from(5),\\n\\n sequence_number: SequenceNumber::new(),\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n let order = TransferOrder::new(transfer, &sender_key);\\n\\n\\n\\n let (auth_name, auth_key) = get_key_pair();\\n\\n let vote = SignedTransferOrder::new(order.clone(), auth_name, &auth_key);\\n\\n\\n\\n let mut cert = CertifiedTransferOrder {\\n\\n value: order,\\n\\n signatures: Vec::new(),\\n\\n };\\n\\n\\n\\n for _ in 0..3 {\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/serialize_tests.rs\",\n \"rank\": 66,\n \"score\": 81508.67898769425\n },\n {\n \"content\": \"#[test]\\n\\nfn test_bidirectional_transfer() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n let (mut authority_clients, committee) = init_local_authorities(4);\\n\\n let mut client1 = make_client(authority_clients.clone(), committee.clone());\\n\\n let mut client2 = make_client(authority_clients.clone(), committee);\\n\\n fund_account(&mut authority_clients, client1.address, vec![2, 3, 4, 4]);\\n\\n // Update client1's local balance accordingly.\\n\\n client1.balance = rt.block_on(client1.get_strong_majority_balance());\\n\\n assert_eq!(client1.balance, Balance::from(3));\\n\\n\\n\\n let certificate = rt\\n\\n .block_on(client1.transfer_to_fastpay(\\n\\n Amount::from(3),\\n\\n client2.address,\\n\\n UserData::default(),\\n\\n ))\\n\\n .unwrap();\\n\\n\\n\\n assert_eq!(client1.next_sequence_number, SequenceNumber::from(1));\\n\\n assert_eq!(client1.pending_transfer, None);\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 67,\n \"score\": 81291.29615312966\n },\n {\n \"content\": \"#[test]\\n\\nfn test_signed_values() {\\n\\n let mut authorities = BTreeMap::new();\\n\\n let (a1, sec1) = get_key_pair();\\n\\n let (a2, sec2) = get_key_pair();\\n\\n let (a3, sec3) = get_key_pair();\\n\\n\\n\\n authorities.insert(/* address */ a1, /* voting right */ 1);\\n\\n authorities.insert(/* address */ a2, /* voting right */ 0);\\n\\n let committee = Committee::new(authorities);\\n\\n\\n\\n let transfer = Transfer {\\n\\n sender: a1,\\n\\n recipient: Address::FastPay(a2),\\n\\n amount: Amount::from(1),\\n\\n sequence_number: SequenceNumber::new(),\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n let order = TransferOrder::new(transfer.clone(), &sec1);\\n\\n let bad_order = TransferOrder::new(transfer, &sec2);\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/messages_tests.rs\",\n \"rank\": 68,\n \"score\": 81278.94549656911\n },\n {\n \"content\": \"#[test]\\n\\nfn test_time_order() {\\n\\n let (sender_name, sender_key) = get_key_pair();\\n\\n let transfer = Transfer {\\n\\n sender: sender_name,\\n\\n recipient: Address::Primary(dbg_addr(0x20)),\\n\\n amount: Amount::from(5),\\n\\n sequence_number: SequenceNumber::new(),\\n\\n user_data: UserData::default(),\\n\\n };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n let now = Instant::now();\\n\\n for _ in 0..100 {\\n\\n let transfer_order = TransferOrder::new(transfer.clone(), &sender_key);\\n\\n serialize_transfer_order_into(&mut buf, &transfer_order).unwrap();\\n\\n }\\n\\n println!(\\\"Write Order: {} microsec\\\", now.elapsed().as_micros() / 100);\\n\\n\\n\\n let mut buf2 = buf.as_slice();\\n\\n let now = Instant::now();\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/serialize_tests.rs\",\n \"rank\": 69,\n \"score\": 81254.14926763935\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_local_authorities(\\n\\n count: usize,\\n\\n) -> (HashMap<AuthorityName, LocalAuthorityClient>, Committee) {\\n\\n let mut key_pairs = Vec::new();\\n\\n let mut voting_rights = BTreeMap::new();\\n\\n for _ in 0..count {\\n\\n let key_pair = get_key_pair();\\n\\n voting_rights.insert(key_pair.0, 1);\\n\\n key_pairs.push(key_pair);\\n\\n }\\n\\n let committee = Committee::new(voting_rights);\\n\\n\\n\\n let mut clients = HashMap::new();\\n\\n for (address, secret) in key_pairs {\\n\\n let state = AuthorityState::new(committee.clone(), address, secret);\\n\\n clients.insert(address, LocalAuthorityClient::new(state));\\n\\n }\\n\\n (clients, committee)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 70,\n \"score\": 80865.91062415196\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get_shards() {\\n\\n let num_shards = 16u32;\\n\\n let mut found = vec![false; num_shards as usize];\\n\\n let mut left = num_shards;\\n\\n loop {\\n\\n let (address, _) = get_key_pair();\\n\\n let shard = AuthorityState::get_shard(num_shards, &address) as usize;\\n\\n println!(\\\"found {}\\\", shard);\\n\\n if !found[shard] {\\n\\n found[shard] = true;\\n\\n left -= 1;\\n\\n if left == 0 {\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// helpers\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/authority_tests.rs\",\n \"rank\": 71,\n \"score\": 80865.91062415196\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct LocalAuthorityClient(Arc<Mutex<AuthorityState>>);\\n\\n\\n\\nimpl AuthorityClient for LocalAuthorityClient {\\n\\n fn handle_transfer_order(\\n\\n &mut self,\\n\\n order: TransferOrder,\\n\\n ) -> AsyncResult<AccountInfoResponse, FastPayError> {\\n\\n let state = self.0.clone();\\n\\n Box::pin(async move { state.lock().await.handle_transfer_order(order) })\\n\\n }\\n\\n\\n\\n fn handle_confirmation_order(\\n\\n &mut self,\\n\\n order: ConfirmationOrder,\\n\\n ) -> AsyncResult<AccountInfoResponse, FastPayError> {\\n\\n let state = self.0.clone();\\n\\n Box::pin(async move {\\n\\n state\\n\\n .lock()\\n\\n .await\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 72,\n \"score\": 80198.26041965821\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_local_client_state(balances: Vec<i128>) -> ClientState<LocalAuthorityClient> {\\n\\n let (mut authority_clients, committee) = init_local_authorities(balances.len());\\n\\n let client = make_client(authority_clients.clone(), committee);\\n\\n fund_account(&mut authority_clients, client.address, balances);\\n\\n client\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 73,\n \"score\": 79964.83733227543\n },\n {\n \"content\": \"#[test]\\n\\nfn test_receiving_unconfirmed_transfer() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n let (mut authority_clients, committee) = init_local_authorities(4);\\n\\n let mut client1 = make_client(authority_clients.clone(), committee.clone());\\n\\n let mut client2 = make_client(authority_clients.clone(), committee);\\n\\n fund_account(&mut authority_clients, client1.address, vec![2, 3, 4, 4]);\\n\\n // not updating client1.balance\\n\\n\\n\\n let certificate = rt\\n\\n .block_on(client1.transfer_to_fastpay_unsafe_unconfirmed(\\n\\n Amount::from(2),\\n\\n client2.address,\\n\\n UserData::default(),\\n\\n ))\\n\\n .unwrap();\\n\\n // Transfer was executed locally, creating negative balance.\\n\\n assert_eq!(client1.balance, Balance::from(-2));\\n\\n assert_eq!(client1.next_sequence_number, SequenceNumber::from(1));\\n\\n assert_eq!(client1.pending_transfer, None);\\n\\n // ..but not confirmed remotely, hence an unchanged balance and sequence number.\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 74,\n \"score\": 79572.79491066001\n },\n {\n \"content\": \"#[test]\\n\\nfn test_initiating_valid_transfer() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n let (recipient, _) = get_key_pair();\\n\\n\\n\\n let mut sender = init_local_client_state(vec![2, 4, 4, 4]);\\n\\n sender.balance = Balance::from(4);\\n\\n let certificate = rt\\n\\n .block_on(sender.transfer_to_fastpay(\\n\\n Amount::from(3),\\n\\n recipient,\\n\\n UserData(Some(*b\\\"hello...........hello...........\\\")),\\n\\n ))\\n\\n .unwrap();\\n\\n assert_eq!(sender.next_sequence_number, SequenceNumber::from(1));\\n\\n assert_eq!(sender.pending_transfer, None);\\n\\n assert_eq!(\\n\\n rt.block_on(sender.get_strong_majority_balance()),\\n\\n Balance::from(1)\\n\\n );\\n\\n assert_eq!(\\n\\n rt.block_on(sender.request_certificate(sender.address, SequenceNumber::from(0)))\\n\\n .unwrap(),\\n\\n certificate\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 75,\n \"score\": 79572.79491066001\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_local_authorities_bad_1(\\n\\n count: usize,\\n\\n) -> (HashMap<AuthorityName, LocalAuthorityClient>, Committee) {\\n\\n let mut key_pairs = Vec::new();\\n\\n let mut voting_rights = BTreeMap::new();\\n\\n for i in 0..count {\\n\\n let key_pair = get_key_pair();\\n\\n voting_rights.insert(key_pair.0, 1);\\n\\n if i + 1 < (count + 2) / 3 {\\n\\n // init 1 authority with a bad keypair\\n\\n key_pairs.push(get_key_pair());\\n\\n } else {\\n\\n key_pairs.push(key_pair);\\n\\n }\\n\\n }\\n\\n let committee = Committee::new(voting_rights);\\n\\n\\n\\n let mut clients = HashMap::new();\\n\\n for (address, secret) in key_pairs {\\n\\n let state = AuthorityState::new(committee.clone(), address, secret);\\n\\n clients.insert(address, LocalAuthorityClient::new(state));\\n\\n }\\n\\n (clients, committee)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 76,\n \"score\": 79160.56895216502\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get_strong_majority_balance() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n rt.block_on(async {\\n\\n let mut client = init_local_client_state(vec![3, 4, 4, 4]);\\n\\n assert_eq!(client.get_strong_majority_balance().await, Balance::from(4));\\n\\n\\n\\n let mut client = init_local_client_state(vec![0, 3, 4, 4]);\\n\\n assert_eq!(client.get_strong_majority_balance().await, Balance::from(3));\\n\\n\\n\\n let mut client = init_local_client_state(vec![0, 3, 4]);\\n\\n assert_eq!(client.get_strong_majority_balance().await, Balance::from(0));\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 77,\n \"score\": 78128.22800331571\n },\n {\n \"content\": \"#[test]\\n\\nfn test_initiating_transfer_low_funds() {\\n\\n let mut rt = Runtime::new().unwrap();\\n\\n let (recipient, _) = get_key_pair();\\n\\n\\n\\n let mut sender = init_local_client_state(vec![2, 2, 4, 4]);\\n\\n sender.balance = Balance::from(2);\\n\\n assert!(rt\\n\\n .block_on(sender.transfer_to_fastpay(Amount::from(3), recipient, UserData::default()))\\n\\n .is_err());\\n\\n // Trying to overspend does not block an account.\\n\\n assert_eq!(sender.next_sequence_number, SequenceNumber::from(0));\\n\\n assert_eq!(sender.pending_transfer, None);\\n\\n assert_eq!(\\n\\n rt.block_on(sender.get_strong_majority_balance()),\\n\\n Balance::from(2)\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 78,\n \"score\": 77957.42895919111\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn init_local_client_state_with_bad_authority(\\n\\n balances: Vec<i128>,\\n\\n) -> ClientState<LocalAuthorityClient> {\\n\\n let (mut authority_clients, committee) = init_local_authorities_bad_1(balances.len());\\n\\n let client = make_client(authority_clients.clone(), committee);\\n\\n fund_account(&mut authority_clients, client.address, balances);\\n\\n client\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 79,\n \"score\": 76047.97724314062\n },\n {\n \"content\": \"#[test]\\n\\nfn test_handle_redeem_transaction_negative_balance() {\\n\\n let (mut contract_state, name, secret) = init_contract();\\n\\n let mut redeem_transaction =\\n\\n init_redeem_transaction(contract_state.committee.clone(), name, secret);\\n\\n let funding_transaction = init_funding_transaction();\\n\\n let too_much_money = Amount::from(1000);\\n\\n assert!(contract_state\\n\\n .handle_funding_transaction(funding_transaction)\\n\\n .is_ok());\\n\\n let old_balance = contract_state.total_balance;\\n\\n\\n\\n redeem_transaction\\n\\n .transfer_certificate\\n\\n .value\\n\\n .transfer\\n\\n .amount = redeem_transaction\\n\\n .transfer_certificate\\n\\n .value\\n\\n .transfer\\n\\n .amount\\n\\n .try_add(too_much_money)\\n\\n .unwrap();\\n\\n assert!(contract_state\\n\\n .handle_redeem_transaction(redeem_transaction)\\n\\n .is_err());\\n\\n assert_eq!(old_balance, contract_state.total_balance);\\n\\n assert!(contract_state.accounts.is_empty());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/fastpay_smart_contract_tests.rs\",\n \"rank\": 80,\n \"score\": 73801.65937167729\n },\n {\n \"content\": \"fn serialize_into<T, W>(writer: W, msg: &T) -> Result<(), failure::Error>\\n\\nwhere\\n\\n W: std::io::Write,\\n\\n T: Serialize,\\n\\n{\\n\\n bincode::serialize_into(writer, msg).map_err(|err| format_err!(\\\"{}\\\", err))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/serialize.rs\",\n \"rank\": 81,\n \"score\": 73532.4071043628\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nfn fund_account<I: IntoIterator<Item = i128>>(\\n\\n clients: &mut HashMap<AuthorityName, LocalAuthorityClient>,\\n\\n address: FastPayAddress,\\n\\n balances: I,\\n\\n) {\\n\\n let mut balances = balances.into_iter().map(Balance::from);\\n\\n for (_, client) in clients.iter_mut() {\\n\\n client.0.as_ref().try_lock().unwrap().accounts_mut().insert(\\n\\n address,\\n\\n AccountOffchainState::new_with_balance(\\n\\n balances.next().unwrap_or_else(Balance::zero),\\n\\n /* no receive log to justify the balances */ Vec::new(),\\n\\n ),\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay_core/src/unit_tests/client_tests.rs\",\n \"rank\": 82,\n \"score\": 68828.38865156738\n },\n {\n \"content\": \"def info():\\n\\n\\tset_hosts()\\n\\n\\n\\n\\tprint('\\\\nclients:')\\n\\n\\tfor client in env.roledefs['client']:\\n\\n\\t\\tprint('\\\\t ssh -i '+env.key_filename+' '+env.user+'@'+client)\\n\\n\\n\\n\\tprint('\\\\nservers:')\\n\\n\\tfor server in env.roledefs['authority']:\\n\\n\\t\\tprint('\\\\t ssh -i '+env.key_filename+' '+env.user+'@'+server)\\n\\n\\n\\n\\tprint('\\\\nthroughput:')\\n\\n\\tfor server in env.roledefs['throughput']:\\n\",\n \"file_path\": \"scripts/fabfile.py\",\n \"rank\": 83,\n \"score\": 65504.587213338425\n },\n {\n \"content\": \"def transfer(remote_client=remote_client):\\n\\n\\texecute(initialize_client, remote_client)\\n\\n\\n\\n\\tf = open(initial_accounts, 'r')\\n\\n\\taddresses = f.read().splitlines()\\n\\n\\tf.close()\\n\\n\\tassert len(addresses) > 0\\n\\n\\n\\n\\tfor i, sender in enumerate(addresses):\\n\\n\\t\\tcommand = './client --committee %s --accounts %s transfer --from %s --to %s 1' \\\\\\n\\n\\t\\t\\t% (committee_config, accounts, sender, sender)\\n\\n\\t\\tif remote_client:\\n\\n\\t\\t\\trun(command)\\n\\n\\t\\telse:\\n\",\n \"file_path\": \"scripts/fabfile.py\",\n \"rank\": 84,\n \"score\": 65300.420528393\n },\n {\n \"content\": \"def info():\\n\\n\\tset_hosts()\\n\\n\\n\\n\\tprint('\\\\ndev:')\\n\\n\\tfor dev in env.roledefs['dev']:\\n\",\n \"file_path\": \"scripts/aws_plot.py\",\n \"rank\": 85,\n \"score\": 64430.96114254334\n },\n {\n \"content\": \"struct ServerOpt {\\n\\n /// Path to the file containing the server configuration of this FastPay authority (including its secret key)\\n\\n #[structopt(long = \\\"server\\\")]\\n\\n server: String,\\n\\n\\n\\n /// Subcommands. Acceptable values are run and generate.\\n\\n #[structopt(subcommand)]\\n\\n cmd: ServerCommands,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/server.rs\",\n \"rank\": 86,\n \"score\": 62709.62578673629\n },\n {\n \"content\": \"struct ClientOpt {\\n\\n /// Sets the file storing the state of our user accounts (an empty one will be created if missing)\\n\\n #[structopt(long = \\\"accounts\\\")]\\n\\n accounts: String,\\n\\n\\n\\n /// Sets the file describing the public configurations of all authorities\\n\\n #[structopt(long = \\\"committee\\\")]\\n\\n committee: String,\\n\\n\\n\\n /// Timeout for sending queries (us)\\n\\n #[structopt(long = \\\"send_timeout\\\", default_value = \\\"4000000\\\")]\\n\\n send_timeout: u64,\\n\\n\\n\\n /// Timeout for receiving responses (us)\\n\\n #[structopt(long = \\\"recv_timeout\\\", default_value = \\\"4000000\\\")]\\n\\n recv_timeout: u64,\\n\\n\\n\\n /// Maximum size of datagrams received and sent (bytes)\\n\\n #[structopt(long = \\\"buffer_size\\\", default_value = transport::DEFAULT_MAX_DATAGRAM_SIZE)]\\n\\n buffer_size: String,\\n\\n\\n\\n /// Subcommands. Acceptable values are transfer, query_balance, benchmark, and create_accounts.\\n\\n #[structopt(subcommand)]\\n\\n cmd: ClientCommands,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 87,\n \"score\": 62709.62578673629\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nstruct ClientServerBenchmark {\\n\\n network_protocol: transport::NetworkProtocol,\\n\\n host: String,\\n\\n port: u32,\\n\\n committee_size: usize,\\n\\n num_shards: u32,\\n\\n max_in_flight: usize,\\n\\n num_accounts: usize,\\n\\n send_timeout: Duration,\\n\\n recv_timeout: Duration,\\n\\n buffer_size: usize,\\n\\n cross_shard_queue_size: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/bench.rs\",\n \"rank\": 88,\n \"score\": 61476.65692083484\n },\n {\n \"content\": \"/// An implementation of DataStream based on UDP.\\n\\nstruct UdpDataStream {\\n\\n socket: UdpSocket,\\n\\n address: String,\\n\\n buffer: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl UdpDataStream {\\n\\n async fn connect(address: String, max_data_size: usize) -> Result<Self, std::io::Error> {\\n\\n let socket = UdpSocket::bind(&\\\"0.0.0.0:0\\\").await?;\\n\\n let buffer = vec![0u8; max_data_size];\\n\\n Ok(Self {\\n\\n socket,\\n\\n address,\\n\\n buffer,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DataStream for UdpDataStream {\\n\\n fn write_data<'a>(\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 89,\n \"score\": 61472.475167669756\n },\n {\n \"content\": \"/// An implementation of DataStream based on TCP.\\n\\nstruct TcpDataStream {\\n\\n stream: TcpStream,\\n\\n max_data_size: usize,\\n\\n}\\n\\n\\n\\nimpl TcpDataStream {\\n\\n async fn connect(address: String, max_data_size: usize) -> Result<Self, std::io::Error> {\\n\\n let stream = TcpStream::connect(address).await?;\\n\\n stream.set_send_buffer_size(max_data_size)?;\\n\\n stream.set_recv_buffer_size(max_data_size)?;\\n\\n Ok(Self {\\n\\n stream,\\n\\n max_data_size,\\n\\n })\\n\\n }\\n\\n\\n\\n async fn tcp_write_data<S>(stream: &mut S, buffer: &[u8]) -> Result<(), std::io::Error>\\n\\n where\\n\\n S: AsyncWrite + Unpin,\\n\\n {\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 90,\n \"score\": 61472.475167669756\n },\n {\n \"content\": \"struct RunningServerState {\\n\\n server: Server,\\n\\n cross_shard_sender: mpsc::Sender<(Vec<u8>, ShardId)>,\\n\\n}\\n\\n\\n\\nimpl MessageHandler for RunningServerState {\\n\\n fn handle_message<'a>(\\n\\n &'a mut self,\\n\\n buffer: &'a [u8],\\n\\n ) -> futures::future::BoxFuture<'a, Option<Vec<u8>>> {\\n\\n Box::pin(async move {\\n\\n let result = deserialize_message(buffer);\\n\\n let reply = match result {\\n\\n Err(_) => Err(FastPayError::InvalidDecoding),\\n\\n Ok(result) => {\\n\\n match result {\\n\\n SerializedMessage::Order(message) => self\\n\\n .server\\n\\n .state\\n\\n .handle_transfer_order(*message)\\n\",\n \"file_path\": \"fastpay/src/network.rs\",\n \"rank\": 91,\n \"score\": 61472.475167669756\n },\n {\n \"content\": \"/// An implementation of DataStreamPool based on UDP.\\n\\nstruct UdpDataStreamPool {\\n\\n socket: UdpSocket,\\n\\n}\\n\\n\\n\\nimpl UdpDataStreamPool {\\n\\n async fn new() -> Result<Self, std::io::Error> {\\n\\n let socket = UdpSocket::bind(&\\\"0.0.0.0:0\\\").await?;\\n\\n Ok(Self { socket })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DataStreamPool for UdpDataStreamPool {\\n\\n fn send_data_to<'a>(\\n\\n &'a mut self,\\n\\n buffer: &'a [u8],\\n\\n address: &'a str,\\n\\n ) -> future::BoxFuture<'a, Result<(), std::io::Error>> {\\n\\n Box::pin(async move {\\n\\n self.socket.send_to(buffer, address).await?;\\n\\n Ok(())\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 92,\n \"score\": 60322.67795442079\n },\n {\n \"content\": \"/// An implementation of DataStreamPool based on TCP.\\n\\nstruct TcpDataStreamPool {\\n\\n streams: HashMap<String, TcpStream>,\\n\\n}\\n\\n\\n\\nimpl TcpDataStreamPool {\\n\\n async fn new() -> Result<Self, std::io::Error> {\\n\\n let streams = HashMap::new();\\n\\n Ok(Self { streams })\\n\\n }\\n\\n\\n\\n async fn get_stream(&mut self, address: &str) -> Result<&mut TcpStream, io::Error> {\\n\\n if !self.streams.contains_key(address) {\\n\\n match TcpStream::connect(address).await {\\n\\n Ok(s) => {\\n\\n self.streams.insert(address.to_string(), s);\\n\\n }\\n\\n Err(error) => {\\n\\n error!(\\\"Failed to open connection to {}: {}\\\", address, error);\\n\\n return Err(error);\\n\\n }\\n\",\n \"file_path\": \"fastpay/src/transport.rs\",\n \"rank\": 93,\n \"score\": 60322.67795442079\n },\n {\n \"content\": \"fn main() {\\n\\n env_logger::from_env(env_logger::Env::default().default_filter_or(\\\"info\\\")).init();\\n\\n let benchmark = ClientServerBenchmark::from_command_line();\\n\\n\\n\\n let (states, orders) = benchmark.make_structures();\\n\\n\\n\\n // Start the servers on the thread pool\\n\\n for state in states {\\n\\n // Make special single-core runtime for each server\\n\\n let b = benchmark.clone();\\n\\n thread::spawn(move || {\\n\\n let mut runtime = Builder::new()\\n\\n .enable_all()\\n\\n .basic_scheduler()\\n\\n .thread_stack_size(15 * 1024 * 1024)\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n runtime.block_on(async move {\\n\\n let server = b.spawn_server(state).await;\\n\",\n \"file_path\": \"fastpay/src/bench.rs\",\n \"rank\": 94,\n \"score\": 59507.31646621789\n },\n {\n \"content\": \"fn main() {\\n\\n env_logger::from_env(env_logger::Env::default().default_filter_or(\\\"info\\\")).init();\\n\\n let matches = ClientOpt::from_args();\\n\\n\\n\\n let send_timeout = Duration::from_micros(matches.send_timeout);\\n\\n let recv_timeout = Duration::from_micros(matches.recv_timeout);\\n\\n let accounts_config_path = &matches.accounts;\\n\\n let committee_config_path = &matches.committee;\\n\\n let buffer_size = matches.buffer_size.parse::<usize>().unwrap();\\n\\n\\n\\n let mut accounts_config =\\n\\n AccountsConfig::read_or_create(accounts_config_path).expect(\\\"Unable to read user accounts\\\");\\n\\n let committee_config =\\n\\n CommitteeConfig::read(committee_config_path).expect(\\\"Unable to read committee config file\\\");\\n\\n\\n\\n match matches.cmd {\\n\\n ClientCommands::Transfer { from, to, amount } => {\\n\\n let sender = decode_address(&from).expect(\\\"Failed to decode sender's address\\\");\\n\\n let recipient = decode_address(&to).expect(\\\"Failed to decode recipient's address\\\");\\n\\n let amount = Amount::from(amount);\\n\",\n \"file_path\": \"fastpay/src/client.rs\",\n \"rank\": 95,\n \"score\": 59507.31646621789\n },\n {\n \"content\": \"fn main() {\\n\\n env_logger::from_env(env_logger::Env::default().default_filter_or(\\\"info\\\")).init();\\n\\n let matches = ServerOpt::from_args();\\n\\n\\n\\n let server_config_path = &matches.server;\\n\\n\\n\\n match matches.cmd {\\n\\n ServerCommands::Run {\\n\\n buffer_size,\\n\\n cross_shard_queue_size,\\n\\n committee,\\n\\n initial_accounts,\\n\\n initial_balance,\\n\\n shard,\\n\\n } => {\\n\\n let committee_config_path = &committee;\\n\\n let initial_accounts_config_path = &initial_accounts;\\n\\n let initial_balance = Balance::from(initial_balance.parse::<i128>().unwrap());\\n\\n let buffer_size = buffer_size.parse::<usize>().unwrap();\\n\\n // let parsed_cross_shard_queue_size = cross_shard_queue_size.parse::<usize>().unwrap();\\n\",\n \"file_path\": \"fastpay/src/server.rs\",\n \"rank\": 96,\n \"score\": 59507.31646621789\n },\n {\n \"content\": \"struct TestService {\\n\\n counter: Arc<AtomicUsize>,\\n\\n}\\n\\n\\n\\nimpl TestService {\\n\\n fn new(counter: Arc<AtomicUsize>) -> Self {\\n\\n TestService { counter }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl MessageHandler for TestService {\\n\\n fn handle_message<'a>(\\n\\n &'a mut self,\\n\\n buffer: &'a [u8],\\n\\n ) -> future::BoxFuture<'a, Option<Vec<u8>>> {\\n\\n self.counter.fetch_add(buffer.len(), Ordering::Relaxed);\\n\\n Box::pin(async move { Some(Vec::from(buffer)) })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fastpay/src/unit_tests/transport_tests.rs\",\n \"rank\": 97,\n \"score\": 59251.297793067555\n },\n {\n \"content\": \"fn make_servers(\\n\\n local_ip_addr: &str,\\n\\n server_config_path: &str,\\n\\n committee_config_path: &str,\\n\\n initial_accounts_config_path: &str,\\n\\n initial_balance: Balance,\\n\\n buffer_size: usize,\\n\\n cross_shard_queue_size: usize,\\n\\n) -> Vec<network::Server> {\\n\\n let server_config =\\n\\n AuthorityServerConfig::read(server_config_path).expect(\\\"Fail to read server config\\\");\\n\\n let num_shards = server_config.authority.num_shards;\\n\\n\\n\\n let mut servers = Vec::new();\\n\\n for shard in 0..num_shards {\\n\\n servers.push(make_shard_server(\\n\\n local_ip_addr,\\n\\n server_config_path,\\n\\n committee_config_path,\\n\\n initial_accounts_config_path,\\n\",\n \"file_path\": \"fastpay/src/server.rs\",\n \"rank\": 98,\n \"score\": 58224.63259561843\n },\n {\n \"content\": \"#[allow(clippy::too_many_arguments)]\\n\\nfn make_shard_server(\\n\\n local_ip_addr: &str,\\n\\n server_config_path: &str,\\n\\n committee_config_path: &str,\\n\\n initial_accounts_config_path: &str,\\n\\n initial_balance: Balance,\\n\\n buffer_size: usize,\\n\\n cross_shard_queue_size: usize,\\n\\n shard: u32,\\n\\n) -> network::Server {\\n\\n let server_config =\\n\\n AuthorityServerConfig::read(server_config_path).expect(\\\"Fail to read server config\\\");\\n\\n let committee_config =\\n\\n CommitteeConfig::read(committee_config_path).expect(\\\"Fail to read committee config\\\");\\n\\n let initial_accounts_config = InitialStateConfig::read(initial_accounts_config_path)\\n\\n .expect(\\\"Fail to read initial account config\\\");\\n\\n\\n\\n let committee = Committee::new(committee_config.voting_rights());\\n\\n let num_shards = server_config.authority.num_shards;\\n\\n\\n\",\n \"file_path\": \"fastpay/src/server.rs\",\n \"rank\": 99,\n \"score\": 57035.83163537602\n }\n]","isConversational":false}}},{"rowIdx":1189,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"crypto/bls/src/macros.rs"},"repo_name":{"kind":"string","value":"sean-sn/lighthouse"},"commit":{"kind":"string","value":"c6baa0eed131c5e8ecc5860778ffc7d4a4c18d2d"},"file_code":{"kind":"string","value":"\n\nmacro_rules! impl_tree_hash {\n ($byte_size: expr) => {\n fn tree_hash_type() -> tree_hash::TreeHashType {\n tree_hash::TreeHashType::Vector\n }\n\n fn tree_hash_packed_encoding(&self) -> Vec<u8> {\n unreachable!(\"Vector should never be packed.\")\n }\n\n fn tree_hash_packing_factor() -> usize {\n unreachable!(\"Vector should never be packed.\")\n }\n\n fn tree_hash_root(&self) -> tree_hash::Hash256 {\n \n \n \n let values_per_chunk = tree_hash::BYTES_PER_CHUNK;\n let minimum_chunk_count = ($byte_size + values_per_chunk - 1) / values_per_chunk;\n tree_hash::merkle_root(&self.serialize(), minimum_chunk_count)\n }\n };\n}\n\nmacro_rules! impl_ssz_encode {\n ($byte_size: expr) => {\n fn is_ssz_fixed_len() -> bool {\n true\n }\n\n fn ssz_fixed_len() -> usize {\n $byte_size\n }\n\n fn ssz_bytes_len(&self) -> usize {\n $byte_size\n }\n\n fn ssz_append(&self, buf: &mut Vec<u8>) {\n buf.extend_from_slice(&self.serialize())\n }\n };\n}\n\nmacro_rules! impl_ssz_decode {\n ($byte_size: expr) => {\n fn is_ssz_fixed_len() -> bool {\n true\n }\n\n fn ssz_fixed_len() -> usize {\n $byte_size\n }\n\n fn from_ssz_bytes(bytes: &[u8]) -> Result<Self, ssz::DecodeError> {\n let len = bytes.len();\n let expected = <Self as ssz::Decode>::ssz_fixed_len();\n\n if len != expected {\n Err(ssz::DecodeError::InvalidByteLength { len, expected })\n } else {\n Self::deserialize(bytes)\n .map_err(|e| ssz::DecodeError::BytesInvalid(format!(\"{:?}\", e)))\n }\n }\n };\n}\n\nmacro_rules! impl_display {\n () => {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"{}\", hex_encode(self.serialize().to_vec()))\n }\n };\n}\n\nmacro_rules! impl_from_str {\n () => {\n type Err = String;\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n if s.starts_with(\"0x\") {\n let bytes = hex::decode(&s[2..]).map_err(|e| e.to_string())?;\n Self::deserialize(&bytes[..]).map_err(|e| format!(\"{:?}\", e))\n } else {\n Err(\"must start with 0x\".to_string())\n }\n }\n };\n}\n\nmacro_rules! impl_serde_serialize {\n () => {\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\n where\n S: Serializer,\n {\n serializer.serialize_str(&self.to_string())\n }\n };\n}\n\nmacro_rules! impl_serde_deserialize {\n () => {\n fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>\n where\n D: Deserializer<'de>,\n {\n pub struct StringVisitor;\n\n impl<'de> serde::de::Visitor<'de> for StringVisitor {\n type Value = String;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"a hex string with 0x prefix\")\n }\n\n fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>\n where\n E: serde::de::Error,\n {\n Ok(value.to_string())\n }\n }\n\n let string = deserializer.deserialize_str(StringVisitor)?;\n <Self as std::str::FromStr>::from_str(&string).map_err(serde::de::Error::custom)\n }\n };\n}\n\nmacro_rules! impl_debug {\n () => {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{}\", hex_encode(&self.serialize().to_vec()))\n }\n };\n}\n\n#[cfg(feature = \"arbitrary\")]\nmacro_rules! impl_arbitrary {\n ($byte_size: expr) => {\n fn arbitrary(u: &mut arbitrary::Unstructured<'_>) -> arbitrary::Result<Self> {\n let mut bytes = [0u8; $byte_size];\n u.fill_buffer(&mut bytes)?;\n Self::deserialize(&bytes).map_err(|_| arbitrary::Error::IncorrectFormat)\n }\n };\n}\n"},"prefix":{"kind":"string","value":"\n\nmacro_rules! impl_tree_hash {\n ($byte_size: expr) => {\n fn tree_hash_type() -> tree_hash::TreeHashType {\n tree_hash::TreeHashType::Vector\n }\n\n fn tree_hash_packed_encoding(&self) -> Vec<u8> {\n unreachable!(\"Vector should never be packed.\")\n }\n\n fn tree_hash_packing_factor() -> usize {\n unreachable!(\"Vector should never be packed.\")\n }\n\n fn tree_hash_root(&self) -> tree_hash::Hash256 {\n \n \n \n let values_per_chunk = tree_hash::BYTES_PER_CHUNK;\n let minimum_chunk_count = ($byte_size + values_per_chunk - 1) / values_per_chunk;\n tree_hash::merkle_root(&self.serialize(), minimum_chunk_count)\n }\n };\n}\n\nmacro_rules! impl_ssz_encode {\n ($byte_size: expr) => {\n fn is_ssz_fixed_len() -> bool {\n true\n }\n\n fn ssz_fixed_len() -> usize {\n $byte_size\n }\n\n fn ssz_bytes_len(&self) -> usize {\n $byte_size\n }\n\n fn ssz_append(&self, buf: &mut Vec<u8>) {\n buf.extend_from_slice(&self.serialize())\n }\n };\n}\n\nmacro_rules! impl_ssz_decode {\n ($byte_size: expr) => {\n fn is_ssz_fixed_len() -> bool {\n true\n }\n\n fn ssz_fixed_len() -> usize {\n $byte_size\n }\n\n fn from_ssz_bytes(bytes: &[u8]) -> Result<Self, ssz::DecodeError> {\n let len = bytes.len();\n let expected = <Self as ssz::Decode>::ssz_fixed_len();\n\n if len != expected {\n Err(ssz::DecodeError::InvalidByteLength { len, expected })\n } else {\n Self::deserialize(bytes)\n .map_err(|e| ssz::DecodeError::BytesInvalid(format!(\"{:?}\", e)))\n }\n }\n };\n}\n\nmacro_rules! impl_display {\n () => {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"{}\", hex_encode(self.serialize().to_vec()))\n }\n };\n}\n\nmacro_rules! impl_from_str {\n () => {\n type Err = String;\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n if s.starts_with(\"0x\") {\n let bytes = hex::decode(&s[2..]).map_err(|e| e.to_string())?;\n Self::deserialize(&bytes[..]).map_err(|e| format!(\"{:?}\", e))\n } else {\n Err(\"must start with 0x\".to_string())\n }\n }\n };\n}\n\nmacro_rules! impl_serde_serialize {\n () => {\n fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>\n where\n S: Serializer,\n {\n serializer.serialize_str(&self.to_string())\n }\n };\n}\n\nmacro_rules! impl_serde_deserialize {\n () => {\n fn deserialize<D>(deserializer: D) -> Result<Sel"},"suffix":{"kind":"string","value":" Self::deserialize(&bytes).map_err(|_| arbitrary::Error::IncorrectFormat)\n }\n };\n}\n"},"middle":{"kind":"string","value":"f, D::Error>\n where\n D: Deserializer<'de>,\n {\n pub struct StringVisitor;\n\n impl<'de> serde::de::Visitor<'de> for StringVisitor {\n type Value = String;\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n formatter.write_str(\"a hex string with 0x prefix\")\n }\n\n fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>\n where\n E: serde::de::Error,\n {\n Ok(value.to_string())\n }\n }\n\n let string = deserializer.deserialize_str(StringVisitor)?;\n <Self as std::str::FromStr>::from_str(&string).map_err(serde::de::Error::custom)\n }\n };\n}\n\nmacro_rules! impl_debug {\n () => {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{}\", hex_encode(&self.serialize().to_vec()))\n }\n };\n}\n\n#[cfg(feature = \"arbitrary\")]\nmacro_rules! impl_arbitrary {\n ($byte_size: expr) => {\n fn arbitrary(u: &mut arbitrary::Unstructured<'_>) -> arbitrary::Result<Self> {\n let mut bytes = [0u8; $byte_size];\n u.fill_buffer(&mut bytes)?;\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn string_to_bytes(string: &str) -> Result<Vec<u8>, String> {\n\n let string = if string.starts_with(\"0x\") {\n\n &string[2..]\n\n } else {\n\n string\n\n };\n\n\n\n hex::decode(string).map_err(|e| format!(\"Unable to decode public or private key: {}\", e))\n\n}\n\n\n","file_path":"common/eth2_interop_keypairs/src/lib.rs","rank":0,"score":384622.70823354705},{"content":"// An alternative to `hex::decode`, to allow for more control of\n\n// the objects created while decoding the secret key.\n\nfn hex_string_to_bytes(data: &str) -> Result<Vec<u8>, String> {\n\n if data.len() % 2 != 0 {\n\n return Err(\"Odd length\".to_string());\n\n }\n\n\n\n let mut vec: Vec<u8> = Vec::new();\n\n for i in 0..data.len() / 2 {\n\n vec.push(\n\n val(&data.as_bytes()[2 * i], 2 * i)? << 4\n\n | val(&data.as_bytes()[2 * i + 1], 2 * i + 1)?,\n\n );\n\n }\n\n\n\n Ok(vec)\n\n}\n\n\n","file_path":"remote_signer/backend/src/zeroize_string.rs","rank":1,"score":368367.77421637444},{"content":"/// Parses a `0x`-prefixed, big-endian hex string as bytes.\n\n///\n\n/// E.g., `0x0102 == vec![1, 2]`\n\nfn hex_to_bytes(hex: &str) -> Result<Vec<u8>, String> {\n\n hex::decode(strip_prefix(hex)?).map_err(|e| format!(\"Failed to parse hex as bytes: {:?}\", e))\n\n}\n\n\n","file_path":"beacon_node/eth1/src/http.rs","rank":2,"score":355737.6334991586},{"content":"fn process_slice_field(new_tree_hash: &[u8], leaf: &mut Hash256, force_update: bool) -> bool {\n\n if force_update || leaf.as_bytes() != new_tree_hash {\n\n leaf.assign_from_slice(&new_tree_hash);\n\n true\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"consensus/types/src/tree_hash_impls.rs","rank":3,"score":341906.70715965296},{"content":"fn verify_checksum(bytes: &[u8], expected_checksum: &str) {\n\n let mut hasher = Sha256::new();\n\n hasher.update(bytes);\n\n let result = hasher.finalize();\n\n\n\n let checksum = hex::encode(&result[..]);\n\n\n\n assert_eq!(\n\n &checksum, expected_checksum,\n\n \"Checksum {} did not match {}\",\n\n checksum, expected_checksum\n\n );\n\n}\n\n\n","file_path":"common/deposit_contract/build.rs","rank":4,"score":341368.01582740387},{"content":"/// Encode `len` as a little-endian byte array of `BYTES_PER_LENGTH_OFFSET` length.\n\n///\n\n/// If `len` is larger than `2 ^ BYTES_PER_LENGTH_OFFSET`, a `debug_assert` is raised.\n\npub fn encode_length(len: usize) -> [u8; BYTES_PER_LENGTH_OFFSET] {\n\n // Note: it is possible for `len` to be larger than what can be encoded in\n\n // `BYTES_PER_LENGTH_OFFSET` bytes, triggering this debug assertion.\n\n //\n\n // These are the alternatives to using a `debug_assert` here:\n\n //\n\n // 1. Use `assert`.\n\n // 2. Push an error to the caller (e.g., `Option` or `Result`).\n\n // 3. Ignore it completely.\n\n //\n\n // I have avoided (1) because it's basically a choice between \"produce invalid SSZ\" or \"kill\n\n // the entire program\". I figure it may be possible for an attacker to trigger this assert and\n\n // take the program down -- I think producing invalid SSZ is a better option than this.\n\n //\n\n // I have avoided (2) because this error will need to be propagated upstream, making encoding a\n\n // function which may fail. I don't think this is ergonomic and the upsides don't outweigh the\n\n // downsides.\n\n //\n\n // I figure a `debug_assertion` is better than (3) as it will give us a change to detect the\n\n // error during testing.\n","file_path":"consensus/ssz/src/encode.rs","rank":5,"score":321329.87696129415},{"content":"pub fn parse_hex_bytes(matches: &ArgMatches, name: &'static str) -> Result<Vec<u8>, String> {\n\n matches\n\n .value_of(name)\n\n .ok_or_else(|| format!(\"{} not specified\", name))\n\n .and_then(|val| {\n\n if val.starts_with(\"0x\") {\n\n hex::decode(&val[2..]).map_err(|e| format!(\"Unable to parse {}: {:?}\", name, e))\n\n } else {\n\n Err(format!(\"Unable to parse {}, must have 0x prefix\", name))\n\n }\n\n })\n\n}\n","file_path":"lcli/src/helpers.rs","rank":6,"score":317464.31009794853},{"content":"fn decode_and_print<T: Decode + Serialize>(bytes: &[u8]) -> Result<(), String> {\n\n let item = T::from_ssz_bytes(&bytes).map_err(|e| format!(\"Ssz decode failed: {:?}\", e))?;\n\n\n\n println!(\n\n \"{}\",\n\n serde_yaml::to_string(&item)\n\n .map_err(|e| format!(\"Unable to write object to YAML: {:?}\", e))?\n\n );\n\n\n\n Ok(())\n\n}\n","file_path":"lcli/src/parse_hex.rs","rank":7,"score":317081.3847591422},{"content":"fn decode_and_print<T: Decode + Serialize>(bytes: &[u8]) -> Result<(), String> {\n\n let item = T::from_ssz_bytes(&bytes).map_err(|e| format!(\"Ssz decode failed: {:?}\", e))?;\n\n\n\n println!(\n\n \"{}\",\n\n serde_yaml::to_string(&item)\n\n .map_err(|e| format!(\"Unable to write object to YAML: {:?}\", e))?\n\n );\n\n\n\n Ok(())\n\n}\n","file_path":"lcli/src/parse_ssz.rs","rank":8,"score":317081.3847591422},{"content":"// Auxiliar function for `hex_string_to_bytes`.\n\nfn val(c: &u8, idx: usize) -> Result<u8, String> {\n\n match c {\n\n b'A'..=b'F' => Ok(c - b'A' + 10),\n\n b'a'..=b'f' => Ok(c - b'a' + 10),\n\n b'0'..=b'9' => Ok(c - b'0'),\n\n _ => Err(format!(\n\n \"Invalid hex character: {} at index {}\",\n\n *c as char, idx\n\n )),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod object {\n\n use super::*;\n\n use helpers::*;\n\n use zeroize::Zeroize;\n\n\n\n #[test]\n\n fn v_u8_zeroized() {\n","file_path":"remote_signer/backend/src/zeroize_string.rs","rank":9,"score":312626.2231844065},{"content":"/// Decode `data` from a 0x-prefixed hex string.\n\npub fn decode(s: &str) -> Result<Vec<u8>, String> {\n\n if s.starts_with(\"0x\") {\n\n hex::decode(&s[2..]).map_err(|e| format!(\"invalid hex: {:?}\", e))\n\n } else {\n\n Err(\"hex must have 0x prefix\".to_string())\n\n }\n\n}\n\n\n\npub struct PrefixedHexVisitor;\n\n\n\nimpl<'de> Visitor<'de> for PrefixedHexVisitor {\n\n type Value = Vec<u8>;\n\n\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n\n formatter.write_str(\"a hex string with 0x prefix\")\n\n }\n\n\n\n fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>\n\n where\n\n E: de::Error,\n","file_path":"consensus/serde_utils/src/hex.rs","rank":10,"score":308677.18197656627},{"content":"fn process_bool_field(val: bool, leaf: &mut Hash256, force_update: bool) -> bool {\n\n process_u64_field(val as u64, leaf, force_update)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use crate::test_utils::TestRandom;\n\n use crate::Epoch;\n\n use rand::SeedableRng;\n\n use rand_xorshift::XorShiftRng;\n\n use tree_hash::TreeHash;\n\n\n\n fn test_validator_tree_hash(v: &Validator) {\n\n let arena = &mut CacheArena::default();\n\n\n\n let mut cache = v.new_tree_hash_cache(arena);\n\n // With a fresh cache\n\n assert_eq!(\n\n &v.tree_hash_root()[..],\n","file_path":"consensus/types/src/tree_hash_impls.rs","rank":11,"score":296001.19389578927},{"content":"/// Remove any number of newline or carriage returns from the end of a vector of bytes.\n\npub fn strip_off_newlines(mut bytes: Vec<u8>) -> Vec<u8> {\n\n let mut strip_off = 0;\n\n for (i, byte) in bytes.iter().rev().enumerate() {\n\n if *byte == b'\\n' || *byte == b'\\r' {\n\n strip_off = i + 1;\n\n } else {\n\n break;\n\n }\n\n }\n\n bytes.truncate(bytes.len() - strip_off);\n\n bytes\n\n}\n\n\n","file_path":"common/account_utils/src/lib.rs","rank":12,"score":294641.1506125736},{"content":"fn decompress_snappy(data: &[u8]) -> Result<Vec<u8>, String> {\n\n // Exit early if uncompressed data is > GOSSIP_MAX_SIZE\n\n match decompress_len(data) {\n\n Ok(n) if n > GOSSIP_MAX_SIZE => {\n\n return Err(\"ssz_snappy decoded data > GOSSIP_MAX_SIZE\".into());\n\n }\n\n Ok(_) => {}\n\n Err(e) => {\n\n return Err(format!(\"{}\", e));\n\n }\n\n };\n\n let mut decoder = Decoder::new();\n\n match decoder.decompress_vec(data) {\n\n Ok(decompressed_data) => Ok(decompressed_data),\n\n Err(e) => Err(format!(\"{}\", e)),\n\n }\n\n}\n\n\n\nimpl<T: EthSpec> PubsubMessage<T> {\n\n /// Returns the topics that each pubsub message will be sent across, given a supported\n","file_path":"beacon_node/eth2_libp2p/src/types/pubsub.rs","rank":13,"score":294074.70629386173},{"content":"/// Returns the minimum required bytes to represent a given number of bits.\n\n///\n\n/// `bit_len == 0` requires a single byte.\n\nfn bytes_for_bit_len(bit_len: usize) -> usize {\n\n std::cmp::max(1, (bit_len + 7) / 8)\n\n}\n\n\n\n/// An iterator over the bits in a `Bitfield`.\n\npub struct BitIter<'a, T> {\n\n bitfield: &'a Bitfield<T>,\n\n i: usize,\n\n}\n\n\n\nimpl<'a, T: BitfieldBehaviour> Iterator for BitIter<'a, T> {\n\n type Item = bool;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let res = self.bitfield.get(self.i).ok()?;\n\n self.i += 1;\n\n Some(res)\n\n }\n\n}\n\n\n","file_path":"consensus/ssz_types/src/bitfield.rs","rank":14,"score":289889.2614029598},{"content":"pub fn cli_run<E: EthSpec>(matches: &ArgMatches, mut env: Environment<E>) -> Result<(), String> {\n\n let keystore_path: PathBuf = clap_utils::parse_required(matches, KEYSTORE_FLAG)?;\n\n let password_file_path: Option<PathBuf> =\n\n clap_utils::parse_optional(matches, PASSWORD_FILE_FLAG)?;\n\n let stdin_inputs = matches.is_present(STDIN_INPUTS_FLAG);\n\n\n\n let spec = env.eth2_config().spec.clone();\n\n let server_url: String = clap_utils::parse_required(matches, BEACON_SERVER_FLAG)?;\n\n let client = BeaconNodeHttpClient::new(\n\n Url::parse(&server_url)\n\n .map_err(|e| format!(\"Failed to parse beacon http server: {:?}\", e))?,\n\n );\n\n\n\n let testnet_config = env\n\n .testnet\n\n .clone()\n\n .expect(\"network should have a valid config\");\n\n\n\n env.runtime().block_on(publish_voluntary_exit::<E>(\n\n &keystore_path,\n","file_path":"account_manager/src/validator/exit.rs","rank":15,"score":289233.6076773606},{"content":"pub fn serialize<S>(bytes: &[u8; BYTES_LEN], serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n{\n\n let mut hex_string: String = \"0x\".to_string();\n\n hex_string.push_str(&hex::encode(&bytes));\n\n\n\n serializer.serialize_str(&hex_string)\n\n}\n\n\n","file_path":"consensus/serde_utils/src/bytes_4_hex.rs","rank":16,"score":281875.8677427227},{"content":"#[allow(dead_code)]\n\nfn keypair_from_bytes(mut bytes: Vec<u8>) -> error::Result<Keypair> {\n\n libp2p::core::identity::secp256k1::SecretKey::from_bytes(&mut bytes)\n\n .map(|secret| {\n\n let keypair: libp2p::core::identity::secp256k1::Keypair = secret.into();\n\n Keypair::Secp256k1(keypair)\n\n })\n\n .map_err(|e| format!(\"Unable to parse p2p secret key: {:?}\", e).into())\n\n}\n\n\n","file_path":"beacon_node/eth2_libp2p/src/service.rs","rank":17,"score":279040.56666975986},{"content":"fn process_epoch_field(val: Epoch, leaf: &mut Hash256, force_update: bool) -> bool {\n\n process_u64_field(val.as_u64(), leaf, force_update)\n\n}\n\n\n","file_path":"consensus/types/src/tree_hash_impls.rs","rank":18,"score":277044.46134780266},{"content":"fn process_u64_field(val: u64, leaf: &mut Hash256, force_update: bool) -> bool {\n\n let new_tree_hash = int_to_fixed_bytes32(val);\n\n process_slice_field(&new_tree_hash[..], leaf, force_update)\n\n}\n\n\n","file_path":"consensus/types/src/tree_hash_impls.rs","rank":19,"score":277044.46134780266},{"content":"pub fn parse_fork_opt(matches: &ArgMatches, name: &'static str) -> Result<Option<[u8; 4]>, String> {\n\n matches\n\n .value_of(name)\n\n .map(|val| {\n\n if val.starts_with(\"0x\") {\n\n let vec = hex::decode(&val[2..])\n\n .map_err(|e| format!(\"Unable to parse {} as hex: {:?}\", name, e))?;\n\n\n\n if vec.len() != 4 {\n\n Err(format!(\"{} must be exactly 4 bytes\", name))\n\n } else {\n\n let mut arr = [0; 4];\n\n arr.copy_from_slice(&vec);\n\n Ok(arr)\n\n }\n\n } else {\n\n Err(format!(\"Unable to parse {}, must have 0x prefix\", name))\n\n }\n\n })\n\n .transpose()\n\n}\n\n\n","file_path":"lcli/src/helpers.rs","rank":20,"score":271593.72681256116},{"content":"pub fn serialize<S>(byte: &u8, serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n{\n\n let hex = format!(\"0x{}\", hex::encode([*byte]));\n\n serializer.serialize_str(&hex)\n\n}\n\n\n","file_path":"consensus/serde_utils/src/u8_hex.rs","rank":21,"score":270594.576140019},{"content":"/// Write some bytes to file.\n\nfn write_to_file(path: &PathBuf, item: &[u8]) -> Result<(), String> {\n\n File::create(path)\n\n .map_err(|e| format!(\"Unable to create {:?}: {:?}\", path, e))\n\n .and_then(|mut file| {\n\n file.write_all(item)\n\n .map(|_| ())\n\n .map_err(|e| format!(\"Unable to write to {:?}: {:?}\", path, e))\n\n })\n\n}\n","file_path":"testing/state_transition_vectors/src/main.rs","rank":22,"score":268047.2226188901},{"content":"pub fn check_tree_hash(expected_str: &str, actual_root: &[u8]) -> Result<(), Error> {\n\n let expected_root = hex::decode(&expected_str[2..])\n\n .map_err(|e| Error::FailedToParseTest(format!(\"{:?}\", e)))?;\n\n let expected_root = Hash256::from_slice(&expected_root);\n\n let tree_hash_root = Hash256::from_slice(actual_root);\n\n compare_result::<Hash256, Error>(&Ok(tree_hash_root), &Some(expected_root))\n\n}\n\n\n\nimpl<T: SszStaticType> Case for SszStatic<T> {\n\n fn result(&self, _case_index: usize) -> Result<(), Error> {\n\n check_serialization(&self.value, &self.serialized)?;\n\n check_tree_hash(&self.roots.root, self.value.tree_hash_root().as_bytes())?;\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl<T: SszStaticType + CachedTreeHash<C>, C: Debug + Sync> Case for SszStaticTHC<T, C> {\n\n fn result(&self, _case_index: usize) -> Result<(), Error> {\n\n check_serialization(&self.value, &self.serialized)?;\n\n check_tree_hash(&self.roots.root, self.value.tree_hash_root().as_bytes())?;\n","file_path":"testing/ef_tests/src/cases/ssz_static.rs","rank":23,"score":265691.26159876026},{"content":"/// Removes the `0x` prefix from some bytes. Returns an error if the prefix is not present.\n\nfn strip_prefix(hex: &str) -> Result<&str, String> {\n\n if hex.starts_with(\"0x\") {\n\n Ok(&hex[2..])\n\n } else {\n\n Err(\"Hex string did not start with `0x`\".to_string())\n\n }\n\n}\n","file_path":"beacon_node/eth1/src/http.rs","rank":24,"score":263963.9122845484},{"content":"fn get_state<E: EthSpec>(validator_count: usize) -> BeaconState<E> {\n\n let spec = &E::default_spec();\n\n let eth1_data = Eth1Data {\n\n deposit_root: Hash256::zero(),\n\n deposit_count: 0,\n\n block_hash: Hash256::zero(),\n\n };\n\n\n\n let mut state = BeaconState::new(0, eth1_data, spec);\n\n\n\n for i in 0..validator_count {\n\n state.balances.push(i as u64).expect(\"should add balance\");\n\n }\n\n\n\n state.validators = (0..validator_count)\n\n .collect::<Vec<_>>()\n\n .par_iter()\n\n .map(|&i| Validator {\n\n pubkey: generate_deterministic_keypair(i).pk.into(),\n\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\n","file_path":"consensus/types/benches/benches.rs","rank":25,"score":259578.37740688177},{"content":"fn trim_newline(s: &mut String) {\n\n if s.ends_with('\\n') {\n\n s.pop();\n\n if s.ends_with('\\r') {\n\n s.pop();\n\n }\n\n }\n\n}\n\n\n","file_path":"common/account_utils/src/lib.rs","rank":26,"score":258555.74691030098},{"content":"/// Decrease the balance of a validator, saturating upon overflow, as per the spec.\n\n///\n\n/// Spec v0.12.1\n\npub fn decrease_balance<E: EthSpec>(state: &mut BeaconState<E>, index: usize, delta: u64) {\n\n state.balances[index] = state.balances[index].saturating_sub(delta);\n\n}\n","file_path":"consensus/state_processing/src/common/mod.rs","rank":27,"score":258358.63664675466},{"content":"/// Verify that `s` can be used as a CORS origin.\n\n///\n\n/// ## Notes\n\n///\n\n/// We need this function since `warp` will panic if provided an invalid origin. The verification\n\n/// code is taken from here:\n\n///\n\n/// https://github.com/seanmonstar/warp/blob/3d1760c6ca35ce2d03dee0562259d0320e9face3/src/filters/cors.rs#L616\n\n///\n\n/// Ideally we should make a PR to `warp` to expose this behaviour, however we defer this for a\n\n/// later time. The impact of a false-positive on this function is fairly limited, since only\n\n/// trusted users should be setting CORS origins.\n\nfn verify_cors_origin_str(s: &str) -> Result<(), String> {\n\n // Always the wildcard origin.\n\n if s == \"*\" {\n\n return Ok(());\n\n }\n\n\n\n let mut parts = s.splitn(2, \"://\");\n\n let scheme = parts\n\n .next()\n\n .ok_or_else(|| format!(\"{} is missing a scheme\", s))?;\n\n let rest = parts\n\n .next()\n\n .ok_or_else(|| format!(\"{} is missing the part following the scheme\", s))?;\n\n\n\n headers::Origin::try_from_parts(scheme, rest, None)\n\n .map_err(|e| format!(\"Unable to parse {}: {}\", s, e))\n\n .map(|_| ())\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"common/warp_utils/src/cors.rs","rank":28,"score":257243.19671424403},{"content":"pub fn parse_path(matches: &ArgMatches, name: &'static str) -> Result<PathBuf, String> {\n\n matches\n\n .value_of(name)\n\n .ok_or_else(|| format!(\"{} not specified\", name))?\n\n .parse::<PathBuf>()\n\n .map_err(|e| format!(\"Unable to parse {}: {}\", name, e))\n\n}\n\n\n","file_path":"lcli/src/helpers.rs","rank":29,"score":253198.37936615312},{"content":"fn build_node<E: EthSpec>(env: &mut Environment<E>) -> LocalBeaconNode<E> {\n\n let context = env.core_context();\n\n env.runtime()\n\n .block_on(LocalBeaconNode::production(\n\n context,\n\n testing_client_config(),\n\n ))\n\n .expect(\"should block until node created\")\n\n}\n\n\n","file_path":"beacon_node/tests/test.rs","rank":30,"score":252462.60258249886},{"content":"/// Converts an integer represented as a string to a big-endian byte array.\n\nfn int_to_vec(int_str: &str) -> Vec<u8> {\n\n BigUint::parse_bytes(int_str.as_bytes(), 10)\n\n .expect(\"must be able to parse int\")\n\n .to_bytes_be()\n\n}\n\n\n","file_path":"crypto/eth2_key_derivation/tests/eip2333_vectors.rs","rank":31,"score":251634.3203670251},{"content":"/// Reads a mnemonic phrase from TTY or stdin if `use_stdin == true`.\n\npub fn read_input_from_user(use_stdin: bool) -> Result<String, String> {\n\n let mut input = String::new();\n\n if use_stdin {\n\n io::stdin()\n\n .read_line(&mut input)\n\n .map_err(|e| format!(\"Error reading from stdin: {}\", e))?;\n\n } else {\n\n let tty = File::open(\"/dev/tty\").map_err(|e| format!(\"Error opening tty: {}\", e))?;\n\n let mut buf_reader = io::BufReader::new(tty);\n\n buf_reader\n\n .read_line(&mut input)\n\n .map_err(|e| format!(\"Error reading from tty: {}\", e))?;\n\n }\n\n trim_newline(&mut input);\n\n Ok(input)\n\n}\n\n\n","file_path":"common/account_utils/src/lib.rs","rank":32,"score":251315.0663217272},{"content":"/// Decode bytes as a little-endian usize, returning an `Err` if `bytes.len() !=\n\n/// BYTES_PER_LENGTH_OFFSET`.\n\nfn decode_offset(bytes: &[u8]) -> Result<usize, DecodeError> {\n\n let len = bytes.len();\n\n let expected = BYTES_PER_LENGTH_OFFSET;\n\n\n\n if len != expected {\n\n Err(DecodeError::InvalidLengthPrefix { len, expected })\n\n } else {\n\n let mut array: [u8; BYTES_PER_LENGTH_OFFSET] = std::default::Default::default();\n\n array.clone_from_slice(bytes);\n\n\n\n Ok(u32::from_le_bytes(array) as usize)\n\n }\n\n}\n","file_path":"consensus/ssz/src/decode.rs","rank":33,"score":248289.28362365084},{"content":"/// Reads a `BYTES_PER_LENGTH_OFFSET`-byte length from `bytes`, where `bytes.len() >=\n\n/// BYTES_PER_LENGTH_OFFSET`.\n\nfn read_offset(bytes: &[u8]) -> Result<usize, DecodeError> {\n\n decode_offset(bytes.get(0..BYTES_PER_LENGTH_OFFSET).ok_or_else(|| {\n\n DecodeError::InvalidLengthPrefix {\n\n len: bytes.len(),\n\n expected: BYTES_PER_LENGTH_OFFSET,\n\n }\n\n })?)\n\n}\n\n\n","file_path":"consensus/ssz/src/decode.rs","rank":34,"score":248277.96845306168},{"content":"// helper function to identify clients from their agent_version. Returns the client\n\n// kind and it's associated version and the OS kind.\n\nfn client_from_agent_version(agent_version: &str) -> (ClientKind, String, String) {\n\n let mut agent_split = agent_version.split('/');\n\n match agent_split.next() {\n\n Some(\"Lighthouse\") => {\n\n let kind = ClientKind::Lighthouse;\n\n let mut version = String::from(\"unknown\");\n\n let mut os_version = version.clone();\n\n if let Some(agent_version) = agent_split.next() {\n\n version = agent_version.into();\n\n if let Some(agent_os_version) = agent_split.next() {\n\n os_version = agent_os_version.into();\n\n }\n\n }\n\n (kind, version, os_version)\n\n }\n\n Some(\"teku\") => {\n\n let kind = ClientKind::Teku;\n\n let mut version = String::from(\"unknown\");\n\n let mut os_version = version.clone();\n\n if agent_split.next().is_some() {\n","file_path":"beacon_node/eth2_libp2p/src/peer_manager/client.rs","rank":35,"score":247949.9576445665},{"content":"pub fn subnet_id_to_string(i: u64) -> &'static str {\n\n if i < MAX_SUBNET_ID as u64 {\n\n &SUBNET_ID_TO_STRING\n\n .get(i as usize)\n\n .expect(\"index below MAX_SUBNET_ID\")\n\n } else {\n\n \"subnet id out of range\"\n\n }\n\n}\n\n\n\nimpl SubnetId {\n\n pub fn new(id: u64) -> Self {\n\n id.into()\n\n }\n\n\n\n /// Compute the subnet for an attestation with `attestation_data` where each slot in the\n\n /// attestation epoch contains `committee_count_per_slot` committees.\n\n pub fn compute_subnet_for_attestation_data<T: EthSpec>(\n\n attestation_data: &AttestationData,\n\n committee_count_per_slot: u64,\n","file_path":"consensus/types/src/subnet_id.rs","rank":36,"score":247764.9763074132},{"content":"pub fn get_key_for_col(column: &str, key: &[u8]) -> Vec<u8> {\n\n let mut result = column.as_bytes().to_vec();\n\n result.extend_from_slice(key);\n\n result\n\n}\n\n\n\npub enum KeyValueStoreOp {\n\n PutKeyValue(Vec<u8>, Vec<u8>),\n\n DeleteKey(Vec<u8>),\n\n}\n\n\n","file_path":"beacon_node/store/src/lib.rs","rank":37,"score":247255.11433103235},{"content":"// Note: `state.canonical_root()` uses whatever `tree_hash` that the `types` crate\n\n// uses, which is not necessarily this crate. If you want to ensure that types is\n\n// using this local version of `tree_hash`, ensure you add a workspace-level\n\n// [dependency\n\n// patch](https://doc.rust-lang.org/cargo/reference/manifest.html#the-patch-section).\n\nfn bench_suite<T: EthSpec>(c: &mut Criterion, spec_desc: &str, validator_count: usize) {\n\n let state1 = build_state::<T>(validator_count);\n\n let state2 = state1.clone();\n\n let mut state3 = state1.clone();\n\n state3.update_tree_hash_cache().unwrap();\n\n\n\n c.bench(\n\n &format!(\"{}/{}_validators/no_cache\", spec_desc, validator_count),\n\n Benchmark::new(\"genesis_state\", move |b| {\n\n b.iter_batched_ref(\n\n || state1.clone(),\n\n |state| black_box(state.canonical_root()),\n\n criterion::BatchSize::SmallInput,\n\n )\n\n })\n\n .sample_size(10),\n\n );\n\n\n\n c.bench(\n\n &format!(\"{}/{}_validators/empty_cache\", spec_desc, validator_count),\n","file_path":"consensus/tree_hash/benches/benches.rs","rank":38,"score":246772.49279017845},{"content":"/// Run a bench with a highly complex block.\n\nfn worst_bench<T: EthSpec>(c: &mut Criterion, spec_desc: &str, validator_count: usize) {\n\n let mut spec = &mut T::default_spec();\n\n\n\n // Allows the exits to be processed sucessfully.\n\n spec.shard_committee_period = 0;\n\n\n\n let (block, state) = get_worst_block(validator_count, spec);\n\n bench_block::<T>(c, block, state, spec, spec_desc, \"high_complexity_block\");\n\n}\n\n\n","file_path":"consensus/state_processing/benches/benches.rs","rank":39,"score":246766.30429189483},{"content":"/// Run a bench with a average complexity block.\n\nfn average_bench<T: EthSpec>(c: &mut Criterion, spec_desc: &str, validator_count: usize) {\n\n let spec = &T::default_spec();\n\n\n\n let (block, state) = get_average_block(validator_count, spec);\n\n bench_block::<T>(c, block, state, spec, spec_desc, \"average_complexity_block\");\n\n}\n\n\n","file_path":"consensus/state_processing/benches/benches.rs","rank":40,"score":246766.30429189483},{"content":"fn get_state(validator_count: usize) -> BeaconState<E> {\n\n let spec = &E::default_spec();\n\n let eth1_data = Eth1Data {\n\n deposit_root: Hash256::zero(),\n\n deposit_count: 0,\n\n block_hash: Hash256::zero(),\n\n };\n\n\n\n let mut state = BeaconState::new(0, eth1_data, spec);\n\n\n\n for i in 0..validator_count {\n\n state.balances.push(i as u64).expect(\"should add balance\");\n\n state\n\n .validators\n\n .push(Validator {\n\n pubkey: generate_deterministic_keypair(i).pk.into(),\n\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\n\n effective_balance: i as u64,\n\n slashed: i % 2 == 0,\n\n activation_eligibility_epoch: i.into(),\n\n activation_epoch: i.into(),\n\n exit_epoch: i.into(),\n\n withdrawable_epoch: i.into(),\n\n })\n\n .expect(\"should add validator\");\n\n }\n\n\n\n state\n\n}\n\n\n","file_path":"consensus/types/examples/clone_state.rs","rank":41,"score":246642.21279008576},{"content":"/// Creates a file with `600 (-rw-------)` permissions.\n\npub fn create_with_600_perms<P: AsRef<Path>>(path: P, bytes: &[u8]) -> Result<(), String> {\n\n let path = path.as_ref();\n\n\n\n let mut file =\n\n File::create(&path).map_err(|e| format!(\"Unable to create {:?}: {}\", path, e))?;\n\n\n\n let mut perm = file\n\n .metadata()\n\n .map_err(|e| format!(\"Unable to get {:?} metadata: {}\", path, e))?\n\n .permissions();\n\n\n\n perm.set_mode(0o600);\n\n\n\n file.set_permissions(perm)\n\n .map_err(|e| format!(\"Unable to set {:?} permissions: {}\", path, e))?;\n\n\n\n file.write_all(bytes)\n\n .map_err(|e| format!(\"Unable to write to {:?}: {}\", path, e))?;\n\n\n\n Ok(())\n\n}\n","file_path":"account_manager/src/wallet/create.rs","rank":42,"score":246411.00519541436},{"content":"#[allow(clippy::too_many_arguments)]\n\nfn store_range<F, E, S, I>(\n\n _: F,\n\n range: I,\n\n start_vindex: usize,\n\n end_vindex: usize,\n\n store: &S,\n\n state: &BeaconState<E>,\n\n spec: &ChainSpec,\n\n ops: &mut Vec<KeyValueStoreOp>,\n\n) -> Result<bool, Error>\n\nwhere\n\n F: Field<E>,\n\n E: EthSpec,\n\n S: KeyValueStore<E>,\n\n I: Iterator<Item = usize>,\n\n{\n\n for chunk_index in range {\n\n let chunk_key = &chunk_key(chunk_index as u64)[..];\n\n\n\n let existing_chunk =\n","file_path":"beacon_node/store/src/chunked_vector.rs","rank":43,"score":246225.32295576404},{"content":"fn get_state(validator_count: usize) -> BeaconState<E> {\n\n let spec = &E::default_spec();\n\n let eth1_data = Eth1Data {\n\n deposit_root: Hash256::zero(),\n\n deposit_count: 0,\n\n block_hash: Hash256::zero(),\n\n };\n\n\n\n let mut state = BeaconState::new(0, eth1_data, spec);\n\n\n\n for i in 0..validator_count {\n\n state.balances.push(i as u64).expect(\"should add balance\");\n\n state\n\n .validators\n\n .push(Validator {\n\n pubkey: generate_deterministic_keypair(i).pk.into(),\n\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\n\n effective_balance: i as u64,\n\n slashed: i % 2 == 0,\n\n activation_eligibility_epoch: i.into(),\n\n activation_epoch: i.into(),\n\n exit_epoch: i.into(),\n\n withdrawable_epoch: i.into(),\n\n })\n\n .expect(\"should add validator\");\n\n }\n\n\n\n state\n\n}\n\n\n","file_path":"consensus/types/examples/ssz_encode_state.rs","rank":44,"score":242749.35885748832},{"content":"fn get_state(validator_count: usize) -> BeaconState<E> {\n\n let spec = &E::default_spec();\n\n let eth1_data = Eth1Data {\n\n deposit_root: Hash256::zero(),\n\n deposit_count: 0,\n\n block_hash: Hash256::zero(),\n\n };\n\n\n\n let mut state = BeaconState::new(0, eth1_data, spec);\n\n\n\n for i in 0..validator_count {\n\n state.balances.push(i as u64).expect(\"should add balance\");\n\n state\n\n .validators\n\n .push(Validator {\n\n pubkey: generate_deterministic_keypair(i).pk.into(),\n\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\n\n effective_balance: i as u64,\n\n slashed: i % 2 == 0,\n\n activation_eligibility_epoch: i.into(),\n\n activation_epoch: i.into(),\n\n exit_epoch: i.into(),\n\n withdrawable_epoch: i.into(),\n\n })\n\n .expect(\"should add validator\");\n\n }\n\n\n\n state\n\n}\n\n\n","file_path":"consensus/types/examples/tree_hash_state.rs","rank":45,"score":242749.35885748832},{"content":"/// A helper function providing common functionality for finding the Merkle root of some bytes that\n\n/// represent a bitfield.\n\npub fn bitfield_bytes_tree_hash_root<N: Unsigned>(bytes: &[u8]) -> Hash256 {\n\n let byte_size = (N::to_usize() + 7) / 8;\n\n let leaf_count = (byte_size + BYTES_PER_CHUNK - 1) / BYTES_PER_CHUNK;\n\n\n\n let mut hasher = MerkleHasher::with_leaves(leaf_count);\n\n\n\n hasher\n\n .write(bytes)\n\n .expect(\"bitfield should not exceed tree hash leaf limit\");\n\n\n\n hasher\n\n .finish()\n\n .expect(\"bitfield tree hash buffer should not exceed leaf limit\")\n\n}\n","file_path":"consensus/ssz_types/src/tree_hash.rs","rank":46,"score":241058.77633399848},{"content":"pub fn store_updated_vector<F: Field<E>, E: EthSpec, S: KeyValueStore<E>>(\n\n field: F,\n\n store: &S,\n\n state: &BeaconState<E>,\n\n spec: &ChainSpec,\n\n ops: &mut Vec<KeyValueStoreOp>,\n\n) -> Result<(), Error> {\n\n let chunk_size = F::chunk_size();\n\n let (start_vindex, end_vindex) = F::start_and_end_vindex(state.slot, spec);\n\n let start_cindex = start_vindex / chunk_size;\n\n let end_cindex = end_vindex / chunk_size;\n\n\n\n // Store the genesis value if we have access to it, and it hasn't been stored already.\n\n if F::slot_needs_genesis_value(state.slot, spec) {\n\n let genesis_value = F::extract_genesis_value(state, spec)?;\n\n F::check_and_store_genesis_value(store, genesis_value, ops)?;\n\n }\n\n\n\n // Start by iterating backwards from the last chunk, storing new chunks in the database.\n\n // Stop once a chunk in the database matches what we were about to store, this indicates\n","file_path":"beacon_node/store/src/chunked_vector.rs","rank":47,"score":240432.15946709167},{"content":"fn variable_list_h256_test<Len: Unsigned>(leaves_and_skips: Vec<(u64, bool)>) -> bool {\n\n let arena = &mut CacheArena::default();\n\n let leaves: Vec<_> = leaves_and_skips\n\n .iter()\n\n .map(|(l, _)| Hash256::from_low_u64_be(*l))\n\n .take(Len::to_usize())\n\n .collect();\n\n\n\n let mut list: VariableList<Hash256, Len>;\n\n let init: VariableList<Hash256, Len> = VariableList::new(vec![]).unwrap();\n\n let mut cache = init.new_tree_hash_cache(arena);\n\n\n\n for (end, (_, update_cache)) in leaves_and_skips.into_iter().enumerate() {\n\n list = VariableList::new(leaves[..end].to_vec()).unwrap();\n\n\n\n if update_cache\n\n && list\n\n .recalculate_tree_hash_root(arena, &mut cache)\n\n .unwrap()\n\n .as_bytes()\n\n != &list.tree_hash_root()[..]\n\n {\n\n return false;\n\n }\n\n }\n\n true\n\n}\n","file_path":"consensus/cached_tree_hash/src/test.rs","rank":48,"score":240405.4328382326},{"content":"/// Returns `true` if we should consider the `file_name` to represent a voting keystore.\n\npub fn is_voting_keystore(file_name: &str) -> bool {\n\n // All formats end with `.json`.\n\n if !file_name.ends_with(\".json\") {\n\n return false;\n\n }\n\n\n\n // The format used by Lighthouse.\n\n if file_name == VOTING_KEYSTORE_FILE {\n\n return true;\n\n }\n\n\n\n // The format exported by the `eth2.0-deposit-cli` library.\n\n //\n\n // Reference to function that generates keystores:\n\n //\n\n // https://github.com/ethereum/eth2.0-deposit-cli/blob/7cebff15eac299b3b1b090c896dd3410c8463450/eth2deposit/credentials.py#L58-L62\n\n //\n\n // Since we include the key derivation path of `m/12381/3600/x/0/0` this should only ever match\n\n // with a voting keystore and never a withdrawal keystore.\n\n //\n","file_path":"common/account_utils/src/validator_definitions.rs","rank":49,"score":240196.18556626939},{"content":"/// Converts 0x-prefixed hex to bytes.\n\nfn hex_to_vec(hex: &str) -> Vec<u8> {\n\n hex::decode(&hex[2..]).expect(\"should decode hex as vec\")\n\n}\n\n\n","file_path":"crypto/eth2_key_derivation/tests/eip2333_vectors.rs","rank":50,"score":239867.51367373724},{"content":"/// Parses a `0x`-prefixed, **big-endian** hex string as a u64.\n\n///\n\n/// Note: the JSON-RPC encodes integers as big-endian. The deposit contract uses little-endian.\n\n/// Therefore, this function is only useful for numbers encoded by the JSON RPC.\n\n///\n\n/// E.g., `0x01 == 1`\n\nfn hex_to_u64_be(hex: &str) -> Result<u64, String> {\n\n u64::from_str_radix(strip_prefix(hex)?, 16)\n\n .map_err(|e| format!(\"Failed to parse hex as u64: {:?}\", e))\n\n}\n\n\n","file_path":"beacon_node/eth1/src/http.rs","rank":51,"score":237855.68858469246},{"content":"// hex::encode only allows up to 32 bytes.\n\npub fn bytes96_to_hex_string(data: [u8; 96]) -> Result<String, Error> {\n\n static CHARS: &[u8] = b\"0123456789abcdef\";\n\n let mut s = String::with_capacity(96 * 2 + 2);\n\n\n\n s.write_char('0')?;\n\n s.write_char('x')?;\n\n\n\n for &byte in data.iter() {\n\n s.write_char(CHARS[(byte >> 4) as usize].into())?;\n\n s.write_char(CHARS[(byte & 0xf) as usize].into())?;\n\n }\n\n\n\n Ok(s)\n\n}\n\n\n","file_path":"remote_signer/backend/src/utils.rs","rank":52,"score":237784.2542164644},{"content":"/// Reads a `BYTES_PER_LENGTH_OFFSET`-byte union index from `bytes`, where `bytes.len() >=\n\n/// BYTES_PER_LENGTH_OFFSET`.\n\npub fn read_union_index(bytes: &[u8]) -> Result<usize, DecodeError> {\n\n read_offset(bytes)\n\n}\n\n\n","file_path":"consensus/ssz/src/decode.rs","rank":53,"score":237420.58756072045},{"content":"/// Reads a password from TTY or stdin if `use_stdin == true`.\n\npub fn read_password_from_user(use_stdin: bool) -> Result<ZeroizeString, String> {\n\n let result = if use_stdin {\n\n rpassword::prompt_password_stderr(\"\")\n\n .map_err(|e| format!(\"Error reading from stdin: {}\", e))\n\n } else {\n\n rpassword::read_password_from_tty(None)\n\n .map_err(|e| format!(\"Error reading from tty: {}\", e))\n\n };\n\n\n\n result.map(ZeroizeString::from)\n\n}\n\n\n","file_path":"common/account_utils/src/lib.rs","rank":54,"score":236908.22784797937},{"content":"/// Encode `index` as a little-endian byte array of `BYTES_PER_LENGTH_OFFSET` length.\n\n///\n\n/// If `len` is larger than `2 ^ BYTES_PER_LENGTH_OFFSET`, a `debug_assert` is raised.\n\npub fn encode_union_index(index: usize) -> [u8; BYTES_PER_LENGTH_OFFSET] {\n\n encode_length(index)\n\n}\n\n\n","file_path":"consensus/ssz/src/encode.rs","rank":55,"score":236549.4760129461},{"content":"pub fn load_vector_from_db<F: FixedLengthField<E>, E: EthSpec, S: KeyValueStore<E>>(\n\n store: &S,\n\n slot: Slot,\n\n spec: &ChainSpec,\n\n) -> Result<FixedVector<F::Value, F::Length>, Error> {\n\n // Do a range query\n\n let chunk_size = F::chunk_size();\n\n let (start_vindex, end_vindex) = F::start_and_end_vindex(slot, spec);\n\n let start_cindex = start_vindex / chunk_size;\n\n let end_cindex = end_vindex / chunk_size;\n\n\n\n let chunks = range_query(store, F::column(), start_cindex, end_cindex)?;\n\n\n\n let default = if F::slot_needs_genesis_value(slot, spec) {\n\n F::load_genesis_value(store)?\n\n } else {\n\n F::Value::default()\n\n };\n\n\n\n let result = stitch(\n","file_path":"beacon_node/store/src/chunked_vector.rs","rank":56,"score":236451.59909715707},{"content":"/// Takes a string password and checks that it meets minimum requirements.\n\n///\n\n/// The current minimum password requirement is a 12 character length character length.\n\npub fn is_password_sufficiently_complex(password: &[u8]) -> Result<(), String> {\n\n if count_unicode_characters(password) >= MINIMUM_PASSWORD_LEN {\n\n Ok(())\n\n } else {\n\n Err(format!(\n\n \"Please use at least {} characters for your password.\",\n\n MINIMUM_PASSWORD_LEN\n\n ))\n\n }\n\n}\n\n\n","file_path":"common/account_utils/src/lib.rs","rank":57,"score":234666.4619240947},{"content":"/// The historical roots are stored in vector chunks, despite not actually being a vector.\n\npub fn load_variable_list_from_db<F: VariableLengthField<E>, E: EthSpec, S: KeyValueStore<E>>(\n\n store: &S,\n\n slot: Slot,\n\n spec: &ChainSpec,\n\n) -> Result<VariableList<F::Value, F::Length>, Error> {\n\n let chunk_size = F::chunk_size();\n\n let (start_vindex, end_vindex) = F::start_and_end_vindex(slot, spec);\n\n let start_cindex = start_vindex / chunk_size;\n\n let end_cindex = end_vindex / chunk_size;\n\n\n\n let chunks: Vec<Chunk<F::Value>> = range_query(store, F::column(), start_cindex, end_cindex)?;\n\n\n\n let mut result = Vec::with_capacity(chunk_size * chunks.len());\n\n\n\n for (chunk_index, chunk) in chunks.into_iter().enumerate() {\n\n for (i, value) in chunk.values.into_iter().enumerate() {\n\n let vindex = chunk_index * chunk_size + i;\n\n\n\n if vindex >= start_vindex && vindex < end_vindex {\n\n result.push(value);\n\n }\n\n }\n\n }\n\n\n\n Ok(result.into())\n\n}\n\n\n","file_path":"beacon_node/store/src/chunked_vector.rs","rank":58,"score":234552.59034174925},{"content":"/// Remove all entries from the given hash map for which `prune_if` returns true.\n\n///\n\n/// The keys in the map should be validator indices, which will be looked up\n\n/// in the state's validator registry and then passed to `prune_if`.\n\n/// Entries for unknown validators will be kept.\n\nfn prune_validator_hash_map<T, F, E: EthSpec>(\n\n map: &mut HashMap<u64, T>,\n\n prune_if: F,\n\n head_state: &BeaconState<E>,\n\n) where\n\n F: Fn(&Validator) -> bool,\n\n{\n\n map.retain(|&validator_index, _| {\n\n head_state\n\n .validators\n\n .get(validator_index as usize)\n\n .map_or(true, |validator| !prune_if(validator))\n\n });\n\n}\n\n\n\n/// Compare two operation pools.\n\nimpl<T: EthSpec + Default> PartialEq for OperationPool<T> {\n\n fn eq(&self, other: &Self) -> bool {\n\n if ptr::eq(self, other) {\n\n return true;\n","file_path":"beacon_node/operation_pool/src/lib.rs","rank":59,"score":234248.8348295537},{"content":"fn update_parent_roots(snapshots: &mut [BeaconSnapshot<E>]) {\n\n for i in 0..snapshots.len() {\n\n let root = snapshots[i].beacon_block.canonical_root();\n\n if let Some(child) = snapshots.get_mut(i + 1) {\n\n child.beacon_block.message.parent_root = root\n\n }\n\n }\n\n}\n\n\n","file_path":"beacon_node/beacon_chain/tests/block_verification.rs","rank":60,"score":234187.00176522054},{"content":"/// Merkleize `bytes` and return the root, optionally padding the tree out to `min_leaves` number of\n\n/// leaves.\n\n///\n\n/// **Note**: This function is generally worse than using the `crate::merkle_root` which uses\n\n/// `MerkleHasher`. We only keep this function around for reference testing.\n\n///\n\n/// First all nodes are extracted from `bytes` and then a padding node is added until the number of\n\n/// leaf chunks is greater than or equal to `min_leaves`. Callers may set `min_leaves` to `0` if no\n\n/// adding additional chunks should be added to the given `bytes`.\n\n///\n\n/// If `bytes.len() <= BYTES_PER_CHUNK`, no hashing is done and `bytes` is returned, potentially\n\n/// padded out to `BYTES_PER_CHUNK` length with `0`.\n\n///\n\n/// ## CPU Performance\n\n///\n\n/// A cache of `MAX_TREE_DEPTH` hashes are stored to avoid re-computing the hashes of padding nodes\n\n/// (or their parents). Therefore, adding padding nodes only incurs one more hash per additional\n\n/// height of the tree.\n\n///\n\n/// ## Memory Performance\n\n///\n\n/// This algorithm has two interesting memory usage properties:\n\n///\n\n/// 1. The maximum memory footprint is roughly `O(V / 2)` memory, where `V` is the number of leaf\n\n/// chunks with values (i.e., leaves that are not padding). The means adding padding nodes to\n\n/// the tree does not increase the memory footprint.\n\n/// 2. At each height of the tree half of the memory is freed until only a single chunk is stored.\n\n/// 3. The input `bytes` are not copied into another list before processing.\n\n///\n\n/// _Note: there are some minor memory overheads, including a handful of usizes and a list of\n\n/// `MAX_TREE_DEPTH` hashes as `lazy_static` constants._\n\npub fn merkleize_padded(bytes: &[u8], min_leaves: usize) -> Hash256 {\n\n // If the bytes are just one chunk or less, pad to one chunk and return without hashing.\n\n if bytes.len() <= BYTES_PER_CHUNK && min_leaves <= 1 {\n\n let mut o = bytes.to_vec();\n\n o.resize(BYTES_PER_CHUNK, 0);\n\n return Hash256::from_slice(&o);\n\n }\n\n\n\n assert!(\n\n bytes.len() > BYTES_PER_CHUNK || min_leaves > 1,\n\n \"Merkle hashing only needs to happen if there is more than one chunk\"\n\n );\n\n\n\n // The number of leaves that can be made directly from `bytes`.\n\n let leaves_with_values = (bytes.len() + (BYTES_PER_CHUNK - 1)) / BYTES_PER_CHUNK;\n\n\n\n // The number of parents that have at least one non-padding leaf.\n\n //\n\n // Since there is more than one node in this tree (see prior assertion), there should always be\n\n // one or more initial parent nodes.\n","file_path":"consensus/tree_hash/src/merkleize_padded.rs","rank":61,"score":233678.1031970629},{"content":"/// Convenience method for `MerkleHasher` which also provides some fast-paths for small trees.\n\n///\n\n/// `minimum_leaf_count` will only be used if it is greater than or equal to the minimum number of leaves that can be created from `bytes`.\n\npub fn merkle_root(bytes: &[u8], minimum_leaf_count: usize) -> Hash256 {\n\n let leaves = std::cmp::max(\n\n (bytes.len() + (HASHSIZE - 1)) / HASHSIZE,\n\n minimum_leaf_count,\n\n );\n\n\n\n if leaves == 0 {\n\n // If there are no bytes then the hash is always zero.\n\n Hash256::zero()\n\n } else if leaves == 1 {\n\n // If there is only one leaf, the hash is always those leaf bytes padded out to 32-bytes.\n\n let mut hash = [0; HASHSIZE];\n\n hash[0..bytes.len()].copy_from_slice(bytes);\n\n Hash256::from_slice(&hash)\n\n } else if leaves == 2 {\n\n // If there are only two leaves (this is common with BLS pubkeys), we can avoid some\n\n // overhead with `MerkleHasher` and just do a simple 3-node tree here.\n\n let mut leaves = [0; HASHSIZE * 2];\n\n leaves[0..bytes.len()].copy_from_slice(bytes);\n\n\n","file_path":"consensus/tree_hash/src/lib.rs","rank":62,"score":233671.6387915014},{"content":"/// Executes a `Command`, returning a `Result` based upon the success exit code of the command.\n\nfn output_result(cmd: &mut Command) -> Result<Output, String> {\n\n let output = cmd.output().expect(\"should run command\");\n\n\n\n if output.status.success() {\n\n Ok(output)\n\n } else {\n\n Err(from_utf8(&output.stderr)\n\n .expect(\"stderr is not utf8\")\n\n .to_string())\n\n }\n\n}\n\n\n","file_path":"lighthouse/tests/account_manager.rs","rank":63,"score":233493.5830435321},{"content":"/// A bit of hack to find an unused port.\n\n///\n\n/// Does not guarantee that the given port is unused after the function exists, just that it was\n\n/// unused before the function started (i.e., it does not reserve a port).\n\n///\n\n/// Used for passing unused ports to libp2 so that lighthouse won't have to update\n\n/// its own ENR.\n\n///\n\n/// NOTE: It is possible that libp2p/discv5 is unable to bind to the\n\n/// ports returned by this function as the OS has a buffer period where\n\n/// it doesn't allow binding to the same port even after the socket is closed.\n\n/// We might have to use SO_REUSEADDR socket option from `std::net2` crate in\n\n/// that case.\n\npub fn unused_port(transport: &str) -> Result<u16, String> {\n\n let local_addr = match transport {\n\n \"tcp\" => {\n\n let listener = TcpListener::bind(\"127.0.0.1:0\").map_err(|e| {\n\n format!(\"Failed to create TCP listener to find unused port: {:?}\", e)\n\n })?;\n\n listener.local_addr().map_err(|e| {\n\n format!(\n\n \"Failed to read TCP listener local_addr to find unused port: {:?}\",\n\n e\n\n )\n\n })?\n\n }\n\n \"udp\" => {\n\n let socket = UdpSocket::bind(\"127.0.0.1:0\")\n\n .map_err(|e| format!(\"Failed to create UDP socket to find unused port: {:?}\", e))?;\n\n socket.local_addr().map_err(|e| {\n\n format!(\n\n \"Failed to read UDP socket local_addr to find unused port: {:?}\",\n\n e\n\n )\n\n })?\n\n }\n\n _ => return Err(\"Invalid transport to find unused port\".into()),\n\n };\n\n Ok(local_addr.port())\n\n}\n","file_path":"beacon_node/src/config.rs","rank":64,"score":233332.01558145863},{"content":"/// Return a G1 point for the given `validator_index`, encoded as a compressed point in\n\n/// big-endian byte-ordering.\n\npub fn be_private_key(validator_index: usize) -> [u8; PRIVATE_KEY_BYTES] {\n\n let preimage = {\n\n let mut bytes = [0; HASH_BYTES];\n\n let index = validator_index.to_le_bytes();\n\n bytes[0..index.len()].copy_from_slice(&index);\n\n bytes\n\n };\n\n\n\n let privkey = BigUint::from_bytes_le(&hash(&preimage)) % &*CURVE_ORDER;\n\n\n\n let mut bytes = [0; PRIVATE_KEY_BYTES];\n\n let privkey_bytes = privkey.to_bytes_be();\n\n bytes[PRIVATE_KEY_BYTES - privkey_bytes.len()..].copy_from_slice(&privkey_bytes);\n\n bytes\n\n}\n\n\n","file_path":"common/eth2_interop_keypairs/src/lib.rs","rank":65,"score":232956.43407642067},{"content":"/// Accepts an entire HTTP body (as a string) and returns the `result` field, as a serde `Value`.\n\nfn response_result(response: &str) -> Result<Option<Value>, String> {\n\n let json = serde_json::from_str::<Value>(&response)\n\n .map_err(|e| format!(\"Failed to parse response: {:?}\", e))?;\n\n\n\n if let Some(error) = json.get(\"error\") {\n\n Err(format!(\"Eth1 node returned error: {}\", error))\n\n } else {\n\n Ok(json\n\n .get(\"result\")\n\n .cloned()\n\n .map(Some)\n\n .unwrap_or_else(|| None))\n\n }\n\n}\n\n\n","file_path":"beacon_node/eth1/src/http.rs","rank":66,"score":230277.73145111592},{"content":"/// Attempts to parse a mnemonic phrase.\n\npub fn mnemonic_from_phrase(phrase: &str) -> Result<Mnemonic, String> {\n\n Mnemonic::from_phrase(phrase, Language::English).map_err(|e| e.to_string())\n\n}\n\n\n\n/// Provides a new-type wrapper around `String` that is zeroized on `Drop`.\n\n///\n\n/// Useful for ensuring that password memory is zeroed-out on drop.\n\n#[derive(Clone, PartialEq, Serialize, Deserialize, Zeroize)]\n\n#[zeroize(drop)]\n\n#[serde(transparent)]\n\npub struct ZeroizeString(String);\n\n\n\nimpl From<String> for ZeroizeString {\n\n fn from(s: String) -> Self {\n\n Self(s)\n\n }\n\n}\n\n\n\nimpl ZeroizeString {\n\n pub fn as_str(&self) -> &str {\n","file_path":"common/account_utils/src/lib.rs","rank":67,"score":230271.70090317028},{"content":"pub fn deserialize<'de, D>(deserializer: D) -> Result<[u8; BYTES_LEN], D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let decoded = deserializer.deserialize_str(PrefixedHexVisitor)?;\n\n\n\n if decoded.len() != BYTES_LEN {\n\n return Err(D::Error::custom(format!(\n\n \"expected {} bytes for array, got {}\",\n\n BYTES_LEN,\n\n decoded.len()\n\n )));\n\n }\n\n\n\n let mut array = [0; BYTES_LEN];\n\n array.copy_from_slice(&decoded);\n\n Ok(array)\n\n}\n","file_path":"consensus/serde_utils/src/bytes_4_hex.rs","rank":68,"score":229110.49678136807},{"content":"fn get_block<T, F>(mut mutate_builder: F) -> (SignedBeaconBlock<T>, BeaconState<T>)\n\nwhere\n\n T: EthSpec,\n\n F: FnMut(&mut BlockBuilder<T>),\n\n{\n\n let spec = T::default_spec();\n\n let mut builder: BlockBuilder<T> = BlockBuilder::new(VALIDATOR_COUNT, &spec);\n\n builder.set_slot(Slot::from(T::slots_per_epoch() * 3 - 2));\n\n builder.build_caches(&spec);\n\n mutate_builder(&mut builder);\n\n builder.build(&spec)\n\n}\n\n\n","file_path":"consensus/state_processing/tests/tests.rs","rank":69,"score":228585.90326698864},{"content":"/// Returns `int` as little-endian bytes with a length of 1.\n\npub fn int_to_bytes1(int: u8) -> Vec<u8> {\n\n vec![int]\n\n}\n\n\n","file_path":"consensus/int_to_bytes/src/lib.rs","rank":70,"score":227804.81160978408},{"content":"/// Peforms a `HKDF-Expand` on the `pkr` (pseudo-random key), returning `l` bytes.\n\n///\n\n/// Defined in [RFC5869](https://tools.ietf.org/html/rfc5869).\n\nfn hkdf_expand(prk: Prk, info: &[u8], l: usize) -> SecretBytes {\n\n struct ExpandLen(usize);\n\n\n\n impl KeyType for ExpandLen {\n\n fn len(&self) -> usize {\n\n self.0\n\n }\n\n }\n\n\n\n let mut okm = SecretBytes::zero(l);\n\n prk.expand(&[info], ExpandLen(l))\n\n .expect(\"expand len is constant and cannot be too large\")\n\n .fill(okm.as_mut_bytes())\n\n .expect(\"fill len is constant and cannot be too large\");\n\n okm\n\n}\n\n\n","file_path":"crypto/eth2_key_derivation/src/derived_key.rs","rank":71,"score":227465.67218124063},{"content":"pub fn get_environment(is_log_active: bool) -> Environment<E> {\n\n let environment_builder = EnvironmentBuilder::mainnet();\n\n\n\n let builder = if is_log_active {\n\n environment_builder.async_logger(\"info\", None).unwrap()\n\n } else {\n\n environment_builder.null_logger().unwrap()\n\n };\n\n\n\n builder\n\n .multi_threaded_tokio_runtime()\n\n .unwrap()\n\n .build()\n\n .unwrap()\n\n}\n\n\n","file_path":"testing/remote_signer_test/src/api_test_signer.rs","rank":72,"score":226539.36279354285},{"content":"/// Encode `data` as a 0x-prefixed hex string.\n\npub fn encode<T: AsRef<[u8]>>(data: T) -> String {\n\n let hex = hex::encode(data);\n\n let mut s = \"0x\".to_string();\n\n s.push_str(hex.as_str());\n\n s\n\n}\n\n\n","file_path":"consensus/serde_utils/src/hex.rs","rank":73,"score":226035.30167336622},{"content":"fn all_benches(c: &mut Criterion) {\n\n let validator_count = 16_384;\n\n let spec = &MainnetEthSpec::default_spec();\n\n\n\n let mut state = get_state::<MainnetEthSpec>(validator_count);\n\n state.build_all_caches(spec).expect(\"should build caches\");\n\n let state_bytes = state.as_ssz_bytes();\n\n\n\n let inner_state = state.clone();\n\n c.bench(\n\n &format!(\"{}_validators\", validator_count),\n\n Benchmark::new(\"encode/beacon_state\", move |b| {\n\n b.iter_batched_ref(\n\n || inner_state.clone(),\n\n |state| black_box(state.as_ssz_bytes()),\n\n criterion::BatchSize::SmallInput,\n\n )\n\n })\n\n .sample_size(10),\n\n );\n","file_path":"consensus/types/benches/benches.rs","rank":74,"score":225661.80730044126},{"content":"fn unwrap_err<T, E>(result: Result<T, E>) -> E {\n\n match result {\n\n Ok(_) => panic!(\"called unwrap_err on Ok\"),\n\n Err(e) => e,\n\n }\n\n}\n\n\n","file_path":"beacon_node/beacon_chain/tests/block_verification.rs","rank":75,"score":225222.78928538598},{"content":"// A bit of hack to find an unused port.\n\n///\n\n/// Does not guarantee that the given port is unused after the function exists, just that it was\n\n/// unused before the function started (i.e., it does not reserve a port).\n\npub fn unused_port(transport: &str) -> Result<u16, String> {\n\n let local_addr = match transport {\n\n \"tcp\" => {\n\n let listener = TcpListener::bind(\"127.0.0.1:0\").map_err(|e| {\n\n format!(\"Failed to create TCP listener to find unused port: {:?}\", e)\n\n })?;\n\n listener.local_addr().map_err(|e| {\n\n format!(\n\n \"Failed to read TCP listener local_addr to find unused port: {:?}\",\n\n e\n\n )\n\n })?\n\n }\n\n \"udp\" => {\n\n let socket = UdpSocket::bind(\"127.0.0.1:0\")\n\n .map_err(|e| format!(\"Failed to create UDP socket to find unused port: {:?}\", e))?;\n\n socket.local_addr().map_err(|e| {\n\n format!(\n\n \"Failed to read UDP socket local_addr to find unused port: {:?}\",\n\n e\n\n )\n\n })?\n\n }\n\n _ => return Err(\"Invalid transport to find unused port\".into()),\n\n };\n\n Ok(local_addr.port())\n\n}\n\n\n","file_path":"beacon_node/eth2_libp2p/tests/common/mod.rs","rank":76,"score":224552.1411596595},{"content":"pub fn check_serialization<T: SszStaticType>(value: &T, serialized: &[u8]) -> Result<(), Error> {\n\n // Check serialization\n\n let serialized_result = value.as_ssz_bytes();\n\n compare_result::<usize, Error>(&Ok(value.ssz_bytes_len()), &Some(serialized.len()))?;\n\n compare_result::<Vec<u8>, Error>(&Ok(serialized_result), &Some(serialized.to_vec()))?;\n\n\n\n // Check deserialization\n\n let deserialized_result = T::from_ssz_bytes(serialized);\n\n compare_result(&deserialized_result, &Some(value.clone()))?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"testing/ef_tests/src/cases/ssz_static.rs","rank":77,"score":224520.2948684793},{"content":"/// Returns a beacon chain harness.\n\nfn get_harness(validator_count: usize) -> BeaconChainHarness<EphemeralHarnessType<E>> {\n\n let harness = BeaconChainHarness::new_with_target_aggregators(\n\n MainnetEthSpec,\n\n KEYPAIRS[0..validator_count].to_vec(),\n\n // A kind-of arbitrary number that ensures that _some_ validators are aggregators, but\n\n // not all.\n\n 4,\n\n StoreConfig::default(),\n\n );\n\n\n\n harness.advance_slot();\n\n\n\n harness\n\n}\n\n\n","file_path":"beacon_node/beacon_chain/tests/attestation_verification.rs","rank":78,"score":222404.17398378815},{"content":"fn get_harness(validator_count: usize) -> BeaconChainHarness<EphemeralHarnessType<E>> {\n\n let harness = BeaconChainHarness::new_with_store_config(\n\n MainnetEthSpec,\n\n KEYPAIRS[0..validator_count].to_vec(),\n\n StoreConfig::default(),\n\n );\n\n\n\n harness.advance_slot();\n\n\n\n harness\n\n}\n\n\n","file_path":"beacon_node/beacon_chain/tests/block_verification.rs","rank":79,"score":222404.17398378812},{"content":"/// Writes a list of `vectors` to the `title` dir.\n\nfn write_vectors_to_file(title: &str, vectors: &[TestVector]) -> Result<(), String> {\n\n let dir = env::var(\"CARGO_MANIFEST_DIR\")\n\n .map_err(|e| format!(\"Unable to find manifest dir: {:?}\", e))?\n\n .parse::<PathBuf>()\n\n .map_err(|e| format!(\"Unable to parse manifest dir: {:?}\", e))?\n\n .join(BASE_VECTOR_DIR)\n\n .join(title);\n\n\n\n if dir.exists() {\n\n fs::remove_dir_all(&dir).map_err(|e| format!(\"Unable to remove {:?}: {:?}\", dir, e))?;\n\n }\n\n fs::create_dir_all(&dir).map_err(|e| format!(\"Unable to create {:?}: {:?}\", dir, e))?;\n\n\n\n for vector in vectors {\n\n let dir = dir.clone().join(&vector.title);\n\n if dir.exists() {\n\n fs::remove_dir_all(&dir).map_err(|e| format!(\"Unable to remove {:?}: {:?}\", dir, e))?;\n\n }\n\n fs::create_dir_all(&dir).map_err(|e| format!(\"Unable to create {:?}: {:?}\", dir, e))?;\n\n\n","file_path":"testing/state_transition_vectors/src/main.rs","rank":80,"score":221861.2736875224},{"content":"fn test_scenario<T: EthSpec, F, G>(mutate_builder: F, mut invalidate_block: G, spec: &ChainSpec)\n\nwhere\n\n T: EthSpec,\n\n F: FnMut(&mut BlockBuilder<T>),\n\n G: FnMut(&mut SignedBeaconBlock<T>),\n\n{\n\n let (mut block, mut state) = get_block::<T, _>(mutate_builder);\n\n\n\n /*\n\n * Control check to ensure the valid block should pass verification.\n\n */\n\n\n\n assert_eq!(\n\n per_block_processing(\n\n &mut state.clone(),\n\n &block,\n\n None,\n\n BlockSignatureStrategy::VerifyIndividual,\n\n spec\n\n ),\n","file_path":"consensus/state_processing/tests/tests.rs","rank":81,"score":218096.670977519},{"content":"fn do_round(seed: &[u8], index: usize, pivot: usize, round: u8, list_size: usize) -> Option<usize> {\n\n let flip = (pivot + (list_size - index)) % list_size;\n\n let position = max(index, flip);\n\n let source = hash_with_round_and_position(seed, round, position);\n\n let byte = source[(position % 256) / 8];\n\n let bit = (byte >> (position % 8)) % 2;\n\n Some(if bit == 1 { flip } else { index })\n\n}\n\n\n","file_path":"consensus/swap_or_not_shuffle/src/compute_shuffled_index.rs","rank":82,"score":217937.25936256032},{"content":"/// Loads a list of keypairs from file.\n\npub fn load_keypairs_from_yaml(path: PathBuf) -> Result<Vec<Keypair>, String> {\n\n keypairs_from_yaml_file(path)\n\n}\n","file_path":"consensus/types/src/test_utils/generate_deterministic_keypairs.rs","rank":83,"score":216969.0008618427},{"content":"pub fn u64_leaf_count(len: usize) -> usize {\n\n let type_size = size_of::<u64>();\n\n let vals_per_chunk = BYTES_PER_CHUNK / type_size;\n\n\n\n (len + vals_per_chunk - 1) / vals_per_chunk\n\n}\n\n\n","file_path":"consensus/cached_tree_hash/src/impls.rs","rank":84,"score":216852.93125966343},{"content":"pub fn hash256_leaf_count(len: usize) -> usize {\n\n len\n\n}\n\n\n","file_path":"consensus/cached_tree_hash/src/impls.rs","rank":85,"score":216852.93125966343},{"content":"fn get_state<E: EthSpec>(validator_count: usize) -> BeaconState<E> {\n\n let spec = &E::default_spec();\n\n let eth1_data = Eth1Data {\n\n deposit_root: Hash256::zero(),\n\n deposit_count: 0,\n\n block_hash: Hash256::zero(),\n\n };\n\n\n\n let mut state = BeaconState::new(0, eth1_data, spec);\n\n\n\n for i in 0..validator_count {\n\n state.balances.push(i as u64).expect(\"should add balance\");\n\n }\n\n\n\n state.validators = (0..validator_count)\n\n .collect::<Vec<_>>()\n\n .par_iter()\n\n .map(|&i| Validator {\n\n pubkey: generate_deterministic_keypair(i).pk.into(),\n\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\n","file_path":"beacon_node/store/benches/benches.rs","rank":86,"score":213945.07175198797},{"content":"pub fn parse_u64(matches: &ArgMatches, name: &'static str) -> Result<u64, String> {\n\n matches\n\n .value_of(name)\n\n .ok_or_else(|| format!(\"{} not specified\", name))?\n\n .parse::<u64>()\n\n .map_err(|e| format!(\"Unable to parse {}: {}\", name, e))\n\n}\n\n\n","file_path":"lcli/src/helpers.rs","rank":87,"score":213167.60630401192},{"content":"pub fn parse_address(matches: &ArgMatches, name: &'static str) -> Result<Address, String> {\n\n matches\n\n .value_of(name)\n\n .ok_or_else(|| format!(\"{} not specified\", name))\n\n .and_then(|val| {\n\n if val.starts_with(\"0x\") {\n\n val[2..]\n\n .parse()\n\n .map_err(|e| format!(\"Unable to parse {}: {:?}\", name, e))\n\n } else {\n\n Err(format!(\"Unable to parse {}, must have 0x prefix\", name))\n\n }\n\n })\n\n}\n\n\n","file_path":"lcli/src/helpers.rs","rank":88,"score":213167.60630401192},{"content":"/// According to unicode, every byte that starts with 0b10xxxxxx continues encoding of character\n\n/// Therefore the number of characters equals number of bytes minus number of 0b10xxxxxx bytes\n\nfn count_unicode_characters(bits: &[u8]) -> usize {\n\n bits.iter().filter(|bit| *bit >> 6 != 2).count()\n\n}\n\n\n","file_path":"common/account_utils/src/lib.rs","rank":89,"score":211596.67335140437},{"content":"/// Returns `false` for a timestamp that would result in a genesis time that is earlier than\n\n/// `MIN_GENESIS_TIME`.\n\nfn timestamp_can_trigger_genesis(timestamp: u64, spec: &ChainSpec) -> Result<bool, String> {\n\n eth2_genesis_time(timestamp, spec)\n\n .map(|t| t >= spec.min_genesis_time)\n\n .map_err(|e| format!(\"Arith error when during genesis calculation: {:?}\", e))\n\n}\n","file_path":"beacon_node/genesis/src/eth1_genesis_service.rs","rank":90,"score":210478.5803625136},{"content":"fn hash_with_round_and_position(seed: &[u8], round: u8, position: usize) -> Hash256 {\n\n let mut context = Context::new(&SHA256);\n\n\n\n context.update(seed);\n\n context.update(&[round]);\n\n /*\n\n * Note: the specification has an implicit assertion in `int_to_bytes4` that `position / 256 <\n\n * 2**24`. For efficiency, we do not check for that here as it is checked in `compute_shuffled_index`.\n\n */\n\n context.update(&(position / 256).to_le_bytes()[0..4]);\n\n\n\n let digest = context.finish();\n\n Hash256::from_slice(digest.as_ref())\n\n}\n\n\n","file_path":"consensus/swap_or_not_shuffle/src/compute_shuffled_index.rs","rank":91,"score":209103.37545549657},{"content":"/// Returns true if some field has an attribute declaring it should not be serialized.\n\n///\n\n/// The field attribute is: `#[ssz(skip_serializing)]`\n\nfn should_skip_serializing(field: &syn::Field) -> bool {\n\n field.attrs.iter().any(|attr| {\n\n attr.path.is_ident(\"ssz\")\n\n && attr.tokens.to_string().replace(\" \", \"\") == \"(skip_serializing)\"\n\n })\n\n}\n\n\n\n/// Implements `ssz::Encode` for some `struct`.\n\n///\n\n/// Fields are encoded in the order they are defined.\n\n///\n\n/// ## Field attributes\n\n///\n\n/// - `#[ssz(skip_serializing)]`: the field will not be serialized.\n","file_path":"consensus/ssz_derive/src/lib.rs","rank":92,"score":208475.0808852706},{"content":"/// Interprets `bytes` as a big-endian integer and returns that integer modulo the order of the\n\n/// BLS-381 curve.\n\n///\n\n/// This function is a part of the `HKDF_mod_r` function in EIP-2333.\n\nfn mod_r(bytes: &[u8]) -> ZeroizeHash {\n\n let n = BigUint::from_bytes_be(bytes);\n\n let r = BigUint::parse_bytes(R.as_bytes(), 10).expect(\"must be able to parse R\");\n\n let x = SecretBytes::from((n % r).to_bytes_be());\n\n\n\n let x_slice = x.as_bytes();\n\n\n\n debug_assert!(x_slice.len() <= HASH_SIZE);\n\n\n\n let mut output = ZeroizeHash::zero();\n\n output.as_mut_bytes()[HASH_SIZE - x_slice.len()..].copy_from_slice(&x_slice);\n\n output\n\n}\n\n\n","file_path":"crypto/eth2_key_derivation/src/derived_key.rs","rank":93,"score":208383.59890618623},{"content":"fn bytes_to_int64(slice: &[u8]) -> u64 {\n\n let mut bytes = [0; 8];\n\n bytes.copy_from_slice(&slice[0..8]);\n\n u64::from_le_bytes(bytes)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use ethereum_types::H256 as Hash256;\n\n\n\n #[test]\n\n #[ignore]\n\n fn fuzz_test() {\n\n let max_list_size = 2_usize.pow(24);\n\n let test_runs = 1000;\n\n\n\n // Test at max list_size with the end index.\n\n for _ in 0..test_runs {\n\n let index = max_list_size - 1;\n","file_path":"consensus/swap_or_not_shuffle/src/compute_shuffled_index.rs","rank":94,"score":208377.95030471613},{"content":"/// Returns the peer count, returning something helpful if it's `usize::max_value` (effectively a\n\n/// `None` value).\n\nfn peer_count_pretty(peer_count: usize) -> String {\n\n if peer_count == usize::max_value() {\n\n String::from(\"--\")\n\n } else {\n\n format!(\"{}\", peer_count)\n\n }\n\n}\n\n\n","file_path":"beacon_node/client/src/notifier.rs","rank":95,"score":208286.6356210762},{"content":"/// Returns the value of `name` or an error if it is not in `matches` or does not parse\n\n/// successfully using `std::string::FromStr`.\n\npub fn parse_required<T>(matches: &ArgMatches, name: &str) -> Result<T, String>\n\nwhere\n\n T: FromStr,\n\n <T as FromStr>::Err: std::fmt::Display,\n\n{\n\n parse_optional(matches, name)?.ok_or_else(|| format!(\"{} not specified\", name))\n\n}\n\n\n","file_path":"common/clap_utils/src/lib.rs","rank":96,"score":207917.93992575584},{"content":"/// Ensure that the directory at `path` exists, by creating it and all parents if necessary.\n\nfn ensure_dir_exists(path: PathBuf) -> Result<PathBuf, String> {\n\n fs::create_dir_all(&path).map_err(|e| format!(\"Unable to create {}: {}\", path.display(), e))?;\n\n Ok(path)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use toml;\n\n\n\n #[test]\n\n fn serde() {\n\n let config = Config::default();\n\n let serialized = toml::to_string(&config).expect(\"should serde encode default config\");\n\n toml::from_str::<Config>(&serialized).expect(\"should serde decode default config\");\n\n }\n\n}\n","file_path":"beacon_node/client/src/config.rs","rank":97,"score":207680.7636775071},{"content":"// Check that the config from the Eth2.0 spec tests matches our minimal/mainnet config.\n\nfn config_test<E: EthSpec + TypeName>() {\n\n let config_path = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"))\n\n .join(\"eth2.0-spec-tests\")\n\n .join(\"tests\")\n\n .join(E::name())\n\n .join(\"config\")\n\n .join(\"phase0.yaml\");\n\n let yaml_config = YamlConfig::from_file(&config_path).expect(\"config file loads OK\");\n\n let spec = E::default_spec();\n\n let yaml_from_spec = YamlConfig::from_spec::<E>(&spec);\n\n assert_eq!(yaml_config.apply_to_chain_spec::<E>(&spec), Some(spec));\n\n assert_eq!(yaml_from_spec, yaml_config);\n\n}\n\n\n","file_path":"testing/ef_tests/tests/tests.rs","rank":98,"score":207659.72885339306},{"content":"fn shuffle_list(seed: &[u8], list_size: usize) -> Vec<usize> {\n\n let mut output = Vec::with_capacity(list_size);\n\n for i in 0..list_size {\n\n output.push(compute_shuffled_index(i, list_size, seed, SHUFFLE_ROUND_COUNT).unwrap());\n\n }\n\n output\n\n}\n\n\n","file_path":"consensus/swap_or_not_shuffle/benches/benches.rs","rank":99,"score":207570.6238007163}],"string":"[\n {\n \"content\": \"fn string_to_bytes(string: &str) -> Result<Vec<u8>, String> {\\n\\n let string = if string.starts_with(\\\"0x\\\") {\\n\\n &string[2..]\\n\\n } else {\\n\\n string\\n\\n };\\n\\n\\n\\n hex::decode(string).map_err(|e| format!(\\\"Unable to decode public or private key: {}\\\", e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/eth2_interop_keypairs/src/lib.rs\",\n \"rank\": 0,\n \"score\": 384622.70823354705\n },\n {\n \"content\": \"// An alternative to `hex::decode`, to allow for more control of\\n\\n// the objects created while decoding the secret key.\\n\\nfn hex_string_to_bytes(data: &str) -> Result<Vec<u8>, String> {\\n\\n if data.len() % 2 != 0 {\\n\\n return Err(\\\"Odd length\\\".to_string());\\n\\n }\\n\\n\\n\\n let mut vec: Vec<u8> = Vec::new();\\n\\n for i in 0..data.len() / 2 {\\n\\n vec.push(\\n\\n val(&data.as_bytes()[2 * i], 2 * i)? << 4\\n\\n | val(&data.as_bytes()[2 * i + 1], 2 * i + 1)?,\\n\\n );\\n\\n }\\n\\n\\n\\n Ok(vec)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"remote_signer/backend/src/zeroize_string.rs\",\n \"rank\": 1,\n \"score\": 368367.77421637444\n },\n {\n \"content\": \"/// Parses a `0x`-prefixed, big-endian hex string as bytes.\\n\\n///\\n\\n/// E.g., `0x0102 == vec![1, 2]`\\n\\nfn hex_to_bytes(hex: &str) -> Result<Vec<u8>, String> {\\n\\n hex::decode(strip_prefix(hex)?).map_err(|e| format!(\\\"Failed to parse hex as bytes: {:?}\\\", e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/eth1/src/http.rs\",\n \"rank\": 2,\n \"score\": 355737.6334991586\n },\n {\n \"content\": \"fn process_slice_field(new_tree_hash: &[u8], leaf: &mut Hash256, force_update: bool) -> bool {\\n\\n if force_update || leaf.as_bytes() != new_tree_hash {\\n\\n leaf.assign_from_slice(&new_tree_hash);\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/types/src/tree_hash_impls.rs\",\n \"rank\": 3,\n \"score\": 341906.70715965296\n },\n {\n \"content\": \"fn verify_checksum(bytes: &[u8], expected_checksum: &str) {\\n\\n let mut hasher = Sha256::new();\\n\\n hasher.update(bytes);\\n\\n let result = hasher.finalize();\\n\\n\\n\\n let checksum = hex::encode(&result[..]);\\n\\n\\n\\n assert_eq!(\\n\\n &checksum, expected_checksum,\\n\\n \\\"Checksum {} did not match {}\\\",\\n\\n checksum, expected_checksum\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/deposit_contract/build.rs\",\n \"rank\": 4,\n \"score\": 341368.01582740387\n },\n {\n \"content\": \"/// Encode `len` as a little-endian byte array of `BYTES_PER_LENGTH_OFFSET` length.\\n\\n///\\n\\n/// If `len` is larger than `2 ^ BYTES_PER_LENGTH_OFFSET`, a `debug_assert` is raised.\\n\\npub fn encode_length(len: usize) -> [u8; BYTES_PER_LENGTH_OFFSET] {\\n\\n // Note: it is possible for `len` to be larger than what can be encoded in\\n\\n // `BYTES_PER_LENGTH_OFFSET` bytes, triggering this debug assertion.\\n\\n //\\n\\n // These are the alternatives to using a `debug_assert` here:\\n\\n //\\n\\n // 1. Use `assert`.\\n\\n // 2. Push an error to the caller (e.g., `Option` or `Result`).\\n\\n // 3. Ignore it completely.\\n\\n //\\n\\n // I have avoided (1) because it's basically a choice between \\\"produce invalid SSZ\\\" or \\\"kill\\n\\n // the entire program\\\". I figure it may be possible for an attacker to trigger this assert and\\n\\n // take the program down -- I think producing invalid SSZ is a better option than this.\\n\\n //\\n\\n // I have avoided (2) because this error will need to be propagated upstream, making encoding a\\n\\n // function which may fail. I don't think this is ergonomic and the upsides don't outweigh the\\n\\n // downsides.\\n\\n //\\n\\n // I figure a `debug_assertion` is better than (3) as it will give us a change to detect the\\n\\n // error during testing.\\n\",\n \"file_path\": \"consensus/ssz/src/encode.rs\",\n \"rank\": 5,\n \"score\": 321329.87696129415\n },\n {\n \"content\": \"pub fn parse_hex_bytes(matches: &ArgMatches, name: &'static str) -> Result<Vec<u8>, String> {\\n\\n matches\\n\\n .value_of(name)\\n\\n .ok_or_else(|| format!(\\\"{} not specified\\\", name))\\n\\n .and_then(|val| {\\n\\n if val.starts_with(\\\"0x\\\") {\\n\\n hex::decode(&val[2..]).map_err(|e| format!(\\\"Unable to parse {}: {:?}\\\", name, e))\\n\\n } else {\\n\\n Err(format!(\\\"Unable to parse {}, must have 0x prefix\\\", name))\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"lcli/src/helpers.rs\",\n \"rank\": 6,\n \"score\": 317464.31009794853\n },\n {\n \"content\": \"fn decode_and_print<T: Decode + Serialize>(bytes: &[u8]) -> Result<(), String> {\\n\\n let item = T::from_ssz_bytes(&bytes).map_err(|e| format!(\\\"Ssz decode failed: {:?}\\\", e))?;\\n\\n\\n\\n println!(\\n\\n \\\"{}\\\",\\n\\n serde_yaml::to_string(&item)\\n\\n .map_err(|e| format!(\\\"Unable to write object to YAML: {:?}\\\", e))?\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"lcli/src/parse_hex.rs\",\n \"rank\": 7,\n \"score\": 317081.3847591422\n },\n {\n \"content\": \"fn decode_and_print<T: Decode + Serialize>(bytes: &[u8]) -> Result<(), String> {\\n\\n let item = T::from_ssz_bytes(&bytes).map_err(|e| format!(\\\"Ssz decode failed: {:?}\\\", e))?;\\n\\n\\n\\n println!(\\n\\n \\\"{}\\\",\\n\\n serde_yaml::to_string(&item)\\n\\n .map_err(|e| format!(\\\"Unable to write object to YAML: {:?}\\\", e))?\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"lcli/src/parse_ssz.rs\",\n \"rank\": 8,\n \"score\": 317081.3847591422\n },\n {\n \"content\": \"// Auxiliar function for `hex_string_to_bytes`.\\n\\nfn val(c: &u8, idx: usize) -> Result<u8, String> {\\n\\n match c {\\n\\n b'A'..=b'F' => Ok(c - b'A' + 10),\\n\\n b'a'..=b'f' => Ok(c - b'a' + 10),\\n\\n b'0'..=b'9' => Ok(c - b'0'),\\n\\n _ => Err(format!(\\n\\n \\\"Invalid hex character: {} at index {}\\\",\\n\\n *c as char, idx\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod object {\\n\\n use super::*;\\n\\n use helpers::*;\\n\\n use zeroize::Zeroize;\\n\\n\\n\\n #[test]\\n\\n fn v_u8_zeroized() {\\n\",\n \"file_path\": \"remote_signer/backend/src/zeroize_string.rs\",\n \"rank\": 9,\n \"score\": 312626.2231844065\n },\n {\n \"content\": \"/// Decode `data` from a 0x-prefixed hex string.\\n\\npub fn decode(s: &str) -> Result<Vec<u8>, String> {\\n\\n if s.starts_with(\\\"0x\\\") {\\n\\n hex::decode(&s[2..]).map_err(|e| format!(\\\"invalid hex: {:?}\\\", e))\\n\\n } else {\\n\\n Err(\\\"hex must have 0x prefix\\\".to_string())\\n\\n }\\n\\n}\\n\\n\\n\\npub struct PrefixedHexVisitor;\\n\\n\\n\\nimpl<'de> Visitor<'de> for PrefixedHexVisitor {\\n\\n type Value = Vec<u8>;\\n\\n\\n\\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\\n\\n formatter.write_str(\\\"a hex string with 0x prefix\\\")\\n\\n }\\n\\n\\n\\n fn visit_str<E>(self, value: &str) -> Result<Self::Value, E>\\n\\n where\\n\\n E: de::Error,\\n\",\n \"file_path\": \"consensus/serde_utils/src/hex.rs\",\n \"rank\": 10,\n \"score\": 308677.18197656627\n },\n {\n \"content\": \"fn process_bool_field(val: bool, leaf: &mut Hash256, force_update: bool) -> bool {\\n\\n process_u64_field(val as u64, leaf, force_update)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use crate::test_utils::TestRandom;\\n\\n use crate::Epoch;\\n\\n use rand::SeedableRng;\\n\\n use rand_xorshift::XorShiftRng;\\n\\n use tree_hash::TreeHash;\\n\\n\\n\\n fn test_validator_tree_hash(v: &Validator) {\\n\\n let arena = &mut CacheArena::default();\\n\\n\\n\\n let mut cache = v.new_tree_hash_cache(arena);\\n\\n // With a fresh cache\\n\\n assert_eq!(\\n\\n &v.tree_hash_root()[..],\\n\",\n \"file_path\": \"consensus/types/src/tree_hash_impls.rs\",\n \"rank\": 11,\n \"score\": 296001.19389578927\n },\n {\n \"content\": \"/// Remove any number of newline or carriage returns from the end of a vector of bytes.\\n\\npub fn strip_off_newlines(mut bytes: Vec<u8>) -> Vec<u8> {\\n\\n let mut strip_off = 0;\\n\\n for (i, byte) in bytes.iter().rev().enumerate() {\\n\\n if *byte == b'\\\\n' || *byte == b'\\\\r' {\\n\\n strip_off = i + 1;\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n }\\n\\n bytes.truncate(bytes.len() - strip_off);\\n\\n bytes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 12,\n \"score\": 294641.1506125736\n },\n {\n \"content\": \"fn decompress_snappy(data: &[u8]) -> Result<Vec<u8>, String> {\\n\\n // Exit early if uncompressed data is > GOSSIP_MAX_SIZE\\n\\n match decompress_len(data) {\\n\\n Ok(n) if n > GOSSIP_MAX_SIZE => {\\n\\n return Err(\\\"ssz_snappy decoded data > GOSSIP_MAX_SIZE\\\".into());\\n\\n }\\n\\n Ok(_) => {}\\n\\n Err(e) => {\\n\\n return Err(format!(\\\"{}\\\", e));\\n\\n }\\n\\n };\\n\\n let mut decoder = Decoder::new();\\n\\n match decoder.decompress_vec(data) {\\n\\n Ok(decompressed_data) => Ok(decompressed_data),\\n\\n Err(e) => Err(format!(\\\"{}\\\", e)),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: EthSpec> PubsubMessage<T> {\\n\\n /// Returns the topics that each pubsub message will be sent across, given a supported\\n\",\n \"file_path\": \"beacon_node/eth2_libp2p/src/types/pubsub.rs\",\n \"rank\": 13,\n \"score\": 294074.70629386173\n },\n {\n \"content\": \"/// Returns the minimum required bytes to represent a given number of bits.\\n\\n///\\n\\n/// `bit_len == 0` requires a single byte.\\n\\nfn bytes_for_bit_len(bit_len: usize) -> usize {\\n\\n std::cmp::max(1, (bit_len + 7) / 8)\\n\\n}\\n\\n\\n\\n/// An iterator over the bits in a `Bitfield`.\\n\\npub struct BitIter<'a, T> {\\n\\n bitfield: &'a Bitfield<T>,\\n\\n i: usize,\\n\\n}\\n\\n\\n\\nimpl<'a, T: BitfieldBehaviour> Iterator for BitIter<'a, T> {\\n\\n type Item = bool;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let res = self.bitfield.get(self.i).ok()?;\\n\\n self.i += 1;\\n\\n Some(res)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/ssz_types/src/bitfield.rs\",\n \"rank\": 14,\n \"score\": 289889.2614029598\n },\n {\n \"content\": \"pub fn cli_run<E: EthSpec>(matches: &ArgMatches, mut env: Environment<E>) -> Result<(), String> {\\n\\n let keystore_path: PathBuf = clap_utils::parse_required(matches, KEYSTORE_FLAG)?;\\n\\n let password_file_path: Option<PathBuf> =\\n\\n clap_utils::parse_optional(matches, PASSWORD_FILE_FLAG)?;\\n\\n let stdin_inputs = matches.is_present(STDIN_INPUTS_FLAG);\\n\\n\\n\\n let spec = env.eth2_config().spec.clone();\\n\\n let server_url: String = clap_utils::parse_required(matches, BEACON_SERVER_FLAG)?;\\n\\n let client = BeaconNodeHttpClient::new(\\n\\n Url::parse(&server_url)\\n\\n .map_err(|e| format!(\\\"Failed to parse beacon http server: {:?}\\\", e))?,\\n\\n );\\n\\n\\n\\n let testnet_config = env\\n\\n .testnet\\n\\n .clone()\\n\\n .expect(\\\"network should have a valid config\\\");\\n\\n\\n\\n env.runtime().block_on(publish_voluntary_exit::<E>(\\n\\n &keystore_path,\\n\",\n \"file_path\": \"account_manager/src/validator/exit.rs\",\n \"rank\": 15,\n \"score\": 289233.6076773606\n },\n {\n \"content\": \"pub fn serialize<S>(bytes: &[u8; BYTES_LEN], serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n{\\n\\n let mut hex_string: String = \\\"0x\\\".to_string();\\n\\n hex_string.push_str(&hex::encode(&bytes));\\n\\n\\n\\n serializer.serialize_str(&hex_string)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/serde_utils/src/bytes_4_hex.rs\",\n \"rank\": 16,\n \"score\": 281875.8677427227\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn keypair_from_bytes(mut bytes: Vec<u8>) -> error::Result<Keypair> {\\n\\n libp2p::core::identity::secp256k1::SecretKey::from_bytes(&mut bytes)\\n\\n .map(|secret| {\\n\\n let keypair: libp2p::core::identity::secp256k1::Keypair = secret.into();\\n\\n Keypair::Secp256k1(keypair)\\n\\n })\\n\\n .map_err(|e| format!(\\\"Unable to parse p2p secret key: {:?}\\\", e).into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/eth2_libp2p/src/service.rs\",\n \"rank\": 17,\n \"score\": 279040.56666975986\n },\n {\n \"content\": \"fn process_epoch_field(val: Epoch, leaf: &mut Hash256, force_update: bool) -> bool {\\n\\n process_u64_field(val.as_u64(), leaf, force_update)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/types/src/tree_hash_impls.rs\",\n \"rank\": 18,\n \"score\": 277044.46134780266\n },\n {\n \"content\": \"fn process_u64_field(val: u64, leaf: &mut Hash256, force_update: bool) -> bool {\\n\\n let new_tree_hash = int_to_fixed_bytes32(val);\\n\\n process_slice_field(&new_tree_hash[..], leaf, force_update)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/types/src/tree_hash_impls.rs\",\n \"rank\": 19,\n \"score\": 277044.46134780266\n },\n {\n \"content\": \"pub fn parse_fork_opt(matches: &ArgMatches, name: &'static str) -> Result<Option<[u8; 4]>, String> {\\n\\n matches\\n\\n .value_of(name)\\n\\n .map(|val| {\\n\\n if val.starts_with(\\\"0x\\\") {\\n\\n let vec = hex::decode(&val[2..])\\n\\n .map_err(|e| format!(\\\"Unable to parse {} as hex: {:?}\\\", name, e))?;\\n\\n\\n\\n if vec.len() != 4 {\\n\\n Err(format!(\\\"{} must be exactly 4 bytes\\\", name))\\n\\n } else {\\n\\n let mut arr = [0; 4];\\n\\n arr.copy_from_slice(&vec);\\n\\n Ok(arr)\\n\\n }\\n\\n } else {\\n\\n Err(format!(\\\"Unable to parse {}, must have 0x prefix\\\", name))\\n\\n }\\n\\n })\\n\\n .transpose()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lcli/src/helpers.rs\",\n \"rank\": 20,\n \"score\": 271593.72681256116\n },\n {\n \"content\": \"pub fn serialize<S>(byte: &u8, serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n{\\n\\n let hex = format!(\\\"0x{}\\\", hex::encode([*byte]));\\n\\n serializer.serialize_str(&hex)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/serde_utils/src/u8_hex.rs\",\n \"rank\": 21,\n \"score\": 270594.576140019\n },\n {\n \"content\": \"/// Write some bytes to file.\\n\\nfn write_to_file(path: &PathBuf, item: &[u8]) -> Result<(), String> {\\n\\n File::create(path)\\n\\n .map_err(|e| format!(\\\"Unable to create {:?}: {:?}\\\", path, e))\\n\\n .and_then(|mut file| {\\n\\n file.write_all(item)\\n\\n .map(|_| ())\\n\\n .map_err(|e| format!(\\\"Unable to write to {:?}: {:?}\\\", path, e))\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"testing/state_transition_vectors/src/main.rs\",\n \"rank\": 22,\n \"score\": 268047.2226188901\n },\n {\n \"content\": \"pub fn check_tree_hash(expected_str: &str, actual_root: &[u8]) -> Result<(), Error> {\\n\\n let expected_root = hex::decode(&expected_str[2..])\\n\\n .map_err(|e| Error::FailedToParseTest(format!(\\\"{:?}\\\", e)))?;\\n\\n let expected_root = Hash256::from_slice(&expected_root);\\n\\n let tree_hash_root = Hash256::from_slice(actual_root);\\n\\n compare_result::<Hash256, Error>(&Ok(tree_hash_root), &Some(expected_root))\\n\\n}\\n\\n\\n\\nimpl<T: SszStaticType> Case for SszStatic<T> {\\n\\n fn result(&self, _case_index: usize) -> Result<(), Error> {\\n\\n check_serialization(&self.value, &self.serialized)?;\\n\\n check_tree_hash(&self.roots.root, self.value.tree_hash_root().as_bytes())?;\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: SszStaticType + CachedTreeHash<C>, C: Debug + Sync> Case for SszStaticTHC<T, C> {\\n\\n fn result(&self, _case_index: usize) -> Result<(), Error> {\\n\\n check_serialization(&self.value, &self.serialized)?;\\n\\n check_tree_hash(&self.roots.root, self.value.tree_hash_root().as_bytes())?;\\n\",\n \"file_path\": \"testing/ef_tests/src/cases/ssz_static.rs\",\n \"rank\": 23,\n \"score\": 265691.26159876026\n },\n {\n \"content\": \"/// Removes the `0x` prefix from some bytes. Returns an error if the prefix is not present.\\n\\nfn strip_prefix(hex: &str) -> Result<&str, String> {\\n\\n if hex.starts_with(\\\"0x\\\") {\\n\\n Ok(&hex[2..])\\n\\n } else {\\n\\n Err(\\\"Hex string did not start with `0x`\\\".to_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"beacon_node/eth1/src/http.rs\",\n \"rank\": 24,\n \"score\": 263963.9122845484\n },\n {\n \"content\": \"fn get_state<E: EthSpec>(validator_count: usize) -> BeaconState<E> {\\n\\n let spec = &E::default_spec();\\n\\n let eth1_data = Eth1Data {\\n\\n deposit_root: Hash256::zero(),\\n\\n deposit_count: 0,\\n\\n block_hash: Hash256::zero(),\\n\\n };\\n\\n\\n\\n let mut state = BeaconState::new(0, eth1_data, spec);\\n\\n\\n\\n for i in 0..validator_count {\\n\\n state.balances.push(i as u64).expect(\\\"should add balance\\\");\\n\\n }\\n\\n\\n\\n state.validators = (0..validator_count)\\n\\n .collect::<Vec<_>>()\\n\\n .par_iter()\\n\\n .map(|&i| Validator {\\n\\n pubkey: generate_deterministic_keypair(i).pk.into(),\\n\\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\\n\",\n \"file_path\": \"consensus/types/benches/benches.rs\",\n \"rank\": 25,\n \"score\": 259578.37740688177\n },\n {\n \"content\": \"fn trim_newline(s: &mut String) {\\n\\n if s.ends_with('\\\\n') {\\n\\n s.pop();\\n\\n if s.ends_with('\\\\r') {\\n\\n s.pop();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 26,\n \"score\": 258555.74691030098\n },\n {\n \"content\": \"/// Decrease the balance of a validator, saturating upon overflow, as per the spec.\\n\\n///\\n\\n/// Spec v0.12.1\\n\\npub fn decrease_balance<E: EthSpec>(state: &mut BeaconState<E>, index: usize, delta: u64) {\\n\\n state.balances[index] = state.balances[index].saturating_sub(delta);\\n\\n}\\n\",\n \"file_path\": \"consensus/state_processing/src/common/mod.rs\",\n \"rank\": 27,\n \"score\": 258358.63664675466\n },\n {\n \"content\": \"/// Verify that `s` can be used as a CORS origin.\\n\\n///\\n\\n/// ## Notes\\n\\n///\\n\\n/// We need this function since `warp` will panic if provided an invalid origin. The verification\\n\\n/// code is taken from here:\\n\\n///\\n\\n/// https://github.com/seanmonstar/warp/blob/3d1760c6ca35ce2d03dee0562259d0320e9face3/src/filters/cors.rs#L616\\n\\n///\\n\\n/// Ideally we should make a PR to `warp` to expose this behaviour, however we defer this for a\\n\\n/// later time. The impact of a false-positive on this function is fairly limited, since only\\n\\n/// trusted users should be setting CORS origins.\\n\\nfn verify_cors_origin_str(s: &str) -> Result<(), String> {\\n\\n // Always the wildcard origin.\\n\\n if s == \\\"*\\\" {\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n let mut parts = s.splitn(2, \\\"://\\\");\\n\\n let scheme = parts\\n\\n .next()\\n\\n .ok_or_else(|| format!(\\\"{} is missing a scheme\\\", s))?;\\n\\n let rest = parts\\n\\n .next()\\n\\n .ok_or_else(|| format!(\\\"{} is missing the part following the scheme\\\", s))?;\\n\\n\\n\\n headers::Origin::try_from_parts(scheme, rest, None)\\n\\n .map_err(|e| format!(\\\"Unable to parse {}: {}\\\", s, e))\\n\\n .map(|_| ())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"common/warp_utils/src/cors.rs\",\n \"rank\": 28,\n \"score\": 257243.19671424403\n },\n {\n \"content\": \"pub fn parse_path(matches: &ArgMatches, name: &'static str) -> Result<PathBuf, String> {\\n\\n matches\\n\\n .value_of(name)\\n\\n .ok_or_else(|| format!(\\\"{} not specified\\\", name))?\\n\\n .parse::<PathBuf>()\\n\\n .map_err(|e| format!(\\\"Unable to parse {}: {}\\\", name, e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lcli/src/helpers.rs\",\n \"rank\": 29,\n \"score\": 253198.37936615312\n },\n {\n \"content\": \"fn build_node<E: EthSpec>(env: &mut Environment<E>) -> LocalBeaconNode<E> {\\n\\n let context = env.core_context();\\n\\n env.runtime()\\n\\n .block_on(LocalBeaconNode::production(\\n\\n context,\\n\\n testing_client_config(),\\n\\n ))\\n\\n .expect(\\\"should block until node created\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/tests/test.rs\",\n \"rank\": 30,\n \"score\": 252462.60258249886\n },\n {\n \"content\": \"/// Converts an integer represented as a string to a big-endian byte array.\\n\\nfn int_to_vec(int_str: &str) -> Vec<u8> {\\n\\n BigUint::parse_bytes(int_str.as_bytes(), 10)\\n\\n .expect(\\\"must be able to parse int\\\")\\n\\n .to_bytes_be()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crypto/eth2_key_derivation/tests/eip2333_vectors.rs\",\n \"rank\": 31,\n \"score\": 251634.3203670251\n },\n {\n \"content\": \"/// Reads a mnemonic phrase from TTY or stdin if `use_stdin == true`.\\n\\npub fn read_input_from_user(use_stdin: bool) -> Result<String, String> {\\n\\n let mut input = String::new();\\n\\n if use_stdin {\\n\\n io::stdin()\\n\\n .read_line(&mut input)\\n\\n .map_err(|e| format!(\\\"Error reading from stdin: {}\\\", e))?;\\n\\n } else {\\n\\n let tty = File::open(\\\"/dev/tty\\\").map_err(|e| format!(\\\"Error opening tty: {}\\\", e))?;\\n\\n let mut buf_reader = io::BufReader::new(tty);\\n\\n buf_reader\\n\\n .read_line(&mut input)\\n\\n .map_err(|e| format!(\\\"Error reading from tty: {}\\\", e))?;\\n\\n }\\n\\n trim_newline(&mut input);\\n\\n Ok(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 32,\n \"score\": 251315.0663217272\n },\n {\n \"content\": \"/// Decode bytes as a little-endian usize, returning an `Err` if `bytes.len() !=\\n\\n/// BYTES_PER_LENGTH_OFFSET`.\\n\\nfn decode_offset(bytes: &[u8]) -> Result<usize, DecodeError> {\\n\\n let len = bytes.len();\\n\\n let expected = BYTES_PER_LENGTH_OFFSET;\\n\\n\\n\\n if len != expected {\\n\\n Err(DecodeError::InvalidLengthPrefix { len, expected })\\n\\n } else {\\n\\n let mut array: [u8; BYTES_PER_LENGTH_OFFSET] = std::default::Default::default();\\n\\n array.clone_from_slice(bytes);\\n\\n\\n\\n Ok(u32::from_le_bytes(array) as usize)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"consensus/ssz/src/decode.rs\",\n \"rank\": 33,\n \"score\": 248289.28362365084\n },\n {\n \"content\": \"/// Reads a `BYTES_PER_LENGTH_OFFSET`-byte length from `bytes`, where `bytes.len() >=\\n\\n/// BYTES_PER_LENGTH_OFFSET`.\\n\\nfn read_offset(bytes: &[u8]) -> Result<usize, DecodeError> {\\n\\n decode_offset(bytes.get(0..BYTES_PER_LENGTH_OFFSET).ok_or_else(|| {\\n\\n DecodeError::InvalidLengthPrefix {\\n\\n len: bytes.len(),\\n\\n expected: BYTES_PER_LENGTH_OFFSET,\\n\\n }\\n\\n })?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/ssz/src/decode.rs\",\n \"rank\": 34,\n \"score\": 248277.96845306168\n },\n {\n \"content\": \"// helper function to identify clients from their agent_version. Returns the client\\n\\n// kind and it's associated version and the OS kind.\\n\\nfn client_from_agent_version(agent_version: &str) -> (ClientKind, String, String) {\\n\\n let mut agent_split = agent_version.split('/');\\n\\n match agent_split.next() {\\n\\n Some(\\\"Lighthouse\\\") => {\\n\\n let kind = ClientKind::Lighthouse;\\n\\n let mut version = String::from(\\\"unknown\\\");\\n\\n let mut os_version = version.clone();\\n\\n if let Some(agent_version) = agent_split.next() {\\n\\n version = agent_version.into();\\n\\n if let Some(agent_os_version) = agent_split.next() {\\n\\n os_version = agent_os_version.into();\\n\\n }\\n\\n }\\n\\n (kind, version, os_version)\\n\\n }\\n\\n Some(\\\"teku\\\") => {\\n\\n let kind = ClientKind::Teku;\\n\\n let mut version = String::from(\\\"unknown\\\");\\n\\n let mut os_version = version.clone();\\n\\n if agent_split.next().is_some() {\\n\",\n \"file_path\": \"beacon_node/eth2_libp2p/src/peer_manager/client.rs\",\n \"rank\": 35,\n \"score\": 247949.9576445665\n },\n {\n \"content\": \"pub fn subnet_id_to_string(i: u64) -> &'static str {\\n\\n if i < MAX_SUBNET_ID as u64 {\\n\\n &SUBNET_ID_TO_STRING\\n\\n .get(i as usize)\\n\\n .expect(\\\"index below MAX_SUBNET_ID\\\")\\n\\n } else {\\n\\n \\\"subnet id out of range\\\"\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SubnetId {\\n\\n pub fn new(id: u64) -> Self {\\n\\n id.into()\\n\\n }\\n\\n\\n\\n /// Compute the subnet for an attestation with `attestation_data` where each slot in the\\n\\n /// attestation epoch contains `committee_count_per_slot` committees.\\n\\n pub fn compute_subnet_for_attestation_data<T: EthSpec>(\\n\\n attestation_data: &AttestationData,\\n\\n committee_count_per_slot: u64,\\n\",\n \"file_path\": \"consensus/types/src/subnet_id.rs\",\n \"rank\": 36,\n \"score\": 247764.9763074132\n },\n {\n \"content\": \"pub fn get_key_for_col(column: &str, key: &[u8]) -> Vec<u8> {\\n\\n let mut result = column.as_bytes().to_vec();\\n\\n result.extend_from_slice(key);\\n\\n result\\n\\n}\\n\\n\\n\\npub enum KeyValueStoreOp {\\n\\n PutKeyValue(Vec<u8>, Vec<u8>),\\n\\n DeleteKey(Vec<u8>),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/store/src/lib.rs\",\n \"rank\": 37,\n \"score\": 247255.11433103235\n },\n {\n \"content\": \"// Note: `state.canonical_root()` uses whatever `tree_hash` that the `types` crate\\n\\n// uses, which is not necessarily this crate. If you want to ensure that types is\\n\\n// using this local version of `tree_hash`, ensure you add a workspace-level\\n\\n// [dependency\\n\\n// patch](https://doc.rust-lang.org/cargo/reference/manifest.html#the-patch-section).\\n\\nfn bench_suite<T: EthSpec>(c: &mut Criterion, spec_desc: &str, validator_count: usize) {\\n\\n let state1 = build_state::<T>(validator_count);\\n\\n let state2 = state1.clone();\\n\\n let mut state3 = state1.clone();\\n\\n state3.update_tree_hash_cache().unwrap();\\n\\n\\n\\n c.bench(\\n\\n &format!(\\\"{}/{}_validators/no_cache\\\", spec_desc, validator_count),\\n\\n Benchmark::new(\\\"genesis_state\\\", move |b| {\\n\\n b.iter_batched_ref(\\n\\n || state1.clone(),\\n\\n |state| black_box(state.canonical_root()),\\n\\n criterion::BatchSize::SmallInput,\\n\\n )\\n\\n })\\n\\n .sample_size(10),\\n\\n );\\n\\n\\n\\n c.bench(\\n\\n &format!(\\\"{}/{}_validators/empty_cache\\\", spec_desc, validator_count),\\n\",\n \"file_path\": \"consensus/tree_hash/benches/benches.rs\",\n \"rank\": 38,\n \"score\": 246772.49279017845\n },\n {\n \"content\": \"/// Run a bench with a highly complex block.\\n\\nfn worst_bench<T: EthSpec>(c: &mut Criterion, spec_desc: &str, validator_count: usize) {\\n\\n let mut spec = &mut T::default_spec();\\n\\n\\n\\n // Allows the exits to be processed sucessfully.\\n\\n spec.shard_committee_period = 0;\\n\\n\\n\\n let (block, state) = get_worst_block(validator_count, spec);\\n\\n bench_block::<T>(c, block, state, spec, spec_desc, \\\"high_complexity_block\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/state_processing/benches/benches.rs\",\n \"rank\": 39,\n \"score\": 246766.30429189483\n },\n {\n \"content\": \"/// Run a bench with a average complexity block.\\n\\nfn average_bench<T: EthSpec>(c: &mut Criterion, spec_desc: &str, validator_count: usize) {\\n\\n let spec = &T::default_spec();\\n\\n\\n\\n let (block, state) = get_average_block(validator_count, spec);\\n\\n bench_block::<T>(c, block, state, spec, spec_desc, \\\"average_complexity_block\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/state_processing/benches/benches.rs\",\n \"rank\": 40,\n \"score\": 246766.30429189483\n },\n {\n \"content\": \"fn get_state(validator_count: usize) -> BeaconState<E> {\\n\\n let spec = &E::default_spec();\\n\\n let eth1_data = Eth1Data {\\n\\n deposit_root: Hash256::zero(),\\n\\n deposit_count: 0,\\n\\n block_hash: Hash256::zero(),\\n\\n };\\n\\n\\n\\n let mut state = BeaconState::new(0, eth1_data, spec);\\n\\n\\n\\n for i in 0..validator_count {\\n\\n state.balances.push(i as u64).expect(\\\"should add balance\\\");\\n\\n state\\n\\n .validators\\n\\n .push(Validator {\\n\\n pubkey: generate_deterministic_keypair(i).pk.into(),\\n\\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\\n\\n effective_balance: i as u64,\\n\\n slashed: i % 2 == 0,\\n\\n activation_eligibility_epoch: i.into(),\\n\\n activation_epoch: i.into(),\\n\\n exit_epoch: i.into(),\\n\\n withdrawable_epoch: i.into(),\\n\\n })\\n\\n .expect(\\\"should add validator\\\");\\n\\n }\\n\\n\\n\\n state\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/types/examples/clone_state.rs\",\n \"rank\": 41,\n \"score\": 246642.21279008576\n },\n {\n \"content\": \"/// Creates a file with `600 (-rw-------)` permissions.\\n\\npub fn create_with_600_perms<P: AsRef<Path>>(path: P, bytes: &[u8]) -> Result<(), String> {\\n\\n let path = path.as_ref();\\n\\n\\n\\n let mut file =\\n\\n File::create(&path).map_err(|e| format!(\\\"Unable to create {:?}: {}\\\", path, e))?;\\n\\n\\n\\n let mut perm = file\\n\\n .metadata()\\n\\n .map_err(|e| format!(\\\"Unable to get {:?} metadata: {}\\\", path, e))?\\n\\n .permissions();\\n\\n\\n\\n perm.set_mode(0o600);\\n\\n\\n\\n file.set_permissions(perm)\\n\\n .map_err(|e| format!(\\\"Unable to set {:?} permissions: {}\\\", path, e))?;\\n\\n\\n\\n file.write_all(bytes)\\n\\n .map_err(|e| format!(\\\"Unable to write to {:?}: {}\\\", path, e))?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"account_manager/src/wallet/create.rs\",\n \"rank\": 42,\n \"score\": 246411.00519541436\n },\n {\n \"content\": \"#[allow(clippy::too_many_arguments)]\\n\\nfn store_range<F, E, S, I>(\\n\\n _: F,\\n\\n range: I,\\n\\n start_vindex: usize,\\n\\n end_vindex: usize,\\n\\n store: &S,\\n\\n state: &BeaconState<E>,\\n\\n spec: &ChainSpec,\\n\\n ops: &mut Vec<KeyValueStoreOp>,\\n\\n) -> Result<bool, Error>\\n\\nwhere\\n\\n F: Field<E>,\\n\\n E: EthSpec,\\n\\n S: KeyValueStore<E>,\\n\\n I: Iterator<Item = usize>,\\n\\n{\\n\\n for chunk_index in range {\\n\\n let chunk_key = &chunk_key(chunk_index as u64)[..];\\n\\n\\n\\n let existing_chunk =\\n\",\n \"file_path\": \"beacon_node/store/src/chunked_vector.rs\",\n \"rank\": 43,\n \"score\": 246225.32295576404\n },\n {\n \"content\": \"fn get_state(validator_count: usize) -> BeaconState<E> {\\n\\n let spec = &E::default_spec();\\n\\n let eth1_data = Eth1Data {\\n\\n deposit_root: Hash256::zero(),\\n\\n deposit_count: 0,\\n\\n block_hash: Hash256::zero(),\\n\\n };\\n\\n\\n\\n let mut state = BeaconState::new(0, eth1_data, spec);\\n\\n\\n\\n for i in 0..validator_count {\\n\\n state.balances.push(i as u64).expect(\\\"should add balance\\\");\\n\\n state\\n\\n .validators\\n\\n .push(Validator {\\n\\n pubkey: generate_deterministic_keypair(i).pk.into(),\\n\\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\\n\\n effective_balance: i as u64,\\n\\n slashed: i % 2 == 0,\\n\\n activation_eligibility_epoch: i.into(),\\n\\n activation_epoch: i.into(),\\n\\n exit_epoch: i.into(),\\n\\n withdrawable_epoch: i.into(),\\n\\n })\\n\\n .expect(\\\"should add validator\\\");\\n\\n }\\n\\n\\n\\n state\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/types/examples/ssz_encode_state.rs\",\n \"rank\": 44,\n \"score\": 242749.35885748832\n },\n {\n \"content\": \"fn get_state(validator_count: usize) -> BeaconState<E> {\\n\\n let spec = &E::default_spec();\\n\\n let eth1_data = Eth1Data {\\n\\n deposit_root: Hash256::zero(),\\n\\n deposit_count: 0,\\n\\n block_hash: Hash256::zero(),\\n\\n };\\n\\n\\n\\n let mut state = BeaconState::new(0, eth1_data, spec);\\n\\n\\n\\n for i in 0..validator_count {\\n\\n state.balances.push(i as u64).expect(\\\"should add balance\\\");\\n\\n state\\n\\n .validators\\n\\n .push(Validator {\\n\\n pubkey: generate_deterministic_keypair(i).pk.into(),\\n\\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\\n\\n effective_balance: i as u64,\\n\\n slashed: i % 2 == 0,\\n\\n activation_eligibility_epoch: i.into(),\\n\\n activation_epoch: i.into(),\\n\\n exit_epoch: i.into(),\\n\\n withdrawable_epoch: i.into(),\\n\\n })\\n\\n .expect(\\\"should add validator\\\");\\n\\n }\\n\\n\\n\\n state\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/types/examples/tree_hash_state.rs\",\n \"rank\": 45,\n \"score\": 242749.35885748832\n },\n {\n \"content\": \"/// A helper function providing common functionality for finding the Merkle root of some bytes that\\n\\n/// represent a bitfield.\\n\\npub fn bitfield_bytes_tree_hash_root<N: Unsigned>(bytes: &[u8]) -> Hash256 {\\n\\n let byte_size = (N::to_usize() + 7) / 8;\\n\\n let leaf_count = (byte_size + BYTES_PER_CHUNK - 1) / BYTES_PER_CHUNK;\\n\\n\\n\\n let mut hasher = MerkleHasher::with_leaves(leaf_count);\\n\\n\\n\\n hasher\\n\\n .write(bytes)\\n\\n .expect(\\\"bitfield should not exceed tree hash leaf limit\\\");\\n\\n\\n\\n hasher\\n\\n .finish()\\n\\n .expect(\\\"bitfield tree hash buffer should not exceed leaf limit\\\")\\n\\n}\\n\",\n \"file_path\": \"consensus/ssz_types/src/tree_hash.rs\",\n \"rank\": 46,\n \"score\": 241058.77633399848\n },\n {\n \"content\": \"pub fn store_updated_vector<F: Field<E>, E: EthSpec, S: KeyValueStore<E>>(\\n\\n field: F,\\n\\n store: &S,\\n\\n state: &BeaconState<E>,\\n\\n spec: &ChainSpec,\\n\\n ops: &mut Vec<KeyValueStoreOp>,\\n\\n) -> Result<(), Error> {\\n\\n let chunk_size = F::chunk_size();\\n\\n let (start_vindex, end_vindex) = F::start_and_end_vindex(state.slot, spec);\\n\\n let start_cindex = start_vindex / chunk_size;\\n\\n let end_cindex = end_vindex / chunk_size;\\n\\n\\n\\n // Store the genesis value if we have access to it, and it hasn't been stored already.\\n\\n if F::slot_needs_genesis_value(state.slot, spec) {\\n\\n let genesis_value = F::extract_genesis_value(state, spec)?;\\n\\n F::check_and_store_genesis_value(store, genesis_value, ops)?;\\n\\n }\\n\\n\\n\\n // Start by iterating backwards from the last chunk, storing new chunks in the database.\\n\\n // Stop once a chunk in the database matches what we were about to store, this indicates\\n\",\n \"file_path\": \"beacon_node/store/src/chunked_vector.rs\",\n \"rank\": 47,\n \"score\": 240432.15946709167\n },\n {\n \"content\": \"fn variable_list_h256_test<Len: Unsigned>(leaves_and_skips: Vec<(u64, bool)>) -> bool {\\n\\n let arena = &mut CacheArena::default();\\n\\n let leaves: Vec<_> = leaves_and_skips\\n\\n .iter()\\n\\n .map(|(l, _)| Hash256::from_low_u64_be(*l))\\n\\n .take(Len::to_usize())\\n\\n .collect();\\n\\n\\n\\n let mut list: VariableList<Hash256, Len>;\\n\\n let init: VariableList<Hash256, Len> = VariableList::new(vec![]).unwrap();\\n\\n let mut cache = init.new_tree_hash_cache(arena);\\n\\n\\n\\n for (end, (_, update_cache)) in leaves_and_skips.into_iter().enumerate() {\\n\\n list = VariableList::new(leaves[..end].to_vec()).unwrap();\\n\\n\\n\\n if update_cache\\n\\n && list\\n\\n .recalculate_tree_hash_root(arena, &mut cache)\\n\\n .unwrap()\\n\\n .as_bytes()\\n\\n != &list.tree_hash_root()[..]\\n\\n {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n true\\n\\n}\\n\",\n \"file_path\": \"consensus/cached_tree_hash/src/test.rs\",\n \"rank\": 48,\n \"score\": 240405.4328382326\n },\n {\n \"content\": \"/// Returns `true` if we should consider the `file_name` to represent a voting keystore.\\n\\npub fn is_voting_keystore(file_name: &str) -> bool {\\n\\n // All formats end with `.json`.\\n\\n if !file_name.ends_with(\\\".json\\\") {\\n\\n return false;\\n\\n }\\n\\n\\n\\n // The format used by Lighthouse.\\n\\n if file_name == VOTING_KEYSTORE_FILE {\\n\\n return true;\\n\\n }\\n\\n\\n\\n // The format exported by the `eth2.0-deposit-cli` library.\\n\\n //\\n\\n // Reference to function that generates keystores:\\n\\n //\\n\\n // https://github.com/ethereum/eth2.0-deposit-cli/blob/7cebff15eac299b3b1b090c896dd3410c8463450/eth2deposit/credentials.py#L58-L62\\n\\n //\\n\\n // Since we include the key derivation path of `m/12381/3600/x/0/0` this should only ever match\\n\\n // with a voting keystore and never a withdrawal keystore.\\n\\n //\\n\",\n \"file_path\": \"common/account_utils/src/validator_definitions.rs\",\n \"rank\": 49,\n \"score\": 240196.18556626939\n },\n {\n \"content\": \"/// Converts 0x-prefixed hex to bytes.\\n\\nfn hex_to_vec(hex: &str) -> Vec<u8> {\\n\\n hex::decode(&hex[2..]).expect(\\\"should decode hex as vec\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crypto/eth2_key_derivation/tests/eip2333_vectors.rs\",\n \"rank\": 50,\n \"score\": 239867.51367373724\n },\n {\n \"content\": \"/// Parses a `0x`-prefixed, **big-endian** hex string as a u64.\\n\\n///\\n\\n/// Note: the JSON-RPC encodes integers as big-endian. The deposit contract uses little-endian.\\n\\n/// Therefore, this function is only useful for numbers encoded by the JSON RPC.\\n\\n///\\n\\n/// E.g., `0x01 == 1`\\n\\nfn hex_to_u64_be(hex: &str) -> Result<u64, String> {\\n\\n u64::from_str_radix(strip_prefix(hex)?, 16)\\n\\n .map_err(|e| format!(\\\"Failed to parse hex as u64: {:?}\\\", e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/eth1/src/http.rs\",\n \"rank\": 51,\n \"score\": 237855.68858469246\n },\n {\n \"content\": \"// hex::encode only allows up to 32 bytes.\\n\\npub fn bytes96_to_hex_string(data: [u8; 96]) -> Result<String, Error> {\\n\\n static CHARS: &[u8] = b\\\"0123456789abcdef\\\";\\n\\n let mut s = String::with_capacity(96 * 2 + 2);\\n\\n\\n\\n s.write_char('0')?;\\n\\n s.write_char('x')?;\\n\\n\\n\\n for &byte in data.iter() {\\n\\n s.write_char(CHARS[(byte >> 4) as usize].into())?;\\n\\n s.write_char(CHARS[(byte & 0xf) as usize].into())?;\\n\\n }\\n\\n\\n\\n Ok(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"remote_signer/backend/src/utils.rs\",\n \"rank\": 52,\n \"score\": 237784.2542164644\n },\n {\n \"content\": \"/// Reads a `BYTES_PER_LENGTH_OFFSET`-byte union index from `bytes`, where `bytes.len() >=\\n\\n/// BYTES_PER_LENGTH_OFFSET`.\\n\\npub fn read_union_index(bytes: &[u8]) -> Result<usize, DecodeError> {\\n\\n read_offset(bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/ssz/src/decode.rs\",\n \"rank\": 53,\n \"score\": 237420.58756072045\n },\n {\n \"content\": \"/// Reads a password from TTY or stdin if `use_stdin == true`.\\n\\npub fn read_password_from_user(use_stdin: bool) -> Result<ZeroizeString, String> {\\n\\n let result = if use_stdin {\\n\\n rpassword::prompt_password_stderr(\\\"\\\")\\n\\n .map_err(|e| format!(\\\"Error reading from stdin: {}\\\", e))\\n\\n } else {\\n\\n rpassword::read_password_from_tty(None)\\n\\n .map_err(|e| format!(\\\"Error reading from tty: {}\\\", e))\\n\\n };\\n\\n\\n\\n result.map(ZeroizeString::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 54,\n \"score\": 236908.22784797937\n },\n {\n \"content\": \"/// Encode `index` as a little-endian byte array of `BYTES_PER_LENGTH_OFFSET` length.\\n\\n///\\n\\n/// If `len` is larger than `2 ^ BYTES_PER_LENGTH_OFFSET`, a `debug_assert` is raised.\\n\\npub fn encode_union_index(index: usize) -> [u8; BYTES_PER_LENGTH_OFFSET] {\\n\\n encode_length(index)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/ssz/src/encode.rs\",\n \"rank\": 55,\n \"score\": 236549.4760129461\n },\n {\n \"content\": \"pub fn load_vector_from_db<F: FixedLengthField<E>, E: EthSpec, S: KeyValueStore<E>>(\\n\\n store: &S,\\n\\n slot: Slot,\\n\\n spec: &ChainSpec,\\n\\n) -> Result<FixedVector<F::Value, F::Length>, Error> {\\n\\n // Do a range query\\n\\n let chunk_size = F::chunk_size();\\n\\n let (start_vindex, end_vindex) = F::start_and_end_vindex(slot, spec);\\n\\n let start_cindex = start_vindex / chunk_size;\\n\\n let end_cindex = end_vindex / chunk_size;\\n\\n\\n\\n let chunks = range_query(store, F::column(), start_cindex, end_cindex)?;\\n\\n\\n\\n let default = if F::slot_needs_genesis_value(slot, spec) {\\n\\n F::load_genesis_value(store)?\\n\\n } else {\\n\\n F::Value::default()\\n\\n };\\n\\n\\n\\n let result = stitch(\\n\",\n \"file_path\": \"beacon_node/store/src/chunked_vector.rs\",\n \"rank\": 56,\n \"score\": 236451.59909715707\n },\n {\n \"content\": \"/// Takes a string password and checks that it meets minimum requirements.\\n\\n///\\n\\n/// The current minimum password requirement is a 12 character length character length.\\n\\npub fn is_password_sufficiently_complex(password: &[u8]) -> Result<(), String> {\\n\\n if count_unicode_characters(password) >= MINIMUM_PASSWORD_LEN {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(format!(\\n\\n \\\"Please use at least {} characters for your password.\\\",\\n\\n MINIMUM_PASSWORD_LEN\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 57,\n \"score\": 234666.4619240947\n },\n {\n \"content\": \"/// The historical roots are stored in vector chunks, despite not actually being a vector.\\n\\npub fn load_variable_list_from_db<F: VariableLengthField<E>, E: EthSpec, S: KeyValueStore<E>>(\\n\\n store: &S,\\n\\n slot: Slot,\\n\\n spec: &ChainSpec,\\n\\n) -> Result<VariableList<F::Value, F::Length>, Error> {\\n\\n let chunk_size = F::chunk_size();\\n\\n let (start_vindex, end_vindex) = F::start_and_end_vindex(slot, spec);\\n\\n let start_cindex = start_vindex / chunk_size;\\n\\n let end_cindex = end_vindex / chunk_size;\\n\\n\\n\\n let chunks: Vec<Chunk<F::Value>> = range_query(store, F::column(), start_cindex, end_cindex)?;\\n\\n\\n\\n let mut result = Vec::with_capacity(chunk_size * chunks.len());\\n\\n\\n\\n for (chunk_index, chunk) in chunks.into_iter().enumerate() {\\n\\n for (i, value) in chunk.values.into_iter().enumerate() {\\n\\n let vindex = chunk_index * chunk_size + i;\\n\\n\\n\\n if vindex >= start_vindex && vindex < end_vindex {\\n\\n result.push(value);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(result.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/store/src/chunked_vector.rs\",\n \"rank\": 58,\n \"score\": 234552.59034174925\n },\n {\n \"content\": \"/// Remove all entries from the given hash map for which `prune_if` returns true.\\n\\n///\\n\\n/// The keys in the map should be validator indices, which will be looked up\\n\\n/// in the state's validator registry and then passed to `prune_if`.\\n\\n/// Entries for unknown validators will be kept.\\n\\nfn prune_validator_hash_map<T, F, E: EthSpec>(\\n\\n map: &mut HashMap<u64, T>,\\n\\n prune_if: F,\\n\\n head_state: &BeaconState<E>,\\n\\n) where\\n\\n F: Fn(&Validator) -> bool,\\n\\n{\\n\\n map.retain(|&validator_index, _| {\\n\\n head_state\\n\\n .validators\\n\\n .get(validator_index as usize)\\n\\n .map_or(true, |validator| !prune_if(validator))\\n\\n });\\n\\n}\\n\\n\\n\\n/// Compare two operation pools.\\n\\nimpl<T: EthSpec + Default> PartialEq for OperationPool<T> {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n if ptr::eq(self, other) {\\n\\n return true;\\n\",\n \"file_path\": \"beacon_node/operation_pool/src/lib.rs\",\n \"rank\": 59,\n \"score\": 234248.8348295537\n },\n {\n \"content\": \"fn update_parent_roots(snapshots: &mut [BeaconSnapshot<E>]) {\\n\\n for i in 0..snapshots.len() {\\n\\n let root = snapshots[i].beacon_block.canonical_root();\\n\\n if let Some(child) = snapshots.get_mut(i + 1) {\\n\\n child.beacon_block.message.parent_root = root\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/beacon_chain/tests/block_verification.rs\",\n \"rank\": 60,\n \"score\": 234187.00176522054\n },\n {\n \"content\": \"/// Merkleize `bytes` and return the root, optionally padding the tree out to `min_leaves` number of\\n\\n/// leaves.\\n\\n///\\n\\n/// **Note**: This function is generally worse than using the `crate::merkle_root` which uses\\n\\n/// `MerkleHasher`. We only keep this function around for reference testing.\\n\\n///\\n\\n/// First all nodes are extracted from `bytes` and then a padding node is added until the number of\\n\\n/// leaf chunks is greater than or equal to `min_leaves`. Callers may set `min_leaves` to `0` if no\\n\\n/// adding additional chunks should be added to the given `bytes`.\\n\\n///\\n\\n/// If `bytes.len() <= BYTES_PER_CHUNK`, no hashing is done and `bytes` is returned, potentially\\n\\n/// padded out to `BYTES_PER_CHUNK` length with `0`.\\n\\n///\\n\\n/// ## CPU Performance\\n\\n///\\n\\n/// A cache of `MAX_TREE_DEPTH` hashes are stored to avoid re-computing the hashes of padding nodes\\n\\n/// (or their parents). Therefore, adding padding nodes only incurs one more hash per additional\\n\\n/// height of the tree.\\n\\n///\\n\\n/// ## Memory Performance\\n\\n///\\n\\n/// This algorithm has two interesting memory usage properties:\\n\\n///\\n\\n/// 1. The maximum memory footprint is roughly `O(V / 2)` memory, where `V` is the number of leaf\\n\\n/// chunks with values (i.e., leaves that are not padding). The means adding padding nodes to\\n\\n/// the tree does not increase the memory footprint.\\n\\n/// 2. At each height of the tree half of the memory is freed until only a single chunk is stored.\\n\\n/// 3. The input `bytes` are not copied into another list before processing.\\n\\n///\\n\\n/// _Note: there are some minor memory overheads, including a handful of usizes and a list of\\n\\n/// `MAX_TREE_DEPTH` hashes as `lazy_static` constants._\\n\\npub fn merkleize_padded(bytes: &[u8], min_leaves: usize) -> Hash256 {\\n\\n // If the bytes are just one chunk or less, pad to one chunk and return without hashing.\\n\\n if bytes.len() <= BYTES_PER_CHUNK && min_leaves <= 1 {\\n\\n let mut o = bytes.to_vec();\\n\\n o.resize(BYTES_PER_CHUNK, 0);\\n\\n return Hash256::from_slice(&o);\\n\\n }\\n\\n\\n\\n assert!(\\n\\n bytes.len() > BYTES_PER_CHUNK || min_leaves > 1,\\n\\n \\\"Merkle hashing only needs to happen if there is more than one chunk\\\"\\n\\n );\\n\\n\\n\\n // The number of leaves that can be made directly from `bytes`.\\n\\n let leaves_with_values = (bytes.len() + (BYTES_PER_CHUNK - 1)) / BYTES_PER_CHUNK;\\n\\n\\n\\n // The number of parents that have at least one non-padding leaf.\\n\\n //\\n\\n // Since there is more than one node in this tree (see prior assertion), there should always be\\n\\n // one or more initial parent nodes.\\n\",\n \"file_path\": \"consensus/tree_hash/src/merkleize_padded.rs\",\n \"rank\": 61,\n \"score\": 233678.1031970629\n },\n {\n \"content\": \"/// Convenience method for `MerkleHasher` which also provides some fast-paths for small trees.\\n\\n///\\n\\n/// `minimum_leaf_count` will only be used if it is greater than or equal to the minimum number of leaves that can be created from `bytes`.\\n\\npub fn merkle_root(bytes: &[u8], minimum_leaf_count: usize) -> Hash256 {\\n\\n let leaves = std::cmp::max(\\n\\n (bytes.len() + (HASHSIZE - 1)) / HASHSIZE,\\n\\n minimum_leaf_count,\\n\\n );\\n\\n\\n\\n if leaves == 0 {\\n\\n // If there are no bytes then the hash is always zero.\\n\\n Hash256::zero()\\n\\n } else if leaves == 1 {\\n\\n // If there is only one leaf, the hash is always those leaf bytes padded out to 32-bytes.\\n\\n let mut hash = [0; HASHSIZE];\\n\\n hash[0..bytes.len()].copy_from_slice(bytes);\\n\\n Hash256::from_slice(&hash)\\n\\n } else if leaves == 2 {\\n\\n // If there are only two leaves (this is common with BLS pubkeys), we can avoid some\\n\\n // overhead with `MerkleHasher` and just do a simple 3-node tree here.\\n\\n let mut leaves = [0; HASHSIZE * 2];\\n\\n leaves[0..bytes.len()].copy_from_slice(bytes);\\n\\n\\n\",\n \"file_path\": \"consensus/tree_hash/src/lib.rs\",\n \"rank\": 62,\n \"score\": 233671.6387915014\n },\n {\n \"content\": \"/// Executes a `Command`, returning a `Result` based upon the success exit code of the command.\\n\\nfn output_result(cmd: &mut Command) -> Result<Output, String> {\\n\\n let output = cmd.output().expect(\\\"should run command\\\");\\n\\n\\n\\n if output.status.success() {\\n\\n Ok(output)\\n\\n } else {\\n\\n Err(from_utf8(&output.stderr)\\n\\n .expect(\\\"stderr is not utf8\\\")\\n\\n .to_string())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lighthouse/tests/account_manager.rs\",\n \"rank\": 63,\n \"score\": 233493.5830435321\n },\n {\n \"content\": \"/// A bit of hack to find an unused port.\\n\\n///\\n\\n/// Does not guarantee that the given port is unused after the function exists, just that it was\\n\\n/// unused before the function started (i.e., it does not reserve a port).\\n\\n///\\n\\n/// Used for passing unused ports to libp2 so that lighthouse won't have to update\\n\\n/// its own ENR.\\n\\n///\\n\\n/// NOTE: It is possible that libp2p/discv5 is unable to bind to the\\n\\n/// ports returned by this function as the OS has a buffer period where\\n\\n/// it doesn't allow binding to the same port even after the socket is closed.\\n\\n/// We might have to use SO_REUSEADDR socket option from `std::net2` crate in\\n\\n/// that case.\\n\\npub fn unused_port(transport: &str) -> Result<u16, String> {\\n\\n let local_addr = match transport {\\n\\n \\\"tcp\\\" => {\\n\\n let listener = TcpListener::bind(\\\"127.0.0.1:0\\\").map_err(|e| {\\n\\n format!(\\\"Failed to create TCP listener to find unused port: {:?}\\\", e)\\n\\n })?;\\n\\n listener.local_addr().map_err(|e| {\\n\\n format!(\\n\\n \\\"Failed to read TCP listener local_addr to find unused port: {:?}\\\",\\n\\n e\\n\\n )\\n\\n })?\\n\\n }\\n\\n \\\"udp\\\" => {\\n\\n let socket = UdpSocket::bind(\\\"127.0.0.1:0\\\")\\n\\n .map_err(|e| format!(\\\"Failed to create UDP socket to find unused port: {:?}\\\", e))?;\\n\\n socket.local_addr().map_err(|e| {\\n\\n format!(\\n\\n \\\"Failed to read UDP socket local_addr to find unused port: {:?}\\\",\\n\\n e\\n\\n )\\n\\n })?\\n\\n }\\n\\n _ => return Err(\\\"Invalid transport to find unused port\\\".into()),\\n\\n };\\n\\n Ok(local_addr.port())\\n\\n}\\n\",\n \"file_path\": \"beacon_node/src/config.rs\",\n \"rank\": 64,\n \"score\": 233332.01558145863\n },\n {\n \"content\": \"/// Return a G1 point for the given `validator_index`, encoded as a compressed point in\\n\\n/// big-endian byte-ordering.\\n\\npub fn be_private_key(validator_index: usize) -> [u8; PRIVATE_KEY_BYTES] {\\n\\n let preimage = {\\n\\n let mut bytes = [0; HASH_BYTES];\\n\\n let index = validator_index.to_le_bytes();\\n\\n bytes[0..index.len()].copy_from_slice(&index);\\n\\n bytes\\n\\n };\\n\\n\\n\\n let privkey = BigUint::from_bytes_le(&hash(&preimage)) % &*CURVE_ORDER;\\n\\n\\n\\n let mut bytes = [0; PRIVATE_KEY_BYTES];\\n\\n let privkey_bytes = privkey.to_bytes_be();\\n\\n bytes[PRIVATE_KEY_BYTES - privkey_bytes.len()..].copy_from_slice(&privkey_bytes);\\n\\n bytes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/eth2_interop_keypairs/src/lib.rs\",\n \"rank\": 65,\n \"score\": 232956.43407642067\n },\n {\n \"content\": \"/// Accepts an entire HTTP body (as a string) and returns the `result` field, as a serde `Value`.\\n\\nfn response_result(response: &str) -> Result<Option<Value>, String> {\\n\\n let json = serde_json::from_str::<Value>(&response)\\n\\n .map_err(|e| format!(\\\"Failed to parse response: {:?}\\\", e))?;\\n\\n\\n\\n if let Some(error) = json.get(\\\"error\\\") {\\n\\n Err(format!(\\\"Eth1 node returned error: {}\\\", error))\\n\\n } else {\\n\\n Ok(json\\n\\n .get(\\\"result\\\")\\n\\n .cloned()\\n\\n .map(Some)\\n\\n .unwrap_or_else(|| None))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/eth1/src/http.rs\",\n \"rank\": 66,\n \"score\": 230277.73145111592\n },\n {\n \"content\": \"/// Attempts to parse a mnemonic phrase.\\n\\npub fn mnemonic_from_phrase(phrase: &str) -> Result<Mnemonic, String> {\\n\\n Mnemonic::from_phrase(phrase, Language::English).map_err(|e| e.to_string())\\n\\n}\\n\\n\\n\\n/// Provides a new-type wrapper around `String` that is zeroized on `Drop`.\\n\\n///\\n\\n/// Useful for ensuring that password memory is zeroed-out on drop.\\n\\n#[derive(Clone, PartialEq, Serialize, Deserialize, Zeroize)]\\n\\n#[zeroize(drop)]\\n\\n#[serde(transparent)]\\n\\npub struct ZeroizeString(String);\\n\\n\\n\\nimpl From<String> for ZeroizeString {\\n\\n fn from(s: String) -> Self {\\n\\n Self(s)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ZeroizeString {\\n\\n pub fn as_str(&self) -> &str {\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 67,\n \"score\": 230271.70090317028\n },\n {\n \"content\": \"pub fn deserialize<'de, D>(deserializer: D) -> Result<[u8; BYTES_LEN], D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let decoded = deserializer.deserialize_str(PrefixedHexVisitor)?;\\n\\n\\n\\n if decoded.len() != BYTES_LEN {\\n\\n return Err(D::Error::custom(format!(\\n\\n \\\"expected {} bytes for array, got {}\\\",\\n\\n BYTES_LEN,\\n\\n decoded.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n let mut array = [0; BYTES_LEN];\\n\\n array.copy_from_slice(&decoded);\\n\\n Ok(array)\\n\\n}\\n\",\n \"file_path\": \"consensus/serde_utils/src/bytes_4_hex.rs\",\n \"rank\": 68,\n \"score\": 229110.49678136807\n },\n {\n \"content\": \"fn get_block<T, F>(mut mutate_builder: F) -> (SignedBeaconBlock<T>, BeaconState<T>)\\n\\nwhere\\n\\n T: EthSpec,\\n\\n F: FnMut(&mut BlockBuilder<T>),\\n\\n{\\n\\n let spec = T::default_spec();\\n\\n let mut builder: BlockBuilder<T> = BlockBuilder::new(VALIDATOR_COUNT, &spec);\\n\\n builder.set_slot(Slot::from(T::slots_per_epoch() * 3 - 2));\\n\\n builder.build_caches(&spec);\\n\\n mutate_builder(&mut builder);\\n\\n builder.build(&spec)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/state_processing/tests/tests.rs\",\n \"rank\": 69,\n \"score\": 228585.90326698864\n },\n {\n \"content\": \"/// Returns `int` as little-endian bytes with a length of 1.\\n\\npub fn int_to_bytes1(int: u8) -> Vec<u8> {\\n\\n vec![int]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/int_to_bytes/src/lib.rs\",\n \"rank\": 70,\n \"score\": 227804.81160978408\n },\n {\n \"content\": \"/// Peforms a `HKDF-Expand` on the `pkr` (pseudo-random key), returning `l` bytes.\\n\\n///\\n\\n/// Defined in [RFC5869](https://tools.ietf.org/html/rfc5869).\\n\\nfn hkdf_expand(prk: Prk, info: &[u8], l: usize) -> SecretBytes {\\n\\n struct ExpandLen(usize);\\n\\n\\n\\n impl KeyType for ExpandLen {\\n\\n fn len(&self) -> usize {\\n\\n self.0\\n\\n }\\n\\n }\\n\\n\\n\\n let mut okm = SecretBytes::zero(l);\\n\\n prk.expand(&[info], ExpandLen(l))\\n\\n .expect(\\\"expand len is constant and cannot be too large\\\")\\n\\n .fill(okm.as_mut_bytes())\\n\\n .expect(\\\"fill len is constant and cannot be too large\\\");\\n\\n okm\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crypto/eth2_key_derivation/src/derived_key.rs\",\n \"rank\": 71,\n \"score\": 227465.67218124063\n },\n {\n \"content\": \"pub fn get_environment(is_log_active: bool) -> Environment<E> {\\n\\n let environment_builder = EnvironmentBuilder::mainnet();\\n\\n\\n\\n let builder = if is_log_active {\\n\\n environment_builder.async_logger(\\\"info\\\", None).unwrap()\\n\\n } else {\\n\\n environment_builder.null_logger().unwrap()\\n\\n };\\n\\n\\n\\n builder\\n\\n .multi_threaded_tokio_runtime()\\n\\n .unwrap()\\n\\n .build()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/remote_signer_test/src/api_test_signer.rs\",\n \"rank\": 72,\n \"score\": 226539.36279354285\n },\n {\n \"content\": \"/// Encode `data` as a 0x-prefixed hex string.\\n\\npub fn encode<T: AsRef<[u8]>>(data: T) -> String {\\n\\n let hex = hex::encode(data);\\n\\n let mut s = \\\"0x\\\".to_string();\\n\\n s.push_str(hex.as_str());\\n\\n s\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/serde_utils/src/hex.rs\",\n \"rank\": 73,\n \"score\": 226035.30167336622\n },\n {\n \"content\": \"fn all_benches(c: &mut Criterion) {\\n\\n let validator_count = 16_384;\\n\\n let spec = &MainnetEthSpec::default_spec();\\n\\n\\n\\n let mut state = get_state::<MainnetEthSpec>(validator_count);\\n\\n state.build_all_caches(spec).expect(\\\"should build caches\\\");\\n\\n let state_bytes = state.as_ssz_bytes();\\n\\n\\n\\n let inner_state = state.clone();\\n\\n c.bench(\\n\\n &format!(\\\"{}_validators\\\", validator_count),\\n\\n Benchmark::new(\\\"encode/beacon_state\\\", move |b| {\\n\\n b.iter_batched_ref(\\n\\n || inner_state.clone(),\\n\\n |state| black_box(state.as_ssz_bytes()),\\n\\n criterion::BatchSize::SmallInput,\\n\\n )\\n\\n })\\n\\n .sample_size(10),\\n\\n );\\n\",\n \"file_path\": \"consensus/types/benches/benches.rs\",\n \"rank\": 74,\n \"score\": 225661.80730044126\n },\n {\n \"content\": \"fn unwrap_err<T, E>(result: Result<T, E>) -> E {\\n\\n match result {\\n\\n Ok(_) => panic!(\\\"called unwrap_err on Ok\\\"),\\n\\n Err(e) => e,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/beacon_chain/tests/block_verification.rs\",\n \"rank\": 75,\n \"score\": 225222.78928538598\n },\n {\n \"content\": \"// A bit of hack to find an unused port.\\n\\n///\\n\\n/// Does not guarantee that the given port is unused after the function exists, just that it was\\n\\n/// unused before the function started (i.e., it does not reserve a port).\\n\\npub fn unused_port(transport: &str) -> Result<u16, String> {\\n\\n let local_addr = match transport {\\n\\n \\\"tcp\\\" => {\\n\\n let listener = TcpListener::bind(\\\"127.0.0.1:0\\\").map_err(|e| {\\n\\n format!(\\\"Failed to create TCP listener to find unused port: {:?}\\\", e)\\n\\n })?;\\n\\n listener.local_addr().map_err(|e| {\\n\\n format!(\\n\\n \\\"Failed to read TCP listener local_addr to find unused port: {:?}\\\",\\n\\n e\\n\\n )\\n\\n })?\\n\\n }\\n\\n \\\"udp\\\" => {\\n\\n let socket = UdpSocket::bind(\\\"127.0.0.1:0\\\")\\n\\n .map_err(|e| format!(\\\"Failed to create UDP socket to find unused port: {:?}\\\", e))?;\\n\\n socket.local_addr().map_err(|e| {\\n\\n format!(\\n\\n \\\"Failed to read UDP socket local_addr to find unused port: {:?}\\\",\\n\\n e\\n\\n )\\n\\n })?\\n\\n }\\n\\n _ => return Err(\\\"Invalid transport to find unused port\\\".into()),\\n\\n };\\n\\n Ok(local_addr.port())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/eth2_libp2p/tests/common/mod.rs\",\n \"rank\": 76,\n \"score\": 224552.1411596595\n },\n {\n \"content\": \"pub fn check_serialization<T: SszStaticType>(value: &T, serialized: &[u8]) -> Result<(), Error> {\\n\\n // Check serialization\\n\\n let serialized_result = value.as_ssz_bytes();\\n\\n compare_result::<usize, Error>(&Ok(value.ssz_bytes_len()), &Some(serialized.len()))?;\\n\\n compare_result::<Vec<u8>, Error>(&Ok(serialized_result), &Some(serialized.to_vec()))?;\\n\\n\\n\\n // Check deserialization\\n\\n let deserialized_result = T::from_ssz_bytes(serialized);\\n\\n compare_result(&deserialized_result, &Some(value.clone()))?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/ef_tests/src/cases/ssz_static.rs\",\n \"rank\": 77,\n \"score\": 224520.2948684793\n },\n {\n \"content\": \"/// Returns a beacon chain harness.\\n\\nfn get_harness(validator_count: usize) -> BeaconChainHarness<EphemeralHarnessType<E>> {\\n\\n let harness = BeaconChainHarness::new_with_target_aggregators(\\n\\n MainnetEthSpec,\\n\\n KEYPAIRS[0..validator_count].to_vec(),\\n\\n // A kind-of arbitrary number that ensures that _some_ validators are aggregators, but\\n\\n // not all.\\n\\n 4,\\n\\n StoreConfig::default(),\\n\\n );\\n\\n\\n\\n harness.advance_slot();\\n\\n\\n\\n harness\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/beacon_chain/tests/attestation_verification.rs\",\n \"rank\": 78,\n \"score\": 222404.17398378815\n },\n {\n \"content\": \"fn get_harness(validator_count: usize) -> BeaconChainHarness<EphemeralHarnessType<E>> {\\n\\n let harness = BeaconChainHarness::new_with_store_config(\\n\\n MainnetEthSpec,\\n\\n KEYPAIRS[0..validator_count].to_vec(),\\n\\n StoreConfig::default(),\\n\\n );\\n\\n\\n\\n harness.advance_slot();\\n\\n\\n\\n harness\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/beacon_chain/tests/block_verification.rs\",\n \"rank\": 79,\n \"score\": 222404.17398378812\n },\n {\n \"content\": \"/// Writes a list of `vectors` to the `title` dir.\\n\\nfn write_vectors_to_file(title: &str, vectors: &[TestVector]) -> Result<(), String> {\\n\\n let dir = env::var(\\\"CARGO_MANIFEST_DIR\\\")\\n\\n .map_err(|e| format!(\\\"Unable to find manifest dir: {:?}\\\", e))?\\n\\n .parse::<PathBuf>()\\n\\n .map_err(|e| format!(\\\"Unable to parse manifest dir: {:?}\\\", e))?\\n\\n .join(BASE_VECTOR_DIR)\\n\\n .join(title);\\n\\n\\n\\n if dir.exists() {\\n\\n fs::remove_dir_all(&dir).map_err(|e| format!(\\\"Unable to remove {:?}: {:?}\\\", dir, e))?;\\n\\n }\\n\\n fs::create_dir_all(&dir).map_err(|e| format!(\\\"Unable to create {:?}: {:?}\\\", dir, e))?;\\n\\n\\n\\n for vector in vectors {\\n\\n let dir = dir.clone().join(&vector.title);\\n\\n if dir.exists() {\\n\\n fs::remove_dir_all(&dir).map_err(|e| format!(\\\"Unable to remove {:?}: {:?}\\\", dir, e))?;\\n\\n }\\n\\n fs::create_dir_all(&dir).map_err(|e| format!(\\\"Unable to create {:?}: {:?}\\\", dir, e))?;\\n\\n\\n\",\n \"file_path\": \"testing/state_transition_vectors/src/main.rs\",\n \"rank\": 80,\n \"score\": 221861.2736875224\n },\n {\n \"content\": \"fn test_scenario<T: EthSpec, F, G>(mutate_builder: F, mut invalidate_block: G, spec: &ChainSpec)\\n\\nwhere\\n\\n T: EthSpec,\\n\\n F: FnMut(&mut BlockBuilder<T>),\\n\\n G: FnMut(&mut SignedBeaconBlock<T>),\\n\\n{\\n\\n let (mut block, mut state) = get_block::<T, _>(mutate_builder);\\n\\n\\n\\n /*\\n\\n * Control check to ensure the valid block should pass verification.\\n\\n */\\n\\n\\n\\n assert_eq!(\\n\\n per_block_processing(\\n\\n &mut state.clone(),\\n\\n &block,\\n\\n None,\\n\\n BlockSignatureStrategy::VerifyIndividual,\\n\\n spec\\n\\n ),\\n\",\n \"file_path\": \"consensus/state_processing/tests/tests.rs\",\n \"rank\": 81,\n \"score\": 218096.670977519\n },\n {\n \"content\": \"fn do_round(seed: &[u8], index: usize, pivot: usize, round: u8, list_size: usize) -> Option<usize> {\\n\\n let flip = (pivot + (list_size - index)) % list_size;\\n\\n let position = max(index, flip);\\n\\n let source = hash_with_round_and_position(seed, round, position);\\n\\n let byte = source[(position % 256) / 8];\\n\\n let bit = (byte >> (position % 8)) % 2;\\n\\n Some(if bit == 1 { flip } else { index })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/swap_or_not_shuffle/src/compute_shuffled_index.rs\",\n \"rank\": 82,\n \"score\": 217937.25936256032\n },\n {\n \"content\": \"/// Loads a list of keypairs from file.\\n\\npub fn load_keypairs_from_yaml(path: PathBuf) -> Result<Vec<Keypair>, String> {\\n\\n keypairs_from_yaml_file(path)\\n\\n}\\n\",\n \"file_path\": \"consensus/types/src/test_utils/generate_deterministic_keypairs.rs\",\n \"rank\": 83,\n \"score\": 216969.0008618427\n },\n {\n \"content\": \"pub fn u64_leaf_count(len: usize) -> usize {\\n\\n let type_size = size_of::<u64>();\\n\\n let vals_per_chunk = BYTES_PER_CHUNK / type_size;\\n\\n\\n\\n (len + vals_per_chunk - 1) / vals_per_chunk\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/cached_tree_hash/src/impls.rs\",\n \"rank\": 84,\n \"score\": 216852.93125966343\n },\n {\n \"content\": \"pub fn hash256_leaf_count(len: usize) -> usize {\\n\\n len\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/cached_tree_hash/src/impls.rs\",\n \"rank\": 85,\n \"score\": 216852.93125966343\n },\n {\n \"content\": \"fn get_state<E: EthSpec>(validator_count: usize) -> BeaconState<E> {\\n\\n let spec = &E::default_spec();\\n\\n let eth1_data = Eth1Data {\\n\\n deposit_root: Hash256::zero(),\\n\\n deposit_count: 0,\\n\\n block_hash: Hash256::zero(),\\n\\n };\\n\\n\\n\\n let mut state = BeaconState::new(0, eth1_data, spec);\\n\\n\\n\\n for i in 0..validator_count {\\n\\n state.balances.push(i as u64).expect(\\\"should add balance\\\");\\n\\n }\\n\\n\\n\\n state.validators = (0..validator_count)\\n\\n .collect::<Vec<_>>()\\n\\n .par_iter()\\n\\n .map(|&i| Validator {\\n\\n pubkey: generate_deterministic_keypair(i).pk.into(),\\n\\n withdrawal_credentials: Hash256::from_low_u64_le(i as u64),\\n\",\n \"file_path\": \"beacon_node/store/benches/benches.rs\",\n \"rank\": 86,\n \"score\": 213945.07175198797\n },\n {\n \"content\": \"pub fn parse_u64(matches: &ArgMatches, name: &'static str) -> Result<u64, String> {\\n\\n matches\\n\\n .value_of(name)\\n\\n .ok_or_else(|| format!(\\\"{} not specified\\\", name))?\\n\\n .parse::<u64>()\\n\\n .map_err(|e| format!(\\\"Unable to parse {}: {}\\\", name, e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lcli/src/helpers.rs\",\n \"rank\": 87,\n \"score\": 213167.60630401192\n },\n {\n \"content\": \"pub fn parse_address(matches: &ArgMatches, name: &'static str) -> Result<Address, String> {\\n\\n matches\\n\\n .value_of(name)\\n\\n .ok_or_else(|| format!(\\\"{} not specified\\\", name))\\n\\n .and_then(|val| {\\n\\n if val.starts_with(\\\"0x\\\") {\\n\\n val[2..]\\n\\n .parse()\\n\\n .map_err(|e| format!(\\\"Unable to parse {}: {:?}\\\", name, e))\\n\\n } else {\\n\\n Err(format!(\\\"Unable to parse {}, must have 0x prefix\\\", name))\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lcli/src/helpers.rs\",\n \"rank\": 88,\n \"score\": 213167.60630401192\n },\n {\n \"content\": \"/// According to unicode, every byte that starts with 0b10xxxxxx continues encoding of character\\n\\n/// Therefore the number of characters equals number of bytes minus number of 0b10xxxxxx bytes\\n\\nfn count_unicode_characters(bits: &[u8]) -> usize {\\n\\n bits.iter().filter(|bit| *bit >> 6 != 2).count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/account_utils/src/lib.rs\",\n \"rank\": 89,\n \"score\": 211596.67335140437\n },\n {\n \"content\": \"/// Returns `false` for a timestamp that would result in a genesis time that is earlier than\\n\\n/// `MIN_GENESIS_TIME`.\\n\\nfn timestamp_can_trigger_genesis(timestamp: u64, spec: &ChainSpec) -> Result<bool, String> {\\n\\n eth2_genesis_time(timestamp, spec)\\n\\n .map(|t| t >= spec.min_genesis_time)\\n\\n .map_err(|e| format!(\\\"Arith error when during genesis calculation: {:?}\\\", e))\\n\\n}\\n\",\n \"file_path\": \"beacon_node/genesis/src/eth1_genesis_service.rs\",\n \"rank\": 90,\n \"score\": 210478.5803625136\n },\n {\n \"content\": \"fn hash_with_round_and_position(seed: &[u8], round: u8, position: usize) -> Hash256 {\\n\\n let mut context = Context::new(&SHA256);\\n\\n\\n\\n context.update(seed);\\n\\n context.update(&[round]);\\n\\n /*\\n\\n * Note: the specification has an implicit assertion in `int_to_bytes4` that `position / 256 <\\n\\n * 2**24`. For efficiency, we do not check for that here as it is checked in `compute_shuffled_index`.\\n\\n */\\n\\n context.update(&(position / 256).to_le_bytes()[0..4]);\\n\\n\\n\\n let digest = context.finish();\\n\\n Hash256::from_slice(digest.as_ref())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/swap_or_not_shuffle/src/compute_shuffled_index.rs\",\n \"rank\": 91,\n \"score\": 209103.37545549657\n },\n {\n \"content\": \"/// Returns true if some field has an attribute declaring it should not be serialized.\\n\\n///\\n\\n/// The field attribute is: `#[ssz(skip_serializing)]`\\n\\nfn should_skip_serializing(field: &syn::Field) -> bool {\\n\\n field.attrs.iter().any(|attr| {\\n\\n attr.path.is_ident(\\\"ssz\\\")\\n\\n && attr.tokens.to_string().replace(\\\" \\\", \\\"\\\") == \\\"(skip_serializing)\\\"\\n\\n })\\n\\n}\\n\\n\\n\\n/// Implements `ssz::Encode` for some `struct`.\\n\\n///\\n\\n/// Fields are encoded in the order they are defined.\\n\\n///\\n\\n/// ## Field attributes\\n\\n///\\n\\n/// - `#[ssz(skip_serializing)]`: the field will not be serialized.\\n\",\n \"file_path\": \"consensus/ssz_derive/src/lib.rs\",\n \"rank\": 92,\n \"score\": 208475.0808852706\n },\n {\n \"content\": \"/// Interprets `bytes` as a big-endian integer and returns that integer modulo the order of the\\n\\n/// BLS-381 curve.\\n\\n///\\n\\n/// This function is a part of the `HKDF_mod_r` function in EIP-2333.\\n\\nfn mod_r(bytes: &[u8]) -> ZeroizeHash {\\n\\n let n = BigUint::from_bytes_be(bytes);\\n\\n let r = BigUint::parse_bytes(R.as_bytes(), 10).expect(\\\"must be able to parse R\\\");\\n\\n let x = SecretBytes::from((n % r).to_bytes_be());\\n\\n\\n\\n let x_slice = x.as_bytes();\\n\\n\\n\\n debug_assert!(x_slice.len() <= HASH_SIZE);\\n\\n\\n\\n let mut output = ZeroizeHash::zero();\\n\\n output.as_mut_bytes()[HASH_SIZE - x_slice.len()..].copy_from_slice(&x_slice);\\n\\n output\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crypto/eth2_key_derivation/src/derived_key.rs\",\n \"rank\": 93,\n \"score\": 208383.59890618623\n },\n {\n \"content\": \"fn bytes_to_int64(slice: &[u8]) -> u64 {\\n\\n let mut bytes = [0; 8];\\n\\n bytes.copy_from_slice(&slice[0..8]);\\n\\n u64::from_le_bytes(bytes)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use ethereum_types::H256 as Hash256;\\n\\n\\n\\n #[test]\\n\\n #[ignore]\\n\\n fn fuzz_test() {\\n\\n let max_list_size = 2_usize.pow(24);\\n\\n let test_runs = 1000;\\n\\n\\n\\n // Test at max list_size with the end index.\\n\\n for _ in 0..test_runs {\\n\\n let index = max_list_size - 1;\\n\",\n \"file_path\": \"consensus/swap_or_not_shuffle/src/compute_shuffled_index.rs\",\n \"rank\": 94,\n \"score\": 208377.95030471613\n },\n {\n \"content\": \"/// Returns the peer count, returning something helpful if it's `usize::max_value` (effectively a\\n\\n/// `None` value).\\n\\nfn peer_count_pretty(peer_count: usize) -> String {\\n\\n if peer_count == usize::max_value() {\\n\\n String::from(\\\"--\\\")\\n\\n } else {\\n\\n format!(\\\"{}\\\", peer_count)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"beacon_node/client/src/notifier.rs\",\n \"rank\": 95,\n \"score\": 208286.6356210762\n },\n {\n \"content\": \"/// Returns the value of `name` or an error if it is not in `matches` or does not parse\\n\\n/// successfully using `std::string::FromStr`.\\n\\npub fn parse_required<T>(matches: &ArgMatches, name: &str) -> Result<T, String>\\n\\nwhere\\n\\n T: FromStr,\\n\\n <T as FromStr>::Err: std::fmt::Display,\\n\\n{\\n\\n parse_optional(matches, name)?.ok_or_else(|| format!(\\\"{} not specified\\\", name))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"common/clap_utils/src/lib.rs\",\n \"rank\": 96,\n \"score\": 207917.93992575584\n },\n {\n \"content\": \"/// Ensure that the directory at `path` exists, by creating it and all parents if necessary.\\n\\nfn ensure_dir_exists(path: PathBuf) -> Result<PathBuf, String> {\\n\\n fs::create_dir_all(&path).map_err(|e| format!(\\\"Unable to create {}: {}\\\", path.display(), e))?;\\n\\n Ok(path)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use toml;\\n\\n\\n\\n #[test]\\n\\n fn serde() {\\n\\n let config = Config::default();\\n\\n let serialized = toml::to_string(&config).expect(\\\"should serde encode default config\\\");\\n\\n toml::from_str::<Config>(&serialized).expect(\\\"should serde decode default config\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"beacon_node/client/src/config.rs\",\n \"rank\": 97,\n \"score\": 207680.7636775071\n },\n {\n \"content\": \"// Check that the config from the Eth2.0 spec tests matches our minimal/mainnet config.\\n\\nfn config_test<E: EthSpec + TypeName>() {\\n\\n let config_path = PathBuf::from(env!(\\\"CARGO_MANIFEST_DIR\\\"))\\n\\n .join(\\\"eth2.0-spec-tests\\\")\\n\\n .join(\\\"tests\\\")\\n\\n .join(E::name())\\n\\n .join(\\\"config\\\")\\n\\n .join(\\\"phase0.yaml\\\");\\n\\n let yaml_config = YamlConfig::from_file(&config_path).expect(\\\"config file loads OK\\\");\\n\\n let spec = E::default_spec();\\n\\n let yaml_from_spec = YamlConfig::from_spec::<E>(&spec);\\n\\n assert_eq!(yaml_config.apply_to_chain_spec::<E>(&spec), Some(spec));\\n\\n assert_eq!(yaml_from_spec, yaml_config);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"testing/ef_tests/tests/tests.rs\",\n \"rank\": 98,\n \"score\": 207659.72885339306\n },\n {\n \"content\": \"fn shuffle_list(seed: &[u8], list_size: usize) -> Vec<usize> {\\n\\n let mut output = Vec::with_capacity(list_size);\\n\\n for i in 0..list_size {\\n\\n output.push(compute_shuffled_index(i, list_size, seed, SHUFFLE_ROUND_COUNT).unwrap());\\n\\n }\\n\\n output\\n\\n}\\n\\n\\n\",\n \"file_path\": \"consensus/swap_or_not_shuffle/benches/benches.rs\",\n \"rank\": 99,\n \"score\": 207570.6238007163\n }\n]","isConversational":false}}},{"rowIdx":1190,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/developer/ffx/plugins/setui/display/src/lib.rs"},"repo_name":{"kind":"string","value":"allansrc/fuchsia"},"commit":{"kind":"string","value":"a2c235b33fc4305044d496354a08775f30cdcf37"},"file_code":{"kind":"string","value":"\n\nuse anyhow::Result;\nuse ffx_core::ffx_plugin;\nuse ffx_setui_display_args::Display;\nuse fidl_fuchsia_settings::{DisplayProxy, DisplaySettings};\nuse utils::handle_mixed_result;\nuse utils::{self, Either, WatchOrSetResult};\n\n#[ffx_plugin(\"setui\", DisplayProxy = \"core/setui_service:expose:fuchsia.settings.Display\")]\npub async fn run_command(display_proxy: DisplayProxy, display: Display) -> Result<()> {\n handle_mixed_result(\"Display\", command(display_proxy, DisplaySettings::from(display)).await)\n .await\n}\n\nasync fn command(proxy: DisplayProxy, settings: DisplaySettings) -> WatchOrSetResult {\n if settings == DisplaySettings::EMPTY {\n Ok(Either::Watch(utils::watch_to_stream(proxy, |p| p.watch())))\n } else {\n Ok(Either::Set(if let Err(err) = proxy.set(settings.clone()).await? {\n format!(\"{:?}\", err)\n } else {\n format!(\"Successfully set Display to {:?}\", Display::from(settings))\n }))\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use fidl_fuchsia_settings::{DisplayRequest, LowLightMode, Theme, ThemeMode, ThemeType};\n use futures::prelude::*;\n use test_case::test_case;\n\n #[fuchsia_async::run_singlethreaded(test)]\n async fn test_run_command() {\n let proxy = setup_fake_display_proxy(move |req| match req {\n DisplayRequest::Set { responder, .. } => {\n let _ = responder.send(&mut Ok(()));\n }\n DisplayRequest::Watch { .. } => {\n panic!(\"Unexpected call to watch\");\n }\n DisplayRequest::WatchLightSensor { .. } => {\n panic!(\"Unexpected call to watch light sensor\");\n }\n });\n\n let display = Display {\n brightness: None,\n auto_brightness_level: None,\n auto_brightness: Some(true),\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n let response = run_command(proxy, display).await;\n assert!(response.is_ok());\n }\n\n #[test_case(\n Display {\n brightness: Some(0.5),\n auto_brightness_level: None,\n auto_brightness: Some(false),\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n \"Test display set() output with non-empty input.\"\n )]\n #[test_case(\n Display {\n brightness: None,\n auto_brightness_level: Some(0.8),\n auto_brightness: Some(true),\n low_light_mode: Some(LowLightMode::Enable),\n theme: Some(Theme {\n theme_type: Some(ThemeType::Dark),\n theme_mode: Some(ThemeMode::AUTO),\n ..Theme::EMPTY\n }),\n screen_enabled: Some(true),\n };\n \"Test display set() output with a different non-empty input.\"\n )]\n #[fuchsia_async::run_singlethreaded(test)]\n async fn validate_display_set_output(expected_display: Display) -> Result<()> {\n let proxy = setup_fake_display_proxy(move |req| match req {\n DisplayRequest::Set { responder, .. } => {\n let _ = responder.send(&mut Ok(()));\n }\n DisplayRequest::Watch { .. } => {\n panic!(\"Unexpected call to watch\");\n }\n DisplayRequest::WatchLightSensor { .. } => {\n panic!(\"Unexpected call to watch light sensor\");\n }\n });\n\n let output =\n utils::assert_set!(command(proxy, DisplaySettings::from(expected_display.clone())));\n assert_eq!(output, format!(\"Successfully set Display to {:?}\", expected_display));\n Ok(())\n }\n\n #[test_case(\n Display {\n brightness: None,\n auto_brightness_level: None,\n auto_brightness: None,\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n \"Test display watch() output with empty input.\"\n )]\n #[test_case(\n Display {\n brightness: Some(0.5),\n auto_brightness_level: None,\n auto_brightness: Some(false),\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n \"Test display watch() output with non-empty input.\"\n )]\n #[fuchsia_async::run_singlethreaded(test)]\n async fn validate_display_watch_output(expected_display: Display) -> Result<()> {\n let expected_display_clone = expected_display.clone();\n let proxy = setup_fake_display_proxy(move |req| match req {\n DisplayRequest::Set { .. } => {\n panic!(\"Unexpected call to set\");\n }\n DisplayRequest::Watch { responder } => {\n let _ = responder.send(DisplaySettings::from(expected_display.clone()));\n }\n DisplayRequest::WatchLightSensor { .. } => {\n panic!(\"Unexpected call to watch light sensor\");\n }\n });\n\n let output = utils::assert_watch!(command(\n proxy,\n DisplaySettings::from(Display {\n brightness: None,\n auto_brightness_level: None,\n auto_brightness: None,\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n })\n ));\n assert_eq!(output, format!(\"{:#?}\", DisplaySettings::from(expected_display_clone)));\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse anyhow::Result;\nuse ffx_core::ffx_plugin;\nuse ffx_setui_display_args::Display;\nuse fidl_fuchsia_settings::{DisplayProxy, DisplaySettings};\nuse utils::handle_mixed_result;\nuse utils::{self, Either, WatchOrSetResult};\n\n#[ffx_plugin(\"setui\", DisplayProxy = \"core/setui_service:expose:fuchsia.settings.Display\")]\npub async fn run_command(display_proxy: DisplayProxy, display: Display) -> Result<()> {\n handle_mixed_result(\"Display\", command(display_proxy, DisplaySettings::from(display)).await)\n .await\n}\n\nasync fn command(proxy: DisplayProxy, settings: DisplaySettings) -> WatchOrSetResult {\n if settings == DisplaySettings::EMPTY {\n Ok(Either::Watch(utils::watch_to_stream(proxy, |p| p.watch())))\n } else {\n Ok(Either::Set(if let Err(err) = proxy.set(settings.clone()).await? {\n format!(\"{:?}\", err)\n } else {\n format!(\"Successfully set Display to {:?}\", Display::from(settings))\n }))\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use fidl_fuchsia_settings::{DisplayRequest, LowLightMode, Theme, ThemeMode, ThemeType};\n use futures::prelude::*;\n use test_case::test_case;\n\n #[fuchsia_async::run_singlethreaded(test)]\n async fn test_run_command() {\n let proxy = setup_fake_display_proxy(move |req| match req {\n DisplayRequest::Set { responder, .. } => {\n let _ = responder.send(&mut Ok(()));\n }\n DisplayRequest::Watch { .. } => {\n panic!(\"Unexpected call to watch\");\n }\n DisplayRequest::WatchLightSensor { .. } => {\n panic!(\"Unexpected call to watch light sensor\");\n }\n });\n\n let display = Display {\n brightness: None,\n auto_brightness_level: None,\n auto_brightness: Some(true),\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n let response = run_command(proxy, display).await;\n assert!(response.is_ok());\n }\n\n #[test_case(\n Display {\n brightness: Some(0.5),\n auto_brightness_level: None,\n auto_brightness: Some(false),\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n \"Test display set() output with non-empty input.\"\n )]\n #[test_case(\n Display {\n brightness: None,\n auto_brightness_level: Some(0.8),\n auto_brightness: Some(true),\n low_light_mode: Some(LowLightMode::Enable),\n theme: Some(Theme {\n theme_type: Some(ThemeType::Dark),\n theme_mode: Some(ThemeMode::AUTO),\n ..Theme::EMPTY\n }),\n screen_enabled: Some(true),\n };\n \"Test display set() output with a different non-empty input.\"\n )]\n #[fuchsia_async::run_singlethreaded(test)]\n "},"suffix":{"kind":"string","value":"\n\n #[test_case(\n Display {\n brightness: None,\n auto_brightness_level: None,\n auto_brightness: None,\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n \"Test display watch() output with empty input.\"\n )]\n #[test_case(\n Display {\n brightness: Some(0.5),\n auto_brightness_level: None,\n auto_brightness: Some(false),\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n };\n \"Test display watch() output with non-empty input.\"\n )]\n #[fuchsia_async::run_singlethreaded(test)]\n async fn validate_display_watch_output(expected_display: Display) -> Result<()> {\n let expected_display_clone = expected_display.clone();\n let proxy = setup_fake_display_proxy(move |req| match req {\n DisplayRequest::Set { .. } => {\n panic!(\"Unexpected call to set\");\n }\n DisplayRequest::Watch { responder } => {\n let _ = responder.send(DisplaySettings::from(expected_display.clone()));\n }\n DisplayRequest::WatchLightSensor { .. } => {\n panic!(\"Unexpected call to watch light sensor\");\n }\n });\n\n let output = utils::assert_watch!(command(\n proxy,\n DisplaySettings::from(Display {\n brightness: None,\n auto_brightness_level: None,\n auto_brightness: None,\n low_light_mode: None,\n theme: None,\n screen_enabled: None,\n })\n ));\n assert_eq!(output, format!(\"{:#?}\", DisplaySettings::from(expected_display_clone)));\n Ok(())\n }\n}\n"},"middle":{"kind":"string","value":"async fn validate_display_set_output(expected_display: Display) -> Result<()> {\n let proxy = setup_fake_display_proxy(move |req| match req {\n DisplayRequest::Set { responder, .. } => {\n let _ = responder.send(&mut Ok(()));\n }\n DisplayRequest::Watch { .. } => {\n panic!(\"Unexpected call to watch\");\n }\n DisplayRequest::WatchLightSensor { .. } => {\n panic!(\"Unexpected call to watch light sensor\");\n }\n });\n\n let output =\n utils::assert_set!(command(proxy, DisplaySettings::from(expected_display.clone())));\n assert_eq!(output, format!(\"Successfully set Display to {:?}\", expected_display));\n Ok(())\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1191,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/setup_config.rs"},"repo_name":{"kind":"string","value":"amarant/msvc-helper"},"commit":{"kind":"string","value":"27821c5cdbfdebcae94342f8b6662791f1e78b02"},"file_code":{"kind":"string","value":"\n\n#![allow(bad_style)]\n\nuse std::ffi::OsString;\nuse std::ptr::null_mut;\nuse std::fmt;\n\nuse winapi::Interface;\nuse winapi::shared::minwindef::{LPFILETIME, ULONG};\nuse winapi::shared::winerror::S_FALSE;\nuse winapi::shared::wtypes::BSTR;\nuse winapi::shared::wtypesbase::LPCOLESTR;\nuse winapi::um::combaseapi::{CoCreateInstance, CLSCTX_ALL};\nuse winapi::um::oaidl::LPSAFEARRAY;\nuse winapi::um::unknwnbase::{IUnknown, IUnknownVtbl};\nuse winapi::um::winnt::{HRESULT, LCID, LPCWSTR, PULONGLONG};\nuse winapi::um::combaseapi::CoInitializeEx;\nuse winapi::um::objbase::COINIT_MULTITHREADED;\n\nuse utils::BStr;\nuse wio::com::ComPtr;\n\nENUM!{enum InstanceState {\n eNone = 0,\n eLocal = 1,\n eRegistered = 2,\n eNoRebootRequired = 4,\n eComplete = -1i32 as u32,\n}}\nRIDL!{#[uuid(0xb41463c3, 0x8866, 0x43b5, 0xbc, 0x33, 0x2b, 0x06, 0x76, 0xf7, 0xf4, 0x2e)]\ninterface ISetupInstance(ISetupInstanceVtbl): IUnknown(IUnknownVtbl) {\n fn GetInstanceId(\n pbstrInstanceId: *mut BSTR,\n ) -> HRESULT,\n fn GetInstallDate(\n pInstallDate: LPFILETIME,\n ) -> HRESULT,\n fn GetInstallationName(\n pbstrInstallationName: *mut BSTR,\n ) -> HRESULT,\n fn GetInstallationPath(\n pbstrInstallationPath: *mut BSTR,\n ) -> HRESULT,\n fn GetInstallationVersion(\n pbstrInstallationVersion: *mut BSTR,\n ) -> HRESULT,\n fn GetDisplayName(\n lcid: LCID,\n pbstrDisplayName: *mut BSTR,\n ) -> HRESULT,\n fn GetDescription(\n lcid: LCID,\n pbstrDescription: *mut BSTR,\n ) -> HRESULT,\n fn ResolvePath(\n pwszRelativePath: LPCOLESTR,\n pbstrAbsolutePath: *mut BSTR,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x89143c9a, 0x05af, 0x49b0, 0xb7, 0x17, 0x72, 0xe2, 0x18, 0xa2, 0x18, 0x5c)]\ninterface ISetupInstance2(ISetupInstance2Vtbl): ISetupInstance(ISetupInstanceVtbl) {\n fn GetState(\n pState: *mut InstanceState,\n ) -> HRESULT,\n fn GetPackages(\n ppsaPackages: *mut LPSAFEARRAY,\n ) -> HRESULT,\n fn GetProduct(\n ppPackage: *mut *mut ISetupPackageReference,\n ) -> HRESULT,\n fn GetProductPath(\n pbstrProductPath: *mut BSTR,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x6380bcff, 0x41d3, 0x4b2e, 0x8b, 0x2e, 0xbf, 0x8a, 0x68, 0x10, 0xc8, 0x48)]\ninterface IEnumSetupInstances(IEnumSetupInstancesVtbl): IUnknown(IUnknownVtbl) {\n fn Next(\n celt: ULONG,\n rgelt: *mut *mut ISetupInstance,\n pceltFetched: *mut ULONG,\n ) -> HRESULT,\n fn Skip(\n celt: ULONG,\n ) -> HRESULT,\n fn Reset() -> HRESULT,\n fn Clone(\n ppenum: *mut *mut IEnumSetupInstances,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x42843719, 0xdb4c, 0x46c2, 0x8e, 0x7c, 0x64, 0xf1, 0x81, 0x6e, 0xfd, 0x5b)]\ninterface ISetupConfiguration(ISetupConfigurationVtbl): IUnknown(IUnknownVtbl) {\n fn EnumInstances(\n ppEnumInstances: *mut *mut IEnumSetupInstances,\n ) -> HRESULT,\n fn GetInstanceForCurrentProcess(\n ppInstance: *mut *mut ISetupInstance,\n ) -> HRESULT,\n fn GetInstanceForPath(\n wzPath: LPCWSTR,\n ppInstance: *mut *mut ISetupInstance,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x26aab78c, 0x4a60, 0x49d6, 0xaf, 0x3b, 0x3c, 0x35, 0xbc, 0x93, 0x36, 0x5d)]\ninterface ISetupConfiguration2(ISetupConfiguration2Vtbl):\n ISetupConfiguration(ISetupConfigurationVtbl) {\n fn EnumAllInstances(\n ppEnumInstances: *mut *mut IEnumSetupInstances,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0xda8d8a16, 0xb2b6, 0x4487, 0xa2, 0xf1, 0x59, 0x4c, 0xcc, 0xcd, 0x6b, 0xf5)]\ninterface ISetupPackageReference(ISetupPackageReferenceVtbl): IUnknown(IUnknownVtbl) {\n fn GetId(\n pbstrId: *mut BSTR,\n ) -> HRESULT,\n fn GetVersion(\n pbstrVersion: *mut BSTR,\n ) -> HRESULT,\n fn GetChip(\n pbstrChip: *mut BSTR,\n ) -> HRESULT,\n fn GetLanguage(\n pbstrLanguage: *mut BSTR,\n ) -> HRESULT,\n fn GetBranch(\n pbstrBranch: *mut BSTR,\n ) -> HRESULT,\n fn GetType(\n pbstrType: *mut BSTR,\n ) -> HRESULT,\n fn GetUniqueId(\n pbstrUniqueId: *mut BSTR,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x42b21b78, 0x6192, 0x463e, 0x87, 0xbf, 0xd5, 0x77, 0x83, 0x8f, 0x1d, 0x5c)]\ninterface ISetupHelper(ISetupHelperVtbl): IUnknown(IUnknownVtbl) {\n fn ParseVersion(\n pwszVersion: LPCOLESTR,\n pullVersion: PULONGLONG,\n ) -> HRESULT,\n fn ParseVersionRange(\n pwszVersionRange: LPCOLESTR,\n pullMinVersion: PULONGLONG,\n pullMaxVersion: PULONGLONG,\n ) -> HRESULT,\n}}\nDEFINE_GUID!{CLSID_SetupConfiguration,\n0x177f0c4a, 0x1cd3, 0x4de7, 0xa3, 0x2c, 0x71, 0xdb, 0xbb, 0x9f, 0xa3, 0x6d}\n\npub fn initialize_com() -> Result<i32, i32> {\n let err = unsafe { CoInitializeEx(null_mut(), COINIT_MULTITHREADED) };\n if err < 0 {\n return Err(err);\n }\n Ok(err)\n}\n\nlazy_static! {\n static ref COM_INIT: Result<i32, i32> = {\n initialize_com()\n };\n}\n\npub struct SetupConfiguration(ComPtr<ISetupConfiguration>);\nimpl SetupConfiguration {\n pub fn new() -> Result<SetupConfiguration, i32> {\n if let Err(i) = *COM_INIT {\n return Err(i);\n }\n let mut obj = null_mut();\n let err = unsafe {\n CoCreateInstance(\n &CLSID_SetupConfiguration,\n null_mut(),\n CLSCTX_ALL,\n &ISetupConfiguration::uuidof(),\n &mut obj,\n )\n };\n if err < 0 {\n return Err(err);\n }\n let obj = unsafe { ComPtr::from_raw(obj as *mut ISetupConfiguration) };\n Ok(SetupConfiguration(obj))\n }\n pub fn get_instance_for_current_process(&self) -> Result<SetupInstance, i32> {\n let mut obj = null_mut();\n let err = unsafe { self.0.GetInstanceForCurrentProcess(&mut obj) };\n if err < 0 {\n return Err(err);\n }\n Ok(unsafe { SetupInstance::from_raw(obj) })\n }\n pub fn enum_instances(&self) -> Result<EnumSetupInstances, i32> {\n let mut obj = null_mut();\n let err = unsafe { self.0.EnumInstances(&mut obj) };\n if err < 0 {\n return Err(err);\n }\n Ok(unsafe { EnumSetupInstances::from_raw(obj) })\n }\n pub fn enum_all_instances(&self) -> Result<EnumSetupInstances, i32> {\n let mut obj = null_mut();\n let this = try!(self.0.cast::<ISetupConfiguration2>());\n let err = unsafe { this.EnumAllInstances(&mut obj) };\n if err < 0 {\n return Err(err);\n }\n Ok(unsafe { EnumSetupInstances::from_raw(obj) })\n }\n}\npub struct SetupInstance(ComPtr<ISetupInstance>);\nimpl SetupInstance {\n pub unsafe fn from_raw(obj: *mut ISetupInstance) -> SetupInstance {\n SetupInstance(ComPtr::from_raw(obj))\n }\n pub fn instance_id(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstanceId(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn installation_name(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstallationName(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn installation_path(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstallationPath(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn installation_version(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstallationVersion(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn product_path(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let this = try!(self.0.cast::<ISetupInstance2>());\n let err = unsafe { this.GetProductPath(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n}\n\nimpl fmt::Debug for SetupInstance {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(\n f,\n \"Setup Instance {{ instance_id: {:?}, installation_name: {:?}, installation_path: {:?}, installation_version: {:?}, product_path: {:?}}}\",\n self.instance_id(),\n self.installation_name(),\n self.installation_path(),\n self.installation_version(),\n self.product_path(),\n )\n }\n}\n\nfn displayRes(res: Result<OsString, i32>) -> String {\n match res {\n Ok(s) => match s.into_string() {\n Ok(s) => s,\n Err(_) => \"Error\".into(),\n },\n Err(i) => format!(\"Error: {}\", i),\n }\n}\n\nimpl fmt::Display for SetupInstance {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"Instance id: {}, Installation name: {}, Installation path: {}, Installation version: {}, Product path: {}\", \n displayRes(self.instance_id()),\n displayRes(self.installation_name()),\n displayRes(self.installation_path()),\n displayRes(self.installation_version()),\n displayRes(self.product_path())\n )\n }\n}\n\npub struct EnumSetupInstances(ComPtr<IEnumSetupInstances>);\nimpl EnumSetupInstances {\n pub unsafe fn from_raw(obj: *mut IEnumSetupInstances) -> EnumSetupInstances {\n EnumSetupInstances(ComPtr::from_raw(obj))\n }\n}\nimpl Iterator for EnumSetupInstances {\n type Item = Result<SetupInstance, i32>;\n fn next(&mut self) -> Option<Result<SetupInstance, i32>> {\n let mut obj = null_mut();\n let err = unsafe { self.0.Next(1, &mut obj, null_mut()) };\n if err < 0 {\n return Some(Err(err));\n }\n if err == S_FALSE {\n return None;\n }\n Some(Ok(unsafe { SetupInstance::from_raw(obj) }))\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#![allow(bad_style)]\n\nuse std::ffi::OsString;\nuse std::ptr::null_mut;\nuse std::fmt;\n\nuse winapi::Interface;\nuse winapi::shared::minwindef::{LPFILETIME, ULONG};\nuse winapi::shared::winerror::S_FALSE;\nuse winapi::shared::wtypes::BSTR;\nuse winapi::shared::wtypesbase::LPCOLESTR;\nuse winapi::um::combaseapi::{CoCreateInstance, CLSCTX_ALL};\nuse winapi::um::oaidl::LPSAFEARRAY;\nuse winapi::um::unknwnbase::{IUnknown, IUnknownVtbl};\nuse winapi::um::winnt::{HRESULT, LCID, LPCWSTR, PULONGLONG};\nuse winapi::um::combaseapi::CoInitializeEx;\nuse winapi::um::objbase::COINIT_MULTITHREADED;\n\nuse utils::BStr;\nuse wio::com::ComPtr;\n\nENUM!{enum InstanceState {\n eNone = 0,\n eLocal = 1,\n eRegistered = 2,\n eNoRebootRequired = 4,\n eComplete = -1i32 as u32,\n}}\nRIDL!{#[uuid(0xb41463c3, 0x8866, 0x43b5, 0xbc, 0x33, 0x2b, 0x06, 0x76, 0xf7, 0xf4, 0x2e)]\ninterface ISetupInstance(ISetupInstanceVtbl): IUnknown(IUnknownVtbl) {\n fn GetInstanceId(\n pbstrInstanceId: *mut BSTR,\n ) -> HRESULT,\n fn GetInstallDate(\n pInstallDate: LPFILETIME,\n ) -> HRESULT,\n fn GetInstallationName(\n pbstrInstallationName: *mut BSTR,\n ) -> HRESULT,\n fn GetInstallationPath(\n pbstrInstallationPath: *mut BSTR,\n ) -> HRESULT,\n fn GetInstallationVersion(\n pbstrInstallationVersion: *mut BSTR,\n ) -> HRESULT,\n fn GetDisplayName(\n lcid: LCID,\n pbstrDisplayName: *mut BSTR,\n ) -> HRESULT,\n fn GetDescription(\n lcid: LCID,\n pbstrDescription: *mut BSTR,\n ) -> HRESULT,\n fn ResolvePath(\n pwszRelativePath: LPCOLESTR,\n pbstrAbsolutePath: *mut BSTR,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x89143c9a, 0x05af, 0x49b0, 0xb7, 0x17, 0x72, 0xe2, 0x18, 0xa2, 0x18, 0x5c)]\ninterface ISetupInstance2(ISetupInstance2Vtbl): ISetupInstance(ISetupInstanceVtbl) {\n fn GetState(\n pState: *mut InstanceState,\n ) -> HRESULT,\n fn GetPackages(\n ppsaPackages: *mut LPSAFEARRAY,\n ) -> HRESULT,\n fn GetProduct(\n ppPackage: *mut *mut ISetupPackageReference,\n ) -> HRESULT,\n fn GetProductPath(\n pbstrProductPath: *mut BSTR,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x6380bcff, 0x41d3, 0x4b2e, 0x8b, 0x2e, 0xbf, 0x8a, 0x68, 0x10, 0xc8, 0x48)]\ninterface IEnumSetupInstances(IEnumSetupInstancesVtbl): IUnknown(IUnknownVtbl) {\n fn Next(\n celt: ULONG,\n rgelt: *mut *mut ISetupInstance,\n pceltFetched: *mut ULONG,\n ) -> HRESULT,\n fn Skip(\n celt: ULONG,\n ) -> HRESULT,\n fn Reset() -> HRESULT,\n fn Clone(\n ppenum: *mut *mut IEnumSetupInstances,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x42843719, 0xdb4c, 0x46c2, 0x8e, 0x7c, 0x64, 0xf1, 0x81, 0x6e, 0xfd, 0x5b)]\ninterface ISetupConfiguration(ISetupConfigurationVtbl): IUnknown(IUnknownVtbl) {\n fn EnumInstances(\n ppEnumInstances: *mut *mut IEnumSetupInstances,\n ) -> HRESULT,\n fn GetInstanceForCurrentProcess(\n ppInstance: *mut *mut ISetupInstance,\n ) -> HRESULT,\n fn GetInstanceForPath(\n wzPath: LPCWSTR,\n ppInstance: *mut *mut ISetupInstance,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x26aab78c, 0x4a60, 0x49d6, 0xaf, 0x3b, 0x3c, 0x35, 0xbc, 0x93, 0x36, 0x5d)]\ninterface ISetupConfiguration2(ISetupConfiguration2Vtbl):\n ISetupConfiguration(ISetupConfigurationVtbl) {\n fn EnumAllInstances(\n ppEnumInstances: *mut *mut IEnumSetupInstances,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0xda8d8a16, 0xb2b6, 0x4487, 0xa2, 0xf1, 0x59, 0x4c, 0xcc, 0xcd, 0x6b, 0xf5)]\ninterface ISetupPackageReference(ISetupPackageReferenceVtbl): IUnknown(IUnknownVtbl) {\n fn GetId(\n pbstrId: *mut BSTR,\n ) -> HRESULT,\n fn GetVersion(\n pbstrVersion: *mut BSTR,\n ) -> HRESULT,\n fn GetChip(\n pbstrChip: *mut BSTR,\n ) -> HRESULT,\n fn GetLanguage(\n pbstrLanguage: *mut BSTR,\n ) -> HRESULT,\n fn GetBranch(\n pbstrBranch: *mut BSTR,\n ) -> HRESULT,\n fn GetType(\n pbstrType: *mut BSTR,\n ) -> HRESULT,\n fn GetUniqueId(\n pbstrUniqueId: *mut BSTR,\n ) -> HRESULT,\n}}\nRIDL!{#[uuid(0x42b21b78, 0x6192, 0x463e, 0x87, 0xbf, 0xd5, 0x77, 0x83, 0x8f, 0x1d, 0x5c)]\ninterface ISetupHelper(ISetupHelperVtbl): IUnknown(IUnknownVtbl) {\n fn ParseVersion(\n pwszVersion: LPCOLESTR,\n pullVersion: PULONGLONG,\n ) -> HRESULT,\n fn ParseVersionRange(\n pwszVersionRange: LPCOLESTR,\n pullMinVersion: PULONGLONG,\n pullMaxVersion: PULONGLONG,\n ) -> HRESULT,\n}}\nDEFINE_GUID!{CLSID_SetupConfiguration,\n0x177f0c4a, 0x1cd3, 0x4de7, 0xa3, 0x2c, 0x71, 0xdb, 0xbb, 0x9f, 0xa3, 0x6d}\n\npub fn initialize_com() -> Result<i32, i32> {\n let err = unsafe { CoInitializeEx(null_mut(), COINIT_MULTITHREADED) };\n if err < 0 {\n return Err(err);\n }\n Ok(err)\n}\n\nlazy_static! {\n static ref COM_INIT: Result<i32, i32> = {\n initialize_com()\n };\n}\n\npub struct SetupConfiguration(ComPtr<ISetupConfiguration>);\nimpl SetupConfiguration {\n pub fn new() -> Result<SetupConfiguration, i32> {\n if let Err(i) = *COM_INIT {\n return Err(i);\n }\n let mut obj = null_mut();\n let err = unsafe {\n "},"suffix":{"kind":"string","value":"\n };\n if err < 0 {\n return Err(err);\n }\n let obj = unsafe { ComPtr::from_raw(obj as *mut ISetupConfiguration) };\n Ok(SetupConfiguration(obj))\n }\n pub fn get_instance_for_current_process(&self) -> Result<SetupInstance, i32> {\n let mut obj = null_mut();\n let err = unsafe { self.0.GetInstanceForCurrentProcess(&mut obj) };\n if err < 0 {\n return Err(err);\n }\n Ok(unsafe { SetupInstance::from_raw(obj) })\n }\n pub fn enum_instances(&self) -> Result<EnumSetupInstances, i32> {\n let mut obj = null_mut();\n let err = unsafe { self.0.EnumInstances(&mut obj) };\n if err < 0 {\n return Err(err);\n }\n Ok(unsafe { EnumSetupInstances::from_raw(obj) })\n }\n pub fn enum_all_instances(&self) -> Result<EnumSetupInstances, i32> {\n let mut obj = null_mut();\n let this = try!(self.0.cast::<ISetupConfiguration2>());\n let err = unsafe { this.EnumAllInstances(&mut obj) };\n if err < 0 {\n return Err(err);\n }\n Ok(unsafe { EnumSetupInstances::from_raw(obj) })\n }\n}\npub struct SetupInstance(ComPtr<ISetupInstance>);\nimpl SetupInstance {\n pub unsafe fn from_raw(obj: *mut ISetupInstance) -> SetupInstance {\n SetupInstance(ComPtr::from_raw(obj))\n }\n pub fn instance_id(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstanceId(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn installation_name(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstallationName(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn installation_path(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstallationPath(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn installation_version(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let err = unsafe { self.0.GetInstallationVersion(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n pub fn product_path(&self) -> Result<OsString, i32> {\n let mut s = null_mut();\n let this = try!(self.0.cast::<ISetupInstance2>());\n let err = unsafe { this.GetProductPath(&mut s) };\n let bstr = unsafe { BStr::from_raw(s) };\n if err < 0 {\n return Err(err);\n }\n Ok(bstr.to_osstring())\n }\n}\n\nimpl fmt::Debug for SetupInstance {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(\n f,\n \"Setup Instance {{ instance_id: {:?}, installation_name: {:?}, installation_path: {:?}, installation_version: {:?}, product_path: {:?}}}\",\n self.instance_id(),\n self.installation_name(),\n self.installation_path(),\n self.installation_version(),\n self.product_path(),\n )\n }\n}\n\nfn displayRes(res: Result<OsString, i32>) -> String {\n match res {\n Ok(s) => match s.into_string() {\n Ok(s) => s,\n Err(_) => \"Error\".into(),\n },\n Err(i) => format!(\"Error: {}\", i),\n }\n}\n\nimpl fmt::Display for SetupInstance {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"Instance id: {}, Installation name: {}, Installation path: {}, Installation version: {}, Product path: {}\", \n displayRes(self.instance_id()),\n displayRes(self.installation_name()),\n displayRes(self.installation_path()),\n displayRes(self.installation_version()),\n displayRes(self.product_path())\n )\n }\n}\n\npub struct EnumSetupInstances(ComPtr<IEnumSetupInstances>);\nimpl EnumSetupInstances {\n pub unsafe fn from_raw(obj: *mut IEnumSetupInstances) -> EnumSetupInstances {\n EnumSetupInstances(ComPtr::from_raw(obj))\n }\n}\nimpl Iterator for EnumSetupInstances {\n type Item = Result<SetupInstance, i32>;\n fn next(&mut self) -> Option<Result<SetupInstance, i32>> {\n let mut obj = null_mut();\n let err = unsafe { self.0.Next(1, &mut obj, null_mut()) };\n if err < 0 {\n return Some(Err(err));\n }\n if err == S_FALSE {\n return None;\n }\n Some(Ok(unsafe { SetupInstance::from_raw(obj) }))\n }\n}\n"},"middle":{"kind":"string","value":"CoCreateInstance(\n &CLSID_SetupConfiguration,\n null_mut(),\n CLSCTX_ALL,\n &ISetupConfiguration::uuidof(),\n &mut obj,\n )"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"pub fn get_lasted_platform_toolset() -> Option<String> {\n\n get_toolchains()\n\n .iter()\n\n .next()\n\n .map(|v| v.platform_toolset.clone())\n\n}\n","file_path":"src/toolchain.rs","rank":1,"score":59086.79993836931},{"content":"fn os_to_res_string(res: Result<OsString, i32>) -> Result<String, Option<i32>> {\n\n match res {\n\n Ok(s) => match s.into_string() {\n\n Ok(s) => Ok(s),\n\n Err(_) => Err(None),\n\n },\n\n Err(i) => Err(Some(i)),\n\n }\n\n}\n\n\n","file_path":"src/toolchain.rs","rank":2,"score":59073.93136446357},{"content":"fn os_to_res_pathbuf(res: Result<OsString, i32>) -> Result<PathBuf, Option<i32>> {\n\n match res {\n\n Ok(s) => match s.into_string() {\n\n Ok(s) => Ok(PathBuf::from(s)),\n\n Err(_) => Err(None),\n\n },\n\n Err(i) => Err(Some(i)),\n\n }\n\n}\n\n\n","file_path":"src/toolchain.rs","rank":3,"score":58203.30645145073},{"content":"pub fn get_toolchains() -> Vec<VisualStudioInstallationInstance> {\n\n let config = SetupConfiguration::new().unwrap();\n\n let iter = config.enum_all_instances().unwrap();\n\n let mut toolchains: Vec<VisualStudioInstallationInstance> = Vec::new();\n\n for instance in iter {\n\n let mut instance: VisualStudioInstallationInstance = match instance {\n\n Ok(instance) => match transform(&instance) {\n\n Ok(instance) => instance,\n\n Err(_) => continue,\n\n },\n\n Err(_) => continue,\n\n };\n\n let installation_version = instance.installation_version.clone();\n\n let split: Vec<&str> = installation_version.split('.').collect();\n\n let major_version = split[0];\n\n let medium_version = split[1];\n\n let platform_toolset = match (major_version, medium_version) as (&str, &str) {\n\n // from http://marcofoco.com/microsoft-visual-c-version-map/\n\n (\"15\", _) => Some(\"v141\"),\n\n (\"14\", _) => Some(\"v140\"),\n","file_path":"src/toolchain.rs","rank":4,"score":57908.0456476947},{"content":"pub fn get_windows_sdk() -> Vec<WindowsSdk> {\n\n let mut windows_sdk = Vec::<WindowsSdk>::new();\n\n\n\n debug!(\"Looking for Windows 10 SDK\");\n\n if let Some(path) = get_windows_sdk_path_from_regsitry_logged(MS_REG_PATH, REG_VALUE_10) {\n\n windows_sdk = check_add_windows_10_sdk(&path, None, windows_sdk);\n\n }\n\n if let Some(path) = get_windows_sdk_path_from_regsitry_logged(WOW_REG_PATH, REG_VALUE_10) {\n\n windows_sdk = check_add_windows_10_sdk(&path, None, windows_sdk);\n\n }\n\n\n\n if let Some(program_files_path) =\n\n env::var_os(PROGRAM_FILES_ENV).and_then(|p| p.into_string().ok())\n\n {\n\n windows_sdk =\n\n check_add_windows_10_sdk(&program_files_path, Some(WIN_KITS_PATH_10), windows_sdk);\n\n }\n\n if let Some(program_files_x86_path) =\n\n env::var_os(PROGRAM_FILES_X86_ENV).and_then(|p| p.into_string().ok())\n\n {\n","file_path":"src/windows_sdk.rs","rank":5,"score":57908.0456476947},{"content":"pub fn get_latest_windows_sdk() -> Option<String> {\n\n get_windows_sdk()\n\n .iter()\n\n .next()\n\n .map(|v| v.windows_target_platform_version.clone())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n extern crate env_logger;\n\n\n\n use super::{get_windows_sdk, SdkVersion};\n\n use std::process::Command;\n\n\n\n fn get_powershell_windows_sdk_version(param_opt: Option<&str>) -> Option<String> {\n\n let mut args = Vec::new();\n\n args.push(\"powershell\\\\getWindowsSDK.ps1\");\n\n if let Some(param) = param_opt {\n\n args.push(param);\n\n }\n","file_path":"src/windows_sdk.rs","rank":6,"score":57908.0456476947},{"content":"fn transform(instance: &SetupInstance) -> Result<VisualStudioInstallationInstance, Option<i32>> {\n\n let instance_id = os_to_res_string(instance.instance_id())?;\n\n let installation_name = os_to_res_string(instance.installation_name())?;\n\n let installation_path = os_to_res_pathbuf(instance.installation_path())?;\n\n let installation_version = os_to_res_string(instance.installation_version())?;\n\n let product_path = os_to_res_pathbuf(instance.product_path())?;\n\n Ok(VisualStudioInstallationInstance {\n\n instance_id,\n\n installation_name,\n\n installation_path,\n\n installation_version,\n\n product_path,\n\n platform_toolset: \"\".into(),\n\n })\n\n}\n\n\n","file_path":"src/toolchain.rs","rank":8,"score":50869.55504177447},{"content":"pub trait FromWide\n\nwhere\n\n Self: Sized,\n\n{\n\n fn from_wide(wide: &[u16]) -> Self;\n\n fn from_wide_null(wide: &[u16]) -> Self {\n\n let len = wide.iter().take_while(|&&c| c != 0).count();\n\n Self::from_wide(&wide[..len])\n\n }\n\n}\n\nimpl FromWide for OsString {\n\n fn from_wide(wide: &[u16]) -> OsString {\n\n OsStringExt::from_wide(wide)\n\n }\n\n}\n","file_path":"src/utils.rs","rank":9,"score":37133.99477081855},{"content":"pub trait ToWide {\n\n fn to_wide(&self) -> Vec<u16>;\n\n fn to_wide_null(&self) -> Vec<u16>;\n\n}\n\nimpl<T> ToWide for T\n\nwhere\n\n T: AsRef<OsStr>,\n\n{\n\n fn to_wide(&self) -> Vec<u16> {\n\n self.as_ref().encode_wide().collect()\n\n }\n\n fn to_wide_null(&self) -> Vec<u16> {\n\n self.as_ref().encode_wide().chain(Some(0)).collect()\n\n }\n\n}\n","file_path":"src/utils.rs","rank":10,"score":37133.99477081855},{"content":"fn check_add_windows_10_sdk(\n\n path: &str,\n\n path_opt: Option<&str>,\n\n mut valid_instance: Vec<WindowsSdk>,\n\n) -> Vec<WindowsSdk> {\n\n let mut path_buf = PathBuf::new();\n\n path_buf.push(path);\n\n if let Some(some_path) = path_opt {\n\n path_buf.push(some_path);\n\n }\n\n debug!(\"Check {:?}\", path_buf);\n\n path_buf.push(\"Include\");\n\n if !path_buf.exists() {\n\n debug!(\"{:?} Not found\", path_buf);\n\n return valid_instance;\n\n }\n\n if let Ok(dir) = path_buf.read_dir() {\n\n let kit_paths: Vec<DirEntry> = dir.filter_map(|sub_res| sub_res.ok())\n\n .filter(|sub| {\n\n sub.file_name()\n","file_path":"src/windows_sdk.rs","rank":11,"score":32654.438070298478},{"content":"fn check_add_windows_81_sdk(\n\n path: &str,\n\n path_opt: Option<&str>,\n\n mut valid_instance: Vec<WindowsSdk>,\n\n) -> Vec<WindowsSdk> {\n\n let mut path_buf = PathBuf::new();\n\n path_buf.push(path);\n\n if let Some(some_path) = path_opt {\n\n path_buf.push(some_path);\n\n }\n\n debug!(\"Check {:?}\", path_buf);\n\n path_buf.push(\"Include\");\n\n if path_buf.exists() {\n\n if path_buf.read_dir().is_ok() {\n\n //TODO sort ?\n\n\n\n valid_instance.push(WindowsSdk {\n\n windows_version: SdkVersion::Win8,\n\n windows_target_platform_version: \"8.1\".into(),\n\n path: path_buf,\n\n });\n\n }\n\n } else {\n\n debug!(\"Can't get file name of {:?}\", path_buf);\n\n }\n\n valid_instance\n\n}\n\n\n","file_path":"src/windows_sdk.rs","rank":12,"score":32654.438070298478},{"content":"fn get_windows_sdk_path_from_regsitry_logged(reg_path: &str, reg_value: &str) -> Option<String> {\n\n match get_windows_sdk_path_from_regsitry(reg_path, reg_value) {\n\n Ok(s) => Some(s),\n\n Err(err) => {\n\n debug!(\n\n \"Can't find registry key {} and value {} : {:?}\",\n\n reg_path, reg_value, err\n\n );\n\n None\n\n }\n\n }\n\n}\n\n\n\n#[derive(PartialEq, Eq, Debug)]\n\npub enum SdkVersion {\n\n Win8,\n\n Win10,\n\n}\n\n\n\n#[derive(PartialEq, Eq, Debug)]\n\npub struct WindowsSdk {\n\n pub windows_version: SdkVersion,\n\n pub windows_target_platform_version: String,\n\n pub path: PathBuf,\n\n}\n\n\n","file_path":"src/windows_sdk.rs","rank":18,"score":22350.163440621054},{"content":"fn get_windows_sdk_path_from_regsitry(reg_path: &str, reg_value: &str) -> io::Result<String> {\n\n let hklm = RegKey::predef(HKEY_LOCAL_MACHINE);\n\n let installed_roots_subkey = hklm.open_subkey(reg_path)?;\n\n let kit_root_path: String = installed_roots_subkey.get_value(reg_value)?;\n\n Ok(kit_root_path)\n\n}\n\n\n","file_path":"src/windows_sdk.rs","rank":19,"score":21789.73433318595},{"content":"// Copyright © 2017 winapi-rs developers\n\n// Licensed under the Apache License, Version 2.0\n\n// <LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.\n\n// All files in the project carrying such notice may not be copied, modified, or distributed\n\n// except according to those terms.\n\nuse std::ffi::{OsStr, OsString};\n\nuse std::os::windows::ffi::{OsStrExt, OsStringExt};\n\nuse std::slice::from_raw_parts;\n\nuse winapi::shared::wtypes::BSTR;\n\nuse winapi::um::oleauto::{SysFreeString, SysStringLen};\n\n\n\npub struct BStr(BSTR);\n\nimpl BStr {\n\n pub unsafe fn from_raw(s: BSTR) -> BStr {\n\n BStr(s)\n\n }\n\n pub fn to_osstring(&self) -> OsString {\n\n let len = unsafe { SysStringLen(self.0) };\n\n let slice = unsafe { from_raw_parts(self.0, len as usize) };\n\n OsStringExt::from_wide(slice)\n\n }\n\n}\n\nimpl Drop for BStr {\n\n fn drop(&mut self) {\n\n unsafe { SysFreeString(self.0) };\n\n }\n\n}\n\n\n","file_path":"src/utils.rs","rank":30,"score":7.5227221666732875},{"content":"extern crate env_logger;\n\n#[macro_use]\n\nextern crate lazy_static;\n\n#[macro_use]\n\nextern crate log;\n\n#[macro_use]\n\nextern crate winapi;\n\nextern crate winreg;\n\nextern crate wio;\n\n\n\npub mod windows_sdk;\n\npub mod setup_config;\n\npub mod utils;\n\npub mod toolchain;\n","file_path":"src/lib.rs","rank":31,"score":5.35202817241424},{"content":"use std::ffi::OsString;\n\nuse std::path::PathBuf;\n\nuse setup_config::{SetupConfiguration, SetupInstance};\n\nuse std::cmp::Ordering;\n\n\n\n#[derive(Debug)]\n\npub struct VisualStudioInstallationInstance {\n\n instance_id: String,\n\n installation_name: String,\n\n installation_path: PathBuf,\n\n installation_version: String,\n\n product_path: PathBuf,\n\n platform_toolset: String,\n\n}\n\n\n\nimpl VisualStudioInstallationInstance {\n\n fn set_platform_toolset(&mut self, platform_toolset: String) {\n\n self.platform_toolset = platform_toolset;\n\n }\n\n}\n\n\n","file_path":"src/toolchain.rs","rank":32,"score":4.701766799251471},{"content":"use std::fs::DirEntry;\n\nuse std::path::PathBuf;\n\nuse std::io;\n\nuse winreg::RegKey;\n\nuse winreg::enums::*;\n\nuse std::env;\n\nuse std::cmp::Ordering;\n\n\n\nstatic MS_REG_PATH: &str = r\"SOFTWARE\\Microsoft\\Windows Kits\\Installed Roots\\\";\n\nstatic WOW_REG_PATH: &str = r\"WOW6432Node\\Microsoft\\Windows Kits\\Installed Roots\\\";\n\nstatic REG_VALUE_10: &str = \"KitsRoot10\";\n\nstatic REG_VALUE_81: &str = \"KitsRoot81\";\n\nstatic PROGRAM_FILES_ENV: &str = \"%ProgramFiles%\";\n\nstatic PROGRAM_FILES_X86_ENV: &str = \"%ProgramFiles(x86)%\";\n\nstatic WIN_KITS_PATH_10: &str = r\"Windows Kits\\10\";\n\nstatic WIN_KITS_PATH_81: &str = r\"Windows Kits\\8.1\";\n\n\n","file_path":"src/windows_sdk.rs","rank":33,"score":4.403963413446838},{"content":" get_windows_sdk()\n\n .iter()\n\n .filter(|v| v.windows_version == SdkVersion::Win8)\n\n .next()\n\n .map(|v| v.windows_target_platform_version.clone()),\n\n powershell_windows_sdk\n\n );\n\n }\n\n}\n","file_path":"src/windows_sdk.rs","rank":34,"score":3.3052014229622593},{"content":" let powershell_windows_sdk_output = Command::new(\"powershell\")\n\n .args(&args)\n\n .output()\n\n .expect(\"failed to execute process\");\n\n if (powershell_windows_sdk_output.stderr.len() > 0) {\n\n return None;\n\n }\n\n let powershell_windows_sdk = String::from_utf8_lossy(&powershell_windows_sdk_output.stdout);\n\n Some(powershell_windows_sdk.replace(\"\\r\\n\", \"\"))\n\n }\n\n\n\n #[test]\n\n fn same_latest_version_than_powershell() {\n\n let powershell_windows_sdk = get_powershell_windows_sdk_version(None);\n\n assert_eq!(\n\n get_windows_sdk()\n\n .iter()\n\n .next()\n\n .map(|v| v.windows_target_platform_version.clone()),\n\n powershell_windows_sdk\n","file_path":"src/windows_sdk.rs","rank":35,"score":3.0238434190360044},{"content":" .to_str()\n\n .map(|f| f.starts_with(\"10\"))\n\n .unwrap_or(false)\n\n })\n\n .collect();\n\n //TODO sort ?\n\n for sdk_dir in kit_paths {\n\n let mut windows_header = sdk_dir.path().clone();\n\n windows_header.push(\"um\");\n\n windows_header.push(\"windows.h\");\n\n if !windows_header.exists() {\n\n debug!(\"{:?} Not found \", windows_header);\n\n continue;\n\n }\n\n debug!(\"{:?} found \", windows_header);\n\n\n\n let mut ddk_header = sdk_dir.path().clone();\n\n ddk_header.push(\"shared\");\n\n ddk_header.push(\"sdkddkver.h\");\n\n if !ddk_header.exists() {\n","file_path":"src/windows_sdk.rs","rank":36,"score":2.989208112149307},{"content":" );\n\n }\n\n\n\n #[test]\n\n fn same_win10_version_than_powershell() {\n\n let powershell_windows_sdk = get_powershell_windows_sdk_version(Some(\"-DisableWin81SDK\"));\n\n assert_eq!(\n\n get_windows_sdk()\n\n .iter()\n\n .filter(|v| v.windows_version == SdkVersion::Win10)\n\n .next()\n\n .map(|v| v.windows_target_platform_version.clone()),\n\n powershell_windows_sdk\n\n );\n\n }\n\n\n\n #[test]\n\n fn same_win8_version_than_powershell() {\n\n let powershell_windows_sdk = get_powershell_windows_sdk_version(Some(\"-DisableWin10SDK\"));\n\n assert_eq!(\n","file_path":"src/windows_sdk.rs","rank":37,"score":2.1998553733158643}],"string":"[\n {\n \"content\": \"pub fn get_lasted_platform_toolset() -> Option<String> {\\n\\n get_toolchains()\\n\\n .iter()\\n\\n .next()\\n\\n .map(|v| v.platform_toolset.clone())\\n\\n}\\n\",\n \"file_path\": \"src/toolchain.rs\",\n \"rank\": 1,\n \"score\": 59086.79993836931\n },\n {\n \"content\": \"fn os_to_res_string(res: Result<OsString, i32>) -> Result<String, Option<i32>> {\\n\\n match res {\\n\\n Ok(s) => match s.into_string() {\\n\\n Ok(s) => Ok(s),\\n\\n Err(_) => Err(None),\\n\\n },\\n\\n Err(i) => Err(Some(i)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/toolchain.rs\",\n \"rank\": 2,\n \"score\": 59073.93136446357\n },\n {\n \"content\": \"fn os_to_res_pathbuf(res: Result<OsString, i32>) -> Result<PathBuf, Option<i32>> {\\n\\n match res {\\n\\n Ok(s) => match s.into_string() {\\n\\n Ok(s) => Ok(PathBuf::from(s)),\\n\\n Err(_) => Err(None),\\n\\n },\\n\\n Err(i) => Err(Some(i)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/toolchain.rs\",\n \"rank\": 3,\n \"score\": 58203.30645145073\n },\n {\n \"content\": \"pub fn get_toolchains() -> Vec<VisualStudioInstallationInstance> {\\n\\n let config = SetupConfiguration::new().unwrap();\\n\\n let iter = config.enum_all_instances().unwrap();\\n\\n let mut toolchains: Vec<VisualStudioInstallationInstance> = Vec::new();\\n\\n for instance in iter {\\n\\n let mut instance: VisualStudioInstallationInstance = match instance {\\n\\n Ok(instance) => match transform(&instance) {\\n\\n Ok(instance) => instance,\\n\\n Err(_) => continue,\\n\\n },\\n\\n Err(_) => continue,\\n\\n };\\n\\n let installation_version = instance.installation_version.clone();\\n\\n let split: Vec<&str> = installation_version.split('.').collect();\\n\\n let major_version = split[0];\\n\\n let medium_version = split[1];\\n\\n let platform_toolset = match (major_version, medium_version) as (&str, &str) {\\n\\n // from http://marcofoco.com/microsoft-visual-c-version-map/\\n\\n (\\\"15\\\", _) => Some(\\\"v141\\\"),\\n\\n (\\\"14\\\", _) => Some(\\\"v140\\\"),\\n\",\n \"file_path\": \"src/toolchain.rs\",\n \"rank\": 4,\n \"score\": 57908.0456476947\n },\n {\n \"content\": \"pub fn get_windows_sdk() -> Vec<WindowsSdk> {\\n\\n let mut windows_sdk = Vec::<WindowsSdk>::new();\\n\\n\\n\\n debug!(\\\"Looking for Windows 10 SDK\\\");\\n\\n if let Some(path) = get_windows_sdk_path_from_regsitry_logged(MS_REG_PATH, REG_VALUE_10) {\\n\\n windows_sdk = check_add_windows_10_sdk(&path, None, windows_sdk);\\n\\n }\\n\\n if let Some(path) = get_windows_sdk_path_from_regsitry_logged(WOW_REG_PATH, REG_VALUE_10) {\\n\\n windows_sdk = check_add_windows_10_sdk(&path, None, windows_sdk);\\n\\n }\\n\\n\\n\\n if let Some(program_files_path) =\\n\\n env::var_os(PROGRAM_FILES_ENV).and_then(|p| p.into_string().ok())\\n\\n {\\n\\n windows_sdk =\\n\\n check_add_windows_10_sdk(&program_files_path, Some(WIN_KITS_PATH_10), windows_sdk);\\n\\n }\\n\\n if let Some(program_files_x86_path) =\\n\\n env::var_os(PROGRAM_FILES_X86_ENV).and_then(|p| p.into_string().ok())\\n\\n {\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 5,\n \"score\": 57908.0456476947\n },\n {\n \"content\": \"pub fn get_latest_windows_sdk() -> Option<String> {\\n\\n get_windows_sdk()\\n\\n .iter()\\n\\n .next()\\n\\n .map(|v| v.windows_target_platform_version.clone())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n extern crate env_logger;\\n\\n\\n\\n use super::{get_windows_sdk, SdkVersion};\\n\\n use std::process::Command;\\n\\n\\n\\n fn get_powershell_windows_sdk_version(param_opt: Option<&str>) -> Option<String> {\\n\\n let mut args = Vec::new();\\n\\n args.push(\\\"powershell\\\\\\\\getWindowsSDK.ps1\\\");\\n\\n if let Some(param) = param_opt {\\n\\n args.push(param);\\n\\n }\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 6,\n \"score\": 57908.0456476947\n },\n {\n \"content\": \"fn transform(instance: &SetupInstance) -> Result<VisualStudioInstallationInstance, Option<i32>> {\\n\\n let instance_id = os_to_res_string(instance.instance_id())?;\\n\\n let installation_name = os_to_res_string(instance.installation_name())?;\\n\\n let installation_path = os_to_res_pathbuf(instance.installation_path())?;\\n\\n let installation_version = os_to_res_string(instance.installation_version())?;\\n\\n let product_path = os_to_res_pathbuf(instance.product_path())?;\\n\\n Ok(VisualStudioInstallationInstance {\\n\\n instance_id,\\n\\n installation_name,\\n\\n installation_path,\\n\\n installation_version,\\n\\n product_path,\\n\\n platform_toolset: \\\"\\\".into(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/toolchain.rs\",\n \"rank\": 8,\n \"score\": 50869.55504177447\n },\n {\n \"content\": \"pub trait FromWide\\n\\nwhere\\n\\n Self: Sized,\\n\\n{\\n\\n fn from_wide(wide: &[u16]) -> Self;\\n\\n fn from_wide_null(wide: &[u16]) -> Self {\\n\\n let len = wide.iter().take_while(|&&c| c != 0).count();\\n\\n Self::from_wide(&wide[..len])\\n\\n }\\n\\n}\\n\\nimpl FromWide for OsString {\\n\\n fn from_wide(wide: &[u16]) -> OsString {\\n\\n OsStringExt::from_wide(wide)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 9,\n \"score\": 37133.99477081855\n },\n {\n \"content\": \"pub trait ToWide {\\n\\n fn to_wide(&self) -> Vec<u16>;\\n\\n fn to_wide_null(&self) -> Vec<u16>;\\n\\n}\\n\\nimpl<T> ToWide for T\\n\\nwhere\\n\\n T: AsRef<OsStr>,\\n\\n{\\n\\n fn to_wide(&self) -> Vec<u16> {\\n\\n self.as_ref().encode_wide().collect()\\n\\n }\\n\\n fn to_wide_null(&self) -> Vec<u16> {\\n\\n self.as_ref().encode_wide().chain(Some(0)).collect()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 10,\n \"score\": 37133.99477081855\n },\n {\n \"content\": \"fn check_add_windows_10_sdk(\\n\\n path: &str,\\n\\n path_opt: Option<&str>,\\n\\n mut valid_instance: Vec<WindowsSdk>,\\n\\n) -> Vec<WindowsSdk> {\\n\\n let mut path_buf = PathBuf::new();\\n\\n path_buf.push(path);\\n\\n if let Some(some_path) = path_opt {\\n\\n path_buf.push(some_path);\\n\\n }\\n\\n debug!(\\\"Check {:?}\\\", path_buf);\\n\\n path_buf.push(\\\"Include\\\");\\n\\n if !path_buf.exists() {\\n\\n debug!(\\\"{:?} Not found\\\", path_buf);\\n\\n return valid_instance;\\n\\n }\\n\\n if let Ok(dir) = path_buf.read_dir() {\\n\\n let kit_paths: Vec<DirEntry> = dir.filter_map(|sub_res| sub_res.ok())\\n\\n .filter(|sub| {\\n\\n sub.file_name()\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 11,\n \"score\": 32654.438070298478\n },\n {\n \"content\": \"fn check_add_windows_81_sdk(\\n\\n path: &str,\\n\\n path_opt: Option<&str>,\\n\\n mut valid_instance: Vec<WindowsSdk>,\\n\\n) -> Vec<WindowsSdk> {\\n\\n let mut path_buf = PathBuf::new();\\n\\n path_buf.push(path);\\n\\n if let Some(some_path) = path_opt {\\n\\n path_buf.push(some_path);\\n\\n }\\n\\n debug!(\\\"Check {:?}\\\", path_buf);\\n\\n path_buf.push(\\\"Include\\\");\\n\\n if path_buf.exists() {\\n\\n if path_buf.read_dir().is_ok() {\\n\\n //TODO sort ?\\n\\n\\n\\n valid_instance.push(WindowsSdk {\\n\\n windows_version: SdkVersion::Win8,\\n\\n windows_target_platform_version: \\\"8.1\\\".into(),\\n\\n path: path_buf,\\n\\n });\\n\\n }\\n\\n } else {\\n\\n debug!(\\\"Can't get file name of {:?}\\\", path_buf);\\n\\n }\\n\\n valid_instance\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 12,\n \"score\": 32654.438070298478\n },\n {\n \"content\": \"fn get_windows_sdk_path_from_regsitry_logged(reg_path: &str, reg_value: &str) -> Option<String> {\\n\\n match get_windows_sdk_path_from_regsitry(reg_path, reg_value) {\\n\\n Ok(s) => Some(s),\\n\\n Err(err) => {\\n\\n debug!(\\n\\n \\\"Can't find registry key {} and value {} : {:?}\\\",\\n\\n reg_path, reg_value, err\\n\\n );\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(PartialEq, Eq, Debug)]\\n\\npub enum SdkVersion {\\n\\n Win8,\\n\\n Win10,\\n\\n}\\n\\n\\n\\n#[derive(PartialEq, Eq, Debug)]\\n\\npub struct WindowsSdk {\\n\\n pub windows_version: SdkVersion,\\n\\n pub windows_target_platform_version: String,\\n\\n pub path: PathBuf,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 18,\n \"score\": 22350.163440621054\n },\n {\n \"content\": \"fn get_windows_sdk_path_from_regsitry(reg_path: &str, reg_value: &str) -> io::Result<String> {\\n\\n let hklm = RegKey::predef(HKEY_LOCAL_MACHINE);\\n\\n let installed_roots_subkey = hklm.open_subkey(reg_path)?;\\n\\n let kit_root_path: String = installed_roots_subkey.get_value(reg_value)?;\\n\\n Ok(kit_root_path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 19,\n \"score\": 21789.73433318595\n },\n {\n \"content\": \"// Copyright © 2017 winapi-rs developers\\n\\n// Licensed under the Apache License, Version 2.0\\n\\n// <LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.\\n\\n// All files in the project carrying such notice may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\nuse std::ffi::{OsStr, OsString};\\n\\nuse std::os::windows::ffi::{OsStrExt, OsStringExt};\\n\\nuse std::slice::from_raw_parts;\\n\\nuse winapi::shared::wtypes::BSTR;\\n\\nuse winapi::um::oleauto::{SysFreeString, SysStringLen};\\n\\n\\n\\npub struct BStr(BSTR);\\n\\nimpl BStr {\\n\\n pub unsafe fn from_raw(s: BSTR) -> BStr {\\n\\n BStr(s)\\n\\n }\\n\\n pub fn to_osstring(&self) -> OsString {\\n\\n let len = unsafe { SysStringLen(self.0) };\\n\\n let slice = unsafe { from_raw_parts(self.0, len as usize) };\\n\\n OsStringExt::from_wide(slice)\\n\\n }\\n\\n}\\n\\nimpl Drop for BStr {\\n\\n fn drop(&mut self) {\\n\\n unsafe { SysFreeString(self.0) };\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 30,\n \"score\": 7.5227221666732875\n },\n {\n \"content\": \"extern crate env_logger;\\n\\n#[macro_use]\\n\\nextern crate lazy_static;\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n#[macro_use]\\n\\nextern crate winapi;\\n\\nextern crate winreg;\\n\\nextern crate wio;\\n\\n\\n\\npub mod windows_sdk;\\n\\npub mod setup_config;\\n\\npub mod utils;\\n\\npub mod toolchain;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 31,\n \"score\": 5.35202817241424\n },\n {\n \"content\": \"use std::ffi::OsString;\\n\\nuse std::path::PathBuf;\\n\\nuse setup_config::{SetupConfiguration, SetupInstance};\\n\\nuse std::cmp::Ordering;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct VisualStudioInstallationInstance {\\n\\n instance_id: String,\\n\\n installation_name: String,\\n\\n installation_path: PathBuf,\\n\\n installation_version: String,\\n\\n product_path: PathBuf,\\n\\n platform_toolset: String,\\n\\n}\\n\\n\\n\\nimpl VisualStudioInstallationInstance {\\n\\n fn set_platform_toolset(&mut self, platform_toolset: String) {\\n\\n self.platform_toolset = platform_toolset;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/toolchain.rs\",\n \"rank\": 32,\n \"score\": 4.701766799251471\n },\n {\n \"content\": \"use std::fs::DirEntry;\\n\\nuse std::path::PathBuf;\\n\\nuse std::io;\\n\\nuse winreg::RegKey;\\n\\nuse winreg::enums::*;\\n\\nuse std::env;\\n\\nuse std::cmp::Ordering;\\n\\n\\n\\nstatic MS_REG_PATH: &str = r\\\"SOFTWARE\\\\Microsoft\\\\Windows Kits\\\\Installed Roots\\\\\\\";\\n\\nstatic WOW_REG_PATH: &str = r\\\"WOW6432Node\\\\Microsoft\\\\Windows Kits\\\\Installed Roots\\\\\\\";\\n\\nstatic REG_VALUE_10: &str = \\\"KitsRoot10\\\";\\n\\nstatic REG_VALUE_81: &str = \\\"KitsRoot81\\\";\\n\\nstatic PROGRAM_FILES_ENV: &str = \\\"%ProgramFiles%\\\";\\n\\nstatic PROGRAM_FILES_X86_ENV: &str = \\\"%ProgramFiles(x86)%\\\";\\n\\nstatic WIN_KITS_PATH_10: &str = r\\\"Windows Kits\\\\10\\\";\\n\\nstatic WIN_KITS_PATH_81: &str = r\\\"Windows Kits\\\\8.1\\\";\\n\\n\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 33,\n \"score\": 4.403963413446838\n },\n {\n \"content\": \" get_windows_sdk()\\n\\n .iter()\\n\\n .filter(|v| v.windows_version == SdkVersion::Win8)\\n\\n .next()\\n\\n .map(|v| v.windows_target_platform_version.clone()),\\n\\n powershell_windows_sdk\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 34,\n \"score\": 3.3052014229622593\n },\n {\n \"content\": \" let powershell_windows_sdk_output = Command::new(\\\"powershell\\\")\\n\\n .args(&args)\\n\\n .output()\\n\\n .expect(\\\"failed to execute process\\\");\\n\\n if (powershell_windows_sdk_output.stderr.len() > 0) {\\n\\n return None;\\n\\n }\\n\\n let powershell_windows_sdk = String::from_utf8_lossy(&powershell_windows_sdk_output.stdout);\\n\\n Some(powershell_windows_sdk.replace(\\\"\\\\r\\\\n\\\", \\\"\\\"))\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn same_latest_version_than_powershell() {\\n\\n let powershell_windows_sdk = get_powershell_windows_sdk_version(None);\\n\\n assert_eq!(\\n\\n get_windows_sdk()\\n\\n .iter()\\n\\n .next()\\n\\n .map(|v| v.windows_target_platform_version.clone()),\\n\\n powershell_windows_sdk\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 35,\n \"score\": 3.0238434190360044\n },\n {\n \"content\": \" .to_str()\\n\\n .map(|f| f.starts_with(\\\"10\\\"))\\n\\n .unwrap_or(false)\\n\\n })\\n\\n .collect();\\n\\n //TODO sort ?\\n\\n for sdk_dir in kit_paths {\\n\\n let mut windows_header = sdk_dir.path().clone();\\n\\n windows_header.push(\\\"um\\\");\\n\\n windows_header.push(\\\"windows.h\\\");\\n\\n if !windows_header.exists() {\\n\\n debug!(\\\"{:?} Not found \\\", windows_header);\\n\\n continue;\\n\\n }\\n\\n debug!(\\\"{:?} found \\\", windows_header);\\n\\n\\n\\n let mut ddk_header = sdk_dir.path().clone();\\n\\n ddk_header.push(\\\"shared\\\");\\n\\n ddk_header.push(\\\"sdkddkver.h\\\");\\n\\n if !ddk_header.exists() {\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 36,\n \"score\": 2.989208112149307\n },\n {\n \"content\": \" );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn same_win10_version_than_powershell() {\\n\\n let powershell_windows_sdk = get_powershell_windows_sdk_version(Some(\\\"-DisableWin81SDK\\\"));\\n\\n assert_eq!(\\n\\n get_windows_sdk()\\n\\n .iter()\\n\\n .filter(|v| v.windows_version == SdkVersion::Win10)\\n\\n .next()\\n\\n .map(|v| v.windows_target_platform_version.clone()),\\n\\n powershell_windows_sdk\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn same_win8_version_than_powershell() {\\n\\n let powershell_windows_sdk = get_powershell_windows_sdk_version(Some(\\\"-DisableWin10SDK\\\"));\\n\\n assert_eq!(\\n\",\n \"file_path\": \"src/windows_sdk.rs\",\n \"rank\": 37,\n \"score\": 2.1998553733158643\n }\n]","isConversational":false}}},{"rowIdx":1192,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"proto-compiler/src/cmd/compile.rs"},"repo_name":{"kind":"string","value":"livelybug/ibc-rs"},"commit":{"kind":"string","value":"e83a2d0963fe6fa675b4125a4e8c18b13b792d88"},"file_code":{"kind":"string","value":"use std::fs::remove_dir_all;\nuse std::fs::{copy, create_dir_all};\nuse std::path::{Path, PathBuf};\n\nuse git2::Repository;\nuse tempdir::TempDir;\nuse walkdir::WalkDir;\n\nuse argh::FromArgs;\n#[derive(Debug, FromArgs)]\n#[argh(subcommand, name = \"compile\")]\n\npub struct CompileCmd {\n #[argh(option, short = 's')]\n \n sdk: PathBuf,\n #[argh(option, short = 'o')]\n \n out: PathBuf,\n}\n\nimpl CompileCmd {\n pub fn run(&self) {\n let tmp = TempDir::new(\"ibc-proto\").unwrap();\n\n Self::output_sdk_version(&self.sdk, tmp.as_ref());\n Self::compile_protos(&self.sdk, tmp.as_ref());\n Self::compile_proto_services(&self.sdk, &tmp.as_ref());\n Self::copy_generated_files(tmp.as_ref(), &self.out);\n }\n\n fn output_sdk_version(sdk_dir: &Path, out_dir: &Path) {\n let repo = Repository::open(sdk_dir).unwrap();\n let commit = repo.head().unwrap();\n let rev = commit.shorthand().unwrap();\n let path = out_dir.join(\"COSMOS_SDK_COMMIT\");\n\n std::fs::write(path, rev).unwrap();\n }\n\n fn compile_protos(sdk_dir: &Path, out_dir: &Path) {\n println!(\n \"[info ] Compiling .proto files to Rust into '{}'...\",\n out_dir.display()\n );\n\n let root = env!(\"CARGO_MANIFEST_DIR\");\n\n \n let proto_paths = [\n format!(\"{}/../proto/definitions/mock\", root),\n format!(\"{}/proto/ibc\", sdk_dir.display()),\n format!(\"{}/proto/cosmos/tx\", sdk_dir.display()),\n format!(\"{}/proto/cosmos/base\", sdk_dir.display()),\n format!(\"{}/proto/cosmos/staking\", sdk_dir.display()),\n ];\n\n let proto_includes_paths = [\n format!(\"{}/../proto\", root),\n format!(\"{}/proto\", sdk_dir.display()),\n format!(\"{}/third_party/proto\", sdk_dir.display()),\n ];\n\n \n let mut protos: Vec<PathBuf> = vec![];\n for proto_path in &proto_paths {\n protos.append(\n &mut WalkDir::new(proto_path)\n .into_iter()\n .filter_map(|e| e.ok())\n .filter(|e| {\n e.file_type().is_file()\n && e.path().extension().is_some()\n && e.path().extension().unwrap() == \"proto\"\n })\n .map(|e| e.into_path())\n .collect(),\n );\n }\n\n \n let includes: Vec<PathBuf> = proto_includes_paths.iter().map(PathBuf::from).collect();\n\n \n let mut config = prost_build::Config::default();\n config.out_dir(out_dir);\n config.extern_path(\".tendermint\", \"::tendermint_proto\");\n config.compile_protos(&protos, &includes).unwrap();\n }\n\n fn compile_proto_services(sdk_dir: impl AsRef<Path>, out_dir: impl AsRef<Path>) {\n\n let root = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n let sdk_dir = sdk_dir.as_ref().to_owned();\n\n let proto_includes_paths = [\n root.join(\"../proto\"),\n sdk_dir.join(\"proto\"),\n sdk_dir.join(\"third_party/proto\"),\n ];\n\n \n let includes = proto_includes_paths.iter().map(|p| p.as_os_str().to_os_string()).collect::<Vec<_>>();\n\n let proto_services_path = [\n sdk_dir.join(\"proto/cosmos/auth/v1beta1/query.proto\"),\n sdk_dir.join(\"proto/cosmos/staking/v1beta1/query.proto\"),\n ];\n\n \n let services = proto_services_path.iter().map(|p| p.as_os_str().to_os_string()).collect::<Vec<_>>();\n\n \n println!(\"[info ] Compiling proto clients for GRPC services!\");\n tonic_build::configure()\n .build_client(true)\n .build_server(false)\n .format(false)\n .out_dir(out_dir)\n .compile(&services, &includes).unwrap();\n\n println!(\"[info ] => Done!\");\n }\n\n fn copy_generated_files(from_dir: &Path, to_dir: &Path) {\n println!(\n \"[info ] Copying generated files into '{}'...\",\n to_dir.display()\n );\n\n \n remove_dir_all(&to_dir).unwrap_or_default();\n create_dir_all(&to_dir).unwrap();\n\n \n let errors = WalkDir::new(from_dir)\n .into_iter()\n .filter_map(|e| e.ok())\n .filter(|e| e.file_type().is_file())\n .map(|e| {\n copy(\n e.path(),\n format!(\n \"{}/{}\",\n to_dir.display(),\n &e.file_name().to_os_string().to_str().unwrap()\n ),\n )\n })\n .filter_map(|e| e.err())\n .collect::<Vec<_>>();\n\n if !errors.is_empty() {\n for e in errors {\n println!(\"[error] Error while copying compiled file: {}\", e);\n }\n\n panic!(\"[error] Aborted.\");\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use std::fs::remove_dir_all;\nuse std::fs::{copy, create_dir_all};\nuse std::path::{Path, PathBuf};\n\nuse git2::Repository;\nuse tempdir::TempDir;\nuse walkdir::WalkDir;\n\nuse argh::FromArgs;\n#[derive(Debug, FromArgs)]\n#[argh(subcommand, name = \"compile\")]\n\npub struct CompileCmd {\n #[argh(option, short = 's')]\n \n sdk: PathBuf,\n #[argh(option, short = 'o')]\n \n out: PathBuf,\n}\n\nimpl CompileCmd {\n pub fn run(&self) {\n let tmp = TempDir::new(\"ibc-proto\").unwrap();\n\n Self::output_sdk_version(&self.sdk, tmp.as_ref());\n Self::compile_protos(&self.sdk, tmp.as_ref());\n Self::compile_proto_services(&self.sdk, &tmp.as_ref());\n Self::copy_generated_files(tmp.as_ref(), &self.out);\n }\n\n fn output_sdk_version(sdk_dir: &Path, out_dir: &Path) {\n let repo = Repository::open(sdk_dir).unwrap();\n let commit = repo.head().unwrap();\n let rev = commit.shorthand().unwrap();\n let path = out_dir.join(\"COSMOS_SDK_COMMIT\");\n\n std::fs::write(path, rev).unwrap();\n }\n\n fn compile_protos(sdk_dir: &Path, out_dir: &Path) {\n println!(\n \"[info ] Compiling .proto files to Rust into '{}'...\",\n out_dir.display()\n );\n\n let root = env!(\"CARGO_MANIFEST_DIR\");\n\n \n let proto_paths = [\n format!(\"{}/../proto/definitions/mock\", root),\n format!(\"{}/proto/ibc\", sdk_dir.display()),\n format!(\"{}/proto/cosmos/tx\", sdk_dir.display()),\n format!(\"{}/proto/cosmos/base\", sdk_dir.display()),\n format!(\"{}/proto/cosmos/staking\", sdk_dir.display()),\n ];\n\n let proto_includes_paths = [\n format!(\"{}/../proto\", root),\n format!(\"{}/proto\", sdk_dir.display()),\n format!(\"{}/third_party/proto\", sdk_dir.display()),\n ];\n\n \n let mut protos: Vec<PathBuf> = vec![];\n for proto_path in &proto_paths {\n protos.append(\n &mut WalkDir::new(proto_path)\n .into_iter()\n .filter_map(|e| e.ok())\n .filter(|e| {\n e.file_type().is_file()\n && e.path().extension().is_some()\n && e.path().extension().unwrap() == \"proto\"\n })\n .map(|e| e.into_path())\n .collect(),\n );\n }\n\n \n let includes: Vec<PathBuf> = proto_includes_paths.iter().map(PathBuf::from).collect();\n\n \n let mut config = prost_build::Config::default();\n config.out_dir(out_dir);\n config.extern_path(\".tendermint\", \"::tendermint_proto\");\n config.compile_protos(&protos, &includes).unwrap();\n }\n\n fn compile_proto_services(sdk_dir: impl AsRef<Path>, out_dir: impl AsRef<Path>) {\n\n let root = PathBuf::from(env!(\"CARGO_MANIFEST_DIR\"));\n let sdk_dir = sdk_dir.as_ref().to_owned();\n\n let proto_includes_paths = [\n root.join(\"../proto\"),\n sdk_dir.join(\"proto\"),\n sdk_dir.join(\"third_party/proto\"),\n ];\n\n \n let includes = proto_includes_paths.iter().map(|p| p.as_os_str().to_os_string()).collect::<Vec<_>>();\n\n let proto_services_path = [\n sdk_dir.join(\"proto/cosmos/auth/v1beta1/query.proto\"),\n sdk_dir.join(\"proto/cosmos/staking/v1beta1/query.proto\"),\n ];\n\n \n let services = proto_services_path.iter().map(|p| p.as_os_str().to_os_string()).collect::<Vec<_>>();\n\n \n println!(\"[info ] Compiling proto clients for GRPC services!\");\n tonic_build::configure()\n .build_client(true)\n .build_server(false)\n .format(false)\n .out_dir(out_dir)\n .compile(&services, &includes).unwrap();\n\n println!(\"[info ] => Done!\");\n }\n\n fn copy_generated_files(from_dir: &Path, to_dir: &Path) {\n println!(\n \"[info ] Copying generated files into '{}'...\",\n to_dir.display()\n );\n\n \n remove_dir_all(&to_dir).unwrap_or_default();\n create_dir_all(&to_dir).unwrap();\n\n \n let errors = WalkDir::new(from_dir)\n .into_iter()\n .filter_map(|e| e.ok())\n .filter(|e| e.file_type().is_file())\n .map(|e| {\n "},"suffix":{"kind":"string","value":"\n })\n .filter_map(|e| e.err())\n .collect::<Vec<_>>();\n\n if !errors.is_empty() {\n for e in errors {\n println!(\"[error] Error while copying compiled file: {}\", e);\n }\n\n panic!(\"[error] Aborted.\");\n }\n }\n}\n"},"middle":{"kind":"string","value":"copy(\n e.path(),\n format!(\n \"{}/{}\",\n to_dir.display(),\n &e.file_name().to_os_string().to_str().unwrap()\n ),\n )"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"/// Serialize the given `Config` as TOML to the given config file.\n\npub fn store(config: &Config, path: impl AsRef<Path>) -> Result<(), Error> {\n\n let mut file = if path.as_ref().exists() {\n\n fs::OpenOptions::new().write(true).truncate(true).open(path)\n\n } else {\n\n File::create(path)\n\n }\n\n .map_err(Error::io)?;\n\n\n\n store_writer(config, &mut file)\n\n}\n\n\n\n/// Serialize the given `Config` as TOML to the given writer.\n\npub(crate) fn store_writer(config: &Config, mut writer: impl Write) -> Result<(), Error> {\n\n let toml_config = toml::to_string_pretty(&config).map_err(Error::encode)?;\n\n\n\n writeln!(writer, \"{}\", toml_config).map_err(Error::io)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"crates/relayer/src/config.rs","rank":0,"score":478323.0279035492},{"content":"/// Attempt to load and parse the TOML config file as a `Config`.\n\npub fn load(path: impl AsRef<Path>) -> Result<Config, Error> {\n\n let config_toml = std::fs::read_to_string(&path).map_err(Error::io)?;\n\n\n\n let config = toml::from_str::<Config>(&config_toml[..]).map_err(Error::decode)?;\n\n\n\n Ok(config)\n\n}\n\n\n","file_path":"crates/relayer/src/config.rs","rank":1,"score":472487.37160788744},{"content":"pub fn disable_grpc_web(config: &mut Value) -> Result<(), Error> {\n\n if let Some(field) = config.get_mut(\"grpc-web\") {\n\n field\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\"enable\".to_string(), false.into());\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":2,"score":427282.48634847626},{"content":"pub fn apply_prefix(prefix: &CommitmentPrefix, mut path: Vec<String>) -> MerklePath {\n\n let mut key_path: Vec<String> = vec![format!(\"{:?}\", prefix)];\n\n key_path.append(&mut path);\n\n MerklePath { key_path }\n\n}\n\n\n\nimpl From<CommitmentRoot> for MerkleRoot {\n\n fn from(root: CommitmentRoot) -> Self {\n\n Self {\n\n hash: root.into_vec(),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub struct MerkleProof {\n\n pub proofs: Vec<CommitmentProof>,\n\n}\n\n\n\n/// Convert to ics23::CommitmentProof\n","file_path":"crates/relayer-types/src/core/ics23_commitment/merkle.rs","rank":3,"score":407938.1637832237},{"content":"pub fn set_grpc_port(config: &mut Value, port: u16) -> Result<(), Error> {\n\n config\n\n .get_mut(\"grpc\")\n\n .ok_or_else(|| eyre!(\"expect grpc section\"))?\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\"address\".to_string(), format!(\"0.0.0.0:{}\", port).into());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":4,"score":405219.7439838312},{"content":"/// Set the `consensus.timeout_commit` field in the full node config.\n\npub fn set_timeout_commit(config: &mut Value, duration: Duration) -> Result<(), Error> {\n\n config\n\n .get_mut(\"consensus\")\n\n .ok_or_else(|| eyre!(\"expect consensus section\"))?\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\n\n \"timeout_commit\".to_string(),\n\n format!(\"{}ms\", duration.as_millis()).into(),\n\n );\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":5,"score":405162.1942920741},{"content":"pub fn save_relayer_config(config: &Config, config_path: &Path) -> Result<(), Error> {\n\n let config_str = toml::to_string_pretty(&config)?;\n\n\n\n fs::write(&config_path, &config_str)?;\n\n\n\n info!(\n\n \"written hermes config.toml to {}:\\n{}\",\n\n config_path.display(),\n\n config_str\n\n );\n\n\n\n Ok(())\n\n}\n\n\n\nimpl BootstrapClientOptions {\n\n /// Overrides options for the foreign client connecting chain A to chain B.\n\n pub fn client_options_a_to_b(mut self, options: ClientOptions) -> Self {\n\n self.client_options_a_to_b = options;\n\n self\n\n }\n","file_path":"tools/test-framework/src/bootstrap/binary/chain.rs","rank":6,"score":397928.9810670435},{"content":"pub fn disable_api(config: &mut Value) -> Result<(), Error> {\n\n if let Some(field) = config.get_mut(\"api\") {\n\n field\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\"enable\".to_string(), false.into());\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":7,"score":383904.6654846188},{"content":"pub fn write_env(path: impl AsRef<Path>, exporter: &impl ExportEnv) -> Result<(), Error> {\n\n write(path, format_env(exporter))?;\n\n\n\n Ok(())\n\n}\n","file_path":"tools/test-framework/src/types/env.rs","rank":8,"score":378063.18538837804},{"content":"pub fn add_chain_config(config: &mut Config, running_node: &FullNode) -> Result<(), Error> {\n\n let chain_config = running_node.generate_chain_config(&running_node.chain_driver.chain_type)?;\n\n\n\n config.chains.push(chain_config);\n\n Ok(())\n\n}\n\n\n\n/**\n\n Save a relayer's [`Config`] to the filesystem to make it accessible\n\n through external CLI.\n\n*/\n","file_path":"tools/test-framework/src/bootstrap/binary/chain.rs","rank":9,"score":367648.30505292816},{"content":"pub fn set_mode(config: &mut Value, mode: &str) -> Result<(), Error> {\n\n config\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\"mode\".to_string(), mode.into());\n\n\n\n Ok(())\n\n}\n","file_path":"tools/test-framework/src/chain/config.rs","rank":10,"score":363116.9032045953},{"content":"/// Set the `p2p` field in the full node config.\n\npub fn set_p2p_port(config: &mut Value, port: u16) -> Result<(), Error> {\n\n config\n\n .get_mut(\"p2p\")\n\n .ok_or_else(|| eyre!(\"expect p2p section\"))?\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\n\n \"laddr\".to_string(),\n\n format!(\"tcp://0.0.0.0:{}\", port).into(),\n\n );\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":11,"score":359576.9783965756},{"content":"/// Set the `rpc` field in the full node config.\n\npub fn set_rpc_port(config: &mut Value, port: u16) -> Result<(), Error> {\n\n config\n\n .get_mut(\"rpc\")\n\n .ok_or_else(|| eyre!(\"expect rpc section\"))?\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\n\n \"laddr\".to_string(),\n\n format!(\"tcp://0.0.0.0:{}\", port).into(),\n\n );\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":12,"score":359576.9783965756},{"content":"/// Set the `consensus.timeout_propose` field in the full node config.\n\npub fn set_timeout_propose(config: &mut Value, duration: Duration) -> Result<(), Error> {\n\n config\n\n .get_mut(\"consensus\")\n\n .ok_or_else(|| eyre!(\"expect consensus section\"))?\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\n\n \"timeout_propose\".to_string(),\n\n format!(\"{}ms\", duration.as_millis()).into(),\n\n );\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":13,"score":359576.87407289376},{"content":"pub fn set_mempool_version(config: &mut Value, version: &str) -> Result<(), Error> {\n\n config\n\n .get_mut(\"mempool\")\n\n .ok_or_else(|| eyre!(\"expect mempool section\"))?\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\"version\".to_string(), version.into());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":14,"score":359570.9755860737},{"content":"/// Set the `log_level` field in the full node config.\n\npub fn set_log_level(config: &mut Value, log_level: &str) -> Result<(), Error> {\n\n config\n\n .as_table_mut()\n\n .ok_or_else(|| eyre!(\"expect object\"))?\n\n .insert(\"log_level\".to_string(), log_level.into());\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/config.rs","rank":15,"score":356135.2514378173},{"content":"/// Spawns a chain runtime for the chain in the configuration identified by given a chain identifier.\n\n///\n\n/// This function will use the default [`ChainHandle`] implementation, ie. the [`BaseChainHandle`].\n\n///\n\n/// Returns the corresponding handle if successful.\n\npub fn spawn_chain_runtime(config: &Config, chain_id: &ChainId) -> Result<impl ChainHandle, Error> {\n\n spawn_chain_runtime_generic::<BaseChainHandle>(config, chain_id)\n\n}\n\n\n","file_path":"crates/relayer-cli/src/cli_utils.rs","rank":16,"score":351838.53978398844},{"content":"/// Default configuration file path\n\npub fn default_config_file() -> Option<PathBuf> {\n\n dirs_next::home_dir().map(|home| home.join(DEFAULT_CONFIG_PATH))\n\n}\n\n\n\n/// Cli Subcommands\n\n#[derive(Command, Parser, Debug, Runnable)]\n\npub enum CliCmd {\n\n /// Validate Hermes configuration file\n\n #[clap(subcommand)]\n\n Config(ConfigCmd),\n\n\n\n /// Manage keys in the relayer for each chain\n\n #[clap(subcommand)]\n\n Keys(KeysCmd),\n\n\n\n /// Create objects (client, connection, or channel) on chains\n\n #[clap(subcommand)]\n\n Create(CreateCmds),\n\n\n\n /// Update objects (clients) on chains\n","file_path":"crates/relayer-cli/src/commands.rs","rank":17,"score":339594.0188895563},{"content":"/// Method for syntactic validation of the input configuration file.\n\npub fn validate_config(config: &Config) -> Result<(), Diagnostic<Error>> {\n\n // Check for duplicate chain configuration and invalid trust thresholds\n\n let mut unique_chain_ids = BTreeSet::new();\n\n for c in config.chains.iter() {\n\n let already_present = !unique_chain_ids.insert(c.id.clone());\n\n if already_present {\n\n return Err(Diagnostic::Error(Error::duplicate_chains(c.id.clone())));\n\n }\n\n\n\n validate_trust_threshold(&c.id, c.trust_threshold)?;\n\n\n\n // Validate gas-related settings\n\n validate_gas_settings(&c.id, c)?;\n\n }\n\n\n\n // Check for invalid mode config\n\n validate_mode(&config.mode)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"crates/relayer-cli/src/config.rs","rank":18,"score":332046.6170983389},{"content":"pub fn handle_generic_error(e: impl Into<Report>) -> Error {\n\n Error::generic(e.into())\n\n}\n\n\n","file_path":"tools/test-framework/src/error.rs","rank":19,"score":320578.4483229698},{"content":"/// Get the path to configuration file\n\npub fn config_path() -> Option<PathBuf> {\n\n let app = app_reader();\n\n app.config_path().cloned()\n\n}\n\n\n\n// Specifies all the possible syntactic errors\n\n// that a Hermes configuration file could contain.\n\ndefine_error! {\n\n Error {\n\n ZeroChain\n\n |_| { \"config file does not specify any chain\" },\n\n\n\n InvalidLogDirective\n\n { directive: String, }\n\n [ TraceError<ParseError> ]\n\n |e| {\n\n format!(\"invalid log directive: {0:?}\", e.directive)\n\n },\n\n\n\n InvalidMode\n","file_path":"crates/relayer-cli/src/config.rs","rank":20,"score":319094.1680377942},{"content":"pub fn handle_exec_error(command: &str) -> impl FnOnce(IoError) -> Error + '_ {\n\n |e| match e.kind() {\n\n IoErrorKind::NotFound => Error::command_not_found(command.to_string(), e),\n\n _ => Error::io(e),\n\n }\n\n}\n\n\n\nimpl From<Report> for Error {\n\n fn from(e: Report) -> Self {\n\n Error::generic(e)\n\n }\n\n}\n\n\n\nimpl From<IoError> for Error {\n\n fn from(e: IoError) -> Self {\n\n Error::io(e)\n\n }\n\n}\n\n\n\nimpl From<RelayerError> for Error {\n","file_path":"tools/test-framework/src/error.rs","rank":21,"score":315636.5642301148},{"content":"// TODO move to ics23\n\nfn calculate_non_existence_root(proof: &NonExistenceProof) -> Result<Vec<u8>, Error> {\n\n if let Some(left) = &proof.left {\n\n calculate_existence_root::<ics23::HostFunctionsManager>(left)\n\n .map_err(|_| Error::invalid_merkle_proof())\n\n } else if let Some(right) = &proof.right {\n\n calculate_existence_root::<ics23::HostFunctionsManager>(right)\n\n .map_err(|_| Error::invalid_merkle_proof())\n\n } else {\n\n Err(Error::invalid_merkle_proof())\n\n }\n\n}\n\n\n\n// Merkle Proof serialization notes:\n\n// \"Proof\" id currently defined in a number of forms and included in a number of places\n\n// - TmProof: in tendermint-rs/src/merkle/proof.rs:Proof\n\n// - RawProofOps: in tendermint-proto/tendermint.cyrpto.rs:ProofOps\n\n// - RawMerkleProof: in ibc-proto/ibc.core.commitment.v1.rs:MerkleProof\n\n// - structure that includes a RawProofOps in its only `proof` field.\n\n// #[derive(Clone, PartialEq, ::prost::Message)]\n\n// pub struct MerkleProof {\n","file_path":"crates/relayer-types/src/core/ics23_commitment/merkle.rs","rank":22,"score":296032.16788666346},{"content":"pub fn collect_gen_txs(chain_id: &str, command_path: &str, home_path: &str) -> Result<(), Error> {\n\n simple_exec(\n\n chain_id,\n\n command_path,\n\n &[\"--home\", home_path, \"collect-gentxs\"],\n\n )?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tools/test-framework/src/chain/cli/bootstrap.rs","rank":23,"score":289832.19175391237},{"content":"pub fn assert_same_dimension<T>(size: usize, list: &Vec<Vec<T>>) -> Result<(), Error> {\n\n if list.len() != size {\n\n return Err(Error::generic(eyre!(\n\n \"expect nested vector to have the dimension {} x {}\",\n\n size,\n\n size\n\n )));\n\n }\n\n\n\n for list_b in list.iter() {\n\n if list_b.len() != size {\n\n return Err(Error::generic(eyre!(\n\n \"expect nested vector to have the dimension {} x {}\",\n\n size,\n\n size\n\n )));\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"tools/test-framework/src/util/array.rs","rank":24,"score":288802.13554591616},{"content":"fn disk_store_path(folder_name: &str) -> Result<PathBuf, Error> {\n\n let home = dirs_next::home_dir().ok_or_else(Error::home_location_unavailable)?;\n\n\n\n let folder = Path::new(home.as_path())\n\n .join(KEYSTORE_DEFAULT_FOLDER)\n\n .join(folder_name)\n\n .join(KEYSTORE_DISK_BACKEND);\n\n\n\n Ok(folder)\n\n}\n\n\n","file_path":"crates/relayer/src/keyring.rs","rank":25,"score":287823.18195968354},{"content":"#[instrument(skip_all, level = \"error\", fields(chain = %config.id))]\n\npub fn listen(config: &ChainConfig, filters: &[EventFilter]) -> eyre::Result<()> {\n\n let rt = Arc::new(TokioRuntime::new()?);\n\n let (event_monitor, rx) = subscribe(config, rt)?;\n\n\n\n info!(\n\n \"listening for queries: {}\",\n\n event_monitor.queries().iter().format(\", \"),\n\n );\n\n\n\n thread::spawn(|| event_monitor.run());\n\n\n\n while let Ok(event_batch) = rx.recv() {\n\n match event_batch {\n\n Ok(batch) => {\n\n let _span =\n\n tracing::error_span!(\"event_batch\", batch_height = %batch.height).entered();\n\n\n\n let matching_events = batch\n\n .events\n\n .into_iter()\n","file_path":"crates/relayer-cli/src/commands/listen.rs","rank":26,"score":284668.5192043012},{"content":"pub fn list_keys(config: ChainConfig) -> eyre::Result<Vec<(String, KeyEntry)>> {\n\n let keyring = KeyRing::new(Store::Test, &config.account_prefix, &config.id)?;\n\n let keys = keyring.keys()?;\n\n Ok(keys)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::KeysListCmd;\n\n\n\n use abscissa_core::clap::Parser;\n\n use ibc_relayer_types::core::ics24_host::identifier::ChainId;\n\n\n\n #[test]\n\n fn test_keys_list() {\n\n assert_eq!(\n\n KeysListCmd {\n\n chain_id: ChainId::from_string(\"chain_id\")\n\n },\n\n KeysListCmd::parse_from(&[\"test\", \"--chain\", \"chain_id\"])\n\n )\n\n }\n\n\n\n #[test]\n\n fn test_keys_list_no_chain() {\n\n assert!(KeysListCmd::try_parse_from(&[\"test\"]).is_err())\n\n }\n\n}\n","file_path":"crates/relayer-cli/src/commands/keys/list.rs","rank":27,"score":284267.93200589804},{"content":"/// Converts error codes originating from `broadcast_tx_sync` responses\n\n/// into IBC relayer domain-type errors.\n\n/// See [`tendermint_rpc::endpoint::broadcast::tx_sync::Response`].\n\n/// Cf: <https://github.com/cosmos/cosmos-sdk/blob/v0.42.10/types/errors/errors.go>\n\npub fn sdk_error_from_tx_sync_error_code(code: u32) -> SdkError {\n\n match code {\n\n // The primary reason (we know of) causing broadcast_tx_sync to fail\n\n // is due to \"out of gas\" errors. These are unrecoverable at the moment\n\n // on Hermes side. We'll inform the user to check for misconfiguration.\n\n 11 => SdkError::out_of_gas(code),\n\n 13 => SdkError::insufficient_fee(code),\n\n _ => SdkError::unknown_tx_sync(code),\n\n }\n\n}\n","file_path":"crates/relayer/src/sdk_error.rs","rank":28,"score":283797.8527209969},{"content":"// Converts the error in a TxResult into SdkError with the same\n\n// mapping as defined in ibc-go and cosmos-sdk. This assumes the\n\n// target chain we are interacting with are using cosmos-sdk and ibc-go.\n\n//\n\n// TODO: investigate ways to automatically generate the mapping by parsing\n\n// the errors.go source code directly\n\npub fn sdk_error_from_tx_result(result: &TxResult) -> SdkError {\n\n match result.code {\n\n Code::Ok => SdkError::unexpected_ok(),\n\n Code::Err(code) => {\n\n let codespace = result.codespace.to_string();\n\n if codespace == \"client\" {\n\n SdkError::client(client_error_from_code(code))\n\n } else {\n\n // TODO: Implement mapping for other codespaces in ibc-go\n\n SdkError::unknown_sdk(codespace, code)\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/relayer/src/sdk_error.rs","rank":29,"score":282551.59809277975},{"content":"pub fn init_test() -> Result<TestConfig, Error> {\n\n let no_color_log = env::var(\"NO_COLOR_LOG\")\n\n .ok()\n\n .map(|val| val == \"1\")\n\n .unwrap_or(false);\n\n\n\n INIT.call_once(|| {\n\n if enable_ansi() && !no_color_log {\n\n color_eyre::install().unwrap();\n\n }\n\n install_logger(!no_color_log);\n\n });\n\n\n\n let chain_command_path = env::var(\"CHAIN_COMMAND_PATH\").unwrap_or_else(|_| \"gaiad\".to_string());\n\n\n\n let base_chain_store_dir = env::var(\"CHAIN_STORE_DIR\").unwrap_or_else(|_| \"data\".to_string());\n\n\n\n let account_prefix = env::var(\"ACCOUNT_PREFIX\").unwrap_or_else(|_| \"cosmos\".to_string());\n\n\n\n let chain_store_dir = format!(\"{}/test-{}\", base_chain_store_dir, random_u32());\n","file_path":"tools/test-framework/src/bootstrap/init.rs","rank":30,"score":279835.98875203537},{"content":"/// Returns `true` if the relayer should filter based on\n\n/// client state attributes, e.g., trust threshold.\n\n/// Returns `false` otherwise.\n\nfn client_filter_enabled(_config: &Config) -> bool {\n\n // we currently always enable the client filter\n\n true\n\n}\n\n\n","file_path":"crates/relayer/src/supervisor.rs","rank":31,"score":278603.60130240914},{"content":"pub fn assemble_version_info(sender: &channel::Sender<Request>) -> Vec<VersionInfo> {\n\n // Fetch the relayer library version\n\n let lib_version = submit_request(sender, |reply_to| Request::Version { reply_to })\n\n .map_err(|e| {\n\n error!(\n\n \"[rest-server] failed while fetching relayer lib version info: {}\",\n\n e\n\n )\n\n })\n\n .unwrap_or(VersionInfo {\n\n name: \"[ibc relayer library]\".to_string(),\n\n version: \"[failed to fetch the version]\".to_string(),\n\n });\n\n // Append the REST API version info\n\n let rest_api_version = VersionInfo {\n\n name: NAME.to_string(),\n\n version: VER.to_string(),\n\n };\n\n\n\n vec![lib_version, rest_api_version]\n\n}\n","file_path":"crates/relayer-rest/src/handle.rs","rank":32,"score":271384.3238614669},{"content":"pub fn parse_itf_from_json(itf_path: &str) -> Vec<State> {\n\n let itf_json = std::fs::read_to_string(itf_path).expect(\"itf file does not exist. did you run `apalache check --inv=Invariant --run-dir=run main.tla` first?\");\n\n\n\n let trace: InformalTrace<State> =\n\n serde_json::from_str(&itf_json).expect(\"deserialization error\");\n\n\n\n trace.states\n\n}\n\n\n","file_path":"tools/integration-test/src/mbt/utils.rs","rank":33,"score":269258.0203834154},{"content":"/// Obtain a read-only (multi-reader) lock on the application configuration.\n\n///\n\n/// Panics if the application configuration has not been loaded.\n\npub fn app_config() -> config::Reader<Config> {\n\n APPLICATION.config.read()\n\n}\n\n\n\n/// Cli Application\n\n#[derive(Debug)]\n\npub struct CliApp {\n\n /// Application configuration.\n\n config: CfgCell<Config>,\n\n\n\n /// Application state.\n\n state: application::State<Self>,\n\n\n\n /// Toggle json output on/off. Changed with the global config option `-j` / `--json`.\n\n json_output: bool,\n\n\n\n /// Path to the config file.\n\n config_path: Option<PathBuf>,\n\n}\n\n\n","file_path":"crates/relayer-cli/src/application.rs","rank":34,"score":266867.04861239676},{"content":"pub fn delete_key(config: &ChainConfig, key_name: &str) -> eyre::Result<()> {\n\n let mut keyring = KeyRing::new(Store::Test, &config.account_prefix, &config.id)?;\n\n keyring.remove_key(key_name)?;\n\n Ok(())\n\n}\n\n\n","file_path":"crates/relayer-cli/src/commands/keys/delete.rs","rank":35,"score":265549.9850182455},{"content":"/// Default validator function for Client identifiers.\n\n///\n\n/// A valid identifier must be between 9-64 characters and only contain lowercase\n\n/// alphabetic characters,\n\npub fn validate_client_identifier(id: &str) -> Result<(), Error> {\n\n validate_identifier(id, 9, 64)\n\n}\n\n\n","file_path":"crates/relayer-types/src/core/ics24_host/validate.rs","rank":36,"score":264816.0283405822},{"content":"fn auth_info_and_bytes(signer_info: SignerInfo, fee: Fee) -> Result<(AuthInfo, Vec<u8>), Error> {\n\n let auth_info = AuthInfo {\n\n signer_infos: vec![signer_info],\n\n fee: Some(fee),\n\n\n\n // Since Cosmos SDK v0.46.0\n\n tip: None,\n\n };\n\n\n\n // A protobuf serialization of a AuthInfo\n\n let mut auth_buf = Vec::new();\n\n\n\n prost::Message::encode(&auth_info, &mut auth_buf)\n\n .map_err(|e| Error::protobuf_encode(String::from(\"AuthInfo\"), e))?;\n\n\n\n Ok((auth_info, auth_buf))\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/encode.rs","rank":37,"score":263879.11910025764},{"content":"fn run_and_collect_events<F>(ev_list: &mut Vec<IbcEvent>, f: F)\n\nwhere\n\n F: FnOnce() -> Result<Vec<IbcEvent>, LinkError>,\n\n{\n\n match f() {\n\n Ok(mut ev) => ev_list.append(&mut ev),\n\n Err(e) => Output::error(Error::link(e)).exit(),\n\n };\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::ClearPacketsCmd;\n\n\n\n use std::str::FromStr;\n\n\n\n use abscissa_core::clap::Parser;\n\n use ibc_relayer_types::core::ics24_host::identifier::{ChainId, ChannelId, PortId};\n\n\n\n #[test]\n","file_path":"crates/relayer-cli/src/commands/clear.rs","rank":38,"score":257522.47030885177},{"content":"// The error code mapping follows the Go code at\n\n// ibc-go/modules/core/02-client/types/errors.go\n\nfn client_error_from_code(code: u32) -> ClientError {\n\n match code {\n\n 2 => ClientError::light_client_already_exists(),\n\n 3 => ClientError::invalid_light_client(),\n\n 4 => ClientError::light_client_not_found(),\n\n 5 => ClientError::frozen_light_client(),\n\n 6 => ClientError::invalid_client_metadata(),\n\n 7 => ClientError::consensus_state_not_found(),\n\n 8 => ClientError::invalid_consensus_state(),\n\n 9 => ClientError::client_type_not_found(),\n\n 10 => ClientError::invalid_client_type(),\n\n 11 => ClientError::commitment_root_not_found(),\n\n 12 => ClientError::invalid_client_header(),\n\n 13 => ClientError::invalid_light_client_misbehavior(),\n\n 14 => ClientError::client_state_verification_failed(),\n\n 15 => ClientError::client_consensus_state_verification_failed(),\n\n 16 => ClientError::connection_state_verification_failed(),\n\n 17 => ClientError::client_state_verification_failed(),\n\n 18 => ClientError::packet_commitment_verification_failed(),\n\n 19 => ClientError::packet_acknowledgement_verification_failed(),\n","file_path":"crates/relayer/src/sdk_error.rs","rank":39,"score":257133.4530883813},{"content":"/// Generate packet filters from Vec<IBCPath> and load them in a Map(chain_name -> filter).\n\nfn construct_packet_filters(ibc_paths: Vec<IBCPath>) -> HashMap<String, PacketFilter> {\n\n let mut packet_filters = HashMap::new();\n\n\n\n for path in ibc_paths {\n\n for channel in path.channels {\n\n let chain_1 = path.chain_1.chain_name.to_owned();\n\n let chain_2 = path.chain_2.chain_name.to_owned();\n\n\n\n let filters_1 = packet_filters.entry(chain_1).or_insert(Vec::new());\n\n\n\n filters_1.push((\n\n FilterPattern::Exact(channel.chain_1.port_id.clone()),\n\n FilterPattern::Exact(channel.chain_1.channel_id.clone()),\n\n ));\n\n\n\n let filters_2 = packet_filters.entry(chain_2).or_insert(Vec::new());\n\n\n\n filters_2.push((\n\n FilterPattern::Exact(channel.chain_2.port_id.clone()),\n\n FilterPattern::Exact(channel.chain_2.channel_id.clone()),\n","file_path":"crates/relayer-cli/src/chain_registry.rs","rank":40,"score":255795.83336512157},{"content":"pub fn initialize(chain_id: &str, command_path: &str, home_path: &str) -> Result<(), Error> {\n\n simple_exec(\n\n chain_id,\n\n command_path,\n\n &[\n\n \"--home\",\n\n home_path,\n\n \"--chain-id\",\n\n chain_id,\n\n \"init\",\n\n chain_id,\n\n ],\n\n )?;\n\n\n\n Ok(())\n\n}\n","file_path":"tools/test-framework/src/chain/cli/bootstrap.rs","rank":41,"score":252487.0434895006},{"content":"pub fn extract_client_id(event: &IbcEvent) -> Result<&ClientId, ForeignClientError> {\n\n match event {\n\n IbcEvent::CreateClient(ev) => Ok(ev.client_id()),\n\n IbcEvent::UpdateClient(ev) => Ok(ev.client_id()),\n\n _ => Err(ForeignClientError::missing_client_id_from_event(\n\n event.clone(),\n\n )),\n\n }\n\n}\n","file_path":"crates/relayer/src/foreign_client.rs","rank":42,"score":251385.56578812157},{"content":"pub fn try_into_array<T, const SIZE: usize>(list: Vec<T>) -> Result<[T; SIZE], Error> {\n\n list.try_into()\n\n .map_err(|_| Error::generic(eyre!(\"vector is not of length {}\", SIZE)))\n\n}\n\n\n\n/**\n\n Converts a dynamic-sized nested vector `Vec<Vec<T>>` into a fixed-sized\n\n nested array `[[T; SIZE]; SIZE]`. Fails if the nested vector is not of\n\n `SIZE`x`SIZE` length.\n\n*/\n","file_path":"tools/test-framework/src/util/array.rs","rank":43,"score":251302.6604611411},{"content":"/// This method is the workhorse for deserializing\n\n/// the `key` field from a public key.\n\nfn deserialize_key<'de, D>(deser: D) -> Result<Vec<u8>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n // The key is a byte array that is base64-encoded\n\n // and then marshalled into a JSON String.\n\n let based64_encoded: Result<String, _> = Deserialize::deserialize(deser);\n\n let value = base64::decode(based64_encoded?)\n\n .map_err(|e| serde::de::Error::custom(format!(\"error in decoding: {}\", e)))?;\n\n\n\n Ok(value)\n\n}\n\n\n\nimpl FromStr for EncodedPubKey {\n\n type Err = Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n // Try to deserialize into a JSON Value.\n\n let maybe_json: Result<ProtoAny, _> = serde_json::from_str(s);\n\n\n","file_path":"crates/relayer/src/keyring/pub_key.rs","rank":44,"score":249010.0442452476},{"content":"/// The default amount of gas the relayer is willing to pay for a transaction,\n\n/// when it cannot simulate the tx and therefore estimate the gas amount needed.\n\npub fn default_gas_from_config(config: &ChainConfig) -> u64 {\n\n config\n\n .default_gas\n\n .unwrap_or_else(|| max_gas_from_config(config))\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/types/gas.rs","rank":45,"score":247087.68599498548},{"content":"/// The maximum amount of gas the relayer is willing to pay for a transaction\n\npub fn max_gas_from_config(config: &ChainConfig) -> u64 {\n\n config.max_gas.unwrap_or(DEFAULT_MAX_GAS)\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/types/gas.rs","rank":46,"score":247087.68599498548},{"content":"/// The gas multiplier\n\npub fn gas_multiplier_from_config(config: &ChainConfig) -> f64 {\n\n config.gas_multiplier.unwrap_or_default().to_f64()\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/types/gas.rs","rank":47,"score":247087.68599498548},{"content":"pub fn decode_header<B: Buf>(buf: B) -> Result<Header, Error> {\n\n RawHeader::decode(buf).map_err(Error::decode)?.try_into()\n\n}\n\n\n\nimpl From<Header> for RawHeader {\n\n fn from(value: Header) -> Self {\n\n RawHeader {\n\n signed_header: Some(value.signed_header.into()),\n\n validator_set: Some(value.validator_set.into()),\n\n trusted_height: Some(value.trusted_height.into()),\n\n trusted_validators: Some(value.trusted_validator_set.into()),\n\n }\n\n }\n\n}\n\n\n\n#[cfg(any(test, feature = \"mocks\"))]\n\npub mod test_util {\n\n use alloc::vec;\n\n\n\n use subtle_encoding::hex;\n","file_path":"crates/relayer-types/src/clients/ics07_tendermint/header.rs","rank":48,"score":246770.51007384676},{"content":"fn parse_sdk_version(version_info: &VersionInfo) -> Result<semver::Version, Error> {\n\n let module = version_info\n\n .build_deps\n\n .iter()\n\n .find(|&m| m.path.contains(SDK_MODULE_NAME))\n\n .ok_or_else(|| {\n\n Error::sdk_module_not_found(SDK_MODULE_NAME.to_string(), AppInfo::from(version_info))\n\n })?;\n\n\n\n // The raw version number has a leading 'v', trim it out;\n\n let plain_version = module.version.trim_start_matches('v');\n\n\n\n // Parse the module version\n\n let mut version = semver::Version::parse(plain_version).map_err(|e| {\n\n Error::version_parsing_failed(\n\n module.path.clone(),\n\n module.version.clone(),\n\n e.to_string(),\n\n AppInfo::from(version_info),\n\n )\n\n })?;\n\n\n\n // Remove the pre-release version to ensure we treat pre-releases of the SDK\n\n // as their normal version, eg. 0.42.0-rc2 should satisfy >=0.41.3, <= 0.42.6.\n\n version.pre = semver::Prerelease::EMPTY;\n\n\n\n Ok(version)\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/version.rs","rank":49,"score":246650.9613252448},{"content":"pub fn convert_tm_to_ics_merkle_proof(tm_proof: &TendermintProof) -> Result<MerkleProof, Error> {\n\n let mut proofs = Vec::new();\n\n\n\n for op in &tm_proof.ops {\n\n let mut parsed = ibc_proto::ics23::CommitmentProof { proof: None };\n\n prost::Message::merge(&mut parsed, op.data.as_slice())\n\n .map_err(Error::commitment_proof_decoding_failed)?;\n\n\n\n proofs.push(parsed);\n\n }\n\n\n\n Ok(MerkleProof::from(RawMerkleProof { proofs }))\n\n}\n","file_path":"crates/relayer-types/src/core/ics23_commitment/merkle.rs","rank":50,"score":244613.28293734652},{"content":"#[test]\n\npub fn example_test() -> Result<(), Error> {\n\n run_binary_channel_test(&ExampleTest)\n\n}\n\n\n\npub struct ExampleTest;\n\n\n\nimpl TestOverrides for ExampleTest {}\n\n\n\nimpl BinaryChannelTest for ExampleTest {\n\n fn run<ChainA: ChainHandle, ChainB: ChainHandle>(\n\n &self,\n\n _config: &TestConfig,\n\n _relayer: RelayerDriver,\n\n _chains: ConnectedChains<ChainA, ChainB>,\n\n _channel: ConnectedChannel<ChainA, ChainB>,\n\n ) -> Result<(), Error> {\n\n suspend()\n\n }\n\n}\n","file_path":"tools/integration-test/src/tests/example.rs","rank":51,"score":242197.50145021267},{"content":"pub fn all_chain_ids(sender: &channel::Sender<Request>) -> Result<Vec<ChainId>, RestApiError> {\n\n submit_request(sender, |reply_to| Request::GetChains { reply_to })\n\n}\n\n\n","file_path":"crates/relayer-rest/src/handle.rs","rank":52,"score":241848.68038917956},{"content":"pub fn extract_header_from_tx(event: &AbciEvent) -> Result<Box<dyn Header>, Error> {\n\n for tag in &event.attributes {\n\n let key = tag.key.as_ref();\n\n let value = tag.value.as_ref();\n\n if key == HEADER_ATTRIBUTE_KEY {\n\n return AnyHeader::decode_from_string(value).map(AnyHeader::into_box);\n\n }\n\n }\n\n Err(Error::missing_raw_header())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use ibc_relayer_types::core::ics02_client::client_type::ClientType;\n\n use ibc_relayer_types::mock::header::MockHeader;\n\n use ibc_relayer_types::Height;\n\n\n\n use super::*;\n\n\n\n #[test]\n","file_path":"crates/relayer/src/chain/cosmos/types/events/client.rs","rank":53,"score":241376.49939765118},{"content":"pub fn get_dummy_proof() -> Vec<u8> {\n\n \"Y29uc2Vuc3VzU3RhdGUvaWJjb25lY2xpZW50LzIy\"\n\n .as_bytes()\n\n .to_vec()\n\n}\n\n\n","file_path":"crates/relayer-types/src/test_utils.rs","rank":54,"score":240658.09453442082},{"content":"pub fn new_registry(config: Config) -> SharedRegistry<CountingAndCachingChainHandle> {\n\n <SharedRegistry<CountingAndCachingChainHandle>>::new(config)\n\n}\n\n\n\n/**\n\n Generate [`ChainConfig`](ibc_relayer::config::ChainConfig) from a running\n\n [`FullNode`] and add it to the relayer's [`Config`].\n\n*/\n","file_path":"tools/test-framework/src/bootstrap/binary/chain.rs","rank":55,"score":240501.85671010643},{"content":"pub fn spawn(config: Config) -> (ServerHandle, channel::Receiver<Request>) {\n\n let (req_tx, req_rx) = channel::unbounded::<Request>();\n\n\n\n info!(\"starting REST API server listening at http://{}\", config);\n\n let handle = run(config, req_tx);\n\n\n\n (handle, req_rx)\n\n}\n\n\n","file_path":"crates/relayer-rest/src/server.rs","rank":56,"score":240300.41928709252},{"content":"/// Process incoming REST requests.\n\n///\n\n/// Non-blocking receiving of requests from\n\n/// the REST server, and tries to handle them locally.\n\n///\n\n/// Any request that cannot be handled locally here is propagated\n\n/// as a [`Command`] to the caller, which the supervisor itself should handle.\n\npub fn process_incoming_requests(config: &Config, channel: &Receiver) -> Option<Command> {\n\n match channel.try_recv() {\n\n Ok(request) => match request {\n\n Request::Version { reply_to } => {\n\n trace!(\"Version\");\n\n\n\n let v = VersionInfo {\n\n name: NAME.to_string(),\n\n version: VER.to_string(),\n\n };\n\n\n\n reply_to\n\n .send(Ok(v))\n\n .unwrap_or_else(|e| error!(\"error replying to a REST request {}\", e));\n\n }\n\n\n\n Request::GetChains { reply_to } => {\n\n trace!(\"GetChains\");\n\n\n\n reply_to\n","file_path":"crates/relayer/src/rest.rs","rank":57,"score":240300.41928709252},{"content":"/// Verifies that every template macro call in the file can be replaced by a valid Hermes command.\n\n/// Returns the number of invalid commands found.\n\nfn verify_file(path: &Path) -> i32 {\n\n let mut errors_found = 0;\n\n let file = File::open(path);\n\n let reader =\n\n BufReader::new(file.unwrap_or_else(|_| panic!(\"File not found: {}\", path.display())));\n\n let mut line_number = 1;\n\n\n\n for line in reader.lines() {\n\n let line = line\n\n .unwrap_or_else(|_| panic!(\"{} : Failed to read line {}\", path.display(), line_number));\n\n errors_found += verify_line(&line, path, line_number);\n\n line_number += 1;\n\n }\n\n errors_found\n\n}\n\n\n","file_path":"tools/check-guide/src/main.rs","rank":58,"score":239034.43590816815},{"content":"/// Perform a health check on all connected chains\n\nfn health_check<Chain: ChainHandle>(config: &Config, registry: &mut Registry<Chain>) {\n\n use HealthCheck::*;\n\n\n\n let chains = &config.chains;\n\n\n\n for config in chains {\n\n let id = &config.id;\n\n let _span = error_span!(\"health_check\", chain = %id).entered();\n\n\n\n let chain = registry.get_or_spawn(id);\n\n\n\n match chain {\n\n Ok(chain) => match chain.health_check() {\n\n Ok(Healthy) => info!(\"chain is healthy\"),\n\n Ok(Unhealthy(e)) => warn!(\"chain is not healthy: {}\", e),\n\n Err(e) => error!(\"failed to perform health check: {}\", e),\n\n },\n\n Err(e) => {\n\n error!(\n\n \"skipping health check, reason: failed to spawn chain runtime with error: {}\",\n\n e\n\n );\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// Subscribe to the events emitted by the chains the supervisor is connected to.\n","file_path":"crates/relayer/src/supervisor.rs","rank":59,"score":236962.7331660592},{"content":"pub fn pipe_to_file(\n\n mut source: impl io::Read + Send + 'static,\n\n file_path: &str,\n\n) -> Result<(), Error> {\n\n let mut file = fs::OpenOptions::new()\n\n .append(true)\n\n .create(true)\n\n .open(file_path)?;\n\n\n\n thread::spawn(move || {\n\n std::io::copy(&mut source, &mut file).unwrap();\n\n });\n\n\n\n Ok(())\n\n}\n","file_path":"tools/test-framework/src/util/file.rs","rank":60,"score":236930.86186938442},{"content":"/// Returns the lists of supported versions\n\npub fn get_compatible_versions() -> Vec<Version> {\n\n vec![Version::default()]\n\n}\n\n\n","file_path":"crates/relayer-types/src/core/ics03_connection/version.rs","rank":61,"score":235727.0744346924},{"content":"pub fn delete_all_keys(config: &ChainConfig) -> eyre::Result<()> {\n\n let mut keyring = KeyRing::new(Store::Test, &config.account_prefix, &config.id)?;\n\n let keys = keyring.keys()?;\n\n for key in keys {\n\n keyring.remove_key(&key.0)?;\n\n }\n\n Ok(())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::KeysDeleteCmd;\n\n\n\n use abscissa_core::clap::Parser;\n\n use ibc_relayer_types::core::ics24_host::identifier::ChainId;\n\n\n\n #[test]\n\n fn test_keys_delete_key_name() {\n\n assert_eq!(\n\n KeysDeleteCmd {\n","file_path":"crates/relayer-cli/src/commands/keys/delete.rs","rank":62,"score":235540.99179990406},{"content":"pub fn simple_exec(desc: &str, command_path: &str, args: &[&str]) -> Result<ExecOutput, Error> {\n\n debug!(\n\n \"Executing command for {}: {} {}\",\n\n desc,\n\n command_path,\n\n itertools::join(args, \" \")\n\n );\n\n\n\n let output = Command::new(&command_path)\n\n .args(args)\n\n .output()\n\n .map_err(handle_exec_error(command_path))?;\n\n\n\n if output.status.success() {\n\n let stdout = str::from_utf8(&output.stdout)\n\n .map_err(handle_generic_error)?\n\n .to_string();\n\n\n\n let stderr = str::from_utf8(&output.stderr)\n\n .map_err(handle_generic_error)?\n","file_path":"tools/test-framework/src/chain/exec.rs","rank":63,"score":235503.8734402453},{"content":"fn extract_chains_and_keys(chain_names: &[String]) -> Vec<(String, Option<String>)> {\n\n let mut captured_names = chain_names\n\n .iter()\n\n .map(|chain_key| {\n\n chain_key\n\n .split_once(':')\n\n .map(|(name, key)| (name.to_string(), Some(key.to_string())))\n\n .unwrap_or_else(|| (chain_key.to_string(), None))\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n captured_names.sort_by(|a, b| a.0.cmp(&b.0));\n\n captured_names\n\n}\n\n\n\nimpl Runnable for AutoCmd {\n\n fn run(&self) {\n\n // Assert that for every chain, a key name is provided\n\n let runtime = tokio::runtime::Runtime::new().unwrap();\n\n\n","file_path":"crates/relayer-cli/src/commands/config/auto.rs","rank":64,"score":233646.43688859927},{"content":"#[cfg(not(feature = \"telemetry\"))]\n\nfn spawn_telemetry_server(config: &Config) -> Result<(), Box<dyn Error + Send + Sync>> {\n\n if config.telemetry.enabled {\n\n warn!(\n\n \"telemetry enabled in the config but Hermes was built without telemetry support, \\\n\n build Hermes with --features=telemetry to enable telemetry support.\"\n\n );\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"crates/relayer-cli/src/commands/start.rs","rank":65,"score":231828.31381604625},{"content":"fn validate_gas_settings(id: &ChainId, config: &ChainConfig) -> Result<(), Diagnostic<Error>> {\n\n // Check that the gas_adjustment option is not set\n\n if let Some(gas_adjustment) = config.gas_adjustment {\n\n let gas_multiplier = gas_adjustment + 1.0;\n\n\n\n return Err(Diagnostic::Error(Error::deprecated_gas_adjustment(\n\n gas_adjustment,\n\n gas_multiplier,\n\n id.clone(),\n\n )));\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"crates/relayer-cli/src/config.rs","rank":66,"score":231007.50748457125},{"content":"pub fn collect_events(\n\n config: &Config,\n\n workers: &WorkerMap,\n\n src_chain: &impl ChainHandle,\n\n batch: &EventBatch,\n\n) -> CollectedEvents {\n\n let mut collected =\n\n CollectedEvents::new(batch.height, batch.chain_id.clone(), batch.tracking_id);\n\n\n\n let mode = config.mode;\n\n\n\n for event_with_height in &batch.events {\n\n match &event_with_height.event {\n\n IbcEvent::NewBlock(_) => {\n\n collected.new_block = Some(event_with_height.event.clone());\n\n }\n\n IbcEvent::UpdateClient(update) => {\n\n collect_event(\n\n &mut collected,\n\n event_with_height.clone(),\n","file_path":"crates/relayer/src/supervisor.rs","rank":67,"score":230359.0021774823},{"content":"struct OutputBuffer(Vec<UpgradeClientsForChainResult>);\n\n\n\nimpl Display for OutputBuffer {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), FmtError> {\n\n fn sep<'a>(pos: usize, len: usize, other: &'a str, last: &'a str) -> &'a str {\n\n if pos != len - 1 {\n\n other\n\n } else {\n\n last\n\n }\n\n }\n\n\n\n let outer_results = &self.0;\n\n writeln!(f, \".\")?;\n\n for (o, outer_result) in outer_results.iter().enumerate() {\n\n write!(f, \"{}\", sep(o, outer_results.len(), \"├─\", \"└─\"))?;\n\n match outer_result {\n\n Ok(inner_results) => {\n\n writeln!(f, \".\")?;\n\n for (i, inner_result) in inner_results.iter().enumerate() {\n","file_path":"crates/relayer-cli/src/commands/tx/client.rs","rank":68,"score":228135.56824457337},{"content":"/// Returns `true` if the relayer should filter based on\n\n/// channel identifiers.\n\n/// Returns `false` otherwise.\n\nfn channel_filter_enabled(_config: &Config) -> bool {\n\n // we currently always enable the channel filter\n\n true\n\n}\n\n\n","file_path":"crates/relayer/src/supervisor.rs","rank":69,"score":228011.7500805881},{"content":"/// Returns the sequences of the packet commitments on a given chain and channel (port_id + channel_id).\n\n/// These are the sequences of the packets that were either:\n\n/// - not yet received by the counterparty chain, or\n\n/// - received on counterparty chain but not yet acknowledged by this chain,\n\npub fn commitments_on_chain(\n\n chain: &impl ChainHandle,\n\n port_id: &PortId,\n\n channel_id: &ChannelId,\n\n) -> Result<(Vec<Sequence>, Height), Error> {\n\n // get the packet commitments on the counterparty/ source chain\n\n let (mut commit_sequences, response_height) = chain\n\n .query_packet_commitments(QueryPacketCommitmentsRequest {\n\n port_id: port_id.clone(),\n\n channel_id: channel_id.clone(),\n\n pagination: Some(PageRequest::all()),\n\n })\n\n .map_err(Error::relayer)?;\n\n\n\n commit_sequences.sort_unstable();\n\n\n\n Ok((commit_sequences, response_height))\n\n}\n\n\n","file_path":"crates/relayer/src/chain/counterparty.rs","rank":70,"score":227288.0365883138},{"content":"pub fn chain_config(\n\n sender: &channel::Sender<Request>,\n\n chain_id: &str,\n\n) -> Result<ChainConfig, RestApiError> {\n\n submit_request(sender, |reply_to| Request::GetChain {\n\n chain_id: ChainId::from_string(chain_id),\n\n reply_to,\n\n })\n\n}\n\n\n","file_path":"crates/relayer-rest/src/handle.rs","rank":71,"score":227155.11619735794},{"content":"fn decode_bech32(input: &str) -> Result<Vec<u8>, Error> {\n\n use bech32::FromBase32;\n\n\n\n let bytes = bech32::decode(input)\n\n .and_then(|(_, data, _)| Vec::from_base32(&data))\n\n .map_err(Error::bech32_account)?;\n\n\n\n Ok(bytes)\n\n}\n\n\n","file_path":"crates/relayer/src/keyring.rs","rank":72,"score":226886.0401132399},{"content":"pub fn gas_amount_to_fee(config: &GasConfig, gas_amount: u64) -> Fee {\n\n let adjusted_gas_limit = adjust_estimated_gas(AdjustGas {\n\n gas_multiplier: config.gas_multiplier,\n\n max_gas: config.max_gas,\n\n gas_amount,\n\n });\n\n\n\n // The fee in coins based on gas amount\n\n let amount = calculate_fee(adjusted_gas_limit, &config.gas_price);\n\n\n\n Fee {\n\n amount: vec![amount],\n\n gas_limit: adjusted_gas_limit,\n\n payer: \"\".to_string(),\n\n granter: config.fee_granter.clone(),\n\n }\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/gas.rs","rank":73,"score":226737.090892038},{"content":"#[test]\n\nfn test_client_options() -> Result<(), Error> {\n\n run_binary_chain_test(&ClientOptionsTest)\n\n}\n\n\n","file_path":"tools/integration-test/src/tests/client_settings.rs","rank":74,"score":225940.55957647972},{"content":"#[test]\n\nfn test_client_defaults() -> Result<(), Error> {\n\n run_binary_chain_test(&ClientDefaultsTest)\n\n}\n\n\n\n/// A test to exercise customization of foreign client settings.\n","file_path":"tools/integration-test/src/tests/client_settings.rs","rank":75,"score":225940.55957647972},{"content":"pub fn extract_header_from_tx(event: &AbciEvent) -> Result<Box<dyn Header>, ClientError> {\n\n for tag in &event.attributes {\n\n let key = tag.key.as_ref();\n\n let value = tag.value.as_ref();\n\n if key == HEADER_ATTRIBUTE_KEY {\n\n return AnyHeader::decode_from_string(value).map(AnyHeader::into_box);\n\n }\n\n }\n\n Err(ClientError::missing_raw_header())\n\n}\n\n\n","file_path":"crates/relayer/src/event.rs","rank":76,"score":225022.77611407635},{"content":"/// A basic worker retry strategy.\n\n///\n\n/// The backoff delay is initially 200ms and grows\n\n/// by 100ms at each step. The backoff delay is\n\n/// capped at 500ms.\n\n/// The overall amount of time spent backing off\n\n/// is capped to 2 seconds.\n\n/// See the `default_strategy` test below.\n\npub fn worker_default_strategy() -> impl Iterator<Item = Duration> {\n\n let strategy = ConstantGrowth::new(Duration::from_millis(200), Duration::from_millis(100));\n\n clamp_total(strategy, Duration::from_millis(500), Duration::from_secs(2))\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::time::Duration;\n\n\n\n use crate::worker::retry_strategy::worker_default_strategy;\n\n\n\n #[test]\n\n fn default_strategy() {\n\n let strategy = worker_default_strategy();\n\n let delays = strategy.take(10).collect::<Vec<_>>();\n\n // This strategy has exactly 6 retry steps\n\n assert_eq!(\n\n delays,\n\n vec![\n\n Duration::from_millis(200),\n\n Duration::from_millis(300),\n\n Duration::from_millis(400),\n\n Duration::from_millis(500),\n\n Duration::from_millis(500),\n\n Duration::from_millis(100),\n\n ]\n\n );\n\n }\n\n}\n","file_path":"crates/relayer/src/worker/retry_strategy.rs","rank":77,"score":224800.1532446991},{"content":"pub fn format_env(exporter: &impl ExportEnv) -> String {\n\n let mut envs = BTreeMap::new();\n\n exporter.export_env(&mut envs);\n\n\n\n envs.iter()\n\n .map(|(key, value)| format!(\"{}={}\", key, value))\n\n .join(\"\\n\")\n\n}\n\n\n\n/**\n\n Retrieve the environment variables exported by a type implementing\n\n `ExportEnv`, and save them as a `.env` file to the given file path.\n\n*/\n","file_path":"tools/test-framework/src/types/env.rs","rank":78,"score":224800.1532446991},{"content":"pub fn gas_config_for_test() -> GasConfig {\n\n let max_gas = 3000000;\n\n let gas_multiplier = 1.1;\n\n let gas_price = GasPrice::new(0.001, \"stake\".to_string());\n\n\n\n let default_gas = max_gas;\n\n let fee_granter = \"\".to_string();\n\n\n\n let max_fee = Fee {\n\n amount: vec![calculate_fee(max_gas, &gas_price)],\n\n gas_limit: max_gas,\n\n payer: \"\".to_string(),\n\n granter: fee_granter.clone(),\n\n };\n\n\n\n GasConfig {\n\n default_gas,\n\n max_gas,\n\n gas_multiplier,\n\n gas_price,\n\n max_fee,\n\n fee_granter,\n\n }\n\n}\n\n\n","file_path":"tools/test-framework/src/relayer/tx.rs","rank":79,"score":224243.63012330397},{"content":"/// Returns the [`ChannelConnectionClient`] associated with the\n\n/// provided port and channel id.\n\npub fn channel_connection_client(\n\n chain: &impl ChainHandle,\n\n port_id: &PortId,\n\n channel_id: &ChannelId,\n\n) -> Result<ChannelConnectionClient, Error> {\n\n let (channel_end, _) = chain\n\n .query_channel(\n\n QueryChannelRequest {\n\n port_id: port_id.clone(),\n\n channel_id: channel_id.clone(),\n\n height: QueryHeight::Latest,\n\n },\n\n IncludeProof::No,\n\n )\n\n .map_err(Error::relayer)?;\n\n\n\n if channel_end.state_matches(&State::Uninitialized) {\n\n return Err(Error::channel_uninitialized(\n\n port_id.clone(),\n\n channel_id.clone(),\n","file_path":"crates/relayer/src/chain/counterparty.rs","rank":80,"score":223689.23966414994},{"content":"pub fn wait_for_client() {\n\n let sleep_time = CLIENT_EXPIRY + Duration::from_secs(5);\n\n\n\n info!(\n\n \"Sleeping for {} seconds to wait for IBC client to expire\",\n\n sleep_time.as_secs()\n\n );\n\n\n\n sleep(sleep_time);\n\n}\n\n\n","file_path":"tools/integration-test/src/mbt/utils.rs","rank":81,"score":223683.59432149178},{"content":"#[test]\n\nfn test_client_default_refresh() -> Result<(), Error> {\n\n run_binary_chain_test(&ClientDefaultsTest)\n\n}\n\n\n","file_path":"tools/integration-test/src/tests/client_refresh.rs","rank":82,"score":223608.49723327905},{"content":"#[test]\n\nfn test_create_on_expired_client() -> Result<(), Error> {\n\n run_binary_chain_test(&CreateOnExpiredClientTest)\n\n}\n\n\n","file_path":"tools/integration-test/src/tests/client_expiration.rs","rank":83,"score":223608.49723327905},{"content":"#[test]\n\nfn test_client_fail_refresh() -> Result<(), Error> {\n\n run_binary_chain_test(&ClientFailsTest)\n\n}\n\n\n","file_path":"tools/integration-test/src/tests/client_refresh.rs","rank":84,"score":223608.49723327905},{"content":"pub fn update_client_try_from_abci_event(\n\n abci_event: &AbciEvent,\n\n) -> Result<client_events::UpdateClient, ClientError> {\n\n client_extract_attributes_from_tx(abci_event).map(|attributes| client_events::UpdateClient {\n\n common: attributes,\n\n header: extract_header_from_tx(abci_event).ok(),\n\n })\n\n}\n\n\n","file_path":"crates/relayer/src/event.rs","rank":85,"score":220911.04849634442},{"content":"pub fn create_client_try_from_abci_event(\n\n abci_event: &AbciEvent,\n\n) -> Result<client_events::CreateClient, ClientError> {\n\n client_extract_attributes_from_tx(abci_event).map(client_events::CreateClient)\n\n}\n\n\n","file_path":"crates/relayer/src/event.rs","rank":86,"score":220911.04849634442},{"content":"pub fn upgrade_client_try_from_abci_event(\n\n abci_event: &AbciEvent,\n\n) -> Result<client_events::UpgradeClient, ClientError> {\n\n client_extract_attributes_from_tx(abci_event).map(client_events::UpgradeClient)\n\n}\n\n\n","file_path":"crates/relayer/src/event.rs","rank":87,"score":220911.04849634442},{"content":"pub fn client_misbehaviour_try_from_abci_event(\n\n abci_event: &AbciEvent,\n\n) -> Result<client_events::ClientMisbehaviour, ClientError> {\n\n client_extract_attributes_from_tx(abci_event).map(client_events::ClientMisbehaviour)\n\n}\n\n\n","file_path":"crates/relayer/src/event.rs","rank":88,"score":220911.04849634442},{"content":"pub fn into_nested_vec<T, const SIZE: usize>(array: [[T; SIZE]; SIZE]) -> Vec<Vec<T>> {\n\n array.map(|array_b| array_b.into()).into()\n\n}\n\n\n\n/**\n\n Map the elements in the fixed-sized array `[[T; SIZE]; SIZE]`.\n\n*/\n","file_path":"tools/test-framework/src/util/array.rs","rank":89,"score":219415.54260209049},{"content":"/// Default validator function for Channel identifiers.\n\n///\n\n/// A valid identifier must be between 8-64 characters and only contain\n\n/// alphabetic characters,\n\npub fn validate_channel_identifier(id: &str) -> Result<(), Error> {\n\n validate_identifier(id, 8, 64)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use crate::core::ics24_host::validate::{\n\n validate_channel_identifier, validate_client_identifier, validate_connection_identifier,\n\n validate_identifier, validate_port_identifier,\n\n };\n\n use test_log::test;\n\n\n\n #[test]\n\n fn parse_invalid_port_id_min() {\n\n // invalid min port id\n\n let id = validate_port_identifier(\"p\");\n\n assert!(id.is_err())\n\n }\n\n\n\n #[test]\n","file_path":"crates/relayer-types/src/core/ics24_host/validate.rs","rank":90,"score":219125.48040918453},{"content":"/// Default validator function for Port identifiers.\n\n///\n\n/// A valid Identifier must be between 2-128 characters and only contain lowercase\n\n/// alphabetic characters,\n\npub fn validate_port_identifier(id: &str) -> Result<(), Error> {\n\n validate_identifier(id, 2, 128)\n\n}\n\n\n","file_path":"crates/relayer-types/src/core/ics24_host/validate.rs","rank":91,"score":219125.48040918453},{"content":"/// Default validator function for Connection identifiers.\n\n///\n\n/// A valid Identifier must be between 10-64 characters and only contain lowercase\n\n/// alphabetic characters,\n\npub fn validate_connection_identifier(id: &str) -> Result<(), Error> {\n\n validate_identifier(id, 10, 64)\n\n}\n\n\n","file_path":"crates/relayer-types/src/core/ics24_host/validate.rs","rank":92,"score":219125.48040918453},{"content":"pub fn new_tx_config_for_test(\n\n chain_id: ChainId,\n\n raw_rpc_address: String,\n\n raw_grpc_address: String,\n\n address_type: AddressType,\n\n) -> Result<TxConfig, Error> {\n\n let rpc_address = Url::from_str(&raw_rpc_address).map_err(handle_generic_error)?;\n\n\n\n let rpc_client = HttpClient::new(rpc_address.clone()).map_err(handle_generic_error)?;\n\n\n\n let grpc_address = Uri::from_str(&raw_grpc_address).map_err(handle_generic_error)?;\n\n\n\n let gas_config = gas_config_for_test();\n\n\n\n let rpc_timeout = Duration::from_secs(30);\n\n\n\n let extension_options = Default::default();\n\n\n\n Ok(TxConfig {\n\n chain_id,\n","file_path":"tools/test-framework/src/relayer/tx.rs","rank":93,"score":218800.64163548307},{"content":"type UpgradeClientsForChainResult = Result<Vec<UpgradeClientResult>, Error>;\n\n\n","file_path":"crates/relayer-cli/src/commands/tx/client.rs","rank":94,"score":218148.66139425157},{"content":"fn parse_client_paths(components: &[&str]) -> Option<Path> {\n\n let first = match components.first() {\n\n Some(f) => *f,\n\n None => return None,\n\n };\n\n\n\n if first != \"clients\" {\n\n return None;\n\n }\n\n\n\n let client_id = match ClientId::from_str(components[1]) {\n\n Ok(s) => s,\n\n Err(_) => return None,\n\n };\n\n\n\n if components.len() == 3 {\n\n match components[2] {\n\n \"clientType\" => Some(ClientTypePath(client_id).into()),\n\n \"clientState\" => Some(ClientStatePath(client_id).into()),\n\n \"connections\" => Some(ClientConnectionsPath(client_id).into()),\n","file_path":"crates/relayer-types/src/core/ics24_host/path.rs","rank":95,"score":218116.7437585603},{"content":"fn encode_key_bytes(key: &KeyEntry) -> Result<Vec<u8>, Error> {\n\n let mut pk_buf = Vec::new();\n\n\n\n prost::Message::encode(&key.public_key.to_pub().to_bytes(), &mut pk_buf)\n\n .map_err(|e| Error::protobuf_encode(\"PublicKey\".into(), e))?;\n\n\n\n Ok(pk_buf)\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/encode.rs","rank":96,"score":217341.0408171086},{"content":"type UpgradeClientResult = Result<Vec<IbcEvent>, Error>;\n","file_path":"crates/relayer-cli/src/commands/tx/client.rs","rank":97,"score":215837.35247431824},{"content":"fn encode_tx_raw(tx_raw: TxRaw) -> Result<Vec<u8>, Error> {\n\n let mut tx_bytes = Vec::new();\n\n prost::Message::encode(&tx_raw, &mut tx_bytes)\n\n .map_err(|e| Error::protobuf_encode(\"Transaction\".to_string(), e))?;\n\n\n\n Ok(tx_bytes)\n\n}\n\n\n","file_path":"crates/relayer/src/chain/cosmos/encode.rs","rank":98,"score":215144.40350754256},{"content":"### Initialization\n\n\n\nThe relayer performs initialization based on the content of the configuration file:\n\n- the file is parsed and semantically validated\n\n- the chains, connections, ports, channels for which relaying is enabled are stored in the Config structure\n\n\n\n```rust\n\npub struct Config {\n\n pub global: GlobalConfig,\n\n pub chains: Vec<ChainConfig>,\n\n pub connections: Option<Vec<Connection>>,\n\n}\n\n\n\npub struct GlobalConfig {\n\n /// All valid log levels, as defined in tracing:\n\n /// https://docs.rs/tracing-core/0.1.17/tracing_core/struct.Level.html\n\n pub log_level: String,\n\n}\n\n\n\npub struct ChainConfig {\n\n pub id: ChainId,\n\n pub rpc_addr: tendermint_rpc::Url,\n\n pub websocket_addr: tendermint_rpc::Url,\n\n pub grpc_addr: tendermint_rpc::Url,\n\n pub rpc_timeout: Duration,\n\n pub account_prefix: String,\n\n pub key_name: String,\n\n pub client_ids: Vec<String>,\n\n pub gas: u64,\n\n pub trusting_period: Duration,\n\n}\n\n\n\npub struct Connection {\n\n pub src: Option<ConnectionEnd>, // use any source\n\n pub dest: Option<ConnectionEnd>, // use any destination\n\n pub paths: Option<Vec<RelayPath>>, // use any port, direction bidirectional\n\n}\n\n\n\npub struct ConnectionEnd {\n\n pub client_id: String,\n\n pub connection_id: Option<String>, // use all connections to this client\n\n}\n\n\n\npub enum Direction {\n\n Unidirectional,\n\n Bidirectional,\n\n}\n\n\n\npub struct RelayPath {\n\n pub src_port: Option<String>, // default from any source port\n\n pub dest_port: Option<String>, // default from any dest port\n\n pub src_channel: Option<String>, // default from any source port\n\n pub dest_channel: Option<String>, // default from any dest port\n\n pub direction: Direction, // default bidirectional\n\n}\n\n```\n\nAll `Option` fields with `None` values mean \"any\" values. For `direction`, default is bidirectional.\n\nAll non-`Option` fields are mandatory and must appear in the configuration file.\n\nIf the relayer is started with an invalid configuration file, an error is displayed and the realyer process exits.\n\n\n\n### Relayer Commands\n\n\n","file_path":"docs/architecture/adr-002-ibc-relayer.md","rank":99,"score":48.57111694425606}],"string":"[\n {\n \"content\": \"/// Serialize the given `Config` as TOML to the given config file.\\n\\npub fn store(config: &Config, path: impl AsRef<Path>) -> Result<(), Error> {\\n\\n let mut file = if path.as_ref().exists() {\\n\\n fs::OpenOptions::new().write(true).truncate(true).open(path)\\n\\n } else {\\n\\n File::create(path)\\n\\n }\\n\\n .map_err(Error::io)?;\\n\\n\\n\\n store_writer(config, &mut file)\\n\\n}\\n\\n\\n\\n/// Serialize the given `Config` as TOML to the given writer.\\n\\npub(crate) fn store_writer(config: &Config, mut writer: impl Write) -> Result<(), Error> {\\n\\n let toml_config = toml::to_string_pretty(&config).map_err(Error::encode)?;\\n\\n\\n\\n writeln!(writer, \\\"{}\\\", toml_config).map_err(Error::io)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/config.rs\",\n \"rank\": 0,\n \"score\": 478323.0279035492\n },\n {\n \"content\": \"/// Attempt to load and parse the TOML config file as a `Config`.\\n\\npub fn load(path: impl AsRef<Path>) -> Result<Config, Error> {\\n\\n let config_toml = std::fs::read_to_string(&path).map_err(Error::io)?;\\n\\n\\n\\n let config = toml::from_str::<Config>(&config_toml[..]).map_err(Error::decode)?;\\n\\n\\n\\n Ok(config)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/config.rs\",\n \"rank\": 1,\n \"score\": 472487.37160788744\n },\n {\n \"content\": \"pub fn disable_grpc_web(config: &mut Value) -> Result<(), Error> {\\n\\n if let Some(field) = config.get_mut(\\\"grpc-web\\\") {\\n\\n field\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\\"enable\\\".to_string(), false.into());\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 2,\n \"score\": 427282.48634847626\n },\n {\n \"content\": \"pub fn apply_prefix(prefix: &CommitmentPrefix, mut path: Vec<String>) -> MerklePath {\\n\\n let mut key_path: Vec<String> = vec![format!(\\\"{:?}\\\", prefix)];\\n\\n key_path.append(&mut path);\\n\\n MerklePath { key_path }\\n\\n}\\n\\n\\n\\nimpl From<CommitmentRoot> for MerkleRoot {\\n\\n fn from(root: CommitmentRoot) -> Self {\\n\\n Self {\\n\\n hash: root.into_vec(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub struct MerkleProof {\\n\\n pub proofs: Vec<CommitmentProof>,\\n\\n}\\n\\n\\n\\n/// Convert to ics23::CommitmentProof\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics23_commitment/merkle.rs\",\n \"rank\": 3,\n \"score\": 407938.1637832237\n },\n {\n \"content\": \"pub fn set_grpc_port(config: &mut Value, port: u16) -> Result<(), Error> {\\n\\n config\\n\\n .get_mut(\\\"grpc\\\")\\n\\n .ok_or_else(|| eyre!(\\\"expect grpc section\\\"))?\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\\"address\\\".to_string(), format!(\\\"0.0.0.0:{}\\\", port).into());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 4,\n \"score\": 405219.7439838312\n },\n {\n \"content\": \"/// Set the `consensus.timeout_commit` field in the full node config.\\n\\npub fn set_timeout_commit(config: &mut Value, duration: Duration) -> Result<(), Error> {\\n\\n config\\n\\n .get_mut(\\\"consensus\\\")\\n\\n .ok_or_else(|| eyre!(\\\"expect consensus section\\\"))?\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\n\\n \\\"timeout_commit\\\".to_string(),\\n\\n format!(\\\"{}ms\\\", duration.as_millis()).into(),\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 5,\n \"score\": 405162.1942920741\n },\n {\n \"content\": \"pub fn save_relayer_config(config: &Config, config_path: &Path) -> Result<(), Error> {\\n\\n let config_str = toml::to_string_pretty(&config)?;\\n\\n\\n\\n fs::write(&config_path, &config_str)?;\\n\\n\\n\\n info!(\\n\\n \\\"written hermes config.toml to {}:\\\\n{}\\\",\\n\\n config_path.display(),\\n\\n config_str\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nimpl BootstrapClientOptions {\\n\\n /// Overrides options for the foreign client connecting chain A to chain B.\\n\\n pub fn client_options_a_to_b(mut self, options: ClientOptions) -> Self {\\n\\n self.client_options_a_to_b = options;\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"tools/test-framework/src/bootstrap/binary/chain.rs\",\n \"rank\": 6,\n \"score\": 397928.9810670435\n },\n {\n \"content\": \"pub fn disable_api(config: &mut Value) -> Result<(), Error> {\\n\\n if let Some(field) = config.get_mut(\\\"api\\\") {\\n\\n field\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\\"enable\\\".to_string(), false.into());\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 7,\n \"score\": 383904.6654846188\n },\n {\n \"content\": \"pub fn write_env(path: impl AsRef<Path>, exporter: &impl ExportEnv) -> Result<(), Error> {\\n\\n write(path, format_env(exporter))?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tools/test-framework/src/types/env.rs\",\n \"rank\": 8,\n \"score\": 378063.18538837804\n },\n {\n \"content\": \"pub fn add_chain_config(config: &mut Config, running_node: &FullNode) -> Result<(), Error> {\\n\\n let chain_config = running_node.generate_chain_config(&running_node.chain_driver.chain_type)?;\\n\\n\\n\\n config.chains.push(chain_config);\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/**\\n\\n Save a relayer's [`Config`] to the filesystem to make it accessible\\n\\n through external CLI.\\n\\n*/\\n\",\n \"file_path\": \"tools/test-framework/src/bootstrap/binary/chain.rs\",\n \"rank\": 9,\n \"score\": 367648.30505292816\n },\n {\n \"content\": \"pub fn set_mode(config: &mut Value, mode: &str) -> Result<(), Error> {\\n\\n config\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\\"mode\\\".to_string(), mode.into());\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 10,\n \"score\": 363116.9032045953\n },\n {\n \"content\": \"/// Set the `p2p` field in the full node config.\\n\\npub fn set_p2p_port(config: &mut Value, port: u16) -> Result<(), Error> {\\n\\n config\\n\\n .get_mut(\\\"p2p\\\")\\n\\n .ok_or_else(|| eyre!(\\\"expect p2p section\\\"))?\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\n\\n \\\"laddr\\\".to_string(),\\n\\n format!(\\\"tcp://0.0.0.0:{}\\\", port).into(),\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 11,\n \"score\": 359576.9783965756\n },\n {\n \"content\": \"/// Set the `rpc` field in the full node config.\\n\\npub fn set_rpc_port(config: &mut Value, port: u16) -> Result<(), Error> {\\n\\n config\\n\\n .get_mut(\\\"rpc\\\")\\n\\n .ok_or_else(|| eyre!(\\\"expect rpc section\\\"))?\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\n\\n \\\"laddr\\\".to_string(),\\n\\n format!(\\\"tcp://0.0.0.0:{}\\\", port).into(),\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 12,\n \"score\": 359576.9783965756\n },\n {\n \"content\": \"/// Set the `consensus.timeout_propose` field in the full node config.\\n\\npub fn set_timeout_propose(config: &mut Value, duration: Duration) -> Result<(), Error> {\\n\\n config\\n\\n .get_mut(\\\"consensus\\\")\\n\\n .ok_or_else(|| eyre!(\\\"expect consensus section\\\"))?\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\n\\n \\\"timeout_propose\\\".to_string(),\\n\\n format!(\\\"{}ms\\\", duration.as_millis()).into(),\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 13,\n \"score\": 359576.87407289376\n },\n {\n \"content\": \"pub fn set_mempool_version(config: &mut Value, version: &str) -> Result<(), Error> {\\n\\n config\\n\\n .get_mut(\\\"mempool\\\")\\n\\n .ok_or_else(|| eyre!(\\\"expect mempool section\\\"))?\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\\"version\\\".to_string(), version.into());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 14,\n \"score\": 359570.9755860737\n },\n {\n \"content\": \"/// Set the `log_level` field in the full node config.\\n\\npub fn set_log_level(config: &mut Value, log_level: &str) -> Result<(), Error> {\\n\\n config\\n\\n .as_table_mut()\\n\\n .ok_or_else(|| eyre!(\\\"expect object\\\"))?\\n\\n .insert(\\\"log_level\\\".to_string(), log_level.into());\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/config.rs\",\n \"rank\": 15,\n \"score\": 356135.2514378173\n },\n {\n \"content\": \"/// Spawns a chain runtime for the chain in the configuration identified by given a chain identifier.\\n\\n///\\n\\n/// This function will use the default [`ChainHandle`] implementation, ie. the [`BaseChainHandle`].\\n\\n///\\n\\n/// Returns the corresponding handle if successful.\\n\\npub fn spawn_chain_runtime(config: &Config, chain_id: &ChainId) -> Result<impl ChainHandle, Error> {\\n\\n spawn_chain_runtime_generic::<BaseChainHandle>(config, chain_id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/cli_utils.rs\",\n \"rank\": 16,\n \"score\": 351838.53978398844\n },\n {\n \"content\": \"/// Default configuration file path\\n\\npub fn default_config_file() -> Option<PathBuf> {\\n\\n dirs_next::home_dir().map(|home| home.join(DEFAULT_CONFIG_PATH))\\n\\n}\\n\\n\\n\\n/// Cli Subcommands\\n\\n#[derive(Command, Parser, Debug, Runnable)]\\n\\npub enum CliCmd {\\n\\n /// Validate Hermes configuration file\\n\\n #[clap(subcommand)]\\n\\n Config(ConfigCmd),\\n\\n\\n\\n /// Manage keys in the relayer for each chain\\n\\n #[clap(subcommand)]\\n\\n Keys(KeysCmd),\\n\\n\\n\\n /// Create objects (client, connection, or channel) on chains\\n\\n #[clap(subcommand)]\\n\\n Create(CreateCmds),\\n\\n\\n\\n /// Update objects (clients) on chains\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands.rs\",\n \"rank\": 17,\n \"score\": 339594.0188895563\n },\n {\n \"content\": \"/// Method for syntactic validation of the input configuration file.\\n\\npub fn validate_config(config: &Config) -> Result<(), Diagnostic<Error>> {\\n\\n // Check for duplicate chain configuration and invalid trust thresholds\\n\\n let mut unique_chain_ids = BTreeSet::new();\\n\\n for c in config.chains.iter() {\\n\\n let already_present = !unique_chain_ids.insert(c.id.clone());\\n\\n if already_present {\\n\\n return Err(Diagnostic::Error(Error::duplicate_chains(c.id.clone())));\\n\\n }\\n\\n\\n\\n validate_trust_threshold(&c.id, c.trust_threshold)?;\\n\\n\\n\\n // Validate gas-related settings\\n\\n validate_gas_settings(&c.id, c)?;\\n\\n }\\n\\n\\n\\n // Check for invalid mode config\\n\\n validate_mode(&config.mode)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/config.rs\",\n \"rank\": 18,\n \"score\": 332046.6170983389\n },\n {\n \"content\": \"pub fn handle_generic_error(e: impl Into<Report>) -> Error {\\n\\n Error::generic(e.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/error.rs\",\n \"rank\": 19,\n \"score\": 320578.4483229698\n },\n {\n \"content\": \"/// Get the path to configuration file\\n\\npub fn config_path() -> Option<PathBuf> {\\n\\n let app = app_reader();\\n\\n app.config_path().cloned()\\n\\n}\\n\\n\\n\\n// Specifies all the possible syntactic errors\\n\\n// that a Hermes configuration file could contain.\\n\\ndefine_error! {\\n\\n Error {\\n\\n ZeroChain\\n\\n |_| { \\\"config file does not specify any chain\\\" },\\n\\n\\n\\n InvalidLogDirective\\n\\n { directive: String, }\\n\\n [ TraceError<ParseError> ]\\n\\n |e| {\\n\\n format!(\\\"invalid log directive: {0:?}\\\", e.directive)\\n\\n },\\n\\n\\n\\n InvalidMode\\n\",\n \"file_path\": \"crates/relayer-cli/src/config.rs\",\n \"rank\": 20,\n \"score\": 319094.1680377942\n },\n {\n \"content\": \"pub fn handle_exec_error(command: &str) -> impl FnOnce(IoError) -> Error + '_ {\\n\\n |e| match e.kind() {\\n\\n IoErrorKind::NotFound => Error::command_not_found(command.to_string(), e),\\n\\n _ => Error::io(e),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Report> for Error {\\n\\n fn from(e: Report) -> Self {\\n\\n Error::generic(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<IoError> for Error {\\n\\n fn from(e: IoError) -> Self {\\n\\n Error::io(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<RelayerError> for Error {\\n\",\n \"file_path\": \"tools/test-framework/src/error.rs\",\n \"rank\": 21,\n \"score\": 315636.5642301148\n },\n {\n \"content\": \"// TODO move to ics23\\n\\nfn calculate_non_existence_root(proof: &NonExistenceProof) -> Result<Vec<u8>, Error> {\\n\\n if let Some(left) = &proof.left {\\n\\n calculate_existence_root::<ics23::HostFunctionsManager>(left)\\n\\n .map_err(|_| Error::invalid_merkle_proof())\\n\\n } else if let Some(right) = &proof.right {\\n\\n calculate_existence_root::<ics23::HostFunctionsManager>(right)\\n\\n .map_err(|_| Error::invalid_merkle_proof())\\n\\n } else {\\n\\n Err(Error::invalid_merkle_proof())\\n\\n }\\n\\n}\\n\\n\\n\\n// Merkle Proof serialization notes:\\n\\n// \\\"Proof\\\" id currently defined in a number of forms and included in a number of places\\n\\n// - TmProof: in tendermint-rs/src/merkle/proof.rs:Proof\\n\\n// - RawProofOps: in tendermint-proto/tendermint.cyrpto.rs:ProofOps\\n\\n// - RawMerkleProof: in ibc-proto/ibc.core.commitment.v1.rs:MerkleProof\\n\\n// - structure that includes a RawProofOps in its only `proof` field.\\n\\n// #[derive(Clone, PartialEq, ::prost::Message)]\\n\\n// pub struct MerkleProof {\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics23_commitment/merkle.rs\",\n \"rank\": 22,\n \"score\": 296032.16788666346\n },\n {\n \"content\": \"pub fn collect_gen_txs(chain_id: &str, command_path: &str, home_path: &str) -> Result<(), Error> {\\n\\n simple_exec(\\n\\n chain_id,\\n\\n command_path,\\n\\n &[\\\"--home\\\", home_path, \\\"collect-gentxs\\\"],\\n\\n )?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/chain/cli/bootstrap.rs\",\n \"rank\": 23,\n \"score\": 289832.19175391237\n },\n {\n \"content\": \"pub fn assert_same_dimension<T>(size: usize, list: &Vec<Vec<T>>) -> Result<(), Error> {\\n\\n if list.len() != size {\\n\\n return Err(Error::generic(eyre!(\\n\\n \\\"expect nested vector to have the dimension {} x {}\\\",\\n\\n size,\\n\\n size\\n\\n )));\\n\\n }\\n\\n\\n\\n for list_b in list.iter() {\\n\\n if list_b.len() != size {\\n\\n return Err(Error::generic(eyre!(\\n\\n \\\"expect nested vector to have the dimension {} x {}\\\",\\n\\n size,\\n\\n size\\n\\n )));\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tools/test-framework/src/util/array.rs\",\n \"rank\": 24,\n \"score\": 288802.13554591616\n },\n {\n \"content\": \"fn disk_store_path(folder_name: &str) -> Result<PathBuf, Error> {\\n\\n let home = dirs_next::home_dir().ok_or_else(Error::home_location_unavailable)?;\\n\\n\\n\\n let folder = Path::new(home.as_path())\\n\\n .join(KEYSTORE_DEFAULT_FOLDER)\\n\\n .join(folder_name)\\n\\n .join(KEYSTORE_DISK_BACKEND);\\n\\n\\n\\n Ok(folder)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/keyring.rs\",\n \"rank\": 25,\n \"score\": 287823.18195968354\n },\n {\n \"content\": \"#[instrument(skip_all, level = \\\"error\\\", fields(chain = %config.id))]\\n\\npub fn listen(config: &ChainConfig, filters: &[EventFilter]) -> eyre::Result<()> {\\n\\n let rt = Arc::new(TokioRuntime::new()?);\\n\\n let (event_monitor, rx) = subscribe(config, rt)?;\\n\\n\\n\\n info!(\\n\\n \\\"listening for queries: {}\\\",\\n\\n event_monitor.queries().iter().format(\\\", \\\"),\\n\\n );\\n\\n\\n\\n thread::spawn(|| event_monitor.run());\\n\\n\\n\\n while let Ok(event_batch) = rx.recv() {\\n\\n match event_batch {\\n\\n Ok(batch) => {\\n\\n let _span =\\n\\n tracing::error_span!(\\\"event_batch\\\", batch_height = %batch.height).entered();\\n\\n\\n\\n let matching_events = batch\\n\\n .events\\n\\n .into_iter()\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/listen.rs\",\n \"rank\": 26,\n \"score\": 284668.5192043012\n },\n {\n \"content\": \"pub fn list_keys(config: ChainConfig) -> eyre::Result<Vec<(String, KeyEntry)>> {\\n\\n let keyring = KeyRing::new(Store::Test, &config.account_prefix, &config.id)?;\\n\\n let keys = keyring.keys()?;\\n\\n Ok(keys)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::KeysListCmd;\\n\\n\\n\\n use abscissa_core::clap::Parser;\\n\\n use ibc_relayer_types::core::ics24_host::identifier::ChainId;\\n\\n\\n\\n #[test]\\n\\n fn test_keys_list() {\\n\\n assert_eq!(\\n\\n KeysListCmd {\\n\\n chain_id: ChainId::from_string(\\\"chain_id\\\")\\n\\n },\\n\\n KeysListCmd::parse_from(&[\\\"test\\\", \\\"--chain\\\", \\\"chain_id\\\"])\\n\\n )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_keys_list_no_chain() {\\n\\n assert!(KeysListCmd::try_parse_from(&[\\\"test\\\"]).is_err())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/keys/list.rs\",\n \"rank\": 27,\n \"score\": 284267.93200589804\n },\n {\n \"content\": \"/// Converts error codes originating from `broadcast_tx_sync` responses\\n\\n/// into IBC relayer domain-type errors.\\n\\n/// See [`tendermint_rpc::endpoint::broadcast::tx_sync::Response`].\\n\\n/// Cf: <https://github.com/cosmos/cosmos-sdk/blob/v0.42.10/types/errors/errors.go>\\n\\npub fn sdk_error_from_tx_sync_error_code(code: u32) -> SdkError {\\n\\n match code {\\n\\n // The primary reason (we know of) causing broadcast_tx_sync to fail\\n\\n // is due to \\\"out of gas\\\" errors. These are unrecoverable at the moment\\n\\n // on Hermes side. We'll inform the user to check for misconfiguration.\\n\\n 11 => SdkError::out_of_gas(code),\\n\\n 13 => SdkError::insufficient_fee(code),\\n\\n _ => SdkError::unknown_tx_sync(code),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/relayer/src/sdk_error.rs\",\n \"rank\": 28,\n \"score\": 283797.8527209969\n },\n {\n \"content\": \"// Converts the error in a TxResult into SdkError with the same\\n\\n// mapping as defined in ibc-go and cosmos-sdk. This assumes the\\n\\n// target chain we are interacting with are using cosmos-sdk and ibc-go.\\n\\n//\\n\\n// TODO: investigate ways to automatically generate the mapping by parsing\\n\\n// the errors.go source code directly\\n\\npub fn sdk_error_from_tx_result(result: &TxResult) -> SdkError {\\n\\n match result.code {\\n\\n Code::Ok => SdkError::unexpected_ok(),\\n\\n Code::Err(code) => {\\n\\n let codespace = result.codespace.to_string();\\n\\n if codespace == \\\"client\\\" {\\n\\n SdkError::client(client_error_from_code(code))\\n\\n } else {\\n\\n // TODO: Implement mapping for other codespaces in ibc-go\\n\\n SdkError::unknown_sdk(codespace, code)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/sdk_error.rs\",\n \"rank\": 29,\n \"score\": 282551.59809277975\n },\n {\n \"content\": \"pub fn init_test() -> Result<TestConfig, Error> {\\n\\n let no_color_log = env::var(\\\"NO_COLOR_LOG\\\")\\n\\n .ok()\\n\\n .map(|val| val == \\\"1\\\")\\n\\n .unwrap_or(false);\\n\\n\\n\\n INIT.call_once(|| {\\n\\n if enable_ansi() && !no_color_log {\\n\\n color_eyre::install().unwrap();\\n\\n }\\n\\n install_logger(!no_color_log);\\n\\n });\\n\\n\\n\\n let chain_command_path = env::var(\\\"CHAIN_COMMAND_PATH\\\").unwrap_or_else(|_| \\\"gaiad\\\".to_string());\\n\\n\\n\\n let base_chain_store_dir = env::var(\\\"CHAIN_STORE_DIR\\\").unwrap_or_else(|_| \\\"data\\\".to_string());\\n\\n\\n\\n let account_prefix = env::var(\\\"ACCOUNT_PREFIX\\\").unwrap_or_else(|_| \\\"cosmos\\\".to_string());\\n\\n\\n\\n let chain_store_dir = format!(\\\"{}/test-{}\\\", base_chain_store_dir, random_u32());\\n\",\n \"file_path\": \"tools/test-framework/src/bootstrap/init.rs\",\n \"rank\": 30,\n \"score\": 279835.98875203537\n },\n {\n \"content\": \"/// Returns `true` if the relayer should filter based on\\n\\n/// client state attributes, e.g., trust threshold.\\n\\n/// Returns `false` otherwise.\\n\\nfn client_filter_enabled(_config: &Config) -> bool {\\n\\n // we currently always enable the client filter\\n\\n true\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/supervisor.rs\",\n \"rank\": 31,\n \"score\": 278603.60130240914\n },\n {\n \"content\": \"pub fn assemble_version_info(sender: &channel::Sender<Request>) -> Vec<VersionInfo> {\\n\\n // Fetch the relayer library version\\n\\n let lib_version = submit_request(sender, |reply_to| Request::Version { reply_to })\\n\\n .map_err(|e| {\\n\\n error!(\\n\\n \\\"[rest-server] failed while fetching relayer lib version info: {}\\\",\\n\\n e\\n\\n )\\n\\n })\\n\\n .unwrap_or(VersionInfo {\\n\\n name: \\\"[ibc relayer library]\\\".to_string(),\\n\\n version: \\\"[failed to fetch the version]\\\".to_string(),\\n\\n });\\n\\n // Append the REST API version info\\n\\n let rest_api_version = VersionInfo {\\n\\n name: NAME.to_string(),\\n\\n version: VER.to_string(),\\n\\n };\\n\\n\\n\\n vec![lib_version, rest_api_version]\\n\\n}\\n\",\n \"file_path\": \"crates/relayer-rest/src/handle.rs\",\n \"rank\": 32,\n \"score\": 271384.3238614669\n },\n {\n \"content\": \"pub fn parse_itf_from_json(itf_path: &str) -> Vec<State> {\\n\\n let itf_json = std::fs::read_to_string(itf_path).expect(\\\"itf file does not exist. did you run `apalache check --inv=Invariant --run-dir=run main.tla` first?\\\");\\n\\n\\n\\n let trace: InformalTrace<State> =\\n\\n serde_json::from_str(&itf_json).expect(\\\"deserialization error\\\");\\n\\n\\n\\n trace.states\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/integration-test/src/mbt/utils.rs\",\n \"rank\": 33,\n \"score\": 269258.0203834154\n },\n {\n \"content\": \"/// Obtain a read-only (multi-reader) lock on the application configuration.\\n\\n///\\n\\n/// Panics if the application configuration has not been loaded.\\n\\npub fn app_config() -> config::Reader<Config> {\\n\\n APPLICATION.config.read()\\n\\n}\\n\\n\\n\\n/// Cli Application\\n\\n#[derive(Debug)]\\n\\npub struct CliApp {\\n\\n /// Application configuration.\\n\\n config: CfgCell<Config>,\\n\\n\\n\\n /// Application state.\\n\\n state: application::State<Self>,\\n\\n\\n\\n /// Toggle json output on/off. Changed with the global config option `-j` / `--json`.\\n\\n json_output: bool,\\n\\n\\n\\n /// Path to the config file.\\n\\n config_path: Option<PathBuf>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/application.rs\",\n \"rank\": 34,\n \"score\": 266867.04861239676\n },\n {\n \"content\": \"pub fn delete_key(config: &ChainConfig, key_name: &str) -> eyre::Result<()> {\\n\\n let mut keyring = KeyRing::new(Store::Test, &config.account_prefix, &config.id)?;\\n\\n keyring.remove_key(key_name)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/keys/delete.rs\",\n \"rank\": 35,\n \"score\": 265549.9850182455\n },\n {\n \"content\": \"/// Default validator function for Client identifiers.\\n\\n///\\n\\n/// A valid identifier must be between 9-64 characters and only contain lowercase\\n\\n/// alphabetic characters,\\n\\npub fn validate_client_identifier(id: &str) -> Result<(), Error> {\\n\\n validate_identifier(id, 9, 64)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics24_host/validate.rs\",\n \"rank\": 36,\n \"score\": 264816.0283405822\n },\n {\n \"content\": \"fn auth_info_and_bytes(signer_info: SignerInfo, fee: Fee) -> Result<(AuthInfo, Vec<u8>), Error> {\\n\\n let auth_info = AuthInfo {\\n\\n signer_infos: vec![signer_info],\\n\\n fee: Some(fee),\\n\\n\\n\\n // Since Cosmos SDK v0.46.0\\n\\n tip: None,\\n\\n };\\n\\n\\n\\n // A protobuf serialization of a AuthInfo\\n\\n let mut auth_buf = Vec::new();\\n\\n\\n\\n prost::Message::encode(&auth_info, &mut auth_buf)\\n\\n .map_err(|e| Error::protobuf_encode(String::from(\\\"AuthInfo\\\"), e))?;\\n\\n\\n\\n Ok((auth_info, auth_buf))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/encode.rs\",\n \"rank\": 37,\n \"score\": 263879.11910025764\n },\n {\n \"content\": \"fn run_and_collect_events<F>(ev_list: &mut Vec<IbcEvent>, f: F)\\n\\nwhere\\n\\n F: FnOnce() -> Result<Vec<IbcEvent>, LinkError>,\\n\\n{\\n\\n match f() {\\n\\n Ok(mut ev) => ev_list.append(&mut ev),\\n\\n Err(e) => Output::error(Error::link(e)).exit(),\\n\\n };\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::ClearPacketsCmd;\\n\\n\\n\\n use std::str::FromStr;\\n\\n\\n\\n use abscissa_core::clap::Parser;\\n\\n use ibc_relayer_types::core::ics24_host::identifier::{ChainId, ChannelId, PortId};\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/clear.rs\",\n \"rank\": 38,\n \"score\": 257522.47030885177\n },\n {\n \"content\": \"// The error code mapping follows the Go code at\\n\\n// ibc-go/modules/core/02-client/types/errors.go\\n\\nfn client_error_from_code(code: u32) -> ClientError {\\n\\n match code {\\n\\n 2 => ClientError::light_client_already_exists(),\\n\\n 3 => ClientError::invalid_light_client(),\\n\\n 4 => ClientError::light_client_not_found(),\\n\\n 5 => ClientError::frozen_light_client(),\\n\\n 6 => ClientError::invalid_client_metadata(),\\n\\n 7 => ClientError::consensus_state_not_found(),\\n\\n 8 => ClientError::invalid_consensus_state(),\\n\\n 9 => ClientError::client_type_not_found(),\\n\\n 10 => ClientError::invalid_client_type(),\\n\\n 11 => ClientError::commitment_root_not_found(),\\n\\n 12 => ClientError::invalid_client_header(),\\n\\n 13 => ClientError::invalid_light_client_misbehavior(),\\n\\n 14 => ClientError::client_state_verification_failed(),\\n\\n 15 => ClientError::client_consensus_state_verification_failed(),\\n\\n 16 => ClientError::connection_state_verification_failed(),\\n\\n 17 => ClientError::client_state_verification_failed(),\\n\\n 18 => ClientError::packet_commitment_verification_failed(),\\n\\n 19 => ClientError::packet_acknowledgement_verification_failed(),\\n\",\n \"file_path\": \"crates/relayer/src/sdk_error.rs\",\n \"rank\": 39,\n \"score\": 257133.4530883813\n },\n {\n \"content\": \"/// Generate packet filters from Vec<IBCPath> and load them in a Map(chain_name -> filter).\\n\\nfn construct_packet_filters(ibc_paths: Vec<IBCPath>) -> HashMap<String, PacketFilter> {\\n\\n let mut packet_filters = HashMap::new();\\n\\n\\n\\n for path in ibc_paths {\\n\\n for channel in path.channels {\\n\\n let chain_1 = path.chain_1.chain_name.to_owned();\\n\\n let chain_2 = path.chain_2.chain_name.to_owned();\\n\\n\\n\\n let filters_1 = packet_filters.entry(chain_1).or_insert(Vec::new());\\n\\n\\n\\n filters_1.push((\\n\\n FilterPattern::Exact(channel.chain_1.port_id.clone()),\\n\\n FilterPattern::Exact(channel.chain_1.channel_id.clone()),\\n\\n ));\\n\\n\\n\\n let filters_2 = packet_filters.entry(chain_2).or_insert(Vec::new());\\n\\n\\n\\n filters_2.push((\\n\\n FilterPattern::Exact(channel.chain_2.port_id.clone()),\\n\\n FilterPattern::Exact(channel.chain_2.channel_id.clone()),\\n\",\n \"file_path\": \"crates/relayer-cli/src/chain_registry.rs\",\n \"rank\": 40,\n \"score\": 255795.83336512157\n },\n {\n \"content\": \"pub fn initialize(chain_id: &str, command_path: &str, home_path: &str) -> Result<(), Error> {\\n\\n simple_exec(\\n\\n chain_id,\\n\\n command_path,\\n\\n &[\\n\\n \\\"--home\\\",\\n\\n home_path,\\n\\n \\\"--chain-id\\\",\\n\\n chain_id,\\n\\n \\\"init\\\",\\n\\n chain_id,\\n\\n ],\\n\\n )?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tools/test-framework/src/chain/cli/bootstrap.rs\",\n \"rank\": 41,\n \"score\": 252487.0434895006\n },\n {\n \"content\": \"pub fn extract_client_id(event: &IbcEvent) -> Result<&ClientId, ForeignClientError> {\\n\\n match event {\\n\\n IbcEvent::CreateClient(ev) => Ok(ev.client_id()),\\n\\n IbcEvent::UpdateClient(ev) => Ok(ev.client_id()),\\n\\n _ => Err(ForeignClientError::missing_client_id_from_event(\\n\\n event.clone(),\\n\\n )),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/relayer/src/foreign_client.rs\",\n \"rank\": 42,\n \"score\": 251385.56578812157\n },\n {\n \"content\": \"pub fn try_into_array<T, const SIZE: usize>(list: Vec<T>) -> Result<[T; SIZE], Error> {\\n\\n list.try_into()\\n\\n .map_err(|_| Error::generic(eyre!(\\\"vector is not of length {}\\\", SIZE)))\\n\\n}\\n\\n\\n\\n/**\\n\\n Converts a dynamic-sized nested vector `Vec<Vec<T>>` into a fixed-sized\\n\\n nested array `[[T; SIZE]; SIZE]`. Fails if the nested vector is not of\\n\\n `SIZE`x`SIZE` length.\\n\\n*/\\n\",\n \"file_path\": \"tools/test-framework/src/util/array.rs\",\n \"rank\": 43,\n \"score\": 251302.6604611411\n },\n {\n \"content\": \"/// This method is the workhorse for deserializing\\n\\n/// the `key` field from a public key.\\n\\nfn deserialize_key<'de, D>(deser: D) -> Result<Vec<u8>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n // The key is a byte array that is base64-encoded\\n\\n // and then marshalled into a JSON String.\\n\\n let based64_encoded: Result<String, _> = Deserialize::deserialize(deser);\\n\\n let value = base64::decode(based64_encoded?)\\n\\n .map_err(|e| serde::de::Error::custom(format!(\\\"error in decoding: {}\\\", e)))?;\\n\\n\\n\\n Ok(value)\\n\\n}\\n\\n\\n\\nimpl FromStr for EncodedPubKey {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n // Try to deserialize into a JSON Value.\\n\\n let maybe_json: Result<ProtoAny, _> = serde_json::from_str(s);\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/keyring/pub_key.rs\",\n \"rank\": 44,\n \"score\": 249010.0442452476\n },\n {\n \"content\": \"/// The default amount of gas the relayer is willing to pay for a transaction,\\n\\n/// when it cannot simulate the tx and therefore estimate the gas amount needed.\\n\\npub fn default_gas_from_config(config: &ChainConfig) -> u64 {\\n\\n config\\n\\n .default_gas\\n\\n .unwrap_or_else(|| max_gas_from_config(config))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/types/gas.rs\",\n \"rank\": 45,\n \"score\": 247087.68599498548\n },\n {\n \"content\": \"/// The maximum amount of gas the relayer is willing to pay for a transaction\\n\\npub fn max_gas_from_config(config: &ChainConfig) -> u64 {\\n\\n config.max_gas.unwrap_or(DEFAULT_MAX_GAS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/types/gas.rs\",\n \"rank\": 46,\n \"score\": 247087.68599498548\n },\n {\n \"content\": \"/// The gas multiplier\\n\\npub fn gas_multiplier_from_config(config: &ChainConfig) -> f64 {\\n\\n config.gas_multiplier.unwrap_or_default().to_f64()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/types/gas.rs\",\n \"rank\": 47,\n \"score\": 247087.68599498548\n },\n {\n \"content\": \"pub fn decode_header<B: Buf>(buf: B) -> Result<Header, Error> {\\n\\n RawHeader::decode(buf).map_err(Error::decode)?.try_into()\\n\\n}\\n\\n\\n\\nimpl From<Header> for RawHeader {\\n\\n fn from(value: Header) -> Self {\\n\\n RawHeader {\\n\\n signed_header: Some(value.signed_header.into()),\\n\\n validator_set: Some(value.validator_set.into()),\\n\\n trusted_height: Some(value.trusted_height.into()),\\n\\n trusted_validators: Some(value.trusted_validator_set.into()),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(any(test, feature = \\\"mocks\\\"))]\\n\\npub mod test_util {\\n\\n use alloc::vec;\\n\\n\\n\\n use subtle_encoding::hex;\\n\",\n \"file_path\": \"crates/relayer-types/src/clients/ics07_tendermint/header.rs\",\n \"rank\": 48,\n \"score\": 246770.51007384676\n },\n {\n \"content\": \"fn parse_sdk_version(version_info: &VersionInfo) -> Result<semver::Version, Error> {\\n\\n let module = version_info\\n\\n .build_deps\\n\\n .iter()\\n\\n .find(|&m| m.path.contains(SDK_MODULE_NAME))\\n\\n .ok_or_else(|| {\\n\\n Error::sdk_module_not_found(SDK_MODULE_NAME.to_string(), AppInfo::from(version_info))\\n\\n })?;\\n\\n\\n\\n // The raw version number has a leading 'v', trim it out;\\n\\n let plain_version = module.version.trim_start_matches('v');\\n\\n\\n\\n // Parse the module version\\n\\n let mut version = semver::Version::parse(plain_version).map_err(|e| {\\n\\n Error::version_parsing_failed(\\n\\n module.path.clone(),\\n\\n module.version.clone(),\\n\\n e.to_string(),\\n\\n AppInfo::from(version_info),\\n\\n )\\n\\n })?;\\n\\n\\n\\n // Remove the pre-release version to ensure we treat pre-releases of the SDK\\n\\n // as their normal version, eg. 0.42.0-rc2 should satisfy >=0.41.3, <= 0.42.6.\\n\\n version.pre = semver::Prerelease::EMPTY;\\n\\n\\n\\n Ok(version)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/version.rs\",\n \"rank\": 49,\n \"score\": 246650.9613252448\n },\n {\n \"content\": \"pub fn convert_tm_to_ics_merkle_proof(tm_proof: &TendermintProof) -> Result<MerkleProof, Error> {\\n\\n let mut proofs = Vec::new();\\n\\n\\n\\n for op in &tm_proof.ops {\\n\\n let mut parsed = ibc_proto::ics23::CommitmentProof { proof: None };\\n\\n prost::Message::merge(&mut parsed, op.data.as_slice())\\n\\n .map_err(Error::commitment_proof_decoding_failed)?;\\n\\n\\n\\n proofs.push(parsed);\\n\\n }\\n\\n\\n\\n Ok(MerkleProof::from(RawMerkleProof { proofs }))\\n\\n}\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics23_commitment/merkle.rs\",\n \"rank\": 50,\n \"score\": 244613.28293734652\n },\n {\n \"content\": \"#[test]\\n\\npub fn example_test() -> Result<(), Error> {\\n\\n run_binary_channel_test(&ExampleTest)\\n\\n}\\n\\n\\n\\npub struct ExampleTest;\\n\\n\\n\\nimpl TestOverrides for ExampleTest {}\\n\\n\\n\\nimpl BinaryChannelTest for ExampleTest {\\n\\n fn run<ChainA: ChainHandle, ChainB: ChainHandle>(\\n\\n &self,\\n\\n _config: &TestConfig,\\n\\n _relayer: RelayerDriver,\\n\\n _chains: ConnectedChains<ChainA, ChainB>,\\n\\n _channel: ConnectedChannel<ChainA, ChainB>,\\n\\n ) -> Result<(), Error> {\\n\\n suspend()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tools/integration-test/src/tests/example.rs\",\n \"rank\": 51,\n \"score\": 242197.50145021267\n },\n {\n \"content\": \"pub fn all_chain_ids(sender: &channel::Sender<Request>) -> Result<Vec<ChainId>, RestApiError> {\\n\\n submit_request(sender, |reply_to| Request::GetChains { reply_to })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-rest/src/handle.rs\",\n \"rank\": 52,\n \"score\": 241848.68038917956\n },\n {\n \"content\": \"pub fn extract_header_from_tx(event: &AbciEvent) -> Result<Box<dyn Header>, Error> {\\n\\n for tag in &event.attributes {\\n\\n let key = tag.key.as_ref();\\n\\n let value = tag.value.as_ref();\\n\\n if key == HEADER_ATTRIBUTE_KEY {\\n\\n return AnyHeader::decode_from_string(value).map(AnyHeader::into_box);\\n\\n }\\n\\n }\\n\\n Err(Error::missing_raw_header())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use ibc_relayer_types::core::ics02_client::client_type::ClientType;\\n\\n use ibc_relayer_types::mock::header::MockHeader;\\n\\n use ibc_relayer_types::Height;\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/types/events/client.rs\",\n \"rank\": 53,\n \"score\": 241376.49939765118\n },\n {\n \"content\": \"pub fn get_dummy_proof() -> Vec<u8> {\\n\\n \\\"Y29uc2Vuc3VzU3RhdGUvaWJjb25lY2xpZW50LzIy\\\"\\n\\n .as_bytes()\\n\\n .to_vec()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-types/src/test_utils.rs\",\n \"rank\": 54,\n \"score\": 240658.09453442082\n },\n {\n \"content\": \"pub fn new_registry(config: Config) -> SharedRegistry<CountingAndCachingChainHandle> {\\n\\n <SharedRegistry<CountingAndCachingChainHandle>>::new(config)\\n\\n}\\n\\n\\n\\n/**\\n\\n Generate [`ChainConfig`](ibc_relayer::config::ChainConfig) from a running\\n\\n [`FullNode`] and add it to the relayer's [`Config`].\\n\\n*/\\n\",\n \"file_path\": \"tools/test-framework/src/bootstrap/binary/chain.rs\",\n \"rank\": 55,\n \"score\": 240501.85671010643\n },\n {\n \"content\": \"pub fn spawn(config: Config) -> (ServerHandle, channel::Receiver<Request>) {\\n\\n let (req_tx, req_rx) = channel::unbounded::<Request>();\\n\\n\\n\\n info!(\\\"starting REST API server listening at http://{}\\\", config);\\n\\n let handle = run(config, req_tx);\\n\\n\\n\\n (handle, req_rx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-rest/src/server.rs\",\n \"rank\": 56,\n \"score\": 240300.41928709252\n },\n {\n \"content\": \"/// Process incoming REST requests.\\n\\n///\\n\\n/// Non-blocking receiving of requests from\\n\\n/// the REST server, and tries to handle them locally.\\n\\n///\\n\\n/// Any request that cannot be handled locally here is propagated\\n\\n/// as a [`Command`] to the caller, which the supervisor itself should handle.\\n\\npub fn process_incoming_requests(config: &Config, channel: &Receiver) -> Option<Command> {\\n\\n match channel.try_recv() {\\n\\n Ok(request) => match request {\\n\\n Request::Version { reply_to } => {\\n\\n trace!(\\\"Version\\\");\\n\\n\\n\\n let v = VersionInfo {\\n\\n name: NAME.to_string(),\\n\\n version: VER.to_string(),\\n\\n };\\n\\n\\n\\n reply_to\\n\\n .send(Ok(v))\\n\\n .unwrap_or_else(|e| error!(\\\"error replying to a REST request {}\\\", e));\\n\\n }\\n\\n\\n\\n Request::GetChains { reply_to } => {\\n\\n trace!(\\\"GetChains\\\");\\n\\n\\n\\n reply_to\\n\",\n \"file_path\": \"crates/relayer/src/rest.rs\",\n \"rank\": 57,\n \"score\": 240300.41928709252\n },\n {\n \"content\": \"/// Verifies that every template macro call in the file can be replaced by a valid Hermes command.\\n\\n/// Returns the number of invalid commands found.\\n\\nfn verify_file(path: &Path) -> i32 {\\n\\n let mut errors_found = 0;\\n\\n let file = File::open(path);\\n\\n let reader =\\n\\n BufReader::new(file.unwrap_or_else(|_| panic!(\\\"File not found: {}\\\", path.display())));\\n\\n let mut line_number = 1;\\n\\n\\n\\n for line in reader.lines() {\\n\\n let line = line\\n\\n .unwrap_or_else(|_| panic!(\\\"{} : Failed to read line {}\\\", path.display(), line_number));\\n\\n errors_found += verify_line(&line, path, line_number);\\n\\n line_number += 1;\\n\\n }\\n\\n errors_found\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/check-guide/src/main.rs\",\n \"rank\": 58,\n \"score\": 239034.43590816815\n },\n {\n \"content\": \"/// Perform a health check on all connected chains\\n\\nfn health_check<Chain: ChainHandle>(config: &Config, registry: &mut Registry<Chain>) {\\n\\n use HealthCheck::*;\\n\\n\\n\\n let chains = &config.chains;\\n\\n\\n\\n for config in chains {\\n\\n let id = &config.id;\\n\\n let _span = error_span!(\\\"health_check\\\", chain = %id).entered();\\n\\n\\n\\n let chain = registry.get_or_spawn(id);\\n\\n\\n\\n match chain {\\n\\n Ok(chain) => match chain.health_check() {\\n\\n Ok(Healthy) => info!(\\\"chain is healthy\\\"),\\n\\n Ok(Unhealthy(e)) => warn!(\\\"chain is not healthy: {}\\\", e),\\n\\n Err(e) => error!(\\\"failed to perform health check: {}\\\", e),\\n\\n },\\n\\n Err(e) => {\\n\\n error!(\\n\\n \\\"skipping health check, reason: failed to spawn chain runtime with error: {}\\\",\\n\\n e\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Subscribe to the events emitted by the chains the supervisor is connected to.\\n\",\n \"file_path\": \"crates/relayer/src/supervisor.rs\",\n \"rank\": 59,\n \"score\": 236962.7331660592\n },\n {\n \"content\": \"pub fn pipe_to_file(\\n\\n mut source: impl io::Read + Send + 'static,\\n\\n file_path: &str,\\n\\n) -> Result<(), Error> {\\n\\n let mut file = fs::OpenOptions::new()\\n\\n .append(true)\\n\\n .create(true)\\n\\n .open(file_path)?;\\n\\n\\n\\n thread::spawn(move || {\\n\\n std::io::copy(&mut source, &mut file).unwrap();\\n\\n });\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tools/test-framework/src/util/file.rs\",\n \"rank\": 60,\n \"score\": 236930.86186938442\n },\n {\n \"content\": \"/// Returns the lists of supported versions\\n\\npub fn get_compatible_versions() -> Vec<Version> {\\n\\n vec![Version::default()]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics03_connection/version.rs\",\n \"rank\": 61,\n \"score\": 235727.0744346924\n },\n {\n \"content\": \"pub fn delete_all_keys(config: &ChainConfig) -> eyre::Result<()> {\\n\\n let mut keyring = KeyRing::new(Store::Test, &config.account_prefix, &config.id)?;\\n\\n let keys = keyring.keys()?;\\n\\n for key in keys {\\n\\n keyring.remove_key(&key.0)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::KeysDeleteCmd;\\n\\n\\n\\n use abscissa_core::clap::Parser;\\n\\n use ibc_relayer_types::core::ics24_host::identifier::ChainId;\\n\\n\\n\\n #[test]\\n\\n fn test_keys_delete_key_name() {\\n\\n assert_eq!(\\n\\n KeysDeleteCmd {\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/keys/delete.rs\",\n \"rank\": 62,\n \"score\": 235540.99179990406\n },\n {\n \"content\": \"pub fn simple_exec(desc: &str, command_path: &str, args: &[&str]) -> Result<ExecOutput, Error> {\\n\\n debug!(\\n\\n \\\"Executing command for {}: {} {}\\\",\\n\\n desc,\\n\\n command_path,\\n\\n itertools::join(args, \\\" \\\")\\n\\n );\\n\\n\\n\\n let output = Command::new(&command_path)\\n\\n .args(args)\\n\\n .output()\\n\\n .map_err(handle_exec_error(command_path))?;\\n\\n\\n\\n if output.status.success() {\\n\\n let stdout = str::from_utf8(&output.stdout)\\n\\n .map_err(handle_generic_error)?\\n\\n .to_string();\\n\\n\\n\\n let stderr = str::from_utf8(&output.stderr)\\n\\n .map_err(handle_generic_error)?\\n\",\n \"file_path\": \"tools/test-framework/src/chain/exec.rs\",\n \"rank\": 63,\n \"score\": 235503.8734402453\n },\n {\n \"content\": \"fn extract_chains_and_keys(chain_names: &[String]) -> Vec<(String, Option<String>)> {\\n\\n let mut captured_names = chain_names\\n\\n .iter()\\n\\n .map(|chain_key| {\\n\\n chain_key\\n\\n .split_once(':')\\n\\n .map(|(name, key)| (name.to_string(), Some(key.to_string())))\\n\\n .unwrap_or_else(|| (chain_key.to_string(), None))\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n captured_names.sort_by(|a, b| a.0.cmp(&b.0));\\n\\n captured_names\\n\\n}\\n\\n\\n\\nimpl Runnable for AutoCmd {\\n\\n fn run(&self) {\\n\\n // Assert that for every chain, a key name is provided\\n\\n let runtime = tokio::runtime::Runtime::new().unwrap();\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/config/auto.rs\",\n \"rank\": 64,\n \"score\": 233646.43688859927\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"telemetry\\\"))]\\n\\nfn spawn_telemetry_server(config: &Config) -> Result<(), Box<dyn Error + Send + Sync>> {\\n\\n if config.telemetry.enabled {\\n\\n warn!(\\n\\n \\\"telemetry enabled in the config but Hermes was built without telemetry support, \\\\\\n\\n build Hermes with --features=telemetry to enable telemetry support.\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/start.rs\",\n \"rank\": 65,\n \"score\": 231828.31381604625\n },\n {\n \"content\": \"fn validate_gas_settings(id: &ChainId, config: &ChainConfig) -> Result<(), Diagnostic<Error>> {\\n\\n // Check that the gas_adjustment option is not set\\n\\n if let Some(gas_adjustment) = config.gas_adjustment {\\n\\n let gas_multiplier = gas_adjustment + 1.0;\\n\\n\\n\\n return Err(Diagnostic::Error(Error::deprecated_gas_adjustment(\\n\\n gas_adjustment,\\n\\n gas_multiplier,\\n\\n id.clone(),\\n\\n )));\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"crates/relayer-cli/src/config.rs\",\n \"rank\": 66,\n \"score\": 231007.50748457125\n },\n {\n \"content\": \"pub fn collect_events(\\n\\n config: &Config,\\n\\n workers: &WorkerMap,\\n\\n src_chain: &impl ChainHandle,\\n\\n batch: &EventBatch,\\n\\n) -> CollectedEvents {\\n\\n let mut collected =\\n\\n CollectedEvents::new(batch.height, batch.chain_id.clone(), batch.tracking_id);\\n\\n\\n\\n let mode = config.mode;\\n\\n\\n\\n for event_with_height in &batch.events {\\n\\n match &event_with_height.event {\\n\\n IbcEvent::NewBlock(_) => {\\n\\n collected.new_block = Some(event_with_height.event.clone());\\n\\n }\\n\\n IbcEvent::UpdateClient(update) => {\\n\\n collect_event(\\n\\n &mut collected,\\n\\n event_with_height.clone(),\\n\",\n \"file_path\": \"crates/relayer/src/supervisor.rs\",\n \"rank\": 67,\n \"score\": 230359.0021774823\n },\n {\n \"content\": \"struct OutputBuffer(Vec<UpgradeClientsForChainResult>);\\n\\n\\n\\nimpl Display for OutputBuffer {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), FmtError> {\\n\\n fn sep<'a>(pos: usize, len: usize, other: &'a str, last: &'a str) -> &'a str {\\n\\n if pos != len - 1 {\\n\\n other\\n\\n } else {\\n\\n last\\n\\n }\\n\\n }\\n\\n\\n\\n let outer_results = &self.0;\\n\\n writeln!(f, \\\".\\\")?;\\n\\n for (o, outer_result) in outer_results.iter().enumerate() {\\n\\n write!(f, \\\"{}\\\", sep(o, outer_results.len(), \\\"├─\\\", \\\"└─\\\"))?;\\n\\n match outer_result {\\n\\n Ok(inner_results) => {\\n\\n writeln!(f, \\\".\\\")?;\\n\\n for (i, inner_result) in inner_results.iter().enumerate() {\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/tx/client.rs\",\n \"rank\": 68,\n \"score\": 228135.56824457337\n },\n {\n \"content\": \"/// Returns `true` if the relayer should filter based on\\n\\n/// channel identifiers.\\n\\n/// Returns `false` otherwise.\\n\\nfn channel_filter_enabled(_config: &Config) -> bool {\\n\\n // we currently always enable the channel filter\\n\\n true\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/supervisor.rs\",\n \"rank\": 69,\n \"score\": 228011.7500805881\n },\n {\n \"content\": \"/// Returns the sequences of the packet commitments on a given chain and channel (port_id + channel_id).\\n\\n/// These are the sequences of the packets that were either:\\n\\n/// - not yet received by the counterparty chain, or\\n\\n/// - received on counterparty chain but not yet acknowledged by this chain,\\n\\npub fn commitments_on_chain(\\n\\n chain: &impl ChainHandle,\\n\\n port_id: &PortId,\\n\\n channel_id: &ChannelId,\\n\\n) -> Result<(Vec<Sequence>, Height), Error> {\\n\\n // get the packet commitments on the counterparty/ source chain\\n\\n let (mut commit_sequences, response_height) = chain\\n\\n .query_packet_commitments(QueryPacketCommitmentsRequest {\\n\\n port_id: port_id.clone(),\\n\\n channel_id: channel_id.clone(),\\n\\n pagination: Some(PageRequest::all()),\\n\\n })\\n\\n .map_err(Error::relayer)?;\\n\\n\\n\\n commit_sequences.sort_unstable();\\n\\n\\n\\n Ok((commit_sequences, response_height))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/counterparty.rs\",\n \"rank\": 70,\n \"score\": 227288.0365883138\n },\n {\n \"content\": \"pub fn chain_config(\\n\\n sender: &channel::Sender<Request>,\\n\\n chain_id: &str,\\n\\n) -> Result<ChainConfig, RestApiError> {\\n\\n submit_request(sender, |reply_to| Request::GetChain {\\n\\n chain_id: ChainId::from_string(chain_id),\\n\\n reply_to,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-rest/src/handle.rs\",\n \"rank\": 71,\n \"score\": 227155.11619735794\n },\n {\n \"content\": \"fn decode_bech32(input: &str) -> Result<Vec<u8>, Error> {\\n\\n use bech32::FromBase32;\\n\\n\\n\\n let bytes = bech32::decode(input)\\n\\n .and_then(|(_, data, _)| Vec::from_base32(&data))\\n\\n .map_err(Error::bech32_account)?;\\n\\n\\n\\n Ok(bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/keyring.rs\",\n \"rank\": 72,\n \"score\": 226886.0401132399\n },\n {\n \"content\": \"pub fn gas_amount_to_fee(config: &GasConfig, gas_amount: u64) -> Fee {\\n\\n let adjusted_gas_limit = adjust_estimated_gas(AdjustGas {\\n\\n gas_multiplier: config.gas_multiplier,\\n\\n max_gas: config.max_gas,\\n\\n gas_amount,\\n\\n });\\n\\n\\n\\n // The fee in coins based on gas amount\\n\\n let amount = calculate_fee(adjusted_gas_limit, &config.gas_price);\\n\\n\\n\\n Fee {\\n\\n amount: vec![amount],\\n\\n gas_limit: adjusted_gas_limit,\\n\\n payer: \\\"\\\".to_string(),\\n\\n granter: config.fee_granter.clone(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/gas.rs\",\n \"rank\": 73,\n \"score\": 226737.090892038\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_options() -> Result<(), Error> {\\n\\n run_binary_chain_test(&ClientOptionsTest)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/integration-test/src/tests/client_settings.rs\",\n \"rank\": 74,\n \"score\": 225940.55957647972\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_defaults() -> Result<(), Error> {\\n\\n run_binary_chain_test(&ClientDefaultsTest)\\n\\n}\\n\\n\\n\\n/// A test to exercise customization of foreign client settings.\\n\",\n \"file_path\": \"tools/integration-test/src/tests/client_settings.rs\",\n \"rank\": 75,\n \"score\": 225940.55957647972\n },\n {\n \"content\": \"pub fn extract_header_from_tx(event: &AbciEvent) -> Result<Box<dyn Header>, ClientError> {\\n\\n for tag in &event.attributes {\\n\\n let key = tag.key.as_ref();\\n\\n let value = tag.value.as_ref();\\n\\n if key == HEADER_ATTRIBUTE_KEY {\\n\\n return AnyHeader::decode_from_string(value).map(AnyHeader::into_box);\\n\\n }\\n\\n }\\n\\n Err(ClientError::missing_raw_header())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/event.rs\",\n \"rank\": 76,\n \"score\": 225022.77611407635\n },\n {\n \"content\": \"/// A basic worker retry strategy.\\n\\n///\\n\\n/// The backoff delay is initially 200ms and grows\\n\\n/// by 100ms at each step. The backoff delay is\\n\\n/// capped at 500ms.\\n\\n/// The overall amount of time spent backing off\\n\\n/// is capped to 2 seconds.\\n\\n/// See the `default_strategy` test below.\\n\\npub fn worker_default_strategy() -> impl Iterator<Item = Duration> {\\n\\n let strategy = ConstantGrowth::new(Duration::from_millis(200), Duration::from_millis(100));\\n\\n clamp_total(strategy, Duration::from_millis(500), Duration::from_secs(2))\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::time::Duration;\\n\\n\\n\\n use crate::worker::retry_strategy::worker_default_strategy;\\n\\n\\n\\n #[test]\\n\\n fn default_strategy() {\\n\\n let strategy = worker_default_strategy();\\n\\n let delays = strategy.take(10).collect::<Vec<_>>();\\n\\n // This strategy has exactly 6 retry steps\\n\\n assert_eq!(\\n\\n delays,\\n\\n vec![\\n\\n Duration::from_millis(200),\\n\\n Duration::from_millis(300),\\n\\n Duration::from_millis(400),\\n\\n Duration::from_millis(500),\\n\\n Duration::from_millis(500),\\n\\n Duration::from_millis(100),\\n\\n ]\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/relayer/src/worker/retry_strategy.rs\",\n \"rank\": 77,\n \"score\": 224800.1532446991\n },\n {\n \"content\": \"pub fn format_env(exporter: &impl ExportEnv) -> String {\\n\\n let mut envs = BTreeMap::new();\\n\\n exporter.export_env(&mut envs);\\n\\n\\n\\n envs.iter()\\n\\n .map(|(key, value)| format!(\\\"{}={}\\\", key, value))\\n\\n .join(\\\"\\\\n\\\")\\n\\n}\\n\\n\\n\\n/**\\n\\n Retrieve the environment variables exported by a type implementing\\n\\n `ExportEnv`, and save them as a `.env` file to the given file path.\\n\\n*/\\n\",\n \"file_path\": \"tools/test-framework/src/types/env.rs\",\n \"rank\": 78,\n \"score\": 224800.1532446991\n },\n {\n \"content\": \"pub fn gas_config_for_test() -> GasConfig {\\n\\n let max_gas = 3000000;\\n\\n let gas_multiplier = 1.1;\\n\\n let gas_price = GasPrice::new(0.001, \\\"stake\\\".to_string());\\n\\n\\n\\n let default_gas = max_gas;\\n\\n let fee_granter = \\\"\\\".to_string();\\n\\n\\n\\n let max_fee = Fee {\\n\\n amount: vec![calculate_fee(max_gas, &gas_price)],\\n\\n gas_limit: max_gas,\\n\\n payer: \\\"\\\".to_string(),\\n\\n granter: fee_granter.clone(),\\n\\n };\\n\\n\\n\\n GasConfig {\\n\\n default_gas,\\n\\n max_gas,\\n\\n gas_multiplier,\\n\\n gas_price,\\n\\n max_fee,\\n\\n fee_granter,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/test-framework/src/relayer/tx.rs\",\n \"rank\": 79,\n \"score\": 224243.63012330397\n },\n {\n \"content\": \"/// Returns the [`ChannelConnectionClient`] associated with the\\n\\n/// provided port and channel id.\\n\\npub fn channel_connection_client(\\n\\n chain: &impl ChainHandle,\\n\\n port_id: &PortId,\\n\\n channel_id: &ChannelId,\\n\\n) -> Result<ChannelConnectionClient, Error> {\\n\\n let (channel_end, _) = chain\\n\\n .query_channel(\\n\\n QueryChannelRequest {\\n\\n port_id: port_id.clone(),\\n\\n channel_id: channel_id.clone(),\\n\\n height: QueryHeight::Latest,\\n\\n },\\n\\n IncludeProof::No,\\n\\n )\\n\\n .map_err(Error::relayer)?;\\n\\n\\n\\n if channel_end.state_matches(&State::Uninitialized) {\\n\\n return Err(Error::channel_uninitialized(\\n\\n port_id.clone(),\\n\\n channel_id.clone(),\\n\",\n \"file_path\": \"crates/relayer/src/chain/counterparty.rs\",\n \"rank\": 80,\n \"score\": 223689.23966414994\n },\n {\n \"content\": \"pub fn wait_for_client() {\\n\\n let sleep_time = CLIENT_EXPIRY + Duration::from_secs(5);\\n\\n\\n\\n info!(\\n\\n \\\"Sleeping for {} seconds to wait for IBC client to expire\\\",\\n\\n sleep_time.as_secs()\\n\\n );\\n\\n\\n\\n sleep(sleep_time);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/integration-test/src/mbt/utils.rs\",\n \"rank\": 81,\n \"score\": 223683.59432149178\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_default_refresh() -> Result<(), Error> {\\n\\n run_binary_chain_test(&ClientDefaultsTest)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/integration-test/src/tests/client_refresh.rs\",\n \"rank\": 82,\n \"score\": 223608.49723327905\n },\n {\n \"content\": \"#[test]\\n\\nfn test_create_on_expired_client() -> Result<(), Error> {\\n\\n run_binary_chain_test(&CreateOnExpiredClientTest)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/integration-test/src/tests/client_expiration.rs\",\n \"rank\": 83,\n \"score\": 223608.49723327905\n },\n {\n \"content\": \"#[test]\\n\\nfn test_client_fail_refresh() -> Result<(), Error> {\\n\\n run_binary_chain_test(&ClientFailsTest)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tools/integration-test/src/tests/client_refresh.rs\",\n \"rank\": 84,\n \"score\": 223608.49723327905\n },\n {\n \"content\": \"pub fn update_client_try_from_abci_event(\\n\\n abci_event: &AbciEvent,\\n\\n) -> Result<client_events::UpdateClient, ClientError> {\\n\\n client_extract_attributes_from_tx(abci_event).map(|attributes| client_events::UpdateClient {\\n\\n common: attributes,\\n\\n header: extract_header_from_tx(abci_event).ok(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/event.rs\",\n \"rank\": 85,\n \"score\": 220911.04849634442\n },\n {\n \"content\": \"pub fn create_client_try_from_abci_event(\\n\\n abci_event: &AbciEvent,\\n\\n) -> Result<client_events::CreateClient, ClientError> {\\n\\n client_extract_attributes_from_tx(abci_event).map(client_events::CreateClient)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/event.rs\",\n \"rank\": 86,\n \"score\": 220911.04849634442\n },\n {\n \"content\": \"pub fn upgrade_client_try_from_abci_event(\\n\\n abci_event: &AbciEvent,\\n\\n) -> Result<client_events::UpgradeClient, ClientError> {\\n\\n client_extract_attributes_from_tx(abci_event).map(client_events::UpgradeClient)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/event.rs\",\n \"rank\": 87,\n \"score\": 220911.04849634442\n },\n {\n \"content\": \"pub fn client_misbehaviour_try_from_abci_event(\\n\\n abci_event: &AbciEvent,\\n\\n) -> Result<client_events::ClientMisbehaviour, ClientError> {\\n\\n client_extract_attributes_from_tx(abci_event).map(client_events::ClientMisbehaviour)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/event.rs\",\n \"rank\": 88,\n \"score\": 220911.04849634442\n },\n {\n \"content\": \"pub fn into_nested_vec<T, const SIZE: usize>(array: [[T; SIZE]; SIZE]) -> Vec<Vec<T>> {\\n\\n array.map(|array_b| array_b.into()).into()\\n\\n}\\n\\n\\n\\n/**\\n\\n Map the elements in the fixed-sized array `[[T; SIZE]; SIZE]`.\\n\\n*/\\n\",\n \"file_path\": \"tools/test-framework/src/util/array.rs\",\n \"rank\": 89,\n \"score\": 219415.54260209049\n },\n {\n \"content\": \"/// Default validator function for Channel identifiers.\\n\\n///\\n\\n/// A valid identifier must be between 8-64 characters and only contain\\n\\n/// alphabetic characters,\\n\\npub fn validate_channel_identifier(id: &str) -> Result<(), Error> {\\n\\n validate_identifier(id, 8, 64)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use crate::core::ics24_host::validate::{\\n\\n validate_channel_identifier, validate_client_identifier, validate_connection_identifier,\\n\\n validate_identifier, validate_port_identifier,\\n\\n };\\n\\n use test_log::test;\\n\\n\\n\\n #[test]\\n\\n fn parse_invalid_port_id_min() {\\n\\n // invalid min port id\\n\\n let id = validate_port_identifier(\\\"p\\\");\\n\\n assert!(id.is_err())\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics24_host/validate.rs\",\n \"rank\": 90,\n \"score\": 219125.48040918453\n },\n {\n \"content\": \"/// Default validator function for Port identifiers.\\n\\n///\\n\\n/// A valid Identifier must be between 2-128 characters and only contain lowercase\\n\\n/// alphabetic characters,\\n\\npub fn validate_port_identifier(id: &str) -> Result<(), Error> {\\n\\n validate_identifier(id, 2, 128)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics24_host/validate.rs\",\n \"rank\": 91,\n \"score\": 219125.48040918453\n },\n {\n \"content\": \"/// Default validator function for Connection identifiers.\\n\\n///\\n\\n/// A valid Identifier must be between 10-64 characters and only contain lowercase\\n\\n/// alphabetic characters,\\n\\npub fn validate_connection_identifier(id: &str) -> Result<(), Error> {\\n\\n validate_identifier(id, 10, 64)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics24_host/validate.rs\",\n \"rank\": 92,\n \"score\": 219125.48040918453\n },\n {\n \"content\": \"pub fn new_tx_config_for_test(\\n\\n chain_id: ChainId,\\n\\n raw_rpc_address: String,\\n\\n raw_grpc_address: String,\\n\\n address_type: AddressType,\\n\\n) -> Result<TxConfig, Error> {\\n\\n let rpc_address = Url::from_str(&raw_rpc_address).map_err(handle_generic_error)?;\\n\\n\\n\\n let rpc_client = HttpClient::new(rpc_address.clone()).map_err(handle_generic_error)?;\\n\\n\\n\\n let grpc_address = Uri::from_str(&raw_grpc_address).map_err(handle_generic_error)?;\\n\\n\\n\\n let gas_config = gas_config_for_test();\\n\\n\\n\\n let rpc_timeout = Duration::from_secs(30);\\n\\n\\n\\n let extension_options = Default::default();\\n\\n\\n\\n Ok(TxConfig {\\n\\n chain_id,\\n\",\n \"file_path\": \"tools/test-framework/src/relayer/tx.rs\",\n \"rank\": 93,\n \"score\": 218800.64163548307\n },\n {\n \"content\": \"type UpgradeClientsForChainResult = Result<Vec<UpgradeClientResult>, Error>;\\n\\n\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/tx/client.rs\",\n \"rank\": 94,\n \"score\": 218148.66139425157\n },\n {\n \"content\": \"fn parse_client_paths(components: &[&str]) -> Option<Path> {\\n\\n let first = match components.first() {\\n\\n Some(f) => *f,\\n\\n None => return None,\\n\\n };\\n\\n\\n\\n if first != \\\"clients\\\" {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let client_id = match ClientId::from_str(components[1]) {\\n\\n Ok(s) => s,\\n\\n Err(_) => return None,\\n\\n };\\n\\n\\n\\n if components.len() == 3 {\\n\\n match components[2] {\\n\\n \\\"clientType\\\" => Some(ClientTypePath(client_id).into()),\\n\\n \\\"clientState\\\" => Some(ClientStatePath(client_id).into()),\\n\\n \\\"connections\\\" => Some(ClientConnectionsPath(client_id).into()),\\n\",\n \"file_path\": \"crates/relayer-types/src/core/ics24_host/path.rs\",\n \"rank\": 95,\n \"score\": 218116.7437585603\n },\n {\n \"content\": \"fn encode_key_bytes(key: &KeyEntry) -> Result<Vec<u8>, Error> {\\n\\n let mut pk_buf = Vec::new();\\n\\n\\n\\n prost::Message::encode(&key.public_key.to_pub().to_bytes(), &mut pk_buf)\\n\\n .map_err(|e| Error::protobuf_encode(\\\"PublicKey\\\".into(), e))?;\\n\\n\\n\\n Ok(pk_buf)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/encode.rs\",\n \"rank\": 96,\n \"score\": 217341.0408171086\n },\n {\n \"content\": \"type UpgradeClientResult = Result<Vec<IbcEvent>, Error>;\\n\",\n \"file_path\": \"crates/relayer-cli/src/commands/tx/client.rs\",\n \"rank\": 97,\n \"score\": 215837.35247431824\n },\n {\n \"content\": \"fn encode_tx_raw(tx_raw: TxRaw) -> Result<Vec<u8>, Error> {\\n\\n let mut tx_bytes = Vec::new();\\n\\n prost::Message::encode(&tx_raw, &mut tx_bytes)\\n\\n .map_err(|e| Error::protobuf_encode(\\\"Transaction\\\".to_string(), e))?;\\n\\n\\n\\n Ok(tx_bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/relayer/src/chain/cosmos/encode.rs\",\n \"rank\": 98,\n \"score\": 215144.40350754256\n },\n {\n \"content\": \"### Initialization\\n\\n\\n\\nThe relayer performs initialization based on the content of the configuration file:\\n\\n- the file is parsed and semantically validated\\n\\n- the chains, connections, ports, channels for which relaying is enabled are stored in the Config structure\\n\\n\\n\\n```rust\\n\\npub struct Config {\\n\\n pub global: GlobalConfig,\\n\\n pub chains: Vec<ChainConfig>,\\n\\n pub connections: Option<Vec<Connection>>,\\n\\n}\\n\\n\\n\\npub struct GlobalConfig {\\n\\n /// All valid log levels, as defined in tracing:\\n\\n /// https://docs.rs/tracing-core/0.1.17/tracing_core/struct.Level.html\\n\\n pub log_level: String,\\n\\n}\\n\\n\\n\\npub struct ChainConfig {\\n\\n pub id: ChainId,\\n\\n pub rpc_addr: tendermint_rpc::Url,\\n\\n pub websocket_addr: tendermint_rpc::Url,\\n\\n pub grpc_addr: tendermint_rpc::Url,\\n\\n pub rpc_timeout: Duration,\\n\\n pub account_prefix: String,\\n\\n pub key_name: String,\\n\\n pub client_ids: Vec<String>,\\n\\n pub gas: u64,\\n\\n pub trusting_period: Duration,\\n\\n}\\n\\n\\n\\npub struct Connection {\\n\\n pub src: Option<ConnectionEnd>, // use any source\\n\\n pub dest: Option<ConnectionEnd>, // use any destination\\n\\n pub paths: Option<Vec<RelayPath>>, // use any port, direction bidirectional\\n\\n}\\n\\n\\n\\npub struct ConnectionEnd {\\n\\n pub client_id: String,\\n\\n pub connection_id: Option<String>, // use all connections to this client\\n\\n}\\n\\n\\n\\npub enum Direction {\\n\\n Unidirectional,\\n\\n Bidirectional,\\n\\n}\\n\\n\\n\\npub struct RelayPath {\\n\\n pub src_port: Option<String>, // default from any source port\\n\\n pub dest_port: Option<String>, // default from any dest port\\n\\n pub src_channel: Option<String>, // default from any source port\\n\\n pub dest_channel: Option<String>, // default from any dest port\\n\\n pub direction: Direction, // default bidirectional\\n\\n}\\n\\n```\\n\\nAll `Option` fields with `None` values mean \\\"any\\\" values. For `direction`, default is bidirectional.\\n\\nAll non-`Option` fields are mandatory and must appear in the configuration file.\\n\\nIf the relayer is started with an invalid configuration file, an error is displayed and the realyer process exits.\\n\\n\\n\\n### Relayer Commands\\n\\n\\n\",\n \"file_path\": \"docs/architecture/adr-002-ibc-relayer.md\",\n \"rank\": 99,\n \"score\": 48.57111694425606\n }\n]","isConversational":false}}},{"rowIdx":1193,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/http_client/client_impl.rs"},"repo_name":{"kind":"string","value":"ngi-nix/etebase-rs"},"commit":{"kind":"string","value":"33447aa22a2d8d2a93863312d6f61e341682ebfe"},"file_code":{"kind":"string","value":"use serde::Deserialize;\n\nuse crate::error::{Error, Result};\n\npub trait ClientImplementation {\n \n fn get(&self, url: &str, auth_token: Option<&str>) -> Response;\n \n fn post(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;\n \n fn put(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;\n \n fn patch(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;\n \n fn delete(&self, url: &str, auth_token: Option<&str>) -> Response;\n}\n\n#[derive(Clone)]\npub struct Response {\n bytes: Vec<u8>,\n status: u16,\n err: Option<Error>,\n}\n\nimpl Response {\n \n \n \n \n \n pub fn new(bytes: Vec<u8>, status: u16) -> Self {\n Self {\n bytes,\n status,\n err: None,\n }\n }\n\n \n \n \n \n pub fn new_err(err: Error) -> Self {\n Self {\n bytes: vec![],\n status: 0,\n err: Some(err),\n }\n }\n\n \n \n \n \n \n pub fn reset_ok(&mut self, bytes: Vec<u8>, status: u16) {\n self.bytes = bytes;\n self.status = status;\n self.err = None;\n }\n\n \n \n \n \n pub fn reset_err(&mut self, err: Error) {\n self.err = Some(err);\n }\n\n \n pub fn bytes(&self) -> &[u8] {\n &self.bytes\n }\n\n \n pub fn status(&self) -> u16 {\n self.status\n }\n\n \n pub fn error_for_status(&self) -> Result<()> {\n if self.status >= 200 && self.status < 300 {\n return Ok(());\n }\n\n #[derive(Deserialize)]\n struct ErrorResponse<'a> {\n pub code: Option<&'a str>,\n pub detail: Option<&'a str>,\n }\n\n let content: ErrorResponse =\n rmp_serde::from_read_ref(self.bytes()).unwrap_or(ErrorResponse {\n code: None,\n detail: None,\n });\n\n Err(match self.status {\n \n 300..=399 => Error::NotFound(\"Got a redirect - should never happen\".to_string()),\n 401 => Error::Unauthorized(content.detail.unwrap_or(\"Unauthorized\").to_string()),\n 403 => {\n Error::PermissionDenied(content.detail.unwrap_or(\"PermissionDenied\").to_string())\n }\n 404 => Error::NotFound(content.detail.unwrap_or(\"NotFound\").to_string()),\n 409 => Error::Conflict(content.detail.unwrap_or(\"Conflict\").to_string()),\n 502..=504 => Error::TemporaryServerError(\n content\n .detail\n .unwrap_or(\"Temporary server error\")\n .to_string(),\n ),\n 500..=501 | 505..=599 => {\n Error::ServerError(content.detail.unwrap_or(\"Server error\").to_string())\n }\n status => Error::Http(format!(\n \"HTTP error {}! Code: '{}'. Detail: '{}'\",\n status,\n content.code.unwrap_or(\"null\"),\n content.detail.unwrap_or(\"null\")\n )),\n })\n }\n\n #[deprecated(since = \"0.5.1\", note = \"please use `into_result` instead\")]\n #[allow(clippy::wrong_self_convention)]\n pub fn as_result(self) -> Result<Self> {\n self.into_result()\n }\n\n \n pub fn into_result(self) -> Result<Self> {\n match self.err {\n Some(err) => Err(err),\n None => Ok(self),\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use serde::Deserialize;\n\nuse crate::error::{Error, Result};\n\npub trait ClientImplementation {\n \n fn get(&self, url: &str, auth_token: Option<&str>) -> Response;\n \n fn post(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;\n \n fn put(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;\n \n fn patch(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;\n \n fn delete(&self, url: &str, auth_token: Option<&str>) -> Response;\n}\n\n#[derive(Clone)]\npub struct Response {\n bytes: Vec<u8>,\n status: u16,\n err: Option<Error>,\n}\n\nimpl Response {\n \n \n \n \n \n pub fn new(bytes: Vec<u8>, status: u16) -> Self {\n Self {\n bytes,\n status,\n err: None,\n }\n }\n\n \n \n \n \n pub fn new_err(err: Error) -> Self {\n Self {\n bytes: vec![],\n status: 0,\n err: Some(err),\n }\n }\n\n \n \n \n \n \n pub fn reset_ok(&mut self, bytes: Vec<u8>, status: u16) {\n self.bytes = bytes;\n self.status = status;\n self.err = None;\n }\n\n \n \n \n \n pub fn reset_err(&mut self, err: Error) {\n self.err = Some(err);\n }\n\n \n pub fn bytes(&self) -> &[u8] {\n &self.bytes\n }\n\n \n pub fn status(&self) -> u16 {\n self.status\n }\n\n \n pub fn error_for_status(&self) -> Result<()> {\n if self.status >= 200 && self.status < 300 {\n return Ok(());\n }\n\n #[derive(Deserialize)]\n struct ErrorResponse<'a> {\n pub code: Option<&'a str>,\n pub detail: Option<&'a str>,\n }\n\n let con"},"suffix":{"kind":"string","value":" .detail\n .unwrap_or(\"Temporary server error\")\n .to_string(),\n ),\n 500..=501 | 505..=599 => {\n Error::ServerError(content.detail.unwrap_or(\"Server error\").to_string())\n }\n status => Error::Http(format!(\n \"HTTP error {}! Code: '{}'. Detail: '{}'\",\n status,\n content.code.unwrap_or(\"null\"),\n content.detail.unwrap_or(\"null\")\n )),\n })\n }\n\n #[deprecated(since = \"0.5.1\", note = \"please use `into_result` instead\")]\n #[allow(clippy::wrong_self_convention)]\n pub fn as_result(self) -> Result<Self> {\n self.into_result()\n }\n\n \n pub fn into_result(self) -> Result<Self> {\n match self.err {\n Some(err) => Err(err),\n None => Ok(self),\n }\n }\n}\n"},"middle":{"kind":"string","value":"tent: ErrorResponse =\n rmp_serde::from_read_ref(self.bytes()).unwrap_or(ErrorResponse {\n code: None,\n detail: None,\n });\n\n Err(match self.status {\n \n 300..=399 => Error::NotFound(\"Got a redirect - should never happen\".to_string()),\n 401 => Error::Unauthorized(content.detail.unwrap_or(\"Unauthorized\").to_string()),\n 403 => {\n Error::PermissionDenied(content.detail.unwrap_or(\"PermissionDenied\").to_string())\n }\n 404 => Error::NotFound(content.detail.unwrap_or(\"NotFound\").to_string()),\n 409 => Error::Conflict(content.detail.unwrap_or(\"Conflict\").to_string()),\n 502..=504 => Error::TemporaryServerError(\n content\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn derive_key(salt: &[u8], password: &str) -> Result<Vec<u8>> {\n\n let mut key = vec![0; 32];\n\n let salt = &salt[..argon2id13::SALTBYTES];\n\n let salt: &[u8; argon2id13::SALTBYTES] =\n\n to_enc_error!(salt.try_into(), \"Expect salt to be at least 16 bytes\")?;\n\n let password = password.as_bytes();\n\n\n\n let ret = argon2id13::derive_key(\n\n &mut key,\n\n password,\n\n &argon2id13::Salt(*salt),\n\n argon2id13::OPSLIMIT_SENSITIVE,\n\n argon2id13::MEMLIMIT_MODERATE,\n\n );\n\n Ok(to_enc_error!(ret, \"pwhash failed\")?.as_ref().to_vec())\n\n}\n\n\n\npub struct CryptoManager {\n\n pub version: u8,\n\n cipher_key: [u8; 32],\n","file_path":"src/crypto.rs","rank":0,"score":198838.4914359434},{"content":"/// Convert a Base64 URL encoded string to a buffer\n\n///\n\n/// # Arguments:\n\n/// * `string` - the Base64 URL encoded string\n\npub fn from_base64(string: &StrBase64) -> Result<Vec<u8>> {\n\n match base64::decode(string, base64::Variant::UrlSafeNoPadding) {\n\n Ok(bytes) => Ok(bytes),\n\n Err(_) => Err(Error::Base64(\"Failed decoding base64 string\")),\n\n }\n\n}\n\n\n","file_path":"src/utils.rs","rank":1,"score":186978.2197330059},{"content":"pub fn init() -> error::Result<()> {\n\n crypto::init()\n\n}\n","file_path":"src/lib.rs","rank":2,"score":161776.85268845706},{"content":"/// Convert a buffer to a Base64 URL encoded string\n\n///\n\n/// # Arguments:\n\n/// * `bytes` - the buffer to convert\n\npub fn to_base64(bytes: &[u8]) -> Result<StringBase64> {\n\n Ok(base64::encode(bytes, base64::Variant::UrlSafeNoPadding))\n\n}\n\n\n\n// Fisher–Yates shuffle - an unbiased shuffler\n\n// The returend indices of where item is now.\n\n// So if the first item moved to position 3: ret[0] = 3\n\npub(crate) fn shuffle<T>(a: &mut Vec<T>) -> Vec<usize> {\n\n let len = a.len();\n\n let mut shuffled_indices: Vec<usize> = (0..len).collect();\n\n\n\n for i in 0..len {\n\n let j = i + sodiumoxide::randombytes::randombytes_uniform((len - i) as u32) as usize;\n\n a.swap(i, j);\n\n shuffled_indices.swap(i, j);\n\n }\n\n\n\n let mut ret = vec![0; len];\n\n for i in 0..len {\n\n ret[shuffled_indices[i]] = i;\n\n }\n\n ret\n\n}\n\n\n","file_path":"src/utils.rs","rank":3,"score":159684.05877928648},{"content":"/// Return a buffer filled with cryptographically random bytes\n\n///\n\n/// # Arguments:\n\n/// * `size` - the size of the returned buffer (in bytes)\n\npub fn randombytes(size: usize) -> Vec<u8> {\n\n sodiumoxide::randombytes::randombytes(size)\n\n}\n\n\n","file_path":"src/utils.rs","rank":4,"score":145686.08085385064},{"content":"fn generichash_quick(msg: &[u8], key: Option<&[u8]>) -> Result<Vec<u8>> {\n\n let mut state = to_enc_error!(generichash::State::new(32, key), \"Failed to init hash\")?;\n\n to_enc_error!(state.update(msg), \"Failed to update hash\")?;\n\n Ok(to_enc_error!(state.finalize(), \"Failed to finalize hash\")?\n\n .as_ref()\n\n .to_vec())\n\n}\n\n\n","file_path":"src/crypto.rs","rank":5,"score":145118.572742657},{"content":"/// Return a buffer filled with deterministically cryptographically random bytes\n\n///\n\n/// This function is similar to [randombytes] but always returns the same data for the same seed.\n\n/// Useful for testing purposes.\n\n///\n\n/// # Arguments:\n\n/// * `seed` - the seed to generate the random data from\n\n/// * `size` - the size of the returned buffer (in bytes)\n\npub fn randombytes_deterministic(size: usize, seed: &[u8; 32]) -> Vec<u8> {\n\n // Not exactly like the sodium randombytes_deterministic but close enough\n\n let nonce =\n\n sodiumoxide::crypto::stream::xchacha20::Nonce(*b\"LibsodiumDRG\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\");\n\n let key = sodiumoxide::crypto::stream::xchacha20::Key(*seed);\n\n\n\n sodiumoxide::crypto::stream::xchacha20::stream(size, &nonce, &key)\n\n}\n\n\n","file_path":"src/utils.rs","rank":6,"score":140627.3202634475},{"content":"pub fn test_reset(client: &Client, body_struct: SignupBody) -> Result<()> {\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n\n let url = client.api_base.join(\"api/v1/test/authentication/reset/\")?;\n\n\n\n let res = client.post(url.as_str(), body)?;\n\n\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n}\n\n\n\n/// A collection for which the user lost access\n\n///\n\n/// Deleted collections are marked using [crate::Collection::is_deleted]. However, when we just lose access\n\n/// to a collection and it hasn't been deleted, we get this object.\n\n#[derive(Deserialize, Clone)]\n\npub struct RemovedCollection {\n\n uid: StringBase64,\n\n}\n\n\n","file_path":"src/online_managers.rs","rank":7,"score":134262.6107604373},{"content":"pub fn init() -> Result<()> {\n\n to_enc_error!(sodiumoxide::init(), \"Failed initialising libsodium\")\n\n}\n\n\n","file_path":"src/crypto.rs","rank":8,"score":125749.40264777982},{"content":"/// A constant-time comparison function\n\n///\n\n/// Use this when comparing secret data in order to prevent side-channel attacks.\n\n///\n\n/// # Arguments:\n\n/// * `x` - the first buffer\n\n/// * `y` - the second buffer\n\npub fn memcmp(x: &[u8], y: &[u8]) -> bool {\n\n sodiumoxide::utils::memcmp(x, y)\n\n}\n\n\n","file_path":"src/utils.rs","rank":9,"score":124796.10524185825},{"content":"pub fn apply_fetch_options(url: Url, options: Option<&FetchOptions>) -> Url {\n\n let options = match options {\n\n Some(options) => options,\n\n None => return url,\n\n };\n\n\n\n let mut url = url;\n\n {\n\n let mut query = url.query_pairs_mut();\n\n if let Some(limit) = options.limit {\n\n query.append_pair(\"limit\", &limit.to_string());\n\n }\n\n if let Some(prefetch) = options.prefetch {\n\n let prefetch = match prefetch {\n\n PrefetchOption::Auto => \"auto\",\n\n PrefetchOption::Medium => \"medium\",\n\n };\n\n query.append_pair(\"prefetch\", prefetch);\n\n }\n\n if let Some(with_collection) = options.with_collection {\n","file_path":"src/online_managers.rs","rank":10,"score":113911.10762855585},{"content":"/// Return a pretty formatted fingerprint of the content\n\n///\n\n/// For example:\n\n/// ```shell\n\n/// 45680 71497 88570 93128\n\n/// 19189 84243 25687 20837\n\n/// 47924 46071 54113 18789\n\n/// ```\n\n///\n\n/// # Arguments:\n\n/// * `content` - the content to create a fingerprint for\n\npub fn pretty_fingerprint(content: &[u8]) -> String {\n\n let delimiter = \" \";\n\n let fingerprint = generichash_quick(content, None).unwrap();\n\n\n\n /* We use 3 bytes each time to generate a 5 digit number - this means 10 pairs for bytes 0-29\n\n * We then use bytes 29-31 for another number, and then the 3 most significant bits of each first byte for the last.\n\n */\n\n let mut last_num: u32 = 0;\n\n let parts = (0..10).into_iter().map(|i| {\n\n let suffix = if i % 4 == 3 { \"\\n\" } else { delimiter };\n\n\n\n last_num = (last_num << 3) | ((fingerprint[i] as u32) & 0xE0) >> 5;\n\n get_encoded_chunk(&fingerprint[i * 3..], suffix)\n\n });\n\n\n\n let last_num = (0..10).into_iter().fold(0, |accum, i| {\n\n (accum << 3) | ((fingerprint[i] as u32) & 0xE0) >> 5\n\n }) % 100000;\n\n let last_num = format!(\"{:0>5}\", last_num);\n\n let parts = parts\n\n .chain(std::iter::once(get_encoded_chunk(\n\n &fingerprint[29..],\n\n delimiter,\n\n )))\n\n .chain(std::iter::once(last_num));\n\n parts.collect::<String>()\n\n}\n","file_path":"src/crypto.rs","rank":12,"score":109859.53669122685},{"content":"/// The `unpad()` function computes the original, unpadded length of a message previously padded\n\n/// using [`pad()`]. The original length is returned upon success.\n\npub fn unpad(buf: &[u8], padded_buflen: usize, blocksize: usize) -> Result<usize, ()> {\n\n let mut unpadded_buflen_p: usize = 0;\n\n unsafe {\n\n if 0 == ffi::sodium_unpad(\n\n &mut unpadded_buflen_p,\n\n buf.as_ptr() as *const _,\n\n padded_buflen,\n\n blocksize,\n\n ) {\n\n Ok(unpadded_buflen_p)\n\n } else {\n\n Err(())\n\n }\n\n }\n\n}\n","file_path":"src/utils/sodium_padding.rs","rank":13,"score":107093.79964595834},{"content":"#[test]\n\nfn get_dashboard_url() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n\n\n match etebase.fetch_dashboard_url() {\n\n Ok(url) => assert!(url.len() > 0),\n\n err => assert_err!(err, Error::Http(_)),\n\n };\n\n\n\n etebase.logout()\n\n}\n\n\n","file_path":"tests/service.rs","rank":14,"score":104954.80712330033},{"content":"/// The `pad()` function adds padding data to a buffer buf whose original size is `unpadded_buflen`\n\n/// in order to extend its total length to a multiple of blocksize.\n\n///\n\n/// The function returns `Err(())` if the padded buffer length would exceed `max_buflen`, or if the\n\n/// block size is 0. It returns a result containing the new padded length upon success.\n\npub fn pad(buf: &mut [u8], unpadded_buflen: usize, blocksize: usize) -> Result<usize, ()> {\n\n let mut padded_buflen_p: usize = 0;\n\n unsafe {\n\n if 0 == ffi::sodium_pad(\n\n &mut padded_buflen_p,\n\n buf.as_mut_ptr() as *mut _,\n\n unpadded_buflen,\n\n blocksize,\n\n buf.len(),\n\n ) {\n\n Ok(padded_buflen_p)\n\n } else {\n\n Err(())\n\n }\n\n }\n\n}\n\n\n","file_path":"src/utils/sodium_padding.rs","rank":15,"score":102575.59602832266},{"content":"fn get_encoded_chunk(content: &[u8], suffix: &str) -> String {\n\n let num =\n\n (((content[0] as u32) << 16) + ((content[1] as u32) << 8) + (content[2] as u32)) % 100000;\n\n return format!(\"{:0>5}{}\", num, suffix);\n\n}\n\n\n","file_path":"src/crypto.rs","rank":16,"score":101791.20601220075},{"content":"pub fn test_url() -> String {\n\n let server = env::var(\"ETEBASE_TEST_HOST\").expect(\"Set ETEBASE_TEST_HOST to run tests\");\n\n format!(\"http://{}\", server)\n\n}\n\n\n\n#[allow(non_snake_case)]\n\npub struct TestUser {\n\n pub username: &'static str,\n\n pub email: &'static str,\n\n pub password: &'static str,\n\n pub pubkey: &'static str,\n\n pub encryptedContent: &'static str,\n\n\n\n pub loginPubkey: &'static str,\n\n pub key: &'static str,\n\n pub salt: &'static str,\n\n\n\n pub storedSession: &'static str,\n\n}\n\n\n","file_path":"tests/common/mod.rs","rank":17,"score":101551.38051164092},{"content":"/// A trait for serializing and deserializing to MsgPack\n\npub trait MsgPackSerilization {\n\n /// The type of the struct implementing this trait\n\n type Output;\n\n\n\n /// Convert self to a msgpack encoded buffer\n\n fn to_msgpack(&self) -> Result<Vec<u8>>;\n\n\n\n /// Create the struct from a MsgPack encoded buffer\n\n ///\n\n /// # Arguments:\n\n /// * `data` - the MsgPack buffer\n\n fn from_msgpack(data: &[u8]) -> Result<Self::Output>;\n\n}\n","file_path":"src/utils.rs","rank":18,"score":94792.21193068725},{"content":"fn verify_collection(col: &Collection, meta: &ItemMetadata, content: &[u8]) -> Result<()> {\n\n col.verify()?;\n\n assert_eq!(&col.meta()?, meta);\n\n assert_eq!(col.content()?, content);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/service.rs","rank":19,"score":88314.35202282511},{"content":"fn verify_item(item: &Item, meta: &ItemMetadata, content: &[u8]) -> Result<()> {\n\n item.verify()?;\n\n assert_eq!(&item.meta()?, meta);\n\n assert_eq!(item.content()?, content);\n\n Ok(())\n\n}\n\n\n","file_path":"tests/service.rs","rank":20,"score":88314.35202282511},{"content":"#[test]\n\nfn collection_as_item() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let mut col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n // Verify with_collection works\n\n {\n\n let items = it_mgr.list(None)?;\n\n assert_eq!(items.data().len(), 0);\n","file_path":"tests/service.rs","rank":21,"score":82385.72860755982},{"content":"#[test]\n\nfn is_etebase_server() -> Result<()> {\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n assert!(Account::is_etebase_server(&client)?);\n\n\n\n let test_url = format!(\"{}/api/\", test_url());\n\n let client = Client::new(CLIENT_NAME, &test_url)?;\n\n assert!(!Account::is_etebase_server(&client)?);\n\n\n\n let client = Client::new(CLIENT_NAME, \"http://doesnotexist\")?;\n\n assert!(Account::is_etebase_server(&client).is_err());\n\n\n\n // Verify we also fail correctly for login\n\n let client = Client::new(CLIENT_NAME, &test_url)?;\n\n assert_err!(\n\n Account::login(client.clone(), USER2.username, USER2.password),\n\n Error::NotFound(_)\n\n );\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tests/service.rs","rank":22,"score":82385.72860755982},{"content":"#[test]\n\nfn item_revisions() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n let meta = ItemMetadata::new().set_name(Some(\"Item Orig\")).clone();\n\n let content = b\"\";\n\n let mut item = it_mgr.create(&meta, content)?;\n\n\n\n for i in 0..5 {\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(&format!(\"Item {}\", i)))\n\n .clone();\n\n item.set_meta(&meta)?;\n","file_path":"tests/service.rs","rank":23,"score":82385.72860755982},{"content":"#[test]\n\nfn collection_types() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n {\n\n let collections = col_mgr.list(\"some.coltype\", None)?;\n\n assert_eq!(collections.data().len(), 0);\n\n }\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n {\n","file_path":"tests/service.rs","rank":24,"score":82385.72860755982},{"content":"#[test]\n\nfn deterministic_encrypt() -> Result<()> {\n\n etebase::init().unwrap();\n\n\n\n let key = from_base64(USER.key)?;\n\n\n\n let context = b\"Col \";\n\n let crypto_manager = crypto::CryptoManager::new(\n\n &key[0..32].try_into().unwrap(),\n\n context,\n\n etebase::CURRENT_VERSION,\n\n )\n\n .unwrap();\n\n\n\n // Deterministic encryption\n\n let clear_text = b\"This Is Some Test Cleartext.\";\n\n let cipher = crypto_manager\n\n .deterministic_encrypt(clear_text, None)\n\n .unwrap();\n\n let decrypted = crypto_manager.deterministic_decrypt(&cipher, None).unwrap();\n\n assert_eq!(clear_text, &decrypted[..]);\n","file_path":"tests/crypto.rs","rank":25,"score":82385.72860755982},{"content":"#[test]\n\nfn iterating_invitations() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n\n\n let etebase2 = init_test(&USER2)?;\n\n let invite_mgr2 = etebase2.invitation_manager()?;\n\n\n\n let invite_mgr = etebase.invitation_manager()?;\n\n let user2_profile = invite_mgr.fetch_user_profile(USER2.username)?;\n\n\n\n for i in 0..3 {\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(&format!(\"Item {}\", i)))\n\n .clone();\n\n let content = b\"\";\n\n let col = col_mgr.create(\"some.coltype\", &meta, content).unwrap();\n\n col_mgr.upload(&col, None)?;\n\n invite_mgr.invite(\n\n &col,\n\n USER2.username,\n","file_path":"tests/service.rs","rank":26,"score":82385.72860755982},{"content":"#[test]\n\nfn collection_invitations() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let items: Vec<Item> = (0..5)\n\n .into_iter()\n\n .map(|i| {\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(&format!(\"Item {}\", i)))\n\n .clone();\n\n let content = b\"\";\n\n it_mgr.create(&meta, content).unwrap()\n","file_path":"tests/service.rs","rank":27,"score":82385.72860755982},{"content":"fn main() -> Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() < 4 {\n\n println!(\"Help: ./etebase_test USERNAME PASSWORD SERVER_URL [COLLECTION_UID]\");\n\n std::process::exit(1);\n\n }\n\n\n\n let username = &args[1];\n\n let password = &args[2];\n\n let server_url = &args[3];\n\n\n\n let client = Client::new(CLIENT_NAME, server_url)?;\n\n let etebase = Account::login(client, username, password)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n if args.len() >= 5 {\n\n let col_uid = &args[4];\n\n let col = col_mgr.fetch(col_uid, None)?;\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n let items = it_mgr.list(None)?;\n","file_path":"examples/etebase_test.rs","rank":28,"score":82385.72860755982},{"content":"#[test]\n\nfn item_transactions() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n let meta = ItemMetadata::new().set_name(Some(\"Item 1\")).clone();\n\n let content = b\"\";\n\n let mut item = it_mgr.create(&meta, content)?;\n\n\n\n let deps = vec![&item];\n\n it_mgr.transaction(deps.clone().into_iter(), None)?;\n\n\n\n let item_old = it_mgr.fetch(item.uid(), None)?;\n\n let mut item_old2 = it_mgr.fetch(item.uid(), None)?;\n","file_path":"tests/service.rs","rank":29,"score":82385.72860755982},{"content":"#[test]\n\n#[ignore]\n\nfn signup_with_key() -> Result<()> {\n\n // FIXME: Doesn't work at the moment, because we can't signup with the same user. We need reset\n\n // to support wiping.\n\n\n\n // Reset user manually because we want to signup\n\n etebase::init()?;\n\n user_reset(&USER)?;\n\n\n\n let main_key = from_base64(USER.key)?;\n\n\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let user = User::new(USER.username, USER.email);\n\n let etebase = Account::signup_key(client, &user, &main_key)?;\n\n\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n","file_path":"tests/service.rs","rank":30,"score":82385.72860755982},{"content":"#[test]\n\nfn empty_content() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n {\n\n let col2 = col_mgr.fetch(col.uid(), None)?;\n\n verify_collection(&col2, &col_meta, col_content)?;\n\n }\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().set_name(Some(\"Item 1\")).clone();\n\n let content = b\"\";\n\n\n","file_path":"tests/service.rs","rank":31,"score":82385.72860755982},{"content":"#[test]\n\nfn cache_collections_and_items() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().set_name(Some(\"Item\")).clone();\n\n let content = b\"SomeItemContent\";\n\n let item = it_mgr.create(&meta, content)?;\n\n\n","file_path":"tests/service.rs","rank":32,"score":79468.28479011814},{"content":"#[test]\n\nfn simple_collection_handling() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let content = b\"SomeContent\";\n\n\n\n let mut col = col_mgr.create(\"some.coltype\", &meta, content)?;\n\n assert_eq!(col.collection_type()?, \"some.coltype\");\n\n verify_collection(&col, &meta, content)?;\n\n\n\n let meta2 = meta.clone().set_name(Some(\"Collection meta2\")).clone();\n\n col.set_meta(&meta2)?;\n\n verify_collection(&col, &meta2, content)?;\n\n\n\n assert!(!col.is_deleted());\n\n col.delete()?;\n\n assert!(col.is_deleted());\n\n verify_collection(&col, &meta2, content)?;\n\n\n\n etebase.logout()\n\n}\n\n\n","file_path":"tests/service.rs","rank":33,"score":79468.28479011814},{"content":"#[test]\n\nfn simple_collection_sync() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let content = b\"SomeContent\";\n\n\n\n let mut col = col_mgr.create(\"some.coltype\", &meta, content)?;\n\n verify_collection(&col, &meta, content)?;\n\n\n\n let collections = col_mgr.list(\"some.coltype\", None)?;\n\n assert_eq!(collections.data().len(), 0);\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let collections = col_mgr.list(\"some.coltype\", None)?;\n\n assert_eq!(collections.data().len(), 1);\n","file_path":"tests/service.rs","rank":34,"score":79468.28479011814},{"content":"#[test]\n\nfn simple_item_handling() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().set_name(Some(\"Item 1\")).clone();\n\n let content = b\"ItemContent\";\n\n let mut item = it_mgr.create(&meta, content)?;\n\n verify_item(&item, &meta, content)?;\n\n\n\n let meta2 = ItemMetadata::new().set_name(Some(\"Item 2\")).clone();\n\n item.set_meta(&meta2)?;\n\n verify_item(&item, &meta2, content)?;\n\n\n\n assert!(!item.is_deleted());\n\n item.delete()?;\n\n assert!(item.is_deleted());\n\n verify_item(&item, &meta2, content)?;\n\n\n\n etebase.logout()\n\n}\n\n\n","file_path":"tests/service.rs","rank":35,"score":79468.28479011814},{"content":"#[test]\n\nfn collection_and_item_deletion() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let mut col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().set_name(Some(\"Item 1\")).clone();\n\n let content = b\"Content 1\";\n\n\n\n let mut item = it_mgr.create(&meta, content)?;\n\n\n\n it_mgr.batch(iter::once(&item), None)?;\n\n\n\n let items = it_mgr.list(None)?;\n","file_path":"tests/service.rs","rank":36,"score":79468.28479011814},{"content":"#[test]\n\nfn simple_item_sync() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().set_name(Some(\"Item 1\")).clone();\n\n let content = b\"Content 1\";\n\n\n\n let mut item = it_mgr.create(&meta, content)?;\n","file_path":"tests/service.rs","rank":37,"score":79468.28479011814},{"content":"#[test]\n\nfn collection_access_level() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let items: Vec<Item> = (0..5)\n\n .into_iter()\n\n .map(|i| {\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(&format!(\"Item {}\", i)))\n\n .clone();\n\n let content = b\"\";\n\n it_mgr.create(&meta, content).unwrap()\n\n })\n","file_path":"tests/service.rs","rank":38,"score":79468.28479011814},{"content":"#[test]\n\nfn item_batch_stoken() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n let meta = ItemMetadata::new().set_name(Some(\"Item Orig\")).clone();\n\n let content = b\"\";\n\n let mut item = it_mgr.create(&meta, content)?;\n\n\n\n it_mgr.batch(iter::once(&item), None)?;\n\n\n\n let mut item2 = it_mgr.fetch(item.uid(), None)?;\n\n\n\n let items: Vec<Item> = (0..5)\n","file_path":"tests/service.rs","rank":39,"score":79468.28479011814},{"content":"#[test]\n\nfn session_save_and_restore() -> Result<()> {\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let etebase = init_test(&USER)?;\n\n\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n col_mgr.upload(&col, None)?;\n\n\n\n // Verify we can store and restore without an encryption key\n\n {\n\n let saved = etebase.save(None)?;\n\n let etebase2 = Account::restore(client.clone(), &saved, None)?;\n\n\n","file_path":"tests/service.rs","rank":40,"score":79468.28479011814},{"content":"#[test]\n\nfn chunk_preupload_and_download() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().set_name(Some(\"Item\")).clone();\n\n let content = b\"SomeItemContent\";\n\n let item = it_mgr.create(&meta, content)?;\n\n assert!(!item.is_missing_content());\n","file_path":"tests/service.rs","rank":41,"score":79468.28479011814},{"content":"#[test]\n\n#[ignore]\n\nfn login_and_password_change() -> Result<()> {\n\n // Reset both users\n\n let etebase = init_test(&USER)?;\n\n etebase.logout()?;\n\n let etebase2 = init_test(&USER2)?;\n\n etebase2.logout()?;\n\n\n\n let another_password = \"AnotherPassword\";\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let mut etebase2 = Account::login(client.clone(), USER2.username, USER2.password)?;\n\n\n\n let col_mgr2 = etebase2.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr2.create(\"some.coltype\", &col_meta, col_content)?;\n","file_path":"tests/service.rs","rank":42,"score":79468.28479011814},{"content":"#[test]\n\nfn item_fetch_updates() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n let meta = ItemMetadata::new().set_name(Some(\"Item Orig\")).clone();\n\n let content = b\"\";\n\n let item = it_mgr.create(&meta, content)?;\n\n\n\n it_mgr.batch(iter::once(&item), None)?;\n\n\n\n let items: Vec<Item> = (0..5)\n\n .into_iter()\n\n .map(|i| {\n","file_path":"tests/service.rs","rank":43,"score":79468.28479011814},{"content":"#[test]\n\nfn list_response_correctness() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new().set_name(Some(\"Collection\")).clone();\n\n let col_content = b\"\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n {\n\n let col2 = col_mgr.fetch(col.uid(), None)?;\n\n verify_collection(&col2, &col_meta, col_content)?;\n\n }\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let items: Vec<Item> = (0..5)\n\n .into_iter()\n\n .map(|i| {\n","file_path":"tests/service.rs","rank":44,"score":79468.28479011814},{"content":"#[test]\n\nfn chunking_large_data() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col_content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, col_content)?;\n\n\n\n col_mgr.upload(&col, None)?;\n\n\n\n let it_mgr = col_mgr.item_manager(&col)?;\n\n\n\n let meta = ItemMetadata::new().clone();\n\n let content = randombytes_deterministic(120 * 1024, &[0; 32]); // 120kb of pseuedorandom data\n\n\n\n let mut item = it_mgr.create(&meta, &content)?;\n","file_path":"tests/service.rs","rank":45,"score":79468.28479011814},{"content":"#[test]\n\nfn login_and_password_change_with_key() -> Result<()> {\n\n // Reset user\n\n let etebase = init_test(&USER)?;\n\n\n\n let col_mgr = etebase.collection_manager()?;\n\n let col_meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let col = col_mgr.create(\"some.coltype\", &col_meta, b\"\")?;\n\n col_mgr.upload(&col, None)?;\n\n\n\n etebase.logout()?;\n\n\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let main_key = from_base64(USER.key)?;\n\n let etebase = Account::login_key(client, USER.username, &main_key)?;\n\n\n\n let col_mgr = etebase.collection_manager()?;\n\n let col2 = col_mgr.fetch(col.uid(), None)?;\n\n verify_collection(&col2, &col_meta, b\"\")?;\n\n\n\n etebase.logout()\n\n}\n\n\n","file_path":"tests/service.rs","rank":46,"score":76856.99630225747},{"content":"#[test]\n\nfn simple_cache_handling() -> Result<()> {\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let etebase = init_test_local(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let meta = ItemMetadata::new()\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let content = b\"SomeContent\";\n\n\n\n let col = col_mgr.create(\"some.coltype\", &meta, content)?;\n\n\n\n let temp_dir = TempDir::new()?;\n\n let fs_cache = FileSystemCache::new(temp_dir.path(), USER.username)?;\n\n\n\n assert!(fs_cache.load_account(&client, None).is_err());\n\n fs_cache.save_account(&etebase, None)?;\n\n fs_cache.load_account(&client, None)?;\n\n\n","file_path":"tests/fs_cache.rs","rank":47,"score":76856.99630225747},{"content":"#[derive(Serialize)]\n\nstruct LoginBody<'a> {\n\n #[serde(with = \"serde_bytes\")]\n\n response: &'a [u8],\n\n #[serde(with = \"serde_bytes\")]\n\n signature: &'a [u8],\n\n}\n\n\n\n#[derive(Serialize)]\n\npub struct LoginBodyResponse<'a> {\n\n pub username: &'a str,\n\n #[serde(with = \"serde_bytes\")]\n\n pub challenge: &'a [u8],\n\n pub host: &'a str,\n\n pub action: &'a str,\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct LoginResponseUser {\n\n pub username: String,\n","file_path":"src/online_managers.rs","rank":48,"score":76357.292181752},{"content":"#[test]\n\nfn loading_cache_without_collection_type() -> Result<()> {\n\n let etebase = init_test(&USER)?;\n\n let col_mgr = etebase.collection_manager()?;\n\n let meta = ItemMetadata::new()\n\n .set_item_type(Some(\"type\"))\n\n .set_name(Some(\"Collection\"))\n\n .set_description(Some(\"Mine\"))\n\n .set_color(Some(\"#aabbcc\"))\n\n .clone();\n\n let content = b\"SomeContent\";\n\n\n\n let col = col_mgr.cache_load(&etebase::utils::from_base64(\"kgHcBTvMlMyVzNkgTl9vMjNITDFsVlQ1VG5Dd1QzVkx0VDN5TUtBbDZ0UDYBzMDMlMy2QktLMk50R2NCY1pDRDBTcllKeHBzQczEUzXMyVxJSQptzPDMyMzNPMzhAVbMrsyjzPfMjU0pzODMq2lmzMAUEBLM_My-zOhGMsyREmHM6Mz3zO7MwVF8F2tnzOXM3TnM9MypzOQ9CczHfMzGCywPzOPMlsyTzOE-zIRAKczQJzVxRMz9NMz3MczbzMHM5zY_MDrMwsyRzJLM2StoaDhPTTFiQmR5bWZUTlZlanhwcWtPOExWLUpIUDFsUGRST2lCWXhnaEFnzMUEKMy4KGNOJ8z3zN1pzNFGzNLM_8yiCczpzLIxzJQSzNjM58yACS0sP8yCzKDM-GLM0MyCzJMPL8z-Hsz-QMzRT1BCRcyjWszRzLPMkxjMzFYmzMJ8IE1_zMMnCczyzIlUzIbMhxDM3XHMskHM9x9uaWhDzM3Myk1pzI7M78yWzOMrOFHMw04WzK7M-iXMm3tdzKAazMVpzOXMzczqR38KWMyPGEvMzkoyWmodzOvMwczSzLXMplkGzPIDzKvMxGEfQ8zjMcyIdAB4JczLcczfd8z5Vsz4ccyRdMzXzKU1zKcRzP_MycynzLhQzOUvJ8z3FMyHzOpMzLDMm8y6HAw1zKQgJl8CzNrM6XQFRsySFH7Mrn81zPPM4W0HzIPMh1PMpMyUzPNdzNsSzNE6ZQPM9cyGC04eDw7MrR9CaAnM73ZNzJYWOUzMr8zkzK_MxczAzKDMysz5zOt8LlN9zK3MynNizKDM0czXzNhBzNEdNhU8zNTMzTFIb8zmVszHzIfMiALMlkzM68zbzINAzNbMl8z8zMh_T8zHc8zJci7MtkDMl8ywcWIoe1zMuczCRFbMpcy3zJhvzK5PCz4EzMvMlszcAMyWzKIEAMzozPrMlh4JK8z3zMDM8XHMnWLMiMybAijMzczzzOtVaSPM-GbMvXrMksyyzK8_TQ7M9xzMw1PM-lvM68yrXHXM1y5AC0LM6iROcMzmzPzMlBHMtwrM50bMtlrMzX11zIvM4DM4zNIpDC1TEsybQkcuecynQMzCzK_M0sz-zOvMrhdNzJpuzKbM6j7Mjn7M6MzSYszrMzjM5szszIEJYWtfdVs7JVIvS0AQQcyBennMjMzgY8z6zORezOnM5CAZY8z3WWAKPcykT8yVzJDM4BjMz8zNzONtJglpzKRNQQHMxRPM7MymzPnMpy5RzNNIIsyfzKXM9hvMlUbMuczfzK8xzLTM08zlMcyczLLMlGzMrsyOAz7MvMzZzJjMwMyHHsygJMzczMnM1cybzLDMyszqDXrMmGZ3zJTM4nhqZhRhC8yTzMTMtHjM41UTIxvMtMyFzOZ-zIZyHszlzJM9WszhEUbM9VXMmxoNzKfMzUoKKUg9PjYOFMzgzO8jPQzM02TM8BcXzP7Mz8zUfkTMnVRJzIFCzK1ZH8yyzIrMvcy-zP5PzKJjFMygzKvM415LYszXQB_MnCfMzkJmbl_MnmDM42HM88zezOQibhHMuczczMfM2ixwzMvMpczDYRtWzLLM9cydIkjMrxDMj8yYzKkKzLtRzMM1zPbMyS5JYGnM08ylDmdUzL0ANMzgYSfM4jTMm8zvPE0dzL3Mw8zmzOxyzP3M93PM78z1NnoZVxfM7loNfMzxzPHM4j7MpB4NPD0rIczKzN4zKXnMww3M3czlADnMqczxeszuzMDMx8y_B8zyzPYTEjpZPD3M5cz6OALMxH3MgMznzPIXWkMZRzHMuHXMxMzrHEDM9szLaWYSWx4LdMz0zIjM5szMzN3M9syAzKUmWMzbf08QaEc9bMypzOA5bMzjzMQQzJNtVcyCzKJqNmLM0sy1NDMDRcyxzLrMyAzM8hPMv8y5zKoizOzMwEByGszRzIs4HcztNszTzP7M-syyzL_Ms8zFzK5EOk0mYwBGC8yTzO_MynPMrsyxzNMeHszvzI4uzKZ9FTvMzQM2zO0yzNNkzIrM58zfzP7My3rMnMz0zLt9zMgIW8z3zL0ucMy0zK5OZsypT8zOzJnMmMzgGA_M6xLMn8zXzOZ8UnogzL7MtcygzKfMtszUzLXMjUcwbAUQWyzMv8yfLczGcUrM68zdSFlVzJhFzP_M0m3MohzMsljMz8yQGMz-HnBgzJbM3syUzPo7zM3MjknMriHM7QF7YicvBkltX8zeLMyBG3vMq8zNzPPMzcymzIvM4czmEMzTEcyrzK7MtMzszJXMj8z3W8ywzI_MtjHM68yTzKNBEGjMt8y-dTxcbMzATnjMyMzqXHRHHMznzKrMqMy4zKgozLxZDGlZzN7Ml8yAzP99zMdzDwdYTsy2zKYczMcgzKlmasyQzPlDzLRJzMMVzOvM2k3MswbMpjnM53XM-sykzN8QY2YQzMPMjELMwAHMxEjMo8zfFw7MzQEBbcybzJ7M2czrzMTM9x3Mmsy1zILM42xqzIo-MQ_M5czXzLrMxcyozNhHzNsNzLFHzI1vzL3MoyTM3AlKFxzM0WZ0GjnMs8yXURjMm2xhQ8yONGfM28zVzKPMtMzlzIHM6VjM2BLMwA\")?)?;\n\n assert_eq!(col.collection_type()?, \"type\");\n\n verify_collection(&col, &meta, content)?;\n\n\n\n etebase.logout()\n\n}\n\n\n","file_path":"tests/service.rs","rank":49,"score":74506.07397443125},{"content":"#[derive(Serialize)]\n\nstruct ItemBatchBody<'a> {\n\n items: &'a Vec<&'a EncryptedItem>,\n\n deps: Option<Vec<ItemBatchBodyDep<'a>>>,\n\n}\n\n\n\npub struct ItemManagerOnline {\n\n api_base: Url,\n\n client: Arc<Client>,\n\n}\n\n\n\nimpl ItemManagerOnline {\n\n pub fn new(client: Arc<Client>, col: &EncryptedCollection) -> Self {\n\n Self {\n\n api_base: client\n\n .api_base\n\n .join(&format!(\"api/v1/collection/{}/item/\", col.uid()))\n\n .unwrap(),\n\n client,\n\n }\n\n }\n","file_path":"src/online_managers.rs","rank":50,"score":73371.87075067524},{"content":"pub fn gen_uid_base64() -> StringBase64 {\n\n to_base64(&randombytes(24)).unwrap()\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct CachedContent {\n\n version: u8,\n\n data: Vec<u8>,\n\n}\n\n\n\npub struct AccountCryptoManager(pub CryptoManager);\n\n\n\nimpl AccountCryptoManager {\n\n const COLTYPE_PAD_SIZE: usize = 32;\n\n\n\n pub fn new(key: &[u8; 32], version: u8) -> Result<Self> {\n\n let context = b\"Acct \";\n\n\n\n Ok(Self {\n\n 0: CryptoManager::new(key, &context, version)?,\n","file_path":"src/encrypted_models.rs","rank":51,"score":72896.41923895209},{"content":"#[derive(Serialize)]\n\nstruct ItemBatchBodyDep<'a> {\n\n uid: &'a str,\n\n #[serde(skip_serializing_if = \"std::option::Option::is_none\")]\n\n etag: Option<String>,\n\n}\n\n\n","file_path":"src/online_managers.rs","rank":52,"score":70699.7381914202},{"content":"/// Return the recommended padding length for a buffer of specific length\n\n///\n\n/// Padding data before encrypting it is important for preventing fingerprint analysis attacks.\n\n/// This function aims to return the optimal balance between space efficiently and fingerprint\n\n/// resistance. The returned values may change between versions.\n\n///\n\n/// # Arguments:\n\n/// * `length` - the length of the buffer to pad\n\npub fn get_padding(length: u32) -> u32 {\n\n // Use the padme padding scheme for efficiently\n\n // https://www.petsymposium.org/2019/files/papers/issue4/popets-2019-0056.pdf\n\n\n\n // We want a minimum pad size of 4k\n\n if length < (1 << 14) {\n\n let size = (1 << 10) - 1;\n\n // We add 1 so we always have some padding\n\n return (length | size) + 1;\n\n }\n\n\n\n let e = (length as f64).log2().floor();\n\n let s = (e.log2().floor() as u32) + 1;\n\n let last_bits = (e as u32) - s;\n\n let bit_mask = (1 << last_bits) - 1;\n\n\n\n (length + bit_mask) & !bit_mask\n\n}\n\n\n\n// FIXME: we should properly pad the meta and probably change these functions\n","file_path":"src/utils.rs","rank":53,"score":70358.08216729706},{"content":"fn user_reset(user: &TestUser) -> Result<()> {\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let acct_user = etebase::User::new(user.username, user.email);\n\n // sign-up the account if necessary, ignoring errors as we're about to reset it anyway\n\n let _ = Account::signup_key(\n\n client.clone(),\n\n &acct_user,\n\n b\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\",\n\n );\n\n let body_struct = etebase::test_helpers::SignupBody {\n\n user: &acct_user,\n\n salt: &from_base64(user.salt)?,\n\n pubkey: &from_base64(user.pubkey)?,\n\n login_pubkey: &from_base64(user.loginPubkey)?,\n\n encrypted_content: &from_base64(user.encryptedContent)?,\n\n };\n\n test_reset(&client, body_struct)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"tests/service.rs","rank":54,"score":69469.89955373919},{"content":"fn init_test(user: &TestUser) -> Result<Account> {\n\n etebase::init()?;\n\n user_reset(&user)?;\n\n\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let session_key = from_base64(sessionStorageKey)?;\n\n\n\n let mut ret = Account::restore(client, user.storedSession, Some(&session_key))?;\n\n ret.force_server_url(&test_url())?;\n\n ret.fetch_token()?;\n\n\n\n Ok(ret)\n\n}\n\n\n","file_path":"tests/service.rs","rank":55,"score":65414.57216721926},{"content":"fn init_test_local(user: &TestUser) -> Result<Account> {\n\n etebase::init()?;\n\n\n\n let client = Client::new(CLIENT_NAME, &test_url())?;\n\n let session_key = from_base64(sessionStorageKey)?;\n\n\n\n let ret = Account::restore(client, user.storedSession, Some(&session_key))?;\n\n\n\n Ok(ret)\n\n}\n\n\n","file_path":"tests/fs_cache.rs","rank":56,"score":61712.90481966741},{"content":"struct StorageCryptoManager(CryptoManager);\n\n\n\nimpl StorageCryptoManager {\n\n pub fn new(key: &[u8; 32], version: u8) -> Result<Self> {\n\n let context = b\"Stor \";\n\n\n\n Ok(Self {\n\n 0: CryptoManager::new(key, &context, version)?,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Serialize)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct AccountData<'a> {\n\n pub version: u8,\n\n #[serde(with = \"serde_bytes\")]\n\n pub key: &'a [u8],\n\n pub user: LoginResponseUser,\n\n pub server_url: &'a str,\n","file_path":"src/service.rs","rank":57,"score":46561.43546854775},{"content":"struct MainCryptoManager(CryptoManager);\n\n\n\nimpl MainCryptoManager {\n\n pub fn new(key: &[u8; 32], version: u8) -> Result<MainCryptoManager> {\n\n let context = b\"Main \";\n\n\n\n Ok(MainCryptoManager {\n\n 0: CryptoManager::new(key, &context, version)?,\n\n })\n\n }\n\n\n\n pub fn login_crypto_manager(&self) -> Result<LoginCryptoManager> {\n\n LoginCryptoManager::keygen(&self.0.asym_key_seed)\n\n }\n\n\n\n pub fn account_crypto_manager(&self, key: &[u8; 32]) -> Result<AccountCryptoManager> {\n\n AccountCryptoManager::new(key, self.0.version)\n\n }\n\n\n\n pub fn identity_crypto_manager(&self, privkey: &[u8; 32]) -> Result<BoxCryptoManager> {\n\n BoxCryptoManager::from_privkey(privkey)\n\n }\n\n}\n\n\n","file_path":"src/service.rs","rank":58,"score":46561.43546854775},{"content":"#[test]\n\nfn padding() {\n\n etebase::init().unwrap();\n\n\n\n // Because of how we use padding (unpadding) we need to make sure padding is always larger than the content\n\n // Otherwise we risk the unpadder to fail thinking it should unpad when it shouldn't.\n\n\n\n for i in 1..(1 << 14) {\n\n if get_padding(i) <= i {\n\n println!(\"Yo\");\n\n assert_eq!(format!(\"Failed for {}\", i), \"\");\n\n }\n\n }\n\n\n\n assert_eq!(get_padding(2343242), 2359296);\n\n}\n\n\n","file_path":"tests/utils.rs","rank":59,"score":42750.18358371115},{"content":"#[test]\n\nfn pretty_fingerprint() {\n\n etebase::init().unwrap();\n\n\n\n let pubkey = from_base64(USER.pubkey).unwrap();\n\n\n\n let fingerprint = crypto::pretty_fingerprint(&pubkey);\n\n assert_eq!(fingerprint, \"45680 71497 88570 93128\\n19189 84243 25687 20837\\n47924 46071 54113 18789\");\n\n}\n\n\n","file_path":"tests/crypto.rs","rank":60,"score":40901.53090662994},{"content":"#[test]\n\nfn derive_key() {\n\n etebase::init().unwrap();\n\n\n\n let derived = crypto::derive_key(&from_base64(USER.salt).unwrap(), USER.password).unwrap();\n\n let expected = from_base64(USER.key).unwrap();\n\n assert_eq!(&derived[..], &expected[..]);\n\n}\n\n\n","file_path":"tests/crypto.rs","rank":61,"score":40901.53090662994},{"content":"#[test]\n\nfn crypto_mac() {\n\n etebase::init().unwrap();\n\n\n\n let key = from_base64(USER.key).unwrap();\n\n\n\n let mut crypto_mac = crypto::CryptoMac::new(None).unwrap();\n\n crypto_mac.update(&[0; 4]).unwrap();\n\n crypto_mac.update_with_len_prefix(&[0; 8]).unwrap();\n\n assert_eq!(\n\n crypto_mac.finalize().unwrap(),\n\n from_base64(\"P-Hpzo86RG6Ps4R1gGXmQrzmdJC2OotqqreKmB8G45A\").unwrap()\n\n );\n\n\n\n let mut crypto_mac = crypto::CryptoMac::new(Some(&key)).unwrap();\n\n crypto_mac.update(&[0; 4]).unwrap();\n\n crypto_mac.update_with_len_prefix(&[0; 8]).unwrap();\n\n assert_eq!(\n\n crypto_mac.finalize().unwrap(),\n\n from_base64(\"rgL6d_XDiBfbzevFdtktc61XB5-PkS1uQ1cj5DgfFc8\").unwrap()\n\n );\n\n}\n\n\n","file_path":"tests/crypto.rs","rank":62,"score":40901.53090662994},{"content":"#[test]\n\nfn pad_unpad() {\n\n etebase::init().unwrap();\n\n\n\n let buf = [0; 1076];\n\n let padded = test_buffer_pad(&buf).unwrap();\n\n let unpadded = test_buffer_unpad(&padded[..]).unwrap();\n\n assert_eq!(unpadded, &buf[..]);\n\n}\n\n\n","file_path":"tests/utils.rs","rank":63,"score":40901.53090662994},{"content":"#[test]\n\nfn crypto_manager() {\n\n etebase::init().unwrap();\n\n\n\n let key = from_base64(USER.key).unwrap();\n\n let context = b\"Col \";\n\n let crypto_manager = crypto::CryptoManager::new(\n\n &key[0..32].try_into().unwrap(),\n\n context,\n\n etebase::CURRENT_VERSION,\n\n )\n\n .unwrap();\n\n let subkey = crypto_manager.derive_subkey(&[0; 32]).unwrap();\n\n\n\n assert_eq!(\n\n subkey,\n\n from_base64(\"4w-VCSTETv26JjVlVlD2VaACcb6aQSD2JbF-e89xnaA\").unwrap()\n\n );\n\n\n\n let hash = crypto_manager.calculate_mac(&[0; 32]).unwrap();\n\n assert_eq!(\n","file_path":"tests/crypto.rs","rank":64,"score":40901.53090662994},{"content":"#[test]\n\nfn login_crypto_manager() {\n\n etebase::init().unwrap();\n\n\n\n let login_crypto_manager = crypto::LoginCryptoManager::keygen(&[0; 32]).unwrap();\n\n\n\n let msg = b\"This Is Some Test Cleartext.\";\n\n let signature = login_crypto_manager.sign_detached(msg).unwrap();\n\n let pubkey = login_crypto_manager.pubkey();\n\n assert!(login_crypto_manager\n\n .verify_detached(msg, &signature, (&pubkey[..]).try_into().unwrap())\n\n .unwrap());\n\n}\n\n\n","file_path":"tests/crypto.rs","rank":65,"score":39269.619839012295},{"content":"#[test]\n\nfn box_crypto_manager() {\n\n etebase::init().unwrap();\n\n\n\n let box_crypto_manager = crypto::BoxCryptoManager::keygen(None).unwrap();\n\n let box_crypto_manager2 = crypto::BoxCryptoManager::keygen(None).unwrap();\n\n\n\n let msg = b\"This Is Some Test Cleartext.\";\n\n let cipher = box_crypto_manager\n\n .encrypt(msg, (&box_crypto_manager2.pubkey()[..]).try_into().unwrap())\n\n .unwrap();\n\n let decrypted = box_crypto_manager2\n\n .decrypt(\n\n &cipher[..],\n\n (&box_crypto_manager.pubkey()[..]).try_into().unwrap(),\n\n )\n\n .unwrap();\n\n assert_eq!(decrypted, msg);\n\n}\n\n\n","file_path":"tests/crypto.rs","rank":66,"score":39269.619839012295},{"content":"#[test]\n\nfn pad_unpad_fixed() {\n\n etebase::init().unwrap();\n\n\n\n let blocksize = 32;\n\n for i in 0..(blocksize * 2) {\n\n let buf = vec![60; i];\n\n let padded = test_buffer_pad_fixed(&buf, blocksize).unwrap();\n\n let unpadded = test_buffer_unpad_fixed(&padded[..], blocksize).unwrap();\n\n assert_eq!(unpadded, &buf[..]);\n\n }\n\n}\n","file_path":"tests/utils.rs","rank":67,"score":39269.619839012295},{"content":"fn print_item(item: &Item) {\n\n println!(\"UID: {}\", &item.uid());\n\n println!(\"Meta: {:?}\", &item.meta().unwrap());\n\n println!();\n\n}\n\n\n","file_path":"examples/etebase_test.rs","rank":68,"score":34099.27685259732},{"content":"fn print_collection(collection: &Collection) {\n\n println!(\"UID: {}\", &collection.uid());\n\n println!(\"Meta: {:?}\", &collection.meta().unwrap());\n\n println!();\n\n}\n\n\n","file_path":"examples/etebase_test.rs","rank":69,"score":34099.27685259732},{"content":"// SPDX-FileCopyrightText: © 2020 Etebase Authors\n\n// SPDX-License-Identifier: LGPL-2.1-only\n\n\n\nuse std::error;\n\nuse std::fmt;\n\n\n\n/// A short-hand version of a [std::result::Result] that always returns an Etebase [Error].\n\npub type Result<T> = std::result::Result<T, Error>;\n\n\n\n/// The error type returned from the Etebase API\n\n#[derive(Debug, Clone)]\n\npub enum Error {\n\n /// A generic error\n\n Generic(String),\n\n /// An error with parsing the a URL (e.g. from the server URL)\n\n UrlParse(String),\n\n /// An error related to msgpack serialization and de-serialization\n\n MsgPack(String),\n\n /// A programming error that indicates the developers are using the API wrong\n\n ProgrammingError(&'static str),\n","file_path":"src/error.rs","rank":70,"score":32698.48264797126},{"content":" }\n\n}\n\n\n\nimpl From<String> for Error {\n\n fn from(err: String) -> Error {\n\n Error::Generic(err)\n\n }\n\n}\n\n\n\nimpl From<url::ParseError> for Error {\n\n fn from(err: url::ParseError) -> Error {\n\n Error::UrlParse(err.to_string())\n\n }\n\n}\n\n\n\nimpl From<std::ffi::NulError> for Error {\n\n fn from(err: std::ffi::NulError) -> Error {\n\n Error::Generic(err.to_string())\n\n }\n\n}\n","file_path":"src/error.rs","rank":71,"score":32697.110363503303},{"content":"\n\nimpl From<std::io::Error> for Error {\n\n fn from(err: std::io::Error) -> Error {\n\n Error::UrlParse(err.to_string())\n\n }\n\n}\n\n\n\nimpl From<rmp_serde::encode::Error> for Error {\n\n fn from(err: rmp_serde::encode::Error) -> Error {\n\n Error::MsgPack(err.to_string())\n\n }\n\n}\n\n\n\nimpl From<rmp_serde::decode::Error> for Error {\n\n fn from(err: rmp_serde::decode::Error) -> Error {\n\n Error::MsgPack(err.to_string())\n\n }\n\n}\n","file_path":"src/error.rs","rank":72,"score":32695.03787342224},{"content":" Error::Unauthorized(s) => s.fmt(f),\n\n Error::Conflict(s) => s.fmt(f),\n\n\n\n Error::Connection(s) => s.fmt(f),\n\n Error::TemporaryServerError(s) => s.fmt(f),\n\n Error::ServerError(s) => s.fmt(f),\n\n Error::Http(s) => s.fmt(f),\n\n }\n\n }\n\n}\n\n\n\nimpl From<Error> for String {\n\n fn from(err: Error) -> String {\n\n err.to_string()\n\n }\n\n}\n\n\n\nimpl error::Error for Error {\n\n fn source(&self) -> Option<&(dyn error::Error + 'static)> {\n\n None\n","file_path":"src/error.rs","rank":73,"score":32693.836661848658},{"content":" TemporaryServerError(String),\n\n /// There was a server error when processing the request (usually a bug in the server)\n\n ServerError(String),\n\n /// A generic error with the server request\n\n Http(String),\n\n}\n\n\n\nimpl fmt::Display for Error {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n Error::Generic(s) => s.fmt(f),\n\n Error::UrlParse(s) => s.fmt(f),\n\n Error::MsgPack(s) => s.fmt(f),\n\n Error::ProgrammingError(s) => s.fmt(f),\n\n Error::MissingContent(s) => s.fmt(f),\n\n Error::Padding(s) => s.fmt(f),\n\n Error::Base64(s) => s.fmt(f),\n\n Error::Encryption(s) => s.fmt(f),\n\n Error::PermissionDenied(s) => s.fmt(f),\n\n Error::NotFound(s) => s.fmt(f),\n","file_path":"src/error.rs","rank":74,"score":32689.927211697766},{"content":" /// An attempt to fetch the content of an item that doesn't have the content yet\n\n MissingContent(&'static str),\n\n /// An issue with the padding of the encrypted content\n\n Padding(&'static str),\n\n /// An issue with the Base64 decoding\n\n Base64(&'static str),\n\n /// An issue with the encryption\n\n Encryption(&'static str),\n\n /// An authorization issue from the server\n\n Unauthorized(String),\n\n /// A conflict issue returned from the server, e.g. if a transaction failed\n\n Conflict(String),\n\n /// The operation was not allowed due to permissions\n\n PermissionDenied(String),\n\n /// The requested resource was not found\n\n NotFound(String),\n\n\n\n /// There was an issue with the connection (e.g. DNS lookup)\n\n Connection(String),\n\n /// There was an temporary server error (e.g. maintenance, or gateway issues)\n","file_path":"src/error.rs","rank":75,"score":32684.842462875647},{"content":"\n\n let ret: LoginResponse = rmp_serde::from_read_ref(&res)?;\n\n\n\n Ok(ret)\n\n }\n\n\n\n pub fn logout(&self) -> Result<()> {\n\n let url = self.api_base.join(\"logout/\")?;\n\n let res = self.client.post(url.as_str(), vec![])?;\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn change_password(&self, response: &[u8], signature: &[u8]) -> Result<()> {\n\n let body_struct = LoginBody {\n\n response,\n\n signature,\n\n };\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n","file_path":"src/online_managers.rs","rank":83,"score":30.69590863125075},{"content":" let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n let res = res.bytes();\n\n\n\n let ret: LoginResponse = rmp_serde::from_read_ref(&res)?;\n\n\n\n Ok(ret)\n\n }\n\n\n\n pub fn login(&self, response: &[u8], signature: &[u8]) -> Result<LoginResponse> {\n\n let body_struct = LoginBody {\n\n response,\n\n signature,\n\n };\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n\n\n\n let url = self.api_base.join(\"login/\")?;\n\n let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n let res = res.bytes();\n","file_path":"src/online_managers.rs","rank":84,"score":30.583609840142223},{"content":" let status = resp.status().as_u16();\n\n let ret = Response::new(resp.bytes()?.to_vec(), status);\n\n Ok(ret)\n\n }\n\n}\n\n\n\nimpl ClientImplementation for Client {\n\n fn get(&self, url: &str, auth_token: Option<&str>) -> Response {\n\n match self.get_inner(url, auth_token) {\n\n Ok(resp) => resp,\n\n Err(err) => Response::new_err(err),\n\n }\n\n }\n\n\n\n fn post(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response {\n\n match self.post_inner(url, auth_token, body) {\n\n Ok(resp) => resp,\n\n Err(err) => Response::new_err(err),\n\n }\n\n }\n","file_path":"src/http_client/reqwest_client.rs","rank":85,"score":29.076393294815784},{"content":" let body = rmp_serde::to_vec_named(&body_struct)?;\n\n\n\n let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn reject(&self, invitation: &SignedInvitation) -> Result<()> {\n\n let url = self\n\n .api_base\n\n .join(&format!(\"incoming/{}/\", invitation.uid()))?;\n\n\n\n let res = self.client.delete(url.as_str())?;\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn fetch_user_profile(&self, username: &str) -> Result<UserProfile> {\n","file_path":"src/online_managers.rs","rank":86,"score":28.200641053908722},{"content":" Ok(true)\n\n }\n\n\n\n pub fn get_login_challenge(&self, username: &str) -> Result<LoginChallange> {\n\n #[derive(Serialize)]\n\n struct Body<'a> {\n\n username: &'a str,\n\n }\n\n\n\n let body_struct = Body { username };\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n\n\n\n let url = self.api_base.join(\"login_challenge/\")?;\n\n let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n let res = res.bytes();\n\n\n\n let ret: LoginChallange = rmp_serde::from_read_ref(&res)?;\n\n\n\n Ok(ret)\n","file_path":"src/online_managers.rs","rank":87,"score":27.75268946409738},{"content":" /// Return the server url associated with this client\n\n pub fn server_url(&self) -> &Url {\n\n &self.api_base\n\n }\n\n\n\n pub(crate) fn get(&self, url: &str) -> Result<Response> {\n\n self.imp.get(url, self.auth_token.as_deref()).into_result()\n\n }\n\n\n\n pub(crate) fn post(&self, url: &str, body: Vec<u8>) -> Result<Response> {\n\n self.imp\n\n .post(url, self.auth_token.as_deref(), body)\n\n .into_result()\n\n }\n\n\n\n pub(crate) fn put(&self, url: &str, body: Vec<u8>) -> Result<Response> {\n\n self.imp\n\n .put(url, self.auth_token.as_deref(), body)\n\n .into_result()\n\n }\n","file_path":"src/http_client/mod.rs","rank":88,"score":27.72710096294723},{"content":" let res = self.client.post(url.as_str(), vec![])?;\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn modify_access_level(\n\n &self,\n\n username: &str,\n\n access_level: CollectionAccessLevel,\n\n ) -> Result<()> {\n\n let url = self.api_base.join(&format!(\"{}/\", username))?;\n\n\n\n #[derive(Serialize)]\n\n #[serde(rename_all = \"camelCase\")]\n\n struct Body {\n\n access_level: CollectionAccessLevel,\n\n }\n\n\n\n let body_struct = Body { access_level };\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n\n\n\n let res = self.client.patch(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"src/online_managers.rs","rank":89,"score":26.910647017869177},{"content":" let req = self.prep_client(self.req_client.get(url), auth_token);\n\n let resp = req.send()?;\n\n let status = resp.status().as_u16();\n\n let ret = Response::new(resp.bytes()?.to_vec(), status);\n\n Ok(ret)\n\n }\n\n\n\n fn post_inner(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Result<Response> {\n\n let req = self\n\n .prep_client(self.req_client.post(url), auth_token)\n\n .body(body);\n\n let resp = req.send()?;\n\n let status = resp.status().as_u16();\n\n let ret = Response::new(resp.bytes()?.to_vec(), status);\n\n Ok(ret)\n\n }\n\n\n\n fn put_inner(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Result<Response> {\n\n let req = self\n\n .prep_client(self.req_client.put(url), auth_token)\n","file_path":"src/http_client/reqwest_client.rs","rank":90,"score":26.899589473168387},{"content":" .body(body);\n\n let resp = req.send()?;\n\n let status = resp.status().as_u16();\n\n let ret = Response::new(resp.bytes()?.to_vec(), status);\n\n Ok(ret)\n\n }\n\n\n\n fn patch_inner(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Result<Response> {\n\n let req = self\n\n .prep_client(self.req_client.patch(url), auth_token)\n\n .body(body);\n\n let resp = req.send()?;\n\n let status = resp.status().as_u16();\n\n let ret = Response::new(resp.bytes()?.to_vec(), status);\n\n Ok(ret)\n\n }\n\n\n\n fn delete_inner(&self, url: &str, auth_token: Option<&str>) -> Result<Response> {\n\n let req = self.prep_client(self.req_client.delete(url), auth_token);\n\n let resp = req.send()?;\n","file_path":"src/http_client/reqwest_client.rs","rank":91,"score":26.504021757327692},{"content":"\n\n fn put(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response {\n\n match self.put_inner(url, auth_token, body) {\n\n Ok(resp) => resp,\n\n Err(err) => Response::new_err(err),\n\n }\n\n }\n\n\n\n fn patch(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response {\n\n match self.patch_inner(url, auth_token, body) {\n\n Ok(resp) => resp,\n\n Err(err) => Response::new_err(err),\n\n }\n\n }\n\n\n\n fn delete(&self, url: &str, auth_token: Option<&str>) -> Response {\n\n match self.delete_inner(url, auth_token) {\n\n Ok(resp) => resp,\n\n Err(err) => Response::new_err(err),\n\n }\n\n }\n\n}\n","file_path":"src/http_client/reqwest_client.rs","rank":92,"score":25.367002161038926},{"content":"\n\n pub(crate) fn patch(&self, url: &str, body: Vec<u8>) -> Result<Response> {\n\n self.imp\n\n .patch(url, self.auth_token.as_deref(), body)\n\n .into_result()\n\n }\n\n\n\n pub(crate) fn delete(&self, url: &str) -> Result<Response> {\n\n self.imp\n\n .delete(url, self.auth_token.as_deref())\n\n .into_result()\n\n }\n\n}\n","file_path":"src/http_client/mod.rs","rank":93,"score":24.61915181284955},{"content":"\n\n let url = self.api_base.join(\"change_password/\")?;\n\n let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn fetch_dashboard_url(&self) -> Result<String> {\n\n #[derive(Deserialize)]\n\n struct Ret {\n\n pub url: String,\n\n }\n\n\n\n let url = self.api_base.join(\"dashboard_url/\")?;\n\n let res = self.client.post(url.as_str(), vec![])?;\n\n res.error_for_status()?;\n\n let res = res.bytes();\n\n\n\n let ret: Ret = rmp_serde::from_read_ref(&res)?;\n","file_path":"src/online_managers.rs","rank":94,"score":24.386466754972155},{"content":" let body_struct = Body { collection_types };\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n\n\n\n let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n let res = res.bytes();\n\n\n\n let serialized: CollectionListResponse<EncryptedCollection> =\n\n rmp_serde::from_read_ref(&res)?;\n\n serialized.data.iter().for_each(|x| x.mark_saved());\n\n\n\n Ok(serialized)\n\n }\n\n\n\n pub fn create(\n\n &self,\n\n collection: &EncryptedCollection,\n\n options: Option<&FetchOptions>,\n\n ) -> Result<()> {\n\n let url = apply_fetch_options(self.api_base.clone(), options);\n","file_path":"src/online_managers.rs","rank":95,"score":24.2003767112605},{"content":" ///\n\n /// The client object manages the connection to the Etebase server\n\n ///\n\n /// # Arguments:\n\n /// * `client_name` - a string identifier for the client\n\n /// * `server_url` - the Etebase server URL\n\n #[cfg(feature = \"networking\")]\n\n pub fn new(client_name: &str, server_url: &str) -> Result<Self> {\n\n let imp = ReqwestImpl::new(client_name)?;\n\n Ok(Self {\n\n api_base: Self::normalize_url(server_url)?,\n\n auth_token: None,\n\n imp: Arc::new(imp),\n\n })\n\n }\n\n\n\n #[cfg(not(feature = \"networking\"))]\n\n pub fn new_with_impl(server_url: &str, imp: Box<dyn ClientImplementation>) -> Result<Self> {\n\n Ok(Self {\n\n api_base: Self::normalize_url(server_url)?,\n","file_path":"src/http_client/mod.rs","rank":96,"score":24.02885789781851},{"content":" let body_struct = ItemBatchBody {\n\n items: &items,\n\n deps,\n\n };\n\n let body = rmp_serde::to_vec_named(&body_struct)?;\n\n\n\n let res = self.client.post(url.as_str(), body)?;\n\n res.error_for_status()?;\n\n\n\n for item in items {\n\n item.mark_saved();\n\n }\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn transaction<'a, I, J>(\n\n &self,\n\n items: I,\n\n deps: J,\n","file_path":"src/online_managers.rs","rank":97,"score":23.507630687105387},{"content":" options: Option<&FetchOptions>,\n\n ) -> Result<Vec<u8>> {\n\n let url = apply_fetch_options(\n\n self.api_base\n\n .join(&format!(\"{}/chunk/{}/download/\", item_uid, chunk_uid))?,\n\n options,\n\n );\n\n let res = self.client.get(url.as_str())?;\n\n res.error_for_status()?;\n\n\n\n Ok(res.bytes().to_vec())\n\n }\n\n}\n\n\n\n/// A member of a collection\n\n///\n\n/// Obtained using [CollectionManager::list](crate::managers::CollectionManager::list)\n\n#[derive(Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct CollectionMember {\n","file_path":"src/online_managers.rs","rank":98,"score":22.387845661363055},{"content":" /// Unlike [Self::login], this uses a strong key instead of a password\n\n ///\n\n /// # Arguments:\n\n /// * `username` - the user's username. This is not the same as the user's email.\n\n /// * `client` - the already setup [Client] object\n\n /// * `main_key` - the key to signup with\n\n pub fn login_key(client: Client, username: &str, main_key: &[u8]) -> Result<Self> {\n\n super::init()?;\n\n\n\n if main_key.len() < SYMMETRIC_KEY_SIZE {\n\n return Err(Error::ProgrammingError(\n\n \"Key should be at least 32 bytes long.\",\n\n ));\n\n }\n\n\n\n let authenticator = Authenticator::new(&client);\n\n let login_challenge = match authenticator.get_login_challenge(username) {\n\n Err(Error::Unauthorized(s)) => {\n\n // FIXME: fragile, we should have a proper error value or actually use codes\n\n if s == \"User not properly init\" {\n","file_path":"src/service.rs","rank":99,"score":22.30806762221205}],"string":"[\n {\n \"content\": \"pub fn derive_key(salt: &[u8], password: &str) -> Result<Vec<u8>> {\\n\\n let mut key = vec![0; 32];\\n\\n let salt = &salt[..argon2id13::SALTBYTES];\\n\\n let salt: &[u8; argon2id13::SALTBYTES] =\\n\\n to_enc_error!(salt.try_into(), \\\"Expect salt to be at least 16 bytes\\\")?;\\n\\n let password = password.as_bytes();\\n\\n\\n\\n let ret = argon2id13::derive_key(\\n\\n &mut key,\\n\\n password,\\n\\n &argon2id13::Salt(*salt),\\n\\n argon2id13::OPSLIMIT_SENSITIVE,\\n\\n argon2id13::MEMLIMIT_MODERATE,\\n\\n );\\n\\n Ok(to_enc_error!(ret, \\\"pwhash failed\\\")?.as_ref().to_vec())\\n\\n}\\n\\n\\n\\npub struct CryptoManager {\\n\\n pub version: u8,\\n\\n cipher_key: [u8; 32],\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 0,\n \"score\": 198838.4914359434\n },\n {\n \"content\": \"/// Convert a Base64 URL encoded string to a buffer\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `string` - the Base64 URL encoded string\\n\\npub fn from_base64(string: &StrBase64) -> Result<Vec<u8>> {\\n\\n match base64::decode(string, base64::Variant::UrlSafeNoPadding) {\\n\\n Ok(bytes) => Ok(bytes),\\n\\n Err(_) => Err(Error::Base64(\\\"Failed decoding base64 string\\\")),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 1,\n \"score\": 186978.2197330059\n },\n {\n \"content\": \"pub fn init() -> error::Result<()> {\\n\\n crypto::init()\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 2,\n \"score\": 161776.85268845706\n },\n {\n \"content\": \"/// Convert a buffer to a Base64 URL encoded string\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `bytes` - the buffer to convert\\n\\npub fn to_base64(bytes: &[u8]) -> Result<StringBase64> {\\n\\n Ok(base64::encode(bytes, base64::Variant::UrlSafeNoPadding))\\n\\n}\\n\\n\\n\\n// Fisher–Yates shuffle - an unbiased shuffler\\n\\n// The returend indices of where item is now.\\n\\n// So if the first item moved to position 3: ret[0] = 3\\n\\npub(crate) fn shuffle<T>(a: &mut Vec<T>) -> Vec<usize> {\\n\\n let len = a.len();\\n\\n let mut shuffled_indices: Vec<usize> = (0..len).collect();\\n\\n\\n\\n for i in 0..len {\\n\\n let j = i + sodiumoxide::randombytes::randombytes_uniform((len - i) as u32) as usize;\\n\\n a.swap(i, j);\\n\\n shuffled_indices.swap(i, j);\\n\\n }\\n\\n\\n\\n let mut ret = vec![0; len];\\n\\n for i in 0..len {\\n\\n ret[shuffled_indices[i]] = i;\\n\\n }\\n\\n ret\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 3,\n \"score\": 159684.05877928648\n },\n {\n \"content\": \"/// Return a buffer filled with cryptographically random bytes\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `size` - the size of the returned buffer (in bytes)\\n\\npub fn randombytes(size: usize) -> Vec<u8> {\\n\\n sodiumoxide::randombytes::randombytes(size)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 4,\n \"score\": 145686.08085385064\n },\n {\n \"content\": \"fn generichash_quick(msg: &[u8], key: Option<&[u8]>) -> Result<Vec<u8>> {\\n\\n let mut state = to_enc_error!(generichash::State::new(32, key), \\\"Failed to init hash\\\")?;\\n\\n to_enc_error!(state.update(msg), \\\"Failed to update hash\\\")?;\\n\\n Ok(to_enc_error!(state.finalize(), \\\"Failed to finalize hash\\\")?\\n\\n .as_ref()\\n\\n .to_vec())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 5,\n \"score\": 145118.572742657\n },\n {\n \"content\": \"/// Return a buffer filled with deterministically cryptographically random bytes\\n\\n///\\n\\n/// This function is similar to [randombytes] but always returns the same data for the same seed.\\n\\n/// Useful for testing purposes.\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `seed` - the seed to generate the random data from\\n\\n/// * `size` - the size of the returned buffer (in bytes)\\n\\npub fn randombytes_deterministic(size: usize, seed: &[u8; 32]) -> Vec<u8> {\\n\\n // Not exactly like the sodium randombytes_deterministic but close enough\\n\\n let nonce =\\n\\n sodiumoxide::crypto::stream::xchacha20::Nonce(*b\\\"LibsodiumDRG\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\\0\\\");\\n\\n let key = sodiumoxide::crypto::stream::xchacha20::Key(*seed);\\n\\n\\n\\n sodiumoxide::crypto::stream::xchacha20::stream(size, &nonce, &key)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 6,\n \"score\": 140627.3202634475\n },\n {\n \"content\": \"pub fn test_reset(client: &Client, body_struct: SignupBody) -> Result<()> {\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n let url = client.api_base.join(\\\"api/v1/test/authentication/reset/\\\")?;\\n\\n\\n\\n let res = client.post(url.as_str(), body)?;\\n\\n\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// A collection for which the user lost access\\n\\n///\\n\\n/// Deleted collections are marked using [crate::Collection::is_deleted]. However, when we just lose access\\n\\n/// to a collection and it hasn't been deleted, we get this object.\\n\\n#[derive(Deserialize, Clone)]\\n\\npub struct RemovedCollection {\\n\\n uid: StringBase64,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 7,\n \"score\": 134262.6107604373\n },\n {\n \"content\": \"pub fn init() -> Result<()> {\\n\\n to_enc_error!(sodiumoxide::init(), \\\"Failed initialising libsodium\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 8,\n \"score\": 125749.40264777982\n },\n {\n \"content\": \"/// A constant-time comparison function\\n\\n///\\n\\n/// Use this when comparing secret data in order to prevent side-channel attacks.\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `x` - the first buffer\\n\\n/// * `y` - the second buffer\\n\\npub fn memcmp(x: &[u8], y: &[u8]) -> bool {\\n\\n sodiumoxide::utils::memcmp(x, y)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 9,\n \"score\": 124796.10524185825\n },\n {\n \"content\": \"pub fn apply_fetch_options(url: Url, options: Option<&FetchOptions>) -> Url {\\n\\n let options = match options {\\n\\n Some(options) => options,\\n\\n None => return url,\\n\\n };\\n\\n\\n\\n let mut url = url;\\n\\n {\\n\\n let mut query = url.query_pairs_mut();\\n\\n if let Some(limit) = options.limit {\\n\\n query.append_pair(\\\"limit\\\", &limit.to_string());\\n\\n }\\n\\n if let Some(prefetch) = options.prefetch {\\n\\n let prefetch = match prefetch {\\n\\n PrefetchOption::Auto => \\\"auto\\\",\\n\\n PrefetchOption::Medium => \\\"medium\\\",\\n\\n };\\n\\n query.append_pair(\\\"prefetch\\\", prefetch);\\n\\n }\\n\\n if let Some(with_collection) = options.with_collection {\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 10,\n \"score\": 113911.10762855585\n },\n {\n \"content\": \"/// Return a pretty formatted fingerprint of the content\\n\\n///\\n\\n/// For example:\\n\\n/// ```shell\\n\\n/// 45680 71497 88570 93128\\n\\n/// 19189 84243 25687 20837\\n\\n/// 47924 46071 54113 18789\\n\\n/// ```\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `content` - the content to create a fingerprint for\\n\\npub fn pretty_fingerprint(content: &[u8]) -> String {\\n\\n let delimiter = \\\" \\\";\\n\\n let fingerprint = generichash_quick(content, None).unwrap();\\n\\n\\n\\n /* We use 3 bytes each time to generate a 5 digit number - this means 10 pairs for bytes 0-29\\n\\n * We then use bytes 29-31 for another number, and then the 3 most significant bits of each first byte for the last.\\n\\n */\\n\\n let mut last_num: u32 = 0;\\n\\n let parts = (0..10).into_iter().map(|i| {\\n\\n let suffix = if i % 4 == 3 { \\\"\\\\n\\\" } else { delimiter };\\n\\n\\n\\n last_num = (last_num << 3) | ((fingerprint[i] as u32) & 0xE0) >> 5;\\n\\n get_encoded_chunk(&fingerprint[i * 3..], suffix)\\n\\n });\\n\\n\\n\\n let last_num = (0..10).into_iter().fold(0, |accum, i| {\\n\\n (accum << 3) | ((fingerprint[i] as u32) & 0xE0) >> 5\\n\\n }) % 100000;\\n\\n let last_num = format!(\\\"{:0>5}\\\", last_num);\\n\\n let parts = parts\\n\\n .chain(std::iter::once(get_encoded_chunk(\\n\\n &fingerprint[29..],\\n\\n delimiter,\\n\\n )))\\n\\n .chain(std::iter::once(last_num));\\n\\n parts.collect::<String>()\\n\\n}\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 12,\n \"score\": 109859.53669122685\n },\n {\n \"content\": \"/// The `unpad()` function computes the original, unpadded length of a message previously padded\\n\\n/// using [`pad()`]. The original length is returned upon success.\\n\\npub fn unpad(buf: &[u8], padded_buflen: usize, blocksize: usize) -> Result<usize, ()> {\\n\\n let mut unpadded_buflen_p: usize = 0;\\n\\n unsafe {\\n\\n if 0 == ffi::sodium_unpad(\\n\\n &mut unpadded_buflen_p,\\n\\n buf.as_ptr() as *const _,\\n\\n padded_buflen,\\n\\n blocksize,\\n\\n ) {\\n\\n Ok(unpadded_buflen_p)\\n\\n } else {\\n\\n Err(())\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils/sodium_padding.rs\",\n \"rank\": 13,\n \"score\": 107093.79964595834\n },\n {\n \"content\": \"#[test]\\n\\nfn get_dashboard_url() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n\\n\\n match etebase.fetch_dashboard_url() {\\n\\n Ok(url) => assert!(url.len() > 0),\\n\\n err => assert_err!(err, Error::Http(_)),\\n\\n };\\n\\n\\n\\n etebase.logout()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 14,\n \"score\": 104954.80712330033\n },\n {\n \"content\": \"/// The `pad()` function adds padding data to a buffer buf whose original size is `unpadded_buflen`\\n\\n/// in order to extend its total length to a multiple of blocksize.\\n\\n///\\n\\n/// The function returns `Err(())` if the padded buffer length would exceed `max_buflen`, or if the\\n\\n/// block size is 0. It returns a result containing the new padded length upon success.\\n\\npub fn pad(buf: &mut [u8], unpadded_buflen: usize, blocksize: usize) -> Result<usize, ()> {\\n\\n let mut padded_buflen_p: usize = 0;\\n\\n unsafe {\\n\\n if 0 == ffi::sodium_pad(\\n\\n &mut padded_buflen_p,\\n\\n buf.as_mut_ptr() as *mut _,\\n\\n unpadded_buflen,\\n\\n blocksize,\\n\\n buf.len(),\\n\\n ) {\\n\\n Ok(padded_buflen_p)\\n\\n } else {\\n\\n Err(())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/sodium_padding.rs\",\n \"rank\": 15,\n \"score\": 102575.59602832266\n },\n {\n \"content\": \"fn get_encoded_chunk(content: &[u8], suffix: &str) -> String {\\n\\n let num =\\n\\n (((content[0] as u32) << 16) + ((content[1] as u32) << 8) + (content[2] as u32)) % 100000;\\n\\n return format!(\\\"{:0>5}{}\\\", num, suffix);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/crypto.rs\",\n \"rank\": 16,\n \"score\": 101791.20601220075\n },\n {\n \"content\": \"pub fn test_url() -> String {\\n\\n let server = env::var(\\\"ETEBASE_TEST_HOST\\\").expect(\\\"Set ETEBASE_TEST_HOST to run tests\\\");\\n\\n format!(\\\"http://{}\\\", server)\\n\\n}\\n\\n\\n\\n#[allow(non_snake_case)]\\n\\npub struct TestUser {\\n\\n pub username: &'static str,\\n\\n pub email: &'static str,\\n\\n pub password: &'static str,\\n\\n pub pubkey: &'static str,\\n\\n pub encryptedContent: &'static str,\\n\\n\\n\\n pub loginPubkey: &'static str,\\n\\n pub key: &'static str,\\n\\n pub salt: &'static str,\\n\\n\\n\\n pub storedSession: &'static str,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/common/mod.rs\",\n \"rank\": 17,\n \"score\": 101551.38051164092\n },\n {\n \"content\": \"/// A trait for serializing and deserializing to MsgPack\\n\\npub trait MsgPackSerilization {\\n\\n /// The type of the struct implementing this trait\\n\\n type Output;\\n\\n\\n\\n /// Convert self to a msgpack encoded buffer\\n\\n fn to_msgpack(&self) -> Result<Vec<u8>>;\\n\\n\\n\\n /// Create the struct from a MsgPack encoded buffer\\n\\n ///\\n\\n /// # Arguments:\\n\\n /// * `data` - the MsgPack buffer\\n\\n fn from_msgpack(data: &[u8]) -> Result<Self::Output>;\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 18,\n \"score\": 94792.21193068725\n },\n {\n \"content\": \"fn verify_collection(col: &Collection, meta: &ItemMetadata, content: &[u8]) -> Result<()> {\\n\\n col.verify()?;\\n\\n assert_eq!(&col.meta()?, meta);\\n\\n assert_eq!(col.content()?, content);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 19,\n \"score\": 88314.35202282511\n },\n {\n \"content\": \"fn verify_item(item: &Item, meta: &ItemMetadata, content: &[u8]) -> Result<()> {\\n\\n item.verify()?;\\n\\n assert_eq!(&item.meta()?, meta);\\n\\n assert_eq!(item.content()?, content);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 20,\n \"score\": 88314.35202282511\n },\n {\n \"content\": \"#[test]\\n\\nfn collection_as_item() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let mut col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n // Verify with_collection works\\n\\n {\\n\\n let items = it_mgr.list(None)?;\\n\\n assert_eq!(items.data().len(), 0);\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 21,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn is_etebase_server() -> Result<()> {\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n assert!(Account::is_etebase_server(&client)?);\\n\\n\\n\\n let test_url = format!(\\\"{}/api/\\\", test_url());\\n\\n let client = Client::new(CLIENT_NAME, &test_url)?;\\n\\n assert!(!Account::is_etebase_server(&client)?);\\n\\n\\n\\n let client = Client::new(CLIENT_NAME, \\\"http://doesnotexist\\\")?;\\n\\n assert!(Account::is_etebase_server(&client).is_err());\\n\\n\\n\\n // Verify we also fail correctly for login\\n\\n let client = Client::new(CLIENT_NAME, &test_url)?;\\n\\n assert_err!(\\n\\n Account::login(client.clone(), USER2.username, USER2.password),\\n\\n Error::NotFound(_)\\n\\n );\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 22,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn item_revisions() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item Orig\\\")).clone();\\n\\n let content = b\\\"\\\";\\n\\n let mut item = it_mgr.create(&meta, content)?;\\n\\n\\n\\n for i in 0..5 {\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(&format!(\\\"Item {}\\\", i)))\\n\\n .clone();\\n\\n item.set_meta(&meta)?;\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 23,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn collection_types() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n {\\n\\n let collections = col_mgr.list(\\\"some.coltype\\\", None)?;\\n\\n assert_eq!(collections.data().len(), 0);\\n\\n }\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n {\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 24,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn deterministic_encrypt() -> Result<()> {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let key = from_base64(USER.key)?;\\n\\n\\n\\n let context = b\\\"Col \\\";\\n\\n let crypto_manager = crypto::CryptoManager::new(\\n\\n &key[0..32].try_into().unwrap(),\\n\\n context,\\n\\n etebase::CURRENT_VERSION,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n // Deterministic encryption\\n\\n let clear_text = b\\\"This Is Some Test Cleartext.\\\";\\n\\n let cipher = crypto_manager\\n\\n .deterministic_encrypt(clear_text, None)\\n\\n .unwrap();\\n\\n let decrypted = crypto_manager.deterministic_decrypt(&cipher, None).unwrap();\\n\\n assert_eq!(clear_text, &decrypted[..]);\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 25,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn iterating_invitations() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n\\n\\n let etebase2 = init_test(&USER2)?;\\n\\n let invite_mgr2 = etebase2.invitation_manager()?;\\n\\n\\n\\n let invite_mgr = etebase.invitation_manager()?;\\n\\n let user2_profile = invite_mgr.fetch_user_profile(USER2.username)?;\\n\\n\\n\\n for i in 0..3 {\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(&format!(\\\"Item {}\\\", i)))\\n\\n .clone();\\n\\n let content = b\\\"\\\";\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &meta, content).unwrap();\\n\\n col_mgr.upload(&col, None)?;\\n\\n invite_mgr.invite(\\n\\n &col,\\n\\n USER2.username,\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 26,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn collection_invitations() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let items: Vec<Item> = (0..5)\\n\\n .into_iter()\\n\\n .map(|i| {\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(&format!(\\\"Item {}\\\", i)))\\n\\n .clone();\\n\\n let content = b\\\"\\\";\\n\\n it_mgr.create(&meta, content).unwrap()\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 27,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"fn main() -> Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() < 4 {\\n\\n println!(\\\"Help: ./etebase_test USERNAME PASSWORD SERVER_URL [COLLECTION_UID]\\\");\\n\\n std::process::exit(1);\\n\\n }\\n\\n\\n\\n let username = &args[1];\\n\\n let password = &args[2];\\n\\n let server_url = &args[3];\\n\\n\\n\\n let client = Client::new(CLIENT_NAME, server_url)?;\\n\\n let etebase = Account::login(client, username, password)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n if args.len() >= 5 {\\n\\n let col_uid = &args[4];\\n\\n let col = col_mgr.fetch(col_uid, None)?;\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n let items = it_mgr.list(None)?;\\n\",\n \"file_path\": \"examples/etebase_test.rs\",\n \"rank\": 28,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn item_transactions() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item 1\\\")).clone();\\n\\n let content = b\\\"\\\";\\n\\n let mut item = it_mgr.create(&meta, content)?;\\n\\n\\n\\n let deps = vec![&item];\\n\\n it_mgr.transaction(deps.clone().into_iter(), None)?;\\n\\n\\n\\n let item_old = it_mgr.fetch(item.uid(), None)?;\\n\\n let mut item_old2 = it_mgr.fetch(item.uid(), None)?;\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 29,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore]\\n\\nfn signup_with_key() -> Result<()> {\\n\\n // FIXME: Doesn't work at the moment, because we can't signup with the same user. We need reset\\n\\n // to support wiping.\\n\\n\\n\\n // Reset user manually because we want to signup\\n\\n etebase::init()?;\\n\\n user_reset(&USER)?;\\n\\n\\n\\n let main_key = from_base64(USER.key)?;\\n\\n\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let user = User::new(USER.username, USER.email);\\n\\n let etebase = Account::signup_key(client, &user, &main_key)?;\\n\\n\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 30,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn empty_content() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n {\\n\\n let col2 = col_mgr.fetch(col.uid(), None)?;\\n\\n verify_collection(&col2, &col_meta, col_content)?;\\n\\n }\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item 1\\\")).clone();\\n\\n let content = b\\\"\\\";\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 31,\n \"score\": 82385.72860755982\n },\n {\n \"content\": \"#[test]\\n\\nfn cache_collections_and_items() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item\\\")).clone();\\n\\n let content = b\\\"SomeItemContent\\\";\\n\\n let item = it_mgr.create(&meta, content)?;\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 32,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_collection_handling() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let content = b\\\"SomeContent\\\";\\n\\n\\n\\n let mut col = col_mgr.create(\\\"some.coltype\\\", &meta, content)?;\\n\\n assert_eq!(col.collection_type()?, \\\"some.coltype\\\");\\n\\n verify_collection(&col, &meta, content)?;\\n\\n\\n\\n let meta2 = meta.clone().set_name(Some(\\\"Collection meta2\\\")).clone();\\n\\n col.set_meta(&meta2)?;\\n\\n verify_collection(&col, &meta2, content)?;\\n\\n\\n\\n assert!(!col.is_deleted());\\n\\n col.delete()?;\\n\\n assert!(col.is_deleted());\\n\\n verify_collection(&col, &meta2, content)?;\\n\\n\\n\\n etebase.logout()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 33,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_collection_sync() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let content = b\\\"SomeContent\\\";\\n\\n\\n\\n let mut col = col_mgr.create(\\\"some.coltype\\\", &meta, content)?;\\n\\n verify_collection(&col, &meta, content)?;\\n\\n\\n\\n let collections = col_mgr.list(\\\"some.coltype\\\", None)?;\\n\\n assert_eq!(collections.data().len(), 0);\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let collections = col_mgr.list(\\\"some.coltype\\\", None)?;\\n\\n assert_eq!(collections.data().len(), 1);\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 34,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_item_handling() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item 1\\\")).clone();\\n\\n let content = b\\\"ItemContent\\\";\\n\\n let mut item = it_mgr.create(&meta, content)?;\\n\\n verify_item(&item, &meta, content)?;\\n\\n\\n\\n let meta2 = ItemMetadata::new().set_name(Some(\\\"Item 2\\\")).clone();\\n\\n item.set_meta(&meta2)?;\\n\\n verify_item(&item, &meta2, content)?;\\n\\n\\n\\n assert!(!item.is_deleted());\\n\\n item.delete()?;\\n\\n assert!(item.is_deleted());\\n\\n verify_item(&item, &meta2, content)?;\\n\\n\\n\\n etebase.logout()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 35,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn collection_and_item_deletion() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let mut col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item 1\\\")).clone();\\n\\n let content = b\\\"Content 1\\\";\\n\\n\\n\\n let mut item = it_mgr.create(&meta, content)?;\\n\\n\\n\\n it_mgr.batch(iter::once(&item), None)?;\\n\\n\\n\\n let items = it_mgr.list(None)?;\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 36,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_item_sync() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item 1\\\")).clone();\\n\\n let content = b\\\"Content 1\\\";\\n\\n\\n\\n let mut item = it_mgr.create(&meta, content)?;\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 37,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn collection_access_level() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let items: Vec<Item> = (0..5)\\n\\n .into_iter()\\n\\n .map(|i| {\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(&format!(\\\"Item {}\\\", i)))\\n\\n .clone();\\n\\n let content = b\\\"\\\";\\n\\n it_mgr.create(&meta, content).unwrap()\\n\\n })\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 38,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn item_batch_stoken() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item Orig\\\")).clone();\\n\\n let content = b\\\"\\\";\\n\\n let mut item = it_mgr.create(&meta, content)?;\\n\\n\\n\\n it_mgr.batch(iter::once(&item), None)?;\\n\\n\\n\\n let mut item2 = it_mgr.fetch(item.uid(), None)?;\\n\\n\\n\\n let items: Vec<Item> = (0..5)\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 39,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn session_save_and_restore() -> Result<()> {\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let etebase = init_test(&USER)?;\\n\\n\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n // Verify we can store and restore without an encryption key\\n\\n {\\n\\n let saved = etebase.save(None)?;\\n\\n let etebase2 = Account::restore(client.clone(), &saved, None)?;\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 40,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn chunk_preupload_and_download() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item\\\")).clone();\\n\\n let content = b\\\"SomeItemContent\\\";\\n\\n let item = it_mgr.create(&meta, content)?;\\n\\n assert!(!item.is_missing_content());\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 41,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore]\\n\\nfn login_and_password_change() -> Result<()> {\\n\\n // Reset both users\\n\\n let etebase = init_test(&USER)?;\\n\\n etebase.logout()?;\\n\\n let etebase2 = init_test(&USER2)?;\\n\\n etebase2.logout()?;\\n\\n\\n\\n let another_password = \\\"AnotherPassword\\\";\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let mut etebase2 = Account::login(client.clone(), USER2.username, USER2.password)?;\\n\\n\\n\\n let col_mgr2 = etebase2.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr2.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 42,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn item_fetch_updates() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n let meta = ItemMetadata::new().set_name(Some(\\\"Item Orig\\\")).clone();\\n\\n let content = b\\\"\\\";\\n\\n let item = it_mgr.create(&meta, content)?;\\n\\n\\n\\n it_mgr.batch(iter::once(&item), None)?;\\n\\n\\n\\n let items: Vec<Item> = (0..5)\\n\\n .into_iter()\\n\\n .map(|i| {\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 43,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn list_response_correctness() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new().set_name(Some(\\\"Collection\\\")).clone();\\n\\n let col_content = b\\\"\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n {\\n\\n let col2 = col_mgr.fetch(col.uid(), None)?;\\n\\n verify_collection(&col2, &col_meta, col_content)?;\\n\\n }\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let items: Vec<Item> = (0..5)\\n\\n .into_iter()\\n\\n .map(|i| {\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 44,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn chunking_large_data() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col_content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, col_content)?;\\n\\n\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n let it_mgr = col_mgr.item_manager(&col)?;\\n\\n\\n\\n let meta = ItemMetadata::new().clone();\\n\\n let content = randombytes_deterministic(120 * 1024, &[0; 32]); // 120kb of pseuedorandom data\\n\\n\\n\\n let mut item = it_mgr.create(&meta, &content)?;\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 45,\n \"score\": 79468.28479011814\n },\n {\n \"content\": \"#[test]\\n\\nfn login_and_password_change_with_key() -> Result<()> {\\n\\n // Reset user\\n\\n let etebase = init_test(&USER)?;\\n\\n\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col_meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &col_meta, b\\\"\\\")?;\\n\\n col_mgr.upload(&col, None)?;\\n\\n\\n\\n etebase.logout()?;\\n\\n\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let main_key = from_base64(USER.key)?;\\n\\n let etebase = Account::login_key(client, USER.username, &main_key)?;\\n\\n\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let col2 = col_mgr.fetch(col.uid(), None)?;\\n\\n verify_collection(&col2, &col_meta, b\\\"\\\")?;\\n\\n\\n\\n etebase.logout()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 46,\n \"score\": 76856.99630225747\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_cache_handling() -> Result<()> {\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let etebase = init_test_local(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let meta = ItemMetadata::new()\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.create(\\\"some.coltype\\\", &meta, content)?;\\n\\n\\n\\n let temp_dir = TempDir::new()?;\\n\\n let fs_cache = FileSystemCache::new(temp_dir.path(), USER.username)?;\\n\\n\\n\\n assert!(fs_cache.load_account(&client, None).is_err());\\n\\n fs_cache.save_account(&etebase, None)?;\\n\\n fs_cache.load_account(&client, None)?;\\n\\n\\n\",\n \"file_path\": \"tests/fs_cache.rs\",\n \"rank\": 47,\n \"score\": 76856.99630225747\n },\n {\n \"content\": \"#[derive(Serialize)]\\n\\nstruct LoginBody<'a> {\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n response: &'a [u8],\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n signature: &'a [u8],\\n\\n}\\n\\n\\n\\n#[derive(Serialize)]\\n\\npub struct LoginBodyResponse<'a> {\\n\\n pub username: &'a str,\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n pub challenge: &'a [u8],\\n\\n pub host: &'a str,\\n\\n pub action: &'a str,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct LoginResponseUser {\\n\\n pub username: String,\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 48,\n \"score\": 76357.292181752\n },\n {\n \"content\": \"#[test]\\n\\nfn loading_cache_without_collection_type() -> Result<()> {\\n\\n let etebase = init_test(&USER)?;\\n\\n let col_mgr = etebase.collection_manager()?;\\n\\n let meta = ItemMetadata::new()\\n\\n .set_item_type(Some(\\\"type\\\"))\\n\\n .set_name(Some(\\\"Collection\\\"))\\n\\n .set_description(Some(\\\"Mine\\\"))\\n\\n .set_color(Some(\\\"#aabbcc\\\"))\\n\\n .clone();\\n\\n let content = b\\\"SomeContent\\\";\\n\\n\\n\\n let col = col_mgr.cache_load(&etebase::utils::from_base64(\\\"kgHcBTvMlMyVzNkgTl9vMjNITDFsVlQ1VG5Dd1QzVkx0VDN5TUtBbDZ0UDYBzMDMlMy2QktLMk50R2NCY1pDRDBTcllKeHBzQczEUzXMyVxJSQptzPDMyMzNPMzhAVbMrsyjzPfMjU0pzODMq2lmzMAUEBLM_My-zOhGMsyREmHM6Mz3zO7MwVF8F2tnzOXM3TnM9MypzOQ9CczHfMzGCywPzOPMlsyTzOE-zIRAKczQJzVxRMz9NMz3MczbzMHM5zY_MDrMwsyRzJLM2StoaDhPTTFiQmR5bWZUTlZlanhwcWtPOExWLUpIUDFsUGRST2lCWXhnaEFnzMUEKMy4KGNOJ8z3zN1pzNFGzNLM_8yiCczpzLIxzJQSzNjM58yACS0sP8yCzKDM-GLM0MyCzJMPL8z-Hsz-QMzRT1BCRcyjWszRzLPMkxjMzFYmzMJ8IE1_zMMnCczyzIlUzIbMhxDM3XHMskHM9x9uaWhDzM3Myk1pzI7M78yWzOMrOFHMw04WzK7M-iXMm3tdzKAazMVpzOXMzczqR38KWMyPGEvMzkoyWmodzOvMwczSzLXMplkGzPIDzKvMxGEfQ8zjMcyIdAB4JczLcczfd8z5Vsz4ccyRdMzXzKU1zKcRzP_MycynzLhQzOUvJ8z3FMyHzOpMzLDMm8y6HAw1zKQgJl8CzNrM6XQFRsySFH7Mrn81zPPM4W0HzIPMh1PMpMyUzPNdzNsSzNE6ZQPM9cyGC04eDw7MrR9CaAnM73ZNzJYWOUzMr8zkzK_MxczAzKDMysz5zOt8LlN9zK3MynNizKDM0czXzNhBzNEdNhU8zNTMzTFIb8zmVszHzIfMiALMlkzM68zbzINAzNbMl8z8zMh_T8zHc8zJci7MtkDMl8ywcWIoe1zMuczCRFbMpcy3zJhvzK5PCz4EzMvMlszcAMyWzKIEAMzozPrMlh4JK8z3zMDM8XHMnWLMiMybAijMzczzzOtVaSPM-GbMvXrMksyyzK8_TQ7M9xzMw1PM-lvM68yrXHXM1y5AC0LM6iROcMzmzPzMlBHMtwrM50bMtlrMzX11zIvM4DM4zNIpDC1TEsybQkcuecynQMzCzK_M0sz-zOvMrhdNzJpuzKbM6j7Mjn7M6MzSYszrMzjM5szszIEJYWtfdVs7JVIvS0AQQcyBennMjMzgY8z6zORezOnM5CAZY8z3WWAKPcykT8yVzJDM4BjMz8zNzONtJglpzKRNQQHMxRPM7MymzPnMpy5RzNNIIsyfzKXM9hvMlUbMuczfzK8xzLTM08zlMcyczLLMlGzMrsyOAz7MvMzZzJjMwMyHHsygJMzczMnM1cybzLDMyszqDXrMmGZ3zJTM4nhqZhRhC8yTzMTMtHjM41UTIxvMtMyFzOZ-zIZyHszlzJM9WszhEUbM9VXMmxoNzKfMzUoKKUg9PjYOFMzgzO8jPQzM02TM8BcXzP7Mz8zUfkTMnVRJzIFCzK1ZH8yyzIrMvcy-zP5PzKJjFMygzKvM415LYszXQB_MnCfMzkJmbl_MnmDM42HM88zezOQibhHMuczczMfM2ixwzMvMpczDYRtWzLLM9cydIkjMrxDMj8yYzKkKzLtRzMM1zPbMyS5JYGnM08ylDmdUzL0ANMzgYSfM4jTMm8zvPE0dzL3Mw8zmzOxyzP3M93PM78z1NnoZVxfM7loNfMzxzPHM4j7MpB4NPD0rIczKzN4zKXnMww3M3czlADnMqczxeszuzMDMx8y_B8zyzPYTEjpZPD3M5cz6OALMxH3MgMznzPIXWkMZRzHMuHXMxMzrHEDM9szLaWYSWx4LdMz0zIjM5szMzN3M9syAzKUmWMzbf08QaEc9bMypzOA5bMzjzMQQzJNtVcyCzKJqNmLM0sy1NDMDRcyxzLrMyAzM8hPMv8y5zKoizOzMwEByGszRzIs4HcztNszTzP7M-syyzL_Ms8zFzK5EOk0mYwBGC8yTzO_MynPMrsyxzNMeHszvzI4uzKZ9FTvMzQM2zO0yzNNkzIrM58zfzP7My3rMnMz0zLt9zMgIW8z3zL0ucMy0zK5OZsypT8zOzJnMmMzgGA_M6xLMn8zXzOZ8UnogzL7MtcygzKfMtszUzLXMjUcwbAUQWyzMv8yfLczGcUrM68zdSFlVzJhFzP_M0m3MohzMsljMz8yQGMz-HnBgzJbM3syUzPo7zM3MjknMriHM7QF7YicvBkltX8zeLMyBG3vMq8zNzPPMzcymzIvM4czmEMzTEcyrzK7MtMzszJXMj8z3W8ywzI_MtjHM68yTzKNBEGjMt8y-dTxcbMzATnjMyMzqXHRHHMznzKrMqMy4zKgozLxZDGlZzN7Ml8yAzP99zMdzDwdYTsy2zKYczMcgzKlmasyQzPlDzLRJzMMVzOvM2k3MswbMpjnM53XM-sykzN8QY2YQzMPMjELMwAHMxEjMo8zfFw7MzQEBbcybzJ7M2czrzMTM9x3Mmsy1zILM42xqzIo-MQ_M5czXzLrMxcyozNhHzNsNzLFHzI1vzL3MoyTM3AlKFxzM0WZ0GjnMs8yXURjMm2xhQ8yONGfM28zVzKPMtMzlzIHM6VjM2BLMwA\\\")?)?;\\n\\n assert_eq!(col.collection_type()?, \\\"type\\\");\\n\\n verify_collection(&col, &meta, content)?;\\n\\n\\n\\n etebase.logout()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 49,\n \"score\": 74506.07397443125\n },\n {\n \"content\": \"#[derive(Serialize)]\\n\\nstruct ItemBatchBody<'a> {\\n\\n items: &'a Vec<&'a EncryptedItem>,\\n\\n deps: Option<Vec<ItemBatchBodyDep<'a>>>,\\n\\n}\\n\\n\\n\\npub struct ItemManagerOnline {\\n\\n api_base: Url,\\n\\n client: Arc<Client>,\\n\\n}\\n\\n\\n\\nimpl ItemManagerOnline {\\n\\n pub fn new(client: Arc<Client>, col: &EncryptedCollection) -> Self {\\n\\n Self {\\n\\n api_base: client\\n\\n .api_base\\n\\n .join(&format!(\\\"api/v1/collection/{}/item/\\\", col.uid()))\\n\\n .unwrap(),\\n\\n client,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 50,\n \"score\": 73371.87075067524\n },\n {\n \"content\": \"pub fn gen_uid_base64() -> StringBase64 {\\n\\n to_base64(&randombytes(24)).unwrap()\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct CachedContent {\\n\\n version: u8,\\n\\n data: Vec<u8>,\\n\\n}\\n\\n\\n\\npub struct AccountCryptoManager(pub CryptoManager);\\n\\n\\n\\nimpl AccountCryptoManager {\\n\\n const COLTYPE_PAD_SIZE: usize = 32;\\n\\n\\n\\n pub fn new(key: &[u8; 32], version: u8) -> Result<Self> {\\n\\n let context = b\\\"Acct \\\";\\n\\n\\n\\n Ok(Self {\\n\\n 0: CryptoManager::new(key, &context, version)?,\\n\",\n \"file_path\": \"src/encrypted_models.rs\",\n \"rank\": 51,\n \"score\": 72896.41923895209\n },\n {\n \"content\": \"#[derive(Serialize)]\\n\\nstruct ItemBatchBodyDep<'a> {\\n\\n uid: &'a str,\\n\\n #[serde(skip_serializing_if = \\\"std::option::Option::is_none\\\")]\\n\\n etag: Option<String>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 52,\n \"score\": 70699.7381914202\n },\n {\n \"content\": \"/// Return the recommended padding length for a buffer of specific length\\n\\n///\\n\\n/// Padding data before encrypting it is important for preventing fingerprint analysis attacks.\\n\\n/// This function aims to return the optimal balance between space efficiently and fingerprint\\n\\n/// resistance. The returned values may change between versions.\\n\\n///\\n\\n/// # Arguments:\\n\\n/// * `length` - the length of the buffer to pad\\n\\npub fn get_padding(length: u32) -> u32 {\\n\\n // Use the padme padding scheme for efficiently\\n\\n // https://www.petsymposium.org/2019/files/papers/issue4/popets-2019-0056.pdf\\n\\n\\n\\n // We want a minimum pad size of 4k\\n\\n if length < (1 << 14) {\\n\\n let size = (1 << 10) - 1;\\n\\n // We add 1 so we always have some padding\\n\\n return (length | size) + 1;\\n\\n }\\n\\n\\n\\n let e = (length as f64).log2().floor();\\n\\n let s = (e.log2().floor() as u32) + 1;\\n\\n let last_bits = (e as u32) - s;\\n\\n let bit_mask = (1 << last_bits) - 1;\\n\\n\\n\\n (length + bit_mask) & !bit_mask\\n\\n}\\n\\n\\n\\n// FIXME: we should properly pad the meta and probably change these functions\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 53,\n \"score\": 70358.08216729706\n },\n {\n \"content\": \"fn user_reset(user: &TestUser) -> Result<()> {\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let acct_user = etebase::User::new(user.username, user.email);\\n\\n // sign-up the account if necessary, ignoring errors as we're about to reset it anyway\\n\\n let _ = Account::signup_key(\\n\\n client.clone(),\\n\\n &acct_user,\\n\\n b\\\"xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\\\",\\n\\n );\\n\\n let body_struct = etebase::test_helpers::SignupBody {\\n\\n user: &acct_user,\\n\\n salt: &from_base64(user.salt)?,\\n\\n pubkey: &from_base64(user.pubkey)?,\\n\\n login_pubkey: &from_base64(user.loginPubkey)?,\\n\\n encrypted_content: &from_base64(user.encryptedContent)?,\\n\\n };\\n\\n test_reset(&client, body_struct)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 54,\n \"score\": 69469.89955373919\n },\n {\n \"content\": \"fn init_test(user: &TestUser) -> Result<Account> {\\n\\n etebase::init()?;\\n\\n user_reset(&user)?;\\n\\n\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let session_key = from_base64(sessionStorageKey)?;\\n\\n\\n\\n let mut ret = Account::restore(client, user.storedSession, Some(&session_key))?;\\n\\n ret.force_server_url(&test_url())?;\\n\\n ret.fetch_token()?;\\n\\n\\n\\n Ok(ret)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/service.rs\",\n \"rank\": 55,\n \"score\": 65414.57216721926\n },\n {\n \"content\": \"fn init_test_local(user: &TestUser) -> Result<Account> {\\n\\n etebase::init()?;\\n\\n\\n\\n let client = Client::new(CLIENT_NAME, &test_url())?;\\n\\n let session_key = from_base64(sessionStorageKey)?;\\n\\n\\n\\n let ret = Account::restore(client, user.storedSession, Some(&session_key))?;\\n\\n\\n\\n Ok(ret)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/fs_cache.rs\",\n \"rank\": 56,\n \"score\": 61712.90481966741\n },\n {\n \"content\": \"struct StorageCryptoManager(CryptoManager);\\n\\n\\n\\nimpl StorageCryptoManager {\\n\\n pub fn new(key: &[u8; 32], version: u8) -> Result<Self> {\\n\\n let context = b\\\"Stor \\\";\\n\\n\\n\\n Ok(Self {\\n\\n 0: CryptoManager::new(key, &context, version)?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Serialize)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct AccountData<'a> {\\n\\n pub version: u8,\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n pub key: &'a [u8],\\n\\n pub user: LoginResponseUser,\\n\\n pub server_url: &'a str,\\n\",\n \"file_path\": \"src/service.rs\",\n \"rank\": 57,\n \"score\": 46561.43546854775\n },\n {\n \"content\": \"struct MainCryptoManager(CryptoManager);\\n\\n\\n\\nimpl MainCryptoManager {\\n\\n pub fn new(key: &[u8; 32], version: u8) -> Result<MainCryptoManager> {\\n\\n let context = b\\\"Main \\\";\\n\\n\\n\\n Ok(MainCryptoManager {\\n\\n 0: CryptoManager::new(key, &context, version)?,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn login_crypto_manager(&self) -> Result<LoginCryptoManager> {\\n\\n LoginCryptoManager::keygen(&self.0.asym_key_seed)\\n\\n }\\n\\n\\n\\n pub fn account_crypto_manager(&self, key: &[u8; 32]) -> Result<AccountCryptoManager> {\\n\\n AccountCryptoManager::new(key, self.0.version)\\n\\n }\\n\\n\\n\\n pub fn identity_crypto_manager(&self, privkey: &[u8; 32]) -> Result<BoxCryptoManager> {\\n\\n BoxCryptoManager::from_privkey(privkey)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/service.rs\",\n \"rank\": 58,\n \"score\": 46561.43546854775\n },\n {\n \"content\": \"#[test]\\n\\nfn padding() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n // Because of how we use padding (unpadding) we need to make sure padding is always larger than the content\\n\\n // Otherwise we risk the unpadder to fail thinking it should unpad when it shouldn't.\\n\\n\\n\\n for i in 1..(1 << 14) {\\n\\n if get_padding(i) <= i {\\n\\n println!(\\\"Yo\\\");\\n\\n assert_eq!(format!(\\\"Failed for {}\\\", i), \\\"\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n assert_eq!(get_padding(2343242), 2359296);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/utils.rs\",\n \"rank\": 59,\n \"score\": 42750.18358371115\n },\n {\n \"content\": \"#[test]\\n\\nfn pretty_fingerprint() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let pubkey = from_base64(USER.pubkey).unwrap();\\n\\n\\n\\n let fingerprint = crypto::pretty_fingerprint(&pubkey);\\n\\n assert_eq!(fingerprint, \\\"45680 71497 88570 93128\\\\n19189 84243 25687 20837\\\\n47924 46071 54113 18789\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 60,\n \"score\": 40901.53090662994\n },\n {\n \"content\": \"#[test]\\n\\nfn derive_key() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let derived = crypto::derive_key(&from_base64(USER.salt).unwrap(), USER.password).unwrap();\\n\\n let expected = from_base64(USER.key).unwrap();\\n\\n assert_eq!(&derived[..], &expected[..]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 61,\n \"score\": 40901.53090662994\n },\n {\n \"content\": \"#[test]\\n\\nfn crypto_mac() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let key = from_base64(USER.key).unwrap();\\n\\n\\n\\n let mut crypto_mac = crypto::CryptoMac::new(None).unwrap();\\n\\n crypto_mac.update(&[0; 4]).unwrap();\\n\\n crypto_mac.update_with_len_prefix(&[0; 8]).unwrap();\\n\\n assert_eq!(\\n\\n crypto_mac.finalize().unwrap(),\\n\\n from_base64(\\\"P-Hpzo86RG6Ps4R1gGXmQrzmdJC2OotqqreKmB8G45A\\\").unwrap()\\n\\n );\\n\\n\\n\\n let mut crypto_mac = crypto::CryptoMac::new(Some(&key)).unwrap();\\n\\n crypto_mac.update(&[0; 4]).unwrap();\\n\\n crypto_mac.update_with_len_prefix(&[0; 8]).unwrap();\\n\\n assert_eq!(\\n\\n crypto_mac.finalize().unwrap(),\\n\\n from_base64(\\\"rgL6d_XDiBfbzevFdtktc61XB5-PkS1uQ1cj5DgfFc8\\\").unwrap()\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 62,\n \"score\": 40901.53090662994\n },\n {\n \"content\": \"#[test]\\n\\nfn pad_unpad() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let buf = [0; 1076];\\n\\n let padded = test_buffer_pad(&buf).unwrap();\\n\\n let unpadded = test_buffer_unpad(&padded[..]).unwrap();\\n\\n assert_eq!(unpadded, &buf[..]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/utils.rs\",\n \"rank\": 63,\n \"score\": 40901.53090662994\n },\n {\n \"content\": \"#[test]\\n\\nfn crypto_manager() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let key = from_base64(USER.key).unwrap();\\n\\n let context = b\\\"Col \\\";\\n\\n let crypto_manager = crypto::CryptoManager::new(\\n\\n &key[0..32].try_into().unwrap(),\\n\\n context,\\n\\n etebase::CURRENT_VERSION,\\n\\n )\\n\\n .unwrap();\\n\\n let subkey = crypto_manager.derive_subkey(&[0; 32]).unwrap();\\n\\n\\n\\n assert_eq!(\\n\\n subkey,\\n\\n from_base64(\\\"4w-VCSTETv26JjVlVlD2VaACcb6aQSD2JbF-e89xnaA\\\").unwrap()\\n\\n );\\n\\n\\n\\n let hash = crypto_manager.calculate_mac(&[0; 32]).unwrap();\\n\\n assert_eq!(\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 64,\n \"score\": 40901.53090662994\n },\n {\n \"content\": \"#[test]\\n\\nfn login_crypto_manager() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let login_crypto_manager = crypto::LoginCryptoManager::keygen(&[0; 32]).unwrap();\\n\\n\\n\\n let msg = b\\\"This Is Some Test Cleartext.\\\";\\n\\n let signature = login_crypto_manager.sign_detached(msg).unwrap();\\n\\n let pubkey = login_crypto_manager.pubkey();\\n\\n assert!(login_crypto_manager\\n\\n .verify_detached(msg, &signature, (&pubkey[..]).try_into().unwrap())\\n\\n .unwrap());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 65,\n \"score\": 39269.619839012295\n },\n {\n \"content\": \"#[test]\\n\\nfn box_crypto_manager() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let box_crypto_manager = crypto::BoxCryptoManager::keygen(None).unwrap();\\n\\n let box_crypto_manager2 = crypto::BoxCryptoManager::keygen(None).unwrap();\\n\\n\\n\\n let msg = b\\\"This Is Some Test Cleartext.\\\";\\n\\n let cipher = box_crypto_manager\\n\\n .encrypt(msg, (&box_crypto_manager2.pubkey()[..]).try_into().unwrap())\\n\\n .unwrap();\\n\\n let decrypted = box_crypto_manager2\\n\\n .decrypt(\\n\\n &cipher[..],\\n\\n (&box_crypto_manager.pubkey()[..]).try_into().unwrap(),\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(decrypted, msg);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/crypto.rs\",\n \"rank\": 66,\n \"score\": 39269.619839012295\n },\n {\n \"content\": \"#[test]\\n\\nfn pad_unpad_fixed() {\\n\\n etebase::init().unwrap();\\n\\n\\n\\n let blocksize = 32;\\n\\n for i in 0..(blocksize * 2) {\\n\\n let buf = vec![60; i];\\n\\n let padded = test_buffer_pad_fixed(&buf, blocksize).unwrap();\\n\\n let unpadded = test_buffer_unpad_fixed(&padded[..], blocksize).unwrap();\\n\\n assert_eq!(unpadded, &buf[..]);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/utils.rs\",\n \"rank\": 67,\n \"score\": 39269.619839012295\n },\n {\n \"content\": \"fn print_item(item: &Item) {\\n\\n println!(\\\"UID: {}\\\", &item.uid());\\n\\n println!(\\\"Meta: {:?}\\\", &item.meta().unwrap());\\n\\n println!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/etebase_test.rs\",\n \"rank\": 68,\n \"score\": 34099.27685259732\n },\n {\n \"content\": \"fn print_collection(collection: &Collection) {\\n\\n println!(\\\"UID: {}\\\", &collection.uid());\\n\\n println!(\\\"Meta: {:?}\\\", &collection.meta().unwrap());\\n\\n println!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/etebase_test.rs\",\n \"rank\": 69,\n \"score\": 34099.27685259732\n },\n {\n \"content\": \"// SPDX-FileCopyrightText: © 2020 Etebase Authors\\n\\n// SPDX-License-Identifier: LGPL-2.1-only\\n\\n\\n\\nuse std::error;\\n\\nuse std::fmt;\\n\\n\\n\\n/// A short-hand version of a [std::result::Result] that always returns an Etebase [Error].\\n\\npub type Result<T> = std::result::Result<T, Error>;\\n\\n\\n\\n/// The error type returned from the Etebase API\\n\\n#[derive(Debug, Clone)]\\n\\npub enum Error {\\n\\n /// A generic error\\n\\n Generic(String),\\n\\n /// An error with parsing the a URL (e.g. from the server URL)\\n\\n UrlParse(String),\\n\\n /// An error related to msgpack serialization and de-serialization\\n\\n MsgPack(String),\\n\\n /// A programming error that indicates the developers are using the API wrong\\n\\n ProgrammingError(&'static str),\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 70,\n \"score\": 32698.48264797126\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl From<String> for Error {\\n\\n fn from(err: String) -> Error {\\n\\n Error::Generic(err)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<url::ParseError> for Error {\\n\\n fn from(err: url::ParseError) -> Error {\\n\\n Error::UrlParse(err.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<std::ffi::NulError> for Error {\\n\\n fn from(err: std::ffi::NulError) -> Error {\\n\\n Error::Generic(err.to_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 71,\n \"score\": 32697.110363503303\n },\n {\n \"content\": \"\\n\\nimpl From<std::io::Error> for Error {\\n\\n fn from(err: std::io::Error) -> Error {\\n\\n Error::UrlParse(err.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<rmp_serde::encode::Error> for Error {\\n\\n fn from(err: rmp_serde::encode::Error) -> Error {\\n\\n Error::MsgPack(err.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<rmp_serde::decode::Error> for Error {\\n\\n fn from(err: rmp_serde::decode::Error) -> Error {\\n\\n Error::MsgPack(err.to_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 72,\n \"score\": 32695.03787342224\n },\n {\n \"content\": \" Error::Unauthorized(s) => s.fmt(f),\\n\\n Error::Conflict(s) => s.fmt(f),\\n\\n\\n\\n Error::Connection(s) => s.fmt(f),\\n\\n Error::TemporaryServerError(s) => s.fmt(f),\\n\\n Error::ServerError(s) => s.fmt(f),\\n\\n Error::Http(s) => s.fmt(f),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Error> for String {\\n\\n fn from(err: Error) -> String {\\n\\n err.to_string()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl error::Error for Error {\\n\\n fn source(&self) -> Option<&(dyn error::Error + 'static)> {\\n\\n None\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 73,\n \"score\": 32693.836661848658\n },\n {\n \"content\": \" TemporaryServerError(String),\\n\\n /// There was a server error when processing the request (usually a bug in the server)\\n\\n ServerError(String),\\n\\n /// A generic error with the server request\\n\\n Http(String),\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Error {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n Error::Generic(s) => s.fmt(f),\\n\\n Error::UrlParse(s) => s.fmt(f),\\n\\n Error::MsgPack(s) => s.fmt(f),\\n\\n Error::ProgrammingError(s) => s.fmt(f),\\n\\n Error::MissingContent(s) => s.fmt(f),\\n\\n Error::Padding(s) => s.fmt(f),\\n\\n Error::Base64(s) => s.fmt(f),\\n\\n Error::Encryption(s) => s.fmt(f),\\n\\n Error::PermissionDenied(s) => s.fmt(f),\\n\\n Error::NotFound(s) => s.fmt(f),\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 74,\n \"score\": 32689.927211697766\n },\n {\n \"content\": \" /// An attempt to fetch the content of an item that doesn't have the content yet\\n\\n MissingContent(&'static str),\\n\\n /// An issue with the padding of the encrypted content\\n\\n Padding(&'static str),\\n\\n /// An issue with the Base64 decoding\\n\\n Base64(&'static str),\\n\\n /// An issue with the encryption\\n\\n Encryption(&'static str),\\n\\n /// An authorization issue from the server\\n\\n Unauthorized(String),\\n\\n /// A conflict issue returned from the server, e.g. if a transaction failed\\n\\n Conflict(String),\\n\\n /// The operation was not allowed due to permissions\\n\\n PermissionDenied(String),\\n\\n /// The requested resource was not found\\n\\n NotFound(String),\\n\\n\\n\\n /// There was an issue with the connection (e.g. DNS lookup)\\n\\n Connection(String),\\n\\n /// There was an temporary server error (e.g. maintenance, or gateway issues)\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 75,\n \"score\": 32684.842462875647\n },\n {\n \"content\": \"\\n\\n let ret: LoginResponse = rmp_serde::from_read_ref(&res)?;\\n\\n\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n pub fn logout(&self) -> Result<()> {\\n\\n let url = self.api_base.join(\\\"logout/\\\")?;\\n\\n let res = self.client.post(url.as_str(), vec![])?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn change_password(&self, response: &[u8], signature: &[u8]) -> Result<()> {\\n\\n let body_struct = LoginBody {\\n\\n response,\\n\\n signature,\\n\\n };\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 83,\n \"score\": 30.69590863125075\n },\n {\n \"content\": \" let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n let res = res.bytes();\\n\\n\\n\\n let ret: LoginResponse = rmp_serde::from_read_ref(&res)?;\\n\\n\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n pub fn login(&self, response: &[u8], signature: &[u8]) -> Result<LoginResponse> {\\n\\n let body_struct = LoginBody {\\n\\n response,\\n\\n signature,\\n\\n };\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n\\n\\n let url = self.api_base.join(\\\"login/\\\")?;\\n\\n let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n let res = res.bytes();\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 84,\n \"score\": 30.583609840142223\n },\n {\n \"content\": \" let status = resp.status().as_u16();\\n\\n let ret = Response::new(resp.bytes()?.to_vec(), status);\\n\\n Ok(ret)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ClientImplementation for Client {\\n\\n fn get(&self, url: &str, auth_token: Option<&str>) -> Response {\\n\\n match self.get_inner(url, auth_token) {\\n\\n Ok(resp) => resp,\\n\\n Err(err) => Response::new_err(err),\\n\\n }\\n\\n }\\n\\n\\n\\n fn post(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response {\\n\\n match self.post_inner(url, auth_token, body) {\\n\\n Ok(resp) => resp,\\n\\n Err(err) => Response::new_err(err),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/http_client/reqwest_client.rs\",\n \"rank\": 85,\n \"score\": 29.076393294815784\n },\n {\n \"content\": \" let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n\\n\\n let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn reject(&self, invitation: &SignedInvitation) -> Result<()> {\\n\\n let url = self\\n\\n .api_base\\n\\n .join(&format!(\\\"incoming/{}/\\\", invitation.uid()))?;\\n\\n\\n\\n let res = self.client.delete(url.as_str())?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn fetch_user_profile(&self, username: &str) -> Result<UserProfile> {\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 86,\n \"score\": 28.200641053908722\n },\n {\n \"content\": \" Ok(true)\\n\\n }\\n\\n\\n\\n pub fn get_login_challenge(&self, username: &str) -> Result<LoginChallange> {\\n\\n #[derive(Serialize)]\\n\\n struct Body<'a> {\\n\\n username: &'a str,\\n\\n }\\n\\n\\n\\n let body_struct = Body { username };\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n\\n\\n let url = self.api_base.join(\\\"login_challenge/\\\")?;\\n\\n let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n let res = res.bytes();\\n\\n\\n\\n let ret: LoginChallange = rmp_serde::from_read_ref(&res)?;\\n\\n\\n\\n Ok(ret)\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 87,\n \"score\": 27.75268946409738\n },\n {\n \"content\": \" /// Return the server url associated with this client\\n\\n pub fn server_url(&self) -> &Url {\\n\\n &self.api_base\\n\\n }\\n\\n\\n\\n pub(crate) fn get(&self, url: &str) -> Result<Response> {\\n\\n self.imp.get(url, self.auth_token.as_deref()).into_result()\\n\\n }\\n\\n\\n\\n pub(crate) fn post(&self, url: &str, body: Vec<u8>) -> Result<Response> {\\n\\n self.imp\\n\\n .post(url, self.auth_token.as_deref(), body)\\n\\n .into_result()\\n\\n }\\n\\n\\n\\n pub(crate) fn put(&self, url: &str, body: Vec<u8>) -> Result<Response> {\\n\\n self.imp\\n\\n .put(url, self.auth_token.as_deref(), body)\\n\\n .into_result()\\n\\n }\\n\",\n \"file_path\": \"src/http_client/mod.rs\",\n \"rank\": 88,\n \"score\": 27.72710096294723\n },\n {\n \"content\": \" let res = self.client.post(url.as_str(), vec![])?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn modify_access_level(\\n\\n &self,\\n\\n username: &str,\\n\\n access_level: CollectionAccessLevel,\\n\\n ) -> Result<()> {\\n\\n let url = self.api_base.join(&format!(\\\"{}/\\\", username))?;\\n\\n\\n\\n #[derive(Serialize)]\\n\\n #[serde(rename_all = \\\"camelCase\\\")]\\n\\n struct Body {\\n\\n access_level: CollectionAccessLevel,\\n\\n }\\n\\n\\n\\n let body_struct = Body { access_level };\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n\\n\\n let res = self.client.patch(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 89,\n \"score\": 26.910647017869177\n },\n {\n \"content\": \" let req = self.prep_client(self.req_client.get(url), auth_token);\\n\\n let resp = req.send()?;\\n\\n let status = resp.status().as_u16();\\n\\n let ret = Response::new(resp.bytes()?.to_vec(), status);\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n fn post_inner(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Result<Response> {\\n\\n let req = self\\n\\n .prep_client(self.req_client.post(url), auth_token)\\n\\n .body(body);\\n\\n let resp = req.send()?;\\n\\n let status = resp.status().as_u16();\\n\\n let ret = Response::new(resp.bytes()?.to_vec(), status);\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n fn put_inner(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Result<Response> {\\n\\n let req = self\\n\\n .prep_client(self.req_client.put(url), auth_token)\\n\",\n \"file_path\": \"src/http_client/reqwest_client.rs\",\n \"rank\": 90,\n \"score\": 26.899589473168387\n },\n {\n \"content\": \" .body(body);\\n\\n let resp = req.send()?;\\n\\n let status = resp.status().as_u16();\\n\\n let ret = Response::new(resp.bytes()?.to_vec(), status);\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n fn patch_inner(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Result<Response> {\\n\\n let req = self\\n\\n .prep_client(self.req_client.patch(url), auth_token)\\n\\n .body(body);\\n\\n let resp = req.send()?;\\n\\n let status = resp.status().as_u16();\\n\\n let ret = Response::new(resp.bytes()?.to_vec(), status);\\n\\n Ok(ret)\\n\\n }\\n\\n\\n\\n fn delete_inner(&self, url: &str, auth_token: Option<&str>) -> Result<Response> {\\n\\n let req = self.prep_client(self.req_client.delete(url), auth_token);\\n\\n let resp = req.send()?;\\n\",\n \"file_path\": \"src/http_client/reqwest_client.rs\",\n \"rank\": 91,\n \"score\": 26.504021757327692\n },\n {\n \"content\": \"\\n\\n fn put(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response {\\n\\n match self.put_inner(url, auth_token, body) {\\n\\n Ok(resp) => resp,\\n\\n Err(err) => Response::new_err(err),\\n\\n }\\n\\n }\\n\\n\\n\\n fn patch(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response {\\n\\n match self.patch_inner(url, auth_token, body) {\\n\\n Ok(resp) => resp,\\n\\n Err(err) => Response::new_err(err),\\n\\n }\\n\\n }\\n\\n\\n\\n fn delete(&self, url: &str, auth_token: Option<&str>) -> Response {\\n\\n match self.delete_inner(url, auth_token) {\\n\\n Ok(resp) => resp,\\n\\n Err(err) => Response::new_err(err),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/http_client/reqwest_client.rs\",\n \"rank\": 92,\n \"score\": 25.367002161038926\n },\n {\n \"content\": \"\\n\\n pub(crate) fn patch(&self, url: &str, body: Vec<u8>) -> Result<Response> {\\n\\n self.imp\\n\\n .patch(url, self.auth_token.as_deref(), body)\\n\\n .into_result()\\n\\n }\\n\\n\\n\\n pub(crate) fn delete(&self, url: &str) -> Result<Response> {\\n\\n self.imp\\n\\n .delete(url, self.auth_token.as_deref())\\n\\n .into_result()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/http_client/mod.rs\",\n \"rank\": 93,\n \"score\": 24.61915181284955\n },\n {\n \"content\": \"\\n\\n let url = self.api_base.join(\\\"change_password/\\\")?;\\n\\n let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn fetch_dashboard_url(&self) -> Result<String> {\\n\\n #[derive(Deserialize)]\\n\\n struct Ret {\\n\\n pub url: String,\\n\\n }\\n\\n\\n\\n let url = self.api_base.join(\\\"dashboard_url/\\\")?;\\n\\n let res = self.client.post(url.as_str(), vec![])?;\\n\\n res.error_for_status()?;\\n\\n let res = res.bytes();\\n\\n\\n\\n let ret: Ret = rmp_serde::from_read_ref(&res)?;\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 94,\n \"score\": 24.386466754972155\n },\n {\n \"content\": \" let body_struct = Body { collection_types };\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n\\n\\n let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n let res = res.bytes();\\n\\n\\n\\n let serialized: CollectionListResponse<EncryptedCollection> =\\n\\n rmp_serde::from_read_ref(&res)?;\\n\\n serialized.data.iter().for_each(|x| x.mark_saved());\\n\\n\\n\\n Ok(serialized)\\n\\n }\\n\\n\\n\\n pub fn create(\\n\\n &self,\\n\\n collection: &EncryptedCollection,\\n\\n options: Option<&FetchOptions>,\\n\\n ) -> Result<()> {\\n\\n let url = apply_fetch_options(self.api_base.clone(), options);\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 95,\n \"score\": 24.2003767112605\n },\n {\n \"content\": \" ///\\n\\n /// The client object manages the connection to the Etebase server\\n\\n ///\\n\\n /// # Arguments:\\n\\n /// * `client_name` - a string identifier for the client\\n\\n /// * `server_url` - the Etebase server URL\\n\\n #[cfg(feature = \\\"networking\\\")]\\n\\n pub fn new(client_name: &str, server_url: &str) -> Result<Self> {\\n\\n let imp = ReqwestImpl::new(client_name)?;\\n\\n Ok(Self {\\n\\n api_base: Self::normalize_url(server_url)?,\\n\\n auth_token: None,\\n\\n imp: Arc::new(imp),\\n\\n })\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"networking\\\"))]\\n\\n pub fn new_with_impl(server_url: &str, imp: Box<dyn ClientImplementation>) -> Result<Self> {\\n\\n Ok(Self {\\n\\n api_base: Self::normalize_url(server_url)?,\\n\",\n \"file_path\": \"src/http_client/mod.rs\",\n \"rank\": 96,\n \"score\": 24.02885789781851\n },\n {\n \"content\": \" let body_struct = ItemBatchBody {\\n\\n items: &items,\\n\\n deps,\\n\\n };\\n\\n let body = rmp_serde::to_vec_named(&body_struct)?;\\n\\n\\n\\n let res = self.client.post(url.as_str(), body)?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n for item in items {\\n\\n item.mark_saved();\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn transaction<'a, I, J>(\\n\\n &self,\\n\\n items: I,\\n\\n deps: J,\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 97,\n \"score\": 23.507630687105387\n },\n {\n \"content\": \" options: Option<&FetchOptions>,\\n\\n ) -> Result<Vec<u8>> {\\n\\n let url = apply_fetch_options(\\n\\n self.api_base\\n\\n .join(&format!(\\\"{}/chunk/{}/download/\\\", item_uid, chunk_uid))?,\\n\\n options,\\n\\n );\\n\\n let res = self.client.get(url.as_str())?;\\n\\n res.error_for_status()?;\\n\\n\\n\\n Ok(res.bytes().to_vec())\\n\\n }\\n\\n}\\n\\n\\n\\n/// A member of a collection\\n\\n///\\n\\n/// Obtained using [CollectionManager::list](crate::managers::CollectionManager::list)\\n\\n#[derive(Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct CollectionMember {\\n\",\n \"file_path\": \"src/online_managers.rs\",\n \"rank\": 98,\n \"score\": 22.387845661363055\n },\n {\n \"content\": \" /// Unlike [Self::login], this uses a strong key instead of a password\\n\\n ///\\n\\n /// # Arguments:\\n\\n /// * `username` - the user's username. This is not the same as the user's email.\\n\\n /// * `client` - the already setup [Client] object\\n\\n /// * `main_key` - the key to signup with\\n\\n pub fn login_key(client: Client, username: &str, main_key: &[u8]) -> Result<Self> {\\n\\n super::init()?;\\n\\n\\n\\n if main_key.len() < SYMMETRIC_KEY_SIZE {\\n\\n return Err(Error::ProgrammingError(\\n\\n \\\"Key should be at least 32 bytes long.\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n let authenticator = Authenticator::new(&client);\\n\\n let login_challenge = match authenticator.get_login_challenge(username) {\\n\\n Err(Error::Unauthorized(s)) => {\\n\\n // FIXME: fragile, we should have a proper error value or actually use codes\\n\\n if s == \\\"User not properly init\\\" {\\n\",\n \"file_path\": \"src/service.rs\",\n \"rank\": 99,\n \"score\": 22.30806762221205\n }\n]","isConversational":false}}},{"rowIdx":1194,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/http.rs"},"repo_name":{"kind":"string","value":"mdheller/monolith"},"commit":{"kind":"string","value":"625c529cf1409848aa3ce42a74991d0d69c75d88"},"file_code":{"kind":"string","value":"use regex::Regex;\nuse reqwest::header::{CONTENT_TYPE, USER_AGENT};\nuse reqwest::{Client, RedirectPolicy};\nuse std::time::Duration;\nuse url::{ParseError, Url};\nuse utils::data_to_dataurl;\n\nlazy_static! {\n static ref REGEX_URL: Regex = Regex::new(r\"^https?://\").unwrap();\n}\n\npub fn is_data_url(url: &str) -> Result<bool, String> {\n match Url::parse(url) {\n Ok(parsed_url) => Ok(parsed_url.scheme() == \"data\"),\n Err(err) => Err(format!(\"{}\", err)),\n }\n}\n\npub fn is_valid_url(path: &str) -> bool {\n REGEX_URL.is_match(path)\n}\n\npub fn resolve_url(from: &str, to: &str) -> Result<String, ParseError> {\n let result = if is_valid_url(to) {\n \n to.to_string()\n } else {\n Url::parse(from)?.join(to)?.to_string()\n };\n\n Ok(result)\n}\n\npub fn retrieve_asset(\n url: &str,\n as_dataurl: bool,\n as_mime: &str,\n opt_user_agent: &str,\n) -> Result<String, reqwest::Error> {\n if is_data_url(&url).unwrap() {\n Ok(url.to_string())\n } else {\n let client = Client::builder()\n .redirect(RedirectPolicy::limited(3))\n .timeout(Duration::from_secs(10))\n .build()\n .unwrap();\n let mut response = client\n .get(url)\n .header(USER_AGENT, opt_user_agent)\n .send()\n .unwrap();\n\n if as_dataurl {\n \n let mut data: Vec<u8> = vec![];\n response.copy_to(&mut data)?;\n\n \n let mimetype = if as_mime == \"\" {\n response\n .headers()\n .get(CONTENT_TYPE)\n .and_then(|header| header.to_str().ok())\n .unwrap_or(&as_mime)\n } else {\n as_mime\n };\n\n Ok(data_to_dataurl(&mimetype, &data))\n } else {\n Ok(response.text().unwrap())\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_is_url() {\n assert!(is_valid_url(\"https://www.rust-lang.org/\"));\n assert!(is_valid_url(\"http://kernel.org\"));\n assert!(!is_valid_url(\"./index.html\"));\n assert!(!is_valid_url(\"some-local-page.htm\"));\n assert!(!is_valid_url(\"ftp://1.2.3.4/www/index.html\"));\n assert!(!is_valid_url(\n \"data:text/html;base64,V2VsY29tZSBUbyBUaGUgUGFydHksIDxiPlBhbDwvYj4h\"\n ));\n }\n\n #[test]\n fn test_resolve_url() -> Result<(), ParseError> {\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"../category/signatures.html\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/category/signatures.html\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"category/signatures.html\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/category/signatures.html\"\n );\n\n let resolved_url = resolve_url(\n \"saved_page.htm\",\n \"https://www.kernel.org/category/signatures.html\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/category/signatures.html\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"//www.kernel.org/theme/images/logos/tux.png\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/theme/images/logos/tux.png\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"//another-host.org/theme/images/logos/tux.png\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://another-host.org/theme/images/logos/tux.png\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org/category/signatures.html\",\n \"/theme/images/logos/tux.png\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/theme/images/logos/tux.png\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.w3schools.com/html/html_iframe.asp\",\n \"default.asp\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.w3schools.com/html/default.asp\"\n );\n\n Ok(())\n }\n\n #[test]\n fn test_is_data_url() {\n assert!(\n is_data_url(\"data:text/html;base64,V2VsY29tZSBUbyBUaGUgUGFydHksIDxiPlBhbDwvYj4h\")\n .unwrap_or(false)\n );\n assert!(!is_data_url(\"https://kernel.org\").unwrap_or(false));\n assert!(!is_data_url(\"//kernel.org\").unwrap_or(false));\n }\n}\n"},"prefix":{"kind":"string","value":"use regex::Regex;\nuse reqwest::header::{CONTENT_TYPE, USER_AGENT};\nuse reqwest::{Client, RedirectPolicy};\nuse std::time::Duration;\nuse url::{ParseError, Url};\nuse utils::data_to_dataurl;\n\nlazy_static! {\n static ref REGEX_URL: Regex = Regex::new(r\"^https?://\").unwrap();\n}\n\npub fn is_data_url(url: &str) -> Result<bool, String> {\n match Url::parse(url) {\n Ok(parsed_url) => Ok(parsed_url.scheme() == \"data\"),\n Err(err) => Err(format!(\"{}\", err)),\n }\n}\n\npub fn is_valid_url(path: &str) -> bool {\n REGEX_URL.is_match(path)\n}\n\npub fn resolve_url(from: &str, to: &str) -> Result<String, ParseError> {\n let result = if is_valid_url(to) {\n \n to.to_string()\n } else {\n Url::parse(from)?.join(to)?.to_string()\n };\n\n Ok(result)\n}\n\npub fn retrieve_asset(\n url: &str,\n as_dataurl: bool,\n as_mime: &str,\n opt_user_agent: &str,\n) -> Result<String, reqwest::Error> {\n if is_data_url(&url).unwrap() {\n Ok(url.to_string())\n } else {\n let client = Client::builder()\n .redirect(RedirectPolicy::limited(3))\n .timeout(Duration::from_secs(10))\n .build()\n .unwrap();\n let mut response = client\n .get(url)\n .header(USER_AGENT, opt_user_agent)\n .send()\n .unwrap();\n\n if as_dataurl {\n \n let mut data: Vec<u8> = vec![];\n response.copy_to(&mut data)?;\n\n \n let mimetype = if as_mime == \"\" {\n response\n .headers()\n .get(CONTENT_TYPE)\n .and_then(|header| header.to_str().ok())\n .unwrap_or(&as_mime)\n } else {\n as_mime\n };\n\n Ok(data_to_dataurl(&mimetype, &data))\n } else {\n Ok(response.text().unwrap())\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_is_url() {\n assert!(is_valid_url(\"https://www.rust-lang.org/\"));\n assert!(is_valid_url(\"http://kernel.org\"));\n assert!(!is_valid_url(\"./index.html\"));\n assert!(!is_valid_url(\"some-local-page.htm\"));\n assert!(!is_valid_url(\"ftp://1.2.3.4/www/index.html\"));\n assert!(!is_valid_url(\n \"data:text/html;base64,V2VsY29tZSBUbyBUaGUgUGFydHksIDxiPlBhbDwvYj4h\"\n ));\n }\n\n #[test]\n fn test_resolve_url() -> Result<(), ParseError> {\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"../category/signatures.html\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/category/signatures.html\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"category/signatures.html\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/category/signatures.html\"\n );\n\n let resolved_url = resolve_url(\n \"saved_page.htm\",\n \"https://www.kernel.org/category/signatures.html\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/category/signatures.html\"\n );\n\n "},"suffix":{"kind":"string","value":"\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/theme/images/logos/tux.png\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"//another-host.org/theme/images/logos/tux.png\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://another-host.org/theme/images/logos/tux.png\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.kernel.org/category/signatures.html\",\n \"/theme/images/logos/tux.png\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.kernel.org/theme/images/logos/tux.png\"\n );\n\n let resolved_url = resolve_url(\n \"https://www.w3schools.com/html/html_iframe.asp\",\n \"default.asp\",\n )?;\n assert_eq!(\n resolved_url.as_str(),\n \"https://www.w3schools.com/html/default.asp\"\n );\n\n Ok(())\n }\n\n #[test]\n fn test_is_data_url() {\n assert!(\n is_data_url(\"data:text/html;base64,V2VsY29tZSBUbyBUaGUgUGFydHksIDxiPlBhbDwvYj4h\")\n .unwrap_or(false)\n );\n assert!(!is_data_url(\"https://kernel.org\").unwrap_or(false));\n assert!(!is_data_url(\"//kernel.org\").unwrap_or(false));\n }\n}\n"},"middle":{"kind":"string","value":"let resolved_url = resolve_url(\n \"https://www.kernel.org\",\n \"//www.kernel.org/theme/images/logos/tux.png\",\n )?;"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"pub fn data_to_dataurl(mime: &str, data: &[u8]) -> String {\n\n let mimetype = if mime == \"\" {\n\n detect_mimetype(data)\n\n } else {\n\n mime.to_string()\n\n };\n\n format!(\"data:{};base64,{}\", mimetype, encode(data))\n\n}\n\n\n","file_path":"src/utils.rs","rank":2,"score":117320.25826834035},{"content":"fn detect_mimetype(data: &[u8]) -> String {\n\n let mut re = String::new();\n\n\n\n for item in MAGIC.iter() {\n\n if data.starts_with(item[0]) {\n\n re = String::from_utf8(item[1].to_vec()).unwrap();\n\n break;\n\n }\n\n }\n\n\n\n re\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_data_to_dataurl() {\n\n let mime = \"application/javascript\";\n","file_path":"src/utils.rs","rank":4,"score":94466.96544421851},{"content":"pub fn html_to_dom(data: &str) -> html5ever::rcdom::RcDom {\n\n parse_document(RcDom::default(), Default::default())\n\n .from_utf8()\n\n .read_from(&mut data.as_bytes())\n\n .unwrap()\n\n}\n\n\n","file_path":"src/html.rs","rank":5,"score":84954.00394761766},{"content":"fn is_icon(attr_value: &str) -> bool {\n\n attr_value == \"icon\"\n\n || attr_value == \"shortcut icon\"\n\n || attr_value == \"mask-icon\"\n\n || attr_value == \"apple-touch-icon\"\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_is_icon() {\n\n assert_eq!(is_icon(\"icon\"), true);\n\n assert_eq!(is_icon(\"stylesheet\"), false);\n\n }\n\n}\n","file_path":"src/html.rs","rank":6,"score":76326.94195056424},{"content":"pub fn walk_and_embed_assets(\n\n url: &str,\n\n node: &Handle,\n\n opt_no_js: bool,\n\n opt_no_images: bool,\n\n opt_user_agent: &str,\n\n) {\n\n match node.data {\n\n NodeData::Document => {\n\n // Dig deeper\n\n for child in node.children.borrow().iter() {\n\n walk_and_embed_assets(\n\n &url, child,\n\n opt_no_js,\n\n opt_no_images,\n\n opt_user_agent,\n\n );\n\n }\n\n }\n\n\n","file_path":"src/html.rs","rank":8,"score":49817.74889738714},{"content":"pub fn print_dom(handle: &Handle) {\n\n serialize(&mut io::stdout(), handle, SerializeOpts::default()).unwrap();\n\n}\n\n\n","file_path":"src/html.rs","rank":9,"score":45968.12204553149},{"content":"fn main() {\n\n let command = App::new(\"monolith\")\n\n .version(crate_version!())\n\n .author(crate_authors!(\"\\n\"))\n\n .about(crate_description!())\n\n .arg(\n\n Arg::with_name(\"url\")\n\n .required(true)\n\n .takes_value(true)\n\n .index(1)\n\n .help(\"URL to download\"),\n\n )\n\n .args_from_usage(\"-j, --no-js 'Excludes JavaScript'\")\n\n .args_from_usage(\"-i, --no-images 'Removes images'\")\n\n .args_from_usage(\"-u, --user-agent=[Iceweasel] 'Custom User-Agent string'\")\n\n .get_matches();\n\n\n\n // Process the command\n\n let arg_target = command.value_of(\"url\").unwrap();\n\n let opt_no_js = command.is_present(\"no-js\");\n","file_path":"src/main.rs","rank":10,"score":25896.37476531885},{"content":"enum NodeMatch {\n\n Icon,\n\n Image,\n\n StyleSheet,\n\n Anchor,\n\n Script,\n\n Form,\n\n IFrame,\n\n Other,\n\n}\n\n\n\nconst TRANSPARENT_PIXEL: &str = \"data:image/png;base64,\\\n\niVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mNkYAAAAAYAAjCB0C8AAAAASUVORK5CYII=\";\n\n\n\nconst JS_DOM_EVENT_ATTRS: [&str; 21] = [\n\n // Input\n\n \"onfocus\",\n\n \"onblur\",\n\n \"onselect\",\n\n \"onchange\",\n","file_path":"src/html.rs","rank":11,"score":19497.251260816553},{"content":"#[macro_use]\n\nextern crate lazy_static;\n\nextern crate html5ever;\n\nextern crate regex;\n\nextern crate reqwest;\n\nextern crate url;\n\n\n\npub mod html;\n\npub mod http;\n\npub mod utils;\n","file_path":"src/lib.rs","rank":14,"score":11.144748735820778},{"content":" attr.value.clear();\n\n attr.value.push_slice(href_full_url.unwrap().as_str());\n\n }\n\n }\n\n }\n\n NodeMatch::IFrame => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"src\" {\n\n let src_full_url = resolve_url(&url, &attr.value.to_string()).unwrap();\n\n let iframe_data = retrieve_asset(\n\n &src_full_url,\n\n false,\n\n \"text/html\",\n\n opt_user_agent,\n\n );\n\n let dom = html_to_dom(&iframe_data.unwrap());\n\n walk_and_embed_assets(\n\n &src_full_url,\n\n &dom.document,\n\n opt_no_js,\n","file_path":"src/html.rs","rank":15,"score":9.82606280621344},{"content":"\n\n match found {\n\n NodeMatch::Icon => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"href\" {\n\n let href_full_url = resolve_url(&url, &attr.value.to_string());\n\n let favicon_datauri = retrieve_asset(\n\n &href_full_url.unwrap(),\n\n true,\n\n \"\",\n\n opt_user_agent,\n\n );\n\n attr.value.clear();\n\n attr.value.push_slice(favicon_datauri.unwrap().as_str());\n\n }\n\n }\n\n }\n\n NodeMatch::Image => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"src\" {\n","file_path":"src/html.rs","rank":16,"score":9.299705652419327},{"content":" &src_full_url.unwrap(),\n\n true,\n\n \"application/javascript\",\n\n opt_user_agent,\n\n );\n\n attr.value.clear();\n\n attr.value.push_slice(js_datauri.unwrap().as_str());\n\n }\n\n }\n\n }\n\n }\n\n NodeMatch::Form => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"action\" {\n\n // Do not touch action props which are set to a URL\n\n if is_valid_url(&attr.value) {\n\n continue;\n\n }\n\n\n\n let href_full_url = resolve_url(&url, &attr.value.to_string());\n","file_path":"src/html.rs","rank":17,"score":8.574032713642858},{"content":" if opt_no_images {\n\n attr.value.clear();\n\n attr.value.push_slice(TRANSPARENT_PIXEL);\n\n } else {\n\n let src_full_url = resolve_url(&url, &attr.value.to_string());\n\n let img_datauri = retrieve_asset(\n\n &src_full_url.unwrap(),\n\n true,\n\n \"\",\n\n opt_user_agent,\n\n );\n\n attr.value.clear();\n\n attr.value.push_slice(img_datauri.unwrap().as_str());\n\n }\n\n }\n\n }\n\n }\n\n NodeMatch::Anchor => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"href\" {\n","file_path":"src/html.rs","rank":20,"score":8.216938145506797},{"content":" opt_no_images,\n\n opt_user_agent,\n\n );\n\n let mut buf: Vec<u8> = Vec::new();\n\n serialize(&mut buf, &dom.document, SerializeOpts::default()).unwrap();\n\n let iframe_datauri = data_to_dataurl(\"text/html\", &buf);\n\n attr.value.clear();\n\n attr.value.push_slice(iframe_datauri.as_str());\n\n }\n\n }\n\n }\n\n NodeMatch::Other => {}\n\n }\n\n\n\n if opt_no_js {\n\n // Get rid of JS event attributes\n\n for attr in attrs_mut.iter_mut() {\n\n if JS_DOM_EVENT_ATTRS.contains(&attr.name.local.to_lowercase().as_str()) {\n\n attr.value.clear();\n\n }\n","file_path":"src/html.rs","rank":21,"score":8.191712624100267},{"content":" // Don't touch email links or hrefs which begin with a hash sign\n\n if attr.value.starts_with('#') || attr.value.starts_with(\"mailto:\") {\n\n continue;\n\n }\n\n\n\n let href_full_url = resolve_url(&url, &attr.value.to_string());\n\n attr.value.clear();\n\n attr.value.push_slice(href_full_url.unwrap().as_str());\n\n }\n\n }\n\n }\n\n NodeMatch::StyleSheet => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"href\" {\n\n let href_full_url = resolve_url(&url, &attr.value.to_string());\n\n let css_datauri = retrieve_asset(\n\n &href_full_url.unwrap(),\n\n true,\n\n \"text/css\",\n\n opt_user_agent,\n","file_path":"src/html.rs","rank":22,"score":8.117074001211437},{"content":" );\n\n attr.value.clear();\n\n attr.value.push_slice(css_datauri.unwrap().as_str());\n\n }\n\n }\n\n }\n\n NodeMatch::Script => {\n\n if opt_no_js {\n\n // Get rid of src and inner content of SCRIPT tags\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"src\" {\n\n attr.value.clear();\n\n }\n\n }\n\n node.children.borrow_mut().clear();\n\n } else {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"src\" {\n\n let src_full_url = resolve_url(&url, &attr.value.to_string());\n\n let js_datauri = retrieve_asset(\n","file_path":"src/html.rs","rank":23,"score":7.794746785675814},{"content":" NodeData::Doctype { .. } => {}\n\n\n\n NodeData::Text { .. } => {}\n\n\n\n NodeData::Comment { .. } => {\n\n // Note: in case of opt_no_js being set to true, there's no need to worry about\n\n // getting rid of comments that may contain scripts, e.g. <!--[if IE]><script>...\n\n // since that's not part of W3C standard and therefore gets ignored\n\n // by browsers other than IE [5, 9]\n\n }\n\n\n\n NodeData::Element {\n\n ref name,\n\n ref attrs,\n\n ..\n\n } => {\n\n let attrs_mut = &mut attrs.borrow_mut();\n\n let mut found = NodeMatch::Other;\n\n\n\n match name.local.as_ref() {\n","file_path":"src/html.rs","rank":24,"score":7.758136805005591},{"content":"#[macro_use]\n\nextern crate clap;\n\nextern crate monolith;\n\n\n\nuse clap::{App, Arg};\n\nuse monolith::html::{html_to_dom, print_dom, walk_and_embed_assets};\n\nuse monolith::http::{is_valid_url, retrieve_asset};\n\n\n\nstatic DEFAULT_USER_AGENT: &str =\n\n \"Mozilla/5.0 (Macintosh; Intel Mac OS X 10.14; rv:66.0) Gecko/20100101 Firefox/66.0\";\n\n\n","file_path":"src/main.rs","rank":26,"score":5.890883376889726},{"content":"use http::{is_valid_url, resolve_url, retrieve_asset};\n\nuse std::default::Default;\n\nuse std::io;\n\nuse utils::data_to_dataurl;\n\n\n\nuse html5ever::parse_document;\n\nuse html5ever::rcdom::{Handle, NodeData, RcDom};\n\nuse html5ever::serialize::{serialize, SerializeOpts};\n\nuse html5ever::tendril::TendrilSink;\n\n\n","file_path":"src/html.rs","rank":27,"score":5.796734695517056},{"content":" \"link\" => {\n\n for attr in attrs_mut.iter_mut() {\n\n if &attr.name.local == \"rel\" {\n\n if is_icon(&attr.value.to_string()) {\n\n found = NodeMatch::Icon;\n\n break;\n\n } else if attr.value.to_string() == \"stylesheet\" {\n\n found = NodeMatch::StyleSheet;\n\n break;\n\n }\n\n }\n\n }\n\n }\n\n \"img\" => { found = NodeMatch::Image; }\n\n \"a\" => { found = NodeMatch::Anchor; }\n\n \"script\" => { found = NodeMatch::Script; }\n\n \"form\" => { found = NodeMatch::Form; }\n\n \"iframe\" => { found = NodeMatch::IFrame; }\n\n _ => {}\n\n }\n","file_path":"src/html.rs","rank":28,"score":5.77202462202498},{"content":" let data = \"var word = 'hello';\\nalert(word);\\n\";\n\n let datauri = data_to_dataurl(mime, data.as_bytes());\n\n assert_eq!(\n\n &datauri,\n\n \"data:application/javascript;base64,dmFyIHdvcmQgPSAnaGVsbG8nOwphbGVydCh3b3JkKTsK\"\n\n );\n\n }\n\n\n\n #[test]\n\n fn test_detect_mimetype() {\n\n // Image\n\n assert_eq!(detect_mimetype(b\"GIF87a\"), \"image/gif\");\n\n assert_eq!(detect_mimetype(b\"GIF89a\"), \"image/gif\");\n\n assert_eq!(detect_mimetype(b\"\\xFF\\xD8\\xFF\"), \"image/jpeg\");\n\n assert_eq!(detect_mimetype(b\"\\x89PNG\\x0D\\x0A\\x1A\\x0A\"), \"image/png\");\n\n assert_eq!(detect_mimetype(b\"<?xml \"), \"image/svg+xml\");\n\n assert_eq!(detect_mimetype(b\"<svg \"), \"image/svg+xml\");\n\n assert_eq!(detect_mimetype(b\"RIFF....WEBPVP8 \"), \"image/webp\");\n\n assert_eq!(detect_mimetype(b\"\\x00\\x00\\x01\\x00\"), \"image/x-icon\");\n\n // Audio\n","file_path":"src/utils.rs","rank":29,"score":5.313723918935047},{"content":" let opt_no_images = command.is_present(\"no-images\");\n\n let opt_user_agent = command.value_of(\"user-agent\").unwrap_or(DEFAULT_USER_AGENT);\n\n\n\n if is_valid_url(arg_target) {\n\n let data = retrieve_asset(&arg_target, false, \"\", opt_user_agent).unwrap();\n\n let dom = html_to_dom(&data);\n\n\n\n walk_and_embed_assets(\n\n &arg_target,\n\n &dom.document,\n\n opt_no_js,\n\n opt_no_images,\n\n opt_user_agent,\n\n );\n\n\n\n print_dom(&dom.document);\n\n println!(); // Ensure newline at end of output\n\n }\n\n}\n","file_path":"src/main.rs","rank":30,"score":4.084997371713607},{"content":" }\n\n }\n\n\n\n // Dig deeper\n\n for child in node.children.borrow().iter() {\n\n walk_and_embed_assets(\n\n &url,\n\n child,\n\n opt_no_js,\n\n opt_no_images,\n\n opt_user_agent,\n\n );\n\n }\n\n }\n\n\n\n NodeData::ProcessingInstruction { .. } => unreachable!(),\n\n }\n\n}\n\n\n","file_path":"src/html.rs","rank":33,"score":2.764249087327243},{"content":" assert_eq!(detect_mimetype(b\"ID3\"), \"audio/mpeg\");\n\n assert_eq!(detect_mimetype(b\"\\xFF\\x0E\"), \"audio/mpeg\");\n\n assert_eq!(detect_mimetype(b\"\\xFF\\x0F\"), \"audio/mpeg\");\n\n assert_eq!(detect_mimetype(b\"OggS\"), \"audio/ogg\");\n\n assert_eq!(detect_mimetype(b\"RIFF....WAVEfmt \"), \"audio/wav\");\n\n assert_eq!(detect_mimetype(b\"fLaC\"), \"audio/x-flac\");\n\n // Video\n\n assert_eq!(detect_mimetype(b\"RIFF....AVI LIST\"), \"video/avi\");\n\n assert_eq!(detect_mimetype(b\"....ftyp\"), \"video/mp4\");\n\n assert_eq!(detect_mimetype(b\"\\x00\\x00\\x01\\x0B\"), \"video/mpeg\");\n\n assert_eq!(detect_mimetype(b\"....moov\"), \"video/quicktime\");\n\n assert_eq!(detect_mimetype(b\"\\x1A\\x45\\xDF\\xA3\"), \"video/webm\");\n\n }\n\n}\n","file_path":"src/utils.rs","rank":34,"score":2.6147526071836937},{"content":"extern crate base64;\n\n\n\nuse self::base64::encode;\n\n\n\nstatic MAGIC: [[&[u8]; 2]; 19] = [\n\n // Image\n\n [b\"GIF87a\", b\"image/gif\"],\n\n [b\"GIF89a\", b\"image/gif\"],\n\n [b\"\\xFF\\xD8\\xFF\", b\"image/jpeg\"],\n\n [b\"\\x89PNG\\x0D\\x0A\\x1A\\x0A\", b\"image/png\"],\n\n [b\"<?xml \", b\"image/svg+xml\"],\n\n [b\"<svg \", b\"image/svg+xml\"],\n\n [b\"RIFF....WEBPVP8 \", b\"image/webp\"],\n\n [b\"\\x00\\x00\\x01\\x00\", b\"image/x-icon\"],\n\n // Audio\n\n [b\"ID3\", b\"audio/mpeg\"],\n\n [b\"\\xFF\\x0E\", b\"audio/mpeg\"],\n\n [b\"\\xFF\\x0F\", b\"audio/mpeg\"],\n\n [b\"OggS\", b\"audio/ogg\"],\n\n [b\"RIFF....WAVEfmt \", b\"audio/wav\"],\n\n [b\"fLaC\", b\"audio/x-flac\"],\n\n // Video\n\n [b\"RIFF....AVI LIST\", b\"video/avi\"],\n\n [b\"....ftyp\", b\"video/mp4\"],\n\n [b\"\\x00\\x00\\x01\\x0B\", b\"video/mpeg\"],\n\n [b\"....moov\", b\"video/quicktime\"],\n\n [b\"\\x1A\\x45\\xDF\\xA3\", b\"video/webm\"],\n\n];\n\n\n","file_path":"src/utils.rs","rank":35,"score":1.7035908438910878},{"content":"# monolith\n\n\n\nA data hoarder's dream come true: bundle any web page into a single HTML file. \n\nYou can finally replace that gazillion of open tabs with a gazillion of .html files stored somewhere on your precious little drive.\n\n\n\nUnlike conventional \"Save page as…\", `monolith` not only saves the target document,\n\nit embeds CSS, image, and JavaScript assets **all at once**, producing a single HTML5 document that is a joy to store and share.\n\n\n\nIf compared to saving websites with `wget -mpk`, `monolith` embeds all assets as data URLs and therefore displays the saved page exactly the same, being completely separated from the Internet.\n\n\n\n<!-- `This program works both on remote and local targets. -->\n\n\n\n### Installation\n\n $ git clone https://github.com/Y2Z/monolith.git\n\n $ cd monolith\n\n $ cargo install --path .\n\n\n\n### Usage\n\n $ monolith https://lyrics.github.io/db/p/portishead/dummy/roads/ > portishead-roads-lyrics.html\n\n\n\n### Options\n\n - `-i`: Remove images\n\n - `-j`: Exclude JavaScript\n\n - `-u`: Specify custom User-Agent\n\n\n\n### License\n\nThe Unlicense\n\n\n\n<!-- Microtext -->\n\n<sub>Keep in mind that `monolith` is not aware of your browser's session</sub>\n","file_path":"README.md","rank":36,"score":1.070330139623277}],"string":"[\n {\n \"content\": \"pub fn data_to_dataurl(mime: &str, data: &[u8]) -> String {\\n\\n let mimetype = if mime == \\\"\\\" {\\n\\n detect_mimetype(data)\\n\\n } else {\\n\\n mime.to_string()\\n\\n };\\n\\n format!(\\\"data:{};base64,{}\\\", mimetype, encode(data))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 2,\n \"score\": 117320.25826834035\n },\n {\n \"content\": \"fn detect_mimetype(data: &[u8]) -> String {\\n\\n let mut re = String::new();\\n\\n\\n\\n for item in MAGIC.iter() {\\n\\n if data.starts_with(item[0]) {\\n\\n re = String::from_utf8(item[1].to_vec()).unwrap();\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n re\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_data_to_dataurl() {\\n\\n let mime = \\\"application/javascript\\\";\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 4,\n \"score\": 94466.96544421851\n },\n {\n \"content\": \"pub fn html_to_dom(data: &str) -> html5ever::rcdom::RcDom {\\n\\n parse_document(RcDom::default(), Default::default())\\n\\n .from_utf8()\\n\\n .read_from(&mut data.as_bytes())\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 5,\n \"score\": 84954.00394761766\n },\n {\n \"content\": \"fn is_icon(attr_value: &str) -> bool {\\n\\n attr_value == \\\"icon\\\"\\n\\n || attr_value == \\\"shortcut icon\\\"\\n\\n || attr_value == \\\"mask-icon\\\"\\n\\n || attr_value == \\\"apple-touch-icon\\\"\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_is_icon() {\\n\\n assert_eq!(is_icon(\\\"icon\\\"), true);\\n\\n assert_eq!(is_icon(\\\"stylesheet\\\"), false);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 6,\n \"score\": 76326.94195056424\n },\n {\n \"content\": \"pub fn walk_and_embed_assets(\\n\\n url: &str,\\n\\n node: &Handle,\\n\\n opt_no_js: bool,\\n\\n opt_no_images: bool,\\n\\n opt_user_agent: &str,\\n\\n) {\\n\\n match node.data {\\n\\n NodeData::Document => {\\n\\n // Dig deeper\\n\\n for child in node.children.borrow().iter() {\\n\\n walk_and_embed_assets(\\n\\n &url, child,\\n\\n opt_no_js,\\n\\n opt_no_images,\\n\\n opt_user_agent,\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 8,\n \"score\": 49817.74889738714\n },\n {\n \"content\": \"pub fn print_dom(handle: &Handle) {\\n\\n serialize(&mut io::stdout(), handle, SerializeOpts::default()).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 9,\n \"score\": 45968.12204553149\n },\n {\n \"content\": \"fn main() {\\n\\n let command = App::new(\\\"monolith\\\")\\n\\n .version(crate_version!())\\n\\n .author(crate_authors!(\\\"\\\\n\\\"))\\n\\n .about(crate_description!())\\n\\n .arg(\\n\\n Arg::with_name(\\\"url\\\")\\n\\n .required(true)\\n\\n .takes_value(true)\\n\\n .index(1)\\n\\n .help(\\\"URL to download\\\"),\\n\\n )\\n\\n .args_from_usage(\\\"-j, --no-js 'Excludes JavaScript'\\\")\\n\\n .args_from_usage(\\\"-i, --no-images 'Removes images'\\\")\\n\\n .args_from_usage(\\\"-u, --user-agent=[Iceweasel] 'Custom User-Agent string'\\\")\\n\\n .get_matches();\\n\\n\\n\\n // Process the command\\n\\n let arg_target = command.value_of(\\\"url\\\").unwrap();\\n\\n let opt_no_js = command.is_present(\\\"no-js\\\");\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 10,\n \"score\": 25896.37476531885\n },\n {\n \"content\": \"enum NodeMatch {\\n\\n Icon,\\n\\n Image,\\n\\n StyleSheet,\\n\\n Anchor,\\n\\n Script,\\n\\n Form,\\n\\n IFrame,\\n\\n Other,\\n\\n}\\n\\n\\n\\nconst TRANSPARENT_PIXEL: &str = \\\"data:image/png;base64,\\\\\\n\\niVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mNkYAAAAAYAAjCB0C8AAAAASUVORK5CYII=\\\";\\n\\n\\n\\nconst JS_DOM_EVENT_ATTRS: [&str; 21] = [\\n\\n // Input\\n\\n \\\"onfocus\\\",\\n\\n \\\"onblur\\\",\\n\\n \\\"onselect\\\",\\n\\n \\\"onchange\\\",\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 11,\n \"score\": 19497.251260816553\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate lazy_static;\\n\\nextern crate html5ever;\\n\\nextern crate regex;\\n\\nextern crate reqwest;\\n\\nextern crate url;\\n\\n\\n\\npub mod html;\\n\\npub mod http;\\n\\npub mod utils;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 14,\n \"score\": 11.144748735820778\n },\n {\n \"content\": \" attr.value.clear();\\n\\n attr.value.push_slice(href_full_url.unwrap().as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::IFrame => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"src\\\" {\\n\\n let src_full_url = resolve_url(&url, &attr.value.to_string()).unwrap();\\n\\n let iframe_data = retrieve_asset(\\n\\n &src_full_url,\\n\\n false,\\n\\n \\\"text/html\\\",\\n\\n opt_user_agent,\\n\\n );\\n\\n let dom = html_to_dom(&iframe_data.unwrap());\\n\\n walk_and_embed_assets(\\n\\n &src_full_url,\\n\\n &dom.document,\\n\\n opt_no_js,\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 15,\n \"score\": 9.82606280621344\n },\n {\n \"content\": \"\\n\\n match found {\\n\\n NodeMatch::Icon => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"href\\\" {\\n\\n let href_full_url = resolve_url(&url, &attr.value.to_string());\\n\\n let favicon_datauri = retrieve_asset(\\n\\n &href_full_url.unwrap(),\\n\\n true,\\n\\n \\\"\\\",\\n\\n opt_user_agent,\\n\\n );\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(favicon_datauri.unwrap().as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::Image => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"src\\\" {\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 16,\n \"score\": 9.299705652419327\n },\n {\n \"content\": \" &src_full_url.unwrap(),\\n\\n true,\\n\\n \\\"application/javascript\\\",\\n\\n opt_user_agent,\\n\\n );\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(js_datauri.unwrap().as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::Form => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"action\\\" {\\n\\n // Do not touch action props which are set to a URL\\n\\n if is_valid_url(&attr.value) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n let href_full_url = resolve_url(&url, &attr.value.to_string());\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 17,\n \"score\": 8.574032713642858\n },\n {\n \"content\": \" if opt_no_images {\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(TRANSPARENT_PIXEL);\\n\\n } else {\\n\\n let src_full_url = resolve_url(&url, &attr.value.to_string());\\n\\n let img_datauri = retrieve_asset(\\n\\n &src_full_url.unwrap(),\\n\\n true,\\n\\n \\\"\\\",\\n\\n opt_user_agent,\\n\\n );\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(img_datauri.unwrap().as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::Anchor => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"href\\\" {\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 20,\n \"score\": 8.216938145506797\n },\n {\n \"content\": \" opt_no_images,\\n\\n opt_user_agent,\\n\\n );\\n\\n let mut buf: Vec<u8> = Vec::new();\\n\\n serialize(&mut buf, &dom.document, SerializeOpts::default()).unwrap();\\n\\n let iframe_datauri = data_to_dataurl(\\\"text/html\\\", &buf);\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(iframe_datauri.as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::Other => {}\\n\\n }\\n\\n\\n\\n if opt_no_js {\\n\\n // Get rid of JS event attributes\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if JS_DOM_EVENT_ATTRS.contains(&attr.name.local.to_lowercase().as_str()) {\\n\\n attr.value.clear();\\n\\n }\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 21,\n \"score\": 8.191712624100267\n },\n {\n \"content\": \" // Don't touch email links or hrefs which begin with a hash sign\\n\\n if attr.value.starts_with('#') || attr.value.starts_with(\\\"mailto:\\\") {\\n\\n continue;\\n\\n }\\n\\n\\n\\n let href_full_url = resolve_url(&url, &attr.value.to_string());\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(href_full_url.unwrap().as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::StyleSheet => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"href\\\" {\\n\\n let href_full_url = resolve_url(&url, &attr.value.to_string());\\n\\n let css_datauri = retrieve_asset(\\n\\n &href_full_url.unwrap(),\\n\\n true,\\n\\n \\\"text/css\\\",\\n\\n opt_user_agent,\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 22,\n \"score\": 8.117074001211437\n },\n {\n \"content\": \" );\\n\\n attr.value.clear();\\n\\n attr.value.push_slice(css_datauri.unwrap().as_str());\\n\\n }\\n\\n }\\n\\n }\\n\\n NodeMatch::Script => {\\n\\n if opt_no_js {\\n\\n // Get rid of src and inner content of SCRIPT tags\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"src\\\" {\\n\\n attr.value.clear();\\n\\n }\\n\\n }\\n\\n node.children.borrow_mut().clear();\\n\\n } else {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"src\\\" {\\n\\n let src_full_url = resolve_url(&url, &attr.value.to_string());\\n\\n let js_datauri = retrieve_asset(\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 23,\n \"score\": 7.794746785675814\n },\n {\n \"content\": \" NodeData::Doctype { .. } => {}\\n\\n\\n\\n NodeData::Text { .. } => {}\\n\\n\\n\\n NodeData::Comment { .. } => {\\n\\n // Note: in case of opt_no_js being set to true, there's no need to worry about\\n\\n // getting rid of comments that may contain scripts, e.g. <!--[if IE]><script>...\\n\\n // since that's not part of W3C standard and therefore gets ignored\\n\\n // by browsers other than IE [5, 9]\\n\\n }\\n\\n\\n\\n NodeData::Element {\\n\\n ref name,\\n\\n ref attrs,\\n\\n ..\\n\\n } => {\\n\\n let attrs_mut = &mut attrs.borrow_mut();\\n\\n let mut found = NodeMatch::Other;\\n\\n\\n\\n match name.local.as_ref() {\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 24,\n \"score\": 7.758136805005591\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate clap;\\n\\nextern crate monolith;\\n\\n\\n\\nuse clap::{App, Arg};\\n\\nuse monolith::html::{html_to_dom, print_dom, walk_and_embed_assets};\\n\\nuse monolith::http::{is_valid_url, retrieve_asset};\\n\\n\\n\\nstatic DEFAULT_USER_AGENT: &str =\\n\\n \\\"Mozilla/5.0 (Macintosh; Intel Mac OS X 10.14; rv:66.0) Gecko/20100101 Firefox/66.0\\\";\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 26,\n \"score\": 5.890883376889726\n },\n {\n \"content\": \"use http::{is_valid_url, resolve_url, retrieve_asset};\\n\\nuse std::default::Default;\\n\\nuse std::io;\\n\\nuse utils::data_to_dataurl;\\n\\n\\n\\nuse html5ever::parse_document;\\n\\nuse html5ever::rcdom::{Handle, NodeData, RcDom};\\n\\nuse html5ever::serialize::{serialize, SerializeOpts};\\n\\nuse html5ever::tendril::TendrilSink;\\n\\n\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 27,\n \"score\": 5.796734695517056\n },\n {\n \"content\": \" \\\"link\\\" => {\\n\\n for attr in attrs_mut.iter_mut() {\\n\\n if &attr.name.local == \\\"rel\\\" {\\n\\n if is_icon(&attr.value.to_string()) {\\n\\n found = NodeMatch::Icon;\\n\\n break;\\n\\n } else if attr.value.to_string() == \\\"stylesheet\\\" {\\n\\n found = NodeMatch::StyleSheet;\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n \\\"img\\\" => { found = NodeMatch::Image; }\\n\\n \\\"a\\\" => { found = NodeMatch::Anchor; }\\n\\n \\\"script\\\" => { found = NodeMatch::Script; }\\n\\n \\\"form\\\" => { found = NodeMatch::Form; }\\n\\n \\\"iframe\\\" => { found = NodeMatch::IFrame; }\\n\\n _ => {}\\n\\n }\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 28,\n \"score\": 5.77202462202498\n },\n {\n \"content\": \" let data = \\\"var word = 'hello';\\\\nalert(word);\\\\n\\\";\\n\\n let datauri = data_to_dataurl(mime, data.as_bytes());\\n\\n assert_eq!(\\n\\n &datauri,\\n\\n \\\"data:application/javascript;base64,dmFyIHdvcmQgPSAnaGVsbG8nOwphbGVydCh3b3JkKTsK\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_detect_mimetype() {\\n\\n // Image\\n\\n assert_eq!(detect_mimetype(b\\\"GIF87a\\\"), \\\"image/gif\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"GIF89a\\\"), \\\"image/gif\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\xFF\\\\xD8\\\\xFF\\\"), \\\"image/jpeg\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\x89PNG\\\\x0D\\\\x0A\\\\x1A\\\\x0A\\\"), \\\"image/png\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"<?xml \\\"), \\\"image/svg+xml\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"<svg \\\"), \\\"image/svg+xml\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"RIFF....WEBPVP8 \\\"), \\\"image/webp\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\x00\\\\x00\\\\x01\\\\x00\\\"), \\\"image/x-icon\\\");\\n\\n // Audio\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 29,\n \"score\": 5.313723918935047\n },\n {\n \"content\": \" let opt_no_images = command.is_present(\\\"no-images\\\");\\n\\n let opt_user_agent = command.value_of(\\\"user-agent\\\").unwrap_or(DEFAULT_USER_AGENT);\\n\\n\\n\\n if is_valid_url(arg_target) {\\n\\n let data = retrieve_asset(&arg_target, false, \\\"\\\", opt_user_agent).unwrap();\\n\\n let dom = html_to_dom(&data);\\n\\n\\n\\n walk_and_embed_assets(\\n\\n &arg_target,\\n\\n &dom.document,\\n\\n opt_no_js,\\n\\n opt_no_images,\\n\\n opt_user_agent,\\n\\n );\\n\\n\\n\\n print_dom(&dom.document);\\n\\n println!(); // Ensure newline at end of output\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 30,\n \"score\": 4.084997371713607\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n // Dig deeper\\n\\n for child in node.children.borrow().iter() {\\n\\n walk_and_embed_assets(\\n\\n &url,\\n\\n child,\\n\\n opt_no_js,\\n\\n opt_no_images,\\n\\n opt_user_agent,\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n NodeData::ProcessingInstruction { .. } => unreachable!(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/html.rs\",\n \"rank\": 33,\n \"score\": 2.764249087327243\n },\n {\n \"content\": \" assert_eq!(detect_mimetype(b\\\"ID3\\\"), \\\"audio/mpeg\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\xFF\\\\x0E\\\"), \\\"audio/mpeg\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\xFF\\\\x0F\\\"), \\\"audio/mpeg\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"OggS\\\"), \\\"audio/ogg\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"RIFF....WAVEfmt \\\"), \\\"audio/wav\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"fLaC\\\"), \\\"audio/x-flac\\\");\\n\\n // Video\\n\\n assert_eq!(detect_mimetype(b\\\"RIFF....AVI LIST\\\"), \\\"video/avi\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"....ftyp\\\"), \\\"video/mp4\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\x00\\\\x00\\\\x01\\\\x0B\\\"), \\\"video/mpeg\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"....moov\\\"), \\\"video/quicktime\\\");\\n\\n assert_eq!(detect_mimetype(b\\\"\\\\x1A\\\\x45\\\\xDF\\\\xA3\\\"), \\\"video/webm\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 34,\n \"score\": 2.6147526071836937\n },\n {\n \"content\": \"extern crate base64;\\n\\n\\n\\nuse self::base64::encode;\\n\\n\\n\\nstatic MAGIC: [[&[u8]; 2]; 19] = [\\n\\n // Image\\n\\n [b\\\"GIF87a\\\", b\\\"image/gif\\\"],\\n\\n [b\\\"GIF89a\\\", b\\\"image/gif\\\"],\\n\\n [b\\\"\\\\xFF\\\\xD8\\\\xFF\\\", b\\\"image/jpeg\\\"],\\n\\n [b\\\"\\\\x89PNG\\\\x0D\\\\x0A\\\\x1A\\\\x0A\\\", b\\\"image/png\\\"],\\n\\n [b\\\"<?xml \\\", b\\\"image/svg+xml\\\"],\\n\\n [b\\\"<svg \\\", b\\\"image/svg+xml\\\"],\\n\\n [b\\\"RIFF....WEBPVP8 \\\", b\\\"image/webp\\\"],\\n\\n [b\\\"\\\\x00\\\\x00\\\\x01\\\\x00\\\", b\\\"image/x-icon\\\"],\\n\\n // Audio\\n\\n [b\\\"ID3\\\", b\\\"audio/mpeg\\\"],\\n\\n [b\\\"\\\\xFF\\\\x0E\\\", b\\\"audio/mpeg\\\"],\\n\\n [b\\\"\\\\xFF\\\\x0F\\\", b\\\"audio/mpeg\\\"],\\n\\n [b\\\"OggS\\\", b\\\"audio/ogg\\\"],\\n\\n [b\\\"RIFF....WAVEfmt \\\", b\\\"audio/wav\\\"],\\n\\n [b\\\"fLaC\\\", b\\\"audio/x-flac\\\"],\\n\\n // Video\\n\\n [b\\\"RIFF....AVI LIST\\\", b\\\"video/avi\\\"],\\n\\n [b\\\"....ftyp\\\", b\\\"video/mp4\\\"],\\n\\n [b\\\"\\\\x00\\\\x00\\\\x01\\\\x0B\\\", b\\\"video/mpeg\\\"],\\n\\n [b\\\"....moov\\\", b\\\"video/quicktime\\\"],\\n\\n [b\\\"\\\\x1A\\\\x45\\\\xDF\\\\xA3\\\", b\\\"video/webm\\\"],\\n\\n];\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 35,\n \"score\": 1.7035908438910878\n },\n {\n \"content\": \"# monolith\\n\\n\\n\\nA data hoarder's dream come true: bundle any web page into a single HTML file. \\n\\nYou can finally replace that gazillion of open tabs with a gazillion of .html files stored somewhere on your precious little drive.\\n\\n\\n\\nUnlike conventional \\\"Save page as…\\\", `monolith` not only saves the target document,\\n\\nit embeds CSS, image, and JavaScript assets **all at once**, producing a single HTML5 document that is a joy to store and share.\\n\\n\\n\\nIf compared to saving websites with `wget -mpk`, `monolith` embeds all assets as data URLs and therefore displays the saved page exactly the same, being completely separated from the Internet.\\n\\n\\n\\n<!-- `This program works both on remote and local targets. -->\\n\\n\\n\\n### Installation\\n\\n $ git clone https://github.com/Y2Z/monolith.git\\n\\n $ cd monolith\\n\\n $ cargo install --path .\\n\\n\\n\\n### Usage\\n\\n $ monolith https://lyrics.github.io/db/p/portishead/dummy/roads/ > portishead-roads-lyrics.html\\n\\n\\n\\n### Options\\n\\n - `-i`: Remove images\\n\\n - `-j`: Exclude JavaScript\\n\\n - `-u`: Specify custom User-Agent\\n\\n\\n\\n### License\\n\\nThe Unlicense\\n\\n\\n\\n<!-- Microtext -->\\n\\n<sub>Keep in mind that `monolith` is not aware of your browser's session</sub>\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 36,\n \"score\": 1.070330139623277\n }\n]","isConversational":false}}},{"rowIdx":1195,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/board/builder.rs"},"repo_name":{"kind":"string","value":"veeso/chess-engine-harmon"},"commit":{"kind":"string","value":"463474a593e10695281309293677f2d96a06ddd6"},"file_code":{"kind":"string","value":"\n\nuse super::{Board, Color, Piece, Square, BLACK, WHITE};\n\npub struct BoardBuilder {\n board: Board,\n}\n\nimpl From<Board> for BoardBuilder {\n fn from(board: Board) -> Self {\n Self { board }\n }\n}\n\nimpl Default for BoardBuilder {\n fn default() -> Self {\n let mut board = Board::empty();\n board.white_castling_rights.disable_all();\n board.black_castling_rights.disable_all();\n Self { board }\n }\n}\n\nimpl BoardBuilder {\n \n \n \n pub fn row(mut self, piece: Piece) -> Self {\n let mut pos = piece.get_pos();\n while pos.get_col() > 0 {\n pos = pos.next_left()\n }\n\n for _ in 0..8 {\n *self.board.get_square(pos) = Square::from(piece.move_to(pos));\n pos = pos.next_right();\n }\n\n self\n }\n\n \n \n \n pub fn column(mut self, piece: Piece) -> Self {\n let mut pos = piece.get_pos();\n while pos.get_row() > 0 {\n pos = pos.next_below()\n }\n\n for _ in 0..8 {\n *self.board.get_square(pos) = Square::from(piece.move_to(pos));\n pos = pos.next_above();\n }\n\n self\n }\n\n \n \n \n pub fn piece(mut self, piece: Piece) -> Self {\n let pos = piece.get_pos();\n *self.board.get_square(pos) = Square::from(piece);\n self\n }\n\n \n \n \n pub fn enable_castling(mut self) -> Self {\n self.board.black_castling_rights.enable_all();\n self.board.white_castling_rights.enable_all();\n self\n }\n\n \n \n \n pub fn disable_castling(mut self) -> Self {\n self.board.black_castling_rights.disable_all();\n self.board.white_castling_rights.disable_all();\n self\n }\n\n \n \n \n pub fn enable_queenside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.enable_queenside(),\n BLACK => self.board.black_castling_rights.enable_queenside(),\n }\n self\n }\n\n \n \n \n pub fn disable_queenside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.disable_queenside(),\n BLACK => self.board.black_castling_rights.disable_queenside(),\n }\n self\n }\n\n \n \n \n pub fn enable_kingside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.enable_kingside(),\n BLACK => self.board.black_castling_rights.enable_kingside(),\n }\n self\n }\n\n \n \n \n pub fn disable_kingside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.disable_kingside(),\n BLACK => self.board.black_castling_rights.disable_kingside(),\n }\n self\n }\n\n \n \n \n pub fn player_moving(mut self, color: Color) -> Self {\n self.board.turn = color;\n self\n }\n\n \n \n \n pub fn build(self) -> Board {\n self.board\n }\n}\n\n#[cfg(test)]\nmod test {\n\n use super::*;\n use crate::position::*;\n use crate::{BLACK, WHITE};\n\n use pretty_assertions::assert_eq;\n\n #[test]\n fn default() {\n let builder: BoardBuilder = BoardBuilder::default();\n assert_eq!(builder.board.get_legal_moves(WHITE).is_empty(), true);\n assert_eq!(builder.board.get_legal_moves(BLACK).is_empty(), true);\n assert_eq!(\n builder.board.black_castling_rights.can_kingside_castle(),\n false\n );\n assert_eq!(\n builder.board.black_castling_rights.can_queenside_castle(),\n false\n );\n assert_eq!(\n builder.board.white_castling_rights.can_kingside_castle(),\n false\n );\n assert_eq!(\n builder.board.white_castling_rights.can_queenside_castle(),\n false\n );\n }\n\n #[test]\n fn from() {\n let builder: BoardBuilder = BoardBuilder::from(Board::default());\n assert_eq!(builder.board.get_legal_moves(WHITE).len(), 20); \n assert_eq!(builder.board.get_legal_moves(BLACK).len(), 20); \n assert_eq!(\n builder.board.black_castling_rights.can_kingside_castle(),\n true\n );\n assert_eq!(\n builder.board.black_castling_rights.can_queenside_castle(),\n true\n );\n assert_eq!(\n builder.board.white_castling_rights.can_kingside_castle(),\n true\n );\n assert_eq!(\n builder.board.white_castling_rights.can_queenside_castle(),\n true\n );\n }\n\n #[test]\n fn row() {\n let board: Board = BoardBuilder::default().row(Piece::Queen(WHITE, A1)).build();\n assert_eq!(board.get_piece(A1).unwrap(), Piece::Queen(WHITE, A1));\n assert_eq!(board.get_piece(B1).unwrap(), Piece::Queen(WHITE, B1));\n assert_eq!(board.get_piece(C1).unwrap(), Piece::Queen(WHITE, C1));\n assert_eq!(board.get_piece(D1).unwrap(), Piece::Queen(WHITE, D1));\n assert_eq!(board.get_piece(E1).unwrap(), Piece::Queen(WHITE, E1));\n assert_eq!(board.get_piece(F1).unwrap(), Piece::Queen(WHITE, F1));\n assert_eq!(board.get_piece(G1).unwrap(), Piece::Queen(WHITE, G1));\n assert_eq!(board.get_piece(H1).unwrap(), Piece::Queen(WHITE, H1));\n }\n\n #[test]\n fn col() {\n let board: Board = BoardBuilder::default()\n .column(Piece::Queen(WHITE, A1))\n .build();\n assert_eq!(board.get_piece(A1).unwrap(), Piece::Queen(WHITE, A1));\n assert_eq!(board.get_piece(A2).unwrap(), Piece::Queen(WHITE, A2));\n assert_eq!(board.get_piece(A3).unwrap(), Piece::Queen(WHITE, A3));\n assert_eq!(board.get_piece(A4).unwrap(), Piece::Queen(WHITE, A4));\n assert_eq!(board.get_piece(A5).unwrap(), Piece::Queen(WHITE, A5));\n assert_eq!(board.get_piece(A6).unwrap(), Piece::Queen(WHITE, A6));\n assert_eq!(board.get_piece(A7).unwrap(), Piece::Queen(WHITE, A7));\n assert_eq!(board.get_piece(A8).unwrap(), Piece::Queen(WHITE, A8));\n }\n\n #[test]\n fn piece() {\n let board: Board = BoardBuilder::default()\n .piece(Piece::Rook(WHITE, A1))\n .piece(Piece::Rook(BLACK, H8))\n .build();\n assert_eq!(board.get_piece(A1).unwrap(), Piece::Rook(WHITE, A1));\n assert_eq!(board.get_piece(H8).unwrap(), Piece::Rook(BLACK, H8));\n }\n\n #[test]\n fn player_moving() {\n let board: Board = BoardBuilder::default().player_moving(BLACK).build();\n assert_eq!(board.get_turn(), BLACK);\n }\n\n #[test]\n fn castling_rights() {\n \n let board: Board = BoardBuilder::default().enable_castling().build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), true);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n \n let board: Board = BoardBuilder::default()\n .enable_kingside_castle(WHITE)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default()\n .enable_kingside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default()\n .enable_queenside_castle(WHITE)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n \n let board: Board = BoardBuilder::default()\n .enable_queenside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), true);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default().disable_castling().build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default()\n .enable_castling()\n .disable_queenside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n let board: Board = BoardBuilder::default()\n .enable_castling()\n .disable_kingside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), true);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse super::{Board, Color, Piece, Square, BLACK, WHITE};\n\npub struct BoardBuilder {\n board: Board,\n}\n\nimpl From<Board> for BoardBuilder {\n fn from(board: Board) -> Self {\n Self { board }\n }\n}\n\nimpl Default for BoardBuilder {\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl BoardBuilder {\n \n \n \n pub fn row(mut self, piece: Piece) -> Self {\n let mut pos = piece.get_pos();\n while pos.get_col() > 0 {\n pos = pos.next_left()\n }\n\n for _ in 0..8 {\n *self.board.get_square(pos) = Square::from(piece.move_to(pos));\n pos = pos.next_right();\n }\n\n self\n }\n\n \n \n \n pub fn column(mut self, piece: Piece) -> Self {\n let mut pos = piece.get_pos();\n while pos.get_row() > 0 {\n pos = pos.next_below()\n }\n\n for _ in 0..8 {\n *self.board.get_square(pos) = Square::from(piece.move_to(pos));\n pos = pos.next_above();\n }\n\n self\n }\n\n \n \n \n pub fn piece(mut self, piece: Piece) -> Self {\n let pos = piece.get_pos();\n *self.board.get_square(pos) = Square::from(piece);\n self\n }\n\n \n \n \n pub fn enable_castling(mut self) -> Self {\n self.board.black_castling_rights.enable_all();\n self.board.white_castling_rights.enable_all();\n self\n }\n\n \n \n \n pub fn disable_castling(mut self) -> Self {\n self.board.black_castling_rights.disable_all();\n self.board.white_castling_rights.disable_all();\n self\n }\n\n \n \n \n pub fn enable_queenside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.enable_queenside(),\n BLACK => self.board.black_castling_rights.enable_queenside(),\n }\n self\n }\n\n \n \n \n pub fn disable_queenside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.disable_queenside(),\n BLACK => self.board.black_castling_rights.disable_queenside(),\n }\n self\n }\n\n \n \n \n pub fn enable_kingside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.enable_kingside(),\n BLACK => self.board.black_castling_rights.enable_kingside(),\n }\n self\n }\n\n \n \n \n pub fn disable_kingside_castle(mut self, color: Color) -> Self {\n match color {\n WHITE => self.board.white_castling_rights.disable_kingside(),\n BLACK => self.board.black_castling_rights.disable_kingside(),\n }\n self\n }\n\n \n \n \n pub fn player_moving(mut self, color: Color) -> Self {\n self.board.turn = color;\n self\n }\n\n \n \n \n pub fn build(self) -> Board {\n self.board\n }\n}\n\n#[cfg(test)]\nmod test {\n\n use super::*;\n use crate::position::*;\n use crate::{BLACK, WHITE};\n\n use pretty_assertions::assert_eq;\n\n #[test]\n fn default() {\n let builder: BoardBuilder = BoardBuilder::default();\n assert_eq!(builder.board.get_legal_moves(WHITE).is_empty(), true);\n assert_eq!(builder.board.get_legal_moves(BLACK).is_empty(), true);\n assert_eq!(\n builder.board.black_castling_rights.can_kingside_castle(),\n false\n );\n assert_eq!(\n builder.board.black_castling_rights.can_queenside_castle(),\n false\n );\n assert_eq!(\n builder.board.white_castling_rights.can_kingside_castle(),\n false\n );\n assert_eq!(\n builder.board.white_castling_rights.can_queenside_castle(),\n false\n );\n }\n\n #[test]\n fn from() {\n let builder: BoardBuilder = BoardBuilder::from(Board::default());\n assert_eq!(builder.board.get_legal_moves(WHITE).len(), 20); \n assert_eq!(builder.board.get_legal_moves(BLACK).len(), 20); \n assert_eq!(\n builder.board.black_castling_rights.can_kingside_castle(),\n true\n );\n assert_eq!(\n builder.board.black_castling_rights.can_queenside_castle(),\n true\n );\n assert_eq!(\n builder.board.white_castling_rights.can_kingside_castle(),\n true\n );\n assert_eq!(\n builder.board.white_castling_rights.can_queenside_castle(),\n true\n );\n }\n\n #[test]\n fn row() {\n let board: Board = BoardBuilder::default().row(Piece::Queen(WHITE, A1)).build();\n assert_eq!(board.get_piece(A1).unwrap(), Piece::Queen(WHITE, A1));\n assert_eq!(board.get_piece(B1).unwrap(), Piece::Queen(WHITE, B1));\n assert_eq!(board.get_piece(C1).unwrap(), Piece::Queen(WHITE, C1));\n assert_eq!(board.get_piece(D1).unwrap(), Piece::Queen(WHITE, D1));\n assert_eq!(board.get_piece(E1).unwrap(), Piece::Queen(WHITE, E1));\n assert_eq!(board.get_piece(F1).unwrap(), Piece::Queen(WHITE, F1));\n assert_eq!(board.get_piece(G1).unwrap(), Piece::Queen(WHITE, G1));\n assert_eq!(board.get_piece(H1).unwrap(), Piece::Queen(WHITE, H1));\n }\n\n #[test]\n fn col() {\n let board: Board = BoardBuilder::default()\n .column(Piece::Queen(WHITE, A1))\n .build();\n assert_eq!(board.get_piece(A1).unwrap(), Piece::Queen(WHITE, A1));\n assert_eq!(board.get_piece(A2).unwrap(), Piece::Queen(WHITE, A2));\n assert_eq!(board.get_piece(A3).unwrap(), Piece::Queen(WHITE, A3));\n assert_eq!(board.get_piece(A4).unwrap(), Piece::Queen(WHITE, A4));\n assert_eq!(board.get_piece(A5).unwrap(), Piece::Queen(WHITE, A5));\n assert_eq!(board.get_piece(A6).unwrap(), Piece::Queen(WHITE, A6));\n assert_eq!(board.get_piece(A7).unwrap(), Piece::Queen(WHITE, A7));\n assert_eq!(board.get_piece(A8).unwrap(), Piece::Queen(WHITE, A8));\n }\n\n #[test]\n fn piece() {\n let board: Board = BoardBuilder::default()\n .piece(Piece::Rook(WHITE, A1))\n .piece(Piece::Rook(BLACK, H8))\n .build();\n assert_eq!(board.get_piece(A1).unwrap(), Piece::Rook(WHITE, A1));\n assert_eq!(board.get_piece(H8).unwrap(), Piece::Rook(BLACK, H8));\n }\n\n #[test]\n fn player_moving() {\n let board: Board = BoardBuilder::default().player_moving(BLACK).build();\n assert_eq!(board.get_turn(), BLACK);\n }\n\n #[test]\n fn castling_rights() {\n \n let board: Board = BoardBuilder::default().enable_castling().build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), true);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n \n let board: Board = BoardBuilder::default()\n .enable_kingside_castle(WHITE)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default()\n .enable_kingside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default()\n .enable_queenside_castle(WHITE)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n \n let board: Board = BoardBuilder::default()\n .enable_queenside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), true);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default().disable_castling().build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), false);\n \n let board: Board = BoardBuilder::default()\n .enable_castling()\n .disable_queenside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), false);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n let board: Board = BoardBuilder::default()\n .enable_castling()\n .disable_kingside_castle(BLACK)\n .build();\n assert_eq!(board.black_castling_rights.can_kingside_castle(), false);\n assert_eq!(board.black_castling_rights.can_queenside_castle(), true);\n assert_eq!(board.white_castling_rights.can_kingside_castle(), true);\n assert_eq!(board.white_castling_rights.can_queenside_castle(), true);\n }\n}\n"},"middle":{"kind":"string","value":"fn default() -> Self {\n let mut board = Board::empty();\n board.white_castling_rights.disable_all();\n board.black_castling_rights.disable_all();\n Self { board }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// ### was_illegal_move\n\n///\n\n/// Returns whether game result was an illegal move\n\npub fn was_illegal_move(res: &GameResult) -> bool {\n\n matches!(res, Err(GameError::IllegalMove(_)))\n\n}\n\n\n","file_path":"src/game/result.rs","rank":0,"score":43371.68225817752},{"content":"/// ### set_result_event\n\n///\n\n/// Set `GameEvent` to `GameResult`\n\npub fn set_result_event(res: GameResult, ev: GameEvent) -> GameResult {\n\n match res {\n\n Ok((state, mut event)) => {\n\n event.insert(ev);\n\n Ok((state, event))\n\n }\n\n Err(err) => Err(err),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n\n\n use super::*;\n\n use alloc::string::ToString;\n\n\n\n #[test]\n\n fn fmt_game_error() {\n\n assert_eq!(\n\n GameError::CantPromote.to_string().as_str(),\n","file_path":"src/game/result.rs","rank":1,"score":35170.90637594846},{"content":"//! # Square\n\n//!\n\n//! This module exposes the type to define an individual square of the chess board\n\n\n\nuse super::Piece;\n\n\n\n/// ## Square\n\n///\n\n/// Essentially a container for a single piece on a board.\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]\n\npub struct Square {\n\n piece: Option<Piece>,\n\n}\n\n\n\nimpl From<Piece> for Square {\n\n fn from(piece: Piece) -> Self {\n\n Self { piece: Some(piece) }\n\n }\n\n}\n\n\n","file_path":"src/square.rs","rank":2,"score":30591.698544494986},{"content":"impl Square {\n\n /// ### empty\n\n ///\n\n /// A constructor for an empty Square\n\n pub fn empty() -> Self {\n\n Square { piece: None }\n\n }\n\n\n\n /// ### is_empty\n\n ///\n\n /// Does this square contain a piece?\n\n #[inline]\n\n pub fn is_empty(&self) -> bool {\n\n self.piece == None\n\n }\n\n\n\n /// ### get_piece\n\n ///\n\n /// Get the piece contained in this square.\n\n #[inline]\n","file_path":"src/square.rs","rank":3,"score":30587.85574223603},{"content":" pub fn get_piece(&self) -> Option<Piece> {\n\n self.piece\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n\n\n use super::*;\n\n use crate::position::C8;\n\n use crate::WHITE;\n\n\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn square() {\n\n // empty\n\n let square: Square = Square::empty();\n\n assert_eq!(square.is_empty(), true);\n\n assert_eq!(square.get_piece(), None);\n\n // from\n\n let square: Square = Square::from(Piece::Queen(WHITE, C8));\n\n assert_eq!(square.is_empty(), false);\n\n assert_eq!(square.get_piece().unwrap().is_queen(), true);\n\n }\n\n}\n","file_path":"src/square.rs","rank":4,"score":30586.80877255293},{"content":" pub fn get_weighted_value(&self) -> f64 {\n\n let weights = match self {\n\n Self::King(c, _) => match c {\n\n Color::White => WHITE_KING_POSITION_WEIGHTS,\n\n Color::Black => BLACK_KING_POSITION_WEIGHTS,\n\n },\n\n Self::Queen(c, _) => match c {\n\n Color::White => WHITE_QUEEN_POSITION_WEIGHTS,\n\n Color::Black => BLACK_QUEEN_POSITION_WEIGHTS,\n\n },\n\n Self::Rook(c, _) => match c {\n\n Color::White => WHITE_ROOK_POSITION_WEIGHTS,\n\n Color::Black => BLACK_ROOK_POSITION_WEIGHTS,\n\n },\n\n Self::Bishop(c, _) => match c {\n\n Color::White => WHITE_BISHOP_POSITION_WEIGHTS,\n\n Color::Black => BLACK_BISHOP_POSITION_WEIGHTS,\n\n },\n\n Self::Knight(c, _) => match c {\n\n Color::White => WHITE_KNIGHT_POSITION_WEIGHTS,\n","file_path":"src/piece.rs","rank":5,"score":29232.04324664953},{"content":"//! # Piece\n\n//!\n\n//! Exposes the piece type and its related functions\n\n\n\nuse super::{Board, Color, Move, Position, BLACK, WHITE};\n\nuse alloc::vec::Vec;\n\n\n\n/// ## Piece\n\n///\n\n/// A piece on a board.\n\n///\n\n/// Every piece has both a color and a position.\n\n/// These, combined with the type of piece it is,\n\n/// determine things like\n\n/// 1. The validity of legal moves\n\n/// 2. The validity of legal attacks\n\n/// 3. Move generation\n\n/// 4. Material and positional value\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]\n\npub enum Piece {\n","file_path":"src/piece.rs","rank":6,"score":29232.00597225396},{"content":" /// Given a piece and a color, create a copy of the given piece, with the provided color\n\n #[inline]\n\n pub fn with_color(&self, color: Color) -> Self {\n\n match *self {\n\n Self::King(_, pos) => Self::King(color, pos),\n\n Self::Queen(_, pos) => Self::Queen(color, pos),\n\n Self::Rook(_, pos) => Self::Rook(color, pos),\n\n Self::Bishop(_, pos) => Self::Bishop(color, pos),\n\n Self::Knight(_, pos) => Self::Knight(color, pos),\n\n Self::Pawn(_, pos) => Self::Pawn(color, pos),\n\n }\n\n }\n\n\n\n /// ### get_legal_moves\n\n ///\n\n /// Get the exhaustive list of legal moves for a given piece.\n\n ///\n\n /// This is used for move generation.\n\n #[inline]\n\n pub(crate) fn get_legal_moves(&self, board: &Board) -> Vec<Move> {\n","file_path":"src/piece.rs","rank":7,"score":29231.844448157575},{"content":" Color::Black => BLACK_KNIGHT_POSITION_WEIGHTS,\n\n },\n\n Self::Pawn(c, _) => match c {\n\n Color::White => WHITE_PAWN_POSITION_WEIGHTS,\n\n Color::Black => BLACK_PAWN_POSITION_WEIGHTS,\n\n },\n\n };\n\n weights[(7 - self.get_pos().get_row()) as usize][self.get_pos().get_col() as usize]\n\n + (self.get_material_value() * 10) as f64\n\n }\n\n\n\n /// ### is_king\n\n ///\n\n /// Is this piece a king?\n\n #[inline]\n\n pub fn is_king(&self) -> bool {\n\n matches!(self, Self::King(_, _))\n\n }\n\n\n\n /// ### is_queen\n","file_path":"src/piece.rs","rank":8,"score":29230.996077429772},{"content":" assert_eq!(\n\n Piece::Knight(WHITE, H1).with_color(BLACK),\n\n Piece::Knight(BLACK, H1)\n\n );\n\n assert_eq!(\n\n Piece::Bishop(WHITE, H1).with_color(BLACK),\n\n Piece::Bishop(BLACK, H1)\n\n );\n\n assert_eq!(\n\n Piece::Pawn(WHITE, H1).with_color(BLACK),\n\n Piece::Pawn(BLACK, H1)\n\n );\n\n assert_eq!(\n\n Piece::Queen(WHITE, H1).with_color(BLACK),\n\n Piece::Queen(BLACK, H1)\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_starting_position() {\n","file_path":"src/piece.rs","rank":9,"score":29230.230584776175},{"content":" }\n\n\n\n #[test]\n\n fn get_color() {\n\n assert_eq!(Piece::Bishop(WHITE, A1).get_color(), WHITE);\n\n assert_eq!(Piece::King(BLACK, A1).get_color(), BLACK);\n\n assert_eq!(Piece::Knight(WHITE, A1).get_color(), WHITE);\n\n assert_eq!(Piece::Queen(BLACK, A1).get_color(), BLACK);\n\n assert_eq!(Piece::Pawn(WHITE, A1).get_color(), WHITE);\n\n assert_eq!(Piece::Rook(BLACK, A1).get_color(), BLACK);\n\n }\n\n\n\n #[test]\n\n fn get_pos() {\n\n assert_eq!(Piece::Bishop(WHITE, D4).get_pos(), D4);\n\n assert_eq!(Piece::King(BLACK, D4).get_pos(), D4);\n\n assert_eq!(Piece::Knight(WHITE, D4).get_pos(), D4);\n\n assert_eq!(Piece::Queen(BLACK, D4).get_pos(), D4);\n\n assert_eq!(Piece::Pawn(WHITE, D4).get_pos(), D4);\n\n assert_eq!(Piece::Rook(BLACK, D4).get_pos(), D4);\n","file_path":"src/piece.rs","rank":10,"score":29229.45308145773},{"content":" // Can take pawn (white)\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(WHITE, E4))\n\n .piece(Piece::Pawn(BLACK, D5))\n\n .piece(Piece::Pawn(BLACK, F5))\n\n .build();\n\n assert_eq!(\n\n Piece::Pawn(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, D5),\n\n Move::Piece(E4, F5)\n\n ]\n\n );\n\n // Can take pawn (black)\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(BLACK, E5))\n\n .piece(Piece::Pawn(WHITE, D4))\n","file_path":"src/piece.rs","rank":11,"score":29229.35049064208},{"content":" assert_eq!(Piece::Rook(BLACK, H8).is_kingside_rook(), true);\n\n assert_eq!(Piece::Rook(BLACK, H1).is_kingside_rook(), false);\n\n assert_eq!(Piece::Rook(WHITE, H8).is_kingside_rook(), false);\n\n }\n\n\n\n #[test]\n\n fn move_to() {\n\n assert_eq!(Piece::Rook(WHITE, H1).move_to(H8), Piece::Rook(WHITE, H8));\n\n }\n\n\n\n #[test]\n\n fn with_color() {\n\n assert_eq!(\n\n Piece::Rook(WHITE, H1).with_color(BLACK),\n\n Piece::Rook(BLACK, H1)\n\n );\n\n assert_eq!(\n\n Piece::King(WHITE, H1).with_color(BLACK),\n\n Piece::King(BLACK, H1)\n\n );\n","file_path":"src/piece.rs","rank":12,"score":29229.1263746419},{"content":" Self::Queen(_, pos) => Self::is_legal_queen_move(pos, new_pos, board),\n\n Self::Rook(_, pos) => Self::is_legal_rook_move(pos, new_pos, board),\n\n Self::Bishop(_, pos) => Self::is_legal_bishop_move(pos, new_pos, board),\n\n Self::Knight(_, pos) => pos.is_knight_move(new_pos),\n\n }\n\n }\n\n\n\n /// ### is_legal_attack\n\n ///\n\n /// Verify that attacking a given square is a legal move.\n\n #[inline]\n\n pub(crate) fn is_legal_attack(&self, new_pos: Position, board: &Board) -> bool {\n\n if board.has_ally_piece(new_pos, self.get_color()) || new_pos.is_off_board() {\n\n return false;\n\n }\n\n\n\n match *self {\n\n Self::Pawn(ally_color, pos) => {\n\n Self::is_legal_pawn_attack(ally_color, pos, new_pos, board)\n\n }\n","file_path":"src/piece.rs","rank":13,"score":29229.092341221556},{"content":" .piece(Piece::Rook(BLACK, E8))\n\n .piece(Piece::King(WHITE, E1))\n\n .build();\n\n assert_eq!(\n\n Piece::Pawn(WHITE, E4).get_legal_moves(&board),\n\n vec![Move::Piece(E4, E5)]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_king_legal_moves_starting_position() {\n\n // King without free squares\n\n assert_eq!(\n\n Piece::King(WHITE, E1).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n assert_eq!(\n\n Piece::King(BLACK, E8).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n","file_path":"src/piece.rs","rank":14,"score":29228.812941504242},{"content":" }\n\n _ => board.is_legal_move(*x, color),\n\n })\n\n .collect::<Vec<Move>>()\n\n }\n\n\n\n /// ### is_legal_move\n\n ///\n\n /// Verify that moving to a new position is a legal move.\n\n #[inline]\n\n pub(crate) fn is_legal_move(&self, new_pos: Position, board: &Board) -> bool {\n\n if board.has_ally_piece(new_pos, self.get_color()) || new_pos.is_off_board() {\n\n return false;\n\n }\n\n\n\n match *self {\n\n Self::Pawn(ally_color, pos) => {\n\n Self::is_legal_pawn_move(ally_color, pos, new_pos, board)\n\n }\n\n Self::King(_, pos) => pos.is_adjacent_to(new_pos),\n","file_path":"src/piece.rs","rank":15,"score":29228.38723040898},{"content":" let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(WHITE, E4))\n\n .piece(Piece::Pawn(WHITE, E5))\n\n .build();\n\n assert_eq!(Piece::Pawn(WHITE, E4).is_legal_move(E5, &board), false);\n\n }\n\n\n\n #[test]\n\n fn fmt() {\n\n assert_eq!(Piece::Bishop(WHITE, A1).to_string(), \"♗\");\n\n assert_eq!(Piece::Bishop(BLACK, A1).to_string(), \"♝\");\n\n assert_eq!(Piece::King(WHITE, A1).to_string(), \"♔\");\n\n assert_eq!(Piece::King(BLACK, A1).to_string(), \"♚\");\n\n assert_eq!(Piece::Knight(WHITE, A1).to_string(), \"♘\");\n\n assert_eq!(Piece::Knight(BLACK, A1).to_string(), \"♞\");\n\n assert_eq!(Piece::Queen(WHITE, A1).to_string(), \"♕\");\n\n assert_eq!(Piece::Queen(BLACK, A1).to_string(), \"♛\");\n\n assert_eq!(Piece::Pawn(WHITE, A1).to_string(), \"♙\");\n\n assert_eq!(Piece::Pawn(BLACK, A1).to_string(), \"♟\");\n\n assert_eq!(Piece::Rook(WHITE, A1).to_string(), \"♖\");\n\n assert_eq!(Piece::Rook(BLACK, A1).to_string(), \"♜\");\n\n }\n\n}\n","file_path":"src/piece.rs","rank":16,"score":29228.31367121109},{"content":" let result: Vec<Move> = match *self {\n\n Self::Pawn(ally_color, pos) => Self::get_pawn_legal_moves(ally_color, pos, board),\n\n Self::King(ally_color, pos) => Self::get_king_legal_moves(ally_color, pos, board),\n\n Self::Queen(ally_color, pos) => Self::get_queen_legal_moves(ally_color, pos, board),\n\n Self::Rook(ally_color, pos) => Self::get_rook_legal_moves(ally_color, pos, board),\n\n Self::Bishop(ally_color, pos) => Self::get_bishop_legal_moves(ally_color, pos, board),\n\n Self::Knight(ally_color, pos) => Self::get_knight_legal_moves(ally_color, pos, board),\n\n };\n\n\n\n let color = self.get_color();\n\n // Filter illegal moves and off-boards from result\n\n result\n\n .into_iter()\n\n .filter(|x| match x {\n\n Move::Piece(from, to) => {\n\n if from.is_on_board() && to.is_on_board() {\n\n board.is_legal_move(*x, color)\n\n } else {\n\n false\n\n }\n","file_path":"src/piece.rs","rank":17,"score":29228.276685560228},{"content":" pub fn get_color(&self) -> Color {\n\n match self {\n\n Self::King(c, _)\n\n | Self::Queen(c, _)\n\n | Self::Rook(c, _)\n\n | Self::Bishop(c, _)\n\n | Self::Knight(c, _)\n\n | Self::Pawn(c, _) => *c,\n\n }\n\n }\n\n\n\n /// ### get_pos\n\n ///\n\n /// Get the position of a piece.\n\n #[inline]\n\n pub fn get_pos(&self) -> Position {\n\n match self {\n\n Self::King(_, p)\n\n | Self::Queen(_, p)\n\n | Self::Rook(_, p)\n","file_path":"src/piece.rs","rank":18,"score":29228.214004019792},{"content":" // Starting pawn (white)\n\n assert_eq!(\n\n Piece::Pawn(WHITE, E2).get_legal_moves(&Board::default()),\n\n vec![Move::Piece(E2, E4), Move::Piece(E2, E3)]\n\n );\n\n // Starting pawn (black)\n\n assert_eq!(\n\n Piece::Pawn(BLACK, F7).get_legal_moves(&Board::default()),\n\n vec![Move::Piece(F7, F5), Move::Piece(F7, F6)]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_last_position() {\n\n // Starting pawn (white)\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(WHITE, H8))\n\n .piece(Piece::Pawn(BLACK, A1))\n\n .build();\n","file_path":"src/piece.rs","rank":19,"score":29228.118624956565},{"content":" #[test]\n\n fn get_rook_legal_moves_blocked() {\n\n assert_eq!(\n\n Piece::Rook(WHITE, A1).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n assert_eq!(\n\n Piece::Rook(BLACK, H8).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_rook_legal_moves_piece_on_col() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Rook(WHITE, E4))\n\n .piece(Piece::Knight(BLACK, E6))\n\n .piece(Piece::Knight(WHITE, E1))\n\n .build();\n","file_path":"src/piece.rs","rank":20,"score":29227.992424167347},{"content":" .piece(Piece::King(WHITE, E1))\n\n .piece(Piece::Queen(BLACK, E2))\n\n .piece(Piece::Rook(BLACK, E8))\n\n .build();\n\n assert_eq!(Piece::King(WHITE, E1).get_legal_moves(&board), vec![]);\n\n }\n\n\n\n #[test]\n\n fn get_queen_legal_moves_free() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Queen(WHITE, E4))\n\n .build();\n\n assert_eq!(\n\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, B1),\n\n Move::Piece(E4, H1),\n\n Move::Piece(E4, C2),\n\n Move::Piece(E4, G2),\n","file_path":"src/piece.rs","rank":21,"score":29227.92181914536},{"content":" .piece(Piece::Pawn(WHITE, F4))\n\n .build();\n\n assert_eq!(\n\n Piece::Pawn(BLACK, E5).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E5, E4),\n\n Move::Piece(E5, D4),\n\n Move::Piece(E5, F4)\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_opposite() {\n\n // Opposite pawn\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(WHITE, E4))\n\n .piece(Piece::Pawn(BLACK, E5))\n\n .build();\n","file_path":"src/piece.rs","rank":22,"score":29227.634315770316},{"content":" /// Change the position of this piece to a new position.\n\n ///\n\n /// For example, `Pawn(WHITE, E4).move_to(E5)` will result in\n\n /// `Pawn(WHITE, E5)`. This does not check for move legality,\n\n /// it merely creates a new piece with the same color and type, but\n\n /// with a new position.\n\n #[inline]\n\n pub fn move_to(&self, new_pos: Position) -> Self {\n\n match *self {\n\n Self::King(c, _) => Self::King(c, new_pos),\n\n Self::Queen(c, _) => Self::Queen(c, new_pos),\n\n Self::Rook(c, _) => Self::Rook(c, new_pos),\n\n Self::Bishop(c, _) => Self::Bishop(c, new_pos),\n\n Self::Knight(c, _) => Self::Knight(c, new_pos),\n\n Self::Pawn(c, _) => Self::Pawn(c, new_pos),\n\n }\n\n }\n\n\n\n /// ### with_color\n\n ///\n","file_path":"src/piece.rs","rank":23,"score":29227.631911746543},{"content":"\n\n#[cfg(test)]\n\nmod test {\n\n\n\n use super::*;\n\n use crate::board::BoardBuilder;\n\n use crate::position::*;\n\n use crate::MoveResult;\n\n\n\n use alloc::string::ToString;\n\n use pretty_assertions::assert_eq;\n\n\n\n #[test]\n\n fn get_name() {\n\n assert_eq!(Piece::Bishop(WHITE, A1).get_name(), \"bishop\");\n\n assert_eq!(Piece::King(WHITE, A1).get_name(), \"king\");\n\n assert_eq!(Piece::Knight(WHITE, A1).get_name(), \"knight\");\n\n assert_eq!(Piece::Queen(WHITE, A1).get_name(), \"queen\");\n\n assert_eq!(Piece::Pawn(WHITE, A1).get_name(), \"pawn\");\n\n assert_eq!(Piece::Rook(WHITE, A1).get_name(), \"rook\");\n","file_path":"src/piece.rs","rank":24,"score":29227.4979857439},{"content":" fn get_queen_legal_moves_piece_on_diagonal() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Queen(WHITE, D4))\n\n .piece(Piece::Bishop(BLACK, E3))\n\n .piece(Piece::Bishop(BLACK, E5))\n\n .piece(Piece::Bishop(BLACK, C3))\n\n .piece(Piece::Bishop(BLACK, C5))\n\n .build();\n\n assert_eq!(\n\n Piece::Queen(WHITE, D4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(D4, C3),\n\n Move::Piece(D4, E3),\n\n Move::Piece(D4, C5),\n\n Move::Piece(D4, E5),\n\n Move::Piece(D4, D1),\n\n Move::Piece(D4, D2),\n\n Move::Piece(D4, D3),\n\n Move::Piece(D4, D5),\n","file_path":"src/piece.rs","rank":25,"score":29227.417029317174},{"content":" if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(F7, F5)) {\n\n // Black pawn\n\n board = next_board;\n\n }\n\n assert_eq!(\n\n Piece::Pawn(WHITE, E5).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E5, F6), // En passant\n\n Move::Piece(E5, E6),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_discovered_check() {\n\n // Discovered check by rook\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(WHITE, E4))\n\n .piece(Piece::Pawn(BLACK, F5)) // Could capture, but discovered check by rook\n","file_path":"src/piece.rs","rank":26,"score":29227.27915709147},{"content":" Move::Piece(E4, F6),\n\n Move::Piece(E4, G3),\n\n Move::Piece(E4, F2),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_knight_legal_moves_discovered_check() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Knight(WHITE, E4))\n\n .piece(Piece::King(WHITE, B1))\n\n .piece(Piece::Bishop(BLACK, H7))\n\n .build();\n\n assert_eq!(Piece::Knight(WHITE, E4).get_legal_moves(&board), vec![]);\n\n }\n\n\n\n #[test]\n\n fn is_legal_move() {\n","file_path":"src/piece.rs","rank":27,"score":29227.230807400163},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_king_legal_moves_protected_rook_check() {\n\n // King, checked by a protected rook on the left\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::King(WHITE, E5))\n\n .piece(Piece::Rook(BLACK, D5))\n\n .piece(Piece::Pawn(BLACK, C6))\n\n .build();\n\n assert_eq!(\n\n Piece::King(WHITE, E5).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E5, E6),\n\n Move::Piece(E5, E4),\n\n Move::Piece(E5, F6),\n\n Move::Piece(E5, F4),\n","file_path":"src/piece.rs","rank":28,"score":29227.217716298248},{"content":" assert_eq!(Piece::Pawn(WHITE, H8).get_legal_moves(&board), vec![]);\n\n // Starting pawn (black)\n\n assert_eq!(Piece::Pawn(BLACK, A1).get_legal_moves(&board), vec![]);\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_already_moved() {\n\n // Not starting position pawn\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Pawn(WHITE, E3))\n\n .build();\n\n assert_eq!(\n\n Piece::Pawn(WHITE, E3).get_legal_moves(&board),\n\n vec![Move::Piece(E3, E4)]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_can_take() {\n","file_path":"src/piece.rs","rank":29,"score":29227.128987715627},{"content":" Move::Piece(E4, F2),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_knight_legal_moves_busy() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Knight(WHITE, E4))\n\n .piece(Piece::Knight(BLACK, C5))\n\n .piece(Piece::Knight(WHITE, D6))\n\n .build();\n\n assert_eq!(\n\n Piece::Knight(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, C5),\n\n Move::Piece(E4, C3),\n\n Move::Piece(E4, D2),\n\n Move::Piece(E4, G5),\n","file_path":"src/piece.rs","rank":30,"score":29227.103806244915},{"content":" /// ### get_name\n\n ///\n\n /// Get the name of the piece such as `\"pawn\"` or `\"king\"`.\n\n /// All names are lowercase.\n\n #[inline]\n\n pub fn get_name(&self) -> &'static str {\n\n match self {\n\n Self::King(_, _) => \"king\",\n\n Self::Queen(_, _) => \"queen\",\n\n Self::Rook(_, _) => \"rook\",\n\n Self::Bishop(_, _) => \"bishop\",\n\n Self::Knight(_, _) => \"knight\",\n\n Self::Pawn(_, _) => \"pawn\",\n\n }\n\n }\n\n\n\n /// ### get_color\n\n ///\n\n /// Get the color of a given piece.\n\n #[inline]\n","file_path":"src/piece.rs","rank":31,"score":29227.085811905043},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_rook_legal_moves_discovered_check() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Rook(WHITE, E4))\n\n .piece(Piece::King(WHITE, E1))\n\n .piece(Piece::Rook(BLACK, E7))\n\n .build();\n\n assert_eq!(\n\n Piece::Rook(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, E7),\n","file_path":"src/piece.rs","rank":32,"score":29227.039508404538},{"content":" Move::Piece(E4, B7),\n\n Move::Piece(E4, A8),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_bishop_legal_moves_discovered_check() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Bishop(WHITE, E4))\n\n .piece(Piece::Bishop(BLACK, G6))\n\n .piece(Piece::King(WHITE, C2))\n\n .build();\n\n assert_eq!(\n\n Piece::Bishop(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, D3),\n\n Move::Piece(E4, F5),\n\n Move::Piece(E4, G6),\n","file_path":"src/piece.rs","rank":33,"score":29227.039508404538},{"content":" assert_eq!(Piece::Pawn(WHITE, E4).get_legal_moves(&board), vec![]);\n\n assert_eq!(Piece::Pawn(BLACK, E5).get_legal_moves(&board), vec![]);\n\n }\n\n\n\n #[test]\n\n fn get_pawn_legal_moves_en_passant() {\n\n // En passant - edge case 😈\n\n let mut board: Board = Board::default();\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E2, E4)) {\n\n // White pawn\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(H7, H5)) {\n\n // Black pawn\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E4, E5)) {\n\n // White pawn\n\n board = next_board;\n\n }\n","file_path":"src/piece.rs","rank":34,"score":29226.868239306394},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_king_legal_moves_rook_on_left() {\n\n // King in the middle of the board, rook on the left\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::King(WHITE, E5))\n\n .piece(Piece::Rook(BLACK, D8))\n\n .build();\n\n assert_eq!(\n\n Piece::King(WHITE, E5).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E5, F5),\n\n Move::Piece(E5, E6),\n\n Move::Piece(E5, E4),\n\n Move::Piece(E5, F6),\n\n Move::Piece(E5, F4),\n","file_path":"src/piece.rs","rank":35,"score":29226.627418745506},{"content":"\n\n #[test]\n\n fn get_bishop_legal_moves_piece_on_diagonal() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Bishop(WHITE, E4))\n\n .piece(Piece::Bishop(BLACK, G6))\n\n .piece(Piece::Pawn(WHITE, C2))\n\n .build();\n\n assert_eq!(\n\n Piece::Bishop(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, H1),\n\n Move::Piece(E4, G2),\n\n Move::Piece(E4, D3),\n\n Move::Piece(E4, F3),\n\n Move::Piece(E4, D5),\n\n Move::Piece(E4, F5),\n\n Move::Piece(E4, C6),\n\n Move::Piece(E4, G6),\n","file_path":"src/piece.rs","rank":36,"score":29226.547829536576},{"content":"\n\n if let Some(en_passant) = board.get_en_passant() {\n\n if en_passant == up_left || en_passant == up_right {\n\n result.push(Move::Piece(pos, en_passant));\n\n }\n\n }\n\n\n\n if next_up.is_on_board()\n\n && pos.is_starting_pawn(ally_color)\n\n && board.has_no_piece(up)\n\n && board.has_no_piece(next_up)\n\n {\n\n result.push(Move::Piece(pos, next_up))\n\n }\n\n\n\n if up.is_on_board() && board.has_no_piece(up) {\n\n result.push(Move::Piece(pos, up))\n\n }\n\n\n\n // Check up_left NOTE: don't use else if, you can have both of them\n","file_path":"src/piece.rs","rank":37,"score":29226.46169677083},{"content":" }\n\n\n\n #[test]\n\n fn get_king_legal_moves_free_squares() {\n\n // King in the middle of the board, no threatened\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::King(WHITE, E5))\n\n .build();\n\n assert_eq!(\n\n Piece::King(WHITE, E5).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E5, D5),\n\n Move::Piece(E5, F5),\n\n Move::Piece(E5, E6),\n\n Move::Piece(E5, E4),\n\n Move::Piece(E5, D6),\n\n Move::Piece(E5, D4),\n\n Move::Piece(E5, F6),\n\n Move::Piece(E5, F4),\n","file_path":"src/piece.rs","rank":38,"score":29226.453374180204},{"content":" let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Rook(WHITE, E4))\n\n .piece(Piece::Queen(BLACK, G4))\n\n .piece(Piece::Queen(WHITE, B4))\n\n .build();\n\n assert_eq!(\n\n Piece::Rook(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, E1),\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, E7),\n\n Move::Piece(E4, E8),\n\n Move::Piece(E4, C4),\n\n Move::Piece(E4, D4),\n\n Move::Piece(E4, F4),\n\n Move::Piece(E4, G4),\n","file_path":"src/piece.rs","rank":39,"score":29226.370743604453},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_king_legal_moves_rook_on_left_can_take() {\n\n // King in the middle of the board, rook on the left, can take rook\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::King(WHITE, E5))\n\n .piece(Piece::Rook(BLACK, D5))\n\n .build();\n\n assert_eq!(\n\n Piece::King(WHITE, E5).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E5, D5),\n\n Move::Piece(E5, E6),\n\n Move::Piece(E5, E4),\n\n Move::Piece(E5, F6),\n\n Move::Piece(E5, F4),\n","file_path":"src/piece.rs","rank":40,"score":29226.318078367654},{"content":" Move::Piece(E4, E6),\n\n Move::Piece(E4, A4),\n\n Move::Piece(E4, B4),\n\n Move::Piece(E4, C4),\n\n Move::Piece(E4, D4),\n\n Move::Piece(E4, F4),\n\n Move::Piece(E4, G4),\n\n Move::Piece(E4, H4),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_queen_legal_moves_discovered_check() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Queen(WHITE, E4))\n\n .piece(Piece::King(WHITE, E1))\n\n .piece(Piece::Rook(BLACK, E8))\n\n .build();\n","file_path":"src/piece.rs","rank":41,"score":29226.180435247206},{"content":" ///\n\n /// Is this piece a queen?\n\n #[inline]\n\n pub fn is_queen(&self) -> bool {\n\n matches!(self, Self::Queen(_, _))\n\n }\n\n\n\n /// ### is_rook\n\n ///\n\n /// Is this piece a rook?\n\n #[inline]\n\n pub fn is_rook(&self) -> bool {\n\n matches!(self, Self::Rook(_, _))\n\n }\n\n\n\n /// ### is_bishop\n\n ///\n\n /// Is this piece a bishop?\n\n #[inline]\n\n pub fn is_bishop(&self) -> bool {\n","file_path":"src/piece.rs","rank":42,"score":29226.12574916975},{"content":" Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, E7),\n\n Move::Piece(E4, E8),\n\n Move::Piece(E4, C4),\n\n Move::Piece(E4, D4),\n\n Move::Piece(E4, F4),\n\n Move::Piece(E4, G4),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_queen_legal_moves_piece_on_column() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Queen(WHITE, E4))\n\n .piece(Piece::Rook(BLACK, E2))\n\n .piece(Piece::Rook(BLACK, E6))\n","file_path":"src/piece.rs","rank":43,"score":29226.096486267794},{"content":" matches!(self, Self::Bishop(_, _))\n\n }\n\n\n\n /// ### is_knight\n\n ///\n\n /// Is this piece a knight?\n\n #[inline]\n\n pub fn is_knight(&self) -> bool {\n\n matches!(self, Self::Knight(_, _))\n\n }\n\n\n\n /// ### is_pawn\n\n ///\n\n /// Is this piece a pawn?\n\n #[inline]\n\n pub fn is_pawn(&self) -> bool {\n\n matches!(self, Self::Pawn(_, _))\n\n }\n\n\n\n /// ### is_starting_pawn\n","file_path":"src/piece.rs","rank":44,"score":29225.78023227874},{"content":" ///\n\n /// Get all legal moves for provided queen\n\n fn get_queen_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\n\n let mut result = Self::get_bishop_legal_moves(ally_color, pos, board);\n\n result.extend(Self::get_rook_legal_moves(ally_color, pos, board));\n\n result\n\n }\n\n\n\n /// ### get_rook_legal_moves\n\n ///\n\n /// Get all legal moves for provided rook\n\n fn get_rook_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\n\n let mut result: Vec<Move> = Vec::new();\n\n for row in 0..8 {\n\n let new_pos = Position::new(row, pos.get_col());\n\n if new_pos != pos\n\n && !board.has_ally_piece(new_pos, ally_color)\n\n && new_pos.is_orthogonal_to(pos)\n\n {\n\n result.push(Move::Piece(pos, new_pos));\n","file_path":"src/piece.rs","rank":45,"score":29225.713754255867},{"content":" [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.5, -1.0, -2.0, -2.0, 1.0, 1.5, 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\nconst BLACK_PAWN_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\n\n [0.5, 1.5, -1.0, -2.0, -2.0, 1.0, 1.5, 0.5],\n\n [0.5, -0.5, -1.0, 0.0, 0.0, -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, 2.5, 2.5, 1.0, 0.5, 0.5],\n\n [1.0, 1.0, 2.0, 3.0, 3.0, 2.0, 1.0, 1.0],\n\n [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0],\n\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\n\n];\n\n\n\nimpl Piece {\n","file_path":"src/piece.rs","rank":46,"score":29225.66837081951},{"content":" pos: Position,\n\n new_pos: Position,\n\n board: &Board,\n\n ) -> bool {\n\n let up = pos.pawn_up(ally_color);\n\n let up_left = up.next_left();\n\n let up_right = up.next_right();\n\n\n\n (if let Some(en_passant) = board.get_en_passant() {\n\n (en_passant == up_left || en_passant == up_right) && (new_pos == en_passant)\n\n } else {\n\n false\n\n }) || (pos.is_starting_pawn(ally_color)\n\n && board.has_no_piece(new_pos)\n\n && board.has_no_piece(up)\n\n && new_pos == up.pawn_up(ally_color))\n\n || (board.has_enemy_piece(new_pos, ally_color) && new_pos == up_left)\n\n || (board.has_enemy_piece(new_pos, ally_color) && new_pos == up_right)\n\n || (board.has_no_piece(new_pos) && new_pos == up)\n\n }\n","file_path":"src/piece.rs","rank":47,"score":29225.53654029442},{"content":" assert_eq!(Piece::Knight(BLACK, C2).is_knight(), true);\n\n assert_eq!(Piece::Rook(WHITE, D4).is_knight(), false);\n\n }\n\n\n\n #[test]\n\n fn is_starting_pawn() {\n\n // White pawns\n\n assert_eq!(Piece::Pawn(WHITE, B2).is_starting_pawn(), true);\n\n assert_eq!(Piece::Pawn(WHITE, C2).is_starting_pawn(), true);\n\n assert_eq!(Piece::Pawn(BLACK, B2).is_starting_pawn(), false);\n\n assert_eq!(Piece::Pawn(BLACK, C2).is_starting_pawn(), false);\n\n // Black pawns\n\n assert_eq!(Piece::Pawn(BLACK, B7).is_starting_pawn(), true);\n\n assert_eq!(Piece::Pawn(BLACK, C7).is_starting_pawn(), true);\n\n assert_eq!(Piece::Pawn(WHITE, B7).is_starting_pawn(), false);\n\n assert_eq!(Piece::Pawn(WHITE, C7).is_starting_pawn(), false);\n\n // others\n\n assert_eq!(Piece::Queen(WHITE, C2).is_starting_pawn(), false);\n\n assert_eq!(Piece::Bishop(BLACK, C7).is_starting_pawn(), false);\n\n }\n","file_path":"src/piece.rs","rank":48,"score":29225.43455710727},{"content":" traveling.pop();\n\n\n\n for pos in traveling {\n\n if board.has_piece(pos) {\n\n return false;\n\n }\n\n }\n\n true\n\n } else {\n\n false\n\n }\n\n }\n\n}\n\n\n\nimpl core::fmt::Display for Piece {\n\n fn fmt(&self, f: &mut core::fmt::Formatter) -> Result<(), core::fmt::Error> {\n\n write!(\n\n f,\n\n \"{}\",\n\n match self.get_color() {\n","file_path":"src/piece.rs","rank":49,"score":29225.406064705665},{"content":" Move::Piece(E4, F4),\n\n Move::Piece(E4, G4),\n\n Move::Piece(E4, H4),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_queen_legal_moves_blocked() {\n\n assert_eq!(\n\n Piece::Queen(WHITE, D1).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n assert_eq!(\n\n Piece::Queen(BLACK, D8).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n }\n\n\n\n #[test]\n","file_path":"src/piece.rs","rank":50,"score":29225.334989757404},{"content":" Move::Piece(D4, D6),\n\n Move::Piece(D4, D7),\n\n Move::Piece(D4, D8),\n\n Move::Piece(D4, A4),\n\n Move::Piece(D4, B4),\n\n Move::Piece(D4, C4),\n\n Move::Piece(D4, E4),\n\n Move::Piece(D4, F4),\n\n Move::Piece(D4, G4),\n\n Move::Piece(D4, H4),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_queen_legal_moves_piece_on_line() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Queen(WHITE, E4))\n\n .piece(Piece::Rook(BLACK, C4))\n","file_path":"src/piece.rs","rank":51,"score":29225.27363302383},{"content":" if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(F1, C4)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(F8, C5)) {\n\n board = next_board;\n\n }\n\n assert_eq!(\n\n Piece::King(WHITE, E1).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E1, F1),\n\n Move::Piece(E1, E2),\n\n Move::KingSideCastle, // Castle\n\n ]\n\n );\n\n // Also black can castle now\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(C2, C3)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(G8, F6)) {\n\n board = next_board;\n","file_path":"src/piece.rs","rank":52,"score":29225.260216093637},{"content":" assert_eq!(Piece::Queen(WHITE, F6).get_weighted_value(), 90.5);\n\n assert_eq!(Piece::Queen(BLACK, F6).get_weighted_value(), 90.5);\n\n assert_eq!(Piece::Pawn(WHITE, H4).get_weighted_value(), 10.0);\n\n assert_eq!(Piece::Pawn(BLACK, H4).get_weighted_value(), 10.5);\n\n assert_eq!(Piece::Rook(WHITE, A2).get_weighted_value(), 49.5);\n\n assert_eq!(Piece::Rook(BLACK, A2).get_weighted_value(), 50.5);\n\n }\n\n\n\n #[test]\n\n fn is_king() {\n\n assert_eq!(Piece::King(WHITE, D4).is_king(), true);\n\n assert_eq!(Piece::Bishop(BLACK, C2).is_king(), false);\n\n }\n\n\n\n #[test]\n\n fn is_queen() {\n\n assert_eq!(Piece::Queen(WHITE, D4).is_queen(), true);\n\n assert_eq!(Piece::Bishop(BLACK, C2).is_queen(), false);\n\n }\n\n\n","file_path":"src/piece.rs","rank":53,"score":29225.1682628821},{"content":" Self::King(_, pos) => pos.is_adjacent_to(new_pos),\n\n Self::Queen(_, pos) => Self::is_legal_queen_attack(pos, new_pos, board),\n\n Self::Rook(_, pos) => Self::is_legal_rook_attack(pos, new_pos, board),\n\n Self::Bishop(_, pos) => Self::is_legal_bishop_attack(pos, new_pos, board),\n\n\n\n Self::Knight(_, pos) => pos.is_knight_move(new_pos),\n\n }\n\n }\n\n\n\n // -- private\n\n\n\n /// ### get_pawn_legal_moves\n\n ///\n\n /// Get all legal moves for provided pawn\n\n fn get_pawn_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\n\n let mut result: Vec<Move> = Vec::new();\n\n let up = pos.pawn_up(ally_color);\n\n let next_up = up.pawn_up(ally_color);\n\n let up_left = up.next_left();\n\n let up_right = up.next_right();\n","file_path":"src/piece.rs","rank":54,"score":29225.003969997786},{"content":" assert_eq!(\n\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, E7),\n\n Move::Piece(E4, E8),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_rook_legal_moves_free() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Rook(WHITE, E4))\n\n .build();\n\n assert_eq!(\n","file_path":"src/piece.rs","rank":55,"score":29225.003083389416},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_knight_legal_moves_free() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Knight(WHITE, E4))\n\n .build();\n\n assert_eq!(\n\n Piece::Knight(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, C5),\n\n Move::Piece(E4, D6),\n\n Move::Piece(E4, C3),\n\n Move::Piece(E4, D2),\n\n Move::Piece(E4, G5),\n\n Move::Piece(E4, F6),\n\n Move::Piece(E4, G3),\n","file_path":"src/piece.rs","rank":56,"score":29224.987534190772},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_bishop_legal_moves_free() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n\n .piece(Piece::Bishop(WHITE, E4))\n\n .build();\n\n assert_eq!(\n\n Piece::Bishop(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, B1),\n\n Move::Piece(E4, H1),\n\n Move::Piece(E4, C2),\n\n Move::Piece(E4, G2),\n\n Move::Piece(E4, D3),\n\n Move::Piece(E4, F3),\n\n Move::Piece(E4, D5),\n","file_path":"src/piece.rs","rank":57,"score":29224.987534190772},{"content":" }\n\n\n\n #[test]\n\n fn get_material_value() {\n\n assert_eq!(Piece::Bishop(WHITE, D4).get_material_value(), 3);\n\n assert_eq!(Piece::King(BLACK, D4).get_material_value(), 99999);\n\n assert_eq!(Piece::Knight(WHITE, D4).get_material_value(), 3);\n\n assert_eq!(Piece::Queen(BLACK, D4).get_material_value(), 9);\n\n assert_eq!(Piece::Pawn(WHITE, D4).get_material_value(), 1);\n\n assert_eq!(Piece::Rook(BLACK, D4).get_material_value(), 5);\n\n }\n\n\n\n #[test]\n\n fn get_weighted_value() {\n\n assert_eq!(Piece::Bishop(WHITE, C2).get_weighted_value(), 30.0);\n\n assert_eq!(Piece::Bishop(BLACK, C2).get_weighted_value(), 30.0);\n\n assert_eq!(Piece::King(WHITE, D4).get_weighted_value(), 999986.0);\n\n assert_eq!(Piece::King(BLACK, D4).get_weighted_value(), 999985.0);\n\n assert_eq!(Piece::Knight(WHITE, E5).get_weighted_value(), 32.0);\n\n assert_eq!(Piece::Knight(BLACK, E5).get_weighted_value(), 32.0);\n","file_path":"src/piece.rs","rank":58,"score":29224.97609444461},{"content":" Move::Piece(E4, F5),\n\n Move::Piece(E4, C6),\n\n Move::Piece(E4, G6),\n\n Move::Piece(E4, B7),\n\n Move::Piece(E4, H7),\n\n Move::Piece(E4, A8),\n\n ]\n\n );\n\n }\n\n #[test]\n\n fn get_bishop_legal_moves_blocked() {\n\n assert_eq!(\n\n Piece::Bishop(WHITE, C1).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n assert_eq!(\n\n Piece::Bishop(BLACK, F8).get_legal_moves(&Board::default()),\n\n vec![]\n\n );\n\n }\n","file_path":"src/piece.rs","rank":59,"score":29224.888958025982},{"content":" if up_left.is_on_board() && board.has_enemy_piece(up_left, ally_color) {\n\n result.push(Move::Piece(pos, up.next_left()))\n\n }\n\n // Check up_right\n\n if up_right.is_on_board() && board.has_enemy_piece(up.next_right(), ally_color) {\n\n result.push(Move::Piece(pos, up.next_right()))\n\n }\n\n result\n\n }\n\n\n\n /// ### get_king_legal_moves\n\n ///\n\n /// Get all legal moves for provided king\n\n fn get_king_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\n\n let mut result: Vec<Move> = Vec::new();\n\n for p in &[\n\n pos.next_left(),\n\n pos.next_right(),\n\n pos.next_above(),\n\n pos.next_below(),\n","file_path":"src/piece.rs","rank":60,"score":29224.860142345944},{"content":" #[test]\n\n fn is_rook() {\n\n assert_eq!(Piece::Rook(WHITE, D4).is_rook(), true);\n\n assert_eq!(Piece::Bishop(BLACK, C2).is_rook(), false);\n\n }\n\n\n\n #[test]\n\n fn is_bishop() {\n\n assert_eq!(Piece::Bishop(BLACK, C2).is_bishop(), true);\n\n assert_eq!(Piece::Rook(WHITE, D4).is_bishop(), false);\n\n }\n\n\n\n #[test]\n\n fn is_pawn() {\n\n assert_eq!(Piece::Pawn(BLACK, C2).is_pawn(), true);\n\n assert_eq!(Piece::Rook(WHITE, D4).is_pawn(), false);\n\n }\n\n\n\n #[test]\n\n fn is_knight() {\n","file_path":"src/piece.rs","rank":61,"score":29224.85484116587},{"content":" WHITE => match self {\n\n Self::King(_, _) => \"♔\",\n\n Self::Queen(_, _) => \"♕\",\n\n Self::Rook(_, _) => \"♖\",\n\n Self::Knight(_, _) => \"♘\",\n\n Self::Bishop(_, _) => \"♗\",\n\n Self::Pawn(_, _) => \"♙\",\n\n },\n\n BLACK => match self {\n\n Self::King(_, _) => \"♚\",\n\n Self::Queen(_, _) => \"♛\",\n\n Self::Rook(_, _) => \"♜\",\n\n Self::Knight(_, _) => \"♞\",\n\n Self::Bishop(_, _) => \"♝\",\n\n Self::Pawn(_, _) => \"♟\",\n\n },\n\n }\n\n )\n\n }\n\n}\n","file_path":"src/piece.rs","rank":62,"score":29224.808025467522},{"content":" pub fn is_promoting_pawn(&self) -> bool {\n\n if let Self::Pawn(c, pos) = self {\n\n pos.is_promoting_pawn(*c)\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n /// ### is_queenside_rook\n\n ///\n\n /// Is this piece in the starting position for the queenside rook?\n\n ///\n\n /// This method will only return true for rooks that are in the position\n\n /// of the queenside rook, not for any particular rook.\n\n #[inline]\n\n pub fn is_queenside_rook(&self) -> bool {\n\n if let Self::Rook(_, pos) = self {\n\n pos.is_queenside_rook(self.get_color())\n\n } else {\n\n false\n","file_path":"src/piece.rs","rank":63,"score":29224.80426719736},{"content":"\n\n #[test]\n\n fn is_promoting_pawn() {\n\n assert_eq!(Piece::Pawn(WHITE, G8).is_promoting_pawn(), true);\n\n assert_eq!(Piece::Pawn(WHITE, A1).is_promoting_pawn(), false);\n\n assert_eq!(Piece::Pawn(BLACK, A1).is_promoting_pawn(), true);\n\n assert_eq!(Piece::Pawn(BLACK, G8).is_promoting_pawn(), false);\n\n }\n\n\n\n #[test]\n\n fn is_queenside_rook() {\n\n assert_eq!(Piece::Rook(WHITE, A1).is_queenside_rook(), true);\n\n assert_eq!(Piece::Rook(BLACK, A8).is_queenside_rook(), true);\n\n assert_eq!(Piece::Rook(BLACK, A1).is_queenside_rook(), false);\n\n assert_eq!(Piece::Rook(WHITE, A8).is_queenside_rook(), false);\n\n }\n\n\n\n #[test]\n\n fn is_kingside_rook() {\n\n assert_eq!(Piece::Rook(WHITE, H1).is_kingside_rook(), true);\n","file_path":"src/piece.rs","rank":64,"score":29224.76164521447},{"content":" Self::King(_, _) => 99999,\n\n Self::Queen(_, _) => 9,\n\n Self::Rook(_, _) => 5,\n\n Self::Bishop(_, _) => 3,\n\n Self::Knight(_, _) => 3,\n\n Self::Pawn(_, _) => 1,\n\n }\n\n }\n\n\n\n /// ### get_weighted_value\n\n ///\n\n /// Get the weighted value of a piece. This simply factors in position\n\n /// to the pieces value. For example, a knight that is in the center is\n\n /// more favorable than a knight on the side of the board. Similarly,\n\n /// a king in the center of the board is highly unfavorable compared to\n\n /// a king its respective side.\n\n ///\n\n /// Additionally, the weighted value of the piece is 10 times greater than\n\n /// its material value, plus or minus a weight ranging between 5.0 and -5.0.\n\n #[inline]\n","file_path":"src/piece.rs","rank":65,"score":29224.635297300763},{"content":" King(Color, Position),\n\n Queen(Color, Position),\n\n Rook(Color, Position),\n\n Bishop(Color, Position),\n\n Knight(Color, Position),\n\n Pawn(Color, Position),\n\n}\n\n\n\nconst WHITE_KING_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-2.0, -3.0, -3.0, -4.0, -4.0, -3.0, -3.0, -2.0],\n\n [-1.0, -2.0, -2.0, -2.0, -2.0, -2.0, -2.0, -1.0],\n\n [2.0, 2.0, 0.0, 0.0, 0.0, 0.0, 2.0, 2.0],\n\n [2.0, 3.0, 1.0, 0.0, 0.0, 1.0, 3.0, 2.0],\n\n];\n\n\n\nconst BLACK_KING_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n","file_path":"src/piece.rs","rank":66,"score":29224.274219782983},{"content":" board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(D2, D4)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(C8, B7)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(C1, G5)) {\n\n board = next_board;\n\n }\n\n assert_eq!(\n\n Piece::King(BLACK, E8).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E8, D8),\n\n Move::Piece(E8, F8),\n\n Move::KingSideCastle,\n\n Move::QueenSideCastle\n\n ]\n\n );\n","file_path":"src/piece.rs","rank":67,"score":29224.270436643197},{"content":" }\n\n assert_eq!(\n\n Piece::King(BLACK, E8).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E8, F8),\n\n Move::Piece(E8, E7),\n\n Move::KingSideCastle\n\n ]\n\n );\n\n // Allow also queenside castling\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(D1, A4)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(D8, E7)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(B1, A3)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(B7, B5)) {\n","file_path":"src/piece.rs","rank":68,"score":29224.151241816155},{"content":" if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E8, C8)) {\n\n board = next_board;\n\n }\n\n assert_eq!(\n\n Piece::King(WHITE, E1).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E1, D1),\n\n Move::Piece(E1, F1),\n\n Move::Piece(E1, E2),\n\n Move::Piece(E1, D2),\n\n Move::KingSideCastle,\n\n Move::QueenSideCastle\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_king_legal_moves_check_mate() {\n\n let board: Board = BoardBuilder::default()\n\n .enable_castling()\n","file_path":"src/piece.rs","rank":69,"score":29224.142639692927},{"content":" }\n\n }\n\n\n\n /// ### is_kingside_rook\n\n ///\n\n /// Is this piece in the starting position for the kingside rook?\n\n ///\n\n /// This method will only return true for rooks that are in the position\n\n /// of the kingside rook, not for any particular rook.\n\n #[inline]\n\n pub fn is_kingside_rook(&self) -> bool {\n\n if let Self::Rook(_, pos) = self {\n\n pos.is_kingside_rook(self.get_color())\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n /// ### move_to\n\n ///\n","file_path":"src/piece.rs","rank":70,"score":29224.099836582867},{"content":" pos.next_left().next_above(),\n\n pos.next_left().next_below(),\n\n pos.next_right().next_above(),\n\n pos.next_right().next_below(),\n\n ] {\n\n if p.is_on_board() && !board.has_ally_piece(*p, ally_color) {\n\n result.push(Move::Piece(pos, *p))\n\n }\n\n }\n\n // Castling; don't check with else if, you can sometimes do both moves\n\n if board.can_kingside_castle(ally_color) {\n\n result.push(Move::KingSideCastle);\n\n }\n\n if board.can_queenside_castle(ally_color) {\n\n result.push(Move::QueenSideCastle);\n\n }\n\n result\n\n }\n\n\n\n /// ### get_queen_legal_moves\n","file_path":"src/piece.rs","rank":71,"score":29223.647560212263},{"content":" | Self::Bishop(_, p)\n\n | Self::Knight(_, p)\n\n | Self::Pawn(_, p) => *p,\n\n }\n\n }\n\n\n\n /// ### get_material_value\n\n ///\n\n /// Get the material value for a piece.\n\n /// | Name | Value |\n\n /// |-|-|\n\n /// | King | 99999 |\n\n /// | Queen | 9 |\n\n /// | Rook | 5 |\n\n /// | Bishop | 3 |\n\n /// | Knight | 3 |\n\n /// | Pawn | 1 |\n\n #[inline]\n\n pub fn get_material_value(&self) -> i32 {\n\n match self {\n","file_path":"src/piece.rs","rank":72,"score":29223.62508716112},{"content":" .piece(Piece::Rook(BLACK, G4))\n\n .build();\n\n assert_eq!(\n\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, B1),\n\n Move::Piece(E4, H1),\n\n Move::Piece(E4, C2),\n\n Move::Piece(E4, G2),\n\n Move::Piece(E4, D3),\n\n Move::Piece(E4, F3),\n\n Move::Piece(E4, D5),\n\n Move::Piece(E4, F5),\n\n Move::Piece(E4, C6),\n\n Move::Piece(E4, G6),\n\n Move::Piece(E4, B7),\n\n Move::Piece(E4, H7),\n\n Move::Piece(E4, A8),\n\n Move::Piece(E4, E1),\n\n Move::Piece(E4, E2),\n","file_path":"src/piece.rs","rank":73,"score":29223.42695408107},{"content":" }\n\n }\n\n for col in 0..8 {\n\n let new_pos = Position::new(pos.get_row(), col);\n\n if new_pos != pos\n\n && !board.has_ally_piece(new_pos, ally_color)\n\n && new_pos.is_orthogonal_to(pos)\n\n {\n\n result.push(Move::Piece(pos, new_pos));\n\n }\n\n }\n\n result\n\n }\n\n\n\n /// ### get_bishop_legal_moves\n\n ///\n\n /// Get all legal moves for provided bishop\n\n fn get_bishop_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\n\n let mut result: Vec<Move> = Vec::new();\n\n for row in 0..8 {\n","file_path":"src/piece.rs","rank":74,"score":29223.33648832273},{"content":" for col in 0..8 {\n\n let new_pos = Position::new(row, col);\n\n if new_pos != pos\n\n && !board.has_ally_piece(new_pos, ally_color)\n\n && new_pos.is_diagonal_to(pos)\n\n {\n\n result.push(Move::Piece(pos, new_pos));\n\n }\n\n }\n\n }\n\n result\n\n }\n\n\n\n /// ### get_pawn_legal_moves\n\n ///\n\n /// Get all legal moves for provided pawn\n\n fn get_knight_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\n\n let mut result: Vec<Move> = Vec::new();\n\n for p in &[\n\n pos.next_left().next_left().next_above(),\n","file_path":"src/piece.rs","rank":75,"score":29223.16503050289},{"content":" ///\n\n /// Is this piece a starting pawn?\n\n ///\n\n /// A starting pawn is a pawn that has not been pushed\n\n /// yet whatsoever.\n\n #[inline]\n\n pub fn is_starting_pawn(&self) -> bool {\n\n if let Self::Pawn(c, pos) = self {\n\n pos.is_starting_pawn(*c)\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n /// ### is_promoting_pawn\n\n ///\n\n /// Is this piece a pawn which can be promoted?\n\n ///\n\n /// This means the pawn is at the last rank\n\n #[inline]\n","file_path":"src/piece.rs","rank":76,"score":29222.61026485234},{"content":" ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_king_legal_moves_castling() {\n\n // Kingside Castling (giuoco piano)\n\n let mut board: Board = Board::default();\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E2, E4)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E7, E5)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(G1, F3)) {\n\n board = next_board;\n\n }\n\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(B8, C6)) {\n\n board = next_board;\n\n }\n","file_path":"src/piece.rs","rank":77,"score":29222.60572735765},{"content":" pos.next_left().next_above().next_above(),\n\n pos.next_left().next_left().next_below(),\n\n pos.next_left().next_below().next_below(),\n\n pos.next_right().next_right().next_above(),\n\n pos.next_right().next_above().next_above(),\n\n pos.next_right().next_right().next_below(),\n\n pos.next_right().next_below().next_below(),\n\n ] {\n\n if p.is_on_board() && !board.has_ally_piece(*p, ally_color) {\n\n result.push(Move::Piece(pos, *p))\n\n }\n\n }\n\n result\n\n }\n\n\n\n /// ### is_legal_pawn_move\n\n ///\n\n /// Checks whether provided move is legal for a pawn\n\n fn is_legal_pawn_move(\n\n ally_color: Color,\n","file_path":"src/piece.rs","rank":78,"score":29222.524200140757},{"content":" assert_eq!(\n\n Piece::Rook(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, A4),\n\n Move::Piece(E4, B4),\n\n Move::Piece(E4, C4),\n\n Move::Piece(E4, D4),\n\n Move::Piece(E4, F4),\n\n Move::Piece(E4, G4),\n\n Move::Piece(E4, H4),\n\n ]\n\n );\n\n }\n\n\n\n #[test]\n\n fn get_rook_legal_moves_piece_on_row() {\n","file_path":"src/piece.rs","rank":79,"score":29222.427928246187},{"content":" Piece::Rook(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, E1),\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, E7),\n\n Move::Piece(E4, E8),\n\n Move::Piece(E4, A4),\n\n Move::Piece(E4, B4),\n\n Move::Piece(E4, C4),\n\n Move::Piece(E4, D4),\n\n Move::Piece(E4, F4),\n\n Move::Piece(E4, G4),\n\n Move::Piece(E4, H4),\n\n ]\n\n );\n\n }\n\n\n","file_path":"src/piece.rs","rank":80,"score":29222.41020746314},{"content":"\n\n /// ### is_legal_queen_move\n\n ///\n\n /// Checks whether provided move is legal for a queen\n\n fn is_legal_queen_move(pos: Position, new_pos: Position, board: &Board) -> bool {\n\n // Queen is union of bishop and rook\n\n Self::is_legal_rook_move(pos, new_pos, board)\n\n || Self::is_legal_bishop_move(pos, new_pos, board)\n\n }\n\n\n\n /// ### is_legal_rook_move\n\n ///\n\n /// Checks whether provided move is legal for a rook\n\n fn is_legal_rook_move(pos: Position, new_pos: Position, board: &Board) -> bool {\n\n if pos.is_orthogonal_to(new_pos) {\n\n let mut traveling = pos.orthogonals_to(new_pos);\n\n traveling.pop();\n\n\n\n for pos in traveling {\n\n if board.has_piece(pos) {\n","file_path":"src/piece.rs","rank":81,"score":29222.219635347068},{"content":" .build();\n\n assert_eq!(\n\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\n\n vec![\n\n Move::Piece(E4, B1),\n\n Move::Piece(E4, H1),\n\n Move::Piece(E4, C2),\n\n Move::Piece(E4, G2),\n\n Move::Piece(E4, D3),\n\n Move::Piece(E4, F3),\n\n Move::Piece(E4, D5),\n\n Move::Piece(E4, F5),\n\n Move::Piece(E4, C6),\n\n Move::Piece(E4, G6),\n\n Move::Piece(E4, B7),\n\n Move::Piece(E4, H7),\n\n Move::Piece(E4, A8),\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n","file_path":"src/piece.rs","rank":82,"score":29222.1167762249},{"content":" }\n\n }\n\n true\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n /// ### is_legal_pawn_attack\n\n ///\n\n /// Checks whether provided position is a valid attack for a pawn\n\n fn is_legal_pawn_attack(\n\n ally_color: Color,\n\n pos: Position,\n\n new_pos: Position,\n\n board: &Board,\n\n ) -> bool {\n\n let up = pos.pawn_up(ally_color);\n\n (if let Some(en_passant) = board.get_en_passant() {\n\n (en_passant == up.next_left() || en_passant == up.next_right())\n","file_path":"src/piece.rs","rank":83,"score":29221.724662629706},{"content":"];\n\n\n\nconst BLACK_ROOK_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [0.0, 0.0, 0.0, 0.5, 0.5, 0.0, 0.0, 0.0],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [0.5, 1.0, 1.0, 1.0, 1.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\nconst WHITE_BISHOP_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\n\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\n\n [-1.0, 0.0, 0.5, 1.0, 1.0, 0.5, 0.0, -1.0],\n\n [-1.0, 0.5, 0.5, 1.0, 1.0, 0.5, 0.5, -1.0],\n\n [-1.0, 0.0, 1.0, 1.0, 1.0, 1.0, 0.0, -1.0],\n\n [-1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, -1.0],\n","file_path":"src/piece.rs","rank":84,"score":29221.531584797012},{"content":" [-1.0, 0.5, 0.0, 0.0, 0.0, 0.0, 0.5, -1.0],\n\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\n\n];\n\n\n\nconst BLACK_BISHOP_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\n\n [-1.0, 0.5, 0.0, 0.0, 0.0, 0.0, 0.5, -1.0],\n\n [-1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, -1.0],\n\n [-1.0, 0.0, 1.0, 1.0, 1.0, 1.0, 0.0, -1.0],\n\n [-1.0, 0.5, 0.5, 1.0, 1.0, 0.5, 0.5, -1.0],\n\n [-1.0, 0.0, 0.5, 1.0, 1.0, 0.5, 0.0, -1.0],\n\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\n\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\n\n];\n\n\n\nconst WHITE_KNIGHT_POSITION_WEIGHTS: [[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/piece.rs","rank":85,"score":29221.531584797012},{"content":"const BLACK_QUEEN_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [-1.0, -0.0, -1.0, -0.5, -0.5, -0.5, -1.0, -2.0],\n\n [-1.0, 0.0, 0.5, 0.0, 0.0, 0.0, 0.0, -1.0],\n\n [-1.0, 0.5, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\n\n [0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\n\n [-0.5, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\n\n [-1.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\n\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\n\n [-2.0, -1.0, -1.0, -0.5, -0.5, -1.0, -1.0, -2.0],\n\n];\n\n\n\nconst WHITE_ROOK_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\n\n [0.5, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\n\n [0.0, 0.0, 0.0, 0.5, 0.5, 0.0, 0.0, 0.0],\n","file_path":"src/piece.rs","rank":86,"score":29221.531584797012},{"content":" [-3.0, 0.0, 1.5, 2.0, 2.0, 1.5, 0.0, -3.0],\n\n [-3.0, 0.5, 1.0, 1.5, 1.5, 1.0, 0.5, -3.0],\n\n [-4.0, -2.0, 0.0, 0.5, 0.5, 0.0, -2.0, -4.0],\n\n [-5.0, -4.0, -3.0, -3.0, -3.0, -3.0, -4.0, -5.0],\n\n];\n\n\n\nconst BLACK_KNIGHT_POSITION_WEIGHTS: [[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.5, 0.5, 0.0, -2.0, -4.0],\n\n [-3.0, 0.5, 1.0, 1.5, 1.5, 1.0, 0.5, -3.0],\n\n [-3.0, 0.0, 1.5, 2.0, 2.0, 1.5, 0.0, -3.0],\n\n [-3.0, 0.5, 1.5, 2.0, 2.0, 1.5, 0.5, -3.0],\n\n [-3.0, 0.0, 1.0, 1.5, 1.5, 1.0, 0.0, -3.0],\n\n [-4.0, -2.0, 0.0, 0.0, 0.0, 0.0, -2.0, -4.0],\n\n [-5.0, -4.0, -3.0, -3.0, -3.0, -3.0, -4.0, -5.0],\n\n];\n\n\n\nconst WHITE_PAWN_POSITION_WEIGHTS: [[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","file_path":"src/piece.rs","rank":87,"score":29221.531584797012},{"content":" && (new_pos == en_passant)\n\n } else {\n\n false\n\n }) || new_pos == up.next_left()\n\n || new_pos == up.next_right()\n\n }\n\n\n\n /// ### is_legal_queen_attack\n\n ///\n\n /// Checks whether provided position is a valid attack for a queen\n\n fn is_legal_queen_attack(pos: Position, new_pos: Position, board: &Board) -> bool {\n\n Self::is_legal_rook_attack(pos, new_pos, board)\n\n || Self::is_legal_bishop_attack(pos, new_pos, board)\n\n }\n\n\n\n /// ### is_legal_rook_attack\n\n ///\n\n /// Checks whether provided position is a valid attack for a rook\n\n fn is_legal_rook_attack(pos: Position, new_pos: Position, board: &Board) -> bool {\n\n if pos.is_orthogonal_to(new_pos) {\n","file_path":"src/piece.rs","rank":88,"score":29220.83729282743},{"content":" return false;\n\n }\n\n }\n\n true\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n /// ### is_legal_bishop_move\n\n ///\n\n /// Checks whether provided move is legal for a bishop\n\n fn is_legal_bishop_move(pos: Position, new_pos: Position, board: &Board) -> bool {\n\n if pos.is_diagonal_to(new_pos) {\n\n let mut traveling = pos.diagonals_to(new_pos);\n\n traveling.pop();\n\n\n\n for pos in traveling {\n\n if board.has_piece(pos) {\n\n return false;\n","file_path":"src/piece.rs","rank":89,"score":29220.25597704626},{"content":" let mut traveling = pos.orthogonals_to(new_pos);\n\n traveling.pop();\n\n\n\n for pos in traveling {\n\n if board.has_piece(pos) {\n\n return false;\n\n }\n\n }\n\n true\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n /// ### is_legal_bishop_attack\n\n ///\n\n /// Checks whether provided position is a valid attack for a bishop\n\n fn is_legal_bishop_attack(pos: Position, new_pos: Position, board: &Board) -> bool {\n\n if pos.is_diagonal_to(new_pos) {\n\n let mut traveling = pos.diagonals_to(new_pos);\n","file_path":"src/piece.rs","rank":90,"score":29219.97625706175},{"content":" Move::Piece(E4, D3),\n\n Move::Piece(E4, F3),\n\n Move::Piece(E4, D5),\n\n Move::Piece(E4, F5),\n\n Move::Piece(E4, C6),\n\n Move::Piece(E4, G6),\n\n Move::Piece(E4, B7),\n\n Move::Piece(E4, H7),\n\n Move::Piece(E4, A8),\n\n Move::Piece(E4, E1),\n\n Move::Piece(E4, E2),\n\n Move::Piece(E4, E3),\n\n Move::Piece(E4, E5),\n\n Move::Piece(E4, E6),\n\n Move::Piece(E4, E7),\n\n Move::Piece(E4, E8),\n\n Move::Piece(E4, A4),\n\n Move::Piece(E4, B4),\n\n Move::Piece(E4, C4),\n\n Move::Piece(E4, D4),\n","file_path":"src/piece.rs","rank":91,"score":29219.60848622284},{"content":" [2.0, 3.0, 1.0, 0.0, 0.0, 1.0, 3.0, 2.0],\n\n [2.0, 2.0, 0.0, 0.0, 0.0, 0.0, 2.0, 2.0],\n\n [-1.0, -2.0, -2.0, -2.0, -2.0, -2.0, -2.0, -1.0],\n\n [-2.0, -3.0, -3.0, -4.0, -4.0, -3.0, -3.0, -2.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\n\n];\n\n\n\nconst WHITE_QUEEN_POSITION_WEIGHTS: [[f64; 8]; 8] = [\n\n [-2.0, -1.0, -1.0, -0.5, -0.5, -1.0, -1.0, -2.0],\n\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\n\n [-1.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\n\n [-0.5, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\n\n [0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\n\n [-1.0, 0.5, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\n\n [-1.0, 0.0, 0.5, 0.0, 0.0, 0.0, 0.0, -1.0],\n\n [-1.0, -0.0, -1.0, -0.5, -0.5, -0.5, -1.0, -2.0],\n\n];\n","file_path":"src/piece.rs","rank":92,"score":29218.69896884193},{"content":"pub struct Board {\n\n /// the 64 squares of the chess board\n\n squares: [Square; 64],\n\n /// tracks eventually a possible en passant position\n\n en_passant: Option<Position>,\n\n /// tracks eventually a taken piece on the last turn\n\n taken_piece: Option<Piece>,\n\n /// tracks eventually the possibility to promote a pawn\n\n promotion: Option<Position>,\n\n /// castling rights for white player\n\n white_castling_rights: CastlingRights,\n\n /// castling rights for black player\n\n black_castling_rights: CastlingRights,\n\n /// describes which player has to move the next turn\n\n turn: Color,\n\n}\n\n\n\nimpl Default for Board {\n\n fn default() -> Self {\n\n BoardBuilder::default()\n","file_path":"src/board/mod.rs","rank":94,"score":26471.2700407455},{"content":" }\n\n}\n\n\n\nimpl Board {\n\n // -- constructors\n\n\n\n /// ### empty\n\n ///\n\n /// Create an empty Board\n\n pub fn empty() -> Self {\n\n Self {\n\n squares: [Square::empty(); 64],\n\n en_passant: None,\n\n taken_piece: None,\n\n promotion: None,\n\n white_castling_rights: CastlingRights::default(),\n\n black_castling_rights: CastlingRights::default(),\n\n turn: WHITE,\n\n }\n\n }\n","file_path":"src/board/mod.rs","rank":96,"score":26471.050796231946},{"content":" /// <https://en.wikipedia.org/wiki/Dunsany%27s_chess>\n\n pub fn dunsany() -> Self {\n\n BoardBuilder::from(Board::default())\n\n .row(Piece::Pawn(WHITE, A1))\n\n .row(Piece::Pawn(WHITE, A2))\n\n .row(Piece::Pawn(WHITE, A3))\n\n .row(Piece::Pawn(WHITE, A4))\n\n .player_moving(BLACK)\n\n .build()\n\n }\n\n\n\n // -- getters\n\n\n\n /// ### get_turn\n\n ///\n\n /// Get the color of the current player\n\n #[inline]\n\n pub fn get_turn(&self) -> Color {\n\n self.turn\n\n }\n","file_path":"src/board/mod.rs","rank":98,"score":26468.65082189119}],"string":"[\n {\n \"content\": \"/// ### was_illegal_move\\n\\n///\\n\\n/// Returns whether game result was an illegal move\\n\\npub fn was_illegal_move(res: &GameResult) -> bool {\\n\\n matches!(res, Err(GameError::IllegalMove(_)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/result.rs\",\n \"rank\": 0,\n \"score\": 43371.68225817752\n },\n {\n \"content\": \"/// ### set_result_event\\n\\n///\\n\\n/// Set `GameEvent` to `GameResult`\\n\\npub fn set_result_event(res: GameResult, ev: GameEvent) -> GameResult {\\n\\n match res {\\n\\n Ok((state, mut event)) => {\\n\\n event.insert(ev);\\n\\n Ok((state, event))\\n\\n }\\n\\n Err(err) => Err(err),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n\\n\\n use super::*;\\n\\n use alloc::string::ToString;\\n\\n\\n\\n #[test]\\n\\n fn fmt_game_error() {\\n\\n assert_eq!(\\n\\n GameError::CantPromote.to_string().as_str(),\\n\",\n \"file_path\": \"src/game/result.rs\",\n \"rank\": 1,\n \"score\": 35170.90637594846\n },\n {\n \"content\": \"//! # Square\\n\\n//!\\n\\n//! This module exposes the type to define an individual square of the chess board\\n\\n\\n\\nuse super::Piece;\\n\\n\\n\\n/// ## Square\\n\\n///\\n\\n/// Essentially a container for a single piece on a board.\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]\\n\\npub struct Square {\\n\\n piece: Option<Piece>,\\n\\n}\\n\\n\\n\\nimpl From<Piece> for Square {\\n\\n fn from(piece: Piece) -> Self {\\n\\n Self { piece: Some(piece) }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/square.rs\",\n \"rank\": 2,\n \"score\": 30591.698544494986\n },\n {\n \"content\": \"impl Square {\\n\\n /// ### empty\\n\\n ///\\n\\n /// A constructor for an empty Square\\n\\n pub fn empty() -> Self {\\n\\n Square { piece: None }\\n\\n }\\n\\n\\n\\n /// ### is_empty\\n\\n ///\\n\\n /// Does this square contain a piece?\\n\\n #[inline]\\n\\n pub fn is_empty(&self) -> bool {\\n\\n self.piece == None\\n\\n }\\n\\n\\n\\n /// ### get_piece\\n\\n ///\\n\\n /// Get the piece contained in this square.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/square.rs\",\n \"rank\": 3,\n \"score\": 30587.85574223603\n },\n {\n \"content\": \" pub fn get_piece(&self) -> Option<Piece> {\\n\\n self.piece\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n\\n\\n use super::*;\\n\\n use crate::position::C8;\\n\\n use crate::WHITE;\\n\\n\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn square() {\\n\\n // empty\\n\\n let square: Square = Square::empty();\\n\\n assert_eq!(square.is_empty(), true);\\n\\n assert_eq!(square.get_piece(), None);\\n\\n // from\\n\\n let square: Square = Square::from(Piece::Queen(WHITE, C8));\\n\\n assert_eq!(square.is_empty(), false);\\n\\n assert_eq!(square.get_piece().unwrap().is_queen(), true);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/square.rs\",\n \"rank\": 4,\n \"score\": 30586.80877255293\n },\n {\n \"content\": \" pub fn get_weighted_value(&self) -> f64 {\\n\\n let weights = match self {\\n\\n Self::King(c, _) => match c {\\n\\n Color::White => WHITE_KING_POSITION_WEIGHTS,\\n\\n Color::Black => BLACK_KING_POSITION_WEIGHTS,\\n\\n },\\n\\n Self::Queen(c, _) => match c {\\n\\n Color::White => WHITE_QUEEN_POSITION_WEIGHTS,\\n\\n Color::Black => BLACK_QUEEN_POSITION_WEIGHTS,\\n\\n },\\n\\n Self::Rook(c, _) => match c {\\n\\n Color::White => WHITE_ROOK_POSITION_WEIGHTS,\\n\\n Color::Black => BLACK_ROOK_POSITION_WEIGHTS,\\n\\n },\\n\\n Self::Bishop(c, _) => match c {\\n\\n Color::White => WHITE_BISHOP_POSITION_WEIGHTS,\\n\\n Color::Black => BLACK_BISHOP_POSITION_WEIGHTS,\\n\\n },\\n\\n Self::Knight(c, _) => match c {\\n\\n Color::White => WHITE_KNIGHT_POSITION_WEIGHTS,\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 5,\n \"score\": 29232.04324664953\n },\n {\n \"content\": \"//! # Piece\\n\\n//!\\n\\n//! Exposes the piece type and its related functions\\n\\n\\n\\nuse super::{Board, Color, Move, Position, BLACK, WHITE};\\n\\nuse alloc::vec::Vec;\\n\\n\\n\\n/// ## Piece\\n\\n///\\n\\n/// A piece on a board.\\n\\n///\\n\\n/// Every piece has both a color and a position.\\n\\n/// These, combined with the type of piece it is,\\n\\n/// determine things like\\n\\n/// 1. The validity of legal moves\\n\\n/// 2. The validity of legal attacks\\n\\n/// 3. Move generation\\n\\n/// 4. Material and positional value\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]\\n\\npub enum Piece {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 6,\n \"score\": 29232.00597225396\n },\n {\n \"content\": \" /// Given a piece and a color, create a copy of the given piece, with the provided color\\n\\n #[inline]\\n\\n pub fn with_color(&self, color: Color) -> Self {\\n\\n match *self {\\n\\n Self::King(_, pos) => Self::King(color, pos),\\n\\n Self::Queen(_, pos) => Self::Queen(color, pos),\\n\\n Self::Rook(_, pos) => Self::Rook(color, pos),\\n\\n Self::Bishop(_, pos) => Self::Bishop(color, pos),\\n\\n Self::Knight(_, pos) => Self::Knight(color, pos),\\n\\n Self::Pawn(_, pos) => Self::Pawn(color, pos),\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### get_legal_moves\\n\\n ///\\n\\n /// Get the exhaustive list of legal moves for a given piece.\\n\\n ///\\n\\n /// This is used for move generation.\\n\\n #[inline]\\n\\n pub(crate) fn get_legal_moves(&self, board: &Board) -> Vec<Move> {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 7,\n \"score\": 29231.844448157575\n },\n {\n \"content\": \" Color::Black => BLACK_KNIGHT_POSITION_WEIGHTS,\\n\\n },\\n\\n Self::Pawn(c, _) => match c {\\n\\n Color::White => WHITE_PAWN_POSITION_WEIGHTS,\\n\\n Color::Black => BLACK_PAWN_POSITION_WEIGHTS,\\n\\n },\\n\\n };\\n\\n weights[(7 - self.get_pos().get_row()) as usize][self.get_pos().get_col() as usize]\\n\\n + (self.get_material_value() * 10) as f64\\n\\n }\\n\\n\\n\\n /// ### is_king\\n\\n ///\\n\\n /// Is this piece a king?\\n\\n #[inline]\\n\\n pub fn is_king(&self) -> bool {\\n\\n matches!(self, Self::King(_, _))\\n\\n }\\n\\n\\n\\n /// ### is_queen\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 8,\n \"score\": 29230.996077429772\n },\n {\n \"content\": \" assert_eq!(\\n\\n Piece::Knight(WHITE, H1).with_color(BLACK),\\n\\n Piece::Knight(BLACK, H1)\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::Bishop(WHITE, H1).with_color(BLACK),\\n\\n Piece::Bishop(BLACK, H1)\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::Pawn(WHITE, H1).with_color(BLACK),\\n\\n Piece::Pawn(BLACK, H1)\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::Queen(WHITE, H1).with_color(BLACK),\\n\\n Piece::Queen(BLACK, H1)\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_starting_position() {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 9,\n \"score\": 29230.230584776175\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn get_color() {\\n\\n assert_eq!(Piece::Bishop(WHITE, A1).get_color(), WHITE);\\n\\n assert_eq!(Piece::King(BLACK, A1).get_color(), BLACK);\\n\\n assert_eq!(Piece::Knight(WHITE, A1).get_color(), WHITE);\\n\\n assert_eq!(Piece::Queen(BLACK, A1).get_color(), BLACK);\\n\\n assert_eq!(Piece::Pawn(WHITE, A1).get_color(), WHITE);\\n\\n assert_eq!(Piece::Rook(BLACK, A1).get_color(), BLACK);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pos() {\\n\\n assert_eq!(Piece::Bishop(WHITE, D4).get_pos(), D4);\\n\\n assert_eq!(Piece::King(BLACK, D4).get_pos(), D4);\\n\\n assert_eq!(Piece::Knight(WHITE, D4).get_pos(), D4);\\n\\n assert_eq!(Piece::Queen(BLACK, D4).get_pos(), D4);\\n\\n assert_eq!(Piece::Pawn(WHITE, D4).get_pos(), D4);\\n\\n assert_eq!(Piece::Rook(BLACK, D4).get_pos(), D4);\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 10,\n \"score\": 29229.45308145773\n },\n {\n \"content\": \" // Can take pawn (white)\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(WHITE, E4))\\n\\n .piece(Piece::Pawn(BLACK, D5))\\n\\n .piece(Piece::Pawn(BLACK, F5))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Pawn(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, D5),\\n\\n Move::Piece(E4, F5)\\n\\n ]\\n\\n );\\n\\n // Can take pawn (black)\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(BLACK, E5))\\n\\n .piece(Piece::Pawn(WHITE, D4))\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 11,\n \"score\": 29229.35049064208\n },\n {\n \"content\": \" assert_eq!(Piece::Rook(BLACK, H8).is_kingside_rook(), true);\\n\\n assert_eq!(Piece::Rook(BLACK, H1).is_kingside_rook(), false);\\n\\n assert_eq!(Piece::Rook(WHITE, H8).is_kingside_rook(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn move_to() {\\n\\n assert_eq!(Piece::Rook(WHITE, H1).move_to(H8), Piece::Rook(WHITE, H8));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn with_color() {\\n\\n assert_eq!(\\n\\n Piece::Rook(WHITE, H1).with_color(BLACK),\\n\\n Piece::Rook(BLACK, H1)\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, H1).with_color(BLACK),\\n\\n Piece::King(BLACK, H1)\\n\\n );\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 12,\n \"score\": 29229.1263746419\n },\n {\n \"content\": \" Self::Queen(_, pos) => Self::is_legal_queen_move(pos, new_pos, board),\\n\\n Self::Rook(_, pos) => Self::is_legal_rook_move(pos, new_pos, board),\\n\\n Self::Bishop(_, pos) => Self::is_legal_bishop_move(pos, new_pos, board),\\n\\n Self::Knight(_, pos) => pos.is_knight_move(new_pos),\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### is_legal_attack\\n\\n ///\\n\\n /// Verify that attacking a given square is a legal move.\\n\\n #[inline]\\n\\n pub(crate) fn is_legal_attack(&self, new_pos: Position, board: &Board) -> bool {\\n\\n if board.has_ally_piece(new_pos, self.get_color()) || new_pos.is_off_board() {\\n\\n return false;\\n\\n }\\n\\n\\n\\n match *self {\\n\\n Self::Pawn(ally_color, pos) => {\\n\\n Self::is_legal_pawn_attack(ally_color, pos, new_pos, board)\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 13,\n \"score\": 29229.092341221556\n },\n {\n \"content\": \" .piece(Piece::Rook(BLACK, E8))\\n\\n .piece(Piece::King(WHITE, E1))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Pawn(WHITE, E4).get_legal_moves(&board),\\n\\n vec![Move::Piece(E4, E5)]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_starting_position() {\\n\\n // King without free squares\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E1).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::King(BLACK, E8).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 14,\n \"score\": 29228.812941504242\n },\n {\n \"content\": \" }\\n\\n _ => board.is_legal_move(*x, color),\\n\\n })\\n\\n .collect::<Vec<Move>>()\\n\\n }\\n\\n\\n\\n /// ### is_legal_move\\n\\n ///\\n\\n /// Verify that moving to a new position is a legal move.\\n\\n #[inline]\\n\\n pub(crate) fn is_legal_move(&self, new_pos: Position, board: &Board) -> bool {\\n\\n if board.has_ally_piece(new_pos, self.get_color()) || new_pos.is_off_board() {\\n\\n return false;\\n\\n }\\n\\n\\n\\n match *self {\\n\\n Self::Pawn(ally_color, pos) => {\\n\\n Self::is_legal_pawn_move(ally_color, pos, new_pos, board)\\n\\n }\\n\\n Self::King(_, pos) => pos.is_adjacent_to(new_pos),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 15,\n \"score\": 29228.38723040898\n },\n {\n \"content\": \" let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(WHITE, E4))\\n\\n .piece(Piece::Pawn(WHITE, E5))\\n\\n .build();\\n\\n assert_eq!(Piece::Pawn(WHITE, E4).is_legal_move(E5, &board), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn fmt() {\\n\\n assert_eq!(Piece::Bishop(WHITE, A1).to_string(), \\\"♗\\\");\\n\\n assert_eq!(Piece::Bishop(BLACK, A1).to_string(), \\\"♝\\\");\\n\\n assert_eq!(Piece::King(WHITE, A1).to_string(), \\\"♔\\\");\\n\\n assert_eq!(Piece::King(BLACK, A1).to_string(), \\\"♚\\\");\\n\\n assert_eq!(Piece::Knight(WHITE, A1).to_string(), \\\"♘\\\");\\n\\n assert_eq!(Piece::Knight(BLACK, A1).to_string(), \\\"♞\\\");\\n\\n assert_eq!(Piece::Queen(WHITE, A1).to_string(), \\\"♕\\\");\\n\\n assert_eq!(Piece::Queen(BLACK, A1).to_string(), \\\"♛\\\");\\n\\n assert_eq!(Piece::Pawn(WHITE, A1).to_string(), \\\"♙\\\");\\n\\n assert_eq!(Piece::Pawn(BLACK, A1).to_string(), \\\"♟\\\");\\n\\n assert_eq!(Piece::Rook(WHITE, A1).to_string(), \\\"♖\\\");\\n\\n assert_eq!(Piece::Rook(BLACK, A1).to_string(), \\\"♜\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 16,\n \"score\": 29228.31367121109\n },\n {\n \"content\": \" let result: Vec<Move> = match *self {\\n\\n Self::Pawn(ally_color, pos) => Self::get_pawn_legal_moves(ally_color, pos, board),\\n\\n Self::King(ally_color, pos) => Self::get_king_legal_moves(ally_color, pos, board),\\n\\n Self::Queen(ally_color, pos) => Self::get_queen_legal_moves(ally_color, pos, board),\\n\\n Self::Rook(ally_color, pos) => Self::get_rook_legal_moves(ally_color, pos, board),\\n\\n Self::Bishop(ally_color, pos) => Self::get_bishop_legal_moves(ally_color, pos, board),\\n\\n Self::Knight(ally_color, pos) => Self::get_knight_legal_moves(ally_color, pos, board),\\n\\n };\\n\\n\\n\\n let color = self.get_color();\\n\\n // Filter illegal moves and off-boards from result\\n\\n result\\n\\n .into_iter()\\n\\n .filter(|x| match x {\\n\\n Move::Piece(from, to) => {\\n\\n if from.is_on_board() && to.is_on_board() {\\n\\n board.is_legal_move(*x, color)\\n\\n } else {\\n\\n false\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 17,\n \"score\": 29228.276685560228\n },\n {\n \"content\": \" pub fn get_color(&self) -> Color {\\n\\n match self {\\n\\n Self::King(c, _)\\n\\n | Self::Queen(c, _)\\n\\n | Self::Rook(c, _)\\n\\n | Self::Bishop(c, _)\\n\\n | Self::Knight(c, _)\\n\\n | Self::Pawn(c, _) => *c,\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### get_pos\\n\\n ///\\n\\n /// Get the position of a piece.\\n\\n #[inline]\\n\\n pub fn get_pos(&self) -> Position {\\n\\n match self {\\n\\n Self::King(_, p)\\n\\n | Self::Queen(_, p)\\n\\n | Self::Rook(_, p)\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 18,\n \"score\": 29228.214004019792\n },\n {\n \"content\": \" // Starting pawn (white)\\n\\n assert_eq!(\\n\\n Piece::Pawn(WHITE, E2).get_legal_moves(&Board::default()),\\n\\n vec![Move::Piece(E2, E4), Move::Piece(E2, E3)]\\n\\n );\\n\\n // Starting pawn (black)\\n\\n assert_eq!(\\n\\n Piece::Pawn(BLACK, F7).get_legal_moves(&Board::default()),\\n\\n vec![Move::Piece(F7, F5), Move::Piece(F7, F6)]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_last_position() {\\n\\n // Starting pawn (white)\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(WHITE, H8))\\n\\n .piece(Piece::Pawn(BLACK, A1))\\n\\n .build();\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 19,\n \"score\": 29228.118624956565\n },\n {\n \"content\": \" #[test]\\n\\n fn get_rook_legal_moves_blocked() {\\n\\n assert_eq!(\\n\\n Piece::Rook(WHITE, A1).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::Rook(BLACK, H8).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_rook_legal_moves_piece_on_col() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Rook(WHITE, E4))\\n\\n .piece(Piece::Knight(BLACK, E6))\\n\\n .piece(Piece::Knight(WHITE, E1))\\n\\n .build();\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 20,\n \"score\": 29227.992424167347\n },\n {\n \"content\": \" .piece(Piece::King(WHITE, E1))\\n\\n .piece(Piece::Queen(BLACK, E2))\\n\\n .piece(Piece::Rook(BLACK, E8))\\n\\n .build();\\n\\n assert_eq!(Piece::King(WHITE, E1).get_legal_moves(&board), vec![]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_queen_legal_moves_free() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Queen(WHITE, E4))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, B1),\\n\\n Move::Piece(E4, H1),\\n\\n Move::Piece(E4, C2),\\n\\n Move::Piece(E4, G2),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 21,\n \"score\": 29227.92181914536\n },\n {\n \"content\": \" .piece(Piece::Pawn(WHITE, F4))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Pawn(BLACK, E5).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E5, E4),\\n\\n Move::Piece(E5, D4),\\n\\n Move::Piece(E5, F4)\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_opposite() {\\n\\n // Opposite pawn\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(WHITE, E4))\\n\\n .piece(Piece::Pawn(BLACK, E5))\\n\\n .build();\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 22,\n \"score\": 29227.634315770316\n },\n {\n \"content\": \" /// Change the position of this piece to a new position.\\n\\n ///\\n\\n /// For example, `Pawn(WHITE, E4).move_to(E5)` will result in\\n\\n /// `Pawn(WHITE, E5)`. This does not check for move legality,\\n\\n /// it merely creates a new piece with the same color and type, but\\n\\n /// with a new position.\\n\\n #[inline]\\n\\n pub fn move_to(&self, new_pos: Position) -> Self {\\n\\n match *self {\\n\\n Self::King(c, _) => Self::King(c, new_pos),\\n\\n Self::Queen(c, _) => Self::Queen(c, new_pos),\\n\\n Self::Rook(c, _) => Self::Rook(c, new_pos),\\n\\n Self::Bishop(c, _) => Self::Bishop(c, new_pos),\\n\\n Self::Knight(c, _) => Self::Knight(c, new_pos),\\n\\n Self::Pawn(c, _) => Self::Pawn(c, new_pos),\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### with_color\\n\\n ///\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 23,\n \"score\": 29227.631911746543\n },\n {\n \"content\": \"\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n\\n\\n use super::*;\\n\\n use crate::board::BoardBuilder;\\n\\n use crate::position::*;\\n\\n use crate::MoveResult;\\n\\n\\n\\n use alloc::string::ToString;\\n\\n use pretty_assertions::assert_eq;\\n\\n\\n\\n #[test]\\n\\n fn get_name() {\\n\\n assert_eq!(Piece::Bishop(WHITE, A1).get_name(), \\\"bishop\\\");\\n\\n assert_eq!(Piece::King(WHITE, A1).get_name(), \\\"king\\\");\\n\\n assert_eq!(Piece::Knight(WHITE, A1).get_name(), \\\"knight\\\");\\n\\n assert_eq!(Piece::Queen(WHITE, A1).get_name(), \\\"queen\\\");\\n\\n assert_eq!(Piece::Pawn(WHITE, A1).get_name(), \\\"pawn\\\");\\n\\n assert_eq!(Piece::Rook(WHITE, A1).get_name(), \\\"rook\\\");\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 24,\n \"score\": 29227.4979857439\n },\n {\n \"content\": \" fn get_queen_legal_moves_piece_on_diagonal() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Queen(WHITE, D4))\\n\\n .piece(Piece::Bishop(BLACK, E3))\\n\\n .piece(Piece::Bishop(BLACK, E5))\\n\\n .piece(Piece::Bishop(BLACK, C3))\\n\\n .piece(Piece::Bishop(BLACK, C5))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Queen(WHITE, D4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(D4, C3),\\n\\n Move::Piece(D4, E3),\\n\\n Move::Piece(D4, C5),\\n\\n Move::Piece(D4, E5),\\n\\n Move::Piece(D4, D1),\\n\\n Move::Piece(D4, D2),\\n\\n Move::Piece(D4, D3),\\n\\n Move::Piece(D4, D5),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 25,\n \"score\": 29227.417029317174\n },\n {\n \"content\": \" if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(F7, F5)) {\\n\\n // Black pawn\\n\\n board = next_board;\\n\\n }\\n\\n assert_eq!(\\n\\n Piece::Pawn(WHITE, E5).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E5, F6), // En passant\\n\\n Move::Piece(E5, E6),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_discovered_check() {\\n\\n // Discovered check by rook\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(WHITE, E4))\\n\\n .piece(Piece::Pawn(BLACK, F5)) // Could capture, but discovered check by rook\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 26,\n \"score\": 29227.27915709147\n },\n {\n \"content\": \" Move::Piece(E4, F6),\\n\\n Move::Piece(E4, G3),\\n\\n Move::Piece(E4, F2),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_knight_legal_moves_discovered_check() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Knight(WHITE, E4))\\n\\n .piece(Piece::King(WHITE, B1))\\n\\n .piece(Piece::Bishop(BLACK, H7))\\n\\n .build();\\n\\n assert_eq!(Piece::Knight(WHITE, E4).get_legal_moves(&board), vec![]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_legal_move() {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 27,\n \"score\": 29227.230807400163\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_protected_rook_check() {\\n\\n // King, checked by a protected rook on the left\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::King(WHITE, E5))\\n\\n .piece(Piece::Rook(BLACK, D5))\\n\\n .piece(Piece::Pawn(BLACK, C6))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E5).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E5, E6),\\n\\n Move::Piece(E5, E4),\\n\\n Move::Piece(E5, F6),\\n\\n Move::Piece(E5, F4),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 28,\n \"score\": 29227.217716298248\n },\n {\n \"content\": \" assert_eq!(Piece::Pawn(WHITE, H8).get_legal_moves(&board), vec![]);\\n\\n // Starting pawn (black)\\n\\n assert_eq!(Piece::Pawn(BLACK, A1).get_legal_moves(&board), vec![]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_already_moved() {\\n\\n // Not starting position pawn\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Pawn(WHITE, E3))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Pawn(WHITE, E3).get_legal_moves(&board),\\n\\n vec![Move::Piece(E3, E4)]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_can_take() {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 29,\n \"score\": 29227.128987715627\n },\n {\n \"content\": \" Move::Piece(E4, F2),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_knight_legal_moves_busy() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Knight(WHITE, E4))\\n\\n .piece(Piece::Knight(BLACK, C5))\\n\\n .piece(Piece::Knight(WHITE, D6))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Knight(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, C5),\\n\\n Move::Piece(E4, C3),\\n\\n Move::Piece(E4, D2),\\n\\n Move::Piece(E4, G5),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 30,\n \"score\": 29227.103806244915\n },\n {\n \"content\": \" /// ### get_name\\n\\n ///\\n\\n /// Get the name of the piece such as `\\\"pawn\\\"` or `\\\"king\\\"`.\\n\\n /// All names are lowercase.\\n\\n #[inline]\\n\\n pub fn get_name(&self) -> &'static str {\\n\\n match self {\\n\\n Self::King(_, _) => \\\"king\\\",\\n\\n Self::Queen(_, _) => \\\"queen\\\",\\n\\n Self::Rook(_, _) => \\\"rook\\\",\\n\\n Self::Bishop(_, _) => \\\"bishop\\\",\\n\\n Self::Knight(_, _) => \\\"knight\\\",\\n\\n Self::Pawn(_, _) => \\\"pawn\\\",\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### get_color\\n\\n ///\\n\\n /// Get the color of a given piece.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 31,\n \"score\": 29227.085811905043\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_rook_legal_moves_discovered_check() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Rook(WHITE, E4))\\n\\n .piece(Piece::King(WHITE, E1))\\n\\n .piece(Piece::Rook(BLACK, E7))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Rook(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, E7),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 32,\n \"score\": 29227.039508404538\n },\n {\n \"content\": \" Move::Piece(E4, B7),\\n\\n Move::Piece(E4, A8),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_bishop_legal_moves_discovered_check() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Bishop(WHITE, E4))\\n\\n .piece(Piece::Bishop(BLACK, G6))\\n\\n .piece(Piece::King(WHITE, C2))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Bishop(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, D3),\\n\\n Move::Piece(E4, F5),\\n\\n Move::Piece(E4, G6),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 33,\n \"score\": 29227.039508404538\n },\n {\n \"content\": \" assert_eq!(Piece::Pawn(WHITE, E4).get_legal_moves(&board), vec![]);\\n\\n assert_eq!(Piece::Pawn(BLACK, E5).get_legal_moves(&board), vec![]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_pawn_legal_moves_en_passant() {\\n\\n // En passant - edge case 😈\\n\\n let mut board: Board = Board::default();\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E2, E4)) {\\n\\n // White pawn\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(H7, H5)) {\\n\\n // Black pawn\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E4, E5)) {\\n\\n // White pawn\\n\\n board = next_board;\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 34,\n \"score\": 29226.868239306394\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_rook_on_left() {\\n\\n // King in the middle of the board, rook on the left\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::King(WHITE, E5))\\n\\n .piece(Piece::Rook(BLACK, D8))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E5).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E5, F5),\\n\\n Move::Piece(E5, E6),\\n\\n Move::Piece(E5, E4),\\n\\n Move::Piece(E5, F6),\\n\\n Move::Piece(E5, F4),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 35,\n \"score\": 29226.627418745506\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn get_bishop_legal_moves_piece_on_diagonal() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Bishop(WHITE, E4))\\n\\n .piece(Piece::Bishop(BLACK, G6))\\n\\n .piece(Piece::Pawn(WHITE, C2))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Bishop(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, H1),\\n\\n Move::Piece(E4, G2),\\n\\n Move::Piece(E4, D3),\\n\\n Move::Piece(E4, F3),\\n\\n Move::Piece(E4, D5),\\n\\n Move::Piece(E4, F5),\\n\\n Move::Piece(E4, C6),\\n\\n Move::Piece(E4, G6),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 36,\n \"score\": 29226.547829536576\n },\n {\n \"content\": \"\\n\\n if let Some(en_passant) = board.get_en_passant() {\\n\\n if en_passant == up_left || en_passant == up_right {\\n\\n result.push(Move::Piece(pos, en_passant));\\n\\n }\\n\\n }\\n\\n\\n\\n if next_up.is_on_board()\\n\\n && pos.is_starting_pawn(ally_color)\\n\\n && board.has_no_piece(up)\\n\\n && board.has_no_piece(next_up)\\n\\n {\\n\\n result.push(Move::Piece(pos, next_up))\\n\\n }\\n\\n\\n\\n if up.is_on_board() && board.has_no_piece(up) {\\n\\n result.push(Move::Piece(pos, up))\\n\\n }\\n\\n\\n\\n // Check up_left NOTE: don't use else if, you can have both of them\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 37,\n \"score\": 29226.46169677083\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_free_squares() {\\n\\n // King in the middle of the board, no threatened\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::King(WHITE, E5))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E5).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E5, D5),\\n\\n Move::Piece(E5, F5),\\n\\n Move::Piece(E5, E6),\\n\\n Move::Piece(E5, E4),\\n\\n Move::Piece(E5, D6),\\n\\n Move::Piece(E5, D4),\\n\\n Move::Piece(E5, F6),\\n\\n Move::Piece(E5, F4),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 38,\n \"score\": 29226.453374180204\n },\n {\n \"content\": \" let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Rook(WHITE, E4))\\n\\n .piece(Piece::Queen(BLACK, G4))\\n\\n .piece(Piece::Queen(WHITE, B4))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Rook(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, E1),\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, E7),\\n\\n Move::Piece(E4, E8),\\n\\n Move::Piece(E4, C4),\\n\\n Move::Piece(E4, D4),\\n\\n Move::Piece(E4, F4),\\n\\n Move::Piece(E4, G4),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 39,\n \"score\": 29226.370743604453\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_rook_on_left_can_take() {\\n\\n // King in the middle of the board, rook on the left, can take rook\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::King(WHITE, E5))\\n\\n .piece(Piece::Rook(BLACK, D5))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E5).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E5, D5),\\n\\n Move::Piece(E5, E6),\\n\\n Move::Piece(E5, E4),\\n\\n Move::Piece(E5, F6),\\n\\n Move::Piece(E5, F4),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 40,\n \"score\": 29226.318078367654\n },\n {\n \"content\": \" Move::Piece(E4, E6),\\n\\n Move::Piece(E4, A4),\\n\\n Move::Piece(E4, B4),\\n\\n Move::Piece(E4, C4),\\n\\n Move::Piece(E4, D4),\\n\\n Move::Piece(E4, F4),\\n\\n Move::Piece(E4, G4),\\n\\n Move::Piece(E4, H4),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_queen_legal_moves_discovered_check() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Queen(WHITE, E4))\\n\\n .piece(Piece::King(WHITE, E1))\\n\\n .piece(Piece::Rook(BLACK, E8))\\n\\n .build();\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 41,\n \"score\": 29226.180435247206\n },\n {\n \"content\": \" ///\\n\\n /// Is this piece a queen?\\n\\n #[inline]\\n\\n pub fn is_queen(&self) -> bool {\\n\\n matches!(self, Self::Queen(_, _))\\n\\n }\\n\\n\\n\\n /// ### is_rook\\n\\n ///\\n\\n /// Is this piece a rook?\\n\\n #[inline]\\n\\n pub fn is_rook(&self) -> bool {\\n\\n matches!(self, Self::Rook(_, _))\\n\\n }\\n\\n\\n\\n /// ### is_bishop\\n\\n ///\\n\\n /// Is this piece a bishop?\\n\\n #[inline]\\n\\n pub fn is_bishop(&self) -> bool {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 42,\n \"score\": 29226.12574916975\n },\n {\n \"content\": \" Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, E7),\\n\\n Move::Piece(E4, E8),\\n\\n Move::Piece(E4, C4),\\n\\n Move::Piece(E4, D4),\\n\\n Move::Piece(E4, F4),\\n\\n Move::Piece(E4, G4),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_queen_legal_moves_piece_on_column() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Queen(WHITE, E4))\\n\\n .piece(Piece::Rook(BLACK, E2))\\n\\n .piece(Piece::Rook(BLACK, E6))\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 43,\n \"score\": 29226.096486267794\n },\n {\n \"content\": \" matches!(self, Self::Bishop(_, _))\\n\\n }\\n\\n\\n\\n /// ### is_knight\\n\\n ///\\n\\n /// Is this piece a knight?\\n\\n #[inline]\\n\\n pub fn is_knight(&self) -> bool {\\n\\n matches!(self, Self::Knight(_, _))\\n\\n }\\n\\n\\n\\n /// ### is_pawn\\n\\n ///\\n\\n /// Is this piece a pawn?\\n\\n #[inline]\\n\\n pub fn is_pawn(&self) -> bool {\\n\\n matches!(self, Self::Pawn(_, _))\\n\\n }\\n\\n\\n\\n /// ### is_starting_pawn\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 44,\n \"score\": 29225.78023227874\n },\n {\n \"content\": \" ///\\n\\n /// Get all legal moves for provided queen\\n\\n fn get_queen_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\\n\\n let mut result = Self::get_bishop_legal_moves(ally_color, pos, board);\\n\\n result.extend(Self::get_rook_legal_moves(ally_color, pos, board));\\n\\n result\\n\\n }\\n\\n\\n\\n /// ### get_rook_legal_moves\\n\\n ///\\n\\n /// Get all legal moves for provided rook\\n\\n fn get_rook_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\\n\\n let mut result: Vec<Move> = Vec::new();\\n\\n for row in 0..8 {\\n\\n let new_pos = Position::new(row, pos.get_col());\\n\\n if new_pos != pos\\n\\n && !board.has_ally_piece(new_pos, ally_color)\\n\\n && new_pos.is_orthogonal_to(pos)\\n\\n {\\n\\n result.push(Move::Piece(pos, new_pos));\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 45,\n \"score\": 29225.713754255867\n },\n {\n \"content\": \" [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.5, -1.0, -2.0, -2.0, 1.0, 1.5, 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\\nconst BLACK_PAWN_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\\n\\n [0.5, 1.5, -1.0, -2.0, -2.0, 1.0, 1.5, 0.5],\\n\\n [0.5, -0.5, -1.0, 0.0, 0.0, -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, 2.5, 2.5, 1.0, 0.5, 0.5],\\n\\n [1.0, 1.0, 2.0, 3.0, 3.0, 2.0, 1.0, 1.0],\\n\\n [5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0],\\n\\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\\n\\n];\\n\\n\\n\\nimpl Piece {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 46,\n \"score\": 29225.66837081951\n },\n {\n \"content\": \" pos: Position,\\n\\n new_pos: Position,\\n\\n board: &Board,\\n\\n ) -> bool {\\n\\n let up = pos.pawn_up(ally_color);\\n\\n let up_left = up.next_left();\\n\\n let up_right = up.next_right();\\n\\n\\n\\n (if let Some(en_passant) = board.get_en_passant() {\\n\\n (en_passant == up_left || en_passant == up_right) && (new_pos == en_passant)\\n\\n } else {\\n\\n false\\n\\n }) || (pos.is_starting_pawn(ally_color)\\n\\n && board.has_no_piece(new_pos)\\n\\n && board.has_no_piece(up)\\n\\n && new_pos == up.pawn_up(ally_color))\\n\\n || (board.has_enemy_piece(new_pos, ally_color) && new_pos == up_left)\\n\\n || (board.has_enemy_piece(new_pos, ally_color) && new_pos == up_right)\\n\\n || (board.has_no_piece(new_pos) && new_pos == up)\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 47,\n \"score\": 29225.53654029442\n },\n {\n \"content\": \" assert_eq!(Piece::Knight(BLACK, C2).is_knight(), true);\\n\\n assert_eq!(Piece::Rook(WHITE, D4).is_knight(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_starting_pawn() {\\n\\n // White pawns\\n\\n assert_eq!(Piece::Pawn(WHITE, B2).is_starting_pawn(), true);\\n\\n assert_eq!(Piece::Pawn(WHITE, C2).is_starting_pawn(), true);\\n\\n assert_eq!(Piece::Pawn(BLACK, B2).is_starting_pawn(), false);\\n\\n assert_eq!(Piece::Pawn(BLACK, C2).is_starting_pawn(), false);\\n\\n // Black pawns\\n\\n assert_eq!(Piece::Pawn(BLACK, B7).is_starting_pawn(), true);\\n\\n assert_eq!(Piece::Pawn(BLACK, C7).is_starting_pawn(), true);\\n\\n assert_eq!(Piece::Pawn(WHITE, B7).is_starting_pawn(), false);\\n\\n assert_eq!(Piece::Pawn(WHITE, C7).is_starting_pawn(), false);\\n\\n // others\\n\\n assert_eq!(Piece::Queen(WHITE, C2).is_starting_pawn(), false);\\n\\n assert_eq!(Piece::Bishop(BLACK, C7).is_starting_pawn(), false);\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 48,\n \"score\": 29225.43455710727\n },\n {\n \"content\": \" traveling.pop();\\n\\n\\n\\n for pos in traveling {\\n\\n if board.has_piece(pos) {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl core::fmt::Display for Piece {\\n\\n fn fmt(&self, f: &mut core::fmt::Formatter) -> Result<(), core::fmt::Error> {\\n\\n write!(\\n\\n f,\\n\\n \\\"{}\\\",\\n\\n match self.get_color() {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 49,\n \"score\": 29225.406064705665\n },\n {\n \"content\": \" Move::Piece(E4, F4),\\n\\n Move::Piece(E4, G4),\\n\\n Move::Piece(E4, H4),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_queen_legal_moves_blocked() {\\n\\n assert_eq!(\\n\\n Piece::Queen(WHITE, D1).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::Queen(BLACK, D8).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 50,\n \"score\": 29225.334989757404\n },\n {\n \"content\": \" Move::Piece(D4, D6),\\n\\n Move::Piece(D4, D7),\\n\\n Move::Piece(D4, D8),\\n\\n Move::Piece(D4, A4),\\n\\n Move::Piece(D4, B4),\\n\\n Move::Piece(D4, C4),\\n\\n Move::Piece(D4, E4),\\n\\n Move::Piece(D4, F4),\\n\\n Move::Piece(D4, G4),\\n\\n Move::Piece(D4, H4),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_queen_legal_moves_piece_on_line() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Queen(WHITE, E4))\\n\\n .piece(Piece::Rook(BLACK, C4))\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 51,\n \"score\": 29225.27363302383\n },\n {\n \"content\": \" if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(F1, C4)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(F8, C5)) {\\n\\n board = next_board;\\n\\n }\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E1).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E1, F1),\\n\\n Move::Piece(E1, E2),\\n\\n Move::KingSideCastle, // Castle\\n\\n ]\\n\\n );\\n\\n // Also black can castle now\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(C2, C3)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(G8, F6)) {\\n\\n board = next_board;\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 52,\n \"score\": 29225.260216093637\n },\n {\n \"content\": \" assert_eq!(Piece::Queen(WHITE, F6).get_weighted_value(), 90.5);\\n\\n assert_eq!(Piece::Queen(BLACK, F6).get_weighted_value(), 90.5);\\n\\n assert_eq!(Piece::Pawn(WHITE, H4).get_weighted_value(), 10.0);\\n\\n assert_eq!(Piece::Pawn(BLACK, H4).get_weighted_value(), 10.5);\\n\\n assert_eq!(Piece::Rook(WHITE, A2).get_weighted_value(), 49.5);\\n\\n assert_eq!(Piece::Rook(BLACK, A2).get_weighted_value(), 50.5);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_king() {\\n\\n assert_eq!(Piece::King(WHITE, D4).is_king(), true);\\n\\n assert_eq!(Piece::Bishop(BLACK, C2).is_king(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_queen() {\\n\\n assert_eq!(Piece::Queen(WHITE, D4).is_queen(), true);\\n\\n assert_eq!(Piece::Bishop(BLACK, C2).is_queen(), false);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 53,\n \"score\": 29225.1682628821\n },\n {\n \"content\": \" Self::King(_, pos) => pos.is_adjacent_to(new_pos),\\n\\n Self::Queen(_, pos) => Self::is_legal_queen_attack(pos, new_pos, board),\\n\\n Self::Rook(_, pos) => Self::is_legal_rook_attack(pos, new_pos, board),\\n\\n Self::Bishop(_, pos) => Self::is_legal_bishop_attack(pos, new_pos, board),\\n\\n\\n\\n Self::Knight(_, pos) => pos.is_knight_move(new_pos),\\n\\n }\\n\\n }\\n\\n\\n\\n // -- private\\n\\n\\n\\n /// ### get_pawn_legal_moves\\n\\n ///\\n\\n /// Get all legal moves for provided pawn\\n\\n fn get_pawn_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\\n\\n let mut result: Vec<Move> = Vec::new();\\n\\n let up = pos.pawn_up(ally_color);\\n\\n let next_up = up.pawn_up(ally_color);\\n\\n let up_left = up.next_left();\\n\\n let up_right = up.next_right();\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 54,\n \"score\": 29225.003969997786\n },\n {\n \"content\": \" assert_eq!(\\n\\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, E7),\\n\\n Move::Piece(E4, E8),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_rook_legal_moves_free() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Rook(WHITE, E4))\\n\\n .build();\\n\\n assert_eq!(\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 55,\n \"score\": 29225.003083389416\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_knight_legal_moves_free() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Knight(WHITE, E4))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Knight(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, C5),\\n\\n Move::Piece(E4, D6),\\n\\n Move::Piece(E4, C3),\\n\\n Move::Piece(E4, D2),\\n\\n Move::Piece(E4, G5),\\n\\n Move::Piece(E4, F6),\\n\\n Move::Piece(E4, G3),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 56,\n \"score\": 29224.987534190772\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_bishop_legal_moves_free() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\\n .piece(Piece::Bishop(WHITE, E4))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Bishop(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, B1),\\n\\n Move::Piece(E4, H1),\\n\\n Move::Piece(E4, C2),\\n\\n Move::Piece(E4, G2),\\n\\n Move::Piece(E4, D3),\\n\\n Move::Piece(E4, F3),\\n\\n Move::Piece(E4, D5),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 57,\n \"score\": 29224.987534190772\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn get_material_value() {\\n\\n assert_eq!(Piece::Bishop(WHITE, D4).get_material_value(), 3);\\n\\n assert_eq!(Piece::King(BLACK, D4).get_material_value(), 99999);\\n\\n assert_eq!(Piece::Knight(WHITE, D4).get_material_value(), 3);\\n\\n assert_eq!(Piece::Queen(BLACK, D4).get_material_value(), 9);\\n\\n assert_eq!(Piece::Pawn(WHITE, D4).get_material_value(), 1);\\n\\n assert_eq!(Piece::Rook(BLACK, D4).get_material_value(), 5);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_weighted_value() {\\n\\n assert_eq!(Piece::Bishop(WHITE, C2).get_weighted_value(), 30.0);\\n\\n assert_eq!(Piece::Bishop(BLACK, C2).get_weighted_value(), 30.0);\\n\\n assert_eq!(Piece::King(WHITE, D4).get_weighted_value(), 999986.0);\\n\\n assert_eq!(Piece::King(BLACK, D4).get_weighted_value(), 999985.0);\\n\\n assert_eq!(Piece::Knight(WHITE, E5).get_weighted_value(), 32.0);\\n\\n assert_eq!(Piece::Knight(BLACK, E5).get_weighted_value(), 32.0);\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 58,\n \"score\": 29224.97609444461\n },\n {\n \"content\": \" Move::Piece(E4, F5),\\n\\n Move::Piece(E4, C6),\\n\\n Move::Piece(E4, G6),\\n\\n Move::Piece(E4, B7),\\n\\n Move::Piece(E4, H7),\\n\\n Move::Piece(E4, A8),\\n\\n ]\\n\\n );\\n\\n }\\n\\n #[test]\\n\\n fn get_bishop_legal_moves_blocked() {\\n\\n assert_eq!(\\n\\n Piece::Bishop(WHITE, C1).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n assert_eq!(\\n\\n Piece::Bishop(BLACK, F8).get_legal_moves(&Board::default()),\\n\\n vec![]\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 59,\n \"score\": 29224.888958025982\n },\n {\n \"content\": \" if up_left.is_on_board() && board.has_enemy_piece(up_left, ally_color) {\\n\\n result.push(Move::Piece(pos, up.next_left()))\\n\\n }\\n\\n // Check up_right\\n\\n if up_right.is_on_board() && board.has_enemy_piece(up.next_right(), ally_color) {\\n\\n result.push(Move::Piece(pos, up.next_right()))\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n /// ### get_king_legal_moves\\n\\n ///\\n\\n /// Get all legal moves for provided king\\n\\n fn get_king_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\\n\\n let mut result: Vec<Move> = Vec::new();\\n\\n for p in &[\\n\\n pos.next_left(),\\n\\n pos.next_right(),\\n\\n pos.next_above(),\\n\\n pos.next_below(),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 60,\n \"score\": 29224.860142345944\n },\n {\n \"content\": \" #[test]\\n\\n fn is_rook() {\\n\\n assert_eq!(Piece::Rook(WHITE, D4).is_rook(), true);\\n\\n assert_eq!(Piece::Bishop(BLACK, C2).is_rook(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_bishop() {\\n\\n assert_eq!(Piece::Bishop(BLACK, C2).is_bishop(), true);\\n\\n assert_eq!(Piece::Rook(WHITE, D4).is_bishop(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_pawn() {\\n\\n assert_eq!(Piece::Pawn(BLACK, C2).is_pawn(), true);\\n\\n assert_eq!(Piece::Rook(WHITE, D4).is_pawn(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_knight() {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 61,\n \"score\": 29224.85484116587\n },\n {\n \"content\": \" WHITE => match self {\\n\\n Self::King(_, _) => \\\"♔\\\",\\n\\n Self::Queen(_, _) => \\\"♕\\\",\\n\\n Self::Rook(_, _) => \\\"♖\\\",\\n\\n Self::Knight(_, _) => \\\"♘\\\",\\n\\n Self::Bishop(_, _) => \\\"♗\\\",\\n\\n Self::Pawn(_, _) => \\\"♙\\\",\\n\\n },\\n\\n BLACK => match self {\\n\\n Self::King(_, _) => \\\"♚\\\",\\n\\n Self::Queen(_, _) => \\\"♛\\\",\\n\\n Self::Rook(_, _) => \\\"♜\\\",\\n\\n Self::Knight(_, _) => \\\"♞\\\",\\n\\n Self::Bishop(_, _) => \\\"♝\\\",\\n\\n Self::Pawn(_, _) => \\\"♟\\\",\\n\\n },\\n\\n }\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 62,\n \"score\": 29224.808025467522\n },\n {\n \"content\": \" pub fn is_promoting_pawn(&self) -> bool {\\n\\n if let Self::Pawn(c, pos) = self {\\n\\n pos.is_promoting_pawn(*c)\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### is_queenside_rook\\n\\n ///\\n\\n /// Is this piece in the starting position for the queenside rook?\\n\\n ///\\n\\n /// This method will only return true for rooks that are in the position\\n\\n /// of the queenside rook, not for any particular rook.\\n\\n #[inline]\\n\\n pub fn is_queenside_rook(&self) -> bool {\\n\\n if let Self::Rook(_, pos) = self {\\n\\n pos.is_queenside_rook(self.get_color())\\n\\n } else {\\n\\n false\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 63,\n \"score\": 29224.80426719736\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn is_promoting_pawn() {\\n\\n assert_eq!(Piece::Pawn(WHITE, G8).is_promoting_pawn(), true);\\n\\n assert_eq!(Piece::Pawn(WHITE, A1).is_promoting_pawn(), false);\\n\\n assert_eq!(Piece::Pawn(BLACK, A1).is_promoting_pawn(), true);\\n\\n assert_eq!(Piece::Pawn(BLACK, G8).is_promoting_pawn(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_queenside_rook() {\\n\\n assert_eq!(Piece::Rook(WHITE, A1).is_queenside_rook(), true);\\n\\n assert_eq!(Piece::Rook(BLACK, A8).is_queenside_rook(), true);\\n\\n assert_eq!(Piece::Rook(BLACK, A1).is_queenside_rook(), false);\\n\\n assert_eq!(Piece::Rook(WHITE, A8).is_queenside_rook(), false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn is_kingside_rook() {\\n\\n assert_eq!(Piece::Rook(WHITE, H1).is_kingside_rook(), true);\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 64,\n \"score\": 29224.76164521447\n },\n {\n \"content\": \" Self::King(_, _) => 99999,\\n\\n Self::Queen(_, _) => 9,\\n\\n Self::Rook(_, _) => 5,\\n\\n Self::Bishop(_, _) => 3,\\n\\n Self::Knight(_, _) => 3,\\n\\n Self::Pawn(_, _) => 1,\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### get_weighted_value\\n\\n ///\\n\\n /// Get the weighted value of a piece. This simply factors in position\\n\\n /// to the pieces value. For example, a knight that is in the center is\\n\\n /// more favorable than a knight on the side of the board. Similarly,\\n\\n /// a king in the center of the board is highly unfavorable compared to\\n\\n /// a king its respective side.\\n\\n ///\\n\\n /// Additionally, the weighted value of the piece is 10 times greater than\\n\\n /// its material value, plus or minus a weight ranging between 5.0 and -5.0.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 65,\n \"score\": 29224.635297300763\n },\n {\n \"content\": \" King(Color, Position),\\n\\n Queen(Color, Position),\\n\\n Rook(Color, Position),\\n\\n Bishop(Color, Position),\\n\\n Knight(Color, Position),\\n\\n Pawn(Color, Position),\\n\\n}\\n\\n\\n\\nconst WHITE_KING_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-2.0, -3.0, -3.0, -4.0, -4.0, -3.0, -3.0, -2.0],\\n\\n [-1.0, -2.0, -2.0, -2.0, -2.0, -2.0, -2.0, -1.0],\\n\\n [2.0, 2.0, 0.0, 0.0, 0.0, 0.0, 2.0, 2.0],\\n\\n [2.0, 3.0, 1.0, 0.0, 0.0, 1.0, 3.0, 2.0],\\n\\n];\\n\\n\\n\\nconst BLACK_KING_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 66,\n \"score\": 29224.274219782983\n },\n {\n \"content\": \" board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(D2, D4)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(C8, B7)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(C1, G5)) {\\n\\n board = next_board;\\n\\n }\\n\\n assert_eq!(\\n\\n Piece::King(BLACK, E8).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E8, D8),\\n\\n Move::Piece(E8, F8),\\n\\n Move::KingSideCastle,\\n\\n Move::QueenSideCastle\\n\\n ]\\n\\n );\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 67,\n \"score\": 29224.270436643197\n },\n {\n \"content\": \" }\\n\\n assert_eq!(\\n\\n Piece::King(BLACK, E8).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E8, F8),\\n\\n Move::Piece(E8, E7),\\n\\n Move::KingSideCastle\\n\\n ]\\n\\n );\\n\\n // Allow also queenside castling\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(D1, A4)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(D8, E7)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(B1, A3)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(B7, B5)) {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 68,\n \"score\": 29224.151241816155\n },\n {\n \"content\": \" if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E8, C8)) {\\n\\n board = next_board;\\n\\n }\\n\\n assert_eq!(\\n\\n Piece::King(WHITE, E1).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E1, D1),\\n\\n Move::Piece(E1, F1),\\n\\n Move::Piece(E1, E2),\\n\\n Move::Piece(E1, D2),\\n\\n Move::KingSideCastle,\\n\\n Move::QueenSideCastle\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_check_mate() {\\n\\n let board: Board = BoardBuilder::default()\\n\\n .enable_castling()\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 69,\n \"score\": 29224.142639692927\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /// ### is_kingside_rook\\n\\n ///\\n\\n /// Is this piece in the starting position for the kingside rook?\\n\\n ///\\n\\n /// This method will only return true for rooks that are in the position\\n\\n /// of the kingside rook, not for any particular rook.\\n\\n #[inline]\\n\\n pub fn is_kingside_rook(&self) -> bool {\\n\\n if let Self::Rook(_, pos) = self {\\n\\n pos.is_kingside_rook(self.get_color())\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### move_to\\n\\n ///\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 70,\n \"score\": 29224.099836582867\n },\n {\n \"content\": \" pos.next_left().next_above(),\\n\\n pos.next_left().next_below(),\\n\\n pos.next_right().next_above(),\\n\\n pos.next_right().next_below(),\\n\\n ] {\\n\\n if p.is_on_board() && !board.has_ally_piece(*p, ally_color) {\\n\\n result.push(Move::Piece(pos, *p))\\n\\n }\\n\\n }\\n\\n // Castling; don't check with else if, you can sometimes do both moves\\n\\n if board.can_kingside_castle(ally_color) {\\n\\n result.push(Move::KingSideCastle);\\n\\n }\\n\\n if board.can_queenside_castle(ally_color) {\\n\\n result.push(Move::QueenSideCastle);\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n /// ### get_queen_legal_moves\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 71,\n \"score\": 29223.647560212263\n },\n {\n \"content\": \" | Self::Bishop(_, p)\\n\\n | Self::Knight(_, p)\\n\\n | Self::Pawn(_, p) => *p,\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### get_material_value\\n\\n ///\\n\\n /// Get the material value for a piece.\\n\\n /// | Name | Value |\\n\\n /// |-|-|\\n\\n /// | King | 99999 |\\n\\n /// | Queen | 9 |\\n\\n /// | Rook | 5 |\\n\\n /// | Bishop | 3 |\\n\\n /// | Knight | 3 |\\n\\n /// | Pawn | 1 |\\n\\n #[inline]\\n\\n pub fn get_material_value(&self) -> i32 {\\n\\n match self {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 72,\n \"score\": 29223.62508716112\n },\n {\n \"content\": \" .piece(Piece::Rook(BLACK, G4))\\n\\n .build();\\n\\n assert_eq!(\\n\\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, B1),\\n\\n Move::Piece(E4, H1),\\n\\n Move::Piece(E4, C2),\\n\\n Move::Piece(E4, G2),\\n\\n Move::Piece(E4, D3),\\n\\n Move::Piece(E4, F3),\\n\\n Move::Piece(E4, D5),\\n\\n Move::Piece(E4, F5),\\n\\n Move::Piece(E4, C6),\\n\\n Move::Piece(E4, G6),\\n\\n Move::Piece(E4, B7),\\n\\n Move::Piece(E4, H7),\\n\\n Move::Piece(E4, A8),\\n\\n Move::Piece(E4, E1),\\n\\n Move::Piece(E4, E2),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 73,\n \"score\": 29223.42695408107\n },\n {\n \"content\": \" }\\n\\n }\\n\\n for col in 0..8 {\\n\\n let new_pos = Position::new(pos.get_row(), col);\\n\\n if new_pos != pos\\n\\n && !board.has_ally_piece(new_pos, ally_color)\\n\\n && new_pos.is_orthogonal_to(pos)\\n\\n {\\n\\n result.push(Move::Piece(pos, new_pos));\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n /// ### get_bishop_legal_moves\\n\\n ///\\n\\n /// Get all legal moves for provided bishop\\n\\n fn get_bishop_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\\n\\n let mut result: Vec<Move> = Vec::new();\\n\\n for row in 0..8 {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 74,\n \"score\": 29223.33648832273\n },\n {\n \"content\": \" for col in 0..8 {\\n\\n let new_pos = Position::new(row, col);\\n\\n if new_pos != pos\\n\\n && !board.has_ally_piece(new_pos, ally_color)\\n\\n && new_pos.is_diagonal_to(pos)\\n\\n {\\n\\n result.push(Move::Piece(pos, new_pos));\\n\\n }\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n /// ### get_pawn_legal_moves\\n\\n ///\\n\\n /// Get all legal moves for provided pawn\\n\\n fn get_knight_legal_moves(ally_color: Color, pos: Position, board: &Board) -> Vec<Move> {\\n\\n let mut result: Vec<Move> = Vec::new();\\n\\n for p in &[\\n\\n pos.next_left().next_left().next_above(),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 75,\n \"score\": 29223.16503050289\n },\n {\n \"content\": \" ///\\n\\n /// Is this piece a starting pawn?\\n\\n ///\\n\\n /// A starting pawn is a pawn that has not been pushed\\n\\n /// yet whatsoever.\\n\\n #[inline]\\n\\n pub fn is_starting_pawn(&self) -> bool {\\n\\n if let Self::Pawn(c, pos) = self {\\n\\n pos.is_starting_pawn(*c)\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### is_promoting_pawn\\n\\n ///\\n\\n /// Is this piece a pawn which can be promoted?\\n\\n ///\\n\\n /// This means the pawn is at the last rank\\n\\n #[inline]\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 76,\n \"score\": 29222.61026485234\n },\n {\n \"content\": \" ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_king_legal_moves_castling() {\\n\\n // Kingside Castling (giuoco piano)\\n\\n let mut board: Board = Board::default();\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E2, E4)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(E7, E5)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(G1, F3)) {\\n\\n board = next_board;\\n\\n }\\n\\n if let MoveResult::Continuing(next_board) = board.play_move(Move::Piece(B8, C6)) {\\n\\n board = next_board;\\n\\n }\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 77,\n \"score\": 29222.60572735765\n },\n {\n \"content\": \" pos.next_left().next_above().next_above(),\\n\\n pos.next_left().next_left().next_below(),\\n\\n pos.next_left().next_below().next_below(),\\n\\n pos.next_right().next_right().next_above(),\\n\\n pos.next_right().next_above().next_above(),\\n\\n pos.next_right().next_right().next_below(),\\n\\n pos.next_right().next_below().next_below(),\\n\\n ] {\\n\\n if p.is_on_board() && !board.has_ally_piece(*p, ally_color) {\\n\\n result.push(Move::Piece(pos, *p))\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n /// ### is_legal_pawn_move\\n\\n ///\\n\\n /// Checks whether provided move is legal for a pawn\\n\\n fn is_legal_pawn_move(\\n\\n ally_color: Color,\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 78,\n \"score\": 29222.524200140757\n },\n {\n \"content\": \" assert_eq!(\\n\\n Piece::Rook(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, A4),\\n\\n Move::Piece(E4, B4),\\n\\n Move::Piece(E4, C4),\\n\\n Move::Piece(E4, D4),\\n\\n Move::Piece(E4, F4),\\n\\n Move::Piece(E4, G4),\\n\\n Move::Piece(E4, H4),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn get_rook_legal_moves_piece_on_row() {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 79,\n \"score\": 29222.427928246187\n },\n {\n \"content\": \" Piece::Rook(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, E1),\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, E7),\\n\\n Move::Piece(E4, E8),\\n\\n Move::Piece(E4, A4),\\n\\n Move::Piece(E4, B4),\\n\\n Move::Piece(E4, C4),\\n\\n Move::Piece(E4, D4),\\n\\n Move::Piece(E4, F4),\\n\\n Move::Piece(E4, G4),\\n\\n Move::Piece(E4, H4),\\n\\n ]\\n\\n );\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 80,\n \"score\": 29222.41020746314\n },\n {\n \"content\": \"\\n\\n /// ### is_legal_queen_move\\n\\n ///\\n\\n /// Checks whether provided move is legal for a queen\\n\\n fn is_legal_queen_move(pos: Position, new_pos: Position, board: &Board) -> bool {\\n\\n // Queen is union of bishop and rook\\n\\n Self::is_legal_rook_move(pos, new_pos, board)\\n\\n || Self::is_legal_bishop_move(pos, new_pos, board)\\n\\n }\\n\\n\\n\\n /// ### is_legal_rook_move\\n\\n ///\\n\\n /// Checks whether provided move is legal for a rook\\n\\n fn is_legal_rook_move(pos: Position, new_pos: Position, board: &Board) -> bool {\\n\\n if pos.is_orthogonal_to(new_pos) {\\n\\n let mut traveling = pos.orthogonals_to(new_pos);\\n\\n traveling.pop();\\n\\n\\n\\n for pos in traveling {\\n\\n if board.has_piece(pos) {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 81,\n \"score\": 29222.219635347068\n },\n {\n \"content\": \" .build();\\n\\n assert_eq!(\\n\\n Piece::Queen(WHITE, E4).get_legal_moves(&board),\\n\\n vec![\\n\\n Move::Piece(E4, B1),\\n\\n Move::Piece(E4, H1),\\n\\n Move::Piece(E4, C2),\\n\\n Move::Piece(E4, G2),\\n\\n Move::Piece(E4, D3),\\n\\n Move::Piece(E4, F3),\\n\\n Move::Piece(E4, D5),\\n\\n Move::Piece(E4, F5),\\n\\n Move::Piece(E4, C6),\\n\\n Move::Piece(E4, G6),\\n\\n Move::Piece(E4, B7),\\n\\n Move::Piece(E4, H7),\\n\\n Move::Piece(E4, A8),\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 82,\n \"score\": 29222.1167762249\n },\n {\n \"content\": \" }\\n\\n }\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### is_legal_pawn_attack\\n\\n ///\\n\\n /// Checks whether provided position is a valid attack for a pawn\\n\\n fn is_legal_pawn_attack(\\n\\n ally_color: Color,\\n\\n pos: Position,\\n\\n new_pos: Position,\\n\\n board: &Board,\\n\\n ) -> bool {\\n\\n let up = pos.pawn_up(ally_color);\\n\\n (if let Some(en_passant) = board.get_en_passant() {\\n\\n (en_passant == up.next_left() || en_passant == up.next_right())\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 83,\n \"score\": 29221.724662629706\n },\n {\n \"content\": \"];\\n\\n\\n\\nconst BLACK_ROOK_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [0.0, 0.0, 0.0, 0.5, 0.5, 0.0, 0.0, 0.0],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [0.5, 1.0, 1.0, 1.0, 1.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\\nconst WHITE_BISHOP_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\\n\\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\\n\\n [-1.0, 0.0, 0.5, 1.0, 1.0, 0.5, 0.0, -1.0],\\n\\n [-1.0, 0.5, 0.5, 1.0, 1.0, 0.5, 0.5, -1.0],\\n\\n [-1.0, 0.0, 1.0, 1.0, 1.0, 1.0, 0.0, -1.0],\\n\\n [-1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, -1.0],\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 84,\n \"score\": 29221.531584797012\n },\n {\n \"content\": \" [-1.0, 0.5, 0.0, 0.0, 0.0, 0.0, 0.5, -1.0],\\n\\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\\n\\n];\\n\\n\\n\\nconst BLACK_BISHOP_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\\n\\n [-1.0, 0.5, 0.0, 0.0, 0.0, 0.0, 0.5, -1.0],\\n\\n [-1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, -1.0],\\n\\n [-1.0, 0.0, 1.0, 1.0, 1.0, 1.0, 0.0, -1.0],\\n\\n [-1.0, 0.5, 0.5, 1.0, 1.0, 0.5, 0.5, -1.0],\\n\\n [-1.0, 0.0, 0.5, 1.0, 1.0, 0.5, 0.0, -1.0],\\n\\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\\n\\n [-2.0, -1.0, -1.0, -1.0, -1.0, -1.0, -1.0, -2.0],\\n\\n];\\n\\n\\n\\nconst WHITE_KNIGHT_POSITION_WEIGHTS: [[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/piece.rs\",\n \"rank\": 85,\n \"score\": 29221.531584797012\n },\n {\n \"content\": \"const BLACK_QUEEN_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [-1.0, -0.0, -1.0, -0.5, -0.5, -0.5, -1.0, -2.0],\\n\\n [-1.0, 0.0, 0.5, 0.0, 0.0, 0.0, 0.0, -1.0],\\n\\n [-1.0, 0.5, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\\n\\n [0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\\n\\n [-1.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\\n\\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\\n\\n [-2.0, -1.0, -1.0, -0.5, -0.5, -1.0, -1.0, -2.0],\\n\\n];\\n\\n\\n\\nconst WHITE_ROOK_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0],\\n\\n [0.5, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [-0.5, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -0.5],\\n\\n [0.0, 0.0, 0.0, 0.5, 0.5, 0.0, 0.0, 0.0],\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 86,\n \"score\": 29221.531584797012\n },\n {\n \"content\": \" [-3.0, 0.0, 1.5, 2.0, 2.0, 1.5, 0.0, -3.0],\\n\\n [-3.0, 0.5, 1.0, 1.5, 1.5, 1.0, 0.5, -3.0],\\n\\n [-4.0, -2.0, 0.0, 0.5, 0.5, 0.0, -2.0, -4.0],\\n\\n [-5.0, -4.0, -3.0, -3.0, -3.0, -3.0, -4.0, -5.0],\\n\\n];\\n\\n\\n\\nconst BLACK_KNIGHT_POSITION_WEIGHTS: [[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.5, 0.5, 0.0, -2.0, -4.0],\\n\\n [-3.0, 0.5, 1.0, 1.5, 1.5, 1.0, 0.5, -3.0],\\n\\n [-3.0, 0.0, 1.5, 2.0, 2.0, 1.5, 0.0, -3.0],\\n\\n [-3.0, 0.5, 1.5, 2.0, 2.0, 1.5, 0.5, -3.0],\\n\\n [-3.0, 0.0, 1.0, 1.5, 1.5, 1.0, 0.0, -3.0],\\n\\n [-4.0, -2.0, 0.0, 0.0, 0.0, 0.0, -2.0, -4.0],\\n\\n [-5.0, -4.0, -3.0, -3.0, -3.0, -3.0, -4.0, -5.0],\\n\\n];\\n\\n\\n\\nconst WHITE_PAWN_POSITION_WEIGHTS: [[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 \"file_path\": \"src/piece.rs\",\n \"rank\": 87,\n \"score\": 29221.531584797012\n },\n {\n \"content\": \" && (new_pos == en_passant)\\n\\n } else {\\n\\n false\\n\\n }) || new_pos == up.next_left()\\n\\n || new_pos == up.next_right()\\n\\n }\\n\\n\\n\\n /// ### is_legal_queen_attack\\n\\n ///\\n\\n /// Checks whether provided position is a valid attack for a queen\\n\\n fn is_legal_queen_attack(pos: Position, new_pos: Position, board: &Board) -> bool {\\n\\n Self::is_legal_rook_attack(pos, new_pos, board)\\n\\n || Self::is_legal_bishop_attack(pos, new_pos, board)\\n\\n }\\n\\n\\n\\n /// ### is_legal_rook_attack\\n\\n ///\\n\\n /// Checks whether provided position is a valid attack for a rook\\n\\n fn is_legal_rook_attack(pos: Position, new_pos: Position, board: &Board) -> bool {\\n\\n if pos.is_orthogonal_to(new_pos) {\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 88,\n \"score\": 29220.83729282743\n },\n {\n \"content\": \" return false;\\n\\n }\\n\\n }\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### is_legal_bishop_move\\n\\n ///\\n\\n /// Checks whether provided move is legal for a bishop\\n\\n fn is_legal_bishop_move(pos: Position, new_pos: Position, board: &Board) -> bool {\\n\\n if pos.is_diagonal_to(new_pos) {\\n\\n let mut traveling = pos.diagonals_to(new_pos);\\n\\n traveling.pop();\\n\\n\\n\\n for pos in traveling {\\n\\n if board.has_piece(pos) {\\n\\n return false;\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 89,\n \"score\": 29220.25597704626\n },\n {\n \"content\": \" let mut traveling = pos.orthogonals_to(new_pos);\\n\\n traveling.pop();\\n\\n\\n\\n for pos in traveling {\\n\\n if board.has_piece(pos) {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n /// ### is_legal_bishop_attack\\n\\n ///\\n\\n /// Checks whether provided position is a valid attack for a bishop\\n\\n fn is_legal_bishop_attack(pos: Position, new_pos: Position, board: &Board) -> bool {\\n\\n if pos.is_diagonal_to(new_pos) {\\n\\n let mut traveling = pos.diagonals_to(new_pos);\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 90,\n \"score\": 29219.97625706175\n },\n {\n \"content\": \" Move::Piece(E4, D3),\\n\\n Move::Piece(E4, F3),\\n\\n Move::Piece(E4, D5),\\n\\n Move::Piece(E4, F5),\\n\\n Move::Piece(E4, C6),\\n\\n Move::Piece(E4, G6),\\n\\n Move::Piece(E4, B7),\\n\\n Move::Piece(E4, H7),\\n\\n Move::Piece(E4, A8),\\n\\n Move::Piece(E4, E1),\\n\\n Move::Piece(E4, E2),\\n\\n Move::Piece(E4, E3),\\n\\n Move::Piece(E4, E5),\\n\\n Move::Piece(E4, E6),\\n\\n Move::Piece(E4, E7),\\n\\n Move::Piece(E4, E8),\\n\\n Move::Piece(E4, A4),\\n\\n Move::Piece(E4, B4),\\n\\n Move::Piece(E4, C4),\\n\\n Move::Piece(E4, D4),\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 91,\n \"score\": 29219.60848622284\n },\n {\n \"content\": \" [2.0, 3.0, 1.0, 0.0, 0.0, 1.0, 3.0, 2.0],\\n\\n [2.0, 2.0, 0.0, 0.0, 0.0, 0.0, 2.0, 2.0],\\n\\n [-1.0, -2.0, -2.0, -2.0, -2.0, -2.0, -2.0, -1.0],\\n\\n [-2.0, -3.0, -3.0, -4.0, -4.0, -3.0, -3.0, -2.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n [-3.0, -4.0, -4.0, -5.0, -5.0, -4.0, -4.0, -3.0],\\n\\n];\\n\\n\\n\\nconst WHITE_QUEEN_POSITION_WEIGHTS: [[f64; 8]; 8] = [\\n\\n [-2.0, -1.0, -1.0, -0.5, -0.5, -1.0, -1.0, -2.0],\\n\\n [-1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, -1.0],\\n\\n [-1.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\\n\\n [-0.5, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\\n\\n [0.0, 0.0, 0.5, 0.5, 0.5, 0.5, 0.0, -0.5],\\n\\n [-1.0, 0.5, 0.5, 0.5, 0.5, 0.5, 0.0, -1.0],\\n\\n [-1.0, 0.0, 0.5, 0.0, 0.0, 0.0, 0.0, -1.0],\\n\\n [-1.0, -0.0, -1.0, -0.5, -0.5, -0.5, -1.0, -2.0],\\n\\n];\\n\",\n \"file_path\": \"src/piece.rs\",\n \"rank\": 92,\n \"score\": 29218.69896884193\n },\n {\n \"content\": \"pub struct Board {\\n\\n /// the 64 squares of the chess board\\n\\n squares: [Square; 64],\\n\\n /// tracks eventually a possible en passant position\\n\\n en_passant: Option<Position>,\\n\\n /// tracks eventually a taken piece on the last turn\\n\\n taken_piece: Option<Piece>,\\n\\n /// tracks eventually the possibility to promote a pawn\\n\\n promotion: Option<Position>,\\n\\n /// castling rights for white player\\n\\n white_castling_rights: CastlingRights,\\n\\n /// castling rights for black player\\n\\n black_castling_rights: CastlingRights,\\n\\n /// describes which player has to move the next turn\\n\\n turn: Color,\\n\\n}\\n\\n\\n\\nimpl Default for Board {\\n\\n fn default() -> Self {\\n\\n BoardBuilder::default()\\n\",\n \"file_path\": \"src/board/mod.rs\",\n \"rank\": 94,\n \"score\": 26471.2700407455\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl Board {\\n\\n // -- constructors\\n\\n\\n\\n /// ### empty\\n\\n ///\\n\\n /// Create an empty Board\\n\\n pub fn empty() -> Self {\\n\\n Self {\\n\\n squares: [Square::empty(); 64],\\n\\n en_passant: None,\\n\\n taken_piece: None,\\n\\n promotion: None,\\n\\n white_castling_rights: CastlingRights::default(),\\n\\n black_castling_rights: CastlingRights::default(),\\n\\n turn: WHITE,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/board/mod.rs\",\n \"rank\": 96,\n \"score\": 26471.050796231946\n },\n {\n \"content\": \" /// <https://en.wikipedia.org/wiki/Dunsany%27s_chess>\\n\\n pub fn dunsany() -> Self {\\n\\n BoardBuilder::from(Board::default())\\n\\n .row(Piece::Pawn(WHITE, A1))\\n\\n .row(Piece::Pawn(WHITE, A2))\\n\\n .row(Piece::Pawn(WHITE, A3))\\n\\n .row(Piece::Pawn(WHITE, A4))\\n\\n .player_moving(BLACK)\\n\\n .build()\\n\\n }\\n\\n\\n\\n // -- getters\\n\\n\\n\\n /// ### get_turn\\n\\n ///\\n\\n /// Get the color of the current player\\n\\n #[inline]\\n\\n pub fn get_turn(&self) -> Color {\\n\\n self.turn\\n\\n }\\n\",\n \"file_path\": \"src/board/mod.rs\",\n \"rank\": 98,\n \"score\": 26468.65082189119\n }\n]","isConversational":false}}},{"rowIdx":1196,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/direction.rs"},"repo_name":{"kind":"string","value":"jack-atack/Cursive"},"commit":{"kind":"string","value":"fc065e8e589c24dfa7906d9423c7b63fee095e23"},"file_code":{"kind":"string","value":"\n\nuse crate::vec::Vec2;\nuse crate::XY;\n\n#[derive(Clone, Copy, Debug, PartialEq)]\npub enum Orientation {\n \n Horizontal,\n \n Vertical,\n}\n\nimpl Orientation {\n \n pub fn pair() -> XY<Orientation> {\n XY::new(Orientation::Horizontal, Orientation::Vertical)\n }\n\n \n \n \n \n pub fn get<T: Clone>(self, v: &XY<T>) -> T {\n v.get(self).clone()\n }\n\n \n pub fn swap(self) -> Self {\n match self {\n Orientation::Horizontal => Orientation::Vertical,\n Orientation::Vertical => Orientation::Horizontal,\n }\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn get_ref<T>(self, v: &mut XY<T>) -> &mut T {\n match self {\n Orientation::Horizontal => &mut v.x,\n Orientation::Vertical => &mut v.y,\n }\n }\n\n \n \n \n \n \n pub fn stack<'a, T: Iterator<Item = &'a Vec2>>(self, iter: T) -> Vec2 {\n match self {\n Orientation::Horizontal => {\n iter.fold(Vec2::zero(), |a, b| a.stack_horizontal(b))\n }\n Orientation::Vertical => {\n iter.fold(Vec2::zero(), |a, b| a.stack_vertical(b))\n }\n }\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn make_vec(self, main_axis: usize, second_axis: usize) -> Vec2 {\n let mut result = Vec2::zero();\n *self.get_ref(&mut result) = main_axis;\n *self.swap().get_ref(&mut result) = second_axis;\n result\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub enum Direction {\n \n Abs(Absolute),\n \n Rel(Relative),\n}\n\nimpl Direction {\n \n \n \n \n pub fn relative(self, orientation: Orientation) -> Option<Relative> {\n match self {\n Direction::Abs(abs) => abs.relative(orientation),\n Direction::Rel(rel) => Some(rel),\n }\n }\n\n \n pub fn absolute(self, orientation: Orientation) -> Absolute {\n match self {\n Direction::Abs(abs) => abs,\n Direction::Rel(rel) => rel.absolute(orientation),\n }\n }\n\n \n pub fn back() -> Self {\n Direction::Rel(Relative::Back)\n }\n\n \n pub fn front() -> Self {\n Direction::Rel(Relative::Front)\n }\n\n \n pub fn left() -> Self {\n Direction::Abs(Absolute::Left)\n }\n\n \n pub fn right() -> Self {\n Direction::Abs(Absolute::Right)\n }\n\n \n pub fn up() -> Self {\n Direction::Abs(Absolute::Up)\n }\n\n \n pub fn down() -> Self {\n Direction::Abs(Absolute::Down)\n }\n\n \n pub fn none() -> Self {\n Direction::Abs(Absolute::None)\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub enum Relative {\n \n \n \n \n \n Front,\n\n \n \n \n \n Back,\n}\n\nimpl Relative {\n \n pub fn absolute(self, orientation: Orientation) -> Absolute {\n match (orientation, self) {\n (Orientation::Horizontal, Relative::Front) => Absolute::Left,\n (Orientation::Horizontal, Relative::Back) => Absolute::Right,\n (Orientation::Vertical, Relative::Front) => Absolute::Up,\n (Orientation::Vertical, Relative::Back) => Absolute::Down,\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub enum Absolute {\n \n Left,\n \n Up,\n \n Right,\n \n Down,\n\n \n \n \n None,\n}\n\nimpl Absolute {\n \n \n \n \n pub fn relative(self, orientation: Orientation) -> Option<Relative> {\n match (orientation, self) {\n (Orientation::Horizontal, Absolute::Left)\n | (Orientation::Vertical, Absolute::Up) => Some(Relative::Front),\n (Orientation::Horizontal, Absolute::Right)\n | (Orientation::Vertical, Absolute::Down) => Some(Relative::Back),\n _ => None,\n }\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::vec::Vec2;\nuse crate::XY;\n\n#[derive(Clone, Copy, Debug, PartialEq)]\npub enum Orientation {\n \n Horizontal,\n \n Vertical,\n}\n\nimpl Orientation {\n \n pub fn pair() -> XY<Orientation> {\n XY::new(Orientation::Horizontal, Orientation::Vertical)\n }\n\n \n \n \n \n pub fn get<T: Clone>(self, v: &XY<T>) -> T {\n v.get(self).clone()\n }\n\n \n pub fn swap(self) -> Self {\n match self {\n Orientation::Horizontal => Orientation::Vertical,\n Orientation::Vertical => Orientation::Horizontal,\n }\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn get_ref<T>(self, v: &mut XY<T>) -> &mut T {\n match self {\n Orientation::Horizontal => &mut v.x,\n Orientation::Vertical => &mut v.y,\n }\n }\n\n \n \n \n \n \n pub fn stack<'a, T: Iterator<Item = &'a Vec2>>(self, iter: T) -> Vec2 {\n match self {\n Orientation::Horizontal => {\n iter.fold(Vec2::zero(), |a, b| a.stack_horizontal(b))\n }\n Orientation::Vertical => {\n iter.fold(Vec2::zero(), |a, b| a.stack_vertical(b))\n }\n }\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn make_vec(self, main_axis: usize, second_axis: usize) -> Vec2 {\n let mut result = Vec2::zero();\n *self.get_ref(&mut result) = main_axis;\n *self.swap().get_ref(&mut result) = second_axis;\n result\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub enum Direction {\n \n Abs(Absolute),\n \n Rel(Relative),\n}\n\nimpl Direction {\n \n \n \n \n pub fn relative(self, orientation: Orientation) -> Option<Relative> {\n match self {\n Direction::Abs(abs) => abs.relative(orientation),\n Direction::Rel(rel) => Some(rel),\n }\n }\n\n \n pub fn absolute(self, orientation: Orientation) -> Absolute {\n match self {\n Direction::Abs(abs) => abs,\n Direction::Rel(rel) => rel.absolute(orientation),\n }\n }\n\n \n pub fn back() -> Self {\n Direction::Rel(Relative::Back)\n }\n\n \n pub fn front() -> Self {\n Direction::Rel(Relative::Front)\n }\n\n \n pub fn left() -> Self {\n Direction::Abs(Absolute::Left)\n }\n\n \n pub fn right() -> Self {\n Direction::Abs(Absolute::Right)\n }\n\n \n pub fn up() -> Self {\n Direction::Abs(Absolute::Up)\n }\n\n \n pub fn down() -> Self {\n Direction::Abs(Absolute::Down)\n }\n\n \n pub fn none() -> Self {\n Direction::Abs(Absolute::None)\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub enum Relative {\n \n \n \n \n \n Front,\n\n \n \n \n \n Back,\n}\n\nimpl Relative {\n \n pub fn absolute(self, orientation: Orientation) -> Absolute {\n match (orientation, self) {\n (Orientation::Horizontal, Relative::Front) => Absolute::Left,\n (Orientation::Horizontal, Relative::Back) => Absolute::Right,\n (Orientation::Vertical, Relative::Front) => Absolute::Up,\n (Orientation::Vertical, Relative::Back) => Absolute::Down,\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq)]\npub enum Absolute {\n \n Left,\n \n Up,\n \n Right,\n \n Down,\n\n \n \n \n None,\n}\n\nimpl Absolute {\n \n \n \n \n pub fn relative(self, orientation: O"},"suffix":{"kind":"string","value":"n::Horizontal, Absolute::Right)\n | (Orientation::Vertical, Absolute::Down) => Some(Relative::Back),\n _ => None,\n }\n }\n}\n"},"middle":{"kind":"string","value":"rientation) -> Option<Relative> {\n match (orientation, self) {\n (Orientation::Horizontal, Absolute::Left)\n | (Orientation::Vertical, Absolute::Up) => Some(Relative::Front),\n (Orientatio"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"fn cap<'a, I: Iterator<Item = &'a mut usize>>(iter: I, max: usize) {\n\n let mut available = max;\n\n for item in iter {\n\n if *item > available {\n\n *item = available;\n\n }\n\n\n\n available -= *item;\n\n }\n\n}\n\n\n\nimpl LinearLayout {\n\n /// Creates a new layout with the given orientation.\n\n pub fn new(orientation: direction::Orientation) -> Self {\n\n LinearLayout {\n\n children: Vec::new(),\n\n orientation,\n\n focus: 0,\n\n cache: None,\n\n }\n","file_path":"src/views/linear_layout.rs","rank":0,"score":216632.62417401368},{"content":"/// Wraps a `FnMut` into a `Fn`\n\n///\n\n/// This can be used to use a `FnMut` when a callack expects a `Fn`.\n\n///\n\n/// # Note\n\n///\n\n/// If the resulting `Fn` is called recursively, subsequent calls will be\n\n/// no-ops.\n\npub fn immutify<F: FnMut(&mut Cursive)>(\n\n f: F,\n\n) -> impl for<'s> Fn(&'s mut Cursive) {\n\n let callback = RefCell::new(f);\n\n move |s| {\n\n // Here's the weird trick: if we're already borrowed,\n\n // just ignored the callback.\n\n if let Ok(mut f) = callback.try_borrow_mut() {\n\n // Beeeaaah that's ugly.\n\n // Why do we need to manually dereference here?\n\n (&mut *f)(s);\n\n }\n\n }\n\n}\n\n\n\n*/\n\n\n\n/// Macro to wrap a `FnMut` with 1 argument into a `Fn`.\n\n///\n\n/// This can wrap any `FnMut` with a single arguments (for example `&mut Cursive`).\n","file_path":"src/utils/immutify.rs","rank":1,"score":201095.8785707883},{"content":"/// Computes the longest suffix that fits in the given `width`.\n\n///\n\n/// Doesn't break inside elements returned by `iter`.\n\n///\n\n/// Returns the number of bytes of the longest\n\n/// suffix from `text` that fits in `width`.\n\n///\n\n/// This is a shortcut for `prefix_length(iter.rev(), width, delimiter)`\n\npub fn suffix<'a, I>(iter: I, width: usize, delimiter: &str) -> Span\n\nwhere\n\n I: DoubleEndedIterator<Item = &'a str>,\n\n{\n\n prefix(iter.rev(), width, delimiter)\n\n}\n\n\n","file_path":"src/utils/lines/simple/mod.rs","rank":2,"score":190800.94876694045},{"content":"/// Computes a prefix that fits in the given `width`.\n\n///\n\n/// Takes non-breakable elements from `iter`, while keeping the string width\n\n/// under `width` (and adding `delimiter` between each element).\n\n///\n\n/// Given `total_text = iter.collect().join(delimiter)`, the result is the\n\n/// length of the longest prefix of `width` or less cells, without breaking\n\n/// inside an element.\n\n///\n\n/// Example:\n\n///\n\n/// ```\n\n/// # extern crate cursive;\n\n/// extern crate unicode_segmentation;\n\n/// use unicode_segmentation::UnicodeSegmentation;\n\n///\n\n/// # use cursive::utils::lines::simple::prefix;\n\n/// # fn main() {\n\n/// let my_text = \"blah...\";\n\n/// // This returns the number of bytes for a prefix of `my_text` that\n\n/// // fits within 5 cells.\n\n/// prefix(my_text.graphemes(true), 5, \"\");\n\n/// # }\n\n/// ```\n\npub fn prefix<'a, I>(iter: I, available_width: usize, delimiter: &str) -> Span\n\nwhere\n\n I: Iterator<Item = &'a str>,\n\n{\n\n let delimiter_width = delimiter.width();\n\n let delimiter_len = delimiter.len();\n\n\n\n // `current_width` is the width of everything\n\n // before the next token, including any space.\n\n let mut current_width = 0;\n\n let sum: usize = iter\n\n .take_while(|token| {\n\n let width = token.width();\n\n if current_width + width > available_width {\n\n false\n\n } else {\n\n // Include the delimiter after this token.\n\n current_width += width;\n\n current_width += delimiter_width;\n\n true\n","file_path":"src/utils/lines/simple/mod.rs","rank":3,"score":187496.03273249464},{"content":"/// Loads a theme string and sets it as active.\n\npub fn load_toml(content: &str) -> Result<Theme, Error> {\n\n let table = toml::de::from_str(content)?;\n\n\n\n let mut theme = Theme::default();\n\n theme.load_toml(&table);\n\n\n\n Ok(theme)\n\n}\n\n\n","file_path":"src/theme/mod.rs","rank":4,"score":172192.83662851673},{"content":"/// Draws a frame around the scrollable content.\n\n///\n\n/// `left_border` will be called for each row to draw the left border for the given line number.\n\npub fn draw_frame<T, LeftBorder, TopBorder, RightBorder, BottomBorder>(\n\n scroller: &T, printer: &Printer, mut left_border: LeftBorder,\n\n mut top_border: TopBorder, mut right_border: RightBorder,\n\n mut bottom_border: BottomBorder,\n\n) where\n\n T: Scroller,\n\n LeftBorder: FnMut(&T, &Printer, usize),\n\n TopBorder: FnMut(&T, &Printer, usize),\n\n RightBorder: FnMut(&T, &Printer, usize),\n\n BottomBorder: FnMut(&T, &Printer, usize),\n\n{\n\n let viewport = scroller.get_scroller().content_viewport();\n\n let size = printer.size.saturating_sub((1, 1));\n\n\n\n for (i, x) in (viewport.left()..=viewport.right()).enumerate() {\n\n top_border(scroller, &printer.offset((i + 1, 0)), x);\n\n bottom_border(scroller, &printer.offset((i + 1, size.y)), x);\n\n }\n\n\n\n // Also draw padding\n","file_path":"src/view/scroll/mod.rs","rank":5,"score":168634.34906189208},{"content":"fn show_child(s: &mut Cursive, offset: Vec2, menu: Rc<MenuTree>) {\n\n // Adds a new layer located near the item title with the menu popup.\n\n // Also adds two key callbacks on this new view, to handle `left` and\n\n // `right` key presses.\n\n // (If the view itself listens for a `left` or `right` press, it will\n\n // consume it before our OnEventView. This means sub-menus can properly\n\n // be entered.)\n\n s.screen_mut().add_layer_at(\n\n Position::absolute(offset),\n\n OnEventView::new(\n\n MenuPopup::new(menu)\n\n .on_dismiss(Cursive::select_menubar)\n\n .on_action(|s| s.menubar().state = State::Inactive),\n\n )\n\n .on_event(Key::Right, |s| {\n\n s.pop_layer();\n\n s.select_menubar();\n\n // Act as if we sent \"Right\" then \"Down\"\n\n s.menubar().on_event(Event::Key(Key::Right)).process(s);\n\n if let EventResult::Consumed(Some(cb)) =\n","file_path":"src/views/menubar.rs","rank":6,"score":161837.47105209643},{"content":"#[allow(dead_code)]\n\npub fn read_char<F>(first: u8, next: F) -> Result<char, String>\n\nwhere\n\n F: Fn() -> Option<u8>,\n\n{\n\n if first < 0x80 {\n\n return Ok(first as char);\n\n }\n\n\n\n // Number of leading 1s determines the number of bytes we'll have to read\n\n let n_bytes = match (!first).leading_zeros() {\n\n n @ 2..=6 => n as usize,\n\n 1 => return Err(\"First byte is continuation byte.\".to_string()),\n\n 7..=8 => return Err(\"WTF is this byte??\".to_string()),\n\n _ => unreachable!(),\n\n };\n\n\n\n let mut res = 0_u32;\n\n\n\n // First, get the data - only the few last bits\n\n res |= u32::from(first & make_mask(7 - n_bytes));\n","file_path":"src/utf8.rs","rank":7,"score":158496.18664836016},{"content":"/// Loads a theme from file and sets it as active.\n\npub fn load_theme_file<P: AsRef<Path>>(filename: P) -> Result<Theme, Error> {\n\n let content = {\n\n let mut content = String::new();\n\n let mut file = File::open(filename)?;\n\n file.read_to_string(&mut content)?;\n\n content\n\n };\n\n\n\n load_toml(&content)\n\n}\n\n\n","file_path":"src/theme/mod.rs","rank":8,"score":153640.32891344678},{"content":"/// Draws a box-style frame around a scrollable content.\n\n///\n\n/// Assumes horizontal lines are present in the content whenever `is_h_delim`\n\n/// returns `true` (and vertical lines when `is_v_delim` returns `true`).\n\n///\n\n/// It will print a box with the appropriate `├`, `┤` and so on.\n\npub fn draw_box_frame<T, IsHDelim, IsVDelim>(\n\n scroller: &T, printer: &Printer, is_h_delim: IsHDelim,\n\n is_v_delim: IsVDelim,\n\n) where\n\n T: Scroller,\n\n IsHDelim: Fn(&T, usize) -> bool,\n\n IsVDelim: Fn(&T, usize) -> bool,\n\n{\n\n draw_frame(\n\n scroller,\n\n printer,\n\n |s, printer, y| {\n\n if is_h_delim(s, y) {\n\n printer.print((0, 0), \"├\");\n\n } else {\n\n printer.print((0, 0), \"│\");\n\n }\n\n },\n\n |s, printer, x| {\n\n if is_v_delim(s, x) {\n","file_path":"src/view/scroll/mod.rs","rank":9,"score":147897.03286828537},{"content":"// Compare the content of the two edit views,\n\n// and update the TextView accordingly.\n\n//\n\n// We'll ignore the `content` and `cursor` arguments,\n\n// and directly retrieve the content from the `Cursive` root.\n\nfn on_edit(siv: &mut Cursive, _content: &str, _cursor: usize) {\n\n // Get handles for each view.\n\n let edit_1 = siv.find_id::<EditView>(\"1\").unwrap();\n\n let edit_2 = siv.find_id::<EditView>(\"2\").unwrap();\n\n\n\n // Directly compare references to edit_1 and edit_2.\n\n let matches = edit_1.get_content() == edit_2.get_content();\n\n\n\n siv.call_on_id(\"match\", |v: &mut TextView| {\n\n v.set_content(if matches { \"match\" } else { \"no match\" })\n\n });\n\n}\n","file_path":"examples/refcell_view.rs","rank":10,"score":147537.77507268253},{"content":"/// Computes the longest prefix that fits in the given width.\n\n///\n\n/// Breaks between any two graphemes.\n\npub fn simple_prefix(text: &str, width: usize) -> Span {\n\n prefix(text.graphemes(true), width, \"\")\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"src/utils/lines/simple/mod.rs","rank":11,"score":143346.33397949312},{"content":"/// Computes the longest suffix that fits in the given `width`.\n\n///\n\n/// Breaks between any two graphemes.\n\npub fn simple_suffix(text: &str, width: usize) -> Span {\n\n suffix(text.graphemes(true), width, \"\")\n\n}\n\n\n","file_path":"src/utils/lines/simple/mod.rs","rank":12,"score":143346.33397949312},{"content":"/// Initialize the Cursive logger.\n\n///\n\n/// Make sure this is the only logger your are using.\n\n///\n\n/// Use a [`DebugView`](crate::views::DebugView) to see the logs, or use\n\n/// [`Cursive::toggle_debug_console()`](crate::Cursive::toggle_debug_console()).\n\npub fn init() {\n\n // TODO: Configure the deque size?\n\n LOGS.lock().unwrap().reserve(1_000);\n\n\n\n // This will panic if `set_logger` was already called.\n\n log::set_logger(&LOGGER).unwrap();\n\n\n\n // TODO: read the level from env variable? From argument?\n\n log::set_max_level(log::LevelFilter::Trace);\n\n}\n\n\n","file_path":"src/logger.rs","rank":13,"score":141745.06700207922},{"content":"/// Compute lines for the given content and width.\n\n///\n\n/// Equivalent to constructing a new `LinesIterator` and collecting it.\n\npub fn make_lines(content: &str, width: usize) -> Vec<Row> {\n\n LinesIterator::new(content, width).collect()\n\n}\n\n\n","file_path":"src/utils/lines/simple/mod.rs","rank":14,"score":138947.321230314},{"content":"fn find_closest_pair(pair: ColorPair) -> (i16, i16) {\n\n super::find_closest_pair(pair, ncurses::COLORS() as i16)\n\n}\n\n\n","file_path":"src/backend/curses/n.rs","rank":15,"score":135957.28628976922},{"content":"fn find_closest_pair(pair: ColorPair) -> (i16, i16) {\n\n super::find_closest_pair(pair, pancurses::COLORS() as i16)\n\n}\n\n\n\nimpl Backend {\n\n /// Creates a new pancurses-based backend.\n\n pub fn init() -> std::io::Result<Box<dyn backend::Backend>> {\n\n // Check the $TERM variable (at least on unix).\n\n // Otherwise we'll just abort.\n\n // TODO: On windows, is there anything to check?\n\n if cfg!(unix)\n\n && std::env::var(\"TERM\")\n\n .map(|var| var.is_empty())\n\n .unwrap_or(true)\n\n {\n\n return Err(std::io::Error::new(\n\n std::io::ErrorKind::Other,\n\n \"$TERM is unset. Cannot initialize pancurses interface.\",\n\n ));\n\n }\n","file_path":"src/backend/curses/pan.rs","rank":16,"score":134363.24198006914},{"content":"#[allow(unused)]\n\npub fn start_resize_thread(\n\n resize_sender: Sender<()>, resize_running: Arc<AtomicBool>,\n\n) {\n\n let signals = Signals::new(&[libc::SIGWINCH]).unwrap();\n\n thread::spawn(move || {\n\n // This thread will listen to SIGWINCH events and report them.\n\n while resize_running.load(Ordering::Relaxed) {\n\n // We know it will only contain SIGWINCH signals, so no need to check.\n\n if signals.wait().count() > 0 {\n\n resize_sender.send(()).unwrap();\n\n }\n\n }\n\n });\n\n}\n","file_path":"src/backend/resize.rs","rank":17,"score":134078.01488877996},{"content":"fn phase_2(s: &mut Cursive) {\n\n // Now, we'll run N tasks\n\n // (It could be downloading a file, extracting an archive,\n\n // reticulating sprites, ...)\n\n let n_bars = 10;\n\n // Each task will have its own shiny counter\n\n let counters: Vec<_> = (0..n_bars).map(|_| Counter::new(0)).collect();\n\n // To make things more interesting, we'll give a random speed to each bar\n\n let speeds: Vec<_> = (0..n_bars)\n\n .map(|_| rand::thread_rng().gen_range(50, 150))\n\n .collect();\n\n\n\n let n_max = 100_000;\n\n let cb = s.cb_sink().clone();\n\n\n\n // Let's prepare the progress bars...\n\n let mut linear = LinearLayout::vertical();\n\n for c in &counters {\n\n linear.add_child(ProgressBar::new().max(n_max).with_value(c.clone()));\n\n }\n","file_path":"examples/progress.rs","rank":18,"score":133589.69782233922},{"content":"fn phase_1(s: &mut Cursive) {\n\n // Phase 1 is easy: a simple pre-loading.\n\n\n\n // Number of ticks\n\n let n_max = 1000;\n\n\n\n // This is the callback channel\n\n let cb = s.cb_sink().clone();\n\n\n\n s.pop_layer();\n\n s.add_layer(Dialog::around(\n\n ProgressBar::new()\n\n // We need to know how many ticks represent a full bar.\n\n .range(0, n_max)\n\n .with_task(move |counter| {\n\n // This closure will be called in a separate thread.\n\n fake_load(n_max, &counter);\n\n\n\n // When we're done, send a callback through the channel\n\n cb.send(Box::new(coffee_break)).unwrap();\n\n })\n\n .full_width(),\n\n ));\n\n s.set_autorefresh(true);\n\n}\n\n\n","file_path":"examples/progress.rs","rank":19,"score":133589.69782233922},{"content":"// Shortcut for a boxed callback (for the wrap_call_on_any method).\n\ntype BoxedCallback<'a> = Box<for<'b> FnMut(&'b mut dyn Any) + 'a>;\n\n\n\nimpl<T: View + 'static> ViewWrapper for IdView<T> {\n\n type V = T;\n\n\n\n fn with_view<F, R>(&self, f: F) -> Option<R>\n\n where\n\n F: FnOnce(&Self::V) -> R,\n\n {\n\n self.view.try_borrow().ok().map(|v| f(&*v))\n\n }\n\n\n\n fn with_view_mut<F, R>(&mut self, f: F) -> Option<R>\n\n where\n\n F: FnOnce(&mut Self::V) -> R,\n\n {\n\n self.view.try_borrow_mut().ok().map(|mut v| f(&mut *v))\n\n }\n\n\n\n fn into_inner(mut self) -> Result<Self::V, Self>\n","file_path":"src/views/id_view.rs","rank":20,"score":131690.33440614323},{"content":"fn final_step(s: &mut Cursive) {\n\n // A little break before things get serious.\n\n s.set_autorefresh(false);\n\n s.pop_layer();\n\n s.add_layer(\n\n Dialog::new()\n\n .title(\"Report\")\n\n .content(\n\n TextView::new(\n\n \"Time travel was a success!\\n\\\n\n We went forward a few seconds!!\",\n\n )\n\n .center(),\n\n )\n\n .button(\"That's it?\", |s| s.quit()),\n\n );\n\n}\n\n\n","file_path":"examples/progress.rs","rank":21,"score":131039.4805206093},{"content":"fn coffee_break(s: &mut Cursive) {\n\n // A little break before things get serious.\n\n s.set_autorefresh(false);\n\n s.pop_layer();\n\n s.add_layer(\n\n Dialog::new()\n\n .title(\"Preparation complete\")\n\n .content(TextView::new(\"Now, the real deal!\").center())\n\n .button(\"Again??\", phase_2),\n\n );\n\n}\n\n\n","file_path":"examples/progress.rs","rank":22,"score":131039.4805206093},{"content":"/// Concatenates chunks as long as they fit in the given width.\n\npub fn prefix<I>(\n\n tokens: &mut Peekable<I>, width: usize, offset: &mut ChunkPart,\n\n) -> Vec<Chunk>\n\nwhere\n\n I: Iterator<Item = Chunk>,\n\n{\n\n let mut available = width;\n\n let mut chunks = Vec::new();\n\n\n\n // Accumulate chunks until it doesn't fit.\n\n loop {\n\n // Look at the next chunk and see if it would fit.\n\n let result = {\n\n let next_chunk = match tokens.peek() {\n\n None => break,\n\n Some(chunk) => chunk,\n\n };\n\n\n\n // When considering if the chunk fits, remember that we may\n\n // already have processed part of it.\n","file_path":"src/utils/lines/spans/prefix.rs","rank":23,"score":130697.6959752263},{"content":"/// Loads the default theme, and returns its representation.\n\npub fn load_default() -> Theme {\n\n Theme::default()\n\n}\n","file_path":"src/theme/mod.rs","rank":24,"score":130697.6959752263},{"content":"fn show_popup(siv: &mut Cursive) {\n\n // Let's center the popup horizontally, but offset it down a few rows,\n\n // so the user can see both the popup and the view underneath.\n\n siv.screen_mut().add_layer_at(\n\n Position::new(Offset::Center, Offset::Parent(5)),\n\n Dialog::around(TextView::new(\"Tak!\"))\n\n .button(\"Change\", |s| {\n\n // Look for a view tagged \"text\".\n\n // We _know_ it's there, so unwrap it.\n\n s.call_on_id(\"text\", |view: &mut TextView| {\n\n let content = reverse(view.get_content().source());\n\n view.set_content(content);\n\n });\n\n })\n\n .dismiss_button(\"Ok\"),\n\n );\n\n}\n\n\n","file_path":"examples/mutation.rs","rank":25,"score":128636.53904288812},{"content":"type InnerCallback<T> = Rc<Box<dyn Fn(&mut T, &Event) -> Option<EventResult>>>;\n\n\n","file_path":"src/views/on_event_view.rs","rank":26,"score":128051.97572674266},{"content":"/// Initialise the Cursive logger, adding the ability to filter debug logs by module\n\npub fn init_for_module(module: &str) {\n\n let mut custom_module = MODULE.lock().unwrap();\n\n *custom_module = Some(module.to_string());\n\n\n\n // TODO: Configure the deque size?\n\n MODULE_LOGS.lock().unwrap().reserve(1_000);\n\n\n\n init();\n\n}\n","file_path":"src/logger.rs","rank":27,"score":127725.05544228505},{"content":"fn show_options(siv: &mut Cursive) {\n\n siv.add_layer(\n\n Dialog::new()\n\n .title(\"Select difficulty\")\n\n .content(\n\n SelectView::new()\n\n .item(\n\n \"Easy: 8x8, 10 mines\",\n\n game::Options {\n\n size: Vec2::new(8, 8),\n\n mines: 10,\n\n },\n\n )\n\n .item(\n\n \"Medium: 16x16, 40 mines\",\n\n game::Options {\n\n size: Vec2::new(16, 16),\n\n mines: 40,\n\n },\n\n )\n","file_path":"examples/mines/main.rs","rank":28,"score":126368.47359960807},{"content":"fn find_closest_pair(pair: ColorPair, max_colors: i16) -> (i16, i16) {\n\n (\n\n find_closest(pair.front, max_colors),\n\n find_closest(pair.back, max_colors),\n\n )\n\n}\n\n\n","file_path":"src/backend/curses/mod.rs","rank":29,"score":125312.58793442008},{"content":"/// Writes some bytes directly to `/dev/tty`\n\n///\n\n/// Since this is not going to be used often, we can afford to re-open the\n\n/// file every time.\n\nfn write_to_tty(bytes: &[u8]) -> io::Result<()> {\n\n let mut tty_output =\n\n File::create(\"/dev/tty\").expect(\"cursive can only run with a tty\");\n\n tty_output.write_all(bytes)?;\n\n // tty_output will be flushed automatically at the end of the function.\n\n Ok(())\n\n}\n\n\n\nimpl Backend {\n\n /// Creates a new ncurses-based backend.\n\n pub fn init() -> io::Result<Box<dyn backend::Backend>> {\n\n // Check the $TERM variable.\n\n if std::env::var(\"TERM\")\n\n .map(|var| var.is_empty())\n\n .unwrap_or(true)\n\n {\n\n return Err(io::Error::new(\n\n io::ErrorKind::Other,\n\n \"$TERM is unset. Cannot initialize ncurses interface.\",\n\n ));\n","file_path":"src/backend/curses/n.rs","rank":30,"score":122192.1044110718},{"content":"/// Performs `View::important_area` on a `scroll::Scroller`.\n\npub fn important_area<T, ImportantArea>(\n\n scroller: &T, size: Vec2, mut important_area: ImportantArea,\n\n) -> Rect\n\nwhere\n\n T: Scroller,\n\n ImportantArea: FnMut(&T, Vec2) -> Rect,\n\n{\n\n let viewport = scroller.get_scroller().content_viewport();\n\n let area = important_area(scroller, size);\n\n let top_left = area.top_left().saturating_sub(viewport.top_left());\n\n let bot_right = area\n\n .bottom_right()\n\n .saturating_sub(viewport.top_left())\n\n .or_min(viewport.bottom_right());\n\n\n\n Rect::from_corners(top_left, bot_right)\n\n}\n\n\n","file_path":"src/view/scroll/mod.rs","rank":31,"score":121285.19881103317},{"content":"/// Performs a line-based `View::draw` on a `scroll::Scroller`.\n\n///\n\n/// This is an alternative to `scroll::draw()` when you just need to print individual lines.\n\npub fn draw_lines<T, LineDrawer>(\n\n scroller: &T, printer: &Printer, mut line_drawer: LineDrawer,\n\n) where\n\n T: Scroller,\n\n LineDrawer: FnMut(&T, &Printer, usize),\n\n{\n\n draw(scroller, printer, |s, printer| {\n\n let start = printer.content_offset.y;\n\n let end = start + printer.output_size.y;\n\n for y in start..end {\n\n let printer = printer.offset((0, y)).cropped((printer.size.x, 1));\n\n line_drawer(s, &printer, y);\n\n }\n\n });\n\n}\n\n\n","file_path":"src/view/scroll/mod.rs","rank":32,"score":121285.19881103317},{"content":"/// Performs `View::required_size` on a `scroll::Scroller`.\n\npub fn required_size<T, RequiredSize>(\n\n scroller: &mut T, size: Vec2, needs_relayout: bool,\n\n required_size: RequiredSize,\n\n) -> Vec2\n\nwhere\n\n T: Scroller,\n\n RequiredSize: FnMut(&mut T, Vec2) -> Vec2,\n\n{\n\n raw::required_size(\n\n size,\n\n needs_relayout,\n\n scroller,\n\n Scroller::get_scroller_mut,\n\n required_size,\n\n )\n\n}\n\n\n","file_path":"src/view/scroll/mod.rs","rank":33,"score":121285.19881103317},{"content":"// This will replace the current layer with a new popup.\n\n// If the name is empty, we'll show an error message instead.\n\nfn show_popup(s: &mut Cursive, name: &str) {\n\n if name.is_empty() {\n\n // Try again as many times as we need!\n\n s.add_layer(Dialog::info(\"Please enter a name!\"));\n\n } else {\n\n let content = format!(\"Hello {}!\", name);\n\n // Remove the initial popup\n\n s.pop_layer();\n\n // And put a new one instead\n\n s.add_layer(\n\n Dialog::around(TextView::new(content))\n\n .button(\"Quit\", |s| s.quit()),\n\n );\n\n }\n\n}\n","file_path":"examples/edit.rs","rank":34,"score":121277.04436762},{"content":"/// Look at a chunk, and decide how it could fit.\n\nfn consider_chunk(available: usize, chunk: &Chunk) -> ChunkFitResult {\n\n if chunk.width <= available {\n\n // We fits. No question about it.\n\n if chunk.hard_stop {\n\n // Still, we have to stop here.\n\n // And possibly trim a newline.\n\n ChunkFitResult::FitsBarely\n\n } else {\n\n // Nothing special here.\n\n ChunkFitResult::Fits\n\n }\n\n } else if chunk.width == available + 1 {\n\n // We're just SLIGHTLY too big!\n\n // Can we just pop something?\n\n if chunk.ends_with_space {\n\n // Yay!\n\n ChunkFitResult::FitsBarely\n\n } else {\n\n // Noo(\n\n ChunkFitResult::DoesNotFit\n\n }\n\n } else {\n\n // Can't bargain with me.\n\n ChunkFitResult::DoesNotFit\n\n }\n\n}\n","file_path":"src/utils/lines/spans/prefix.rs","rank":35,"score":119703.54100055111},{"content":"fn find(siv: &mut Cursive, text: &str) {\n\n // First, remove the find popup\n\n siv.pop_layer();\n\n\n\n let res = siv.call_on_id(\"text\", |v: &mut TextArea| {\n\n // Find the given text from the text area content\n\n // Possible improvement: search after the current cursor.\n\n if let Some(i) = v.get_content().find(text) {\n\n // If we found it, move the cursor\n\n v.set_cursor(i);\n\n Ok(())\n\n } else {\n\n // Otherwise, return an error so we can show a warning.\n\n Err(())\n\n }\n\n });\n\n\n\n if let Some(Err(())) = res {\n\n // If we didn't find anything, tell the user!\n\n siv.add_layer(Dialog::info(format!(\"`{}` not found\", text)));\n\n }\n\n}\n","file_path":"examples/text_area.rs","rank":36,"score":119132.8091591152},{"content":"/// Performs `View::on_event` on a `scroll::Scroller`.\n\n///\n\n/// Example:\n\n///\n\n/// ```rust,ignore\n\n/// fn on_event(&mut self, event: Event) -> EventResult {\n\n/// scroll::on_event(self, event, Self::inner_on_event, Self::inner_important_area)\n\n/// }\n\n/// ```\n\npub fn on_event<T, OnEvent, ImportantArea>(\n\n scroller: &mut T, event: Event, on_event: OnEvent,\n\n important_area: ImportantArea,\n\n) -> EventResult\n\nwhere\n\n T: Scroller,\n\n OnEvent: FnMut(&mut T, Event) -> EventResult,\n\n ImportantArea: FnMut(&T, Vec2) -> Rect,\n\n{\n\n raw::on_event(\n\n event,\n\n scroller,\n\n Scroller::get_scroller_mut,\n\n on_event,\n\n important_area,\n\n )\n\n}\n\n\n","file_path":"src/view/scroll/mod.rs","rank":37,"score":118660.43670289627},{"content":"/// Performs `View::layout` on a `scroll::Scroller`.\n\npub fn layout<T, Layout, RequiredSize>(\n\n scroller: &mut T, size: Vec2, needs_relayout: bool, layout: Layout,\n\n required_size: RequiredSize,\n\n) where\n\n T: Scroller,\n\n Layout: FnMut(&mut T, Vec2),\n\n RequiredSize: FnMut(&mut T, Vec2) -> Vec2,\n\n{\n\n raw::layout(\n\n size,\n\n needs_relayout,\n\n scroller,\n\n Scroller::get_scroller_mut,\n\n required_size,\n\n layout,\n\n );\n\n}\n\n\n","file_path":"src/view/scroll/mod.rs","rank":38,"score":118642.49701489169},{"content":"pub fn draw<Model, GetScroller, Draw>(\n\n printer: &Printer, model: &Model, mut get_scroller: GetScroller,\n\n inner_draw: Draw,\n\n) where\n\n Model: ?Sized,\n\n GetScroller: FnMut(&Model) -> &scroll::Core,\n\n Draw: FnOnce(&Model, &Printer),\n\n{\n\n let printer = get_scroller(model).sub_printer(printer);\n\n inner_draw(model, &printer);\n\n}\n\n\n","file_path":"src/view/scroll/raw.rs","rank":39,"score":118642.49701489169},{"content":"#[derive(Clone, Debug, PartialEq)]\n\nenum ModuleFilter {\n\n All,\n\n Module,\n\n}\n\n\n","file_path":"src/views/debug_view.rs","rank":40,"score":117334.96983700953},{"content":"/// Moves top layer by the specified amount\n\nfn move_top(c: &mut Cursive, x_in: isize, y_in: isize) {\n\n // Step 1. Get the current position of the layer.\n\n let s = c.screen_mut();\n\n let l = LayerPosition::FromFront(0);\n\n\n\n // Step 2. add the specifed amount\n\n let pos = s.offset().saturating_add((x_in, y_in));\n\n\n\n // convert the new x and y into a position\n\n let p = Position::absolute(pos);\n\n\n\n // Step 3. Apply the new position\n\n s.reposition_layer(l, p);\n\n}\n\n\n","file_path":"examples/position.rs","rank":41,"score":117165.44428879586},{"content":"// Let's put the callback in a separate function to keep it clean,\n\n// but it's not required.\n\nfn show_next_window(siv: &mut Cursive, city: &str) {\n\n siv.pop_layer();\n\n let text = format!(\"{} is a great city!\", city);\n\n siv.add_layer(\n\n Dialog::around(TextView::new(text)).button(\"Quit\", |s| s.quit()),\n\n );\n\n}\n","file_path":"examples/select.rs","rank":42,"score":117107.52844253797},{"content":"/// Integer division that rounds up.\n\npub fn div_up<T>(p: T, q: T) -> T\n\nwhere\n\n T: Num + Clone,\n\n{\n\n let d = p.clone() / q.clone();\n\n\n\n if p % q == T::zero() {\n\n d\n\n } else {\n\n T::one() + d\n\n }\n\n}\n","file_path":"src/div.rs","rank":43,"score":116409.70458468744},{"content":"pub fn required_size<Model, GetScroller, RequiredSize>(\n\n constraint: Vec2, needs_relayout: bool, model: &mut Model,\n\n mut get_scroller: GetScroller, mut required_size: RequiredSize,\n\n) -> Vec2\n\nwhere\n\n Model: ?Sized,\n\n GetScroller: FnMut(&mut Model) -> &mut scroll::Core,\n\n RequiredSize: FnMut(&mut Model, Vec2) -> Vec2,\n\n{\n\n let (_, size) = sizes(\n\n constraint,\n\n false,\n\n needs_relayout,\n\n model,\n\n &mut get_scroller,\n\n &mut required_size,\n\n );\n\n\n\n size\n\n}\n\n\n","file_path":"src/view/scroll/raw.rs","rank":44,"score":114893.75305384866},{"content":"/// Parses the given string as markdown text.\n\npub fn parse<S>(input: S) -> StyledString\n\nwhere\n\n S: Into<String>,\n\n{\n\n let input = input.into();\n\n\n\n let spans = parse_spans(&input);\n\n\n\n StyledString::with_spans(input, spans)\n\n}\n\n\n\n/// Iterator that parse a markdown text and outputs styled spans.\n\npub struct Parser<'a> {\n\n first: bool,\n\n stack: Vec<Style>,\n\n input: &'a str,\n\n parser: pulldown_cmark::Parser<'a>,\n\n}\n\n\n\nimpl<'a> Parser<'a> {\n","file_path":"src/utils/markup/markdown.rs","rank":45,"score":114358.26788616757},{"content":"fn main() {\n\n // Initialize the cursive logger.\n\n cursive::logger::init();\n\n\n\n // Use some logging macros from the `log` crate.\n\n error!(\"Something serious probably happened!\");\n\n warn!(\"Or did it?\");\n\n debug!(\"Logger initialized.\");\n\n info!(\"Starting!\");\n\n\n\n let mut siv = cursive::Cursive::default();\n\n siv.add_layer(cursive::views::Dialog::text(\"Press ~ to open the console.\\nPress l to generate logs.\\nPress q to quit.\"));\n\n siv.add_global_callback('q', cursive::Cursive::quit);\n\n siv.add_global_callback('~', cursive::Cursive::toggle_debug_console);\n\n\n\n siv.add_global_callback('l', |_| trace!(\"Wooo\"));\n\n\n\n siv.run();\n\n}\n","file_path":"examples/debug_console.rs","rank":46,"score":113839.59278232366},{"content":"fn new_game(siv: &mut Cursive, options: game::Options) {\n\n let _board = game::Board::new(options);\n\n\n\n siv.add_layer(\n\n Dialog::new()\n\n .title(\"Minesweeper\")\n\n .content(\n\n LinearLayout::horizontal()\n\n .child(Panel::new(BoardView::new(options))),\n\n )\n\n .button(\"Quit game\", |s| {\n\n s.pop_layer();\n\n }),\n\n );\n\n\n\n siv.add_layer(Dialog::info(\n\n \"Controls:\n\nReveal cell: left click\n\nMark as mine: right-click\n\nReveal nearby unmarked cells: middle-click\",\n\n ));\n\n}\n","file_path":"examples/mines/main.rs","rank":47,"score":113017.65752788744},{"content":"/// Parse the given code into one or more event.\n\n///\n\n/// If the given event code should expend into multiple events\n\n/// (for instance click expends into PRESS + RELEASE),\n\n/// the returned Vec will include those queued events.\n\n///\n\n/// The main event is returned separately to avoid allocation in most cases.\n\nfn on_mouse_event<F>(bare_event: i32, mut f: F)\n\nwhere\n\n F: FnMut(MouseEvent),\n\n{\n\n let button = get_mouse_button(bare_event);\n\n match bare_event {\n\n ncurses::BUTTON1_RELEASED\n\n | ncurses::BUTTON2_RELEASED\n\n | ncurses::BUTTON3_RELEASED => f(MouseEvent::Release(button)),\n\n ncurses::BUTTON1_PRESSED\n\n | ncurses::BUTTON2_PRESSED\n\n | ncurses::BUTTON3_PRESSED => f(MouseEvent::Press(button)),\n\n ncurses::BUTTON4_PRESSED => f(MouseEvent::WheelUp),\n\n ncurses::BUTTON5_PRESSED => f(MouseEvent::WheelDown),\n\n // BUTTON4_RELEASED? BUTTON5_RELEASED?\n\n // Do they ever happen?\n\n _ => debug!(\"Unknown event: {:032b}\", bare_event),\n\n }\n\n}\n\n\n","file_path":"src/backend/curses/n.rs","rank":48,"score":113017.65752788744},{"content":"/// Result of a fitness test\n\n///\n\n/// Describes how well a chunk fits in the available space.\n\nenum ChunkFitResult {\n\n /// This chunk can fit as-is\n\n Fits,\n\n\n\n /// This chunk fits, but it'll be the last one.\n\n /// Additionally, its last char may need to be removed.\n\n FitsBarely,\n\n\n\n /// This chunk doesn't fit. Don't even.\n\n DoesNotFit,\n\n}\n\n\n","file_path":"src/utils/lines/spans/prefix.rs","rank":49,"score":112655.12097770226},{"content":"pub fn layout<Model, GetScroller, RequiredSize, Layout>(\n\n size: Vec2, needs_relayout: bool, model: &mut Model,\n\n mut get_scroller: GetScroller, mut required_size: RequiredSize,\n\n mut layout: Layout,\n\n) where\n\n Model: ?Sized,\n\n GetScroller: FnMut(&mut Model) -> &mut scroll::Core,\n\n RequiredSize: FnMut(&mut Model, Vec2) -> Vec2,\n\n Layout: FnMut(&mut Model, Vec2),\n\n{\n\n get_scroller(model).set_last_size(size);\n\n\n\n // This is what we'd like\n\n let (inner_size, self_size) = sizes(\n\n size,\n\n true,\n\n needs_relayout,\n\n model,\n\n &mut get_scroller,\n\n &mut required_size,\n\n );\n\n\n\n get_scroller(model).set_inner_size(inner_size);\n\n get_scroller(model).build_cache(self_size, size);\n\n\n\n layout(model, inner_size);\n\n\n\n get_scroller(model).update_offset();\n\n}\n\n\n","file_path":"src/view/scroll/raw.rs","rank":50,"score":112532.41472787847},{"content":"pub fn on_event<Model, GetScroller, OnEvent, ImportantArea>(\n\n event: Event, model: &mut Model, mut get_scroller: GetScroller,\n\n mut on_event: OnEvent, mut important_area: ImportantArea,\n\n) -> EventResult\n\nwhere\n\n Model: ?Sized,\n\n GetScroller: FnMut(&mut Model) -> &mut scroll::Core,\n\n OnEvent: FnMut(&mut Model, Event) -> EventResult,\n\n ImportantArea: FnMut(&Model, Vec2) -> Rect,\n\n{\n\n let mut relative_event = event.clone();\n\n let inside = get_scroller(model).is_event_inside(&mut relative_event);\n\n let result = if inside {\n\n on_event(model, relative_event)\n\n } else {\n\n EventResult::Ignored\n\n };\n\n let inner_size = get_scroller(model).inner_size();\n\n let important = important_area(model, inner_size);\n\n get_scroller(model).on_inner_event(event, result, important)\n\n}\n","file_path":"src/view/scroll/raw.rs","rank":51,"score":112532.41472787847},{"content":"/// Parse the given code into one or more event.\n\n///\n\n/// If the given event code should expend into multiple events\n\n/// (for instance click expends into PRESS + RELEASE),\n\n/// the returned Vec will include those queued events.\n\n///\n\n/// The main event is returned separately to avoid allocation in most cases.\n\nfn on_mouse_event<F>(bare_event: mmask_t, mut f: F)\n\nwhere\n\n F: FnMut(MouseEvent),\n\n{\n\n let button = get_mouse_button(bare_event);\n\n match bare_event {\n\n pancurses::BUTTON4_PRESSED => f(MouseEvent::WheelUp),\n\n pancurses::BUTTON5_PRESSED => f(MouseEvent::WheelDown),\n\n pancurses::BUTTON1_RELEASED\n\n | pancurses::BUTTON2_RELEASED\n\n | pancurses::BUTTON3_RELEASED\n\n | pancurses::BUTTON4_RELEASED\n\n | pancurses::BUTTON5_RELEASED => f(MouseEvent::Release(button)),\n\n pancurses::BUTTON1_PRESSED\n\n | pancurses::BUTTON2_PRESSED\n\n | pancurses::BUTTON3_PRESSED => f(MouseEvent::Press(button)),\n\n pancurses::BUTTON1_CLICKED\n\n | pancurses::BUTTON2_CLICKED\n\n | pancurses::BUTTON3_CLICKED\n\n | pancurses::BUTTON4_CLICKED\n","file_path":"src/backend/curses/pan.rs","rank":52,"score":111189.64234150623},{"content":"/// Parse the given markdown text into a list of spans.\n\n///\n\n/// This is a shortcut for `Parser::new(input).collect()`.\n\npub fn parse_spans(input: &str) -> Vec<StyledIndexedSpan> {\n\n Parser::new(input).collect()\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::utils::span::Span;\n\n\n\n #[test]\n\n fn test_parse() {\n\n let input = r\"\n","file_path":"src/utils/markup/markdown.rs","rank":53,"score":110796.43456573052},{"content":"fn add_fn<F>(start: i32, with_key: F, map: &mut HashMap<i32, Event>)\n\nwhere\n\n F: Fn(Key) -> Event,\n\n{\n\n for i in 0..12 {\n\n map.insert(start + i, with_key(Key::from_f((i + 1) as u8)));\n\n }\n\n}\n\n\n","file_path":"src/backend/curses/n.rs","rank":54,"score":109927.26227501413},{"content":"// Iterate over a toml\n\nfn iterate_toml<'a>(\n\n table: &'a toml::value::Table,\n\n) -> impl Iterator<Item = (&'a str, PaletteNode)> + 'a {\n\n table.iter().flat_map(|(key, value)| {\n\n let node = match value {\n\n toml::Value::Table(table) => {\n\n // This should define a new namespace\n\n // Treat basic colors as simple string.\n\n // We'll convert them back in the merge method.\n\n let map = iterate_toml(table)\n\n .map(|(key, value)| (key.to_string(), value))\n\n .collect();\n\n // Should we only return something if it's non-empty?\n\n Some(PaletteNode::Namespace(map))\n\n }\n\n toml::Value::Array(colors) => {\n\n // This should be a list of colors - just pick the first valid one.\n\n colors\n\n .iter()\n\n .flat_map(toml::Value::as_str)\n","file_path":"src/theme/palette.rs","rank":55,"score":109347.75230776737},{"content":"/// Returns length * value/max\n\n///\n\n/// Constraint: `value` from 0 to `max` should, as much as possible, produce equal-sized segments\n\n/// from 0 to length.\n\n///\n\n/// Returns a tuple with:\n\n/// * The integer part of the division\n\n/// * A value between 0 and 8 (exclusive) corresponding to the remainder.\n\nfn ratio(value: usize, max: usize, length: usize) -> (usize, usize) {\n\n let integer = length * value / max;\n\n let fraction = length * value - max * integer;\n\n\n\n let fraction = fraction * 8 / max;\n\n\n\n (integer, fraction)\n\n}\n\n\n\nnew_default!(ProgressBar);\n\n\n\nimpl ProgressBar {\n\n /// Creates a new progress bar.\n\n ///\n\n /// Default values:\n\n ///\n\n /// * `min`: 0\n\n /// * `max`: 100\n\n /// * `value`: 0\n\n pub fn new() -> Self {\n","file_path":"src/views/progress_bar.rs","rank":56,"score":109200.47717355115},{"content":"fn record_above_set_filter(\n\n record_level: log::Level,\n\n display_filter: log::LevelFilter,\n\n) -> bool {\n\n // If no display filter set (ie, the user has not applied a log filter yet), display all logs\n\n match display_filter.to_level() {\n\n Some(display_level) => (record_level <= display_level),\n\n None => true\n\n }\n\n}\n\n\n","file_path":"src/views/debug_view.rs","rank":57,"score":106171.55587266857},{"content":"#[allow(dead_code)]\n\nfn make_mask(n: usize) -> u8 {\n\n let mut r = 0_u8;\n\n for i in 0..n {\n\n r |= 1 << i;\n\n }\n\n r\n\n}\n","file_path":"src/utf8.rs","rank":58,"score":104040.8048552974},{"content":"fn make_percentage(value: usize, (min, max): (usize, usize)) -> String {\n\n if value < min {\n\n return String::from(\"0 %\");\n\n }\n\n\n\n let (percentage, extra) = ratio(value - min, max - min, 100);\n\n let percentage = if extra > 4 {\n\n percentage + 1\n\n } else {\n\n percentage\n\n };\n\n format!(\"{} %\", percentage)\n\n}\n\n\n","file_path":"src/views/progress_bar.rs","rank":59,"score":103812.02304332786},{"content":"fn fill_key_codes<F>(target: &mut HashMap<i32, Event>, f: F)\n\nwhere\n\n F: Fn(i32) -> Option<String>,\n\n{\n\n let key_names = hashmap! {\n\n \"DC\" => Key::Del,\n\n \"DN\" => Key::Down,\n\n \"END\" => Key::End,\n\n \"HOM\" => Key::Home,\n\n \"IC\" => Key::Ins,\n\n \"LFT\" => Key::Left,\n\n \"NXT\" => Key::PageDown,\n\n \"PRV\" => Key::PageUp,\n\n \"RIT\" => Key::Right,\n\n \"UP\" => Key::Up,\n\n };\n\n\n\n for code in 512..1024 {\n\n let name = match f(code) {\n\n Some(name) => name,\n","file_path":"src/backend/curses/mod.rs","rank":60,"score":102495.55648207958},{"content":"/// Performs `View::draw` on a `scroll::Scroller`.\n\npub fn draw<T, Draw>(scroller: &T, printer: &Printer, draw: Draw)\n\nwhere\n\n T: Scroller,\n\n Draw: FnOnce(&T, &Printer),\n\n{\n\n raw::draw(printer, scroller, Scroller::get_scroller, draw);\n\n}\n\n\n","file_path":"src/view/scroll/mod.rs","rank":61,"score":101771.21383749772},{"content":"// Define this type separately to appease the Clippy god\n\ntype CallOnAny<T> = Box<dyn for<'a> FnMut(&mut T, &Selector, AnyCb<'a>)>;\n\n\n\n/// A blank view that forwards calls to closures.\n\n///\n\n/// You can use this view to easily draw your own interface.\n\npub struct Canvas<T> {\n\n state: T,\n\n\n\n draw: Box<dyn Fn(&T, &Printer)>,\n\n on_event: Box<dyn FnMut(&mut T, Event) -> EventResult>,\n\n required_size: Box<dyn FnMut(&mut T, Vec2) -> Vec2>,\n\n layout: Box<dyn FnMut(&mut T, Vec2)>,\n\n take_focus: Box<dyn FnMut(&mut T, Direction) -> bool>,\n\n needs_relayout: Box<dyn Fn(&T) -> bool>,\n\n focus_view: Box<dyn FnMut(&mut T, &Selector) -> Result<(), ()>>,\n\n call_on_any: CallOnAny<T>,\n\n important_area: Box<dyn Fn(&T, Vec2) -> Rect>,\n\n}\n\n\n\nimpl<T: 'static + View> Canvas<T> {\n","file_path":"src/views/canvas.rs","rank":62,"score":99193.05458731823},{"content":"// Function to simulate a long process.\n\nfn fake_load(n_max: usize, counter: &Counter) {\n\n for _ in 0..n_max {\n\n thread::sleep(Duration::from_millis(5));\n\n // The `counter.tick()` method increases the progress value\n\n counter.tick(1);\n\n }\n\n}\n","file_path":"examples/progress.rs","rank":63,"score":98199.00906276808},{"content":"fn header(level: usize) -> &'static str {\n\n &\"##########\"[..level]\n\n}\n\n\n\nimpl<'a> Iterator for Parser<'a> {\n\n type Item = StyledIndexedSpan;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n loop {\n\n let next = match self.parser.next() {\n\n None => return None,\n\n Some(event) => event,\n\n };\n\n\n\n match next {\n\n Event::Start(tag) => match tag {\n\n // Add to the stack!\n\n Tag::Emphasis => {\n\n self.stack.push(Style::from(Effect::Italic))\n\n }\n","file_path":"src/utils/markup/markdown.rs","rank":64,"score":96054.05642943982},{"content":"fn sub_block(extra: usize) -> &'static str {\n\n match extra {\n\n 0 => \" \",\n\n 1 => \"▏\",\n\n 2 => \"▎\",\n\n 3 => \"▍\",\n\n 4 => \"▌\",\n\n 5 => \"▋\",\n\n 6 => \"▊\",\n\n 7 => \"▉\",\n\n _ => \"█\",\n\n }\n\n}\n\n\n\nimpl View for ProgressBar {\n\n fn draw(&self, printer: &Printer<'_, '_>) {\n\n // Now, the bar itself...\n\n let available = printer.size.x;\n\n\n\n let value = self.value.get();\n","file_path":"src/views/progress_bar.rs","rank":65,"score":94023.1004502685},{"content":"/// Internal function to aid the creation of the DebugViewFilter.\n\n/// Returns a SelectView to update the minimum severity of new logs saved in the circular buffer\n\n/// Wrapped by a Panel and BoxView for appearance\n\nfn debug_set_log_level() -> views::Panel<views::BoxView<views::ListView>> {\n\n views::Panel::new(views::BoxView::with_full_width(views::ListView::new().child(\n\n \"Set Max Log Level\",\n\n views::SelectView::new()\n\n .popup()\n\n .item(\"Debug\", log::LevelFilter::Debug)\n\n .item(\"Info\", log::LevelFilter::Info)\n\n .item(\"Warn\", log::LevelFilter::Warn)\n\n .item(\"Error\", log::LevelFilter::Error)\n\n .on_submit({\n\n move |_s, new_log_level| {\n\n log::set_max_level(*new_log_level);\n\n }\n\n }),\n\n )))\n\n}\n\n\n","file_path":"src/views/debug_view.rs","rank":66,"score":94012.01858998794},{"content":"/// Returns a `&str` with `length` characters `*`.\n\n///\n\n/// Only works for small `length` (1 or 2).\n\n/// Best used for single character replacement.\n\nfn make_small_stars(length: usize) -> &'static str {\n\n // TODO: be able to use any character as hidden mode?\n\n &\"****\"[..length]\n\n}\n\n\n\nimpl View for EditView {\n\n fn draw(&self, printer: &Printer<'_, '_>) {\n\n assert_eq!(\n\n printer.size.x, self.last_length,\n\n \"Was promised {}, received {}\",\n\n self.last_length, printer.size.x\n\n );\n\n\n\n let width = self.content.width();\n\n printer.with_color(self.style, |printer| {\n\n let effect = if self.enabled && printer.enabled {\n\n Effect::Reverse\n\n } else {\n\n Effect::Simple\n\n };\n","file_path":"src/views/edit_view.rs","rank":67,"score":92101.86719072246},{"content":"/// Internal function to aid the creation of the DebugViewFilter.\n\n/// Returns a SelectView to modify the minimum log severity displayed.\n\n/// Wrapped by a Panel and BoxView for appearance\n\nfn debug_set_log_filter(debug_view_id: &'static str) -> views::Panel<views::BoxView<views::ListView>> {\n\n views::Panel::new(views::BoxView::with_full_width(views::ListView::new().child(\n\n \"Filter Log Levels\",\n\n views::SelectView::new()\n\n .popup()\n\n .item(\"Debug\", log::LevelFilter::Debug)\n\n .item(\"Info\", log::LevelFilter::Info)\n\n .item(\"Warn\", log::LevelFilter::Warn)\n\n .item(\"Error\", log::LevelFilter::Error)\n\n .on_submit({\n\n move |s, new_filter| {\n\n s.call_on_id(&debug_view_id, {\n\n move |debug_view: &mut views::DebugView| {\n\n debug_view.set_filter(new_filter.clone());\n\n }\n\n });\n\n }\n\n }),\n\n )))\n\n}\n\n\n","file_path":"src/views/debug_view.rs","rank":68,"score":91926.53671765618},{"content":"/// Internal function to aid the creation of the DebugViewFilter.\n\n/// Returns a SelectView to modify whether all logs, or only logs relating to a custom module, are\n\n/// displayed. Wrapped by a Panel and BoxView for appearance\n\nfn debug_set_mod_filter(debug_view_id: &'static str) -> views::Panel<views::BoxView<views::ListView>> {\n\n let mut filter_module_select_view = views::SelectView::new()\n\n .popup()\n\n .item(\"All\", ModuleFilter::All)\n\n .on_submit({\n\n move |s, mod_filter| {\n\n s.call_on_id(&debug_view_id, {\n\n move |debug_view: &mut views::DebugView| {\n\n debug_view.set_module(mod_filter.clone());\n\n }\n\n });\n\n }\n\n });\n\n\n\n // If the logger has been initialised to monitor a custom module, add to the SelectView\n\n let module = logger::MODULE.lock().unwrap();\n\n if let Some(ref module_name) = *module {\n\n filter_module_select_view.add_item(module_name.to_string(), ModuleFilter::Module)\n\n };\n\n\n","file_path":"src/views/debug_view.rs","rank":69,"score":91926.42070829423},{"content":"fn make_rows(text: &str, width: usize) -> Vec<Row> {\n\n // We can't make rows with width=0, so force at least width=1.\n\n let width = usize::max(width, 1);\n\n LinesIterator::new(text, width).show_spaces().collect()\n\n}\n\n\n\nnew_default!(TextArea);\n\n\n\nimpl TextArea {\n\n /// Creates a new, empty TextArea.\n\n pub fn new() -> Self {\n\n TextArea {\n\n content: String::new(),\n\n rows: Vec::new(),\n\n enabled: true,\n\n scrollbase: ScrollBase::new().right_padding(0),\n\n size_cache: None,\n\n last_size: Vec2::zero(),\n\n cursor: 0,\n\n }\n","file_path":"src/views/text_area.rs","rank":70,"score":88284.78983931888},{"content":"// Gradient for the front color\n\nfn front_color(x: u8, y: u8, x_max: u8, y_max: u8) -> Color {\n\n // We return a full 24-bits RGB color, but some backends\n\n // will project it to a 256-colors palette.\n\n Color::Rgb(\n\n x * (255 / x_max),\n\n y * (255 / y_max),\n\n (x + 2 * y) * (255 / (x_max + 2 * y_max)),\n\n )\n\n}\n\n\n","file_path":"examples/colors.rs","rank":71,"score":87857.10449221743},{"content":"// Gradient for the background color\n\nfn back_color(x: u8, y: u8, x_max: u8, y_max: u8) -> Color {\n\n // Let's try to have a gradient in a different direction than the front color.\n\n Color::Rgb(\n\n 128 + (2 * y_max + x - 2 * y) * (128 / (x_max + 2 * y_max)),\n\n 255 - y * (255 / y_max),\n\n 255 - x * (255 / x_max),\n\n )\n\n}\n","file_path":"examples/colors.rs","rank":72,"score":87851.85411513755},{"content":"#[derive(Clone, Copy, PartialEq)]\n\nenum Cell {\n\n Visible(usize),\n\n Flag,\n\n Unknown,\n\n}\n\n\n","file_path":"examples/mines/main.rs","rank":73,"score":78087.49801784399},{"content":"#[derive(PartialEq, Debug)]\n\nenum State {\n\n /// The menubar is inactive.\n\n Inactive,\n\n /// The menubar is actively selected.\n\n ///\n\n /// It will receive input.\n\n Selected,\n\n /// The menubar is still visible, but a submenu is open.\n\n ///\n\n /// It will not receive input.\n\n Submenu,\n\n}\n\n\n\n/// Shows a single-line list of items, with pop-up menus when one is selected.\n\n///\n\n/// The [`Cursive`] root already includes a menubar\n\n/// that you just need to configure.\n\n///\n\n/// [`Cursive`]: ../struct.Cursive.html#method.menubar\n\npub struct Menubar {\n","file_path":"src/views/menubar.rs","rank":74,"score":78082.40367827428},{"content":"enum ColorRole {\n\n Foreground,\n\n Background,\n\n}\n\n\n\n/// Backend using BearLibTerminal\n\npub struct Backend {\n\n buttons_pressed: HashSet<MouseButton>,\n\n mouse_position: Vec2,\n\n}\n\n\n\nimpl Backend {\n\n /// Creates a new BearLibTerminal-based backend.\n\n pub fn init() -> Box<dyn backend::Backend> {\n\n // TODO: Add some error handling?\n\n terminal::open(\"Cursive\", 80, 24);\n\n terminal::set(terminal::config::Window::empty().resizeable(true));\n\n terminal::set(vec![\n\n terminal::config::InputFilter::Group {\n\n group: terminal::config::InputFilterGroup::Keyboard,\n","file_path":"src/backend/blt.rs","rank":75,"score":76711.18853508454},{"content":"/// Where should the view be on the screen (per dimension).\n\nenum Placement {\n\n /// View is floating at a specific position.\n\n Floating(Position),\n\n\n\n /// View is full-screen; it should not have a 1-cell border.\n\n Fullscreen,\n\n}\n\n\n\n/// Identifies a layer in a `StackView`.\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\n\npub enum LayerPosition {\n\n /// Starts from the back (bottom) of the stack.\n\n FromBack(usize),\n\n /// Starts from the front (top) of the stack.\n\n FromFront(usize),\n\n}\n\n\n\nimpl Placement {\n\n pub fn compute_offset<S, A, P>(\n\n &self, size: S, available: A, parent: P,\n","file_path":"src/views/stack_view.rs","rank":76,"score":76711.18853508454},{"content":"#[derive(PartialEq, Clone)]\n\nenum TriggerPhase {\n\n BeforeChild,\n\n AfterChild,\n\n}\n\n\n\nimpl<T: View> OnEventView<T> {\n\n /// Wraps the given view in a new OnEventView.\n\n pub fn new(view: T) -> Self {\n\n OnEventView {\n\n view,\n\n callbacks: Vec::new(),\n\n }\n\n }\n\n\n\n /// Registers a callback when the given event is ignored by the child.\n\n ///\n\n /// Chainable variant.\n\n ///\n\n /// # Examples\n\n ///\n","file_path":"src/views/on_event_view.rs","rank":77,"score":75431.52034880916},{"content":"/// A view that can be downcasted to its concrete type.\n\n///\n\n/// This trait is automatically implemented for any `T: View`.\n\npub trait AnyView {\n\n /// Downcast self to a `Any`.\n\n fn as_any(&self) -> &dyn Any;\n\n\n\n /// Downcast self to a mutable `Any`.\n\n fn as_any_mut(&mut self) -> &mut dyn Any;\n\n\n\n /// Returns a boxed any from a boxed self.\n\n ///\n\n /// Can be used before `Box::downcast()`.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```rust\n\n /// # use cursive::views::TextView;\n\n /// # use cursive::view::View;\n\n /// # fn main() {\n\n /// let boxed: Box<View> = Box::new(TextView::new(\"text\"));\n\n /// let text: Box<TextView> = boxed.as_boxed_any().downcast().unwrap();\n\n /// # }\n","file_path":"src/view/any.rs","rank":78,"score":74154.06471269269},{"content":"/// Generic trait to enable chainable API\n\npub trait With: Sized {\n\n /// Calls the given closure on `self`.\n\n fn with<F: FnOnce(&mut Self)>(mut self, f: F) -> Self {\n\n f(&mut self);\n\n self\n\n }\n\n\n\n /// Calls the given closure on `self`.\n\n fn try_with<E, F>(mut self, f: F) -> Result<Self, E>\n\n where\n\n F: FnOnce(&mut Self) -> Result<(), E>,\n\n {\n\n f(&mut self)?;\n\n Ok(self)\n\n }\n\n\n\n /// Calls the given closure if `condition == true`.\n\n fn with_if<F>(mut self, condition: bool, f: F) -> Self\n\n where\n\n F: FnOnce(&mut Self),\n\n {\n\n if condition {\n\n f(&mut self);\n\n }\n\n self\n\n }\n\n}\n\n\n\nimpl<T: Sized> With for T {}\n","file_path":"src/with.rs","rank":79,"score":73718.90374197383},{"content":"/// Provides `call_on<V: View>` to views.\n\n///\n\n/// This trait is mostly a wrapper around [`View::call_on_any`].\n\n///\n\n/// It provides a nicer interface to find a view when you know its type.\n\n///\n\n/// [`View::call_on_any`]: ./trait.View.html#method.call_on_any\n\npub trait Finder {\n\n /// Runs a callback on the view identified by `sel`.\n\n ///\n\n /// If the view is found, return the result of `callback`.\n\n ///\n\n /// If the view is not found, or if it is not of the asked type,\n\n /// it returns `None`.\n\n fn call_on<V, F, R>(\n\n &mut self, sel: &Selector<'_>, callback: F,\n\n ) -> Option<R>\n\n where\n\n V: View + Any,\n\n F: FnOnce(&mut V) -> R;\n\n\n\n /// Convenient method to use `call_on` with a `view::Selector::Id`.\n\n fn call_on_id<V, F, R>(&mut self, id: &str, callback: F) -> Option<R>\n\n where\n\n V: View + Any,\n\n F: FnOnce(&mut V) -> R,\n\n {\n","file_path":"src/view/finder.rs","rank":80,"score":72797.57483840935},{"content":"/// Trait defining the required methods to be a backend.\n\n///\n\n/// A backend is the interface between the abstract view tree and the actual\n\n/// input/output, like a terminal.\n\n///\n\n/// It usually delegates the work to a terminal-handling library like ncurses\n\n/// or termion, or it can entirely simulate a terminal and show it as a\n\n/// graphical window (`BearLibTerminal`).\n\n///\n\n/// When creating a new cursive tree with `Cursive::new()`, you will need to\n\n/// provide a backend initializer - usually their `init()` function.\n\n///\n\n/// Backends are responsible for handling input and converting it to `Event`. Input must be\n\n/// non-blocking, it will be polled regularly.\n\npub trait Backend {\n\n /// Polls the backend for any input.\n\n ///\n\n /// Should return immediately.\n\n fn poll_event(&mut self) -> Option<Event>;\n\n\n\n // TODO: take `self` by value?\n\n // Or implement Drop?\n\n /// Prepares to close the backend.\n\n ///\n\n /// This should clear any state in the terminal.\n\n fn finish(&mut self);\n\n\n\n /// Refresh the screen.\n\n ///\n\n /// This will be called each frame after drawing has been done.\n\n ///\n\n /// A backend could, for example, buffer any print command, and apply\n\n /// everything when refresh() is called.\n\n fn refresh(&mut self);\n","file_path":"src/backend/mod.rs","rank":81,"score":72793.32576726643},{"content":"/// Describes an item with a scroll core.\n\n///\n\n/// This trait is used to represent \"something that can scroll\".\n\n/// All it needs is an accessible core.\n\n///\n\n/// See the various methods in the [`scroll`](crate::view::scroll) module.\n\npub trait Scroller {\n\n /// Returns a mutable access to the scroll core.\n\n fn get_scroller_mut(&mut self) -> &mut Core;\n\n\n\n /// Returns an immutable access to the scroll core.\n\n fn get_scroller(&self) -> &Core;\n\n}\n\n\n\n/// Core system for scrolling views.\n\n///\n\n/// See also [`ScrollView`](crate::views::ScrollView).\n\n#[derive(Debug)]\n\npub struct Core {\n\n /// This is the size the child thinks we're giving him.\n\n inner_size: Vec2,\n\n\n\n /// Offset into the inner view.\n\n ///\n\n /// Our `(0,0)` will be inner's `offset`\n\n offset: Vec2,\n","file_path":"src/view/scroll/core.rs","rank":82,"score":71517.71765514123},{"content":"/// Generic trait for elements that can be converted into a `ViewPath`.\n\npub trait ToPath {\n\n /// Creates a path from the element.\n\n fn to_path(self) -> ViewPath;\n\n}\n\n\n\nimpl<'a> ToPath for &'a [usize] {\n\n fn to_path(self) -> ViewPath {\n\n ViewPath {\n\n path: self.to_owned(),\n\n }\n\n }\n\n}\n","file_path":"src/view/view_path.rs","rank":83,"score":71513.50647669955},{"content":"/// Describes an object that appears like a `SpannedStr`.\n\npub trait SpannedText {\n\n /// Type of span returned by `SpannedText::spans()`.\n\n type S: AsRef<IndexedCow>;\n\n\n\n /// Returns the source text.\n\n fn source(&self) -> &str;\n\n\n\n /// Returns the spans for this text.\n\n fn spans(&self) -> &[Self::S];\n\n\n\n /// Returns a `SpannedText` by reference.\n\n fn as_ref(&self) -> SpannedTextRef<'_, Self> {\n\n SpannedTextRef { r: self }\n\n }\n\n}\n\n\n\n/// A reference to another `SpannedText`.\n\npub struct SpannedTextRef<'a, C>\n\nwhere\n\n C: SpannedText + ?Sized,\n","file_path":"src/utils/span.rs","rank":84,"score":71513.50647669955},{"content":"fn main() {\n\n // Start as usual\n\n let mut siv = Cursive::default();\n\n siv.add_global_callback('q', |s| s.quit());\n\n\n\n // Canvas lets us easily override any method.\n\n // Canvas can have states, but we don't need any here, so we use `()`.\n\n siv.add_layer(Canvas::new(()).with_draw(draw).fixed_size((20, 10)));\n\n\n\n siv.run();\n\n}\n\n\n","file_path":"examples/colors.rs","rank":85,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n // Create a dialog with an edit text and a button.\n\n // The user can either hit the <Ok> button,\n\n // or press Enter on the edit text.\n\n siv.add_layer(\n\n Dialog::new()\n\n .title(\"Enter your name\")\n\n // Padding is (left, right, top, bottom)\n\n .padding((1, 1, 1, 0))\n\n .content(\n\n EditView::new()\n\n // Call `show_popup` when the user presses `Enter`\n\n .on_submit(show_popup)\n\n // Give the `EditView` a name so we can refer to it later.\n\n .with_id(\"name\")\n\n // Wrap this in a `BoxView` with a fixed width.\n\n // Do this _after_ `with_id` or the name will point to the\n\n // `BoxView` instead of `EditView`!\n","file_path":"examples/edit.rs","rank":86,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n // Some description text. We want it to be long, but not _too_ long.\n\n let text = \"This is a very simple example of linear layout. Two views \\\n\n are present, a short title above, and this text. The text \\\n\n has a fixed width, and the title is centered horizontally.\";\n\n\n\n // We'll create a dialog with a TextView serving as a title\n\n siv.add_layer(\n\n Dialog::around(\n\n LinearLayout::vertical()\n\n .child(TextView::new(\"Title\").h_align(HAlign::Center))\n\n // Use a DummyView as spacer\n\n .child(DummyView.fixed_height(1))\n\n // Disabling scrollable means the view cannot shrink.\n\n .child(TextView::new(text))\n\n // The other views will share the remaining space.\n\n .child(TextView::new(text).scrollable())\n\n .child(TextView::new(text).scrollable())\n\n .child(TextView::new(text).scrollable())\n\n .fixed_width(30),\n\n )\n\n .button(\"Quit\", |s| s.quit())\n\n .h_align(HAlign::Center),\n\n );\n\n\n\n siv.run();\n\n}\n","file_path":"examples/linear.rs","rank":87,"score":70727.56173792123},{"content":"fn main() {\n\n // Creates the cursive root - required for every application.\n\n let mut siv = Cursive::default();\n\n\n\n // Creates a dialog with a single \"Quit\" button\n\n siv.add_layer(\n\n // Most views can be configured in a chainable way\n\n CircularFocus::wrap_tab(\n\n Dialog::around(TextView::new(\"Hello Dialog!\"))\n\n .title(\"Cursive\")\n\n .button(\"Foo\", |_s| ())\n\n .button(\"Quit\", |s| s.quit()),\n\n ),\n\n );\n\n\n\n // Starts the event loop.\n\n siv.run();\n\n}\n","file_path":"examples/dialog.rs","rank":88,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n // We can quit by pressing `q`\n\n siv.add_global_callback('q', Cursive::quit);\n\n // Next Gen FPS Controls.\n\n siv.add_global_callback('w', |s| move_top(s, 0, -1));\n\n siv.add_global_callback('a', |s| move_top(s, -1, 0));\n\n siv.add_global_callback('s', |s| move_top(s, 0, 1));\n\n siv.add_global_callback('d', |s| move_top(s, 1, 0));\n\n\n\n // Add window to fly around.\n\n siv.add_layer(TextView::new(\n\n \"Press w,a,s,d to move the window.\\n\\\n\n Press q to quit the application.\",\n\n ));\n\n\n\n // Run the event loop\n\n siv.run();\n\n}\n","file_path":"examples/position.rs","rank":89,"score":70727.56173792123},{"content":"fn main() {\n\n // Read some long text from a file.\n\n let content = include_str!(\"../assets/lorem.txt\");\n\n\n\n let mut siv = Cursive::default();\n\n\n\n // We can quit by pressing q\n\n siv.add_global_callback('q', |s| s.quit());\n\n\n\n // The text is too long to fit on a line, so the view will wrap lines,\n\n // and will adapt to the terminal size.\n\n siv.add_fullscreen_layer(\n\n Dialog::around(Panel::new(TextView::new(content).scrollable()))\n\n .title(\"Unicode and wide-character support\")\n\n // This is the alignment for the button\n\n .h_align(HAlign::Center)\n\n .button(\"Quit\", |s| s.quit()),\n\n );\n\n // Show a popup on top of the view.\n\n siv.add_layer(Dialog::info(\n\n \"Try resizing the terminal!\\n(Press 'q' to \\\n\n quit when you're done.)\",\n\n ));\n\n\n\n siv.run();\n\n}\n","file_path":"examples/lorem.rs","rank":90,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n siv.add_global_callback('q', |s| s.quit());\n\n\n\n // Let's add a simple slider in a dialog.\n\n // Moving the slider will update the dialog's title.\n\n // And pressing \"Enter\" will show a new dialog.\n\n siv.add_layer(\n\n Dialog::around(\n\n // We give the number of steps in the constructor\n\n SliderView::horizontal(15)\n\n // Sets the initial value\n\n .value(7)\n\n .on_change(|s, v| {\n\n let title = format!(\"[ {} ]\", v);\n\n s.call_on_id(\"dialog\", |view: &mut Dialog| {\n\n view.set_title(title)\n\n });\n\n })\n","file_path":"examples/slider.rs","rank":91,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n // We'll start slowly with a simple start button...\n\n siv.add_layer(\n\n Dialog::new()\n\n .title(\"Progress bar example\")\n\n .padding((0, 0, 1, 1))\n\n .content(Button::new(\"Start\", phase_1)),\n\n );\n\n\n\n siv.run();\n\n}\n\n\n","file_path":"examples/progress.rs","rank":92,"score":70727.56173792123},{"content":"fn main() {\n\n // As usual, create the Cursive root\n\n let mut siv = Cursive::default();\n\n\n\n let cb_sink = siv.cb_sink().clone();\n\n\n\n // We want to refresh the page even when no input is given.\n\n siv.add_global_callback('q', |s| s.quit());\n\n\n\n // A channel will communicate data from our running task to the UI.\n\n let (tx, rx) = mpsc::channel();\n\n\n\n // Generate data in a separate thread.\n\n thread::spawn(move || {\n\n generate_logs(&tx, cb_sink);\n\n });\n\n\n\n // And sets the view to read from the other end of the channel.\n\n siv.add_layer(BufferView::new(200, rx).full_screen());\n\n\n\n siv.run();\n\n}\n\n\n","file_path":"examples/logs.rs","rank":93,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n let content = \"Press Q to quit the application.\\n\\nPress P to open the \\\n\n popup.\";\n\n\n\n siv.add_global_callback('q', |s| s.quit());\n\n\n\n // Let's wrap the view to give it a recognizable ID, so we can look for it.\n\n // We add the P callback on the textview only (and not globally),\n\n // so that we can't call it when the popup is already visible.\n\n siv.add_layer(\n\n OnEventView::new(TextView::new(content).with_id(\"text\"))\n\n .on_event('p', |s| show_popup(s)),\n\n );\n\n\n\n siv.run();\n\n}\n\n\n","file_path":"examples/mutation.rs","rank":94,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = cursive::Cursive::default();\n\n\n\n siv.add_layer(\n\n Dialog::around(\n\n LinearLayout::vertical()\n\n .child(Button::new(\"Foo\", |s| s.add_layer(Dialog::info(\"Ah\"))))\n\n .child(Canvas::new(()).with_draw(draw).fixed_size((120, 40)))\n\n .child(Button::new(\"Bar\", |s| s.add_layer(Dialog::info(\"Uh\"))))\n\n .scrollable()\n\n .scroll_x(true),\n\n )\n\n .fixed_size((60, 30)),\n\n );\n\n\n\n siv.add_global_callback('q', |s| s.quit());\n\n\n\n siv.run();\n\n}\n\n\n","file_path":"examples/scroll.rs","rank":95,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n // We'll use a counter to name new files.\n\n let counter = AtomicUsize::new(1);\n\n\n\n // The menubar is a list of (label, menu tree) pairs.\n\n siv.menubar()\n\n // We add a new \"File\" tree\n\n .add_subtree(\n\n \"File\",\n\n MenuTree::new()\n\n // Trees are made of leaves, with are directly actionable...\n\n .leaf(\"New\", move |s| {\n\n // Here we use the counter to add an entry\n\n // in the list of \"Recent\" items.\n\n let i = counter.fetch_add(1, Ordering::Relaxed);\n\n let filename = format!(\"New {}\", i);\n\n s.menubar()\n\n .find_subtree(\"File\")\n","file_path":"examples/menubar.rs","rank":96,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n let mut styled = StyledString::plain(\"Isn't \");\n\n styled.append(StyledString::styled(\"that \", Color::Dark(BaseColor::Red)));\n\n styled.append(StyledString::styled(\n\n \"cool?\",\n\n Style::from(Color::Light(BaseColor::Blue)).combine(Effect::Bold),\n\n ));\n\n\n\n // TextView can natively accept StyledString.\n\n siv.add_layer(\n\n Dialog::around(TextView::new(styled))\n\n .button(\"Hell yeah!\", |s| s.quit()),\n\n );\n\n\n\n siv.run();\n\n}\n","file_path":"examples/markup.rs","rank":97,"score":70727.56173792123},{"content":"fn main() {\n\n let mut siv = Cursive::default();\n\n\n\n // We need to pre-create the groups for our RadioButtons.\n\n let mut color_group: RadioGroup<String> = RadioGroup::new();\n\n let mut size_group: RadioGroup<u32> = RadioGroup::new();\n\n\n\n siv.add_layer(\n\n Dialog::new()\n\n .title(\"Make your selection\")\n\n // We'll have two columns side-by-side\n\n .content(\n\n LinearLayout::horizontal()\n\n .child(\n\n LinearLayout::vertical()\n\n // The color group uses the label itself as stored value\n\n // By default, the first item is selected.\n\n .child(color_group.button_str(\"Red\"))\n\n .child(color_group.button_str(\"Green\"))\n\n .child(color_group.button_str(\"Blue\")),\n","file_path":"examples/radio.rs","rank":98,"score":70727.56173792123},{"content":"fn main() {\n\n let mut select = SelectView::new()\n\n // Center the text horizontally\n\n .h_align(HAlign::Center)\n\n // Use keyboard to jump to the pressed letters\n\n .autojump();\n\n\n\n // Read the list of cities from separate file, and fill the view with it.\n\n // (We include the file at compile-time to avoid runtime read errors.)\n\n let content = include_str!(\"../assets/cities.txt\");\n\n select.add_all_str(content.lines());\n\n\n\n // Sets the callback for when \"Enter\" is pressed.\n\n select.set_on_submit(show_next_window);\n\n\n\n // Let's override the `j` and `k` keys for navigation\n\n let select = OnEventView::new(select)\n\n .on_pre_event_inner('k', |s, _| {\n\n s.select_up(1);\n\n Some(EventResult::Consumed(None))\n","file_path":"examples/select.rs","rank":99,"score":70727.56173792123}],"string":"[\n {\n \"content\": \"fn cap<'a, I: Iterator<Item = &'a mut usize>>(iter: I, max: usize) {\\n\\n let mut available = max;\\n\\n for item in iter {\\n\\n if *item > available {\\n\\n *item = available;\\n\\n }\\n\\n\\n\\n available -= *item;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl LinearLayout {\\n\\n /// Creates a new layout with the given orientation.\\n\\n pub fn new(orientation: direction::Orientation) -> Self {\\n\\n LinearLayout {\\n\\n children: Vec::new(),\\n\\n orientation,\\n\\n focus: 0,\\n\\n cache: None,\\n\\n }\\n\",\n \"file_path\": \"src/views/linear_layout.rs\",\n \"rank\": 0,\n \"score\": 216632.62417401368\n },\n {\n \"content\": \"/// Wraps a `FnMut` into a `Fn`\\n\\n///\\n\\n/// This can be used to use a `FnMut` when a callack expects a `Fn`.\\n\\n///\\n\\n/// # Note\\n\\n///\\n\\n/// If the resulting `Fn` is called recursively, subsequent calls will be\\n\\n/// no-ops.\\n\\npub fn immutify<F: FnMut(&mut Cursive)>(\\n\\n f: F,\\n\\n) -> impl for<'s> Fn(&'s mut Cursive) {\\n\\n let callback = RefCell::new(f);\\n\\n move |s| {\\n\\n // Here's the weird trick: if we're already borrowed,\\n\\n // just ignored the callback.\\n\\n if let Ok(mut f) = callback.try_borrow_mut() {\\n\\n // Beeeaaah that's ugly.\\n\\n // Why do we need to manually dereference here?\\n\\n (&mut *f)(s);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n*/\\n\\n\\n\\n/// Macro to wrap a `FnMut` with 1 argument into a `Fn`.\\n\\n///\\n\\n/// This can wrap any `FnMut` with a single arguments (for example `&mut Cursive`).\\n\",\n \"file_path\": \"src/utils/immutify.rs\",\n \"rank\": 1,\n \"score\": 201095.8785707883\n },\n {\n \"content\": \"/// Computes the longest suffix that fits in the given `width`.\\n\\n///\\n\\n/// Doesn't break inside elements returned by `iter`.\\n\\n///\\n\\n/// Returns the number of bytes of the longest\\n\\n/// suffix from `text` that fits in `width`.\\n\\n///\\n\\n/// This is a shortcut for `prefix_length(iter.rev(), width, delimiter)`\\n\\npub fn suffix<'a, I>(iter: I, width: usize, delimiter: &str) -> Span\\n\\nwhere\\n\\n I: DoubleEndedIterator<Item = &'a str>,\\n\\n{\\n\\n prefix(iter.rev(), width, delimiter)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/lines/simple/mod.rs\",\n \"rank\": 2,\n \"score\": 190800.94876694045\n },\n {\n \"content\": \"/// Computes a prefix that fits in the given `width`.\\n\\n///\\n\\n/// Takes non-breakable elements from `iter`, while keeping the string width\\n\\n/// under `width` (and adding `delimiter` between each element).\\n\\n///\\n\\n/// Given `total_text = iter.collect().join(delimiter)`, the result is the\\n\\n/// length of the longest prefix of `width` or less cells, without breaking\\n\\n/// inside an element.\\n\\n///\\n\\n/// Example:\\n\\n///\\n\\n/// ```\\n\\n/// # extern crate cursive;\\n\\n/// extern crate unicode_segmentation;\\n\\n/// use unicode_segmentation::UnicodeSegmentation;\\n\\n///\\n\\n/// # use cursive::utils::lines::simple::prefix;\\n\\n/// # fn main() {\\n\\n/// let my_text = \\\"blah...\\\";\\n\\n/// // This returns the number of bytes for a prefix of `my_text` that\\n\\n/// // fits within 5 cells.\\n\\n/// prefix(my_text.graphemes(true), 5, \\\"\\\");\\n\\n/// # }\\n\\n/// ```\\n\\npub fn prefix<'a, I>(iter: I, available_width: usize, delimiter: &str) -> Span\\n\\nwhere\\n\\n I: Iterator<Item = &'a str>,\\n\\n{\\n\\n let delimiter_width = delimiter.width();\\n\\n let delimiter_len = delimiter.len();\\n\\n\\n\\n // `current_width` is the width of everything\\n\\n // before the next token, including any space.\\n\\n let mut current_width = 0;\\n\\n let sum: usize = iter\\n\\n .take_while(|token| {\\n\\n let width = token.width();\\n\\n if current_width + width > available_width {\\n\\n false\\n\\n } else {\\n\\n // Include the delimiter after this token.\\n\\n current_width += width;\\n\\n current_width += delimiter_width;\\n\\n true\\n\",\n \"file_path\": \"src/utils/lines/simple/mod.rs\",\n \"rank\": 3,\n \"score\": 187496.03273249464\n },\n {\n \"content\": \"/// Loads a theme string and sets it as active.\\n\\npub fn load_toml(content: &str) -> Result<Theme, Error> {\\n\\n let table = toml::de::from_str(content)?;\\n\\n\\n\\n let mut theme = Theme::default();\\n\\n theme.load_toml(&table);\\n\\n\\n\\n Ok(theme)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/theme/mod.rs\",\n \"rank\": 4,\n \"score\": 172192.83662851673\n },\n {\n \"content\": \"/// Draws a frame around the scrollable content.\\n\\n///\\n\\n/// `left_border` will be called for each row to draw the left border for the given line number.\\n\\npub fn draw_frame<T, LeftBorder, TopBorder, RightBorder, BottomBorder>(\\n\\n scroller: &T, printer: &Printer, mut left_border: LeftBorder,\\n\\n mut top_border: TopBorder, mut right_border: RightBorder,\\n\\n mut bottom_border: BottomBorder,\\n\\n) where\\n\\n T: Scroller,\\n\\n LeftBorder: FnMut(&T, &Printer, usize),\\n\\n TopBorder: FnMut(&T, &Printer, usize),\\n\\n RightBorder: FnMut(&T, &Printer, usize),\\n\\n BottomBorder: FnMut(&T, &Printer, usize),\\n\\n{\\n\\n let viewport = scroller.get_scroller().content_viewport();\\n\\n let size = printer.size.saturating_sub((1, 1));\\n\\n\\n\\n for (i, x) in (viewport.left()..=viewport.right()).enumerate() {\\n\\n top_border(scroller, &printer.offset((i + 1, 0)), x);\\n\\n bottom_border(scroller, &printer.offset((i + 1, size.y)), x);\\n\\n }\\n\\n\\n\\n // Also draw padding\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 5,\n \"score\": 168634.34906189208\n },\n {\n \"content\": \"fn show_child(s: &mut Cursive, offset: Vec2, menu: Rc<MenuTree>) {\\n\\n // Adds a new layer located near the item title with the menu popup.\\n\\n // Also adds two key callbacks on this new view, to handle `left` and\\n\\n // `right` key presses.\\n\\n // (If the view itself listens for a `left` or `right` press, it will\\n\\n // consume it before our OnEventView. This means sub-menus can properly\\n\\n // be entered.)\\n\\n s.screen_mut().add_layer_at(\\n\\n Position::absolute(offset),\\n\\n OnEventView::new(\\n\\n MenuPopup::new(menu)\\n\\n .on_dismiss(Cursive::select_menubar)\\n\\n .on_action(|s| s.menubar().state = State::Inactive),\\n\\n )\\n\\n .on_event(Key::Right, |s| {\\n\\n s.pop_layer();\\n\\n s.select_menubar();\\n\\n // Act as if we sent \\\"Right\\\" then \\\"Down\\\"\\n\\n s.menubar().on_event(Event::Key(Key::Right)).process(s);\\n\\n if let EventResult::Consumed(Some(cb)) =\\n\",\n \"file_path\": \"src/views/menubar.rs\",\n \"rank\": 6,\n \"score\": 161837.47105209643\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn read_char<F>(first: u8, next: F) -> Result<char, String>\\n\\nwhere\\n\\n F: Fn() -> Option<u8>,\\n\\n{\\n\\n if first < 0x80 {\\n\\n return Ok(first as char);\\n\\n }\\n\\n\\n\\n // Number of leading 1s determines the number of bytes we'll have to read\\n\\n let n_bytes = match (!first).leading_zeros() {\\n\\n n @ 2..=6 => n as usize,\\n\\n 1 => return Err(\\\"First byte is continuation byte.\\\".to_string()),\\n\\n 7..=8 => return Err(\\\"WTF is this byte??\\\".to_string()),\\n\\n _ => unreachable!(),\\n\\n };\\n\\n\\n\\n let mut res = 0_u32;\\n\\n\\n\\n // First, get the data - only the few last bits\\n\\n res |= u32::from(first & make_mask(7 - n_bytes));\\n\",\n \"file_path\": \"src/utf8.rs\",\n \"rank\": 7,\n \"score\": 158496.18664836016\n },\n {\n \"content\": \"/// Loads a theme from file and sets it as active.\\n\\npub fn load_theme_file<P: AsRef<Path>>(filename: P) -> Result<Theme, Error> {\\n\\n let content = {\\n\\n let mut content = String::new();\\n\\n let mut file = File::open(filename)?;\\n\\n file.read_to_string(&mut content)?;\\n\\n content\\n\\n };\\n\\n\\n\\n load_toml(&content)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/theme/mod.rs\",\n \"rank\": 8,\n \"score\": 153640.32891344678\n },\n {\n \"content\": \"/// Draws a box-style frame around a scrollable content.\\n\\n///\\n\\n/// Assumes horizontal lines are present in the content whenever `is_h_delim`\\n\\n/// returns `true` (and vertical lines when `is_v_delim` returns `true`).\\n\\n///\\n\\n/// It will print a box with the appropriate `├`, `┤` and so on.\\n\\npub fn draw_box_frame<T, IsHDelim, IsVDelim>(\\n\\n scroller: &T, printer: &Printer, is_h_delim: IsHDelim,\\n\\n is_v_delim: IsVDelim,\\n\\n) where\\n\\n T: Scroller,\\n\\n IsHDelim: Fn(&T, usize) -> bool,\\n\\n IsVDelim: Fn(&T, usize) -> bool,\\n\\n{\\n\\n draw_frame(\\n\\n scroller,\\n\\n printer,\\n\\n |s, printer, y| {\\n\\n if is_h_delim(s, y) {\\n\\n printer.print((0, 0), \\\"├\\\");\\n\\n } else {\\n\\n printer.print((0, 0), \\\"│\\\");\\n\\n }\\n\\n },\\n\\n |s, printer, x| {\\n\\n if is_v_delim(s, x) {\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 9,\n \"score\": 147897.03286828537\n },\n {\n \"content\": \"// Compare the content of the two edit views,\\n\\n// and update the TextView accordingly.\\n\\n//\\n\\n// We'll ignore the `content` and `cursor` arguments,\\n\\n// and directly retrieve the content from the `Cursive` root.\\n\\nfn on_edit(siv: &mut Cursive, _content: &str, _cursor: usize) {\\n\\n // Get handles for each view.\\n\\n let edit_1 = siv.find_id::<EditView>(\\\"1\\\").unwrap();\\n\\n let edit_2 = siv.find_id::<EditView>(\\\"2\\\").unwrap();\\n\\n\\n\\n // Directly compare references to edit_1 and edit_2.\\n\\n let matches = edit_1.get_content() == edit_2.get_content();\\n\\n\\n\\n siv.call_on_id(\\\"match\\\", |v: &mut TextView| {\\n\\n v.set_content(if matches { \\\"match\\\" } else { \\\"no match\\\" })\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"examples/refcell_view.rs\",\n \"rank\": 10,\n \"score\": 147537.77507268253\n },\n {\n \"content\": \"/// Computes the longest prefix that fits in the given width.\\n\\n///\\n\\n/// Breaks between any two graphemes.\\n\\npub fn simple_prefix(text: &str, width: usize) -> Span {\\n\\n prefix(text.graphemes(true), width, \\\"\\\")\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"src/utils/lines/simple/mod.rs\",\n \"rank\": 11,\n \"score\": 143346.33397949312\n },\n {\n \"content\": \"/// Computes the longest suffix that fits in the given `width`.\\n\\n///\\n\\n/// Breaks between any two graphemes.\\n\\npub fn simple_suffix(text: &str, width: usize) -> Span {\\n\\n suffix(text.graphemes(true), width, \\\"\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/lines/simple/mod.rs\",\n \"rank\": 12,\n \"score\": 143346.33397949312\n },\n {\n \"content\": \"/// Initialize the Cursive logger.\\n\\n///\\n\\n/// Make sure this is the only logger your are using.\\n\\n///\\n\\n/// Use a [`DebugView`](crate::views::DebugView) to see the logs, or use\\n\\n/// [`Cursive::toggle_debug_console()`](crate::Cursive::toggle_debug_console()).\\n\\npub fn init() {\\n\\n // TODO: Configure the deque size?\\n\\n LOGS.lock().unwrap().reserve(1_000);\\n\\n\\n\\n // This will panic if `set_logger` was already called.\\n\\n log::set_logger(&LOGGER).unwrap();\\n\\n\\n\\n // TODO: read the level from env variable? From argument?\\n\\n log::set_max_level(log::LevelFilter::Trace);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/logger.rs\",\n \"rank\": 13,\n \"score\": 141745.06700207922\n },\n {\n \"content\": \"/// Compute lines for the given content and width.\\n\\n///\\n\\n/// Equivalent to constructing a new `LinesIterator` and collecting it.\\n\\npub fn make_lines(content: &str, width: usize) -> Vec<Row> {\\n\\n LinesIterator::new(content, width).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/lines/simple/mod.rs\",\n \"rank\": 14,\n \"score\": 138947.321230314\n },\n {\n \"content\": \"fn find_closest_pair(pair: ColorPair) -> (i16, i16) {\\n\\n super::find_closest_pair(pair, ncurses::COLORS() as i16)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/backend/curses/n.rs\",\n \"rank\": 15,\n \"score\": 135957.28628976922\n },\n {\n \"content\": \"fn find_closest_pair(pair: ColorPair) -> (i16, i16) {\\n\\n super::find_closest_pair(pair, pancurses::COLORS() as i16)\\n\\n}\\n\\n\\n\\nimpl Backend {\\n\\n /// Creates a new pancurses-based backend.\\n\\n pub fn init() -> std::io::Result<Box<dyn backend::Backend>> {\\n\\n // Check the $TERM variable (at least on unix).\\n\\n // Otherwise we'll just abort.\\n\\n // TODO: On windows, is there anything to check?\\n\\n if cfg!(unix)\\n\\n && std::env::var(\\\"TERM\\\")\\n\\n .map(|var| var.is_empty())\\n\\n .unwrap_or(true)\\n\\n {\\n\\n return Err(std::io::Error::new(\\n\\n std::io::ErrorKind::Other,\\n\\n \\\"$TERM is unset. Cannot initialize pancurses interface.\\\",\\n\\n ));\\n\\n }\\n\",\n \"file_path\": \"src/backend/curses/pan.rs\",\n \"rank\": 16,\n \"score\": 134363.24198006914\n },\n {\n \"content\": \"#[allow(unused)]\\n\\npub fn start_resize_thread(\\n\\n resize_sender: Sender<()>, resize_running: Arc<AtomicBool>,\\n\\n) {\\n\\n let signals = Signals::new(&[libc::SIGWINCH]).unwrap();\\n\\n thread::spawn(move || {\\n\\n // This thread will listen to SIGWINCH events and report them.\\n\\n while resize_running.load(Ordering::Relaxed) {\\n\\n // We know it will only contain SIGWINCH signals, so no need to check.\\n\\n if signals.wait().count() > 0 {\\n\\n resize_sender.send(()).unwrap();\\n\\n }\\n\\n }\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"src/backend/resize.rs\",\n \"rank\": 17,\n \"score\": 134078.01488877996\n },\n {\n \"content\": \"fn phase_2(s: &mut Cursive) {\\n\\n // Now, we'll run N tasks\\n\\n // (It could be downloading a file, extracting an archive,\\n\\n // reticulating sprites, ...)\\n\\n let n_bars = 10;\\n\\n // Each task will have its own shiny counter\\n\\n let counters: Vec<_> = (0..n_bars).map(|_| Counter::new(0)).collect();\\n\\n // To make things more interesting, we'll give a random speed to each bar\\n\\n let speeds: Vec<_> = (0..n_bars)\\n\\n .map(|_| rand::thread_rng().gen_range(50, 150))\\n\\n .collect();\\n\\n\\n\\n let n_max = 100_000;\\n\\n let cb = s.cb_sink().clone();\\n\\n\\n\\n // Let's prepare the progress bars...\\n\\n let mut linear = LinearLayout::vertical();\\n\\n for c in &counters {\\n\\n linear.add_child(ProgressBar::new().max(n_max).with_value(c.clone()));\\n\\n }\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 18,\n \"score\": 133589.69782233922\n },\n {\n \"content\": \"fn phase_1(s: &mut Cursive) {\\n\\n // Phase 1 is easy: a simple pre-loading.\\n\\n\\n\\n // Number of ticks\\n\\n let n_max = 1000;\\n\\n\\n\\n // This is the callback channel\\n\\n let cb = s.cb_sink().clone();\\n\\n\\n\\n s.pop_layer();\\n\\n s.add_layer(Dialog::around(\\n\\n ProgressBar::new()\\n\\n // We need to know how many ticks represent a full bar.\\n\\n .range(0, n_max)\\n\\n .with_task(move |counter| {\\n\\n // This closure will be called in a separate thread.\\n\\n fake_load(n_max, &counter);\\n\\n\\n\\n // When we're done, send a callback through the channel\\n\\n cb.send(Box::new(coffee_break)).unwrap();\\n\\n })\\n\\n .full_width(),\\n\\n ));\\n\\n s.set_autorefresh(true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 19,\n \"score\": 133589.69782233922\n },\n {\n \"content\": \"// Shortcut for a boxed callback (for the wrap_call_on_any method).\\n\\ntype BoxedCallback<'a> = Box<for<'b> FnMut(&'b mut dyn Any) + 'a>;\\n\\n\\n\\nimpl<T: View + 'static> ViewWrapper for IdView<T> {\\n\\n type V = T;\\n\\n\\n\\n fn with_view<F, R>(&self, f: F) -> Option<R>\\n\\n where\\n\\n F: FnOnce(&Self::V) -> R,\\n\\n {\\n\\n self.view.try_borrow().ok().map(|v| f(&*v))\\n\\n }\\n\\n\\n\\n fn with_view_mut<F, R>(&mut self, f: F) -> Option<R>\\n\\n where\\n\\n F: FnOnce(&mut Self::V) -> R,\\n\\n {\\n\\n self.view.try_borrow_mut().ok().map(|mut v| f(&mut *v))\\n\\n }\\n\\n\\n\\n fn into_inner(mut self) -> Result<Self::V, Self>\\n\",\n \"file_path\": \"src/views/id_view.rs\",\n \"rank\": 20,\n \"score\": 131690.33440614323\n },\n {\n \"content\": \"fn final_step(s: &mut Cursive) {\\n\\n // A little break before things get serious.\\n\\n s.set_autorefresh(false);\\n\\n s.pop_layer();\\n\\n s.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Report\\\")\\n\\n .content(\\n\\n TextView::new(\\n\\n \\\"Time travel was a success!\\\\n\\\\\\n\\n We went forward a few seconds!!\\\",\\n\\n )\\n\\n .center(),\\n\\n )\\n\\n .button(\\\"That's it?\\\", |s| s.quit()),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 21,\n \"score\": 131039.4805206093\n },\n {\n \"content\": \"fn coffee_break(s: &mut Cursive) {\\n\\n // A little break before things get serious.\\n\\n s.set_autorefresh(false);\\n\\n s.pop_layer();\\n\\n s.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Preparation complete\\\")\\n\\n .content(TextView::new(\\\"Now, the real deal!\\\").center())\\n\\n .button(\\\"Again??\\\", phase_2),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 22,\n \"score\": 131039.4805206093\n },\n {\n \"content\": \"/// Concatenates chunks as long as they fit in the given width.\\n\\npub fn prefix<I>(\\n\\n tokens: &mut Peekable<I>, width: usize, offset: &mut ChunkPart,\\n\\n) -> Vec<Chunk>\\n\\nwhere\\n\\n I: Iterator<Item = Chunk>,\\n\\n{\\n\\n let mut available = width;\\n\\n let mut chunks = Vec::new();\\n\\n\\n\\n // Accumulate chunks until it doesn't fit.\\n\\n loop {\\n\\n // Look at the next chunk and see if it would fit.\\n\\n let result = {\\n\\n let next_chunk = match tokens.peek() {\\n\\n None => break,\\n\\n Some(chunk) => chunk,\\n\\n };\\n\\n\\n\\n // When considering if the chunk fits, remember that we may\\n\\n // already have processed part of it.\\n\",\n \"file_path\": \"src/utils/lines/spans/prefix.rs\",\n \"rank\": 23,\n \"score\": 130697.6959752263\n },\n {\n \"content\": \"/// Loads the default theme, and returns its representation.\\n\\npub fn load_default() -> Theme {\\n\\n Theme::default()\\n\\n}\\n\",\n \"file_path\": \"src/theme/mod.rs\",\n \"rank\": 24,\n \"score\": 130697.6959752263\n },\n {\n \"content\": \"fn show_popup(siv: &mut Cursive) {\\n\\n // Let's center the popup horizontally, but offset it down a few rows,\\n\\n // so the user can see both the popup and the view underneath.\\n\\n siv.screen_mut().add_layer_at(\\n\\n Position::new(Offset::Center, Offset::Parent(5)),\\n\\n Dialog::around(TextView::new(\\\"Tak!\\\"))\\n\\n .button(\\\"Change\\\", |s| {\\n\\n // Look for a view tagged \\\"text\\\".\\n\\n // We _know_ it's there, so unwrap it.\\n\\n s.call_on_id(\\\"text\\\", |view: &mut TextView| {\\n\\n let content = reverse(view.get_content().source());\\n\\n view.set_content(content);\\n\\n });\\n\\n })\\n\\n .dismiss_button(\\\"Ok\\\"),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mutation.rs\",\n \"rank\": 25,\n \"score\": 128636.53904288812\n },\n {\n \"content\": \"type InnerCallback<T> = Rc<Box<dyn Fn(&mut T, &Event) -> Option<EventResult>>>;\\n\\n\\n\",\n \"file_path\": \"src/views/on_event_view.rs\",\n \"rank\": 26,\n \"score\": 128051.97572674266\n },\n {\n \"content\": \"/// Initialise the Cursive logger, adding the ability to filter debug logs by module\\n\\npub fn init_for_module(module: &str) {\\n\\n let mut custom_module = MODULE.lock().unwrap();\\n\\n *custom_module = Some(module.to_string());\\n\\n\\n\\n // TODO: Configure the deque size?\\n\\n MODULE_LOGS.lock().unwrap().reserve(1_000);\\n\\n\\n\\n init();\\n\\n}\\n\",\n \"file_path\": \"src/logger.rs\",\n \"rank\": 27,\n \"score\": 127725.05544228505\n },\n {\n \"content\": \"fn show_options(siv: &mut Cursive) {\\n\\n siv.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Select difficulty\\\")\\n\\n .content(\\n\\n SelectView::new()\\n\\n .item(\\n\\n \\\"Easy: 8x8, 10 mines\\\",\\n\\n game::Options {\\n\\n size: Vec2::new(8, 8),\\n\\n mines: 10,\\n\\n },\\n\\n )\\n\\n .item(\\n\\n \\\"Medium: 16x16, 40 mines\\\",\\n\\n game::Options {\\n\\n size: Vec2::new(16, 16),\\n\\n mines: 40,\\n\\n },\\n\\n )\\n\",\n \"file_path\": \"examples/mines/main.rs\",\n \"rank\": 28,\n \"score\": 126368.47359960807\n },\n {\n \"content\": \"fn find_closest_pair(pair: ColorPair, max_colors: i16) -> (i16, i16) {\\n\\n (\\n\\n find_closest(pair.front, max_colors),\\n\\n find_closest(pair.back, max_colors),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/backend/curses/mod.rs\",\n \"rank\": 29,\n \"score\": 125312.58793442008\n },\n {\n \"content\": \"/// Writes some bytes directly to `/dev/tty`\\n\\n///\\n\\n/// Since this is not going to be used often, we can afford to re-open the\\n\\n/// file every time.\\n\\nfn write_to_tty(bytes: &[u8]) -> io::Result<()> {\\n\\n let mut tty_output =\\n\\n File::create(\\\"/dev/tty\\\").expect(\\\"cursive can only run with a tty\\\");\\n\\n tty_output.write_all(bytes)?;\\n\\n // tty_output will be flushed automatically at the end of the function.\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nimpl Backend {\\n\\n /// Creates a new ncurses-based backend.\\n\\n pub fn init() -> io::Result<Box<dyn backend::Backend>> {\\n\\n // Check the $TERM variable.\\n\\n if std::env::var(\\\"TERM\\\")\\n\\n .map(|var| var.is_empty())\\n\\n .unwrap_or(true)\\n\\n {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n \\\"$TERM is unset. Cannot initialize ncurses interface.\\\",\\n\\n ));\\n\",\n \"file_path\": \"src/backend/curses/n.rs\",\n \"rank\": 30,\n \"score\": 122192.1044110718\n },\n {\n \"content\": \"/// Performs `View::important_area` on a `scroll::Scroller`.\\n\\npub fn important_area<T, ImportantArea>(\\n\\n scroller: &T, size: Vec2, mut important_area: ImportantArea,\\n\\n) -> Rect\\n\\nwhere\\n\\n T: Scroller,\\n\\n ImportantArea: FnMut(&T, Vec2) -> Rect,\\n\\n{\\n\\n let viewport = scroller.get_scroller().content_viewport();\\n\\n let area = important_area(scroller, size);\\n\\n let top_left = area.top_left().saturating_sub(viewport.top_left());\\n\\n let bot_right = area\\n\\n .bottom_right()\\n\\n .saturating_sub(viewport.top_left())\\n\\n .or_min(viewport.bottom_right());\\n\\n\\n\\n Rect::from_corners(top_left, bot_right)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 31,\n \"score\": 121285.19881103317\n },\n {\n \"content\": \"/// Performs a line-based `View::draw` on a `scroll::Scroller`.\\n\\n///\\n\\n/// This is an alternative to `scroll::draw()` when you just need to print individual lines.\\n\\npub fn draw_lines<T, LineDrawer>(\\n\\n scroller: &T, printer: &Printer, mut line_drawer: LineDrawer,\\n\\n) where\\n\\n T: Scroller,\\n\\n LineDrawer: FnMut(&T, &Printer, usize),\\n\\n{\\n\\n draw(scroller, printer, |s, printer| {\\n\\n let start = printer.content_offset.y;\\n\\n let end = start + printer.output_size.y;\\n\\n for y in start..end {\\n\\n let printer = printer.offset((0, y)).cropped((printer.size.x, 1));\\n\\n line_drawer(s, &printer, y);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 32,\n \"score\": 121285.19881103317\n },\n {\n \"content\": \"/// Performs `View::required_size` on a `scroll::Scroller`.\\n\\npub fn required_size<T, RequiredSize>(\\n\\n scroller: &mut T, size: Vec2, needs_relayout: bool,\\n\\n required_size: RequiredSize,\\n\\n) -> Vec2\\n\\nwhere\\n\\n T: Scroller,\\n\\n RequiredSize: FnMut(&mut T, Vec2) -> Vec2,\\n\\n{\\n\\n raw::required_size(\\n\\n size,\\n\\n needs_relayout,\\n\\n scroller,\\n\\n Scroller::get_scroller_mut,\\n\\n required_size,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 33,\n \"score\": 121285.19881103317\n },\n {\n \"content\": \"// This will replace the current layer with a new popup.\\n\\n// If the name is empty, we'll show an error message instead.\\n\\nfn show_popup(s: &mut Cursive, name: &str) {\\n\\n if name.is_empty() {\\n\\n // Try again as many times as we need!\\n\\n s.add_layer(Dialog::info(\\\"Please enter a name!\\\"));\\n\\n } else {\\n\\n let content = format!(\\\"Hello {}!\\\", name);\\n\\n // Remove the initial popup\\n\\n s.pop_layer();\\n\\n // And put a new one instead\\n\\n s.add_layer(\\n\\n Dialog::around(TextView::new(content))\\n\\n .button(\\\"Quit\\\", |s| s.quit()),\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/edit.rs\",\n \"rank\": 34,\n \"score\": 121277.04436762\n },\n {\n \"content\": \"/// Look at a chunk, and decide how it could fit.\\n\\nfn consider_chunk(available: usize, chunk: &Chunk) -> ChunkFitResult {\\n\\n if chunk.width <= available {\\n\\n // We fits. No question about it.\\n\\n if chunk.hard_stop {\\n\\n // Still, we have to stop here.\\n\\n // And possibly trim a newline.\\n\\n ChunkFitResult::FitsBarely\\n\\n } else {\\n\\n // Nothing special here.\\n\\n ChunkFitResult::Fits\\n\\n }\\n\\n } else if chunk.width == available + 1 {\\n\\n // We're just SLIGHTLY too big!\\n\\n // Can we just pop something?\\n\\n if chunk.ends_with_space {\\n\\n // Yay!\\n\\n ChunkFitResult::FitsBarely\\n\\n } else {\\n\\n // Noo(\\n\\n ChunkFitResult::DoesNotFit\\n\\n }\\n\\n } else {\\n\\n // Can't bargain with me.\\n\\n ChunkFitResult::DoesNotFit\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils/lines/spans/prefix.rs\",\n \"rank\": 35,\n \"score\": 119703.54100055111\n },\n {\n \"content\": \"fn find(siv: &mut Cursive, text: &str) {\\n\\n // First, remove the find popup\\n\\n siv.pop_layer();\\n\\n\\n\\n let res = siv.call_on_id(\\\"text\\\", |v: &mut TextArea| {\\n\\n // Find the given text from the text area content\\n\\n // Possible improvement: search after the current cursor.\\n\\n if let Some(i) = v.get_content().find(text) {\\n\\n // If we found it, move the cursor\\n\\n v.set_cursor(i);\\n\\n Ok(())\\n\\n } else {\\n\\n // Otherwise, return an error so we can show a warning.\\n\\n Err(())\\n\\n }\\n\\n });\\n\\n\\n\\n if let Some(Err(())) = res {\\n\\n // If we didn't find anything, tell the user!\\n\\n siv.add_layer(Dialog::info(format!(\\\"`{}` not found\\\", text)));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/text_area.rs\",\n \"rank\": 36,\n \"score\": 119132.8091591152\n },\n {\n \"content\": \"/// Performs `View::on_event` on a `scroll::Scroller`.\\n\\n///\\n\\n/// Example:\\n\\n///\\n\\n/// ```rust,ignore\\n\\n/// fn on_event(&mut self, event: Event) -> EventResult {\\n\\n/// scroll::on_event(self, event, Self::inner_on_event, Self::inner_important_area)\\n\\n/// }\\n\\n/// ```\\n\\npub fn on_event<T, OnEvent, ImportantArea>(\\n\\n scroller: &mut T, event: Event, on_event: OnEvent,\\n\\n important_area: ImportantArea,\\n\\n) -> EventResult\\n\\nwhere\\n\\n T: Scroller,\\n\\n OnEvent: FnMut(&mut T, Event) -> EventResult,\\n\\n ImportantArea: FnMut(&T, Vec2) -> Rect,\\n\\n{\\n\\n raw::on_event(\\n\\n event,\\n\\n scroller,\\n\\n Scroller::get_scroller_mut,\\n\\n on_event,\\n\\n important_area,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 37,\n \"score\": 118660.43670289627\n },\n {\n \"content\": \"/// Performs `View::layout` on a `scroll::Scroller`.\\n\\npub fn layout<T, Layout, RequiredSize>(\\n\\n scroller: &mut T, size: Vec2, needs_relayout: bool, layout: Layout,\\n\\n required_size: RequiredSize,\\n\\n) where\\n\\n T: Scroller,\\n\\n Layout: FnMut(&mut T, Vec2),\\n\\n RequiredSize: FnMut(&mut T, Vec2) -> Vec2,\\n\\n{\\n\\n raw::layout(\\n\\n size,\\n\\n needs_relayout,\\n\\n scroller,\\n\\n Scroller::get_scroller_mut,\\n\\n required_size,\\n\\n layout,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 38,\n \"score\": 118642.49701489169\n },\n {\n \"content\": \"pub fn draw<Model, GetScroller, Draw>(\\n\\n printer: &Printer, model: &Model, mut get_scroller: GetScroller,\\n\\n inner_draw: Draw,\\n\\n) where\\n\\n Model: ?Sized,\\n\\n GetScroller: FnMut(&Model) -> &scroll::Core,\\n\\n Draw: FnOnce(&Model, &Printer),\\n\\n{\\n\\n let printer = get_scroller(model).sub_printer(printer);\\n\\n inner_draw(model, &printer);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/raw.rs\",\n \"rank\": 39,\n \"score\": 118642.49701489169\n },\n {\n \"content\": \"#[derive(Clone, Debug, PartialEq)]\\n\\nenum ModuleFilter {\\n\\n All,\\n\\n Module,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/views/debug_view.rs\",\n \"rank\": 40,\n \"score\": 117334.96983700953\n },\n {\n \"content\": \"/// Moves top layer by the specified amount\\n\\nfn move_top(c: &mut Cursive, x_in: isize, y_in: isize) {\\n\\n // Step 1. Get the current position of the layer.\\n\\n let s = c.screen_mut();\\n\\n let l = LayerPosition::FromFront(0);\\n\\n\\n\\n // Step 2. add the specifed amount\\n\\n let pos = s.offset().saturating_add((x_in, y_in));\\n\\n\\n\\n // convert the new x and y into a position\\n\\n let p = Position::absolute(pos);\\n\\n\\n\\n // Step 3. Apply the new position\\n\\n s.reposition_layer(l, p);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/position.rs\",\n \"rank\": 41,\n \"score\": 117165.44428879586\n },\n {\n \"content\": \"// Let's put the callback in a separate function to keep it clean,\\n\\n// but it's not required.\\n\\nfn show_next_window(siv: &mut Cursive, city: &str) {\\n\\n siv.pop_layer();\\n\\n let text = format!(\\\"{} is a great city!\\\", city);\\n\\n siv.add_layer(\\n\\n Dialog::around(TextView::new(text)).button(\\\"Quit\\\", |s| s.quit()),\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"examples/select.rs\",\n \"rank\": 42,\n \"score\": 117107.52844253797\n },\n {\n \"content\": \"/// Integer division that rounds up.\\n\\npub fn div_up<T>(p: T, q: T) -> T\\n\\nwhere\\n\\n T: Num + Clone,\\n\\n{\\n\\n let d = p.clone() / q.clone();\\n\\n\\n\\n if p % q == T::zero() {\\n\\n d\\n\\n } else {\\n\\n T::one() + d\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/div.rs\",\n \"rank\": 43,\n \"score\": 116409.70458468744\n },\n {\n \"content\": \"pub fn required_size<Model, GetScroller, RequiredSize>(\\n\\n constraint: Vec2, needs_relayout: bool, model: &mut Model,\\n\\n mut get_scroller: GetScroller, mut required_size: RequiredSize,\\n\\n) -> Vec2\\n\\nwhere\\n\\n Model: ?Sized,\\n\\n GetScroller: FnMut(&mut Model) -> &mut scroll::Core,\\n\\n RequiredSize: FnMut(&mut Model, Vec2) -> Vec2,\\n\\n{\\n\\n let (_, size) = sizes(\\n\\n constraint,\\n\\n false,\\n\\n needs_relayout,\\n\\n model,\\n\\n &mut get_scroller,\\n\\n &mut required_size,\\n\\n );\\n\\n\\n\\n size\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/raw.rs\",\n \"rank\": 44,\n \"score\": 114893.75305384866\n },\n {\n \"content\": \"/// Parses the given string as markdown text.\\n\\npub fn parse<S>(input: S) -> StyledString\\n\\nwhere\\n\\n S: Into<String>,\\n\\n{\\n\\n let input = input.into();\\n\\n\\n\\n let spans = parse_spans(&input);\\n\\n\\n\\n StyledString::with_spans(input, spans)\\n\\n}\\n\\n\\n\\n/// Iterator that parse a markdown text and outputs styled spans.\\n\\npub struct Parser<'a> {\\n\\n first: bool,\\n\\n stack: Vec<Style>,\\n\\n input: &'a str,\\n\\n parser: pulldown_cmark::Parser<'a>,\\n\\n}\\n\\n\\n\\nimpl<'a> Parser<'a> {\\n\",\n \"file_path\": \"src/utils/markup/markdown.rs\",\n \"rank\": 45,\n \"score\": 114358.26788616757\n },\n {\n \"content\": \"fn main() {\\n\\n // Initialize the cursive logger.\\n\\n cursive::logger::init();\\n\\n\\n\\n // Use some logging macros from the `log` crate.\\n\\n error!(\\\"Something serious probably happened!\\\");\\n\\n warn!(\\\"Or did it?\\\");\\n\\n debug!(\\\"Logger initialized.\\\");\\n\\n info!(\\\"Starting!\\\");\\n\\n\\n\\n let mut siv = cursive::Cursive::default();\\n\\n siv.add_layer(cursive::views::Dialog::text(\\\"Press ~ to open the console.\\\\nPress l to generate logs.\\\\nPress q to quit.\\\"));\\n\\n siv.add_global_callback('q', cursive::Cursive::quit);\\n\\n siv.add_global_callback('~', cursive::Cursive::toggle_debug_console);\\n\\n\\n\\n siv.add_global_callback('l', |_| trace!(\\\"Wooo\\\"));\\n\\n\\n\\n siv.run();\\n\\n}\\n\",\n \"file_path\": \"examples/debug_console.rs\",\n \"rank\": 46,\n \"score\": 113839.59278232366\n },\n {\n \"content\": \"fn new_game(siv: &mut Cursive, options: game::Options) {\\n\\n let _board = game::Board::new(options);\\n\\n\\n\\n siv.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Minesweeper\\\")\\n\\n .content(\\n\\n LinearLayout::horizontal()\\n\\n .child(Panel::new(BoardView::new(options))),\\n\\n )\\n\\n .button(\\\"Quit game\\\", |s| {\\n\\n s.pop_layer();\\n\\n }),\\n\\n );\\n\\n\\n\\n siv.add_layer(Dialog::info(\\n\\n \\\"Controls:\\n\\nReveal cell: left click\\n\\nMark as mine: right-click\\n\\nReveal nearby unmarked cells: middle-click\\\",\\n\\n ));\\n\\n}\\n\",\n \"file_path\": \"examples/mines/main.rs\",\n \"rank\": 47,\n \"score\": 113017.65752788744\n },\n {\n \"content\": \"/// Parse the given code into one or more event.\\n\\n///\\n\\n/// If the given event code should expend into multiple events\\n\\n/// (for instance click expends into PRESS + RELEASE),\\n\\n/// the returned Vec will include those queued events.\\n\\n///\\n\\n/// The main event is returned separately to avoid allocation in most cases.\\n\\nfn on_mouse_event<F>(bare_event: i32, mut f: F)\\n\\nwhere\\n\\n F: FnMut(MouseEvent),\\n\\n{\\n\\n let button = get_mouse_button(bare_event);\\n\\n match bare_event {\\n\\n ncurses::BUTTON1_RELEASED\\n\\n | ncurses::BUTTON2_RELEASED\\n\\n | ncurses::BUTTON3_RELEASED => f(MouseEvent::Release(button)),\\n\\n ncurses::BUTTON1_PRESSED\\n\\n | ncurses::BUTTON2_PRESSED\\n\\n | ncurses::BUTTON3_PRESSED => f(MouseEvent::Press(button)),\\n\\n ncurses::BUTTON4_PRESSED => f(MouseEvent::WheelUp),\\n\\n ncurses::BUTTON5_PRESSED => f(MouseEvent::WheelDown),\\n\\n // BUTTON4_RELEASED? BUTTON5_RELEASED?\\n\\n // Do they ever happen?\\n\\n _ => debug!(\\\"Unknown event: {:032b}\\\", bare_event),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/backend/curses/n.rs\",\n \"rank\": 48,\n \"score\": 113017.65752788744\n },\n {\n \"content\": \"/// Result of a fitness test\\n\\n///\\n\\n/// Describes how well a chunk fits in the available space.\\n\\nenum ChunkFitResult {\\n\\n /// This chunk can fit as-is\\n\\n Fits,\\n\\n\\n\\n /// This chunk fits, but it'll be the last one.\\n\\n /// Additionally, its last char may need to be removed.\\n\\n FitsBarely,\\n\\n\\n\\n /// This chunk doesn't fit. Don't even.\\n\\n DoesNotFit,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/lines/spans/prefix.rs\",\n \"rank\": 49,\n \"score\": 112655.12097770226\n },\n {\n \"content\": \"pub fn layout<Model, GetScroller, RequiredSize, Layout>(\\n\\n size: Vec2, needs_relayout: bool, model: &mut Model,\\n\\n mut get_scroller: GetScroller, mut required_size: RequiredSize,\\n\\n mut layout: Layout,\\n\\n) where\\n\\n Model: ?Sized,\\n\\n GetScroller: FnMut(&mut Model) -> &mut scroll::Core,\\n\\n RequiredSize: FnMut(&mut Model, Vec2) -> Vec2,\\n\\n Layout: FnMut(&mut Model, Vec2),\\n\\n{\\n\\n get_scroller(model).set_last_size(size);\\n\\n\\n\\n // This is what we'd like\\n\\n let (inner_size, self_size) = sizes(\\n\\n size,\\n\\n true,\\n\\n needs_relayout,\\n\\n model,\\n\\n &mut get_scroller,\\n\\n &mut required_size,\\n\\n );\\n\\n\\n\\n get_scroller(model).set_inner_size(inner_size);\\n\\n get_scroller(model).build_cache(self_size, size);\\n\\n\\n\\n layout(model, inner_size);\\n\\n\\n\\n get_scroller(model).update_offset();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/raw.rs\",\n \"rank\": 50,\n \"score\": 112532.41472787847\n },\n {\n \"content\": \"pub fn on_event<Model, GetScroller, OnEvent, ImportantArea>(\\n\\n event: Event, model: &mut Model, mut get_scroller: GetScroller,\\n\\n mut on_event: OnEvent, mut important_area: ImportantArea,\\n\\n) -> EventResult\\n\\nwhere\\n\\n Model: ?Sized,\\n\\n GetScroller: FnMut(&mut Model) -> &mut scroll::Core,\\n\\n OnEvent: FnMut(&mut Model, Event) -> EventResult,\\n\\n ImportantArea: FnMut(&Model, Vec2) -> Rect,\\n\\n{\\n\\n let mut relative_event = event.clone();\\n\\n let inside = get_scroller(model).is_event_inside(&mut relative_event);\\n\\n let result = if inside {\\n\\n on_event(model, relative_event)\\n\\n } else {\\n\\n EventResult::Ignored\\n\\n };\\n\\n let inner_size = get_scroller(model).inner_size();\\n\\n let important = important_area(model, inner_size);\\n\\n get_scroller(model).on_inner_event(event, result, important)\\n\\n}\\n\",\n \"file_path\": \"src/view/scroll/raw.rs\",\n \"rank\": 51,\n \"score\": 112532.41472787847\n },\n {\n \"content\": \"/// Parse the given code into one or more event.\\n\\n///\\n\\n/// If the given event code should expend into multiple events\\n\\n/// (for instance click expends into PRESS + RELEASE),\\n\\n/// the returned Vec will include those queued events.\\n\\n///\\n\\n/// The main event is returned separately to avoid allocation in most cases.\\n\\nfn on_mouse_event<F>(bare_event: mmask_t, mut f: F)\\n\\nwhere\\n\\n F: FnMut(MouseEvent),\\n\\n{\\n\\n let button = get_mouse_button(bare_event);\\n\\n match bare_event {\\n\\n pancurses::BUTTON4_PRESSED => f(MouseEvent::WheelUp),\\n\\n pancurses::BUTTON5_PRESSED => f(MouseEvent::WheelDown),\\n\\n pancurses::BUTTON1_RELEASED\\n\\n | pancurses::BUTTON2_RELEASED\\n\\n | pancurses::BUTTON3_RELEASED\\n\\n | pancurses::BUTTON4_RELEASED\\n\\n | pancurses::BUTTON5_RELEASED => f(MouseEvent::Release(button)),\\n\\n pancurses::BUTTON1_PRESSED\\n\\n | pancurses::BUTTON2_PRESSED\\n\\n | pancurses::BUTTON3_PRESSED => f(MouseEvent::Press(button)),\\n\\n pancurses::BUTTON1_CLICKED\\n\\n | pancurses::BUTTON2_CLICKED\\n\\n | pancurses::BUTTON3_CLICKED\\n\\n | pancurses::BUTTON4_CLICKED\\n\",\n \"file_path\": \"src/backend/curses/pan.rs\",\n \"rank\": 52,\n \"score\": 111189.64234150623\n },\n {\n \"content\": \"/// Parse the given markdown text into a list of spans.\\n\\n///\\n\\n/// This is a shortcut for `Parser::new(input).collect()`.\\n\\npub fn parse_spans(input: &str) -> Vec<StyledIndexedSpan> {\\n\\n Parser::new(input).collect()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::utils::span::Span;\\n\\n\\n\\n #[test]\\n\\n fn test_parse() {\\n\\n let input = r\\\"\\n\",\n \"file_path\": \"src/utils/markup/markdown.rs\",\n \"rank\": 53,\n \"score\": 110796.43456573052\n },\n {\n \"content\": \"fn add_fn<F>(start: i32, with_key: F, map: &mut HashMap<i32, Event>)\\n\\nwhere\\n\\n F: Fn(Key) -> Event,\\n\\n{\\n\\n for i in 0..12 {\\n\\n map.insert(start + i, with_key(Key::from_f((i + 1) as u8)));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/backend/curses/n.rs\",\n \"rank\": 54,\n \"score\": 109927.26227501413\n },\n {\n \"content\": \"// Iterate over a toml\\n\\nfn iterate_toml<'a>(\\n\\n table: &'a toml::value::Table,\\n\\n) -> impl Iterator<Item = (&'a str, PaletteNode)> + 'a {\\n\\n table.iter().flat_map(|(key, value)| {\\n\\n let node = match value {\\n\\n toml::Value::Table(table) => {\\n\\n // This should define a new namespace\\n\\n // Treat basic colors as simple string.\\n\\n // We'll convert them back in the merge method.\\n\\n let map = iterate_toml(table)\\n\\n .map(|(key, value)| (key.to_string(), value))\\n\\n .collect();\\n\\n // Should we only return something if it's non-empty?\\n\\n Some(PaletteNode::Namespace(map))\\n\\n }\\n\\n toml::Value::Array(colors) => {\\n\\n // This should be a list of colors - just pick the first valid one.\\n\\n colors\\n\\n .iter()\\n\\n .flat_map(toml::Value::as_str)\\n\",\n \"file_path\": \"src/theme/palette.rs\",\n \"rank\": 55,\n \"score\": 109347.75230776737\n },\n {\n \"content\": \"/// Returns length * value/max\\n\\n///\\n\\n/// Constraint: `value` from 0 to `max` should, as much as possible, produce equal-sized segments\\n\\n/// from 0 to length.\\n\\n///\\n\\n/// Returns a tuple with:\\n\\n/// * The integer part of the division\\n\\n/// * A value between 0 and 8 (exclusive) corresponding to the remainder.\\n\\nfn ratio(value: usize, max: usize, length: usize) -> (usize, usize) {\\n\\n let integer = length * value / max;\\n\\n let fraction = length * value - max * integer;\\n\\n\\n\\n let fraction = fraction * 8 / max;\\n\\n\\n\\n (integer, fraction)\\n\\n}\\n\\n\\n\\nnew_default!(ProgressBar);\\n\\n\\n\\nimpl ProgressBar {\\n\\n /// Creates a new progress bar.\\n\\n ///\\n\\n /// Default values:\\n\\n ///\\n\\n /// * `min`: 0\\n\\n /// * `max`: 100\\n\\n /// * `value`: 0\\n\\n pub fn new() -> Self {\\n\",\n \"file_path\": \"src/views/progress_bar.rs\",\n \"rank\": 56,\n \"score\": 109200.47717355115\n },\n {\n \"content\": \"fn record_above_set_filter(\\n\\n record_level: log::Level,\\n\\n display_filter: log::LevelFilter,\\n\\n) -> bool {\\n\\n // If no display filter set (ie, the user has not applied a log filter yet), display all logs\\n\\n match display_filter.to_level() {\\n\\n Some(display_level) => (record_level <= display_level),\\n\\n None => true\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/views/debug_view.rs\",\n \"rank\": 57,\n \"score\": 106171.55587266857\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn make_mask(n: usize) -> u8 {\\n\\n let mut r = 0_u8;\\n\\n for i in 0..n {\\n\\n r |= 1 << i;\\n\\n }\\n\\n r\\n\\n}\\n\",\n \"file_path\": \"src/utf8.rs\",\n \"rank\": 58,\n \"score\": 104040.8048552974\n },\n {\n \"content\": \"fn make_percentage(value: usize, (min, max): (usize, usize)) -> String {\\n\\n if value < min {\\n\\n return String::from(\\\"0 %\\\");\\n\\n }\\n\\n\\n\\n let (percentage, extra) = ratio(value - min, max - min, 100);\\n\\n let percentage = if extra > 4 {\\n\\n percentage + 1\\n\\n } else {\\n\\n percentage\\n\\n };\\n\\n format!(\\\"{} %\\\", percentage)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/views/progress_bar.rs\",\n \"rank\": 59,\n \"score\": 103812.02304332786\n },\n {\n \"content\": \"fn fill_key_codes<F>(target: &mut HashMap<i32, Event>, f: F)\\n\\nwhere\\n\\n F: Fn(i32) -> Option<String>,\\n\\n{\\n\\n let key_names = hashmap! {\\n\\n \\\"DC\\\" => Key::Del,\\n\\n \\\"DN\\\" => Key::Down,\\n\\n \\\"END\\\" => Key::End,\\n\\n \\\"HOM\\\" => Key::Home,\\n\\n \\\"IC\\\" => Key::Ins,\\n\\n \\\"LFT\\\" => Key::Left,\\n\\n \\\"NXT\\\" => Key::PageDown,\\n\\n \\\"PRV\\\" => Key::PageUp,\\n\\n \\\"RIT\\\" => Key::Right,\\n\\n \\\"UP\\\" => Key::Up,\\n\\n };\\n\\n\\n\\n for code in 512..1024 {\\n\\n let name = match f(code) {\\n\\n Some(name) => name,\\n\",\n \"file_path\": \"src/backend/curses/mod.rs\",\n \"rank\": 60,\n \"score\": 102495.55648207958\n },\n {\n \"content\": \"/// Performs `View::draw` on a `scroll::Scroller`.\\n\\npub fn draw<T, Draw>(scroller: &T, printer: &Printer, draw: Draw)\\n\\nwhere\\n\\n T: Scroller,\\n\\n Draw: FnOnce(&T, &Printer),\\n\\n{\\n\\n raw::draw(printer, scroller, Scroller::get_scroller, draw);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/view/scroll/mod.rs\",\n \"rank\": 61,\n \"score\": 101771.21383749772\n },\n {\n \"content\": \"// Define this type separately to appease the Clippy god\\n\\ntype CallOnAny<T> = Box<dyn for<'a> FnMut(&mut T, &Selector, AnyCb<'a>)>;\\n\\n\\n\\n/// A blank view that forwards calls to closures.\\n\\n///\\n\\n/// You can use this view to easily draw your own interface.\\n\\npub struct Canvas<T> {\\n\\n state: T,\\n\\n\\n\\n draw: Box<dyn Fn(&T, &Printer)>,\\n\\n on_event: Box<dyn FnMut(&mut T, Event) -> EventResult>,\\n\\n required_size: Box<dyn FnMut(&mut T, Vec2) -> Vec2>,\\n\\n layout: Box<dyn FnMut(&mut T, Vec2)>,\\n\\n take_focus: Box<dyn FnMut(&mut T, Direction) -> bool>,\\n\\n needs_relayout: Box<dyn Fn(&T) -> bool>,\\n\\n focus_view: Box<dyn FnMut(&mut T, &Selector) -> Result<(), ()>>,\\n\\n call_on_any: CallOnAny<T>,\\n\\n important_area: Box<dyn Fn(&T, Vec2) -> Rect>,\\n\\n}\\n\\n\\n\\nimpl<T: 'static + View> Canvas<T> {\\n\",\n \"file_path\": \"src/views/canvas.rs\",\n \"rank\": 62,\n \"score\": 99193.05458731823\n },\n {\n \"content\": \"// Function to simulate a long process.\\n\\nfn fake_load(n_max: usize, counter: &Counter) {\\n\\n for _ in 0..n_max {\\n\\n thread::sleep(Duration::from_millis(5));\\n\\n // The `counter.tick()` method increases the progress value\\n\\n counter.tick(1);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 63,\n \"score\": 98199.00906276808\n },\n {\n \"content\": \"fn header(level: usize) -> &'static str {\\n\\n &\\\"##########\\\"[..level]\\n\\n}\\n\\n\\n\\nimpl<'a> Iterator for Parser<'a> {\\n\\n type Item = StyledIndexedSpan;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n loop {\\n\\n let next = match self.parser.next() {\\n\\n None => return None,\\n\\n Some(event) => event,\\n\\n };\\n\\n\\n\\n match next {\\n\\n Event::Start(tag) => match tag {\\n\\n // Add to the stack!\\n\\n Tag::Emphasis => {\\n\\n self.stack.push(Style::from(Effect::Italic))\\n\\n }\\n\",\n \"file_path\": \"src/utils/markup/markdown.rs\",\n \"rank\": 64,\n \"score\": 96054.05642943982\n },\n {\n \"content\": \"fn sub_block(extra: usize) -> &'static str {\\n\\n match extra {\\n\\n 0 => \\\" \\\",\\n\\n 1 => \\\"▏\\\",\\n\\n 2 => \\\"▎\\\",\\n\\n 3 => \\\"▍\\\",\\n\\n 4 => \\\"▌\\\",\\n\\n 5 => \\\"▋\\\",\\n\\n 6 => \\\"▊\\\",\\n\\n 7 => \\\"▉\\\",\\n\\n _ => \\\"█\\\",\\n\\n }\\n\\n}\\n\\n\\n\\nimpl View for ProgressBar {\\n\\n fn draw(&self, printer: &Printer<'_, '_>) {\\n\\n // Now, the bar itself...\\n\\n let available = printer.size.x;\\n\\n\\n\\n let value = self.value.get();\\n\",\n \"file_path\": \"src/views/progress_bar.rs\",\n \"rank\": 65,\n \"score\": 94023.1004502685\n },\n {\n \"content\": \"/// Internal function to aid the creation of the DebugViewFilter.\\n\\n/// Returns a SelectView to update the minimum severity of new logs saved in the circular buffer\\n\\n/// Wrapped by a Panel and BoxView for appearance\\n\\nfn debug_set_log_level() -> views::Panel<views::BoxView<views::ListView>> {\\n\\n views::Panel::new(views::BoxView::with_full_width(views::ListView::new().child(\\n\\n \\\"Set Max Log Level\\\",\\n\\n views::SelectView::new()\\n\\n .popup()\\n\\n .item(\\\"Debug\\\", log::LevelFilter::Debug)\\n\\n .item(\\\"Info\\\", log::LevelFilter::Info)\\n\\n .item(\\\"Warn\\\", log::LevelFilter::Warn)\\n\\n .item(\\\"Error\\\", log::LevelFilter::Error)\\n\\n .on_submit({\\n\\n move |_s, new_log_level| {\\n\\n log::set_max_level(*new_log_level);\\n\\n }\\n\\n }),\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/views/debug_view.rs\",\n \"rank\": 66,\n \"score\": 94012.01858998794\n },\n {\n \"content\": \"/// Returns a `&str` with `length` characters `*`.\\n\\n///\\n\\n/// Only works for small `length` (1 or 2).\\n\\n/// Best used for single character replacement.\\n\\nfn make_small_stars(length: usize) -> &'static str {\\n\\n // TODO: be able to use any character as hidden mode?\\n\\n &\\\"****\\\"[..length]\\n\\n}\\n\\n\\n\\nimpl View for EditView {\\n\\n fn draw(&self, printer: &Printer<'_, '_>) {\\n\\n assert_eq!(\\n\\n printer.size.x, self.last_length,\\n\\n \\\"Was promised {}, received {}\\\",\\n\\n self.last_length, printer.size.x\\n\\n );\\n\\n\\n\\n let width = self.content.width();\\n\\n printer.with_color(self.style, |printer| {\\n\\n let effect = if self.enabled && printer.enabled {\\n\\n Effect::Reverse\\n\\n } else {\\n\\n Effect::Simple\\n\\n };\\n\",\n \"file_path\": \"src/views/edit_view.rs\",\n \"rank\": 67,\n \"score\": 92101.86719072246\n },\n {\n \"content\": \"/// Internal function to aid the creation of the DebugViewFilter.\\n\\n/// Returns a SelectView to modify the minimum log severity displayed.\\n\\n/// Wrapped by a Panel and BoxView for appearance\\n\\nfn debug_set_log_filter(debug_view_id: &'static str) -> views::Panel<views::BoxView<views::ListView>> {\\n\\n views::Panel::new(views::BoxView::with_full_width(views::ListView::new().child(\\n\\n \\\"Filter Log Levels\\\",\\n\\n views::SelectView::new()\\n\\n .popup()\\n\\n .item(\\\"Debug\\\", log::LevelFilter::Debug)\\n\\n .item(\\\"Info\\\", log::LevelFilter::Info)\\n\\n .item(\\\"Warn\\\", log::LevelFilter::Warn)\\n\\n .item(\\\"Error\\\", log::LevelFilter::Error)\\n\\n .on_submit({\\n\\n move |s, new_filter| {\\n\\n s.call_on_id(&debug_view_id, {\\n\\n move |debug_view: &mut views::DebugView| {\\n\\n debug_view.set_filter(new_filter.clone());\\n\\n }\\n\\n });\\n\\n }\\n\\n }),\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/views/debug_view.rs\",\n \"rank\": 68,\n \"score\": 91926.53671765618\n },\n {\n \"content\": \"/// Internal function to aid the creation of the DebugViewFilter.\\n\\n/// Returns a SelectView to modify whether all logs, or only logs relating to a custom module, are\\n\\n/// displayed. Wrapped by a Panel and BoxView for appearance\\n\\nfn debug_set_mod_filter(debug_view_id: &'static str) -> views::Panel<views::BoxView<views::ListView>> {\\n\\n let mut filter_module_select_view = views::SelectView::new()\\n\\n .popup()\\n\\n .item(\\\"All\\\", ModuleFilter::All)\\n\\n .on_submit({\\n\\n move |s, mod_filter| {\\n\\n s.call_on_id(&debug_view_id, {\\n\\n move |debug_view: &mut views::DebugView| {\\n\\n debug_view.set_module(mod_filter.clone());\\n\\n }\\n\\n });\\n\\n }\\n\\n });\\n\\n\\n\\n // If the logger has been initialised to monitor a custom module, add to the SelectView\\n\\n let module = logger::MODULE.lock().unwrap();\\n\\n if let Some(ref module_name) = *module {\\n\\n filter_module_select_view.add_item(module_name.to_string(), ModuleFilter::Module)\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/views/debug_view.rs\",\n \"rank\": 69,\n \"score\": 91926.42070829423\n },\n {\n \"content\": \"fn make_rows(text: &str, width: usize) -> Vec<Row> {\\n\\n // We can't make rows with width=0, so force at least width=1.\\n\\n let width = usize::max(width, 1);\\n\\n LinesIterator::new(text, width).show_spaces().collect()\\n\\n}\\n\\n\\n\\nnew_default!(TextArea);\\n\\n\\n\\nimpl TextArea {\\n\\n /// Creates a new, empty TextArea.\\n\\n pub fn new() -> Self {\\n\\n TextArea {\\n\\n content: String::new(),\\n\\n rows: Vec::new(),\\n\\n enabled: true,\\n\\n scrollbase: ScrollBase::new().right_padding(0),\\n\\n size_cache: None,\\n\\n last_size: Vec2::zero(),\\n\\n cursor: 0,\\n\\n }\\n\",\n \"file_path\": \"src/views/text_area.rs\",\n \"rank\": 70,\n \"score\": 88284.78983931888\n },\n {\n \"content\": \"// Gradient for the front color\\n\\nfn front_color(x: u8, y: u8, x_max: u8, y_max: u8) -> Color {\\n\\n // We return a full 24-bits RGB color, but some backends\\n\\n // will project it to a 256-colors palette.\\n\\n Color::Rgb(\\n\\n x * (255 / x_max),\\n\\n y * (255 / y_max),\\n\\n (x + 2 * y) * (255 / (x_max + 2 * y_max)),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/colors.rs\",\n \"rank\": 71,\n \"score\": 87857.10449221743\n },\n {\n \"content\": \"// Gradient for the background color\\n\\nfn back_color(x: u8, y: u8, x_max: u8, y_max: u8) -> Color {\\n\\n // Let's try to have a gradient in a different direction than the front color.\\n\\n Color::Rgb(\\n\\n 128 + (2 * y_max + x - 2 * y) * (128 / (x_max + 2 * y_max)),\\n\\n 255 - y * (255 / y_max),\\n\\n 255 - x * (255 / x_max),\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"examples/colors.rs\",\n \"rank\": 72,\n \"score\": 87851.85411513755\n },\n {\n \"content\": \"#[derive(Clone, Copy, PartialEq)]\\n\\nenum Cell {\\n\\n Visible(usize),\\n\\n Flag,\\n\\n Unknown,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mines/main.rs\",\n \"rank\": 73,\n \"score\": 78087.49801784399\n },\n {\n \"content\": \"#[derive(PartialEq, Debug)]\\n\\nenum State {\\n\\n /// The menubar is inactive.\\n\\n Inactive,\\n\\n /// The menubar is actively selected.\\n\\n ///\\n\\n /// It will receive input.\\n\\n Selected,\\n\\n /// The menubar is still visible, but a submenu is open.\\n\\n ///\\n\\n /// It will not receive input.\\n\\n Submenu,\\n\\n}\\n\\n\\n\\n/// Shows a single-line list of items, with pop-up menus when one is selected.\\n\\n///\\n\\n/// The [`Cursive`] root already includes a menubar\\n\\n/// that you just need to configure.\\n\\n///\\n\\n/// [`Cursive`]: ../struct.Cursive.html#method.menubar\\n\\npub struct Menubar {\\n\",\n \"file_path\": \"src/views/menubar.rs\",\n \"rank\": 74,\n \"score\": 78082.40367827428\n },\n {\n \"content\": \"enum ColorRole {\\n\\n Foreground,\\n\\n Background,\\n\\n}\\n\\n\\n\\n/// Backend using BearLibTerminal\\n\\npub struct Backend {\\n\\n buttons_pressed: HashSet<MouseButton>,\\n\\n mouse_position: Vec2,\\n\\n}\\n\\n\\n\\nimpl Backend {\\n\\n /// Creates a new BearLibTerminal-based backend.\\n\\n pub fn init() -> Box<dyn backend::Backend> {\\n\\n // TODO: Add some error handling?\\n\\n terminal::open(\\\"Cursive\\\", 80, 24);\\n\\n terminal::set(terminal::config::Window::empty().resizeable(true));\\n\\n terminal::set(vec![\\n\\n terminal::config::InputFilter::Group {\\n\\n group: terminal::config::InputFilterGroup::Keyboard,\\n\",\n \"file_path\": \"src/backend/blt.rs\",\n \"rank\": 75,\n \"score\": 76711.18853508454\n },\n {\n \"content\": \"/// Where should the view be on the screen (per dimension).\\n\\nenum Placement {\\n\\n /// View is floating at a specific position.\\n\\n Floating(Position),\\n\\n\\n\\n /// View is full-screen; it should not have a 1-cell border.\\n\\n Fullscreen,\\n\\n}\\n\\n\\n\\n/// Identifies a layer in a `StackView`.\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\\n\\npub enum LayerPosition {\\n\\n /// Starts from the back (bottom) of the stack.\\n\\n FromBack(usize),\\n\\n /// Starts from the front (top) of the stack.\\n\\n FromFront(usize),\\n\\n}\\n\\n\\n\\nimpl Placement {\\n\\n pub fn compute_offset<S, A, P>(\\n\\n &self, size: S, available: A, parent: P,\\n\",\n \"file_path\": \"src/views/stack_view.rs\",\n \"rank\": 76,\n \"score\": 76711.18853508454\n },\n {\n \"content\": \"#[derive(PartialEq, Clone)]\\n\\nenum TriggerPhase {\\n\\n BeforeChild,\\n\\n AfterChild,\\n\\n}\\n\\n\\n\\nimpl<T: View> OnEventView<T> {\\n\\n /// Wraps the given view in a new OnEventView.\\n\\n pub fn new(view: T) -> Self {\\n\\n OnEventView {\\n\\n view,\\n\\n callbacks: Vec::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Registers a callback when the given event is ignored by the child.\\n\\n ///\\n\\n /// Chainable variant.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\",\n \"file_path\": \"src/views/on_event_view.rs\",\n \"rank\": 77,\n \"score\": 75431.52034880916\n },\n {\n \"content\": \"/// A view that can be downcasted to its concrete type.\\n\\n///\\n\\n/// This trait is automatically implemented for any `T: View`.\\n\\npub trait AnyView {\\n\\n /// Downcast self to a `Any`.\\n\\n fn as_any(&self) -> &dyn Any;\\n\\n\\n\\n /// Downcast self to a mutable `Any`.\\n\\n fn as_any_mut(&mut self) -> &mut dyn Any;\\n\\n\\n\\n /// Returns a boxed any from a boxed self.\\n\\n ///\\n\\n /// Can be used before `Box::downcast()`.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```rust\\n\\n /// # use cursive::views::TextView;\\n\\n /// # use cursive::view::View;\\n\\n /// # fn main() {\\n\\n /// let boxed: Box<View> = Box::new(TextView::new(\\\"text\\\"));\\n\\n /// let text: Box<TextView> = boxed.as_boxed_any().downcast().unwrap();\\n\\n /// # }\\n\",\n \"file_path\": \"src/view/any.rs\",\n \"rank\": 78,\n \"score\": 74154.06471269269\n },\n {\n \"content\": \"/// Generic trait to enable chainable API\\n\\npub trait With: Sized {\\n\\n /// Calls the given closure on `self`.\\n\\n fn with<F: FnOnce(&mut Self)>(mut self, f: F) -> Self {\\n\\n f(&mut self);\\n\\n self\\n\\n }\\n\\n\\n\\n /// Calls the given closure on `self`.\\n\\n fn try_with<E, F>(mut self, f: F) -> Result<Self, E>\\n\\n where\\n\\n F: FnOnce(&mut Self) -> Result<(), E>,\\n\\n {\\n\\n f(&mut self)?;\\n\\n Ok(self)\\n\\n }\\n\\n\\n\\n /// Calls the given closure if `condition == true`.\\n\\n fn with_if<F>(mut self, condition: bool, f: F) -> Self\\n\\n where\\n\\n F: FnOnce(&mut Self),\\n\\n {\\n\\n if condition {\\n\\n f(&mut self);\\n\\n }\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Sized> With for T {}\\n\",\n \"file_path\": \"src/with.rs\",\n \"rank\": 79,\n \"score\": 73718.90374197383\n },\n {\n \"content\": \"/// Provides `call_on<V: View>` to views.\\n\\n///\\n\\n/// This trait is mostly a wrapper around [`View::call_on_any`].\\n\\n///\\n\\n/// It provides a nicer interface to find a view when you know its type.\\n\\n///\\n\\n/// [`View::call_on_any`]: ./trait.View.html#method.call_on_any\\n\\npub trait Finder {\\n\\n /// Runs a callback on the view identified by `sel`.\\n\\n ///\\n\\n /// If the view is found, return the result of `callback`.\\n\\n ///\\n\\n /// If the view is not found, or if it is not of the asked type,\\n\\n /// it returns `None`.\\n\\n fn call_on<V, F, R>(\\n\\n &mut self, sel: &Selector<'_>, callback: F,\\n\\n ) -> Option<R>\\n\\n where\\n\\n V: View + Any,\\n\\n F: FnOnce(&mut V) -> R;\\n\\n\\n\\n /// Convenient method to use `call_on` with a `view::Selector::Id`.\\n\\n fn call_on_id<V, F, R>(&mut self, id: &str, callback: F) -> Option<R>\\n\\n where\\n\\n V: View + Any,\\n\\n F: FnOnce(&mut V) -> R,\\n\\n {\\n\",\n \"file_path\": \"src/view/finder.rs\",\n \"rank\": 80,\n \"score\": 72797.57483840935\n },\n {\n \"content\": \"/// Trait defining the required methods to be a backend.\\n\\n///\\n\\n/// A backend is the interface between the abstract view tree and the actual\\n\\n/// input/output, like a terminal.\\n\\n///\\n\\n/// It usually delegates the work to a terminal-handling library like ncurses\\n\\n/// or termion, or it can entirely simulate a terminal and show it as a\\n\\n/// graphical window (`BearLibTerminal`).\\n\\n///\\n\\n/// When creating a new cursive tree with `Cursive::new()`, you will need to\\n\\n/// provide a backend initializer - usually their `init()` function.\\n\\n///\\n\\n/// Backends are responsible for handling input and converting it to `Event`. Input must be\\n\\n/// non-blocking, it will be polled regularly.\\n\\npub trait Backend {\\n\\n /// Polls the backend for any input.\\n\\n ///\\n\\n /// Should return immediately.\\n\\n fn poll_event(&mut self) -> Option<Event>;\\n\\n\\n\\n // TODO: take `self` by value?\\n\\n // Or implement Drop?\\n\\n /// Prepares to close the backend.\\n\\n ///\\n\\n /// This should clear any state in the terminal.\\n\\n fn finish(&mut self);\\n\\n\\n\\n /// Refresh the screen.\\n\\n ///\\n\\n /// This will be called each frame after drawing has been done.\\n\\n ///\\n\\n /// A backend could, for example, buffer any print command, and apply\\n\\n /// everything when refresh() is called.\\n\\n fn refresh(&mut self);\\n\",\n \"file_path\": \"src/backend/mod.rs\",\n \"rank\": 81,\n \"score\": 72793.32576726643\n },\n {\n \"content\": \"/// Describes an item with a scroll core.\\n\\n///\\n\\n/// This trait is used to represent \\\"something that can scroll\\\".\\n\\n/// All it needs is an accessible core.\\n\\n///\\n\\n/// See the various methods in the [`scroll`](crate::view::scroll) module.\\n\\npub trait Scroller {\\n\\n /// Returns a mutable access to the scroll core.\\n\\n fn get_scroller_mut(&mut self) -> &mut Core;\\n\\n\\n\\n /// Returns an immutable access to the scroll core.\\n\\n fn get_scroller(&self) -> &Core;\\n\\n}\\n\\n\\n\\n/// Core system for scrolling views.\\n\\n///\\n\\n/// See also [`ScrollView`](crate::views::ScrollView).\\n\\n#[derive(Debug)]\\n\\npub struct Core {\\n\\n /// This is the size the child thinks we're giving him.\\n\\n inner_size: Vec2,\\n\\n\\n\\n /// Offset into the inner view.\\n\\n ///\\n\\n /// Our `(0,0)` will be inner's `offset`\\n\\n offset: Vec2,\\n\",\n \"file_path\": \"src/view/scroll/core.rs\",\n \"rank\": 82,\n \"score\": 71517.71765514123\n },\n {\n \"content\": \"/// Generic trait for elements that can be converted into a `ViewPath`.\\n\\npub trait ToPath {\\n\\n /// Creates a path from the element.\\n\\n fn to_path(self) -> ViewPath;\\n\\n}\\n\\n\\n\\nimpl<'a> ToPath for &'a [usize] {\\n\\n fn to_path(self) -> ViewPath {\\n\\n ViewPath {\\n\\n path: self.to_owned(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/view/view_path.rs\",\n \"rank\": 83,\n \"score\": 71513.50647669955\n },\n {\n \"content\": \"/// Describes an object that appears like a `SpannedStr`.\\n\\npub trait SpannedText {\\n\\n /// Type of span returned by `SpannedText::spans()`.\\n\\n type S: AsRef<IndexedCow>;\\n\\n\\n\\n /// Returns the source text.\\n\\n fn source(&self) -> &str;\\n\\n\\n\\n /// Returns the spans for this text.\\n\\n fn spans(&self) -> &[Self::S];\\n\\n\\n\\n /// Returns a `SpannedText` by reference.\\n\\n fn as_ref(&self) -> SpannedTextRef<'_, Self> {\\n\\n SpannedTextRef { r: self }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A reference to another `SpannedText`.\\n\\npub struct SpannedTextRef<'a, C>\\n\\nwhere\\n\\n C: SpannedText + ?Sized,\\n\",\n \"file_path\": \"src/utils/span.rs\",\n \"rank\": 84,\n \"score\": 71513.50647669955\n },\n {\n \"content\": \"fn main() {\\n\\n // Start as usual\\n\\n let mut siv = Cursive::default();\\n\\n siv.add_global_callback('q', |s| s.quit());\\n\\n\\n\\n // Canvas lets us easily override any method.\\n\\n // Canvas can have states, but we don't need any here, so we use `()`.\\n\\n siv.add_layer(Canvas::new(()).with_draw(draw).fixed_size((20, 10)));\\n\\n\\n\\n siv.run();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/colors.rs\",\n \"rank\": 85,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // Create a dialog with an edit text and a button.\\n\\n // The user can either hit the <Ok> button,\\n\\n // or press Enter on the edit text.\\n\\n siv.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Enter your name\\\")\\n\\n // Padding is (left, right, top, bottom)\\n\\n .padding((1, 1, 1, 0))\\n\\n .content(\\n\\n EditView::new()\\n\\n // Call `show_popup` when the user presses `Enter`\\n\\n .on_submit(show_popup)\\n\\n // Give the `EditView` a name so we can refer to it later.\\n\\n .with_id(\\\"name\\\")\\n\\n // Wrap this in a `BoxView` with a fixed width.\\n\\n // Do this _after_ `with_id` or the name will point to the\\n\\n // `BoxView` instead of `EditView`!\\n\",\n \"file_path\": \"examples/edit.rs\",\n \"rank\": 86,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // Some description text. We want it to be long, but not _too_ long.\\n\\n let text = \\\"This is a very simple example of linear layout. Two views \\\\\\n\\n are present, a short title above, and this text. The text \\\\\\n\\n has a fixed width, and the title is centered horizontally.\\\";\\n\\n\\n\\n // We'll create a dialog with a TextView serving as a title\\n\\n siv.add_layer(\\n\\n Dialog::around(\\n\\n LinearLayout::vertical()\\n\\n .child(TextView::new(\\\"Title\\\").h_align(HAlign::Center))\\n\\n // Use a DummyView as spacer\\n\\n .child(DummyView.fixed_height(1))\\n\\n // Disabling scrollable means the view cannot shrink.\\n\\n .child(TextView::new(text))\\n\\n // The other views will share the remaining space.\\n\\n .child(TextView::new(text).scrollable())\\n\\n .child(TextView::new(text).scrollable())\\n\\n .child(TextView::new(text).scrollable())\\n\\n .fixed_width(30),\\n\\n )\\n\\n .button(\\\"Quit\\\", |s| s.quit())\\n\\n .h_align(HAlign::Center),\\n\\n );\\n\\n\\n\\n siv.run();\\n\\n}\\n\",\n \"file_path\": \"examples/linear.rs\",\n \"rank\": 87,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n // Creates the cursive root - required for every application.\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // Creates a dialog with a single \\\"Quit\\\" button\\n\\n siv.add_layer(\\n\\n // Most views can be configured in a chainable way\\n\\n CircularFocus::wrap_tab(\\n\\n Dialog::around(TextView::new(\\\"Hello Dialog!\\\"))\\n\\n .title(\\\"Cursive\\\")\\n\\n .button(\\\"Foo\\\", |_s| ())\\n\\n .button(\\\"Quit\\\", |s| s.quit()),\\n\\n ),\\n\\n );\\n\\n\\n\\n // Starts the event loop.\\n\\n siv.run();\\n\\n}\\n\",\n \"file_path\": \"examples/dialog.rs\",\n \"rank\": 88,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // We can quit by pressing `q`\\n\\n siv.add_global_callback('q', Cursive::quit);\\n\\n // Next Gen FPS Controls.\\n\\n siv.add_global_callback('w', |s| move_top(s, 0, -1));\\n\\n siv.add_global_callback('a', |s| move_top(s, -1, 0));\\n\\n siv.add_global_callback('s', |s| move_top(s, 0, 1));\\n\\n siv.add_global_callback('d', |s| move_top(s, 1, 0));\\n\\n\\n\\n // Add window to fly around.\\n\\n siv.add_layer(TextView::new(\\n\\n \\\"Press w,a,s,d to move the window.\\\\n\\\\\\n\\n Press q to quit the application.\\\",\\n\\n ));\\n\\n\\n\\n // Run the event loop\\n\\n siv.run();\\n\\n}\\n\",\n \"file_path\": \"examples/position.rs\",\n \"rank\": 89,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n // Read some long text from a file.\\n\\n let content = include_str!(\\\"../assets/lorem.txt\\\");\\n\\n\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // We can quit by pressing q\\n\\n siv.add_global_callback('q', |s| s.quit());\\n\\n\\n\\n // The text is too long to fit on a line, so the view will wrap lines,\\n\\n // and will adapt to the terminal size.\\n\\n siv.add_fullscreen_layer(\\n\\n Dialog::around(Panel::new(TextView::new(content).scrollable()))\\n\\n .title(\\\"Unicode and wide-character support\\\")\\n\\n // This is the alignment for the button\\n\\n .h_align(HAlign::Center)\\n\\n .button(\\\"Quit\\\", |s| s.quit()),\\n\\n );\\n\\n // Show a popup on top of the view.\\n\\n siv.add_layer(Dialog::info(\\n\\n \\\"Try resizing the terminal!\\\\n(Press 'q' to \\\\\\n\\n quit when you're done.)\\\",\\n\\n ));\\n\\n\\n\\n siv.run();\\n\\n}\\n\",\n \"file_path\": \"examples/lorem.rs\",\n \"rank\": 90,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n siv.add_global_callback('q', |s| s.quit());\\n\\n\\n\\n // Let's add a simple slider in a dialog.\\n\\n // Moving the slider will update the dialog's title.\\n\\n // And pressing \\\"Enter\\\" will show a new dialog.\\n\\n siv.add_layer(\\n\\n Dialog::around(\\n\\n // We give the number of steps in the constructor\\n\\n SliderView::horizontal(15)\\n\\n // Sets the initial value\\n\\n .value(7)\\n\\n .on_change(|s, v| {\\n\\n let title = format!(\\\"[ {} ]\\\", v);\\n\\n s.call_on_id(\\\"dialog\\\", |view: &mut Dialog| {\\n\\n view.set_title(title)\\n\\n });\\n\\n })\\n\",\n \"file_path\": \"examples/slider.rs\",\n \"rank\": 91,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // We'll start slowly with a simple start button...\\n\\n siv.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Progress bar example\\\")\\n\\n .padding((0, 0, 1, 1))\\n\\n .content(Button::new(\\\"Start\\\", phase_1)),\\n\\n );\\n\\n\\n\\n siv.run();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 92,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n // As usual, create the Cursive root\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n let cb_sink = siv.cb_sink().clone();\\n\\n\\n\\n // We want to refresh the page even when no input is given.\\n\\n siv.add_global_callback('q', |s| s.quit());\\n\\n\\n\\n // A channel will communicate data from our running task to the UI.\\n\\n let (tx, rx) = mpsc::channel();\\n\\n\\n\\n // Generate data in a separate thread.\\n\\n thread::spawn(move || {\\n\\n generate_logs(&tx, cb_sink);\\n\\n });\\n\\n\\n\\n // And sets the view to read from the other end of the channel.\\n\\n siv.add_layer(BufferView::new(200, rx).full_screen());\\n\\n\\n\\n siv.run();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/logs.rs\",\n \"rank\": 93,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n let content = \\\"Press Q to quit the application.\\\\n\\\\nPress P to open the \\\\\\n\\n popup.\\\";\\n\\n\\n\\n siv.add_global_callback('q', |s| s.quit());\\n\\n\\n\\n // Let's wrap the view to give it a recognizable ID, so we can look for it.\\n\\n // We add the P callback on the textview only (and not globally),\\n\\n // so that we can't call it when the popup is already visible.\\n\\n siv.add_layer(\\n\\n OnEventView::new(TextView::new(content).with_id(\\\"text\\\"))\\n\\n .on_event('p', |s| show_popup(s)),\\n\\n );\\n\\n\\n\\n siv.run();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mutation.rs\",\n \"rank\": 94,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = cursive::Cursive::default();\\n\\n\\n\\n siv.add_layer(\\n\\n Dialog::around(\\n\\n LinearLayout::vertical()\\n\\n .child(Button::new(\\\"Foo\\\", |s| s.add_layer(Dialog::info(\\\"Ah\\\"))))\\n\\n .child(Canvas::new(()).with_draw(draw).fixed_size((120, 40)))\\n\\n .child(Button::new(\\\"Bar\\\", |s| s.add_layer(Dialog::info(\\\"Uh\\\"))))\\n\\n .scrollable()\\n\\n .scroll_x(true),\\n\\n )\\n\\n .fixed_size((60, 30)),\\n\\n );\\n\\n\\n\\n siv.add_global_callback('q', |s| s.quit());\\n\\n\\n\\n siv.run();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scroll.rs\",\n \"rank\": 95,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // We'll use a counter to name new files.\\n\\n let counter = AtomicUsize::new(1);\\n\\n\\n\\n // The menubar is a list of (label, menu tree) pairs.\\n\\n siv.menubar()\\n\\n // We add a new \\\"File\\\" tree\\n\\n .add_subtree(\\n\\n \\\"File\\\",\\n\\n MenuTree::new()\\n\\n // Trees are made of leaves, with are directly actionable...\\n\\n .leaf(\\\"New\\\", move |s| {\\n\\n // Here we use the counter to add an entry\\n\\n // in the list of \\\"Recent\\\" items.\\n\\n let i = counter.fetch_add(1, Ordering::Relaxed);\\n\\n let filename = format!(\\\"New {}\\\", i);\\n\\n s.menubar()\\n\\n .find_subtree(\\\"File\\\")\\n\",\n \"file_path\": \"examples/menubar.rs\",\n \"rank\": 96,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n let mut styled = StyledString::plain(\\\"Isn't \\\");\\n\\n styled.append(StyledString::styled(\\\"that \\\", Color::Dark(BaseColor::Red)));\\n\\n styled.append(StyledString::styled(\\n\\n \\\"cool?\\\",\\n\\n Style::from(Color::Light(BaseColor::Blue)).combine(Effect::Bold),\\n\\n ));\\n\\n\\n\\n // TextView can natively accept StyledString.\\n\\n siv.add_layer(\\n\\n Dialog::around(TextView::new(styled))\\n\\n .button(\\\"Hell yeah!\\\", |s| s.quit()),\\n\\n );\\n\\n\\n\\n siv.run();\\n\\n}\\n\",\n \"file_path\": \"examples/markup.rs\",\n \"rank\": 97,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut siv = Cursive::default();\\n\\n\\n\\n // We need to pre-create the groups for our RadioButtons.\\n\\n let mut color_group: RadioGroup<String> = RadioGroup::new();\\n\\n let mut size_group: RadioGroup<u32> = RadioGroup::new();\\n\\n\\n\\n siv.add_layer(\\n\\n Dialog::new()\\n\\n .title(\\\"Make your selection\\\")\\n\\n // We'll have two columns side-by-side\\n\\n .content(\\n\\n LinearLayout::horizontal()\\n\\n .child(\\n\\n LinearLayout::vertical()\\n\\n // The color group uses the label itself as stored value\\n\\n // By default, the first item is selected.\\n\\n .child(color_group.button_str(\\\"Red\\\"))\\n\\n .child(color_group.button_str(\\\"Green\\\"))\\n\\n .child(color_group.button_str(\\\"Blue\\\")),\\n\",\n \"file_path\": \"examples/radio.rs\",\n \"rank\": 98,\n \"score\": 70727.56173792123\n },\n {\n \"content\": \"fn main() {\\n\\n let mut select = SelectView::new()\\n\\n // Center the text horizontally\\n\\n .h_align(HAlign::Center)\\n\\n // Use keyboard to jump to the pressed letters\\n\\n .autojump();\\n\\n\\n\\n // Read the list of cities from separate file, and fill the view with it.\\n\\n // (We include the file at compile-time to avoid runtime read errors.)\\n\\n let content = include_str!(\\\"../assets/cities.txt\\\");\\n\\n select.add_all_str(content.lines());\\n\\n\\n\\n // Sets the callback for when \\\"Enter\\\" is pressed.\\n\\n select.set_on_submit(show_next_window);\\n\\n\\n\\n // Let's override the `j` and `k` keys for navigation\\n\\n let select = OnEventView::new(select)\\n\\n .on_pre_event_inner('k', |s, _| {\\n\\n s.select_up(1);\\n\\n Some(EventResult::Consumed(None))\\n\",\n \"file_path\": \"examples/select.rs\",\n \"rank\": 99,\n \"score\": 70727.56173792123\n }\n]","isConversational":false}}},{"rowIdx":1197,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/gui/layout.rs"},"repo_name":{"kind":"string","value":"lukexor/pix-engine"},"commit":{"kind":"string","value":"447b794d57fcb4e6c5631254857d210c430f0181"},"file_code":{"kind":"string","value":"\n\nuse crate::{ops::clamp_size, prelude::*};\n\nimpl PixState {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n pub fn same_line<O>(&mut self, offset: O)\n where\n O: Into<Option<[i32; 2]>>,\n {\n let [x, y] = self.ui.pcursor().as_array();\n let offset = offset.into().unwrap_or([0; 2]);\n let item_pad = self.theme.spacing.item_pad;\n self.ui\n .set_cursor([x + item_pad.x() + offset[0], y + offset[1]]);\n self.ui.line_height = self.ui.pline_height - offset[1];\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n pub fn next_width(&mut self, width: u32) {\n self.ui.next_width = Some(clamp_size(width));\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn tab_bar<S, I, F>(&mut self, label: S, tabs: &[I], f: F) -> PixResult<()>\n where\n S: AsRef<str>,\n I: AsRef<str>,\n F: FnOnce(usize, &mut PixState) -> PixResult<()>,\n {\n let label = label.as_ref();\n\n let s = self;\n let tab_id = s.ui.get_id(&label);\n let colors = s.theme.colors;\n let fpad = s.theme.spacing.frame_pad;\n let ipad = s.theme.spacing.item_pad;\n\n for (i, tab_label) in tabs.iter().enumerate() {\n if i > 0 {\n s.same_line(None);\n }\n let tab_label = tab_label.as_ref();\n let id = s.ui.get_id(&tab_label);\n let tab_label = s.ui.get_label(tab_label);\n let pos = s.cursor_pos();\n let colors = s.theme.colors;\n\n \n let (width, height) = s.text_size(tab_label)?;\n let tab = rect![pos + fpad.x(), width, height].offset_size(2 * ipad);\n\n \n let hovered = s.ui.try_hover(id, &tab);\n let focused = s.ui.try_focus(id);\n let disabled = s.ui.disabled;\n let active = s.ui.is_active(id);\n\n s.push();\n s.ui.push_cursor();\n\n \n s.rect_mode(RectMode::Corner);\n let clip = tab.offset_size([1, 0]);\n s.clip(clip)?;\n if hovered {\n s.frame_cursor(&Cursor::hand())?;\n }\n let [stroke, fg, bg] = s.widget_colors(id, ColorType::SecondaryVariant);\n if active || focused {\n s.stroke(stroke);\n } else {\n s.no_stroke();\n }\n if hovered {\n s.fill(fg.blended(colors.background, 0.04));\n } else {\n s.fill(colors.background);\n }\n if active {\n s.rect(tab.offset([1, 1]))?;\n } else {\n s.rect(tab)?;\n }\n s.no_clip()?;\n\n \n s.rect_mode(RectMode::Center);\n s.clip(tab)?;\n s.set_cursor_pos(tab.center());\n s.no_stroke();\n let is_active_tab = i == s.ui.current_tab(tab_id);\n if is_active_tab {\n s.fill(colors.secondary_variant);\n } else if hovered | focused {\n s.fill(fg);\n } else {\n s.fill(colors.secondary_variant.blended(bg, 0.60));\n }\n s.text(tab_label)?;\n s.no_clip()?;\n\n s.ui.pop_cursor();\n s.pop();\n\n \n s.ui.handle_events(id);\n s.advance_cursor(tab.size());\n if !disabled && s.ui.was_clicked(id) {\n s.ui.set_current_tab(tab_id, i);\n }\n }\n\n let pos = s.cursor_pos();\n let fpad = s.theme.spacing.frame_pad;\n s.push();\n s.stroke(colors.disabled());\n let y = pos.y() + 1;\n let line_width = s.ui_width()? - fpad.x();\n s.line(line_![fpad.x(), y, line_width, y])?;\n s.pop();\n s.advance_cursor([line_width, fpad.y()]);\n\n s.push_id(tab_id);\n f(s.ui.current_tab(tab_id), s)?;\n s.pop_id();\n\n Ok(())\n }\n}\n\nimpl PixState {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn spacing(&mut self) -> PixResult<()> {\n let s = self;\n let width = s.ui_width()?;\n let (_, height) = s.text_size(\" \")?;\n s.advance_cursor([width, height]);\n Ok(())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn indent(&mut self) -> PixResult<()> {\n let s = self;\n let (width, height) = s.text_size(\" \")?;\n s.advance_cursor([width, height]);\n s.same_line(None);\n Ok(())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn separator(&mut self) -> PixResult<()> {\n \n let s = self;\n let pos = s.cursor_pos();\n let colors = s.theme.colors;\n let pad = s.theme.spacing.frame_pad;\n let height = clamp_size(s.theme.font_size);\n let y = pos.y() + height / 2;\n\n s.push();\n\n s.stroke(colors.disabled());\n let width = s.ui_width()?;\n s.line(line_![pad.x(), y, width, y])?;\n\n s.pop();\n s.advance_cursor([width, height]);\n\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::{ops::clamp_size, prelude::*};\n\nimpl PixState {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n pub fn same_line<O>(&mut self, offset: O)\n where\n O: Into<Option<[i32; 2]>>,\n {\n let [x, y] = self.ui.pcursor().as_array();\n let offset = offset.into().unwrap_or([0; 2]);\n let item_pad = self.theme.spacing.item_pad;\n self.ui\n .set_cursor([x + item_pad.x() + offset[0], y + offset[1]]);\n self.ui.line_height = self.ui.pline_height - offset[1];\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n pub fn next_width(&mut self, width: u32) {\n self.ui.next_width = Some(clamp_size(width));\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n "},"suffix":{"kind":"string","value":"\n}\n\nimpl PixState {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn spacing(&mut self) -> PixResult<()> {\n let s = self;\n let width = s.ui_width()?;\n let (_, height) = s.text_size(\" \")?;\n s.advance_cursor([width, height]);\n Ok(())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn indent(&mut self) -> PixResult<()> {\n let s = self;\n let (width, height) = s.text_size(\" \")?;\n s.advance_cursor([width, height]);\n s.same_line(None);\n Ok(())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn separator(&mut self) -> PixResult<()> {\n \n let s = self;\n let pos = s.cursor_pos();\n let colors = s.theme.colors;\n let pad = s.theme.spacing.frame_pad;\n let height = clamp_size(s.theme.font_size);\n let y = pos.y() + height / 2;\n\n s.push();\n\n s.stroke(colors.disabled());\n let width = s.ui_width()?;\n s.line(line_![pad.x(), y, width, y])?;\n\n s.pop();\n s.advance_cursor([width, height]);\n\n Ok(())\n }\n}\n"},"middle":{"kind":"string","value":"pub fn tab_bar<S, I, F>(&mut self, label: S, tabs: &[I], f: F) -> PixResult<()>\n where\n S: AsRef<str>,\n I: AsRef<str>,\n F: FnOnce(usize, &mut PixState) -> PixResult<()>,\n {\n let label = label.as_ref();\n\n let s = self;\n let tab_id = s.ui.get_id(&label);\n let colors = s.theme.colors;\n let fpad = s.theme.spacing.frame_pad;\n let ipad = s.theme.spacing.item_pad;\n\n for (i, tab_label) in tabs.iter().enumerate() {\n if i > 0 {\n s.same_line(None);\n }\n let tab_label = tab_label.as_ref();\n let id = s.ui.get_id(&tab_label);\n let tab_label = s.ui.get_label(tab_label);\n let pos = s.cursor_pos();\n let colors = s.theme.colors;\n\n \n let (width, height) = s.text_size(tab_label)?;\n let tab = rect![pos + fpad.x(), width, height].offset_size(2 * ipad);\n\n \n let hovered = s.ui.try_hover(id, &tab);\n let focused = s.ui.try_focus(id);\n let disabled = s.ui.disabled;\n let active = s.ui.is_active(id);\n\n s.push();\n s.ui.push_cursor();\n\n \n s.rect_mode(RectMode::Corner);\n let clip = tab.offset_size([1, 0]);\n s.clip(clip)?;\n if hovered {\n s.frame_cursor(&Cursor::hand())?;\n }\n let [stroke, fg, bg] = s.widget_colors(id, ColorType::SecondaryVariant);\n if active || focused {\n s.stroke(stroke);\n } else {\n s.no_stroke();\n }\n if hovered {\n s.fill(fg.blended(colors.background, 0.04));\n } else {\n s.fill(colors.background);\n }\n if active {\n s.rect(tab.offset([1, 1]))?;\n } else {\n s.rect(tab)?;\n }\n s.no_clip()?;\n\n \n s.rect_mode(RectMode::Center);\n s.clip(tab)?;\n s.set_cursor_pos(tab.center());\n s.no_stroke();\n let is_active_tab = i == s.ui.current_tab(tab_id);\n if is_active_tab {\n s.fill(colors.secondary_variant);\n } else if hovered | focused {\n s.fill(fg);\n } else {\n s.fill(colors.secondary_variant.blended(bg, 0.60));\n }\n s.text(tab_label)?;\n s.no_clip()?;\n\n s.ui.pop_cursor();\n s.pop();\n\n \n s.ui.handle_events(id);\n s.advance_cursor(tab.size());\n if !disabled && s.ui.was_clicked(id) {\n s.ui.set_current_tab(tab_id, i);\n }\n }\n\n let pos = s.cursor_pos();\n let fpad = s.theme.spacing.frame_pad;\n s.push();\n s.stroke(colors.disabled());\n let y = pos.y() + 1;\n let line_width = s.ui_width()? - fpad.x();\n s.line(line_![fpad.x(), y, line_width, y])?;\n s.pop();\n s.advance_cursor([line_width, fpad.y()]);\n\n s.push_id(tab_id);\n f(s.ui.current_tab(tab_id), s)?;\n s.pop_id();\n\n Ok(())\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"Colors\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = Colors::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/colors.rs","rank":0,"score":101949.36434358904},{"content":"pub fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"Flocking\")\n\n .with_frame_rate()\n\n .target_frame_rate(60)\n\n .build()?;\n\n let mut app = App::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/flocking.rs","rank":1,"score":101949.36434358904},{"content":"pub fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"3D Raytracing\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = App::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/3d_raytracing.rs","rank":2,"score":101949.36434358904},{"content":"pub fn main() -> PixResult<()> {\n\n let width = 800;\n\n let height = 600;\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(width, height)\n\n .with_title(\"Asteroids\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = Asteroids::new(width, height);\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/asteroids.rs","rank":3,"score":101949.36434358904},{"content":"pub fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"Maze Generation & A* Search\")\n\n .with_frame_rate()\n\n .target_frame_rate(60)\n\n .build()?;\n\n let mut app = MazeApp::new(COLS, ROWS);\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/maze/main.rs","rank":4,"score":99110.35671496368},{"content":"pub fn main() -> PixResult<()> {\n\n println!(\"Renders more smoothly using `--release` and `--features opengl`.\");\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .scale(2.0, 2.0)\n\n .with_title(\"Fluid Simulation\")\n\n .with_frame_rate()\n\n .target_frame_rate(30)\n\n .build()?;\n\n let mut app = App::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/fluid_simulation.rs","rank":5,"score":99110.35671496368},{"content":"/// Returns a random number between `0` and a given `value`.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use pix_engine::math::random;\n\n///\n\n/// let x = random(100); // x will range from (0..100]\n\n/// assert!(x >= 0 && x < 100);\n\n///\n\n/// let x = random(100.0); // x will range from (0.0..100.0]\n\n/// assert!(x >= 0.0 && x < 100.0);\n\npub fn random<T>(val: T) -> T\n\nwhere\n\n T: Num + SampleUniform + PartialOrd,\n\n{\n\n if val > T::zero() {\n\n random_rng(T::zero()..val)\n\n } else {\n\n random_rng(val..T::zero())\n\n }\n\n}\n\n\n","file_path":"src/math.rs","rank":6,"score":87829.52035430325},{"content":"/// Returns a random number within a range.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use pix_engine::math::random_rng;\n\n///\n\n/// let x = random_rng(0.0..1.0); // x will range from (0.0..1.0]\n\n/// assert!(x >= 0.0 && x < 1.0);\n\n///\n\n/// let x = random_rng(20..50); // x will range from (20..50]\n\n/// assert!(x >= 20 && x < 50);\n\npub fn random_rng<T, R>(val: R) -> T\n\nwhere\n\n T: SampleUniform + PartialOrd,\n\n R: Into<Range<T>>,\n\n{\n\n let val = val.into();\n\n rand::thread_rng().gen_range(val)\n\n}\n\n\n","file_path":"src/math.rs","rank":7,"score":81354.67380795366},{"content":"/// Returns the [Perlin noise](https://en.wikipedia.org/wiki/Perlin_noise) value at specified coordinates.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use pix_engine::math::noise;\n\n///\n\n/// let n = noise([5.0]);\n\n/// assert!(n >= 0.0 && n < 1.0);\n\n///\n\n/// let n = noise([2.0, 1.5]);\n\n/// assert!(n >= 0.0 && n < 1.0);\n\n///\n\n/// let n = noise([2.0, 1.5, 3.0]);\n\n/// assert!(n >= 0.0 && n < 1.0);\n\n/// ```\n\npub fn noise<V, const N: usize>(vector: V) -> Scalar\n\nwhere\n\n V: Into<Vector<Scalar, N>>,\n\n{\n\n let v = vector.into();\n\n\n\n let values = v.as_array();\n\n let x = values.get(0).unwrap_or(&0.0).abs();\n\n let y = values.get(1).unwrap_or(&0.0).abs();\n\n let z = values.get(2).unwrap_or(&0.0).abs();\n\n\n\n let mut xi: usize = x.trunc() as usize;\n\n let mut yi: usize = y.trunc() as usize;\n\n let mut zi: usize = z.trunc() as usize;\n\n\n\n let mut xf = x.fract();\n\n let mut yf = y.fract();\n\n let mut zf = z.fract();\n\n let (mut rxf, mut ryf);\n\n\n","file_path":"src/math.rs","rank":8,"score":76605.41091577403},{"content":"/// Linear interpolates between two values by a given amount.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use pix_engine::math::lerp;\n\n///\n\n/// let start = 0.0;\n\n/// let end = 5.0;\n\n/// let amount = 0.5;\n\n/// let value = lerp(start, end, amount);\n\n/// assert_eq!(value, 2.5);\n\n/// ```\n\npub fn lerp<T>(start: T, end: T, amount: T) -> T\n\nwhere\n\n T: Num + Copy + PartialOrd,\n\n{\n\n (T::one() - amount) * start + amount * end\n\n}\n\n\n","file_path":"src/math.rs","rank":9,"score":73597.5461490758},{"content":"/// Linear interpolates values for a range of independent values based on depdendent values.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use pix_engine::math::lerp_map;\n\n///\n\n/// let x1 = 0;\n\n/// let x2 = 5;\n\n/// let y1 = 0;\n\n/// let y2 = 10;\n\n/// let values = lerp_map(x1, x2, y1, y2);\n\n/// assert_eq!(values, vec![0, 2, 4, 6, 8, 10]);\n\n///\n\n/// let x1 = 0.0;\n\n/// let x2 = 4.0;\n\n/// let y1 = 0.0;\n\n/// let y2 = 14.0;\n\n/// let values = lerp_map(x1, x2, y1, y2);\n\n/// assert_eq!(values, vec![0.0, 3.5, 7.0, 10.5, 14.0]);\n\n/// ```\n\npub fn lerp_map<T>(start1: T, end1: T, start2: T, end2: T) -> Vec<T>\n\nwhere\n\n T: Num + NumCast + Copy + PartialOrd + AddAssign,\n\n{\n\n if start1 == end1 {\n\n vec![start2]\n\n } else {\n\n let size: usize = NumCast::from(end1 - start1).unwrap_or(4);\n\n let mut values = Vec::with_capacity(size);\n\n let a = (end2 - start2) / (end1 - start1);\n\n let mut d = start2;\n\n let mut i = start1;\n\n while i <= end1 {\n\n values.push(d);\n\n d += a;\n\n i += T::one();\n\n }\n\n values\n\n }\n\n}\n","file_path":"src/math.rs","rank":10,"score":64444.17179675972},{"content":"/// Remaps a number from one range to another.\n\n///\n\n/// Map range defaults to `0.0..=f64::MAX` in the event casting to [f64] fails.\n\n/// NaN will result in the max mapped value.\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// # use pix_engine::prelude::*;\n\n/// let value = 25;\n\n/// let m = map(value, 0, 100, 0, 800);\n\n/// assert_eq!(m, 200);\n\n///\n\n/// let value = 50.0;\n\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\n\n/// assert_eq!(m, 0.5);\n\n///\n\n/// let value = f64::NAN;\n\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\n\n/// assert!(m.is_nan());\n\n///\n\n/// let value = f64::INFINITY;\n\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\n\n/// assert_eq!(m, 1.0);\n\n///\n\n/// let value = f64::NEG_INFINITY;\n\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\n\n/// assert_eq!(m, 0.0);\n\n/// ```\n\npub fn map<T>(value: T, start1: T, end1: T, start2: T, end2: T) -> T\n\nwhere\n\n T: NumCast + Into<Scalar> + PartialOrd + Copy,\n\n{\n\n let default = end2;\n\n let start1 = start1.into();\n\n let end1 = end1.into();\n\n let start2 = start2.into();\n\n let end2 = end2.into();\n\n let value = value.into();\n\n let new_val = ((value - start1) / (end1 - start1)).mul_add(end2 - start2, start2);\n\n NumCast::from(new_val.clamp(start2, end2)).unwrap_or(default)\n\n}\n\n\n","file_path":"src/math.rs","rank":11,"score":63868.110062910244},{"content":"fn project(\n\n velx: &mut [Scalar],\n\n vely: &mut [Scalar],\n\n p: &mut [Scalar],\n\n div: &mut [Scalar],\n\n tmp: &mut [Scalar],\n\n) {\n\n let c = 1.0 / 6.0;\n\n div.par_iter_mut()\n\n .zip(tmp.par_iter_mut())\n\n .enumerate()\n\n .for_each(|(i, (div, tmp))| {\n\n let (x, y) = get_xy(i);\n\n if (1..NLEN).contains(&x) && (1..NHEIGHT).contains(&y) {\n\n *div = -0.5\n\n * (velx[get_idx(x + 1, y)] - velx[get_idx(x - 1, y)] + vely[get_idx(x, y + 1)]\n\n - vely[get_idx(x, y - 1)])\n\n / N_SCALAR;\n\n *tmp = *div * c;\n\n }\n","file_path":"examples/fluid_simulation.rs","rank":12,"score":60374.2940092556},{"content":"#[allow(clippy::many_single_char_names)]\n\nfn linear_solve(\n\n b: usize,\n\n xs: &mut [Scalar],\n\n xs0: &[Scalar],\n\n a: Scalar,\n\n c: Scalar,\n\n tmp: &mut [Scalar],\n\n) {\n\n let c_recip = c.recip();\n\n tmp.par_iter_mut().enumerate().for_each(|(i, tmp)| {\n\n let (x, y) = get_xy(i);\n\n if (1..NLEN).contains(&x) && (1..NHEIGHT).contains(&y) {\n\n *tmp = (xs0[i]\n\n + a * (xs[get_idx(x + 1, y)]\n\n + xs[get_idx(x - 1, y)]\n\n + xs[get_idx(x, y + 1)]\n\n + xs[get_idx(x, y - 1)]))\n\n * c_recip;\n\n }\n\n });\n\n xs.swap_with_slice(tmp);\n\n set_bounds(b, xs);\n\n}\n\n\n","file_path":"examples/fluid_simulation.rs","rank":13,"score":58711.68354251192},{"content":"/// Trait for objects that can be drawn to the screen.\n\npub trait Draw {\n\n /// Draw object to the current [`PixState`] canvas.\n\n ///\n\n /// # Errors\n\n ///\n\n /// If the renderer fails to draw to the current render target, then an error is returned.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\n\n /// let rect = rect![0, 0, 100, 100];\n\n /// // The following two lines are equivalent.\n\n /// s.rect(rect)?;\n\n /// rect.draw(s)?;\n\n /// Ok(())\n\n /// }\n","file_path":"src/draw.rs","rank":14,"score":56948.54144450373},{"content":"#[allow(unused_variables)]\n\npub trait AppState {\n\n /// Called once upon engine start when [`PixEngine::run`] is called.\n\n ///\n\n /// This can be used to set up initial state like creating objects, loading files or [Image]s, or\n\n /// any additional application state that's either dynamic or relies on runtime values from\n\n /// [`PixState`].\n\n ///\n\n /// # Errors\n\n ///\n\n /// Returning an error will immediately exit the application and call [`AppState:: Prefer using\n\n /// the more specialized methods where possible, as it allows you to consume them, preventing\n\n /// the engine from encountering event-handling collisions.on_stop`].\n\n /// [`PixEngine::run`] will return the original error or any error returned from\n\n /// [`AppState::on_stop`]. Calling [`PixState::abort_quit`] during [`AppState::on_stop`] has no\n\n /// effect.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n","file_path":"src/appstate.rs","rank":15,"score":55283.19966986653},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(800, 600)\n\n .with_title(\"MyApp\")\n\n .build()?;\n\n let mut app = MyApp;\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/template.rs","rank":16,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"2D Raycasting\")\n\n .with_frame_rate()\n\n .icon(Image::from_read(LIGHT)?)\n\n .build()?;\n\n let mut app = RayScene::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/2d_raycasting.rs","rank":17,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let raw_file = match std::env::args().nth(1) {\n\n None => PathBuf::from(\"./audio/melancholy.raw\"),\n\n Some(s) => PathBuf::from(s),\n\n };\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(1024, 768)\n\n .with_title(\"Audio Demo\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = AudioDemo::new(raw_file);\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/audio.rs","rank":18,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(400, 400)\n\n .with_title(\"Window 1\")\n\n .position(10, 10)\n\n .build()?;\n\n let mut app = WindowDemo::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/windows.rs","rank":19,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(DEFAULT_WIDTH, DEFAULT_HEIGHT)\n\n .position(0, 0)\n\n .with_title(\"The Matrix\")\n\n .with_frame_rate()\n\n .target_frame_rate(30)\n\n .with_font(Font::from_bytes(\"Sunray\", FONT_DATA))\n\n .with_font_size(DEFAULT_FONT_SIZE)\n\n .build()?;\n\n let mut app = Matrix::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/matrix.rs","rank":20,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(1024, 768)\n\n .with_title(\"GUI Demo\")\n\n .with_frame_rate()\n\n .target_frame_rate(60)\n\n .build()?;\n\n let mut app = Gui::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/gui.rs","rank":21,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let args: Vec<_> = env::args().collect();\n\n if args.len() < 2 {\n\n Err(anyhow!(\"Usage: cargo run /path/to/image.png\"))\n\n } else {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"Image Demo\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = ImageDemo::new(&args[1])?;\n\n engine.run(&mut app)\n\n }\n\n}\n","file_path":"examples/image.rs","rank":22,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"Textures\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = Textures::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/textures.rs","rank":23,"score":54898.97882028201},{"content":"fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"SVG Color Constants\")\n\n .build()?;\n\n let mut app = ColorConsts::new();\n\n engine.run(&mut app)\n\n}\n","file_path":"examples/color_constants.rs","rank":24,"score":53365.77537856699},{"content":"fn get_idx(x: usize, y: usize) -> usize {\n\n let x = x.clamp(0, NLEN);\n\n let y = y.clamp(0, NLEN);\n\n x + y * N\n\n}\n\n\n","file_path":"examples/fluid_simulation.rs","rank":25,"score":52818.16264510415},{"content":"#[test]\n\n#[ignore = \"engine can only be tested in the main thread. --test-threads=1\"]\n\nfn test_run_engine_update() -> PixResult<()> {\n\n let mut eng = create_engine()?;\n\n // Quitting from on_update should exit but still run on_stop\n\n let mut app = App::new();\n\n app.quit_on_update = true;\n\n eng.run(&mut app)?;\n\n assert_eq!(app.start_count, 1, \"on_start was called\");\n\n assert_eq!(app.update_count, 1, \"on_update was called\");\n\n assert_eq!(app.stop_count, 1, \"on_stop was called\");\n\n Ok(())\n\n}\n\n\n","file_path":"tests/pix-engine.rs","rank":26,"score":49407.318880080675},{"content":"#[test]\n\n#[ignore = \"engine can only be tested in the main thread. --test-threads=1\"]\n\nfn test_run_engine_start() -> PixResult<()> {\n\n let mut eng = create_engine()?;\n\n // Quitting from on_start should exit the game loop early\n\n let mut app = App::new();\n\n app.quit_on_start = true;\n\n eng.run(&mut app)?;\n\n assert_eq!(app.start_count, 1, \"on_start was called\");\n\n assert_eq!(app.update_count, 0, \"on_update was not called\");\n\n assert_eq!(app.stop_count, 1, \"on_stop was called\");\n\n Ok(())\n\n}\n\n\n","file_path":"tests/pix-engine.rs","rank":27,"score":49407.318880080675},{"content":"#[test]\n\n#[ignore = \"engine can only be tested in the main thread. --test-threads=1\"]\n\nfn test_run_engine_stop() -> PixResult<()> {\n\n let mut eng = create_engine()?;\n\n // Aborting quit from on_stop should resume game loop\n\n let mut app = App::new();\n\n app.quit_on_update = true;\n\n app.abort_quit_on_stop = true;\n\n eng.run(&mut app)?;\n\n assert_eq!(app.start_count, 1, \"on_start was called\");\n\n // Accounts for the initial run, plus 1 more for on_stop being cancelled\n\n assert_eq!(app.update_count, 2, \"on_update was called\");\n\n assert_eq!(app.stop_count, 2, \"on_stop was called\");\n\n Ok(())\n\n}\n","file_path":"tests/pix-engine.rs","rank":28,"score":49407.318880080675},{"content":"/// Default floating-point number trait used math operations.\n\npub trait Float: Num + FloatTrait {}\n\n\n\nimpl<T> Num for T where\n\n T: NumTrait + NumOps + NumRef + NumAssignOps + NumAssignRef + Copy + Default + PartialOrd\n\n{\n\n}\n\n\n\nimpl<T> Float for T where T: Num + FloatTrait {}\n\n\n\nconst PERLIN_YWRAPB: usize = 4;\n\nconst PERLIN_YWRAP: usize = 1 << PERLIN_YWRAPB;\n\nconst PERLIN_ZWRAPB: usize = 8;\n\nconst PERLIN_ZWRAP: usize = 1 << PERLIN_ZWRAPB;\n\nconst PERLIN_SIZE: usize = 4095;\n\n\n\nlazy_static! {\n\n static ref PERLIN: Vec<Scalar> = {\n\n let mut perlin = Vec::with_capacity(PERLIN_SIZE + 1);\n\n for _ in 0..=PERLIN_SIZE {\n\n perlin.push(random(1.0));\n\n }\n\n perlin\n\n };\n\n}\n\n\n","file_path":"src/math.rs","rank":29,"score":47853.225567426736},{"content":"fn create_engine() -> PixResult<PixEngine> {\n\n PixEngine::builder()\n\n .with_title(\"pix-engine integration test\")\n\n .position_centered()\n\n .hidden()\n\n .build()\n\n}\n\n\n","file_path":"tests/pix-engine.rs","rank":30,"score":46851.71041131443},{"content":"/// Trait for shape containing operations.\n\npub trait Contains<T, const N: usize> {\n\n /// The shape type. e.g. [`Rect<T>`].\n\n type Shape;\n\n\n\n /// Returns whether this shape contains a given [Point].\n\n fn contains_point<P>(&self, _p: P) -> bool\n\n where\n\n P: Into<Point<T, N>>;\n\n\n\n /// Returns whether this shape completely contains another shape of the same type.\n\n fn contains_shape<O>(&self, _other: O) -> bool\n\n where\n\n O: Into<Self::Shape>;\n\n}\n\n\n","file_path":"src/shape.rs","rank":31,"score":44028.04094303763},{"content":"/// Trait for shape intersection operations.\n\npub trait Intersects<T, const N: usize> {\n\n /// The shape type. e.g. [`Rect<T>`].\n\n type Shape;\n\n\n\n /// Returns the closest intersection point with a given line and distance along the line or\n\n /// `None` if there is no intersection.\n\n fn intersects_line<L>(&self, _line: L) -> Option<(Point<T, N>, T)>\n\n where\n\n L: Into<Line<T, N>>;\n\n\n\n /// Returns whether this shape intersects with another shape of the same type.\n\n fn intersects_shape<O>(&self, _other: O) -> bool\n\n where\n\n O: Into<Self::Shape>;\n\n}\n\n\n\nimpl PixState {\n\n /// Draw a [Point] to the current canvas. [`PixState::stroke`] controls whether the point is\n\n /// drawn or not. [`PixState::stroke_weight`] and [`PixState::fill`] have no effect.\n\n ///\n","file_path":"src/shape.rs","rank":32,"score":44028.04094303763},{"content":"fn get_xy(idx: usize) -> (usize, usize) {\n\n (idx % N, idx / N)\n\n}\n\n\n","file_path":"examples/fluid_simulation.rs","rank":33,"score":43641.54196472386},{"content":"fn set_bounds(b: usize, xs: &mut [Scalar]) {\n\n for i in 1..NLEN {\n\n let (_, y) = get_xy(i);\n\n if y > NHEIGHT {\n\n break;\n\n }\n\n // Top and bottom\n\n if b == 2 {\n\n xs[get_idx(i, 0)] = -xs[get_idx(i, 1)];\n\n xs[get_idx(i, N - 1)] = -xs[get_idx(i, N - 2)];\n\n } else {\n\n xs[get_idx(i, 0)] = xs[get_idx(i, 1)];\n\n xs[get_idx(i, N - 1)] = xs[get_idx(i, N - 2)];\n\n }\n\n // left and right\n\n if b == 1 {\n\n xs[get_idx(0, i)] = -xs[get_idx(1, i)];\n\n xs[get_idx(N - 1, i)] = -xs[get_idx(N - 2, i)];\n\n } else {\n\n xs[get_idx(0, i)] = xs[get_idx(1, i)];\n","file_path":"examples/fluid_simulation.rs","rank":34,"score":42567.59719796151},{"content":"/// Default number trait used for objects and shapes.\n\npub trait Num: NumTrait + NumOps + NumAssignOps + Copy + Default + PartialOrd {}\n\n\n","file_path":"src/math.rs","rank":35,"score":35335.84901408081},{"content":"fn advect(b: usize, d: &mut [Scalar], d0: &[Scalar], velx: &[Scalar], vely: &[Scalar]) {\n\n d.par_iter_mut().enumerate().for_each(|(i, d)| {\n\n let (x, y) = get_xy(i);\n\n if (1..NLEN).contains(&x) && (1..NHEIGHT).contains(&y) {\n\n let mut x = x as Scalar - (DT * N_SCALAR * velx[i]);\n\n let mut y = y as Scalar - (DT * N_SCALAR * vely[i]);\n\n\n\n if x < 0.5 {\n\n x = 0.5;\n\n }\n\n if x > N_SCALAR + 0.5 {\n\n x = N_SCALAR + 0.5;\n\n }\n\n let i0 = x.floor() as usize;\n\n let i1 = i0 + 1;\n\n if y < 0.5 {\n\n y = 0.5;\n\n }\n\n if y > N_SCALAR + 0.5 {\n\n y = N_SCALAR + 0.5;\n","file_path":"examples/fluid_simulation.rs","rank":36,"score":34969.85924652954},{"content":"fn intersect_ray_sphere(origin: PointF3, direction: VectorF3, obj: &SphereObj) -> (Scalar, Scalar) {\n\n let r = obj.sphere.radius();\n\n let center_origin = origin - obj.sphere.center();\n\n\n\n let a = direction.mag_sq();\n\n let b = 2.0 * center_origin.dot(direction);\n\n let c = center_origin.mag_sq() - (r * r);\n\n\n\n let discriminant = b * b - 4.0 * a * c;\n\n if discriminant < 0.0 {\n\n return (Scalar::INFINITY, Scalar::INFINITY);\n\n }\n\n\n\n let sqrt = discriminant.sqrt();\n\n let two_a = 2.0 * a;\n\n let t1 = (-b + sqrt) / two_a;\n\n let t2 = (-b - sqrt) / two_a;\n\n (t1, t2)\n\n}\n\n\n","file_path":"examples/3d_raytracing.rs","rank":37,"score":33764.97308820041},{"content":"fn diffuse(b: usize, xs: &mut [Scalar], xs0: &[Scalar], amt: Scalar, tmp: &mut [Scalar]) {\n\n let a = DT * amt * (N - 2).pow(2) as Scalar;\n\n linear_solve(b, xs, xs0, a, 1.0 + 6.0 * a, tmp);\n\n}\n\n\n","file_path":"examples/fluid_simulation.rs","rank":38,"score":32930.086215144256},{"content":" /// Constructs an `Ellipse` at position `(x, y)` with `width` and `height`.\n\n pub const fn new(x: T, y: T, width: T, height: T) -> Self {\n\n Self([x, y, width, height])\n\n }\n\n}\n\n\n\nimpl<T: Copy> Ellipse<T> {\n\n /// Returns `Ellipse` values as `[x, y, width, height]`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let e = ellipse!(5, 10, 100, 100);\n\n /// assert_eq!(e.as_array(), [5, 10, 100, 100]);\n\n /// ```\n\n #[inline]\n\n pub fn as_array(&self) -> [T; 4] {\n\n self.0\n\n }\n","file_path":"src/shape/ellipse.rs","rank":39,"score":29.755542409018652},{"content":" /// Returns the `Image` width.\n\n #[inline]\n\n #[must_use]\n\n pub const fn width(&self) -> u32 {\n\n self.width\n\n }\n\n\n\n /// Returns the `Image` height.\n\n #[inline]\n\n #[must_use]\n\n pub const fn height(&self) -> u32 {\n\n self.height\n\n }\n\n\n\n /// Returns the `Image` dimensions as `(width, height)`.\n\n #[inline]\n\n #[must_use]\n\n pub const fn dimensions(&self) -> (u32, u32) {\n\n (self.width, self.height)\n\n }\n","file_path":"src/image.rs","rank":40,"score":27.854177925728546},{"content":" pub fn size(&self) -> Point<T, 2> {\n\n point!(self.width(), self.height())\n\n }\n\n\n\n /// Reposition the the rectangle.\n\n #[inline]\n\n pub fn reposition(&self, x: T, y: T) -> Self {\n\n Self::new(x, y, self.width(), self.height())\n\n }\n\n\n\n /// Resize the the rectangle.\n\n #[inline]\n\n pub fn resize(&self, width: T, height: T) -> Self {\n\n Self::new(self.x(), self.y(), width, height)\n\n }\n\n\n\n /// Offsets a rectangle by shifting coordinates by given amount.\n\n #[inline]\n\n pub fn offset<P>(&self, offsets: P) -> Self\n\n where\n","file_path":"src/shape/rect.rs","rank":41,"score":27.383682542698626},{"content":" /// `Image` height.\n\n height: u32,\n\n /// Raw pixel data.\n\n data: Vec<u8>,\n\n /// Pixel Format.\n\n format: PixelFormat,\n\n}\n\n\n\nimpl Image {\n\n /// Constructs an empty RGBA `Image` with given `width` and `height`.\n\n #[inline]\n\n pub fn new(width: u32, height: u32) -> Self {\n\n Self::with_rgba(width, height)\n\n }\n\n\n\n /// Constructs an empty RGBA `Image` with given `width` and `height`.\n\n ///\n\n /// Alias for [Image::new].\n\n #[doc(alias = \"new\")]\n\n #[inline]\n","file_path":"src/image.rs","rank":42,"score":26.86593577627441},{"content":" /// s.text(\"Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam\")?;\n\n /// Ok(())\n\n /// }\n\n /// # }\n\n /// ```\n\n #[inline]\n\n pub fn wrap(&mut self, width: u32) {\n\n self.settings.wrap_width = Some(width);\n\n }\n\n\n\n /// Disable wrapping when drawing text on the canvas.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\n\n /// s.no_wrap();\n","file_path":"src/state/settings.rs","rank":43,"score":26.441566436445637},{"content":" /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let p: PointI2 = Point::origin();\n\n /// assert_eq!(p.as_array(), [0, 0]);\n\n /// ```\n\n #[inline]\n\n pub fn origin() -> Self\n\n where\n\n T: Default,\n\n {\n\n Self::new([(); N].map(|_| T::default()))\n\n }\n\n}\n\n\n\nimpl<T> Point<T, 1> {\n\n /// Constructs a `Point` from an individual x coordinate.\n\n #[inline]\n\n pub const fn from_x(x: T) -> Self {\n","file_path":"src/shape/point.rs","rank":44,"score":26.28108135399814},{"content":" #[inline]\n\n pub fn to_vec(self) -> Vec<T> {\n\n self.0.to_vec()\n\n }\n\n}\n\n\n\nimpl<T: Num, const N: usize> Point<T, N> {\n\n /// Offsets a `Point` by shifting coordinates by given amount.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let mut p = point!(2, 3, 1);\n\n /// p.offset([2, -4]);\n\n /// assert_eq!(p.as_array(), [4, -1, 1]);\n\n /// ```\n\n #[inline]\n\n pub fn offset<P, const M: usize>(&mut self, offsets: P)\n\n where\n","file_path":"src/shape/point.rs","rank":45,"score":26.140172107287448},{"content":"\n\n /// Constructs a `Color` from a [u32] RGB hexadecimal value with max alpha.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::from_hex(0xF0FF00);\n\n /// assert_eq!(c.channels(), [240, 255, 0, 255]);\n\n /// ```\n\n #[inline]\n\n pub const fn from_hex(hex: u32) -> Self {\n\n let [_, r, g, b] = hex.to_be_bytes();\n\n Self::rgba(r, g, b, 255)\n\n }\n\n\n\n /// Constructs a `Color` from a [u32] RGBA hexadecimal value.\n\n ///\n\n /// # Examples\n\n ///\n","file_path":"src/color/conversion.rs","rank":46,"score":25.26460868702739},{"content":" fn from(format: PixelFormat) -> Self {\n\n match format {\n\n PixelFormat::Rgb => Self::Rgb,\n\n PixelFormat::Rgba => Self::Rgba,\n\n }\n\n }\n\n}\n\n\n\nimpl Default for PixelFormat {\n\n fn default() -> Self {\n\n Self::Rgba\n\n }\n\n}\n\n\n\n/// An `Image` representing a buffer of pixel color values.\n\n#[derive(Default, Clone)]\n\n#[must_use]\n\npub struct Image {\n\n /// `Image` width.\n\n width: u32,\n","file_path":"src/image.rs","rank":47,"score":25.21767357953996},{"content":" /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::from_hex_alpha(0xF0FF00FF);\n\n /// assert_eq!(c.channels(), [240, 255, 0, 255]);\n\n ///\n\n /// let c = Color::from_hex_alpha(0xF0FF0080);\n\n /// assert_eq!(c.channels(), [240, 255, 0, 128]);\n\n /// ```\n\n #[inline]\n\n pub const fn from_hex_alpha(hex: u32) -> Self {\n\n let [r, g, b, a] = hex.to_be_bytes();\n\n Self::rgba(r, g, b, a)\n\n }\n\n\n\n /// Constructs a `Color` by inverting the RGBA values.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n","file_path":"src/color/conversion.rs","rank":48,"score":25.133324834671566},{"content":"\n\n /// Set window dimensions.\n\n #[inline]\n\n pub fn with_dimensions(&mut self, width: u32, height: u32) -> &mut Self {\n\n self.settings.width = width;\n\n self.settings.height = height;\n\n self\n\n }\n\n\n\n /// Set a window title.\n\n #[inline]\n\n pub fn with_title<S: Into<String>>(&mut self, title: S) -> &mut Self {\n\n self.settings.title = title.into();\n\n self\n\n }\n\n\n\n /// Position the window at the given `(x, y)` coordinates of the display.\n\n #[inline]\n\n pub fn position(&mut self, x: i32, y: i32) -> &mut Self {\n\n self.settings.x = Position::Positioned(x);\n","file_path":"src/window.rs","rank":49,"score":25.099380370159867},{"content":"//! Common [`PixEngine`] trait implementations for types.\n\n\n\nuse crate::prelude::*;\n\nuse num_traits::AsPrimitive;\n\nuse std::{\n\n array::IntoIter,\n\n iter::{FromIterator, Product, Sum},\n\n ops::{\n\n Add, AddAssign, Deref, DerefMut, Div, DivAssign, Index, IndexMut, Mul, MulAssign, Neg, Sub,\n\n SubAssign,\n\n },\n\n};\n\n\n\n#[inline]\n\npub(crate) fn clamp_size(val: u32) -> i32 {\n\n val.clamp(0, i32::MAX as u32 / 2) as i32\n\n}\n\n\n\n#[inline]\n\npub(crate) fn clamp_dimensions(width: u32, height: u32) -> (i32, i32) {\n","file_path":"src/ops.rs","rank":50,"score":24.77269503502818},{"content":"use pix_engine::prelude::*;\n\n\n\nuse crate::cell::{Cell, Direction};\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Maze {\n\n cols: u32,\n\n rows: u32,\n\n cells: Vec<Cell>,\n\n}\n\n\n\nimpl Maze {\n\n pub fn new(cols: u32, rows: u32) -> Self {\n\n let mut cells = Vec::with_capacity((cols * rows) as usize);\n\n for row in 0..rows {\n\n // Ensure cols are added contiguously before rows\n\n for col in 0..cols {\n\n cells.push(Cell::new(cells.len(), col, row));\n\n }\n\n }\n","file_path":"examples/maze/maze.rs","rank":51,"score":24.26570651446075},{"content":" }\n\n\n\n /// Constructs a square `Rect` centered at position `(x, y)` with `size`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let s = Rect::square_from_center([50, 50], 100);\n\n /// assert_eq!(s.as_array(), [0, 0, 100, 100]);\n\n /// ```\n\n pub fn square_from_center<P: Into<Point<T, 2>>>(p: P, size: T) -> Self {\n\n let p = p.into();\n\n let two = T::one() + T::one();\n\n let offset = size / two;\n\n Self::new(p.x() - offset, p.y() - offset, size, size)\n\n }\n\n\n\n /// Returns the `size` of the rectangle as a `Point`.\n\n #[inline]\n","file_path":"src/shape/rect.rs","rank":52,"score":23.97030179210949},{"content":" self.0.to_vec()\n\n }\n\n}\n\n\n\nimpl<T: Num, const N: usize> Vector<T, N> {\n\n /// Constructs a `Vector` by shifting coordinates by given amount.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let mut v = vector!(2.0, 3.0, 1.5);\n\n /// v.offset([2.0, -4.0]);\n\n /// assert_eq!(v.as_array(), [4.0, -1.0, 1.5]);\n\n /// ```\n\n #[inline]\n\n pub fn offset<V, const M: usize>(&mut self, offsets: V)\n\n where\n\n V: Into<Vector<T, M>>,\n\n {\n","file_path":"src/vector.rs","rank":53,"score":23.80978987551906},{"content":"use super::Renderer;\n\nuse crate::{prelude::*, renderer::TextureRenderer};\n\n\n\nimpl TextureRenderer for Renderer {\n\n /// Create a `Texture` to draw to.\n\n ///\n\n /// # Errors\n\n ///\n\n /// If the current window target is closed or invalid, or the texture dimensions are invalid,\n\n /// then an error is returned.\n\n #[inline]\n\n fn create_texture(\n\n &mut self,\n\n width: u32,\n\n height: u32,\n\n format: Option<PixelFormat>,\n\n ) -> PixResult<TextureId> {\n\n todo!()\n\n }\n\n\n","file_path":"src/renderer/wasm/texture.rs","rank":54,"score":23.70976703330418},{"content":"\n\n /// Constructs a random `Color` with `red`, `green`, `blue` and alpha.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::random_alpha();\n\n /// // `c.channels()` will return something like:\n\n /// // [132, 159, 233, 76]\n\n /// ```\n\n #[inline]\n\n pub fn random_alpha() -> Self {\n\n Self::rgba(random!(255), random!(255), random!(255), random!(255))\n\n }\n\n\n\n /// Returns the [u32] RGB hexadecimal value of a `Color`.\n\n ///\n\n /// # Examples\n\n ///\n","file_path":"src/color.rs","rank":55,"score":23.61039260202438},{"content":" /// Returns the `height` of the rectangle.\n\n #[inline]\n\n pub fn height(&self) -> T {\n\n self.0[3]\n\n }\n\n\n\n /// Sets the `height` of the rectangle.\n\n #[inline]\n\n pub fn set_height(&mut self, height: T) {\n\n self.0[3] = height;\n\n }\n\n}\n\n\n\nimpl<T: Num> Rect<T> {\n\n /// Constructs a `Rect` at position [Point] with `width` and `height`.\n\n pub fn with_position<P: Into<Point<T, 2>>>(p: P, width: T, height: T) -> Self {\n\n let p = p.into();\n\n Self::new(p.x(), p.y(), width, height)\n\n }\n\n\n","file_path":"src/shape/rect.rs","rank":56,"score":23.37677375268103},{"content":" pub fn with_rgba(width: u32, height: u32) -> Self {\n\n let format = PixelFormat::Rgba;\n\n let data = vec![0x00; format.channels() * (width * height) as usize];\n\n Self::from_vec(width, height, data, format)\n\n }\n\n\n\n /// Constructs an empty RGB `Image` with given `width` and `height`.\n\n #[inline]\n\n pub fn with_rgb(width: u32, height: u32) -> Self {\n\n let format = PixelFormat::Rgb;\n\n let data = vec![0x00; format.channels() * (width * height) as usize];\n\n Self::from_vec(width, height, data, format)\n\n }\n\n\n\n /// Constructs an `Image` from a [u8] [prim@slice] representing RGB/A values.\n\n ///\n\n /// # Errors\n\n ///\n\n /// If the bytes length doesn't match the image dimensions and [`PixelFormat`] provided, then\n\n /// an error is returned.\n","file_path":"src/image.rs","rank":57,"score":22.93697242850473},{"content":" /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::rgb(240, 255, 0);\n\n /// assert_eq!(c.as_hex(), 0xF0FF00);\n\n /// ```\n\n #[inline]\n\n #[must_use]\n\n pub const fn as_hex(&self) -> u32 {\n\n let [r, g, b, _] = self.channels();\n\n u32::from_be_bytes([0, r, g, b])\n\n }\n\n\n\n /// Returns the [u32] RGBA hexadecimal value of a `Color`.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::rgb(240, 255, 0);\n\n /// assert_eq!(c.as_hex_alpha(), 0xF0FF00FF);\n","file_path":"src/color.rs","rank":58,"score":22.7459979645857},{"content":" $crate::prelude::Sphere::new($x, $y, $z, $r)\n\n };\n\n}\n\n\n\nimpl<T> Sphere<T> {\n\n /// Constructs a `Sphere` at position `(x, y, z)` with `radius`.\n\n pub const fn new(x: T, y: T, z: T, radius: T) -> Self {\n\n Self([x, y, z, radius])\n\n }\n\n}\n\n\n\nimpl<T: Copy> Sphere<T> {\n\n /// Returns `Sphere` as `[x, y, z, radius]`.\n\n #[inline]\n\n pub fn as_array(&self) -> [T; 4] {\n\n self.0\n\n }\n\n\n\n /// Returns `Sphere` as a byte slice `&[x, y, z, radius]`.\n\n #[inline]\n","file_path":"src/shape/sphere.rs","rank":59,"score":22.65826562426095},{"content":" ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let r = rect!(5, 10, 100, 100);\n\n /// assert_eq!(r.as_array(), [5, 10, 100, 100]);\n\n /// ```\n\n #[inline]\n\n pub fn as_array(&self) -> [T; 4] {\n\n self.0\n\n }\n\n\n\n /// Returns `Rect` as a byte slice `&[x, y, width, height]`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let r = rect!(5, 10, 100, 100);\n","file_path":"src/shape/rect.rs","rank":60,"score":22.493361735383058},{"content":"\n\n /// Sets the width used to draw lines on the canvas.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\n\n /// s.stroke(Color::BLUE);\n\n /// s.stroke_weight(2);\n\n /// // Shows a 2-pixel wide diagonal line\n\n /// s.line(line_![0, 0, 100, 100])?;\n\n /// Ok(())\n\n /// }\n\n /// # }\n\n /// ```\n\n #[inline]\n\n pub fn stroke_weight(&mut self, weight: u8) {\n","file_path":"src/state/settings.rs","rank":61,"score":22.474776450088935},{"content":" /// Returns the current UI rendering position.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\n\n /// let mut pos = s.cursor_pos();\n\n /// pos.offset_y(20);\n\n /// s.set_cursor_pos(pos);\n\n /// s.text(\"Some text, offset down by 20 pixels\")?;\n\n /// Ok(())\n\n /// }\n\n /// # }\n\n /// ```\n\n #[inline]\n\n pub const fn cursor_pos(&self) -> PointI2 {\n\n self.ui.cursor()\n","file_path":"src/gui/state.rs","rank":62,"score":22.186397837655754},{"content":" ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::new(0, 0, 128);\n\n /// assert_eq!(c.channels(), [0, 0, 128, 255]);\n\n /// ```\n\n #[inline]\n\n pub const fn new(r: u8, g: u8, b: u8) -> Self {\n\n Self::rgb(r, g, b)\n\n }\n\n\n\n /// Constructs a `Color` with `red`, `green`, `blue` and `alpha`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::new_alpha(0, 0, 128, 50);\n\n /// assert_eq!(c.channels(), [0, 0, 128, 50]);\n\n /// ```\n","file_path":"src/color.rs","rank":63,"score":22.119097504792887},{"content":"use crate::{\n\n cell::{Cell, Direction},\n\n maze::Maze,\n\n};\n\nuse pix_engine::prelude::*;\n\nuse rand::prelude::IteratorRandom;\n\nuse std::collections::HashSet;\n\n\n\n#[derive(Debug, Clone)]\n\npub struct MazeCreator {\n\n current: Option<Cell>,\n\n visited: HashSet<usize>,\n\n stack: Vec<Cell>,\n\n completed: bool,\n\n}\n\n\n\nimpl MazeCreator {\n\n pub fn new(maze: &Maze) -> Self {\n\n let current = maze.random_cell();\n\n Self {\n","file_path":"examples/maze/maze_creator.rs","rank":64,"score":22.08406413206327},{"content":" #[inline]\n\n pub fn from_bytes<B: AsRef<[u8]>>(\n\n width: u32,\n\n height: u32,\n\n bytes: B,\n\n format: PixelFormat,\n\n ) -> PixResult<Self> {\n\n let bytes = bytes.as_ref();\n\n if bytes.len() != (format.channels() * width as usize * height as usize) {\n\n return Err(PixError::InvalidImage {\n\n width,\n\n height,\n\n size: bytes.len(),\n\n format,\n\n }\n\n .into());\n\n }\n\n Ok(Self::from_vec(width, height, bytes.to_vec(), format))\n\n }\n\n\n","file_path":"src/image.rs","rank":65,"score":21.830729345458092},{"content":"\n\n /// Offsets the `y-coordinate` of the ellipse by a given amount.\n\n #[inline]\n\n pub fn offset_y(&mut self, offset: T) {\n\n self.0[1] += offset;\n\n }\n\n\n\n /// Offsets the `width` of the ellipse by a given amount.\n\n #[inline]\n\n pub fn offset_width(&mut self, offset: T) {\n\n self.0[2] += offset;\n\n }\n\n\n\n /// Offsets the `height` of the ellipse by a given amount.\n\n #[inline]\n\n pub fn offset_height(&mut self, offset: T) {\n\n self.0[3] += offset;\n\n }\n\n\n\n /// Offsets the `radius` of the circle by a given amount.\n","file_path":"src/shape/ellipse.rs","rank":66,"score":21.750147279082434},{"content":" /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::hsl(126.0, 80.0, 50.0);\n\n /// assert_eq!(c.channels(), [25, 230, 46, 255]);\n\n /// ```\n\n #[inline]\n\n pub fn hsl<T: Into<Scalar>>(h: T, s: T, l: T) -> Self {\n\n Self::with_mode(Hsl, h, s, l)\n\n }\n\n\n\n /// Constructs a `Color` with `hue`, `saturation`, `lightness` and `alpha`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::hsla(126.0, 80.0, 50.0, 0.5);\n\n /// assert_eq!(c.channels(), [25, 230, 46, 128]);\n","file_path":"src/color.rs","rank":67,"score":21.734077610537426},{"content":" #[inline]\n\n #[must_use]\n\n pub const fn arrow() -> Self {\n\n Self::System(SystemCursor::Arrow)\n\n }\n\n\n\n /// Constructs a `Cursor` with `SystemCursor::IBeam`.\n\n #[inline]\n\n #[must_use]\n\n pub const fn ibeam() -> Self {\n\n Self::System(SystemCursor::IBeam)\n\n }\n\n\n\n /// Constructs a `Cursor` with `SystemCursor::No`.\n\n #[inline]\n\n #[must_use]\n\n pub const fn no() -> Self {\n\n Self::System(SystemCursor::No)\n\n }\n\n\n","file_path":"src/window.rs","rank":68,"score":21.662565250261558},{"content":"use crate::{\n\n prelude::*,\n\n renderer::{RendererSettings, Rendering},\n\n shape::{LineI2, QuadI2, TriI2},\n\n};\n\n\n\nmod audio;\n\nmod texture;\n\nmod window;\n\n\n\n/// A Web-Assembly [Renderer] implementation.\n\npub(crate) struct Renderer {}\n\n\n\nimpl Rendering for Renderer {\n\n /// Creates a new Renderer instance.\n\n #[inline]\n\n fn new(settings: RendererSettings) -> PixResult<Self> {\n\n todo!()\n\n }\n\n\n","file_path":"src/renderer/wasm.rs","rank":69,"score":21.38739602340953},{"content":" /// ```\n\n #[doc(alias = \"new_alpha\")]\n\n #[inline]\n\n pub const fn rgba(r: u8, g: u8, b: u8, a: u8) -> Self {\n\n Self {\n\n mode: Rgb,\n\n channels: [r, g, b, a],\n\n }\n\n }\n\n\n\n /// Constructs a `Color` with `hue`, `saturation`, `brightness` and max `alpha`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::hsb(126.0, 80.0, 50.0);\n\n /// assert_eq!(c.channels(), [25, 128, 36, 255]);\n\n /// ```\n\n #[inline]\n","file_path":"src/color.rs","rank":70,"score":21.35440669740186},{"content":" /// Returns the `Image` bounding [Rect] positioned at `offset`.\n\n #[inline]\n\n pub fn bounding_rect_offset<P>(&self, offset: P) -> Rect<i32>\n\n where\n\n P: Into<PointI2>,\n\n {\n\n let (width, height) = clamp_dimensions(self.width, self.height);\n\n rect![offset.into(), width, height]\n\n }\n\n\n\n /// Returns the center position as [Point].\n\n #[inline]\n\n pub fn center(&self) -> PointI2 {\n\n let (width, height) = clamp_dimensions(self.width, self.height);\n\n point!(width / 2, height / 2)\n\n }\n\n\n\n /// Returns the `Image` pixel data as an iterator of [u8].\n\n #[inline]\n\n pub fn bytes(&self) -> Bytes<'_> {\n","file_path":"src/image.rs","rank":71,"score":21.27900312760921},{"content":" /// return Ok(true);\n\n /// }\n\n /// Ok(false)\n\n /// }\n\n /// # }\n\n /// ```\n\n #[inline]\n\n #[must_use]\n\n pub fn running(&mut self) -> bool {\n\n self.settings.running\n\n }\n\n\n\n /// Unpause the render loop.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n","file_path":"src/state/settings.rs","rank":72,"score":21.237664238201823},{"content":" #[inline]\n\n pub fn offset_radius(&mut self, offset: T) {\n\n self.0[2] += offset;\n\n self.0[3] += offset;\n\n }\n\n\n\n /// Returns the `size` of the ellipse as a `Point`.\n\n #[inline]\n\n pub fn size(&self) -> Point<T, 2> {\n\n point!(self.width(), self.height())\n\n }\n\n\n\n /// Returns the bounding [Rect] of the ellipse.\n\n #[inline]\n\n pub fn bounding_rect(&self) -> Rect<T> {\n\n rect![self.left(), self.top(), self.width(), self.height()]\n\n }\n\n\n\n /// Returns `Ellipse` as a [Vec].\n\n ///\n","file_path":"src/shape/ellipse.rs","rank":73,"score":21.219064384783543},{"content":"use pix_engine::prelude::*;\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\n\npub enum Direction {\n\n North = 0,\n\n East,\n\n South,\n\n West,\n\n}\n\nuse Direction::*;\n\n\n\nuse crate::SIZE;\n\n\n\nimpl Direction {\n\n pub fn opposite(self) -> Self {\n\n match self {\n\n North => South,\n\n East => West,\n\n South => North,\n\n West => East,\n","file_path":"examples/maze/cell.rs","rank":74,"score":21.21241013686147},{"content":"use super::Renderer;\n\nuse crate::{prelude::*, renderer::TextureRenderer};\n\nuse anyhow::Context;\n\nuse sdl2::{\n\n rect::Rect as SdlRect,\n\n render::{Canvas, Texture as SdlTexture},\n\n};\n\nuse std::{\n\n cell::RefCell,\n\n ops::{Deref, DerefMut},\n\n};\n\n\n\npub(crate) struct RendererTexture {\n\n inner: Option<SdlTexture>,\n\n}\n\n\n\nimpl RendererTexture {\n\n pub(crate) const fn new(texture: SdlTexture) -> Self {\n\n Self {\n\n inner: Some(texture),\n","file_path":"src/renderer/sdl/texture.rs","rank":75,"score":21.076703398016882},{"content":" }\n\n .into());\n\n }\n\n let bytes: Vec<u8> = match format {\n\n PixelFormat::Rgb => pixels\n\n .iter()\n\n .flat_map(|p| [p.red(), p.green(), p.blue()])\n\n .collect(),\n\n PixelFormat::Rgba => pixels.iter().flat_map(Color::channels).collect(),\n\n };\n\n Ok(Self::from_vec(width, height, bytes, format))\n\n }\n\n\n\n /// Constructs an `Image` from a [`Vec<u8>`] representing RGB/A values.\n\n #[inline]\n\n pub fn from_vec(width: u32, height: u32, data: Vec<u8>, format: PixelFormat) -> Self {\n\n Self {\n\n width,\n\n height,\n\n data,\n","file_path":"src/image.rs","rank":76,"score":21.045099125319386},{"content":" /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let p = point!(1.0, 2.0);\n\n /// let v = Vector::from_point(p);\n\n /// assert_eq!(v.as_array(), [1.0, 2.0]);\n\n /// ```\n\n #[inline]\n\n pub fn from_point(p: Point<T, N>) -> Self {\n\n Self::new(p.as_array())\n\n }\n\n\n\n /// Returns the `x-coordinate`.\n\n ///\n\n /// # Panics\n\n ///\n\n /// If `Vector` has zero dimensions.\n\n ///\n\n /// # Example\n","file_path":"src/vector.rs","rank":77,"score":21.044044244237195},{"content":" /// assert_eq!(r.as_bytes(), &[5, 10, 100, 100]);\n\n /// ```\n\n #[inline]\n\n pub fn as_bytes(&self) -> &[T; 4] {\n\n &self.0\n\n }\n\n\n\n /// Returns `Rect` as a mutable byte slice `&mut [x, y, width, height]`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let mut r = rect!(5, 10, 100, 100);\n\n /// for p in r.as_bytes_mut() {\n\n /// *p += 5;\n\n /// }\n\n /// assert_eq!(r.as_bytes(), &[10, 15, 105, 105]);\n\n /// ```\n\n #[inline]\n","file_path":"src/shape/rect.rs","rank":78,"score":21.034582493613303},{"content":"\n\n /// Returns `Ellipse` values as a byte slice `&[x, y, width, height]`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let e = ellipse!(5, 10, 100, 100);\n\n /// assert_eq!(e.as_bytes(), &[5, 10, 100, 100]);\n\n /// ```\n\n #[inline]\n\n pub fn as_bytes(&self) -> &[T; 4] {\n\n &self.0\n\n }\n\n\n\n /// Returns `Ellipse` values as a mutable byte slice `&[x, y, width, height]`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n","file_path":"src/shape/ellipse.rs","rank":79,"score":20.895843647274468},{"content":" Self([x])\n\n }\n\n}\n\n\n\nimpl<T> Point<T, 2> {\n\n /// Constructs a `Point` from individual x/y coordinates.\n\n #[inline]\n\n pub const fn from_xy(x: T, y: T) -> Self {\n\n Self([x, y])\n\n }\n\n}\n\n\n\nimpl<T> Point<T, 3> {\n\n /// Constructs a `Point` from individual x/y/z coordinates.\n\n #[inline]\n\n pub const fn from_xyz(x: T, y: T, z: T) -> Self {\n\n Self([x, y, z])\n\n }\n\n}\n\n\n","file_path":"src/shape/point.rs","rank":81,"score":20.747532032690163},{"content":" ///\n\n /// let c = Color::rgba(240, 255, 0, 128);\n\n /// assert_eq!(c.as_hex_alpha(), 0xF0FF0080);\n\n /// ```\n\n #[inline]\n\n #[must_use]\n\n pub const fn as_hex_alpha(&self) -> u32 {\n\n u32::from_be_bytes(self.channels())\n\n }\n\n\n\n /// Returns a list of max values for each color channel based on [Mode].\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::rgb(0, 0, 0);\n\n /// assert_eq!(c.maxes(), [255.0, 255.0, 255.0, 255.0]);\n\n ///\n\n /// let c = Color::hsb(0.0, 0.0, 0.0);\n","file_path":"src/color.rs","rank":82,"score":20.735490247055555},{"content":" Self {\n\n mode,\n\n channels: calculate_channels(levels),\n\n }\n\n }\n\n\n\n /// Constructs a random `Color` with `red`, `green`, `blue` and max alpha.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::random();\n\n /// // `c.channels()` will return something like:\n\n /// // [207, 12, 217, 255]\n\n /// ```\n\n #[inline]\n\n pub fn random() -> Self {\n\n Self::rgb(random!(255), random!(255), random!(255))\n\n }\n","file_path":"src/color.rs","rank":83,"score":20.655279809695553},{"content":" /// If the window has been closed or is invalid, then an error is returned.\n\n #[inline]\n\n pub fn width(&self) -> PixResult<u32> {\n\n let (width, _) = self.dimensions()?;\n\n Ok(width)\n\n }\n\n\n\n /// The width of the current window.\n\n ///\n\n /// # Errors\n\n ///\n\n /// If the window has been closed or is invalid, then an error is returned.\n\n #[inline]\n\n pub fn window_width(&self) -> PixResult<u32> {\n\n let (width, _) = self.window_dimensions()?;\n\n Ok(width)\n\n }\n\n\n\n /// Set the width of the current window.\n\n ///\n","file_path":"src/window.rs","rank":84,"score":20.593698490264842},{"content":"\n\n /// Constructs an `Ellipse` centered at position `(x, y)` with `width` and `height`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let e = Ellipse::from_center([50, 50], 100, 100);\n\n /// assert_eq!(e.as_array(), [0, 0, 100, 100]);\n\n /// ```\n\n pub fn from_center<P: Into<Point<T, 2>>>(p: P, width: T, height: T) -> Self {\n\n let p = p.into();\n\n let two = T::one() + T::one();\n\n Self::new(p.x() - width / two, p.y() - height / two, width, height)\n\n }\n\n\n\n /// Constructs a circle `Ellipse` centered at position `(x, y)` with `radius`.\n\n ///\n\n /// # Example\n\n ///\n","file_path":"src/shape/ellipse.rs","rank":85,"score":20.54684952328476},{"content":" /// # Examples\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let p = Point::new([1]);\n\n /// assert_eq!(p.as_array(), [1]);\n\n ///\n\n /// let p = Point::new([1, 2]);\n\n /// assert_eq!(p.as_array(), [1, 2]);\n\n ///\n\n /// let p = Point::new([1, -2, 1]);\n\n /// assert_eq!(p.as_array(), [1, -2, 1]);\n\n /// ```\n\n #[inline]\n\n pub const fn new(coords: [T; N]) -> Self {\n\n Self(coords)\n\n }\n\n\n\n /// Constructs a `Point` at the origin.\n\n ///\n","file_path":"src/shape/point.rs","rank":86,"score":20.435943893036786},{"content":" /// let v = Vector::new([2.1]);\n\n /// assert_eq!(v.as_array(), [2.1]);\n\n ///\n\n /// let v = Vector::new([2.1, 3.5]);\n\n /// assert_eq!(v.as_array(), [2.1, 3.5]);\n\n ///\n\n /// let v = Vector::new([2.1, 3.5, 1.0]);\n\n /// assert_eq!(v.as_array(), [2.1, 3.5, 1.0]);\n\n /// ```\n\n #[inline]\n\n pub const fn new(coords: [T; N]) -> Self {\n\n Self(coords)\n\n }\n\n\n\n /// Constructs a `Vector` at the origin.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n","file_path":"src/vector.rs","rank":87,"score":20.435943893036782},{"content":" pub fn hsb<T: Into<Scalar>>(h: T, s: T, b: T) -> Self {\n\n Self::with_mode(Hsb, h, s, b)\n\n }\n\n\n\n /// Constructs a `Color` with `hue`, `saturation`, `brightness` and `alpha`.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::hsba(126.0, 80.0, 50.0, 0.5);\n\n /// assert_eq!(c.channels(), [25, 128, 36, 128]);\n\n /// ```\n\n #[inline]\n\n pub fn hsba<T: Into<Scalar>>(h: T, s: T, b: T, a: T) -> Self {\n\n Self::with_mode_alpha(Hsb, h, s, b, a)\n\n }\n\n\n\n /// Constructs a `Color` with `hue`, `saturation`, `lightness` and max `alpha`.\n\n ///\n","file_path":"src/color.rs","rank":88,"score":20.323609059500974},{"content":" /// ```\n\n #[doc(alias = \"new\")]\n\n #[inline]\n\n pub const fn rgb(r: u8, g: u8, b: u8) -> Self {\n\n Self {\n\n mode: Rgb,\n\n channels: [r, g, b, 255],\n\n }\n\n }\n\n\n\n /// Constructs a `Color` with `red`, `green`, `blue` and `alpha`.\n\n ///\n\n /// Alias for [Color::new_alpha].\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// let c = Color::rgba(128, 64, 128, 128);\n\n /// assert_eq!(c.channels(), [128, 64, 128, 128]);\n","file_path":"src/color.rs","rank":89,"score":20.28953012957487},{"content":"#[must_use]\n\n#[derive(Debug)]\n\npub struct WindowBuilder<'a> {\n\n state: &'a mut PixState,\n\n settings: RendererSettings,\n\n}\n\n\n\nimpl<'a> WindowBuilder<'a> {\n\n /// Creates a new `WindowBuilder` instance.\n\n #[inline]\n\n pub fn new(s: &'a mut PixState) -> Self {\n\n let vsync = s.renderer.vsync();\n\n Self {\n\n state: s,\n\n settings: RendererSettings {\n\n vsync,\n\n ..RendererSettings::default()\n\n },\n\n }\n\n }\n","file_path":"src/window.rs","rank":90,"score":20.26378901489666},{"content":"use pix_engine::prelude::*;\n\n\n\nconst WIDTH: u32 = 800;\n\nconst HEIGHT: u32 = 800;\n\n\n","file_path":"examples/textures.rs","rank":91,"score":20.254976705061942},{"content":"use anyhow::anyhow;\n\nuse pix_engine::prelude::*;\n\nuse std::{env, path::Path};\n\n\n\nconst WIDTH: u32 = 800;\n\nconst HEIGHT: u32 = 600;\n\n\n","file_path":"examples/image.rs","rank":92,"score":20.24222578567781},{"content":"impl Default for Theme {\n\n fn default() -> Self {\n\n Self::dark()\n\n }\n\n}\n\n\n\nimpl Theme {\n\n /// Constructs a default [Builder] which can build a `Theme` instance.\n\n ///\n\n /// See [Builder] for examples.\n\n #[inline]\n\n pub fn builder() -> Builder {\n\n Builder::default()\n\n }\n\n\n\n /// Constructs a default dark `Theme`.\n\n #[inline]\n\n pub fn dark() -> Self {\n\n Self {\n\n name: \"Dark\".into(),\n","file_path":"src/gui/theme.rs","rank":93,"score":20.200817094804798},{"content":" };\n\n}\n\n\n\nimpl<T> Rect<T> {\n\n /// Constructs a `Rect` at position `(x, y)` with `width` and `height`.\n\n pub const fn new(x: T, y: T, width: T, height: T) -> Self {\n\n Self([x, y, width, height])\n\n }\n\n\n\n /// Constructs a square `Rect` at position `(x, y)` with `size`.\n\n pub fn square(x: T, y: T, size: T) -> Self\n\n where\n\n T: Copy,\n\n {\n\n Self::new(x, y, size, size)\n\n }\n\n}\n\n\n\nimpl<T: Copy> Rect<T> {\n\n /// Returns `Rect` as `[x, y, width, height]`.\n","file_path":"src/shape/rect.rs","rank":94,"score":20.182690966227035},{"content":" /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\n\n /// if s.mouse_pressed() {\n\n /// s.background(Color::random());\n\n /// }\n\n /// Ok(())\n\n /// }\n\n /// # }\n\n /// ```\n\n #[inline]\n\n #[must_use]\n\n pub fn mouse_pressed(&self) -> bool {\n\n self.ui.mouse.is_pressed()\n\n }\n\n\n","file_path":"src/state.rs","rank":95,"score":20.167493082169713},{"content":" /// }\n\n /// Ok(())\n\n /// }\n\n /// # }\n\n /// ```\n\n #[inline]\n\n #[must_use]\n\n pub fn key_pressed(&self) -> bool {\n\n self.ui.keys.is_pressed()\n\n }\n\n\n\n /// Returns if a specific [Key] is currently being held.\n\n ///\n\n /// # Example\n\n ///\n\n /// ```\n\n /// # use pix_engine::prelude::*;\n\n /// # struct App;\n\n /// # impl AppState for App {\n\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\n","file_path":"src/state.rs","rank":96,"score":20.167493082169713},{"content":"impl<T> Vector<T, 2> {\n\n /// Constructs a `Vector` from individual x/y coordinates.\n\n #[inline]\n\n pub const fn from_xy(x: T, y: T) -> Self {\n\n Self([x, y])\n\n }\n\n}\n\n\n\nimpl<T> Vector<T, 3> {\n\n /// Constructs a `Vector` from individual x/y/z coordinates.\n\n #[inline]\n\n pub const fn from_xyz(x: T, y: T, z: T) -> Self {\n\n Self([x, y, z])\n\n }\n\n}\n\n\n\nimpl<T: Num + Float> Vector<T, 2> {\n\n /// Constructs a `Vector` from another `Vector`, rotated by an `angle`.\n\n ///\n\n /// # Example\n","file_path":"src/vector.rs","rank":97,"score":20.064016559529737},{"content":" }\n\n\n\n /// Set window dimensions.\n\n pub fn with_dimensions(&mut self, width: u32, height: u32) -> &mut Self {\n\n self.settings.width = width;\n\n self.settings.height = height;\n\n self\n\n }\n\n\n\n /// Scales the window.\n\n pub fn scale(&mut self, x: f32, y: f32) -> &mut Self {\n\n self.settings.scale_x = x;\n\n self.settings.scale_y = y;\n\n self\n\n }\n\n\n\n /// Set audio sample rate.\n\n pub fn audio_sample_rate(&mut self, sample_rate: i32) -> &mut Self {\n\n self.settings.audio_sample_rate = sample_rate;\n\n self\n","file_path":"src/engine.rs","rank":98,"score":19.992916105506414},{"content":"use pix_engine::{math::map, prelude::*};\n\n\n\nconst WIDTH: u32 = 800;\n\nconst HEIGHT: u32 = 600;\n\nconst SIZE: u32 = 4;\n\n\n","file_path":"examples/colors.rs","rank":99,"score":19.964084066232445}],"string":"[\n {\n \"content\": \"pub fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"Colors\\\")\\n\\n .with_frame_rate()\\n\\n .build()?;\\n\\n let mut app = Colors::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/colors.rs\",\n \"rank\": 0,\n \"score\": 101949.36434358904\n },\n {\n \"content\": \"pub fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"Flocking\\\")\\n\\n .with_frame_rate()\\n\\n .target_frame_rate(60)\\n\\n .build()?;\\n\\n let mut app = App::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/flocking.rs\",\n \"rank\": 1,\n \"score\": 101949.36434358904\n },\n {\n \"content\": \"pub fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"3D Raytracing\\\")\\n\\n .with_frame_rate()\\n\\n .build()?;\\n\\n let mut app = App::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/3d_raytracing.rs\",\n \"rank\": 2,\n \"score\": 101949.36434358904\n },\n {\n \"content\": \"pub fn main() -> PixResult<()> {\\n\\n let width = 800;\\n\\n let height = 600;\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(width, height)\\n\\n .with_title(\\\"Asteroids\\\")\\n\\n .with_frame_rate()\\n\\n .build()?;\\n\\n let mut app = Asteroids::new(width, height);\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/asteroids.rs\",\n \"rank\": 3,\n \"score\": 101949.36434358904\n },\n {\n \"content\": \"pub fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"Maze Generation & A* Search\\\")\\n\\n .with_frame_rate()\\n\\n .target_frame_rate(60)\\n\\n .build()?;\\n\\n let mut app = MazeApp::new(COLS, ROWS);\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/maze/main.rs\",\n \"rank\": 4,\n \"score\": 99110.35671496368\n },\n {\n \"content\": \"pub fn main() -> PixResult<()> {\\n\\n println!(\\\"Renders more smoothly using `--release` and `--features opengl`.\\\");\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .scale(2.0, 2.0)\\n\\n .with_title(\\\"Fluid Simulation\\\")\\n\\n .with_frame_rate()\\n\\n .target_frame_rate(30)\\n\\n .build()?;\\n\\n let mut app = App::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 5,\n \"score\": 99110.35671496368\n },\n {\n \"content\": \"/// Returns a random number between `0` and a given `value`.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use pix_engine::math::random;\\n\\n///\\n\\n/// let x = random(100); // x will range from (0..100]\\n\\n/// assert!(x >= 0 && x < 100);\\n\\n///\\n\\n/// let x = random(100.0); // x will range from (0.0..100.0]\\n\\n/// assert!(x >= 0.0 && x < 100.0);\\n\\npub fn random<T>(val: T) -> T\\n\\nwhere\\n\\n T: Num + SampleUniform + PartialOrd,\\n\\n{\\n\\n if val > T::zero() {\\n\\n random_rng(T::zero()..val)\\n\\n } else {\\n\\n random_rng(val..T::zero())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 6,\n \"score\": 87829.52035430325\n },\n {\n \"content\": \"/// Returns a random number within a range.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use pix_engine::math::random_rng;\\n\\n///\\n\\n/// let x = random_rng(0.0..1.0); // x will range from (0.0..1.0]\\n\\n/// assert!(x >= 0.0 && x < 1.0);\\n\\n///\\n\\n/// let x = random_rng(20..50); // x will range from (20..50]\\n\\n/// assert!(x >= 20 && x < 50);\\n\\npub fn random_rng<T, R>(val: R) -> T\\n\\nwhere\\n\\n T: SampleUniform + PartialOrd,\\n\\n R: Into<Range<T>>,\\n\\n{\\n\\n let val = val.into();\\n\\n rand::thread_rng().gen_range(val)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 7,\n \"score\": 81354.67380795366\n },\n {\n \"content\": \"/// Returns the [Perlin noise](https://en.wikipedia.org/wiki/Perlin_noise) value at specified coordinates.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use pix_engine::math::noise;\\n\\n///\\n\\n/// let n = noise([5.0]);\\n\\n/// assert!(n >= 0.0 && n < 1.0);\\n\\n///\\n\\n/// let n = noise([2.0, 1.5]);\\n\\n/// assert!(n >= 0.0 && n < 1.0);\\n\\n///\\n\\n/// let n = noise([2.0, 1.5, 3.0]);\\n\\n/// assert!(n >= 0.0 && n < 1.0);\\n\\n/// ```\\n\\npub fn noise<V, const N: usize>(vector: V) -> Scalar\\n\\nwhere\\n\\n V: Into<Vector<Scalar, N>>,\\n\\n{\\n\\n let v = vector.into();\\n\\n\\n\\n let values = v.as_array();\\n\\n let x = values.get(0).unwrap_or(&0.0).abs();\\n\\n let y = values.get(1).unwrap_or(&0.0).abs();\\n\\n let z = values.get(2).unwrap_or(&0.0).abs();\\n\\n\\n\\n let mut xi: usize = x.trunc() as usize;\\n\\n let mut yi: usize = y.trunc() as usize;\\n\\n let mut zi: usize = z.trunc() as usize;\\n\\n\\n\\n let mut xf = x.fract();\\n\\n let mut yf = y.fract();\\n\\n let mut zf = z.fract();\\n\\n let (mut rxf, mut ryf);\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 8,\n \"score\": 76605.41091577403\n },\n {\n \"content\": \"/// Linear interpolates between two values by a given amount.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use pix_engine::math::lerp;\\n\\n///\\n\\n/// let start = 0.0;\\n\\n/// let end = 5.0;\\n\\n/// let amount = 0.5;\\n\\n/// let value = lerp(start, end, amount);\\n\\n/// assert_eq!(value, 2.5);\\n\\n/// ```\\n\\npub fn lerp<T>(start: T, end: T, amount: T) -> T\\n\\nwhere\\n\\n T: Num + Copy + PartialOrd,\\n\\n{\\n\\n (T::one() - amount) * start + amount * end\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 9,\n \"score\": 73597.5461490758\n },\n {\n \"content\": \"/// Linear interpolates values for a range of independent values based on depdendent values.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use pix_engine::math::lerp_map;\\n\\n///\\n\\n/// let x1 = 0;\\n\\n/// let x2 = 5;\\n\\n/// let y1 = 0;\\n\\n/// let y2 = 10;\\n\\n/// let values = lerp_map(x1, x2, y1, y2);\\n\\n/// assert_eq!(values, vec![0, 2, 4, 6, 8, 10]);\\n\\n///\\n\\n/// let x1 = 0.0;\\n\\n/// let x2 = 4.0;\\n\\n/// let y1 = 0.0;\\n\\n/// let y2 = 14.0;\\n\\n/// let values = lerp_map(x1, x2, y1, y2);\\n\\n/// assert_eq!(values, vec![0.0, 3.5, 7.0, 10.5, 14.0]);\\n\\n/// ```\\n\\npub fn lerp_map<T>(start1: T, end1: T, start2: T, end2: T) -> Vec<T>\\n\\nwhere\\n\\n T: Num + NumCast + Copy + PartialOrd + AddAssign,\\n\\n{\\n\\n if start1 == end1 {\\n\\n vec![start2]\\n\\n } else {\\n\\n let size: usize = NumCast::from(end1 - start1).unwrap_or(4);\\n\\n let mut values = Vec::with_capacity(size);\\n\\n let a = (end2 - start2) / (end1 - start1);\\n\\n let mut d = start2;\\n\\n let mut i = start1;\\n\\n while i <= end1 {\\n\\n values.push(d);\\n\\n d += a;\\n\\n i += T::one();\\n\\n }\\n\\n values\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 10,\n \"score\": 64444.17179675972\n },\n {\n \"content\": \"/// Remaps a number from one range to another.\\n\\n///\\n\\n/// Map range defaults to `0.0..=f64::MAX` in the event casting to [f64] fails.\\n\\n/// NaN will result in the max mapped value.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// # use pix_engine::prelude::*;\\n\\n/// let value = 25;\\n\\n/// let m = map(value, 0, 100, 0, 800);\\n\\n/// assert_eq!(m, 200);\\n\\n///\\n\\n/// let value = 50.0;\\n\\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\\n\\n/// assert_eq!(m, 0.5);\\n\\n///\\n\\n/// let value = f64::NAN;\\n\\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\\n\\n/// assert!(m.is_nan());\\n\\n///\\n\\n/// let value = f64::INFINITY;\\n\\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\\n\\n/// assert_eq!(m, 1.0);\\n\\n///\\n\\n/// let value = f64::NEG_INFINITY;\\n\\n/// let m = map(value, 0.0, 100.0, 0.0, 1.0);\\n\\n/// assert_eq!(m, 0.0);\\n\\n/// ```\\n\\npub fn map<T>(value: T, start1: T, end1: T, start2: T, end2: T) -> T\\n\\nwhere\\n\\n T: NumCast + Into<Scalar> + PartialOrd + Copy,\\n\\n{\\n\\n let default = end2;\\n\\n let start1 = start1.into();\\n\\n let end1 = end1.into();\\n\\n let start2 = start2.into();\\n\\n let end2 = end2.into();\\n\\n let value = value.into();\\n\\n let new_val = ((value - start1) / (end1 - start1)).mul_add(end2 - start2, start2);\\n\\n NumCast::from(new_val.clamp(start2, end2)).unwrap_or(default)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 11,\n \"score\": 63868.110062910244\n },\n {\n \"content\": \"fn project(\\n\\n velx: &mut [Scalar],\\n\\n vely: &mut [Scalar],\\n\\n p: &mut [Scalar],\\n\\n div: &mut [Scalar],\\n\\n tmp: &mut [Scalar],\\n\\n) {\\n\\n let c = 1.0 / 6.0;\\n\\n div.par_iter_mut()\\n\\n .zip(tmp.par_iter_mut())\\n\\n .enumerate()\\n\\n .for_each(|(i, (div, tmp))| {\\n\\n let (x, y) = get_xy(i);\\n\\n if (1..NLEN).contains(&x) && (1..NHEIGHT).contains(&y) {\\n\\n *div = -0.5\\n\\n * (velx[get_idx(x + 1, y)] - velx[get_idx(x - 1, y)] + vely[get_idx(x, y + 1)]\\n\\n - vely[get_idx(x, y - 1)])\\n\\n / N_SCALAR;\\n\\n *tmp = *div * c;\\n\\n }\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 12,\n \"score\": 60374.2940092556\n },\n {\n \"content\": \"#[allow(clippy::many_single_char_names)]\\n\\nfn linear_solve(\\n\\n b: usize,\\n\\n xs: &mut [Scalar],\\n\\n xs0: &[Scalar],\\n\\n a: Scalar,\\n\\n c: Scalar,\\n\\n tmp: &mut [Scalar],\\n\\n) {\\n\\n let c_recip = c.recip();\\n\\n tmp.par_iter_mut().enumerate().for_each(|(i, tmp)| {\\n\\n let (x, y) = get_xy(i);\\n\\n if (1..NLEN).contains(&x) && (1..NHEIGHT).contains(&y) {\\n\\n *tmp = (xs0[i]\\n\\n + a * (xs[get_idx(x + 1, y)]\\n\\n + xs[get_idx(x - 1, y)]\\n\\n + xs[get_idx(x, y + 1)]\\n\\n + xs[get_idx(x, y - 1)]))\\n\\n * c_recip;\\n\\n }\\n\\n });\\n\\n xs.swap_with_slice(tmp);\\n\\n set_bounds(b, xs);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 13,\n \"score\": 58711.68354251192\n },\n {\n \"content\": \"/// Trait for objects that can be drawn to the screen.\\n\\npub trait Draw {\\n\\n /// Draw object to the current [`PixState`] canvas.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// If the renderer fails to draw to the current render target, then an error is returned.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\\n\\n /// let rect = rect![0, 0, 100, 100];\\n\\n /// // The following two lines are equivalent.\\n\\n /// s.rect(rect)?;\\n\\n /// rect.draw(s)?;\\n\\n /// Ok(())\\n\\n /// }\\n\",\n \"file_path\": \"src/draw.rs\",\n \"rank\": 14,\n \"score\": 56948.54144450373\n },\n {\n \"content\": \"#[allow(unused_variables)]\\n\\npub trait AppState {\\n\\n /// Called once upon engine start when [`PixEngine::run`] is called.\\n\\n ///\\n\\n /// This can be used to set up initial state like creating objects, loading files or [Image]s, or\\n\\n /// any additional application state that's either dynamic or relies on runtime values from\\n\\n /// [`PixState`].\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// Returning an error will immediately exit the application and call [`AppState:: Prefer using\\n\\n /// the more specialized methods where possible, as it allows you to consume them, preventing\\n\\n /// the engine from encountering event-handling collisions.on_stop`].\\n\\n /// [`PixEngine::run`] will return the original error or any error returned from\\n\\n /// [`AppState::on_stop`]. Calling [`PixState::abort_quit`] during [`AppState::on_stop`] has no\\n\\n /// effect.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\",\n \"file_path\": \"src/appstate.rs\",\n \"rank\": 15,\n \"score\": 55283.19966986653\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(800, 600)\\n\\n .with_title(\\\"MyApp\\\")\\n\\n .build()?;\\n\\n let mut app = MyApp;\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/template.rs\",\n \"rank\": 16,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"2D Raycasting\\\")\\n\\n .with_frame_rate()\\n\\n .icon(Image::from_read(LIGHT)?)\\n\\n .build()?;\\n\\n let mut app = RayScene::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/2d_raycasting.rs\",\n \"rank\": 17,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let raw_file = match std::env::args().nth(1) {\\n\\n None => PathBuf::from(\\\"./audio/melancholy.raw\\\"),\\n\\n Some(s) => PathBuf::from(s),\\n\\n };\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(1024, 768)\\n\\n .with_title(\\\"Audio Demo\\\")\\n\\n .with_frame_rate()\\n\\n .build()?;\\n\\n let mut app = AudioDemo::new(raw_file);\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/audio.rs\",\n \"rank\": 18,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(400, 400)\\n\\n .with_title(\\\"Window 1\\\")\\n\\n .position(10, 10)\\n\\n .build()?;\\n\\n let mut app = WindowDemo::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/windows.rs\",\n \"rank\": 19,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(DEFAULT_WIDTH, DEFAULT_HEIGHT)\\n\\n .position(0, 0)\\n\\n .with_title(\\\"The Matrix\\\")\\n\\n .with_frame_rate()\\n\\n .target_frame_rate(30)\\n\\n .with_font(Font::from_bytes(\\\"Sunray\\\", FONT_DATA))\\n\\n .with_font_size(DEFAULT_FONT_SIZE)\\n\\n .build()?;\\n\\n let mut app = Matrix::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/matrix.rs\",\n \"rank\": 20,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(1024, 768)\\n\\n .with_title(\\\"GUI Demo\\\")\\n\\n .with_frame_rate()\\n\\n .target_frame_rate(60)\\n\\n .build()?;\\n\\n let mut app = Gui::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/gui.rs\",\n \"rank\": 21,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let args: Vec<_> = env::args().collect();\\n\\n if args.len() < 2 {\\n\\n Err(anyhow!(\\\"Usage: cargo run /path/to/image.png\\\"))\\n\\n } else {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"Image Demo\\\")\\n\\n .with_frame_rate()\\n\\n .build()?;\\n\\n let mut app = ImageDemo::new(&args[1])?;\\n\\n engine.run(&mut app)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/image.rs\",\n \"rank\": 22,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"Textures\\\")\\n\\n .with_frame_rate()\\n\\n .build()?;\\n\\n let mut app = Textures::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/textures.rs\",\n \"rank\": 23,\n \"score\": 54898.97882028201\n },\n {\n \"content\": \"fn main() -> PixResult<()> {\\n\\n let mut engine = PixEngine::builder()\\n\\n .with_dimensions(WIDTH, HEIGHT)\\n\\n .with_title(\\\"SVG Color Constants\\\")\\n\\n .build()?;\\n\\n let mut app = ColorConsts::new();\\n\\n engine.run(&mut app)\\n\\n}\\n\",\n \"file_path\": \"examples/color_constants.rs\",\n \"rank\": 24,\n \"score\": 53365.77537856699\n },\n {\n \"content\": \"fn get_idx(x: usize, y: usize) -> usize {\\n\\n let x = x.clamp(0, NLEN);\\n\\n let y = y.clamp(0, NLEN);\\n\\n x + y * N\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 25,\n \"score\": 52818.16264510415\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore = \\\"engine can only be tested in the main thread. --test-threads=1\\\"]\\n\\nfn test_run_engine_update() -> PixResult<()> {\\n\\n let mut eng = create_engine()?;\\n\\n // Quitting from on_update should exit but still run on_stop\\n\\n let mut app = App::new();\\n\\n app.quit_on_update = true;\\n\\n eng.run(&mut app)?;\\n\\n assert_eq!(app.start_count, 1, \\\"on_start was called\\\");\\n\\n assert_eq!(app.update_count, 1, \\\"on_update was called\\\");\\n\\n assert_eq!(app.stop_count, 1, \\\"on_stop was called\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/pix-engine.rs\",\n \"rank\": 26,\n \"score\": 49407.318880080675\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore = \\\"engine can only be tested in the main thread. --test-threads=1\\\"]\\n\\nfn test_run_engine_start() -> PixResult<()> {\\n\\n let mut eng = create_engine()?;\\n\\n // Quitting from on_start should exit the game loop early\\n\\n let mut app = App::new();\\n\\n app.quit_on_start = true;\\n\\n eng.run(&mut app)?;\\n\\n assert_eq!(app.start_count, 1, \\\"on_start was called\\\");\\n\\n assert_eq!(app.update_count, 0, \\\"on_update was not called\\\");\\n\\n assert_eq!(app.stop_count, 1, \\\"on_stop was called\\\");\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/pix-engine.rs\",\n \"rank\": 27,\n \"score\": 49407.318880080675\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore = \\\"engine can only be tested in the main thread. --test-threads=1\\\"]\\n\\nfn test_run_engine_stop() -> PixResult<()> {\\n\\n let mut eng = create_engine()?;\\n\\n // Aborting quit from on_stop should resume game loop\\n\\n let mut app = App::new();\\n\\n app.quit_on_update = true;\\n\\n app.abort_quit_on_stop = true;\\n\\n eng.run(&mut app)?;\\n\\n assert_eq!(app.start_count, 1, \\\"on_start was called\\\");\\n\\n // Accounts for the initial run, plus 1 more for on_stop being cancelled\\n\\n assert_eq!(app.update_count, 2, \\\"on_update was called\\\");\\n\\n assert_eq!(app.stop_count, 2, \\\"on_stop was called\\\");\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tests/pix-engine.rs\",\n \"rank\": 28,\n \"score\": 49407.318880080675\n },\n {\n \"content\": \"/// Default floating-point number trait used math operations.\\n\\npub trait Float: Num + FloatTrait {}\\n\\n\\n\\nimpl<T> Num for T where\\n\\n T: NumTrait + NumOps + NumRef + NumAssignOps + NumAssignRef + Copy + Default + PartialOrd\\n\\n{\\n\\n}\\n\\n\\n\\nimpl<T> Float for T where T: Num + FloatTrait {}\\n\\n\\n\\nconst PERLIN_YWRAPB: usize = 4;\\n\\nconst PERLIN_YWRAP: usize = 1 << PERLIN_YWRAPB;\\n\\nconst PERLIN_ZWRAPB: usize = 8;\\n\\nconst PERLIN_ZWRAP: usize = 1 << PERLIN_ZWRAPB;\\n\\nconst PERLIN_SIZE: usize = 4095;\\n\\n\\n\\nlazy_static! {\\n\\n static ref PERLIN: Vec<Scalar> = {\\n\\n let mut perlin = Vec::with_capacity(PERLIN_SIZE + 1);\\n\\n for _ in 0..=PERLIN_SIZE {\\n\\n perlin.push(random(1.0));\\n\\n }\\n\\n perlin\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 29,\n \"score\": 47853.225567426736\n },\n {\n \"content\": \"fn create_engine() -> PixResult<PixEngine> {\\n\\n PixEngine::builder()\\n\\n .with_title(\\\"pix-engine integration test\\\")\\n\\n .position_centered()\\n\\n .hidden()\\n\\n .build()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/pix-engine.rs\",\n \"rank\": 30,\n \"score\": 46851.71041131443\n },\n {\n \"content\": \"/// Trait for shape containing operations.\\n\\npub trait Contains<T, const N: usize> {\\n\\n /// The shape type. e.g. [`Rect<T>`].\\n\\n type Shape;\\n\\n\\n\\n /// Returns whether this shape contains a given [Point].\\n\\n fn contains_point<P>(&self, _p: P) -> bool\\n\\n where\\n\\n P: Into<Point<T, N>>;\\n\\n\\n\\n /// Returns whether this shape completely contains another shape of the same type.\\n\\n fn contains_shape<O>(&self, _other: O) -> bool\\n\\n where\\n\\n O: Into<Self::Shape>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shape.rs\",\n \"rank\": 31,\n \"score\": 44028.04094303763\n },\n {\n \"content\": \"/// Trait for shape intersection operations.\\n\\npub trait Intersects<T, const N: usize> {\\n\\n /// The shape type. e.g. [`Rect<T>`].\\n\\n type Shape;\\n\\n\\n\\n /// Returns the closest intersection point with a given line and distance along the line or\\n\\n /// `None` if there is no intersection.\\n\\n fn intersects_line<L>(&self, _line: L) -> Option<(Point<T, N>, T)>\\n\\n where\\n\\n L: Into<Line<T, N>>;\\n\\n\\n\\n /// Returns whether this shape intersects with another shape of the same type.\\n\\n fn intersects_shape<O>(&self, _other: O) -> bool\\n\\n where\\n\\n O: Into<Self::Shape>;\\n\\n}\\n\\n\\n\\nimpl PixState {\\n\\n /// Draw a [Point] to the current canvas. [`PixState::stroke`] controls whether the point is\\n\\n /// drawn or not. [`PixState::stroke_weight`] and [`PixState::fill`] have no effect.\\n\\n ///\\n\",\n \"file_path\": \"src/shape.rs\",\n \"rank\": 32,\n \"score\": 44028.04094303763\n },\n {\n \"content\": \"fn get_xy(idx: usize) -> (usize, usize) {\\n\\n (idx % N, idx / N)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 33,\n \"score\": 43641.54196472386\n },\n {\n \"content\": \"fn set_bounds(b: usize, xs: &mut [Scalar]) {\\n\\n for i in 1..NLEN {\\n\\n let (_, y) = get_xy(i);\\n\\n if y > NHEIGHT {\\n\\n break;\\n\\n }\\n\\n // Top and bottom\\n\\n if b == 2 {\\n\\n xs[get_idx(i, 0)] = -xs[get_idx(i, 1)];\\n\\n xs[get_idx(i, N - 1)] = -xs[get_idx(i, N - 2)];\\n\\n } else {\\n\\n xs[get_idx(i, 0)] = xs[get_idx(i, 1)];\\n\\n xs[get_idx(i, N - 1)] = xs[get_idx(i, N - 2)];\\n\\n }\\n\\n // left and right\\n\\n if b == 1 {\\n\\n xs[get_idx(0, i)] = -xs[get_idx(1, i)];\\n\\n xs[get_idx(N - 1, i)] = -xs[get_idx(N - 2, i)];\\n\\n } else {\\n\\n xs[get_idx(0, i)] = xs[get_idx(1, i)];\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 34,\n \"score\": 42567.59719796151\n },\n {\n \"content\": \"/// Default number trait used for objects and shapes.\\n\\npub trait Num: NumTrait + NumOps + NumAssignOps + Copy + Default + PartialOrd {}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 35,\n \"score\": 35335.84901408081\n },\n {\n \"content\": \"fn advect(b: usize, d: &mut [Scalar], d0: &[Scalar], velx: &[Scalar], vely: &[Scalar]) {\\n\\n d.par_iter_mut().enumerate().for_each(|(i, d)| {\\n\\n let (x, y) = get_xy(i);\\n\\n if (1..NLEN).contains(&x) && (1..NHEIGHT).contains(&y) {\\n\\n let mut x = x as Scalar - (DT * N_SCALAR * velx[i]);\\n\\n let mut y = y as Scalar - (DT * N_SCALAR * vely[i]);\\n\\n\\n\\n if x < 0.5 {\\n\\n x = 0.5;\\n\\n }\\n\\n if x > N_SCALAR + 0.5 {\\n\\n x = N_SCALAR + 0.5;\\n\\n }\\n\\n let i0 = x.floor() as usize;\\n\\n let i1 = i0 + 1;\\n\\n if y < 0.5 {\\n\\n y = 0.5;\\n\\n }\\n\\n if y > N_SCALAR + 0.5 {\\n\\n y = N_SCALAR + 0.5;\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 36,\n \"score\": 34969.85924652954\n },\n {\n \"content\": \"fn intersect_ray_sphere(origin: PointF3, direction: VectorF3, obj: &SphereObj) -> (Scalar, Scalar) {\\n\\n let r = obj.sphere.radius();\\n\\n let center_origin = origin - obj.sphere.center();\\n\\n\\n\\n let a = direction.mag_sq();\\n\\n let b = 2.0 * center_origin.dot(direction);\\n\\n let c = center_origin.mag_sq() - (r * r);\\n\\n\\n\\n let discriminant = b * b - 4.0 * a * c;\\n\\n if discriminant < 0.0 {\\n\\n return (Scalar::INFINITY, Scalar::INFINITY);\\n\\n }\\n\\n\\n\\n let sqrt = discriminant.sqrt();\\n\\n let two_a = 2.0 * a;\\n\\n let t1 = (-b + sqrt) / two_a;\\n\\n let t2 = (-b - sqrt) / two_a;\\n\\n (t1, t2)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/3d_raytracing.rs\",\n \"rank\": 37,\n \"score\": 33764.97308820041\n },\n {\n \"content\": \"fn diffuse(b: usize, xs: &mut [Scalar], xs0: &[Scalar], amt: Scalar, tmp: &mut [Scalar]) {\\n\\n let a = DT * amt * (N - 2).pow(2) as Scalar;\\n\\n linear_solve(b, xs, xs0, a, 1.0 + 6.0 * a, tmp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/fluid_simulation.rs\",\n \"rank\": 38,\n \"score\": 32930.086215144256\n },\n {\n \"content\": \" /// Constructs an `Ellipse` at position `(x, y)` with `width` and `height`.\\n\\n pub const fn new(x: T, y: T, width: T, height: T) -> Self {\\n\\n Self([x, y, width, height])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy> Ellipse<T> {\\n\\n /// Returns `Ellipse` values as `[x, y, width, height]`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let e = ellipse!(5, 10, 100, 100);\\n\\n /// assert_eq!(e.as_array(), [5, 10, 100, 100]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn as_array(&self) -> [T; 4] {\\n\\n self.0\\n\\n }\\n\",\n \"file_path\": \"src/shape/ellipse.rs\",\n \"rank\": 39,\n \"score\": 29.755542409018652\n },\n {\n \"content\": \" /// Returns the `Image` width.\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn width(&self) -> u32 {\\n\\n self.width\\n\\n }\\n\\n\\n\\n /// Returns the `Image` height.\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn height(&self) -> u32 {\\n\\n self.height\\n\\n }\\n\\n\\n\\n /// Returns the `Image` dimensions as `(width, height)`.\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn dimensions(&self) -> (u32, u32) {\\n\\n (self.width, self.height)\\n\\n }\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 40,\n \"score\": 27.854177925728546\n },\n {\n \"content\": \" pub fn size(&self) -> Point<T, 2> {\\n\\n point!(self.width(), self.height())\\n\\n }\\n\\n\\n\\n /// Reposition the the rectangle.\\n\\n #[inline]\\n\\n pub fn reposition(&self, x: T, y: T) -> Self {\\n\\n Self::new(x, y, self.width(), self.height())\\n\\n }\\n\\n\\n\\n /// Resize the the rectangle.\\n\\n #[inline]\\n\\n pub fn resize(&self, width: T, height: T) -> Self {\\n\\n Self::new(self.x(), self.y(), width, height)\\n\\n }\\n\\n\\n\\n /// Offsets a rectangle by shifting coordinates by given amount.\\n\\n #[inline]\\n\\n pub fn offset<P>(&self, offsets: P) -> Self\\n\\n where\\n\",\n \"file_path\": \"src/shape/rect.rs\",\n \"rank\": 41,\n \"score\": 27.383682542698626\n },\n {\n \"content\": \" /// `Image` height.\\n\\n height: u32,\\n\\n /// Raw pixel data.\\n\\n data: Vec<u8>,\\n\\n /// Pixel Format.\\n\\n format: PixelFormat,\\n\\n}\\n\\n\\n\\nimpl Image {\\n\\n /// Constructs an empty RGBA `Image` with given `width` and `height`.\\n\\n #[inline]\\n\\n pub fn new(width: u32, height: u32) -> Self {\\n\\n Self::with_rgba(width, height)\\n\\n }\\n\\n\\n\\n /// Constructs an empty RGBA `Image` with given `width` and `height`.\\n\\n ///\\n\\n /// Alias for [Image::new].\\n\\n #[doc(alias = \\\"new\\\")]\\n\\n #[inline]\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 42,\n \"score\": 26.86593577627441\n },\n {\n \"content\": \" /// s.text(\\\"Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam\\\")?;\\n\\n /// Ok(())\\n\\n /// }\\n\\n /// # }\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn wrap(&mut self, width: u32) {\\n\\n self.settings.wrap_width = Some(width);\\n\\n }\\n\\n\\n\\n /// Disable wrapping when drawing text on the canvas.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\\n\\n /// s.no_wrap();\\n\",\n \"file_path\": \"src/state/settings.rs\",\n \"rank\": 43,\n \"score\": 26.441566436445637\n },\n {\n \"content\": \" /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let p: PointI2 = Point::origin();\\n\\n /// assert_eq!(p.as_array(), [0, 0]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn origin() -> Self\\n\\n where\\n\\n T: Default,\\n\\n {\\n\\n Self::new([(); N].map(|_| T::default()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Point<T, 1> {\\n\\n /// Constructs a `Point` from an individual x coordinate.\\n\\n #[inline]\\n\\n pub const fn from_x(x: T) -> Self {\\n\",\n \"file_path\": \"src/shape/point.rs\",\n \"rank\": 44,\n \"score\": 26.28108135399814\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn to_vec(self) -> Vec<T> {\\n\\n self.0.to_vec()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Num, const N: usize> Point<T, N> {\\n\\n /// Offsets a `Point` by shifting coordinates by given amount.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let mut p = point!(2, 3, 1);\\n\\n /// p.offset([2, -4]);\\n\\n /// assert_eq!(p.as_array(), [4, -1, 1]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn offset<P, const M: usize>(&mut self, offsets: P)\\n\\n where\\n\",\n \"file_path\": \"src/shape/point.rs\",\n \"rank\": 45,\n \"score\": 26.140172107287448\n },\n {\n \"content\": \"\\n\\n /// Constructs a `Color` from a [u32] RGB hexadecimal value with max alpha.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::from_hex(0xF0FF00);\\n\\n /// assert_eq!(c.channels(), [240, 255, 0, 255]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub const fn from_hex(hex: u32) -> Self {\\n\\n let [_, r, g, b] = hex.to_be_bytes();\\n\\n Self::rgba(r, g, b, 255)\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` from a [u32] RGBA hexadecimal value.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\",\n \"file_path\": \"src/color/conversion.rs\",\n \"rank\": 46,\n \"score\": 25.26460868702739\n },\n {\n \"content\": \" fn from(format: PixelFormat) -> Self {\\n\\n match format {\\n\\n PixelFormat::Rgb => Self::Rgb,\\n\\n PixelFormat::Rgba => Self::Rgba,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for PixelFormat {\\n\\n fn default() -> Self {\\n\\n Self::Rgba\\n\\n }\\n\\n}\\n\\n\\n\\n/// An `Image` representing a buffer of pixel color values.\\n\\n#[derive(Default, Clone)]\\n\\n#[must_use]\\n\\npub struct Image {\\n\\n /// `Image` width.\\n\\n width: u32,\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 47,\n \"score\": 25.21767357953996\n },\n {\n \"content\": \" /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::from_hex_alpha(0xF0FF00FF);\\n\\n /// assert_eq!(c.channels(), [240, 255, 0, 255]);\\n\\n ///\\n\\n /// let c = Color::from_hex_alpha(0xF0FF0080);\\n\\n /// assert_eq!(c.channels(), [240, 255, 0, 128]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub const fn from_hex_alpha(hex: u32) -> Self {\\n\\n let [r, g, b, a] = hex.to_be_bytes();\\n\\n Self::rgba(r, g, b, a)\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` by inverting the RGBA values.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\",\n \"file_path\": \"src/color/conversion.rs\",\n \"rank\": 48,\n \"score\": 25.133324834671566\n },\n {\n \"content\": \"\\n\\n /// Set window dimensions.\\n\\n #[inline]\\n\\n pub fn with_dimensions(&mut self, width: u32, height: u32) -> &mut Self {\\n\\n self.settings.width = width;\\n\\n self.settings.height = height;\\n\\n self\\n\\n }\\n\\n\\n\\n /// Set a window title.\\n\\n #[inline]\\n\\n pub fn with_title<S: Into<String>>(&mut self, title: S) -> &mut Self {\\n\\n self.settings.title = title.into();\\n\\n self\\n\\n }\\n\\n\\n\\n /// Position the window at the given `(x, y)` coordinates of the display.\\n\\n #[inline]\\n\\n pub fn position(&mut self, x: i32, y: i32) -> &mut Self {\\n\\n self.settings.x = Position::Positioned(x);\\n\",\n \"file_path\": \"src/window.rs\",\n \"rank\": 49,\n \"score\": 25.099380370159867\n },\n {\n \"content\": \"//! Common [`PixEngine`] trait implementations for types.\\n\\n\\n\\nuse crate::prelude::*;\\n\\nuse num_traits::AsPrimitive;\\n\\nuse std::{\\n\\n array::IntoIter,\\n\\n iter::{FromIterator, Product, Sum},\\n\\n ops::{\\n\\n Add, AddAssign, Deref, DerefMut, Div, DivAssign, Index, IndexMut, Mul, MulAssign, Neg, Sub,\\n\\n SubAssign,\\n\\n },\\n\\n};\\n\\n\\n\\n#[inline]\\n\\npub(crate) fn clamp_size(val: u32) -> i32 {\\n\\n val.clamp(0, i32::MAX as u32 / 2) as i32\\n\\n}\\n\\n\\n\\n#[inline]\\n\\npub(crate) fn clamp_dimensions(width: u32, height: u32) -> (i32, i32) {\\n\",\n \"file_path\": \"src/ops.rs\",\n \"rank\": 50,\n \"score\": 24.77269503502818\n },\n {\n \"content\": \"use pix_engine::prelude::*;\\n\\n\\n\\nuse crate::cell::{Cell, Direction};\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Maze {\\n\\n cols: u32,\\n\\n rows: u32,\\n\\n cells: Vec<Cell>,\\n\\n}\\n\\n\\n\\nimpl Maze {\\n\\n pub fn new(cols: u32, rows: u32) -> Self {\\n\\n let mut cells = Vec::with_capacity((cols * rows) as usize);\\n\\n for row in 0..rows {\\n\\n // Ensure cols are added contiguously before rows\\n\\n for col in 0..cols {\\n\\n cells.push(Cell::new(cells.len(), col, row));\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"examples/maze/maze.rs\",\n \"rank\": 51,\n \"score\": 24.26570651446075\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Constructs a square `Rect` centered at position `(x, y)` with `size`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let s = Rect::square_from_center([50, 50], 100);\\n\\n /// assert_eq!(s.as_array(), [0, 0, 100, 100]);\\n\\n /// ```\\n\\n pub fn square_from_center<P: Into<Point<T, 2>>>(p: P, size: T) -> Self {\\n\\n let p = p.into();\\n\\n let two = T::one() + T::one();\\n\\n let offset = size / two;\\n\\n Self::new(p.x() - offset, p.y() - offset, size, size)\\n\\n }\\n\\n\\n\\n /// Returns the `size` of the rectangle as a `Point`.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/shape/rect.rs\",\n \"rank\": 52,\n \"score\": 23.97030179210949\n },\n {\n \"content\": \" self.0.to_vec()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Num, const N: usize> Vector<T, N> {\\n\\n /// Constructs a `Vector` by shifting coordinates by given amount.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let mut v = vector!(2.0, 3.0, 1.5);\\n\\n /// v.offset([2.0, -4.0]);\\n\\n /// assert_eq!(v.as_array(), [4.0, -1.0, 1.5]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn offset<V, const M: usize>(&mut self, offsets: V)\\n\\n where\\n\\n V: Into<Vector<T, M>>,\\n\\n {\\n\",\n \"file_path\": \"src/vector.rs\",\n \"rank\": 53,\n \"score\": 23.80978987551906\n },\n {\n \"content\": \"use super::Renderer;\\n\\nuse crate::{prelude::*, renderer::TextureRenderer};\\n\\n\\n\\nimpl TextureRenderer for Renderer {\\n\\n /// Create a `Texture` to draw to.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// If the current window target is closed or invalid, or the texture dimensions are invalid,\\n\\n /// then an error is returned.\\n\\n #[inline]\\n\\n fn create_texture(\\n\\n &mut self,\\n\\n width: u32,\\n\\n height: u32,\\n\\n format: Option<PixelFormat>,\\n\\n ) -> PixResult<TextureId> {\\n\\n todo!()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/renderer/wasm/texture.rs\",\n \"rank\": 54,\n \"score\": 23.70976703330418\n },\n {\n \"content\": \"\\n\\n /// Constructs a random `Color` with `red`, `green`, `blue` and alpha.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::random_alpha();\\n\\n /// // `c.channels()` will return something like:\\n\\n /// // [132, 159, 233, 76]\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn random_alpha() -> Self {\\n\\n Self::rgba(random!(255), random!(255), random!(255), random!(255))\\n\\n }\\n\\n\\n\\n /// Returns the [u32] RGB hexadecimal value of a `Color`.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 55,\n \"score\": 23.61039260202438\n },\n {\n \"content\": \" /// Returns the `height` of the rectangle.\\n\\n #[inline]\\n\\n pub fn height(&self) -> T {\\n\\n self.0[3]\\n\\n }\\n\\n\\n\\n /// Sets the `height` of the rectangle.\\n\\n #[inline]\\n\\n pub fn set_height(&mut self, height: T) {\\n\\n self.0[3] = height;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Num> Rect<T> {\\n\\n /// Constructs a `Rect` at position [Point] with `width` and `height`.\\n\\n pub fn with_position<P: Into<Point<T, 2>>>(p: P, width: T, height: T) -> Self {\\n\\n let p = p.into();\\n\\n Self::new(p.x(), p.y(), width, height)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/shape/rect.rs\",\n \"rank\": 56,\n \"score\": 23.37677375268103\n },\n {\n \"content\": \" pub fn with_rgba(width: u32, height: u32) -> Self {\\n\\n let format = PixelFormat::Rgba;\\n\\n let data = vec![0x00; format.channels() * (width * height) as usize];\\n\\n Self::from_vec(width, height, data, format)\\n\\n }\\n\\n\\n\\n /// Constructs an empty RGB `Image` with given `width` and `height`.\\n\\n #[inline]\\n\\n pub fn with_rgb(width: u32, height: u32) -> Self {\\n\\n let format = PixelFormat::Rgb;\\n\\n let data = vec![0x00; format.channels() * (width * height) as usize];\\n\\n Self::from_vec(width, height, data, format)\\n\\n }\\n\\n\\n\\n /// Constructs an `Image` from a [u8] [prim@slice] representing RGB/A values.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// If the bytes length doesn't match the image dimensions and [`PixelFormat`] provided, then\\n\\n /// an error is returned.\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 57,\n \"score\": 22.93697242850473\n },\n {\n \"content\": \" /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::rgb(240, 255, 0);\\n\\n /// assert_eq!(c.as_hex(), 0xF0FF00);\\n\\n /// ```\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn as_hex(&self) -> u32 {\\n\\n let [r, g, b, _] = self.channels();\\n\\n u32::from_be_bytes([0, r, g, b])\\n\\n }\\n\\n\\n\\n /// Returns the [u32] RGBA hexadecimal value of a `Color`.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::rgb(240, 255, 0);\\n\\n /// assert_eq!(c.as_hex_alpha(), 0xF0FF00FF);\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 58,\n \"score\": 22.7459979645857\n },\n {\n \"content\": \" $crate::prelude::Sphere::new($x, $y, $z, $r)\\n\\n };\\n\\n}\\n\\n\\n\\nimpl<T> Sphere<T> {\\n\\n /// Constructs a `Sphere` at position `(x, y, z)` with `radius`.\\n\\n pub const fn new(x: T, y: T, z: T, radius: T) -> Self {\\n\\n Self([x, y, z, radius])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy> Sphere<T> {\\n\\n /// Returns `Sphere` as `[x, y, z, radius]`.\\n\\n #[inline]\\n\\n pub fn as_array(&self) -> [T; 4] {\\n\\n self.0\\n\\n }\\n\\n\\n\\n /// Returns `Sphere` as a byte slice `&[x, y, z, radius]`.\\n\\n #[inline]\\n\",\n \"file_path\": \"src/shape/sphere.rs\",\n \"rank\": 59,\n \"score\": 22.65826562426095\n },\n {\n \"content\": \" ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let r = rect!(5, 10, 100, 100);\\n\\n /// assert_eq!(r.as_array(), [5, 10, 100, 100]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn as_array(&self) -> [T; 4] {\\n\\n self.0\\n\\n }\\n\\n\\n\\n /// Returns `Rect` as a byte slice `&[x, y, width, height]`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let r = rect!(5, 10, 100, 100);\\n\",\n \"file_path\": \"src/shape/rect.rs\",\n \"rank\": 60,\n \"score\": 22.493361735383058\n },\n {\n \"content\": \"\\n\\n /// Sets the width used to draw lines on the canvas.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\\n\\n /// s.stroke(Color::BLUE);\\n\\n /// s.stroke_weight(2);\\n\\n /// // Shows a 2-pixel wide diagonal line\\n\\n /// s.line(line_![0, 0, 100, 100])?;\\n\\n /// Ok(())\\n\\n /// }\\n\\n /// # }\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn stroke_weight(&mut self, weight: u8) {\\n\",\n \"file_path\": \"src/state/settings.rs\",\n \"rank\": 61,\n \"score\": 22.474776450088935\n },\n {\n \"content\": \" /// Returns the current UI rendering position.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\\n\\n /// let mut pos = s.cursor_pos();\\n\\n /// pos.offset_y(20);\\n\\n /// s.set_cursor_pos(pos);\\n\\n /// s.text(\\\"Some text, offset down by 20 pixels\\\")?;\\n\\n /// Ok(())\\n\\n /// }\\n\\n /// # }\\n\\n /// ```\\n\\n #[inline]\\n\\n pub const fn cursor_pos(&self) -> PointI2 {\\n\\n self.ui.cursor()\\n\",\n \"file_path\": \"src/gui/state.rs\",\n \"rank\": 62,\n \"score\": 22.186397837655754\n },\n {\n \"content\": \" ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::new(0, 0, 128);\\n\\n /// assert_eq!(c.channels(), [0, 0, 128, 255]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub const fn new(r: u8, g: u8, b: u8) -> Self {\\n\\n Self::rgb(r, g, b)\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` with `red`, `green`, `blue` and `alpha`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::new_alpha(0, 0, 128, 50);\\n\\n /// assert_eq!(c.channels(), [0, 0, 128, 50]);\\n\\n /// ```\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 63,\n \"score\": 22.119097504792887\n },\n {\n \"content\": \"use crate::{\\n\\n cell::{Cell, Direction},\\n\\n maze::Maze,\\n\\n};\\n\\nuse pix_engine::prelude::*;\\n\\nuse rand::prelude::IteratorRandom;\\n\\nuse std::collections::HashSet;\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct MazeCreator {\\n\\n current: Option<Cell>,\\n\\n visited: HashSet<usize>,\\n\\n stack: Vec<Cell>,\\n\\n completed: bool,\\n\\n}\\n\\n\\n\\nimpl MazeCreator {\\n\\n pub fn new(maze: &Maze) -> Self {\\n\\n let current = maze.random_cell();\\n\\n Self {\\n\",\n \"file_path\": \"examples/maze/maze_creator.rs\",\n \"rank\": 64,\n \"score\": 22.08406413206327\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn from_bytes<B: AsRef<[u8]>>(\\n\\n width: u32,\\n\\n height: u32,\\n\\n bytes: B,\\n\\n format: PixelFormat,\\n\\n ) -> PixResult<Self> {\\n\\n let bytes = bytes.as_ref();\\n\\n if bytes.len() != (format.channels() * width as usize * height as usize) {\\n\\n return Err(PixError::InvalidImage {\\n\\n width,\\n\\n height,\\n\\n size: bytes.len(),\\n\\n format,\\n\\n }\\n\\n .into());\\n\\n }\\n\\n Ok(Self::from_vec(width, height, bytes.to_vec(), format))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 65,\n \"score\": 21.830729345458092\n },\n {\n \"content\": \"\\n\\n /// Offsets the `y-coordinate` of the ellipse by a given amount.\\n\\n #[inline]\\n\\n pub fn offset_y(&mut self, offset: T) {\\n\\n self.0[1] += offset;\\n\\n }\\n\\n\\n\\n /// Offsets the `width` of the ellipse by a given amount.\\n\\n #[inline]\\n\\n pub fn offset_width(&mut self, offset: T) {\\n\\n self.0[2] += offset;\\n\\n }\\n\\n\\n\\n /// Offsets the `height` of the ellipse by a given amount.\\n\\n #[inline]\\n\\n pub fn offset_height(&mut self, offset: T) {\\n\\n self.0[3] += offset;\\n\\n }\\n\\n\\n\\n /// Offsets the `radius` of the circle by a given amount.\\n\",\n \"file_path\": \"src/shape/ellipse.rs\",\n \"rank\": 66,\n \"score\": 21.750147279082434\n },\n {\n \"content\": \" /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::hsl(126.0, 80.0, 50.0);\\n\\n /// assert_eq!(c.channels(), [25, 230, 46, 255]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn hsl<T: Into<Scalar>>(h: T, s: T, l: T) -> Self {\\n\\n Self::with_mode(Hsl, h, s, l)\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` with `hue`, `saturation`, `lightness` and `alpha`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::hsla(126.0, 80.0, 50.0, 0.5);\\n\\n /// assert_eq!(c.channels(), [25, 230, 46, 128]);\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 67,\n \"score\": 21.734077610537426\n },\n {\n \"content\": \" #[inline]\\n\\n #[must_use]\\n\\n pub const fn arrow() -> Self {\\n\\n Self::System(SystemCursor::Arrow)\\n\\n }\\n\\n\\n\\n /// Constructs a `Cursor` with `SystemCursor::IBeam`.\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn ibeam() -> Self {\\n\\n Self::System(SystemCursor::IBeam)\\n\\n }\\n\\n\\n\\n /// Constructs a `Cursor` with `SystemCursor::No`.\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn no() -> Self {\\n\\n Self::System(SystemCursor::No)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/window.rs\",\n \"rank\": 68,\n \"score\": 21.662565250261558\n },\n {\n \"content\": \"use crate::{\\n\\n prelude::*,\\n\\n renderer::{RendererSettings, Rendering},\\n\\n shape::{LineI2, QuadI2, TriI2},\\n\\n};\\n\\n\\n\\nmod audio;\\n\\nmod texture;\\n\\nmod window;\\n\\n\\n\\n/// A Web-Assembly [Renderer] implementation.\\n\\npub(crate) struct Renderer {}\\n\\n\\n\\nimpl Rendering for Renderer {\\n\\n /// Creates a new Renderer instance.\\n\\n #[inline]\\n\\n fn new(settings: RendererSettings) -> PixResult<Self> {\\n\\n todo!()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/renderer/wasm.rs\",\n \"rank\": 69,\n \"score\": 21.38739602340953\n },\n {\n \"content\": \" /// ```\\n\\n #[doc(alias = \\\"new_alpha\\\")]\\n\\n #[inline]\\n\\n pub const fn rgba(r: u8, g: u8, b: u8, a: u8) -> Self {\\n\\n Self {\\n\\n mode: Rgb,\\n\\n channels: [r, g, b, a],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` with `hue`, `saturation`, `brightness` and max `alpha`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::hsb(126.0, 80.0, 50.0);\\n\\n /// assert_eq!(c.channels(), [25, 128, 36, 255]);\\n\\n /// ```\\n\\n #[inline]\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 70,\n \"score\": 21.35440669740186\n },\n {\n \"content\": \" /// Returns the `Image` bounding [Rect] positioned at `offset`.\\n\\n #[inline]\\n\\n pub fn bounding_rect_offset<P>(&self, offset: P) -> Rect<i32>\\n\\n where\\n\\n P: Into<PointI2>,\\n\\n {\\n\\n let (width, height) = clamp_dimensions(self.width, self.height);\\n\\n rect![offset.into(), width, height]\\n\\n }\\n\\n\\n\\n /// Returns the center position as [Point].\\n\\n #[inline]\\n\\n pub fn center(&self) -> PointI2 {\\n\\n let (width, height) = clamp_dimensions(self.width, self.height);\\n\\n point!(width / 2, height / 2)\\n\\n }\\n\\n\\n\\n /// Returns the `Image` pixel data as an iterator of [u8].\\n\\n #[inline]\\n\\n pub fn bytes(&self) -> Bytes<'_> {\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 71,\n \"score\": 21.27900312760921\n },\n {\n \"content\": \" /// return Ok(true);\\n\\n /// }\\n\\n /// Ok(false)\\n\\n /// }\\n\\n /// # }\\n\\n /// ```\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub fn running(&mut self) -> bool {\\n\\n self.settings.running\\n\\n }\\n\\n\\n\\n /// Unpause the render loop.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\",\n \"file_path\": \"src/state/settings.rs\",\n \"rank\": 72,\n \"score\": 21.237664238201823\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn offset_radius(&mut self, offset: T) {\\n\\n self.0[2] += offset;\\n\\n self.0[3] += offset;\\n\\n }\\n\\n\\n\\n /// Returns the `size` of the ellipse as a `Point`.\\n\\n #[inline]\\n\\n pub fn size(&self) -> Point<T, 2> {\\n\\n point!(self.width(), self.height())\\n\\n }\\n\\n\\n\\n /// Returns the bounding [Rect] of the ellipse.\\n\\n #[inline]\\n\\n pub fn bounding_rect(&self) -> Rect<T> {\\n\\n rect![self.left(), self.top(), self.width(), self.height()]\\n\\n }\\n\\n\\n\\n /// Returns `Ellipse` as a [Vec].\\n\\n ///\\n\",\n \"file_path\": \"src/shape/ellipse.rs\",\n \"rank\": 73,\n \"score\": 21.219064384783543\n },\n {\n \"content\": \"use pix_engine::prelude::*;\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\\n\\npub enum Direction {\\n\\n North = 0,\\n\\n East,\\n\\n South,\\n\\n West,\\n\\n}\\n\\nuse Direction::*;\\n\\n\\n\\nuse crate::SIZE;\\n\\n\\n\\nimpl Direction {\\n\\n pub fn opposite(self) -> Self {\\n\\n match self {\\n\\n North => South,\\n\\n East => West,\\n\\n South => North,\\n\\n West => East,\\n\",\n \"file_path\": \"examples/maze/cell.rs\",\n \"rank\": 74,\n \"score\": 21.21241013686147\n },\n {\n \"content\": \"use super::Renderer;\\n\\nuse crate::{prelude::*, renderer::TextureRenderer};\\n\\nuse anyhow::Context;\\n\\nuse sdl2::{\\n\\n rect::Rect as SdlRect,\\n\\n render::{Canvas, Texture as SdlTexture},\\n\\n};\\n\\nuse std::{\\n\\n cell::RefCell,\\n\\n ops::{Deref, DerefMut},\\n\\n};\\n\\n\\n\\npub(crate) struct RendererTexture {\\n\\n inner: Option<SdlTexture>,\\n\\n}\\n\\n\\n\\nimpl RendererTexture {\\n\\n pub(crate) const fn new(texture: SdlTexture) -> Self {\\n\\n Self {\\n\\n inner: Some(texture),\\n\",\n \"file_path\": \"src/renderer/sdl/texture.rs\",\n \"rank\": 75,\n \"score\": 21.076703398016882\n },\n {\n \"content\": \" }\\n\\n .into());\\n\\n }\\n\\n let bytes: Vec<u8> = match format {\\n\\n PixelFormat::Rgb => pixels\\n\\n .iter()\\n\\n .flat_map(|p| [p.red(), p.green(), p.blue()])\\n\\n .collect(),\\n\\n PixelFormat::Rgba => pixels.iter().flat_map(Color::channels).collect(),\\n\\n };\\n\\n Ok(Self::from_vec(width, height, bytes, format))\\n\\n }\\n\\n\\n\\n /// Constructs an `Image` from a [`Vec<u8>`] representing RGB/A values.\\n\\n #[inline]\\n\\n pub fn from_vec(width: u32, height: u32, data: Vec<u8>, format: PixelFormat) -> Self {\\n\\n Self {\\n\\n width,\\n\\n height,\\n\\n data,\\n\",\n \"file_path\": \"src/image.rs\",\n \"rank\": 76,\n \"score\": 21.045099125319386\n },\n {\n \"content\": \" /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let p = point!(1.0, 2.0);\\n\\n /// let v = Vector::from_point(p);\\n\\n /// assert_eq!(v.as_array(), [1.0, 2.0]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn from_point(p: Point<T, N>) -> Self {\\n\\n Self::new(p.as_array())\\n\\n }\\n\\n\\n\\n /// Returns the `x-coordinate`.\\n\\n ///\\n\\n /// # Panics\\n\\n ///\\n\\n /// If `Vector` has zero dimensions.\\n\\n ///\\n\\n /// # Example\\n\",\n \"file_path\": \"src/vector.rs\",\n \"rank\": 77,\n \"score\": 21.044044244237195\n },\n {\n \"content\": \" /// assert_eq!(r.as_bytes(), &[5, 10, 100, 100]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn as_bytes(&self) -> &[T; 4] {\\n\\n &self.0\\n\\n }\\n\\n\\n\\n /// Returns `Rect` as a mutable byte slice `&mut [x, y, width, height]`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let mut r = rect!(5, 10, 100, 100);\\n\\n /// for p in r.as_bytes_mut() {\\n\\n /// *p += 5;\\n\\n /// }\\n\\n /// assert_eq!(r.as_bytes(), &[10, 15, 105, 105]);\\n\\n /// ```\\n\\n #[inline]\\n\",\n \"file_path\": \"src/shape/rect.rs\",\n \"rank\": 78,\n \"score\": 21.034582493613303\n },\n {\n \"content\": \"\\n\\n /// Returns `Ellipse` values as a byte slice `&[x, y, width, height]`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let e = ellipse!(5, 10, 100, 100);\\n\\n /// assert_eq!(e.as_bytes(), &[5, 10, 100, 100]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn as_bytes(&self) -> &[T; 4] {\\n\\n &self.0\\n\\n }\\n\\n\\n\\n /// Returns `Ellipse` values as a mutable byte slice `&[x, y, width, height]`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\",\n \"file_path\": \"src/shape/ellipse.rs\",\n \"rank\": 79,\n \"score\": 20.895843647274468\n },\n {\n \"content\": \" Self([x])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Point<T, 2> {\\n\\n /// Constructs a `Point` from individual x/y coordinates.\\n\\n #[inline]\\n\\n pub const fn from_xy(x: T, y: T) -> Self {\\n\\n Self([x, y])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Point<T, 3> {\\n\\n /// Constructs a `Point` from individual x/y/z coordinates.\\n\\n #[inline]\\n\\n pub const fn from_xyz(x: T, y: T, z: T) -> Self {\\n\\n Self([x, y, z])\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shape/point.rs\",\n \"rank\": 81,\n \"score\": 20.747532032690163\n },\n {\n \"content\": \" ///\\n\\n /// let c = Color::rgba(240, 255, 0, 128);\\n\\n /// assert_eq!(c.as_hex_alpha(), 0xF0FF0080);\\n\\n /// ```\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub const fn as_hex_alpha(&self) -> u32 {\\n\\n u32::from_be_bytes(self.channels())\\n\\n }\\n\\n\\n\\n /// Returns a list of max values for each color channel based on [Mode].\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::rgb(0, 0, 0);\\n\\n /// assert_eq!(c.maxes(), [255.0, 255.0, 255.0, 255.0]);\\n\\n ///\\n\\n /// let c = Color::hsb(0.0, 0.0, 0.0);\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 82,\n \"score\": 20.735490247055555\n },\n {\n \"content\": \" Self {\\n\\n mode,\\n\\n channels: calculate_channels(levels),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Constructs a random `Color` with `red`, `green`, `blue` and max alpha.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::random();\\n\\n /// // `c.channels()` will return something like:\\n\\n /// // [207, 12, 217, 255]\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn random() -> Self {\\n\\n Self::rgb(random!(255), random!(255), random!(255))\\n\\n }\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 83,\n \"score\": 20.655279809695553\n },\n {\n \"content\": \" /// If the window has been closed or is invalid, then an error is returned.\\n\\n #[inline]\\n\\n pub fn width(&self) -> PixResult<u32> {\\n\\n let (width, _) = self.dimensions()?;\\n\\n Ok(width)\\n\\n }\\n\\n\\n\\n /// The width of the current window.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// If the window has been closed or is invalid, then an error is returned.\\n\\n #[inline]\\n\\n pub fn window_width(&self) -> PixResult<u32> {\\n\\n let (width, _) = self.window_dimensions()?;\\n\\n Ok(width)\\n\\n }\\n\\n\\n\\n /// Set the width of the current window.\\n\\n ///\\n\",\n \"file_path\": \"src/window.rs\",\n \"rank\": 84,\n \"score\": 20.593698490264842\n },\n {\n \"content\": \"\\n\\n /// Constructs an `Ellipse` centered at position `(x, y)` with `width` and `height`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let e = Ellipse::from_center([50, 50], 100, 100);\\n\\n /// assert_eq!(e.as_array(), [0, 0, 100, 100]);\\n\\n /// ```\\n\\n pub fn from_center<P: Into<Point<T, 2>>>(p: P, width: T, height: T) -> Self {\\n\\n let p = p.into();\\n\\n let two = T::one() + T::one();\\n\\n Self::new(p.x() - width / two, p.y() - height / two, width, height)\\n\\n }\\n\\n\\n\\n /// Constructs a circle `Ellipse` centered at position `(x, y)` with `radius`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\",\n \"file_path\": \"src/shape/ellipse.rs\",\n \"rank\": 85,\n \"score\": 20.54684952328476\n },\n {\n \"content\": \" /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let p = Point::new([1]);\\n\\n /// assert_eq!(p.as_array(), [1]);\\n\\n ///\\n\\n /// let p = Point::new([1, 2]);\\n\\n /// assert_eq!(p.as_array(), [1, 2]);\\n\\n ///\\n\\n /// let p = Point::new([1, -2, 1]);\\n\\n /// assert_eq!(p.as_array(), [1, -2, 1]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub const fn new(coords: [T; N]) -> Self {\\n\\n Self(coords)\\n\\n }\\n\\n\\n\\n /// Constructs a `Point` at the origin.\\n\\n ///\\n\",\n \"file_path\": \"src/shape/point.rs\",\n \"rank\": 86,\n \"score\": 20.435943893036786\n },\n {\n \"content\": \" /// let v = Vector::new([2.1]);\\n\\n /// assert_eq!(v.as_array(), [2.1]);\\n\\n ///\\n\\n /// let v = Vector::new([2.1, 3.5]);\\n\\n /// assert_eq!(v.as_array(), [2.1, 3.5]);\\n\\n ///\\n\\n /// let v = Vector::new([2.1, 3.5, 1.0]);\\n\\n /// assert_eq!(v.as_array(), [2.1, 3.5, 1.0]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub const fn new(coords: [T; N]) -> Self {\\n\\n Self(coords)\\n\\n }\\n\\n\\n\\n /// Constructs a `Vector` at the origin.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\",\n \"file_path\": \"src/vector.rs\",\n \"rank\": 87,\n \"score\": 20.435943893036782\n },\n {\n \"content\": \" pub fn hsb<T: Into<Scalar>>(h: T, s: T, b: T) -> Self {\\n\\n Self::with_mode(Hsb, h, s, b)\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` with `hue`, `saturation`, `brightness` and `alpha`.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::hsba(126.0, 80.0, 50.0, 0.5);\\n\\n /// assert_eq!(c.channels(), [25, 128, 36, 128]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn hsba<T: Into<Scalar>>(h: T, s: T, b: T, a: T) -> Self {\\n\\n Self::with_mode_alpha(Hsb, h, s, b, a)\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` with `hue`, `saturation`, `lightness` and max `alpha`.\\n\\n ///\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 88,\n \"score\": 20.323609059500974\n },\n {\n \"content\": \" /// ```\\n\\n #[doc(alias = \\\"new\\\")]\\n\\n #[inline]\\n\\n pub const fn rgb(r: u8, g: u8, b: u8) -> Self {\\n\\n Self {\\n\\n mode: Rgb,\\n\\n channels: [r, g, b, 255],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Constructs a `Color` with `red`, `green`, `blue` and `alpha`.\\n\\n ///\\n\\n /// Alias for [Color::new_alpha].\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// let c = Color::rgba(128, 64, 128, 128);\\n\\n /// assert_eq!(c.channels(), [128, 64, 128, 128]);\\n\",\n \"file_path\": \"src/color.rs\",\n \"rank\": 89,\n \"score\": 20.28953012957487\n },\n {\n \"content\": \"#[must_use]\\n\\n#[derive(Debug)]\\n\\npub struct WindowBuilder<'a> {\\n\\n state: &'a mut PixState,\\n\\n settings: RendererSettings,\\n\\n}\\n\\n\\n\\nimpl<'a> WindowBuilder<'a> {\\n\\n /// Creates a new `WindowBuilder` instance.\\n\\n #[inline]\\n\\n pub fn new(s: &'a mut PixState) -> Self {\\n\\n let vsync = s.renderer.vsync();\\n\\n Self {\\n\\n state: s,\\n\\n settings: RendererSettings {\\n\\n vsync,\\n\\n ..RendererSettings::default()\\n\\n },\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/window.rs\",\n \"rank\": 90,\n \"score\": 20.26378901489666\n },\n {\n \"content\": \"use pix_engine::prelude::*;\\n\\n\\n\\nconst WIDTH: u32 = 800;\\n\\nconst HEIGHT: u32 = 800;\\n\\n\\n\",\n \"file_path\": \"examples/textures.rs\",\n \"rank\": 91,\n \"score\": 20.254976705061942\n },\n {\n \"content\": \"use anyhow::anyhow;\\n\\nuse pix_engine::prelude::*;\\n\\nuse std::{env, path::Path};\\n\\n\\n\\nconst WIDTH: u32 = 800;\\n\\nconst HEIGHT: u32 = 600;\\n\\n\\n\",\n \"file_path\": \"examples/image.rs\",\n \"rank\": 92,\n \"score\": 20.24222578567781\n },\n {\n \"content\": \"impl Default for Theme {\\n\\n fn default() -> Self {\\n\\n Self::dark()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Theme {\\n\\n /// Constructs a default [Builder] which can build a `Theme` instance.\\n\\n ///\\n\\n /// See [Builder] for examples.\\n\\n #[inline]\\n\\n pub fn builder() -> Builder {\\n\\n Builder::default()\\n\\n }\\n\\n\\n\\n /// Constructs a default dark `Theme`.\\n\\n #[inline]\\n\\n pub fn dark() -> Self {\\n\\n Self {\\n\\n name: \\\"Dark\\\".into(),\\n\",\n \"file_path\": \"src/gui/theme.rs\",\n \"rank\": 93,\n \"score\": 20.200817094804798\n },\n {\n \"content\": \" };\\n\\n}\\n\\n\\n\\nimpl<T> Rect<T> {\\n\\n /// Constructs a `Rect` at position `(x, y)` with `width` and `height`.\\n\\n pub const fn new(x: T, y: T, width: T, height: T) -> Self {\\n\\n Self([x, y, width, height])\\n\\n }\\n\\n\\n\\n /// Constructs a square `Rect` at position `(x, y)` with `size`.\\n\\n pub fn square(x: T, y: T, size: T) -> Self\\n\\n where\\n\\n T: Copy,\\n\\n {\\n\\n Self::new(x, y, size, size)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy> Rect<T> {\\n\\n /// Returns `Rect` as `[x, y, width, height]`.\\n\",\n \"file_path\": \"src/shape/rect.rs\",\n \"rank\": 94,\n \"score\": 20.182690966227035\n },\n {\n \"content\": \" /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\\n\\n /// if s.mouse_pressed() {\\n\\n /// s.background(Color::random());\\n\\n /// }\\n\\n /// Ok(())\\n\\n /// }\\n\\n /// # }\\n\\n /// ```\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub fn mouse_pressed(&self) -> bool {\\n\\n self.ui.mouse.is_pressed()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 95,\n \"score\": 20.167493082169713\n },\n {\n \"content\": \" /// }\\n\\n /// Ok(())\\n\\n /// }\\n\\n /// # }\\n\\n /// ```\\n\\n #[inline]\\n\\n #[must_use]\\n\\n pub fn key_pressed(&self) -> bool {\\n\\n self.ui.keys.is_pressed()\\n\\n }\\n\\n\\n\\n /// Returns if a specific [Key] is currently being held.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// ```\\n\\n /// # use pix_engine::prelude::*;\\n\\n /// # struct App;\\n\\n /// # impl AppState for App {\\n\\n /// fn on_update(&mut self, s: &mut PixState) -> PixResult<()> {\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 96,\n \"score\": 20.167493082169713\n },\n {\n \"content\": \"impl<T> Vector<T, 2> {\\n\\n /// Constructs a `Vector` from individual x/y coordinates.\\n\\n #[inline]\\n\\n pub const fn from_xy(x: T, y: T) -> Self {\\n\\n Self([x, y])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Vector<T, 3> {\\n\\n /// Constructs a `Vector` from individual x/y/z coordinates.\\n\\n #[inline]\\n\\n pub const fn from_xyz(x: T, y: T, z: T) -> Self {\\n\\n Self([x, y, z])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Num + Float> Vector<T, 2> {\\n\\n /// Constructs a `Vector` from another `Vector`, rotated by an `angle`.\\n\\n ///\\n\\n /// # Example\\n\",\n \"file_path\": \"src/vector.rs\",\n \"rank\": 97,\n \"score\": 20.064016559529737\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Set window dimensions.\\n\\n pub fn with_dimensions(&mut self, width: u32, height: u32) -> &mut Self {\\n\\n self.settings.width = width;\\n\\n self.settings.height = height;\\n\\n self\\n\\n }\\n\\n\\n\\n /// Scales the window.\\n\\n pub fn scale(&mut self, x: f32, y: f32) -> &mut Self {\\n\\n self.settings.scale_x = x;\\n\\n self.settings.scale_y = y;\\n\\n self\\n\\n }\\n\\n\\n\\n /// Set audio sample rate.\\n\\n pub fn audio_sample_rate(&mut self, sample_rate: i32) -> &mut Self {\\n\\n self.settings.audio_sample_rate = sample_rate;\\n\\n self\\n\",\n \"file_path\": \"src/engine.rs\",\n \"rank\": 98,\n \"score\": 19.992916105506414\n },\n {\n \"content\": \"use pix_engine::{math::map, prelude::*};\\n\\n\\n\\nconst WIDTH: u32 = 800;\\n\\nconst HEIGHT: u32 = 600;\\n\\nconst SIZE: u32 = 4;\\n\\n\\n\",\n \"file_path\": \"examples/colors.rs\",\n \"rank\": 99,\n \"score\": 19.964084066232445\n }\n]","isConversational":false}}},{"rowIdx":1198,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"PLs/Rust/Slns/Simple-Windows-RS-Window/src/main.rs"},"repo_name":{"kind":"string","value":"QubitTooLate/How-To-Make-A-Win32-Window"},"commit":{"kind":"string","value":"2593bf0192bc361490a957eb3b6b5d2c23bed11b"},"file_code":{"kind":"string","value":"\n\nuse bindings::{\n Windows::Win32::{\n Foundation::*,\n UI::WindowsAndMessaging::*,\n System::LibraryLoader::{\n GetModuleHandleA,\n },\n },\n};\n\nuse windows::*;\n\nfn main() -> Result<()> {\n let mut window = Win3Window::new()?;\n window.run()\n}\n\nstruct Win3Window {\n handle: HWND\n}\n\nimpl Win3Window {\n fn new() -> Result<Self> {\n Ok(Win3Window {\n handle: HWND(0)\n })\n }\n\n fn procedure(&mut self, window_handle: HWND, message: u32, w: WPARAM, l: LPARAM) -> LRESULT {\n unsafe {\n match message {\n WM_CLOSE => {\n DestroyWindow(window_handle);\n LRESULT(0)\n }\n WM_DESTROY => {\n PostQuitMessage(0);\n LRESULT(0)\n }\n _ => DefWindowProcA(window_handle, message, w, l),\n }\n }\n }\n\n fn run(&mut self) -> Result<()> {\n unsafe {\n let instance = GetModuleHandleA(None);\n debug_assert!(instance.0 != 0);\n\n let wc = WNDCLASSA {\n hCursor: LoadCursorW(None, IDC_ARROW),\n hInstance: instance,\n lpszClassName: PSTR(b\"window\\0\".as_ptr() as _),\n lpfnWndProc: Some(Self::window_procedure),\n ..Default::default()\n };\n\n let atom = RegisterClassA(&wc);\n debug_assert!(atom != 0);\n\n let handle = CreateWindowExA(\n Default::default(),\n \"window\",\n \"Sample Window\",\n WS_OVERLAPPEDWINDOW | WS_VISIBLE,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n None,\n None,\n instance,\n self as *mut _ as _,\n );\n\n debug_assert!(handle.0 != 0);\n debug_assert!(handle == self.handle);\n\n let mut msg = MSG::default();\n /*while msg.message != WM_QUIT {\n if PeekMessageA(&mut msg, None, 0, 0, PM_REMOVE).into() {\n DispatchMessageA(&msg);\n } else {\n let result = self.no_message_handler();\n if result.is_err() {\n return result;\n }\n }\n }*/\n while GetMessageA(&mut msg, None, 0, 0).into() {\n DispatchMessageA(&msg);\n }\n\n Ok(())\n }\n }\n\n /*fn no_message_handler(&mut self) -> Result<()> {\n Ok(())\n }*/\n\n extern \"system\" fn window_procedure(\n window_handle: HWND,\n message: u32,\n w: WPARAM,\n l: LPARAM,\n ) -> LRESULT {\n unsafe {\n let this : *mut Self;\n \n if message == WM_NCCREATE {\n let create_struct = l.0 as *const CREATESTRUCTA;\n this = (*create_struct).lpCreateParams as *mut Self;\n (*this).handle = window_handle;\n\n SetWindowLong(window_handle, GWLP_USERDATA, this as _);\n } else {\n this = GetWindowLong(window_handle, GWLP_USERDATA) as *mut Self;\n }\n\n if !this.is_null() {\n return (*this).procedure(window_handle, message, w, l);\n }\n\n DefWindowProcA(window_handle, message, w, l)\n }\n }\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"32\")]\nunsafe fn SetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX, value: isize) -> isize {\n SetWindowLongA(window, index, value as _) as _\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"64\")]\nunsafe fn SetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX, value: isize) -> isize {\n SetWindowLongPtrA(window, index, value)\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"32\")]\nunsafe fn GetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX) -> isize {\n GetWindowLongA(window, index) as _\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"64\")]\nunsafe fn GetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX) -> isize {\n GetWindowLongPtrA(window, index)\n}"},"prefix":{"kind":"string","value":"\n\nuse bindings::{\n Windows::Win32::{\n Foundation::*,\n UI::WindowsAndMessaging::*,\n System::LibraryLoader::{\n GetModuleHandleA,\n },\n },\n};\n\nuse windows::*;\n\nfn main() -> Result<()> {\n let mut window = Win3Window::new()?;\n window.run()\n}\n\nstruct Win3Window {\n handle: HWND\n}\n\nimpl Win3Window {\n fn new() -> Result<Self> {\n Ok(Win3Window {\n handle: HWND(0)\n })\n }\n\n fn procedure(&mut self, window_handle: HWND, message: u32, w: WPARAM, l: LPARAM) -> LRESULT {\n unsafe {\n match message {\n WM_CLOSE => {\n DestroyWindow(window_handle);\n "},"suffix":{"kind":"string","value":"handle, message, w, l);\n }\n\n DefWindowProcA(window_handle, message, w, l)\n }\n }\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"32\")]\nunsafe fn SetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX, value: isize) -> isize {\n SetWindowLongA(window, index, value as _) as _\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"64\")]\nunsafe fn SetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX, value: isize) -> isize {\n SetWindowLongPtrA(window, index, value)\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"32\")]\nunsafe fn GetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX) -> isize {\n GetWindowLongA(window, index) as _\n}\n\n#[allow(non_snake_case)]\n#[cfg(target_pointer_width = \"64\")]\nunsafe fn GetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX) -> isize {\n GetWindowLongPtrA(window, index)\n}"},"middle":{"kind":"string","value":"LRESULT(0)\n }\n WM_DESTROY => {\n PostQuitMessage(0);\n LRESULT(0)\n }\n _ => DefWindowProcA(window_handle, message, w, l),\n }\n }\n }\n\n fn run(&mut self) -> Result<()> {\n unsafe {\n let instance = GetModuleHandleA(None);\n debug_assert!(instance.0 != 0);\n\n let wc = WNDCLASSA {\n hCursor: LoadCursorW(None, IDC_ARROW),\n hInstance: instance,\n lpszClassName: PSTR(b\"window\\0\".as_ptr() as _),\n lpfnWndProc: Some(Self::window_procedure),\n ..Default::default()\n };\n\n let atom = RegisterClassA(&wc);\n debug_assert!(atom != 0);\n\n let handle = CreateWindowExA(\n Default::default(),\n \"window\",\n \"Sample Window\",\n WS_OVERLAPPEDWINDOW | WS_VISIBLE,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n CW_USEDEFAULT,\n None,\n None,\n instance,\n self as *mut _ as _,\n );\n\n debug_assert!(handle.0 != 0);\n debug_assert!(handle == self.handle);\n\n let mut msg = MSG::default();\n /*while msg.message != WM_QUIT {\n if PeekMessageA(&mut msg, None, 0, 0, PM_REMOVE).into() {\n DispatchMessageA(&msg);\n } else {\n let result = self.no_message_handler();\n if result.is_err() {\n return result;\n }\n }\n }*/\n while GetMessageA(&mut msg, None, 0, 0).into() {\n DispatchMessageA(&msg);\n }\n\n Ok(())\n }\n }\n\n /*fn no_message_handler(&mut self) -> Result<()> {\n Ok(())\n }*/\n\n extern \"system\" fn window_procedure(\n window_handle: HWND,\n message: u32,\n w: WPARAM,\n l: LPARAM,\n ) -> LRESULT {\n unsafe {\n let this : *mut Self;\n \n if message == WM_NCCREATE {\n let create_struct = l.0 as *const CREATESTRUCTA;\n this = (*create_struct).lpCreateParams as *mut Self;\n (*this).handle = window_handle;\n\n SetWindowLong(window_handle, GWLP_USERDATA, this as _);\n } else {\n this = GetWindowLong(window_handle, GWLP_USERDATA) as *mut Self;\n }\n\n if !this.is_null() {\n return (*this).procedure(window_"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1199,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"lamp_asm_parser/src/lexer.rs"},"repo_name":{"kind":"string","value":"ElFamosoKilluaah/lamp"},"commit":{"kind":"string","value":"4a879129118a798de6d2ba05b5e39a0f0663649b"},"file_code":{"kind":"string","value":"use lamp_common::op::{get_op, Opcode};\n\n#[derive(Debug, Copy, Clone, PartialEq)]\npub enum TokenType {\n \n Opcode(Opcode),\n \n Num8(u8),\n \n Ptr8(u8),\n}\n\n#[derive(Debug)]\npub enum LexerError {\n UnexpectedToken(usize, String),\n InvalidMnemonic(usize, String),\n InvalidLine(usize),\n}\n\nimpl std::fmt::Display for LexerError {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n match self {\n /* at + 1 because at is an array/vec index */\n Self::InvalidLine(at) => {\n write!(f, \"Line {} contains one or more invalid tokens\", at + 1)\n }\n Self::UnexpectedToken(at, tkn) => {\n write!(f, \"Unexpected token at line {}: \\'{}\\'\", at + 1, tkn)\n }\n Self::InvalidMnemonic(at, mnemonic) => {\n write!(f, \"Invalid mnemonic at line {}: \\'{}\\'\", at + 1, mnemonic)\n }\n }\n }\n}\n\npub struct Lexer;\n\n#[derive(PartialEq, Debug)]\npub struct TokenizedLine {\n pub opcode: Opcode,\n pub operands: Vec<TokenType>,\n}\n\nimpl TokenizedLine {\n pub fn empty() -> Self {\n TokenizedLine {\n opcode: Opcode::NOP,\n operands: vec![],\n }\n }\n}\n\nimpl Lexer {\n #[allow(clippy::new_without_default)]\n pub fn new() -> Self {\n Self {}\n }\n\n #[allow(clippy::ptr_arg)]\n pub fn tokenize(&self, content: &Vec<String>) -> Result<Vec<TokenizedLine>, Vec<LexerError>> {\n let mut tokenized = Vec::<TokenizedLine>::new();\n let mut errors = Vec::<LexerError>::new();\n\n #[allow(clippy::needless_range_loop)]\n for i in 0..content.len() {\n if content[i].starts_with(lamp_common::constants::COMMENT_MARKER) {\n continue;\n }\n match self.tokenize_line(&content[i], i) {\n Ok(tkn) => {\n if errors.is_empty() {\n tokenized.push(tkn);\n }\n }\n Err(e) => errors.push(e),\n }\n }\n if errors.is_empty() {\n return Ok(tokenized);\n }\n Err(errors)\n }\n\n \n pub fn tokenize_line(&self, line: &str, line_num: usize) -> Result<TokenizedLine, LexerError> {\n if let Some(index) = line.find(' ') {\n let to_tokenize = line.split_at(index);\n \n let mut tokenized = TokenizedLine::empty();\n if let Ok(opcode) = get_op(to_tokenize.0.to_owned()) {\n tokenized.opcode = opcode;\n\n match self.tokenize_operands(to_tokenize.1.to_owned(), line_num) {\n Ok(tkns) => {\n tokenized.operands = tkns;\n Ok(tokenized)\n }\n Err(e) => Err(e),\n }\n } else {\n Err(LexerError::InvalidMnemonic(\n line_num,\n to_tokenize.0.to_owned(),\n ))\n }\n } else {\n Err(LexerError::InvalidLine(line_num))\n }\n }\n \n pub fn tokenize_operands(\n &self,\n line: String,\n line_num: usize,\n ) -> Result<Vec<TokenType>, LexerError> {\n let to_tokenize: Vec<&str> = line.split(',').collect();\n let mut tokens = Vec::<TokenType>::new();\n\n for tkn in to_tokenize {\n let tkn = tkn.split_whitespace().next();\n match tkn {\n Some(tkn) => match self.from_number_to_token(tkn.to_string(), line_num) {\n Ok(tok) => tokens.push(tok),\n Err(e) => return Err(e),\n },\n None => break,\n }\n }\n Ok(tokens)\n }\n\n \n pub fn from_number_to_token(&self, tkn: String, line: usize) -> Result<TokenType, LexerError> {\n let split = &tkn.split_at(1);\n\n match split.1.parse::<u8>() {\n Ok(number) => match split.0 {\n \"#\" => Ok(TokenType::Num8(number)),\n \"$\" => Ok(TokenType::Ptr8(number)),\n other => Err(LexerError::UnexpectedToken(line, other.to_owned())),\n },\n Err(_) => Err(LexerError::UnexpectedToken(line, tkn)),\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use lamp_common::op::{get_op, Opcode};\n\n#[derive(Debug, Copy, Clone, PartialEq)]\npub enum TokenType {\n \n Opcode(Opcode),\n \n Num8(u8),\n \n Ptr8(u8),\n}\n\n#[derive(Debug)]\npub enum LexerError {\n UnexpectedToken(usize, String),\n InvalidMnemonic(usize, String),\n InvalidLine(usize),\n}\n\nimpl std::fmt::Display for LexerError {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n match self {\n /* at + 1 because at is an array/vec index */\n Self::InvalidLine(at) => {\n write!(f, \"Line {} contains one or more invalid tokens\", at + 1)\n }\n Self::UnexpectedToken(at, tkn) => {\n write!(f, \"Unexpected token at line {}: \\'{}\\"},"suffix":{"kind":"string","value":"e>::new();\n let mut errors = Vec::<LexerError>::new();\n\n #[allow(clippy::needless_range_loop)]\n for i in 0..content.len() {\n if content[i].starts_with(lamp_common::constants::COMMENT_MARKER) {\n continue;\n }\n match self.tokenize_line(&content[i], i) {\n Ok(tkn) => {\n if errors.is_empty() {\n tokenized.push(tkn);\n }\n }\n Err(e) => errors.push(e),\n }\n }\n if errors.is_empty() {\n return Ok(tokenized);\n }\n Err(errors)\n }\n\n \n pub fn tokenize_line(&self, line: &str, line_num: usize) -> Result<TokenizedLine, LexerError> {\n if let Some(index) = line.find(' ') {\n let to_tokenize = line.split_at(index);\n \n let mut tokenized = TokenizedLine::empty();\n if let Ok(opcode) = get_op(to_tokenize.0.to_owned()) {\n tokenized.opcode = opcode;\n\n match self.tokenize_operands(to_tokenize.1.to_owned(), line_num) {\n Ok(tkns) => {\n tokenized.operands = tkns;\n Ok(tokenized)\n }\n Err(e) => Err(e),\n }\n } else {\n Err(LexerError::InvalidMnemonic(\n line_num,\n to_tokenize.0.to_owned(),\n ))\n }\n } else {\n Err(LexerError::InvalidLine(line_num))\n }\n }\n \n pub fn tokenize_operands(\n &self,\n line: String,\n line_num: usize,\n ) -> Result<Vec<TokenType>, LexerError> {\n let to_tokenize: Vec<&str> = line.split(',').collect();\n let mut tokens = Vec::<TokenType>::new();\n\n for tkn in to_tokenize {\n let tkn = tkn.split_whitespace().next();\n match tkn {\n Some(tkn) => match self.from_number_to_token(tkn.to_string(), line_num) {\n Ok(tok) => tokens.push(tok),\n Err(e) => return Err(e),\n },\n None => break,\n }\n }\n Ok(tokens)\n }\n\n \n pub fn from_number_to_token(&self, tkn: String, line: usize) -> Result<TokenType, LexerError> {\n let split = &tkn.split_at(1);\n\n match split.1.parse::<u8>() {\n Ok(number) => match split.0 {\n \"#\" => Ok(TokenType::Num8(number)),\n \"$\" => Ok(TokenType::Ptr8(number)),\n other => Err(LexerError::UnexpectedToken(line, other.to_owned())),\n },\n Err(_) => Err(LexerError::UnexpectedToken(line, tkn)),\n }\n }\n}\n"},"middle":{"kind":"string","value":"'\", at + 1, tkn)\n }\n Self::InvalidMnemonic(at, mnemonic) => {\n write!(f, \"Invalid mnemonic at line {}: \\'{}\\'\", at + 1, mnemonic)\n }\n }\n }\n}\n\npub struct Lexer;\n\n#[derive(PartialEq, Debug)]\npub struct TokenizedLine {\n pub opcode: Opcode,\n pub operands: Vec<TokenType>,\n}\n\nimpl TokenizedLine {\n pub fn empty() -> Self {\n TokenizedLine {\n opcode: Opcode::NOP,\n operands: vec![],\n }\n }\n}\n\nimpl Lexer {\n #[allow(clippy::new_without_default)]\n pub fn new() -> Self {\n Self {}\n }\n\n #[allow(clippy::ptr_arg)]\n pub fn tokenize(&self, content: &Vec<String>) -> Result<Vec<TokenizedLine>, Vec<LexerError>> {\n let mut tokenized = Vec::<TokenizedLin"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn get_op<'a>(base: String) -> Result<Opcode, &'a str> {\n\n for (opcode, name) in OPCODES_STRINGS {\n\n if base.to_uppercase().contains(name) {\n\n return Ok(*opcode);\n\n }\n\n }\n\n\n\n Err(\"No opcode found.\")\n\n}\n","file_path":"lamp_common/src/op.rs","rank":0,"score":98568.56267563705},{"content":"pub fn decode_opcode(val: u8) -> Option<Opcode> {\n\n for code in OPCODES {\n\n if *code as u8 == val {\n\n return Some(*code);\n\n }\n\n }\n\n None\n\n}\n\n\n","file_path":"lamp_common/src/op.rs","rank":1,"score":80349.9699243368},{"content":"pub fn decode_opcode(val: u8) -> Result<Opcode, VMError> {\n\n match get_op(val) {\n\n Some(opcode) => Ok(opcode),\n\n None => Err(VMError::InvalidOpcodeError),\n\n }\n\n}\n","file_path":"lamp_vm/src/base/opcodes.rs","rank":2,"score":78681.53566486659},{"content":"pub fn parse_cmd(string: &str) -> Option<Box<dyn DebugCommand>> {\n\n for command in get_cmds() {\n\n if string.contains(command.name()) {\n\n return Some(command);\n\n }\n\n }\n\n None\n\n}\n","file_path":"lamp_vm/src/debug/commands/mod.rs","rank":3,"score":74522.69299403456},{"content":"#[test]\n\npub fn vm_add_test() {\n\n let bin = vec![\n\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\n\n 15, 13, 15, 15,\n\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\n\n 15, 14, 16, 16,\n\n // ADD 13, 14, 15: Put in the register 15 the result of the register 13 + the register 14\n\n 1, 13, 14, 15,\n\n ];\n\n\n\n let mut vm = VM::new(bin);\n\n let _ = vm.run();\n\n let expected_value = ((15 << 8) | 15) + ((16 << 8) | 16);\n\n assert_eq!(*vm.get_register(15), expected_value);\n\n}\n\n\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":4,"score":59956.84941734788},{"content":"#[test]\n\npub fn vm_mul_test() {\n\n let bin = vec![\n\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\n\n 15, 13, 15, 15,\n\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\n\n 15, 14, 16, 16,\n\n // MUL 13, 14, 15: Put in the register 15 the result of the register 13 * the register 14\n\n 3, 13, 14, 15,\n\n ];\n\n\n\n let mut vm = VM::new(bin);\n\n let _ = vm.run();\n\n let expected_value = ((15 << 8) | 15) * ((16 << 8) | 16);\n\n assert_eq!(*vm.get_register(15), expected_value);\n\n}\n\n\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":5,"score":59956.84941734788},{"content":"#[test]\n\npub fn vm_load_test() {\n\n let bin = vec![\n\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\n\n 15, 13, 15, 15,\n\n ];\n\n let mut vm = VM::new(bin);\n\n let _ = vm.run();\n\n let expected_value = (15 << 8) | 15;\n\n assert_eq!(*vm.get_register(13), expected_value);\n\n}\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":6,"score":59956.84941734788},{"content":"#[test]\n\npub fn vm_mod_test() {\n\n let bin = vec![\n\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\n\n 15, 13, 15, 15,\n\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\n\n 15, 14, 16, 16,\n\n // MOD 13, 14, 15: Put in the register 15 the result of the register 13 / the register 14. The remainder goes into a special register\n\n 4, 13, 14, 15,\n\n ];\n\n\n\n let mut vm = VM::new(bin);\n\n let _ = vm.run();\n\n let expected_value = ((15 << 8) | 15) / ((16 << 8) | 16);\n\n assert_eq!(*vm.get_register(15), expected_value);\n\n}\n\n\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":7,"score":59956.84941734788},{"content":"#[test]\n\npub fn vm_sub_test() {\n\n let bin = vec![\n\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\n\n 15, 13, 15, 15,\n\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\n\n 15, 14, 16, 16,\n\n // SUB 13, 14, 15: Put in the register 15 the result of the register 13 - the register 14\n\n 2, 13, 14, 15,\n\n ];\n\n\n\n let mut vm = VM::new(bin);\n\n let _ = vm.run();\n\n let expected_value = ((15 << 8) | 15) - ((16 << 8) | 16);\n\n assert_eq!(*vm.get_register(15), expected_value);\n\n}\n\n\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":8,"score":59956.84941734788},{"content":"#[cfg(test)]\n\npub fn registers_dump(vm: &VM) {\n\n for i in 0..32 {\n\n println!(\"Register {}: {}\", &i, vm.get_register(i));\n\n }\n\n}\n\n\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":9,"score":55543.20305803565},{"content":"pub fn get_cmds() -> Vec<Box<dyn DebugCommand>> {\n\n vec![\n\n Box::new(regdump::RegdumpCommand {}),\n\n Box::new(setpc::SetPcCommand {}),\n\n Box::new(step::StepCommand {}),\n\n ]\n\n}\n\n\n","file_path":"lamp_vm/src/debug/commands/mod.rs","rank":10,"score":50225.23291887318},{"content":"fn main() {\n\n let lamp = LampApp::from_args();\n\n simple_logger::init().unwrap();\n\n let bin = std::fs::read(&lamp.bin_path);\n\n\n\n match bin {\n\n Ok(v) => {\n\n if lamp.debug {\n\n info!(\"Debug session started.\");\n\n let mut debug_session = DebugSession::new(VM::new(v));\n\n debug_session.start_debug_session();\n\n info!(\"Debug session ended.\");\n\n return;\n\n }\n\n\n\n let mut lamp_vm = VM::new(v);\n\n let exit_status = lamp_vm.run();\n\n\n\n match exit_status {\n\n Ok(code) => info!(\"VM exited successfully (code {})\", code),\n\n Err(e) => error!(\"VM exited with an error.\\nReason: {:?}\", e),\n\n }\n\n }\n\n Err(e) => error!(\"Unable to read the binary's content: {:?}\", e),\n\n }\n\n\n\n info!(\"VM Shutdown.\");\n\n}\n","file_path":"lamp_vm/src/main.rs","rank":11,"score":32772.13810951068},{"content":"fn main() {\n\n let args = LampAsm::from_args();\n\n\n\n let mut file = File::open(&args.source);\n\n\n\n match file {\n\n Ok(ref mut file) => {\n\n let mut buffer = String::new();\n\n match file.read_to_string(&mut buffer) {\n\n Ok(k) => {\n\n println!(\"Source file size is {} bytes.\", k);\n\n let lines = buffer.split('\\n').map(|s| s.to_string()).collect();\n\n\n\n let mut compiler = Compiler::new(lines);\n\n match compiler.compile() {\n\n Ok(bin_size) => {\n\n println!(\"Output's size is {} bytes.\", bin_size);\n\n match write_output(&args.output, compiler.result_buffer) {\n\n Ok(_) => println!(\"Compilation successfully ended.\"),\n\n Err(e) => println!(\n","file_path":"lamp_assembler/src/main.rs","rank":12,"score":32772.13810951068},{"content":"pub trait DebugCommand {\n\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize;\n\n fn name(&self) -> &str;\n\n fn description(&self) -> &str;\n\n fn syntax(&self) -> &str;\n\n fn display_error(&self) {\n\n error!(\n\n \"Error: too much/not enough arguments.\\nUsage: {}\",\n\n self.syntax()\n\n );\n\n }\n\n}\n","file_path":"lamp_vm/src/debug/commands/command_base.rs","rank":13,"score":31391.543955042245},{"content":"#[test]\n\nfn test_parse() {\n\n let to_parse = \"LOAD #30, #20, #16\";\n\n let lexer = Lexer::new();\n\n\n\n let res = lexer.tokenize_line(to_parse, 1);\n\n\n\n assert_eq!(res.is_ok(), true);\n\n\n\n let expected = TokenizedLine {\n\n opcode: Opcode::LOAD,\n\n operands: vec![\n\n TokenType::Num8(30),\n\n TokenType::Num8(20),\n\n TokenType::Num8(16),\n\n ],\n\n };\n\n\n\n assert_eq!(res.unwrap(), expected);\n\n}\n\n\n","file_path":"lamp_asm_parser/src/tests.rs","rank":14,"score":31357.23488130705},{"content":"#[test]\n\nfn test_parse_error() {\n\n let to_parse = \"ZIZI #30, '0, #caca\";\n\n let lexer = Lexer::new();\n\n\n\n let res = lexer.tokenize_line(to_parse, 1);\n\n\n\n assert_eq!(res.is_err(), true);\n\n}\n","file_path":"lamp_asm_parser/src/tests.rs","rank":15,"score":30712.83341891786},{"content":"use super::vm::VMError;\n\nuse lamp_common::op::{decode_opcode as get_op, Opcode};\n\n\n","file_path":"lamp_vm/src/base/opcodes.rs","rank":16,"score":24321.019071703566},{"content":"use lamp_asm_parser::lexer::{Lexer, LexerError, TokenType, TokenizedLine};\n\n\n\npub struct Compiler {\n\n origin: Vec<String>,\n\n pub result_buffer: Vec<u8>,\n\n}\n\n\n\nimpl Compiler {\n\n pub fn new(origin: Vec<String>) -> Self {\n\n Self {\n\n origin,\n\n result_buffer: vec![],\n\n }\n\n }\n\n\n\n pub fn compile(&mut self) -> Result<usize, Vec<LexerError>> {\n\n let tokenization = Lexer::new().tokenize(&self.origin);\n\n\n\n match tokenization {\n\n Ok(tokenized_lines) => {\n","file_path":"lamp_assembler/src/compiler.rs","rank":19,"score":15.920766295847113},{"content":"pub enum VMError {\n\n InvalidOpcodeError,\n\n UnexpectedTokenError,\n\n // More errors will be added\n\n}\n\n\n\nimpl VM {\n\n pub fn new(binary: Vec<u8>) -> Self {\n\n Self {\n\n bin: binary,\n\n pc: 0,\n\n registers: [0; 32],\n\n modulo_remainder: 0,\n\n eq_flag: false,\n\n }\n\n }\n\n\n\n // Runs the full binary.\n\n pub fn run(&mut self) -> VMResult {\n\n let mut result;\n","file_path":"lamp_vm/src/base/vm.rs","rank":22,"score":13.892310805408497},{"content":" for line in tokenized_lines {\n\n let buff = self.compile_token(line);\n\n\n\n for byte in buff {\n\n self.result_buffer.push(byte);\n\n }\n\n }\n\n }\n\n Err(e) => return Err(e),\n\n }\n\n Ok(self.result_buffer.len())\n\n }\n\n\n\n pub fn compile_token(&mut self, token: TokenizedLine) -> Vec<u8> {\n\n let mut returned_vec = Vec::<u8>::new();\n\n\n\n returned_vec.push(token.opcode as u8);\n\n // Should be changed later\n\n for operand in token.operands {\n\n match operand {\n\n TokenType::Num8(n) => returned_vec.push(n),\n\n TokenType::Ptr8(n) => returned_vec.push(n),\n\n TokenType::Opcode(_) => panic!(\"Should never happen: Unexpected opcode found\"),\n\n }\n\n }\n\n returned_vec\n\n }\n\n}\n","file_path":"lamp_assembler/src/compiler.rs","rank":24,"score":12.090504720564759},{"content":"use crate::lexer::{Lexer, TokenType, TokenizedLine};\n\nuse lamp_common::op::Opcode;\n\n\n\n#[test]\n","file_path":"lamp_asm_parser/src/tests.rs","rank":27,"score":9.755983189795867},{"content":"use super::commands;\n\nuse crate::base::vm::VM;\n\nuse log::{error, info};\n\nuse std::io;\n\nuse std::io::Write;\n\n\n\npub struct DebugSession {\n\n vm: VM,\n\n}\n\n\n\nimpl DebugSession {\n\n pub fn new(vm: VM) -> Self {\n\n Self { vm }\n\n }\n\n\n\n pub fn start_debug_session(&mut self) {\n\n info!(\"Starting debug session.\");\n\n loop {\n\n print!(\"\\n>>> \");\n\n let _ = io::stdout().flush();\n","file_path":"lamp_vm/src/debug/session.rs","rank":28,"score":9.500998141163112},{"content":" loop {\n\n result = self.cycle();\n\n\n\n if self.pc >= self.bin.len() {\n\n break;\n\n }\n\n }\n\n result\n\n }\n\n\n\n // One VM's cycle.\n\n // It does:\n\n // -The opcode decoding\n\n // -The opcode execution\n\n // - Error handling\n\n pub fn cycle(&mut self) -> VMResult {\n\n let opcode = self.next_8_bits();\n\n let outcoming_result: VMResult;\n\n\n\n match decode_opcode(opcode) {\n","file_path":"lamp_vm/src/base/vm.rs","rank":29,"score":9.077156438262511},{"content":"macro_rules! opcodes {\n\n { $($variant: ident = $value: expr, op = $operands: expr),+$(,)? } =>\n\n {\n\n #[repr(u8)]\n\n #[derive(Debug, Copy, Clone, PartialEq)]\n\n pub enum Opcode {\n\n $($variant = $value),+,\n\n }\n\n pub const OPCODES: &'static [Opcode] = &[$(Opcode::$variant),*];\n\n pub const OPCODES_OPERANDS: &'static [(Opcode, usize)] = &[$((Opcode::$variant , $operands)),*];\n\n pub const OPCODES_STRINGS: &'static [(Opcode, &str)] = &[$((Opcode::$variant , stringify!(Opcode::$variant))),*];\n\n }\n\n}\n\n// First number is the mnemonic's ID.\n\n// op is the number of operands the mnemonic needs\n\nopcodes! {\n\n // Arithmetical instructions\n\n ADD = 1, op = 3,\n\n SUB = 2, op = 3,\n\n MUL = 3, op = 3,\n","file_path":"lamp_common/src/op.rs","rank":30,"score":8.670641829823012},{"content":" let mut command_line = String::new();\n\n\n\n io::stdin()\n\n .read_line(&mut command_line)\n\n .map_err(|e| {\n\n error!(\"Unable to read line: {:?}\", e);\n\n })\n\n .unwrap();\n\n\n\n command_line = String::from(command_line.trim());\n\n match commands::parse_cmd(&command_line) {\n\n Some(cmd) => {\n\n let res = cmd.execute(&mut self.vm, command_line.split(' ').collect());\n\n info!(\"Command reported the {} result.\", res);\n\n },\n\n None => error!(\"This command doesn\\'t exist. type \\\"help\\\" for an exhaustive list of the available commands.\"),\n\n }\n\n }\n\n }\n\n}\n","file_path":"lamp_vm/src/debug/session.rs","rank":31,"score":8.293365861643398},{"content":"use super::opcodes::decode_opcode;\n\nuse lamp_common::op::Opcode;\n\nuse log::{error, info};\n\n\n\npub struct VM {\n\n // The binary VM has to execute\n\n bin: Vec<u8>,\n\n // The program counter, it's utility is to remind where we are in the program\n\n pc: usize,\n\n // Registers used to store i32 values the program needs\n\n registers: [i32; 32],\n\n // When modulo operation is done, the remainder is pushed here\n\n modulo_remainder: i32,\n\n // When an eq test is done, the result is pushed here\n\n eq_flag: bool,\n\n}\n\n\n\npub type VMResult = Result<i32, VMError>;\n\n\n\n#[derive(Debug, Copy, Clone, Eq, PartialEq)]\n","file_path":"lamp_vm/src/base/vm.rs","rank":32,"score":8.092192115360842},{"content":"use super::command_base::DebugCommand;\n\nuse crate::base::vm::VM;\n\nuse log::{error, info};\n\n\n\npub struct RegdumpCommand;\n\n\n\nimpl DebugCommand for RegdumpCommand {\n\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize {\n\n match args.get(1) {\n\n Some(arg) => {\n\n if arg == &\"all\" {\n\n for i in 0..32 {\n\n print!(\"|| {}: {}\", i, vm.get_register(i));\n\n }\n\n 0\n\n } else {\n\n match arg.parse::<u8>() {\n\n Ok(num) => {\n\n if num > 31 {\n\n error!(\"Error: wrong arg 2.\\nUsage: {}\", self.syntax());\n","file_path":"lamp_vm/src/debug/commands/regdump.rs","rank":33,"score":7.750795133172865},{"content":" }\n\n Ok(0)\n\n }\n\n\n\n // Sets the value of a register.\n\n pub fn set_register_value(&mut self, index: u8, val: i32) {\n\n let ptr = self.get_register_mut(index);\n\n *ptr = val;\n\n }\n\n\n\n // Gives a mutable register's reference, and verifies if the given register's index is valid.\n\n pub fn get_register_mut(&mut self, index: u8) -> &mut i32 {\n\n if index < 32 {\n\n &mut self.registers[index as usize]\n\n } else {\n\n error!(\n\n \"Register out of bounds. Expected 0 <= register_index < 32; got {}\",\n\n index\n\n );\n\n panic!(\n","file_path":"lamp_vm/src/base/vm.rs","rank":34,"score":7.611230979921988},{"content":"use super::command_base::DebugCommand;\n\nuse crate::base::vm::VM;\n\n\n\npub struct SetPcCommand;\n\n\n\nimpl DebugCommand for SetPcCommand {\n\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize {\n\n match args.get(1) {\n\n Some(arg) => match arg.parse::<usize>() {\n\n Ok(new_pc) => {\n\n vm.set_pc(new_pc);\n\n 0\n\n }\n\n Err(_) => {\n\n self.display_error();\n\n 1\n\n }\n\n },\n\n None => {\n\n self.display_error();\n","file_path":"lamp_vm/src/debug/commands/setpc.rs","rank":35,"score":7.519856188210014},{"content":"use super::command_base::DebugCommand;\n\nuse crate::base::vm::VM;\n\n\n\npub struct StepCommand;\n\n\n\nimpl DebugCommand for StepCommand {\n\n #[allow(unused_variables)]\n\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize {\n\n match vm.cycle() {\n\n Ok(_) => 0,\n\n Err(_) => 1,\n\n }\n\n }\n\n fn name(&self) -> &str {\n\n \"step\"\n\n }\n\n fn description(&self) -> &str {\n\n \"Makes 1 VM's cycle.\"\n\n }\n\n fn syntax(&self) -> &str {\n\n \"step\"\n\n }\n\n}\n","file_path":"lamp_vm/src/debug/commands/step.rs","rank":36,"score":7.255133802244771},{"content":" Ok(opcode) => outcoming_result = self.execute_instruction(opcode),\n\n Err(e) => {\n\n error!(\"VM's error happened. Aborting. \\n {:?}\", e);\n\n return Err(e);\n\n }\n\n }\n\n outcoming_result\n\n }\n\n\n\n // Executes the given opcode.\n\n // This function is just a giant match.\n\n pub fn execute_instruction(&mut self, opcode: Opcode) -> VMResult {\n\n match opcode {\n\n // Arithmetical instructions\n\n Opcode::ADD => {\n\n let val_1 = self.registers[self.next_8_bits() as usize];\n\n let val_2 = self.registers[self.next_8_bits() as usize];\n\n let result_register = self.next_8_bits();\n\n self.set_register_value(result_register, val_1 + val_2);\n\n }\n","file_path":"lamp_vm/src/base/vm.rs","rank":37,"score":6.860280078069135},{"content":"pub mod opcodes;\n\npub mod vm;\n","file_path":"lamp_vm/src/base/mod.rs","rank":38,"score":5.173928118479095},{"content":" \"Register out of bounds. Expected 0 <= register_index < 32; got {}\",\n\n index\n\n );\n\n }\n\n }\n\n\n\n pub fn get_register(&self, index: u8) -> &i32 {\n\n if index < 32 {\n\n &self.registers[index as usize]\n\n } else {\n\n error!(\n\n \"Register out of bounds. Expected 0 <= register_index < 32; got {}\",\n\n index\n\n );\n\n panic!(\n\n \"Register out of bounds. Expected 0 <= register_index < 32; got {}\",\n\n index\n\n );\n\n }\n\n }\n","file_path":"lamp_vm/src/base/vm.rs","rank":39,"score":4.844287377348658},{"content":"use base::vm::VM;\n\nuse debug::session::DebugSession;\n\nuse log::{error, info};\n\nuse std::path::PathBuf;\n\nuse structopt::StructOpt;\n\n\n\npub mod base;\n\npub mod debug;\n\n#[cfg(test)]\n\nmod tests;\n\n\n\n#[derive(StructOpt, Debug)]\n\n#[structopt(name = \"lamp\")]\n","file_path":"lamp_vm/src/main.rs","rank":40,"score":4.730143070392978},{"content":"pub mod command_base;\n\n\n\n// Commands modules declarations\n\npub mod regdump;\n\npub mod setpc;\n\npub mod step;\n\n\n\nuse command_base::DebugCommand;\n\n\n","file_path":"lamp_vm/src/debug/commands/mod.rs","rank":41,"score":4.6379293154321495},{"content":" // Grabs next 8 bits of the VM's binary\n\n // Stupid out of bounds error detected; should be fixed.\n\n pub fn next_8_bits(&mut self) -> u8 {\n\n self.pc += 1;\n\n self.bin[self.pc - 1]\n\n }\n\n\n\n // Grabs next 16 bytes of the VM's binary\n\n fn next_16_bits(&mut self) -> u16 {\n\n self.pc += 2;\n\n ((u16::from(self.bin[self.pc - 2])) << 8) | u16::from(self.bin[self.pc - 1])\n\n }\n\n\n\n pub fn set_pc(&mut self, new_pc: usize) -> usize {\n\n if new_pc > self.bin.len() {\n\n self.pc = new_pc;\n\n 0\n\n } else {\n\n error!(\n\n \"Tried to set the program counter to {} where the binary\\'s total size is {} bytes\",\n\n new_pc,\n\n self.bin.len()\n\n );\n\n 1\n\n }\n\n }\n\n}\n","file_path":"lamp_vm/src/base/vm.rs","rank":42,"score":3.6469902502493037},{"content":"use crate::compiler::Compiler;\n\nuse std::fs::File;\n\nuse std::io::BufWriter;\n\nuse std::io::Read;\n\nuse std::io::Write;\n\nuse std::path::PathBuf;\n\nuse structopt::StructOpt;\n\n\n\nmod compiler;\n\n\n\n#[derive(StructOpt, Debug)]\n\n#[structopt(name = \"lamp_asm\")]\n","file_path":"lamp_assembler/src/main.rs","rank":43,"score":3.0286398800139653},{"content":"use crate::base::vm::VM;\n\nuse log::error;\n\n\n","file_path":"lamp_vm/src/debug/commands/command_base.rs","rank":44,"score":2.9052744761761256},{"content":"pub mod op;\n\n\n\npub mod constants {\n\n // Do not ask me from where those values come from\n\n pub const LAMP_BIN_HEADER: &[u8] = &[69, 31, 17, 72];\n\n pub const COMMENT_MARKER: &str = \";\";\n\n}\n","file_path":"lamp_common/src/lib.rs","rank":45,"score":2.761613193816819},{"content":" }\n\n Opcode::NOP => {\n\n info!(\"NOP Opcode encountered, doing nothing.\");\n\n self.pc += 1;\n\n }\n\n Opcode::LOAD => {\n\n let register = self.next_8_bits();\n\n let value = self.next_16_bits() as i32;\n\n self.set_register_value(register, value);\n\n }\n\n Opcode::JMP => {\n\n let register = self.next_8_bits();\n\n let addr = *self.get_register(register);\n\n self.pc = addr as usize;\n\n }\n\n\n\n Opcode::MODR => {\n\n let register = self.next_8_bits();\n\n self.set_register_value(register, self.modulo_remainder);\n\n }\n","file_path":"lamp_vm/src/base/vm.rs","rank":46,"score":2.721929770807549},{"content":"pub mod commands;\n\npub mod session;\n","file_path":"lamp_vm/src/debug/mod.rs","rank":47,"score":2.7021939007470355},{"content":"use crate::base::vm::VM;\n\n\n\n#[test]\n","file_path":"lamp_vm/src/tests/vm_test.rs","rank":48,"score":2.4882956611043747},{"content":" let to_inc = self.next_8_bits() as usize;\n\n self.registers[to_inc] += 1;\n\n }\n\n Opcode::DEC => {\n\n let to_dec = self.next_8_bits() as usize;\n\n self.registers[to_dec] -= 1;\n\n }\n\n // Control Flow instructions\n\n Opcode::EQ => {\n\n let reg_1 = self.next_8_bits() as usize;\n\n let reg_2 = self.next_8_bits() as usize;\n\n self.eq_flag = self.registers[reg_1] == self.registers[reg_2];\n\n }\n\n Opcode::NEQ => {\n\n let reg_1 = self.next_8_bits() as usize;\n\n let reg_2 = self.next_8_bits() as usize;\n\n self.eq_flag = self.registers[reg_1] != self.registers[reg_2];\n\n }\n\n Opcode::GT => {\n\n let reg_1 = self.next_8_bits() as usize;\n","file_path":"lamp_vm/src/base/vm.rs","rank":49,"score":2.4327101750167115},{"content":"# Lamp\n\nLamp is yet another registers-based VM.\n\n\n\n# Status\n\nThis project is still a work-in-place and will not be achieved before a long moment.\n\n\n\n# Used resources\n\nThis project was supposed to be written using the subnetzero's tutorial, but I finally decided to directly use the documentation of his project: https://gitlab.com/subnetzero/iridium/-/blob/master/docs/manual.adoc\n\n\n\n# TODO\n\n-Everything (lol)\n\n\n","file_path":"lamp_vm/README.md","rank":50,"score":2.380365345270895},{"content":" let reg_2 = self.next_8_bits() as usize;\n\n self.eq_flag = self.registers[reg_1] > self.registers[reg_2];\n\n }\n\n Opcode::GTE => {\n\n let reg_1 = self.next_8_bits() as usize;\n\n let reg_2 = self.next_8_bits() as usize;\n\n self.eq_flag = self.registers[reg_1] >= self.registers[reg_2];\n\n }\n\n Opcode::LT => {\n\n let reg_1 = self.next_8_bits() as usize;\n\n let reg_2 = self.next_8_bits() as usize;\n\n self.eq_flag = self.registers[reg_1] < self.registers[reg_2];\n\n }\n\n Opcode::LTE => {\n\n let reg_1 = self.next_8_bits() as usize;\n\n let reg_2 = self.next_8_bits() as usize;\n\n self.eq_flag = self.registers[reg_1] <= self.registers[reg_2];\n\n }\n\n Opcode::HLT => {\n\n // I literally don't know what should I do here\n","file_path":"lamp_vm/src/base/vm.rs","rank":51,"score":2.34576762804619},{"content":"pub mod lexer;\n\n\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"lamp_asm_parser/src/lib.rs","rank":52,"score":2.208685298948759},{"content":" 1\n\n }\n\n }\n\n }\n\n\n\n fn name(&self) -> &str {\n\n \"setpc\"\n\n }\n\n fn description(&self) -> &str {\n\n \"Sets the program counter to the given index.\"\n\n }\n\n fn syntax(&self) -> &str {\n\n \"setpc <unsigned value>\"\n\n }\n\n}\n","file_path":"lamp_vm/src/debug/commands/setpc.rs","rank":53,"score":2.2076217260193345},{"content":" Opcode::SUB => {\n\n let val_1 = self.registers[self.next_8_bits() as usize];\n\n let val_2 = self.registers[self.next_8_bits() as usize];\n\n let result_register = self.next_8_bits();\n\n self.set_register_value(result_register, val_1 - val_2);\n\n }\n\n Opcode::MUL => {\n\n let val_1 = self.registers[self.next_8_bits() as usize];\n\n let val_2 = self.registers[self.next_8_bits() as usize];\n\n let result_register = self.next_8_bits();\n\n self.set_register_value(result_register, val_1 * val_2);\n\n }\n\n Opcode::MOD => {\n\n let val_1 = self.registers[self.next_8_bits() as usize];\n\n let val_2 = self.registers[self.next_8_bits() as usize];\n\n let result_register = self.next_8_bits();\n\n self.set_register_value(result_register, val_1 / val_2);\n\n self.modulo_remainder = val_1 % val_2;\n\n }\n\n Opcode::INC => {\n","file_path":"lamp_vm/src/base/vm.rs","rank":54,"score":2.199764081343698},{"content":" \"Compilation failed: Cannot write the output. Error: {:?}\",\n\n e\n\n ),\n\n }\n\n }\n\n Err(errors) => {\n\n eprintln!(\"Can\\'t compile the source file: {} problems found. But don\\'t worry ! Here are the listed mistakes: \", errors.len());\n\n for error in errors {\n\n eprintln!(\"{}\", error);\n\n }\n\n }\n\n }\n\n }\n\n Err(e) => {\n\n eprintln!(\"Error: cannot read the file.\\nDetails: {:?}\", e);\n\n }\n\n }\n\n }\n\n Err(e) => eprintln!(\"Error: cannot open {:?}: {:?}\", args.source, e),\n\n }\n\n\n\n fn write_output(path: &PathBuf, bin: Vec<u8>) -> Result<usize, std::io::Error> {\n\n let buff = bin.as_slice();\n\n let file = File::create(path)?;\n\n let mut writer = BufWriter::new(file);\n\n writer.write(&buff)\n\n }\n\n}\n","file_path":"lamp_assembler/src/main.rs","rank":55,"score":1.0919260188127309}],"string":"[\n {\n \"content\": \"pub fn get_op<'a>(base: String) -> Result<Opcode, &'a str> {\\n\\n for (opcode, name) in OPCODES_STRINGS {\\n\\n if base.to_uppercase().contains(name) {\\n\\n return Ok(*opcode);\\n\\n }\\n\\n }\\n\\n\\n\\n Err(\\\"No opcode found.\\\")\\n\\n}\\n\",\n \"file_path\": \"lamp_common/src/op.rs\",\n \"rank\": 0,\n \"score\": 98568.56267563705\n },\n {\n \"content\": \"pub fn decode_opcode(val: u8) -> Option<Opcode> {\\n\\n for code in OPCODES {\\n\\n if *code as u8 == val {\\n\\n return Some(*code);\\n\\n }\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_common/src/op.rs\",\n \"rank\": 1,\n \"score\": 80349.9699243368\n },\n {\n \"content\": \"pub fn decode_opcode(val: u8) -> Result<Opcode, VMError> {\\n\\n match get_op(val) {\\n\\n Some(opcode) => Ok(opcode),\\n\\n None => Err(VMError::InvalidOpcodeError),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/base/opcodes.rs\",\n \"rank\": 2,\n \"score\": 78681.53566486659\n },\n {\n \"content\": \"pub fn parse_cmd(string: &str) -> Option<Box<dyn DebugCommand>> {\\n\\n for command in get_cmds() {\\n\\n if string.contains(command.name()) {\\n\\n return Some(command);\\n\\n }\\n\\n }\\n\\n None\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/mod.rs\",\n \"rank\": 3,\n \"score\": 74522.69299403456\n },\n {\n \"content\": \"#[test]\\n\\npub fn vm_add_test() {\\n\\n let bin = vec![\\n\\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\\n\\n 15, 13, 15, 15,\\n\\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\\n\\n 15, 14, 16, 16,\\n\\n // ADD 13, 14, 15: Put in the register 15 the result of the register 13 + the register 14\\n\\n 1, 13, 14, 15,\\n\\n ];\\n\\n\\n\\n let mut vm = VM::new(bin);\\n\\n let _ = vm.run();\\n\\n let expected_value = ((15 << 8) | 15) + ((16 << 8) | 16);\\n\\n assert_eq!(*vm.get_register(15), expected_value);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 4,\n \"score\": 59956.84941734788\n },\n {\n \"content\": \"#[test]\\n\\npub fn vm_mul_test() {\\n\\n let bin = vec![\\n\\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\\n\\n 15, 13, 15, 15,\\n\\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\\n\\n 15, 14, 16, 16,\\n\\n // MUL 13, 14, 15: Put in the register 15 the result of the register 13 * the register 14\\n\\n 3, 13, 14, 15,\\n\\n ];\\n\\n\\n\\n let mut vm = VM::new(bin);\\n\\n let _ = vm.run();\\n\\n let expected_value = ((15 << 8) | 15) * ((16 << 8) | 16);\\n\\n assert_eq!(*vm.get_register(15), expected_value);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 5,\n \"score\": 59956.84941734788\n },\n {\n \"content\": \"#[test]\\n\\npub fn vm_load_test() {\\n\\n let bin = vec![\\n\\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\\n\\n 15, 13, 15, 15,\\n\\n ];\\n\\n let mut vm = VM::new(bin);\\n\\n let _ = vm.run();\\n\\n let expected_value = (15 << 8) | 15;\\n\\n assert_eq!(*vm.get_register(13), expected_value);\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 6,\n \"score\": 59956.84941734788\n },\n {\n \"content\": \"#[test]\\n\\npub fn vm_mod_test() {\\n\\n let bin = vec![\\n\\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\\n\\n 15, 13, 15, 15,\\n\\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\\n\\n 15, 14, 16, 16,\\n\\n // MOD 13, 14, 15: Put in the register 15 the result of the register 13 / the register 14. The remainder goes into a special register\\n\\n 4, 13, 14, 15,\\n\\n ];\\n\\n\\n\\n let mut vm = VM::new(bin);\\n\\n let _ = vm.run();\\n\\n let expected_value = ((15 << 8) | 15) / ((16 << 8) | 16);\\n\\n assert_eq!(*vm.get_register(15), expected_value);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 7,\n \"score\": 59956.84941734788\n },\n {\n \"content\": \"#[test]\\n\\npub fn vm_sub_test() {\\n\\n let bin = vec![\\n\\n // LOAD 13, 15, 15: Put in the register 13 the u16 represented by 15 and 15\\n\\n 15, 13, 15, 15,\\n\\n // LOAD 14, 16, 16: Put in the register 14 the u16 represented by 16 and 16\\n\\n 15, 14, 16, 16,\\n\\n // SUB 13, 14, 15: Put in the register 15 the result of the register 13 - the register 14\\n\\n 2, 13, 14, 15,\\n\\n ];\\n\\n\\n\\n let mut vm = VM::new(bin);\\n\\n let _ = vm.run();\\n\\n let expected_value = ((15 << 8) | 15) - ((16 << 8) | 16);\\n\\n assert_eq!(*vm.get_register(15), expected_value);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 8,\n \"score\": 59956.84941734788\n },\n {\n \"content\": \"#[cfg(test)]\\n\\npub fn registers_dump(vm: &VM) {\\n\\n for i in 0..32 {\\n\\n println!(\\\"Register {}: {}\\\", &i, vm.get_register(i));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 9,\n \"score\": 55543.20305803565\n },\n {\n \"content\": \"pub fn get_cmds() -> Vec<Box<dyn DebugCommand>> {\\n\\n vec![\\n\\n Box::new(regdump::RegdumpCommand {}),\\n\\n Box::new(setpc::SetPcCommand {}),\\n\\n Box::new(step::StepCommand {}),\\n\\n ]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/mod.rs\",\n \"rank\": 10,\n \"score\": 50225.23291887318\n },\n {\n \"content\": \"fn main() {\\n\\n let lamp = LampApp::from_args();\\n\\n simple_logger::init().unwrap();\\n\\n let bin = std::fs::read(&lamp.bin_path);\\n\\n\\n\\n match bin {\\n\\n Ok(v) => {\\n\\n if lamp.debug {\\n\\n info!(\\\"Debug session started.\\\");\\n\\n let mut debug_session = DebugSession::new(VM::new(v));\\n\\n debug_session.start_debug_session();\\n\\n info!(\\\"Debug session ended.\\\");\\n\\n return;\\n\\n }\\n\\n\\n\\n let mut lamp_vm = VM::new(v);\\n\\n let exit_status = lamp_vm.run();\\n\\n\\n\\n match exit_status {\\n\\n Ok(code) => info!(\\\"VM exited successfully (code {})\\\", code),\\n\\n Err(e) => error!(\\\"VM exited with an error.\\\\nReason: {:?}\\\", e),\\n\\n }\\n\\n }\\n\\n Err(e) => error!(\\\"Unable to read the binary's content: {:?}\\\", e),\\n\\n }\\n\\n\\n\\n info!(\\\"VM Shutdown.\\\");\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/main.rs\",\n \"rank\": 11,\n \"score\": 32772.13810951068\n },\n {\n \"content\": \"fn main() {\\n\\n let args = LampAsm::from_args();\\n\\n\\n\\n let mut file = File::open(&args.source);\\n\\n\\n\\n match file {\\n\\n Ok(ref mut file) => {\\n\\n let mut buffer = String::new();\\n\\n match file.read_to_string(&mut buffer) {\\n\\n Ok(k) => {\\n\\n println!(\\\"Source file size is {} bytes.\\\", k);\\n\\n let lines = buffer.split('\\\\n').map(|s| s.to_string()).collect();\\n\\n\\n\\n let mut compiler = Compiler::new(lines);\\n\\n match compiler.compile() {\\n\\n Ok(bin_size) => {\\n\\n println!(\\\"Output's size is {} bytes.\\\", bin_size);\\n\\n match write_output(&args.output, compiler.result_buffer) {\\n\\n Ok(_) => println!(\\\"Compilation successfully ended.\\\"),\\n\\n Err(e) => println!(\\n\",\n \"file_path\": \"lamp_assembler/src/main.rs\",\n \"rank\": 12,\n \"score\": 32772.13810951068\n },\n {\n \"content\": \"pub trait DebugCommand {\\n\\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize;\\n\\n fn name(&self) -> &str;\\n\\n fn description(&self) -> &str;\\n\\n fn syntax(&self) -> &str;\\n\\n fn display_error(&self) {\\n\\n error!(\\n\\n \\\"Error: too much/not enough arguments.\\\\nUsage: {}\\\",\\n\\n self.syntax()\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/command_base.rs\",\n \"rank\": 13,\n \"score\": 31391.543955042245\n },\n {\n \"content\": \"#[test]\\n\\nfn test_parse() {\\n\\n let to_parse = \\\"LOAD #30, #20, #16\\\";\\n\\n let lexer = Lexer::new();\\n\\n\\n\\n let res = lexer.tokenize_line(to_parse, 1);\\n\\n\\n\\n assert_eq!(res.is_ok(), true);\\n\\n\\n\\n let expected = TokenizedLine {\\n\\n opcode: Opcode::LOAD,\\n\\n operands: vec![\\n\\n TokenType::Num8(30),\\n\\n TokenType::Num8(20),\\n\\n TokenType::Num8(16),\\n\\n ],\\n\\n };\\n\\n\\n\\n assert_eq!(res.unwrap(), expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lamp_asm_parser/src/tests.rs\",\n \"rank\": 14,\n \"score\": 31357.23488130705\n },\n {\n \"content\": \"#[test]\\n\\nfn test_parse_error() {\\n\\n let to_parse = \\\"ZIZI #30, '0, #caca\\\";\\n\\n let lexer = Lexer::new();\\n\\n\\n\\n let res = lexer.tokenize_line(to_parse, 1);\\n\\n\\n\\n assert_eq!(res.is_err(), true);\\n\\n}\\n\",\n \"file_path\": \"lamp_asm_parser/src/tests.rs\",\n \"rank\": 15,\n \"score\": 30712.83341891786\n },\n {\n \"content\": \"use super::vm::VMError;\\n\\nuse lamp_common::op::{decode_opcode as get_op, Opcode};\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/base/opcodes.rs\",\n \"rank\": 16,\n \"score\": 24321.019071703566\n },\n {\n \"content\": \"use lamp_asm_parser::lexer::{Lexer, LexerError, TokenType, TokenizedLine};\\n\\n\\n\\npub struct Compiler {\\n\\n origin: Vec<String>,\\n\\n pub result_buffer: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Compiler {\\n\\n pub fn new(origin: Vec<String>) -> Self {\\n\\n Self {\\n\\n origin,\\n\\n result_buffer: vec![],\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn compile(&mut self) -> Result<usize, Vec<LexerError>> {\\n\\n let tokenization = Lexer::new().tokenize(&self.origin);\\n\\n\\n\\n match tokenization {\\n\\n Ok(tokenized_lines) => {\\n\",\n \"file_path\": \"lamp_assembler/src/compiler.rs\",\n \"rank\": 19,\n \"score\": 15.920766295847113\n },\n {\n \"content\": \"pub enum VMError {\\n\\n InvalidOpcodeError,\\n\\n UnexpectedTokenError,\\n\\n // More errors will be added\\n\\n}\\n\\n\\n\\nimpl VM {\\n\\n pub fn new(binary: Vec<u8>) -> Self {\\n\\n Self {\\n\\n bin: binary,\\n\\n pc: 0,\\n\\n registers: [0; 32],\\n\\n modulo_remainder: 0,\\n\\n eq_flag: false,\\n\\n }\\n\\n }\\n\\n\\n\\n // Runs the full binary.\\n\\n pub fn run(&mut self) -> VMResult {\\n\\n let mut result;\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 22,\n \"score\": 13.892310805408497\n },\n {\n \"content\": \" for line in tokenized_lines {\\n\\n let buff = self.compile_token(line);\\n\\n\\n\\n for byte in buff {\\n\\n self.result_buffer.push(byte);\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(e) => return Err(e),\\n\\n }\\n\\n Ok(self.result_buffer.len())\\n\\n }\\n\\n\\n\\n pub fn compile_token(&mut self, token: TokenizedLine) -> Vec<u8> {\\n\\n let mut returned_vec = Vec::<u8>::new();\\n\\n\\n\\n returned_vec.push(token.opcode as u8);\\n\\n // Should be changed later\\n\\n for operand in token.operands {\\n\\n match operand {\\n\\n TokenType::Num8(n) => returned_vec.push(n),\\n\\n TokenType::Ptr8(n) => returned_vec.push(n),\\n\\n TokenType::Opcode(_) => panic!(\\\"Should never happen: Unexpected opcode found\\\"),\\n\\n }\\n\\n }\\n\\n returned_vec\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_assembler/src/compiler.rs\",\n \"rank\": 24,\n \"score\": 12.090504720564759\n },\n {\n \"content\": \"use crate::lexer::{Lexer, TokenType, TokenizedLine};\\n\\nuse lamp_common::op::Opcode;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"lamp_asm_parser/src/tests.rs\",\n \"rank\": 27,\n \"score\": 9.755983189795867\n },\n {\n \"content\": \"use super::commands;\\n\\nuse crate::base::vm::VM;\\n\\nuse log::{error, info};\\n\\nuse std::io;\\n\\nuse std::io::Write;\\n\\n\\n\\npub struct DebugSession {\\n\\n vm: VM,\\n\\n}\\n\\n\\n\\nimpl DebugSession {\\n\\n pub fn new(vm: VM) -> Self {\\n\\n Self { vm }\\n\\n }\\n\\n\\n\\n pub fn start_debug_session(&mut self) {\\n\\n info!(\\\"Starting debug session.\\\");\\n\\n loop {\\n\\n print!(\\\"\\\\n>>> \\\");\\n\\n let _ = io::stdout().flush();\\n\",\n \"file_path\": \"lamp_vm/src/debug/session.rs\",\n \"rank\": 28,\n \"score\": 9.500998141163112\n },\n {\n \"content\": \" loop {\\n\\n result = self.cycle();\\n\\n\\n\\n if self.pc >= self.bin.len() {\\n\\n break;\\n\\n }\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n // One VM's cycle.\\n\\n // It does:\\n\\n // -The opcode decoding\\n\\n // -The opcode execution\\n\\n // - Error handling\\n\\n pub fn cycle(&mut self) -> VMResult {\\n\\n let opcode = self.next_8_bits();\\n\\n let outcoming_result: VMResult;\\n\\n\\n\\n match decode_opcode(opcode) {\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 29,\n \"score\": 9.077156438262511\n },\n {\n \"content\": \"macro_rules! opcodes {\\n\\n { $($variant: ident = $value: expr, op = $operands: expr),+$(,)? } =>\\n\\n {\\n\\n #[repr(u8)]\\n\\n #[derive(Debug, Copy, Clone, PartialEq)]\\n\\n pub enum Opcode {\\n\\n $($variant = $value),+,\\n\\n }\\n\\n pub const OPCODES: &'static [Opcode] = &[$(Opcode::$variant),*];\\n\\n pub const OPCODES_OPERANDS: &'static [(Opcode, usize)] = &[$((Opcode::$variant , $operands)),*];\\n\\n pub const OPCODES_STRINGS: &'static [(Opcode, &str)] = &[$((Opcode::$variant , stringify!(Opcode::$variant))),*];\\n\\n }\\n\\n}\\n\\n// First number is the mnemonic's ID.\\n\\n// op is the number of operands the mnemonic needs\\n\\nopcodes! {\\n\\n // Arithmetical instructions\\n\\n ADD = 1, op = 3,\\n\\n SUB = 2, op = 3,\\n\\n MUL = 3, op = 3,\\n\",\n \"file_path\": \"lamp_common/src/op.rs\",\n \"rank\": 30,\n \"score\": 8.670641829823012\n },\n {\n \"content\": \" let mut command_line = String::new();\\n\\n\\n\\n io::stdin()\\n\\n .read_line(&mut command_line)\\n\\n .map_err(|e| {\\n\\n error!(\\\"Unable to read line: {:?}\\\", e);\\n\\n })\\n\\n .unwrap();\\n\\n\\n\\n command_line = String::from(command_line.trim());\\n\\n match commands::parse_cmd(&command_line) {\\n\\n Some(cmd) => {\\n\\n let res = cmd.execute(&mut self.vm, command_line.split(' ').collect());\\n\\n info!(\\\"Command reported the {} result.\\\", res);\\n\\n },\\n\\n None => error!(\\\"This command doesn\\\\'t exist. type \\\\\\\"help\\\\\\\" for an exhaustive list of the available commands.\\\"),\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/debug/session.rs\",\n \"rank\": 31,\n \"score\": 8.293365861643398\n },\n {\n \"content\": \"use super::opcodes::decode_opcode;\\n\\nuse lamp_common::op::Opcode;\\n\\nuse log::{error, info};\\n\\n\\n\\npub struct VM {\\n\\n // The binary VM has to execute\\n\\n bin: Vec<u8>,\\n\\n // The program counter, it's utility is to remind where we are in the program\\n\\n pc: usize,\\n\\n // Registers used to store i32 values the program needs\\n\\n registers: [i32; 32],\\n\\n // When modulo operation is done, the remainder is pushed here\\n\\n modulo_remainder: i32,\\n\\n // When an eq test is done, the result is pushed here\\n\\n eq_flag: bool,\\n\\n}\\n\\n\\n\\npub type VMResult = Result<i32, VMError>;\\n\\n\\n\\n#[derive(Debug, Copy, Clone, Eq, PartialEq)]\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 32,\n \"score\": 8.092192115360842\n },\n {\n \"content\": \"use super::command_base::DebugCommand;\\n\\nuse crate::base::vm::VM;\\n\\nuse log::{error, info};\\n\\n\\n\\npub struct RegdumpCommand;\\n\\n\\n\\nimpl DebugCommand for RegdumpCommand {\\n\\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize {\\n\\n match args.get(1) {\\n\\n Some(arg) => {\\n\\n if arg == &\\\"all\\\" {\\n\\n for i in 0..32 {\\n\\n print!(\\\"|| {}: {}\\\", i, vm.get_register(i));\\n\\n }\\n\\n 0\\n\\n } else {\\n\\n match arg.parse::<u8>() {\\n\\n Ok(num) => {\\n\\n if num > 31 {\\n\\n error!(\\\"Error: wrong arg 2.\\\\nUsage: {}\\\", self.syntax());\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/regdump.rs\",\n \"rank\": 33,\n \"score\": 7.750795133172865\n },\n {\n \"content\": \" }\\n\\n Ok(0)\\n\\n }\\n\\n\\n\\n // Sets the value of a register.\\n\\n pub fn set_register_value(&mut self, index: u8, val: i32) {\\n\\n let ptr = self.get_register_mut(index);\\n\\n *ptr = val;\\n\\n }\\n\\n\\n\\n // Gives a mutable register's reference, and verifies if the given register's index is valid.\\n\\n pub fn get_register_mut(&mut self, index: u8) -> &mut i32 {\\n\\n if index < 32 {\\n\\n &mut self.registers[index as usize]\\n\\n } else {\\n\\n error!(\\n\\n \\\"Register out of bounds. Expected 0 <= register_index < 32; got {}\\\",\\n\\n index\\n\\n );\\n\\n panic!(\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 34,\n \"score\": 7.611230979921988\n },\n {\n \"content\": \"use super::command_base::DebugCommand;\\n\\nuse crate::base::vm::VM;\\n\\n\\n\\npub struct SetPcCommand;\\n\\n\\n\\nimpl DebugCommand for SetPcCommand {\\n\\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize {\\n\\n match args.get(1) {\\n\\n Some(arg) => match arg.parse::<usize>() {\\n\\n Ok(new_pc) => {\\n\\n vm.set_pc(new_pc);\\n\\n 0\\n\\n }\\n\\n Err(_) => {\\n\\n self.display_error();\\n\\n 1\\n\\n }\\n\\n },\\n\\n None => {\\n\\n self.display_error();\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/setpc.rs\",\n \"rank\": 35,\n \"score\": 7.519856188210014\n },\n {\n \"content\": \"use super::command_base::DebugCommand;\\n\\nuse crate::base::vm::VM;\\n\\n\\n\\npub struct StepCommand;\\n\\n\\n\\nimpl DebugCommand for StepCommand {\\n\\n #[allow(unused_variables)]\\n\\n fn execute(&self, vm: &mut VM, args: Vec<&str>) -> usize {\\n\\n match vm.cycle() {\\n\\n Ok(_) => 0,\\n\\n Err(_) => 1,\\n\\n }\\n\\n }\\n\\n fn name(&self) -> &str {\\n\\n \\\"step\\\"\\n\\n }\\n\\n fn description(&self) -> &str {\\n\\n \\\"Makes 1 VM's cycle.\\\"\\n\\n }\\n\\n fn syntax(&self) -> &str {\\n\\n \\\"step\\\"\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/step.rs\",\n \"rank\": 36,\n \"score\": 7.255133802244771\n },\n {\n \"content\": \" Ok(opcode) => outcoming_result = self.execute_instruction(opcode),\\n\\n Err(e) => {\\n\\n error!(\\\"VM's error happened. Aborting. \\\\n {:?}\\\", e);\\n\\n return Err(e);\\n\\n }\\n\\n }\\n\\n outcoming_result\\n\\n }\\n\\n\\n\\n // Executes the given opcode.\\n\\n // This function is just a giant match.\\n\\n pub fn execute_instruction(&mut self, opcode: Opcode) -> VMResult {\\n\\n match opcode {\\n\\n // Arithmetical instructions\\n\\n Opcode::ADD => {\\n\\n let val_1 = self.registers[self.next_8_bits() as usize];\\n\\n let val_2 = self.registers[self.next_8_bits() as usize];\\n\\n let result_register = self.next_8_bits();\\n\\n self.set_register_value(result_register, val_1 + val_2);\\n\\n }\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 37,\n \"score\": 6.860280078069135\n },\n {\n \"content\": \"pub mod opcodes;\\n\\npub mod vm;\\n\",\n \"file_path\": \"lamp_vm/src/base/mod.rs\",\n \"rank\": 38,\n \"score\": 5.173928118479095\n },\n {\n \"content\": \" \\\"Register out of bounds. Expected 0 <= register_index < 32; got {}\\\",\\n\\n index\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_register(&self, index: u8) -> &i32 {\\n\\n if index < 32 {\\n\\n &self.registers[index as usize]\\n\\n } else {\\n\\n error!(\\n\\n \\\"Register out of bounds. Expected 0 <= register_index < 32; got {}\\\",\\n\\n index\\n\\n );\\n\\n panic!(\\n\\n \\\"Register out of bounds. Expected 0 <= register_index < 32; got {}\\\",\\n\\n index\\n\\n );\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 39,\n \"score\": 4.844287377348658\n },\n {\n \"content\": \"use base::vm::VM;\\n\\nuse debug::session::DebugSession;\\n\\nuse log::{error, info};\\n\\nuse std::path::PathBuf;\\n\\nuse structopt::StructOpt;\\n\\n\\n\\npub mod base;\\n\\npub mod debug;\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\\n\\n\\n#[derive(StructOpt, Debug)]\\n\\n#[structopt(name = \\\"lamp\\\")]\\n\",\n \"file_path\": \"lamp_vm/src/main.rs\",\n \"rank\": 40,\n \"score\": 4.730143070392978\n },\n {\n \"content\": \"pub mod command_base;\\n\\n\\n\\n// Commands modules declarations\\n\\npub mod regdump;\\n\\npub mod setpc;\\n\\npub mod step;\\n\\n\\n\\nuse command_base::DebugCommand;\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/mod.rs\",\n \"rank\": 41,\n \"score\": 4.6379293154321495\n },\n {\n \"content\": \" // Grabs next 8 bits of the VM's binary\\n\\n // Stupid out of bounds error detected; should be fixed.\\n\\n pub fn next_8_bits(&mut self) -> u8 {\\n\\n self.pc += 1;\\n\\n self.bin[self.pc - 1]\\n\\n }\\n\\n\\n\\n // Grabs next 16 bytes of the VM's binary\\n\\n fn next_16_bits(&mut self) -> u16 {\\n\\n self.pc += 2;\\n\\n ((u16::from(self.bin[self.pc - 2])) << 8) | u16::from(self.bin[self.pc - 1])\\n\\n }\\n\\n\\n\\n pub fn set_pc(&mut self, new_pc: usize) -> usize {\\n\\n if new_pc > self.bin.len() {\\n\\n self.pc = new_pc;\\n\\n 0\\n\\n } else {\\n\\n error!(\\n\\n \\\"Tried to set the program counter to {} where the binary\\\\'s total size is {} bytes\\\",\\n\\n new_pc,\\n\\n self.bin.len()\\n\\n );\\n\\n 1\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 42,\n \"score\": 3.6469902502493037\n },\n {\n \"content\": \"use crate::compiler::Compiler;\\n\\nuse std::fs::File;\\n\\nuse std::io::BufWriter;\\n\\nuse std::io::Read;\\n\\nuse std::io::Write;\\n\\nuse std::path::PathBuf;\\n\\nuse structopt::StructOpt;\\n\\n\\n\\nmod compiler;\\n\\n\\n\\n#[derive(StructOpt, Debug)]\\n\\n#[structopt(name = \\\"lamp_asm\\\")]\\n\",\n \"file_path\": \"lamp_assembler/src/main.rs\",\n \"rank\": 43,\n \"score\": 3.0286398800139653\n },\n {\n \"content\": \"use crate::base::vm::VM;\\n\\nuse log::error;\\n\\n\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/command_base.rs\",\n \"rank\": 44,\n \"score\": 2.9052744761761256\n },\n {\n \"content\": \"pub mod op;\\n\\n\\n\\npub mod constants {\\n\\n // Do not ask me from where those values come from\\n\\n pub const LAMP_BIN_HEADER: &[u8] = &[69, 31, 17, 72];\\n\\n pub const COMMENT_MARKER: &str = \\\";\\\";\\n\\n}\\n\",\n \"file_path\": \"lamp_common/src/lib.rs\",\n \"rank\": 45,\n \"score\": 2.761613193816819\n },\n {\n \"content\": \" }\\n\\n Opcode::NOP => {\\n\\n info!(\\\"NOP Opcode encountered, doing nothing.\\\");\\n\\n self.pc += 1;\\n\\n }\\n\\n Opcode::LOAD => {\\n\\n let register = self.next_8_bits();\\n\\n let value = self.next_16_bits() as i32;\\n\\n self.set_register_value(register, value);\\n\\n }\\n\\n Opcode::JMP => {\\n\\n let register = self.next_8_bits();\\n\\n let addr = *self.get_register(register);\\n\\n self.pc = addr as usize;\\n\\n }\\n\\n\\n\\n Opcode::MODR => {\\n\\n let register = self.next_8_bits();\\n\\n self.set_register_value(register, self.modulo_remainder);\\n\\n }\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 46,\n \"score\": 2.721929770807549\n },\n {\n \"content\": \"pub mod commands;\\n\\npub mod session;\\n\",\n \"file_path\": \"lamp_vm/src/debug/mod.rs\",\n \"rank\": 47,\n \"score\": 2.7021939007470355\n },\n {\n \"content\": \"use crate::base::vm::VM;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"lamp_vm/src/tests/vm_test.rs\",\n \"rank\": 48,\n \"score\": 2.4882956611043747\n },\n {\n \"content\": \" let to_inc = self.next_8_bits() as usize;\\n\\n self.registers[to_inc] += 1;\\n\\n }\\n\\n Opcode::DEC => {\\n\\n let to_dec = self.next_8_bits() as usize;\\n\\n self.registers[to_dec] -= 1;\\n\\n }\\n\\n // Control Flow instructions\\n\\n Opcode::EQ => {\\n\\n let reg_1 = self.next_8_bits() as usize;\\n\\n let reg_2 = self.next_8_bits() as usize;\\n\\n self.eq_flag = self.registers[reg_1] == self.registers[reg_2];\\n\\n }\\n\\n Opcode::NEQ => {\\n\\n let reg_1 = self.next_8_bits() as usize;\\n\\n let reg_2 = self.next_8_bits() as usize;\\n\\n self.eq_flag = self.registers[reg_1] != self.registers[reg_2];\\n\\n }\\n\\n Opcode::GT => {\\n\\n let reg_1 = self.next_8_bits() as usize;\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 49,\n \"score\": 2.4327101750167115\n },\n {\n \"content\": \"# Lamp\\n\\nLamp is yet another registers-based VM.\\n\\n\\n\\n# Status\\n\\nThis project is still a work-in-place and will not be achieved before a long moment.\\n\\n\\n\\n# Used resources\\n\\nThis project was supposed to be written using the subnetzero's tutorial, but I finally decided to directly use the documentation of his project: https://gitlab.com/subnetzero/iridium/-/blob/master/docs/manual.adoc\\n\\n\\n\\n# TODO\\n\\n-Everything (lol)\\n\\n\\n\",\n \"file_path\": \"lamp_vm/README.md\",\n \"rank\": 50,\n \"score\": 2.380365345270895\n },\n {\n \"content\": \" let reg_2 = self.next_8_bits() as usize;\\n\\n self.eq_flag = self.registers[reg_1] > self.registers[reg_2];\\n\\n }\\n\\n Opcode::GTE => {\\n\\n let reg_1 = self.next_8_bits() as usize;\\n\\n let reg_2 = self.next_8_bits() as usize;\\n\\n self.eq_flag = self.registers[reg_1] >= self.registers[reg_2];\\n\\n }\\n\\n Opcode::LT => {\\n\\n let reg_1 = self.next_8_bits() as usize;\\n\\n let reg_2 = self.next_8_bits() as usize;\\n\\n self.eq_flag = self.registers[reg_1] < self.registers[reg_2];\\n\\n }\\n\\n Opcode::LTE => {\\n\\n let reg_1 = self.next_8_bits() as usize;\\n\\n let reg_2 = self.next_8_bits() as usize;\\n\\n self.eq_flag = self.registers[reg_1] <= self.registers[reg_2];\\n\\n }\\n\\n Opcode::HLT => {\\n\\n // I literally don't know what should I do here\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 51,\n \"score\": 2.34576762804619\n },\n {\n \"content\": \"pub mod lexer;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"lamp_asm_parser/src/lib.rs\",\n \"rank\": 52,\n \"score\": 2.208685298948759\n },\n {\n \"content\": \" 1\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn name(&self) -> &str {\\n\\n \\\"setpc\\\"\\n\\n }\\n\\n fn description(&self) -> &str {\\n\\n \\\"Sets the program counter to the given index.\\\"\\n\\n }\\n\\n fn syntax(&self) -> &str {\\n\\n \\\"setpc <unsigned value>\\\"\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_vm/src/debug/commands/setpc.rs\",\n \"rank\": 53,\n \"score\": 2.2076217260193345\n },\n {\n \"content\": \" Opcode::SUB => {\\n\\n let val_1 = self.registers[self.next_8_bits() as usize];\\n\\n let val_2 = self.registers[self.next_8_bits() as usize];\\n\\n let result_register = self.next_8_bits();\\n\\n self.set_register_value(result_register, val_1 - val_2);\\n\\n }\\n\\n Opcode::MUL => {\\n\\n let val_1 = self.registers[self.next_8_bits() as usize];\\n\\n let val_2 = self.registers[self.next_8_bits() as usize];\\n\\n let result_register = self.next_8_bits();\\n\\n self.set_register_value(result_register, val_1 * val_2);\\n\\n }\\n\\n Opcode::MOD => {\\n\\n let val_1 = self.registers[self.next_8_bits() as usize];\\n\\n let val_2 = self.registers[self.next_8_bits() as usize];\\n\\n let result_register = self.next_8_bits();\\n\\n self.set_register_value(result_register, val_1 / val_2);\\n\\n self.modulo_remainder = val_1 % val_2;\\n\\n }\\n\\n Opcode::INC => {\\n\",\n \"file_path\": \"lamp_vm/src/base/vm.rs\",\n \"rank\": 54,\n \"score\": 2.199764081343698\n },\n {\n \"content\": \" \\\"Compilation failed: Cannot write the output. Error: {:?}\\\",\\n\\n e\\n\\n ),\\n\\n }\\n\\n }\\n\\n Err(errors) => {\\n\\n eprintln!(\\\"Can\\\\'t compile the source file: {} problems found. But don\\\\'t worry ! Here are the listed mistakes: \\\", errors.len());\\n\\n for error in errors {\\n\\n eprintln!(\\\"{}\\\", error);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(e) => {\\n\\n eprintln!(\\\"Error: cannot read the file.\\\\nDetails: {:?}\\\", e);\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(e) => eprintln!(\\\"Error: cannot open {:?}: {:?}\\\", args.source, e),\\n\\n }\\n\\n\\n\\n fn write_output(path: &PathBuf, bin: Vec<u8>) -> Result<usize, std::io::Error> {\\n\\n let buff = bin.as_slice();\\n\\n let file = File::create(path)?;\\n\\n let mut writer = BufWriter::new(file);\\n\\n writer.write(&buff)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"lamp_assembler/src/main.rs\",\n \"rank\": 55,\n \"score\": 1.0919260188127309\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":11,"numItemsPerPage":100,"numTotalItems":13489,"offset":1100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTY1NjUwOCwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3Nzk2NjAxMDgsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.SH2y1aboG70Yqe5Hk5Q-d95ZmHnsFBb6jL-VQABdkAE3jnV0XidZk_xeyd5pZmvTFUgb1llRDq4GP5Hg515IDg","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 | tests/rsa_tests.rs | NikVolf/ring | 0c0f7c47112f9ff3e1b8d8d4427d8246fcdc0794 |
#![forbid(
anonymous_parameters,
box_pointers,
legacy_directory_ownership,
missing_copy_implementations,
missing_debug_implementations,
missing_docs,
trivial_casts,
trivial_numeric_casts,
unsafe_code,
unstable_features,
unused_extern_crates,
unused_import_braces,
un... |
#![forbid(
anonymous_parameters,
box_pointers,
legacy_directory_ownership,
missing_copy_implementations,
missing_debug_implementations,
missing_docs,
trivial_casts,
trivial_numeric_casts,
unsafe_code,
unstable_features,
unused_extern_crates,
unused_import_braces,
un... |
let result = test_case.consume_string("Result");
let private_key = test_case.consume_bytes("Key");
let private_key = untrusted::Input::from(&private_key);
let key_pair = signature::RSAKeyPair::from_der(private_key);
if key_pair.is_err() && result == "Fail-Invalid-Key" {
... | let alg = match digest_name.as_ref() {
"SHA256" => &signature::RSA_PSS_SHA256,
"SHA384" => &signature::RSA_PSS_SHA384,
"SHA512" => &signature::RSA_PSS_SHA512,
_ => { panic!("Unsupported digest: {}", digest_name) }
}; | assignment_statement | [
{
"content": "#[inline]\n\npub fn sign(key_pair: &KeyPair, rng: &rand::SecureRandom, msg: untrusted::Input)\n\n -> Result<Signature, error::Unspecified> {\n\n key_pair.inner.sign(rng, msg)\n\n}\n\n\n",
"file_path": "src/signature.rs",
"rank": 0,
"score": 364956.10236816294
},
{
... |
Rust | src/error.rs | braunse/isahc | df395edf481221d7d1fbfef020d813e604aa28e3 |
#![allow(deprecated)]
use std::error::Error as StdError;
use std::fmt;
use std::io;
#[derive(Debug)]
pub enum Error {
Aborted,
BadClientCertificate(Option<String>),
BadServerCertificate(Option<String>),
ConnectFailed,
CouldntResolveHost,
CouldntResolveProxy,
... |
#![allow(deprecated)]
use std::error::Error as StdError;
use std::fmt;
use std::io;
#[derive(Debug)]
pub enum Error {
Aborted,
BadClientCertificate(Option<String>),
BadServerCertificate(Option<String>),
ConnectFailed,
CouldntResolveHost,
CouldntResolveProxy,
... |
}
#[doc(hidden)]
impl From<std::string::FromUtf8Error> for Error {
fn from(_: std::string::FromUtf8Error) -> Error {
Error::InvalidUtf8
}
}
#[doc(hidden)]
impl From<std::str::Utf8Error> for Error {
fn from(_: std::str::Utf8Error) -> Error {
Error::InvalidUtf8
}
}
| fn from(error: Error) -> io::Error {
match error {
Error::ConnectFailed => io::ErrorKind::ConnectionRefused.into(),
Error::Io(e) => e,
Error::Timeout => io::ErrorKind::TimedOut.into(),
_ => io::ErrorKind::Other.into(),
}
} | function_block-full_function | [
{
"content": "/// Creates an interceptor from an arbitrary closure or function.\n\npub fn from_fn<F, E>(f: F) -> InterceptorFn<F>\n\nwhere\n\n F: for<'a> private::AsyncFn2<Request<Body>, Context<'a>, Output = Result<Response<Body>, E>> + Send + Sync + 'static,\n\n E: Into<Box<dyn Error>>,\n\n{\n\n Inte... |
Rust | src/objects/module.rs | mloebel/rust-cpython | 2e243f7622a8d33bca3fb321db25d4be4c26397d |
use libc::c_char;
use std::ffi::{CStr, CString};
use crate::conversion::ToPyObject;
use crate::err::{self, PyErr, PyResult};
use crate::ffi;
use crate::objectprotocol::ObjectProtocol;
use crate::objects::{exc, PyDict, PyObject, PyTuple};
use crate::py_class::PythonObjectFromPyClassMacro;
use crate::python::{PyDrop, ... |
use libc::c_char;
use std::ffi::{CStr, CString};
use crate::conversion::ToPyObject;
use crate::err::{self, PyErr, PyResult};
use crate::ffi;
use crate::objectprotocol::ObjectProtocol;
use crate::objects::{exc, PyDict, PyObject, PyTuple};
use crate::py_class::PythonObjectFromPyClassMacro;
use crate::python::{PyDrop, ... | ,
}
}
}
pub fn name<'a>(&'a self, py: Python) -> PyResult<&'a str> {
unsafe { self.str_from_ptr(py, ffi::PyModule_GetName(self.0.as_ptr())) }
}
#[allow(deprecated)]
pub fn filename<'a>(&'a self, py: Python) -> PyResult<&'a str> {
un... | Err(PyErr::from_instance(
py,
exc::UnicodeDecodeError::new_utf8(py, slice, e)?,
)) | call_expression | [
{
"content": "pub fn type_error_to_false(py: Python, e: PyErr) -> PyResult<bool> {\n\n if e.matches(py, py.get_type::<exc::TypeError>()) {\n\n Ok(false)\n\n } else {\n\n Err(e)\n\n }\n\n}\n\n\n\n#[macro_export]\n\n#[doc(hidden)]\n\nmacro_rules! py_class_binary_numeric_slot {\n\n ($clas... |
Rust | clients/client-core/src/client/real_messages_control/acknowledgement_control/retransmission_request_listener.rs | confio/nym | 495ca35c1f46e7244d89fdf73402021d70df625d |
use super::action_controller::{Action, ActionSender};
use super::PendingAcknowledgement;
use super::RetransmissionRequestReceiver;
use crate::client::{
real_messages_control::real_traffic_stream::{BatchRealMessageSender, RealMessage},
topology_control::TopologyAccessor,
};
use futures::StreamExt;
use log::*;
... |
use super::action_controller::{Action, ActionSender};
use super::PendingAcknowledgement;
use super::RetransmissionRequestReceiver;
use crate::client::{
real_messages_control::real_traffic_stream::{BatchRealMessageSender, RealMessage},
topology_control::TopologyAccessor,
};
use futures::StreamExt;
use log::*;
... |
pub(super) async fn run(&mut self) {
debug!("Started RetransmissionRequestListener");
while let Some(timed_out_ack) = self.request_receiver.next().await {
self.on_retransmission_request(timed_out_ack).await;
}
error!("TODO: error msg. Or maybe panic?")
}
}
| async fn on_retransmission_request(&mut self, timed_out_ack: Weak<PendingAcknowledgement>) {
let timed_out_ack = match timed_out_ack.upgrade() {
Some(timed_out_ack) => timed_out_ack,
None => {
debug!("We received an ack JUST as we were about to retransmit [1]");
... | function_block-full_function | [
{
"content": "/// Entry point for splitting whole message into possibly multiple [`Set`]s.\n\n// TODO: make it take message: Vec<u8> instead\n\npub fn split_into_sets<R: Rng>(\n\n rng: &mut R,\n\n message: &[u8],\n\n max_plaintext_size: usize,\n\n) -> Vec<FragmentSet> {\n\n let num_of_sets = total_n... |
Rust | src/lib.rs | aesteve/vertx-eventbus-client-rs | 2a8391d48f177d8ec9daaf9e2e973cb9d3502634 | use std::io;
pub mod listener;
pub mod message;
pub mod publisher;
mod utils;
use crate::listener::EventBusListener;
use crate::publisher::EventBusPublisher;
use std::net::{TcpStream, ToSocketAddrs};
pub fn eventbus<A: ToSocketAddrs>(address: A) -> io::Result<(EventBusPublisher, EventBusListener)> {
let socket = T... | use std::io;
pub mod listener;
pub mod message;
pub mod publisher;
mod utils;
use crate::listener::EventBusListener;
use crate::publisher::EventBusPublisher;
use std::net::{TcpStream, ToSocketAddrs};
pub fn eventbus<A: ToSocketAddrs>(address: A) -> io::Result<(EventBusPublisher, EventBusListener)> {
let socket = T... |
}
}
}
| if let Some(Ok(error_msg)) = error_listener.next() {
errors_received += 1;
assert!(error_msg.message.contains("denied"))
} | if_condition | [
{
"content": "type ErrorNotifier = Mutex<Option<Sender<UserMessage<ErrorMessage>>>>;\n\n\n\npub struct EventBusListener {\n\n socket: TcpStream,\n\n handlers: MessageHandlersByAddress,\n\n error_handler: Arc<ErrorNotifier>,\n\n}\n\n\n\nimpl EventBusListener {\n\n pub fn new(socket: TcpStream) -> io:... |
Rust | pallets/stake-nft/src/mock.rs | SubGame-Network/subgame-network | d9906befc41e972e11fa1a669d47eddb15dabdd8 |
use crate as pallet_stake_nft;
use pallet_timestamp;
use balances;
use frame_support::parameter_types;
use frame_system as system;
use pallet_nft;
use pallet_lease;
use sp_core::H256;
use sp_runtime::{
testing::Header,
traits::{BlakeTwo256, IdentityLookup},
};
type UncheckedExtrinsic = frame_system::mocking::... |
use crate as pallet_stake_nft;
use pallet_timestamp;
use balances;
use frame_support::parameter_types;
use frame_system as system;
use pallet_nft;
use pallet_lease;
use sp_core::H256;
use sp_runtime::{
testing::Header,
traits::{BlakeTwo256, IdentityLookup},
};
type UncheckedExtrinsic = frame_system::mocking::... | 0),
(3, 1000000),
(4, 1000000),
(5, 1000000),
],
}
.assimilate_storage(&mut t)
.unwrap();
let mut ext: sp_io::TestExternalities = t.into();
ext.execute_with(|| System::set_block_number(1));
ext
} | function_block-function_prefixed | [
{
"content": "type Block = frame_system::mocking::MockBlock<Test>;\n\n\n\n// Configure a mock runtime to test the pallet.\n\nframe_support::construct_runtime!(\n\n pub enum Test where\n\n Block = Block,\n\n NodeBlock = Block,\n\n UncheckedExtrinsic = UncheckedExtrinsic,\n\n {\n\n ... | |
Rust | core/codegen/tests/route.rs | Compro-Prasad/Rocket | 198b6f0e9726f7e53c61d365b797df630c876c59 |
#![deny(non_snake_case)]
#[macro_use] extern crate rocket;
use std::path::PathBuf;
use rocket::http::ext::Normalize;
use rocket::local::blocking::Client;
use rocket::data::{self, Data, FromData, ToByteUnit};
use rocket::request::{Request, Form};
use rocket::http::{Status, RawStr, ContentType};
#[derive(FromForm, ... |
#![deny(non_snake_case)]
#[macro_use] extern crate rocket;
use std::path::PathBuf;
use rocket::http::ext::Normalize;
use rocket::local::blocking::Client;
use rocket::data::{self, Data, FromData, ToByteUnit};
use rocket::request::{Request, Form};
use rocket::http::{Status, RawStr, ContentType};
#[derive(FromForm, ... |
mod scopes {
mod other {
#[get("/world")]
pub fn world() -> &'static str {
"Hello, world!"
}
}
#[get("/hello")]
pub fn hello() -> &'static str {
"Hello, outside world!"
}
use other::world;
fn _rocket() -> rocket::Rocket {
rocket::ignit... | dispatch();
assert_eq!(response.into_string().unwrap(), format!("({}, {}, {}, {}, {}, {}) ({})",
sky, name, "A A", "inside", path, simple, expected_uri));
} | function_block-function_prefix_line | [
{
"content": "fn test(uri: String, expected: String) {\n\n let client = Client::tracked(super::rocket()).unwrap();\n\n let response = client.get(&uri).dispatch();\n\n assert_eq!(response.into_string(), Some(expected));\n\n}\n\n\n",
"file_path": "examples/ranking/src/tests.rs",
"rank": 0,
"s... |
Rust | services/src/util/parsing.rs | 2younis/geoengine | 253eb7ff2c980511fecdec6ff8fb176d5365bc11 | use geoengine_datatypes::primitives::SpatialResolution;
use serde::de;
use serde::de::Error;
use serde::Deserialize;
use std::fmt;
use std::marker::PhantomData;
use std::str::FromStr;
use url::Url;
pub fn parse_spatial_resolution<'de, D>(deserializer: D) -> Result<SpatialResolution, D::Error>
where
D: serde::Deser... | use geoengine_datatypes::primitives::SpatialResolution;
use serde::de;
use serde::de::Error;
use serde::Deserialize;
use std::fmt;
use std::marker::PhantomData;
use std::str::FromStr;
use url::Url;
pub fn parse_spatial_resolution<'de, D>(deserializer: D) -> Result<SpatialResolution, D::Error>
where
D: serde::Deser... | ert_eq!(
serde_json::from_str::<Test>(r#"{"base_url": null}"#)
.unwrap()
.to_string(),
""
);
}
}
| struct Test {
#[serde(deserialize_with = "deserialize_base_url")]
base_url: Url,
}
impl Display for Test {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.write_str(&self.base_url.to_string())
}
}
assert_e... | random | [
{
"content": "pub fn spatial_reference_specification(srs_string: &str) -> Result<SpatialReferenceSpecification> {\n\n if let Some(sref) = custom_spatial_reference_specification(srs_string) {\n\n return Ok(sref);\n\n }\n\n\n\n let spatial_reference = SpatialReference::from_str(srs_string).context... |
Rust | capstone-rs/examples/cstool.rs | froydnj/capstone-rs | 5044ace8022b1651d1b7c93d41ad56993e0225f5 | extern crate capstone;
extern crate clap;
#[macro_use]
extern crate log;
extern crate stderrlog;
use capstone::prelude::*;
use capstone::{Arch, Endian, EnumList, ExtraMode, Mode};
use clap::{App, Arg, ArgGroup};
use std::fmt::Display;
use std::fs::File;
use std::io::prelude::*;
use std::io;
use std::process::exit;
... | extern crate capstone;
extern crate clap;
#[macro_use]
extern crate log;
extern crate stderrlog;
use capstone::prelude::*;
use capstone::{Arch, Endian, EnumList, ExtraMode, Mode};
use clap::{App, Arg, ArgGroup};
use std::fmt::Display;
use std::fs::File;
use std::io::prelude::*;
use std::io;
use std::process::exit;
... | ("code")
.required(true),
)
.get_matches();
let direct_input_bytes: Vec<u8> = if let Some(file_path) = matches.value_of("file") {
let mut file = File::open(file_path).expect_exit();
let capacity = match file.metadata() {
Err(_) => DEFAULT_CAPACITY,
... | unwrap_or("")
).is_ok();
if show_detail {
let detail = cs.insn_detail(&i).expect("Failed to get insn detail");
let output: &[(&str, String)] = &[
("insn id:", format!("{:?}", i.id().0)),
("read regs:", reg_names(&cs, detail.regs_read())),
... | random | [
{
"content": "/// Disassemble code and print information\n\nfn arch_example(cs: &mut Capstone, code: &[u8]) -> CsResult<()> {\n\n let insns = cs.disasm_all(code, 0x1000)?;\n\n println!(\"Found {} instructions\", insns.len());\n\n for i in insns.iter() {\n\n println!();\n\n println!(\"{}\"... |
Rust | compiler/context.rs | mwatts/arret | 3b3bae27ca7283376d420fa7d69fe5073ecf9ef0 | use crate::hir::PackagePaths;
use crate::rfi;
use crate::source::SourceLoader;
use std::collections::{HashMap, HashSet};
use std::sync::Arc;
use std::{hash, path};
use codespan_reporting::diagnostic::Diagnostic;
use arret_syntax::datum::Datum;
use arret_syntax::span::{FileId, Span};
use crate::hir;
use crate::hir::... | use crate::hir::PackagePaths;
use crate::rfi;
use crate::source::SourceLoader;
use std::collections::{HashMap, HashSet};
use std::sync::Arc;
use std::{hash, path};
use codespan_reporting::diagnostic::Diagnostic;
use arret_syntax::datum::Datum;
use arret_syntax::span::{FileId, Span};
use crate::hir;
use crate::hir::... |
defs.push(def);
inferred_locals.insert(local_id, arret_type);
exports.insert(fun_name_data_str, hir::scope::Binding::Var(None, local_id));
}
Module {
module_id: ModuleId::alloc(),
imports: HashMap::new(),
defs,
inferred_locals: Arc::new(inferred_locals... | let def = hir::Def::<hir::Inferred> {
span,
macro_invocation_span: None,
destruc: hir::destruc::Destruc::Scalar(
span,
hir::destruc::Scalar::new(
Some(local_id),
fun_name_data_str.clone(),
arr... | assignment_statement | [
{
"content": "/// Adds internal member fields common to all inline and external records\n\npub fn append_common_internal_members(tcx: &mut TargetCtx, members: &mut Vec<LLVMTypeRef>) {\n\n unsafe {\n\n members.extend_from_slice(&[\n\n // is_inline\n\n LLVMInt8TypeInContext(tcx.llx... |
Rust | tests/category_dist_sums.rs | bostontrader/bookwerx-core-rust | 35f8ac82b22399ffb1ae0eabc4dcd186395d9fc3 | use bookwerx_core_rust::db as D;
use rocket::http::Status;
use rocket::local::Client;
use bookwerx_core_rust::dfp::dfp::{DFP, Sign, dfp_abs, dfp_add};
pub fn category_dist_sums(client: &Client, apikey: &String, categories: &Vec<D::Category>) -> () {
let mut response = client
.get(format!(
... | use bookwerx_core_rust::db as D;
use rocket::http::Status;
use rocket::local::Client;
use bookwerx_core_rust::dfp::dfp::{DFP, Sign, dfp_abs, dfp_add};
| pub fn category_dist_sums(client: &Client, apikey: &String, categories: &Vec<D::Category>) -> () {
let mut response = client
.get(format!(
"/category_dist_sums?apikey={}&category_id=666",
&apikey
))
.dispatch();
let mut r: D::Sums = serde_json::from_str(&(res... | function_block-full_function | [
{
"content": "use bookwerx_core_rust::db as D;\n\nuse rocket::http::Status;\n\nuse rocket::local::Client;\n\nuse bookwerx_core_rust::dfp::dfp::{DFP, Sign};\n\n\n",
"file_path": "tests/account_dist_sum.rs",
"rank": 0,
"score": 8.044035556254066
},
{
"content": "use bookwerx_core_rust::dfp::df... | |
Rust | src/vdac0/opa2_cal.rs | timokroeger/efm32pg12-pac | bbe43a716047334a3cd51de8e0e3d51280497689 | #[doc = "Reader of register OPA2_CAL"]
pub type R = crate::R<u32, super::OPA2_CAL>;
#[doc = "Writer for register OPA2_CAL"]
pub type W = crate::W<u32, super::OPA2_CAL>;
#[doc = "Register OPA2_CAL `reset()`'s with value 0x80e7"]
impl crate::ResetValue for super::OPA2_CAL {
type Type = u32;
#[inline(always)]
... | #[doc = "Reader of register OPA2_CAL"]
pub type R = crate::R<u32, super::OPA2_CAL>;
#[doc = "Writer for register OPA2_CAL"]
pub type W = crate::W<u32, super::OPA2_CAL>;
#[doc = "Register OPA2_CAL `reset()`'s with value 0x80e7"]
impl crate::ResetValue for super::OPA2_CAL {
type Type = u32;
#[inline(always)]
... | self }
}
#[doc = "Bits 17:18 - Gm3 Trim Value"]
#[inline(always)]
pub fn gm3(&mut self) -> GM3_W {
GM3_W { w: self }
}
#[doc = "Bits 20:24 - OPAx Non-Inverting Input Offset Configuration Value"]
#[inline(always)]
pub fn offsetp(&mut self) -> OFFSETP_W {
OFFSETP_W { w: sel... | [inline(always)]
pub unsafe fn bits(self, value: u8) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x03 << 17)) | (((value as u32) & 0x03) << 17);
self.w
}
}
#[doc = "Reader of field `OFFSETP`"]
pub type OFFSETP_R = crate::R<u8, u8>;
#[doc = "Write proxy for field `OFFSETP`"]
pub struct OFFSETP_... | random | [
{
"content": "#[doc = \"Reset value of the register\"]\n\n#[doc = \"\"]\n\n#[doc = \"This value is initial value for `write` method.\"]\n\n#[doc = \"It can be also directly writed to register by `reset` method.\"]\n\npub trait ResetValue {\n\n #[doc = \"Register size\"]\n\n type Type;\n\n #[doc = \"Res... |
Rust | src/uu/sort/src/merge.rs | oconnor663/coreutils | c7930a63f7221a6b0e3791c15529e6b10de07ef2 |
use std::{
cmp::Ordering,
ffi::OsStr,
io::{Read, Write},
iter,
rc::Rc,
sync::mpsc::{channel, sync_channel, Receiver, Sender, SyncSender},
thread,
};
use compare::Compare;
use crate::{
chunks::{self, Chunk},
compare_by, open, GlobalSettings,
};
pub fn merge<'a>(files: &[impl AsRe... |
use std::{
cmp::Ordering,
ffi::OsStr,
io::{Read, Write},
iter,
rc::Rc,
sync::mpsc::{channel, sync_channel, Receiver, Sender, SyncSender},
thread,
};
use compare::Compare;
use crate::{
chunks::{self, Chunk},
compare_by, open, GlobalSettings,
};
pub fn merge<'a>(files: &[impl AsRe... | ;
if cmp == Ordering::Equal {
cmp = a.file_number.cmp(&b.file_number);
}
cmp.reverse()
}
}
| compare_by(
&a.current_chunk.borrow_lines()[a.line_idx],
&b.current_chunk.borrow_lines()[b.line_idx],
self.settings,
) | call_expression | [
{
"content": "/// Write the lines in `chunk` to `file`, separated by `separator`.\n\nfn write(chunk: &mut Chunk, file: &Path, separator: u8) {\n\n chunk.with_lines_mut(|lines| {\n\n // Write the lines to the file\n\n let file = crash_if_err!(1, OpenOptions::new().create(true).write(true).open(f... |
Rust | router/src/dml_handlers/partitioner.rs | r4ntix/influxdb_iox | 5ff874925101e2afbafa6853385260a2ba044394 | use super::DmlHandler;
use async_trait::async_trait;
use data_types::{DatabaseName, DeletePredicate, PartitionTemplate};
use hashbrown::HashMap;
use mutable_batch::{MutableBatch, PartitionWrite, WritePayload};
use observability_deps::tracing::*;
use thiserror::Error;
use trace::ctx::SpanContext;
#[derive(Debug, Error)... | use super::DmlHandler;
use async_trait::async_trait;
use data_types::{DatabaseName, DeletePredicate, PartitionTemplate};
use hashbrown::HashMap;
use mutable_batch::{MutableBatch, PartitionWrite, WritePayload};
use observability_deps::tracing::*;
use thiserror::Error;
use trace::ctx::SpanContext;
#[derive(Debug, Error)... | ;
let table_batch = partition
.raw_entry_mut()
.from_key(&table_name)
.or_insert_with(|| (table_name.to_owned(), MutableBatch::default()));
partition_payload.write_to_batch(table_batch.1)?;
}
}
Ok(p... | Map::default();
for (table_name, batch) in batch {
for (partition_key, partition_payload) in
PartitionWrite::partition(&table_name, &batch, &self.partition_template)
{
let partition = partitions.entry(partition_key).or_default() | function_block-random_span | [] |
Rust | 07-rust/stm32f446/stm32f446_pac/src/rcc/cr.rs | aaronhktan/stm32-exploration | dcd7674424cd17b02b85c6b3ce533456d5037d65 | #[doc = "Reader of register CR"]
pub type R = crate::R<u32, super::CR>;
#[doc = "Writer for register CR"]
pub type W = crate::W<u32, super::CR>;
#[doc = "Register CR `reset()`'s with value 0x83"]
impl crate::ResetValue for super::CR {
type Type = u32;
#[inline(always)]
fn reset_value() -> Self::Type {
... | #[doc = "Reader of register CR"]
pub type R = crate::R<u32, super::CR>;
#[doc = "Writer for register CR"]
pub type W = crate::W<u32, super::CR>;
#[doc = "Register CR `reset()`'s with value 0x83"]
impl crate::ResetValue for super::CR {
type Type = u32;
#[inline(always)]
fn reset_value() -> Self::Type {
... | 18) & 0x01) != 0)
}
#[doc = "Bit 17 - HSE clock ready flag"]
#[inline(always)]
pub fn hserdy(&self) -> HSERDY_R {
HSERDY_R::new(((self.bits >> 17) & 0x01) != 0)
}
#[doc = "Bit 16 - HSE clock enable"]
#[inline(always)]
pub fn hseon(&self) -> HSEON_R {
HSEON_R::new(((self.... | }
}
#[doc = "Reader of field `HSIRDY`"]
pub type HSIRDY_R = crate::R<bool, bool>;
#[doc = "Reader of field `HSION`"]
pub type HSION_R = crate::R<bool, bool>;
#[doc = "Write proxy for field `HSION`"]
pub struct HSION_W<'a> {
w: &'a mut W,
}
impl<'a> HSION_W<'a> {
#[doc = r"Sets the field bit"]
#[inline(a... | random | [
{
"content": "#[doc = \"Reset value of the register\"]\n\n#[doc = \"\"]\n\n#[doc = \"This value is initial value for `write` method.\"]\n\n#[doc = \"It can be also directly writed to register by `reset` method.\"]\n\npub trait ResetValue {\n\n #[doc = \"Register size\"]\n\n type Type;\n\n #[doc = \"Res... |
Rust | 06/chronal-manhattan/src/main.rs | mnem/advent-of-code-2018 | f2f5821d29fcf111ef4c1ff963bc4636626781f6 | extern crate regex;
use std::fs;
use std::cmp;
use regex::Regex;
fn main() {
let input = read_input();
let result = process(&input);
println!("Result: {}\n", result);
}
fn read_input() -> String {
let input_filename = String::from("input.txt");
fs::read_to_string(input_filename)
.expect("... | extern crate regex;
use std::fs;
use std::cmp;
use regex::Regex;
fn main() {
let input = read_input();
let result = process(&input);
println!("Result: {}\n", result);
}
fn read_input() -> String {
let input_filename = String::from("input.txt");
fs::read_to_string(input_filename)
.expect("... | te(&grid, extent_x, extent_y);
assert_eq!(true, result);
let grid = vec![
-1, 0, -1,
-1, -1, -1,
-1, -1, -1,
];
let result = grid_is_infinite(&grid, extent_x, extent_y);
assert_eq!(true, result);
let grid = vec![
-1, -1, ... | }
fn from_lines(lines: &str) -> Vec<Point> {
let mut points = Vec::new();
for line in lines.lines() {
let line = line.trim();
if line.len() == 0 {
continue;
}
points.push(Point::from_string(line));
}
return points;
... | random | [
{
"content": "fn scored_grid_from(point: Point, extent_x: usize, extend_y: usize) -> Vec<i32> {\n\n let mut scores = Vec::new();\n\n for y in 0..extend_y {\n\n for x in 0..extent_x {\n\n let score = ((y as i32) - point.y).abs() + ((x as i32) - point.x).abs();\n\n scores.push(s... |
Rust | src/commands/kv/bucket/sync.rs | aleclarson/wrangler | 37d0506a845d6122190b0a43865a59e839347c1b | use std::collections::HashSet;
use std::fs::metadata;
use std::iter::FromIterator;
use std::path::Path;
use cloudflare::endpoints::workerskv::write_bulk::KeyValuePair;
use crate::commands::kv;
use crate::commands::kv::bucket::directory_keys_only;
use crate::commands::kv::bucket::directory_keys_values;
use crate::comm... | use std::collections::HashSet;
use std::fs::metadata;
use std::iter::FromIterator;
use std::path::Path;
use cloudflare::endpoints::workerskv::write_bulk::KeyValuePair;
use crate::commands::kv;
use crate::commands::kv::bucket::directory_keys_only;
use crate::commands::kv::bucket::directory_keys_values;
use crate::comm... |
fn check_kv_pairs_equality(expected: Vec<KeyValuePair>, actual: Vec<KeyValuePair>) {
assert!(expected.len() == actual.len());
for (idx, pair) in expected.into_iter().enumerate() {
assert!(pair.key == actual[idx].key);
asse... | ys = HashSet::new();
exclude_keys.insert(key_a_old.clone());
exclude_keys.insert(key_b_old);
let pairs_to_upload = vec![
KeyValuePair {
key: key_a_old,
value: "old".to_string(),
expiration_ttl: None,
expiratio... | function_block-function_prefixed | [
{
"content": "pub fn create_secret(name: &str, user: &GlobalUser, target: &Target) -> Result<(), failure::Error> {\n\n validate_target(target)?;\n\n\n\n let secret_value = interactive::get_user_input(&format!(\n\n \"Enter the secret text you'd like assigned to the variable {} on the script named {}... |
Rust | rust/src/cosmos/crypto/multisig.rs | PFC-Validator/terra.proto | 4939cca497ba641046d18546dd234fd33a3f61c6 |
#![allow(unknown_lints)]
#![allow(clippy::all)]
#![allow(unused_attributes)]
#![cfg_attr(rustfmt, rustfmt::skip)]
#![allow(box_pointers)]
#![allow(dead_code)]
#![allow(missing_docs)]
#![allow(non_camel_case_types)]
#![allow(non_snake_case)]
#![allow(non_upper_case_globals)]
#![allow(trivial_casts)]
#![allow(unused_... |
#![allow(unknown_lints)]
#![allow(clippy::all)]
#![allow(unused_attributes)]
#![cfg_attr(rustfmt, rustfmt::skip)]
#![allow(box_pointers)]
#![allow(dead_code)]
#![allow(missing_docs)]
#![allow(non_camel_case_types)]
#![allow(non_snake_case)]
#![allow(non_upper_case_globals)]
#![allow(trivial_casts)]
#![allow(unused_... | d },
|m: &mut CompactBitArray| { &mut m.extra_bits_stored },
));
fields.push(::protobuf::reflect::accessor::make_simple_field_accessor::<_, ::protobuf::types::ProtobufTypeBytes>(
"elems",
|m: &CompactBitArray| { &m.elems },
|m: &mut... | ze += ::protobuf::rt::unknown_fields_size(self.get_unknown_fields());
self.cached_size.set(my_size);
my_size
}
fn write_to_with_cached_sizes(&self, os: &mut ::protobuf::CodedOutputStream<'_>) -> ::protobuf::ProtobufResult<()> {
for v in &self.signatures {
os.write_bytes(1, &... | random | [
{
"content": "pub fn file_descriptor_proto() -> &'static ::protobuf::descriptor::FileDescriptorProto {\n\n file_descriptor_proto_lazy.get(|| {\n\n parse_descriptor_proto()\n\n })\n\n}\n",
"file_path": "rust/src/tendermint/crypto/proof.rs",
"rank": 0,
"score": 222119.91363063856
},
{... |
Rust | tss-esapi/tests/integration_tests/context_tests/tpm_commands/non_volatile_storage_tests.rs | Superhepper/rust-tss-esapi | a6ae84793e73b10dd672b613ada820566c84fe85 |
mod test_nv_define_space {
use crate::common::create_ctx_with_session;
use tss_esapi::{
attributes::NvIndexAttributesBuilder,
handles::NvIndexTpmHandle,
interface_types::{algorithm::HashingAlgorithm, resource_handles::Provision},
nv::storage::NvPublicBuilder,
};
#[test... |
mod test_nv_define_space {
use crate::common::create_ctx_with_session;
use tss_esapi::{
attributes::NvIndexAttributesBuilder,
handles::NvIndexTpmHandle,
interface_types::{algorithm::HashingAlgorithm, resource_handles::Provision},
nv::storage::NvPublicBuilder,
};
#[test... |
}
mod test_nv_undefine_space {
use crate::common::create_ctx_with_session;
use tss_esapi::{
attributes::NvIndexAttributesBuilder,
handles::NvIndexTpmHandle,
interface_types::{algorithm::HashingAlgorithm, resource_handles::Provision},
nv::storage::NvPublicBuilder,
};
#[... | t owner_nv_index_attributes = NvIndexAttributesBuilder::new()
.with_owner_write(true)
.with_owner_read(true)
.build()
.expect("Failed to create owner nv index attributes");
let owner_nv_public = NvPublicBuilder::new()
.with_nv_index(nv_index)
... | function_block-function_prefixed | [
{
"content": "fn write_nv_index(context: &mut Context, nv_index: NvIndexTpmHandle) -> NvIndexHandle {\n\n // Create owner nv public.\n\n let owner_nv_index_attributes = NvIndexAttributesBuilder::new()\n\n .with_owner_write(true)\n\n .with_owner_read(true)\n\n .with_pp_read(true)\n\n ... |
Rust | src/syntax/src/statement.rs | isaacazuelos/kurt | f86c3230d9d0cd54b307eda27e3ddbb4c145d1f0 |
use parser::Parse;
use crate::lexer::{Reserved, TokenKind};
use super::*;
#[derive(Debug)]
pub enum Statement<'a> {
Binding(Binding<'a>),
Empty(Span),
Expression(Expression<'a>),
If(IfOnly<'a>),
}
impl<'a> Syntax for Statement<'a> {
fn span(&self) -> Span {
match self {
Sta... |
use parser::Parse;
use crate::lexer::{Reserved, TokenKind};
use super::*;
#[derive(Debug)]
pub enum Statement<'a> {
Binding(Binding<'a>),
Empty(Span),
Expression(Expression<'a>),
If(IfOnly<'a>),
}
impl<'a> Syntax for Statement<'a> {
|
}
impl<'a> Parse<'a> for Statement<'a> {
type SyntaxError = SyntaxError;
fn parse_with(parser: &mut Parser<'a>) -> SyntaxResult<Statement<'a>> {
match parser.peek_kind() {
Some(TokenKind::Semicolon) => {
Ok(Statement::Empty(parser.next_span()))
}
S... | fn span(&self) -> Span {
match self {
Statement::Binding(b) => b.span(),
Statement::Empty(s) => *s,
Statement::Expression(s) => s.span(),
Statement::If(i) => i.span(),
}
} | function_block-full_function | [] |
Rust | component/src/desktop_window.rs | rohankumardubey/makepad | 2248d20bd8e1431616acc89846a841abc36dffb7 | use makepad_render::*;
use crate::desktop_button::*;
use crate::window_menu::*;
use crate::button_logic::*;
live_register!{
use crate::theme::*;
DesktopWindow: {{DesktopWindow}} {
clear_color: (COLOR_WINDOW_BG)
caption_bg: {color: (COLOR_WINDOW_CAPTION)}
caption: "Desktop Window",
... | use makepad_render::*;
use crate::desktop_button::*;
use crate::window_menu::*;
use crate::button_logic::*;
live_register!{
use crate::theme::*;
DesktopWindow: {{DesktopWindow}} {
clear_color: (COLOR_WINDOW_BG)
caption_bg: {color: (COLOR_WINDOW_CAPTION)}
caption: "Desktop Window",
... |
}
| p_button(cx, DesktopButtonType::XRMode);
}
self.main_view.end(cx);
self.pass.end(cx);
self.window.end(cx);
} | function_block-function_prefixed | [
{
"content": "pub fn new_cxthread(&mut self) -> CxThread {\n\n CxThread {cx: self as *mut _ as u64}\n\n }\n\n \n\n pub fn get_mapped_texture_user_data(&mut self, texture: &Texture) -> Option<usize> {\n\n if let Some(texture_id) = texture.texture_id {\n\n let cxtexture = &self.t... |
Rust | src/main.rs | jeff-lund/Molecule | c37aeffce87abea007a56b82ed0d1cd474cb8530 |
#![allow(dead_code)]
#![allow(unused_assignments)]
#![allow(unused_variables)]
mod utility;
use utility::*;
mod atoms;
use atoms::*;
use std::env::args;
use std::fs::File;
use std::io::prelude::*;
const DEBUG: bool = false;
const MAX_GENERATIONS: u32 = 200;
fn pprint (molecule: &Molecule, atoms: &Vec<&str>, peaks: &... |
#![allow(dead_code)]
#![allow(unused_assignments)]
#![allow(unused_variables)]
mod utility;
use utility::*;
mod atoms;
use atoms::*;
use std::env::args;
use std::fs::File;
use std::io::prelude::*;
const DEBUG: bool = false;
const MAX_GENERATIONS: u32 = 200;
fn pprint (molecule: &Molecule, atoms: &Vec<&str>, peaks: &... |
fn main() -> std::io::Result<()> {
let f = args().nth(1).expect("No file argument given");
let mut file = File::open(f)?;
let mut buffer = String::new();
file.read_to_string(&mut buffer)?;
let mut b = buffer.lines();
let chemical_formula = parse_elemental_analysis(b.next().expect("i... | print!("Experimental Chemical Shifts: {}", peaks[0]);
for entry in peaks.iter().skip(1) {
print!(", {}", entry);
}
println!("");
} | function_block-function_prefix_line | [
{
"content": "/// Validate the overall correctness of a chromosome\n\nfn validate_chromosome(chromosome: &Chromosome, atoms: &Vec<&str>, num_bonds: u32) -> bool {\n\n // check proper number of bonds exist\n\n let bonds: u32 = chromosome.iter().sum();\n\n if bonds != num_bonds {\n\n return false;... |
Rust | src/hotkey_config.rs | Ynscription/livesplit-core | 1027a92faaf8eeb14ce8be8a32ce8d3f202bc664 | #![allow(clippy::trivially_copy_pass_by_ref)]
use crate::hotkey::KeyCode;
use crate::platform::prelude::*;
use crate::settings::{Field, SettingsDescription, Value};
use serde::{Deserialize, Serialize};
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash, Serialize, Deserialize)]
#[serde(default)]
pub struct HotkeyConfig... | #![allow(clippy::trivially_copy_pass_by_ref)]
use crate::hotkey::KeyCode;
use crate::platform::prelude::*;
use crate::settings::{Field, SettingsDescription, Value};
use serde::{Deserialize, Serialize};
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash, Serialize, Deserialize)]
#[serde(default)]
pub struct HotkeyConfig... | on = value,
8 => self.toggle_timing_method = value,
_ => panic!("Unsupported Setting Index"),
}
Ok(())
}
#[cfg(feature = "std")]
pub fn from_json<R>(reader: R) -> serde_json::Result<Self>
where
R: std::io::Read,
{
serde_json::from_reader... | (NumPad2),
pause: Some(NumPad5),
undo_all_pauses: None,
previous_comparison: Some(NumPad4),
next_comparison: Some(NumPad6),
toggle_timing_method: None,
}
}
}
#[cfg(all(target_arch = "wasm32", target_os = "unknown"))]
impl Default for HotkeyConfig ... | random | [
{
"content": "/// Registers a clock as the global handler for providing the high precision\n\n/// time stamps on a `no_std` target.\n\npub fn register_clock(clock: impl Clock) {\n\n let clock: Box<dyn Clock> = Box::new(clock);\n\n let clock = Box::new(clock);\n\n // FIXME: This isn't entirely clean as ... |
Rust | sqldb/rust/src/sqldb.rs | thomastaylor312/interfaces | 621d0d88772db85591d8625cca82264799e6ef64 |
#![allow(unused_imports, clippy::ptr_arg, clippy::needless_lifetimes)]
use async_trait::async_trait;
use serde::{Deserialize, Serialize};
use std::{borrow::Cow, io::Write, string::ToString};
use wasmbus_rpc::{
deserialize, serialize, Context, Message, MessageDispatch, RpcError, RpcResult, SendOpts,
Timestamp,... |
#![allow(unused_imports, clippy::ptr_arg, clippy::needless_lifetimes)]
use async_trait::async_trait;
use serde::{Deserialize, Serialize};
use std::{borrow::Cow, io::Write, string::ToString};
use wasmbus_rpc::{
deserialize, serialize, Context, Message, MessageDispatch, RpcError, RpcResult, SendOpts,
Timestamp,... |
}
#[derive(Debug)]
pub struct SqlDbSender<T: Transport> {
transport: T,
}
impl<T: Transport> SqlDbSender<T> {
pub fn via(transport: T) -> Self {
Self { transport }
}
pub fn set_timeout(&self, interval: std::time::Duration) {
self.transport.set_timeout(interval);
}
}
#[cfg(t... | map_err(|e| RpcError::Deser(format!("message '{}': {}", message.method, e)))?;
let resp = SqlDb::fetch(self, ctx, &value).await?;
let buf = serialize(&resp)?;
Ok(Message {
method: "SqlDb.Fetch",
arg: Cow::Owned(buf),
... | function_block-function_prefix_line | [
{
"content": "#[doc(hidden)]\n\n#[async_trait]\n\npub trait KeyValueReceiver: MessageDispatch + KeyValue {\n\n async fn dispatch(&self, ctx: &Context, message: &Message<'_>) -> RpcResult<Message<'_>> {\n\n match message.method {\n\n \"Increment\" => {\n\n let value: Increment... |
Rust | src/usbdcd/control/mod.rs | Meptl/mk20d7 | c7cd01cf55214b0b53fae7c7672607e739b64663 | #[doc = r" Value read from the register"]
pub struct R {
bits: u32,
}
#[doc = r" Value to write to the register"]
pub struct W {
bits: u32,
}
impl super::CONTROL {
#[doc = r" Modifies the contents of the register"]
#[inline]
pub fn modify<F>(&self, f: F)
where
for<'w> F: FnOnce(&R, &'w m... | #[doc = r" Value read from the register"]
pub struct R {
bits: u32,
}
#[doc = r" Value to write to the register"]
pub struct W {
bits: u32,
}
impl super::CONTROL {
#[doc = r" Modifies the contents of the register"]
#[inline]
pub fn modify<F>(&self, f: F)
where
for<'w> F: FnOnce(&R, &'w m... |
#[allow(missing_docs)]
#[doc(hidden)]
#[inline]
pub fn _from(value: bool) -> IFR {
match value {
false => IFR::_0,
true => IFR::_1,
}
}
#[doc = "Checks if the value of the field is `_0`"]
#[inline]
pub fn is_0(&self) -> bool {
*self == IFR... | pub fn bit(&self) -> bool {
match *self {
IFR::_0 => false,
IFR::_1 => true,
}
} | function_block-full_function | [
{
"content": "fn main() {\n\n if env::var_os(\"CARGO_FEATURE_RT\").is_some() {\n\n let out = &PathBuf::from(env::var_os(\"OUT_DIR\").unwrap());\n\n File::create(out.join(\"device.x\"))\n\n .unwrap()\n\n .write_all(include_bytes!(\"device.x\"))\n\n .unwrap();\n\n... |
Rust | src/utils/redis/pubsub.rs | greglearns/portier-broker | 935fcce0405fd0e3ac70ee8922c0f62bf0823a75 | use futures_util::future::poll_fn;
use redis::{ConnectionAddr, ConnectionInfo, ErrorKind, RedisError, RedisResult, Value};
use std::collections::hash_map::{Entry, HashMap};
use std::future::Future;
use std::io::Result as IoResult;
use std::net::ToSocketAddrs;
use std::pin::Pin;
use std::task::Poll;
use tokio::io::{self... | use futures_util::future::poll_fn;
use redis::{ConnectionAddr, ConnectionInfo, ErrorKind, RedisError, RedisResult, Value};
use std::collections::hash_map::{Entry, HashMap};
use std::future::Future;
use std::io::Result as IoResult;
use std::net::ToSocketAddrs;
use std::pin::Pin;
use std::task::Poll;
use tokio::io::{self... | }
panic!("Tried to subscribe on closed pubsub connection");
}
}
pub async fn connect(info: &ConnectionInfo) -> RedisResult<Subscriber> {
let (rx, tx): (
Box<dyn io::AsyncRead + Unpin + Send>,
Box<dyn io::AsyncWrite + Unpin + Send>,
) = match *info.addr {
ConnectionAdd... | reply: reply_tx,
};
if self.cmd.send(cmd).await.is_ok() {
if let Ok(rx) = reply_rx.await {
return rx;
}
| function_block-random_span | [
{
"content": "#[inline]\n\npub fn decode<T: ?Sized + AsRef<[u8]>>(data: &T) -> Result<Vec<u8>, ()> {\n\n base64::decode_config(data, base64::URL_SAFE_NO_PAD).map_err(|_| ())\n\n}\n",
"file_path": "src/utils/base64url.rs",
"rank": 2,
"score": 202123.42041081307
},
{
"content": "/// Parse a... |
Rust | src/util.rs | HEnquist/flexi_logger | 5a89eb567d35a7821b682e95e9328859b133c042 | use crate::{deferred_now::DeferredNow, FormatFunction};
use log::Record;
use std::cell::RefCell;
use std::io::Write;
#[cfg(test)]
use std::io::Cursor;
#[cfg(test)]
use std::sync::{Arc, Mutex};
#[cfg(feature = "async")]
pub(crate) const ASYNC_FLUSH: &[u8] = b"F";
#[cfg(feature = "async")]
pub(crate) const ASYNC_SHUTDO... | use crate::{deferred_now::DeferredNow, FormatFunction};
use log::Record;
use std::cell::RefCell;
use std::io::Write;
#[cfg(test)]
use std::io::Cursor;
#[cfg(test)]
use std::sync::{Arc, Mutex};
#[cfg(feature = "async")]
pub(crate) const ASYNC_FLUSH: &[u8] = b"F";
#[cfg(feature = "async")]
pub(crate) const ASYNC_SHUTDO... | ;
result
}
| buffer_with(|tl_buf| match tl_buf.try_borrow_mut() {
Ok(mut buffer) => {
(format_function)(&mut *buffer, now, record)
.unwrap_or_else(|e| eprint_err(ERRCODE::Format, "formatting failed", &e));
buffer
.write_all(b"\n")
.unwrap_or_else(|e| ep... | call_expression | [
{
"content": "fn push_err(s: &str, parse_errs: &mut String) {\n\n if !parse_errs.is_empty() {\n\n parse_errs.push_str(\"; \");\n\n }\n\n parse_errs.push_str(s);\n\n}\n\n\n",
"file_path": "src/log_specification.rs",
"rank": 0,
"score": 184303.19247900957
},
{
"content": "fn co... |
Rust | src/tools/clippy/clippy_lints/src/needless_arbitrary_self_type.rs | ohno418/rust | 395a09c3dafe0c7838c9ca41d2b47bb5e79a5b6d | use clippy_utils::diagnostics::span_lint_and_sugg;
use if_chain::if_chain;
use rustc_ast::ast::{BindingMode, Lifetime, Mutability, Param, PatKind, Path, TyKind};
use rustc_errors::Applicability;
use rustc_lint::{EarlyContext, EarlyLintPass};
use rustc_session::{declare_lint_pass, declare_tool_lint};
use rustc_span::sym... | use clippy_utils::diagnostics::span_lint_and_sugg;
use if_chain::if_chain;
use rustc_ast::ast::{BindingMode, Lifetime, Mutability, Param, PatKind, Path, TyKind};
use rustc_errors::Applicability;
use rustc_lint::{EarlyContext, EarlyLintPass};
use rustc_session::{declare_lint_pass, declare_tool_lint};
use rustc_span::sym... | e of the `self` parameter does not need to be arbitrary",
"consider to change this parameter to",
self_param,
applicability,
)
}
}
}
impl EarlyLintPass for NeedlessArbitrarySelfType {
fn check_param(&mut self, cx: &EarlyContext<'_>, p: &Param)... | ".to_string(),
};
span_lint_and_sugg(
cx,
NEEDLESS_ARBITRARY_SELF_TYPE,
span,
"the typ | random | [] |
Rust | storage/aptosdb/src/pruner/mod.rs | JoshLind/aptos-core | a58a87106bde10eccb8954128cd31700b76e95c1 |
mod db_pruner;
pub(crate) mod db_sub_pruner;
pub(crate) mod event_store;
mod ledger_store;
pub(crate) mod state_store;
pub(crate) mod transaction_store;
pub mod utils;
pub(crate) mod worker;
use crate::metrics::APTOS_STORAGE_PRUNE_WINDOW;
use aptos_config::config::StoragePrunerConfig;
use aptos_infallible::Mutex;
... |
mod db_pruner;
pub(crate) mod db_sub_pruner;
pub(crate) mod event_store;
mod ledger_store;
pub(crate) mod state_store;
pub(crate) mod transaction_store;
pub mod utils;
pub(crate) mod worker;
use crate::metrics::APTOS_STORAGE_PRUNE_WINDOW;
use aptos_config::config::StoragePrunerConfig;
use aptos_infallible::Mutex;
... |
}
impl Drop for Pruner {
fn drop(&mut self) {
self.command_sender
.lock()
.send(Command::Quit)
.expect("Receiver should not destruct.");
self.worker_thread
.take()
.expect("Worker thread must exist.")
.join()
.expe... | let least_readable_state_store_version = latest_version - self.state_store_prune_window;
const TIMEOUT: Duration = Duration::from_secs(10);
let end = Instant::now() + TIMEOUT;
while Instant::now() < end {
if *self
.least_readable_vers... | function_block-function_prefix_line | [
{
"content": "/// Fetches the latest synced version from the specified storage\n\npub fn fetch_latest_synced_version(storage: Arc<dyn DbReader>) -> Result<Version, Error> {\n\n let latest_transaction_info =\n\n storage\n\n .get_latest_transaction_info_option()\n\n .map_err(|error... |
Rust | src/basic/constpool.rs | orasunis/jbcrs | 723185189c8422b1a1d1eb3a0bacb59ed00cf00a | use std::hash::{Hash, Hasher};
use std::collections::HashMap;
use std::cmp::{Eq, PartialEq};
use std::rc::Rc;
use std::slice::Iter;
use result::*;
#[derive(Debug, Clone)]
pub enum Item {
UTF8(String),
Integer(i32),
Float(f32),
Long(i64),
Double(f64),
... | use std::hash::{Hash, Hasher};
use std::collections::HashMap;
use std::cmp::{Eq, PartialEq};
use std::rc::Rc;
use std::slice::Iter;
use result::*;
#[derive(Debug, Clone)]
pub enum Item {
UTF8(String),
Integer(i32),
Float(f32),
Long(i64),
Double(f64),
... |
pub fn iter(&self) -> PoolIter {
PoolIter {
iter: self.by_index.iter(),
index: 0,
}
}
}
pub struct PoolIter<'a> {
iter: Iter<'a, Option<Rc<Item>>>,
index: u16,
}
impl<'a> Iterator for PoolIter<'a> {
type Item = (u16, &'a Item);
fn next(&mut self) -> O... | pub fn push(&mut self, item: Item) -> Result<u16> {
if self.len() == u16::max_value() {
return Err(Error::CPTooLarge);
}
let double = item.is_double();
let length = &mut self.length;
let rc_item = Rc::new(item);
let rc_item1 = Rc::clone(&rc_item);
l... | function_block-full_function | [
{
"content": "/// Parses the class file, which is represented as a byte array.\n\n/// The constant pool and the class is returned, if no error occurred.\n\npub fn parse(input: &[u8]) -> Result<(Pool, Class)> {\n\n // create a new decoder from the byte array\n\n let mut cursor = 0;\n\n let mut decoder =... |
Rust | tests/builder.rs | denzp/rust-ptx-builder | 4b5bb6845674417d04f3cba48ba0cda6f5c4772a | use std::env;
use std::env::current_dir;
use std::fs::{remove_dir_all, File};
use std::io::prelude::*;
use std::path::PathBuf;
use antidote::Mutex;
use lazy_static::*;
use ptx_builder::error::*;
use ptx_builder::prelude::*;
lazy_static! {
static ref ENV_MUTEX: Mutex<()> = Mutex::new(());
}
#[test]
fn should_pro... | use std::env;
use std::env::current_dir;
use std::fs::{remove_dir_all, File};
use std::io::prelude::*;
use std::path::PathBuf;
use antidote::Mutex;
use lazy_static::*;
use ptx_builder::error::*;
use ptx_builder::prelude::*;
lazy_static! {
static ref ENV_MUTEX: Mutex<()> = Mutex::new(());
}
#[test]
fn should_pro... | n cleanup_temp_location() {
let crate_names = &[
"faulty_ptx_crate",
"sample_app_ptx_crate",
"sample_ptx_crate",
"mixed_crate",
];
for name in crate_names {
remove_dir_all(env::temp_dir().join("ptx-builder-0.5").join(name)).unwrap_or_default();
}
} | function_block-function_prefixed | [
{
"content": "#[test]\n\nfn should_provide_output_path() {\n\n let source_crate = Crate::analyse(\"tests/fixtures/sample-crate\").unwrap();\n\n\n\n assert!(source_crate.get_output_path().unwrap().starts_with(\n\n env::temp_dir()\n\n .join(\"ptx-builder-0.5\")\n\n .join(\"sampl... | |
Rust | src/collector.rs | playXE/test | 50fae1922ef116908d09cdf81b301c153e980416 | use super::{allocation::ImmixSpace, block::ImmixBlock, constants::*, CollectionType};
use crate::{large_object_space::LargeObjectSpace, object::*, util::*};
use alloc::collections::VecDeque;
use core::ptr::NonNull;
use vec_map::VecMap;
pub struct ImmixCollector;
pub struct Visitor<'a> {
immix_space: &'a mut ImmixS... | use super::{allocation::ImmixSpace, block::ImmixBlock, constants::*, CollectionType};
use crate::{large_object_space::LargeObjectSpace, object::*, util::*};
use alloc::collections::VecDeque;
use core::ptr::NonNull;
use vec_map::VecMap;
pub struct ImmixCollector;
pub struct Visitor<'a> {
immix_space: &'a mut ImmixS... |
fn sweep_all_blocks(&mut self) -> (Vec<*mut ImmixBlock>, Vec<*mut ImmixBlock>) {
let mut unavailable_blocks = Vec::new();
let mut recyclable_blocks = Vec::new();
let mut free_blocks = Vec::new();
for block in self.all_blocks.drain(..) {
if unsafe { (*... | pub fn collect(
&mut self,
collection_type: &CollectionType,
roots: &[*mut RawGc],
precise_roots: &[*mut *mut RawGc],
immix_space: &mut ImmixSpace,
large_object_space: &mut LargeObjectSpace,
next_live_mark: bool,
) -> usize {
for block in &mut... | function_block-full_function | [
{
"content": "/// Check if `mem` is aligned for precise allocation\n\npub fn is_aligned_for_precise_allocation(mem: *mut u8) -> bool {\n\n let allocable_ptr = mem as usize;\n\n (allocable_ptr & (PreciseAllocation::ALIGNMENT - 1)) == 0\n\n}\n\n/// This space contains objects which are larger than the size ... |
Rust | frontend/apps/crates/utils/src/components/module_page.rs | Sheng-Long/ji-cloud | d12741467eb5d0ae15e3cece9d3428ef9d0050e3 | /* There are a few fundamental concepts going on here...
* 1. The serialized data does _not_ need to be Clone.
* rather, it's passed completely to the child
* and then the child is free to split it up for Mutable/etc.
* (here it is held and taken from an Option)
* 2. The loader will be skipped if the url ... | /* There are a few fundamental concepts going on here...
* 1. The serialized data does _not_ need to be Clone.
* rather, it's passed completely to the child
* and then the child is free to split it up for Mutable/etc.
* (here it is held and taken from an Option)
* 2. The loader will be skipped if the url ... | data))
} else {
None
}
})))
})
.with_node!(elem => {
.global_event(clone!(_self => move |evt:events::Resize| {
ModuleBounds::set(
... | :Rc<Self>) -> Self::Data;
fn render(_self: Rc<Self>, data: Self::Data) -> Dom;
}
pub struct ModulePage<T, R>
where
T: DeserializeOwned,
R: ModuleRenderer<Data = T>,
{
renderer: Rc<R>,
loaded_data: RefCell<Option<T>>,
has_loaded_data: Mutable<bool>,
wait_iframe_data: bool,
loader: Asy... | random | [
{
"content": "pub fn image_edit_category_child(name:&str) -> HtmlElement {\n\n TEMPLATES.with(|t| t.cache.render_elem(IMAGE_EDIT_CATEGORIES_CHILD, &html_map!{\n\n \"name\" => name\n\n }).unwrap_throw())\n\n}\n",
"file_path": "frontend/apps/crates/entry/admin/src/templates.rs",
"rank": 0,
... |
Rust | crates/augmented/application/audio-processor-standalone/src/options.rs | yamadapc/augmented-audio | 2f662cd8aa1a0ba46445f8f41c8483ae2dc552d3 | use std::ffi::OsString;
use clap::ArgMatches;
pub enum RenderingOptions {
Online {
input_file: Option<String>,
},
Offline {
input_file: String,
output_file: String,
},
}
pub struct MidiOptions {
pub input_file: Option<String>,
}
pub struct Options {
midi: MidiOptions,... | use std::ffi::OsString;
use clap::ArgMatches;
pub enum RenderingOptions {
Online {
input_file: Option<String>,
},
Offline {
input_file: String,
output_file: String,
},
}
pub struct MidiOptions {
pub input_file: Option<String>,
}
pub struct Options {
midi: MidiOptions,... |
fn parse_midi_options(matches: &ArgMatches) -> MidiOptions {
MidiOptions {
input_file: matches.value_of("midi-input-file").map(|s| s.into()),
}
}
fn parse_rendering_options(matches: &ArgMatches) -> RenderingOptions {
if matches.is_present("output-file") {
if !matches.is_present("input-fil... | fn parse_options_from<I, T>(supports_midi: bool, args: I) -> Options
where
I: IntoIterator<Item = T>,
T: Into<OsString> + Clone,
{
let app = clap::App::new("audio-processor-standalone");
let mut app = app
.arg(clap::Arg::from_usage(
"-i, --input-file=[INPUT_PATH] 'An input audio file... | function_block-function_prefix_line | [
{
"content": "pub fn render_to_xml<C: Component>(mut root: C) -> String {\n\n use xml::writer::{EmitterConfig, EventWriter, XmlEvent};\n\n\n\n let bytes = Vec::new();\n\n let buf_sink = BufWriter::new(bytes);\n\n let mut writer = EmitterConfig::new()\n\n .perform_indent(true)\n\n .crea... |
Rust | stm32-gen-features/src/lib.rs | topisani/embassy | 43a7226d8b8e5a2dabae8afbaf9e81651b59ca6e |
use std::{iter::FilterMap, path::Path, slice::Iter};
const SUPPORTED_FAMILIES: [&str; 10] = [
"stm32f0",
"stm32f1",
"stm32f4",
"stm32g0",
"stm32l0",
"stm32l1",
"stm32l4",
"stm32h7",
"stm32wb55",
"stm32wl55",
];
const SEPARATOR_START: &str = "# BEGIN GENERATED FEATURES\n";
con... |
use std::{iter::FilterMap, path::Path, slice::Iter};
const SUPPORTED_FAMILIES: [&str; 10] = [
"stm32f0",
"stm32f1",
"stm32f4",
"stm32g0",
"stm32l0",
"stm32l1",
"stm32l4",
"stm32h7",
"stm32wb55",
"stm32wl55",
];
const SEPARATOR_START: &str = "# BEGIN GENERATED FEATURES\n";
con... |
}
| fn does_not_generate_if_separators_are_missing() {
let initial = "\
before
# END GENERATED FEATURES
after
";
let new_contents = String::from("a = [\"b\"]\n");
generate_cargo_toml_file(initial, &new_contents);
} | function_block-full_function | [
{
"content": "/// Update a Cargo.toml file\n\n///\n\n/// Update the content between \"# BEGIN GENERATED FEATURES\" and \"# END GENERATED FEATURES\"\n\n/// with the given content\n\nfn update_cargo_file(path: &str, new_contents: &str) {\n\n let previous_text = std::fs::read_to_string(path).unwrap();\n\n le... |
Rust | identity-account/src/account/builder.rs | charlesthompson3/identity.rs | 713140734e86a4b11f85921009b491ff28b5cd10 |
#[cfg(feature = "stronghold")]
use std::path::PathBuf;
use std::sync::Arc;
#[cfg(feature = "stronghold")]
use zeroize::Zeroize;
use identity_account_storage::storage::MemStore;
use identity_account_storage::storage::Storage;
#[cfg(feature = "stronghold")]
use identity_account_storage::storage::Stronghold;
use ident... |
#[cfg(feature = "stronghold")]
use std::path::PathBuf;
use std::sync::Arc;
#[cfg(feature = "stronghold")]
use zeroize::Zeroize;
use identity_account_storage::storage::MemStore;
use identity_account_storage::storage::Storage;
#[cfg(feature = "stronghold")]
use identity_account_storage::storage::Stronghold;
use ident... |
#[must_use]
pub fn autosave(mut self, value: AutoSave) -> Self {
self.config = self.config.autosave(value);
self
}
#[must_use]
pub fn autopublish(mut self, value: bool) -> Self {
self.config = self.config.autopublish(value);
self
}
#[cfg(test)]
#[must_use]
p... | ccountConfig::new(),
storage_template: Some(AccountStorage::Memory),
storage: Some(Arc::new(MemStore::new())),
client_builder: None,
client: None,
}
} | function_block-function_prefixed | [
{
"content": "// implement Debug on the Enum from the `InputModel`.\n\npub fn impl_debug_enum(input: &InputModel) -> TokenStream {\n\n // collect appropriate data and generate param declarations.\n\n let diff: &Ident = input.diff();\n\n let evariants: &Vec<EVariant> = input.e_variants();\n\n\n\n let param_d... |
Rust | integration_test/src/transactional_event_stream_writer_tests.rs | claudiofahey/pravega-client-rust | efaccc1ba896588ffb125cd72378b07f714609e5 |
use pravega_client::event_stream_writer::EventStreamWriter;
use pravega_client_config::{ClientConfigBuilder, MOCK_CONTROLLER_URI};
use pravega_client_shared::*;
use pravega_connection_pool::connection_pool::ConnectionPool;
use pravega_controller_client::{ControllerClient, ControllerClientImpl};
use pravega_wire_proto... |
use pravega_client::event_stream_writer::EventStreamWriter;
use pravega_client_config::{ClientConfigBuilder, MOCK_CONTROLLER_URI};
use pravega_client_shared::*;
use pravega_connection_pool::connection_pool::ConnectionPool;
use pravega_controller_client::{ControllerClient, ControllerClientImpl};
use pravega_wire_proto... |
let cmd = GetStreamSegmentInfoCommand {
request_id: 0,
segment_name: segment.to_string(),
delegation_token: delegation_toke_provider
.retrieve_token(factory.get_controller_client())
.await,
};
let request = Requests::GetStreamSegmentInfo(cmd);
let rawclie... | let delegation_toke_provider = factory
.create_delegation_token_provider(ScopedStream::from(segment))
.await; | assignment_statement | [
{
"content": "fn test_simple_write_and_read(writer: &mut ByteStreamWriter, reader: &mut ByteStreamReader) {\n\n info!(\"test byte stream write and read\");\n\n let payload1 = vec![1; 4];\n\n let payload2 = vec![2; 4];\n\n\n\n let size1 = writer.write(&payload1).expect(\"write payload1 to byte stream... |
Rust | cs39/src/size_test.rs | gretchenfrage/CS639S20_Demos | d75a16cf66b6b95eb74fc8f101020672b62e5a90 |
use crate::{
cap_parse,
navigate::{
DemoLookup,
find_demo,
},
compile::{
cpp_files,
modify_compile,
Compiled,
},
output::{
INFO_INDENT,
TableWriter,
},
quant::{
subproc,
demo_min_time,
},
};
use std::{
path... |
use crate::{
cap_parse,
navigate::{
DemoLookup,
find_demo,
},
compile::{
cpp_files,
modify_compile,
Compiled,
},
output::{
INFO_INDENT,
TableWriter,
},
quant::{
subproc,
demo_min_time, | lone, Eq, PartialEq, Ord, PartialOrd, Hash, Debug)]
#[repr(usize)]
pub enum Dim { X, Y }
pub fn parse_dim_line(dim: Dim, line: &str) -> Option<u128> {
let pat = format!(
r#"^{}[[:space:]]+(?P<n>\d+)[[:space:]]*$"#,
regex::escape(&format!(
r##"#define {}DIM"##,
match dim {
... |
},
};
use std::{
path::Path,
process::Command,
mem::replace,
collections::HashMap,
fs::read_to_string,
ffi::OsString,
};
use regex::{self, Regex};
use byte_unit::Byte;
use serde::Serialize;
#[derive(Copy, C | random | [
{
"content": "/// Spawn a sub-process, and by the power of threads,\n\n/// elevate its stdout and stderr to the parent while\n\n/// also merging them together into a line stream,\n\n/// then collecting them.\n\npub fn subproc<B>(mut command: B, quiet: bool) -> (ExitStatus, Vec<String>) \n\nwhere\n\n B: Borro... |
Rust | rs/registry/canister/tests/tests/add_node_operator.rs | contropist/ic | 9240bea7dc0239fcbc5d43ad11f3ca803ee9bb11 | use candid::Encode;
use dfn_candid::candid;
use dfn_core::api::PrincipalId;
use ic_nervous_system_common_test_keys::TEST_NEURON_1_OWNER_PRINCIPAL;
use ic_nns_test_utils::registry::invariant_compliant_mutation_as_atomic_req;
use ic_nns_test_utils::{
itest_helpers::{
forward_call_via_universal_canister, loca... | use candid::Encode;
use dfn_candid::candid;
use dfn_core::api::PrincipalId;
use ic_nervous_system_common_test_keys::TEST_NEURON_1_OWNER_PRINCIPAL;
use ic_nns_test_utils::registry::invariant_compliant_mutation_as_atomic_req;
use ic_nns_test_utils::{
itest_helpers::{
forward_call_via_universal_canister, loca... |
#[test]
fn test_a_canister_other_than_the_governance_canister_cannot_add_a_node_operator() {
local_test_on_nns_subnet(|runtime| async move {
let attacker_canister = set_up_universal_canister(&runtime).await;
assert_ne!(
attacker_canister.canister_id(),
... | s("is not authorized to call this method: add_node_operator"));
let key = make_node_operator_record_key(PrincipalId::new_anonymous()).into_bytes();
assert_eq!(
get_value::<NodeOperatorRecord>(®istry, &key).await,
NodeOperatorRecord::default()
);
Ok((... | function_block-function_prefixed | [
{
"content": "fn test_dapp_method_validate_(payload: i64) -> Result<String, String> {\n\n if payload > 10 {\n\n Ok(format!(\"Value is {}. Valid!\", payload))\n\n } else {\n\n Err(\"Value < 10. Invalid!\".to_string())\n\n }\n\n}\n\n\n",
"file_path": "rs/sns/integration_tests/test_canis... |
Rust | src/banner.rs | nirsarkar/feroxbuster | 6921ac03a9a3e08a931bfe160cd4854d76ba6a02 | use crate::{config::Configuration, utils::status_colorizer, VERSION};
macro_rules! format_banner_entry_helper {
($rune:expr, $name:expr, $value:expr, $indent:expr, $col_width:expr) => {
format!(
"\u{0020}{:\u{0020}<indent$}{:\u{0020}<col_w$}\u{2502}\u{0020}{}",
$rune,
... | use crate::{config::Configuration, utils::status_colorizer, VERSION};
macro_rules! format_banner_entry_helper {
($rune:expr, $name:expr, $value:expr, $indent:expr, $col_width:expr) => {
format!(
"\u{0020}{:\u{0020}<indent$}{:\u{0020}<col_w$}\u{2502}\u{0020}{}",
$rune,
... |
eprintln!("{}", bottom);
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn banner_without_targets() {
let config = Configuration::default();
initialize(&[], &config);
}
#[test]
fn banner_without_status_codes() {
let mut config = Configuration::default... | if !config.norecursion {
if config.depth == 0 {
eprintln!(
"{}",
format_banner_entry!("\u{1f503}", "Recursion Depth", "INFINITE")
);
} else {
eprintln!(
"{}",
format_banner_entry!("\u{1f503}", "Recursion... | if_condition | [
{
"content": "/// simple helper to stay DRY, trys to join a url + fragment and add it to the `links` HashSet\n\nfn add_link_to_set_of_links(link: &str, url: &Url, links: &mut HashSet<String>) {\n\n log::trace!(\n\n \"enter: add_link_to_set_of_links({}, {}, {:?})\",\n\n link,\n\n url.to_s... |
Rust | src/cheat.rs | ruabmbua/navi | dc4fe98f5611f40af9f232aaae4b3cfe6058bef5 | use crate::display;
use crate::filesystem;
use crate::option::Config;
use regex::Regex;
use std::collections::HashMap;
use std::fs;
use std::io::Write;
pub struct SuggestionOpts {
pub header_lines: u8,
pub column: Option<u8>,
pub multi: bool,
}
pub type Value = (String, Option<SuggestionOpts>);
fn gen_s... | use crate::display;
use crate::filesystem;
use crate::option::Config;
use regex::Regex;
use std::collections::HashMap;
use std::fs;
use std::io::Write;
pub struct SuggestionOpts {
pub header_lines: u8,
pub column: Option<u8>,
pub multi: bool,
}
pub type Value = (String, Option<SuggestionOpts>);
fn gen_s... |
fn parse_variable_line(line: &str) -> (&str, &str, Option<SuggestionOpts>) {
let re = Regex::new(r"^\$\s*([^:]+):(.*)").unwrap();
let caps = re.captures(line).unwrap();
let variable = caps.get(1).unwrap().as_str().trim();
let mut command_plus_opts = caps.get(2).unwrap().as_str().split("---");
let ... | let mut header_lines: u8 = 0;
let mut column: Option<u8> = None;
let mut multi = false;
let mut parts = text.split(' ');
while let Some(p) = parts.next() {
match p {
"--multi" => multi = true,
"--header" | "--header-lines" => {
header_lines = parts.next(... | function_block-function_prefix_line | [
{
"content": "pub fn variable_prompt(varname: &str) -> String {\n\n format!(\"{}: \", varname)\n\n}\n\n\n",
"file_path": "src/display.rs",
"rank": 1,
"score": 147276.47230093126
},
{
"content": "fn gen_replacement(value: &str) -> String {\n\n if value.contains(' ') {\n\n format!... |
Rust | iroha/src/queue.rs | EmelianPiker/iroha | d6097b81572554444b2e9a9a560c581006fc895a | use self::config::QueueConfiguration;
use crate::prelude::*;
use std::time::Duration;
#[derive(Debug)]
pub struct Queue {
pending_tx: Vec<AcceptedTransaction>,
maximum_transactions_in_block: usize,
transaction_time_to_live: Duration,
}
impl Queue {
pub fn from_configuration(config: &QueueConfiguration... | use self::config::QueueConfiguration;
use crate::prelude::*;
use std::time::Duration;
#[derive(Debug)]
pub struct Queue {
pending_tx: Vec<AcceptedTransaction>,
maximum_transactions_in_block: usize,
transaction_time_to_live: Duration,
}
impl Queue {
pub fn from_configuration(config: &QueueConfiguration... |
#[test]
fn pop_pending_transactions_with_timeout() {
let max_block_tx = 6;
let mut queue = Queue::from_configuration(&QueueConfiguration {
maximum_transactions_in_block: max_block_tx,
transaction_time_to_live_ms: 200,
});
for _ in 0..(max_block_tx - 1) {... | fn pop_pending_transactions() {
let max_block_tx = 2;
let mut queue = Queue::from_configuration(&QueueConfiguration {
maximum_transactions_in_block: max_block_tx,
transaction_time_to_live_ms: 100000,
});
for _ in 0..5 {
queue.push_pending_transaction(
... | function_block-full_function | [
{
"content": "/// Initializes `Logger` with given `LoggerConfiguration`.\n\n/// After the initialization `log` macros will print with the use of this `Logger`.\n\n/// For more information see [log crate](https://docs.rs/log/0.4.8/log/).\n\npub fn init(configuration: &config::LoggerConfiguration) -> Result<(), S... |
Rust | Distributed systems/dsassignment1/solution/lib.rs | rzetelskik/MIMUW | 6d193bd6f252a617a275acb1c697bfc983589c0c | use std::time::Duration;
use async_channel::{unbounded, Sender, Receiver};
use std::sync::Arc;
use std::sync::atomic::{AtomicBool, Ordering};
pub trait Message: Send + 'static {}
impl<T: Send + 'static> Message for T {}
#[async_trait::async_trait]
pub trait Handler<M: Message>
where
M: Message,
{
asy... | use std::time::Duration;
use async_channel::{unbounded, Sender, Receiver};
use std::sync::Arc;
use std::sync::atomic::{AtomicBool, Ordering};
pub trait Message: Send + 'static {}
impl<T: Send + 'static> Message for T {}
#[async_trait::async_trait]
pub trait Handler<M: Message>
where
M: Message,
{
asy... |
pub async fn new() -> Self {
System{
finish: Arc::new(AtomicBool::new(false)),
handles: Vec::new(),
tick_handles: Vec::new(),
rxs: Vec::new(),
}
}
pub async fn shutdown(&mut self) {
if self.finish.load(Ordering::Relaxed) {
... | Err(_) => {
break;
}
}
}
});
self.handles.push(handle);
self.rxs.push(Box::new(rx));
ModuleRef{
tx
}
} | function_block-function_prefix_line | [
{
"content": "/// Run the executor.\n\nfn run_executor(rx: Receiver<FibonacciSystemMessage>) -> JoinHandle<()> {\n\n let mut modules: HashMap<Ident, FibonacciModule> = HashMap::new();\n\n\n\n thread::spawn(move || {\n\n while let Ok(msg) = rx.recv() {\n\n match msg {\n\n F... |
Rust | src/main.rs | belltoy/raindrop | 8e26118026d41da74e899dd1d9af0000301253f5 | use std::io::BufRead;
use std::path::PathBuf;
use glob::glob;
use structopt::StructOpt;
use log::{debug, info, error};
use pretty_env_logger::env_logger as logger;
mod exhaust;
mod db;
#[derive(StructOpt, Debug)]
struct Args {
#[structopt(short, long, help = "DONOT execute SQL statements")]
check: bool,
... | use std::io::BufRead;
use std::path::PathBuf;
use glob::glob;
use structopt::StructOpt;
use log::{debug, info, error};
use pretty_env_logger::env_logger as logger;
mod exhaust;
mod db;
#[derive(StructOpt, Debug)]
struct Args {
#[structopt(short, long, help = "DONOT execute SQL statements")]
check: bool,
... | e();
if result.peek().is_none() {
error!("Invalid input argument: {}", p);
}
result
});
let mut unique_inputs = Vec::new();
inputs_paths
.flat_map(|p| {
p.map_err(|e| format!("glob pattern error: {}", e))
.and_then(|p| {
... | ?}", input_files);
assert_eq!(input_files.len(), input_contents.len());
let input_contents: Vec<_> = (&input_contents[..]).iter().map(|p| &p[..]).collect();
let outputs = exhaust::shuffle(&input_contents[..]);
outputs.iter().enumerate().for_each(|(i, case)| {
debug!("-- Case: {}", i... | random | [
{
"content": "pub fn init_clients(url: &str, size: usize) -> MySQLResult<Pool> {\n\n let opts = Opts::from_url(url)?;\n\n let pool = Pool::new_manual(size, size, opts)?;\n\n Ok(pool)\n\n}\n\n\n",
"file_path": "src/db.rs",
"rank": 3,
"score": 74685.11859225594
},
{
"content": "/// He... |
Rust | alvr/experiments/client/src/xr/openxr/interaction.rs | AndresGroselj/ALVR | 679f3a1cdaeff99322fb94560208949d75edef83 | use super::{convert, SceneButtons, XrContext, XrHandPoseInput};
use crate::{
xr::{XrActionType, XrActionValue, XrHandTrackingInput, XrProfileDesc},
ViewConfig,
};
use alvr_common::{prelude::*, MotionData};
use alvr_session::TrackingSpace;
use openxr as xr;
use std::collections::HashMap;
const OCULUS_PROFILE: &... | use super::{convert, SceneButtons, XrContext, XrHandPoseInput};
use crate::{
xr::{XrActionType, XrActionValue, XrHandTrackingInput, XrProfileDesc},
ViewConfig,
};
use alvr_common::{prelude::*, MotionData};
use alvr_session::TrackingSpace;
use openxr as xr;
use std::collections::HashMap;
const OCULUS_PROFILE: &... |
let target_ray_space = trace_err!(target_ray_action.create_space(
session,
xr::Path::NULL,
xr::Posef::IDENTITY
))?;
Some(HandTrackingContext {
tracker,
target_ray_action,
target_ray_spac... | let target_ray_action = trace_err!(action_set.create_action(
&target_ray_action_name,
&target_ray_action_name,
&[]
))?; | assignment_statement | [
{
"content": "pub fn create_graphics_context(xr_context: &XrContext) -> StrResult<GraphicsContext> {\n\n let entry = unsafe { ash::Entry::load().unwrap() };\n\n\n\n let raw_instance = unsafe {\n\n let extensions_ptrs =\n\n convert::get_vulkan_instance_extensions(&entry, TARGET_VULKAN_VER... |
Rust | src/message/commands/clearchat.rs | Chronophylos/twitch-irc-rs | bf9792ebc085c08bb2e7e49e158ef2ae3e4412c6 | use crate::message::commands::IRCMessageParseExt;
use crate::message::{IRCMessage, ServerMessageParseError};
use chrono::{DateTime, Utc};
use std::convert::TryFrom;
use std::str::FromStr;
use std::time::Duration;
#[derive(Debug, Clone, PartialEq)]
pub struct ClearChatMessage {
pub channel_login: String,
... | use crate::message::commands::IRCMessageParseExt;
use crate::message::{IRCMessage, ServerMessageParseError};
use chrono::{DateTime, Utc};
use std::convert::TryFrom;
use std::str::FromStr;
use std::time::Duration;
#[derive(Debug, Clone, PartialEq)]
pub struct ClearChatMessage {
pub channel_login: String,
... |
#[test]
pub fn test_permaban() {
let src = "@room-id=11148817;target-user-id=70948394;tmi-sent-ts=1594561360331 :tmi.twitch.tv CLEARCHAT #pajlada :weeb123";
let irc_message = IRCMessage::parse(src).unwrap();
let msg = ClearChatMessage::try_from(irc_message.clone()).unwrap();
a... | pub fn test_timeout() {
let src = "@ban-duration=1;room-id=11148817;target-user-id=148973258;tmi-sent-ts=1594553828245 :tmi.twitch.tv CLEARCHAT #pajlada :fabzeef";
let irc_message = IRCMessage::parse(src).unwrap();
let msg = ClearChatMessage::try_from(irc_message.clone()).unwrap();
asse... | function_block-full_function | [
{
"content": "fn encode_tag_value(raw: &str) -> String {\n\n let mut output = String::with_capacity((raw.len() as f64 * 1.2) as usize);\n\n\n\n for c in raw.chars() {\n\n match c {\n\n ';' => output.push_str(\"\\\\:\"),\n\n ' ' => output.push_str(\"\\\\s\"),\n\n '\\... |
Rust | src/test_framework/incremental_interface.rs | vlmutolo/orion | e2af271cc3b7ce763591e02a5e6808579c1e3504 |
use crate::errors::UnknownCryptoError;
use core::marker::PhantomData;
pub trait TestableStreamingContext<T: PartialEq> {
fn reset(&mut self) -> Result<(), UnknownCryptoError>;
fn update(&mut self, input: &[u8]) -> Result<(), UnknownCryptoError>;
fn finalize(&mut self) -> Result<T, Unknow... |
use crate::errors::UnknownCryptoError;
use core::marker::PhantomData;
pub trait TestableStreamingContext<T: PartialEq> {
fn reset(&mut self) -> Result<(), UnknownCryptoError>;
fn update(&mut self, input: &[u8]) -> Result<(), UnknownCryptoError>;
fn finalize(&mut self) -> Result<T, Unknow... |
fn update_after_finalize_err(&self, data: &[u8]) {
let mut state = self._initial_context.clone();
state.update(data).unwrap();
let _ = state.finalize().unwrap();
assert!(state.update(data).is_err());
}
fn double_reset_ok(&self, data: &[u8]) {
let mut... | fn update_after_finalize_with_reset_ok(&self, data: &[u8]) {
let mut state = self._initial_context.clone();
state.update(data).unwrap();
let _ = state.finalize().unwrap();
state.reset().unwrap();
assert!(state.update(data).is_ok());
} | function_block-full_function | [
{
"content": "/// H' as defined in the specification.\n\nfn extended_hash(input: &[u8], dst: &mut [u8]) -> Result<(), UnknownCryptoError> {\n\n if dst.is_empty() {\n\n return Err(UnknownCryptoError);\n\n }\n\n\n\n let outlen = dst.len() as u32;\n\n\n\n if dst.len() <= BLAKE2B_OUTSIZE {\n\n ... |
Rust | examples/example1.rs | evetion/startin | 88ad5557cbd954ec8996f99d9afb74fd1ec174ec |
#![allow(dead_code)]
extern crate csv;
extern crate serde;
extern crate startin;
#[macro_use]
extern crate serde_derive;
use std::error::Error;
use std::io;
#[derive(Debug, Deserialize)]
pub struct CSVPoint {
pub x: f64,
pub y: f64,
pub z: f64,
}
fn main() {
let re = read_xyz_file();
let vec =... |
#![allow(dead_code)]
extern crate csv;
extern crate serde;
extern crate startin;
#[macro_use]
extern crate serde_derive;
use std::error::Error;
use std::io;
#[derive(Debug, Deserialize)]
pub struct CSVPoint {
pub x: f64,
pub y: f64,
pub z: f64,
}
fn main() {
let re = read_xyz_file();
let vec =... |
fn read_xyz_file() -> Result<Vec<CSVPoint>, Box<dyn Error>> {
let mut rdr = csv::ReaderBuilder::new()
.delimiter(b' ')
.from_reader(io::stdin());
let mut vpts: Vec<CSVPoint> = Vec::new();
for result in rdr.deserialize() {
let record: CSVPoint = result?;
vpts.push(record);
... | cent_vertices_to_vertex(66);
if re.is_some() == true {
for each in re.unwrap() {
println!("Adjacent vertex {}", each);
}
} else {
println!("Vertex does not exists.");
}
let trs = dt.incident_triangles_to_vertex(6).unwrap();
let re = dt.adjacent_triangles_to_tria... | function_block-function_prefixed | [
{
"content": "fn read_xyz_file() -> Vec<Vec<f64>> {\n\n let tmpf = File::open(\"/Users/hugo/Dropbox/data/ahn3/o3.txt\").unwrap();\n\n // let tmpf = File::open(\"/Users/hugo/Dropbox/data/ahn3/test.txt\").unwrap();\n\n let file = BufReader::new(&tmpf);\n\n\n\n let mut pts: Vec<Vec<f64>> = Vec::new();\... |
Rust | src/input/json.rs | PassFort/rouille | c3f06096afab039b88076d3d613f9a29e7a5f1dd |
use serde;
use serde_json;
use serde_json::Value;
use std::error;
use std::fmt;
use std::io::Error as IoError;
use Request;
#[derive(Debug)]
pub enum JsonError {
BodyAlreadyExtracted,
WrongContentType,
NullPresent,
IoError(IoError),
ParseError(serde_json::Error),
}
i... |
use serde;
use serde_json;
use serde_json::Value;
use std::error;
use std::fmt;
use std::io::Error as IoError;
use Request;
#[derive(Debug)]
pub enum JsonError {
BodyAlreadyExtracted,
WrongContentType,
NullPresent,
IoError(IoError),
ParseError(serde_json::Error),
}
i... |
pub fn json_input<O>(request: &Request) -> Result<O, JsonError>
where
O: serde::de::DeserializeOwned,
{
if let Some(header) = request.header("Content-Type") {
if !header.starts_with("application/json") {
return Err(JsonError::WrongContentType);
}
} else {
return E... | s) => {
if s.find("\0").is_some() {
return Err(JsonError::NullPresent);
}
}
Value::Array(a) => {
for element in a {
check_null(element)?;
}
}
Value::Object(o) => {
for (k, v) in o {
... | function_block-function_prefixed | [
{
"content": "#[inline]\n\npub fn plain_text_body(request: &Request) -> Result<String, PlainTextError> {\n\n plain_text_body_with_limit(request, 1024 * 1024)\n\n}\n\n\n",
"file_path": "src/input/plain.rs",
"rank": 2,
"score": 213355.85341939444
},
{
"content": "/// Applies content encodin... |
Rust | src/commands/commands/math.rs | Chronophylos/chb4 | 8754dbeb16eb36b79118f676fbf1897b582d67ed | use super::prelude::*;
use evalexpr::*;
use std::f64::consts;
static PHI: f64 = 1.61803398874989484820;
pub fn command() -> Arc<Command> {
Command::with_name("math")
.alias("quickmafs")
.command(move |_context, args, _msg, _user| {
let context = context_map! {
... | use super::prelude::*;
use evalexpr::*;
use std::f64::consts;
static PHI: f64 = 1.61803398874989484820;
pub fn command() -> Arc<Command> {
Command::with_name("math")
.alias("quickmafs")
.command(move |_context, args, _msg, _user| {
let context = context_map! {
... |
})
.about("Do some math")
.description(
"
This command uses the `evalexpr` crate. This crate allows the definition of constants and functions.
.Constants
|===
| Name | Value | Description
| e
| 2.71828182845904523536028747135266250f64
| Euler's number (e)
| pi, π
| 3.141592653589... | Ok(match eval_with_context(&expr, &context) {
Ok(s) => MessageResult::Message(format!("{}", s)),
Err(err) => MessageResult::Error(err.to_string()),
}) | call_expression | [
{
"content": "pub fn command() -> Arc<Command> {\n\n Command::with_name(\"system\")\n\n .alias(\"sysstat\")\n\n .command(|context, _args, _msg, _user| {\n\n let sys = System::new();\n\n\n\n let (mem_proc, mem_used, mem_total) =\n\n mem(&sys).context(\"Could ... |
Rust | src/layout/gpos1.rs | daltonmaag/fonttools-rs | f6bbfa93cfb0b963432b87b30e4f5dfdfe9db923 | use crate::layout::coverage::Coverage;
use crate::layout::valuerecord::{coerce_to_same_format, ValueRecord, ValueRecordFlags};
use crate::utils::is_all_the_same;
use otspec::types::*;
use otspec::Serialize;
use otspec::{DeserializationError, Deserialize, Deserializer, ReaderContext, SerializationError};
use otspec_ma... | use crate::layout::coverage::Coverage;
use crate::layout::valuerecord::{coerce_to_same_format, ValueRecord, ValueRecordFlags};
use crate::utils::is_all_the_same;
use otspec::types::*;
use otspec::Serialize;
use otspec::{DeserializationError, Deserialize, Deserializer, ReaderContext, SerializationError};
use otspec_ma... |
}
| let pos = SinglePos {
mapping: btreemap!(66 => valuerecord!(xAdvance=10),
67 => valuerecord!(xPlacement=-20),
),
};
let binary_pos = vec![
0x00, 0x02,
0x00, 0x10,
0x00, 0x05,
0x00, 0x02,
0x00, 0x00,
... | function_block-function_prefix_line | [
{
"content": "fn consecutive_slices(data: &[uint16]) -> Vec<&[uint16]> {\n\n let mut slice_start = 0;\n\n let mut result = Vec::new();\n\n for i in 1..data.len() {\n\n if data[i - 1] + 1 != data[i] {\n\n result.push(&data[slice_start..i]);\n\n slice_start = i;\n\n }\... |
Rust | src/bytecode/src/loader.rs | ales-tsurko/koto | 040c255d2170ac44e6743f6b381c7fb639e492a2 | use {
crate::{Chunk, Compiler, CompilerError, CompilerSettings},
koto_parser::{format_error_with_excerpt, Parser, ParserError},
std::{collections::HashMap, error, fmt, path::PathBuf, sync::Arc},
};
#[derive(Clone, Debug)]
pub enum LoaderErrorType {
ParserError(ParserError),
CompilerError(CompilerEr... | use {
crate::{Chunk, Compiler, CompilerError, CompilerSettings},
koto_parser::{format_error_with_excerpt, Parser, ParserError},
std::{collections::HashMap, error, fmt, path::PathBuf, sync::Arc},
};
#[derive(Clone, Debug)]
pub enum LoaderErrorType {
ParserError(ParserError),
CompilerError(CompilerEr... |
pub fn io_error(error: String) -> Self {
Self {
error: LoaderErrorType::IoError(error),
source: "".into(),
source_path: None,
}
}
pub fn is_indentation_error(&self) -> bool {
match &self.error {
LoaderErrorType::ParserError(e) => e.i... | pub fn from_compiler_error(
error: CompilerError,
source: &str,
source_path: Option<PathBuf>,
) -> Self {
Self {
error: LoaderErrorType::CompilerError(error),
source: source.into(),
source_path,
}
} | function_block-full_function | [
{
"content": "/// Returns a [String] displaying the annotated instructions contained in the compiled [Chunk]\n\npub fn chunk_to_string_annotated(chunk: Arc<Chunk>, source_lines: &[&str]) -> String {\n\n let mut result = String::new();\n\n let mut reader = InstructionReader::new(chunk);\n\n let mut ip =... |
Rust | quic/s2n-quic-transport/src/transmission/application.rs | nsdyoshi/s2n-quic | 0635e62cdc58fb968de0a0d576822e09c96cba99 |
use crate::{
ack::AckManager,
connection,
contexts::WriteContext,
endpoint, path,
path::mtu,
recovery,
space::{datagram, HandshakeStatus},
stream::{AbstractStreamManager, StreamTrait as Stream},
sync::{flag, flag::Ping},
transmission::{self, Mode},
};
use core::ops::RangeInclus... |
use crate::{
ack::AckManager,
connection,
contexts::WriteContext,
endpoint, path,
path::mtu,
recovery,
space::{datagram, HandshakeStatus},
stream::{AbstractStreamManager, StreamTrait as Stream},
sync::{flag, flag::Ping},
transmission::{self, Mode},
};
use core::ops::RangeInclus... |
}
impl<'a, S: Stream, Config: endpoint::Config> transmission::interest::Provider
for Normal<'a, S, Config>
{
fn transmission_interest<Q: transmission::interest::Query>(
&self,
query: &mut Q,
) -> transmission::interest::Result {
self.ack_manager.transmission_interest(query)?;
... | t);
self.path_manager.on_transmit(context);
self.datagram_manager
.on_transmit(context, self.stream_manager);
let _ = self.stream_manager.on_transmit(context);
self.recovery_manager.on_tr... | function_block-function_prefixed | [
{
"content": "pub trait Context<Config: endpoint::Config> {\n\n const ENDPOINT_TYPE: endpoint::Type;\n\n\n\n fn is_handshake_confirmed(&self) -> bool;\n\n\n\n fn path(&self) -> &Path<Config>;\n\n\n\n fn path_mut(&mut self) -> &mut Path<Config>;\n\n\n\n fn path_by_id(&self, path_id: path::Id) -> &... |
Rust | src/util.rs | anderejd/meshlite | 2a3b1f06b0dae801b55b10ee8f78c11c9cee5ebb | use cgmath::Point3;
use cgmath::Vector3;
use cgmath::prelude::*;
use cgmath::Deg;
use cgmath::Rad;
/*
Range of the Dot Product of Two Unit Vectors
Dot Angle
1.000 0 degrees
0.966 15 degrees
0.866 30 degrees
0.707 45 degrees
0.500 60 degrees
0.259 75 degrees
0.000 90 degrees
-0.259 105 by degrees
-0.500 120 degree... | use cgmath::Point3;
use cgmath::Vector3;
use cgmath::prelude::*;
use cgmath::Deg;
use cgmath::Rad;
/*
Range of the Dot Product of Two Unit Vectors
Dot Angle
1.000 0 degrees
0.966 15 degrees
0.866 30 degrees
0.707 45 degrees
0.500 60 degrees
0.259 75 degrees
0.000 90 degrees
-0.259 105 by degrees
-0.500 120 degree... |
let v = u.cross(direct);
let u = u.normalize() * radius;
let v = v.normalize() * radius;
let origin = position + direct * radius;
let f = vec![origin - u - v,
origin + u - v,
origin + u + v,
origin - u + v];
f
}
pub fn pick_most_not_obvious_vertex(vertice... | let u = {
if direct_normalized.dot(oriented_base_norm).abs() > 0.707 {
let switched_base_norm = world_perp(oriented_base_norm);
direct_normalized.cross(switched_base_norm)
} else {
direct_normalized.cross(oriented_ba... | assignment_statement | [
{
"content": "pub fn cube() -> Mesh {\n\n let mut m = Mesh::new();\n\n let face_id = m.add_plane(1.0, 1.0);\n\n let normal = m.face_norm(face_id);\n\n m.extrude_face(face_id, normal, 1.0).translate(0.0, 0.0, -0.5);\n\n m\n\n}\n\n\n",
"file_path": "src/primitives.rs",
"rank": 15,
"scor... |
Rust | main/src/vocab/sentence_piece_bpe_model.rs | sftse/rust-tokenizers | d869924622e40ea525d8244d1716517751c7743a |
use crate::error::TokenizerError;
use crate::tokenizer::base_tokenizer::{Token, TokenRef};
use crate::tokenizer::tokenization_utils::{is_punctuation, is_whitespace};
use crate::vocab::sentencepiece_proto::sentencepiece_model::ModelProto;
use crate::{Mask, Offset, OffsetSize};
use hashbrown::HashMap;
use protobuf::Mes... |
use crate::error::TokenizerError;
use crate::tokenizer::base_tokenizer::{Token, TokenRef};
use crate::tokenizer::tokenization_utils::{is_punctuation, is_whitespace};
use crate::vocab::sentencepiece_proto::sentencepiece_model::ModelProto;
use crate::{Mask, Offset, OffsetSize};
use hashbrown::HashMap;
use protobuf::Mes... | );
}
Self { symbols }
}
}
impl SymbolList {
pub fn len(&self) -> usize {
self.symbols.len()
}
pub fn merge_symbols(
&mut self,
symbol_1_index: usize,
symbol_2_index: usize,
size_validation: usize,
) -> Option<Symbol> {
if let (Some(le... | Some(Symbol {
start_byte: character_start,
end_byte: character_start + character.len_utf8(),
start_offset: index,
end_offset: index + 1,
prev: index as isize - 1,
next,
size: 1,
}) | call_expression | [
{
"content": "fn bytes_offsets(text: &str) -> Vec<usize> {\n\n let mut offsets = Vec::with_capacity(text.len());\n\n for (char_idx, character) in text.chars().enumerate() {\n\n for _ in 0..character.len_utf8() {\n\n offsets.push(char_idx)\n\n }\n\n }\n\n offsets\n\n}\n\n\n",... |
Rust | storage/libradb/src/metrics.rs | chouette254/libra | 1eaefa60d29e1df72ba6c4f9cf1867964821b586 |
use libra_metrics::{
register_histogram_vec, register_int_counter, register_int_gauge, register_int_gauge_vec,
HistogramVec, IntCounter, IntGauge, IntGaugeVec,
};
use once_cell::sync::Lazy;
pub static LIBRA_STORAGE_LEDGER: Lazy<IntGaugeVec> = Lazy::new(|| {
register_int_gauge_vec!(
"libr... |
use libra_metrics::{
register_histogram_vec, register_int_counter, register_int_gauge, | in bytes",
&["cf_name"]
)
.unwrap()
});
pub static LIBRA_STORAGE_COMMITTED_TXNS: Lazy<IntCounter> = Lazy::new(|| {
register_int_counter!(
"libra_storage_committed_txns",
"Libra storage committed transactions"
)
.unwrap()
});
pub static LIBRA_STORAGE_LATEST_TXN_VERS... | register_int_gauge_vec,
HistogramVec, IntCounter, IntGauge, IntGaugeVec,
};
use once_cell::sync::Lazy;
pub static LIBRA_STORAGE_LEDGER: Lazy<IntGaugeVec> = Lazy::new(|| {
register_int_gauge_vec!(
"libra_storage_ledger",
"Libra storage ledger counters",
&["type... | random | [
{
"content": "// Parse a use declaration:\n\n// UseDecl =\n\n// \"use\" <ModuleIdent> <UseAlias> \";\" |\n\n// \"use\" <ModuleIdent> :: <UseMember> \";\" |\n\n// \"use\" <ModuleIdent> :: \"{\" Comma<UseMember> \"}\" \";\"\n\nfn parse_use_decl<'input>(tokens: &mut Lexer<'input>) -... |
Rust | src/bin/delete-reaction.rs | netguru/commentable-rs | be95c83cfc2ff65d6175cc0a979461cc235512c5 | use lambda_http::{lambda, Request, Response, Body, RequestExt};
use rusoto_core::Region;
use rusoto_dynamodb::{DynamoDbClient};
use serde::Deserialize;
use commentable_rs::utils::db::{DynamoDbModel, CommentableId};
use commentable_rs::utils::http::{ok, bad_request, internal_server_error, HttpError};
use commentable_rs... | use lambda_http::{lambda, Request, Response, Body, RequestExt};
use rusoto_core::Region;
use rusoto_dynamodb::{DynamoDbClient};
use serde::Deserialize;
use commentable_rs::utils::db::{DynamoDbModel, CommentableId};
use commentable_rs::utils::http::{ok, bad_request, internal_server_error, HttpError};
use commentable_rs... |
} else {
Err(bad_request("Invalid parameters"))
}
}
fn current_user_id(&self) -> &UserId {
&self.current_user.as_ref().unwrap().id
}
fn current_comment_id(&self) -> &CommentId {
&self.current_comment.as_ref().unwrap().id
}
pub fn validate_params(&mut self) -> Result<&mut Self, Http... | Ok(Self {
db: DynamoDbClient::new(Region::default()),
commentable_id,
current_comment: None,
current_user: None,
reaction: None,
params,
}) | call_expression | [
{
"content": "pub fn comment_id(commentable_id: &CommentableId, user_id: &UserId) -> String {\n\n let id = hash(&format!(\"{}{}{}\", commentable_id, user_id, Utc::now().to_string()));\n\n format!(\"{}{}{}\", COMMENT_ID_PREFIX, Utc::now().timestamp_millis(), id)\n\n}\n",
"file_path": "src/models/comment.rs... |
Rust | src/u32x8_.rs | nathanvoglsam/wide | 00de1af88cced28b9fb64fbe393261f203573c96 | use super::*;
pick! {
if #[cfg(target_feature="avx2")] {
#[derive(Default, Clone, Copy, PartialEq, Eq)]
#[repr(C, align(32))]
pub struct u32x8 { avx2: m256i }
}
else if #[cfg(target_feature="ssse3")] {
#[derive(Default, Clone, Copy, PartialEq, Eq)]
#[repr(C, align(32))]
pub struct u32x8... | use super::*;
pick! {
if #[cfg(target_feature="avx2")] {
#[derive(Default, Clone, Copy, PartialEq, Eq)]
#[repr(C, align(32))]
pub struct u32x8 { avx2: m256i }
}
else if #[cfg(target_feature="ssse3")] {
#[derive(Default, Clone, Copy, PartialEq, Eq)]
#[repr(C, align(32))]
pub struct u32x8... |
}
impl Sub for u32x8 {
type Output = Self;
#[inline]
#[must_use]
fn sub(self, rhs: Self) -> Self::Output {
pick! {
if #[cfg(target_feature="avx2")] {
Self { avx2: sub_i32_m256i(self.avx2, rhs.avx2) }
} else if #[cfg(target_feature="ssse3")] {
Self { sse0: sub_i32_m128i(self.sse... | self.avx2, rhs.avx2) }
} else if #[cfg(target_feature="ssse3")] {
Self { sse0: add_i32_m128i(self.sse0, rhs.sse0) , sse1: add_i32_m128i(self.sse1, rhs.sse1)}
}
else {
Self { arr: [
self.arr[0].wrapping_add(rhs.arr[0]),
self.arr[1].wrapping_add(rhs.arr[1]),
... | function_block-function_prefixed | [
{
"content": "#[test]\n\nfn impl_add_for_u32x8() {\n\n let a = u32x8::from([1, 2, u32::MAX - 1, u32::MAX - 1, 31, 72, 13, 53]);\n\n let b = u32x8::from([17, 18, 1, 2, 12, 12, 634, 15]);\n\n let expected = u32x8::from([18, 20, u32::MAX, u32::MIN, 43, 84, 647, 68]);\n\n let actual = a + b;\n\n assert_eq!(exp... |
Rust | src/async/session.rs | reachkrr/serverless-wasm | 0e521adc782a002aa1beae56d3661a88322d75e3 | use mio::unix::UnixReady;
use mio::net::TcpStream;
use mio::{Poll, Ready};
use std::collections::HashMap;
use std::iter::repeat;
use std::rc::Rc;
use std::io::{ErrorKind, Read, Write};
use std::cell::RefCell;
use std::net::{SocketAddr, Shutdown};
use slab::Slab;
use interpreter::WasmInstance;
use super::host;
use conf... | use mio::unix::UnixReady;
use mio::net::TcpStream;
use mio::{Poll, Ready};
use std::collections::HashMap;
use std::iter::repeat;
use std::rc::Rc;
use std::io::{ErrorKind, Read, Write};
use std::cell::RefCell;
use std::net::{SocketAddr, Shutdown};
use slab::Slab;
use interpreter::WasmInstance;
use super::host;
use conf... |
pub fn add_backend(&mut self, stream: TcpStream, index: usize) {
let s = Stream {
readiness: UnixReady::from(Ready::empty()),
interest: UnixReady::from(Ready::writable()) | UnixReady::hup() | UnixReady::error(),
stream,
index,
};
self.backends.insert(index, s);
self.state =... | ackends: HashMap::new(),
instance: None,
config,
buffer,
state: Some(SessionState::WaitingForRequest),
method: None,
path: None,
env: None,
}
} | function_block-function_prefixed | [
{
"content": "pub fn server(config: Config) {\n\n let state = ApplicationState::new(&config);\n\n\n\n let addr = (&config.listen_address).parse().unwrap();\n\n let server = TcpListener::bind(&addr).unwrap();\n\n\n\n let mut poll = Poll::new().unwrap();\n\n\n\n poll\n\n .register(&server, SERVER, Ready::... |
Rust | modules/world/tests/graph.rs | drunkenme/lemon3d-rs | 48d4e879996e2502e0faaf36e4dbcebfca9961b0 | extern crate crayon;
extern crate crayon_world;
extern crate rand;
use crayon::prelude::*;
use crayon::*;
use crayon_world::prelude::*;
use crayon_world::renderable::headless::HeadlessRenderer;
#[test]
pub fn hierachy() {
let mut scene = Scene::new(HeadlessRenderer::new());
let e1 = scene.create("e1");
le... | extern crate crayon;
extern crate crayon_world;
extern crate rand;
use crayon::prelude::*;
use crayon::*;
use crayon_world::prelude::*;
use crayon_world::renderable::headless::HeadlessRenderer;
#[test]
pub fn hierachy() {
let mut scene = Scene::new(HeadlessRenderer::new());
let e1 = scene.create("e1");
le... | let len = scene.children(constructed[0]).count();
assert_eq!(len, count);
let len = scene.descendants(constructed[0]).count();
assert_eq!(len, 254);
} | function_block-function_prefix_line | [
{
"content": "#[test]\n\nfn transform() {\n\n let mut e1 = Transform::default();\n\n let euler = Euler::new(Deg(0.0), Deg(0.0), Deg(90.0));\n\n e1.scale = 2.0;\n\n e1.position = [1.0, 0.0, 2.0].into();\n\n e1.rotation = euler.into();\n\n\n\n let v = [1.0, 0.0, 0.0];\n\n assert_ulps_eq!(e1.t... | |
Rust | day-11/src/main.rs | mmehrten/advent-of-code-2021 | f04ac08718f4bda3d24ecf255083dac7b6b2cf8a | use std::collections::HashSet;
use std::fs::File;
use std::io::Error;
use std::io::{BufRead, BufReader};
fn parse_file_path(args: &[String]) -> &str {
if args.len() != 2 {
panic!(
"Expected one file path and an optional window size to run against, got: {} arguments",
args.len() - 1
... | use std::collections::HashSet;
use std::fs::File;
use std::io::Error;
use std::io::{BufRead, BufReader};
fn parse_file_path(args: &[String]) -> &str {
if args.len() != 2 {
panic!(
"Expected one file path and an optional window size to run against, got: {} arguments | ("inputs/challenge.txt", 100), (1613, 510));
}
}
| ",
args.len() - 1
);
}
let input_path = &args[1];
input_path.as_str()
}
#[cfg(test)]
mod test_parse_file_path {
use crate::parse_file_path;
#[test]
fn one_arg_ok() {
assert_eq!(
parse_file_path(&vec!["script_path".to_string(), "arg_text".to_string()][..]... | random | [
{
"content": "/// Parse the file path from command line arguments.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `args` - the command line arguments\n\n///\n\n/// # Returns\n\n///\n\n/// A single command line argument - panics if zero or more than one argument are passed.\n\nfn parse_file_path(args: &[String]) -> &... |
Rust | src/server/snap.rs | Caoming/tikv | 7c25c38965692ccfc17d175fbd529d64c6695e13 |
use std::fmt::{self, Formatter, Display};
use std::io;
use std::fs::File;
use std::net::{SocketAddr, TcpStream};
use std::io::Read;
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::boxed::FnBox;
use std::time::{Instant, Duration};
use threadpool::ThreadPool;
use mio::Token;
use super::m... |
use std::fmt::{self, Formatter, Display};
use std::io;
use std::fs::File;
use std::net::{SocketAddr, TcpStream};
use std::io::Read;
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::boxed::FnBox;
use std::time::{Instant, Duration};
use threadpool::ThreadPool;
use mio::Token;
use super::m... |
}
fn send_snap(mgr: SnapManager, addr: SocketAddr, data: ConnData) -> Result<()> {
assert!(data.is_snapshot());
let timer = Instant::now();
let send_timer = SEND_SNAP_HISTOGRAM.start_timer();
let snap = data.msg.get_raft().get_message().get_snapshot();
let key = try!(SnapKey::from_snap(&snap));
... | fn fmt(&self, f: &mut Formatter) -> fmt::Result {
match *self {
Task::Register(token, ref meta) => write!(f, "Register {:?} token: {:?}", meta, token),
Task::Write(token, _) => write!(f, "Write snap for {:?}", token),
Task::Close(token) => write!(f, "Close file {:?}", token),... | function_block-full_function | [
{
"content": "pub fn new_message(from: u64, to: u64, t: MessageType, n: usize) -> Message {\n\n let mut m = new_message_with_entries(from, to, t, vec![]);\n\n if n > 0 {\n\n let mut ents = Vec::with_capacity(n);\n\n for _ in 0..n {\n\n ents.push(new_entry(0, 0, SOME_DATA));\n\n ... |
Rust | aml/src/test_utils.rs | Dentosal/acpi | 2273964aef430a51afee8735526e7323f597d2ca | use crate::{parser::Propagate, AmlContext, AmlValue, Handler};
use alloc::boxed::Box;
struct TestHandler;
impl Handler for TestHandler {
fn read_u8(&self, _address: usize) -> u8 {
unimplemented!()
}
fn read_u16(&self, _address: usize) -> u16 {
unimplemented!()
}
fn read_u32(&self, ... | use crate::{parser::Propagate, AmlContext, AmlValue, Handler};
use alloc::boxed::Box;
struct TestHandler;
impl Handler for TestHandler {
fn read_u8(&self, _address: usize) -> u8 {
unimplemented!()
}
fn read_u16(&self, _address: usize) -> u16 {
unimplemented!()
}
fn read_u32(&self, ... | _parent_device
}
_ => false,
},
AmlValue::Field { region, flags, offset, length } => match b {
AmlValue::Field { region: b_region, flags: b_flags, offset: b_offset, length: b_length } => {
region == b_region && flags == b_flags && offset == b_offset &&... | cted Ok, got {:#?}", err),
}
}
pub(crate) fn crudely_cmp_values(a: &AmlValue, b: &AmlValue) -> bool {
use crate::value::MethodCode;
match a {
AmlValue::Boolean(a) => match b {
AmlValue::Boolean(b) => a == b,
_ => false,
},
AmlValue::Integer(a) => match b {
... | random | [
{
"content": "pub fn take_n<'a, 'c>(n: u32) -> impl Parser<'a, 'c, &'a [u8]>\n\nwhere\n\n 'c: 'a,\n\n{\n\n move |input: &'a [u8], context| {\n\n if (input.len() as u32) < n {\n\n return Err((input, context, Propagate::Err(AmlError::UnexpectedEndOfStream)));\n\n }\n\n\n\n le... |
Rust | src/setting_serial.rs | opendoor-labs/libnm-rs | ddd1c6c4599fb9d4c62f44f5eb17a0286eeabe1a |
use glib::object::Cast;
use glib::object::IsA;
use glib::signal::connect_raw;
use glib::signal::SignalHandlerId;
use glib::translate::*;
use glib::Value;
use glib_sys;
use gobject_sys;
use nm_sys;
use std::boxed::Box as Box_;
use std::fmt;
use std::mem::transmute;
use Setting;
use SettingSerialParity;
glib_wrapper! ... |
use glib::object::Cast;
use glib::object::IsA;
use glib::signal::connect_raw;
use glib::signal::SignalHandlerId;
use glib::translate::*;
use glib::Value;
use glib_sys;
use gobject_sys;
use nm_sys;
use std::boxed::Box as Box_;
use std::fmt;
use std::mem::transmute;
use Setting;
use SettingSerialParity;
glib_wrapper! ... |
fn set_property_parity(&self, parity: SettingSerialParity) {
unsafe {
gobject_sys::g_object_set_property(
self.to_glib_none().0 as *mut gobject_sys::GObject,
b"parity\0".as_ptr() as *const _,
Value::from(&parity).to_glib_none().0,
);
... | self.to_glib_none().0 as *mut gobject_sys::GObject,
b"bits\0".as_ptr() as *const _,
Value::from(&bits).to_glib_none().0,
);
}
} | function_block-function_prefix_line | [
{
"content": "pub trait SettingExt: 'static {\n\n fn compare<P: IsA<Setting>>(&self, b: &P, flags: SettingCompareFlags) -> bool;\n\n\n\n //fn diff<P: IsA<Setting>>(&self, b: &P, flags: SettingCompareFlags, invert_results: bool, results: /*Unknown conversion*//*Unimplemented*/HashTable TypeId { ns_id: 0, i... |
Rust | src/lower.rs | 1tgr/simplejit-demo | 750a1f628452d42836d0da5fc415fcef7750c045 | use crate::ast::*;
use crate::intern::Intern;
use crate::{InternExt, Parse, Result};
use std::collections::HashMap;
use std::convert::Infallible;
use std::num::NonZeroU32;
use std::rc::Rc;
use std::result;
#[salsa::query_group(LowerDatabase)]
pub trait Lower: Parse {
fn lower_function(&self, name: IdentId) -> Resu... | use crate::ast::*;
use crate::intern::Intern;
use crate::{InternExt, Parse, Result};
use std::collections::HashMap;
use std::convert::Infallible;
use std::num::NonZeroU32;
use std::rc::Rc;
use std::result;
#[salsa::query_group(LowerDatabase)]
pub trait Lower: Parse {
fn lower_function(&self, name: IdentId) -> Resu... |
fn transform_block(&mut self, _expr_id: ExprId, mut expr: Block) -> result::Result<Expr, Infallible> {
self.transform_stmts(&mut expr.stmts)?;
Ok(Expr::Block(expr))
}
fn transform_call(&mut self, _expr_id: ExprId, mut expr: Call) -> result::Result<Expr, Infallible> {
expr.env = So... | d {
if let Expr::Block(expr) = expr {
let Block { stmts } = expr;
self.db.intern_block(stmts)
} else {
self.db.intern_expr(expr)
}
} | function_block-function_prefixed | [
{
"content": "fn function_body(db: &dyn Parse, name: IdentId) -> Result<ExprId> {\n\n let Function {\n\n signature: _,\n\n param_names: _,\n\n body,\n\n } = db.function(name)?;\n\n\n\n Ok(body)\n\n}\n\n\n",
"file_path": "src/parse.rs",
"rank": 1,
"score": 259582.8352002... |
Rust | tests/integrations/config/test_config_client.rs | amyangfei/tikv | 5019e61d0c8e1966f6b649894ad17ba128068a1e |
use std::cmp::Ordering;
use std::collections::HashMap;
use std::sync::{Arc, Mutex};
use kvproto::configpb::*;
use configuration::{ConfigChange, Configuration};
use pd_client::errors::Result;
use pd_client::ConfigClient;
use raftstore::store::Config as RaftstoreConfig;
use tikv::config::*;
use tikv_util::config::Rea... |
use std::cmp::Ordering;
use std::collections::HashMap;
use std::sync::{Arc, Mutex};
use kvproto::configpb::*;
use configuration::{ConfigChange, Configuration};
use pd_client::errors::Result;
use pd_client::ConfigClient;
use raftstore::store::Config as RaftstoreConfig;
use tikv::config::*;
use tikv_util::config::Rea... |
resp.set_status(status);
Ok(resp)
}
fn update_config(
&self,
id: String,
version: Version,
mut entries: Vec<ConfigEntry>,
) -> Result<UpdateResponse> {
let mut resp = UpdateResponse::default();
let mut status = Status::default();
if l... | if let Some(cfg) = configs.get(&id) {
match cmp_version(&cfg.version, &version) {
Ordering::Equal => status.set_code(StatusCode::Ok),
_ => {
resp.set_config(cfg.content.clone());
status.set_code(StatusCode::WrongVersion);
... | if_condition | [
{
"content": "fn config_to_slice(config_change: &[(String, String)]) -> Vec<(&str, &str)> {\n\n config_change\n\n .iter()\n\n .map(|(name, value)| (name.as_str(), value.as_str()))\n\n .collect()\n\n}\n\n\n",
"file_path": "src/config.rs",
"rank": 0,
"score": 391110.64508115995... |
Rust | editor/src/settings/mod.rs | Libertus-Lab/Fyrox | c925304f42744659fd3a6be5c4a1a8609556033a | use crate::{
inspector::editors::make_property_editors_container,
settings::{
debugging::DebuggingSettings, graphics::GraphicsSettings,
move_mode::MoveInteractionModeSettings, rotate_mode::RotateInteractionModeSettings,
selection::SelectionSettings,
},
GameEngine, Message, MSG_SY... | use crate::{
inspector::editors::make_property_editors_container,
settings::{
debugging::DebuggingSettings, graphics::GraphicsSettings,
move_mode::MoveInteractionModeSettings, rotate_mode::RotateInteractionModeSettings,
selection::SelectionSettings,
},
GameEngine, Message, MSG_SY... |
match settings.save() {
Ok(_) => {
Log::info("Settings were successfully saved!".to_owned());
}
Err(e) => {
Log::err(format!("Unable to save settings! Reason: {:?}!", e));
}
};
... | if settings.graphics.quality != engine.renderer.get_quality_settings() {
if let Err(e) = engine
.renderer
.set_quality_settings(&settings.graphics.quality)
{
Log::err(format!(
"An error occurred at attemp... | if_condition | [
{
"content": "pub trait InspectableEnum: Debug + Inspect + 'static {}\n\n\n\nimpl<T: Debug + Inspect + 'static> InspectableEnum for T {}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum EnumPropertyEditorMessage {\n\n Variant(usize),\n\n PropertyChanged(PropertyChanged),\n\n}\n\n\n\nimpl EnumProperty... |
Rust | crates/rome_js_parser/src/parse.rs | mrkldshv/tools | c173b0c01ee499fcb49d6ae328f1229daa183868 |
use crate::token_source::Trivia;
use crate::*;
use rome_diagnostics::Severity;
use rome_js_syntax::{
JsAnyRoot, JsExpressionSnipped, JsLanguage, JsModule, JsScript, JsSyntaxNode, ModuleKind,
SourceType,
};
use rome_rowan::AstNode;
use std::marker::PhantomData;
#[derive(Debug, Clone)]
pub struct Parse<T> {
... |
use crate::token_source::Trivia;
use crate::*;
use rome_diagnostics::Severity;
use rome_js_syntax::{
JsAnyRoot, JsExpressionSnipped, JsLanguage, JsModule, JsScript, JsSyntaxNode, ModuleKind,
SourceType,
};
use rome_rowan::AstNode;
use std::marker::PhantomData;
#[derive(Debug, Clone)]
pub struct Parse<T> {
... |
}
pub fn parse_common(
text: &str,
file_id: usize,
source_type: SourceType,
) -> (Vec<Event>, Vec<ParseDiagnostic>, Vec<Trivia>) {
let mut parser = crate::Parser::new(text, file_id, source_type);
crate::syntax::program::parse(&mut parser);
let (events, trivia, errors) = parser.finish();
... | pub fn ok(self) -> Result<T, Vec<ParseDiagnostic>> {
if !self.errors.iter().any(|d| d.severity == Severity::Error) {
Ok(self.tree())
} else {
Err(self.errors)
}
} | function_block-full_function | [
{
"content": "#[inline]\n\npub fn process(sink: &mut impl TreeSink, mut events: Vec<Event>, errors: Vec<ParseDiagnostic>) {\n\n sink.errors(errors);\n\n let mut forward_parents = Vec::new();\n\n\n\n for i in 0..events.len() {\n\n match &mut events[i] {\n\n Event::Start {\n\n ... |
Rust | couchbase-lite/src/query.rs | adrien-jeser-doctolib/couchbase-lite-rust | 49ef36b21aef1817314cf98f679587be55604a7d | use crate::{
error::{c4error_init, Error},
ffi::{
c4query_new, c4query_new2, c4query_release, c4query_run, c4query_setParameters,
c4queryenum_next, c4queryenum_release, kC4DefaultQueryOptions, kC4N1QLQuery, C4Query,
C4QueryEnumerator, FLArrayIterator_GetCount, FLArrayIterator_GetValueAt,... | use crate::{
error::{c4error_init, Error},
ffi::{
c4query_new, c4query_new2, c4query_release, c4query_run, c4query_setParameters,
c4queryenum_next, c4queryenum_release, kC4DefaultQueryOptions, kC4N1QLQuery, C4Query,
C4QueryEnumerator, FLArrayIterator_GetCount, FLArrayIterator_GetValueAt,... | .ok_or_else(|| c4err.into())
}
pub(crate) fn new_n1ql<'a, 'b>(db: &'a Database, query_n1ql: &'b str) -> Result<Query<'a>> {
let mut c4err = c4error_init();
let mut out_error_pos: std::os::raw::c_int = -1;
let query = unsafe {
c4query_new2(
db.inner.0.a... | query_json.as_bytes().as_flslice(),
&mut c4err,
)
};
NonNull::new(query)
.map(|inner| Query { _db: db, inner })
| function_block-random_span | [
{
"content": "fn print_external_changes(db: &mut Option<Database>) -> Result<(), Box<dyn std::error::Error>> {\n\n let db = db\n\n .as_mut()\n\n .ok_or_else(|| format!(\"print_external_changes: db not OPEN\"))?;\n\n let mut doc_ids = HashSet::<String>::new();\n\n for change in db.observed... |
Rust | src/rust/iced-x86/src/formatter/fast/options.rs | darfink/iced | 6371d812392a02bd9c37cbe4f19d2dcdf33aacd4 |
struct Flags1;
impl Flags1 {
const SPACE_AFTER_OPERAND_SEPARATOR: u32 = 0x0000_0001;
const RIP_RELATIVE_ADDRESSES: u32 = 0x0000_0002;
const USE_PSEUDO_OPS: u32 = 0x0000_0004;
const SHOW_SYMBOL_ADDRESS: u32 = 0x0000_0008;
const ALWAYS_SHOW_SEGMENT_REGISTER: u32 = 0x0000_0010;
const ALWAYS_SHOW_MEMORY_SIZE: u32 =... |
struct Flags1;
impl Flags1 {
const SPACE_AFTER_OPERAND_SEPARATOR: u32 = 0x0000_0001;
const RIP_RELATIVE_ADDRESSES: u32 = 0x0000_0002;
const USE_PSEUDO_OPS: u32 = 0x0000_0004;
const SHOW_SYMBOL_ADDRESS: u32 = 0x0000_0008;
const ALWAYS_SHOW_SEGMENT_REGISTER: u32 = 0x0000_0010;
const ALWAYS_SHOW_MEMORY_SIZE: u32 =... |
}
#[must_use]
#[inline]
pub fn use_pseudo_ops(&self) -> bool {
(self.options1 & Flags1::USE_PSEUDO_OPS) != 0
}
#[inline]
pub fn set_use_pseudo_ops(&mut self, value: bool) {
if value {
self.options1 |= Flags1::USE_PSEUDO_OPS;
} else {
self.options1 &= !Flags1::USE_PS... | if value {
self.options1 |= Flags1::RIP_RELATIVE_ADDRESSES;
} else {
self.options1 &= !Flags1::RIP_RELATIVE_ADDRESSES;
} | if_condition | [
{
"content": "fn read_infos(bitness: u32, is_misc: bool) -> (Vec<InstructionInfo>, HashSet<u32>) {\n\n\tlet mut filename = get_formatter_unit_tests_dir();\n\n\tif is_misc {\n\n\t\tfilename.push(format!(\"InstructionInfos{}_Misc.txt\", bitness));\n\n\t} else {\n\n\t\tfilename.push(format!(\"InstructionInfos{}.tx... |
Rust | src/num_traits.rs | icewind1991/bitbuffer-rs | 96c37a0bc32cac5c44b77c5c0b05b053735c2942 | use crate::Endianness;
use num_traits::PrimInt;
use std::array::TryFromSliceError;
use std::convert::TryFrom;
use std::fmt::Debug;
use std::ops::{BitOrAssign, BitXor};
pub trait UncheckedPrimitiveFloat: Sized {
type BYTES: AsRef<[u8]> + for<'a> TryFrom<&'a [u8], Error = TryFromSliceError>;
type INT: PrimInt
... | use crate::Endianness;
use num_traits::PrimInt;
use std::array::TryFromSliceError;
use std::convert::TryFrom;
use std::fmt::Debug;
use std::ops::{BitOrAssign, BitXor};
pub trait UncheckedPrimitiveFloat: Sized {
type BYTES: AsRef<[u8]> + for<'a> TryFrom<&'a [u8], Error = TryFromSliceError>;
type INT: PrimInt
... |
}
impl_split_fit_signed!(i32, u32);
impl SplitFitUsize for u64 {
type Iter = array::IntoIter<(usize, u8), 3>;
fn split_fit_usize<E: Endianness>(self) -> Self::Iter {
(if E::is_le() {
[
((self & (Self::MAX >> 40)) as usize, 24),
((self >> 24 & (Self::MAX >>... | fn split_fit_usize<E: Endianness>(self) -> Self::Iter {
Self::Iter::new(if E::is_le() {
[
((self & (Self::MAX >> 8)) as usize, 24),
((self >> 24) as usize, 8),
]
} else {
[
((self >> 24) as usize, 8),
((s... | function_block-full_function | [
{
"content": "fn type_is_int(ty: &Type) -> bool {\n\n if let Type::Path(path) = ty {\n\n if let Some(ident) = path.path.get_ident() {\n\n let name = ident.to_string();\n\n matches!(\n\n name.as_str(),\n\n \"u8\" | \"u16\" | \"u32\" | \"u64\" | \"usiz... |
Rust | quibitous/src/blockchain/bootstrap.rs | The-Blockchain-Company/quibitous | a93cedb5c9d833f6e82429286faaf4f15e9e15a0 | use super::tip::TipUpdater;
use crate::blockcfg::{Block, HeaderHash};
use crate::blockchain::{
chain::{CheckHeaderProof, StreamInfo, StreamReporter},
Blockchain, Ref, Tip,
};
use crate::metrics::Metrics;
use chain_core::property::Deserialize;
use chain_network::data as net_data;
use chain_network::error::Error ... | use super::tip::TipUpdater;
use crate::blockcfg::{Block, HeaderHash};
use crate::blockchain::{
chain::{CheckHeaderProof, StreamInfo, StreamReporter},
Blockchain, Ref, Tip,
};
use crate::metrics::Metrics;
use chain_core::property::Deserialize;
use chain_network::data as net_data;
use chain_network::error::Error ... | map_err(|e| Error::BlockchainError(Box::new(e)))
}
Err(err) => Err(err),
};
match maybe_tip {
Ok(parent_tip) => {
maybe_parent_tip = Some(parent_tip);
}
Err(err) => {
if let Some(bootstrap_tip) = maybe_parent_tip... |
#[error("bootstrap pull stream failed")]
PullStreamFailed(#[source] NetworkError),
#[error("failures while deserializing block from stream")]
BlockDeserialize(#[from] std::io::Error),
#[error("the bootstrap process was interrupted")]
Interrupted,
}
pub async fn bootstrap_from_stream<S>(
bl... | random | [
{
"content": "fn network_block_error_into_reply(err: chain::Error) -> intercom::Error {\n\n use super::chain::Error::*;\n\n\n\n match err {\n\n Storage(e) => intercom::Error::failed(e),\n\n Ledger(e) => intercom::Error::failed_precondition(e),\n\n Block0(e) => intercom::Error::failed(... |
Rust | src/main.rs | azerupi/cube-parse | ee5af4aa48755449bab7d7afe01166e029791ffc | use std::{collections::HashMap, env, path::Path};
use alphanumeric_sort::compare_str;
use clap::{App, Arg};
use lazy_static::lazy_static;
use regex::Regex;
mod family;
mod internal_peripheral;
mod mcu;
mod utils;
#[derive(Debug, PartialEq)]
enum GenerateTarget {
Features,
PinMappings,
EepromSizes,
}
laz... | use std::{collections::HashMap, env, path::Path};
use alphanumeric_sort::compare_str;
use clap::{App, Arg};
use lazy_static::lazy_static;
use regex::Regex;
mod family;
mod internal_peripheral;
mod mcu;
mod utils;
#[derive(Debug, PartialEq)]
enum GenerateTarget {
Features,
PinMappings,
EepromSizes,
}
laz... | }
if let Some(ram_size) = mcu.ram_size() {
mcu_ram_size_map
.entry(ram_size)
.or_insert(vec![])
.push(mcu.ref_name.clone());
}
mcu_map.insert(mcu.ref_name.clone(), (mcu, mcu_dat));
... | teTarget::PinMappings,
"eeprom_sizes" => GenerateTarget::EepromSizes,
_ => unreachable!(),
};
let families = family::Families::load(&db_dir)
.map_err(|e| format!("Could not load families XML: {}", e))?;
let family = (&families)
.into_iter()
.find(|v| v.nam... | random | [
{
"content": "pub fn load_file<'a, P: AsRef<Path>, Q: AsRef<Path>, R: Deserialize<'a>>(\n\n db_dir: P,\n\n file_path: Q,\n\n) -> Result<R, Box<dyn Error>> {\n\n let db_dir = db_dir.as_ref();\n\n let mut fin = BufReader::new(File::open(&db_dir.join(file_path.as_ref()))?);\n\n\n\n Ok(serde_xml_rs::... |
Rust | grid/src/lib.rs | Daniel-del-Castillo/ia1 | c11d768af415a8d117152b954cb9cf25bce48631 | use crossterm::style::Colorize;
use std::fmt;
mod content;
mod path_finding;
use content::Content;
use rand::{thread_rng, Rng};
pub struct Grid {
grid: Vec<Vec<Content>>,
goal: Option<(usize, usize)>,
car: Option<(usize, usize)>,
}
impl fmt::Display for Grid {
fn fmt(&self, f: &mut fmt::Formatter<'_>)... | use crossterm::style::Colorize;
use std::fmt;
mod content;
mod path_finding;
use content::Content;
use rand::{thread_rng, Rng};
pub struct Grid {
grid: Vec<Vec<Content>>,
goal: Option<(usize, usize)>,
car: Option<(usize, usize)>,
}
impl fmt::Display for Grid {
fn fmt(&self, f: &mut fmt::Formatter<'_>)... | y][x] = Content::Car;
if let Some(old_car_pos) = &mut self.car {
self.grid[old_car_pos.1][old_car_pos.0] = Content::Empty;
}
self.car = Some((x, y));
}
pub fn set_empty(&mut self, x: usize, y: usize) {
match &mut self.grid[y][x] {
Content::Goal => self.go... | lf.grid[old_goal_pos.1][old_goal_pos.0] = Content::Empty;
}
self.goal = Some((x, y));
}
pub fn set_car(&mut self, x: usize, y: usize) {
match &mut self.grid[y][x] {
Content::Goal => self.goal = None,
Content::Car => return,
_ => {}
}
s... | random | [
{
"content": "fn get_grid_size(matches: &ArgMatches) -> (usize, usize) {\n\n let m = matches.value_of(\"m\").unwrap_or(\"10\");\n\n let n = matches.value_of(\"n\").unwrap_or(\"10\");\n\n let m = match m.parse() {\n\n Err(_) | Ok(0) => {\n\n eprintln!(\"The -m parameter must be a posit... |
Rust | src/parser/rfc3501/body.rs | filtsin/rimap | 21954bdd1a848fe4a17e4180552ab4e58027a100 |
use super::{core::*, grammar::envelope};
use crate::parser::types::{
Body, BodyEnc, BodyFields, BodyTypeBasic, BodyTypeMsg, BodyTypeText, MediaBasic, MediaType,
};
use nom::{
branch::alt,
bytes::streaming::{tag, tag_no_case},
combinator::{map, value},
multi::separated_list1,
sequence::{delim... |
use super::{core::*, grammar::envelope};
use crate::parser::types::{
Body, BodyEnc, BodyFields, BodyTypeBasic, BodyTypeMsg, BodyTypeText, MediaBasic, MediaType,
};
use nom::{
branch::alt,
bytes::streaming::{tag, tag_no_case},
combinator::{map, value},
multi::separated_list1,
sequence::{delim... | body: Box::new(body),
lines,
},
)(i)
}
pub(crate) fn body_type_text(i: &[u8]) -> IResult<&[u8], BodyTypeText<'_>> {
map(
tuple((
tag_no_case("\"TEXT\" "),
string,
tag(" "),
body_fields,
tag(" "),
number,
... | IResult<&[u8], BodyFields<'_>> {
map(
tuple((
body_fld_param,
tag(" "),
nstring,
tag(" "),
nstring,
tag(" "),
body_fld_enc,
tag(" "),
number,
)),
|(param, _, id, _, desc, _, enc, _, oc... | random | [
{
"content": "fn vec_to_string(v: &Vec<u8>) -> String {\n\n std::string::String::from_utf8_lossy(&v[..]).into_owned()\n\n}\n",
"file_path": "src/error.rs",
"rank": 0,
"score": 90814.00460926183
},
{
"content": "pub fn create_custom_error(msg: String) -> Error {\n\n Error::Custom(msg)\n... |
Rust | src/compaction/value.rs | timothee-haudebourg/json-ld | 0b44aa736b681893e75ce282c67511480c992901 | use super::{compact_iri, JsonSrc, Options};
use crate::{
context::{self, Inversible, Loader, Local},
syntax::{Container, ContainerType, Keyword, Term, Type},
util::{AsAnyJson, AsJson, JsonFrom},
ContextMut, Error, Id, Loc, Reference, Value,
};
pub async fn compact_indexed_value_with<
J: JsonSrc,
K: JsonFrom<J>,
... | use super::{compact_iri, JsonSrc, Options};
use crate::{
context::{self, Inversible, Loader, Local},
syntax::{Container, ContainerType, Keyword, Term, Type},
util::{AsAnyJson, AsJson, JsonFrom},
ContextMut, Error, Id, Loc, Reference, Value,
};
pub async fn compact_indexed_value_with<
J: JsonSrc,
K: JsonFrom<J>,
... | ,
None => active_context.default_language(),
};
let direction = match active_property_definition {
Some(def) => match def.direction {
Some(dir) => dir.option(),
None => active_context.default_base_direction(),
},
None => active_context.default_base_direction(),
};
let type_mapping: Opti... | match def.language.as_ref() {
Some(lang) => lang.as_ref().map(|l| l.as_ref()).option(),
None => active_context.default_language(),
} | if_condition | [
{
"content": "/// Get the `@value` field of a value object.\n\nfn value_value<J: JsonClone, K: JsonFrom<J>, T: Id, M>(value: &Value<J, T>, meta: M) -> K\n\nwhere\n\n\tM: Clone + Fn(Option<&J::MetaData>) -> K::MetaData,\n\n{\n\n\tuse crate::object::value::Literal;\n\n\tmatch value {\n\n\t\tValue::Literal(lit, _t... |
Rust | whisper/src/aggregation.rs | GiantPlantsSociety/graphite-rs | d2657ae3ddf110023417ec255f5192ac8fa83bfc | use serde::*;
use std::cmp;
use std::convert::Into;
use std::fmt;
use std::str::FromStr;
#[allow(clippy::trivially_copy_pass_by_ref)]
fn cmp_f64(a: &f64, b: &f64) -> cmp::Ordering {
a.partial_cmp(b).unwrap_or(::std::cmp::Ordering::Equal)
}
#[allow(clippy::trivially_copy_pass_by_ref)]
fn cmp_f64_abs(a: &f64, b: &f... | use serde::*;
use std::cmp;
use std::convert::Into;
use std::fmt;
use std::str::FromStr;
#[allow(clippy::trivially_copy_pass_by_ref)]
fn cmp_f64(a: &f64, b: &f64) -> cmp::Ordering {
a.partial_cmp(b).unwrap_or(::std::cmp::Ordering::Equal)
}
#[allow(clippy::trivially_copy_pass_by_ref)]
fn cmp_f64_abs(a: &f64, b: &f... | }
}
pub fn aggregate(self, values: &[Option<f64>]) -> Result<f64, &'static str> {
match self {
AggregationMethod::Average => {
let sum: f64 = values.iter().filter_map(|v| *v).sum();
let count = values.iter().filter_map(|v| *v).count();
... | Last,
Max,
Min,
AvgZero,
AbsMax,
AbsMin,
}
impl AggregationMethod {
pub fn from_type(aggregation_type: u32) -> Option<Self> {
match aggregation_type {
1 => Some(AggregationMethod::Average),
2 => Some(AggregationMethod::Sum),
3 => Some(AggregationM... | random | [
{
"content": "pub fn diff(\n\n path1: &Path,\n\n path2: &Path,\n\n ignore_empty: bool,\n\n mut until_time: u32,\n\n now: u32,\n\n) -> Result<Vec<DiffArchive>, io::Error> {\n\n let mut file1 = WhisperFile::open(path1)?;\n\n let mut file2 = WhisperFile::open(path2)?;\n\n\n\n if file1.info(... |
Rust | src/algorithms/leaky_bucket.rs | jbg/ratelimit_meter | df4d7a3f9b26dffe4468ad2b05a512589296dd64 |
use crate::lib::*;
use crate::thread_safety::ThreadsafeWrapper;
use crate::{
algorithms::{Algorithm, RateLimitState, RateLimitStateWithClock},
instant, InconsistentCapacity, NegativeMultiDecision, NonConformance,
};
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct LeakyBucket<P: instant::Relative = instant:... |
use crate::lib::*;
use crate::thread_safety::ThreadsafeWrapper;
use crate::{
algorithms::{Algorithm, RateLimitState, RateLimitStateWithClock},
instant, InconsistentCapacity, NegativeMultiDecision, NonConformance,
};
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct LeakyBucket<P: instant::Relative = instant:... | (per_time_unit * cell_weight.get()) / capacity.get();
Ok(LeakyBucket {
full: per_time_unit,
token_interval,
point: PhantomData,
})
}
fn test_n_and_update(
&self,
state: &Self::BucketState,
n: u32,
t0: P,
) -> Result<(), Neg... | elative> Default for BucketState<P> {
fn default() -> Self {
BucketState {
level: Duration::new(0, 0),
last_update: None,
}
}
}
impl<P: instant::Relative> Algorithm<P> for LeakyBucket<P> {
type BucketState = State<P>;
type NegativeDecision = TooEarly<P>;
fn... | random | [
{
"content": "/// Trait that all rate limit states have to implement around\n\n/// housekeeping in keyed rate limiters.\n\npub trait RateLimitState<P, I: instant::Relative>: Default + Send + Sync + Eq + fmt::Debug {}\n\n\n",
"file_path": "src/algorithms.rs",
"rank": 0,
"score": 139496.12516807122
... |
Rust | languages/idl_gen/src/rust/con_idl.rs | adrianos42/native_idl | 688de924e1e2244719a33aba40aae8b9dd10ede9 | use idl::idl_nodes::*;
use proc_macro2::{self, TokenStream};
use quote::format_ident;
pub(crate) fn get_rust_ty_ref(ty: &TypeName, references: bool) -> TokenStream {
match ty {
TypeName::Types(types) => match types {
Types::NatInt => quote! { i64 },
Types::NatFloat => quote! { f64 }... | use idl::idl_nodes::*;
use proc_macro2::{self, TokenStream};
use quote::format_ident;
pub(crate) fn get_rust_ty_ref(ty: &TypeName, references: bool) -> TokenStream {
match ty {
TypeName::Types(types) => match types {
Types::NatInt => quote! { i64 },
Types::NatFloat => quote! { f64 }... | TypeName::InterfaceTypeName(value) => {
let ident = format_ident!("{}Instance", value);
quote! { Box<dyn super::idl_impl::#ident> }
}
}
}
pub(crate) fn get_rust_ty_name(ty: &TypeName) -> String {
match ty {
TypeName::Types(types) => match types {
Type... | value) => {
let ident = format_ident!("{}", &value);
if references {
quote! { super::#ident }
} else {
quote! { #ident }
}
}
TypeName::TypeStream(_) => {
quote! { Box<dyn StreamInstance + Send + Sync> }
}... | function_block-random_span | [] |
Rust | src/mqtt/listener.rs | Galhad/ratelmq | 15395108681aa97b861d0364263ac7cd123d2b11 | use crate::mqtt::events::{ClientEvent, ServerEvent};
use crate::mqtt::packets::ControlPacket;
use crate::mqtt::transport::mqtt_bytes_stream::{MqttBytesReadStream, MqttBytesWriteStream};
use crate::mqtt::transport::packet_decoder::read_packet;
use crate::mqtt::transport::packet_encoder::write_packet;
use log::{debug, er... | use crate::mqtt::events::{ClientEvent, ServerEvent};
use crate::mqtt::packets::ControlPacket;
use crate::mqtt::transport::mqtt_bytes_stream::{MqttBytesReadStream, MqttBytesWriteStream};
use crate::mqtt::transport::packet_decoder::read_packet;
use crate::mqtt::transport::packet_encoder::write_packet;
use log::{debug, er... | _tx = client_event_tx.clone();
tokio::spawn(async move {
Self::handle_connection(socket, client_event_tx, address).await;
});
}
Err(e) => {
error!("Error while accepting connection: {:?}", e);
}
}
}
... | o::sync::mpsc::{Receiver, Sender};
use tokio::sync::{broadcast, mpsc};
pub struct MqttListener {
listener: TcpListener,
client_event_tx: mpsc::Sender<ClientEvent>,
ctrl_c_rx: broadcast::Receiver<()>,
}
impl MqttListener {
pub async fn bind(
address: &str,
client_event_tx: mpsc::Sender<... | random | [
{
"content": "#[derive(Debug)]\n\npub struct BuildInfo {\n\n pub version: &'static str,\n\n pub commit_hash: &'static str,\n\n}\n\n\n\npub const BUILD_INFO: BuildInfo = BuildInfo {\n\n version: env!(\"CARGO_PKG_VERSION\"),\n\n commit_hash: env!(\"BUILD_GIT_HASH\"),\n\n};\n",
"file_path": "src/co... |
Rust | src/utils.rs | KaiWitt/kalayo | 5498ed501cb7799cacb709403ba8a6141dc3e2e4 | use bitcoin::util::address::Address;
use bitcoin::{AddressType, Network};
use std::str::FromStr;
use warp::hyper::StatusCode;
use warp::Rejection;
use crate::error::ErrorMsg;
pub fn validate_address(address: Address) -> Result<Address, Rejection> {
if address.network != Network::Bitcoin {
return Err(Error... | use bitcoin::util::address::Address;
use bitcoin::{AddressType, Network};
use std::str::FromStr;
use warp::hyper::StatusCode;
use warp::Rejection;
use crate::error::ErrorMsg;
pub fn validate_address(address: Address) -> Result<Address, Rejection> {
if address.network != Network::Bitcoin {
return Err(Error... |
pub fn validate_address_str(address: &str) -> Result<Address, Rejection> {
match Address::from_str(address) {
Ok(address) => validate_address(address),
Err(_) => {
let msg = format!("[{}] is not a valid Bitcoin address.", &address);
Err(ErrorMsg::reject_new(StatusCode::BAD_... | if let Some(addr_type) = address.address_type() {
if addr_type != AddressType::P2wpkh {
let msg = format!("[{}] is not a P2WPKH Bitcoin mainnet address.", &address);
return Err(ErrorMsg::reject_new(StatusCode::BAD_REQUEST, msg));
}
return Ok(address);
}
log::war... | function_block-function_prefix_line | [] |
Rust | vendor/rust-cdk/src/ic_cdk_macros/src/import.rs | dfinity/bigmap-poc | 177e3be92316064d62e6e31538f01dded65b9ccb | use crate::error::Errors;
use quote::quote;
use serde::Deserialize;
use serde_tokenstream::from_tokenstream;
use std::path::PathBuf;
use std::str::FromStr;
#[derive(Default, Deserialize)]
struct ImportAttributes {
pub canister: Option<String>,
pub canister_id: Option<String>,
pub candid_path: Option<PathBu... | use crate::error::Errors;
use quote::quote;
use serde::Deserialize;
use serde_tokenstream::from_tokenstream;
use std::path::PathBuf;
use std::str::FromStr;
#[derive(Default, Deserialize)]
struct ImportAttributes {
pub canister: Option<String>,
pub canister_id: Option<String>,
pub candid_path: Option<PathBu... |
struct RustLanguageBinding {
visibility: String,
canister_id: String,
}
impl candid::codegen::rust::RustBindings for RustLanguageBinding {
fn record(
&self,
id: &str,
fields: &[(String, String)],
) -> Result<String, candid::error::Error> {
let all_fields = fields
... | fn get_env_id_and_candid(canister_name: &str) -> Result<(String, PathBuf), Errors> {
let canister_id_var_name = format!("CANISTER_ID_{}", canister_name);
let candid_path_var_name = format!("CANISTER_CANDID_{}", canister_name);
Ok((
std::env::var(canister_id_var_name).map_err(|_| {
Error... | function_block-full_function | [
{
"content": "#[derive(CandidType, serde::Deserialize, Debug)]\n\nstruct CanisterIdRecord {\n\n canister_id: candid::Principal,\n\n}\n\n\n\npub async fn subnet_create_new_canister() -> Result<CanisterId, String> {\n\n let management_canister = ic_cdk::CanisterId::from(Vec::new());\n\n let new_can_id_re... |
Rust | src/k8-client/src/client/config_rustls.rs | simlay/k8-api | 3a69671c469c46757e489f4ab6919f6601e0e514 | use std::io::{Error as IoError, ErrorKind, Result as IoResult};
use std::net::ToSocketAddrs;
use std::path::Path;
use std::pin::Pin;
use std::sync::Arc;
use std::task::{Context, Poll};
use futures_util::future::Future;
use futures_util::io::{AsyncRead as StdAsyncRead, AsyncWrite as StdAsyncWrite};
use http::Uri;
use t... | use std::io::{Error as IoError, ErrorKind, Result as IoResult};
use std::net::ToSocketAddrs;
use std::path::Path;
use std::pin::Pin;
use std::sync::Arc;
use std::task::{Context, Poll};
use futures_util::future::Future;
use futures_util::io::{AsyncRead as StdAsyncRead, AsyncWrite as StdAsyncWrite};
use http::Uri;
use t... |
}
impl AsyncWrite for HyperTlsStream {
fn poll_write(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &[u8],
) -> Poll<IoResult<usize>> {
Pin::new(&mut self.0).poll_write(cx, buf)
}
fn poll_flush(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<IoResult<()>... | Poll::Ready(bytes_read) => {
buf.advance(bytes_read);
Poll::Ready(Ok(()))
}
Poll::Pending => Poll::Pending,
}
} | function_block-function_prefix_line | [
{
"content": "pub fn create_topic_stream_result(\n\n ttw_list: &TestTopicWatchList,\n\n) -> TokenStreamResult<TopicSpec, TopicStatus,ClientError> {\n\n let mut topic_watch_list = vec![];\n\n for ttw in ttw_list {\n\n topic_watch_list.push(Ok(create_topic_watch(&ttw)));\n\n }\n\n Ok(topic_w... |
Rust | samples/command_executer/src/lib.rs | costisin/aws-nitro-enclaves-cli | de77067677ef2287661063b4529e937b52115a60 | pub mod command_parser;
pub mod protocol_helpers;
pub mod utils;
use command_parser::{CommandOutput, FileArgs, ListenArgs, RunArgs};
use protocol_helpers::{recv_loop, recv_u64, send_loop, send_u64};
use nix::sys::socket::listen as listen_vsock;
use nix::sys::socket::{accept, bind, connect, shutdown, socket};
use nix:... | pub mod command_parser;
pub mod protocol_helpers;
pub mod utils;
use command_parser::{CommandOutput, FileArgs, ListenArgs, RunArgs};
use protocol_helpers::{recv_loop, recv_u64, send_loop, send_u64};
use nix::sys::socket::listen as listen_vsock;
use nix::sys::socket::{accept, bind, connect, shutdown, socket};
use nix:... | r(|err| format!("{:?}", err))?;
send_u64(socket_fd, len)?;
send_loop(socket_fd, &buf, len)?;
let filesize = file
.metadata()
.map_err(|err| format!("Could not get file metadate {:?}", err))?
.len();
send_u64(socket_fd, filesize)?;
println!(
"Sending file {}(sending ... | ot write {:?}", err))?;
progress += tmpsize
}
Ok(())
}
pub fn send_file(args: FileArgs) -> Result<(), String> {
let mut file =
File::open(&args.localfile).map_err(|err| format!("Could not open localfile {:?}", err))?;
let vsocket = vsock_connect(args.cid, args.port)?;
let socket_fd ... | random | [
{
"content": "pub fn recv_loop(fd: RawFd, buf: &mut [u8], len: u64) -> Result<(), String> {\n\n let len: usize = len.try_into().map_err(|err| format!(\"{:?}\", err))?;\n\n let mut recv_bytes = 0;\n\n\n\n while recv_bytes < len {\n\n let size = match recv(fd, &mut buf[recv_bytes..len], MsgFlags::... |
Rust | src/test/spec/unified_runner/mod.rs | awitten1/mongo-rust-driver | 5a0192cf1ba11d9e44c453e14f90d32231689166 | mod entity;
mod matcher;
mod operation;
mod test_event;
mod test_file;
mod test_runner;
use std::{convert::TryFrom, ffi::OsStr, fs::read_dir, path::PathBuf, time::Duration};
use futures::{future::FutureExt, stream::TryStreamExt};
use semver::Version;
use tokio::sync::RwLockWriteGuard;
use crate::{
bson::{doc, Do... | mod entity;
mod matcher;
mod operation;
mod test_event;
mod test_file;
mod test_runner;
use std::{convert::TryFrom, ffi::OsStr, fs::read_dir, path::PathBuf, time::Duration};
use futures::{future::FutureExt, stream::TryStreamExt};
use semver::Version;
use tokio::sync::RwLockWriteGuard;
use crate::{
bson::{doc, Do... |
#[cfg_attr(feature = "tokio-runtime", tokio::test(flavor = "multi_thread"))]
#[cfg_attr(feature = "async-std-runtime", async_std::test)]
async fn valid_fail() {
let _guard: RwLockWriteGuard<_> = LOCK.run_exclusively().await;
let path: PathBuf = [
env!("CARGO_MANIFEST_DIR"),
"src",
"te... | d: RwLockWriteGuard<_> = LOCK.run_exclusively().await;
run_spec_test(
&["unified-test-format", "examples"],
run_unified_format_test,
)
.await;
} | function_block-function_prefixed | [
{
"content": "fn entity_matches(id: &str, actual: Option<&Bson>, entities: &EntityMap) -> bool {\n\n let bson = entities.get(id).unwrap().as_bson();\n\n results_match_inner(actual, bson, false, false, Some(entities))\n\n}\n\n\n",
"file_path": "src/test/spec/unified_runner/matcher.rs",
"rank": 0,
... |
Rust | src/cache/file_manager.rs | cloudfuse-io/cloud-readers-rs | 498ae2e6bbcdc170659bb76d428e5135f8041724 | use std::collections::BTreeMap;
use std::fmt;
use std::sync::{Arc, Condvar, Mutex};
use anyhow::{anyhow, bail, ensure, Result};
use itertools::Itertools;
use tokio::sync::mpsc::UnboundedSender;
use super::Range;
#[derive(Clone)]
pub(crate) enum Download {
Pending(usize),
Done(Arc<Vec<u8>>),
Error(String)... | use std::collections::BTreeMap;
use std::fmt;
use std::sync::{Arc, Condvar, Mutex};
use anyhow::{anyhow, bail, ensure, Result};
use itertools::Itertools;
use tokio::sync::mpsc::UnboundedSender;
use super::Range;
#[derive(Clone)]
pub(crate) enum Download {
Pending(usize),
Done(Arc<Vec<u8>>),
Error(String)... |
pub(crate) fn read(self, buf: &mut [u8]) -> usize {
let len = std::cmp::min(buf.len(), self.data.len() - self.offset as usize);
buf[0..len]
.clone_from_slice(&self.data[self.offset as usize..(self.offset as usize + len)]);
len
}
}
#[derive(Clone)]
pub... | t: u64) -> Result<Self> {
ensure!(
data.len() > offset as usize,
"Out of bound in RangeCursor: (offset={}) >= (length={})",
offset,
data.len(),
);
Ok(Self { data, offset })
} | function_block-function_prefixed | [
{
"content": "/// A downloader that always returns an error\n\nstruct ErrorDownloader;\n\n\n\n#[async_trait]\n\nimpl Downloader for ErrorDownloader {\n\n async fn download(&self, _file: String, _start: u64, _length: usize) -> Result<Vec<u8>> {\n\n Err(anyhow!(\"Download Failed\").context(\"Error in Er... |
Rust | src/asset/tileset.rs | B-Reif/bevy_asefile | 51d8abfc51aa9e406dad2e5cad4b93c22e7b3fc6 | use asefile::{AsepriteFile, TilesetImageError};
use bevy::{
prelude::*,
reflect::TypeUuid,
render::texture::{Extent3d, TextureDimension, TextureFormat},
};
use std::fmt;
pub(crate) type TilesetResult<T> = std::result::Result<T, TilesetError>;
#[derive(Debug)]
pub enum TilesetError {
MissingId(asefile:... | use asefile::{AsepriteFile, TilesetImageError};
use bevy::{
prelude::*,
reflect::T | width, height } = self.tile_size;
let tile_count = self.tile_count as f32;
Vec2::new(width as f32, height as f32 * tile_count)
}
}
#[derive(Debug)]
pub(crate) struct TilesetData<T> {
pub(crate) tile_count: u32,
pub(crate) tile_size: TileSize,
pub(crate) name: String,
pub(crate) tex... | ypeUuid,
render::texture::{Extent3d, TextureDimension, TextureFormat},
};
use std::fmt;
pub(crate) type TilesetResult<T> = std::result::Result<T, TilesetError>;
#[derive(Debug)]
pub enum TilesetError {
MissingId(asefile::TilesetId),
NoPixels(asefile::TilesetId),
}
impl fmt::Display for TilesetError {
... | random | [
{
"content": "use crate::asset::{TileSize, Tileset};\n\nuse bevy::math::{UVec2, Vec2};\n\nuse bevy_ecs_tilemap::prelude::*;\n\n\n\nimpl From<TileSize> for Vec2 {\n\n fn from(tile_size: TileSize) -> Self {\n\n Vec2::new(tile_size.width as f32, tile_size.height as f32)\n\n }\n\n}\n\n\n\nimpl Tileset ... |
Rust | src/lib.rs | justanotherdot/cargo-watch | ac0a403e0c6b64a60dd7f5f78c049301ce092b4f |
#![forbid(unsafe_code, clippy::pedantic)]
#![allow(
clippy::non_ascii_literal,
clippy::cast_sign_loss,
clippy::cast_possible_truncation
)]
#[macro_use]
extern crate clap;
extern crate watchexec;
use clap::{ArgMatches, Error, ErrorKind};
use std::{env::set_current_dir, path::MAIN_SEPARATOR};
use watchexec... |
#![forbid(unsafe_code, clippy::pedantic)]
#![allow(
clippy::non_ascii_literal,
clippy::cast_sign_loss,
clippy::cast_possible_truncation
)]
#[macro_use]
extern crate clap;
extern crate watchexec;
use clap::{ArgMatches, Error, ErrorKind};
use std::{env::set_current_dir, path::MAIN_SEPARATOR};
use watchexec... |
pub fn set_commands(debug: bool, builder: &mut ArgsBuilder, matches: &ArgMatches) {
let mut commands: Vec<String> = Vec::new();
if matches.is_present("cmd:cargo") {
for cargo in values_t!(matches, "cmd:cargo", String).unwrap_or_else(|e| e.exit()) {
let mut cmd: String = "cargo ".into... | pub fn change_dir() {
cargo::root()
.and_then(|p| set_current_dir(p).ok())
.unwrap_or_else(|| {
Error::with_description("Not a Cargo project, aborting.", ErrorKind::Io).exit();
});
} | function_block-full_function | [
{
"content": "fn main() -> watchexec::error::Result<()> {\n\n let matches = cargo_watch::args::parse();\n\n\n\n cargo_watch::change_dir();\n\n\n\n let quiet = matches.is_present(\"quiet\");\n\n let debug = matches.is_present(\"debug\");\n\n let opts = cargo_watch::get_options(debug, &matches);\n\... |
Rust | fastpay_core/src/authority.rs | mahimna-fb/fastpay | 413826688d365ad597acb002213704378e9b2efc |
use crate::{base_types::*, committee::Committee, error::FastPayError, messages::*};
use std::{collections::BTreeMap, convert::TryInto};
#[cfg(test)]
#[path = "unit_tests/authority_tests.rs"]
mod authority_tests;
#[derive(Eq, PartialEq, Debug)]
pub struct AccountOffchainState {
pub balance: Balance,
... |
use crate::{base_types::*, committee::Committee, error::FastPayError, messages::*};
use std::{collections::BTreeMap, convert::TryInto};
#[cfg(test)]
#[path = "unit_tests/authority_tests.rs"]
mod authority_tests;
#[derive(Eq, PartialEq, Debug)]
pub struct AccountOffchainState {
pub balance: Balance,
... | requested_certificate: None,
requested_received_transfers: Vec::new(),
}
}
#[cfg(test)]
pub fn new_with_balance(balance: Balance, received_log: Vec<CertifiedTransferOrder>) -> Self {
Self {
balance,
next_sequence_number: SequenceNumber::new(),
... | certificate: CertifiedTransferOrder,
) -> Result<(), FastPayError> {
let transfer = &certificate.value.transfer;
let recipient = match transfer.recipient {
Address::FastPay(recipient) => recipient,
Address::Primary(_) => {
fp_bail!(FastPayError::In... | random | [
{
"content": "pub fn serialize_info_request(value: &AccountInfoRequest) -> Vec<u8> {\n\n serialize(&ShallowSerializedMessage::InfoReq(value))\n\n}\n\n\n",
"file_path": "fastpay_core/src/serialize.rs",
"rank": 0,
"score": 194362.98059485495
},
{
"content": "pub fn serialize_transfer_order_... |
Rust | crypto/bls/src/macros.rs | sean-sn/lighthouse | c6baa0eed131c5e8ecc5860778ffc7d4a4c18d2d |
macro_rules! impl_tree_hash {
($byte_size: expr) => {
fn tree_hash_type() -> tree_hash::TreeHashType {
tree_hash::TreeHashType::Vector
}
fn tree_hash_packed_encoding(&self) -> Vec<u8> {
unreachable!("Vector should never be packed.")
}
fn tree_hash_... |
macro_rules! impl_tree_hash {
($byte_size: expr) => {
fn tree_hash_type() -> tree_hash::TreeHashType {
tree_hash::TreeHashType::Vector
}
fn tree_hash_packed_encoding(&self) -> Vec<u8> {
unreachable!("Vector should never be packed.")
}
fn tree_hash_... | Self::deserialize(&bytes).map_err(|_| arbitrary::Error::IncorrectFormat)
}
};
}
| f, D::Error>
where
D: Deserializer<'de>,
{
pub struct StringVisitor;
impl<'de> serde::de::Visitor<'de> for StringVisitor {
type Value = String;
fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
f... | random | [
{
"content": "fn string_to_bytes(string: &str) -> Result<Vec<u8>, String> {\n\n let string = if string.starts_with(\"0x\") {\n\n &string[2..]\n\n } else {\n\n string\n\n };\n\n\n\n hex::decode(string).map_err(|e| format!(\"Unable to decode public or private key: {}\", e))\n\n}\n\n\n",
... |
Rust | src/developer/ffx/plugins/setui/display/src/lib.rs | allansrc/fuchsia | a2c235b33fc4305044d496354a08775f30cdcf37 |
use anyhow::Result;
use ffx_core::ffx_plugin;
use ffx_setui_display_args::Display;
use fidl_fuchsia_settings::{DisplayProxy, DisplaySettings};
use utils::handle_mixed_result;
use utils::{self, Either, WatchOrSetResult};
#[ffx_plugin("setui", DisplayProxy = "core/setui_service:expose:fuchsia.settings.Display")]
pub a... |
use anyhow::Result;
use ffx_core::ffx_plugin;
use ffx_setui_display_args::Display;
use fidl_fuchsia_settings::{DisplayProxy, DisplaySettings};
use utils::handle_mixed_result;
use utils::{self, Either, WatchOrSetResult};
#[ffx_plugin("setui", DisplayProxy = "core/setui_service:expose:fuchsia.settings.Display")]
pub a... |
#[test_case(
Display {
brightness: None,
auto_brightness_level: None,
auto_brightness: None,
low_light_mode: None,
theme: None,
screen_enabled: None,
};
"Test display watch() output with empty input."
)]
#[test... | async fn validate_display_set_output(expected_display: Display) -> Result<()> {
let proxy = setup_fake_display_proxy(move |req| match req {
DisplayRequest::Set { responder, .. } => {
let _ = responder.send(&mut Ok(()));
}
DisplayRequest::Watch { .. } => {
... | function_block-full_function | [] |
Rust | src/setup_config.rs | amarant/msvc-helper | 27821c5cdbfdebcae94342f8b6662791f1e78b02 |
#![allow(bad_style)]
use std::ffi::OsString;
use std::ptr::null_mut;
use std::fmt;
use winapi::Interface;
use winapi::shared::minwindef::{LPFILETIME, ULONG};
use winapi::shared::winerror::S_FALSE;
use winapi::shared::wtypes::BSTR;
use winapi::shared::wtypesbase::LPCOLESTR;
use winapi::um::combaseapi::{CoCreateInsta... |
#![allow(bad_style)]
use std::ffi::OsString;
use std::ptr::null_mut;
use std::fmt;
use winapi::Interface;
use winapi::shared::minwindef::{LPFILETIME, ULONG};
use winapi::shared::winerror::S_FALSE;
use winapi::shared::wtypes::BSTR;
use winapi::shared::wtypesbase::LPCOLESTR;
use winapi::um::combaseapi::{CoCreateInsta... |
};
if err < 0 {
return Err(err);
}
let obj = unsafe { ComPtr::from_raw(obj as *mut ISetupConfiguration) };
Ok(SetupConfiguration(obj))
}
pub fn get_instance_for_current_process(&self) -> Result<SetupInstance, i32> {
let mut obj = null_mut();
l... | CoCreateInstance(
&CLSID_SetupConfiguration,
null_mut(),
CLSCTX_ALL,
&ISetupConfiguration::uuidof(),
&mut obj,
) | call_expression | [
{
"content": "pub fn get_lasted_platform_toolset() -> Option<String> {\n\n get_toolchains()\n\n .iter()\n\n .next()\n\n .map(|v| v.platform_toolset.clone())\n\n}\n",
"file_path": "src/toolchain.rs",
"rank": 1,
"score": 59086.79993836931
},
{
"content": "fn os_to_res_s... |
Rust | proto-compiler/src/cmd/compile.rs | livelybug/ibc-rs | e83a2d0963fe6fa675b4125a4e8c18b13b792d88 | use std::fs::remove_dir_all;
use std::fs::{copy, create_dir_all};
use std::path::{Path, PathBuf};
use git2::Repository;
use tempdir::TempDir;
use walkdir::WalkDir;
use argh::FromArgs;
#[derive(Debug, FromArgs)]
#[argh(subcommand, name = "compile")]
pub struct CompileCmd {
#[argh(option, short = 's')]
sd... | use std::fs::remove_dir_all;
use std::fs::{copy, create_dir_all};
use std::path::{Path, PathBuf};
use git2::Repository;
use tempdir::TempDir;
use walkdir::WalkDir;
use argh::FromArgs;
#[derive(Debug, FromArgs)]
#[argh(subcommand, name = "compile")]
pub struct CompileCmd {
#[argh(option, short = 's')]
sd... |
})
.filter_map(|e| e.err())
.collect::<Vec<_>>();
if !errors.is_empty() {
for e in errors {
println!("[error] Error while copying compiled file: {}", e);
}
panic!("[error] Aborted.");
}
}
}
| copy(
e.path(),
format!(
"{}/{}",
to_dir.display(),
&e.file_name().to_os_string().to_str().unwrap()
),
) | call_expression | [
{
"content": "/// Serialize the given `Config` as TOML to the given config file.\n\npub fn store(config: &Config, path: impl AsRef<Path>) -> Result<(), Error> {\n\n let mut file = if path.as_ref().exists() {\n\n fs::OpenOptions::new().write(true).truncate(true).open(path)\n\n } else {\n\n Fi... |
Rust | src/http_client/client_impl.rs | ngi-nix/etebase-rs | 33447aa22a2d8d2a93863312d6f61e341682ebfe | use serde::Deserialize;
use crate::error::{Error, Result};
pub trait ClientImplementation {
fn get(&self, url: &str, auth_token: Option<&str>) -> Response;
fn post(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;
fn put(&self, url: &str, auth_token: Option<&str>, body... | use serde::Deserialize;
use crate::error::{Error, Result};
pub trait ClientImplementation {
fn get(&self, url: &str, auth_token: Option<&str>) -> Response;
fn post(&self, url: &str, auth_token: Option<&str>, body: Vec<u8>) -> Response;
fn put(&self, url: &str, auth_token: Option<&str>, body... | .detail
.unwrap_or("Temporary server error")
.to_string(),
),
500..=501 | 505..=599 => {
Error::ServerError(content.detail.unwrap_or("Server error").to_string())
}
status => Error::Http(format!(
... | tent: ErrorResponse =
rmp_serde::from_read_ref(self.bytes()).unwrap_or(ErrorResponse {
code: None,
detail: None,
});
Err(match self.status {
300..=399 => Error::NotFound("Got a redirect - should never happen".to_string()),
... | random | [
{
"content": "pub fn derive_key(salt: &[u8], password: &str) -> Result<Vec<u8>> {\n\n let mut key = vec![0; 32];\n\n let salt = &salt[..argon2id13::SALTBYTES];\n\n let salt: &[u8; argon2id13::SALTBYTES] =\n\n to_enc_error!(salt.try_into(), \"Expect salt to be at least 16 bytes\")?;\n\n let pa... |
Rust | src/http.rs | mdheller/monolith | 625c529cf1409848aa3ce42a74991d0d69c75d88 | use regex::Regex;
use reqwest::header::{CONTENT_TYPE, USER_AGENT};
use reqwest::{Client, RedirectPolicy};
use std::time::Duration;
use url::{ParseError, Url};
use utils::data_to_dataurl;
lazy_static! {
static ref REGEX_URL: Regex = Regex::new(r"^https?://").unwrap();
}
pub fn is_data_url(url: &str) -> Result<bool... | use regex::Regex;
use reqwest::header::{CONTENT_TYPE, USER_AGENT};
use reqwest::{Client, RedirectPolicy};
use std::time::Duration;
use url::{ParseError, Url};
use utils::data_to_dataurl;
lazy_static! {
static ref REGEX_URL: Regex = Regex::new(r"^https?://").unwrap();
}
pub fn is_data_url(url: &str) -> Result<bool... |
assert_eq!(
resolved_url.as_str(),
"https://www.kernel.org/theme/images/logos/tux.png"
);
let resolved_url = resolve_url(
"https://www.kernel.org",
"//another-host.org/theme/images/logos/tux.png",
)?;
assert_eq!(
resol... | let resolved_url = resolve_url(
"https://www.kernel.org",
"//www.kernel.org/theme/images/logos/tux.png",
)?; | assignment_statement | [
{
"content": "pub fn data_to_dataurl(mime: &str, data: &[u8]) -> String {\n\n let mimetype = if mime == \"\" {\n\n detect_mimetype(data)\n\n } else {\n\n mime.to_string()\n\n };\n\n format!(\"data:{};base64,{}\", mimetype, encode(data))\n\n}\n\n\n",
"file_path": "src/utils.rs",
... |
Rust | src/board/builder.rs | veeso/chess-engine-harmon | 463474a593e10695281309293677f2d96a06ddd6 |
use super::{Board, Color, Piece, Square, BLACK, WHITE};
pub struct BoardBuilder {
board: Board,
}
impl From<Board> for BoardBuilder {
fn from(board: Board) -> Self {
Self { board }
}
}
impl Default for BoardBuilder {
fn default() -> Self {
let mut board = Board::empty();
boa... |
use super::{Board, Color, Piece, Square, BLACK, WHITE};
pub struct BoardBuilder {
board: Board,
}
impl From<Board> for BoardBuilder {
fn from(board: Board) -> Self {
Self { board }
}
}
impl Default for BoardBuilder {
|
}
impl BoardBuilder {
pub fn row(mut self, piece: Piece) -> Self {
let mut pos = piece.get_pos();
while pos.get_col() > 0 {
pos = pos.next_left()
}
for _ in 0..8 {
*self.board.get_square(pos) = Square::from(piece.move_to(pos));
po... | fn default() -> Self {
let mut board = Board::empty();
board.white_castling_rights.disable_all();
board.black_castling_rights.disable_all();
Self { board }
} | function_block-function_prefix_line | [
{
"content": "/// ### was_illegal_move\n\n///\n\n/// Returns whether game result was an illegal move\n\npub fn was_illegal_move(res: &GameResult) -> bool {\n\n matches!(res, Err(GameError::IllegalMove(_)))\n\n}\n\n\n",
"file_path": "src/game/result.rs",
"rank": 0,
"score": 43371.68225817752
},
... |
Rust | src/direction.rs | jack-atack/Cursive | fc065e8e589c24dfa7906d9423c7b63fee095e23 |
use crate::vec::Vec2;
use crate::XY;
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum Orientation {
Horizontal,
Vertical,
}
impl Orientation {
pub fn pair() -> XY<Orientation> {
XY::new(Orientation::Horizontal, Orientation::Vertical)
}
pub fn get<T: C... |
use crate::vec::Vec2;
use crate::XY;
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum Orientation {
Horizontal,
Vertical,
}
impl Orientation {
pub fn pair() -> XY<Orientation> {
XY::new(Orientation::Horizontal, Orientation::Vertical)
}
pub fn get<T: C... | n::Horizontal, Absolute::Right)
| (Orientation::Vertical, Absolute::Down) => Some(Relative::Back),
_ => None,
}
}
}
| rientation) -> Option<Relative> {
match (orientation, self) {
(Orientation::Horizontal, Absolute::Left)
| (Orientation::Vertical, Absolute::Up) => Some(Relative::Front),
(Orientatio | function_block-random_span | [
{
"content": "fn cap<'a, I: Iterator<Item = &'a mut usize>>(iter: I, max: usize) {\n\n let mut available = max;\n\n for item in iter {\n\n if *item > available {\n\n *item = available;\n\n }\n\n\n\n available -= *item;\n\n }\n\n}\n\n\n\nimpl LinearLayout {\n\n /// Cre... |
Rust | src/gui/layout.rs | lukexor/pix-engine | 447b794d57fcb4e6c5631254857d210c430f0181 |
use crate::{ops::clamp_size, prelude::*};
impl PixState {
#[inline]
pub fn same_line<O>(&mut self, offset: O)
where
O: Into<Option<[i32; 2]>>,
{
let [x, y] = self.ui.pcursor().as_array(... |
use crate::{ops::clamp_size, prelude::*};
impl PixState {
#[inline]
pub fn same_line<O>(&mut self, offset: O)
where
O: Into<Option<[i32; 2]>>,
{
let [x, y] = self.ui.pcursor().as_array(... |
}
impl PixState {
pub fn spacing(&mut self) -> PixResult<()> {
let s = self;
let width = s.ui_width()?;
let (_, height) = s.text_size(" ")?;
s.advance_cursor([width, height]);
... | pub fn tab_bar<S, I, F>(&mut self, label: S, tabs: &[I], f: F) -> PixResult<()>
where
S: AsRef<str>,
I: AsRef<str>,
F: FnOnce(usize, &mut PixState) -> PixResult<()>,
{
let label = label.as_ref();
let s = self;
let tab_id = s.ui.get_id(&label);
let colors ... | function_block-full_function | [
{
"content": "pub fn main() -> PixResult<()> {\n\n let mut engine = PixEngine::builder()\n\n .with_dimensions(WIDTH, HEIGHT)\n\n .with_title(\"Colors\")\n\n .with_frame_rate()\n\n .build()?;\n\n let mut app = Colors::new();\n\n engine.run(&mut app)\n\n}\n",
"file_path": ... |
Rust | PLs/Rust/Slns/Simple-Windows-RS-Window/src/main.rs | QubitTooLate/How-To-Make-A-Win32-Window | 2593bf0192bc361490a957eb3b6b5d2c23bed11b |
use bindings::{
Windows::Win32::{
Foundation::*,
UI::WindowsAndMessaging::*,
System::LibraryLoader::{
GetModuleHandleA,
},
},
};
use windows::*;
fn main() -> Result<()> {
let mut window = Win3Window::new()?;
window.run()
}
struct Win3Window {
handle: ... |
use bindings::{
Windows::Win32::{
Foundation::*,
UI::WindowsAndMessaging::*,
System::LibraryLoader::{
GetModuleHandleA,
},
},
};
use windows::*;
fn main() -> Result<()> {
let mut window = Win3Window::new()?;
window.run()
}
struct Win3Window {
handle: ... | handle, message, w, l);
}
DefWindowProcA(window_handle, message, w, l)
}
}
}
#[allow(non_snake_case)]
#[cfg(target_pointer_width = "32")]
unsafe fn SetWindowLong(window: HWND, index: WINDOW_LONG_PTR_INDEX, value: isize) -> isize {
SetWindowLongA(window, index, value as _) as _
... | LRESULT(0)
}
WM_DESTROY => {
PostQuitMessage(0);
LRESULT(0)
}
_ => DefWindowProcA(window_handle, message, w, l),
}
}
}
fn run(&mut self) -> Result<()> {
unsafe {
let i... | random | [] |
Rust | lamp_asm_parser/src/lexer.rs | ElFamosoKilluaah/lamp | 4a879129118a798de6d2ba05b5e39a0f0663649b | use lamp_common::op::{get_op, Opcode};
#[derive(Debug, Copy, Clone, PartialEq)]
pub enum TokenType {
Opcode(Opcode),
Num8(u8),
Ptr8(u8),
}
#[derive(Debug)]
pub enum LexerError {
UnexpectedToken(usize, String),
InvalidMnemonic(usize, String),
InvalidLine(usize),
}
impl std::fmt:... | use lamp_common::op::{get_op, Opcode};
#[derive(Debug, Copy, Clone, PartialEq)]
pub enum TokenType {
Opcode(Opcode),
Num8(u8),
Ptr8(u8),
}
#[derive(Debug)]
pub enum LexerError {
UnexpectedToken(usize, String),
InvalidMnemonic(usize, String),
InvalidLine(usize),
}
impl std::fmt:... | e>::new();
let mut errors = Vec::<LexerError>::new();
#[allow(clippy::needless_range_loop)]
for i in 0..content.len() {
if content[i].starts_with(lamp_common::constants::COMMENT_MARKER) {
continue;
}
match self.tokenize_line(&content[i], i) {
... | '", at + 1, tkn)
}
Self::InvalidMnemonic(at, mnemonic) => {
write!(f, "Invalid mnemonic at line {}: \'{}\'", at + 1, mnemonic)
}
}
}
}
pub struct Lexer;
#[derive(PartialEq, Debug)]
pub struct TokenizedLine {
pub opcode: Opcode,
pub operands: Vec<... | random | [
{
"content": "pub fn get_op<'a>(base: String) -> Result<Opcode, &'a str> {\n\n for (opcode, name) in OPCODES_STRINGS {\n\n if base.to_uppercase().contains(name) {\n\n return Ok(*opcode);\n\n }\n\n }\n\n\n\n Err(\"No opcode found.\")\n\n}\n",
"file_path": "lamp_common/src/op... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.