{\n\n let module = deserialize(wasm_code)?;\n\n check_wasm_memories(&module)?;\n\n check_wasm_exports(&module)?;\n\n check_wasm_imports(&module, SUPPORTED_IMPORTS)?;\n\n check_wasm_features(&module, supported_features)?;\n\n Ok(())\n\n}\n\n\n","file_path":"packages/vm/src/compatibility.rs","rank":92,"score":160350.36382270342},{"content":"pub fn query_account(deps: Deps, channel_id: String) -> StdResult<AccountResponse> {\n\n let account = accounts_read(deps.storage).load(channel_id.as_bytes())?;\n\n Ok(AccountResponse {\n\n account: Some(account),\n\n })\n\n}\n\n\n","file_path":"contracts/ibc-reflect/src/contract.rs","rank":93,"score":160350.36382270342},{"content":"/// All external requirements that can be injected for unit tests.\n\n/// It sets the given balance for the contract itself, nothing else\n\npub fn mock_backend(contract_balance: &[Coin]) -> Backend<MockApi, MockStorage, MockQuerier> {\n\n let contract_addr = HumanAddr::from(MOCK_CONTRACT_ADDR);\n\n Backend {\n\n api: MockApi::default(),\n\n storage: MockStorage::default(),\n\n querier: MockQuerier::new(&[(&contract_addr, contract_balance)]),\n\n }\n\n}\n\n\n","file_path":"packages/vm/src/testing/mock.rs","rank":94,"score":158386.74442027486},{"content":"fn do_release(deps: DepsMut, env: Env, info: MessageInfo) -> Result<HandleResponse, HackError> {\n\n let data = deps\n\n .storage\n\n .get(CONFIG_KEY)\n\n .ok_or_else(|| StdError::not_found(\"State\"))?;\n\n let state: State = from_slice(&data)?;\n\n\n\n if deps.api.canonical_address(&info.sender)? == state.verifier {\n\n let to_addr = deps.api.human_address(&state.beneficiary)?;\n\n let balance = deps.querier.query_all_balances(&env.contract.address)?;\n\n\n\n let mut ctx = Context::new();\n\n ctx.add_attribute(\"action\", \"release\");\n\n ctx.add_attribute(\"destination\", &to_addr);\n\n ctx.add_message(BankMsg::Send {\n\n to_address: to_addr,\n\n amount: balance,\n\n });\n\n ctx.set_data(&[0xF0, 0x0B, 0xAA]);\n\n Ok(ctx.into())\n\n } else {\n\n Err(HackError::Unauthorized {})\n\n }\n\n}\n\n\n","file_path":"contracts/hackatom/src/contract.rs","rank":95,"score":157604.9392705633},{"content":"pub fn migrate(\n\n deps: DepsMut,\n\n _env: Env,\n\n _info: MessageInfo,\n\n msg: MigrateMsg,\n\n) -> Result<MigrateResponse, HackError> {\n\n let data = deps\n\n .storage\n\n .get(CONFIG_KEY)\n\n .ok_or_else(|| StdError::not_found(\"State\"))?;\n\n let mut config: State = from_slice(&data)?;\n\n config.verifier = deps.api.canonical_address(&msg.verifier)?;\n\n deps.storage.set(CONFIG_KEY, &to_vec(&config)?);\n\n\n\n Ok(MigrateResponse::default())\n\n}\n\n\n","file_path":"contracts/hackatom/src/contract.rs","rank":96,"score":156682.74940229772},{"content":"#[entry_point]\n\npub fn init(\n\n _deps: DepsMut,\n\n _env: Env,\n\n _info: MessageInfo,\n\n _msg: InitMsg,\n\n) -> StdResult<InitResponse> {\n\n Err(StdError::generic_err(\n\n \"You can only use this contract for migrations\",\n\n ))\n\n}\n\n\n","file_path":"contracts/burner/src/contract.rs","rank":97,"score":156682.74940229772},{"content":"pub fn handle(\n\n deps: DepsMut,\n\n env: Env,\n\n info: MessageInfo,\n\n msg: HandleMsg,\n\n) -> Result<HandleResponse, HackError> {\n\n match msg {\n\n HandleMsg::Release {} => do_release(deps, env, info),\n\n HandleMsg::CpuLoop {} => do_cpu_loop(),\n\n HandleMsg::StorageLoop {} => do_storage_loop(deps),\n\n HandleMsg::MemoryLoop {} => do_memory_loop(),\n\n HandleMsg::AllocateLargeMemory { pages } => do_allocate_large_memory(pages),\n\n HandleMsg::Panic {} => do_panic(),\n\n HandleMsg::UserErrorsInApiCalls {} => do_user_errors_in_api_calls(deps.api),\n\n }\n\n}\n\n\n","file_path":"contracts/hackatom/src/contract.rs","rank":98,"score":156682.74940229772},{"content":"pub fn init(\n\n deps: DepsMut,\n\n _env: Env,\n\n info: MessageInfo,\n\n msg: InitMsg,\n\n) -> Result<InitResponse, HackError> {\n\n deps.api.debug(\"here we go 🚀\");\n\n\n\n deps.storage.set(\n\n CONFIG_KEY,\n\n &to_vec(&State {\n\n verifier: deps.api.canonical_address(&msg.verifier)?,\n\n beneficiary: deps.api.canonical_address(&msg.beneficiary)?,\n\n funder: deps.api.canonical_address(&info.sender)?,\n\n })?,\n\n );\n\n\n\n // This adds some unrelated event attribute for testing purposes\n\n let mut ctx = Context::new();\n\n ctx.add_attribute(\"Let the\", \"hacking begin\");\n\n Ok(ctx.try_into()?)\n\n}\n\n\n","file_path":"contracts/hackatom/src/contract.rs","rank":99,"score":156682.74940229772}],"string":"[\n {\n \"content\": \"pub fn config(storage: &mut dyn Storage) -> Singleton<State> {\\n\\n singleton(storage, CONFIG_KEY)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/reflect/src/state.rs\",\n \"rank\": 0,\n \"score\": 281227.80228281906\n },\n {\n \"content\": \"#[entry_point]\\n\\npub fn init(deps: DepsMut, _env: Env, info: MessageInfo, msg: InitMsg) -> StdResult<InitResponse> {\\n\\n // ensure the validator is registered\\n\\n let vals = deps.querier.query_validators()?;\\n\\n if !vals.iter().any(|v| v.address == msg.validator) {\\n\\n return Err(StdError::generic_err(format!(\\n\\n \\\"{} is not in the current validator set\\\",\\n\\n msg.validator\\n\\n )));\\n\\n }\\n\\n\\n\\n let token = TokenInfoResponse {\\n\\n name: msg.name,\\n\\n symbol: msg.symbol,\\n\\n decimals: msg.decimals,\\n\\n };\\n\\n token_info(deps.storage).save(&token)?;\\n\\n\\n\\n let denom = deps.querier.query_bonded_denom()?;\\n\\n let invest = InvestmentInfo {\\n\\n owner: deps.api.canonical_address(&info.sender)?,\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 1,\n \"score\": 253283.8093340361\n },\n {\n \"content\": \"#[entry_point]\\n\\npub fn init(deps: DepsMut, _env: Env, _info: MessageInfo, msg: InitMsg) -> StdResult<InitResponse> {\\n\\n // we store the reflect_id for creating accounts later\\n\\n let cfg = Config {\\n\\n reflect_code_id: msg.reflect_code_id,\\n\\n };\\n\\n config(deps.storage).save(&cfg)?;\\n\\n\\n\\n Ok(InitResponse::default())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/contract.rs\",\n \"rank\": 2,\n \"score\": 250641.59643675713\n },\n {\n \"content\": \"/// balances are state of the erc20 tokens\\n\\npub fn balances(storage: &mut dyn Storage) -> Bucket<Uint128> {\\n\\n bucket(storage, PREFIX_BALANCE)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 3,\n \"score\": 240784.59732500376\n },\n {\n \"content\": \"/// claims are the claims to money being unbonded\\n\\npub fn claims(storage: &mut dyn Storage) -> Bucket<Uint128> {\\n\\n bucket(storage, PREFIX_CLAIMS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 4,\n \"score\": 240779.3356561612\n },\n {\n \"content\": \"pub fn total_supply(storage: &mut dyn Storage) -> Singleton<Supply> {\\n\\n singleton(storage, KEY_TOTAL_SUPPLY)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 5,\n \"score\": 237858.7412667757\n },\n {\n \"content\": \"pub fn config(storage: &mut dyn Storage) -> Singleton<Config> {\\n\\n singleton(storage, KEY_CONFIG)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/state.rs\",\n \"rank\": 6,\n \"score\": 237858.7412667757\n },\n {\n \"content\": \"/// nextval increments the counter by 1 and returns the new value.\\n\\n/// On the first time it is called (no sequence info in db) it will return 1.\\n\\npub fn nextval(seq: &mut Singleton<u64>) -> StdResult<u64> {\\n\\n let val = currval(&seq)? + 1;\\n\\n seq.save(&val)?;\\n\\n Ok(val)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use cosmwasm_std::testing::MockStorage;\\n\\n\\n\\n #[test]\\n\\n fn walk_through_sequence() {\\n\\n let mut store = MockStorage::new();\\n\\n let mut seq = sequence(&mut store, b\\\"seq\\\");\\n\\n\\n\\n assert_eq!(currval(&seq).unwrap(), 0);\\n\\n assert_eq!(nextval(&mut seq).unwrap(), 1);\\n\\n assert_eq!(nextval(&mut seq).unwrap(), 2);\\n\\n assert_eq!(nextval(&mut seq).unwrap(), 3);\\n\",\n \"file_path\": \"packages/storage/src/sequence.rs\",\n \"rank\": 7,\n \"score\": 237441.20400205866\n },\n {\n \"content\": \"/// accounts is lookup of channel_id to reflect contract\\n\\npub fn accounts(storage: &mut dyn Storage) -> Bucket<HumanAddr> {\\n\\n bucket(storage, PREFIX_ACCOUNTS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/state.rs\",\n \"rank\": 8,\n \"score\": 235041.9965561165\n },\n {\n \"content\": \"pub fn invest_info(storage: &mut dyn Storage) -> Singleton<InvestmentInfo> {\\n\\n singleton(storage, KEY_INVESTMENT)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 9,\n \"score\": 235041.9965561165\n },\n {\n \"content\": \"/// Runs a series of IO tests, hammering especially on allocate and deallocate.\\n\\n/// This could be especially useful when run with some kind of leak detector.\\n\\npub fn test_io<A, S, Q>(instance: &mut Instance<A, S, Q>)\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n{\\n\\n let sizes: Vec<usize> = vec![0, 1, 3, 10, 200, 2000, 5 * 1024];\\n\\n let bytes: Vec<u8> = vec![0x00, 0xA5, 0xFF];\\n\\n\\n\\n for size in sizes.into_iter() {\\n\\n for byte in bytes.iter() {\\n\\n let original = vec![*byte; size];\\n\\n let wasm_ptr = instance\\n\\n .allocate(original.len())\\n\\n .expect(\\\"Could not allocate memory\\\");\\n\\n instance\\n\\n .write_memory(wasm_ptr, &original)\\n\\n .expect(\\\"Could not write data\\\");\\n\\n let wasm_data = instance.read_memory(wasm_ptr, size).expect(\\\"error reading\\\");\\n\\n assert_eq!(\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 10,\n \"score\": 234345.25199057756\n },\n {\n \"content\": \"pub fn query(deps: Deps, env: Env, msg: QueryMsg) -> StdResult<QueryResponse> {\\n\\n match msg {\\n\\n QueryMsg::Verifier {} => to_binary(&query_verifier(deps)?),\\n\\n QueryMsg::OtherBalance { address } => to_binary(&query_other_balance(deps, address)?),\\n\\n QueryMsg::Recurse { depth, work } => {\\n\\n to_binary(&query_recurse(deps, depth, work, env.contract.address)?)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/src/contract.rs\",\n \"rank\": 11,\n \"score\": 232543.25311447476\n },\n {\n \"content\": \"pub fn query(deps: Deps, _env: Env, msg: QueryMsg) -> StdResult<QueryResponse> {\\n\\n match msg {\\n\\n QueryMsg::Count {} => to_binary(&query_count(deps)?),\\n\\n QueryMsg::Sum {} => to_binary(&query_sum(deps)?),\\n\\n QueryMsg::Reducer {} => to_binary(&query_reducer(deps)?),\\n\\n QueryMsg::List {} => to_binary(&query_list(deps)?),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/queue/src/contract.rs\",\n \"rank\": 12,\n \"score\": 232543.25311447476\n },\n {\n \"content\": \"pub fn query(deps: Deps, _env: Env, msg: QueryMsg) -> StdResult<QueryResponse> {\\n\\n match msg {\\n\\n QueryMsg::Owner {} => to_binary(&query_owner(deps)?),\\n\\n QueryMsg::Capitalized { text } => to_binary(&query_capitalized(deps, text)?),\\n\\n QueryMsg::Chain { request } => to_binary(&query_chain(deps, &request)?),\\n\\n QueryMsg::Raw { contract, key } => to_binary(&query_raw(deps, contract, key)?),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/reflect/src/contract.rs\",\n \"rank\": 13,\n \"score\": 232543.25311447476\n },\n {\n \"content\": \"#[entry_point]\\n\\npub fn query(deps: Deps, _env: Env, msg: QueryMsg) -> StdResult<QueryResponse> {\\n\\n match msg {\\n\\n QueryMsg::TokenInfo {} => to_binary(&query_token_info(deps)?),\\n\\n QueryMsg::Investment {} => to_binary(&query_investment(deps)?),\\n\\n QueryMsg::Balance { address } => to_binary(&query_balance(deps, address)?),\\n\\n QueryMsg::Claims { address } => to_binary(&query_claims(deps, address)?),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 14,\n \"score\": 232543.25311447476\n },\n {\n \"content\": \"pub fn token_info(storage: &mut dyn Storage) -> Singleton<TokenInfoResponse> {\\n\\n singleton(storage, KEY_TOKEN_INFO)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 15,\n \"score\": 232323.65929407097\n },\n {\n \"content\": \"/// Shortcut helper as the construction of WasmMsg::Instantiate can be quite verbose in contract code\\n\\npub fn wasm_instantiate<T>(\\n\\n code_id: u64,\\n\\n msg: &T,\\n\\n send: Vec<Coin>,\\n\\n label: Option<String>,\\n\\n) -> StdResult<WasmMsg>\\n\\nwhere\\n\\n T: Serialize,\\n\\n{\\n\\n let payload = to_binary(msg)?;\\n\\n Ok(WasmMsg::Instantiate {\\n\\n code_id,\\n\\n msg: payload,\\n\\n send,\\n\\n label,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/std/src/results/cosmos_msg.rs\",\n \"rank\": 16,\n \"score\": 230713.6230709313\n },\n {\n \"content\": \"/// Compiles a given Wasm bytecode into a module.\\n\\n/// The given memory limit (in bytes) is used when memories are created.\\n\\npub fn compile_and_use(code: &[u8], memory_limit: Option<Size>) -> VmResult<Module> {\\n\\n let store = make_compile_time_store(memory_limit);\\n\\n let module = Module::new(&store, code)?;\\n\\n Ok(module)\\n\\n}\\n\",\n \"file_path\": \"packages/vm/src/wasm_backend/compile.rs\",\n \"rank\": 17,\n \"score\": 230221.17867112433\n },\n {\n \"content\": \"#[entry_point]\\n\\npub fn query(deps: Deps, _env: Env, msg: QueryMsg) -> StdResult<QueryResponse> {\\n\\n match msg {\\n\\n QueryMsg::Account { channel_id } => to_binary(&query_account(deps, channel_id)?),\\n\\n QueryMsg::ListAccounts {} => to_binary(&query_list_accounts(deps)?),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/contract.rs\",\n \"rank\": 18,\n \"score\": 230179.7598445887\n },\n {\n \"content\": \"/// Shortcut helper as the construction of WasmMsg::Instantiate can be quite verbose in contract code\\n\\npub fn wasm_execute<T, U>(contract_addr: T, msg: &U, send: Vec<Coin>) -> StdResult<WasmMsg>\\n\\nwhere\\n\\n T: Into<HumanAddr>,\\n\\n U: Serialize,\\n\\n{\\n\\n let payload = to_binary(msg)?;\\n\\n Ok(WasmMsg::Execute {\\n\\n contract_addr: contract_addr.into(),\\n\\n msg: payload,\\n\\n send,\\n\\n })\\n\\n}\\n\\n\\n\\nimpl<T: Clone + fmt::Debug + PartialEq + JsonSchema> From<BankMsg> for CosmosMsg<T> {\\n\\n fn from(msg: BankMsg) -> Self {\\n\\n CosmosMsg::Bank(msg)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"staking\\\")]\\n\",\n \"file_path\": \"packages/std/src/results/cosmos_msg.rs\",\n \"rank\": 19,\n \"score\": 229980.73091645184\n },\n {\n \"content\": \"/// A prepared and sufficiently large memory Region is expected at ptr that points to pre-allocated memory.\\n\\n///\\n\\n/// Returns number of bytes written on success.\\n\\npub fn write_region(memory: &wasmer::Memory, ptr: u32, data: &[u8]) -> VmResult<()> {\\n\\n let mut region = get_region(memory, ptr)?;\\n\\n\\n\\n let region_capacity = region.capacity as usize;\\n\\n if data.len() > region_capacity {\\n\\n return Err(CommunicationError::region_too_small(region_capacity, data.len()).into());\\n\\n }\\n\\n match WasmPtr::<u8, Array>::new(region.offset).deref(memory, 0, region.capacity) {\\n\\n Some(cells) => {\\n\\n // In case you want to do some premature optimization, this shows how to cast a `&'mut [Cell<u8>]` to `&mut [u8]`:\\n\\n // https://github.com/wasmerio/wasmer/blob/0.13.1/lib/wasi/src/syscalls/mod.rs#L79-L81\\n\\n for i in 0..data.len() {\\n\\n cells[i].set(data[i])\\n\\n }\\n\\n region.length = data.len() as u32;\\n\\n set_region(memory, ptr, region)?;\\n\\n Ok(())\\n\\n },\\n\\n None => Err(CommunicationError::deref_err(region.offset, format!(\\n\\n \\\"Tried to access memory of region {:?} in wasm memory of size {} bytes. This typically happens when the given Region pointer does not point to a proper Region struct.\\\",\\n\\n region,\\n\\n memory.size().bytes().0\\n\\n )).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/memory.rs\",\n \"rank\": 20,\n \"score\": 223519.22272684413\n },\n {\n \"content\": \"/// Created a store with no compiler and the given memory limit (in bytes)\\n\\n/// If memory_limit is None, no limit is applied.\\n\\npub fn make_runtime_store(memory_limit: Option<Size>) -> Store {\\n\\n let engine = JIT::headless().engine();\\n\\n make_store_with_engine(&engine, memory_limit)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/wasm_backend/store.rs\",\n \"rank\": 21,\n \"score\": 218245.24870611748\n },\n {\n \"content\": \"/// Created a store with the default compiler and the given memory limit (in bytes).\\n\\n/// If memory_limit is None, no limit is applied.\\n\\npub fn make_compile_time_store(memory_limit: Option<Size>) -> Store {\\n\\n let gas_limit = 0;\\n\\n let deterministic = Arc::new(Deterministic::new());\\n\\n let metering = Arc::new(Metering::new(gas_limit, cost));\\n\\n\\n\\n #[cfg(feature = \\\"cranelift\\\")]\\n\\n {\\n\\n let mut config = Cranelift::default();\\n\\n config.push_middleware(deterministic);\\n\\n config.push_middleware(metering);\\n\\n let engine = JIT::new(config).engine();\\n\\n make_store_with_engine(&engine, memory_limit)\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"cranelift\\\"))]\\n\\n {\\n\\n let mut config = Singlepass::default();\\n\\n config.push_middleware(deterministic);\\n\\n config.push_middleware(metering);\\n\\n let engine = JIT::new(config).engine();\\n\\n make_store_with_engine(&engine, memory_limit)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/wasm_backend/store.rs\",\n \"rank\": 22,\n \"score\": 216484.60370434215\n },\n {\n \"content\": \"/// Compiles a given Wasm bytecode into a module.\\n\\n/// The resulting module has no memory limit. This\\n\\n/// should only be used to compile for caching.\\n\\npub fn compile_only(code: &[u8]) -> VmResult<Module> {\\n\\n let store = make_compile_time_store(None);\\n\\n let module = Module::new(&store, code)?;\\n\\n Ok(module)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/wasm_backend/compile.rs\",\n \"rank\": 23,\n \"score\": 213028.40530758232\n },\n {\n \"content\": \"pub fn config_read(storage: &dyn Storage) -> ReadonlySingleton<State> {\\n\\n singleton_read(storage, CONFIG_KEY)\\n\\n}\\n\",\n \"file_path\": \"contracts/reflect/src/state.rs\",\n \"rank\": 24,\n \"score\": 212776.66087558464\n },\n {\n \"content\": \"/// Creates a memory region of capacity `size` and length 0. Returns a pointer to the Region.\\n\\n/// This is the same as the `allocate` export, but designed to be called internally.\\n\\npub fn alloc(size: usize) -> *mut Region {\\n\\n let data: Vec<u8> = Vec::with_capacity(size);\\n\\n let data_ptr = data.as_ptr() as usize;\\n\\n\\n\\n let region = build_region_from_components(\\n\\n u32::try_from(data_ptr).expect(\\\"pointer doesn't fit in u32\\\"),\\n\\n u32::try_from(data.capacity()).expect(\\\"capacity doesn't fit in u32\\\"),\\n\\n 0,\\n\\n );\\n\\n mem::forget(data);\\n\\n Box::into_raw(region)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/std/src/memory.rs\",\n \"rank\": 25,\n \"score\": 211700.40200002398\n },\n {\n \"content\": \"/// Expects a (fixed size) Region struct at ptr, which is read. This links to the\\n\\n/// memory region, which is copied in the second step.\\n\\n/// Errors if the length of the region exceeds `max_length`.\\n\\npub fn read_region(memory: &wasmer::Memory, ptr: u32, max_length: usize) -> VmResult<Vec<u8>> {\\n\\n let region = get_region(memory, ptr)?;\\n\\n\\n\\n if region.length > to_u32(max_length)? {\\n\\n return Err(\\n\\n CommunicationError::region_length_too_big(region.length as usize, max_length).into(),\\n\\n );\\n\\n }\\n\\n\\n\\n match WasmPtr::<u8, Array>::new(region.offset).deref(memory, 0, region.length) {\\n\\n Some(cells) => {\\n\\n // In case you want to do some premature optimization, this shows how to cast a `&'mut [Cell<u8>]` to `&mut [u8]`:\\n\\n // https://github.com/wasmerio/wasmer/blob/0.13.1/lib/wasi/src/syscalls/mod.rs#L79-L81\\n\\n let len = region.length as usize;\\n\\n let mut result = vec![0u8; len];\\n\\n for i in 0..len {\\n\\n result[i] = cells[i].get();\\n\\n }\\n\\n Ok(result)\\n\\n }\\n\\n None => Err(CommunicationError::deref_err(region.offset, format!(\\n\\n \\\"Tried to access memory of region {:?} in wasm memory of size {} bytes. This typically happens when the given Region pointer does not point to a proper Region struct.\\\",\\n\\n region,\\n\\n memory.size().bytes().0\\n\\n )).into()),\\n\\n }\\n\\n}\\n\\n\\n\\n/// maybe_read_region is like read_region, but gracefully handles null pointer (0) by returning None\\n\\n/// meant to be used where the argument is optional (like scan)\\n\",\n \"file_path\": \"packages/vm/src/memory.rs\",\n \"rank\": 26,\n \"score\": 210932.0887411186\n },\n {\n \"content\": \"pub fn custom_query_execute(query: &SpecialQuery) -> ContractResult<Binary> {\\n\\n let msg = match query {\\n\\n SpecialQuery::Ping {} => \\\"pong\\\".to_string(),\\n\\n SpecialQuery::Capitalized { text } => text.to_uppercase(),\\n\\n };\\n\\n to_binary(&SpecialResponse { msg }).into()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use cosmwasm_std::{from_binary, QuerierWrapper, QueryRequest};\\n\\n\\n\\n #[test]\\n\\n fn custom_query_execute_ping() {\\n\\n let res = custom_query_execute(&SpecialQuery::Ping {}).unwrap();\\n\\n let response: SpecialResponse = from_binary(&res).unwrap();\\n\\n assert_eq!(response.msg, \\\"pong\\\");\\n\\n }\\n\\n\\n\",\n \"file_path\": \"contracts/reflect/src/testing.rs\",\n \"rank\": 27,\n \"score\": 209664.74448282478\n },\n {\n \"content\": \"/// Similar to alloc, but instead of creating a new vector it consumes an existing one and returns\\n\\n/// a pointer to the Region (preventing the memory from being freed until explicitly called later).\\n\\n///\\n\\n/// The resulting Region has capacity = length, i.e. the buffer's capacity is ignored.\\n\\npub fn release_buffer(buffer: Vec<u8>) -> *mut Region {\\n\\n let region = build_region(&buffer);\\n\\n mem::forget(buffer);\\n\\n Box::into_raw(region)\\n\\n}\\n\\n\\n\\n/// Return the data referenced by the Region and\\n\\n/// deallocates the Region (and the vector when finished).\\n\\n/// Warning: only use this when you are sure the caller will never use (or free) the Region later\\n\\n///\\n\\n/// # Safety\\n\\n///\\n\\n/// The ptr must refer to a valid Region, which was previously returned by alloc,\\n\\n/// and not yet deallocated. This call will deallocate the Region and return an owner vector\\n\\n/// to the caller containing the referenced data.\\n\\n///\\n\\n/// Naturally, calling this function twice on the same pointer will double deallocate data\\n\\n/// and lead to a crash. Make sure to call it exactly once (either consuming the input in\\n\\n/// the wasm code OR deallocating the buffer from the caller).\\n\\npub unsafe fn consume_region(ptr: *mut Region) -> Vec<u8> {\\n\",\n \"file_path\": \"packages/std/src/memory.rs\",\n \"rank\": 28,\n \"score\": 203337.65664831124\n },\n {\n \"content\": \"pub fn mock_instance(\\n\\n wasm: &[u8],\\n\\n contract_balance: &[Coin],\\n\\n) -> Instance<MockApi, MockStorage, MockQuerier> {\\n\\n mock_instance_with_options(\\n\\n wasm,\\n\\n MockInstanceOptions {\\n\\n contract_balance: Some(contract_balance),\\n\\n ..Default::default()\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 29,\n \"score\": 196637.60320239305\n },\n {\n \"content\": \"pub fn remove_schemas(schemas_dir: &path::Path) -> Result<(), io::Error> {\\n\\n let file_paths = fs::read_dir(schemas_dir)?\\n\\n .filter_map(Result::ok) // skip read errors on entries\\n\\n .map(|entry| entry.path())\\n\\n .filter(|path| is_regular_file(path).unwrap_or(false)) // skip directories and symlinks\\n\\n .filter(|path| !is_hidden(path)) // skip hidden\\n\\n .filter(|path| is_json(path)) // skip non JSON\\n\\n ;\\n\\n\\n\\n for file_path in file_paths {\\n\\n println!(\\\"Removing {:?} …\\\", file_path);\\n\\n fs::remove_file(file_path)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::ffi::OsStr;\\n\",\n \"file_path\": \"packages/schema/src/remove.rs\",\n \"rank\": 30,\n \"score\": 195406.32140714923\n },\n {\n \"content\": \"/// A drop-in replacement for cosmwasm_std::testing::mock_dependencies\\n\\n/// this uses our CustomQuerier.\\n\\npub fn mock_dependencies_with_custom_querier(\\n\\n contract_balance: &[Coin],\\n\\n) -> OwnedDeps<MockStorage, MockApi, MockQuerier<SpecialQuery>> {\\n\\n let contract_addr = HumanAddr::from(MOCK_CONTRACT_ADDR);\\n\\n let custom_querier: MockQuerier<SpecialQuery> =\\n\\n MockQuerier::new(&[(&contract_addr, contract_balance)])\\n\\n .with_custom_handler(|query| SystemResult::Ok(custom_query_execute(&query)));\\n\\n OwnedDeps {\\n\\n storage: MockStorage::default(),\\n\\n api: MockApi::default(),\\n\\n querier: custom_querier,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/reflect/src/testing.rs\",\n \"rank\": 31,\n \"score\": 194120.56908684404\n },\n {\n \"content\": \"/// A drop-in replacement for cosmwasm_vm::testing::mock_dependencies\\n\\n/// that supports SpecialQuery.\\n\\npub fn mock_dependencies_with_custom_querier(\\n\\n contract_balance: &[Coin],\\n\\n) -> Backend<MockApi, MockStorage, MockQuerier<SpecialQuery>> {\\n\\n let contract_addr = HumanAddr::from(MOCK_CONTRACT_ADDR);\\n\\n let custom_querier: MockQuerier<SpecialQuery> =\\n\\n MockQuerier::new(&[(&contract_addr, contract_balance)])\\n\\n .with_custom_handler(|query| SystemResult::Ok(custom_query_execute(query)));\\n\\n\\n\\n Backend {\\n\\n api: MockApi::default(),\\n\\n storage: MockStorage::default(),\\n\\n querier: custom_querier,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/reflect/tests/integration.rs\",\n \"rank\": 32,\n \"score\": 194115.72406796776\n },\n {\n \"content\": \"pub fn mock_instance_with_balances(\\n\\n wasm: &[u8],\\n\\n balances: &[(&HumanAddr, &[Coin])],\\n\\n) -> Instance<MockApi, MockStorage, MockQuerier> {\\n\\n mock_instance_with_options(\\n\\n wasm,\\n\\n MockInstanceOptions {\\n\\n balances,\\n\\n ..Default::default()\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 33,\n \"score\": 194111.01151575308\n },\n {\n \"content\": \"/// Initializes the querier along with the mock_dependencies.\\n\\n/// Sets all balances provided (yoy must explicitly set contract balance if desired)\\n\\npub fn mock_backend_with_balances(\\n\\n balances: &[(&HumanAddr, &[Coin])],\\n\\n) -> Backend<MockApi, MockStorage, MockQuerier> {\\n\\n Backend {\\n\\n api: MockApi::default(),\\n\\n storage: MockStorage::default(),\\n\\n querier: MockQuerier::new(balances),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Zero-pads all human addresses to make them fit the canonical_length and\\n\\n/// trims off zeros for the reverse operation.\\n\\n/// This is not really smart, but allows us to see a difference (and consistent length for canonical adddresses).\\n\\n#[derive(Copy, Clone)]\\n\\npub struct MockApi {\\n\\n /// Length of canonical addresses created with this API. Contracts should not make any assumtions\\n\\n /// what this value is.\\n\\n pub canonical_length: usize,\\n\\n /// When set, all calls to the API fail with BackendError::Unknown containing this message\\n\\n backend_error: Option<&'static str>,\\n\",\n \"file_path\": \"packages/vm/src/testing/mock.rs\",\n \"rank\": 34,\n \"score\": 194111.0115157531\n },\n {\n \"content\": \"pub fn mock_instance_with_options(\\n\\n wasm: &[u8],\\n\\n options: MockInstanceOptions,\\n\\n) -> Instance<MockApi, MockStorage, MockQuerier> {\\n\\n check_wasm(wasm, &options.supported_features).unwrap();\\n\\n let contract_address = HumanAddr::from(MOCK_CONTRACT_ADDR);\\n\\n\\n\\n // merge balances\\n\\n let mut balances = options.balances.to_vec();\\n\\n if let Some(contract_balance) = options.contract_balance {\\n\\n // Remove old entry if exists\\n\\n if let Some(pos) = balances.iter().position(|item| *item.0 == contract_address) {\\n\\n balances.remove(pos);\\n\\n }\\n\\n balances.push((&contract_address, contract_balance));\\n\\n }\\n\\n\\n\\n let api = if let Some(backend_error) = options.backend_error {\\n\\n MockApi::new_failing(backend_error)\\n\\n } else {\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 35,\n \"score\": 194111.01151575308\n },\n {\n \"content\": \"pub fn mock_instance_with_failing_api(\\n\\n wasm: &[u8],\\n\\n contract_balance: &[Coin],\\n\\n backend_error: &'static str,\\n\\n) -> Instance<MockApi, MockStorage, MockQuerier> {\\n\\n mock_instance_with_options(\\n\\n wasm,\\n\\n MockInstanceOptions {\\n\\n contract_balance: Some(contract_balance),\\n\\n backend_error: Some(backend_error),\\n\\n ..Default::default()\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 36,\n \"score\": 191681.13781187386\n },\n {\n \"content\": \"pub fn mock_instance_with_gas_limit(\\n\\n wasm: &[u8],\\n\\n gas_limit: u64,\\n\\n) -> Instance<MockApi, MockStorage, MockQuerier> {\\n\\n mock_instance_with_options(\\n\\n wasm,\\n\\n MockInstanceOptions {\\n\\n gas_limit,\\n\\n ..Default::default()\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct MockInstanceOptions<'a> {\\n\\n // dependencies\\n\\n pub balances: &'a [(&'a HumanAddr, &'a [Coin])],\\n\\n /// This option is merged into balances and might override an existing value\\n\\n pub contract_balance: Option<&'a [Coin]>,\\n\\n /// When set, all calls to the API fail with BackendError::Unknown containing this message\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 37,\n \"score\": 191681.13781187386\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn entry_point(_attr: TokenStream, mut item: TokenStream) -> TokenStream {\\n\\n let cloned = item.clone();\\n\\n let function = parse_macro_input!(cloned as syn::ItemFn);\\n\\n let name = function.sig.ident.to_string();\\n\\n // The first argument is `deps`, the rest is region pointers\\n\\n let args = function.sig.inputs.len() - 1;\\n\\n\\n\\n // E.g. \\\"ptr0: u32, ptr1: u32, ptr2: u32, \\\"\\n\\n let typed_ptrs = (0..args).fold(String::new(), |acc, i| format!(\\\"{}ptr{}: u32, \\\", acc, i));\\n\\n // E.g. \\\"ptr0, ptr1, ptr2, \\\"\\n\\n let ptrs = (0..args).fold(String::new(), |acc, i| format!(\\\"{}ptr{}, \\\", acc, i));\\n\\n\\n\\n let new_code = format!(\\n\\n r##\\\"\\n\\n #[cfg(target_arch = \\\"wasm32\\\")]\\n\\n mod __wasm_export_{name} {{ // new module to avoid conflict of function name\\n\\n #[no_mangle]\\n\\n extern \\\"C\\\" fn {name}({typed_ptrs}) -> u32 {{\\n\\n cosmwasm_std::do_{name}(&super::{name}, {ptrs})\\n\\n }}\\n\",\n \"file_path\": \"packages/derive/src/lib.rs\",\n \"rank\": 38,\n \"score\": 191608.8122899543\n },\n {\n \"content\": \"/// reinvest will withdraw all pending rewards,\\n\\n/// then issue a callback to itself via _bond_all_tokens\\n\\n/// to reinvest the new earnings (and anything else that accumulated)\\n\\npub fn reinvest(deps: DepsMut, env: Env, _info: MessageInfo) -> StdResult<HandleResponse> {\\n\\n let contract_addr = env.contract.address;\\n\\n let invest = invest_info_read(deps.storage).load()?;\\n\\n let msg = to_binary(&HandleMsg::_BondAllTokens {})?;\\n\\n\\n\\n // and bond them to the validator\\n\\n let res = HandleResponse {\\n\\n messages: vec![\\n\\n StakingMsg::Withdraw {\\n\\n validator: invest.validator,\\n\\n recipient: Some(contract_addr.clone()),\\n\\n }\\n\\n .into(),\\n\\n WasmMsg::Execute {\\n\\n contract_addr,\\n\\n msg,\\n\\n send: vec![],\\n\\n }\\n\\n .into(),\\n\\n ],\\n\\n attributes: vec![],\\n\\n data: None,\\n\\n };\\n\\n Ok(res)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 39,\n \"score\": 191424.47618581256\n },\n {\n \"content\": \"pub fn bond(deps: DepsMut, env: Env, info: MessageInfo) -> StdResult<HandleResponse> {\\n\\n let sender_raw = deps.api.canonical_address(&info.sender)?;\\n\\n\\n\\n // ensure we have the proper denom\\n\\n let invest = invest_info_read(deps.storage).load()?;\\n\\n // payment finds the proper coin (or throws an error)\\n\\n let payment = info\\n\\n .sent_funds\\n\\n .iter()\\n\\n .find(|x| x.denom == invest.bond_denom)\\n\\n .ok_or_else(|| StdError::generic_err(format!(\\\"No {} tokens sent\\\", &invest.bond_denom)))?;\\n\\n\\n\\n // bonded is the total number of tokens we have delegated from this address\\n\\n let bonded = get_bonded(&deps.querier, &env.contract.address)?;\\n\\n\\n\\n // calculate to_mint and update total supply\\n\\n let mut totals = total_supply(deps.storage);\\n\\n let mut supply = totals.load()?;\\n\\n // TODO: this is just temporary check - we should use dynamic query or have a way to recover\\n\\n assert_bonds(&supply, bonded)?;\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 40,\n \"score\": 191419.7072864038\n },\n {\n \"content\": \"pub fn claim(deps: DepsMut, env: Env, info: MessageInfo) -> StdResult<HandleResponse> {\\n\\n // find how many tokens the contract has\\n\\n let invest = invest_info_read(deps.storage).load()?;\\n\\n let mut balance = deps\\n\\n .querier\\n\\n .query_balance(&env.contract.address, &invest.bond_denom)?;\\n\\n if balance.amount < invest.min_withdrawal {\\n\\n return Err(StdError::generic_err(\\n\\n \\\"Insufficient balance in contract to process claim\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n // check how much to send - min(balance, claims[sender]), and reduce the claim\\n\\n let sender_raw = deps.api.canonical_address(&info.sender)?;\\n\\n let mut to_send = balance.amount;\\n\\n claims(deps.storage).update(sender_raw.as_slice(), |claim| {\\n\\n let claim = claim.ok_or_else(|| StdError::generic_err(\\\"no claim for this address\\\"))?;\\n\\n to_send = to_send.min(claim);\\n\\n claim - to_send\\n\\n })?;\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 41,\n \"score\": 191419.70728640383\n },\n {\n \"content\": \"/// enforces ordering and versioing constraints\\n\\npub fn ibc_channel_open(_deps: DepsMut, _env: Env, channel: IbcChannel) -> StdResult<()> {\\n\\n if channel.order != IbcOrder::Ordered {\\n\\n return Err(StdError::generic_err(\\\"Only supports ordered channels\\\"));\\n\\n }\\n\\n if channel.version.as_str() != IBC_VERSION {\\n\\n return Err(StdError::generic_err(format!(\\n\\n \\\"Must set version to `{}`\\\",\\n\\n IBC_VERSION\\n\\n )));\\n\\n }\\n\\n // TODO: do we need to check counterparty version as well?\\n\\n // This flow needs to be well documented\\n\\n if let Some(counter_version) = channel.counterparty_version {\\n\\n if counter_version.as_str() != IBC_VERSION {\\n\\n return Err(StdError::generic_err(format!(\\n\\n \\\"Counterparty version must be `{}`\\\",\\n\\n IBC_VERSION\\n\\n )));\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[entry_point]\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/contract.rs\",\n \"rank\": 42,\n \"score\": 190912.13064754586\n },\n {\n \"content\": \"/// Returns a default enviroment with height, time, chain_id, and contract address\\n\\n/// You can submit as is to most contracts, or modify height/time if you want to\\n\\n/// test for expiration.\\n\\n///\\n\\n/// This is intended for use in test code only.\\n\\npub fn mock_env() -> Env {\\n\\n Env {\\n\\n block: BlockInfo {\\n\\n height: 12_345,\\n\\n time: 1_571_797_419,\\n\\n time_nanos: 879305533,\\n\\n chain_id: \\\"cosmos-testnet-14002\\\".to_string(),\\n\\n },\\n\\n contract: ContractInfo {\\n\\n address: HumanAddr::from(MOCK_CONTRACT_ADDR),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/mock.rs\",\n \"rank\": 43,\n \"score\": 190592.93060549724\n },\n {\n \"content\": \"/// Implementation for check_wasm, based on static analysis of the bytecode.\\n\\n/// This is used for code upload, to perform check before compiling the Wasm.\\n\\npub fn required_features_from_module(module: &Module) -> HashSet<String> {\\n\\n match module.export_section() {\\n\\n None => HashSet::new(),\\n\\n Some(export_section) => export_section\\n\\n .entries()\\n\\n .iter()\\n\\n .filter_map(|entry| {\\n\\n if let Internal::Function(_) = entry.internal() {\\n\\n let name = entry.field();\\n\\n if name.starts_with(REQUIRES_PREFIX) && name.len() > REQUIRES_PREFIX.len() {\\n\\n let (_, required_feature) = name.split_at(REQUIRES_PREFIX.len());\\n\\n return Some(required_feature.to_string());\\n\\n }\\n\\n }\\n\\n None\\n\\n })\\n\\n .collect(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/features.rs\",\n \"rank\": 44,\n \"score\": 189918.48482454862\n },\n {\n \"content\": \"// use this if you want to override the auto-detected name of the object.\\n\\n// very useful when creating an alias for a type-alias.\\n\\npub fn export_schema_with_title(schema: &mut RootSchema, out_dir: &PathBuf, title: &str) {\\n\\n // set the title explicitly on the schemas metadata\\n\\n let metadata = &mut schema.schema.metadata;\\n\\n if let Some(data) = metadata {\\n\\n data.title = Some(title.to_string());\\n\\n }\\n\\n write_schema(schema, out_dir, &title);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/schema/src/export.rs\",\n \"rank\": 45,\n \"score\": 186553.55358821095\n },\n {\n \"content\": \"pub fn required_features_from_wasmer_instance(wasmer_instance: &WasmerInstance) -> HashSet<String> {\\n\\n let module = wasmer_instance.module();\\n\\n module\\n\\n .exports()\\n\\n .filter_map(|export| {\\n\\n if let ExternType::Function { .. } = export.ty() {\\n\\n let name = export.name();\\n\\n if name.starts_with(REQUIRES_PREFIX) && name.len() > REQUIRES_PREFIX.len() {\\n\\n let required_feature = name.to_string().split_off(REQUIRES_PREFIX.len());\\n\\n return Some(required_feature);\\n\\n }\\n\\n }\\n\\n None\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/features.rs\",\n \"rank\": 46,\n \"score\": 184601.18400248466\n },\n {\n \"content\": \"/// An alias of PrefixedStorage::new for less verbose usage\\n\\npub fn prefixed<'a>(storage: &'a mut dyn Storage, namespace: &[u8]) -> PrefixedStorage<'a> {\\n\\n PrefixedStorage::new(storage, namespace)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/storage/src/prefixed_storage.rs\",\n \"rank\": 47,\n \"score\": 182241.69483824787\n },\n {\n \"content\": \"/// Sequence creates a custom Singleton to hold an empty sequence\\n\\npub fn sequence<'a>(storage: &'a mut dyn Storage, key: &[u8]) -> Singleton<'a, u64> {\\n\\n Singleton::new(storage, key)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/storage/src/sequence.rs\",\n \"rank\": 48,\n \"score\": 181920.84409968898\n },\n {\n \"content\": \"// query mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and msg rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn query<A, S, Q, M>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n msg: M,\\n\\n) -> ContractResult<QueryResponse>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n M: Serialize + JsonSchema,\\n\\n{\\n\\n let serialized_msg = to_vec(&msg).expect(\\\"Testing error: Could not seralize request message\\\");\\n\\n call_query(instance, &env, &serialized_msg).expect(\\\"VM error\\\")\\n\\n}\\n\",\n \"file_path\": \"packages/vm/src/testing/calls.rs\",\n \"rank\": 49,\n \"score\": 179504.69039037856\n },\n {\n \"content\": \"/// An alias of Singleton::new for less verbose usage\\n\\npub fn singleton<'a, T>(storage: &'a mut dyn Storage, key: &[u8]) -> Singleton<'a, T>\\n\\nwhere\\n\\n T: Serialize + DeserializeOwned,\\n\\n{\\n\\n Singleton::new(storage, key)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/storage/src/singleton.rs\",\n \"rank\": 50,\n \"score\": 177707.62620416176\n },\n {\n \"content\": \"/// An alias of Bucket::new for less verbose usage\\n\\npub fn bucket<'a, T>(storage: &'a mut dyn Storage, namespace: &[u8]) -> Bucket<'a, T>\\n\\nwhere\\n\\n T: Serialize + DeserializeOwned,\\n\\n{\\n\\n Bucket::new(storage, namespace)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/storage/src/bucket.rs\",\n \"rank\": 51,\n \"score\": 177707.62620416176\n },\n {\n \"content\": \"// ibc_channel_open mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and channel rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn ibc_channel_open<A, S, Q>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n channel: IbcChannel,\\n\\n) -> ContractResult<()>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n{\\n\\n call_ibc_channel_open(instance, &env, &channel).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/ibc_calls.rs\",\n \"rank\": 52,\n \"score\": 177521.87924987107\n },\n {\n \"content\": \"/// Creates InstanceOptions for testing\\n\\npub fn mock_instance_options() -> (InstanceOptions, Option<Size>) {\\n\\n (\\n\\n InstanceOptions {\\n\\n gas_limit: DEFAULT_GAS_LIMIT,\\n\\n print_debug: DEFAULT_PRINT_DEBUG,\\n\\n },\\n\\n DEFAULT_MEMORY_LIMIT,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/instance.rs\",\n \"rank\": 53,\n \"score\": 175346.87422588991\n },\n {\n \"content\": \"// init mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and msg rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn init<A, S, Q, M, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n info: MessageInfo,\\n\\n msg: M,\\n\\n) -> ContractResult<InitResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n M: Serialize + JsonSchema,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n let serialized_msg = to_vec(&msg).expect(\\\"Testing error: Could not seralize request message\\\");\\n\\n call_init(instance, &env, &info, &serialized_msg).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/calls.rs\",\n \"rank\": 54,\n \"score\": 174779.97350197696\n },\n {\n \"content\": \"// migrate mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and msg rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn migrate<A, S, Q, M, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n info: MessageInfo,\\n\\n msg: M,\\n\\n) -> ContractResult<MigrateResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n M: Serialize + JsonSchema,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n let serialized_msg = to_vec(&msg).expect(\\\"Testing error: Could not seralize request message\\\");\\n\\n call_migrate(instance, &env, &info, &serialized_msg).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/calls.rs\",\n \"rank\": 55,\n \"score\": 174779.97350197696\n },\n {\n \"content\": \"// handle mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and msg rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn handle<A, S, Q, M, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n info: MessageInfo,\\n\\n msg: M,\\n\\n) -> ContractResult<HandleResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n M: Serialize + JsonSchema,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n let serialized_msg = to_vec(&msg).expect(\\\"Testing error: Could not seralize request message\\\");\\n\\n call_handle(instance, &env, &info, &serialized_msg).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/calls.rs\",\n \"rank\": 56,\n \"score\": 174779.97350197696\n },\n {\n \"content\": \"fn do_storage_loop(deps: DepsMut) -> Result<HandleResponse, HackError> {\\n\\n let mut test_case = 0u64;\\n\\n loop {\\n\\n deps.storage\\n\\n .set(b\\\"test.key\\\", test_case.to_string().as_bytes());\\n\\n test_case += 1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/src/contract.rs\",\n \"rank\": 57,\n \"score\": 174204.81117496284\n },\n {\n \"content\": \"pub fn query_investment(deps: Deps) -> StdResult<InvestmentResponse> {\\n\\n let invest = invest_info_read(deps.storage).load()?;\\n\\n let supply = total_supply_read(deps.storage).load()?;\\n\\n\\n\\n let res = InvestmentResponse {\\n\\n owner: deps.api.human_address(&invest.owner)?,\\n\\n exit_tax: invest.exit_tax,\\n\\n validator: invest.validator,\\n\\n min_withdrawal: invest.min_withdrawal,\\n\\n token_supply: supply.issued,\\n\\n staked_tokens: coin(supply.bonded.u128(), &invest.bond_denom),\\n\\n nominal_value: if supply.issued.is_zero() {\\n\\n FALLBACK_RATIO\\n\\n } else {\\n\\n Decimal::from_ratio(supply.bonded, supply.issued)\\n\\n },\\n\\n };\\n\\n Ok(res)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 58,\n \"score\": 172885.15058219616\n },\n {\n \"content\": \"// ibc_packet_timeout mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and packet rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn ibc_packet_timeout<A, S, Q, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n packet: IbcPacket,\\n\\n) -> ContractResult<IbcBasicResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n call_ibc_packet_timeout(instance, &env, &packet).expect(\\\"VM error\\\")\\n\\n}\\n\",\n \"file_path\": \"packages/vm/src/testing/ibc_calls.rs\",\n \"rank\": 59,\n \"score\": 172738.0706536814\n },\n {\n \"content\": \"// ibc_packet_receive mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and packet rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn ibc_packet_receive<A, S, Q, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n packet: IbcPacket,\\n\\n) -> ContractResult<IbcReceiveResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n call_ibc_packet_receive(instance, &env, &packet).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/ibc_calls.rs\",\n \"rank\": 60,\n \"score\": 172738.0706536814\n },\n {\n \"content\": \"// ibc_channel_connect mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and channel rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn ibc_channel_connect<A, S, Q, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n channel: IbcChannel,\\n\\n) -> ContractResult<IbcBasicResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n call_ibc_channel_connect(instance, &env, &channel).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/ibc_calls.rs\",\n \"rank\": 61,\n \"score\": 172738.0706536814\n },\n {\n \"content\": \"// ibc_channel_close mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and channel rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn ibc_channel_close<A, S, Q, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n channel: IbcChannel,\\n\\n) -> ContractResult<IbcBasicResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n call_ibc_channel_close(instance, &env, &channel).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/ibc_calls.rs\",\n \"rank\": 62,\n \"score\": 172738.0706536814\n },\n {\n \"content\": \"// ibc_packet_ack mimicks the call signature of the smart contracts.\\n\\n// thus it moves env and acknowledgement rather than take them as reference.\\n\\n// this is inefficient here, but only used in test code\\n\\npub fn ibc_packet_ack<A, S, Q, U>(\\n\\n instance: &mut Instance<A, S, Q>,\\n\\n env: Env,\\n\\n ack: IbcAcknowledgement,\\n\\n) -> ContractResult<IbcBasicResponse<U>>\\n\\nwhere\\n\\n A: Api + 'static,\\n\\n S: Storage + 'static,\\n\\n Q: Querier + 'static,\\n\\n U: DeserializeOwned + Clone + PartialEq + JsonSchema + fmt::Debug,\\n\\n{\\n\\n call_ibc_packet_ack(instance, &env, &ack).expect(\\\"VM error\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/ibc_calls.rs\",\n \"rank\": 63,\n \"score\": 172738.0706536814\n },\n {\n \"content\": \"/// currval returns the last value returned by nextval. If the sequence has never been used,\\n\\n/// then it will return 0.\\n\\npub fn currval(seq: &Singleton<u64>) -> StdResult<u64> {\\n\\n Ok(seq.may_load()?.unwrap_or_default())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/storage/src/sequence.rs\",\n \"rank\": 64,\n \"score\": 172677.5765647717\n },\n {\n \"content\": \"pub fn to_binary<T>(data: &T) -> StdResult<Binary>\\n\\nwhere\\n\\n T: Serialize + ?Sized,\\n\\n{\\n\\n to_vec(data).map(Binary)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use serde::Deserialize;\\n\\n\\n\\n #[derive(Serialize, Deserialize, Debug, PartialEq)]\\n\\n #[serde(rename_all = \\\"snake_case\\\")]\\n\\n enum SomeMsg {\\n\\n Refund {},\\n\\n ReleaseAll {\\n\\n image: String,\\n\\n amount: u32,\\n\\n time: u64,\\n\",\n \"file_path\": \"packages/std/src/serde.rs\",\n \"rank\": 65,\n \"score\": 172672.761273735\n },\n {\n \"content\": \"fn enqueue(storage: &mut dyn Storage, value: i32) -> StdResult<()> {\\n\\n // find the last element in the queue and extract key\\n\\n let last_item = storage.range(None, None, Order::Descending).next();\\n\\n\\n\\n let new_key = match last_item {\\n\\n None => FIRST_KEY,\\n\\n Some((key, _)) => {\\n\\n key[0] + 1 // all keys are one byte\\n\\n }\\n\\n };\\n\\n let new_value = to_vec(&Item { value })?;\\n\\n\\n\\n storage.set(&[new_key], &new_value);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/queue/src/contract.rs\",\n \"rank\": 66,\n \"score\": 171353.0833499421\n },\n {\n \"content\": \"pub fn balances_read(storage: &dyn Storage) -> ReadonlyBucket<Uint128> {\\n\\n bucket_read(storage, PREFIX_BALANCE)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 67,\n \"score\": 170921.40229375986\n },\n {\n \"content\": \"pub fn claims_read(storage: &dyn Storage) -> ReadonlyBucket<Uint128> {\\n\\n bucket_read(storage, PREFIX_CLAIMS)\\n\\n}\\n\\n\\n\\n/// Investment info is fixed at initialization, and is used to control the function of the contract\\n\\n#[derive(Serialize, Deserialize, Clone, Debug, PartialEq, JsonSchema)]\\n\\npub struct InvestmentInfo {\\n\\n /// owner created the contract and takes a cut\\n\\n pub owner: CanonicalAddr,\\n\\n /// this is the denomination we can stake (and only one we accept for payments)\\n\\n pub bond_denom: String,\\n\\n /// this is how much the owner takes as a cut when someone unbonds\\n\\n pub exit_tax: Decimal,\\n\\n /// All tokens are bonded to this validator\\n\\n /// FIXME: humanize/canonicalize address doesn't work for validator addrresses\\n\\n pub validator: HumanAddr,\\n\\n /// This is the minimum amount we will pull out to reinvest, as well as a minumum\\n\\n /// that can be unbonded (to avoid needless staking tx)\\n\\n pub min_withdrawal: Uint128,\\n\\n}\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 68,\n \"score\": 170921.40229375986\n },\n {\n \"content\": \"/// Reads in a Region at ptr in wasm memory and returns a copy of it\\n\\nfn get_region(memory: &wasmer::Memory, ptr: u32) -> CommunicationResult<Region> {\\n\\n let wptr = WasmPtr::<Region>::new(ptr);\\n\\n match wptr.deref(memory) {\\n\\n Some(cell) => {\\n\\n let region = cell.get();\\n\\n validate_region(®ion)?;\\n\\n Ok(region)\\n\\n }\\n\\n None => Err(CommunicationError::deref_err(\\n\\n ptr,\\n\\n \\\"Could not dereference this pointer to a Region\\\",\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/memory.rs\",\n \"rank\": 69,\n \"score\": 169587.54733647735\n },\n {\n \"content\": \"pub fn config_read(storage: &dyn Storage) -> ReadonlySingleton<Config> {\\n\\n singleton_read(storage, KEY_CONFIG)\\n\\n}\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/state.rs\",\n \"rank\": 70,\n \"score\": 168817.4631626747\n },\n {\n \"content\": \"pub fn total_supply_read(storage: &dyn Storage) -> ReadonlySingleton<Supply> {\\n\\n singleton_read(storage, KEY_TOTAL_SUPPLY)\\n\\n}\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 71,\n \"score\": 168817.4631626747\n },\n {\n \"content\": \"pub fn query_token_info(deps: Deps) -> StdResult<TokenInfoResponse> {\\n\\n token_info_read(deps.storage).load()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 72,\n \"score\": 168765.53271792486\n },\n {\n \"content\": \"pub fn from_slice<'a, T>(value: &'a [u8]) -> VmResult<T>\\n\\nwhere\\n\\n T: Deserialize<'a>,\\n\\n{\\n\\n serde_json::from_slice(value).map_err(|e| VmError::parse_err(type_name::<T>(), e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/serde.rs\",\n \"rank\": 73,\n \"score\": 168472.3648680687\n },\n {\n \"content\": \"pub fn to_vec<T>(data: &T) -> StdResult<Vec<u8>>\\n\\nwhere\\n\\n T: Serialize + ?Sized,\\n\\n{\\n\\n serde_json_wasm::to_vec(data).map_err(|e| StdError::serialize_err(type_name::<T>(), e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/std/src/serde.rs\",\n \"rank\": 74,\n \"score\": 168311.4658133577\n },\n {\n \"content\": \"pub fn to_vec<T>(data: &T) -> VmResult<Vec<u8>>\\n\\nwhere\\n\\n T: Serialize + ?Sized,\\n\\n{\\n\\n serde_json::to_vec(data).map_err(|e| VmError::serialize_err(type_name::<T>(), e))\\n\\n}\\n\",\n \"file_path\": \"packages/vm/src/serde.rs\",\n \"rank\": 75,\n \"score\": 168311.4658133577\n },\n {\n \"content\": \"pub fn query_list_accounts(deps: Deps) -> StdResult<ListAccountsResponse> {\\n\\n let accounts: StdResult<Vec<_>> = accounts_read(deps.storage)\\n\\n .range(None, None, Order::Ascending)\\n\\n .map(|r| {\\n\\n let (k, account) = r?;\\n\\n Ok(AccountInfo {\\n\\n account,\\n\\n channel_id: String::from_utf8(k)?,\\n\\n })\\n\\n })\\n\\n .collect();\\n\\n Ok(ListAccountsResponse {\\n\\n accounts: accounts?,\\n\\n })\\n\\n}\\n\\n\\n\\n#[entry_point]\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/contract.rs\",\n \"rank\": 76,\n \"score\": 166811.81460331922\n },\n {\n \"content\": \"pub fn invest_info_read(storage: &dyn Storage) -> ReadonlySingleton<InvestmentInfo> {\\n\\n singleton_read(storage, KEY_INVESTMENT)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 77,\n \"score\": 166787.0284855591\n },\n {\n \"content\": \"pub fn accounts_read(storage: &dyn Storage) -> ReadonlyBucket<HumanAddr> {\\n\\n bucket_read(storage, PREFIX_ACCOUNTS)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/state.rs\",\n \"rank\": 78,\n \"score\": 166787.0284855591\n },\n {\n \"content\": \"pub fn from_slice<T: DeserializeOwned>(value: &[u8]) -> StdResult<T> {\\n\\n serde_json_wasm::from_slice(value).map_err(|e| StdError::parse_err(type_name::<T>(), e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/std/src/serde.rs\",\n \"rank\": 79,\n \"score\": 166215.03582616945\n },\n {\n \"content\": \"pub fn from_binary<T: DeserializeOwned>(value: &Binary) -> StdResult<T> {\\n\\n from_slice(value.as_slice())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/std/src/serde.rs\",\n \"rank\": 80,\n \"score\": 166215.03582616945\n },\n {\n \"content\": \"/// Overrides a Region at ptr in wasm memory with data\\n\\nfn set_region(memory: &wasmer::Memory, ptr: u32, data: Region) -> CommunicationResult<()> {\\n\\n let wptr = WasmPtr::<Region>::new(ptr);\\n\\n\\n\\n match wptr.deref(memory) {\\n\\n Some(cell) => {\\n\\n cell.set(data);\\n\\n Ok(())\\n\\n }\\n\\n None => Err(CommunicationError::deref_err(\\n\\n ptr,\\n\\n \\\"Could not dereference this pointer to a Region\\\",\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"packages/vm/src/memory.rs\",\n \"rank\": 81,\n \"score\": 165435.01534682844\n },\n {\n \"content\": \"fn cost(_operator: &Operator) -> u64 {\\n\\n // A flat fee in order to maintain roughly the same pricing as with Wasmer 0.17\\n\\n // (https://github.com/wasmerio/wasmer/blob/0.17.1/lib/middleware-common/src/metering.rs#L43-L113).\\n\\n // This should become more advanced soon: https://github.com/CosmWasm/cosmwasm/issues/670\\n\\n 1\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/wasm_backend/store.rs\",\n \"rank\": 82,\n \"score\": 165396.24235340892\n },\n {\n \"content\": \"fn get_count(deps: &mut Instance<MockApi, MockStorage, MockQuerier>) -> u32 {\\n\\n let data = query(deps, mock_env(), QueryMsg::Count {}).unwrap();\\n\\n let res: CountResponse = from_binary(&data).unwrap();\\n\\n res.count\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/queue/tests/integration.rs\",\n \"rank\": 83,\n \"score\": 165095.93282606013\n },\n {\n \"content\": \"fn get_sum(deps: &mut Instance<MockApi, MockStorage, MockQuerier>) -> i32 {\\n\\n let data = query(deps, mock_env(), QueryMsg::Sum {}).unwrap();\\n\\n let res: SumResponse = from_binary(&data).unwrap();\\n\\n res.sum\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/queue/tests/integration.rs\",\n \"rank\": 84,\n \"score\": 165095.93282606013\n },\n {\n \"content\": \"pub fn token_info_read(storage: &dyn Storage) -> ReadonlySingleton<TokenInfoResponse> {\\n\\n singleton_read(storage, KEY_TOKEN_INFO)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/state.rs\",\n \"rank\": 85,\n \"score\": 164826.31240271882\n },\n {\n \"content\": \"fn make_init_msg() -> (InitMsg, HumanAddr) {\\n\\n let verifier = HumanAddr::from(\\\"verifies\\\");\\n\\n let beneficiary = HumanAddr::from(\\\"benefits\\\");\\n\\n let creator = HumanAddr::from(\\\"creator\\\");\\n\\n (\\n\\n InitMsg {\\n\\n verifier: verifier.clone(),\\n\\n beneficiary: beneficiary.clone(),\\n\\n },\\n\\n creator,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/tests/integration.rs\",\n \"rank\": 86,\n \"score\": 163846.4635294639\n },\n {\n \"content\": \"fn check_wasm_memories(module: &Module) -> VmResult<()> {\\n\\n let section = match module.memory_section() {\\n\\n Some(section) => section,\\n\\n None => {\\n\\n return Err(VmError::static_validation_err(\\n\\n \\\"Wasm contract doesn't have a memory section\\\",\\n\\n ));\\n\\n }\\n\\n };\\n\\n\\n\\n let memories = section.entries();\\n\\n if memories.len() != 1 {\\n\\n return Err(VmError::static_validation_err(\\n\\n \\\"Wasm contract must contain exactly one memory\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n let memory = memories[0];\\n\\n // println!(\\\"Memory: {:?}\\\", memory);\\n\\n let limits = memory.limits();\\n\",\n \"file_path\": \"packages/vm/src/compatibility.rs\",\n \"rank\": 87,\n \"score\": 162565.8881448442\n },\n {\n \"content\": \"fn check_wasm_exports(module: &Module) -> VmResult<()> {\\n\\n let available_exports: Vec<String> = module.export_section().map_or(vec![], |export_section| {\\n\\n export_section\\n\\n .entries()\\n\\n .iter()\\n\\n .map(|entry| entry.field().to_string())\\n\\n .collect()\\n\\n });\\n\\n\\n\\n for required_export in REQUIRED_EXPORTS {\\n\\n if !available_exports.iter().any(|x| x == required_export) {\\n\\n return Err(VmError::static_validation_err(format!(\\n\\n \\\"Wasm contract doesn't have required export: \\\\\\\"{}\\\\\\\". Exports required by VM: {:?}. Contract version too old for this VM?\\\",\\n\\n required_export, REQUIRED_EXPORTS\\n\\n )));\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/compatibility.rs\",\n \"rank\": 88,\n \"score\": 162565.8881448442\n },\n {\n \"content\": \"pub fn query_claims(deps: Deps, address: HumanAddr) -> StdResult<ClaimsResponse> {\\n\\n let address_raw = deps.api.canonical_address(&address)?;\\n\\n let claims = claims_read(deps.storage)\\n\\n .may_load(address_raw.as_slice())?\\n\\n .unwrap_or_default();\\n\\n Ok(ClaimsResponse { claims })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 89,\n \"score\": 162238.12983448076\n },\n {\n \"content\": \"pub fn query_balance(deps: Deps, address: HumanAddr) -> StdResult<BalanceResponse> {\\n\\n let address_raw = deps.api.canonical_address(&address)?;\\n\\n let balance = balances_read(deps.storage)\\n\\n .may_load(address_raw.as_slice())?\\n\\n .unwrap_or_default();\\n\\n Ok(BalanceResponse { balance })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/staking/src/contract.rs\",\n \"rank\": 90,\n \"score\": 162238.12983448076\n },\n {\n \"content\": \"#[test]\\n\\nfn ibc_entry_points_are_detected() {\\n\\n let deps = mock_instance(WASM, &[]);\\n\\n assert_eq!(deps.has_ibc_entry_points(), true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/tests/integration.rs\",\n \"rank\": 91,\n \"score\": 161317.68835296083\n },\n {\n \"content\": \"/// Checks if the data is valid wasm and compatibility with the CosmWasm API (imports and exports)\\n\\npub fn check_wasm(wasm_code: &[u8], supported_features: &HashSet<String>) -> VmResult<()> {\\n\\n let module = deserialize(wasm_code)?;\\n\\n check_wasm_memories(&module)?;\\n\\n check_wasm_exports(&module)?;\\n\\n check_wasm_imports(&module, SUPPORTED_IMPORTS)?;\\n\\n check_wasm_features(&module, supported_features)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/compatibility.rs\",\n \"rank\": 92,\n \"score\": 160350.36382270342\n },\n {\n \"content\": \"pub fn query_account(deps: Deps, channel_id: String) -> StdResult<AccountResponse> {\\n\\n let account = accounts_read(deps.storage).load(channel_id.as_bytes())?;\\n\\n Ok(AccountResponse {\\n\\n account: Some(account),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/ibc-reflect/src/contract.rs\",\n \"rank\": 93,\n \"score\": 160350.36382270342\n },\n {\n \"content\": \"/// All external requirements that can be injected for unit tests.\\n\\n/// It sets the given balance for the contract itself, nothing else\\n\\npub fn mock_backend(contract_balance: &[Coin]) -> Backend<MockApi, MockStorage, MockQuerier> {\\n\\n let contract_addr = HumanAddr::from(MOCK_CONTRACT_ADDR);\\n\\n Backend {\\n\\n api: MockApi::default(),\\n\\n storage: MockStorage::default(),\\n\\n querier: MockQuerier::new(&[(&contract_addr, contract_balance)]),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/vm/src/testing/mock.rs\",\n \"rank\": 94,\n \"score\": 158386.74442027486\n },\n {\n \"content\": \"fn do_release(deps: DepsMut, env: Env, info: MessageInfo) -> Result<HandleResponse, HackError> {\\n\\n let data = deps\\n\\n .storage\\n\\n .get(CONFIG_KEY)\\n\\n .ok_or_else(|| StdError::not_found(\\\"State\\\"))?;\\n\\n let state: State = from_slice(&data)?;\\n\\n\\n\\n if deps.api.canonical_address(&info.sender)? == state.verifier {\\n\\n let to_addr = deps.api.human_address(&state.beneficiary)?;\\n\\n let balance = deps.querier.query_all_balances(&env.contract.address)?;\\n\\n\\n\\n let mut ctx = Context::new();\\n\\n ctx.add_attribute(\\\"action\\\", \\\"release\\\");\\n\\n ctx.add_attribute(\\\"destination\\\", &to_addr);\\n\\n ctx.add_message(BankMsg::Send {\\n\\n to_address: to_addr,\\n\\n amount: balance,\\n\\n });\\n\\n ctx.set_data(&[0xF0, 0x0B, 0xAA]);\\n\\n Ok(ctx.into())\\n\\n } else {\\n\\n Err(HackError::Unauthorized {})\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/src/contract.rs\",\n \"rank\": 95,\n \"score\": 157604.9392705633\n },\n {\n \"content\": \"pub fn migrate(\\n\\n deps: DepsMut,\\n\\n _env: Env,\\n\\n _info: MessageInfo,\\n\\n msg: MigrateMsg,\\n\\n) -> Result<MigrateResponse, HackError> {\\n\\n let data = deps\\n\\n .storage\\n\\n .get(CONFIG_KEY)\\n\\n .ok_or_else(|| StdError::not_found(\\\"State\\\"))?;\\n\\n let mut config: State = from_slice(&data)?;\\n\\n config.verifier = deps.api.canonical_address(&msg.verifier)?;\\n\\n deps.storage.set(CONFIG_KEY, &to_vec(&config)?);\\n\\n\\n\\n Ok(MigrateResponse::default())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/src/contract.rs\",\n \"rank\": 96,\n \"score\": 156682.74940229772\n },\n {\n \"content\": \"#[entry_point]\\n\\npub fn init(\\n\\n _deps: DepsMut,\\n\\n _env: Env,\\n\\n _info: MessageInfo,\\n\\n _msg: InitMsg,\\n\\n) -> StdResult<InitResponse> {\\n\\n Err(StdError::generic_err(\\n\\n \\\"You can only use this contract for migrations\\\",\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/burner/src/contract.rs\",\n \"rank\": 97,\n \"score\": 156682.74940229772\n },\n {\n \"content\": \"pub fn handle(\\n\\n deps: DepsMut,\\n\\n env: Env,\\n\\n info: MessageInfo,\\n\\n msg: HandleMsg,\\n\\n) -> Result<HandleResponse, HackError> {\\n\\n match msg {\\n\\n HandleMsg::Release {} => do_release(deps, env, info),\\n\\n HandleMsg::CpuLoop {} => do_cpu_loop(),\\n\\n HandleMsg::StorageLoop {} => do_storage_loop(deps),\\n\\n HandleMsg::MemoryLoop {} => do_memory_loop(),\\n\\n HandleMsg::AllocateLargeMemory { pages } => do_allocate_large_memory(pages),\\n\\n HandleMsg::Panic {} => do_panic(),\\n\\n HandleMsg::UserErrorsInApiCalls {} => do_user_errors_in_api_calls(deps.api),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/src/contract.rs\",\n \"rank\": 98,\n \"score\": 156682.74940229772\n },\n {\n \"content\": \"pub fn init(\\n\\n deps: DepsMut,\\n\\n _env: Env,\\n\\n info: MessageInfo,\\n\\n msg: InitMsg,\\n\\n) -> Result<InitResponse, HackError> {\\n\\n deps.api.debug(\\\"here we go 🚀\\\");\\n\\n\\n\\n deps.storage.set(\\n\\n CONFIG_KEY,\\n\\n &to_vec(&State {\\n\\n verifier: deps.api.canonical_address(&msg.verifier)?,\\n\\n beneficiary: deps.api.canonical_address(&msg.beneficiary)?,\\n\\n funder: deps.api.canonical_address(&info.sender)?,\\n\\n })?,\\n\\n );\\n\\n\\n\\n // This adds some unrelated event attribute for testing purposes\\n\\n let mut ctx = Context::new();\\n\\n ctx.add_attribute(\\\"Let the\\\", \\\"hacking begin\\\");\\n\\n Ok(ctx.try_into()?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"contracts/hackatom/src/contract.rs\",\n \"rank\": 99,\n \"score\": 156682.74940229772\n }\n]","isConversational":false}}},{"rowIdx":1976,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"strum_macros/src/macros/enum_iter.rs"},"repo_name":{"kind":"string","value":"orenbenkiki/strum"},"commit":{"kind":"string","value":"d5f660a3737ca0db3a5d8384a772e2b92e4ec0ed"},"file_code":{"kind":"string","value":"use proc_macro2::{Span, TokenStream};\nuse quote::quote;\nuse syn::{Data, DeriveInput, Fields, Ident};\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\npub fn enum_iter_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n let name = &ast.ident;\n let gen = &ast.generics;\n let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();\n let vis = &ast.vis;\n let type_properties = ast.get_type_properties()?;\n let strum_module_path = type_properties.crate_module_path();\n\n if gen.lifetimes().count() > 0 {\n return Err(syn::Error::new(\n Span::call_site(),\n \"This macro doesn't support enums with lifetimes. \\\n The resulting enums would be unbounded.\",\n ));\n }\n\n let phantom_data = if gen.type_params().count() > 0 {\n let g = gen.type_params().map(|param| ¶m.ident);\n quote! { < ( #(#g),* ) > }\n } else {\n quote! { < () > }\n };\n\n let variants = match &ast.data {\n Data::Enum(v) => &v.variants,\n _ => return Err(non_enum_error()),\n };\n\n let mut arms = Vec::new();\n let mut idx = 0usize;\n for variant in variants {\n if variant.get_variant_properties()?.disabled.is_some() {\n continue;\n }\n\n let ident = &variant.ident;\n let params = match &variant.fields {\n Fields::Unit => quote! {},\n Fields::Unnamed(fields) => {\n let defaults = ::core::iter::repeat(quote!(::core::default::Default::default()))\n .take(fields.unnamed.len());\n quote! { (#(#defaults),*) }\n }\n Fields::Named(fields) => {\n let fields = fields\n .named\n .iter()\n .map(|field| field.ident.as_ref().unwrap());\n quote! { {#(#fields: ::core::default::Default::default()),*} }\n }\n };\n\n arms.push(quote! {#idx => ::core::option::Option::Some(#name::#ident #params)});\n idx += 1;\n }\n\n let variant_count = arms.len();\n arms.push(quote! { _ => ::core::option::Option::None });\n let iter_name = syn::parse_str::<Ident>(&format!(\"{}Iter\", name)).unwrap();\n\n Ok(quote! {\n #[doc = \"An iterator over the variants of [Self]\"]\n #vis struct #iter_name #ty_generics {\n idx: usize,\n back_idx: usize,\n marker: ::core::marker::PhantomData #phantom_data,\n }\n\n impl #impl_generics #iter_name #ty_generics #where_clause {\n fn get(&self, idx: usize) -> Option<#name #ty_generics> {\n match idx {\n #(#arms),*\n }\n }\n }\n\n impl #impl_generics #strum_module_path::IntoEnumIterator for #name #ty_generics #where_clause {\n type Iterator = #iter_name #ty_generics;\n fn iter() -> #iter_name #ty_generics {\n #iter_name {\n idx: 0,\n back_idx: 0,\n marker: ::core::marker::PhantomData,\n }\n }\n }\n\n impl #impl_generics Iterator for #iter_name #ty_generics #where_clause {\n type Item = #name #ty_generics;\n\n fn next(&mut self) -> Option<<Self as Iterator>::Item> {\n self.nth(0)\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n let t = if self.idx + self.back_idx >= #variant_count { 0 } else { #variant_count - self.idx - self.back_idx };\n (t, Some(t))\n }\n\n fn nth(&mut self, n: usize) -> Option<<Self as Iterator>::Item> {\n let idx = self.idx + n + 1;\n if idx + self.back_idx > #variant_count {\n \n \n \n self.idx = #variant_count;\n None\n } else {\n self.idx = idx;\n self.get(idx - 1)\n }\n }\n }\n\n impl #impl_generics ExactSizeIterator for #iter_name #ty_generics #where_clause {\n fn len(&self) -> usize {\n self.size_hint().0\n }\n }\n\n impl #impl_generics DoubleEndedIterator for #iter_name #ty_generics #where_clause {\n fn next_back(&mut self) -> Option<<Self as Iterator>::Item> {\n let back_idx = self.back_idx + 1;\n\n if self.idx + back_idx > #variant_count {\n \n \n \n self.back_idx = #variant_count;\n None\n } else {\n self.back_idx = back_idx;\n self.get(#variant_count - self.back_idx)\n }\n }\n }\n\n impl #impl_generics Clone for #iter_name #ty_generics #where_clause {\n fn clone(&self) -> #iter_name #ty_generics {\n #iter_name {\n idx: self.idx,\n back_idx: self.back_idx,\n marker: self.marker.clone(),\n }\n }\n }\n })\n}\n"},"prefix":{"kind":"string","value":"use proc_macro2::{Span, TokenStream};\nuse quote::quote;\nuse syn::{Data, DeriveInput, Fields, Ident};\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"pub fn enum_iter_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n let name = &ast.ident;\n let gen = &ast.generics;\n let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();\n let vis = &ast.vis;\n let type_properties = ast.get_type_properties()?;\n let strum_module_path = type_properties.crate_module_path();\n\n if gen.lifetimes().count() > 0 {\n return Err(syn::Error::new(\n Span::call_site(),\n \"This macro doesn't support enums with lifetimes. \\\n The resulting enums would be unbounded.\",\n ));\n }\n\n let phantom_data = if gen.type_params().count() > 0 {\n let g = gen.type_params().map(|param| ¶m.ident);\n quote! { < ( #(#g),* ) > }\n } else {\n quote! { < () > }\n };\n\n let variants = match &ast.data {\n Data::Enum(v) => &v.variants,\n _ => return Err(non_enum_error()),\n };\n\n let mut arms = Vec::new();\n let mut idx = 0usize;\n for variant in variants {\n if variant.get_variant_properties()?.disabled.is_some() {\n continue;\n }\n\n let ident = &variant.ident;\n let params = match &variant.fields {\n Fields::Unit => quote! {},\n Fields::Unnamed(fields) => {\n let defaults = ::core::iter::repeat(quote!(::core::default::Default::default()))\n .take(fields.unnamed.len());\n quote! { (#(#defaults),*) }\n }\n Fields::Named(fields) => {\n let fields = fields\n .named\n .iter()\n .map(|field| field.ident.as_ref().unwrap());\n quote! { {#(#fields: ::core::default::Default::default()),*} }\n }\n };\n\n arms.push(quote! {#idx => ::core::option::Option::Some(#name::#ident #params)});\n idx += 1;\n }\n\n let variant_count = arms.len();\n arms.push(quote! { _ => ::core::option::Option::None });\n let iter_name = syn::parse_str::<Ident>(&format!(\"{}Iter\", name)).unwrap();\n\n Ok(quote! {\n #[doc = \"An iterator over the variants of [Self]\"]\n #vis struct #iter_name #ty_generics {\n idx: usize,\n back_idx: usize,\n marker: ::core::marker::PhantomData #phantom_data,\n }\n\n impl #impl_generics #iter_name #ty_generics #where_clause {\n fn get(&self, idx: usize) -> Option<#name #ty_generics> {\n match idx {\n #(#arms),*\n }\n }\n }\n\n impl #impl_generics #strum_module_path::IntoEnumIterator for #name #ty_generics #where_clause {\n type Iterator = #iter_name #ty_generics;\n fn iter() -> #iter_name #ty_generics {\n #iter_name {\n idx: 0,\n back_idx: 0,\n marker: ::core::marker::PhantomData,\n }\n }\n }\n\n impl #impl_generics Iterator for #iter_name #ty_generics #where_clause {\n type Item = #name #ty_generics;\n\n fn next(&mut self) -> Option<<Self as Iterator>::Item> {\n self.nth(0)\n }\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n let t = if self.idx + self.back_idx >= #variant_count { 0 } else { #variant_count - self.idx - self.back_idx };\n (t, Some(t))\n }\n\n fn nth(&mut self, n: usize) -> Option<<Self as Iterator>::Item> {\n let idx = self.idx + n + 1;\n if idx + self.back_idx > #variant_count {\n \n \n \n self.idx = #variant_count;\n None\n } else {\n self.idx = idx;\n self.get(idx - 1)\n }\n }\n }\n\n impl #impl_generics ExactSizeIterator for #iter_name #ty_generics #where_clause {\n fn len(&self) -> usize {\n self.size_hint().0\n }\n }\n\n impl #impl_generics DoubleEndedIterator for #iter_name #ty_generics #where_clause {\n fn next_back(&mut self) -> Option<<Self as Iterator>::Item> {\n let back_idx = self.back_idx + 1;\n\n if self.idx + back_idx > #variant_count {\n \n \n \n self.back_idx = #variant_count;\n None\n } else {\n self.back_idx = back_idx;\n self.get(#variant_count - self.back_idx)\n }\n }\n }\n\n impl #impl_generics Clone for #iter_name #ty_generics #where_clause {\n fn clone(&self) -> #iter_name #ty_generics {\n #iter_name {\n idx: self.idx,\n back_idx: self.back_idx,\n marker: self.marker.clone(),\n }\n }\n }\n })\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"struct Prop(Ident, LitStr);\n\n\n\nimpl Parse for Prop {\n\n fn parse(input: ParseStream) -> syn::Result<Self> {\n\n use syn::ext::IdentExt;\n\n\n\n let k = Ident::parse_any(input)?;\n\n let _: Token![=] = input.parse()?;\n\n let v = input.parse()?;\n\n\n\n Ok(Prop(k, v))\n\n }\n\n}\n\n\n\nimpl Spanned for VariantMeta {\n\n fn span(&self) -> Span {\n\n match self {\n\n VariantMeta::Message { kw, .. } => kw.span,\n\n VariantMeta::DetailedMessage { kw, .. } => kw.span,\n\n VariantMeta::Documentation { value } => value.span(),\n\n VariantMeta::Serialize { kw, .. } => kw.span,\n\n VariantMeta::ToString { kw, .. } => kw.span,\n\n VariantMeta::Disabled(kw) => kw.span,\n\n VariantMeta::Default(kw) => kw.span,\n\n VariantMeta::AsciiCaseInsensitive { kw, .. } => kw.span,\n\n VariantMeta::Props { kw, .. } => kw.span,\n\n }\n\n }\n\n}\n\n\n","file_path":"strum_macros/src/helpers/metadata.rs","rank":0,"score":58699.21703490926},{"content":"fn debug_print_generated(ast: &DeriveInput, toks: &TokenStream) {\n\n let debug = env::var(\"STRUM_DEBUG\");\n\n if let Ok(s) = debug {\n\n if s == \"1\" {\n\n println!(\"{}\", toks);\n\n }\n\n\n\n if ast.ident == s {\n\n println!(\"{}\", toks);\n\n }\n\n }\n\n}\n\n\n\n/// Converts strings to enum variants based on their name.\n\n///\n\n/// auto-derives `std::str::FromStr` on the enum (for Rust 1.34 and above, `std::convert::TryFrom<&str>`\n\n/// will be derived as well). Each variant of the enum will match on it's own name.\n\n/// This can be overridden using `serialize=\"DifferentName\"` or `to_string=\"DifferentName\"`\n\n/// on the attribute as shown below.\n\n/// Multiple deserializations can be added to the same variant. If the variant contains additional data,\n","file_path":"strum_macros/src/lib.rs","rank":1,"score":46054.072262638},{"content":"pub fn from_repr_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let gen = &ast.generics;\n\n let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();\n\n let vis = &ast.vis;\n\n let attrs = &ast.attrs;\n\n\n\n let mut discriminant_type: Type = syn::parse(\"usize\".parse().unwrap()).unwrap();\n\n for attr in attrs {\n\n let path = &attr.path;\n\n let tokens = &attr.tokens;\n\n if path.leading_colon.is_some() {\n\n continue;\n\n }\n\n if path.segments.len() != 1 {\n\n continue;\n\n }\n\n let segment = path.segments.first().unwrap();\n\n if segment.ident != \"repr\" {\n\n continue;\n","file_path":"strum_macros/src/macros/from_repr.rs","rank":2,"score":40511.391489987865},{"content":"pub fn display_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n let type_properties = ast.get_type_properties()?;\n\n\n\n let mut arms = Vec::new();\n\n for variant in variants {\n\n let ident = &variant.ident;\n\n let variant_properties = variant.get_variant_properties()?;\n\n\n\n if variant_properties.disabled.is_some() {\n\n continue;\n\n }\n\n\n\n // Look at all the serialize attributes.\n","file_path":"strum_macros/src/macros/strings/display.rs","rank":3,"score":40511.391489987865},{"content":"fn get_arms(ast: &DeriveInput) -> syn::Result<Vec<TokenStream>> {\n\n let name = &ast.ident;\n\n let mut arms = Vec::new();\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n let type_properties = ast.get_type_properties()?;\n\n\n\n for variant in variants {\n\n let ident = &variant.ident;\n\n let variant_properties = variant.get_variant_properties()?;\n\n\n\n if variant_properties.disabled.is_some() {\n\n continue;\n\n }\n\n\n\n // Look at all the serialize attributes.\n\n // Use `to_string` attribute (not `as_ref_str` or something) to keep things consistent\n","file_path":"strum_macros/src/macros/strings/as_ref_str.rs","rank":5,"score":40511.391489987865},{"content":"pub fn enum_discriminants_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let vis = &ast.vis;\n\n\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n // Derives for the generated enum\n\n let type_properties = ast.get_type_properties()?;\n\n\n\n let derives = type_properties.discriminant_derives;\n\n\n\n let derives = quote! {\n\n #[derive(Clone, Copy, Debug, PartialEq, Eq, #(#derives),*)]\n\n };\n\n\n\n // Work out the name\n\n let default_name = syn::Ident::new(&format!(\"{}Discriminants\", name), Span::call_site());\n","file_path":"strum_macros/src/macros/enum_discriminants.rs","rank":6,"score":40511.391489987865},{"content":"pub fn enum_properties_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n let type_properties = ast.get_type_properties()?;\n\n let strum_module_path = type_properties.crate_module_path();\n\n\n\n let mut arms = Vec::new();\n\n for variant in variants {\n\n let ident = &variant.ident;\n\n let variant_properties = variant.get_variant_properties()?;\n\n let mut string_arms = Vec::new();\n\n let mut bool_arms = Vec::new();\n\n let mut num_arms = Vec::new();\n\n // But you can disable the messages.\n\n if variant_properties.disabled.is_some() {\n\n continue;\n","file_path":"strum_macros/src/macros/enum_properties.rs","rank":7,"score":40511.391489987865},{"content":"pub fn from_string_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n let type_properties = ast.get_type_properties()?;\n\n let strum_module_path = type_properties.crate_module_path();\n\n\n\n let mut default_kw = None;\n\n let mut default = quote! { _ => ::core::result::Result::Err(#strum_module_path::ParseError::VariantNotFound) };\n\n let mut arms = Vec::new();\n\n for variant in variants {\n\n let ident = &variant.ident;\n\n let variant_properties = variant.get_variant_properties()?;\n\n\n\n if variant_properties.disabled.is_some() {\n\n continue;\n","file_path":"strum_macros/src/macros/strings/from_string.rs","rank":8,"score":40511.391489987865},{"content":"pub fn to_string_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n let type_properties = ast.get_type_properties()?;\n\n let mut arms = Vec::new();\n\n for variant in variants {\n\n let ident = &variant.ident;\n\n let variant_properties = variant.get_variant_properties()?;\n\n\n\n if variant_properties.disabled.is_some() {\n\n continue;\n\n }\n\n\n\n // Look at all the serialize attributes.\n\n let output = variant_properties.get_preferred_name(type_properties.case_style);\n","file_path":"strum_macros/src/macros/strings/to_string.rs","rank":9,"score":40511.391489987865},{"content":"pub fn enum_variant_names_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let gen = &ast.generics;\n\n let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();\n\n\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n // Derives for the generated enum\n\n let type_properties = ast.get_type_properties()?;\n\n let strum_module_path = type_properties.crate_module_path();\n\n\n\n let names = variants\n\n .iter()\n\n .map(|v| {\n\n let props = v.get_variant_properties()?;\n\n Ok(props.get_preferred_name(type_properties.case_style))\n\n })\n\n .collect::<syn::Result<Vec<_>>>()?;\n\n\n\n Ok(quote! {\n\n impl #impl_generics #strum_module_path::VariantNames for #name #ty_generics #where_clause {\n\n const VARIANTS: &'static [&'static str] = &[ #(#names),* ];\n\n }\n\n })\n\n}\n","file_path":"strum_macros/src/macros/enum_variant_names.rs","rank":10,"score":40511.391489987865},{"content":"pub fn enum_message_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let variants = match &ast.data {\n\n Data::Enum(v) => &v.variants,\n\n _ => return Err(non_enum_error()),\n\n };\n\n\n\n let type_properties = ast.get_type_properties()?;\n\n let strum_module_path = type_properties.crate_module_path();\n\n\n\n let mut arms = Vec::new();\n\n let mut detailed_arms = Vec::new();\n\n let mut documentation_arms = Vec::new();\n\n let mut serializations = Vec::new();\n\n\n\n for variant in variants {\n\n let variant_properties = variant.get_variant_properties()?;\n\n let messages = variant_properties.message.as_ref();\n\n let detailed_messages = variant_properties.detailed_message.as_ref();\n","file_path":"strum_macros/src/macros/enum_messages.rs","rank":11,"score":40511.391489987865},{"content":"pub fn as_ref_str_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let name = &ast.ident;\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let arms = get_arms(ast)?;\n\n Ok(quote! {\n\n impl #impl_generics ::core::convert::AsRef<str> for #name #ty_generics #where_clause {\n\n fn as_ref(&self) -> &str {\n\n match *self {\n\n #(#arms),*\n\n }\n\n }\n\n }\n\n })\n\n}\n\n\n\npub enum GenerateTraitVariant {\n\n AsStaticStr,\n\n From,\n\n}\n\n\n","file_path":"strum_macros/src/macros/strings/as_ref_str.rs","rank":12,"score":40511.391489987865},{"content":"#[allow(dead_code)]\n\n#[derive(Debug, EnumDiscriminants)]\n\n#[strum_discriminants(derive(EnumIter))]\n\nenum WithFields {\n\n Variant0(NonDefault),\n\n Variant1 { a: NonDefault },\n\n}\n\n\n","file_path":"strum_tests/tests/enum_discriminants.rs","rank":13,"score":34144.904862710544},{"content":"#[test]\n\nfn fields_test() {\n\n let discriminants = WithFieldsDiscriminants::iter().collect::<Vec<_>>();\n\n let expected = vec![\n\n WithFieldsDiscriminants::Variant0,\n\n WithFieldsDiscriminants::Variant1,\n\n ];\n\n\n\n assert_eq!(expected, discriminants);\n\n}\n\n\n","file_path":"strum_tests/tests/enum_discriminants.rs","rank":14,"score":33195.177709361546},{"content":"#[proc_macro_derive(EnumString, attributes(strum))]\n\npub fn from_string(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks =\n\n macros::from_string::from_string_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Converts enum variants to `&'static str`.\n\n///\n\n/// Implements `AsRef<str>` on your enum using the same rules as\n\n/// `Display` for determining what string is returned. The difference is that `as_ref()` returns\n\n/// a `&str` instead of a `String` so you don't allocate any additional memory with each call.\n\n///\n\n/// ```\n\n/// // You need to bring the AsRef trait into scope to use it\n\n/// use std::convert::AsRef;\n\n/// use strum_macros::AsRefStr;\n\n///\n","file_path":"strum_macros/src/lib.rs","rank":15,"score":28727.6670043459},{"content":"#[proc_macro_derive(ToString, attributes(strum))]\n\npub fn to_string(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks =\n\n macros::to_string::to_string_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Converts enum variants to strings.\n\n///\n\n/// Deriving `Display` on an enum prints out the given enum. This enables you to perform round\n\n/// trip style conversions from enum into string and back again for unit style variants. `Display`\n\n/// choose which serialization to used based on the following criteria:\n\n///\n\n/// 1. If there is a `to_string` property, this value will be used. There can only be one per variant.\n\n/// 1. Of the various `serialize` properties, the value with the longest length is chosen. If that\n\n/// behavior isn't desired, you should use `to_string`.\n\n/// 1. The name of the variant will be used if there are no `serialize` or `to_string` attributes.\n\n///\n","file_path":"strum_macros/src/lib.rs","rank":16,"score":28727.6670043459},{"content":"#[proc_macro_derive(EnumDiscriminants, attributes(strum, strum_discriminants))]\n\npub fn enum_discriminants(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::enum_discriminants::enum_discriminants_inner(&ast)\n\n .unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Add a constant `usize` equal to the number of variants.\n\n///\n\n/// For a given enum generates implementation of `strum::EnumCount`,\n\n/// which adds a static property `COUNT` of type usize that holds the number of variants.\n\n///\n\n/// ```\n\n/// use strum::{EnumCount, IntoEnumIterator};\n\n/// use strum_macros::{EnumCount as EnumCountMacro, EnumIter};\n\n///\n\n/// #[derive(Debug, EnumCountMacro, EnumIter)]\n\n/// enum Week {\n","file_path":"strum_macros/src/lib.rs","rank":17,"score":28727.6670043459},{"content":"#[proc_macro_derive(EnumProperty, attributes(strum))]\n\npub fn enum_properties(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::enum_properties::enum_properties_inner(&ast)\n\n .unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Generate a new type with only the discriminant names.\n\n///\n\n/// Given an enum named `MyEnum`, generates another enum called `MyEnumDiscriminants` with the same\n\n/// variants but without any data fields. This is useful when you wish to determine the variant of\n\n/// an `enum` but one or more of the variants contains a non-`Default` field. `From`\n\n/// implementations are generated so that you can easily convert from `MyEnum` to\n\n/// `MyEnumDiscriminants`.\n\n///\n\n/// By default, the generated enum has the following derives: `Clone, Copy, Debug, PartialEq, Eq`.\n\n/// You can add additional derives using the `#[strum_discriminants(derive(AdditionalDerive))]`\n\n/// attribute.\n","file_path":"strum_macros/src/lib.rs","rank":18,"score":28727.6670043459},{"content":"#[proc_macro_derive(EnumMessage, attributes(strum))]\n\npub fn enum_messages(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::enum_messages::enum_message_inner(&ast)\n\n .unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Add custom properties to enum variants.\n\n///\n\n/// Enables the encoding of arbitary constants into enum variants. This method\n\n/// currently only supports adding additional string values. Other types of literals are still\n\n/// experimental in the rustc compiler. The generated code works by nesting match statements.\n\n/// The first match statement matches on the type of the enum, and the inner match statement\n\n/// matches on the name of the property requested. This design works well for enums with a small\n\n/// number of variants and properties, but scales linearly with the number of variants so may not\n\n/// be the best choice in all situations.\n\n///\n\n/// ```\n","file_path":"strum_macros/src/lib.rs","rank":19,"score":28727.6670043459},{"content":"pub fn as_static_str(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::as_ref_str::as_static_str_inner(\n\n &ast,\n\n ¯os::as_ref_str::GenerateTraitVariant::AsStaticStr,\n\n )\n\n .unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Implements `From<MyEnum> for &'static str` on an enum.\n\n///\n\n/// Implements `From<YourEnum>` and `From<&'a YourEnum>` for `&'static str`. This is\n\n/// useful for turning an enum variant into a static string.\n\n/// The Rust `std` provides a blanket impl of the reverse direction - i.e. `impl Into<&'static str> for YourEnum`.\n\n///\n\n/// ```\n\n/// use strum_macros::IntoStaticStr;\n","file_path":"strum_macros/src/lib.rs","rank":20,"score":28727.6670043459},{"content":"#[proc_macro_derive(FromRepr, attributes(strum))]\n\npub fn from_repr(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks =\n\n macros::from_repr::from_repr_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Add a verbose message to an enum variant.\n\n///\n\n/// Encode strings into the enum itself. The `strum_macros::EmumMessage` macro implements the `strum::EnumMessage` trait.\n\n/// `EnumMessage` looks for `#[strum(message=\"...\")]` attributes on your variants.\n\n/// You can also provided a `detailed_message=\"...\"` attribute to create a seperate more detailed message than the first.\n\n/// ```\n\n/// // You need to bring the trait into scope to use it\n\n/// use strum::EnumMessage;\n\n/// use strum_macros;\n\n///\n\n/// #[derive(strum_macros::EnumMessage, Debug)]\n","file_path":"strum_macros/src/lib.rs","rank":21,"score":28727.6670043459},{"content":"#[proc_macro_derive(AsRefStr, attributes(strum))]\n\npub fn as_ref_str(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks =\n\n macros::as_ref_str::as_ref_str_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Implements `Strum::VariantNames` which adds an associated constant `VARIANTS` which is an array of discriminant names.\n\n///\n\n/// Adds an `impl` block for the `enum` that adds a static `VARIANTS` array of `&'static str` that are the discriminant names.\n\n/// This will respect the `serialize_all` attribute on the `enum` (like `#[strum(serialize_all = \"snake_case\")]`.\n\n///\n\n/// ```\n\n/// // import the macros needed\n\n/// use strum_macros::{EnumString, EnumVariantNames};\n\n/// // You need to import the trait, to have access to VARIANTS\n\n/// use strum::VariantNames;\n\n///\n\n/// #[derive(Debug, EnumString, EnumVariantNames)]\n\n/// #[strum(serialize_all = \"kebab_case\")]\n\n/// enum Color {\n\n/// Red,\n\n/// Blue,\n\n/// Yellow,\n\n/// RebeccaPurple,\n\n/// }\n\n/// assert_eq!([\"red\", \"blue\", \"yellow\", \"rebecca-purple\"], Color::VARIANTS);\n\n/// ```\n","file_path":"strum_macros/src/lib.rs","rank":22,"score":28727.6670043459},{"content":"#[proc_macro_derive(EnumIter, attributes(strum))]\n\npub fn enum_iter(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks =\n\n macros::enum_iter::enum_iter_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Add a function to enum that allows accessing variants by its discriminant\n\n///\n\n/// This macro adds a standalone function to obtain an enum variant by its discriminant. The macro adds\n\n/// `from_repr(discriminant: usize) -> Option<YourEnum>` as a standalone function on the enum. For\n\n/// variants with additional data, the returned variant will use the `Default` trait to fill the\n\n/// data. The discriminant follows the same rules as `rustc`. The first discriminant is zero and each\n\n/// successive variant has a discriminant of one greater than the previous variant, expect where an\n\n/// explicit discriminant is specified. The type of the discriminant will match the `repr` type if\n\n/// it is specifed.\n\n///\n\n/// When the macro is applied using rustc >= 1.46 and when there is no additional data on any of\n","file_path":"strum_macros/src/lib.rs","rank":23,"score":28727.6670043459},{"content":"#[proc_macro_derive(EnumVariantNames, attributes(strum))]\n\npub fn variant_names(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::enum_variant_names::enum_variant_names_inner(&ast)\n\n .unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n#[proc_macro_derive(AsStaticStr, attributes(strum))]\n\n#[deprecated(\n\n since = \"0.22.0\",\n\n note = \"please use `#[derive(IntoStaticStr)]` instead\"\n\n)]\n","file_path":"strum_macros/src/lib.rs","rank":24,"score":28727.6670043459},{"content":"#[proc_macro_derive(Display, attributes(strum))]\n\npub fn display(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::display::display_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// Creates a new type that iterates of the variants of an enum.\n\n///\n\n/// Iterate over the variants of an Enum. Any additional data on your variants will be set to `Default::default()`.\n\n/// The macro implements `strum::IntoEnumIter` on your enum and creates a new type called `YourEnumIter` that is the iterator object.\n\n/// You cannot derive `EnumIter` on any type with a lifetime bound (`<'a>`) because the iterator would surely\n\n/// create [unbounded lifetimes](https://doc.rust-lang.org/nightly/nomicon/unbounded-lifetimes.html).\n\n///\n\n/// ```\n\n///\n\n/// // You need to bring the trait into scope to use it!\n\n/// use strum::IntoEnumIterator;\n\n/// use strum_macros::EnumIter;\n","file_path":"strum_macros/src/lib.rs","rank":25,"score":28727.6670043459},{"content":"#[proc_macro_derive(EnumCount, attributes(strum))]\n\npub fn enum_count(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n let toks =\n\n macros::enum_count::enum_count_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n","file_path":"strum_macros/src/lib.rs","rank":26,"score":28727.6670043459},{"content":"#[proc_macro_derive(IntoStaticStr, attributes(strum))]\n\npub fn into_static_str(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n let ast = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n let toks = macros::as_ref_str::as_static_str_inner(\n\n &ast,\n\n ¯os::as_ref_str::GenerateTraitVariant::From,\n\n )\n\n .unwrap_or_else(|err| err.to_compile_error());\n\n debug_print_generated(&ast, &toks);\n\n toks.into()\n\n}\n\n\n\n/// implements `std::string::ToString` on en enum\n\n///\n\n/// ```\n\n/// // You need to bring the ToString trait into scope to use it\n\n/// use std::string::ToString;\n\n/// use strum_macros;\n\n///\n\n/// #[derive(strum_macros::ToString, Debug)]\n","file_path":"strum_macros/src/lib.rs","rank":27,"score":28727.6670043459},{"content":"use heck::ToShoutySnakeCase;\n\nuse proc_macro2::{Span, TokenStream};\n\nuse quote::{format_ident, quote};\n\nuse syn::{Data, DeriveInput, Fields, PathArguments, Type, TypeParen};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties};\n\n\n","file_path":"strum_macros/src/macros/from_repr.rs","rank":29,"score":9.472179410790037},{"content":" // See <https://github.com/dtolnay/syn/issues/433>\n\n // ---\n\n // let is_copy = unique_meta_list(type_meta.iter(), \"derive\")\n\n // .map(extract_list_metas)\n\n // .map(|metas| {\n\n // metas\n\n // .filter_map(get_meta_ident)\n\n // .any(|derive| derive.to_string() == \"Copy\")\n\n // }).unwrap_or(false);\n\n\n\n let arms = variants\n\n .iter()\n\n .map(|variant| {\n\n let ident = &variant.ident;\n\n let params = match &variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(_fields) => {\n\n quote! { (..) }\n\n }\n\n Fields::Named(_fields) => {\n","file_path":"strum_macros/src/macros/enum_discriminants.rs","rank":30,"score":7.820751861969361},{"content":"\n\n let params = match variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(..) => quote! { (..) },\n\n Fields::Named(..) => quote! { {..} },\n\n };\n\n\n\n arms.push(quote! { #name::#ident #params => ::std::string::String::from(#output) });\n\n }\n\n\n\n if arms.len() < variants.len() {\n\n arms.push(quote! { _ => panic!(\"to_string() called on disabled variant.\") });\n\n }\n\n\n\n Ok(quote! {\n\n #[allow(clippy::use_self)]\n\n impl #impl_generics ::std::string::ToString for #name #ty_generics #where_clause {\n\n fn to_string(&self) -> ::std::string::String {\n\n match *self {\n\n #(#arms),*\n\n }\n\n }\n\n }\n\n })\n\n}\n","file_path":"strum_macros/src/macros/strings/to_string.rs","rank":31,"score":7.631615600285128},{"content":" let documentation = &variant_properties.documentation;\n\n let ident = &variant.ident;\n\n\n\n let params = match variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(..) => quote! { (..) },\n\n Fields::Named(..) => quote! { {..} },\n\n };\n\n\n\n // You can't disable getting the serializations.\n\n {\n\n let serialization_variants =\n\n variant_properties.get_serializations(type_properties.case_style);\n\n\n\n let count = serialization_variants.len();\n\n serializations.push(quote! {\n\n &#name::#ident #params => {\n\n static ARR: [&'static str; #count] = [#(#serialization_variants),*];\n\n &ARR\n\n }\n","file_path":"strum_macros/src/macros/enum_messages.rs","rank":32,"score":7.345284776188693},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput, Fields};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n\n","file_path":"strum_macros/src/macros/enum_properties.rs","rank":33,"score":7.31824640206011},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput, Fields};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n\n","file_path":"strum_macros/src/macros/strings/to_string.rs","rank":34,"score":7.31824640206011},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput, Fields};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n\n","file_path":"strum_macros/src/macros/strings/display.rs","rank":35,"score":7.31824640206011},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{parse_quote, Data, DeriveInput, Fields};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n\n","file_path":"strum_macros/src/macros/strings/as_ref_str.rs","rank":36,"score":7.201904838279564},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput, Fields, LitStr};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n\n","file_path":"strum_macros/src/macros/enum_messages.rs","rank":37,"score":7.201904838279564},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput, Fields};\n\n\n\nuse crate::helpers::{\n\n non_enum_error, occurrence_error, HasStrumVariantProperties, HasTypeProperties,\n\n};\n\n\n","file_path":"strum_macros/src/macros/strings/from_string.rs","rank":38,"score":7.201904838279564},{"content":" let mut prev_const_var_ident = None;\n\n for variant in variants {\n\n if variant.get_variant_properties()?.disabled.is_some() {\n\n continue;\n\n }\n\n\n\n let ident = &variant.ident;\n\n let params = match &variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(fields) => {\n\n has_additional_data = true;\n\n let defaults = ::core::iter::repeat(quote!(::core::default::Default::default()))\n\n .take(fields.unnamed.len());\n\n quote! { (#(#defaults),*) }\n\n }\n\n Fields::Named(fields) => {\n\n has_additional_data = true;\n\n let fields = fields\n\n .named\n\n .iter()\n","file_path":"strum_macros/src/macros/from_repr.rs","rank":39,"score":7.190492968414006},{"content":"use std::default::Default;\n\nuse syn::{Ident, LitStr, Variant};\n\n\n\nuse super::case_style::{CaseStyle, CaseStyleHelpers};\n\nuse super::metadata::{kw, VariantExt, VariantMeta};\n\nuse super::occurrence_error;\n\n\n","file_path":"strum_macros/src/helpers/variant_props.rs","rank":40,"score":7.150080038009833},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse std::default::Default;\n\nuse syn::{parse_quote, DeriveInput, Ident, Path, Visibility};\n\n\n\nuse super::case_style::CaseStyle;\n\nuse super::metadata::{DeriveInputExt, EnumDiscriminantsMeta, EnumMeta};\n\nuse super::occurrence_error;\n\n\n","file_path":"strum_macros/src/helpers/type_props.rs","rank":41,"score":6.9208689600656195},{"content":" Fields::Unit => quote! {},\n\n Fields::Unnamed(fields) => {\n\n let defaults =\n\n ::core::iter::repeat(quote!(Default::default())).take(fields.unnamed.len());\n\n quote! { (#(#defaults),*) }\n\n }\n\n Fields::Named(fields) => {\n\n let fields = fields\n\n .named\n\n .iter()\n\n .map(|field| field.ident.as_ref().unwrap());\n\n quote! { {#(#fields: Default::default()),*} }\n\n }\n\n };\n\n\n\n arms.push(quote! { #(#attrs => ::core::result::Result::Ok(#name::#ident #params)),* });\n\n }\n\n\n\n arms.push(default);\n\n\n","file_path":"strum_macros/src/macros/strings/from_string.rs","rank":42,"score":6.854575423037257},{"content":"use proc_macro2::{Span, TokenStream, TokenTree};\n\nuse quote::{quote, ToTokens};\n\nuse syn::parse_quote;\n\nuse syn::{Data, DeriveInput, Fields};\n\n\n\nuse crate::helpers::{non_enum_error, strum_discriminants_passthrough_error, HasTypeProperties};\n\n\n\n/// Attributes to copy from the main enum's variants to the discriminant enum's variants.\n\n///\n\n/// Attributes not in this list may be for other `proc_macro`s on the main enum, and may cause\n\n/// compilation problems when copied across.\n\nconst ATTRIBUTES_TO_COPY: &[&str] = &[\"doc\", \"cfg\", \"allow\", \"deny\", \"strum_discriminants\"];\n\n\n","file_path":"strum_macros/src/macros/enum_discriminants.rs","rank":44,"score":6.005617829907104},{"content":"use proc_macro2::{Span, TokenStream};\n\nuse syn::{\n\n parenthesized,\n\n parse::{Parse, ParseStream},\n\n parse2, parse_str,\n\n punctuated::Punctuated,\n\n spanned::Spanned,\n\n Attribute, DeriveInput, Ident, Lit, LitBool, LitStr, Meta, MetaNameValue, Path, Token, Variant, Visibility,\n\n};\n\n\n\nuse super::case_style::CaseStyle;\n\n\n\npub mod kw {\n\n use syn::custom_keyword;\n\n pub use syn::token::Crate;\n\n\n\n // enum metadata\n\n custom_keyword!(serialize_all);\n\n\n\n // enum discriminant metadata\n","file_path":"strum_macros/src/helpers/metadata.rs","rank":45,"score":5.959888266646222},{"content":" // (i.e. always `enum.as_ref().to_string() == enum.to_string()`).\n\n let output = variant_properties.get_preferred_name(type_properties.case_style);\n\n let params = match variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(..) => quote! { (..) },\n\n Fields::Named(..) => quote! { {..} },\n\n };\n\n\n\n arms.push(quote! { #name::#ident #params => #output });\n\n }\n\n\n\n if arms.len() < variants.len() {\n\n arms.push(quote! {\n\n _ => panic!(\n\n \"AsRef::<str>::as_ref() or AsStaticRef::<str>::as_static() \\\n\n called on disabled variant.\",\n\n )\n\n });\n\n }\n\n\n\n Ok(arms)\n\n}\n\n\n","file_path":"strum_macros/src/macros/strings/as_ref_str.rs","rank":46,"score":5.782436141329776},{"content":" }\n\n\n\n let params = match variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(..) => quote! { (..) },\n\n Fields::Named(..) => quote! { {..} },\n\n };\n\n\n\n for (key, value) in variant_properties.string_props {\n\n string_arms.push(quote! { #key => ::core::option::Option::Some( #value )});\n\n }\n\n\n\n string_arms.push(quote! { _ => ::core::option::Option::None });\n\n bool_arms.push(quote! { _ => ::core::option::Option::None });\n\n num_arms.push(quote! { _ => ::core::option::Option::None });\n\n\n\n arms.push(quote! {\n\n &#name::#ident #params => {\n\n match prop {\n\n #(#string_arms),*\n","file_path":"strum_macros/src/macros/enum_properties.rs","rank":48,"score":5.44866365726444},{"content":"use heck::{\n\n ToKebabCase, ToLowerCamelCase, ToShoutySnakeCase, ToSnakeCase, ToTitleCase, ToUpperCamelCase,\n\n};\n\nuse std::str::FromStr;\n\nuse syn::{\n\n parse::{Parse, ParseStream},\n\n Ident, LitStr,\n\n};\n\n\n\n#[allow(clippy::enum_variant_names)]\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\n\npub enum CaseStyle {\n\n CamelCase,\n\n KebabCase,\n\n MixedCase,\n\n ShoutySnakeCase,\n\n SnakeCase,\n\n TitleCase,\n\n UpperCase,\n\n LowerCase,\n","file_path":"strum_macros/src/helpers/case_style.rs","rank":49,"score":5.330885358253186},{"content":" let output = variant_properties.get_preferred_name(type_properties.case_style);\n\n\n\n let params = match variant.fields {\n\n Fields::Unit => quote! {},\n\n Fields::Unnamed(..) => quote! { (..) },\n\n Fields::Named(..) => quote! { {..} },\n\n };\n\n\n\n arms.push(quote! { #name::#ident #params => f.pad(#output) });\n\n }\n\n\n\n if arms.len() < variants.len() {\n\n arms.push(quote! { _ => panic!(\"fmt() called on disabled variant.\") });\n\n }\n\n\n\n Ok(quote! {\n\n impl #impl_generics ::core::fmt::Display for #name #ty_generics #where_clause {\n\n fn fmt(&self, f: &mut ::core::fmt::Formatter) -> ::core::result::Result<(), ::core::fmt::Error> {\n\n match *self {\n\n #(#arms),*\n\n }\n\n }\n\n }\n\n })\n\n}\n","file_path":"strum_macros/src/macros/strings/display.rs","rank":50,"score":5.2804774677868505},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput};\n\n\n\nuse crate::helpers::{non_enum_error, HasTypeProperties};\n\n\n\npub(crate) fn enum_count_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\n\n let n = match &ast.data {\n\n Data::Enum(v) => v.variants.len(),\n\n _ => return Err(non_enum_error()),\n\n };\n\n let type_properties = ast.get_type_properties()?;\n\n let strum_module_path = type_properties.crate_module_path();\n\n\n\n // Used in the quasi-quotation below as `#name`\n\n let name = &ast.ident;\n\n\n\n // Helper is provided for handling complex generic types correctly and effortlessly\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n\n\n Ok(quote! {\n\n // Implementation\n\n impl #impl_generics #strum_module_path::EnumCount for #name #ty_generics #where_clause {\n\n const COUNT: usize = #n;\n\n }\n\n })\n\n}\n","file_path":"strum_macros/src/macros/enum_count.rs","rank":51,"score":5.070169011791643},{"content":" .map(|field| field.ident.as_ref().unwrap());\n\n quote! { {#(#fields: ::core::default::Default::default()),*} }\n\n }\n\n };\n\n\n\n let const_var_str = format!(\"{}_DISCRIMINANT\", variant.ident).to_shouty_snake_case();\n\n let const_var_ident = format_ident!(\"{}\", const_var_str);\n\n\n\n let const_val_expr = match &variant.discriminant {\n\n Some((_, expr)) => quote! { #expr },\n\n None => match &prev_const_var_ident {\n\n Some(prev) => quote! { #prev + 1 },\n\n None => quote! { 0 },\n\n },\n\n };\n\n\n\n constant_defs.push(quote! {const #const_var_ident: #discriminant_type = #const_val_expr;});\n\n arms.push(quote! {v if v == #const_var_ident => ::core::option::Option::Some(#name::#ident #params)});\n\n\n\n prev_const_var_ident = Some(const_var_ident);\n","file_path":"strum_macros/src/macros/from_repr.rs","rank":52,"score":4.591015673155843},{"content":" }\n\n\n\n if let Some(kw) = variant_properties.default {\n\n if let Some(fst_kw) = default_kw {\n\n return Err(occurrence_error(fst_kw, kw, \"default\"));\n\n }\n\n\n\n match &variant.fields {\n\n Fields::Unnamed(fields) if fields.unnamed.len() == 1 => {}\n\n _ => {\n\n return Err(syn::Error::new_spanned(\n\n variant,\n\n \"Default only works on newtype structs with a single String field\",\n\n ))\n\n }\n\n }\n\n\n\n default_kw = Some(kw);\n\n default = quote! {\n\n default => ::core::result::Result::Ok(#name::#ident(default.into()))\n","file_path":"strum_macros/src/macros/strings/from_string.rs","rank":53,"score":4.455552163845091},{"content":"use proc_macro2::TokenStream;\n\nuse quote::quote;\n\nuse syn::{Data, DeriveInput};\n\n\n\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\n\n\n","file_path":"strum_macros/src/macros/enum_variant_names.rs","rank":54,"score":4.417969666107224},{"content":"pub use self::case_style::CaseStyleHelpers;\n\npub use self::type_props::HasTypeProperties;\n\npub use self::variant_props::HasStrumVariantProperties;\n\n\n\npub mod case_style;\n\nmod metadata;\n\npub mod type_props;\n\npub mod variant_props;\n\n\n\nuse proc_macro2::Span;\n\nuse quote::ToTokens;\n\nuse syn::spanned::Spanned;\n\n\n","file_path":"strum_macros/src/helpers/mod.rs","rank":55,"score":4.405140189010975},{"content":"#![allow(deprecated)]\n\n\n\nuse std::str::FromStr;\n\nuse std::string::ToString;\n\nuse strum::{EnumString, ToString};\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumString, ToString)]\n","file_path":"strum_tests/tests/to_string.rs","rank":56,"score":4.1922183255973255},{"content":"}\n\n\n\n/// This trait designates that an `Enum` can be iterated over. It can\n\n/// be auto generated using `strum_macros` on your behalf.\n\n///\n\n/// # Example\n\n///\n\n/// ```rust\n\n/// # use std::fmt::Debug;\n\n/// // You need to bring the type into scope to use it!!!\n\n/// use strum::{EnumIter, IntoEnumIterator};\n\n///\n\n/// #[derive(EnumIter, Debug)]\n\n/// enum Color {\n\n/// Red,\n\n/// Green { range: usize },\n\n/// Blue(usize),\n\n/// Yellow,\n\n/// }\n\n///\n","file_path":"strum/src/lib.rs","rank":57,"score":4.090200374759712},{"content":"use structopt::StructOpt;\n\nuse strum::{EnumString, EnumVariantNames, VariantNames};\n\n\n\n#[test]\n","file_path":"strum_tests/tests/enum_variant_names.rs","rank":58,"score":4.085360039809054},{"content":"pub mod enum_count;\n\npub mod enum_discriminants;\n\npub mod enum_iter;\n\npub mod enum_messages;\n\npub mod enum_properties;\n\npub mod enum_variant_names;\n\npub mod from_repr;\n\n\n\nmod strings;\n\n\n\npub use self::strings::as_ref_str;\n\npub use self::strings::display;\n\npub use self::strings::from_string;\n\npub use self::strings::to_string;\n","file_path":"strum_macros/src/macros/mod.rs","rank":59,"score":4.0713221558221395},{"content":"use std::str::FromStr;\n\nuse strum::EnumString;\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumString)]\n","file_path":"strum_tests/tests/from_str.rs","rank":60,"score":4.047865556123924},{"content":" let ident = self.ident.as_ref().expect(\"identifier\");\n\n LitStr::new(&ident.convert_case(case_style), ident.span())\n\n }\n\n\n\n pub fn get_preferred_name(&self, case_style: Option<CaseStyle>) -> LitStr {\n\n self.to_string.as_ref().cloned().unwrap_or_else(|| {\n\n self.serialize\n\n .iter()\n\n .max_by_key(|s| s.value().len())\n\n .cloned()\n\n .unwrap_or_else(|| self.ident_as_str(case_style))\n\n })\n\n }\n\n\n\n pub fn get_serializations(&self, case_style: Option<CaseStyle>) -> Vec<LitStr> {\n\n let mut attrs = self.serialize.clone();\n\n if let Some(to_string) = &self.to_string {\n\n attrs.push(to_string.clone());\n\n }\n\n\n","file_path":"strum_macros/src/helpers/variant_props.rs","rank":61,"score":4.026295951444789},{"content":"### Added\n\n\n\n* Added a derive to implement `From<YourEnum>` for `&'static str`. This deprecates `AsStaticStr` since\n\n the new solution doesn't require a `strum` specific trait to use.\n\n\n\n## 0.12.0\n\n\n\n### Added\n\n\n\n* Serialization case can be controlled using `#[strum(serialize_all = \"snake_case\")]`. ([#21][#21])\n\n* `#[derive(EnumDiscriminants)]` generates enum with variants without fields. ([#33][#33])\n\n\n\n[#21]: https://github.com/Peternator7/strum/issues/21\n\n[#33]: https://github.com/Peternator7/strum/issues/33\n\n\n\n## 0.10.0\n\n\n\n### Added\n\n\n\n* Implemented `Clone` for `EnumIter`s. ([#18][#18])\n\n* Added `AsStaticRef` derive to allow enums to `impl AsStaticRef<str>`. ([#23][#23])\n\n\n\n### Fixed\n\n\n\n* `#[allow(missing_docs)]` on generated `EnumIter`s. ([#19][#19])\n\n\n\n[#18]: https://github.com/Peternator7/strum/pull/18\n\n[#19]: https://github.com/Peternator7/strum/issues/19\n\n[#23]: https://github.com/Peternator7/strum/issues/23\n","file_path":"CHANGELOG.md","rank":62,"score":4.016854093105081},{"content":"//! # Strum\n\n//!\n\n//! Strum is a set of macros and traits for working with\n\n//! enums and strings easier in Rust.\n\n//!\n\n\n\n#![recursion_limit = \"128\"]\n\n\n\nextern crate proc_macro;\n\n\n\nmod helpers;\n\nmod macros;\n\n\n\nuse proc_macro2::TokenStream;\n\nuse std::env;\n\nuse syn::DeriveInput;\n\n\n","file_path":"strum_macros/src/lib.rs","rank":63,"score":3.9899530339831513},{"content":"/// test `serialize_all` cooperation with other macroses\n\nuse std::str::FromStr;\n\nuse std::string::ToString;\n\nuse strum::{Display, EnumString, IntoStaticStr};\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumString, Display, IntoStaticStr)]\n\n#[strum(serialize_all = \"title_case\")]\n","file_path":"strum_tests/tests/serialize_all.rs","rank":64,"score":3.942400006855636},{"content":"//! ```rust\n\n//! use std::string::ToString;\n\n//! use strum;\n\n//! use strum_macros;\n\n//! \n\n//! #[derive(Debug, Eq, PartialEq, strum_macros::ToString)]\n\n//! #[strum(serialize_all = \"snake_case\")]\n\n//! enum Brightness {\n\n//! DarkBlack,\n\n//! Dim {\n\n//! glow: usize,\n\n//! },\n\n//! #[strum(serialize = \"bright\")]\n\n//! BrightWhite,\n\n//! }\n\n//! \n\n//! assert_eq!(\n\n//! String::from(\"dark_black\"),\n\n//! Brightness::DarkBlack.to_string().as_ref()\n\n//! );\n","file_path":"strum/src/additional_attributes.rs","rank":65,"score":3.720681047653657},{"content":"/// ```\n\n/// // You need to bring the ToString trait into scope to use it\n\n/// use std::string::ToString;\n\n/// use strum_macros::Display;\n\n///\n\n/// #[derive(Display, Debug)]\n\n/// enum Color {\n\n/// #[strum(serialize = \"redred\")]\n\n/// Red,\n\n/// Green {\n\n/// range: usize,\n\n/// },\n\n/// Blue(usize),\n\n/// Yellow,\n\n/// }\n\n///\n\n/// // uses the serialize string for Display\n\n/// let red = Color::Red;\n\n/// assert_eq!(String::from(\"redred\"), format!(\"{}\", red));\n\n/// // by default the variants Name\n\n/// let yellow = Color::Yellow;\n\n/// assert_eq!(String::from(\"Yellow\"), yellow.to_string());\n\n/// // or for string formatting\n\n/// println!(\n\n/// \"blue: {} green: {}\",\n\n/// Color::Blue(10),\n\n/// Color::Green { range: 42 }\n\n/// );\n\n/// ```\n","file_path":"strum_macros/src/lib.rs","rank":66,"score":3.6960259868153855},{"content":" if attrs.is_empty() {\n\n attrs.push(self.ident_as_str(case_style));\n\n }\n\n\n\n attrs\n\n }\n\n}\n\n\n\nimpl HasStrumVariantProperties for Variant {\n\n fn get_variant_properties(&self) -> syn::Result<StrumVariantProperties> {\n\n let mut output = StrumVariantProperties {\n\n ident: Some(self.ident.clone()),\n\n ..Default::default()\n\n };\n\n\n\n let mut message_kw = None;\n\n let mut detailed_message_kw = None;\n\n let mut to_string_kw = None;\n\n let mut disabled_kw = None;\n\n let mut default_kw = None;\n","file_path":"strum_macros/src/helpers/variant_props.rs","rank":67,"score":3.621069388564398},{"content":"use strum::EnumProperty;\n\n\n\n#[derive(Debug, EnumProperty)]\n","file_path":"strum_tests/tests/enum_props.rs","rank":68,"score":3.6088296058701004},{"content":"/// This trait designates that an `Enum` can be iterated over. It can\n\n/// be auto generated using `strum_macros` on your behalf.\n\n///\n\n/// # Example\n\n///\n\n/// ```rust\n\n/// # use std::fmt::Debug;\n\n/// // You need to bring the type into scope to use it!!!\n\n/// use strum::{EnumIter, IntoEnumIterator};\n\n///\n\n/// #[derive(EnumIter, Debug)]\n\n/// enum Color {\n\n/// Red,\n\n/// Green { range: usize },\n\n/// Blue(usize),\n\n/// Yellow,\n\n/// }\n\n///\n\n/// // Iterate over the items in an enum and perform some function on them.\n\n/// fn generic_iterator<E, F>(pred: F)\n\n/// where\n\n/// E: IntoEnumIterator,\n\n/// F: Fn(E),\n\n/// {\n\n/// for e in E::iter() {\n\n/// pred(e)\n\n/// }\n\n/// }\n\n///\n\n/// generic_iterator::<Color, _>(|color| println!(\"{:?}\", color));\n\n/// ```\n\npub trait IntoEnumIterator: Sized {\n\n type Iterator: Iterator<Item = Self>;\n\n\n\n fn iter() -> Self::Iterator;\n\n}\n\n\n","file_path":"strum/src/lib.rs","rank":69,"score":3.60538616970004},{"content":"#![allow(deprecated)]\n\n\n\nuse std::str::FromStr;\n\nuse strum::{AsRefStr, AsStaticRef, AsStaticStr, EnumString, IntoStaticStr};\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumString, AsRefStr, AsStaticStr, IntoStaticStr)]\n","file_path":"strum_tests/tests/as_ref_str.rs","rank":70,"score":3.5295686078312145},{"content":"use strum::FromRepr;\n\n\n\n#[derive(Debug, FromRepr, PartialEq)]\n\n#[repr(u8)]\n","file_path":"strum_tests/tests/from_repr.rs","rank":71,"score":3.4944582714166144},{"content":"/// Some(\"Variant zero\")\n\n/// );\n\n/// ```\n\n///\n\n/// It is also possible to specify the visibility (e.g. `pub`/`pub(crate)`/etc.)\n\n/// of the generated enum. By default, the generated enum inherits the\n\n/// visibility of the parent enum it was generated from.\n\n///\n\n/// ```nocompile\n\n/// use strum_macros::EnumDiscriminants;\n\n///\n\n/// // You can set the visibility of the generated enum using the `#[strum_discriminants(vis(..))]` attribute:\n\n/// mod inner {\n\n/// use strum_macros::EnumDiscriminants;\n\n///\n\n/// # #[allow(dead_code)]\n\n/// #[derive(Debug, EnumDiscriminants)]\n\n/// #[strum_discriminants(vis(pub))]\n\n/// #[strum_discriminants(name(PubDiscriminants))]\n\n/// enum PrivateEnum {\n","file_path":"strum_macros/src/lib.rs","rank":72,"score":3.4491136185537705},{"content":"use enum_variant_type::EnumVariantType;\n\nuse strum::{Display, EnumDiscriminants, EnumIter, EnumMessage, EnumString, IntoEnumIterator};\n\n\n\n#[allow(dead_code)]\n\n#[derive(Debug, Eq, PartialEq, EnumDiscriminants)]\n\n#[strum_discriminants(derive(EnumIter))]\n","file_path":"strum_tests/tests/enum_discriminants.rs","rank":73,"score":3.446817813193452},{"content":"use strum::EnumMessage;\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumMessage)]\n","file_path":"strum_tests/tests/enum_message.rs","rank":74,"score":3.439948698225949},{"content":"/// they will be set to their default values upon deserialization.\n\n///\n\n/// The `default` attribute can be applied to a tuple variant with a single data parameter. When a match isn't\n\n/// found, the given variant will be returned and the input string will be captured in the parameter.\n\n///\n\n/// Note that the implementation of `FromStr` by default only matches on the name of the\n\n/// variant. There is an option to match on different case conversions through the\n\n/// `#[strum(serialize_all = \"snake_case\")]` type attribute.\n\n///\n\n/// See the [Additional Attributes](https://docs.rs/strum/0.22/strum/additional_attributes/index.html)\n\n/// Section for more information on using this feature.\n\n///\n\n/// # Example howto use `EnumString`\n\n/// ```\n\n/// use std::str::FromStr;\n\n/// use strum_macros::EnumString;\n\n///\n\n/// #[derive(Debug, PartialEq, EnumString)]\n\n/// enum Color {\n\n/// Red,\n","file_path":"strum_macros/src/lib.rs","rank":75,"score":3.423481403070199},{"content":"use strum_macros::AsRefStr;\n\n\n\n#[derive(Debug, Eq, PartialEq, AsRefStr)]\n","file_path":"strum_tests/tests/as_ref_no_strum.rs","rank":76,"score":3.3871135800878664},{"content":"/// `EnumProperty` is a trait that makes it possible to store additional information\n\n/// with enum variants. This trait is designed to be used with the macro of the same\n\n/// name in the `strum_macros` crate. Currently, the only string literals are supported\n\n/// in attributes, the other methods will be implemented as additional attribute types\n\n/// become stabilized.\n\n///\n\n/// # Example\n\n///\n\n/// ```rust\n\n/// # use std::fmt::Debug;\n\n/// // You need to bring the type into scope to use it!!!\n\n/// use strum::EnumProperty;\n\n///\n\n/// #[derive(PartialEq, Eq, Debug, EnumProperty)]\n\n/// enum Class {\n\n/// #[strum(props(Teacher=\"Ms.Frizzle\", Room=\"201\"))]\n\n/// History,\n\n/// #[strum(props(Teacher=\"Mr.Smith\"))]\n\n/// #[strum(props(Room=\"103\"))]\n\n/// Mathematics,\n\n/// #[strum(props(Time=\"2:30\"))]\n\n/// Science,\n\n/// }\n\n///\n\n/// let history = Class::History;\n\n/// assert_eq!(\"Ms.Frizzle\", history.get_str(\"Teacher\").unwrap());\n\n/// ```\n\npub trait EnumProperty {\n\n fn get_str(&self, prop: &str) -> Option<&'static str>;\n\n fn get_int(&self, _prop: &str) -> Option<usize> {\n\n Option::None\n\n }\n\n\n\n fn get_bool(&self, _prop: &str) -> Option<bool> {\n\n Option::None\n\n }\n\n}\n\n\n\n/// A cheap reference-to-reference conversion. Used to convert a value to a\n\n/// reference value with `'static` lifetime within generic code.\n\n#[deprecated(\n\n since = \"0.22.0\",\n\n note = \"please use `#[derive(IntoStaticStr)]` instead\"\n\n)]\n","file_path":"strum/src/lib.rs","rank":77,"score":3.3455753846501626},{"content":"use strum::{EnumIter, IntoEnumIterator};\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumIter)]\n","file_path":"strum_tests/tests/enum_iter.rs","rank":78,"score":3.3358769288778465},{"content":"use strum::{Display, EnumString};\n\n\n\n#[derive(Debug, Eq, PartialEq, EnumString, Display)]\n","file_path":"strum_tests/tests/display.rs","rank":79,"score":3.3358769288778465},{"content":"/// Associates additional pieces of information with an Enum. This can be\n\n/// autoimplemented by deriving `EnumMessage` and annotating your variants with\n\n/// `#[strum(message=\"...\")]`.\n\n///\n\n/// # Example\n\n///\n\n/// ```rust\n\n/// # use std::fmt::Debug;\n\n/// // You need to bring the type into scope to use it!!!\n\n/// use strum::EnumMessage;\n\n///\n\n/// #[derive(PartialEq, Eq, Debug, EnumMessage)]\n\n/// enum Pet {\n\n/// #[strum(message=\"I have a dog\")]\n\n/// #[strum(detailed_message=\"My dog's name is Spots\")]\n\n/// Dog,\n\n/// /// I am documented.\n\n/// #[strum(message=\"I don't have a cat\")]\n\n/// Cat,\n\n/// }\n\n///\n\n/// let my_pet = Pet::Dog;\n\n/// assert_eq!(\"I have a dog\", my_pet.get_message().unwrap());\n\n/// ```\n\npub trait EnumMessage {\n\n fn get_message(&self) -> Option<&'static str>;\n\n fn get_detailed_message(&self) -> Option<&'static str>;\n\n fn get_documentation(&self) -> Option<&'static str>;\n\n fn get_serializations(&self) -> &'static [&'static str];\n\n}\n\n\n","file_path":"strum/src/lib.rs","rank":80,"score":3.311018356461323},{"content":"use strum::{EnumCount, EnumIter, IntoEnumIterator};\n\n\n\n#[derive(Debug, EnumCount, EnumIter)]\n","file_path":"strum_tests/tests/enum_count.rs","rank":81,"score":3.28616728582617},{"content":"//! If the whole enum is marked `ascii_case_insensitive`, you can specify `ascii_case_insensitive = false`\n\n//! to disable case insensitivity on this v ariant.\n\n//!\n\n//! - `message=\"..\"`: Adds a message to enum variant. This is used in conjunction with the `EnumMessage`\n\n//! trait to associate a message with a variant. If `detailed_message` is not provided,\n\n//! then `message` will also be returned when `get_detailed_message` is called.\n\n//!\n\n//! - `detailed_message=\"..\"`: Adds a more detailed message to a variant. If this value is omitted, then\n\n//! `message` will be used in it's place.\n\n//!\n\n//! - Structured documentation, as in `/// ...`: If using `EnumMessage`, is accessible via get_documentation().\n\n//!\n\n//! - `props(key=\"value\")`: Enables associating additional information with a given variant.\n","file_path":"strum/src/additional_attributes.rs","rank":82,"score":3.2620413755041615},{"content":"#![no_std]\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use core::str::FromStr;\n\n use strum::EnumString;\n\n\n\n #[derive(Debug, Eq, PartialEq, EnumString)]\n\n enum Color {\n\n Red,\n\n Blue {\n\n hue: usize,\n\n },\n\n #[strum(serialize = \"y\", serialize = \"yellow\")]\n\n Yellow,\n\n #[strum(to_string = \"purp\")]\n\n Purple,\n\n #[strum(serialize = \"blk\", serialize = \"Black\", ascii_case_insensitive)]\n\n Black,\n\n }\n","file_path":"strum_nostd_tests/src/lib.rs","rank":83,"score":3.2203166790979134},{"content":"///\n\n/// Note, the variant attributes passed to the discriminant enum are filtered to avoid compilation\n\n/// errors due to the derives mismatches, thus only `#[doc]`, `#[cfg]`, `#[allow]`, and `#[deny]`\n\n/// are passed through by default. If you want to specify a custom attribute on the discriminant\n\n/// variant, wrap it with `#[strum_discriminants(...)]` attribute.\n\n///\n\n/// ```\n\n/// // Bring trait into scope\n\n/// use std::str::FromStr;\n\n/// use strum::{IntoEnumIterator, EnumMessage};\n\n/// use strum_macros::{EnumDiscriminants, EnumIter, EnumString};\n\n///\n\n/// #[derive(Debug)]\n\n/// struct NonDefault;\n\n///\n\n/// // simple example\n\n/// # #[allow(dead_code)]\n\n/// #[derive(Debug, EnumDiscriminants)]\n\n/// #[strum_discriminants(derive(EnumString, EnumMessage))]\n\n/// enum MyEnum {\n","file_path":"strum_macros/src/lib.rs","rank":84,"score":3.2144922207329256},{"content":" documentation_arms\n\n .push(quote! { &#name::#ident #params => ::core::option::Option::Some(#text) });\n\n } else {\n\n // Push the documentation.\n\n documentation_arms\n\n .push(quote! {\n\n &#name::#ident #params => ::core::option::Option::Some(concat!(#(concat!(#documentation, \"\\n\")),*))\n\n });\n\n }\n\n }\n\n }\n\n\n\n if arms.len() < variants.len() {\n\n arms.push(quote! { _ => ::core::option::Option::None });\n\n }\n\n\n\n if detailed_arms.len() < variants.len() {\n\n detailed_arms.push(quote! { _ => ::core::option::Option::None });\n\n }\n\n\n","file_path":"strum_macros/src/macros/enum_messages.rs","rank":85,"score":3.1493953167591204},{"content":" quote! { { .. } }\n\n }\n\n };\n\n\n\n quote! { #name::#ident #params => #discriminants_name::#ident }\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n let from_fn_body = quote! { match val { #(#arms),* } };\n\n\n\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\n\n let impl_from = quote! {\n\n impl #impl_generics ::core::convert::From< #name #ty_generics > for #discriminants_name #where_clause {\n\n fn from(val: #name #ty_generics) -> #discriminants_name {\n\n #from_fn_body\n\n }\n\n }\n\n };\n\n let impl_from_ref = {\n\n let mut generics = ast.generics.clone();\n","file_path":"strum_macros/src/macros/enum_discriminants.rs","rank":86,"score":3.0851039949304178},{"content":"///\n\n/// use strum_macros;\n\n/// // bring the trait into scope\n\n/// use strum::EnumProperty;\n\n///\n\n/// #[derive(strum_macros::EnumProperty, Debug)]\n\n/// #[allow(dead_code)]\n\n/// enum Color {\n\n/// #[strum(props(Red = \"255\", Blue = \"255\", Green = \"255\"))]\n\n/// White,\n\n/// #[strum(props(Red = \"0\", Blue = \"0\", Green = \"0\"))]\n\n/// Black,\n\n/// #[strum(props(Red = \"0\", Blue = \"255\", Green = \"0\"))]\n\n/// Blue,\n\n/// #[strum(props(Red = \"255\", Blue = \"0\", Green = \"0\"))]\n\n/// Red,\n\n/// #[strum(props(Red = \"0\", Blue = \"0\", Green = \"255\"))]\n\n/// Green,\n\n/// }\n\n///\n","file_path":"strum_macros/src/lib.rs","rank":87,"score":3.0637288823358952},{"content":"/// enum Color {\n\n/// #[strum(serialize = \"redred\")]\n\n/// Red,\n\n/// Green {\n\n/// range: usize,\n\n/// },\n\n/// Blue(usize),\n\n/// Yellow,\n\n/// }\n\n///\n\n/// // uses the serialize string for Display\n\n/// let red = Color::Red;\n\n/// assert_eq!(String::from(\"redred\"), red.to_string());\n\n/// // by default the variants Name\n\n/// let yellow = Color::Yellow;\n\n/// assert_eq!(String::from(\"Yellow\"), yellow.to_string());\n\n/// ```\n\n#[deprecated(\n\n since = \"0.22.0\",\n\n note = \"please use `#[derive(Display)]` instead. See issue https://github.com/Peternator7/strum/issues/132\"\n\n)]\n","file_path":"strum_macros/src/lib.rs","rank":88,"score":3.0217481936412454},{"content":" let mut pascal = String::with_capacity(camel_case.len());\n\n let mut it = camel_case.chars();\n\n if let Some(ch) = it.next() {\n\n pascal.extend(ch.to_lowercase());\n\n }\n\n pascal.extend(it);\n\n pascal\n\n }\n\n }\n\n } else {\n\n ident_string\n\n }\n\n }\n\n}\n\n\n","file_path":"strum_macros/src/helpers/case_style.rs","rank":89,"score":3.0182422113061},{"content":" ATTRIBUTES_TO_COPY\n\n .iter()\n\n .any(|attr_whitelisted| attr.path.is_ident(attr_whitelisted))\n\n })\n\n .map(|attr| {\n\n if attr.path.is_ident(\"strum_discriminants\") {\n\n let passthrough_group = attr\n\n .tokens\n\n .clone()\n\n .into_iter()\n\n .next()\n\n .ok_or_else(|| strum_discriminants_passthrough_error(attr))?;\n\n let passthrough_attribute = match passthrough_group {\n\n TokenTree::Group(ref group) => group.stream(),\n\n _ => {\n\n return Err(strum_discriminants_passthrough_error(&passthrough_group));\n\n }\n\n };\n\n if passthrough_attribute.is_empty() {\n\n return Err(strum_discriminants_passthrough_error(&passthrough_group));\n","file_path":"strum_macros/src/macros/enum_discriminants.rs","rank":90,"score":2.9448346165109585},{"content":"\n\n let discriminants_name = type_properties.discriminant_name.unwrap_or(default_name);\n\n let discriminants_vis = type_properties\n\n .discriminant_vis\n\n .unwrap_or_else(|| vis.clone());\n\n\n\n // Pass through all other attributes\n\n let pass_though_attributes = type_properties.discriminant_others;\n\n\n\n // Add the variants without fields, but exclude the `strum` meta item\n\n let mut discriminants = Vec::new();\n\n for variant in variants {\n\n let ident = &variant.ident;\n\n\n\n // Don't copy across the \"strum\" meta attribute. Only passthrough the whitelisted\n\n // attributes and proxy `#[strum_discriminants(...)]` attributes\n\n let attrs = variant\n\n .attrs\n\n .iter()\n\n .filter(|attr| {\n","file_path":"strum_macros/src/macros/enum_discriminants.rs","rank":91,"score":2.9258306520418325},{"content":"/// the variants, the `from_repr` function is marked `const`. rustc >= 1.46 is required\n\n/// to allow `match` statements in `const fn`. The no additional data requirement is due to the\n\n/// inability to use `Default::default()` in a `const fn`.\n\n///\n\n/// You cannot derive `FromRepr` on any type with a lifetime bound (`<'a>`) because the function would surely\n\n/// create [unbounded lifetimes](https://doc.rust-lang.org/nightly/nomicon/unbounded-lifetimes.html).\n\n///\n\n/// ```\n\n///\n\n/// use strum_macros::FromRepr;\n\n///\n\n/// #[derive(FromRepr, Debug, PartialEq)]\n\n/// enum Color {\n\n/// Red,\n\n/// Green { range: usize },\n\n/// Blue(usize),\n\n/// Yellow,\n\n/// }\n\n///\n\n/// assert_eq!(Some(Color::Red), Color::from_repr(0));\n","file_path":"strum_macros/src/lib.rs","rank":92,"score":2.9024364474308255},{"content":"use strum::{Display, EnumCount, EnumDiscriminants, EnumString};\n\n\n\n#[allow(dead_code)]\n\n#[derive(Debug, Eq, PartialEq, EnumString, Display, EnumCount, EnumDiscriminants)]\n","file_path":"strum_tests/src/main.rs","rank":93,"score":2.8599858661558915},{"content":"//! # Documentation for Additional Attributes\n\n//!\n\n//! ## Attributes on Enums\n\n//!\n\n//! Strum supports several custom attributes to modify the generated code. At the enum level, the following attributes are supported:\n\n//!\n\n//! - `#[strum(serialize_all = \"case_style\")]` attribute can be used to change the case used when serializing to and deserializing\n\n//! from strings. This feature is enabled by [withoutboats/heck](https://github.com/withoutboats/heck) and supported case styles are:\n\n//!\n\n//! - `camelCase`\n\n//! - `PascalCase`\n\n//! - `kebab-case`\n\n//! - `snake_case`\n\n//! - `SCREAMING_SNAKE_CASE`\n\n//! - `SCREAMING-KEBAB-CASE`\n\n//! - `lowercase`\n\n//! - `UPPERCASE`\n\n//! - `title_case`\n\n//! - `mixed_case`\n\n//!\n","file_path":"strum/src/additional_attributes.rs","rank":94,"score":2.8279954175112656},{"content":"/// // test rename example combined with EnumIter\n\n/// assert_eq!(\n\n/// vec![MyVariants::Variant0, MyVariants::Variant1],\n\n/// MyVariants::iter().collect::<Vec<_>>()\n\n/// );\n\n///\n\n/// // Make use of the auto-From conversion to check whether an instance of `MyEnum` matches a\n\n/// // `MyEnumDiscriminants` discriminant.\n\n/// assert_eq!(\n\n/// MyEnumDiscriminants::Variant0,\n\n/// MyEnum::Variant0(NonDefault).into()\n\n/// );\n\n/// assert_eq!(\n\n/// MyEnumDiscriminants::Variant0,\n\n/// MyEnumDiscriminants::from(MyEnum::Variant0(NonDefault))\n\n/// );\n\n///\n\n/// // Make use of the EnumMessage on the `MyEnumDiscriminants` discriminant.\n\n/// assert_eq!(\n\n/// MyEnumDiscriminants::Variant0.get_message(),\n","file_path":"strum_macros/src/lib.rs","rank":95,"score":2.809977998350061},{"content":" #[allow(clippy::use_self)]\n\n impl #impl_generics #name #ty_generics #where_clause {\n\n #[doc = \"Try to create [Self] from the raw representation\"]\n\n #vis #const_if_possible fn from_repr(discriminant: #discriminant_type) -> Option<#name #ty_generics> {\n\n #(#constant_defs)*\n\n match discriminant {\n\n #(#arms),*\n\n }\n\n }\n\n }\n\n })\n\n}\n","file_path":"strum_macros/src/macros/from_repr.rs","rank":96,"score":2.6219575923964515},{"content":"\n\n #[test]\n\n fn from_str_no_std() {\n\n assert_eq!(Color::Yellow, Color::from_str(\"yellow\").unwrap());\n\n }\n\n\n\n #[test]\n\n #[rustversion::since(1.34)]\n\n fn try_from_str_no_std() {\n\n use core::convert::TryFrom;\n\n assert_eq!(Color::Yellow, Color::try_from(\"yellow\").unwrap());\n\n }\n\n\n\n #[test]\n\n #[rustversion::before(1.34)]\n\n fn try_from_str_no_std() {}\n\n}\n","file_path":"strum_nostd_tests/src/lib.rs","rank":97,"score":2.6219575923964515},{"content":" });\n\n }\n\n\n\n // But you can disable the messages.\n\n if variant_properties.disabled.is_some() {\n\n continue;\n\n }\n\n\n\n if let Some(msg) = messages {\n\n let params = params.clone();\n\n\n\n // Push the simple message.\n\n let tokens = quote! { &#name::#ident #params => ::core::option::Option::Some(#msg) };\n\n arms.push(tokens.clone());\n\n\n\n if detailed_messages.is_none() {\n\n detailed_arms.push(tokens);\n\n }\n\n }\n\n\n","file_path":"strum_macros/src/macros/enum_messages.rs","rank":98,"score":2.5729082193935606},{"content":"# Changelog\n\n\n\n## 0.23.1\n\n\n\n* [#193](https://github.com/Peternator7/strum/pull/193) Fixes an ambiguity introduced by #186 when your enum has a variant called Error.\n\n\n\n* [#192](https://github.com/Peternator7/strum/pull/192) The work done in #189 was lost in other PR's. This re-added the functionality to support no-std.\n\n\n\n## 0.23.0\n\n\n\n* [#185](https://github.com/Peternator7/strum/pull/185) Adds the `FromRepr` derive that adds a `from_repr(x: usize) -> Option<Self>`\n\n method to your enum. This lets you convert integer values to your enum. If you specify a #[repr(..)] attribute on your enum, or use\n\n an explicit discriminant, this will be incorporated into the derive.\n\n * `from_repr` will be `const` if you use a recent rust version.\n\n * This cannot be a trait method currently because only inherent methods support `const`.\n\n\n\n* [#186](https://github.com/Peternator7/strum/pull/186) Automatically implement `TryFrom<str>` for enums that implement `EnumString`.\n\n This is only enabled for rustc >= 1.34 which is when `TryFrom was stabilized.\n\n * This is a small breaking change. If you had manually implemented `TryFrom<str>` for your enum, this will cause a conflict. You\n\n can probably remove your manual implementation.\n\n\n\n* [#189](https://github.com/Peternator7/strum/pull/189) Use `core::result::Result` instead of `std::result::Result`. This should be\n\n more portable in no-std environments.\n\n\n\n## 0.22.0\n\n\n\n* [#180](https://github.com/Peternator7/strum/pull/180): Deprecates `ToString` derive. You should use `Display`\n\n instead.\n\n\n\n* [#178](https://github.com/Peternator7/strum/pull/178): Deprecates AsStaticStr. This has been undocumented for a while.\n\n The recommended method is to derive `IntoStaticStr` instead.\n\n\n\n* [#171](https://github.com/Peternator7/strum/pull/171): Improve `no-std` support. \n\n\n\n* [#170](https://github.com/Peternator7/strum/pull/170): enable changing the path to strum traits. This is necessary\n\n if you re-export strum as a submodule in another crate.\n\n\n","file_path":"CHANGELOG.md","rank":99,"score":2.4801678284423962}],"string":"[\n {\n \"content\": \"struct Prop(Ident, LitStr);\\n\\n\\n\\nimpl Parse for Prop {\\n\\n fn parse(input: ParseStream) -> syn::Result<Self> {\\n\\n use syn::ext::IdentExt;\\n\\n\\n\\n let k = Ident::parse_any(input)?;\\n\\n let _: Token![=] = input.parse()?;\\n\\n let v = input.parse()?;\\n\\n\\n\\n Ok(Prop(k, v))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Spanned for VariantMeta {\\n\\n fn span(&self) -> Span {\\n\\n match self {\\n\\n VariantMeta::Message { kw, .. } => kw.span,\\n\\n VariantMeta::DetailedMessage { kw, .. } => kw.span,\\n\\n VariantMeta::Documentation { value } => value.span(),\\n\\n VariantMeta::Serialize { kw, .. } => kw.span,\\n\\n VariantMeta::ToString { kw, .. } => kw.span,\\n\\n VariantMeta::Disabled(kw) => kw.span,\\n\\n VariantMeta::Default(kw) => kw.span,\\n\\n VariantMeta::AsciiCaseInsensitive { kw, .. } => kw.span,\\n\\n VariantMeta::Props { kw, .. } => kw.span,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/helpers/metadata.rs\",\n \"rank\": 0,\n \"score\": 58699.21703490926\n },\n {\n \"content\": \"fn debug_print_generated(ast: &DeriveInput, toks: &TokenStream) {\\n\\n let debug = env::var(\\\"STRUM_DEBUG\\\");\\n\\n if let Ok(s) = debug {\\n\\n if s == \\\"1\\\" {\\n\\n println!(\\\"{}\\\", toks);\\n\\n }\\n\\n\\n\\n if ast.ident == s {\\n\\n println!(\\\"{}\\\", toks);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Converts strings to enum variants based on their name.\\n\\n///\\n\\n/// auto-derives `std::str::FromStr` on the enum (for Rust 1.34 and above, `std::convert::TryFrom<&str>`\\n\\n/// will be derived as well). Each variant of the enum will match on it's own name.\\n\\n/// This can be overridden using `serialize=\\\"DifferentName\\\"` or `to_string=\\\"DifferentName\\\"`\\n\\n/// on the attribute as shown below.\\n\\n/// Multiple deserializations can be added to the same variant. If the variant contains additional data,\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 1,\n \"score\": 46054.072262638\n },\n {\n \"content\": \"pub fn from_repr_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let gen = &ast.generics;\\n\\n let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();\\n\\n let vis = &ast.vis;\\n\\n let attrs = &ast.attrs;\\n\\n\\n\\n let mut discriminant_type: Type = syn::parse(\\\"usize\\\".parse().unwrap()).unwrap();\\n\\n for attr in attrs {\\n\\n let path = &attr.path;\\n\\n let tokens = &attr.tokens;\\n\\n if path.leading_colon.is_some() {\\n\\n continue;\\n\\n }\\n\\n if path.segments.len() != 1 {\\n\\n continue;\\n\\n }\\n\\n let segment = path.segments.first().unwrap();\\n\\n if segment.ident != \\\"repr\\\" {\\n\\n continue;\\n\",\n \"file_path\": \"strum_macros/src/macros/from_repr.rs\",\n \"rank\": 2,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn display_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n\\n\\n let mut arms = Vec::new();\\n\\n for variant in variants {\\n\\n let ident = &variant.ident;\\n\\n let variant_properties = variant.get_variant_properties()?;\\n\\n\\n\\n if variant_properties.disabled.is_some() {\\n\\n continue;\\n\\n }\\n\\n\\n\\n // Look at all the serialize attributes.\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/display.rs\",\n \"rank\": 3,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"fn get_arms(ast: &DeriveInput) -> syn::Result<Vec<TokenStream>> {\\n\\n let name = &ast.ident;\\n\\n let mut arms = Vec::new();\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n\\n\\n for variant in variants {\\n\\n let ident = &variant.ident;\\n\\n let variant_properties = variant.get_variant_properties()?;\\n\\n\\n\\n if variant_properties.disabled.is_some() {\\n\\n continue;\\n\\n }\\n\\n\\n\\n // Look at all the serialize attributes.\\n\\n // Use `to_string` attribute (not `as_ref_str` or something) to keep things consistent\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/as_ref_str.rs\",\n \"rank\": 5,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn enum_discriminants_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let vis = &ast.vis;\\n\\n\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n // Derives for the generated enum\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n\\n\\n let derives = type_properties.discriminant_derives;\\n\\n\\n\\n let derives = quote! {\\n\\n #[derive(Clone, Copy, Debug, PartialEq, Eq, #(#derives),*)]\\n\\n };\\n\\n\\n\\n // Work out the name\\n\\n let default_name = syn::Ident::new(&format!(\\\"{}Discriminants\\\", name), Span::call_site());\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_discriminants.rs\",\n \"rank\": 6,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn enum_properties_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n let strum_module_path = type_properties.crate_module_path();\\n\\n\\n\\n let mut arms = Vec::new();\\n\\n for variant in variants {\\n\\n let ident = &variant.ident;\\n\\n let variant_properties = variant.get_variant_properties()?;\\n\\n let mut string_arms = Vec::new();\\n\\n let mut bool_arms = Vec::new();\\n\\n let mut num_arms = Vec::new();\\n\\n // But you can disable the messages.\\n\\n if variant_properties.disabled.is_some() {\\n\\n continue;\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_properties.rs\",\n \"rank\": 7,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn from_string_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n let strum_module_path = type_properties.crate_module_path();\\n\\n\\n\\n let mut default_kw = None;\\n\\n let mut default = quote! { _ => ::core::result::Result::Err(#strum_module_path::ParseError::VariantNotFound) };\\n\\n let mut arms = Vec::new();\\n\\n for variant in variants {\\n\\n let ident = &variant.ident;\\n\\n let variant_properties = variant.get_variant_properties()?;\\n\\n\\n\\n if variant_properties.disabled.is_some() {\\n\\n continue;\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/from_string.rs\",\n \"rank\": 8,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn to_string_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n let mut arms = Vec::new();\\n\\n for variant in variants {\\n\\n let ident = &variant.ident;\\n\\n let variant_properties = variant.get_variant_properties()?;\\n\\n\\n\\n if variant_properties.disabled.is_some() {\\n\\n continue;\\n\\n }\\n\\n\\n\\n // Look at all the serialize attributes.\\n\\n let output = variant_properties.get_preferred_name(type_properties.case_style);\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/to_string.rs\",\n \"rank\": 9,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn enum_variant_names_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let gen = &ast.generics;\\n\\n let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();\\n\\n\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n // Derives for the generated enum\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n let strum_module_path = type_properties.crate_module_path();\\n\\n\\n\\n let names = variants\\n\\n .iter()\\n\\n .map(|v| {\\n\\n let props = v.get_variant_properties()?;\\n\\n Ok(props.get_preferred_name(type_properties.case_style))\\n\\n })\\n\\n .collect::<syn::Result<Vec<_>>>()?;\\n\\n\\n\\n Ok(quote! {\\n\\n impl #impl_generics #strum_module_path::VariantNames for #name #ty_generics #where_clause {\\n\\n const VARIANTS: &'static [&'static str] = &[ #(#names),* ];\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_variant_names.rs\",\n \"rank\": 10,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn enum_message_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let variants = match &ast.data {\\n\\n Data::Enum(v) => &v.variants,\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n let strum_module_path = type_properties.crate_module_path();\\n\\n\\n\\n let mut arms = Vec::new();\\n\\n let mut detailed_arms = Vec::new();\\n\\n let mut documentation_arms = Vec::new();\\n\\n let mut serializations = Vec::new();\\n\\n\\n\\n for variant in variants {\\n\\n let variant_properties = variant.get_variant_properties()?;\\n\\n let messages = variant_properties.message.as_ref();\\n\\n let detailed_messages = variant_properties.detailed_message.as_ref();\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_messages.rs\",\n \"rank\": 11,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"pub fn as_ref_str_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let name = &ast.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let arms = get_arms(ast)?;\\n\\n Ok(quote! {\\n\\n impl #impl_generics ::core::convert::AsRef<str> for #name #ty_generics #where_clause {\\n\\n fn as_ref(&self) -> &str {\\n\\n match *self {\\n\\n #(#arms),*\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\\npub enum GenerateTraitVariant {\\n\\n AsStaticStr,\\n\\n From,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/as_ref_str.rs\",\n \"rank\": 12,\n \"score\": 40511.391489987865\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\n#[derive(Debug, EnumDiscriminants)]\\n\\n#[strum_discriminants(derive(EnumIter))]\\n\\nenum WithFields {\\n\\n Variant0(NonDefault),\\n\\n Variant1 { a: NonDefault },\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum_tests/tests/enum_discriminants.rs\",\n \"rank\": 13,\n \"score\": 34144.904862710544\n },\n {\n \"content\": \"#[test]\\n\\nfn fields_test() {\\n\\n let discriminants = WithFieldsDiscriminants::iter().collect::<Vec<_>>();\\n\\n let expected = vec![\\n\\n WithFieldsDiscriminants::Variant0,\\n\\n WithFieldsDiscriminants::Variant1,\\n\\n ];\\n\\n\\n\\n assert_eq!(expected, discriminants);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum_tests/tests/enum_discriminants.rs\",\n \"rank\": 14,\n \"score\": 33195.177709361546\n },\n {\n \"content\": \"#[proc_macro_derive(EnumString, attributes(strum))]\\n\\npub fn from_string(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks =\\n\\n macros::from_string::from_string_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Converts enum variants to `&'static str`.\\n\\n///\\n\\n/// Implements `AsRef<str>` on your enum using the same rules as\\n\\n/// `Display` for determining what string is returned. The difference is that `as_ref()` returns\\n\\n/// a `&str` instead of a `String` so you don't allocate any additional memory with each call.\\n\\n///\\n\\n/// ```\\n\\n/// // You need to bring the AsRef trait into scope to use it\\n\\n/// use std::convert::AsRef;\\n\\n/// use strum_macros::AsRefStr;\\n\\n///\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 15,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(ToString, attributes(strum))]\\n\\npub fn to_string(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks =\\n\\n macros::to_string::to_string_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Converts enum variants to strings.\\n\\n///\\n\\n/// Deriving `Display` on an enum prints out the given enum. This enables you to perform round\\n\\n/// trip style conversions from enum into string and back again for unit style variants. `Display`\\n\\n/// choose which serialization to used based on the following criteria:\\n\\n///\\n\\n/// 1. If there is a `to_string` property, this value will be used. There can only be one per variant.\\n\\n/// 1. Of the various `serialize` properties, the value with the longest length is chosen. If that\\n\\n/// behavior isn't desired, you should use `to_string`.\\n\\n/// 1. The name of the variant will be used if there are no `serialize` or `to_string` attributes.\\n\\n///\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 16,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(EnumDiscriminants, attributes(strum, strum_discriminants))]\\n\\npub fn enum_discriminants(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::enum_discriminants::enum_discriminants_inner(&ast)\\n\\n .unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Add a constant `usize` equal to the number of variants.\\n\\n///\\n\\n/// For a given enum generates implementation of `strum::EnumCount`,\\n\\n/// which adds a static property `COUNT` of type usize that holds the number of variants.\\n\\n///\\n\\n/// ```\\n\\n/// use strum::{EnumCount, IntoEnumIterator};\\n\\n/// use strum_macros::{EnumCount as EnumCountMacro, EnumIter};\\n\\n///\\n\\n/// #[derive(Debug, EnumCountMacro, EnumIter)]\\n\\n/// enum Week {\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 17,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(EnumProperty, attributes(strum))]\\n\\npub fn enum_properties(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::enum_properties::enum_properties_inner(&ast)\\n\\n .unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Generate a new type with only the discriminant names.\\n\\n///\\n\\n/// Given an enum named `MyEnum`, generates another enum called `MyEnumDiscriminants` with the same\\n\\n/// variants but without any data fields. This is useful when you wish to determine the variant of\\n\\n/// an `enum` but one or more of the variants contains a non-`Default` field. `From`\\n\\n/// implementations are generated so that you can easily convert from `MyEnum` to\\n\\n/// `MyEnumDiscriminants`.\\n\\n///\\n\\n/// By default, the generated enum has the following derives: `Clone, Copy, Debug, PartialEq, Eq`.\\n\\n/// You can add additional derives using the `#[strum_discriminants(derive(AdditionalDerive))]`\\n\\n/// attribute.\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 18,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(EnumMessage, attributes(strum))]\\n\\npub fn enum_messages(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::enum_messages::enum_message_inner(&ast)\\n\\n .unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Add custom properties to enum variants.\\n\\n///\\n\\n/// Enables the encoding of arbitary constants into enum variants. This method\\n\\n/// currently only supports adding additional string values. Other types of literals are still\\n\\n/// experimental in the rustc compiler. The generated code works by nesting match statements.\\n\\n/// The first match statement matches on the type of the enum, and the inner match statement\\n\\n/// matches on the name of the property requested. This design works well for enums with a small\\n\\n/// number of variants and properties, but scales linearly with the number of variants so may not\\n\\n/// be the best choice in all situations.\\n\\n///\\n\\n/// ```\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 19,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"pub fn as_static_str(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::as_ref_str::as_static_str_inner(\\n\\n &ast,\\n\\n ¯os::as_ref_str::GenerateTraitVariant::AsStaticStr,\\n\\n )\\n\\n .unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Implements `From<MyEnum> for &'static str` on an enum.\\n\\n///\\n\\n/// Implements `From<YourEnum>` and `From<&'a YourEnum>` for `&'static str`. This is\\n\\n/// useful for turning an enum variant into a static string.\\n\\n/// The Rust `std` provides a blanket impl of the reverse direction - i.e. `impl Into<&'static str> for YourEnum`.\\n\\n///\\n\\n/// ```\\n\\n/// use strum_macros::IntoStaticStr;\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 20,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(FromRepr, attributes(strum))]\\n\\npub fn from_repr(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks =\\n\\n macros::from_repr::from_repr_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Add a verbose message to an enum variant.\\n\\n///\\n\\n/// Encode strings into the enum itself. The `strum_macros::EmumMessage` macro implements the `strum::EnumMessage` trait.\\n\\n/// `EnumMessage` looks for `#[strum(message=\\\"...\\\")]` attributes on your variants.\\n\\n/// You can also provided a `detailed_message=\\\"...\\\"` attribute to create a seperate more detailed message than the first.\\n\\n/// ```\\n\\n/// // You need to bring the trait into scope to use it\\n\\n/// use strum::EnumMessage;\\n\\n/// use strum_macros;\\n\\n///\\n\\n/// #[derive(strum_macros::EnumMessage, Debug)]\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 21,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(AsRefStr, attributes(strum))]\\n\\npub fn as_ref_str(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks =\\n\\n macros::as_ref_str::as_ref_str_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Implements `Strum::VariantNames` which adds an associated constant `VARIANTS` which is an array of discriminant names.\\n\\n///\\n\\n/// Adds an `impl` block for the `enum` that adds a static `VARIANTS` array of `&'static str` that are the discriminant names.\\n\\n/// This will respect the `serialize_all` attribute on the `enum` (like `#[strum(serialize_all = \\\"snake_case\\\")]`.\\n\\n///\\n\\n/// ```\\n\\n/// // import the macros needed\\n\\n/// use strum_macros::{EnumString, EnumVariantNames};\\n\\n/// // You need to import the trait, to have access to VARIANTS\\n\\n/// use strum::VariantNames;\\n\\n///\\n\\n/// #[derive(Debug, EnumString, EnumVariantNames)]\\n\\n/// #[strum(serialize_all = \\\"kebab_case\\\")]\\n\\n/// enum Color {\\n\\n/// Red,\\n\\n/// Blue,\\n\\n/// Yellow,\\n\\n/// RebeccaPurple,\\n\\n/// }\\n\\n/// assert_eq!([\\\"red\\\", \\\"blue\\\", \\\"yellow\\\", \\\"rebecca-purple\\\"], Color::VARIANTS);\\n\\n/// ```\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 22,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(EnumIter, attributes(strum))]\\n\\npub fn enum_iter(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks =\\n\\n macros::enum_iter::enum_iter_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Add a function to enum that allows accessing variants by its discriminant\\n\\n///\\n\\n/// This macro adds a standalone function to obtain an enum variant by its discriminant. The macro adds\\n\\n/// `from_repr(discriminant: usize) -> Option<YourEnum>` as a standalone function on the enum. For\\n\\n/// variants with additional data, the returned variant will use the `Default` trait to fill the\\n\\n/// data. The discriminant follows the same rules as `rustc`. The first discriminant is zero and each\\n\\n/// successive variant has a discriminant of one greater than the previous variant, expect where an\\n\\n/// explicit discriminant is specified. The type of the discriminant will match the `repr` type if\\n\\n/// it is specifed.\\n\\n///\\n\\n/// When the macro is applied using rustc >= 1.46 and when there is no additional data on any of\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 23,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(EnumVariantNames, attributes(strum))]\\n\\npub fn variant_names(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::enum_variant_names::enum_variant_names_inner(&ast)\\n\\n .unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n#[proc_macro_derive(AsStaticStr, attributes(strum))]\\n\\n#[deprecated(\\n\\n since = \\\"0.22.0\\\",\\n\\n note = \\\"please use `#[derive(IntoStaticStr)]` instead\\\"\\n\\n)]\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 24,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(Display, attributes(strum))]\\n\\npub fn display(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::display::display_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// Creates a new type that iterates of the variants of an enum.\\n\\n///\\n\\n/// Iterate over the variants of an Enum. Any additional data on your variants will be set to `Default::default()`.\\n\\n/// The macro implements `strum::IntoEnumIter` on your enum and creates a new type called `YourEnumIter` that is the iterator object.\\n\\n/// You cannot derive `EnumIter` on any type with a lifetime bound (`<'a>`) because the iterator would surely\\n\\n/// create [unbounded lifetimes](https://doc.rust-lang.org/nightly/nomicon/unbounded-lifetimes.html).\\n\\n///\\n\\n/// ```\\n\\n///\\n\\n/// // You need to bring the trait into scope to use it!\\n\\n/// use strum::IntoEnumIterator;\\n\\n/// use strum_macros::EnumIter;\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 25,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(EnumCount, attributes(strum))]\\n\\npub fn enum_count(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n let toks =\\n\\n macros::enum_count::enum_count_inner(&ast).unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 26,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"#[proc_macro_derive(IntoStaticStr, attributes(strum))]\\n\\npub fn into_static_str(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n let ast = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let toks = macros::as_ref_str::as_static_str_inner(\\n\\n &ast,\\n\\n ¯os::as_ref_str::GenerateTraitVariant::From,\\n\\n )\\n\\n .unwrap_or_else(|err| err.to_compile_error());\\n\\n debug_print_generated(&ast, &toks);\\n\\n toks.into()\\n\\n}\\n\\n\\n\\n/// implements `std::string::ToString` on en enum\\n\\n///\\n\\n/// ```\\n\\n/// // You need to bring the ToString trait into scope to use it\\n\\n/// use std::string::ToString;\\n\\n/// use strum_macros;\\n\\n///\\n\\n/// #[derive(strum_macros::ToString, Debug)]\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 27,\n \"score\": 28727.6670043459\n },\n {\n \"content\": \"use heck::ToShoutySnakeCase;\\n\\nuse proc_macro2::{Span, TokenStream};\\n\\nuse quote::{format_ident, quote};\\n\\nuse syn::{Data, DeriveInput, Fields, PathArguments, Type, TypeParen};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/from_repr.rs\",\n \"rank\": 29,\n \"score\": 9.472179410790037\n },\n {\n \"content\": \" // See <https://github.com/dtolnay/syn/issues/433>\\n\\n // ---\\n\\n // let is_copy = unique_meta_list(type_meta.iter(), \\\"derive\\\")\\n\\n // .map(extract_list_metas)\\n\\n // .map(|metas| {\\n\\n // metas\\n\\n // .filter_map(get_meta_ident)\\n\\n // .any(|derive| derive.to_string() == \\\"Copy\\\")\\n\\n // }).unwrap_or(false);\\n\\n\\n\\n let arms = variants\\n\\n .iter()\\n\\n .map(|variant| {\\n\\n let ident = &variant.ident;\\n\\n let params = match &variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(_fields) => {\\n\\n quote! { (..) }\\n\\n }\\n\\n Fields::Named(_fields) => {\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_discriminants.rs\",\n \"rank\": 30,\n \"score\": 7.820751861969361\n },\n {\n \"content\": \"\\n\\n let params = match variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(..) => quote! { (..) },\\n\\n Fields::Named(..) => quote! { {..} },\\n\\n };\\n\\n\\n\\n arms.push(quote! { #name::#ident #params => ::std::string::String::from(#output) });\\n\\n }\\n\\n\\n\\n if arms.len() < variants.len() {\\n\\n arms.push(quote! { _ => panic!(\\\"to_string() called on disabled variant.\\\") });\\n\\n }\\n\\n\\n\\n Ok(quote! {\\n\\n #[allow(clippy::use_self)]\\n\\n impl #impl_generics ::std::string::ToString for #name #ty_generics #where_clause {\\n\\n fn to_string(&self) -> ::std::string::String {\\n\\n match *self {\\n\\n #(#arms),*\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/to_string.rs\",\n \"rank\": 31,\n \"score\": 7.631615600285128\n },\n {\n \"content\": \" let documentation = &variant_properties.documentation;\\n\\n let ident = &variant.ident;\\n\\n\\n\\n let params = match variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(..) => quote! { (..) },\\n\\n Fields::Named(..) => quote! { {..} },\\n\\n };\\n\\n\\n\\n // You can't disable getting the serializations.\\n\\n {\\n\\n let serialization_variants =\\n\\n variant_properties.get_serializations(type_properties.case_style);\\n\\n\\n\\n let count = serialization_variants.len();\\n\\n serializations.push(quote! {\\n\\n &#name::#ident #params => {\\n\\n static ARR: [&'static str; #count] = [#(#serialization_variants),*];\\n\\n &ARR\\n\\n }\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_messages.rs\",\n \"rank\": 32,\n \"score\": 7.345284776188693\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput, Fields};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_properties.rs\",\n \"rank\": 33,\n \"score\": 7.31824640206011\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput, Fields};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/to_string.rs\",\n \"rank\": 34,\n \"score\": 7.31824640206011\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput, Fields};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/display.rs\",\n \"rank\": 35,\n \"score\": 7.31824640206011\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{parse_quote, Data, DeriveInput, Fields};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/as_ref_str.rs\",\n \"rank\": 36,\n \"score\": 7.201904838279564\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput, Fields, LitStr};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_messages.rs\",\n \"rank\": 37,\n \"score\": 7.201904838279564\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput, Fields};\\n\\n\\n\\nuse crate::helpers::{\\n\\n non_enum_error, occurrence_error, HasStrumVariantProperties, HasTypeProperties,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/from_string.rs\",\n \"rank\": 38,\n \"score\": 7.201904838279564\n },\n {\n \"content\": \" let mut prev_const_var_ident = None;\\n\\n for variant in variants {\\n\\n if variant.get_variant_properties()?.disabled.is_some() {\\n\\n continue;\\n\\n }\\n\\n\\n\\n let ident = &variant.ident;\\n\\n let params = match &variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(fields) => {\\n\\n has_additional_data = true;\\n\\n let defaults = ::core::iter::repeat(quote!(::core::default::Default::default()))\\n\\n .take(fields.unnamed.len());\\n\\n quote! { (#(#defaults),*) }\\n\\n }\\n\\n Fields::Named(fields) => {\\n\\n has_additional_data = true;\\n\\n let fields = fields\\n\\n .named\\n\\n .iter()\\n\",\n \"file_path\": \"strum_macros/src/macros/from_repr.rs\",\n \"rank\": 39,\n \"score\": 7.190492968414006\n },\n {\n \"content\": \"use std::default::Default;\\n\\nuse syn::{Ident, LitStr, Variant};\\n\\n\\n\\nuse super::case_style::{CaseStyle, CaseStyleHelpers};\\n\\nuse super::metadata::{kw, VariantExt, VariantMeta};\\n\\nuse super::occurrence_error;\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/helpers/variant_props.rs\",\n \"rank\": 40,\n \"score\": 7.150080038009833\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse std::default::Default;\\n\\nuse syn::{parse_quote, DeriveInput, Ident, Path, Visibility};\\n\\n\\n\\nuse super::case_style::CaseStyle;\\n\\nuse super::metadata::{DeriveInputExt, EnumDiscriminantsMeta, EnumMeta};\\n\\nuse super::occurrence_error;\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/helpers/type_props.rs\",\n \"rank\": 41,\n \"score\": 6.9208689600656195\n },\n {\n \"content\": \" Fields::Unit => quote! {},\\n\\n Fields::Unnamed(fields) => {\\n\\n let defaults =\\n\\n ::core::iter::repeat(quote!(Default::default())).take(fields.unnamed.len());\\n\\n quote! { (#(#defaults),*) }\\n\\n }\\n\\n Fields::Named(fields) => {\\n\\n let fields = fields\\n\\n .named\\n\\n .iter()\\n\\n .map(|field| field.ident.as_ref().unwrap());\\n\\n quote! { {#(#fields: Default::default()),*} }\\n\\n }\\n\\n };\\n\\n\\n\\n arms.push(quote! { #(#attrs => ::core::result::Result::Ok(#name::#ident #params)),* });\\n\\n }\\n\\n\\n\\n arms.push(default);\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/from_string.rs\",\n \"rank\": 42,\n \"score\": 6.854575423037257\n },\n {\n \"content\": \"use proc_macro2::{Span, TokenStream, TokenTree};\\n\\nuse quote::{quote, ToTokens};\\n\\nuse syn::parse_quote;\\n\\nuse syn::{Data, DeriveInput, Fields};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, strum_discriminants_passthrough_error, HasTypeProperties};\\n\\n\\n\\n/// Attributes to copy from the main enum's variants to the discriminant enum's variants.\\n\\n///\\n\\n/// Attributes not in this list may be for other `proc_macro`s on the main enum, and may cause\\n\\n/// compilation problems when copied across.\\n\\nconst ATTRIBUTES_TO_COPY: &[&str] = &[\\\"doc\\\", \\\"cfg\\\", \\\"allow\\\", \\\"deny\\\", \\\"strum_discriminants\\\"];\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_discriminants.rs\",\n \"rank\": 44,\n \"score\": 6.005617829907104\n },\n {\n \"content\": \"use proc_macro2::{Span, TokenStream};\\n\\nuse syn::{\\n\\n parenthesized,\\n\\n parse::{Parse, ParseStream},\\n\\n parse2, parse_str,\\n\\n punctuated::Punctuated,\\n\\n spanned::Spanned,\\n\\n Attribute, DeriveInput, Ident, Lit, LitBool, LitStr, Meta, MetaNameValue, Path, Token, Variant, Visibility,\\n\\n};\\n\\n\\n\\nuse super::case_style::CaseStyle;\\n\\n\\n\\npub mod kw {\\n\\n use syn::custom_keyword;\\n\\n pub use syn::token::Crate;\\n\\n\\n\\n // enum metadata\\n\\n custom_keyword!(serialize_all);\\n\\n\\n\\n // enum discriminant metadata\\n\",\n \"file_path\": \"strum_macros/src/helpers/metadata.rs\",\n \"rank\": 45,\n \"score\": 5.959888266646222\n },\n {\n \"content\": \" // (i.e. always `enum.as_ref().to_string() == enum.to_string()`).\\n\\n let output = variant_properties.get_preferred_name(type_properties.case_style);\\n\\n let params = match variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(..) => quote! { (..) },\\n\\n Fields::Named(..) => quote! { {..} },\\n\\n };\\n\\n\\n\\n arms.push(quote! { #name::#ident #params => #output });\\n\\n }\\n\\n\\n\\n if arms.len() < variants.len() {\\n\\n arms.push(quote! {\\n\\n _ => panic!(\\n\\n \\\"AsRef::<str>::as_ref() or AsStaticRef::<str>::as_static() \\\\\\n\\n called on disabled variant.\\\",\\n\\n )\\n\\n });\\n\\n }\\n\\n\\n\\n Ok(arms)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/as_ref_str.rs\",\n \"rank\": 46,\n \"score\": 5.782436141329776\n },\n {\n \"content\": \" }\\n\\n\\n\\n let params = match variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(..) => quote! { (..) },\\n\\n Fields::Named(..) => quote! { {..} },\\n\\n };\\n\\n\\n\\n for (key, value) in variant_properties.string_props {\\n\\n string_arms.push(quote! { #key => ::core::option::Option::Some( #value )});\\n\\n }\\n\\n\\n\\n string_arms.push(quote! { _ => ::core::option::Option::None });\\n\\n bool_arms.push(quote! { _ => ::core::option::Option::None });\\n\\n num_arms.push(quote! { _ => ::core::option::Option::None });\\n\\n\\n\\n arms.push(quote! {\\n\\n &#name::#ident #params => {\\n\\n match prop {\\n\\n #(#string_arms),*\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_properties.rs\",\n \"rank\": 48,\n \"score\": 5.44866365726444\n },\n {\n \"content\": \"use heck::{\\n\\n ToKebabCase, ToLowerCamelCase, ToShoutySnakeCase, ToSnakeCase, ToTitleCase, ToUpperCamelCase,\\n\\n};\\n\\nuse std::str::FromStr;\\n\\nuse syn::{\\n\\n parse::{Parse, ParseStream},\\n\\n Ident, LitStr,\\n\\n};\\n\\n\\n\\n#[allow(clippy::enum_variant_names)]\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\\n\\npub enum CaseStyle {\\n\\n CamelCase,\\n\\n KebabCase,\\n\\n MixedCase,\\n\\n ShoutySnakeCase,\\n\\n SnakeCase,\\n\\n TitleCase,\\n\\n UpperCase,\\n\\n LowerCase,\\n\",\n \"file_path\": \"strum_macros/src/helpers/case_style.rs\",\n \"rank\": 49,\n \"score\": 5.330885358253186\n },\n {\n \"content\": \" let output = variant_properties.get_preferred_name(type_properties.case_style);\\n\\n\\n\\n let params = match variant.fields {\\n\\n Fields::Unit => quote! {},\\n\\n Fields::Unnamed(..) => quote! { (..) },\\n\\n Fields::Named(..) => quote! { {..} },\\n\\n };\\n\\n\\n\\n arms.push(quote! { #name::#ident #params => f.pad(#output) });\\n\\n }\\n\\n\\n\\n if arms.len() < variants.len() {\\n\\n arms.push(quote! { _ => panic!(\\\"fmt() called on disabled variant.\\\") });\\n\\n }\\n\\n\\n\\n Ok(quote! {\\n\\n impl #impl_generics ::core::fmt::Display for #name #ty_generics #where_clause {\\n\\n fn fmt(&self, f: &mut ::core::fmt::Formatter) -> ::core::result::Result<(), ::core::fmt::Error> {\\n\\n match *self {\\n\\n #(#arms),*\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/display.rs\",\n \"rank\": 50,\n \"score\": 5.2804774677868505\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasTypeProperties};\\n\\n\\n\\npub(crate) fn enum_count_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {\\n\\n let n = match &ast.data {\\n\\n Data::Enum(v) => v.variants.len(),\\n\\n _ => return Err(non_enum_error()),\\n\\n };\\n\\n let type_properties = ast.get_type_properties()?;\\n\\n let strum_module_path = type_properties.crate_module_path();\\n\\n\\n\\n // Used in the quasi-quotation below as `#name`\\n\\n let name = &ast.ident;\\n\\n\\n\\n // Helper is provided for handling complex generic types correctly and effortlessly\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n\\n\\n Ok(quote! {\\n\\n // Implementation\\n\\n impl #impl_generics #strum_module_path::EnumCount for #name #ty_generics #where_clause {\\n\\n const COUNT: usize = #n;\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_count.rs\",\n \"rank\": 51,\n \"score\": 5.070169011791643\n },\n {\n \"content\": \" .map(|field| field.ident.as_ref().unwrap());\\n\\n quote! { {#(#fields: ::core::default::Default::default()),*} }\\n\\n }\\n\\n };\\n\\n\\n\\n let const_var_str = format!(\\\"{}_DISCRIMINANT\\\", variant.ident).to_shouty_snake_case();\\n\\n let const_var_ident = format_ident!(\\\"{}\\\", const_var_str);\\n\\n\\n\\n let const_val_expr = match &variant.discriminant {\\n\\n Some((_, expr)) => quote! { #expr },\\n\\n None => match &prev_const_var_ident {\\n\\n Some(prev) => quote! { #prev + 1 },\\n\\n None => quote! { 0 },\\n\\n },\\n\\n };\\n\\n\\n\\n constant_defs.push(quote! {const #const_var_ident: #discriminant_type = #const_val_expr;});\\n\\n arms.push(quote! {v if v == #const_var_ident => ::core::option::Option::Some(#name::#ident #params)});\\n\\n\\n\\n prev_const_var_ident = Some(const_var_ident);\\n\",\n \"file_path\": \"strum_macros/src/macros/from_repr.rs\",\n \"rank\": 52,\n \"score\": 4.591015673155843\n },\n {\n \"content\": \" }\\n\\n\\n\\n if let Some(kw) = variant_properties.default {\\n\\n if let Some(fst_kw) = default_kw {\\n\\n return Err(occurrence_error(fst_kw, kw, \\\"default\\\"));\\n\\n }\\n\\n\\n\\n match &variant.fields {\\n\\n Fields::Unnamed(fields) if fields.unnamed.len() == 1 => {}\\n\\n _ => {\\n\\n return Err(syn::Error::new_spanned(\\n\\n variant,\\n\\n \\\"Default only works on newtype structs with a single String field\\\",\\n\\n ))\\n\\n }\\n\\n }\\n\\n\\n\\n default_kw = Some(kw);\\n\\n default = quote! {\\n\\n default => ::core::result::Result::Ok(#name::#ident(default.into()))\\n\",\n \"file_path\": \"strum_macros/src/macros/strings/from_string.rs\",\n \"rank\": 53,\n \"score\": 4.455552163845091\n },\n {\n \"content\": \"use proc_macro2::TokenStream;\\n\\nuse quote::quote;\\n\\nuse syn::{Data, DeriveInput};\\n\\n\\n\\nuse crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_variant_names.rs\",\n \"rank\": 54,\n \"score\": 4.417969666107224\n },\n {\n \"content\": \"pub use self::case_style::CaseStyleHelpers;\\n\\npub use self::type_props::HasTypeProperties;\\n\\npub use self::variant_props::HasStrumVariantProperties;\\n\\n\\n\\npub mod case_style;\\n\\nmod metadata;\\n\\npub mod type_props;\\n\\npub mod variant_props;\\n\\n\\n\\nuse proc_macro2::Span;\\n\\nuse quote::ToTokens;\\n\\nuse syn::spanned::Spanned;\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/helpers/mod.rs\",\n \"rank\": 55,\n \"score\": 4.405140189010975\n },\n {\n \"content\": \"#![allow(deprecated)]\\n\\n\\n\\nuse std::str::FromStr;\\n\\nuse std::string::ToString;\\n\\nuse strum::{EnumString, ToString};\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumString, ToString)]\\n\",\n \"file_path\": \"strum_tests/tests/to_string.rs\",\n \"rank\": 56,\n \"score\": 4.1922183255973255\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// This trait designates that an `Enum` can be iterated over. It can\\n\\n/// be auto generated using `strum_macros` on your behalf.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```rust\\n\\n/// # use std::fmt::Debug;\\n\\n/// // You need to bring the type into scope to use it!!!\\n\\n/// use strum::{EnumIter, IntoEnumIterator};\\n\\n///\\n\\n/// #[derive(EnumIter, Debug)]\\n\\n/// enum Color {\\n\\n/// Red,\\n\\n/// Green { range: usize },\\n\\n/// Blue(usize),\\n\\n/// Yellow,\\n\\n/// }\\n\\n///\\n\",\n \"file_path\": \"strum/src/lib.rs\",\n \"rank\": 57,\n \"score\": 4.090200374759712\n },\n {\n \"content\": \"use structopt::StructOpt;\\n\\nuse strum::{EnumString, EnumVariantNames, VariantNames};\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"strum_tests/tests/enum_variant_names.rs\",\n \"rank\": 58,\n \"score\": 4.085360039809054\n },\n {\n \"content\": \"pub mod enum_count;\\n\\npub mod enum_discriminants;\\n\\npub mod enum_iter;\\n\\npub mod enum_messages;\\n\\npub mod enum_properties;\\n\\npub mod enum_variant_names;\\n\\npub mod from_repr;\\n\\n\\n\\nmod strings;\\n\\n\\n\\npub use self::strings::as_ref_str;\\n\\npub use self::strings::display;\\n\\npub use self::strings::from_string;\\n\\npub use self::strings::to_string;\\n\",\n \"file_path\": \"strum_macros/src/macros/mod.rs\",\n \"rank\": 59,\n \"score\": 4.0713221558221395\n },\n {\n \"content\": \"use std::str::FromStr;\\n\\nuse strum::EnumString;\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumString)]\\n\",\n \"file_path\": \"strum_tests/tests/from_str.rs\",\n \"rank\": 60,\n \"score\": 4.047865556123924\n },\n {\n \"content\": \" let ident = self.ident.as_ref().expect(\\\"identifier\\\");\\n\\n LitStr::new(&ident.convert_case(case_style), ident.span())\\n\\n }\\n\\n\\n\\n pub fn get_preferred_name(&self, case_style: Option<CaseStyle>) -> LitStr {\\n\\n self.to_string.as_ref().cloned().unwrap_or_else(|| {\\n\\n self.serialize\\n\\n .iter()\\n\\n .max_by_key(|s| s.value().len())\\n\\n .cloned()\\n\\n .unwrap_or_else(|| self.ident_as_str(case_style))\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_serializations(&self, case_style: Option<CaseStyle>) -> Vec<LitStr> {\\n\\n let mut attrs = self.serialize.clone();\\n\\n if let Some(to_string) = &self.to_string {\\n\\n attrs.push(to_string.clone());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/helpers/variant_props.rs\",\n \"rank\": 61,\n \"score\": 4.026295951444789\n },\n {\n \"content\": \"### Added\\n\\n\\n\\n* Added a derive to implement `From<YourEnum>` for `&'static str`. This deprecates `AsStaticStr` since\\n\\n the new solution doesn't require a `strum` specific trait to use.\\n\\n\\n\\n## 0.12.0\\n\\n\\n\\n### Added\\n\\n\\n\\n* Serialization case can be controlled using `#[strum(serialize_all = \\\"snake_case\\\")]`. ([#21][#21])\\n\\n* `#[derive(EnumDiscriminants)]` generates enum with variants without fields. ([#33][#33])\\n\\n\\n\\n[#21]: https://github.com/Peternator7/strum/issues/21\\n\\n[#33]: https://github.com/Peternator7/strum/issues/33\\n\\n\\n\\n## 0.10.0\\n\\n\\n\\n### Added\\n\\n\\n\\n* Implemented `Clone` for `EnumIter`s. ([#18][#18])\\n\\n* Added `AsStaticRef` derive to allow enums to `impl AsStaticRef<str>`. ([#23][#23])\\n\\n\\n\\n### Fixed\\n\\n\\n\\n* `#[allow(missing_docs)]` on generated `EnumIter`s. ([#19][#19])\\n\\n\\n\\n[#18]: https://github.com/Peternator7/strum/pull/18\\n\\n[#19]: https://github.com/Peternator7/strum/issues/19\\n\\n[#23]: https://github.com/Peternator7/strum/issues/23\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 62,\n \"score\": 4.016854093105081\n },\n {\n \"content\": \"//! # Strum\\n\\n//!\\n\\n//! Strum is a set of macros and traits for working with\\n\\n//! enums and strings easier in Rust.\\n\\n//!\\n\\n\\n\\n#![recursion_limit = \\\"128\\\"]\\n\\n\\n\\nextern crate proc_macro;\\n\\n\\n\\nmod helpers;\\n\\nmod macros;\\n\\n\\n\\nuse proc_macro2::TokenStream;\\n\\nuse std::env;\\n\\nuse syn::DeriveInput;\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 63,\n \"score\": 3.9899530339831513\n },\n {\n \"content\": \"/// test `serialize_all` cooperation with other macroses\\n\\nuse std::str::FromStr;\\n\\nuse std::string::ToString;\\n\\nuse strum::{Display, EnumString, IntoStaticStr};\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumString, Display, IntoStaticStr)]\\n\\n#[strum(serialize_all = \\\"title_case\\\")]\\n\",\n \"file_path\": \"strum_tests/tests/serialize_all.rs\",\n \"rank\": 64,\n \"score\": 3.942400006855636\n },\n {\n \"content\": \"//! ```rust\\n\\n//! use std::string::ToString;\\n\\n//! use strum;\\n\\n//! use strum_macros;\\n\\n//! \\n\\n//! #[derive(Debug, Eq, PartialEq, strum_macros::ToString)]\\n\\n//! #[strum(serialize_all = \\\"snake_case\\\")]\\n\\n//! enum Brightness {\\n\\n//! DarkBlack,\\n\\n//! Dim {\\n\\n//! glow: usize,\\n\\n//! },\\n\\n//! #[strum(serialize = \\\"bright\\\")]\\n\\n//! BrightWhite,\\n\\n//! }\\n\\n//! \\n\\n//! assert_eq!(\\n\\n//! String::from(\\\"dark_black\\\"),\\n\\n//! Brightness::DarkBlack.to_string().as_ref()\\n\\n//! );\\n\",\n \"file_path\": \"strum/src/additional_attributes.rs\",\n \"rank\": 65,\n \"score\": 3.720681047653657\n },\n {\n \"content\": \"/// ```\\n\\n/// // You need to bring the ToString trait into scope to use it\\n\\n/// use std::string::ToString;\\n\\n/// use strum_macros::Display;\\n\\n///\\n\\n/// #[derive(Display, Debug)]\\n\\n/// enum Color {\\n\\n/// #[strum(serialize = \\\"redred\\\")]\\n\\n/// Red,\\n\\n/// Green {\\n\\n/// range: usize,\\n\\n/// },\\n\\n/// Blue(usize),\\n\\n/// Yellow,\\n\\n/// }\\n\\n///\\n\\n/// // uses the serialize string for Display\\n\\n/// let red = Color::Red;\\n\\n/// assert_eq!(String::from(\\\"redred\\\"), format!(\\\"{}\\\", red));\\n\\n/// // by default the variants Name\\n\\n/// let yellow = Color::Yellow;\\n\\n/// assert_eq!(String::from(\\\"Yellow\\\"), yellow.to_string());\\n\\n/// // or for string formatting\\n\\n/// println!(\\n\\n/// \\\"blue: {} green: {}\\\",\\n\\n/// Color::Blue(10),\\n\\n/// Color::Green { range: 42 }\\n\\n/// );\\n\\n/// ```\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 66,\n \"score\": 3.6960259868153855\n },\n {\n \"content\": \" if attrs.is_empty() {\\n\\n attrs.push(self.ident_as_str(case_style));\\n\\n }\\n\\n\\n\\n attrs\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HasStrumVariantProperties for Variant {\\n\\n fn get_variant_properties(&self) -> syn::Result<StrumVariantProperties> {\\n\\n let mut output = StrumVariantProperties {\\n\\n ident: Some(self.ident.clone()),\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n let mut message_kw = None;\\n\\n let mut detailed_message_kw = None;\\n\\n let mut to_string_kw = None;\\n\\n let mut disabled_kw = None;\\n\\n let mut default_kw = None;\\n\",\n \"file_path\": \"strum_macros/src/helpers/variant_props.rs\",\n \"rank\": 67,\n \"score\": 3.621069388564398\n },\n {\n \"content\": \"use strum::EnumProperty;\\n\\n\\n\\n#[derive(Debug, EnumProperty)]\\n\",\n \"file_path\": \"strum_tests/tests/enum_props.rs\",\n \"rank\": 68,\n \"score\": 3.6088296058701004\n },\n {\n \"content\": \"/// This trait designates that an `Enum` can be iterated over. It can\\n\\n/// be auto generated using `strum_macros` on your behalf.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```rust\\n\\n/// # use std::fmt::Debug;\\n\\n/// // You need to bring the type into scope to use it!!!\\n\\n/// use strum::{EnumIter, IntoEnumIterator};\\n\\n///\\n\\n/// #[derive(EnumIter, Debug)]\\n\\n/// enum Color {\\n\\n/// Red,\\n\\n/// Green { range: usize },\\n\\n/// Blue(usize),\\n\\n/// Yellow,\\n\\n/// }\\n\\n///\\n\\n/// // Iterate over the items in an enum and perform some function on them.\\n\\n/// fn generic_iterator<E, F>(pred: F)\\n\\n/// where\\n\\n/// E: IntoEnumIterator,\\n\\n/// F: Fn(E),\\n\\n/// {\\n\\n/// for e in E::iter() {\\n\\n/// pred(e)\\n\\n/// }\\n\\n/// }\\n\\n///\\n\\n/// generic_iterator::<Color, _>(|color| println!(\\\"{:?}\\\", color));\\n\\n/// ```\\n\\npub trait IntoEnumIterator: Sized {\\n\\n type Iterator: Iterator<Item = Self>;\\n\\n\\n\\n fn iter() -> Self::Iterator;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum/src/lib.rs\",\n \"rank\": 69,\n \"score\": 3.60538616970004\n },\n {\n \"content\": \"#![allow(deprecated)]\\n\\n\\n\\nuse std::str::FromStr;\\n\\nuse strum::{AsRefStr, AsStaticRef, AsStaticStr, EnumString, IntoStaticStr};\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumString, AsRefStr, AsStaticStr, IntoStaticStr)]\\n\",\n \"file_path\": \"strum_tests/tests/as_ref_str.rs\",\n \"rank\": 70,\n \"score\": 3.5295686078312145\n },\n {\n \"content\": \"use strum::FromRepr;\\n\\n\\n\\n#[derive(Debug, FromRepr, PartialEq)]\\n\\n#[repr(u8)]\\n\",\n \"file_path\": \"strum_tests/tests/from_repr.rs\",\n \"rank\": 71,\n \"score\": 3.4944582714166144\n },\n {\n \"content\": \"/// Some(\\\"Variant zero\\\")\\n\\n/// );\\n\\n/// ```\\n\\n///\\n\\n/// It is also possible to specify the visibility (e.g. `pub`/`pub(crate)`/etc.)\\n\\n/// of the generated enum. By default, the generated enum inherits the\\n\\n/// visibility of the parent enum it was generated from.\\n\\n///\\n\\n/// ```nocompile\\n\\n/// use strum_macros::EnumDiscriminants;\\n\\n///\\n\\n/// // You can set the visibility of the generated enum using the `#[strum_discriminants(vis(..))]` attribute:\\n\\n/// mod inner {\\n\\n/// use strum_macros::EnumDiscriminants;\\n\\n///\\n\\n/// # #[allow(dead_code)]\\n\\n/// #[derive(Debug, EnumDiscriminants)]\\n\\n/// #[strum_discriminants(vis(pub))]\\n\\n/// #[strum_discriminants(name(PubDiscriminants))]\\n\\n/// enum PrivateEnum {\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 72,\n \"score\": 3.4491136185537705\n },\n {\n \"content\": \"use enum_variant_type::EnumVariantType;\\n\\nuse strum::{Display, EnumDiscriminants, EnumIter, EnumMessage, EnumString, IntoEnumIterator};\\n\\n\\n\\n#[allow(dead_code)]\\n\\n#[derive(Debug, Eq, PartialEq, EnumDiscriminants)]\\n\\n#[strum_discriminants(derive(EnumIter))]\\n\",\n \"file_path\": \"strum_tests/tests/enum_discriminants.rs\",\n \"rank\": 73,\n \"score\": 3.446817813193452\n },\n {\n \"content\": \"use strum::EnumMessage;\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumMessage)]\\n\",\n \"file_path\": \"strum_tests/tests/enum_message.rs\",\n \"rank\": 74,\n \"score\": 3.439948698225949\n },\n {\n \"content\": \"/// they will be set to their default values upon deserialization.\\n\\n///\\n\\n/// The `default` attribute can be applied to a tuple variant with a single data parameter. When a match isn't\\n\\n/// found, the given variant will be returned and the input string will be captured in the parameter.\\n\\n///\\n\\n/// Note that the implementation of `FromStr` by default only matches on the name of the\\n\\n/// variant. There is an option to match on different case conversions through the\\n\\n/// `#[strum(serialize_all = \\\"snake_case\\\")]` type attribute.\\n\\n///\\n\\n/// See the [Additional Attributes](https://docs.rs/strum/0.22/strum/additional_attributes/index.html)\\n\\n/// Section for more information on using this feature.\\n\\n///\\n\\n/// # Example howto use `EnumString`\\n\\n/// ```\\n\\n/// use std::str::FromStr;\\n\\n/// use strum_macros::EnumString;\\n\\n///\\n\\n/// #[derive(Debug, PartialEq, EnumString)]\\n\\n/// enum Color {\\n\\n/// Red,\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 75,\n \"score\": 3.423481403070199\n },\n {\n \"content\": \"use strum_macros::AsRefStr;\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, AsRefStr)]\\n\",\n \"file_path\": \"strum_tests/tests/as_ref_no_strum.rs\",\n \"rank\": 76,\n \"score\": 3.3871135800878664\n },\n {\n \"content\": \"/// `EnumProperty` is a trait that makes it possible to store additional information\\n\\n/// with enum variants. This trait is designed to be used with the macro of the same\\n\\n/// name in the `strum_macros` crate. Currently, the only string literals are supported\\n\\n/// in attributes, the other methods will be implemented as additional attribute types\\n\\n/// become stabilized.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```rust\\n\\n/// # use std::fmt::Debug;\\n\\n/// // You need to bring the type into scope to use it!!!\\n\\n/// use strum::EnumProperty;\\n\\n///\\n\\n/// #[derive(PartialEq, Eq, Debug, EnumProperty)]\\n\\n/// enum Class {\\n\\n/// #[strum(props(Teacher=\\\"Ms.Frizzle\\\", Room=\\\"201\\\"))]\\n\\n/// History,\\n\\n/// #[strum(props(Teacher=\\\"Mr.Smith\\\"))]\\n\\n/// #[strum(props(Room=\\\"103\\\"))]\\n\\n/// Mathematics,\\n\\n/// #[strum(props(Time=\\\"2:30\\\"))]\\n\\n/// Science,\\n\\n/// }\\n\\n///\\n\\n/// let history = Class::History;\\n\\n/// assert_eq!(\\\"Ms.Frizzle\\\", history.get_str(\\\"Teacher\\\").unwrap());\\n\\n/// ```\\n\\npub trait EnumProperty {\\n\\n fn get_str(&self, prop: &str) -> Option<&'static str>;\\n\\n fn get_int(&self, _prop: &str) -> Option<usize> {\\n\\n Option::None\\n\\n }\\n\\n\\n\\n fn get_bool(&self, _prop: &str) -> Option<bool> {\\n\\n Option::None\\n\\n }\\n\\n}\\n\\n\\n\\n/// A cheap reference-to-reference conversion. Used to convert a value to a\\n\\n/// reference value with `'static` lifetime within generic code.\\n\\n#[deprecated(\\n\\n since = \\\"0.22.0\\\",\\n\\n note = \\\"please use `#[derive(IntoStaticStr)]` instead\\\"\\n\\n)]\\n\",\n \"file_path\": \"strum/src/lib.rs\",\n \"rank\": 77,\n \"score\": 3.3455753846501626\n },\n {\n \"content\": \"use strum::{EnumIter, IntoEnumIterator};\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumIter)]\\n\",\n \"file_path\": \"strum_tests/tests/enum_iter.rs\",\n \"rank\": 78,\n \"score\": 3.3358769288778465\n },\n {\n \"content\": \"use strum::{Display, EnumString};\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, EnumString, Display)]\\n\",\n \"file_path\": \"strum_tests/tests/display.rs\",\n \"rank\": 79,\n \"score\": 3.3358769288778465\n },\n {\n \"content\": \"/// Associates additional pieces of information with an Enum. This can be\\n\\n/// autoimplemented by deriving `EnumMessage` and annotating your variants with\\n\\n/// `#[strum(message=\\\"...\\\")]`.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```rust\\n\\n/// # use std::fmt::Debug;\\n\\n/// // You need to bring the type into scope to use it!!!\\n\\n/// use strum::EnumMessage;\\n\\n///\\n\\n/// #[derive(PartialEq, Eq, Debug, EnumMessage)]\\n\\n/// enum Pet {\\n\\n/// #[strum(message=\\\"I have a dog\\\")]\\n\\n/// #[strum(detailed_message=\\\"My dog's name is Spots\\\")]\\n\\n/// Dog,\\n\\n/// /// I am documented.\\n\\n/// #[strum(message=\\\"I don't have a cat\\\")]\\n\\n/// Cat,\\n\\n/// }\\n\\n///\\n\\n/// let my_pet = Pet::Dog;\\n\\n/// assert_eq!(\\\"I have a dog\\\", my_pet.get_message().unwrap());\\n\\n/// ```\\n\\npub trait EnumMessage {\\n\\n fn get_message(&self) -> Option<&'static str>;\\n\\n fn get_detailed_message(&self) -> Option<&'static str>;\\n\\n fn get_documentation(&self) -> Option<&'static str>;\\n\\n fn get_serializations(&self) -> &'static [&'static str];\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum/src/lib.rs\",\n \"rank\": 80,\n \"score\": 3.311018356461323\n },\n {\n \"content\": \"use strum::{EnumCount, EnumIter, IntoEnumIterator};\\n\\n\\n\\n#[derive(Debug, EnumCount, EnumIter)]\\n\",\n \"file_path\": \"strum_tests/tests/enum_count.rs\",\n \"rank\": 81,\n \"score\": 3.28616728582617\n },\n {\n \"content\": \"//! If the whole enum is marked `ascii_case_insensitive`, you can specify `ascii_case_insensitive = false`\\n\\n//! to disable case insensitivity on this v ariant.\\n\\n//!\\n\\n//! - `message=\\\"..\\\"`: Adds a message to enum variant. This is used in conjunction with the `EnumMessage`\\n\\n//! trait to associate a message with a variant. If `detailed_message` is not provided,\\n\\n//! then `message` will also be returned when `get_detailed_message` is called.\\n\\n//!\\n\\n//! - `detailed_message=\\\"..\\\"`: Adds a more detailed message to a variant. If this value is omitted, then\\n\\n//! `message` will be used in it's place.\\n\\n//!\\n\\n//! - Structured documentation, as in `/// ...`: If using `EnumMessage`, is accessible via get_documentation().\\n\\n//!\\n\\n//! - `props(key=\\\"value\\\")`: Enables associating additional information with a given variant.\\n\",\n \"file_path\": \"strum/src/additional_attributes.rs\",\n \"rank\": 82,\n \"score\": 3.2620413755041615\n },\n {\n \"content\": \"#![no_std]\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use core::str::FromStr;\\n\\n use strum::EnumString;\\n\\n\\n\\n #[derive(Debug, Eq, PartialEq, EnumString)]\\n\\n enum Color {\\n\\n Red,\\n\\n Blue {\\n\\n hue: usize,\\n\\n },\\n\\n #[strum(serialize = \\\"y\\\", serialize = \\\"yellow\\\")]\\n\\n Yellow,\\n\\n #[strum(to_string = \\\"purp\\\")]\\n\\n Purple,\\n\\n #[strum(serialize = \\\"blk\\\", serialize = \\\"Black\\\", ascii_case_insensitive)]\\n\\n Black,\\n\\n }\\n\",\n \"file_path\": \"strum_nostd_tests/src/lib.rs\",\n \"rank\": 83,\n \"score\": 3.2203166790979134\n },\n {\n \"content\": \"///\\n\\n/// Note, the variant attributes passed to the discriminant enum are filtered to avoid compilation\\n\\n/// errors due to the derives mismatches, thus only `#[doc]`, `#[cfg]`, `#[allow]`, and `#[deny]`\\n\\n/// are passed through by default. If you want to specify a custom attribute on the discriminant\\n\\n/// variant, wrap it with `#[strum_discriminants(...)]` attribute.\\n\\n///\\n\\n/// ```\\n\\n/// // Bring trait into scope\\n\\n/// use std::str::FromStr;\\n\\n/// use strum::{IntoEnumIterator, EnumMessage};\\n\\n/// use strum_macros::{EnumDiscriminants, EnumIter, EnumString};\\n\\n///\\n\\n/// #[derive(Debug)]\\n\\n/// struct NonDefault;\\n\\n///\\n\\n/// // simple example\\n\\n/// # #[allow(dead_code)]\\n\\n/// #[derive(Debug, EnumDiscriminants)]\\n\\n/// #[strum_discriminants(derive(EnumString, EnumMessage))]\\n\\n/// enum MyEnum {\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 84,\n \"score\": 3.2144922207329256\n },\n {\n \"content\": \" documentation_arms\\n\\n .push(quote! { &#name::#ident #params => ::core::option::Option::Some(#text) });\\n\\n } else {\\n\\n // Push the documentation.\\n\\n documentation_arms\\n\\n .push(quote! {\\n\\n &#name::#ident #params => ::core::option::Option::Some(concat!(#(concat!(#documentation, \\\"\\\\n\\\")),*))\\n\\n });\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n if arms.len() < variants.len() {\\n\\n arms.push(quote! { _ => ::core::option::Option::None });\\n\\n }\\n\\n\\n\\n if detailed_arms.len() < variants.len() {\\n\\n detailed_arms.push(quote! { _ => ::core::option::Option::None });\\n\\n }\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_messages.rs\",\n \"rank\": 85,\n \"score\": 3.1493953167591204\n },\n {\n \"content\": \" quote! { { .. } }\\n\\n }\\n\\n };\\n\\n\\n\\n quote! { #name::#ident #params => #discriminants_name::#ident }\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n let from_fn_body = quote! { match val { #(#arms),* } };\\n\\n\\n\\n let (impl_generics, ty_generics, where_clause) = ast.generics.split_for_impl();\\n\\n let impl_from = quote! {\\n\\n impl #impl_generics ::core::convert::From< #name #ty_generics > for #discriminants_name #where_clause {\\n\\n fn from(val: #name #ty_generics) -> #discriminants_name {\\n\\n #from_fn_body\\n\\n }\\n\\n }\\n\\n };\\n\\n let impl_from_ref = {\\n\\n let mut generics = ast.generics.clone();\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_discriminants.rs\",\n \"rank\": 86,\n \"score\": 3.0851039949304178\n },\n {\n \"content\": \"///\\n\\n/// use strum_macros;\\n\\n/// // bring the trait into scope\\n\\n/// use strum::EnumProperty;\\n\\n///\\n\\n/// #[derive(strum_macros::EnumProperty, Debug)]\\n\\n/// #[allow(dead_code)]\\n\\n/// enum Color {\\n\\n/// #[strum(props(Red = \\\"255\\\", Blue = \\\"255\\\", Green = \\\"255\\\"))]\\n\\n/// White,\\n\\n/// #[strum(props(Red = \\\"0\\\", Blue = \\\"0\\\", Green = \\\"0\\\"))]\\n\\n/// Black,\\n\\n/// #[strum(props(Red = \\\"0\\\", Blue = \\\"255\\\", Green = \\\"0\\\"))]\\n\\n/// Blue,\\n\\n/// #[strum(props(Red = \\\"255\\\", Blue = \\\"0\\\", Green = \\\"0\\\"))]\\n\\n/// Red,\\n\\n/// #[strum(props(Red = \\\"0\\\", Blue = \\\"0\\\", Green = \\\"255\\\"))]\\n\\n/// Green,\\n\\n/// }\\n\\n///\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 87,\n \"score\": 3.0637288823358952\n },\n {\n \"content\": \"/// enum Color {\\n\\n/// #[strum(serialize = \\\"redred\\\")]\\n\\n/// Red,\\n\\n/// Green {\\n\\n/// range: usize,\\n\\n/// },\\n\\n/// Blue(usize),\\n\\n/// Yellow,\\n\\n/// }\\n\\n///\\n\\n/// // uses the serialize string for Display\\n\\n/// let red = Color::Red;\\n\\n/// assert_eq!(String::from(\\\"redred\\\"), red.to_string());\\n\\n/// // by default the variants Name\\n\\n/// let yellow = Color::Yellow;\\n\\n/// assert_eq!(String::from(\\\"Yellow\\\"), yellow.to_string());\\n\\n/// ```\\n\\n#[deprecated(\\n\\n since = \\\"0.22.0\\\",\\n\\n note = \\\"please use `#[derive(Display)]` instead. See issue https://github.com/Peternator7/strum/issues/132\\\"\\n\\n)]\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 88,\n \"score\": 3.0217481936412454\n },\n {\n \"content\": \" let mut pascal = String::with_capacity(camel_case.len());\\n\\n let mut it = camel_case.chars();\\n\\n if let Some(ch) = it.next() {\\n\\n pascal.extend(ch.to_lowercase());\\n\\n }\\n\\n pascal.extend(it);\\n\\n pascal\\n\\n }\\n\\n }\\n\\n } else {\\n\\n ident_string\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/helpers/case_style.rs\",\n \"rank\": 89,\n \"score\": 3.0182422113061\n },\n {\n \"content\": \" ATTRIBUTES_TO_COPY\\n\\n .iter()\\n\\n .any(|attr_whitelisted| attr.path.is_ident(attr_whitelisted))\\n\\n })\\n\\n .map(|attr| {\\n\\n if attr.path.is_ident(\\\"strum_discriminants\\\") {\\n\\n let passthrough_group = attr\\n\\n .tokens\\n\\n .clone()\\n\\n .into_iter()\\n\\n .next()\\n\\n .ok_or_else(|| strum_discriminants_passthrough_error(attr))?;\\n\\n let passthrough_attribute = match passthrough_group {\\n\\n TokenTree::Group(ref group) => group.stream(),\\n\\n _ => {\\n\\n return Err(strum_discriminants_passthrough_error(&passthrough_group));\\n\\n }\\n\\n };\\n\\n if passthrough_attribute.is_empty() {\\n\\n return Err(strum_discriminants_passthrough_error(&passthrough_group));\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_discriminants.rs\",\n \"rank\": 90,\n \"score\": 2.9448346165109585\n },\n {\n \"content\": \"\\n\\n let discriminants_name = type_properties.discriminant_name.unwrap_or(default_name);\\n\\n let discriminants_vis = type_properties\\n\\n .discriminant_vis\\n\\n .unwrap_or_else(|| vis.clone());\\n\\n\\n\\n // Pass through all other attributes\\n\\n let pass_though_attributes = type_properties.discriminant_others;\\n\\n\\n\\n // Add the variants without fields, but exclude the `strum` meta item\\n\\n let mut discriminants = Vec::new();\\n\\n for variant in variants {\\n\\n let ident = &variant.ident;\\n\\n\\n\\n // Don't copy across the \\\"strum\\\" meta attribute. Only passthrough the whitelisted\\n\\n // attributes and proxy `#[strum_discriminants(...)]` attributes\\n\\n let attrs = variant\\n\\n .attrs\\n\\n .iter()\\n\\n .filter(|attr| {\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_discriminants.rs\",\n \"rank\": 91,\n \"score\": 2.9258306520418325\n },\n {\n \"content\": \"/// the variants, the `from_repr` function is marked `const`. rustc >= 1.46 is required\\n\\n/// to allow `match` statements in `const fn`. The no additional data requirement is due to the\\n\\n/// inability to use `Default::default()` in a `const fn`.\\n\\n///\\n\\n/// You cannot derive `FromRepr` on any type with a lifetime bound (`<'a>`) because the function would surely\\n\\n/// create [unbounded lifetimes](https://doc.rust-lang.org/nightly/nomicon/unbounded-lifetimes.html).\\n\\n///\\n\\n/// ```\\n\\n///\\n\\n/// use strum_macros::FromRepr;\\n\\n///\\n\\n/// #[derive(FromRepr, Debug, PartialEq)]\\n\\n/// enum Color {\\n\\n/// Red,\\n\\n/// Green { range: usize },\\n\\n/// Blue(usize),\\n\\n/// Yellow,\\n\\n/// }\\n\\n///\\n\\n/// assert_eq!(Some(Color::Red), Color::from_repr(0));\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 92,\n \"score\": 2.9024364474308255\n },\n {\n \"content\": \"use strum::{Display, EnumCount, EnumDiscriminants, EnumString};\\n\\n\\n\\n#[allow(dead_code)]\\n\\n#[derive(Debug, Eq, PartialEq, EnumString, Display, EnumCount, EnumDiscriminants)]\\n\",\n \"file_path\": \"strum_tests/src/main.rs\",\n \"rank\": 93,\n \"score\": 2.8599858661558915\n },\n {\n \"content\": \"//! # Documentation for Additional Attributes\\n\\n//!\\n\\n//! ## Attributes on Enums\\n\\n//!\\n\\n//! Strum supports several custom attributes to modify the generated code. At the enum level, the following attributes are supported:\\n\\n//!\\n\\n//! - `#[strum(serialize_all = \\\"case_style\\\")]` attribute can be used to change the case used when serializing to and deserializing\\n\\n//! from strings. This feature is enabled by [withoutboats/heck](https://github.com/withoutboats/heck) and supported case styles are:\\n\\n//!\\n\\n//! - `camelCase`\\n\\n//! - `PascalCase`\\n\\n//! - `kebab-case`\\n\\n//! - `snake_case`\\n\\n//! - `SCREAMING_SNAKE_CASE`\\n\\n//! - `SCREAMING-KEBAB-CASE`\\n\\n//! - `lowercase`\\n\\n//! - `UPPERCASE`\\n\\n//! - `title_case`\\n\\n//! - `mixed_case`\\n\\n//!\\n\",\n \"file_path\": \"strum/src/additional_attributes.rs\",\n \"rank\": 94,\n \"score\": 2.8279954175112656\n },\n {\n \"content\": \"/// // test rename example combined with EnumIter\\n\\n/// assert_eq!(\\n\\n/// vec![MyVariants::Variant0, MyVariants::Variant1],\\n\\n/// MyVariants::iter().collect::<Vec<_>>()\\n\\n/// );\\n\\n///\\n\\n/// // Make use of the auto-From conversion to check whether an instance of `MyEnum` matches a\\n\\n/// // `MyEnumDiscriminants` discriminant.\\n\\n/// assert_eq!(\\n\\n/// MyEnumDiscriminants::Variant0,\\n\\n/// MyEnum::Variant0(NonDefault).into()\\n\\n/// );\\n\\n/// assert_eq!(\\n\\n/// MyEnumDiscriminants::Variant0,\\n\\n/// MyEnumDiscriminants::from(MyEnum::Variant0(NonDefault))\\n\\n/// );\\n\\n///\\n\\n/// // Make use of the EnumMessage on the `MyEnumDiscriminants` discriminant.\\n\\n/// assert_eq!(\\n\\n/// MyEnumDiscriminants::Variant0.get_message(),\\n\",\n \"file_path\": \"strum_macros/src/lib.rs\",\n \"rank\": 95,\n \"score\": 2.809977998350061\n },\n {\n \"content\": \" #[allow(clippy::use_self)]\\n\\n impl #impl_generics #name #ty_generics #where_clause {\\n\\n #[doc = \\\"Try to create [Self] from the raw representation\\\"]\\n\\n #vis #const_if_possible fn from_repr(discriminant: #discriminant_type) -> Option<#name #ty_generics> {\\n\\n #(#constant_defs)*\\n\\n match discriminant {\\n\\n #(#arms),*\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"strum_macros/src/macros/from_repr.rs\",\n \"rank\": 96,\n \"score\": 2.6219575923964515\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn from_str_no_std() {\\n\\n assert_eq!(Color::Yellow, Color::from_str(\\\"yellow\\\").unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[rustversion::since(1.34)]\\n\\n fn try_from_str_no_std() {\\n\\n use core::convert::TryFrom;\\n\\n assert_eq!(Color::Yellow, Color::try_from(\\\"yellow\\\").unwrap());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[rustversion::before(1.34)]\\n\\n fn try_from_str_no_std() {}\\n\\n}\\n\",\n \"file_path\": \"strum_nostd_tests/src/lib.rs\",\n \"rank\": 97,\n \"score\": 2.6219575923964515\n },\n {\n \"content\": \" });\\n\\n }\\n\\n\\n\\n // But you can disable the messages.\\n\\n if variant_properties.disabled.is_some() {\\n\\n continue;\\n\\n }\\n\\n\\n\\n if let Some(msg) = messages {\\n\\n let params = params.clone();\\n\\n\\n\\n // Push the simple message.\\n\\n let tokens = quote! { &#name::#ident #params => ::core::option::Option::Some(#msg) };\\n\\n arms.push(tokens.clone());\\n\\n\\n\\n if detailed_messages.is_none() {\\n\\n detailed_arms.push(tokens);\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"strum_macros/src/macros/enum_messages.rs\",\n \"rank\": 98,\n \"score\": 2.5729082193935606\n },\n {\n \"content\": \"# Changelog\\n\\n\\n\\n## 0.23.1\\n\\n\\n\\n* [#193](https://github.com/Peternator7/strum/pull/193) Fixes an ambiguity introduced by #186 when your enum has a variant called Error.\\n\\n\\n\\n* [#192](https://github.com/Peternator7/strum/pull/192) The work done in #189 was lost in other PR's. This re-added the functionality to support no-std.\\n\\n\\n\\n## 0.23.0\\n\\n\\n\\n* [#185](https://github.com/Peternator7/strum/pull/185) Adds the `FromRepr` derive that adds a `from_repr(x: usize) -> Option<Self>`\\n\\n method to your enum. This lets you convert integer values to your enum. If you specify a #[repr(..)] attribute on your enum, or use\\n\\n an explicit discriminant, this will be incorporated into the derive.\\n\\n * `from_repr` will be `const` if you use a recent rust version.\\n\\n * This cannot be a trait method currently because only inherent methods support `const`.\\n\\n\\n\\n* [#186](https://github.com/Peternator7/strum/pull/186) Automatically implement `TryFrom<str>` for enums that implement `EnumString`.\\n\\n This is only enabled for rustc >= 1.34 which is when `TryFrom was stabilized.\\n\\n * This is a small breaking change. If you had manually implemented `TryFrom<str>` for your enum, this will cause a conflict. You\\n\\n can probably remove your manual implementation.\\n\\n\\n\\n* [#189](https://github.com/Peternator7/strum/pull/189) Use `core::result::Result` instead of `std::result::Result`. This should be\\n\\n more portable in no-std environments.\\n\\n\\n\\n## 0.22.0\\n\\n\\n\\n* [#180](https://github.com/Peternator7/strum/pull/180): Deprecates `ToString` derive. You should use `Display`\\n\\n instead.\\n\\n\\n\\n* [#178](https://github.com/Peternator7/strum/pull/178): Deprecates AsStaticStr. This has been undocumented for a while.\\n\\n The recommended method is to derive `IntoStaticStr` instead.\\n\\n\\n\\n* [#171](https://github.com/Peternator7/strum/pull/171): Improve `no-std` support. \\n\\n\\n\\n* [#170](https://github.com/Peternator7/strum/pull/170): enable changing the path to strum traits. This is necessary\\n\\n if you re-export strum as a submodule in another crate.\\n\\n\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 99,\n \"score\": 2.4801678284423962\n }\n]","isConversational":false}}},{"rowIdx":1977,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"cargo-spatial/src/download.rs"},"repo_name":{"kind":"string","value":"randomPoison/spatialos-sdk-rs"},"commit":{"kind":"string","value":"6a0149a21a7de40fd4ff127820d6f04f87173454"},"file_code":{"kind":"string","value":"\n#[cfg(target_os = \"linux\")]\npub use self::linux::*;\n#[cfg(target_os = \"macos\")]\npub use self::macos::*;\n#[cfg(target_os = \"windows\")]\npub use self::windows::*;\n\nuse crate::{config::Config, opt::DownloadSdk};\nuse log::*;\nuse reqwest::get;\nuse std::fs::File;\nuse std::io::copy;\nuse std::{\n fs,\n path::{Path, PathBuf},\n process,\n};\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialWorkerSdkPackage {\n CHeaders,\n CApiWin,\n CApiMac,\n CApiLinux,\n}\n\nimpl SpatialWorkerSdkPackage {\n fn package_name(self) -> &'static str {\n match self {\n SpatialWorkerSdkPackage::CHeaders => \"c_headers\",\n SpatialWorkerSdkPackage::CApiWin => \"c-static-x86_64-vc140_mt-win32\",\n SpatialWorkerSdkPackage::CApiMac => \"c-static-x86_64-clang-macos\",\n SpatialWorkerSdkPackage::CApiLinux => \"c-static-x86_64-gcc510_pic-linux\",\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialWorkerSdkPackage::CHeaders => \"headers\",\n SpatialWorkerSdkPackage::CApiWin => \"win\",\n SpatialWorkerSdkPackage::CApiMac => \"macos\",\n SpatialWorkerSdkPackage::CApiLinux => \"linux\",\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialToolsPackage {\n SchemaCompilerWin,\n SchemaCompilerMac,\n SchemaCompilerLinux,\n SnapshotConverterWin,\n SnapshotConverterMac,\n SnapshotConverterLinux,\n}\n\nimpl SpatialToolsPackage {\n fn package_name(self) -> &'static str {\n match self {\n SpatialToolsPackage::SchemaCompilerWin => \"schema_compiler-x86_64-win32\",\n SpatialToolsPackage::SchemaCompilerMac => \"schema_compiler-x86_64-macos\",\n SpatialToolsPackage::SchemaCompilerLinux => \"schema_compiler-x86_64-linux\",\n SpatialToolsPackage::SnapshotConverterWin => \"snapshot_converter-x86_64-win32\",\n SpatialToolsPackage::SnapshotConverterMac => \"snapshot_converter-x86_64-macos\",\n SpatialToolsPackage::SnapshotConverterLinux => \"snapshot_converter-x86_64-linux\",\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialToolsPackage::SchemaCompilerWin\n | SpatialToolsPackage::SchemaCompilerMac\n | SpatialToolsPackage::SchemaCompilerLinux => \"schema-compiler\",\n SpatialToolsPackage::SnapshotConverterWin\n | SpatialToolsPackage::SnapshotConverterMac\n | SpatialToolsPackage::SnapshotConverterLinux => \"snapshot-converter\",\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialSchemaPackage {\n StandardLibrary,\n ExhaustiveTestSchema,\n}\n\nimpl SpatialSchemaPackage {\n fn package_name(self) -> &'static str {\n match self {\n SpatialSchemaPackage::StandardLibrary => \"standard_library\",\n SpatialSchemaPackage::ExhaustiveTestSchema => \"test_schema_library\",\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialSchemaPackage::StandardLibrary => \"std-lib\",\n SpatialSchemaPackage::ExhaustiveTestSchema => \"test-schema\",\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialPackageSource {\n WorkerSdk(SpatialWorkerSdkPackage),\n Tools(SpatialToolsPackage),\n Schema(SpatialSchemaPackage),\n}\n\nimpl SpatialPackageSource {\n fn package_name(self) -> Vec<&'static str> {\n match self {\n SpatialPackageSource::WorkerSdk(package) => vec![\"worker_sdk\", package.package_name()],\n SpatialPackageSource::Tools(package) => vec![\"tools\", package.package_name()],\n SpatialPackageSource::Schema(package) => vec![\"schema\", package.package_name()],\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialPackageSource::WorkerSdk(package) => package.relative_target_directory(),\n SpatialPackageSource::Tools(package) => package.relative_target_directory(),\n SpatialPackageSource::Schema(package) => package.relative_target_directory(),\n }\n }\n}\n\nstatic COMMON_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CHeaders),\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CApiLinux),\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CApiWin),\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CApiMac),\n SpatialPackageSource::Schema(SpatialSchemaPackage::StandardLibrary),\n];\n\n#[cfg(target_os = \"linux\")]\nstatic PLATFORM_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::Tools(SpatialToolsPackage::SchemaCompilerLinux),\n SpatialPackageSource::Tools(SpatialToolsPackage::SnapshotConverterLinux),\n];\n\n#[cfg(target_os = \"windows\")]\nstatic PLATFORM_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::Tools(SpatialToolsPackage::SchemaCompilerWin),\n SpatialPackageSource::Tools(SpatialToolsPackage::SnapshotConverterWin),\n];\n\n#[cfg(target_os = \"macos\")]\nstatic PLATFORM_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::Tools(SpatialToolsPackage::SchemaCompilerMac),\n SpatialPackageSource::Tools(SpatialToolsPackage::SnapshotConverterMac),\n];\n\npub fn download_sdk(\n config: Result<Config, Box<dyn std::error::Error>>,\n options: &DownloadSdk,\n) -> Result<(), Box<dyn std::error::Error>> {\n let spatial_lib_dir = match config {\n Ok(ref config) => config.spatial_lib_dir().ok_or(\"spatial_lib_dir value must be set in the config, or the SPATIAL_LIB_DIR environment variable must be set\")?,\n Err(_) => ::std::env::var(\"SPATIAL_LIB_DIR\")?\n };\n\n let spatial_sdk_version = match options.sdk_version {\n Some(ref version) => version.clone(),\n None => config?.spatial_sdk_version,\n };\n\n info!(\"Downloading packages into: {}\", spatial_lib_dir);\n\n \n if Path::new(&spatial_lib_dir).exists() {\n fs::remove_dir_all(&spatial_lib_dir)?;\n }\n\n fs::create_dir_all(&spatial_lib_dir)?;\n trace!(\"Spatial lib directory cleaned.\");\n\n for package in COMMON_PACKAGES {\n download_package(*package, &spatial_sdk_version, &spatial_lib_dir)?;\n }\n\n for package in PLATFORM_PACKAGES {\n download_package(*package, &spatial_sdk_version, &spatial_lib_dir)?;\n }\n\n if options.with_test_schema {\n download_package(\n SpatialPackageSource::Schema(SpatialSchemaPackage::ExhaustiveTestSchema),\n &spatial_sdk_version,\n &spatial_lib_dir,\n )?;\n }\n\n Ok(())\n}\n\nfn download_package(\n package_source: SpatialPackageSource,\n sdk_version: &str,\n spatial_lib_dir: &str,\n) -> Result<(), Box<dyn std::error::Error>> {\n info!(\"Downloading {}\", package_source.package_name().join(\" \"));\n\n let mut output_path = PathBuf::new();\n output_path.push(spatial_lib_dir);\n output_path.push(package_source.relative_target_directory());\n\n let mut args = vec![\"package\", \"retrieve\"];\n\n args.extend(package_source.package_name());\n args.push(sdk_version);\n args.push(output_path.to_str().unwrap());\n args.push(\"--unzip\");\n\n trace!(\"Running spatial command with arguments: {:?}\", args);\n\n let process = process::Command::new(\"spatial\").args(args).output()?;\n\n if !process.status.success() {\n let stdout = String::from_utf8(process.stdout)?;\n let stderr = String::from_utf8(process.stderr)?;\n trace!(\"{}\", stdout);\n trace!(\"{}\", stderr);\n return Err(\"Failed to download package.\".into());\n }\n\n Ok(())\n}\n\nfn get_installer(\n download_url: &str,\n directory: &Path,\n) -> Result<PathBuf, Box<dyn std::error::Error>> {\n \n trace!(\"GET request to {}\", download_url);\n let mut response = get(download_url)?;\n\n let (mut dest, path) = {\n let fname = response\n .url()\n .path_segments()\n .and_then(::std::iter::Iterator::last)\n .and_then(|name| if name.is_empty() { None } else { Some(name) })\n .unwrap_or(\"tmp.bin\");\n\n trace!(\"Downloading {}\", fname);\n let fname = directory.join(fname);\n trace!(\"Creating temporary file at: {:?}\", fname);\n (File::create(fname.clone())?, fname)\n };\n\n \n copy(&mut response, &mut dest)?;\n\n Ok(path)\n}\n\n#[cfg(target_os = \"linux\")]\nmod linux {\n pub fn download_cli() -> Result<(), Box<dyn std::error::Error>> {\n Err(\"Linux installer is unsupported. Follow the instructions here to install the Spatial CLI: https://docs.improbable.io/reference/latest/shared/setup/linux\".to_owned().into())\n }\n}\n\n#[cfg(target_os = \"windows\")]\nmod windows {\n use log::info;\n use std::process;\n use tempfile;\n\n const DOWNLOAD_LOCATION: &str =\n \"https://console.improbable.io/installer/download/stable/latest/win\";\n\n pub fn download_cli() -> Result<(), Box<dyn std::error::Error>> {\n \n let tmp_dir = tempfile::TempDir::new()?;\n info!(\"Downloading installer.\");\n let installer_path = super::get_installer(DOWNLOAD_LOCATION, tmp_dir.path())?;\n\n info!(\"Executing installer.\");\n \n let result = process::Command::new(installer_path).status();\n\n match result {\n Ok(status) => {\n if !status.success() {\n return Err(\"Installer returned a non-zero exit code.\".to_owned().into());\n }\n\n Ok(())\n }\n Err(e) => {\n if let Some(code) = e.raw_os_error() {\n if code == 740 {\n return Err(\"Installer requires elevated permissions to run. Please rerun in a terminal with elevated permissions.\".to_owned().into());\n }\n }\n\n Err(e.into())\n }\n }\n }\n}\n\n#[cfg(target_os = \"macos\")]\nmod macos {\n use log::info;\n use std::process;\n use tempfile;\n\n const DOWNLOAD_LOCATION: &str =\n \"https://console.improbable.io/installer/download/stable/latest/mac\";\n\n pub fn download_cli() -> Result<(), Box<dyn std::error::Error>> {\n \n let tmp_dir = tempfile::TempDir::new()?;\n info!(\"Downloading installer.\");\n let installer_path = super::get_installer(DOWNLOAD_LOCATION, tmp_dir.path())?;\n\n info!(\"Executing installer.\");\n let status = process::Command::new(\"installer\")\n .arg(\"-pkg\")\n .arg(installer_path)\n .args(&[\"-target\", \"/\"])\n .status()?;\n\n if !status.success() {\n return Err(\"Installer returned a non-zero exit code.\".to_owned().into());\n }\n\n Ok(())\n }\n}\n"},"prefix":{"kind":"string","value":"\n#[cfg(target_os = \"linux\")]\npub use self::linux::*;\n#[cfg(target_os = \"macos\")]\npub use self::macos::*;\n#[cfg(target_os = \"windows\")]\npub use self::windows::*;\n\nuse crate::{config::Config, opt::DownloadSdk};\nuse log::*;\nuse reqwest::get;\nuse std::fs::File;\nuse std::io::copy;\nuse std::{\n fs,\n path::{Path, PathBuf},\n process,\n};\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialWorkerSdkPackage {\n CHeaders,\n CApiWin,\n CApiMac,\n CApiLinux,\n}\n\nimpl SpatialWorkerSdkPackage {\n fn package_name(self) -> &'static str {\n match self {\n SpatialWorkerSdkPackage::CHeaders => \"c_headers\",\n SpatialWorkerSdkPackage::CApiWin => \"c-static-x86_64-vc140_mt-win32\",\n SpatialWorkerSdkPackage::CApiMac => \"c-static-x86_64-clang-macos\",\n SpatialWorkerSdkPackage::CApiLinux => \"c-static-x86_64-gcc510_pic-linux\",\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialWorkerSdkPackage::CHeaders => \"headers\",\n SpatialWorkerSdkPackage::CApiWin => \"win\",\n SpatialWorkerSdkPackage::CApiMac => \"macos\",\n SpatialWorkerSdkPackage::CApiLinux => \"linux\",\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialToolsPackage {\n SchemaCompilerWin,\n SchemaCompilerMac,\n SchemaCompilerLinux,\n SnapshotConverterWin,\n SnapshotConverterMac,\n SnapshotConverterLinux,\n}\n\nimpl SpatialToolsPackage {\n fn package_name(self) -> &'static str {\n match self {\n SpatialToolsPackage::SchemaCompilerWin => \"schema_compiler-x86_64-win32\",\n SpatialToolsPackage::SchemaCompilerMac => \"schema_compiler-x86_64-macos\",\n SpatialToolsPackage::SchemaCompilerLinux => \"schema_compiler-x86_64-linux\",\n SpatialToolsPackage::SnapshotConverterWin => \"snapshot_converter-x86_64-win32\",\n SpatialToolsPackage::SnapshotConverterMac => \"snapshot_converter-x86_64-macos\",\n SpatialToolsPackage::SnapshotConverterLinux => \"snapshot_converter-x86_64-linux\",\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialToolsPackage::SchemaCompilerWin\n | SpatialToolsPackage::SchemaCompilerMac\n | SpatialToolsPackage::SchemaCompilerLinux => \"schema-compiler\",\n SpatialToolsPackage::SnapshotConverterWin\n | SpatialToolsPackage::SnapshotConverterMac\n | SpatialToolsPackage::SnapshotConverterLinux => \"snapshot-converter\",\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialSchemaPackage {\n StandardLibrary,\n ExhaustiveTestSchema,\n}\n\nimpl SpatialSchemaPackage {\n fn package_name(self) -> &'static str {\n match self {\n SpatialSchemaPackage::StandardLibrary => \"standard_library\",\n SpatialSchemaPackage::ExhaustiveTestSchema => \"test_schema_library\",\n }\n }\n\n fn rel"},"suffix":{"kind":"string","value":"\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\nenum SpatialPackageSource {\n WorkerSdk(SpatialWorkerSdkPackage),\n Tools(SpatialToolsPackage),\n Schema(SpatialSchemaPackage),\n}\n\nimpl SpatialPackageSource {\n fn package_name(self) -> Vec<&'static str> {\n match self {\n SpatialPackageSource::WorkerSdk(package) => vec![\"worker_sdk\", package.package_name()],\n SpatialPackageSource::Tools(package) => vec![\"tools\", package.package_name()],\n SpatialPackageSource::Schema(package) => vec![\"schema\", package.package_name()],\n }\n }\n\n fn relative_target_directory(self) -> &'static str {\n match self {\n SpatialPackageSource::WorkerSdk(package) => package.relative_target_directory(),\n SpatialPackageSource::Tools(package) => package.relative_target_directory(),\n SpatialPackageSource::Schema(package) => package.relative_target_directory(),\n }\n }\n}\n\nstatic COMMON_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CHeaders),\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CApiLinux),\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CApiWin),\n SpatialPackageSource::WorkerSdk(SpatialWorkerSdkPackage::CApiMac),\n SpatialPackageSource::Schema(SpatialSchemaPackage::StandardLibrary),\n];\n\n#[cfg(target_os = \"linux\")]\nstatic PLATFORM_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::Tools(SpatialToolsPackage::SchemaCompilerLinux),\n SpatialPackageSource::Tools(SpatialToolsPackage::SnapshotConverterLinux),\n];\n\n#[cfg(target_os = \"windows\")]\nstatic PLATFORM_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::Tools(SpatialToolsPackage::SchemaCompilerWin),\n SpatialPackageSource::Tools(SpatialToolsPackage::SnapshotConverterWin),\n];\n\n#[cfg(target_os = \"macos\")]\nstatic PLATFORM_PACKAGES: &[SpatialPackageSource] = &[\n SpatialPackageSource::Tools(SpatialToolsPackage::SchemaCompilerMac),\n SpatialPackageSource::Tools(SpatialToolsPackage::SnapshotConverterMac),\n];\n\npub fn download_sdk(\n config: Result<Config, Box<dyn std::error::Error>>,\n options: &DownloadSdk,\n) -> Result<(), Box<dyn std::error::Error>> {\n let spatial_lib_dir = match config {\n Ok(ref config) => config.spatial_lib_dir().ok_or(\"spatial_lib_dir value must be set in the config, or the SPATIAL_LIB_DIR environment variable must be set\")?,\n Err(_) => ::std::env::var(\"SPATIAL_LIB_DIR\")?\n };\n\n let spatial_sdk_version = match options.sdk_version {\n Some(ref version) => version.clone(),\n None => config?.spatial_sdk_version,\n };\n\n info!(\"Downloading packages into: {}\", spatial_lib_dir);\n\n \n if Path::new(&spatial_lib_dir).exists() {\n fs::remove_dir_all(&spatial_lib_dir)?;\n }\n\n fs::create_dir_all(&spatial_lib_dir)?;\n trace!(\"Spatial lib directory cleaned.\");\n\n for package in COMMON_PACKAGES {\n download_package(*package, &spatial_sdk_version, &spatial_lib_dir)?;\n }\n\n for package in PLATFORM_PACKAGES {\n download_package(*package, &spatial_sdk_version, &spatial_lib_dir)?;\n }\n\n if options.with_test_schema {\n download_package(\n SpatialPackageSource::Schema(SpatialSchemaPackage::ExhaustiveTestSchema),\n &spatial_sdk_version,\n &spatial_lib_dir,\n )?;\n }\n\n Ok(())\n}\n\nfn download_package(\n package_source: SpatialPackageSource,\n sdk_version: &str,\n spatial_lib_dir: &str,\n) -> Result<(), Box<dyn std::error::Error>> {\n info!(\"Downloading {}\", package_source.package_name().join(\" \"));\n\n let mut output_path = PathBuf::new();\n output_path.push(spatial_lib_dir);\n output_path.push(package_source.relative_target_directory());\n\n let mut args = vec![\"package\", \"retrieve\"];\n\n args.extend(package_source.package_name());\n args.push(sdk_version);\n args.push(output_path.to_str().unwrap());\n args.push(\"--unzip\");\n\n trace!(\"Running spatial command with arguments: {:?}\", args);\n\n let process = process::Command::new(\"spatial\").args(args).output()?;\n\n if !process.status.success() {\n let stdout = String::from_utf8(process.stdout)?;\n let stderr = String::from_utf8(process.stderr)?;\n trace!(\"{}\", stdout);\n trace!(\"{}\", stderr);\n return Err(\"Failed to download package.\".into());\n }\n\n Ok(())\n}\n\nfn get_installer(\n download_url: &str,\n directory: &Path,\n) -> Result<PathBuf, Box<dyn std::error::Error>> {\n \n trace!(\"GET request to {}\", download_url);\n let mut response = get(download_url)?;\n\n let (mut dest, path) = {\n let fname = response\n .url()\n .path_segments()\n .and_then(::std::iter::Iterator::last)\n .and_then(|name| if name.is_empty() { None } else { Some(name) })\n .unwrap_or(\"tmp.bin\");\n\n trace!(\"Downloading {}\", fname);\n let fname = directory.join(fname);\n trace!(\"Creating temporary file at: {:?}\", fname);\n (File::create(fname.clone())?, fname)\n };\n\n \n copy(&mut response, &mut dest)?;\n\n Ok(path)\n}\n\n#[cfg(target_os = \"linux\")]\nmod linux {\n pub fn download_cli() -> Result<(), Box<dyn std::error::Error>> {\n Err(\"Linux installer is unsupported. Follow the instructions here to install the Spatial CLI: https://docs.improbable.io/reference/latest/shared/setup/linux\".to_owned().into())\n }\n}\n\n#[cfg(target_os = \"windows\")]\nmod windows {\n use log::info;\n use std::process;\n use tempfile;\n\n const DOWNLOAD_LOCATION: &str =\n \"https://console.improbable.io/installer/download/stable/latest/win\";\n\n pub fn download_cli() -> Result<(), Box<dyn std::error::Error>> {\n \n let tmp_dir = tempfile::TempDir::new()?;\n info!(\"Downloading installer.\");\n let installer_path = super::get_installer(DOWNLOAD_LOCATION, tmp_dir.path())?;\n\n info!(\"Executing installer.\");\n \n let result = process::Command::new(installer_path).status();\n\n match result {\n Ok(status) => {\n if !status.success() {\n return Err(\"Installer returned a non-zero exit code.\".to_owned().into());\n }\n\n Ok(())\n }\n Err(e) => {\n if let Some(code) = e.raw_os_error() {\n if code == 740 {\n return Err(\"Installer requires elevated permissions to run. Please rerun in a terminal with elevated permissions.\".to_owned().into());\n }\n }\n\n Err(e.into())\n }\n }\n }\n}\n\n#[cfg(target_os = \"macos\")]\nmod macos {\n use log::info;\n use std::process;\n use tempfile;\n\n const DOWNLOAD_LOCATION: &str =\n \"https://console.improbable.io/installer/download/stable/latest/mac\";\n\n pub fn download_cli() -> Result<(), Box<dyn std::error::Error>> {\n \n let tmp_dir = tempfile::TempDir::new()?;\n info!(\"Downloading installer.\");\n let installer_path = super::get_installer(DOWNLOAD_LOCATION, tmp_dir.path())?;\n\n info!(\"Executing installer.\");\n let status = process::Command::new(\"installer\")\n .arg(\"-pkg\")\n .arg(installer_path)\n .args(&[\"-target\", \"/\"])\n .status()?;\n\n if !status.success() {\n return Err(\"Installer returned a non-zero exit code.\".to_owned().into());\n }\n\n Ok(())\n }\n}\n"},"middle":{"kind":"string","value":"ative_target_directory(self) -> &'static str {\n match self {\n SpatialSchemaPackage::StandardLibrary => \"std-lib\",\n SpatialSchemaPackage::ExhaustiveTestSchema => \"test-schema\",\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// Formats an key-value pair into an argument string.\n\npub fn format_arg<S: AsRef<OsStr>>(prefix: &str, value: S) -> OsString {\n\n let mut arg = OsString::from(format!(\"--{}=\", prefix));\n\n arg.push(value.as_ref());\n\n arg\n\n}\n","file_path":"cargo-spatial/src/lib.rs","rank":0,"score":90548.65107011895},{"content":"pub fn main() {\n\n let input_filename = args().nth(1).unwrap();\n\n let output_filename = args().nth(2).unwrap();\n\n\n\n let mut input_file =\n\n File::open(input_filename).expect(\"Unable to open the test schema bundle.\");\n\n let mut contents = String::new();\n\n input_file\n\n .read_to_string(&mut contents)\n\n .expect(\"Unable to read the test schema bundle\");\n\n let generated_file = generator::generate_code(schema_bundle::load_bundle(&contents).unwrap());\n\n let mut output_file = File::create(output_filename).unwrap();\n\n output_file.write_all(generated_file.as_bytes()).unwrap();\n\n}\n","file_path":"spatialos-sdk-code-generator/src/bin.rs","rank":2,"score":87527.3893469573},{"content":"/// Performs code generation for the project described by `config`.\n\n///\n\n/// Assumes that the current working directory is the root directory of the project,\n\n/// i.e. the directory that has the `Spatial.toml` file.\n\npub fn run_codegen(config: &Config) -> Result<(), Box<dyn std::error::Error>> {\n\n assert!(\n\n crate::current_dir_is_root(),\n\n \"Current directory should be the project root\"\n\n );\n\n\n\n // Ensure that the path to the Spatial SDK has been specified.\n\n let spatial_lib_dir = config.spatial_lib_dir()\n\n .map(PathBuf::from)\n\n .ok_or(\"spatial_lib_dir value must be set in the config, or the SPATIAL_LIB_DIR environment variable must be set\")?;\n\n\n\n // Determine the paths the the schema compiler and protoc relative the the lib\n\n // dir path.\n\n let schema_compiler_path = spatial_lib_dir.join(\"schema-compiler/schema_compiler\");\n\n let std_lib_path = spatial_lib_dir.join(\"std-lib\");\n\n\n\n // Calculate the various output directories relative to `output_dir`.\n\n let output_dir = PathBuf::from(config.schema_build_dir());\n\n let bundle_json_path = output_dir.join(\"bundle.json\");\n\n let schema_descriptor_path = output_dir.join(\"schema.descriptor\");\n","file_path":"cargo-spatial/src/codegen.rs","rank":3,"score":83880.68281104487},{"content":"pub fn cstr_to_string(ptr: *const std::os::raw::c_char) -> String {\n\n assert!(!ptr.is_null());\n\n unsafe {\n\n CStr::from_ptr(ptr)\n\n .to_owned()\n\n .into_string()\n\n .expect(\"Failed to unwrap string\")\n\n }\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/internal/utils.rs","rank":4,"score":83189.35516901535},{"content":"#[test]\n\npub fn create_and_read_snapshot() {\n\n let snapshot_path = env::temp_dir().join(\"test.snapshot\");\n\n\n\n let entity = get_test_entity().expect(\"Error\");\n\n\n\n {\n\n SnapshotOutputStream::new(snapshot_path.clone())\n\n .expect(\"Error\")\n\n .write_entity(EntityId::new(1), &entity)\n\n .expect(\"Error\");\n\n }\n\n\n\n {\n\n let mut snapshot = SnapshotInputStream::new(snapshot_path).expect(\"Error\");\n\n\n\n assert!(snapshot.has_next());\n\n\n\n let entity = snapshot.read_entity().expect(\"Error\");\n\n\n\n let position = entity.get::<Position>();\n","file_path":"test-suite/src/snapshot_integration_tests.rs","rank":5,"score":83028.42414328185},{"content":"pub fn cstr_array_to_vec_string(\n\n char_ptr: *mut *const std::os::raw::c_char,\n\n count: u32,\n\n) -> Vec<String> {\n\n let mut strings = Vec::new();\n\n unsafe {\n\n for i in 0..count as isize {\n\n let ptr = char_ptr.offset(i) as *mut *const std::os::raw::c_char;\n\n assert!(!ptr.is_null());\n\n strings.push(cstr_to_string(*ptr));\n\n }\n\n }\n\n strings\n\n}\n","file_path":"spatialos-sdk/src/worker/internal/utils.rs","rank":6,"score":81031.58997203186},{"content":"pub fn load_bundle(data: &str) -> Result<SchemaBundle, serde_json::Error> {\n\n serde_json::from_str::<SchemaBundle>(data)\n\n}\n","file_path":"spatialos-sdk-code-generator/src/schema_bundle.rs","rank":7,"score":80991.32637678923},{"content":"/// Generates a random, valid component ID.\n\n///\n\n/// Component IDs are `i32` values that must be:\n\n///\n\n/// * Greater than 100.\n\n/// * Less than 536,870,911.\n\n/// * Not in the range 190,000 to 199999.\n\npub fn generate_component_id() -> i32 {\n\n use rand::Rng;\n\n\n\n let mut rng = rand::thread_rng();\n\n loop {\n\n let num = rng.gen();\n\n if num > 100 && (num < 190_000 || num > 199_999) && num < 536_870_911 {\n\n return num;\n\n }\n\n }\n\n}\n\n\n","file_path":"cargo-spatial/src/lib.rs","rank":8,"score":80029.70775329013},{"content":"/// Returns true if the current working directory is the project root (i.e. has the\n\n/// `Spatial.toml` file).\n\npub fn current_dir_is_root() -> bool {\n\n std::path::Path::new(\"./Spatial.toml\").exists()\n\n}\n\n\n","file_path":"cargo-spatial/src/lib.rs","rank":9,"score":80029.70775329013},{"content":"#[test]\n\npub fn writing_invalid_entity_returns_error() {\n\n let snapshot_path = env::temp_dir().join(\"test2.snapshot\");\n\n\n\n let entity = Entity::new();\n\n\n\n let error = SnapshotOutputStream::new(snapshot_path)\n\n .expect(\"Error\")\n\n .write_entity(EntityId::new(1), &entity);\n\n\n\n assert!(error.is_err());\n\n}\n\n\n","file_path":"test-suite/src/snapshot_integration_tests.rs","rank":10,"score":79178.8752365093},{"content":"/// Prepares and launches a local deployment.\n\n///\n\n/// Before launching the deployment, this will first run code generation and build\n\n/// workers in the project. Assumes that the current working directory is the root\n\n/// directory of the project, i.e. the directory that has the `Spatial.toml` file.\n\npub fn launch(config: &Config, launch: &LocalLaunch) -> Result<(), Box<dyn std::error::Error>> {\n\n assert!(\n\n crate::current_dir_is_root(),\n\n \"Current directory should be the project root\"\n\n );\n\n\n\n // Run codegen and such.\n\n crate::codegen::run_codegen(config)?;\n\n\n\n // Use `cargo install` to build workers and copy the exectuables to the build\n\n // directory.\n\n //\n\n // TODO: Manually copy the built executables instead of using `cargo install`.\n\n // `cargo install` doesn't use the same build cache as normal builds, so it will\n\n // sometimes result in unnecessary recompilation, which can slow down launch times.\n\n if !launch.no_build {\n\n let build_profile = match config.local_build_profile {\n\n BuildProfile::Debug => \"debug\",\n\n BuildProfile::Release => \"release\",\n\n };\n","file_path":"cargo-spatial/src/local.rs","rank":11,"score":77505.49454564134},{"content":"fn get_schema_type(value_type: &TypeReference) -> &str {\n\n match value_type {\n\n TypeReference::Primitive(primitive) => get_rust_primitive_type_tag(&primitive),\n\n TypeReference::Enum(_) => \"SchemaEnum\",\n\n TypeReference::Type(_) => \"SchemaObject\",\n\n }\n\n}\n\n\n","file_path":"spatialos-sdk-code-generator/src/generator.rs","rank":12,"score":67301.22042535621},{"content":"fn get_field_schema_type(field: &FieldDefinition) -> &str {\n\n match field.field_type {\n\n FieldDefinition_FieldType::Singular { ref type_reference } => {\n\n get_schema_type(type_reference)\n\n }\n\n FieldDefinition_FieldType::Option { ref inner_type } => get_schema_type(&inner_type),\n\n FieldDefinition_FieldType::List { ref inner_type } => get_schema_type(&inner_type),\n\n FieldDefinition_FieldType::Map { .. } => \"SchemaObject\",\n\n }\n\n}\n\n\n","file_path":"spatialos-sdk-code-generator/src/generator.rs","rank":13,"score":67301.22042535621},{"content":"fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let opt = Opt::from_args();\n\n\n\n // Initialize the logger.\n\n let verbosity = if opt.verbose {\n\n LevelFilter::Trace\n\n } else {\n\n LevelFilter::Info\n\n };\n\n SimpleLogger::init(verbosity, Default::default()).expect(\"Failed to setup logger\");\n\n\n\n // Perform the operation selected by the user.\n\n match &opt.command {\n\n Command::Codegen => codegen::run_codegen(&Config::load()?)?,\n\n\n\n Command::Local(local) => match local {\n\n Local::Launch(launch) => local::launch(&Config::load()?, launch)?,\n\n },\n\n\n\n Command::Generate { command } => match command {\n","file_path":"cargo-spatial/src/main.rs","rank":14,"score":66056.14112249648},{"content":"pub fn generate_code(bundle: SchemaBundle) -> String {\n\n // Set up the root package.\n\n let generated_code = Rc::new(RefCell::new(GeneratedCode {\n\n root_package: None,\n\n packages: BTreeSet::new(),\n\n enums: BTreeMap::new(),\n\n types: BTreeMap::new(),\n\n components: BTreeMap::new(),\n\n }));\n\n let mut root_package = Package::new(Rc::clone(&generated_code), \"\", vec![]);\n\n for file in bundle.schema_files {\n\n let package = get_or_create_packages(\n\n &mut root_package,\n\n file.package\n\n .name\n\n .split('.')\n\n .collect::<Vec<&str>>()\n\n .as_slice(),\n\n );\n\n for type_def in file.types {\n","file_path":"spatialos-sdk-code-generator/src/generator.rs","rank":15,"score":65972.61046360133},{"content":"fn get_rust_primitive_type_tag(primitive_type: &PrimitiveType) -> &str {\n\n match primitive_type {\n\n PrimitiveType::Invalid => panic!(\"Encountered invalid primitive.\"),\n\n PrimitiveType::Int32 => \"SchemaInt32\",\n\n PrimitiveType::Sint32 => \"SchemaSint32\",\n\n PrimitiveType::Sfixed32 => \"SchemaSfixed32\",\n\n PrimitiveType::Int64 => \"SchemaInt64\",\n\n PrimitiveType::Sint64 => \"SchemaSint64\",\n\n PrimitiveType::Sfixed64 => \"SchemaSfixed64\",\n\n PrimitiveType::Uint32 => \"SchemaUint32\",\n\n PrimitiveType::Fixed32 => \"SchemaFixed32\",\n\n PrimitiveType::Uint64 => \"SchemaUint64\",\n\n PrimitiveType::Fixed64 => \"SchemaFixed64\",\n\n PrimitiveType::Bool => \"SchemaBool\",\n\n PrimitiveType::Float => \"SchemaFloat\",\n\n PrimitiveType::Double => \"SchemaDouble\",\n\n PrimitiveType::String => \"SchemaString\",\n\n PrimitiveType::EntityId => \"SchemaEntityId\",\n\n PrimitiveType::Entity => panic!(\"Entity serialization unimplemented.\"),\n\n PrimitiveType::Bytes => \"SchemaBytes\",\n\n }\n\n}\n\n\n","file_path":"spatialos-sdk-code-generator/src/generator.rs","rank":16,"score":64384.88814813508},{"content":"fn check_for_flag(connection: &mut WorkerConnection, flag_name: &str) {\n\n let flag = connection.get_worker_flag(flag_name);\n\n match flag {\n\n Some(f) => println!(\"Found flag value: {}\", f),\n\n None => println!(\"Could not find flag value\"),\n\n }\n\n}\n\n\n","file_path":"project-example/src/main.rs","rank":17,"score":64101.68843793412},{"content":"pub fn get_connection(opt: Opt) -> Result<WorkerConnection, String> {\n\n let Opt {\n\n worker_type,\n\n worker_id,\n\n connect_with_poll,\n\n command,\n\n } = opt;\n\n\n\n let worker_id = worker_id.unwrap_or_else(|| format!(\"{}-{}\", &worker_type, Uuid::new_v4()));\n\n let mut future = match command {\n\n Command::Receptionist {\n\n host,\n\n port,\n\n connect_with_external_ip,\n\n } => {\n\n let params = ConnectionParameters::new(worker_type)\n\n .using_udp()\n\n .using_external_ip(connect_with_external_ip)\n\n .enable_internal_serialization();\n\n WorkerConnection::connect_receptionist_async(\n","file_path":"project-example/src/connection_handler.rs","rank":18,"score":60632.654370001284},{"content":"// This function ensures that given a path [\"example\", \"foo\"] and the root package, it will create\n\n// 2 packages with the following structure:\n\n// Package(\"root\", [Package(\"example\", [Package(\"foo\", [])])])\n\nfn get_or_create_packages<'a>(package: &'a mut Package, path: &[&str]) -> &'a mut Package {\n\n if path.is_empty() {\n\n return package;\n\n }\n\n // Given a package, and a path. If that package does not have any subpackages with the name of the \"next\"\n\n // package in the FQN, create it.\n\n let package_name = path[0];\n\n let mut package_path = package.path.clone();\n\n package_path.push(package_name.to_string());\n\n if !package.subpackages.contains_key(package_name) {\n\n package.subpackages.insert(\n\n package_name.to_string(),\n\n Package::new(\n\n Rc::clone(&package.generated_code),\n\n package_name,\n\n package_path,\n\n ),\n\n );\n\n }\n\n\n\n // Recurse into the package created above, and create more packages if needed.\n\n get_or_create_packages(\n\n package.subpackages.get_mut(package_name).unwrap(),\n\n &path[1..],\n\n )\n\n}\n\n\n","file_path":"spatialos-sdk-code-generator/src/generator.rs","rank":19,"score":53668.3208969688},{"content":"fn main() {\n\n let opt = Opt::from_args();\n\n let mut worker_connection = match get_connection(opt) {\n\n Ok(c) => c,\n\n Err(e) => panic!(\"{}\", e),\n\n };\n\n\n\n println!(\"Connected as: {}\", worker_connection.get_worker_id());\n\n\n\n exercise_connection_code_paths(&mut worker_connection);\n\n logic_loop(&mut worker_connection);\n\n}\n\n\n","file_path":"project-example/src/main.rs","rank":20,"score":51660.533043396004},{"content":"fn main() {\n\n let lib_dir = match env::var(\"SPATIAL_LIB_DIR\") {\n\n Ok(s) => s,\n\n Err(_) => panic!(\"SPATIAL_LIB_DIR environment variable not set.\"),\n\n };\n\n\n\n let package_dir = Path::new(&lib_dir).join(PACKAGE_DIR);\n\n\n\n println!(\"cargo:rustc-link-search={}\", package_dir.to_str().unwrap());\n\n\n\n for lib in LIBS.iter() {\n\n println!(\"cargo:rustc-link-lib=static={}\", lib)\n\n }\n\n\n\n #[cfg(target_os = \"macos\")]\n\n println!(\"cargo:rustc-link-lib=dylib=c++\");\n\n\n\n #[cfg(target_os = \"linux\")]\n\n println!(\"cargo:rustc-link-lib=dylib=stdc++\");\n\n\n\n #[cfg(target_os = \"windows\")]\n\n {\n\n println!(\"cargo:rustc-link-lib=dylib=gdi32\");\n\n println!(\"cargo:rustc-link-lib=dylib=user32\");\n\n }\n\n}\n","file_path":"spatialos-sdk-sys/build.rs","rank":21,"score":51660.533043396004},{"content":"fn main() {\n\n let opt = Opt::from_args();\n\n let current_dir = std::env::current_dir().expect(\"Could not find current working directory.\");\n\n\n\n let mut path_buf = PathBuf::new();\n\n path_buf.push(current_dir);\n\n path_buf.push(opt.snapshot_path);\n\n\n\n let snapshot_path = path_buf.to_str().unwrap();\n\n println!(\"Creating empty snapshot at: {}\", snapshot_path);\n\n\n\n let _stream = SnapshotOutputStream::new(snapshot_path);\n\n}\n\n\n","file_path":"spatialos-sdk/examples/generate_snapshot.rs","rank":23,"score":50138.803632512776},{"content":"enum IntermediateProtocolType {\n\n Tcp(Worker_TcpNetworkParameters),\n\n\n\n Udp {\n\n security_type: u8,\n\n kcp: Option<Worker_Alpha_KcpParameters>,\n\n erasure_codec: Option<Worker_ErasureCodecParameters>,\n\n heartbeat: Option<Worker_HeartbeatParameters>,\n\n flow_control: Option<Worker_Alpha_FlowControlParameters>,\n\n },\n\n}\n","file_path":"spatialos-sdk/src/worker/parameters.rs","rank":29,"score":48385.58570322805},{"content":"fn main() {\n\n let args = get_arguments();\n\n\n\n let headers =\n\n glob(&format!(\"{}/*.h\", args.input_dir)).expect(\"Could not glob input directory.\");\n\n\n\n let mut bindings = bindgen::Builder::default()\n\n .layout_tests(false)\n\n .derive_default(true);\n\n\n\n for path in headers {\n\n bindings = bindings.header(path.unwrap().as_path().to_str().unwrap().to_owned())\n\n }\n\n\n\n let mut out_path = PathBuf::from(args.output_dir);\n\n out_path.push(\"worker.rs\");\n\n\n\n bindings\n\n .generate()\n\n .expect(\"Could not generate bindings.\")\n\n .write_to_file(out_path)\n\n .expect(\"Could not write bindings\");\n\n}\n\n\n","file_path":"spatialos-sdk-tools/src/generate_bindings/main.rs","rank":30,"score":47480.41689432163},{"content":"#[test]\n\nfn position_is_serialized_correctly() {\n\n let builder = EntityBuilder::new(10.0, -10.0, 7.5, \"rusty\");\n\n let entity = builder.build().unwrap();\n\n\n\n let maybe_position = entity.get::<Position>();\n\n assert!(maybe_position.is_some());\n\n\n\n let position = maybe_position.unwrap();\n\n\n\n approx::abs_diff_eq!(10.0, position.coords.x);\n\n approx::abs_diff_eq!(-10.0, position.coords.y);\n\n approx::abs_diff_eq!(7.5, position.coords.z);\n\n}\n\n\n","file_path":"test-suite/src/entity_builder_tests.rs","rank":31,"score":46312.593299067965},{"content":"#[test]\n\nfn metadata_is_serialized_correctly() {\n\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \"rusty\");\n\n builder.set_metadata(\"my_entity\", \"rusty\");\n\n let entity = builder.build().unwrap();\n\n\n\n let maybe_metadata = entity.get::<Metadata>();\n\n assert!(maybe_metadata.is_some());\n\n let metadata = maybe_metadata.unwrap();\n\n\n\n assert_eq!(\"my_entity\", metadata.entity_type);\n\n}\n\n\n","file_path":"test-suite/src/entity_builder_tests.rs","rank":32,"score":46312.593299067965},{"content":"// A trait that's implemented by a component to convert to/from schema handle types.\n\npub trait Component\n\nwhere\n\n Self: std::marker::Sized,\n\n{\n\n type Update;\n\n type CommandRequest;\n\n type CommandResponse;\n\n\n\n const ID: ComponentId;\n\n\n\n fn from_data(data: &schema::SchemaComponentData) -> Result<Self, String>;\n\n fn from_update(update: &schema::SchemaComponentUpdate) -> Result<Self::Update, String>;\n\n fn from_request(\n\n command_index: CommandIndex,\n\n request: &schema::SchemaCommandRequest,\n\n ) -> Result<Self::CommandRequest, String>;\n\n fn from_response(\n\n command_index: CommandIndex,\n\n response: &schema::SchemaCommandResponse,\n\n ) -> Result<Self::CommandResponse, String>;\n","file_path":"spatialos-sdk/src/worker/component.rs","rank":33,"score":45237.45556501597},{"content":"/// Connection trait to allow for mocking the connection.\n\npub trait Connection {\n\n fn send_log_message(\n\n &mut self,\n\n level: LogLevel,\n\n logger_name: &str,\n\n message: &str,\n\n entity_id: Option<EntityId>,\n\n );\n\n fn send_metrics(&mut self, metrics: &Metrics);\n\n\n\n fn send_reserve_entity_ids_request(\n\n &mut self,\n\n payload: ReserveEntityIdsRequest,\n\n timeout_millis: Option<u32>,\n\n ) -> RequestId<ReserveEntityIdsRequest>;\n\n fn send_create_entity_request(\n\n &mut self,\n\n entity: Entity,\n\n entity_id: Option<EntityId>,\n\n timeout_millis: Option<u32>,\n","file_path":"spatialos-sdk/src/worker/connection.rs","rank":34,"score":45237.45556501597},{"content":"#[test]\n\nfn error_is_returned_if_invalid_entity() {\n\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \"rusty\");\n\n builder.add_component(\n\n Position {\n\n coords: Coordinates {\n\n x: 0.0,\n\n y: 0.0,\n\n z: 0.0,\n\n },\n\n },\n\n \"rusty\",\n\n );\n\n let result = builder.build();\n\n\n\n assert!(result.is_err());\n\n}\n","file_path":"test-suite/src/entity_builder_tests.rs","rank":35,"score":45235.61265677959},{"content":"#[test]\n\nfn entity_acl_is_serialized_correctly() {\n\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \"position_acl\");\n\n builder.add_component(\n\n Metadata {\n\n entity_type: \"test\".to_owned(),\n\n },\n\n \"metadata_acl\",\n\n );\n\n builder.set_entity_acl_write_access(\"entity_acl_acl\");\n\n builder.add_read_access(\"client\");\n\n builder.add_read_access(\"server\");\n\n\n\n let entity = builder.build().unwrap();\n\n\n\n let maybe_acl = entity.get::<EntityAcl>();\n\n assert!(maybe_acl.is_some());\n\n\n\n let acl = maybe_acl.unwrap();\n\n\n\n // First check that we insert each layer into a different set.\n","file_path":"test-suite/src/entity_builder_tests.rs","rank":36,"score":45235.61265677959},{"content":"#[test]\n\nfn persistence_component_is_added_if_set() {\n\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \"rusty\");\n\n builder.set_persistent(\"rusty\");\n\n let entity = builder.build().unwrap();\n\n\n\n assert!(entity.get::<Persistence>().is_some());\n\n}\n\n\n","file_path":"test-suite/src/entity_builder_tests.rs","rank":37,"score":45235.61265677959},{"content":"// A trait that's implemented by a type to convert to/from schema objects.\n\npub trait TypeConversion\n\nwhere\n\n Self: std::marker::Sized,\n\n{\n\n fn from_type(input: &schema::SchemaObject) -> Result<Self, String>;\n\n fn to_type(input: &Self, output: &mut schema::SchemaObject) -> Result<(), String>;\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/component.rs","rank":38,"score":43961.492706552985},{"content":"// A bytes schema field.\n\npub trait SchemaBytesField {\n\n fn get(&self) -> Option<Vec<u8>> {\n\n if self.count() == 0 {\n\n None\n\n } else {\n\n Some(self.get_or_default())\n\n }\n\n }\n\n\n\n fn get_or_default(&self) -> Vec<u8>;\n\n fn index(&self, index: usize) -> Vec<u8>;\n\n fn count(&self) -> usize;\n\n fn add(&mut self, value: &[u8]);\n\n}\n\n\n\n// A string schema field.\n","file_path":"spatialos-sdk/src/worker/internal/schema.rs","rank":39,"score":41707.331740419584},{"content":"#[allow(clippy::ptr_arg)]\n\npub trait SchemaStringField {\n\n fn get(&self) -> Option<String> {\n\n if self.count() == 0 {\n\n None\n\n } else {\n\n Some(self.get_or_default())\n\n }\n\n }\n\n\n\n fn get_or_default(&self) -> String;\n\n fn index(&self, index: usize) -> String;\n\n fn count(&self) -> usize;\n\n\n\n fn add(&mut self, value: &String);\n\n fn add_list(&mut self, value: &[String]);\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/internal/schema.rs","rank":40,"score":41707.331740419584},{"content":"// An object schema field.\n\npub trait SchemaObjectField {\n\n fn get(&self) -> Option<SchemaObject> {\n\n if self.count() == 0 {\n\n None\n\n } else {\n\n Some(self.get_or_default())\n\n }\n\n }\n\n\n\n fn get_or_default(&self) -> SchemaObject;\n\n fn index(&self, index: usize) -> SchemaObject;\n\n fn count(&self) -> usize;\n\n\n\n fn add(&mut self) -> SchemaObject;\n\n}\n\n\n\nimpl SchemaObject {\n\n pub fn field<T>(&self, field_id: ComponentId) -> SchemaFieldContainer<T> {\n\n SchemaFieldContainer {\n\n field_id,\n","file_path":"spatialos-sdk/src/worker/internal/schema.rs","rank":41,"score":41707.331740419584},{"content":"fn get_arguments() -> Args {\n\n let matches = App::new(\"Spatial OS SDK Bindings Generator\")\n\n .author(\"Jamie Brynes <jamiebrynes7@gmail.com>\")\n\n .about(\"Generate Rust bindings for the SpatialOS C API.\")\n\n .arg(\n\n Arg::with_name(OUTPUT_DIR_ARG)\n\n .short(\"o\")\n\n .long(OUTPUT_DIR_ARG)\n\n .takes_value(true)\n\n .value_name(&OUTPUT_DIR_ARG.to_uppercase())\n\n .required(true)\n\n .help(\"Output directory for the Rust bindings. Relative to the current working directory.\")\n\n )\n\n .arg(\n\n Arg::with_name(INPUT_DIR_ARG)\n\n .short(\"i\")\n\n .long(INPUT_DIR_ARG)\n\n .takes_value(true)\n\n .value_name(&INPUT_DIR_ARG.to_uppercase())\n\n .required(true)\n\n .help(\"Input directory for C header files. Relative to the current working directory.\")\n\n )\n\n .get_matches();\n\n\n\n Args {\n\n input_dir: matches.value_of(INPUT_DIR_ARG).unwrap().to_owned(),\n\n output_dir: matches.value_of(OUTPUT_DIR_ARG).unwrap().to_owned(),\n\n }\n\n}\n","file_path":"spatialos-sdk-tools/src/generate_bindings/main.rs","rank":42,"score":41321.09240286227},{"content":"fn print_worker_attributes(connection: &WorkerConnection) {\n\n let attrs = connection.get_worker_attributes();\n\n println!(\"The worker has the following attributes: \");\n\n for attr in attrs {\n\n println!(\"{}\", attr)\n\n }\n\n}\n\n\n","file_path":"project-example/src/main.rs","rank":43,"score":38766.418832669704},{"content":"// A primitive schema field.\n\npub trait SchemaPrimitiveField<T> {\n\n fn get(&self) -> Option<T> {\n\n if self.count() == 0 {\n\n None\n\n } else {\n\n Some(self.get_or_default())\n\n }\n\n }\n\n\n\n fn get_or_default(&self) -> T;\n\n fn index(&self, index: usize) -> T;\n\n fn count(&self) -> usize;\n\n\n\n fn add(&mut self, value: T);\n\n fn add_list(&mut self, value: &[T]);\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/internal/schema.rs","rank":44,"score":38104.34505141676},{"content":"fn send_query(c: &mut WorkerConnection) {\n\n let query = EntityQuery::new(\n\n QueryConstraint::And(vec![\n\n QueryConstraint::Or(vec![\n\n QueryConstraint::Component(0),\n\n QueryConstraint::Component(1),\n\n ]),\n\n QueryConstraint::And(vec![\n\n QueryConstraint::Sphere(10.0, 10.0, 10.0, 250.0),\n\n QueryConstraint::Not(Box::new(QueryConstraint::Component(2))),\n\n ]),\n\n QueryConstraint::EntityId(EntityId::new(10)),\n\n ]),\n\n ResultType::Count,\n\n );\n\n\n\n c.send_entity_query_request(EntityQueryRequest(query), None);\n\n}\n\n\n","file_path":"project-example/src/main.rs","rank":45,"score":38044.84888462246},{"content":"fn send_metrics(c: &mut WorkerConnection) {\n\n let mut m = Metrics::new()\n\n .with_load(0.2)\n\n .with_gauge_metric(\"some_metric\", 0.15)\n\n .with_histogram_metric(\"histogram_metric\", HistogramMetric::new(&[6.7]));\n\n\n\n let gauge_metric = m.add_gauge_metric(\"another_metric\").unwrap();\n\n *gauge_metric = 0.2;\n\n\n\n let histogram_metric = m\n\n .add_histogram_metric(\"another_histogram\", &[0.1, 0.2, 0.3])\n\n .unwrap();\n\n histogram_metric.add_sample(1.0);\n\n histogram_metric.add_sample(0.5);\n\n\n\n c.send_metrics(&m);\n\n}\n","file_path":"project-example/src/main.rs","rank":46,"score":38044.84888462246},{"content":"fn logic_loop(c: &mut WorkerConnection) {\n\n /// Local tracking of the state of an entity's components. We only track the\n\n /// `Rotate` component because it's the only one we care about for this demo.\n\n #[derive(Debug, Default)]\n\n struct EntityState {\n\n has_authority: bool,\n\n rotate: Option<example::Rotate>,\n\n }\n\n\n\n let mut rng = rand::thread_rng();\n\n\n\n // Store the currently-visible state of the world. Entities/components are added\n\n // and removed from the world as we get ops notifying us of those changes. The\n\n // data in `world` also tracks which `Rotate` components we currently have\n\n // authority over, so that we know which ones we need to be updating.\n\n let mut world = HashMap::new();\n\n\n\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \"rusty\");\n\n\n\n builder.add_component(\n","file_path":"project-example/src/main.rs","rank":47,"score":38044.84888462246},{"content":"pub trait ComponentUpdate<C: Component> {\n\n fn merge(&mut self, update: Self);\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/component.rs","rank":48,"score":37272.62189528407},{"content":"pub trait ComponentData<C: Component> {\n\n fn merge(&mut self, update: C::Update);\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/component.rs","rank":49,"score":37272.62189528407},{"content":"fn exercise_connection_code_paths(c: &mut WorkerConnection) {\n\n c.send_log_message(LogLevel::Info, \"main\", \"Connected successfully!\", None);\n\n print_worker_attributes(&c);\n\n check_for_flag(c, \"my-flag\");\n\n\n\n let _ = c.get_op_list(0);\n\n c.send_reserve_entity_ids_request(ReserveEntityIdsRequest(1), None);\n\n send_query(c);\n\n\n\n let interested = vec![\n\n InterestOverride::new(1, true),\n\n InterestOverride::new(100, false),\n\n ];\n\n c.send_component_interest(EntityId::new(1), &interested);\n\n c.send_authority_loss_imminent_acknowledgement(EntityId::new(1), 1337);\n\n\n\n send_metrics(c);\n\n c.set_protocol_logging_enabled(false);\n\n\n\n println!(\"Testing completed\");\n\n}\n\n\n","file_path":"project-example/src/main.rs","rank":50,"score":35971.52761590986},{"content":"fn generate_module(package: &Package) -> String {\n\n let submodules = if !package.subpackages.is_empty() {\n\n package\n\n .subpackages\n\n .iter()\n\n .map(|(_, pkg)| generate_module(&pkg))\n\n .fold(\"\".to_string(), |submodule, next| submodule + \"\\n\" + &next)\n\n } else {\n\n \"\".to_string()\n\n };\n\n // Passing `package` to format! causes the T4 template engine to generate output.\n\n let module_contents = format!(\"{}\\n{}\", package, submodules);\n\n // The only package with a depth of 0 is the root package.\n\n if package.depth() == 0 {\n\n let allow_warnings = vec![\n\n \"#![allow(unused_imports)]\",\n\n \"#![allow(unreachable_code)]\",\n\n \"#![allow(unreachable_patterns)]\",\n\n \"#![allow(unused_variables)]\",\n\n \"#![allow(dead_code)]\",\n\n \"#![allow(non_camel_case_types)]\",\n\n \"#![allow(unused_mut)]\",\n\n ]\n\n .join(\"\\n\");\n\n format!(\"{}\\n\\n{}\", allow_warnings, module_contents)\n\n } else {\n\n format!(\"pub mod {} {{\\n{}}}\\n\", package.name, module_contents)\n\n }\n\n}\n\n\n","file_path":"spatialos-sdk-code-generator/src/generator.rs","rank":51,"score":35971.52761590986},{"content":"fn get_test_entity() -> Result<Entity, String> {\n\n let mut builder = EntityBuilder::new(10.0, -10.0, 0.0, \"RustWorker\");\n\n builder.set_persistent(\"RustWorker\");\n\n builder.build()\n\n}\n","file_path":"test-suite/src/snapshot_integration_tests.rs","rank":52,"score":35047.09684105969},{"content":"fn get_connection_poll(future: &mut WorkerConnectionFuture) -> Result<WorkerConnection, String> {\n\n for _ in 0..POLL_NUM_ATTEMPTS {\n\n println!(\"Attempting to poll.\");\n\n match future.poll() {\n\n Ok(res) => {\n\n if let Async::Ready(conn) = res {\n\n return Ok(conn);\n\n }\n\n }\n\n Err(s) => return Err(s),\n\n };\n\n\n\n ::std::thread::sleep(::std::time::Duration::from_millis(\n\n POLL_TIME_BETWEEN_ATTEMPTS_MILLIS,\n\n ));\n\n }\n\n\n\n Err(\"Max connection attempts failed.\".to_owned())\n\n}\n","file_path":"project-example/src/connection_handler.rs","rank":53,"score":28089.057588113257},{"content":"fn empty_string_is_none<'de, D>(d: D) -> Result<Option<String>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n let o: Option<String> = Option::deserialize(d)?;\n\n Ok(o.filter(|s| !s.is_empty()))\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Clone, Debug)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct SourceReference {\n\n pub line: u32,\n\n pub column: u32,\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Clone, Debug)]\n\npub enum PrimitiveType {\n\n Invalid = 0,\n\n Int32 = 1,\n\n Int64 = 2,\n","file_path":"spatialos-sdk-code-generator/src/schema_bundle.rs","rank":54,"score":25782.196965937634},{"content":"use spatialos_sdk::worker::internal::schema::*;\n\nuse spatialos_sdk::worker::component::*;\n\nuse std::collections::BTreeMap;\n\n\n\nuse super::super::generated as generated;\n\n\n\n/* Enums. */\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub enum TestEnum {\n\n\n\n FIRST,\n\n SECOND,\n\n}\n\n\n\nimpl From<u32> for TestEnum {\n\n fn from(value: u32) -> Self {\n\n match value {\n\n\n\n 0 => TestEnum::FIRST, \n\n 1 => TestEnum::SECOND, \n","file_path":"project-example/src/generated.rs","rank":56,"score":35.449164767180946},{"content":"use spatialos_sdk::worker::internal::schema::*;\n\nuse spatialos_sdk::worker::component::*;\n\nuse std::collections::BTreeMap;\n\n\n\nuse <#= vec![\"super\".to_string(); self.depth() + 1].join(\"::\") #>::generated as generated;\n\n\n\n/* Enums. */<# for enum_name in &self.enums {\n\nlet enum_def = self.get_enum_definition(enum_name);\n\nlet enum_rust_name = self.rust_name(&enum_def.qualified_name);\n\n#>\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub enum <#= enum_rust_name #> {\n\n<# for enum_value in &enum_def.values { #>\n\n <#= enum_value.name #>,<# } #>\n\n}\n\n\n\nimpl From<u32> for <#= enum_rust_name #> {\n\n fn from(value: u32) -> Self {\n\n match value {\n\n<# for enum_value in &enum_def.values { #>\n","file_path":"spatialos-sdk-code-generator/src/generated_code_mod.tt.rs","rank":57,"score":30.732391517872784},{"content":"#[macro_use]\n\nextern crate lazy_static;\n\n\n\nuse std::env;\n\nuse std::path::Path;\n\n\n\n#[cfg(windows)]\n\nlazy_static! {\n\n static ref LIBS: Vec<&'static str> =\n\n vec![\"improbable_worker\", \"RakNetLibStatic\", \"ssl\", \"zlibstatic\",];\n\n}\n\n\n\n#[cfg(unix)]\n\nlazy_static! {\n\n static ref LIBS: Vec<&'static str> = vec![\"improbable_worker\", \"RakNetLibStatic\", \"ssl\", \"z\",];\n\n}\n\n\n\n#[cfg(target_os = \"linux\")]\n\nstatic PACKAGE_DIR: &str = \"linux\";\n\n#[cfg(target_os = \"macos\")]\n\nstatic PACKAGE_DIR: &str = \"macos\";\n\n#[cfg(target_os = \"windows\")]\n\nstatic PACKAGE_DIR: &str = \"win\";\n\n\n","file_path":"spatialos-sdk-sys/build.rs","rank":58,"score":30.216914781249002},{"content":" }\n\n}\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\n\npub enum Authority {\n\n Authoritative,\n\n AuthorityLossImminent,\n\n NotAuthoritative,\n\n}\n\n\n\nimpl Authority {\n\n pub fn has_authority(self) -> bool {\n\n self != Authority::NotAuthoritative\n\n }\n\n}\n\n\n\nimpl From<u8> for Authority {\n\n fn from(auth: u8) -> Self {\n\n match auth {\n\n 0 => Authority::NotAuthoritative,\n","file_path":"spatialos-sdk/src/worker/mod.rs","rank":59,"score":28.894362161268905},{"content":" 1 => Authority::Authoritative,\n\n 2 => Authority::AuthorityLossImminent,\n\n _ => panic!(\"Unknown authority state: {}\", auth),\n\n }\n\n }\n\n}\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd)]\n\npub enum LogLevel {\n\n Debug,\n\n Info,\n\n Warn,\n\n Error,\n\n Fatal,\n\n}\n\n\n\nimpl LogLevel {\n\n fn to_worker_sdk(self) -> u8 {\n\n match self {\n\n LogLevel::Debug => 1,\n\n LogLevel::Info => 2,\n","file_path":"spatialos-sdk/src/worker/mod.rs","rank":61,"score":26.734139008966935},{"content":" }\n\n}\n\n\n\ninventory::submit!(VTable::new::<Position>());\n\n\n\n\n\n\n\npub mod restricted {\n\nuse spatialos_sdk::worker::internal::schema::*;\n\nuse spatialos_sdk::worker::component::*;\n\nuse std::collections::BTreeMap;\n\n\n\nuse super::super::super::generated as generated;\n\n\n\n/* Enums. */\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub enum Connection_ConnectionStatus {\n\n\n\n UNKNOWN,\n\n AWAITING_WORKER_CONNECTION,\n","file_path":"project-example/src/generated.rs","rank":62,"score":26.316304342032467},{"content":"use std::marker::PhantomData;\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, Default)]\n\npub struct EntityId {\n\n pub id: i64,\n\n}\n\n\n\nimpl EntityId {\n\n pub fn new(id: i64) -> EntityId {\n\n EntityId { id }\n\n }\n\n\n\n pub fn is_valid(self) -> bool {\n\n self.id > 0\n\n }\n\n}\n\n\n\nimpl Display for EntityId {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {\n\n write!(f, \"EntityId: {}\", self.id)\n","file_path":"spatialos-sdk/src/worker/mod.rs","rank":63,"score":25.515734267253016},{"content":"}\n\nimpl Default for Worker_FlagUpdateOp {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Data for a log message from the SDK.\"]\n\n#[doc = \" Note: Worker_LogMessageOp has been deprecated and will be removed in a future version of\"]\n\n#[doc = \" SpatialOS.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_LogMessageOp {\n\n #[doc = \" The severity of the log message; defined in the Worker_LogLevel enumeration.\"]\n\n pub level: u8,\n\n #[doc = \" The message.\"]\n\n pub message: *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_LogMessageOp {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":64,"score":24.26522670149743},{"content":" }\n\n}\n\n#[doc = \" Tuning parameters for configuring protocol logging in the SDK. Used by\"]\n\n#[doc = \" Worker_ConnectionParameters.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_ProtocolLoggingParameters {\n\n #[doc = \" Log file names are prefixed with this prefix, are numbered, and have the extension .log.\"]\n\n pub log_prefix: *const ::std::os::raw::c_char,\n\n #[doc = \" Maximum number of log files to keep. Note that logs from any previous protocol logging\"]\n\n #[doc = \" sessions will be overwritten.\"]\n\n pub max_log_files: u32,\n\n #[doc = \" Once the size of a log file reaches this size, a new log file is created.\"]\n\n pub max_log_file_size_bytes: u32,\n\n}\n\nimpl Default for Worker_ProtocolLoggingParameters {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":65,"score":23.43249053794343},{"content":" pub login_token: Worker_LoginTokenCredentials,\n\n #[doc = \" Parameters used if the WORKER_STEAM_CREDENTIALS flag is set.\"]\n\n pub steam: Worker_SteamCredentials,\n\n #[doc = \" The player identity token/login token pair used for authentication.\"]\n\n pub player_identity: Worker_PlayerIdentityCredentials,\n\n #[doc = \" Whether to use an insecure (non-TLS) connection for local development.\"]\n\n pub use_insecure_connection: u8,\n\n #[doc = \" Parameters for configuring logging.\"]\n\n pub logging: Worker_ProtocolLoggingParameters,\n\n #[doc = \" Whether to enable logging for the Locator flow.\"]\n\n pub enable_logging: u8,\n\n}\n\nimpl Default for Worker_LocatorParameters {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Details of a specific deployment obtained via Worker_Locator_GetDeploymentListAsync.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":66,"score":22.839887281540463},{"content":" }\n\n}\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_OrConstraint {\n\n pub constraint_count: u32,\n\n pub constraints: *mut Worker_Constraint,\n\n}\n\nimpl Default for Worker_OrConstraint {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_NotConstraint {\n\n pub constraint: *mut Worker_Constraint,\n\n}\n\nimpl Default for Worker_NotConstraint {\n\n fn default() -> Self {\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":67,"score":22.7033163020236},{"content":" #[doc = \" The severity of the log message; defined in the Worker_LogLevel enumeration.\"]\n\n pub level: u8,\n\n #[doc = \" The name of the logger.\"]\n\n pub logger_name: *const ::std::os::raw::c_char,\n\n #[doc = \" The full log message.\"]\n\n pub message: *const ::std::os::raw::c_char,\n\n #[doc = \" The ID of the entity this message relates to, or NULL for none.\"]\n\n pub entity_id: *const Worker_EntityId,\n\n}\n\nimpl Default for Worker_LogMessage {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Parameters for a gauge metric.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_GaugeMetric {\n\n pub key: *const ::std::os::raw::c_char,\n\n pub value: f64,\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":68,"score":22.452280269024136},{"content":" }\n\n}\n\n\n\n#[derive(Derivative)]\n\n#[derivative(\n\n Debug(bound = \"\"),\n\n Copy(bound = \"\"),\n\n Clone(bound = \"\"),\n\n PartialEq(bound = \"\"),\n\n Eq(bound = \"\"),\n\n Hash(bound = \"\")\n\n)]\n\npub struct RequestId<T> {\n\n id: i64,\n\n _type: PhantomData<*const T>,\n\n}\n\n\n\nimpl<T> Ord for RequestId<T> {\n\n fn cmp(&self, other: &Self) -> Ordering {\n\n self.id.cmp(&other.id)\n","file_path":"spatialos-sdk/src/worker/mod.rs","rank":69,"score":22.403765686312468},{"content":"}\n\nimpl Default for Worker_SteamCredentials {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Parameters for authenticating using a Player Identity Token and Login Token.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_PlayerIdentityCredentials {\n\n #[doc = \" Authenticates a user to a single deployment. Obtained from a game authentication server\"]\n\n #[doc = \" using a PIT.\"]\n\n pub player_identity_token: *const ::std::os::raw::c_char,\n\n #[doc = \" Uniquely identifies a user across deployments, and is provided by a game authentication\"]\n\n #[doc = \" server.\"]\n\n pub login_token: *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_PlayerIdentityCredentials {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":70,"score":22.244807722869826},{"content":"impl ConnectionParameters {\n\n pub fn new<T: AsRef<str>>(worker_type: T) -> Self {\n\n let mut params = ConnectionParameters::default();\n\n params.worker_type =\n\n CString::new(worker_type.as_ref()).expect(\"`worker_type` contains a null byte\");\n\n params\n\n }\n\n\n\n pub fn with_protocol_logging<T: AsRef<str>>(mut self, log_prefix: T) -> Self {\n\n self.enable_protocol_logging_at_startup = true;\n\n self.protocol_logging.log_prefix =\n\n CString::new(log_prefix.as_ref()).expect(\"`log_prefix` contained a null byte\");\n\n self\n\n }\n\n\n\n pub fn using_tcp(self) -> Self {\n\n self.using_tcp_with_params(TcpNetworkParameters::default())\n\n }\n\n\n\n pub fn using_tcp_with_params(mut self, params: TcpNetworkParameters) -> Self {\n","file_path":"spatialos-sdk/src/worker/parameters.rs","rank":71,"score":22.038505660940313},{"content":"#[derive(Debug, Copy, Clone)]\n\npub struct Worker_LoginTokenCredentials {\n\n #[doc = \" The token would typically be provided on the command-line by the SpatialOS launcher.\"]\n\n pub token: *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_LoginTokenCredentials {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Parameters for authenticating using Steam credentials.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_SteamCredentials {\n\n #[doc = \" Steam ticket for the steam app ID and publisher key corresponding to the project name specified\"]\n\n #[doc = \" in the Worker_LocatorParameters. Typically obtained from the steam APIs.\"]\n\n pub ticket: *const ::std::os::raw::c_char,\n\n #[doc = \" Deployment tag to request access for. If non-empty, must match the following regex:\"]\n\n #[doc = \" [A-Za-z0-9][A-Za-z0-9_]*\"]\n\n pub deployment_tag: *const ::std::os::raw::c_char,\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":72,"score":22.014239572406595},{"content":"impl Default for Worker_CommandResponse {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" An object used to represent a component data snapshot by either raw schema data or some\"]\n\n#[doc = \" user-defined handle type.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_ComponentData {\n\n pub reserved: *mut ::std::os::raw::c_void,\n\n pub component_id: Worker_ComponentId,\n\n pub schema_type: *mut Schema_ComponentData,\n\n pub user_handle: *mut Worker_ComponentDataHandle,\n\n}\n\nimpl Default for Worker_ComponentData {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":73,"score":21.842931662971278},{"content":" /// Resolves the unresolved path into an absolute path.\n\n fn resolve_path(&self, unresolved_path: &str) -> String {\n\n let path = Path::new(unresolved_path);\n\n\n\n if path.is_absolute() {\n\n return path.to_str().unwrap().to_owned();\n\n }\n\n\n\n let mut cwd = ::std::env::current_dir().unwrap();\n\n cwd.push(path);\n\n\n\n cwd.to_str().unwrap().to_owned()\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Serialize, Deserialize)]\n\n#[serde(rename_all = \"lowercase\")]\n\npub enum BuildProfile {\n\n Debug,\n\n Release,\n\n}\n","file_path":"cargo-spatial/src/config.rs","rank":74,"score":21.474657682157847},{"content":" pub error: *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_QueueStatus {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Component update parameters. Used to modify the behaviour of a component update request.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Default, Copy, Clone)]\n\npub struct Worker_UpdateParameters {\n\n #[doc = \" Controls how the update is sent back to the worker from which it was sent. Defined in the\"]\n\n #[doc = \" Worker_ComponentUpdateLoopback enumeration.\"]\n\n pub loopback: u8,\n\n}\n\n#[doc = \" Command parameters. Used to modify the behaviour of a command request.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Default, Copy, Clone)]\n\npub struct Worker_CommandParameters {\n\n #[doc = \" Allow command requests to bypass the bridge when this worker is authoritative over the target\"]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":75,"score":21.409560666363674},{"content":" pub use_insecure_connection: u8,\n\n}\n\nimpl Default for Worker_Alpha_PlayerIdentityTokenRequest {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" The result of creating a player identity token.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_Alpha_PlayerIdentityTokenResponse {\n\n #[doc = \" The returned player identity token.\"]\n\n pub player_identity_token: *const ::std::os::raw::c_char,\n\n #[doc = \" The status code and a human readable description of the status of the request.\"]\n\n pub status: Worker_ConnectionStatus,\n\n}\n\nimpl Default for Worker_Alpha_PlayerIdentityTokenResponse {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":76,"score":21.254693077511018},{"content":"use crate::worker::component::{self, Component, ComponentId, DATABASE};\n\nuse crate::worker::internal::schema::SchemaComponentData;\n\nuse spatialos_sdk_sys::worker::{Schema_DestroyComponentData, Worker_ComponentData, Worker_Entity};\n\nuse std::collections::HashMap;\n\nuse std::ptr;\n\nuse std::slice;\n\n\n\n#[derive(Debug)]\n\npub struct Entity {\n\n components: HashMap<ComponentId, Worker_ComponentData>,\n\n}\n\n\n\nimpl Entity {\n\n pub fn new() -> Self {\n\n Entity::default()\n\n }\n\n\n\n pub(crate) unsafe fn from_worker_sdk(raw_entity: &Worker_Entity) -> Result<Self, String> {\n\n let mut entity = Entity::new();\n\n\n","file_path":"spatialos-sdk/src/worker/entity.rs","rank":77,"score":21.221492182109113},{"content":"}\n\nimpl Default for Worker_GaugeMetric {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[repr(C)]\n\n#[derive(Debug, Default, Copy, Clone)]\n\npub struct Worker_HistogramMetricBucket {\n\n pub upper_bound: f64,\n\n pub samples: u32,\n\n}\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_HistogramMetric {\n\n pub key: *const ::std::os::raw::c_char,\n\n pub sum: f64,\n\n pub bucket_count: u32,\n\n pub buckets: *const Worker_HistogramMetricBucket,\n\n}\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":78,"score":20.72244843032482},{"content":" }\n\n\n\n pub fn with_logging(self) -> Self {\n\n self.with_logging_params(ProtocolLoggingParameters::default())\n\n }\n\n\n\n pub fn with_logging_params(mut self, params: ProtocolLoggingParameters) -> Self {\n\n self.logging = Some(params);\n\n self\n\n }\n\n}\n\n\n\npub struct PlayerIdentityCredentials {\n\n player_identity_token: CString,\n\n login_token: CString,\n\n}\n\n\n\nimpl PlayerIdentityCredentials {\n\n pub fn new<S: AsRef<str>, T: AsRef<str>>(pit: S, token: T) -> Self {\n\n PlayerIdentityCredentials {\n","file_path":"spatialos-sdk/src/worker/locator.rs","rank":79,"score":20.27803428133916},{"content":"#[repr(C)]\n\n#[derive(Copy, Clone)]\n\npub struct Worker_Constraint {\n\n #[doc = \" The type of constraint, defined using Worker_ConstraintType.\"]\n\n pub constraint_type: u8,\n\n #[doc = \" Union with fields corresponding to each constraint type.\"]\n\n pub constraint: Worker_Constraint_Union,\n\n}\n\nimpl Default for Worker_Constraint {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\npub const Worker_ResultType_WORKER_RESULT_TYPE_COUNT: Worker_ResultType = 1;\n\npub const Worker_ResultType_WORKER_RESULT_TYPE_SNAPSHOT: Worker_ResultType = 2;\n\npub type Worker_ResultType = i32;\n\n#[doc = \" An entity query.\"]\n\n#[repr(C)]\n\n#[derive(Copy, Clone)]\n\npub struct Worker_EntityQuery {\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":80,"score":20.209256251040372},{"content":"pub struct Worker_Deployment {\n\n #[doc = \" Name of the deployment.\"]\n\n pub deployment_name: *const ::std::os::raw::c_char,\n\n #[doc = \" The name of the assembly used by this deployment.\"]\n\n pub assembly_name: *const ::std::os::raw::c_char,\n\n #[doc = \" Description of the deployment.\"]\n\n pub description: *const ::std::os::raw::c_char,\n\n #[doc = \" Number of users currently connected to the deployment.\"]\n\n pub users_connected: u32,\n\n #[doc = \" Total user capacity of the deployment.\"]\n\n pub users_capacity: u32,\n\n}\n\nimpl Default for Worker_Deployment {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" A deployment list obtained via Worker_Locator_GetDeploymentListAsync.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":81,"score":20.11543162654935},{"content":" use_insecure_connection: self.use_insecure_connection as u8,\n\n logging: match self.logging {\n\n Some(ref params) => params.to_worker_sdk(),\n\n None => ProtocolLoggingParameters::default().to_worker_sdk(),\n\n },\n\n enable_logging: self.logging.is_some() as u8,\n\n }\n\n }\n\n\n\n pub fn new(credentials: PlayerIdentityCredentials) -> Self {\n\n LocatorParameters {\n\n credentials,\n\n use_insecure_connection: false,\n\n logging: None,\n\n }\n\n }\n\n\n\n pub fn with_insecure_connection(mut self) -> Self {\n\n self.use_insecure_connection = true;\n\n self\n","file_path":"spatialos-sdk/src/worker/locator.rs","rank":82,"score":19.991306902441092},{"content":"pub struct Worker_ComponentConstraint {\n\n pub component_id: Worker_ComponentId,\n\n}\n\n#[repr(C)]\n\n#[derive(Debug, Default, Copy, Clone)]\n\npub struct Worker_SphereConstraint {\n\n pub x: f64,\n\n pub y: f64,\n\n pub z: f64,\n\n pub radius: f64,\n\n}\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_AndConstraint {\n\n pub constraint_count: u32,\n\n pub constraints: *mut Worker_Constraint,\n\n}\n\nimpl Default for Worker_AndConstraint {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":83,"score":19.911759565500695},{"content":"/// # Examples\n\n///\n\n/// ```\n\n/// use spatialos_sdk::worker::commands::CommandParameters;\n\n/// use tap::*;\n\n///\n\n/// let params = CommandParameters::new()\n\n/// .tap(CommandParameters::allow_short_circuit);\n\n/// ```\n\n///\n\n/// [short-circuit]: https://docs.improbable.io/reference/14.1/shared/design/commands#component-commands\n\n/// [tap]: https://crates.io/crates/tap\n\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash)]\n\npub struct CommandParameters {\n\n allow_short_circuit: bool,\n\n}\n\n\n\nimpl CommandParameters {\n\n /// Creates a new `CommandParameters` with default values for all parameters.\n\n pub fn new() -> CommandParameters {\n","file_path":"spatialos-sdk/src/worker/commands.rs","rank":84,"score":19.75909911382676},{"content":" pub op: Worker_Op_Union,\n\n}\n\nimpl Default for Worker_Op {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" An op list, usually returned by Worker_Connection_GetOpList.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_OpList {\n\n pub ops: *mut Worker_Op,\n\n pub op_count: u32,\n\n}\n\nimpl Default for Worker_OpList {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\npub const Worker_NetworkSecurityType_WORKER_NETWORK_SECURITY_TYPE_INSECURE:\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":85,"score":19.72826548034094},{"content":" #[doc = \" Whether the worker is interested in this component.\"]\n\n pub is_interested: u8,\n\n}\n\n#[doc = \" Worker attributes that are part of a worker's runtime configuration.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_WorkerAttributes {\n\n #[doc = \" Number of worker attributes.\"]\n\n pub attribute_count: u32,\n\n #[doc = \" Will be NULL if there are no attributes associated with the worker.\"]\n\n pub attributes: *mut *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_WorkerAttributes {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Data for a disconnect message from the SDK.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":86,"score":19.63989084964265},{"content":" _ => panic!(format!(\"Could not convert {} to enum TestEnum.\", value))\n\n }\n\n }\n\n}\n\n\n\nimpl TestEnum {\n\n pub(crate) fn as_u32(self) -> u32 {\n\n match self {\n\n \n\n TestEnum::FIRST => 0, \n\n TestEnum::SECOND => 1, \n\n }\n\n }\n\n}\n\n\n\n/* Types. */\n\n#[derive(Debug, Clone)]\n\npub struct CommandData {\n\n pub value: i32,\n\n}\n","file_path":"project-example/src/generated.rs","rank":87,"score":19.554706518898865},{"content":" pub entity_id: Worker_EntityId,\n\n #[doc = \" Status code of the response, using Worker_StatusCode.\"]\n\n pub status_code: u8,\n\n #[doc = \" The error message.\"]\n\n pub message: *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_DeleteEntityResponseOp {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" A response indicating the result of an entity query request.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_EntityQueryResponseOp {\n\n #[doc = \" The ID of the entity query request for which there was a response.\"]\n\n pub request_id: Worker_RequestId,\n\n #[doc = \" Status code of the response, using Worker_StatusCode.\"]\n\n pub status_code: u8,\n\n #[doc = \" The error message.\"]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":88,"score":19.531988246798647},{"content":" pub component_data_copy: Worker_ComponentDataCopy,\n\n pub component_data_deserialize: Worker_ComponentDataDeserialize,\n\n pub component_data_serialize: Worker_ComponentDataSerialize,\n\n pub component_update_free: Worker_ComponentUpdateFree,\n\n pub component_update_copy: Worker_ComponentUpdateCopy,\n\n pub component_update_deserialize: Worker_ComponentUpdateDeserialize,\n\n pub component_update_serialize: Worker_ComponentUpdateSerialize,\n\n}\n\nimpl Default for Worker_ComponentVtable {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" An object used to represent a command request by either raw schema data or some user-defined\"]\n\n#[doc = \" handle type.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_CommandRequest {\n\n pub reserved: *mut ::std::os::raw::c_void,\n\n pub component_id: Worker_ComponentId,\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":89,"score":19.504830318868482},{"content":" #[doc = \" entity-component.\"]\n\n pub allow_short_circuit: u8,\n\n}\n\n#[doc = \" Information about status of a network request.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_ConnectionStatus {\n\n #[doc = \" The status of the request. This value is a member of the enum Worker_ConnectionStatusCode.\"]\n\n pub code: u8,\n\n #[doc = \" Detailed, human readable description of the connection status.\"]\n\n #[doc = \" Will be \\\"OK\\\" if no error occurred.\"]\n\n pub detail: *const ::std::os::raw::c_char,\n\n}\n\nimpl Default for Worker_ConnectionStatus {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" The parameters used when creating a player identity token.\"]\n\n#[repr(C)]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":90,"score":19.480543371539834},{"content":"}\n\n#[doc = \" The parameters used when creating a login token.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_Alpha_LoginTokensRequest {\n\n #[doc = \" The player identity token of the player\"]\n\n pub player_identity_token: *const ::std::os::raw::c_char,\n\n #[doc = \" The worker type for which the requested LTs are scoped for.\"]\n\n pub worker_type: *const ::std::os::raw::c_char,\n\n #[doc = \" The lifetime duration of the requested LTs. This is an optional field.\"]\n\n #[doc = \" If the pointer is null, a default value of 15 minutes will be used.\"]\n\n pub duration_seconds: *const u32,\n\n #[doc = \" Whether to use an insecure (non-TLS) connection for local development.\"]\n\n #[doc = \" An insecure connection must be used when connecting to a local development login service.\"]\n\n #[doc = \" A secure connection must be used when connecting to a cloud development login service.\"]\n\n pub use_insecure_connection: u8,\n\n}\n\nimpl Default for Worker_Alpha_LoginTokensRequest {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":91,"score":19.478443561177492},{"content":"use crate::config::Config;\n\nuse crate::format_arg;\n\nuse log::*;\n\nuse spatialos_sdk_code_generator::{generator, schema_bundle};\n\nuse std::fs::{self, File};\n\nuse std::io::prelude::*;\n\nuse std::path::*;\n\nuse std::process::Command;\n\n\n\n/// Performs code generation for the project described by `config`.\n\n///\n\n/// Assumes that the current working directory is the root directory of the project,\n\n/// i.e. the directory that has the `Spatial.toml` file.\n","file_path":"cargo-spatial/src/codegen.rs","rank":93,"score":18.709435389170586},{"content":" }\n\n}\n\n#[doc = \" Data for a set of built-in metrics reported by the SDK.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_MetricsOp {\n\n pub metrics: Worker_Metrics,\n\n}\n\nimpl Default for Worker_MetricsOp {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Data for a critical section boundary (enter or leave) operation.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Default, Copy, Clone)]\n\npub struct Worker_CriticalSectionOp {\n\n #[doc = \" Whether the protocol is entering a critical section (true) or leaving it (false).\"]\n\n pub in_critical_section: u8,\n\n}\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":94,"score":18.681051495560816},{"content":" pub request_id: Worker_RequestId,\n\n #[doc = \" Status code of the response, using Worker_StatusCode.\"]\n\n pub status_code: u8,\n\n #[doc = \" The error message.\"]\n\n pub message: *const ::std::os::raw::c_char,\n\n #[doc = \" If successful, the entity ID of the newly created entity.\"]\n\n pub entity_id: Worker_EntityId,\n\n}\n\nimpl Default for Worker_CreateEntityResponseOp {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Data for a DeleteEntity operation.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_DeleteEntityResponseOp {\n\n #[doc = \" The ID of the delete entity request for which there was a command response.\"]\n\n pub request_id: Worker_RequestId,\n\n #[doc = \" The ID of the target entity of this request.\"]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":95,"score":18.276806845531304},{"content":" pub request: Worker_CommandRequest,\n\n}\n\nimpl Default for Worker_CommandRequestOp {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" Data for a CommandResponse operation.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_CommandResponseOp {\n\n #[doc = \" The ID of the command request for which there was a command response.\"]\n\n pub request_id: Worker_RequestId,\n\n #[doc = \" The ID of the entity originally targeted by the command request.\"]\n\n pub entity_id: Worker_EntityId,\n\n #[doc = \" Status code of the response, using Worker_StatusCode.\"]\n\n pub status_code: u8,\n\n #[doc = \" The error message.\"]\n\n pub message: *const ::std::os::raw::c_char,\n\n #[doc = \" The command response data. Deserialized with the corresponding vtable deserialize function and\"]\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":96,"score":18.27680684553131},{"content":" log_prefix: CString,\n\n max_log_files: u32,\n\n max_log_file_size_bytes: u32,\n\n}\n\n\n\nimpl ProtocolLoggingParameters {\n\n pub fn new() -> Self {\n\n Default::default()\n\n }\n\n\n\n /// Sets the prefix string to be used for log file names.\n\n ///\n\n /// # Panics\n\n ///\n\n /// This will panic if `prefix` contains a 0 byte. This is a requirement imposed\n\n /// by the underlying SpatialOS API.\n\n pub fn set_prefix<T: AsRef<str>>(&mut self, prefix: T) {\n\n self.log_prefix = CString::new(prefix.as_ref()).expect(\"`prefix` contained a null byte\");\n\n }\n\n\n","file_path":"spatialos-sdk/src/worker/parameters.rs","rank":97,"score":18.255431016580182},{"content":" pub command_index: Worker_CommandIndex,\n\n pub schema_type: *mut Schema_CommandRequest,\n\n pub user_handle: *mut Worker_CommandRequestHandle,\n\n}\n\nimpl Default for Worker_CommandRequest {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n\n#[doc = \" An object used to represent a command response by either raw schema data or some user-defined\"]\n\n#[doc = \" handle type.\"]\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Worker_CommandResponse {\n\n pub reserved: *mut ::std::os::raw::c_void,\n\n pub component_id: Worker_ComponentId,\n\n pub command_index: Worker_CommandIndex,\n\n pub schema_type: *mut Schema_CommandResponse,\n\n pub user_handle: *mut Worker_CommandResponseHandle,\n\n}\n","file_path":"spatialos-sdk-sys/src/worker.rs","rank":98,"score":18.17902694569161},{"content":"use crate::worker::{component::DATABASE, vtable};\n\nuse spatialos_sdk_sys::worker::*;\n\nuse std::{\n\n ffi::{CStr, CString},\n\n ptr,\n\n};\n\n\n\npub struct ConnectionParameters {\n\n pub worker_type: CString,\n\n pub network: NetworkParameters,\n\n pub send_queue_capacity: u32,\n\n pub receive_queue_capacity: u32,\n\n pub log_message_queue_capacity: u32,\n\n pub built_in_metrics_report_period_millis: u32,\n\n pub protocol_logging: ProtocolLoggingParameters,\n\n pub enable_protocol_logging_at_startup: bool,\n\n pub thread_affinity: ThreadAffinityParameters,\n\n use_internal_serialization: bool,\n\n}\n\n\n","file_path":"spatialos-sdk/src/worker/parameters.rs","rank":99,"score":18.155361911308024}],"string":"[\n {\n \"content\": \"/// Formats an key-value pair into an argument string.\\n\\npub fn format_arg<S: AsRef<OsStr>>(prefix: &str, value: S) -> OsString {\\n\\n let mut arg = OsString::from(format!(\\\"--{}=\\\", prefix));\\n\\n arg.push(value.as_ref());\\n\\n arg\\n\\n}\\n\",\n \"file_path\": \"cargo-spatial/src/lib.rs\",\n \"rank\": 0,\n \"score\": 90548.65107011895\n },\n {\n \"content\": \"pub fn main() {\\n\\n let input_filename = args().nth(1).unwrap();\\n\\n let output_filename = args().nth(2).unwrap();\\n\\n\\n\\n let mut input_file =\\n\\n File::open(input_filename).expect(\\\"Unable to open the test schema bundle.\\\");\\n\\n let mut contents = String::new();\\n\\n input_file\\n\\n .read_to_string(&mut contents)\\n\\n .expect(\\\"Unable to read the test schema bundle\\\");\\n\\n let generated_file = generator::generate_code(schema_bundle::load_bundle(&contents).unwrap());\\n\\n let mut output_file = File::create(output_filename).unwrap();\\n\\n output_file.write_all(generated_file.as_bytes()).unwrap();\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/bin.rs\",\n \"rank\": 2,\n \"score\": 87527.3893469573\n },\n {\n \"content\": \"/// Performs code generation for the project described by `config`.\\n\\n///\\n\\n/// Assumes that the current working directory is the root directory of the project,\\n\\n/// i.e. the directory that has the `Spatial.toml` file.\\n\\npub fn run_codegen(config: &Config) -> Result<(), Box<dyn std::error::Error>> {\\n\\n assert!(\\n\\n crate::current_dir_is_root(),\\n\\n \\\"Current directory should be the project root\\\"\\n\\n );\\n\\n\\n\\n // Ensure that the path to the Spatial SDK has been specified.\\n\\n let spatial_lib_dir = config.spatial_lib_dir()\\n\\n .map(PathBuf::from)\\n\\n .ok_or(\\\"spatial_lib_dir value must be set in the config, or the SPATIAL_LIB_DIR environment variable must be set\\\")?;\\n\\n\\n\\n // Determine the paths the the schema compiler and protoc relative the the lib\\n\\n // dir path.\\n\\n let schema_compiler_path = spatial_lib_dir.join(\\\"schema-compiler/schema_compiler\\\");\\n\\n let std_lib_path = spatial_lib_dir.join(\\\"std-lib\\\");\\n\\n\\n\\n // Calculate the various output directories relative to `output_dir`.\\n\\n let output_dir = PathBuf::from(config.schema_build_dir());\\n\\n let bundle_json_path = output_dir.join(\\\"bundle.json\\\");\\n\\n let schema_descriptor_path = output_dir.join(\\\"schema.descriptor\\\");\\n\",\n \"file_path\": \"cargo-spatial/src/codegen.rs\",\n \"rank\": 3,\n \"score\": 83880.68281104487\n },\n {\n \"content\": \"pub fn cstr_to_string(ptr: *const std::os::raw::c_char) -> String {\\n\\n assert!(!ptr.is_null());\\n\\n unsafe {\\n\\n CStr::from_ptr(ptr)\\n\\n .to_owned()\\n\\n .into_string()\\n\\n .expect(\\\"Failed to unwrap string\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/internal/utils.rs\",\n \"rank\": 4,\n \"score\": 83189.35516901535\n },\n {\n \"content\": \"#[test]\\n\\npub fn create_and_read_snapshot() {\\n\\n let snapshot_path = env::temp_dir().join(\\\"test.snapshot\\\");\\n\\n\\n\\n let entity = get_test_entity().expect(\\\"Error\\\");\\n\\n\\n\\n {\\n\\n SnapshotOutputStream::new(snapshot_path.clone())\\n\\n .expect(\\\"Error\\\")\\n\\n .write_entity(EntityId::new(1), &entity)\\n\\n .expect(\\\"Error\\\");\\n\\n }\\n\\n\\n\\n {\\n\\n let mut snapshot = SnapshotInputStream::new(snapshot_path).expect(\\\"Error\\\");\\n\\n\\n\\n assert!(snapshot.has_next());\\n\\n\\n\\n let entity = snapshot.read_entity().expect(\\\"Error\\\");\\n\\n\\n\\n let position = entity.get::<Position>();\\n\",\n \"file_path\": \"test-suite/src/snapshot_integration_tests.rs\",\n \"rank\": 5,\n \"score\": 83028.42414328185\n },\n {\n \"content\": \"pub fn cstr_array_to_vec_string(\\n\\n char_ptr: *mut *const std::os::raw::c_char,\\n\\n count: u32,\\n\\n) -> Vec<String> {\\n\\n let mut strings = Vec::new();\\n\\n unsafe {\\n\\n for i in 0..count as isize {\\n\\n let ptr = char_ptr.offset(i) as *mut *const std::os::raw::c_char;\\n\\n assert!(!ptr.is_null());\\n\\n strings.push(cstr_to_string(*ptr));\\n\\n }\\n\\n }\\n\\n strings\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/internal/utils.rs\",\n \"rank\": 6,\n \"score\": 81031.58997203186\n },\n {\n \"content\": \"pub fn load_bundle(data: &str) -> Result<SchemaBundle, serde_json::Error> {\\n\\n serde_json::from_str::<SchemaBundle>(data)\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/schema_bundle.rs\",\n \"rank\": 7,\n \"score\": 80991.32637678923\n },\n {\n \"content\": \"/// Generates a random, valid component ID.\\n\\n///\\n\\n/// Component IDs are `i32` values that must be:\\n\\n///\\n\\n/// * Greater than 100.\\n\\n/// * Less than 536,870,911.\\n\\n/// * Not in the range 190,000 to 199999.\\n\\npub fn generate_component_id() -> i32 {\\n\\n use rand::Rng;\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n loop {\\n\\n let num = rng.gen();\\n\\n if num > 100 && (num < 190_000 || num > 199_999) && num < 536_870_911 {\\n\\n return num;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cargo-spatial/src/lib.rs\",\n \"rank\": 8,\n \"score\": 80029.70775329013\n },\n {\n \"content\": \"/// Returns true if the current working directory is the project root (i.e. has the\\n\\n/// `Spatial.toml` file).\\n\\npub fn current_dir_is_root() -> bool {\\n\\n std::path::Path::new(\\\"./Spatial.toml\\\").exists()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cargo-spatial/src/lib.rs\",\n \"rank\": 9,\n \"score\": 80029.70775329013\n },\n {\n \"content\": \"#[test]\\n\\npub fn writing_invalid_entity_returns_error() {\\n\\n let snapshot_path = env::temp_dir().join(\\\"test2.snapshot\\\");\\n\\n\\n\\n let entity = Entity::new();\\n\\n\\n\\n let error = SnapshotOutputStream::new(snapshot_path)\\n\\n .expect(\\\"Error\\\")\\n\\n .write_entity(EntityId::new(1), &entity);\\n\\n\\n\\n assert!(error.is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-suite/src/snapshot_integration_tests.rs\",\n \"rank\": 10,\n \"score\": 79178.8752365093\n },\n {\n \"content\": \"/// Prepares and launches a local deployment.\\n\\n///\\n\\n/// Before launching the deployment, this will first run code generation and build\\n\\n/// workers in the project. Assumes that the current working directory is the root\\n\\n/// directory of the project, i.e. the directory that has the `Spatial.toml` file.\\n\\npub fn launch(config: &Config, launch: &LocalLaunch) -> Result<(), Box<dyn std::error::Error>> {\\n\\n assert!(\\n\\n crate::current_dir_is_root(),\\n\\n \\\"Current directory should be the project root\\\"\\n\\n );\\n\\n\\n\\n // Run codegen and such.\\n\\n crate::codegen::run_codegen(config)?;\\n\\n\\n\\n // Use `cargo install` to build workers and copy the exectuables to the build\\n\\n // directory.\\n\\n //\\n\\n // TODO: Manually copy the built executables instead of using `cargo install`.\\n\\n // `cargo install` doesn't use the same build cache as normal builds, so it will\\n\\n // sometimes result in unnecessary recompilation, which can slow down launch times.\\n\\n if !launch.no_build {\\n\\n let build_profile = match config.local_build_profile {\\n\\n BuildProfile::Debug => \\\"debug\\\",\\n\\n BuildProfile::Release => \\\"release\\\",\\n\\n };\\n\",\n \"file_path\": \"cargo-spatial/src/local.rs\",\n \"rank\": 11,\n \"score\": 77505.49454564134\n },\n {\n \"content\": \"fn get_schema_type(value_type: &TypeReference) -> &str {\\n\\n match value_type {\\n\\n TypeReference::Primitive(primitive) => get_rust_primitive_type_tag(&primitive),\\n\\n TypeReference::Enum(_) => \\\"SchemaEnum\\\",\\n\\n TypeReference::Type(_) => \\\"SchemaObject\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generator.rs\",\n \"rank\": 12,\n \"score\": 67301.22042535621\n },\n {\n \"content\": \"fn get_field_schema_type(field: &FieldDefinition) -> &str {\\n\\n match field.field_type {\\n\\n FieldDefinition_FieldType::Singular { ref type_reference } => {\\n\\n get_schema_type(type_reference)\\n\\n }\\n\\n FieldDefinition_FieldType::Option { ref inner_type } => get_schema_type(&inner_type),\\n\\n FieldDefinition_FieldType::List { ref inner_type } => get_schema_type(&inner_type),\\n\\n FieldDefinition_FieldType::Map { .. } => \\\"SchemaObject\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generator.rs\",\n \"rank\": 13,\n \"score\": 67301.22042535621\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let opt = Opt::from_args();\\n\\n\\n\\n // Initialize the logger.\\n\\n let verbosity = if opt.verbose {\\n\\n LevelFilter::Trace\\n\\n } else {\\n\\n LevelFilter::Info\\n\\n };\\n\\n SimpleLogger::init(verbosity, Default::default()).expect(\\\"Failed to setup logger\\\");\\n\\n\\n\\n // Perform the operation selected by the user.\\n\\n match &opt.command {\\n\\n Command::Codegen => codegen::run_codegen(&Config::load()?)?,\\n\\n\\n\\n Command::Local(local) => match local {\\n\\n Local::Launch(launch) => local::launch(&Config::load()?, launch)?,\\n\\n },\\n\\n\\n\\n Command::Generate { command } => match command {\\n\",\n \"file_path\": \"cargo-spatial/src/main.rs\",\n \"rank\": 14,\n \"score\": 66056.14112249648\n },\n {\n \"content\": \"pub fn generate_code(bundle: SchemaBundle) -> String {\\n\\n // Set up the root package.\\n\\n let generated_code = Rc::new(RefCell::new(GeneratedCode {\\n\\n root_package: None,\\n\\n packages: BTreeSet::new(),\\n\\n enums: BTreeMap::new(),\\n\\n types: BTreeMap::new(),\\n\\n components: BTreeMap::new(),\\n\\n }));\\n\\n let mut root_package = Package::new(Rc::clone(&generated_code), \\\"\\\", vec![]);\\n\\n for file in bundle.schema_files {\\n\\n let package = get_or_create_packages(\\n\\n &mut root_package,\\n\\n file.package\\n\\n .name\\n\\n .split('.')\\n\\n .collect::<Vec<&str>>()\\n\\n .as_slice(),\\n\\n );\\n\\n for type_def in file.types {\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generator.rs\",\n \"rank\": 15,\n \"score\": 65972.61046360133\n },\n {\n \"content\": \"fn get_rust_primitive_type_tag(primitive_type: &PrimitiveType) -> &str {\\n\\n match primitive_type {\\n\\n PrimitiveType::Invalid => panic!(\\\"Encountered invalid primitive.\\\"),\\n\\n PrimitiveType::Int32 => \\\"SchemaInt32\\\",\\n\\n PrimitiveType::Sint32 => \\\"SchemaSint32\\\",\\n\\n PrimitiveType::Sfixed32 => \\\"SchemaSfixed32\\\",\\n\\n PrimitiveType::Int64 => \\\"SchemaInt64\\\",\\n\\n PrimitiveType::Sint64 => \\\"SchemaSint64\\\",\\n\\n PrimitiveType::Sfixed64 => \\\"SchemaSfixed64\\\",\\n\\n PrimitiveType::Uint32 => \\\"SchemaUint32\\\",\\n\\n PrimitiveType::Fixed32 => \\\"SchemaFixed32\\\",\\n\\n PrimitiveType::Uint64 => \\\"SchemaUint64\\\",\\n\\n PrimitiveType::Fixed64 => \\\"SchemaFixed64\\\",\\n\\n PrimitiveType::Bool => \\\"SchemaBool\\\",\\n\\n PrimitiveType::Float => \\\"SchemaFloat\\\",\\n\\n PrimitiveType::Double => \\\"SchemaDouble\\\",\\n\\n PrimitiveType::String => \\\"SchemaString\\\",\\n\\n PrimitiveType::EntityId => \\\"SchemaEntityId\\\",\\n\\n PrimitiveType::Entity => panic!(\\\"Entity serialization unimplemented.\\\"),\\n\\n PrimitiveType::Bytes => \\\"SchemaBytes\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generator.rs\",\n \"rank\": 16,\n \"score\": 64384.88814813508\n },\n {\n \"content\": \"fn check_for_flag(connection: &mut WorkerConnection, flag_name: &str) {\\n\\n let flag = connection.get_worker_flag(flag_name);\\n\\n match flag {\\n\\n Some(f) => println!(\\\"Found flag value: {}\\\", f),\\n\\n None => println!(\\\"Could not find flag value\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 17,\n \"score\": 64101.68843793412\n },\n {\n \"content\": \"pub fn get_connection(opt: Opt) -> Result<WorkerConnection, String> {\\n\\n let Opt {\\n\\n worker_type,\\n\\n worker_id,\\n\\n connect_with_poll,\\n\\n command,\\n\\n } = opt;\\n\\n\\n\\n let worker_id = worker_id.unwrap_or_else(|| format!(\\\"{}-{}\\\", &worker_type, Uuid::new_v4()));\\n\\n let mut future = match command {\\n\\n Command::Receptionist {\\n\\n host,\\n\\n port,\\n\\n connect_with_external_ip,\\n\\n } => {\\n\\n let params = ConnectionParameters::new(worker_type)\\n\\n .using_udp()\\n\\n .using_external_ip(connect_with_external_ip)\\n\\n .enable_internal_serialization();\\n\\n WorkerConnection::connect_receptionist_async(\\n\",\n \"file_path\": \"project-example/src/connection_handler.rs\",\n \"rank\": 18,\n \"score\": 60632.654370001284\n },\n {\n \"content\": \"// This function ensures that given a path [\\\"example\\\", \\\"foo\\\"] and the root package, it will create\\n\\n// 2 packages with the following structure:\\n\\n// Package(\\\"root\\\", [Package(\\\"example\\\", [Package(\\\"foo\\\", [])])])\\n\\nfn get_or_create_packages<'a>(package: &'a mut Package, path: &[&str]) -> &'a mut Package {\\n\\n if path.is_empty() {\\n\\n return package;\\n\\n }\\n\\n // Given a package, and a path. If that package does not have any subpackages with the name of the \\\"next\\\"\\n\\n // package in the FQN, create it.\\n\\n let package_name = path[0];\\n\\n let mut package_path = package.path.clone();\\n\\n package_path.push(package_name.to_string());\\n\\n if !package.subpackages.contains_key(package_name) {\\n\\n package.subpackages.insert(\\n\\n package_name.to_string(),\\n\\n Package::new(\\n\\n Rc::clone(&package.generated_code),\\n\\n package_name,\\n\\n package_path,\\n\\n ),\\n\\n );\\n\\n }\\n\\n\\n\\n // Recurse into the package created above, and create more packages if needed.\\n\\n get_or_create_packages(\\n\\n package.subpackages.get_mut(package_name).unwrap(),\\n\\n &path[1..],\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generator.rs\",\n \"rank\": 19,\n \"score\": 53668.3208969688\n },\n {\n \"content\": \"fn main() {\\n\\n let opt = Opt::from_args();\\n\\n let mut worker_connection = match get_connection(opt) {\\n\\n Ok(c) => c,\\n\\n Err(e) => panic!(\\\"{}\\\", e),\\n\\n };\\n\\n\\n\\n println!(\\\"Connected as: {}\\\", worker_connection.get_worker_id());\\n\\n\\n\\n exercise_connection_code_paths(&mut worker_connection);\\n\\n logic_loop(&mut worker_connection);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 20,\n \"score\": 51660.533043396004\n },\n {\n \"content\": \"fn main() {\\n\\n let lib_dir = match env::var(\\\"SPATIAL_LIB_DIR\\\") {\\n\\n Ok(s) => s,\\n\\n Err(_) => panic!(\\\"SPATIAL_LIB_DIR environment variable not set.\\\"),\\n\\n };\\n\\n\\n\\n let package_dir = Path::new(&lib_dir).join(PACKAGE_DIR);\\n\\n\\n\\n println!(\\\"cargo:rustc-link-search={}\\\", package_dir.to_str().unwrap());\\n\\n\\n\\n for lib in LIBS.iter() {\\n\\n println!(\\\"cargo:rustc-link-lib=static={}\\\", lib)\\n\\n }\\n\\n\\n\\n #[cfg(target_os = \\\"macos\\\")]\\n\\n println!(\\\"cargo:rustc-link-lib=dylib=c++\\\");\\n\\n\\n\\n #[cfg(target_os = \\\"linux\\\")]\\n\\n println!(\\\"cargo:rustc-link-lib=dylib=stdc++\\\");\\n\\n\\n\\n #[cfg(target_os = \\\"windows\\\")]\\n\\n {\\n\\n println!(\\\"cargo:rustc-link-lib=dylib=gdi32\\\");\\n\\n println!(\\\"cargo:rustc-link-lib=dylib=user32\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-sys/build.rs\",\n \"rank\": 21,\n \"score\": 51660.533043396004\n },\n {\n \"content\": \"fn main() {\\n\\n let opt = Opt::from_args();\\n\\n let current_dir = std::env::current_dir().expect(\\\"Could not find current working directory.\\\");\\n\\n\\n\\n let mut path_buf = PathBuf::new();\\n\\n path_buf.push(current_dir);\\n\\n path_buf.push(opt.snapshot_path);\\n\\n\\n\\n let snapshot_path = path_buf.to_str().unwrap();\\n\\n println!(\\\"Creating empty snapshot at: {}\\\", snapshot_path);\\n\\n\\n\\n let _stream = SnapshotOutputStream::new(snapshot_path);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/examples/generate_snapshot.rs\",\n \"rank\": 23,\n \"score\": 50138.803632512776\n },\n {\n \"content\": \"enum IntermediateProtocolType {\\n\\n Tcp(Worker_TcpNetworkParameters),\\n\\n\\n\\n Udp {\\n\\n security_type: u8,\\n\\n kcp: Option<Worker_Alpha_KcpParameters>,\\n\\n erasure_codec: Option<Worker_ErasureCodecParameters>,\\n\\n heartbeat: Option<Worker_HeartbeatParameters>,\\n\\n flow_control: Option<Worker_Alpha_FlowControlParameters>,\\n\\n },\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/parameters.rs\",\n \"rank\": 29,\n \"score\": 48385.58570322805\n },\n {\n \"content\": \"fn main() {\\n\\n let args = get_arguments();\\n\\n\\n\\n let headers =\\n\\n glob(&format!(\\\"{}/*.h\\\", args.input_dir)).expect(\\\"Could not glob input directory.\\\");\\n\\n\\n\\n let mut bindings = bindgen::Builder::default()\\n\\n .layout_tests(false)\\n\\n .derive_default(true);\\n\\n\\n\\n for path in headers {\\n\\n bindings = bindings.header(path.unwrap().as_path().to_str().unwrap().to_owned())\\n\\n }\\n\\n\\n\\n let mut out_path = PathBuf::from(args.output_dir);\\n\\n out_path.push(\\\"worker.rs\\\");\\n\\n\\n\\n bindings\\n\\n .generate()\\n\\n .expect(\\\"Could not generate bindings.\\\")\\n\\n .write_to_file(out_path)\\n\\n .expect(\\\"Could not write bindings\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-tools/src/generate_bindings/main.rs\",\n \"rank\": 30,\n \"score\": 47480.41689432163\n },\n {\n \"content\": \"#[test]\\n\\nfn position_is_serialized_correctly() {\\n\\n let builder = EntityBuilder::new(10.0, -10.0, 7.5, \\\"rusty\\\");\\n\\n let entity = builder.build().unwrap();\\n\\n\\n\\n let maybe_position = entity.get::<Position>();\\n\\n assert!(maybe_position.is_some());\\n\\n\\n\\n let position = maybe_position.unwrap();\\n\\n\\n\\n approx::abs_diff_eq!(10.0, position.coords.x);\\n\\n approx::abs_diff_eq!(-10.0, position.coords.y);\\n\\n approx::abs_diff_eq!(7.5, position.coords.z);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-suite/src/entity_builder_tests.rs\",\n \"rank\": 31,\n \"score\": 46312.593299067965\n },\n {\n \"content\": \"#[test]\\n\\nfn metadata_is_serialized_correctly() {\\n\\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \\\"rusty\\\");\\n\\n builder.set_metadata(\\\"my_entity\\\", \\\"rusty\\\");\\n\\n let entity = builder.build().unwrap();\\n\\n\\n\\n let maybe_metadata = entity.get::<Metadata>();\\n\\n assert!(maybe_metadata.is_some());\\n\\n let metadata = maybe_metadata.unwrap();\\n\\n\\n\\n assert_eq!(\\\"my_entity\\\", metadata.entity_type);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-suite/src/entity_builder_tests.rs\",\n \"rank\": 32,\n \"score\": 46312.593299067965\n },\n {\n \"content\": \"// A trait that's implemented by a component to convert to/from schema handle types.\\n\\npub trait Component\\n\\nwhere\\n\\n Self: std::marker::Sized,\\n\\n{\\n\\n type Update;\\n\\n type CommandRequest;\\n\\n type CommandResponse;\\n\\n\\n\\n const ID: ComponentId;\\n\\n\\n\\n fn from_data(data: &schema::SchemaComponentData) -> Result<Self, String>;\\n\\n fn from_update(update: &schema::SchemaComponentUpdate) -> Result<Self::Update, String>;\\n\\n fn from_request(\\n\\n command_index: CommandIndex,\\n\\n request: &schema::SchemaCommandRequest,\\n\\n ) -> Result<Self::CommandRequest, String>;\\n\\n fn from_response(\\n\\n command_index: CommandIndex,\\n\\n response: &schema::SchemaCommandResponse,\\n\\n ) -> Result<Self::CommandResponse, String>;\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/component.rs\",\n \"rank\": 33,\n \"score\": 45237.45556501597\n },\n {\n \"content\": \"/// Connection trait to allow for mocking the connection.\\n\\npub trait Connection {\\n\\n fn send_log_message(\\n\\n &mut self,\\n\\n level: LogLevel,\\n\\n logger_name: &str,\\n\\n message: &str,\\n\\n entity_id: Option<EntityId>,\\n\\n );\\n\\n fn send_metrics(&mut self, metrics: &Metrics);\\n\\n\\n\\n fn send_reserve_entity_ids_request(\\n\\n &mut self,\\n\\n payload: ReserveEntityIdsRequest,\\n\\n timeout_millis: Option<u32>,\\n\\n ) -> RequestId<ReserveEntityIdsRequest>;\\n\\n fn send_create_entity_request(\\n\\n &mut self,\\n\\n entity: Entity,\\n\\n entity_id: Option<EntityId>,\\n\\n timeout_millis: Option<u32>,\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/connection.rs\",\n \"rank\": 34,\n \"score\": 45237.45556501597\n },\n {\n \"content\": \"#[test]\\n\\nfn error_is_returned_if_invalid_entity() {\\n\\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \\\"rusty\\\");\\n\\n builder.add_component(\\n\\n Position {\\n\\n coords: Coordinates {\\n\\n x: 0.0,\\n\\n y: 0.0,\\n\\n z: 0.0,\\n\\n },\\n\\n },\\n\\n \\\"rusty\\\",\\n\\n );\\n\\n let result = builder.build();\\n\\n\\n\\n assert!(result.is_err());\\n\\n}\\n\",\n \"file_path\": \"test-suite/src/entity_builder_tests.rs\",\n \"rank\": 35,\n \"score\": 45235.61265677959\n },\n {\n \"content\": \"#[test]\\n\\nfn entity_acl_is_serialized_correctly() {\\n\\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \\\"position_acl\\\");\\n\\n builder.add_component(\\n\\n Metadata {\\n\\n entity_type: \\\"test\\\".to_owned(),\\n\\n },\\n\\n \\\"metadata_acl\\\",\\n\\n );\\n\\n builder.set_entity_acl_write_access(\\\"entity_acl_acl\\\");\\n\\n builder.add_read_access(\\\"client\\\");\\n\\n builder.add_read_access(\\\"server\\\");\\n\\n\\n\\n let entity = builder.build().unwrap();\\n\\n\\n\\n let maybe_acl = entity.get::<EntityAcl>();\\n\\n assert!(maybe_acl.is_some());\\n\\n\\n\\n let acl = maybe_acl.unwrap();\\n\\n\\n\\n // First check that we insert each layer into a different set.\\n\",\n \"file_path\": \"test-suite/src/entity_builder_tests.rs\",\n \"rank\": 36,\n \"score\": 45235.61265677959\n },\n {\n \"content\": \"#[test]\\n\\nfn persistence_component_is_added_if_set() {\\n\\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \\\"rusty\\\");\\n\\n builder.set_persistent(\\\"rusty\\\");\\n\\n let entity = builder.build().unwrap();\\n\\n\\n\\n assert!(entity.get::<Persistence>().is_some());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-suite/src/entity_builder_tests.rs\",\n \"rank\": 37,\n \"score\": 45235.61265677959\n },\n {\n \"content\": \"// A trait that's implemented by a type to convert to/from schema objects.\\n\\npub trait TypeConversion\\n\\nwhere\\n\\n Self: std::marker::Sized,\\n\\n{\\n\\n fn from_type(input: &schema::SchemaObject) -> Result<Self, String>;\\n\\n fn to_type(input: &Self, output: &mut schema::SchemaObject) -> Result<(), String>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/component.rs\",\n \"rank\": 38,\n \"score\": 43961.492706552985\n },\n {\n \"content\": \"// A bytes schema field.\\n\\npub trait SchemaBytesField {\\n\\n fn get(&self) -> Option<Vec<u8>> {\\n\\n if self.count() == 0 {\\n\\n None\\n\\n } else {\\n\\n Some(self.get_or_default())\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_or_default(&self) -> Vec<u8>;\\n\\n fn index(&self, index: usize) -> Vec<u8>;\\n\\n fn count(&self) -> usize;\\n\\n fn add(&mut self, value: &[u8]);\\n\\n}\\n\\n\\n\\n// A string schema field.\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/internal/schema.rs\",\n \"rank\": 39,\n \"score\": 41707.331740419584\n },\n {\n \"content\": \"#[allow(clippy::ptr_arg)]\\n\\npub trait SchemaStringField {\\n\\n fn get(&self) -> Option<String> {\\n\\n if self.count() == 0 {\\n\\n None\\n\\n } else {\\n\\n Some(self.get_or_default())\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_or_default(&self) -> String;\\n\\n fn index(&self, index: usize) -> String;\\n\\n fn count(&self) -> usize;\\n\\n\\n\\n fn add(&mut self, value: &String);\\n\\n fn add_list(&mut self, value: &[String]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/internal/schema.rs\",\n \"rank\": 40,\n \"score\": 41707.331740419584\n },\n {\n \"content\": \"// An object schema field.\\n\\npub trait SchemaObjectField {\\n\\n fn get(&self) -> Option<SchemaObject> {\\n\\n if self.count() == 0 {\\n\\n None\\n\\n } else {\\n\\n Some(self.get_or_default())\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_or_default(&self) -> SchemaObject;\\n\\n fn index(&self, index: usize) -> SchemaObject;\\n\\n fn count(&self) -> usize;\\n\\n\\n\\n fn add(&mut self) -> SchemaObject;\\n\\n}\\n\\n\\n\\nimpl SchemaObject {\\n\\n pub fn field<T>(&self, field_id: ComponentId) -> SchemaFieldContainer<T> {\\n\\n SchemaFieldContainer {\\n\\n field_id,\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/internal/schema.rs\",\n \"rank\": 41,\n \"score\": 41707.331740419584\n },\n {\n \"content\": \"fn get_arguments() -> Args {\\n\\n let matches = App::new(\\\"Spatial OS SDK Bindings Generator\\\")\\n\\n .author(\\\"Jamie Brynes <jamiebrynes7@gmail.com>\\\")\\n\\n .about(\\\"Generate Rust bindings for the SpatialOS C API.\\\")\\n\\n .arg(\\n\\n Arg::with_name(OUTPUT_DIR_ARG)\\n\\n .short(\\\"o\\\")\\n\\n .long(OUTPUT_DIR_ARG)\\n\\n .takes_value(true)\\n\\n .value_name(&OUTPUT_DIR_ARG.to_uppercase())\\n\\n .required(true)\\n\\n .help(\\\"Output directory for the Rust bindings. Relative to the current working directory.\\\")\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(INPUT_DIR_ARG)\\n\\n .short(\\\"i\\\")\\n\\n .long(INPUT_DIR_ARG)\\n\\n .takes_value(true)\\n\\n .value_name(&INPUT_DIR_ARG.to_uppercase())\\n\\n .required(true)\\n\\n .help(\\\"Input directory for C header files. Relative to the current working directory.\\\")\\n\\n )\\n\\n .get_matches();\\n\\n\\n\\n Args {\\n\\n input_dir: matches.value_of(INPUT_DIR_ARG).unwrap().to_owned(),\\n\\n output_dir: matches.value_of(OUTPUT_DIR_ARG).unwrap().to_owned(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-tools/src/generate_bindings/main.rs\",\n \"rank\": 42,\n \"score\": 41321.09240286227\n },\n {\n \"content\": \"fn print_worker_attributes(connection: &WorkerConnection) {\\n\\n let attrs = connection.get_worker_attributes();\\n\\n println!(\\\"The worker has the following attributes: \\\");\\n\\n for attr in attrs {\\n\\n println!(\\\"{}\\\", attr)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 43,\n \"score\": 38766.418832669704\n },\n {\n \"content\": \"// A primitive schema field.\\n\\npub trait SchemaPrimitiveField<T> {\\n\\n fn get(&self) -> Option<T> {\\n\\n if self.count() == 0 {\\n\\n None\\n\\n } else {\\n\\n Some(self.get_or_default())\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_or_default(&self) -> T;\\n\\n fn index(&self, index: usize) -> T;\\n\\n fn count(&self) -> usize;\\n\\n\\n\\n fn add(&mut self, value: T);\\n\\n fn add_list(&mut self, value: &[T]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/internal/schema.rs\",\n \"rank\": 44,\n \"score\": 38104.34505141676\n },\n {\n \"content\": \"fn send_query(c: &mut WorkerConnection) {\\n\\n let query = EntityQuery::new(\\n\\n QueryConstraint::And(vec![\\n\\n QueryConstraint::Or(vec![\\n\\n QueryConstraint::Component(0),\\n\\n QueryConstraint::Component(1),\\n\\n ]),\\n\\n QueryConstraint::And(vec![\\n\\n QueryConstraint::Sphere(10.0, 10.0, 10.0, 250.0),\\n\\n QueryConstraint::Not(Box::new(QueryConstraint::Component(2))),\\n\\n ]),\\n\\n QueryConstraint::EntityId(EntityId::new(10)),\\n\\n ]),\\n\\n ResultType::Count,\\n\\n );\\n\\n\\n\\n c.send_entity_query_request(EntityQueryRequest(query), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 45,\n \"score\": 38044.84888462246\n },\n {\n \"content\": \"fn send_metrics(c: &mut WorkerConnection) {\\n\\n let mut m = Metrics::new()\\n\\n .with_load(0.2)\\n\\n .with_gauge_metric(\\\"some_metric\\\", 0.15)\\n\\n .with_histogram_metric(\\\"histogram_metric\\\", HistogramMetric::new(&[6.7]));\\n\\n\\n\\n let gauge_metric = m.add_gauge_metric(\\\"another_metric\\\").unwrap();\\n\\n *gauge_metric = 0.2;\\n\\n\\n\\n let histogram_metric = m\\n\\n .add_histogram_metric(\\\"another_histogram\\\", &[0.1, 0.2, 0.3])\\n\\n .unwrap();\\n\\n histogram_metric.add_sample(1.0);\\n\\n histogram_metric.add_sample(0.5);\\n\\n\\n\\n c.send_metrics(&m);\\n\\n}\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 46,\n \"score\": 38044.84888462246\n },\n {\n \"content\": \"fn logic_loop(c: &mut WorkerConnection) {\\n\\n /// Local tracking of the state of an entity's components. We only track the\\n\\n /// `Rotate` component because it's the only one we care about for this demo.\\n\\n #[derive(Debug, Default)]\\n\\n struct EntityState {\\n\\n has_authority: bool,\\n\\n rotate: Option<example::Rotate>,\\n\\n }\\n\\n\\n\\n let mut rng = rand::thread_rng();\\n\\n\\n\\n // Store the currently-visible state of the world. Entities/components are added\\n\\n // and removed from the world as we get ops notifying us of those changes. The\\n\\n // data in `world` also tracks which `Rotate` components we currently have\\n\\n // authority over, so that we know which ones we need to be updating.\\n\\n let mut world = HashMap::new();\\n\\n\\n\\n let mut builder = EntityBuilder::new(0.0, 0.0, 0.0, \\\"rusty\\\");\\n\\n\\n\\n builder.add_component(\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 47,\n \"score\": 38044.84888462246\n },\n {\n \"content\": \"pub trait ComponentUpdate<C: Component> {\\n\\n fn merge(&mut self, update: Self);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/component.rs\",\n \"rank\": 48,\n \"score\": 37272.62189528407\n },\n {\n \"content\": \"pub trait ComponentData<C: Component> {\\n\\n fn merge(&mut self, update: C::Update);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/component.rs\",\n \"rank\": 49,\n \"score\": 37272.62189528407\n },\n {\n \"content\": \"fn exercise_connection_code_paths(c: &mut WorkerConnection) {\\n\\n c.send_log_message(LogLevel::Info, \\\"main\\\", \\\"Connected successfully!\\\", None);\\n\\n print_worker_attributes(&c);\\n\\n check_for_flag(c, \\\"my-flag\\\");\\n\\n\\n\\n let _ = c.get_op_list(0);\\n\\n c.send_reserve_entity_ids_request(ReserveEntityIdsRequest(1), None);\\n\\n send_query(c);\\n\\n\\n\\n let interested = vec![\\n\\n InterestOverride::new(1, true),\\n\\n InterestOverride::new(100, false),\\n\\n ];\\n\\n c.send_component_interest(EntityId::new(1), &interested);\\n\\n c.send_authority_loss_imminent_acknowledgement(EntityId::new(1), 1337);\\n\\n\\n\\n send_metrics(c);\\n\\n c.set_protocol_logging_enabled(false);\\n\\n\\n\\n println!(\\\"Testing completed\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"project-example/src/main.rs\",\n \"rank\": 50,\n \"score\": 35971.52761590986\n },\n {\n \"content\": \"fn generate_module(package: &Package) -> String {\\n\\n let submodules = if !package.subpackages.is_empty() {\\n\\n package\\n\\n .subpackages\\n\\n .iter()\\n\\n .map(|(_, pkg)| generate_module(&pkg))\\n\\n .fold(\\\"\\\".to_string(), |submodule, next| submodule + \\\"\\\\n\\\" + &next)\\n\\n } else {\\n\\n \\\"\\\".to_string()\\n\\n };\\n\\n // Passing `package` to format! causes the T4 template engine to generate output.\\n\\n let module_contents = format!(\\\"{}\\\\n{}\\\", package, submodules);\\n\\n // The only package with a depth of 0 is the root package.\\n\\n if package.depth() == 0 {\\n\\n let allow_warnings = vec![\\n\\n \\\"#![allow(unused_imports)]\\\",\\n\\n \\\"#![allow(unreachable_code)]\\\",\\n\\n \\\"#![allow(unreachable_patterns)]\\\",\\n\\n \\\"#![allow(unused_variables)]\\\",\\n\\n \\\"#![allow(dead_code)]\\\",\\n\\n \\\"#![allow(non_camel_case_types)]\\\",\\n\\n \\\"#![allow(unused_mut)]\\\",\\n\\n ]\\n\\n .join(\\\"\\\\n\\\");\\n\\n format!(\\\"{}\\\\n\\\\n{}\\\", allow_warnings, module_contents)\\n\\n } else {\\n\\n format!(\\\"pub mod {} {{\\\\n{}}}\\\\n\\\", package.name, module_contents)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generator.rs\",\n \"rank\": 51,\n \"score\": 35971.52761590986\n },\n {\n \"content\": \"fn get_test_entity() -> Result<Entity, String> {\\n\\n let mut builder = EntityBuilder::new(10.0, -10.0, 0.0, \\\"RustWorker\\\");\\n\\n builder.set_persistent(\\\"RustWorker\\\");\\n\\n builder.build()\\n\\n}\\n\",\n \"file_path\": \"test-suite/src/snapshot_integration_tests.rs\",\n \"rank\": 52,\n \"score\": 35047.09684105969\n },\n {\n \"content\": \"fn get_connection_poll(future: &mut WorkerConnectionFuture) -> Result<WorkerConnection, String> {\\n\\n for _ in 0..POLL_NUM_ATTEMPTS {\\n\\n println!(\\\"Attempting to poll.\\\");\\n\\n match future.poll() {\\n\\n Ok(res) => {\\n\\n if let Async::Ready(conn) = res {\\n\\n return Ok(conn);\\n\\n }\\n\\n }\\n\\n Err(s) => return Err(s),\\n\\n };\\n\\n\\n\\n ::std::thread::sleep(::std::time::Duration::from_millis(\\n\\n POLL_TIME_BETWEEN_ATTEMPTS_MILLIS,\\n\\n ));\\n\\n }\\n\\n\\n\\n Err(\\\"Max connection attempts failed.\\\".to_owned())\\n\\n}\\n\",\n \"file_path\": \"project-example/src/connection_handler.rs\",\n \"rank\": 53,\n \"score\": 28089.057588113257\n },\n {\n \"content\": \"fn empty_string_is_none<'de, D>(d: D) -> Result<Option<String>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n let o: Option<String> = Option::deserialize(d)?;\\n\\n Ok(o.filter(|s| !s.is_empty()))\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Clone, Debug)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct SourceReference {\\n\\n pub line: u32,\\n\\n pub column: u32,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Clone, Debug)]\\n\\npub enum PrimitiveType {\\n\\n Invalid = 0,\\n\\n Int32 = 1,\\n\\n Int64 = 2,\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/schema_bundle.rs\",\n \"rank\": 54,\n \"score\": 25782.196965937634\n },\n {\n \"content\": \"use spatialos_sdk::worker::internal::schema::*;\\n\\nuse spatialos_sdk::worker::component::*;\\n\\nuse std::collections::BTreeMap;\\n\\n\\n\\nuse super::super::generated as generated;\\n\\n\\n\\n/* Enums. */\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub enum TestEnum {\\n\\n\\n\\n FIRST,\\n\\n SECOND,\\n\\n}\\n\\n\\n\\nimpl From<u32> for TestEnum {\\n\\n fn from(value: u32) -> Self {\\n\\n match value {\\n\\n\\n\\n 0 => TestEnum::FIRST, \\n\\n 1 => TestEnum::SECOND, \\n\",\n \"file_path\": \"project-example/src/generated.rs\",\n \"rank\": 56,\n \"score\": 35.449164767180946\n },\n {\n \"content\": \"use spatialos_sdk::worker::internal::schema::*;\\n\\nuse spatialos_sdk::worker::component::*;\\n\\nuse std::collections::BTreeMap;\\n\\n\\n\\nuse <#= vec![\\\"super\\\".to_string(); self.depth() + 1].join(\\\"::\\\") #>::generated as generated;\\n\\n\\n\\n/* Enums. */<# for enum_name in &self.enums {\\n\\nlet enum_def = self.get_enum_definition(enum_name);\\n\\nlet enum_rust_name = self.rust_name(&enum_def.qualified_name);\\n\\n#>\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub enum <#= enum_rust_name #> {\\n\\n<# for enum_value in &enum_def.values { #>\\n\\n <#= enum_value.name #>,<# } #>\\n\\n}\\n\\n\\n\\nimpl From<u32> for <#= enum_rust_name #> {\\n\\n fn from(value: u32) -> Self {\\n\\n match value {\\n\\n<# for enum_value in &enum_def.values { #>\\n\",\n \"file_path\": \"spatialos-sdk-code-generator/src/generated_code_mod.tt.rs\",\n \"rank\": 57,\n \"score\": 30.732391517872784\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate lazy_static;\\n\\n\\n\\nuse std::env;\\n\\nuse std::path::Path;\\n\\n\\n\\n#[cfg(windows)]\\n\\nlazy_static! {\\n\\n static ref LIBS: Vec<&'static str> =\\n\\n vec![\\\"improbable_worker\\\", \\\"RakNetLibStatic\\\", \\\"ssl\\\", \\\"zlibstatic\\\",];\\n\\n}\\n\\n\\n\\n#[cfg(unix)]\\n\\nlazy_static! {\\n\\n static ref LIBS: Vec<&'static str> = vec![\\\"improbable_worker\\\", \\\"RakNetLibStatic\\\", \\\"ssl\\\", \\\"z\\\",];\\n\\n}\\n\\n\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\nstatic PACKAGE_DIR: &str = \\\"linux\\\";\\n\\n#[cfg(target_os = \\\"macos\\\")]\\n\\nstatic PACKAGE_DIR: &str = \\\"macos\\\";\\n\\n#[cfg(target_os = \\\"windows\\\")]\\n\\nstatic PACKAGE_DIR: &str = \\\"win\\\";\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk-sys/build.rs\",\n \"rank\": 58,\n \"score\": 30.216914781249002\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\\n\\npub enum Authority {\\n\\n Authoritative,\\n\\n AuthorityLossImminent,\\n\\n NotAuthoritative,\\n\\n}\\n\\n\\n\\nimpl Authority {\\n\\n pub fn has_authority(self) -> bool {\\n\\n self != Authority::NotAuthoritative\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<u8> for Authority {\\n\\n fn from(auth: u8) -> Self {\\n\\n match auth {\\n\\n 0 => Authority::NotAuthoritative,\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/mod.rs\",\n \"rank\": 59,\n \"score\": 28.894362161268905\n },\n {\n \"content\": \" 1 => Authority::Authoritative,\\n\\n 2 => Authority::AuthorityLossImminent,\\n\\n _ => panic!(\\\"Unknown authority state: {}\\\", auth),\\n\\n }\\n\\n }\\n\\n}\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd)]\\n\\npub enum LogLevel {\\n\\n Debug,\\n\\n Info,\\n\\n Warn,\\n\\n Error,\\n\\n Fatal,\\n\\n}\\n\\n\\n\\nimpl LogLevel {\\n\\n fn to_worker_sdk(self) -> u8 {\\n\\n match self {\\n\\n LogLevel::Debug => 1,\\n\\n LogLevel::Info => 2,\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/mod.rs\",\n \"rank\": 61,\n \"score\": 26.734139008966935\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\ninventory::submit!(VTable::new::<Position>());\\n\\n\\n\\n\\n\\n\\n\\npub mod restricted {\\n\\nuse spatialos_sdk::worker::internal::schema::*;\\n\\nuse spatialos_sdk::worker::component::*;\\n\\nuse std::collections::BTreeMap;\\n\\n\\n\\nuse super::super::super::generated as generated;\\n\\n\\n\\n/* Enums. */\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub enum Connection_ConnectionStatus {\\n\\n\\n\\n UNKNOWN,\\n\\n AWAITING_WORKER_CONNECTION,\\n\",\n \"file_path\": \"project-example/src/generated.rs\",\n \"rank\": 62,\n \"score\": 26.316304342032467\n },\n {\n \"content\": \"use std::marker::PhantomData;\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, Default)]\\n\\npub struct EntityId {\\n\\n pub id: i64,\\n\\n}\\n\\n\\n\\nimpl EntityId {\\n\\n pub fn new(id: i64) -> EntityId {\\n\\n EntityId { id }\\n\\n }\\n\\n\\n\\n pub fn is_valid(self) -> bool {\\n\\n self.id > 0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for EntityId {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {\\n\\n write!(f, \\\"EntityId: {}\\\", self.id)\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/mod.rs\",\n \"rank\": 63,\n \"score\": 25.515734267253016\n },\n {\n \"content\": \"}\\n\\nimpl Default for Worker_FlagUpdateOp {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Data for a log message from the SDK.\\\"]\\n\\n#[doc = \\\" Note: Worker_LogMessageOp has been deprecated and will be removed in a future version of\\\"]\\n\\n#[doc = \\\" SpatialOS.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_LogMessageOp {\\n\\n #[doc = \\\" The severity of the log message; defined in the Worker_LogLevel enumeration.\\\"]\\n\\n pub level: u8,\\n\\n #[doc = \\\" The message.\\\"]\\n\\n pub message: *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_LogMessageOp {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 64,\n \"score\": 24.26522670149743\n },\n {\n \"content\": \" }\\n\\n}\\n\\n#[doc = \\\" Tuning parameters for configuring protocol logging in the SDK. Used by\\\"]\\n\\n#[doc = \\\" Worker_ConnectionParameters.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_ProtocolLoggingParameters {\\n\\n #[doc = \\\" Log file names are prefixed with this prefix, are numbered, and have the extension .log.\\\"]\\n\\n pub log_prefix: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" Maximum number of log files to keep. Note that logs from any previous protocol logging\\\"]\\n\\n #[doc = \\\" sessions will be overwritten.\\\"]\\n\\n pub max_log_files: u32,\\n\\n #[doc = \\\" Once the size of a log file reaches this size, a new log file is created.\\\"]\\n\\n pub max_log_file_size_bytes: u32,\\n\\n}\\n\\nimpl Default for Worker_ProtocolLoggingParameters {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 65,\n \"score\": 23.43249053794343\n },\n {\n \"content\": \" pub login_token: Worker_LoginTokenCredentials,\\n\\n #[doc = \\\" Parameters used if the WORKER_STEAM_CREDENTIALS flag is set.\\\"]\\n\\n pub steam: Worker_SteamCredentials,\\n\\n #[doc = \\\" The player identity token/login token pair used for authentication.\\\"]\\n\\n pub player_identity: Worker_PlayerIdentityCredentials,\\n\\n #[doc = \\\" Whether to use an insecure (non-TLS) connection for local development.\\\"]\\n\\n pub use_insecure_connection: u8,\\n\\n #[doc = \\\" Parameters for configuring logging.\\\"]\\n\\n pub logging: Worker_ProtocolLoggingParameters,\\n\\n #[doc = \\\" Whether to enable logging for the Locator flow.\\\"]\\n\\n pub enable_logging: u8,\\n\\n}\\n\\nimpl Default for Worker_LocatorParameters {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Details of a specific deployment obtained via Worker_Locator_GetDeploymentListAsync.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 66,\n \"score\": 22.839887281540463\n },\n {\n \"content\": \" }\\n\\n}\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_OrConstraint {\\n\\n pub constraint_count: u32,\\n\\n pub constraints: *mut Worker_Constraint,\\n\\n}\\n\\nimpl Default for Worker_OrConstraint {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_NotConstraint {\\n\\n pub constraint: *mut Worker_Constraint,\\n\\n}\\n\\nimpl Default for Worker_NotConstraint {\\n\\n fn default() -> Self {\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 67,\n \"score\": 22.7033163020236\n },\n {\n \"content\": \" #[doc = \\\" The severity of the log message; defined in the Worker_LogLevel enumeration.\\\"]\\n\\n pub level: u8,\\n\\n #[doc = \\\" The name of the logger.\\\"]\\n\\n pub logger_name: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The full log message.\\\"]\\n\\n pub message: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The ID of the entity this message relates to, or NULL for none.\\\"]\\n\\n pub entity_id: *const Worker_EntityId,\\n\\n}\\n\\nimpl Default for Worker_LogMessage {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Parameters for a gauge metric.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_GaugeMetric {\\n\\n pub key: *const ::std::os::raw::c_char,\\n\\n pub value: f64,\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 68,\n \"score\": 22.452280269024136\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[derive(Derivative)]\\n\\n#[derivative(\\n\\n Debug(bound = \\\"\\\"),\\n\\n Copy(bound = \\\"\\\"),\\n\\n Clone(bound = \\\"\\\"),\\n\\n PartialEq(bound = \\\"\\\"),\\n\\n Eq(bound = \\\"\\\"),\\n\\n Hash(bound = \\\"\\\")\\n\\n)]\\n\\npub struct RequestId<T> {\\n\\n id: i64,\\n\\n _type: PhantomData<*const T>,\\n\\n}\\n\\n\\n\\nimpl<T> Ord for RequestId<T> {\\n\\n fn cmp(&self, other: &Self) -> Ordering {\\n\\n self.id.cmp(&other.id)\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/mod.rs\",\n \"rank\": 69,\n \"score\": 22.403765686312468\n },\n {\n \"content\": \"}\\n\\nimpl Default for Worker_SteamCredentials {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Parameters for authenticating using a Player Identity Token and Login Token.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_PlayerIdentityCredentials {\\n\\n #[doc = \\\" Authenticates a user to a single deployment. Obtained from a game authentication server\\\"]\\n\\n #[doc = \\\" using a PIT.\\\"]\\n\\n pub player_identity_token: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" Uniquely identifies a user across deployments, and is provided by a game authentication\\\"]\\n\\n #[doc = \\\" server.\\\"]\\n\\n pub login_token: *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_PlayerIdentityCredentials {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 70,\n \"score\": 22.244807722869826\n },\n {\n \"content\": \"impl ConnectionParameters {\\n\\n pub fn new<T: AsRef<str>>(worker_type: T) -> Self {\\n\\n let mut params = ConnectionParameters::default();\\n\\n params.worker_type =\\n\\n CString::new(worker_type.as_ref()).expect(\\\"`worker_type` contains a null byte\\\");\\n\\n params\\n\\n }\\n\\n\\n\\n pub fn with_protocol_logging<T: AsRef<str>>(mut self, log_prefix: T) -> Self {\\n\\n self.enable_protocol_logging_at_startup = true;\\n\\n self.protocol_logging.log_prefix =\\n\\n CString::new(log_prefix.as_ref()).expect(\\\"`log_prefix` contained a null byte\\\");\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn using_tcp(self) -> Self {\\n\\n self.using_tcp_with_params(TcpNetworkParameters::default())\\n\\n }\\n\\n\\n\\n pub fn using_tcp_with_params(mut self, params: TcpNetworkParameters) -> Self {\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/parameters.rs\",\n \"rank\": 71,\n \"score\": 22.038505660940313\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_LoginTokenCredentials {\\n\\n #[doc = \\\" The token would typically be provided on the command-line by the SpatialOS launcher.\\\"]\\n\\n pub token: *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_LoginTokenCredentials {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Parameters for authenticating using Steam credentials.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_SteamCredentials {\\n\\n #[doc = \\\" Steam ticket for the steam app ID and publisher key corresponding to the project name specified\\\"]\\n\\n #[doc = \\\" in the Worker_LocatorParameters. Typically obtained from the steam APIs.\\\"]\\n\\n pub ticket: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" Deployment tag to request access for. If non-empty, must match the following regex:\\\"]\\n\\n #[doc = \\\" [A-Za-z0-9][A-Za-z0-9_]*\\\"]\\n\\n pub deployment_tag: *const ::std::os::raw::c_char,\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 72,\n \"score\": 22.014239572406595\n },\n {\n \"content\": \"impl Default for Worker_CommandResponse {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" An object used to represent a component data snapshot by either raw schema data or some\\\"]\\n\\n#[doc = \\\" user-defined handle type.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_ComponentData {\\n\\n pub reserved: *mut ::std::os::raw::c_void,\\n\\n pub component_id: Worker_ComponentId,\\n\\n pub schema_type: *mut Schema_ComponentData,\\n\\n pub user_handle: *mut Worker_ComponentDataHandle,\\n\\n}\\n\\nimpl Default for Worker_ComponentData {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 73,\n \"score\": 21.842931662971278\n },\n {\n \"content\": \" /// Resolves the unresolved path into an absolute path.\\n\\n fn resolve_path(&self, unresolved_path: &str) -> String {\\n\\n let path = Path::new(unresolved_path);\\n\\n\\n\\n if path.is_absolute() {\\n\\n return path.to_str().unwrap().to_owned();\\n\\n }\\n\\n\\n\\n let mut cwd = ::std::env::current_dir().unwrap();\\n\\n cwd.push(path);\\n\\n\\n\\n cwd.to_str().unwrap().to_owned()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Serialize, Deserialize)]\\n\\n#[serde(rename_all = \\\"lowercase\\\")]\\n\\npub enum BuildProfile {\\n\\n Debug,\\n\\n Release,\\n\\n}\\n\",\n \"file_path\": \"cargo-spatial/src/config.rs\",\n \"rank\": 74,\n \"score\": 21.474657682157847\n },\n {\n \"content\": \" pub error: *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_QueueStatus {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Component update parameters. Used to modify the behaviour of a component update request.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Default, Copy, Clone)]\\n\\npub struct Worker_UpdateParameters {\\n\\n #[doc = \\\" Controls how the update is sent back to the worker from which it was sent. Defined in the\\\"]\\n\\n #[doc = \\\" Worker_ComponentUpdateLoopback enumeration.\\\"]\\n\\n pub loopback: u8,\\n\\n}\\n\\n#[doc = \\\" Command parameters. Used to modify the behaviour of a command request.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Default, Copy, Clone)]\\n\\npub struct Worker_CommandParameters {\\n\\n #[doc = \\\" Allow command requests to bypass the bridge when this worker is authoritative over the target\\\"]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 75,\n \"score\": 21.409560666363674\n },\n {\n \"content\": \" pub use_insecure_connection: u8,\\n\\n}\\n\\nimpl Default for Worker_Alpha_PlayerIdentityTokenRequest {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" The result of creating a player identity token.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_Alpha_PlayerIdentityTokenResponse {\\n\\n #[doc = \\\" The returned player identity token.\\\"]\\n\\n pub player_identity_token: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The status code and a human readable description of the status of the request.\\\"]\\n\\n pub status: Worker_ConnectionStatus,\\n\\n}\\n\\nimpl Default for Worker_Alpha_PlayerIdentityTokenResponse {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 76,\n \"score\": 21.254693077511018\n },\n {\n \"content\": \"use crate::worker::component::{self, Component, ComponentId, DATABASE};\\n\\nuse crate::worker::internal::schema::SchemaComponentData;\\n\\nuse spatialos_sdk_sys::worker::{Schema_DestroyComponentData, Worker_ComponentData, Worker_Entity};\\n\\nuse std::collections::HashMap;\\n\\nuse std::ptr;\\n\\nuse std::slice;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct Entity {\\n\\n components: HashMap<ComponentId, Worker_ComponentData>,\\n\\n}\\n\\n\\n\\nimpl Entity {\\n\\n pub fn new() -> Self {\\n\\n Entity::default()\\n\\n }\\n\\n\\n\\n pub(crate) unsafe fn from_worker_sdk(raw_entity: &Worker_Entity) -> Result<Self, String> {\\n\\n let mut entity = Entity::new();\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/entity.rs\",\n \"rank\": 77,\n \"score\": 21.221492182109113\n },\n {\n \"content\": \"}\\n\\nimpl Default for Worker_GaugeMetric {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Default, Copy, Clone)]\\n\\npub struct Worker_HistogramMetricBucket {\\n\\n pub upper_bound: f64,\\n\\n pub samples: u32,\\n\\n}\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_HistogramMetric {\\n\\n pub key: *const ::std::os::raw::c_char,\\n\\n pub sum: f64,\\n\\n pub bucket_count: u32,\\n\\n pub buckets: *const Worker_HistogramMetricBucket,\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 78,\n \"score\": 20.72244843032482\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn with_logging(self) -> Self {\\n\\n self.with_logging_params(ProtocolLoggingParameters::default())\\n\\n }\\n\\n\\n\\n pub fn with_logging_params(mut self, params: ProtocolLoggingParameters) -> Self {\\n\\n self.logging = Some(params);\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\npub struct PlayerIdentityCredentials {\\n\\n player_identity_token: CString,\\n\\n login_token: CString,\\n\\n}\\n\\n\\n\\nimpl PlayerIdentityCredentials {\\n\\n pub fn new<S: AsRef<str>, T: AsRef<str>>(pit: S, token: T) -> Self {\\n\\n PlayerIdentityCredentials {\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/locator.rs\",\n \"rank\": 79,\n \"score\": 20.27803428133916\n },\n {\n \"content\": \"#[repr(C)]\\n\\n#[derive(Copy, Clone)]\\n\\npub struct Worker_Constraint {\\n\\n #[doc = \\\" The type of constraint, defined using Worker_ConstraintType.\\\"]\\n\\n pub constraint_type: u8,\\n\\n #[doc = \\\" Union with fields corresponding to each constraint type.\\\"]\\n\\n pub constraint: Worker_Constraint_Union,\\n\\n}\\n\\nimpl Default for Worker_Constraint {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\npub const Worker_ResultType_WORKER_RESULT_TYPE_COUNT: Worker_ResultType = 1;\\n\\npub const Worker_ResultType_WORKER_RESULT_TYPE_SNAPSHOT: Worker_ResultType = 2;\\n\\npub type Worker_ResultType = i32;\\n\\n#[doc = \\\" An entity query.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Copy, Clone)]\\n\\npub struct Worker_EntityQuery {\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 80,\n \"score\": 20.209256251040372\n },\n {\n \"content\": \"pub struct Worker_Deployment {\\n\\n #[doc = \\\" Name of the deployment.\\\"]\\n\\n pub deployment_name: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The name of the assembly used by this deployment.\\\"]\\n\\n pub assembly_name: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" Description of the deployment.\\\"]\\n\\n pub description: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" Number of users currently connected to the deployment.\\\"]\\n\\n pub users_connected: u32,\\n\\n #[doc = \\\" Total user capacity of the deployment.\\\"]\\n\\n pub users_capacity: u32,\\n\\n}\\n\\nimpl Default for Worker_Deployment {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" A deployment list obtained via Worker_Locator_GetDeploymentListAsync.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 81,\n \"score\": 20.11543162654935\n },\n {\n \"content\": \" use_insecure_connection: self.use_insecure_connection as u8,\\n\\n logging: match self.logging {\\n\\n Some(ref params) => params.to_worker_sdk(),\\n\\n None => ProtocolLoggingParameters::default().to_worker_sdk(),\\n\\n },\\n\\n enable_logging: self.logging.is_some() as u8,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new(credentials: PlayerIdentityCredentials) -> Self {\\n\\n LocatorParameters {\\n\\n credentials,\\n\\n use_insecure_connection: false,\\n\\n logging: None,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn with_insecure_connection(mut self) -> Self {\\n\\n self.use_insecure_connection = true;\\n\\n self\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/locator.rs\",\n \"rank\": 82,\n \"score\": 19.991306902441092\n },\n {\n \"content\": \"pub struct Worker_ComponentConstraint {\\n\\n pub component_id: Worker_ComponentId,\\n\\n}\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Default, Copy, Clone)]\\n\\npub struct Worker_SphereConstraint {\\n\\n pub x: f64,\\n\\n pub y: f64,\\n\\n pub z: f64,\\n\\n pub radius: f64,\\n\\n}\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_AndConstraint {\\n\\n pub constraint_count: u32,\\n\\n pub constraints: *mut Worker_Constraint,\\n\\n}\\n\\nimpl Default for Worker_AndConstraint {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 83,\n \"score\": 19.911759565500695\n },\n {\n \"content\": \"/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use spatialos_sdk::worker::commands::CommandParameters;\\n\\n/// use tap::*;\\n\\n///\\n\\n/// let params = CommandParameters::new()\\n\\n/// .tap(CommandParameters::allow_short_circuit);\\n\\n/// ```\\n\\n///\\n\\n/// [short-circuit]: https://docs.improbable.io/reference/14.1/shared/design/commands#component-commands\\n\\n/// [tap]: https://crates.io/crates/tap\\n\\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub struct CommandParameters {\\n\\n allow_short_circuit: bool,\\n\\n}\\n\\n\\n\\nimpl CommandParameters {\\n\\n /// Creates a new `CommandParameters` with default values for all parameters.\\n\\n pub fn new() -> CommandParameters {\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/commands.rs\",\n \"rank\": 84,\n \"score\": 19.75909911382676\n },\n {\n \"content\": \" pub op: Worker_Op_Union,\\n\\n}\\n\\nimpl Default for Worker_Op {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" An op list, usually returned by Worker_Connection_GetOpList.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_OpList {\\n\\n pub ops: *mut Worker_Op,\\n\\n pub op_count: u32,\\n\\n}\\n\\nimpl Default for Worker_OpList {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\npub const Worker_NetworkSecurityType_WORKER_NETWORK_SECURITY_TYPE_INSECURE:\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 85,\n \"score\": 19.72826548034094\n },\n {\n \"content\": \" #[doc = \\\" Whether the worker is interested in this component.\\\"]\\n\\n pub is_interested: u8,\\n\\n}\\n\\n#[doc = \\\" Worker attributes that are part of a worker's runtime configuration.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_WorkerAttributes {\\n\\n #[doc = \\\" Number of worker attributes.\\\"]\\n\\n pub attribute_count: u32,\\n\\n #[doc = \\\" Will be NULL if there are no attributes associated with the worker.\\\"]\\n\\n pub attributes: *mut *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_WorkerAttributes {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Data for a disconnect message from the SDK.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 86,\n \"score\": 19.63989084964265\n },\n {\n \"content\": \" _ => panic!(format!(\\\"Could not convert {} to enum TestEnum.\\\", value))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TestEnum {\\n\\n pub(crate) fn as_u32(self) -> u32 {\\n\\n match self {\\n\\n \\n\\n TestEnum::FIRST => 0, \\n\\n TestEnum::SECOND => 1, \\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/* Types. */\\n\\n#[derive(Debug, Clone)]\\n\\npub struct CommandData {\\n\\n pub value: i32,\\n\\n}\\n\",\n \"file_path\": \"project-example/src/generated.rs\",\n \"rank\": 87,\n \"score\": 19.554706518898865\n },\n {\n \"content\": \" pub entity_id: Worker_EntityId,\\n\\n #[doc = \\\" Status code of the response, using Worker_StatusCode.\\\"]\\n\\n pub status_code: u8,\\n\\n #[doc = \\\" The error message.\\\"]\\n\\n pub message: *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_DeleteEntityResponseOp {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" A response indicating the result of an entity query request.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_EntityQueryResponseOp {\\n\\n #[doc = \\\" The ID of the entity query request for which there was a response.\\\"]\\n\\n pub request_id: Worker_RequestId,\\n\\n #[doc = \\\" Status code of the response, using Worker_StatusCode.\\\"]\\n\\n pub status_code: u8,\\n\\n #[doc = \\\" The error message.\\\"]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 88,\n \"score\": 19.531988246798647\n },\n {\n \"content\": \" pub component_data_copy: Worker_ComponentDataCopy,\\n\\n pub component_data_deserialize: Worker_ComponentDataDeserialize,\\n\\n pub component_data_serialize: Worker_ComponentDataSerialize,\\n\\n pub component_update_free: Worker_ComponentUpdateFree,\\n\\n pub component_update_copy: Worker_ComponentUpdateCopy,\\n\\n pub component_update_deserialize: Worker_ComponentUpdateDeserialize,\\n\\n pub component_update_serialize: Worker_ComponentUpdateSerialize,\\n\\n}\\n\\nimpl Default for Worker_ComponentVtable {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" An object used to represent a command request by either raw schema data or some user-defined\\\"]\\n\\n#[doc = \\\" handle type.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_CommandRequest {\\n\\n pub reserved: *mut ::std::os::raw::c_void,\\n\\n pub component_id: Worker_ComponentId,\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 89,\n \"score\": 19.504830318868482\n },\n {\n \"content\": \" #[doc = \\\" entity-component.\\\"]\\n\\n pub allow_short_circuit: u8,\\n\\n}\\n\\n#[doc = \\\" Information about status of a network request.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_ConnectionStatus {\\n\\n #[doc = \\\" The status of the request. This value is a member of the enum Worker_ConnectionStatusCode.\\\"]\\n\\n pub code: u8,\\n\\n #[doc = \\\" Detailed, human readable description of the connection status.\\\"]\\n\\n #[doc = \\\" Will be \\\\\\\"OK\\\\\\\" if no error occurred.\\\"]\\n\\n pub detail: *const ::std::os::raw::c_char,\\n\\n}\\n\\nimpl Default for Worker_ConnectionStatus {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" The parameters used when creating a player identity token.\\\"]\\n\\n#[repr(C)]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 90,\n \"score\": 19.480543371539834\n },\n {\n \"content\": \"}\\n\\n#[doc = \\\" The parameters used when creating a login token.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_Alpha_LoginTokensRequest {\\n\\n #[doc = \\\" The player identity token of the player\\\"]\\n\\n pub player_identity_token: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The worker type for which the requested LTs are scoped for.\\\"]\\n\\n pub worker_type: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The lifetime duration of the requested LTs. This is an optional field.\\\"]\\n\\n #[doc = \\\" If the pointer is null, a default value of 15 minutes will be used.\\\"]\\n\\n pub duration_seconds: *const u32,\\n\\n #[doc = \\\" Whether to use an insecure (non-TLS) connection for local development.\\\"]\\n\\n #[doc = \\\" An insecure connection must be used when connecting to a local development login service.\\\"]\\n\\n #[doc = \\\" A secure connection must be used when connecting to a cloud development login service.\\\"]\\n\\n pub use_insecure_connection: u8,\\n\\n}\\n\\nimpl Default for Worker_Alpha_LoginTokensRequest {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 91,\n \"score\": 19.478443561177492\n },\n {\n \"content\": \"use crate::config::Config;\\n\\nuse crate::format_arg;\\n\\nuse log::*;\\n\\nuse spatialos_sdk_code_generator::{generator, schema_bundle};\\n\\nuse std::fs::{self, File};\\n\\nuse std::io::prelude::*;\\n\\nuse std::path::*;\\n\\nuse std::process::Command;\\n\\n\\n\\n/// Performs code generation for the project described by `config`.\\n\\n///\\n\\n/// Assumes that the current working directory is the root directory of the project,\\n\\n/// i.e. the directory that has the `Spatial.toml` file.\\n\",\n \"file_path\": \"cargo-spatial/src/codegen.rs\",\n \"rank\": 93,\n \"score\": 18.709435389170586\n },\n {\n \"content\": \" }\\n\\n}\\n\\n#[doc = \\\" Data for a set of built-in metrics reported by the SDK.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_MetricsOp {\\n\\n pub metrics: Worker_Metrics,\\n\\n}\\n\\nimpl Default for Worker_MetricsOp {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Data for a critical section boundary (enter or leave) operation.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Default, Copy, Clone)]\\n\\npub struct Worker_CriticalSectionOp {\\n\\n #[doc = \\\" Whether the protocol is entering a critical section (true) or leaving it (false).\\\"]\\n\\n pub in_critical_section: u8,\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 94,\n \"score\": 18.681051495560816\n },\n {\n \"content\": \" pub request_id: Worker_RequestId,\\n\\n #[doc = \\\" Status code of the response, using Worker_StatusCode.\\\"]\\n\\n pub status_code: u8,\\n\\n #[doc = \\\" The error message.\\\"]\\n\\n pub message: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" If successful, the entity ID of the newly created entity.\\\"]\\n\\n pub entity_id: Worker_EntityId,\\n\\n}\\n\\nimpl Default for Worker_CreateEntityResponseOp {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Data for a DeleteEntity operation.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_DeleteEntityResponseOp {\\n\\n #[doc = \\\" The ID of the delete entity request for which there was a command response.\\\"]\\n\\n pub request_id: Worker_RequestId,\\n\\n #[doc = \\\" The ID of the target entity of this request.\\\"]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 95,\n \"score\": 18.276806845531304\n },\n {\n \"content\": \" pub request: Worker_CommandRequest,\\n\\n}\\n\\nimpl Default for Worker_CommandRequestOp {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" Data for a CommandResponse operation.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_CommandResponseOp {\\n\\n #[doc = \\\" The ID of the command request for which there was a command response.\\\"]\\n\\n pub request_id: Worker_RequestId,\\n\\n #[doc = \\\" The ID of the entity originally targeted by the command request.\\\"]\\n\\n pub entity_id: Worker_EntityId,\\n\\n #[doc = \\\" Status code of the response, using Worker_StatusCode.\\\"]\\n\\n pub status_code: u8,\\n\\n #[doc = \\\" The error message.\\\"]\\n\\n pub message: *const ::std::os::raw::c_char,\\n\\n #[doc = \\\" The command response data. Deserialized with the corresponding vtable deserialize function and\\\"]\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 96,\n \"score\": 18.27680684553131\n },\n {\n \"content\": \" log_prefix: CString,\\n\\n max_log_files: u32,\\n\\n max_log_file_size_bytes: u32,\\n\\n}\\n\\n\\n\\nimpl ProtocolLoggingParameters {\\n\\n pub fn new() -> Self {\\n\\n Default::default()\\n\\n }\\n\\n\\n\\n /// Sets the prefix string to be used for log file names.\\n\\n ///\\n\\n /// # Panics\\n\\n ///\\n\\n /// This will panic if `prefix` contains a 0 byte. This is a requirement imposed\\n\\n /// by the underlying SpatialOS API.\\n\\n pub fn set_prefix<T: AsRef<str>>(&mut self, prefix: T) {\\n\\n self.log_prefix = CString::new(prefix.as_ref()).expect(\\\"`prefix` contained a null byte\\\");\\n\\n }\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/parameters.rs\",\n \"rank\": 97,\n \"score\": 18.255431016580182\n },\n {\n \"content\": \" pub command_index: Worker_CommandIndex,\\n\\n pub schema_type: *mut Schema_CommandRequest,\\n\\n pub user_handle: *mut Worker_CommandRequestHandle,\\n\\n}\\n\\nimpl Default for Worker_CommandRequest {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\\n#[doc = \\\" An object used to represent a command response by either raw schema data or some user-defined\\\"]\\n\\n#[doc = \\\" handle type.\\\"]\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Worker_CommandResponse {\\n\\n pub reserved: *mut ::std::os::raw::c_void,\\n\\n pub component_id: Worker_ComponentId,\\n\\n pub command_index: Worker_CommandIndex,\\n\\n pub schema_type: *mut Schema_CommandResponse,\\n\\n pub user_handle: *mut Worker_CommandResponseHandle,\\n\\n}\\n\",\n \"file_path\": \"spatialos-sdk-sys/src/worker.rs\",\n \"rank\": 98,\n \"score\": 18.17902694569161\n },\n {\n \"content\": \"use crate::worker::{component::DATABASE, vtable};\\n\\nuse spatialos_sdk_sys::worker::*;\\n\\nuse std::{\\n\\n ffi::{CStr, CString},\\n\\n ptr,\\n\\n};\\n\\n\\n\\npub struct ConnectionParameters {\\n\\n pub worker_type: CString,\\n\\n pub network: NetworkParameters,\\n\\n pub send_queue_capacity: u32,\\n\\n pub receive_queue_capacity: u32,\\n\\n pub log_message_queue_capacity: u32,\\n\\n pub built_in_metrics_report_period_millis: u32,\\n\\n pub protocol_logging: ProtocolLoggingParameters,\\n\\n pub enable_protocol_logging_at_startup: bool,\\n\\n pub thread_affinity: ThreadAffinityParameters,\\n\\n use_internal_serialization: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"spatialos-sdk/src/worker/parameters.rs\",\n \"rank\": 99,\n \"score\": 18.155361911308024\n }\n]","isConversational":false}}},{"rowIdx":1978,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"rg3d-ui/src/check_box.rs"},"repo_name":{"kind":"string","value":"vigdail/rg3d"},"commit":{"kind":"string","value":"b65bfdab350f8c1d48bcc288a8449cc74653ef51"},"file_code":{"kind":"string","value":"use crate::grid::{Column, GridBuilder, Row};\nuse crate::message::MessageDirection;\nuse crate::vector_image::{Primitive, VectorImageBuilder};\nuse crate::{\n border::BorderBuilder,\n brush::Brush,\n core::{color::Color, pool::Handle},\n message::{CheckBoxMessage, UiMessage, UiMessageData, WidgetMessage},\n widget::{Widget, WidgetBuilder},\n BuildContext, Control, HorizontalAlignment, NodeHandleMapping, Thickness, UiNode,\n UserInterface, VerticalAlignment, BRUSH_BRIGHT, BRUSH_DARK, BRUSH_LIGHT, BRUSH_TEXT,\n};\nuse rg3d_core::algebra::Vector2;\nuse std::any::Any;\nuse std::ops::{Deref, DerefMut};\n\n#[derive(Clone)]\npub struct CheckBox {\n pub widget: Widget,\n pub checked: Option<bool>,\n pub check_mark: Handle<UiNode>,\n pub uncheck_mark: Handle<UiNode>,\n pub undefined_mark: Handle<UiNode>,\n}\n\ncrate::define_widget_deref!(CheckBox);\n\nimpl Control for CheckBox {\n fn as_any(&self) -> &dyn Any {\n self\n }\n\n fn as_any_mut(&mut self) -> &mut dyn Any {\n self\n }\n\n fn clone_boxed(&self) -> Box<dyn Control> {\n Box::new(self.clone())\n }\n\n fn resolve(&mut self, node_map: &NodeHandleMapping) {\n node_map.resolve(&mut self.check_mark);\n node_map.resolve(&mut self.uncheck_mark);\n node_map.resolve(&mut self.undefined_mark);\n }\n\n fn handle_routed_message(&mut self, ui: &mut UserInterface, message: &mut UiMessage) {\n self.widget.handle_routed_message(ui, message);\n\n match message.data() {\n UiMessageData::Widget(ref msg) => {\n match msg {\n WidgetMessage::MouseDown { .. } => {\n if message.destination() == self.handle()\n || self.widget.has_descendant(message.destination(), ui)\n {\n ui.capture_mouse(self.handle());\n }\n }\n WidgetMessage::MouseUp { .. } => {\n if message.destination() == self.handle()\n || self.widget.has_descendant(message.destination(), ui)\n {\n ui.release_mouse_capture();\n\n if let Some(value) = self.checked {\n \n ui.send_message(CheckBoxMessage::checked(\n self.handle(),\n MessageDirection::ToWidget,\n Some(!value),\n ));\n } else {\n \n ui.send_message(CheckBoxMessage::checked(\n self.handle(),\n MessageDirection::ToWidget,\n Some(true),\n ));\n }\n }\n }\n _ => (),\n }\n }\n &UiMessageData::CheckBox(CheckBoxMessage::Check(value))\n if message.direction() == MessageDirection::ToWidget\n && message.destination() == self.handle() =>\n {\n if self.checked != value {\n self.checked = value;\n\n ui.send_message(message.reverse());\n\n if self.check_mark.is_some() {\n match value {\n None => {\n ui.send_message(WidgetMessage::visibility(\n self.check_mark,\n MessageDirection::ToWidget,\n false,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.uncheck_mark,\n MessageDirection::ToWidget,\n false,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.undefined_mark,\n MessageDirection::ToWidget,\n true,\n ));\n }\n Some(value) => {\n ui.send_message(WidgetMessage::visibility(\n self.check_mark,\n MessageDirection::ToWidget,\n value,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.uncheck_mark,\n MessageDirection::ToWidget,\n !value,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.undefined_mark,\n MessageDirection::ToWidget,\n false,\n ));\n }\n }\n }\n }\n }\n _ => {}\n }\n }\n\n fn remove_ref(&mut self, handle: Handle<UiNode>) {\n if self.check_mark == handle {\n self.check_mark = Handle::NONE;\n }\n if self.uncheck_mark == handle {\n self.uncheck_mark = Handle::NONE;\n }\n if self.undefined_mark == handle {\n self.undefined_mark = Handle::NONE;\n }\n }\n}\n\npub struct CheckBoxBuilder {\n widget_builder: WidgetBuilder,\n checked: Option<bool>,\n check_mark: Option<Handle<UiNode>>,\n uncheck_mark: Option<Handle<UiNode>>,\n undefined_mark: Option<Handle<UiNode>>,\n content: Handle<UiNode>,\n}\n\nimpl CheckBoxBuilder {\n pub fn new(widget_builder: WidgetBuilder) -> Self {\n Self {\n widget_builder,\n checked: Some(false),\n check_mark: None,\n uncheck_mark: None,\n undefined_mark: None,\n content: Handle::NONE,\n }\n }\n\n pub fn checked(mut self, value: Option<bool>) -> Self {\n self.checked = value;\n self\n }\n\n pub fn with_check_mark(mut self, check_mark: Handle<UiNode>) -> Self {\n self.check_mark = Some(check_mark);\n self\n }\n\n pub fn with_uncheck_mark(mut self, uncheck_mark: Handle<UiNode>) -> Self {\n self.uncheck_mark = Some(uncheck_mark);\n self\n }\n\n pub fn with_undefined_mark(mut self, undefined_mark: Handle<UiNode>) -> Self {\n self.undefined_mark = Some(undefined_mark);\n self\n }\n\n pub fn with_content(mut self, content: Handle<UiNode>) -> Self {\n self.content = content;\n self\n }\n\n pub fn build(self, ctx: &mut BuildContext) -> Handle<UiNode> {\n let check_mark = self.check_mark.unwrap_or_else(|| {\n VectorImageBuilder::new(\n WidgetBuilder::new()\n .with_vertical_alignment(VerticalAlignment::Center)\n .with_horizontal_alignment(HorizontalAlignment::Center)\n .with_foreground(BRUSH_TEXT),\n )\n .with_primitives(vec![\n Primitive::Line {\n begin: Vector2::new(0.0, 6.0),\n end: Vector2::new(6.0, 12.0),\n thickness: 2.0,\n },\n Primitive::Line {\n begin: Vector2::new(6.0, 12.0),\n end: Vector2::new(12.0, 0.0),\n thickness: 2.0,\n },\n ])\n .build(ctx)\n });\n ctx[check_mark].set_visibility(self.checked.unwrap_or(false));\n\n let uncheck_mark = self.uncheck_mark.unwrap_or_else(|| {\n BorderBuilder::new(\n WidgetBuilder::new()\n .with_background(Brush::Solid(Color::TRANSPARENT))\n .with_foreground(Brush::Solid(Color::TRANSPARENT)),\n )\n .build(ctx)\n });\n ctx[uncheck_mark].set_visibility(!self.checked.unwrap_or(true));\n\n let undefined_mark = self.undefined_mark.unwrap_or_else(|| {\n BorderBuilder::new(\n WidgetBuilder::new()\n .with_margin(Thickness::uniform(1.0))\n .with_background(BRUSH_BRIGHT)\n .with_foreground(Brush::Solid(Color::TRANSPARENT)),\n )\n .build(ctx)\n });\n ctx[undefined_mark].set_visibility(self.checked.is_none());\n\n if self.content.is_some() {\n ctx[self.content].set_row(0).set_column(1);\n }\n\n let grid = GridBuilder::new(\n WidgetBuilder::new()\n .with_child(\n BorderBuilder::new(\n WidgetBuilder::new()\n .with_child(check_mark)\n .with_child(uncheck_mark)\n .with_child(undefined_mark)\n .with_background(BRUSH_DARK)\n .with_foreground(BRUSH_LIGHT),\n )\n .with_stroke_thickness(Thickness::uniform(1.0))\n .build(ctx),\n )\n .with_child(self.content),\n )\n .add_row(Row::stretch())\n .add_column(Column::strict(20.0))\n .add_column(Column::stretch())\n .build(ctx);\n\n let cb = CheckBox {\n widget: self.widget_builder.with_child(grid).build(),\n checked: self.checked,\n check_mark,\n uncheck_mark,\n undefined_mark,\n };\n ctx.add_node(UiNode::new(cb))\n }\n}\n\n#[cfg(test)]\nmod test {\n use crate::{\n check_box::CheckBoxBuilder,\n core::algebra::Vector2,\n message::{CheckBoxMessage, MessageDirection},\n widget::WidgetBuilder,\n UserInterface,\n };\n\n #[test]\n fn check_box() {\n let mut ui = UserInterface::new(Vector2::new(1000.0, 1000.0));\n\n assert_eq!(ui.poll_message(), None);\n\n let check_box = CheckBoxBuilder::new(WidgetBuilder::new()).build(&mut ui.build_ctx());\n\n assert_eq!(ui.poll_message(), None);\n\n \n let input_message =\n CheckBoxMessage::checked(check_box, MessageDirection::ToWidget, Some(true));\n\n ui.send_message(input_message.clone());\n\n \n assert_eq!(ui.poll_message(), Some(input_message.clone()));\n \n assert_eq!(ui.poll_message(), Some(input_message.reverse()));\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::grid::{Column, GridBuilder, Row};\nuse crate::message::MessageDirection;\nuse crate::vector_image::{Primitive, VectorImageBuilder};\nuse crate::{\n border::BorderBuilder,\n brush::Brush,\n core::{color::Color, pool::Handle},\n message::{CheckBoxMessage, UiMessage, UiMessageData, WidgetMessage},\n widget::{Widget, WidgetBuilder},\n BuildContext, Control, HorizontalAlignment, NodeHandleMapping, Thickness, UiNode,\n UserInterface, VerticalAlignment, BRUSH_BRIGHT, BRUSH_DARK, BRUSH_LIGHT, BRUSH_TEXT,\n};\nuse rg3d_core::algebra::Vector2;\nuse std::any::Any;\nuse std::ops::{Deref, DerefMut};\n\n#[derive(Clone)]\npub struct CheckBox {\n pub widget: Widget,\n pub checked: Option<bool>,\n pub check_mark: Handle<UiNode>,\n pub uncheck_mark: Handle<UiNode>,\n pub undefined_mark: Handle<UiNode>,\n}\n\ncrate::define_widget_deref!(CheckBox);\n\nimpl Control for CheckBox {\n fn as_any(&self) -> &dyn Any {\n self\n }\n\n fn as_any_mut(&mut self) -> &mut dyn Any {\n self\n }\n\n fn clone_boxed(&self) -> Box<dyn Control> {\n Box::new(self.clone())\n }\n\n fn resolve(&mut self, node_map: &NodeHandleMapping) {\n node_map.resolve(&mut self.check_mark);\n node_map.resolve(&mut self.uncheck_mark);\n node_map.resolve(&mut self.undefined_mark);\n }\n\n fn handle_routed_message(&mut self, ui: &mut UserInterface, message: &mut UiMessage) {\n self.widget.handle_routed_message(ui, message);\n\n match message.data() {\n UiMessageData::Widget(ref msg) => {\n match msg {\n WidgetMessage::MouseDown { .. } => {\n if message.destination() == self.handle()\n || self.widget.has_descendant(message.destination(), ui)\n {\n ui.capture_mouse(self.handle());\n }\n }\n WidgetMessage::MouseUp { .. } => {\n if message.destination() == self.handle()\n || self.widget.has_descendant(message.destination(), ui)\n {\n ui.release_mouse_capture();\n\n if let Some(value) = self.checked {\n \n ui.send_message(CheckBoxMessage::checked(\n self.handle(),\n MessageDirection::ToWidget,\n Some(!value),\n ));\n } else {\n \n ui.send_message(CheckBoxMessage::checked(\n self.handle(),\n MessageDirection::ToWidget,\n Some(true),\n ));\n }\n }\n }\n _ => (),\n }\n }\n &UiMessageData::CheckBox(CheckBoxMessage::Check(value))\n if message.direction() == MessageDirection::ToWidget\n && message.destination() == self.handle() =>\n {\n if self.checked != value {\n self.checked = value;\n\n ui.send_message(message.reverse());\n\n if self.check_mark.is_some() {\n match value {\n None => {\n ui.send_message(WidgetMessage::visibility(\n self.check_mark,\n MessageDirection::ToWidget,\n false,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.uncheck_mark,\n MessageDirection::ToWidget,\n false,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.undefined_mark,\n MessageDirection::ToWidget,\n true,\n ));\n }\n Some(value) => {\n ui.send_message(WidgetMessage::visibility(\n self.check_mark,\n MessageDirection::ToWidget,\n value,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.uncheck_mark,\n MessageDirection::ToWidget,\n !value,\n ));\n ui.send_message(WidgetMessage::visibility(\n self.undefined_mark,\n MessageDirection::ToWidget,\n false,\n ));\n }\n }\n }\n }\n }\n _ => {}\n }\n }\n\n fn remove_ref(&mut self, handle: Handle<UiNode>) {\n if self.check_mark == handle {\n self.check_mark = Handle::NONE;\n }\n if self.uncheck_mark == handle {\n self.uncheck_mark = Handle::NONE;\n }\n if self.undefined_mark == handle {\n self.undefined_mark = Handle::NONE;\n }\n }\n}\n\npub struct CheckBoxBuilder {\n widget_builder: WidgetBuilder,\n checked: Option<bool>,\n check_mark: Option<Handle<UiNode>>,\n uncheck_mark: Option<Handle<UiNode>>,\n undefined_mark: Option<Handle<UiNode>>,\n content: Handle<UiNode>,\n}\n\nimpl CheckBoxBuilder {\n pub fn new(widget_builder: WidgetBuilder) -> Self {\n Self {\n widget_builder,\n checked: Some(false),\n check_mark: None,\n uncheck_mark: None,\n undefined_mark: None,\n content: Handle::NONE,\n }\n }\n\n pub fn checked(mut self, value: Option<bool>) -> Self {\n self.checked = value;\n self\n }\n\n pub fn with_check_mark(mut self, check_mark: Handle<UiNode>) -> Self {\n self.check_mark = Some(check_mark);\n self\n }\n\n pub fn with_uncheck_mark(mut self, uncheck_mark: Handle<UiNode>) -> Self {\n self.uncheck_mark = Some(uncheck_mark);\n self\n }\n\n pub fn with_undefined_mark(mut self, undefined_mark: Handle<UiNode>) -> Self {\n self.undefined_mark = Some(undefined_mark);\n self\n }\n\n pub fn with_content(mut self, content: Handle<UiNode>) -> Self {\n self.content = content;\n self\n }\n\n "},"suffix":{"kind":"string","value":"\n}\n\n#[cfg(test)]\nmod test {\n use crate::{\n check_box::CheckBoxBuilder,\n core::algebra::Vector2,\n message::{CheckBoxMessage, MessageDirection},\n widget::WidgetBuilder,\n UserInterface,\n };\n\n #[test]\n fn check_box() {\n let mut ui = UserInterface::new(Vector2::new(1000.0, 1000.0));\n\n assert_eq!(ui.poll_message(), None);\n\n let check_box = CheckBoxBuilder::new(WidgetBuilder::new()).build(&mut ui.build_ctx());\n\n assert_eq!(ui.poll_message(), None);\n\n \n let input_message =\n CheckBoxMessage::checked(check_box, MessageDirection::ToWidget, Some(true));\n\n ui.send_message(input_message.clone());\n\n \n assert_eq!(ui.poll_message(), Some(input_message.clone()));\n \n assert_eq!(ui.poll_message(), Some(input_message.reverse()));\n }\n}\n"},"middle":{"kind":"string","value":"pub fn build(self, ctx: &mut BuildContext) -> Handle<UiNode> {\n let check_mark = self.check_mark.unwrap_or_else(|| {\n VectorImageBuilder::new(\n WidgetBuilder::new()\n .with_vertical_alignment(VerticalAlignment::Center)\n .with_horizontal_alignment(HorizontalAlignment::Center)\n .with_foreground(BRUSH_TEXT),\n )\n .with_primitives(vec![\n Primitive::Line {\n begin: Vector2::new(0.0, 6.0),\n end: Vector2::new(6.0, 12.0),\n thickness: 2.0,\n },\n Primitive::Line {\n begin: Vector2::new(6.0, 12.0),\n end: Vector2::new(12.0, 0.0),\n thickness: 2.0,\n },\n ])\n .build(ctx)\n });\n ctx[check_mark].set_visibility(self.checked.unwrap_or(false));\n\n let uncheck_mark = self.uncheck_mark.unwrap_or_else(|| {\n BorderBuilder::new(\n WidgetBuilder::new()\n .with_background(Brush::Solid(Color::TRANSPARENT))\n .with_foreground(Brush::Solid(Color::TRANSPARENT)),\n )\n .build(ctx)\n });\n ctx[uncheck_mark].set_visibility(!self.checked.unwrap_or(true));\n\n let undefined_mark = self.undefined_mark.unwrap_or_else(|| {\n BorderBuilder::new(\n WidgetBuilder::new()\n .with_margin(Thickness::uniform(1.0))\n .with_background(BRUSH_BRIGHT)\n .with_foreground(Brush::Solid(Color::TRANSPARENT)),\n )\n .build(ctx)\n });\n ctx[undefined_mark].set_visibility(self.checked.is_none());\n\n if self.content.is_some() {\n ctx[self.content].set_row(0).set_column(1);\n }\n\n let grid = GridBuilder::new(\n WidgetBuilder::new()\n .with_child(\n BorderBuilder::new(\n WidgetBuilder::new()\n .with_child(check_mark)\n .with_child(uncheck_mark)\n .with_child(undefined_mark)\n .with_background(BRUSH_DARK)\n .with_foreground(BRUSH_LIGHT),\n )\n .with_stroke_thickness(Thickness::uniform(1.0))\n .build(ctx),\n )\n .with_child(self.content),\n )\n .add_row(Row::stretch())\n .add_column(Column::strict(20.0))\n .add_column(Column::stretch())\n .build(ctx);\n\n let cb = CheckBox {\n widget: self.widget_builder.with_child(grid).build(),\n checked: self.checked,\n check_mark,\n uncheck_mark,\n undefined_mark,\n };\n ctx.add_node(UiNode::new(cb))\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn make_default_anchor(ctx: &mut BuildContext, row: usize, column: usize) -> Handle<UiNode> {\n\n let default_anchor_size = 30.0;\n\n BorderBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(default_anchor_size)\n\n .with_height(default_anchor_size)\n\n .with_visibility(false)\n\n .on_row(row)\n\n .on_column(column)\n\n .with_draw_on_top(true)\n\n .with_background(Brush::Solid(DEFAULT_ANCHOR_COLOR)),\n\n )\n\n .build(ctx)\n\n}\n\n\n\nimpl TileBuilder {\n\n pub fn new(widget_builder: WidgetBuilder) -> Self {\n\n Self {\n\n widget_builder,\n\n content: TileContent::Empty,\n","file_path":"rg3d-ui/src/dock.rs","rank":0,"score":376216.7833941174},{"content":"pub fn make_button(ctx: &mut BuildContext, arrow: ArrowDirection, row: usize) -> Handle<UiNode> {\n\n ButtonBuilder::new(\n\n WidgetBuilder::new()\n\n .with_margin(Thickness::right(1.0))\n\n .on_row(row),\n\n )\n\n .with_back(\n\n DecoratorBuilder::new(BorderBuilder::new(\n\n WidgetBuilder::new().with_foreground(Brush::Solid(Color::opaque(90, 90, 90))),\n\n ))\n\n .with_normal_brush(Brush::Solid(Color::opaque(60, 60, 60)))\n\n .with_hover_brush(Brush::Solid(Color::opaque(80, 80, 80)))\n\n .with_pressed_brush(Brush::Solid(Color::opaque(80, 118, 178)))\n\n .build(ctx),\n\n )\n\n .with_content(make_arrow(ctx, arrow, 6.0))\n\n .build(ctx)\n\n}\n\n\n\nimpl NumericUpDownBuilder {\n","file_path":"rg3d-ui/src/numeric.rs","rank":1,"score":376216.7833941174},{"content":"/// Trait for all UI controls in library.\n\npub trait Control: 'static + Deref<Target = Widget> + DerefMut {\n\n fn as_any(&self) -> &dyn Any;\n\n\n\n fn as_any_mut(&mut self) -> &mut dyn Any;\n\n\n\n fn clone_boxed(&self) -> Box<dyn Control>;\n\n\n\n fn resolve(&mut self, _node_map: &NodeHandleMapping) {}\n\n\n\n fn measure_override(&self, ui: &UserInterface, available_size: Vector2<f32>) -> Vector2<f32> {\n\n scope_profile!();\n\n\n\n self.deref().measure_override(ui, available_size)\n\n }\n\n\n\n fn arrange_override(&self, ui: &UserInterface, final_size: Vector2<f32>) -> Vector2<f32> {\n\n scope_profile!();\n\n\n\n self.deref().arrange_override(ui, final_size)\n\n }\n","file_path":"rg3d-ui/src/lib.rs","rank":2,"score":347255.366194612},{"content":"pub fn make_numeric_input(ctx: &mut BuildContext, column: usize, value: f32) -> Handle<UiNode> {\n\n NumericUpDownBuilder::new(\n\n WidgetBuilder::new()\n\n .on_row(0)\n\n .on_column(column)\n\n .with_margin(Thickness {\n\n left: 1.0,\n\n top: 0.0,\n\n right: 1.0,\n\n bottom: 0.0,\n\n }),\n\n )\n\n .with_value(value)\n\n .build(ctx)\n\n}\n\n\n","file_path":"rg3d-ui/src/vec/mod.rs","rank":3,"score":347019.0735168791},{"content":"pub fn create_ui(ui: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text = TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0))\n\n .with_wrap(WrapMode::Word)\n\n .build(ui);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_bar =\n\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ui);\n\n progress_bar\n\n })\n\n .with_child({\n","file_path":"examples/shared/mod.rs","rank":4,"score":316273.96678804676},{"content":"fn make_text_mark(ctx: &mut BuildContext, text: &str, row: usize, column: usize) -> Handle<UiNode> {\n\n TextBuilder::new(\n\n WidgetBuilder::new()\n\n .with_vertical_alignment(VerticalAlignment::Center)\n\n .on_row(row)\n\n .on_column(column),\n\n )\n\n .with_text(text)\n\n .build(ctx)\n\n}\n\n\n","file_path":"rg3d-ui/src/color.rs","rank":5,"score":304733.4592713668},{"content":"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\n\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\n\n}\n\n\n","file_path":"examples/lod.rs","rank":6,"score":287615.84311128437},{"content":"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\n\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\n\n}\n\n\n","file_path":"examples/navmesh.rs","rank":7,"score":287615.84311128437},{"content":"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\n\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\n\n}\n\n\n","file_path":"examples/scene.rs","rank":8,"score":287615.84311128437},{"content":"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\n\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\n\n}\n\n\n\n#[wasm_bindgen]\n\nextern \"C\" {\n\n #[wasm_bindgen(js_namespace = console)]\n\n fn error(msg: String);\n\n\n\n type Error;\n\n\n\n #[wasm_bindgen(constructor)]\n\n fn new() -> Error;\n\n\n\n #[wasm_bindgen(structural, method, getter)]\n\n fn stack(error: &Error) -> String;\n\n}\n\n\n","file_path":"examples/wasm/src/lib.rs","rank":9,"score":280646.12463261327},{"content":"fn generate_item_container(ctx: &mut BuildContext, item: Handle<UiNode>) -> Handle<UiNode> {\n\n let item = ListViewItem {\n\n widget: WidgetBuilder::new().with_child(item).build(),\n\n };\n\n\n\n ctx.add_node(UiNode::new(item))\n\n}\n\n\n","file_path":"rg3d-ui/src/list_view.rs","rank":10,"score":272466.7799684746},{"content":"/// Translates window mouse button into rg3d-ui mouse button.\n\npub fn translate_button(button: crate::event::MouseButton) -> crate::gui::message::MouseButton {\n\n match button {\n\n crate::event::MouseButton::Left => crate::gui::message::MouseButton::Left,\n\n crate::event::MouseButton::Right => crate::gui::message::MouseButton::Right,\n\n crate::event::MouseButton::Middle => crate::gui::message::MouseButton::Middle,\n\n crate::event::MouseButton::Other(i) => crate::gui::message::MouseButton::Other(i),\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":11,"score":268776.844024753},{"content":"/// Translates cursor icon from rg3d-ui library to glutin format.\n\npub fn translate_cursor_icon(icon: crate::gui::message::CursorIcon) -> crate::window::CursorIcon {\n\n match icon {\n\n crate::gui::message::CursorIcon::Default => crate::window::CursorIcon::Default,\n\n crate::gui::message::CursorIcon::Crosshair => crate::window::CursorIcon::Crosshair,\n\n crate::gui::message::CursorIcon::Hand => crate::window::CursorIcon::Hand,\n\n crate::gui::message::CursorIcon::Arrow => crate::window::CursorIcon::Arrow,\n\n crate::gui::message::CursorIcon::Move => crate::window::CursorIcon::Move,\n\n crate::gui::message::CursorIcon::Text => crate::window::CursorIcon::Text,\n\n crate::gui::message::CursorIcon::Wait => crate::window::CursorIcon::Wait,\n\n crate::gui::message::CursorIcon::Help => crate::window::CursorIcon::Help,\n\n crate::gui::message::CursorIcon::Progress => crate::window::CursorIcon::Progress,\n\n crate::gui::message::CursorIcon::NotAllowed => crate::window::CursorIcon::NotAllowed,\n\n crate::gui::message::CursorIcon::ContextMenu => crate::window::CursorIcon::ContextMenu,\n\n crate::gui::message::CursorIcon::Cell => crate::window::CursorIcon::Cell,\n\n crate::gui::message::CursorIcon::VerticalText => crate::window::CursorIcon::VerticalText,\n\n crate::gui::message::CursorIcon::Alias => crate::window::CursorIcon::Alias,\n\n crate::gui::message::CursorIcon::Copy => crate::window::CursorIcon::Copy,\n\n crate::gui::message::CursorIcon::NoDrop => crate::window::CursorIcon::NoDrop,\n\n crate::gui::message::CursorIcon::Grab => crate::window::CursorIcon::Grab,\n\n crate::gui::message::CursorIcon::Grabbing => crate::window::CursorIcon::Grabbing,\n","file_path":"src/utils/mod.rs","rank":12,"score":265779.7514632906},{"content":"fn make_text_title(ctx: &mut BuildContext, text: &str) -> Handle<UiNode> {\n\n TextBuilder::new(\n\n WidgetBuilder::new()\n\n .with_margin(Thickness::uniform(5.0))\n\n .on_row(0)\n\n .on_column(0),\n\n )\n\n .with_text(text)\n\n .build(ctx)\n\n}\n\n\n","file_path":"rg3d-ui/src/window.rs","rank":13,"score":263554.01949377905},{"content":"fn make_mark(ctx: &mut BuildContext, button: HeaderButton) -> Handle<UiNode> {\n\n VectorImageBuilder::new(\n\n WidgetBuilder::new()\n\n .with_horizontal_alignment(HorizontalAlignment::Center)\n\n .with_vertical_alignment(match button {\n\n HeaderButton::Close => VerticalAlignment::Center,\n\n HeaderButton::Minimize => VerticalAlignment::Bottom,\n\n })\n\n .with_margin(match button {\n\n HeaderButton::Close => Thickness::uniform(0.0),\n\n HeaderButton::Minimize => Thickness::bottom(3.0),\n\n })\n\n .with_foreground(BRUSH_BRIGHT),\n\n )\n\n .with_primitives(match button {\n\n HeaderButton::Close => {\n\n vec![\n\n Primitive::Line {\n\n begin: Vector2::new(0.0, 0.0),\n\n end: Vector2::new(12.0, 12.0),\n","file_path":"rg3d-ui/src/window.rs","rank":14,"score":263554.01949377905},{"content":"fn make_header_button(ctx: &mut BuildContext, button: HeaderButton) -> Handle<UiNode> {\n\n ButtonBuilder::new(WidgetBuilder::new().with_margin(Thickness::uniform(2.0)))\n\n .with_back(\n\n DecoratorBuilder::new(\n\n BorderBuilder::new(WidgetBuilder::new())\n\n .with_stroke_thickness(Thickness::uniform(0.0)),\n\n )\n\n .with_normal_brush(Brush::Solid(Color::TRANSPARENT))\n\n .with_hover_brush(BRUSH_LIGHT)\n\n .with_pressed_brush(BRUSH_LIGHTEST)\n\n .build(ctx),\n\n )\n\n .with_content(make_mark(ctx, button))\n\n .build(ctx)\n\n}\n\n\n\nimpl<'a> WindowBuilder {\n\n pub fn new(widget_builder: WidgetBuilder) -> Self {\n\n Self {\n\n widget_builder,\n","file_path":"rg3d-ui/src/window.rs","rank":15,"score":260579.46328660686},{"content":"fn create_section_header(ctx: &mut BuildContext, text: &str) -> Handle<UiNode> {\n\n TextBuilder::new(WidgetBuilder::new().with_margin(Thickness::uniform(1.0)))\n\n .with_text(text)\n\n .with_vertical_text_alignment(VerticalAlignment::Center)\n\n .build(ctx)\n\n}\n\n\n","file_path":"rg3d-ui/src/inspector/mod.rs","rank":16,"score":260579.46328660686},{"content":"fn mark_handled(message: UiMessage) -> UiMessage {\n\n message.set_handled(true);\n\n message\n\n}\n\n\n\nimpl ColorPicker {\n\n fn sync_fields(&self, ui: &mut UserInterface, color: Color, hsv: Hsv) {\n\n ui.send_message(mark_handled(NumericUpDownMessage::value(\n\n self.hue,\n\n MessageDirection::ToWidget,\n\n hsv.hue(),\n\n )));\n\n\n\n ui.send_message(mark_handled(NumericUpDownMessage::value(\n\n self.saturation,\n\n MessageDirection::ToWidget,\n\n hsv.saturation(),\n\n )));\n\n\n\n ui.send_message(mark_handled(NumericUpDownMessage::value(\n","file_path":"rg3d-ui/src/color.rs","rank":17,"score":254005.96975483073},{"content":"fn create_item_views(items: &[Item], ctx: &mut BuildContext) -> Vec<Handle<UiNode>> {\n\n items\n\n .iter()\n\n .enumerate()\n\n .map(|(n, item)| {\n\n BorderBuilder::new(\n\n WidgetBuilder::new()\n\n .with_child(\n\n ExpanderBuilder::new(WidgetBuilder::new())\n\n .with_header(\n\n GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_child(\n\n TextBuilder::new(WidgetBuilder::new())\n\n .with_vertical_text_alignment(\n\n VerticalAlignment::Center,\n\n )\n\n .with_text(format!(\"Item {}\", n))\n\n .build(ctx),\n\n )\n","file_path":"rg3d-ui/src/inspector/editors/collection.rs","rank":18,"score":251618.76260662643},{"content":"/// Performs hashing of a sized value by interpreting it as raw memory.\n\npub fn hash_as_bytes<T: Sized, H: Hasher>(value: &T, hasher: &mut H) {\n\n hasher.write(value_as_u8_slice(value))\n\n}\n","file_path":"src/utils/mod.rs","rank":19,"score":244819.44435717873},{"content":"pub fn wrapf(mut n: f32, mut min_limit: f32, mut max_limit: f32) -> f32 {\n\n if n >= min_limit && n <= max_limit {\n\n return n;\n\n }\n\n\n\n if max_limit == 0.0 && min_limit == 0.0 {\n\n return 0.0;\n\n }\n\n\n\n max_limit -= min_limit;\n\n\n\n let offset = min_limit;\n\n min_limit = 0.0;\n\n n -= offset;\n\n\n\n let num_of_max = (n / max_limit).abs().floor();\n\n\n\n if n >= max_limit {\n\n n -= num_of_max * max_limit;\n\n } else if n < min_limit {\n\n n += (num_of_max + 1.0) * max_limit;\n\n }\n\n\n\n n + offset\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":20,"score":228154.8003304491},{"content":"pub fn check(err_code: c_int) -> Result<(), SoundError> {\n\n if err_code < 0 {\n\n Err(SoundError::FailedToInitializeDevice(err_code_to_string(\n\n err_code,\n\n )))\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl AlsaSoundDevice {\n\n pub fn new<F: FnMut(&mut [(f32, f32)]) + Send + 'static>(\n\n buffer_len_bytes: u32,\n\n callback: F,\n\n ) -> Result<Self, SoundError> {\n\n unsafe {\n\n let name = CString::new(\"default\").unwrap();\n\n // 16-bit stereo is 4 bytes, so frame count is bufferHalfSize / 4\n\n let frame_count = buffer_len_bytes / 4;\n\n let mut playback_device = std::ptr::null_mut();\n","file_path":"rg3d-sound/src/device/alsa.rs","rank":21,"score":222998.92013909158},{"content":"pub fn fix_shadows_distance(mut quality: QualitySettings) -> QualitySettings {\n\n // Scale distance because game world has different scale.\n\n quality.spot_shadows_distance *= 2.0;\n\n quality.point_shadows_distance *= 2.0;\n\n quality\n\n}\n","file_path":"examples/shared/mod.rs","rank":22,"score":222517.32502666634},{"content":"/// \"Transmutes\" value of any sized type to a slice of bytes.\n\npub fn value_as_u8_slice<T: Sized>(v: &T) -> &'_ [u8] {\n\n // SAFETY: It is safe to reinterpret data to read it.\n\n unsafe { std::slice::from_raw_parts(v as *const T as *const u8, std::mem::size_of::<T>()) }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":23,"score":221045.03283963673},{"content":"pub fn make_arrow(\n\n ctx: &mut BuildContext,\n\n orientation: ArrowDirection,\n\n size: f32,\n\n) -> Handle<UiNode> {\n\n VectorImageBuilder::new(\n\n WidgetBuilder::new()\n\n .with_foreground(BRUSH_BRIGHT)\n\n .with_horizontal_alignment(HorizontalAlignment::Center)\n\n .with_vertical_alignment(VerticalAlignment::Center),\n\n )\n\n .with_primitives(vec![match orientation {\n\n ArrowDirection::Top => Primitive::Triangle {\n\n points: [\n\n Vector2::new(size * 0.5, 0.0),\n\n Vector2::new(size, size),\n\n Vector2::new(0.0, size),\n\n ],\n\n },\n\n ArrowDirection::Bottom => Primitive::Triangle {\n","file_path":"rg3d-ui/src/utils.rs","rank":24,"score":220987.44933732622},{"content":"// User interface in the engine build up on graph data structure, on tree to be\n\n// more precise. Each UI element can have single parent and multiple children.\n\n// UI uses complex layout system which automatically organizes your widgets.\n\n// In this example we'll use Grid and StackPanel layout controls. Grid can be\n\n// divided in rows and columns, its child element can set their desired column\n\n// and row and grid will automatically put them in correct position. StackPanel\n\n// will \"stack\" UI elements either on top of each other or in one line. Such\n\n// complex layout system was borrowed from WPF framework. You can read more here:\n\n// https://docs.microsoft.com/en-us/dotnet/framework/wpf/advanced/layout\n\nfn create_ui(engine: &mut Engine) -> Interface {\n\n let window_width = engine.renderer.get_frame_size().0 as f32;\n\n\n\n // Gather all suitable video modes, we'll use them to fill combo box of\n\n // available resolutions.\n\n let video_modes = engine\n\n .get_window()\n\n .primary_monitor()\n\n .unwrap()\n\n .video_modes()\n\n .filter(|vm| {\n\n // Leave only modern video modes, we are not in 1998.\n\n vm.size().width > 800 && vm.size().height > 600 && vm.bit_depth() == 32\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n let ctx = &mut engine.user_interface.build_ctx();\n\n\n\n // First of all create debug text that will show title of example and current FPS.\n\n let debug_text = TextBuilder::new(WidgetBuilder::new()).build(ctx);\n","file_path":"examples/ui.rs","rank":25,"score":220724.18147466824},{"content":"// MenuItem uses popup to show its content, popup can be top-most only if it is\n\n// direct child of root canvas of UI. This fact adds some complications to search\n\n// of parent menu - we can't just traverse the tree because popup is not a child\n\n// of menu item, instead we trying to fetch handle to parent menu item from popup's\n\n// user data and continue up-search until we find menu.\n\nfn find_menu(from: Handle<UiNode>, ui: &UserInterface) -> Handle<UiNode> {\n\n let mut handle = from;\n\n while handle.is_some() {\n\n if let Some((_, popup)) = ui.try_borrow_by_type_up::<Popup>(handle) {\n\n // Continue search from parent menu item of popup.\n\n handle = popup\n\n .user_data_ref::<Handle<UiNode>>()\n\n .cloned()\n\n .unwrap_or_default();\n\n } else {\n\n // Maybe we have Menu as parent for MenuItem.\n\n return ui.find_by_criteria_up(handle, |n| n.cast::<Menu>().is_some());\n\n }\n\n }\n\n Default::default()\n\n}\n\n\n","file_path":"rg3d-ui/src/menu.rs","rank":26,"score":218985.13202207064},{"content":"/// Handles error codes of coreaudio functions\n\nfn check(error: OSStatus, msg: &str) -> Result<(), SoundError> {\n\n if error == noErr as i32 {\n\n Ok(())\n\n } else {\n\n let msg = format!(\"{}. Error code {}\", msg, error);\n\n Err(SoundError::FailedToInitializeDevice(msg))\n\n }\n\n}\n\n\n\n/// Callback function set on `AudioQueueNewOutput`\n\nunsafe extern \"C\" fn audio_queue_callback(\n\n user_data: *mut c_void,\n\n queue: AudioQueueRef,\n\n buf: AudioQueueBufferRef,\n\n) {\n\n let inner: &mut Inner = &mut *(user_data as *mut Inner);\n\n inner.mix(); // Device::mix\n\n\n\n // set the buffer data\n\n let src = inner.out_data.as_mut_ptr() as *mut u8;\n","file_path":"rg3d-sound/src/device/coreaudio.rs","rank":27,"score":218076.87341370335},{"content":"pub fn make_mark(\n\n ctx: &mut BuildContext,\n\n text: &str,\n\n column: usize,\n\n color: Color,\n\n) -> Handle<UiNode> {\n\n BorderBuilder::new(\n\n WidgetBuilder::new()\n\n .on_row(0)\n\n .on_column(column)\n\n .with_background(Brush::Solid(color))\n\n .with_foreground(Brush::Solid(Color::TRANSPARENT))\n\n .with_child(\n\n TextBuilder::new(WidgetBuilder::new())\n\n .with_vertical_text_alignment(VerticalAlignment::Center)\n\n .with_text(text)\n\n .build(ctx),\n\n ),\n\n )\n\n .build(ctx)\n\n}\n","file_path":"rg3d-ui/src/vec/mod.rs","rank":28,"score":217712.71779618526},{"content":"pub fn create_impl(\n\n ty_args: &args::TypeArgs,\n\n field_args: impl Iterator<Item = args::FieldArgs>,\n\n impl_body: TokenStream2,\n\n) -> TokenStream2 {\n\n let ty_ident = &ty_args.ident;\n\n let generics = self::create_impl_generics(&ty_args.generics, field_args);\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n\n\n quote! {\n\n impl #impl_generics Visit for #ty_ident #ty_generics #where_clause {\n\n fn visit(\n\n &mut self,\n\n name: &str,\n\n visitor: &mut Visitor,\n\n ) -> VisitResult {\n\n #impl_body\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rg3d-core-derive/src/visit/utils.rs","rank":29,"score":216400.82202492736},{"content":"pub trait MessageData: 'static + Debug + Send + Any {\n\n fn as_any(&self) -> &dyn Any;\n\n\n\n fn clone_boxed(&self) -> Box<dyn MessageData>;\n\n\n\n fn compare(&self, other: &dyn MessageData) -> bool;\n\n}\n\n\n\nimpl<T> MessageData for T\n\nwhere\n\n T: 'static + Debug + Clone + PartialEq + Send + Any,\n\n{\n\n fn as_any(&self) -> &dyn Any {\n\n self\n\n }\n\n\n\n fn clone_boxed(&self) -> Box<dyn MessageData> {\n\n Box::new(self.clone())\n\n }\n\n\n","file_path":"rg3d-ui/src/message.rs","rank":30,"score":216397.90318317086},{"content":"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text =\n\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_bar =\n\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ctx);\n\n progress_bar\n\n })\n\n .with_child({\n\n progress_text = TextBuilder::new(\n","file_path":"examples/async.rs","rank":31,"score":214712.43357483557},{"content":"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let cancel;\n\n let progress_grid;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text =\n\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_grid = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_visibility(!Path::new(LIGHTMAP_SCENE_PATH).exists())\n\n .on_column(1)\n","file_path":"examples/lightmap.rs","rank":32,"score":214712.43357483557},{"content":"/// Creates `impl Inspect` block\n\npub fn create_impl<'f>(\n\n ty_args: &args::TypeArgs,\n\n field_args: impl Iterator<Item = &'f args::FieldArgs>,\n\n impl_body: TokenStream2,\n\n) -> TokenStream2 {\n\n let ty_ident = &ty_args.ident;\n\n let generics = self::create_impl_generics(&ty_args.generics, field_args);\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n\n\n quote! {\n\n impl #impl_generics Inspect for #ty_ident #ty_generics #where_clause {\n\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\n\n #impl_body\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rg3d-core-derive/src/inspect/utils.rs","rank":33,"score":212647.2706675348},{"content":"/// Saves given `data` and overwrites `data_default` with the saved data.\n\n///\n\n/// Test the equality after running this method!\n\npub fn save_load<T: Visit>(test_name: &str, data: &mut T, data_default: &mut T) {\n\n // Locate output path\n\n let (bin, txt) = {\n\n let manifest_dir = env::var(\"CARGO_MANIFEST_DIR\").unwrap();\n\n let root = PathBuf::from(manifest_dir).join(\"test_output\");\n\n (\n\n root.join(format!(\"{}.bin\", test_name)),\n\n root.join(format!(\"{}.txt\", test_name)),\n\n )\n\n };\n\n\n\n // Save `data`\n\n {\n\n let mut visitor = Visitor::new();\n\n data.visit(\"Data\", &mut visitor).unwrap();\n\n\n\n visitor.save_binary(&bin).unwrap();\n\n let mut file = File::create(&txt).unwrap();\n\n file.write(visitor.save_text().as_bytes()).unwrap();\n\n }\n","file_path":"rg3d-core-derive/tests/it/visit.rs","rank":34,"score":211444.64041085192},{"content":"fn close_menu_chain(from: Handle<UiNode>, ui: &UserInterface) {\n\n let mut handle = from;\n\n while handle.is_some() {\n\n if let Some((popup_handle, popup)) = ui.try_borrow_by_type_up::<Popup>(handle) {\n\n ui.send_message(PopupMessage::close(\n\n popup_handle,\n\n MessageDirection::ToWidget,\n\n ));\n\n\n\n // Continue search from parent menu item of popup.\n\n handle = popup\n\n .user_data_ref::<Handle<UiNode>>()\n\n .cloned()\n\n .unwrap_or_default();\n\n }\n\n }\n\n}\n\n\n\nimpl Control for MenuItem {\n\n fn as_any(&self) -> &dyn Any {\n","file_path":"rg3d-ui/src/menu.rs","rank":35,"score":210972.52481882364},{"content":"fn create_ui(engine: &mut Engine) -> Interface {\n\n let ctx = &mut engine.user_interface.build_ctx();\n\n\n\n let debug_text = TextBuilder::new(WidgetBuilder::new()).build(ctx);\n\n\n\n let definition_container = Arc::new(PropertyEditorDefinitionContainer::new());\n\n\n\n let inspector;\n\n WindowBuilder::new(WidgetBuilder::new().with_width(400.0))\n\n .with_title(WindowTitle::text(\"Inspector\"))\n\n .with_content({\n\n inspector = InspectorBuilder::new(\n\n WidgetBuilder::new().with_desired_position(Vector2::new(200.0, 200.0)),\n\n )\n\n .with_property_editor_definitions(definition_container.clone())\n\n .build(ctx);\n\n inspector\n\n })\n\n .build(ctx);\n\n\n\n Interface {\n\n debug_text,\n\n inspector,\n\n definition_container,\n\n }\n\n}\n\n\n","file_path":"examples/inspector.rs","rank":36,"score":208702.42246844436},{"content":"///\n\n/// Triangulates specified polygon.\n\n///\n\npub fn triangulate(vertices: &[Vector3<f32>], out_triangles: &mut Vec<[usize; 3]>) {\n\n out_triangles.clear();\n\n if vertices.len() == 3 {\n\n // Triangulating a triangle?\n\n out_triangles.push([0, 1, 2]);\n\n } else if vertices.len() == 4 {\n\n // Special case for quadrilaterals (much faster than generic)\n\n let mut start_vertex = 0;\n\n for i in 0..4 {\n\n let v = vertices[i];\n\n let v0 = vertices[(i + 3) % 4];\n\n if let Some(left) = (v0 - v).try_normalize(f32::EPSILON) {\n\n let v1 = vertices[(i + 2) % 4];\n\n if let Some(diag) = (v1 - v).try_normalize(f32::EPSILON) {\n\n let v2 = vertices[(i + 1) % 4];\n\n if let Some(right) = (v2 - v).try_normalize(f32::EPSILON) {\n\n // Check for concave vertex\n\n let angle = left.dot(&diag).acos() + right.dot(&diag).acos();\n\n if angle > std::f32::consts::PI {\n\n start_vertex = i;\n","file_path":"rg3d-core/src/math/triangulator.rs","rank":37,"score":206259.8254078256},{"content":"pub fn read_ascii<R>(reader: &mut R) -> Result<FbxDocument, FbxError>\n\nwhere\n\n R: Read + Seek,\n\n{\n\n let mut nodes: Pool<FbxNode> = Pool::new();\n\n let root_handle = nodes.spawn(FbxNode {\n\n name: String::from(\"__ROOT__\"),\n\n children: Vec::new(),\n\n parent: Handle::NONE,\n\n attributes: Vec::new(),\n\n });\n\n let mut parent_handle: Handle<FbxNode> = root_handle;\n\n let mut node_handle: Handle<FbxNode> = Handle::NONE;\n\n let mut buffer: Vec<u8> = Vec::new();\n\n let mut name: Vec<u8> = Vec::new();\n\n let mut value: Vec<u8> = Vec::new();\n\n\n\n let buf_len = reader.seek(SeekFrom::End(0))?;\n\n reader.seek(SeekFrom::Start(0))?;\n\n\n","file_path":"src/resource/fbx/document/ascii.rs","rank":38,"score":202034.74186644307},{"content":"pub fn read_binary<R>(file: &mut R) -> Result<FbxDocument, FbxError>\n\nwhere\n\n R: Read + Seek,\n\n{\n\n let total_length = file.seek(SeekFrom::End(0))?;\n\n file.seek(SeekFrom::Start(0))?;\n\n\n\n // Ignore all stuff until version.\n\n let mut temp = [0; 23];\n\n file.read_exact(&mut temp)?;\n\n\n\n // Verify version.\n\n let version = file.read_u32::<LittleEndian>()? as i32;\n\n\n\n // Anything else should be supported.\n\n if version < 7100 {\n\n return Err(FbxError::UnsupportedVersion(version));\n\n }\n\n\n\n let mut nodes = Pool::new();\n","file_path":"src/resource/fbx/document/binary.rs","rank":39,"score":202034.74186644307},{"content":"fn find_tree<P: AsRef<Path>>(node: Handle<UiNode>, path: &P, ui: &UserInterface) -> Handle<UiNode> {\n\n let mut tree_handle = Handle::NONE;\n\n let node_ref = ui.node(node);\n\n\n\n if let Some(tree) = node_ref.cast::<Tree>() {\n\n let tree_path = tree.user_data_ref::<PathBuf>().unwrap();\n\n if tree_path == path.as_ref() {\n\n tree_handle = node;\n\n } else {\n\n for &item in tree.items() {\n\n let tree = find_tree(item, path, ui);\n\n if tree.is_some() {\n\n tree_handle = tree;\n\n break;\n\n }\n\n }\n\n }\n\n } else if let Some(root) = node_ref.cast::<TreeRoot>() {\n\n for &item in root.items() {\n\n let tree = find_tree(item, path, ui);\n","file_path":"rg3d-ui/src/file_browser.rs","rank":40,"score":196949.17078315833},{"content":"// impl `#[derive(Visit)]` for `struct` or `enum`\n\npub fn impl_visit(ast: DeriveInput) -> TokenStream2 {\n\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\n\n match &ty_args.data {\n\n ast::Data::Struct(ref field_args) => self::impl_visit_struct(&ty_args, field_args),\n\n ast::Data::Enum(ref variants) => self::impl_visit_enum(&ty_args, variants),\n\n }\n\n}\n\n\n","file_path":"rg3d-core-derive/src/visit.rs","rank":41,"score":194775.25412308643},{"content":"pub fn impl_inspect(ast: DeriveInput) -> TokenStream2 {\n\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\n\n match &ty_args.data {\n\n ast::Data::Struct(ref field_args) => self::impl_inspect_struct(&ty_args, field_args),\n\n ast::Data::Enum(ref variant_args) => self::impl_inspect_enum(&ty_args, variant_args),\n\n }\n\n}\n\n\n","file_path":"rg3d-core-derive/src/inspect.rs","rank":42,"score":194763.1158449663},{"content":"fn remap_handles(old_new_mapping: &HashMap<Handle<Node>, Handle<Node>>, dest_graph: &mut Graph) {\n\n // Iterate over instantiated nodes and remap handles.\n\n for (_, &new_node_handle) in old_new_mapping.iter() {\n\n let new_node = &mut dest_graph.pool[new_node_handle];\n\n\n\n if let Node::Mesh(mesh) = new_node {\n\n for surface in mesh.surfaces_mut() {\n\n for bone_handle in surface.bones.iter_mut() {\n\n if let Some(entry) = old_new_mapping.get(bone_handle) {\n\n *bone_handle = *entry;\n\n }\n\n }\n\n }\n\n }\n\n\n\n // LODs also have handles that must be remapped too.\n\n if let Some(lod_group) = new_node.lod_group_mut() {\n\n for level in lod_group.levels.iter_mut() {\n\n level.objects.retain_mut(|object| {\n\n if let Some(entry) = old_new_mapping.get(object) {\n","file_path":"src/scene/graph.rs","rank":43,"score":192977.04034903913},{"content":"fn is_node_enabled(nodes: &Pool<UiNode>, handle: Handle<UiNode>) -> bool {\n\n let root_node = &nodes[handle];\n\n let mut enabled = root_node.enabled();\n\n let mut parent = root_node.parent();\n\n while parent.is_some() {\n\n let node = &nodes[parent];\n\n if !node.enabled() {\n\n enabled = false;\n\n break;\n\n }\n\n parent = node.parent();\n\n }\n\n enabled\n\n}\n\n\n\nimpl UserInterface {\n\n pub fn new(screen_size: Vector2<f32>) -> UserInterface {\n\n let (sender, receiver) = mpsc::channel();\n\n let mut ui = UserInterface {\n\n screen_size,\n","file_path":"rg3d-ui/src/lib.rs","rank":44,"score":186837.06201786152},{"content":"fn filtered_out(filter: &mut Option<Filter>, path: &Path) -> bool {\n\n match filter.as_mut() {\n\n Some(filter) => !filter.0.borrow_mut().deref_mut().lock().unwrap()(path),\n\n None => false,\n\n }\n\n}\n\n\n","file_path":"rg3d-ui/src/file_browser.rs","rank":45,"score":186541.3998544055},{"content":"/// impl `Visit` for `struct`\n\nfn impl_visit_struct(\n\n ty_args: &args::TypeArgs,\n\n field_args: &ast::Fields<args::FieldArgs>,\n\n) -> TokenStream2 {\n\n let visit_fn_body = if field_args.style == ast::Style::Unit {\n\n quote! { Ok(()) }\n\n } else {\n\n // `field.visit(..);` parts\n\n let field_visits =\n\n utils::create_field_visits(None, field_args.fields.iter(), field_args.style);\n\n\n\n quote! {\n\n visitor.enter_region(name)?;\n\n #(self.#field_visits)*\n\n visitor.leave_region()\n\n }\n\n };\n\n\n\n utils::create_impl(ty_args, field_args.iter().cloned(), visit_fn_body)\n\n}\n\n\n","file_path":"rg3d-core-derive/src/visit.rs","rank":46,"score":185228.15251396626},{"content":"fn impl_inspect_struct(\n\n ty_args: &args::TypeArgs,\n\n field_args: &ast::Fields<args::FieldArgs>,\n\n) -> TokenStream2 {\n\n let body = utils::gen_inspect_fn_body(ty_args, utils::FieldPrefix::Self_, field_args);\n\n utils::create_impl(ty_args, field_args.iter(), body)\n\n}\n\n\n","file_path":"rg3d-core-derive/src/inspect.rs","rank":47,"score":185215.84985526773},{"content":"fn check<S: Into<String>>(code: i32, message: S) -> Result<(), SoundError> {\n\n if code == DS_OK {\n\n Ok(())\n\n } else {\n\n Err(SoundError::FailedToInitializeDevice(message.into()))\n\n }\n\n}\n\n\n\nimpl DirectSoundDevice {\n\n pub fn new<F: FnMut(&mut [(f32, f32)]) + Send + 'static>(\n\n buffer_len_bytes: u32,\n\n callback: F,\n\n ) -> Result<Self, SoundError> {\n\n unsafe {\n\n let mut direct_sound = std::ptr::null_mut();\n\n check(\n\n DirectSoundCreate(std::ptr::null(), &mut direct_sound, std::ptr::null_mut()),\n\n \"Failed to initialize DirectSound\",\n\n )?;\n\n\n","file_path":"rg3d-sound/src/device/dsound.rs","rank":48,"score":179337.45961225897},{"content":"#[inline]\n\npub fn type_name_of<T>(_: T) -> &'static str {\n\n std::any::type_name::<T>()\n\n}\n\n\n\n#[cfg(feature = \"enable_profiler\")]\n\n#[macro_export]\n\nmacro_rules! scope_profile {\n\n () => {\n\n let function_name = {\n\n fn scope() {}\n\n $crate::profiler::type_name_of(scope)\n\n };\n\n let _scope_guard = $crate::profiler::ScopeDefinition::new(function_name, line!());\n\n };\n\n}\n\n\n\n#[cfg(not(feature = \"enable_profiler\"))]\n\n#[macro_export]\n\nmacro_rules! scope_profile {\n\n () => {};\n","file_path":"rg3d-core/src/profiler.rs","rank":49,"score":177239.4811744279},{"content":"pub fn gen_inspect_fn_body(\n\n ty_args: &args::TypeArgs,\n\n field_prefix: FieldPrefix,\n\n field_args: &ast::Fields<args::FieldArgs>,\n\n) -> TokenStream2 {\n\n let owner_name = ty_args.ident.to_string();\n\n\n\n // `inspect` function body, consisting of a sequence of quotes\n\n let mut quotes = Vec::new();\n\n\n\n // collect non-expanible field properties\n\n let props = field_args\n\n .fields\n\n .iter()\n\n .enumerate()\n\n .filter(|(_i, f)| !f.skip && !(f.expand || f.expand_subtree))\n\n .map(|(i, field)| {\n\n self::quote_field_prop(&owner_name, field_prefix, i, field, field_args.style)\n\n });\n\n\n","file_path":"rg3d-core-derive/src/inspect/utils.rs","rank":50,"score":176075.75139421714},{"content":"#[inline]\n\npub fn set_once() {\n\n use std::sync::Once;\n\n static SET_HOOK: Once = Once::new();\n\n SET_HOOK.call_once(|| {\n\n panic::set_hook(Box::new(hook));\n\n });\n\n}\n\n\n","file_path":"examples/wasm/src/lib.rs","rank":51,"score":173681.14124279135},{"content":"/// Generates UV map for given surface data.\n\n///\n\n/// # Performance\n\n///\n\n/// This method utilizes lots of \"brute force\" algorithms, so it is not fast as it\n\n/// could be in ideal case. It also allocates some memory for internal needs.\n\npub fn generate_uvs(\n\n data: &mut SurfaceData,\n\n spacing: f32,\n\n) -> Result<SurfaceDataPatch, VertexFetchError> {\n\n let uv_box = generate_uv_box(data);\n\n\n\n let data_id = data.content_hash();\n\n let mut vertex_buffer_mut = data.vertex_buffer.modify();\n\n let mut geometry_buffer_mut = data.geometry_buffer.modify();\n\n let (mut meshes, mut patch) = generate_uv_meshes(\n\n &uv_box,\n\n data_id,\n\n &mut vertex_buffer_mut,\n\n &mut geometry_buffer_mut,\n\n );\n\n drop(geometry_buffer_mut);\n\n\n\n // Step 4. Arrange and scale all meshes on uv map so it fits into [0;1] range.\n\n let area = meshes.iter().fold(0.0, |area, mesh| area + mesh.area());\n\n let square_side = area.sqrt() + spacing * meshes.len() as f32;\n","file_path":"src/utils/uvgen.rs","rank":52,"score":173681.14124279135},{"content":"/// \"Transmutes\" array of any sized type to a slice of bytes.\n\npub fn array_as_u8_slice<T: Sized>(v: &[T]) -> &'_ [u8] {\n\n // SAFETY: It is safe to reinterpret data to read it.\n\n unsafe {\n\n std::slice::from_raw_parts(v.as_ptr() as *const u8, std::mem::size_of::<T>() * v.len())\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":53,"score":173679.02590266563},{"content":"#[wasm_bindgen]\n\npub fn main_js() {\n\n set_once();\n\n\n\n let event_loop = EventLoop::new();\n\n\n\n let window_builder = rg3d::window::WindowBuilder::new()\n\n .with_inner_size(LogicalSize::new(800, 600))\n\n .with_title(\"Example - WASM\")\n\n .with_resizable(true);\n\n\n\n let mut engine = Engine::new(window_builder, &event_loop, true).unwrap();\n\n engine\n\n .renderer\n\n .set_backbuffer_clear_color(Color::opaque(150, 150, 255));\n\n\n\n // Configure resource manager.\n\n engine.resource_manager.state().set_textures_import_options(\n\n TextureImportOptions::default().with_compression(CompressionOptions::NoCompression),\n\n );\n\n\n","file_path":"examples/wasm/src/lib.rs","rank":54,"score":171374.84568967548},{"content":"/// Generates UVs for a specified mesh.\n\npub fn generate_uvs_mesh(\n\n mesh: &Mesh,\n\n spacing: f32,\n\n) -> Result<Vec<SurfaceDataPatch>, VertexFetchError> {\n\n let last = instant::Instant::now();\n\n\n\n let data_set = mesh.surfaces().iter().map(|s| s.data()).collect::<Vec<_>>();\n\n\n\n let patches = data_set\n\n .into_par_iter()\n\n .map(|data| generate_uvs(&mut data.write().unwrap(), spacing))\n\n .collect::<Result<Vec<SurfaceDataPatch>, VertexFetchError>>()?;\n\n\n\n println!(\"Generate UVs: {:?}\", instant::Instant::now() - last);\n\n\n\n Ok(patches)\n\n}\n","file_path":"src/utils/uvgen.rs","rank":55,"score":171374.84568967548},{"content":"/// Generates a set of UV meshes.\n\npub fn generate_uv_meshes(\n\n uv_box: &UvBox,\n\n data_id: u64,\n\n vertex_buffer_mut: &mut VertexBufferRefMut,\n\n geometry_buffer_mut: &mut GeometryBufferRefMut,\n\n) -> (Vec<UvMesh>, SurfaceDataPatch) {\n\n let mut mesh_patch = SurfaceDataPatch {\n\n data_id,\n\n ..Default::default()\n\n };\n\n\n\n if !vertex_buffer_mut.has_attribute(VertexAttributeUsage::TexCoord1) {\n\n vertex_buffer_mut\n\n .add_attribute(\n\n VertexAttributeDescriptor {\n\n usage: VertexAttributeUsage::TexCoord1,\n\n data_type: VertexAttributeDataType::F32,\n\n size: 2,\n\n divisor: 0,\n\n shader_location: 6, // HACK: GBuffer renderer expects it to be at 6\n","file_path":"src/utils/uvgen.rs","rank":56,"score":171374.84568967548},{"content":"pub fn barycentric_to_world(\n\n bary: (f32, f32, f32),\n\n pa: Vector3<f32>,\n\n pb: Vector3<f32>,\n\n pc: Vector3<f32>,\n\n) -> Vector3<f32> {\n\n pa.scale(bary.0) + pb.scale(bary.1) + pc.scale(bary.2)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":57,"score":169167.8167583457},{"content":"pub fn vec3_to_vec2_by_plane(\n\n plane_class: PlaneClass,\n\n normal: Vector3<f32>,\n\n point: Vector3<f32>,\n\n) -> Vector2<f32> {\n\n match plane_class {\n\n PlaneClass::XY => {\n\n if normal.z < 0.0 {\n\n Vector2::new(point.y, point.x)\n\n } else {\n\n Vector2::new(point.x, point.y)\n\n }\n\n }\n\n PlaneClass::XZ => {\n\n if normal.y < 0.0 {\n\n Vector2::new(point.x, point.z)\n\n } else {\n\n Vector2::new(point.z, point.x)\n\n }\n\n }\n\n PlaneClass::YZ => {\n\n if normal.x < 0.0 {\n\n Vector2::new(point.z, point.y)\n\n } else {\n\n Vector2::new(point.y, point.z)\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":58,"score":167053.78057800437},{"content":"pub fn ray_rect_intersection(\n\n rect: Rect<f32>,\n\n origin: Vector2<f32>,\n\n dir: Vector2<f32>,\n\n) -> Option<IntersectionResult> {\n\n let min = rect.left_top_corner();\n\n let max = rect.right_bottom_corner();\n\n\n\n let (mut tmin, mut tmax) = if dir.x >= 0.0 {\n\n ((min.x - origin.x) / dir.x, (max.x - origin.x) / dir.x)\n\n } else {\n\n ((max.x - origin.x) / dir.x, (min.x - origin.x) / dir.x)\n\n };\n\n\n\n let (tymin, tymax) = if dir.y >= 0.0 {\n\n ((min.y - origin.y) / dir.y, (max.y - origin.y) / dir.y)\n\n } else {\n\n ((max.y - origin.y) / dir.y, (min.y - origin.y) / dir.y)\n\n };\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":59,"score":167053.78057800437},{"content":"pub fn is_point_inside_2d_triangle(\n\n point: Vector2<f32>,\n\n pt_a: Vector2<f32>,\n\n pt_b: Vector2<f32>,\n\n pt_c: Vector2<f32>,\n\n) -> bool {\n\n let ba = pt_b - pt_a;\n\n let ca = pt_c - pt_a;\n\n\n\n let vp = point - pt_a;\n\n\n\n let ba_dot_ba = ba.dot(&ba);\n\n let ca_dot_ba = ca.dot(&ba);\n\n let ca_dot_ca = ca.dot(&ca);\n\n\n\n let dot_02 = ca.dot(&vp);\n\n let dot_12 = ba.dot(&vp);\n\n\n\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\n\n\n\n // calculate barycentric coordinates\n\n let u = (ba_dot_ba * dot_02 - ca_dot_ba * dot_12) * inv_denom;\n\n let v = (ca_dot_ca * dot_12 - ca_dot_ba * dot_02) * inv_denom;\n\n\n\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":60,"score":167053.78057800437},{"content":"pub fn get_barycentric_coords_2d(\n\n p: Vector2<f32>,\n\n a: Vector2<f32>,\n\n b: Vector2<f32>,\n\n c: Vector2<f32>,\n\n) -> (f32, f32, f32) {\n\n let v0 = b - a;\n\n let v1 = c - a;\n\n let v2 = p - a;\n\n\n\n let d00 = v0.dot(&v0);\n\n let d01 = v0.dot(&v1);\n\n let d11 = v1.dot(&v1);\n\n let d20 = v2.dot(&v0);\n\n let d21 = v2.dot(&v1);\n\n let inv_denom = 1.0 / (d00 * d11 - d01.powi(2));\n\n\n\n let v = (d11 * d20 - d01 * d21) * inv_denom;\n\n let w = (d00 * d21 - d01 * d20) * inv_denom;\n\n let u = 1.0 - v - w;\n\n\n\n (u, v, w)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":61,"score":167053.78057800437},{"content":"pub fn get_barycentric_coords(\n\n p: &Vector3<f32>,\n\n a: &Vector3<f32>,\n\n b: &Vector3<f32>,\n\n c: &Vector3<f32>,\n\n) -> (f32, f32, f32) {\n\n let v0 = *b - *a;\n\n let v1 = *c - *a;\n\n let v2 = *p - *a;\n\n\n\n let d00 = v0.dot(&v0);\n\n let d01 = v0.dot(&v1);\n\n let d11 = v1.dot(&v1);\n\n let d20 = v2.dot(&v0);\n\n let d21 = v2.dot(&v1);\n\n let denom = d00 * d11 - d01.powi(2);\n\n\n\n let v = (d11 * d20 - d01 * d21) / denom;\n\n let w = (d00 * d21 - d01 * d20) / denom;\n\n let u = 1.0 - v - w;\n\n\n\n (u, v, w)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":62,"score":167053.78057800437},{"content":"fn save(game: &mut Game) {\n\n // To save a game state all we need to do is to create new instance of Visitor\n\n // and call visit on game instance.\n\n let mut visitor = Visitor::new();\n\n game.visit(\"Game\", &mut visitor).unwrap();\n\n // And call save method.\n\n visitor.save_binary(Path::new(SAVE_FILE)).unwrap();\n\n}\n\n\n","file_path":"examples/save_load.rs","rank":63,"score":165459.9027394224},{"content":"fn get_line_thickness_vector(a: Vector2<f32>, b: Vector2<f32>, thickness: f32) -> Vector2<f32> {\n\n if let Some(dir) = (b - a).try_normalize(f32::EPSILON) {\n\n Vector2::new(dir.y, -dir.x).scale(thickness * 0.5)\n\n } else {\n\n Vector2::default()\n\n }\n\n}\n\n\n\nimpl Default for DrawingContext {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl Draw for DrawingContext {\n\n #[inline(always)]\n\n fn push_vertex(&mut self, pos: Vector2<f32>, tex_coord: Vector2<f32>) {\n\n self.vertex_buffer.push(Vertex::new(pos, tex_coord));\n\n }\n\n\n","file_path":"rg3d-ui/src/draw.rs","rank":64,"score":162276.42803941114},{"content":"fn line_thickness_vector(a: Vector2<f32>, b: Vector2<f32>, thickness: f32) -> Vector2<f32> {\n\n if let Some(dir) = (b - a).try_normalize(f32::EPSILON) {\n\n Vector2::new(dir.y, -dir.x).scale(thickness * 0.5)\n\n } else {\n\n Vector2::default()\n\n }\n\n}\n\n\n\nimpl Primitive {\n\n pub fn bounds(&self) -> (Vector2<f32>, Vector2<f32>) {\n\n match self {\n\n Primitive::Triangle { points } => {\n\n let min = points[0]\n\n .per_component_min(&points[1])\n\n .per_component_min(&points[2]);\n\n let max = points[0]\n\n .per_component_max(&points[1])\n\n .per_component_max(&points[2]);\n\n (min, max)\n\n }\n","file_path":"rg3d-ui/src/vector_image.rs","rank":65,"score":162276.42803941114},{"content":"/// `<prefix>field.visit(\"name\", visitor);`\n\npub fn create_field_visits<'a>(\n\n // None or `f` when bindings tuple variants. NOTE: We can't use `prefix: Ident`\n\n prefix: Option<Ident>,\n\n fields: impl Iterator<Item = &'a args::FieldArgs>,\n\n field_style: ast::Style,\n\n) -> Vec<TokenStream2> {\n\n if field_style == ast::Style::Unit {\n\n // `Unit` (struct/enum variant) has no field to visit.\n\n // We won't even enter this region:\n\n return vec![];\n\n }\n\n\n\n let visit_args = fields\n\n .filter(|field| !field.skip)\n\n .enumerate()\n\n .map(|(field_index, field)| {\n\n let (ident, name) = match field_style {\n\n // `NamedFields { a: f32, .. }`\n\n ast::Style::Struct => {\n\n let ident = field.ident.as_ref().unwrap_or_else(|| unreachable!());\n","file_path":"rg3d-core-derive/src/visit/utils.rs","rank":66,"score":161267.41162279714},{"content":"fn sort_keys(keys: &mut [CurveKey]) {\n\n keys.sort_by(|a, b| {\n\n if a.location > b.location {\n\n Ordering::Greater\n\n } else if a.location < b.location {\n\n Ordering::Less\n\n } else {\n\n Ordering::Equal\n\n }\n\n });\n\n}\n\n\n\nimpl From<Vec<CurveKey>> for Curve {\n\n fn from(mut keys: Vec<CurveKey>) -> Self {\n\n sort_keys(&mut keys);\n\n Self { keys }\n\n }\n\n}\n\n\n\nimpl Curve {\n","file_path":"rg3d-core/src/curve.rs","rank":67,"score":159106.17756997977},{"content":"#[allow(clippy::manual_map)]\n\npub fn into_any_arc<T: Any + Send + Sync>(\n\n opt: Option<Arc<T>>,\n\n) -> Option<Arc<dyn Any + Send + Sync>> {\n\n match opt {\n\n Some(r) => Some(r),\n\n None => None,\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":68,"score":156247.04037803682},{"content":"/// A panic hook for use with\n\n/// [`std::panic::set_hook`](https://doc.rust-lang.org/nightly/std/panic/fn.set_hook.html)\n\n/// that logs panics into\n\n/// [`console.error`](https://developer.mozilla.org/en-US/docs/Web/API/Console/error).\n\n///\n\n/// On non-wasm targets, prints the panic to `stderr`.\n\npub fn hook(info: &panic::PanicInfo) {\n\n hook_impl(info);\n\n}\n\n\n\n/// Set the `console.error` panic hook the first time this is called. Subsequent\n\n/// invocations do nothing.\n","file_path":"examples/wasm/src/lib.rs","rank":69,"score":154869.0020908082},{"content":"#[inline]\n\nfn read_samples(buffer: &mut Vec<f32>, decoder: &mut Decoder, count: usize) -> usize {\n\n buffer.clear();\n\n for _ in 0..count {\n\n if let Some(sample) = decoder.next() {\n\n buffer.push(sample)\n\n } else {\n\n break;\n\n }\n\n }\n\n buffer.len()\n\n}\n\n\n\nimpl StreamingBuffer {\n\n /// Defines amount of samples `per channel` which each streaming buffer will use for internal buffer.\n\n pub const STREAM_SAMPLE_COUNT: usize = 44100;\n\n\n\n /// Creates new streaming buffer using given data source. May fail if data source has unsupported format\n\n /// or it has corrupted data. Length of internal generic buffer cannot be changed but can be fetched from\n\n /// `StreamingBuffer::STREAM_SAMPLE_COUNT`\n\n ///\n","file_path":"rg3d-sound/src/buffer/streaming.rs","rank":70,"score":154235.77152587552},{"content":"struct UiShader {\n\n program: GpuProgram,\n\n wvp_matrix: UniformLocation,\n\n diffuse_texture: UniformLocation,\n\n is_font: UniformLocation,\n\n solid_color: UniformLocation,\n\n brush_type: UniformLocation,\n\n gradient_point_count: UniformLocation,\n\n gradient_colors: UniformLocation,\n\n gradient_stops: UniformLocation,\n\n gradient_origin: UniformLocation,\n\n gradient_end: UniformLocation,\n\n resolution: UniformLocation,\n\n bounds_min: UniformLocation,\n\n bounds_max: UniformLocation,\n\n opacity: UniformLocation,\n\n}\n\n\n\nimpl UiShader {\n\n pub fn new(state: &mut PipelineState) -> Result<Self, FrameworkError> {\n","file_path":"src/renderer/ui_renderer.rs","rank":71,"score":153465.49497188925},{"content":"/// Translates library button state into rg3d-ui button state.\n\npub fn translate_state(state: ElementState) -> ButtonState {\n\n match state {\n\n ElementState::Pressed => ButtonState::Pressed,\n\n ElementState::Released => ButtonState::Released,\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":72,"score":152920.20896939392},{"content":"pub fn wrap_angle(angle: f32) -> f32 {\n\n let two_pi = 2.0 * std::f32::consts::PI;\n\n\n\n if angle > 0.0 {\n\n angle % two_pi\n\n } else {\n\n (angle + two_pi) % two_pi\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":73,"score":152914.310543774},{"content":"pub fn get_closest_point_triangles<P: PositionProvider>(\n\n points: &[P],\n\n triangles: &[TriangleDefinition],\n\n triangle_indices: &[u32],\n\n point: Vector3<f32>,\n\n) -> Option<usize> {\n\n let mut closest_sqr_distance = f32::MAX;\n\n let mut closest_index = None;\n\n for triangle_index in triangle_indices {\n\n let triangle = triangles.get(*triangle_index as usize).unwrap();\n\n for point_index in triangle.0.iter() {\n\n let vertex = points.get(*point_index as usize).unwrap();\n\n let sqr_distance = (vertex.position() - point).norm_squared();\n\n if sqr_distance < closest_sqr_distance {\n\n closest_sqr_distance = sqr_distance;\n\n closest_index = Some(*point_index as usize);\n\n }\n\n }\n\n }\n\n closest_index\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":74,"score":152289.49110062158},{"content":"fn is_vorbis_ogg(source: &mut DataSource) -> bool {\n\n let pos = source.seek(SeekFrom::Current(0)).unwrap();\n\n\n\n let is_vorbis = OggStreamReader::new(source.by_ref()).is_ok();\n\n\n\n source.seek(SeekFrom::Start(pos)).unwrap();\n\n\n\n is_vorbis\n\n}\n\n\n\nimpl OggDecoder {\n\n pub fn new(mut source: DataSource) -> Result<Self, DataSource> {\n\n if is_vorbis_ogg(&mut source) {\n\n let mut reader = OggStreamReader::new(source).unwrap();\n\n\n\n let samples = if let Ok(Some(samples)) =\n\n reader.read_dec_packet_generic::<InterleavedSamples<f32>>()\n\n {\n\n samples.samples.into_iter()\n\n } else {\n","file_path":"rg3d-sound/src/decoder/vorbis.rs","rank":75,"score":152196.71064271044},{"content":"/// Converts engine's optional texture \"pointer\" to rg3d-ui's.\n\npub fn into_gui_texture(this: Texture) -> draw::SharedTexture {\n\n draw::SharedTexture(this.0.into_inner())\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":76,"score":152112.14199745393},{"content":"pub fn print() -> Result<String, fmt::Error> {\n\n #[cfg(feature = \"enable_profiler\")]\n\n {\n\n let mut buffer = String::new();\n\n PROFILER.lock().unwrap().print(&mut buffer)?;\n\n Ok(buffer)\n\n }\n\n\n\n #[cfg(not(feature = \"enable_profiler\"))]\n\n {\n\n Ok(\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\".to_owned())\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":77,"score":152106.20468583255},{"content":"struct InputController {\n\n move_forward: bool,\n\n move_backward: bool,\n\n move_left: bool,\n\n move_right: bool,\n\n}\n\n\n","file_path":"examples/2d.rs","rank":78,"score":151528.055579047},{"content":"/// Translates keyboard modifiers to rg3d-ui keyboard modifiers.\n\npub fn translate_keyboard_modifiers(modifiers: ModifiersState) -> KeyboardModifiers {\n\n KeyboardModifiers {\n\n alt: modifiers.alt(),\n\n shift: modifiers.shift(),\n\n control: modifiers.ctrl(),\n\n system: modifiers.logo(),\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":79,"score":151052.46912313515},{"content":"/// Translated key code to rg3d-ui key code.\n\npub fn translate_key(key: VirtualKeyCode) -> KeyCode {\n\n match key {\n\n VirtualKeyCode::Key1 => KeyCode::Key1,\n\n VirtualKeyCode::Key2 => KeyCode::Key2,\n\n VirtualKeyCode::Key3 => KeyCode::Key3,\n\n VirtualKeyCode::Key4 => KeyCode::Key4,\n\n VirtualKeyCode::Key5 => KeyCode::Key5,\n\n VirtualKeyCode::Key6 => KeyCode::Key6,\n\n VirtualKeyCode::Key7 => KeyCode::Key7,\n\n VirtualKeyCode::Key8 => KeyCode::Key8,\n\n VirtualKeyCode::Key9 => KeyCode::Key9,\n\n VirtualKeyCode::Key0 => KeyCode::Key0,\n\n VirtualKeyCode::A => KeyCode::A,\n\n VirtualKeyCode::B => KeyCode::B,\n\n VirtualKeyCode::C => KeyCode::C,\n\n VirtualKeyCode::D => KeyCode::D,\n\n VirtualKeyCode::E => KeyCode::E,\n\n VirtualKeyCode::F => KeyCode::F,\n\n VirtualKeyCode::G => KeyCode::G,\n\n VirtualKeyCode::H => KeyCode::H,\n","file_path":"src/utils/mod.rs","rank":80,"score":151052.46912313515},{"content":"#[proc_macro_derive(Inspect, attributes(inspect))]\n\npub fn inspect(input: TokenStream) -> TokenStream {\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n TokenStream::from(inspect::impl_inspect(ast))\n\n}\n","file_path":"rg3d-core-derive/src/lib.rs","rank":81,"score":151046.53181151376},{"content":"pub fn make_vec3_container<P: AsRef<str>>(\n\n nodes: &FbxNodeContainer,\n\n container_node: Handle<FbxNode>,\n\n data_name: P,\n\n) -> Result<FbxContainer<Vector3<f32>>, FbxError> {\n\n FbxContainer::new(nodes, container_node, data_name, |attributes| {\n\n let mut normals = Vec::with_capacity(attributes.len() / 3);\n\n for normal in attributes.chunks_exact(3) {\n\n normals.push(Vector3::new(\n\n normal[0].as_f32()?,\n\n normal[1].as_f32()?,\n\n normal[2].as_f32()?,\n\n ));\n\n }\n\n Ok(normals)\n\n })\n\n}\n","file_path":"src/resource/fbx/scene/mod.rs","rank":82,"score":151046.53181151376},{"content":"#[proc_macro_derive(Visit, attributes(visit))]\n\npub fn visit(input: TokenStream) -> TokenStream {\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n TokenStream::from(visit::impl_visit(ast))\n\n}\n\n\n\n/// Implements `Inspect` trait\n\n///\n\n/// User has to import `Inspect` and `PropertyInfo` to use this macro.\n","file_path":"rg3d-core-derive/src/lib.rs","rank":83,"score":151046.53181151376},{"content":"pub fn get_closest_point_triangle_set<P: PositionProvider>(\n\n points: &[P],\n\n triangles: &[TriangleDefinition],\n\n point: Vector3<f32>,\n\n) -> Option<usize> {\n\n let mut closest_sqr_distance = f32::MAX;\n\n let mut closest_index = None;\n\n for triangle in triangles {\n\n for point_index in triangle.0.iter() {\n\n let vertex = points.get(*point_index as usize).unwrap();\n\n let sqr_distance = (vertex.position() - point).norm_squared();\n\n if sqr_distance < closest_sqr_distance {\n\n closest_sqr_distance = sqr_distance;\n\n closest_index = Some(*point_index as usize);\n\n }\n\n }\n\n }\n\n closest_index\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":84,"score":150562.72628058388},{"content":"struct Interface {\n\n debug_text: Handle<UiNode>,\n\n yaw: Handle<UiNode>,\n\n scale: Handle<UiNode>,\n\n reset: Handle<UiNode>,\n\n video_modes: Vec<VideoMode>,\n\n resolutions: Handle<UiNode>,\n\n}\n\n\n","file_path":"examples/ui.rs","rank":85,"score":149453.58902474184},{"content":"pub fn err_code_to_string(err_code: c_int) -> String {\n\n unsafe {\n\n let message = CStr::from_ptr(snd_strerror(err_code) as *const _)\n\n .to_bytes()\n\n .to_vec();\n\n String::from_utf8(message).unwrap()\n\n }\n\n}\n\n\n","file_path":"rg3d-sound/src/device/alsa.rs","rank":86,"score":149251.33512478284},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/lightmap.rs","rank":87,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/simple.rs","rank":88,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/scene.rs","rank":89,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/navmesh.rs","rank":90,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/terrain.rs","rank":91,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/instancing.rs","rank":92,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n forward: bool,\n\n backward: bool,\n\n}\n\n\n","file_path":"examples/lod.rs","rank":93,"score":148871.55008114927},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/async.rs","rank":94,"score":148871.55008114927},{"content":"/// Translates window event to rg3d-ui event.\n\npub fn translate_event(event: &WindowEvent) -> Option<OsEvent> {\n\n match event {\n\n WindowEvent::ReceivedCharacter(c) => Some(OsEvent::Character(*c)),\n\n WindowEvent::KeyboardInput { input, .. } => {\n\n input.virtual_keycode.map(|key| OsEvent::KeyboardInput {\n\n button: translate_key(key),\n\n state: translate_state(input.state),\n\n })\n\n }\n\n WindowEvent::CursorMoved { position, .. } => Some(OsEvent::CursorMoved {\n\n position: Vector2::new(position.x as f32, position.y as f32),\n\n }),\n\n WindowEvent::MouseWheel { delta, .. } => match delta {\n\n MouseScrollDelta::LineDelta(x, y) => Some(OsEvent::MouseWheel(*x, *y)),\n\n MouseScrollDelta::PixelDelta(pos) => {\n\n Some(OsEvent::MouseWheel(pos.x as f32, pos.y as f32))\n\n }\n\n },\n\n WindowEvent::MouseInput { state, button, .. } => Some(OsEvent::MouseInput {\n\n button: translate_button(*button),\n\n state: translate_state(*state),\n\n }),\n\n &WindowEvent::ModifiersChanged(modifiers) => Some(OsEvent::KeyboardModifiers(\n\n translate_keyboard_modifiers(modifiers),\n\n )),\n\n _ => None,\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":95,"score":148299.54919264212},{"content":"pub fn print_hot_path() -> Result<String, fmt::Error> {\n\n #[cfg(feature = \"enable_profiler\")]\n\n {\n\n let mut buffer = String::new();\n\n PROFILER.lock().unwrap().print_hot_path(&mut buffer)?;\n\n Ok(buffer)\n\n }\n\n\n\n #[cfg(not(feature = \"enable_profiler\"))]\n\n {\n\n Ok(\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\".to_owned())\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":96,"score":148293.57247889644},{"content":"struct GameScene {\n\n scene: Scene,\n\n model_handle: Handle<Node>,\n\n walk_animation: Handle<Animation>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Set ambient light.\n\n scene.ambient_lighting_color = Color::opaque(200, 200, 200);\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(0.0, 6.0, -12.0),\n\n &mut scene.graph,\n\n )\n\n .await;\n\n\n","file_path":"examples/ui.rs","rank":97,"score":146845.93279365223},{"content":"fn rc_to_raw<T>(rc: &Rc<T>) -> *mut T {\n\n &**rc as *const T as *mut T\n\n}\n\n\n\nimpl<T> Visit for Arc<T>\n\nwhere\n\n T: Visit + Send + Sync + 'static,\n\n{\n\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\n\n visitor.enter_region(name)?;\n\n\n\n if visitor.reading {\n\n let mut raw = 0u64;\n\n raw.visit(\"Id\", visitor)?;\n\n if raw == 0 {\n\n return Err(VisitError::UnexpectedRcNullIndex);\n\n }\n\n if let Some(ptr) = visitor.arc_map.get(&raw) {\n\n if let Ok(res) = Arc::downcast::<T>(ptr.clone()) {\n\n *self = res;\n","file_path":"rg3d-core/src/visitor.rs","rank":98,"score":146842.15068907844},{"content":"fn arc_to_raw<T>(arc: &Arc<T>) -> *mut T {\n\n &**arc as *const T as *mut T\n\n}\n\n\n","file_path":"rg3d-core/src/visitor.rs","rank":99,"score":146842.15068907844}],"string":"[\n {\n \"content\": \"pub fn make_default_anchor(ctx: &mut BuildContext, row: usize, column: usize) -> Handle<UiNode> {\\n\\n let default_anchor_size = 30.0;\\n\\n BorderBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(default_anchor_size)\\n\\n .with_height(default_anchor_size)\\n\\n .with_visibility(false)\\n\\n .on_row(row)\\n\\n .on_column(column)\\n\\n .with_draw_on_top(true)\\n\\n .with_background(Brush::Solid(DEFAULT_ANCHOR_COLOR)),\\n\\n )\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\\nimpl TileBuilder {\\n\\n pub fn new(widget_builder: WidgetBuilder) -> Self {\\n\\n Self {\\n\\n widget_builder,\\n\\n content: TileContent::Empty,\\n\",\n \"file_path\": \"rg3d-ui/src/dock.rs\",\n \"rank\": 0,\n \"score\": 376216.7833941174\n },\n {\n \"content\": \"pub fn make_button(ctx: &mut BuildContext, arrow: ArrowDirection, row: usize) -> Handle<UiNode> {\\n\\n ButtonBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_margin(Thickness::right(1.0))\\n\\n .on_row(row),\\n\\n )\\n\\n .with_back(\\n\\n DecoratorBuilder::new(BorderBuilder::new(\\n\\n WidgetBuilder::new().with_foreground(Brush::Solid(Color::opaque(90, 90, 90))),\\n\\n ))\\n\\n .with_normal_brush(Brush::Solid(Color::opaque(60, 60, 60)))\\n\\n .with_hover_brush(Brush::Solid(Color::opaque(80, 80, 80)))\\n\\n .with_pressed_brush(Brush::Solid(Color::opaque(80, 118, 178)))\\n\\n .build(ctx),\\n\\n )\\n\\n .with_content(make_arrow(ctx, arrow, 6.0))\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\\nimpl NumericUpDownBuilder {\\n\",\n \"file_path\": \"rg3d-ui/src/numeric.rs\",\n \"rank\": 1,\n \"score\": 376216.7833941174\n },\n {\n \"content\": \"/// Trait for all UI controls in library.\\n\\npub trait Control: 'static + Deref<Target = Widget> + DerefMut {\\n\\n fn as_any(&self) -> &dyn Any;\\n\\n\\n\\n fn as_any_mut(&mut self) -> &mut dyn Any;\\n\\n\\n\\n fn clone_boxed(&self) -> Box<dyn Control>;\\n\\n\\n\\n fn resolve(&mut self, _node_map: &NodeHandleMapping) {}\\n\\n\\n\\n fn measure_override(&self, ui: &UserInterface, available_size: Vector2<f32>) -> Vector2<f32> {\\n\\n scope_profile!();\\n\\n\\n\\n self.deref().measure_override(ui, available_size)\\n\\n }\\n\\n\\n\\n fn arrange_override(&self, ui: &UserInterface, final_size: Vector2<f32>) -> Vector2<f32> {\\n\\n scope_profile!();\\n\\n\\n\\n self.deref().arrange_override(ui, final_size)\\n\\n }\\n\",\n \"file_path\": \"rg3d-ui/src/lib.rs\",\n \"rank\": 2,\n \"score\": 347255.366194612\n },\n {\n \"content\": \"pub fn make_numeric_input(ctx: &mut BuildContext, column: usize, value: f32) -> Handle<UiNode> {\\n\\n NumericUpDownBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .on_row(0)\\n\\n .on_column(column)\\n\\n .with_margin(Thickness {\\n\\n left: 1.0,\\n\\n top: 0.0,\\n\\n right: 1.0,\\n\\n bottom: 0.0,\\n\\n }),\\n\\n )\\n\\n .with_value(value)\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/vec/mod.rs\",\n \"rank\": 3,\n \"score\": 347019.0735168791\n },\n {\n \"content\": \"pub fn create_ui(ui: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text = TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0))\\n\\n .with_wrap(WrapMode::Word)\\n\\n .build(ui);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_bar =\\n\\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ui);\\n\\n progress_bar\\n\\n })\\n\\n .with_child({\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 4,\n \"score\": 316273.96678804676\n },\n {\n \"content\": \"fn make_text_mark(ctx: &mut BuildContext, text: &str, row: usize, column: usize) -> Handle<UiNode> {\\n\\n TextBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_vertical_alignment(VerticalAlignment::Center)\\n\\n .on_row(row)\\n\\n .on_column(column),\\n\\n )\\n\\n .with_text(text)\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/color.rs\",\n \"rank\": 5,\n \"score\": 304733.4592713668\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\\n\\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/lod.rs\",\n \"rank\": 6,\n \"score\": 287615.84311128437\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\\n\\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/navmesh.rs\",\n \"rank\": 7,\n \"score\": 287615.84311128437\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\\n\\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scene.rs\",\n \"rank\": 8,\n \"score\": 287615.84311128437\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\\n\\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\\n\\n}\\n\\n\\n\\n#[wasm_bindgen]\\n\\nextern \\\"C\\\" {\\n\\n #[wasm_bindgen(js_namespace = console)]\\n\\n fn error(msg: String);\\n\\n\\n\\n type Error;\\n\\n\\n\\n #[wasm_bindgen(constructor)]\\n\\n fn new() -> Error;\\n\\n\\n\\n #[wasm_bindgen(structural, method, getter)]\\n\\n fn stack(error: &Error) -> String;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/wasm/src/lib.rs\",\n \"rank\": 9,\n \"score\": 280646.12463261327\n },\n {\n \"content\": \"fn generate_item_container(ctx: &mut BuildContext, item: Handle<UiNode>) -> Handle<UiNode> {\\n\\n let item = ListViewItem {\\n\\n widget: WidgetBuilder::new().with_child(item).build(),\\n\\n };\\n\\n\\n\\n ctx.add_node(UiNode::new(item))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/list_view.rs\",\n \"rank\": 10,\n \"score\": 272466.7799684746\n },\n {\n \"content\": \"/// Translates window mouse button into rg3d-ui mouse button.\\n\\npub fn translate_button(button: crate::event::MouseButton) -> crate::gui::message::MouseButton {\\n\\n match button {\\n\\n crate::event::MouseButton::Left => crate::gui::message::MouseButton::Left,\\n\\n crate::event::MouseButton::Right => crate::gui::message::MouseButton::Right,\\n\\n crate::event::MouseButton::Middle => crate::gui::message::MouseButton::Middle,\\n\\n crate::event::MouseButton::Other(i) => crate::gui::message::MouseButton::Other(i),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 11,\n \"score\": 268776.844024753\n },\n {\n \"content\": \"/// Translates cursor icon from rg3d-ui library to glutin format.\\n\\npub fn translate_cursor_icon(icon: crate::gui::message::CursorIcon) -> crate::window::CursorIcon {\\n\\n match icon {\\n\\n crate::gui::message::CursorIcon::Default => crate::window::CursorIcon::Default,\\n\\n crate::gui::message::CursorIcon::Crosshair => crate::window::CursorIcon::Crosshair,\\n\\n crate::gui::message::CursorIcon::Hand => crate::window::CursorIcon::Hand,\\n\\n crate::gui::message::CursorIcon::Arrow => crate::window::CursorIcon::Arrow,\\n\\n crate::gui::message::CursorIcon::Move => crate::window::CursorIcon::Move,\\n\\n crate::gui::message::CursorIcon::Text => crate::window::CursorIcon::Text,\\n\\n crate::gui::message::CursorIcon::Wait => crate::window::CursorIcon::Wait,\\n\\n crate::gui::message::CursorIcon::Help => crate::window::CursorIcon::Help,\\n\\n crate::gui::message::CursorIcon::Progress => crate::window::CursorIcon::Progress,\\n\\n crate::gui::message::CursorIcon::NotAllowed => crate::window::CursorIcon::NotAllowed,\\n\\n crate::gui::message::CursorIcon::ContextMenu => crate::window::CursorIcon::ContextMenu,\\n\\n crate::gui::message::CursorIcon::Cell => crate::window::CursorIcon::Cell,\\n\\n crate::gui::message::CursorIcon::VerticalText => crate::window::CursorIcon::VerticalText,\\n\\n crate::gui::message::CursorIcon::Alias => crate::window::CursorIcon::Alias,\\n\\n crate::gui::message::CursorIcon::Copy => crate::window::CursorIcon::Copy,\\n\\n crate::gui::message::CursorIcon::NoDrop => crate::window::CursorIcon::NoDrop,\\n\\n crate::gui::message::CursorIcon::Grab => crate::window::CursorIcon::Grab,\\n\\n crate::gui::message::CursorIcon::Grabbing => crate::window::CursorIcon::Grabbing,\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 12,\n \"score\": 265779.7514632906\n },\n {\n \"content\": \"fn make_text_title(ctx: &mut BuildContext, text: &str) -> Handle<UiNode> {\\n\\n TextBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_margin(Thickness::uniform(5.0))\\n\\n .on_row(0)\\n\\n .on_column(0),\\n\\n )\\n\\n .with_text(text)\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/window.rs\",\n \"rank\": 13,\n \"score\": 263554.01949377905\n },\n {\n \"content\": \"fn make_mark(ctx: &mut BuildContext, button: HeaderButton) -> Handle<UiNode> {\\n\\n VectorImageBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_horizontal_alignment(HorizontalAlignment::Center)\\n\\n .with_vertical_alignment(match button {\\n\\n HeaderButton::Close => VerticalAlignment::Center,\\n\\n HeaderButton::Minimize => VerticalAlignment::Bottom,\\n\\n })\\n\\n .with_margin(match button {\\n\\n HeaderButton::Close => Thickness::uniform(0.0),\\n\\n HeaderButton::Minimize => Thickness::bottom(3.0),\\n\\n })\\n\\n .with_foreground(BRUSH_BRIGHT),\\n\\n )\\n\\n .with_primitives(match button {\\n\\n HeaderButton::Close => {\\n\\n vec![\\n\\n Primitive::Line {\\n\\n begin: Vector2::new(0.0, 0.0),\\n\\n end: Vector2::new(12.0, 12.0),\\n\",\n \"file_path\": \"rg3d-ui/src/window.rs\",\n \"rank\": 14,\n \"score\": 263554.01949377905\n },\n {\n \"content\": \"fn make_header_button(ctx: &mut BuildContext, button: HeaderButton) -> Handle<UiNode> {\\n\\n ButtonBuilder::new(WidgetBuilder::new().with_margin(Thickness::uniform(2.0)))\\n\\n .with_back(\\n\\n DecoratorBuilder::new(\\n\\n BorderBuilder::new(WidgetBuilder::new())\\n\\n .with_stroke_thickness(Thickness::uniform(0.0)),\\n\\n )\\n\\n .with_normal_brush(Brush::Solid(Color::TRANSPARENT))\\n\\n .with_hover_brush(BRUSH_LIGHT)\\n\\n .with_pressed_brush(BRUSH_LIGHTEST)\\n\\n .build(ctx),\\n\\n )\\n\\n .with_content(make_mark(ctx, button))\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\\nimpl<'a> WindowBuilder {\\n\\n pub fn new(widget_builder: WidgetBuilder) -> Self {\\n\\n Self {\\n\\n widget_builder,\\n\",\n \"file_path\": \"rg3d-ui/src/window.rs\",\n \"rank\": 15,\n \"score\": 260579.46328660686\n },\n {\n \"content\": \"fn create_section_header(ctx: &mut BuildContext, text: &str) -> Handle<UiNode> {\\n\\n TextBuilder::new(WidgetBuilder::new().with_margin(Thickness::uniform(1.0)))\\n\\n .with_text(text)\\n\\n .with_vertical_text_alignment(VerticalAlignment::Center)\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/inspector/mod.rs\",\n \"rank\": 16,\n \"score\": 260579.46328660686\n },\n {\n \"content\": \"fn mark_handled(message: UiMessage) -> UiMessage {\\n\\n message.set_handled(true);\\n\\n message\\n\\n}\\n\\n\\n\\nimpl ColorPicker {\\n\\n fn sync_fields(&self, ui: &mut UserInterface, color: Color, hsv: Hsv) {\\n\\n ui.send_message(mark_handled(NumericUpDownMessage::value(\\n\\n self.hue,\\n\\n MessageDirection::ToWidget,\\n\\n hsv.hue(),\\n\\n )));\\n\\n\\n\\n ui.send_message(mark_handled(NumericUpDownMessage::value(\\n\\n self.saturation,\\n\\n MessageDirection::ToWidget,\\n\\n hsv.saturation(),\\n\\n )));\\n\\n\\n\\n ui.send_message(mark_handled(NumericUpDownMessage::value(\\n\",\n \"file_path\": \"rg3d-ui/src/color.rs\",\n \"rank\": 17,\n \"score\": 254005.96975483073\n },\n {\n \"content\": \"fn create_item_views(items: &[Item], ctx: &mut BuildContext) -> Vec<Handle<UiNode>> {\\n\\n items\\n\\n .iter()\\n\\n .enumerate()\\n\\n .map(|(n, item)| {\\n\\n BorderBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_child(\\n\\n ExpanderBuilder::new(WidgetBuilder::new())\\n\\n .with_header(\\n\\n GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_child(\\n\\n TextBuilder::new(WidgetBuilder::new())\\n\\n .with_vertical_text_alignment(\\n\\n VerticalAlignment::Center,\\n\\n )\\n\\n .with_text(format!(\\\"Item {}\\\", n))\\n\\n .build(ctx),\\n\\n )\\n\",\n \"file_path\": \"rg3d-ui/src/inspector/editors/collection.rs\",\n \"rank\": 18,\n \"score\": 251618.76260662643\n },\n {\n \"content\": \"/// Performs hashing of a sized value by interpreting it as raw memory.\\n\\npub fn hash_as_bytes<T: Sized, H: Hasher>(value: &T, hasher: &mut H) {\\n\\n hasher.write(value_as_u8_slice(value))\\n\\n}\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 19,\n \"score\": 244819.44435717873\n },\n {\n \"content\": \"pub fn wrapf(mut n: f32, mut min_limit: f32, mut max_limit: f32) -> f32 {\\n\\n if n >= min_limit && n <= max_limit {\\n\\n return n;\\n\\n }\\n\\n\\n\\n if max_limit == 0.0 && min_limit == 0.0 {\\n\\n return 0.0;\\n\\n }\\n\\n\\n\\n max_limit -= min_limit;\\n\\n\\n\\n let offset = min_limit;\\n\\n min_limit = 0.0;\\n\\n n -= offset;\\n\\n\\n\\n let num_of_max = (n / max_limit).abs().floor();\\n\\n\\n\\n if n >= max_limit {\\n\\n n -= num_of_max * max_limit;\\n\\n } else if n < min_limit {\\n\\n n += (num_of_max + 1.0) * max_limit;\\n\\n }\\n\\n\\n\\n n + offset\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 20,\n \"score\": 228154.8003304491\n },\n {\n \"content\": \"pub fn check(err_code: c_int) -> Result<(), SoundError> {\\n\\n if err_code < 0 {\\n\\n Err(SoundError::FailedToInitializeDevice(err_code_to_string(\\n\\n err_code,\\n\\n )))\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AlsaSoundDevice {\\n\\n pub fn new<F: FnMut(&mut [(f32, f32)]) + Send + 'static>(\\n\\n buffer_len_bytes: u32,\\n\\n callback: F,\\n\\n ) -> Result<Self, SoundError> {\\n\\n unsafe {\\n\\n let name = CString::new(\\\"default\\\").unwrap();\\n\\n // 16-bit stereo is 4 bytes, so frame count is bufferHalfSize / 4\\n\\n let frame_count = buffer_len_bytes / 4;\\n\\n let mut playback_device = std::ptr::null_mut();\\n\",\n \"file_path\": \"rg3d-sound/src/device/alsa.rs\",\n \"rank\": 21,\n \"score\": 222998.92013909158\n },\n {\n \"content\": \"pub fn fix_shadows_distance(mut quality: QualitySettings) -> QualitySettings {\\n\\n // Scale distance because game world has different scale.\\n\\n quality.spot_shadows_distance *= 2.0;\\n\\n quality.point_shadows_distance *= 2.0;\\n\\n quality\\n\\n}\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 22,\n \"score\": 222517.32502666634\n },\n {\n \"content\": \"/// \\\"Transmutes\\\" value of any sized type to a slice of bytes.\\n\\npub fn value_as_u8_slice<T: Sized>(v: &T) -> &'_ [u8] {\\n\\n // SAFETY: It is safe to reinterpret data to read it.\\n\\n unsafe { std::slice::from_raw_parts(v as *const T as *const u8, std::mem::size_of::<T>()) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 23,\n \"score\": 221045.03283963673\n },\n {\n \"content\": \"pub fn make_arrow(\\n\\n ctx: &mut BuildContext,\\n\\n orientation: ArrowDirection,\\n\\n size: f32,\\n\\n) -> Handle<UiNode> {\\n\\n VectorImageBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_foreground(BRUSH_BRIGHT)\\n\\n .with_horizontal_alignment(HorizontalAlignment::Center)\\n\\n .with_vertical_alignment(VerticalAlignment::Center),\\n\\n )\\n\\n .with_primitives(vec![match orientation {\\n\\n ArrowDirection::Top => Primitive::Triangle {\\n\\n points: [\\n\\n Vector2::new(size * 0.5, 0.0),\\n\\n Vector2::new(size, size),\\n\\n Vector2::new(0.0, size),\\n\\n ],\\n\\n },\\n\\n ArrowDirection::Bottom => Primitive::Triangle {\\n\",\n \"file_path\": \"rg3d-ui/src/utils.rs\",\n \"rank\": 24,\n \"score\": 220987.44933732622\n },\n {\n \"content\": \"// User interface in the engine build up on graph data structure, on tree to be\\n\\n// more precise. Each UI element can have single parent and multiple children.\\n\\n// UI uses complex layout system which automatically organizes your widgets.\\n\\n// In this example we'll use Grid and StackPanel layout controls. Grid can be\\n\\n// divided in rows and columns, its child element can set their desired column\\n\\n// and row and grid will automatically put them in correct position. StackPanel\\n\\n// will \\\"stack\\\" UI elements either on top of each other or in one line. Such\\n\\n// complex layout system was borrowed from WPF framework. You can read more here:\\n\\n// https://docs.microsoft.com/en-us/dotnet/framework/wpf/advanced/layout\\n\\nfn create_ui(engine: &mut Engine) -> Interface {\\n\\n let window_width = engine.renderer.get_frame_size().0 as f32;\\n\\n\\n\\n // Gather all suitable video modes, we'll use them to fill combo box of\\n\\n // available resolutions.\\n\\n let video_modes = engine\\n\\n .get_window()\\n\\n .primary_monitor()\\n\\n .unwrap()\\n\\n .video_modes()\\n\\n .filter(|vm| {\\n\\n // Leave only modern video modes, we are not in 1998.\\n\\n vm.size().width > 800 && vm.size().height > 600 && vm.bit_depth() == 32\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n let ctx = &mut engine.user_interface.build_ctx();\\n\\n\\n\\n // First of all create debug text that will show title of example and current FPS.\\n\\n let debug_text = TextBuilder::new(WidgetBuilder::new()).build(ctx);\\n\",\n \"file_path\": \"examples/ui.rs\",\n \"rank\": 25,\n \"score\": 220724.18147466824\n },\n {\n \"content\": \"// MenuItem uses popup to show its content, popup can be top-most only if it is\\n\\n// direct child of root canvas of UI. This fact adds some complications to search\\n\\n// of parent menu - we can't just traverse the tree because popup is not a child\\n\\n// of menu item, instead we trying to fetch handle to parent menu item from popup's\\n\\n// user data and continue up-search until we find menu.\\n\\nfn find_menu(from: Handle<UiNode>, ui: &UserInterface) -> Handle<UiNode> {\\n\\n let mut handle = from;\\n\\n while handle.is_some() {\\n\\n if let Some((_, popup)) = ui.try_borrow_by_type_up::<Popup>(handle) {\\n\\n // Continue search from parent menu item of popup.\\n\\n handle = popup\\n\\n .user_data_ref::<Handle<UiNode>>()\\n\\n .cloned()\\n\\n .unwrap_or_default();\\n\\n } else {\\n\\n // Maybe we have Menu as parent for MenuItem.\\n\\n return ui.find_by_criteria_up(handle, |n| n.cast::<Menu>().is_some());\\n\\n }\\n\\n }\\n\\n Default::default()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/menu.rs\",\n \"rank\": 26,\n \"score\": 218985.13202207064\n },\n {\n \"content\": \"/// Handles error codes of coreaudio functions\\n\\nfn check(error: OSStatus, msg: &str) -> Result<(), SoundError> {\\n\\n if error == noErr as i32 {\\n\\n Ok(())\\n\\n } else {\\n\\n let msg = format!(\\\"{}. Error code {}\\\", msg, error);\\n\\n Err(SoundError::FailedToInitializeDevice(msg))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Callback function set on `AudioQueueNewOutput`\\n\\nunsafe extern \\\"C\\\" fn audio_queue_callback(\\n\\n user_data: *mut c_void,\\n\\n queue: AudioQueueRef,\\n\\n buf: AudioQueueBufferRef,\\n\\n) {\\n\\n let inner: &mut Inner = &mut *(user_data as *mut Inner);\\n\\n inner.mix(); // Device::mix\\n\\n\\n\\n // set the buffer data\\n\\n let src = inner.out_data.as_mut_ptr() as *mut u8;\\n\",\n \"file_path\": \"rg3d-sound/src/device/coreaudio.rs\",\n \"rank\": 27,\n \"score\": 218076.87341370335\n },\n {\n \"content\": \"pub fn make_mark(\\n\\n ctx: &mut BuildContext,\\n\\n text: &str,\\n\\n column: usize,\\n\\n color: Color,\\n\\n) -> Handle<UiNode> {\\n\\n BorderBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .on_row(0)\\n\\n .on_column(column)\\n\\n .with_background(Brush::Solid(color))\\n\\n .with_foreground(Brush::Solid(Color::TRANSPARENT))\\n\\n .with_child(\\n\\n TextBuilder::new(WidgetBuilder::new())\\n\\n .with_vertical_text_alignment(VerticalAlignment::Center)\\n\\n .with_text(text)\\n\\n .build(ctx),\\n\\n ),\\n\\n )\\n\\n .build(ctx)\\n\\n}\\n\",\n \"file_path\": \"rg3d-ui/src/vec/mod.rs\",\n \"rank\": 28,\n \"score\": 217712.71779618526\n },\n {\n \"content\": \"pub fn create_impl(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: impl Iterator<Item = args::FieldArgs>,\\n\\n impl_body: TokenStream2,\\n\\n) -> TokenStream2 {\\n\\n let ty_ident = &ty_args.ident;\\n\\n let generics = self::create_impl_generics(&ty_args.generics, field_args);\\n\\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\\n\\n\\n\\n quote! {\\n\\n impl #impl_generics Visit for #ty_ident #ty_generics #where_clause {\\n\\n fn visit(\\n\\n &mut self,\\n\\n name: &str,\\n\\n visitor: &mut Visitor,\\n\\n ) -> VisitResult {\\n\\n #impl_body\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/visit/utils.rs\",\n \"rank\": 29,\n \"score\": 216400.82202492736\n },\n {\n \"content\": \"pub trait MessageData: 'static + Debug + Send + Any {\\n\\n fn as_any(&self) -> &dyn Any;\\n\\n\\n\\n fn clone_boxed(&self) -> Box<dyn MessageData>;\\n\\n\\n\\n fn compare(&self, other: &dyn MessageData) -> bool;\\n\\n}\\n\\n\\n\\nimpl<T> MessageData for T\\n\\nwhere\\n\\n T: 'static + Debug + Clone + PartialEq + Send + Any,\\n\\n{\\n\\n fn as_any(&self) -> &dyn Any {\\n\\n self\\n\\n }\\n\\n\\n\\n fn clone_boxed(&self) -> Box<dyn MessageData> {\\n\\n Box::new(self.clone())\\n\\n }\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/message.rs\",\n \"rank\": 30,\n \"score\": 216397.90318317086\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text =\\n\\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_bar =\\n\\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ctx);\\n\\n progress_bar\\n\\n })\\n\\n .with_child({\\n\\n progress_text = TextBuilder::new(\\n\",\n \"file_path\": \"examples/async.rs\",\n \"rank\": 31,\n \"score\": 214712.43357483557\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let cancel;\\n\\n let progress_grid;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text =\\n\\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_grid = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_visibility(!Path::new(LIGHTMAP_SCENE_PATH).exists())\\n\\n .on_column(1)\\n\",\n \"file_path\": \"examples/lightmap.rs\",\n \"rank\": 32,\n \"score\": 214712.43357483557\n },\n {\n \"content\": \"/// Creates `impl Inspect` block\\n\\npub fn create_impl<'f>(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: impl Iterator<Item = &'f args::FieldArgs>,\\n\\n impl_body: TokenStream2,\\n\\n) -> TokenStream2 {\\n\\n let ty_ident = &ty_args.ident;\\n\\n let generics = self::create_impl_generics(&ty_args.generics, field_args);\\n\\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\\n\\n\\n\\n quote! {\\n\\n impl #impl_generics Inspect for #ty_ident #ty_generics #where_clause {\\n\\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\\n\\n #impl_body\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/inspect/utils.rs\",\n \"rank\": 33,\n \"score\": 212647.2706675348\n },\n {\n \"content\": \"/// Saves given `data` and overwrites `data_default` with the saved data.\\n\\n///\\n\\n/// Test the equality after running this method!\\n\\npub fn save_load<T: Visit>(test_name: &str, data: &mut T, data_default: &mut T) {\\n\\n // Locate output path\\n\\n let (bin, txt) = {\\n\\n let manifest_dir = env::var(\\\"CARGO_MANIFEST_DIR\\\").unwrap();\\n\\n let root = PathBuf::from(manifest_dir).join(\\\"test_output\\\");\\n\\n (\\n\\n root.join(format!(\\\"{}.bin\\\", test_name)),\\n\\n root.join(format!(\\\"{}.txt\\\", test_name)),\\n\\n )\\n\\n };\\n\\n\\n\\n // Save `data`\\n\\n {\\n\\n let mut visitor = Visitor::new();\\n\\n data.visit(\\\"Data\\\", &mut visitor).unwrap();\\n\\n\\n\\n visitor.save_binary(&bin).unwrap();\\n\\n let mut file = File::create(&txt).unwrap();\\n\\n file.write(visitor.save_text().as_bytes()).unwrap();\\n\\n }\\n\",\n \"file_path\": \"rg3d-core-derive/tests/it/visit.rs\",\n \"rank\": 34,\n \"score\": 211444.64041085192\n },\n {\n \"content\": \"fn close_menu_chain(from: Handle<UiNode>, ui: &UserInterface) {\\n\\n let mut handle = from;\\n\\n while handle.is_some() {\\n\\n if let Some((popup_handle, popup)) = ui.try_borrow_by_type_up::<Popup>(handle) {\\n\\n ui.send_message(PopupMessage::close(\\n\\n popup_handle,\\n\\n MessageDirection::ToWidget,\\n\\n ));\\n\\n\\n\\n // Continue search from parent menu item of popup.\\n\\n handle = popup\\n\\n .user_data_ref::<Handle<UiNode>>()\\n\\n .cloned()\\n\\n .unwrap_or_default();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Control for MenuItem {\\n\\n fn as_any(&self) -> &dyn Any {\\n\",\n \"file_path\": \"rg3d-ui/src/menu.rs\",\n \"rank\": 35,\n \"score\": 210972.52481882364\n },\n {\n \"content\": \"fn create_ui(engine: &mut Engine) -> Interface {\\n\\n let ctx = &mut engine.user_interface.build_ctx();\\n\\n\\n\\n let debug_text = TextBuilder::new(WidgetBuilder::new()).build(ctx);\\n\\n\\n\\n let definition_container = Arc::new(PropertyEditorDefinitionContainer::new());\\n\\n\\n\\n let inspector;\\n\\n WindowBuilder::new(WidgetBuilder::new().with_width(400.0))\\n\\n .with_title(WindowTitle::text(\\\"Inspector\\\"))\\n\\n .with_content({\\n\\n inspector = InspectorBuilder::new(\\n\\n WidgetBuilder::new().with_desired_position(Vector2::new(200.0, 200.0)),\\n\\n )\\n\\n .with_property_editor_definitions(definition_container.clone())\\n\\n .build(ctx);\\n\\n inspector\\n\\n })\\n\\n .build(ctx);\\n\\n\\n\\n Interface {\\n\\n debug_text,\\n\\n inspector,\\n\\n definition_container,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/inspector.rs\",\n \"rank\": 36,\n \"score\": 208702.42246844436\n },\n {\n \"content\": \"///\\n\\n/// Triangulates specified polygon.\\n\\n///\\n\\npub fn triangulate(vertices: &[Vector3<f32>], out_triangles: &mut Vec<[usize; 3]>) {\\n\\n out_triangles.clear();\\n\\n if vertices.len() == 3 {\\n\\n // Triangulating a triangle?\\n\\n out_triangles.push([0, 1, 2]);\\n\\n } else if vertices.len() == 4 {\\n\\n // Special case for quadrilaterals (much faster than generic)\\n\\n let mut start_vertex = 0;\\n\\n for i in 0..4 {\\n\\n let v = vertices[i];\\n\\n let v0 = vertices[(i + 3) % 4];\\n\\n if let Some(left) = (v0 - v).try_normalize(f32::EPSILON) {\\n\\n let v1 = vertices[(i + 2) % 4];\\n\\n if let Some(diag) = (v1 - v).try_normalize(f32::EPSILON) {\\n\\n let v2 = vertices[(i + 1) % 4];\\n\\n if let Some(right) = (v2 - v).try_normalize(f32::EPSILON) {\\n\\n // Check for concave vertex\\n\\n let angle = left.dot(&diag).acos() + right.dot(&diag).acos();\\n\\n if angle > std::f32::consts::PI {\\n\\n start_vertex = i;\\n\",\n \"file_path\": \"rg3d-core/src/math/triangulator.rs\",\n \"rank\": 37,\n \"score\": 206259.8254078256\n },\n {\n \"content\": \"pub fn read_ascii<R>(reader: &mut R) -> Result<FbxDocument, FbxError>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n{\\n\\n let mut nodes: Pool<FbxNode> = Pool::new();\\n\\n let root_handle = nodes.spawn(FbxNode {\\n\\n name: String::from(\\\"__ROOT__\\\"),\\n\\n children: Vec::new(),\\n\\n parent: Handle::NONE,\\n\\n attributes: Vec::new(),\\n\\n });\\n\\n let mut parent_handle: Handle<FbxNode> = root_handle;\\n\\n let mut node_handle: Handle<FbxNode> = Handle::NONE;\\n\\n let mut buffer: Vec<u8> = Vec::new();\\n\\n let mut name: Vec<u8> = Vec::new();\\n\\n let mut value: Vec<u8> = Vec::new();\\n\\n\\n\\n let buf_len = reader.seek(SeekFrom::End(0))?;\\n\\n reader.seek(SeekFrom::Start(0))?;\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/ascii.rs\",\n \"rank\": 38,\n \"score\": 202034.74186644307\n },\n {\n \"content\": \"pub fn read_binary<R>(file: &mut R) -> Result<FbxDocument, FbxError>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n{\\n\\n let total_length = file.seek(SeekFrom::End(0))?;\\n\\n file.seek(SeekFrom::Start(0))?;\\n\\n\\n\\n // Ignore all stuff until version.\\n\\n let mut temp = [0; 23];\\n\\n file.read_exact(&mut temp)?;\\n\\n\\n\\n // Verify version.\\n\\n let version = file.read_u32::<LittleEndian>()? as i32;\\n\\n\\n\\n // Anything else should be supported.\\n\\n if version < 7100 {\\n\\n return Err(FbxError::UnsupportedVersion(version));\\n\\n }\\n\\n\\n\\n let mut nodes = Pool::new();\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 39,\n \"score\": 202034.74186644307\n },\n {\n \"content\": \"fn find_tree<P: AsRef<Path>>(node: Handle<UiNode>, path: &P, ui: &UserInterface) -> Handle<UiNode> {\\n\\n let mut tree_handle = Handle::NONE;\\n\\n let node_ref = ui.node(node);\\n\\n\\n\\n if let Some(tree) = node_ref.cast::<Tree>() {\\n\\n let tree_path = tree.user_data_ref::<PathBuf>().unwrap();\\n\\n if tree_path == path.as_ref() {\\n\\n tree_handle = node;\\n\\n } else {\\n\\n for &item in tree.items() {\\n\\n let tree = find_tree(item, path, ui);\\n\\n if tree.is_some() {\\n\\n tree_handle = tree;\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n } else if let Some(root) = node_ref.cast::<TreeRoot>() {\\n\\n for &item in root.items() {\\n\\n let tree = find_tree(item, path, ui);\\n\",\n \"file_path\": \"rg3d-ui/src/file_browser.rs\",\n \"rank\": 40,\n \"score\": 196949.17078315833\n },\n {\n \"content\": \"// impl `#[derive(Visit)]` for `struct` or `enum`\\n\\npub fn impl_visit(ast: DeriveInput) -> TokenStream2 {\\n\\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\\n\\n match &ty_args.data {\\n\\n ast::Data::Struct(ref field_args) => self::impl_visit_struct(&ty_args, field_args),\\n\\n ast::Data::Enum(ref variants) => self::impl_visit_enum(&ty_args, variants),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/visit.rs\",\n \"rank\": 41,\n \"score\": 194775.25412308643\n },\n {\n \"content\": \"pub fn impl_inspect(ast: DeriveInput) -> TokenStream2 {\\n\\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\\n\\n match &ty_args.data {\\n\\n ast::Data::Struct(ref field_args) => self::impl_inspect_struct(&ty_args, field_args),\\n\\n ast::Data::Enum(ref variant_args) => self::impl_inspect_enum(&ty_args, variant_args),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/inspect.rs\",\n \"rank\": 42,\n \"score\": 194763.1158449663\n },\n {\n \"content\": \"fn remap_handles(old_new_mapping: &HashMap<Handle<Node>, Handle<Node>>, dest_graph: &mut Graph) {\\n\\n // Iterate over instantiated nodes and remap handles.\\n\\n for (_, &new_node_handle) in old_new_mapping.iter() {\\n\\n let new_node = &mut dest_graph.pool[new_node_handle];\\n\\n\\n\\n if let Node::Mesh(mesh) = new_node {\\n\\n for surface in mesh.surfaces_mut() {\\n\\n for bone_handle in surface.bones.iter_mut() {\\n\\n if let Some(entry) = old_new_mapping.get(bone_handle) {\\n\\n *bone_handle = *entry;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // LODs also have handles that must be remapped too.\\n\\n if let Some(lod_group) = new_node.lod_group_mut() {\\n\\n for level in lod_group.levels.iter_mut() {\\n\\n level.objects.retain_mut(|object| {\\n\\n if let Some(entry) = old_new_mapping.get(object) {\\n\",\n \"file_path\": \"src/scene/graph.rs\",\n \"rank\": 43,\n \"score\": 192977.04034903913\n },\n {\n \"content\": \"fn is_node_enabled(nodes: &Pool<UiNode>, handle: Handle<UiNode>) -> bool {\\n\\n let root_node = &nodes[handle];\\n\\n let mut enabled = root_node.enabled();\\n\\n let mut parent = root_node.parent();\\n\\n while parent.is_some() {\\n\\n let node = &nodes[parent];\\n\\n if !node.enabled() {\\n\\n enabled = false;\\n\\n break;\\n\\n }\\n\\n parent = node.parent();\\n\\n }\\n\\n enabled\\n\\n}\\n\\n\\n\\nimpl UserInterface {\\n\\n pub fn new(screen_size: Vector2<f32>) -> UserInterface {\\n\\n let (sender, receiver) = mpsc::channel();\\n\\n let mut ui = UserInterface {\\n\\n screen_size,\\n\",\n \"file_path\": \"rg3d-ui/src/lib.rs\",\n \"rank\": 44,\n \"score\": 186837.06201786152\n },\n {\n \"content\": \"fn filtered_out(filter: &mut Option<Filter>, path: &Path) -> bool {\\n\\n match filter.as_mut() {\\n\\n Some(filter) => !filter.0.borrow_mut().deref_mut().lock().unwrap()(path),\\n\\n None => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/file_browser.rs\",\n \"rank\": 45,\n \"score\": 186541.3998544055\n },\n {\n \"content\": \"/// impl `Visit` for `struct`\\n\\nfn impl_visit_struct(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: &ast::Fields<args::FieldArgs>,\\n\\n) -> TokenStream2 {\\n\\n let visit_fn_body = if field_args.style == ast::Style::Unit {\\n\\n quote! { Ok(()) }\\n\\n } else {\\n\\n // `field.visit(..);` parts\\n\\n let field_visits =\\n\\n utils::create_field_visits(None, field_args.fields.iter(), field_args.style);\\n\\n\\n\\n quote! {\\n\\n visitor.enter_region(name)?;\\n\\n #(self.#field_visits)*\\n\\n visitor.leave_region()\\n\\n }\\n\\n };\\n\\n\\n\\n utils::create_impl(ty_args, field_args.iter().cloned(), visit_fn_body)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/visit.rs\",\n \"rank\": 46,\n \"score\": 185228.15251396626\n },\n {\n \"content\": \"fn impl_inspect_struct(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: &ast::Fields<args::FieldArgs>,\\n\\n) -> TokenStream2 {\\n\\n let body = utils::gen_inspect_fn_body(ty_args, utils::FieldPrefix::Self_, field_args);\\n\\n utils::create_impl(ty_args, field_args.iter(), body)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/inspect.rs\",\n \"rank\": 47,\n \"score\": 185215.84985526773\n },\n {\n \"content\": \"fn check<S: Into<String>>(code: i32, message: S) -> Result<(), SoundError> {\\n\\n if code == DS_OK {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(SoundError::FailedToInitializeDevice(message.into()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DirectSoundDevice {\\n\\n pub fn new<F: FnMut(&mut [(f32, f32)]) + Send + 'static>(\\n\\n buffer_len_bytes: u32,\\n\\n callback: F,\\n\\n ) -> Result<Self, SoundError> {\\n\\n unsafe {\\n\\n let mut direct_sound = std::ptr::null_mut();\\n\\n check(\\n\\n DirectSoundCreate(std::ptr::null(), &mut direct_sound, std::ptr::null_mut()),\\n\\n \\\"Failed to initialize DirectSound\\\",\\n\\n )?;\\n\\n\\n\",\n \"file_path\": \"rg3d-sound/src/device/dsound.rs\",\n \"rank\": 48,\n \"score\": 179337.45961225897\n },\n {\n \"content\": \"#[inline]\\n\\npub fn type_name_of<T>(_: T) -> &'static str {\\n\\n std::any::type_name::<T>()\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"enable_profiler\\\")]\\n\\n#[macro_export]\\n\\nmacro_rules! scope_profile {\\n\\n () => {\\n\\n let function_name = {\\n\\n fn scope() {}\\n\\n $crate::profiler::type_name_of(scope)\\n\\n };\\n\\n let _scope_guard = $crate::profiler::ScopeDefinition::new(function_name, line!());\\n\\n };\\n\\n}\\n\\n\\n\\n#[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\n#[macro_export]\\n\\nmacro_rules! scope_profile {\\n\\n () => {};\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 49,\n \"score\": 177239.4811744279\n },\n {\n \"content\": \"pub fn gen_inspect_fn_body(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_prefix: FieldPrefix,\\n\\n field_args: &ast::Fields<args::FieldArgs>,\\n\\n) -> TokenStream2 {\\n\\n let owner_name = ty_args.ident.to_string();\\n\\n\\n\\n // `inspect` function body, consisting of a sequence of quotes\\n\\n let mut quotes = Vec::new();\\n\\n\\n\\n // collect non-expanible field properties\\n\\n let props = field_args\\n\\n .fields\\n\\n .iter()\\n\\n .enumerate()\\n\\n .filter(|(_i, f)| !f.skip && !(f.expand || f.expand_subtree))\\n\\n .map(|(i, field)| {\\n\\n self::quote_field_prop(&owner_name, field_prefix, i, field, field_args.style)\\n\\n });\\n\\n\\n\",\n \"file_path\": \"rg3d-core-derive/src/inspect/utils.rs\",\n \"rank\": 50,\n \"score\": 176075.75139421714\n },\n {\n \"content\": \"#[inline]\\n\\npub fn set_once() {\\n\\n use std::sync::Once;\\n\\n static SET_HOOK: Once = Once::new();\\n\\n SET_HOOK.call_once(|| {\\n\\n panic::set_hook(Box::new(hook));\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/wasm/src/lib.rs\",\n \"rank\": 51,\n \"score\": 173681.14124279135\n },\n {\n \"content\": \"/// Generates UV map for given surface data.\\n\\n///\\n\\n/// # Performance\\n\\n///\\n\\n/// This method utilizes lots of \\\"brute force\\\" algorithms, so it is not fast as it\\n\\n/// could be in ideal case. It also allocates some memory for internal needs.\\n\\npub fn generate_uvs(\\n\\n data: &mut SurfaceData,\\n\\n spacing: f32,\\n\\n) -> Result<SurfaceDataPatch, VertexFetchError> {\\n\\n let uv_box = generate_uv_box(data);\\n\\n\\n\\n let data_id = data.content_hash();\\n\\n let mut vertex_buffer_mut = data.vertex_buffer.modify();\\n\\n let mut geometry_buffer_mut = data.geometry_buffer.modify();\\n\\n let (mut meshes, mut patch) = generate_uv_meshes(\\n\\n &uv_box,\\n\\n data_id,\\n\\n &mut vertex_buffer_mut,\\n\\n &mut geometry_buffer_mut,\\n\\n );\\n\\n drop(geometry_buffer_mut);\\n\\n\\n\\n // Step 4. Arrange and scale all meshes on uv map so it fits into [0;1] range.\\n\\n let area = meshes.iter().fold(0.0, |area, mesh| area + mesh.area());\\n\\n let square_side = area.sqrt() + spacing * meshes.len() as f32;\\n\",\n \"file_path\": \"src/utils/uvgen.rs\",\n \"rank\": 52,\n \"score\": 173681.14124279135\n },\n {\n \"content\": \"/// \\\"Transmutes\\\" array of any sized type to a slice of bytes.\\n\\npub fn array_as_u8_slice<T: Sized>(v: &[T]) -> &'_ [u8] {\\n\\n // SAFETY: It is safe to reinterpret data to read it.\\n\\n unsafe {\\n\\n std::slice::from_raw_parts(v.as_ptr() as *const u8, std::mem::size_of::<T>() * v.len())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 53,\n \"score\": 173679.02590266563\n },\n {\n \"content\": \"#[wasm_bindgen]\\n\\npub fn main_js() {\\n\\n set_once();\\n\\n\\n\\n let event_loop = EventLoop::new();\\n\\n\\n\\n let window_builder = rg3d::window::WindowBuilder::new()\\n\\n .with_inner_size(LogicalSize::new(800, 600))\\n\\n .with_title(\\\"Example - WASM\\\")\\n\\n .with_resizable(true);\\n\\n\\n\\n let mut engine = Engine::new(window_builder, &event_loop, true).unwrap();\\n\\n engine\\n\\n .renderer\\n\\n .set_backbuffer_clear_color(Color::opaque(150, 150, 255));\\n\\n\\n\\n // Configure resource manager.\\n\\n engine.resource_manager.state().set_textures_import_options(\\n\\n TextureImportOptions::default().with_compression(CompressionOptions::NoCompression),\\n\\n );\\n\\n\\n\",\n \"file_path\": \"examples/wasm/src/lib.rs\",\n \"rank\": 54,\n \"score\": 171374.84568967548\n },\n {\n \"content\": \"/// Generates UVs for a specified mesh.\\n\\npub fn generate_uvs_mesh(\\n\\n mesh: &Mesh,\\n\\n spacing: f32,\\n\\n) -> Result<Vec<SurfaceDataPatch>, VertexFetchError> {\\n\\n let last = instant::Instant::now();\\n\\n\\n\\n let data_set = mesh.surfaces().iter().map(|s| s.data()).collect::<Vec<_>>();\\n\\n\\n\\n let patches = data_set\\n\\n .into_par_iter()\\n\\n .map(|data| generate_uvs(&mut data.write().unwrap(), spacing))\\n\\n .collect::<Result<Vec<SurfaceDataPatch>, VertexFetchError>>()?;\\n\\n\\n\\n println!(\\\"Generate UVs: {:?}\\\", instant::Instant::now() - last);\\n\\n\\n\\n Ok(patches)\\n\\n}\\n\",\n \"file_path\": \"src/utils/uvgen.rs\",\n \"rank\": 55,\n \"score\": 171374.84568967548\n },\n {\n \"content\": \"/// Generates a set of UV meshes.\\n\\npub fn generate_uv_meshes(\\n\\n uv_box: &UvBox,\\n\\n data_id: u64,\\n\\n vertex_buffer_mut: &mut VertexBufferRefMut,\\n\\n geometry_buffer_mut: &mut GeometryBufferRefMut,\\n\\n) -> (Vec<UvMesh>, SurfaceDataPatch) {\\n\\n let mut mesh_patch = SurfaceDataPatch {\\n\\n data_id,\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n if !vertex_buffer_mut.has_attribute(VertexAttributeUsage::TexCoord1) {\\n\\n vertex_buffer_mut\\n\\n .add_attribute(\\n\\n VertexAttributeDescriptor {\\n\\n usage: VertexAttributeUsage::TexCoord1,\\n\\n data_type: VertexAttributeDataType::F32,\\n\\n size: 2,\\n\\n divisor: 0,\\n\\n shader_location: 6, // HACK: GBuffer renderer expects it to be at 6\\n\",\n \"file_path\": \"src/utils/uvgen.rs\",\n \"rank\": 56,\n \"score\": 171374.84568967548\n },\n {\n \"content\": \"pub fn barycentric_to_world(\\n\\n bary: (f32, f32, f32),\\n\\n pa: Vector3<f32>,\\n\\n pb: Vector3<f32>,\\n\\n pc: Vector3<f32>,\\n\\n) -> Vector3<f32> {\\n\\n pa.scale(bary.0) + pb.scale(bary.1) + pc.scale(bary.2)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 57,\n \"score\": 169167.8167583457\n },\n {\n \"content\": \"pub fn vec3_to_vec2_by_plane(\\n\\n plane_class: PlaneClass,\\n\\n normal: Vector3<f32>,\\n\\n point: Vector3<f32>,\\n\\n) -> Vector2<f32> {\\n\\n match plane_class {\\n\\n PlaneClass::XY => {\\n\\n if normal.z < 0.0 {\\n\\n Vector2::new(point.y, point.x)\\n\\n } else {\\n\\n Vector2::new(point.x, point.y)\\n\\n }\\n\\n }\\n\\n PlaneClass::XZ => {\\n\\n if normal.y < 0.0 {\\n\\n Vector2::new(point.x, point.z)\\n\\n } else {\\n\\n Vector2::new(point.z, point.x)\\n\\n }\\n\\n }\\n\\n PlaneClass::YZ => {\\n\\n if normal.x < 0.0 {\\n\\n Vector2::new(point.z, point.y)\\n\\n } else {\\n\\n Vector2::new(point.y, point.z)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 58,\n \"score\": 167053.78057800437\n },\n {\n \"content\": \"pub fn ray_rect_intersection(\\n\\n rect: Rect<f32>,\\n\\n origin: Vector2<f32>,\\n\\n dir: Vector2<f32>,\\n\\n) -> Option<IntersectionResult> {\\n\\n let min = rect.left_top_corner();\\n\\n let max = rect.right_bottom_corner();\\n\\n\\n\\n let (mut tmin, mut tmax) = if dir.x >= 0.0 {\\n\\n ((min.x - origin.x) / dir.x, (max.x - origin.x) / dir.x)\\n\\n } else {\\n\\n ((max.x - origin.x) / dir.x, (min.x - origin.x) / dir.x)\\n\\n };\\n\\n\\n\\n let (tymin, tymax) = if dir.y >= 0.0 {\\n\\n ((min.y - origin.y) / dir.y, (max.y - origin.y) / dir.y)\\n\\n } else {\\n\\n ((max.y - origin.y) / dir.y, (min.y - origin.y) / dir.y)\\n\\n };\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 59,\n \"score\": 167053.78057800437\n },\n {\n \"content\": \"pub fn is_point_inside_2d_triangle(\\n\\n point: Vector2<f32>,\\n\\n pt_a: Vector2<f32>,\\n\\n pt_b: Vector2<f32>,\\n\\n pt_c: Vector2<f32>,\\n\\n) -> bool {\\n\\n let ba = pt_b - pt_a;\\n\\n let ca = pt_c - pt_a;\\n\\n\\n\\n let vp = point - pt_a;\\n\\n\\n\\n let ba_dot_ba = ba.dot(&ba);\\n\\n let ca_dot_ba = ca.dot(&ba);\\n\\n let ca_dot_ca = ca.dot(&ca);\\n\\n\\n\\n let dot_02 = ca.dot(&vp);\\n\\n let dot_12 = ba.dot(&vp);\\n\\n\\n\\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\\n\\n\\n\\n // calculate barycentric coordinates\\n\\n let u = (ba_dot_ba * dot_02 - ca_dot_ba * dot_12) * inv_denom;\\n\\n let v = (ca_dot_ca * dot_12 - ca_dot_ba * dot_02) * inv_denom;\\n\\n\\n\\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 60,\n \"score\": 167053.78057800437\n },\n {\n \"content\": \"pub fn get_barycentric_coords_2d(\\n\\n p: Vector2<f32>,\\n\\n a: Vector2<f32>,\\n\\n b: Vector2<f32>,\\n\\n c: Vector2<f32>,\\n\\n) -> (f32, f32, f32) {\\n\\n let v0 = b - a;\\n\\n let v1 = c - a;\\n\\n let v2 = p - a;\\n\\n\\n\\n let d00 = v0.dot(&v0);\\n\\n let d01 = v0.dot(&v1);\\n\\n let d11 = v1.dot(&v1);\\n\\n let d20 = v2.dot(&v0);\\n\\n let d21 = v2.dot(&v1);\\n\\n let inv_denom = 1.0 / (d00 * d11 - d01.powi(2));\\n\\n\\n\\n let v = (d11 * d20 - d01 * d21) * inv_denom;\\n\\n let w = (d00 * d21 - d01 * d20) * inv_denom;\\n\\n let u = 1.0 - v - w;\\n\\n\\n\\n (u, v, w)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 61,\n \"score\": 167053.78057800437\n },\n {\n \"content\": \"pub fn get_barycentric_coords(\\n\\n p: &Vector3<f32>,\\n\\n a: &Vector3<f32>,\\n\\n b: &Vector3<f32>,\\n\\n c: &Vector3<f32>,\\n\\n) -> (f32, f32, f32) {\\n\\n let v0 = *b - *a;\\n\\n let v1 = *c - *a;\\n\\n let v2 = *p - *a;\\n\\n\\n\\n let d00 = v0.dot(&v0);\\n\\n let d01 = v0.dot(&v1);\\n\\n let d11 = v1.dot(&v1);\\n\\n let d20 = v2.dot(&v0);\\n\\n let d21 = v2.dot(&v1);\\n\\n let denom = d00 * d11 - d01.powi(2);\\n\\n\\n\\n let v = (d11 * d20 - d01 * d21) / denom;\\n\\n let w = (d00 * d21 - d01 * d20) / denom;\\n\\n let u = 1.0 - v - w;\\n\\n\\n\\n (u, v, w)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 62,\n \"score\": 167053.78057800437\n },\n {\n \"content\": \"fn save(game: &mut Game) {\\n\\n // To save a game state all we need to do is to create new instance of Visitor\\n\\n // and call visit on game instance.\\n\\n let mut visitor = Visitor::new();\\n\\n game.visit(\\\"Game\\\", &mut visitor).unwrap();\\n\\n // And call save method.\\n\\n visitor.save_binary(Path::new(SAVE_FILE)).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/save_load.rs\",\n \"rank\": 63,\n \"score\": 165459.9027394224\n },\n {\n \"content\": \"fn get_line_thickness_vector(a: Vector2<f32>, b: Vector2<f32>, thickness: f32) -> Vector2<f32> {\\n\\n if let Some(dir) = (b - a).try_normalize(f32::EPSILON) {\\n\\n Vector2::new(dir.y, -dir.x).scale(thickness * 0.5)\\n\\n } else {\\n\\n Vector2::default()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for DrawingContext {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Draw for DrawingContext {\\n\\n #[inline(always)]\\n\\n fn push_vertex(&mut self, pos: Vector2<f32>, tex_coord: Vector2<f32>) {\\n\\n self.vertex_buffer.push(Vertex::new(pos, tex_coord));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"rg3d-ui/src/draw.rs\",\n \"rank\": 64,\n \"score\": 162276.42803941114\n },\n {\n \"content\": \"fn line_thickness_vector(a: Vector2<f32>, b: Vector2<f32>, thickness: f32) -> Vector2<f32> {\\n\\n if let Some(dir) = (b - a).try_normalize(f32::EPSILON) {\\n\\n Vector2::new(dir.y, -dir.x).scale(thickness * 0.5)\\n\\n } else {\\n\\n Vector2::default()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Primitive {\\n\\n pub fn bounds(&self) -> (Vector2<f32>, Vector2<f32>) {\\n\\n match self {\\n\\n Primitive::Triangle { points } => {\\n\\n let min = points[0]\\n\\n .per_component_min(&points[1])\\n\\n .per_component_min(&points[2]);\\n\\n let max = points[0]\\n\\n .per_component_max(&points[1])\\n\\n .per_component_max(&points[2]);\\n\\n (min, max)\\n\\n }\\n\",\n \"file_path\": \"rg3d-ui/src/vector_image.rs\",\n \"rank\": 65,\n \"score\": 162276.42803941114\n },\n {\n \"content\": \"/// `<prefix>field.visit(\\\"name\\\", visitor);`\\n\\npub fn create_field_visits<'a>(\\n\\n // None or `f` when bindings tuple variants. NOTE: We can't use `prefix: Ident`\\n\\n prefix: Option<Ident>,\\n\\n fields: impl Iterator<Item = &'a args::FieldArgs>,\\n\\n field_style: ast::Style,\\n\\n) -> Vec<TokenStream2> {\\n\\n if field_style == ast::Style::Unit {\\n\\n // `Unit` (struct/enum variant) has no field to visit.\\n\\n // We won't even enter this region:\\n\\n return vec![];\\n\\n }\\n\\n\\n\\n let visit_args = fields\\n\\n .filter(|field| !field.skip)\\n\\n .enumerate()\\n\\n .map(|(field_index, field)| {\\n\\n let (ident, name) = match field_style {\\n\\n // `NamedFields { a: f32, .. }`\\n\\n ast::Style::Struct => {\\n\\n let ident = field.ident.as_ref().unwrap_or_else(|| unreachable!());\\n\",\n \"file_path\": \"rg3d-core-derive/src/visit/utils.rs\",\n \"rank\": 66,\n \"score\": 161267.41162279714\n },\n {\n \"content\": \"fn sort_keys(keys: &mut [CurveKey]) {\\n\\n keys.sort_by(|a, b| {\\n\\n if a.location > b.location {\\n\\n Ordering::Greater\\n\\n } else if a.location < b.location {\\n\\n Ordering::Less\\n\\n } else {\\n\\n Ordering::Equal\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\\nimpl From<Vec<CurveKey>> for Curve {\\n\\n fn from(mut keys: Vec<CurveKey>) -> Self {\\n\\n sort_keys(&mut keys);\\n\\n Self { keys }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Curve {\\n\",\n \"file_path\": \"rg3d-core/src/curve.rs\",\n \"rank\": 67,\n \"score\": 159106.17756997977\n },\n {\n \"content\": \"#[allow(clippy::manual_map)]\\n\\npub fn into_any_arc<T: Any + Send + Sync>(\\n\\n opt: Option<Arc<T>>,\\n\\n) -> Option<Arc<dyn Any + Send + Sync>> {\\n\\n match opt {\\n\\n Some(r) => Some(r),\\n\\n None => None,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 68,\n \"score\": 156247.04037803682\n },\n {\n \"content\": \"/// A panic hook for use with\\n\\n/// [`std::panic::set_hook`](https://doc.rust-lang.org/nightly/std/panic/fn.set_hook.html)\\n\\n/// that logs panics into\\n\\n/// [`console.error`](https://developer.mozilla.org/en-US/docs/Web/API/Console/error).\\n\\n///\\n\\n/// On non-wasm targets, prints the panic to `stderr`.\\n\\npub fn hook(info: &panic::PanicInfo) {\\n\\n hook_impl(info);\\n\\n}\\n\\n\\n\\n/// Set the `console.error` panic hook the first time this is called. Subsequent\\n\\n/// invocations do nothing.\\n\",\n \"file_path\": \"examples/wasm/src/lib.rs\",\n \"rank\": 69,\n \"score\": 154869.0020908082\n },\n {\n \"content\": \"#[inline]\\n\\nfn read_samples(buffer: &mut Vec<f32>, decoder: &mut Decoder, count: usize) -> usize {\\n\\n buffer.clear();\\n\\n for _ in 0..count {\\n\\n if let Some(sample) = decoder.next() {\\n\\n buffer.push(sample)\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n }\\n\\n buffer.len()\\n\\n}\\n\\n\\n\\nimpl StreamingBuffer {\\n\\n /// Defines amount of samples `per channel` which each streaming buffer will use for internal buffer.\\n\\n pub const STREAM_SAMPLE_COUNT: usize = 44100;\\n\\n\\n\\n /// Creates new streaming buffer using given data source. May fail if data source has unsupported format\\n\\n /// or it has corrupted data. Length of internal generic buffer cannot be changed but can be fetched from\\n\\n /// `StreamingBuffer::STREAM_SAMPLE_COUNT`\\n\\n ///\\n\",\n \"file_path\": \"rg3d-sound/src/buffer/streaming.rs\",\n \"rank\": 70,\n \"score\": 154235.77152587552\n },\n {\n \"content\": \"struct UiShader {\\n\\n program: GpuProgram,\\n\\n wvp_matrix: UniformLocation,\\n\\n diffuse_texture: UniformLocation,\\n\\n is_font: UniformLocation,\\n\\n solid_color: UniformLocation,\\n\\n brush_type: UniformLocation,\\n\\n gradient_point_count: UniformLocation,\\n\\n gradient_colors: UniformLocation,\\n\\n gradient_stops: UniformLocation,\\n\\n gradient_origin: UniformLocation,\\n\\n gradient_end: UniformLocation,\\n\\n resolution: UniformLocation,\\n\\n bounds_min: UniformLocation,\\n\\n bounds_max: UniformLocation,\\n\\n opacity: UniformLocation,\\n\\n}\\n\\n\\n\\nimpl UiShader {\\n\\n pub fn new(state: &mut PipelineState) -> Result<Self, FrameworkError> {\\n\",\n \"file_path\": \"src/renderer/ui_renderer.rs\",\n \"rank\": 71,\n \"score\": 153465.49497188925\n },\n {\n \"content\": \"/// Translates library button state into rg3d-ui button state.\\n\\npub fn translate_state(state: ElementState) -> ButtonState {\\n\\n match state {\\n\\n ElementState::Pressed => ButtonState::Pressed,\\n\\n ElementState::Released => ButtonState::Released,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 72,\n \"score\": 152920.20896939392\n },\n {\n \"content\": \"pub fn wrap_angle(angle: f32) -> f32 {\\n\\n let two_pi = 2.0 * std::f32::consts::PI;\\n\\n\\n\\n if angle > 0.0 {\\n\\n angle % two_pi\\n\\n } else {\\n\\n (angle + two_pi) % two_pi\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 73,\n \"score\": 152914.310543774\n },\n {\n \"content\": \"pub fn get_closest_point_triangles<P: PositionProvider>(\\n\\n points: &[P],\\n\\n triangles: &[TriangleDefinition],\\n\\n triangle_indices: &[u32],\\n\\n point: Vector3<f32>,\\n\\n) -> Option<usize> {\\n\\n let mut closest_sqr_distance = f32::MAX;\\n\\n let mut closest_index = None;\\n\\n for triangle_index in triangle_indices {\\n\\n let triangle = triangles.get(*triangle_index as usize).unwrap();\\n\\n for point_index in triangle.0.iter() {\\n\\n let vertex = points.get(*point_index as usize).unwrap();\\n\\n let sqr_distance = (vertex.position() - point).norm_squared();\\n\\n if sqr_distance < closest_sqr_distance {\\n\\n closest_sqr_distance = sqr_distance;\\n\\n closest_index = Some(*point_index as usize);\\n\\n }\\n\\n }\\n\\n }\\n\\n closest_index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 74,\n \"score\": 152289.49110062158\n },\n {\n \"content\": \"fn is_vorbis_ogg(source: &mut DataSource) -> bool {\\n\\n let pos = source.seek(SeekFrom::Current(0)).unwrap();\\n\\n\\n\\n let is_vorbis = OggStreamReader::new(source.by_ref()).is_ok();\\n\\n\\n\\n source.seek(SeekFrom::Start(pos)).unwrap();\\n\\n\\n\\n is_vorbis\\n\\n}\\n\\n\\n\\nimpl OggDecoder {\\n\\n pub fn new(mut source: DataSource) -> Result<Self, DataSource> {\\n\\n if is_vorbis_ogg(&mut source) {\\n\\n let mut reader = OggStreamReader::new(source).unwrap();\\n\\n\\n\\n let samples = if let Ok(Some(samples)) =\\n\\n reader.read_dec_packet_generic::<InterleavedSamples<f32>>()\\n\\n {\\n\\n samples.samples.into_iter()\\n\\n } else {\\n\",\n \"file_path\": \"rg3d-sound/src/decoder/vorbis.rs\",\n \"rank\": 75,\n \"score\": 152196.71064271044\n },\n {\n \"content\": \"/// Converts engine's optional texture \\\"pointer\\\" to rg3d-ui's.\\n\\npub fn into_gui_texture(this: Texture) -> draw::SharedTexture {\\n\\n draw::SharedTexture(this.0.into_inner())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 76,\n \"score\": 152112.14199745393\n },\n {\n \"content\": \"pub fn print() -> Result<String, fmt::Error> {\\n\\n #[cfg(feature = \\\"enable_profiler\\\")]\\n\\n {\\n\\n let mut buffer = String::new();\\n\\n PROFILER.lock().unwrap().print(&mut buffer)?;\\n\\n Ok(buffer)\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\n {\\n\\n Ok(\\\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\\\".to_owned())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 77,\n \"score\": 152106.20468583255\n },\n {\n \"content\": \"struct InputController {\\n\\n move_forward: bool,\\n\\n move_backward: bool,\\n\\n move_left: bool,\\n\\n move_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/2d.rs\",\n \"rank\": 78,\n \"score\": 151528.055579047\n },\n {\n \"content\": \"/// Translates keyboard modifiers to rg3d-ui keyboard modifiers.\\n\\npub fn translate_keyboard_modifiers(modifiers: ModifiersState) -> KeyboardModifiers {\\n\\n KeyboardModifiers {\\n\\n alt: modifiers.alt(),\\n\\n shift: modifiers.shift(),\\n\\n control: modifiers.ctrl(),\\n\\n system: modifiers.logo(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 79,\n \"score\": 151052.46912313515\n },\n {\n \"content\": \"/// Translated key code to rg3d-ui key code.\\n\\npub fn translate_key(key: VirtualKeyCode) -> KeyCode {\\n\\n match key {\\n\\n VirtualKeyCode::Key1 => KeyCode::Key1,\\n\\n VirtualKeyCode::Key2 => KeyCode::Key2,\\n\\n VirtualKeyCode::Key3 => KeyCode::Key3,\\n\\n VirtualKeyCode::Key4 => KeyCode::Key4,\\n\\n VirtualKeyCode::Key5 => KeyCode::Key5,\\n\\n VirtualKeyCode::Key6 => KeyCode::Key6,\\n\\n VirtualKeyCode::Key7 => KeyCode::Key7,\\n\\n VirtualKeyCode::Key8 => KeyCode::Key8,\\n\\n VirtualKeyCode::Key9 => KeyCode::Key9,\\n\\n VirtualKeyCode::Key0 => KeyCode::Key0,\\n\\n VirtualKeyCode::A => KeyCode::A,\\n\\n VirtualKeyCode::B => KeyCode::B,\\n\\n VirtualKeyCode::C => KeyCode::C,\\n\\n VirtualKeyCode::D => KeyCode::D,\\n\\n VirtualKeyCode::E => KeyCode::E,\\n\\n VirtualKeyCode::F => KeyCode::F,\\n\\n VirtualKeyCode::G => KeyCode::G,\\n\\n VirtualKeyCode::H => KeyCode::H,\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 80,\n \"score\": 151052.46912313515\n },\n {\n \"content\": \"#[proc_macro_derive(Inspect, attributes(inspect))]\\n\\npub fn inspect(input: TokenStream) -> TokenStream {\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n TokenStream::from(inspect::impl_inspect(ast))\\n\\n}\\n\",\n \"file_path\": \"rg3d-core-derive/src/lib.rs\",\n \"rank\": 81,\n \"score\": 151046.53181151376\n },\n {\n \"content\": \"pub fn make_vec3_container<P: AsRef<str>>(\\n\\n nodes: &FbxNodeContainer,\\n\\n container_node: Handle<FbxNode>,\\n\\n data_name: P,\\n\\n) -> Result<FbxContainer<Vector3<f32>>, FbxError> {\\n\\n FbxContainer::new(nodes, container_node, data_name, |attributes| {\\n\\n let mut normals = Vec::with_capacity(attributes.len() / 3);\\n\\n for normal in attributes.chunks_exact(3) {\\n\\n normals.push(Vector3::new(\\n\\n normal[0].as_f32()?,\\n\\n normal[1].as_f32()?,\\n\\n normal[2].as_f32()?,\\n\\n ));\\n\\n }\\n\\n Ok(normals)\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/resource/fbx/scene/mod.rs\",\n \"rank\": 82,\n \"score\": 151046.53181151376\n },\n {\n \"content\": \"#[proc_macro_derive(Visit, attributes(visit))]\\n\\npub fn visit(input: TokenStream) -> TokenStream {\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n TokenStream::from(visit::impl_visit(ast))\\n\\n}\\n\\n\\n\\n/// Implements `Inspect` trait\\n\\n///\\n\\n/// User has to import `Inspect` and `PropertyInfo` to use this macro.\\n\",\n \"file_path\": \"rg3d-core-derive/src/lib.rs\",\n \"rank\": 83,\n \"score\": 151046.53181151376\n },\n {\n \"content\": \"pub fn get_closest_point_triangle_set<P: PositionProvider>(\\n\\n points: &[P],\\n\\n triangles: &[TriangleDefinition],\\n\\n point: Vector3<f32>,\\n\\n) -> Option<usize> {\\n\\n let mut closest_sqr_distance = f32::MAX;\\n\\n let mut closest_index = None;\\n\\n for triangle in triangles {\\n\\n for point_index in triangle.0.iter() {\\n\\n let vertex = points.get(*point_index as usize).unwrap();\\n\\n let sqr_distance = (vertex.position() - point).norm_squared();\\n\\n if sqr_distance < closest_sqr_distance {\\n\\n closest_sqr_distance = sqr_distance;\\n\\n closest_index = Some(*point_index as usize);\\n\\n }\\n\\n }\\n\\n }\\n\\n closest_index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 84,\n \"score\": 150562.72628058388\n },\n {\n \"content\": \"struct Interface {\\n\\n debug_text: Handle<UiNode>,\\n\\n yaw: Handle<UiNode>,\\n\\n scale: Handle<UiNode>,\\n\\n reset: Handle<UiNode>,\\n\\n video_modes: Vec<VideoMode>,\\n\\n resolutions: Handle<UiNode>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ui.rs\",\n \"rank\": 85,\n \"score\": 149453.58902474184\n },\n {\n \"content\": \"pub fn err_code_to_string(err_code: c_int) -> String {\\n\\n unsafe {\\n\\n let message = CStr::from_ptr(snd_strerror(err_code) as *const _)\\n\\n .to_bytes()\\n\\n .to_vec();\\n\\n String::from_utf8(message).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-sound/src/device/alsa.rs\",\n \"rank\": 86,\n \"score\": 149251.33512478284\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/lightmap.rs\",\n \"rank\": 87,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/simple.rs\",\n \"rank\": 88,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scene.rs\",\n \"rank\": 89,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/navmesh.rs\",\n \"rank\": 90,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/terrain.rs\",\n \"rank\": 91,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/instancing.rs\",\n \"rank\": 92,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n forward: bool,\\n\\n backward: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/lod.rs\",\n \"rank\": 93,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/async.rs\",\n \"rank\": 94,\n \"score\": 148871.55008114927\n },\n {\n \"content\": \"/// Translates window event to rg3d-ui event.\\n\\npub fn translate_event(event: &WindowEvent) -> Option<OsEvent> {\\n\\n match event {\\n\\n WindowEvent::ReceivedCharacter(c) => Some(OsEvent::Character(*c)),\\n\\n WindowEvent::KeyboardInput { input, .. } => {\\n\\n input.virtual_keycode.map(|key| OsEvent::KeyboardInput {\\n\\n button: translate_key(key),\\n\\n state: translate_state(input.state),\\n\\n })\\n\\n }\\n\\n WindowEvent::CursorMoved { position, .. } => Some(OsEvent::CursorMoved {\\n\\n position: Vector2::new(position.x as f32, position.y as f32),\\n\\n }),\\n\\n WindowEvent::MouseWheel { delta, .. } => match delta {\\n\\n MouseScrollDelta::LineDelta(x, y) => Some(OsEvent::MouseWheel(*x, *y)),\\n\\n MouseScrollDelta::PixelDelta(pos) => {\\n\\n Some(OsEvent::MouseWheel(pos.x as f32, pos.y as f32))\\n\\n }\\n\\n },\\n\\n WindowEvent::MouseInput { state, button, .. } => Some(OsEvent::MouseInput {\\n\\n button: translate_button(*button),\\n\\n state: translate_state(*state),\\n\\n }),\\n\\n &WindowEvent::ModifiersChanged(modifiers) => Some(OsEvent::KeyboardModifiers(\\n\\n translate_keyboard_modifiers(modifiers),\\n\\n )),\\n\\n _ => None,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 95,\n \"score\": 148299.54919264212\n },\n {\n \"content\": \"pub fn print_hot_path() -> Result<String, fmt::Error> {\\n\\n #[cfg(feature = \\\"enable_profiler\\\")]\\n\\n {\\n\\n let mut buffer = String::new();\\n\\n PROFILER.lock().unwrap().print_hot_path(&mut buffer)?;\\n\\n Ok(buffer)\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\n {\\n\\n Ok(\\\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\\\".to_owned())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 96,\n \"score\": 148293.57247889644\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n model_handle: Handle<Node>,\\n\\n walk_animation: Handle<Animation>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Set ambient light.\\n\\n scene.ambient_lighting_color = Color::opaque(200, 200, 200);\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(0.0, 6.0, -12.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await;\\n\\n\\n\",\n \"file_path\": \"examples/ui.rs\",\n \"rank\": 97,\n \"score\": 146845.93279365223\n },\n {\n \"content\": \"fn rc_to_raw<T>(rc: &Rc<T>) -> *mut T {\\n\\n &**rc as *const T as *mut T\\n\\n}\\n\\n\\n\\nimpl<T> Visit for Arc<T>\\n\\nwhere\\n\\n T: Visit + Send + Sync + 'static,\\n\\n{\\n\\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\\n\\n visitor.enter_region(name)?;\\n\\n\\n\\n if visitor.reading {\\n\\n let mut raw = 0u64;\\n\\n raw.visit(\\\"Id\\\", visitor)?;\\n\\n if raw == 0 {\\n\\n return Err(VisitError::UnexpectedRcNullIndex);\\n\\n }\\n\\n if let Some(ptr) = visitor.arc_map.get(&raw) {\\n\\n if let Ok(res) = Arc::downcast::<T>(ptr.clone()) {\\n\\n *self = res;\\n\",\n \"file_path\": \"rg3d-core/src/visitor.rs\",\n \"rank\": 98,\n \"score\": 146842.15068907844\n },\n {\n \"content\": \"fn arc_to_raw<T>(arc: &Arc<T>) -> *mut T {\\n\\n &**arc as *const T as *mut T\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/visitor.rs\",\n \"rank\": 99,\n \"score\": 146842.15068907844\n }\n]","isConversational":false}}},{"rowIdx":1979,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/resource/model.rs"},"repo_name":{"kind":"string","value":"Jytesh/rg3d"},"commit":{"kind":"string","value":"5cc1017f9a9b3e5d461fbb6247675bf0df4d6d00"},"file_code":{"kind":"string","value":"#![warn(missing_docs)]\n\nuse crate::{\n animation::Animation,\n core::{\n pool::Handle,\n visitor::{Visit, VisitError, VisitResult, Visitor},\n },\n engine::resource_manager::ResourceManager,\n resource::{\n fbx::{self, error::FbxError},\n Resource, ResourceData,\n },\n scene::{node::Node, Scene},\n utils::log::{Log, MessageKind},\n};\nuse std::{\n borrow::Cow,\n path::{Path, PathBuf},\n};\n\n#[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]\n#[repr(u32)]\npub(in crate) enum NodeMapping {\n UseNames = 0,\n UseHandles = 1,\n}\n\n#[derive(Debug)]\npub struct ModelData {\n pub(in crate) path: PathBuf,\n pub(in crate) mapping: NodeMapping,\n scene: Scene,\n}\n\npub type Model = Resource<ModelData, ModelLoadError>;\n\nimpl Model {\n \n \n pub fn instantiate_geometry(&self, dest_scene: &mut Scene) -> Handle<Node> {\n let data = self.data_ref();\n\n let (root, old_to_new) = data.scene.graph.copy_node(\n data.scene.graph.get_root(),\n &mut dest_scene.graph,\n &mut |_, _| true,\n );\n dest_scene.graph[root].is_resource_instance_root = true;\n\n \n let mut stack = vec![root];\n while let Some(node_handle) = stack.pop() {\n let node = &mut dest_scene.graph[node_handle];\n\n node.resource = Some(self.clone());\n\n \n stack.extend_from_slice(node.children());\n }\n\n \n \n \n for navmesh in data.scene.navmeshes.iter() {\n dest_scene.navmeshes.add(navmesh.clone());\n }\n\n std::mem::drop(data);\n\n dest_scene.physics.embed_resource(\n &mut dest_scene.physics_binder,\n &dest_scene.graph,\n old_to_new,\n self.clone(),\n );\n\n root\n }\n\n \n \n pub fn instantiate(&self, dest_scene: &mut Scene) -> ModelInstance {\n let root = self.instantiate_geometry(dest_scene);\n ModelInstance {\n root,\n animations: self.retarget_animations(root, dest_scene),\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 retarget_animations(\n &self,\n root: Handle<Node>,\n dest_scene: &mut Scene,\n ) -> Vec<Handle<Animation>> {\n let data = self.data_ref();\n let mut animation_handles = Vec::new();\n\n for ref_anim in data.scene.animations.iter() {\n let mut anim_copy = ref_anim.clone();\n\n \n \n anim_copy.resource = Some(self.clone());\n\n \n \n \n for (i, ref_track) in ref_anim.get_tracks().iter().enumerate() {\n let ref_node = &data.scene.graph[ref_track.get_node()];\n \n let instance_node = dest_scene.graph.find_by_name(root, ref_node.name());\n if instance_node.is_none() {\n Log::writeln(\n MessageKind::Error,\n format!(\n \"Failed to retarget animation {:?} for node {}\",\n data.path(),\n ref_node.name()\n ),\n );\n }\n \n anim_copy.get_tracks_mut()[i].set_node(instance_node);\n }\n\n animation_handles.push(dest_scene.animations.add(anim_copy));\n }\n\n animation_handles\n }\n}\n\nimpl ResourceData for ModelData {\n fn path(&self) -> Cow<Path> {\n Cow::Borrowed(&self.path)\n }\n}\n\nimpl Default for ModelData {\n fn default() -> Self {\n Self {\n path: PathBuf::new(),\n mapping: NodeMapping::UseNames,\n scene: Scene::new(),\n }\n }\n}\n\nimpl Visit for ModelData {\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\n visitor.enter_region(name)?;\n\n self.path.visit(\"Path\", visitor)?;\n\n visitor.leave_region()\n }\n}\n\npub struct ModelInstance {\n \n pub root: Handle<Node>,\n\n \n \n pub animations: Vec<Handle<Animation>>,\n}\n\n#[derive(Debug)]\npub enum ModelLoadError {\n \n Visit(VisitError),\n \n NotSupported(String),\n \n Fbx(FbxError),\n}\n\nimpl From<FbxError> for ModelLoadError {\n fn from(fbx: FbxError) -> Self {\n ModelLoadError::Fbx(fbx)\n }\n}\n\nimpl From<VisitError> for ModelLoadError {\n fn from(e: VisitError) -> Self {\n ModelLoadError::Visit(e)\n }\n}\n\nimpl ModelData {\n pub(in crate) async fn load<P: AsRef<Path>>(\n path: P,\n resource_manager: ResourceManager,\n ) -> Result<Self, ModelLoadError> {\n let extension = path\n .as_ref()\n .extension()\n .unwrap_or_default()\n .to_string_lossy()\n .as_ref()\n .to_lowercase();\n let (scene, mapping) = match extension.as_ref() {\n \"fbx\" => {\n let mut scene = Scene::new();\n if let Some(filename) = path.as_ref().file_name() {\n let root = scene.graph.get_root();\n scene.graph[root].set_name(filename.to_string_lossy().to_string());\n }\n fbx::load_to_scene(&mut scene, resource_manager, path.as_ref())?;\n \n \n (scene, NodeMapping::UseNames)\n }\n \n \n \"rgs\" => (\n Scene::from_file(path.as_ref(), resource_manager).await?,\n NodeMapping::UseHandles,\n ),\n \n _ => {\n return Err(ModelLoadError::NotSupported(format!(\n \"Unsupported model resource format: {}\",\n extension\n )))\n }\n };\n\n Ok(Self {\n path: path.as_ref().to_owned(),\n scene,\n mapping,\n })\n }\n\n \n \n \n pub fn get_scene(&self) -> &Scene {\n &self.scene\n }\n\n \n \n pub fn find_node_by_name(&self, name: &str) -> Handle<Node> {\n self.scene.graph.find_by_name_from_root(name)\n }\n}\n"},"prefix":{"kind":"string","value":"#![warn(missing_docs)]\n\nuse crate::{\n animation::Animation,\n core::{\n pool::Handle,\n visitor::{Visit, VisitError, VisitResult, Visitor},\n },\n engine::resource_manager::ResourceManager,\n resource::{\n fbx::{self, error::FbxError},\n Resource, ResourceData,\n },\n scene::{node::Node, Scene},\n utils::log::{Log, MessageKind},\n};\nuse std::{\n borrow::Cow,\n path::{Path, PathBuf},\n};\n\n#[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]\n#[repr(u32)]\npub(in crate) enum NodeMapping {\n UseNames = 0,\n UseHandles = 1,\n}\n\n#[derive(Debug)]\npub struct ModelData {\n pub(in crate) path: PathBuf,\n pub(in crate) mapping: NodeMapping,\n scene: Scene,\n}\n\npub type Model = Resource<ModelData, ModelLoadError>;\n\nimpl Model {\n \n \n pub fn instantiate_geometry(&self, dest_scene: &mut Scene) -> Handle<Node> {\n let d"},"suffix":{"kind":"string","value":"xtension = path\n .as_ref()\n .extension()\n .unwrap_or_default()\n .to_string_lossy()\n .as_ref()\n .to_lowercase();\n let (scene, mapping) = match extension.as_ref() {\n \"fbx\" => {\n let mut scene = Scene::new();\n if let Some(filename) = path.as_ref().file_name() {\n let root = scene.graph.get_root();\n scene.graph[root].set_name(filename.to_string_lossy().to_string());\n }\n fbx::load_to_scene(&mut scene, resource_manager, path.as_ref())?;\n \n \n (scene, NodeMapping::UseNames)\n }\n \n \n \"rgs\" => (\n Scene::from_file(path.as_ref(), resource_manager).await?,\n NodeMapping::UseHandles,\n ),\n \n _ => {\n return Err(ModelLoadError::NotSupported(format!(\n \"Unsupported model resource format: {}\",\n extension\n )))\n }\n };\n\n Ok(Self {\n path: path.as_ref().to_owned(),\n scene,\n mapping,\n })\n }\n\n \n \n \n pub fn get_scene(&self) -> &Scene {\n &self.scene\n }\n\n \n \n pub fn find_node_by_name(&self, name: &str) -> Handle<Node> {\n self.scene.graph.find_by_name_from_root(name)\n }\n}\n"},"middle":{"kind":"string","value":"ata = self.data_ref();\n\n let (root, old_to_new) = data.scene.graph.copy_node(\n data.scene.graph.get_root(),\n &mut dest_scene.graph,\n &mut |_, _| true,\n );\n dest_scene.graph[root].is_resource_instance_root = true;\n\n \n let mut stack = vec![root];\n while let Some(node_handle) = stack.pop() {\n let node = &mut dest_scene.graph[node_handle];\n\n node.resource = Some(self.clone());\n\n \n stack.extend_from_slice(node.children());\n }\n\n \n \n \n for navmesh in data.scene.navmeshes.iter() {\n dest_scene.navmeshes.add(navmesh.clone());\n }\n\n std::mem::drop(data);\n\n dest_scene.physics.embed_resource(\n &mut dest_scene.physics_binder,\n &dest_scene.graph,\n old_to_new,\n self.clone(),\n );\n\n root\n }\n\n \n \n pub fn instantiate(&self, dest_scene: &mut Scene) -> ModelInstance {\n let root = self.instantiate_geometry(dest_scene);\n ModelInstance {\n root,\n animations: self.retarget_animations(root, dest_scene),\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 retarget_animations(\n &self,\n root: Handle<Node>,\n dest_scene: &mut Scene,\n ) -> Vec<Handle<Animation>> {\n let data = self.data_ref();\n let mut animation_handles = Vec::new();\n\n for ref_anim in data.scene.animations.iter() {\n let mut anim_copy = ref_anim.clone();\n\n \n \n anim_copy.resource = Some(self.clone());\n\n \n \n \n for (i, ref_track) in ref_anim.get_tracks().iter().enumerate() {\n let ref_node = &data.scene.graph[ref_track.get_node()];\n \n let instance_node = dest_scene.graph.find_by_name(root, ref_node.name());\n if instance_node.is_none() {\n Log::writeln(\n MessageKind::Error,\n format!(\n \"Failed to retarget animation {:?} for node {}\",\n data.path(),\n ref_node.name()\n ),\n );\n }\n \n anim_copy.get_tracks_mut()[i].set_node(instance_node);\n }\n\n animation_handles.push(dest_scene.animations.add(anim_copy));\n }\n\n animation_handles\n }\n}\n\nimpl ResourceData for ModelData {\n fn path(&self) -> Cow<Path> {\n Cow::Borrowed(&self.path)\n }\n}\n\nimpl Default for ModelData {\n fn default() -> Self {\n Self {\n path: PathBuf::new(),\n mapping: NodeMapping::UseNames,\n scene: Scene::new(),\n }\n }\n}\n\nimpl Visit for ModelData {\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\n visitor.enter_region(name)?;\n\n self.path.visit(\"Path\", visitor)?;\n\n visitor.leave_region()\n }\n}\n\npub struct ModelInstance {\n \n pub root: Handle<Node>,\n\n \n \n pub animations: Vec<Handle<Animation>>,\n}\n\n#[derive(Debug)]\npub enum ModelLoadError {\n \n Visit(VisitError),\n \n NotSupported(String),\n \n Fbx(FbxError),\n}\n\nimpl From<FbxError> for ModelLoadError {\n fn from(fbx: FbxError) -> Self {\n ModelLoadError::Fbx(fbx)\n }\n}\n\nimpl From<VisitError> for ModelLoadError {\n fn from(e: VisitError) -> Self {\n ModelLoadError::Visit(e)\n }\n}\n\nimpl ModelData {\n pub(in crate) async fn load<P: AsRef<Path>>(\n path: P,\n resource_manager: ResourceManager,\n ) -> Result<Self, ModelLoadError> {\n let e"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Tries to load and convert FBX from given path.\n\n///\n\n/// Normally you should never use this method, use resource manager to load models.\n\npub fn load_to_scene<P: AsRef<Path>>(\n\n scene: &mut Scene,\n\n resource_manager: ResourceManager,\n\n path: P,\n\n) -> Result<(), FbxError> {\n\n let start_time = Instant::now();\n\n\n\n Log::writeln(\n\n MessageKind::Information,\n\n format!(\"Trying to load {:?}\", path.as_ref()),\n\n );\n\n\n\n let now = Instant::now();\n\n let fbx = FbxDocument::new(path.as_ref())?;\n\n let parsing_time = now.elapsed().as_millis();\n\n\n\n let now = Instant::now();\n\n let fbx_scene = FbxScene::new(&fbx)?;\n\n let dom_prepare_time = now.elapsed().as_millis();\n\n\n","file_path":"src/resource/fbx/mod.rs","rank":0,"score":239598.46693377758},{"content":"#[cfg(not(feature = \"enable_profiler\"))]\n\npub fn print_hot_path() {\n\n println!(\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\")\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":1,"score":213922.89836919578},{"content":"/// Utility function that replaces back slashes \\ to forward /\n\n/// It replaces slashes only on windows!\n\npub fn replace_slashes<P: AsRef<Path>>(path: P) -> PathBuf {\n\n #[cfg(target_os = \"windows\")]\n\n {\n\n if path.as_ref().is_absolute() {\n\n // Absolute Windows paths are incompatible with other operating systems so\n\n // don't bother here and return existing path as owned.\n\n path.as_ref().to_owned()\n\n } else {\n\n // Replace all \\ to /. This is needed because on macos or linux \\ is a valid symbol in\n\n // file name, and not separator (except linux which understand both variants).\n\n let mut os_str = std::ffi::OsString::new();\n\n let count = path.as_ref().components().count();\n\n for (i, component) in path.as_ref().components().enumerate() {\n\n os_str.push(component.as_os_str());\n\n if i != count - 1 {\n\n os_str.push(\"/\");\n\n }\n\n }\n\n PathBuf::from(os_str)\n\n }\n","file_path":"rg3d-core/src/lib.rs","rank":2,"score":208940.62257705006},{"content":"pub trait MessageData: 'static + Debug + Clone + PartialEq {}\n\n\n\n/// Message is basic communication element that is used to deliver information to UI nodes\n\n/// or to user code.\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct UiMessage<M: MessageData, C: Control<M, C>> {\n\n /// Useful flag to check if a message was already handled.\n\n handled: Cell<bool>,\n\n\n\n /// Actual message data. Use pattern matching to get type specific data.\n\n data: UiMessageData<M, C>,\n\n\n\n /// Handle of node that will receive message. Please note that all nodes in hierarchy will\n\n /// also receive this message, order is \"up-on-tree\".\n\n destination: Handle<UINode<M, C>>,\n\n\n\n /// Indicates the direction of the message.\n\n ///\n\n /// See [MessageDirection](enum.MessageDirection.html) for details.\n\n direction: MessageDirection,\n","file_path":"rg3d-ui/src/message.rs","rank":3,"score":196785.9945776297},{"content":"pub fn create_scene_async(resource_manager: ResourceManager) -> Arc<Mutex<SceneLoadContext>> {\n\n // Create load context - it will be shared with caller and loader threads.\n\n let context = Arc::new(Mutex::new(SceneLoadContext {\n\n scene_data: None,\n\n message: \"Starting..\".to_string(),\n\n progress: 0.0,\n\n }));\n\n let result = context.clone();\n\n\n\n // Spawn separate thread which will create scene by loading various assets.\n\n std::thread::spawn(move || {\n\n futures::executor::block_on(async move {\n\n let mut scene = Scene::new();\n\n\n\n // Create reverb effect for more natural sound - our player walks in some sort of cathedral,\n\n // so there will be pretty decent echo.\n\n let mut base_effect = BaseEffect::default();\n\n // Make sure it won't be too loud - rg3d-sound doesn't care about energy conservation law, it\n\n // just makes requested calculation.\n\n base_effect.set_gain(0.7);\n","file_path":"examples/shared/mod.rs","rank":4,"score":184637.6830728355},{"content":"pub fn wrapf(mut n: f32, mut min_limit: f32, mut max_limit: f32) -> f32 {\n\n if n >= min_limit && n <= max_limit {\n\n return n;\n\n }\n\n\n\n if max_limit == 0.0 && min_limit == 0.0 {\n\n return 0.0;\n\n }\n\n\n\n max_limit -= min_limit;\n\n\n\n let offset = min_limit;\n\n min_limit = 0.0;\n\n n -= offset;\n\n\n\n let num_of_max = (n / max_limit).abs().floor();\n\n\n\n if n >= max_limit {\n\n n -= num_of_max * max_limit;\n\n } else if n < min_limit {\n\n n += (num_of_max + 1.0) * max_limit;\n\n }\n\n\n\n n + offset\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":5,"score":181804.2041155096},{"content":"#[cfg(not(feature = \"enable_profiler\"))]\n\npub fn print() {\n\n println!(\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\")\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":6,"score":179698.25507509612},{"content":"pub fn make_vec3_container<P: AsRef<str>>(\n\n nodes: &FbxNodeContainer,\n\n container_node: Handle<FbxNode>,\n\n data_name: P,\n\n) -> Result<FbxContainer<Vector3<f32>>, FbxError> {\n\n FbxContainer::new(nodes, container_node, data_name, |attributes| {\n\n let mut normals = Vec::with_capacity(attributes.len() / 3);\n\n for normal in attributes.chunks_exact(3) {\n\n normals.push(Vector3::new(\n\n normal[0].as_f32()?,\n\n normal[1].as_f32()?,\n\n normal[2].as_f32()?,\n\n ));\n\n }\n\n Ok(normals)\n\n })\n\n}\n","file_path":"src/resource/fbx/scene/mod.rs","rank":7,"score":176965.67999311662},{"content":"#[inline]\n\npub fn type_name_of<T>(_: T) -> &'static str {\n\n std::any::type_name::<T>()\n\n}\n\n\n\n#[cfg(feature = \"enable_profiler\")]\n\n#[macro_export]\n\nmacro_rules! scope_profile {\n\n () => {\n\n let function_name = {\n\n fn scope() {}\n\n $crate::profiler::type_name_of(scope)\n\n };\n\n let _scope_guard = $crate::profiler::ScopeDefinition::new(function_name, line!());\n\n };\n\n}\n\n\n\n#[cfg(not(feature = \"enable_profiler\"))]\n\n#[macro_export]\n\nmacro_rules! scope_profile {\n\n () => {};\n","file_path":"rg3d-core/src/profiler.rs","rank":8,"score":176960.88367800374},{"content":"fn arc_to_raw<T>(arc: Arc<T>) -> *mut T {\n\n &*arc as *const T as *mut T\n\n}\n\n\n","file_path":"rg3d-core/src/visitor.rs","rank":9,"score":172356.80836512952},{"content":"fn rc_to_raw<T>(rc: Rc<T>) -> *mut T {\n\n &*rc as *const T as *mut T\n\n}\n\n\n\nimpl<T> Visit for Arc<T>\n\nwhere\n\n T: Default + Visit + Send + Sync + 'static,\n\n{\n\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\n\n visitor.enter_region(name)?;\n\n\n\n if visitor.reading {\n\n let mut raw = 0u64;\n\n raw.visit(\"Id\", visitor)?;\n\n if raw == 0 {\n\n return Err(VisitError::UnexpectedRcNullIndex);\n\n }\n\n if let Some(ptr) = visitor.arc_map.get(&raw) {\n\n if let Ok(res) = Arc::downcast::<T>(ptr.clone()) {\n\n *self = res;\n","file_path":"rg3d-core/src/visitor.rs","rank":10,"score":172356.80836512952},{"content":"pub fn barycentric_to_world(\n\n bary: (f32, f32, f32),\n\n pa: Vector3<f32>,\n\n pb: Vector3<f32>,\n\n pc: Vector3<f32>,\n\n) -> Vector3<f32> {\n\n pa.scale(bary.0) + pb.scale(bary.1) + pc.scale(bary.2)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":11,"score":170394.6964902355},{"content":"///\n\n/// Triangulates specified polygon.\n\n///\n\npub fn triangulate(vertices: &[Vector3<f32>], out_triangles: &mut Vec<[usize; 3]>) {\n\n out_triangles.clear();\n\n if vertices.len() == 3 {\n\n // Triangulating a triangle?\n\n out_triangles.push([0, 1, 2]);\n\n } else if vertices.len() == 4 {\n\n // Special case for quadrilaterals (much faster than generic)\n\n let mut start_vertex = 0;\n\n for i in 0..4 {\n\n let v = vertices[i];\n\n let v0 = vertices[(i + 3) % 4];\n\n if let Some(left) = (v0 - v).try_normalize(std::f32::EPSILON) {\n\n let v1 = vertices[(i + 2) % 4];\n\n if let Some(diag) = (v1 - v).try_normalize(std::f32::EPSILON) {\n\n let v2 = vertices[(i + 1) % 4];\n\n if let Some(right) = (v2 - v).try_normalize(std::f32::EPSILON) {\n\n // Check for concave vertex\n\n let angle = left.dot(&diag).acos() + right.dot(&diag).acos();\n\n if angle > std::f32::consts::PI {\n\n start_vertex = i;\n","file_path":"rg3d-core/src/math/triangulator.rs","rank":12,"score":166563.7270581963},{"content":"pub fn get_barycentric_coords(\n\n p: &Vector3<f32>,\n\n a: &Vector3<f32>,\n\n b: &Vector3<f32>,\n\n c: &Vector3<f32>,\n\n) -> (f32, f32, f32) {\n\n let v0 = *b - *a;\n\n let v1 = *c - *a;\n\n let v2 = *p - *a;\n\n\n\n let d00 = v0.dot(&v0);\n\n let d01 = v0.dot(&v1);\n\n let d11 = v1.dot(&v1);\n\n let d20 = v2.dot(&v0);\n\n let d21 = v2.dot(&v1);\n\n let denom = d00 * d11 - d01.powi(2);\n\n\n\n let v = (d11 * d20 - d01 * d21) / denom;\n\n let w = (d00 * d21 - d01 * d20) / denom;\n\n let u = 1.0 - v - w;\n\n\n\n (u, v, w)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":13,"score":166193.8240626658},{"content":"pub fn get_barycentric_coords_2d(\n\n p: Vector2<f32>,\n\n a: Vector2<f32>,\n\n b: Vector2<f32>,\n\n c: Vector2<f32>,\n\n) -> (f32, f32, f32) {\n\n let v0 = b - a;\n\n let v1 = c - a;\n\n let v2 = p - a;\n\n\n\n let d00 = v0.dot(&v0);\n\n let d01 = v0.dot(&v1);\n\n let d11 = v1.dot(&v1);\n\n let d20 = v2.dot(&v0);\n\n let d21 = v2.dot(&v1);\n\n let inv_denom = 1.0 / (d00 * d11 - d01.powi(2));\n\n\n\n let v = (d11 * d20 - d01 * d21) * inv_denom;\n\n let w = (d00 * d21 - d01 * d20) * inv_denom;\n\n let u = 1.0 - v - w;\n\n\n\n (u, v, w)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":14,"score":166193.8240626658},{"content":"pub fn ray_rect_intersection(\n\n rect: Rect<f32>,\n\n origin: Vector2<f32>,\n\n dir: Vector2<f32>,\n\n) -> Option<IntersectionResult> {\n\n let min = rect.left_top_corner();\n\n let max = rect.right_bottom_corner();\n\n\n\n let (mut tmin, mut tmax) = if dir.x >= 0.0 {\n\n ((min.x - origin.x) / dir.x, (max.x - origin.x) / dir.x)\n\n } else {\n\n ((max.x - origin.x) / dir.x, (min.x - origin.x) / dir.x)\n\n };\n\n\n\n let (tymin, tymax) = if dir.y >= 0.0 {\n\n ((min.y - origin.y) / dir.y, (max.y - origin.y) / dir.y)\n\n } else {\n\n ((max.y - origin.y) / dir.y, (min.y - origin.y) / dir.y)\n\n };\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":15,"score":166193.8240626658},{"content":"pub fn vec3_to_vec2_by_plane(\n\n plane_class: PlaneClass,\n\n normal: Vector3<f32>,\n\n point: Vector3<f32>,\n\n) -> Vector2<f32> {\n\n match plane_class {\n\n PlaneClass::XY => {\n\n if normal.z < 0.0 {\n\n Vector2::new(point.y, point.x)\n\n } else {\n\n Vector2::new(point.x, point.y)\n\n }\n\n }\n\n PlaneClass::XZ => {\n\n if normal.y < 0.0 {\n\n Vector2::new(point.x, point.z)\n\n } else {\n\n Vector2::new(point.z, point.x)\n\n }\n\n }\n\n PlaneClass::YZ => {\n\n if normal.x < 0.0 {\n\n Vector2::new(point.z, point.y)\n\n } else {\n\n Vector2::new(point.y, point.z)\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":16,"score":166193.8240626658},{"content":"pub fn is_point_inside_2d_triangle(\n\n point: Vector2<f32>,\n\n pt_a: Vector2<f32>,\n\n pt_b: Vector2<f32>,\n\n pt_c: Vector2<f32>,\n\n) -> bool {\n\n let ba = pt_b - pt_a;\n\n let ca = pt_c - pt_a;\n\n\n\n let vp = point - pt_a;\n\n\n\n let ba_dot_ba = ba.dot(&ba);\n\n let ca_dot_ba = ca.dot(&ba);\n\n let ca_dot_ca = ca.dot(&ca);\n\n\n\n let dot_02 = ca.dot(&vp);\n\n let dot_12 = ba.dot(&vp);\n\n\n\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\n\n\n\n // calculate barycentric coordinates\n\n let u = (ba_dot_ba * dot_02 - ca_dot_ba * dot_12) * inv_denom;\n\n let v = (ca_dot_ca * dot_12 - ca_dot_ba * dot_02) * inv_denom;\n\n\n\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":17,"score":166193.8240626658},{"content":"fn convert_model(\n\n fbx_scene: &FbxScene,\n\n model: &FbxModel,\n\n resource_manager: ResourceManager,\n\n graph: &mut Graph,\n\n animations: &mut AnimationContainer,\n\n animation_handle: Handle<Animation>,\n\n) -> Result<Handle<Node>, FbxError> {\n\n let base = convert_model_to_base(model);\n\n\n\n // Create node with correct kind.\n\n let node_handle = if !model.geoms.is_empty() {\n\n convert_mesh(base, fbx_scene, resource_manager, model, graph)?\n\n } else if model.light.is_some() {\n\n fbx_scene.get(model.light).as_light()?.convert(base, graph)\n\n } else {\n\n base.build(graph)\n\n };\n\n\n\n // Convert animations\n","file_path":"src/resource/fbx/mod.rs","rank":18,"score":165258.8383677839},{"content":"fn convert_model_to_base(model: &FbxModel) -> BaseBuilder {\n\n BaseBuilder::new()\n\n .with_inv_bind_pose_transform(model.inv_bind_transform)\n\n .with_name(model.name.as_str())\n\n .with_local_transform(\n\n TransformBuilder::new()\n\n .with_local_rotation(quat_from_euler(model.rotation))\n\n .with_local_scale(model.scale)\n\n .with_local_position(model.translation)\n\n .with_post_rotation(quat_from_euler(model.post_rotation))\n\n .with_pre_rotation(quat_from_euler(model.pre_rotation))\n\n .with_rotation_offset(model.rotation_offset)\n\n .with_rotation_pivot(model.rotation_pivot)\n\n .with_scaling_offset(model.scaling_offset)\n\n .with_scaling_pivot(model.scaling_pivot)\n\n .build(),\n\n )\n\n}\n\n\n","file_path":"src/resource/fbx/mod.rs","rank":19,"score":165015.52543294433},{"content":"/// A trait for resource data.\n\npub trait ResourceData: 'static + Default + Debug + Visit + Send {\n\n /// Returns path of resource data.\n\n fn path(&self) -> Cow<Path>;\n\n}\n\n\n","file_path":"src/resource/mod.rs","rank":20,"score":161771.4287768079},{"content":"/// Performs hashing of a sized value by interpreting it as raw memory.\n\npub fn hash_as_bytes<T: Sized, H: Hasher>(value: &T, hasher: &mut H) {\n\n unsafe {\n\n hasher.write(std::slice::from_raw_parts(\n\n value as *const T as *const u8,\n\n std::mem::size_of::<T>(),\n\n ))\n\n }\n\n}\n","file_path":"src/utils/mod.rs","rank":21,"score":161297.23821385356},{"content":"fn read_tangents(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Option<FbxContainer<Vector3<f32>>>, FbxError> {\n\n if let Ok(layer_element_tangent) = nodes.find(geom_node_handle, \"LayerElementTangent\") {\n\n Ok(Some(scene::make_vec3_container(\n\n nodes,\n\n layer_element_tangent,\n\n \"Tangents\",\n\n )?))\n\n } else {\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":22,"score":159837.96518402782},{"content":"fn read_normals(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Option<FbxContainer<Vector3<f32>>>, FbxError> {\n\n if let Ok(layer_element_normal) = nodes.find(geom_node_handle, \"LayerElementNormal\") {\n\n Ok(Some(scene::make_vec3_container(\n\n nodes,\n\n layer_element_normal,\n\n \"Normals\",\n\n )?))\n\n } else {\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":23,"score":159837.96518402782},{"content":"fn read_binormals(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Option<FbxContainer<Vector3<f32>>>, FbxError> {\n\n if let Ok(layer_element_tangent) = nodes.find(geom_node_handle, \"LayerElementBinormal\") {\n\n Ok(Some(scene::make_vec3_container(\n\n nodes,\n\n layer_element_tangent,\n\n \"Binormals\",\n\n )?))\n\n } else {\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":24,"score":159837.96518402782},{"content":"fn read_uvs(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Option<FbxContainer<Vector2<f32>>>, FbxError> {\n\n if let Ok(layer_element_uv) = nodes.find(geom_node_handle, \"LayerElementUV\") {\n\n Ok(Some(FbxContainer::new(\n\n nodes,\n\n layer_element_uv,\n\n \"UV\",\n\n |attributes| {\n\n let mut uvs = Vec::with_capacity(attributes.len() / 2);\n\n for uv in attributes.chunks_exact(2) {\n\n uvs.push(Vector2::new(uv[0].as_f32()?, uv[1].as_f32()?));\n\n }\n\n Ok(uvs)\n\n },\n\n )?))\n\n } else {\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":25,"score":159837.96518402782},{"content":"fn read_vertices(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Vec<Vector3<f32>>, FbxError> {\n\n let vertices_node_handle = nodes.find(geom_node_handle, \"Vertices\")?;\n\n let vertices_array_node = nodes.get_by_name(vertices_node_handle, \"a\")?;\n\n let mut vertices = Vec::with_capacity(vertices_array_node.attrib_count() / 3);\n\n for vertex in vertices_array_node.attributes().chunks_exact(3) {\n\n vertices.push(Vector3::new(\n\n vertex[0].as_f32()?,\n\n vertex[1].as_f32()?,\n\n vertex[2].as_f32()?,\n\n ));\n\n }\n\n\n\n Ok(vertices)\n\n}\n\n\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":26,"score":159837.96518402782},{"content":"fn read_indices(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Vec<i32>, FbxError> {\n\n let indices_node_handle = nodes.find(geom_node_handle, \"PolygonVertexIndex\")?;\n\n let indices_array_node = nodes.get_by_name(indices_node_handle, \"a\")?;\n\n let mut indices = Vec::with_capacity(indices_array_node.attrib_count());\n\n for index in indices_array_node.attributes() {\n\n indices.push(index.as_i32()?);\n\n }\n\n Ok(indices)\n\n}\n\n\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":27,"score":159837.96518402782},{"content":"fn read_materials(\n\n geom_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n) -> Result<Option<FbxContainer<i32>>, FbxError> {\n\n if let Ok(layer_element_material_node_handle) =\n\n nodes.find(geom_node_handle, \"LayerElementMaterial\")\n\n {\n\n Ok(Some(FbxContainer::new(\n\n nodes,\n\n layer_element_material_node_handle,\n\n \"Materials\",\n\n |attributes| {\n\n let mut materials = Vec::with_capacity(attributes.len());\n\n for attribute in attributes {\n\n materials.push(attribute.as_i32()?);\n\n }\n\n Ok(materials)\n\n },\n\n )?))\n\n } else {\n","file_path":"src/resource/fbx/scene/geometry.rs","rank":28,"score":159837.96518402782},{"content":"pub trait Visit {\n\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult;\n\n}\n\n\n\nimpl Default for Visitor {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl Visitor {\n\n const MAGIC: &'static str = \"RG3D\";\n\n\n\n pub fn new() -> Self {\n\n let mut nodes = Pool::new();\n\n let root = nodes.spawn(Node::new(\"__ROOT__\", Handle::NONE));\n\n Self {\n\n nodes,\n\n rc_map: HashMap::new(),\n\n arc_map: HashMap::new(),\n","file_path":"rg3d-core/src/visitor.rs","rank":29,"score":159697.12956729977},{"content":"fn calculate_hash<T: Hash>(t: &T) -> u64 {\n\n let mut s = DefaultHasher::new();\n\n t.hash(&mut s);\n\n s.finish()\n\n}\n\n\n\nimpl Profiler {\n\n fn enter_scope(&mut self, scope: &mut ScopeMark) {\n\n let parent_scope_mark = *self.scope_stack.last().unwrap();\n\n scope.parent_scope_hash = calculate_hash(&parent_scope_mark);\n\n self.scope_stack.push(*scope);\n\n self.samples.entry(*scope).or_default();\n\n self.samples\n\n .get_mut(&parent_scope_mark)\n\n .unwrap()\n\n .children\n\n .insert(*scope);\n\n }\n\n\n\n fn leave_scope(&mut self, scope: ScopeMark, elapsed: f64) {\n","file_path":"rg3d-core/src/profiler.rs","rank":30,"score":157810.07257685097},{"content":"pub fn read_binary<R>(file: &mut R) -> Result<FbxDocument, FbxError>\n\nwhere\n\n R: Read + Seek,\n\n{\n\n let total_length = file.seek(SeekFrom::End(0))?;\n\n file.seek(SeekFrom::Start(0))?;\n\n\n\n // Ignore all stuff until version.\n\n let mut temp = [0; 23];\n\n file.read_exact(&mut temp)?;\n\n\n\n // Verify version.\n\n let version = file.read_u32::<LittleEndian>()? as i32;\n\n\n\n // Anything else should be supported.\n\n if version < 7100 {\n\n return Err(FbxError::UnsupportedVersion(version));\n\n }\n\n\n\n let mut nodes = Pool::new();\n","file_path":"src/resource/fbx/document/binary.rs","rank":31,"score":157388.47615593363},{"content":"pub fn read_ascii<R>(reader: &mut R) -> Result<FbxDocument, FbxError>\n\nwhere\n\n R: Read + Seek,\n\n{\n\n let mut nodes: Pool<FbxNode> = Pool::new();\n\n let root_handle = nodes.spawn(FbxNode {\n\n name: String::from(\"__ROOT__\"),\n\n children: Vec::new(),\n\n parent: Handle::NONE,\n\n attributes: Vec::new(),\n\n });\n\n let mut parent_handle: Handle<FbxNode> = root_handle;\n\n let mut node_handle: Handle<FbxNode> = Handle::NONE;\n\n let mut buffer: Vec<u8> = Vec::new();\n\n let mut name: Vec<u8> = Vec::new();\n\n let mut value: Vec<u8> = Vec::new();\n\n\n\n let buf_len = reader.seek(SeekFrom::End(0))?;\n\n reader.seek(SeekFrom::Start(0))?;\n\n\n","file_path":"src/resource/fbx/document/ascii.rs","rank":32,"score":157388.47615593363},{"content":"fn map_texture(tex: Option<Texture>, rm: ResourceManager) -> Option<Texture> {\n\n if let Some(shallow_texture) = tex {\n\n let shallow_texture = shallow_texture.state();\n\n Some(rm.request_texture(shallow_texture.path()))\n\n } else {\n\n None\n\n }\n\n}\n\n\n\n/// A structure that holds times that specific update step took.\n\n#[derive(Copy, Clone, Default, Debug)]\n\npub struct PerformanceStatistics {\n\n /// A time (in seconds) which was required to update physics.\n\n pub physics_time: f32,\n\n\n\n /// A time (in seconds) which was required to update graph.\n\n pub graph_update_time: f32,\n\n\n\n /// A time (in seconds) which was required to update animations.\n\n pub animations_update_time: f32,\n","file_path":"src/scene/mod.rs","rank":33,"score":156988.64058102074},{"content":"#[allow(dead_code)]\n\npub fn load_with<F>(mut loadfn: F)\n\nwhere\n\n F: FnMut(&'static str) -> *const __gl_imports::raw::c_void,\n\n{\n\n ActiveShaderProgram::load_with(&mut loadfn);\n\n ActiveTexture::load_with(&mut loadfn);\n\n AttachShader::load_with(&mut loadfn);\n\n BeginConditionalRender::load_with(&mut loadfn);\n\n BeginQuery::load_with(&mut loadfn);\n\n BeginQueryIndexed::load_with(&mut loadfn);\n\n BeginTransformFeedback::load_with(&mut loadfn);\n\n BindAttribLocation::load_with(&mut loadfn);\n\n BindBuffer::load_with(&mut loadfn);\n\n BindBufferBase::load_with(&mut loadfn);\n\n BindBufferRange::load_with(&mut loadfn);\n\n BindBuffersBase::load_with(&mut loadfn);\n\n BindBuffersRange::load_with(&mut loadfn);\n\n BindFragDataLocation::load_with(&mut loadfn);\n\n BindFragDataLocationIndexed::load_with(&mut loadfn);\n\n BindFramebuffer::load_with(&mut loadfn);\n","file_path":"src/renderer/framework/gl.rs","rank":34,"score":154451.3707547838},{"content":"/// A trait for resource load error.\n\npub trait ResourceLoadError: 'static + Debug + Send + Sync {}\n\n\n\nimpl<T> ResourceLoadError for T where T: 'static + Debug + Send + Sync {}\n\n\n\n/// Resource could be in three possible states:\n\n/// 1. Pending - it is loading.\n\n/// 2. LoadError - an error has occurred during the load.\n\n/// 3. Ok - resource is fully loaded and ready to use.\n\n///\n\n/// Why it is so complex?\n\n/// Short answer: asynchronous loading.\n\n/// Long answer: when you loading a scene you expect it to be loaded as fast as\n\n/// possible, use all available power of the CPU. To achieve that each resource\n\n/// ideally should be loaded on separate core of the CPU, but since this is\n\n/// asynchronous, we must have the ability to track the state of the resource. \n\n#[derive(Debug)]\n\npub enum ResourceState<T: ResourceData, E: ResourceLoadError> {\n\n /// Resource is loading from external resource or in the queue to load.\n\n Pending {\n\n /// A path to load resource from.\n","file_path":"src/resource/mod.rs","rank":35,"score":154344.53812860537},{"content":"fn link_child_with_parent_component(\n\n parent: &mut FbxComponent,\n\n child: &mut FbxComponent,\n\n child_handle: Handle<FbxComponent>,\n\n property: String,\n\n) {\n\n match parent {\n\n // Link model with other components\n\n FbxComponent::Model(model) => match child {\n\n FbxComponent::Geometry(_) => model.geoms.push(child_handle),\n\n FbxComponent::Material(_) => model.materials.push(child_handle),\n\n FbxComponent::AnimationCurveNode(_) => model.animation_curve_nodes.push(child_handle),\n\n FbxComponent::Light(_) => model.light = child_handle,\n\n FbxComponent::Model(_) => model.children.push(child_handle),\n\n _ => (),\n\n },\n\n // Link material with textures\n\n FbxComponent::Material(material) => {\n\n if let FbxComponent::Texture(_) = child {\n\n material.textures.push((property, child_handle));\n","file_path":"src/resource/fbx/scene/mod.rs","rank":36,"score":151176.3846703524},{"content":"fn create_scene_async(resource_manager: ResourceManager) -> Arc<Mutex<SceneLoadContext>> {\n\n // Create load context - it will be shared with caller and loader threads.\n\n let context = Arc::new(Mutex::new(SceneLoadContext {\n\n data: None,\n\n message: \"Starting..\".to_string(),\n\n progress: 0.0,\n\n }));\n\n let result = context.clone();\n\n\n\n // Spawn separate thread which will create scene by loading various assets.\n\n std::thread::spawn(move || {\n\n futures::executor::block_on(async move {\n\n let mut scene = Scene::new();\n\n\n\n // It is important to lock context for short period of time so other thread can\n\n // read data from it as soon as possible - not when everything was loaded.\n\n context\n\n .lock()\n\n .unwrap()\n\n .report_progress(0.0, \"Creating camera...\");\n","file_path":"examples/async.rs","rank":37,"score":147498.11183376238},{"content":"/// Translates window mouse button into rg3d-ui mouse button.\n\npub fn translate_button(button: crate::event::MouseButton) -> crate::gui::message::MouseButton {\n\n match button {\n\n crate::event::MouseButton::Left => crate::gui::message::MouseButton::Left,\n\n crate::event::MouseButton::Right => crate::gui::message::MouseButton::Right,\n\n crate::event::MouseButton::Middle => crate::gui::message::MouseButton::Middle,\n\n crate::event::MouseButton::Other(i) => crate::gui::message::MouseButton::Other(i),\n\n }\n\n}\n\n\n","file_path":"src/utils/mod.rs","rank":38,"score":145540.02840533736},{"content":"use crate::core::algebra::{Matrix4, Vector3};\n\nuse crate::{\n\n core::pool::Handle,\n\n resource::fbx::{\n\n document::{FbxNode, FbxNodeContainer},\n\n scene::FbxComponent,\n\n },\n\n};\n\n\n\npub struct FbxModel {\n\n pub name: String,\n\n pub pre_rotation: Vector3<f32>,\n\n pub post_rotation: Vector3<f32>,\n\n pub rotation_offset: Vector3<f32>,\n\n pub rotation_pivot: Vector3<f32>,\n\n pub scaling_offset: Vector3<f32>,\n\n pub scaling_pivot: Vector3<f32>,\n\n pub rotation: Vector3<f32>,\n\n pub scale: Vector3<f32>,\n\n pub translation: Vector3<f32>,\n","file_path":"src/resource/fbx/scene/model.rs","rank":39,"score":144201.41220919508},{"content":" pub geometric_translation: Vector3<f32>,\n\n pub geometric_rotation: Vector3<f32>,\n\n pub geometric_scale: Vector3<f32>,\n\n pub inv_bind_transform: Matrix4<f32>,\n\n pub geoms: Vec<Handle<FbxComponent>>,\n\n /// List of handles of materials\n\n pub materials: Vec<Handle<FbxComponent>>,\n\n /// List of handles of animation curve nodes\n\n pub animation_curve_nodes: Vec<Handle<FbxComponent>>,\n\n /// List of handles of children models\n\n pub children: Vec<Handle<FbxComponent>>,\n\n /// Handle to light component\n\n pub light: Handle<FbxComponent>,\n\n}\n\n\n\nimpl FbxModel {\n\n pub fn read(\n\n model_node_handle: Handle<FbxNode>,\n\n nodes: &FbxNodeContainer,\n\n ) -> Result<FbxModel, String> {\n","file_path":"src/resource/fbx/scene/model.rs","rank":40,"score":144183.35573696505},{"content":" let mut name = String::from(\"Unnamed\");\n\n\n\n let model_node = nodes.get(model_node_handle);\n\n if let Ok(name_attrib) = model_node.get_attrib(1) {\n\n name = name_attrib.as_string();\n\n }\n\n\n\n // Remove prefix\n\n if name.starts_with(\"Model::\") {\n\n name = name.chars().skip(7).collect();\n\n }\n\n\n\n let mut model = FbxModel {\n\n name,\n\n pre_rotation: Vector3::default(),\n\n post_rotation: Vector3::default(),\n\n rotation_offset: Vector3::default(),\n\n rotation_pivot: Vector3::default(),\n\n scaling_offset: Vector3::default(),\n\n scaling_pivot: Vector3::default(),\n","file_path":"src/resource/fbx/scene/model.rs","rank":41,"score":144179.0840744139},{"content":" \"Lcl Translation\" => model.translation = property_node.get_vec3_at(4)?,\n\n \"Lcl Rotation\" => model.rotation = property_node.get_vec3_at(4)?,\n\n \"Lcl Scaling\" => model.scale = property_node.get_vec3_at(4)?,\n\n \"PreRotation\" => model.pre_rotation = property_node.get_vec3_at(4)?,\n\n \"PostRotation\" => model.post_rotation = property_node.get_vec3_at(4)?,\n\n \"RotationOffset\" => model.rotation_offset = property_node.get_vec3_at(4)?,\n\n \"RotationPivot\" => model.rotation_pivot = property_node.get_vec3_at(4)?,\n\n \"ScalingOffset\" => model.scaling_offset = property_node.get_vec3_at(4)?,\n\n \"ScalingPivot\" => model.scaling_pivot = property_node.get_vec3_at(4)?,\n\n \"GeometricTranslation\" => {\n\n model.geometric_translation = property_node.get_vec3_at(4)?\n\n }\n\n \"GeometricScaling\" => model.geometric_scale = property_node.get_vec3_at(4)?,\n\n \"GeometricRotation\" => model.geometric_rotation = property_node.get_vec3_at(4)?,\n\n _ => (), // Unused properties\n\n }\n\n }\n\n Ok(model)\n\n }\n\n}\n","file_path":"src/resource/fbx/scene/model.rs","rank":42,"score":144174.32934067943},{"content":" rotation: Vector3::default(),\n\n scale: Vector3::new(1.0, 1.0, 1.0),\n\n translation: Vector3::default(),\n\n geometric_translation: Vector3::default(),\n\n geometric_rotation: Vector3::default(),\n\n geometric_scale: Vector3::new(1.0, 1.0, 1.0),\n\n inv_bind_transform: Matrix4::identity(),\n\n geoms: Vec::new(),\n\n materials: Vec::new(),\n\n animation_curve_nodes: Vec::new(),\n\n children: Vec::new(),\n\n light: Handle::NONE,\n\n };\n\n\n\n let properties70_node_handle = nodes.find(model_node_handle, \"Properties70\")?;\n\n let properties70_node = nodes.get(properties70_node_handle);\n\n for property_handle in properties70_node.children() {\n\n let property_node = nodes.get(*property_handle);\n\n let name_attrib = property_node.get_attrib(0)?;\n\n match name_attrib.as_string().as_str() {\n","file_path":"src/resource/fbx/scene/model.rs","rank":43,"score":144170.56213039398},{"content":"pub fn fix_shadows_distance(mut quality: QualitySettings) -> QualitySettings {\n\n // Scale distance because game world has different scale.\n\n quality.spot_shadows_distance *= 2.0;\n\n quality.point_shadows_distance *= 2.0;\n\n quality\n\n}\n","file_path":"examples/shared/mod.rs","rank":44,"score":143965.62149013198},{"content":"/// Translates cursor icon from rg3d-ui library to glutin format.\n\npub fn translate_cursor_icon(icon: crate::gui::message::CursorIcon) -> crate::window::CursorIcon {\n\n match icon {\n\n crate::gui::message::CursorIcon::Default => crate::window::CursorIcon::Default,\n\n crate::gui::message::CursorIcon::Crosshair => crate::window::CursorIcon::Crosshair,\n\n crate::gui::message::CursorIcon::Hand => crate::window::CursorIcon::Hand,\n\n crate::gui::message::CursorIcon::Arrow => crate::window::CursorIcon::Arrow,\n\n crate::gui::message::CursorIcon::Move => crate::window::CursorIcon::Move,\n\n crate::gui::message::CursorIcon::Text => crate::window::CursorIcon::Text,\n\n crate::gui::message::CursorIcon::Wait => crate::window::CursorIcon::Wait,\n\n crate::gui::message::CursorIcon::Help => crate::window::CursorIcon::Help,\n\n crate::gui::message::CursorIcon::Progress => crate::window::CursorIcon::Progress,\n\n crate::gui::message::CursorIcon::NotAllowed => crate::window::CursorIcon::NotAllowed,\n\n crate::gui::message::CursorIcon::ContextMenu => crate::window::CursorIcon::ContextMenu,\n\n crate::gui::message::CursorIcon::Cell => crate::window::CursorIcon::Cell,\n\n crate::gui::message::CursorIcon::VerticalText => crate::window::CursorIcon::VerticalText,\n\n crate::gui::message::CursorIcon::Alias => crate::window::CursorIcon::Alias,\n\n crate::gui::message::CursorIcon::Copy => crate::window::CursorIcon::Copy,\n\n crate::gui::message::CursorIcon::NoDrop => crate::window::CursorIcon::NoDrop,\n\n crate::gui::message::CursorIcon::Grab => crate::window::CursorIcon::Grab,\n\n crate::gui::message::CursorIcon::Grabbing => crate::window::CursorIcon::Grabbing,\n","file_path":"src/utils/mod.rs","rank":45,"score":142879.99239659848},{"content":"fn is_binary<P: AsRef<Path>>(path: P) -> Result<bool, FbxError> {\n\n let mut file = File::open(path)?;\n\n let mut magic = [0; 18];\n\n file.read_exact(&mut magic)?;\n\n let fbx_magic = b\"Kaydara FBX Binary\";\n\n Ok(magic == *fbx_magic)\n\n}\n\n\n\nimpl FbxDocument {\n\n pub fn new<P: AsRef<Path>>(path: P) -> Result<FbxDocument, FbxError> {\n\n let is_bin = is_binary(path.as_ref())?;\n\n\n\n let mut reader = BufReader::new(File::open(path)?);\n\n\n\n if is_bin {\n\n binary::read_binary(&mut reader)\n\n } else {\n\n ascii::read_ascii(&mut reader)\n\n }\n\n }\n\n\n\n pub fn root(&self) -> Handle<FbxNode> {\n\n self.root\n\n }\n\n\n\n pub fn nodes(&self) -> &FbxNodeContainer {\n\n &self.nodes\n\n }\n\n}\n","file_path":"src/resource/fbx/document/mod.rs","rank":46,"score":142522.85057731115},{"content":"pub fn wrap_angle(angle: f32) -> f32 {\n\n let two_pi = 2.0 * std::f32::consts::PI;\n\n\n\n if angle > 0.0 {\n\n angle % two_pi\n\n } else {\n\n (angle + two_pi) % two_pi\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":47,"score":142511.31361246438},{"content":"fn read_attribute<R>(type_code: u8, file: &mut R) -> Result<FbxAttribute, FbxError>\n\nwhere\n\n R: Read,\n\n{\n\n match type_code {\n\n b'f' | b'F' => Ok(FbxAttribute::Float(file.read_f32::<LittleEndian>()?)),\n\n b'd' | b'D' => Ok(FbxAttribute::Double(file.read_f64::<LittleEndian>()?)),\n\n b'l' | b'L' => Ok(FbxAttribute::Long(file.read_i64::<LittleEndian>()?)),\n\n b'i' | b'I' => Ok(FbxAttribute::Integer(file.read_i32::<LittleEndian>()?)),\n\n b'Y' => Ok(FbxAttribute::Integer(i32::from(\n\n file.read_i16::<LittleEndian>()?,\n\n ))),\n\n b'b' | b'C' => Ok(FbxAttribute::Bool(file.read_u8()? != 0)),\n\n _ => Err(FbxError::UnknownAttributeType(type_code)),\n\n }\n\n}\n\n\n","file_path":"src/resource/fbx/document/binary.rs","rank":48,"score":141660.45514132158},{"content":"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\n\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\n\n}\n\n\n","file_path":"examples/scene.rs","rank":49,"score":139491.11006353947},{"content":"pub fn get_closest_point_triangles<P: PositionProvider>(\n\n points: &[P],\n\n triangles: &[TriangleDefinition],\n\n triangle_indices: &[u32],\n\n point: Vector3<f32>,\n\n) -> Option<usize> {\n\n let mut closest_sqr_distance = std::f32::MAX;\n\n let mut closest_index = None;\n\n for triangle_index in triangle_indices {\n\n let triangle = triangles.get(*triangle_index as usize).unwrap();\n\n for point_index in triangle.0.iter() {\n\n let vertex = points.get(*point_index as usize).unwrap();\n\n let sqr_distance = (vertex.position() - point).norm_squared();\n\n if sqr_distance < closest_sqr_distance {\n\n closest_sqr_distance = sqr_distance;\n\n closest_index = Some(*point_index as usize);\n\n }\n\n }\n\n }\n\n closest_index\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":50,"score":139463.90480895963},{"content":"struct GameScene {\n\n scene: Scene,\n\n pivot: Handle<Node>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n let pivot = BaseBuilder::new()\n\n .with_children(&[create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(0.0, 4.0, -8.0),\n\n &mut scene.graph,\n\n )\n\n .await])\n\n .build(&mut scene.graph);\n\n\n\n // There is no difference between scene created in rusty-editor and any other\n\n // model file, so any scene can be used directly as resource.\n\n resource_manager\n\n .request_model(\"examples/data/test_scene.rgs\")\n\n .await\n\n .unwrap()\n\n .instantiate(&mut scene)\n\n .root;\n\n\n\n GameScene { scene, pivot }\n\n}\n\n\n","file_path":"examples/scene.rs","rank":51,"score":138412.51573991135},{"content":"fn read_array<R>(type_code: u8, file: &mut R) -> Result<Vec<FbxAttribute>, FbxError>\n\nwhere\n\n R: Read,\n\n{\n\n let length = file.read_u32::<LittleEndian>()? as usize;\n\n let encoding = file.read_u32::<LittleEndian>()?;\n\n let compressed_length = file.read_u32::<LittleEndian>()? as usize;\n\n let mut array = Vec::new();\n\n\n\n if encoding == 0 {\n\n for _ in 0..length {\n\n array.push(read_attribute(type_code, file)?);\n\n }\n\n } else {\n\n let mut compressed = Vec::with_capacity(compressed_length);\n\n unsafe { compressed.set_len(compressed_length) };\n\n file.read_exact(compressed.as_mut_slice())?;\n\n let decompressed = inflate::inflate_bytes_zlib(&compressed)?;\n\n let mut cursor = Cursor::new(decompressed);\n\n for _ in 0..length {\n\n array.push(read_attribute(type_code, &mut cursor)?);\n\n }\n\n }\n\n\n\n Ok(array)\n\n}\n\n\n","file_path":"src/resource/fbx/document/binary.rs","rank":52,"score":137551.04373287823},{"content":"type ParameterContainer = HashMap<String, Parameter>;\n\n\n","file_path":"src/animation/machine/mod.rs","rank":53,"score":136482.59962735476},{"content":"pub fn get_closest_point_triangle_set<P: PositionProvider>(\n\n points: &[P],\n\n triangles: &[TriangleDefinition],\n\n point: Vector3<f32>,\n\n) -> Option<usize> {\n\n let mut closest_sqr_distance = std::f32::MAX;\n\n let mut closest_index = None;\n\n for triangle in triangles {\n\n for point_index in triangle.0.iter() {\n\n let vertex = points.get(*point_index as usize).unwrap();\n\n let sqr_distance = (vertex.position() - point).norm_squared();\n\n if sqr_distance < closest_sqr_distance {\n\n closest_sqr_distance = sqr_distance;\n\n closest_index = Some(*point_index as usize);\n\n }\n\n }\n\n }\n\n closest_index\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":54,"score":136364.71019722943},{"content":"pub fn lerpf(a: f32, b: f32, t: f32) -> f32 {\n\n a + (b - a) * t\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":55,"score":134083.6564183018},{"content":"#[allow(clippy::useless_let_if_seq)]\n\npub fn classify_plane(normal: Vector3<f32>) -> PlaneClass {\n\n let mut longest = 0.0f32;\n\n let mut class = PlaneClass::XY;\n\n\n\n if normal.x.abs() > longest {\n\n longest = normal.x.abs();\n\n class = PlaneClass::YZ;\n\n }\n\n\n\n if normal.y.abs() > longest {\n\n longest = normal.y.abs();\n\n class = PlaneClass::XZ;\n\n }\n\n\n\n if normal.z.abs() > longest {\n\n class = PlaneClass::XY;\n\n }\n\n\n\n class\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":56,"score":132908.57788313748},{"content":"pub fn barycentric_is_inside(bary: (f32, f32, f32)) -> bool {\n\n (bary.0 >= 0.0) && (bary.1 >= 0.0) && (bary.0 + bary.1 < 1.0)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":57,"score":130652.2316457876},{"content":"/// Generates a set of UV meshes.\n\npub fn generate_uv_meshes(\n\n uv_box: &UvBox,\n\n data: &mut SurfaceSharedData,\n\n) -> (Vec<UvMesh>, SurfaceDataPatch) {\n\n let mut mesh_patch = SurfaceDataPatch {\n\n data_id: data.id(),\n\n ..Default::default()\n\n };\n\n\n\n // Step 1. Split vertices at boundary between each face. This step multiplies the\n\n // number of vertices at boundary so we'll get separate texture coordinates at\n\n // seams.\n\n make_seam(\n\n data,\n\n &uv_box.px,\n\n &[&uv_box.nx, &uv_box.py, &uv_box.ny, &uv_box.pz, &uv_box.nz],\n\n &mut mesh_patch,\n\n );\n\n make_seam(\n\n data,\n","file_path":"src/utils/uvgen.rs","rank":58,"score":130183.82137204715},{"content":"pub fn create_ui(ui: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text = TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0))\n\n .with_wrap(true)\n\n .build(ui);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_bar =\n\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ui);\n\n progress_bar\n\n })\n\n .with_child({\n","file_path":"examples/shared/mod.rs","rank":59,"score":129532.71771578789},{"content":"fn main() {\n\n let event_loop = EventLoop::new();\n\n\n\n let window_builder = rg3d::window::WindowBuilder::new()\n\n .with_title(\"Example - Scene\")\n\n .with_resizable(true);\n\n\n\n let mut engine = GameEngine::new(window_builder, &event_loop, true).unwrap();\n\n\n\n // Prepare resource manager - it must be notified where to search textures. When engine\n\n // loads model resource it automatically tries to load textures it uses. But since most\n\n // model formats store absolute paths, we can't use them as direct path to load texture\n\n // instead we telling engine to search textures in given folder.\n\n engine\n\n .resource_manager\n\n .state()\n\n .set_textures_path(\"examples/data\");\n\n\n\n // Create simple user interface that will show some useful info.\n\n let debug_text = create_ui(&mut engine.user_interface.build_ctx());\n","file_path":"examples/scene.rs","rank":60,"score":129373.27924630529},{"content":"/// Generates UV map for given surface data.\n\n///\n\n/// # Performance\n\n///\n\n/// This method utilizes lots of \"brute force\" algorithms, so it is not fast as it\n\n/// could be in ideal case. It also allocates some memory for internal needs.\n\npub fn generate_uvs(data: &mut SurfaceSharedData, spacing: f32) -> SurfaceDataPatch {\n\n let uv_box = generate_uv_box(data);\n\n\n\n let (mut meshes, mut patch) = generate_uv_meshes(&uv_box, data);\n\n\n\n // Step 4. Arrange and scale all meshes on uv map so it fits into [0;1] range.\n\n let area = meshes.iter().fold(0.0, |area, mesh| area + mesh.area());\n\n let square_side = area.sqrt() + spacing * meshes.len() as f32;\n\n\n\n meshes.sort_unstable_by(|a, b| b.area().partial_cmp(&a.area()).unwrap());\n\n\n\n let mut rects = Vec::new();\n\n\n\n let twice_spacing = spacing * 2.0;\n\n\n\n // Some empiric coefficient that large enough to make size big enough for all meshes.\n\n // This should be large enough to fit all meshes, but small to prevent losing of space.\n\n // We'll use iterative approach to pack everything as tight as possible: at each iteration\n\n // scale will be increased until packer is able to pack everything.\n\n let mut empiric_scale = 1.1;\n","file_path":"src/utils/uvgen.rs","rank":61,"score":129020.80657382209},{"content":"pub fn clampf(v: f32, min: f32, max: f32) -> f32 {\n\n if v < min {\n\n min\n\n } else if v > max {\n\n max\n\n } else {\n\n v\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":62,"score":127320.91347633644},{"content":"struct GameScene {\n\n scene: Scene,\n\n camera: Handle<Node>,\n\n animations: Vec<Handle<Animation>>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n let camera = create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(0.0, 32.0, -140.0),\n\n &mut scene.graph,\n\n )\n\n .await;\n\n\n\n // Load model and animation resource in parallel. Is does *not* adds anything to\n\n // our scene - it just loads a resource then can be used later on to instantiate\n\n // models from it on scene. Why loading of resource is separated from instantiation?\n","file_path":"examples/instancing.rs","rank":63,"score":125689.48342832507},{"content":"struct GameScene {\n\n scene: Scene,\n\n camera: Handle<Node>,\n\n model_handle: Handle<Node>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n let camera = create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(0.0, 1.5, -5.0),\n\n &mut scene.graph,\n\n )\n\n .await;\n\n\n\n // Set small z far for the sake of example.\n\n scene.graph[camera].as_camera_mut().set_z_far(32.0);\n\n\n","file_path":"examples/lod.rs","rank":64,"score":125689.48342832507},{"content":"struct GameScene {\n\n scene: Scene,\n\n model_handle: Handle<Node>,\n\n walk_animation: Handle<Animation>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(0.0, 6.0, -12.0),\n\n &mut scene.graph,\n\n )\n\n .await;\n\n\n\n // Load model resource. Is does *not* adds anything to our scene - it just loads a\n\n // resource then can be used later on to instantiate models from it on scene. Why\n\n // loading of resource is separated from instantiation? Because there it is too\n","file_path":"examples/ui.rs","rank":65,"score":125689.48342832507},{"content":"struct GameScene {\n\n scene: Scene,\n\n model_handle: Handle<Node>,\n\n walk_animation: Handle<Animation>,\n\n}\n\n\n","file_path":"examples/async.rs","rank":66,"score":125689.48342832507},{"content":"struct GameScene {\n\n scene: Scene,\n\n agent: Handle<Node>,\n\n cursor: Handle<Node>,\n\n camera: Handle<Node>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n let camera = create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(4.0, 8.0, 0.0),\n\n &mut scene.graph,\n\n )\n\n .await;\n\n\n\n scene.graph[camera]\n\n .local_transform_mut()\n","file_path":"examples/navmesh.rs","rank":67,"score":125689.48342832507},{"content":"struct InputController {\n\n rotate_left: bool,\n\n rotate_right: bool,\n\n}\n\n\n","file_path":"examples/scene.rs","rank":68,"score":125689.48342832507},{"content":"struct GameScene {\n\n scene: Scene,\n\n root: Handle<Node>,\n\n}\n\n\n","file_path":"examples/lightmap.rs","rank":69,"score":125689.48342832507},{"content":"struct GameScene {\n\n scene: Scene,\n\n model_handle: Handle<Node>,\n\n walk_animation: Handle<Animation>,\n\n}\n\n\n\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\n\n let mut scene = Scene::new();\n\n\n\n // Camera is our eyes in the world - you won't see anything without it.\n\n create_camera(\n\n resource_manager.clone(),\n\n Vector3::new(0.0, 6.0, -12.0),\n\n &mut scene.graph,\n\n )\n\n .await;\n\n\n\n // Load model and animation resource in parallel. Is does *not* adds anything to\n\n // our scene - it just loads a resource then can be used later on to instantiate\n\n // models from it on scene. Why loading of resource is separated from instantiation?\n","file_path":"examples/simple.rs","rank":70,"score":125689.48342832507},{"content":"pub fn solve_quadratic(a: f32, b: f32, c: f32) -> Option<[f32; 2]> {\n\n let discriminant = b * b - 4.0 * a * c;\n\n if discriminant < 0.0 {\n\n // No real roots\n\n None\n\n } else {\n\n // Dont care if quadratic equation has only one root (discriminant == 0), this is edge-case\n\n // which requires additional branching instructions which is not good for branch-predictor in CPU.\n\n let _2a = 2.0 * a;\n\n let discr_root = discriminant.sqrt();\n\n let r1 = (-b + discr_root) / _2a;\n\n let r2 = (-b - discr_root) / _2a;\n\n Some([r1, r2])\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":71,"score":124973.0363671525},{"content":"struct PointShadowMapShader {\n\n program: GpuProgram,\n\n world_matrix: UniformLocation,\n\n bone_matrices: UniformLocation,\n\n world_view_projection_matrix: UniformLocation,\n\n use_skeletal_animation: UniformLocation,\n\n diffuse_texture: UniformLocation,\n\n light_position: UniformLocation,\n\n}\n\n\n\nimpl PointShadowMapShader {\n\n pub fn new() -> Result<Self, RendererError> {\n\n let fragment_source = include_str!(\"shaders/point_shadow_map_fs.glsl\");\n\n let vertex_source = include_str!(\"shaders/point_shadow_map_vs.glsl\");\n\n let program =\n\n GpuProgram::from_source(\"PointShadowMapShader\", vertex_source, fragment_source)?;\n\n Ok(Self {\n\n world_matrix: program.uniform_location(\"worldMatrix\")?,\n\n bone_matrices: program.uniform_location(\"boneMatrices\")?,\n\n world_view_projection_matrix: program.uniform_location(\"worldViewProjection\")?,\n","file_path":"src/renderer/shadow_map_renderer.rs","rank":72,"score":124325.96389200166},{"content":"struct SpotShadowMapShader {\n\n program: GpuProgram,\n\n bone_matrices: UniformLocation,\n\n world_view_projection_matrix: UniformLocation,\n\n use_skeletal_animation: UniformLocation,\n\n diffuse_texture: UniformLocation,\n\n}\n\n\n\nimpl SpotShadowMapShader {\n\n pub fn new() -> Result<Self, RendererError> {\n\n let fragment_source = include_str!(\"shaders/spot_shadow_map_fs.glsl\");\n\n let vertex_source = include_str!(\"shaders/spot_shadow_map_vs.glsl\");\n\n let program =\n\n GpuProgram::from_source(\"SpotShadowMapShader\", vertex_source, fragment_source)?;\n\n Ok(Self {\n\n bone_matrices: program.uniform_location(\"boneMatrices\")?,\n\n world_view_projection_matrix: program.uniform_location(\"worldViewProjection\")?,\n\n use_skeletal_animation: program.uniform_location(\"useSkeletalAnimation\")?,\n\n diffuse_texture: program.uniform_location(\"diffuseTexture\")?,\n\n\n","file_path":"src/renderer/shadow_map_renderer.rs","rank":73,"score":124325.96389200166},{"content":"#[repr(C)]\n\nstruct Vertex {\n\n position: Vector3<f32>,\n\n color: u32,\n\n}\n\n\n\n/// See module docs.\n\npub struct DebugRenderer {\n\n geometry: GeometryBuffer,\n\n vertices: Vec<Vertex>,\n\n line_indices: Vec<[u32; 2]>,\n\n shader: DebugShader,\n\n}\n\n\n\npub(in crate) struct DebugShader {\n\n program: GpuProgram,\n\n wvp_matrix: UniformLocation,\n\n}\n\n\n\nimpl DebugShader {\n\n fn new() -> Result<Self, RendererError> {\n","file_path":"src/renderer/debug_renderer.rs","rank":74,"score":122651.73835981067},{"content":"struct Profiler {\n\n start_time: std::time::Instant,\n\n samples: HashMap<ScopeMark, Sample>,\n\n scope_stack: Vec<ScopeMark>,\n\n}\n\n\n\nconst ENTRY_SCOPE_MARK: ScopeMark = ScopeMark {\n\n parent_scope_hash: 0,\n\n function_name: \"EntryPoint\",\n\n line: 0,\n\n};\n\n\n\nimpl Default for Profiler {\n\n #[inline]\n\n fn default() -> Self {\n\n let entry_sample = Sample {\n\n count: 0,\n\n time: 0.0,\n\n children: HashSet::new(),\n\n };\n\n let mut samples = HashMap::new();\n\n samples.insert(ENTRY_SCOPE_MARK, entry_sample);\n\n Self {\n\n start_time: std::time::Instant::now(),\n\n samples,\n\n scope_stack: vec![ENTRY_SCOPE_MARK],\n\n }\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":75,"score":122298.60648699576},{"content":"struct Sample {\n\n count: u64,\n\n time: f64,\n\n children: HashSet<ScopeMark>,\n\n}\n\n\n\nimpl Sample {\n\n pub fn collect(&mut self, time: f64) {\n\n self.time += time;\n\n self.count += 1;\n\n }\n\n}\n\n\n\nimpl Default for Sample {\n\n fn default() -> Self {\n\n Self {\n\n count: 0,\n\n time: 0.0,\n\n children: Default::default(),\n\n }\n\n }\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":76,"score":122298.60648699576},{"content":"///\n\n/// Converts FBX DOM to native engine representation.\n\n///\n\nfn convert(\n\n fbx_scene: &FbxScene,\n\n resource_manager: ResourceManager,\n\n scene: &mut Scene,\n\n) -> Result<(), FbxError> {\n\n let root = scene.graph.get_root();\n\n let animation_handle = scene.animations.add(Animation::default());\n\n let mut fbx_model_to_node_map = HashMap::new();\n\n for (component_handle, component) in fbx_scene.pair_iter() {\n\n if let FbxComponent::Model(model) = component {\n\n let node = convert_model(\n\n fbx_scene,\n\n model,\n\n resource_manager.clone(),\n\n &mut scene.graph,\n\n &mut scene.animations,\n\n animation_handle,\n\n )?;\n\n scene.graph.link_nodes(node, root);\n\n fbx_model_to_node_map.insert(component_handle, node);\n","file_path":"src/resource/fbx/mod.rs","rank":77,"score":122075.03623406096},{"content":"struct SceneLoadContext {\n\n data: Option<GameScene>,\n\n progress_indicator: ProgressIndicator,\n\n cancellation_token: CancellationToken,\n\n start_time: Instant,\n\n generate_lightmap: bool,\n\n}\n\n\n","file_path":"examples/lightmap.rs","rank":78,"score":121989.2867634688},{"content":"struct SceneLoadContext {\n\n data: Option<GameScene>,\n\n message: String,\n\n progress: f32,\n\n}\n\n\n\nimpl SceneLoadContext {\n\n pub fn report_progress(&mut self, progress: f32, message: &str) {\n\n self.progress = progress;\n\n self.message = message.to_owned();\n\n println!(\"Loading progress: {}% - {}\", progress * 100.0, message);\n\n }\n\n}\n\n\n","file_path":"examples/async.rs","rank":79,"score":121989.2867634688},{"content":"struct PointShadowCubeMapFace {\n\n face: CubeMapFace,\n\n look: Vector3<f32>,\n\n up: Vector3<f32>,\n\n}\n\n\n\npub(in crate) struct PointShadowMapRenderContext<'a, 'c> {\n\n pub state: &'a mut PipelineState,\n\n pub graph: &'c Graph,\n\n pub light_pos: Vector3<f32>,\n\n pub light_radius: f32,\n\n pub geom_cache: &'a mut GeometryCache,\n\n pub cascade: usize,\n\n pub batch_storage: &'a BatchStorage,\n\n}\n\n\n\nimpl PointShadowMapRenderer {\n\n pub fn new(\n\n state: &mut PipelineState,\n\n size: usize,\n","file_path":"src/renderer/shadow_map_renderer.rs","rank":80,"score":121819.17755503842},{"content":"fn create_scene_async(\n\n resource_manager: ResourceManager,\n\n generate_lightmap: bool,\n\n) -> Arc<Mutex<SceneLoadContext>> {\n\n let progress_indicator = ProgressIndicator::new();\n\n let cancellation_token = CancellationToken::new();\n\n\n\n // Create load context - it will be shared with caller and loader threads.\n\n let context = Arc::new(Mutex::new(SceneLoadContext {\n\n data: None,\n\n progress_indicator: progress_indicator.clone(),\n\n cancellation_token: cancellation_token.clone(),\n\n start_time: Instant::now(),\n\n generate_lightmap,\n\n }));\n\n let result = context.clone();\n\n\n\n // Spawn separate thread which will create scene by loading various assets.\n\n std::thread::spawn(move || {\n\n futures::executor::block_on(async move {\n","file_path":"examples/lightmap.rs","rank":81,"score":121686.96947116226},{"content":"fn read_string<R>(file: &mut R) -> Result<FbxAttribute, FbxError>\n\nwhere\n\n R: Read,\n\n{\n\n let length = file.read_u32::<LittleEndian>()? as usize;\n\n let mut raw_string = Vec::with_capacity(length);\n\n unsafe {\n\n raw_string.set_len(length);\n\n };\n\n file.read_exact(raw_string.as_mut_slice())?;\n\n // Find null terminator. It is required because for some reason some strings\n\n // have additional data after null terminator like this: Omni004\\x0\\x1Model, but\n\n // length still more than position of null terminator.\n\n if let Some(null_terminator_pos) = raw_string.iter().position(|c| *c == 0) {\n\n raw_string.truncate(null_terminator_pos);\n\n }\n\n let string = String::from_utf8(raw_string)?;\n\n Ok(FbxAttribute::String(string))\n\n}\n\n\n\nconst VERSION_7500: i32 = 7500;\n\nconst VERSION_7500_NULLREC_SIZE: usize = 25; // in bytes\n\nconst NORMAL_NULLREC_SIZE: usize = 13; // in bytes\n\n\n","file_path":"src/resource/fbx/document/binary.rs","rank":82,"score":120143.8246440484},{"content":"pub fn is_point_inside_triangle(p: &Vector3<f32>, vertices: &[Vector3<f32>; 3]) -> bool {\n\n let ba = vertices[1] - vertices[0];\n\n let ca = vertices[2] - vertices[0];\n\n let vp = *p - vertices[0];\n\n\n\n let ba_dot_ba = ba.dot(&ba);\n\n let ca_dot_ba = ca.dot(&ba);\n\n let ca_dot_ca = ca.dot(&ca);\n\n\n\n let dot02 = ca.dot(&vp);\n\n let dot12 = ba.dot(&vp);\n\n\n\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\n\n\n\n // Calculate barycentric coordinates\n\n let u = (ba_dot_ba * dot02 - ca_dot_ba * dot12) * inv_denom;\n\n let v = (ca_dot_ca * dot12 - ca_dot_ba * dot02) * inv_denom;\n\n\n\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":83,"score":120022.79513181392},{"content":"#[derive(Copy, Clone, PartialEq, Eq, Debug)]\n\nenum PathVertexState {\n\n NonVisited,\n\n Open,\n\n Closed,\n\n}\n\n\n\n/// Graph vertex that contains position in world and list of indices of neighbour\n\n/// vertices.\n\n#[derive(Clone, Debug)]\n\npub struct PathVertex {\n\n /// Position in world.\n\n pub position: Vector3<f32>,\n\n state: PathVertexState,\n\n g_score: f32,\n\n f_score: f32,\n\n parent: Option<usize>,\n\n neighbours: Vec<u32>,\n\n}\n\n\n\nimpl Default for PathVertex {\n","file_path":"src/utils/astar.rs","rank":84,"score":119370.53821829092},{"content":"#[derive(Default, Clone)]\n\nstruct SurfaceData {\n\n builder: RawMeshBuilder<Vertex>,\n\n skin_data: Vec<VertexWeightSet>,\n\n}\n\n\n","file_path":"src/resource/fbx/mod.rs","rank":85,"score":118934.30059545938},{"content":"struct UnpackedVertex {\n\n // Index of surface this vertex belongs to.\n\n surface: usize,\n\n position: Vector3<f32>,\n\n normal: Vector3<f32>,\n\n tangent: Vector3<f32>,\n\n uv: Vector2<f32>,\n\n // Set of weights for skinning.\n\n weights: Option<VertexWeightSet>,\n\n}\n\n\n\nimpl Into<Vertex> for UnpackedVertex {\n\n fn into(self) -> Vertex {\n\n Vertex {\n\n position: self.position,\n\n tex_coord: self.uv,\n\n // TODO: FBX can contain second texture coordinates so they should be\n\n // extracted when available\n\n second_tex_coord: Default::default(),\n\n normal: self.normal,\n\n tangent: Vector4::new(self.tangent.x, self.tangent.y, self.tangent.z, 1.0),\n\n // Correct values will be assigned in second pass of conversion\n\n // when all nodes will be converted.\n\n bone_weights: Default::default(),\n\n bone_indices: Default::default(),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/resource/fbx/mod.rs","rank":86,"score":118928.04968136697},{"content":"#[derive(Hash, PartialEq, Eq, Copy, Clone, Debug)]\n\nstruct ScopeMark {\n\n parent_scope_hash: u64,\n\n function_name: &'static str,\n\n line: u32,\n\n}\n\n\n","file_path":"rg3d-core/src/profiler.rs","rank":87,"score":118877.21099909807},{"content":"#[derive(Debug)]\n\nstruct Vertex {\n\n position: Vector2<f32>,\n\n prev: usize,\n\n index: usize,\n\n next: usize,\n\n}\n\n\n","file_path":"rg3d-core/src/math/triangulator.rs","rank":88,"score":118858.4576090916},{"content":"///\n\n/// Linked list of vertices\n\n///\n\nstruct Polygon {\n\n vertices: Vec<Vertex>,\n\n head: usize,\n\n tail: usize,\n\n}\n\n\n\nimpl Polygon {\n\n ///\n\n /// Excludes vertex from polygon. Does not remove it from vertices array!\n\n ///\n\n fn remove_vertex(&mut self, index: usize) {\n\n let next_index = self.vertices[index].next;\n\n let prev_index = self.vertices[index].prev;\n\n\n\n let prev = &mut self.vertices[prev_index];\n\n prev.next = next_index;\n\n\n\n let next = &mut self.vertices[next_index];\n\n next.prev = prev_index;\n\n\n","file_path":"rg3d-core/src/math/triangulator.rs","rank":89,"score":118852.12011870214},{"content":"fn convert_vertex(\n\n geom: &FbxGeometry,\n\n geometric_transform: &Matrix4<f32>,\n\n material_index: usize,\n\n index: usize,\n\n index_in_polygon: usize,\n\n skin_data: &[VertexWeightSet],\n\n) -> Result<UnpackedVertex, FbxError> {\n\n let position = *geom.vertices.get(index).ok_or(FbxError::IndexOutOfBounds)?;\n\n\n\n let normal = match geom.normals.as_ref() {\n\n Some(normals) => *normals.get(index, index_in_polygon)?,\n\n None => Vector3::y(),\n\n };\n\n\n\n let tangent = match geom.tangents.as_ref() {\n\n Some(tangents) => *tangents.get(index, index_in_polygon)?,\n\n None => Vector3::y(),\n\n };\n\n\n","file_path":"src/resource/fbx/mod.rs","rank":90,"score":118630.50749568336},{"content":"fn create_surfaces(\n\n fbx_scene: &FbxScene,\n\n data_set: Vec<SurfaceData>,\n\n resource_manager: ResourceManager,\n\n model: &FbxModel,\n\n) -> Result<Vec<Surface>, FbxError> {\n\n let mut surfaces = Vec::new();\n\n\n\n // Create surfaces per material\n\n if model.materials.is_empty() {\n\n assert_eq!(data_set.len(), 1);\n\n let data = data_set.into_iter().next().unwrap();\n\n let mut surface = Surface::new(Arc::new(RwLock::new(SurfaceSharedData::from_raw_mesh(\n\n data.builder.build(),\n\n false,\n\n ))));\n\n surface.vertex_weights = data.skin_data;\n\n surfaces.push(surface);\n\n } else {\n\n assert_eq!(data_set.len(), model.materials.len());\n","file_path":"src/resource/fbx/mod.rs","rank":91,"score":118630.50749568336},{"content":"fn convert_mesh(\n\n base: BaseBuilder,\n\n fbx_scene: &FbxScene,\n\n resource_manager: ResourceManager,\n\n model: &FbxModel,\n\n graph: &mut Graph,\n\n) -> Result<Handle<Node>, FbxError> {\n\n let geometric_transform = Matrix4::new_translation(&model.geometric_translation)\n\n * quat_from_euler(model.geometric_rotation).to_homogeneous()\n\n * Matrix4::new_nonuniform_scaling(&model.geometric_scale);\n\n\n\n let mut temp_vertices = Vec::new();\n\n let mut triangles = Vec::new();\n\n\n\n // Array for triangulation needs, it will contain triangle definitions for\n\n // triangulated polygon.\n\n let mut face_triangles = Vec::new();\n\n\n\n let mut mesh_surfaces = Vec::new();\n\n for &geom_handle in &model.geoms {\n","file_path":"src/resource/fbx/mod.rs","rank":92,"score":118630.50749568336},{"content":"fn build_recursive(\n\n nodes: &mut Pool<OctreeNode>,\n\n triangles: &[[Vector3<f32>; 3]],\n\n bounds: AxisAlignedBoundingBox,\n\n indices: Vec<u32>,\n\n split_threshold: usize,\n\n) -> Handle<OctreeNode> {\n\n if indices.len() <= split_threshold {\n\n nodes.spawn(OctreeNode::Leaf { bounds, indices })\n\n } else {\n\n let mut leaves = [Handle::NONE; 8];\n\n let leaf_bounds = split_bounds(bounds);\n\n\n\n for i in 0..8 {\n\n let mut leaf_indices = Vec::new();\n\n\n\n for index in indices.iter() {\n\n let index = *index;\n\n\n\n let triangle_bounds =\n","file_path":"rg3d-core/src/octree.rs","rank":93,"score":118554.57793301852},{"content":"pub fn triangle_area(a: Vector3<f32>, b: Vector3<f32>, c: Vector3<f32>) -> f32 {\n\n (b - a).cross(&(c - a)).norm() * 0.5\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":94,"score":118010.51679357215},{"content":"fn save(game: &mut Game) {\n\n // To save a game state all we need to do is to create new instance of Visitor\n\n // and call visit on game instance.\n\n let mut visitor = Visitor::new();\n\n game.visit(\"Game\", &mut visitor).unwrap();\n\n // And call save method.\n\n visitor.save_binary(Path::new(SAVE_FILE)).unwrap();\n\n}\n\n\n","file_path":"examples/save_load.rs","rank":95,"score":117948.5195851202},{"content":"fn load(game: &mut Game) {\n\n if Path::new(SAVE_FILE).exists() {\n\n // Loading a game is even simpler - just 2 lines.\n\n let mut visitor = Visitor::load_binary(SAVE_FILE).unwrap();\n\n game.visit(\"Game\", &mut visitor).unwrap();\n\n }\n\n}\n\n\n","file_path":"examples/save_load.rs","rank":96,"score":117948.5195851202},{"content":"pub fn spherical_to_cartesian(azimuth: f32, elevation: f32, radius: f32) -> Vector3<f32> {\n\n let x = radius * elevation.sin() * azimuth.sin();\n\n let y = radius * elevation.cos();\n\n let z = -radius * elevation.sin() * azimuth.cos();\n\n Vector3::new(x, y, z)\n\n}\n\n\n","file_path":"rg3d-core/src/math/mod.rs","rank":97,"score":117245.84530244915},{"content":"#![warn(missing_docs)]\n\n\n\n//! Resource module contains all structures and method to manage resources.\n\n\n\nuse crate::core::visitor::{Visit, VisitResult, Visitor};\n\nuse std::borrow::Cow;\n\nuse std::ops::{Deref, DerefMut};\n\nuse std::{\n\n fmt::Debug,\n\n future::Future,\n\n path::{Path, PathBuf},\n\n pin::Pin,\n\n sync::{Arc, Mutex, MutexGuard},\n\n task::{Context, Poll, Waker},\n\n};\n\n\n\npub mod fbx;\n\npub mod model;\n\npub mod texture;\n\n\n\n/// A trait for resource data.\n","file_path":"src/resource/mod.rs","rank":99,"score":57.06252764227223}],"string":"[\n {\n \"content\": \"/// Tries to load and convert FBX from given path.\\n\\n///\\n\\n/// Normally you should never use this method, use resource manager to load models.\\n\\npub fn load_to_scene<P: AsRef<Path>>(\\n\\n scene: &mut Scene,\\n\\n resource_manager: ResourceManager,\\n\\n path: P,\\n\\n) -> Result<(), FbxError> {\\n\\n let start_time = Instant::now();\\n\\n\\n\\n Log::writeln(\\n\\n MessageKind::Information,\\n\\n format!(\\\"Trying to load {:?}\\\", path.as_ref()),\\n\\n );\\n\\n\\n\\n let now = Instant::now();\\n\\n let fbx = FbxDocument::new(path.as_ref())?;\\n\\n let parsing_time = now.elapsed().as_millis();\\n\\n\\n\\n let now = Instant::now();\\n\\n let fbx_scene = FbxScene::new(&fbx)?;\\n\\n let dom_prepare_time = now.elapsed().as_millis();\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 0,\n \"score\": 239598.46693377758\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\npub fn print_hot_path() {\\n\\n println!(\\\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 1,\n \"score\": 213922.89836919578\n },\n {\n \"content\": \"/// Utility function that replaces back slashes \\\\ to forward /\\n\\n/// It replaces slashes only on windows!\\n\\npub fn replace_slashes<P: AsRef<Path>>(path: P) -> PathBuf {\\n\\n #[cfg(target_os = \\\"windows\\\")]\\n\\n {\\n\\n if path.as_ref().is_absolute() {\\n\\n // Absolute Windows paths are incompatible with other operating systems so\\n\\n // don't bother here and return existing path as owned.\\n\\n path.as_ref().to_owned()\\n\\n } else {\\n\\n // Replace all \\\\ to /. This is needed because on macos or linux \\\\ is a valid symbol in\\n\\n // file name, and not separator (except linux which understand both variants).\\n\\n let mut os_str = std::ffi::OsString::new();\\n\\n let count = path.as_ref().components().count();\\n\\n for (i, component) in path.as_ref().components().enumerate() {\\n\\n os_str.push(component.as_os_str());\\n\\n if i != count - 1 {\\n\\n os_str.push(\\\"/\\\");\\n\\n }\\n\\n }\\n\\n PathBuf::from(os_str)\\n\\n }\\n\",\n \"file_path\": \"rg3d-core/src/lib.rs\",\n \"rank\": 2,\n \"score\": 208940.62257705006\n },\n {\n \"content\": \"pub trait MessageData: 'static + Debug + Clone + PartialEq {}\\n\\n\\n\\n/// Message is basic communication element that is used to deliver information to UI nodes\\n\\n/// or to user code.\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct UiMessage<M: MessageData, C: Control<M, C>> {\\n\\n /// Useful flag to check if a message was already handled.\\n\\n handled: Cell<bool>,\\n\\n\\n\\n /// Actual message data. Use pattern matching to get type specific data.\\n\\n data: UiMessageData<M, C>,\\n\\n\\n\\n /// Handle of node that will receive message. Please note that all nodes in hierarchy will\\n\\n /// also receive this message, order is \\\"up-on-tree\\\".\\n\\n destination: Handle<UINode<M, C>>,\\n\\n\\n\\n /// Indicates the direction of the message.\\n\\n ///\\n\\n /// See [MessageDirection](enum.MessageDirection.html) for details.\\n\\n direction: MessageDirection,\\n\",\n \"file_path\": \"rg3d-ui/src/message.rs\",\n \"rank\": 3,\n \"score\": 196785.9945776297\n },\n {\n \"content\": \"pub fn create_scene_async(resource_manager: ResourceManager) -> Arc<Mutex<SceneLoadContext>> {\\n\\n // Create load context - it will be shared with caller and loader threads.\\n\\n let context = Arc::new(Mutex::new(SceneLoadContext {\\n\\n scene_data: None,\\n\\n message: \\\"Starting..\\\".to_string(),\\n\\n progress: 0.0,\\n\\n }));\\n\\n let result = context.clone();\\n\\n\\n\\n // Spawn separate thread which will create scene by loading various assets.\\n\\n std::thread::spawn(move || {\\n\\n futures::executor::block_on(async move {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Create reverb effect for more natural sound - our player walks in some sort of cathedral,\\n\\n // so there will be pretty decent echo.\\n\\n let mut base_effect = BaseEffect::default();\\n\\n // Make sure it won't be too loud - rg3d-sound doesn't care about energy conservation law, it\\n\\n // just makes requested calculation.\\n\\n base_effect.set_gain(0.7);\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 4,\n \"score\": 184637.6830728355\n },\n {\n \"content\": \"pub fn wrapf(mut n: f32, mut min_limit: f32, mut max_limit: f32) -> f32 {\\n\\n if n >= min_limit && n <= max_limit {\\n\\n return n;\\n\\n }\\n\\n\\n\\n if max_limit == 0.0 && min_limit == 0.0 {\\n\\n return 0.0;\\n\\n }\\n\\n\\n\\n max_limit -= min_limit;\\n\\n\\n\\n let offset = min_limit;\\n\\n min_limit = 0.0;\\n\\n n -= offset;\\n\\n\\n\\n let num_of_max = (n / max_limit).abs().floor();\\n\\n\\n\\n if n >= max_limit {\\n\\n n -= num_of_max * max_limit;\\n\\n } else if n < min_limit {\\n\\n n += (num_of_max + 1.0) * max_limit;\\n\\n }\\n\\n\\n\\n n + offset\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 5,\n \"score\": 181804.2041155096\n },\n {\n \"content\": \"#[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\npub fn print() {\\n\\n println!(\\\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 6,\n \"score\": 179698.25507509612\n },\n {\n \"content\": \"pub fn make_vec3_container<P: AsRef<str>>(\\n\\n nodes: &FbxNodeContainer,\\n\\n container_node: Handle<FbxNode>,\\n\\n data_name: P,\\n\\n) -> Result<FbxContainer<Vector3<f32>>, FbxError> {\\n\\n FbxContainer::new(nodes, container_node, data_name, |attributes| {\\n\\n let mut normals = Vec::with_capacity(attributes.len() / 3);\\n\\n for normal in attributes.chunks_exact(3) {\\n\\n normals.push(Vector3::new(\\n\\n normal[0].as_f32()?,\\n\\n normal[1].as_f32()?,\\n\\n normal[2].as_f32()?,\\n\\n ));\\n\\n }\\n\\n Ok(normals)\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/resource/fbx/scene/mod.rs\",\n \"rank\": 7,\n \"score\": 176965.67999311662\n },\n {\n \"content\": \"#[inline]\\n\\npub fn type_name_of<T>(_: T) -> &'static str {\\n\\n std::any::type_name::<T>()\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"enable_profiler\\\")]\\n\\n#[macro_export]\\n\\nmacro_rules! scope_profile {\\n\\n () => {\\n\\n let function_name = {\\n\\n fn scope() {}\\n\\n $crate::profiler::type_name_of(scope)\\n\\n };\\n\\n let _scope_guard = $crate::profiler::ScopeDefinition::new(function_name, line!());\\n\\n };\\n\\n}\\n\\n\\n\\n#[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\n#[macro_export]\\n\\nmacro_rules! scope_profile {\\n\\n () => {};\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 8,\n \"score\": 176960.88367800374\n },\n {\n \"content\": \"fn arc_to_raw<T>(arc: Arc<T>) -> *mut T {\\n\\n &*arc as *const T as *mut T\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/visitor.rs\",\n \"rank\": 9,\n \"score\": 172356.80836512952\n },\n {\n \"content\": \"fn rc_to_raw<T>(rc: Rc<T>) -> *mut T {\\n\\n &*rc as *const T as *mut T\\n\\n}\\n\\n\\n\\nimpl<T> Visit for Arc<T>\\n\\nwhere\\n\\n T: Default + Visit + Send + Sync + 'static,\\n\\n{\\n\\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\\n\\n visitor.enter_region(name)?;\\n\\n\\n\\n if visitor.reading {\\n\\n let mut raw = 0u64;\\n\\n raw.visit(\\\"Id\\\", visitor)?;\\n\\n if raw == 0 {\\n\\n return Err(VisitError::UnexpectedRcNullIndex);\\n\\n }\\n\\n if let Some(ptr) = visitor.arc_map.get(&raw) {\\n\\n if let Ok(res) = Arc::downcast::<T>(ptr.clone()) {\\n\\n *self = res;\\n\",\n \"file_path\": \"rg3d-core/src/visitor.rs\",\n \"rank\": 10,\n \"score\": 172356.80836512952\n },\n {\n \"content\": \"pub fn barycentric_to_world(\\n\\n bary: (f32, f32, f32),\\n\\n pa: Vector3<f32>,\\n\\n pb: Vector3<f32>,\\n\\n pc: Vector3<f32>,\\n\\n) -> Vector3<f32> {\\n\\n pa.scale(bary.0) + pb.scale(bary.1) + pc.scale(bary.2)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 11,\n \"score\": 170394.6964902355\n },\n {\n \"content\": \"///\\n\\n/// Triangulates specified polygon.\\n\\n///\\n\\npub fn triangulate(vertices: &[Vector3<f32>], out_triangles: &mut Vec<[usize; 3]>) {\\n\\n out_triangles.clear();\\n\\n if vertices.len() == 3 {\\n\\n // Triangulating a triangle?\\n\\n out_triangles.push([0, 1, 2]);\\n\\n } else if vertices.len() == 4 {\\n\\n // Special case for quadrilaterals (much faster than generic)\\n\\n let mut start_vertex = 0;\\n\\n for i in 0..4 {\\n\\n let v = vertices[i];\\n\\n let v0 = vertices[(i + 3) % 4];\\n\\n if let Some(left) = (v0 - v).try_normalize(std::f32::EPSILON) {\\n\\n let v1 = vertices[(i + 2) % 4];\\n\\n if let Some(diag) = (v1 - v).try_normalize(std::f32::EPSILON) {\\n\\n let v2 = vertices[(i + 1) % 4];\\n\\n if let Some(right) = (v2 - v).try_normalize(std::f32::EPSILON) {\\n\\n // Check for concave vertex\\n\\n let angle = left.dot(&diag).acos() + right.dot(&diag).acos();\\n\\n if angle > std::f32::consts::PI {\\n\\n start_vertex = i;\\n\",\n \"file_path\": \"rg3d-core/src/math/triangulator.rs\",\n \"rank\": 12,\n \"score\": 166563.7270581963\n },\n {\n \"content\": \"pub fn get_barycentric_coords(\\n\\n p: &Vector3<f32>,\\n\\n a: &Vector3<f32>,\\n\\n b: &Vector3<f32>,\\n\\n c: &Vector3<f32>,\\n\\n) -> (f32, f32, f32) {\\n\\n let v0 = *b - *a;\\n\\n let v1 = *c - *a;\\n\\n let v2 = *p - *a;\\n\\n\\n\\n let d00 = v0.dot(&v0);\\n\\n let d01 = v0.dot(&v1);\\n\\n let d11 = v1.dot(&v1);\\n\\n let d20 = v2.dot(&v0);\\n\\n let d21 = v2.dot(&v1);\\n\\n let denom = d00 * d11 - d01.powi(2);\\n\\n\\n\\n let v = (d11 * d20 - d01 * d21) / denom;\\n\\n let w = (d00 * d21 - d01 * d20) / denom;\\n\\n let u = 1.0 - v - w;\\n\\n\\n\\n (u, v, w)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 13,\n \"score\": 166193.8240626658\n },\n {\n \"content\": \"pub fn get_barycentric_coords_2d(\\n\\n p: Vector2<f32>,\\n\\n a: Vector2<f32>,\\n\\n b: Vector2<f32>,\\n\\n c: Vector2<f32>,\\n\\n) -> (f32, f32, f32) {\\n\\n let v0 = b - a;\\n\\n let v1 = c - a;\\n\\n let v2 = p - a;\\n\\n\\n\\n let d00 = v0.dot(&v0);\\n\\n let d01 = v0.dot(&v1);\\n\\n let d11 = v1.dot(&v1);\\n\\n let d20 = v2.dot(&v0);\\n\\n let d21 = v2.dot(&v1);\\n\\n let inv_denom = 1.0 / (d00 * d11 - d01.powi(2));\\n\\n\\n\\n let v = (d11 * d20 - d01 * d21) * inv_denom;\\n\\n let w = (d00 * d21 - d01 * d20) * inv_denom;\\n\\n let u = 1.0 - v - w;\\n\\n\\n\\n (u, v, w)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 14,\n \"score\": 166193.8240626658\n },\n {\n \"content\": \"pub fn ray_rect_intersection(\\n\\n rect: Rect<f32>,\\n\\n origin: Vector2<f32>,\\n\\n dir: Vector2<f32>,\\n\\n) -> Option<IntersectionResult> {\\n\\n let min = rect.left_top_corner();\\n\\n let max = rect.right_bottom_corner();\\n\\n\\n\\n let (mut tmin, mut tmax) = if dir.x >= 0.0 {\\n\\n ((min.x - origin.x) / dir.x, (max.x - origin.x) / dir.x)\\n\\n } else {\\n\\n ((max.x - origin.x) / dir.x, (min.x - origin.x) / dir.x)\\n\\n };\\n\\n\\n\\n let (tymin, tymax) = if dir.y >= 0.0 {\\n\\n ((min.y - origin.y) / dir.y, (max.y - origin.y) / dir.y)\\n\\n } else {\\n\\n ((max.y - origin.y) / dir.y, (min.y - origin.y) / dir.y)\\n\\n };\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 15,\n \"score\": 166193.8240626658\n },\n {\n \"content\": \"pub fn vec3_to_vec2_by_plane(\\n\\n plane_class: PlaneClass,\\n\\n normal: Vector3<f32>,\\n\\n point: Vector3<f32>,\\n\\n) -> Vector2<f32> {\\n\\n match plane_class {\\n\\n PlaneClass::XY => {\\n\\n if normal.z < 0.0 {\\n\\n Vector2::new(point.y, point.x)\\n\\n } else {\\n\\n Vector2::new(point.x, point.y)\\n\\n }\\n\\n }\\n\\n PlaneClass::XZ => {\\n\\n if normal.y < 0.0 {\\n\\n Vector2::new(point.x, point.z)\\n\\n } else {\\n\\n Vector2::new(point.z, point.x)\\n\\n }\\n\\n }\\n\\n PlaneClass::YZ => {\\n\\n if normal.x < 0.0 {\\n\\n Vector2::new(point.z, point.y)\\n\\n } else {\\n\\n Vector2::new(point.y, point.z)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 16,\n \"score\": 166193.8240626658\n },\n {\n \"content\": \"pub fn is_point_inside_2d_triangle(\\n\\n point: Vector2<f32>,\\n\\n pt_a: Vector2<f32>,\\n\\n pt_b: Vector2<f32>,\\n\\n pt_c: Vector2<f32>,\\n\\n) -> bool {\\n\\n let ba = pt_b - pt_a;\\n\\n let ca = pt_c - pt_a;\\n\\n\\n\\n let vp = point - pt_a;\\n\\n\\n\\n let ba_dot_ba = ba.dot(&ba);\\n\\n let ca_dot_ba = ca.dot(&ba);\\n\\n let ca_dot_ca = ca.dot(&ca);\\n\\n\\n\\n let dot_02 = ca.dot(&vp);\\n\\n let dot_12 = ba.dot(&vp);\\n\\n\\n\\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\\n\\n\\n\\n // calculate barycentric coordinates\\n\\n let u = (ba_dot_ba * dot_02 - ca_dot_ba * dot_12) * inv_denom;\\n\\n let v = (ca_dot_ca * dot_12 - ca_dot_ba * dot_02) * inv_denom;\\n\\n\\n\\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 17,\n \"score\": 166193.8240626658\n },\n {\n \"content\": \"fn convert_model(\\n\\n fbx_scene: &FbxScene,\\n\\n model: &FbxModel,\\n\\n resource_manager: ResourceManager,\\n\\n graph: &mut Graph,\\n\\n animations: &mut AnimationContainer,\\n\\n animation_handle: Handle<Animation>,\\n\\n) -> Result<Handle<Node>, FbxError> {\\n\\n let base = convert_model_to_base(model);\\n\\n\\n\\n // Create node with correct kind.\\n\\n let node_handle = if !model.geoms.is_empty() {\\n\\n convert_mesh(base, fbx_scene, resource_manager, model, graph)?\\n\\n } else if model.light.is_some() {\\n\\n fbx_scene.get(model.light).as_light()?.convert(base, graph)\\n\\n } else {\\n\\n base.build(graph)\\n\\n };\\n\\n\\n\\n // Convert animations\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 18,\n \"score\": 165258.8383677839\n },\n {\n \"content\": \"fn convert_model_to_base(model: &FbxModel) -> BaseBuilder {\\n\\n BaseBuilder::new()\\n\\n .with_inv_bind_pose_transform(model.inv_bind_transform)\\n\\n .with_name(model.name.as_str())\\n\\n .with_local_transform(\\n\\n TransformBuilder::new()\\n\\n .with_local_rotation(quat_from_euler(model.rotation))\\n\\n .with_local_scale(model.scale)\\n\\n .with_local_position(model.translation)\\n\\n .with_post_rotation(quat_from_euler(model.post_rotation))\\n\\n .with_pre_rotation(quat_from_euler(model.pre_rotation))\\n\\n .with_rotation_offset(model.rotation_offset)\\n\\n .with_rotation_pivot(model.rotation_pivot)\\n\\n .with_scaling_offset(model.scaling_offset)\\n\\n .with_scaling_pivot(model.scaling_pivot)\\n\\n .build(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 19,\n \"score\": 165015.52543294433\n },\n {\n \"content\": \"/// A trait for resource data.\\n\\npub trait ResourceData: 'static + Default + Debug + Visit + Send {\\n\\n /// Returns path of resource data.\\n\\n fn path(&self) -> Cow<Path>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/mod.rs\",\n \"rank\": 20,\n \"score\": 161771.4287768079\n },\n {\n \"content\": \"/// Performs hashing of a sized value by interpreting it as raw memory.\\n\\npub fn hash_as_bytes<T: Sized, H: Hasher>(value: &T, hasher: &mut H) {\\n\\n unsafe {\\n\\n hasher.write(std::slice::from_raw_parts(\\n\\n value as *const T as *const u8,\\n\\n std::mem::size_of::<T>(),\\n\\n ))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 21,\n \"score\": 161297.23821385356\n },\n {\n \"content\": \"fn read_tangents(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Option<FbxContainer<Vector3<f32>>>, FbxError> {\\n\\n if let Ok(layer_element_tangent) = nodes.find(geom_node_handle, \\\"LayerElementTangent\\\") {\\n\\n Ok(Some(scene::make_vec3_container(\\n\\n nodes,\\n\\n layer_element_tangent,\\n\\n \\\"Tangents\\\",\\n\\n )?))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 22,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"fn read_normals(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Option<FbxContainer<Vector3<f32>>>, FbxError> {\\n\\n if let Ok(layer_element_normal) = nodes.find(geom_node_handle, \\\"LayerElementNormal\\\") {\\n\\n Ok(Some(scene::make_vec3_container(\\n\\n nodes,\\n\\n layer_element_normal,\\n\\n \\\"Normals\\\",\\n\\n )?))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 23,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"fn read_binormals(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Option<FbxContainer<Vector3<f32>>>, FbxError> {\\n\\n if let Ok(layer_element_tangent) = nodes.find(geom_node_handle, \\\"LayerElementBinormal\\\") {\\n\\n Ok(Some(scene::make_vec3_container(\\n\\n nodes,\\n\\n layer_element_tangent,\\n\\n \\\"Binormals\\\",\\n\\n )?))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 24,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"fn read_uvs(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Option<FbxContainer<Vector2<f32>>>, FbxError> {\\n\\n if let Ok(layer_element_uv) = nodes.find(geom_node_handle, \\\"LayerElementUV\\\") {\\n\\n Ok(Some(FbxContainer::new(\\n\\n nodes,\\n\\n layer_element_uv,\\n\\n \\\"UV\\\",\\n\\n |attributes| {\\n\\n let mut uvs = Vec::with_capacity(attributes.len() / 2);\\n\\n for uv in attributes.chunks_exact(2) {\\n\\n uvs.push(Vector2::new(uv[0].as_f32()?, uv[1].as_f32()?));\\n\\n }\\n\\n Ok(uvs)\\n\\n },\\n\\n )?))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 25,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"fn read_vertices(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Vec<Vector3<f32>>, FbxError> {\\n\\n let vertices_node_handle = nodes.find(geom_node_handle, \\\"Vertices\\\")?;\\n\\n let vertices_array_node = nodes.get_by_name(vertices_node_handle, \\\"a\\\")?;\\n\\n let mut vertices = Vec::with_capacity(vertices_array_node.attrib_count() / 3);\\n\\n for vertex in vertices_array_node.attributes().chunks_exact(3) {\\n\\n vertices.push(Vector3::new(\\n\\n vertex[0].as_f32()?,\\n\\n vertex[1].as_f32()?,\\n\\n vertex[2].as_f32()?,\\n\\n ));\\n\\n }\\n\\n\\n\\n Ok(vertices)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 26,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"fn read_indices(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Vec<i32>, FbxError> {\\n\\n let indices_node_handle = nodes.find(geom_node_handle, \\\"PolygonVertexIndex\\\")?;\\n\\n let indices_array_node = nodes.get_by_name(indices_node_handle, \\\"a\\\")?;\\n\\n let mut indices = Vec::with_capacity(indices_array_node.attrib_count());\\n\\n for index in indices_array_node.attributes() {\\n\\n indices.push(index.as_i32()?);\\n\\n }\\n\\n Ok(indices)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 27,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"fn read_materials(\\n\\n geom_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n) -> Result<Option<FbxContainer<i32>>, FbxError> {\\n\\n if let Ok(layer_element_material_node_handle) =\\n\\n nodes.find(geom_node_handle, \\\"LayerElementMaterial\\\")\\n\\n {\\n\\n Ok(Some(FbxContainer::new(\\n\\n nodes,\\n\\n layer_element_material_node_handle,\\n\\n \\\"Materials\\\",\\n\\n |attributes| {\\n\\n let mut materials = Vec::with_capacity(attributes.len());\\n\\n for attribute in attributes {\\n\\n materials.push(attribute.as_i32()?);\\n\\n }\\n\\n Ok(materials)\\n\\n },\\n\\n )?))\\n\\n } else {\\n\",\n \"file_path\": \"src/resource/fbx/scene/geometry.rs\",\n \"rank\": 28,\n \"score\": 159837.96518402782\n },\n {\n \"content\": \"pub trait Visit {\\n\\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult;\\n\\n}\\n\\n\\n\\nimpl Default for Visitor {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Visitor {\\n\\n const MAGIC: &'static str = \\\"RG3D\\\";\\n\\n\\n\\n pub fn new() -> Self {\\n\\n let mut nodes = Pool::new();\\n\\n let root = nodes.spawn(Node::new(\\\"__ROOT__\\\", Handle::NONE));\\n\\n Self {\\n\\n nodes,\\n\\n rc_map: HashMap::new(),\\n\\n arc_map: HashMap::new(),\\n\",\n \"file_path\": \"rg3d-core/src/visitor.rs\",\n \"rank\": 29,\n \"score\": 159697.12956729977\n },\n {\n \"content\": \"fn calculate_hash<T: Hash>(t: &T) -> u64 {\\n\\n let mut s = DefaultHasher::new();\\n\\n t.hash(&mut s);\\n\\n s.finish()\\n\\n}\\n\\n\\n\\nimpl Profiler {\\n\\n fn enter_scope(&mut self, scope: &mut ScopeMark) {\\n\\n let parent_scope_mark = *self.scope_stack.last().unwrap();\\n\\n scope.parent_scope_hash = calculate_hash(&parent_scope_mark);\\n\\n self.scope_stack.push(*scope);\\n\\n self.samples.entry(*scope).or_default();\\n\\n self.samples\\n\\n .get_mut(&parent_scope_mark)\\n\\n .unwrap()\\n\\n .children\\n\\n .insert(*scope);\\n\\n }\\n\\n\\n\\n fn leave_scope(&mut self, scope: ScopeMark, elapsed: f64) {\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 30,\n \"score\": 157810.07257685097\n },\n {\n \"content\": \"pub fn read_binary<R>(file: &mut R) -> Result<FbxDocument, FbxError>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n{\\n\\n let total_length = file.seek(SeekFrom::End(0))?;\\n\\n file.seek(SeekFrom::Start(0))?;\\n\\n\\n\\n // Ignore all stuff until version.\\n\\n let mut temp = [0; 23];\\n\\n file.read_exact(&mut temp)?;\\n\\n\\n\\n // Verify version.\\n\\n let version = file.read_u32::<LittleEndian>()? as i32;\\n\\n\\n\\n // Anything else should be supported.\\n\\n if version < 7100 {\\n\\n return Err(FbxError::UnsupportedVersion(version));\\n\\n }\\n\\n\\n\\n let mut nodes = Pool::new();\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 31,\n \"score\": 157388.47615593363\n },\n {\n \"content\": \"pub fn read_ascii<R>(reader: &mut R) -> Result<FbxDocument, FbxError>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n{\\n\\n let mut nodes: Pool<FbxNode> = Pool::new();\\n\\n let root_handle = nodes.spawn(FbxNode {\\n\\n name: String::from(\\\"__ROOT__\\\"),\\n\\n children: Vec::new(),\\n\\n parent: Handle::NONE,\\n\\n attributes: Vec::new(),\\n\\n });\\n\\n let mut parent_handle: Handle<FbxNode> = root_handle;\\n\\n let mut node_handle: Handle<FbxNode> = Handle::NONE;\\n\\n let mut buffer: Vec<u8> = Vec::new();\\n\\n let mut name: Vec<u8> = Vec::new();\\n\\n let mut value: Vec<u8> = Vec::new();\\n\\n\\n\\n let buf_len = reader.seek(SeekFrom::End(0))?;\\n\\n reader.seek(SeekFrom::Start(0))?;\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/ascii.rs\",\n \"rank\": 32,\n \"score\": 157388.47615593363\n },\n {\n \"content\": \"fn map_texture(tex: Option<Texture>, rm: ResourceManager) -> Option<Texture> {\\n\\n if let Some(shallow_texture) = tex {\\n\\n let shallow_texture = shallow_texture.state();\\n\\n Some(rm.request_texture(shallow_texture.path()))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\n/// A structure that holds times that specific update step took.\\n\\n#[derive(Copy, Clone, Default, Debug)]\\n\\npub struct PerformanceStatistics {\\n\\n /// A time (in seconds) which was required to update physics.\\n\\n pub physics_time: f32,\\n\\n\\n\\n /// A time (in seconds) which was required to update graph.\\n\\n pub graph_update_time: f32,\\n\\n\\n\\n /// A time (in seconds) which was required to update animations.\\n\\n pub animations_update_time: f32,\\n\",\n \"file_path\": \"src/scene/mod.rs\",\n \"rank\": 33,\n \"score\": 156988.64058102074\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn load_with<F>(mut loadfn: F)\\n\\nwhere\\n\\n F: FnMut(&'static str) -> *const __gl_imports::raw::c_void,\\n\\n{\\n\\n ActiveShaderProgram::load_with(&mut loadfn);\\n\\n ActiveTexture::load_with(&mut loadfn);\\n\\n AttachShader::load_with(&mut loadfn);\\n\\n BeginConditionalRender::load_with(&mut loadfn);\\n\\n BeginQuery::load_with(&mut loadfn);\\n\\n BeginQueryIndexed::load_with(&mut loadfn);\\n\\n BeginTransformFeedback::load_with(&mut loadfn);\\n\\n BindAttribLocation::load_with(&mut loadfn);\\n\\n BindBuffer::load_with(&mut loadfn);\\n\\n BindBufferBase::load_with(&mut loadfn);\\n\\n BindBufferRange::load_with(&mut loadfn);\\n\\n BindBuffersBase::load_with(&mut loadfn);\\n\\n BindBuffersRange::load_with(&mut loadfn);\\n\\n BindFragDataLocation::load_with(&mut loadfn);\\n\\n BindFragDataLocationIndexed::load_with(&mut loadfn);\\n\\n BindFramebuffer::load_with(&mut loadfn);\\n\",\n \"file_path\": \"src/renderer/framework/gl.rs\",\n \"rank\": 34,\n \"score\": 154451.3707547838\n },\n {\n \"content\": \"/// A trait for resource load error.\\n\\npub trait ResourceLoadError: 'static + Debug + Send + Sync {}\\n\\n\\n\\nimpl<T> ResourceLoadError for T where T: 'static + Debug + Send + Sync {}\\n\\n\\n\\n/// Resource could be in three possible states:\\n\\n/// 1. Pending - it is loading.\\n\\n/// 2. LoadError - an error has occurred during the load.\\n\\n/// 3. Ok - resource is fully loaded and ready to use.\\n\\n///\\n\\n/// Why it is so complex?\\n\\n/// Short answer: asynchronous loading.\\n\\n/// Long answer: when you loading a scene you expect it to be loaded as fast as\\n\\n/// possible, use all available power of the CPU. To achieve that each resource\\n\\n/// ideally should be loaded on separate core of the CPU, but since this is\\n\\n/// asynchronous, we must have the ability to track the state of the resource. \\n\\n#[derive(Debug)]\\n\\npub enum ResourceState<T: ResourceData, E: ResourceLoadError> {\\n\\n /// Resource is loading from external resource or in the queue to load.\\n\\n Pending {\\n\\n /// A path to load resource from.\\n\",\n \"file_path\": \"src/resource/mod.rs\",\n \"rank\": 35,\n \"score\": 154344.53812860537\n },\n {\n \"content\": \"fn link_child_with_parent_component(\\n\\n parent: &mut FbxComponent,\\n\\n child: &mut FbxComponent,\\n\\n child_handle: Handle<FbxComponent>,\\n\\n property: String,\\n\\n) {\\n\\n match parent {\\n\\n // Link model with other components\\n\\n FbxComponent::Model(model) => match child {\\n\\n FbxComponent::Geometry(_) => model.geoms.push(child_handle),\\n\\n FbxComponent::Material(_) => model.materials.push(child_handle),\\n\\n FbxComponent::AnimationCurveNode(_) => model.animation_curve_nodes.push(child_handle),\\n\\n FbxComponent::Light(_) => model.light = child_handle,\\n\\n FbxComponent::Model(_) => model.children.push(child_handle),\\n\\n _ => (),\\n\\n },\\n\\n // Link material with textures\\n\\n FbxComponent::Material(material) => {\\n\\n if let FbxComponent::Texture(_) = child {\\n\\n material.textures.push((property, child_handle));\\n\",\n \"file_path\": \"src/resource/fbx/scene/mod.rs\",\n \"rank\": 36,\n \"score\": 151176.3846703524\n },\n {\n \"content\": \"fn create_scene_async(resource_manager: ResourceManager) -> Arc<Mutex<SceneLoadContext>> {\\n\\n // Create load context - it will be shared with caller and loader threads.\\n\\n let context = Arc::new(Mutex::new(SceneLoadContext {\\n\\n data: None,\\n\\n message: \\\"Starting..\\\".to_string(),\\n\\n progress: 0.0,\\n\\n }));\\n\\n let result = context.clone();\\n\\n\\n\\n // Spawn separate thread which will create scene by loading various assets.\\n\\n std::thread::spawn(move || {\\n\\n futures::executor::block_on(async move {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // It is important to lock context for short period of time so other thread can\\n\\n // read data from it as soon as possible - not when everything was loaded.\\n\\n context\\n\\n .lock()\\n\\n .unwrap()\\n\\n .report_progress(0.0, \\\"Creating camera...\\\");\\n\",\n \"file_path\": \"examples/async.rs\",\n \"rank\": 37,\n \"score\": 147498.11183376238\n },\n {\n \"content\": \"/// Translates window mouse button into rg3d-ui mouse button.\\n\\npub fn translate_button(button: crate::event::MouseButton) -> crate::gui::message::MouseButton {\\n\\n match button {\\n\\n crate::event::MouseButton::Left => crate::gui::message::MouseButton::Left,\\n\\n crate::event::MouseButton::Right => crate::gui::message::MouseButton::Right,\\n\\n crate::event::MouseButton::Middle => crate::gui::message::MouseButton::Middle,\\n\\n crate::event::MouseButton::Other(i) => crate::gui::message::MouseButton::Other(i),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 38,\n \"score\": 145540.02840533736\n },\n {\n \"content\": \"use crate::core::algebra::{Matrix4, Vector3};\\n\\nuse crate::{\\n\\n core::pool::Handle,\\n\\n resource::fbx::{\\n\\n document::{FbxNode, FbxNodeContainer},\\n\\n scene::FbxComponent,\\n\\n },\\n\\n};\\n\\n\\n\\npub struct FbxModel {\\n\\n pub name: String,\\n\\n pub pre_rotation: Vector3<f32>,\\n\\n pub post_rotation: Vector3<f32>,\\n\\n pub rotation_offset: Vector3<f32>,\\n\\n pub rotation_pivot: Vector3<f32>,\\n\\n pub scaling_offset: Vector3<f32>,\\n\\n pub scaling_pivot: Vector3<f32>,\\n\\n pub rotation: Vector3<f32>,\\n\\n pub scale: Vector3<f32>,\\n\\n pub translation: Vector3<f32>,\\n\",\n \"file_path\": \"src/resource/fbx/scene/model.rs\",\n \"rank\": 39,\n \"score\": 144201.41220919508\n },\n {\n \"content\": \" pub geometric_translation: Vector3<f32>,\\n\\n pub geometric_rotation: Vector3<f32>,\\n\\n pub geometric_scale: Vector3<f32>,\\n\\n pub inv_bind_transform: Matrix4<f32>,\\n\\n pub geoms: Vec<Handle<FbxComponent>>,\\n\\n /// List of handles of materials\\n\\n pub materials: Vec<Handle<FbxComponent>>,\\n\\n /// List of handles of animation curve nodes\\n\\n pub animation_curve_nodes: Vec<Handle<FbxComponent>>,\\n\\n /// List of handles of children models\\n\\n pub children: Vec<Handle<FbxComponent>>,\\n\\n /// Handle to light component\\n\\n pub light: Handle<FbxComponent>,\\n\\n}\\n\\n\\n\\nimpl FbxModel {\\n\\n pub fn read(\\n\\n model_node_handle: Handle<FbxNode>,\\n\\n nodes: &FbxNodeContainer,\\n\\n ) -> Result<FbxModel, String> {\\n\",\n \"file_path\": \"src/resource/fbx/scene/model.rs\",\n \"rank\": 40,\n \"score\": 144183.35573696505\n },\n {\n \"content\": \" let mut name = String::from(\\\"Unnamed\\\");\\n\\n\\n\\n let model_node = nodes.get(model_node_handle);\\n\\n if let Ok(name_attrib) = model_node.get_attrib(1) {\\n\\n name = name_attrib.as_string();\\n\\n }\\n\\n\\n\\n // Remove prefix\\n\\n if name.starts_with(\\\"Model::\\\") {\\n\\n name = name.chars().skip(7).collect();\\n\\n }\\n\\n\\n\\n let mut model = FbxModel {\\n\\n name,\\n\\n pre_rotation: Vector3::default(),\\n\\n post_rotation: Vector3::default(),\\n\\n rotation_offset: Vector3::default(),\\n\\n rotation_pivot: Vector3::default(),\\n\\n scaling_offset: Vector3::default(),\\n\\n scaling_pivot: Vector3::default(),\\n\",\n \"file_path\": \"src/resource/fbx/scene/model.rs\",\n \"rank\": 41,\n \"score\": 144179.0840744139\n },\n {\n \"content\": \" \\\"Lcl Translation\\\" => model.translation = property_node.get_vec3_at(4)?,\\n\\n \\\"Lcl Rotation\\\" => model.rotation = property_node.get_vec3_at(4)?,\\n\\n \\\"Lcl Scaling\\\" => model.scale = property_node.get_vec3_at(4)?,\\n\\n \\\"PreRotation\\\" => model.pre_rotation = property_node.get_vec3_at(4)?,\\n\\n \\\"PostRotation\\\" => model.post_rotation = property_node.get_vec3_at(4)?,\\n\\n \\\"RotationOffset\\\" => model.rotation_offset = property_node.get_vec3_at(4)?,\\n\\n \\\"RotationPivot\\\" => model.rotation_pivot = property_node.get_vec3_at(4)?,\\n\\n \\\"ScalingOffset\\\" => model.scaling_offset = property_node.get_vec3_at(4)?,\\n\\n \\\"ScalingPivot\\\" => model.scaling_pivot = property_node.get_vec3_at(4)?,\\n\\n \\\"GeometricTranslation\\\" => {\\n\\n model.geometric_translation = property_node.get_vec3_at(4)?\\n\\n }\\n\\n \\\"GeometricScaling\\\" => model.geometric_scale = property_node.get_vec3_at(4)?,\\n\\n \\\"GeometricRotation\\\" => model.geometric_rotation = property_node.get_vec3_at(4)?,\\n\\n _ => (), // Unused properties\\n\\n }\\n\\n }\\n\\n Ok(model)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/resource/fbx/scene/model.rs\",\n \"rank\": 42,\n \"score\": 144174.32934067943\n },\n {\n \"content\": \" rotation: Vector3::default(),\\n\\n scale: Vector3::new(1.0, 1.0, 1.0),\\n\\n translation: Vector3::default(),\\n\\n geometric_translation: Vector3::default(),\\n\\n geometric_rotation: Vector3::default(),\\n\\n geometric_scale: Vector3::new(1.0, 1.0, 1.0),\\n\\n inv_bind_transform: Matrix4::identity(),\\n\\n geoms: Vec::new(),\\n\\n materials: Vec::new(),\\n\\n animation_curve_nodes: Vec::new(),\\n\\n children: Vec::new(),\\n\\n light: Handle::NONE,\\n\\n };\\n\\n\\n\\n let properties70_node_handle = nodes.find(model_node_handle, \\\"Properties70\\\")?;\\n\\n let properties70_node = nodes.get(properties70_node_handle);\\n\\n for property_handle in properties70_node.children() {\\n\\n let property_node = nodes.get(*property_handle);\\n\\n let name_attrib = property_node.get_attrib(0)?;\\n\\n match name_attrib.as_string().as_str() {\\n\",\n \"file_path\": \"src/resource/fbx/scene/model.rs\",\n \"rank\": 43,\n \"score\": 144170.56213039398\n },\n {\n \"content\": \"pub fn fix_shadows_distance(mut quality: QualitySettings) -> QualitySettings {\\n\\n // Scale distance because game world has different scale.\\n\\n quality.spot_shadows_distance *= 2.0;\\n\\n quality.point_shadows_distance *= 2.0;\\n\\n quality\\n\\n}\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 44,\n \"score\": 143965.62149013198\n },\n {\n \"content\": \"/// Translates cursor icon from rg3d-ui library to glutin format.\\n\\npub fn translate_cursor_icon(icon: crate::gui::message::CursorIcon) -> crate::window::CursorIcon {\\n\\n match icon {\\n\\n crate::gui::message::CursorIcon::Default => crate::window::CursorIcon::Default,\\n\\n crate::gui::message::CursorIcon::Crosshair => crate::window::CursorIcon::Crosshair,\\n\\n crate::gui::message::CursorIcon::Hand => crate::window::CursorIcon::Hand,\\n\\n crate::gui::message::CursorIcon::Arrow => crate::window::CursorIcon::Arrow,\\n\\n crate::gui::message::CursorIcon::Move => crate::window::CursorIcon::Move,\\n\\n crate::gui::message::CursorIcon::Text => crate::window::CursorIcon::Text,\\n\\n crate::gui::message::CursorIcon::Wait => crate::window::CursorIcon::Wait,\\n\\n crate::gui::message::CursorIcon::Help => crate::window::CursorIcon::Help,\\n\\n crate::gui::message::CursorIcon::Progress => crate::window::CursorIcon::Progress,\\n\\n crate::gui::message::CursorIcon::NotAllowed => crate::window::CursorIcon::NotAllowed,\\n\\n crate::gui::message::CursorIcon::ContextMenu => crate::window::CursorIcon::ContextMenu,\\n\\n crate::gui::message::CursorIcon::Cell => crate::window::CursorIcon::Cell,\\n\\n crate::gui::message::CursorIcon::VerticalText => crate::window::CursorIcon::VerticalText,\\n\\n crate::gui::message::CursorIcon::Alias => crate::window::CursorIcon::Alias,\\n\\n crate::gui::message::CursorIcon::Copy => crate::window::CursorIcon::Copy,\\n\\n crate::gui::message::CursorIcon::NoDrop => crate::window::CursorIcon::NoDrop,\\n\\n crate::gui::message::CursorIcon::Grab => crate::window::CursorIcon::Grab,\\n\\n crate::gui::message::CursorIcon::Grabbing => crate::window::CursorIcon::Grabbing,\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 45,\n \"score\": 142879.99239659848\n },\n {\n \"content\": \"fn is_binary<P: AsRef<Path>>(path: P) -> Result<bool, FbxError> {\\n\\n let mut file = File::open(path)?;\\n\\n let mut magic = [0; 18];\\n\\n file.read_exact(&mut magic)?;\\n\\n let fbx_magic = b\\\"Kaydara FBX Binary\\\";\\n\\n Ok(magic == *fbx_magic)\\n\\n}\\n\\n\\n\\nimpl FbxDocument {\\n\\n pub fn new<P: AsRef<Path>>(path: P) -> Result<FbxDocument, FbxError> {\\n\\n let is_bin = is_binary(path.as_ref())?;\\n\\n\\n\\n let mut reader = BufReader::new(File::open(path)?);\\n\\n\\n\\n if is_bin {\\n\\n binary::read_binary(&mut reader)\\n\\n } else {\\n\\n ascii::read_ascii(&mut reader)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn root(&self) -> Handle<FbxNode> {\\n\\n self.root\\n\\n }\\n\\n\\n\\n pub fn nodes(&self) -> &FbxNodeContainer {\\n\\n &self.nodes\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/resource/fbx/document/mod.rs\",\n \"rank\": 46,\n \"score\": 142522.85057731115\n },\n {\n \"content\": \"pub fn wrap_angle(angle: f32) -> f32 {\\n\\n let two_pi = 2.0 * std::f32::consts::PI;\\n\\n\\n\\n if angle > 0.0 {\\n\\n angle % two_pi\\n\\n } else {\\n\\n (angle + two_pi) % two_pi\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 47,\n \"score\": 142511.31361246438\n },\n {\n \"content\": \"fn read_attribute<R>(type_code: u8, file: &mut R) -> Result<FbxAttribute, FbxError>\\n\\nwhere\\n\\n R: Read,\\n\\n{\\n\\n match type_code {\\n\\n b'f' | b'F' => Ok(FbxAttribute::Float(file.read_f32::<LittleEndian>()?)),\\n\\n b'd' | b'D' => Ok(FbxAttribute::Double(file.read_f64::<LittleEndian>()?)),\\n\\n b'l' | b'L' => Ok(FbxAttribute::Long(file.read_i64::<LittleEndian>()?)),\\n\\n b'i' | b'I' => Ok(FbxAttribute::Integer(file.read_i32::<LittleEndian>()?)),\\n\\n b'Y' => Ok(FbxAttribute::Integer(i32::from(\\n\\n file.read_i16::<LittleEndian>()?,\\n\\n ))),\\n\\n b'b' | b'C' => Ok(FbxAttribute::Bool(file.read_u8()? != 0)),\\n\\n _ => Err(FbxError::UnknownAttributeType(type_code)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 48,\n \"score\": 141660.45514132158\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext) -> Handle<UiNode> {\\n\\n TextBuilder::new(WidgetBuilder::new()).build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scene.rs\",\n \"rank\": 49,\n \"score\": 139491.11006353947\n },\n {\n \"content\": \"pub fn get_closest_point_triangles<P: PositionProvider>(\\n\\n points: &[P],\\n\\n triangles: &[TriangleDefinition],\\n\\n triangle_indices: &[u32],\\n\\n point: Vector3<f32>,\\n\\n) -> Option<usize> {\\n\\n let mut closest_sqr_distance = std::f32::MAX;\\n\\n let mut closest_index = None;\\n\\n for triangle_index in triangle_indices {\\n\\n let triangle = triangles.get(*triangle_index as usize).unwrap();\\n\\n for point_index in triangle.0.iter() {\\n\\n let vertex = points.get(*point_index as usize).unwrap();\\n\\n let sqr_distance = (vertex.position() - point).norm_squared();\\n\\n if sqr_distance < closest_sqr_distance {\\n\\n closest_sqr_distance = sqr_distance;\\n\\n closest_index = Some(*point_index as usize);\\n\\n }\\n\\n }\\n\\n }\\n\\n closest_index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 50,\n \"score\": 139463.90480895963\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n pivot: Handle<Node>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n let pivot = BaseBuilder::new()\\n\\n .with_children(&[create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(0.0, 4.0, -8.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await])\\n\\n .build(&mut scene.graph);\\n\\n\\n\\n // There is no difference between scene created in rusty-editor and any other\\n\\n // model file, so any scene can be used directly as resource.\\n\\n resource_manager\\n\\n .request_model(\\\"examples/data/test_scene.rgs\\\")\\n\\n .await\\n\\n .unwrap()\\n\\n .instantiate(&mut scene)\\n\\n .root;\\n\\n\\n\\n GameScene { scene, pivot }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scene.rs\",\n \"rank\": 51,\n \"score\": 138412.51573991135\n },\n {\n \"content\": \"fn read_array<R>(type_code: u8, file: &mut R) -> Result<Vec<FbxAttribute>, FbxError>\\n\\nwhere\\n\\n R: Read,\\n\\n{\\n\\n let length = file.read_u32::<LittleEndian>()? as usize;\\n\\n let encoding = file.read_u32::<LittleEndian>()?;\\n\\n let compressed_length = file.read_u32::<LittleEndian>()? as usize;\\n\\n let mut array = Vec::new();\\n\\n\\n\\n if encoding == 0 {\\n\\n for _ in 0..length {\\n\\n array.push(read_attribute(type_code, file)?);\\n\\n }\\n\\n } else {\\n\\n let mut compressed = Vec::with_capacity(compressed_length);\\n\\n unsafe { compressed.set_len(compressed_length) };\\n\\n file.read_exact(compressed.as_mut_slice())?;\\n\\n let decompressed = inflate::inflate_bytes_zlib(&compressed)?;\\n\\n let mut cursor = Cursor::new(decompressed);\\n\\n for _ in 0..length {\\n\\n array.push(read_attribute(type_code, &mut cursor)?);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(array)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 52,\n \"score\": 137551.04373287823\n },\n {\n \"content\": \"type ParameterContainer = HashMap<String, Parameter>;\\n\\n\\n\",\n \"file_path\": \"src/animation/machine/mod.rs\",\n \"rank\": 53,\n \"score\": 136482.59962735476\n },\n {\n \"content\": \"pub fn get_closest_point_triangle_set<P: PositionProvider>(\\n\\n points: &[P],\\n\\n triangles: &[TriangleDefinition],\\n\\n point: Vector3<f32>,\\n\\n) -> Option<usize> {\\n\\n let mut closest_sqr_distance = std::f32::MAX;\\n\\n let mut closest_index = None;\\n\\n for triangle in triangles {\\n\\n for point_index in triangle.0.iter() {\\n\\n let vertex = points.get(*point_index as usize).unwrap();\\n\\n let sqr_distance = (vertex.position() - point).norm_squared();\\n\\n if sqr_distance < closest_sqr_distance {\\n\\n closest_sqr_distance = sqr_distance;\\n\\n closest_index = Some(*point_index as usize);\\n\\n }\\n\\n }\\n\\n }\\n\\n closest_index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 54,\n \"score\": 136364.71019722943\n },\n {\n \"content\": \"pub fn lerpf(a: f32, b: f32, t: f32) -> f32 {\\n\\n a + (b - a) * t\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 55,\n \"score\": 134083.6564183018\n },\n {\n \"content\": \"#[allow(clippy::useless_let_if_seq)]\\n\\npub fn classify_plane(normal: Vector3<f32>) -> PlaneClass {\\n\\n let mut longest = 0.0f32;\\n\\n let mut class = PlaneClass::XY;\\n\\n\\n\\n if normal.x.abs() > longest {\\n\\n longest = normal.x.abs();\\n\\n class = PlaneClass::YZ;\\n\\n }\\n\\n\\n\\n if normal.y.abs() > longest {\\n\\n longest = normal.y.abs();\\n\\n class = PlaneClass::XZ;\\n\\n }\\n\\n\\n\\n if normal.z.abs() > longest {\\n\\n class = PlaneClass::XY;\\n\\n }\\n\\n\\n\\n class\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 56,\n \"score\": 132908.57788313748\n },\n {\n \"content\": \"pub fn barycentric_is_inside(bary: (f32, f32, f32)) -> bool {\\n\\n (bary.0 >= 0.0) && (bary.1 >= 0.0) && (bary.0 + bary.1 < 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 57,\n \"score\": 130652.2316457876\n },\n {\n \"content\": \"/// Generates a set of UV meshes.\\n\\npub fn generate_uv_meshes(\\n\\n uv_box: &UvBox,\\n\\n data: &mut SurfaceSharedData,\\n\\n) -> (Vec<UvMesh>, SurfaceDataPatch) {\\n\\n let mut mesh_patch = SurfaceDataPatch {\\n\\n data_id: data.id(),\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n // Step 1. Split vertices at boundary between each face. This step multiplies the\\n\\n // number of vertices at boundary so we'll get separate texture coordinates at\\n\\n // seams.\\n\\n make_seam(\\n\\n data,\\n\\n &uv_box.px,\\n\\n &[&uv_box.nx, &uv_box.py, &uv_box.ny, &uv_box.pz, &uv_box.nz],\\n\\n &mut mesh_patch,\\n\\n );\\n\\n make_seam(\\n\\n data,\\n\",\n \"file_path\": \"src/utils/uvgen.rs\",\n \"rank\": 58,\n \"score\": 130183.82137204715\n },\n {\n \"content\": \"pub fn create_ui(ui: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text = TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0))\\n\\n .with_wrap(true)\\n\\n .build(ui);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_bar =\\n\\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ui);\\n\\n progress_bar\\n\\n })\\n\\n .with_child({\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 59,\n \"score\": 129532.71771578789\n },\n {\n \"content\": \"fn main() {\\n\\n let event_loop = EventLoop::new();\\n\\n\\n\\n let window_builder = rg3d::window::WindowBuilder::new()\\n\\n .with_title(\\\"Example - Scene\\\")\\n\\n .with_resizable(true);\\n\\n\\n\\n let mut engine = GameEngine::new(window_builder, &event_loop, true).unwrap();\\n\\n\\n\\n // Prepare resource manager - it must be notified where to search textures. When engine\\n\\n // loads model resource it automatically tries to load textures it uses. But since most\\n\\n // model formats store absolute paths, we can't use them as direct path to load texture\\n\\n // instead we telling engine to search textures in given folder.\\n\\n engine\\n\\n .resource_manager\\n\\n .state()\\n\\n .set_textures_path(\\\"examples/data\\\");\\n\\n\\n\\n // Create simple user interface that will show some useful info.\\n\\n let debug_text = create_ui(&mut engine.user_interface.build_ctx());\\n\",\n \"file_path\": \"examples/scene.rs\",\n \"rank\": 60,\n \"score\": 129373.27924630529\n },\n {\n \"content\": \"/// Generates UV map for given surface data.\\n\\n///\\n\\n/// # Performance\\n\\n///\\n\\n/// This method utilizes lots of \\\"brute force\\\" algorithms, so it is not fast as it\\n\\n/// could be in ideal case. It also allocates some memory for internal needs.\\n\\npub fn generate_uvs(data: &mut SurfaceSharedData, spacing: f32) -> SurfaceDataPatch {\\n\\n let uv_box = generate_uv_box(data);\\n\\n\\n\\n let (mut meshes, mut patch) = generate_uv_meshes(&uv_box, data);\\n\\n\\n\\n // Step 4. Arrange and scale all meshes on uv map so it fits into [0;1] range.\\n\\n let area = meshes.iter().fold(0.0, |area, mesh| area + mesh.area());\\n\\n let square_side = area.sqrt() + spacing * meshes.len() as f32;\\n\\n\\n\\n meshes.sort_unstable_by(|a, b| b.area().partial_cmp(&a.area()).unwrap());\\n\\n\\n\\n let mut rects = Vec::new();\\n\\n\\n\\n let twice_spacing = spacing * 2.0;\\n\\n\\n\\n // Some empiric coefficient that large enough to make size big enough for all meshes.\\n\\n // This should be large enough to fit all meshes, but small to prevent losing of space.\\n\\n // We'll use iterative approach to pack everything as tight as possible: at each iteration\\n\\n // scale will be increased until packer is able to pack everything.\\n\\n let mut empiric_scale = 1.1;\\n\",\n \"file_path\": \"src/utils/uvgen.rs\",\n \"rank\": 61,\n \"score\": 129020.80657382209\n },\n {\n \"content\": \"pub fn clampf(v: f32, min: f32, max: f32) -> f32 {\\n\\n if v < min {\\n\\n min\\n\\n } else if v > max {\\n\\n max\\n\\n } else {\\n\\n v\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 62,\n \"score\": 127320.91347633644\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n camera: Handle<Node>,\\n\\n animations: Vec<Handle<Animation>>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n let camera = create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(0.0, 32.0, -140.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await;\\n\\n\\n\\n // Load model and animation resource in parallel. Is does *not* adds anything to\\n\\n // our scene - it just loads a resource then can be used later on to instantiate\\n\\n // models from it on scene. Why loading of resource is separated from instantiation?\\n\",\n \"file_path\": \"examples/instancing.rs\",\n \"rank\": 63,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n camera: Handle<Node>,\\n\\n model_handle: Handle<Node>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n let camera = create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(0.0, 1.5, -5.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await;\\n\\n\\n\\n // Set small z far for the sake of example.\\n\\n scene.graph[camera].as_camera_mut().set_z_far(32.0);\\n\\n\\n\",\n \"file_path\": \"examples/lod.rs\",\n \"rank\": 64,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n model_handle: Handle<Node>,\\n\\n walk_animation: Handle<Animation>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(0.0, 6.0, -12.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await;\\n\\n\\n\\n // Load model resource. Is does *not* adds anything to our scene - it just loads a\\n\\n // resource then can be used later on to instantiate models from it on scene. Why\\n\\n // loading of resource is separated from instantiation? Because there it is too\\n\",\n \"file_path\": \"examples/ui.rs\",\n \"rank\": 65,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n model_handle: Handle<Node>,\\n\\n walk_animation: Handle<Animation>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/async.rs\",\n \"rank\": 66,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n agent: Handle<Node>,\\n\\n cursor: Handle<Node>,\\n\\n camera: Handle<Node>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n let camera = create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(4.0, 8.0, 0.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await;\\n\\n\\n\\n scene.graph[camera]\\n\\n .local_transform_mut()\\n\",\n \"file_path\": \"examples/navmesh.rs\",\n \"rank\": 67,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct InputController {\\n\\n rotate_left: bool,\\n\\n rotate_right: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/scene.rs\",\n \"rank\": 68,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n root: Handle<Node>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/lightmap.rs\",\n \"rank\": 69,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"struct GameScene {\\n\\n scene: Scene,\\n\\n model_handle: Handle<Node>,\\n\\n walk_animation: Handle<Animation>,\\n\\n}\\n\\n\\n\\nasync fn create_scene(resource_manager: ResourceManager) -> GameScene {\\n\\n let mut scene = Scene::new();\\n\\n\\n\\n // Camera is our eyes in the world - you won't see anything without it.\\n\\n create_camera(\\n\\n resource_manager.clone(),\\n\\n Vector3::new(0.0, 6.0, -12.0),\\n\\n &mut scene.graph,\\n\\n )\\n\\n .await;\\n\\n\\n\\n // Load model and animation resource in parallel. Is does *not* adds anything to\\n\\n // our scene - it just loads a resource then can be used later on to instantiate\\n\\n // models from it on scene. Why loading of resource is separated from instantiation?\\n\",\n \"file_path\": \"examples/simple.rs\",\n \"rank\": 70,\n \"score\": 125689.48342832507\n },\n {\n \"content\": \"pub fn solve_quadratic(a: f32, b: f32, c: f32) -> Option<[f32; 2]> {\\n\\n let discriminant = b * b - 4.0 * a * c;\\n\\n if discriminant < 0.0 {\\n\\n // No real roots\\n\\n None\\n\\n } else {\\n\\n // Dont care if quadratic equation has only one root (discriminant == 0), this is edge-case\\n\\n // which requires additional branching instructions which is not good for branch-predictor in CPU.\\n\\n let _2a = 2.0 * a;\\n\\n let discr_root = discriminant.sqrt();\\n\\n let r1 = (-b + discr_root) / _2a;\\n\\n let r2 = (-b - discr_root) / _2a;\\n\\n Some([r1, r2])\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 71,\n \"score\": 124973.0363671525\n },\n {\n \"content\": \"struct PointShadowMapShader {\\n\\n program: GpuProgram,\\n\\n world_matrix: UniformLocation,\\n\\n bone_matrices: UniformLocation,\\n\\n world_view_projection_matrix: UniformLocation,\\n\\n use_skeletal_animation: UniformLocation,\\n\\n diffuse_texture: UniformLocation,\\n\\n light_position: UniformLocation,\\n\\n}\\n\\n\\n\\nimpl PointShadowMapShader {\\n\\n pub fn new() -> Result<Self, RendererError> {\\n\\n let fragment_source = include_str!(\\\"shaders/point_shadow_map_fs.glsl\\\");\\n\\n let vertex_source = include_str!(\\\"shaders/point_shadow_map_vs.glsl\\\");\\n\\n let program =\\n\\n GpuProgram::from_source(\\\"PointShadowMapShader\\\", vertex_source, fragment_source)?;\\n\\n Ok(Self {\\n\\n world_matrix: program.uniform_location(\\\"worldMatrix\\\")?,\\n\\n bone_matrices: program.uniform_location(\\\"boneMatrices\\\")?,\\n\\n world_view_projection_matrix: program.uniform_location(\\\"worldViewProjection\\\")?,\\n\",\n \"file_path\": \"src/renderer/shadow_map_renderer.rs\",\n \"rank\": 72,\n \"score\": 124325.96389200166\n },\n {\n \"content\": \"struct SpotShadowMapShader {\\n\\n program: GpuProgram,\\n\\n bone_matrices: UniformLocation,\\n\\n world_view_projection_matrix: UniformLocation,\\n\\n use_skeletal_animation: UniformLocation,\\n\\n diffuse_texture: UniformLocation,\\n\\n}\\n\\n\\n\\nimpl SpotShadowMapShader {\\n\\n pub fn new() -> Result<Self, RendererError> {\\n\\n let fragment_source = include_str!(\\\"shaders/spot_shadow_map_fs.glsl\\\");\\n\\n let vertex_source = include_str!(\\\"shaders/spot_shadow_map_vs.glsl\\\");\\n\\n let program =\\n\\n GpuProgram::from_source(\\\"SpotShadowMapShader\\\", vertex_source, fragment_source)?;\\n\\n Ok(Self {\\n\\n bone_matrices: program.uniform_location(\\\"boneMatrices\\\")?,\\n\\n world_view_projection_matrix: program.uniform_location(\\\"worldViewProjection\\\")?,\\n\\n use_skeletal_animation: program.uniform_location(\\\"useSkeletalAnimation\\\")?,\\n\\n diffuse_texture: program.uniform_location(\\\"diffuseTexture\\\")?,\\n\\n\\n\",\n \"file_path\": \"src/renderer/shadow_map_renderer.rs\",\n \"rank\": 73,\n \"score\": 124325.96389200166\n },\n {\n \"content\": \"#[repr(C)]\\n\\nstruct Vertex {\\n\\n position: Vector3<f32>,\\n\\n color: u32,\\n\\n}\\n\\n\\n\\n/// See module docs.\\n\\npub struct DebugRenderer {\\n\\n geometry: GeometryBuffer,\\n\\n vertices: Vec<Vertex>,\\n\\n line_indices: Vec<[u32; 2]>,\\n\\n shader: DebugShader,\\n\\n}\\n\\n\\n\\npub(in crate) struct DebugShader {\\n\\n program: GpuProgram,\\n\\n wvp_matrix: UniformLocation,\\n\\n}\\n\\n\\n\\nimpl DebugShader {\\n\\n fn new() -> Result<Self, RendererError> {\\n\",\n \"file_path\": \"src/renderer/debug_renderer.rs\",\n \"rank\": 74,\n \"score\": 122651.73835981067\n },\n {\n \"content\": \"struct Profiler {\\n\\n start_time: std::time::Instant,\\n\\n samples: HashMap<ScopeMark, Sample>,\\n\\n scope_stack: Vec<ScopeMark>,\\n\\n}\\n\\n\\n\\nconst ENTRY_SCOPE_MARK: ScopeMark = ScopeMark {\\n\\n parent_scope_hash: 0,\\n\\n function_name: \\\"EntryPoint\\\",\\n\\n line: 0,\\n\\n};\\n\\n\\n\\nimpl Default for Profiler {\\n\\n #[inline]\\n\\n fn default() -> Self {\\n\\n let entry_sample = Sample {\\n\\n count: 0,\\n\\n time: 0.0,\\n\\n children: HashSet::new(),\\n\\n };\\n\\n let mut samples = HashMap::new();\\n\\n samples.insert(ENTRY_SCOPE_MARK, entry_sample);\\n\\n Self {\\n\\n start_time: std::time::Instant::now(),\\n\\n samples,\\n\\n scope_stack: vec![ENTRY_SCOPE_MARK],\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 75,\n \"score\": 122298.60648699576\n },\n {\n \"content\": \"struct Sample {\\n\\n count: u64,\\n\\n time: f64,\\n\\n children: HashSet<ScopeMark>,\\n\\n}\\n\\n\\n\\nimpl Sample {\\n\\n pub fn collect(&mut self, time: f64) {\\n\\n self.time += time;\\n\\n self.count += 1;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for Sample {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n count: 0,\\n\\n time: 0.0,\\n\\n children: Default::default(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 76,\n \"score\": 122298.60648699576\n },\n {\n \"content\": \"///\\n\\n/// Converts FBX DOM to native engine representation.\\n\\n///\\n\\nfn convert(\\n\\n fbx_scene: &FbxScene,\\n\\n resource_manager: ResourceManager,\\n\\n scene: &mut Scene,\\n\\n) -> Result<(), FbxError> {\\n\\n let root = scene.graph.get_root();\\n\\n let animation_handle = scene.animations.add(Animation::default());\\n\\n let mut fbx_model_to_node_map = HashMap::new();\\n\\n for (component_handle, component) in fbx_scene.pair_iter() {\\n\\n if let FbxComponent::Model(model) = component {\\n\\n let node = convert_model(\\n\\n fbx_scene,\\n\\n model,\\n\\n resource_manager.clone(),\\n\\n &mut scene.graph,\\n\\n &mut scene.animations,\\n\\n animation_handle,\\n\\n )?;\\n\\n scene.graph.link_nodes(node, root);\\n\\n fbx_model_to_node_map.insert(component_handle, node);\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 77,\n \"score\": 122075.03623406096\n },\n {\n \"content\": \"struct SceneLoadContext {\\n\\n data: Option<GameScene>,\\n\\n progress_indicator: ProgressIndicator,\\n\\n cancellation_token: CancellationToken,\\n\\n start_time: Instant,\\n\\n generate_lightmap: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/lightmap.rs\",\n \"rank\": 78,\n \"score\": 121989.2867634688\n },\n {\n \"content\": \"struct SceneLoadContext {\\n\\n data: Option<GameScene>,\\n\\n message: String,\\n\\n progress: f32,\\n\\n}\\n\\n\\n\\nimpl SceneLoadContext {\\n\\n pub fn report_progress(&mut self, progress: f32, message: &str) {\\n\\n self.progress = progress;\\n\\n self.message = message.to_owned();\\n\\n println!(\\\"Loading progress: {}% - {}\\\", progress * 100.0, message);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/async.rs\",\n \"rank\": 79,\n \"score\": 121989.2867634688\n },\n {\n \"content\": \"struct PointShadowCubeMapFace {\\n\\n face: CubeMapFace,\\n\\n look: Vector3<f32>,\\n\\n up: Vector3<f32>,\\n\\n}\\n\\n\\n\\npub(in crate) struct PointShadowMapRenderContext<'a, 'c> {\\n\\n pub state: &'a mut PipelineState,\\n\\n pub graph: &'c Graph,\\n\\n pub light_pos: Vector3<f32>,\\n\\n pub light_radius: f32,\\n\\n pub geom_cache: &'a mut GeometryCache,\\n\\n pub cascade: usize,\\n\\n pub batch_storage: &'a BatchStorage,\\n\\n}\\n\\n\\n\\nimpl PointShadowMapRenderer {\\n\\n pub fn new(\\n\\n state: &mut PipelineState,\\n\\n size: usize,\\n\",\n \"file_path\": \"src/renderer/shadow_map_renderer.rs\",\n \"rank\": 80,\n \"score\": 121819.17755503842\n },\n {\n \"content\": \"fn create_scene_async(\\n\\n resource_manager: ResourceManager,\\n\\n generate_lightmap: bool,\\n\\n) -> Arc<Mutex<SceneLoadContext>> {\\n\\n let progress_indicator = ProgressIndicator::new();\\n\\n let cancellation_token = CancellationToken::new();\\n\\n\\n\\n // Create load context - it will be shared with caller and loader threads.\\n\\n let context = Arc::new(Mutex::new(SceneLoadContext {\\n\\n data: None,\\n\\n progress_indicator: progress_indicator.clone(),\\n\\n cancellation_token: cancellation_token.clone(),\\n\\n start_time: Instant::now(),\\n\\n generate_lightmap,\\n\\n }));\\n\\n let result = context.clone();\\n\\n\\n\\n // Spawn separate thread which will create scene by loading various assets.\\n\\n std::thread::spawn(move || {\\n\\n futures::executor::block_on(async move {\\n\",\n \"file_path\": \"examples/lightmap.rs\",\n \"rank\": 81,\n \"score\": 121686.96947116226\n },\n {\n \"content\": \"fn read_string<R>(file: &mut R) -> Result<FbxAttribute, FbxError>\\n\\nwhere\\n\\n R: Read,\\n\\n{\\n\\n let length = file.read_u32::<LittleEndian>()? as usize;\\n\\n let mut raw_string = Vec::with_capacity(length);\\n\\n unsafe {\\n\\n raw_string.set_len(length);\\n\\n };\\n\\n file.read_exact(raw_string.as_mut_slice())?;\\n\\n // Find null terminator. It is required because for some reason some strings\\n\\n // have additional data after null terminator like this: Omni004\\\\x0\\\\x1Model, but\\n\\n // length still more than position of null terminator.\\n\\n if let Some(null_terminator_pos) = raw_string.iter().position(|c| *c == 0) {\\n\\n raw_string.truncate(null_terminator_pos);\\n\\n }\\n\\n let string = String::from_utf8(raw_string)?;\\n\\n Ok(FbxAttribute::String(string))\\n\\n}\\n\\n\\n\\nconst VERSION_7500: i32 = 7500;\\n\\nconst VERSION_7500_NULLREC_SIZE: usize = 25; // in bytes\\n\\nconst NORMAL_NULLREC_SIZE: usize = 13; // in bytes\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 82,\n \"score\": 120143.8246440484\n },\n {\n \"content\": \"pub fn is_point_inside_triangle(p: &Vector3<f32>, vertices: &[Vector3<f32>; 3]) -> bool {\\n\\n let ba = vertices[1] - vertices[0];\\n\\n let ca = vertices[2] - vertices[0];\\n\\n let vp = *p - vertices[0];\\n\\n\\n\\n let ba_dot_ba = ba.dot(&ba);\\n\\n let ca_dot_ba = ca.dot(&ba);\\n\\n let ca_dot_ca = ca.dot(&ca);\\n\\n\\n\\n let dot02 = ca.dot(&vp);\\n\\n let dot12 = ba.dot(&vp);\\n\\n\\n\\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\\n\\n\\n\\n // Calculate barycentric coordinates\\n\\n let u = (ba_dot_ba * dot02 - ca_dot_ba * dot12) * inv_denom;\\n\\n let v = (ca_dot_ca * dot12 - ca_dot_ba * dot02) * inv_denom;\\n\\n\\n\\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 83,\n \"score\": 120022.79513181392\n },\n {\n \"content\": \"#[derive(Copy, Clone, PartialEq, Eq, Debug)]\\n\\nenum PathVertexState {\\n\\n NonVisited,\\n\\n Open,\\n\\n Closed,\\n\\n}\\n\\n\\n\\n/// Graph vertex that contains position in world and list of indices of neighbour\\n\\n/// vertices.\\n\\n#[derive(Clone, Debug)]\\n\\npub struct PathVertex {\\n\\n /// Position in world.\\n\\n pub position: Vector3<f32>,\\n\\n state: PathVertexState,\\n\\n g_score: f32,\\n\\n f_score: f32,\\n\\n parent: Option<usize>,\\n\\n neighbours: Vec<u32>,\\n\\n}\\n\\n\\n\\nimpl Default for PathVertex {\\n\",\n \"file_path\": \"src/utils/astar.rs\",\n \"rank\": 84,\n \"score\": 119370.53821829092\n },\n {\n \"content\": \"#[derive(Default, Clone)]\\n\\nstruct SurfaceData {\\n\\n builder: RawMeshBuilder<Vertex>,\\n\\n skin_data: Vec<VertexWeightSet>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 85,\n \"score\": 118934.30059545938\n },\n {\n \"content\": \"struct UnpackedVertex {\\n\\n // Index of surface this vertex belongs to.\\n\\n surface: usize,\\n\\n position: Vector3<f32>,\\n\\n normal: Vector3<f32>,\\n\\n tangent: Vector3<f32>,\\n\\n uv: Vector2<f32>,\\n\\n // Set of weights for skinning.\\n\\n weights: Option<VertexWeightSet>,\\n\\n}\\n\\n\\n\\nimpl Into<Vertex> for UnpackedVertex {\\n\\n fn into(self) -> Vertex {\\n\\n Vertex {\\n\\n position: self.position,\\n\\n tex_coord: self.uv,\\n\\n // TODO: FBX can contain second texture coordinates so they should be\\n\\n // extracted when available\\n\\n second_tex_coord: Default::default(),\\n\\n normal: self.normal,\\n\\n tangent: Vector4::new(self.tangent.x, self.tangent.y, self.tangent.z, 1.0),\\n\\n // Correct values will be assigned in second pass of conversion\\n\\n // when all nodes will be converted.\\n\\n bone_weights: Default::default(),\\n\\n bone_indices: Default::default(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 86,\n \"score\": 118928.04968136697\n },\n {\n \"content\": \"#[derive(Hash, PartialEq, Eq, Copy, Clone, Debug)]\\n\\nstruct ScopeMark {\\n\\n parent_scope_hash: u64,\\n\\n function_name: &'static str,\\n\\n line: u32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/profiler.rs\",\n \"rank\": 87,\n \"score\": 118877.21099909807\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Vertex {\\n\\n position: Vector2<f32>,\\n\\n prev: usize,\\n\\n index: usize,\\n\\n next: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/triangulator.rs\",\n \"rank\": 88,\n \"score\": 118858.4576090916\n },\n {\n \"content\": \"///\\n\\n/// Linked list of vertices\\n\\n///\\n\\nstruct Polygon {\\n\\n vertices: Vec<Vertex>,\\n\\n head: usize,\\n\\n tail: usize,\\n\\n}\\n\\n\\n\\nimpl Polygon {\\n\\n ///\\n\\n /// Excludes vertex from polygon. Does not remove it from vertices array!\\n\\n ///\\n\\n fn remove_vertex(&mut self, index: usize) {\\n\\n let next_index = self.vertices[index].next;\\n\\n let prev_index = self.vertices[index].prev;\\n\\n\\n\\n let prev = &mut self.vertices[prev_index];\\n\\n prev.next = next_index;\\n\\n\\n\\n let next = &mut self.vertices[next_index];\\n\\n next.prev = prev_index;\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/triangulator.rs\",\n \"rank\": 89,\n \"score\": 118852.12011870214\n },\n {\n \"content\": \"fn convert_vertex(\\n\\n geom: &FbxGeometry,\\n\\n geometric_transform: &Matrix4<f32>,\\n\\n material_index: usize,\\n\\n index: usize,\\n\\n index_in_polygon: usize,\\n\\n skin_data: &[VertexWeightSet],\\n\\n) -> Result<UnpackedVertex, FbxError> {\\n\\n let position = *geom.vertices.get(index).ok_or(FbxError::IndexOutOfBounds)?;\\n\\n\\n\\n let normal = match geom.normals.as_ref() {\\n\\n Some(normals) => *normals.get(index, index_in_polygon)?,\\n\\n None => Vector3::y(),\\n\\n };\\n\\n\\n\\n let tangent = match geom.tangents.as_ref() {\\n\\n Some(tangents) => *tangents.get(index, index_in_polygon)?,\\n\\n None => Vector3::y(),\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 90,\n \"score\": 118630.50749568336\n },\n {\n \"content\": \"fn create_surfaces(\\n\\n fbx_scene: &FbxScene,\\n\\n data_set: Vec<SurfaceData>,\\n\\n resource_manager: ResourceManager,\\n\\n model: &FbxModel,\\n\\n) -> Result<Vec<Surface>, FbxError> {\\n\\n let mut surfaces = Vec::new();\\n\\n\\n\\n // Create surfaces per material\\n\\n if model.materials.is_empty() {\\n\\n assert_eq!(data_set.len(), 1);\\n\\n let data = data_set.into_iter().next().unwrap();\\n\\n let mut surface = Surface::new(Arc::new(RwLock::new(SurfaceSharedData::from_raw_mesh(\\n\\n data.builder.build(),\\n\\n false,\\n\\n ))));\\n\\n surface.vertex_weights = data.skin_data;\\n\\n surfaces.push(surface);\\n\\n } else {\\n\\n assert_eq!(data_set.len(), model.materials.len());\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 91,\n \"score\": 118630.50749568336\n },\n {\n \"content\": \"fn convert_mesh(\\n\\n base: BaseBuilder,\\n\\n fbx_scene: &FbxScene,\\n\\n resource_manager: ResourceManager,\\n\\n model: &FbxModel,\\n\\n graph: &mut Graph,\\n\\n) -> Result<Handle<Node>, FbxError> {\\n\\n let geometric_transform = Matrix4::new_translation(&model.geometric_translation)\\n\\n * quat_from_euler(model.geometric_rotation).to_homogeneous()\\n\\n * Matrix4::new_nonuniform_scaling(&model.geometric_scale);\\n\\n\\n\\n let mut temp_vertices = Vec::new();\\n\\n let mut triangles = Vec::new();\\n\\n\\n\\n // Array for triangulation needs, it will contain triangle definitions for\\n\\n // triangulated polygon.\\n\\n let mut face_triangles = Vec::new();\\n\\n\\n\\n let mut mesh_surfaces = Vec::new();\\n\\n for &geom_handle in &model.geoms {\\n\",\n \"file_path\": \"src/resource/fbx/mod.rs\",\n \"rank\": 92,\n \"score\": 118630.50749568336\n },\n {\n \"content\": \"fn build_recursive(\\n\\n nodes: &mut Pool<OctreeNode>,\\n\\n triangles: &[[Vector3<f32>; 3]],\\n\\n bounds: AxisAlignedBoundingBox,\\n\\n indices: Vec<u32>,\\n\\n split_threshold: usize,\\n\\n) -> Handle<OctreeNode> {\\n\\n if indices.len() <= split_threshold {\\n\\n nodes.spawn(OctreeNode::Leaf { bounds, indices })\\n\\n } else {\\n\\n let mut leaves = [Handle::NONE; 8];\\n\\n let leaf_bounds = split_bounds(bounds);\\n\\n\\n\\n for i in 0..8 {\\n\\n let mut leaf_indices = Vec::new();\\n\\n\\n\\n for index in indices.iter() {\\n\\n let index = *index;\\n\\n\\n\\n let triangle_bounds =\\n\",\n \"file_path\": \"rg3d-core/src/octree.rs\",\n \"rank\": 93,\n \"score\": 118554.57793301852\n },\n {\n \"content\": \"pub fn triangle_area(a: Vector3<f32>, b: Vector3<f32>, c: Vector3<f32>) -> f32 {\\n\\n (b - a).cross(&(c - a)).norm() * 0.5\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 94,\n \"score\": 118010.51679357215\n },\n {\n \"content\": \"fn save(game: &mut Game) {\\n\\n // To save a game state all we need to do is to create new instance of Visitor\\n\\n // and call visit on game instance.\\n\\n let mut visitor = Visitor::new();\\n\\n game.visit(\\\"Game\\\", &mut visitor).unwrap();\\n\\n // And call save method.\\n\\n visitor.save_binary(Path::new(SAVE_FILE)).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/save_load.rs\",\n \"rank\": 95,\n \"score\": 117948.5195851202\n },\n {\n \"content\": \"fn load(game: &mut Game) {\\n\\n if Path::new(SAVE_FILE).exists() {\\n\\n // Loading a game is even simpler - just 2 lines.\\n\\n let mut visitor = Visitor::load_binary(SAVE_FILE).unwrap();\\n\\n game.visit(\\\"Game\\\", &mut visitor).unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/save_load.rs\",\n \"rank\": 96,\n \"score\": 117948.5195851202\n },\n {\n \"content\": \"pub fn spherical_to_cartesian(azimuth: f32, elevation: f32, radius: f32) -> Vector3<f32> {\\n\\n let x = radius * elevation.sin() * azimuth.sin();\\n\\n let y = radius * elevation.cos();\\n\\n let z = -radius * elevation.sin() * azimuth.cos();\\n\\n Vector3::new(x, y, z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rg3d-core/src/math/mod.rs\",\n \"rank\": 97,\n \"score\": 117245.84530244915\n },\n {\n \"content\": \"#![warn(missing_docs)]\\n\\n\\n\\n//! Resource module contains all structures and method to manage resources.\\n\\n\\n\\nuse crate::core::visitor::{Visit, VisitResult, Visitor};\\n\\nuse std::borrow::Cow;\\n\\nuse std::ops::{Deref, DerefMut};\\n\\nuse std::{\\n\\n fmt::Debug,\\n\\n future::Future,\\n\\n path::{Path, PathBuf},\\n\\n pin::Pin,\\n\\n sync::{Arc, Mutex, MutexGuard},\\n\\n task::{Context, Poll, Waker},\\n\\n};\\n\\n\\n\\npub mod fbx;\\n\\npub mod model;\\n\\npub mod texture;\\n\\n\\n\\n/// A trait for resource data.\\n\",\n \"file_path\": \"src/resource/mod.rs\",\n \"rank\": 99,\n \"score\": 57.06252764227223\n }\n]","isConversational":false}}},{"rowIdx":1980,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"packages/sycamore-macro/src/component/mod.rs"},"repo_name":{"kind":"string","value":"alsuren/sycamore"},"commit":{"kind":"string","value":"df16d18ad29933316aa666185e7e2dd7002eb662"},"file_code":{"kind":"string","value":"use proc_macro2::TokenStream;\nuse quote::{quote, ToTokens};\nuse syn::parse::{Parse, ParseStream};\nuse syn::{\n Attribute, Block, FnArg, GenericParam, Generics, Ident, Item, ItemFn, Result, ReturnType, Type,\n Visibility,\n};\n\npub struct ComponentFunctionName {\n pub component_name: Ident,\n pub generics: Generics,\n}\n\nimpl Parse for ComponentFunctionName {\n fn parse(input: ParseStream) -> Result<Self> {\n if input.is_empty() {\n Err(input.error(\"expected an identifier for the component\"))\n } else {\n let component_name: Ident = input.parse()?;\n let generics: Generics = input.parse()?;\n\n if let Some(lifetime) = generics.lifetimes().next() {\n return Err(syn::Error::new_spanned(\n lifetime,\n \"unexpected lifetime param; put lifetime params on function instead\",\n ));\n }\n\n if let Some(const_param) = generics.const_params().next() {\n return Err(syn::Error::new_spanned(\n const_param,\n \"unexpected const generic param; put const generic params on function instead\",\n ));\n }\n\n if generics.type_params().count() != 1 {\n return Err(syn::Error::new_spanned(\n generics,\n \"expected a single type param\",\n ));\n }\n\n if !generics\n .type_params()\n .next()\n .unwrap()\n .bounds\n .empty_or_trailing()\n {\n return Err(syn::Error::new_spanned(\n generics,\n \"unexpected type bound in generic type\",\n ));\n }\n\n Ok(Self {\n component_name,\n generics,\n })\n }\n }\n}\n\npub struct ComponentFunction {\n pub block: Box<Block>,\n pub props_type: Box<Type>,\n pub arg: FnArg,\n pub generics: Generics,\n pub vis: Visibility,\n pub attrs: Vec<Attribute>,\n pub name: Ident,\n pub return_type: Box<Type>,\n}\n\nimpl Parse for ComponentFunction {\n fn parse(input: ParseStream) -> Result<Self> {\n let parsed: Item = input.parse()?;\n\n match parsed {\n Item::Fn(func) => {\n let ItemFn {\n attrs,\n vis,\n sig,\n block,\n } = func;\n\n if sig.asyncness.is_some() {\n return Err(syn::Error::new_spanned(\n sig.asyncness,\n \"async functions can't be components\",\n ));\n }\n\n if sig.constness.is_some() {\n return Err(syn::Error::new_spanned(\n sig.constness,\n \"const functions can't be components\",\n ));\n }\n\n if sig.abi.is_some() {\n return Err(syn::Error::new_spanned(\n sig.abi,\n \"extern functions can't be components\",\n ));\n }\n\n let return_type = match sig.output {\n ReturnType::Default => {\n return Err(syn::Error::new_spanned(\n sig,\n \"function must return `sycamore::view::View`\",\n ))\n }\n ReturnType::Type(_, ty) => ty,\n };\n\n let mut inputs = sig.inputs.into_iter();\n let arg: FnArg = inputs.next().unwrap_or_else(|| syn::parse_quote! { _: () });\n\n let props_type = match &arg {\n FnArg::Typed(arg) => arg.ty.clone(),\n FnArg::Receiver(arg) => {\n return Err(syn::Error::new_spanned(\n arg,\n \"function components can't accept a receiver\",\n ))\n }\n };\n\n if inputs.len() > 0 {\n let params: TokenStream = inputs.map(|it| it.to_token_stream()).collect();\n return Err(syn::Error::new_spanned(\n params,\n \"function should accept at most one parameter for the prop\",\n ));\n }\n\n Ok(Self {\n block,\n props_type,\n arg,\n generics: sig.generics,\n vis,\n attrs,\n name: sig.ident,\n return_type,\n })\n }\n item => Err(syn::Error::new_spanned(\n item,\n \"`component` attribute can only be applied to functions\",\n )),\n }\n }\n}\n\npub fn component_impl(\n attr: ComponentFunctionName,\n component: ComponentFunction,\n) -> Result<TokenStream> {\n let ComponentFunctionName {\n component_name,\n generics: generic_node_ty,\n } = attr;\n\n let component_name_str = component_name.to_string();\n let generic_node_ty = generic_node_ty.type_params().next().unwrap();\n let generic_node: GenericParam = syn::parse_quote! {\n #generic_node_ty: ::sycamore::generic_node::Html\n };\n\n let ComponentFunction {\n block,\n props_type: _,\n arg,\n mut generics,\n vis,\n attrs,\n name,\n return_type,\n } = component;\n\n let prop_ty = match &arg {\n FnArg::Receiver(_) => unreachable!(),\n FnArg::Typed(pat_ty) => &pat_ty.ty,\n };\n\n \n let first_generic_param_index = generics\n .params\n .iter()\n .enumerate()\n .find(|(_, param)| matches!(param, GenericParam::Type(_) | GenericParam::Const(_)))\n .map(|(i, _)| i);\n if let Some(first_generic_param_index) = first_generic_param_index {\n generics\n .params\n .insert(first_generic_param_index, generic_node);\n } else {\n generics.params.push(generic_node);\n }\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n \n let phantom_generics = ty_generics\n .clone()\n .into_token_stream()\n .into_iter()\n .collect::<Vec<_>>();\n \n let phantom_generics_len = phantom_generics.len();\n let phantom_generics = phantom_generics\n .into_iter()\n .take(phantom_generics_len.saturating_sub(1))\n .skip(1)\n .collect::<TokenStream>();\n\n if name == component_name {\n return Err(syn::Error::new_spanned(\n component_name,\n \"the component must not have the same name as the function\",\n ));\n }\n\n let quoted = quote! {\n #(#attrs)*\n #vis struct #component_name#generics {\n #[doc(hidden)]\n _marker: ::std::marker::PhantomData<(#phantom_generics)>,\n }\n\n impl#impl_generics ::sycamore::component::Component::<#generic_node_ty> for #component_name#ty_generics\n #where_clause\n {\n #[cfg(debug_assertions)]\n const NAME: &'static ::std::primitive::str = #component_name_str;\n type Props = #prop_ty;\n\n fn __create_component(#arg) -> #return_type{\n #block\n }\n }\n };\n\n Ok(quoted)\n}\n"},"prefix":{"kind":"string","value":"use proc_macro2::TokenStream;\nuse quote::{quote, ToTokens};\nuse syn::parse::{Parse, ParseStream};\nuse syn::{\n Attribute, Block, FnArg, GenericParam, Generics, Ident, Item, ItemFn, Result, ReturnType, Type,\n Visibility,\n};\n\npub struct ComponentFunctionName {\n pub component_name: Ident,\n pub generics: Generics,\n}\n\nimpl Parse for ComponentFunctionName {\n fn parse(input: ParseStream) -> Result<Self> {\n if input.is_empty() {\n Err(input.error(\"expected an identifier for the component\"))\n } else {\n let component_name: Ident = input.parse()?;\n let generics: Generics = input.parse()?;\n\n if let Some(lifetime) = generics.lifetimes().next() {\n return Err(syn::Error::new_spanned(\n lifetime,\n \"unexpected lifetime param; put lifetime params on function instead\",\n ));\n }\n\n if let Some(const_param) = generics.const_params().next() {\n return Err(syn::Error::new_spanned(\n const_param,\n \"unexpected const generic param; put const generic params on function instead\",\n ));\n }\n\n if generics.type_params().count() != 1 {\n return Err(syn::Error::new_spanned(\n generics,\n \"expected a single type param\",\n ));\n }\n\n if !generics\n .type_params()\n .next()\n .unwrap()\n .bounds\n .empty_or_trailing()\n {\n return Err(syn::Error::new_spanned(\n generics,\n \"unexpected type bound in generic type\",\n ));\n }\n\n Ok(Self {\n component_name,\n generics,\n })\n }\n }\n}\n\npub struct ComponentFunction {\n pub block: Box<Block>,\n pub props_type: Box<Type>,\n pub arg: FnArg,\n pub generics: Generics,\n pub vis: Visibility,\n pub attrs: Vec<Attribute>,\n pub name: Ident,\n pub return_type: Box<Type>,\n}\n\nimpl Parse for ComponentFunction {\n fn parse(input: ParseStream) -> Result<Self> {\n let parsed: Item = input.parse()?;\n\n match parsed {\n Item::Fn(func) => {\n let ItemFn {\n attrs,\n vis,\n sig,\n block,\n } = func;\n\n if sig.asyncness.is_some() {\n return Err(syn::Error::new_spanned(\n sig.asyncness,\n \"async functions can't be components\",\n ));\n }\n\n if sig.constness.is_some() {\n return Err(syn::Error::new_spanned(\n sig.constness,\n \"const functions can't be components\",\n ));\n }\n\n if sig.abi.is_some() {\n return Err(syn::Error::new_spanned(\n sig.abi,\n \"extern functions can't be components\",\n ));\n }\n\n let return_type = match sig.output {\n ReturnType::Default => {\n return Err(syn::Error::new_spanned(\n sig,\n \"function must return `sycamore::view::View`\",\n ))\n }\n ReturnType::Type(_, ty) => ty,\n };\n\n let mut inputs = sig.inputs.into_iter();\n let arg: FnArg = inputs.next().unwrap_or_else(|| syn::parse_quote! { _: () });\n\n let props_type = match &arg {\n FnArg::Typed(arg) => arg.ty.clone(),\n FnArg::Receiver(arg) => {\n return Err(syn::Error::new_spanned(\n arg,\n \"function components can't accept a receiver\",\n ))\n }\n };\n\n if inputs.len() > 0 {\n let params: TokenStream = inputs.map(|it| it.to_token_stream()).collect();\n return Err(syn::Error::new_spanned(\n params,\n \"function should accept at most one parameter for the prop\",\n ));\n }\n\n Ok(Self {\n block,\n props_type,\n arg,\n generics: sig.generics,\n vis,\n attrs,\n name: sig.ident,\n return_type,\n })\n }\n item => Err(syn::Error::new_spanned(\n item,\n \"`component` attribute can only be applied to functions\",\n )),\n }\n }\n}\n\n"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"pub fn component_impl(\n attr: ComponentFunctionName,\n component: ComponentFunction,\n) -> Result<TokenStream> {\n let ComponentFunctionName {\n component_name,\n generics: generic_node_ty,\n } = attr;\n\n let component_name_str = component_name.to_string();\n let generic_node_ty = generic_node_ty.type_params().next().unwrap();\n let generic_node: GenericParam = syn::parse_quote! {\n #generic_node_ty: ::sycamore::generic_node::Html\n };\n\n let ComponentFunction {\n block,\n props_type: _,\n arg,\n mut generics,\n vis,\n attrs,\n name,\n return_type,\n } = component;\n\n let prop_ty = match &arg {\n FnArg::Receiver(_) => unreachable!(),\n FnArg::Typed(pat_ty) => &pat_ty.ty,\n };\n\n \n let first_generic_param_index = generics\n .params\n .iter()\n .enumerate()\n .find(|(_, param)| matches!(param, GenericParam::Type(_) | GenericParam::Const(_)))\n .map(|(i, _)| i);\n if let Some(first_generic_param_index) = first_generic_param_index {\n generics\n .params\n .insert(first_generic_param_index, generic_node);\n } else {\n generics.params.push(generic_node);\n }\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n \n let phantom_generics = ty_generics\n .clone()\n .into_token_stream()\n .into_iter()\n .collect::<Vec<_>>();\n \n let phantom_generics_len = phantom_generics.len();\n let phantom_generics = phantom_generics\n .into_iter()\n .take(phantom_generics_len.saturating_sub(1))\n .skip(1)\n .collect::<TokenStream>();\n\n if name == component_name {\n return Err(syn::Error::new_spanned(\n component_name,\n \"the component must not have the same name as the function\",\n ));\n }\n\n let quoted = quote! {\n #(#attrs)*\n #vis struct #component_name#generics {\n #[doc(hidden)]\n _marker: ::std::marker::PhantomData<(#phantom_generics)>,\n }\n\n impl#impl_generics ::sycamore::component::Component::<#generic_node_ty> for #component_name#ty_generics\n #where_clause\n {\n #[cfg(debug_assertions)]\n const NAME: &'static ::std::primitive::str = #component_name_str;\n type Props = #prop_ty;\n\n fn __create_component(#arg) -> #return_type{\n #block\n }\n }\n };\n\n Ok(quoted)\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn route_impl(input: DeriveInput) -> syn::Result<TokenStream> {\n\n let mut quoted = TokenStream::new();\n\n let mut err_quoted = TokenStream::new();\n\n let mut has_error_handler = false;\n\n\n\n match &input.data {\n\n syn::Data::Enum(de) => {\n\n let ty_name = &input.ident;\n\n\n\n for variant in &de.variants {\n\n let variant_id = &variant.ident;\n\n\n\n let mut quote_capture_vars = TokenStream::new();\n\n let mut route_path_ast = None;\n\n\n\n let mut is_to_route = false;\n\n\n\n for attr in &variant.attrs {\n\n let attr_name = match attr.path.get_ident() {\n\n Some(ident) => ident.to_string(),\n","file_path":"packages/sycamore-router-macro/src/route.rs","rank":0,"score":358273.39184251614},{"content":"#[proc_macro_attribute]\n\npub fn component(attr: TokenStream, component: TokenStream) -> TokenStream {\n\n let attr = parse_macro_input!(attr as component::ComponentFunctionName);\n\n let component = parse_macro_input!(component as component::ComponentFunction);\n\n\n\n component::component_impl(attr, component)\n\n .unwrap_or_else(|err| err.to_compile_error())\n\n .into()\n\n}\n","file_path":"packages/sycamore-macro/src/lib.rs","rank":1,"score":254879.1784545763},{"content":"#[proc_macro]\n\npub fn node(input: TokenStream) -> TokenStream {\n\n let node = parse_macro_input!(input as view::Element);\n\n\n\n view::node_impl(node).into()\n\n}\n\n\n\n/// A macro for creating components from functions.\n\n///\n\n/// Add this attribute to a `fn` to create a component from that function.\n\n///\n\n/// To learn more about components, see the chapter on\n\n/// [components](https://sycamore-rs.netlify.app/docs/basics/components) in the Sycamore Book.\n","file_path":"packages/sycamore-macro/src/lib.rs","rank":2,"score":221224.05428181565},{"content":"#[proc_macro_derive(Route, attributes(to, not_found))]\n\npub fn route(input: TokenStream) -> TokenStream {\n\n let input = parse_macro_input!(input as DeriveInput);\n\n\n\n route::route_impl(input)\n\n .unwrap_or_else(|err| err.to_compile_error())\n\n .into()\n\n}\n","file_path":"packages/sycamore-router-macro/src/lib.rs","rank":3,"score":219031.2446051857},{"content":"pub fn view_impl(component: HtmlRoot) -> TokenStream {\n\n component.to_token_stream()\n\n}\n\n\n","file_path":"packages/sycamore-macro/src/view/mod.rs","rank":5,"score":213034.47560696246},{"content":"/// Adds a callback function to the current reactive scope's cleanup.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use sycamore_reactive::*;\n\n///\n\n/// let cleanup_called = Signal::new(false);\n\n///\n\n/// let scope = create_root(cloned!((cleanup_called) => move || {\n\n/// on_cleanup(move || {\n\n/// cleanup_called.set(true);\n\n/// })\n\n/// }));\n\n///\n\n/// assert_eq!(*cleanup_called.get(), false);\n\n///\n\n/// drop(scope);\n\n/// assert_eq!(*cleanup_called.get(), true);\n\n/// ```\n\npub fn on_cleanup(f: impl FnOnce() + 'static) {\n\n SCOPES.with(|scope| {\n\n if scope.borrow().last().is_some() {\n\n scope\n\n .borrow_mut()\n\n .last_mut()\n\n .unwrap_throw()\n\n .add_cleanup(Box::new(f));\n\n } else {\n\n #[cfg(all(target_arch = \"wasm32\", debug_assertions))]\n\n web_sys::console::warn_1(\n\n &\"Cleanup callbacks created outside of a reactive root will never run.\".into(),\n\n );\n\n #[cfg(all(not(target_arch = \"wasm32\"), debug_assertions))]\n\n eprintln!(\n\n \"WARNING: Cleanup callbacks created outside of a reactive root will never run.\"\n\n );\n\n }\n\n });\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":6,"score":193341.4777691328},{"content":"pub fn bench(c: &mut Criterion) {\n\n c.bench_function(\"reactivity_signals\", |b| {\n\n b.iter(|| {\n\n let state = Signal::new(black_box(0));\n\n\n\n for _i in 0..1000 {\n\n state.set(*state.get() + 1);\n\n }\n\n });\n\n });\n\n\n\n c.bench_function(\"reactivity_effects\", |b| {\n\n b.iter(|| {\n\n let state = Signal::new(black_box(0));\n\n create_effect(cloned!((state) => move || {\n\n let double = *state.get() * 2;\n\n black_box(double);\n\n }));\n\n\n\n for _i in 0..1000 {\n","file_path":"packages/sycamore/benches/reactivity.rs","rank":7,"score":192561.2268448305},{"content":"pub fn bench(c: &mut Criterion) {\n\n c.bench_function(\"ssr_small\", |b| {\n\n b.iter(|| {\n\n #[component(App<G>)]\n\n fn app() -> View<G> {\n\n view! {\n\n div(class=\"my-container\") {\n\n p { \"Hello World!\" }\n\n }\n\n }\n\n }\n\n\n\n let _ssr = sycamore::render_to_string(|| view! { App() });\n\n })\n\n });\n\n\n\n c.bench_function(\"ssr_medium\", |b| {\n\n b.iter(|| {\n\n #[component(ListItem<G>)]\n\n fn list_item(value: i32) -> View<G> {\n","file_path":"packages/sycamore/benches/ssr.rs","rank":8,"score":192561.2268448305},{"content":"#[proc_macro]\n\npub fn view(component: TokenStream) -> TokenStream {\n\n let component = parse_macro_input!(component as view::HtmlRoot);\n\n\n\n view::view_impl(component).into()\n\n}\n\n\n\n/// ```\n\n/// use sycamore::prelude::*;\n\n///\n\n/// #[component(MyComponent<G>)]\n\n/// pub fn my_component() -> View<G> {\n\n/// let cool_button: G = node! { button { \"The coolest 😎\" } };\n\n///\n\n/// cool_button.set_property(\"myProperty\", &\"Epic!\".into());\n\n///\n\n/// View::new_node(cool_button)\n\n/// }\n\n/// ```\n","file_path":"packages/sycamore-macro/src/lib.rs","rank":9,"score":191615.89493000088},{"content":"#[component(Item<G>)]\n\npub fn item(todo: Signal<Todo>) -> View<G> {\n\n let app_state = use_context::<AppState>();\n\n\n\n let title = cloned!((todo) => move || todo.get().title.clone());\n\n let completed = create_selector(cloned!((todo) => move || todo.get().completed));\n\n let id = todo.get().id;\n\n\n\n let editing = Signal::new(false);\n\n let input_ref = NodeRef::<G>::new();\n\n let value = Signal::new(\"\".to_string());\n\n\n\n let handle_input = cloned!((value) => move |event: Event| {\n\n let target: HtmlInputElement = event.target().unwrap().unchecked_into();\n\n value.set(target.value());\n\n });\n\n\n\n let toggle_completed = cloned!((todo) => move |_| {\n\n todo.set(Todo {\n\n completed: !todo.get().completed,\n\n ..todo.get().as_ref().clone()\n","file_path":"examples/todomvc/src/item.rs","rank":10,"score":188369.50468892604},{"content":"/// Instantiate a component as a [`View`].\n\n///\n\n/// # Example\n\n/// ```\n\n/// use sycamore::prelude::*;\n\n/// # use sycamore::builder::html::*;\n\n/// #[component(MyComponent<G>)]\n\n/// fn my_component() -> View<G> {\n\n/// h1().text(\"I am a component\").build()\n\n/// }\n\n///\n\n/// // Elsewhere in another component.\n\n/// # fn view<G: Html>() -> View<G> {\n\n/// component::<_, MyComponent<_>>(())\n\n/// # }\n\n/// ```\n\npub fn component<G, C>(props: C::Props) -> View<G>\n\nwhere\n\n G: GenericNode + Html,\n\n C: Component<G>,\n\n{\n\n C::__create_component(props)\n\n}\n\n\n","file_path":"packages/sycamore/src/builder/agnostic/mod.rs","rank":11,"score":184006.48694134058},{"content":"pub fn ident_start(s: &str) -> IResult<&str, &str> {\n\n verify(take(1usize), |c: &str| {\n\n let c = c.chars().next().unwrap();\n\n c == '_' || unicode_xid::UnicodeXID::is_xid_start(c)\n\n })(s)\n\n}\n\n\n","file_path":"packages/sycamore-router-macro/src/parser.rs","rank":12,"score":182523.717879967},{"content":"pub fn ident_continue(s: &str) -> IResult<&str, &str> {\n\n verify(take(1usize), |c: &str| {\n\n unicode_xid::UnicodeXID::is_xid_continue(c.chars().next().unwrap())\n\n })(s)\n\n}\n\n\n","file_path":"packages/sycamore-router-macro/src/parser.rs","rank":13,"score":182523.717879967},{"content":"/// Run the passed closure inside an untracked dependency scope.\n\n///\n\n/// This does **NOT** create a new [`ReactiveScope`].\n\n///\n\n/// See also [`StateHandle::get_untracked()`].\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use sycamore_reactive::*;\n\n///\n\n/// let state = Signal::new(1);\n\n///\n\n/// let double = create_memo({\n\n/// let state = state.clone();\n\n/// move || untrack(|| *state.get() * 2)\n\n/// });\n\n///\n\n/// assert_eq!(*double.get(), 2);\n\n///\n\n/// state.set(2);\n\n/// // double value should still be old value because state was untracked\n\n/// assert_eq!(*double.get(), 2);\n\n/// ```\n\npub fn untrack<T>(f: impl FnOnce() -> T) -> T {\n\n let f = Rc::new(RefCell::new(Some(f)));\n\n let g = Rc::clone(&f);\n\n\n\n // Do not panic if running inside destructor.\n\n if let Ok(ret) = LISTENERS.try_with(|listeners| {\n\n let tmp = listeners.take();\n\n\n\n let ret = f.take().unwrap_throw()();\n\n\n\n *listeners.borrow_mut() = tmp;\n\n\n\n ret\n\n }) {\n\n ret\n\n } else {\n\n g.take().unwrap_throw()()\n\n }\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":14,"score":182219.08184624556},{"content":"pub fn node_impl(html: Element) -> TokenStream {\n\n html.to_token_stream()\n\n}\n","file_path":"packages/sycamore-macro/src/view/mod.rs","rank":15,"score":180454.02599676646},{"content":"#[must_use = \"create_scope returns the reactive scope of the effects created inside this scope\"]\n\npub fn create_scope<'a>(callback: impl FnOnce() + 'a) -> ReactiveScope {\n\n _create_child_scope_in(None, Box::new(callback))\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/lib.rs","rank":16,"score":180139.17574078968},{"content":"#[must_use = \"create_root returns the reactive scope of the effects created inside this scope\"]\n\npub fn create_root<'a>(callback: impl FnOnce() + 'a) -> ReactiveScope {\n\n _create_child_scope_in(None, Box::new(callback))\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/lib.rs","rank":17,"score":180139.17574078968},{"content":"/// Render a [`View`] under a `parent` node by reusing existing nodes (client side\n\n/// hydration). Alias for [`hydrate_to`] with `parent` being the `<body>` tag.\n\n///\n\n/// For rendering without hydration, use [`render`] instead.\n\n///\n\n/// **TODO**: This method currently deletes existing nodes from DOM and reinserts new\n\n/// created nodes. This will be fixed in a later release.\n\n///\n\n/// _This API requires the following crate features to be activated: `dom`_\n\npub fn hydrate(template: impl FnOnce() -> View<DomNode>) {\n\n let window = web_sys::window().unwrap_throw();\n\n let document = window.document().unwrap_throw();\n\n\n\n hydrate_to(template, &document.body().unwrap_throw());\n\n}\n\n\n","file_path":"packages/sycamore/src/generic_node/dom_node.rs","rank":18,"score":179371.29120331112},{"content":"/// Render a [`View`] into the DOM.\n\n/// Alias for [`render_to`] with `parent` being the `<body>` tag.\n\n///\n\n/// _This API requires the following crate features to be activated: `dom`_\n\npub fn render(template: impl FnOnce() -> View<DomNode>) {\n\n let window = web_sys::window().unwrap_throw();\n\n let document = window.document().unwrap_throw();\n\n\n\n render_to(template, &document.body().unwrap_throw());\n\n}\n\n\n","file_path":"packages/sycamore/src/generic_node/dom_node.rs","rank":19,"score":179365.3953899047},{"content":"/// Render a [`View`] into a static [`String`]. Useful\n\n/// for rendering to a string on the server side.\n\n///\n\n/// _This API requires the following crate features to be activated: `ssr`_\n\npub fn render_to_string(template: impl FnOnce() -> View<SsrNode>) -> String {\n\n let mut ret = String::new();\n\n let _scope = create_root(|| {\n\n for node in template().flatten() {\n\n node.write_to_string(&mut ret);\n\n }\n\n });\n\n\n\n ret\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::prelude::*;\n\n\n\n #[test]\n\n fn render_hello_world() {\n\n assert_eq!(\n\n render_to_string(|| view! {\n","file_path":"packages/sycamore/src/generic_node/ssr_node.rs","rank":20,"score":172504.1483008088},{"content":"/// Render a [`View`] under a `parent` node by reusing existing nodes (client side\n\n/// hydration). For rendering under the `<body>` tag, use [`hydrate_to`] instead.\n\n///\n\n/// For rendering without hydration, use [`render`] instead.\n\n///\n\n/// **TODO**: This method currently deletes existing nodes from DOM and reinserts new\n\n/// created nodes. This will be fixed in a later release.\n\n///\n\n/// _This API requires the following crate features to be activated: `dom`_\n\npub fn hydrate_to(template: impl FnOnce() -> View<DomNode>, parent: &Node) {\n\n for child in get_children(parent.unchecked_ref()) {\n\n child.remove();\n\n }\n\n\n\n let scope = create_root(|| {\n\n insert(\n\n &DomNode {\n\n id: Default::default(),\n\n node: parent.clone(),\n\n },\n\n template(),\n\n None,\n\n None, // TODO\n\n false,\n\n );\n\n });\n\n\n\n thread_local! {\n\n static GLOBAL_SCOPES: std::cell::RefCell<Vec<ReactiveScope>> = std::cell::RefCell::new(Vec::new());\n\n }\n\n\n\n GLOBAL_SCOPES.with(|global_scopes| global_scopes.borrow_mut().push(scope));\n\n}\n","file_path":"packages/sycamore/src/generic_node/dom_node.rs","rank":21,"score":169605.51743827903},{"content":"/// Render a [`View`] under a `parent` node.\n\n/// For rendering under the `<body>` tag, use [`render`] instead.\n\n///\n\n/// _This API requires the following crate features to be activated: `dom`_\n\npub fn render_to(template: impl FnOnce() -> View<DomNode>, parent: &Node) {\n\n let scope = create_root(|| {\n\n insert(\n\n &DomNode {\n\n id: Default::default(),\n\n node: parent.clone(),\n\n },\n\n template(),\n\n None,\n\n None,\n\n false,\n\n );\n\n });\n\n\n\n thread_local! {\n\n static GLOBAL_SCOPES: std::cell::RefCell<Vec<ReactiveScope>> = std::cell::RefCell::new(Vec::new());\n\n }\n\n\n\n GLOBAL_SCOPES.with(|global_scopes| global_scopes.borrow_mut().push(scope));\n\n}\n\n\n","file_path":"packages/sycamore/src/generic_node/dom_node.rs","rank":22,"score":169605.2752897476},{"content":"#[component(Component<G>)]\n\npub fn component() -> View<G> {\n\n view! {\n\n div\n\n }\n\n}\n\n\n","file_path":"packages/sycamore-macro/tests/view/component-pass.rs","rank":23,"score":168736.64051895888},{"content":"#[component(Comp8<G>)]\n\nfn comp8(one: (), two: ()) -> View<G> {\n\n todo!();\n\n}\n\n\n","file_path":"packages/sycamore-macro/tests/component/component-fail.rs","rank":24,"score":166943.36251542915},{"content":"/// Creates a new [`ReactiveScope`] with a context and runs the supplied callback function.\n\npub fn create_context_scope<T: 'static, Out>(value: T, f: impl FnOnce() -> Out) -> Out {\n\n SCOPES.with(|scopes| {\n\n // Create a new ReactiveScope with a context.\n\n let scope = ReactiveScope::new();\n\n scope.0.borrow_mut().context = Some(Box::new(Context { value }));\n\n scopes.borrow_mut().push(scope);\n\n let out = f();\n\n let scope = scopes.borrow_mut().pop().unwrap_throw();\n\n on_cleanup(move || drop(scope));\n\n out\n\n })\n\n}\n","file_path":"packages/sycamore-reactive/src/context.rs","rank":25,"score":165942.42379478965},{"content":"#[component(Portal<G>)]\n\npub fn portal(props: PortalProps<G>) -> View<G> {\n\n let PortalProps { children, selector } = props;\n\n\n\n if G::IS_BROWSER {\n\n let window = web_sys::window().unwrap_throw();\n\n let document = window.document().unwrap_throw();\n\n let container = document\n\n .query_selector(selector)\n\n .unwrap_throw()\n\n .expect_throw(\"could not find element matching selector\");\n\n\n\n let children = children.flatten();\n\n\n\n for child in &children {\n\n container\n\n .append_child(\n\n &<dyn Any>::downcast_ref::<DomNode>(child)\n\n .unwrap_throw()\n\n .inner_element(),\n\n )\n","file_path":"packages/sycamore/src/portal.rs","rank":26,"score":159765.0615925096},{"content":"/// An alternative to [`Signal::new`] that uses a reducer to get the next value.\n\n///\n\n/// It uses a reducer function that takes the previous value and a message and returns the next\n\n/// value.\n\n///\n\n/// Returns a [`ReadSignal`] and a dispatch function to send messages to the reducer.\n\n///\n\n/// # Params\n\n/// * `initial` - The initial value of the state.\n\n/// * `reducer` - A function that takes the previous value and a message and returns the next value.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use sycamore_reactive::*;\n\n///\n\n/// enum Msg {\n\n/// Increment,\n\n/// Decrement,\n\n/// }\n\n///\n\n/// let (state, dispatch) = create_reducer(0, |state, msg: Msg| match msg {\n\n/// Msg::Increment => *state + 1,\n\n/// Msg::Decrement => *state - 1,\n\n/// });\n\n///\n\n/// assert_eq!(*state.get(), 0);\n\n/// dispatch(Msg::Increment);\n\n/// assert_eq!(*state.get(), 1);\n\n/// dispatch(Msg::Decrement);\n\n/// assert_eq!(*state.get(), 0);\n\n/// ```\n\npub fn create_reducer<F, Out, Msg>(initial: Out, reduce: F) -> (ReadSignal<Out>, Rc<impl Fn(Msg)>)\n\nwhere\n\n F: Fn(&Out, Msg) -> Out,\n\n{\n\n let memo = Signal::new(initial);\n\n\n\n let dispatcher = {\n\n let memo = memo.clone();\n\n move |msg| {\n\n memo.set(reduce(&memo.get_untracked(), msg));\n\n }\n\n };\n\n\n\n (memo.into_handle(), Rc::new(dispatcher))\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":27,"score":159379.82421845023},{"content":"/// Parse a Rust identifier. Reference: https://doc.rust-lang.org/reference/identifiers.html\n\nfn ident(i: &str) -> IResult<&str, &str> {\n\n recognize(pair(ident_start, many0(ident_continue)))(i)\n\n}\n\n\n","file_path":"packages/sycamore-router-macro/src/parser.rs","rank":28,"score":156332.0965930366},{"content":"fn param(i: &str) -> IResult<&str, &str> {\n\n take_till(|c| c == '/')(i)\n\n}\n\n\n","file_path":"packages/sycamore-router-macro/src/parser.rs","rank":29,"score":156326.89533079637},{"content":"#[component(NumberDisplayer<G>)]\n\nfn number_displayer(prop: i32) -> View<G> {\n\n view! {\n\n p { \"My number is: \" (prop) }\n\n }\n\n}\n\n\n","file_path":"examples/higher-order-components/src/main.rs","rank":30,"score":156191.88086322855},{"content":"/// Reconciles an array of nodes.\n\n///\n\n/// # Params\n\n/// * `parent` - The parent node under which all other nodes are (direct) children.\n\n/// * `a` - The current/existing nodes that are to be diffed.\n\n/// * `b` - The new nodes that are to be inserted. After the reconciliation, all the nodes in `b`\n\n/// should be inserted under `parent`.\n\n///\n\n/// # Panics\n\n/// Panics if `a.is_empty()`. Append nodes instead.\n\npub fn reconcile_fragments<G: GenericNode>(parent: &G, a: &mut [G], b: &[G]) {\n\n debug_assert!(!a.is_empty(), \"a cannot be empty\");\n\n\n\n // Sanity check: make sure all nodes in a are children of parent.\n\n #[cfg(debug_assertions)]\n\n {\n\n for (i, node) in a.iter().enumerate() {\n\n if node.parent_node().as_ref() != Some(parent) {\n\n panic!(\n\n \"node {} in existing nodes Vec is not a child of parent. node = {:#?}\",\n\n i, node\n\n );\n\n }\n\n }\n\n }\n\n\n\n let b_len = b.len();\n\n let mut a_end = a.len();\n\n let mut b_end = b_len;\n\n let mut a_start = 0;\n","file_path":"packages/sycamore/src/utils/render.rs","rank":31,"score":155867.08489982173},{"content":"/// Creates a memoized value from some signals. Also know as \"derived stores\".\n\n/// Unlike [`create_memo`], this function will not notify dependents of a change if the output is\n\n/// the same.\n\n///\n\n/// It takes a comparison function to compare the old and new value, which returns `true` if they\n\n/// are the same and `false` otherwise.\n\n///\n\n/// To use the type's [`PartialEq`] implementation instead of a custom function, use\n\n/// [`create_selector`].\n\npub fn create_selector_with<F, Out, C>(mut derived: F, comparator: C) -> ReadSignal<Out>\n\nwhere\n\n F: FnMut() -> Out + 'static,\n\n Out: 'static,\n\n C: Fn(&Out, &Out) -> bool + 'static,\n\n{\n\n let memo = Rc::new(RefCell::new(None::<Signal<Out>>));\n\n\n\n create_effect({\n\n let memo = Rc::clone(&memo);\n\n move || {\n\n if memo.borrow().as_ref().is_some() {\n\n let memo = memo.borrow();\n\n let memo = memo.as_ref().unwrap_throw();\n\n let new_value = derived();\n\n if !comparator(&memo.get_untracked(), &new_value) {\n\n memo.set(new_value);\n\n }\n\n } else {\n\n *memo.borrow_mut() = Some(Signal::new(derived()));\n\n }\n\n }\n\n });\n\n\n\n let memo = memo.borrow();\n\n memo.as_ref().unwrap_throw().handle()\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":32,"score":151755.72724529565},{"content":"/// Get the value of a context in the current [`ReactiveScope`].\n\n///\n\n/// # Panics\n\n/// This function will `panic!` if the context is not found in the current scope or a parent scope.\n\npub fn use_context<T: Clone + 'static>() -> T {\n\n SCOPES.with(|scopes| {\n\n let scopes = scopes.borrow();\n\n let mut current = scopes.last().map(|s| Rc::clone(&s.0));\n\n match current {\n\n Some(_) => {\n\n while let Some(scope) = ¤t {\n\n if let Some(context) = &scope.borrow().context {\n\n if let Some(value) = context.get_value().downcast_ref::<T>() {\n\n return value.clone();\n\n }\n\n }\n\n current = current.unwrap_throw().borrow().parent.0.upgrade();\n\n }\n\n panic!(\"context not found for type\")\n\n }\n\n None => panic!(\"context not found for type\"),\n\n }\n\n })\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/context.rs","rank":33,"score":151203.16500699363},{"content":"/// Create a [`View`] from an array of [`View`].\n\n///\n\n/// # Example\n\n/// ```\n\n/// # use sycamore::prelude::*;\n\n/// # use sycamore::builder::html::*;\n\n/// # fn _test<G: GenericNode>() -> View<G> {\n\n/// fragment([\n\n/// div().build(),\n\n/// div().build()\n\n/// ])\n\n/// # }\n\n/// ```\n\npub fn fragment<G, const N: usize>(parts: [View<G>; N]) -> View<G>\n\nwhere\n\n G: GenericNode,\n\n{\n\n View::new_fragment(Vec::from_iter(parts.to_vec()))\n\n}\n\n\n\n/// The main type powering the builder API.\n\n#[derive(Debug)]\n\npub struct NodeBuilder<G>\n\nwhere\n\n G: GenericNode,\n\n{\n\n element: G,\n\n}\n\n\n\nimpl<G> NodeBuilder<G>\n\nwhere\n\n G: GenericNode,\n\n{\n","file_path":"packages/sycamore/src/builder/agnostic/mod.rs","rank":34,"score":150023.47267937986},{"content":"pub fn route(i: &str) -> IResult<&str, RoutePathAst> {\n\n map(separated_list0(tag(\"/\"), segment), |segments| {\n\n let segments = segments\n\n .into_iter()\n\n .filter(|x| !matches!(x, SegmentAst::Param(param) if param.is_empty()))\n\n .collect();\n\n RoutePathAst { segments }\n\n })(i)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use expect_test::{expect, Expect};\n\n\n\n use super::*;\n\n\n\n fn check(input: &str, expect: Expect) {\n\n let actual = format!(\"{:#?}\", route(input).unwrap());\n\n expect.assert_eq(&actual);\n\n }\n","file_path":"packages/sycamore-router-macro/src/parser.rs","rank":35,"score":144649.47469487353},{"content":"#[component(Router<G>)]\n\npub fn router<R, F>(props: RouterProps<R, F, G>) -> View<G>\n\nwhere\n\n R: Route + 'static,\n\n F: FnOnce(ReadSignal<R>) -> View<G> + 'static,\n\n{\n\n let RouterProps {\n\n render,\n\n integration,\n\n _phantom,\n\n } = props;\n\n let render = Rc::new(RefCell::new(Some(render)));\n\n let integration = Rc::new(integration);\n\n let base_pathname = base_pathname();\n\n\n\n PATHNAME.with(|pathname| {\n\n assert!(pathname.borrow().is_none());\n\n // Get initial url from window.location.\n\n let path = integration.current_pathname();\n\n let path = path.strip_prefix(&base_pathname).unwrap_or(&path);\n\n *pathname.borrow_mut() = Some(Signal::new(path.to_string()));\n","file_path":"packages/sycamore-router/src/router.rs","rank":36,"score":143186.03705005132},{"content":"#[component(ContextProvider<G>)]\n\npub fn context_provider<T, F>(props: ContextProviderProps<T, F, G>) -> View<G>\n\nwhere\n\n T: 'static,\n\n F: FnOnce() -> View<G>,\n\n{\n\n let ContextProviderProps { value, children } = props;\n\n\n\n create_context_scope(value, children)\n\n}\n\n\n\n#[cfg(all(test, feature = \"ssr\"))]\n\nmod tests {\n\n use super::*;\n\n use sycamore_reactive::use_context;\n\n\n\n #[test]\n\n fn basic_context() {\n\n sycamore::render_to_string(|| {\n\n view! {\n\n ContextProvider(ContextProviderProps {\n","file_path":"packages/sycamore/src/context.rs","rank":37,"score":141441.95848752774},{"content":"#[component(Comp2<G>)]\n\nfn comp2(_props: ()) -> View<G> {\n\n todo!();\n\n}\n\n\n","file_path":"packages/sycamore-macro/tests/component/component-pass.rs","rank":38,"score":140904.0397895042},{"content":"#[component(StaticRouter<G>)]\n\npub fn static_router<R, F>(props: StaticRouterProps<R, F, G>) -> View<G>\n\nwhere\n\n R: Route + 'static,\n\n F: Fn(R) -> View<G> + 'static,\n\n{\n\n let StaticRouterProps {\n\n render,\n\n route,\n\n _phantom,\n\n } = props;\n\n\n\n render(route)\n\n}\n\n\n","file_path":"packages/sycamore-router/src/router.rs","rank":39,"score":139755.1803994487},{"content":"#[component(Indexed<G>)]\n\npub fn indexed<T: 'static, F: 'static>(props: IndexedProps<T, F, G>) -> View<G>\n\nwhere\n\n T: Clone + PartialEq,\n\n F: Fn(T) -> View<G>,\n\n{\n\n let IndexedProps { iterable, template } = props;\n\n\n\n let mut mapped = map_indexed(iterable, move |x| template(x.clone()));\n\n View::new_dyn(move || View::new_fragment(mapped()))\n\n}\n","file_path":"packages/sycamore/src/flow.rs","rank":40,"score":138781.75176836166},{"content":"#[component(Content<G>)]\n\npub fn content(\n\n ContentProps {\n\n data: MarkdownPage { html, outline },\n\n sidebar,\n\n }: ContentProps,\n\n) -> View<G> {\n\n let show_sidebar = sidebar.is_some();\n\n\n\n let sidebar_version = sidebar.as_ref().map(|x| x.0.clone());\n\n\n\n view! {\n\n div(class=\"flex w-full\") {\n\n (if show_sidebar {\n\n view! {\n\n div(class=\"flex-none\") {\n\n crate::sidebar::Sidebar(sidebar.clone().unwrap())\n\n }\n\n }\n\n } else {\n\n view! {}\n","file_path":"website/src/content.rs","rank":41,"score":138268.45483989007},{"content":"/// Internal implementation: use dynamic dispatch to reduce code bloat.\n\nfn _create_effect(mut effect: Box<dyn FnMut()>) {\n\n let listener: Rc<RefCell<Option<Listener>>> = Rc::new(RefCell::new(None));\n\n\n\n // Callback for when the effect's dependencies are triggered.\n\n let callback: Rc<RefCell<dyn FnMut()>> = Rc::new(RefCell::new({\n\n let listener = Rc::downgrade(&listener);\n\n move || {\n\n LISTENERS.with(|listeners| {\n\n // Record initial context size to verify that it is the same after.\n\n let initial_context_size = listeners.borrow().len();\n\n\n\n // Upgrade running now to make sure running is valid for the whole duration of\n\n // the effect.\n\n let listener = listener.upgrade().unwrap_throw();\n\n\n\n // Push new reactive scope.\n\n listeners.borrow_mut().push(Rc::downgrade(&listener));\n\n\n\n let mut listener_mut = listener.borrow_mut();\n\n let listener_ref = listener_mut.as_mut().unwrap_throw();\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":42,"score":137308.4407504286},{"content":"#[component(Comp9<G>)]\n\nstruct AStruct;\n\n\n","file_path":"packages/sycamore-macro/tests/component/component-fail.rs","rank":43,"score":136749.29470402503},{"content":"fn assert_cleanup_called(f: impl FnOnce()) {\n\n CLEANUP_CALLED.with(|cleanup_called| {\n\n assert!(!cleanup_called.get());\n\n f();\n\n assert!(cleanup_called.get());\n\n\n\n cleanup_called.set(false); // Reset for next test\n\n });\n\n}\n\n\n","file_path":"packages/sycamore/tests/web/cleanup.rs","rank":44,"score":135692.7154321054},{"content":"#[component(EnhancedComponent<G>)]\n\nfn enhanced_component<C: Component<G, Props = i32>>() -> View<G> {\n\n view! {\n\n div(class=\"enhanced-container\") {\n\n p { \"Enhanced container start\" }\n\n C(42)\n\n p { \"Enhanced container end\" }\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/higher-order-components/src/main.rs","rank":45,"score":134251.46157729885},{"content":"#[wasm_bindgen_test]\n\npub fn test_cleanup_in_root() {\n\n let root = create_root(|| {\n\n on_cleanup(on_cleanup_callback);\n\n });\n\n\n\n assert_cleanup_called(|| {\n\n drop(root);\n\n });\n\n}\n\n\n","file_path":"packages/sycamore/tests/web/cleanup.rs","rank":46,"score":130870.24489535722},{"content":"#[wasm_bindgen_test]\n\npub fn test_cleanup_in_effect() {\n\n let trigger = Signal::new(());\n\n\n\n create_effect(cloned!((trigger) => move || {\n\n trigger.get();\n\n on_cleanup(on_cleanup_callback);\n\n }));\n\n\n\n assert_cleanup_called(|| {\n\n trigger.set(());\n\n });\n\n}\n\n\n","file_path":"packages/sycamore/tests/web/cleanup.rs","rank":47,"score":130870.24489535722},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n println!(\"cargo:rerun-if-changed=build.rs\");\n\n println!(\"cargo:rerun-if-changed=next\");\n\n println!(\"cargo:rerun-if-changed=versioned_docs\");\n\n println!(\"cargo:rerun-if-changed=posts\");\n\n\n\n // Sitemap.\n\n generate_sitemap_xml()?;\n\n\n\n // Markdown files.\n\n build_dir(Path::new(\"./next\"), Path::new(\"docs\"))?;\n\n build_dir(Path::new(\"./versioned_docs\"), Path::new(\"docs\"))?;\n\n build_dir(Path::new(\"./posts\"), Path::new(\"posts\"))?;\n\n\n\n // Docs sidebars.\n\n let next_sidebar = fs::read_to_string(\"./next/sidebar.json\")?;\n\n fs::write(\"../website/static/docs/sidebar.json\", next_sidebar)?;\n\n for entry in WalkDir::new(\"./versioned_docs\") {\n\n let entry = entry?;\n\n if entry.path().file_name() == Some(OsStr::new(\"sidebar.json\")) {\n","file_path":"docs/build.rs","rank":48,"score":128276.27526586986},{"content":"#[component(Header<G>)]\n\npub fn header() -> View<G> {\n\n view! {\n\n header(class=\"fixed top-0 z-50 w-full\") {\n\n Nav()\n\n }\n\n }\n\n}\n","file_path":"website/src/header.rs","rank":49,"score":128004.20327947737},{"content":"#[component(Versions<G>)]\n\npub fn versions() -> View<G> {\n\n web_sys::window()\n\n .unwrap()\n\n .document()\n\n .unwrap()\n\n .set_title(\"Versions - Sycamore\");\n\n\n\n let versions = VERSIONS\n\n .iter()\n\n .map(|(name, versioned_docs_link)| {\n\n view! {\n\n li {\n\n h2(class=\"text-2xl font-light\") { (name) }\n\n div(class=\"flex flex-col divide-y dark:divide-gray-500 text-gray-600 dark:text-gray-300\") {\n\n VersionedDocsLinkView((name, versioned_docs_link))\n\n }\n\n }\n\n }\n\n })\n\n .collect();\n","file_path":"website/src/versions.rs","rank":50,"score":128004.20327947737},{"content":"#[component(Index<G>)]\n\npub fn index() -> View<G> {\n\n web_sys::window()\n\n .unwrap()\n\n .document()\n\n .unwrap()\n\n .set_title(\"Sycamore\");\n\n\n\n view! {\n\n div(class=\"pb-10\") {\n\n div(class=\"flex flex-col items-center w-full mb-10\") {\n\n h1(class=\"text-5xl font-bold mt-20 mb-5\") {\n\n \"Sycamore\"\n\n }\n\n\n\n p(class=\"mb-5 text-center\") {\n\n \"A reactive library for creating web apps in Rust and WebAssembly\"\n\n }\n\n\n\n // region: badges\n\n div(class=\"mb-7 flex flex-row flex-wrap justify-center gap-1\") {\n","file_path":"website/src/index.rs","rank":51,"score":128004.20327947737},{"content":"pub fn create_child_scope_in<'a>(\n\n parent: Option<&ReactiveScopeWeak>,\n\n callback: impl FnOnce() + 'a,\n\n) -> ReactiveScope {\n\n _create_child_scope_in(parent, Box::new(callback))\n\n}\n\n\n\n/// Creates a new reactive root / scope. Generally, you won't need this method as it is called\n\n/// automatically in `render`.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use sycamore_reactive::*;\n\n///\n\n/// let trigger = Signal::new(());\n\n/// let counter = Signal::new(0);\n\n///\n\n/// let scope = create_root(cloned!((trigger, counter) => move || {\n\n/// create_effect(move || {\n\n/// trigger.get(); // subscribe to trigger\n","file_path":"packages/sycamore-reactive/src/lib.rs","rank":52,"score":127478.14979043292},{"content":"fn dyn_param(i: &str) -> IResult<&str, &str> {\n\n delimited(tag(\"<\"), ident, tag(\">\"))(i)\n\n}\n\n\n","file_path":"packages/sycamore-router-macro/src/parser.rs","rank":53,"score":126256.59276098566},{"content":"#[component(Header<G>)]\n\npub fn header() -> View<G> {\n\n let app_state = use_context::<AppState>();\n\n let value = Signal::new(String::new());\n\n\n\n let handle_submit = cloned!((app_state, value) => move |event: Event| {\n\n let event: KeyboardEvent = event.unchecked_into();\n\n\n\n if event.key() == \"Enter\" {\n\n let mut task = value.get().as_ref().clone();\n\n task = task.trim().to_string();\n\n\n\n if !task.is_empty() {\n\n app_state.add_todo(task);\n\n value.set(\"\".to_string());\n\n }\n\n }\n\n });\n\n\n\n view! {\n\n header(class=\"header\") {\n\n h1 { \"todos\" }\n\n input(class=\"new-todo\",\n\n placeholder=\"What needs to be done?\",\n\n bind:value=value,\n\n on:keyup=handle_submit,\n\n )\n\n }\n\n }\n\n}\n","file_path":"examples/todomvc/src/header.rs","rank":54,"score":126202.08772525155},{"content":"#[component(Controls<G>)]\n\npub fn controls() -> View<G> {\n\n let counter = use_context::<Signal<i32>>();\n\n\n\n let increment = cloned!((counter) => move |_| counter.set(*counter.get() + 1));\n\n\n\n let reset = cloned!((counter) => move |_| counter.set(0));\n\n\n\n view! {\n\n button(class=\"increment\", on:click=increment) {\n\n \"Increment\"\n\n }\n\n button(class=\"reset\", on:click=reset) {\n\n \"Reset\"\n\n }\n\n }\n\n}\n\n\n","file_path":"examples/context/src/main.rs","rank":55,"score":126202.08772525155},{"content":"#[component(Copyright<G>)]\n\npub fn copyright() -> View<G> {\n\n view! {\n\n footer(class=\"info\") {\n\n p { \"Double click to edit a todo\" }\n\n p {\n\n \"Created by \"\n\n a(href=\"https://github.com/lukechu10\", target=\"_blank\") { \"lukechu10\" }\n\n }\n\n p {\n\n \"Part of \"\n\n a(href=\"http://todomvc.com\") { \"TodoMVC\" }\n\n }\n\n }\n\n }\n\n}\n","file_path":"examples/todomvc/src/copyright.rs","rank":56,"score":126202.08772525155},{"content":"#[component(Footer<G>)]\n\npub fn footer() -> View<G> {\n\n let app_state = use_context::<AppState>();\n\n\n\n let items_text = cloned!((app_state) => move || {\n\n match app_state.todos_left() {\n\n 1 => \"item\",\n\n _ => \"items\"\n\n }\n\n });\n\n\n\n let has_completed_todos = create_selector(cloned!((app_state) => move || {\n\n app_state.todos_left() < app_state.todos.get().len()\n\n }));\n\n\n\n let handle_clear_completed = cloned!((app_state) => move |_| {\n\n app_state.clear_completed()\n\n });\n\n\n\n view! {\n\n footer(class=\"footer\") {\n","file_path":"examples/todomvc/src/footer.rs","rank":57,"score":126202.08772525155},{"content":"#[component(List<G>)]\n\npub fn list() -> View<G> {\n\n let app_state = use_context::<AppState>();\n\n let todos_left = create_selector(cloned!((app_state) => move || {\n\n app_state.todos_left()\n\n }));\n\n\n\n let filtered_todos = create_memo(cloned!((app_state) => move || {\n\n app_state.todos.get().iter().filter(|todo| match *app_state.filter.get() {\n\n Filter::All => true,\n\n Filter::Active => !todo.get().completed,\n\n Filter::Completed => todo.get().completed,\n\n }).cloned().collect::<Vec<_>>()\n\n }));\n\n\n\n // We need a separate signal for checked because clicking the checkbox will detach the binding\n\n // between the attribute and the view.\n\n let checked = Signal::new(false);\n\n create_effect(cloned!((checked) => move || {\n\n // Calling checked.set will also update the `checked` property on the input element.\n\n checked.set(*todos_left.get() == 0)\n","file_path":"examples/todomvc/src/list.rs","rank":58,"score":126202.08772525155},{"content":"fn generate_sitemap_xml() -> Result<(), Box<dyn Error>> {\n\n let out_path = Path::new(\"../website/sitemap_index.xml\");\n\n\n\n let mut buf = String::new();\n\n writeln!(buf, r#\"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\"#)?;\n\n writeln!(\n\n buf,\n\n r#\"<urlset xmlns=\"http://www.sitemaps.org/schemas/sitemap/0.9\">\"#\n\n )?;\n\n\n\n write_url(&mut buf, \"\", \"monthly\", \"1.0\")?;\n\n write_url(&mut buf, \"/news\", \"monthly\", \"0.8\")?;\n\n write_url(&mut buf, \"/versions\", \"monthly\", \"0.3\")?;\n\n\n\n // News\n\n generate_sitemap_for_dir(&mut buf, \"/news\", Path::new(\"posts\"), \"yearly\", \"0.8\")?;\n\n\n\n // Docs for master\n\n generate_sitemap_for_dir(&mut buf, \"/docs\", Path::new(\"./next\"), \"weekly\", \"0.5\")?;\n\n\n","file_path":"docs/build.rs","rank":59,"score":124721.00239940739},{"content":"/// Navigates to the specified `url`. The url should have the same origin as the app.\n\n///\n\n/// This is useful for imperatively navigating to an url when using an anchor tag (`<a>`) is not\n\n/// possible/suitable (e.g. when submitting a form).\n\n///\n\n/// # Panics\n\n/// This function will `panic!()` if a [`Router`] has not yet been created.\n\npub fn navigate(url: &str) {\n\n PATHNAME.with(|pathname| {\n\n assert!(\n\n pathname.borrow().is_some(),\n\n \"navigate can only be used with a BrowserRouter\"\n\n );\n\n\n\n let pathname = pathname.borrow().clone().unwrap_throw();\n\n let path = url.strip_prefix(&base_pathname()).unwrap_or(url);\n\n pathname.set(path.to_string());\n\n\n\n // Update History API.\n\n let window = web_sys::window().unwrap_throw();\n\n let history = window.history().unwrap_throw();\n\n history\n\n .push_state_with_url(&JsValue::UNDEFINED, \"\", Some(url))\n\n .unwrap_throw();\n\n window.scroll_to_with_x_and_y(0.0, 0.0);\n\n });\n\n}\n\n\n","file_path":"packages/sycamore-router/src/router.rs","rank":60,"score":124484.02081648918},{"content":"#[component(NewsIndex<G>)]\n\npub fn news_index() -> View<G> {\n\n web_sys::window()\n\n .unwrap()\n\n .document()\n\n .unwrap()\n\n .set_title(\"News - Sycamore\");\n\n\n\n let posts = POSTS\n\n .iter()\n\n .map(|(title, subtitle, url)| {\n\n view! {\n\n li(class=\"hover:text-yellow-500 transition-colors\") {\n\n a(href=format!(\"/news/{}\", url)) {\n\n h2(class=\"text-2xl font-light\") { (title) }\n\n p(class=\"text-gray-600 dark:text-gray-400\") { (subtitle) }\n\n }\n\n }\n\n }\n\n })\n\n .collect();\n","file_path":"website/src/news_index.rs","rank":61,"score":124480.53370008957},{"content":"/// Runs a callback in a `requestAnimationFrame` loop until the `callback` returns `false`.\n\npub fn loop_raf(task: Task) {\n\n TASKS.with(|tasks| {\n\n if tasks.borrow().is_empty() {\n\n run_tasks();\n\n }\n\n\n\n tasks.borrow_mut().insert(task);\n\n });\n\n}\n","file_path":"packages/sycamore/src/utils.rs","rank":62,"score":124480.32497814854},{"content":"pub fn circ_in(t: f32) -> f32 {\n\n 1.0 - f32::sqrt(1.0 - f32::powi(t, 2))\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":63,"score":123521.39307363113},{"content":"pub fn expo_in(t: f32) -> f32 {\n\n if t.abs() <= f32::EPSILON {\n\n 0.0\n\n } else {\n\n EXP_BASE.powf(10.0 * t - 10.0)\n\n }\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":64,"score":123521.39307363113},{"content":"pub fn cubic_in(t: f32) -> f32 {\n\n t * t * t\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":65,"score":123521.39307363113},{"content":"pub fn sine_out(t: f32) -> f32 {\n\n f32::sin(t * PI / 2.0)\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":66,"score":123521.39307363113},{"content":"pub fn quint_out(t: f32) -> f32 {\n\n let f = t - 1.0;\n\n f * f * f * f * f + 1.0\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":67,"score":123521.39307363113},{"content":"pub fn bounce_in(t: f32) -> f32 {\n\n 1.0 - bounce_out(1.0 - t)\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":68,"score":123521.39307363113},{"content":"pub fn quad_out(t: f32) -> f32 {\n\n -t * (t - 2.0)\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":69,"score":123521.39307363113},{"content":"pub fn sine_in(t: f32) -> f32 {\n\n 1.0 - f32::cos(t * PI / 2.0)\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":70,"score":123521.39307363113},{"content":"pub fn cubic_out(t: f32) -> f32 {\n\n let f = t - 1.0;\n\n f * f * f + 1.0\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":71,"score":123521.39307363113},{"content":"pub fn quint_in(t: f32) -> f32 {\n\n t * t * t * t * t\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":72,"score":123521.39307363113},{"content":"pub fn quart_in(t: f32) -> f32 {\n\n t * t * t * t\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":73,"score":123521.39307363113},{"content":"pub fn circ_out(t: f32) -> f32 {\n\n f32::sqrt(1.0 - f32::powi(t - 1.0, 2).powi(2))\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":74,"score":123521.39307363113},{"content":"pub fn expo_out(t: f32) -> f32 {\n\n if (t - 1.0).abs() <= f32::EPSILON {\n\n 1.0\n\n } else {\n\n 1.0 - EXP_BASE.powf(-10.0 * t)\n\n }\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":75,"score":123521.39307363113},{"content":"pub fn quart_out(t: f32) -> f32 {\n\n let f = t - 1.0;\n\n f * f * f * (1.0 - t) + 1.0\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":76,"score":123521.39307363113},{"content":"pub fn bounce_out(t: f32) -> f32 {\n\n // TODO: Refactor? Code seems like a repetition.\n\n // Further, it is unclear why the numbers here are\n\n // picked.\n\n if t < 1.0 / BOUNCE_GRAVITY {\n\n BOUNCE_AMPLITUDE * t * t\n\n } else if t < 2.0 / BOUNCE_GRAVITY {\n\n let t = t - 1.5 / BOUNCE_GRAVITY;\n\n BOUNCE_AMPLITUDE * t * t + 0.75\n\n } else if t < 2.5 / BOUNCE_GRAVITY {\n\n let t = t - 2.25 / BOUNCE_GRAVITY;\n\n BOUNCE_AMPLITUDE * t * t + 0.9375\n\n } else {\n\n let t = t - 2.625 / BOUNCE_GRAVITY;\n\n BOUNCE_AMPLITUDE * t * t + 0.984375\n\n }\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":77,"score":123521.39307363113},{"content":"pub fn linear(t: f32) -> f32 {\n\n t\n\n}\n\n\n\n// Quadratic\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":78,"score":123521.39307363113},{"content":"pub fn quad_in(t: f32) -> f32 {\n\n t * t\n\n}\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":79,"score":123521.39307363113},{"content":"/// Function that maps a `Vec` to another `Vec` via a map function. The mapped `Vec` is lazy\n\n/// computed, meaning that it's value will only be updated when requested. Modifications to the\n\n/// input `Vec` are diffed by index to prevent recomputing values that have not changed.\n\n///\n\n/// Generally, it is preferred to use [`map_keyed`] instead when a key function is available.\n\n///\n\n/// This function is the underlying utility behind `Indexed`.\n\n///\n\n/// # Params\n\n/// * `list` - The list to be mapped. The list must be a [`ReadSignal`] (obtained from a [`Signal`])\n\n/// and therefore reactive.\n\n/// * `map_fn` - A closure that maps from the input type to the output type.\n\npub fn map_indexed<T, U>(\n\n list: ReadSignal<Vec<T>>,\n\n map_fn: impl Fn(&T) -> U + 'static,\n\n) -> impl FnMut() -> Vec<U>\n\nwhere\n\n T: PartialEq + Clone,\n\n U: Clone + 'static,\n\n{\n\n let parent_scope = current_scope();\n\n\n\n // Previous state used for diffing.\n\n let mut items = Rc::new(Vec::new());\n\n let mapped = Rc::new(RefCell::new(Vec::new()));\n\n let mut scopes = Vec::new();\n\n\n\n move || {\n\n let new_items = list.get(); // Subscribe to list.\n\n untrack(|| {\n\n if new_items.is_empty() {\n\n // Fast path for removing all items.\n","file_path":"packages/sycamore-reactive/src/iter.rs","rank":80,"score":122854.87604910244},{"content":"/// Gets the number of dependencies of the current reactive scope.\n\n///\n\n/// If the function is called outside a reactive scope, it will return `None`.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use sycamore_reactive::*;\n\n///\n\n/// assert_eq!(dependency_count(), None);\n\n///\n\n/// let state = Signal::new(1);\n\n/// create_effect(move || {\n\n/// assert_eq!(dependency_count(), Some(0));\n\n/// state.get();\n\n/// assert_eq!(dependency_count(), Some(1));\n\n/// });\n\n/// ```\n\npub fn dependency_count() -> Option<usize> {\n\n LISTENERS.with(|listeners| {\n\n listeners.borrow().last().map(|last_context| {\n\n last_context\n\n .upgrade()\n\n .expect_throw(\"Running should be valid while inside reactive scope\")\n\n .borrow()\n\n .as_ref()\n\n .unwrap_throw()\n\n .dependencies\n\n .len()\n\n })\n\n })\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":81,"score":122842.03740185009},{"content":"/// Navigates to the specified `url` without adding a new history entry. Instead, this replaces the\n\n/// current location with the new `url`. The url should have the same origin as the app.\n\n///\n\n/// This is useful for imperatively navigating to an url when using an anchor tag (`<a>`) is not\n\n/// possible/suitable (e.g. when submitting a form).\n\n///\n\n/// # Panics\n\n/// This function will `panic!()` if a [`Router`] has not yet been created.\n\npub fn navigate_replace(url: &str) {\n\n PATHNAME.with(|pathname| {\n\n assert!(\n\n pathname.borrow().is_some(),\n\n \"navigate_replace can only be used with a BrowserRouter\"\n\n );\n\n\n\n let pathname = pathname.borrow().clone().unwrap_throw();\n\n let path = url.strip_prefix(&base_pathname()).unwrap_or(url);\n\n pathname.set(path.to_string());\n\n\n\n // Update History API.\n\n let window = web_sys::window().unwrap_throw();\n\n let history = window.history().unwrap_throw();\n\n history\n\n .replace_state_with_url(&JsValue::UNDEFINED, \"\", Some(url))\n\n .unwrap_throw();\n\n window.scroll_to_with_x_and_y(0.0, 0.0);\n\n });\n\n}\n\n\n","file_path":"packages/sycamore-router/src/router.rs","rank":82,"score":122840.41305246016},{"content":"/// Insert a [`GenericNode`] under `parent` at the specified `marker`. If `initial` is `Some(_)`,\n\n/// `initial` will be replaced with the new inserted node.\n\n///\n\n/// # Params\n\n/// * `parent` - The parent node to insert `accessor` under.\n\n/// * `accessor` - The [`View`] to be inserted.\n\n/// * `initial` - An optional initial node that is already inserted into the DOM.\n\n/// * `marker` - An optional marker node. If `marker` is `Some(_)`, `accessor` will be inserted\n\n/// directly before `marker`. If `marker` is `None`, `accessor` will be appended at the end of\n\n/// `parent`.\n\n/// * `multi` - A boolean flag indicating whether the node to be inserted is the only child of\n\n/// `parent`. Setting this to `true` will enable certain optimizations when clearing the node.\n\n/// Even if the node to be inserted is the only child of `parent`, `multi` can still be set to\n\n/// `false` but forgoes the optimizations.\n\npub fn insert<G: GenericNode>(\n\n parent: &G,\n\n accessor: View<G>,\n\n initial: Option<View<G>>,\n\n marker: Option<&G>,\n\n multi: bool,\n\n) {\n\n insert_expression(parent, &accessor, initial, marker, false, multi);\n\n}\n\n\n","file_path":"packages/sycamore/src/utils/render.rs","rank":83,"score":122832.0686493215},{"content":"pub fn circ_inout(t: f32) -> f32 {\n\n if t < 0.5 {\n\n (1.0 - f32::sqrt(1.0 - f32::powi(2.0 * t, 2))) / 2.0\n\n } else {\n\n (f32::sqrt(1.0 - f32::powi(-2.0 * t + 2.0, 2)) + 1.0) / 2.0\n\n }\n\n}\n\n\n\n// Exponential\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":84,"score":121799.90763898703},{"content":"pub fn quad_inout(t: f32) -> f32 {\n\n if t < 0.5 {\n\n 2.0 * t * t\n\n } else {\n\n -2.0 * t * t + 4.0 * t - 1.0\n\n }\n\n}\n\n\n\n// Cubic\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":85,"score":121799.90763898703},{"content":"pub fn sine_inout(t: f32) -> f32 {\n\n -(f32::cos(PI * t) - 1.0) / 2.0\n\n}\n\n\n\n// Bounce\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":86,"score":121799.90763898703},{"content":"pub fn cubic_inout(t: f32) -> f32 {\n\n if t < 0.5 {\n\n 4.0 * t * t * t\n\n } else {\n\n let f = 2.0 * t - 2.0;\n\n 0.5 * f * f * f + 1.0\n\n }\n\n}\n\n\n\n// Quartic\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":87,"score":121799.90763898703},{"content":"pub fn quart_inout(t: f32) -> f32 {\n\n if t < 0.5 {\n\n 8.0 * t * t * t * t\n\n } else {\n\n let f = t - 1.0;\n\n -8.0 * f * f * f * f + 1.0\n\n }\n\n}\n\n\n\n// Quintic\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":88,"score":121799.90763898703},{"content":"pub fn expo_inout(t: f32) -> f32 {\n\n if t.abs() <= f32::EPSILON {\n\n 0.0\n\n } else if (t - 1.0) <= f32::EPSILON {\n\n 1.0\n\n } else if t <= 0.5 {\n\n f32::powf(EXP_BASE, 20.0 * t - 10.0) / 2.0\n\n } else {\n\n 1.0 + f32::powf(EXP_BASE, -20.0 * t + 10.0) / -2.0\n\n }\n\n}\n\n\n\n// Sine\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":89,"score":121799.90763898703},{"content":"pub fn bounce_inout(t: f32) -> f32 {\n\n if t < 0.5 {\n\n (1.0 - bounce_out(1.0 - 2.0 * t)) / 2.0\n\n } else {\n\n (1.0 + bounce_out(-1.0 + 2.0 * t)) / 2.0\n\n }\n\n}\n\n\n\n// TODO: add more easing functions\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n macro_rules! test_start_at_0 {\n\n ($($ease_fn:ident),*) => {\n\n paste::paste! {\n\n $(\n\n #[test]\n\n fn [<test_ease_ $ease_fn _starts_at_0>]() {\n","file_path":"packages/sycamore/src/easing.rs","rank":90,"score":121799.90763898703},{"content":"pub fn quint_inout(t: f32) -> f32 {\n\n if t < 0.5 {\n\n 16.0 * t * t * t * t * t\n\n } else {\n\n let f = (2.0 * t) - 2.0;\n\n 0.5 * f * f * f * f * f + 1.0\n\n }\n\n}\n\n\n\n// Circular\n\n\n","file_path":"packages/sycamore/src/easing.rs","rank":91,"score":121799.90763898703},{"content":"/// Cleans the children specified by `current` from `parent`.\n\n///\n\n/// # Params\n\n/// * `parent` - The parent node from which to clean the children.\n\n/// * `current` - A [`Vec`] of [`GenericNode`]s that are to be removed.\n\n/// * `marker` - If `marker` is `None`, all the nodes from `parent` are removed regardless of\n\n/// `current`. This behavior will likely change in the future.\n\n/// * `replacement` - An optional replacement node for the removed nodes.\n\npub fn clean_children<G: GenericNode>(\n\n parent: &G,\n\n current: Vec<G>,\n\n _marker: Option<&G>,\n\n replacement: Option<&G>,\n\n multi: bool,\n\n) {\n\n if !multi {\n\n parent.update_inner_text(\"\");\n\n if let Some(replacement) = replacement {\n\n parent.append_child(replacement);\n\n }\n\n return;\n\n }\n\n\n\n for node in current {\n\n if node.parent_node().as_ref() == Some(parent) {\n\n if let Some(replacement) = replacement {\n\n parent.replace_child(&node, replacement);\n\n } else {\n\n parent.remove_child(&node);\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"packages/sycamore/src/utils/render.rs","rank":92,"score":121257.35230081374},{"content":"/// Normalizes a `Vec<Template<G>>` into a `Vec<G>`.\n\n///\n\n/// Returns whether the normalized `Vec<G>` is dynamic (and should be rendered in an effect).\n\n///\n\n/// # Params\n\n/// * `v` - The [`Vec`] to write the output to.\n\n/// * `fragment` - The `Vec<Template<G>>` to normalize.\n\n/// * `unwrap` - If `true`, unwraps the `fragment` without setting `dynamic` to true. In most cases,\n\n/// this should be `false`.\n\npub fn normalize_incoming_fragment<G: GenericNode>(\n\n v: &mut Vec<View<G>>,\n\n fragment: &[View<G>],\n\n unwrap: bool,\n\n) -> bool {\n\n let mut dynamic = false;\n\n\n\n for template in fragment {\n\n match &template.inner {\n\n ViewType::Node(_) => v.push(template.clone()),\n\n ViewType::Dyn(f) if unwrap => {\n\n let mut value = f.get().as_ref().clone();\n\n while let ViewType::Dyn(f) = &value.inner {\n\n value = f.get().as_ref().clone();\n\n }\n\n let fragment: Rc<Box<[View<G>]>> = match &value.inner {\n\n ViewType::Node(_) => Rc::new(Box::new([value])),\n\n ViewType::Fragment(fragment) => Rc::clone(fragment),\n\n _ => unreachable!(),\n\n };\n","file_path":"packages/sycamore/src/utils/render.rs","rank":93,"score":119755.57024454788},{"content":"/// Returns a [`ReactiveScopeWeak`] handle to the current reactive scope or `None` if outside of a\n\n/// reactive scope.\n\npub fn current_scope() -> Option<ReactiveScopeWeak> {\n\n SCOPES.with(|scope| {\n\n scope\n\n .borrow()\n\n .last()\n\n .map(|last_context| last_context.downgrade())\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::cloned;\n\n\n\n #[test]\n\n fn effects() {\n\n let state = Signal::new(0);\n\n\n\n let double = Signal::new(-1);\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":94,"score":119748.76599907178},{"content":"/// Function that maps a `Vec` to another `Vec` via a map function. The mapped `Vec` is lazy\n\n/// computed, meaning that it's value will only be updated when requested. Modifications to the\n\n/// input `Vec` are diffed using keys to prevent recomputing values that have not changed.\n\n///\n\n/// This function is the underlying utility behind `Keyed`.\n\n///\n\n/// # Params\n\n/// * `list` - The list to be mapped. The list must be a [`ReadSignal`] (obtained from a [`Signal`])\n\n/// and therefore reactive.\n\n/// * `map_fn` - A closure that maps from the input type to the output type.\n\n/// * `key_fn` - A closure that returns an _unique_ key to each entry.\n\n///\n\n/// _Credits: Based on TypeScript implementation in <https://github.com/solidjs/solid>_\n\npub fn map_keyed<T, K, U>(\n\n list: ReadSignal<Vec<T>>,\n\n map_fn: impl Fn(&T) -> U + 'static,\n\n key_fn: impl Fn(&T) -> K + 'static,\n\n) -> impl FnMut() -> Vec<U>\n\nwhere\n\n T: Eq + Clone,\n\n K: Eq + Hash,\n\n U: Clone + 'static,\n\n{\n\n let parent_scope = current_scope();\n\n\n\n // Previous state used for diffing.\n\n let mut items = Rc::new(Vec::new());\n\n let mapped = Rc::new(RefCell::new(Vec::new()));\n\n let mut scopes: Vec<Option<Rc<ReactiveScope>>> = Vec::new();\n\n\n\n move || {\n\n let new_items = list.get(); // Subscribe to list.\n\n untrack(|| {\n","file_path":"packages/sycamore-reactive/src/iter.rs","rank":95,"score":118603.19592601797},{"content":"/// A wrapper around [`wasm_bindgen_futures::spawn_local`] that extends the current reactive scope\n\n/// that it is called in.\n\n///\n\n/// If the scope is dropped by the time the future is spawned, the callback will not be called.\n\n///\n\n/// If not on `wasm32` target arch, this function is a no-op.\n\n///\n\n/// # Panics\n\n/// This function panics if called outside of a reactive scope.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use sycamore::futures::spawn_local_in_scope;\n\n/// use sycamore::prelude::*;\n\n///\n\n/// create_root(|| {\n\n/// // Inside reactive scope.\n\n/// spawn_local_in_scope(async {\n\n/// // Still inside reactive scope.\n\n/// });\n\n/// });\n\n/// ```\n\npub fn spawn_local_in_scope<F>(future: F)\n\nwhere\n\n F: Future<Output = ()> + 'static,\n\n{\n\n if cfg!(target_arch = \"wasm32\") {\n\n if let Some(scope) = current_scope() {\n\n spawn_local(async move {\n\n scope.extend_future(future).await;\n\n });\n\n } else {\n\n panic!(\"spawn_local_in_scope called outside of reactive scope\");\n\n }\n\n }\n\n}\n","file_path":"packages/sycamore/src/futures.rs","rank":96,"score":118588.34519771469},{"content":"#[inline]\n\npub fn create_effect<F>(effect: F)\n\nwhere\n\n F: FnMut() + 'static,\n\n{\n\n _create_effect(Box::new(effect));\n\n}\n\n\n","file_path":"packages/sycamore-reactive/src/effect.rs","rank":97,"score":118578.10882450888},{"content":"#[component(TodoFilter<G>)]\n\npub fn todo_filter(filter: Filter) -> View<G> {\n\n let app_state = use_context::<AppState>();\n\n let selected = cloned!((app_state) => move || filter == *app_state.filter.get());\n\n let set_filter = cloned!((app_state) => move |filter| {\n\n app_state.filter.set(filter)\n\n });\n\n\n\n view! {\n\n li {\n\n a(\n\n class=if selected() { \"selected\" } else { \"\" },\n\n href=filter.url(),\n\n on:click=move |_| set_filter(filter),\n\n ) {\n\n (format!(\"{:?}\", filter))\n\n }\n\n }\n\n }\n\n}\n","file_path":"examples/todomvc/src/filter.rs","rank":98,"score":116182.60948432265},{"content":"/// Trait that is implemented by components. Should not be implemented manually. Use the\n\n/// [`component`](sycamore_macro::component) macro instead.\n\npub trait Component<G: GenericNode> {\n\n /// The name of the component (for use in debug mode). In release mode, this will default to\n\n /// `\"UnnamedComponent\"`\n\n const NAME: &'static str = \"UnnamedComponent\";\n\n /// The type of the properties passed to the component.\n\n type Props;\n\n\n\n /// Create a new component with an instance of the properties.\n\n ///\n\n /// The double underscores (`__`) are to prevent conflicts with other trait methods. This is\n\n /// because we cannot use fully qualified syntax here because it prevents type inference.\n\n fn __create_component(props: Self::Props) -> View<G>;\n\n}\n","file_path":"packages/sycamore/src/component.rs","rank":99,"score":115554.54286773891}],"string":"[\n {\n \"content\": \"pub fn route_impl(input: DeriveInput) -> syn::Result<TokenStream> {\\n\\n let mut quoted = TokenStream::new();\\n\\n let mut err_quoted = TokenStream::new();\\n\\n let mut has_error_handler = false;\\n\\n\\n\\n match &input.data {\\n\\n syn::Data::Enum(de) => {\\n\\n let ty_name = &input.ident;\\n\\n\\n\\n for variant in &de.variants {\\n\\n let variant_id = &variant.ident;\\n\\n\\n\\n let mut quote_capture_vars = TokenStream::new();\\n\\n let mut route_path_ast = None;\\n\\n\\n\\n let mut is_to_route = false;\\n\\n\\n\\n for attr in &variant.attrs {\\n\\n let attr_name = match attr.path.get_ident() {\\n\\n Some(ident) => ident.to_string(),\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/route.rs\",\n \"rank\": 0,\n \"score\": 358273.39184251614\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn component(attr: TokenStream, component: TokenStream) -> TokenStream {\\n\\n let attr = parse_macro_input!(attr as component::ComponentFunctionName);\\n\\n let component = parse_macro_input!(component as component::ComponentFunction);\\n\\n\\n\\n component::component_impl(attr, component)\\n\\n .unwrap_or_else(|err| err.to_compile_error())\\n\\n .into()\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore-macro/src/lib.rs\",\n \"rank\": 1,\n \"score\": 254879.1784545763\n },\n {\n \"content\": \"#[proc_macro]\\n\\npub fn node(input: TokenStream) -> TokenStream {\\n\\n let node = parse_macro_input!(input as view::Element);\\n\\n\\n\\n view::node_impl(node).into()\\n\\n}\\n\\n\\n\\n/// A macro for creating components from functions.\\n\\n///\\n\\n/// Add this attribute to a `fn` to create a component from that function.\\n\\n///\\n\\n/// To learn more about components, see the chapter on\\n\\n/// [components](https://sycamore-rs.netlify.app/docs/basics/components) in the Sycamore Book.\\n\",\n \"file_path\": \"packages/sycamore-macro/src/lib.rs\",\n \"rank\": 2,\n \"score\": 221224.05428181565\n },\n {\n \"content\": \"#[proc_macro_derive(Route, attributes(to, not_found))]\\n\\npub fn route(input: TokenStream) -> TokenStream {\\n\\n let input = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n route::route_impl(input)\\n\\n .unwrap_or_else(|err| err.to_compile_error())\\n\\n .into()\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/lib.rs\",\n \"rank\": 3,\n \"score\": 219031.2446051857\n },\n {\n \"content\": \"pub fn view_impl(component: HtmlRoot) -> TokenStream {\\n\\n component.to_token_stream()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-macro/src/view/mod.rs\",\n \"rank\": 5,\n \"score\": 213034.47560696246\n },\n {\n \"content\": \"/// Adds a callback function to the current reactive scope's cleanup.\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use sycamore_reactive::*;\\n\\n///\\n\\n/// let cleanup_called = Signal::new(false);\\n\\n///\\n\\n/// let scope = create_root(cloned!((cleanup_called) => move || {\\n\\n/// on_cleanup(move || {\\n\\n/// cleanup_called.set(true);\\n\\n/// })\\n\\n/// }));\\n\\n///\\n\\n/// assert_eq!(*cleanup_called.get(), false);\\n\\n///\\n\\n/// drop(scope);\\n\\n/// assert_eq!(*cleanup_called.get(), true);\\n\\n/// ```\\n\\npub fn on_cleanup(f: impl FnOnce() + 'static) {\\n\\n SCOPES.with(|scope| {\\n\\n if scope.borrow().last().is_some() {\\n\\n scope\\n\\n .borrow_mut()\\n\\n .last_mut()\\n\\n .unwrap_throw()\\n\\n .add_cleanup(Box::new(f));\\n\\n } else {\\n\\n #[cfg(all(target_arch = \\\"wasm32\\\", debug_assertions))]\\n\\n web_sys::console::warn_1(\\n\\n &\\\"Cleanup callbacks created outside of a reactive root will never run.\\\".into(),\\n\\n );\\n\\n #[cfg(all(not(target_arch = \\\"wasm32\\\"), debug_assertions))]\\n\\n eprintln!(\\n\\n \\\"WARNING: Cleanup callbacks created outside of a reactive root will never run.\\\"\\n\\n );\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 6,\n \"score\": 193341.4777691328\n },\n {\n \"content\": \"pub fn bench(c: &mut Criterion) {\\n\\n c.bench_function(\\\"reactivity_signals\\\", |b| {\\n\\n b.iter(|| {\\n\\n let state = Signal::new(black_box(0));\\n\\n\\n\\n for _i in 0..1000 {\\n\\n state.set(*state.get() + 1);\\n\\n }\\n\\n });\\n\\n });\\n\\n\\n\\n c.bench_function(\\\"reactivity_effects\\\", |b| {\\n\\n b.iter(|| {\\n\\n let state = Signal::new(black_box(0));\\n\\n create_effect(cloned!((state) => move || {\\n\\n let double = *state.get() * 2;\\n\\n black_box(double);\\n\\n }));\\n\\n\\n\\n for _i in 0..1000 {\\n\",\n \"file_path\": \"packages/sycamore/benches/reactivity.rs\",\n \"rank\": 7,\n \"score\": 192561.2268448305\n },\n {\n \"content\": \"pub fn bench(c: &mut Criterion) {\\n\\n c.bench_function(\\\"ssr_small\\\", |b| {\\n\\n b.iter(|| {\\n\\n #[component(App<G>)]\\n\\n fn app() -> View<G> {\\n\\n view! {\\n\\n div(class=\\\"my-container\\\") {\\n\\n p { \\\"Hello World!\\\" }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n let _ssr = sycamore::render_to_string(|| view! { App() });\\n\\n })\\n\\n });\\n\\n\\n\\n c.bench_function(\\\"ssr_medium\\\", |b| {\\n\\n b.iter(|| {\\n\\n #[component(ListItem<G>)]\\n\\n fn list_item(value: i32) -> View<G> {\\n\",\n \"file_path\": \"packages/sycamore/benches/ssr.rs\",\n \"rank\": 8,\n \"score\": 192561.2268448305\n },\n {\n \"content\": \"#[proc_macro]\\n\\npub fn view(component: TokenStream) -> TokenStream {\\n\\n let component = parse_macro_input!(component as view::HtmlRoot);\\n\\n\\n\\n view::view_impl(component).into()\\n\\n}\\n\\n\\n\\n/// ```\\n\\n/// use sycamore::prelude::*;\\n\\n///\\n\\n/// #[component(MyComponent<G>)]\\n\\n/// pub fn my_component() -> View<G> {\\n\\n/// let cool_button: G = node! { button { \\\"The coolest 😎\\\" } };\\n\\n///\\n\\n/// cool_button.set_property(\\\"myProperty\\\", &\\\"Epic!\\\".into());\\n\\n///\\n\\n/// View::new_node(cool_button)\\n\\n/// }\\n\\n/// ```\\n\",\n \"file_path\": \"packages/sycamore-macro/src/lib.rs\",\n \"rank\": 9,\n \"score\": 191615.89493000088\n },\n {\n \"content\": \"#[component(Item<G>)]\\n\\npub fn item(todo: Signal<Todo>) -> View<G> {\\n\\n let app_state = use_context::<AppState>();\\n\\n\\n\\n let title = cloned!((todo) => move || todo.get().title.clone());\\n\\n let completed = create_selector(cloned!((todo) => move || todo.get().completed));\\n\\n let id = todo.get().id;\\n\\n\\n\\n let editing = Signal::new(false);\\n\\n let input_ref = NodeRef::<G>::new();\\n\\n let value = Signal::new(\\\"\\\".to_string());\\n\\n\\n\\n let handle_input = cloned!((value) => move |event: Event| {\\n\\n let target: HtmlInputElement = event.target().unwrap().unchecked_into();\\n\\n value.set(target.value());\\n\\n });\\n\\n\\n\\n let toggle_completed = cloned!((todo) => move |_| {\\n\\n todo.set(Todo {\\n\\n completed: !todo.get().completed,\\n\\n ..todo.get().as_ref().clone()\\n\",\n \"file_path\": \"examples/todomvc/src/item.rs\",\n \"rank\": 10,\n \"score\": 188369.50468892604\n },\n {\n \"content\": \"/// Instantiate a component as a [`View`].\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use sycamore::prelude::*;\\n\\n/// # use sycamore::builder::html::*;\\n\\n/// #[component(MyComponent<G>)]\\n\\n/// fn my_component() -> View<G> {\\n\\n/// h1().text(\\\"I am a component\\\").build()\\n\\n/// }\\n\\n///\\n\\n/// // Elsewhere in another component.\\n\\n/// # fn view<G: Html>() -> View<G> {\\n\\n/// component::<_, MyComponent<_>>(())\\n\\n/// # }\\n\\n/// ```\\n\\npub fn component<G, C>(props: C::Props) -> View<G>\\n\\nwhere\\n\\n G: GenericNode + Html,\\n\\n C: Component<G>,\\n\\n{\\n\\n C::__create_component(props)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/builder/agnostic/mod.rs\",\n \"rank\": 11,\n \"score\": 184006.48694134058\n },\n {\n \"content\": \"pub fn ident_start(s: &str) -> IResult<&str, &str> {\\n\\n verify(take(1usize), |c: &str| {\\n\\n let c = c.chars().next().unwrap();\\n\\n c == '_' || unicode_xid::UnicodeXID::is_xid_start(c)\\n\\n })(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/parser.rs\",\n \"rank\": 12,\n \"score\": 182523.717879967\n },\n {\n \"content\": \"pub fn ident_continue(s: &str) -> IResult<&str, &str> {\\n\\n verify(take(1usize), |c: &str| {\\n\\n unicode_xid::UnicodeXID::is_xid_continue(c.chars().next().unwrap())\\n\\n })(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/parser.rs\",\n \"rank\": 13,\n \"score\": 182523.717879967\n },\n {\n \"content\": \"/// Run the passed closure inside an untracked dependency scope.\\n\\n///\\n\\n/// This does **NOT** create a new [`ReactiveScope`].\\n\\n///\\n\\n/// See also [`StateHandle::get_untracked()`].\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// use sycamore_reactive::*;\\n\\n///\\n\\n/// let state = Signal::new(1);\\n\\n///\\n\\n/// let double = create_memo({\\n\\n/// let state = state.clone();\\n\\n/// move || untrack(|| *state.get() * 2)\\n\\n/// });\\n\\n///\\n\\n/// assert_eq!(*double.get(), 2);\\n\\n///\\n\\n/// state.set(2);\\n\\n/// // double value should still be old value because state was untracked\\n\\n/// assert_eq!(*double.get(), 2);\\n\\n/// ```\\n\\npub fn untrack<T>(f: impl FnOnce() -> T) -> T {\\n\\n let f = Rc::new(RefCell::new(Some(f)));\\n\\n let g = Rc::clone(&f);\\n\\n\\n\\n // Do not panic if running inside destructor.\\n\\n if let Ok(ret) = LISTENERS.try_with(|listeners| {\\n\\n let tmp = listeners.take();\\n\\n\\n\\n let ret = f.take().unwrap_throw()();\\n\\n\\n\\n *listeners.borrow_mut() = tmp;\\n\\n\\n\\n ret\\n\\n }) {\\n\\n ret\\n\\n } else {\\n\\n g.take().unwrap_throw()()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 14,\n \"score\": 182219.08184624556\n },\n {\n \"content\": \"pub fn node_impl(html: Element) -> TokenStream {\\n\\n html.to_token_stream()\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore-macro/src/view/mod.rs\",\n \"rank\": 15,\n \"score\": 180454.02599676646\n },\n {\n \"content\": \"#[must_use = \\\"create_scope returns the reactive scope of the effects created inside this scope\\\"]\\n\\npub fn create_scope<'a>(callback: impl FnOnce() + 'a) -> ReactiveScope {\\n\\n _create_child_scope_in(None, Box::new(callback))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/lib.rs\",\n \"rank\": 16,\n \"score\": 180139.17574078968\n },\n {\n \"content\": \"#[must_use = \\\"create_root returns the reactive scope of the effects created inside this scope\\\"]\\n\\npub fn create_root<'a>(callback: impl FnOnce() + 'a) -> ReactiveScope {\\n\\n _create_child_scope_in(None, Box::new(callback))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/lib.rs\",\n \"rank\": 17,\n \"score\": 180139.17574078968\n },\n {\n \"content\": \"/// Render a [`View`] under a `parent` node by reusing existing nodes (client side\\n\\n/// hydration). Alias for [`hydrate_to`] with `parent` being the `<body>` tag.\\n\\n///\\n\\n/// For rendering without hydration, use [`render`] instead.\\n\\n///\\n\\n/// **TODO**: This method currently deletes existing nodes from DOM and reinserts new\\n\\n/// created nodes. This will be fixed in a later release.\\n\\n///\\n\\n/// _This API requires the following crate features to be activated: `dom`_\\n\\npub fn hydrate(template: impl FnOnce() -> View<DomNode>) {\\n\\n let window = web_sys::window().unwrap_throw();\\n\\n let document = window.document().unwrap_throw();\\n\\n\\n\\n hydrate_to(template, &document.body().unwrap_throw());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/generic_node/dom_node.rs\",\n \"rank\": 18,\n \"score\": 179371.29120331112\n },\n {\n \"content\": \"/// Render a [`View`] into the DOM.\\n\\n/// Alias for [`render_to`] with `parent` being the `<body>` tag.\\n\\n///\\n\\n/// _This API requires the following crate features to be activated: `dom`_\\n\\npub fn render(template: impl FnOnce() -> View<DomNode>) {\\n\\n let window = web_sys::window().unwrap_throw();\\n\\n let document = window.document().unwrap_throw();\\n\\n\\n\\n render_to(template, &document.body().unwrap_throw());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/generic_node/dom_node.rs\",\n \"rank\": 19,\n \"score\": 179365.3953899047\n },\n {\n \"content\": \"/// Render a [`View`] into a static [`String`]. Useful\\n\\n/// for rendering to a string on the server side.\\n\\n///\\n\\n/// _This API requires the following crate features to be activated: `ssr`_\\n\\npub fn render_to_string(template: impl FnOnce() -> View<SsrNode>) -> String {\\n\\n let mut ret = String::new();\\n\\n let _scope = create_root(|| {\\n\\n for node in template().flatten() {\\n\\n node.write_to_string(&mut ret);\\n\\n }\\n\\n });\\n\\n\\n\\n ret\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::prelude::*;\\n\\n\\n\\n #[test]\\n\\n fn render_hello_world() {\\n\\n assert_eq!(\\n\\n render_to_string(|| view! {\\n\",\n \"file_path\": \"packages/sycamore/src/generic_node/ssr_node.rs\",\n \"rank\": 20,\n \"score\": 172504.1483008088\n },\n {\n \"content\": \"/// Render a [`View`] under a `parent` node by reusing existing nodes (client side\\n\\n/// hydration). For rendering under the `<body>` tag, use [`hydrate_to`] instead.\\n\\n///\\n\\n/// For rendering without hydration, use [`render`] instead.\\n\\n///\\n\\n/// **TODO**: This method currently deletes existing nodes from DOM and reinserts new\\n\\n/// created nodes. This will be fixed in a later release.\\n\\n///\\n\\n/// _This API requires the following crate features to be activated: `dom`_\\n\\npub fn hydrate_to(template: impl FnOnce() -> View<DomNode>, parent: &Node) {\\n\\n for child in get_children(parent.unchecked_ref()) {\\n\\n child.remove();\\n\\n }\\n\\n\\n\\n let scope = create_root(|| {\\n\\n insert(\\n\\n &DomNode {\\n\\n id: Default::default(),\\n\\n node: parent.clone(),\\n\\n },\\n\\n template(),\\n\\n None,\\n\\n None, // TODO\\n\\n false,\\n\\n );\\n\\n });\\n\\n\\n\\n thread_local! {\\n\\n static GLOBAL_SCOPES: std::cell::RefCell<Vec<ReactiveScope>> = std::cell::RefCell::new(Vec::new());\\n\\n }\\n\\n\\n\\n GLOBAL_SCOPES.with(|global_scopes| global_scopes.borrow_mut().push(scope));\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore/src/generic_node/dom_node.rs\",\n \"rank\": 21,\n \"score\": 169605.51743827903\n },\n {\n \"content\": \"/// Render a [`View`] under a `parent` node.\\n\\n/// For rendering under the `<body>` tag, use [`render`] instead.\\n\\n///\\n\\n/// _This API requires the following crate features to be activated: `dom`_\\n\\npub fn render_to(template: impl FnOnce() -> View<DomNode>, parent: &Node) {\\n\\n let scope = create_root(|| {\\n\\n insert(\\n\\n &DomNode {\\n\\n id: Default::default(),\\n\\n node: parent.clone(),\\n\\n },\\n\\n template(),\\n\\n None,\\n\\n None,\\n\\n false,\\n\\n );\\n\\n });\\n\\n\\n\\n thread_local! {\\n\\n static GLOBAL_SCOPES: std::cell::RefCell<Vec<ReactiveScope>> = std::cell::RefCell::new(Vec::new());\\n\\n }\\n\\n\\n\\n GLOBAL_SCOPES.with(|global_scopes| global_scopes.borrow_mut().push(scope));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/generic_node/dom_node.rs\",\n \"rank\": 22,\n \"score\": 169605.2752897476\n },\n {\n \"content\": \"#[component(Component<G>)]\\n\\npub fn component() -> View<G> {\\n\\n view! {\\n\\n div\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-macro/tests/view/component-pass.rs\",\n \"rank\": 23,\n \"score\": 168736.64051895888\n },\n {\n \"content\": \"#[component(Comp8<G>)]\\n\\nfn comp8(one: (), two: ()) -> View<G> {\\n\\n todo!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-macro/tests/component/component-fail.rs\",\n \"rank\": 24,\n \"score\": 166943.36251542915\n },\n {\n \"content\": \"/// Creates a new [`ReactiveScope`] with a context and runs the supplied callback function.\\n\\npub fn create_context_scope<T: 'static, Out>(value: T, f: impl FnOnce() -> Out) -> Out {\\n\\n SCOPES.with(|scopes| {\\n\\n // Create a new ReactiveScope with a context.\\n\\n let scope = ReactiveScope::new();\\n\\n scope.0.borrow_mut().context = Some(Box::new(Context { value }));\\n\\n scopes.borrow_mut().push(scope);\\n\\n let out = f();\\n\\n let scope = scopes.borrow_mut().pop().unwrap_throw();\\n\\n on_cleanup(move || drop(scope));\\n\\n out\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/context.rs\",\n \"rank\": 25,\n \"score\": 165942.42379478965\n },\n {\n \"content\": \"#[component(Portal<G>)]\\n\\npub fn portal(props: PortalProps<G>) -> View<G> {\\n\\n let PortalProps { children, selector } = props;\\n\\n\\n\\n if G::IS_BROWSER {\\n\\n let window = web_sys::window().unwrap_throw();\\n\\n let document = window.document().unwrap_throw();\\n\\n let container = document\\n\\n .query_selector(selector)\\n\\n .unwrap_throw()\\n\\n .expect_throw(\\\"could not find element matching selector\\\");\\n\\n\\n\\n let children = children.flatten();\\n\\n\\n\\n for child in &children {\\n\\n container\\n\\n .append_child(\\n\\n &<dyn Any>::downcast_ref::<DomNode>(child)\\n\\n .unwrap_throw()\\n\\n .inner_element(),\\n\\n )\\n\",\n \"file_path\": \"packages/sycamore/src/portal.rs\",\n \"rank\": 26,\n \"score\": 159765.0615925096\n },\n {\n \"content\": \"/// An alternative to [`Signal::new`] that uses a reducer to get the next value.\\n\\n///\\n\\n/// It uses a reducer function that takes the previous value and a message and returns the next\\n\\n/// value.\\n\\n///\\n\\n/// Returns a [`ReadSignal`] and a dispatch function to send messages to the reducer.\\n\\n///\\n\\n/// # Params\\n\\n/// * `initial` - The initial value of the state.\\n\\n/// * `reducer` - A function that takes the previous value and a message and returns the next value.\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use sycamore_reactive::*;\\n\\n///\\n\\n/// enum Msg {\\n\\n/// Increment,\\n\\n/// Decrement,\\n\\n/// }\\n\\n///\\n\\n/// let (state, dispatch) = create_reducer(0, |state, msg: Msg| match msg {\\n\\n/// Msg::Increment => *state + 1,\\n\\n/// Msg::Decrement => *state - 1,\\n\\n/// });\\n\\n///\\n\\n/// assert_eq!(*state.get(), 0);\\n\\n/// dispatch(Msg::Increment);\\n\\n/// assert_eq!(*state.get(), 1);\\n\\n/// dispatch(Msg::Decrement);\\n\\n/// assert_eq!(*state.get(), 0);\\n\\n/// ```\\n\\npub fn create_reducer<F, Out, Msg>(initial: Out, reduce: F) -> (ReadSignal<Out>, Rc<impl Fn(Msg)>)\\n\\nwhere\\n\\n F: Fn(&Out, Msg) -> Out,\\n\\n{\\n\\n let memo = Signal::new(initial);\\n\\n\\n\\n let dispatcher = {\\n\\n let memo = memo.clone();\\n\\n move |msg| {\\n\\n memo.set(reduce(&memo.get_untracked(), msg));\\n\\n }\\n\\n };\\n\\n\\n\\n (memo.into_handle(), Rc::new(dispatcher))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 27,\n \"score\": 159379.82421845023\n },\n {\n \"content\": \"/// Parse a Rust identifier. Reference: https://doc.rust-lang.org/reference/identifiers.html\\n\\nfn ident(i: &str) -> IResult<&str, &str> {\\n\\n recognize(pair(ident_start, many0(ident_continue)))(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/parser.rs\",\n \"rank\": 28,\n \"score\": 156332.0965930366\n },\n {\n \"content\": \"fn param(i: &str) -> IResult<&str, &str> {\\n\\n take_till(|c| c == '/')(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/parser.rs\",\n \"rank\": 29,\n \"score\": 156326.89533079637\n },\n {\n \"content\": \"#[component(NumberDisplayer<G>)]\\n\\nfn number_displayer(prop: i32) -> View<G> {\\n\\n view! {\\n\\n p { \\\"My number is: \\\" (prop) }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/higher-order-components/src/main.rs\",\n \"rank\": 30,\n \"score\": 156191.88086322855\n },\n {\n \"content\": \"/// Reconciles an array of nodes.\\n\\n///\\n\\n/// # Params\\n\\n/// * `parent` - The parent node under which all other nodes are (direct) children.\\n\\n/// * `a` - The current/existing nodes that are to be diffed.\\n\\n/// * `b` - The new nodes that are to be inserted. After the reconciliation, all the nodes in `b`\\n\\n/// should be inserted under `parent`.\\n\\n///\\n\\n/// # Panics\\n\\n/// Panics if `a.is_empty()`. Append nodes instead.\\n\\npub fn reconcile_fragments<G: GenericNode>(parent: &G, a: &mut [G], b: &[G]) {\\n\\n debug_assert!(!a.is_empty(), \\\"a cannot be empty\\\");\\n\\n\\n\\n // Sanity check: make sure all nodes in a are children of parent.\\n\\n #[cfg(debug_assertions)]\\n\\n {\\n\\n for (i, node) in a.iter().enumerate() {\\n\\n if node.parent_node().as_ref() != Some(parent) {\\n\\n panic!(\\n\\n \\\"node {} in existing nodes Vec is not a child of parent. node = {:#?}\\\",\\n\\n i, node\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n let b_len = b.len();\\n\\n let mut a_end = a.len();\\n\\n let mut b_end = b_len;\\n\\n let mut a_start = 0;\\n\",\n \"file_path\": \"packages/sycamore/src/utils/render.rs\",\n \"rank\": 31,\n \"score\": 155867.08489982173\n },\n {\n \"content\": \"/// Creates a memoized value from some signals. Also know as \\\"derived stores\\\".\\n\\n/// Unlike [`create_memo`], this function will not notify dependents of a change if the output is\\n\\n/// the same.\\n\\n///\\n\\n/// It takes a comparison function to compare the old and new value, which returns `true` if they\\n\\n/// are the same and `false` otherwise.\\n\\n///\\n\\n/// To use the type's [`PartialEq`] implementation instead of a custom function, use\\n\\n/// [`create_selector`].\\n\\npub fn create_selector_with<F, Out, C>(mut derived: F, comparator: C) -> ReadSignal<Out>\\n\\nwhere\\n\\n F: FnMut() -> Out + 'static,\\n\\n Out: 'static,\\n\\n C: Fn(&Out, &Out) -> bool + 'static,\\n\\n{\\n\\n let memo = Rc::new(RefCell::new(None::<Signal<Out>>));\\n\\n\\n\\n create_effect({\\n\\n let memo = Rc::clone(&memo);\\n\\n move || {\\n\\n if memo.borrow().as_ref().is_some() {\\n\\n let memo = memo.borrow();\\n\\n let memo = memo.as_ref().unwrap_throw();\\n\\n let new_value = derived();\\n\\n if !comparator(&memo.get_untracked(), &new_value) {\\n\\n memo.set(new_value);\\n\\n }\\n\\n } else {\\n\\n *memo.borrow_mut() = Some(Signal::new(derived()));\\n\\n }\\n\\n }\\n\\n });\\n\\n\\n\\n let memo = memo.borrow();\\n\\n memo.as_ref().unwrap_throw().handle()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 32,\n \"score\": 151755.72724529565\n },\n {\n \"content\": \"/// Get the value of a context in the current [`ReactiveScope`].\\n\\n///\\n\\n/// # Panics\\n\\n/// This function will `panic!` if the context is not found in the current scope or a parent scope.\\n\\npub fn use_context<T: Clone + 'static>() -> T {\\n\\n SCOPES.with(|scopes| {\\n\\n let scopes = scopes.borrow();\\n\\n let mut current = scopes.last().map(|s| Rc::clone(&s.0));\\n\\n match current {\\n\\n Some(_) => {\\n\\n while let Some(scope) = ¤t {\\n\\n if let Some(context) = &scope.borrow().context {\\n\\n if let Some(value) = context.get_value().downcast_ref::<T>() {\\n\\n return value.clone();\\n\\n }\\n\\n }\\n\\n current = current.unwrap_throw().borrow().parent.0.upgrade();\\n\\n }\\n\\n panic!(\\\"context not found for type\\\")\\n\\n }\\n\\n None => panic!(\\\"context not found for type\\\"),\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/context.rs\",\n \"rank\": 33,\n \"score\": 151203.16500699363\n },\n {\n \"content\": \"/// Create a [`View`] from an array of [`View`].\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// # use sycamore::prelude::*;\\n\\n/// # use sycamore::builder::html::*;\\n\\n/// # fn _test<G: GenericNode>() -> View<G> {\\n\\n/// fragment([\\n\\n/// div().build(),\\n\\n/// div().build()\\n\\n/// ])\\n\\n/// # }\\n\\n/// ```\\n\\npub fn fragment<G, const N: usize>(parts: [View<G>; N]) -> View<G>\\n\\nwhere\\n\\n G: GenericNode,\\n\\n{\\n\\n View::new_fragment(Vec::from_iter(parts.to_vec()))\\n\\n}\\n\\n\\n\\n/// The main type powering the builder API.\\n\\n#[derive(Debug)]\\n\\npub struct NodeBuilder<G>\\n\\nwhere\\n\\n G: GenericNode,\\n\\n{\\n\\n element: G,\\n\\n}\\n\\n\\n\\nimpl<G> NodeBuilder<G>\\n\\nwhere\\n\\n G: GenericNode,\\n\\n{\\n\",\n \"file_path\": \"packages/sycamore/src/builder/agnostic/mod.rs\",\n \"rank\": 34,\n \"score\": 150023.47267937986\n },\n {\n \"content\": \"pub fn route(i: &str) -> IResult<&str, RoutePathAst> {\\n\\n map(separated_list0(tag(\\\"/\\\"), segment), |segments| {\\n\\n let segments = segments\\n\\n .into_iter()\\n\\n .filter(|x| !matches!(x, SegmentAst::Param(param) if param.is_empty()))\\n\\n .collect();\\n\\n RoutePathAst { segments }\\n\\n })(i)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use expect_test::{expect, Expect};\\n\\n\\n\\n use super::*;\\n\\n\\n\\n fn check(input: &str, expect: Expect) {\\n\\n let actual = format!(\\\"{:#?}\\\", route(input).unwrap());\\n\\n expect.assert_eq(&actual);\\n\\n }\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/parser.rs\",\n \"rank\": 35,\n \"score\": 144649.47469487353\n },\n {\n \"content\": \"#[component(Router<G>)]\\n\\npub fn router<R, F>(props: RouterProps<R, F, G>) -> View<G>\\n\\nwhere\\n\\n R: Route + 'static,\\n\\n F: FnOnce(ReadSignal<R>) -> View<G> + 'static,\\n\\n{\\n\\n let RouterProps {\\n\\n render,\\n\\n integration,\\n\\n _phantom,\\n\\n } = props;\\n\\n let render = Rc::new(RefCell::new(Some(render)));\\n\\n let integration = Rc::new(integration);\\n\\n let base_pathname = base_pathname();\\n\\n\\n\\n PATHNAME.with(|pathname| {\\n\\n assert!(pathname.borrow().is_none());\\n\\n // Get initial url from window.location.\\n\\n let path = integration.current_pathname();\\n\\n let path = path.strip_prefix(&base_pathname).unwrap_or(&path);\\n\\n *pathname.borrow_mut() = Some(Signal::new(path.to_string()));\\n\",\n \"file_path\": \"packages/sycamore-router/src/router.rs\",\n \"rank\": 36,\n \"score\": 143186.03705005132\n },\n {\n \"content\": \"#[component(ContextProvider<G>)]\\n\\npub fn context_provider<T, F>(props: ContextProviderProps<T, F, G>) -> View<G>\\n\\nwhere\\n\\n T: 'static,\\n\\n F: FnOnce() -> View<G>,\\n\\n{\\n\\n let ContextProviderProps { value, children } = props;\\n\\n\\n\\n create_context_scope(value, children)\\n\\n}\\n\\n\\n\\n#[cfg(all(test, feature = \\\"ssr\\\"))]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use sycamore_reactive::use_context;\\n\\n\\n\\n #[test]\\n\\n fn basic_context() {\\n\\n sycamore::render_to_string(|| {\\n\\n view! {\\n\\n ContextProvider(ContextProviderProps {\\n\",\n \"file_path\": \"packages/sycamore/src/context.rs\",\n \"rank\": 37,\n \"score\": 141441.95848752774\n },\n {\n \"content\": \"#[component(Comp2<G>)]\\n\\nfn comp2(_props: ()) -> View<G> {\\n\\n todo!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-macro/tests/component/component-pass.rs\",\n \"rank\": 38,\n \"score\": 140904.0397895042\n },\n {\n \"content\": \"#[component(StaticRouter<G>)]\\n\\npub fn static_router<R, F>(props: StaticRouterProps<R, F, G>) -> View<G>\\n\\nwhere\\n\\n R: Route + 'static,\\n\\n F: Fn(R) -> View<G> + 'static,\\n\\n{\\n\\n let StaticRouterProps {\\n\\n render,\\n\\n route,\\n\\n _phantom,\\n\\n } = props;\\n\\n\\n\\n render(route)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router/src/router.rs\",\n \"rank\": 39,\n \"score\": 139755.1803994487\n },\n {\n \"content\": \"#[component(Indexed<G>)]\\n\\npub fn indexed<T: 'static, F: 'static>(props: IndexedProps<T, F, G>) -> View<G>\\n\\nwhere\\n\\n T: Clone + PartialEq,\\n\\n F: Fn(T) -> View<G>,\\n\\n{\\n\\n let IndexedProps { iterable, template } = props;\\n\\n\\n\\n let mut mapped = map_indexed(iterable, move |x| template(x.clone()));\\n\\n View::new_dyn(move || View::new_fragment(mapped()))\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore/src/flow.rs\",\n \"rank\": 40,\n \"score\": 138781.75176836166\n },\n {\n \"content\": \"#[component(Content<G>)]\\n\\npub fn content(\\n\\n ContentProps {\\n\\n data: MarkdownPage { html, outline },\\n\\n sidebar,\\n\\n }: ContentProps,\\n\\n) -> View<G> {\\n\\n let show_sidebar = sidebar.is_some();\\n\\n\\n\\n let sidebar_version = sidebar.as_ref().map(|x| x.0.clone());\\n\\n\\n\\n view! {\\n\\n div(class=\\\"flex w-full\\\") {\\n\\n (if show_sidebar {\\n\\n view! {\\n\\n div(class=\\\"flex-none\\\") {\\n\\n crate::sidebar::Sidebar(sidebar.clone().unwrap())\\n\\n }\\n\\n }\\n\\n } else {\\n\\n view! {}\\n\",\n \"file_path\": \"website/src/content.rs\",\n \"rank\": 41,\n \"score\": 138268.45483989007\n },\n {\n \"content\": \"/// Internal implementation: use dynamic dispatch to reduce code bloat.\\n\\nfn _create_effect(mut effect: Box<dyn FnMut()>) {\\n\\n let listener: Rc<RefCell<Option<Listener>>> = Rc::new(RefCell::new(None));\\n\\n\\n\\n // Callback for when the effect's dependencies are triggered.\\n\\n let callback: Rc<RefCell<dyn FnMut()>> = Rc::new(RefCell::new({\\n\\n let listener = Rc::downgrade(&listener);\\n\\n move || {\\n\\n LISTENERS.with(|listeners| {\\n\\n // Record initial context size to verify that it is the same after.\\n\\n let initial_context_size = listeners.borrow().len();\\n\\n\\n\\n // Upgrade running now to make sure running is valid for the whole duration of\\n\\n // the effect.\\n\\n let listener = listener.upgrade().unwrap_throw();\\n\\n\\n\\n // Push new reactive scope.\\n\\n listeners.borrow_mut().push(Rc::downgrade(&listener));\\n\\n\\n\\n let mut listener_mut = listener.borrow_mut();\\n\\n let listener_ref = listener_mut.as_mut().unwrap_throw();\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 42,\n \"score\": 137308.4407504286\n },\n {\n \"content\": \"#[component(Comp9<G>)]\\n\\nstruct AStruct;\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-macro/tests/component/component-fail.rs\",\n \"rank\": 43,\n \"score\": 136749.29470402503\n },\n {\n \"content\": \"fn assert_cleanup_called(f: impl FnOnce()) {\\n\\n CLEANUP_CALLED.with(|cleanup_called| {\\n\\n assert!(!cleanup_called.get());\\n\\n f();\\n\\n assert!(cleanup_called.get());\\n\\n\\n\\n cleanup_called.set(false); // Reset for next test\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/tests/web/cleanup.rs\",\n \"rank\": 44,\n \"score\": 135692.7154321054\n },\n {\n \"content\": \"#[component(EnhancedComponent<G>)]\\n\\nfn enhanced_component<C: Component<G, Props = i32>>() -> View<G> {\\n\\n view! {\\n\\n div(class=\\\"enhanced-container\\\") {\\n\\n p { \\\"Enhanced container start\\\" }\\n\\n C(42)\\n\\n p { \\\"Enhanced container end\\\" }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/higher-order-components/src/main.rs\",\n \"rank\": 45,\n \"score\": 134251.46157729885\n },\n {\n \"content\": \"#[wasm_bindgen_test]\\n\\npub fn test_cleanup_in_root() {\\n\\n let root = create_root(|| {\\n\\n on_cleanup(on_cleanup_callback);\\n\\n });\\n\\n\\n\\n assert_cleanup_called(|| {\\n\\n drop(root);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/tests/web/cleanup.rs\",\n \"rank\": 46,\n \"score\": 130870.24489535722\n },\n {\n \"content\": \"#[wasm_bindgen_test]\\n\\npub fn test_cleanup_in_effect() {\\n\\n let trigger = Signal::new(());\\n\\n\\n\\n create_effect(cloned!((trigger) => move || {\\n\\n trigger.get();\\n\\n on_cleanup(on_cleanup_callback);\\n\\n }));\\n\\n\\n\\n assert_cleanup_called(|| {\\n\\n trigger.set(());\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/tests/web/cleanup.rs\",\n \"rank\": 47,\n \"score\": 130870.24489535722\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n println!(\\\"cargo:rerun-if-changed=build.rs\\\");\\n\\n println!(\\\"cargo:rerun-if-changed=next\\\");\\n\\n println!(\\\"cargo:rerun-if-changed=versioned_docs\\\");\\n\\n println!(\\\"cargo:rerun-if-changed=posts\\\");\\n\\n\\n\\n // Sitemap.\\n\\n generate_sitemap_xml()?;\\n\\n\\n\\n // Markdown files.\\n\\n build_dir(Path::new(\\\"./next\\\"), Path::new(\\\"docs\\\"))?;\\n\\n build_dir(Path::new(\\\"./versioned_docs\\\"), Path::new(\\\"docs\\\"))?;\\n\\n build_dir(Path::new(\\\"./posts\\\"), Path::new(\\\"posts\\\"))?;\\n\\n\\n\\n // Docs sidebars.\\n\\n let next_sidebar = fs::read_to_string(\\\"./next/sidebar.json\\\")?;\\n\\n fs::write(\\\"../website/static/docs/sidebar.json\\\", next_sidebar)?;\\n\\n for entry in WalkDir::new(\\\"./versioned_docs\\\") {\\n\\n let entry = entry?;\\n\\n if entry.path().file_name() == Some(OsStr::new(\\\"sidebar.json\\\")) {\\n\",\n \"file_path\": \"docs/build.rs\",\n \"rank\": 48,\n \"score\": 128276.27526586986\n },\n {\n \"content\": \"#[component(Header<G>)]\\n\\npub fn header() -> View<G> {\\n\\n view! {\\n\\n header(class=\\\"fixed top-0 z-50 w-full\\\") {\\n\\n Nav()\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"website/src/header.rs\",\n \"rank\": 49,\n \"score\": 128004.20327947737\n },\n {\n \"content\": \"#[component(Versions<G>)]\\n\\npub fn versions() -> View<G> {\\n\\n web_sys::window()\\n\\n .unwrap()\\n\\n .document()\\n\\n .unwrap()\\n\\n .set_title(\\\"Versions - Sycamore\\\");\\n\\n\\n\\n let versions = VERSIONS\\n\\n .iter()\\n\\n .map(|(name, versioned_docs_link)| {\\n\\n view! {\\n\\n li {\\n\\n h2(class=\\\"text-2xl font-light\\\") { (name) }\\n\\n div(class=\\\"flex flex-col divide-y dark:divide-gray-500 text-gray-600 dark:text-gray-300\\\") {\\n\\n VersionedDocsLinkView((name, versioned_docs_link))\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n .collect();\\n\",\n \"file_path\": \"website/src/versions.rs\",\n \"rank\": 50,\n \"score\": 128004.20327947737\n },\n {\n \"content\": \"#[component(Index<G>)]\\n\\npub fn index() -> View<G> {\\n\\n web_sys::window()\\n\\n .unwrap()\\n\\n .document()\\n\\n .unwrap()\\n\\n .set_title(\\\"Sycamore\\\");\\n\\n\\n\\n view! {\\n\\n div(class=\\\"pb-10\\\") {\\n\\n div(class=\\\"flex flex-col items-center w-full mb-10\\\") {\\n\\n h1(class=\\\"text-5xl font-bold mt-20 mb-5\\\") {\\n\\n \\\"Sycamore\\\"\\n\\n }\\n\\n\\n\\n p(class=\\\"mb-5 text-center\\\") {\\n\\n \\\"A reactive library for creating web apps in Rust and WebAssembly\\\"\\n\\n }\\n\\n\\n\\n // region: badges\\n\\n div(class=\\\"mb-7 flex flex-row flex-wrap justify-center gap-1\\\") {\\n\",\n \"file_path\": \"website/src/index.rs\",\n \"rank\": 51,\n \"score\": 128004.20327947737\n },\n {\n \"content\": \"pub fn create_child_scope_in<'a>(\\n\\n parent: Option<&ReactiveScopeWeak>,\\n\\n callback: impl FnOnce() + 'a,\\n\\n) -> ReactiveScope {\\n\\n _create_child_scope_in(parent, Box::new(callback))\\n\\n}\\n\\n\\n\\n/// Creates a new reactive root / scope. Generally, you won't need this method as it is called\\n\\n/// automatically in `render`.\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use sycamore_reactive::*;\\n\\n///\\n\\n/// let trigger = Signal::new(());\\n\\n/// let counter = Signal::new(0);\\n\\n///\\n\\n/// let scope = create_root(cloned!((trigger, counter) => move || {\\n\\n/// create_effect(move || {\\n\\n/// trigger.get(); // subscribe to trigger\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/lib.rs\",\n \"rank\": 52,\n \"score\": 127478.14979043292\n },\n {\n \"content\": \"fn dyn_param(i: &str) -> IResult<&str, &str> {\\n\\n delimited(tag(\\\"<\\\"), ident, tag(\\\">\\\"))(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router-macro/src/parser.rs\",\n \"rank\": 53,\n \"score\": 126256.59276098566\n },\n {\n \"content\": \"#[component(Header<G>)]\\n\\npub fn header() -> View<G> {\\n\\n let app_state = use_context::<AppState>();\\n\\n let value = Signal::new(String::new());\\n\\n\\n\\n let handle_submit = cloned!((app_state, value) => move |event: Event| {\\n\\n let event: KeyboardEvent = event.unchecked_into();\\n\\n\\n\\n if event.key() == \\\"Enter\\\" {\\n\\n let mut task = value.get().as_ref().clone();\\n\\n task = task.trim().to_string();\\n\\n\\n\\n if !task.is_empty() {\\n\\n app_state.add_todo(task);\\n\\n value.set(\\\"\\\".to_string());\\n\\n }\\n\\n }\\n\\n });\\n\\n\\n\\n view! {\\n\\n header(class=\\\"header\\\") {\\n\\n h1 { \\\"todos\\\" }\\n\\n input(class=\\\"new-todo\\\",\\n\\n placeholder=\\\"What needs to be done?\\\",\\n\\n bind:value=value,\\n\\n on:keyup=handle_submit,\\n\\n )\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/todomvc/src/header.rs\",\n \"rank\": 54,\n \"score\": 126202.08772525155\n },\n {\n \"content\": \"#[component(Controls<G>)]\\n\\npub fn controls() -> View<G> {\\n\\n let counter = use_context::<Signal<i32>>();\\n\\n\\n\\n let increment = cloned!((counter) => move |_| counter.set(*counter.get() + 1));\\n\\n\\n\\n let reset = cloned!((counter) => move |_| counter.set(0));\\n\\n\\n\\n view! {\\n\\n button(class=\\\"increment\\\", on:click=increment) {\\n\\n \\\"Increment\\\"\\n\\n }\\n\\n button(class=\\\"reset\\\", on:click=reset) {\\n\\n \\\"Reset\\\"\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/context/src/main.rs\",\n \"rank\": 55,\n \"score\": 126202.08772525155\n },\n {\n \"content\": \"#[component(Copyright<G>)]\\n\\npub fn copyright() -> View<G> {\\n\\n view! {\\n\\n footer(class=\\\"info\\\") {\\n\\n p { \\\"Double click to edit a todo\\\" }\\n\\n p {\\n\\n \\\"Created by \\\"\\n\\n a(href=\\\"https://github.com/lukechu10\\\", target=\\\"_blank\\\") { \\\"lukechu10\\\" }\\n\\n }\\n\\n p {\\n\\n \\\"Part of \\\"\\n\\n a(href=\\\"http://todomvc.com\\\") { \\\"TodoMVC\\\" }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/todomvc/src/copyright.rs\",\n \"rank\": 56,\n \"score\": 126202.08772525155\n },\n {\n \"content\": \"#[component(Footer<G>)]\\n\\npub fn footer() -> View<G> {\\n\\n let app_state = use_context::<AppState>();\\n\\n\\n\\n let items_text = cloned!((app_state) => move || {\\n\\n match app_state.todos_left() {\\n\\n 1 => \\\"item\\\",\\n\\n _ => \\\"items\\\"\\n\\n }\\n\\n });\\n\\n\\n\\n let has_completed_todos = create_selector(cloned!((app_state) => move || {\\n\\n app_state.todos_left() < app_state.todos.get().len()\\n\\n }));\\n\\n\\n\\n let handle_clear_completed = cloned!((app_state) => move |_| {\\n\\n app_state.clear_completed()\\n\\n });\\n\\n\\n\\n view! {\\n\\n footer(class=\\\"footer\\\") {\\n\",\n \"file_path\": \"examples/todomvc/src/footer.rs\",\n \"rank\": 57,\n \"score\": 126202.08772525155\n },\n {\n \"content\": \"#[component(List<G>)]\\n\\npub fn list() -> View<G> {\\n\\n let app_state = use_context::<AppState>();\\n\\n let todos_left = create_selector(cloned!((app_state) => move || {\\n\\n app_state.todos_left()\\n\\n }));\\n\\n\\n\\n let filtered_todos = create_memo(cloned!((app_state) => move || {\\n\\n app_state.todos.get().iter().filter(|todo| match *app_state.filter.get() {\\n\\n Filter::All => true,\\n\\n Filter::Active => !todo.get().completed,\\n\\n Filter::Completed => todo.get().completed,\\n\\n }).cloned().collect::<Vec<_>>()\\n\\n }));\\n\\n\\n\\n // We need a separate signal for checked because clicking the checkbox will detach the binding\\n\\n // between the attribute and the view.\\n\\n let checked = Signal::new(false);\\n\\n create_effect(cloned!((checked) => move || {\\n\\n // Calling checked.set will also update the `checked` property on the input element.\\n\\n checked.set(*todos_left.get() == 0)\\n\",\n \"file_path\": \"examples/todomvc/src/list.rs\",\n \"rank\": 58,\n \"score\": 126202.08772525155\n },\n {\n \"content\": \"fn generate_sitemap_xml() -> Result<(), Box<dyn Error>> {\\n\\n let out_path = Path::new(\\\"../website/sitemap_index.xml\\\");\\n\\n\\n\\n let mut buf = String::new();\\n\\n writeln!(buf, r#\\\"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\\"#)?;\\n\\n writeln!(\\n\\n buf,\\n\\n r#\\\"<urlset xmlns=\\\"http://www.sitemaps.org/schemas/sitemap/0.9\\\">\\\"#\\n\\n )?;\\n\\n\\n\\n write_url(&mut buf, \\\"\\\", \\\"monthly\\\", \\\"1.0\\\")?;\\n\\n write_url(&mut buf, \\\"/news\\\", \\\"monthly\\\", \\\"0.8\\\")?;\\n\\n write_url(&mut buf, \\\"/versions\\\", \\\"monthly\\\", \\\"0.3\\\")?;\\n\\n\\n\\n // News\\n\\n generate_sitemap_for_dir(&mut buf, \\\"/news\\\", Path::new(\\\"posts\\\"), \\\"yearly\\\", \\\"0.8\\\")?;\\n\\n\\n\\n // Docs for master\\n\\n generate_sitemap_for_dir(&mut buf, \\\"/docs\\\", Path::new(\\\"./next\\\"), \\\"weekly\\\", \\\"0.5\\\")?;\\n\\n\\n\",\n \"file_path\": \"docs/build.rs\",\n \"rank\": 59,\n \"score\": 124721.00239940739\n },\n {\n \"content\": \"/// Navigates to the specified `url`. The url should have the same origin as the app.\\n\\n///\\n\\n/// This is useful for imperatively navigating to an url when using an anchor tag (`<a>`) is not\\n\\n/// possible/suitable (e.g. when submitting a form).\\n\\n///\\n\\n/// # Panics\\n\\n/// This function will `panic!()` if a [`Router`] has not yet been created.\\n\\npub fn navigate(url: &str) {\\n\\n PATHNAME.with(|pathname| {\\n\\n assert!(\\n\\n pathname.borrow().is_some(),\\n\\n \\\"navigate can only be used with a BrowserRouter\\\"\\n\\n );\\n\\n\\n\\n let pathname = pathname.borrow().clone().unwrap_throw();\\n\\n let path = url.strip_prefix(&base_pathname()).unwrap_or(url);\\n\\n pathname.set(path.to_string());\\n\\n\\n\\n // Update History API.\\n\\n let window = web_sys::window().unwrap_throw();\\n\\n let history = window.history().unwrap_throw();\\n\\n history\\n\\n .push_state_with_url(&JsValue::UNDEFINED, \\\"\\\", Some(url))\\n\\n .unwrap_throw();\\n\\n window.scroll_to_with_x_and_y(0.0, 0.0);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router/src/router.rs\",\n \"rank\": 60,\n \"score\": 124484.02081648918\n },\n {\n \"content\": \"#[component(NewsIndex<G>)]\\n\\npub fn news_index() -> View<G> {\\n\\n web_sys::window()\\n\\n .unwrap()\\n\\n .document()\\n\\n .unwrap()\\n\\n .set_title(\\\"News - Sycamore\\\");\\n\\n\\n\\n let posts = POSTS\\n\\n .iter()\\n\\n .map(|(title, subtitle, url)| {\\n\\n view! {\\n\\n li(class=\\\"hover:text-yellow-500 transition-colors\\\") {\\n\\n a(href=format!(\\\"/news/{}\\\", url)) {\\n\\n h2(class=\\\"text-2xl font-light\\\") { (title) }\\n\\n p(class=\\\"text-gray-600 dark:text-gray-400\\\") { (subtitle) }\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n .collect();\\n\",\n \"file_path\": \"website/src/news_index.rs\",\n \"rank\": 61,\n \"score\": 124480.53370008957\n },\n {\n \"content\": \"/// Runs a callback in a `requestAnimationFrame` loop until the `callback` returns `false`.\\n\\npub fn loop_raf(task: Task) {\\n\\n TASKS.with(|tasks| {\\n\\n if tasks.borrow().is_empty() {\\n\\n run_tasks();\\n\\n }\\n\\n\\n\\n tasks.borrow_mut().insert(task);\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore/src/utils.rs\",\n \"rank\": 62,\n \"score\": 124480.32497814854\n },\n {\n \"content\": \"pub fn circ_in(t: f32) -> f32 {\\n\\n 1.0 - f32::sqrt(1.0 - f32::powi(t, 2))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 63,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn expo_in(t: f32) -> f32 {\\n\\n if t.abs() <= f32::EPSILON {\\n\\n 0.0\\n\\n } else {\\n\\n EXP_BASE.powf(10.0 * t - 10.0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 64,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn cubic_in(t: f32) -> f32 {\\n\\n t * t * t\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 65,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn sine_out(t: f32) -> f32 {\\n\\n f32::sin(t * PI / 2.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 66,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn quint_out(t: f32) -> f32 {\\n\\n let f = t - 1.0;\\n\\n f * f * f * f * f + 1.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 67,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn bounce_in(t: f32) -> f32 {\\n\\n 1.0 - bounce_out(1.0 - t)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 68,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn quad_out(t: f32) -> f32 {\\n\\n -t * (t - 2.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 69,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn sine_in(t: f32) -> f32 {\\n\\n 1.0 - f32::cos(t * PI / 2.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 70,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn cubic_out(t: f32) -> f32 {\\n\\n let f = t - 1.0;\\n\\n f * f * f + 1.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 71,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn quint_in(t: f32) -> f32 {\\n\\n t * t * t * t * t\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 72,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn quart_in(t: f32) -> f32 {\\n\\n t * t * t * t\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 73,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn circ_out(t: f32) -> f32 {\\n\\n f32::sqrt(1.0 - f32::powi(t - 1.0, 2).powi(2))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 74,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn expo_out(t: f32) -> f32 {\\n\\n if (t - 1.0).abs() <= f32::EPSILON {\\n\\n 1.0\\n\\n } else {\\n\\n 1.0 - EXP_BASE.powf(-10.0 * t)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 75,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn quart_out(t: f32) -> f32 {\\n\\n let f = t - 1.0;\\n\\n f * f * f * (1.0 - t) + 1.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 76,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn bounce_out(t: f32) -> f32 {\\n\\n // TODO: Refactor? Code seems like a repetition.\\n\\n // Further, it is unclear why the numbers here are\\n\\n // picked.\\n\\n if t < 1.0 / BOUNCE_GRAVITY {\\n\\n BOUNCE_AMPLITUDE * t * t\\n\\n } else if t < 2.0 / BOUNCE_GRAVITY {\\n\\n let t = t - 1.5 / BOUNCE_GRAVITY;\\n\\n BOUNCE_AMPLITUDE * t * t + 0.75\\n\\n } else if t < 2.5 / BOUNCE_GRAVITY {\\n\\n let t = t - 2.25 / BOUNCE_GRAVITY;\\n\\n BOUNCE_AMPLITUDE * t * t + 0.9375\\n\\n } else {\\n\\n let t = t - 2.625 / BOUNCE_GRAVITY;\\n\\n BOUNCE_AMPLITUDE * t * t + 0.984375\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 77,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn linear(t: f32) -> f32 {\\n\\n t\\n\\n}\\n\\n\\n\\n// Quadratic\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 78,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"pub fn quad_in(t: f32) -> f32 {\\n\\n t * t\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 79,\n \"score\": 123521.39307363113\n },\n {\n \"content\": \"/// Function that maps a `Vec` to another `Vec` via a map function. The mapped `Vec` is lazy\\n\\n/// computed, meaning that it's value will only be updated when requested. Modifications to the\\n\\n/// input `Vec` are diffed by index to prevent recomputing values that have not changed.\\n\\n///\\n\\n/// Generally, it is preferred to use [`map_keyed`] instead when a key function is available.\\n\\n///\\n\\n/// This function is the underlying utility behind `Indexed`.\\n\\n///\\n\\n/// # Params\\n\\n/// * `list` - The list to be mapped. The list must be a [`ReadSignal`] (obtained from a [`Signal`])\\n\\n/// and therefore reactive.\\n\\n/// * `map_fn` - A closure that maps from the input type to the output type.\\n\\npub fn map_indexed<T, U>(\\n\\n list: ReadSignal<Vec<T>>,\\n\\n map_fn: impl Fn(&T) -> U + 'static,\\n\\n) -> impl FnMut() -> Vec<U>\\n\\nwhere\\n\\n T: PartialEq + Clone,\\n\\n U: Clone + 'static,\\n\\n{\\n\\n let parent_scope = current_scope();\\n\\n\\n\\n // Previous state used for diffing.\\n\\n let mut items = Rc::new(Vec::new());\\n\\n let mapped = Rc::new(RefCell::new(Vec::new()));\\n\\n let mut scopes = Vec::new();\\n\\n\\n\\n move || {\\n\\n let new_items = list.get(); // Subscribe to list.\\n\\n untrack(|| {\\n\\n if new_items.is_empty() {\\n\\n // Fast path for removing all items.\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/iter.rs\",\n \"rank\": 80,\n \"score\": 122854.87604910244\n },\n {\n \"content\": \"/// Gets the number of dependencies of the current reactive scope.\\n\\n///\\n\\n/// If the function is called outside a reactive scope, it will return `None`.\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use sycamore_reactive::*;\\n\\n///\\n\\n/// assert_eq!(dependency_count(), None);\\n\\n///\\n\\n/// let state = Signal::new(1);\\n\\n/// create_effect(move || {\\n\\n/// assert_eq!(dependency_count(), Some(0));\\n\\n/// state.get();\\n\\n/// assert_eq!(dependency_count(), Some(1));\\n\\n/// });\\n\\n/// ```\\n\\npub fn dependency_count() -> Option<usize> {\\n\\n LISTENERS.with(|listeners| {\\n\\n listeners.borrow().last().map(|last_context| {\\n\\n last_context\\n\\n .upgrade()\\n\\n .expect_throw(\\\"Running should be valid while inside reactive scope\\\")\\n\\n .borrow()\\n\\n .as_ref()\\n\\n .unwrap_throw()\\n\\n .dependencies\\n\\n .len()\\n\\n })\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 81,\n \"score\": 122842.03740185009\n },\n {\n \"content\": \"/// Navigates to the specified `url` without adding a new history entry. Instead, this replaces the\\n\\n/// current location with the new `url`. The url should have the same origin as the app.\\n\\n///\\n\\n/// This is useful for imperatively navigating to an url when using an anchor tag (`<a>`) is not\\n\\n/// possible/suitable (e.g. when submitting a form).\\n\\n///\\n\\n/// # Panics\\n\\n/// This function will `panic!()` if a [`Router`] has not yet been created.\\n\\npub fn navigate_replace(url: &str) {\\n\\n PATHNAME.with(|pathname| {\\n\\n assert!(\\n\\n pathname.borrow().is_some(),\\n\\n \\\"navigate_replace can only be used with a BrowserRouter\\\"\\n\\n );\\n\\n\\n\\n let pathname = pathname.borrow().clone().unwrap_throw();\\n\\n let path = url.strip_prefix(&base_pathname()).unwrap_or(url);\\n\\n pathname.set(path.to_string());\\n\\n\\n\\n // Update History API.\\n\\n let window = web_sys::window().unwrap_throw();\\n\\n let history = window.history().unwrap_throw();\\n\\n history\\n\\n .replace_state_with_url(&JsValue::UNDEFINED, \\\"\\\", Some(url))\\n\\n .unwrap_throw();\\n\\n window.scroll_to_with_x_and_y(0.0, 0.0);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-router/src/router.rs\",\n \"rank\": 82,\n \"score\": 122840.41305246016\n },\n {\n \"content\": \"/// Insert a [`GenericNode`] under `parent` at the specified `marker`. If `initial` is `Some(_)`,\\n\\n/// `initial` will be replaced with the new inserted node.\\n\\n///\\n\\n/// # Params\\n\\n/// * `parent` - The parent node to insert `accessor` under.\\n\\n/// * `accessor` - The [`View`] to be inserted.\\n\\n/// * `initial` - An optional initial node that is already inserted into the DOM.\\n\\n/// * `marker` - An optional marker node. If `marker` is `Some(_)`, `accessor` will be inserted\\n\\n/// directly before `marker`. If `marker` is `None`, `accessor` will be appended at the end of\\n\\n/// `parent`.\\n\\n/// * `multi` - A boolean flag indicating whether the node to be inserted is the only child of\\n\\n/// `parent`. Setting this to `true` will enable certain optimizations when clearing the node.\\n\\n/// Even if the node to be inserted is the only child of `parent`, `multi` can still be set to\\n\\n/// `false` but forgoes the optimizations.\\n\\npub fn insert<G: GenericNode>(\\n\\n parent: &G,\\n\\n accessor: View<G>,\\n\\n initial: Option<View<G>>,\\n\\n marker: Option<&G>,\\n\\n multi: bool,\\n\\n) {\\n\\n insert_expression(parent, &accessor, initial, marker, false, multi);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/utils/render.rs\",\n \"rank\": 83,\n \"score\": 122832.0686493215\n },\n {\n \"content\": \"pub fn circ_inout(t: f32) -> f32 {\\n\\n if t < 0.5 {\\n\\n (1.0 - f32::sqrt(1.0 - f32::powi(2.0 * t, 2))) / 2.0\\n\\n } else {\\n\\n (f32::sqrt(1.0 - f32::powi(-2.0 * t + 2.0, 2)) + 1.0) / 2.0\\n\\n }\\n\\n}\\n\\n\\n\\n// Exponential\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 84,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn quad_inout(t: f32) -> f32 {\\n\\n if t < 0.5 {\\n\\n 2.0 * t * t\\n\\n } else {\\n\\n -2.0 * t * t + 4.0 * t - 1.0\\n\\n }\\n\\n}\\n\\n\\n\\n// Cubic\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 85,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn sine_inout(t: f32) -> f32 {\\n\\n -(f32::cos(PI * t) - 1.0) / 2.0\\n\\n}\\n\\n\\n\\n// Bounce\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 86,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn cubic_inout(t: f32) -> f32 {\\n\\n if t < 0.5 {\\n\\n 4.0 * t * t * t\\n\\n } else {\\n\\n let f = 2.0 * t - 2.0;\\n\\n 0.5 * f * f * f + 1.0\\n\\n }\\n\\n}\\n\\n\\n\\n// Quartic\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 87,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn quart_inout(t: f32) -> f32 {\\n\\n if t < 0.5 {\\n\\n 8.0 * t * t * t * t\\n\\n } else {\\n\\n let f = t - 1.0;\\n\\n -8.0 * f * f * f * f + 1.0\\n\\n }\\n\\n}\\n\\n\\n\\n// Quintic\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 88,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn expo_inout(t: f32) -> f32 {\\n\\n if t.abs() <= f32::EPSILON {\\n\\n 0.0\\n\\n } else if (t - 1.0) <= f32::EPSILON {\\n\\n 1.0\\n\\n } else if t <= 0.5 {\\n\\n f32::powf(EXP_BASE, 20.0 * t - 10.0) / 2.0\\n\\n } else {\\n\\n 1.0 + f32::powf(EXP_BASE, -20.0 * t + 10.0) / -2.0\\n\\n }\\n\\n}\\n\\n\\n\\n// Sine\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 89,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn bounce_inout(t: f32) -> f32 {\\n\\n if t < 0.5 {\\n\\n (1.0 - bounce_out(1.0 - 2.0 * t)) / 2.0\\n\\n } else {\\n\\n (1.0 + bounce_out(-1.0 + 2.0 * t)) / 2.0\\n\\n }\\n\\n}\\n\\n\\n\\n// TODO: add more easing functions\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n macro_rules! test_start_at_0 {\\n\\n ($($ease_fn:ident),*) => {\\n\\n paste::paste! {\\n\\n $(\\n\\n #[test]\\n\\n fn [<test_ease_ $ease_fn _starts_at_0>]() {\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 90,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"pub fn quint_inout(t: f32) -> f32 {\\n\\n if t < 0.5 {\\n\\n 16.0 * t * t * t * t * t\\n\\n } else {\\n\\n let f = (2.0 * t) - 2.0;\\n\\n 0.5 * f * f * f * f * f + 1.0\\n\\n }\\n\\n}\\n\\n\\n\\n// Circular\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/easing.rs\",\n \"rank\": 91,\n \"score\": 121799.90763898703\n },\n {\n \"content\": \"/// Cleans the children specified by `current` from `parent`.\\n\\n///\\n\\n/// # Params\\n\\n/// * `parent` - The parent node from which to clean the children.\\n\\n/// * `current` - A [`Vec`] of [`GenericNode`]s that are to be removed.\\n\\n/// * `marker` - If `marker` is `None`, all the nodes from `parent` are removed regardless of\\n\\n/// `current`. This behavior will likely change in the future.\\n\\n/// * `replacement` - An optional replacement node for the removed nodes.\\n\\npub fn clean_children<G: GenericNode>(\\n\\n parent: &G,\\n\\n current: Vec<G>,\\n\\n _marker: Option<&G>,\\n\\n replacement: Option<&G>,\\n\\n multi: bool,\\n\\n) {\\n\\n if !multi {\\n\\n parent.update_inner_text(\\\"\\\");\\n\\n if let Some(replacement) = replacement {\\n\\n parent.append_child(replacement);\\n\\n }\\n\\n return;\\n\\n }\\n\\n\\n\\n for node in current {\\n\\n if node.parent_node().as_ref() == Some(parent) {\\n\\n if let Some(replacement) = replacement {\\n\\n parent.replace_child(&node, replacement);\\n\\n } else {\\n\\n parent.remove_child(&node);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore/src/utils/render.rs\",\n \"rank\": 92,\n \"score\": 121257.35230081374\n },\n {\n \"content\": \"/// Normalizes a `Vec<Template<G>>` into a `Vec<G>`.\\n\\n///\\n\\n/// Returns whether the normalized `Vec<G>` is dynamic (and should be rendered in an effect).\\n\\n///\\n\\n/// # Params\\n\\n/// * `v` - The [`Vec`] to write the output to.\\n\\n/// * `fragment` - The `Vec<Template<G>>` to normalize.\\n\\n/// * `unwrap` - If `true`, unwraps the `fragment` without setting `dynamic` to true. In most cases,\\n\\n/// this should be `false`.\\n\\npub fn normalize_incoming_fragment<G: GenericNode>(\\n\\n v: &mut Vec<View<G>>,\\n\\n fragment: &[View<G>],\\n\\n unwrap: bool,\\n\\n) -> bool {\\n\\n let mut dynamic = false;\\n\\n\\n\\n for template in fragment {\\n\\n match &template.inner {\\n\\n ViewType::Node(_) => v.push(template.clone()),\\n\\n ViewType::Dyn(f) if unwrap => {\\n\\n let mut value = f.get().as_ref().clone();\\n\\n while let ViewType::Dyn(f) = &value.inner {\\n\\n value = f.get().as_ref().clone();\\n\\n }\\n\\n let fragment: Rc<Box<[View<G>]>> = match &value.inner {\\n\\n ViewType::Node(_) => Rc::new(Box::new([value])),\\n\\n ViewType::Fragment(fragment) => Rc::clone(fragment),\\n\\n _ => unreachable!(),\\n\\n };\\n\",\n \"file_path\": \"packages/sycamore/src/utils/render.rs\",\n \"rank\": 93,\n \"score\": 119755.57024454788\n },\n {\n \"content\": \"/// Returns a [`ReactiveScopeWeak`] handle to the current reactive scope or `None` if outside of a\\n\\n/// reactive scope.\\n\\npub fn current_scope() -> Option<ReactiveScopeWeak> {\\n\\n SCOPES.with(|scope| {\\n\\n scope\\n\\n .borrow()\\n\\n .last()\\n\\n .map(|last_context| last_context.downgrade())\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::cloned;\\n\\n\\n\\n #[test]\\n\\n fn effects() {\\n\\n let state = Signal::new(0);\\n\\n\\n\\n let double = Signal::new(-1);\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 94,\n \"score\": 119748.76599907178\n },\n {\n \"content\": \"/// Function that maps a `Vec` to another `Vec` via a map function. The mapped `Vec` is lazy\\n\\n/// computed, meaning that it's value will only be updated when requested. Modifications to the\\n\\n/// input `Vec` are diffed using keys to prevent recomputing values that have not changed.\\n\\n///\\n\\n/// This function is the underlying utility behind `Keyed`.\\n\\n///\\n\\n/// # Params\\n\\n/// * `list` - The list to be mapped. The list must be a [`ReadSignal`] (obtained from a [`Signal`])\\n\\n/// and therefore reactive.\\n\\n/// * `map_fn` - A closure that maps from the input type to the output type.\\n\\n/// * `key_fn` - A closure that returns an _unique_ key to each entry.\\n\\n///\\n\\n/// _Credits: Based on TypeScript implementation in <https://github.com/solidjs/solid>_\\n\\npub fn map_keyed<T, K, U>(\\n\\n list: ReadSignal<Vec<T>>,\\n\\n map_fn: impl Fn(&T) -> U + 'static,\\n\\n key_fn: impl Fn(&T) -> K + 'static,\\n\\n) -> impl FnMut() -> Vec<U>\\n\\nwhere\\n\\n T: Eq + Clone,\\n\\n K: Eq + Hash,\\n\\n U: Clone + 'static,\\n\\n{\\n\\n let parent_scope = current_scope();\\n\\n\\n\\n // Previous state used for diffing.\\n\\n let mut items = Rc::new(Vec::new());\\n\\n let mapped = Rc::new(RefCell::new(Vec::new()));\\n\\n let mut scopes: Vec<Option<Rc<ReactiveScope>>> = Vec::new();\\n\\n\\n\\n move || {\\n\\n let new_items = list.get(); // Subscribe to list.\\n\\n untrack(|| {\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/iter.rs\",\n \"rank\": 95,\n \"score\": 118603.19592601797\n },\n {\n \"content\": \"/// A wrapper around [`wasm_bindgen_futures::spawn_local`] that extends the current reactive scope\\n\\n/// that it is called in.\\n\\n///\\n\\n/// If the scope is dropped by the time the future is spawned, the callback will not be called.\\n\\n///\\n\\n/// If not on `wasm32` target arch, this function is a no-op.\\n\\n///\\n\\n/// # Panics\\n\\n/// This function panics if called outside of a reactive scope.\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use sycamore::futures::spawn_local_in_scope;\\n\\n/// use sycamore::prelude::*;\\n\\n///\\n\\n/// create_root(|| {\\n\\n/// // Inside reactive scope.\\n\\n/// spawn_local_in_scope(async {\\n\\n/// // Still inside reactive scope.\\n\\n/// });\\n\\n/// });\\n\\n/// ```\\n\\npub fn spawn_local_in_scope<F>(future: F)\\n\\nwhere\\n\\n F: Future<Output = ()> + 'static,\\n\\n{\\n\\n if cfg!(target_arch = \\\"wasm32\\\") {\\n\\n if let Some(scope) = current_scope() {\\n\\n spawn_local(async move {\\n\\n scope.extend_future(future).await;\\n\\n });\\n\\n } else {\\n\\n panic!(\\\"spawn_local_in_scope called outside of reactive scope\\\");\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore/src/futures.rs\",\n \"rank\": 96,\n \"score\": 118588.34519771469\n },\n {\n \"content\": \"#[inline]\\n\\npub fn create_effect<F>(effect: F)\\n\\nwhere\\n\\n F: FnMut() + 'static,\\n\\n{\\n\\n _create_effect(Box::new(effect));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"packages/sycamore-reactive/src/effect.rs\",\n \"rank\": 97,\n \"score\": 118578.10882450888\n },\n {\n \"content\": \"#[component(TodoFilter<G>)]\\n\\npub fn todo_filter(filter: Filter) -> View<G> {\\n\\n let app_state = use_context::<AppState>();\\n\\n let selected = cloned!((app_state) => move || filter == *app_state.filter.get());\\n\\n let set_filter = cloned!((app_state) => move |filter| {\\n\\n app_state.filter.set(filter)\\n\\n });\\n\\n\\n\\n view! {\\n\\n li {\\n\\n a(\\n\\n class=if selected() { \\\"selected\\\" } else { \\\"\\\" },\\n\\n href=filter.url(),\\n\\n on:click=move |_| set_filter(filter),\\n\\n ) {\\n\\n (format!(\\\"{:?}\\\", filter))\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/todomvc/src/filter.rs\",\n \"rank\": 98,\n \"score\": 116182.60948432265\n },\n {\n \"content\": \"/// Trait that is implemented by components. Should not be implemented manually. Use the\\n\\n/// [`component`](sycamore_macro::component) macro instead.\\n\\npub trait Component<G: GenericNode> {\\n\\n /// The name of the component (for use in debug mode). In release mode, this will default to\\n\\n /// `\\\"UnnamedComponent\\\"`\\n\\n const NAME: &'static str = \\\"UnnamedComponent\\\";\\n\\n /// The type of the properties passed to the component.\\n\\n type Props;\\n\\n\\n\\n /// Create a new component with an instance of the properties.\\n\\n ///\\n\\n /// The double underscores (`__`) are to prevent conflicts with other trait methods. This is\\n\\n /// because we cannot use fully qualified syntax here because it prevents type inference.\\n\\n fn __create_component(props: Self::Props) -> View<G>;\\n\\n}\\n\",\n \"file_path\": \"packages/sycamore/src/component.rs\",\n \"rank\": 99,\n \"score\": 115554.54286773891\n }\n]","isConversational":false}}},{"rowIdx":1981,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"starky/src/constraint_consumer.rs"},"repo_name":{"kind":"string","value":"mfaulk/plonky2"},"commit":{"kind":"string","value":"2cedd1b02a718d19115560647ba1f741eab83260"},"file_code":{"kind":"string","value":"use std::marker::PhantomData;\n\nuse plonky2::field::extension_field::Extendable;\nuse plonky2::field::packed_field::PackedField;\nuse plonky2::hash::hash_types::RichField;\nuse plonky2::iop::ext_target::ExtensionTarget;\nuse plonky2::iop::target::Target;\nuse plonky2::plonk::circuit_builder::CircuitBuilder;\n\npub struct ConstraintConsumer<P: PackedField> {\n \n alphas: Vec<P::Scalar>,\n\n \n \n \n pub constraint_accs: Vec<P>,\n\n \n z_last: P,\n\n \n \n lagrange_basis_first: P,\n\n \n \n lagrange_basis_last: P,\n}\n\nimpl<P: PackedField> ConstraintConsumer<P> {\n pub fn new(\n alphas: Vec<P::Scalar>,\n z_last: P,\n lagrange_basis_first: P,\n lagrange_basis_last: P,\n ) -> Self {\n Self {\n constraint_accs: vec![P::ZEROS; alphas.len()],\n alphas,\n z_last,\n lagrange_basis_first,\n lagrange_basis_last,\n }\n }\n\n \n pub fn accumulators(self) -> Vec<P::Scalar> {\n self.constraint_accs\n .into_iter()\n .map(|acc| acc.as_slice()[0])\n .collect()\n }\n\n \n pub fn constraint_transition(&mut self, constraint: P) {\n self.constraint(constraint * self.z_last);\n }\n\n \n pub fn constraint(&mut self, constraint: P) {\n for (&alpha, acc) in self.alphas.iter().zip(&mut self.constraint_accs) {\n *acc *= alpha;\n *acc += constraint;\n }\n }\n\n \n \n pub fn constraint_first_row(&mut self, constraint: P) {\n self.constraint(constraint * self.lagrange_basis_first);\n }\n\n \n \n pub fn constraint_last_row(&mut self, constraint: P) {\n self.constraint(constraint * self.lagrange_basis_last);\n }\n}\n\npub struct RecursiveConstraintConsumer<F: RichField + Extendable<D>, const D: usize> {\n \n alphas: Vec<Target>,\n\n \n constraint_accs: Vec<ExtensionTarget<D>>,\n\n \n z_last: ExtensionTarget<D>,\n\n \n \n lagrange_basis_first: ExtensionTarget<D>,\n\n \n \n lagrange_basis_last: ExtensionTarget<D>,\n\n _phantom: PhantomData<F>,\n}\n\nimpl<F: RichField + Extendable<D>, const D: usize> RecursiveConstraintConsumer<F, D> {\n pub fn new(\n zero: ExtensionTarget<D>,\n alphas: Vec<Target>,\n z_last: ExtensionTarget<D>,\n lagrange_basis_first: ExtensionTarget<D>,\n lagrange_basis_last: ExtensionTarget<D>,\n ) -> Self {\n Self {\n constraint_accs: vec![zero; alphas.len()],\n alphas,\n z_last,\n lagrange_basis_first,\n lagrange_basis_last,\n _phantom: Default::default(),\n }\n }\n\n pub fn accumulators(self) -> Vec<ExtensionTarget<D>> {\n self.constraint_accs\n }\n\n \n pub fn constraint_transition(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n let filtered_constraint = builder.mul_extension(constraint, self.z_last);\n self.constraint(builder, filtered_constraint);\n }\n\n \n pub fn constraint(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n for (&alpha, acc) in self.alphas.iter().zip(&mut self.constraint_accs) {\n *acc = builder.scalar_mul_add_extension(alpha, *acc, constraint);\n }\n }\n\n \n \n pub fn constraint_first_row(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n let filtered_constraint = builder.mul_extension(constraint, self.lagrange_basis_first);\n self.constraint(builder, filtered_constraint);\n }\n\n \n \n pub fn constraint_last_row(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n let filtered_constraint = builder.mul_extension(constraint, self.lagrange_basis_last);\n self.constraint(builder, filtered_constraint);\n }\n}\n"},"prefix":{"kind":"string","value":"use std::marker::PhantomData;\n\nuse plonky2::field::extension_field::Extendable;\nuse plonky2::field::packed_field::PackedField;\nuse plonky2::hash::hash_types::RichField;\nuse plonky2::iop::ext_target::ExtensionTarget;\nuse plonky2::iop::target::Target;\nuse plonky2::plonk::circuit_builder::CircuitBuilder;\n\npub struct ConstraintConsumer<P: PackedField> {\n \n alphas: Vec<P::Scalar>,\n\n \n \n \n pub constraint_accs: Vec<P>,\n\n \n z_last: P,\n\n \n \n lagrange_basis_first: P,\n\n \n \n lagrange_basis_last: P,\n}\n\nimpl<P: PackedField> ConstraintConsumer<P> {\n pub fn new(\n alphas: Vec<P::Scalar>,\n z_last: P,\n lagrange_basis_first: P,\n lagrange_basis_last: P,\n ) -> Self {\n Self {\n constraint_accs: vec![P::ZEROS; alphas.len()],\n alphas,\n z_last,\n lagrange_basis_first,\n lagrange_basis_last,\n }\n }\n\n \n pub fn accumulators(self) -> Vec<P::Scalar> {\n self.constraint_accs\n .into_iter()\n .map(|acc| acc.as_slice()[0])\n .collect()\n }\n\n \n pub fn constraint_transition(&mut self, constraint: P) {\n self.constraint(constraint * self.z_last);\n }\n\n \n pub fn c"},"suffix":{"kind":"string","value":"\n\n \n \n pub fn constraint_first_row(&mut self, constraint: P) {\n self.constraint(constraint * self.lagrange_basis_first);\n }\n\n \n \n pub fn constraint_last_row(&mut self, constraint: P) {\n self.constraint(constraint * self.lagrange_basis_last);\n }\n}\n\npub struct RecursiveConstraintConsumer<F: RichField + Extendable<D>, const D: usize> {\n \n alphas: Vec<Target>,\n\n \n constraint_accs: Vec<ExtensionTarget<D>>,\n\n \n z_last: ExtensionTarget<D>,\n\n \n \n lagrange_basis_first: ExtensionTarget<D>,\n\n \n \n lagrange_basis_last: ExtensionTarget<D>,\n\n _phantom: PhantomData<F>,\n}\n\nimpl<F: RichField + Extendable<D>, const D: usize> RecursiveConstraintConsumer<F, D> {\n pub fn new(\n zero: ExtensionTarget<D>,\n alphas: Vec<Target>,\n z_last: ExtensionTarget<D>,\n lagrange_basis_first: ExtensionTarget<D>,\n lagrange_basis_last: ExtensionTarget<D>,\n ) -> Self {\n Self {\n constraint_accs: vec![zero; alphas.len()],\n alphas,\n z_last,\n lagrange_basis_first,\n lagrange_basis_last,\n _phantom: Default::default(),\n }\n }\n\n pub fn accumulators(self) -> Vec<ExtensionTarget<D>> {\n self.constraint_accs\n }\n\n \n pub fn constraint_transition(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n let filtered_constraint = builder.mul_extension(constraint, self.z_last);\n self.constraint(builder, filtered_constraint);\n }\n\n \n pub fn constraint(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n for (&alpha, acc) in self.alphas.iter().zip(&mut self.constraint_accs) {\n *acc = builder.scalar_mul_add_extension(alpha, *acc, constraint);\n }\n }\n\n \n \n pub fn constraint_first_row(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n let filtered_constraint = builder.mul_extension(constraint, self.lagrange_basis_first);\n self.constraint(builder, filtered_constraint);\n }\n\n \n \n pub fn constraint_last_row(\n &mut self,\n builder: &mut CircuitBuilder<F, D>,\n constraint: ExtensionTarget<D>,\n ) {\n let filtered_constraint = builder.mul_extension(constraint, self.lagrange_basis_last);\n self.constraint(builder, filtered_constraint);\n }\n}\n"},"middle":{"kind":"string","value":"onstraint(&mut self, constraint: P) {\n for (&alpha, acc) in self.alphas.iter().zip(&mut self.constraint_accs) {\n *acc *= alpha;\n *acc += constraint;\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1982,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"starchart/src/action/result.rs"},"repo_name":{"kind":"string","value":"starlite-project/starchart"},"commit":{"kind":"string","value":"c0f8cd6774596d45bf9a603aa3a37aa5dcde5d3a"},"file_code":{"kind":"string","value":"use std::{\n\tfmt::{Debug, Display, Formatter, Result as FmtResult},\n\thint::unreachable_unchecked,\n\titer::FromIterator,\n};\n\nuse crate::Entry;\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n#[must_use = \"an ActionResult should be asserted\"]\npub enum ActionResult<R> {\n\t\n\t\n\t\n\tCreate,\n\t\n\t\n\t\n\t\n\t\n\t\n\tSingleRead(Option<R>),\n\t\n\t\n\t\n\t\n\t\n\t\n\tMultiRead(Vec<R>),\n\t\n\t\n\t\n\tUpdate,\n\t\n\t\n\t\n\t\n\t\n\tDelete(bool),\n}\n\nimpl<R> ActionResult<R> {\n\t\n\t\n\t\n\tpub const fn is_create(&self) -> bool {\n\t\tmatches!(self, Self::Create)\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_single_read(&self) -> bool {\n\t\tmatches!(self, Self::SingleRead(_))\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_multi_read(&self) -> bool {\n\t\tmatches!(self, Self::MultiRead(_))\n\t}\n\n\t\n\t\n\t\n\t\n\tpub const fn is_read(&self) -> bool {\n\t\tself.is_single_read() || self.is_multi_read()\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_update(&self) -> bool {\n\t\tmatches!(self, Self::Update)\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_delete(&self) -> bool {\n\t\tmatches!(self, Self::Delete(_))\n\t}\n}\n\nimpl<R: Entry> ActionResult<R> {\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_create(self) {\n\t\tassert!(\n\t\t\tself.is_create(),\n\t\t\t\"called `ActionResult::create` on a `{}` value\",\n\t\t\tself\n\t\t);\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[inline]\n\t#[track_caller]\n\tpub unsafe fn unwrap_create_unchecked(self) {\n\t\tdebug_assert!(self.is_create());\n\t\tif let Self::Create = self {\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_single_read(self) -> Option<R> {\n\t\tif let Self::SingleRead(v) = self {\n\t\t\tv\n\t\t} else {\n\t\t\tpanic!(\"called `ActionResult::single_read` on a `{}` value\", self);\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub unsafe fn unwrap_single_read_unchecked(self) -> Option<R> {\n\t\tdebug_assert!(self.is_single_read());\n\t\tif let Self::SingleRead(v) = self {\n\t\t\tv\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_multi_read<I: FromIterator<R>>(self) -> I {\n\t\tif let Self::MultiRead(v) = self {\n\t\t\tv.into_iter().collect()\n\t\t} else {\n\t\t\tpanic!(\"called `ActionResult::multi_read` on a `{}` value\", self)\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\tpub unsafe fn unwrap_multi_read_unchecked<I: FromIterator<R>>(self) -> I {\n\t\tdebug_assert!(self.is_multi_read());\n\t\tif let Self::MultiRead(v) = self {\n\t\t\tv.into_iter().collect()\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_update(self) {\n\t\tassert!(\n\t\t\tself.is_update(),\n\t\t\t\"called `ActionResult::update` on a `{}` value\",\n\t\t\tself\n\t\t);\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\tpub unsafe fn unwrap_update_unchecked(self) {\n\t\tdebug_assert!(self.is_update());\n\t\tif let Self::Update = self {\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_delete(self) -> bool {\n\t\tif let Self::Delete(b) = self {\n\t\t\tb\n\t\t} else {\n\t\t\tpanic!(\"called `ActionResult::delete` on a `{}` value\", self)\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\tpub unsafe fn unwrap_delete_unchecked(self) -> bool {\n\t\tdebug_assert!(self.is_delete());\n\t\tif let Self::Delete(b) = self {\n\t\t\tb\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n}\n\nimpl<R> Display for ActionResult<R> {\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\t\tmatch self {\n\t\t\tSelf::Create => f.write_str(\"Create\"),\n\t\t\tSelf::SingleRead(_) | Self::MultiRead(_) => f.write_str(\"Read\"),\n\t\t\tSelf::Update => f.write_str(\"Update\"),\n\t\t\tSelf::Delete(_) => f.write_str(\"Delete\"),\n\t\t}\n\t}\n}\n"},"prefix":{"kind":"string","value":"use std::{\n\tfmt::{Debug, Display, Formatter, Result as FmtResult},\n\thint::unreachable_unchecked,\n\titer::FromIterator,\n};\n\nuse crate::Entry;\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n#[must_use = \"an ActionResult should be asserted\"]\npub enum ActionResult<R> {\n\t\n\t\n\t\n\tCreate,\n\t\n\t\n\t\n\t\n\t\n\t\n\tSingleRead(Option<R>),\n\t\n\t\n\t\n\t\n\t\n\t\n\tMultiRead(Vec<R>),\n\t\n\t\n\t\n\tUpdate,\n\t\n\t\n\t\n\t\n\t\n\tDelete(bool),\n}\n\nimpl<R> ActionResult<R> {\n\t\n\t\n\t\n\tpub const fn is_create(&self) -> bool {\n\t\tmatches!(self, Self::Create)\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_single_read(&self) -> bool {\n\t\tmatches!(self, Self::SingleRead(_))\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_multi_read(&self) -> bool {\n\t\tmatches!(self, Self::MultiRead(_))\n\t}\n\n\t\n\t\n\t\n\t\n\tpub const fn is_read(&self) -> bool {\n\t\tself.is_single_read() || self.is_multi_read()\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_update(&self) -> bool {\n\t\tmatches!(self, Self::Update)\n\t}\n\n\t\n\t\n\t\n\tpub const fn is_delete(&self) -> bool {\n\t\tmatches!(self, Self::Delete(_))\n\t}\n}\n\nimpl<R: Entry> ActionResult<R> {\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_create(self) {\n\t\tassert!(\n\t\t\tself.is_create(),\n\t\t\t\"called `ActionResult::create` on a `{}` value\",\n\t\t\tself\n\t\t);\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[inline]\n\t#[track_caller]\n\tpub unsafe fn unwrap_create_unchecked(self) {\n\t\tdebug_assert!(self.is_create());\n\t\tif let Self::Create = self {\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_single_read(self) -> Option<R> {\n\t\tif let Self::SingleRead(v) = self {\n\t\t\tv\n\t\t} else {\n\t\t\tpanic!(\"called `ActionResult::single_read` on a `{}` value\", self);\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\t"},"suffix":{"kind":"string","value":"\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_multi_read<I: FromIterator<R>>(self) -> I {\n\t\tif let Self::MultiRead(v) = self {\n\t\t\tv.into_iter().collect()\n\t\t} else {\n\t\t\tpanic!(\"called `ActionResult::multi_read` on a `{}` value\", self)\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\tpub unsafe fn unwrap_multi_read_unchecked<I: FromIterator<R>>(self) -> I {\n\t\tdebug_assert!(self.is_multi_read());\n\t\tif let Self::MultiRead(v) = self {\n\t\t\tv.into_iter().collect()\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_update(self) {\n\t\tassert!(\n\t\t\tself.is_update(),\n\t\t\t\"called `ActionResult::update` on a `{}` value\",\n\t\t\tself\n\t\t);\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\tpub unsafe fn unwrap_update_unchecked(self) {\n\t\tdebug_assert!(self.is_update());\n\t\tif let Self::Update = self {\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t#[track_caller]\n\t#[inline]\n\tpub fn unwrap_delete(self) -> bool {\n\t\tif let Self::Delete(b) = self {\n\t\t\tb\n\t\t} else {\n\t\t\tpanic!(\"called `ActionResult::delete` on a `{}` value\", self)\n\t\t}\n\t}\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\tpub unsafe fn unwrap_delete_unchecked(self) -> bool {\n\t\tdebug_assert!(self.is_delete());\n\t\tif let Self::Delete(b) = self {\n\t\t\tb\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}\n}\n\nimpl<R> Display for ActionResult<R> {\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\t\tmatch self {\n\t\t\tSelf::Create => f.write_str(\"Create\"),\n\t\t\tSelf::SingleRead(_) | Self::MultiRead(_) => f.write_str(\"Read\"),\n\t\t\tSelf::Update => f.write_str(\"Update\"),\n\t\t\tSelf::Delete(_) => f.write_str(\"Delete\"),\n\t\t}\n\t}\n}\n"},"middle":{"kind":"string","value":"pub unsafe fn unwrap_single_read_unchecked(self) -> Option<R> {\n\t\tdebug_assert!(self.is_single_read());\n\t\tif let Self::SingleRead(v) = self {\n\t\t\tv\n\t\t} else {\n\t\t\tunreachable_unchecked()\n\t\t}\n\t}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[cfg(not(feature = \"metadata\"))]\n\npub fn is_metadata(_: &str) -> bool {\n\n\tfalse\n\n}\n\n\n\npub unsafe trait InnerUnwrap<T> {\n\n\tunsafe fn inner_unwrap(self) -> T;\n\n}\n\n\n\n#[cfg(not(has_unwrap_unchecked))]\n\nunsafe impl<T> InnerUnwrap<T> for Option<T> {\n\n\t#[inline]\n\n\t#[track_caller]\n\n\tunsafe fn inner_unwrap(self) -> T {\n\n\t\tdebug_assert!(self.is_some());\n\n\t\tself.map_or_else(|| unreachable_unchecked(), |v| v)\n\n\t}\n\n}\n\n\n\n#[cfg(has_unwrap_unchecked)]\n\nunsafe impl<T> InnerUnwrap<T> for Option<T> {\n","file_path":"starchart/src/util.rs","rank":0,"score":122014.81896596614},{"content":"#[cfg(feature = \"metadata\")]\n\npub fn is_metadata(key: &str) -> bool {\n\n\tkey == crate::METADATA_KEY\n\n}\n\n\n","file_path":"starchart/src/util.rs","rank":1,"score":119027.09812816109},{"content":"/// A marker trait for use within the [`Starchart`].\n\n///\n\n/// This signifies that the type can be stored within a [`Starchart`].\n\n///\n\n/// [`Starchart`]: crate::Starchart\n\npub trait Entry: Clone + Serialize + DeserializeOwned + Debug + Default + Send + Sync {}\n\n\n\nimpl<T: Clone + Serialize + DeserializeOwned + Debug + Default + Send + Sync> Entry for T {}\n\n\n","file_path":"starchart/src/entry.rs","rank":2,"score":99746.55154388733},{"content":"/// An indexable entry, used for any [`Entry`] that can be indexed by a [`Key`] that it owns.\n\npub trait IndexEntry: Entry {\n\n\t/// The [`Key`] type to index by.\n\n\ttype Key: Key;\n\n\n\n\t/// Returns the valid key for the database to index from.\n\n\tfn key(&self) -> &Self::Key;\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\tuse std::fmt::{Debug, Display, Formatter, Result as FmtResult};\n\n\n\n\tuse serde::{de::DeserializeOwned, Deserialize, Serialize};\n\n\tuse static_assertions::assert_impl_all;\n\n\n\n\tuse super::{Entry, Key};\n\n\n\n\t#[derive(Debug, Default, Clone, PartialEq, Serialize, Deserialize)]\n\n\tstruct Settings {\n\n\t\tid: u32,\n","file_path":"starchart/src/entry.rs","rank":3,"score":83316.42971696638},{"content":"fn main() -> Result<(), Box<dyn Error + 'static>> {\n\n\tlet ac = AutoCfg::new()?;\n\n\tlet version_data = version_meta()?;\n\n\tif let Channel::Nightly = version_data.channel {\n\n\t\tif ac.probe_rustc_version(1, 57) {\n\n\t\t\temit(\"docsrs\");\n\n\t\t}\n\n\t}\n\n\n\n\tif ac.probe_expression(\"std::result::Result::<(), ()>::unwrap_unchecked\")\n\n\t\t&& ac.probe_expression(\"std::option::Option::<()>::unwrap_unchecked\")\n\n\t{\n\n\t\temit(\"has_unwrap_unchecked\");\n\n\t}\n\n\n\n\tOk(())\n\n}\n","file_path":"build.rs","rank":4,"score":80366.3482552683},{"content":"fn main() -> Result<(), Box<dyn Error + 'static>> {\n\n\tlet ac = AutoCfg::new()?;\n\n\tlet version_data = version_meta()?;\n\n\tif let Channel::Nightly = version_data.channel {\n\n\t\tif ac.probe_rustc_version(1, 57) {\n\n\t\t\temit(\"docsrs\");\n\n\t\t}\n\n\t}\n\n\n\n\tif ac.probe_expression(\"std::result::Result::<(), ()>::unwrap_unchecked\")\n\n\t\t&& ac.probe_expression(\"std::option::Option::<()>::unwrap_unchecked\")\n\n\t{\n\n\t\temit(\"has_unwrap_unchecked\");\n\n\t}\n\n\n\n\tOk(())\n\n}\n","file_path":"starchart/build.rs","rank":5,"score":78383.28780022784},{"content":"fn main() -> Result<(), Box<dyn Error + 'static>> {\n\n\tlet ac = AutoCfg::new()?;\n\n\tlet version_data = version_meta()?;\n\n\tif let Channel::Nightly = version_data.channel {\n\n\t\tif ac.probe_rustc_version(1, 57) {\n\n\t\t\temit(\"docsrs\");\n\n\t\t}\n\n\t}\n\n\n\n\tif ac.probe_expression(\"std::result::Result::<(), ()>::unwrap_unchecked\")\n\n\t\t&& ac.probe_expression(\"std::option::Option::<()>::unwrap_unchecked\")\n\n\t{\n\n\t\temit(\"has_unwrap_unchecked\");\n\n\t}\n\n\n\n\tOk(())\n\n}\n","file_path":"starchart-backends/build.rs","rank":6,"score":76532.403023812},{"content":"/// The key trait to be implemented on [`Entry`] to allow an easy way to get keys.\n\npub trait Key {\n\n\t/// The method to transform a [`Key`] into a value.\n\n\tfn to_key(&self) -> String;\n\n}\n\n\n\nimpl<T: ToString> Key for T {\n\n\tfn to_key(&self) -> String {\n\n\t\tself.to_string()\n\n\t}\n\n}\n\n\n","file_path":"starchart/src/entry.rs","rank":7,"score":75279.33754320188},{"content":"fn parse(input: &DeriveInput) -> Result<TokenStream> {\n\n\tlet ident = input.ident.clone();\n\n\n\n\tlet data = match &input.data {\n\n\t\tData::Struct(st) => st,\n\n\t\t_ => {\n\n\t\t\treturn Err(Error::new_spanned(\n\n\t\t\t\t&input,\n\n\t\t\t\t\"IndexEntry can only be derived on structs\",\n\n\t\t\t))\n\n\t\t}\n\n\t};\n\n\n\n\tlet named_fields = match data.fields {\n\n\t\tFields::Named(ref named) => &named.named,\n\n\t\t_ => {\n\n\t\t\treturn Err(Error::new_spanned(\n\n\t\t\t\t&data.fields,\n\n\t\t\t\t\"IndexEntry can only be derived on a struct with named fields\",\n\n\t\t\t))\n","file_path":"starchart-derive/src/lib.rs","rank":8,"score":74750.69951602965},{"content":"#[proc_macro_derive(IndexEntry, attributes(key))]\n\npub fn derive_entity(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\n\n\tlet input = parse_macro_input!(input as DeriveInput);\n\n\tparse(&input)\n\n\t\t.unwrap_or_else(|err| err.to_compile_error())\n\n\t\t.into()\n\n}\n\n\n","file_path":"starchart-derive/src/lib.rs","rank":9,"score":62996.85605334873},{"content":"#[derive(Deserialize)]\n\n#[serde(field_identifier, rename_all = \"lowercase\")]\n\nenum ActionField {\n\n\tType,\n\n\tTarget,\n\n\tTable,\n\n}\n\n\n","file_path":"starchart/src/action/dynamic.rs","rank":10,"score":48856.67073727489},{"content":"\tpub trait Sealed {}\n\n\n\n\timpl Sealed for CreateOperation {}\n\n\timpl Sealed for ReadOperation {}\n\n\timpl Sealed for UpdateOperation {}\n\n\timpl Sealed for DeleteOperation {}\n\n\timpl Sealed for TableTarget {}\n\n\timpl Sealed for EntryTarget {}\n\n\timpl<'a, S: Entry, C: CrudOperation, T: OperationTarget> Sealed for Action<'a, S, C, T> {}\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\tuse std::fmt::Debug;\n\n\n\n\tuse serde::{Deserialize, Serialize};\n\n\tuse static_assertions::assert_impl_all;\n\n\n\n\tuse super::{\n\n\t\tCreateOperation, DeleteOperation, EntryTarget, ReadOperation, TableTarget, UpdateOperation,\n","file_path":"starchart/src/action/impl.rs","rank":11,"score":42995.71140630776},{"content":"/// The backend to be used to manage data.\n\npub trait Backend: Send + Sync {\n\n\t/// The [`Error`] type that the backend will report up.\n\n\t///\n\n\t/// [`Error`]: std::error::Error\n\n\ttype Error: Send + Sync + StdError + 'static;\n\n\n\n\t/// An optional initialization function, useful for making connections to the database.\n\n\t///\n\n\t/// The default impl does nothing\n\n\tfn init(&self) -> InitFuture<'_, Self::Error> {\n\n\t\tok(()).boxed()\n\n\t}\n\n\n\n\t/// An optional shutdown function, useful for disconnecting from databases gracefully.\n\n\t///\n\n\t/// The default impl does nothing\n\n\t///\n\n\t/// # Safety\n\n\t///\n\n\t/// This should not fail, as it's ran upon dropping the [`Starchart`],\n","file_path":"starchart/src/backend/mod.rs","rank":12,"score":38998.5948486214},{"content":"/// A sealed marker trait for helping an [`Action`] represent what type of target the\n\n/// operation will cover.\n\n///\n\n/// [`Action`]: crate::action::Action\n\npub trait OperationTarget: private::Sealed {\n\n\t#[doc(hidden)]\n\n\tfn target() -> TargetKind;\n\n}\n\n\n\nimpl OperationTarget for TableTarget {\n\n\tfn target() -> TargetKind {\n\n\t\tTargetKind::Table\n\n\t}\n\n}\n\n\n\nimpl OperationTarget for EntryTarget {\n\n\tfn target() -> TargetKind {\n\n\t\tTargetKind::Entry\n\n\t}\n\n}\n\n\n\nmod private {\n\n\tuse super::{\n\n\t\tCreateOperation, CrudOperation, DeleteOperation, EntryTarget, OperationTarget,\n\n\t\tReadOperation, TableTarget, UpdateOperation,\n\n\t};\n\n\tuse crate::{Action, Entry};\n\n\n","file_path":"starchart/src/action/impl.rs","rank":13,"score":38068.02154802303},{"content":"/// A sealed marker trait for helping an [`Action`] represent what type of operation will occur.\n\n///\n\n/// [`Action`]: crate::action::Action\n\npub trait CrudOperation: private::Sealed {\n\n\t#[doc(hidden)]\n\n\tfn kind() -> ActionKind;\n\n}\n\n\n\nimpl CrudOperation for CreateOperation {\n\n\tfn kind() -> ActionKind {\n\n\t\tActionKind::Create\n\n\t}\n\n}\n\n\n\nimpl CrudOperation for ReadOperation {\n\n\tfn kind() -> ActionKind {\n\n\t\tActionKind::Read\n\n\t}\n\n}\n\n\n\nimpl CrudOperation for UpdateOperation {\n\n\tfn kind() -> ActionKind {\n\n\t\tActionKind::Update\n","file_path":"starchart/src/action/impl.rs","rank":14,"score":38068.02154802303},{"content":"#[cfg(feature = \"fs\")]\n\npub trait Transcoder: Send + Sync {\n\n\t/// Serializes a value into a [`Vec<u8>`] for writing to a file.\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// Any errors from the transcoder should use [`FsError::serde`] to return properly.\n\n\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError>;\n\n\n\n\t/// Deserializes data into the provided type.\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// Any errors from the transcoder should use [`FsError::serde`] to return properly.\n\n\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError>;\n\n}\n\n\n\n/// The transcoders for the [`FsBackend`].\n\npub mod transcoders {\n\n\t#[cfg(feature = \"binary\")]\n\n\tpub use super::binary::{BinaryFormat, BinaryTranscoder};\n","file_path":"starchart-backends/src/fs/mod.rs","rank":15,"score":38068.02154802303},{"content":"fn get_id_field(fields: &[Field]) -> Option<&Field> {\n\n\tfor field in fields {\n\n\t\tif field.attrs.iter().any(|attr| attr.path.is_ident(KEY_IDENT)) {\n\n\t\t\treturn Some(field);\n\n\t\t}\n\n\t}\n\n\n\n\tfor field in fields {\n\n\t\tif field\n\n\t\t\t.ident\n\n\t\t\t.as_ref()\n\n\t\t\t.map_or(false, |ident| ident == KEY_IDENT || ident == ID_IDENT)\n\n\t\t{\n\n\t\t\treturn Some(field);\n\n\t\t}\n\n\t}\n\n\n\n\tNone\n\n}\n","file_path":"starchart-derive/src/lib.rs","rank":16,"score":36858.102040284066},{"content":"\t\tname: String,\n\n\t}\n\n\n\n\t#[derive(Debug, Clone)]\n\n\tstruct Keyable {\n\n\t\tinner: String,\n\n\t}\n\n\n\n\timpl Display for Keyable {\n\n\t\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\n\t\t\tDisplay::fmt(&self.inner, f)\n\n\t\t}\n\n\t}\n\n\n\n\tassert_impl_all!(\n\n\t\tSettings: Clone,\n\n\t\tDebug,\n\n\t\tDefault,\n\n\t\tDeserializeOwned,\n\n\t\tEntry,\n","file_path":"starchart/src/entry.rs","rank":17,"score":33743.512629720426},{"content":"use std::fmt::Debug;\n\n\n\nuse serde::{de::DeserializeOwned, Serialize};\n\n\n\n/// The key trait to be implemented on [`Entry`] to allow an easy way to get keys.\n","file_path":"starchart/src/entry.rs","rank":18,"score":33735.17439405328},{"content":"\t\tSerialize\n\n\t);\n\n\n\n\t#[test]\n\n\tfn to_key() {\n\n\t\tlet keyable = Keyable {\n\n\t\t\tinner: \"12345\".to_owned(),\n\n\t\t};\n\n\n\n\t\tassert_eq!(keyable.to_key(), \"12345\".to_owned());\n\n\t}\n\n}\n","file_path":"starchart/src/entry.rs","rank":19,"score":33731.97629507764},{"content":"use std::fmt::{Display, Formatter, Result as FmtResult};\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\n/// The target of the [`CRUD`] operation.\n\n///\n\n/// [`CRUD`]: https://en.wikipedia.org/wiki/Create,_read,_update_and_delete\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[must_use = \"getting target information has no side effects\"]\n\npub enum TargetKind {\n\n\t/// The operation will be performed on a table.\n\n\tTable,\n\n\t/// The operation will be performed on a single entry.\n\n\tEntry,\n\n}\n\n\n\nimpl Default for TargetKind {\n\n\tfn default() -> Self {\n\n\t\tSelf::Entry\n\n\t}\n","file_path":"starchart/src/action/target.rs","rank":34,"score":33.169399149091234},{"content":"use std::fmt::Debug;\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\nuse super::{ActionKind, TargetKind};\n\n\n\n/// Marker type for a Create operation.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[non_exhaustive]\n\npub struct CreateOperation;\n\n\n\n/// Marker type for a Read operation.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[non_exhaustive]\n\npub struct ReadOperation;\n\n\n\n/// Marker type for an Update operation.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[non_exhaustive]\n\npub struct UpdateOperation;\n\n\n\n/// Marker type for a Delete operation.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[non_exhaustive]\n\npub struct DeleteOperation;\n\n\n\n/// A sealed marker trait for helping an [`Action`] represent what type of operation will occur.\n\n///\n\n/// [`Action`]: crate::action::Action\n","file_path":"starchart/src/action/impl.rs","rank":35,"score":26.271965066401496},{"content":"}\n\n\n\nimpl Display for TargetKind {\n\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\n\t\tmatch self {\n\n\t\t\tSelf::Table => f.write_str(\"Table\"),\n\n\t\t\tSelf::Entry => f.write_str(\"Entry\"),\n\n\t\t}\n\n\t}\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\tuse std::fmt::{Debug, Display};\n\n\n\n\tuse serde::{Deserialize, Serialize};\n\n\tuse static_assertions::assert_impl_all;\n\n\n\n\tuse super::TargetKind;\n\n\n","file_path":"starchart/src/action/target.rs","rank":36,"score":24.124290560228154},{"content":"use std::fmt::{Display, Formatter, Result as FmtResult};\n\n\n\nuse serde::{Deserialize, Serialize};\n\n\n\n/// The type of [`CRUD`] action to perform\n\n///\n\n/// [`CRUD`]: https://en.wikipedia.org/wiki/Create,_read,_update_and_delete\n\n#[must_use = \"getting the information on what action will be performed has no side effects\"]\n\n#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]\n\npub enum ActionKind {\n\n\t/// Signifies that the operation will be a Create.\n\n\t///\n\n\t/// This locks the database and allows no other reads or writes until it is complete.\n\n\tCreate,\n\n\t/// Signifies that the operation will be a Read.\n\n\t///\n\n\t/// This allows multiple different readers, but doesn't allow writing until all Reads are complete.\n\n\tRead,\n\n\t/// Signifies that the operation will be an Update.\n\n\t///\n","file_path":"starchart/src/action/kind.rs","rank":37,"score":22.595993894568608},{"content":"\t}\n\n}\n\n\n\nimpl CrudOperation for DeleteOperation {\n\n\tfn kind() -> ActionKind {\n\n\t\tActionKind::Delete\n\n\t}\n\n}\n\n\n\n/// Marker type for a table operation.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[non_exhaustive]\n\npub struct TableTarget;\n\n\n\n/// Marker type for an entry operation.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\n\n#[non_exhaustive]\n\npub struct EntryTarget;\n\n\n","file_path":"starchart/src/action/impl.rs","rank":38,"score":20.267851115647456},{"content":"//! A memory based backend. Useful for debugging or applications\n\n//! who only need to store data at runtime.\n\n\n\nuse std::{\n\n\tcollections::hash_map::RandomState,\n\n\terror::Error,\n\n\tfmt::{Debug, Display, Formatter, Result as FmtResult},\n\n\thash::BuildHasher,\n\n\titer::FromIterator,\n\n};\n\n\n\nuse dashmap::DashMap;\n\nuse futures_util::{\n\n\tfuture::{err, ok},\n\n\tFutureExt,\n\n};\n\nuse serde_value::{to_value, DeserializerError, SerializerError, Value};\n\nuse starchart::{\n\n\tbackend::{\n\n\t\tfutures::{\n","file_path":"starchart-backends/src/memory.rs","rank":39,"score":20.13701377569245},{"content":"const METADATA_KEY: &str = \"__metadata__\";\n\n\n\nuse std::result::Result as StdResult;\n\n\n\npub mod action;\n\nmod atomics;\n\npub mod backend;\n\nmod entry;\n\npub mod error;\n\nmod starchart;\n\n#[cfg(not(tarpaulin_include))]\n\nmod util;\n\n\n\n#[doc(inline)]\n\npub use self::{\n\n\taction::Action,\n\n\tentry::{Entry, IndexEntry, Key},\n\n\terror::Error,\n\n\tstarchart::Starchart,\n\n};\n\n\n\n/// A type alias for a [`Result`] that wraps around [`Error`].\n\npub type Result<T, E = Error> = StdResult<T, E>;\n\n\n\n/// The helper derive macro for easily implementing [`IndexEntry`].\n\n#[cfg(feature = \"derive\")]\n\npub use starchart_derive::IndexEntry;\n","file_path":"starchart/src/lib.rs","rank":40,"score":19.876791114101795},{"content":"use std::io::Read;\n\n\n\nuse starchart::Entry;\n\n\n\nuse super::{FsError, Transcoder};\n\n\n\n/// A transcoder for the YAML format.\n\n#[derive(Debug, Default, Clone, Copy)]\n\n#[cfg(feature = \"yaml\")]\n\n#[non_exhaustive]\n\n#[must_use = \"transcoders do nothing by themselves\"]\n\npub struct YamlTranscoder;\n\n\n\nimpl YamlTranscoder {\n\n\t/// Creates a new [`YamlTranscoder`].\n\n\tpub const fn new() -> Self {\n\n\t\tSelf\n\n\t}\n\n}\n\n\n","file_path":"starchart-backends/src/fs/yaml.rs","rank":41,"score":19.629842485044417},{"content":"\tfn default() -> Self {\n\n\t\tSelf::Read\n\n\t}\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\tuse std::fmt::{Debug, Display};\n\n\n\n\tuse serde::{Deserialize, Serialize};\n\n\tuse static_assertions::assert_impl_all;\n\n\n\n\tuse super::ActionKind;\n\n\n\n\tassert_impl_all!(\n\n\t\tActionKind: Clone,\n\n\t\tCopy,\n\n\t\tDebug,\n\n\t\tDefault,\n\n\t\tDeserialize<'static>,\n","file_path":"starchart/src/action/kind.rs","rank":42,"score":18.97098504065039},{"content":"\t\tDisplay,\n\n\t\tPartialEq,\n\n\t\tSend,\n\n\t\tSerialize,\n\n\t\tSync\n\n\t);\n\n\n\n\t#[test]\n\n\tfn default() {\n\n\t\tassert_eq!(ActionKind::default(), ActionKind::Read);\n\n\t}\n\n\n\n\t#[test]\n\n\tfn display() {\n\n\t\tassert_eq!(ActionKind::Create.to_string(), \"Create\");\n\n\t\tassert_eq!(ActionKind::Read.to_string(), \"Read\");\n\n\t\tassert_eq!(ActionKind::Update.to_string(), \"Update\");\n\n\t\tassert_eq!(ActionKind::Delete.to_string(), \"Delete\");\n\n\t}\n\n}\n","file_path":"starchart/src/action/kind.rs","rank":43,"score":18.20659689365592},{"content":"//! The different errors within the crate.\n\n\n\nuse std::{\n\n\terror::Error as StdError,\n\n\tfmt::{Display, Formatter, Result as FmtResult},\n\n};\n\n\n\n#[doc(inline)]\n\npub use crate::action::{\n\n\tActionError, ActionErrorType, ActionRunError, ActionRunErrorType, ActionValidationError,\n\n\tActionValidationErrorType,\n\n};\n\n\n\n// NOTE: This error shouldn't be used anywhere inside this crate, it's only meant for end users as an ease of use\n\n// error struct.\n\n\n\n/// An error that occurred within the crate.\n\n#[derive(Debug)]\n\npub struct Error {\n\n\tsource: Option<Box<dyn StdError + Send + Sync>>,\n","file_path":"starchart/src/error.rs","rank":44,"score":18.17151808226323},{"content":"\t\tassert_eq!(CreateOperation::kind(), ActionKind::Create);\n\n\t\tassert_eq!(ReadOperation::kind(), ActionKind::Read);\n\n\t\tassert_eq!(UpdateOperation::kind(), ActionKind::Update);\n\n\t\tassert_eq!(DeleteOperation::kind(), ActionKind::Delete);\n\n\t}\n\n\n\n\t#[test]\n\n\tfn target() {\n\n\t\tassert_eq!(TableTarget::target(), TargetKind::Table);\n\n\t\tassert_eq!(EntryTarget::target(), TargetKind::Entry);\n\n\t}\n\n}\n","file_path":"starchart/src/action/impl.rs","rank":45,"score":17.86393205440589},{"content":"\t\tself.inner.update_entry(chart)\n\n\t}\n\n}\n\n\n\nimpl<'a, S: Entry> DeleteEntryAction<'a, S> {\n\n\t/// Validates and runs a [`DeleteEntryAction`].\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_key`] fails, or if any of the [`Backend`] methods fail.\n\n\tpub fn run_delete_entry<B: Backend>(\n\n\t\tself,\n\n\t\tgateway: &'a Starchart<B>,\n\n\t) -> impl Future<Output = Result<bool, ActionError>> + 'a {\n\n\t\tself.inner.delete_entry(gateway)\n\n\t}\n\n}\n\n\n\nimpl<'a, S: Entry> CreateTableAction<'a, S> {\n\n\t/// Validates and runs a [`CreateTableAction`].\n","file_path":"starchart/src/action/mod.rs","rank":46,"score":17.842077516486828},{"content":"use std::io::Read;\n\n\n\nuse starchart::Entry;\n\n\n\nuse super::{transcoders::TranscoderFormat, FsError, Transcoder};\n\n\n\n/// A transcoder for the TOML format.\n\n#[derive(Debug, Default, Clone, Copy)]\n\n#[cfg(feature = \"toml\")]\n\n#[must_use = \"transcoders do nothing by themselves\"]\n\npub struct TomlTranscoder(TranscoderFormat);\n\n\n\nimpl TomlTranscoder {\n\n\t/// Creates a new [`TomlTranscoder`], optionally using pretty printing.\n\n\tpub const fn new(format: TranscoderFormat) -> Self {\n\n\t\tSelf(format)\n\n\t}\n\n\n\n\t/// Returns whether or not this transcoder uses pretty formatting.\n\n\t#[must_use]\n","file_path":"starchart-backends/src/fs/toml.rs","rank":47,"score":17.694808074574446},{"content":"use std::io::Read;\n\n\n\nuse starchart::Entry;\n\n\n\nuse super::{transcoders::TranscoderFormat, FsError, Transcoder};\n\n\n\n/// A transcoder for the JSON format.\n\n#[derive(Debug, Default, Clone, Copy)]\n\n#[cfg(feature = \"json\")]\n\n#[must_use = \"transcoders do nothing by themselves\"]\n\npub struct JsonTranscoder(TranscoderFormat);\n\n\n\nimpl JsonTranscoder {\n\n\t/// Creates a new [`JsonTranscoder`], optionally using pretty printing.\n\n\tpub const fn new(format: TranscoderFormat) -> Self {\n\n\t\tSelf(format)\n\n\t}\n\n\n\n\t/// Returns whether or not this transcoder uses pretty formatting.\n\n\t#[must_use]\n","file_path":"starchart-backends/src/fs/json.rs","rank":48,"score":17.694808074574446},{"content":"\tassert_impl_all!(\n\n\t\tTargetKind: Clone,\n\n\t\tCopy,\n\n\t\tDebug,\n\n\t\tDefault,\n\n\t\tDeserialize<'static>,\n\n\t\tDisplay,\n\n\t\tPartialEq,\n\n\t\tSend,\n\n\t\tSerialize,\n\n\t\tSync\n\n\t);\n\n\n\n\t#[test]\n\n\tfn default() {\n\n\t\tassert_eq!(TargetKind::default(), TargetKind::Entry);\n\n\t}\n\n\n\n\t#[test]\n\n\tfn display() {\n\n\t\tassert_eq!(TargetKind::Entry.to_string(), \"Entry\");\n\n\t\tassert_eq!(TargetKind::Table.to_string(), \"Table\");\n\n\t}\n\n}\n","file_path":"starchart/src/action/target.rs","rank":49,"score":17.678852853376842},{"content":"\t}\n\n\n\n\t/// Creates a new error from a backend.\n\n\t#[must_use]\n\n\tpub fn backend(e: Option<Box<dyn StdError + Send + Sync>>) -> Self {\n\n\t\tSelf {\n\n\t\t\tsource: e,\n\n\t\t\tkind: ErrorType::Backend,\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl Display for Error {\n\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\n\t\tmatch &self.kind {\n\n\t\t\tErrorType::Backend => f.write_str(\"an error occurred within a backend\"),\n\n\t\t\tErrorType::ActionRun => f.write_str(\"an error occurred running an action\"),\n\n\t\t\tErrorType::ActionValidation => f.write_str(\"an action is invalid\"),\n\n\t\t}\n\n\t}\n","file_path":"starchart/src/error.rs","rank":50,"score":16.974297222273922},{"content":"\tpub const fn is_pretty(self) -> bool {\n\n\t\tmatches!(self.0, TranscoderFormat::Pretty)\n\n\t}\n\n\n\n\t/// Returns whether or not this transcoder uses standard formatting.\n\n\t#[must_use]\n\n\tpub const fn is_standard(self) -> bool {\n\n\t\t!self.is_pretty()\n\n\t}\n\n\n\n\t/// Create a new [`JsonTranscoder`] with prettier file formatting.\n\n\tpub const fn pretty() -> Self {\n\n\t\tSelf::new(TranscoderFormat::Pretty)\n\n\t}\n\n\n\n\t/// Creates a new [`JsonTranscoder`] with standard file formatting.\n\n\tpub const fn standard() -> Self {\n\n\t\tSelf::new(TranscoderFormat::Standard)\n\n\t}\n\n}\n","file_path":"starchart-backends/src/fs/json.rs","rank":51,"score":16.887222968242256},{"content":"\tpub const fn is_pretty(self) -> bool {\n\n\t\tmatches!(self.0, TranscoderFormat::Pretty)\n\n\t}\n\n\n\n\t/// Returns whether or not this transcoder uses standard formatting.\n\n\t#[must_use]\n\n\tpub const fn is_standard(self) -> bool {\n\n\t\t!self.is_pretty()\n\n\t}\n\n\n\n\t/// Create a new [`TomlTranscoder`] with prettier file formatting.\n\n\tpub const fn pretty() -> Self {\n\n\t\tSelf::new(TranscoderFormat::Pretty)\n\n\t}\n\n\n\n\t/// Creates a new [`TomlTranscoder`] with standard file formatting.\n\n\tpub const fn standard() -> Self {\n\n\t\tSelf::new(TranscoderFormat::Standard)\n\n\t}\n\n}\n","file_path":"starchart-backends/src/fs/toml.rs","rank":52,"score":16.887222968242252},{"content":"\t/// This locks the database and allows no other reads or writes until it is complete.\n\n\tUpdate,\n\n\t/// Signifies that the operation will be a Delete.\n\n\t///\n\n\t/// This locks the database and allows no other reads or writes until it is complete.\n\n\tDelete,\n\n}\n\n\n\nimpl Display for ActionKind {\n\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\n\t\tmatch self {\n\n\t\t\tSelf::Create => f.write_str(\"Create\"),\n\n\t\t\tSelf::Read => f.write_str(\"Read\"),\n\n\t\t\tSelf::Update => f.write_str(\"Update\"),\n\n\t\t\tSelf::Delete => f.write_str(\"Delete\"),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl Default for ActionKind {\n","file_path":"starchart/src/action/kind.rs","rank":53,"score":16.792081439178087},{"content":"impl Transcoder for YamlTranscoder {\n\n\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\n\n\t\tOk(serde_yaml::to_vec(value)?)\n\n\t}\n\n\n\n\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError> {\n\n\t\tOk(serde_yaml::from_reader(rdr)?)\n\n\t}\n\n}\n\n\n\n#[cfg(all(test, not(miri)))]\n\nmod tests {\n\n\tuse std::{fmt::Debug, fs};\n\n\n\n\tuse starchart::backend::Backend;\n\n\tuse static_assertions::assert_impl_all;\n\n\n\n\tuse crate::{\n\n\t\tfs::{transcoders::YamlTranscoder, FsBackend, FsError},\n\n\t\ttesting::{TestPath, TestSettings, TEST_GUARD},\n","file_path":"starchart-backends/src/fs/yaml.rs","rank":54,"score":16.62061012918509},{"content":"\t/// # Errors\n\n\t///\n\n\t/// This will raise an error if any of the static run methods in [`Action`] fail, as it uses those internally.\n\n\tpub async fn run<B: Backend>(\n\n\t\tself,\n\n\t\tchart: &Starchart<B>,\n\n\t) -> Result<ActionResult<S>, ActionError> {\n\n\t\tmatch (self.kind(), self.target()) {\n\n\t\t\t(ActionKind::Create, TargetKind::Entry) => {\n\n\t\t\t\tlet stat = self.as_static::<CreateOperation, EntryTarget>()?;\n\n\t\t\t\tstat.run_create_entry(chart).await?;\n\n\t\t\t\tOk(ActionResult::Create)\n\n\t\t\t}\n\n\t\t\t(ActionKind::Read, TargetKind::Entry) => {\n\n\t\t\t\tlet stat = self.as_static::<ReadOperation, EntryTarget>()?;\n\n\t\t\t\tlet ret = stat.run_read_entry(chart).await?;\n\n\t\t\t\tOk(ActionResult::SingleRead(ret))\n\n\t\t\t}\n\n\t\t\t(ActionKind::Update, TargetKind::Entry) => {\n\n\t\t\t\tlet stat = self.as_static::<UpdateOperation, EntryTarget>()?;\n","file_path":"starchart/src/action/dynamic.rs","rank":55,"score":16.32460734597774},{"content":"use std::{\n\n\terror::Error,\n\n\tfmt::{Display, Formatter, Result as FmtResult},\n\n\tio::Error as IoError,\n\n\tpath::PathBuf,\n\n};\n\n\n\n/// An error occurred from the [`FsBackend`] or one of it's [`Transcoders`].\n\n///\n\n/// [`FsBackend`]: super::FsBackend\n\n/// [`Transcoders`]: super::Transcoder\n\n#[derive(Debug)]\n\n#[cfg(feature = \"fs\")]\n\npub struct FsError {\n\n\tpub(super) source: Option<Box<dyn Error + Send + Sync>>,\n\n\tpub(super) kind: FsErrorType,\n\n}\n\n\n\nimpl FsError {\n\n\t/// Creates an error from a [`Transcoder`].\n","file_path":"starchart-backends/src/fs/error.rs","rank":56,"score":16.246028069797102},{"content":"use std::{\n\n\tfmt::{Formatter, Result as FmtResult},\n\n\tmarker::PhantomData,\n\n};\n\n\n\nuse serde::{\n\n\tde::{Error as DeError, MapAccess, SeqAccess, Visitor},\n\n\tser::SerializeStruct,\n\n\tDeserialize, Deserializer, Serialize, Serializer,\n\n};\n\n\n\nuse super::{\n\n\tActionError, ActionKind, ActionResult, ActionValidationError, ActionValidationErrorType,\n\n\tCrudOperation, InnerAction, OperationTarget, TargetKind,\n\n};\n\nuse crate::{\n\n\taction::{\n\n\t\tCreateOperation, DeleteOperation, EntryTarget, ReadOperation, TableTarget, UpdateOperation,\n\n\t},\n\n\tbackend::Backend,\n","file_path":"starchart/src/action/dynamic.rs","rank":57,"score":16.225461889151273},{"content":"\n\n\t/// Validates that both the key and data have been set.\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This errors if both the [`Self::set_key`] and [`Self::set_data`] (or [`Self::set_entry`]) has not been called.\n\n\tpub fn validate_entry(&self) -> Result<(), ActionValidationError> {\n\n\t\tself.inner.validate_entry()\n\n\t}\n\n}\n\n\n\nimpl<'a, S: IndexEntry, C: CrudOperation> Action<'a, S, C, EntryTarget> {\n\n\t/// Sets the [`Entry`] and [`Key`] that this [`Action`] will act over.\n\n\tpub fn set_entry(&mut self, entity: &'a S) -> &mut Self {\n\n\t\tself.set_key(entity.key()).set_data(entity)\n\n\t}\n\n}\n\n\n\nimpl<'a, S: Entry, C: CrudOperation, T: OperationTarget> Debug for Action<'a, S, C, T> {\n\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n","file_path":"starchart/src/action/mod.rs","rank":58,"score":16.167506146800218},{"content":"\t///\n\n\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_key`] fails, or if any of the [`Backend`] methods fail.\n\n\tpub fn run_read_entry<B: Backend>(\n\n\t\tself,\n\n\t\tgateway: &'a Starchart<B>,\n\n\t) -> impl Future<Output = Result<Option<S>, ActionError>> + 'a {\n\n\t\tself.inner.read_entry(gateway)\n\n\t}\n\n}\n\n\n\nimpl<'a, S: Entry> UpdateEntryAction<'a, S> {\n\n\t/// Validates and runs a [`UpdateEntryAction`].\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_entry`] fails, or if any of the [`Backend`] methods fail.\n\n\tpub fn run_update_entry<B: Backend>(\n\n\t\tself,\n\n\t\tchart: &'a Starchart<B>,\n\n\t) -> impl Future<Output = Result<(), ActionError>> + 'a {\n","file_path":"starchart/src/action/mod.rs","rank":59,"score":16.056493561539593},{"content":"\t\ttable: &'a str,\n\n\t\tid: &'a str,\n\n\t\tvalue: &'a S,\n\n\t) -> EnsureFuture<'a, Self::Error>\n\n\twhere\n\n\t\tS: Entry,\n\n\t{\n\n\t\tasync move {\n\n\t\t\tif !self.has(table, id).await? {\n\n\t\t\t\tself.create(table, id, value).await?;\n\n\t\t\t}\n\n\n\n\t\t\tOk(())\n\n\t\t}\n\n\t\t.boxed()\n\n\t}\n\n\n\n\t/// Updates an existing entry in a table.\n\n\tfn update<'a, S>(\n\n\t\t&'a self,\n","file_path":"starchart/src/backend/mod.rs","rank":60,"score":15.97220979463848},{"content":"\n\n\t/// Checks whether the transcoder uses the [`CBOR`] format.\n\n\t///\n\n\t/// [`CBOR`]: serde_cbor\n\n\t#[must_use]\n\n\tpub const fn is_cbor(self) -> bool {\n\n\t\tmatches!(self.format(), BinaryFormat::Cbor)\n\n\t}\n\n}\n\n\n\nimpl Transcoder for BinaryTranscoder {\n\n\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\n\n\t\tmatch self.format() {\n\n\t\t\tBinaryFormat::Bincode => Ok(serde_bincode::serialize(value)?),\n\n\t\t\tBinaryFormat::Cbor => Ok(serde_cbor::to_vec(value)?),\n\n\t\t}\n\n\t}\n\n\n\n\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError> {\n\n\t\tmatch self.format() {\n","file_path":"starchart-backends/src/fs/binary.rs","rank":61,"score":15.83152438391227},{"content":"\t}\n\n}\n\n\n\nimpl<S: BuildHasher + Clone> MemoryBackend<S> {\n\n\t/// Creates a new [`MemoryBackend`] with the specified hasher.\n\n\tpub fn with_hasher(hasher: S) -> Self {\n\n\t\tSelf::with_capacity_and_hasher(0, hasher)\n\n\t}\n\n\n\n\t/// Creates a new [`MemoryBackend`] with the specified capacity and hasher.\n\n\tpub fn with_capacity_and_hasher(cap: usize, hasher: S) -> Self {\n\n\t\tSelf {\n\n\t\t\ttables: DashMap::with_capacity_and_hasher(cap, hasher),\n\n\t\t}\n\n\t}\n\n}\n\n\n\nimpl<S: BuildHasher + Clone> Debug for MemoryBackend<S> {\n\n\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\n\n\t\tf.debug_struct(\"MemoryBackend\")\n","file_path":"starchart-backends/src/memory.rs","rank":62,"score":15.804639261383963},{"content":"use crate::{\n\n\tbackend::Backend,\n\n\tutil::{is_metadata, InnerUnwrap},\n\n\tEntry, IndexEntry, Key, Starchart,\n\n};\n\n\n\n/// A type alias for an [`Action`] with [`CreateOperation`] and [`EntryTarget`] as the parameters.\n\npub type CreateEntryAction<'a, S> = Action<'a, S, CreateOperation, EntryTarget>;\n\n\n\n/// A type alias for an [`Action`] with [`ReadOperation`] and [`EntryTarget`] as the parameters.\n\npub type ReadEntryAction<'a, S> = Action<'a, S, ReadOperation, EntryTarget>;\n\n\n\n/// A type alias for an [`Action`] with [`UpdateOperation`] and [`EntryTarget`] as the parameters.\n\npub type UpdateEntryAction<'a, S> = Action<'a, S, UpdateOperation, EntryTarget>;\n\n\n\n/// A type alias for an [`Action`] with [`DeleteOperation`] and [`EntryTarget`] as the parameters.\n\npub type DeleteEntryAction<'a, S> = Action<'a, S, DeleteOperation, EntryTarget>;\n\n\n\n/// A type alias for an [`Action`] with [`CreateOperation`] and [`TableTarget`] as the parameters.\n\npub type CreateTableAction<'a, S> = Action<'a, S, CreateOperation, TableTarget>;\n","file_path":"starchart/src/action/mod.rs","rank":63,"score":15.70373440817529},{"content":"//! Futures for [`Backend`] functions to return, for easier documentation.\n\n//!\n\n//! [`Backend`]: crate::backend::Backend\n\nuse std::{future::Future, pin::Pin};\n\n\n\n#[cfg(doc)]\n\nuse crate::backend::Backend;\n\n\n\n/// The future returned from [`Backend::init`].\n\npub type InitFuture<'a, E> = PinBoxFuture<'a, Result<(), E>>;\n\n\n\n/// The future returned from [`Backend::shutdown`].\n\npub type ShutdownFuture<'a> = PinBoxFuture<'a>;\n\n\n\n/// The future returned from [`Backend::has_table`].\n\npub type HasTableFuture<'a, E> = PinBoxFuture<'a, Result<bool, E>>;\n\n\n\n/// The future returned from [`Backend::create_table`].\n\npub type CreateTableFuture<'a, E> = PinBoxFuture<'a, Result<(), E>>;\n\n\n","file_path":"starchart/src/backend/futures.rs","rank":64,"score":15.612136451415608},{"content":"use std::{\n\n\terror::Error,\n\n\tfmt::{Debug, Display, Formatter, Result as FmtResult},\n\n};\n\n\n\n/// A general [`Action`] error.\n\n///\n\n/// [`Action`]: super::Action\n\n#[derive(Debug)]\n\npub struct ActionError {\n\n\tsource: Option<Box<dyn Error + Send + Sync>>,\n\n\tkind: ActionErrorType,\n\n}\n\n\n\nimpl ActionError {\n\n\t/// Immutable reference to the type of error that occurred.\n\n\t#[must_use = \"retrieving the type has no effect if left unused\"]\n\n\tpub const fn kind(&self) -> &ActionErrorType {\n\n\t\t&self.kind\n\n\t}\n","file_path":"starchart/src/action/error.rs","rank":65,"score":15.557465292574207},{"content":"\t///\n\n\t/// [`bincode`]: serde_bincode\n\n\tpub const fn bincode() -> Self {\n\n\t\tSelf::new(BinaryFormat::Bincode)\n\n\t}\n\n\n\n\t/// Creates a [`BinaryTranscoder`] using [`Cbor`] formatting.\n\n\t///\n\n\t/// [`Cbor`]: serde_cbor\n\n\tpub const fn cbor() -> Self {\n\n\t\tSelf::new(BinaryFormat::Cbor)\n\n\t}\n\n\n\n\t/// Checks whether the transcoder uses the [`Bincode`] format.\n\n\t///\n\n\t/// [`Bincode`]: serde_bincode\n\n\t#[must_use]\n\n\tpub const fn is_bincode(self) -> bool {\n\n\t\tmatches!(self.format(), BinaryFormat::Bincode)\n\n\t}\n","file_path":"starchart-backends/src/fs/binary.rs","rank":66,"score":15.448692440041453},{"content":"}\n\n\n\n/// A transcoder for multiple binary formats.\n\n#[derive(Debug, Clone, Copy)]\n\n#[cfg(feature = \"binary\")]\n\n#[must_use = \"transcoders do nothing by themselves\"]\n\npub struct BinaryTranscoder(BinaryFormat);\n\n\n\nimpl BinaryTranscoder {\n\n\t/// Creates a new [`BinaryTranscoder`].\n\n\tpub const fn new(format: BinaryFormat) -> Self {\n\n\t\tSelf(format)\n\n\t}\n\n\n\n\t/// Returns the binary format being used by the transcoder.\n\n\tpub const fn format(self) -> BinaryFormat {\n\n\t\tself.0\n\n\t}\n\n\n\n\t/// Creates a [`BinaryTranscoder`] using [`bincode`] formatting.\n","file_path":"starchart-backends/src/fs/binary.rs","rank":67,"score":15.24095785723847},{"content":"//! The backend that fetches and provides data for the [`Starchart`].\n\n//!\n\n//! [`Starchart`]: crate::Starchart\n\n\n\nuse std::{error::Error as StdError, iter::FromIterator};\n\n\n\nuse futures_util::{\n\n\tfuture::{join_all, ok, ready},\n\n\tFutureExt,\n\n};\n\n\n\nuse self::futures::{\n\n\tCreateFuture, CreateTableFuture, DeleteFuture, DeleteTableFuture, EnsureFuture,\n\n\tEnsureTableFuture, GetAllFuture, GetFuture, GetKeysFuture, HasFuture, HasTableFuture,\n\n\tInitFuture, ShutdownFuture, UpdateFuture,\n\n};\n\nuse crate::Entry;\n\n\n\npub mod futures;\n\n\n\n/// The backend to be used to manage data.\n","file_path":"starchart/src/backend/mod.rs","rank":68,"score":15.003841397758192},{"content":"\tpub fn validate_data(&self) -> Result<(), ActionValidationError> {\n\n\t\tif self.data.is_none() {\n\n\t\t\treturn Err(ActionValidationError {\n\n\t\t\t\tsource: None,\n\n\t\t\t\tkind: ActionValidationErrorType::Data,\n\n\t\t\t});\n\n\t\t}\n\n\n\n\t\tOk(())\n\n\t}\n\n\n\n\t/// Validates that both the key and data have been set.\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This errors if both the [`Self::set_key`] and [`Self::set_data`] (or [`Self::set_entry`]) has not been called.\n\n\tpub fn validate_entry(&self) -> Result<(), ActionValidationError> {\n\n\t\tself.validate_key()?;\n\n\t\tself.validate_data()\n\n\t}\n","file_path":"starchart/src/action/dynamic.rs","rank":69,"score":14.795042834159032},{"content":"// Action run impls\n\n\n\nimpl<'a, S: Entry> CreateEntryAction<'a, S> {\n\n\t/// Validates and runs a [`CreateEntryAction`].\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_entry`] fails, or if any of the [`Backend`] methods fail.\n\n\tpub fn run_create_entry<B: Backend>(\n\n\t\tself,\n\n\t\tchart: &'a Starchart<B>,\n\n\t) -> impl Future<Output = Result<(), ActionError>> + 'a {\n\n\t\tself.inner.create_entry(chart)\n\n\t}\n\n}\n\n\n\nimpl<'a, S: Entry> ReadEntryAction<'a, S> {\n\n\t/// Validates and runs a [`ReadEntryAction`].\n\n\t///\n\n\t/// # Errors\n","file_path":"starchart/src/action/mod.rs","rank":70,"score":14.748228490772881},{"content":"\tDeserialization,\n\n}\n\n\n\n/// A memory-based backend, uses a [`DashMap`] of [`Value`]s\n\n/// to represent data.\n\n#[cfg(feature = \"memory\")]\n\n#[must_use = \"a memory backend does nothing on it's own\"]\n\npub struct MemoryBackend<S = RandomState> {\n\n\ttables: DashMap<String, DashMap<String, Value, S>, S>,\n\n}\n\n\n\nimpl MemoryBackend<RandomState> {\n\n\t/// Creates a new [`MemoryBackend`].\n\n\tpub fn new() -> Self {\n\n\t\tSelf::with_capacity_and_hasher(0, RandomState::default())\n\n\t}\n\n\n\n\t/// Creates a new [`MemoryBackend`] with the specified capacity.\n\n\tpub fn with_capacity(cap: usize) -> Self {\n\n\t\tSelf::with_capacity_and_hasher(cap, RandomState::default())\n","file_path":"starchart-backends/src/memory.rs","rank":71,"score":14.739977676582152},{"content":"\tbackend::{\n\n\t\tfutures::{\n\n\t\t\tCreateFuture, CreateTableFuture, DeleteFuture, DeleteTableFuture, GetFuture,\n\n\t\t\tGetKeysFuture, HasFuture, HasTableFuture, InitFuture, UpdateFuture,\n\n\t\t},\n\n\t\tBackend,\n\n\t},\n\n\tEntry,\n\n};\n\nuse tokio::fs;\n\n\n\npub use self::error::{FsError, FsErrorType};\n\n\n\n/// An fs-based backend for the starchart crate.\n\n#[derive(Debug, Clone)]\n\n#[cfg(feature = \"fs\")]\n\npub struct FsBackend<T> {\n\n\ttranscoder: T,\n\n\textension: String,\n\n\tbase_directory: PathBuf,\n","file_path":"starchart-backends/src/fs/mod.rs","rank":72,"score":14.640822520243477},{"content":"\n\nimpl Transcoder for JsonTranscoder {\n\n\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\n\n\t\tif self.is_pretty() {\n\n\t\t\tOk(serde_json::to_vec_pretty(value)?)\n\n\t\t} else {\n\n\t\t\tOk(serde_json::to_vec(value)?)\n\n\t\t}\n\n\t}\n\n\n\n\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError> {\n\n\t\tOk(serde_json::from_reader(rdr)?)\n\n\t}\n\n}\n\n\n\n#[cfg(all(test, not(miri)))]\n\nmod tests {\n\n\tuse std::{fmt::Debug, fs};\n\n\n\n\tuse starchart::backend::Backend;\n","file_path":"starchart-backends/src/fs/json.rs","rank":73,"score":14.591349146918143},{"content":"use futures_util::future::ok;\n\nuse futures_util::Future;\n\n\n\n#[doc(hidden)]\n\npub use self::error::{\n\n\tActionError, ActionErrorType, ActionRunError, ActionRunErrorType, ActionValidationError,\n\n\tActionValidationErrorType,\n\n};\n\npub use self::{\n\n\tdynamic::DynamicAction,\n\n\tkind::ActionKind,\n\n\tr#impl::{\n\n\t\tCreateOperation, CrudOperation, DeleteOperation, EntryTarget, OperationTarget,\n\n\t\tReadOperation, TableTarget, UpdateOperation,\n\n\t},\n\n\tresult::ActionResult,\n\n\ttarget::TargetKind,\n\n};\n\n#[cfg(feature = \"metadata\")]\n\nuse crate::METADATA_KEY;\n","file_path":"starchart/src/action/mod.rs","rank":74,"score":14.584662827057983},{"content":"\t) -> GetAllFuture<'a, I, Self::Error>\n\n\twhere\n\n\t\tD: Entry,\n\n\t\tI: FromIterator<D>,\n\n\t{\n\n\t\tasync move {\n\n\t\t\tself.tables.get(table).map_or_else(\n\n\t\t\t\t|| Ok(None.into_iter().collect::<I>()),\n\n\t\t\t\t|table| {\n\n\t\t\t\t\ttable\n\n\t\t\t\t\t\t.clone()\n\n\t\t\t\t\t\t.into_iter()\n\n\t\t\t\t\t\t.filter_map(|(key, value)| {\n\n\t\t\t\t\t\t\tif entries.contains(&key.as_str()) {\n\n\t\t\t\t\t\t\t\tSome(value.deserialize_into().map_err(MemoryError::from))\n\n\t\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\t\tNone\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t})\n\n\t\t\t\t\t\t.collect::<Result<I, Self::Error>>()\n","file_path":"starchart-backends/src/memory.rs","rank":75,"score":14.375735306560697},{"content":"/// [`CRUD`]: https://en.wikipedia.org/wiki/Create,_read,_update_and_delete\n\n/// [`Starchart`]: crate::Starchart\n\n#[derive(Clone)]\n\n#[must_use = \"an action alone has no side effects\"]\n\npub struct Action<'a, S, C, T> {\n\n\tpub(crate) inner: InnerAction<'a, S>,\n\n\tkind: PhantomData<C>,\n\n\ttarget: PhantomData<T>,\n\n}\n\n\n\nimpl<'a, S, C, T> Action<'a, S, C, T> {\n\n\t/// Creates a new [`Action`] with the specified operation.\n\n\tpub const fn new() -> Self {\n\n\t\tSelf {\n\n\t\t\tinner: InnerAction::new(),\n\n\t\t\tkind: PhantomData,\n\n\t\t\ttarget: PhantomData,\n\n\t\t}\n\n\t}\n\n\n","file_path":"starchart/src/action/mod.rs","rank":76,"score":14.358287561034551},{"content":"\tutil::InnerUnwrap,\n\n\tAction, Entry, IndexEntry, Key, Starchart,\n\n};\n\n\n\n/// A dynamic [`Action`] for when certain parameters aren't known until runtime.\n\n#[derive(Clone)]\n\n#[must_use = \"an action alone has no side effects\"]\n\npub struct DynamicAction<S: ?Sized> {\n\n\tpub(super) key: Option<String>,\n\n\tpub(super) data: Option<Box<S>>,\n\n\tpub(super) table: Option<String>,\n\n\tpub(super) kind: ActionKind,\n\n\tpub(super) target: TargetKind,\n\n}\n\n\n\nimpl<S: ?Sized> DynamicAction<S> {\n\n\t/// Creates a new action of the specified type and target.\n\n\tpub const fn new(kind: ActionKind, target: TargetKind) -> Self {\n\n\t\tSelf {\n\n\t\t\tkey: None,\n","file_path":"starchart/src/action/dynamic.rs","rank":77,"score":14.297953668048269},{"content":"\t\tExclusiveGuard(inner)\n\n\t}\n\n}\n\n\n\nimpl Default for Guard {\n\n\tfn default() -> Self {\n\n\t\tSelf::new()\n\n\t}\n\n}\n\n\n\n// implementing send doesn't matter bc we're not actually editing the value, just using it for a locking mechanism\n\npub struct SharedGuard<'a>(RwLockReadGuard<'a, ()>);\n\n\n\nunsafe impl<'a> Send for SharedGuard<'a> {}\n\n\n\npub struct ExclusiveGuard<'a>(RwLockWriteGuard<'a, ()>);\n\n\n\nunsafe impl<'a> Send for ExclusiveGuard<'a> {}\n","file_path":"starchart/src/atomics.rs","rank":78,"score":13.924707479902402},{"content":"\t#[cfg(feature = \"json\")]\n\n\tpub use super::json::JsonTranscoder;\n\n\t#[cfg(feature = \"toml\")]\n\n\tpub use super::toml::TomlTranscoder;\n\n\t#[cfg(feature = \"yaml\")]\n\n\tpub use super::yaml::YamlTranscoder;\n\n\n\n\t/// Transcoder formats for supported transcoders to use.\n\n\t#[cfg(any(feature = \"toml\", feature = \"json\"))]\n\n\t#[derive(Debug, Clone, Copy, PartialEq, Eq)]\n\n\tpub enum TranscoderFormat {\n\n\t\t/// Standard formatting, this is the default.\n\n\t\tStandard,\n\n\t\t/// Prettier formatting, this uses more file space but is also more human-readable.\n\n\t\tPretty,\n\n\t}\n\n\n\n\t#[cfg(any(feature = \"toml\", feature = \"json\"))]\n\n\timpl Default for TranscoderFormat {\n\n\t\tfn default() -> Self {\n","file_path":"starchart-backends/src/fs/mod.rs","rank":79,"score":13.728626554711312},{"content":"\tfn get<'a, D>(&'a self, table: &'a str, id: &'a str) -> GetFuture<'a, D, Self::Error>\n\n\twhere\n\n\t\tD: Entry;\n\n\n\n\t/// Checks if an entry exists in a table.\n\n\tfn has<'a>(&'a self, table: &'a str, id: &'a str) -> HasFuture<'a, Self::Error>;\n\n\n\n\t/// Inserts a new entry into a table.\n\n\tfn create<'a, S>(\n\n\t\t&'a self,\n\n\t\ttable: &'a str,\n\n\t\tid: &'a str,\n\n\t\tvalue: &'a S,\n\n\t) -> CreateFuture<'a, Self::Error>\n\n\twhere\n\n\t\tS: Entry;\n\n\n\n\t/// Ensures a value exists in the table.\n\n\tfn ensure<'a, S>(\n\n\t\t&'a self,\n","file_path":"starchart/src/backend/mod.rs","rank":80,"score":13.636826747675746},{"content":"\t}\n\n}\n\n\n\n#[cfg(all(test, not(miri)))]\n\nmod tests {\n\n\tuse std::fmt::Debug;\n\n\n\n\tuse fxhash::FxBuildHasher;\n\n\tuse starchart::backend::Backend;\n\n\tuse static_assertions::assert_impl_all;\n\n\n\n\tuse super::{MemoryBackend, MemoryError};\n\n\tuse crate::testing::TestSettings;\n\n\n\n\tassert_impl_all!(MemoryBackend: Backend, Clone, Debug, Default, Send, Sync);\n\n\n\n\t#[tokio::test]\n\n\tasync fn table_methods() -> Result<(), MemoryError> {\n\n\t\tlet backend = MemoryBackend::with_hasher(FxBuildHasher::default());\n\n\n","file_path":"starchart-backends/src/memory.rs","rank":81,"score":13.535281686954235},{"content":"use std::io::Read;\n\n\n\nuse starchart::Entry;\n\n\n\nuse super::{FsError, Transcoder};\n\n\n\n/// Format types for the [`BinaryTranscoder`].\n\n#[derive(Debug, Clone, Copy)]\n\n#[cfg(feature = \"binary\")]\n\n#[non_exhaustive]\n\n#[must_use = \"binary formats do nothing on their own\"]\n\npub enum BinaryFormat {\n\n\t/// The [`Bincode`] format.\n\n\t///\n\n\t/// [`Bincode`]: serde_bincode\n\n\tBincode,\n\n\t/// The [`CBOR`] format.\n\n\t///\n\n\t/// [`CBOR`]: serde_cbor\n\n\tCbor,\n","file_path":"starchart-backends/src/fs/binary.rs","rank":82,"score":13.274595364509688},{"content":"\t\t}\n\n\t\tOk(Action {\n\n\t\t\tinner: InnerAction {\n\n\t\t\t\tdata: self.data.as_deref(),\n\n\t\t\t\tkey: self.key.clone(),\n\n\t\t\t\ttable: self.table.as_deref(),\n\n\t\t\t},\n\n\t\t\tkind: PhantomData,\n\n\t\t\ttarget: PhantomData,\n\n\t\t})\n\n\t}\n\n}\n\n\n\nimpl<S: IndexEntry + ?Sized> DynamicAction<S> {\n\n\t/// Sets both a key and a value to run the action with.\n\n\tpub fn set_entry(&mut self, entry: S) -> &mut Self {\n\n\t\tself.set_key(entry.key()).set_entry(entry)\n\n\t}\n\n}\n\n\n","file_path":"starchart/src/action/dynamic.rs","rank":83,"score":13.154708706294734},{"content":"\t\ttable: &'a str,\n\n\t\tid: &'a str,\n\n\t\tvalue: &'a S,\n\n\t) -> UpdateFuture<'a, Self::Error>\n\n\twhere\n\n\t\tS: Entry;\n\n\n\n\t/// Deletes an entry from a table.\n\n\tfn delete<'a>(&'a self, table: &'a str, id: &'a str) -> DeleteFuture<'a, Self::Error>;\n\n}\n","file_path":"starchart/src/backend/mod.rs","rank":84,"score":13.131053647262899},{"content":"\n\nimpl Transcoder for TomlTranscoder {\n\n\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\n\n\t\tif self.is_pretty() {\n\n\t\t\tOk(serde_toml::to_string_pretty(value).map(String::into_bytes)?)\n\n\t\t} else {\n\n\t\t\tOk(serde_toml::to_vec(value)?)\n\n\t\t}\n\n\t}\n\n\n\n\tfn deserialize_data<T: Entry, R: Read>(&self, mut rdr: R) -> Result<T, FsError> {\n\n\t\tlet mut output = String::new();\n\n\t\trdr.read_to_string(&mut output)?;\n\n\t\tOk(serde_toml::from_str(&output)?)\n\n\t}\n\n}\n\n\n\n#[cfg(all(test, not(miri)))]\n\nmod tests {\n\n\tuse std::{fmt::Debug, fs};\n","file_path":"starchart-backends/src/fs/toml.rs","rank":85,"score":12.983974807634631},{"content":"\t\t\t\tstat.run_update_entry(chart).await?;\n\n\t\t\t\tOk(ActionResult::Update)\n\n\t\t\t}\n\n\t\t\t(ActionKind::Delete, TargetKind::Entry) => {\n\n\t\t\t\tlet stat = self.as_static::<DeleteOperation, EntryTarget>()?;\n\n\t\t\t\tlet ret = stat.run_delete_entry(chart).await?;\n\n\t\t\t\tOk(ActionResult::Delete(ret))\n\n\t\t\t}\n\n\t\t\t(ActionKind::Create, TargetKind::Table) => {\n\n\t\t\t\tlet stat = self.as_static::<CreateOperation, TableTarget>()?;\n\n\t\t\t\tstat.run_create_table(chart).await?;\n\n\t\t\t\tOk(ActionResult::Create)\n\n\t\t\t}\n\n\t\t\t(ActionKind::Read, TargetKind::Table) => {\n\n\t\t\t\tlet stat = self.as_static::<ReadOperation, TableTarget>()?;\n\n\t\t\t\tlet ret = stat.run_read_table(chart).await?;\n\n\t\t\t\tOk(ActionResult::MultiRead(ret))\n\n\t\t\t}\n\n\t\t\t(ActionKind::Update, TargetKind::Table) => panic!(\"updating tables is unsupported\"),\n\n\t\t\t(ActionKind::Delete, TargetKind::Table) => {\n","file_path":"starchart/src/action/dynamic.rs","rank":86,"score":12.832872923888964},{"content":"\n\n\t\tself\n\n\t}\n\n\n\n\t/// Sets the key for the action.\n\n\t///\n\n\t/// Users should prefer to call [`Self::set_entry`] over this, as setting the\n\n\t/// entry will automatically call this.\n\n\t///\n\n\t/// This is unused on [`TargetKind::Table`] actions.\n\n\tpub fn set_key<K: Key>(&mut self, key: &K) -> &mut Self {\n\n\t\tself.key.replace(key.to_key());\n\n\n\n\t\tself\n\n\t}\n\n\n\n\t/// Sets the data for the action.\n\n\t///\n\n\t/// This is unused on [`TargetKind::Table`] actions.\n\n\tpub fn set_data(&mut self, data: S) -> &mut Self {\n","file_path":"starchart/src/action/dynamic.rs","rank":87,"score":12.807186972685189},{"content":"\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This returns an error if [`Self::validate_table`] fails, or if any of the [`Backend`] methods fail.\n\n\tpub fn run_create_table<B: Backend>(\n\n\t\tself,\n\n\t\tgateway: &'a Starchart<B>,\n\n\t) -> impl Future<Output = Result<(), ActionError>> + 'a {\n\n\t\tself.inner.create_table(gateway)\n\n\t}\n\n}\n\n\n\nimpl<'a, S: Entry> ReadTableAction<'a, S> {\n\n\t/// Validates and runs a [`ReadTableAction`].\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// This returns an error if [`Self::validate_table`] fails, or if any of the [`Backend`] methods fail.\n\n\tpub fn run_read_table<B: Backend, I>(\n\n\t\tself,\n","file_path":"starchart/src/action/mod.rs","rank":88,"score":12.750109865151861},{"content":"\t\tself // coverage:ignore-line\n\n\t}\n\n\n\n\t/// Validate that the key has been set.\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// Errors if [`Self::set_key`] has not yet been called.\n\n\tpub fn validate_key(&self) -> Result<(), ActionValidationError> {\n\n\t\tself.inner.validate_key()\n\n\t}\n\n\n\n\t/// Validates that the data has been set.\n\n\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// Errors if [`Self::set_data`] has not yet been called.\n\n\tpub fn validate_data(&self) -> Result<(), ActionValidationError> {\n\n\t\tself.inner.validate_data()\n\n\t}\n","file_path":"starchart/src/action/mod.rs","rank":89,"score":12.660720974553106},{"content":"//! The action structs for CRUD operations.\n\n\n\n// TODO: Add overwrite option.\n\n\n\nmod dynamic;\n\nmod error;\n\nmod r#impl;\n\nmod kind;\n\nmod result;\n\nmod target;\n\n\n\n#[cfg(feature = \"metadata\")]\n\nuse std::any::type_name;\n\nuse std::{\n\n\tfmt::{Debug, Formatter, Result as FmtResult},\n\n\titer::FromIterator,\n\n\tmarker::PhantomData,\n\n};\n\n\n\n#[cfg(not(feature = \"metadata\"))]\n","file_path":"starchart/src/action/mod.rs","rank":90,"score":12.637438565051093},{"content":"\t\tE: Entry,\n\n\t{\n\n\t\tif let Some(table) = self.tables.get(table) {\n\n\t\t\tlet serialized = match to_value(value) {\n\n\t\t\t\tOk(v) => v,\n\n\t\t\t\tErr(e) => return err(e.into()).boxed(),\n\n\t\t\t};\n\n\n\n\t\t\ttable.insert(id.to_owned(), serialized);\n\n\t\t}\n\n\n\n\t\tok(()).boxed()\n\n\t}\n\n\n\n\tfn update<'a, E>(\n\n\t\t&'a self,\n\n\t\ttable: &'a str,\n\n\t\tid: &'a str,\n\n\t\tvalue: &'a E,\n\n\t) -> UpdateFuture<'a, Self::Error>\n","file_path":"starchart-backends/src/memory.rs","rank":91,"score":12.628961913593116},{"content":"//! The base structure to use for starchart.\n\n\n\nuse std::{ops::Deref, sync::Arc};\n\n\n\nuse futures_executor::block_on;\n\n\n\nuse crate::{atomics::Guard, backend::Backend};\n\n\n\n/// The base structure for managing data.\n\n///\n\n/// The inner data is wrapped in an [`Arc`], so cloning\n\n/// is cheap and will allow multiple accesses to the data.\n\n#[derive(Debug, Default)]\n\npub struct Starchart<B: Backend> {\n\n\tbackend: Arc<B>,\n\n\tpub(crate) guard: Arc<Guard>,\n\n}\n\n\n\nimpl<B: Backend> Starchart<B> {\n\n\t/// Creates a new [`Starchart`], and initializes the [`Backend`].\n","file_path":"starchart/src/starchart.rs","rank":92,"score":12.610540743277756},{"content":"\t#[allow(clippy::inline_always)]\n\n\t#[inline(always)]\n\n\t#[track_caller]\n\n\tunsafe fn inner_unwrap(self) -> T {\n\n\t\tself.unwrap_unchecked()\n\n\t}\n\n}\n\n\n\n#[cfg(not(has_unwrap_unchecked))]\n\nunsafe impl<T, E> InnerUnwrap<T> for Result<T, E> {\n\n\t#[inline]\n\n\t#[track_caller]\n\n\tunsafe fn inner_unwrap(self) -> T {\n\n\t\tdebug_assert!(self.is_ok());\n\n\t\tif let Ok(v) = self {\n\n\t\t\tv\n\n\t\t} else {\n\n\t\t\tunreachable_unchecked()\n\n\t\t}\n\n\t}\n","file_path":"starchart/src/util.rs","rank":93,"score":12.56413301107484},{"content":"\n\n\t\tlet serialized = match self.transcoder().serialize_value(value) {\n\n\t\t\tOk(v) => v,\n\n\t\t\tErr(e) => return err(e).boxed(),\n\n\t\t};\n\n\n\n\t\tfs::write(path, serialized)\n\n\t\t\t.map(|res| res.map_err(Into::into))\n\n\t\t\t.boxed()\n\n\t}\n\n\n\n\tfn update<'a, S>(\n\n\t\t&'a self,\n\n\t\ttable: &'a str,\n\n\t\tid: &'a str,\n\n\t\tvalue: &'a S,\n\n\t) -> UpdateFuture<'a, Self::Error>\n\n\twhere\n\n\t\tS: Entry,\n\n\t{\n","file_path":"starchart-backends/src/fs/mod.rs","rank":94,"score":12.528373161347671},{"content":"\t///\n\n\t/// # Errors\n\n\t///\n\n\t/// Any errors that [`Backend::init`] can raise.\n\n\tpub async fn new(backend: B) -> Result<Self, B::Error> {\n\n\t\tbackend.init().await?;\n\n\t\tOk(Self {\n\n\t\t\tbackend: Arc::new(backend),\n\n\t\t\tguard: Arc::default(),\n\n\t\t})\n\n\t}\n\n}\n\n\n\nimpl<B: Backend> Clone for Starchart<B> {\n\n\tfn clone(&self) -> Self {\n\n\t\tSelf {\n\n\t\t\tbackend: self.backend.clone(),\n\n\t\t\tguard: self.guard.clone(),\n\n\t\t}\n\n\t}\n","file_path":"starchart/src/starchart.rs","rank":95,"score":12.48173500974048},{"content":"\t\tassert_eq!(\n\n\t\t\tbackend.get::<TestSettings>(\"table\", \"1\").await?,\n\n\t\t\tSome(settings)\n\n\t\t);\n\n\n\n\t\tbackend.delete(\"table\", \"1\").await?;\n\n\n\n\t\tassert_eq!(backend.get::<TestSettings>(\"table\", \"1\").await?, None);\n\n\n\n\t\tOk(())\n\n\t}\n\n\n\n\t#[tokio::test]\n\n\tasync fn update_and_delete_pretty() -> Result<(), FsError> {\n\n\t\tlet _lock = TEST_GUARD.lock().await;\n\n\t\tlet path = TestPath::new(\"update_and_delete_pretty\", \"toml\");\n\n\t\tlet backend = FsBackend::new(TomlTranscoder::pretty(), \"toml\".to_owned(), &path)?;\n\n\n\n\t\tbackend.init().await?;\n\n\t\tbackend.create_table(\"table\").await?;\n","file_path":"starchart-backends/src/fs/toml.rs","rank":96,"score":12.462576637271471},{"content":"// Entry helpers\n\nimpl<'a, S: Entry, C: CrudOperation> Action<'a, S, C, EntryTarget> {\n\n\t/// Sets the key for the action.\n\n\t///\n\n\t/// Users should prefer to call [`Self::set_entry`] over this, as setting the\n\n\t/// entry will automatically call this.\n\n\t///\n\n\t/// This is unused on [`TargetKind::Table`] actions.\n\n\tpub fn set_key<K: Key>(&mut self, key: &K) -> &mut Self {\n\n\t\tself.inner.key.replace(key.to_key());\n\n\n\n\t\tself // coverage:ignore-line\n\n\t}\n\n\n\n\t/// Sets the data for the action.\n\n\t///\n\n\t/// This is unused on [`TargetKind::Table`] actions.\n\n\tpub fn set_data(&mut self, entity: &'a S) -> &mut Self {\n\n\t\tself.inner.data.replace(entity);\n\n\n","file_path":"starchart/src/action/mod.rs","rank":97,"score":12.456296216708289},{"content":"\t\tasync move {\n\n\t\t\tif !self.has_table(table).await? {\n\n\t\t\t\tself.create_table(table).await?;\n\n\t\t\t}\n\n\n\n\t\t\tOk(())\n\n\t\t}\n\n\t\t.boxed()\n\n\t}\n\n\n\n\t/// Gets all entries that match a predicate, to get all entries, use [`get_keys`] first.\n\n\t///\n\n\t/// [`get_keys`]: Self::get_keys\n\n\tfn get_all<'a, D, I>(\n\n\t\t&'a self,\n\n\t\ttable: &'a str,\n\n\t\tentries: &'a [&'a str],\n\n\t) -> GetAllFuture<'a, I, Self::Error>\n\n\twhere\n\n\t\tD: Entry,\n","file_path":"starchart/src/backend/mod.rs","rank":98,"score":12.11439557556566},{"content":"\n\n\t#[tokio::test]\n\n\tasync fn update_and_delete() -> Result<(), FsError> {\n\n\t\tlet _lock = TEST_GUARD.lock().await;\n\n\t\tlet path = TestPath::new(\"update_and_delete\", \"json\");\n\n\t\tlet backend = FsBackend::new(JsonTranscoder::default(), \"json\".to_owned(), &path)?;\n\n\n\n\t\tbackend.init().await?;\n\n\t\tbackend.create_table(\"table\").await?;\n\n\n\n\t\tlet mut settings = TestSettings::default();\n\n\n\n\t\tbackend.create(\"table\", \"1\", &settings).await?;\n\n\n\n\t\tsettings.opt = None;\n\n\n\n\t\tbackend.update(\"table\", \"1\", &settings).await?;\n\n\n\n\t\tassert_eq!(\n\n\t\t\tbackend.get::<TestSettings>(\"table\", \"1\").await?,\n","file_path":"starchart-backends/src/fs/json.rs","rank":99,"score":11.959151527498515}],"string":"[\n {\n \"content\": \"#[cfg(not(feature = \\\"metadata\\\"))]\\n\\npub fn is_metadata(_: &str) -> bool {\\n\\n\\tfalse\\n\\n}\\n\\n\\n\\npub unsafe trait InnerUnwrap<T> {\\n\\n\\tunsafe fn inner_unwrap(self) -> T;\\n\\n}\\n\\n\\n\\n#[cfg(not(has_unwrap_unchecked))]\\n\\nunsafe impl<T> InnerUnwrap<T> for Option<T> {\\n\\n\\t#[inline]\\n\\n\\t#[track_caller]\\n\\n\\tunsafe fn inner_unwrap(self) -> T {\\n\\n\\t\\tdebug_assert!(self.is_some());\\n\\n\\t\\tself.map_or_else(|| unreachable_unchecked(), |v| v)\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(has_unwrap_unchecked)]\\n\\nunsafe impl<T> InnerUnwrap<T> for Option<T> {\\n\",\n \"file_path\": \"starchart/src/util.rs\",\n \"rank\": 0,\n \"score\": 122014.81896596614\n },\n {\n \"content\": \"#[cfg(feature = \\\"metadata\\\")]\\n\\npub fn is_metadata(key: &str) -> bool {\\n\\n\\tkey == crate::METADATA_KEY\\n\\n}\\n\\n\\n\",\n \"file_path\": \"starchart/src/util.rs\",\n \"rank\": 1,\n \"score\": 119027.09812816109\n },\n {\n \"content\": \"/// A marker trait for use within the [`Starchart`].\\n\\n///\\n\\n/// This signifies that the type can be stored within a [`Starchart`].\\n\\n///\\n\\n/// [`Starchart`]: crate::Starchart\\n\\npub trait Entry: Clone + Serialize + DeserializeOwned + Debug + Default + Send + Sync {}\\n\\n\\n\\nimpl<T: Clone + Serialize + DeserializeOwned + Debug + Default + Send + Sync> Entry for T {}\\n\\n\\n\",\n \"file_path\": \"starchart/src/entry.rs\",\n \"rank\": 2,\n \"score\": 99746.55154388733\n },\n {\n \"content\": \"/// An indexable entry, used for any [`Entry`] that can be indexed by a [`Key`] that it owns.\\n\\npub trait IndexEntry: Entry {\\n\\n\\t/// The [`Key`] type to index by.\\n\\n\\ttype Key: Key;\\n\\n\\n\\n\\t/// Returns the valid key for the database to index from.\\n\\n\\tfn key(&self) -> &Self::Key;\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\tuse std::fmt::{Debug, Display, Formatter, Result as FmtResult};\\n\\n\\n\\n\\tuse serde::{de::DeserializeOwned, Deserialize, Serialize};\\n\\n\\tuse static_assertions::assert_impl_all;\\n\\n\\n\\n\\tuse super::{Entry, Key};\\n\\n\\n\\n\\t#[derive(Debug, Default, Clone, PartialEq, Serialize, Deserialize)]\\n\\n\\tstruct Settings {\\n\\n\\t\\tid: u32,\\n\",\n \"file_path\": \"starchart/src/entry.rs\",\n \"rank\": 3,\n \"score\": 83316.42971696638\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error + 'static>> {\\n\\n\\tlet ac = AutoCfg::new()?;\\n\\n\\tlet version_data = version_meta()?;\\n\\n\\tif let Channel::Nightly = version_data.channel {\\n\\n\\t\\tif ac.probe_rustc_version(1, 57) {\\n\\n\\t\\t\\temit(\\\"docsrs\\\");\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tif ac.probe_expression(\\\"std::result::Result::<(), ()>::unwrap_unchecked\\\")\\n\\n\\t\\t&& ac.probe_expression(\\\"std::option::Option::<()>::unwrap_unchecked\\\")\\n\\n\\t{\\n\\n\\t\\temit(\\\"has_unwrap_unchecked\\\");\\n\\n\\t}\\n\\n\\n\\n\\tOk(())\\n\\n}\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 4,\n \"score\": 80366.3482552683\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error + 'static>> {\\n\\n\\tlet ac = AutoCfg::new()?;\\n\\n\\tlet version_data = version_meta()?;\\n\\n\\tif let Channel::Nightly = version_data.channel {\\n\\n\\t\\tif ac.probe_rustc_version(1, 57) {\\n\\n\\t\\t\\temit(\\\"docsrs\\\");\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tif ac.probe_expression(\\\"std::result::Result::<(), ()>::unwrap_unchecked\\\")\\n\\n\\t\\t&& ac.probe_expression(\\\"std::option::Option::<()>::unwrap_unchecked\\\")\\n\\n\\t{\\n\\n\\t\\temit(\\\"has_unwrap_unchecked\\\");\\n\\n\\t}\\n\\n\\n\\n\\tOk(())\\n\\n}\\n\",\n \"file_path\": \"starchart/build.rs\",\n \"rank\": 5,\n \"score\": 78383.28780022784\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error + 'static>> {\\n\\n\\tlet ac = AutoCfg::new()?;\\n\\n\\tlet version_data = version_meta()?;\\n\\n\\tif let Channel::Nightly = version_data.channel {\\n\\n\\t\\tif ac.probe_rustc_version(1, 57) {\\n\\n\\t\\t\\temit(\\\"docsrs\\\");\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tif ac.probe_expression(\\\"std::result::Result::<(), ()>::unwrap_unchecked\\\")\\n\\n\\t\\t&& ac.probe_expression(\\\"std::option::Option::<()>::unwrap_unchecked\\\")\\n\\n\\t{\\n\\n\\t\\temit(\\\"has_unwrap_unchecked\\\");\\n\\n\\t}\\n\\n\\n\\n\\tOk(())\\n\\n}\\n\",\n \"file_path\": \"starchart-backends/build.rs\",\n \"rank\": 6,\n \"score\": 76532.403023812\n },\n {\n \"content\": \"/// The key trait to be implemented on [`Entry`] to allow an easy way to get keys.\\n\\npub trait Key {\\n\\n\\t/// The method to transform a [`Key`] into a value.\\n\\n\\tfn to_key(&self) -> String;\\n\\n}\\n\\n\\n\\nimpl<T: ToString> Key for T {\\n\\n\\tfn to_key(&self) -> String {\\n\\n\\t\\tself.to_string()\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"starchart/src/entry.rs\",\n \"rank\": 7,\n \"score\": 75279.33754320188\n },\n {\n \"content\": \"fn parse(input: &DeriveInput) -> Result<TokenStream> {\\n\\n\\tlet ident = input.ident.clone();\\n\\n\\n\\n\\tlet data = match &input.data {\\n\\n\\t\\tData::Struct(st) => st,\\n\\n\\t\\t_ => {\\n\\n\\t\\t\\treturn Err(Error::new_spanned(\\n\\n\\t\\t\\t\\t&input,\\n\\n\\t\\t\\t\\t\\\"IndexEntry can only be derived on structs\\\",\\n\\n\\t\\t\\t))\\n\\n\\t\\t}\\n\\n\\t};\\n\\n\\n\\n\\tlet named_fields = match data.fields {\\n\\n\\t\\tFields::Named(ref named) => &named.named,\\n\\n\\t\\t_ => {\\n\\n\\t\\t\\treturn Err(Error::new_spanned(\\n\\n\\t\\t\\t\\t&data.fields,\\n\\n\\t\\t\\t\\t\\\"IndexEntry can only be derived on a struct with named fields\\\",\\n\\n\\t\\t\\t))\\n\",\n \"file_path\": \"starchart-derive/src/lib.rs\",\n \"rank\": 8,\n \"score\": 74750.69951602965\n },\n {\n \"content\": \"#[proc_macro_derive(IndexEntry, attributes(key))]\\n\\npub fn derive_entity(input: proc_macro::TokenStream) -> proc_macro::TokenStream {\\n\\n\\tlet input = parse_macro_input!(input as DeriveInput);\\n\\n\\tparse(&input)\\n\\n\\t\\t.unwrap_or_else(|err| err.to_compile_error())\\n\\n\\t\\t.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"starchart-derive/src/lib.rs\",\n \"rank\": 9,\n \"score\": 62996.85605334873\n },\n {\n \"content\": \"#[derive(Deserialize)]\\n\\n#[serde(field_identifier, rename_all = \\\"lowercase\\\")]\\n\\nenum ActionField {\\n\\n\\tType,\\n\\n\\tTarget,\\n\\n\\tTable,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 10,\n \"score\": 48856.67073727489\n },\n {\n \"content\": \"\\tpub trait Sealed {}\\n\\n\\n\\n\\timpl Sealed for CreateOperation {}\\n\\n\\timpl Sealed for ReadOperation {}\\n\\n\\timpl Sealed for UpdateOperation {}\\n\\n\\timpl Sealed for DeleteOperation {}\\n\\n\\timpl Sealed for TableTarget {}\\n\\n\\timpl Sealed for EntryTarget {}\\n\\n\\timpl<'a, S: Entry, C: CrudOperation, T: OperationTarget> Sealed for Action<'a, S, C, T> {}\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\tuse std::fmt::Debug;\\n\\n\\n\\n\\tuse serde::{Deserialize, Serialize};\\n\\n\\tuse static_assertions::assert_impl_all;\\n\\n\\n\\n\\tuse super::{\\n\\n\\t\\tCreateOperation, DeleteOperation, EntryTarget, ReadOperation, TableTarget, UpdateOperation,\\n\",\n \"file_path\": \"starchart/src/action/impl.rs\",\n \"rank\": 11,\n \"score\": 42995.71140630776\n },\n {\n \"content\": \"/// The backend to be used to manage data.\\n\\npub trait Backend: Send + Sync {\\n\\n\\t/// The [`Error`] type that the backend will report up.\\n\\n\\t///\\n\\n\\t/// [`Error`]: std::error::Error\\n\\n\\ttype Error: Send + Sync + StdError + 'static;\\n\\n\\n\\n\\t/// An optional initialization function, useful for making connections to the database.\\n\\n\\t///\\n\\n\\t/// The default impl does nothing\\n\\n\\tfn init(&self) -> InitFuture<'_, Self::Error> {\\n\\n\\t\\tok(()).boxed()\\n\\n\\t}\\n\\n\\n\\n\\t/// An optional shutdown function, useful for disconnecting from databases gracefully.\\n\\n\\t///\\n\\n\\t/// The default impl does nothing\\n\\n\\t///\\n\\n\\t/// # Safety\\n\\n\\t///\\n\\n\\t/// This should not fail, as it's ran upon dropping the [`Starchart`],\\n\",\n \"file_path\": \"starchart/src/backend/mod.rs\",\n \"rank\": 12,\n \"score\": 38998.5948486214\n },\n {\n \"content\": \"/// A sealed marker trait for helping an [`Action`] represent what type of target the\\n\\n/// operation will cover.\\n\\n///\\n\\n/// [`Action`]: crate::action::Action\\n\\npub trait OperationTarget: private::Sealed {\\n\\n\\t#[doc(hidden)]\\n\\n\\tfn target() -> TargetKind;\\n\\n}\\n\\n\\n\\nimpl OperationTarget for TableTarget {\\n\\n\\tfn target() -> TargetKind {\\n\\n\\t\\tTargetKind::Table\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl OperationTarget for EntryTarget {\\n\\n\\tfn target() -> TargetKind {\\n\\n\\t\\tTargetKind::Entry\\n\\n\\t}\\n\\n}\\n\\n\\n\\nmod private {\\n\\n\\tuse super::{\\n\\n\\t\\tCreateOperation, CrudOperation, DeleteOperation, EntryTarget, OperationTarget,\\n\\n\\t\\tReadOperation, TableTarget, UpdateOperation,\\n\\n\\t};\\n\\n\\tuse crate::{Action, Entry};\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/impl.rs\",\n \"rank\": 13,\n \"score\": 38068.02154802303\n },\n {\n \"content\": \"/// A sealed marker trait for helping an [`Action`] represent what type of operation will occur.\\n\\n///\\n\\n/// [`Action`]: crate::action::Action\\n\\npub trait CrudOperation: private::Sealed {\\n\\n\\t#[doc(hidden)]\\n\\n\\tfn kind() -> ActionKind;\\n\\n}\\n\\n\\n\\nimpl CrudOperation for CreateOperation {\\n\\n\\tfn kind() -> ActionKind {\\n\\n\\t\\tActionKind::Create\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl CrudOperation for ReadOperation {\\n\\n\\tfn kind() -> ActionKind {\\n\\n\\t\\tActionKind::Read\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl CrudOperation for UpdateOperation {\\n\\n\\tfn kind() -> ActionKind {\\n\\n\\t\\tActionKind::Update\\n\",\n \"file_path\": \"starchart/src/action/impl.rs\",\n \"rank\": 14,\n \"score\": 38068.02154802303\n },\n {\n \"content\": \"#[cfg(feature = \\\"fs\\\")]\\n\\npub trait Transcoder: Send + Sync {\\n\\n\\t/// Serializes a value into a [`Vec<u8>`] for writing to a file.\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// Any errors from the transcoder should use [`FsError::serde`] to return properly.\\n\\n\\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError>;\\n\\n\\n\\n\\t/// Deserializes data into the provided type.\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// Any errors from the transcoder should use [`FsError::serde`] to return properly.\\n\\n\\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError>;\\n\\n}\\n\\n\\n\\n/// The transcoders for the [`FsBackend`].\\n\\npub mod transcoders {\\n\\n\\t#[cfg(feature = \\\"binary\\\")]\\n\\n\\tpub use super::binary::{BinaryFormat, BinaryTranscoder};\\n\",\n \"file_path\": \"starchart-backends/src/fs/mod.rs\",\n \"rank\": 15,\n \"score\": 38068.02154802303\n },\n {\n \"content\": \"fn get_id_field(fields: &[Field]) -> Option<&Field> {\\n\\n\\tfor field in fields {\\n\\n\\t\\tif field.attrs.iter().any(|attr| attr.path.is_ident(KEY_IDENT)) {\\n\\n\\t\\t\\treturn Some(field);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfor field in fields {\\n\\n\\t\\tif field\\n\\n\\t\\t\\t.ident\\n\\n\\t\\t\\t.as_ref()\\n\\n\\t\\t\\t.map_or(false, |ident| ident == KEY_IDENT || ident == ID_IDENT)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn Some(field);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tNone\\n\\n}\\n\",\n \"file_path\": \"starchart-derive/src/lib.rs\",\n \"rank\": 16,\n \"score\": 36858.102040284066\n },\n {\n \"content\": \"\\t\\tname: String,\\n\\n\\t}\\n\\n\\n\\n\\t#[derive(Debug, Clone)]\\n\\n\\tstruct Keyable {\\n\\n\\t\\tinner: String,\\n\\n\\t}\\n\\n\\n\\n\\timpl Display for Keyable {\\n\\n\\t\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\\n\\t\\t\\tDisplay::fmt(&self.inner, f)\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tassert_impl_all!(\\n\\n\\t\\tSettings: Clone,\\n\\n\\t\\tDebug,\\n\\n\\t\\tDefault,\\n\\n\\t\\tDeserializeOwned,\\n\\n\\t\\tEntry,\\n\",\n \"file_path\": \"starchart/src/entry.rs\",\n \"rank\": 17,\n \"score\": 33743.512629720426\n },\n {\n \"content\": \"use std::fmt::Debug;\\n\\n\\n\\nuse serde::{de::DeserializeOwned, Serialize};\\n\\n\\n\\n/// The key trait to be implemented on [`Entry`] to allow an easy way to get keys.\\n\",\n \"file_path\": \"starchart/src/entry.rs\",\n \"rank\": 18,\n \"score\": 33735.17439405328\n },\n {\n \"content\": \"\\t\\tSerialize\\n\\n\\t);\\n\\n\\n\\n\\t#[test]\\n\\n\\tfn to_key() {\\n\\n\\t\\tlet keyable = Keyable {\\n\\n\\t\\t\\tinner: \\\"12345\\\".to_owned(),\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tassert_eq!(keyable.to_key(), \\\"12345\\\".to_owned());\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"starchart/src/entry.rs\",\n \"rank\": 19,\n \"score\": 33731.97629507764\n },\n {\n \"content\": \"use std::fmt::{Display, Formatter, Result as FmtResult};\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n/// The target of the [`CRUD`] operation.\\n\\n///\\n\\n/// [`CRUD`]: https://en.wikipedia.org/wiki/Create,_read,_update_and_delete\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[must_use = \\\"getting target information has no side effects\\\"]\\n\\npub enum TargetKind {\\n\\n\\t/// The operation will be performed on a table.\\n\\n\\tTable,\\n\\n\\t/// The operation will be performed on a single entry.\\n\\n\\tEntry,\\n\\n}\\n\\n\\n\\nimpl Default for TargetKind {\\n\\n\\tfn default() -> Self {\\n\\n\\t\\tSelf::Entry\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/action/target.rs\",\n \"rank\": 34,\n \"score\": 33.169399149091234\n },\n {\n \"content\": \"use std::fmt::Debug;\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\nuse super::{ActionKind, TargetKind};\\n\\n\\n\\n/// Marker type for a Create operation.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[non_exhaustive]\\n\\npub struct CreateOperation;\\n\\n\\n\\n/// Marker type for a Read operation.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[non_exhaustive]\\n\\npub struct ReadOperation;\\n\\n\\n\\n/// Marker type for an Update operation.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[non_exhaustive]\\n\\npub struct UpdateOperation;\\n\\n\\n\\n/// Marker type for a Delete operation.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[non_exhaustive]\\n\\npub struct DeleteOperation;\\n\\n\\n\\n/// A sealed marker trait for helping an [`Action`] represent what type of operation will occur.\\n\\n///\\n\\n/// [`Action`]: crate::action::Action\\n\",\n \"file_path\": \"starchart/src/action/impl.rs\",\n \"rank\": 35,\n \"score\": 26.271965066401496\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Display for TargetKind {\\n\\n\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tSelf::Table => f.write_str(\\\"Table\\\"),\\n\\n\\t\\t\\tSelf::Entry => f.write_str(\\\"Entry\\\"),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\tuse std::fmt::{Debug, Display};\\n\\n\\n\\n\\tuse serde::{Deserialize, Serialize};\\n\\n\\tuse static_assertions::assert_impl_all;\\n\\n\\n\\n\\tuse super::TargetKind;\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/target.rs\",\n \"rank\": 36,\n \"score\": 24.124290560228154\n },\n {\n \"content\": \"use std::fmt::{Display, Formatter, Result as FmtResult};\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n/// The type of [`CRUD`] action to perform\\n\\n///\\n\\n/// [`CRUD`]: https://en.wikipedia.org/wiki/Create,_read,_update_and_delete\\n\\n#[must_use = \\\"getting the information on what action will be performed has no side effects\\\"]\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]\\n\\npub enum ActionKind {\\n\\n\\t/// Signifies that the operation will be a Create.\\n\\n\\t///\\n\\n\\t/// This locks the database and allows no other reads or writes until it is complete.\\n\\n\\tCreate,\\n\\n\\t/// Signifies that the operation will be a Read.\\n\\n\\t///\\n\\n\\t/// This allows multiple different readers, but doesn't allow writing until all Reads are complete.\\n\\n\\tRead,\\n\\n\\t/// Signifies that the operation will be an Update.\\n\\n\\t///\\n\",\n \"file_path\": \"starchart/src/action/kind.rs\",\n \"rank\": 37,\n \"score\": 22.595993894568608\n },\n {\n \"content\": \"\\t}\\n\\n}\\n\\n\\n\\nimpl CrudOperation for DeleteOperation {\\n\\n\\tfn kind() -> ActionKind {\\n\\n\\t\\tActionKind::Delete\\n\\n\\t}\\n\\n}\\n\\n\\n\\n/// Marker type for a table operation.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[non_exhaustive]\\n\\npub struct TableTarget;\\n\\n\\n\\n/// Marker type for an entry operation.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]\\n\\n#[non_exhaustive]\\n\\npub struct EntryTarget;\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/impl.rs\",\n \"rank\": 38,\n \"score\": 20.267851115647456\n },\n {\n \"content\": \"//! A memory based backend. Useful for debugging or applications\\n\\n//! who only need to store data at runtime.\\n\\n\\n\\nuse std::{\\n\\n\\tcollections::hash_map::RandomState,\\n\\n\\terror::Error,\\n\\n\\tfmt::{Debug, Display, Formatter, Result as FmtResult},\\n\\n\\thash::BuildHasher,\\n\\n\\titer::FromIterator,\\n\\n};\\n\\n\\n\\nuse dashmap::DashMap;\\n\\nuse futures_util::{\\n\\n\\tfuture::{err, ok},\\n\\n\\tFutureExt,\\n\\n};\\n\\nuse serde_value::{to_value, DeserializerError, SerializerError, Value};\\n\\nuse starchart::{\\n\\n\\tbackend::{\\n\\n\\t\\tfutures::{\\n\",\n \"file_path\": \"starchart-backends/src/memory.rs\",\n \"rank\": 39,\n \"score\": 20.13701377569245\n },\n {\n \"content\": \"const METADATA_KEY: &str = \\\"__metadata__\\\";\\n\\n\\n\\nuse std::result::Result as StdResult;\\n\\n\\n\\npub mod action;\\n\\nmod atomics;\\n\\npub mod backend;\\n\\nmod entry;\\n\\npub mod error;\\n\\nmod starchart;\\n\\n#[cfg(not(tarpaulin_include))]\\n\\nmod util;\\n\\n\\n\\n#[doc(inline)]\\n\\npub use self::{\\n\\n\\taction::Action,\\n\\n\\tentry::{Entry, IndexEntry, Key},\\n\\n\\terror::Error,\\n\\n\\tstarchart::Starchart,\\n\\n};\\n\\n\\n\\n/// A type alias for a [`Result`] that wraps around [`Error`].\\n\\npub type Result<T, E = Error> = StdResult<T, E>;\\n\\n\\n\\n/// The helper derive macro for easily implementing [`IndexEntry`].\\n\\n#[cfg(feature = \\\"derive\\\")]\\n\\npub use starchart_derive::IndexEntry;\\n\",\n \"file_path\": \"starchart/src/lib.rs\",\n \"rank\": 40,\n \"score\": 19.876791114101795\n },\n {\n \"content\": \"use std::io::Read;\\n\\n\\n\\nuse starchart::Entry;\\n\\n\\n\\nuse super::{FsError, Transcoder};\\n\\n\\n\\n/// A transcoder for the YAML format.\\n\\n#[derive(Debug, Default, Clone, Copy)]\\n\\n#[cfg(feature = \\\"yaml\\\")]\\n\\n#[non_exhaustive]\\n\\n#[must_use = \\\"transcoders do nothing by themselves\\\"]\\n\\npub struct YamlTranscoder;\\n\\n\\n\\nimpl YamlTranscoder {\\n\\n\\t/// Creates a new [`YamlTranscoder`].\\n\\n\\tpub const fn new() -> Self {\\n\\n\\t\\tSelf\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"starchart-backends/src/fs/yaml.rs\",\n \"rank\": 41,\n \"score\": 19.629842485044417\n },\n {\n \"content\": \"\\tfn default() -> Self {\\n\\n\\t\\tSelf::Read\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\tuse std::fmt::{Debug, Display};\\n\\n\\n\\n\\tuse serde::{Deserialize, Serialize};\\n\\n\\tuse static_assertions::assert_impl_all;\\n\\n\\n\\n\\tuse super::ActionKind;\\n\\n\\n\\n\\tassert_impl_all!(\\n\\n\\t\\tActionKind: Clone,\\n\\n\\t\\tCopy,\\n\\n\\t\\tDebug,\\n\\n\\t\\tDefault,\\n\\n\\t\\tDeserialize<'static>,\\n\",\n \"file_path\": \"starchart/src/action/kind.rs\",\n \"rank\": 42,\n \"score\": 18.97098504065039\n },\n {\n \"content\": \"\\t\\tDisplay,\\n\\n\\t\\tPartialEq,\\n\\n\\t\\tSend,\\n\\n\\t\\tSerialize,\\n\\n\\t\\tSync\\n\\n\\t);\\n\\n\\n\\n\\t#[test]\\n\\n\\tfn default() {\\n\\n\\t\\tassert_eq!(ActionKind::default(), ActionKind::Read);\\n\\n\\t}\\n\\n\\n\\n\\t#[test]\\n\\n\\tfn display() {\\n\\n\\t\\tassert_eq!(ActionKind::Create.to_string(), \\\"Create\\\");\\n\\n\\t\\tassert_eq!(ActionKind::Read.to_string(), \\\"Read\\\");\\n\\n\\t\\tassert_eq!(ActionKind::Update.to_string(), \\\"Update\\\");\\n\\n\\t\\tassert_eq!(ActionKind::Delete.to_string(), \\\"Delete\\\");\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"starchart/src/action/kind.rs\",\n \"rank\": 43,\n \"score\": 18.20659689365592\n },\n {\n \"content\": \"//! The different errors within the crate.\\n\\n\\n\\nuse std::{\\n\\n\\terror::Error as StdError,\\n\\n\\tfmt::{Display, Formatter, Result as FmtResult},\\n\\n};\\n\\n\\n\\n#[doc(inline)]\\n\\npub use crate::action::{\\n\\n\\tActionError, ActionErrorType, ActionRunError, ActionRunErrorType, ActionValidationError,\\n\\n\\tActionValidationErrorType,\\n\\n};\\n\\n\\n\\n// NOTE: This error shouldn't be used anywhere inside this crate, it's only meant for end users as an ease of use\\n\\n// error struct.\\n\\n\\n\\n/// An error that occurred within the crate.\\n\\n#[derive(Debug)]\\n\\npub struct Error {\\n\\n\\tsource: Option<Box<dyn StdError + Send + Sync>>,\\n\",\n \"file_path\": \"starchart/src/error.rs\",\n \"rank\": 44,\n \"score\": 18.17151808226323\n },\n {\n \"content\": \"\\t\\tassert_eq!(CreateOperation::kind(), ActionKind::Create);\\n\\n\\t\\tassert_eq!(ReadOperation::kind(), ActionKind::Read);\\n\\n\\t\\tassert_eq!(UpdateOperation::kind(), ActionKind::Update);\\n\\n\\t\\tassert_eq!(DeleteOperation::kind(), ActionKind::Delete);\\n\\n\\t}\\n\\n\\n\\n\\t#[test]\\n\\n\\tfn target() {\\n\\n\\t\\tassert_eq!(TableTarget::target(), TargetKind::Table);\\n\\n\\t\\tassert_eq!(EntryTarget::target(), TargetKind::Entry);\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"starchart/src/action/impl.rs\",\n \"rank\": 45,\n \"score\": 17.86393205440589\n },\n {\n \"content\": \"\\t\\tself.inner.update_entry(chart)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: Entry> DeleteEntryAction<'a, S> {\\n\\n\\t/// Validates and runs a [`DeleteEntryAction`].\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_key`] fails, or if any of the [`Backend`] methods fail.\\n\\n\\tpub fn run_delete_entry<B: Backend>(\\n\\n\\t\\tself,\\n\\n\\t\\tgateway: &'a Starchart<B>,\\n\\n\\t) -> impl Future<Output = Result<bool, ActionError>> + 'a {\\n\\n\\t\\tself.inner.delete_entry(gateway)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: Entry> CreateTableAction<'a, S> {\\n\\n\\t/// Validates and runs a [`CreateTableAction`].\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 46,\n \"score\": 17.842077516486828\n },\n {\n \"content\": \"use std::io::Read;\\n\\n\\n\\nuse starchart::Entry;\\n\\n\\n\\nuse super::{transcoders::TranscoderFormat, FsError, Transcoder};\\n\\n\\n\\n/// A transcoder for the TOML format.\\n\\n#[derive(Debug, Default, Clone, Copy)]\\n\\n#[cfg(feature = \\\"toml\\\")]\\n\\n#[must_use = \\\"transcoders do nothing by themselves\\\"]\\n\\npub struct TomlTranscoder(TranscoderFormat);\\n\\n\\n\\nimpl TomlTranscoder {\\n\\n\\t/// Creates a new [`TomlTranscoder`], optionally using pretty printing.\\n\\n\\tpub const fn new(format: TranscoderFormat) -> Self {\\n\\n\\t\\tSelf(format)\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns whether or not this transcoder uses pretty formatting.\\n\\n\\t#[must_use]\\n\",\n \"file_path\": \"starchart-backends/src/fs/toml.rs\",\n \"rank\": 47,\n \"score\": 17.694808074574446\n },\n {\n \"content\": \"use std::io::Read;\\n\\n\\n\\nuse starchart::Entry;\\n\\n\\n\\nuse super::{transcoders::TranscoderFormat, FsError, Transcoder};\\n\\n\\n\\n/// A transcoder for the JSON format.\\n\\n#[derive(Debug, Default, Clone, Copy)]\\n\\n#[cfg(feature = \\\"json\\\")]\\n\\n#[must_use = \\\"transcoders do nothing by themselves\\\"]\\n\\npub struct JsonTranscoder(TranscoderFormat);\\n\\n\\n\\nimpl JsonTranscoder {\\n\\n\\t/// Creates a new [`JsonTranscoder`], optionally using pretty printing.\\n\\n\\tpub const fn new(format: TranscoderFormat) -> Self {\\n\\n\\t\\tSelf(format)\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns whether or not this transcoder uses pretty formatting.\\n\\n\\t#[must_use]\\n\",\n \"file_path\": \"starchart-backends/src/fs/json.rs\",\n \"rank\": 48,\n \"score\": 17.694808074574446\n },\n {\n \"content\": \"\\tassert_impl_all!(\\n\\n\\t\\tTargetKind: Clone,\\n\\n\\t\\tCopy,\\n\\n\\t\\tDebug,\\n\\n\\t\\tDefault,\\n\\n\\t\\tDeserialize<'static>,\\n\\n\\t\\tDisplay,\\n\\n\\t\\tPartialEq,\\n\\n\\t\\tSend,\\n\\n\\t\\tSerialize,\\n\\n\\t\\tSync\\n\\n\\t);\\n\\n\\n\\n\\t#[test]\\n\\n\\tfn default() {\\n\\n\\t\\tassert_eq!(TargetKind::default(), TargetKind::Entry);\\n\\n\\t}\\n\\n\\n\\n\\t#[test]\\n\\n\\tfn display() {\\n\\n\\t\\tassert_eq!(TargetKind::Entry.to_string(), \\\"Entry\\\");\\n\\n\\t\\tassert_eq!(TargetKind::Table.to_string(), \\\"Table\\\");\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"starchart/src/action/target.rs\",\n \"rank\": 49,\n \"score\": 17.678852853376842\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\t/// Creates a new error from a backend.\\n\\n\\t#[must_use]\\n\\n\\tpub fn backend(e: Option<Box<dyn StdError + Send + Sync>>) -> Self {\\n\\n\\t\\tSelf {\\n\\n\\t\\t\\tsource: e,\\n\\n\\t\\t\\tkind: ErrorType::Backend,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl Display for Error {\\n\\n\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\\n\\t\\tmatch &self.kind {\\n\\n\\t\\t\\tErrorType::Backend => f.write_str(\\\"an error occurred within a backend\\\"),\\n\\n\\t\\t\\tErrorType::ActionRun => f.write_str(\\\"an error occurred running an action\\\"),\\n\\n\\t\\t\\tErrorType::ActionValidation => f.write_str(\\\"an action is invalid\\\"),\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/error.rs\",\n \"rank\": 50,\n \"score\": 16.974297222273922\n },\n {\n \"content\": \"\\tpub const fn is_pretty(self) -> bool {\\n\\n\\t\\tmatches!(self.0, TranscoderFormat::Pretty)\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns whether or not this transcoder uses standard formatting.\\n\\n\\t#[must_use]\\n\\n\\tpub const fn is_standard(self) -> bool {\\n\\n\\t\\t!self.is_pretty()\\n\\n\\t}\\n\\n\\n\\n\\t/// Create a new [`JsonTranscoder`] with prettier file formatting.\\n\\n\\tpub const fn pretty() -> Self {\\n\\n\\t\\tSelf::new(TranscoderFormat::Pretty)\\n\\n\\t}\\n\\n\\n\\n\\t/// Creates a new [`JsonTranscoder`] with standard file formatting.\\n\\n\\tpub const fn standard() -> Self {\\n\\n\\t\\tSelf::new(TranscoderFormat::Standard)\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"starchart-backends/src/fs/json.rs\",\n \"rank\": 51,\n \"score\": 16.887222968242256\n },\n {\n \"content\": \"\\tpub const fn is_pretty(self) -> bool {\\n\\n\\t\\tmatches!(self.0, TranscoderFormat::Pretty)\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns whether or not this transcoder uses standard formatting.\\n\\n\\t#[must_use]\\n\\n\\tpub const fn is_standard(self) -> bool {\\n\\n\\t\\t!self.is_pretty()\\n\\n\\t}\\n\\n\\n\\n\\t/// Create a new [`TomlTranscoder`] with prettier file formatting.\\n\\n\\tpub const fn pretty() -> Self {\\n\\n\\t\\tSelf::new(TranscoderFormat::Pretty)\\n\\n\\t}\\n\\n\\n\\n\\t/// Creates a new [`TomlTranscoder`] with standard file formatting.\\n\\n\\tpub const fn standard() -> Self {\\n\\n\\t\\tSelf::new(TranscoderFormat::Standard)\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"starchart-backends/src/fs/toml.rs\",\n \"rank\": 52,\n \"score\": 16.887222968242252\n },\n {\n \"content\": \"\\t/// This locks the database and allows no other reads or writes until it is complete.\\n\\n\\tUpdate,\\n\\n\\t/// Signifies that the operation will be a Delete.\\n\\n\\t///\\n\\n\\t/// This locks the database and allows no other reads or writes until it is complete.\\n\\n\\tDelete,\\n\\n}\\n\\n\\n\\nimpl Display for ActionKind {\\n\\n\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\\n\\t\\tmatch self {\\n\\n\\t\\t\\tSelf::Create => f.write_str(\\\"Create\\\"),\\n\\n\\t\\t\\tSelf::Read => f.write_str(\\\"Read\\\"),\\n\\n\\t\\t\\tSelf::Update => f.write_str(\\\"Update\\\"),\\n\\n\\t\\t\\tSelf::Delete => f.write_str(\\\"Delete\\\"),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl Default for ActionKind {\\n\",\n \"file_path\": \"starchart/src/action/kind.rs\",\n \"rank\": 53,\n \"score\": 16.792081439178087\n },\n {\n \"content\": \"impl Transcoder for YamlTranscoder {\\n\\n\\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\\n\\n\\t\\tOk(serde_yaml::to_vec(value)?)\\n\\n\\t}\\n\\n\\n\\n\\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError> {\\n\\n\\t\\tOk(serde_yaml::from_reader(rdr)?)\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(all(test, not(miri)))]\\n\\nmod tests {\\n\\n\\tuse std::{fmt::Debug, fs};\\n\\n\\n\\n\\tuse starchart::backend::Backend;\\n\\n\\tuse static_assertions::assert_impl_all;\\n\\n\\n\\n\\tuse crate::{\\n\\n\\t\\tfs::{transcoders::YamlTranscoder, FsBackend, FsError},\\n\\n\\t\\ttesting::{TestPath, TestSettings, TEST_GUARD},\\n\",\n \"file_path\": \"starchart-backends/src/fs/yaml.rs\",\n \"rank\": 54,\n \"score\": 16.62061012918509\n },\n {\n \"content\": \"\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This will raise an error if any of the static run methods in [`Action`] fail, as it uses those internally.\\n\\n\\tpub async fn run<B: Backend>(\\n\\n\\t\\tself,\\n\\n\\t\\tchart: &Starchart<B>,\\n\\n\\t) -> Result<ActionResult<S>, ActionError> {\\n\\n\\t\\tmatch (self.kind(), self.target()) {\\n\\n\\t\\t\\t(ActionKind::Create, TargetKind::Entry) => {\\n\\n\\t\\t\\t\\tlet stat = self.as_static::<CreateOperation, EntryTarget>()?;\\n\\n\\t\\t\\t\\tstat.run_create_entry(chart).await?;\\n\\n\\t\\t\\t\\tOk(ActionResult::Create)\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t(ActionKind::Read, TargetKind::Entry) => {\\n\\n\\t\\t\\t\\tlet stat = self.as_static::<ReadOperation, EntryTarget>()?;\\n\\n\\t\\t\\t\\tlet ret = stat.run_read_entry(chart).await?;\\n\\n\\t\\t\\t\\tOk(ActionResult::SingleRead(ret))\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t(ActionKind::Update, TargetKind::Entry) => {\\n\\n\\t\\t\\t\\tlet stat = self.as_static::<UpdateOperation, EntryTarget>()?;\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 55,\n \"score\": 16.32460734597774\n },\n {\n \"content\": \"use std::{\\n\\n\\terror::Error,\\n\\n\\tfmt::{Display, Formatter, Result as FmtResult},\\n\\n\\tio::Error as IoError,\\n\\n\\tpath::PathBuf,\\n\\n};\\n\\n\\n\\n/// An error occurred from the [`FsBackend`] or one of it's [`Transcoders`].\\n\\n///\\n\\n/// [`FsBackend`]: super::FsBackend\\n\\n/// [`Transcoders`]: super::Transcoder\\n\\n#[derive(Debug)]\\n\\n#[cfg(feature = \\\"fs\\\")]\\n\\npub struct FsError {\\n\\n\\tpub(super) source: Option<Box<dyn Error + Send + Sync>>,\\n\\n\\tpub(super) kind: FsErrorType,\\n\\n}\\n\\n\\n\\nimpl FsError {\\n\\n\\t/// Creates an error from a [`Transcoder`].\\n\",\n \"file_path\": \"starchart-backends/src/fs/error.rs\",\n \"rank\": 56,\n \"score\": 16.246028069797102\n },\n {\n \"content\": \"use std::{\\n\\n\\tfmt::{Formatter, Result as FmtResult},\\n\\n\\tmarker::PhantomData,\\n\\n};\\n\\n\\n\\nuse serde::{\\n\\n\\tde::{Error as DeError, MapAccess, SeqAccess, Visitor},\\n\\n\\tser::SerializeStruct,\\n\\n\\tDeserialize, Deserializer, Serialize, Serializer,\\n\\n};\\n\\n\\n\\nuse super::{\\n\\n\\tActionError, ActionKind, ActionResult, ActionValidationError, ActionValidationErrorType,\\n\\n\\tCrudOperation, InnerAction, OperationTarget, TargetKind,\\n\\n};\\n\\nuse crate::{\\n\\n\\taction::{\\n\\n\\t\\tCreateOperation, DeleteOperation, EntryTarget, ReadOperation, TableTarget, UpdateOperation,\\n\\n\\t},\\n\\n\\tbackend::Backend,\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 57,\n \"score\": 16.225461889151273\n },\n {\n \"content\": \"\\n\\n\\t/// Validates that both the key and data have been set.\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This errors if both the [`Self::set_key`] and [`Self::set_data`] (or [`Self::set_entry`]) has not been called.\\n\\n\\tpub fn validate_entry(&self) -> Result<(), ActionValidationError> {\\n\\n\\t\\tself.inner.validate_entry()\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: IndexEntry, C: CrudOperation> Action<'a, S, C, EntryTarget> {\\n\\n\\t/// Sets the [`Entry`] and [`Key`] that this [`Action`] will act over.\\n\\n\\tpub fn set_entry(&mut self, entity: &'a S) -> &mut Self {\\n\\n\\t\\tself.set_key(entity.key()).set_data(entity)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: Entry, C: CrudOperation, T: OperationTarget> Debug for Action<'a, S, C, T> {\\n\\n\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 58,\n \"score\": 16.167506146800218\n },\n {\n \"content\": \"\\t///\\n\\n\\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_key`] fails, or if any of the [`Backend`] methods fail.\\n\\n\\tpub fn run_read_entry<B: Backend>(\\n\\n\\t\\tself,\\n\\n\\t\\tgateway: &'a Starchart<B>,\\n\\n\\t) -> impl Future<Output = Result<Option<S>, ActionError>> + 'a {\\n\\n\\t\\tself.inner.read_entry(gateway)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: Entry> UpdateEntryAction<'a, S> {\\n\\n\\t/// Validates and runs a [`UpdateEntryAction`].\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_entry`] fails, or if any of the [`Backend`] methods fail.\\n\\n\\tpub fn run_update_entry<B: Backend>(\\n\\n\\t\\tself,\\n\\n\\t\\tchart: &'a Starchart<B>,\\n\\n\\t) -> impl Future<Output = Result<(), ActionError>> + 'a {\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 59,\n \"score\": 16.056493561539593\n },\n {\n \"content\": \"\\t\\ttable: &'a str,\\n\\n\\t\\tid: &'a str,\\n\\n\\t\\tvalue: &'a S,\\n\\n\\t) -> EnsureFuture<'a, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tS: Entry,\\n\\n\\t{\\n\\n\\t\\tasync move {\\n\\n\\t\\t\\tif !self.has(table, id).await? {\\n\\n\\t\\t\\t\\tself.create(table, id, value).await?;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tOk(())\\n\\n\\t\\t}\\n\\n\\t\\t.boxed()\\n\\n\\t}\\n\\n\\n\\n\\t/// Updates an existing entry in a table.\\n\\n\\tfn update<'a, S>(\\n\\n\\t\\t&'a self,\\n\",\n \"file_path\": \"starchart/src/backend/mod.rs\",\n \"rank\": 60,\n \"score\": 15.97220979463848\n },\n {\n \"content\": \"\\n\\n\\t/// Checks whether the transcoder uses the [`CBOR`] format.\\n\\n\\t///\\n\\n\\t/// [`CBOR`]: serde_cbor\\n\\n\\t#[must_use]\\n\\n\\tpub const fn is_cbor(self) -> bool {\\n\\n\\t\\tmatches!(self.format(), BinaryFormat::Cbor)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl Transcoder for BinaryTranscoder {\\n\\n\\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\\n\\n\\t\\tmatch self.format() {\\n\\n\\t\\t\\tBinaryFormat::Bincode => Ok(serde_bincode::serialize(value)?),\\n\\n\\t\\t\\tBinaryFormat::Cbor => Ok(serde_cbor::to_vec(value)?),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError> {\\n\\n\\t\\tmatch self.format() {\\n\",\n \"file_path\": \"starchart-backends/src/fs/binary.rs\",\n \"rank\": 61,\n \"score\": 15.83152438391227\n },\n {\n \"content\": \"\\t}\\n\\n}\\n\\n\\n\\nimpl<S: BuildHasher + Clone> MemoryBackend<S> {\\n\\n\\t/// Creates a new [`MemoryBackend`] with the specified hasher.\\n\\n\\tpub fn with_hasher(hasher: S) -> Self {\\n\\n\\t\\tSelf::with_capacity_and_hasher(0, hasher)\\n\\n\\t}\\n\\n\\n\\n\\t/// Creates a new [`MemoryBackend`] with the specified capacity and hasher.\\n\\n\\tpub fn with_capacity_and_hasher(cap: usize, hasher: S) -> Self {\\n\\n\\t\\tSelf {\\n\\n\\t\\t\\ttables: DashMap::with_capacity_and_hasher(cap, hasher),\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<S: BuildHasher + Clone> Debug for MemoryBackend<S> {\\n\\n\\tfn fmt(&self, f: &mut Formatter<'_>) -> FmtResult {\\n\\n\\t\\tf.debug_struct(\\\"MemoryBackend\\\")\\n\",\n \"file_path\": \"starchart-backends/src/memory.rs\",\n \"rank\": 62,\n \"score\": 15.804639261383963\n },\n {\n \"content\": \"use crate::{\\n\\n\\tbackend::Backend,\\n\\n\\tutil::{is_metadata, InnerUnwrap},\\n\\n\\tEntry, IndexEntry, Key, Starchart,\\n\\n};\\n\\n\\n\\n/// A type alias for an [`Action`] with [`CreateOperation`] and [`EntryTarget`] as the parameters.\\n\\npub type CreateEntryAction<'a, S> = Action<'a, S, CreateOperation, EntryTarget>;\\n\\n\\n\\n/// A type alias for an [`Action`] with [`ReadOperation`] and [`EntryTarget`] as the parameters.\\n\\npub type ReadEntryAction<'a, S> = Action<'a, S, ReadOperation, EntryTarget>;\\n\\n\\n\\n/// A type alias for an [`Action`] with [`UpdateOperation`] and [`EntryTarget`] as the parameters.\\n\\npub type UpdateEntryAction<'a, S> = Action<'a, S, UpdateOperation, EntryTarget>;\\n\\n\\n\\n/// A type alias for an [`Action`] with [`DeleteOperation`] and [`EntryTarget`] as the parameters.\\n\\npub type DeleteEntryAction<'a, S> = Action<'a, S, DeleteOperation, EntryTarget>;\\n\\n\\n\\n/// A type alias for an [`Action`] with [`CreateOperation`] and [`TableTarget`] as the parameters.\\n\\npub type CreateTableAction<'a, S> = Action<'a, S, CreateOperation, TableTarget>;\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 63,\n \"score\": 15.70373440817529\n },\n {\n \"content\": \"//! Futures for [`Backend`] functions to return, for easier documentation.\\n\\n//!\\n\\n//! [`Backend`]: crate::backend::Backend\\n\\nuse std::{future::Future, pin::Pin};\\n\\n\\n\\n#[cfg(doc)]\\n\\nuse crate::backend::Backend;\\n\\n\\n\\n/// The future returned from [`Backend::init`].\\n\\npub type InitFuture<'a, E> = PinBoxFuture<'a, Result<(), E>>;\\n\\n\\n\\n/// The future returned from [`Backend::shutdown`].\\n\\npub type ShutdownFuture<'a> = PinBoxFuture<'a>;\\n\\n\\n\\n/// The future returned from [`Backend::has_table`].\\n\\npub type HasTableFuture<'a, E> = PinBoxFuture<'a, Result<bool, E>>;\\n\\n\\n\\n/// The future returned from [`Backend::create_table`].\\n\\npub type CreateTableFuture<'a, E> = PinBoxFuture<'a, Result<(), E>>;\\n\\n\\n\",\n \"file_path\": \"starchart/src/backend/futures.rs\",\n \"rank\": 64,\n \"score\": 15.612136451415608\n },\n {\n \"content\": \"use std::{\\n\\n\\terror::Error,\\n\\n\\tfmt::{Debug, Display, Formatter, Result as FmtResult},\\n\\n};\\n\\n\\n\\n/// A general [`Action`] error.\\n\\n///\\n\\n/// [`Action`]: super::Action\\n\\n#[derive(Debug)]\\n\\npub struct ActionError {\\n\\n\\tsource: Option<Box<dyn Error + Send + Sync>>,\\n\\n\\tkind: ActionErrorType,\\n\\n}\\n\\n\\n\\nimpl ActionError {\\n\\n\\t/// Immutable reference to the type of error that occurred.\\n\\n\\t#[must_use = \\\"retrieving the type has no effect if left unused\\\"]\\n\\n\\tpub const fn kind(&self) -> &ActionErrorType {\\n\\n\\t\\t&self.kind\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/action/error.rs\",\n \"rank\": 65,\n \"score\": 15.557465292574207\n },\n {\n \"content\": \"\\t///\\n\\n\\t/// [`bincode`]: serde_bincode\\n\\n\\tpub const fn bincode() -> Self {\\n\\n\\t\\tSelf::new(BinaryFormat::Bincode)\\n\\n\\t}\\n\\n\\n\\n\\t/// Creates a [`BinaryTranscoder`] using [`Cbor`] formatting.\\n\\n\\t///\\n\\n\\t/// [`Cbor`]: serde_cbor\\n\\n\\tpub const fn cbor() -> Self {\\n\\n\\t\\tSelf::new(BinaryFormat::Cbor)\\n\\n\\t}\\n\\n\\n\\n\\t/// Checks whether the transcoder uses the [`Bincode`] format.\\n\\n\\t///\\n\\n\\t/// [`Bincode`]: serde_bincode\\n\\n\\t#[must_use]\\n\\n\\tpub const fn is_bincode(self) -> bool {\\n\\n\\t\\tmatches!(self.format(), BinaryFormat::Bincode)\\n\\n\\t}\\n\",\n \"file_path\": \"starchart-backends/src/fs/binary.rs\",\n \"rank\": 66,\n \"score\": 15.448692440041453\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// A transcoder for multiple binary formats.\\n\\n#[derive(Debug, Clone, Copy)]\\n\\n#[cfg(feature = \\\"binary\\\")]\\n\\n#[must_use = \\\"transcoders do nothing by themselves\\\"]\\n\\npub struct BinaryTranscoder(BinaryFormat);\\n\\n\\n\\nimpl BinaryTranscoder {\\n\\n\\t/// Creates a new [`BinaryTranscoder`].\\n\\n\\tpub const fn new(format: BinaryFormat) -> Self {\\n\\n\\t\\tSelf(format)\\n\\n\\t}\\n\\n\\n\\n\\t/// Returns the binary format being used by the transcoder.\\n\\n\\tpub const fn format(self) -> BinaryFormat {\\n\\n\\t\\tself.0\\n\\n\\t}\\n\\n\\n\\n\\t/// Creates a [`BinaryTranscoder`] using [`bincode`] formatting.\\n\",\n \"file_path\": \"starchart-backends/src/fs/binary.rs\",\n \"rank\": 67,\n \"score\": 15.24095785723847\n },\n {\n \"content\": \"//! The backend that fetches and provides data for the [`Starchart`].\\n\\n//!\\n\\n//! [`Starchart`]: crate::Starchart\\n\\n\\n\\nuse std::{error::Error as StdError, iter::FromIterator};\\n\\n\\n\\nuse futures_util::{\\n\\n\\tfuture::{join_all, ok, ready},\\n\\n\\tFutureExt,\\n\\n};\\n\\n\\n\\nuse self::futures::{\\n\\n\\tCreateFuture, CreateTableFuture, DeleteFuture, DeleteTableFuture, EnsureFuture,\\n\\n\\tEnsureTableFuture, GetAllFuture, GetFuture, GetKeysFuture, HasFuture, HasTableFuture,\\n\\n\\tInitFuture, ShutdownFuture, UpdateFuture,\\n\\n};\\n\\nuse crate::Entry;\\n\\n\\n\\npub mod futures;\\n\\n\\n\\n/// The backend to be used to manage data.\\n\",\n \"file_path\": \"starchart/src/backend/mod.rs\",\n \"rank\": 68,\n \"score\": 15.003841397758192\n },\n {\n \"content\": \"\\tpub fn validate_data(&self) -> Result<(), ActionValidationError> {\\n\\n\\t\\tif self.data.is_none() {\\n\\n\\t\\t\\treturn Err(ActionValidationError {\\n\\n\\t\\t\\t\\tsource: None,\\n\\n\\t\\t\\t\\tkind: ActionValidationErrorType::Data,\\n\\n\\t\\t\\t});\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tOk(())\\n\\n\\t}\\n\\n\\n\\n\\t/// Validates that both the key and data have been set.\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This errors if both the [`Self::set_key`] and [`Self::set_data`] (or [`Self::set_entry`]) has not been called.\\n\\n\\tpub fn validate_entry(&self) -> Result<(), ActionValidationError> {\\n\\n\\t\\tself.validate_key()?;\\n\\n\\t\\tself.validate_data()\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 69,\n \"score\": 14.795042834159032\n },\n {\n \"content\": \"// Action run impls\\n\\n\\n\\nimpl<'a, S: Entry> CreateEntryAction<'a, S> {\\n\\n\\t/// Validates and runs a [`CreateEntryAction`].\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This returns an error if [`Self::validate_table`] or [`Self::validate_entry`] fails, or if any of the [`Backend`] methods fail.\\n\\n\\tpub fn run_create_entry<B: Backend>(\\n\\n\\t\\tself,\\n\\n\\t\\tchart: &'a Starchart<B>,\\n\\n\\t) -> impl Future<Output = Result<(), ActionError>> + 'a {\\n\\n\\t\\tself.inner.create_entry(chart)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: Entry> ReadEntryAction<'a, S> {\\n\\n\\t/// Validates and runs a [`ReadEntryAction`].\\n\\n\\t///\\n\\n\\t/// # Errors\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 70,\n \"score\": 14.748228490772881\n },\n {\n \"content\": \"\\tDeserialization,\\n\\n}\\n\\n\\n\\n/// A memory-based backend, uses a [`DashMap`] of [`Value`]s\\n\\n/// to represent data.\\n\\n#[cfg(feature = \\\"memory\\\")]\\n\\n#[must_use = \\\"a memory backend does nothing on it's own\\\"]\\n\\npub struct MemoryBackend<S = RandomState> {\\n\\n\\ttables: DashMap<String, DashMap<String, Value, S>, S>,\\n\\n}\\n\\n\\n\\nimpl MemoryBackend<RandomState> {\\n\\n\\t/// Creates a new [`MemoryBackend`].\\n\\n\\tpub fn new() -> Self {\\n\\n\\t\\tSelf::with_capacity_and_hasher(0, RandomState::default())\\n\\n\\t}\\n\\n\\n\\n\\t/// Creates a new [`MemoryBackend`] with the specified capacity.\\n\\n\\tpub fn with_capacity(cap: usize) -> Self {\\n\\n\\t\\tSelf::with_capacity_and_hasher(cap, RandomState::default())\\n\",\n \"file_path\": \"starchart-backends/src/memory.rs\",\n \"rank\": 71,\n \"score\": 14.739977676582152\n },\n {\n \"content\": \"\\tbackend::{\\n\\n\\t\\tfutures::{\\n\\n\\t\\t\\tCreateFuture, CreateTableFuture, DeleteFuture, DeleteTableFuture, GetFuture,\\n\\n\\t\\t\\tGetKeysFuture, HasFuture, HasTableFuture, InitFuture, UpdateFuture,\\n\\n\\t\\t},\\n\\n\\t\\tBackend,\\n\\n\\t},\\n\\n\\tEntry,\\n\\n};\\n\\nuse tokio::fs;\\n\\n\\n\\npub use self::error::{FsError, FsErrorType};\\n\\n\\n\\n/// An fs-based backend for the starchart crate.\\n\\n#[derive(Debug, Clone)]\\n\\n#[cfg(feature = \\\"fs\\\")]\\n\\npub struct FsBackend<T> {\\n\\n\\ttranscoder: T,\\n\\n\\textension: String,\\n\\n\\tbase_directory: PathBuf,\\n\",\n \"file_path\": \"starchart-backends/src/fs/mod.rs\",\n \"rank\": 72,\n \"score\": 14.640822520243477\n },\n {\n \"content\": \"\\n\\nimpl Transcoder for JsonTranscoder {\\n\\n\\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\\n\\n\\t\\tif self.is_pretty() {\\n\\n\\t\\t\\tOk(serde_json::to_vec_pretty(value)?)\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tOk(serde_json::to_vec(value)?)\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfn deserialize_data<T: Entry, R: Read>(&self, rdr: R) -> Result<T, FsError> {\\n\\n\\t\\tOk(serde_json::from_reader(rdr)?)\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(all(test, not(miri)))]\\n\\nmod tests {\\n\\n\\tuse std::{fmt::Debug, fs};\\n\\n\\n\\n\\tuse starchart::backend::Backend;\\n\",\n \"file_path\": \"starchart-backends/src/fs/json.rs\",\n \"rank\": 73,\n \"score\": 14.591349146918143\n },\n {\n \"content\": \"use futures_util::future::ok;\\n\\nuse futures_util::Future;\\n\\n\\n\\n#[doc(hidden)]\\n\\npub use self::error::{\\n\\n\\tActionError, ActionErrorType, ActionRunError, ActionRunErrorType, ActionValidationError,\\n\\n\\tActionValidationErrorType,\\n\\n};\\n\\npub use self::{\\n\\n\\tdynamic::DynamicAction,\\n\\n\\tkind::ActionKind,\\n\\n\\tr#impl::{\\n\\n\\t\\tCreateOperation, CrudOperation, DeleteOperation, EntryTarget, OperationTarget,\\n\\n\\t\\tReadOperation, TableTarget, UpdateOperation,\\n\\n\\t},\\n\\n\\tresult::ActionResult,\\n\\n\\ttarget::TargetKind,\\n\\n};\\n\\n#[cfg(feature = \\\"metadata\\\")]\\n\\nuse crate::METADATA_KEY;\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 74,\n \"score\": 14.584662827057983\n },\n {\n \"content\": \"\\t) -> GetAllFuture<'a, I, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tD: Entry,\\n\\n\\t\\tI: FromIterator<D>,\\n\\n\\t{\\n\\n\\t\\tasync move {\\n\\n\\t\\t\\tself.tables.get(table).map_or_else(\\n\\n\\t\\t\\t\\t|| Ok(None.into_iter().collect::<I>()),\\n\\n\\t\\t\\t\\t|table| {\\n\\n\\t\\t\\t\\t\\ttable\\n\\n\\t\\t\\t\\t\\t\\t.clone()\\n\\n\\t\\t\\t\\t\\t\\t.into_iter()\\n\\n\\t\\t\\t\\t\\t\\t.filter_map(|(key, value)| {\\n\\n\\t\\t\\t\\t\\t\\t\\tif entries.contains(&key.as_str()) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tSome(value.deserialize_into().map_err(MemoryError::from))\\n\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tNone\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t})\\n\\n\\t\\t\\t\\t\\t\\t.collect::<Result<I, Self::Error>>()\\n\",\n \"file_path\": \"starchart-backends/src/memory.rs\",\n \"rank\": 75,\n \"score\": 14.375735306560697\n },\n {\n \"content\": \"/// [`CRUD`]: https://en.wikipedia.org/wiki/Create,_read,_update_and_delete\\n\\n/// [`Starchart`]: crate::Starchart\\n\\n#[derive(Clone)]\\n\\n#[must_use = \\\"an action alone has no side effects\\\"]\\n\\npub struct Action<'a, S, C, T> {\\n\\n\\tpub(crate) inner: InnerAction<'a, S>,\\n\\n\\tkind: PhantomData<C>,\\n\\n\\ttarget: PhantomData<T>,\\n\\n}\\n\\n\\n\\nimpl<'a, S, C, T> Action<'a, S, C, T> {\\n\\n\\t/// Creates a new [`Action`] with the specified operation.\\n\\n\\tpub const fn new() -> Self {\\n\\n\\t\\tSelf {\\n\\n\\t\\t\\tinner: InnerAction::new(),\\n\\n\\t\\t\\tkind: PhantomData,\\n\\n\\t\\t\\ttarget: PhantomData,\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 76,\n \"score\": 14.358287561034551\n },\n {\n \"content\": \"\\tutil::InnerUnwrap,\\n\\n\\tAction, Entry, IndexEntry, Key, Starchart,\\n\\n};\\n\\n\\n\\n/// A dynamic [`Action`] for when certain parameters aren't known until runtime.\\n\\n#[derive(Clone)]\\n\\n#[must_use = \\\"an action alone has no side effects\\\"]\\n\\npub struct DynamicAction<S: ?Sized> {\\n\\n\\tpub(super) key: Option<String>,\\n\\n\\tpub(super) data: Option<Box<S>>,\\n\\n\\tpub(super) table: Option<String>,\\n\\n\\tpub(super) kind: ActionKind,\\n\\n\\tpub(super) target: TargetKind,\\n\\n}\\n\\n\\n\\nimpl<S: ?Sized> DynamicAction<S> {\\n\\n\\t/// Creates a new action of the specified type and target.\\n\\n\\tpub const fn new(kind: ActionKind, target: TargetKind) -> Self {\\n\\n\\t\\tSelf {\\n\\n\\t\\t\\tkey: None,\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 77,\n \"score\": 14.297953668048269\n },\n {\n \"content\": \"\\t\\tExclusiveGuard(inner)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl Default for Guard {\\n\\n\\tfn default() -> Self {\\n\\n\\t\\tSelf::new()\\n\\n\\t}\\n\\n}\\n\\n\\n\\n// implementing send doesn't matter bc we're not actually editing the value, just using it for a locking mechanism\\n\\npub struct SharedGuard<'a>(RwLockReadGuard<'a, ()>);\\n\\n\\n\\nunsafe impl<'a> Send for SharedGuard<'a> {}\\n\\n\\n\\npub struct ExclusiveGuard<'a>(RwLockWriteGuard<'a, ()>);\\n\\n\\n\\nunsafe impl<'a> Send for ExclusiveGuard<'a> {}\\n\",\n \"file_path\": \"starchart/src/atomics.rs\",\n \"rank\": 78,\n \"score\": 13.924707479902402\n },\n {\n \"content\": \"\\t#[cfg(feature = \\\"json\\\")]\\n\\n\\tpub use super::json::JsonTranscoder;\\n\\n\\t#[cfg(feature = \\\"toml\\\")]\\n\\n\\tpub use super::toml::TomlTranscoder;\\n\\n\\t#[cfg(feature = \\\"yaml\\\")]\\n\\n\\tpub use super::yaml::YamlTranscoder;\\n\\n\\n\\n\\t/// Transcoder formats for supported transcoders to use.\\n\\n\\t#[cfg(any(feature = \\\"toml\\\", feature = \\\"json\\\"))]\\n\\n\\t#[derive(Debug, Clone, Copy, PartialEq, Eq)]\\n\\n\\tpub enum TranscoderFormat {\\n\\n\\t\\t/// Standard formatting, this is the default.\\n\\n\\t\\tStandard,\\n\\n\\t\\t/// Prettier formatting, this uses more file space but is also more human-readable.\\n\\n\\t\\tPretty,\\n\\n\\t}\\n\\n\\n\\n\\t#[cfg(any(feature = \\\"toml\\\", feature = \\\"json\\\"))]\\n\\n\\timpl Default for TranscoderFormat {\\n\\n\\t\\tfn default() -> Self {\\n\",\n \"file_path\": \"starchart-backends/src/fs/mod.rs\",\n \"rank\": 79,\n \"score\": 13.728626554711312\n },\n {\n \"content\": \"\\tfn get<'a, D>(&'a self, table: &'a str, id: &'a str) -> GetFuture<'a, D, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tD: Entry;\\n\\n\\n\\n\\t/// Checks if an entry exists in a table.\\n\\n\\tfn has<'a>(&'a self, table: &'a str, id: &'a str) -> HasFuture<'a, Self::Error>;\\n\\n\\n\\n\\t/// Inserts a new entry into a table.\\n\\n\\tfn create<'a, S>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\ttable: &'a str,\\n\\n\\t\\tid: &'a str,\\n\\n\\t\\tvalue: &'a S,\\n\\n\\t) -> CreateFuture<'a, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tS: Entry;\\n\\n\\n\\n\\t/// Ensures a value exists in the table.\\n\\n\\tfn ensure<'a, S>(\\n\\n\\t\\t&'a self,\\n\",\n \"file_path\": \"starchart/src/backend/mod.rs\",\n \"rank\": 80,\n \"score\": 13.636826747675746\n },\n {\n \"content\": \"\\t}\\n\\n}\\n\\n\\n\\n#[cfg(all(test, not(miri)))]\\n\\nmod tests {\\n\\n\\tuse std::fmt::Debug;\\n\\n\\n\\n\\tuse fxhash::FxBuildHasher;\\n\\n\\tuse starchart::backend::Backend;\\n\\n\\tuse static_assertions::assert_impl_all;\\n\\n\\n\\n\\tuse super::{MemoryBackend, MemoryError};\\n\\n\\tuse crate::testing::TestSettings;\\n\\n\\n\\n\\tassert_impl_all!(MemoryBackend: Backend, Clone, Debug, Default, Send, Sync);\\n\\n\\n\\n\\t#[tokio::test]\\n\\n\\tasync fn table_methods() -> Result<(), MemoryError> {\\n\\n\\t\\tlet backend = MemoryBackend::with_hasher(FxBuildHasher::default());\\n\\n\\n\",\n \"file_path\": \"starchart-backends/src/memory.rs\",\n \"rank\": 81,\n \"score\": 13.535281686954235\n },\n {\n \"content\": \"use std::io::Read;\\n\\n\\n\\nuse starchart::Entry;\\n\\n\\n\\nuse super::{FsError, Transcoder};\\n\\n\\n\\n/// Format types for the [`BinaryTranscoder`].\\n\\n#[derive(Debug, Clone, Copy)]\\n\\n#[cfg(feature = \\\"binary\\\")]\\n\\n#[non_exhaustive]\\n\\n#[must_use = \\\"binary formats do nothing on their own\\\"]\\n\\npub enum BinaryFormat {\\n\\n\\t/// The [`Bincode`] format.\\n\\n\\t///\\n\\n\\t/// [`Bincode`]: serde_bincode\\n\\n\\tBincode,\\n\\n\\t/// The [`CBOR`] format.\\n\\n\\t///\\n\\n\\t/// [`CBOR`]: serde_cbor\\n\\n\\tCbor,\\n\",\n \"file_path\": \"starchart-backends/src/fs/binary.rs\",\n \"rank\": 82,\n \"score\": 13.274595364509688\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t\\tOk(Action {\\n\\n\\t\\t\\tinner: InnerAction {\\n\\n\\t\\t\\t\\tdata: self.data.as_deref(),\\n\\n\\t\\t\\t\\tkey: self.key.clone(),\\n\\n\\t\\t\\t\\ttable: self.table.as_deref(),\\n\\n\\t\\t\\t},\\n\\n\\t\\t\\tkind: PhantomData,\\n\\n\\t\\t\\ttarget: PhantomData,\\n\\n\\t\\t})\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<S: IndexEntry + ?Sized> DynamicAction<S> {\\n\\n\\t/// Sets both a key and a value to run the action with.\\n\\n\\tpub fn set_entry(&mut self, entry: S) -> &mut Self {\\n\\n\\t\\tself.set_key(entry.key()).set_entry(entry)\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 83,\n \"score\": 13.154708706294734\n },\n {\n \"content\": \"\\t\\ttable: &'a str,\\n\\n\\t\\tid: &'a str,\\n\\n\\t\\tvalue: &'a S,\\n\\n\\t) -> UpdateFuture<'a, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tS: Entry;\\n\\n\\n\\n\\t/// Deletes an entry from a table.\\n\\n\\tfn delete<'a>(&'a self, table: &'a str, id: &'a str) -> DeleteFuture<'a, Self::Error>;\\n\\n}\\n\",\n \"file_path\": \"starchart/src/backend/mod.rs\",\n \"rank\": 84,\n \"score\": 13.131053647262899\n },\n {\n \"content\": \"\\n\\nimpl Transcoder for TomlTranscoder {\\n\\n\\tfn serialize_value<T: Entry>(&self, value: &T) -> Result<Vec<u8>, FsError> {\\n\\n\\t\\tif self.is_pretty() {\\n\\n\\t\\t\\tOk(serde_toml::to_string_pretty(value).map(String::into_bytes)?)\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tOk(serde_toml::to_vec(value)?)\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfn deserialize_data<T: Entry, R: Read>(&self, mut rdr: R) -> Result<T, FsError> {\\n\\n\\t\\tlet mut output = String::new();\\n\\n\\t\\trdr.read_to_string(&mut output)?;\\n\\n\\t\\tOk(serde_toml::from_str(&output)?)\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(all(test, not(miri)))]\\n\\nmod tests {\\n\\n\\tuse std::{fmt::Debug, fs};\\n\",\n \"file_path\": \"starchart-backends/src/fs/toml.rs\",\n \"rank\": 85,\n \"score\": 12.983974807634631\n },\n {\n \"content\": \"\\t\\t\\t\\tstat.run_update_entry(chart).await?;\\n\\n\\t\\t\\t\\tOk(ActionResult::Update)\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t(ActionKind::Delete, TargetKind::Entry) => {\\n\\n\\t\\t\\t\\tlet stat = self.as_static::<DeleteOperation, EntryTarget>()?;\\n\\n\\t\\t\\t\\tlet ret = stat.run_delete_entry(chart).await?;\\n\\n\\t\\t\\t\\tOk(ActionResult::Delete(ret))\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t(ActionKind::Create, TargetKind::Table) => {\\n\\n\\t\\t\\t\\tlet stat = self.as_static::<CreateOperation, TableTarget>()?;\\n\\n\\t\\t\\t\\tstat.run_create_table(chart).await?;\\n\\n\\t\\t\\t\\tOk(ActionResult::Create)\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t(ActionKind::Read, TargetKind::Table) => {\\n\\n\\t\\t\\t\\tlet stat = self.as_static::<ReadOperation, TableTarget>()?;\\n\\n\\t\\t\\t\\tlet ret = stat.run_read_table(chart).await?;\\n\\n\\t\\t\\t\\tOk(ActionResult::MultiRead(ret))\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\t(ActionKind::Update, TargetKind::Table) => panic!(\\\"updating tables is unsupported\\\"),\\n\\n\\t\\t\\t(ActionKind::Delete, TargetKind::Table) => {\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 86,\n \"score\": 12.832872923888964\n },\n {\n \"content\": \"\\n\\n\\t\\tself\\n\\n\\t}\\n\\n\\n\\n\\t/// Sets the key for the action.\\n\\n\\t///\\n\\n\\t/// Users should prefer to call [`Self::set_entry`] over this, as setting the\\n\\n\\t/// entry will automatically call this.\\n\\n\\t///\\n\\n\\t/// This is unused on [`TargetKind::Table`] actions.\\n\\n\\tpub fn set_key<K: Key>(&mut self, key: &K) -> &mut Self {\\n\\n\\t\\tself.key.replace(key.to_key());\\n\\n\\n\\n\\t\\tself\\n\\n\\t}\\n\\n\\n\\n\\t/// Sets the data for the action.\\n\\n\\t///\\n\\n\\t/// This is unused on [`TargetKind::Table`] actions.\\n\\n\\tpub fn set_data(&mut self, data: S) -> &mut Self {\\n\",\n \"file_path\": \"starchart/src/action/dynamic.rs\",\n \"rank\": 87,\n \"score\": 12.807186972685189\n },\n {\n \"content\": \"\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This returns an error if [`Self::validate_table`] fails, or if any of the [`Backend`] methods fail.\\n\\n\\tpub fn run_create_table<B: Backend>(\\n\\n\\t\\tself,\\n\\n\\t\\tgateway: &'a Starchart<B>,\\n\\n\\t) -> impl Future<Output = Result<(), ActionError>> + 'a {\\n\\n\\t\\tself.inner.create_table(gateway)\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<'a, S: Entry> ReadTableAction<'a, S> {\\n\\n\\t/// Validates and runs a [`ReadTableAction`].\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// This returns an error if [`Self::validate_table`] fails, or if any of the [`Backend`] methods fail.\\n\\n\\tpub fn run_read_table<B: Backend, I>(\\n\\n\\t\\tself,\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 88,\n \"score\": 12.750109865151861\n },\n {\n \"content\": \"\\t\\tself // coverage:ignore-line\\n\\n\\t}\\n\\n\\n\\n\\t/// Validate that the key has been set.\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// Errors if [`Self::set_key`] has not yet been called.\\n\\n\\tpub fn validate_key(&self) -> Result<(), ActionValidationError> {\\n\\n\\t\\tself.inner.validate_key()\\n\\n\\t}\\n\\n\\n\\n\\t/// Validates that the data has been set.\\n\\n\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// Errors if [`Self::set_data`] has not yet been called.\\n\\n\\tpub fn validate_data(&self) -> Result<(), ActionValidationError> {\\n\\n\\t\\tself.inner.validate_data()\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 89,\n \"score\": 12.660720974553106\n },\n {\n \"content\": \"//! The action structs for CRUD operations.\\n\\n\\n\\n// TODO: Add overwrite option.\\n\\n\\n\\nmod dynamic;\\n\\nmod error;\\n\\nmod r#impl;\\n\\nmod kind;\\n\\nmod result;\\n\\nmod target;\\n\\n\\n\\n#[cfg(feature = \\\"metadata\\\")]\\n\\nuse std::any::type_name;\\n\\nuse std::{\\n\\n\\tfmt::{Debug, Formatter, Result as FmtResult},\\n\\n\\titer::FromIterator,\\n\\n\\tmarker::PhantomData,\\n\\n};\\n\\n\\n\\n#[cfg(not(feature = \\\"metadata\\\"))]\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 90,\n \"score\": 12.637438565051093\n },\n {\n \"content\": \"\\t\\tE: Entry,\\n\\n\\t{\\n\\n\\t\\tif let Some(table) = self.tables.get(table) {\\n\\n\\t\\t\\tlet serialized = match to_value(value) {\\n\\n\\t\\t\\t\\tOk(v) => v,\\n\\n\\t\\t\\t\\tErr(e) => return err(e.into()).boxed(),\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\t\\t\\ttable.insert(id.to_owned(), serialized);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tok(()).boxed()\\n\\n\\t}\\n\\n\\n\\n\\tfn update<'a, E>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\ttable: &'a str,\\n\\n\\t\\tid: &'a str,\\n\\n\\t\\tvalue: &'a E,\\n\\n\\t) -> UpdateFuture<'a, Self::Error>\\n\",\n \"file_path\": \"starchart-backends/src/memory.rs\",\n \"rank\": 91,\n \"score\": 12.628961913593116\n },\n {\n \"content\": \"//! The base structure to use for starchart.\\n\\n\\n\\nuse std::{ops::Deref, sync::Arc};\\n\\n\\n\\nuse futures_executor::block_on;\\n\\n\\n\\nuse crate::{atomics::Guard, backend::Backend};\\n\\n\\n\\n/// The base structure for managing data.\\n\\n///\\n\\n/// The inner data is wrapped in an [`Arc`], so cloning\\n\\n/// is cheap and will allow multiple accesses to the data.\\n\\n#[derive(Debug, Default)]\\n\\npub struct Starchart<B: Backend> {\\n\\n\\tbackend: Arc<B>,\\n\\n\\tpub(crate) guard: Arc<Guard>,\\n\\n}\\n\\n\\n\\nimpl<B: Backend> Starchart<B> {\\n\\n\\t/// Creates a new [`Starchart`], and initializes the [`Backend`].\\n\",\n \"file_path\": \"starchart/src/starchart.rs\",\n \"rank\": 92,\n \"score\": 12.610540743277756\n },\n {\n \"content\": \"\\t#[allow(clippy::inline_always)]\\n\\n\\t#[inline(always)]\\n\\n\\t#[track_caller]\\n\\n\\tunsafe fn inner_unwrap(self) -> T {\\n\\n\\t\\tself.unwrap_unchecked()\\n\\n\\t}\\n\\n}\\n\\n\\n\\n#[cfg(not(has_unwrap_unchecked))]\\n\\nunsafe impl<T, E> InnerUnwrap<T> for Result<T, E> {\\n\\n\\t#[inline]\\n\\n\\t#[track_caller]\\n\\n\\tunsafe fn inner_unwrap(self) -> T {\\n\\n\\t\\tdebug_assert!(self.is_ok());\\n\\n\\t\\tif let Ok(v) = self {\\n\\n\\t\\t\\tv\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tunreachable_unchecked()\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/util.rs\",\n \"rank\": 93,\n \"score\": 12.56413301107484\n },\n {\n \"content\": \"\\n\\n\\t\\tlet serialized = match self.transcoder().serialize_value(value) {\\n\\n\\t\\t\\tOk(v) => v,\\n\\n\\t\\t\\tErr(e) => return err(e).boxed(),\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tfs::write(path, serialized)\\n\\n\\t\\t\\t.map(|res| res.map_err(Into::into))\\n\\n\\t\\t\\t.boxed()\\n\\n\\t}\\n\\n\\n\\n\\tfn update<'a, S>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\ttable: &'a str,\\n\\n\\t\\tid: &'a str,\\n\\n\\t\\tvalue: &'a S,\\n\\n\\t) -> UpdateFuture<'a, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tS: Entry,\\n\\n\\t{\\n\",\n \"file_path\": \"starchart-backends/src/fs/mod.rs\",\n \"rank\": 94,\n \"score\": 12.528373161347671\n },\n {\n \"content\": \"\\t///\\n\\n\\t/// # Errors\\n\\n\\t///\\n\\n\\t/// Any errors that [`Backend::init`] can raise.\\n\\n\\tpub async fn new(backend: B) -> Result<Self, B::Error> {\\n\\n\\t\\tbackend.init().await?;\\n\\n\\t\\tOk(Self {\\n\\n\\t\\t\\tbackend: Arc::new(backend),\\n\\n\\t\\t\\tguard: Arc::default(),\\n\\n\\t\\t})\\n\\n\\t}\\n\\n}\\n\\n\\n\\nimpl<B: Backend> Clone for Starchart<B> {\\n\\n\\tfn clone(&self) -> Self {\\n\\n\\t\\tSelf {\\n\\n\\t\\t\\tbackend: self.backend.clone(),\\n\\n\\t\\t\\tguard: self.guard.clone(),\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"starchart/src/starchart.rs\",\n \"rank\": 95,\n \"score\": 12.48173500974048\n },\n {\n \"content\": \"\\t\\tassert_eq!(\\n\\n\\t\\t\\tbackend.get::<TestSettings>(\\\"table\\\", \\\"1\\\").await?,\\n\\n\\t\\t\\tSome(settings)\\n\\n\\t\\t);\\n\\n\\n\\n\\t\\tbackend.delete(\\\"table\\\", \\\"1\\\").await?;\\n\\n\\n\\n\\t\\tassert_eq!(backend.get::<TestSettings>(\\\"table\\\", \\\"1\\\").await?, None);\\n\\n\\n\\n\\t\\tOk(())\\n\\n\\t}\\n\\n\\n\\n\\t#[tokio::test]\\n\\n\\tasync fn update_and_delete_pretty() -> Result<(), FsError> {\\n\\n\\t\\tlet _lock = TEST_GUARD.lock().await;\\n\\n\\t\\tlet path = TestPath::new(\\\"update_and_delete_pretty\\\", \\\"toml\\\");\\n\\n\\t\\tlet backend = FsBackend::new(TomlTranscoder::pretty(), \\\"toml\\\".to_owned(), &path)?;\\n\\n\\n\\n\\t\\tbackend.init().await?;\\n\\n\\t\\tbackend.create_table(\\\"table\\\").await?;\\n\",\n \"file_path\": \"starchart-backends/src/fs/toml.rs\",\n \"rank\": 96,\n \"score\": 12.462576637271471\n },\n {\n \"content\": \"// Entry helpers\\n\\nimpl<'a, S: Entry, C: CrudOperation> Action<'a, S, C, EntryTarget> {\\n\\n\\t/// Sets the key for the action.\\n\\n\\t///\\n\\n\\t/// Users should prefer to call [`Self::set_entry`] over this, as setting the\\n\\n\\t/// entry will automatically call this.\\n\\n\\t///\\n\\n\\t/// This is unused on [`TargetKind::Table`] actions.\\n\\n\\tpub fn set_key<K: Key>(&mut self, key: &K) -> &mut Self {\\n\\n\\t\\tself.inner.key.replace(key.to_key());\\n\\n\\n\\n\\t\\tself // coverage:ignore-line\\n\\n\\t}\\n\\n\\n\\n\\t/// Sets the data for the action.\\n\\n\\t///\\n\\n\\t/// This is unused on [`TargetKind::Table`] actions.\\n\\n\\tpub fn set_data(&mut self, entity: &'a S) -> &mut Self {\\n\\n\\t\\tself.inner.data.replace(entity);\\n\\n\\n\",\n \"file_path\": \"starchart/src/action/mod.rs\",\n \"rank\": 97,\n \"score\": 12.456296216708289\n },\n {\n \"content\": \"\\t\\tasync move {\\n\\n\\t\\t\\tif !self.has_table(table).await? {\\n\\n\\t\\t\\t\\tself.create_table(table).await?;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tOk(())\\n\\n\\t\\t}\\n\\n\\t\\t.boxed()\\n\\n\\t}\\n\\n\\n\\n\\t/// Gets all entries that match a predicate, to get all entries, use [`get_keys`] first.\\n\\n\\t///\\n\\n\\t/// [`get_keys`]: Self::get_keys\\n\\n\\tfn get_all<'a, D, I>(\\n\\n\\t\\t&'a self,\\n\\n\\t\\ttable: &'a str,\\n\\n\\t\\tentries: &'a [&'a str],\\n\\n\\t) -> GetAllFuture<'a, I, Self::Error>\\n\\n\\twhere\\n\\n\\t\\tD: Entry,\\n\",\n \"file_path\": \"starchart/src/backend/mod.rs\",\n \"rank\": 98,\n \"score\": 12.11439557556566\n },\n {\n \"content\": \"\\n\\n\\t#[tokio::test]\\n\\n\\tasync fn update_and_delete() -> Result<(), FsError> {\\n\\n\\t\\tlet _lock = TEST_GUARD.lock().await;\\n\\n\\t\\tlet path = TestPath::new(\\\"update_and_delete\\\", \\\"json\\\");\\n\\n\\t\\tlet backend = FsBackend::new(JsonTranscoder::default(), \\\"json\\\".to_owned(), &path)?;\\n\\n\\n\\n\\t\\tbackend.init().await?;\\n\\n\\t\\tbackend.create_table(\\\"table\\\").await?;\\n\\n\\n\\n\\t\\tlet mut settings = TestSettings::default();\\n\\n\\n\\n\\t\\tbackend.create(\\\"table\\\", \\\"1\\\", &settings).await?;\\n\\n\\n\\n\\t\\tsettings.opt = None;\\n\\n\\n\\n\\t\\tbackend.update(\\\"table\\\", \\\"1\\\", &settings).await?;\\n\\n\\n\\n\\t\\tassert_eq!(\\n\\n\\t\\t\\tbackend.get::<TestSettings>(\\\"table\\\", \\\"1\\\").await?,\\n\",\n \"file_path\": \"starchart-backends/src/fs/json.rs\",\n \"rank\": 99,\n \"score\": 11.959151527498515\n }\n]","isConversational":false}}},{"rowIdx":1983,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/connectivity/bluetooth/profiles/bt-hfp-audio-gateway/src/peer/procedure/nrec.rs"},"repo_name":{"kind":"string","value":"fabio-d/fuchsia-stardock"},"commit":{"kind":"string","value":"e57f5d1cf015fe2294fc2a5aea704842294318d2"},"file_code":{"kind":"string","value":"\n\nuse super::{Procedure, ProcedureError, ProcedureMarker, ProcedureRequest};\n\nuse crate::peer::{service_level_connection::SlcState, slc_request::SlcRequest, update::AgUpdate};\nuse at_commands as at;\n\n#[derive(Debug, PartialEq, Clone, Copy)]\nenum State {\n \n Start,\n \n SetRequest,\n \n Terminated,\n}\n\nimpl State {\n \n fn transition(&mut self) {\n match *self {\n Self::Start => *self = Self::SetRequest,\n Self::SetRequest => *self = Self::Terminated,\n Self::Terminated => *self = Self::Terminated,\n }\n }\n}\n\n#[derive(Debug)]\npub struct NrecProcedure {\n \n state: State,\n}\n\nimpl NrecProcedure {\n \n pub fn new() -> Self {\n Self { state: State::Start }\n }\n}\n\nimpl Procedure for NrecProcedure {\n fn marker(&self) -> ProcedureMarker {\n ProcedureMarker::Nrec\n }\n\n fn hf_update(&mut self, update: at::Command, _state: &mut SlcState) -> ProcedureRequest {\n match (self.state, update) {\n (State::Start, at::Command::Nrec { nrec: enable }) => {\n self.state.transition();\n let response = Box::new(Into::into);\n SlcRequest::SetNrec { enable, response }.into()\n }\n (_, update) => ProcedureRequest::Error(ProcedureError::UnexpectedHf(update)),\n }\n }\n\n fn ag_update(&mut self, update: AgUpdate, _state: &mut SlcState) -> ProcedureRequest {\n match (self.state, update) {\n (State::SetRequest, update @ AgUpdate::Ok)\n | (State::SetRequest, update @ AgUpdate::Error) => {\n self.state.transition();\n update.into()\n }\n (_, update) => ProcedureRequest::Error(ProcedureError::UnexpectedAg(update)),\n }\n }\n\n fn is_terminated(&self) -> bool {\n self.state == State::Terminated\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use assert_matches::assert_matches;\n\n #[test]\n fn state_transitions() {\n let mut state = State::Start;\n state.transition();\n assert_eq!(state, State::SetRequest);\n state.transition();\n assert_eq!(state, State::Terminated);\n state.transition();\n assert_eq!(state, State::Terminated);\n }\n\n #[test]\n fn correct_marker() {\n let marker = NrecProcedure::new().marker();\n assert_eq!(marker, ProcedureMarker::Nrec);\n }\n\n #[test]\n fn is_terminated_in_terminated_state() {\n let mut proc = NrecProcedure::new();\n assert!(!proc.is_terminated());\n proc.state = State::SetRequest;\n assert!(!proc.is_terminated());\n proc.state = State::Terminated;\n assert!(proc.is_terminated());\n }\n\n #[test]\n fn unexpected_hf_update_returns_error() {\n let mut proc = NrecProcedure::new();\n let mut state = SlcState::default();\n\n \n let random_hf = at::Command::CindRead {};\n assert_matches!(\n proc.hf_update(random_hf, &mut state),\n ProcedureRequest::Error(ProcedureError::UnexpectedHf(_))\n );\n }\n\n #[test]\n fn unexpected_ag_update_returns_error() {\n let mut proc = NrecProcedure::new();\n let mut state = SlcState::default();\n \n let random_ag = AgUpdate::ThreeWaySupport;\n assert_matches!(\n proc.ag_update(random_ag, &mut state),\n ProcedureRequest::Error(ProcedureError::UnexpectedAg(_))\n );\n }\n\n #[test]\n fn updates_produce_expected_requests() {\n let mut proc = NrecProcedure::new();\n let mut state = SlcState::default();\n\n let req = proc.hf_update(at::Command::Nrec { nrec: true }, &mut state);\n let update = match req {\n ProcedureRequest::Request(SlcRequest::SetNrec { enable: true, response }) => {\n response(Ok(()))\n }\n x => panic!(\"Unexpected message: {:?}\", x),\n };\n let req = proc.ag_update(update, &mut state);\n assert_matches!(\n req,\n ProcedureRequest::SendMessages(resp) if resp == vec![at::Response::Ok]\n );\n\n \n assert!(proc.is_terminated());\n assert_matches!(\n proc.hf_update(at::Command::Nrec { nrec: true }, &mut state),\n ProcedureRequest::Error(ProcedureError::UnexpectedHf(_))\n );\n assert_matches!(\n proc.ag_update(AgUpdate::Ok, &mut state),\n ProcedureRequest::Error(ProcedureError::UnexpectedAg(_))\n );\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse super::{Procedure, ProcedureError, ProcedureMarker, ProcedureRequest};\n\nuse crate::peer::{service_level_connection::SlcState, slc_request::SlcRequest, update::AgUpdate};\nuse at_commands as at;\n\n#[derive(Debug, PartialEq, Clone, Copy)]\nenum State {\n \n Start,\n \n SetRequest,\n \n Terminated,\n}\n\nimpl State {\n \n fn transition(&mut self) {\n match *self {\n Self::Start => *self = Self::SetRequest,\n Self::SetRequest => *self = Self::Terminated,\n Self::Terminated => *self = Self::Terminated,\n }\n }\n}\n\n#[derive(Debug)]\npub struct NrecProcedure {\n \n state: State,\n}\n\nimpl NrecProcedure {\n \n pub fn new() -> Self {\n Self { state: State::Start }\n }\n}\n\nimpl Procedure for NrecProcedure {\n fn marker(&self) -> ProcedureMarker {\n ProcedureMarker::Nrec\n }\n\n fn hf_update(&mut self, update: at::Command, _state: &mut SlcState) -> ProcedureRequest {\n match (self.state, update) {\n (State::Start, at::Command::Nrec { nrec: enable }) => {\n self.state.transition();\n let response = Box::new(Into::into);\n SlcRequest::SetNrec { enable, response }.into()\n }\n (_, update) => ProcedureRequest::Error(ProcedureError::UnexpectedHf(update)),\n }\n }\n\n fn ag_update(&mut self, update: AgUpdate, _state: &mut SlcState) -> ProcedureRequest {\n match (self.state, update) {\n (State::SetRequest, update @ AgUpdate::Ok)\n | (State::SetRequest, update @ AgUpdate::Error) => {\n self.state.transition();\n update.into()\n }\n (_, update) => ProcedureRequest::Error(ProcedureError::UnexpectedAg(update)),\n }\n }\n\n fn is_terminated(&self) -> bool {\n self.state == State::Terminated\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use assert_matches::assert_matches;\n\n #[test]\n fn state_transitions() {\n let mut state = State::Start;\n state.transition();\n assert_eq!(state, State::SetRequest);\n state.transition();\n assert_eq!(state, State::Terminated);\n state.transition();\n assert_eq!(state, State::Terminated);\n }\n\n #[test]\n fn correct_marker() {\n let marker = NrecProcedure::new().marker();\n assert_eq!(marker, ProcedureMarker::Nrec);\n }\n\n #[test]\n fn is_terminated_in_terminated_state() {\n let mut proc = NrecProcedure::new();\n assert!(!proc.is_terminated());\n proc.state = State::SetRequest;\n assert!(!proc.is_terminated());\n proc.state = State::Terminated;\n assert!(proc.is_terminated());\n }\n\n #[test]\n fn unexpected_hf_update_returns_error() {\n let mut proc = NrecProcedure::new();\n let mut state = SlcState::default();\n\n \n let random_hf = at::Command::CindRead {};\n assert_matches!(\n proc.hf_update(random_hf, &mut state)"},"suffix":{"kind":"string","value":"eRequest::Error(ProcedureError::UnexpectedAg(_))\n );\n }\n\n #[test]\n fn updates_produce_expected_requests() {\n let mut proc = NrecProcedure::new();\n let mut state = SlcState::default();\n\n let req = proc.hf_update(at::Command::Nrec { nrec: true }, &mut state);\n let update = match req {\n ProcedureRequest::Request(SlcRequest::SetNrec { enable: true, response }) => {\n response(Ok(()))\n }\n x => panic!(\"Unexpected message: {:?}\", x),\n };\n let req = proc.ag_update(update, &mut state);\n assert_matches!(\n req,\n ProcedureRequest::SendMessages(resp) if resp == vec![at::Response::Ok]\n );\n\n \n assert!(proc.is_terminated());\n assert_matches!(\n proc.hf_update(at::Command::Nrec { nrec: true }, &mut state),\n ProcedureRequest::Error(ProcedureError::UnexpectedHf(_))\n );\n assert_matches!(\n proc.ag_update(AgUpdate::Ok, &mut state),\n ProcedureRequest::Error(ProcedureError::UnexpectedAg(_))\n );\n }\n}\n"},"middle":{"kind":"string","value":",\n ProcedureRequest::Error(ProcedureError::UnexpectedHf(_))\n );\n }\n\n #[test]\n fn unexpected_ag_update_returns_error() {\n let mut proc = NrecProcedure::new();\n let mut state = SlcState::default();\n \n let random_ag = AgUpdate::ThreeWaySupport;\n assert_matches!(\n proc.ag_update(random_ag, &mut state),\n Procedur"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1984,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/sstable/writer.rs"},"repo_name":{"kind":"string","value":"ikatson/rust-sstb"},"commit":{"kind":"string","value":"8f2996d4e330dd1e98a16154e5bb38c6f7b81576"},"file_code":{"kind":"string","value":"\n\nuse std::convert::TryFrom;\nuse std::fs::File;\nuse std::io::BufWriter;\nuse std::io::{Seek, SeekFrom, Write};\nuse std::path::Path;\n\nuse bincode;\nuse bloomfilter::Bloom;\n\nuse super::compress_ctx_writer::*;\nuse super::compression;\nuse super::ondisk_format::*;\nuse super::options::*;\nuse super::poswriter::PosWriter;\nuse super::result::Result;\nuse super::types::*;\n\npub trait RawSSTableWriter {\n \n \n \n \n fn set(&mut self, key: &[u8], value: &[u8]) -> Result<()>;\n \n fn close(self) -> Result<()>;\n}\n\npub struct SSTableWriterV2 {\n file: PosWriter<Box<dyn CompressionContextWriter<PosWriter<BufWriter<File>>>>>,\n meta: MetaV3_0,\n meta_start: u64,\n data_start: u64,\n flush_every: usize,\n sparse_index: Vec<(Vec<u8>, u64)>,\n bloom: Bloom<[u8]>,\n}\n\nimpl SSTableWriterV2 {\n \n pub fn new<P: AsRef<Path>>(path: P) -> Result<Self> {\n Self::new_with_options(path, &WriteOptions::default())\n }\n \n pub fn new_with_options<P: AsRef<Path>>(path: P, options: &WriteOptions) -> Result<Self> {\n let file = File::create(path)?;\n let mut writer = PosWriter::new(BufWriter::new(file), 0);\n writer.write_all(MAGIC)?;\n\n bincode::serialize_into(&mut writer, &VERSION_30)?;\n\n let meta_start = writer.current_offset() as u64;\n\n let mut meta = MetaV3_0::default();\n meta.compression = options.compression;\n\n bincode::serialize_into(&mut writer, &meta)?;\n\n let data_start = writer.current_offset() as u64;\n\n let file: Box<dyn CompressionContextWriter<PosWriter<BufWriter<File>>>> =\n match options.compression {\n Compression::None => Box::new(UncompressedWriter::new(writer)),\n Compression::Zlib => Box::new(CompressionContextWriterImpl::new(\n writer,\n compression::ZlibCompressorFactory::new(None),\n )),\n Compression::Snappy => Box::new(CompressionContextWriterImpl::new(\n writer,\n compression::SnappyCompressorFactory::new(),\n )),\n };\n\n Ok(Self {\n \n \n file: PosWriter::new(file, data_start),\n meta,\n meta_start,\n data_start,\n flush_every: options.flush_every,\n sparse_index: Vec::new(),\n bloom: Bloom::new(\n options.bloom.bitmap_size as usize,\n options.bloom.items_count,\n ),\n })\n }\n \n pub fn finish(self) -> Result<()> {\n match self {\n SSTableWriterV2 {\n file,\n mut meta,\n meta_start,\n data_start,\n sparse_index,\n bloom,\n ..\n } => {\n let mut writer = file.into_inner();\n let index_start = self.data_start + writer.reset_compression_context()? as u64;\n for (key, offset) in sparse_index.into_iter() {\n KVOffset::new(key.len(), offset)?.serialize_into(&mut writer)?;\n writer.write_all(&key)?;\n }\n let bloom_start = self.data_start + writer.reset_compression_context()? as u64;\n writer.write_all(&bloom.bitmap())?;\n let end = self.data_start + writer.reset_compression_context()? as u64;\n meta.finished = true;\n meta.index_len = bloom_start - index_start;\n meta.data_len = index_start - data_start;\n meta.bloom_len = end - bloom_start;\n meta.bloom.bitmap_bytes = u32::try_from(bloom.number_of_bits() / 8)?;\n meta.bloom.k_num = bloom.number_of_hash_functions();\n meta.bloom.sip_keys = bloom.sip_keys();\n let mut writer = writer.into_inner()?.into_inner();\n writer.seek(SeekFrom::Start(meta_start as u64))?;\n bincode::serialize_into(&mut writer, &meta)?;\n Ok(())\n }\n }\n }\n}\n\nimpl RawSSTableWriter for SSTableWriterV2 {\n #[allow(clippy::collapsible_if)]\n fn set(&mut self, key: &[u8], value: &[u8]) -> Result<()> {\n \n \n \n let approx_msg_len = key.len() + 5 + value.len();\n\n if self.meta.items == 0 {\n self.sparse_index.push((key.to_owned(), self.data_start));\n } else {\n if self.file.current_offset() + approx_msg_len as u64 >= self.flush_every as u64 {\n let total_offset =\n self.data_start + self.file.get_mut().reset_compression_context()? as u64;\n self.file.reset_offset(0);\n self.sparse_index\n .push((key.to_owned(), total_offset as u64));\n }\n }\n self.bloom.set(key);\n KVLength::new(key.len(), value.len())?.serialize_into(&mut self.file)?;\n self.file.write_all(key)?;\n self.file.write_all(value)?;\n self.meta.items += 1;\n Ok(())\n }\n\n fn close(self) -> Result<()> {\n self.finish()\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::convert::TryFrom;\nuse std::fs::File;\nuse std::io::BufWriter;\nuse std::io::{Seek, SeekFrom, Write};\nuse std::path::Path;\n\nuse bincode;\nuse bloomfilter::Bloom;\n\nuse super::compress_ctx_writer::*;\nuse super::compression;\nuse super::ondisk_format::*;\nuse super::options::*;\nuse super::poswriter::PosWriter;\nuse super::result::Result;\nuse super::types::*;\n\npub trait RawSSTableWriter {\n \n \n \n \n fn set(&mut self, key: &[u8], value: &[u8]) -> Result<()>;\n \n fn close(self) -> Result<()>;\n}\n\npub struct SSTableWriterV2 {\n file: PosWriter<Box<dyn CompressionContextWriter<PosWriter<BufWriter<File>>>>>,\n meta: MetaV3_0,\n meta_start: u64,\n data_start: u64,\n flush_every: usize,\n sparse_index: Vec<(Vec<u8>, u64)>,\n bloom: Bloom<[u8]>,\n}\n\nimpl SSTableWriterV2 {\n \n pub fn new<P: AsRef<Path>>(path: P) -> Result<Self> {\n Self::new_with_options(path, &WriteOptions::default())\n }\n \n pub fn new_with_options<P: AsRef<Path>>(path: P, options: &WriteOptions) -> Result<Self> {\n let file = File::create(path)?;\n let mut writer = PosWriter::new(BufWriter::new(file), 0);\n writer.write_all(MAGIC)?;\n\n bincode::serialize_into(&mut writer, &VERSION_30)?;\n\n let meta_start = writer.current_offset() as u64;\n\n let mut meta = MetaV3_0::default();\n meta.compression = options.compression;\n\n bincode::serialize_into(&mut writer, &meta)?;\n\n let data_start = writer.current_offset() as u64;\n\n let file: Box<dyn CompressionContextWriter<PosWriter<BufWriter<File>>>> =\n match options.compression {\n Compression::None => Box::new(UncompressedWriter::new(writer)),\n Compression::Zlib => Box::new(CompressionContextWriterImpl::new(\n writer,\n compression::ZlibCompressorFactory::new(None),\n )),\n Compression::Snappy => Box::new(CompressionContextWriterImpl::new(\n writer,\n compression::SnappyCompressorFactory::new(),\n )),\n };\n\n Ok(Self {\n \n \n file: PosWriter::new(file, data_start),\n meta,\n meta_start,\n data_start,\n flush_every: options.flush_every,\n sparse_index: Vec::new(),\n bloom: Bloom::new(\n options.bloom.bitmap_size as usize,\n options.bloom.items_count,\n ),\n })\n }\n \n "},"suffix":{"kind":"string","value":"\n}\n\nimpl RawSSTableWriter for SSTableWriterV2 {\n #[allow(clippy::collapsible_if)]\n fn set(&mut self, key: &[u8], value: &[u8]) -> Result<()> {\n \n \n \n let approx_msg_len = key.len() + 5 + value.len();\n\n if self.meta.items == 0 {\n self.sparse_index.push((key.to_owned(), self.data_start));\n } else {\n if self.file.current_offset() + approx_msg_len as u64 >= self.flush_every as u64 {\n let total_offset =\n self.data_start + self.file.get_mut().reset_compression_context()? as u64;\n self.file.reset_offset(0);\n self.sparse_index\n .push((key.to_owned(), total_offset as u64));\n }\n }\n self.bloom.set(key);\n KVLength::new(key.len(), value.len())?.serialize_into(&mut self.file)?;\n self.file.write_all(key)?;\n self.file.write_all(value)?;\n self.meta.items += 1;\n Ok(())\n }\n\n fn close(self) -> Result<()> {\n self.finish()\n }\n}\n"},"middle":{"kind":"string","value":"pub fn finish(self) -> Result<()> {\n match self {\n SSTableWriterV2 {\n file,\n mut meta,\n meta_start,\n data_start,\n sparse_index,\n bloom,\n ..\n } => {\n let mut writer = file.into_inner();\n let index_start = self.data_start + writer.reset_compression_context()? as u64;\n for (key, offset) in sparse_index.into_iter() {\n KVOffset::new(key.len(), offset)?.serialize_into(&mut writer)?;\n writer.write_all(&key)?;\n }\n let bloom_start = self.data_start + writer.reset_compression_context()? as u64;\n writer.write_all(&bloom.bitmap())?;\n let end = self.data_start + writer.reset_compression_context()? as u64;\n meta.finished = true;\n meta.index_len = bloom_start - index_start;\n meta.data_len = index_start - data_start;\n meta.bloom_len = end - bloom_start;\n meta.bloom.bitmap_bytes = u32::try_from(bloom.number_of_bits() / 8)?;\n meta.bloom.k_num = bloom.number_of_hash_functions();\n meta.bloom.sip_keys = bloom.sip_keys();\n let mut writer = writer.into_inner()?.into_inner();\n writer.seek(SeekFrom::Start(meta_start as u64))?;\n bincode::serialize_into(&mut writer, &meta)?;\n Ok(())\n }\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Find the key in the chunk by scanning sequentially.\n\n///\n\n/// This assumes the chunk was fetched from disk and has V1 ondisk format.\n\n///\n\n/// Returns the start and end index of the value.\n\n///\n\n/// TODO: this probably belongs in \"ondisk\" for version V1.\n\npub fn find_value_offset_v2(buf: &[u8], key: &[u8]) -> Result<Option<(usize, usize)>> {\n\n macro_rules! buf_get {\n\n ($x:expr) => {{\n\n buf.get($x).ok_or(INVALID_DATA)?\n\n }};\n\n }\n\n\n\n let kvlen_encoded_size = KVLength::encoded_size();\n\n\n\n let mut offset = 0;\n\n while offset < buf.len() {\n\n let kvlength = bincode::deserialize::<KVLength>(&buf)?;\n\n let (start_key, cursor) = {\n\n let key_start = offset + kvlen_encoded_size;\n\n let key_end = key_start + kvlength.key_length as usize;\n\n (buf_get!(key_start..key_end), key_end)\n\n };\n\n\n\n let (start, end) = {\n\n let value_end = cursor + kvlength.value_length as usize;\n","file_path":"src/sstable/ondisk_format.rs","rank":0,"score":226046.14298968075},{"content":"/// Read the bloom filter from a reader.\n\nfn read_bloom<R: Read>(mut reader: R, config: &BloomV3_0) -> Result<Bloom<[u8]>> {\n\n let len_bytes = usize::try_from(config.bitmap_bytes)?;\n\n // I don't think there's a way not to do this allocation.\n\n let mut buf = vec![0u8; len_bytes];\n\n reader.read_exact(&mut buf)?;\n\n Ok(Bloom::from_existing(\n\n &buf,\n\n config.bitmap_bytes as u64 * 8,\n\n config.k_num,\n\n config.sip_keys,\n\n ))\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":1,"score":154394.13033039993},{"content":"fn pread_exact(fd: RawFd, mut offset: u64, length: u64) -> Result<Vec<u8>> {\n\n // if this was mmaped, there will be no truncation.\n\n #[allow(clippy::cast_possible_truncation)]\n\n let mut buf = vec![0_u8; length as usize];\n\n let mut remaining = length;\n\n while remaining > 0 {\n\n let size = pread(fd, &mut buf, i64::try_from(offset)?)? as u64;\n\n if size == 0 {\n\n return Err(error::INVALID_DATA);\n\n }\n\n remaining -= size;\n\n offset += size;\n\n }\n\n Ok(buf)\n\n}\n\n\n","file_path":"src/sstable/concurrent_page_cache.rs","rank":2,"score":149888.55622072855},{"content":"// Read metadata of any format (only V1 is supported now) from a reader.\n\n// This will fail if the file is not a valid sstable.\n\nfn read_metadata<B: Read + Seek>(mut file: B) -> Result<MetaResult> {\n\n file.seek(SeekFrom::Start(0))?;\n\n let mut reader = posreader::PosReader::new(BufReader::new(file), 0);\n\n let mut buf = [0; MAGIC.len()];\n\n if reader.read(&mut buf)? != MAGIC.len() {\n\n return Err(Error::InvalidData(\"not an sstable\"));\n\n }\n\n if buf != MAGIC {\n\n return Err(Error::InvalidData(\"not an sstable\"));\n\n }\n\n let version: Version = bincode::deserialize_from(&mut reader)?;\n\n let meta = match version {\n\n VERSION_30 => {\n\n let meta: MetaV3_0 = bincode::deserialize_from(&mut reader)?;\n\n MetaData::V3_0(meta)\n\n }\n\n _ => return Err(Error::UnsupportedVersion(version)),\n\n };\n\n\n\n let offset = reader.current_offset();\n\n let mut file = reader.into_inner().into_inner();\n\n file.seek(SeekFrom::Start(offset as u64))?;\n\n\n\n Ok(MetaResult { meta, offset })\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":3,"score":149503.60750560224},{"content":"/// A writer that maybe compresses the input.\n\n///\n\n/// The difference with a regular writer, is that if you call reset_compression_context()\n\n/// all compression state will be reset and flushed, and the offset in the underlying\n\n/// writer will be returned.\n\npub trait CompressionContextWriter<I: Write>: Write {\n\n /// Reset and flush compression state.\n\n ///\n\n /// It must be possible to read from the returned offset with a newly\n\n /// created decompressor.\n\n ///\n\n /// Returns number of bytes written so far, i.e. relative offset\n\n /// from the creation of Self.\n\n fn reset_compression_context(&mut self) -> Result<usize>;\n\n fn into_inner(self: Box<Self>) -> Result<I>;\n\n}\n\n\n\npub struct UncompressedWriter<W> {\n\n writer: PosWriter<W>,\n\n}\n\n\n\nimpl<W> UncompressedWriter<W> {\n\n pub fn new(writer: W) -> Self {\n\n UncompressedWriter {\n\n writer: PosWriter::new(writer, 0),\n","file_path":"src/sstable/compress_ctx_writer.rs","rank":4,"score":149128.62453828414},{"content":"/// A convenience function to write a btree map to a file.\n\n///\n\n///\n\n/// Example:\n\n/// ```\n\n/// use std::collections::BTreeMap;\n\n/// use sstb::sstable::{write_btree_map, WriteOptions};\n\n///\n\n/// let mut map = BTreeMap::new();\n\n/// let filename = \"/tmp/some-sstable\";\n\n/// let write_options = WriteOptions::default();\n\n///\n\n/// map.insert(b\"foo\", b\"some foo\");\n\n/// map.insert(b\"bar\", b\"some bar\");\n\n/// write_btree_map(&map, filename, Some(write_options)).unwrap();\n\n/// ```\n\npub fn write_btree_map<K: AsRef<[u8]>, V: AsRef<[u8]>, P: AsRef<Path>>(\n\n map: &BTreeMap<K, V>,\n\n filename: P,\n\n options: Option<WriteOptions>,\n\n) -> Result<()> {\n\n let options = options.unwrap_or_default();\n\n let mut writer = writer::SSTableWriterV2::new_with_options(filename, &options)?;\n\n\n\n for (key, value) in map.iter() {\n\n writer.set(key.as_ref(), value.as_ref())?;\n\n }\n\n writer.close()?;\n\n Ok(())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::collections::BTreeMap;\n\n\n","file_path":"src/sstable/mod.rs","rank":5,"score":143596.56735375128},{"content":"pub trait Compressor<W: Write>: Write {\n\n fn into_inner(self) -> Result<W>;\n\n}\n\n\n","file_path":"src/sstable/compression.rs","rank":6,"score":126900.99306293768},{"content":"pub trait CompressorFactory<W: Write, C: Compressor<W>> {\n\n fn from_writer(&self, writer: W) -> C;\n\n}\n\n\n","file_path":"src/sstable/compression.rs","rank":8,"score":100192.30168054218},{"content":"struct MetaResult {\n\n meta: MetaData,\n\n offset: usize,\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":9,"score":99681.86247595647},{"content":"#[cfg(test)]\n\npub fn get_current_pid_rss() -> usize {\n\n let pid = format!(\"{}\", std::process::id());\n\n let out = std::process::Command::new(\"ps\")\n\n .args(&[\"-p\", &pid, \"-o\", \"rss\"])\n\n .output()\n\n .unwrap();\n\n let out = String::from_utf8(out.stdout).unwrap();\n\n let pid_line = out.lines().nth(1).unwrap();\n\n pid_line.trim().parse::<usize>().unwrap()\n\n}\n","file_path":"src/utils/mod.rs","rank":10,"score":99084.9410414474},{"content":"/// Find the potential start and end offsets of the key.\n\n/// This will be used later to fetch the chunk from the page cache.\n\nfn find_bounds<K, T>(map: &BTreeMap<K, T>, key: &[u8], end_default: T) -> Option<(T, T)>\n\nwhere\n\n K: Borrow<[u8]> + std::cmp::Ord,\n\n T: Copy,\n\n{\n\n use std::ops::Bound;\n\n\n\n let start = {\n\n let mut iter_left = map.range::<[u8], _>((Bound::Unbounded, Bound::Included(key)));\n\n let closest_left = iter_left.next_back();\n\n match closest_left {\n\n Some((_, offset)) => *offset,\n\n None => return None,\n\n }\n\n };\n\n\n\n let end = {\n\n let mut iter_right = map.range::<[u8], _>((Bound::Excluded(key), Bound::Unbounded));\n\n let closest_right = iter_right.next();\n\n match closest_right {\n\n Some((_, offset)) => *offset,\n\n None => end_default,\n\n }\n\n };\n\n Some((start, end))\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":11,"score":98152.77994097568},{"content":"pub trait Uncompress {\n\n fn uncompress(&self, buf: &[u8]) -> Result<Vec<u8>>;\n\n}\n\n\n\n/// ZLIB\n\npub struct ZlibCompressorFactory<W: Write> {\n\n compression: flate2::Compression,\n\n marker: std::marker::PhantomData<W>,\n\n}\n\n\n\npub struct ZlibCompressor<W: Write> {\n\n inner: flate2::write::ZlibEncoder<W>,\n\n}\n\n\n\npub struct ZlibUncompress {}\n\n\n\nimpl<W: Write> ZlibCompressor<W> {\n\n pub fn new(writer: W, compression: flate2::Compression) -> Self {\n\n Self {\n\n inner: flate2::write::ZlibEncoder::new(writer, compression),\n","file_path":"src/sstable/compression.rs","rank":12,"score":87699.504242712},{"content":"/// PageCache is something that can get byte chunks of a given length, given an offset.\n\n///\n\n/// This is used for 2 purposes: reading from disk, and optionally uncompressing the\n\n/// chunk that was read from disk.\n\n///\n\n/// If compression is used, there are 2 PageCache objects used - one to read from disk\n\n/// (or mmap buffer), and another to uncompress that and cache the result.\n\n/// In the latter case, the outer PageCache wraps the inner one.\n\n///\n\n/// Note, that this cannot be used concurrently, note the &mut self. For concurrent use,\n\n/// more complicated concurrent cache can be used, from another file.\n\npub trait PageCache {\n\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]>;\n\n}\n\n\n\n/// This is used to read from the mmap'ed region. It's a mere proxy to the slice.\n\npub struct StaticBufCache {\n\n buf: &'static [u8],\n\n}\n\n\n\nimpl StaticBufCache {\n\n pub fn new(buf: &'static [u8]) -> Self {\n\n Self { buf }\n\n }\n\n pub fn get_buf(&self) -> &'static [u8] {\n\n self.buf\n\n }\n\n}\n\n\n\nimpl PageCache for StaticBufCache {\n\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\n","file_path":"src/sstable/page_cache.rs","rank":13,"score":83456.5879590894},{"content":"pub trait ConcurrentPageCache {\n\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes>;\n\n}\n\n\n\nimpl ConcurrentPageCache for page_cache::StaticBufCache {\n\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\n\n // if this was mmaped, there will be no truncation.\n\n #[allow(clippy::cast_possible_truncation)]\n\n self.get_buf()\n\n .get(offset as usize..(offset + length) as usize)\n\n .map(Bytes::from_static)\n\n .ok_or(error::INVALID_DATA)\n\n }\n\n}\n\n\n\npub struct FileBackedPageCache {\n\n file: File,\n\n caches: ConcurrentLRUCache,\n\n}\n\n\n","file_path":"src/sstable/concurrent_page_cache.rs","rank":14,"score":79819.41174252215},{"content":"fn compare_with_others(c: &mut Criterion) {\n\n let size = 100_000;\n\n use rocksdb::{DBCompressionType, Options, DB};\n\n let path = \"/tmp/sstb\";\n\n let rocks_path = \"/tmp/rocksdb-rust-lsm\";\n\n\n\n let bench = |group: &mut BenchmarkGroup<_>, state: &TestState, suffix: f32, threads| {\n\n let pool = rayon::ThreadPoolBuilder::new()\n\n .num_threads(threads)\n\n .build()\n\n .unwrap();\n\n\n\n for (name, opts) in [\n\n (\"rocksdb,mmap-reads,no-compression\", {\n\n let mut opts = Options::default();\n\n opts.set_compression_type(DBCompressionType::None);\n\n opts.set_allow_mmap_reads(true);\n\n opts.create_if_missing(true);\n\n opts\n\n }),\n","file_path":"benches/sstable_implementations.rs","rank":15,"score":78872.30058336235},{"content":"fn criterion_benchmark(c: &mut Criterion) {\n\n let make_write_opts = |compression, flush| {\n\n WriteOptions::default()\n\n .compression(compression)\n\n .flush_every(flush)\n\n .clone()\n\n };\n\n let filename = \"/tmp/sstable\";\n\n let variants = vec![\n\n (\n\n \"mmap,compress=none,flush=4096,nocache\",\n\n make_write_opts(Compression::None, 4096),\n\n ReadOptions::default().cache(None).use_mmap(true).clone(),\n\n ),\n\n (\n\n \"mmap,compress=none,flush=4096,nocache,use_bloom=false\",\n\n make_write_opts(Compression::None, 4096),\n\n ReadOptions::default()\n\n .cache(None)\n\n .use_mmap(true)\n","file_path":"benches/sstable_implementations.rs","rank":16,"score":78872.30058336235},{"content":"/// An efficient way to deserialize and NOT fail when the reader is at EOF right\n\n/// from the start, without any allocations.\n\npub fn deserialize_from_eof_is_ok<T: serde::de::DeserializeOwned, R: Read>(\n\n reader: R,\n\n) -> Result<Option<T>> {\n\n let mut pr = PosReader::new(reader, 0);\n\n let result = bincode::deserialize_from::<_, T>(&mut pr);\n\n match result {\n\n Ok(val) => Ok(Some(val)),\n\n Err(e) => match &*e {\n\n bincode::ErrorKind::Io(ioe) => {\n\n if ioe.kind() == std::io::ErrorKind::UnexpectedEof && pr.current_offset() == 0 {\n\n // This is actually fine and we hit EOF right away.\n\n return Ok(None);\n\n }\n\n Err(e.into())\n\n }\n\n _ => Err(e.into()),\n\n },\n\n }\n\n}\n","file_path":"src/sstable/utils.rs","rank":17,"score":60056.949478944414},{"content":"/// An object that can find the potential start and end offsets of the key.\n\n///\n\n/// A trait is used instead of a struct cause we have multiple implementations,\n\n/// owning and not owning.\n\ntrait Index {\n\n fn find_bounds(&self, key: &[u8], end_default: u64) -> Option<(u64, u64)>;\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":18,"score":47266.146714013434},{"content":"struct KV {\n\n key: Vec<u8>,\n\n is_present: bool,\n\n}\n\n\n","file_path":"benches/sstable_implementations.rs","rank":19,"score":47255.12218825896},{"content":"/// An index that is used with Mmap blocks.\n\nstruct MemIndex {\n\n index: BTreeMap<&'static [u8], u64>,\n\n}\n\n\n\nimpl MemIndex {\n\n fn from_static_buf(buf: &'static [u8], expected_len: u64) -> Result<Self> {\n\n // Build the index from mmap here.\n\n let mut index = BTreeMap::new();\n\n let mut index_data = &buf[..];\n\n if index_data.len() as u64 != expected_len {\n\n return Err(Error::InvalidData(\"invalid index length\"));\n\n }\n\n\n\n let kvoffset_encoded_size = KVOffset::encoded_size();\n\n\n\n while !index_data.is_empty() {\n\n let kvoffset = bincode::deserialize::<KVOffset>(\n\n index_data\n\n .get(..kvoffset_encoded_size)\n\n .ok_or(INVALID_DATA)?,\n","file_path":"src/sstable/reader.rs","rank":20,"score":46047.24577421584},{"content":"struct Inner {\n\n value: RwLock<Option<Bytes>>,\n\n}\n\n\n\nimpl Inner {\n\n fn new() -> Self {\n\n Self {\n\n value: RwLock::new(None),\n\n }\n\n }\n\n fn get_or_insert<F>(&self, func: F) -> Result<Bytes>\n\n where\n\n F: Fn() -> Result<Bytes>,\n\n {\n\n {\n\n let g = self.value.read();\n\n if let Some(bytes) = g.as_ref() {\n\n return Ok(bytes.clone());\n\n }\n\n }\n","file_path":"src/sstable/concurrent_lru.rs","rank":21,"score":46044.11570010401},{"content":"struct OwnedIndex {\n\n index: BTreeMap<Vec<u8>, u64>,\n\n}\n\n\n\nimpl OwnedIndex {\n\n fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n\n let mut index = BTreeMap::new();\n\n\n\n loop {\n\n let kvoffset = KVOffset::deserialize_from_eof_is_ok(&mut reader)?;\n\n let kvoffset = match kvoffset {\n\n Some(kvoffset) => kvoffset,\n\n None => break,\n\n };\n\n let mut key = vec![0; kvoffset.key_length as usize];\n\n reader.read_exact(&mut key)?;\n\n index.insert(key, kvoffset.offset);\n\n }\n\n Ok(Self { index })\n\n }\n","file_path":"src/sstable/reader.rs","rank":22,"score":46044.11570010401},{"content":"struct TestState {\n\n sorted_iter: SortedBytesIterator,\n\n shuffled: Vec<KV>,\n\n}\n\n\n\nimpl TestState {\n\n fn new(len: usize, limit: usize, percent_missing: f32) -> Self {\n\n let mut it = SortedBytesIterator::new(len, limit).unwrap();\n\n let shuffled = {\n\n let mut shuffled: Vec<KV> = Vec::with_capacity(limit * 2);\n\n let mut small_rng = SmallRng::from_seed(*b\"seedseedseedseed\");\n\n let missing_threshold = u32::max_value() as f64 * percent_missing as f64;\n\n let missing_threshold = if missing_threshold > u32::max_value() as f64 {\n\n u32::max_value()\n\n } else if missing_threshold < 0. {\n\n 0\n\n } else {\n\n missing_threshold as u32\n\n };\n\n while let Some(value) = it.next() {\n","file_path":"benches/sstable_implementations.rs","rank":23,"score":46044.11570010401},{"content":"struct InnerReader {\n\n index: Box<dyn Index>,\n\n // This is just to hold an mmap reference to be dropped in the end.\n\n _mmap: Option<memmap::Mmap>,\n\n page_cache: Box<dyn page_cache::PageCache>,\n\n meta: MetaV3_0,\n\n data_start: u64,\n\n use_bloom_default: bool,\n\n bloom: Bloom<[u8]>,\n\n}\n\n\n\nimpl InnerReader {\n\n pub fn new(\n\n mut file: File,\n\n data_start: u64,\n\n meta: MetaResult,\n\n opts: &ReadOptions,\n\n ) -> Result<Self> {\n\n #[allow(clippy::infallible_destructuring_match)]\n\n let meta = match meta.meta {\n","file_path":"src/sstable/reader.rs","rank":24,"score":46044.11570010401},{"content":"struct ConcurrentInnerReader {\n\n index: Box<dyn Index + Sync + Send>,\n\n // This is just to hold an mmap reference to be dropped in the end.\n\n _mmap: Option<memmap::Mmap>,\n\n page_cache: Box<dyn concurrent_page_cache::ConcurrentPageCache + Sync + Send>,\n\n meta: MetaV3_0,\n\n data_start: u64,\n\n use_bloom_default: bool,\n\n bloom: Bloom<[u8]>,\n\n}\n\n\n\nimpl ConcurrentInnerReader {\n\n pub fn new(\n\n mut file: File,\n\n data_start: u64,\n\n meta: MetaResult,\n\n opts: &ReadOptions,\n\n ) -> Result<Self> {\n\n #[allow(clippy::infallible_destructuring_match)]\n\n let meta = match meta.meta {\n","file_path":"src/sstable/reader.rs","rank":25,"score":44933.85874728962},{"content":"fn default_criterion() -> Criterion {\n\n Criterion::default().sample_size(10)\n\n}\n\n\n\ncriterion_group! {\n\n name = sstable;\n\n config = default_criterion();\n\n targets = criterion_benchmark, compare_with_others\n\n}\n\n\n\ncriterion_main!(sstable);\n","file_path":"benches/sstable_implementations.rs","rank":26,"score":42295.093529176964},{"content":"use super::error::Error;\n\n\n\npub type Result<T> = core::result::Result<T, Error>;\n","file_path":"src/sstable/result.rs","rank":27,"score":29317.43946709647},{"content":"/// Options for writing sstables.\n\n#[derive(Debug, Copy, Clone)]\n\npub struct WriteOptions {\n\n /// Compression to use. The default is None.\n\n pub compression: Compression,\n\n /// How often to store the records in the index.\n\n pub flush_every: usize,\n\n /// Options for the bloom filter.\n\n pub bloom: BloomConfig,\n\n}\n\n\n\nimpl WriteOptions {\n\n pub fn new() -> Self {\n\n Self::default()\n\n }\n\n pub fn compression(&mut self, compression: Compression) -> &mut Self {\n\n self.compression = compression;\n\n self\n\n }\n\n pub fn flush_every(&mut self, flush_every: usize) -> &mut Self {\n","file_path":"src/sstable/options.rs","rank":28,"score":29171.070798337314},{"content":"}\n\n\n\nimpl ReadOptions {\n\n pub fn new() -> Self {\n\n Self::default()\n\n }\n\n pub fn cache(&mut self, cache: Option<ReadCache>) -> &mut Self {\n\n self.cache = cache;\n\n self\n\n }\n\n pub fn use_mmap(&mut self, use_mmap: bool) -> &mut Self {\n\n self.use_mmap = use_mmap;\n\n self\n\n }\n\n pub fn use_bloom(&mut self, use_bloom: bool) -> &mut Self {\n\n self.use_bloom = use_bloom;\n\n self\n\n }\n\n pub fn thread_buckets(&mut self, thread_buckets: Option<usize>) -> &mut Self {\n\n self.thread_buckets = thread_buckets;\n","file_path":"src/sstable/options.rs","rank":29,"score":29169.921276512807},{"content":" pub use_bloom: bool,\n\n}\n\n\n\nimpl GetOptions {\n\n pub fn new() -> Self {\n\n Self::default()\n\n }\n\n pub fn use_bloom(&mut self, use_bloom: bool) -> &mut Self {\n\n self.use_bloom = use_bloom;\n\n self\n\n }\n\n}\n\n\n\nimpl Default for GetOptions {\n\n fn default() -> Self {\n\n Self { use_bloom: true }\n\n }\n\n}\n","file_path":"src/sstable/options.rs","rank":30,"score":29169.4164442337},{"content":" self.flush_every = flush_every;\n\n self\n\n }\n\n pub fn bloom(&mut self, bloom: BloomConfig) -> &mut Self {\n\n self.bloom = bloom;\n\n self\n\n }\n\n}\n\n\n\nimpl Default for WriteOptions {\n\n fn default() -> Self {\n\n WriteOptions {\n\n compression: Compression::None,\n\n flush_every: 4096,\n\n bloom: BloomConfig::default(),\n\n }\n\n }\n\n}\n\n\n\n/// Configures the caches for reading.\n","file_path":"src/sstable/options.rs","rank":31,"score":29166.11537678911},{"content":"impl Default for ReadCache {\n\n fn default() -> Self {\n\n Self::Unbounded\n\n }\n\n}\n\n\n\n/// Options for reading sstables.\n\n#[derive(Copy, Clone, Debug)]\n\npub struct ReadOptions {\n\n /// The caching strategy to use.\n\n pub cache: Option<ReadCache>,\n\n /// If mmap can be used for reading the sstable from disk.\n\n pub use_mmap: bool,\n\n /// How many buckets to split the caches into for efficient\n\n /// thread-safe access.\n\n pub thread_buckets: Option<usize>,\n\n // Set if you want to use bloom filters during lookups.\n\n // This has a performance penalty for positive lookups,\n\n // but if you have a lot of maybe-negative, it should make things faster.\n\n pub use_bloom: bool,\n","file_path":"src/sstable/options.rs","rank":32,"score":29163.56029398526},{"content":"use super::types::Compression;\n\n\n\nuse lru::LruCache;\n\n\n\n// The configuration for the bloom filter.\n\n#[derive(Debug, Copy, Clone)]\n\npub struct BloomConfig {\n\n pub bitmap_size: u32,\n\n pub items_count: usize,\n\n}\n\n\n\nimpl Default for BloomConfig {\n\n fn default() -> Self {\n\n return Self {\n\n bitmap_size: 1_000_000,\n\n items_count: 1_000_000,\n\n };\n\n }\n\n}\n\n\n","file_path":"src/sstable/options.rs","rank":33,"score":29162.833521798046},{"content":" self\n\n }\n\n}\n\n\n\nimpl Default for ReadOptions {\n\n fn default() -> Self {\n\n Self {\n\n cache: Some(ReadCache::default()),\n\n use_mmap: true,\n\n thread_buckets: Some(num_cpus::get()),\n\n use_bloom: true,\n\n }\n\n }\n\n}\n\n\n\n/// Options for \"get\" method.\n\n#[derive(Copy, Clone, Debug)]\n\npub struct GetOptions {\n\n /// Set this if you want to use the bloom filter to speed\n\n /// up negative lookups at a cost for positive lookup.\n","file_path":"src/sstable/options.rs","rank":34,"score":29161.85172921269},{"content":"#[derive(Copy, Clone, Debug)]\n\npub enum ReadCache {\n\n // How many chunks(blocks) to store in LRU.\n\n Blocks(usize),\n\n // Unbounded cache, the default.\n\n Unbounded,\n\n}\n\n\n\nimpl ReadCache {\n\n pub fn lru<K, V>(&self) -> LruCache<K, V>\n\n where\n\n K: std::cmp::Eq + std::hash::Hash,\n\n {\n\n match self {\n\n Self::Blocks(b) => LruCache::new(*b),\n\n Self::Unbounded => LruCache::unbounded(),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/sstable/options.rs","rank":35,"score":29157.38783519341},{"content":"enum MetaData {\n\n V3_0(MetaV3_0),\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":44,"score":26873.747280632982},{"content":" }\n\n }\n\n}\n\n\n\nimpl<W: Write> Write for UncompressedWriter<W> {\n\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\n\n self.writer.write(buf)\n\n }\n\n\n\n fn flush(&mut self) -> std::io::Result<()> {\n\n self.writer.flush()\n\n }\n\n}\n\n\n\nimpl<W: Write> CompressionContextWriter<W> for UncompressedWriter<W> {\n\n fn reset_compression_context(&mut self) -> Result<usize> {\n\n Ok(usize::try_from(self.writer.current_offset())?)\n\n }\n\n fn into_inner(self: Box<Self>) -> Result<W> {\n\n Ok(self.writer.into_inner())\n","file_path":"src/sstable/compress_ctx_writer.rs","rank":45,"score":26448.86784154131},{"content":" factory,\n\n _w: std::marker::PhantomData {},\n\n }\n\n }\n\n fn get_mut_compressor(&mut self) -> Result<&mut C> {\n\n Ok(self.compressor.as_mut().ok_or(COMPRESSOR_MISSING)?)\n\n }\n\n}\n\n\n\nimpl<F, C, W> Write for CompressionContextWriterImpl<F, C, W>\n\nwhere\n\n F: CompressorFactory<PosWriter<W>, C>,\n\n W: Write,\n\n C: Compressor<PosWriter<W>>,\n\n{\n\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\n\n self.get_mut_compressor().unwrap().write(buf)\n\n }\n\n\n\n fn flush(&mut self) -> std::io::Result<()> {\n","file_path":"src/sstable/compress_ctx_writer.rs","rank":46,"score":26444.436398103826},{"content":" self.get_mut_compressor().unwrap().flush()\n\n }\n\n}\n\n\n\nimpl<F, C, W> CompressionContextWriter<W> for CompressionContextWriterImpl<F, C, W>\n\nwhere\n\n F: CompressorFactory<PosWriter<W>, C>,\n\n W: Write,\n\n C: Compressor<PosWriter<W>>,\n\n{\n\n fn reset_compression_context(&mut self) -> Result<usize> {\n\n let enc = self.compressor.take().ok_or(COMPRESSOR_MISSING)?;\n\n let pos_writer = enc.into_inner()?;\n\n let offset = pos_writer.current_offset();\n\n self.compressor\n\n .replace(self.factory.from_writer(pos_writer));\n\n Ok(usize::try_from(offset)?)\n\n }\n\n fn into_inner(mut self: Box<Self>) -> Result<W> {\n\n let enc = self.compressor.take().ok_or(COMPRESSOR_MISSING)?;\n\n Ok(enc.into_inner()?.into_inner())\n\n }\n\n}\n","file_path":"src/sstable/compress_ctx_writer.rs","rank":47,"score":26441.998195117983},{"content":" }\n\n}\n\n\n\n/// A version of CompressionContextWriter that knows\n\n/// how to create new compressors (encoders) from a factory.\n\npub struct CompressionContextWriterImpl<F, C, W> {\n\n factory: F,\n\n compressor: Option<C>,\n\n _w: std::marker::PhantomData<W>,\n\n}\n\n\n\nimpl<F, C, W> CompressionContextWriterImpl<F, C, W>\n\nwhere\n\n F: CompressorFactory<PosWriter<W>, C>,\n\n W: Write,\n\n C: Compressor<PosWriter<W>>,\n\n{\n\n pub fn new(writer: W, factory: F) -> Self {\n\n Self {\n\n compressor: Some(factory.from_writer(PosWriter::new(writer, 0))),\n","file_path":"src/sstable/compress_ctx_writer.rs","rank":48,"score":26440.81215867089},{"content":"use std::io::Write;\n\n\n\nuse super::compression::*;\n\nuse super::poswriter::PosWriter;\n\nuse super::{Error, Result};\n\nuse std::convert::TryFrom;\n\n\n\nconst COMPRESSOR_MISSING: Error = Error::ProgrammingError(\"compressor missing\");\n\n\n\n/// A writer that maybe compresses the input.\n\n///\n\n/// The difference with a regular writer, is that if you call reset_compression_context()\n\n/// all compression state will be reset and flushed, and the offset in the underlying\n\n/// writer will be returned.\n","file_path":"src/sstable/compress_ctx_writer.rs","rank":49,"score":26436.94059188318},{"content":" bloom: Bloom<[u8]>,\n\n}\n\n\n\nimpl MmapUncompressedSSTableReader {\n\n /// Construct a new mmap reader from a file with default options.\n\n ///\n\n /// `new_with_options` has more details.\n\n pub fn new<P: AsRef<Path>>(filename: P) -> Result<Self> {\n\n Self::new_with_options(filename, &ReadOptions::default())\n\n }\n\n\n\n /// Construct a new mmap reader from a file.\n\n ///\n\n /// All options except \"use_bloom\" are ignored.\n\n ///\n\n /// Returns `Error::CantUseCompressedFileWithMultiThreadedMmap` if you try to open a compressed file with it.\n\n pub fn new_with_options<P: AsRef<Path>>(filename: P, opts: &ReadOptions) -> Result<Self> {\n\n let mut file = File::open(filename)?;\n\n let meta = read_metadata(&mut file)?;\n\n let data_start = meta.offset as u64;\n","file_path":"src/sstable/reader.rs","rank":50,"score":28.265756371482908},{"content":" &mut self,\n\n key: &[u8],\n\n options: Option<GetOptions>,\n\n ) -> Result<Option<&[u8]>> {\n\n let use_bloom = options\n\n .map(|o| o.use_bloom)\n\n .unwrap_or(self.use_bloom_default);\n\n if use_bloom && !self.bloom.check(key) {\n\n return Ok(None);\n\n }\n\n let index_start = self.data_start + self.meta.data_len as u64;\n\n let (offset, right_bound) = match self.index.find_bounds(key, index_start) {\n\n Some(v) => v,\n\n None => return Ok(None),\n\n };\n\n\n\n let chunk = self.page_cache.get_chunk(offset, right_bound - offset)?;\n\n Ok(find_value_offset_v2(chunk, key)?.map(|(start, end)| &chunk[start..end]))\n\n }\n\n\n\n fn get(&mut self, key: &[u8]) -> Result<Option<&[u8]>> {\n\n self.get_with_options(key, None)\n\n }\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":51,"score":25.886616275571},{"content":" pub key_length: KeyLength,\n\n pub value_length: ValueLength,\n\n}\n\n\n\nimpl KVLength {\n\n pub fn new(k: usize, v: usize) -> Result<Self> {\n\n Ok(Self {\n\n key_length: KeyLength::try_from(k).map_err(|_| Error::KeyTooLong(k))?,\n\n value_length: ValueLength::try_from(v).map_err(|_| Error::ValueTooLong(v))?,\n\n })\n\n }\n\n pub const fn encoded_size() -> usize {\n\n // can't use sizeof Self as bincode has no padding while the struct might.\n\n size_of::<KeyLength>() + size_of::<ValueLength>()\n\n }\n\n pub fn serialize_into<W: Write>(&self, w: W) -> Result<()> {\n\n Ok(bincode::serialize_into(w, self)?)\n\n }\n\n}\n\n\n","file_path":"src/sstable/ondisk_format.rs","rank":52,"score":25.67458738077324},{"content":" &mut self.w\n\n }\n\n pub fn into_inner(self) -> W {\n\n self.w\n\n }\n\n}\n\n\n\nimpl<W: Write> Write for PosWriter<W> {\n\n fn write(&mut self, buf: &[u8]) -> Result<usize> {\n\n let l = self.w.write(buf)?;\n\n self.offset += l as u64;\n\n Ok(l)\n\n }\n\n\n\n fn flush(&mut self) -> Result<()> {\n\n self.w.flush()\n\n }\n\n}\n","file_path":"src/sstable/poswriter.rs","rank":53,"score":24.40421104581772},{"content":" })\n\n }\n\n\n\n pub fn get<'a>(&'a self, key: &[u8]) -> Result<Option<&'a [u8]>> {\n\n self.get_with_options(key, None)\n\n }\n\n\n\n /// Get a key from the sstable with options.\n\n pub fn get_with_options<'a>(\n\n &'a self,\n\n key: &[u8],\n\n options: Option<GetOptions>,\n\n ) -> Result<Option<&'a [u8]>> {\n\n let use_bloom = options\n\n .map(|o| o.use_bloom)\n\n .unwrap_or(self.use_bloom_default);\n\n if use_bloom && !self.bloom.check(key) {\n\n return Ok(None);\n\n }\n\n let (offset, right_bound) = match self.index.find_bounds(key, self.index_start) {\n","file_path":"src/sstable/reader.rs","rank":54,"score":24.16316382256028},{"content":" page_cache: uncompressed_cache,\n\n data_start,\n\n meta,\n\n bloom,\n\n use_bloom_default: opts.use_bloom,\n\n })\n\n }\n\n\n\n fn get(&self, key: &[u8]) -> Result<Option<Bytes>> {\n\n self.get_with_options(key, None)\n\n }\n\n\n\n fn get_with_options(&self, key: &[u8], options: Option<GetOptions>) -> Result<Option<Bytes>> {\n\n let use_bloom = options\n\n .map(|o| o.use_bloom)\n\n .unwrap_or(self.use_bloom_default);\n\n if use_bloom && !self.bloom.check(key) {\n\n return Ok(None);\n\n }\n\n let index_start = self.data_start + self.meta.data_len as u64;\n","file_path":"src/sstable/reader.rs","rank":55,"score":23.126617968781535},{"content":"/// If your data is uncompressed, you probably better use `MmapUncompressedSSTableReader`,\n\n/// which is a lot simpler wait-free implementation.\n\n///\n\n/// However mmap's one superiority needs to be confirmed in benchmarks. There are benchmarks,\n\n/// but conclusions are TBD.\n\npub struct ConcurrentSSTableReader {\n\n inner: ConcurrentInnerReader,\n\n}\n\n\n\nimpl ConcurrentSSTableReader {\n\n pub fn new<P: AsRef<Path>>(filename: P) -> Result<Self> {\n\n Self::new_with_options(filename, &ReadOptions::default())\n\n }\n\n\n\n pub fn new_with_options<P: AsRef<Path>>(filename: P, opts: &ReadOptions) -> Result<Self> {\n\n let mut file = File::open(filename)?;\n\n let meta = read_metadata(&mut file)?;\n\n let data_start = meta.offset as u64;\n\n let inner = ConcurrentInnerReader::new(file, data_start, meta, opts)?;\n\n Ok(Self { inner })\n","file_path":"src/sstable/reader.rs","rank":56,"score":22.31213204213309},{"content":"use std::io::{Result, Write};\n\n\n\n// PosWriter is a Writer that remembers the position and can report it at any time.\n\n#[derive(Debug)]\n\npub struct PosWriter<W> {\n\n w: W,\n\n offset: u64,\n\n}\n\n\n\nimpl<W> PosWriter<W> {\n\n pub fn new(w: W, offset: u64) -> Self {\n\n PosWriter { w, offset }\n\n }\n\n pub fn current_offset(&self) -> u64 {\n\n self.offset\n\n }\n\n pub fn reset_offset(&mut self, offset: u64) {\n\n self.offset = offset;\n\n }\n\n pub fn get_mut(&mut self) -> &mut W {\n","file_path":"src/sstable/poswriter.rs","rank":57,"score":21.979836047161676},{"content":"#[derive(Serialize, Deserialize, Debug, Default)]\n\npub struct KVOffset {\n\n pub key_length: KeyLength,\n\n pub offset: Offset,\n\n}\n\n\n\nimpl KVOffset {\n\n pub fn new(k: usize, offset: Offset) -> Result<Self> {\n\n Ok(Self {\n\n key_length: KeyLength::try_from(k).map_err(|_| Error::KeyTooLong(k))?,\n\n offset,\n\n })\n\n }\n\n pub const fn encoded_size() -> usize {\n\n // can't use sizeof Self as bincode has no padding while the struct might.\n\n size_of::<KeyLength>() + size_of::<Offset>()\n\n }\n\n pub fn deserialize_from_eof_is_ok<R: Read>(r: R) -> Result<Option<Self>> {\n\n Ok(deserialize_from_eof_is_ok(r)?)\n\n }\n","file_path":"src/sstable/ondisk_format.rs","rank":58,"score":20.866977872849258},{"content":" let (offset, right_bound) = match self.index.find_bounds(key, index_start) {\n\n Some(v) => v,\n\n None => return Ok(None),\n\n };\n\n\n\n let chunk: Bytes = self.page_cache.get_chunk(offset, right_bound - offset)?;\n\n if let Some((start, end)) = find_value_offset_v2(&chunk, key)? {\n\n Ok(Some(chunk.slice(start..end)))\n\n } else {\n\n Ok(None)\n\n }\n\n }\n\n}\n\n\n\nimpl SSTableReader {\n\n pub fn new<P: AsRef<Path>>(filename: P) -> Result<Self> {\n\n Self::new_with_options(filename, &ReadOptions::default())\n\n }\n\n\n\n pub fn new_with_options<P: AsRef<Path>>(filename: P, opts: &ReadOptions) -> Result<Self> {\n","file_path":"src/sstable/reader.rs","rank":59,"score":20.69295158330976},{"content":"impl ConcurrentLRUCache {\n\n pub fn new(shards: usize, cache: Option<ReadCache>) -> Self {\n\n Self {\n\n caches: cache.map(|cache| (0..shards).map(|_| Mutex::new(cache.lru())).collect()),\n\n }\n\n }\n\n\n\n /// Get or insert the value into the cache. The inserted value is computed\n\n /// using the provided callback.\n\n ///\n\n /// The shard-level lock is NOT held during the computation.\n\n /// During the computation the chunk-level lock is held, so only threads contending\n\n /// on the specific chunk will get blocked.\n\n pub fn get_or_insert<F>(&self, offset: u64, func: F) -> Result<Bytes>\n\n where\n\n F: Fn() -> Result<Bytes>,\n\n {\n\n let caches = match self.caches.as_ref() {\n\n Some(caches) => caches,\n\n None => return func(),\n","file_path":"src/sstable/concurrent_lru.rs","rank":60,"score":19.767907705463713},{"content":"\n\npub use writer::RawSSTableWriter;\n\npub use writer::SSTableWriterV2;\n\n\n\npub use error::{Error, INVALID_DATA};\n\npub use options::*;\n\npub use result::Result;\n\npub use types::*;\n\n\n\n/// A convenience function to write a btree map to a file.\n\n///\n\n///\n\n/// Example:\n\n/// ```\n\n/// use std::collections::BTreeMap;\n\n/// use sstb::sstable::{write_btree_map, WriteOptions};\n\n///\n\n/// let mut map = BTreeMap::new();\n\n/// let filename = \"/tmp/some-sstable\";\n\n/// let write_options = WriteOptions::default();\n\n///\n\n/// map.insert(b\"foo\", b\"some foo\");\n\n/// map.insert(b\"bar\", b\"some bar\");\n\n/// write_btree_map(&map, filename, Some(write_options)).unwrap();\n\n/// ```\n","file_path":"src/sstable/mod.rs","rank":61,"score":19.73856072019538},{"content":" let mut file = File::open(filename)?;\n\n let meta = read_metadata(&mut file)?;\n\n let data_start = meta.offset as u64;\n\n let inner = InnerReader::new(file, data_start, meta, opts)?;\n\n Ok(SSTableReader { inner })\n\n }\n\n pub fn get(&mut self, key: &[u8]) -> Result<Option<&[u8]>> {\n\n self.inner.get(key)\n\n }\n\n}\n\n\n\n/// A reader that can be used efficiently from multiple threads.\n\n///\n\n/// There is internal mutability inside. The LRU caches are sharded into multiple locks.\n\n///\n\n/// You get `Bytes` references in return instead of slices, so that atomic reference counting\n\n/// can happen behind the scenes for properly tracking chunks still in-use.\n\n///\n\n/// If you want to use this with multiple threads just put it into an `Arc`.\n\n///\n","file_path":"src/sstable/reader.rs","rank":62,"score":19.419992799539443},{"content":" pub fn serialize_into<W: Write>(&self, w: W) -> Result<()> {\n\n Ok(bincode::serialize_into(w, self)?)\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Default, Debug)]\n\npub struct BloomV3_0 {\n\n pub bitmap_bytes: u32,\n\n pub k_num: u32,\n\n pub sip_keys: [(u64, u64); 2],\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Default, Debug)]\n\npub struct MetaV3_0 {\n\n pub data_len: u64,\n\n pub index_len: u64,\n\n pub bloom_len: u64,\n\n pub items: u64,\n\n pub compression: Compression,\n\n // updating this field is done as the last step.\n","file_path":"src/sstable/ondisk_format.rs","rank":63,"score":18.455937086991035},{"content":" fn write_sstable(&self, filename: &str, write_opts: &WriteOptions) -> Result<()> {\n\n let mut iter = self.sorted_iter.clone();\n\n\n\n let mut writer = writer::SSTableWriterV2::new_with_options(filename, write_opts)?;\n\n\n\n while let Some(key) = iter.next() {\n\n writer.set(key, key)?;\n\n }\n\n\n\n writer.finish()\n\n }\n\n}\n\n\n","file_path":"benches/sstable_implementations.rs","rank":64,"score":18.448286385294864},{"content":"impl FileBackedPageCache {\n\n pub fn new(file: File, cache: Option<ReadCache>, count: usize) -> Self {\n\n Self {\n\n file,\n\n caches: ConcurrentLRUCache::new(count, cache),\n\n }\n\n }\n\n fn read_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\n\n let buf = pread_exact(self.file.as_raw_fd(), offset, length)?;\n\n Ok(Bytes::from(buf))\n\n }\n\n}\n\n\n\nimpl ConcurrentPageCache for FileBackedPageCache {\n\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\n\n self.caches\n\n .get_or_insert(offset, || self.read_chunk(offset, length))\n\n }\n\n}\n\n\n","file_path":"src/sstable/concurrent_page_cache.rs","rank":65,"score":17.594867750089104},{"content":" let mut g = self.value.write();\n\n match g.as_mut() {\n\n Some(bytes) => Ok(bytes.clone()),\n\n None => {\n\n let value = func()?;\n\n g.replace(value.clone());\n\n Ok(value)\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// An LRU cache of Bytes that can be used by multiple threads\n\n/// concurrently.\n\n///\n\n/// Works by sharding the single-threaded LRUCache into multiple shards.\n\npub struct ConcurrentLRUCache {\n\n caches: Option<Vec<Mutex<lru::LruCache<u64, Arc<Inner>>>>>,\n\n}\n\n\n","file_path":"src/sstable/concurrent_lru.rs","rank":66,"score":17.423328700884436},{"content":"\n\n/// The resulting sstable files MUST have this prefix.\n\npub const MAGIC: &[u8] = b\"\\x80LSM\";\n\npub type KeyLength = u16;\n\npub type ValueLength = u32;\n\npub type Offset = u64;\n\n\n\nuse super::error::{Error, INVALID_DATA};\n\nuse super::result::Result;\n\nuse super::types::Compression;\n\nuse super::utils::deserialize_from_eof_is_ok;\n\nuse core::mem::size_of;\n\nuse std::cmp::{Ord, Ordering};\n\nuse std::convert::TryFrom;\n\nuse std::io::{Read, Write};\n\n\n\npub use super::types::Version;\n\n\n\n#[derive(Serialize, Deserialize, Debug, Default)]\n\npub struct KVLength {\n","file_path":"src/sstable/ondisk_format.rs","rank":67,"score":17.401556512341926},{"content":" }\n\n}\n\n\n\npub struct SnappyUncompress {}\n\n\n\nimpl<W: Write> Write for SnappyCompressor<W> {\n\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\n\n self.inner.write(buf)\n\n }\n\n\n\n fn flush(&mut self) -> std::io::Result<()> {\n\n self.inner.flush()\n\n }\n\n}\n\n\n\nimpl<W: Write> Compressor<W> for SnappyCompressor<W> {\n\n fn into_inner(self) -> Result<W> {\n\n self.inner.into_inner().map_err(|e| {\n\n let kind = e.error().kind();\n\n let io = std::io::Error::from(kind);\n","file_path":"src/sstable/compression.rs","rank":68,"score":16.891109958773672},{"content":"impl<W: Write> ZlibCompressorFactory<W> {\n\n pub fn new(compression: Option<flate2::Compression>) -> Self {\n\n ZlibCompressorFactory {\n\n compression: compression.unwrap_or_default(),\n\n marker: std::marker::PhantomData {},\n\n }\n\n }\n\n}\n\n\n\nimpl<W: Write> CompressorFactory<W, ZlibCompressor<W>> for ZlibCompressorFactory<W> {\n\n fn from_writer(&self, writer: W) -> ZlibCompressor<W> {\n\n ZlibCompressor::new(writer, self.compression)\n\n }\n\n}\n\n\n\nimpl Uncompress for ZlibUncompress {\n\n fn uncompress(&self, buf: &[u8]) -> Result<Vec<u8>> {\n\n let mut dec = flate2::read::ZlibDecoder::new(Cursor::new(buf));\n\n // TODO: buf.len() here is a bad heuristic. Need the real number, this can be pulled during\n\n // compression.\n","file_path":"src/sstable/compression.rs","rank":69,"score":16.44995242391304},{"content":" }\n\n }\n\n}\n\n\n\nimpl<W: Write> Write for ZlibCompressor<W> {\n\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\n\n self.inner.write(buf)\n\n }\n\n\n\n fn flush(&mut self) -> std::io::Result<()> {\n\n self.inner.flush()\n\n }\n\n}\n\n\n\nimpl<W: Write> Compressor<W> for ZlibCompressor<W> {\n\n fn into_inner(self) -> Result<W> {\n\n Ok(self.inner.finish()?)\n\n }\n\n}\n\n\n","file_path":"src/sstable/compression.rs","rank":70,"score":16.38221438332255},{"content":" }\n\n}\n\n\n\nimpl<R: Read + Seek> PageCache for ReadPageCache<R> {\n\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\n\n match self.cache.get(&offset) {\n\n Some(bytes) => Ok(unsafe { &*(bytes as &[u8] as *const [u8]) }),\n\n None => {\n\n let mut buf = vec![0; usize::try_from(length)?];\n\n // TODO: this can use pread instead of 2 syscalls.\n\n self.reader.seek(SeekFrom::Start(offset))?;\n\n self.reader.read_exact(&mut buf)?;\n\n self.cache.put(offset, buf);\n\n Ok(self.cache.get(&offset).unwrap())\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// A cache that wraps another one, uncompresses the inner cache's results and\n","file_path":"src/sstable/page_cache.rs","rank":71,"score":16.297011162694112},{"content":" let mut buf = Vec::with_capacity(buf.len());\n\n dec.read_to_end(&mut buf)?;\n\n Ok(buf)\n\n }\n\n}\n\n\n\n/// Snappy\n\npub struct SnappyCompressorFactory<W: Write> {\n\n marker: std::marker::PhantomData<W>,\n\n}\n\n\n\npub struct SnappyCompressor<W: Write> {\n\n inner: snap::Writer<W>,\n\n}\n\n\n\nimpl<W: Write> SnappyCompressor<W> {\n\n pub fn new(writer: W) -> Self {\n\n Self {\n\n inner: snap::Writer::new(writer),\n\n }\n","file_path":"src/sstable/compression.rs","rank":72,"score":16.19597659375784},{"content":"/// store the uncompressed chunks in the LRU cache inside.\n\npub struct WrappedCache<PC, U> {\n\n inner: PC,\n\n cache: LruCache<u64, Vec<u8>>,\n\n uncompress: U,\n\n}\n\n\n\nimpl<PC, U> WrappedCache<PC, U> {\n\n pub fn new(inner: PC, uncompress: U, cache: ReadCache) -> Self {\n\n Self {\n\n inner,\n\n cache: cache.lru(),\n\n uncompress,\n\n }\n\n }\n\n}\n\n\n\nimpl PageCache for Box<dyn PageCache> {\n\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\n\n self.as_mut().get_chunk(offset, length)\n","file_path":"src/sstable/page_cache.rs","rank":73,"score":16.092943945948868},{"content":"}\n\n\n\nimpl Index for OwnedIndex {\n\n fn find_bounds(&self, key: &[u8], end_default: u64) -> Option<(u64, u64)> {\n\n find_bounds(&self.index, key, end_default)\n\n }\n\n}\n\n\n\n/// The default single-threaded reader for sstables.\n\n///\n\n/// As the get() method takes a mutable reference, you will not be able to use this in\n\n/// multiple threads.\n\npub struct SSTableReader {\n\n inner: InnerReader,\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":74,"score":16.018747183955707},{"content":" }\n\n pub fn get(&self, key: &[u8]) -> Result<Option<Bytes>> {\n\n self.inner.get(key)\n\n }\n\n}\n\n\n\n/// A multi-threaded reader that only works with fully uncompressed data.\n\n///\n\n/// There is no locking happening inside, there is no internal mutability either.\n\n/// Everything just relies on the OS page cache to work, so if you are ok with storing\n\n/// uncompressed sstables, this reader the way to go.\n\n///\n\n/// If you try to use it with a compressed sstable it will return `Error::CantUseCompressedFileWithMultiThreadedMmap`\n\n///\n\n/// If you want to use this with multiple threads just put it into an Arc without Mutex'es.\n\npub struct MmapUncompressedSSTableReader {\n\n index_start: u64,\n\n mmap: memmap::Mmap,\n\n index: MemIndex,\n\n use_bloom_default: bool,\n","file_path":"src/sstable/reader.rs","rank":75,"score":15.900397033309257},{"content":" )?;\n\n let key_end = kvoffset_encoded_size + kvoffset.key_length as usize;\n\n let key = index_data\n\n .get(kvoffset_encoded_size..key_end)\n\n .ok_or(INVALID_DATA)?;\n\n let key: &'static [u8] = unsafe { &*(key as *const _) };\n\n index.insert(key, kvoffset.offset);\n\n if index_data.len() == key_end {\n\n break;\n\n }\n\n index_data = &index_data[key_end..];\n\n }\n\n\n\n Ok(Self { index })\n\n }\n\n}\n\n\n\nimpl Index for MemIndex {\n\n fn find_bounds(&self, key: &[u8], end_default: u64) -> Option<(u64, u64)> {\n\n find_bounds(&self.index, key, end_default)\n\n }\n\n}\n\n\n","file_path":"src/sstable/reader.rs","rank":76,"score":15.640957214003643},{"content":" let (index, bloom): (Box<dyn Index>, Bloom<[u8]>) = match meta.compression {\n\n Compression::None => match mmap_buf {\n\n Some(mmap) => {\n\n let index = Box::new(MemIndex::from_static_buf(\n\n // if it was mmaped, it won't truncate\n\n #[allow(clippy::cast_possible_truncation)]\n\n &mmap\n\n .get(index_start as usize..index_end as usize)\n\n .ok_or(INVALID_DATA)?,\n\n meta.index_len,\n\n )?);\n\n file.seek(SeekFrom::Start(index_end))?;\n\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\n\n (index, bloom)\n\n }\n\n None => {\n\n let index =\n\n Box::new(OwnedIndex::from_reader((&mut file).take(meta.index_len))?);\n\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\n\n (index, bloom)\n","file_path":"src/sstable/reader.rs","rank":77,"score":15.306541972616742},{"content":" let (index, bloom): (Box<dyn Index + Send + Sync>, Bloom<[u8]>) = match meta.compression {\n\n Compression::None => match mmap_buf {\n\n Some(mmap) => {\n\n let index = Box::new(MemIndex::from_static_buf(\n\n // if it was mmaped, it won't truncate\n\n #[allow(clippy::cast_possible_truncation)]\n\n &mmap\n\n .get(index_start as usize..index_end as usize)\n\n .ok_or(INVALID_DATA)?,\n\n meta.index_len,\n\n )?);\n\n\n\n file.seek(SeekFrom::Start(index_end))?;\n\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\n\n (index, bloom)\n\n }\n\n None => {\n\n let index =\n\n Box::new(OwnedIndex::from_reader((&mut file).take(meta.index_len))?);\n\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\n","file_path":"src/sstable/reader.rs","rank":78,"score":15.247720799513399},{"content":" };\n\n\n\n // if it was mmaped, it won't truncate\n\n #[allow(clippy::cast_possible_truncation)]\n\n let index = MemIndex::from_static_buf(\n\n &mmap_buf\n\n .get(index_start as usize..index_end as usize)\n\n .ok_or(INVALID_DATA)?,\n\n meta.index_len,\n\n )?;\n\n\n\n file.seek(SeekFrom::Start(index_end))?;\n\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\n\n\n\n Ok(Self {\n\n mmap,\n\n index,\n\n index_start,\n\n bloom,\n\n use_bloom_default: opts.use_bloom,\n","file_path":"src/sstable/reader.rs","rank":79,"score":14.990643180320419},{"content":"/// ];\n\n/// for expected_value in expected.into_iter() {\n\n/// assert_eq!(iter.next(), Some(*expected_value as &[u8]));\n\n/// }\n\n///\n\n/// assert_eq!(iter.next(), None);\n\n/// assert_eq!(iter.next(), None);\n\n/// ```\n\npub struct SortedBytesIterator {\n\n buf: Vec<u8>,\n\n // points to the element being made larger.\n\n current: usize,\n\n first: u8,\n\n last: u8,\n\n counter: usize,\n\n limit: usize,\n\n}\n\n\n\nimpl Clone for SortedBytesIterator {\n\n fn clone(&self) -> Self {\n","file_path":"src/utils/sorted_bytes_iterator.rs","rank":80,"score":14.640129925423217},{"content":" // if this was mmaped, there will be no truncation.\n\n #[allow(clippy::cast_possible_truncation)]\n\n self.buf\n\n .get(offset as usize..(offset + length) as usize)\n\n .ok_or(error::INVALID_DATA)\n\n }\n\n}\n\n\n\n/// This is used to read from a file (or any seek'able reader).\n\npub struct ReadPageCache<R> {\n\n reader: R,\n\n cache: LruCache<u64, Vec<u8>>,\n\n}\n\n\n\nimpl<R> ReadPageCache<R> {\n\n pub fn new(reader: R, cache: ReadCache) -> Self {\n\n Self {\n\n reader,\n\n cache: cache.lru(),\n\n }\n","file_path":"src/sstable/page_cache.rs","rank":81,"score":14.262206457751208},{"content":" /// Reset the state of the iterator to initial.\n\n pub fn reset(&mut self) {\n\n for v in self.buf.iter_mut() {\n\n *v = self.first;\n\n }\n\n self.current = self.buf.len();\n\n self.counter = 0;\n\n }\n\n\n\n /// Customize the bytes being returned.\n\n pub fn new_first_last(length: usize, first: u8, last: u8, limit: usize) -> Result<Self> {\n\n if length == 0 {\n\n return Err(Error::ProgrammingError(\"length should be greater than 0\"));\n\n }\n\n if last <= first {\n\n return Err(Error::ProgrammingError(\"expected last > first\"));\n\n }\n\n let buf = vec![first; length];\n\n Ok(Self {\n\n buf,\n","file_path":"src/utils/sorted_bytes_iterator.rs","rank":82,"score":14.215214492864822},{"content":"pub struct WrappedCache<PC, U> {\n\n inner: PC,\n\n caches: ConcurrentLRUCache,\n\n uncompress: U,\n\n}\n\n\n\nimpl<PC, U> WrappedCache<PC, U> {\n\n pub fn new(inner: PC, uncompress: U, cache: Option<ReadCache>, count: usize) -> Self {\n\n Self {\n\n inner,\n\n caches: ConcurrentLRUCache::new(count, cache),\n\n uncompress,\n\n }\n\n }\n\n}\n\n\n\nimpl ConcurrentPageCache for Box<dyn ConcurrentPageCache + Send + Sync> {\n\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\n\n self.as_ref().get_chunk(offset, length)\n\n }\n","file_path":"src/sstable/concurrent_page_cache.rs","rank":83,"score":14.010830500308675},{"content":"use std::io::{Read, Result};\n\n\n\n/// PosReader is a reader that remembers the position read and can\n\n/// report it back at any time.\n\n#[derive(Debug)]\n\npub struct PosReader<R> {\n\n r: R,\n\n offset: usize,\n\n}\n\n\n\nimpl<R> PosReader<R> {\n\n pub fn new(r: R, offset: usize) -> Self {\n\n PosReader { r, offset }\n\n }\n\n pub fn current_offset(&self) -> usize {\n\n self.offset\n\n }\n\n pub fn into_inner(self) -> R {\n\n self.r\n\n }\n","file_path":"src/sstable/posreader.rs","rank":84,"score":13.973469217330237},{"content":"\n\n #[allow(clippy::infallible_destructuring_match)]\n\n let meta = match meta.meta {\n\n MetaData::V3_0(meta) => meta,\n\n };\n\n\n\n if meta.compression != Compression::None {\n\n return Err(Error::CantUseCompressedFileWithMultiThreadedMmap);\n\n }\n\n\n\n let index_start = data_start + (meta.data_len as u64);\n\n let index_end = index_start + meta.index_len;\n\n\n\n file.seek(SeekFrom::Start(index_start))?;\n\n let mmap = unsafe { memmap::Mmap::map(&file) }?;\n\n let mmap_buf = {\n\n let buf = &mmap as &[u8];\n\n let buf = buf as *const [u8];\n\n let buf: &'static [u8] = unsafe { &*buf };\n\n buf\n","file_path":"src/sstable/reader.rs","rank":85,"score":13.781856593175547},{"content":"}\n\n\n\nimpl<R: Read> Read for PosReader<R> {\n\n fn read(&mut self, buf: &mut [u8]) -> Result<usize> {\n\n let l = self.r.read(buf)?;\n\n self.offset += l;\n\n Ok(l)\n\n }\n\n}\n","file_path":"src/sstable/posreader.rs","rank":86,"score":13.689256277634836},{"content":"use super::Version;\n\n\n\npub const INVALID_DATA: Error = Error::InvalidData(\"corrupt SStable or bug\");\n\n\n\n#[derive(Debug)]\n\npub enum Error {\n\n Io(std::io::Error),\n\n CantUseCompressedFileWithMultiThreadedMmap,\n\n ProgrammingError(&'static str),\n\n InvalidData(&'static str),\n\n UnsupportedVersion(Version),\n\n Bincode(bincode::Error),\n\n Utf8Error(std::str::Utf8Error),\n\n KeyTooLong(usize),\n\n ValueTooLong(usize),\n\n StdStringFromUtf8Error(std::string::FromUtf8Error),\n\n TryFromInt(std::num::TryFromIntError),\n\n NixError(nix::Error),\n\n}\n\n\n","file_path":"src/sstable/error.rs","rank":87,"score":13.634737157348521},{"content":" Error::from(io)\n\n })\n\n }\n\n}\n\n\n\nimpl<W: Write> SnappyCompressorFactory<W> {\n\n pub fn new() -> Self {\n\n Self {\n\n marker: std::marker::PhantomData {},\n\n }\n\n }\n\n}\n\n\n\nimpl<W: Write> CompressorFactory<W, SnappyCompressor<W>> for SnappyCompressorFactory<W> {\n\n fn from_writer(&self, writer: W) -> SnappyCompressor<W> {\n\n SnappyCompressor::new(writer)\n\n }\n\n}\n\n\n\nimpl Uncompress for SnappyUncompress {\n","file_path":"src/sstable/compression.rs","rank":88,"score":13.619349732298687},{"content":"//! Ondisk format structs, serialized with \"bincode\".\n\n//!\n\n//! Ondisk format has the following preamble.\n\n//!\n\n//! | MAGIC: [u8; 4] | version: struct{u16, u16} |\n\n//!\n\n//! Then depending on version the rest of the file is structured.\n\n//! Full v1 format looks like this:\n\n//!\n\n//! | MAGIC: [u8; 4] | Version_1_0: [1u16, 0u16] | Meta_V1_0 | DATA | INDEX_DATA |\n\n//!\n\n//! V1 data has the following layout\n\n//!\n\n//! | KVLength | key: [u8] | value: [u8] |\n\n//!\n\n//! V1 index data has the following layout\n\n//!\n\n//! | KVOffset | key: [u8] | offset: Offset |\n\n\n\nuse serde::{Deserialize, Serialize};\n","file_path":"src/sstable/ondisk_format.rs","rank":89,"score":12.833384736149398},{"content":"//!\n\n//! ```\n\n//! use sstb::*;\n\n//! use std::collections::BTreeMap;\n\n//!\n\n//! let filename = \"/tmp/example-sstable\";\n\n//! let mut map = BTreeMap::new();\n\n//! map.insert(b\"foo\", b\"some foo\");\n\n//! map.insert(b\"bar\", b\"some bar\");\n\n//!\n\n//! write_btree_map(&map, filename, None).unwrap();\n\n//!\n\n//! let mut reader =\n\n//! SSTableReader::new_with_options(filename, &ReadOptions::default())\n\n//! .unwrap();\n\n\n\n//! assert_eq!(reader.get(b\"foo\").unwrap(), Some(b\"some foo\" as &[u8]));\n\n//! assert_eq!(reader.get(b\"bar\").unwrap(), Some(b\"some bar\" as &[u8]));\n\n//! assert_eq!(reader.get(b\"foobar\").unwrap(), None);\n\n//! ```\n\n\n\npub mod sstable;\n\npub mod utils;\n\n\n\npub use sstable::*;\n\n\n\n#[cfg(test)]\n\nmod tests {}\n","file_path":"src/lib.rs","rank":90,"score":12.756074265414359},{"content":" }\n\n}\n\n\n\nimpl<PC, U> PageCache for WrappedCache<PC, U>\n\nwhere\n\n U: Uncompress,\n\n PC: PageCache,\n\n{\n\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\n\n match self.cache.get(&offset) {\n\n Some(bytes) => Ok(unsafe { &*(bytes as &[u8] as *const [u8]) }),\n\n None => {\n\n let inner_chunk = self.inner.get_chunk(offset, length)?;\n\n let buf = self.uncompress.uncompress(inner_chunk)?;\n\n self.cache.put(offset, buf);\n\n Ok(self.cache.get(&offset).unwrap())\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/sstable/page_cache.rs","rank":91,"score":12.426204465262298},{"content":" );\n\n },\n\n );\n\n\n\n for (prefix, write_opts, read_opts) in variants.iter() {\n\n state.write_sstable(filename, &write_opts).unwrap();\n\n\n\n group.bench_function(BenchmarkId::new(*prefix, threads), |b| {\n\n b.iter_batched(\n\n || ConcurrentSSTableReader::new_with_options(filename, &read_opts).unwrap(),\n\n |reader| {\n\n pool.install(|| {\n\n state.get_shuffled_input_ref().par_iter().for_each(|kv| {\n\n let KV { key, is_present } = &kv;\n\n let key = key as &[u8];\n\n let value = reader.get(key).unwrap();\n\n if *is_present {\n\n assert_eq!(value.as_deref(), Some(key));\n\n } else {\n\n assert_eq!(value, None);\n","file_path":"benches/sstable_implementations.rs","rank":92,"score":12.100472128454792},{"content":" group.bench_function(BenchmarkId::new(*prefix, *size), |b| {\n\n b.iter_batched(\n\n || SSTableReader::new_with_options(filename, &read_opts).unwrap(),\n\n |mut reader| {\n\n for kv in state.get_shuffled_input() {\n\n let KV { key, is_present } = &kv;\n\n let key = key as &[u8];\n\n let value = reader.get(key).unwrap();\n\n if *is_present {\n\n assert_eq!(value, Some(key));\n\n } else {\n\n assert_eq!(value, None);\n\n }\n\n }\n\n },\n\n BatchSize::LargeInput,\n\n );\n\n });\n\n }\n\n }\n","file_path":"benches/sstable_implementations.rs","rank":93,"score":11.991764878083828},{"content":"mod compress_ctx_writer;\n\nmod compression;\n\nmod concurrent_lru;\n\nmod concurrent_page_cache;\n\nmod error;\n\nmod ondisk_format;\n\nmod options;\n\nmod page_cache;\n\nmod posreader;\n\nmod poswriter;\n\nmod result;\n\nmod types;\n\nmod utils;\n\n\n\npub mod reader;\n\npub mod writer;\n\n\n\npub use reader::ConcurrentSSTableReader;\n\npub use reader::MmapUncompressedSSTableReader;\n\npub use reader::SSTableReader;\n","file_path":"src/sstable/mod.rs","rank":94,"score":11.96769643622501},{"content":"use std::path::Path;\n\n\n\nuse bincode;\n\nuse memmap;\n\nuse num_cpus;\n\n\n\nuse bloomfilter::Bloom;\n\nuse bytes::Bytes;\n\n\n\nuse super::error::INVALID_DATA;\n\nuse super::ondisk_format::*;\n\nuse super::options::*;\n\nuse super::types::*;\n\nuse super::{compression, concurrent_page_cache, page_cache, posreader, Error, Result};\n\n\n","file_path":"src/sstable/reader.rs","rank":95,"score":11.88445495001495},{"content":" |reader| {\n\n for kv in state.get_shuffled_input() {\n\n let KV { key, is_present } = &kv;\n\n let key = key as &[u8];\n\n let value = reader.get(key).unwrap();\n\n if *is_present {\n\n assert_eq!(value, Some(key));\n\n } else {\n\n assert_eq!(value, None);\n\n }\n\n }\n\n },\n\n BatchSize::LargeInput,\n\n );\n\n },\n\n );\n\n\n\n for (prefix, write_opts, read_opts) in variants.iter() {\n\n state.write_sstable(filename, &write_opts).unwrap();\n\n\n","file_path":"benches/sstable_implementations.rs","rank":96,"score":11.876882402126888},{"content":"# TODO ([x] means done)\n\n- [ ] Prettify and publish benchmark results in the readme. For now one can \"cargo bench\" and look at the reports.\n\n- [x] cache=none does not work. It uses unbounded cache as default which is incorrect.\n\n- [-] open-source\n\n - [x] write README with badges\n\n - [ ] Travis tests etc\n\n- [ ] backtraces in errors\n\n- [ ] range queries\n\n- [x] bloom filters on disk\n\n - they slowed things down by 25% though! but it works\n\n- [ ] writing \"flush_every\"'s default should depend on the default compression.\n\n- [ ] read cache size configurable both for page cache and for uncompressed cache\n\n- [ ] read cache size should be in bytes, not blocks\n\n- [ ] cache cannot be explicitly disabled in some places\n\n- [ ] add length to encoded bits\n\n- [ ] indexes as separate files\n\n in this case don't need to maintain the index in memory while writing\n\n- [ ] remove as much as possible unsafe and unwrap\n\n - [ ] Mmap can be put into an Arc, to remove unsafe static buffer casts. This should not matter at runtime.\n\n- [ ] the index can store the number of items and uncompressed length (in case the file is compressed)\n\n - the uncompressed length can be used when allocating memory for uncompressed chunks\n\n - the number of items in the chunk can be used for HashMap capacity IF we get back the \"Block\" structure which helps not scan the whole table every time.\n\n - there's a space tradeoff here, so maybe it's all not worth it\n\n- [ ] consider getting back the \"Block\" trait and its implementations\n\n - this will help not scan through the chunk on each get()\n\n - however, there are costs\n\n - need to allocate HashMaps for lookups\n\n - if length is not known, might even reallocate\n\n - messes up the concurrency as the hashmap becomes the contention point\n\n - an RWLock might help for the majority of the cases\n\n - even if all this is implemented, it's totally not guaranteed that it's going to be faster in the end.\n\n- [x] u16 keys and u32 values, not u64, for saving space\n\n- [x] mmap with no compression is already multi-threaded, but the API does not\n\n reflect that\n\n- [x] zlib bounded and unbounded performs the same in benchmarks\n\n- [x] analyze all casts from u64 to usize\n\n - [x] clippy actually has a lint for it in pedantic\n\n- [x] multi-threading\n\n- [x] compression is all over the place\n\n- [x] files and imports are all over the place, reorganize\n\n- [x] fail if keys or values are too long (> u32_max)\n\n- [x] byte keys\n\n - [x] also \"memchr\" is very slow, better to use offsets\n","file_path":"TODO.md","rank":97,"score":11.767948544841154},{"content":"//! Traits and implementations of various compressors and decompressors.\n\n\n\nuse super::Result;\n\n\n\nuse super::Error;\n\nuse snap;\n\nuse std::io::{Cursor, Read, Write};\n\n\n","file_path":"src/sstable/compression.rs","rank":98,"score":11.568370828017864},{"content":" Compression::Snappy => {\n\n let dec = compression::SnappyUncompress {};\n\n let cache = opts.cache.clone().unwrap_or_default();\n\n let wrapped = page_cache::WrappedCache::new(pc, dec, cache);\n\n Box::new(wrapped)\n\n }\n\n };\n\n\n\n Ok(Self {\n\n _mmap: mmap,\n\n index,\n\n page_cache: uncompressed_cache,\n\n data_start,\n\n meta,\n\n bloom,\n\n use_bloom_default: opts.use_bloom,\n\n })\n\n }\n\n\n\n fn get_with_options(\n","file_path":"src/sstable/reader.rs","rank":99,"score":11.553275137549367}],"string":"[\n {\n \"content\": \"/// Find the key in the chunk by scanning sequentially.\\n\\n///\\n\\n/// This assumes the chunk was fetched from disk and has V1 ondisk format.\\n\\n///\\n\\n/// Returns the start and end index of the value.\\n\\n///\\n\\n/// TODO: this probably belongs in \\\"ondisk\\\" for version V1.\\n\\npub fn find_value_offset_v2(buf: &[u8], key: &[u8]) -> Result<Option<(usize, usize)>> {\\n\\n macro_rules! buf_get {\\n\\n ($x:expr) => {{\\n\\n buf.get($x).ok_or(INVALID_DATA)?\\n\\n }};\\n\\n }\\n\\n\\n\\n let kvlen_encoded_size = KVLength::encoded_size();\\n\\n\\n\\n let mut offset = 0;\\n\\n while offset < buf.len() {\\n\\n let kvlength = bincode::deserialize::<KVLength>(&buf)?;\\n\\n let (start_key, cursor) = {\\n\\n let key_start = offset + kvlen_encoded_size;\\n\\n let key_end = key_start + kvlength.key_length as usize;\\n\\n (buf_get!(key_start..key_end), key_end)\\n\\n };\\n\\n\\n\\n let (start, end) = {\\n\\n let value_end = cursor + kvlength.value_length as usize;\\n\",\n \"file_path\": \"src/sstable/ondisk_format.rs\",\n \"rank\": 0,\n \"score\": 226046.14298968075\n },\n {\n \"content\": \"/// Read the bloom filter from a reader.\\n\\nfn read_bloom<R: Read>(mut reader: R, config: &BloomV3_0) -> Result<Bloom<[u8]>> {\\n\\n let len_bytes = usize::try_from(config.bitmap_bytes)?;\\n\\n // I don't think there's a way not to do this allocation.\\n\\n let mut buf = vec![0u8; len_bytes];\\n\\n reader.read_exact(&mut buf)?;\\n\\n Ok(Bloom::from_existing(\\n\\n &buf,\\n\\n config.bitmap_bytes as u64 * 8,\\n\\n config.k_num,\\n\\n config.sip_keys,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 1,\n \"score\": 154394.13033039993\n },\n {\n \"content\": \"fn pread_exact(fd: RawFd, mut offset: u64, length: u64) -> Result<Vec<u8>> {\\n\\n // if this was mmaped, there will be no truncation.\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let mut buf = vec![0_u8; length as usize];\\n\\n let mut remaining = length;\\n\\n while remaining > 0 {\\n\\n let size = pread(fd, &mut buf, i64::try_from(offset)?)? as u64;\\n\\n if size == 0 {\\n\\n return Err(error::INVALID_DATA);\\n\\n }\\n\\n remaining -= size;\\n\\n offset += size;\\n\\n }\\n\\n Ok(buf)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/concurrent_page_cache.rs\",\n \"rank\": 2,\n \"score\": 149888.55622072855\n },\n {\n \"content\": \"// Read metadata of any format (only V1 is supported now) from a reader.\\n\\n// This will fail if the file is not a valid sstable.\\n\\nfn read_metadata<B: Read + Seek>(mut file: B) -> Result<MetaResult> {\\n\\n file.seek(SeekFrom::Start(0))?;\\n\\n let mut reader = posreader::PosReader::new(BufReader::new(file), 0);\\n\\n let mut buf = [0; MAGIC.len()];\\n\\n if reader.read(&mut buf)? != MAGIC.len() {\\n\\n return Err(Error::InvalidData(\\\"not an sstable\\\"));\\n\\n }\\n\\n if buf != MAGIC {\\n\\n return Err(Error::InvalidData(\\\"not an sstable\\\"));\\n\\n }\\n\\n let version: Version = bincode::deserialize_from(&mut reader)?;\\n\\n let meta = match version {\\n\\n VERSION_30 => {\\n\\n let meta: MetaV3_0 = bincode::deserialize_from(&mut reader)?;\\n\\n MetaData::V3_0(meta)\\n\\n }\\n\\n _ => return Err(Error::UnsupportedVersion(version)),\\n\\n };\\n\\n\\n\\n let offset = reader.current_offset();\\n\\n let mut file = reader.into_inner().into_inner();\\n\\n file.seek(SeekFrom::Start(offset as u64))?;\\n\\n\\n\\n Ok(MetaResult { meta, offset })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 3,\n \"score\": 149503.60750560224\n },\n {\n \"content\": \"/// A writer that maybe compresses the input.\\n\\n///\\n\\n/// The difference with a regular writer, is that if you call reset_compression_context()\\n\\n/// all compression state will be reset and flushed, and the offset in the underlying\\n\\n/// writer will be returned.\\n\\npub trait CompressionContextWriter<I: Write>: Write {\\n\\n /// Reset and flush compression state.\\n\\n ///\\n\\n /// It must be possible to read from the returned offset with a newly\\n\\n /// created decompressor.\\n\\n ///\\n\\n /// Returns number of bytes written so far, i.e. relative offset\\n\\n /// from the creation of Self.\\n\\n fn reset_compression_context(&mut self) -> Result<usize>;\\n\\n fn into_inner(self: Box<Self>) -> Result<I>;\\n\\n}\\n\\n\\n\\npub struct UncompressedWriter<W> {\\n\\n writer: PosWriter<W>,\\n\\n}\\n\\n\\n\\nimpl<W> UncompressedWriter<W> {\\n\\n pub fn new(writer: W) -> Self {\\n\\n UncompressedWriter {\\n\\n writer: PosWriter::new(writer, 0),\\n\",\n \"file_path\": \"src/sstable/compress_ctx_writer.rs\",\n \"rank\": 4,\n \"score\": 149128.62453828414\n },\n {\n \"content\": \"/// A convenience function to write a btree map to a file.\\n\\n///\\n\\n///\\n\\n/// Example:\\n\\n/// ```\\n\\n/// use std::collections::BTreeMap;\\n\\n/// use sstb::sstable::{write_btree_map, WriteOptions};\\n\\n///\\n\\n/// let mut map = BTreeMap::new();\\n\\n/// let filename = \\\"/tmp/some-sstable\\\";\\n\\n/// let write_options = WriteOptions::default();\\n\\n///\\n\\n/// map.insert(b\\\"foo\\\", b\\\"some foo\\\");\\n\\n/// map.insert(b\\\"bar\\\", b\\\"some bar\\\");\\n\\n/// write_btree_map(&map, filename, Some(write_options)).unwrap();\\n\\n/// ```\\n\\npub fn write_btree_map<K: AsRef<[u8]>, V: AsRef<[u8]>, P: AsRef<Path>>(\\n\\n map: &BTreeMap<K, V>,\\n\\n filename: P,\\n\\n options: Option<WriteOptions>,\\n\\n) -> Result<()> {\\n\\n let options = options.unwrap_or_default();\\n\\n let mut writer = writer::SSTableWriterV2::new_with_options(filename, &options)?;\\n\\n\\n\\n for (key, value) in map.iter() {\\n\\n writer.set(key.as_ref(), value.as_ref())?;\\n\\n }\\n\\n writer.close()?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::collections::BTreeMap;\\n\\n\\n\",\n \"file_path\": \"src/sstable/mod.rs\",\n \"rank\": 5,\n \"score\": 143596.56735375128\n },\n {\n \"content\": \"pub trait Compressor<W: Write>: Write {\\n\\n fn into_inner(self) -> Result<W>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 6,\n \"score\": 126900.99306293768\n },\n {\n \"content\": \"pub trait CompressorFactory<W: Write, C: Compressor<W>> {\\n\\n fn from_writer(&self, writer: W) -> C;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 8,\n \"score\": 100192.30168054218\n },\n {\n \"content\": \"struct MetaResult {\\n\\n meta: MetaData,\\n\\n offset: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 9,\n \"score\": 99681.86247595647\n },\n {\n \"content\": \"#[cfg(test)]\\n\\npub fn get_current_pid_rss() -> usize {\\n\\n let pid = format!(\\\"{}\\\", std::process::id());\\n\\n let out = std::process::Command::new(\\\"ps\\\")\\n\\n .args(&[\\\"-p\\\", &pid, \\\"-o\\\", \\\"rss\\\"])\\n\\n .output()\\n\\n .unwrap();\\n\\n let out = String::from_utf8(out.stdout).unwrap();\\n\\n let pid_line = out.lines().nth(1).unwrap();\\n\\n pid_line.trim().parse::<usize>().unwrap()\\n\\n}\\n\",\n \"file_path\": \"src/utils/mod.rs\",\n \"rank\": 10,\n \"score\": 99084.9410414474\n },\n {\n \"content\": \"/// Find the potential start and end offsets of the key.\\n\\n/// This will be used later to fetch the chunk from the page cache.\\n\\nfn find_bounds<K, T>(map: &BTreeMap<K, T>, key: &[u8], end_default: T) -> Option<(T, T)>\\n\\nwhere\\n\\n K: Borrow<[u8]> + std::cmp::Ord,\\n\\n T: Copy,\\n\\n{\\n\\n use std::ops::Bound;\\n\\n\\n\\n let start = {\\n\\n let mut iter_left = map.range::<[u8], _>((Bound::Unbounded, Bound::Included(key)));\\n\\n let closest_left = iter_left.next_back();\\n\\n match closest_left {\\n\\n Some((_, offset)) => *offset,\\n\\n None => return None,\\n\\n }\\n\\n };\\n\\n\\n\\n let end = {\\n\\n let mut iter_right = map.range::<[u8], _>((Bound::Excluded(key), Bound::Unbounded));\\n\\n let closest_right = iter_right.next();\\n\\n match closest_right {\\n\\n Some((_, offset)) => *offset,\\n\\n None => end_default,\\n\\n }\\n\\n };\\n\\n Some((start, end))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 11,\n \"score\": 98152.77994097568\n },\n {\n \"content\": \"pub trait Uncompress {\\n\\n fn uncompress(&self, buf: &[u8]) -> Result<Vec<u8>>;\\n\\n}\\n\\n\\n\\n/// ZLIB\\n\\npub struct ZlibCompressorFactory<W: Write> {\\n\\n compression: flate2::Compression,\\n\\n marker: std::marker::PhantomData<W>,\\n\\n}\\n\\n\\n\\npub struct ZlibCompressor<W: Write> {\\n\\n inner: flate2::write::ZlibEncoder<W>,\\n\\n}\\n\\n\\n\\npub struct ZlibUncompress {}\\n\\n\\n\\nimpl<W: Write> ZlibCompressor<W> {\\n\\n pub fn new(writer: W, compression: flate2::Compression) -> Self {\\n\\n Self {\\n\\n inner: flate2::write::ZlibEncoder::new(writer, compression),\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 12,\n \"score\": 87699.504242712\n },\n {\n \"content\": \"/// PageCache is something that can get byte chunks of a given length, given an offset.\\n\\n///\\n\\n/// This is used for 2 purposes: reading from disk, and optionally uncompressing the\\n\\n/// chunk that was read from disk.\\n\\n///\\n\\n/// If compression is used, there are 2 PageCache objects used - one to read from disk\\n\\n/// (or mmap buffer), and another to uncompress that and cache the result.\\n\\n/// In the latter case, the outer PageCache wraps the inner one.\\n\\n///\\n\\n/// Note, that this cannot be used concurrently, note the &mut self. For concurrent use,\\n\\n/// more complicated concurrent cache can be used, from another file.\\n\\npub trait PageCache {\\n\\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]>;\\n\\n}\\n\\n\\n\\n/// This is used to read from the mmap'ed region. It's a mere proxy to the slice.\\n\\npub struct StaticBufCache {\\n\\n buf: &'static [u8],\\n\\n}\\n\\n\\n\\nimpl StaticBufCache {\\n\\n pub fn new(buf: &'static [u8]) -> Self {\\n\\n Self { buf }\\n\\n }\\n\\n pub fn get_buf(&self) -> &'static [u8] {\\n\\n self.buf\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PageCache for StaticBufCache {\\n\\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\\n\",\n \"file_path\": \"src/sstable/page_cache.rs\",\n \"rank\": 13,\n \"score\": 83456.5879590894\n },\n {\n \"content\": \"pub trait ConcurrentPageCache {\\n\\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes>;\\n\\n}\\n\\n\\n\\nimpl ConcurrentPageCache for page_cache::StaticBufCache {\\n\\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\\n\\n // if this was mmaped, there will be no truncation.\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n self.get_buf()\\n\\n .get(offset as usize..(offset + length) as usize)\\n\\n .map(Bytes::from_static)\\n\\n .ok_or(error::INVALID_DATA)\\n\\n }\\n\\n}\\n\\n\\n\\npub struct FileBackedPageCache {\\n\\n file: File,\\n\\n caches: ConcurrentLRUCache,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/concurrent_page_cache.rs\",\n \"rank\": 14,\n \"score\": 79819.41174252215\n },\n {\n \"content\": \"fn compare_with_others(c: &mut Criterion) {\\n\\n let size = 100_000;\\n\\n use rocksdb::{DBCompressionType, Options, DB};\\n\\n let path = \\\"/tmp/sstb\\\";\\n\\n let rocks_path = \\\"/tmp/rocksdb-rust-lsm\\\";\\n\\n\\n\\n let bench = |group: &mut BenchmarkGroup<_>, state: &TestState, suffix: f32, threads| {\\n\\n let pool = rayon::ThreadPoolBuilder::new()\\n\\n .num_threads(threads)\\n\\n .build()\\n\\n .unwrap();\\n\\n\\n\\n for (name, opts) in [\\n\\n (\\\"rocksdb,mmap-reads,no-compression\\\", {\\n\\n let mut opts = Options::default();\\n\\n opts.set_compression_type(DBCompressionType::None);\\n\\n opts.set_allow_mmap_reads(true);\\n\\n opts.create_if_missing(true);\\n\\n opts\\n\\n }),\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 15,\n \"score\": 78872.30058336235\n },\n {\n \"content\": \"fn criterion_benchmark(c: &mut Criterion) {\\n\\n let make_write_opts = |compression, flush| {\\n\\n WriteOptions::default()\\n\\n .compression(compression)\\n\\n .flush_every(flush)\\n\\n .clone()\\n\\n };\\n\\n let filename = \\\"/tmp/sstable\\\";\\n\\n let variants = vec![\\n\\n (\\n\\n \\\"mmap,compress=none,flush=4096,nocache\\\",\\n\\n make_write_opts(Compression::None, 4096),\\n\\n ReadOptions::default().cache(None).use_mmap(true).clone(),\\n\\n ),\\n\\n (\\n\\n \\\"mmap,compress=none,flush=4096,nocache,use_bloom=false\\\",\\n\\n make_write_opts(Compression::None, 4096),\\n\\n ReadOptions::default()\\n\\n .cache(None)\\n\\n .use_mmap(true)\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 16,\n \"score\": 78872.30058336235\n },\n {\n \"content\": \"/// An efficient way to deserialize and NOT fail when the reader is at EOF right\\n\\n/// from the start, without any allocations.\\n\\npub fn deserialize_from_eof_is_ok<T: serde::de::DeserializeOwned, R: Read>(\\n\\n reader: R,\\n\\n) -> Result<Option<T>> {\\n\\n let mut pr = PosReader::new(reader, 0);\\n\\n let result = bincode::deserialize_from::<_, T>(&mut pr);\\n\\n match result {\\n\\n Ok(val) => Ok(Some(val)),\\n\\n Err(e) => match &*e {\\n\\n bincode::ErrorKind::Io(ioe) => {\\n\\n if ioe.kind() == std::io::ErrorKind::UnexpectedEof && pr.current_offset() == 0 {\\n\\n // This is actually fine and we hit EOF right away.\\n\\n return Ok(None);\\n\\n }\\n\\n Err(e.into())\\n\\n }\\n\\n _ => Err(e.into()),\\n\\n },\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sstable/utils.rs\",\n \"rank\": 17,\n \"score\": 60056.949478944414\n },\n {\n \"content\": \"/// An object that can find the potential start and end offsets of the key.\\n\\n///\\n\\n/// A trait is used instead of a struct cause we have multiple implementations,\\n\\n/// owning and not owning.\\n\\ntrait Index {\\n\\n fn find_bounds(&self, key: &[u8], end_default: u64) -> Option<(u64, u64)>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 18,\n \"score\": 47266.146714013434\n },\n {\n \"content\": \"struct KV {\\n\\n key: Vec<u8>,\\n\\n is_present: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 19,\n \"score\": 47255.12218825896\n },\n {\n \"content\": \"/// An index that is used with Mmap blocks.\\n\\nstruct MemIndex {\\n\\n index: BTreeMap<&'static [u8], u64>,\\n\\n}\\n\\n\\n\\nimpl MemIndex {\\n\\n fn from_static_buf(buf: &'static [u8], expected_len: u64) -> Result<Self> {\\n\\n // Build the index from mmap here.\\n\\n let mut index = BTreeMap::new();\\n\\n let mut index_data = &buf[..];\\n\\n if index_data.len() as u64 != expected_len {\\n\\n return Err(Error::InvalidData(\\\"invalid index length\\\"));\\n\\n }\\n\\n\\n\\n let kvoffset_encoded_size = KVOffset::encoded_size();\\n\\n\\n\\n while !index_data.is_empty() {\\n\\n let kvoffset = bincode::deserialize::<KVOffset>(\\n\\n index_data\\n\\n .get(..kvoffset_encoded_size)\\n\\n .ok_or(INVALID_DATA)?,\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 20,\n \"score\": 46047.24577421584\n },\n {\n \"content\": \"struct Inner {\\n\\n value: RwLock<Option<Bytes>>,\\n\\n}\\n\\n\\n\\nimpl Inner {\\n\\n fn new() -> Self {\\n\\n Self {\\n\\n value: RwLock::new(None),\\n\\n }\\n\\n }\\n\\n fn get_or_insert<F>(&self, func: F) -> Result<Bytes>\\n\\n where\\n\\n F: Fn() -> Result<Bytes>,\\n\\n {\\n\\n {\\n\\n let g = self.value.read();\\n\\n if let Some(bytes) = g.as_ref() {\\n\\n return Ok(bytes.clone());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/sstable/concurrent_lru.rs\",\n \"rank\": 21,\n \"score\": 46044.11570010401\n },\n {\n \"content\": \"struct OwnedIndex {\\n\\n index: BTreeMap<Vec<u8>, u64>,\\n\\n}\\n\\n\\n\\nimpl OwnedIndex {\\n\\n fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\\n\\n let mut index = BTreeMap::new();\\n\\n\\n\\n loop {\\n\\n let kvoffset = KVOffset::deserialize_from_eof_is_ok(&mut reader)?;\\n\\n let kvoffset = match kvoffset {\\n\\n Some(kvoffset) => kvoffset,\\n\\n None => break,\\n\\n };\\n\\n let mut key = vec![0; kvoffset.key_length as usize];\\n\\n reader.read_exact(&mut key)?;\\n\\n index.insert(key, kvoffset.offset);\\n\\n }\\n\\n Ok(Self { index })\\n\\n }\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 22,\n \"score\": 46044.11570010401\n },\n {\n \"content\": \"struct TestState {\\n\\n sorted_iter: SortedBytesIterator,\\n\\n shuffled: Vec<KV>,\\n\\n}\\n\\n\\n\\nimpl TestState {\\n\\n fn new(len: usize, limit: usize, percent_missing: f32) -> Self {\\n\\n let mut it = SortedBytesIterator::new(len, limit).unwrap();\\n\\n let shuffled = {\\n\\n let mut shuffled: Vec<KV> = Vec::with_capacity(limit * 2);\\n\\n let mut small_rng = SmallRng::from_seed(*b\\\"seedseedseedseed\\\");\\n\\n let missing_threshold = u32::max_value() as f64 * percent_missing as f64;\\n\\n let missing_threshold = if missing_threshold > u32::max_value() as f64 {\\n\\n u32::max_value()\\n\\n } else if missing_threshold < 0. {\\n\\n 0\\n\\n } else {\\n\\n missing_threshold as u32\\n\\n };\\n\\n while let Some(value) = it.next() {\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 23,\n \"score\": 46044.11570010401\n },\n {\n \"content\": \"struct InnerReader {\\n\\n index: Box<dyn Index>,\\n\\n // This is just to hold an mmap reference to be dropped in the end.\\n\\n _mmap: Option<memmap::Mmap>,\\n\\n page_cache: Box<dyn page_cache::PageCache>,\\n\\n meta: MetaV3_0,\\n\\n data_start: u64,\\n\\n use_bloom_default: bool,\\n\\n bloom: Bloom<[u8]>,\\n\\n}\\n\\n\\n\\nimpl InnerReader {\\n\\n pub fn new(\\n\\n mut file: File,\\n\\n data_start: u64,\\n\\n meta: MetaResult,\\n\\n opts: &ReadOptions,\\n\\n ) -> Result<Self> {\\n\\n #[allow(clippy::infallible_destructuring_match)]\\n\\n let meta = match meta.meta {\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 24,\n \"score\": 46044.11570010401\n },\n {\n \"content\": \"struct ConcurrentInnerReader {\\n\\n index: Box<dyn Index + Sync + Send>,\\n\\n // This is just to hold an mmap reference to be dropped in the end.\\n\\n _mmap: Option<memmap::Mmap>,\\n\\n page_cache: Box<dyn concurrent_page_cache::ConcurrentPageCache + Sync + Send>,\\n\\n meta: MetaV3_0,\\n\\n data_start: u64,\\n\\n use_bloom_default: bool,\\n\\n bloom: Bloom<[u8]>,\\n\\n}\\n\\n\\n\\nimpl ConcurrentInnerReader {\\n\\n pub fn new(\\n\\n mut file: File,\\n\\n data_start: u64,\\n\\n meta: MetaResult,\\n\\n opts: &ReadOptions,\\n\\n ) -> Result<Self> {\\n\\n #[allow(clippy::infallible_destructuring_match)]\\n\\n let meta = match meta.meta {\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 25,\n \"score\": 44933.85874728962\n },\n {\n \"content\": \"fn default_criterion() -> Criterion {\\n\\n Criterion::default().sample_size(10)\\n\\n}\\n\\n\\n\\ncriterion_group! {\\n\\n name = sstable;\\n\\n config = default_criterion();\\n\\n targets = criterion_benchmark, compare_with_others\\n\\n}\\n\\n\\n\\ncriterion_main!(sstable);\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 26,\n \"score\": 42295.093529176964\n },\n {\n \"content\": \"use super::error::Error;\\n\\n\\n\\npub type Result<T> = core::result::Result<T, Error>;\\n\",\n \"file_path\": \"src/sstable/result.rs\",\n \"rank\": 27,\n \"score\": 29317.43946709647\n },\n {\n \"content\": \"/// Options for writing sstables.\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct WriteOptions {\\n\\n /// Compression to use. The default is None.\\n\\n pub compression: Compression,\\n\\n /// How often to store the records in the index.\\n\\n pub flush_every: usize,\\n\\n /// Options for the bloom filter.\\n\\n pub bloom: BloomConfig,\\n\\n}\\n\\n\\n\\nimpl WriteOptions {\\n\\n pub fn new() -> Self {\\n\\n Self::default()\\n\\n }\\n\\n pub fn compression(&mut self, compression: Compression) -> &mut Self {\\n\\n self.compression = compression;\\n\\n self\\n\\n }\\n\\n pub fn flush_every(&mut self, flush_every: usize) -> &mut Self {\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 28,\n \"score\": 29171.070798337314\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl ReadOptions {\\n\\n pub fn new() -> Self {\\n\\n Self::default()\\n\\n }\\n\\n pub fn cache(&mut self, cache: Option<ReadCache>) -> &mut Self {\\n\\n self.cache = cache;\\n\\n self\\n\\n }\\n\\n pub fn use_mmap(&mut self, use_mmap: bool) -> &mut Self {\\n\\n self.use_mmap = use_mmap;\\n\\n self\\n\\n }\\n\\n pub fn use_bloom(&mut self, use_bloom: bool) -> &mut Self {\\n\\n self.use_bloom = use_bloom;\\n\\n self\\n\\n }\\n\\n pub fn thread_buckets(&mut self, thread_buckets: Option<usize>) -> &mut Self {\\n\\n self.thread_buckets = thread_buckets;\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 29,\n \"score\": 29169.921276512807\n },\n {\n \"content\": \" pub use_bloom: bool,\\n\\n}\\n\\n\\n\\nimpl GetOptions {\\n\\n pub fn new() -> Self {\\n\\n Self::default()\\n\\n }\\n\\n pub fn use_bloom(&mut self, use_bloom: bool) -> &mut Self {\\n\\n self.use_bloom = use_bloom;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for GetOptions {\\n\\n fn default() -> Self {\\n\\n Self { use_bloom: true }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 30,\n \"score\": 29169.4164442337\n },\n {\n \"content\": \" self.flush_every = flush_every;\\n\\n self\\n\\n }\\n\\n pub fn bloom(&mut self, bloom: BloomConfig) -> &mut Self {\\n\\n self.bloom = bloom;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for WriteOptions {\\n\\n fn default() -> Self {\\n\\n WriteOptions {\\n\\n compression: Compression::None,\\n\\n flush_every: 4096,\\n\\n bloom: BloomConfig::default(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Configures the caches for reading.\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 31,\n \"score\": 29166.11537678911\n },\n {\n \"content\": \"impl Default for ReadCache {\\n\\n fn default() -> Self {\\n\\n Self::Unbounded\\n\\n }\\n\\n}\\n\\n\\n\\n/// Options for reading sstables.\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub struct ReadOptions {\\n\\n /// The caching strategy to use.\\n\\n pub cache: Option<ReadCache>,\\n\\n /// If mmap can be used for reading the sstable from disk.\\n\\n pub use_mmap: bool,\\n\\n /// How many buckets to split the caches into for efficient\\n\\n /// thread-safe access.\\n\\n pub thread_buckets: Option<usize>,\\n\\n // Set if you want to use bloom filters during lookups.\\n\\n // This has a performance penalty for positive lookups,\\n\\n // but if you have a lot of maybe-negative, it should make things faster.\\n\\n pub use_bloom: bool,\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 32,\n \"score\": 29163.56029398526\n },\n {\n \"content\": \"use super::types::Compression;\\n\\n\\n\\nuse lru::LruCache;\\n\\n\\n\\n// The configuration for the bloom filter.\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct BloomConfig {\\n\\n pub bitmap_size: u32,\\n\\n pub items_count: usize,\\n\\n}\\n\\n\\n\\nimpl Default for BloomConfig {\\n\\n fn default() -> Self {\\n\\n return Self {\\n\\n bitmap_size: 1_000_000,\\n\\n items_count: 1_000_000,\\n\\n };\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 33,\n \"score\": 29162.833521798046\n },\n {\n \"content\": \" self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for ReadOptions {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n cache: Some(ReadCache::default()),\\n\\n use_mmap: true,\\n\\n thread_buckets: Some(num_cpus::get()),\\n\\n use_bloom: true,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Options for \\\"get\\\" method.\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub struct GetOptions {\\n\\n /// Set this if you want to use the bloom filter to speed\\n\\n /// up negative lookups at a cost for positive lookup.\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 34,\n \"score\": 29161.85172921269\n },\n {\n \"content\": \"#[derive(Copy, Clone, Debug)]\\n\\npub enum ReadCache {\\n\\n // How many chunks(blocks) to store in LRU.\\n\\n Blocks(usize),\\n\\n // Unbounded cache, the default.\\n\\n Unbounded,\\n\\n}\\n\\n\\n\\nimpl ReadCache {\\n\\n pub fn lru<K, V>(&self) -> LruCache<K, V>\\n\\n where\\n\\n K: std::cmp::Eq + std::hash::Hash,\\n\\n {\\n\\n match self {\\n\\n Self::Blocks(b) => LruCache::new(*b),\\n\\n Self::Unbounded => LruCache::unbounded(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/options.rs\",\n \"rank\": 35,\n \"score\": 29157.38783519341\n },\n {\n \"content\": \"enum MetaData {\\n\\n V3_0(MetaV3_0),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 44,\n \"score\": 26873.747280632982\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> Write for UncompressedWriter<W> {\\n\\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\\n\\n self.writer.write(buf)\\n\\n }\\n\\n\\n\\n fn flush(&mut self) -> std::io::Result<()> {\\n\\n self.writer.flush()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> CompressionContextWriter<W> for UncompressedWriter<W> {\\n\\n fn reset_compression_context(&mut self) -> Result<usize> {\\n\\n Ok(usize::try_from(self.writer.current_offset())?)\\n\\n }\\n\\n fn into_inner(self: Box<Self>) -> Result<W> {\\n\\n Ok(self.writer.into_inner())\\n\",\n \"file_path\": \"src/sstable/compress_ctx_writer.rs\",\n \"rank\": 45,\n \"score\": 26448.86784154131\n },\n {\n \"content\": \" factory,\\n\\n _w: std::marker::PhantomData {},\\n\\n }\\n\\n }\\n\\n fn get_mut_compressor(&mut self) -> Result<&mut C> {\\n\\n Ok(self.compressor.as_mut().ok_or(COMPRESSOR_MISSING)?)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F, C, W> Write for CompressionContextWriterImpl<F, C, W>\\n\\nwhere\\n\\n F: CompressorFactory<PosWriter<W>, C>,\\n\\n W: Write,\\n\\n C: Compressor<PosWriter<W>>,\\n\\n{\\n\\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\\n\\n self.get_mut_compressor().unwrap().write(buf)\\n\\n }\\n\\n\\n\\n fn flush(&mut self) -> std::io::Result<()> {\\n\",\n \"file_path\": \"src/sstable/compress_ctx_writer.rs\",\n \"rank\": 46,\n \"score\": 26444.436398103826\n },\n {\n \"content\": \" self.get_mut_compressor().unwrap().flush()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<F, C, W> CompressionContextWriter<W> for CompressionContextWriterImpl<F, C, W>\\n\\nwhere\\n\\n F: CompressorFactory<PosWriter<W>, C>,\\n\\n W: Write,\\n\\n C: Compressor<PosWriter<W>>,\\n\\n{\\n\\n fn reset_compression_context(&mut self) -> Result<usize> {\\n\\n let enc = self.compressor.take().ok_or(COMPRESSOR_MISSING)?;\\n\\n let pos_writer = enc.into_inner()?;\\n\\n let offset = pos_writer.current_offset();\\n\\n self.compressor\\n\\n .replace(self.factory.from_writer(pos_writer));\\n\\n Ok(usize::try_from(offset)?)\\n\\n }\\n\\n fn into_inner(mut self: Box<Self>) -> Result<W> {\\n\\n let enc = self.compressor.take().ok_or(COMPRESSOR_MISSING)?;\\n\\n Ok(enc.into_inner()?.into_inner())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sstable/compress_ctx_writer.rs\",\n \"rank\": 47,\n \"score\": 26441.998195117983\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n/// A version of CompressionContextWriter that knows\\n\\n/// how to create new compressors (encoders) from a factory.\\n\\npub struct CompressionContextWriterImpl<F, C, W> {\\n\\n factory: F,\\n\\n compressor: Option<C>,\\n\\n _w: std::marker::PhantomData<W>,\\n\\n}\\n\\n\\n\\nimpl<F, C, W> CompressionContextWriterImpl<F, C, W>\\n\\nwhere\\n\\n F: CompressorFactory<PosWriter<W>, C>,\\n\\n W: Write,\\n\\n C: Compressor<PosWriter<W>>,\\n\\n{\\n\\n pub fn new(writer: W, factory: F) -> Self {\\n\\n Self {\\n\\n compressor: Some(factory.from_writer(PosWriter::new(writer, 0))),\\n\",\n \"file_path\": \"src/sstable/compress_ctx_writer.rs\",\n \"rank\": 48,\n \"score\": 26440.81215867089\n },\n {\n \"content\": \"use std::io::Write;\\n\\n\\n\\nuse super::compression::*;\\n\\nuse super::poswriter::PosWriter;\\n\\nuse super::{Error, Result};\\n\\nuse std::convert::TryFrom;\\n\\n\\n\\nconst COMPRESSOR_MISSING: Error = Error::ProgrammingError(\\\"compressor missing\\\");\\n\\n\\n\\n/// A writer that maybe compresses the input.\\n\\n///\\n\\n/// The difference with a regular writer, is that if you call reset_compression_context()\\n\\n/// all compression state will be reset and flushed, and the offset in the underlying\\n\\n/// writer will be returned.\\n\",\n \"file_path\": \"src/sstable/compress_ctx_writer.rs\",\n \"rank\": 49,\n \"score\": 26436.94059188318\n },\n {\n \"content\": \" bloom: Bloom<[u8]>,\\n\\n}\\n\\n\\n\\nimpl MmapUncompressedSSTableReader {\\n\\n /// Construct a new mmap reader from a file with default options.\\n\\n ///\\n\\n /// `new_with_options` has more details.\\n\\n pub fn new<P: AsRef<Path>>(filename: P) -> Result<Self> {\\n\\n Self::new_with_options(filename, &ReadOptions::default())\\n\\n }\\n\\n\\n\\n /// Construct a new mmap reader from a file.\\n\\n ///\\n\\n /// All options except \\\"use_bloom\\\" are ignored.\\n\\n ///\\n\\n /// Returns `Error::CantUseCompressedFileWithMultiThreadedMmap` if you try to open a compressed file with it.\\n\\n pub fn new_with_options<P: AsRef<Path>>(filename: P, opts: &ReadOptions) -> Result<Self> {\\n\\n let mut file = File::open(filename)?;\\n\\n let meta = read_metadata(&mut file)?;\\n\\n let data_start = meta.offset as u64;\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 50,\n \"score\": 28.265756371482908\n },\n {\n \"content\": \" &mut self,\\n\\n key: &[u8],\\n\\n options: Option<GetOptions>,\\n\\n ) -> Result<Option<&[u8]>> {\\n\\n let use_bloom = options\\n\\n .map(|o| o.use_bloom)\\n\\n .unwrap_or(self.use_bloom_default);\\n\\n if use_bloom && !self.bloom.check(key) {\\n\\n return Ok(None);\\n\\n }\\n\\n let index_start = self.data_start + self.meta.data_len as u64;\\n\\n let (offset, right_bound) = match self.index.find_bounds(key, index_start) {\\n\\n Some(v) => v,\\n\\n None => return Ok(None),\\n\\n };\\n\\n\\n\\n let chunk = self.page_cache.get_chunk(offset, right_bound - offset)?;\\n\\n Ok(find_value_offset_v2(chunk, key)?.map(|(start, end)| &chunk[start..end]))\\n\\n }\\n\\n\\n\\n fn get(&mut self, key: &[u8]) -> Result<Option<&[u8]>> {\\n\\n self.get_with_options(key, None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 51,\n \"score\": 25.886616275571\n },\n {\n \"content\": \" pub key_length: KeyLength,\\n\\n pub value_length: ValueLength,\\n\\n}\\n\\n\\n\\nimpl KVLength {\\n\\n pub fn new(k: usize, v: usize) -> Result<Self> {\\n\\n Ok(Self {\\n\\n key_length: KeyLength::try_from(k).map_err(|_| Error::KeyTooLong(k))?,\\n\\n value_length: ValueLength::try_from(v).map_err(|_| Error::ValueTooLong(v))?,\\n\\n })\\n\\n }\\n\\n pub const fn encoded_size() -> usize {\\n\\n // can't use sizeof Self as bincode has no padding while the struct might.\\n\\n size_of::<KeyLength>() + size_of::<ValueLength>()\\n\\n }\\n\\n pub fn serialize_into<W: Write>(&self, w: W) -> Result<()> {\\n\\n Ok(bincode::serialize_into(w, self)?)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/ondisk_format.rs\",\n \"rank\": 52,\n \"score\": 25.67458738077324\n },\n {\n \"content\": \" &mut self.w\\n\\n }\\n\\n pub fn into_inner(self) -> W {\\n\\n self.w\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> Write for PosWriter<W> {\\n\\n fn write(&mut self, buf: &[u8]) -> Result<usize> {\\n\\n let l = self.w.write(buf)?;\\n\\n self.offset += l as u64;\\n\\n Ok(l)\\n\\n }\\n\\n\\n\\n fn flush(&mut self) -> Result<()> {\\n\\n self.w.flush()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sstable/poswriter.rs\",\n \"rank\": 53,\n \"score\": 24.40421104581772\n },\n {\n \"content\": \" })\\n\\n }\\n\\n\\n\\n pub fn get<'a>(&'a self, key: &[u8]) -> Result<Option<&'a [u8]>> {\\n\\n self.get_with_options(key, None)\\n\\n }\\n\\n\\n\\n /// Get a key from the sstable with options.\\n\\n pub fn get_with_options<'a>(\\n\\n &'a self,\\n\\n key: &[u8],\\n\\n options: Option<GetOptions>,\\n\\n ) -> Result<Option<&'a [u8]>> {\\n\\n let use_bloom = options\\n\\n .map(|o| o.use_bloom)\\n\\n .unwrap_or(self.use_bloom_default);\\n\\n if use_bloom && !self.bloom.check(key) {\\n\\n return Ok(None);\\n\\n }\\n\\n let (offset, right_bound) = match self.index.find_bounds(key, self.index_start) {\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 54,\n \"score\": 24.16316382256028\n },\n {\n \"content\": \" page_cache: uncompressed_cache,\\n\\n data_start,\\n\\n meta,\\n\\n bloom,\\n\\n use_bloom_default: opts.use_bloom,\\n\\n })\\n\\n }\\n\\n\\n\\n fn get(&self, key: &[u8]) -> Result<Option<Bytes>> {\\n\\n self.get_with_options(key, None)\\n\\n }\\n\\n\\n\\n fn get_with_options(&self, key: &[u8], options: Option<GetOptions>) -> Result<Option<Bytes>> {\\n\\n let use_bloom = options\\n\\n .map(|o| o.use_bloom)\\n\\n .unwrap_or(self.use_bloom_default);\\n\\n if use_bloom && !self.bloom.check(key) {\\n\\n return Ok(None);\\n\\n }\\n\\n let index_start = self.data_start + self.meta.data_len as u64;\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 55,\n \"score\": 23.126617968781535\n },\n {\n \"content\": \"/// If your data is uncompressed, you probably better use `MmapUncompressedSSTableReader`,\\n\\n/// which is a lot simpler wait-free implementation.\\n\\n///\\n\\n/// However mmap's one superiority needs to be confirmed in benchmarks. There are benchmarks,\\n\\n/// but conclusions are TBD.\\n\\npub struct ConcurrentSSTableReader {\\n\\n inner: ConcurrentInnerReader,\\n\\n}\\n\\n\\n\\nimpl ConcurrentSSTableReader {\\n\\n pub fn new<P: AsRef<Path>>(filename: P) -> Result<Self> {\\n\\n Self::new_with_options(filename, &ReadOptions::default())\\n\\n }\\n\\n\\n\\n pub fn new_with_options<P: AsRef<Path>>(filename: P, opts: &ReadOptions) -> Result<Self> {\\n\\n let mut file = File::open(filename)?;\\n\\n let meta = read_metadata(&mut file)?;\\n\\n let data_start = meta.offset as u64;\\n\\n let inner = ConcurrentInnerReader::new(file, data_start, meta, opts)?;\\n\\n Ok(Self { inner })\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 56,\n \"score\": 22.31213204213309\n },\n {\n \"content\": \"use std::io::{Result, Write};\\n\\n\\n\\n// PosWriter is a Writer that remembers the position and can report it at any time.\\n\\n#[derive(Debug)]\\n\\npub struct PosWriter<W> {\\n\\n w: W,\\n\\n offset: u64,\\n\\n}\\n\\n\\n\\nimpl<W> PosWriter<W> {\\n\\n pub fn new(w: W, offset: u64) -> Self {\\n\\n PosWriter { w, offset }\\n\\n }\\n\\n pub fn current_offset(&self) -> u64 {\\n\\n self.offset\\n\\n }\\n\\n pub fn reset_offset(&mut self, offset: u64) {\\n\\n self.offset = offset;\\n\\n }\\n\\n pub fn get_mut(&mut self) -> &mut W {\\n\",\n \"file_path\": \"src/sstable/poswriter.rs\",\n \"rank\": 57,\n \"score\": 21.979836047161676\n },\n {\n \"content\": \"#[derive(Serialize, Deserialize, Debug, Default)]\\n\\npub struct KVOffset {\\n\\n pub key_length: KeyLength,\\n\\n pub offset: Offset,\\n\\n}\\n\\n\\n\\nimpl KVOffset {\\n\\n pub fn new(k: usize, offset: Offset) -> Result<Self> {\\n\\n Ok(Self {\\n\\n key_length: KeyLength::try_from(k).map_err(|_| Error::KeyTooLong(k))?,\\n\\n offset,\\n\\n })\\n\\n }\\n\\n pub const fn encoded_size() -> usize {\\n\\n // can't use sizeof Self as bincode has no padding while the struct might.\\n\\n size_of::<KeyLength>() + size_of::<Offset>()\\n\\n }\\n\\n pub fn deserialize_from_eof_is_ok<R: Read>(r: R) -> Result<Option<Self>> {\\n\\n Ok(deserialize_from_eof_is_ok(r)?)\\n\\n }\\n\",\n \"file_path\": \"src/sstable/ondisk_format.rs\",\n \"rank\": 58,\n \"score\": 20.866977872849258\n },\n {\n \"content\": \" let (offset, right_bound) = match self.index.find_bounds(key, index_start) {\\n\\n Some(v) => v,\\n\\n None => return Ok(None),\\n\\n };\\n\\n\\n\\n let chunk: Bytes = self.page_cache.get_chunk(offset, right_bound - offset)?;\\n\\n if let Some((start, end)) = find_value_offset_v2(&chunk, key)? {\\n\\n Ok(Some(chunk.slice(start..end)))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SSTableReader {\\n\\n pub fn new<P: AsRef<Path>>(filename: P) -> Result<Self> {\\n\\n Self::new_with_options(filename, &ReadOptions::default())\\n\\n }\\n\\n\\n\\n pub fn new_with_options<P: AsRef<Path>>(filename: P, opts: &ReadOptions) -> Result<Self> {\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 59,\n \"score\": 20.69295158330976\n },\n {\n \"content\": \"impl ConcurrentLRUCache {\\n\\n pub fn new(shards: usize, cache: Option<ReadCache>) -> Self {\\n\\n Self {\\n\\n caches: cache.map(|cache| (0..shards).map(|_| Mutex::new(cache.lru())).collect()),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get or insert the value into the cache. The inserted value is computed\\n\\n /// using the provided callback.\\n\\n ///\\n\\n /// The shard-level lock is NOT held during the computation.\\n\\n /// During the computation the chunk-level lock is held, so only threads contending\\n\\n /// on the specific chunk will get blocked.\\n\\n pub fn get_or_insert<F>(&self, offset: u64, func: F) -> Result<Bytes>\\n\\n where\\n\\n F: Fn() -> Result<Bytes>,\\n\\n {\\n\\n let caches = match self.caches.as_ref() {\\n\\n Some(caches) => caches,\\n\\n None => return func(),\\n\",\n \"file_path\": \"src/sstable/concurrent_lru.rs\",\n \"rank\": 60,\n \"score\": 19.767907705463713\n },\n {\n \"content\": \"\\n\\npub use writer::RawSSTableWriter;\\n\\npub use writer::SSTableWriterV2;\\n\\n\\n\\npub use error::{Error, INVALID_DATA};\\n\\npub use options::*;\\n\\npub use result::Result;\\n\\npub use types::*;\\n\\n\\n\\n/// A convenience function to write a btree map to a file.\\n\\n///\\n\\n///\\n\\n/// Example:\\n\\n/// ```\\n\\n/// use std::collections::BTreeMap;\\n\\n/// use sstb::sstable::{write_btree_map, WriteOptions};\\n\\n///\\n\\n/// let mut map = BTreeMap::new();\\n\\n/// let filename = \\\"/tmp/some-sstable\\\";\\n\\n/// let write_options = WriteOptions::default();\\n\\n///\\n\\n/// map.insert(b\\\"foo\\\", b\\\"some foo\\\");\\n\\n/// map.insert(b\\\"bar\\\", b\\\"some bar\\\");\\n\\n/// write_btree_map(&map, filename, Some(write_options)).unwrap();\\n\\n/// ```\\n\",\n \"file_path\": \"src/sstable/mod.rs\",\n \"rank\": 61,\n \"score\": 19.73856072019538\n },\n {\n \"content\": \" let mut file = File::open(filename)?;\\n\\n let meta = read_metadata(&mut file)?;\\n\\n let data_start = meta.offset as u64;\\n\\n let inner = InnerReader::new(file, data_start, meta, opts)?;\\n\\n Ok(SSTableReader { inner })\\n\\n }\\n\\n pub fn get(&mut self, key: &[u8]) -> Result<Option<&[u8]>> {\\n\\n self.inner.get(key)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A reader that can be used efficiently from multiple threads.\\n\\n///\\n\\n/// There is internal mutability inside. The LRU caches are sharded into multiple locks.\\n\\n///\\n\\n/// You get `Bytes` references in return instead of slices, so that atomic reference counting\\n\\n/// can happen behind the scenes for properly tracking chunks still in-use.\\n\\n///\\n\\n/// If you want to use this with multiple threads just put it into an `Arc`.\\n\\n///\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 62,\n \"score\": 19.419992799539443\n },\n {\n \"content\": \" pub fn serialize_into<W: Write>(&self, w: W) -> Result<()> {\\n\\n Ok(bincode::serialize_into(w, self)?)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Default, Debug)]\\n\\npub struct BloomV3_0 {\\n\\n pub bitmap_bytes: u32,\\n\\n pub k_num: u32,\\n\\n pub sip_keys: [(u64, u64); 2],\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Default, Debug)]\\n\\npub struct MetaV3_0 {\\n\\n pub data_len: u64,\\n\\n pub index_len: u64,\\n\\n pub bloom_len: u64,\\n\\n pub items: u64,\\n\\n pub compression: Compression,\\n\\n // updating this field is done as the last step.\\n\",\n \"file_path\": \"src/sstable/ondisk_format.rs\",\n \"rank\": 63,\n \"score\": 18.455937086991035\n },\n {\n \"content\": \" fn write_sstable(&self, filename: &str, write_opts: &WriteOptions) -> Result<()> {\\n\\n let mut iter = self.sorted_iter.clone();\\n\\n\\n\\n let mut writer = writer::SSTableWriterV2::new_with_options(filename, write_opts)?;\\n\\n\\n\\n while let Some(key) = iter.next() {\\n\\n writer.set(key, key)?;\\n\\n }\\n\\n\\n\\n writer.finish()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 64,\n \"score\": 18.448286385294864\n },\n {\n \"content\": \"impl FileBackedPageCache {\\n\\n pub fn new(file: File, cache: Option<ReadCache>, count: usize) -> Self {\\n\\n Self {\\n\\n file,\\n\\n caches: ConcurrentLRUCache::new(count, cache),\\n\\n }\\n\\n }\\n\\n fn read_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\\n\\n let buf = pread_exact(self.file.as_raw_fd(), offset, length)?;\\n\\n Ok(Bytes::from(buf))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ConcurrentPageCache for FileBackedPageCache {\\n\\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\\n\\n self.caches\\n\\n .get_or_insert(offset, || self.read_chunk(offset, length))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/concurrent_page_cache.rs\",\n \"rank\": 65,\n \"score\": 17.594867750089104\n },\n {\n \"content\": \" let mut g = self.value.write();\\n\\n match g.as_mut() {\\n\\n Some(bytes) => Ok(bytes.clone()),\\n\\n None => {\\n\\n let value = func()?;\\n\\n g.replace(value.clone());\\n\\n Ok(value)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// An LRU cache of Bytes that can be used by multiple threads\\n\\n/// concurrently.\\n\\n///\\n\\n/// Works by sharding the single-threaded LRUCache into multiple shards.\\n\\npub struct ConcurrentLRUCache {\\n\\n caches: Option<Vec<Mutex<lru::LruCache<u64, Arc<Inner>>>>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/concurrent_lru.rs\",\n \"rank\": 66,\n \"score\": 17.423328700884436\n },\n {\n \"content\": \"\\n\\n/// The resulting sstable files MUST have this prefix.\\n\\npub const MAGIC: &[u8] = b\\\"\\\\x80LSM\\\";\\n\\npub type KeyLength = u16;\\n\\npub type ValueLength = u32;\\n\\npub type Offset = u64;\\n\\n\\n\\nuse super::error::{Error, INVALID_DATA};\\n\\nuse super::result::Result;\\n\\nuse super::types::Compression;\\n\\nuse super::utils::deserialize_from_eof_is_ok;\\n\\nuse core::mem::size_of;\\n\\nuse std::cmp::{Ord, Ordering};\\n\\nuse std::convert::TryFrom;\\n\\nuse std::io::{Read, Write};\\n\\n\\n\\npub use super::types::Version;\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Default)]\\n\\npub struct KVLength {\\n\",\n \"file_path\": \"src/sstable/ondisk_format.rs\",\n \"rank\": 67,\n \"score\": 17.401556512341926\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\npub struct SnappyUncompress {}\\n\\n\\n\\nimpl<W: Write> Write for SnappyCompressor<W> {\\n\\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\\n\\n self.inner.write(buf)\\n\\n }\\n\\n\\n\\n fn flush(&mut self) -> std::io::Result<()> {\\n\\n self.inner.flush()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> Compressor<W> for SnappyCompressor<W> {\\n\\n fn into_inner(self) -> Result<W> {\\n\\n self.inner.into_inner().map_err(|e| {\\n\\n let kind = e.error().kind();\\n\\n let io = std::io::Error::from(kind);\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 68,\n \"score\": 16.891109958773672\n },\n {\n \"content\": \"impl<W: Write> ZlibCompressorFactory<W> {\\n\\n pub fn new(compression: Option<flate2::Compression>) -> Self {\\n\\n ZlibCompressorFactory {\\n\\n compression: compression.unwrap_or_default(),\\n\\n marker: std::marker::PhantomData {},\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> CompressorFactory<W, ZlibCompressor<W>> for ZlibCompressorFactory<W> {\\n\\n fn from_writer(&self, writer: W) -> ZlibCompressor<W> {\\n\\n ZlibCompressor::new(writer, self.compression)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Uncompress for ZlibUncompress {\\n\\n fn uncompress(&self, buf: &[u8]) -> Result<Vec<u8>> {\\n\\n let mut dec = flate2::read::ZlibDecoder::new(Cursor::new(buf));\\n\\n // TODO: buf.len() here is a bad heuristic. Need the real number, this can be pulled during\\n\\n // compression.\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 69,\n \"score\": 16.44995242391304\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> Write for ZlibCompressor<W> {\\n\\n fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {\\n\\n self.inner.write(buf)\\n\\n }\\n\\n\\n\\n fn flush(&mut self) -> std::io::Result<()> {\\n\\n self.inner.flush()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> Compressor<W> for ZlibCompressor<W> {\\n\\n fn into_inner(self) -> Result<W> {\\n\\n Ok(self.inner.finish()?)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 70,\n \"score\": 16.38221438332255\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<R: Read + Seek> PageCache for ReadPageCache<R> {\\n\\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\\n\\n match self.cache.get(&offset) {\\n\\n Some(bytes) => Ok(unsafe { &*(bytes as &[u8] as *const [u8]) }),\\n\\n None => {\\n\\n let mut buf = vec![0; usize::try_from(length)?];\\n\\n // TODO: this can use pread instead of 2 syscalls.\\n\\n self.reader.seek(SeekFrom::Start(offset))?;\\n\\n self.reader.read_exact(&mut buf)?;\\n\\n self.cache.put(offset, buf);\\n\\n Ok(self.cache.get(&offset).unwrap())\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A cache that wraps another one, uncompresses the inner cache's results and\\n\",\n \"file_path\": \"src/sstable/page_cache.rs\",\n \"rank\": 71,\n \"score\": 16.297011162694112\n },\n {\n \"content\": \" let mut buf = Vec::with_capacity(buf.len());\\n\\n dec.read_to_end(&mut buf)?;\\n\\n Ok(buf)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Snappy\\n\\npub struct SnappyCompressorFactory<W: Write> {\\n\\n marker: std::marker::PhantomData<W>,\\n\\n}\\n\\n\\n\\npub struct SnappyCompressor<W: Write> {\\n\\n inner: snap::Writer<W>,\\n\\n}\\n\\n\\n\\nimpl<W: Write> SnappyCompressor<W> {\\n\\n pub fn new(writer: W) -> Self {\\n\\n Self {\\n\\n inner: snap::Writer::new(writer),\\n\\n }\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 72,\n \"score\": 16.19597659375784\n },\n {\n \"content\": \"/// store the uncompressed chunks in the LRU cache inside.\\n\\npub struct WrappedCache<PC, U> {\\n\\n inner: PC,\\n\\n cache: LruCache<u64, Vec<u8>>,\\n\\n uncompress: U,\\n\\n}\\n\\n\\n\\nimpl<PC, U> WrappedCache<PC, U> {\\n\\n pub fn new(inner: PC, uncompress: U, cache: ReadCache) -> Self {\\n\\n Self {\\n\\n inner,\\n\\n cache: cache.lru(),\\n\\n uncompress,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PageCache for Box<dyn PageCache> {\\n\\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\\n\\n self.as_mut().get_chunk(offset, length)\\n\",\n \"file_path\": \"src/sstable/page_cache.rs\",\n \"rank\": 73,\n \"score\": 16.092943945948868\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Index for OwnedIndex {\\n\\n fn find_bounds(&self, key: &[u8], end_default: u64) -> Option<(u64, u64)> {\\n\\n find_bounds(&self.index, key, end_default)\\n\\n }\\n\\n}\\n\\n\\n\\n/// The default single-threaded reader for sstables.\\n\\n///\\n\\n/// As the get() method takes a mutable reference, you will not be able to use this in\\n\\n/// multiple threads.\\n\\npub struct SSTableReader {\\n\\n inner: InnerReader,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 74,\n \"score\": 16.018747183955707\n },\n {\n \"content\": \" }\\n\\n pub fn get(&self, key: &[u8]) -> Result<Option<Bytes>> {\\n\\n self.inner.get(key)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A multi-threaded reader that only works with fully uncompressed data.\\n\\n///\\n\\n/// There is no locking happening inside, there is no internal mutability either.\\n\\n/// Everything just relies on the OS page cache to work, so if you are ok with storing\\n\\n/// uncompressed sstables, this reader the way to go.\\n\\n///\\n\\n/// If you try to use it with a compressed sstable it will return `Error::CantUseCompressedFileWithMultiThreadedMmap`\\n\\n///\\n\\n/// If you want to use this with multiple threads just put it into an Arc without Mutex'es.\\n\\npub struct MmapUncompressedSSTableReader {\\n\\n index_start: u64,\\n\\n mmap: memmap::Mmap,\\n\\n index: MemIndex,\\n\\n use_bloom_default: bool,\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 75,\n \"score\": 15.900397033309257\n },\n {\n \"content\": \" )?;\\n\\n let key_end = kvoffset_encoded_size + kvoffset.key_length as usize;\\n\\n let key = index_data\\n\\n .get(kvoffset_encoded_size..key_end)\\n\\n .ok_or(INVALID_DATA)?;\\n\\n let key: &'static [u8] = unsafe { &*(key as *const _) };\\n\\n index.insert(key, kvoffset.offset);\\n\\n if index_data.len() == key_end {\\n\\n break;\\n\\n }\\n\\n index_data = &index_data[key_end..];\\n\\n }\\n\\n\\n\\n Ok(Self { index })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Index for MemIndex {\\n\\n fn find_bounds(&self, key: &[u8], end_default: u64) -> Option<(u64, u64)> {\\n\\n find_bounds(&self.index, key, end_default)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 76,\n \"score\": 15.640957214003643\n },\n {\n \"content\": \" let (index, bloom): (Box<dyn Index>, Bloom<[u8]>) = match meta.compression {\\n\\n Compression::None => match mmap_buf {\\n\\n Some(mmap) => {\\n\\n let index = Box::new(MemIndex::from_static_buf(\\n\\n // if it was mmaped, it won't truncate\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n &mmap\\n\\n .get(index_start as usize..index_end as usize)\\n\\n .ok_or(INVALID_DATA)?,\\n\\n meta.index_len,\\n\\n )?);\\n\\n file.seek(SeekFrom::Start(index_end))?;\\n\\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\\n\\n (index, bloom)\\n\\n }\\n\\n None => {\\n\\n let index =\\n\\n Box::new(OwnedIndex::from_reader((&mut file).take(meta.index_len))?);\\n\\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\\n\\n (index, bloom)\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 77,\n \"score\": 15.306541972616742\n },\n {\n \"content\": \" let (index, bloom): (Box<dyn Index + Send + Sync>, Bloom<[u8]>) = match meta.compression {\\n\\n Compression::None => match mmap_buf {\\n\\n Some(mmap) => {\\n\\n let index = Box::new(MemIndex::from_static_buf(\\n\\n // if it was mmaped, it won't truncate\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n &mmap\\n\\n .get(index_start as usize..index_end as usize)\\n\\n .ok_or(INVALID_DATA)?,\\n\\n meta.index_len,\\n\\n )?);\\n\\n\\n\\n file.seek(SeekFrom::Start(index_end))?;\\n\\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\\n\\n (index, bloom)\\n\\n }\\n\\n None => {\\n\\n let index =\\n\\n Box::new(OwnedIndex::from_reader((&mut file).take(meta.index_len))?);\\n\\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 78,\n \"score\": 15.247720799513399\n },\n {\n \"content\": \" };\\n\\n\\n\\n // if it was mmaped, it won't truncate\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n let index = MemIndex::from_static_buf(\\n\\n &mmap_buf\\n\\n .get(index_start as usize..index_end as usize)\\n\\n .ok_or(INVALID_DATA)?,\\n\\n meta.index_len,\\n\\n )?;\\n\\n\\n\\n file.seek(SeekFrom::Start(index_end))?;\\n\\n let bloom = read_bloom((&mut file).take(meta.bloom_len), &meta.bloom)?;\\n\\n\\n\\n Ok(Self {\\n\\n mmap,\\n\\n index,\\n\\n index_start,\\n\\n bloom,\\n\\n use_bloom_default: opts.use_bloom,\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 79,\n \"score\": 14.990643180320419\n },\n {\n \"content\": \"/// ];\\n\\n/// for expected_value in expected.into_iter() {\\n\\n/// assert_eq!(iter.next(), Some(*expected_value as &[u8]));\\n\\n/// }\\n\\n///\\n\\n/// assert_eq!(iter.next(), None);\\n\\n/// assert_eq!(iter.next(), None);\\n\\n/// ```\\n\\npub struct SortedBytesIterator {\\n\\n buf: Vec<u8>,\\n\\n // points to the element being made larger.\\n\\n current: usize,\\n\\n first: u8,\\n\\n last: u8,\\n\\n counter: usize,\\n\\n limit: usize,\\n\\n}\\n\\n\\n\\nimpl Clone for SortedBytesIterator {\\n\\n fn clone(&self) -> Self {\\n\",\n \"file_path\": \"src/utils/sorted_bytes_iterator.rs\",\n \"rank\": 80,\n \"score\": 14.640129925423217\n },\n {\n \"content\": \" // if this was mmaped, there will be no truncation.\\n\\n #[allow(clippy::cast_possible_truncation)]\\n\\n self.buf\\n\\n .get(offset as usize..(offset + length) as usize)\\n\\n .ok_or(error::INVALID_DATA)\\n\\n }\\n\\n}\\n\\n\\n\\n/// This is used to read from a file (or any seek'able reader).\\n\\npub struct ReadPageCache<R> {\\n\\n reader: R,\\n\\n cache: LruCache<u64, Vec<u8>>,\\n\\n}\\n\\n\\n\\nimpl<R> ReadPageCache<R> {\\n\\n pub fn new(reader: R, cache: ReadCache) -> Self {\\n\\n Self {\\n\\n reader,\\n\\n cache: cache.lru(),\\n\\n }\\n\",\n \"file_path\": \"src/sstable/page_cache.rs\",\n \"rank\": 81,\n \"score\": 14.262206457751208\n },\n {\n \"content\": \" /// Reset the state of the iterator to initial.\\n\\n pub fn reset(&mut self) {\\n\\n for v in self.buf.iter_mut() {\\n\\n *v = self.first;\\n\\n }\\n\\n self.current = self.buf.len();\\n\\n self.counter = 0;\\n\\n }\\n\\n\\n\\n /// Customize the bytes being returned.\\n\\n pub fn new_first_last(length: usize, first: u8, last: u8, limit: usize) -> Result<Self> {\\n\\n if length == 0 {\\n\\n return Err(Error::ProgrammingError(\\\"length should be greater than 0\\\"));\\n\\n }\\n\\n if last <= first {\\n\\n return Err(Error::ProgrammingError(\\\"expected last > first\\\"));\\n\\n }\\n\\n let buf = vec![first; length];\\n\\n Ok(Self {\\n\\n buf,\\n\",\n \"file_path\": \"src/utils/sorted_bytes_iterator.rs\",\n \"rank\": 82,\n \"score\": 14.215214492864822\n },\n {\n \"content\": \"pub struct WrappedCache<PC, U> {\\n\\n inner: PC,\\n\\n caches: ConcurrentLRUCache,\\n\\n uncompress: U,\\n\\n}\\n\\n\\n\\nimpl<PC, U> WrappedCache<PC, U> {\\n\\n pub fn new(inner: PC, uncompress: U, cache: Option<ReadCache>, count: usize) -> Self {\\n\\n Self {\\n\\n inner,\\n\\n caches: ConcurrentLRUCache::new(count, cache),\\n\\n uncompress,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ConcurrentPageCache for Box<dyn ConcurrentPageCache + Send + Sync> {\\n\\n fn get_chunk(&self, offset: u64, length: u64) -> Result<Bytes> {\\n\\n self.as_ref().get_chunk(offset, length)\\n\\n }\\n\",\n \"file_path\": \"src/sstable/concurrent_page_cache.rs\",\n \"rank\": 83,\n \"score\": 14.010830500308675\n },\n {\n \"content\": \"use std::io::{Read, Result};\\n\\n\\n\\n/// PosReader is a reader that remembers the position read and can\\n\\n/// report it back at any time.\\n\\n#[derive(Debug)]\\n\\npub struct PosReader<R> {\\n\\n r: R,\\n\\n offset: usize,\\n\\n}\\n\\n\\n\\nimpl<R> PosReader<R> {\\n\\n pub fn new(r: R, offset: usize) -> Self {\\n\\n PosReader { r, offset }\\n\\n }\\n\\n pub fn current_offset(&self) -> usize {\\n\\n self.offset\\n\\n }\\n\\n pub fn into_inner(self) -> R {\\n\\n self.r\\n\\n }\\n\",\n \"file_path\": \"src/sstable/posreader.rs\",\n \"rank\": 84,\n \"score\": 13.973469217330237\n },\n {\n \"content\": \"\\n\\n #[allow(clippy::infallible_destructuring_match)]\\n\\n let meta = match meta.meta {\\n\\n MetaData::V3_0(meta) => meta,\\n\\n };\\n\\n\\n\\n if meta.compression != Compression::None {\\n\\n return Err(Error::CantUseCompressedFileWithMultiThreadedMmap);\\n\\n }\\n\\n\\n\\n let index_start = data_start + (meta.data_len as u64);\\n\\n let index_end = index_start + meta.index_len;\\n\\n\\n\\n file.seek(SeekFrom::Start(index_start))?;\\n\\n let mmap = unsafe { memmap::Mmap::map(&file) }?;\\n\\n let mmap_buf = {\\n\\n let buf = &mmap as &[u8];\\n\\n let buf = buf as *const [u8];\\n\\n let buf: &'static [u8] = unsafe { &*buf };\\n\\n buf\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 85,\n \"score\": 13.781856593175547\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<R: Read> Read for PosReader<R> {\\n\\n fn read(&mut self, buf: &mut [u8]) -> Result<usize> {\\n\\n let l = self.r.read(buf)?;\\n\\n self.offset += l;\\n\\n Ok(l)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sstable/posreader.rs\",\n \"rank\": 86,\n \"score\": 13.689256277634836\n },\n {\n \"content\": \"use super::Version;\\n\\n\\n\\npub const INVALID_DATA: Error = Error::InvalidData(\\\"corrupt SStable or bug\\\");\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Error {\\n\\n Io(std::io::Error),\\n\\n CantUseCompressedFileWithMultiThreadedMmap,\\n\\n ProgrammingError(&'static str),\\n\\n InvalidData(&'static str),\\n\\n UnsupportedVersion(Version),\\n\\n Bincode(bincode::Error),\\n\\n Utf8Error(std::str::Utf8Error),\\n\\n KeyTooLong(usize),\\n\\n ValueTooLong(usize),\\n\\n StdStringFromUtf8Error(std::string::FromUtf8Error),\\n\\n TryFromInt(std::num::TryFromIntError),\\n\\n NixError(nix::Error),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sstable/error.rs\",\n \"rank\": 87,\n \"score\": 13.634737157348521\n },\n {\n \"content\": \" Error::from(io)\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> SnappyCompressorFactory<W> {\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\\n marker: std::marker::PhantomData {},\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W: Write> CompressorFactory<W, SnappyCompressor<W>> for SnappyCompressorFactory<W> {\\n\\n fn from_writer(&self, writer: W) -> SnappyCompressor<W> {\\n\\n SnappyCompressor::new(writer)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Uncompress for SnappyUncompress {\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 88,\n \"score\": 13.619349732298687\n },\n {\n \"content\": \"//! Ondisk format structs, serialized with \\\"bincode\\\".\\n\\n//!\\n\\n//! Ondisk format has the following preamble.\\n\\n//!\\n\\n//! | MAGIC: [u8; 4] | version: struct{u16, u16} |\\n\\n//!\\n\\n//! Then depending on version the rest of the file is structured.\\n\\n//! Full v1 format looks like this:\\n\\n//!\\n\\n//! | MAGIC: [u8; 4] | Version_1_0: [1u16, 0u16] | Meta_V1_0 | DATA | INDEX_DATA |\\n\\n//!\\n\\n//! V1 data has the following layout\\n\\n//!\\n\\n//! | KVLength | key: [u8] | value: [u8] |\\n\\n//!\\n\\n//! V1 index data has the following layout\\n\\n//!\\n\\n//! | KVOffset | key: [u8] | offset: Offset |\\n\\n\\n\\nuse serde::{Deserialize, Serialize};\\n\",\n \"file_path\": \"src/sstable/ondisk_format.rs\",\n \"rank\": 89,\n \"score\": 12.833384736149398\n },\n {\n \"content\": \"//!\\n\\n//! ```\\n\\n//! use sstb::*;\\n\\n//! use std::collections::BTreeMap;\\n\\n//!\\n\\n//! let filename = \\\"/tmp/example-sstable\\\";\\n\\n//! let mut map = BTreeMap::new();\\n\\n//! map.insert(b\\\"foo\\\", b\\\"some foo\\\");\\n\\n//! map.insert(b\\\"bar\\\", b\\\"some bar\\\");\\n\\n//!\\n\\n//! write_btree_map(&map, filename, None).unwrap();\\n\\n//!\\n\\n//! let mut reader =\\n\\n//! SSTableReader::new_with_options(filename, &ReadOptions::default())\\n\\n//! .unwrap();\\n\\n\\n\\n//! assert_eq!(reader.get(b\\\"foo\\\").unwrap(), Some(b\\\"some foo\\\" as &[u8]));\\n\\n//! assert_eq!(reader.get(b\\\"bar\\\").unwrap(), Some(b\\\"some bar\\\" as &[u8]));\\n\\n//! assert_eq!(reader.get(b\\\"foobar\\\").unwrap(), None);\\n\\n//! ```\\n\\n\\n\\npub mod sstable;\\n\\npub mod utils;\\n\\n\\n\\npub use sstable::*;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 90,\n \"score\": 12.756074265414359\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<PC, U> PageCache for WrappedCache<PC, U>\\n\\nwhere\\n\\n U: Uncompress,\\n\\n PC: PageCache,\\n\\n{\\n\\n fn get_chunk(&mut self, offset: u64, length: u64) -> Result<&[u8]> {\\n\\n match self.cache.get(&offset) {\\n\\n Some(bytes) => Ok(unsafe { &*(bytes as &[u8] as *const [u8]) }),\\n\\n None => {\\n\\n let inner_chunk = self.inner.get_chunk(offset, length)?;\\n\\n let buf = self.uncompress.uncompress(inner_chunk)?;\\n\\n self.cache.put(offset, buf);\\n\\n Ok(self.cache.get(&offset).unwrap())\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/sstable/page_cache.rs\",\n \"rank\": 91,\n \"score\": 12.426204465262298\n },\n {\n \"content\": \" );\\n\\n },\\n\\n );\\n\\n\\n\\n for (prefix, write_opts, read_opts) in variants.iter() {\\n\\n state.write_sstable(filename, &write_opts).unwrap();\\n\\n\\n\\n group.bench_function(BenchmarkId::new(*prefix, threads), |b| {\\n\\n b.iter_batched(\\n\\n || ConcurrentSSTableReader::new_with_options(filename, &read_opts).unwrap(),\\n\\n |reader| {\\n\\n pool.install(|| {\\n\\n state.get_shuffled_input_ref().par_iter().for_each(|kv| {\\n\\n let KV { key, is_present } = &kv;\\n\\n let key = key as &[u8];\\n\\n let value = reader.get(key).unwrap();\\n\\n if *is_present {\\n\\n assert_eq!(value.as_deref(), Some(key));\\n\\n } else {\\n\\n assert_eq!(value, None);\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 92,\n \"score\": 12.100472128454792\n },\n {\n \"content\": \" group.bench_function(BenchmarkId::new(*prefix, *size), |b| {\\n\\n b.iter_batched(\\n\\n || SSTableReader::new_with_options(filename, &read_opts).unwrap(),\\n\\n |mut reader| {\\n\\n for kv in state.get_shuffled_input() {\\n\\n let KV { key, is_present } = &kv;\\n\\n let key = key as &[u8];\\n\\n let value = reader.get(key).unwrap();\\n\\n if *is_present {\\n\\n assert_eq!(value, Some(key));\\n\\n } else {\\n\\n assert_eq!(value, None);\\n\\n }\\n\\n }\\n\\n },\\n\\n BatchSize::LargeInput,\\n\\n );\\n\\n });\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 93,\n \"score\": 11.991764878083828\n },\n {\n \"content\": \"mod compress_ctx_writer;\\n\\nmod compression;\\n\\nmod concurrent_lru;\\n\\nmod concurrent_page_cache;\\n\\nmod error;\\n\\nmod ondisk_format;\\n\\nmod options;\\n\\nmod page_cache;\\n\\nmod posreader;\\n\\nmod poswriter;\\n\\nmod result;\\n\\nmod types;\\n\\nmod utils;\\n\\n\\n\\npub mod reader;\\n\\npub mod writer;\\n\\n\\n\\npub use reader::ConcurrentSSTableReader;\\n\\npub use reader::MmapUncompressedSSTableReader;\\n\\npub use reader::SSTableReader;\\n\",\n \"file_path\": \"src/sstable/mod.rs\",\n \"rank\": 94,\n \"score\": 11.96769643622501\n },\n {\n \"content\": \"use std::path::Path;\\n\\n\\n\\nuse bincode;\\n\\nuse memmap;\\n\\nuse num_cpus;\\n\\n\\n\\nuse bloomfilter::Bloom;\\n\\nuse bytes::Bytes;\\n\\n\\n\\nuse super::error::INVALID_DATA;\\n\\nuse super::ondisk_format::*;\\n\\nuse super::options::*;\\n\\nuse super::types::*;\\n\\nuse super::{compression, concurrent_page_cache, page_cache, posreader, Error, Result};\\n\\n\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 95,\n \"score\": 11.88445495001495\n },\n {\n \"content\": \" |reader| {\\n\\n for kv in state.get_shuffled_input() {\\n\\n let KV { key, is_present } = &kv;\\n\\n let key = key as &[u8];\\n\\n let value = reader.get(key).unwrap();\\n\\n if *is_present {\\n\\n assert_eq!(value, Some(key));\\n\\n } else {\\n\\n assert_eq!(value, None);\\n\\n }\\n\\n }\\n\\n },\\n\\n BatchSize::LargeInput,\\n\\n );\\n\\n },\\n\\n );\\n\\n\\n\\n for (prefix, write_opts, read_opts) in variants.iter() {\\n\\n state.write_sstable(filename, &write_opts).unwrap();\\n\\n\\n\",\n \"file_path\": \"benches/sstable_implementations.rs\",\n \"rank\": 96,\n \"score\": 11.876882402126888\n },\n {\n \"content\": \"# TODO ([x] means done)\\n\\n- [ ] Prettify and publish benchmark results in the readme. For now one can \\\"cargo bench\\\" and look at the reports.\\n\\n- [x] cache=none does not work. It uses unbounded cache as default which is incorrect.\\n\\n- [-] open-source\\n\\n - [x] write README with badges\\n\\n - [ ] Travis tests etc\\n\\n- [ ] backtraces in errors\\n\\n- [ ] range queries\\n\\n- [x] bloom filters on disk\\n\\n - they slowed things down by 25% though! but it works\\n\\n- [ ] writing \\\"flush_every\\\"'s default should depend on the default compression.\\n\\n- [ ] read cache size configurable both for page cache and for uncompressed cache\\n\\n- [ ] read cache size should be in bytes, not blocks\\n\\n- [ ] cache cannot be explicitly disabled in some places\\n\\n- [ ] add length to encoded bits\\n\\n- [ ] indexes as separate files\\n\\n in this case don't need to maintain the index in memory while writing\\n\\n- [ ] remove as much as possible unsafe and unwrap\\n\\n - [ ] Mmap can be put into an Arc, to remove unsafe static buffer casts. This should not matter at runtime.\\n\\n- [ ] the index can store the number of items and uncompressed length (in case the file is compressed)\\n\\n - the uncompressed length can be used when allocating memory for uncompressed chunks\\n\\n - the number of items in the chunk can be used for HashMap capacity IF we get back the \\\"Block\\\" structure which helps not scan the whole table every time.\\n\\n - there's a space tradeoff here, so maybe it's all not worth it\\n\\n- [ ] consider getting back the \\\"Block\\\" trait and its implementations\\n\\n - this will help not scan through the chunk on each get()\\n\\n - however, there are costs\\n\\n - need to allocate HashMaps for lookups\\n\\n - if length is not known, might even reallocate\\n\\n - messes up the concurrency as the hashmap becomes the contention point\\n\\n - an RWLock might help for the majority of the cases\\n\\n - even if all this is implemented, it's totally not guaranteed that it's going to be faster in the end.\\n\\n- [x] u16 keys and u32 values, not u64, for saving space\\n\\n- [x] mmap with no compression is already multi-threaded, but the API does not\\n\\n reflect that\\n\\n- [x] zlib bounded and unbounded performs the same in benchmarks\\n\\n- [x] analyze all casts from u64 to usize\\n\\n - [x] clippy actually has a lint for it in pedantic\\n\\n- [x] multi-threading\\n\\n- [x] compression is all over the place\\n\\n- [x] files and imports are all over the place, reorganize\\n\\n- [x] fail if keys or values are too long (> u32_max)\\n\\n- [x] byte keys\\n\\n - [x] also \\\"memchr\\\" is very slow, better to use offsets\\n\",\n \"file_path\": \"TODO.md\",\n \"rank\": 97,\n \"score\": 11.767948544841154\n },\n {\n \"content\": \"//! Traits and implementations of various compressors and decompressors.\\n\\n\\n\\nuse super::Result;\\n\\n\\n\\nuse super::Error;\\n\\nuse snap;\\n\\nuse std::io::{Cursor, Read, Write};\\n\\n\\n\",\n \"file_path\": \"src/sstable/compression.rs\",\n \"rank\": 98,\n \"score\": 11.568370828017864\n },\n {\n \"content\": \" Compression::Snappy => {\\n\\n let dec = compression::SnappyUncompress {};\\n\\n let cache = opts.cache.clone().unwrap_or_default();\\n\\n let wrapped = page_cache::WrappedCache::new(pc, dec, cache);\\n\\n Box::new(wrapped)\\n\\n }\\n\\n };\\n\\n\\n\\n Ok(Self {\\n\\n _mmap: mmap,\\n\\n index,\\n\\n page_cache: uncompressed_cache,\\n\\n data_start,\\n\\n meta,\\n\\n bloom,\\n\\n use_bloom_default: opts.use_bloom,\\n\\n })\\n\\n }\\n\\n\\n\\n fn get_with_options(\\n\",\n \"file_path\": \"src/sstable/reader.rs\",\n \"rank\": 99,\n \"score\": 11.553275137549367\n }\n]","isConversational":false}}},{"rowIdx":1985,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"fifteen_min/src/isochrone.rs"},"repo_name":{"kind":"string","value":"balbok0/abstreet"},"commit":{"kind":"string","value":"3af15fefdb2772c83864c08724318418da8190a9"},"file_code":{"kind":"string","value":"use std::collections::{HashMap, HashSet};\n\nuse abstutil::MultiMap;\nuse geom::{Duration, Polygon};\nuse map_gui::tools::Grid;\nuse map_model::{\n connectivity, AmenityType, BuildingID, BuildingType, LaneType, Map, Path, PathConstraints,\n PathRequest,\n};\nuse widgetry::{Color, Drawable, EventCtx, GeomBatch};\n\nuse crate::App;\n\npub struct Isochrone {\n \n pub start: BuildingID,\n \n pub options: Options,\n \n pub draw: Drawable,\n \n pub time_to_reach_building: HashMap<BuildingID, Duration>,\n \n pub amenities_reachable: MultiMap<AmenityType, BuildingID>,\n \n \n pub population: usize,\n \n pub onstreet_parking_spots: usize,\n}\n\n#[derive(Clone)]\npub enum Options {\n Walking(connectivity::WalkingOptions),\n Biking,\n}\n\nimpl Options {\n pub fn time_to_reach_building(\n self,\n map: &Map,\n start: BuildingID,\n ) -> HashMap<BuildingID, Duration> {\n match self {\n Options::Walking(opts) => {\n connectivity::all_walking_costs_from(map, start, Duration::minutes(15), opts)\n }\n Options::Biking => connectivity::all_vehicle_costs_from(\n map,\n start,\n Duration::minutes(15),\n PathConstraints::Bike,\n ),\n }\n }\n}\n\nimpl Isochrone {\n pub fn new(ctx: &mut EventCtx, app: &App, start: BuildingID, options: Options) -> Isochrone {\n let time_to_reach_building = options.clone().time_to_reach_building(&app.map, start);\n\n let mut amenities_reachable = MultiMap::new();\n let mut population = 0;\n let mut all_roads = HashSet::new();\n for b in time_to_reach_building.keys() {\n let bldg = app.map.get_b(*b);\n for amenity in &bldg.amenities {\n if let Some(category) = AmenityType::categorize(&amenity.amenity_type) {\n amenities_reachable.insert(category, bldg.id);\n }\n }\n match bldg.bldg_type {\n BuildingType::Residential { num_residents, .. }\n | BuildingType::ResidentialCommercial(num_residents, _) => {\n population += num_residents;\n }\n _ => {}\n }\n all_roads.insert(app.map.get_l(bldg.sidewalk_pos.lane()).parent);\n }\n\n let mut onstreet_parking_spots = 0;\n for r in all_roads {\n let r = app.map.get_r(r);\n for (l, _, lt) in r.lanes_ltr() {\n if lt == LaneType::Parking {\n onstreet_parking_spots +=\n app.map.get_l(l).number_parking_spots(app.map.get_config());\n }\n }\n }\n\n let mut i = Isochrone {\n start,\n options,\n draw: Drawable::empty(ctx),\n time_to_reach_building,\n amenities_reachable,\n population,\n onstreet_parking_spots,\n };\n i.draw = i.draw_isochrone(app).upload(ctx);\n i\n }\n\n pub fn path_to(&self, map: &Map, to: BuildingID) -> Option<Path> {\n \n if !self.time_to_reach_building.contains_key(&to) {\n return None;\n }\n\n let req = PathRequest::between_buildings(\n map,\n self.start,\n to,\n match self.options {\n Options::Walking(_) => PathConstraints::Pedestrian,\n Options::Biking => PathConstraints::Bike,\n },\n )?;\n map.pathfind(req).ok()\n }\n\n pub fn draw_isochrone(&self, app: &App) -> GeomBatch {\n \n \n let bounds = app.map.get_bounds();\n let resolution_m = 100.0;\n \n \n let mut grid: Grid<f64> = Grid::new(\n (bounds.width() / resolution_m).ceil() as usize,\n (bounds.height() / resolution_m).ceil() as usize,\n 0.0,\n );\n\n \n for (b, cost) in &self.time_to_reach_building {\n \n let pt = app.map.get_b(*b).polygon.center();\n let idx = grid.idx(\n ((pt.x() - bounds.min_x) / resolution_m) as usize,\n ((pt.y() - bounds.min_y) / resolution_m) as usize,\n );\n \n grid.data[idx] = cost.inner_seconds();\n }\n\n \n \n let thresholds = vec![\n 0.1,\n Duration::minutes(5).inner_seconds(),\n Duration::minutes(10).inner_seconds(),\n Duration::minutes(15).inner_seconds(),\n ];\n \n let colors = vec![\n Color::GREEN.alpha(0.5),\n Color::ORANGE.alpha(0.5),\n Color::RED.alpha(0.5),\n ];\n let smooth = false;\n let c = contour::ContourBuilder::new(grid.width as u32, grid.height as u32, smooth);\n let mut batch = GeomBatch::new();\n \n \n \n \n \n \n for (feature, color) in c\n .contours(&grid.data, &thresholds)\n .unwrap()\n .into_iter()\n .zip(colors)\n {\n match feature.geometry.unwrap().value {\n geojson::Value::MultiPolygon(polygons) => {\n for p in polygons {\n if let Ok(poly) = Polygon::from_geojson(&p) {\n batch.push(color, poly.scale(resolution_m));\n }\n }\n }\n _ => unreachable!(),\n }\n }\n\n batch\n }\n}\n"},"prefix":{"kind":"string","value":"use std::collections::{HashMap, HashSet};\n\nuse abstutil::MultiMap;\nuse geom::{Duration, Polygon};\nuse map_gui::tools::Grid;\nuse map_model::{\n connectivity, AmenityType, BuildingID, BuildingType, LaneType, Map, Path, PathConstraints,\n PathRequest,\n};\nuse widgetry::{Color, Drawable, EventCtx, GeomBatch};\n\nuse crate::App;\n\npub struct Isochrone {\n \n pub start: BuildingID,\n \n pub options: Options,\n \n pub draw: Drawable,\n \n pub time_to_reach_building: HashMap<BuildingID, Duration>,\n \n pub amenities_reachable: MultiMap<AmenityType, BuildingID>,\n \n \n pub population: usize,\n \n pub onstreet_parking_spots: usize,\n}\n\n#[derive(Clone)]\npub enum Options {\n Walking(connectivity::WalkingOptions),\n Biking,\n}\n\nimpl Options {\n pub fn time_to_reach_building(\n self,\n map: &Map,\n start: BuildingID,\n ) -> HashMap<BuildingID, Duration> {\n match self {\n Options::Walking(opts) => {\n connectivity::all_walking_costs_from(map, start, Duration::minutes(15), opts)\n }\n Options::Biking => connectivity::all_vehicle_costs_from(\n map,\n start,\n Duration::minutes(15),\n PathConstraints::Bike,\n ),\n }\n }\n}\n\nimpl Isochrone {\n "},"suffix":{"kind":"string","value":"\n\n pub fn path_to(&self, map: &Map, to: BuildingID) -> Option<Path> {\n \n if !self.time_to_reach_building.contains_key(&to) {\n return None;\n }\n\n let req = PathRequest::between_buildings(\n map,\n self.start,\n to,\n match self.options {\n Options::Walking(_) => PathConstraints::Pedestrian,\n Options::Biking => PathConstraints::Bike,\n },\n )?;\n map.pathfind(req).ok()\n }\n\n pub fn draw_isochrone(&self, app: &App) -> GeomBatch {\n \n \n let bounds = app.map.get_bounds();\n let resolution_m = 100.0;\n \n \n let mut grid: Grid<f64> = Grid::new(\n (bounds.width() / resolution_m).ceil() as usize,\n (bounds.height() / resolution_m).ceil() as usize,\n 0.0,\n );\n\n \n for (b, cost) in &self.time_to_reach_building {\n \n let pt = app.map.get_b(*b).polygon.center();\n let idx = grid.idx(\n ((pt.x() - bounds.min_x) / resolution_m) as usize,\n ((pt.y() - bounds.min_y) / resolution_m) as usize,\n );\n \n grid.data[idx] = cost.inner_seconds();\n }\n\n \n \n let thresholds = vec![\n 0.1,\n Duration::minutes(5).inner_seconds(),\n Duration::minutes(10).inner_seconds(),\n Duration::minutes(15).inner_seconds(),\n ];\n \n let colors = vec![\n Color::GREEN.alpha(0.5),\n Color::ORANGE.alpha(0.5),\n Color::RED.alpha(0.5),\n ];\n let smooth = false;\n let c = contour::ContourBuilder::new(grid.width as u32, grid.height as u32, smooth);\n let mut batch = GeomBatch::new();\n \n \n \n \n \n \n for (feature, color) in c\n .contours(&grid.data, &thresholds)\n .unwrap()\n .into_iter()\n .zip(colors)\n {\n match feature.geometry.unwrap().value {\n geojson::Value::MultiPolygon(polygons) => {\n for p in polygons {\n if let Ok(poly) = Polygon::from_geojson(&p) {\n batch.push(color, poly.scale(resolution_m));\n }\n }\n }\n _ => unreachable!(),\n }\n }\n\n batch\n }\n}\n"},"middle":{"kind":"string","value":"pub fn new(ctx: &mut EventCtx, app: &App, start: BuildingID, options: Options) -> Isochrone {\n let time_to_reach_building = options.clone().time_to_reach_building(&app.map, start);\n\n let mut amenities_reachable = MultiMap::new();\n let mut population = 0;\n let mut all_roads = HashSet::new();\n for b in time_to_reach_building.keys() {\n let bldg = app.map.get_b(*b);\n for amenity in &bldg.amenities {\n if let Some(category) = AmenityType::categorize(&amenity.amenity_type) {\n amenities_reachable.insert(category, bldg.id);\n }\n }\n match bldg.bldg_type {\n BuildingType::Residential { num_residents, .. }\n | BuildingType::ResidentialCommercial(num_residents, _) => {\n population += num_residents;\n }\n _ => {}\n }\n all_roads.insert(app.map.get_l(bldg.sidewalk_pos.lane()).parent);\n }\n\n let mut onstreet_parking_spots = 0;\n for r in all_roads {\n let r = app.map.get_r(r);\n for (l, _, lt) in r.lanes_ltr() {\n if lt == LaneType::Parking {\n onstreet_parking_spots +=\n app.map.get_l(l).number_parking_spots(app.map.get_config());\n }\n }\n }\n\n let mut i = Isochrone {\n start,\n options,\n draw: Drawable::empty(ctx),\n time_to_reach_building,\n amenities_reachable,\n population,\n onstreet_parking_spots,\n };\n i.draw = i.draw_isochrone(app).upload(ctx);\n i\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn pathfind(req: PathRequest, params: &RoutingParams, map: &Map) -> Option<(Path, Duration)> {\n\n if req.constraints == PathConstraints::Pedestrian {\n\n pathfind_walking(req, map)\n\n } else {\n\n let graph = build_graph_for_vehicles(map, req.constraints);\n\n calc_path(graph, req, params, map)\n\n }\n\n}\n\n\n","file_path":"map_model/src/pathfind/dijkstra.rs","rank":0,"score":400765.943363308},{"content":"fn pathfind_walking(req: PathRequest, map: &Map) -> Option<(Path, Duration)> {\n\n if req.start.lane() == req.end.lane() {\n\n return Some(one_step_walking_path(req, map));\n\n }\n\n\n\n let graph = build_graph_for_pedestrians(map);\n\n\n\n let closest_start = WalkingNode::closest(req.start, map);\n\n let closest_end = WalkingNode::closest(req.end, map);\n\n let (cost, nodes) = petgraph::algo::astar(\n\n &graph,\n\n closest_start,\n\n |end| end == closest_end,\n\n |(_, _, cost)| *cost,\n\n |_| Duration::ZERO,\n\n )?;\n\n let steps = walking_path_to_steps(nodes, map);\n\n Some((Path::new(map, steps, req, Vec::new()), cost))\n\n}\n","file_path":"map_model/src/pathfind/dijkstra.rs","rank":1,"score":372943.4484057581},{"content":"// TODO Do we even need this at all?\n\npub fn one_step_walking_path(req: PathRequest, map: &Map) -> (Path, Duration) {\n\n // Weird case, but it can happen for walking from a building path to a bus stop that're\n\n // actually at the same spot.\n\n let steps = if req.start.dist_along() == req.end.dist_along() {\n\n vec![PathStep::Lane(req.start.lane())]\n\n } else if req.start.dist_along() < req.end.dist_along() {\n\n vec![PathStep::Lane(req.start.lane())]\n\n } else {\n\n vec![PathStep::ContraflowLane(req.start.lane())]\n\n };\n\n let mut cost = (req.start.dist_along() - req.end.dist_along()).abs()\n\n / Traversable::Lane(req.start.lane()).max_speed_along(\n\n Some(crate::MAX_WALKING_SPEED),\n\n PathConstraints::Pedestrian,\n\n map,\n\n );\n\n if map.get_l(req.start.lane()).is_shoulder() {\n\n cost = 2.0 * cost;\n\n }\n\n (Path::new(map, steps, req, Vec::new()), cost)\n\n}\n","file_path":"map_model/src/pathfind/walking.rs","rank":2,"score":371019.7673763352},{"content":"/// Fill in empty space between one-way roads.\n\npub fn find_medians(map: &Map) -> Vec<Polygon> {\n\n // TODO Needs more work\n\n if true {\n\n return Vec::new();\n\n }\n\n\n\n let mut candidates = Vec::new();\n\n for r in map.all_roads() {\n\n if r.osm_tags.is(\"dual_carriageway\", \"yes\") {\n\n // TODO Always to the left? Maybe driving side matters; test in southbank too\n\n let lanes_ltr = r.lanes_ltr();\n\n candidates.push(lanes_ltr[0].0);\n\n }\n\n }\n\n\n\n let mut visited = BTreeSet::new();\n\n let mut polygons = Vec::new();\n\n for start in candidates {\n\n if visited.contains(&start) {\n\n continue;\n\n }\n\n if let Some((poly, lanes)) = map.get_l(start).trace_around_block(map) {\n\n polygons.push(poly);\n\n visited.extend(lanes);\n\n }\n\n }\n\n\n\n polygons\n\n}\n","file_path":"map_model/src/make/medians.rs","rank":3,"score":314307.5938521245},{"content":"/// Calculate the strongly connected components (SCC) of the part of the map accessible by\n\n/// constraints (ie, the graph of sidewalks or driving+bike lanes). The largest component is the\n\n/// \"main\" graph; the rest is disconnected. Returns (lanes in the largest \"main\" component, all\n\n/// other disconnected lanes)\n\npub fn find_scc(map: &Map, constraints: PathConstraints) -> (HashSet<LaneID>, HashSet<LaneID>) {\n\n let mut graph = DiGraphMap::new();\n\n for turn in map.all_turns().values() {\n\n if constraints.can_use(map.get_l(turn.id.src), map)\n\n && constraints.can_use(map.get_l(turn.id.dst), map)\n\n {\n\n graph.add_edge(turn.id.src, turn.id.dst, 1);\n\n }\n\n }\n\n let components = petgraph::algo::kosaraju_scc(&graph);\n\n if components.is_empty() {\n\n return (HashSet::new(), HashSet::new());\n\n }\n\n let largest_group: HashSet<LaneID> = components\n\n .into_iter()\n\n .max_by_key(|c| c.len())\n\n .unwrap()\n\n .into_iter()\n\n .collect();\n\n let disconnected = map\n","file_path":"map_model/src/connectivity/mod.rs","rank":4,"score":306670.85593047534},{"content":"// TODO Temporarily public for debugging.\n\npub fn calculate_corners(i: &Intersection, map: &Map) -> Vec<Polygon> {\n\n if i.is_footway(map) {\n\n return Vec::new();\n\n }\n\n\n\n let mut corners = Vec::new();\n\n\n\n for turn in map.get_turns_in_intersection(i.id) {\n\n if turn.turn_type == TurnType::SharedSidewalkCorner {\n\n // Avoid double-rendering\n\n if map.get_l(turn.id.src).dst_i != i.id {\n\n continue;\n\n }\n\n let l1 = map.get_l(turn.id.src);\n\n let l2 = map.get_l(turn.id.dst);\n\n\n\n // Special case for dead-ends: just thicken the geometry.\n\n if i.roads.len() == 1 {\n\n corners.push(turn.geom.make_polygons(l1.width.min(l2.width)));\n\n continue;\n","file_path":"map_gui/src/render/intersection.rs","rank":5,"score":298167.0278163951},{"content":"pub fn walking_path_to_steps(path: Vec<WalkingNode>, map: &Map) -> Vec<PathStep> {\n\n let mut steps: Vec<PathStep> = Vec::new();\n\n\n\n for pair in path.windows(2) {\n\n let (r1, l1_endpt) = match pair[0] {\n\n WalkingNode::SidewalkEndpoint(r, endpt) => (r, endpt),\n\n WalkingNode::RideBus(_) => unreachable!(),\n\n WalkingNode::LeaveMap(_) => unreachable!(),\n\n };\n\n let r2 = match pair[1] {\n\n WalkingNode::SidewalkEndpoint(r, _) => r,\n\n WalkingNode::RideBus(_) => unreachable!(),\n\n WalkingNode::LeaveMap(_) => unreachable!(),\n\n };\n\n\n\n let l1 = r1.must_get_sidewalk(map);\n\n let l2 = r2.must_get_sidewalk(map);\n\n\n\n if l1 == l2 {\n\n if l1_endpt {\n","file_path":"map_model/src/pathfind/walking.rs","rank":6,"score":297974.0853288801},{"content":"/// Heavily penalize crossing into an access-restricted zone that doesn't allow this mode.\n\npub fn zone_cost(mvmnt: MovementID, constraints: PathConstraints, map: &Map) -> Duration {\n\n // Detect when we cross into a new zone that doesn't allow constraints.\n\n if map\n\n .get_r(mvmnt.from.id)\n\n .access_restrictions\n\n .allow_through_traffic\n\n .contains(constraints)\n\n && !map\n\n .get_r(mvmnt.to.id)\n\n .access_restrictions\n\n .allow_through_traffic\n\n .contains(constraints)\n\n {\n\n // This should be high enough to achieve the desired effect of somebody not entering\n\n // the zone unless absolutely necessary. Someone would violate that and cut through anyway\n\n // only when the alternative route would take more than 3 hours longer!\n\n Duration::hours(3)\n\n } else {\n\n Duration::ZERO\n\n }\n","file_path":"map_model/src/pathfind/mod.rs","rank":7,"score":287987.4559570607},{"content":"pub fn round(cost: Duration) -> usize {\n\n // Round up! 0 cost edges are ignored\n\n (cost.inner_seconds().round() as usize).max(1)\n\n}\n","file_path":"map_model/src/pathfind/ch.rs","rank":8,"score":275394.8920086846},{"content":"/// Create a traffic signal which has a stage that is: protected straight, protected right,\n\n/// unprotected left, unprotected right on red. Followed by a variable stage that has protected\n\n/// left, unprotected right on red. With a last stage that is all-walk and variable.\n\n/// In some degenerate cases, usually with one or more one-way, this can reduce to stage per road.\n\n/// In some rare cases, usually with an alleyway, oncoming lanes can't both be protected left turns.\n\n/// In such cases the stage is split into two stages with each having a protected and yeild turn.\n\npub fn make_traffic_signal(map: &Map, id: IntersectionID) -> Option<ControlTrafficSignal> {\n\n // Try to create the stages, this returns a unoptimized signal, which is then optimized.\n\n if let Some(ts) = make_signal(map, id) {\n\n return optimize(ts);\n\n }\n\n None\n\n}\n\n\n","file_path":"map_model/src/make/traffic_signals/lagging_green.rs","rank":9,"score":271667.4035031707},{"content":"pub fn apply_parking(map: &mut RawMap, opts: &Options, timer: &mut Timer) {\n\n match opts.onstreet_parking {\n\n OnstreetParking::JustOSM => {}\n\n OnstreetParking::Blockface(ref path) => {\n\n use_parking_hints(map, path.clone(), timer);\n\n }\n\n OnstreetParking::SomeAdditionalWhereNoData { pct } => {\n\n let pct = pct as i64;\n\n for (id, r) in map.roads.iter_mut() {\n\n // The 20m minimum is a rough heuristic.\n\n if r.osm_tags.contains_key(osm::INFERRED_PARKING)\n\n && r.osm_tags\n\n .is_any(osm::HIGHWAY, vec![\"residential\", \"tertiary\"])\n\n && !r.osm_tags.is(\"foot\", \"no\")\n\n && id.osm_way_id.0 % 100 <= pct\n\n && PolyLine::unchecked_new(r.center_points.clone()).length()\n\n >= Distance::meters(20.0)\n\n {\n\n if r.osm_tags.is(\"oneway\", \"yes\") {\n\n r.osm_tags.remove(osm::PARKING_BOTH);\n","file_path":"convert_osm/src/parking.rs","rank":10,"score":269661.3271609946},{"content":"/// Extract the map and scenario name from a path. Crashes if the input is strange.\n\npub fn parse_scenario_path(path: &str) -> (MapName, String) {\n\n // TODO regex\n\n let parts = path.split(\"/\").collect::<Vec<_>>();\n\n let country = parts[parts.len() - 5];\n\n let city = parts[parts.len() - 4];\n\n let map = parts[parts.len() - 2];\n\n let scenario = basename(parts[parts.len() - 1]);\n\n let map_name = MapName::new(country, city, map);\n\n (map_name, scenario)\n\n}\n\n\n\n// Player data (Players edit this)\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":11,"score":268395.3108036621},{"content":"// Adjust the path to start on the building's border, not center\n\nfn trim_path(poly: &Polygon, path: Line) -> Line {\n\n for bldg_line in poly.points().windows(2) {\n\n if let Some(l1) = Line::new(bldg_line[0], bldg_line[1]) {\n\n if let Some(hit) = l1.intersection(&path) {\n\n if let Some(l2) = Line::new(hit, path.pt2()) {\n\n return l2;\n\n }\n\n }\n\n }\n\n }\n\n // Just give up\n\n path\n\n}\n\n\n","file_path":"map_model/src/make/buildings.rs","rank":12,"score":266515.22076968837},{"content":"pub fn build_graph_for_pedestrians(map: &Map) -> DiGraphMap<WalkingNode, Duration> {\n\n let max_speed = Some(crate::MAX_WALKING_SPEED);\n\n let mut graph: DiGraphMap<WalkingNode, Duration> = DiGraphMap::new();\n\n for l in map.all_lanes() {\n\n if l.is_walkable() {\n\n let cost = l.length()\n\n / Traversable::Lane(l.id).max_speed_along(\n\n max_speed,\n\n PathConstraints::Pedestrian,\n\n map,\n\n );\n\n let n1 = WalkingNode::SidewalkEndpoint(l.get_directed_parent(), true);\n\n let n2 = WalkingNode::SidewalkEndpoint(l.get_directed_parent(), false);\n\n graph.add_edge(n1, n2, cost);\n\n graph.add_edge(n2, n1, cost);\n\n\n\n for turn in map.get_turns_for(l.id, PathConstraints::Pedestrian) {\n\n graph.add_edge(\n\n WalkingNode::SidewalkEndpoint(\n\n l.get_directed_parent(),\n","file_path":"map_model/src/pathfind/dijkstra.rs","rank":13,"score":264618.32638200244},{"content":"fn sidewalk_to_bike(sidewalk_pos: Position, map: &Map) -> Option<(Position, Position)> {\n\n let lane = map.get_parent(sidewalk_pos.lane()).find_closest_lane(\n\n sidewalk_pos.lane(),\n\n |l| !l.biking_blackhole && PathConstraints::Bike.can_use(l, map),\n\n map,\n\n )?;\n\n // No buffer needed\n\n Some((sidewalk_pos.equiv_pos(lane, map), sidewalk_pos))\n\n}\n\n\n\n/// Businesses are categorized into one of these types.\n\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\n\npub enum AmenityType {\n\n Groceries,\n\n Food,\n\n Bar,\n\n Medical,\n\n Religious,\n\n Education,\n\n Financial,\n","file_path":"map_model/src/objects/building.rs","rank":14,"score":263706.4068986103},{"content":"// Adjust the path to start on the building's border, not center\n\nfn trim_path(poly: &Polygon, path: Line) -> Line {\n\n for bldg_line in poly.points().windows(2) {\n\n if let Some(l1) = Line::new(bldg_line[0], bldg_line[1]) {\n\n if let Some(hit) = l1.intersection(&path) {\n\n if let Some(l2) = Line::new(hit, path.pt2()) {\n\n return l2;\n\n }\n\n }\n\n }\n\n }\n\n // Just give up\n\n path\n\n}\n\n\n","file_path":"map_model/src/make/parking_lots.rs","rank":15,"score":262363.77172604925},{"content":"pub fn extract_osm(map: &mut RawMap, opts: &Options, timer: &mut Timer) -> OsmExtract {\n\n let mut doc = crate::reader::read(&opts.osm_input, &map.gps_bounds, timer).unwrap();\n\n\n\n // Use this to quickly test overrides to some ways before upstreaming in OSM.\n\n if false {\n\n let ways: BTreeSet<WayID> = abstio::read_json(\"osm_ways.json\".to_string(), timer);\n\n for id in ways {\n\n doc.ways\n\n .get_mut(&id)\n\n .unwrap()\n\n .tags\n\n .insert(\"junction\", \"intersection\");\n\n }\n\n }\n\n\n\n // TODO Hacks to override OSM data. There's no problem upstream, but we want to accomplish\n\n // various things for A/B Street.\n\n if let Some(way) = doc.ways.get_mut(&WayID(881403608)) {\n\n // https://www.openstreetmap.org/way/881403608 is a roundabout that keeps causing gridlock\n\n way.tags.insert(\"highway\", \"construction\");\n","file_path":"convert_osm/src/extract.rs","rank":16,"score":258026.52754004212},{"content":"fn prebake(map: &Map, scenario: Scenario, opts: Option<SimOptions>, timer: &mut Timer) {\n\n timer.start(format!(\n\n \"prebake for {} / {}\",\n\n scenario.map_name.describe(),\n\n scenario.scenario_name\n\n ));\n\n\n\n let opts = opts.unwrap_or_else(|| {\n\n let mut opts = SimOptions::new(\"prebaked\");\n\n opts.alerts = AlertHandler::Silence;\n\n opts\n\n });\n\n let mut sim = Sim::new(&map, opts);\n\n // Bit of an abuse of this, but just need to fix the rng seed.\n\n let mut rng = SimFlags::for_test(\"prebaked\").make_rng();\n\n scenario.instantiate(&mut sim, &map, &mut rng, timer);\n\n sim.timed_step(\n\n &map,\n\n sim.get_end_of_day() - Time::START_OF_DAY,\n\n &mut None,\n","file_path":"game/src/challenges/prebake.rs","rank":17,"score":256469.8645143385},{"content":"/// Starting from one building, calculate the cost to all others. If a destination isn't reachable,\n\n/// it won't be included in the results. Ignore results greater than the time_limit away.\n\n///\n\n/// If the start building is on the shoulder of a road and `!opts.allow_shoulders`, then the\n\n/// results will always be empty.\n\npub fn all_walking_costs_from(\n\n map: &Map,\n\n start: BuildingID,\n\n time_limit: Duration,\n\n opts: WalkingOptions,\n\n) -> HashMap<BuildingID, Duration> {\n\n let start_lane = map.get_l(map.get_b(start).sidewalk_pos.lane());\n\n if start_lane.lane_type == LaneType::Shoulder && !opts.allow_shoulders {\n\n return HashMap::new();\n\n }\n\n\n\n let mut queue: BinaryHeap<Item> = BinaryHeap::new();\n\n queue.push(Item {\n\n cost: Duration::ZERO,\n\n node: WalkingNode::closest(map.get_b(start).sidewalk_pos, map),\n\n });\n\n\n\n let mut cost_per_node: HashMap<WalkingNode, Duration> = HashMap::new();\n\n while let Some(current) = queue.pop() {\n\n if cost_per_node.contains_key(¤t.node) {\n","file_path":"map_model/src/connectivity/walking.rs","rank":18,"score":255566.3236784251},{"content":"/// Starting from one building, calculate the cost to all others. If a destination isn't reachable,\n\n/// it won't be included in the results. Ignore results greater than the time_limit away.\n\npub fn all_vehicle_costs_from(\n\n map: &Map,\n\n start: BuildingID,\n\n time_limit: Duration,\n\n constraints: PathConstraints,\n\n) -> HashMap<BuildingID, Duration> {\n\n assert!(constraints != PathConstraints::Pedestrian);\n\n let mut results = HashMap::new();\n\n\n\n // TODO We have a graph of DirectedRoadIDs, but mapping a building to one isn't\n\n // straightforward. In the common case it'll be fine, but some buildings are isolated from the\n\n // graph by some sidewalks.\n\n let mut bldg_to_road = HashMap::new();\n\n for b in map.all_buildings() {\n\n if constraints == PathConstraints::Car {\n\n if let Some((pos, _)) = b.driving_connection(map) {\n\n bldg_to_road.insert(b.id, map.get_l(pos.lane()).get_directed_parent());\n\n }\n\n } else if constraints == PathConstraints::Bike {\n\n if let Some((pos, _)) = b.biking_connection(map) {\n","file_path":"map_model/src/connectivity/mod.rs","rank":19,"score":255560.48429935137},{"content":"pub fn path_raw_map(name: &MapName) -> String {\n\n path(format!(\n\n \"input/{}/{}/raw_maps/{}.bin\",\n\n name.city.country, name.city.city, name.map\n\n ))\n\n}\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":20,"score":250995.60975151445},{"content":"/// Return the cost of a single path, and also a mapping from every directed road to the cost of\n\n/// getting there from the same start. This can be used to understand why an alternative route\n\n/// wasn't chosen.\n\npub fn debug_vehicle_costs(\n\n req: PathRequest,\n\n map: &Map,\n\n) -> Option<(Duration, HashMap<DirectedRoadID, Duration>)> {\n\n // TODO Support this\n\n if req.constraints == PathConstraints::Pedestrian {\n\n return None;\n\n }\n\n\n\n let (_, cost) = crate::pathfind::dijkstra::pathfind(req.clone(), map.routing_params(), map)?;\n\n\n\n let graph = build_graph_for_vehicles(map, req.constraints);\n\n let road_costs = petgraph::algo::dijkstra(\n\n &graph,\n\n map.get_l(req.start.lane()).get_directed_parent(),\n\n None,\n\n |(_, _, mvmnt)| {\n\n vehicle_cost(\n\n mvmnt.from,\n\n *mvmnt,\n\n req.constraints,\n\n map.routing_params(),\n\n map,\n\n ) + zone_cost(*mvmnt, req.constraints, map)\n\n },\n\n );\n\n\n\n Some((cost, road_costs))\n\n}\n","file_path":"map_model/src/connectivity/mod.rs","rank":21,"score":250281.8352254677},{"content":"/// Also returns a list of labeled polygons for debugging.\n\n///\n\n/// Ideally, the resulting polygon should exist entirely within the thick bands around all original\n\n/// roads -- it just carves up part of that space, doesn't reach past it. But that's not always true\n\n/// yet.\n\npub fn intersection_polygon(\n\n i: &Intersection,\n\n roads: &mut BTreeMap<OriginalRoad, Road>,\n\n) -> Result<(Polygon, Vec<(String, Polygon)>)> {\n\n if i.roads.is_empty() {\n\n panic!(\"{} has no roads\", i.id);\n\n }\n\n\n\n // Turn all of the incident roads into two PolyLines (the \"forwards\" and \"backwards\" borders of\n\n // the road, if the roads were oriented to both be incoming to the intersection), both ending\n\n // at the intersection\n\n // TODO Maybe express the two incoming PolyLines as the \"right\" and \"left\"\n\n let mut lines: Vec<(OriginalRoad, Pt2D, PolyLine, PolyLine)> = Vec::new();\n\n // This is guaranteed to get set, since i.roads is non-empty\n\n let mut intersection_center = Pt2D::new(0.0, 0.0);\n\n for id in &i.roads {\n\n let r = &roads[id];\n\n\n\n let pl = if r.src_i == i.id {\n\n r.trimmed_center_pts.reversed()\n","file_path":"map_model/src/make/initial/geometry.rs","rank":22,"score":250209.49325407043},{"content":"/// Transform a sequence of roads representing a path into the current lane-based path, by picking\n\n/// particular lanes and turns to use.\n\npub fn path_v2_to_v1(\n\n req: PathRequest,\n\n road_steps: Vec<DirectedRoadID>,\n\n uber_turns_v2: Vec<UberTurnV2>,\n\n map: &Map,\n\n) -> Result<Path> {\n\n // This is a somewhat brute-force method: run Dijkstra's algorithm on a graph of lanes and\n\n // turns, but only build the graph along the path of roads we've already found. This handles\n\n // arbitrary lookahead needed, and forces use of the original start/end lanes requested.\n\n //\n\n // Eventually we'll directly return road-based paths. Most callers will actually just use that\n\n // directly, and mainly the simulation will need to expand to specific lanes, but it'll do so\n\n // dynamically/lazily to account for current traffic conditions.\n\n let mut graph = petgraph::graphmap::DiGraphMap::new();\n\n for pair in road_steps.windows(2) {\n\n for src in pair[0].lanes(req.constraints, map) {\n\n for dst in pair[1].lanes(req.constraints, map) {\n\n let turn = TurnID {\n\n parent: map.get_l(src).dst_i,\n\n src,\n","file_path":"map_model/src/pathfind/v2.rs","rank":23,"score":250197.25577988217},{"content":"pub fn distribute_residents(map: &mut map_model::Map, timer: &mut Timer) {\n\n for shape in abstio::read_binary::<ExtraShapes>(\n\n \"data/input/de/berlin/planning_areas.bin\".to_string(),\n\n timer,\n\n )\n\n .shapes\n\n {\n\n let pts = map.get_gps_bounds().convert(&shape.points);\n\n if pts\n\n .iter()\n\n .all(|pt| !map.get_boundary_polygon().contains_pt(*pt))\n\n {\n\n continue;\n\n }\n\n let region = Ring::must_new(pts).to_polygon();\n\n // Deterministically seed using the planning area's ID.\n\n let mut rng =\n\n XorShiftRng::seed_from_u64(shape.attributes[\"spatial_name\"].parse::<u64>().unwrap());\n\n\n\n for (home, n) in popdat::distribute_population_to_homes(\n","file_path":"importer/src/berlin.rs","rank":24,"score":250152.17990445186},{"content":"/// Run the contents of a .osm through the full map importer with default options.\n\nfn import_map(path: String) -> Map {\n\n let mut timer = Timer::new(\"convert synthetic map\");\n\n let raw = convert_osm::convert(\n\n convert_osm::Options {\n\n name: MapName::new(\"zz\", \"oneshot\", &abstutil::basename(&path)),\n\n osm_input: path,\n\n clip: None,\n\n map_config: map_model::MapConfig {\n\n driving_side: map_model::DrivingSide::Right,\n\n bikes_can_use_bus_lanes: true,\n\n inferred_sidewalks: true,\n\n street_parking_spot_length: Distance::meters(8.0),\n\n },\n\n onstreet_parking: convert_osm::OnstreetParking::JustOSM,\n\n public_offstreet_parking: convert_osm::PublicOffstreetParking::None,\n\n private_offstreet_parking: convert_osm::PrivateOffstreetParking::FixedPerBldg(0),\n\n include_railroads: true,\n\n extra_buildings: None,\n\n },\n\n &mut timer,\n\n );\n\n let map = Map::create_from_raw(raw, true, true, &mut timer);\n\n map\n\n}\n\n\n","file_path":"tests/src/main.rs","rank":25,"score":249939.81911922386},{"content":"fn load_study_area(map: &Map) -> Result<Polygon> {\n\n let bytes = abstio::slurp_file(abstio::path(format!(\n\n \"system/study_areas/{}.geojson\",\n\n map.get_name().city.city.replace(\"_\", \"-\")\n\n )))?;\n\n let raw_string = std::str::from_utf8(&bytes)?;\n\n let geojson = raw_string.parse::<geojson::GeoJson>()?;\n\n\n\n if let geojson::GeoJson::FeatureCollection(collection) = geojson {\n\n for feature in collection.features {\n\n if let Some(geom) = feature.geometry {\n\n if let geojson::Value::Polygon(raw_pts) = geom.value {\n\n return parse_polygon(raw_pts, map.get_gps_bounds());\n\n }\n\n }\n\n }\n\n }\n\n bail!(\"no study area\");\n\n}\n","file_path":"importer/src/uk.rs","rank":26,"score":247888.16785310418},{"content":"/// Simple second-pass after generating all signals. Find pairs of traffic signals very close to\n\n/// each other with 2 stages each, see if the primary movement of the first stages lead to each\n\n/// other, and flip the order of stages if not. This is often wrong when the most common movement is\n\n/// actually turning left then going straight (near Mercer for example), but not sure how we could\n\n/// know that without demand data.\n\npub fn synchronize(map: &mut Map) {\n\n let mut seen = HashSet::new();\n\n let mut pairs = Vec::new();\n\n let handmapped = traffic_signal_data::load_all_data().unwrap();\n\n for i in map.all_intersections() {\n\n if !i.is_traffic_signal() || seen.contains(&i.id) || handmapped.contains_key(&i.orig_id.0) {\n\n continue;\n\n }\n\n if let Some(list) = IntersectionCluster::autodetect(i.id, map) {\n\n let list = list.into_iter().collect::<Vec<_>>();\n\n if list.len() == 2\n\n && map.get_traffic_signal(list[0]).stages.len() == 2\n\n && map.get_traffic_signal(list[1]).stages.len() == 2\n\n {\n\n pairs.push((list[0], list[1]));\n\n seen.insert(list[0]);\n\n seen.insert(list[1]);\n\n }\n\n }\n\n }\n","file_path":"map_model/src/make/traffic_signals/mod.rs","rank":27,"score":246826.65498767985},{"content":"/// This import from GTFS:\n\n/// - is specific to Seattle, whose files don't seem to match https://developers.google.com/transit/gtfs/reference\n\n/// - is probably wrong\n\npub fn add_gtfs_schedules(map: &mut Map) {\n\n let city = CityName::seattle();\n\n // https://www.openstreetmap.org/relation/8616968 as an example, mapping to\n\n // https://kingcounty.gov/depts/transportation/metro/schedules-maps/route/048.aspx\n\n\n\n let mut trip_marker_to_route: BTreeMap<String, BusRouteID> = BTreeMap::new();\n\n for br in map.all_bus_routes() {\n\n if let Some(ref m) = br.gtfs_trip_marker {\n\n // Dunno what the :0 thing is\n\n trip_marker_to_route.insert(m.split(\":\").next().unwrap().to_string(), br.id);\n\n }\n\n }\n\n\n\n // Each route has a bunch of trips throughout the day\n\n let mut trip_marker_to_trips: MultiMap<String, String> = MultiMap::new();\n\n for rec in\n\n csv::Reader::from_reader(File::open(city.input_path(\"google_transit/trips.txt\")).unwrap())\n\n .deserialize()\n\n {\n\n let rec: TripRecord = rec.unwrap();\n","file_path":"importer/src/seattle.rs","rank":28,"score":246352.49542127497},{"content":"fn make_elevation(ctx: &EventCtx, color: Color, walking: bool, path: &Path, map: &Map) -> Widget {\n\n let mut pts: Vec<(Distance, Distance)> = Vec::new();\n\n let mut dist = Distance::ZERO;\n\n for step in path.get_steps() {\n\n if let PathStep::Turn(t) = step {\n\n pts.push((dist, map.get_i(t.parent).elevation));\n\n }\n\n dist += step.as_traversable().length(map);\n\n }\n\n // TODO Show roughly where we are in the trip; use distance covered by current path for this\n\n LinePlot::new(\n\n ctx,\n\n vec![Series {\n\n label: if walking {\n\n \"Elevation for walking\"\n\n } else {\n\n \"Elevation for biking\"\n\n }\n\n .to_string(),\n\n color,\n\n pts,\n\n }],\n\n PlotOptions::fixed(),\n\n )\n\n}\n\n\n","file_path":"game/src/info/trip.rs","rank":29,"score":245796.994557516},{"content":"pub fn draw_stage_number(\n\n app: &dyn AppLike,\n\n prerender: &Prerender,\n\n i: IntersectionID,\n\n idx: usize,\n\n batch: &mut GeomBatch,\n\n) {\n\n let radius = Distance::meters(1.0);\n\n let center = app.map().get_i(i).polygon.polylabel();\n\n batch.push(\n\n Color::hex(\"#5B5B5B\"),\n\n Circle::new(center, radius).to_polygon(),\n\n );\n\n batch.append(\n\n Text::from(Line(format!(\"{}\", idx + 1)).fg(Color::WHITE))\n\n .render_autocropped(prerender)\n\n .scale(0.075)\n\n .centered_on(center),\n\n );\n\n}\n\n\n","file_path":"map_gui/src/render/traffic_signal.rs","rank":30,"score":245246.8589101408},{"content":"pub fn draw_signal_stage(\n\n prerender: &Prerender,\n\n stage: &Stage,\n\n idx: usize,\n\n i: IntersectionID,\n\n time_left: Option<Duration>,\n\n batch: &mut GeomBatch,\n\n app: &dyn AppLike,\n\n signal_style: TrafficSignalStyle,\n\n) {\n\n let signal = app.map().get_traffic_signal(i);\n\n\n\n match signal_style {\n\n TrafficSignalStyle::BAP => {\n\n let mut dont_walk = BTreeSet::new();\n\n let mut crossed_roads = BTreeSet::new();\n\n for m in signal.movements.keys() {\n\n if m.crosswalk {\n\n dont_walk.insert(m);\n\n // TODO This is incorrect; some crosswalks hop over intermediate roads. How do\n","file_path":"map_gui/src/render/traffic_signal.rs","rank":31,"score":245246.8589101408},{"content":"/// Match OSM buildings to parcels, scraping the number of housing units.\n\n// TODO It's expensive to load the huge zoning_parcels.bin file for every map.\n\npub fn match_parcels_to_buildings(map: &mut Map, shapes: &ExtraShapes, timer: &mut Timer) {\n\n let mut parcels_with_housing: Vec<(Polygon, usize)> = Vec::new();\n\n // TODO We should refactor something like FindClosest, but for polygon containment\n\n // The quadtree's ID is just an index into parcels_with_housing.\n\n let mut quadtree: QuadTree<usize> = QuadTree::default(map.get_bounds().as_bbox());\n\n timer.start_iter(\"index all parcels\", shapes.shapes.len());\n\n for shape in &shapes.shapes {\n\n timer.next();\n\n if let Some(units) = shape\n\n .attributes\n\n .get(\"EXIST_UNITS\")\n\n .and_then(|x| x.parse::<usize>().ok())\n\n {\n\n if let Some(ring) = map\n\n .get_gps_bounds()\n\n .try_convert(&shape.points)\n\n .and_then(|pts| Ring::new(pts).ok())\n\n {\n\n let polygon = ring.to_polygon();\n\n quadtree\n","file_path":"importer/src/seattle.rs","rank":32,"score":243990.80849942862},{"content":"fn floodfill(map: &Map, start: RoadID) -> Zone {\n\n let match_constraints = map.get_r(start).access_restrictions.clone();\n\n let merge_zones = map.get_edits().merge_zones;\n\n let mut queue = vec![start];\n\n let mut members = BTreeSet::new();\n\n let mut borders = BTreeSet::new();\n\n while !queue.is_empty() {\n\n let current = queue.pop().unwrap();\n\n if members.contains(¤t) {\n\n continue;\n\n }\n\n members.insert(current);\n\n for r in map.get_next_roads(current) {\n\n let r = map.get_r(r);\n\n if r.access_restrictions == match_constraints && merge_zones {\n\n queue.push(r.id);\n\n } else {\n\n borders.insert(map.get_r(current).common_endpt(r));\n\n }\n\n }\n\n }\n\n assert!(!members.is_empty());\n\n assert!(!borders.is_empty());\n\n Zone {\n\n members,\n\n borders,\n\n restrictions: match_constraints,\n\n }\n\n}\n","file_path":"map_model/src/objects/zone.rs","rank":33,"score":243290.08227670705},{"content":"pub fn unzoomed_agent_radius(vt: Option<VehicleType>) -> Distance {\n\n // Lane thickness is a little hard to see, so double it. Most of the time, the circles don't\n\n // leak out of the road too much.\n\n if vt.is_some() {\n\n 4.0 * NORMAL_LANE_THICKNESS\n\n } else {\n\n 4.0 * SIDEWALK_THICKNESS\n\n }\n\n}\n\n\n","file_path":"map_gui/src/render/mod.rs","rank":34,"score":242420.86215273026},{"content":"pub fn angle_from_arrow_keys(ctx: &EventCtx) -> Option<Angle> {\n\n let mut x: f64 = 0.0;\n\n let mut y: f64 = 0.0;\n\n if ctx.is_key_down(Key::LeftArrow) || ctx.is_key_down(Key::A) {\n\n x -= 1.0;\n\n }\n\n if ctx.is_key_down(Key::RightArrow) || ctx.is_key_down(Key::D) {\n\n x += 1.0;\n\n }\n\n if ctx.is_key_down(Key::UpArrow) || ctx.is_key_down(Key::W) {\n\n y -= 1.0;\n\n }\n\n if ctx.is_key_down(Key::DownArrow) || ctx.is_key_down(Key::S) {\n\n y += 1.0;\n\n }\n\n\n\n if x == 0.0 && y == 0.0 {\n\n return None;\n\n }\n\n Some(Angle::new_rads(y.atan2(x)))\n\n}\n","file_path":"santa/src/controls.rs","rank":35,"score":242033.1265257657},{"content":"pub fn convert(opts: Options, timer: &mut abstutil::Timer) -> RawMap {\n\n let mut map = RawMap::blank(opts.name.clone());\n\n if let Some(ref path) = opts.clip {\n\n let pts = LonLat::read_osmosis_polygon(path).unwrap();\n\n let gps_bounds = GPSBounds::from(pts.clone());\n\n map.boundary_polygon = Ring::must_new(gps_bounds.convert(&pts)).to_polygon();\n\n map.gps_bounds = gps_bounds;\n\n }\n\n\n\n let extract = extract::extract_osm(&mut map, &opts, timer);\n\n let (amenities, pt_to_road) = split_ways::split_up_roads(&mut map, extract, timer);\n\n clip::clip_map(&mut map, timer);\n\n\n\n // Need to do a first pass of removing cul-de-sacs here, or we wind up with loop PolyLines when\n\n // doing the parking hint matching.\n\n abstutil::retain_btreemap(&mut map.roads, |r, _| r.i1 != r.i2);\n\n\n\n let all_routes = map.bus_routes.drain(..).collect::<Vec<_>>();\n\n let mut routes = Vec::new();\n\n for route in all_routes {\n","file_path":"convert_osm/src/lib.rs","rank":36,"score":241787.3171255681},{"content":"pub fn path_all_edits(name: &MapName) -> String {\n\n path(format!(\n\n \"player/edits/{}/{}/{}\",\n\n name.city.country, name.city.city, name.map\n\n ))\n\n}\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":37,"score":241413.18282118926},{"content":"pub fn path_all_scenarios(name: &MapName) -> String {\n\n path(format!(\n\n \"system/{}/{}/scenarios/{}\",\n\n name.city.country, name.city.city, name.map\n\n ))\n\n}\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":38,"score":241413.18282118926},{"content":"pub fn parent_path(path: &str) -> String {\n\n format!(\"{}\", std::path::Path::new(path).parent().unwrap().display())\n\n}\n","file_path":"abstutil/src/utils.rs","rank":39,"score":240896.42655667395},{"content":"fn validate_zones(map: &Map, steps: &Vec<PathStep>, req: &PathRequest) {\n\n let z1 = map.get_parent(req.start.lane()).get_zone(map);\n\n let z2 = map.get_parent(req.end.lane()).get_zone(map);\n\n\n\n for step in steps {\n\n if let PathStep::Turn(t) = step {\n\n if map\n\n .get_parent(t.src)\n\n .access_restrictions\n\n .allow_through_traffic\n\n .contains(req.constraints)\n\n && !map\n\n .get_parent(t.dst)\n\n .access_restrictions\n\n .allow_through_traffic\n\n .contains(req.constraints)\n\n {\n\n // Entering our destination zone is fine\n\n let into_zone = map.get_parent(t.dst).get_zone(map);\n\n if into_zone != z1 && into_zone != z2 {\n","file_path":"map_model/src/pathfind/v1.rs","rank":40,"score":237764.9934293487},{"content":"fn use_parking_hints(map: &mut RawMap, path: String, timer: &mut Timer) {\n\n timer.start(\"apply parking hints\");\n\n let shapes: ExtraShapes = abstio::read_binary(path, timer);\n\n\n\n // Match shapes with the nearest road + direction (true for forwards)\n\n let mut closest: FindClosest<(OriginalRoad, bool)> =\n\n FindClosest::new(&map.gps_bounds.to_bounds());\n\n for (id, r) in &map.roads {\n\n if r.is_light_rail() || r.is_footway() || r.is_service() {\n\n continue;\n\n }\n\n let center = PolyLine::must_new(r.center_points.clone());\n\n closest.add(\n\n (*id, true),\n\n center.must_shift_right(DIRECTED_ROAD_THICKNESS).points(),\n\n );\n\n closest.add(\n\n (*id, false),\n\n center.must_shift_left(DIRECTED_ROAD_THICKNESS).points(),\n\n );\n","file_path":"convert_osm/src/parking.rs","rank":41,"score":237156.87832594218},{"content":"fn use_offstreet_parking(map: &mut RawMap, path: String, timer: &mut Timer) {\n\n timer.start(\"match offstreet parking points\");\n\n let shapes: ExtraShapes = abstio::read_binary(path, timer);\n\n\n\n let mut closest: FindClosest<osm::OsmID> = FindClosest::new(&map.gps_bounds.to_bounds());\n\n for (id, b) in &map.buildings {\n\n closest.add(*id, b.polygon.points());\n\n }\n\n\n\n // TODO Another function just to use ?. Try blocks would rock.\n\n let mut handle_shape: Box<dyn FnMut(kml::ExtraShape) -> Option<()>> = Box::new(|s| {\n\n assert_eq!(s.points.len(), 1);\n\n let pt = s.points[0].to_pt(&map.gps_bounds);\n\n let (id, _) = closest.closest_pt(pt, Distance::meters(50.0))?;\n\n // TODO Handle parking lots.\n\n if !map.buildings[&id].polygon.contains_pt(pt) {\n\n return None;\n\n }\n\n let name = s.attributes.get(\"DEA_FACILITY_NAME\")?.to_string();\n\n let num_stalls = s.attributes.get(\"DEA_STALLS\")?.parse::<usize>().ok()?;\n","file_path":"convert_osm/src/parking.rs","rank":42,"score":237156.87832594218},{"content":"pub fn path_camera_state(name: &MapName) -> String {\n\n path(format!(\n\n \"player/camera_state/{}/{}/{}.json\",\n\n name.city.country, name.city.city, name.map\n\n ))\n\n}\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":43,"score":237056.05265370163},{"content":"fn draw_unwalkable_roads(ctx: &mut EventCtx, app: &App, opts: &Options) -> Drawable {\n\n let allow_shoulders = match opts {\n\n Options::Walking(ref opts) => opts.allow_shoulders,\n\n Options::Biking => {\n\n return Drawable::empty(ctx);\n\n }\n\n };\n\n\n\n let mut batch = GeomBatch::new();\n\n 'ROADS: for road in app.map.all_roads() {\n\n if road.is_light_rail() {\n\n continue;\n\n }\n\n for (_, _, lt) in road.lanes_ltr() {\n\n if lt == LaneType::Sidewalk || (lt == LaneType::Shoulder && allow_shoulders) {\n\n continue 'ROADS;\n\n }\n\n }\n\n // TODO Skip highways\n\n batch.push(Color::BLUE.alpha(0.5), road.get_thick_polygon(&app.map));\n\n }\n\n ctx.upload(batch)\n\n}\n","file_path":"fifteen_min/src/viewer.rs","rank":44,"score":234695.56363938164},{"content":"// (Epicenter, entire shape)\n\nfn cluster_jams(map: &Map, problems: Vec<(IntersectionID, Time)>) -> Vec<(Polygon, Polygon)> {\n\n let mut jams: Vec<Jam> = Vec::new();\n\n // The delay itself doesn't matter, as long as they're sorted.\n\n for (i, _) in problems {\n\n // Is this connected to an existing problem?\n\n if let Some(ref mut jam) = jams.iter_mut().find(|j| j.adjacent_to(map, i)) {\n\n jam.members.insert(i);\n\n } else {\n\n jams.push(Jam {\n\n epicenter: i,\n\n members: btreeset! { i },\n\n });\n\n }\n\n }\n\n\n\n jams.into_iter()\n\n .map(|jam| {\n\n (\n\n map.get_i(jam.epicenter).polygon.clone(),\n\n Polygon::convex_hull(jam.all_polygons(map)),\n","file_path":"game/src/layer/traffic.rs","rank":45,"score":234235.57992002412},{"content":"/// Exports a single road to Streetmix's format, returns the filename\n\npub fn export(r: RoadID, map: &Map) -> String {\n\n let path = format!(\"streetmix_export_{}.json\", r.0);\n\n let street = road(r, map);\n\n abstio::write_json(path.clone(), &street);\n\n path\n\n}\n\n\n","file_path":"game/src/debug/streetmix.rs","rank":46,"score":233125.5533390871},{"content":"fn calculate_turn_markings(map: &Map, lane: &Lane) -> Vec<Polygon> {\n\n if lane.length() < Distance::meters(7.0) {\n\n return Vec::new();\n\n }\n\n\n\n // Does this lane connect to every other possible outbound lane of the same type, excluding\n\n // U-turns to the same road? If so, then there's nothing unexpected to communicate.\n\n let i = map.get_i(lane.dst_i);\n\n if i.outgoing_lanes.iter().all(|l| {\n\n let l = map.get_l(*l);\n\n l.lane_type != lane.lane_type\n\n || l.parent == lane.parent\n\n || map\n\n .maybe_get_t(TurnID {\n\n parent: i.id,\n\n src: lane.id,\n\n dst: l.id,\n\n })\n\n .is_some()\n\n }) {\n","file_path":"map_gui/src/render/lane.rs","rank":47,"score":232617.9587049513},{"content":"fn calculate_parking_lines(lane: &Lane, map: &Map) -> Vec<Polygon> {\n\n // meters, but the dims get annoying below to remove\n\n let leg_length = Distance::meters(1.0);\n\n\n\n let mut result = Vec::new();\n\n let num_spots = lane.number_parking_spots(map.get_config());\n\n if num_spots > 0 {\n\n for idx in 0..=num_spots {\n\n let (pt, lane_angle) = lane\n\n .lane_center_pts\n\n .must_dist_along(map.get_config().street_parking_spot_length * (1.0 + idx as f64));\n\n let perp_angle = if map.get_config().driving_side == DrivingSide::Right {\n\n lane_angle.rotate_degs(270.0)\n\n } else {\n\n lane_angle.rotate_degs(90.0)\n\n };\n\n // Find the outside of the lane. Actually, shift inside a little bit, since the line\n\n // will have thickness, but shouldn't really intersect the adjacent line\n\n // when drawn.\n\n let t_pt = pt.project_away(lane.width * 0.4, perp_angle);\n","file_path":"map_gui/src/render/lane.rs","rank":48,"score":232617.9587049513},{"content":"pub fn adjust_private_parking(map: &mut Map, scenario: &Scenario) {\n\n for (b, count) in scenario.count_parked_cars_per_bldg().consume() {\n\n map.hack_override_offstreet_spots_individ(b, count);\n\n }\n\n map.save();\n\n}\n\n\n","file_path":"importer/src/seattle.rs","rank":49,"score":229895.29587238882},{"content":"/// Generate all driving and walking turns at an intersection, accounting for OSM turn restrictions.\n\npub fn make_all_turns(map: &Map, i: &Intersection) -> Vec<Turn> {\n\n let mut raw_turns: Vec<Turn> = Vec::new();\n\n raw_turns.extend(make_vehicle_turns(i, map));\n\n raw_turns.extend(crate::make::walking_turns::filter_turns(\n\n crate::make::walking_turns::make_walking_turns(map, i),\n\n map,\n\n i,\n\n ));\n\n let unique_turns = ensure_unique(raw_turns);\n\n\n\n let mut final_turns: Vec<Turn> = Vec::new();\n\n let mut filtered_turns: HashMap<LaneID, Vec<Turn>> = HashMap::new();\n\n for turn in unique_turns {\n\n if !does_turn_pass_restrictions(&turn, i, map) {\n\n continue;\n\n }\n\n\n\n if is_turn_allowed(&turn, map) {\n\n final_turns.push(turn);\n\n } else {\n","file_path":"map_model/src/make/turns.rs","rank":50,"score":229822.55238638795},{"content":"pub fn make_crosswalk(batch: &mut GeomBatch, turn: &Turn, map: &Map, cs: &ColorScheme) {\n\n if make_rainbow_crosswalk(batch, turn, map) {\n\n return;\n\n }\n\n\n\n // This size also looks better for shoulders\n\n let width = SIDEWALK_THICKNESS;\n\n // Start at least width out to not hit sidewalk corners. Also account for the thickness of the\n\n // crosswalk line itself. Center the lines inside these two boundaries.\n\n let boundary = width;\n\n let tile_every = width * 0.6;\n\n let line = {\n\n // The middle line in the crosswalk geometry is the main crossing line.\n\n let pts = turn.geom.points();\n\n if pts.len() < 3 {\n\n println!(\n\n \"Not rendering crosswalk for {}; its geometry was squished earlier\",\n\n turn.id\n\n );\n\n return;\n","file_path":"map_gui/src/render/intersection.rs","rank":51,"score":228504.44073011997},{"content":"fn degenerate(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\n\n if roads.len() != 2 {\n\n return None;\n\n }\n\n let (r1, r2) = (roads[0], roads[1]);\n\n\n\n let mut ts = new(i, map);\n\n make_stages(\n\n &mut ts,\n\n map.config.driving_side,\n\n vec![vec![(vec![r1, r2], TurnType::Straight, PROTECTED)]],\n\n );\n\n Some(ts)\n\n}\n\n\n","file_path":"map_model/src/make/traffic_signals/mod.rs","rank":52,"score":227278.1902782637},{"content":"pub fn draw_occupants(details: &mut Details, app: &App, id: BuildingID, focus: Option<PersonID>) {\n\n // TODO Lots of fun ideas here. Have a deterministic simulation based on building ID and time\n\n // to have people \"realistically\" move around. Draw little floor plans.\n\n\n\n let mut ppl = app.primary.sim.bldg_to_people(id);\n\n let num_rows_cols = (ppl.len() as f64).sqrt().ceil() as usize;\n\n\n\n let ped_len = SIDEWALK_THICKNESS.inner_meters() / 2.0;\n\n let separation = ped_len * 1.5;\n\n\n\n let total_width_height = (num_rows_cols as f64) * (ped_len + separation);\n\n let top_left = app\n\n .primary\n\n .map\n\n .get_b(id)\n\n .label_center\n\n .offset(-total_width_height / 2.0, -total_width_height / 2.0);\n\n\n\n // TODO Current thing is inefficient and can easily wind up outside the building.\n\n\n","file_path":"game/src/info/building.rs","rank":53,"score":227250.9165431084},{"content":"pub fn path<I: AsRef<str>>(p: I) -> String {\n\n let p = p.as_ref();\n\n if p.starts_with(\"player/\") {\n\n format!(\"{}/{}\", *ROOT_PLAYER_DIR, p)\n\n } else {\n\n format!(\"{}/{}\", *ROOT_DIR, p)\n\n }\n\n}\n\n\n\n/// A single city is identified using this.\n\n#[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Serialize, Deserialize)]\n\npub struct CityName {\n\n /// A two letter lowercase country code, from https://en.wikipedia.org/wiki/ISO_3166-1_alpha-2.\n\n /// To represent imaginary/test cities, use the code `zz`.\n\n pub country: String,\n\n /// The name of the city, in filename-friendly form -- for example, \"tel_aviv\".\n\n pub city: String,\n\n}\n\n\n\nimpl CityName {\n","file_path":"abstio/src/abst_paths.rs","rank":54,"score":226521.4906780455},{"content":"fn half_signal(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n if map.get_i(i).roads.len() != 2 {\n\n return None;\n\n }\n\n\n\n let mut ts = new(i, map);\n\n let mut vehicle_stage = Stage::new();\n\n let mut ped_stage = Stage::new();\n\n for (id, movement) in &ts.movements {\n\n if id.crosswalk {\n\n ped_stage.edit_movement(movement, TurnPriority::Protected);\n\n } else {\n\n vehicle_stage.edit_movement(movement, TurnPriority::Protected);\n\n }\n\n }\n\n vehicle_stage.stage_type = StageType::Fixed(Duration::minutes(1));\n\n ped_stage.stage_type = StageType::Fixed(Duration::seconds(10.0));\n\n\n\n ts.stages = vec![vehicle_stage, ped_stage];\n\n Some(ts)\n\n}\n\n\n","file_path":"map_model/src/make/traffic_signals/mod.rs","rank":55,"score":224799.74396705895},{"content":"fn three_way(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\n\n if roads.len() != 3 {\n\n return None;\n\n }\n\n let mut ts = new(i, map);\n\n\n\n // Picture a T intersection. Use turn angles to figure out the \"main\" two roads.\n\n let straight = ts\n\n .movements\n\n .values()\n\n .find(|g| g.turn_type == TurnType::Straight)?;\n\n let (north, south) = (straight.id.from.id, straight.id.to.id);\n\n let east = roads\n\n .into_iter()\n\n .find(|r| *r != north && *r != south)\n\n .unwrap();\n\n\n\n // Two-stage with no protected lefts, right turn on red, turning cars yield to peds\n\n make_stages(\n","file_path":"map_model/src/make/traffic_signals/mod.rs","rank":56,"score":224799.74396705895},{"content":"// TODO This assumes the lanes change direction only at one point. A two-way cycletrack right at\n\n// the border will look a bit off.\n\nfn calculate_border_arrows(i: &Intersection, r: &Road, map: &Map) -> Vec<Polygon> {\n\n let mut result = Vec::new();\n\n\n\n let mut width_fwd = Distance::ZERO;\n\n let mut width_back = Distance::ZERO;\n\n for (l, dir, _) in r.lanes_ltr() {\n\n if dir == Direction::Fwd {\n\n width_fwd += map.get_l(l).width;\n\n } else {\n\n width_back += map.get_l(l).width;\n\n }\n\n }\n\n let center = r.get_dir_change_pl(map);\n\n\n\n // These arrows should point from the void to the road\n\n if !i.outgoing_lanes.is_empty() {\n\n let (line, width) = if r.dst_i == i.id {\n\n (\n\n center.last_line().shift_left(width_back / 2.0).reverse(),\n\n width_back,\n","file_path":"map_gui/src/render/intersection.rs","rank":57,"score":224404.6524147736},{"content":"/// Generate Crosswalk and SharedSidewalkCorner (places where two sidewalks directly meet) turns\n\npub fn make_walking_turns(map: &Map, i: &Intersection) -> Vec<Turn> {\n\n if i.is_footway(map) {\n\n return make_footway_turns(map, i);\n\n }\n\n\n\n let driving_side = map.config.driving_side;\n\n let all_roads = map.all_roads();\n\n let lanes = map.all_lanes();\n\n\n\n let roads: Vec<&Road> = i\n\n .get_roads_sorted_by_incoming_angle(all_roads)\n\n .into_iter()\n\n .map(|id| &all_roads[id.0])\n\n .collect();\n\n let mut result: Vec<Turn> = Vec::new();\n\n\n\n // I'm a bit confused when to do -1 and +1 honestly, but this works in practice. Angle sorting\n\n // may be a little backwards.\n\n let idx_offset = if driving_side == DrivingSide::Right {\n\n -1\n","file_path":"map_model/src/make/walking_turns.rs","rank":58,"score":224315.99005702144},{"content":"// Transforms all zones into the map's coordinate space, no matter how far out-of-bounds they are.\n\nfn parse_zones(gps_bounds: &GPSBounds, path: String) -> Result<HashMap<String, Polygon>> {\n\n let mut zones = HashMap::new();\n\n\n\n let bytes = abstio::slurp_file(path)?;\n\n let raw_string = std::str::from_utf8(&bytes)?;\n\n let geojson = raw_string.parse::<geojson::GeoJson>()?;\n\n\n\n if let geojson::GeoJson::FeatureCollection(collection) = geojson {\n\n for feature in collection.features {\n\n let zone = feature\n\n .property(\"geo_code\")\n\n .and_then(|x| x.as_str())\n\n .ok_or_else(|| anyhow!(\"no geo_code\"))?\n\n .to_string();\n\n if let Some(geom) = feature.geometry {\n\n if let geojson::Value::MultiPolygon(mut raw_polygons) = geom.value {\n\n if raw_polygons.len() != 1 {\n\n // We'll just one of them arbitrarily\n\n warn!(\n\n \"Zone {} has a multipolygon with {} members\",\n","file_path":"importer/src/uk.rs","rank":59,"score":223298.75830567756},{"content":"/// When the PermanentMapEdits format changes, add a transformation here to automatically convert\n\n/// edits written with the old format.\n\n///\n\n/// This problem is often solved with something like protocol buffers, but the resulting proto\n\n/// usually winds up with permanent legacy fields, unless the changes are purely additive. For\n\n/// example, protobufs wouldn't have helped with the fix_intersection_ids problem. Explicit\n\n/// transformation is easier!\n\npub fn upgrade(mut value: Value, map: &Map) -> Result<PermanentMapEdits> {\n\n // c46a74f10f4f1976a48aa8642ac11717d74b262c added an explicit version field. There are a few\n\n // changes before that.\n\n if value.get(\"version\").is_none() {\n\n // I don't remember the previous schema change before this. If someone files a bug and has\n\n // an older file, can add support for it then.\n\n fix_offset(&mut value);\n\n fix_intersection_ids(&mut value);\n\n\n\n value\n\n .as_object_mut()\n\n .unwrap()\n\n .insert(\"version\".to_string(), Value::Number(0.into()));\n\n }\n\n if value[\"version\"] == Value::Number(0.into()) {\n\n fix_road_direction(&mut value);\n\n value\n\n .as_object_mut()\n\n .unwrap()\n\n .insert(\"version\".to_string(), Value::Number(1.into()));\n","file_path":"map_model/src/edits/compat.rs","rank":60,"score":222597.67700528004},{"content":"fn make_controls(ctx: &mut EventCtx, app: &App, opts: &Options, legend: Option<Widget>) -> Panel {\n\n let (total_ppl, ppl_in_bldg, ppl_off_map) = app.primary.sim.num_ppl();\n\n\n\n let mut col = vec![\n\n header(\n\n ctx,\n\n &format!(\"Population: {}\", prettyprint_usize(total_ppl)),\n\n ),\n\n Widget::row(vec![\n\n Widget::row(vec![\n\n Image::from_path(\"system/assets/tools/home.svg\").into_widget(ctx),\n\n Line(prettyprint_usize(ppl_in_bldg))\n\n .small()\n\n .into_widget(ctx),\n\n ]),\n\n Line(format!(\"Off-map: {}\", prettyprint_usize(ppl_off_map)))\n\n .small()\n\n .into_widget(ctx),\n\n ])\n\n .centered(),\n","file_path":"game/src/layer/population.rs","rank":61,"score":222468.13278242399},{"content":"pub fn path_edits(name: &MapName, edits_name: &str) -> String {\n\n path(format!(\n\n \"player/edits/{}/{}/{}/{}.json\",\n\n name.city.country, name.city.city, name.map, edits_name\n\n ))\n\n}\n","file_path":"abstio/src/abst_paths.rs","rank":62,"score":222456.53110126755},{"content":"pub fn path_scenario(name: &MapName, scenario_name: &str) -> String {\n\n // TODO Getting complicated. Sometimes we're trying to load, so we should look for .bin, then\n\n // .json. But when we're writing a custom scenario, we actually want to write a .bin.\n\n let bin = path(format!(\n\n \"system/{}/{}/scenarios/{}/{}.bin\",\n\n name.city.country, name.city.city, name.map, scenario_name\n\n ));\n\n let json = path(format!(\n\n \"system/{}/{}/scenarios/{}/{}.json\",\n\n name.city.country, name.city.city, name.map, scenario_name\n\n ));\n\n if file_exists(&bin) {\n\n return bin;\n\n }\n\n if file_exists(&json) {\n\n return json;\n\n }\n\n bin\n\n}\n","file_path":"abstio/src/abst_paths.rs","rank":63,"score":222456.53110126755},{"content":"// TODO Need to filter out extraneous crosswalks. Why weren't they being created before?\n\npub fn _make_walking_turns_v2(map: &Map, i: &Intersection) -> Vec<Turn> {\n\n let driving_side = map.config.driving_side;\n\n let all_roads = map.all_roads();\n\n let all_lanes = map.all_lanes();\n\n\n\n // Consider all roads in counter-clockwise order. Every road has up to two sidewalks. Gather\n\n // those in order, remembering what roads don't have them.\n\n let mut lanes: Vec<Option<&Lane>> = Vec::new();\n\n let mut num_sidewalks = 0;\n\n for r in i.get_roads_sorted_by_incoming_angle(all_roads) {\n\n let r = &all_roads[r.0];\n\n let mut fwd = None;\n\n let mut back = None;\n\n for (l, dir, lt) in r.lanes_ltr() {\n\n if lt == LaneType::Sidewalk || lt == LaneType::Shoulder {\n\n if dir == Direction::Fwd {\n\n fwd = Some(&all_lanes[l.0]);\n\n } else {\n\n back = Some(&all_lanes[l.0]);\n\n }\n","file_path":"map_model/src/make/walking_turns.rs","rank":64,"score":221735.82011838458},{"content":"fn create_zones(map: &Map, input: HashMap<String, Polygon>) -> HashMap<String, Zone> {\n\n let all_borders = MapBorders::new(map);\n\n let mut zones = HashMap::new();\n\n for (name, polygon) in input {\n\n let mut overlapping_area = 0.0;\n\n for p in polygon.intersection(map.get_boundary_polygon()) {\n\n overlapping_area += p.area();\n\n }\n\n // Sometimes this is slightly over 100%, because funky things happen with the polygon\n\n // intersection.\n\n let pct_overlap = (overlapping_area / polygon.area()).min(1.0);\n\n\n\n // If the zone doesn't intersect our map at all, totally skip it.\n\n if pct_overlap == 0.0 {\n\n continue;\n\n }\n\n zones.insert(\n\n name,\n\n Zone {\n\n polygon,\n","file_path":"popdat/src/od.rs","rank":65,"score":220254.339903143},{"content":"fn four_way_two_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\n\n if roads.len() != 4 {\n\n return None;\n\n }\n\n\n\n // Just to refer to these easily, label with directions. Imagine an axis-aligned four-way.\n\n let (north, west, south, east) = (roads[0], roads[1], roads[2], roads[3]);\n\n\n\n // Two-stage with no protected lefts, right turn on red, turning cars yielding to peds\n\n let mut ts = new(i, map);\n\n make_stages(\n\n &mut ts,\n\n map.config.driving_side,\n\n vec![\n\n vec![\n\n (vec![north, south], TurnType::Straight, PROTECTED),\n\n (vec![north, south], TurnType::Right, YIELD),\n\n (vec![north, south], TurnType::Left, YIELD),\n\n (vec![east, west], TurnType::Right, YIELD),\n","file_path":"map_model/src/make/traffic_signals/mod.rs","rank":66,"score":220133.37014851085},{"content":"fn make_signal(map: &Map, id: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let mut ts = new(id, map);\n\n if let Some(other) = three_way_three_stage(map, id) {\n\n ts.stages = other.stages;\n\n } else if let Some(other) = four_way_four_stage(map, id) {\n\n ts.stages = other.stages;\n\n }\n\n ts.convert_to_ped_scramble_without_promotion();\n\n // We don't always get a valid traffic signal from the default 3-way and 4-way. When we don't\n\n // we need to try assembling stages with a more complex algorithm.\n\n if ts.validate().is_err() {\n\n if let Some(other) = multi_way_stages(map, id) {\n\n ts.stages = other.stages;\n\n ts.convert_to_ped_scramble_without_promotion();\n\n }\n\n }\n\n if let Err(err) = ts.validate() {\n\n // when all else fails, use stage per road and all-walk stage at the end\n\n debug!(\"multi-way validation_error={} ts={:#?}\", err, ts);\n\n ts = stage_per_road(map, id);\n\n ts.convert_to_ped_scramble();\n\n }\n\n return Some(ts);\n\n}\n\n\n","file_path":"map_model/src/make/traffic_signals/lagging_green.rs","rank":67,"score":220133.37014851085},{"content":"fn four_way_four_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\n\n if roads.len() != 4 {\n\n return None;\n\n }\n\n\n\n // Just to refer to these easily, label with directions. Imagine an axis-aligned four-way.\n\n let (north, west, south, east) = (roads[0], roads[1], roads[2], roads[3]);\n\n\n\n // Four-stage with protected lefts, right turn on red (except for the protected lefts),\n\n // turning cars yield to peds\n\n let mut ts = new(i, map);\n\n make_stages(\n\n &mut ts,\n\n map.config.driving_side,\n\n vec![\n\n vec![\n\n (vec![north, south], TurnType::Straight, PROTECTED),\n\n (vec![north, south], TurnType::Right, YIELD),\n\n (vec![east, west], TurnType::Right, YIELD),\n","file_path":"map_model/src/make/traffic_signals/mod.rs","rank":68,"score":220133.37014851085},{"content":"pub fn path_popdat() -> String {\n\n path(\"input/us/seattle/popdat.bin\")\n\n}\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":69,"score":219655.62713873136},{"content":"pub fn deserialize_nodemap<\n\n 'de,\n\n D: Deserializer<'de>,\n\n T: Deserialize<'de> + Copy + Ord + Debug + Serialize,\n\n>(\n\n d: D,\n\n) -> Result<NodeMap<T>, D::Error> {\n\n let inner = <InnerNodeMap<T>>::deserialize(d)?;\n\n let id_to_node = inner.id_to_node;\n\n let mut node_to_id = BTreeMap::new();\n\n for (id, node) in id_to_node.iter().enumerate() {\n\n node_to_id.insert(*node, id);\n\n }\n\n\n\n Ok(NodeMap {\n\n node_to_id,\n\n id_to_node,\n\n })\n\n}\n","file_path":"map_model/src/pathfind/node_map.rs","rank":70,"score":219018.90272094196},{"content":"pub fn path_prebaked_results(name: &MapName, scenario_name: &str) -> String {\n\n path(format!(\n\n \"system/{}/{}/prebaked_results/{}/{}.bin\",\n\n name.city.country, name.city.city, name.map, scenario_name\n\n ))\n\n}\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":71,"score":218685.64583849508},{"content":"/// Converts a RawMap to a Map.\n\npub fn raw_to_map(\n\n name: &MapName,\n\n build_ch: bool,\n\n keep_bldg_tags: bool,\n\n timer: &mut Timer,\n\n) -> map_model::Map {\n\n timer.start(format!(\"Raw->Map for {}\", name.describe()));\n\n let raw: map_model::raw::RawMap = abstio::read_binary(abstio::path_raw_map(name), timer);\n\n let map = map_model::Map::create_from_raw(raw, build_ch, keep_bldg_tags, timer);\n\n timer.start(\"save map\");\n\n map.save();\n\n timer.stop(\"save map\");\n\n timer.stop(format!(\"Raw->Map for {}\", name.describe()));\n\n\n\n // TODO Just sticking this here for now\n\n if name.map == \"huge_seattle\" || name == &MapName::new(\"gb\", \"leeds\", \"huge\") {\n\n timer.start(\"generating city manifest\");\n\n abstio::write_binary(\n\n abstio::path(format!(\n\n \"system/{}/{}/city.bin\",\n","file_path":"importer/src/utils.rs","rank":72,"score":218093.81259018416},{"content":"/// Build stages. First find roads that are straight across, they are either one-way or two-way.\n\n/// For one-way, add any right or left turns, thus completing the stage. For two-way, two\n\n/// stages will be added. The first stage has protected straight, and right and yield left.\n\n/// The second stage has protected left. Lastly, sometimes oncomming left turns can't both\n\n/// be protected, if this occurs the 2nd stage will have one direction protected and the\n\n/// other yeild and a 3rd, inverse, stage will be added which has the other direction's left\n\n/// protected and other yield. Finally, any turns which weren't assigned, because there\n\n/// are no straights or there are more than just pairs of straight intersections, are assigned a\n\n/// stage. These, too are handled as pairs until one remains, which is handled as a one-way.\n\nfn multi_way_stages(map: &Map, id: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let mut ts = new(id, map);\n\n let (mut right, mut left, straight, mut roads) = movements(&ts);\n\n let (one_way, two_way) = straight_types(&straight);\n\n for m in &one_way {\n\n let mut stage = Stage::new();\n\n stage.protected_movements.insert(m.clone());\n\n for t in turns(&m.from.id, &right) {\n\n stage.protected_movements.insert(t.clone());\n\n }\n\n for t in turns(&m.from.id, &left) {\n\n stage.protected_movements.insert(t.clone());\n\n }\n\n add_stage(&mut ts, stage);\n\n roads.remove(&m.from.id);\n\n }\n\n for (m1, m2) in &two_way {\n\n let mut stage1 = Stage::new();\n\n let mut stage2 = Stage::new();\n\n // Insert the straight movements, followed by the right and then the left.\n","file_path":"map_model/src/make/traffic_signals/lagging_green.rs","rank":73,"score":217933.71008068626},{"content":"fn four_way_four_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\n\n if roads.len() != 4 {\n\n return None;\n\n }\n\n\n\n // Just to refer to these easily, label with directions. Imagine an axis-aligned four-way.\n\n let (north, west, south, east) = (roads[0], roads[1], roads[2], roads[3]);\n\n\n\n // Four-stage with protected lefts, right turn on red (except for the protected lefts),\n\n // turning cars yield to peds\n\n let mut ts = new(i, map);\n\n make_stages(\n\n &mut ts,\n\n map.config.driving_side,\n\n vec![\n\n vec![\n\n (vec![north, south], TurnType::Straight, PROTECTED),\n\n (vec![north, south], TurnType::Left, YIELD),\n\n (vec![north, south], TurnType::Right, PROTECTED),\n","file_path":"map_model/src/make/traffic_signals/lagging_green.rs","rank":74,"score":217933.71008068626},{"content":"fn three_way_three_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\n\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\n\n if roads.len() != 3 {\n\n return None;\n\n }\n\n let mut ts = new(i, map);\n\n\n\n // Picture a T intersection. Use turn angles to figure out the \"main\" two roads.\n\n let straight = ts\n\n .movements\n\n .values()\n\n .find(|g| g.turn_type == TurnType::Straight)?;\n\n let (north, south) = (straight.id.from.id, straight.id.to.id);\n\n let east = roads\n\n .into_iter()\n\n .find(|r| *r != north && *r != south)\n\n .unwrap();\n\n\n\n // Three-stage with protected lefts, right turn on red\n\n make_stages(\n","file_path":"map_model/src/make/traffic_signals/lagging_green.rs","rank":75,"score":217933.71008068626},{"content":"// TODO This needs to update turn restrictions too\n\npub fn clip_map(map: &mut RawMap, timer: &mut Timer) {\n\n timer.start(\"clipping map to boundary\");\n\n\n\n // So we can use retain_btreemap without borrowing issues\n\n let boundary_polygon = map.boundary_polygon.clone();\n\n let boundary_ring = Ring::must_new(boundary_polygon.points().clone());\n\n\n\n // This is kind of indirect and slow, but first pass -- just remove roads that start or end\n\n // outside the boundary polygon.\n\n retain_btreemap(&mut map.roads, |_, r| {\n\n let first_in = boundary_polygon.contains_pt(r.center_points[0]);\n\n let last_in = boundary_polygon.contains_pt(*r.center_points.last().unwrap());\n\n let light_rail_ok = if r.is_light_rail() {\n\n // Make sure it's in the boundary somewhere\n\n r.center_points\n\n .iter()\n\n .any(|pt| boundary_polygon.contains_pt(*pt))\n\n } else {\n\n false\n\n };\n","file_path":"convert_osm/src/clip.rs","rank":76,"score":215460.2756555022},{"content":"/// Attempt to snap separately mapped cycleways to main roads. Emit extra KML files to debug later.\n\npub fn snap_cycleways(map: &RawMap, timer: &mut Timer) {\n\n // TODO The output here is nondeterministic and I haven't figured out why. Instead of spurious\n\n // data diffs, just totally disable this experiment for now. Will fix when this becomes active\n\n // work again.\n\n if true {\n\n return;\n\n }\n\n\n\n let mut cycleways = BTreeMap::new();\n\n for shape in\n\n abstio::read_binary::<ExtraShapes>(map.name.city.input_path(\"footways.bin\"), timer).shapes\n\n {\n\n // Just cycleways for now. This same general strategy should later work for sidewalks,\n\n // tramways, and blockface parking too.\n\n if shape.attributes.get(\"highway\") == Some(&\"cycleway\".to_string()) {\n\n cycleways.insert(\n\n WayID(shape.attributes[osm::OSM_WAY_ID].parse().unwrap()),\n\n shape,\n\n );\n\n }\n","file_path":"convert_osm/src/snappy.rs","rank":77,"score":215297.71524937204},{"content":"pub fn find_next_file(orig: String) -> Option<String> {\n\n let files = list_dir(parent_path(&orig));\n\n files.into_iter().find(|f| *f > orig)\n\n}\n\n\n","file_path":"abstio/src/io.rs","rank":78,"score":214256.2635925822},{"content":"/// Keeps file extensions\n\npub fn find_prev_file(orig: String) -> Option<String> {\n\n let mut files = list_dir(parent_path(&orig));\n\n files.reverse();\n\n files.into_iter().find(|f| *f < orig)\n\n}\n\n\n","file_path":"abstio/src/io.rs","rank":79,"score":214256.2635925822},{"content":"/// Returns full paths\n\npub fn list_dir(path: String) -> Vec<String> {\n\n let mut files: Vec<String> = Vec::new();\n\n match std::fs::read_dir(&path) {\n\n Ok(iter) => {\n\n for entry in iter {\n\n files.push(entry.unwrap().path().to_str().unwrap().to_string());\n\n }\n\n }\n\n Err(ref e) if e.kind() == std::io::ErrorKind::NotFound => {}\n\n Err(e) => panic!(\"Couldn't read_dir {:?}: {}\", path, e),\n\n };\n\n files.sort();\n\n files\n\n}\n\n\n","file_path":"abstio/src/io_native.rs","rank":80,"score":214231.17874223823},{"content":"fn add_extra_buildings(map: &mut RawMap, path: &str) -> Result<()> {\n\n // TODO Refactor code that just extracts polygons from geojson.\n\n let mut polygons = Vec::new();\n\n\n\n let bytes = abstio::slurp_file(path)?;\n\n let raw_string = std::str::from_utf8(&bytes)?;\n\n let geojson = raw_string.parse::<geojson::GeoJson>()?;\n\n\n\n if let geojson::GeoJson::FeatureCollection(collection) = geojson {\n\n for feature in collection.features {\n\n if let Some(geom) = feature.geometry {\n\n if let geojson::Value::Polygon(raw_pts) = geom.value {\n\n // TODO Handle holes, and also, refactor this!\n\n let gps_pts: Vec<LonLat> = raw_pts[0]\n\n .iter()\n\n .map(|pt| LonLat::new(pt[0], pt[1]))\n\n .collect();\n\n if let Some(pts) = map.gps_bounds.try_convert(&gps_pts) {\n\n if let Ok(ring) = Ring::new(pts) {\n\n polygons.push(ring.to_polygon());\n","file_path":"convert_osm/src/lib.rs","rank":81,"score":213643.00892982172},{"content":"pub fn delete_file<I: AsRef<str>>(path: I) {\n\n // TODO\n\n warn!(\"Not deleting {}\", path.as_ref());\n\n}\n","file_path":"abstio/src/io_web.rs","rank":82,"score":213025.84037511263},{"content":"/// Idempotent\n\npub fn delete_file<I: AsRef<str>>(path: I) {\n\n let path = path.as_ref();\n\n if std::fs::remove_file(path).is_ok() {\n\n println!(\"Deleted {}\", path);\n\n } else {\n\n println!(\"{} doesn't exist, so not deleting it\", path);\n\n }\n\n}\n\n\n\n// TODO I'd like to get rid of this and just use Timer.read_file, but external libraries consume\n\n// the reader. :\\\n\npub struct FileWithProgress {\n\n inner: BufReader<File>,\n\n\n\n path: String,\n\n processed_bytes: usize,\n\n total_bytes: usize,\n\n started_at: Instant,\n\n last_printed_at: Instant,\n\n}\n","file_path":"abstio/src/io_native.rs","rank":83,"score":213025.84037511263},{"content":"pub fn basename<I: AsRef<str>>(path: I) -> String {\n\n std::path::Path::new(path.as_ref())\n\n .file_stem()\n\n .unwrap()\n\n .to_os_string()\n\n .into_string()\n\n .unwrap()\n\n}\n\n\n","file_path":"abstutil/src/utils.rs","rank":84,"score":212522.01555464056},{"content":"pub fn prettyprint_usize(x: usize) -> String {\n\n let num = format!(\"{}\", x);\n\n let mut result = String::new();\n\n let mut i = num.len();\n\n for c in num.chars() {\n\n result.push(c);\n\n i -= 1;\n\n if i > 0 && i % 3 == 0 {\n\n result.push(',');\n\n }\n\n }\n\n result\n\n}\n\n\n","file_path":"abstutil/src/utils.rs","rank":85,"score":211445.03094337016},{"content":"/// Starting from some number of total people living in a polygonal area, randomly distribute them\n\n/// to residential buildings within that area. Returns a list of homes with the number of residents\n\n/// in each.\n\npub fn distribute_population_to_homes(\n\n polygon: geo::Polygon<f64>,\n\n population: usize,\n\n map: &Map,\n\n rng: &mut XorShiftRng,\n\n) -> Vec<(BuildingID, usize)> {\n\n let map_boundary = geo::Polygon::from(map.get_boundary_polygon().clone());\n\n let bldgs: Vec<map_model::BuildingID> = map\n\n .all_buildings()\n\n .into_iter()\n\n .filter(|b| {\n\n polygon.contains(&geo::Point::from(b.label_center)) && b.bldg_type.has_residents()\n\n })\n\n .map(|b| b.id)\n\n .collect();\n\n\n\n // If the area is partly out-of-bounds, then scale down the number of residents linearly\n\n // based on area of the overlapping part of the polygon.\n\n use geo_booleanop::boolean::BooleanOp;\n\n let pct_overlap = polygon.intersection(&map_boundary).unsigned_area() / polygon.unsigned_area();\n","file_path":"popdat/src/distribute_people.rs","rank":86,"score":211011.60771349963},{"content":"// Could be caused by closing intersections\n\npub fn check_sidewalk_connectivity(\n\n ctx: &mut EventCtx,\n\n app: &mut App,\n\n cmd: EditCmd,\n\n) -> Option<Box<dyn State<App>>> {\n\n let orig_edits = app.primary.map.get_edits().clone();\n\n let (_, disconnected_before) =\n\n connectivity::find_scc(&app.primary.map, PathConstraints::Pedestrian);\n\n\n\n let mut edits = orig_edits.clone();\n\n edits.commands.push(cmd);\n\n app.primary.map.try_apply_edits(edits);\n\n\n\n let (_, disconnected_after) =\n\n connectivity::find_scc(&app.primary.map, PathConstraints::Pedestrian);\n\n app.primary.map.must_apply_edits(orig_edits);\n\n\n\n let newly_disconnected = disconnected_after\n\n .difference(&disconnected_before)\n\n .collect::<Vec<_>>();\n","file_path":"game/src/edit/validate.rs","rank":87,"score":210996.58927791816},{"content":"/// Finalize importing of buildings, mostly by matching them to the nearest sidewalk.\n\npub fn make_all_buildings(\n\n input: &BTreeMap<osm::OsmID, RawBuilding>,\n\n map: &Map,\n\n keep_bldg_tags: bool,\n\n timer: &mut Timer,\n\n) -> Vec<Building> {\n\n timer.start(\"convert buildings\");\n\n let mut center_per_bldg: BTreeMap<osm::OsmID, HashablePt2D> = BTreeMap::new();\n\n let mut query: HashSet<HashablePt2D> = HashSet::new();\n\n timer.start_iter(\"get building center points\", input.len());\n\n for (id, b) in input {\n\n timer.next();\n\n let center = b.polygon.center().to_hashable();\n\n center_per_bldg.insert(*id, center);\n\n query.insert(center);\n\n }\n\n\n\n // equiv_pos could be a little closer, so use two buffers\n\n let sidewalk_buffer = Distance::meters(7.5);\n\n let sidewalk_pts = match_points_to_lanes(\n","file_path":"map_model/src/make/buildings.rs","rank":88,"score":209431.89156064924},{"content":"/// This returns the pathfinding cost of crossing one road and turn. This is also expressed in\n\n/// units of time. It factors in the ideal time to cross the space, along with penalties for\n\n/// entering an access-restricted zone, taking an unprotected turn, and so on.\n\npub fn vehicle_cost(\n\n dr: DirectedRoadID,\n\n mvmnt: MovementID,\n\n constraints: PathConstraints,\n\n params: &RoutingParams,\n\n map: &Map,\n\n) -> Duration {\n\n // TODO Creating the consolidated polyline sometimes fails. It's rare, so just workaround\n\n // temporarily by pretending the turn is 1m long.\n\n let (mvmnt_length, mvmnt_turn_type) = mvmnt\n\n .get(map)\n\n .map(|m| (m.geom.length(), m.turn_type))\n\n .unwrap_or((Distance::meters(1.0), TurnType::Straight));\n\n let max_speed = match constraints {\n\n PathConstraints::Car | PathConstraints::Bus | PathConstraints::Train => None,\n\n PathConstraints::Bike => Some(crate::MAX_BIKE_SPEED),\n\n PathConstraints::Pedestrian => unreachable!(),\n\n };\n\n let t1 = map.get_r(dr.id).center_pts.length()\n\n / Traversable::max_speed_along_road(dr, max_speed, constraints, map);\n","file_path":"map_model/src/pathfind/vehicles.rs","rank":89,"score":209425.93572295824},{"content":"// Returns a legend\n\npub fn make_heatmap(\n\n ctx: &mut EventCtx,\n\n batch: &mut GeomBatch,\n\n bounds: &Bounds,\n\n pts: Vec<Pt2D>,\n\n opts: &HeatmapOptions,\n\n) -> Widget {\n\n // 7 colors, 8 labels\n\n let num_colors = 7;\n\n let gradient = match opts.color_scheme.as_ref() {\n\n \"Turbo\" => colorous::TURBO,\n\n \"Inferno\" => colorous::INFERNO,\n\n \"Warm\" => colorous::WARM,\n\n \"Cool\" => colorous::COOL,\n\n \"Oranges\" => colorous::ORANGES,\n\n \"Spectral\" => colorous::SPECTRAL,\n\n _ => unreachable!(),\n\n };\n\n let colors: Vec<Color> = (0..num_colors)\n\n .map(|i| {\n","file_path":"map_gui/src/tools/heatmap.rs","rank":90,"score":209425.93572295824},{"content":"/// Describe all public transit routes and keep under version control to spot diffs easily.\n\nfn dump_route_goldenfile(map: &map_model::Map) -> Result<()> {\n\n let path = abstio::path(format!(\n\n \"route_goldenfiles/{}.txt\",\n\n map.get_name().as_filename()\n\n ));\n\n let mut f = File::create(path)?;\n\n for br in map.all_bus_routes() {\n\n writeln!(\n\n f,\n\n \"{} from {} to {:?}\",\n\n br.osm_rel_id, br.start, br.end_border\n\n )?;\n\n for bs in &br.stops {\n\n let bs = map.get_bs(*bs);\n\n writeln!(\n\n f,\n\n \" {}: {} driving, {} sidewalk\",\n\n bs.name, bs.driving_pos, bs.sidewalk_pos\n\n )?;\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"tests/src/main.rs","rank":91,"score":209307.28641081753},{"content":"fn validate_restrictions(map: &Map, steps: &Vec<PathStep>) {\n\n for triple in steps.windows(5) {\n\n if let (PathStep::Lane(l1), PathStep::Lane(l2), PathStep::Lane(l3)) =\n\n (triple[0], triple[2], triple[4])\n\n {\n\n let from = map.get_parent(l1);\n\n let via = map.get_l(l2).parent;\n\n let to = map.get_l(l3).parent;\n\n\n\n for (dont_via, dont_to) in &from.complicated_turn_restrictions {\n\n if via == *dont_via && to == *dont_to {\n\n panic!(\n\n \"Some path does illegal uber-turn: {} -> {} -> {}\",\n\n l1, l2, l3\n\n );\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"map_model/src/pathfind/v1.rs","rank":92,"score":208646.8602802612},{"content":"fn validate_continuity(map: &Map, steps: &Vec<PathStep>) {\n\n if steps.is_empty() {\n\n panic!(\"Empty path\");\n\n }\n\n for pair in steps.windows(2) {\n\n let from = match pair[0] {\n\n PathStep::Lane(id) => map.get_l(id).last_pt(),\n\n PathStep::ContraflowLane(id) => map.get_l(id).first_pt(),\n\n PathStep::Turn(id) => map.get_t(id).geom.last_pt(),\n\n };\n\n let to = match pair[1] {\n\n PathStep::Lane(id) => map.get_l(id).first_pt(),\n\n PathStep::ContraflowLane(id) => map.get_l(id).last_pt(),\n\n PathStep::Turn(id) => map.get_t(id).geom.first_pt(),\n\n };\n\n let len = from.dist_to(to);\n\n if len > EPSILON_DIST {\n\n println!(\"All steps in invalid path:\");\n\n for s in steps {\n\n match s {\n","file_path":"map_model/src/pathfind/v1.rs","rank":93,"score":208646.8602802612},{"content":"fn make_bike_lane_scenario(map: &Map) -> ScenarioGenerator {\n\n let mut s = ScenarioGenerator::empty(\"car vs bike contention\");\n\n s.border_spawn_over_time.push(BorderSpawnOverTime {\n\n num_peds: 0,\n\n num_cars: 10,\n\n num_bikes: 10,\n\n percent_use_transit: 0.0,\n\n start_time: Time::START_OF_DAY,\n\n stop_time: Time::START_OF_DAY + Duration::seconds(10.0),\n\n start_from_border: map.find_i_by_osm_id(osm::NodeID(3005680098)).unwrap(),\n\n goal: Some(TripEndpoint::Bldg(\n\n map.find_b_by_osm_id(bldg(217699501)).unwrap(),\n\n )),\n\n });\n\n s\n\n}\n\n\n","file_path":"game/src/sandbox/gameplay/tutorial.rs","rank":94,"score":208502.51720099265},{"content":"/// Some roads might be totally disconnected from the largest clump because of how the map's\n\n/// bounding polygon was drawn, or bad map data, or which roads are filtered from OSM. Remove them.\n\npub fn remove_disconnected_roads(map: &mut RawMap, timer: &mut Timer) {\n\n timer.start(\"removing disconnected roads\");\n\n // This is a simple floodfill, not Tarjan's. Assumes all roads bidirectional.\n\n // All the usizes are indices into the original list of roads\n\n\n\n let mut next_roads: MultiMap<osm::NodeID, OriginalRoad> = MultiMap::new();\n\n for id in map.roads.keys() {\n\n next_roads.insert(id.i1, *id);\n\n next_roads.insert(id.i2, *id);\n\n }\n\n\n\n let mut partitions: Vec<Vec<OriginalRoad>> = Vec::new();\n\n let mut unvisited_roads: BTreeSet<OriginalRoad> = map\n\n .roads\n\n .iter()\n\n .filter_map(|(id, r)| if r.is_light_rail() { None } else { Some(*id) })\n\n .collect();\n\n\n\n while !unvisited_roads.is_empty() {\n\n let mut queue_roads: Vec<OriginalRoad> = vec![*unvisited_roads.iter().next().unwrap()];\n","file_path":"map_model/src/make/remove_disconnected.rs","rank":95,"score":207724.1699086582},{"content":"/// Merge tiny \"roads\" that're actually just part of a complicated intersection. Returns all\n\n/// surviving intersections adjacent to one of these merged roads.\n\npub fn merge_short_roads(map: &mut RawMap) -> BTreeSet<NodeID> {\n\n let mut merged = BTreeSet::new();\n\n\n\n let mut queue: VecDeque<OriginalRoad> = VecDeque::new();\n\n for r in map.roads.keys() {\n\n queue.push_back(*r);\n\n\n\n // TODO Remove after improving this heuristic.\n\n if false && connects_dual_carriageway(map, r) {\n\n debug!(\"{} connects dual carriageways\", r);\n\n }\n\n }\n\n\n\n while !queue.is_empty() {\n\n let id = queue.pop_front().unwrap();\n\n\n\n // The road might've been deleted\n\n if !map.roads.contains_key(&id) {\n\n continue;\n\n }\n","file_path":"map_model/src/make/merge_intersections.rs","rank":96,"score":207310.23754765777},{"content":"pub fn path_all_saves(name: &MapName, edits_name: &str, run_name: &str) -> String {\n\n path(format!(\n\n \"player/saves/{}/{}/{}/{}_{}\",\n\n name.city.country, name.city.city, name.map, edits_name, run_name\n\n ))\n\n}\n\n\n\n// Input data (For developers to build maps, not needed at runtime)\n\n\n","file_path":"abstio/src/abst_paths.rs","rank":97,"score":206406.1063114886},{"content":"pub fn pathfind_avoiding_roads(\n\n req: PathRequest,\n\n avoid: BTreeSet<RoadID>,\n\n map: &Map,\n\n) -> Option<(Path, Duration)> {\n\n assert_eq!(req.constraints, PathConstraints::Car);\n\n let mut graph = DiGraphMap::new();\n\n for dr in map.all_directed_roads_for(req.constraints) {\n\n if avoid.contains(&dr.id) {\n\n continue;\n\n }\n\n for mvmnt in map.get_movements_for(dr, req.constraints) {\n\n graph.add_edge(mvmnt.from, mvmnt.to, mvmnt);\n\n }\n\n }\n\n\n\n calc_path(graph, req, map.routing_params(), map)\n\n}\n\n\n","file_path":"map_model/src/pathfind/dijkstra.rs","rank":98,"score":205473.2276849893},{"content":"pub fn build_graph_for_vehicles(\n\n map: &Map,\n\n constraints: PathConstraints,\n\n) -> DiGraphMap<DirectedRoadID, MovementID> {\n\n let mut graph = DiGraphMap::new();\n\n for dr in map.all_directed_roads_for(constraints) {\n\n for mvmnt in map.get_movements_for(dr, constraints) {\n\n graph.add_edge(mvmnt.from, mvmnt.to, mvmnt);\n\n }\n\n }\n\n graph\n\n}\n\n\n","file_path":"map_model/src/pathfind/dijkstra.rs","rank":99,"score":205473.2276849893}],"string":"[\n {\n \"content\": \"pub fn pathfind(req: PathRequest, params: &RoutingParams, map: &Map) -> Option<(Path, Duration)> {\\n\\n if req.constraints == PathConstraints::Pedestrian {\\n\\n pathfind_walking(req, map)\\n\\n } else {\\n\\n let graph = build_graph_for_vehicles(map, req.constraints);\\n\\n calc_path(graph, req, params, map)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/pathfind/dijkstra.rs\",\n \"rank\": 0,\n \"score\": 400765.943363308\n },\n {\n \"content\": \"fn pathfind_walking(req: PathRequest, map: &Map) -> Option<(Path, Duration)> {\\n\\n if req.start.lane() == req.end.lane() {\\n\\n return Some(one_step_walking_path(req, map));\\n\\n }\\n\\n\\n\\n let graph = build_graph_for_pedestrians(map);\\n\\n\\n\\n let closest_start = WalkingNode::closest(req.start, map);\\n\\n let closest_end = WalkingNode::closest(req.end, map);\\n\\n let (cost, nodes) = petgraph::algo::astar(\\n\\n &graph,\\n\\n closest_start,\\n\\n |end| end == closest_end,\\n\\n |(_, _, cost)| *cost,\\n\\n |_| Duration::ZERO,\\n\\n )?;\\n\\n let steps = walking_path_to_steps(nodes, map);\\n\\n Some((Path::new(map, steps, req, Vec::new()), cost))\\n\\n}\\n\",\n \"file_path\": \"map_model/src/pathfind/dijkstra.rs\",\n \"rank\": 1,\n \"score\": 372943.4484057581\n },\n {\n \"content\": \"// TODO Do we even need this at all?\\n\\npub fn one_step_walking_path(req: PathRequest, map: &Map) -> (Path, Duration) {\\n\\n // Weird case, but it can happen for walking from a building path to a bus stop that're\\n\\n // actually at the same spot.\\n\\n let steps = if req.start.dist_along() == req.end.dist_along() {\\n\\n vec![PathStep::Lane(req.start.lane())]\\n\\n } else if req.start.dist_along() < req.end.dist_along() {\\n\\n vec![PathStep::Lane(req.start.lane())]\\n\\n } else {\\n\\n vec![PathStep::ContraflowLane(req.start.lane())]\\n\\n };\\n\\n let mut cost = (req.start.dist_along() - req.end.dist_along()).abs()\\n\\n / Traversable::Lane(req.start.lane()).max_speed_along(\\n\\n Some(crate::MAX_WALKING_SPEED),\\n\\n PathConstraints::Pedestrian,\\n\\n map,\\n\\n );\\n\\n if map.get_l(req.start.lane()).is_shoulder() {\\n\\n cost = 2.0 * cost;\\n\\n }\\n\\n (Path::new(map, steps, req, Vec::new()), cost)\\n\\n}\\n\",\n \"file_path\": \"map_model/src/pathfind/walking.rs\",\n \"rank\": 2,\n \"score\": 371019.7673763352\n },\n {\n \"content\": \"/// Fill in empty space between one-way roads.\\n\\npub fn find_medians(map: &Map) -> Vec<Polygon> {\\n\\n // TODO Needs more work\\n\\n if true {\\n\\n return Vec::new();\\n\\n }\\n\\n\\n\\n let mut candidates = Vec::new();\\n\\n for r in map.all_roads() {\\n\\n if r.osm_tags.is(\\\"dual_carriageway\\\", \\\"yes\\\") {\\n\\n // TODO Always to the left? Maybe driving side matters; test in southbank too\\n\\n let lanes_ltr = r.lanes_ltr();\\n\\n candidates.push(lanes_ltr[0].0);\\n\\n }\\n\\n }\\n\\n\\n\\n let mut visited = BTreeSet::new();\\n\\n let mut polygons = Vec::new();\\n\\n for start in candidates {\\n\\n if visited.contains(&start) {\\n\\n continue;\\n\\n }\\n\\n if let Some((poly, lanes)) = map.get_l(start).trace_around_block(map) {\\n\\n polygons.push(poly);\\n\\n visited.extend(lanes);\\n\\n }\\n\\n }\\n\\n\\n\\n polygons\\n\\n}\\n\",\n \"file_path\": \"map_model/src/make/medians.rs\",\n \"rank\": 3,\n \"score\": 314307.5938521245\n },\n {\n \"content\": \"/// Calculate the strongly connected components (SCC) of the part of the map accessible by\\n\\n/// constraints (ie, the graph of sidewalks or driving+bike lanes). The largest component is the\\n\\n/// \\\"main\\\" graph; the rest is disconnected. Returns (lanes in the largest \\\"main\\\" component, all\\n\\n/// other disconnected lanes)\\n\\npub fn find_scc(map: &Map, constraints: PathConstraints) -> (HashSet<LaneID>, HashSet<LaneID>) {\\n\\n let mut graph = DiGraphMap::new();\\n\\n for turn in map.all_turns().values() {\\n\\n if constraints.can_use(map.get_l(turn.id.src), map)\\n\\n && constraints.can_use(map.get_l(turn.id.dst), map)\\n\\n {\\n\\n graph.add_edge(turn.id.src, turn.id.dst, 1);\\n\\n }\\n\\n }\\n\\n let components = petgraph::algo::kosaraju_scc(&graph);\\n\\n if components.is_empty() {\\n\\n return (HashSet::new(), HashSet::new());\\n\\n }\\n\\n let largest_group: HashSet<LaneID> = components\\n\\n .into_iter()\\n\\n .max_by_key(|c| c.len())\\n\\n .unwrap()\\n\\n .into_iter()\\n\\n .collect();\\n\\n let disconnected = map\\n\",\n \"file_path\": \"map_model/src/connectivity/mod.rs\",\n \"rank\": 4,\n \"score\": 306670.85593047534\n },\n {\n \"content\": \"// TODO Temporarily public for debugging.\\n\\npub fn calculate_corners(i: &Intersection, map: &Map) -> Vec<Polygon> {\\n\\n if i.is_footway(map) {\\n\\n return Vec::new();\\n\\n }\\n\\n\\n\\n let mut corners = Vec::new();\\n\\n\\n\\n for turn in map.get_turns_in_intersection(i.id) {\\n\\n if turn.turn_type == TurnType::SharedSidewalkCorner {\\n\\n // Avoid double-rendering\\n\\n if map.get_l(turn.id.src).dst_i != i.id {\\n\\n continue;\\n\\n }\\n\\n let l1 = map.get_l(turn.id.src);\\n\\n let l2 = map.get_l(turn.id.dst);\\n\\n\\n\\n // Special case for dead-ends: just thicken the geometry.\\n\\n if i.roads.len() == 1 {\\n\\n corners.push(turn.geom.make_polygons(l1.width.min(l2.width)));\\n\\n continue;\\n\",\n \"file_path\": \"map_gui/src/render/intersection.rs\",\n \"rank\": 5,\n \"score\": 298167.0278163951\n },\n {\n \"content\": \"pub fn walking_path_to_steps(path: Vec<WalkingNode>, map: &Map) -> Vec<PathStep> {\\n\\n let mut steps: Vec<PathStep> = Vec::new();\\n\\n\\n\\n for pair in path.windows(2) {\\n\\n let (r1, l1_endpt) = match pair[0] {\\n\\n WalkingNode::SidewalkEndpoint(r, endpt) => (r, endpt),\\n\\n WalkingNode::RideBus(_) => unreachable!(),\\n\\n WalkingNode::LeaveMap(_) => unreachable!(),\\n\\n };\\n\\n let r2 = match pair[1] {\\n\\n WalkingNode::SidewalkEndpoint(r, _) => r,\\n\\n WalkingNode::RideBus(_) => unreachable!(),\\n\\n WalkingNode::LeaveMap(_) => unreachable!(),\\n\\n };\\n\\n\\n\\n let l1 = r1.must_get_sidewalk(map);\\n\\n let l2 = r2.must_get_sidewalk(map);\\n\\n\\n\\n if l1 == l2 {\\n\\n if l1_endpt {\\n\",\n \"file_path\": \"map_model/src/pathfind/walking.rs\",\n \"rank\": 6,\n \"score\": 297974.0853288801\n },\n {\n \"content\": \"/// Heavily penalize crossing into an access-restricted zone that doesn't allow this mode.\\n\\npub fn zone_cost(mvmnt: MovementID, constraints: PathConstraints, map: &Map) -> Duration {\\n\\n // Detect when we cross into a new zone that doesn't allow constraints.\\n\\n if map\\n\\n .get_r(mvmnt.from.id)\\n\\n .access_restrictions\\n\\n .allow_through_traffic\\n\\n .contains(constraints)\\n\\n && !map\\n\\n .get_r(mvmnt.to.id)\\n\\n .access_restrictions\\n\\n .allow_through_traffic\\n\\n .contains(constraints)\\n\\n {\\n\\n // This should be high enough to achieve the desired effect of somebody not entering\\n\\n // the zone unless absolutely necessary. Someone would violate that and cut through anyway\\n\\n // only when the alternative route would take more than 3 hours longer!\\n\\n Duration::hours(3)\\n\\n } else {\\n\\n Duration::ZERO\\n\\n }\\n\",\n \"file_path\": \"map_model/src/pathfind/mod.rs\",\n \"rank\": 7,\n \"score\": 287987.4559570607\n },\n {\n \"content\": \"pub fn round(cost: Duration) -> usize {\\n\\n // Round up! 0 cost edges are ignored\\n\\n (cost.inner_seconds().round() as usize).max(1)\\n\\n}\\n\",\n \"file_path\": \"map_model/src/pathfind/ch.rs\",\n \"rank\": 8,\n \"score\": 275394.8920086846\n },\n {\n \"content\": \"/// Create a traffic signal which has a stage that is: protected straight, protected right,\\n\\n/// unprotected left, unprotected right on red. Followed by a variable stage that has protected\\n\\n/// left, unprotected right on red. With a last stage that is all-walk and variable.\\n\\n/// In some degenerate cases, usually with one or more one-way, this can reduce to stage per road.\\n\\n/// In some rare cases, usually with an alleyway, oncoming lanes can't both be protected left turns.\\n\\n/// In such cases the stage is split into two stages with each having a protected and yeild turn.\\n\\npub fn make_traffic_signal(map: &Map, id: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n // Try to create the stages, this returns a unoptimized signal, which is then optimized.\\n\\n if let Some(ts) = make_signal(map, id) {\\n\\n return optimize(ts);\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/lagging_green.rs\",\n \"rank\": 9,\n \"score\": 271667.4035031707\n },\n {\n \"content\": \"pub fn apply_parking(map: &mut RawMap, opts: &Options, timer: &mut Timer) {\\n\\n match opts.onstreet_parking {\\n\\n OnstreetParking::JustOSM => {}\\n\\n OnstreetParking::Blockface(ref path) => {\\n\\n use_parking_hints(map, path.clone(), timer);\\n\\n }\\n\\n OnstreetParking::SomeAdditionalWhereNoData { pct } => {\\n\\n let pct = pct as i64;\\n\\n for (id, r) in map.roads.iter_mut() {\\n\\n // The 20m minimum is a rough heuristic.\\n\\n if r.osm_tags.contains_key(osm::INFERRED_PARKING)\\n\\n && r.osm_tags\\n\\n .is_any(osm::HIGHWAY, vec![\\\"residential\\\", \\\"tertiary\\\"])\\n\\n && !r.osm_tags.is(\\\"foot\\\", \\\"no\\\")\\n\\n && id.osm_way_id.0 % 100 <= pct\\n\\n && PolyLine::unchecked_new(r.center_points.clone()).length()\\n\\n >= Distance::meters(20.0)\\n\\n {\\n\\n if r.osm_tags.is(\\\"oneway\\\", \\\"yes\\\") {\\n\\n r.osm_tags.remove(osm::PARKING_BOTH);\\n\",\n \"file_path\": \"convert_osm/src/parking.rs\",\n \"rank\": 10,\n \"score\": 269661.3271609946\n },\n {\n \"content\": \"/// Extract the map and scenario name from a path. Crashes if the input is strange.\\n\\npub fn parse_scenario_path(path: &str) -> (MapName, String) {\\n\\n // TODO regex\\n\\n let parts = path.split(\\\"/\\\").collect::<Vec<_>>();\\n\\n let country = parts[parts.len() - 5];\\n\\n let city = parts[parts.len() - 4];\\n\\n let map = parts[parts.len() - 2];\\n\\n let scenario = basename(parts[parts.len() - 1]);\\n\\n let map_name = MapName::new(country, city, map);\\n\\n (map_name, scenario)\\n\\n}\\n\\n\\n\\n// Player data (Players edit this)\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 11,\n \"score\": 268395.3108036621\n },\n {\n \"content\": \"// Adjust the path to start on the building's border, not center\\n\\nfn trim_path(poly: &Polygon, path: Line) -> Line {\\n\\n for bldg_line in poly.points().windows(2) {\\n\\n if let Some(l1) = Line::new(bldg_line[0], bldg_line[1]) {\\n\\n if let Some(hit) = l1.intersection(&path) {\\n\\n if let Some(l2) = Line::new(hit, path.pt2()) {\\n\\n return l2;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n // Just give up\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/buildings.rs\",\n \"rank\": 12,\n \"score\": 266515.22076968837\n },\n {\n \"content\": \"pub fn build_graph_for_pedestrians(map: &Map) -> DiGraphMap<WalkingNode, Duration> {\\n\\n let max_speed = Some(crate::MAX_WALKING_SPEED);\\n\\n let mut graph: DiGraphMap<WalkingNode, Duration> = DiGraphMap::new();\\n\\n for l in map.all_lanes() {\\n\\n if l.is_walkable() {\\n\\n let cost = l.length()\\n\\n / Traversable::Lane(l.id).max_speed_along(\\n\\n max_speed,\\n\\n PathConstraints::Pedestrian,\\n\\n map,\\n\\n );\\n\\n let n1 = WalkingNode::SidewalkEndpoint(l.get_directed_parent(), true);\\n\\n let n2 = WalkingNode::SidewalkEndpoint(l.get_directed_parent(), false);\\n\\n graph.add_edge(n1, n2, cost);\\n\\n graph.add_edge(n2, n1, cost);\\n\\n\\n\\n for turn in map.get_turns_for(l.id, PathConstraints::Pedestrian) {\\n\\n graph.add_edge(\\n\\n WalkingNode::SidewalkEndpoint(\\n\\n l.get_directed_parent(),\\n\",\n \"file_path\": \"map_model/src/pathfind/dijkstra.rs\",\n \"rank\": 13,\n \"score\": 264618.32638200244\n },\n {\n \"content\": \"fn sidewalk_to_bike(sidewalk_pos: Position, map: &Map) -> Option<(Position, Position)> {\\n\\n let lane = map.get_parent(sidewalk_pos.lane()).find_closest_lane(\\n\\n sidewalk_pos.lane(),\\n\\n |l| !l.biking_blackhole && PathConstraints::Bike.can_use(l, map),\\n\\n map,\\n\\n )?;\\n\\n // No buffer needed\\n\\n Some((sidewalk_pos.equiv_pos(lane, map), sidewalk_pos))\\n\\n}\\n\\n\\n\\n/// Businesses are categorized into one of these types.\\n\\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]\\n\\npub enum AmenityType {\\n\\n Groceries,\\n\\n Food,\\n\\n Bar,\\n\\n Medical,\\n\\n Religious,\\n\\n Education,\\n\\n Financial,\\n\",\n \"file_path\": \"map_model/src/objects/building.rs\",\n \"rank\": 14,\n \"score\": 263706.4068986103\n },\n {\n \"content\": \"// Adjust the path to start on the building's border, not center\\n\\nfn trim_path(poly: &Polygon, path: Line) -> Line {\\n\\n for bldg_line in poly.points().windows(2) {\\n\\n if let Some(l1) = Line::new(bldg_line[0], bldg_line[1]) {\\n\\n if let Some(hit) = l1.intersection(&path) {\\n\\n if let Some(l2) = Line::new(hit, path.pt2()) {\\n\\n return l2;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n // Just give up\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/parking_lots.rs\",\n \"rank\": 15,\n \"score\": 262363.77172604925\n },\n {\n \"content\": \"pub fn extract_osm(map: &mut RawMap, opts: &Options, timer: &mut Timer) -> OsmExtract {\\n\\n let mut doc = crate::reader::read(&opts.osm_input, &map.gps_bounds, timer).unwrap();\\n\\n\\n\\n // Use this to quickly test overrides to some ways before upstreaming in OSM.\\n\\n if false {\\n\\n let ways: BTreeSet<WayID> = abstio::read_json(\\\"osm_ways.json\\\".to_string(), timer);\\n\\n for id in ways {\\n\\n doc.ways\\n\\n .get_mut(&id)\\n\\n .unwrap()\\n\\n .tags\\n\\n .insert(\\\"junction\\\", \\\"intersection\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n // TODO Hacks to override OSM data. There's no problem upstream, but we want to accomplish\\n\\n // various things for A/B Street.\\n\\n if let Some(way) = doc.ways.get_mut(&WayID(881403608)) {\\n\\n // https://www.openstreetmap.org/way/881403608 is a roundabout that keeps causing gridlock\\n\\n way.tags.insert(\\\"highway\\\", \\\"construction\\\");\\n\",\n \"file_path\": \"convert_osm/src/extract.rs\",\n \"rank\": 16,\n \"score\": 258026.52754004212\n },\n {\n \"content\": \"fn prebake(map: &Map, scenario: Scenario, opts: Option<SimOptions>, timer: &mut Timer) {\\n\\n timer.start(format!(\\n\\n \\\"prebake for {} / {}\\\",\\n\\n scenario.map_name.describe(),\\n\\n scenario.scenario_name\\n\\n ));\\n\\n\\n\\n let opts = opts.unwrap_or_else(|| {\\n\\n let mut opts = SimOptions::new(\\\"prebaked\\\");\\n\\n opts.alerts = AlertHandler::Silence;\\n\\n opts\\n\\n });\\n\\n let mut sim = Sim::new(&map, opts);\\n\\n // Bit of an abuse of this, but just need to fix the rng seed.\\n\\n let mut rng = SimFlags::for_test(\\\"prebaked\\\").make_rng();\\n\\n scenario.instantiate(&mut sim, &map, &mut rng, timer);\\n\\n sim.timed_step(\\n\\n &map,\\n\\n sim.get_end_of_day() - Time::START_OF_DAY,\\n\\n &mut None,\\n\",\n \"file_path\": \"game/src/challenges/prebake.rs\",\n \"rank\": 17,\n \"score\": 256469.8645143385\n },\n {\n \"content\": \"/// Starting from one building, calculate the cost to all others. If a destination isn't reachable,\\n\\n/// it won't be included in the results. Ignore results greater than the time_limit away.\\n\\n///\\n\\n/// If the start building is on the shoulder of a road and `!opts.allow_shoulders`, then the\\n\\n/// results will always be empty.\\n\\npub fn all_walking_costs_from(\\n\\n map: &Map,\\n\\n start: BuildingID,\\n\\n time_limit: Duration,\\n\\n opts: WalkingOptions,\\n\\n) -> HashMap<BuildingID, Duration> {\\n\\n let start_lane = map.get_l(map.get_b(start).sidewalk_pos.lane());\\n\\n if start_lane.lane_type == LaneType::Shoulder && !opts.allow_shoulders {\\n\\n return HashMap::new();\\n\\n }\\n\\n\\n\\n let mut queue: BinaryHeap<Item> = BinaryHeap::new();\\n\\n queue.push(Item {\\n\\n cost: Duration::ZERO,\\n\\n node: WalkingNode::closest(map.get_b(start).sidewalk_pos, map),\\n\\n });\\n\\n\\n\\n let mut cost_per_node: HashMap<WalkingNode, Duration> = HashMap::new();\\n\\n while let Some(current) = queue.pop() {\\n\\n if cost_per_node.contains_key(¤t.node) {\\n\",\n \"file_path\": \"map_model/src/connectivity/walking.rs\",\n \"rank\": 18,\n \"score\": 255566.3236784251\n },\n {\n \"content\": \"/// Starting from one building, calculate the cost to all others. If a destination isn't reachable,\\n\\n/// it won't be included in the results. Ignore results greater than the time_limit away.\\n\\npub fn all_vehicle_costs_from(\\n\\n map: &Map,\\n\\n start: BuildingID,\\n\\n time_limit: Duration,\\n\\n constraints: PathConstraints,\\n\\n) -> HashMap<BuildingID, Duration> {\\n\\n assert!(constraints != PathConstraints::Pedestrian);\\n\\n let mut results = HashMap::new();\\n\\n\\n\\n // TODO We have a graph of DirectedRoadIDs, but mapping a building to one isn't\\n\\n // straightforward. In the common case it'll be fine, but some buildings are isolated from the\\n\\n // graph by some sidewalks.\\n\\n let mut bldg_to_road = HashMap::new();\\n\\n for b in map.all_buildings() {\\n\\n if constraints == PathConstraints::Car {\\n\\n if let Some((pos, _)) = b.driving_connection(map) {\\n\\n bldg_to_road.insert(b.id, map.get_l(pos.lane()).get_directed_parent());\\n\\n }\\n\\n } else if constraints == PathConstraints::Bike {\\n\\n if let Some((pos, _)) = b.biking_connection(map) {\\n\",\n \"file_path\": \"map_model/src/connectivity/mod.rs\",\n \"rank\": 19,\n \"score\": 255560.48429935137\n },\n {\n \"content\": \"pub fn path_raw_map(name: &MapName) -> String {\\n\\n path(format!(\\n\\n \\\"input/{}/{}/raw_maps/{}.bin\\\",\\n\\n name.city.country, name.city.city, name.map\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 20,\n \"score\": 250995.60975151445\n },\n {\n \"content\": \"/// Return the cost of a single path, and also a mapping from every directed road to the cost of\\n\\n/// getting there from the same start. This can be used to understand why an alternative route\\n\\n/// wasn't chosen.\\n\\npub fn debug_vehicle_costs(\\n\\n req: PathRequest,\\n\\n map: &Map,\\n\\n) -> Option<(Duration, HashMap<DirectedRoadID, Duration>)> {\\n\\n // TODO Support this\\n\\n if req.constraints == PathConstraints::Pedestrian {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let (_, cost) = crate::pathfind::dijkstra::pathfind(req.clone(), map.routing_params(), map)?;\\n\\n\\n\\n let graph = build_graph_for_vehicles(map, req.constraints);\\n\\n let road_costs = petgraph::algo::dijkstra(\\n\\n &graph,\\n\\n map.get_l(req.start.lane()).get_directed_parent(),\\n\\n None,\\n\\n |(_, _, mvmnt)| {\\n\\n vehicle_cost(\\n\\n mvmnt.from,\\n\\n *mvmnt,\\n\\n req.constraints,\\n\\n map.routing_params(),\\n\\n map,\\n\\n ) + zone_cost(*mvmnt, req.constraints, map)\\n\\n },\\n\\n );\\n\\n\\n\\n Some((cost, road_costs))\\n\\n}\\n\",\n \"file_path\": \"map_model/src/connectivity/mod.rs\",\n \"rank\": 21,\n \"score\": 250281.8352254677\n },\n {\n \"content\": \"/// Also returns a list of labeled polygons for debugging.\\n\\n///\\n\\n/// Ideally, the resulting polygon should exist entirely within the thick bands around all original\\n\\n/// roads -- it just carves up part of that space, doesn't reach past it. But that's not always true\\n\\n/// yet.\\n\\npub fn intersection_polygon(\\n\\n i: &Intersection,\\n\\n roads: &mut BTreeMap<OriginalRoad, Road>,\\n\\n) -> Result<(Polygon, Vec<(String, Polygon)>)> {\\n\\n if i.roads.is_empty() {\\n\\n panic!(\\\"{} has no roads\\\", i.id);\\n\\n }\\n\\n\\n\\n // Turn all of the incident roads into two PolyLines (the \\\"forwards\\\" and \\\"backwards\\\" borders of\\n\\n // the road, if the roads were oriented to both be incoming to the intersection), both ending\\n\\n // at the intersection\\n\\n // TODO Maybe express the two incoming PolyLines as the \\\"right\\\" and \\\"left\\\"\\n\\n let mut lines: Vec<(OriginalRoad, Pt2D, PolyLine, PolyLine)> = Vec::new();\\n\\n // This is guaranteed to get set, since i.roads is non-empty\\n\\n let mut intersection_center = Pt2D::new(0.0, 0.0);\\n\\n for id in &i.roads {\\n\\n let r = &roads[id];\\n\\n\\n\\n let pl = if r.src_i == i.id {\\n\\n r.trimmed_center_pts.reversed()\\n\",\n \"file_path\": \"map_model/src/make/initial/geometry.rs\",\n \"rank\": 22,\n \"score\": 250209.49325407043\n },\n {\n \"content\": \"/// Transform a sequence of roads representing a path into the current lane-based path, by picking\\n\\n/// particular lanes and turns to use.\\n\\npub fn path_v2_to_v1(\\n\\n req: PathRequest,\\n\\n road_steps: Vec<DirectedRoadID>,\\n\\n uber_turns_v2: Vec<UberTurnV2>,\\n\\n map: &Map,\\n\\n) -> Result<Path> {\\n\\n // This is a somewhat brute-force method: run Dijkstra's algorithm on a graph of lanes and\\n\\n // turns, but only build the graph along the path of roads we've already found. This handles\\n\\n // arbitrary lookahead needed, and forces use of the original start/end lanes requested.\\n\\n //\\n\\n // Eventually we'll directly return road-based paths. Most callers will actually just use that\\n\\n // directly, and mainly the simulation will need to expand to specific lanes, but it'll do so\\n\\n // dynamically/lazily to account for current traffic conditions.\\n\\n let mut graph = petgraph::graphmap::DiGraphMap::new();\\n\\n for pair in road_steps.windows(2) {\\n\\n for src in pair[0].lanes(req.constraints, map) {\\n\\n for dst in pair[1].lanes(req.constraints, map) {\\n\\n let turn = TurnID {\\n\\n parent: map.get_l(src).dst_i,\\n\\n src,\\n\",\n \"file_path\": \"map_model/src/pathfind/v2.rs\",\n \"rank\": 23,\n \"score\": 250197.25577988217\n },\n {\n \"content\": \"pub fn distribute_residents(map: &mut map_model::Map, timer: &mut Timer) {\\n\\n for shape in abstio::read_binary::<ExtraShapes>(\\n\\n \\\"data/input/de/berlin/planning_areas.bin\\\".to_string(),\\n\\n timer,\\n\\n )\\n\\n .shapes\\n\\n {\\n\\n let pts = map.get_gps_bounds().convert(&shape.points);\\n\\n if pts\\n\\n .iter()\\n\\n .all(|pt| !map.get_boundary_polygon().contains_pt(*pt))\\n\\n {\\n\\n continue;\\n\\n }\\n\\n let region = Ring::must_new(pts).to_polygon();\\n\\n // Deterministically seed using the planning area's ID.\\n\\n let mut rng =\\n\\n XorShiftRng::seed_from_u64(shape.attributes[\\\"spatial_name\\\"].parse::<u64>().unwrap());\\n\\n\\n\\n for (home, n) in popdat::distribute_population_to_homes(\\n\",\n \"file_path\": \"importer/src/berlin.rs\",\n \"rank\": 24,\n \"score\": 250152.17990445186\n },\n {\n \"content\": \"/// Run the contents of a .osm through the full map importer with default options.\\n\\nfn import_map(path: String) -> Map {\\n\\n let mut timer = Timer::new(\\\"convert synthetic map\\\");\\n\\n let raw = convert_osm::convert(\\n\\n convert_osm::Options {\\n\\n name: MapName::new(\\\"zz\\\", \\\"oneshot\\\", &abstutil::basename(&path)),\\n\\n osm_input: path,\\n\\n clip: None,\\n\\n map_config: map_model::MapConfig {\\n\\n driving_side: map_model::DrivingSide::Right,\\n\\n bikes_can_use_bus_lanes: true,\\n\\n inferred_sidewalks: true,\\n\\n street_parking_spot_length: Distance::meters(8.0),\\n\\n },\\n\\n onstreet_parking: convert_osm::OnstreetParking::JustOSM,\\n\\n public_offstreet_parking: convert_osm::PublicOffstreetParking::None,\\n\\n private_offstreet_parking: convert_osm::PrivateOffstreetParking::FixedPerBldg(0),\\n\\n include_railroads: true,\\n\\n extra_buildings: None,\\n\\n },\\n\\n &mut timer,\\n\\n );\\n\\n let map = Map::create_from_raw(raw, true, true, &mut timer);\\n\\n map\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/src/main.rs\",\n \"rank\": 25,\n \"score\": 249939.81911922386\n },\n {\n \"content\": \"fn load_study_area(map: &Map) -> Result<Polygon> {\\n\\n let bytes = abstio::slurp_file(abstio::path(format!(\\n\\n \\\"system/study_areas/{}.geojson\\\",\\n\\n map.get_name().city.city.replace(\\\"_\\\", \\\"-\\\")\\n\\n )))?;\\n\\n let raw_string = std::str::from_utf8(&bytes)?;\\n\\n let geojson = raw_string.parse::<geojson::GeoJson>()?;\\n\\n\\n\\n if let geojson::GeoJson::FeatureCollection(collection) = geojson {\\n\\n for feature in collection.features {\\n\\n if let Some(geom) = feature.geometry {\\n\\n if let geojson::Value::Polygon(raw_pts) = geom.value {\\n\\n return parse_polygon(raw_pts, map.get_gps_bounds());\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n bail!(\\\"no study area\\\");\\n\\n}\\n\",\n \"file_path\": \"importer/src/uk.rs\",\n \"rank\": 26,\n \"score\": 247888.16785310418\n },\n {\n \"content\": \"/// Simple second-pass after generating all signals. Find pairs of traffic signals very close to\\n\\n/// each other with 2 stages each, see if the primary movement of the first stages lead to each\\n\\n/// other, and flip the order of stages if not. This is often wrong when the most common movement is\\n\\n/// actually turning left then going straight (near Mercer for example), but not sure how we could\\n\\n/// know that without demand data.\\n\\npub fn synchronize(map: &mut Map) {\\n\\n let mut seen = HashSet::new();\\n\\n let mut pairs = Vec::new();\\n\\n let handmapped = traffic_signal_data::load_all_data().unwrap();\\n\\n for i in map.all_intersections() {\\n\\n if !i.is_traffic_signal() || seen.contains(&i.id) || handmapped.contains_key(&i.orig_id.0) {\\n\\n continue;\\n\\n }\\n\\n if let Some(list) = IntersectionCluster::autodetect(i.id, map) {\\n\\n let list = list.into_iter().collect::<Vec<_>>();\\n\\n if list.len() == 2\\n\\n && map.get_traffic_signal(list[0]).stages.len() == 2\\n\\n && map.get_traffic_signal(list[1]).stages.len() == 2\\n\\n {\\n\\n pairs.push((list[0], list[1]));\\n\\n seen.insert(list[0]);\\n\\n seen.insert(list[1]);\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/mod.rs\",\n \"rank\": 27,\n \"score\": 246826.65498767985\n },\n {\n \"content\": \"/// This import from GTFS:\\n\\n/// - is specific to Seattle, whose files don't seem to match https://developers.google.com/transit/gtfs/reference\\n\\n/// - is probably wrong\\n\\npub fn add_gtfs_schedules(map: &mut Map) {\\n\\n let city = CityName::seattle();\\n\\n // https://www.openstreetmap.org/relation/8616968 as an example, mapping to\\n\\n // https://kingcounty.gov/depts/transportation/metro/schedules-maps/route/048.aspx\\n\\n\\n\\n let mut trip_marker_to_route: BTreeMap<String, BusRouteID> = BTreeMap::new();\\n\\n for br in map.all_bus_routes() {\\n\\n if let Some(ref m) = br.gtfs_trip_marker {\\n\\n // Dunno what the :0 thing is\\n\\n trip_marker_to_route.insert(m.split(\\\":\\\").next().unwrap().to_string(), br.id);\\n\\n }\\n\\n }\\n\\n\\n\\n // Each route has a bunch of trips throughout the day\\n\\n let mut trip_marker_to_trips: MultiMap<String, String> = MultiMap::new();\\n\\n for rec in\\n\\n csv::Reader::from_reader(File::open(city.input_path(\\\"google_transit/trips.txt\\\")).unwrap())\\n\\n .deserialize()\\n\\n {\\n\\n let rec: TripRecord = rec.unwrap();\\n\",\n \"file_path\": \"importer/src/seattle.rs\",\n \"rank\": 28,\n \"score\": 246352.49542127497\n },\n {\n \"content\": \"fn make_elevation(ctx: &EventCtx, color: Color, walking: bool, path: &Path, map: &Map) -> Widget {\\n\\n let mut pts: Vec<(Distance, Distance)> = Vec::new();\\n\\n let mut dist = Distance::ZERO;\\n\\n for step in path.get_steps() {\\n\\n if let PathStep::Turn(t) = step {\\n\\n pts.push((dist, map.get_i(t.parent).elevation));\\n\\n }\\n\\n dist += step.as_traversable().length(map);\\n\\n }\\n\\n // TODO Show roughly where we are in the trip; use distance covered by current path for this\\n\\n LinePlot::new(\\n\\n ctx,\\n\\n vec![Series {\\n\\n label: if walking {\\n\\n \\\"Elevation for walking\\\"\\n\\n } else {\\n\\n \\\"Elevation for biking\\\"\\n\\n }\\n\\n .to_string(),\\n\\n color,\\n\\n pts,\\n\\n }],\\n\\n PlotOptions::fixed(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/info/trip.rs\",\n \"rank\": 29,\n \"score\": 245796.994557516\n },\n {\n \"content\": \"pub fn draw_stage_number(\\n\\n app: &dyn AppLike,\\n\\n prerender: &Prerender,\\n\\n i: IntersectionID,\\n\\n idx: usize,\\n\\n batch: &mut GeomBatch,\\n\\n) {\\n\\n let radius = Distance::meters(1.0);\\n\\n let center = app.map().get_i(i).polygon.polylabel();\\n\\n batch.push(\\n\\n Color::hex(\\\"#5B5B5B\\\"),\\n\\n Circle::new(center, radius).to_polygon(),\\n\\n );\\n\\n batch.append(\\n\\n Text::from(Line(format!(\\\"{}\\\", idx + 1)).fg(Color::WHITE))\\n\\n .render_autocropped(prerender)\\n\\n .scale(0.075)\\n\\n .centered_on(center),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_gui/src/render/traffic_signal.rs\",\n \"rank\": 30,\n \"score\": 245246.8589101408\n },\n {\n \"content\": \"pub fn draw_signal_stage(\\n\\n prerender: &Prerender,\\n\\n stage: &Stage,\\n\\n idx: usize,\\n\\n i: IntersectionID,\\n\\n time_left: Option<Duration>,\\n\\n batch: &mut GeomBatch,\\n\\n app: &dyn AppLike,\\n\\n signal_style: TrafficSignalStyle,\\n\\n) {\\n\\n let signal = app.map().get_traffic_signal(i);\\n\\n\\n\\n match signal_style {\\n\\n TrafficSignalStyle::BAP => {\\n\\n let mut dont_walk = BTreeSet::new();\\n\\n let mut crossed_roads = BTreeSet::new();\\n\\n for m in signal.movements.keys() {\\n\\n if m.crosswalk {\\n\\n dont_walk.insert(m);\\n\\n // TODO This is incorrect; some crosswalks hop over intermediate roads. How do\\n\",\n \"file_path\": \"map_gui/src/render/traffic_signal.rs\",\n \"rank\": 31,\n \"score\": 245246.8589101408\n },\n {\n \"content\": \"/// Match OSM buildings to parcels, scraping the number of housing units.\\n\\n// TODO It's expensive to load the huge zoning_parcels.bin file for every map.\\n\\npub fn match_parcels_to_buildings(map: &mut Map, shapes: &ExtraShapes, timer: &mut Timer) {\\n\\n let mut parcels_with_housing: Vec<(Polygon, usize)> = Vec::new();\\n\\n // TODO We should refactor something like FindClosest, but for polygon containment\\n\\n // The quadtree's ID is just an index into parcels_with_housing.\\n\\n let mut quadtree: QuadTree<usize> = QuadTree::default(map.get_bounds().as_bbox());\\n\\n timer.start_iter(\\\"index all parcels\\\", shapes.shapes.len());\\n\\n for shape in &shapes.shapes {\\n\\n timer.next();\\n\\n if let Some(units) = shape\\n\\n .attributes\\n\\n .get(\\\"EXIST_UNITS\\\")\\n\\n .and_then(|x| x.parse::<usize>().ok())\\n\\n {\\n\\n if let Some(ring) = map\\n\\n .get_gps_bounds()\\n\\n .try_convert(&shape.points)\\n\\n .and_then(|pts| Ring::new(pts).ok())\\n\\n {\\n\\n let polygon = ring.to_polygon();\\n\\n quadtree\\n\",\n \"file_path\": \"importer/src/seattle.rs\",\n \"rank\": 32,\n \"score\": 243990.80849942862\n },\n {\n \"content\": \"fn floodfill(map: &Map, start: RoadID) -> Zone {\\n\\n let match_constraints = map.get_r(start).access_restrictions.clone();\\n\\n let merge_zones = map.get_edits().merge_zones;\\n\\n let mut queue = vec![start];\\n\\n let mut members = BTreeSet::new();\\n\\n let mut borders = BTreeSet::new();\\n\\n while !queue.is_empty() {\\n\\n let current = queue.pop().unwrap();\\n\\n if members.contains(¤t) {\\n\\n continue;\\n\\n }\\n\\n members.insert(current);\\n\\n for r in map.get_next_roads(current) {\\n\\n let r = map.get_r(r);\\n\\n if r.access_restrictions == match_constraints && merge_zones {\\n\\n queue.push(r.id);\\n\\n } else {\\n\\n borders.insert(map.get_r(current).common_endpt(r));\\n\\n }\\n\\n }\\n\\n }\\n\\n assert!(!members.is_empty());\\n\\n assert!(!borders.is_empty());\\n\\n Zone {\\n\\n members,\\n\\n borders,\\n\\n restrictions: match_constraints,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"map_model/src/objects/zone.rs\",\n \"rank\": 33,\n \"score\": 243290.08227670705\n },\n {\n \"content\": \"pub fn unzoomed_agent_radius(vt: Option<VehicleType>) -> Distance {\\n\\n // Lane thickness is a little hard to see, so double it. Most of the time, the circles don't\\n\\n // leak out of the road too much.\\n\\n if vt.is_some() {\\n\\n 4.0 * NORMAL_LANE_THICKNESS\\n\\n } else {\\n\\n 4.0 * SIDEWALK_THICKNESS\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_gui/src/render/mod.rs\",\n \"rank\": 34,\n \"score\": 242420.86215273026\n },\n {\n \"content\": \"pub fn angle_from_arrow_keys(ctx: &EventCtx) -> Option<Angle> {\\n\\n let mut x: f64 = 0.0;\\n\\n let mut y: f64 = 0.0;\\n\\n if ctx.is_key_down(Key::LeftArrow) || ctx.is_key_down(Key::A) {\\n\\n x -= 1.0;\\n\\n }\\n\\n if ctx.is_key_down(Key::RightArrow) || ctx.is_key_down(Key::D) {\\n\\n x += 1.0;\\n\\n }\\n\\n if ctx.is_key_down(Key::UpArrow) || ctx.is_key_down(Key::W) {\\n\\n y -= 1.0;\\n\\n }\\n\\n if ctx.is_key_down(Key::DownArrow) || ctx.is_key_down(Key::S) {\\n\\n y += 1.0;\\n\\n }\\n\\n\\n\\n if x == 0.0 && y == 0.0 {\\n\\n return None;\\n\\n }\\n\\n Some(Angle::new_rads(y.atan2(x)))\\n\\n}\\n\",\n \"file_path\": \"santa/src/controls.rs\",\n \"rank\": 35,\n \"score\": 242033.1265257657\n },\n {\n \"content\": \"pub fn convert(opts: Options, timer: &mut abstutil::Timer) -> RawMap {\\n\\n let mut map = RawMap::blank(opts.name.clone());\\n\\n if let Some(ref path) = opts.clip {\\n\\n let pts = LonLat::read_osmosis_polygon(path).unwrap();\\n\\n let gps_bounds = GPSBounds::from(pts.clone());\\n\\n map.boundary_polygon = Ring::must_new(gps_bounds.convert(&pts)).to_polygon();\\n\\n map.gps_bounds = gps_bounds;\\n\\n }\\n\\n\\n\\n let extract = extract::extract_osm(&mut map, &opts, timer);\\n\\n let (amenities, pt_to_road) = split_ways::split_up_roads(&mut map, extract, timer);\\n\\n clip::clip_map(&mut map, timer);\\n\\n\\n\\n // Need to do a first pass of removing cul-de-sacs here, or we wind up with loop PolyLines when\\n\\n // doing the parking hint matching.\\n\\n abstutil::retain_btreemap(&mut map.roads, |r, _| r.i1 != r.i2);\\n\\n\\n\\n let all_routes = map.bus_routes.drain(..).collect::<Vec<_>>();\\n\\n let mut routes = Vec::new();\\n\\n for route in all_routes {\\n\",\n \"file_path\": \"convert_osm/src/lib.rs\",\n \"rank\": 36,\n \"score\": 241787.3171255681\n },\n {\n \"content\": \"pub fn path_all_edits(name: &MapName) -> String {\\n\\n path(format!(\\n\\n \\\"player/edits/{}/{}/{}\\\",\\n\\n name.city.country, name.city.city, name.map\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 37,\n \"score\": 241413.18282118926\n },\n {\n \"content\": \"pub fn path_all_scenarios(name: &MapName) -> String {\\n\\n path(format!(\\n\\n \\\"system/{}/{}/scenarios/{}\\\",\\n\\n name.city.country, name.city.city, name.map\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 38,\n \"score\": 241413.18282118926\n },\n {\n \"content\": \"pub fn parent_path(path: &str) -> String {\\n\\n format!(\\\"{}\\\", std::path::Path::new(path).parent().unwrap().display())\\n\\n}\\n\",\n \"file_path\": \"abstutil/src/utils.rs\",\n \"rank\": 39,\n \"score\": 240896.42655667395\n },\n {\n \"content\": \"fn validate_zones(map: &Map, steps: &Vec<PathStep>, req: &PathRequest) {\\n\\n let z1 = map.get_parent(req.start.lane()).get_zone(map);\\n\\n let z2 = map.get_parent(req.end.lane()).get_zone(map);\\n\\n\\n\\n for step in steps {\\n\\n if let PathStep::Turn(t) = step {\\n\\n if map\\n\\n .get_parent(t.src)\\n\\n .access_restrictions\\n\\n .allow_through_traffic\\n\\n .contains(req.constraints)\\n\\n && !map\\n\\n .get_parent(t.dst)\\n\\n .access_restrictions\\n\\n .allow_through_traffic\\n\\n .contains(req.constraints)\\n\\n {\\n\\n // Entering our destination zone is fine\\n\\n let into_zone = map.get_parent(t.dst).get_zone(map);\\n\\n if into_zone != z1 && into_zone != z2 {\\n\",\n \"file_path\": \"map_model/src/pathfind/v1.rs\",\n \"rank\": 40,\n \"score\": 237764.9934293487\n },\n {\n \"content\": \"fn use_parking_hints(map: &mut RawMap, path: String, timer: &mut Timer) {\\n\\n timer.start(\\\"apply parking hints\\\");\\n\\n let shapes: ExtraShapes = abstio::read_binary(path, timer);\\n\\n\\n\\n // Match shapes with the nearest road + direction (true for forwards)\\n\\n let mut closest: FindClosest<(OriginalRoad, bool)> =\\n\\n FindClosest::new(&map.gps_bounds.to_bounds());\\n\\n for (id, r) in &map.roads {\\n\\n if r.is_light_rail() || r.is_footway() || r.is_service() {\\n\\n continue;\\n\\n }\\n\\n let center = PolyLine::must_new(r.center_points.clone());\\n\\n closest.add(\\n\\n (*id, true),\\n\\n center.must_shift_right(DIRECTED_ROAD_THICKNESS).points(),\\n\\n );\\n\\n closest.add(\\n\\n (*id, false),\\n\\n center.must_shift_left(DIRECTED_ROAD_THICKNESS).points(),\\n\\n );\\n\",\n \"file_path\": \"convert_osm/src/parking.rs\",\n \"rank\": 41,\n \"score\": 237156.87832594218\n },\n {\n \"content\": \"fn use_offstreet_parking(map: &mut RawMap, path: String, timer: &mut Timer) {\\n\\n timer.start(\\\"match offstreet parking points\\\");\\n\\n let shapes: ExtraShapes = abstio::read_binary(path, timer);\\n\\n\\n\\n let mut closest: FindClosest<osm::OsmID> = FindClosest::new(&map.gps_bounds.to_bounds());\\n\\n for (id, b) in &map.buildings {\\n\\n closest.add(*id, b.polygon.points());\\n\\n }\\n\\n\\n\\n // TODO Another function just to use ?. Try blocks would rock.\\n\\n let mut handle_shape: Box<dyn FnMut(kml::ExtraShape) -> Option<()>> = Box::new(|s| {\\n\\n assert_eq!(s.points.len(), 1);\\n\\n let pt = s.points[0].to_pt(&map.gps_bounds);\\n\\n let (id, _) = closest.closest_pt(pt, Distance::meters(50.0))?;\\n\\n // TODO Handle parking lots.\\n\\n if !map.buildings[&id].polygon.contains_pt(pt) {\\n\\n return None;\\n\\n }\\n\\n let name = s.attributes.get(\\\"DEA_FACILITY_NAME\\\")?.to_string();\\n\\n let num_stalls = s.attributes.get(\\\"DEA_STALLS\\\")?.parse::<usize>().ok()?;\\n\",\n \"file_path\": \"convert_osm/src/parking.rs\",\n \"rank\": 42,\n \"score\": 237156.87832594218\n },\n {\n \"content\": \"pub fn path_camera_state(name: &MapName) -> String {\\n\\n path(format!(\\n\\n \\\"player/camera_state/{}/{}/{}.json\\\",\\n\\n name.city.country, name.city.city, name.map\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 43,\n \"score\": 237056.05265370163\n },\n {\n \"content\": \"fn draw_unwalkable_roads(ctx: &mut EventCtx, app: &App, opts: &Options) -> Drawable {\\n\\n let allow_shoulders = match opts {\\n\\n Options::Walking(ref opts) => opts.allow_shoulders,\\n\\n Options::Biking => {\\n\\n return Drawable::empty(ctx);\\n\\n }\\n\\n };\\n\\n\\n\\n let mut batch = GeomBatch::new();\\n\\n 'ROADS: for road in app.map.all_roads() {\\n\\n if road.is_light_rail() {\\n\\n continue;\\n\\n }\\n\\n for (_, _, lt) in road.lanes_ltr() {\\n\\n if lt == LaneType::Sidewalk || (lt == LaneType::Shoulder && allow_shoulders) {\\n\\n continue 'ROADS;\\n\\n }\\n\\n }\\n\\n // TODO Skip highways\\n\\n batch.push(Color::BLUE.alpha(0.5), road.get_thick_polygon(&app.map));\\n\\n }\\n\\n ctx.upload(batch)\\n\\n}\\n\",\n \"file_path\": \"fifteen_min/src/viewer.rs\",\n \"rank\": 44,\n \"score\": 234695.56363938164\n },\n {\n \"content\": \"// (Epicenter, entire shape)\\n\\nfn cluster_jams(map: &Map, problems: Vec<(IntersectionID, Time)>) -> Vec<(Polygon, Polygon)> {\\n\\n let mut jams: Vec<Jam> = Vec::new();\\n\\n // The delay itself doesn't matter, as long as they're sorted.\\n\\n for (i, _) in problems {\\n\\n // Is this connected to an existing problem?\\n\\n if let Some(ref mut jam) = jams.iter_mut().find(|j| j.adjacent_to(map, i)) {\\n\\n jam.members.insert(i);\\n\\n } else {\\n\\n jams.push(Jam {\\n\\n epicenter: i,\\n\\n members: btreeset! { i },\\n\\n });\\n\\n }\\n\\n }\\n\\n\\n\\n jams.into_iter()\\n\\n .map(|jam| {\\n\\n (\\n\\n map.get_i(jam.epicenter).polygon.clone(),\\n\\n Polygon::convex_hull(jam.all_polygons(map)),\\n\",\n \"file_path\": \"game/src/layer/traffic.rs\",\n \"rank\": 45,\n \"score\": 234235.57992002412\n },\n {\n \"content\": \"/// Exports a single road to Streetmix's format, returns the filename\\n\\npub fn export(r: RoadID, map: &Map) -> String {\\n\\n let path = format!(\\\"streetmix_export_{}.json\\\", r.0);\\n\\n let street = road(r, map);\\n\\n abstio::write_json(path.clone(), &street);\\n\\n path\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/debug/streetmix.rs\",\n \"rank\": 46,\n \"score\": 233125.5533390871\n },\n {\n \"content\": \"fn calculate_turn_markings(map: &Map, lane: &Lane) -> Vec<Polygon> {\\n\\n if lane.length() < Distance::meters(7.0) {\\n\\n return Vec::new();\\n\\n }\\n\\n\\n\\n // Does this lane connect to every other possible outbound lane of the same type, excluding\\n\\n // U-turns to the same road? If so, then there's nothing unexpected to communicate.\\n\\n let i = map.get_i(lane.dst_i);\\n\\n if i.outgoing_lanes.iter().all(|l| {\\n\\n let l = map.get_l(*l);\\n\\n l.lane_type != lane.lane_type\\n\\n || l.parent == lane.parent\\n\\n || map\\n\\n .maybe_get_t(TurnID {\\n\\n parent: i.id,\\n\\n src: lane.id,\\n\\n dst: l.id,\\n\\n })\\n\\n .is_some()\\n\\n }) {\\n\",\n \"file_path\": \"map_gui/src/render/lane.rs\",\n \"rank\": 47,\n \"score\": 232617.9587049513\n },\n {\n \"content\": \"fn calculate_parking_lines(lane: &Lane, map: &Map) -> Vec<Polygon> {\\n\\n // meters, but the dims get annoying below to remove\\n\\n let leg_length = Distance::meters(1.0);\\n\\n\\n\\n let mut result = Vec::new();\\n\\n let num_spots = lane.number_parking_spots(map.get_config());\\n\\n if num_spots > 0 {\\n\\n for idx in 0..=num_spots {\\n\\n let (pt, lane_angle) = lane\\n\\n .lane_center_pts\\n\\n .must_dist_along(map.get_config().street_parking_spot_length * (1.0 + idx as f64));\\n\\n let perp_angle = if map.get_config().driving_side == DrivingSide::Right {\\n\\n lane_angle.rotate_degs(270.0)\\n\\n } else {\\n\\n lane_angle.rotate_degs(90.0)\\n\\n };\\n\\n // Find the outside of the lane. Actually, shift inside a little bit, since the line\\n\\n // will have thickness, but shouldn't really intersect the adjacent line\\n\\n // when drawn.\\n\\n let t_pt = pt.project_away(lane.width * 0.4, perp_angle);\\n\",\n \"file_path\": \"map_gui/src/render/lane.rs\",\n \"rank\": 48,\n \"score\": 232617.9587049513\n },\n {\n \"content\": \"pub fn adjust_private_parking(map: &mut Map, scenario: &Scenario) {\\n\\n for (b, count) in scenario.count_parked_cars_per_bldg().consume() {\\n\\n map.hack_override_offstreet_spots_individ(b, count);\\n\\n }\\n\\n map.save();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"importer/src/seattle.rs\",\n \"rank\": 49,\n \"score\": 229895.29587238882\n },\n {\n \"content\": \"/// Generate all driving and walking turns at an intersection, accounting for OSM turn restrictions.\\n\\npub fn make_all_turns(map: &Map, i: &Intersection) -> Vec<Turn> {\\n\\n let mut raw_turns: Vec<Turn> = Vec::new();\\n\\n raw_turns.extend(make_vehicle_turns(i, map));\\n\\n raw_turns.extend(crate::make::walking_turns::filter_turns(\\n\\n crate::make::walking_turns::make_walking_turns(map, i),\\n\\n map,\\n\\n i,\\n\\n ));\\n\\n let unique_turns = ensure_unique(raw_turns);\\n\\n\\n\\n let mut final_turns: Vec<Turn> = Vec::new();\\n\\n let mut filtered_turns: HashMap<LaneID, Vec<Turn>> = HashMap::new();\\n\\n for turn in unique_turns {\\n\\n if !does_turn_pass_restrictions(&turn, i, map) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n if is_turn_allowed(&turn, map) {\\n\\n final_turns.push(turn);\\n\\n } else {\\n\",\n \"file_path\": \"map_model/src/make/turns.rs\",\n \"rank\": 50,\n \"score\": 229822.55238638795\n },\n {\n \"content\": \"pub fn make_crosswalk(batch: &mut GeomBatch, turn: &Turn, map: &Map, cs: &ColorScheme) {\\n\\n if make_rainbow_crosswalk(batch, turn, map) {\\n\\n return;\\n\\n }\\n\\n\\n\\n // This size also looks better for shoulders\\n\\n let width = SIDEWALK_THICKNESS;\\n\\n // Start at least width out to not hit sidewalk corners. Also account for the thickness of the\\n\\n // crosswalk line itself. Center the lines inside these two boundaries.\\n\\n let boundary = width;\\n\\n let tile_every = width * 0.6;\\n\\n let line = {\\n\\n // The middle line in the crosswalk geometry is the main crossing line.\\n\\n let pts = turn.geom.points();\\n\\n if pts.len() < 3 {\\n\\n println!(\\n\\n \\\"Not rendering crosswalk for {}; its geometry was squished earlier\\\",\\n\\n turn.id\\n\\n );\\n\\n return;\\n\",\n \"file_path\": \"map_gui/src/render/intersection.rs\",\n \"rank\": 51,\n \"score\": 228504.44073011997\n },\n {\n \"content\": \"fn degenerate(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\\n\\n if roads.len() != 2 {\\n\\n return None;\\n\\n }\\n\\n let (r1, r2) = (roads[0], roads[1]);\\n\\n\\n\\n let mut ts = new(i, map);\\n\\n make_stages(\\n\\n &mut ts,\\n\\n map.config.driving_side,\\n\\n vec![vec![(vec![r1, r2], TurnType::Straight, PROTECTED)]],\\n\\n );\\n\\n Some(ts)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/mod.rs\",\n \"rank\": 52,\n \"score\": 227278.1902782637\n },\n {\n \"content\": \"pub fn draw_occupants(details: &mut Details, app: &App, id: BuildingID, focus: Option<PersonID>) {\\n\\n // TODO Lots of fun ideas here. Have a deterministic simulation based on building ID and time\\n\\n // to have people \\\"realistically\\\" move around. Draw little floor plans.\\n\\n\\n\\n let mut ppl = app.primary.sim.bldg_to_people(id);\\n\\n let num_rows_cols = (ppl.len() as f64).sqrt().ceil() as usize;\\n\\n\\n\\n let ped_len = SIDEWALK_THICKNESS.inner_meters() / 2.0;\\n\\n let separation = ped_len * 1.5;\\n\\n\\n\\n let total_width_height = (num_rows_cols as f64) * (ped_len + separation);\\n\\n let top_left = app\\n\\n .primary\\n\\n .map\\n\\n .get_b(id)\\n\\n .label_center\\n\\n .offset(-total_width_height / 2.0, -total_width_height / 2.0);\\n\\n\\n\\n // TODO Current thing is inefficient and can easily wind up outside the building.\\n\\n\\n\",\n \"file_path\": \"game/src/info/building.rs\",\n \"rank\": 53,\n \"score\": 227250.9165431084\n },\n {\n \"content\": \"pub fn path<I: AsRef<str>>(p: I) -> String {\\n\\n let p = p.as_ref();\\n\\n if p.starts_with(\\\"player/\\\") {\\n\\n format!(\\\"{}/{}\\\", *ROOT_PLAYER_DIR, p)\\n\\n } else {\\n\\n format!(\\\"{}/{}\\\", *ROOT_DIR, p)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A single city is identified using this.\\n\\n#[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Serialize, Deserialize)]\\n\\npub struct CityName {\\n\\n /// A two letter lowercase country code, from https://en.wikipedia.org/wiki/ISO_3166-1_alpha-2.\\n\\n /// To represent imaginary/test cities, use the code `zz`.\\n\\n pub country: String,\\n\\n /// The name of the city, in filename-friendly form -- for example, \\\"tel_aviv\\\".\\n\\n pub city: String,\\n\\n}\\n\\n\\n\\nimpl CityName {\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 54,\n \"score\": 226521.4906780455\n },\n {\n \"content\": \"fn half_signal(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n if map.get_i(i).roads.len() != 2 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let mut ts = new(i, map);\\n\\n let mut vehicle_stage = Stage::new();\\n\\n let mut ped_stage = Stage::new();\\n\\n for (id, movement) in &ts.movements {\\n\\n if id.crosswalk {\\n\\n ped_stage.edit_movement(movement, TurnPriority::Protected);\\n\\n } else {\\n\\n vehicle_stage.edit_movement(movement, TurnPriority::Protected);\\n\\n }\\n\\n }\\n\\n vehicle_stage.stage_type = StageType::Fixed(Duration::minutes(1));\\n\\n ped_stage.stage_type = StageType::Fixed(Duration::seconds(10.0));\\n\\n\\n\\n ts.stages = vec![vehicle_stage, ped_stage];\\n\\n Some(ts)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/mod.rs\",\n \"rank\": 55,\n \"score\": 224799.74396705895\n },\n {\n \"content\": \"fn three_way(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\\n\\n if roads.len() != 3 {\\n\\n return None;\\n\\n }\\n\\n let mut ts = new(i, map);\\n\\n\\n\\n // Picture a T intersection. Use turn angles to figure out the \\\"main\\\" two roads.\\n\\n let straight = ts\\n\\n .movements\\n\\n .values()\\n\\n .find(|g| g.turn_type == TurnType::Straight)?;\\n\\n let (north, south) = (straight.id.from.id, straight.id.to.id);\\n\\n let east = roads\\n\\n .into_iter()\\n\\n .find(|r| *r != north && *r != south)\\n\\n .unwrap();\\n\\n\\n\\n // Two-stage with no protected lefts, right turn on red, turning cars yield to peds\\n\\n make_stages(\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/mod.rs\",\n \"rank\": 56,\n \"score\": 224799.74396705895\n },\n {\n \"content\": \"// TODO This assumes the lanes change direction only at one point. A two-way cycletrack right at\\n\\n// the border will look a bit off.\\n\\nfn calculate_border_arrows(i: &Intersection, r: &Road, map: &Map) -> Vec<Polygon> {\\n\\n let mut result = Vec::new();\\n\\n\\n\\n let mut width_fwd = Distance::ZERO;\\n\\n let mut width_back = Distance::ZERO;\\n\\n for (l, dir, _) in r.lanes_ltr() {\\n\\n if dir == Direction::Fwd {\\n\\n width_fwd += map.get_l(l).width;\\n\\n } else {\\n\\n width_back += map.get_l(l).width;\\n\\n }\\n\\n }\\n\\n let center = r.get_dir_change_pl(map);\\n\\n\\n\\n // These arrows should point from the void to the road\\n\\n if !i.outgoing_lanes.is_empty() {\\n\\n let (line, width) = if r.dst_i == i.id {\\n\\n (\\n\\n center.last_line().shift_left(width_back / 2.0).reverse(),\\n\\n width_back,\\n\",\n \"file_path\": \"map_gui/src/render/intersection.rs\",\n \"rank\": 57,\n \"score\": 224404.6524147736\n },\n {\n \"content\": \"/// Generate Crosswalk and SharedSidewalkCorner (places where two sidewalks directly meet) turns\\n\\npub fn make_walking_turns(map: &Map, i: &Intersection) -> Vec<Turn> {\\n\\n if i.is_footway(map) {\\n\\n return make_footway_turns(map, i);\\n\\n }\\n\\n\\n\\n let driving_side = map.config.driving_side;\\n\\n let all_roads = map.all_roads();\\n\\n let lanes = map.all_lanes();\\n\\n\\n\\n let roads: Vec<&Road> = i\\n\\n .get_roads_sorted_by_incoming_angle(all_roads)\\n\\n .into_iter()\\n\\n .map(|id| &all_roads[id.0])\\n\\n .collect();\\n\\n let mut result: Vec<Turn> = Vec::new();\\n\\n\\n\\n // I'm a bit confused when to do -1 and +1 honestly, but this works in practice. Angle sorting\\n\\n // may be a little backwards.\\n\\n let idx_offset = if driving_side == DrivingSide::Right {\\n\\n -1\\n\",\n \"file_path\": \"map_model/src/make/walking_turns.rs\",\n \"rank\": 58,\n \"score\": 224315.99005702144\n },\n {\n \"content\": \"// Transforms all zones into the map's coordinate space, no matter how far out-of-bounds they are.\\n\\nfn parse_zones(gps_bounds: &GPSBounds, path: String) -> Result<HashMap<String, Polygon>> {\\n\\n let mut zones = HashMap::new();\\n\\n\\n\\n let bytes = abstio::slurp_file(path)?;\\n\\n let raw_string = std::str::from_utf8(&bytes)?;\\n\\n let geojson = raw_string.parse::<geojson::GeoJson>()?;\\n\\n\\n\\n if let geojson::GeoJson::FeatureCollection(collection) = geojson {\\n\\n for feature in collection.features {\\n\\n let zone = feature\\n\\n .property(\\\"geo_code\\\")\\n\\n .and_then(|x| x.as_str())\\n\\n .ok_or_else(|| anyhow!(\\\"no geo_code\\\"))?\\n\\n .to_string();\\n\\n if let Some(geom) = feature.geometry {\\n\\n if let geojson::Value::MultiPolygon(mut raw_polygons) = geom.value {\\n\\n if raw_polygons.len() != 1 {\\n\\n // We'll just one of them arbitrarily\\n\\n warn!(\\n\\n \\\"Zone {} has a multipolygon with {} members\\\",\\n\",\n \"file_path\": \"importer/src/uk.rs\",\n \"rank\": 59,\n \"score\": 223298.75830567756\n },\n {\n \"content\": \"/// When the PermanentMapEdits format changes, add a transformation here to automatically convert\\n\\n/// edits written with the old format.\\n\\n///\\n\\n/// This problem is often solved with something like protocol buffers, but the resulting proto\\n\\n/// usually winds up with permanent legacy fields, unless the changes are purely additive. For\\n\\n/// example, protobufs wouldn't have helped with the fix_intersection_ids problem. Explicit\\n\\n/// transformation is easier!\\n\\npub fn upgrade(mut value: Value, map: &Map) -> Result<PermanentMapEdits> {\\n\\n // c46a74f10f4f1976a48aa8642ac11717d74b262c added an explicit version field. There are a few\\n\\n // changes before that.\\n\\n if value.get(\\\"version\\\").is_none() {\\n\\n // I don't remember the previous schema change before this. If someone files a bug and has\\n\\n // an older file, can add support for it then.\\n\\n fix_offset(&mut value);\\n\\n fix_intersection_ids(&mut value);\\n\\n\\n\\n value\\n\\n .as_object_mut()\\n\\n .unwrap()\\n\\n .insert(\\\"version\\\".to_string(), Value::Number(0.into()));\\n\\n }\\n\\n if value[\\\"version\\\"] == Value::Number(0.into()) {\\n\\n fix_road_direction(&mut value);\\n\\n value\\n\\n .as_object_mut()\\n\\n .unwrap()\\n\\n .insert(\\\"version\\\".to_string(), Value::Number(1.into()));\\n\",\n \"file_path\": \"map_model/src/edits/compat.rs\",\n \"rank\": 60,\n \"score\": 222597.67700528004\n },\n {\n \"content\": \"fn make_controls(ctx: &mut EventCtx, app: &App, opts: &Options, legend: Option<Widget>) -> Panel {\\n\\n let (total_ppl, ppl_in_bldg, ppl_off_map) = app.primary.sim.num_ppl();\\n\\n\\n\\n let mut col = vec![\\n\\n header(\\n\\n ctx,\\n\\n &format!(\\\"Population: {}\\\", prettyprint_usize(total_ppl)),\\n\\n ),\\n\\n Widget::row(vec![\\n\\n Widget::row(vec![\\n\\n Image::from_path(\\\"system/assets/tools/home.svg\\\").into_widget(ctx),\\n\\n Line(prettyprint_usize(ppl_in_bldg))\\n\\n .small()\\n\\n .into_widget(ctx),\\n\\n ]),\\n\\n Line(format!(\\\"Off-map: {}\\\", prettyprint_usize(ppl_off_map)))\\n\\n .small()\\n\\n .into_widget(ctx),\\n\\n ])\\n\\n .centered(),\\n\",\n \"file_path\": \"game/src/layer/population.rs\",\n \"rank\": 61,\n \"score\": 222468.13278242399\n },\n {\n \"content\": \"pub fn path_edits(name: &MapName, edits_name: &str) -> String {\\n\\n path(format!(\\n\\n \\\"player/edits/{}/{}/{}/{}.json\\\",\\n\\n name.city.country, name.city.city, name.map, edits_name\\n\\n ))\\n\\n}\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 62,\n \"score\": 222456.53110126755\n },\n {\n \"content\": \"pub fn path_scenario(name: &MapName, scenario_name: &str) -> String {\\n\\n // TODO Getting complicated. Sometimes we're trying to load, so we should look for .bin, then\\n\\n // .json. But when we're writing a custom scenario, we actually want to write a .bin.\\n\\n let bin = path(format!(\\n\\n \\\"system/{}/{}/scenarios/{}/{}.bin\\\",\\n\\n name.city.country, name.city.city, name.map, scenario_name\\n\\n ));\\n\\n let json = path(format!(\\n\\n \\\"system/{}/{}/scenarios/{}/{}.json\\\",\\n\\n name.city.country, name.city.city, name.map, scenario_name\\n\\n ));\\n\\n if file_exists(&bin) {\\n\\n return bin;\\n\\n }\\n\\n if file_exists(&json) {\\n\\n return json;\\n\\n }\\n\\n bin\\n\\n}\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 63,\n \"score\": 222456.53110126755\n },\n {\n \"content\": \"// TODO Need to filter out extraneous crosswalks. Why weren't they being created before?\\n\\npub fn _make_walking_turns_v2(map: &Map, i: &Intersection) -> Vec<Turn> {\\n\\n let driving_side = map.config.driving_side;\\n\\n let all_roads = map.all_roads();\\n\\n let all_lanes = map.all_lanes();\\n\\n\\n\\n // Consider all roads in counter-clockwise order. Every road has up to two sidewalks. Gather\\n\\n // those in order, remembering what roads don't have them.\\n\\n let mut lanes: Vec<Option<&Lane>> = Vec::new();\\n\\n let mut num_sidewalks = 0;\\n\\n for r in i.get_roads_sorted_by_incoming_angle(all_roads) {\\n\\n let r = &all_roads[r.0];\\n\\n let mut fwd = None;\\n\\n let mut back = None;\\n\\n for (l, dir, lt) in r.lanes_ltr() {\\n\\n if lt == LaneType::Sidewalk || lt == LaneType::Shoulder {\\n\\n if dir == Direction::Fwd {\\n\\n fwd = Some(&all_lanes[l.0]);\\n\\n } else {\\n\\n back = Some(&all_lanes[l.0]);\\n\\n }\\n\",\n \"file_path\": \"map_model/src/make/walking_turns.rs\",\n \"rank\": 64,\n \"score\": 221735.82011838458\n },\n {\n \"content\": \"fn create_zones(map: &Map, input: HashMap<String, Polygon>) -> HashMap<String, Zone> {\\n\\n let all_borders = MapBorders::new(map);\\n\\n let mut zones = HashMap::new();\\n\\n for (name, polygon) in input {\\n\\n let mut overlapping_area = 0.0;\\n\\n for p in polygon.intersection(map.get_boundary_polygon()) {\\n\\n overlapping_area += p.area();\\n\\n }\\n\\n // Sometimes this is slightly over 100%, because funky things happen with the polygon\\n\\n // intersection.\\n\\n let pct_overlap = (overlapping_area / polygon.area()).min(1.0);\\n\\n\\n\\n // If the zone doesn't intersect our map at all, totally skip it.\\n\\n if pct_overlap == 0.0 {\\n\\n continue;\\n\\n }\\n\\n zones.insert(\\n\\n name,\\n\\n Zone {\\n\\n polygon,\\n\",\n \"file_path\": \"popdat/src/od.rs\",\n \"rank\": 65,\n \"score\": 220254.339903143\n },\n {\n \"content\": \"fn four_way_two_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\\n\\n if roads.len() != 4 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // Just to refer to these easily, label with directions. Imagine an axis-aligned four-way.\\n\\n let (north, west, south, east) = (roads[0], roads[1], roads[2], roads[3]);\\n\\n\\n\\n // Two-stage with no protected lefts, right turn on red, turning cars yielding to peds\\n\\n let mut ts = new(i, map);\\n\\n make_stages(\\n\\n &mut ts,\\n\\n map.config.driving_side,\\n\\n vec![\\n\\n vec![\\n\\n (vec![north, south], TurnType::Straight, PROTECTED),\\n\\n (vec![north, south], TurnType::Right, YIELD),\\n\\n (vec![north, south], TurnType::Left, YIELD),\\n\\n (vec![east, west], TurnType::Right, YIELD),\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/mod.rs\",\n \"rank\": 66,\n \"score\": 220133.37014851085\n },\n {\n \"content\": \"fn make_signal(map: &Map, id: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let mut ts = new(id, map);\\n\\n if let Some(other) = three_way_three_stage(map, id) {\\n\\n ts.stages = other.stages;\\n\\n } else if let Some(other) = four_way_four_stage(map, id) {\\n\\n ts.stages = other.stages;\\n\\n }\\n\\n ts.convert_to_ped_scramble_without_promotion();\\n\\n // We don't always get a valid traffic signal from the default 3-way and 4-way. When we don't\\n\\n // we need to try assembling stages with a more complex algorithm.\\n\\n if ts.validate().is_err() {\\n\\n if let Some(other) = multi_way_stages(map, id) {\\n\\n ts.stages = other.stages;\\n\\n ts.convert_to_ped_scramble_without_promotion();\\n\\n }\\n\\n }\\n\\n if let Err(err) = ts.validate() {\\n\\n // when all else fails, use stage per road and all-walk stage at the end\\n\\n debug!(\\\"multi-way validation_error={} ts={:#?}\\\", err, ts);\\n\\n ts = stage_per_road(map, id);\\n\\n ts.convert_to_ped_scramble();\\n\\n }\\n\\n return Some(ts);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/lagging_green.rs\",\n \"rank\": 67,\n \"score\": 220133.37014851085\n },\n {\n \"content\": \"fn four_way_four_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\\n\\n if roads.len() != 4 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // Just to refer to these easily, label with directions. Imagine an axis-aligned four-way.\\n\\n let (north, west, south, east) = (roads[0], roads[1], roads[2], roads[3]);\\n\\n\\n\\n // Four-stage with protected lefts, right turn on red (except for the protected lefts),\\n\\n // turning cars yield to peds\\n\\n let mut ts = new(i, map);\\n\\n make_stages(\\n\\n &mut ts,\\n\\n map.config.driving_side,\\n\\n vec![\\n\\n vec![\\n\\n (vec![north, south], TurnType::Straight, PROTECTED),\\n\\n (vec![north, south], TurnType::Right, YIELD),\\n\\n (vec![east, west], TurnType::Right, YIELD),\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/mod.rs\",\n \"rank\": 68,\n \"score\": 220133.37014851085\n },\n {\n \"content\": \"pub fn path_popdat() -> String {\\n\\n path(\\\"input/us/seattle/popdat.bin\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 69,\n \"score\": 219655.62713873136\n },\n {\n \"content\": \"pub fn deserialize_nodemap<\\n\\n 'de,\\n\\n D: Deserializer<'de>,\\n\\n T: Deserialize<'de> + Copy + Ord + Debug + Serialize,\\n\\n>(\\n\\n d: D,\\n\\n) -> Result<NodeMap<T>, D::Error> {\\n\\n let inner = <InnerNodeMap<T>>::deserialize(d)?;\\n\\n let id_to_node = inner.id_to_node;\\n\\n let mut node_to_id = BTreeMap::new();\\n\\n for (id, node) in id_to_node.iter().enumerate() {\\n\\n node_to_id.insert(*node, id);\\n\\n }\\n\\n\\n\\n Ok(NodeMap {\\n\\n node_to_id,\\n\\n id_to_node,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"map_model/src/pathfind/node_map.rs\",\n \"rank\": 70,\n \"score\": 219018.90272094196\n },\n {\n \"content\": \"pub fn path_prebaked_results(name: &MapName, scenario_name: &str) -> String {\\n\\n path(format!(\\n\\n \\\"system/{}/{}/prebaked_results/{}/{}.bin\\\",\\n\\n name.city.country, name.city.city, name.map, scenario_name\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 71,\n \"score\": 218685.64583849508\n },\n {\n \"content\": \"/// Converts a RawMap to a Map.\\n\\npub fn raw_to_map(\\n\\n name: &MapName,\\n\\n build_ch: bool,\\n\\n keep_bldg_tags: bool,\\n\\n timer: &mut Timer,\\n\\n) -> map_model::Map {\\n\\n timer.start(format!(\\\"Raw->Map for {}\\\", name.describe()));\\n\\n let raw: map_model::raw::RawMap = abstio::read_binary(abstio::path_raw_map(name), timer);\\n\\n let map = map_model::Map::create_from_raw(raw, build_ch, keep_bldg_tags, timer);\\n\\n timer.start(\\\"save map\\\");\\n\\n map.save();\\n\\n timer.stop(\\\"save map\\\");\\n\\n timer.stop(format!(\\\"Raw->Map for {}\\\", name.describe()));\\n\\n\\n\\n // TODO Just sticking this here for now\\n\\n if name.map == \\\"huge_seattle\\\" || name == &MapName::new(\\\"gb\\\", \\\"leeds\\\", \\\"huge\\\") {\\n\\n timer.start(\\\"generating city manifest\\\");\\n\\n abstio::write_binary(\\n\\n abstio::path(format!(\\n\\n \\\"system/{}/{}/city.bin\\\",\\n\",\n \"file_path\": \"importer/src/utils.rs\",\n \"rank\": 72,\n \"score\": 218093.81259018416\n },\n {\n \"content\": \"/// Build stages. First find roads that are straight across, they are either one-way or two-way.\\n\\n/// For one-way, add any right or left turns, thus completing the stage. For two-way, two\\n\\n/// stages will be added. The first stage has protected straight, and right and yield left.\\n\\n/// The second stage has protected left. Lastly, sometimes oncomming left turns can't both\\n\\n/// be protected, if this occurs the 2nd stage will have one direction protected and the\\n\\n/// other yeild and a 3rd, inverse, stage will be added which has the other direction's left\\n\\n/// protected and other yield. Finally, any turns which weren't assigned, because there\\n\\n/// are no straights or there are more than just pairs of straight intersections, are assigned a\\n\\n/// stage. These, too are handled as pairs until one remains, which is handled as a one-way.\\n\\nfn multi_way_stages(map: &Map, id: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let mut ts = new(id, map);\\n\\n let (mut right, mut left, straight, mut roads) = movements(&ts);\\n\\n let (one_way, two_way) = straight_types(&straight);\\n\\n for m in &one_way {\\n\\n let mut stage = Stage::new();\\n\\n stage.protected_movements.insert(m.clone());\\n\\n for t in turns(&m.from.id, &right) {\\n\\n stage.protected_movements.insert(t.clone());\\n\\n }\\n\\n for t in turns(&m.from.id, &left) {\\n\\n stage.protected_movements.insert(t.clone());\\n\\n }\\n\\n add_stage(&mut ts, stage);\\n\\n roads.remove(&m.from.id);\\n\\n }\\n\\n for (m1, m2) in &two_way {\\n\\n let mut stage1 = Stage::new();\\n\\n let mut stage2 = Stage::new();\\n\\n // Insert the straight movements, followed by the right and then the left.\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/lagging_green.rs\",\n \"rank\": 73,\n \"score\": 217933.71008068626\n },\n {\n \"content\": \"fn four_way_four_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\\n\\n if roads.len() != 4 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // Just to refer to these easily, label with directions. Imagine an axis-aligned four-way.\\n\\n let (north, west, south, east) = (roads[0], roads[1], roads[2], roads[3]);\\n\\n\\n\\n // Four-stage with protected lefts, right turn on red (except for the protected lefts),\\n\\n // turning cars yield to peds\\n\\n let mut ts = new(i, map);\\n\\n make_stages(\\n\\n &mut ts,\\n\\n map.config.driving_side,\\n\\n vec![\\n\\n vec![\\n\\n (vec![north, south], TurnType::Straight, PROTECTED),\\n\\n (vec![north, south], TurnType::Left, YIELD),\\n\\n (vec![north, south], TurnType::Right, PROTECTED),\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/lagging_green.rs\",\n \"rank\": 74,\n \"score\": 217933.71008068626\n },\n {\n \"content\": \"fn three_way_three_stage(map: &Map, i: IntersectionID) -> Option<ControlTrafficSignal> {\\n\\n let roads = map.get_i(i).get_sorted_incoming_roads(map);\\n\\n if roads.len() != 3 {\\n\\n return None;\\n\\n }\\n\\n let mut ts = new(i, map);\\n\\n\\n\\n // Picture a T intersection. Use turn angles to figure out the \\\"main\\\" two roads.\\n\\n let straight = ts\\n\\n .movements\\n\\n .values()\\n\\n .find(|g| g.turn_type == TurnType::Straight)?;\\n\\n let (north, south) = (straight.id.from.id, straight.id.to.id);\\n\\n let east = roads\\n\\n .into_iter()\\n\\n .find(|r| *r != north && *r != south)\\n\\n .unwrap();\\n\\n\\n\\n // Three-stage with protected lefts, right turn on red\\n\\n make_stages(\\n\",\n \"file_path\": \"map_model/src/make/traffic_signals/lagging_green.rs\",\n \"rank\": 75,\n \"score\": 217933.71008068626\n },\n {\n \"content\": \"// TODO This needs to update turn restrictions too\\n\\npub fn clip_map(map: &mut RawMap, timer: &mut Timer) {\\n\\n timer.start(\\\"clipping map to boundary\\\");\\n\\n\\n\\n // So we can use retain_btreemap without borrowing issues\\n\\n let boundary_polygon = map.boundary_polygon.clone();\\n\\n let boundary_ring = Ring::must_new(boundary_polygon.points().clone());\\n\\n\\n\\n // This is kind of indirect and slow, but first pass -- just remove roads that start or end\\n\\n // outside the boundary polygon.\\n\\n retain_btreemap(&mut map.roads, |_, r| {\\n\\n let first_in = boundary_polygon.contains_pt(r.center_points[0]);\\n\\n let last_in = boundary_polygon.contains_pt(*r.center_points.last().unwrap());\\n\\n let light_rail_ok = if r.is_light_rail() {\\n\\n // Make sure it's in the boundary somewhere\\n\\n r.center_points\\n\\n .iter()\\n\\n .any(|pt| boundary_polygon.contains_pt(*pt))\\n\\n } else {\\n\\n false\\n\\n };\\n\",\n \"file_path\": \"convert_osm/src/clip.rs\",\n \"rank\": 76,\n \"score\": 215460.2756555022\n },\n {\n \"content\": \"/// Attempt to snap separately mapped cycleways to main roads. Emit extra KML files to debug later.\\n\\npub fn snap_cycleways(map: &RawMap, timer: &mut Timer) {\\n\\n // TODO The output here is nondeterministic and I haven't figured out why. Instead of spurious\\n\\n // data diffs, just totally disable this experiment for now. Will fix when this becomes active\\n\\n // work again.\\n\\n if true {\\n\\n return;\\n\\n }\\n\\n\\n\\n let mut cycleways = BTreeMap::new();\\n\\n for shape in\\n\\n abstio::read_binary::<ExtraShapes>(map.name.city.input_path(\\\"footways.bin\\\"), timer).shapes\\n\\n {\\n\\n // Just cycleways for now. This same general strategy should later work for sidewalks,\\n\\n // tramways, and blockface parking too.\\n\\n if shape.attributes.get(\\\"highway\\\") == Some(&\\\"cycleway\\\".to_string()) {\\n\\n cycleways.insert(\\n\\n WayID(shape.attributes[osm::OSM_WAY_ID].parse().unwrap()),\\n\\n shape,\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"convert_osm/src/snappy.rs\",\n \"rank\": 77,\n \"score\": 215297.71524937204\n },\n {\n \"content\": \"pub fn find_next_file(orig: String) -> Option<String> {\\n\\n let files = list_dir(parent_path(&orig));\\n\\n files.into_iter().find(|f| *f > orig)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/io.rs\",\n \"rank\": 78,\n \"score\": 214256.2635925822\n },\n {\n \"content\": \"/// Keeps file extensions\\n\\npub fn find_prev_file(orig: String) -> Option<String> {\\n\\n let mut files = list_dir(parent_path(&orig));\\n\\n files.reverse();\\n\\n files.into_iter().find(|f| *f < orig)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/io.rs\",\n \"rank\": 79,\n \"score\": 214256.2635925822\n },\n {\n \"content\": \"/// Returns full paths\\n\\npub fn list_dir(path: String) -> Vec<String> {\\n\\n let mut files: Vec<String> = Vec::new();\\n\\n match std::fs::read_dir(&path) {\\n\\n Ok(iter) => {\\n\\n for entry in iter {\\n\\n files.push(entry.unwrap().path().to_str().unwrap().to_string());\\n\\n }\\n\\n }\\n\\n Err(ref e) if e.kind() == std::io::ErrorKind::NotFound => {}\\n\\n Err(e) => panic!(\\\"Couldn't read_dir {:?}: {}\\\", path, e),\\n\\n };\\n\\n files.sort();\\n\\n files\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstio/src/io_native.rs\",\n \"rank\": 80,\n \"score\": 214231.17874223823\n },\n {\n \"content\": \"fn add_extra_buildings(map: &mut RawMap, path: &str) -> Result<()> {\\n\\n // TODO Refactor code that just extracts polygons from geojson.\\n\\n let mut polygons = Vec::new();\\n\\n\\n\\n let bytes = abstio::slurp_file(path)?;\\n\\n let raw_string = std::str::from_utf8(&bytes)?;\\n\\n let geojson = raw_string.parse::<geojson::GeoJson>()?;\\n\\n\\n\\n if let geojson::GeoJson::FeatureCollection(collection) = geojson {\\n\\n for feature in collection.features {\\n\\n if let Some(geom) = feature.geometry {\\n\\n if let geojson::Value::Polygon(raw_pts) = geom.value {\\n\\n // TODO Handle holes, and also, refactor this!\\n\\n let gps_pts: Vec<LonLat> = raw_pts[0]\\n\\n .iter()\\n\\n .map(|pt| LonLat::new(pt[0], pt[1]))\\n\\n .collect();\\n\\n if let Some(pts) = map.gps_bounds.try_convert(&gps_pts) {\\n\\n if let Ok(ring) = Ring::new(pts) {\\n\\n polygons.push(ring.to_polygon());\\n\",\n \"file_path\": \"convert_osm/src/lib.rs\",\n \"rank\": 81,\n \"score\": 213643.00892982172\n },\n {\n \"content\": \"pub fn delete_file<I: AsRef<str>>(path: I) {\\n\\n // TODO\\n\\n warn!(\\\"Not deleting {}\\\", path.as_ref());\\n\\n}\\n\",\n \"file_path\": \"abstio/src/io_web.rs\",\n \"rank\": 82,\n \"score\": 213025.84037511263\n },\n {\n \"content\": \"/// Idempotent\\n\\npub fn delete_file<I: AsRef<str>>(path: I) {\\n\\n let path = path.as_ref();\\n\\n if std::fs::remove_file(path).is_ok() {\\n\\n println!(\\\"Deleted {}\\\", path);\\n\\n } else {\\n\\n println!(\\\"{} doesn't exist, so not deleting it\\\", path);\\n\\n }\\n\\n}\\n\\n\\n\\n// TODO I'd like to get rid of this and just use Timer.read_file, but external libraries consume\\n\\n// the reader. :\\\\\\n\\npub struct FileWithProgress {\\n\\n inner: BufReader<File>,\\n\\n\\n\\n path: String,\\n\\n processed_bytes: usize,\\n\\n total_bytes: usize,\\n\\n started_at: Instant,\\n\\n last_printed_at: Instant,\\n\\n}\\n\",\n \"file_path\": \"abstio/src/io_native.rs\",\n \"rank\": 83,\n \"score\": 213025.84037511263\n },\n {\n \"content\": \"pub fn basename<I: AsRef<str>>(path: I) -> String {\\n\\n std::path::Path::new(path.as_ref())\\n\\n .file_stem()\\n\\n .unwrap()\\n\\n .to_os_string()\\n\\n .into_string()\\n\\n .unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/utils.rs\",\n \"rank\": 84,\n \"score\": 212522.01555464056\n },\n {\n \"content\": \"pub fn prettyprint_usize(x: usize) -> String {\\n\\n let num = format!(\\\"{}\\\", x);\\n\\n let mut result = String::new();\\n\\n let mut i = num.len();\\n\\n for c in num.chars() {\\n\\n result.push(c);\\n\\n i -= 1;\\n\\n if i > 0 && i % 3 == 0 {\\n\\n result.push(',');\\n\\n }\\n\\n }\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"abstutil/src/utils.rs\",\n \"rank\": 85,\n \"score\": 211445.03094337016\n },\n {\n \"content\": \"/// Starting from some number of total people living in a polygonal area, randomly distribute them\\n\\n/// to residential buildings within that area. Returns a list of homes with the number of residents\\n\\n/// in each.\\n\\npub fn distribute_population_to_homes(\\n\\n polygon: geo::Polygon<f64>,\\n\\n population: usize,\\n\\n map: &Map,\\n\\n rng: &mut XorShiftRng,\\n\\n) -> Vec<(BuildingID, usize)> {\\n\\n let map_boundary = geo::Polygon::from(map.get_boundary_polygon().clone());\\n\\n let bldgs: Vec<map_model::BuildingID> = map\\n\\n .all_buildings()\\n\\n .into_iter()\\n\\n .filter(|b| {\\n\\n polygon.contains(&geo::Point::from(b.label_center)) && b.bldg_type.has_residents()\\n\\n })\\n\\n .map(|b| b.id)\\n\\n .collect();\\n\\n\\n\\n // If the area is partly out-of-bounds, then scale down the number of residents linearly\\n\\n // based on area of the overlapping part of the polygon.\\n\\n use geo_booleanop::boolean::BooleanOp;\\n\\n let pct_overlap = polygon.intersection(&map_boundary).unsigned_area() / polygon.unsigned_area();\\n\",\n \"file_path\": \"popdat/src/distribute_people.rs\",\n \"rank\": 86,\n \"score\": 211011.60771349963\n },\n {\n \"content\": \"// Could be caused by closing intersections\\n\\npub fn check_sidewalk_connectivity(\\n\\n ctx: &mut EventCtx,\\n\\n app: &mut App,\\n\\n cmd: EditCmd,\\n\\n) -> Option<Box<dyn State<App>>> {\\n\\n let orig_edits = app.primary.map.get_edits().clone();\\n\\n let (_, disconnected_before) =\\n\\n connectivity::find_scc(&app.primary.map, PathConstraints::Pedestrian);\\n\\n\\n\\n let mut edits = orig_edits.clone();\\n\\n edits.commands.push(cmd);\\n\\n app.primary.map.try_apply_edits(edits);\\n\\n\\n\\n let (_, disconnected_after) =\\n\\n connectivity::find_scc(&app.primary.map, PathConstraints::Pedestrian);\\n\\n app.primary.map.must_apply_edits(orig_edits);\\n\\n\\n\\n let newly_disconnected = disconnected_after\\n\\n .difference(&disconnected_before)\\n\\n .collect::<Vec<_>>();\\n\",\n \"file_path\": \"game/src/edit/validate.rs\",\n \"rank\": 87,\n \"score\": 210996.58927791816\n },\n {\n \"content\": \"/// Finalize importing of buildings, mostly by matching them to the nearest sidewalk.\\n\\npub fn make_all_buildings(\\n\\n input: &BTreeMap<osm::OsmID, RawBuilding>,\\n\\n map: &Map,\\n\\n keep_bldg_tags: bool,\\n\\n timer: &mut Timer,\\n\\n) -> Vec<Building> {\\n\\n timer.start(\\\"convert buildings\\\");\\n\\n let mut center_per_bldg: BTreeMap<osm::OsmID, HashablePt2D> = BTreeMap::new();\\n\\n let mut query: HashSet<HashablePt2D> = HashSet::new();\\n\\n timer.start_iter(\\\"get building center points\\\", input.len());\\n\\n for (id, b) in input {\\n\\n timer.next();\\n\\n let center = b.polygon.center().to_hashable();\\n\\n center_per_bldg.insert(*id, center);\\n\\n query.insert(center);\\n\\n }\\n\\n\\n\\n // equiv_pos could be a little closer, so use two buffers\\n\\n let sidewalk_buffer = Distance::meters(7.5);\\n\\n let sidewalk_pts = match_points_to_lanes(\\n\",\n \"file_path\": \"map_model/src/make/buildings.rs\",\n \"rank\": 88,\n \"score\": 209431.89156064924\n },\n {\n \"content\": \"/// This returns the pathfinding cost of crossing one road and turn. This is also expressed in\\n\\n/// units of time. It factors in the ideal time to cross the space, along with penalties for\\n\\n/// entering an access-restricted zone, taking an unprotected turn, and so on.\\n\\npub fn vehicle_cost(\\n\\n dr: DirectedRoadID,\\n\\n mvmnt: MovementID,\\n\\n constraints: PathConstraints,\\n\\n params: &RoutingParams,\\n\\n map: &Map,\\n\\n) -> Duration {\\n\\n // TODO Creating the consolidated polyline sometimes fails. It's rare, so just workaround\\n\\n // temporarily by pretending the turn is 1m long.\\n\\n let (mvmnt_length, mvmnt_turn_type) = mvmnt\\n\\n .get(map)\\n\\n .map(|m| (m.geom.length(), m.turn_type))\\n\\n .unwrap_or((Distance::meters(1.0), TurnType::Straight));\\n\\n let max_speed = match constraints {\\n\\n PathConstraints::Car | PathConstraints::Bus | PathConstraints::Train => None,\\n\\n PathConstraints::Bike => Some(crate::MAX_BIKE_SPEED),\\n\\n PathConstraints::Pedestrian => unreachable!(),\\n\\n };\\n\\n let t1 = map.get_r(dr.id).center_pts.length()\\n\\n / Traversable::max_speed_along_road(dr, max_speed, constraints, map);\\n\",\n \"file_path\": \"map_model/src/pathfind/vehicles.rs\",\n \"rank\": 89,\n \"score\": 209425.93572295824\n },\n {\n \"content\": \"// Returns a legend\\n\\npub fn make_heatmap(\\n\\n ctx: &mut EventCtx,\\n\\n batch: &mut GeomBatch,\\n\\n bounds: &Bounds,\\n\\n pts: Vec<Pt2D>,\\n\\n opts: &HeatmapOptions,\\n\\n) -> Widget {\\n\\n // 7 colors, 8 labels\\n\\n let num_colors = 7;\\n\\n let gradient = match opts.color_scheme.as_ref() {\\n\\n \\\"Turbo\\\" => colorous::TURBO,\\n\\n \\\"Inferno\\\" => colorous::INFERNO,\\n\\n \\\"Warm\\\" => colorous::WARM,\\n\\n \\\"Cool\\\" => colorous::COOL,\\n\\n \\\"Oranges\\\" => colorous::ORANGES,\\n\\n \\\"Spectral\\\" => colorous::SPECTRAL,\\n\\n _ => unreachable!(),\\n\\n };\\n\\n let colors: Vec<Color> = (0..num_colors)\\n\\n .map(|i| {\\n\",\n \"file_path\": \"map_gui/src/tools/heatmap.rs\",\n \"rank\": 90,\n \"score\": 209425.93572295824\n },\n {\n \"content\": \"/// Describe all public transit routes and keep under version control to spot diffs easily.\\n\\nfn dump_route_goldenfile(map: &map_model::Map) -> Result<()> {\\n\\n let path = abstio::path(format!(\\n\\n \\\"route_goldenfiles/{}.txt\\\",\\n\\n map.get_name().as_filename()\\n\\n ));\\n\\n let mut f = File::create(path)?;\\n\\n for br in map.all_bus_routes() {\\n\\n writeln!(\\n\\n f,\\n\\n \\\"{} from {} to {:?}\\\",\\n\\n br.osm_rel_id, br.start, br.end_border\\n\\n )?;\\n\\n for bs in &br.stops {\\n\\n let bs = map.get_bs(*bs);\\n\\n writeln!(\\n\\n f,\\n\\n \\\" {}: {} driving, {} sidewalk\\\",\\n\\n bs.name, bs.driving_pos, bs.sidewalk_pos\\n\\n )?;\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/src/main.rs\",\n \"rank\": 91,\n \"score\": 209307.28641081753\n },\n {\n \"content\": \"fn validate_restrictions(map: &Map, steps: &Vec<PathStep>) {\\n\\n for triple in steps.windows(5) {\\n\\n if let (PathStep::Lane(l1), PathStep::Lane(l2), PathStep::Lane(l3)) =\\n\\n (triple[0], triple[2], triple[4])\\n\\n {\\n\\n let from = map.get_parent(l1);\\n\\n let via = map.get_l(l2).parent;\\n\\n let to = map.get_l(l3).parent;\\n\\n\\n\\n for (dont_via, dont_to) in &from.complicated_turn_restrictions {\\n\\n if via == *dont_via && to == *dont_to {\\n\\n panic!(\\n\\n \\\"Some path does illegal uber-turn: {} -> {} -> {}\\\",\\n\\n l1, l2, l3\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/pathfind/v1.rs\",\n \"rank\": 92,\n \"score\": 208646.8602802612\n },\n {\n \"content\": \"fn validate_continuity(map: &Map, steps: &Vec<PathStep>) {\\n\\n if steps.is_empty() {\\n\\n panic!(\\\"Empty path\\\");\\n\\n }\\n\\n for pair in steps.windows(2) {\\n\\n let from = match pair[0] {\\n\\n PathStep::Lane(id) => map.get_l(id).last_pt(),\\n\\n PathStep::ContraflowLane(id) => map.get_l(id).first_pt(),\\n\\n PathStep::Turn(id) => map.get_t(id).geom.last_pt(),\\n\\n };\\n\\n let to = match pair[1] {\\n\\n PathStep::Lane(id) => map.get_l(id).first_pt(),\\n\\n PathStep::ContraflowLane(id) => map.get_l(id).last_pt(),\\n\\n PathStep::Turn(id) => map.get_t(id).geom.first_pt(),\\n\\n };\\n\\n let len = from.dist_to(to);\\n\\n if len > EPSILON_DIST {\\n\\n println!(\\\"All steps in invalid path:\\\");\\n\\n for s in steps {\\n\\n match s {\\n\",\n \"file_path\": \"map_model/src/pathfind/v1.rs\",\n \"rank\": 93,\n \"score\": 208646.8602802612\n },\n {\n \"content\": \"fn make_bike_lane_scenario(map: &Map) -> ScenarioGenerator {\\n\\n let mut s = ScenarioGenerator::empty(\\\"car vs bike contention\\\");\\n\\n s.border_spawn_over_time.push(BorderSpawnOverTime {\\n\\n num_peds: 0,\\n\\n num_cars: 10,\\n\\n num_bikes: 10,\\n\\n percent_use_transit: 0.0,\\n\\n start_time: Time::START_OF_DAY,\\n\\n stop_time: Time::START_OF_DAY + Duration::seconds(10.0),\\n\\n start_from_border: map.find_i_by_osm_id(osm::NodeID(3005680098)).unwrap(),\\n\\n goal: Some(TripEndpoint::Bldg(\\n\\n map.find_b_by_osm_id(bldg(217699501)).unwrap(),\\n\\n )),\\n\\n });\\n\\n s\\n\\n}\\n\\n\\n\",\n \"file_path\": \"game/src/sandbox/gameplay/tutorial.rs\",\n \"rank\": 94,\n \"score\": 208502.51720099265\n },\n {\n \"content\": \"/// Some roads might be totally disconnected from the largest clump because of how the map's\\n\\n/// bounding polygon was drawn, or bad map data, or which roads are filtered from OSM. Remove them.\\n\\npub fn remove_disconnected_roads(map: &mut RawMap, timer: &mut Timer) {\\n\\n timer.start(\\\"removing disconnected roads\\\");\\n\\n // This is a simple floodfill, not Tarjan's. Assumes all roads bidirectional.\\n\\n // All the usizes are indices into the original list of roads\\n\\n\\n\\n let mut next_roads: MultiMap<osm::NodeID, OriginalRoad> = MultiMap::new();\\n\\n for id in map.roads.keys() {\\n\\n next_roads.insert(id.i1, *id);\\n\\n next_roads.insert(id.i2, *id);\\n\\n }\\n\\n\\n\\n let mut partitions: Vec<Vec<OriginalRoad>> = Vec::new();\\n\\n let mut unvisited_roads: BTreeSet<OriginalRoad> = map\\n\\n .roads\\n\\n .iter()\\n\\n .filter_map(|(id, r)| if r.is_light_rail() { None } else { Some(*id) })\\n\\n .collect();\\n\\n\\n\\n while !unvisited_roads.is_empty() {\\n\\n let mut queue_roads: Vec<OriginalRoad> = vec![*unvisited_roads.iter().next().unwrap()];\\n\",\n \"file_path\": \"map_model/src/make/remove_disconnected.rs\",\n \"rank\": 95,\n \"score\": 207724.1699086582\n },\n {\n \"content\": \"/// Merge tiny \\\"roads\\\" that're actually just part of a complicated intersection. Returns all\\n\\n/// surviving intersections adjacent to one of these merged roads.\\n\\npub fn merge_short_roads(map: &mut RawMap) -> BTreeSet<NodeID> {\\n\\n let mut merged = BTreeSet::new();\\n\\n\\n\\n let mut queue: VecDeque<OriginalRoad> = VecDeque::new();\\n\\n for r in map.roads.keys() {\\n\\n queue.push_back(*r);\\n\\n\\n\\n // TODO Remove after improving this heuristic.\\n\\n if false && connects_dual_carriageway(map, r) {\\n\\n debug!(\\\"{} connects dual carriageways\\\", r);\\n\\n }\\n\\n }\\n\\n\\n\\n while !queue.is_empty() {\\n\\n let id = queue.pop_front().unwrap();\\n\\n\\n\\n // The road might've been deleted\\n\\n if !map.roads.contains_key(&id) {\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"map_model/src/make/merge_intersections.rs\",\n \"rank\": 96,\n \"score\": 207310.23754765777\n },\n {\n \"content\": \"pub fn path_all_saves(name: &MapName, edits_name: &str, run_name: &str) -> String {\\n\\n path(format!(\\n\\n \\\"player/saves/{}/{}/{}/{}_{}\\\",\\n\\n name.city.country, name.city.city, name.map, edits_name, run_name\\n\\n ))\\n\\n}\\n\\n\\n\\n// Input data (For developers to build maps, not needed at runtime)\\n\\n\\n\",\n \"file_path\": \"abstio/src/abst_paths.rs\",\n \"rank\": 97,\n \"score\": 206406.1063114886\n },\n {\n \"content\": \"pub fn pathfind_avoiding_roads(\\n\\n req: PathRequest,\\n\\n avoid: BTreeSet<RoadID>,\\n\\n map: &Map,\\n\\n) -> Option<(Path, Duration)> {\\n\\n assert_eq!(req.constraints, PathConstraints::Car);\\n\\n let mut graph = DiGraphMap::new();\\n\\n for dr in map.all_directed_roads_for(req.constraints) {\\n\\n if avoid.contains(&dr.id) {\\n\\n continue;\\n\\n }\\n\\n for mvmnt in map.get_movements_for(dr, req.constraints) {\\n\\n graph.add_edge(mvmnt.from, mvmnt.to, mvmnt);\\n\\n }\\n\\n }\\n\\n\\n\\n calc_path(graph, req, map.routing_params(), map)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/pathfind/dijkstra.rs\",\n \"rank\": 98,\n \"score\": 205473.2276849893\n },\n {\n \"content\": \"pub fn build_graph_for_vehicles(\\n\\n map: &Map,\\n\\n constraints: PathConstraints,\\n\\n) -> DiGraphMap<DirectedRoadID, MovementID> {\\n\\n let mut graph = DiGraphMap::new();\\n\\n for dr in map.all_directed_roads_for(constraints) {\\n\\n for mvmnt in map.get_movements_for(dr, constraints) {\\n\\n graph.add_edge(mvmnt.from, mvmnt.to, mvmnt);\\n\\n }\\n\\n }\\n\\n graph\\n\\n}\\n\\n\\n\",\n \"file_path\": \"map_model/src/pathfind/dijkstra.rs\",\n \"rank\": 99,\n \"score\": 205473.2276849893\n }\n]","isConversational":false}}},{"rowIdx":1986,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/objects/mod.rs"},"repo_name":{"kind":"string","value":"hinton-lang/hinton"},"commit":{"kind":"string","value":"796ae395ce45240676875b7ddeddb9b5e54016b2"},"file_code":{"kind":"string","value":"use crate::built_in::{NativeBoundMethod, NativeFn};\nuse crate::core::chunk::Chunk;\nuse crate::objects::class_obj::*;\nuse crate::objects::dictionary_obj::*;\nuse crate::objects::iter_obj::IterObject;\nuse std::cell::RefCell;\nuse std::fmt;\nuse std::fmt::Formatter;\nuse std::rc::Rc;\n\npub mod class_obj;\npub mod dictionary_obj;\npub mod indexing;\npub mod iter_obj;\nmod native_operations;\n\n#[derive(Clone)]\npub struct RangeObject {\n pub min: i64,\n pub max: i64,\n}\n\n#[derive(Clone)]\npub struct FuncObject {\n pub defaults: Vec<Object>,\n pub min_arity: u8,\n pub max_arity: u8,\n pub chunk: Chunk,\n pub name: String,\n pub up_val_count: usize,\n}\n\nimpl Default for FuncObject {\n fn default() -> Self {\n Self {\n defaults: vec![],\n min_arity: 0,\n max_arity: 0,\n chunk: Chunk::new(),\n name: String::from(\"\"),\n up_val_count: 0,\n }\n }\n}\n\nimpl fmt::Display for FuncObject {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n if self.name == \"fn\" {\n write!(f, \"<Func '<lambda>' at {:p}>\", &*self as *const _)\n } else {\n write!(f, \"<Func '{}' at {:p}>\", &self.name, &*self as *const _)\n }\n }\n}\n\nimpl FuncObject {\n pub fn bound_method(f: Rc<RefCell<FuncObject>>, i: Rc<RefCell<InstanceObject>>) -> Object {\n Object::BoundMethod(BoundMethod {\n receiver: i,\n method: ClosureObject {\n function: f,\n up_values: vec![],\n },\n })\n }\n}\n\n#[derive(Clone)]\npub struct NativeFuncObj {\n pub name: String,\n pub min_arity: u8,\n pub max_arity: u8,\n pub body: NativeFn,\n}\n\nimpl fmt::Display for NativeFuncObj {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n write!(f, \"<Func '{}' at {:p}>\", self.name, &self.body as *const _)\n }\n}\n\n#[derive(Clone)]\npub struct NativeMethodObj {\n pub class_name: String,\n pub method_name: String,\n pub value: Box<Object>,\n pub min_arity: u8,\n pub max_arity: u8,\n pub body: NativeBoundMethod,\n}\n\nimpl fmt::Display for NativeMethodObj {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n write!(\n f,\n \"<Method '{}.{}' at {:p}>\",\n self.class_name, self.method_name, &self.body as *const _\n )\n }\n}\n\n#[derive(Clone)]\npub struct ClosureObject {\n pub function: Rc<RefCell<FuncObject>>,\n pub up_values: Vec<Rc<RefCell<UpValRef>>>,\n}\n\nimpl fmt::Display for ClosureObject {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n write!(f, \"{}\", self.function.borrow())\n }\n}\n\nimpl ClosureObject {\n pub fn into_bound_method(self, c: Rc<RefCell<InstanceObject>>) -> Object {\n Object::BoundMethod(BoundMethod {\n receiver: c,\n method: self,\n })\n }\n}\n\n#[derive(Clone)]\npub enum UpValRef {\n Open(usize),\n Closed(Object),\n}\n\nimpl UpValRef {\n \n pub fn is_open_at(&self, index: usize) -> bool {\n match self {\n UpValRef::Closed(_) => false,\n UpValRef::Open(i) => *i == index,\n }\n }\n}\n\n#[derive(Clone)]\npub enum Object {\n Array(Rc<RefCell<Vec<Object>>>),\n Bool(bool),\n BoundMethod(BoundMethod),\n BoundNativeMethod(NativeMethodObj),\n Class(Rc<RefCell<ClassObject>>),\n Closure(ClosureObject),\n Dict(DictObject),\n Float(f64),\n Function(Rc<RefCell<FuncObject>>),\n Instance(Rc<RefCell<InstanceObject>>),\n Int(i64),\n Iter(Rc<RefCell<IterObject>>),\n Native(Box<NativeFuncObj>),\n Null,\n Range(RangeObject),\n String(String),\n Tuple(Rc<Vec<Object>>),\n}\n\nimpl From<NativeFuncObj> for Object {\n fn from(o: NativeFuncObj) -> Self {\n Object::Native(Box::new(o))\n }\n}\n\nimpl From<NativeMethodObj> for Object {\n fn from(o: NativeMethodObj) -> Self {\n Object::BoundNativeMethod(o)\n }\n}\n\nimpl From<FuncObject> for Object {\n fn from(o: FuncObject) -> Self {\n Object::Function(Rc::new(RefCell::new(o)))\n }\n}\n\nimpl From<ClassObject> for Object {\n fn from(o: ClassObject) -> Self {\n Object::Class(Rc::new(RefCell::new(o)))\n }\n}\n\nimpl From<InstanceObject> for Object {\n fn from(o: InstanceObject) -> Self {\n Object::Instance(Rc::new(RefCell::new(o)))\n }\n}\n\nimpl From<String> for Object {\n fn from(o: String) -> Self {\n Object::String(o)\n }\n}\n\nimpl From<&str> for Object {\n fn from(o: &str) -> Self {\n Object::String(o.to_string())\n }\n}\n\nimpl From<usize> for Object {\n fn from(o: usize) -> Self {\n Object::Int(o as i64)\n }\n}\n\npub fn obj_vectors_equal(v1: &[Object], v2: &[Object]) -> bool {\n if v1.len() != v2.len() {\n false\n } else {\n for (i, o) in v1.iter().enumerate() {\n if o != &v2[i] {\n return false;\n }\n }\n true\n }\n}\n\nimpl Object {\n \n pub fn type_name(&self) -> String {\n return match self {\n Self::Array(_) => String::from(\"Array\"),\n Self::Bool(_) => String::from(\"Bool\"),\n Self::Dict(_) => String::from(\"Dict\"),\n Self::Float(_) => String::from(\"Float\"),\n Self::Function(_)\n | Self::Native(_)\n | Self::Closure(_)\n | Self::BoundMethod(_)\n | Self::BoundNativeMethod(_) => String::from(\"Function\"),\n Self::Int(_) => String::from(\"Int\"),\n Self::Iter(_) => String::from(\"Iter\"),\n Self::Null => String::from(\"Null\"),\n Self::Range(_) => String::from(\"Range\"),\n Self::String(_) => String::from(\"String\"),\n Self::Tuple(_) => String::from(\"Tuple\"),\n Self::Class(c) => c.borrow().name.clone(),\n Self::Instance(i) => i.borrow().class.borrow().name.clone(),\n };\n }\n\n \n pub fn is_int(&self) -> bool {\n matches!(self, Object::Int(_))\n }\n\n \n pub fn is_float(&self) -> bool {\n matches!(self, Object::Float(_))\n }\n\n \n pub fn is_bool(&self) -> bool {\n matches!(self, Object::Bool(_))\n }\n\n \n pub fn is_falsey(&self) -> bool {\n match self {\n Self::Null => true,\n Self::Bool(val) => !val,\n Self::Int(x) if *x == 0i64 => true,\n Self::Float(x) if *x == 0f64 => true,\n _ => false,\n }\n }\n\n \n pub fn as_int(&self) -> Option<i64> {\n match self {\n Object::Int(v) => Some(*v),\n Object::Bool(b) => {\n if *b {\n Some(1i64)\n } else {\n Some(0i64)\n }\n }\n _ => None,\n }\n }\n\n \n pub fn as_float(&self) -> Option<f64> {\n match self {\n Object::Float(v) => Some(*v),\n _ => None,\n }\n }\n\n \n pub fn as_bool(&self) -> Option<bool> {\n match self {\n Object::Bool(v) => Some(*v),\n _ => None,\n }\n }\n\n \n \n #[cfg(feature = \"show_bytecode\")]\n pub fn as_function(&self) -> Option<&Rc<RefCell<FuncObject>>> {\n match self {\n Object::Function(v) => Some(v),\n _ => None,\n }\n }\n}\n\nimpl<'a> fmt::Display for Object {\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n match *self {\n Object::Int(ref inner) => write!(f, \"\\x1b[38;5;81m{}\\x1b[0m\", inner),\n Object::Instance(ref inner) => write!(f, \"{}\", inner.borrow()),\n Object::Native(ref inner) => write!(f, \"{}\", inner),\n Object::String(ref inner) => write!(f, \"{}\", inner),\n Object::Bool(inner) => write!(f, \"\\x1b[38;5;3m{}\\x1b[0m\", if inner { \"true\" } else { \"false\" }),\n Object::Iter(ref inner) => write!(f, \"{}\", inner.borrow()),\n Object::Function(ref inner) => write!(f, \"{}\", inner.borrow()),\n Object::Closure(ref inner) => write!(f, \"{}\", inner),\n Object::BoundMethod(ref inner) => write!(f, \"{}\", inner),\n Object::BoundNativeMethod(ref inner) => write!(f, \"{}\", inner),\n Object::Null => f.write_str(\"\\x1b[37;1mnull\\x1b[0m\"),\n Object::Dict(ref inner) => write!(f, \"{}\", inner),\n Object::Float(ref inner) => {\n let fractional = if inner.fract() == 0.0 { \".0\" } else { \"\" };\n write!(f, \"\\x1b[38;5;81m{}{}\\x1b[0m\", inner, fractional)\n }\n Object::Range(ref inner) => {\n write!(\n f,\n \"[\\x1b[38;5;81m{}\\x1b[0m..\\x1b[38;5;81m{}\\x1b[0m]\",\n inner.min, inner.max\n )\n }\n Object::Class(ref inner) => {\n let prt_str = format!(\"{:p}\", &*inner.borrow() as *const _);\n fmt::Display::fmt(&format!(\"<Class '{}' at {}>\", inner.borrow().name, prt_str), f)\n }\n Object::Array(ref inner) => {\n let arr = &inner.borrow();\n\n let mut arr_str = String::from(\"[\");\n for (idx, obj) in arr.iter().enumerate() {\n if idx == arr.len() - 1 {\n arr_str += &(format!(\"{}\", obj))[..]\n } else {\n arr_str += &(format!(\"{}, \", obj))[..];\n }\n }\n arr_str += \"]\";\n\n write!(f, \"{}\", arr_str)\n }\n Object::Tuple(ref inner) => {\n let mut arr_str = String::from(\"(\");\n for (idx, obj) in inner.iter().enumerate() {\n if idx == inner.len() - 1 {\n arr_str += &(format!(\"{}\", obj))[..]\n } else {\n arr_str += &(format!(\"{}, \", obj))[..];\n }\n }\n arr_str += \")\";\n\n write!(f, \"{}\", arr_str)\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::built_in::{NativeBoundMethod, NativeFn};\nuse crate::core::chunk::Chunk;\nuse crate::objects::class_obj::*;\nuse crate::objects::dictionary_obj::*;\nuse crate::objects::iter_obj::IterObject;\nuse std::cell::RefCell;\nuse std::fmt;\nuse std::fmt::Formatter;\nuse std::rc::Rc;\n\npub mod class_obj;\npub mod dictionary_obj;\npub mod indexing;\npub mod iter_obj;\nmod native_operations;\n\n#[derive(Clone)]\npub struct RangeObject {\n pub min: i64,\n pub max: i64,\n}\n\n#[derive(Clone)]\npub struct FuncObject {\n pub defaults: Vec<Object>,\n pub min_arity: u8,\n pub max_arity: u8,\n pub chunk: Chunk,\n pub name: String,\n pub up_val_count: usize,\n}\n\nimpl Default for FuncObject {\n fn default() -> Self {\n Self {\n defaults: vec![],\n min_arity: 0,\n max_arity: 0,\n chunk: Chunk::new(),\n name: String::from(\"\"),\n up_val_count: 0,\n }\n }\n}\n\nimpl fmt::Display for FuncObject {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n if self.name == \"fn\" {\n write!(f, \"<Func '<lambda>' at {:p}>\", &*self as *const _)\n } else {\n write!(f, \"<Func '{}' at {:p}>\", &self.name, &*self as *const _)\n }\n }\n}\n\nimpl FuncObject {\n pub fn bound_method(f: Rc<RefCell<FuncObject>>, i: Rc<RefCell<InstanceObject>>) -> Object {\n Object::BoundMethod(BoundMethod {\n receiver: i,\n method: ClosureObject {\n function: f,\n up_values: vec![],\n },\n })\n }\n}\n\n#[derive(Clone)]\npub struct NativeFuncObj {\n pub name: String,\n pub min_arity: u8,\n pub max_arity: u8,\n pub body: NativeFn,\n}\n\nimpl fmt::Display for NativeFuncObj {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n write!(f, \"<Func '{}' at {:p}>\", self.name, &self.body as *const _)\n }\n}\n\n#[derive(Clone)]\npub struct NativeMethodObj {\n pub class_name: String,\n pub method_name: String,\n pub value: Box<Object>,\n pub min_arity: u8,\n pub max_arity: u8,\n pub body: NativeBoundMethod,\n}\n\nimpl fmt::Display for NativeMethodObj {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n write!(\n f,\n \"<Method '{}.{}' at {:p}>\",\n self.class_name, self.method_name, &self.body as *const _\n )\n }\n}\n\n#[derive(Clone)]\npub struct ClosureObject {\n pub function: Rc<RefCell<FuncObject>>,\n pub up_values: Vec<Rc<RefCell<UpValRef>>>,\n}\n\nimpl fmt::Display for ClosureObject {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), fmt::Error> {\n write!(f, \"{}\", self.function.borrow())\n }\n}\n\nimpl ClosureObject {\n "},"suffix":{"kind":"string","value":"\n}\n\n#[derive(Clone)]\npub enum UpValRef {\n Open(usize),\n Closed(Object),\n}\n\nimpl UpValRef {\n \n pub fn is_open_at(&self, index: usize) -> bool {\n match self {\n UpValRef::Closed(_) => false,\n UpValRef::Open(i) => *i == index,\n }\n }\n}\n\n#[derive(Clone)]\npub enum Object {\n Array(Rc<RefCell<Vec<Object>>>),\n Bool(bool),\n BoundMethod(BoundMethod),\n BoundNativeMethod(NativeMethodObj),\n Class(Rc<RefCell<ClassObject>>),\n Closure(ClosureObject),\n Dict(DictObject),\n Float(f64),\n Function(Rc<RefCell<FuncObject>>),\n Instance(Rc<RefCell<InstanceObject>>),\n Int(i64),\n Iter(Rc<RefCell<IterObject>>),\n Native(Box<NativeFuncObj>),\n Null,\n Range(RangeObject),\n String(String),\n Tuple(Rc<Vec<Object>>),\n}\n\nimpl From<NativeFuncObj> for Object {\n fn from(o: NativeFuncObj) -> Self {\n Object::Native(Box::new(o))\n }\n}\n\nimpl From<NativeMethodObj> for Object {\n fn from(o: NativeMethodObj) -> Self {\n Object::BoundNativeMethod(o)\n }\n}\n\nimpl From<FuncObject> for Object {\n fn from(o: FuncObject) -> Self {\n Object::Function(Rc::new(RefCell::new(o)))\n }\n}\n\nimpl From<ClassObject> for Object {\n fn from(o: ClassObject) -> Self {\n Object::Class(Rc::new(RefCell::new(o)))\n }\n}\n\nimpl From<InstanceObject> for Object {\n fn from(o: InstanceObject) -> Self {\n Object::Instance(Rc::new(RefCell::new(o)))\n }\n}\n\nimpl From<String> for Object {\n fn from(o: String) -> Self {\n Object::String(o)\n }\n}\n\nimpl From<&str> for Object {\n fn from(o: &str) -> Self {\n Object::String(o.to_string())\n }\n}\n\nimpl From<usize> for Object {\n fn from(o: usize) -> Self {\n Object::Int(o as i64)\n }\n}\n\npub fn obj_vectors_equal(v1: &[Object], v2: &[Object]) -> bool {\n if v1.len() != v2.len() {\n false\n } else {\n for (i, o) in v1.iter().enumerate() {\n if o != &v2[i] {\n return false;\n }\n }\n true\n }\n}\n\nimpl Object {\n \n pub fn type_name(&self) -> String {\n return match self {\n Self::Array(_) => String::from(\"Array\"),\n Self::Bool(_) => String::from(\"Bool\"),\n Self::Dict(_) => String::from(\"Dict\"),\n Self::Float(_) => String::from(\"Float\"),\n Self::Function(_)\n | Self::Native(_)\n | Self::Closure(_)\n | Self::BoundMethod(_)\n | Self::BoundNativeMethod(_) => String::from(\"Function\"),\n Self::Int(_) => String::from(\"Int\"),\n Self::Iter(_) => String::from(\"Iter\"),\n Self::Null => String::from(\"Null\"),\n Self::Range(_) => String::from(\"Range\"),\n Self::String(_) => String::from(\"String\"),\n Self::Tuple(_) => String::from(\"Tuple\"),\n Self::Class(c) => c.borrow().name.clone(),\n Self::Instance(i) => i.borrow().class.borrow().name.clone(),\n };\n }\n\n \n pub fn is_int(&self) -> bool {\n matches!(self, Object::Int(_))\n }\n\n \n pub fn is_float(&self) -> bool {\n matches!(self, Object::Float(_))\n }\n\n \n pub fn is_bool(&self) -> bool {\n matches!(self, Object::Bool(_))\n }\n\n \n pub fn is_falsey(&self) -> bool {\n match self {\n Self::Null => true,\n Self::Bool(val) => !val,\n Self::Int(x) if *x == 0i64 => true,\n Self::Float(x) if *x == 0f64 => true,\n _ => false,\n }\n }\n\n \n pub fn as_int(&self) -> Option<i64> {\n match self {\n Object::Int(v) => Some(*v),\n Object::Bool(b) => {\n if *b {\n Some(1i64)\n } else {\n Some(0i64)\n }\n }\n _ => None,\n }\n }\n\n \n pub fn as_float(&self) -> Option<f64> {\n match self {\n Object::Float(v) => Some(*v),\n _ => None,\n }\n }\n\n \n pub fn as_bool(&self) -> Option<bool> {\n match self {\n Object::Bool(v) => Some(*v),\n _ => None,\n }\n }\n\n \n \n #[cfg(feature = \"show_bytecode\")]\n pub fn as_function(&self) -> Option<&Rc<RefCell<FuncObject>>> {\n match self {\n Object::Function(v) => Some(v),\n _ => None,\n }\n }\n}\n\nimpl<'a> fmt::Display for Object {\n fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n match *self {\n Object::Int(ref inner) => write!(f, \"\\x1b[38;5;81m{}\\x1b[0m\", inner),\n Object::Instance(ref inner) => write!(f, \"{}\", inner.borrow()),\n Object::Native(ref inner) => write!(f, \"{}\", inner),\n Object::String(ref inner) => write!(f, \"{}\", inner),\n Object::Bool(inner) => write!(f, \"\\x1b[38;5;3m{}\\x1b[0m\", if inner { \"true\" } else { \"false\" }),\n Object::Iter(ref inner) => write!(f, \"{}\", inner.borrow()),\n Object::Function(ref inner) => write!(f, \"{}\", inner.borrow()),\n Object::Closure(ref inner) => write!(f, \"{}\", inner),\n Object::BoundMethod(ref inner) => write!(f, \"{}\", inner),\n Object::BoundNativeMethod(ref inner) => write!(f, \"{}\", inner),\n Object::Null => f.write_str(\"\\x1b[37;1mnull\\x1b[0m\"),\n Object::Dict(ref inner) => write!(f, \"{}\", inner),\n Object::Float(ref inner) => {\n let fractional = if inner.fract() == 0.0 { \".0\" } else { \"\" };\n write!(f, \"\\x1b[38;5;81m{}{}\\x1b[0m\", inner, fractional)\n }\n Object::Range(ref inner) => {\n write!(\n f,\n \"[\\x1b[38;5;81m{}\\x1b[0m..\\x1b[38;5;81m{}\\x1b[0m]\",\n inner.min, inner.max\n )\n }\n Object::Class(ref inner) => {\n let prt_str = format!(\"{:p}\", &*inner.borrow() as *const _);\n fmt::Display::fmt(&format!(\"<Class '{}' at {}>\", inner.borrow().name, prt_str), f)\n }\n Object::Array(ref inner) => {\n let arr = &inner.borrow();\n\n let mut arr_str = String::from(\"[\");\n for (idx, obj) in arr.iter().enumerate() {\n if idx == arr.len() - 1 {\n arr_str += &(format!(\"{}\", obj))[..]\n } else {\n arr_str += &(format!(\"{}, \", obj))[..];\n }\n }\n arr_str += \"]\";\n\n write!(f, \"{}\", arr_str)\n }\n Object::Tuple(ref inner) => {\n let mut arr_str = String::from(\"(\");\n for (idx, obj) in inner.iter().enumerate() {\n if idx == inner.len() - 1 {\n arr_str += &(format!(\"{}\", obj))[..]\n } else {\n arr_str += &(format!(\"{}, \", obj))[..];\n }\n }\n arr_str += \")\";\n\n write!(f, \"{}\", arr_str)\n }\n }\n }\n}\n"},"middle":{"kind":"string","value":"pub fn into_bound_method(self, c: Rc<RefCell<InstanceObject>>) -> Object {\n Object::BoundMethod(BoundMethod {\n receiver: c,\n method: self,\n })\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[cfg(feature = \"show_bytecode\")]\n\npub fn disassemble_func_scope(chunk: &Chunk, natives: &[String], primitives: &[String], name: &str) {\n\n // prints this chunk's name\n\n println!(\"==== {} ====\", name);\n\n\n\n let mut current_line = 0;\n\n\n\n let mut idx = 0;\n\n while idx < chunk.len() {\n\n let code = chunk.get_byte(idx);\n\n let line_info = chunk.get_line_info(idx);\n\n\n\n // Prints a line number or a vertical bar indicating that the\n\n // current instruction is in the same line as the previous one.\n\n if line_info.0 != current_line {\n\n print!(\"{:>05}\\t\", line_info.0);\n\n current_line = line_info.0;\n\n } else {\n\n print!(\" |\\t\")\n\n }\n\n\n","file_path":"src/core/bytecode.rs","rank":0,"score":264353.06332231953},{"content":"/// Gets the length of a Hinton string.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::from(verify_string_object!(this, \"len\").len()))\n\n}\n\n\n","file_path":"src/built_in/primitives/string.rs","rank":1,"score":241079.48090958377},{"content":"/// Creates a copy of a string and lowercase it.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn to_lower(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::from(\n\n verify_string_object!(this, \"to_lower\").to_lowercase(),\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/string.rs","rank":2,"score":241079.48090958374},{"content":"/// Converts a Hinton integer into a Hinton string.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn to_string(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::from(format!(\"{}\", verify_int_object!(this, \"to_string\"))))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":3,"score":241079.3467798797},{"content":"/// Takes an i64 integer and converts it into an object index. This allows indexing objects with\n\n/// negative integers.\n\n///\n\n/// # Parameters\n\n/// - `x`: The positive or negative index.\n\n/// - `len`: The length of the object.\n\n///\n\n/// # Returns\n\n/// - `Option<usize>`: Return Some(usize) if the index is within the bounds of the object's length\n\n/// or `None` otherwise.\n\npub fn to_bounded_index(x: i64, len: usize) -> Option<usize> {\n\n if x >= 0 && (x as usize) < len {\n\n Some(x as usize)\n\n } else if x < 0 && (i64::abs(x) as usize <= len) {\n\n Some(len - i64::abs(x) as usize)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"src/objects/indexing.rs","rank":4,"score":236941.6648821286},{"content":"/// Get the ith character in a Hinton string.\n\n///\n\n/// # Parameters\n\n/// - `str`: A reference to the underlying `String` in a Hinton string.\n\n/// - `index`: A Hinton object that will serve as the index of the string. For example, this object\n\n/// could be a Hinton integer, or a Hinton range.\n\n///\n\n/// # Returns\n\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\n\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the string.\n\nfn subscript_string(str: &str, index: &Object) -> Result<Object, ObjectOprErrType> {\n\n match index {\n\n // Indexing type: String[Int]\n\n Object::Int(idx) => {\n\n let chars: Vec<char> = str.chars().collect();\n\n\n\n if let Some(pos) = to_bounded_index(*idx, chars.len()) {\n\n if let Some(val) = chars.get(pos) {\n\n return Ok(Object::from(val.to_string()));\n\n }\n\n }\n\n }\n\n // Indexing type: String[Bool]\n\n Object::Bool(val) => {\n\n let chars: Vec<char> = str.chars().collect();\n\n let pos = (if *val { 1 } else { 0 }) as usize;\n\n\n\n if let Some(val) = chars.get(pos) {\n\n return Ok(Object::from(val.to_string()));\n\n }\n","file_path":"src/objects/indexing.rs","rank":5,"score":223169.87398436735},{"content":"/// Gets the index of the first occurrence of an object in this Hinton array.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn index_of(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\n\n let obj = args[0].clone();\n\n\n\n match verify_array_object!(this, \"index_of\")\n\n .borrow_mut()\n\n .iter()\n\n .position(|x| x == &obj)\n\n {\n\n Some(i) => vm.push_stack(Object::Int(i as i64)),\n\n None => vm.push_stack(Object::Null),\n\n }\n\n}\n\n\n","file_path":"src/built_in/primitives/array.rs","rank":6,"score":221002.62947397554},{"content":"/// Gets the index of the first occurrence of an object in this Hinton tuple.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The tuple object.\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn index_of(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\n\n let obj = args[0].clone();\n\n\n\n match verify_tuple_object!(this, \"index_of\")\n\n .iter()\n\n .position(|x| x == &obj)\n\n {\n\n Some(i) => vm.push_stack(Object::Int(i as i64)),\n\n None => vm.push_stack(Object::Null),\n\n }\n\n}\n\n\n","file_path":"src/built_in/primitives/tuple.rs","rank":7,"score":221002.62947397554},{"content":"/// Checks if a string starts with another string.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn starts_with(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\n\n match args[0].clone() {\n\n Object::String(s) => vm.push_stack(Object::Bool(\n\n verify_string_object!(this, \"ends_with\").starts_with(&s),\n\n )),\n\n other => RuntimeResult::Error {\n\n error: RuntimeErrorType::TypeError,\n\n message: format!(\n\n \"Expected argument of type 'String'. Got '{}' instead.\",\n\n other.type_name()\n\n ),\n\n },\n\n }\n\n}\n","file_path":"src/built_in/primitives/string.rs","rank":8,"score":220981.46212144502},{"content":"/// Checks if a string ends with another string.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn ends_with(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\n\n match args[0].clone() {\n\n Object::String(s) => vm.push_stack(Object::Bool(\n\n verify_string_object!(this, \"ends_with\").ends_with(&s),\n\n )),\n\n other => RuntimeResult::Error {\n\n error: RuntimeErrorType::TypeError,\n\n message: format!(\n\n \"Expected argument of type 'String'. Got '{}' instead.\",\n\n other.type_name()\n\n ),\n\n },\n\n }\n\n}\n\n\n","file_path":"src/built_in/primitives/string.rs","rank":9,"score":220981.46212144505},{"content":"/// Get the ith object in a Hinton range.\n\n///\n\n/// # Parameters\n\n/// - `range`: A reference to the underlying `RangeObject` in a Hinton range.\n\n/// - `index`: A Hinton object that will serve as the index of the range. For example, this object\n\n/// could be a Hinton integer, or a Hinton range.\n\n///\n\n/// # Returns\n\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\n\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the range.\n\nfn subscript_range(range: &RangeObject, index: &Object) -> Result<Object, ObjectOprErrType> {\n\n match index {\n\n // Indexing type: Range[Int]\n\n Object::Int(idx) => {\n\n let min = range.min;\n\n let max = range.max;\n\n\n\n if let Some(pos) = to_bounded_index(*idx, i64::abs(max - min) as usize) {\n\n return if max - min > 0 {\n\n Ok(Object::Int(min + pos as i64))\n\n } else {\n\n Ok(Object::Int(min - pos as i64))\n\n };\n\n }\n\n }\n\n // Indexing type: Range[Bool]\n\n Object::Bool(val) => {\n\n let idx = (if *val { 1 } else { 0 }) as i64;\n\n let min = range.min;\n\n let max = range.max;\n","file_path":"src/objects/indexing.rs","rank":10,"score":217143.93785658473},{"content":"/// Computes the absolute value of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn abs(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(verify_int_object!(this, \"abs\").abs()))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":11,"score":214536.47019984032},{"content":"/// Pops an object from this Hinton array.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn pop(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n match verify_array_object!(this, \"pop\").borrow_mut().pop() {\n\n Some(o) => vm.push_stack(o),\n\n None => RuntimeResult::Error {\n\n error: RuntimeErrorType::IndexError,\n\n message: \"Attempted to pop from an empty array.\".to_string(),\n\n },\n\n }\n\n}\n\n\n","file_path":"src/built_in/primitives/array.rs","rank":12,"score":214533.32927502712},{"content":"/// Gets the length of a Hinton tuple.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The tuple object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::from(verify_tuple_object!(this, \"len\").len()))\n\n}\n\n\n","file_path":"src/built_in/primitives/tuple.rs","rank":13,"score":214532.937212069},{"content":"/// Gets the length of a Hinton array.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::from(verify_array_object!(this, \"len\").borrow().len()))\n\n}\n\n\n","file_path":"src/built_in/primitives/array.rs","rank":14,"score":214532.93721206902},{"content":"/// Converts this Hinton tuple into a Hinton array.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The tuple object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn to_array(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n let tup = &*verify_tuple_object!(this, \"to_tuple\");\n\n vm.push_stack(Object::Array(Rc::new(RefCell::new(tup.clone()))))\n\n}\n","file_path":"src/built_in/primitives/tuple.rs","rank":15,"score":214532.8392298751},{"content":"/// Converts this Hinton array into a Hinton tuple.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn to_tuple(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n let arr = verify_array_object!(this, \"to_tuple\");\n\n let tuple = arr.borrow_mut().clone();\n\n vm.push_stack(Object::Tuple(Rc::new(tuple)))\n\n}\n","file_path":"src/built_in/primitives/array.rs","rank":16,"score":214532.83922987507},{"content":"/// Counts the number of ones in the binary representation of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn count_ones(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(\n\n verify_int_object!(this, \"count_ones\").count_ones() as i64\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":17,"score":210701.37634213865},{"content":"/// Counts the number of zeros in the binary representation of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn count_zeros(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(\n\n verify_int_object!(this, \"count_zeros\").count_zeros() as i64\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":18,"score":210701.37634213862},{"content":"/// Counts the number of leading ones in the binary representation of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn leading_ones(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(\n\n verify_int_object!(this, \"leading_ones\").leading_ones() as i64,\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":19,"score":210701.28335910372},{"content":"/// Counts the number of trailing ones in the binary representation of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn trailing_ones(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(\n\n verify_int_object!(this, \"trailing_ones\").trailing_ones() as i64,\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":20,"score":210701.28335910375},{"content":"/// Counts the number of trailing zeros in the binary representation of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn trailing_zeros(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(\n\n verify_int_object!(this, \"trailing_zeros\").trailing_zeros() as i64,\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":21,"score":210701.28335910372},{"content":"/// Counts the number of leading zeros in the binary representation of this Hinton integer.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn leading_zeros(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Int(\n\n verify_int_object!(this, \"leading_zeros\").leading_zeros() as i64,\n\n ))\n\n}\n\n\n","file_path":"src/built_in/primitives/int.rs","rank":22,"score":210701.28335910375},{"content":"/// Computes the number of bits needed to represent this Hinton integer in binary form.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The integer object.\n\n/// * `_`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn bit_len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\n\n let i = verify_int_object!(this, \"bit_len\");\n\n vm.push_stack(Object::Int((i.abs() as f64).log2().ceil() as i64))\n\n}\n","file_path":"src/built_in/primitives/int.rs","rank":23,"score":210701.1919549371},{"content":"/// Computes the arcsine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn asin(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.asin()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":24,"score":210700.8014456089},{"content":"/// Computes the sine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn sin(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.sin()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":25,"score":210700.8014456089},{"content":"/// Computes the cosine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn cos(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.cos()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":26,"score":210700.8014456089},{"content":"/// Computes the tangent of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn tan(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.tan()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":27,"score":210700.8014456089},{"content":"/// Computes the arctangent of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn atan(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.atan()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":28,"score":210700.8014456089},{"content":"/// Computes the arccosine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn acos(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.acos()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":29,"score":210700.8014456089},{"content":"/// Computes the hyperbolic arctangent of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn atanh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.atanh()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":30,"score":210700.69605896543},{"content":"/// Computes the cube root of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn cbrt(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.cbrt()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":31,"score":210700.6960589654},{"content":"/// Computes the hyperbolic sine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn sinh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.sinh()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":32,"score":210700.6960589654},{"content":"/// Computes the square root of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn sqrt(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.sqrt()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":33,"score":210700.69605896543},{"content":"/// Computes the hyperbolic arcsine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn asinh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.asinh()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":34,"score":210700.69605896543},{"content":"/// Computes the hyperbolic tangent of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn tanh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.tanh()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":35,"score":210700.6960589654},{"content":"/// Computes the hyperbolic cosine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn cosh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.cosh()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":36,"score":210700.6960589654},{"content":"/// Computes the hyperbolic arccosine of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn acosh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.acosh()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":37,"score":210700.69605896543},{"content":"/// Computes the arctangent of the quotient of two Hinton numbers.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn atan2(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg1 = check_int_or_float!(args[0].clone());\n\n let arg2 = check_int_or_float!(args[1].clone());\n\n vm.push_stack(Object::Float(arg1.atan2(arg2)))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":38,"score":210700.59272017077},{"content":"/// Computes the exponent (e<sup>x</sup>) of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn exp(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg.exp()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":39,"score":210700.59272017077},{"content":"/// Computes the logarithm of a Hinton number with an arbitrary base.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn log(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg1 = check_int_or_float!(args[0].clone());\n\n let arg2 = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg1.log(arg2)))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":40,"score":210700.59272017077},{"content":"/// Computes the log-base-10 (log<sub>10</sub>(x)) of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn log10(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg1 = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg1.log10()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":41,"score":210700.39195191898},{"content":"/// Computes the log-base-2 (log<sub>2</sub>(x)) of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn log2(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg1 = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg1.log2()))\n\n}\n\n\n","file_path":"src/built_in/primitives/math.rs","rank":42,"score":210700.391951919},{"content":"/// Computes the natural logarithm (log<sub>e</sub>(x)) of a Hinton number.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `_`: *Not applicable.*\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn ln(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\n\n let arg1 = check_int_or_float!(args[0].clone());\n\n vm.push_stack(Object::Float(arg1.ln()))\n\n}\n","file_path":"src/built_in/primitives/math.rs","rank":43,"score":210700.391951919},{"content":"/// Implements the `random(...)` native function for Hinton, which computes a random number\n\n/// between [0, 1).\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_random(vm: &mut VM, _: Vec<Object>) -> RuntimeResult {\n\n vm.push_stack(Object::Float(rand::random()))\n\n}\n","file_path":"src/built_in/natives.rs","rank":44,"score":208721.9092723477},{"content":"/// Implements the `clock()` native function for Hinton, which retrieves the current time from\n\n/// the Unix Epoch time.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_clock(vm: &mut VM, _: Vec<Object>) -> RuntimeResult {\n\n let now = SystemTime::now().duration_since(SystemTime::UNIX_EPOCH);\n\n\n\n match now {\n\n Ok(t) => {\n\n let time = t.as_millis();\n\n vm.push_stack(Object::Int(time as i64))\n\n }\n\n Err(_) => RuntimeResult::Error {\n\n error: RuntimeErrorType::Internal,\n\n message: String::from(\"System's time before UNIX EPOCH.\"),\n\n },\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":45,"score":208721.63498233713},{"content":"#[cfg(feature = \"show_raw_bytecode\")]\n\npub fn print_raw(chunk: &Chunk, name: &str) {\n\n let mut i = 0;\n\n\n\n // prints this chunk's name\n\n println!(\"==== {} ====\", name);\n\n\n\n while i < chunk.len() {\n\n let instr = chunk.get_byte(i);\n\n print!(\"{:#04X} \", instr as u8);\n\n\n\n if (i + 1) % 8 == 0 {\n\n println!();\n\n }\n\n\n\n i += 1;\n\n }\n\n\n\n println!(\"\\n\\nChunk Size: {}\", i);\n\n println!(\"================\\n\");\n\n}\n\n\n\n/// Disassembles the chunk, printing each instruction, and its related information.\n","file_path":"src/core/bytecode.rs","rank":46,"score":208589.52935361682},{"content":"/// Converts a Hinton object into an Iterable object.\n\n///\n\n/// # Arguments\n\n/// * `o`: The object to be converted to an iterable.\n\n///\n\n/// # Returns:\n\n/// Result<Object, RuntimeResult>\n\npub fn make_iter(o: Object) -> Result<Object, RuntimeResult> {\n\n match o {\n\n Object::String(_) | Object::Array(_) | Object::Range(_) | Object::Tuple(_) => {\n\n Ok(Object::Iter(Rc::new(RefCell::new(IterObject {\n\n iter: Box::new(o),\n\n index: 0,\n\n }))))\n\n }\n\n // If the object is already an iterable, return that same object.\n\n Object::Iter(_) => Ok(o),\n\n _ => Err(RuntimeResult::Error {\n\n error: RuntimeErrorType::TypeError,\n\n message: format!(\"Cannot create iterable from '{}'.\", o.type_name()),\n\n }),\n\n }\n\n}\n\n\n","file_path":"src/objects/iter_obj.rs","rank":47,"score":206382.7292682619},{"content":"/// Get the ith object in a Hinton array.\n\n///\n\n/// # Parameters\n\n/// - `arr`: A reference to the underlying `Vec<Object>` in a Hinton Array.\n\n/// - `index`: A Hinton object that will serve as the index of the array. For example, this object\n\n/// could be a Hinton integer, or a Hinton range.\n\n///\n\n/// # Returns\n\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\n\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the array.\n\nfn subscript_array(arr: &[Object], index: &Object) -> Result<Object, ObjectOprErrType> {\n\n match index {\n\n // Indexing type: Array[Int]\n\n Object::Int(idx) => {\n\n if let Some(pos) = to_bounded_index(*idx, arr.len()) {\n\n if let Some(val) = arr.get(pos) {\n\n return Ok(val.clone());\n\n }\n\n }\n\n }\n\n // Indexing type: Array[Bool]\n\n Object::Bool(val) => {\n\n let pos = (if *val { 1 } else { 0 }) as usize;\n\n if let Some(val) = arr.get(pos) {\n\n return Ok(val.clone());\n\n }\n\n }\n\n // Indexing type: Array[Range]\n\n Object::Range(_) => {\n\n unimplemented!(\"Array indexing with ranges.\")\n","file_path":"src/objects/indexing.rs","rank":48,"score":204225.1551738548},{"content":"/// Get the ith object in a Hinton tuple.\n\n///\n\n/// # Parameters\n\n/// - `tup`: A reference to the underlying `Vec<Object>` in a Hinton tuple.\n\n/// - `index`: A Hinton object that will serve as the index of the tuple. For example, this object\n\n/// could be a Hinton integer, or a Hinton range.\n\n///\n\n/// # Returns\n\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\n\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the tuple.\n\nfn subscript_tuple(tup: &[Object], index: &Object) -> Result<Object, ObjectOprErrType> {\n\n match index {\n\n // Indexing type: Tuple[Int]\n\n Object::Int(idx) => {\n\n if let Some(pos) = to_bounded_index(*idx, tup.len()) {\n\n if let Some(val) = tup.get(pos) {\n\n return Ok(val.clone());\n\n }\n\n }\n\n }\n\n // Indexing type: Tuple[Bool]\n\n Object::Bool(val) => {\n\n let pos = (if *val { 1 } else { 0 }) as usize;\n\n\n\n if let Some(val) = tup.get(pos) {\n\n return Ok(val.clone());\n\n }\n\n }\n\n // Indexing type: Tuple[Range]\n\n Object::Range(_) => {\n","file_path":"src/objects/indexing.rs","rank":49,"score":204225.1551738548},{"content":"/// Gets the value associated with a key in a Hinton dictionary.\n\n///\n\n/// # Parameters\n\n/// - `dict`: A reference to the underlying `HashMap` in a Hinton dictionary.\n\n/// - `index`: A Hinton object that will serve as the index of the dictionary. For example, this\n\n/// object could be a Hinton string, or a Hinton range.\n\n///\n\n/// # Returns\n\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the key\n\n/// exists in the dictionary. Returns `Err(ObjectOprErrType)` otherwise.\n\nfn subscript_dictionary(dict: &DictObject, index: &Object) -> Result<Object, ObjectOprErrType> {\n\n return match index {\n\n Object::String(key) => dict.get_prop(key),\n\n // Indexing type: Range[Range]\n\n Object::Range(_) => {\n\n unimplemented!(\"Range indexing with ranges.\")\n\n }\n\n _ => Err(ObjectOprErrType::TypeError(format!(\n\n \"Dictionaries can only be indexed by a String or Range. Found '{}' instead.\",\n\n index.type_name()\n\n ))),\n\n };\n\n}\n","file_path":"src/objects/indexing.rs","rank":50,"score":198122.02265236617},{"content":"/// Pushes an object into this Hinton array.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `this`: The array object.\n\n/// * `args`: A vector of objects that will serve as arguments to this method call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn push(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\n\n let obj = args[0].clone();\n\n verify_array_object!(this, \"push\").borrow_mut().push(obj);\n\n\n\n vm.push_stack(Object::Null)\n\n}\n\n\n","file_path":"src/built_in/primitives/array.rs","rank":51,"score":195214.9887025869},{"content":"/// Implements the `print(...)` native function for Hinton, which prints a value to the console.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_print(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n println!(\"{}\", args[0]);\n\n vm.push_stack(Object::Null)\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":52,"score":187578.26774978923},{"content":"/// Implements the `iter(...)` native function for Hinton, which converts the give object to an\n\n/// iterable object.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_iter(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n match make_iter(args[0].clone()) {\n\n Ok(o) => vm.push_stack(o),\n\n Err(e) => e,\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":53,"score":187575.83798373383},{"content":"/// Implements the `next(...)` native function for Hinton, which retrieves the next item in an\n\n/// iterable object.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_next(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n match &args[0] {\n\n Object::Iter(iter) => match get_next_in_iter(iter) {\n\n Ok(o) => vm.push_stack(o),\n\n Err(e) => e,\n\n },\n\n _ => RuntimeResult::Error {\n\n error: RuntimeErrorType::TypeError,\n\n message: format!(\"Object of type '{}' is not iterable.\", args[0].type_name()),\n\n },\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":54,"score":187575.41980347378},{"content":"/// Implements the `assert(...)` native function for Hinton, which checks that the first argument\n\n/// of the function call is truthy.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_assert(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n let value = args[0].clone();\n\n\n\n if !value.is_falsey() {\n\n vm.push_stack(Object::Null)\n\n } else {\n\n let message = if args.len() == 2 {\n\n args[1].clone()\n\n } else {\n\n Object::String(String::from(\"Assertion failed on a falsey value.\"))\n\n };\n\n\n\n RuntimeResult::Error {\n\n error: RuntimeErrorType::AssertionError,\n\n message: format!(\"{}\", message),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":55,"score":187574.88932002478},{"content":"/// Implements the `input(...)` native function for Hinton, which gets user input from the console.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_input(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n print!(\"{}\", args[0]);\n\n\n\n // Print the programmer-provided message\n\n match io::Write::flush(&mut io::stdout()) {\n\n Ok(_) => {\n\n let mut input = String::new();\n\n // Get the user's input\n\n match io::stdin().read_line(&mut input) {\n\n Ok(_) => {\n\n input.pop(); // remove added newline\n\n vm.push_stack(Object::String(input))\n\n }\n\n Err(e) => RuntimeResult::Error {\n\n error: RuntimeErrorType::Internal,\n\n message: format!(\"Failed to read input. IO failed read line. {}\", e),\n\n },\n\n }\n\n }\n\n Err(e) => RuntimeResult::Error {\n\n error: RuntimeErrorType::Internal,\n\n message: format!(\"Failed to read input. IO failed flush. {}\", e),\n\n },\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":56,"score":187574.61367592067},{"content":"/// Implements the `assert_eq(...)` native function for Hinton, which checks that\n\n/// the first two arguments of the function call ARE equal.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_assert_eq(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n let value1 = args[0].clone();\n\n let value2 = args[1].clone();\n\n\n\n if value1 == value2 {\n\n vm.push_stack(Object::Null)\n\n } else {\n\n let message = if args.len() == 3 {\n\n args[2].clone()\n\n } else {\n\n Object::String(String::from(\"Assertion values are not equal.\"))\n\n };\n\n\n\n RuntimeResult::Error {\n\n error: RuntimeErrorType::AssertionError,\n\n message: format!(\"{}\", message),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":57,"score":183744.2040437244},{"content":"/// Implements the `assert_ne(...)` native function for Hinton, which checks that the first two\n\n/// arguments of the function call are NOT equal.\n\n///\n\n/// # Arguments\n\n/// * `vm`: A mutable reference to the virtual machine.\n\n/// * `args`: A vector of objects that will serve as arguments to this function call.\n\n///\n\n/// # Returns:\n\n/// RuntimeResult\n\nfn native_assert_ne(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\n\n let value1 = args[0].clone();\n\n let value2 = args[1].clone();\n\n\n\n if value1 != value2 {\n\n vm.push_stack(Object::Null)\n\n } else {\n\n let message = if args.len() == 3 {\n\n args[2].clone()\n\n } else {\n\n Object::String(String::from(\"Assertion values are equal.\"))\n\n };\n\n\n\n RuntimeResult::Error {\n\n error: RuntimeErrorType::AssertionError,\n\n message: format!(\"{}\", message),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/built_in/natives.rs","rank":58,"score":183744.2040437244},{"content":"/// Gets the next item in a Hinton iterator.\n\n///\n\n/// # Arguments\n\n/// * `o`: A mutable, counted reference into the iterator.\n\n///\n\n/// # Returns:\n\n/// Result<Object, RuntimeResult>\n\npub fn get_next_in_iter(o: &Rc<RefCell<IterObject>>) -> Result<Object, RuntimeResult> {\n\n let mut iter = o.borrow_mut();\n\n let current_index = Object::Int(iter.index as i64);\n\n\n\n match iter.iter.subscript(¤t_index) {\n\n Ok(o) => {\n\n iter.index += 1;\n\n Ok(o)\n\n }\n\n Err(_) => Err(RuntimeResult::Error {\n\n error: RuntimeErrorType::StopIteration,\n\n message: String::from(\"End of Iterator.\"),\n\n }),\n\n }\n\n}\n","file_path":"src/objects/iter_obj.rs","rank":59,"score":179261.2802995696},{"content":"/// Reports an error list coming from the parser or compiler.\n\n///\n\n/// # Parameters\n\n/// - `filepath`: The file path of where the errors occurred.\n\n/// - `errors`: An `ErrorList` containing the errors.\n\n/// - `source`: A reference to the source contents.\n\npub fn report_errors_list(filepath: &Path, errors: Vec<ErrorReport>, source: &str) {\n\n let source_lines: Vec<&str> = source.split('\\n').collect();\n\n\n\n for error in errors.iter() {\n\n eprintln!(\"{}\", error.message);\n\n print_error_source(\n\n filepath,\n\n error.line,\n\n error.column,\n\n error.lexeme_len,\n\n &source_lines,\n\n );\n\n }\n\n\n\n eprintln!(\"\\x1b[31;1mERROR:\\x1b[0m Aborted execution due to previous errors.\");\n\n}\n\n\n","file_path":"src/errors.rs","rank":61,"score":118551.82994070195},{"content":"/// Prints a snippet of the source line associated with an error.\n\n///\n\n/// # Parameters\n\n/// - `line_num`: The source line number of the error.\n\n/// - `col`: The source column number of the error.\n\n/// - `len`: The length of the token that produced the error.\n\n/// - `src`: A reference to the source error line.\n\npub fn print_error_snippet(line_num: usize, col: usize, len: usize, src: &str) {\n\n let front_pad = (f64::log10(line_num as f64).floor() + 1f64) as usize;\n\n // +2 for one extra space at the front and one at the back\n\n let whitespace_pad_size = \" \".repeat(front_pad + 2);\n\n\n\n // Compute the column of the error with trimmed whitespaces from the source line.\n\n let mut removed_whitespace = 0;\n\n for c in src.chars() {\n\n if c == ' ' {\n\n removed_whitespace += 1;\n\n } else {\n\n break;\n\n }\n\n }\n\n\n\n let col = col - removed_whitespace;\n\n let trimmed_source = src.trim();\n\n\n\n if !trimmed_source.is_empty() {\n\n eprintln!(\"{}|\", whitespace_pad_size);\n\n eprint!(\" {} | \", line_num);\n\n eprintln!(\"{}\", trimmed_source);\n\n eprint!(\"{}|\", whitespace_pad_size);\n\n eprintln!(\" {}\\x1b[31;1m{}\\x1b[0m\", \" \".repeat(col), \"^\".repeat(len));\n\n }\n\n\n\n eprintln!()\n\n}\n\n\n","file_path":"src/errors.rs","rank":62,"score":117103.15669244938},{"content":"#[test]\n\nfn base_func_has_no_defaults() {\n\n let program = match Parser::parse(\"\") {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n match Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()) {\n\n Ok(res) => {\n\n if !res.defaults.is_empty() {\n\n panic!(\"Base function in script should have 0 default parameters.\")\n\n }\n\n }\n\n Err(_) => panic!(\"Compiler Had Errors.\"),\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":63,"score":115445.71462945748},{"content":"/// Throws a runtime error to the console.\n\n///\n\n/// # Parameters\n\n/// - `vm`: A reference to the virtual machine.\n\n/// - `error`: The generated error.\n\n/// - `message`: The error message to be displayed.\n\n/// - `source`: The program's source text.\n\npub fn report_runtime_error(vm: &VM, error: RuntimeErrorType, message: String, source: &str) {\n\n let source_lines: Vec<&str> = source.split('\\n').collect();\n\n\n\n let frame = vm.current_frame();\n\n let f = match &frame.callee {\n\n CallFrameType::Closure(c) => c.function.borrow(),\n\n CallFrameType::Function(f) => f.borrow(),\n\n CallFrameType::Method(m) => m.method.function.borrow(),\n\n };\n\n let line = f.chunk.get_line_info(frame.ip - 1);\n\n\n\n let error_name = match error {\n\n RuntimeErrorType::ArgumentError => \"ArgumentError\",\n\n RuntimeErrorType::AssertionError => \"AssertionError\",\n\n RuntimeErrorType::IndexError => \"IndexError\",\n\n RuntimeErrorType::InstanceError => \"InstanceError\",\n\n RuntimeErrorType::Internal => \"InternalError\",\n\n RuntimeErrorType::KeyError => \"KeyError\",\n\n RuntimeErrorType::RecursionError => \"RecursionError\",\n\n RuntimeErrorType::ReferenceError => \"ReferenceError\",\n","file_path":"src/errors.rs","rank":64,"score":115194.69852191093},{"content":"#[derive(Clone, Copy)]\n\nstruct LoopScope {\n\n /// The position of the loop's start in the chunk.\n\n position: usize,\n\n /// The scope depth of the body of the loop.\n\n scope_depth: usize,\n\n /// The type of loop this represents.\n\n loop_type: LoopType,\n\n}\n\n\n\n/// The types of loops available in Hinton. This is useful when \\\n\n/// compiling break statements to emit extra `POP` operations \\\n\n/// based on the loop type.\n","file_path":"src/compiler/mod.rs","rank":65,"score":98716.80552878325},{"content":"/// Represents a break statement, which is associated with a loop.\n\nstruct BreakScope {\n\n /// The loop scope associated with this break statement.\n\n parent_loop: LoopScope,\n\n /// The position of the break's instruction in the chunk.\n\n chunk_pos: usize,\n\n}\n\n\n\n/// Represents a loop statement at compile time. Used primarily by\n\n/// break statements to know which loops to break.\n","file_path":"src/compiler/mod.rs","rank":66,"score":98716.80552878325},{"content":"pub trait HTPrimitive {\n\n /// Gets the name class name of this Hinton primitive.\n\n fn name(&self) -> String;\n\n\n\n /// Gets the non-static members of this Hinton primitive.\n\n fn members(&mut self) -> &mut HashMap<String, ClassField>;\n\n\n\n /// Gets the static members of this Hinton primitive.\n\n fn statics(&mut self) -> &mut HashMap<String, ClassField>;\n\n\n\n /// Gets the default class object stored in this Hinton primitive.\n\n fn default() -> ClassObject;\n\n\n\n /// Binds a non-static method to this Hinton primitive.\n\n ///\n\n /// # Arguments\n\n /// * `name`: The name of the method.\n\n /// * `arity`: The method's arity.\n\n /// * `body`: The method's body.\n\n ///\n","file_path":"src/built_in/primitives/mod.rs","rank":67,"score":90808.75357281038},{"content":"/// Maps a keyword string to a token type.\n\n///\n\n/// # Parameters\n\n/// - `id`: The identifier's string name.\n\n///\n\n/// # Returns\n\n/// `TokenType`: The type of token matched for given identifier name.\n\npub fn make_identifier_type(id: &str) -> TokenType {\n\n match id {\n\n \"and\" => TokenType::LOGIC_AND,\n\n \"as\" => TokenType::AS_OPERATOR,\n\n \"break\" => TokenType::BREAK_KW,\n\n \"class\" => TokenType::CLASS_KW,\n\n \"const\" => TokenType::CONST_KW,\n\n \"continue\" => TokenType::CONTINUE_KW,\n\n \"else\" => TokenType::ELSE_KW,\n\n \"enum\" => TokenType::ENUM_KW,\n\n \"equals\" => TokenType::LOGIC_EQ,\n\n \"false\" => TokenType::FALSE,\n\n \"fn\" => TokenType::FN_LAMBDA_KW,\n\n \"for\" => TokenType::FOR_KW,\n\n \"func\" => TokenType::FUNC_KW,\n\n \"if\" => TokenType::IF_KW,\n\n \"in\" => TokenType::IN_KW,\n\n \"is\" => TokenType::LOGIC_IS,\n\n \"mod\" => TokenType::MODULUS,\n\n \"new\" => TokenType::NEW_KW,\n","file_path":"src/core/tokens.rs","rank":68,"score":89161.08195682471},{"content":"#[test]\n\nfn base_func_has_no_arity() {\n\n let program = match Parser::parse(\"\") {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n match Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()) {\n\n Ok(res) => {\n\n if res.min_arity != 0u8 && res.max_arity != 0u8 {\n\n panic!(\"Base function in script should have 0 parameters.\")\n\n }\n\n }\n\n Err(_) => panic!(\"Compiler Had Errors.\"),\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":69,"score":81606.12097553974},{"content":"#[test]\n\nfn panic_on_unterminated_string() {\n\n if Parser::parse(\"\\\"hello world\").is_ok() {\n\n panic!(\"Should emit error on unterminated strings.\")\n\n }\n\n\n\n if Parser::parse(\"\\'hello world\").is_ok() {\n\n panic!(\"Should emit error on unterminated strings.\")\n\n }\n\n\n\n if Parser::parse(\"\\\"I\\\"m over here!\\\";\").is_ok() {\n\n panic!(\"Should emit error on unterminated strings.\")\n\n }\n\n\n\n if Parser::parse(\"'I'm over here!';\").is_ok() {\n\n panic!(\"Should emit error on unterminated strings.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/parser.rs","rank":70,"score":81501.6949473448},{"content":"#[test]\n\nfn error_if_return_outside_func() {\n\n let program = match Parser::parse(\"while true { return false; }\") {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_ok() {\n\n panic!(\"Compiler should emit error when returning from outside of function.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":71,"score":79135.58592624856},{"content":"#[test]\n\nfn functions_have_access_to_global_vars() {\n\n let src = \"\n\n var global = \\\"some value\\\";\n\n\n\n func my_function() {\n\n print(global);\n\n }\n\n \";\n\n\n\n let program = match Parser::parse(src) {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_err() {\n\n panic!(\"Functions should have access to global declarations.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":72,"score":79053.41017306925},{"content":"#[test]\n\nfn allow_double_quoted_strings() {\n\n if Parser::parse(\"\\\"I am going to the moon tomorrow.\\\";\").is_err() {\n\n panic!(\"Should allow double-quoted strings.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/parser.rs","rank":73,"score":79035.02605967366},{"content":"#[test]\n\nfn allow_single_quoted_strings() {\n\n if Parser::parse(\"'The sky is green!';\").is_err() {\n\n panic!(\"Should allow single-quoted strings.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/parser.rs","rank":74,"score":79035.02605967366},{"content":"#[test]\n\nfn test_const_pool_no_duplicate_items() {\n\n let src = \"8.9;\".repeat(500);\n\n\n\n let program = match Parser::parse(src.as_str()) {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n match Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()) {\n\n Ok(res) => {\n\n if res.chunk.get_pool_size() != 1 {\n\n panic!(\"Items in the constant pool should not be duplicated.\")\n\n }\n\n }\n\n Err(_) => panic!(\"Compiler Had Errors.\"),\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":75,"score":76886.92876450847},{"content":"#[test]\n\nfn allow_escaped_double_quoted_strings() {\n\n if Parser::parse(\"\\\"He said told me to \\\\\\\"stay quiet\\\\\\\", yesterday.\\\";\").is_err() {\n\n panic!(\"Should allow escaped double-quotes.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/parser.rs","rank":76,"score":76744.48327304826},{"content":"#[test]\n\nfn allow_escaped_single_quoted_strings() {\n\n if Parser::parse(\"'I\\\\\\'m over here!';\").is_err() {\n\n panic!(\"Should allow escaped single-quoted strings.\")\n\n }\n\n}\n","file_path":"src/tests/parser.rs","rank":77,"score":76744.48327304826},{"content":"\n\n if let Some(pos) = to_bounded_index(idx, i64::abs(max - min) as usize) {\n\n return if max - min > 0 {\n\n Ok(Object::Int(min + pos as i64))\n\n } else {\n\n Ok(Object::Int(min - pos as i64))\n\n };\n\n }\n\n }\n\n // Indexing type: Range[Range]\n\n Object::Range(_) => {\n\n unimplemented!(\"Range indexing with ranges.\")\n\n }\n\n _ => {\n\n return Err(ObjectOprErrType::TypeError(format!(\n\n \"Range index must be an Int or a Range. Found '{}' instead.\",\n\n index.type_name()\n\n )))\n\n }\n\n }\n\n\n\n Err(ObjectOprErrType::IndexError(String::from(\n\n \"Range index out of bounds.\",\n\n )))\n\n}\n\n\n","file_path":"src/objects/indexing.rs","rank":78,"score":74761.21846809864},{"content":"use crate::errors::ObjectOprErrType;\n\nuse crate::objects::dictionary_obj::DictObject;\n\nuse crate::objects::{Object, RangeObject};\n\n\n\nimpl Object {\n\n /// Defines the indexing operation of Hinton objects.\n\n pub fn subscript(&self, index: &Object) -> Result<Object, ObjectOprErrType> {\n\n match self {\n\n Object::Array(arr) => subscript_array(&arr.borrow(), index),\n\n Object::Tuple(tup) => subscript_tuple(&tup, index),\n\n Object::String(str) => subscript_string(&str, index),\n\n Object::Range(range) => subscript_range(range, index),\n\n Object::Dict(dict) => subscript_dictionary(dict, index),\n\n _ => Err(ObjectOprErrType::TypeError(format!(\n\n \"Cannot index object of type '{}'.\",\n\n self.type_name()\n\n ))),\n\n }\n\n }\n\n}\n","file_path":"src/objects/indexing.rs","rank":79,"score":74757.31849314779},{"content":" }\n\n // Indexing type: String[Range]\n\n Object::Range(_) => {\n\n unimplemented!(\"String indexing with ranges.\")\n\n }\n\n _ => {\n\n return Err(ObjectOprErrType::TypeError(format!(\n\n \"String index must be an Int or a Range. Found '{}' instead.\",\n\n index.type_name()\n\n )))\n\n }\n\n }\n\n\n\n Err(ObjectOprErrType::IndexError(String::from(\n\n \"String index out of bounds.\",\n\n )))\n\n}\n\n\n","file_path":"src/objects/indexing.rs","rank":80,"score":74748.54184782394},{"content":" }\n\n _ => {\n\n return Err(ObjectOprErrType::TypeError(format!(\n\n \"Array index must be an Int or a Range. Found '{}' instead.\",\n\n index.type_name()\n\n )))\n\n }\n\n }\n\n Err(ObjectOprErrType::IndexError(String::from(\n\n \"Array index out of bounds.\",\n\n )))\n\n}\n\n\n","file_path":"src/objects/indexing.rs","rank":81,"score":74746.67735827983},{"content":" unimplemented!(\"Tuple indexing with ranges.\")\n\n }\n\n _ => {\n\n return Err(ObjectOprErrType::TypeError(format!(\n\n \"Tuple index must be an Int or a Range. Found '{}' instead.\",\n\n index.type_name()\n\n )))\n\n }\n\n }\n\n\n\n Err(ObjectOprErrType::IndexError(String::from(\n\n \"Tuple index out of bounds.\",\n\n )))\n\n}\n\n\n","file_path":"src/objects/indexing.rs","rank":82,"score":74746.44339056035},{"content":"\n\n/// Takes an i64 integer and converts it into an object index. This allows indexing objects with\n\n/// negative integers.\n\n///\n\n/// # Parameters\n\n/// - `x`: The positive or negative index.\n\n/// - `len`: The length of the object.\n\n///\n\n/// # Returns\n\n/// - `Option<usize>`: Return Some(usize) if the index is within the bounds of the object's length\n\n/// or `None` otherwise.\n","file_path":"src/objects/indexing.rs","rank":83,"score":74743.8282413155},{"content":"#[test]\n\nfn allow_return_inside_loop_inside_func() {\n\n let program = match Parser::parse(\"func my_func(x) { while x { return false; } }\") {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_err() {\n\n panic!(\"Compiler should allow returning from loop inside function.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":84,"score":74705.48024536873},{"content":"#[test]\n\nfn error_if_break_inside_func_inside_loop() {\n\n let program = match Parser::parse(\"while true { func my_func() { break; } }\") {\n\n Ok(ast) => ast,\n\n Err(_) => panic!(\"Parser Had Errors.\"),\n\n };\n\n\n\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_ok() {\n\n panic!(\"Compiler should emit error when breaking outside inside a function inside a loop.\")\n\n }\n\n}\n\n\n","file_path":"src/tests/compiler.rs","rank":85,"score":74705.48024536873}],"string":"[\n {\n \"content\": \"#[cfg(feature = \\\"show_bytecode\\\")]\\n\\npub fn disassemble_func_scope(chunk: &Chunk, natives: &[String], primitives: &[String], name: &str) {\\n\\n // prints this chunk's name\\n\\n println!(\\\"==== {} ====\\\", name);\\n\\n\\n\\n let mut current_line = 0;\\n\\n\\n\\n let mut idx = 0;\\n\\n while idx < chunk.len() {\\n\\n let code = chunk.get_byte(idx);\\n\\n let line_info = chunk.get_line_info(idx);\\n\\n\\n\\n // Prints a line number or a vertical bar indicating that the\\n\\n // current instruction is in the same line as the previous one.\\n\\n if line_info.0 != current_line {\\n\\n print!(\\\"{:>05}\\\\t\\\", line_info.0);\\n\\n current_line = line_info.0;\\n\\n } else {\\n\\n print!(\\\" |\\\\t\\\")\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/core/bytecode.rs\",\n \"rank\": 0,\n \"score\": 264353.06332231953\n },\n {\n \"content\": \"/// Gets the length of a Hinton string.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::from(verify_string_object!(this, \\\"len\\\").len()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/string.rs\",\n \"rank\": 1,\n \"score\": 241079.48090958377\n },\n {\n \"content\": \"/// Creates a copy of a string and lowercase it.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn to_lower(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::from(\\n\\n verify_string_object!(this, \\\"to_lower\\\").to_lowercase(),\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/string.rs\",\n \"rank\": 2,\n \"score\": 241079.48090958374\n },\n {\n \"content\": \"/// Converts a Hinton integer into a Hinton string.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn to_string(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::from(format!(\\\"{}\\\", verify_int_object!(this, \\\"to_string\\\"))))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 3,\n \"score\": 241079.3467798797\n },\n {\n \"content\": \"/// Takes an i64 integer and converts it into an object index. This allows indexing objects with\\n\\n/// negative integers.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `x`: The positive or negative index.\\n\\n/// - `len`: The length of the object.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Option<usize>`: Return Some(usize) if the index is within the bounds of the object's length\\n\\n/// or `None` otherwise.\\n\\npub fn to_bounded_index(x: i64, len: usize) -> Option<usize> {\\n\\n if x >= 0 && (x as usize) < len {\\n\\n Some(x as usize)\\n\\n } else if x < 0 && (i64::abs(x) as usize <= len) {\\n\\n Some(len - i64::abs(x) as usize)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 4,\n \"score\": 236941.6648821286\n },\n {\n \"content\": \"/// Get the ith character in a Hinton string.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `str`: A reference to the underlying `String` in a Hinton string.\\n\\n/// - `index`: A Hinton object that will serve as the index of the string. For example, this object\\n\\n/// could be a Hinton integer, or a Hinton range.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\\n\\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the string.\\n\\nfn subscript_string(str: &str, index: &Object) -> Result<Object, ObjectOprErrType> {\\n\\n match index {\\n\\n // Indexing type: String[Int]\\n\\n Object::Int(idx) => {\\n\\n let chars: Vec<char> = str.chars().collect();\\n\\n\\n\\n if let Some(pos) = to_bounded_index(*idx, chars.len()) {\\n\\n if let Some(val) = chars.get(pos) {\\n\\n return Ok(Object::from(val.to_string()));\\n\\n }\\n\\n }\\n\\n }\\n\\n // Indexing type: String[Bool]\\n\\n Object::Bool(val) => {\\n\\n let chars: Vec<char> = str.chars().collect();\\n\\n let pos = (if *val { 1 } else { 0 }) as usize;\\n\\n\\n\\n if let Some(val) = chars.get(pos) {\\n\\n return Ok(Object::from(val.to_string()));\\n\\n }\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 5,\n \"score\": 223169.87398436735\n },\n {\n \"content\": \"/// Gets the index of the first occurrence of an object in this Hinton array.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn index_of(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let obj = args[0].clone();\\n\\n\\n\\n match verify_array_object!(this, \\\"index_of\\\")\\n\\n .borrow_mut()\\n\\n .iter()\\n\\n .position(|x| x == &obj)\\n\\n {\\n\\n Some(i) => vm.push_stack(Object::Int(i as i64)),\\n\\n None => vm.push_stack(Object::Null),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/array.rs\",\n \"rank\": 6,\n \"score\": 221002.62947397554\n },\n {\n \"content\": \"/// Gets the index of the first occurrence of an object in this Hinton tuple.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The tuple object.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn index_of(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let obj = args[0].clone();\\n\\n\\n\\n match verify_tuple_object!(this, \\\"index_of\\\")\\n\\n .iter()\\n\\n .position(|x| x == &obj)\\n\\n {\\n\\n Some(i) => vm.push_stack(Object::Int(i as i64)),\\n\\n None => vm.push_stack(Object::Null),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/tuple.rs\",\n \"rank\": 7,\n \"score\": 221002.62947397554\n },\n {\n \"content\": \"/// Checks if a string starts with another string.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn starts_with(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n match args[0].clone() {\\n\\n Object::String(s) => vm.push_stack(Object::Bool(\\n\\n verify_string_object!(this, \\\"ends_with\\\").starts_with(&s),\\n\\n )),\\n\\n other => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::TypeError,\\n\\n message: format!(\\n\\n \\\"Expected argument of type 'String'. Got '{}' instead.\\\",\\n\\n other.type_name()\\n\\n ),\\n\\n },\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/built_in/primitives/string.rs\",\n \"rank\": 8,\n \"score\": 220981.46212144502\n },\n {\n \"content\": \"/// Checks if a string ends with another string.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn ends_with(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n match args[0].clone() {\\n\\n Object::String(s) => vm.push_stack(Object::Bool(\\n\\n verify_string_object!(this, \\\"ends_with\\\").ends_with(&s),\\n\\n )),\\n\\n other => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::TypeError,\\n\\n message: format!(\\n\\n \\\"Expected argument of type 'String'. Got '{}' instead.\\\",\\n\\n other.type_name()\\n\\n ),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/string.rs\",\n \"rank\": 9,\n \"score\": 220981.46212144505\n },\n {\n \"content\": \"/// Get the ith object in a Hinton range.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `range`: A reference to the underlying `RangeObject` in a Hinton range.\\n\\n/// - `index`: A Hinton object that will serve as the index of the range. For example, this object\\n\\n/// could be a Hinton integer, or a Hinton range.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\\n\\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the range.\\n\\nfn subscript_range(range: &RangeObject, index: &Object) -> Result<Object, ObjectOprErrType> {\\n\\n match index {\\n\\n // Indexing type: Range[Int]\\n\\n Object::Int(idx) => {\\n\\n let min = range.min;\\n\\n let max = range.max;\\n\\n\\n\\n if let Some(pos) = to_bounded_index(*idx, i64::abs(max - min) as usize) {\\n\\n return if max - min > 0 {\\n\\n Ok(Object::Int(min + pos as i64))\\n\\n } else {\\n\\n Ok(Object::Int(min - pos as i64))\\n\\n };\\n\\n }\\n\\n }\\n\\n // Indexing type: Range[Bool]\\n\\n Object::Bool(val) => {\\n\\n let idx = (if *val { 1 } else { 0 }) as i64;\\n\\n let min = range.min;\\n\\n let max = range.max;\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 10,\n \"score\": 217143.93785658473\n },\n {\n \"content\": \"/// Computes the absolute value of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn abs(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(verify_int_object!(this, \\\"abs\\\").abs()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 11,\n \"score\": 214536.47019984032\n },\n {\n \"content\": \"/// Pops an object from this Hinton array.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn pop(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n match verify_array_object!(this, \\\"pop\\\").borrow_mut().pop() {\\n\\n Some(o) => vm.push_stack(o),\\n\\n None => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::IndexError,\\n\\n message: \\\"Attempted to pop from an empty array.\\\".to_string(),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/array.rs\",\n \"rank\": 12,\n \"score\": 214533.32927502712\n },\n {\n \"content\": \"/// Gets the length of a Hinton tuple.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The tuple object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::from(verify_tuple_object!(this, \\\"len\\\").len()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/tuple.rs\",\n \"rank\": 13,\n \"score\": 214532.937212069\n },\n {\n \"content\": \"/// Gets the length of a Hinton array.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::from(verify_array_object!(this, \\\"len\\\").borrow().len()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/array.rs\",\n \"rank\": 14,\n \"score\": 214532.93721206902\n },\n {\n \"content\": \"/// Converts this Hinton tuple into a Hinton array.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The tuple object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn to_array(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n let tup = &*verify_tuple_object!(this, \\\"to_tuple\\\");\\n\\n vm.push_stack(Object::Array(Rc::new(RefCell::new(tup.clone()))))\\n\\n}\\n\",\n \"file_path\": \"src/built_in/primitives/tuple.rs\",\n \"rank\": 15,\n \"score\": 214532.8392298751\n },\n {\n \"content\": \"/// Converts this Hinton array into a Hinton tuple.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn to_tuple(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n let arr = verify_array_object!(this, \\\"to_tuple\\\");\\n\\n let tuple = arr.borrow_mut().clone();\\n\\n vm.push_stack(Object::Tuple(Rc::new(tuple)))\\n\\n}\\n\",\n \"file_path\": \"src/built_in/primitives/array.rs\",\n \"rank\": 16,\n \"score\": 214532.83922987507\n },\n {\n \"content\": \"/// Counts the number of ones in the binary representation of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn count_ones(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(\\n\\n verify_int_object!(this, \\\"count_ones\\\").count_ones() as i64\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 17,\n \"score\": 210701.37634213865\n },\n {\n \"content\": \"/// Counts the number of zeros in the binary representation of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn count_zeros(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(\\n\\n verify_int_object!(this, \\\"count_zeros\\\").count_zeros() as i64\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 18,\n \"score\": 210701.37634213862\n },\n {\n \"content\": \"/// Counts the number of leading ones in the binary representation of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn leading_ones(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(\\n\\n verify_int_object!(this, \\\"leading_ones\\\").leading_ones() as i64,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 19,\n \"score\": 210701.28335910372\n },\n {\n \"content\": \"/// Counts the number of trailing ones in the binary representation of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn trailing_ones(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(\\n\\n verify_int_object!(this, \\\"trailing_ones\\\").trailing_ones() as i64,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 20,\n \"score\": 210701.28335910375\n },\n {\n \"content\": \"/// Counts the number of trailing zeros in the binary representation of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn trailing_zeros(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(\\n\\n verify_int_object!(this, \\\"trailing_zeros\\\").trailing_zeros() as i64,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 21,\n \"score\": 210701.28335910372\n },\n {\n \"content\": \"/// Counts the number of leading zeros in the binary representation of this Hinton integer.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn leading_zeros(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Int(\\n\\n verify_int_object!(this, \\\"leading_zeros\\\").leading_zeros() as i64,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 22,\n \"score\": 210701.28335910375\n },\n {\n \"content\": \"/// Computes the number of bits needed to represent this Hinton integer in binary form.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The integer object.\\n\\n/// * `_`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn bit_len(vm: &mut VM, this: Object, _: Vec<Object>) -> RuntimeResult {\\n\\n let i = verify_int_object!(this, \\\"bit_len\\\");\\n\\n vm.push_stack(Object::Int((i.abs() as f64).log2().ceil() as i64))\\n\\n}\\n\",\n \"file_path\": \"src/built_in/primitives/int.rs\",\n \"rank\": 23,\n \"score\": 210701.1919549371\n },\n {\n \"content\": \"/// Computes the arcsine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn asin(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.asin()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 24,\n \"score\": 210700.8014456089\n },\n {\n \"content\": \"/// Computes the sine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn sin(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.sin()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 25,\n \"score\": 210700.8014456089\n },\n {\n \"content\": \"/// Computes the cosine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn cos(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.cos()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 26,\n \"score\": 210700.8014456089\n },\n {\n \"content\": \"/// Computes the tangent of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn tan(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.tan()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 27,\n \"score\": 210700.8014456089\n },\n {\n \"content\": \"/// Computes the arctangent of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn atan(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.atan()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 28,\n \"score\": 210700.8014456089\n },\n {\n \"content\": \"/// Computes the arccosine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn acos(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.acos()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 29,\n \"score\": 210700.8014456089\n },\n {\n \"content\": \"/// Computes the hyperbolic arctangent of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn atanh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.atanh()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 30,\n \"score\": 210700.69605896543\n },\n {\n \"content\": \"/// Computes the cube root of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn cbrt(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.cbrt()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 31,\n \"score\": 210700.6960589654\n },\n {\n \"content\": \"/// Computes the hyperbolic sine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn sinh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.sinh()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 32,\n \"score\": 210700.6960589654\n },\n {\n \"content\": \"/// Computes the square root of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn sqrt(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.sqrt()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 33,\n \"score\": 210700.69605896543\n },\n {\n \"content\": \"/// Computes the hyperbolic arcsine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn asinh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.asinh()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 34,\n \"score\": 210700.69605896543\n },\n {\n \"content\": \"/// Computes the hyperbolic tangent of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn tanh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.tanh()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 35,\n \"score\": 210700.6960589654\n },\n {\n \"content\": \"/// Computes the hyperbolic cosine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn cosh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.cosh()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 36,\n \"score\": 210700.6960589654\n },\n {\n \"content\": \"/// Computes the hyperbolic arccosine of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn acosh(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.acosh()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 37,\n \"score\": 210700.69605896543\n },\n {\n \"content\": \"/// Computes the arctangent of the quotient of two Hinton numbers.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn atan2(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg1 = check_int_or_float!(args[0].clone());\\n\\n let arg2 = check_int_or_float!(args[1].clone());\\n\\n vm.push_stack(Object::Float(arg1.atan2(arg2)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 38,\n \"score\": 210700.59272017077\n },\n {\n \"content\": \"/// Computes the exponent (e<sup>x</sup>) of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn exp(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg.exp()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 39,\n \"score\": 210700.59272017077\n },\n {\n \"content\": \"/// Computes the logarithm of a Hinton number with an arbitrary base.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn log(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg1 = check_int_or_float!(args[0].clone());\\n\\n let arg2 = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg1.log(arg2)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 40,\n \"score\": 210700.59272017077\n },\n {\n \"content\": \"/// Computes the log-base-10 (log<sub>10</sub>(x)) of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn log10(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg1 = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg1.log10()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 41,\n \"score\": 210700.39195191898\n },\n {\n \"content\": \"/// Computes the log-base-2 (log<sub>2</sub>(x)) of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn log2(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg1 = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg1.log2()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 42,\n \"score\": 210700.391951919\n },\n {\n \"content\": \"/// Computes the natural logarithm (log<sub>e</sub>(x)) of a Hinton number.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `_`: *Not applicable.*\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn ln(vm: &mut VM, _: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let arg1 = check_int_or_float!(args[0].clone());\\n\\n vm.push_stack(Object::Float(arg1.ln()))\\n\\n}\\n\",\n \"file_path\": \"src/built_in/primitives/math.rs\",\n \"rank\": 43,\n \"score\": 210700.391951919\n },\n {\n \"content\": \"/// Implements the `random(...)` native function for Hinton, which computes a random number\\n\\n/// between [0, 1).\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_random(vm: &mut VM, _: Vec<Object>) -> RuntimeResult {\\n\\n vm.push_stack(Object::Float(rand::random()))\\n\\n}\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 44,\n \"score\": 208721.9092723477\n },\n {\n \"content\": \"/// Implements the `clock()` native function for Hinton, which retrieves the current time from\\n\\n/// the Unix Epoch time.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_clock(vm: &mut VM, _: Vec<Object>) -> RuntimeResult {\\n\\n let now = SystemTime::now().duration_since(SystemTime::UNIX_EPOCH);\\n\\n\\n\\n match now {\\n\\n Ok(t) => {\\n\\n let time = t.as_millis();\\n\\n vm.push_stack(Object::Int(time as i64))\\n\\n }\\n\\n Err(_) => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::Internal,\\n\\n message: String::from(\\\"System's time before UNIX EPOCH.\\\"),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 45,\n \"score\": 208721.63498233713\n },\n {\n \"content\": \"#[cfg(feature = \\\"show_raw_bytecode\\\")]\\n\\npub fn print_raw(chunk: &Chunk, name: &str) {\\n\\n let mut i = 0;\\n\\n\\n\\n // prints this chunk's name\\n\\n println!(\\\"==== {} ====\\\", name);\\n\\n\\n\\n while i < chunk.len() {\\n\\n let instr = chunk.get_byte(i);\\n\\n print!(\\\"{:#04X} \\\", instr as u8);\\n\\n\\n\\n if (i + 1) % 8 == 0 {\\n\\n println!();\\n\\n }\\n\\n\\n\\n i += 1;\\n\\n }\\n\\n\\n\\n println!(\\\"\\\\n\\\\nChunk Size: {}\\\", i);\\n\\n println!(\\\"================\\\\n\\\");\\n\\n}\\n\\n\\n\\n/// Disassembles the chunk, printing each instruction, and its related information.\\n\",\n \"file_path\": \"src/core/bytecode.rs\",\n \"rank\": 46,\n \"score\": 208589.52935361682\n },\n {\n \"content\": \"/// Converts a Hinton object into an Iterable object.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `o`: The object to be converted to an iterable.\\n\\n///\\n\\n/// # Returns:\\n\\n/// Result<Object, RuntimeResult>\\n\\npub fn make_iter(o: Object) -> Result<Object, RuntimeResult> {\\n\\n match o {\\n\\n Object::String(_) | Object::Array(_) | Object::Range(_) | Object::Tuple(_) => {\\n\\n Ok(Object::Iter(Rc::new(RefCell::new(IterObject {\\n\\n iter: Box::new(o),\\n\\n index: 0,\\n\\n }))))\\n\\n }\\n\\n // If the object is already an iterable, return that same object.\\n\\n Object::Iter(_) => Ok(o),\\n\\n _ => Err(RuntimeResult::Error {\\n\\n error: RuntimeErrorType::TypeError,\\n\\n message: format!(\\\"Cannot create iterable from '{}'.\\\", o.type_name()),\\n\\n }),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/objects/iter_obj.rs\",\n \"rank\": 47,\n \"score\": 206382.7292682619\n },\n {\n \"content\": \"/// Get the ith object in a Hinton array.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `arr`: A reference to the underlying `Vec<Object>` in a Hinton Array.\\n\\n/// - `index`: A Hinton object that will serve as the index of the array. For example, this object\\n\\n/// could be a Hinton integer, or a Hinton range.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\\n\\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the array.\\n\\nfn subscript_array(arr: &[Object], index: &Object) -> Result<Object, ObjectOprErrType> {\\n\\n match index {\\n\\n // Indexing type: Array[Int]\\n\\n Object::Int(idx) => {\\n\\n if let Some(pos) = to_bounded_index(*idx, arr.len()) {\\n\\n if let Some(val) = arr.get(pos) {\\n\\n return Ok(val.clone());\\n\\n }\\n\\n }\\n\\n }\\n\\n // Indexing type: Array[Bool]\\n\\n Object::Bool(val) => {\\n\\n let pos = (if *val { 1 } else { 0 }) as usize;\\n\\n if let Some(val) = arr.get(pos) {\\n\\n return Ok(val.clone());\\n\\n }\\n\\n }\\n\\n // Indexing type: Array[Range]\\n\\n Object::Range(_) => {\\n\\n unimplemented!(\\\"Array indexing with ranges.\\\")\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 48,\n \"score\": 204225.1551738548\n },\n {\n \"content\": \"/// Get the ith object in a Hinton tuple.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `tup`: A reference to the underlying `Vec<Object>` in a Hinton tuple.\\n\\n/// - `index`: A Hinton object that will serve as the index of the tuple. For example, this object\\n\\n/// could be a Hinton integer, or a Hinton range.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the index is\\n\\n/// within bounds. Returns `Err(ObjectOprErrType)` if there was an error while indexing the tuple.\\n\\nfn subscript_tuple(tup: &[Object], index: &Object) -> Result<Object, ObjectOprErrType> {\\n\\n match index {\\n\\n // Indexing type: Tuple[Int]\\n\\n Object::Int(idx) => {\\n\\n if let Some(pos) = to_bounded_index(*idx, tup.len()) {\\n\\n if let Some(val) = tup.get(pos) {\\n\\n return Ok(val.clone());\\n\\n }\\n\\n }\\n\\n }\\n\\n // Indexing type: Tuple[Bool]\\n\\n Object::Bool(val) => {\\n\\n let pos = (if *val { 1 } else { 0 }) as usize;\\n\\n\\n\\n if let Some(val) = tup.get(pos) {\\n\\n return Ok(val.clone());\\n\\n }\\n\\n }\\n\\n // Indexing type: Tuple[Range]\\n\\n Object::Range(_) => {\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 49,\n \"score\": 204225.1551738548\n },\n {\n \"content\": \"/// Gets the value associated with a key in a Hinton dictionary.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `dict`: A reference to the underlying `HashMap` in a Hinton dictionary.\\n\\n/// - `index`: A Hinton object that will serve as the index of the dictionary. For example, this\\n\\n/// object could be a Hinton string, or a Hinton range.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Result<Object, ObjectOprErrType>`: Returns `Ok(Object)` with a Hinton Object if the key\\n\\n/// exists in the dictionary. Returns `Err(ObjectOprErrType)` otherwise.\\n\\nfn subscript_dictionary(dict: &DictObject, index: &Object) -> Result<Object, ObjectOprErrType> {\\n\\n return match index {\\n\\n Object::String(key) => dict.get_prop(key),\\n\\n // Indexing type: Range[Range]\\n\\n Object::Range(_) => {\\n\\n unimplemented!(\\\"Range indexing with ranges.\\\")\\n\\n }\\n\\n _ => Err(ObjectOprErrType::TypeError(format!(\\n\\n \\\"Dictionaries can only be indexed by a String or Range. Found '{}' instead.\\\",\\n\\n index.type_name()\\n\\n ))),\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 50,\n \"score\": 198122.02265236617\n },\n {\n \"content\": \"/// Pushes an object into this Hinton array.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `this`: The array object.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this method call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn push(vm: &mut VM, this: Object, args: Vec<Object>) -> RuntimeResult {\\n\\n let obj = args[0].clone();\\n\\n verify_array_object!(this, \\\"push\\\").borrow_mut().push(obj);\\n\\n\\n\\n vm.push_stack(Object::Null)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/primitives/array.rs\",\n \"rank\": 51,\n \"score\": 195214.9887025869\n },\n {\n \"content\": \"/// Implements the `print(...)` native function for Hinton, which prints a value to the console.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_print(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n println!(\\\"{}\\\", args[0]);\\n\\n vm.push_stack(Object::Null)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 52,\n \"score\": 187578.26774978923\n },\n {\n \"content\": \"/// Implements the `iter(...)` native function for Hinton, which converts the give object to an\\n\\n/// iterable object.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_iter(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n match make_iter(args[0].clone()) {\\n\\n Ok(o) => vm.push_stack(o),\\n\\n Err(e) => e,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 53,\n \"score\": 187575.83798373383\n },\n {\n \"content\": \"/// Implements the `next(...)` native function for Hinton, which retrieves the next item in an\\n\\n/// iterable object.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_next(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n match &args[0] {\\n\\n Object::Iter(iter) => match get_next_in_iter(iter) {\\n\\n Ok(o) => vm.push_stack(o),\\n\\n Err(e) => e,\\n\\n },\\n\\n _ => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::TypeError,\\n\\n message: format!(\\\"Object of type '{}' is not iterable.\\\", args[0].type_name()),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 54,\n \"score\": 187575.41980347378\n },\n {\n \"content\": \"/// Implements the `assert(...)` native function for Hinton, which checks that the first argument\\n\\n/// of the function call is truthy.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_assert(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n let value = args[0].clone();\\n\\n\\n\\n if !value.is_falsey() {\\n\\n vm.push_stack(Object::Null)\\n\\n } else {\\n\\n let message = if args.len() == 2 {\\n\\n args[1].clone()\\n\\n } else {\\n\\n Object::String(String::from(\\\"Assertion failed on a falsey value.\\\"))\\n\\n };\\n\\n\\n\\n RuntimeResult::Error {\\n\\n error: RuntimeErrorType::AssertionError,\\n\\n message: format!(\\\"{}\\\", message),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 55,\n \"score\": 187574.88932002478\n },\n {\n \"content\": \"/// Implements the `input(...)` native function for Hinton, which gets user input from the console.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_input(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n print!(\\\"{}\\\", args[0]);\\n\\n\\n\\n // Print the programmer-provided message\\n\\n match io::Write::flush(&mut io::stdout()) {\\n\\n Ok(_) => {\\n\\n let mut input = String::new();\\n\\n // Get the user's input\\n\\n match io::stdin().read_line(&mut input) {\\n\\n Ok(_) => {\\n\\n input.pop(); // remove added newline\\n\\n vm.push_stack(Object::String(input))\\n\\n }\\n\\n Err(e) => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::Internal,\\n\\n message: format!(\\\"Failed to read input. IO failed read line. {}\\\", e),\\n\\n },\\n\\n }\\n\\n }\\n\\n Err(e) => RuntimeResult::Error {\\n\\n error: RuntimeErrorType::Internal,\\n\\n message: format!(\\\"Failed to read input. IO failed flush. {}\\\", e),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 56,\n \"score\": 187574.61367592067\n },\n {\n \"content\": \"/// Implements the `assert_eq(...)` native function for Hinton, which checks that\\n\\n/// the first two arguments of the function call ARE equal.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_assert_eq(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n let value1 = args[0].clone();\\n\\n let value2 = args[1].clone();\\n\\n\\n\\n if value1 == value2 {\\n\\n vm.push_stack(Object::Null)\\n\\n } else {\\n\\n let message = if args.len() == 3 {\\n\\n args[2].clone()\\n\\n } else {\\n\\n Object::String(String::from(\\\"Assertion values are not equal.\\\"))\\n\\n };\\n\\n\\n\\n RuntimeResult::Error {\\n\\n error: RuntimeErrorType::AssertionError,\\n\\n message: format!(\\\"{}\\\", message),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 57,\n \"score\": 183744.2040437244\n },\n {\n \"content\": \"/// Implements the `assert_ne(...)` native function for Hinton, which checks that the first two\\n\\n/// arguments of the function call are NOT equal.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vm`: A mutable reference to the virtual machine.\\n\\n/// * `args`: A vector of objects that will serve as arguments to this function call.\\n\\n///\\n\\n/// # Returns:\\n\\n/// RuntimeResult\\n\\nfn native_assert_ne(vm: &mut VM, args: Vec<Object>) -> RuntimeResult {\\n\\n let value1 = args[0].clone();\\n\\n let value2 = args[1].clone();\\n\\n\\n\\n if value1 != value2 {\\n\\n vm.push_stack(Object::Null)\\n\\n } else {\\n\\n let message = if args.len() == 3 {\\n\\n args[2].clone()\\n\\n } else {\\n\\n Object::String(String::from(\\\"Assertion values are equal.\\\"))\\n\\n };\\n\\n\\n\\n RuntimeResult::Error {\\n\\n error: RuntimeErrorType::AssertionError,\\n\\n message: format!(\\\"{}\\\", message),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/built_in/natives.rs\",\n \"rank\": 58,\n \"score\": 183744.2040437244\n },\n {\n \"content\": \"/// Gets the next item in a Hinton iterator.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `o`: A mutable, counted reference into the iterator.\\n\\n///\\n\\n/// # Returns:\\n\\n/// Result<Object, RuntimeResult>\\n\\npub fn get_next_in_iter(o: &Rc<RefCell<IterObject>>) -> Result<Object, RuntimeResult> {\\n\\n let mut iter = o.borrow_mut();\\n\\n let current_index = Object::Int(iter.index as i64);\\n\\n\\n\\n match iter.iter.subscript(¤t_index) {\\n\\n Ok(o) => {\\n\\n iter.index += 1;\\n\\n Ok(o)\\n\\n }\\n\\n Err(_) => Err(RuntimeResult::Error {\\n\\n error: RuntimeErrorType::StopIteration,\\n\\n message: String::from(\\\"End of Iterator.\\\"),\\n\\n }),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/objects/iter_obj.rs\",\n \"rank\": 59,\n \"score\": 179261.2802995696\n },\n {\n \"content\": \"/// Reports an error list coming from the parser or compiler.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `filepath`: The file path of where the errors occurred.\\n\\n/// - `errors`: An `ErrorList` containing the errors.\\n\\n/// - `source`: A reference to the source contents.\\n\\npub fn report_errors_list(filepath: &Path, errors: Vec<ErrorReport>, source: &str) {\\n\\n let source_lines: Vec<&str> = source.split('\\\\n').collect();\\n\\n\\n\\n for error in errors.iter() {\\n\\n eprintln!(\\\"{}\\\", error.message);\\n\\n print_error_source(\\n\\n filepath,\\n\\n error.line,\\n\\n error.column,\\n\\n error.lexeme_len,\\n\\n &source_lines,\\n\\n );\\n\\n }\\n\\n\\n\\n eprintln!(\\\"\\\\x1b[31;1mERROR:\\\\x1b[0m Aborted execution due to previous errors.\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/errors.rs\",\n \"rank\": 61,\n \"score\": 118551.82994070195\n },\n {\n \"content\": \"/// Prints a snippet of the source line associated with an error.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `line_num`: The source line number of the error.\\n\\n/// - `col`: The source column number of the error.\\n\\n/// - `len`: The length of the token that produced the error.\\n\\n/// - `src`: A reference to the source error line.\\n\\npub fn print_error_snippet(line_num: usize, col: usize, len: usize, src: &str) {\\n\\n let front_pad = (f64::log10(line_num as f64).floor() + 1f64) as usize;\\n\\n // +2 for one extra space at the front and one at the back\\n\\n let whitespace_pad_size = \\\" \\\".repeat(front_pad + 2);\\n\\n\\n\\n // Compute the column of the error with trimmed whitespaces from the source line.\\n\\n let mut removed_whitespace = 0;\\n\\n for c in src.chars() {\\n\\n if c == ' ' {\\n\\n removed_whitespace += 1;\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n let col = col - removed_whitespace;\\n\\n let trimmed_source = src.trim();\\n\\n\\n\\n if !trimmed_source.is_empty() {\\n\\n eprintln!(\\\"{}|\\\", whitespace_pad_size);\\n\\n eprint!(\\\" {} | \\\", line_num);\\n\\n eprintln!(\\\"{}\\\", trimmed_source);\\n\\n eprint!(\\\"{}|\\\", whitespace_pad_size);\\n\\n eprintln!(\\\" {}\\\\x1b[31;1m{}\\\\x1b[0m\\\", \\\" \\\".repeat(col), \\\"^\\\".repeat(len));\\n\\n }\\n\\n\\n\\n eprintln!()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/errors.rs\",\n \"rank\": 62,\n \"score\": 117103.15669244938\n },\n {\n \"content\": \"#[test]\\n\\nfn base_func_has_no_defaults() {\\n\\n let program = match Parser::parse(\\\"\\\") {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n match Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()) {\\n\\n Ok(res) => {\\n\\n if !res.defaults.is_empty() {\\n\\n panic!(\\\"Base function in script should have 0 default parameters.\\\")\\n\\n }\\n\\n }\\n\\n Err(_) => panic!(\\\"Compiler Had Errors.\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 63,\n \"score\": 115445.71462945748\n },\n {\n \"content\": \"/// Throws a runtime error to the console.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `vm`: A reference to the virtual machine.\\n\\n/// - `error`: The generated error.\\n\\n/// - `message`: The error message to be displayed.\\n\\n/// - `source`: The program's source text.\\n\\npub fn report_runtime_error(vm: &VM, error: RuntimeErrorType, message: String, source: &str) {\\n\\n let source_lines: Vec<&str> = source.split('\\\\n').collect();\\n\\n\\n\\n let frame = vm.current_frame();\\n\\n let f = match &frame.callee {\\n\\n CallFrameType::Closure(c) => c.function.borrow(),\\n\\n CallFrameType::Function(f) => f.borrow(),\\n\\n CallFrameType::Method(m) => m.method.function.borrow(),\\n\\n };\\n\\n let line = f.chunk.get_line_info(frame.ip - 1);\\n\\n\\n\\n let error_name = match error {\\n\\n RuntimeErrorType::ArgumentError => \\\"ArgumentError\\\",\\n\\n RuntimeErrorType::AssertionError => \\\"AssertionError\\\",\\n\\n RuntimeErrorType::IndexError => \\\"IndexError\\\",\\n\\n RuntimeErrorType::InstanceError => \\\"InstanceError\\\",\\n\\n RuntimeErrorType::Internal => \\\"InternalError\\\",\\n\\n RuntimeErrorType::KeyError => \\\"KeyError\\\",\\n\\n RuntimeErrorType::RecursionError => \\\"RecursionError\\\",\\n\\n RuntimeErrorType::ReferenceError => \\\"ReferenceError\\\",\\n\",\n \"file_path\": \"src/errors.rs\",\n \"rank\": 64,\n \"score\": 115194.69852191093\n },\n {\n \"content\": \"#[derive(Clone, Copy)]\\n\\nstruct LoopScope {\\n\\n /// The position of the loop's start in the chunk.\\n\\n position: usize,\\n\\n /// The scope depth of the body of the loop.\\n\\n scope_depth: usize,\\n\\n /// The type of loop this represents.\\n\\n loop_type: LoopType,\\n\\n}\\n\\n\\n\\n/// The types of loops available in Hinton. This is useful when \\\\\\n\\n/// compiling break statements to emit extra `POP` operations \\\\\\n\\n/// based on the loop type.\\n\",\n \"file_path\": \"src/compiler/mod.rs\",\n \"rank\": 65,\n \"score\": 98716.80552878325\n },\n {\n \"content\": \"/// Represents a break statement, which is associated with a loop.\\n\\nstruct BreakScope {\\n\\n /// The loop scope associated with this break statement.\\n\\n parent_loop: LoopScope,\\n\\n /// The position of the break's instruction in the chunk.\\n\\n chunk_pos: usize,\\n\\n}\\n\\n\\n\\n/// Represents a loop statement at compile time. Used primarily by\\n\\n/// break statements to know which loops to break.\\n\",\n \"file_path\": \"src/compiler/mod.rs\",\n \"rank\": 66,\n \"score\": 98716.80552878325\n },\n {\n \"content\": \"pub trait HTPrimitive {\\n\\n /// Gets the name class name of this Hinton primitive.\\n\\n fn name(&self) -> String;\\n\\n\\n\\n /// Gets the non-static members of this Hinton primitive.\\n\\n fn members(&mut self) -> &mut HashMap<String, ClassField>;\\n\\n\\n\\n /// Gets the static members of this Hinton primitive.\\n\\n fn statics(&mut self) -> &mut HashMap<String, ClassField>;\\n\\n\\n\\n /// Gets the default class object stored in this Hinton primitive.\\n\\n fn default() -> ClassObject;\\n\\n\\n\\n /// Binds a non-static method to this Hinton primitive.\\n\\n ///\\n\\n /// # Arguments\\n\\n /// * `name`: The name of the method.\\n\\n /// * `arity`: The method's arity.\\n\\n /// * `body`: The method's body.\\n\\n ///\\n\",\n \"file_path\": \"src/built_in/primitives/mod.rs\",\n \"rank\": 67,\n \"score\": 90808.75357281038\n },\n {\n \"content\": \"/// Maps a keyword string to a token type.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `id`: The identifier's string name.\\n\\n///\\n\\n/// # Returns\\n\\n/// `TokenType`: The type of token matched for given identifier name.\\n\\npub fn make_identifier_type(id: &str) -> TokenType {\\n\\n match id {\\n\\n \\\"and\\\" => TokenType::LOGIC_AND,\\n\\n \\\"as\\\" => TokenType::AS_OPERATOR,\\n\\n \\\"break\\\" => TokenType::BREAK_KW,\\n\\n \\\"class\\\" => TokenType::CLASS_KW,\\n\\n \\\"const\\\" => TokenType::CONST_KW,\\n\\n \\\"continue\\\" => TokenType::CONTINUE_KW,\\n\\n \\\"else\\\" => TokenType::ELSE_KW,\\n\\n \\\"enum\\\" => TokenType::ENUM_KW,\\n\\n \\\"equals\\\" => TokenType::LOGIC_EQ,\\n\\n \\\"false\\\" => TokenType::FALSE,\\n\\n \\\"fn\\\" => TokenType::FN_LAMBDA_KW,\\n\\n \\\"for\\\" => TokenType::FOR_KW,\\n\\n \\\"func\\\" => TokenType::FUNC_KW,\\n\\n \\\"if\\\" => TokenType::IF_KW,\\n\\n \\\"in\\\" => TokenType::IN_KW,\\n\\n \\\"is\\\" => TokenType::LOGIC_IS,\\n\\n \\\"mod\\\" => TokenType::MODULUS,\\n\\n \\\"new\\\" => TokenType::NEW_KW,\\n\",\n \"file_path\": \"src/core/tokens.rs\",\n \"rank\": 68,\n \"score\": 89161.08195682471\n },\n {\n \"content\": \"#[test]\\n\\nfn base_func_has_no_arity() {\\n\\n let program = match Parser::parse(\\\"\\\") {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n match Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()) {\\n\\n Ok(res) => {\\n\\n if res.min_arity != 0u8 && res.max_arity != 0u8 {\\n\\n panic!(\\\"Base function in script should have 0 parameters.\\\")\\n\\n }\\n\\n }\\n\\n Err(_) => panic!(\\\"Compiler Had Errors.\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 69,\n \"score\": 81606.12097553974\n },\n {\n \"content\": \"#[test]\\n\\nfn panic_on_unterminated_string() {\\n\\n if Parser::parse(\\\"\\\\\\\"hello world\\\").is_ok() {\\n\\n panic!(\\\"Should emit error on unterminated strings.\\\")\\n\\n }\\n\\n\\n\\n if Parser::parse(\\\"\\\\'hello world\\\").is_ok() {\\n\\n panic!(\\\"Should emit error on unterminated strings.\\\")\\n\\n }\\n\\n\\n\\n if Parser::parse(\\\"\\\\\\\"I\\\\\\\"m over here!\\\\\\\";\\\").is_ok() {\\n\\n panic!(\\\"Should emit error on unterminated strings.\\\")\\n\\n }\\n\\n\\n\\n if Parser::parse(\\\"'I'm over here!';\\\").is_ok() {\\n\\n panic!(\\\"Should emit error on unterminated strings.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/parser.rs\",\n \"rank\": 70,\n \"score\": 81501.6949473448\n },\n {\n \"content\": \"#[test]\\n\\nfn error_if_return_outside_func() {\\n\\n let program = match Parser::parse(\\\"while true { return false; }\\\") {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_ok() {\\n\\n panic!(\\\"Compiler should emit error when returning from outside of function.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 71,\n \"score\": 79135.58592624856\n },\n {\n \"content\": \"#[test]\\n\\nfn functions_have_access_to_global_vars() {\\n\\n let src = \\\"\\n\\n var global = \\\\\\\"some value\\\\\\\";\\n\\n\\n\\n func my_function() {\\n\\n print(global);\\n\\n }\\n\\n \\\";\\n\\n\\n\\n let program = match Parser::parse(src) {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_err() {\\n\\n panic!(\\\"Functions should have access to global declarations.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 72,\n \"score\": 79053.41017306925\n },\n {\n \"content\": \"#[test]\\n\\nfn allow_double_quoted_strings() {\\n\\n if Parser::parse(\\\"\\\\\\\"I am going to the moon tomorrow.\\\\\\\";\\\").is_err() {\\n\\n panic!(\\\"Should allow double-quoted strings.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/parser.rs\",\n \"rank\": 73,\n \"score\": 79035.02605967366\n },\n {\n \"content\": \"#[test]\\n\\nfn allow_single_quoted_strings() {\\n\\n if Parser::parse(\\\"'The sky is green!';\\\").is_err() {\\n\\n panic!(\\\"Should allow single-quoted strings.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/parser.rs\",\n \"rank\": 74,\n \"score\": 79035.02605967366\n },\n {\n \"content\": \"#[test]\\n\\nfn test_const_pool_no_duplicate_items() {\\n\\n let src = \\\"8.9;\\\".repeat(500);\\n\\n\\n\\n let program = match Parser::parse(src.as_str()) {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n match Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()) {\\n\\n Ok(res) => {\\n\\n if res.chunk.get_pool_size() != 1 {\\n\\n panic!(\\\"Items in the constant pool should not be duplicated.\\\")\\n\\n }\\n\\n }\\n\\n Err(_) => panic!(\\\"Compiler Had Errors.\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 75,\n \"score\": 76886.92876450847\n },\n {\n \"content\": \"#[test]\\n\\nfn allow_escaped_double_quoted_strings() {\\n\\n if Parser::parse(\\\"\\\\\\\"He said told me to \\\\\\\\\\\\\\\"stay quiet\\\\\\\\\\\\\\\", yesterday.\\\\\\\";\\\").is_err() {\\n\\n panic!(\\\"Should allow escaped double-quotes.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/parser.rs\",\n \"rank\": 76,\n \"score\": 76744.48327304826\n },\n {\n \"content\": \"#[test]\\n\\nfn allow_escaped_single_quoted_strings() {\\n\\n if Parser::parse(\\\"'I\\\\\\\\\\\\'m over here!';\\\").is_err() {\\n\\n panic!(\\\"Should allow escaped single-quoted strings.\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tests/parser.rs\",\n \"rank\": 77,\n \"score\": 76744.48327304826\n },\n {\n \"content\": \"\\n\\n if let Some(pos) = to_bounded_index(idx, i64::abs(max - min) as usize) {\\n\\n return if max - min > 0 {\\n\\n Ok(Object::Int(min + pos as i64))\\n\\n } else {\\n\\n Ok(Object::Int(min - pos as i64))\\n\\n };\\n\\n }\\n\\n }\\n\\n // Indexing type: Range[Range]\\n\\n Object::Range(_) => {\\n\\n unimplemented!(\\\"Range indexing with ranges.\\\")\\n\\n }\\n\\n _ => {\\n\\n return Err(ObjectOprErrType::TypeError(format!(\\n\\n \\\"Range index must be an Int or a Range. Found '{}' instead.\\\",\\n\\n index.type_name()\\n\\n )))\\n\\n }\\n\\n }\\n\\n\\n\\n Err(ObjectOprErrType::IndexError(String::from(\\n\\n \\\"Range index out of bounds.\\\",\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 78,\n \"score\": 74761.21846809864\n },\n {\n \"content\": \"use crate::errors::ObjectOprErrType;\\n\\nuse crate::objects::dictionary_obj::DictObject;\\n\\nuse crate::objects::{Object, RangeObject};\\n\\n\\n\\nimpl Object {\\n\\n /// Defines the indexing operation of Hinton objects.\\n\\n pub fn subscript(&self, index: &Object) -> Result<Object, ObjectOprErrType> {\\n\\n match self {\\n\\n Object::Array(arr) => subscript_array(&arr.borrow(), index),\\n\\n Object::Tuple(tup) => subscript_tuple(&tup, index),\\n\\n Object::String(str) => subscript_string(&str, index),\\n\\n Object::Range(range) => subscript_range(range, index),\\n\\n Object::Dict(dict) => subscript_dictionary(dict, index),\\n\\n _ => Err(ObjectOprErrType::TypeError(format!(\\n\\n \\\"Cannot index object of type '{}'.\\\",\\n\\n self.type_name()\\n\\n ))),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 79,\n \"score\": 74757.31849314779\n },\n {\n \"content\": \" }\\n\\n // Indexing type: String[Range]\\n\\n Object::Range(_) => {\\n\\n unimplemented!(\\\"String indexing with ranges.\\\")\\n\\n }\\n\\n _ => {\\n\\n return Err(ObjectOprErrType::TypeError(format!(\\n\\n \\\"String index must be an Int or a Range. Found '{}' instead.\\\",\\n\\n index.type_name()\\n\\n )))\\n\\n }\\n\\n }\\n\\n\\n\\n Err(ObjectOprErrType::IndexError(String::from(\\n\\n \\\"String index out of bounds.\\\",\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 80,\n \"score\": 74748.54184782394\n },\n {\n \"content\": \" }\\n\\n _ => {\\n\\n return Err(ObjectOprErrType::TypeError(format!(\\n\\n \\\"Array index must be an Int or a Range. Found '{}' instead.\\\",\\n\\n index.type_name()\\n\\n )))\\n\\n }\\n\\n }\\n\\n Err(ObjectOprErrType::IndexError(String::from(\\n\\n \\\"Array index out of bounds.\\\",\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 81,\n \"score\": 74746.67735827983\n },\n {\n \"content\": \" unimplemented!(\\\"Tuple indexing with ranges.\\\")\\n\\n }\\n\\n _ => {\\n\\n return Err(ObjectOprErrType::TypeError(format!(\\n\\n \\\"Tuple index must be an Int or a Range. Found '{}' instead.\\\",\\n\\n index.type_name()\\n\\n )))\\n\\n }\\n\\n }\\n\\n\\n\\n Err(ObjectOprErrType::IndexError(String::from(\\n\\n \\\"Tuple index out of bounds.\\\",\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 82,\n \"score\": 74746.44339056035\n },\n {\n \"content\": \"\\n\\n/// Takes an i64 integer and converts it into an object index. This allows indexing objects with\\n\\n/// negative integers.\\n\\n///\\n\\n/// # Parameters\\n\\n/// - `x`: The positive or negative index.\\n\\n/// - `len`: The length of the object.\\n\\n///\\n\\n/// # Returns\\n\\n/// - `Option<usize>`: Return Some(usize) if the index is within the bounds of the object's length\\n\\n/// or `None` otherwise.\\n\",\n \"file_path\": \"src/objects/indexing.rs\",\n \"rank\": 83,\n \"score\": 74743.8282413155\n },\n {\n \"content\": \"#[test]\\n\\nfn allow_return_inside_loop_inside_func() {\\n\\n let program = match Parser::parse(\\\"func my_func(x) { while x { return false; } }\\\") {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_err() {\\n\\n panic!(\\\"Compiler should allow returning from loop inside function.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 84,\n \"score\": 74705.48024536873\n },\n {\n \"content\": \"#[test]\\n\\nfn error_if_break_inside_func_inside_loop() {\\n\\n let program = match Parser::parse(\\\"while true { func my_func() { break; } }\\\") {\\n\\n Ok(ast) => ast,\\n\\n Err(_) => panic!(\\\"Parser Had Errors.\\\"),\\n\\n };\\n\\n\\n\\n if Compiler::compile_ast(&PathBuf::new(), &program, &BuiltIn::default()).is_ok() {\\n\\n panic!(\\\"Compiler should emit error when breaking outside inside a function inside a loop.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/compiler.rs\",\n \"rank\": 85,\n \"score\": 74705.48024536873\n }\n]","isConversational":false}}},{"rowIdx":1987,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"crates/eww/src/script_var_handler.rs"},"repo_name":{"kind":"string","value":"RianFuro/eww"},"commit":{"kind":"string","value":"e1558965ff45f72c35b7aeed15774381f32e0165"},"file_code":{"kind":"string","value":"use std::collections::HashMap;\n\nuse crate::{\n app,\n config::{create_script_var_failed_warn, script_var},\n};\nuse anyhow::*;\nuse app::DaemonCommand;\n\nuse eww_shared_util::VarName;\nuse nix::{\n sys::signal,\n unistd::{setpgid, Pid},\n};\nuse simplexpr::dynval::DynVal;\nuse tokio::{\n io::{AsyncBufReadExt, BufReader},\n sync::mpsc::UnboundedSender,\n};\nuse tokio_util::sync::CancellationToken;\nuse yuck::config::script_var_definition::{ListenScriptVar, PollScriptVar, ScriptVarDefinition, VarSource};\n\npub fn init(evt_send: UnboundedSender<DaemonCommand>) -> ScriptVarHandlerHandle {\n let (msg_send, mut msg_recv) = tokio::sync::mpsc::unbounded_channel();\n let handle = ScriptVarHandlerHandle { msg_send };\n std::thread::spawn(move || {\n let rt = tokio::runtime::Runtime::new().expect(\"Failed to initialize tokio runtime for script var handlers\");\n rt.block_on(async {\n let _: Result<_> = try {\n let mut handler = ScriptVarHandler {\n listen_handler: ListenVarHandler::new(evt_send.clone())?,\n poll_handler: PollVarHandler::new(evt_send)?,\n };\n crate::loop_select_exiting! {\n Some(msg) = msg_recv.recv() => match msg {\n ScriptVarHandlerMsg::AddVar(var) => {\n handler.add(var).await;\n }\n ScriptVarHandlerMsg::Stop(name) => {\n handler.stop_for_variable(&name)?;\n }\n ScriptVarHandlerMsg::StopAll => {\n handler.stop_all();\n }\n },\n else => break,\n };\n };\n })\n });\n handle\n}\n\npub struct ScriptVarHandlerHandle {\n msg_send: UnboundedSender<ScriptVarHandlerMsg>,\n}\n\nimpl ScriptVarHandlerHandle {\n \n pub fn add(&self, script_var: ScriptVarDefinition) {\n crate::print_result_err!(\n \"while forwarding instruction to script-var handler\",\n self.msg_send.send(ScriptVarHandlerMsg::AddVar(script_var))\n );\n }\n\n \n pub fn stop_for_variable(&self, name: VarName) {\n crate::print_result_err!(\n \"while forwarding instruction to script-var handler\",\n self.msg_send.send(ScriptVarHandlerMsg::Stop(name)),\n );\n }\n\n \n pub fn stop_all(&self) {\n crate::print_result_err!(\n \"while forwarding instruction to script-var handler\",\n self.msg_send.send(ScriptVarHandlerMsg::StopAll)\n );\n }\n}\n\n#[derive(Debug, Eq, PartialEq)]\nenum ScriptVarHandlerMsg {\n AddVar(ScriptVarDefinition),\n Stop(VarName),\n StopAll,\n}\n\nstruct ScriptVarHandler {\n listen_handler: ListenVarHandler,\n poll_handler: PollVarHandler,\n}\n\nimpl ScriptVarHandler {\n async fn add(&mut self, script_var: ScriptVarDefinition) {\n match script_var {\n ScriptVarDefinition::Poll(var) => self.poll_handler.start(var).await,\n ScriptVarDefinition::Listen(var) => self.listen_handler.start(var).await,\n };\n }\n\n \n fn stop_for_variable(&mut self, name: &VarName) -> Result<()> {\n log::debug!(\"Stopping script var process for variable {}\", name);\n self.listen_handler.stop_for_variable(name);\n self.poll_handler.stop_for_variable(name);\n Ok(())\n }\n\n \n fn stop_all(&mut self) {\n log::debug!(\"Stopping script-var-handlers\");\n self.listen_handler.stop_all();\n self.poll_handler.stop_all();\n }\n}\n\nstruct PollVarHandler {\n evt_send: UnboundedSender<DaemonCommand>,\n poll_handles: HashMap<VarName, CancellationToken>,\n}\n\nimpl PollVarHandler {\n fn new(evt_send: UnboundedSender<DaemonCommand>) -> Result<Self> {\n let handler = PollVarHandler { evt_send, poll_handles: HashMap::new() };\n Ok(handler)\n }\n\n async fn start(&mut self, var: PollScriptVar) {\n if self.poll_handles.contains_key(&var.name) {\n return;\n }\n\n log::debug!(\"starting poll var {}\", &var.name);\n let cancellation_token = CancellationToken::new();\n self.poll_handles.insert(var.name.clone(), cancellation_token.clone());\n let evt_send = self.evt_send.clone();\n tokio::spawn(async move {\n let result: Result<_> = try {\n evt_send.send(app::DaemonCommand::UpdateVars(vec![(var.name.clone(), run_poll_once(&var)?)]))?;\n };\n if let Err(err) = result {\n crate::error_handling_ctx::print_error(err);\n }\n\n crate::loop_select_exiting! {\n _ = cancellation_token.cancelled() => break,\n _ = tokio::time::sleep(var.interval) => {\n let result: Result<_> = try {\n evt_send.send(app::DaemonCommand::UpdateVars(vec![(var.name.clone(), run_poll_once(&var)?)]))?;\n };\n\n if let Err(err) = result {\n crate::error_handling_ctx::print_error(err);\n }\n }\n }\n });\n }\n\n fn stop_for_variable(&mut self, name: &VarName) {\n if let Some(token) = self.poll_handles.remove(name) {\n log::debug!(\"stopped poll var {}\", name);\n token.cancel()\n }\n }\n\n fn stop_all(&mut self) {\n self.poll_handles.drain().for_each(|(_, token)| token.cancel());\n }\n}\n\nfn run_poll_once(var: &PollScriptVar) -> Result<DynVal> {\n match &var.command {\n VarSource::Shell(span, command) => {\n script_var::run_command(command).map_err(|e| anyhow!(create_script_var_failed_warn(*span, &var.name, &e.to_string())))\n }\n VarSource::Function(x) => x().map_err(|e| anyhow!(e)),\n }\n}\n\nimpl Drop for PollVarHandler {\n fn drop(&mut self) {\n self.stop_all();\n }\n}\n\nstruct ListenVarHandler {\n evt_send: UnboundedSender<DaemonCommand>,\n listen_process_handles: HashMap<VarName, CancellationToken>,\n}\n\nimpl ListenVarHandler {\n fn new(evt_send: UnboundedSender<DaemonCommand>) -> Result<Self> {\n let handler = ListenVarHandler { evt_send, listen_process_handles: HashMap::new() };\n Ok(handler)\n }\n\n async fn start(&mut self, var: ListenScriptVar) {\n log::debug!(\"starting listen-var {}\", &var.name);\n let cancellation_token = CancellationToken::new();\n self.listen_process_handles.insert(var.name.clone(), cancellation_token.clone());\n\n let evt_send = self.evt_send.clone();\n tokio::spawn(async move {\n crate::try_logging_errors!(format!(\"Executing listen var-command {}\", &var.command) => {\n let mut handle = unsafe {\n tokio::process::Command::new(\"sh\")\n .args(&[\"-c\", &var.command])\n .stdout(std::process::Stdio::piped())\n .stderr(std::process::Stdio::piped())\n .stdin(std::process::Stdio::null())\n .pre_exec(|| {\n let _ = setpgid(Pid::from_raw(0), Pid::from_raw(0));\n Ok(())\n }).spawn()?\n };\n let mut stdout_lines = BufReader::new(handle.stdout.take().unwrap()).lines();\n let mut stderr_lines = BufReader::new(handle.stderr.take().unwrap()).lines();\n crate::loop_select_exiting! {\n _ = handle.wait() => break,\n _ = cancellation_token.cancelled() => break,\n Ok(Some(line)) = stdout_lines.next_line() => {\n let new_value = DynVal::from_string(line.to_owned());\n evt_send.send(DaemonCommand::UpdateVars(vec![(var.name.to_owned(), new_value)]))?;\n }\n Ok(Some(line)) = stderr_lines.next_line() => {\n log::warn!(\"stderr of `{}`: {}\", var.name, line);\n }\n else => break,\n }\n terminate_handle(handle).await;\n });\n });\n }\n\n fn stop_for_variable(&mut self, name: &VarName) {\n if let Some(token) = self.listen_process_handles.remove(name) {\n log::debug!(\"stopped listen-var {}\", name);\n token.cancel();\n }\n }\n\n fn stop_all(&mut self) {\n self.listen_process_handles.drain().for_each(|(_, token)| token.cancel());\n }\n}\n\nimpl Drop for ListenVarHandler {\n fn drop(&mut self) {\n self.stop_all();\n }\n}\n\nasync fn terminate_handle(mut child: tokio::process::Child) {\n if let Some(id) = child.id() {\n let _ = signal::killpg(Pid::from_raw(id as i32), signal::SIGTERM);\n tokio::select! {\n _ = child.wait() => {},\n _ = tokio::time::sleep(std::time::Duration::from_secs(10)) => {\n let _ = child.kill().await;\n }\n };\n } else {\n let _ = child.kill().await;\n }\n}\n"},"prefix":{"kind":"string","value":"use std::collections::HashMap;\n\nuse crate::{\n app,\n config::{create_script_var_failed_warn, script_var},\n};\nuse anyhow::*;\nuse app::DaemonCommand;\n\nuse eww_shared_util::VarName;\nuse nix::{\n sys::signal,\n unistd::{setpgid, Pid},\n};\nuse simplexpr::dynval::DynVal;\nuse tokio::{\n io::{AsyncBufReadExt, BufReader},\n sync::mpsc::UnboundedSender,\n};\nuse tokio_util::sync::CancellationToken;\nuse yuck::config::script_var_definition::{ListenScriptVar, PollScriptVar, ScriptVarDefinition, VarSource};\n\npub fn init(evt_send: UnboundedSender<DaemonCommand>) -> ScriptVarHandlerHandle {\n let (msg_send, mut msg_recv) = tokio::sync::mpsc::unbounded_channel();\n let handle = ScriptVarHandlerHandle { msg_send };\n std::thread::spawn(move || {\n let rt = tokio::runtime::Runtime::new().expect(\"Failed to initialize tokio runtime for script var handlers\");\n rt.block_on(async {\n let _: Result<_> = try {\n let mut handler = ScriptVarHandler {\n listen_handler: ListenVarHandler::new(evt_send.clone())?,\n poll_handler: PollVarHandler::new(evt_send)?,\n };\n crate::loop_select_exiting! {\n Some(msg) = msg_recv.recv() => match msg {\n ScriptVarHandlerMsg::AddVar(var) => {\n handler.add(var).await;\n }\n ScriptVarHandlerMsg::Stop(name) => {\n handler.stop_for_variable(&name)?;\n }\n ScriptVarHandlerMsg::StopAll => {\n handler.stop_all();\n }\n },\n else => break,\n };\n };\n })\n });\n handle\n}\n\npub struct ScriptVarHandlerHandle {\n msg_send: UnboundedSender<ScriptVarHandlerMsg>,\n}\n\nimpl ScriptVarHandlerHandle {\n \n "},"suffix":{"kind":"string","value":"\n\n \n pub fn stop_for_variable(&self, name: VarName) {\n crate::print_result_err!(\n \"while forwarding instruction to script-var handler\",\n self.msg_send.send(ScriptVarHandlerMsg::Stop(name)),\n );\n }\n\n \n pub fn stop_all(&self) {\n crate::print_result_err!(\n \"while forwarding instruction to script-var handler\",\n self.msg_send.send(ScriptVarHandlerMsg::StopAll)\n );\n }\n}\n\n#[derive(Debug, Eq, PartialEq)]\nenum ScriptVarHandlerMsg {\n AddVar(ScriptVarDefinition),\n Stop(VarName),\n StopAll,\n}\n\nstruct ScriptVarHandler {\n listen_handler: ListenVarHandler,\n poll_handler: PollVarHandler,\n}\n\nimpl ScriptVarHandler {\n async fn add(&mut self, script_var: ScriptVarDefinition) {\n match script_var {\n ScriptVarDefinition::Poll(var) => self.poll_handler.start(var).await,\n ScriptVarDefinition::Listen(var) => self.listen_handler.start(var).await,\n };\n }\n\n \n fn stop_for_variable(&mut self, name: &VarName) -> Result<()> {\n log::debug!(\"Stopping script var process for variable {}\", name);\n self.listen_handler.stop_for_variable(name);\n self.poll_handler.stop_for_variable(name);\n Ok(())\n }\n\n \n fn stop_all(&mut self) {\n log::debug!(\"Stopping script-var-handlers\");\n self.listen_handler.stop_all();\n self.poll_handler.stop_all();\n }\n}\n\nstruct PollVarHandler {\n evt_send: UnboundedSender<DaemonCommand>,\n poll_handles: HashMap<VarName, CancellationToken>,\n}\n\nimpl PollVarHandler {\n fn new(evt_send: UnboundedSender<DaemonCommand>) -> Result<Self> {\n let handler = PollVarHandler { evt_send, poll_handles: HashMap::new() };\n Ok(handler)\n }\n\n async fn start(&mut self, var: PollScriptVar) {\n if self.poll_handles.contains_key(&var.name) {\n return;\n }\n\n log::debug!(\"starting poll var {}\", &var.name);\n let cancellation_token = CancellationToken::new();\n self.poll_handles.insert(var.name.clone(), cancellation_token.clone());\n let evt_send = self.evt_send.clone();\n tokio::spawn(async move {\n let result: Result<_> = try {\n evt_send.send(app::DaemonCommand::UpdateVars(vec![(var.name.clone(), run_poll_once(&var)?)]))?;\n };\n if let Err(err) = result {\n crate::error_handling_ctx::print_error(err);\n }\n\n crate::loop_select_exiting! {\n _ = cancellation_token.cancelled() => break,\n _ = tokio::time::sleep(var.interval) => {\n let result: Result<_> = try {\n evt_send.send(app::DaemonCommand::UpdateVars(vec![(var.name.clone(), run_poll_once(&var)?)]))?;\n };\n\n if let Err(err) = result {\n crate::error_handling_ctx::print_error(err);\n }\n }\n }\n });\n }\n\n fn stop_for_variable(&mut self, name: &VarName) {\n if let Some(token) = self.poll_handles.remove(name) {\n log::debug!(\"stopped poll var {}\", name);\n token.cancel()\n }\n }\n\n fn stop_all(&mut self) {\n self.poll_handles.drain().for_each(|(_, token)| token.cancel());\n }\n}\n\nfn run_poll_once(var: &PollScriptVar) -> Result<DynVal> {\n match &var.command {\n VarSource::Shell(span, command) => {\n script_var::run_command(command).map_err(|e| anyhow!(create_script_var_failed_warn(*span, &var.name, &e.to_string())))\n }\n VarSource::Function(x) => x().map_err(|e| anyhow!(e)),\n }\n}\n\nimpl Drop for PollVarHandler {\n fn drop(&mut self) {\n self.stop_all();\n }\n}\n\nstruct ListenVarHandler {\n evt_send: UnboundedSender<DaemonCommand>,\n listen_process_handles: HashMap<VarName, CancellationToken>,\n}\n\nimpl ListenVarHandler {\n fn new(evt_send: UnboundedSender<DaemonCommand>) -> Result<Self> {\n let handler = ListenVarHandler { evt_send, listen_process_handles: HashMap::new() };\n Ok(handler)\n }\n\n async fn start(&mut self, var: ListenScriptVar) {\n log::debug!(\"starting listen-var {}\", &var.name);\n let cancellation_token = CancellationToken::new();\n self.listen_process_handles.insert(var.name.clone(), cancellation_token.clone());\n\n let evt_send = self.evt_send.clone();\n tokio::spawn(async move {\n crate::try_logging_errors!(format!(\"Executing listen var-command {}\", &var.command) => {\n let mut handle = unsafe {\n tokio::process::Command::new(\"sh\")\n .args(&[\"-c\", &var.command])\n .stdout(std::process::Stdio::piped())\n .stderr(std::process::Stdio::piped())\n .stdin(std::process::Stdio::null())\n .pre_exec(|| {\n let _ = setpgid(Pid::from_raw(0), Pid::from_raw(0));\n Ok(())\n }).spawn()?\n };\n let mut stdout_lines = BufReader::new(handle.stdout.take().unwrap()).lines();\n let mut stderr_lines = BufReader::new(handle.stderr.take().unwrap()).lines();\n crate::loop_select_exiting! {\n _ = handle.wait() => break,\n _ = cancellation_token.cancelled() => break,\n Ok(Some(line)) = stdout_lines.next_line() => {\n let new_value = DynVal::from_string(line.to_owned());\n evt_send.send(DaemonCommand::UpdateVars(vec![(var.name.to_owned(), new_value)]))?;\n }\n Ok(Some(line)) = stderr_lines.next_line() => {\n log::warn!(\"stderr of `{}`: {}\", var.name, line);\n }\n else => break,\n }\n terminate_handle(handle).await;\n });\n });\n }\n\n fn stop_for_variable(&mut self, name: &VarName) {\n if let Some(token) = self.listen_process_handles.remove(name) {\n log::debug!(\"stopped listen-var {}\", name);\n token.cancel();\n }\n }\n\n fn stop_all(&mut self) {\n self.listen_process_handles.drain().for_each(|(_, token)| token.cancel());\n }\n}\n\nimpl Drop for ListenVarHandler {\n fn drop(&mut self) {\n self.stop_all();\n }\n}\n\nasync fn terminate_handle(mut child: tokio::process::Child) {\n if let Some(id) = child.id() {\n let _ = signal::killpg(Pid::from_raw(id as i32), signal::SIGTERM);\n tokio::select! {\n _ = child.wait() => {},\n _ = tokio::time::sleep(std::time::Duration::from_secs(10)) => {\n let _ = child.kill().await;\n }\n };\n } else {\n let _ = child.kill().await;\n }\n}\n"},"middle":{"kind":"string","value":"pub fn add(&self, script_var: ScriptVarDefinition) {\n crate::print_result_err!(\n \"while forwarding instruction to script-var handler\",\n self.msg_send.send(ScriptVarHandlerMsg::AddVar(script_var))\n );\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"pub fn initial_value(var: &ScriptVarDefinition) -> Result<DynVal> {\n\n match var {\n\n ScriptVarDefinition::Poll(x) => match &x.initial_value {\n\n Some(value) => Ok(value.clone()),\n\n None => match &x.command {\n\n VarSource::Function(f) => f()\n\n .map_err(|err| anyhow!(err))\n\n .with_context(|| format!(\"Failed to compute initial value for {}\", &var.name())),\n\n VarSource::Shell(span, command) => {\n\n run_command(command).map_err(|e| anyhow!(create_script_var_failed_warn(*span, var.name(), &e.to_string())))\n\n }\n\n },\n\n },\n\n\n\n ScriptVarDefinition::Listen(var) => Ok(var.initial_value.clone()),\n\n }\n\n}\n\n\n","file_path":"crates/eww/src/config/script_var.rs","rank":1,"score":260190.33509219586},{"content":"pub fn stringify_diagnostic(mut diagnostic: codespan_reporting::diagnostic::Diagnostic<usize>) -> anyhow::Result<String> {\n\n diagnostic.labels.drain_filter(|label| Span(label.range.start, label.range.end, label.file_id).is_dummy());\n\n\n\n let mut config = term::Config::default();\n\n let mut chars = Chars::box_drawing();\n\n chars.single_primary_caret = '─';\n\n config.chars = chars;\n\n config.chars.note_bullet = '→';\n\n let mut buf = Vec::new();\n\n let mut writer = term::termcolor::Ansi::new(&mut buf);\n\n let files = YUCK_FILES.read().unwrap();\n\n term::emit(&mut writer, &config, &*files, &diagnostic)?;\n\n Ok(String::from_utf8(buf)?)\n\n}\n","file_path":"crates/eww/src/error_handling_ctx.rs","rank":3,"score":230103.73131626975},{"content":"pub fn print_error(err: anyhow::Error) {\n\n match anyhow_err_to_diagnostic(&err) {\n\n Some(diag) => match stringify_diagnostic(diag) {\n\n Ok(diag) => {\n\n eprintln!(\"{}\", diag);\n\n }\n\n Err(_) => {\n\n log::error!(\"{:?}\", err);\n\n }\n\n },\n\n None => {\n\n log::error!(\"{:?}\", err);\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/eww/src/error_handling_ctx.rs","rank":5,"score":221111.47607127758},{"content":"pub fn format_error(err: &anyhow::Error) -> String {\n\n for err in err.chain() {\n\n format!(\"chain: {}\", err);\n\n }\n\n anyhow_err_to_diagnostic(err).and_then(|diag| stringify_diagnostic(diag).ok()).unwrap_or_else(|| format!(\"{:?}\", err))\n\n}\n\n\n","file_path":"crates/eww/src/error_handling_ctx.rs","rank":6,"score":214142.5178773678},{"content":"pub fn anyhow_err_to_diagnostic(err: &anyhow::Error) -> Option<Diagnostic<usize>> {\n\n if let Some(err) = err.downcast_ref::<DiagError>() {\n\n Some(err.diag.clone())\n\n } else if let Some(err) = err.downcast_ref::<AstError>() {\n\n Some(err.to_diagnostic())\n\n } else if let Some(err) = err.downcast_ref::<ConversionError>() {\n\n Some(err.to_diagnostic())\n\n } else if let Some(err) = err.downcast_ref::<ValidationError>() {\n\n Some(err.to_diagnostic())\n\n } else if let Some(err) = err.downcast_ref::<EvalError>() {\n\n Some(err.to_diagnostic())\n\n } else {\n\n None\n\n }\n\n}\n\n\n\n// pub fn print_diagnostic(diagnostic: codespan_reporting::diagnostic::Diagnostic<usize>) {\n\n// match stringify_diagnostic(diagnostic.clone()) {\n\n// Ok(diag) => {\n\n// eprintln!(\"{}\", diag);\n\n//}\n\n// Err(_) => {\n\n// log::error!(\"{:?}\", diagnostic);\n\n//}\n\n\n","file_path":"crates/eww/src/error_handling_ctx.rs","rank":9,"score":209107.3727584941},{"content":"pub fn get_inbuilt_vars() -> HashMap<VarName, ScriptVarDefinition> {\n\n builtin_vars! {Duration::new(2, 0),\n\n // @desc EWW_TEMPS - Heat of the components in Celcius\n\n \"EWW_TEMPS\" => || Ok(DynVal::from(get_temperatures())),\n\n\n\n // @desc EWW_RAM - Information on ram and swap usage in kB.\n\n \"EWW_RAM\" => || Ok(DynVal::from(get_ram())),\n\n\n\n // @desc EWW_DISK - Information on on all mounted partitions (Might report inaccurately on some filesystems, like btrfs)\\nExample: `{EWW_DISK[\"/\"]}`\n\n \"EWW_DISK\" => || Ok(DynVal::from(get_disks())),\n\n\n\n // @desc EWW_BATTERY - Battery capacity in procent of the main battery\n\n \"EWW_BATTERY\" => || Ok(DynVal::from(\n\n match get_battery_capacity() {\n\n Err(e) => {\n\n log::error!(\"Couldn't get the battery capacity: {:?}\", e);\n\n \"Error: Check `eww log` for more details\".to_string()\n\n }\n\n Ok(o) => o,\n\n }\n\n )),\n\n\n\n // @desc EWW_CPU - Information on the CPU cores: frequency and usage (No MacOS support)\n\n \"EWW_CPU\" => || Ok(DynVal::from(get_cpus())),\n\n\n\n // @desc EWW_NET - Bytes up/down on all interfaces\n\n \"EWW_NET\" => || Ok(DynVal::from(net())),\n\n }\n\n}\n","file_path":"crates/eww/src/config/inbuilt.rs","rank":10,"score":197879.18612002907},{"content":"pub fn create_script_var_failed_warn(span: Span, var_name: &VarName, error_output: &str) -> DiagError {\n\n DiagError::new(gen_diagnostic! {\n\n kind = Severity::Warning,\n\n msg = format!(\"The script for the `{}`-variable exited unsuccessfully\", var_name),\n\n label = span => \"Defined here\",\n\n note = error_output,\n\n })\n\n}\n\n\n","file_path":"crates/eww/src/config/script_var.rs","rank":12,"score":187168.7684974826},{"content":"/// Run a command and get the output\n\npub fn run_command(cmd: &str) -> Result<DynVal> {\n\n log::debug!(\"Running command: {}\", cmd);\n\n let command = Command::new(\"/bin/sh\").arg(\"-c\").arg(cmd).output()?;\n\n if !command.status.success() {\n\n bail!(\"Failed with output:\\n{}\", String::from_utf8(command.stderr)?);\n\n }\n\n let output = String::from_utf8(command.stdout)?;\n\n let output = output.trim_matches('\\n');\n\n Ok(DynVal::from(output))\n\n}\n","file_path":"crates/eww/src/config/script_var.rs","rank":13,"score":185986.79019191934},{"content":"pub fn clear_files() {\n\n *YUCK_FILES.write().unwrap() = YuckFiles::new();\n\n}\n\n\n","file_path":"crates/eww/src/error_handling_ctx.rs","rank":14,"score":180115.9936716832},{"content":"pub fn validate_variables_in_widget_use(\n\n defs: &HashMap<String, WidgetDefinition>,\n\n variables: &HashSet<VarName>,\n\n widget: &WidgetUse,\n\n is_in_definition: bool,\n\n) -> Result<(), ValidationError> {\n\n let matching_definition = defs.get(&widget.name);\n\n if let Some(matching_def) = matching_definition {\n\n let missing_arg = matching_def\n\n .expected_args\n\n .iter()\n\n .find(|expected| !expected.optional && !widget.attrs.attrs.contains_key(&expected.name));\n\n if let Some(missing_arg) = missing_arg {\n\n return Err(ValidationError::MissingAttr {\n\n widget_name: widget.name.clone(),\n\n arg_name: missing_arg.name.clone(),\n\n arg_list_span: Some(matching_def.args_span),\n\n use_span: widget.attrs.span,\n\n });\n\n }\n","file_path":"crates/yuck/src/config/validate.rs","rank":15,"score":177229.38007662434},{"content":"/// Load an [EwwConfig] from a given file, resetting and applying the global YuckFiles object in [error_handling_ctx].\n\npub fn read_from_file(path: impl AsRef<Path>) -> Result<EwwConfig> {\n\n error_handling_ctx::clear_files();\n\n EwwConfig::read_from_file(&mut error_handling_ctx::YUCK_FILES.write().unwrap(), path)\n\n}\n\n\n\n/// Eww configuration structure.\n\n#[derive(Debug, Clone)]\n\npub struct EwwConfig {\n\n widgets: HashMap<String, WidgetDefinition>,\n\n windows: HashMap<String, EwwWindowDefinition>,\n\n initial_variables: HashMap<VarName, DynVal>,\n\n script_vars: HashMap<VarName, ScriptVarDefinition>,\n\n\n\n // Links variable which affect state (active/inactive) of poll var to those poll variables\n\n poll_var_links: HashMap<VarName, Vec<VarName>>,\n\n}\n\n\n\nimpl Default for EwwConfig {\n\n fn default() -> Self {\n\n Self {\n","file_path":"crates/eww/src/config/eww_config.rs","rank":16,"score":168976.55152283236},{"content":"pub fn create_pair() -> (DaemonResponseSender, tokio::sync::mpsc::UnboundedReceiver<DaemonResponse>) {\n\n let (sender, recv) = tokio::sync::mpsc::unbounded_channel();\n\n (DaemonResponseSender(sender), recv)\n\n}\n\n\n\nimpl DaemonResponseSender {\n\n pub fn send_success(&self, s: String) -> Result<()> {\n\n self.0.send(DaemonResponse::Success(s)).context(\"Failed to send success response from application thread\")\n\n }\n\n\n\n pub fn send_failure(&self, s: String) -> Result<()> {\n\n self.0.send(DaemonResponse::Failure(s)).context(\"Failed to send failure response from application thread\")\n\n }\n\n\n\n /// Given a list of errors, respond with an error value if there are any errors, and respond with success otherwise.\n\n pub fn respond_with_error_list(&self, errors: impl IntoIterator<Item = anyhow::Error>) -> Result<()> {\n\n let errors = errors.into_iter().map(|e| error_handling_ctx::format_error(&e)).join(\"\\n\");\n\n if errors.is_empty() {\n\n self.send_success(String::new())\n\n } else {\n","file_path":"crates/eww/src/daemon_response.rs","rank":17,"score":164842.30893556576},{"content":"fn initialize_window(\n\n monitor_geometry: gdk::Rectangle,\n\n root_widget: gtk::Widget,\n\n window_def: config::EwwWindowDefinition,\n\n) -> Result<EwwWindow> {\n\n let window = display_backend::initialize_window(&window_def, monitor_geometry)\n\n .with_context(|| format!(\"monitor {} is unavailable\", window_def.monitor_number.unwrap()))?;\n\n\n\n window.set_title(&format!(\"Eww - {}\", window_def.name));\n\n window.set_position(gtk::WindowPosition::None);\n\n window.set_gravity(gdk::Gravity::Center);\n\n\n\n if let Some(geometry) = window_def.geometry {\n\n let actual_window_rect = get_window_rectangle(geometry, monitor_geometry);\n\n window.set_size_request(actual_window_rect.width, actual_window_rect.height);\n\n window.set_default_size(actual_window_rect.width, actual_window_rect.height);\n\n }\n\n window.set_decorated(false);\n\n window.set_skip_taskbar_hint(true);\n\n window.set_skip_pager_hint(true);\n","file_path":"crates/eww/src/app.rs","rank":18,"score":163614.34615750366},{"content":"/// Replace all env-var references of the format `\"something ${foo}\"` in a string\n\n/// by the actual env-variables. If the env-var isn't found, will replace the\n\n/// reference with an empty string.\n\npub fn replace_env_var_references(input: String) -> String {\n\n regex!(r\"\\$\\{([^\\s]*)\\}\")\n\n .replace_all(&input, |var_name: ®ex::Captures| std::env::var(var_name.get(1).unwrap().as_str()).unwrap_or_default())\n\n .into_owned()\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::replace_env_var_references;\n\n use std;\n\n\n\n #[test]\n\n fn test_replace_env_var_references() {\n\n let scss = \"$test: ${USER};\";\n\n\n\n assert_eq!(\n\n replace_env_var_references(String::from(scss)),\n\n format!(\"$test: {};\", std::env::var(\"USER\").unwrap_or_default())\n\n )\n\n }\n\n}\n","file_path":"crates/eww/src/util.rs","rank":19,"score":162501.49149464382},{"content":"/// get a single ast node from a list of asts, returning an Err if the length is not exactly 1.\n\npub fn require_single_toplevel(span: Span, mut asts: Vec<Ast>) -> AstResult<Ast> {\n\n match asts.len() {\n\n 0 => Err(AstError::MissingNode(span)),\n\n 1 => Ok(asts.remove(0)),\n\n _ => Err(AstError::TooManyNodes(asts.get(1).unwrap().span().to(asts.last().unwrap().span()), 1)),\n\n }\n\n}\n\n\n\nmacro_rules! test_parser {\n\n ($($text:literal),*) => {{\n\n let p = parser::AstParser::new();\n\n use lexer::Lexer;\n\n\n\n ::insta::with_settings!({sort_maps => true}, {\n\n $(\n\n ::insta::assert_debug_snapshot!(p.parse(0, Lexer::new(0, $text.to_string())));\n\n )*\n\n });\n\n }}\n\n}\n\n\n","file_path":"crates/yuck/src/parser/mod.rs","rank":20,"score":158801.57130021427},{"content":"pub fn do_server_call(stream: &mut UnixStream, action: &opts::ActionWithServer) -> Result<Option<DaemonResponse>> {\n\n log::debug!(\"Forwarding options to server\");\n\n stream.set_nonblocking(false).context(\"Failed to set stream to non-blocking\")?;\n\n\n\n let message_bytes = bincode::serialize(&action)?;\n\n\n\n stream.write(&(message_bytes.len() as u32).to_be_bytes()).context(\"Failed to send command size header to IPC stream\")?;\n\n\n\n stream.write_all(&message_bytes).context(\"Failed to write command to IPC stream\")?;\n\n\n\n let mut buf = Vec::new();\n\n stream.set_read_timeout(Some(std::time::Duration::from_millis(100))).context(\"Failed to set read timeout\")?;\n\n stream.read_to_end(&mut buf).context(\"Error reading response from server\")?;\n\n\n\n Ok(if buf.is_empty() {\n\n None\n\n } else {\n\n let buf = bincode::deserialize(&buf)?;\n\n Some(buf)\n\n })\n\n}\n","file_path":"crates/eww/src/client.rs","rank":21,"score":154522.90095218428},{"content":"pub fn handle_client_only_action(paths: &EwwPaths, action: ActionClientOnly) -> Result<()> {\n\n match action {\n\n ActionClientOnly::Logs => {\n\n std::process::Command::new(\"tail\")\n\n .args([\"-f\", paths.get_log_file().to_string_lossy().as_ref()].iter())\n\n .stdin(Stdio::null())\n\n .spawn()?\n\n .wait()?;\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"crates/eww/src/client.rs","rank":22,"score":150931.0322763631},{"content":"pub fn parse_stringlit(\n\n span: Span,\n\n mut segs: Vec<Sp<StrLitSegment>>,\n\n) -> Result<SimplExpr, lalrpop_util::ParseError<usize, Token, LexicalError>> {\n\n let file_id = span.2;\n\n let parser = crate::simplexpr_parser::ExprParser::new();\n\n\n\n if segs.len() == 1 {\n\n let (lo, seg, hi) = segs.remove(0);\n\n let span = Span(lo, hi, file_id);\n\n match seg {\n\n StrLitSegment::Literal(lit) => Ok(SimplExpr::Literal(DynVal(lit, span))),\n\n StrLitSegment::Interp(toks) => {\n\n let token_stream = toks.into_iter().map(Ok);\n\n parser.parse(file_id, token_stream)\n\n }\n\n }\n\n } else {\n\n let elems = segs\n\n .into_iter()\n","file_path":"crates/simplexpr/src/parser/lalrpop_helpers.rs","rank":23,"score":145366.28117537813},{"content":"pub fn validate_widget_definition(\n\n other_defs: &HashMap<String, WidgetDefinition>,\n\n globals: &HashSet<VarName>,\n\n def: &WidgetDefinition,\n\n) -> Result<(), ValidationError> {\n\n let mut variables_in_scope = globals.clone();\n\n for arg in def.expected_args.iter() {\n\n variables_in_scope.insert(VarName(arg.name.to_string()));\n\n }\n\n\n\n validate_variables_in_widget_use(other_defs, &variables_in_scope, &def.widget, true)\n\n}\n\n\n","file_path":"crates/yuck/src/config/validate.rs","rank":24,"score":145366.2811753781},{"content":"/// Parse consecutive `:keyword value` pairs from an expression iterator into an [Attributes].\n\nfn parse_key_values(iter: &mut AstIterator<impl Iterator<Item = Ast>>, fail_on_dangling_kw: bool) -> AstResult<Attributes> {\n\n let mut data = HashMap::new();\n\n let mut attrs_span = iter.remaining_span.point_span();\n\n loop {\n\n match iter.next() {\n\n Some(Ast::Keyword(key_span, kw)) => match iter.next() {\n\n Some(value) => {\n\n attrs_span.1 = iter.remaining_span.0;\n\n let attr_value = AttrEntry { key_span, value };\n\n data.insert(AttrName(kw), attr_value);\n\n }\n\n None => {\n\n if fail_on_dangling_kw {\n\n return Err(AstError::DanglingKeyword(key_span, kw));\n\n } else {\n\n iter.iter.put_back(Ast::Keyword(key_span, kw));\n\n attrs_span.1 = iter.remaining_span.0;\n\n return Ok(Attributes::new(attrs_span, data));\n\n }\n\n }\n","file_path":"crates/yuck/src/parser/ast_iterator.rs","rank":25,"score":145355.17971251253},{"content":"pub fn initialize_server(paths: EwwPaths, action: Option<DaemonCommand>) -> Result<ForkResult> {\n\n let (ui_send, mut ui_recv) = tokio::sync::mpsc::unbounded_channel();\n\n\n\n std::env::set_current_dir(&paths.get_config_dir())\n\n .with_context(|| format!(\"Failed to change working directory to {}\", paths.get_config_dir().display()))?;\n\n\n\n log::info!(\"Loading paths: {}\", &paths);\n\n\n\n let read_config = config::read_from_file(&paths.get_yuck_path());\n\n\n\n let eww_config = match read_config {\n\n Ok(config) => config,\n\n Err(err) => {\n\n error_handling_ctx::print_error(err);\n\n config::EwwConfig::default()\n\n }\n\n };\n\n\n\n let fork_result = do_detach(&paths.get_log_file())?;\n\n\n","file_path":"crates/eww/src/server.rs","rank":26,"score":142902.54115299674},{"content":"pub fn get_window_rectangle(geometry: WindowGeometry, screen_rect: gdk::Rectangle) -> gdk::Rectangle {\n\n let (offset_x, offset_y) = geometry.offset.relative_to(screen_rect.width, screen_rect.height);\n\n let (width, height) = geometry.size.relative_to(screen_rect.width, screen_rect.height);\n\n let x = screen_rect.x + offset_x + geometry.anchor_point.x.alignment_to_coordinate(width, screen_rect.width);\n\n let y = screen_rect.y + offset_y + geometry.anchor_point.y.alignment_to_coordinate(height, screen_rect.height);\n\n gdk::Rectangle { x, y, width, height }\n\n}\n","file_path":"crates/eww/src/app.rs","rank":27,"score":142682.54899618923},{"content":"pub fn validate(config: &Config, additional_globals: Vec<VarName>) -> Result<(), ValidationError> {\n\n let var_names = std::iter::empty()\n\n .chain(additional_globals.iter().cloned())\n\n .chain(config.script_vars.keys().cloned())\n\n .chain(config.var_definitions.keys().cloned())\n\n .collect();\n\n for window in config.window_definitions.values() {\n\n validate_variables_in_widget_use(&config.widget_definitions, &var_names, &window.widget, false)?;\n\n }\n\n for def in config.widget_definitions.values() {\n\n validate_widget_definition(&config.widget_definitions, &var_names, def)?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"crates/yuck/src/config/validate.rs","rank":28,"score":142585.56996029866},{"content":"/// Notify all listening tasks of the termination of the eww application process.\n\npub fn send_exit() -> Result<()> {\n\n (APPLICATION_EXIT_SENDER).send(()).context(\"Failed to send exit lifecycle event\")?;\n\n Ok(())\n\n}\n\n\n\n/// Yields Ok(()) on application termination. Await on this in all long-running tasks\n\n/// and perform any cleanup if necessary.\n\npub async fn recv_exit() -> Result<()> {\n\n (APPLICATION_EXIT_SENDER).subscribe().recv().await.context(\"Failed to receive lifecycle event\")\n\n}\n\n\n\n/// Select in a loop, breaking once a application termination event (see `crate::application_lifecycle`) is received.\n\n#[macro_export]\n\nmacro_rules! loop_select_exiting {\n\n ($($content:tt)*) => {\n\n loop {\n\n tokio::select! {\n\n Ok(()) = crate::application_lifecycle::recv_exit() => {\n\n break;\n\n }\n\n $($content)*\n\n }\n\n }\n\n };\n\n}\n","file_path":"crates/eww/src/application_lifecycle.rs","rank":29,"score":142038.6491454294},{"content":"pub fn net() -> String {\n\n let mut c = SYSTEM.lock().unwrap();\n\n c.refresh_networks_list();\n\n let interfaces = format!(\n\n \"{{ {} }}\",\n\n &c.get_networks()\n\n .iter()\n\n .map(|a| format!(r#\"\"{}\": {{ \"NET_UP\": {}, \"NET_DOWN\": {} }}\"#, a.0, a.1.get_transmitted(), a.1.get_received()))\n\n .join(\",\"),\n\n );\n\n interfaces\n\n}\n","file_path":"crates/eww/src/config/system_stats.rs","rank":30,"score":142038.6491454294},{"content":"pub fn generate_generic_widget_node(\n\n defs: &HashMap<String, WidgetDefinition>,\n\n local_env: &HashMap<VarName, SimplExpr>,\n\n w: WidgetUse,\n\n) -> AstResult<Box<dyn WidgetNode>> {\n\n if let Some(def) = defs.get(&w.name) {\n\n if !w.children.is_empty() {\n\n return Err(AstError::TooManyNodes(w.children_span(), 0).note(\"User-defined widgets cannot be given children.\"));\n\n }\n\n\n\n let mut new_local_env = w\n\n .attrs\n\n .attrs\n\n .into_iter()\n\n .map(|(name, value)| Ok((VarName(name.0), value.value.as_simplexpr()?.resolve_one_level(local_env))))\n\n .collect::<AstResult<HashMap<VarName, _>>>()?;\n\n\n\n // handle default value for optional arguments\n\n for expected in def.expected_args.iter().filter(|x| x.optional) {\n\n let var_name = VarName(expected.name.clone().0);\n","file_path":"crates/eww/src/widgets/widget_node.rs","rank":31,"score":141195.61597122886},{"content":"pub fn get_cpus() -> String {\n\n let mut c = SYSTEM.lock().unwrap();\n\n c.refresh_cpu();\n\n let processors = c.get_processors();\n\n format!(\n\n r#\"{{ \"cores\": [{}], \"avg\": {} }}\"#,\n\n processors\n\n .iter()\n\n .map(|a| format!(\n\n r#\"{{\"core\": \"{}\", \"freq\": {}, \"usage\": {:.0}}}\"#,\n\n a.get_name(),\n\n a.get_frequency(),\n\n a.get_cpu_usage()\n\n ))\n\n .join(\",\"),\n\n processors.iter().map(|a| a.get_cpu_usage()).avg()\n\n )\n\n}\n\n\n","file_path":"crates/eww/src/config/system_stats.rs","rank":32,"score":139904.53581962135},{"content":"pub fn get_temperatures() -> String {\n\n let mut c = SYSTEM.lock().unwrap();\n\n c.refresh_components_list();\n\n c.refresh_components();\n\n format!(\n\n \"{{ {} }}\",\n\n c.get_components()\n\n .iter()\n\n .map(|c| format!(r#\"\"{}\": {}\"#, c.get_label().to_uppercase().replace(\" \", \"_\"), c.get_temperature()))\n\n .join(\",\")\n\n )\n\n}\n\n\n","file_path":"crates/eww/src/config/system_stats.rs","rank":33,"score":139904.53581962135},{"content":"pub fn get_ram() -> String {\n\n let mut c = SYSTEM.lock().unwrap();\n\n c.refresh_memory();\n\n\n\n let total_memory = c.get_total_memory();\n\n let available_memory = c.get_available_memory();\n\n let used_memory = total_memory as f32 - available_memory as f32;\n\n format!(\n\n r#\"{{\"total_mem\": {}, \"free_mem\": {}, \"total_swap\": {}, \"free_swap\": {}, \"available_mem\": {}, \"used_mem\": {}, \"used_mem_perc\": {}}}\"#,\n\n total_memory,\n\n c.get_free_memory(),\n\n c.get_total_swap(),\n\n c.get_free_swap(),\n\n available_memory,\n\n used_memory,\n\n (used_memory / total_memory as f32) * 100f32,\n\n )\n\n}\n\n\n","file_path":"crates/eww/src/config/system_stats.rs","rank":34,"score":139904.53581962135},{"content":"pub fn get_disks() -> String {\n\n let mut c = SYSTEM.lock().unwrap();\n\n c.refresh_disks_list();\n\n\n\n format!(\n\n \"{{ {} }}\",\n\n c.get_disks()\n\n .iter()\n\n .map(|c| {\n\n let total_space = c.get_total_space();\n\n let available_space = c.get_available_space();\n\n let used_space = total_space - available_space;\n\n format!(\n\n r#\"\"{}\": {{\"name\": {:?}, \"total\": {}, \"free\": {}, \"used\": {}, \"used_perc\": {}}}\"#,\n\n c.get_mount_point().display(),\n\n c.get_name(),\n\n total_space,\n\n available_space,\n\n used_space,\n\n (used_space as f32 / total_space as f32) * 100f32,\n\n )\n\n })\n\n .join(\",\")\n\n )\n\n}\n\n\n","file_path":"crates/eww/src/config/system_stats.rs","rank":35,"score":139904.53581962135},{"content":"fn listen_for_daemon_response(mut recv: DaemonResponseReceiver) {\n\n let rt = tokio::runtime::Builder::new_current_thread().enable_time().build().expect(\"Failed to initialize tokio runtime\");\n\n rt.block_on(async {\n\n if let Ok(Some(response)) = tokio::time::timeout(Duration::from_millis(100), recv.recv()).await {\n\n println!(\"{}\", response);\n\n }\n\n })\n\n}\n\n\n","file_path":"crates/eww/src/main.rs","rank":44,"score":134768.46487807002},{"content":"#[cfg(not(target_os = \"macos\"))]\n\n#[cfg(not(target_os = \"linux\"))]\n\npub fn get_battery_capacity() -> Result<u8> {\n\n anyhow!(\"Eww doesn't support your OS for getting the battery capacity\")\n\n}\n\n\n","file_path":"crates/eww/src/config/system_stats.rs","rank":45,"score":132980.22502598038},{"content":"#[cfg(target_os = \"linux\")]\n\npub fn get_battery_capacity() -> Result<String> {\n\n let mut current = 0_f64;\n\n let mut total = 0_f64;\n\n let mut json = String::from('{');\n\n for i in\n\n std::path::Path::new(\"/sys/class/power_supply\").read_dir().context(\"Couldn't read /sys/class/power_supply directory\")?\n\n {\n\n let i = i?.path();\n\n if i.is_dir() {\n\n // some ugly hack because if let Some(a) = a && Some(b) = b doesn't work yet\n\n if let (Ok(o), Ok(s)) = (read_to_string(i.join(\"capacity\")), read_to_string(i.join(\"status\"))) {\n\n json.push_str(&format!(\n\n r#\"{:?}: {{ \"status\": \"{}\", \"capacity\": {} }},\"#,\n\n i.file_name().context(\"couldn't convert file name to rust string\")?,\n\n s.replace(\"\\n\", \"\"),\n\n o.replace(\"\\n\", \"\")\n\n ));\n\n if let (Ok(t), Ok(c), Ok(v)) = (\n\n read_to_string(i.join(\"charge_full\")),\n\n read_to_string(i.join(\"charge_now\")),\n","file_path":"crates/eww/src/config/system_stats.rs","rank":46,"score":132980.22502598038},{"content":"/// Check if a eww server is currently running by trying to send a ping message to it.\n\nfn check_server_running(socket_path: impl AsRef<Path>) -> bool {\n\n let response = net::UnixStream::connect(socket_path)\n\n .ok()\n\n .and_then(|mut stream| client::do_server_call(&mut stream, &opts::ActionWithServer::Ping).ok());\n\n response.is_some()\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct EwwPaths {\n\n log_file: PathBuf,\n\n ipc_socket_file: PathBuf,\n\n config_dir: PathBuf,\n\n}\n\n\n\nimpl EwwPaths {\n\n pub fn from_config_dir<P: AsRef<Path>>(config_dir: P) -> Result<Self> {\n\n let config_dir = config_dir.as_ref();\n\n if config_dir.is_file() {\n\n bail!(\"Please provide the path to the config directory, not a file within it\")\n\n }\n","file_path":"crates/eww/src/main.rs","rank":47,"score":128581.34822669487},{"content":"/// read an scss file, replace all environment variable references within it and\n\n/// then parse it into css.\n\npub fn parse_scss_from_file(path: &Path) -> Result<String> {\n\n let config_dir = path.parent().context(\"Given SCSS file has no parent directory?!\")?;\n\n let scss_file_content =\n\n std::fs::read_to_string(path).with_context(|| format!(\"Given SCSS File Doesnt Exist! {}\", path.display()))?;\n\n let file_content = replace_env_var_references(scss_file_content);\n\n let grass_config = grass::Options::default().load_path(config_dir);\n\n grass::from_string(file_content, &grass_config).map_err(|err| anyhow!(\"Encountered SCSS parsing error: {:?}\", err))\n\n}\n\n\n\n#[ext(pub, name = StringExt)]\n\nimpl<T: AsRef<str>> T {\n\n /// check if the string is empty after removing all linebreaks and trimming\n\n /// whitespace\n\n fn is_blank(self) -> bool {\n\n self.as_ref().replace('\\n', \"\").trim().is_empty()\n\n }\n\n\n\n /// trim all lines in a string\n\n fn trim_lines(self) -> String {\n\n self.as_ref().lines().map(|line| line.trim()).join(\"\\n\")\n\n }\n\n}\n\n\n","file_path":"crates/eww/src/util.rs","rank":48,"score":128011.9574580323},{"content":"pub fn b<T>(x: T) -> Box<T> {\n\n Box::new(x)\n\n}\n\n\n","file_path":"crates/simplexpr/src/parser/lalrpop_helpers.rs","rank":49,"score":127841.04266244889},{"content":"/// detach the process from the terminal, also redirecting stdout and stderr to LOG_FILE\n\nfn do_detach(log_file_path: impl AsRef<Path>) -> Result<ForkResult> {\n\n // detach from terminal\n\n match unsafe { nix::unistd::fork()? } {\n\n nix::unistd::ForkResult::Child => {\n\n nix::unistd::setsid()?;\n\n match unsafe { nix::unistd::fork()? } {\n\n nix::unistd::ForkResult::Parent { .. } => std::process::exit(0),\n\n nix::unistd::ForkResult::Child => {}\n\n }\n\n }\n\n nix::unistd::ForkResult::Parent { .. } => {\n\n return Ok(ForkResult::Parent);\n\n }\n\n }\n\n\n\n let file = std::fs::OpenOptions::new()\n\n .create(true)\n\n .append(true)\n\n .open(&log_file_path)\n\n .unwrap_or_else(|_| panic!(\"Error opening log file ({}), for writing\", log_file_path.as_ref().to_string_lossy()));\n","file_path":"crates/eww/src/server.rs","rank":50,"score":124575.63412460637},{"content":"#[cfg(feature = \"x11\")]\n\nfn apply_window_position(\n\n mut window_geometry: WindowGeometry,\n\n monitor_geometry: gdk::Rectangle,\n\n window: >k::Window\n\n) -> Result<()> {\n\n\n\n let gdk_window = window.window().context(\"Failed to get gdk window from gtk window\")?;\n\n window_geometry.size = Coords::from_pixels(window.size());\n\n let actual_window_rect = get_window_rectangle(window_geometry, monitor_geometry);\n\n\n\n let gdk_origin = gdk_window.origin();\n\n\n\n if actual_window_rect.x != gdk_origin.1 || actual_window_rect.y != gdk_origin.2 {\n\n gdk_window.move_(actual_window_rect.x, actual_window_rect.y);\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"crates/eww/src/app.rs","rank":51,"score":123611.32887371731},{"content":"fn build_if_else(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\n\n if bargs.widget.children.len() != 2 {\n\n bail!(\"if-widget needs to have exactly two children, but had {}\", bargs.widget.children.len());\n\n }\n\n let gtk_widget = gtk::Box::new(gtk::Orientation::Vertical, 0);\n\n let (yes_widget, no_widget) = (bargs.widget.children[0].clone(), bargs.widget.children[1].clone());\n\n\n\n let yes_widget = yes_widget.render(bargs.eww_state, bargs.window_name, bargs.widget_definitions)?;\n\n let no_widget = no_widget.render(bargs.eww_state, bargs.window_name, bargs.widget_definitions)?;\n\n\n\n resolve_block!(bargs, gtk_widget, {\n\n prop(cond: as_bool) {\n\n gtk_widget.children().iter().for_each(|w| gtk_widget.remove(w));\n\n if cond {\n\n gtk_widget.add(&yes_widget)\n\n } else {\n\n gtk_widget.add(&no_widget)\n\n }\n\n }\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":52,"score":122102.63250589554},{"content":"/// @widget input\n\n/// @desc An input field. For this to be useful, set `focusable=\"true\"` on the window.\n\nfn build_gtk_input(bargs: &mut BuilderArgs) -> Result<gtk::Entry> {\n\n let gtk_widget = gtk::Entry::new();\n\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop value - the content of the text field\n\n prop(value: as_string) {\n\n gtk_widget.set_text(&value);\n\n },\n\n\n\n // @prop onchange - Command to run when the text changes. The placeholder `{}` will be replaced by the value\n\n // @prop timeout - timeout of the command\n\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\n\n let old_id = on_change_handler_id.replace(Some(\n\n gtk_widget.connect_changed(move |gtk_widget| {\n\n run_command(timeout, &onchange, gtk_widget.text().to_string());\n\n })\n\n ));\n\n old_id.map(|id| gtk_widget.disconnect(id));\n\n }\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":53,"score":120463.10477146071},{"content":"/// @widget button extends container\n\n/// @desc A button\n\nfn build_gtk_button(bargs: &mut BuilderArgs) -> Result<gtk::Button> {\n\n let gtk_widget = gtk::Button::new();\n\n let on_click_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop onclick - a command that get's run when the button is clicked\n\n // @prop onmiddleclick - a command that get's run when the button is middleclicked\n\n // @prop onrightclick - a command that get's run when the button is rightclicked\n\n // @prop timeout - timeout of the command\n\n prop(\n\n timeout: as_duration = Duration::from_millis(200),\n\n onclick: as_string = \"\",\n\n onmiddleclick: as_string = \"\",\n\n onrightclick: as_string = \"\"\n\n ) {\n\n gtk_widget.add_events(gdk::EventMask::ENTER_NOTIFY_MASK);\n\n let old_id = on_click_handler_id.replace(Some(\n\n gtk_widget.connect_button_press_event(move |_, evt| {\n\n match evt.button() {\n\n 1 => run_command(timeout, &onclick, \"\"),\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":54,"score":120459.29843450004},{"content":"/// @widget literal\n\n/// @desc A widget that allows you to render arbitrary yuck.\n\nfn build_gtk_literal(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\n\n let gtk_widget = gtk::Box::new(gtk::Orientation::Vertical, 0);\n\n gtk_widget.set_widget_name(\"literal\");\n\n\n\n // TODO these clones here are dumdum\n\n let window_name = bargs.window_name.to_string();\n\n let widget_definitions = bargs.widget_definitions.clone();\n\n let literal_use_span = bargs.widget.span;\n\n\n\n // the file id the literal-content has been stored under, for error reporting.\n\n let literal_file_id: Rc<RefCell<Option<usize>>> = Rc::new(RefCell::new(None));\n\n\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop content - inline yuck that will be rendered as a widget.\n\n prop(content: as_string) {\n\n gtk_widget.children().iter().for_each(|w| gtk_widget.remove(w));\n\n if !content.is_empty() {\n\n let widget_node_result: AstResult<_> = try {\n\n let ast = {\n\n let mut yuck_files = error_handling_ctx::YUCK_FILES.write().unwrap();\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":55,"score":120459.29843450004},{"content":"/// @widget calendar\n\n/// @desc A widget that displays a calendar\n\nfn build_gtk_calendar(bargs: &mut BuilderArgs) -> Result<gtk::Calendar> {\n\n let gtk_widget = gtk::Calendar::new();\n\n let on_click_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop day - the selected day\n\n prop(day: as_f64) { gtk_widget.set_day(day as i32) },\n\n // @prop month - the selected month\n\n prop(month: as_f64) { gtk_widget.set_month(month as i32) },\n\n // @prop year - the selected year\n\n prop(year: as_f64) { gtk_widget.set_year(year as i32) },\n\n // @prop show-details - show details\n\n prop(show_details: as_bool) { gtk_widget.set_show_details(show_details) },\n\n // @prop show-heading - show heading line\n\n prop(show_heading: as_bool) { gtk_widget.set_show_heading(show_heading) },\n\n // @prop show-day-names - show names of days\n\n prop(show_day_names: as_bool) { gtk_widget.set_show_day_names(show_day_names) },\n\n // @prop show-week-numbers - show week numbers\n\n prop(show_week_numbers: as_bool) { gtk_widget.set_show_week_numbers(show_week_numbers) },\n\n // @prop onclick - command to run when the user selects a date. The `{}` placeholder will be replaced by the selected date.\n\n // @prop timeout - timeout of the command\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":56,"score":120459.29843450004},{"content":"/// @widget image\n\n/// @desc A widget displaying an image\n\nfn build_gtk_image(bargs: &mut BuilderArgs) -> Result<gtk::Image> {\n\n let gtk_widget = gtk::Image::new();\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop path - path to the image file\n\n // @prop width - width of the image\n\n // @prop height - height of the image\n\n prop(path: as_string, width: as_i32 = 10000, height: as_i32 = 10000) {\n\n if path.ends_with(\".gif\") {\n\n let pixbuf_animation = gtk::gdk_pixbuf::PixbufAnimation::from_file(std::path::PathBuf::from(path))?;\n\n gtk_widget.set_from_animation(&pixbuf_animation);\n\n } else {\n\n let pixbuf = gtk::gdk_pixbuf::Pixbuf::from_file_at_size(std::path::PathBuf::from(path), width, height)?;\n\n gtk_widget.set_from_pixbuf(Some(&pixbuf));\n\n }\n\n }\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":57,"score":120459.29843450004},{"content":"/// @widget box extends container\n\n/// @desc the main layout container\n\nfn build_gtk_box(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\n\n let gtk_widget = gtk::Box::new(gtk::Orientation::Horizontal, 0);\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop spacing - spacing between elements\n\n prop(spacing: as_i32 = 0) { gtk_widget.set_spacing(spacing) },\n\n // @prop orientation - orientation of the box. possible values: $orientation\n\n prop(orientation: as_string) { gtk_widget.set_orientation(parse_orientation(&orientation)?) },\n\n // @prop space-evenly - space the widgets evenly.\n\n prop(space_evenly: as_bool = true) { gtk_widget.set_homogeneous(space_evenly) },\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":58,"score":120459.29843450004},{"content":"/// @widget expander extends container\n\n/// @desc A widget that can expand and collapse, showing/hiding it's children.\n\nfn build_gtk_expander(bargs: &mut BuilderArgs) -> Result<gtk::Expander> {\n\n let gtk_widget = gtk::Expander::new(None);\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop name - name of the expander\n\n prop(name: as_string) {gtk_widget.set_label(Some(&name));},\n\n // @prop expanded - sets if the tree is expanded\n\n prop(expanded: as_bool) { gtk_widget.set_expanded(expanded); }\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":59,"score":120459.29843450004},{"content":"/// @widget revealer extends container\n\n/// @desc A widget that can reveal a child with an animation.\n\nfn build_gtk_revealer(bargs: &mut BuilderArgs) -> Result<gtk::Revealer> {\n\n let gtk_widget = gtk::Revealer::new();\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop transition - the name of the transition. Possible values: $transition\n\n prop(transition: as_string = \"crossfade\") { gtk_widget.set_transition_type(parse_transition(&transition)?); },\n\n // @prop reveal - sets if the child is revealed or not\n\n prop(reveal: as_bool) { gtk_widget.set_reveal_child(reveal); },\n\n // @prop duration - the duration of the reveal transition\n\n prop(duration: as_duration = Duration::from_millis(500)) { gtk_widget.set_transition_duration(duration.as_millis() as u32); },\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":60,"score":120459.29843450004},{"content":"/// @widget scale extends range\n\n/// @desc A slider.\n\nfn build_gtk_scale(bargs: &mut BuilderArgs) -> Result<gtk::Scale> {\n\n let gtk_widget = gtk::Scale::new(gtk::Orientation::Horizontal, Some(>k::Adjustment::new(0.0, 0.0, 100.0, 1.0, 1.0, 1.0)));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop flipped - flip the direction\n\n prop(flipped: as_bool) { gtk_widget.set_inverted(flipped) },\n\n\n\n // @prop draw-value - draw the value of the property\n\n prop(draw_value: as_bool = false) { gtk_widget.set_draw_value(draw_value) },\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":61,"score":120459.29843450004},{"content":"/// @widget label\n\n/// @desc A text widget giving you more control over how the text is displayed\n\nfn build_gtk_label(bargs: &mut BuilderArgs) -> Result<gtk::Label> {\n\n let gtk_widget = gtk::Label::new(None);\n\n\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop text - the text to display\n\n // @prop limit-width - maximum count of characters to display\n\n // @prop show_truncated - show whether the text was truncated\n\n prop(text: as_string, limit_width: as_i32 = i32::MAX, show_truncated: as_bool = true) {\n\n let truncated = text.chars().count() > limit_width as usize;\n\n let mut text = text.chars().take(limit_width as usize).collect::<String>();\n\n\n\n if show_truncated && truncated {\n\n text.push_str(\"...\");\n\n }\n\n\n\n let text = unescape::unescape(&text).context(format!(\"Failed to unescape label text {}\", &text))?;\n\n let text = unindent::unindent(&text);\n\n gtk_widget.set_text(&text);\n\n },\n\n // @prop markup - Pango markup to display\n\n prop(markup: as_string) { gtk_widget.set_markup(&markup); },\n\n // @prop wrap - Wrap the text. This mainly makes sense if you set the width of this widget.\n\n prop(wrap: as_bool) { gtk_widget.set_line_wrap(wrap) },\n\n // @prop angle - the angle of rotation for the label (between 0 - 360)\n\n prop(angle: as_f64 = 0) { gtk_widget.set_angle(angle) }\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":62,"score":120459.29843450004},{"content":"/// @widget centerbox extends container\n\n/// @desc a box that must contain exactly three children, which will be layed out at the start, center and end of the container.\n\nfn build_center_box(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\n\n let gtk_widget = gtk::Box::new(gtk::Orientation::Horizontal, 0);\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop orientation - orientation of the centerbox. possible values: $orientation\n\n prop(orientation: as_string) { gtk_widget.set_orientation(parse_orientation(&orientation)?) },\n\n });\n\n\n\n match bargs.widget.children.len().cmp(&3) {\n\n Ordering::Less => {\n\n Err(DiagError::new(gen_diagnostic!(\"centerbox must contain exactly 3 elements\", bargs.widget.span)).into())\n\n }\n\n Ordering::Greater => {\n\n let (_, additional_children) = bargs.widget.children.split_at(3);\n\n // we know that there is more than three children, so unwrapping on first and left here is fine.\n\n let first_span = additional_children.first().unwrap().span();\n\n let last_span = additional_children.last().unwrap().span();\n\n Err(DiagError::new(gen_diagnostic!(\n\n \"centerbox must contain exactly 3 elements, but got more\",\n\n first_span.to(last_span)\n\n ))\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":63,"score":120459.29843450004},{"content":"fn init_async_part(paths: EwwPaths, ui_send: UnboundedSender<app::DaemonCommand>) {\n\n std::thread::spawn(move || {\n\n let rt = tokio::runtime::Builder::new_multi_thread().enable_all().build().expect(\"Failed to initialize tokio runtime\");\n\n rt.block_on(async {\n\n let filewatch_join_handle = {\n\n let ui_send = ui_send.clone();\n\n let paths = paths.clone();\n\n tokio::spawn(async move { run_filewatch(paths.config_dir, ui_send).await })\n\n };\n\n\n\n let ipc_server_join_handle = {\n\n let ui_send = ui_send.clone();\n\n tokio::spawn(async move { ipc_server::run_server(ui_send, paths.get_ipc_socket_file()).await })\n\n };\n\n\n\n let forward_exit_to_app_handle = {\n\n let ui_send = ui_send.clone();\n\n tokio::spawn(async move {\n\n // Wait for application exit event\n\n let _ = crate::application_lifecycle::recv_exit().await;\n","file_path":"crates/eww/src/server.rs","rank":64,"score":119562.43336951268},{"content":"/// @widget progress\n\n/// @desc A progress bar\n\nfn build_gtk_progress(bargs: &mut BuilderArgs) -> Result<gtk::ProgressBar> {\n\n let gtk_widget = gtk::ProgressBar::new();\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop flipped - flip the direction\n\n prop(flipped: as_bool) { gtk_widget.set_inverted(flipped) },\n\n\n\n // @prop value - value of the progress bar (between 0-100)\n\n prop(value: as_f64) { gtk_widget.set_fraction(value / 100f64) },\n\n\n\n // @prop orientation - orientation of the progress bar. possible values: $orientation\n\n prop(orientation: as_string) { gtk_widget.set_orientation(parse_orientation(&orientation)?) },\n\n });\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":65,"score":118882.02922412581},{"content":"/// @widget a checkbox\n\n/// @desc A checkbox that can trigger events on checked / unchecked.\n\nfn build_gtk_checkbox(bargs: &mut BuilderArgs) -> Result<gtk::CheckButton> {\n\n let gtk_widget = gtk::CheckButton::new();\n\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop timeout - timeout of the command\n\n // @prop onchecked - action (command) to be executed when checked by the user\n\n // @prop onunchecked - similar to onchecked but when the widget is unchecked\n\n prop(timeout: as_duration = Duration::from_millis(200), onchecked: as_string = \"\", onunchecked: as_string = \"\") {\n\n let old_id = on_change_handler_id.replace(Some(\n\n gtk_widget.connect_toggled(move |gtk_widget| {\n\n run_command(timeout, if gtk_widget.is_active() { &onchecked } else { &onunchecked }, \"\");\n\n })\n\n ));\n\n old_id.map(|id| gtk_widget.disconnect(id));\n\n }\n\n });\n\n\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":66,"score":118882.02922412581},{"content":"pub fn parse_string(file_id: usize, s: &str) -> AstResult<Ast> {\n\n let lexer = lexer::Lexer::new(file_id, s.to_string());\n\n let parser = parser::AstParser::new();\n\n parser.parse(file_id, lexer).map_err(|e| AstError::from_parse_error(file_id, e))\n\n}\n\n\n","file_path":"crates/yuck/src/parser/mod.rs","rank":67,"score":118630.43499252842},{"content":"/// @widget color-button\n\n/// @desc A button opening a color chooser window\n\nfn build_gtk_color_button(bargs: &mut BuilderArgs) -> Result<gtk::ColorButton> {\n\n let gtk_widget = gtk::ColorButtonBuilder::new().build();\n\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop use-alpha - bool to whether or not use alpha\n\n prop(use_alpha: as_bool) {gtk_widget.set_use_alpha(use_alpha);},\n\n\n\n // @prop onchange - runs the code when the color was selected\n\n // @prop timeout - timeout of the command\n\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\n\n let old_id = on_change_handler_id.replace(Some(\n\n gtk_widget.connect_color_set(move |gtk_widget| {\n\n run_command(timeout, &onchange, gtk_widget.rgba());\n\n })\n\n ));\n\n old_id.map(|id| gtk_widget.disconnect(id));\n\n }\n\n });\n\n\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":68,"score":117366.91949442484},{"content":"/// @widget color-chooser\n\n/// @desc A color chooser widget\n\nfn build_gtk_color_chooser(bargs: &mut BuilderArgs) -> Result<gtk::ColorChooserWidget> {\n\n let gtk_widget = gtk::ColorChooserWidget::new();\n\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop use-alpha - bool to wether or not use alpha\n\n prop(use_alpha: as_bool) {gtk_widget.set_use_alpha(use_alpha);},\n\n\n\n // @prop onchange - runs the code when the color was selected\n\n // @prop timeout - timeout of the command\n\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\n\n let old_id = on_change_handler_id.replace(Some(\n\n gtk_widget.connect_color_activated(move |_a, color| {\n\n run_command(timeout, &onchange, *color);\n\n })\n\n ));\n\n old_id.map(|id| gtk_widget.disconnect(id));\n\n }\n\n });\n\n\n\n Ok(gtk_widget)\n\n}\n\n\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":69,"score":115910.36573537912},{"content":"/// @widget combo-box-text\n\n/// @desc A combo box allowing the user to choose between several items.\n\nfn build_gtk_combo_box_text(bargs: &mut BuilderArgs) -> Result<gtk::ComboBoxText> {\n\n let gtk_widget = gtk::ComboBoxText::new();\n\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\n\n resolve_block!(bargs, gtk_widget, {\n\n // @prop items - Items that should be displayed in the combo box\n\n prop(items: as_vec) {\n\n gtk_widget.remove_all();\n\n for i in items {\n\n gtk_widget.append_text(&i);\n\n }\n\n },\n\n // @prop timeout - timeout of the command\n\n // @prop onchange - runs the code when a item was selected, replacing {} with the item as a string\n\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\n\n let old_id = on_change_handler_id.replace(Some(\n\n gtk_widget.connect_changed(move |gtk_widget| {\n\n run_command(timeout, &onchange, gtk_widget.active_text().unwrap_or_else(|| \"\".into()));\n\n })\n\n ));\n\n old_id.map(|id| gtk_widget.disconnect(id));\n\n },\n\n });\n\n Ok(gtk_widget)\n\n}\n","file_path":"crates/eww/src/widgets/widget_definitions.rs","rank":70,"score":114509.0376935173},{"content":"fn attempt_connect(socket_path: impl AsRef<Path>, attempts: usize) -> Option<net::UnixStream> {\n\n for _ in 0..attempts {\n\n if let Ok(mut con) = net::UnixStream::connect(&socket_path) {\n\n if client::do_server_call(&mut con, &opts::ActionWithServer::Ping).is_ok() {\n\n return net::UnixStream::connect(&socket_path).ok();\n\n }\n\n }\n\n std::thread::sleep(Duration::from_millis(200));\n\n }\n\n None\n\n}\n\n\n","file_path":"crates/eww/src/main.rs","rank":71,"score":114142.46013823857},{"content":"/// Parse multiple toplevel nodes into a list of [Ast]\n\npub fn parse_toplevel(file_id: usize, s: String) -> AstResult<(Span, Vec<Ast>)> {\n\n let lexer = lexer::Lexer::new(file_id, s);\n\n let parser = parser::ToplevelParser::new();\n\n parser.parse(file_id, lexer).map_err(|e| AstError::from_parse_error(file_id, e))\n\n}\n\n\n","file_path":"crates/yuck/src/parser/mod.rs","rank":72,"score":112083.22598821358},{"content":"fn parse_var_update_arg(s: &str) -> Result<(VarName, DynVal)> {\n\n let (name, value) = s\n\n .split_once('=')\n\n .with_context(|| format!(\"arguments must be in the shape `variable_name=\\\"new_value\\\"`, but got: {}\", s))?;\n\n Ok((name.into(), DynVal::from_string(value.to_owned())))\n\n}\n\n\n\nimpl ActionWithServer {\n\n pub fn can_start_daemon(&self) -> bool {\n\n matches!(self, ActionWithServer::OpenWindow { .. } | ActionWithServer::OpenMany { .. })\n\n }\n\n\n\n pub fn into_daemon_command(self) -> (app::DaemonCommand, Option<daemon_response::DaemonResponseReceiver>) {\n\n let command = match self {\n\n ActionWithServer::Update { mappings } => app::DaemonCommand::UpdateVars(mappings),\n\n\n\n ActionWithServer::KillServer => app::DaemonCommand::KillServer,\n\n ActionWithServer::CloseAll => app::DaemonCommand::CloseAll,\n\n ActionWithServer::Ping => {\n\n let (send, recv) = tokio::sync::mpsc::unbounded_channel();\n","file_path":"crates/eww/src/opts.rs","rank":73,"score":112083.09881764624},{"content":"fn label_from_simplexpr(value: SimplExpr, span: Span) -> WidgetUse {\n\n WidgetUse {\n\n name: \"label\".to_string(),\n\n name_span: span.point_span(),\n\n attrs: Attributes::new(\n\n span,\n\n maplit::hashmap! {\n\n AttrName(\"text\".to_string()) => AttrEntry::new(\n\n span,\n\n Ast::SimplExpr(span, value)\n\n )\n\n },\n\n ),\n\n children: Vec::new(),\n\n span,\n\n }\n\n}\n","file_path":"crates/yuck/src/config/widget_use.rs","rank":74,"score":110871.22326642784},{"content":"pub fn parse_string(byte_offset: usize, file_id: usize, s: &str) -> Result<SimplExpr> {\n\n let lexer = lexer::Lexer::new(file_id, byte_offset, s);\n\n let parser = crate::simplexpr_parser::ExprParser::new();\n\n parser.parse(file_id, lexer).map_err(|e| Error::from_parse_error(file_id, e))\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n macro_rules! test_parser {\n\n ($($text:literal),* $(,)?) => {{\n\n let p = crate::simplexpr_parser::ExprParser::new();\n\n use crate::parser::lexer::Lexer;\n\n ::insta::with_settings!({sort_maps => true}, {\n\n $(\n\n ::insta::assert_debug_snapshot!(p.parse(0, Lexer::new(0, 0, $text)));\n\n )*\n\n });\n\n }}\n\n }\n\n\n","file_path":"crates/simplexpr/src/parser/mod.rs","rank":75,"score":110574.61232748312},{"content":"fn with_response_channel<O, F>(f: F) -> (O, Option<tokio::sync::mpsc::UnboundedReceiver<DaemonResponse>>)\n\nwhere\n\n F: FnOnce(DaemonResponseSender) -> O,\n\n{\n\n let (sender, recv) = daemon_response::create_pair();\n\n (f(sender), Some(recv))\n\n}\n","file_path":"crates/eww/src/opts.rs","rank":76,"score":109798.05096724555},{"content":"fn variable_deprecation_note(var_name: String) -> Option<String> {\n\n (var_name == \"EWW_CPU_USAGE\")\n\n .then(|| \"Note: EWW_CPU_USAGE has recently been removed, and has now been renamed to EWW_CPU\".to_string())\n\n}\n\n\n","file_path":"crates/yuck/src/format_diagnostic.rs","rank":77,"score":104887.96232616673},{"content":"/// Get the monitor geometry of a given monitor number, or the default if none is given\n\nfn get_monitor_geometry(n: Option<i32>) -> Result<gdk::Rectangle> {\n\n #[allow(deprecated)]\n\n let display = gdk::Display::default().expect(\"could not get default display\");\n\n let monitor = match n {\n\n Some(n) => display.monitor(n).with_context(|| format!(\"Failed to get monitor with index {}\", n))?,\n\n None => display.primary_monitor().context(\"Failed to get primary monitor from GTK\")?,\n\n };\n\n Ok(monitor.geometry())\n\n}\n\n\n","file_path":"crates/eww/src/app.rs","rank":78,"score":104749.39243755973},{"content":"/// Compute the difference of two lists, returning a tuple of\n\n/// (\n\n/// elements that where in a but not in b,\n\n/// elements that where in b but not in a\n\n/// ).\n\npub fn list_difference<'a, 'b, T: PartialEq>(a: &'a [T], b: &'b [T]) -> (Vec<&'a T>, Vec<&'b T>) {\n\n let mut missing = Vec::new();\n\n for elem in a {\n\n if !b.contains(elem) {\n\n missing.push(elem);\n\n }\n\n }\n\n\n\n let mut new = Vec::new();\n\n for elem in b {\n\n if !a.contains(elem) {\n\n new.push(elem);\n\n }\n\n }\n\n (missing, new)\n\n}\n\n\n","file_path":"crates/eww/src/util.rs","rank":79,"score":104565.3072048305},{"content":"fn on_screen_changed(window: >k::Window, _old_screen: Option<&gdk::Screen>) {\n\n let visual = window\n\n .screen()\n\n .and_then(|screen| screen.rgba_visual().filter(|_| screen.is_composited()).or_else(|| screen.system_visual()));\n\n window.set_visual(visual.as_ref());\n\n}\n\n\n","file_path":"crates/eww/src/app.rs","rank":80,"score":100186.31593582404},{"content":"use std::process::Command;\n\n\n\nuse anyhow::*;\n\nuse codespan_reporting::diagnostic::Severity;\n\nuse eww_shared_util::{Span, VarName};\n\nuse simplexpr::dynval::DynVal;\n\nuse yuck::{\n\n config::script_var_definition::{ScriptVarDefinition, VarSource},\n\n gen_diagnostic,\n\n};\n\n\n\nuse crate::error::DiagError;\n\n\n","file_path":"crates/eww/src/config/script_var.rs","rank":81,"score":99549.78423091338},{"content":"/// extends a hashmap, returning a list of keys that already where present in the hashmap.\n\npub fn extend_safe<K: std::cmp::Eq + std::hash::Hash + Clone, V, T: IntoIterator<Item = (K, V)>>(\n\n a: &mut std::collections::HashMap<K, V>,\n\n b: T,\n\n) -> Vec<K> {\n\n b.into_iter().filter_map(|(k, v)| a.insert(k.clone(), v).map(|_| k.clone())).collect()\n\n}\n\n\n","file_path":"crates/eww/src/util.rs","rank":82,"score":99103.48253597961},{"content":"pub fn get_parse_error_span<T, E: Spanned>(file_id: usize, err: &lalrpop_util::ParseError<usize, T, E>) -> Span {\n\n use lalrpop_util::ParseError::*;\n\n match err {\n\n InvalidToken { location } => Span(*location, *location, file_id),\n\n UnrecognizedEOF { location, expected } => Span(*location, *location, file_id),\n\n UnrecognizedToken { token, expected } => Span(token.0, token.2, file_id),\n\n ExtraToken { token } => Span(token.0, token.2, file_id),\n\n User { error } => error.span(),\n\n }\n\n}\n\n\n","file_path":"crates/yuck/src/error.rs","rank":83,"score":97428.64880600736},{"content":"impl ScriptVarDefinition {\n\n pub fn name_span(&self) -> Span {\n\n match self {\n\n ScriptVarDefinition::Poll(x) => x.name_span,\n\n ScriptVarDefinition::Listen(x) => x.name_span,\n\n }\n\n }\n\n\n\n pub fn name(&self) -> &VarName {\n\n match self {\n\n ScriptVarDefinition::Poll(x) => &x.name,\n\n ScriptVarDefinition::Listen(x) => &x.name,\n\n }\n\n }\n\n\n\n pub fn command_span(&self) -> Option<Span> {\n\n match self {\n\n ScriptVarDefinition::Poll(x) => match x.command {\n\n VarSource::Shell(span, ..) => Some(span),\n\n VarSource::Function(_) => None,\n","file_path":"crates/yuck/src/config/script_var_definition.rs","rank":84,"score":97047.08580768581},{"content":" pub command_span: Span,\n\n pub name_span: Span,\n\n}\n\nimpl FromAstElementContent for ListenScriptVar {\n\n const ELEMENT_NAME: &'static str = \"deflisten\";\n\n\n\n fn from_tail<I: Iterator<Item = Ast>>(span: Span, mut iter: AstIterator<I>) -> AstResult<Self> {\n\n let result: AstResult<_> = try {\n\n let (name_span, name) = iter.expect_symbol()?;\n\n let mut attrs = iter.expect_key_values()?;\n\n let initial_value = attrs.primitive_optional(\"initial\")?.unwrap_or_else(|| DynVal::from_string(String::new()));\n\n let (command_span, script) = iter.expect_literal()?;\n\n iter.expect_done()?;\n\n Self { name_span, name: VarName(name), command: script.to_string(), initial_value, command_span }\n\n };\n\n result.note(r#\"Expected format: `(deflisten name :initial \"0\" \"tail -f /tmp/example\")`\"#)\n\n }\n\n}\n","file_path":"crates/yuck/src/config/script_var_definition.rs","rank":85,"score":97045.3551343154},{"content":" pub initial_value: Option<DynVal>,\n\n pub interval: std::time::Duration,\n\n pub name_span: Span,\n\n}\n\n\n\nimpl FromAstElementContent for PollScriptVar {\n\n const ELEMENT_NAME: &'static str = \"defpoll\";\n\n\n\n fn from_tail<I: Iterator<Item = Ast>>(span: Span, mut iter: AstIterator<I>) -> AstResult<Self> {\n\n let result: AstResult<_> = try {\n\n let (name_span, name) = iter.expect_symbol()?;\n\n let mut attrs = iter.expect_key_values()?;\n\n let initial_value = Some(attrs.primitive_optional(\"initial\")?.unwrap_or_else(|| DynVal::from_string(String::new())));\n\n let interval = attrs.primitive_required::<DynVal, _>(\"interval\")?.as_duration()?;\n\n let (script_span, script) = iter.expect_literal()?;\n\n\n\n let run_while_expr =\n\n attrs.ast_optional::<SimplExpr>(\"run-while\")?.unwrap_or_else(|| SimplExpr::Literal(DynVal::from(true)));\n\n let run_while_var_refs = run_while_expr.collect_var_refs();\n\n\n","file_path":"crates/yuck/src/config/script_var_definition.rs","rank":86,"score":97045.2687508134},{"content":"use std::collections::HashMap;\n\n\n\nuse simplexpr::{dynval::DynVal, SimplExpr};\n\n\n\nuse crate::{\n\n error::{AstError, AstResult, AstResultExt},\n\n parser::{\n\n ast::Ast,\n\n ast_iterator::AstIterator,\n\n from_ast::{FromAst, FromAstElementContent},\n\n },\n\n};\n\nuse eww_shared_util::{AttrName, Span, Spanned, VarName};\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\n\npub enum ScriptVarDefinition {\n\n Poll(PollScriptVar),\n\n Listen(ListenScriptVar),\n\n}\n\n\n","file_path":"crates/yuck/src/config/script_var_definition.rs","rank":87,"score":97043.87198687906},{"content":" iter.expect_done()?;\n\n Self {\n\n name_span,\n\n name: VarName(name),\n\n run_while_expr,\n\n run_while_var_refs,\n\n command: VarSource::Shell(script_span, script.to_string()),\n\n initial_value,\n\n interval,\n\n }\n\n };\n\n result.note(r#\"Expected format: `(defpoll name :interval \"10s\" \"echo 'a shell script'\")`\"#)\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\n\npub struct ListenScriptVar {\n\n pub name: VarName,\n\n pub command: String,\n\n pub initial_value: DynVal,\n","file_path":"crates/yuck/src/config/script_var_definition.rs","rank":88,"score":97043.11308497276},{"content":" },\n\n ScriptVarDefinition::Listen(x) => Some(x.command_span),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\n\npub enum VarSource {\n\n // TODO allow for other executors? (python, etc)\n\n Shell(Span, String),\n\n #[serde(skip)]\n\n Function(fn() -> Result<DynVal, Box<dyn std::error::Error + Sync + Send + 'static>>),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\n\npub struct PollScriptVar {\n\n pub name: VarName,\n\n pub run_while_expr: SimplExpr,\n\n pub run_while_var_refs: Vec<VarName>,\n\n pub command: VarSource,\n","file_path":"crates/yuck/src/config/script_var_definition.rs","rank":89,"score":97038.81732789808},{"content":"#[derive(StructOpt, Debug, Serialize, Deserialize, PartialEq)]\n\nstruct RawOpt {\n\n /// Write out debug logs. (To read the logs, run `eww logs`).\n\n #[structopt(long = \"debug\", global = true)]\n\n log_debug: bool,\n\n\n\n /// override path to configuration directory (directory that contains eww.yuck and eww.scss)\n\n #[structopt(short, long, global = true)]\n\n config: Option<std::path::PathBuf>,\n\n\n\n /// Watch the log output after executing the command\n\n #[structopt(long = \"logs\", global = true)]\n\n show_logs: bool,\n\n\n\n /// Restart the daemon completely before running the command\n\n #[structopt(long = \"restart\", global = true)]\n\n restart: bool,\n\n\n\n #[structopt(subcommand)]\n\n action: Action,\n\n}\n","file_path":"crates/eww/src/opts.rs","rank":90,"score":95746.34031813747},{"content":"fn handle_server_command(paths: &EwwPaths, action: &ActionWithServer, connect_attempts: usize) -> Result<()> {\n\n log::debug!(\"Trying to find server process at socket {}\", paths.get_ipc_socket_file().display());\n\n let mut stream = attempt_connect(&paths.get_ipc_socket_file(), connect_attempts).context(\"Failed to connect to daemon\")?;\n\n log::debug!(\"Connected to Eww server ({}).\", &paths.get_ipc_socket_file().display());\n\n let response = client::do_server_call(&mut stream, action).context(\"Error while forwarding command to server\")?;\n\n if let Some(response) = response {\n\n println!(\"{}\", response);\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"crates/eww/src/main.rs","rank":91,"score":95411.03990981233},{"content":"/// Joins two paths while keeping it somewhat pretty.\n\n/// If the second path is absolute, this will just return the second path.\n\n/// If it is relative, it will return the second path joined onto the first path, removing any `./` if present.\n\n/// TODO this is not yet perfect, as it will still leave ../ and multiple ./ etc,... check for a Path::simplify or something.\n\npub fn join_path_pretty<P: AsRef<std::path::Path>, P2: AsRef<std::path::Path>>(a: P, b: P2) -> std::path::PathBuf {\n\n let a = a.as_ref();\n\n let b = b.as_ref();\n\n if b.is_absolute() {\n\n b.to_path_buf()\n\n } else {\n\n a.parent().unwrap().join(b.strip_prefix(\"./\").unwrap_or(b))\n\n }\n\n}\n\n\n","file_path":"crates/eww/src/util.rs","rank":92,"score":92731.83482137744},{"content":"fn main() {\n\n lalrpop::Configuration::new().log_verbose().process_current_dir().unwrap();\n\n}\n","file_path":"crates/simplexpr/build.rs","rank":93,"score":92200.88585098267},{"content":"fn main() {\n\n lalrpop::process_root().unwrap();\n\n}\n","file_path":"crates/yuck/build.rs","rank":94,"score":92200.88585098267},{"content":"pub trait Rectangular {\n\n fn get_rect(&self) -> Rect;\n\n}\n\n\n\n#[derive(Debug, Copy, Clone, Eq, PartialEq, Display)]\n\n#[display(fmt = \".x*.y:.width*.height\")]\n\npub struct Rect {\n\n pub x: i32,\n\n pub y: i32,\n\n pub width: i32,\n\n pub height: i32,\n\n}\n\n\n\nimpl Rect {\n\n pub fn of(x: i32, y: i32, width: i32, height: i32) -> Self {\n\n Rect { x, y, width, height }\n\n }\n\n}\n\n\n\nimpl Rectangular for Rect {\n","file_path":"crates/eww/src/geometry.rs","rank":95,"score":90560.79557560122},{"content":"fn main() {\n\n let eww_binary_name = std::env::args().next().unwrap();\n\n let opts: opts::Opt = opts::Opt::from_env();\n\n\n\n let log_level_filter = if opts.log_debug { log::LevelFilter::Debug } else { log::LevelFilter::Info };\n\n if std::env::var(\"RUST_LOG\").is_ok() {\n\n pretty_env_logger::init_timed();\n\n } else {\n\n pretty_env_logger::formatted_timed_builder().filter(Some(\"eww\"), log_level_filter).init();\n\n }\n\n\n\n let result: Result<()> = try {\n\n let paths = opts\n\n .config_path\n\n .map(EwwPaths::from_config_dir)\n\n .unwrap_or_else(EwwPaths::default)\n\n .context(\"Failed to initialize eww paths\")?;\n\n\n\n let would_show_logs = match opts.action {\n\n opts::Action::ClientOnly(action) => {\n","file_path":"crates/eww/src/main.rs","rank":96,"score":90484.35990137282},{"content":"pub trait IterAverage {\n\n fn avg(self) -> f32;\n\n}\n\n\n\nimpl<I: Iterator<Item = f32>> IterAverage for I {\n\n fn avg(self) -> f32 {\n\n let mut total = 0f32;\n\n let mut cnt = 0f32;\n\n for value in self {\n\n total += value;\n\n cnt += 1f32;\n\n }\n\n total / cnt\n\n }\n\n}\n\n\n","file_path":"crates/eww/src/util.rs","rank":97,"score":89000.13891776351},{"content":"#[test]\n\nfn test() {\n\n test_parser!(\n\n \"1\",\n\n \"(12)\",\n\n \"1.2\",\n\n \"-1.2\",\n\n \"(1 2)\",\n\n \"(1 :foo 1)\",\n\n \"(:foo 1)\",\n\n \"(:foo->: 1)\",\n\n \"(foo 1)\",\n\n \"(lol😄 1)\",\n\n r#\"(test \"hi\")\"#,\n\n r#\"(test \"h\\\"i\")\"#,\n\n r#\"(test \" hi \")\"#,\n\n \"(+ (1 2 (* 2 5)))\",\n\n r#\"foo ; test\"#,\n\n r#\"(f arg ; test\n\n arg2)\"#,\n\n \"\\\"h\\\\\\\"i\\\"\"\n\n );\n\n}\n","file_path":"crates/yuck/src/parser/mod.rs","rank":98,"score":88856.4308707322},{"content":" #[debug_stub = \"ScriptVarHandler(...)\"]\n\n pub script_var_handler: ScriptVarHandlerHandle,\n\n\n\n pub paths: EwwPaths,\n\n}\n\n\n\nimpl App {\n\n /// Handle a DaemonCommand event.\n\n pub fn handle_command(&mut self, event: DaemonCommand) {\n\n log::debug!(\"Handling event: {:?}\", &event);\n\n let result: Result<_> = try {\n\n match event {\n\n DaemonCommand::NoOp => {}\n\n DaemonCommand::UpdateVars(mappings) => {\n\n for (var_name, new_value) in mappings {\n\n self.update_state(var_name, new_value);\n\n }\n\n }\n\n DaemonCommand::ReloadConfigAndCss(sender) => {\n\n let mut errors = Vec::new();\n","file_path":"crates/eww/src/app.rs","rank":99,"score":31.881700978447196}],"string":"[\n {\n \"content\": \"pub fn initial_value(var: &ScriptVarDefinition) -> Result<DynVal> {\\n\\n match var {\\n\\n ScriptVarDefinition::Poll(x) => match &x.initial_value {\\n\\n Some(value) => Ok(value.clone()),\\n\\n None => match &x.command {\\n\\n VarSource::Function(f) => f()\\n\\n .map_err(|err| anyhow!(err))\\n\\n .with_context(|| format!(\\\"Failed to compute initial value for {}\\\", &var.name())),\\n\\n VarSource::Shell(span, command) => {\\n\\n run_command(command).map_err(|e| anyhow!(create_script_var_failed_warn(*span, var.name(), &e.to_string())))\\n\\n }\\n\\n },\\n\\n },\\n\\n\\n\\n ScriptVarDefinition::Listen(var) => Ok(var.initial_value.clone()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/script_var.rs\",\n \"rank\": 1,\n \"score\": 260190.33509219586\n },\n {\n \"content\": \"pub fn stringify_diagnostic(mut diagnostic: codespan_reporting::diagnostic::Diagnostic<usize>) -> anyhow::Result<String> {\\n\\n diagnostic.labels.drain_filter(|label| Span(label.range.start, label.range.end, label.file_id).is_dummy());\\n\\n\\n\\n let mut config = term::Config::default();\\n\\n let mut chars = Chars::box_drawing();\\n\\n chars.single_primary_caret = '─';\\n\\n config.chars = chars;\\n\\n config.chars.note_bullet = '→';\\n\\n let mut buf = Vec::new();\\n\\n let mut writer = term::termcolor::Ansi::new(&mut buf);\\n\\n let files = YUCK_FILES.read().unwrap();\\n\\n term::emit(&mut writer, &config, &*files, &diagnostic)?;\\n\\n Ok(String::from_utf8(buf)?)\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/error_handling_ctx.rs\",\n \"rank\": 3,\n \"score\": 230103.73131626975\n },\n {\n \"content\": \"pub fn print_error(err: anyhow::Error) {\\n\\n match anyhow_err_to_diagnostic(&err) {\\n\\n Some(diag) => match stringify_diagnostic(diag) {\\n\\n Ok(diag) => {\\n\\n eprintln!(\\\"{}\\\", diag);\\n\\n }\\n\\n Err(_) => {\\n\\n log::error!(\\\"{:?}\\\", err);\\n\\n }\\n\\n },\\n\\n None => {\\n\\n log::error!(\\\"{:?}\\\", err);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/error_handling_ctx.rs\",\n \"rank\": 5,\n \"score\": 221111.47607127758\n },\n {\n \"content\": \"pub fn format_error(err: &anyhow::Error) -> String {\\n\\n for err in err.chain() {\\n\\n format!(\\\"chain: {}\\\", err);\\n\\n }\\n\\n anyhow_err_to_diagnostic(err).and_then(|diag| stringify_diagnostic(diag).ok()).unwrap_or_else(|| format!(\\\"{:?}\\\", err))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/error_handling_ctx.rs\",\n \"rank\": 6,\n \"score\": 214142.5178773678\n },\n {\n \"content\": \"pub fn anyhow_err_to_diagnostic(err: &anyhow::Error) -> Option<Diagnostic<usize>> {\\n\\n if let Some(err) = err.downcast_ref::<DiagError>() {\\n\\n Some(err.diag.clone())\\n\\n } else if let Some(err) = err.downcast_ref::<AstError>() {\\n\\n Some(err.to_diagnostic())\\n\\n } else if let Some(err) = err.downcast_ref::<ConversionError>() {\\n\\n Some(err.to_diagnostic())\\n\\n } else if let Some(err) = err.downcast_ref::<ValidationError>() {\\n\\n Some(err.to_diagnostic())\\n\\n } else if let Some(err) = err.downcast_ref::<EvalError>() {\\n\\n Some(err.to_diagnostic())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\n// pub fn print_diagnostic(diagnostic: codespan_reporting::diagnostic::Diagnostic<usize>) {\\n\\n// match stringify_diagnostic(diagnostic.clone()) {\\n\\n// Ok(diag) => {\\n\\n// eprintln!(\\\"{}\\\", diag);\\n\\n//}\\n\\n// Err(_) => {\\n\\n// log::error!(\\\"{:?}\\\", diagnostic);\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/error_handling_ctx.rs\",\n \"rank\": 9,\n \"score\": 209107.3727584941\n },\n {\n \"content\": \"pub fn get_inbuilt_vars() -> HashMap<VarName, ScriptVarDefinition> {\\n\\n builtin_vars! {Duration::new(2, 0),\\n\\n // @desc EWW_TEMPS - Heat of the components in Celcius\\n\\n \\\"EWW_TEMPS\\\" => || Ok(DynVal::from(get_temperatures())),\\n\\n\\n\\n // @desc EWW_RAM - Information on ram and swap usage in kB.\\n\\n \\\"EWW_RAM\\\" => || Ok(DynVal::from(get_ram())),\\n\\n\\n\\n // @desc EWW_DISK - Information on on all mounted partitions (Might report inaccurately on some filesystems, like btrfs)\\\\nExample: `{EWW_DISK[\\\"/\\\"]}`\\n\\n \\\"EWW_DISK\\\" => || Ok(DynVal::from(get_disks())),\\n\\n\\n\\n // @desc EWW_BATTERY - Battery capacity in procent of the main battery\\n\\n \\\"EWW_BATTERY\\\" => || Ok(DynVal::from(\\n\\n match get_battery_capacity() {\\n\\n Err(e) => {\\n\\n log::error!(\\\"Couldn't get the battery capacity: {:?}\\\", e);\\n\\n \\\"Error: Check `eww log` for more details\\\".to_string()\\n\\n }\\n\\n Ok(o) => o,\\n\\n }\\n\\n )),\\n\\n\\n\\n // @desc EWW_CPU - Information on the CPU cores: frequency and usage (No MacOS support)\\n\\n \\\"EWW_CPU\\\" => || Ok(DynVal::from(get_cpus())),\\n\\n\\n\\n // @desc EWW_NET - Bytes up/down on all interfaces\\n\\n \\\"EWW_NET\\\" => || Ok(DynVal::from(net())),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/config/inbuilt.rs\",\n \"rank\": 10,\n \"score\": 197879.18612002907\n },\n {\n \"content\": \"pub fn create_script_var_failed_warn(span: Span, var_name: &VarName, error_output: &str) -> DiagError {\\n\\n DiagError::new(gen_diagnostic! {\\n\\n kind = Severity::Warning,\\n\\n msg = format!(\\\"The script for the `{}`-variable exited unsuccessfully\\\", var_name),\\n\\n label = span => \\\"Defined here\\\",\\n\\n note = error_output,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/script_var.rs\",\n \"rank\": 12,\n \"score\": 187168.7684974826\n },\n {\n \"content\": \"/// Run a command and get the output\\n\\npub fn run_command(cmd: &str) -> Result<DynVal> {\\n\\n log::debug!(\\\"Running command: {}\\\", cmd);\\n\\n let command = Command::new(\\\"/bin/sh\\\").arg(\\\"-c\\\").arg(cmd).output()?;\\n\\n if !command.status.success() {\\n\\n bail!(\\\"Failed with output:\\\\n{}\\\", String::from_utf8(command.stderr)?);\\n\\n }\\n\\n let output = String::from_utf8(command.stdout)?;\\n\\n let output = output.trim_matches('\\\\n');\\n\\n Ok(DynVal::from(output))\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/config/script_var.rs\",\n \"rank\": 13,\n \"score\": 185986.79019191934\n },\n {\n \"content\": \"pub fn clear_files() {\\n\\n *YUCK_FILES.write().unwrap() = YuckFiles::new();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/error_handling_ctx.rs\",\n \"rank\": 14,\n \"score\": 180115.9936716832\n },\n {\n \"content\": \"pub fn validate_variables_in_widget_use(\\n\\n defs: &HashMap<String, WidgetDefinition>,\\n\\n variables: &HashSet<VarName>,\\n\\n widget: &WidgetUse,\\n\\n is_in_definition: bool,\\n\\n) -> Result<(), ValidationError> {\\n\\n let matching_definition = defs.get(&widget.name);\\n\\n if let Some(matching_def) = matching_definition {\\n\\n let missing_arg = matching_def\\n\\n .expected_args\\n\\n .iter()\\n\\n .find(|expected| !expected.optional && !widget.attrs.attrs.contains_key(&expected.name));\\n\\n if let Some(missing_arg) = missing_arg {\\n\\n return Err(ValidationError::MissingAttr {\\n\\n widget_name: widget.name.clone(),\\n\\n arg_name: missing_arg.name.clone(),\\n\\n arg_list_span: Some(matching_def.args_span),\\n\\n use_span: widget.attrs.span,\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"crates/yuck/src/config/validate.rs\",\n \"rank\": 15,\n \"score\": 177229.38007662434\n },\n {\n \"content\": \"/// Load an [EwwConfig] from a given file, resetting and applying the global YuckFiles object in [error_handling_ctx].\\n\\npub fn read_from_file(path: impl AsRef<Path>) -> Result<EwwConfig> {\\n\\n error_handling_ctx::clear_files();\\n\\n EwwConfig::read_from_file(&mut error_handling_ctx::YUCK_FILES.write().unwrap(), path)\\n\\n}\\n\\n\\n\\n/// Eww configuration structure.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct EwwConfig {\\n\\n widgets: HashMap<String, WidgetDefinition>,\\n\\n windows: HashMap<String, EwwWindowDefinition>,\\n\\n initial_variables: HashMap<VarName, DynVal>,\\n\\n script_vars: HashMap<VarName, ScriptVarDefinition>,\\n\\n\\n\\n // Links variable which affect state (active/inactive) of poll var to those poll variables\\n\\n poll_var_links: HashMap<VarName, Vec<VarName>>,\\n\\n}\\n\\n\\n\\nimpl Default for EwwConfig {\\n\\n fn default() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"crates/eww/src/config/eww_config.rs\",\n \"rank\": 16,\n \"score\": 168976.55152283236\n },\n {\n \"content\": \"pub fn create_pair() -> (DaemonResponseSender, tokio::sync::mpsc::UnboundedReceiver<DaemonResponse>) {\\n\\n let (sender, recv) = tokio::sync::mpsc::unbounded_channel();\\n\\n (DaemonResponseSender(sender), recv)\\n\\n}\\n\\n\\n\\nimpl DaemonResponseSender {\\n\\n pub fn send_success(&self, s: String) -> Result<()> {\\n\\n self.0.send(DaemonResponse::Success(s)).context(\\\"Failed to send success response from application thread\\\")\\n\\n }\\n\\n\\n\\n pub fn send_failure(&self, s: String) -> Result<()> {\\n\\n self.0.send(DaemonResponse::Failure(s)).context(\\\"Failed to send failure response from application thread\\\")\\n\\n }\\n\\n\\n\\n /// Given a list of errors, respond with an error value if there are any errors, and respond with success otherwise.\\n\\n pub fn respond_with_error_list(&self, errors: impl IntoIterator<Item = anyhow::Error>) -> Result<()> {\\n\\n let errors = errors.into_iter().map(|e| error_handling_ctx::format_error(&e)).join(\\\"\\\\n\\\");\\n\\n if errors.is_empty() {\\n\\n self.send_success(String::new())\\n\\n } else {\\n\",\n \"file_path\": \"crates/eww/src/daemon_response.rs\",\n \"rank\": 17,\n \"score\": 164842.30893556576\n },\n {\n \"content\": \"fn initialize_window(\\n\\n monitor_geometry: gdk::Rectangle,\\n\\n root_widget: gtk::Widget,\\n\\n window_def: config::EwwWindowDefinition,\\n\\n) -> Result<EwwWindow> {\\n\\n let window = display_backend::initialize_window(&window_def, monitor_geometry)\\n\\n .with_context(|| format!(\\\"monitor {} is unavailable\\\", window_def.monitor_number.unwrap()))?;\\n\\n\\n\\n window.set_title(&format!(\\\"Eww - {}\\\", window_def.name));\\n\\n window.set_position(gtk::WindowPosition::None);\\n\\n window.set_gravity(gdk::Gravity::Center);\\n\\n\\n\\n if let Some(geometry) = window_def.geometry {\\n\\n let actual_window_rect = get_window_rectangle(geometry, monitor_geometry);\\n\\n window.set_size_request(actual_window_rect.width, actual_window_rect.height);\\n\\n window.set_default_size(actual_window_rect.width, actual_window_rect.height);\\n\\n }\\n\\n window.set_decorated(false);\\n\\n window.set_skip_taskbar_hint(true);\\n\\n window.set_skip_pager_hint(true);\\n\",\n \"file_path\": \"crates/eww/src/app.rs\",\n \"rank\": 18,\n \"score\": 163614.34615750366\n },\n {\n \"content\": \"/// Replace all env-var references of the format `\\\"something ${foo}\\\"` in a string\\n\\n/// by the actual env-variables. If the env-var isn't found, will replace the\\n\\n/// reference with an empty string.\\n\\npub fn replace_env_var_references(input: String) -> String {\\n\\n regex!(r\\\"\\\\$\\\\{([^\\\\s]*)\\\\}\\\")\\n\\n .replace_all(&input, |var_name: ®ex::Captures| std::env::var(var_name.get(1).unwrap().as_str()).unwrap_or_default())\\n\\n .into_owned()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::replace_env_var_references;\\n\\n use std;\\n\\n\\n\\n #[test]\\n\\n fn test_replace_env_var_references() {\\n\\n let scss = \\\"$test: ${USER};\\\";\\n\\n\\n\\n assert_eq!(\\n\\n replace_env_var_references(String::from(scss)),\\n\\n format!(\\\"$test: {};\\\", std::env::var(\\\"USER\\\").unwrap_or_default())\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/util.rs\",\n \"rank\": 19,\n \"score\": 162501.49149464382\n },\n {\n \"content\": \"/// get a single ast node from a list of asts, returning an Err if the length is not exactly 1.\\n\\npub fn require_single_toplevel(span: Span, mut asts: Vec<Ast>) -> AstResult<Ast> {\\n\\n match asts.len() {\\n\\n 0 => Err(AstError::MissingNode(span)),\\n\\n 1 => Ok(asts.remove(0)),\\n\\n _ => Err(AstError::TooManyNodes(asts.get(1).unwrap().span().to(asts.last().unwrap().span()), 1)),\\n\\n }\\n\\n}\\n\\n\\n\\nmacro_rules! test_parser {\\n\\n ($($text:literal),*) => {{\\n\\n let p = parser::AstParser::new();\\n\\n use lexer::Lexer;\\n\\n\\n\\n ::insta::with_settings!({sort_maps => true}, {\\n\\n $(\\n\\n ::insta::assert_debug_snapshot!(p.parse(0, Lexer::new(0, $text.to_string())));\\n\\n )*\\n\\n });\\n\\n }}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/parser/mod.rs\",\n \"rank\": 20,\n \"score\": 158801.57130021427\n },\n {\n \"content\": \"pub fn do_server_call(stream: &mut UnixStream, action: &opts::ActionWithServer) -> Result<Option<DaemonResponse>> {\\n\\n log::debug!(\\\"Forwarding options to server\\\");\\n\\n stream.set_nonblocking(false).context(\\\"Failed to set stream to non-blocking\\\")?;\\n\\n\\n\\n let message_bytes = bincode::serialize(&action)?;\\n\\n\\n\\n stream.write(&(message_bytes.len() as u32).to_be_bytes()).context(\\\"Failed to send command size header to IPC stream\\\")?;\\n\\n\\n\\n stream.write_all(&message_bytes).context(\\\"Failed to write command to IPC stream\\\")?;\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n stream.set_read_timeout(Some(std::time::Duration::from_millis(100))).context(\\\"Failed to set read timeout\\\")?;\\n\\n stream.read_to_end(&mut buf).context(\\\"Error reading response from server\\\")?;\\n\\n\\n\\n Ok(if buf.is_empty() {\\n\\n None\\n\\n } else {\\n\\n let buf = bincode::deserialize(&buf)?;\\n\\n Some(buf)\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/client.rs\",\n \"rank\": 21,\n \"score\": 154522.90095218428\n },\n {\n \"content\": \"pub fn handle_client_only_action(paths: &EwwPaths, action: ActionClientOnly) -> Result<()> {\\n\\n match action {\\n\\n ActionClientOnly::Logs => {\\n\\n std::process::Command::new(\\\"tail\\\")\\n\\n .args([\\\"-f\\\", paths.get_log_file().to_string_lossy().as_ref()].iter())\\n\\n .stdin(Stdio::null())\\n\\n .spawn()?\\n\\n .wait()?;\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/client.rs\",\n \"rank\": 22,\n \"score\": 150931.0322763631\n },\n {\n \"content\": \"pub fn parse_stringlit(\\n\\n span: Span,\\n\\n mut segs: Vec<Sp<StrLitSegment>>,\\n\\n) -> Result<SimplExpr, lalrpop_util::ParseError<usize, Token, LexicalError>> {\\n\\n let file_id = span.2;\\n\\n let parser = crate::simplexpr_parser::ExprParser::new();\\n\\n\\n\\n if segs.len() == 1 {\\n\\n let (lo, seg, hi) = segs.remove(0);\\n\\n let span = Span(lo, hi, file_id);\\n\\n match seg {\\n\\n StrLitSegment::Literal(lit) => Ok(SimplExpr::Literal(DynVal(lit, span))),\\n\\n StrLitSegment::Interp(toks) => {\\n\\n let token_stream = toks.into_iter().map(Ok);\\n\\n parser.parse(file_id, token_stream)\\n\\n }\\n\\n }\\n\\n } else {\\n\\n let elems = segs\\n\\n .into_iter()\\n\",\n \"file_path\": \"crates/simplexpr/src/parser/lalrpop_helpers.rs\",\n \"rank\": 23,\n \"score\": 145366.28117537813\n },\n {\n \"content\": \"pub fn validate_widget_definition(\\n\\n other_defs: &HashMap<String, WidgetDefinition>,\\n\\n globals: &HashSet<VarName>,\\n\\n def: &WidgetDefinition,\\n\\n) -> Result<(), ValidationError> {\\n\\n let mut variables_in_scope = globals.clone();\\n\\n for arg in def.expected_args.iter() {\\n\\n variables_in_scope.insert(VarName(arg.name.to_string()));\\n\\n }\\n\\n\\n\\n validate_variables_in_widget_use(other_defs, &variables_in_scope, &def.widget, true)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/config/validate.rs\",\n \"rank\": 24,\n \"score\": 145366.2811753781\n },\n {\n \"content\": \"/// Parse consecutive `:keyword value` pairs from an expression iterator into an [Attributes].\\n\\nfn parse_key_values(iter: &mut AstIterator<impl Iterator<Item = Ast>>, fail_on_dangling_kw: bool) -> AstResult<Attributes> {\\n\\n let mut data = HashMap::new();\\n\\n let mut attrs_span = iter.remaining_span.point_span();\\n\\n loop {\\n\\n match iter.next() {\\n\\n Some(Ast::Keyword(key_span, kw)) => match iter.next() {\\n\\n Some(value) => {\\n\\n attrs_span.1 = iter.remaining_span.0;\\n\\n let attr_value = AttrEntry { key_span, value };\\n\\n data.insert(AttrName(kw), attr_value);\\n\\n }\\n\\n None => {\\n\\n if fail_on_dangling_kw {\\n\\n return Err(AstError::DanglingKeyword(key_span, kw));\\n\\n } else {\\n\\n iter.iter.put_back(Ast::Keyword(key_span, kw));\\n\\n attrs_span.1 = iter.remaining_span.0;\\n\\n return Ok(Attributes::new(attrs_span, data));\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"crates/yuck/src/parser/ast_iterator.rs\",\n \"rank\": 25,\n \"score\": 145355.17971251253\n },\n {\n \"content\": \"pub fn initialize_server(paths: EwwPaths, action: Option<DaemonCommand>) -> Result<ForkResult> {\\n\\n let (ui_send, mut ui_recv) = tokio::sync::mpsc::unbounded_channel();\\n\\n\\n\\n std::env::set_current_dir(&paths.get_config_dir())\\n\\n .with_context(|| format!(\\\"Failed to change working directory to {}\\\", paths.get_config_dir().display()))?;\\n\\n\\n\\n log::info!(\\\"Loading paths: {}\\\", &paths);\\n\\n\\n\\n let read_config = config::read_from_file(&paths.get_yuck_path());\\n\\n\\n\\n let eww_config = match read_config {\\n\\n Ok(config) => config,\\n\\n Err(err) => {\\n\\n error_handling_ctx::print_error(err);\\n\\n config::EwwConfig::default()\\n\\n }\\n\\n };\\n\\n\\n\\n let fork_result = do_detach(&paths.get_log_file())?;\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/server.rs\",\n \"rank\": 26,\n \"score\": 142902.54115299674\n },\n {\n \"content\": \"pub fn get_window_rectangle(geometry: WindowGeometry, screen_rect: gdk::Rectangle) -> gdk::Rectangle {\\n\\n let (offset_x, offset_y) = geometry.offset.relative_to(screen_rect.width, screen_rect.height);\\n\\n let (width, height) = geometry.size.relative_to(screen_rect.width, screen_rect.height);\\n\\n let x = screen_rect.x + offset_x + geometry.anchor_point.x.alignment_to_coordinate(width, screen_rect.width);\\n\\n let y = screen_rect.y + offset_y + geometry.anchor_point.y.alignment_to_coordinate(height, screen_rect.height);\\n\\n gdk::Rectangle { x, y, width, height }\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/app.rs\",\n \"rank\": 27,\n \"score\": 142682.54899618923\n },\n {\n \"content\": \"pub fn validate(config: &Config, additional_globals: Vec<VarName>) -> Result<(), ValidationError> {\\n\\n let var_names = std::iter::empty()\\n\\n .chain(additional_globals.iter().cloned())\\n\\n .chain(config.script_vars.keys().cloned())\\n\\n .chain(config.var_definitions.keys().cloned())\\n\\n .collect();\\n\\n for window in config.window_definitions.values() {\\n\\n validate_variables_in_widget_use(&config.widget_definitions, &var_names, &window.widget, false)?;\\n\\n }\\n\\n for def in config.widget_definitions.values() {\\n\\n validate_widget_definition(&config.widget_definitions, &var_names, def)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/config/validate.rs\",\n \"rank\": 28,\n \"score\": 142585.56996029866\n },\n {\n \"content\": \"/// Notify all listening tasks of the termination of the eww application process.\\n\\npub fn send_exit() -> Result<()> {\\n\\n (APPLICATION_EXIT_SENDER).send(()).context(\\\"Failed to send exit lifecycle event\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// Yields Ok(()) on application termination. Await on this in all long-running tasks\\n\\n/// and perform any cleanup if necessary.\\n\\npub async fn recv_exit() -> Result<()> {\\n\\n (APPLICATION_EXIT_SENDER).subscribe().recv().await.context(\\\"Failed to receive lifecycle event\\\")\\n\\n}\\n\\n\\n\\n/// Select in a loop, breaking once a application termination event (see `crate::application_lifecycle`) is received.\\n\\n#[macro_export]\\n\\nmacro_rules! loop_select_exiting {\\n\\n ($($content:tt)*) => {\\n\\n loop {\\n\\n tokio::select! {\\n\\n Ok(()) = crate::application_lifecycle::recv_exit() => {\\n\\n break;\\n\\n }\\n\\n $($content)*\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/application_lifecycle.rs\",\n \"rank\": 29,\n \"score\": 142038.6491454294\n },\n {\n \"content\": \"pub fn net() -> String {\\n\\n let mut c = SYSTEM.lock().unwrap();\\n\\n c.refresh_networks_list();\\n\\n let interfaces = format!(\\n\\n \\\"{{ {} }}\\\",\\n\\n &c.get_networks()\\n\\n .iter()\\n\\n .map(|a| format!(r#\\\"\\\"{}\\\": {{ \\\"NET_UP\\\": {}, \\\"NET_DOWN\\\": {} }}\\\"#, a.0, a.1.get_transmitted(), a.1.get_received()))\\n\\n .join(\\\",\\\"),\\n\\n );\\n\\n interfaces\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 30,\n \"score\": 142038.6491454294\n },\n {\n \"content\": \"pub fn generate_generic_widget_node(\\n\\n defs: &HashMap<String, WidgetDefinition>,\\n\\n local_env: &HashMap<VarName, SimplExpr>,\\n\\n w: WidgetUse,\\n\\n) -> AstResult<Box<dyn WidgetNode>> {\\n\\n if let Some(def) = defs.get(&w.name) {\\n\\n if !w.children.is_empty() {\\n\\n return Err(AstError::TooManyNodes(w.children_span(), 0).note(\\\"User-defined widgets cannot be given children.\\\"));\\n\\n }\\n\\n\\n\\n let mut new_local_env = w\\n\\n .attrs\\n\\n .attrs\\n\\n .into_iter()\\n\\n .map(|(name, value)| Ok((VarName(name.0), value.value.as_simplexpr()?.resolve_one_level(local_env))))\\n\\n .collect::<AstResult<HashMap<VarName, _>>>()?;\\n\\n\\n\\n // handle default value for optional arguments\\n\\n for expected in def.expected_args.iter().filter(|x| x.optional) {\\n\\n let var_name = VarName(expected.name.clone().0);\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_node.rs\",\n \"rank\": 31,\n \"score\": 141195.61597122886\n },\n {\n \"content\": \"pub fn get_cpus() -> String {\\n\\n let mut c = SYSTEM.lock().unwrap();\\n\\n c.refresh_cpu();\\n\\n let processors = c.get_processors();\\n\\n format!(\\n\\n r#\\\"{{ \\\"cores\\\": [{}], \\\"avg\\\": {} }}\\\"#,\\n\\n processors\\n\\n .iter()\\n\\n .map(|a| format!(\\n\\n r#\\\"{{\\\"core\\\": \\\"{}\\\", \\\"freq\\\": {}, \\\"usage\\\": {:.0}}}\\\"#,\\n\\n a.get_name(),\\n\\n a.get_frequency(),\\n\\n a.get_cpu_usage()\\n\\n ))\\n\\n .join(\\\",\\\"),\\n\\n processors.iter().map(|a| a.get_cpu_usage()).avg()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 32,\n \"score\": 139904.53581962135\n },\n {\n \"content\": \"pub fn get_temperatures() -> String {\\n\\n let mut c = SYSTEM.lock().unwrap();\\n\\n c.refresh_components_list();\\n\\n c.refresh_components();\\n\\n format!(\\n\\n \\\"{{ {} }}\\\",\\n\\n c.get_components()\\n\\n .iter()\\n\\n .map(|c| format!(r#\\\"\\\"{}\\\": {}\\\"#, c.get_label().to_uppercase().replace(\\\" \\\", \\\"_\\\"), c.get_temperature()))\\n\\n .join(\\\",\\\")\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 33,\n \"score\": 139904.53581962135\n },\n {\n \"content\": \"pub fn get_ram() -> String {\\n\\n let mut c = SYSTEM.lock().unwrap();\\n\\n c.refresh_memory();\\n\\n\\n\\n let total_memory = c.get_total_memory();\\n\\n let available_memory = c.get_available_memory();\\n\\n let used_memory = total_memory as f32 - available_memory as f32;\\n\\n format!(\\n\\n r#\\\"{{\\\"total_mem\\\": {}, \\\"free_mem\\\": {}, \\\"total_swap\\\": {}, \\\"free_swap\\\": {}, \\\"available_mem\\\": {}, \\\"used_mem\\\": {}, \\\"used_mem_perc\\\": {}}}\\\"#,\\n\\n total_memory,\\n\\n c.get_free_memory(),\\n\\n c.get_total_swap(),\\n\\n c.get_free_swap(),\\n\\n available_memory,\\n\\n used_memory,\\n\\n (used_memory / total_memory as f32) * 100f32,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 34,\n \"score\": 139904.53581962135\n },\n {\n \"content\": \"pub fn get_disks() -> String {\\n\\n let mut c = SYSTEM.lock().unwrap();\\n\\n c.refresh_disks_list();\\n\\n\\n\\n format!(\\n\\n \\\"{{ {} }}\\\",\\n\\n c.get_disks()\\n\\n .iter()\\n\\n .map(|c| {\\n\\n let total_space = c.get_total_space();\\n\\n let available_space = c.get_available_space();\\n\\n let used_space = total_space - available_space;\\n\\n format!(\\n\\n r#\\\"\\\"{}\\\": {{\\\"name\\\": {:?}, \\\"total\\\": {}, \\\"free\\\": {}, \\\"used\\\": {}, \\\"used_perc\\\": {}}}\\\"#,\\n\\n c.get_mount_point().display(),\\n\\n c.get_name(),\\n\\n total_space,\\n\\n available_space,\\n\\n used_space,\\n\\n (used_space as f32 / total_space as f32) * 100f32,\\n\\n )\\n\\n })\\n\\n .join(\\\",\\\")\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 35,\n \"score\": 139904.53581962135\n },\n {\n \"content\": \"fn listen_for_daemon_response(mut recv: DaemonResponseReceiver) {\\n\\n let rt = tokio::runtime::Builder::new_current_thread().enable_time().build().expect(\\\"Failed to initialize tokio runtime\\\");\\n\\n rt.block_on(async {\\n\\n if let Ok(Some(response)) = tokio::time::timeout(Duration::from_millis(100), recv.recv()).await {\\n\\n println!(\\\"{}\\\", response);\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/main.rs\",\n \"rank\": 44,\n \"score\": 134768.46487807002\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"macos\\\"))]\\n\\n#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub fn get_battery_capacity() -> Result<u8> {\\n\\n anyhow!(\\\"Eww doesn't support your OS for getting the battery capacity\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 45,\n \"score\": 132980.22502598038\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\npub fn get_battery_capacity() -> Result<String> {\\n\\n let mut current = 0_f64;\\n\\n let mut total = 0_f64;\\n\\n let mut json = String::from('{');\\n\\n for i in\\n\\n std::path::Path::new(\\\"/sys/class/power_supply\\\").read_dir().context(\\\"Couldn't read /sys/class/power_supply directory\\\")?\\n\\n {\\n\\n let i = i?.path();\\n\\n if i.is_dir() {\\n\\n // some ugly hack because if let Some(a) = a && Some(b) = b doesn't work yet\\n\\n if let (Ok(o), Ok(s)) = (read_to_string(i.join(\\\"capacity\\\")), read_to_string(i.join(\\\"status\\\"))) {\\n\\n json.push_str(&format!(\\n\\n r#\\\"{:?}: {{ \\\"status\\\": \\\"{}\\\", \\\"capacity\\\": {} }},\\\"#,\\n\\n i.file_name().context(\\\"couldn't convert file name to rust string\\\")?,\\n\\n s.replace(\\\"\\\\n\\\", \\\"\\\"),\\n\\n o.replace(\\\"\\\\n\\\", \\\"\\\")\\n\\n ));\\n\\n if let (Ok(t), Ok(c), Ok(v)) = (\\n\\n read_to_string(i.join(\\\"charge_full\\\")),\\n\\n read_to_string(i.join(\\\"charge_now\\\")),\\n\",\n \"file_path\": \"crates/eww/src/config/system_stats.rs\",\n \"rank\": 46,\n \"score\": 132980.22502598038\n },\n {\n \"content\": \"/// Check if a eww server is currently running by trying to send a ping message to it.\\n\\nfn check_server_running(socket_path: impl AsRef<Path>) -> bool {\\n\\n let response = net::UnixStream::connect(socket_path)\\n\\n .ok()\\n\\n .and_then(|mut stream| client::do_server_call(&mut stream, &opts::ActionWithServer::Ping).ok());\\n\\n response.is_some()\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct EwwPaths {\\n\\n log_file: PathBuf,\\n\\n ipc_socket_file: PathBuf,\\n\\n config_dir: PathBuf,\\n\\n}\\n\\n\\n\\nimpl EwwPaths {\\n\\n pub fn from_config_dir<P: AsRef<Path>>(config_dir: P) -> Result<Self> {\\n\\n let config_dir = config_dir.as_ref();\\n\\n if config_dir.is_file() {\\n\\n bail!(\\\"Please provide the path to the config directory, not a file within it\\\")\\n\\n }\\n\",\n \"file_path\": \"crates/eww/src/main.rs\",\n \"rank\": 47,\n \"score\": 128581.34822669487\n },\n {\n \"content\": \"/// read an scss file, replace all environment variable references within it and\\n\\n/// then parse it into css.\\n\\npub fn parse_scss_from_file(path: &Path) -> Result<String> {\\n\\n let config_dir = path.parent().context(\\\"Given SCSS file has no parent directory?!\\\")?;\\n\\n let scss_file_content =\\n\\n std::fs::read_to_string(path).with_context(|| format!(\\\"Given SCSS File Doesnt Exist! {}\\\", path.display()))?;\\n\\n let file_content = replace_env_var_references(scss_file_content);\\n\\n let grass_config = grass::Options::default().load_path(config_dir);\\n\\n grass::from_string(file_content, &grass_config).map_err(|err| anyhow!(\\\"Encountered SCSS parsing error: {:?}\\\", err))\\n\\n}\\n\\n\\n\\n#[ext(pub, name = StringExt)]\\n\\nimpl<T: AsRef<str>> T {\\n\\n /// check if the string is empty after removing all linebreaks and trimming\\n\\n /// whitespace\\n\\n fn is_blank(self) -> bool {\\n\\n self.as_ref().replace('\\\\n', \\\"\\\").trim().is_empty()\\n\\n }\\n\\n\\n\\n /// trim all lines in a string\\n\\n fn trim_lines(self) -> String {\\n\\n self.as_ref().lines().map(|line| line.trim()).join(\\\"\\\\n\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/util.rs\",\n \"rank\": 48,\n \"score\": 128011.9574580323\n },\n {\n \"content\": \"pub fn b<T>(x: T) -> Box<T> {\\n\\n Box::new(x)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/simplexpr/src/parser/lalrpop_helpers.rs\",\n \"rank\": 49,\n \"score\": 127841.04266244889\n },\n {\n \"content\": \"/// detach the process from the terminal, also redirecting stdout and stderr to LOG_FILE\\n\\nfn do_detach(log_file_path: impl AsRef<Path>) -> Result<ForkResult> {\\n\\n // detach from terminal\\n\\n match unsafe { nix::unistd::fork()? } {\\n\\n nix::unistd::ForkResult::Child => {\\n\\n nix::unistd::setsid()?;\\n\\n match unsafe { nix::unistd::fork()? } {\\n\\n nix::unistd::ForkResult::Parent { .. } => std::process::exit(0),\\n\\n nix::unistd::ForkResult::Child => {}\\n\\n }\\n\\n }\\n\\n nix::unistd::ForkResult::Parent { .. } => {\\n\\n return Ok(ForkResult::Parent);\\n\\n }\\n\\n }\\n\\n\\n\\n let file = std::fs::OpenOptions::new()\\n\\n .create(true)\\n\\n .append(true)\\n\\n .open(&log_file_path)\\n\\n .unwrap_or_else(|_| panic!(\\\"Error opening log file ({}), for writing\\\", log_file_path.as_ref().to_string_lossy()));\\n\",\n \"file_path\": \"crates/eww/src/server.rs\",\n \"rank\": 50,\n \"score\": 124575.63412460637\n },\n {\n \"content\": \"#[cfg(feature = \\\"x11\\\")]\\n\\nfn apply_window_position(\\n\\n mut window_geometry: WindowGeometry,\\n\\n monitor_geometry: gdk::Rectangle,\\n\\n window: >k::Window\\n\\n) -> Result<()> {\\n\\n\\n\\n let gdk_window = window.window().context(\\\"Failed to get gdk window from gtk window\\\")?;\\n\\n window_geometry.size = Coords::from_pixels(window.size());\\n\\n let actual_window_rect = get_window_rectangle(window_geometry, monitor_geometry);\\n\\n\\n\\n let gdk_origin = gdk_window.origin();\\n\\n\\n\\n if actual_window_rect.x != gdk_origin.1 || actual_window_rect.y != gdk_origin.2 {\\n\\n gdk_window.move_(actual_window_rect.x, actual_window_rect.y);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/app.rs\",\n \"rank\": 51,\n \"score\": 123611.32887371731\n },\n {\n \"content\": \"fn build_if_else(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\\n\\n if bargs.widget.children.len() != 2 {\\n\\n bail!(\\\"if-widget needs to have exactly two children, but had {}\\\", bargs.widget.children.len());\\n\\n }\\n\\n let gtk_widget = gtk::Box::new(gtk::Orientation::Vertical, 0);\\n\\n let (yes_widget, no_widget) = (bargs.widget.children[0].clone(), bargs.widget.children[1].clone());\\n\\n\\n\\n let yes_widget = yes_widget.render(bargs.eww_state, bargs.window_name, bargs.widget_definitions)?;\\n\\n let no_widget = no_widget.render(bargs.eww_state, bargs.window_name, bargs.widget_definitions)?;\\n\\n\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n prop(cond: as_bool) {\\n\\n gtk_widget.children().iter().for_each(|w| gtk_widget.remove(w));\\n\\n if cond {\\n\\n gtk_widget.add(&yes_widget)\\n\\n } else {\\n\\n gtk_widget.add(&no_widget)\\n\\n }\\n\\n }\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 52,\n \"score\": 122102.63250589554\n },\n {\n \"content\": \"/// @widget input\\n\\n/// @desc An input field. For this to be useful, set `focusable=\\\"true\\\"` on the window.\\n\\nfn build_gtk_input(bargs: &mut BuilderArgs) -> Result<gtk::Entry> {\\n\\n let gtk_widget = gtk::Entry::new();\\n\\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop value - the content of the text field\\n\\n prop(value: as_string) {\\n\\n gtk_widget.set_text(&value);\\n\\n },\\n\\n\\n\\n // @prop onchange - Command to run when the text changes. The placeholder `{}` will be replaced by the value\\n\\n // @prop timeout - timeout of the command\\n\\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\\n\\n let old_id = on_change_handler_id.replace(Some(\\n\\n gtk_widget.connect_changed(move |gtk_widget| {\\n\\n run_command(timeout, &onchange, gtk_widget.text().to_string());\\n\\n })\\n\\n ));\\n\\n old_id.map(|id| gtk_widget.disconnect(id));\\n\\n }\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 53,\n \"score\": 120463.10477146071\n },\n {\n \"content\": \"/// @widget button extends container\\n\\n/// @desc A button\\n\\nfn build_gtk_button(bargs: &mut BuilderArgs) -> Result<gtk::Button> {\\n\\n let gtk_widget = gtk::Button::new();\\n\\n let on_click_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop onclick - a command that get's run when the button is clicked\\n\\n // @prop onmiddleclick - a command that get's run when the button is middleclicked\\n\\n // @prop onrightclick - a command that get's run when the button is rightclicked\\n\\n // @prop timeout - timeout of the command\\n\\n prop(\\n\\n timeout: as_duration = Duration::from_millis(200),\\n\\n onclick: as_string = \\\"\\\",\\n\\n onmiddleclick: as_string = \\\"\\\",\\n\\n onrightclick: as_string = \\\"\\\"\\n\\n ) {\\n\\n gtk_widget.add_events(gdk::EventMask::ENTER_NOTIFY_MASK);\\n\\n let old_id = on_click_handler_id.replace(Some(\\n\\n gtk_widget.connect_button_press_event(move |_, evt| {\\n\\n match evt.button() {\\n\\n 1 => run_command(timeout, &onclick, \\\"\\\"),\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 54,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget literal\\n\\n/// @desc A widget that allows you to render arbitrary yuck.\\n\\nfn build_gtk_literal(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\\n\\n let gtk_widget = gtk::Box::new(gtk::Orientation::Vertical, 0);\\n\\n gtk_widget.set_widget_name(\\\"literal\\\");\\n\\n\\n\\n // TODO these clones here are dumdum\\n\\n let window_name = bargs.window_name.to_string();\\n\\n let widget_definitions = bargs.widget_definitions.clone();\\n\\n let literal_use_span = bargs.widget.span;\\n\\n\\n\\n // the file id the literal-content has been stored under, for error reporting.\\n\\n let literal_file_id: Rc<RefCell<Option<usize>>> = Rc::new(RefCell::new(None));\\n\\n\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop content - inline yuck that will be rendered as a widget.\\n\\n prop(content: as_string) {\\n\\n gtk_widget.children().iter().for_each(|w| gtk_widget.remove(w));\\n\\n if !content.is_empty() {\\n\\n let widget_node_result: AstResult<_> = try {\\n\\n let ast = {\\n\\n let mut yuck_files = error_handling_ctx::YUCK_FILES.write().unwrap();\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 55,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget calendar\\n\\n/// @desc A widget that displays a calendar\\n\\nfn build_gtk_calendar(bargs: &mut BuilderArgs) -> Result<gtk::Calendar> {\\n\\n let gtk_widget = gtk::Calendar::new();\\n\\n let on_click_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop day - the selected day\\n\\n prop(day: as_f64) { gtk_widget.set_day(day as i32) },\\n\\n // @prop month - the selected month\\n\\n prop(month: as_f64) { gtk_widget.set_month(month as i32) },\\n\\n // @prop year - the selected year\\n\\n prop(year: as_f64) { gtk_widget.set_year(year as i32) },\\n\\n // @prop show-details - show details\\n\\n prop(show_details: as_bool) { gtk_widget.set_show_details(show_details) },\\n\\n // @prop show-heading - show heading line\\n\\n prop(show_heading: as_bool) { gtk_widget.set_show_heading(show_heading) },\\n\\n // @prop show-day-names - show names of days\\n\\n prop(show_day_names: as_bool) { gtk_widget.set_show_day_names(show_day_names) },\\n\\n // @prop show-week-numbers - show week numbers\\n\\n prop(show_week_numbers: as_bool) { gtk_widget.set_show_week_numbers(show_week_numbers) },\\n\\n // @prop onclick - command to run when the user selects a date. The `{}` placeholder will be replaced by the selected date.\\n\\n // @prop timeout - timeout of the command\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 56,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget image\\n\\n/// @desc A widget displaying an image\\n\\nfn build_gtk_image(bargs: &mut BuilderArgs) -> Result<gtk::Image> {\\n\\n let gtk_widget = gtk::Image::new();\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop path - path to the image file\\n\\n // @prop width - width of the image\\n\\n // @prop height - height of the image\\n\\n prop(path: as_string, width: as_i32 = 10000, height: as_i32 = 10000) {\\n\\n if path.ends_with(\\\".gif\\\") {\\n\\n let pixbuf_animation = gtk::gdk_pixbuf::PixbufAnimation::from_file(std::path::PathBuf::from(path))?;\\n\\n gtk_widget.set_from_animation(&pixbuf_animation);\\n\\n } else {\\n\\n let pixbuf = gtk::gdk_pixbuf::Pixbuf::from_file_at_size(std::path::PathBuf::from(path), width, height)?;\\n\\n gtk_widget.set_from_pixbuf(Some(&pixbuf));\\n\\n }\\n\\n }\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 57,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget box extends container\\n\\n/// @desc the main layout container\\n\\nfn build_gtk_box(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\\n\\n let gtk_widget = gtk::Box::new(gtk::Orientation::Horizontal, 0);\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop spacing - spacing between elements\\n\\n prop(spacing: as_i32 = 0) { gtk_widget.set_spacing(spacing) },\\n\\n // @prop orientation - orientation of the box. possible values: $orientation\\n\\n prop(orientation: as_string) { gtk_widget.set_orientation(parse_orientation(&orientation)?) },\\n\\n // @prop space-evenly - space the widgets evenly.\\n\\n prop(space_evenly: as_bool = true) { gtk_widget.set_homogeneous(space_evenly) },\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 58,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget expander extends container\\n\\n/// @desc A widget that can expand and collapse, showing/hiding it's children.\\n\\nfn build_gtk_expander(bargs: &mut BuilderArgs) -> Result<gtk::Expander> {\\n\\n let gtk_widget = gtk::Expander::new(None);\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop name - name of the expander\\n\\n prop(name: as_string) {gtk_widget.set_label(Some(&name));},\\n\\n // @prop expanded - sets if the tree is expanded\\n\\n prop(expanded: as_bool) { gtk_widget.set_expanded(expanded); }\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 59,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget revealer extends container\\n\\n/// @desc A widget that can reveal a child with an animation.\\n\\nfn build_gtk_revealer(bargs: &mut BuilderArgs) -> Result<gtk::Revealer> {\\n\\n let gtk_widget = gtk::Revealer::new();\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop transition - the name of the transition. Possible values: $transition\\n\\n prop(transition: as_string = \\\"crossfade\\\") { gtk_widget.set_transition_type(parse_transition(&transition)?); },\\n\\n // @prop reveal - sets if the child is revealed or not\\n\\n prop(reveal: as_bool) { gtk_widget.set_reveal_child(reveal); },\\n\\n // @prop duration - the duration of the reveal transition\\n\\n prop(duration: as_duration = Duration::from_millis(500)) { gtk_widget.set_transition_duration(duration.as_millis() as u32); },\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 60,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget scale extends range\\n\\n/// @desc A slider.\\n\\nfn build_gtk_scale(bargs: &mut BuilderArgs) -> Result<gtk::Scale> {\\n\\n let gtk_widget = gtk::Scale::new(gtk::Orientation::Horizontal, Some(>k::Adjustment::new(0.0, 0.0, 100.0, 1.0, 1.0, 1.0)));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop flipped - flip the direction\\n\\n prop(flipped: as_bool) { gtk_widget.set_inverted(flipped) },\\n\\n\\n\\n // @prop draw-value - draw the value of the property\\n\\n prop(draw_value: as_bool = false) { gtk_widget.set_draw_value(draw_value) },\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 61,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget label\\n\\n/// @desc A text widget giving you more control over how the text is displayed\\n\\nfn build_gtk_label(bargs: &mut BuilderArgs) -> Result<gtk::Label> {\\n\\n let gtk_widget = gtk::Label::new(None);\\n\\n\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop text - the text to display\\n\\n // @prop limit-width - maximum count of characters to display\\n\\n // @prop show_truncated - show whether the text was truncated\\n\\n prop(text: as_string, limit_width: as_i32 = i32::MAX, show_truncated: as_bool = true) {\\n\\n let truncated = text.chars().count() > limit_width as usize;\\n\\n let mut text = text.chars().take(limit_width as usize).collect::<String>();\\n\\n\\n\\n if show_truncated && truncated {\\n\\n text.push_str(\\\"...\\\");\\n\\n }\\n\\n\\n\\n let text = unescape::unescape(&text).context(format!(\\\"Failed to unescape label text {}\\\", &text))?;\\n\\n let text = unindent::unindent(&text);\\n\\n gtk_widget.set_text(&text);\\n\\n },\\n\\n // @prop markup - Pango markup to display\\n\\n prop(markup: as_string) { gtk_widget.set_markup(&markup); },\\n\\n // @prop wrap - Wrap the text. This mainly makes sense if you set the width of this widget.\\n\\n prop(wrap: as_bool) { gtk_widget.set_line_wrap(wrap) },\\n\\n // @prop angle - the angle of rotation for the label (between 0 - 360)\\n\\n prop(angle: as_f64 = 0) { gtk_widget.set_angle(angle) }\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 62,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"/// @widget centerbox extends container\\n\\n/// @desc a box that must contain exactly three children, which will be layed out at the start, center and end of the container.\\n\\nfn build_center_box(bargs: &mut BuilderArgs) -> Result<gtk::Box> {\\n\\n let gtk_widget = gtk::Box::new(gtk::Orientation::Horizontal, 0);\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop orientation - orientation of the centerbox. possible values: $orientation\\n\\n prop(orientation: as_string) { gtk_widget.set_orientation(parse_orientation(&orientation)?) },\\n\\n });\\n\\n\\n\\n match bargs.widget.children.len().cmp(&3) {\\n\\n Ordering::Less => {\\n\\n Err(DiagError::new(gen_diagnostic!(\\\"centerbox must contain exactly 3 elements\\\", bargs.widget.span)).into())\\n\\n }\\n\\n Ordering::Greater => {\\n\\n let (_, additional_children) = bargs.widget.children.split_at(3);\\n\\n // we know that there is more than three children, so unwrapping on first and left here is fine.\\n\\n let first_span = additional_children.first().unwrap().span();\\n\\n let last_span = additional_children.last().unwrap().span();\\n\\n Err(DiagError::new(gen_diagnostic!(\\n\\n \\\"centerbox must contain exactly 3 elements, but got more\\\",\\n\\n first_span.to(last_span)\\n\\n ))\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 63,\n \"score\": 120459.29843450004\n },\n {\n \"content\": \"fn init_async_part(paths: EwwPaths, ui_send: UnboundedSender<app::DaemonCommand>) {\\n\\n std::thread::spawn(move || {\\n\\n let rt = tokio::runtime::Builder::new_multi_thread().enable_all().build().expect(\\\"Failed to initialize tokio runtime\\\");\\n\\n rt.block_on(async {\\n\\n let filewatch_join_handle = {\\n\\n let ui_send = ui_send.clone();\\n\\n let paths = paths.clone();\\n\\n tokio::spawn(async move { run_filewatch(paths.config_dir, ui_send).await })\\n\\n };\\n\\n\\n\\n let ipc_server_join_handle = {\\n\\n let ui_send = ui_send.clone();\\n\\n tokio::spawn(async move { ipc_server::run_server(ui_send, paths.get_ipc_socket_file()).await })\\n\\n };\\n\\n\\n\\n let forward_exit_to_app_handle = {\\n\\n let ui_send = ui_send.clone();\\n\\n tokio::spawn(async move {\\n\\n // Wait for application exit event\\n\\n let _ = crate::application_lifecycle::recv_exit().await;\\n\",\n \"file_path\": \"crates/eww/src/server.rs\",\n \"rank\": 64,\n \"score\": 119562.43336951268\n },\n {\n \"content\": \"/// @widget progress\\n\\n/// @desc A progress bar\\n\\nfn build_gtk_progress(bargs: &mut BuilderArgs) -> Result<gtk::ProgressBar> {\\n\\n let gtk_widget = gtk::ProgressBar::new();\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop flipped - flip the direction\\n\\n prop(flipped: as_bool) { gtk_widget.set_inverted(flipped) },\\n\\n\\n\\n // @prop value - value of the progress bar (between 0-100)\\n\\n prop(value: as_f64) { gtk_widget.set_fraction(value / 100f64) },\\n\\n\\n\\n // @prop orientation - orientation of the progress bar. possible values: $orientation\\n\\n prop(orientation: as_string) { gtk_widget.set_orientation(parse_orientation(&orientation)?) },\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 65,\n \"score\": 118882.02922412581\n },\n {\n \"content\": \"/// @widget a checkbox\\n\\n/// @desc A checkbox that can trigger events on checked / unchecked.\\n\\nfn build_gtk_checkbox(bargs: &mut BuilderArgs) -> Result<gtk::CheckButton> {\\n\\n let gtk_widget = gtk::CheckButton::new();\\n\\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop timeout - timeout of the command\\n\\n // @prop onchecked - action (command) to be executed when checked by the user\\n\\n // @prop onunchecked - similar to onchecked but when the widget is unchecked\\n\\n prop(timeout: as_duration = Duration::from_millis(200), onchecked: as_string = \\\"\\\", onunchecked: as_string = \\\"\\\") {\\n\\n let old_id = on_change_handler_id.replace(Some(\\n\\n gtk_widget.connect_toggled(move |gtk_widget| {\\n\\n run_command(timeout, if gtk_widget.is_active() { &onchecked } else { &onunchecked }, \\\"\\\");\\n\\n })\\n\\n ));\\n\\n old_id.map(|id| gtk_widget.disconnect(id));\\n\\n }\\n\\n });\\n\\n\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 66,\n \"score\": 118882.02922412581\n },\n {\n \"content\": \"pub fn parse_string(file_id: usize, s: &str) -> AstResult<Ast> {\\n\\n let lexer = lexer::Lexer::new(file_id, s.to_string());\\n\\n let parser = parser::AstParser::new();\\n\\n parser.parse(file_id, lexer).map_err(|e| AstError::from_parse_error(file_id, e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/parser/mod.rs\",\n \"rank\": 67,\n \"score\": 118630.43499252842\n },\n {\n \"content\": \"/// @widget color-button\\n\\n/// @desc A button opening a color chooser window\\n\\nfn build_gtk_color_button(bargs: &mut BuilderArgs) -> Result<gtk::ColorButton> {\\n\\n let gtk_widget = gtk::ColorButtonBuilder::new().build();\\n\\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop use-alpha - bool to whether or not use alpha\\n\\n prop(use_alpha: as_bool) {gtk_widget.set_use_alpha(use_alpha);},\\n\\n\\n\\n // @prop onchange - runs the code when the color was selected\\n\\n // @prop timeout - timeout of the command\\n\\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\\n\\n let old_id = on_change_handler_id.replace(Some(\\n\\n gtk_widget.connect_color_set(move |gtk_widget| {\\n\\n run_command(timeout, &onchange, gtk_widget.rgba());\\n\\n })\\n\\n ));\\n\\n old_id.map(|id| gtk_widget.disconnect(id));\\n\\n }\\n\\n });\\n\\n\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 68,\n \"score\": 117366.91949442484\n },\n {\n \"content\": \"/// @widget color-chooser\\n\\n/// @desc A color chooser widget\\n\\nfn build_gtk_color_chooser(bargs: &mut BuilderArgs) -> Result<gtk::ColorChooserWidget> {\\n\\n let gtk_widget = gtk::ColorChooserWidget::new();\\n\\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop use-alpha - bool to wether or not use alpha\\n\\n prop(use_alpha: as_bool) {gtk_widget.set_use_alpha(use_alpha);},\\n\\n\\n\\n // @prop onchange - runs the code when the color was selected\\n\\n // @prop timeout - timeout of the command\\n\\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\\n\\n let old_id = on_change_handler_id.replace(Some(\\n\\n gtk_widget.connect_color_activated(move |_a, color| {\\n\\n run_command(timeout, &onchange, *color);\\n\\n })\\n\\n ));\\n\\n old_id.map(|id| gtk_widget.disconnect(id));\\n\\n }\\n\\n });\\n\\n\\n\\n Ok(gtk_widget)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 69,\n \"score\": 115910.36573537912\n },\n {\n \"content\": \"/// @widget combo-box-text\\n\\n/// @desc A combo box allowing the user to choose between several items.\\n\\nfn build_gtk_combo_box_text(bargs: &mut BuilderArgs) -> Result<gtk::ComboBoxText> {\\n\\n let gtk_widget = gtk::ComboBoxText::new();\\n\\n let on_change_handler_id: EventHandlerId = Rc::new(RefCell::new(None));\\n\\n resolve_block!(bargs, gtk_widget, {\\n\\n // @prop items - Items that should be displayed in the combo box\\n\\n prop(items: as_vec) {\\n\\n gtk_widget.remove_all();\\n\\n for i in items {\\n\\n gtk_widget.append_text(&i);\\n\\n }\\n\\n },\\n\\n // @prop timeout - timeout of the command\\n\\n // @prop onchange - runs the code when a item was selected, replacing {} with the item as a string\\n\\n prop(timeout: as_duration = Duration::from_millis(200), onchange: as_string) {\\n\\n let old_id = on_change_handler_id.replace(Some(\\n\\n gtk_widget.connect_changed(move |gtk_widget| {\\n\\n run_command(timeout, &onchange, gtk_widget.active_text().unwrap_or_else(|| \\\"\\\".into()));\\n\\n })\\n\\n ));\\n\\n old_id.map(|id| gtk_widget.disconnect(id));\\n\\n },\\n\\n });\\n\\n Ok(gtk_widget)\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/widgets/widget_definitions.rs\",\n \"rank\": 70,\n \"score\": 114509.0376935173\n },\n {\n \"content\": \"fn attempt_connect(socket_path: impl AsRef<Path>, attempts: usize) -> Option<net::UnixStream> {\\n\\n for _ in 0..attempts {\\n\\n if let Ok(mut con) = net::UnixStream::connect(&socket_path) {\\n\\n if client::do_server_call(&mut con, &opts::ActionWithServer::Ping).is_ok() {\\n\\n return net::UnixStream::connect(&socket_path).ok();\\n\\n }\\n\\n }\\n\\n std::thread::sleep(Duration::from_millis(200));\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/main.rs\",\n \"rank\": 71,\n \"score\": 114142.46013823857\n },\n {\n \"content\": \"/// Parse multiple toplevel nodes into a list of [Ast]\\n\\npub fn parse_toplevel(file_id: usize, s: String) -> AstResult<(Span, Vec<Ast>)> {\\n\\n let lexer = lexer::Lexer::new(file_id, s);\\n\\n let parser = parser::ToplevelParser::new();\\n\\n parser.parse(file_id, lexer).map_err(|e| AstError::from_parse_error(file_id, e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/parser/mod.rs\",\n \"rank\": 72,\n \"score\": 112083.22598821358\n },\n {\n \"content\": \"fn parse_var_update_arg(s: &str) -> Result<(VarName, DynVal)> {\\n\\n let (name, value) = s\\n\\n .split_once('=')\\n\\n .with_context(|| format!(\\\"arguments must be in the shape `variable_name=\\\\\\\"new_value\\\\\\\"`, but got: {}\\\", s))?;\\n\\n Ok((name.into(), DynVal::from_string(value.to_owned())))\\n\\n}\\n\\n\\n\\nimpl ActionWithServer {\\n\\n pub fn can_start_daemon(&self) -> bool {\\n\\n matches!(self, ActionWithServer::OpenWindow { .. } | ActionWithServer::OpenMany { .. })\\n\\n }\\n\\n\\n\\n pub fn into_daemon_command(self) -> (app::DaemonCommand, Option<daemon_response::DaemonResponseReceiver>) {\\n\\n let command = match self {\\n\\n ActionWithServer::Update { mappings } => app::DaemonCommand::UpdateVars(mappings),\\n\\n\\n\\n ActionWithServer::KillServer => app::DaemonCommand::KillServer,\\n\\n ActionWithServer::CloseAll => app::DaemonCommand::CloseAll,\\n\\n ActionWithServer::Ping => {\\n\\n let (send, recv) = tokio::sync::mpsc::unbounded_channel();\\n\",\n \"file_path\": \"crates/eww/src/opts.rs\",\n \"rank\": 73,\n \"score\": 112083.09881764624\n },\n {\n \"content\": \"fn label_from_simplexpr(value: SimplExpr, span: Span) -> WidgetUse {\\n\\n WidgetUse {\\n\\n name: \\\"label\\\".to_string(),\\n\\n name_span: span.point_span(),\\n\\n attrs: Attributes::new(\\n\\n span,\\n\\n maplit::hashmap! {\\n\\n AttrName(\\\"text\\\".to_string()) => AttrEntry::new(\\n\\n span,\\n\\n Ast::SimplExpr(span, value)\\n\\n )\\n\\n },\\n\\n ),\\n\\n children: Vec::new(),\\n\\n span,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/yuck/src/config/widget_use.rs\",\n \"rank\": 74,\n \"score\": 110871.22326642784\n },\n {\n \"content\": \"pub fn parse_string(byte_offset: usize, file_id: usize, s: &str) -> Result<SimplExpr> {\\n\\n let lexer = lexer::Lexer::new(file_id, byte_offset, s);\\n\\n let parser = crate::simplexpr_parser::ExprParser::new();\\n\\n parser.parse(file_id, lexer).map_err(|e| Error::from_parse_error(file_id, e))\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n macro_rules! test_parser {\\n\\n ($($text:literal),* $(,)?) => {{\\n\\n let p = crate::simplexpr_parser::ExprParser::new();\\n\\n use crate::parser::lexer::Lexer;\\n\\n ::insta::with_settings!({sort_maps => true}, {\\n\\n $(\\n\\n ::insta::assert_debug_snapshot!(p.parse(0, Lexer::new(0, 0, $text)));\\n\\n )*\\n\\n });\\n\\n }}\\n\\n }\\n\\n\\n\",\n \"file_path\": \"crates/simplexpr/src/parser/mod.rs\",\n \"rank\": 75,\n \"score\": 110574.61232748312\n },\n {\n \"content\": \"fn with_response_channel<O, F>(f: F) -> (O, Option<tokio::sync::mpsc::UnboundedReceiver<DaemonResponse>>)\\n\\nwhere\\n\\n F: FnOnce(DaemonResponseSender) -> O,\\n\\n{\\n\\n let (sender, recv) = daemon_response::create_pair();\\n\\n (f(sender), Some(recv))\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/opts.rs\",\n \"rank\": 76,\n \"score\": 109798.05096724555\n },\n {\n \"content\": \"fn variable_deprecation_note(var_name: String) -> Option<String> {\\n\\n (var_name == \\\"EWW_CPU_USAGE\\\")\\n\\n .then(|| \\\"Note: EWW_CPU_USAGE has recently been removed, and has now been renamed to EWW_CPU\\\".to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/format_diagnostic.rs\",\n \"rank\": 77,\n \"score\": 104887.96232616673\n },\n {\n \"content\": \"/// Get the monitor geometry of a given monitor number, or the default if none is given\\n\\nfn get_monitor_geometry(n: Option<i32>) -> Result<gdk::Rectangle> {\\n\\n #[allow(deprecated)]\\n\\n let display = gdk::Display::default().expect(\\\"could not get default display\\\");\\n\\n let monitor = match n {\\n\\n Some(n) => display.monitor(n).with_context(|| format!(\\\"Failed to get monitor with index {}\\\", n))?,\\n\\n None => display.primary_monitor().context(\\\"Failed to get primary monitor from GTK\\\")?,\\n\\n };\\n\\n Ok(monitor.geometry())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/app.rs\",\n \"rank\": 78,\n \"score\": 104749.39243755973\n },\n {\n \"content\": \"/// Compute the difference of two lists, returning a tuple of\\n\\n/// (\\n\\n/// elements that where in a but not in b,\\n\\n/// elements that where in b but not in a\\n\\n/// ).\\n\\npub fn list_difference<'a, 'b, T: PartialEq>(a: &'a [T], b: &'b [T]) -> (Vec<&'a T>, Vec<&'b T>) {\\n\\n let mut missing = Vec::new();\\n\\n for elem in a {\\n\\n if !b.contains(elem) {\\n\\n missing.push(elem);\\n\\n }\\n\\n }\\n\\n\\n\\n let mut new = Vec::new();\\n\\n for elem in b {\\n\\n if !a.contains(elem) {\\n\\n new.push(elem);\\n\\n }\\n\\n }\\n\\n (missing, new)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/util.rs\",\n \"rank\": 79,\n \"score\": 104565.3072048305\n },\n {\n \"content\": \"fn on_screen_changed(window: >k::Window, _old_screen: Option<&gdk::Screen>) {\\n\\n let visual = window\\n\\n .screen()\\n\\n .and_then(|screen| screen.rgba_visual().filter(|_| screen.is_composited()).or_else(|| screen.system_visual()));\\n\\n window.set_visual(visual.as_ref());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/app.rs\",\n \"rank\": 80,\n \"score\": 100186.31593582404\n },\n {\n \"content\": \"use std::process::Command;\\n\\n\\n\\nuse anyhow::*;\\n\\nuse codespan_reporting::diagnostic::Severity;\\n\\nuse eww_shared_util::{Span, VarName};\\n\\nuse simplexpr::dynval::DynVal;\\n\\nuse yuck::{\\n\\n config::script_var_definition::{ScriptVarDefinition, VarSource},\\n\\n gen_diagnostic,\\n\\n};\\n\\n\\n\\nuse crate::error::DiagError;\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/config/script_var.rs\",\n \"rank\": 81,\n \"score\": 99549.78423091338\n },\n {\n \"content\": \"/// extends a hashmap, returning a list of keys that already where present in the hashmap.\\n\\npub fn extend_safe<K: std::cmp::Eq + std::hash::Hash + Clone, V, T: IntoIterator<Item = (K, V)>>(\\n\\n a: &mut std::collections::HashMap<K, V>,\\n\\n b: T,\\n\\n) -> Vec<K> {\\n\\n b.into_iter().filter_map(|(k, v)| a.insert(k.clone(), v).map(|_| k.clone())).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/util.rs\",\n \"rank\": 82,\n \"score\": 99103.48253597961\n },\n {\n \"content\": \"pub fn get_parse_error_span<T, E: Spanned>(file_id: usize, err: &lalrpop_util::ParseError<usize, T, E>) -> Span {\\n\\n use lalrpop_util::ParseError::*;\\n\\n match err {\\n\\n InvalidToken { location } => Span(*location, *location, file_id),\\n\\n UnrecognizedEOF { location, expected } => Span(*location, *location, file_id),\\n\\n UnrecognizedToken { token, expected } => Span(token.0, token.2, file_id),\\n\\n ExtraToken { token } => Span(token.0, token.2, file_id),\\n\\n User { error } => error.span(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/error.rs\",\n \"rank\": 83,\n \"score\": 97428.64880600736\n },\n {\n \"content\": \"impl ScriptVarDefinition {\\n\\n pub fn name_span(&self) -> Span {\\n\\n match self {\\n\\n ScriptVarDefinition::Poll(x) => x.name_span,\\n\\n ScriptVarDefinition::Listen(x) => x.name_span,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn name(&self) -> &VarName {\\n\\n match self {\\n\\n ScriptVarDefinition::Poll(x) => &x.name,\\n\\n ScriptVarDefinition::Listen(x) => &x.name,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn command_span(&self) -> Option<Span> {\\n\\n match self {\\n\\n ScriptVarDefinition::Poll(x) => match x.command {\\n\\n VarSource::Shell(span, ..) => Some(span),\\n\\n VarSource::Function(_) => None,\\n\",\n \"file_path\": \"crates/yuck/src/config/script_var_definition.rs\",\n \"rank\": 84,\n \"score\": 97047.08580768581\n },\n {\n \"content\": \" pub command_span: Span,\\n\\n pub name_span: Span,\\n\\n}\\n\\nimpl FromAstElementContent for ListenScriptVar {\\n\\n const ELEMENT_NAME: &'static str = \\\"deflisten\\\";\\n\\n\\n\\n fn from_tail<I: Iterator<Item = Ast>>(span: Span, mut iter: AstIterator<I>) -> AstResult<Self> {\\n\\n let result: AstResult<_> = try {\\n\\n let (name_span, name) = iter.expect_symbol()?;\\n\\n let mut attrs = iter.expect_key_values()?;\\n\\n let initial_value = attrs.primitive_optional(\\\"initial\\\")?.unwrap_or_else(|| DynVal::from_string(String::new()));\\n\\n let (command_span, script) = iter.expect_literal()?;\\n\\n iter.expect_done()?;\\n\\n Self { name_span, name: VarName(name), command: script.to_string(), initial_value, command_span }\\n\\n };\\n\\n result.note(r#\\\"Expected format: `(deflisten name :initial \\\"0\\\" \\\"tail -f /tmp/example\\\")`\\\"#)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/yuck/src/config/script_var_definition.rs\",\n \"rank\": 85,\n \"score\": 97045.3551343154\n },\n {\n \"content\": \" pub initial_value: Option<DynVal>,\\n\\n pub interval: std::time::Duration,\\n\\n pub name_span: Span,\\n\\n}\\n\\n\\n\\nimpl FromAstElementContent for PollScriptVar {\\n\\n const ELEMENT_NAME: &'static str = \\\"defpoll\\\";\\n\\n\\n\\n fn from_tail<I: Iterator<Item = Ast>>(span: Span, mut iter: AstIterator<I>) -> AstResult<Self> {\\n\\n let result: AstResult<_> = try {\\n\\n let (name_span, name) = iter.expect_symbol()?;\\n\\n let mut attrs = iter.expect_key_values()?;\\n\\n let initial_value = Some(attrs.primitive_optional(\\\"initial\\\")?.unwrap_or_else(|| DynVal::from_string(String::new())));\\n\\n let interval = attrs.primitive_required::<DynVal, _>(\\\"interval\\\")?.as_duration()?;\\n\\n let (script_span, script) = iter.expect_literal()?;\\n\\n\\n\\n let run_while_expr =\\n\\n attrs.ast_optional::<SimplExpr>(\\\"run-while\\\")?.unwrap_or_else(|| SimplExpr::Literal(DynVal::from(true)));\\n\\n let run_while_var_refs = run_while_expr.collect_var_refs();\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/config/script_var_definition.rs\",\n \"rank\": 86,\n \"score\": 97045.2687508134\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\n\\n\\nuse simplexpr::{dynval::DynVal, SimplExpr};\\n\\n\\n\\nuse crate::{\\n\\n error::{AstError, AstResult, AstResultExt},\\n\\n parser::{\\n\\n ast::Ast,\\n\\n ast_iterator::AstIterator,\\n\\n from_ast::{FromAst, FromAstElementContent},\\n\\n },\\n\\n};\\n\\nuse eww_shared_util::{AttrName, Span, Spanned, VarName};\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\\n\\npub enum ScriptVarDefinition {\\n\\n Poll(PollScriptVar),\\n\\n Listen(ListenScriptVar),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/yuck/src/config/script_var_definition.rs\",\n \"rank\": 87,\n \"score\": 97043.87198687906\n },\n {\n \"content\": \" iter.expect_done()?;\\n\\n Self {\\n\\n name_span,\\n\\n name: VarName(name),\\n\\n run_while_expr,\\n\\n run_while_var_refs,\\n\\n command: VarSource::Shell(script_span, script.to_string()),\\n\\n initial_value,\\n\\n interval,\\n\\n }\\n\\n };\\n\\n result.note(r#\\\"Expected format: `(defpoll name :interval \\\"10s\\\" \\\"echo 'a shell script'\\\")`\\\"#)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\\n\\npub struct ListenScriptVar {\\n\\n pub name: VarName,\\n\\n pub command: String,\\n\\n pub initial_value: DynVal,\\n\",\n \"file_path\": \"crates/yuck/src/config/script_var_definition.rs\",\n \"rank\": 88,\n \"score\": 97043.11308497276\n },\n {\n \"content\": \" },\\n\\n ScriptVarDefinition::Listen(x) => Some(x.command_span),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\\n\\npub enum VarSource {\\n\\n // TODO allow for other executors? (python, etc)\\n\\n Shell(Span, String),\\n\\n #[serde(skip)]\\n\\n Function(fn() -> Result<DynVal, Box<dyn std::error::Error + Sync + Send + 'static>>),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize)]\\n\\npub struct PollScriptVar {\\n\\n pub name: VarName,\\n\\n pub run_while_expr: SimplExpr,\\n\\n pub run_while_var_refs: Vec<VarName>,\\n\\n pub command: VarSource,\\n\",\n \"file_path\": \"crates/yuck/src/config/script_var_definition.rs\",\n \"rank\": 89,\n \"score\": 97038.81732789808\n },\n {\n \"content\": \"#[derive(StructOpt, Debug, Serialize, Deserialize, PartialEq)]\\n\\nstruct RawOpt {\\n\\n /// Write out debug logs. (To read the logs, run `eww logs`).\\n\\n #[structopt(long = \\\"debug\\\", global = true)]\\n\\n log_debug: bool,\\n\\n\\n\\n /// override path to configuration directory (directory that contains eww.yuck and eww.scss)\\n\\n #[structopt(short, long, global = true)]\\n\\n config: Option<std::path::PathBuf>,\\n\\n\\n\\n /// Watch the log output after executing the command\\n\\n #[structopt(long = \\\"logs\\\", global = true)]\\n\\n show_logs: bool,\\n\\n\\n\\n /// Restart the daemon completely before running the command\\n\\n #[structopt(long = \\\"restart\\\", global = true)]\\n\\n restart: bool,\\n\\n\\n\\n #[structopt(subcommand)]\\n\\n action: Action,\\n\\n}\\n\",\n \"file_path\": \"crates/eww/src/opts.rs\",\n \"rank\": 90,\n \"score\": 95746.34031813747\n },\n {\n \"content\": \"fn handle_server_command(paths: &EwwPaths, action: &ActionWithServer, connect_attempts: usize) -> Result<()> {\\n\\n log::debug!(\\\"Trying to find server process at socket {}\\\", paths.get_ipc_socket_file().display());\\n\\n let mut stream = attempt_connect(&paths.get_ipc_socket_file(), connect_attempts).context(\\\"Failed to connect to daemon\\\")?;\\n\\n log::debug!(\\\"Connected to Eww server ({}).\\\", &paths.get_ipc_socket_file().display());\\n\\n let response = client::do_server_call(&mut stream, action).context(\\\"Error while forwarding command to server\\\")?;\\n\\n if let Some(response) = response {\\n\\n println!(\\\"{}\\\", response);\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/main.rs\",\n \"rank\": 91,\n \"score\": 95411.03990981233\n },\n {\n \"content\": \"/// Joins two paths while keeping it somewhat pretty.\\n\\n/// If the second path is absolute, this will just return the second path.\\n\\n/// If it is relative, it will return the second path joined onto the first path, removing any `./` if present.\\n\\n/// TODO this is not yet perfect, as it will still leave ../ and multiple ./ etc,... check for a Path::simplify or something.\\n\\npub fn join_path_pretty<P: AsRef<std::path::Path>, P2: AsRef<std::path::Path>>(a: P, b: P2) -> std::path::PathBuf {\\n\\n let a = a.as_ref();\\n\\n let b = b.as_ref();\\n\\n if b.is_absolute() {\\n\\n b.to_path_buf()\\n\\n } else {\\n\\n a.parent().unwrap().join(b.strip_prefix(\\\"./\\\").unwrap_or(b))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/util.rs\",\n \"rank\": 92,\n \"score\": 92731.83482137744\n },\n {\n \"content\": \"fn main() {\\n\\n lalrpop::Configuration::new().log_verbose().process_current_dir().unwrap();\\n\\n}\\n\",\n \"file_path\": \"crates/simplexpr/build.rs\",\n \"rank\": 93,\n \"score\": 92200.88585098267\n },\n {\n \"content\": \"fn main() {\\n\\n lalrpop::process_root().unwrap();\\n\\n}\\n\",\n \"file_path\": \"crates/yuck/build.rs\",\n \"rank\": 94,\n \"score\": 92200.88585098267\n },\n {\n \"content\": \"pub trait Rectangular {\\n\\n fn get_rect(&self) -> Rect;\\n\\n}\\n\\n\\n\\n#[derive(Debug, Copy, Clone, Eq, PartialEq, Display)]\\n\\n#[display(fmt = \\\".x*.y:.width*.height\\\")]\\n\\npub struct Rect {\\n\\n pub x: i32,\\n\\n pub y: i32,\\n\\n pub width: i32,\\n\\n pub height: i32,\\n\\n}\\n\\n\\n\\nimpl Rect {\\n\\n pub fn of(x: i32, y: i32, width: i32, height: i32) -> Self {\\n\\n Rect { x, y, width, height }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Rectangular for Rect {\\n\",\n \"file_path\": \"crates/eww/src/geometry.rs\",\n \"rank\": 95,\n \"score\": 90560.79557560122\n },\n {\n \"content\": \"fn main() {\\n\\n let eww_binary_name = std::env::args().next().unwrap();\\n\\n let opts: opts::Opt = opts::Opt::from_env();\\n\\n\\n\\n let log_level_filter = if opts.log_debug { log::LevelFilter::Debug } else { log::LevelFilter::Info };\\n\\n if std::env::var(\\\"RUST_LOG\\\").is_ok() {\\n\\n pretty_env_logger::init_timed();\\n\\n } else {\\n\\n pretty_env_logger::formatted_timed_builder().filter(Some(\\\"eww\\\"), log_level_filter).init();\\n\\n }\\n\\n\\n\\n let result: Result<()> = try {\\n\\n let paths = opts\\n\\n .config_path\\n\\n .map(EwwPaths::from_config_dir)\\n\\n .unwrap_or_else(EwwPaths::default)\\n\\n .context(\\\"Failed to initialize eww paths\\\")?;\\n\\n\\n\\n let would_show_logs = match opts.action {\\n\\n opts::Action::ClientOnly(action) => {\\n\",\n \"file_path\": \"crates/eww/src/main.rs\",\n \"rank\": 96,\n \"score\": 90484.35990137282\n },\n {\n \"content\": \"pub trait IterAverage {\\n\\n fn avg(self) -> f32;\\n\\n}\\n\\n\\n\\nimpl<I: Iterator<Item = f32>> IterAverage for I {\\n\\n fn avg(self) -> f32 {\\n\\n let mut total = 0f32;\\n\\n let mut cnt = 0f32;\\n\\n for value in self {\\n\\n total += value;\\n\\n cnt += 1f32;\\n\\n }\\n\\n total / cnt\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/eww/src/util.rs\",\n \"rank\": 97,\n \"score\": 89000.13891776351\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n test_parser!(\\n\\n \\\"1\\\",\\n\\n \\\"(12)\\\",\\n\\n \\\"1.2\\\",\\n\\n \\\"-1.2\\\",\\n\\n \\\"(1 2)\\\",\\n\\n \\\"(1 :foo 1)\\\",\\n\\n \\\"(:foo 1)\\\",\\n\\n \\\"(:foo->: 1)\\\",\\n\\n \\\"(foo 1)\\\",\\n\\n \\\"(lol😄 1)\\\",\\n\\n r#\\\"(test \\\"hi\\\")\\\"#,\\n\\n r#\\\"(test \\\"h\\\\\\\"i\\\")\\\"#,\\n\\n r#\\\"(test \\\" hi \\\")\\\"#,\\n\\n \\\"(+ (1 2 (* 2 5)))\\\",\\n\\n r#\\\"foo ; test\\\"#,\\n\\n r#\\\"(f arg ; test\\n\\n arg2)\\\"#,\\n\\n \\\"\\\\\\\"h\\\\\\\\\\\\\\\"i\\\\\\\"\\\"\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"crates/yuck/src/parser/mod.rs\",\n \"rank\": 98,\n \"score\": 88856.4308707322\n },\n {\n \"content\": \" #[debug_stub = \\\"ScriptVarHandler(...)\\\"]\\n\\n pub script_var_handler: ScriptVarHandlerHandle,\\n\\n\\n\\n pub paths: EwwPaths,\\n\\n}\\n\\n\\n\\nimpl App {\\n\\n /// Handle a DaemonCommand event.\\n\\n pub fn handle_command(&mut self, event: DaemonCommand) {\\n\\n log::debug!(\\\"Handling event: {:?}\\\", &event);\\n\\n let result: Result<_> = try {\\n\\n match event {\\n\\n DaemonCommand::NoOp => {}\\n\\n DaemonCommand::UpdateVars(mappings) => {\\n\\n for (var_name, new_value) in mappings {\\n\\n self.update_state(var_name, new_value);\\n\\n }\\n\\n }\\n\\n DaemonCommand::ReloadConfigAndCss(sender) => {\\n\\n let mut errors = Vec::new();\\n\",\n \"file_path\": \"crates/eww/src/app.rs\",\n \"rank\": 99,\n \"score\": 31.881700978447196\n }\n]","isConversational":false}}},{"rowIdx":1988,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/engine/mod.rs"},"repo_name":{"kind":"string","value":"mersinvald/xsecurelock-saver-rs"},"commit":{"kind":"string","value":"e4c064918271a165657e52c4a22d20eb383e9e6a"},"file_code":{"kind":"string","value":"\n\nuse std::sync::Arc;\n\nuse rayon::ThreadPoolBuilder;\nuse sfml::graphics::{\n Color,\n RenderTarget,\n RenderWindow,\n View as SfView,\n};\nuse sfml::system::{Clock, SfBox, Time, Vector2f};\nuse specs::{Component, System};\nuse shred::Resource;\n\nuse physics::{\n self,\n resources::{PhysicsDeltaTime, PhysicsElapsed},\n systems::{ClearForceAccumulators, SetupNextPhysicsPosition},\n};\nuse scene_management::{\n self,\n resources::{SceneChange, SceneLoader},\n SceneChangeHandler,\n SceneChangeHandlerBuilder,\n systems::DeleteSystem,\n};\n\nuse self::{\n resources::{\n draw::{\n CurrentDrawLayer,\n DrawLayers,\n View,\n },\n time::{\n DeltaTime,\n Elapsed,\n },\n },\n systems::{\n draw::{\n DrawLayersUpdater,\n SyncDrawShapesSystem,\n DrawDrawShapesSystem,\n SfShape,\n },\n specialized::{\n SpecializedSystem,\n SpecializedSystemObject,\n },\n },\n};\n\npub mod components;\npub mod resources;\npub mod systems;\n\npub struct EngineBuilder<'a, 'b> {\n world: ::specs::World,\n update_dispatcher: ::specs::DispatcherBuilder<'a, 'b>,\n scene_change_handler: SceneChangeHandlerBuilder<'a, 'b>,\n physics_update_dispatcher: ::specs::DispatcherBuilder<'a, 'b>,\n max_physics_updates: usize\n}\n\nimpl<'a, 'b> EngineBuilder<'a, 'b> {\n pub fn new() -> Self {\n let thread_pool = Arc::new(ThreadPoolBuilder::new().build().unwrap());\n Self {\n world: {\n let mut world = ::specs::World::new();\n physics::register(&mut world);\n scene_management::register(&mut world);\n components::register_all(&mut world);\n resources::add_default_resources(&mut world);\n world\n },\n update_dispatcher: ::specs::DispatcherBuilder::new()\n .with_pool(Arc::clone(&thread_pool)),\n scene_change_handler: SceneChangeHandlerBuilder::new()\n .with_threadpool(Arc::clone(&thread_pool)),\n physics_update_dispatcher: ::specs::DispatcherBuilder::new()\n .with_pool(thread_pool)\n .with(SetupNextPhysicsPosition, \"\", &[])\n .with(ClearForceAccumulators, \"\", &[])\n .with_barrier(),\n max_physics_updates: 5,\n }\n }\n\n \n \n pub fn with_update_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self \n where S: for<'c> System<'c> + Send + 'a\n {\n self.add_update_sys(sys, name, dep);\n self\n }\n\n \n \n pub fn add_update_sys<S>(&mut self, sys: S, name: &str, dep: &[&str]) \n where S: for<'c> System<'c> + Send + 'a\n {\n self.update_dispatcher.add(sys, name, dep);\n }\n\n \n pub fn with_update_barrier(mut self) -> Self { self.add_update_barrier(); self }\n\n \n pub fn add_update_barrier(&mut self) { self.update_dispatcher.add_barrier(); }\n\n \n \n \n \n pub fn with_scene_change_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self \n where S: for<'c> System<'c> + Send + 'a\n {\n self.add_scene_change_sys(sys, name, dep);\n self\n }\n\n \n \n \n \n pub fn add_scene_change_sys<S>(&mut self, sys: S, name: &str, dep: &[&str]) \n where S: for<'c> System<'c> + Send + 'a\n {\n self.scene_change_handler.add_pre_load_sys(sys, name, dep);\n }\n\n \n pub fn with_scene_change_barrier(mut self) -> Self { self.add_scene_change_barrier(); self }\n\n \n pub fn add_scene_change_barrier(&mut self) {\n self.scene_change_handler.add_pre_load_barrier();\n }\n\n \n \n \n pub fn with_physics_update_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self\n where S: for<'c> System<'c> + Send + 'a\n {\n self.add_physics_update_sys(sys, name, dep);\n self\n }\n\n \n \n \n pub fn add_physics_update_sys<S>(&mut self, sys: S, name: &str, dep: &[&str]) \n where S: for<'c> System<'c> + Send + 'a\n {\n self.physics_update_dispatcher.add(sys, name, dep);\n }\n\n \n pub fn with_physics_update_barrier(mut self) -> Self {\n self.add_physics_update_barrier();\n self\n }\n\n \n pub fn add_physics_update_barrier(&mut self) { self.physics_update_dispatcher.add_barrier(); }\n\n \n pub fn with_component<C: Component>(mut self) -> Self\n where <C as Component>::Storage: Default \n {\n self.add_component::<C>();\n self\n }\n\n \n pub fn add_component<C: Component>(&mut self) where <C as Component>::Storage: Default {\n self.world.register::<C>();\n }\n\n \n pub fn with_resource<T: Resource>(mut self, res: T) -> Self { self.add_resource(res); self }\n\n \n pub fn add_resource<T: Resource>(&mut self, res: T) { self.world.add_resource(res); }\n\n \n pub fn with_initial_sceneloader<T>(mut self, loader: T) -> Self \n where T: for<'l> SceneLoader<'l> + Send + Sync + 'static\n {\n self.set_initial_sceneloader(loader);\n self\n }\n\n \n pub fn set_initial_sceneloader<T>(&mut self, loader: T) \n where T: for<'l> SceneLoader<'l> + Send + Sync + 'static\n {\n self.world.write_resource::<SceneChange>().change_scene(loader);\n }\n\n \n pub fn build<'tex>(self) -> Engine<'a, 'b, 'tex> {\n let mut engine = Engine {\n world: self.world,\n update_dispatcher: self.update_dispatcher\n .with_barrier()\n .with(DrawLayersUpdater::default(), \"\", &[])\n .with(DeleteSystem, \"\", &[])\n .build(),\n scene_change_handler: self.scene_change_handler.build(),\n physics_update_dispatcher: self.physics_update_dispatcher\n .with_barrier()\n .with(DeleteSystem, \"\", &[])\n .build(),\n\n window: super::open_window(),\n view: SfView::new(Vector2f::new(0., 0.), Vector2f::new(1., 1.)),\n\n clock: Clock::start(),\n\n max_physics_updates: self.max_physics_updates,\n\n draw_shapes: Vec::new(),\n sync_draw_shapes: Default::default(),\n draw_draw_shapes: Default::default(),\n };\n\n {\n let mut view = engine.world.write_resource::<View>();\n let win_sz = engine.window.size();\n let ratio = win_sz.x as f32 / win_sz.y as f32;\n view.size.y = 2000.;\n view.size.x = ratio * view.size.y;\n view.copy_to(&mut engine.view);\n }\n\n engine.update_dispatcher.setup(&mut engine.world.res);\n engine.scene_change_handler.setup(&mut engine.world);\n engine.physics_update_dispatcher.setup(&mut engine.world.res);\n\n engine.sync_draw_shapes.setup_special(&mut engine.draw_shapes, &mut engine.world.res);\n engine.draw_draw_shapes.setup_special(\n (&mut engine.window, &mut engine.draw_shapes), &mut engine.world.res);\n\n engine\n }\n}\n\npub struct Engine<'a, 'b, 'tex> {\n world: ::specs::World,\n update_dispatcher: ::specs::Dispatcher<'a, 'b>,\n scene_change_handler: SceneChangeHandler<'a, 'b>,\n physics_update_dispatcher: ::specs::Dispatcher<'a, 'b>,\n\n window: RenderWindow,\n view: SfBox<SfView>,\n\n clock: Clock,\n\n max_physics_updates: usize,\n\n draw_shapes: Vec<Option<SfShape<'tex>>>,\n sync_draw_shapes: SyncDrawShapesSystem,\n draw_draw_shapes: DrawDrawShapesSystem,\n}\n\nimpl<'a, 'b, 'tex> Engine<'a, 'b, 'tex> {\n \n pub fn create_entity(&mut self) -> ::specs::world::EntityBuilder {\n self.world.create_entity()\n }\n\n \n pub fn run(mut self) {\n sigint::init();\n\n self.clock.restart();\n {\n let start = self.clock.elapsed_time();\n let mut physt = self.world.write_resource::<PhysicsElapsed>();\n physt.current = start;\n physt.previous = start - self.world.read_resource::<PhysicsDeltaTime>().0;\n let mut dt = self.world.write_resource::<DeltaTime>();\n dt.0 = Time::milliseconds(5);\n let mut t = self.world.write_resource::<Elapsed>();\n t.current = start;\n t.previous = start - dt.0;\n }\n while !sigint::received_sigint() {\n let now = self.clock.elapsed_time();\n self.maybe_physics_update(now);\n self.update(now);\n self.draw();\n }\n }\n\n \n fn maybe_physics_update(&mut self, now: Time) {\n for _ in 0..self.max_physics_updates {\n {\n let mut physt = self.world.write_resource::<PhysicsElapsed>();\n if physt.current >= now {\n return;\n }\n let physdt = self.world.read_resource::<PhysicsDeltaTime>();\n physt.previous = physt.current;\n physt.current += physdt.0;\n }\n self.physics_update_dispatcher.dispatch(&self.world.res);\n self.world.maintain();\n\n self.scene_change_handler.handle_scene_change(&mut self.world);\n }\n \n \n let mut phys = self.world.write_resource::<PhysicsElapsed>();\n let dphys = self.world.read_resource::<PhysicsDeltaTime>();\n while phys.current < now {\n phys.previous = phys.current;\n phys.current += dphys.0;\n }\n\n }\n\n \n fn update(&mut self, now: Time) {\n {\n let mut elapsed = self.world.write_resource::<Elapsed>();\n elapsed.previous = elapsed.current;\n elapsed.current = now;\n let mut delta = self.world.write_resource::<DeltaTime>();\n delta.0 = elapsed.current - elapsed.previous;\n }\n self.update_dispatcher.dispatch(&self.world.res);\n self.world.maintain();\n\n self.scene_change_handler.handle_scene_change(&mut self.world);\n }\n\n \n fn draw(&mut self) {\n self.sync_draw_shapes.run(&mut self.draw_shapes, &self.world.res);\n\n self.world.write_resource::<View>().copy_to(&mut self.view);\n\n self.window.clear(Color::BLACK);\n self.window.set_view(&self.view);\n for layer in 0..=DrawLayers::NUM_LAYERS {\n self.world.write_resource::<CurrentDrawLayer>().set_layer(layer);\n self.draw_draw_shapes.run((&mut self.window, &mut self.draw_shapes), &self.world.res);\n }\n self.window.display();\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::sync::Arc;\n\nuse rayon::ThreadPoolBuilder;\nuse sfml::graphics::{\n Color,\n RenderTarget,\n RenderWindow,\n View as SfView,\n};\nuse sfml::system::{Clock, SfBox, Time, Vector2f};\nuse specs::{Component, System};\nuse shred::Resource;\n\nuse physics::{\n self,\n resources::{PhysicsDeltaTime, PhysicsElapsed},\n systems::{ClearForceAccumulators, SetupNextPhysicsPosition},\n};\nuse scene_management::{\n self,\n resources::{SceneChange, SceneLoader},\n SceneChangeHandler,\n SceneChangeHandlerBuilder,\n systems::DeleteSystem,\n};\n\nuse self::{\n resources::{\n draw::{\n CurrentDrawLayer,\n DrawLayers,\n View,\n },\n time::{\n DeltaTime,\n Elapsed,\n },\n },\n systems::{\n draw::{\n DrawLayersUpdater,\n SyncDrawShapesSystem,\n DrawDrawShapesSystem,\n SfShape,\n },\n specialized::{\n SpecializedSystem,\n SpecializedSystemObject,\n },\n },\n};\n\npub mod components;\npub mod resources;\npub mod systems;\n\npub struct EngineBuilder<'a, 'b> {\n world: ::specs::World,\n update_dispatcher: ::specs::DispatcherBuilder<'a, 'b>,\n scene_change_handler: SceneChangeHandlerBuilder<'a, 'b>,\n physics_update_dispatcher: ::specs::DispatcherBuilder<'a, 'b>,\n max_physics_updates: usize\n}\n\nimpl<'a, 'b> EngineBuilder<'a, 'b> {\n "},"suffix":{"kind":"string","value":"\n\n \n \n pub fn with_update_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self \n where S: for<'c> System<'c> + Send + 'a\n {\n self.add_update_sys(sys, name, dep);\n self\n }\n\n \n \n pub fn add_update_sys<S>(&mut self, sys: S, name: &str, dep: &[&str]) \n where S: for<'c> System<'c> + Send + 'a\n {\n self.update_dispatcher.add(sys, name, dep);\n }\n\n \n pub fn with_update_barrier(mut self) -> Self { self.add_update_barrier(); self }\n\n \n pub fn add_update_barrier(&mut self) { self.update_dispatcher.add_barrier(); }\n\n \n \n \n \n pub fn with_scene_change_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self \n where S: for<'c> System<'c> + Send + 'a\n {\n self.add_scene_change_sys(sys, name, dep);\n self\n }\n\n \n \n \n \n pub fn add_scene_change_sys<S>(&mut self, sys: S, name: &str, dep: &[&str]) \n where S: for<'c> System<'c> + Send + 'a\n {\n self.scene_change_handler.add_pre_load_sys(sys, name, dep);\n }\n\n \n pub fn with_scene_change_barrier(mut self) -> Self { self.add_scene_change_barrier(); self }\n\n \n pub fn add_scene_change_barrier(&mut self) {\n self.scene_change_handler.add_pre_load_barrier();\n }\n\n \n \n \n pub fn with_physics_update_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self\n where S: for<'c> System<'c> + Send + 'a\n {\n self.add_physics_update_sys(sys, name, dep);\n self\n }\n\n \n \n \n pub fn add_physics_update_sys<S>(&mut self, sys: S, name: &str, dep: &[&str]) \n where S: for<'c> System<'c> + Send + 'a\n {\n self.physics_update_dispatcher.add(sys, name, dep);\n }\n\n \n pub fn with_physics_update_barrier(mut self) -> Self {\n self.add_physics_update_barrier();\n self\n }\n\n \n pub fn add_physics_update_barrier(&mut self) { self.physics_update_dispatcher.add_barrier(); }\n\n \n pub fn with_component<C: Component>(mut self) -> Self\n where <C as Component>::Storage: Default \n {\n self.add_component::<C>();\n self\n }\n\n \n pub fn add_component<C: Component>(&mut self) where <C as Component>::Storage: Default {\n self.world.register::<C>();\n }\n\n \n pub fn with_resource<T: Resource>(mut self, res: T) -> Self { self.add_resource(res); self }\n\n \n pub fn add_resource<T: Resource>(&mut self, res: T) { self.world.add_resource(res); }\n\n \n pub fn with_initial_sceneloader<T>(mut self, loader: T) -> Self \n where T: for<'l> SceneLoader<'l> + Send + Sync + 'static\n {\n self.set_initial_sceneloader(loader);\n self\n }\n\n \n pub fn set_initial_sceneloader<T>(&mut self, loader: T) \n where T: for<'l> SceneLoader<'l> + Send + Sync + 'static\n {\n self.world.write_resource::<SceneChange>().change_scene(loader);\n }\n\n \n pub fn build<'tex>(self) -> Engine<'a, 'b, 'tex> {\n let mut engine = Engine {\n world: self.world,\n update_dispatcher: self.update_dispatcher\n .with_barrier()\n .with(DrawLayersUpdater::default(), \"\", &[])\n .with(DeleteSystem, \"\", &[])\n .build(),\n scene_change_handler: self.scene_change_handler.build(),\n physics_update_dispatcher: self.physics_update_dispatcher\n .with_barrier()\n .with(DeleteSystem, \"\", &[])\n .build(),\n\n window: super::open_window(),\n view: SfView::new(Vector2f::new(0., 0.), Vector2f::new(1., 1.)),\n\n clock: Clock::start(),\n\n max_physics_updates: self.max_physics_updates,\n\n draw_shapes: Vec::new(),\n sync_draw_shapes: Default::default(),\n draw_draw_shapes: Default::default(),\n };\n\n {\n let mut view = engine.world.write_resource::<View>();\n let win_sz = engine.window.size();\n let ratio = win_sz.x as f32 / win_sz.y as f32;\n view.size.y = 2000.;\n view.size.x = ratio * view.size.y;\n view.copy_to(&mut engine.view);\n }\n\n engine.update_dispatcher.setup(&mut engine.world.res);\n engine.scene_change_handler.setup(&mut engine.world);\n engine.physics_update_dispatcher.setup(&mut engine.world.res);\n\n engine.sync_draw_shapes.setup_special(&mut engine.draw_shapes, &mut engine.world.res);\n engine.draw_draw_shapes.setup_special(\n (&mut engine.window, &mut engine.draw_shapes), &mut engine.world.res);\n\n engine\n }\n}\n\npub struct Engine<'a, 'b, 'tex> {\n world: ::specs::World,\n update_dispatcher: ::specs::Dispatcher<'a, 'b>,\n scene_change_handler: SceneChangeHandler<'a, 'b>,\n physics_update_dispatcher: ::specs::Dispatcher<'a, 'b>,\n\n window: RenderWindow,\n view: SfBox<SfView>,\n\n clock: Clock,\n\n max_physics_updates: usize,\n\n draw_shapes: Vec<Option<SfShape<'tex>>>,\n sync_draw_shapes: SyncDrawShapesSystem,\n draw_draw_shapes: DrawDrawShapesSystem,\n}\n\nimpl<'a, 'b, 'tex> Engine<'a, 'b, 'tex> {\n \n pub fn create_entity(&mut self) -> ::specs::world::EntityBuilder {\n self.world.create_entity()\n }\n\n \n pub fn run(mut self) {\n sigint::init();\n\n self.clock.restart();\n {\n let start = self.clock.elapsed_time();\n let mut physt = self.world.write_resource::<PhysicsElapsed>();\n physt.current = start;\n physt.previous = start - self.world.read_resource::<PhysicsDeltaTime>().0;\n let mut dt = self.world.write_resource::<DeltaTime>();\n dt.0 = Time::milliseconds(5);\n let mut t = self.world.write_resource::<Elapsed>();\n t.current = start;\n t.previous = start - dt.0;\n }\n while !sigint::received_sigint() {\n let now = self.clock.elapsed_time();\n self.maybe_physics_update(now);\n self.update(now);\n self.draw();\n }\n }\n\n \n fn maybe_physics_update(&mut self, now: Time) {\n for _ in 0..self.max_physics_updates {\n {\n let mut physt = self.world.write_resource::<PhysicsElapsed>();\n if physt.current >= now {\n return;\n }\n let physdt = self.world.read_resource::<PhysicsDeltaTime>();\n physt.previous = physt.current;\n physt.current += physdt.0;\n }\n self.physics_update_dispatcher.dispatch(&self.world.res);\n self.world.maintain();\n\n self.scene_change_handler.handle_scene_change(&mut self.world);\n }\n \n \n let mut phys = self.world.write_resource::<PhysicsElapsed>();\n let dphys = self.world.read_resource::<PhysicsDeltaTime>();\n while phys.current < now {\n phys.previous = phys.current;\n phys.current += dphys.0;\n }\n\n }\n\n \n fn update(&mut self, now: Time) {\n {\n let mut elapsed = self.world.write_resource::<Elapsed>();\n elapsed.previous = elapsed.current;\n elapsed.current = now;\n let mut delta = self.world.write_resource::<DeltaTime>();\n delta.0 = elapsed.current - elapsed.previous;\n }\n self.update_dispatcher.dispatch(&self.world.res);\n self.world.maintain();\n\n self.scene_change_handler.handle_scene_change(&mut self.world);\n }\n\n \n fn draw(&mut self) {\n self.sync_draw_shapes.run(&mut self.draw_shapes, &self.world.res);\n\n self.world.write_resource::<View>().copy_to(&mut self.view);\n\n self.window.clear(Color::BLACK);\n self.window.set_view(&self.view);\n for layer in 0..=DrawLayers::NUM_LAYERS {\n self.world.write_resource::<CurrentDrawLayer>().set_layer(layer);\n self.draw_draw_shapes.run((&mut self.window, &mut self.draw_shapes), &self.world.res);\n }\n self.window.display();\n }\n}\n"},"middle":{"kind":"string","value":"pub fn new() -> Self {\n let thread_pool = Arc::new(ThreadPoolBuilder::new().build().unwrap());\n Self {\n world: {\n let mut world = ::specs::World::new();\n physics::register(&mut world);\n scene_management::register(&mut world);\n components::register_all(&mut world);\n resources::add_default_resources(&mut world);\n world\n },\n update_dispatcher: ::specs::DispatcherBuilder::new()\n .with_pool(Arc::clone(&thread_pool)),\n scene_change_handler: SceneChangeHandlerBuilder::new()\n .with_threadpool(Arc::clone(&thread_pool)),\n physics_update_dispatcher: ::specs::DispatcherBuilder::new()\n .with_pool(thread_pool)\n .with(SetupNextPhysicsPosition, \"\", &[])\n .with(ClearForceAccumulators, \"\", &[])\n .with_barrier(),\n max_physics_updates: 5,\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub trait SpecializedSystem<'a, T> {\n\n type SystemData: SystemData<'a>;\n\n\n\n fn run_special(&mut self, specialized: T, data: Self::SystemData);\n\n\n\n fn setup_special(&mut self, _specialized: T, res: &mut Resources) {\n\n Self::SystemData::setup(res);\n\n }\n\n}\n\n\n\npub(crate) trait SpecializedSystemObject<'a, T> {\n\n fn run(&mut self, special_data: T, res: &'a Resources);\n\n\n\n fn setup(&mut self, special_data: T, res: &mut Resources);\n\n}\n\n\n\nimpl<'a, T, S> SpecializedSystemObject<'a, T> for S\n\n where S: SpecializedSystem<'a, T>,\n\n{\n\n fn run(&mut self, special_data: T, res: &'a Resources) {\n","file_path":"src/engine/systems/specialized.rs","rank":0,"score":142337.94887796583},{"content":"/// Wraps a SpecializedSystem as a System, allowing us to pass through extra\n\n/// data. Should only be used once, and only for run, not setup. Becomes \n\n/// invalidated after use. Should only be used by the generic implementation of\n\n/// SpecializedSystemObject.\n\nstruct SpecializedSystemWrapper<'b, T, S> \n\n where T: 'b,\n\n S: 'b\n\n{\n\n system: &'b mut S,\n\n special_data: Option<T>,\n\n}\n\n\n\nimpl<'a, 'b, T, S> System<'a> for SpecializedSystemWrapper<'b, T, S>\n\n where S: SpecializedSystem<'a, T>,\n\n{\n\n type SystemData = S::SystemData;\n\n\n\n fn run(&mut self, data: Self::SystemData) {\n\n self.system.run_special(\n\n self.special_data.take().expect(\"Cannot re-use the wrapper\"),\n\n data,\n\n );\n\n }\n\n\n\n fn setup(&mut self, _res: &mut Resources) {\n\n panic!(\"Don't use the wrapper to set up SpecializedSystems.\");\n\n }\n\n}\n","file_path":"src/engine/systems/specialized.rs","rank":1,"score":141242.08417604736},{"content":"/// Register all components and default resources.\n\npub fn register(world: &mut ::specs::World) {\n\n components::register_all(world);\n\n resources::add_default_resources(world);\n\n}\n","file_path":"physics/src/lib.rs","rank":2,"score":132201.10759405102},{"content":"pub fn register(world: &mut World) {\n\n components::register_all(world);\n\n resources::add_default_resources(world);\n\n}\n\n\n\n/// Builder for scene change handler.\n\npub struct SceneChangeHandlerBuilder<'a, 'b> {\n\n scene_change_dispatcher: DispatcherBuilder<'a, 'b>,\n\n}\n\n\n\nimpl<'a, 'b> SceneChangeHandlerBuilder<'a, 'b> {\n\n pub fn new() -> Self {\n\n SceneChangeHandlerBuilder {\n\n scene_change_dispatcher: DispatcherBuilder::new(),\n\n }\n\n }\n\n\n\n /// Set the threadpool to use when dispatching.\n\n pub fn with_threadpool(mut self, pool: Arc<ThreadPool>) -> Self {\n\n self.set_threadpool(pool);\n","file_path":"scene_management/src/lib.rs","rank":3,"score":104661.70205383058},{"content":"pub trait SceneLoader<'a> {\n\n type SystemData: SystemData<'a>;\n\n\n\n fn load(&mut self, data: Self::SystemData);\n\n}\n\n\n\nimpl<L> SceneLoaderDispatcher for L where L: for<'a> SceneLoader<'a> {\n\n fn dispatch(&mut self, world: &mut World) {\n\n world.exec(|data: L::SystemData| self.load(data));\n\n }\n\n}\n\n\n\n/// Resource used to set a scene change.\n\n#[derive(Default)]\n\npub struct SceneChange(Option<Box<dyn SceneLoaderDispatcher + Send + Sync>>);\n\n\n\nimpl SceneChange {\n\n /// Will cause the scene to change after the current frame. If another scene change is already\n\n /// configured, this will override it.\n\n pub fn change_scene<T>(&mut self, scene_loader: T) \n","file_path":"scene_management/src/resources.rs","rank":4,"score":79402.8224619119},{"content":"/// Storage for models.\n\n// TODO(zstewart): fix sqlite storage with some thread local magic so that non-mutating methods can\n\n// use &self instead of &mut self.\n\npub trait Storage {\n\n /// Add a new root scenario. This scenario is the new root of a family of scenarios.\n\n fn add_root_scenario(&mut self, world: World, score: f64) -> Result<Scenario, Box<dyn Error>>;\n\n\n\n /// Add a new scenario that is the child of the specified scenario\n\n fn add_child_scenario(\n\n &mut self,\n\n world: World,\n\n score: f64,\n\n parent: &Scenario,\n\n ) -> Result<Scenario, Box<dyn Error>>;\n\n\n\n /// Returns the number of scenarios available.\n\n fn num_scenarios(&mut self) -> Result<u64, Box<dyn Error>>;\n\n\n\n /// Gets the nth scenario, in order of score (descending, so lower indexes are higher scoring\n\n /// scenarios). May return None if the index is outside the number of scenarios.\n\n fn get_nth_scenario_by_score(&mut self, index: u64) -> Result<Option<Scenario>, Box<dyn Error>>;\n\n\n\n /// Removes the bottom scoring scenarios, keeping up to number_to_keep top scoring scenarios.\n\n /// Returns the number of scenarios pruned.\n\n fn keep_top_scenarios_by_score(&mut self, number_to_keep: u64) -> Result<u64, Box<dyn Error>>;\n\n}\n","file_path":"saver_genetic_orbits/src/storage/mod.rs","rank":5,"score":77328.69204357456},{"content":" impl Sub for Time {\n\n type Output = Self;\n\n \n\n fn sub(mut self, rhs: Self) -> Self { self -= rhs; self }\n\n }\n\n \n\n impl SubAssign for Time {\n\n fn sub_assign(&mut self, Time(rhs): Self) { self.0 -= rhs; }\n\n }\n\n}\n\n\n\n#[cfg(feature = \"graphical\")] \n\nmod time_impl {\n\n extern crate sfml;\n\n\n\n pub type Time = sfml::system::Time;\n\n}\n","file_path":"physics/src/time.rs","rank":6,"score":72323.0984655893},{"content":" /// A partial copy fo the SFML time api that doesn't depend on SFML.\n\n #[derive(Copy, Clone, Default, Eq, PartialEq, Ord, PartialOrd)]\n\n pub struct Time(/* microseconds */ i64);\n\n\n\n \n\n impl Time {\n\n const MICROSECONDS_PER_SECOND: f32 = 1000000.;\n\n const MICROSECONDS_PER_MILLISECOND: i64 = 1000;\n\n\n\n pub const ZERO: Time = Time(0);\n\n\n\n pub fn seconds(seconds: f32) -> Self {\n\n Time((seconds * Self::MICROSECONDS_PER_SECOND) as i64)\n\n }\n\n \n\n pub fn milliseconds(ms: i32) -> Self {\n\n Time(ms as i64 * Self::MICROSECONDS_PER_MILLISECOND)\n\n }\n\n \n\n pub fn as_seconds(self) -> f32 {\n","file_path":"physics/src/time.rs","rank":7,"score":72318.02095481478},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\npub use self::time_impl::Time;\n\n\n\n#[cfg(not(feature = \"graphical\"))] \n\nmod time_impl {\n\n use std::ops::{Add, AddAssign, Sub, SubAssign, Neg};\n\n \n","file_path":"physics/src/time.rs","rank":8,"score":72316.84382445154},{"content":" self.0 as f32 / Self::MICROSECONDS_PER_SECOND\n\n }\n\n }\n\n \n\n impl Add for Time {\n\n type Output = Self;\n\n \n\n fn add(mut self, rhs: Self) -> Self { self += rhs; self }\n\n }\n\n \n\n impl AddAssign for Time {\n\n fn add_assign(&mut self, Time(rhs): Self) { self.0 += rhs }\n\n }\n\n \n\n impl Neg for Time {\n\n type Output = Self;\n\n \n\n fn neg(self) -> Self { Time(-self.0) }\n\n }\n\n \n","file_path":"physics/src/time.rs","rank":9,"score":72314.71691604701},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse crate::time::Time;\n\n\n\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\n\n world.add_resource(PhysicsDeltaTime::default());\n\n world.add_resource(PhysicsElapsed::default());\n\n}\n","file_path":"physics/src/resources.rs","rank":10,"score":72208.0609887217},{"content":"\n\n/// The amount of time elapsed in the physics simulation.\n\npub struct PhysicsDeltaTime(pub Time);\n\n\n\nimpl Default for PhysicsDeltaTime {\n\n fn default() -> Self { PhysicsDeltaTime(Time::milliseconds(16)) }\n\n}\n\n\n\n/// The total elapsed time in the physics simulation.\n\npub struct PhysicsElapsed {\n\n pub previous: Time,\n\n pub current: Time,\n\n}\n\n\n\nimpl Default for PhysicsElapsed {\n\n fn default() -> Self { \n\n PhysicsElapsed {\n\n current: Time::ZERO,\n\n previous: Time::ZERO,\n\n }\n\n }\n\n}\n","file_path":"physics/src/resources.rs","rank":11,"score":72206.34476560763},{"content":"use crate::{\n\n resources::PhysicsElapsed,\n\n time::Time,\n\n};\n\n\n\npub type Vector = ::nalgebra::Vector2<f32>;\n\npub type Isometry = ::nalgebra::Isometry2<f32>;\n\npub type Translation = ::nalgebra::Translation2<f32>;\n\npub type Rotation = ::nalgebra::UnitComplex<f32>;\n\n\n\npub(crate) fn register_all(world: &mut World) {\n\n world.register::<Position>();\n\n world.register::<Velocity>();\n\n world.register::<Mass>();\n\n world.register::<ForceAccumulator>();\n\n}\n\n\n\n/// How position interpolation is handled.\n\n#[derive(Copy, Clone, Eq, PartialEq, Debug)]\n\npub enum PositionInterpolationMode {\n","file_path":"physics/src/components.rs","rank":12,"score":72069.77138093178},{"content":" pub fn physics_interpolation_factor(elapsed: Time, physics: &PhysicsElapsed) -> f32 {\n\n let since_physics = elapsed - physics.previous;\n\n let physics_step = physics.current - physics.previous;\n\n since_physics.as_seconds() / physics_step.as_seconds()\n\n }\n\n\n\n /// Copy current to previous to setup for the next iteration.\n\n pub(crate) fn step_previous(&mut self) {\n\n self.previous = self.current;\n\n }\n\n}\n\n\n\n/// Velocity of an object, used for Sympletic Euler integration.\n\npub struct Velocity {\n\n pub linear: Vector,\n\n pub angular: Rotation,\n\n}\n\n\n\nimpl Component for Velocity {\n\n type Storage = VecStorage<Self>;\n","file_path":"physics/src/components.rs","rank":13,"score":72069.17127184257},{"content":" /// Position is interpolated.\n\n Interpolated,\n\n /// Positions are not interpolated.\n\n Static,\n\n}\n\n\n\n/// The physics system position. Should usually only be updated during physics update.\n\n#[derive(Debug)]\n\npub struct Position {\n\n mode: PositionInterpolationMode,\n\n current: (Vector, Rotation),\n\n previous: (Vector, Rotation),\n\n}\n\n\n\nimpl Component for Position {\n\n type Storage = VecStorage<Self>;\n\n}\n\n\n\nimpl Position {\n\n /// Creates an interpolated position with the specified starting position and rotation.\n","file_path":"physics/src/components.rs","rank":14,"score":72064.96130206906},{"content":"\n\nimpl Component for Mass {\n\n type Storage = VecStorage<Self>;\n\n}\n\n\n\nimpl Default for Mass {\n\n fn default() -> Self {\n\n Self {\n\n linear: 1.,\n\n angular: 1.,\n\n }\n\n }\n\n}\n\n\n\n/// Accumulates forces applied to an object over the course of a frame.\n\npub struct ForceAccumulator {\n\n /// The linear force applied to an object.\n\n pub linear: Vector,\n\n /// The torque applied to an object.\n\n pub angular: Rotation,\n","file_path":"physics/src/components.rs","rank":15,"score":72061.7686862466},{"content":"}\n\n\n\nimpl Component for ForceAccumulator {\n\n type Storage = VecStorage<Self>;\n\n}\n\n\n\nimpl ForceAccumulator {\n\n pub fn clear(&mut self) {\n\n *self = Default::default();\n\n }\n\n}\n\n\n\nimpl Default for ForceAccumulator {\n\n /// Create an empty force accumulator.\n\n fn default() -> Self {\n\n Self {\n\n linear: Vector::new(0., 0.),\n\n angular: Rotation::from_angle(0.),\n\n }\n\n }\n\n}\n","file_path":"physics/src/components.rs","rank":16,"score":72060.56683022666},{"content":"}\n\n\n\nimpl Velocity {\n\n /// Create a new velocity component.\n\n pub fn new(linear: Vector, angular: f32) -> Self {\n\n Velocity {\n\n linear,\n\n angular: Rotation::from_angle(angular),\n\n }\n\n }\n\n}\n\n\n\n/// The mass of an object.\n\n#[derive(Copy, Clone)]\n\npub struct Mass {\n\n /// Linear inertia of this object.\n\n pub linear: f32,\n\n /// Angular (moment of inertia) of this object.\n\n pub angular: f32,\n\n}\n","file_path":"physics/src/components.rs","rank":17,"score":72060.56542429123},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::{\n\n Component,\n\n VecStorage,\n\n World,\n\n};\n\n\n","file_path":"physics/src/components.rs","rank":18,"score":72058.67313510264},{"content":" pub fn new(pos: Vector, rot: Rotation) -> Self {\n\n Self {\n\n mode: PositionInterpolationMode::Interpolated,\n\n current: (pos, rot),\n\n previous: (pos, rot),\n\n }\n\n }\n\n\n\n /// Creates a position with the specified starting position and rotation, and the given\n\n /// interpolation mode.\n\n pub fn new_with_mode(pos: Vector, rot: Rotation, mode: PositionInterpolationMode) -> Self {\n\n Self {\n\n mode,\n\n current: (pos, rot),\n\n previous: (pos, rot),\n\n }\n\n }\n\n\n\n /// The position of the object.\n\n #[inline]\n","file_path":"physics/src/components.rs","rank":19,"score":72058.0581138923},{"content":" #[inline]\n\n pub fn mode(&self) -> PositionInterpolationMode { self.mode }\n\n\n\n /// Sets the interpolation mode.\n\n #[inline]\n\n pub fn set_mode(&mut self, mode: PositionInterpolationMode) { self.mode = mode; }\n\n\n\n /// Interpolate from the previous position to the current position.\n\n pub fn interpolate(&self, factor: f32) -> (Vector, Rotation) {\n\n match self.mode {\n\n PositionInterpolationMode::Interpolated => {\n\n let pos = self.current.0 * factor + self.previous.0 * (1. - factor);\n\n let rotation = self.previous.1.rotation_to(&self.current.1).powf(factor);\n\n (pos, self.previous.1 * rotation)\n\n },\n\n PositionInterpolationMode::Static => self.current,\n\n }\n\n }\n\n\n\n /// Calculate an interpolation factor from the previous physics timestep to now.\n","file_path":"physics/src/components.rs","rank":20,"score":72056.42025460597},{"content":" pub fn pos(&self) -> Vector { self.current.0 }\n\n\n\n /// Mutable access to the position of the object.\n\n #[inline]\n\n pub fn pos_mut(&mut self) -> &mut Vector { &mut self.current.0 }\n\n\n\n /// Sets the postion of the object.\n\n #[inline]\n\n pub fn set_pos(&mut self, p: Vector) { self.current.0 = p }\n\n\n\n /// Sets the position, clearing the previous position. This allows moving an interpolated\n\n /// position without interpolation for a single frame.\n\n #[inline]\n\n pub fn teleport_pos(&mut self, p: Vector) {\n\n self.current.0 = p;\n\n self.previous.0 = p;\n\n }\n\n\n\n /// The rotation of the object.\n\n #[inline]\n","file_path":"physics/src/components.rs","rank":21,"score":72054.57277173927},{"content":" pub fn rot(&self) -> Rotation { self.current.1 }\n\n\n\n /// Mutable access to the rotation of the object.\n\n #[inline]\n\n pub fn rot_mut(&mut self) -> &mut Rotation { &mut self.current.1 }\n\n\n\n /// Sets the rotation of the object.\n\n #[inline]\n\n pub fn set_rot(&mut self, r: Rotation) { self.current.1 = r; }\n\n\n\n\n\n /// Sets the rotation, clearing the previous rotation. This allows moving an interpolated\n\n /// rotation without interpolation for a single frame.\n\n #[inline]\n\n pub fn teleport_rot(&mut self, r: Rotation) {\n\n self.current.1 = r;\n\n self.previous.1 = r;\n\n }\n\n\n\n /// Gets the interpolation mode.\n","file_path":"physics/src/components.rs","rank":22,"score":72054.55921737239},{"content":" WriteStorage,\n\n};\n\n\n\nuse crate::{\n\n components::{\n\n ForceAccumulator,\n\n Position,\n\n Mass,\n\n Velocity,\n\n },\n\n resources::PhysicsDeltaTime,\n\n};\n\n\n\n/// Copies current positions to previous positions to allow interpolation. Should run before each\n\n/// physics tick.\n\npub struct SetupNextPhysicsPosition;\n\n\n\nimpl<'a> System<'a> for SetupNextPhysicsPosition {\n\n type SystemData = WriteStorage<'a, Position>;\n\n\n","file_path":"physics/src/systems.rs","rank":23,"score":71849.4751597587},{"content":"/// Integrates velocities, adding to the position, multiplied by PhysicsDeltaTime.\n\npub struct SympleticEulerVelocityStep;\n\nimpl<'a> System<'a> for SympleticEulerVelocityStep {\n\n type SystemData = (\n\n Read<'a, PhysicsDeltaTime>,\n\n WriteStorage<'a, Position>,\n\n ReadStorage<'a, Velocity>,\n\n );\n\n\n\n fn run(&mut self, (time, mut positions, velocities): Self::SystemData) {\n\n let dt = time.0.as_seconds();\n\n for (pos, vel) in (&mut positions, &velocities).join() {\n\n *pos.pos_mut() += vel.linear * dt;\n\n *pos.rot_mut() *= vel.angular.powf(dt);\n\n }\n\n }\n\n}\n","file_path":"physics/src/systems.rs","rank":24,"score":71843.28384805149},{"content":" fn run(&mut self, mut positions: Self::SystemData) {\n\n for pos in (&mut positions).join() {\n\n pos.step_previous();\n\n }\n\n }\n\n}\n\n\n\npub struct ClearForceAccumulators;\n\n\n\nimpl<'a> System<'a> for ClearForceAccumulators {\n\n type SystemData = WriteStorage<'a, ForceAccumulator>;\n\n\n\n fn run(&mut self, mut accumulators: Self::SystemData) {\n\n for acc in (&mut accumulators).join() {\n\n acc.clear();\n\n }\n\n }\n\n}\n\n\n\n/// Integrates forces, adding to the velocity, multiplied by PhysicsDeltaTime.\n","file_path":"physics/src/systems.rs","rank":25,"score":71842.79669281571},{"content":"pub struct SympleticEulerForceStep;\n\nimpl<'a> System<'a> for SympleticEulerForceStep {\n\n type SystemData = (\n\n Read<'a, PhysicsDeltaTime>,\n\n Entities<'a>,\n\n WriteStorage<'a, Velocity>,\n\n ReadStorage<'a, Mass>,\n\n ReadStorage<'a, ForceAccumulator>,\n\n );\n\n\n\n fn run(&mut self, (time, entities, mut velocities, masses, forces): Self::SystemData) {\n\n let dt = time.0.as_seconds();\n\n for (vel, force, ent) in (&mut velocities, &forces, &*entities).join() {\n\n let mass = masses.get(ent).cloned().unwrap_or_default();\n\n vel.linear += (force.linear / mass.linear) * dt;\n\n vel.angular *= force.angular.powf(1./mass.angular).powf(dt);\n\n }\n\n }\n\n}\n\n\n","file_path":"physics/src/systems.rs","rank":26,"score":71841.17323877284},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::{\n\n Entities,\n\n Join,\n\n Read,\n\n ReadStorage,\n\n System,\n","file_path":"physics/src/systems.rs","rank":27,"score":71832.98257059058},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse sfml::system::Time;\n\n\n\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\n\n world.add_resource(DeltaTime::default());\n\n world.add_resource(Elapsed::default());\n\n}\n","file_path":"src/engine/resources/time.rs","rank":28,"score":69999.3656921995},{"content":"\n\n/// The time since the last update/fixed update.\n\npub struct DeltaTime(pub Time);\n\n\n\nimpl Default for DeltaTime {\n\n fn default() -> Self { DeltaTime(Time::ZERO) }\n\n}\n\n\n\n/// The total elapsed time since the simulation started.\n\npub struct Elapsed {\n\n pub previous: Time,\n\n pub current: Time,\n\n}\n\n\n\nimpl Default for Elapsed {\n\n fn default() -> Self { \n\n Elapsed {\n\n current: Time::ZERO,\n\n previous: Time::ZERO,\n\n }\n\n }\n\n}\n","file_path":"src/engine/resources/time.rs","rank":29,"score":69994.28485425544},{"content":" use specs::RunNow;\n\n SpecializedSystemWrapper{\n\n system: self,\n\n special_data: Some(special_data),\n\n }.run_now(res);\n\n }\n\n\n\n fn setup(&mut self, special_data: T, res: &mut Resources) {\n\n self.setup_special(special_data, res);\n\n }\n\n}\n\n\n","file_path":"src/engine/systems/specialized.rs","rank":30,"score":69685.47565335683},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::{Resources, System, SystemData};\n\n\n","file_path":"src/engine/systems/specialized.rs","rank":31,"score":69679.43634097007},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse sfml::graphics::View as SfView;\n\nuse sfml::system::Vector2f;\n\nuse specs::BitSet;\n\n\n\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\n\n world.add_resource(DrawLayers::default());\n","file_path":"src/engine/resources/draw.rs","rank":32,"score":69621.65705814528},{"content":" world.add_resource(CurrentDrawLayer::default());\n\n world.add_resource(View::default());\n\n}\n\n\n\n/// Internal tracking of bitsets for which entities are on which layers.\n\n#[derive(Default)]\n\npub(crate) struct DrawLayers {\n\n /// Masks for each layer.\n\n pub(crate) masks: [BitSet; DrawLayers::NUM_LAYERS],\n\n /// Mask of values set in any layer.\n\n pub(crate) any_mask: BitSet,\n\n}\n\n\n\nimpl DrawLayers {\n\n /// Number of total layer masks.\n\n pub(crate) const NUM_LAYERS: usize = 10;\n\n}\n\n\n\n/// Which draw layer to read from for the current draw.\n\n#[derive(Default)]\n","file_path":"src/engine/resources/draw.rs","rank":33,"score":69619.68623023256},{"content":"pub(crate) struct CurrentDrawLayer(usize);\n\n\n\nimpl CurrentDrawLayer {\n\n /// Get the current draw layer. Guaranteed to be <= DrawLayers::NUM_LAYERS.\n\n #[inline]\n\n pub(crate) fn layer(&self) -> usize { self.0 }\n\n\n\n /// Set the current draw layer. Must be <= DrawLayers::NUM_LAYERS.\n\n #[inline]\n\n pub(crate) fn set_layer(&mut self, layer: usize) {\n\n assert!(layer <= DrawLayers::NUM_LAYERS, \"layer out of range\");\n\n self.0 = layer;\n\n }\n\n}\n\n\n\npub struct View {\n\n pub center: Vector2f,\n\n pub size: Vector2f,\n\n pub rotation: f32,\n\n}\n","file_path":"src/engine/resources/draw.rs","rank":34,"score":69618.6651807378},{"content":"\n\nimpl Default for View {\n\n fn default() -> Self { \n\n Self {\n\n center: Vector2f::new(0., 0.),\n\n size: Vector2f::new(1000., 1000.),\n\n rotation: 0.,\n\n }\n\n }\n\n}\n\n\n\nimpl View {\n\n pub(crate) fn copy_to(&self, view: &mut SfView) {\n\n view.set_center(self.center);\n\n view.set_size(self.size);\n\n view.set_rotation(self.rotation);\n\n }\n\n}\n","file_path":"src/engine/resources/draw.rs","rank":35,"score":69615.32246938914},{"content":" Component,\n\n FlaggedStorage,\n\n VecStorage,\n\n World,\n\n};\n\n\n\nuse crate::engine::resources::draw::DrawLayers;\n\n\n\npub(crate) fn register_all(world: &mut World) {\n\n world.register::<DrawLayer>();\n\n world.register::<DrawColor>();\n\n world.register::<DrawShape>();\n\n}\n\n\n\n/// What layer to draw an object on.\n\n#[derive(Debug)]\n\npub struct DrawLayer(u8);\n\n\n\nimpl Component for DrawLayer {\n\n type Storage = FlaggedStorage<Self, VecStorage<Self>>;\n","file_path":"src/engine/components/draw.rs","rank":36,"score":69494.1185458234},{"content":" pub outline_thickness: f32,\n\n}\n\n\n\nimpl Component for DrawColor {\n\n type Storage = FlaggedStorage<Self, VecStorage<Self>>;\n\n}\n\n\n\nimpl DrawColor {\n\n pub(crate) fn copy_to<'a, T>(&self, shape: &mut T) where T: Shape<'a> {\n\n shape.set_fill_color(self.fill_color);\n\n shape.set_outline_color(self.outline_color);\n\n shape.set_outline_thickness(self.outline_thickness);\n\n }\n\n}\n\n\n\n/// A drawable shape.\n\n#[derive(Clone)]\n\npub struct DrawShape {\n\n pub shape_type: ShapeType,\n\n pub origin: Vector2f,\n","file_path":"src/engine/components/draw.rs","rank":37,"score":69487.40276777181},{"content":"}\n\n\n\n/// Properties specific to particular types of shapes.\n\n#[derive(Clone)]\n\npub enum ShapeType {\n\n Rect {\n\n size: Vector2f\n\n },\n\n Circle {\n\n radius: f32,\n\n point_count: u32,\n\n },\n\n Convex(Vec<Vector2f>),\n\n}\n\n\n\nimpl Component for DrawShape {\n\n type Storage = FlaggedStorage<Self, VecStorage<Self>>;\n\n}\n","file_path":"src/engine/components/draw.rs","rank":38,"score":69483.27396148353},{"content":"}\n\n\n\nimpl DrawLayer {\n\n /// Set the layer. Must be less than `NUM_LAYERS`.\n\n #[inline]\n\n pub fn set_layer(&mut self, layer: u8) {\n\n assert!((layer as usize) < DrawLayers::NUM_LAYERS, \"layer out of range\");\n\n self.0 = layer;\n\n }\n\n\n\n /// Get the current draw layer.\n\n #[inline]\n\n pub fn layer(&self) -> u8 { self.0 }\n\n}\n\n\n\n/// Properties for basic shape renderers.\n\n#[derive(Debug)]\n\npub struct DrawColor {\n\n pub fill_color: Color,\n\n pub outline_color: Color,\n","file_path":"src/engine/components/draw.rs","rank":39,"score":69482.32061574666},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse sfml::graphics::{\n\n Color,\n\n Shape,\n\n};\n\nuse sfml::system::Vector2f;\n\nuse specs::{\n","file_path":"src/engine/components/draw.rs","rank":40,"score":69477.69041436646},{"content":" RemovedFlag,\n\n};\n\n\n\nuse physics::{\n\n components::Position,\n\n resources::PhysicsElapsed,\n\n};\n\n\n\nuse crate::engine::{\n\n components::draw::{\n\n DrawColor,\n\n DrawLayer,\n\n DrawShape,\n\n ShapeType,\n\n },\n\n resources::{\n\n draw::{\n\n CurrentDrawLayer,\n\n DrawLayers,\n\n },\n","file_path":"src/engine/systems/draw.rs","rank":41,"score":69275.3526027455},{"content":" fn setup_special(&mut self, _: &'b mut Vec<Option<SfShape<'tex>>>, res: &mut Resources) {\n\n Self::SystemData::setup(res);\n\n let mut shape_storage: WriteStorage<DrawShape> = SystemData::fetch(&res);\n\n self.removed_shape_reader_id = Some(shape_storage.track_removed());\n\n self.modified_shape_reader_id = Some(shape_storage.track_modified());\n\n self.inserted_shape_reader_id = Some(shape_storage.track_inserted());\n\n\n\n let mut color_storage: WriteStorage<DrawColor> = SystemData::fetch(&res);\n\n self.modified_color_reader_id = Some(color_storage.track_modified());\n\n self.inserted_color_reader_id = Some(color_storage.track_inserted());\n\n }\n\n}\n\n\n\n#[derive(Default)]\n\npub(crate) struct DrawDrawShapesSystem;\n\n\n\nimpl<'a, 'b, 'tex> \n\n SpecializedSystem<'a, (&'b mut RenderWindow, &'b mut Vec<Option<SfShape<'tex>>>)> \n\n for DrawDrawShapesSystem\n\n{\n","file_path":"src/engine/systems/draw.rs","rank":42,"score":69271.95546332406},{"content":"impl<'a, 'b, 'tex> SpecializedSystem<'a, &'b mut Vec<Option<SfShape<'tex>>>> \n\n for SyncDrawShapesSystem \n\n{\n\n type SystemData = (\n\n Entities<'a>,\n\n Read<'a, Elapsed>,\n\n Read<'a, PhysicsElapsed>,\n\n ReadStorage<'a, Position>,\n\n ReadStorage<'a, DrawShape>,\n\n ReadStorage<'a, DrawColor>,\n\n );\n\n\n\n fn run_special(\n\n &mut self, \n\n sf_shapes: &'b mut Vec<Option<SfShape<'tex>>>,\n\n (entities, elapsed, physics_elapsed, positions, shapes, colors): Self::SystemData,\n\n ) {\n\n self.dirty.clear();\n\n shapes.populate_removed(\n\n &mut self.removed_shape_reader_id.as_mut().unwrap(), \n","file_path":"src/engine/systems/draw.rs","rank":43,"score":69271.35715225709},{"content":" time::Elapsed,\n\n },\n\n systems::specialized::SpecializedSystem,\n\n};\n\n\n\n/// Updates draw layers.\n\n#[derive(Default)]\n\npub(crate) struct DrawLayersUpdater {\n\n dirty: BitSet,\n\n removed_reader_id: Option<ReaderId<RemovedFlag>>,\n\n modified_reader_id: Option<ReaderId<ModifiedFlag>>,\n\n inserted_reader_id: Option<ReaderId<InsertedFlag>>,\n\n}\n\n\n\nimpl<'a> System<'a> for DrawLayersUpdater {\n\n type SystemData = (\n\n Write<'a, DrawLayers>,\n\n ReadStorage<'a, DrawLayer>,\n\n );\n\n\n","file_path":"src/engine/systems/draw.rs","rank":44,"score":69268.24822028863},{"content":" &mut self.inserted_color_reader_id.as_mut().unwrap(),\n\n &mut self.dirty,\n\n );\n\n colors.populate_modified(\n\n &mut self.modified_color_reader_id.as_mut().unwrap(),\n\n &mut self.dirty,\n\n );\n\n for (_, color, id) in (&shapes, &colors, &self.dirty).join() {\n\n sf_shapes[id as usize].as_mut().unwrap().apply_color(color);\n\n }\n\n\n\n let factor = Position::physics_interpolation_factor(elapsed.current, &physics_elapsed);\n\n for (entity, _, position) in (&*entities, &shapes, &positions).join() {\n\n let (pos, rot) = position.interpolate(factor);\n\n let draw_pos = Vector2f::new(pos.x, -pos.y);\n\n let draw_rot = -rot.angle().to_degrees();\n\n sf_shapes[entity.id() as usize].as_mut().unwrap().apply_position(draw_pos, draw_rot);\n\n }\n\n }\n\n\n","file_path":"src/engine/systems/draw.rs","rank":45,"score":69268.16163721235},{"content":" type SystemData = (\n\n Read<'a, DrawLayers>,\n\n Read<'a, CurrentDrawLayer>,\n\n ReadStorage<'a, DrawShape>,\n\n );\n\n\n\n fn run_special(\n\n &mut self, \n\n (window, sf_shapes): (&'b mut RenderWindow, &'b mut Vec<Option<SfShape>>),\n\n (layer_masks, current_draw_layer, shapes): Self::SystemData,\n\n ) {\n\n if current_draw_layer.layer() < DrawLayers::NUM_LAYERS {\n\n for (_, id) in (&shapes, &layer_masks.masks[current_draw_layer.layer()]).join() {\n\n sf_shapes[id as usize].as_mut().unwrap().draw(window);\n\n }\n\n } else {\n\n for (_, id) in (&shapes, !&layer_masks.any_mask).join() {\n\n sf_shapes[id as usize].as_mut().unwrap().draw(window);\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/engine/systems/draw.rs","rank":46,"score":69266.59936163099},{"content":" RenderTarget,\n\n Transformable,\n\n};\n\nuse sfml::system::Vector2f;\n\nuse specs::{\n\n BitSet,\n\n Entities,\n\n Join,\n\n Read,\n\n ReaderId,\n\n ReadStorage,\n\n Resources,\n\n System,\n\n SystemData,\n\n Write,\n\n WriteStorage,\n\n};\n\nuse specs::storage::{\n\n InsertedFlag,\n\n ModifiedFlag,\n","file_path":"src/engine/systems/draw.rs","rank":47,"score":69265.83943647926},{"content":" }\n\n layer_masks.masks[layer.layer() as usize].add(id);\n\n layer_masks.any_mask.add(id);\n\n }\n\n }\n\n\n\n fn setup(&mut self, res: &mut Resources) {\n\n Self::SystemData::setup(res);\n\n let mut storage: WriteStorage<DrawLayer> = SystemData::fetch(&res);\n\n self.removed_reader_id = Some(storage.track_removed());\n\n self.modified_reader_id = Some(storage.track_modified());\n\n self.inserted_reader_id = Some(storage.track_inserted());\n\n }\n\n}\n\n\n\npub(crate) enum SfShape<'tex> {\n\n Rect(RectangleShape<'tex>),\n\n Circle(CircleShape<'tex>),\n\n Convex(ConvexShape<'tex>),\n\n}\n","file_path":"src/engine/systems/draw.rs","rank":48,"score":69265.74421318514},{"content":" }\n\n }\n\n\n\n fn draw_to<D: Drawable>(drawable: &D, target: &mut RenderWindow) {\n\n target.draw(drawable);\n\n }\n\n}\n\n\n\n/// System to sync all SFML shapes from their corresponding components.\n\n#[derive(Default)]\n\npub(crate) struct SyncDrawShapesSystem {\n\n dirty: BitSet,\n\n removed_shape_reader_id: Option<ReaderId<RemovedFlag>>,\n\n modified_shape_reader_id: Option<ReaderId<ModifiedFlag>>,\n\n inserted_shape_reader_id: Option<ReaderId<InsertedFlag>>,\n\n\n\n inserted_color_reader_id: Option<ReaderId<InsertedFlag>>,\n\n modified_color_reader_id: Option<ReaderId<ModifiedFlag>>,\n\n}\n\n\n","file_path":"src/engine/systems/draw.rs","rank":49,"score":69265.51835583082},{"content":" sf_shapes[id as usize] = Some(SfShape::create_for(shape));\n\n } else {\n\n sf_shapes[id as usize].as_mut().unwrap().update_for(shape);\n\n }\n\n if let Some(color) = colors.get(entity) {\n\n sf_shapes[id as usize].as_mut().unwrap().apply_color(color);\n\n }\n\n }\n\n\n\n self.dirty.clear();\n\n shapes.populate_modified(\n\n &mut self.modified_shape_reader_id.as_mut().unwrap(), \n\n &mut self.dirty,\n\n );\n\n for (shape, id) in (&shapes, &self.dirty).join() {\n\n sf_shapes[id as usize].as_mut().unwrap().update_for(shape);\n\n }\n\n\n\n self.dirty.clear();\n\n colors.populate_inserted(\n","file_path":"src/engine/systems/draw.rs","rank":50,"score":69259.95611098339},{"content":" },\n\n (SfShape::Convex(convex), &ShapeType::Convex(ref points)) => {\n\n convex.set_point_count(points.len() as u32);\n\n for (i, point) in points.iter().cloned().enumerate() {\n\n convex.set_point(i as u32, point);\n\n }\n\n convex.set_origin(shape.origin);\n\n },\n\n (this, _) => *this = SfShape::create_for(shape),\n\n }\n\n }\n\n\n\n /// Copy the given color properties to this shape.\n\n fn apply_color(&mut self, color: &DrawColor) {\n\n match self {\n\n SfShape::Rect(shape) => color.copy_to(shape),\n\n SfShape::Circle(shape) => color.copy_to(shape),\n\n SfShape::Convex(shape) => color.copy_to(shape),\n\n }\n\n }\n","file_path":"src/engine/systems/draw.rs","rank":51,"score":69258.20152098247},{"content":"\n\n /// Sets the position of this drawable.\n\n fn apply_position(&mut self, pos: Vector2f, rot: f32) {\n\n match self {\n\n SfShape::Rect(shape) => SfShape::apply_position_to(shape, pos, rot),\n\n SfShape::Circle(shape) => SfShape::apply_position_to(shape, pos, rot),\n\n SfShape::Convex(shape) => SfShape::apply_position_to(shape, pos, rot),\n\n }\n\n }\n\n\n\n fn apply_position_to<T: Transformable>(trans: &mut T, pos: Vector2f, rot: f32) {\n\n trans.set_position(pos);\n\n trans.set_rotation(rot);\n\n }\n\n\n\n fn draw(&self, target: &mut RenderWindow) {\n\n match self {\n\n SfShape::Rect(shape) => SfShape::draw_to(shape, target),\n\n SfShape::Circle(shape) => SfShape::draw_to(shape, target),\n\n SfShape::Convex(shape) => SfShape::draw_to(shape, target),\n","file_path":"src/engine/systems/draw.rs","rank":52,"score":69257.91641158312},{"content":"\n\nimpl<'tex> SfShape<'tex> {\n\n /// Create an SfShape for a given DrawShape.\n\n fn create_for(shape: &DrawShape) -> Self {\n\n match shape.shape_type {\n\n ShapeType::Rect{size} => SfShape::Rect({\n\n let mut rect = RectangleShape::with_size(size);\n\n rect.set_origin(shape.origin);\n\n rect\n\n }),\n\n ShapeType::Circle{\n\n radius,\n\n point_count,\n\n } => SfShape::Circle({\n\n let mut circ = CircleShape::new(radius, point_count);\n\n circ.set_origin(shape.origin);\n\n circ\n\n }),\n\n ShapeType::Convex(ref points) => SfShape::Convex({\n\n let mut convex = ConvexShape::new(points.len() as u32);\n","file_path":"src/engine/systems/draw.rs","rank":53,"score":69256.39800810591},{"content":" &mut self.dirty,\n\n );\n\n for id in (&self.dirty).join() {\n\n if (id as usize) < sf_shapes.len() {\n\n sf_shapes[id as usize] = None;\n\n }\n\n }\n\n\n\n self.dirty.clear();\n\n shapes.populate_inserted(\n\n &mut self.inserted_shape_reader_id.as_mut().unwrap(), \n\n &mut self.dirty,\n\n );\n\n for (entity, shape, id) in (&*entities, &shapes, &self.dirty).join() {\n\n if (id as usize) >= sf_shapes.len() {\n\n let needed = ((id as usize) - sf_shapes.len()) + 1;\n\n sf_shapes.reserve(needed);\n\n sf_shapes.extend((0..needed).map(|_| None));\n\n }\n\n if sf_shapes[id as usize].is_none() {\n","file_path":"src/engine/systems/draw.rs","rank":54,"score":69255.66771794697},{"content":" fn run(&mut self, (mut layer_masks, layers): Self::SystemData) {\n\n // If a remove flag is set, remove the id from all numbered masks and add it to the \"none\n\n // set\" mask.\n\n self.dirty.clear();\n\n layers.populate_removed(&mut self.removed_reader_id.as_mut().unwrap(), &mut self.dirty);\n\n for id in (&self.dirty).join() {\n\n for mask in &mut layer_masks.masks[..] {\n\n mask.remove(id);\n\n }\n\n layer_masks.any_mask.remove(id);\n\n }\n\n\n\n // If inserted or modified, remove from all masks and add to the current mask.\n\n self.dirty.clear();\n\n layers.populate_inserted(&mut self.inserted_reader_id.as_mut().unwrap(), &mut self.dirty);\n\n layers.populate_modified(&mut self.modified_reader_id.as_mut().unwrap(), &mut self.dirty);\n\n\n\n for (layer, id) in (&layers, &self.dirty).join() {\n\n for mask in &mut layer_masks.masks[..] {\n\n mask.remove(id);\n","file_path":"src/engine/systems/draw.rs","rank":55,"score":69255.01064036551},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse sfml::graphics::{\n\n CircleShape,\n\n ConvexShape,\n\n Drawable,\n\n RectangleShape,\n\n RenderWindow,\n","file_path":"src/engine/systems/draw.rs","rank":56,"score":69254.3863796563},{"content":" for (i, point) in points.iter().cloned().enumerate() {\n\n convex.set_point(i as u32, point);\n\n }\n\n convex.set_origin(shape.origin);\n\n convex\n\n }),\n\n }\n\n }\n\n\n\n /// Update this shape if it's of the same type, or replace it with the correct type.\n\n fn update_for(&mut self, shape: &DrawShape) {\n\n match (self, &shape.shape_type) {\n\n (SfShape::Rect(rect), &ShapeType::Rect{size}) => {\n\n rect.set_size(size);\n\n rect.set_origin(shape.origin);\n\n },\n\n (SfShape::Circle(circ), &ShapeType::Circle{radius, point_count}) => {\n\n circ.set_radius(radius);\n\n circ.set_point_count(point_count);\n\n circ.set_origin(shape.origin);\n","file_path":"src/engine/systems/draw.rs","rank":57,"score":69253.43567759548},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\npub mod draw;\n\npub mod time;\n\n\n\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\n\n time::add_default_resources(world);\n\n draw::add_default_resources(world);\n\n}\n","file_path":"src/engine/resources/mod.rs","rank":58,"score":68112.97121382189},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::World;\n\n\n\npub mod draw;\n\n\n\npub(crate) fn register_all(world: &mut World) {\n\n draw::register_all(world);\n\n}\n","file_path":"src/engine/components/mod.rs","rank":59,"score":67973.03773740162},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\npub mod draw;\n\npub mod specialized;\n","file_path":"src/engine/systems/mod.rs","rank":60,"score":67756.0663076776},{"content":"struct StaticScreensaver {\n\n img: Image,\n\n}\n\n\n\nimpl Screensaver for StaticScreensaver {\n\n fn update(&mut self) {\n\n for Vector2u{x, y} in row_major_iterator(self.img.size()) {\n\n self.img.set_pixel(x, y, Color::rgb(rand::random(), rand::random(), rand::random()));\n\n }\n\n }\n\n\n\n fn draw<T: RenderTarget>(&self, target: &mut T) {\n\n let tex = Texture::from_image(&self.img).unwrap();\n\n let sprite = Sprite::with_texture(&tex);\n\n\n\n target.draw(&sprite);\n\n }\n\n}\n\n\n","file_path":"saver_colorstatic/src/main.rs","rank":61,"score":54053.164445961345},{"content":"/// A screensaver which can be run on an SFML RenderTarget.\n\npub trait Screensaver {\n\n /// Runs one \"tick\" in the screensaver, with the update happening at the specified time.\n\n fn update(&mut self);\n\n\n\n /// Draw the screensaver on the specified target.\n\n fn draw<T>(&self, target: &mut T) where T: RenderTarget;\n\n}\n\n\n","file_path":"src/lib.rs","rank":62,"score":52651.21698585396},{"content":"pub fn init() {\n\n if !INITIALIZED.swap(true, Ordering::AcqRel) {\n\n unsafe { signal(libc::SIGINT, sigint_handler) };\n\n }\n\n}\n","file_path":"sigint/src/lib.rs","rank":63,"score":51450.55959115332},{"content":"/// Struct for serializing u64 in Sql, clamping at bounds.\n\nstruct SqlBoundedU64(u64);\n\n\n\nimpl ToSql for SqlBoundedU64 {\n\n fn to_sql(&self) -> Result<ToSqlOutput, SqlError> {\n\n if self.0 <= i64::max_value() as u64 {\n\n Ok(ToSqlOutput::Owned(SqlValue::Integer(self.0 as i64)))\n\n } else {\n\n Err(SqlError::ToSqlConversionFailure(\n\n format!(\n\n \"Value {} is too large for SQLite, max is {}\", self.0, i64::max_value(),\n\n ).into(),\n\n ))\n\n }\n\n }\n\n}\n\n\n\nimpl FromSql for SqlBoundedU64 {\n\n fn column_result(value: SqlValueRef) -> Result<Self, FromSqlError> {\n\n match value {\n\n SqlValueRef::Integer(value) if value >= 0 => Ok(SqlBoundedU64(value as u64)),\n","file_path":"saver_genetic_orbits/src/storage/sqlite.rs","rank":64,"score":48327.25901622286},{"content":"/// Struct for serializing u64 in Sql, wrapping out of range i64 values.\n\nstruct SqlWrappingU64(u64);\n\n\n\nimpl ToSql for SqlWrappingU64 {\n\n fn to_sql(&self) -> Result<ToSqlOutput, SqlError> {\n\n Ok(ToSqlOutput::Owned(SqlValue::Integer(self.0 as i64)))\n\n }\n\n}\n\n\n\nimpl FromSql for SqlWrappingU64 {\n\n fn column_result(value: SqlValueRef) -> Result<Self, FromSqlError> {\n\n match value {\n\n SqlValueRef::Integer(value) => Ok(SqlWrappingU64(value as u64)),\n\n _ => Err(FromSqlError::InvalidType),\n\n }\n\n }\n\n}\n\n\n","file_path":"saver_genetic_orbits/src/storage/sqlite.rs","rank":65,"score":48327.163239933376},{"content":"pub fn received_sigint() -> bool {\n\n RECEIVED_SIGINT.load(Ordering::Relaxed)\n\n}\n\n\n","file_path":"sigint/src/lib.rs","rank":66,"score":47838.68454814669},{"content":"/// A visitor that receives a node from an expression tree.\n\npub trait Visitor {\n\n /// Visit the given expression subtree, optionally replacing it.\n\n fn visit(&mut self, node: &Expression) -> Option<Expression>;\n\n}\n\n\n\nimpl<F> Visitor for F where F: FnMut(&Expression) -> Option<Expression> {\n\n fn visit(&mut self, node: &Expression) -> Option<Expression> {\n\n self(node)\n\n }\n\n}\n\n\n\nimpl Expression {\n\n /// Perform a postorder traversal of the expression tree, running the specified visitor on\n\n /// every node to transform it.\n\n fn transform_postorder<V: Visitor>(&mut self, visitor: &mut V) {\n\n // Traverse all children first.\n\n match self {\n\n Expression::BinaryOp(lhs, _, rhs) => {\n\n lhs.transform_postorder(visitor);\n\n rhs.transform_postorder(visitor);\n","file_path":"saver_genetic_orbits/src/statustracker/scoring_function/transforms.rs","rank":67,"score":46503.69038874919},{"content":"pub fn run_saver<F, S>(create_saver: F) \n\nwhere F: FnOnce(Vector2u) -> S,\n\n S: Screensaver {\n\n sigint::init();\n\n\n\n let mut window = open_window();\n\n let mut saver = create_saver(window.size());\n\n\n\n while !sigint::received_sigint() {\n\n while let Some(_) = window.poll_event() {}\n\n\n\n saver.update();\n\n\n\n window.clear(Color::GREEN);\n\n saver.draw(&mut window);\n\n window.display();\n\n }\n\n info!(\"Shutting Down\");\n\n}\n\n\n","file_path":"src/lib.rs","rank":68,"score":41867.10038690735},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\npub mod components;\n\npub mod systems;\n\npub mod resources;\n\npub mod time;\n\n\n\n/// Register all components and default resources.\n","file_path":"physics/src/lib.rs","rank":69,"score":35986.426094679555},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::{SystemData, World};\n\n\n\npub(crate) fn add_default_resources(world: &mut World) {\n\n world.add_resource(SceneChange(None));\n\n}\n\n\n\n/// Builds a new scene after a previous one has been cleaned up.\n\npub(crate) trait SceneLoaderDispatcher {\n\n fn dispatch(&mut self, world: &mut World);\n\n}\n\n\n","file_path":"scene_management/src/resources.rs","rank":70,"score":34949.37629784672},{"content":" where T: for<'a> SceneLoader<'a> + Send + Sync + 'static\n\n {\n\n self.0 = Some(Box::new(scene_loader));\n\n }\n\n\n\n /// True if a scene change is scheduled for after the end of the current frame.\n\n pub fn is_scene_change_scheduled(&self) -> bool {\n\n self.0.is_some()\n\n }\n\n\n\n /// Cancels a scene change scheduled for after the end of the current frame.\n\n pub fn cancel_scene_change(&mut self) {\n\n self.0 = None;\n\n }\n\n\n\n /// Retrieves the pending scene changer, clearing it in the process. This is needed because the\n\n /// scene change resource cannot be borrowed when the scene loader is executed.\n\n pub(crate) fn take_scene_changer(&mut self) \n\n -> Option<Box<dyn SceneLoaderDispatcher + Send + Sync>>\n\n {\n\n self.0.take()\n\n }\n\n}\n","file_path":"scene_management/src/resources.rs","rank":71,"score":34940.51124646188},{"content":"\n\n/// A component which marks an object as being part of the current \"Scene\", it will be removed when\n\n/// the scene changes.\n\n#[derive(Default)]\n\npub struct InScene;\n\nimpl Component for InScene { type Storage = NullStorage<Self>; }\n\n\n\n/// A component which marks an object as deleted. Will be cleaned up at the end of the current\n\n/// dispatcher run before the next call to maintain.\n\n/// This is useful because Entities.delete(ent) does not apply until the next call to maintain, but\n\n/// there's no way to query for deleted entities. If systems want to delete entities early and let\n\n/// other systems see that the entities are meant to be deleted before the next call to maintain,\n\n/// they can use this.\n\n#[derive(Default)]\n\npub struct Deleted;\n\nimpl Component for Deleted { type Storage = NullStorage<Self>; }\n","file_path":"scene_management/src/components.rs","rank":72,"score":34817.78577376029},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::{Component, NullStorage, World};\n\n\n\npub(crate) fn register_all(world: &mut World) {\n\n world.register::<InScene>();\n\n world.register::<Deleted>();\n\n}\n","file_path":"scene_management/src/components.rs","rank":73,"score":34813.041379570015},{"content":"\n\nuse crate::components::{InScene, Deleted};\n\n\n\n/// Removes all entities in the current scene.\n\npub(crate) struct ClearCurrentScene;\n\nimpl<'a> System<'a> for ClearCurrentScene {\n\n type SystemData = (\n\n Entities<'a>,\n\n ReadStorage<'a, InScene>,\n\n );\n\n\n\n fn run(&mut self, (entities, in_scene): Self::SystemData) {\n\n for (entity, _) in (&*entities, &in_scene).join() {\n\n entities.delete(entity).unwrap();\n\n }\n\n }\n\n}\n\n\n\n/// Removes all entities that have the Deleted component. Can be added to a world to support\n\n/// deleting by adding the delete component (allowing other systems in the same dispatch run to\n","file_path":"scene_management/src/systems.rs","rank":74,"score":34603.835650432},{"content":"/// determine that those entities are deleted).\n\npub struct DeleteSystem;\n\nimpl<'a> System<'a> for DeleteSystem {\n\n type SystemData = (\n\n Entities<'a>,\n\n ReadStorage<'a, Deleted>,\n\n );\n\n\n\n fn run(&mut self, (entities, deleted): Self::SystemData) {\n\n for (ent, _) in (&*entities, &deleted).join() {\n\n entities.delete(ent).unwrap();\n\n }\n\n }\n\n}\n","file_path":"scene_management/src/systems.rs","rank":75,"score":34596.665956496276},{"content":"// Copyright 2018 Google LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse specs::{\n\n Entities,\n\n Join,\n\n ReadStorage,\n\n System,\n\n};\n","file_path":"scene_management/src/systems.rs","rank":76,"score":34591.761374241374},{"content":"/// Starts automatic background pruning of scenarios. Returns a handle that can be used to shutdown\n\n/// background pruning.\n\npub fn prune_scenarios<S>(interval: Duration, number_to_keep: u64, storage: S) -> ShutdownPrune \n\nwhere S: Storage + Send + 'static\n\n{\n\n let (send, recv) = mpsc::channel();\n\n let handle = thread::spawn(move || {\n\n let mut storage = storage;\n\n loop {\n\n match recv.recv() {\n\n Ok(Action::Tick) => {\n\n info!(\"Pruning scenarios\");\n\n match storage.keep_top_scenarios_by_score(number_to_keep) {\n\n Ok(num_pruned) => info!(\"Pruned {} scenarios\", num_pruned),\n\n Err(err) => error!(\"Falied to prune scenarios: {}\", err),\n\n }\n\n },\n\n Ok(Action::Shutdown) => {\n\n info!(\"Sending final prune and shutting down.\");\n\n match storage.keep_top_scenarios_by_score(number_to_keep) {\n\n Ok(num_pruned) => info!(\"Pruned {} scenarios\", num_pruned),\n\n Err(err) => error!(\"Falied to prune scenarios: {}\", err),\n","file_path":"saver_genetic_orbits/src/pruner.rs","rank":96,"score":33686.847505799386},{"content":"/// Every `interval` send `value` into the given channel. Stops sending only when the channel is\n\n/// closed.\n\npub fn interval<T: Clone + Send + 'static>(interval: Duration, chan: Sender<T>, value: T) {\n\n thread::spawn(move || {\n\n loop {\n\n thread::sleep(interval);\n\n match chan.send(value.clone()) {\n\n Ok(()) => {},\n\n Err(_) => break,\n\n };\n\n }\n\n });\n\n}\n","file_path":"saver_genetic_orbits/src/timer.rs","rank":97,"score":32287.61764569558},{"content":"}\n\n\n\n#[cfg(feature = \"graphical\")]\n\npub(crate) mod graphical_components {\n\n use rand::{Rng, distributions::{Distribution, Uniform}};\n\n use sfml::{graphics::Color, system::Vector2f};\n\n use specs::world::LazyBuilder;\n\n\n\n use xsecurelock_saver::engine::components::draw::{DrawColor, DrawShape, ShapeType};\n\n\n\n pub(super) fn add_graphical_components<'a, R: Rng>(\n\n radius: f32, rng: &mut R, builder: LazyBuilder<'a>,\n\n ) -> LazyBuilder<'a> {\n\n let color = generate_random_color(rng);\n\n builder.with(DrawColor {\n\n fill_color: color,\n\n outline_color: color,\n\n outline_thickness: 0.,\n\n })\n\n .with(DrawShape {\n","file_path":"saver_genetic_orbits/src/worldgenerator/mod.rs","rank":98,"score":30981.231145370915},{"content":"\n\nmod scoring_function;\n\n\n\n#[cfg(feature = \"graphical\")]\n\nmod area_scaling {\n\n use specs::Read;\n\n use xsecurelock_saver::engine::resources::draw::View;\n\n\n\n pub(super) type AreaScalingData<'a> = Read<'a, View>;\n\n\n\n pub(super) fn get_aspect<'a>(view: &AreaScalingData<'a>) -> f32 {\n\n // x / y = w / w_0; w_0 * x / y = w\n\n view.size.x / view.size.y\n\n }\n\n}\n\n\n\n#[cfg(not(feature = \"graphical\"))]\n\nmod area_scaling {\n\n pub(super) type AreaScalingData<'a> = ();\n\n\n","file_path":"saver_genetic_orbits/src/statustracker/mod.rs","rank":99,"score":30973.765835316488}],"string":"[\n {\n \"content\": \"pub trait SpecializedSystem<'a, T> {\\n\\n type SystemData: SystemData<'a>;\\n\\n\\n\\n fn run_special(&mut self, specialized: T, data: Self::SystemData);\\n\\n\\n\\n fn setup_special(&mut self, _specialized: T, res: &mut Resources) {\\n\\n Self::SystemData::setup(res);\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) trait SpecializedSystemObject<'a, T> {\\n\\n fn run(&mut self, special_data: T, res: &'a Resources);\\n\\n\\n\\n fn setup(&mut self, special_data: T, res: &mut Resources);\\n\\n}\\n\\n\\n\\nimpl<'a, T, S> SpecializedSystemObject<'a, T> for S\\n\\n where S: SpecializedSystem<'a, T>,\\n\\n{\\n\\n fn run(&mut self, special_data: T, res: &'a Resources) {\\n\",\n \"file_path\": \"src/engine/systems/specialized.rs\",\n \"rank\": 0,\n \"score\": 142337.94887796583\n },\n {\n \"content\": \"/// Wraps a SpecializedSystem as a System, allowing us to pass through extra\\n\\n/// data. Should only be used once, and only for run, not setup. Becomes \\n\\n/// invalidated after use. Should only be used by the generic implementation of\\n\\n/// SpecializedSystemObject.\\n\\nstruct SpecializedSystemWrapper<'b, T, S> \\n\\n where T: 'b,\\n\\n S: 'b\\n\\n{\\n\\n system: &'b mut S,\\n\\n special_data: Option<T>,\\n\\n}\\n\\n\\n\\nimpl<'a, 'b, T, S> System<'a> for SpecializedSystemWrapper<'b, T, S>\\n\\n where S: SpecializedSystem<'a, T>,\\n\\n{\\n\\n type SystemData = S::SystemData;\\n\\n\\n\\n fn run(&mut self, data: Self::SystemData) {\\n\\n self.system.run_special(\\n\\n self.special_data.take().expect(\\\"Cannot re-use the wrapper\\\"),\\n\\n data,\\n\\n );\\n\\n }\\n\\n\\n\\n fn setup(&mut self, _res: &mut Resources) {\\n\\n panic!(\\\"Don't use the wrapper to set up SpecializedSystems.\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engine/systems/specialized.rs\",\n \"rank\": 1,\n \"score\": 141242.08417604736\n },\n {\n \"content\": \"/// Register all components and default resources.\\n\\npub fn register(world: &mut ::specs::World) {\\n\\n components::register_all(world);\\n\\n resources::add_default_resources(world);\\n\\n}\\n\",\n \"file_path\": \"physics/src/lib.rs\",\n \"rank\": 2,\n \"score\": 132201.10759405102\n },\n {\n \"content\": \"pub fn register(world: &mut World) {\\n\\n components::register_all(world);\\n\\n resources::add_default_resources(world);\\n\\n}\\n\\n\\n\\n/// Builder for scene change handler.\\n\\npub struct SceneChangeHandlerBuilder<'a, 'b> {\\n\\n scene_change_dispatcher: DispatcherBuilder<'a, 'b>,\\n\\n}\\n\\n\\n\\nimpl<'a, 'b> SceneChangeHandlerBuilder<'a, 'b> {\\n\\n pub fn new() -> Self {\\n\\n SceneChangeHandlerBuilder {\\n\\n scene_change_dispatcher: DispatcherBuilder::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Set the threadpool to use when dispatching.\\n\\n pub fn with_threadpool(mut self, pool: Arc<ThreadPool>) -> Self {\\n\\n self.set_threadpool(pool);\\n\",\n \"file_path\": \"scene_management/src/lib.rs\",\n \"rank\": 3,\n \"score\": 104661.70205383058\n },\n {\n \"content\": \"pub trait SceneLoader<'a> {\\n\\n type SystemData: SystemData<'a>;\\n\\n\\n\\n fn load(&mut self, data: Self::SystemData);\\n\\n}\\n\\n\\n\\nimpl<L> SceneLoaderDispatcher for L where L: for<'a> SceneLoader<'a> {\\n\\n fn dispatch(&mut self, world: &mut World) {\\n\\n world.exec(|data: L::SystemData| self.load(data));\\n\\n }\\n\\n}\\n\\n\\n\\n/// Resource used to set a scene change.\\n\\n#[derive(Default)]\\n\\npub struct SceneChange(Option<Box<dyn SceneLoaderDispatcher + Send + Sync>>);\\n\\n\\n\\nimpl SceneChange {\\n\\n /// Will cause the scene to change after the current frame. If another scene change is already\\n\\n /// configured, this will override it.\\n\\n pub fn change_scene<T>(&mut self, scene_loader: T) \\n\",\n \"file_path\": \"scene_management/src/resources.rs\",\n \"rank\": 4,\n \"score\": 79402.8224619119\n },\n {\n \"content\": \"/// Storage for models.\\n\\n// TODO(zstewart): fix sqlite storage with some thread local magic so that non-mutating methods can\\n\\n// use &self instead of &mut self.\\n\\npub trait Storage {\\n\\n /// Add a new root scenario. This scenario is the new root of a family of scenarios.\\n\\n fn add_root_scenario(&mut self, world: World, score: f64) -> Result<Scenario, Box<dyn Error>>;\\n\\n\\n\\n /// Add a new scenario that is the child of the specified scenario\\n\\n fn add_child_scenario(\\n\\n &mut self,\\n\\n world: World,\\n\\n score: f64,\\n\\n parent: &Scenario,\\n\\n ) -> Result<Scenario, Box<dyn Error>>;\\n\\n\\n\\n /// Returns the number of scenarios available.\\n\\n fn num_scenarios(&mut self) -> Result<u64, Box<dyn Error>>;\\n\\n\\n\\n /// Gets the nth scenario, in order of score (descending, so lower indexes are higher scoring\\n\\n /// scenarios). May return None if the index is outside the number of scenarios.\\n\\n fn get_nth_scenario_by_score(&mut self, index: u64) -> Result<Option<Scenario>, Box<dyn Error>>;\\n\\n\\n\\n /// Removes the bottom scoring scenarios, keeping up to number_to_keep top scoring scenarios.\\n\\n /// Returns the number of scenarios pruned.\\n\\n fn keep_top_scenarios_by_score(&mut self, number_to_keep: u64) -> Result<u64, Box<dyn Error>>;\\n\\n}\\n\",\n \"file_path\": \"saver_genetic_orbits/src/storage/mod.rs\",\n \"rank\": 5,\n \"score\": 77328.69204357456\n },\n {\n \"content\": \" impl Sub for Time {\\n\\n type Output = Self;\\n\\n \\n\\n fn sub(mut self, rhs: Self) -> Self { self -= rhs; self }\\n\\n }\\n\\n \\n\\n impl SubAssign for Time {\\n\\n fn sub_assign(&mut self, Time(rhs): Self) { self.0 -= rhs; }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"graphical\\\")] \\n\\nmod time_impl {\\n\\n extern crate sfml;\\n\\n\\n\\n pub type Time = sfml::system::Time;\\n\\n}\\n\",\n \"file_path\": \"physics/src/time.rs\",\n \"rank\": 6,\n \"score\": 72323.0984655893\n },\n {\n \"content\": \" /// A partial copy fo the SFML time api that doesn't depend on SFML.\\n\\n #[derive(Copy, Clone, Default, Eq, PartialEq, Ord, PartialOrd)]\\n\\n pub struct Time(/* microseconds */ i64);\\n\\n\\n\\n \\n\\n impl Time {\\n\\n const MICROSECONDS_PER_SECOND: f32 = 1000000.;\\n\\n const MICROSECONDS_PER_MILLISECOND: i64 = 1000;\\n\\n\\n\\n pub const ZERO: Time = Time(0);\\n\\n\\n\\n pub fn seconds(seconds: f32) -> Self {\\n\\n Time((seconds * Self::MICROSECONDS_PER_SECOND) as i64)\\n\\n }\\n\\n \\n\\n pub fn milliseconds(ms: i32) -> Self {\\n\\n Time(ms as i64 * Self::MICROSECONDS_PER_MILLISECOND)\\n\\n }\\n\\n \\n\\n pub fn as_seconds(self) -> f32 {\\n\",\n \"file_path\": \"physics/src/time.rs\",\n \"rank\": 7,\n \"score\": 72318.02095481478\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\npub use self::time_impl::Time;\\n\\n\\n\\n#[cfg(not(feature = \\\"graphical\\\"))] \\n\\nmod time_impl {\\n\\n use std::ops::{Add, AddAssign, Sub, SubAssign, Neg};\\n\\n \\n\",\n \"file_path\": \"physics/src/time.rs\",\n \"rank\": 8,\n \"score\": 72316.84382445154\n },\n {\n \"content\": \" self.0 as f32 / Self::MICROSECONDS_PER_SECOND\\n\\n }\\n\\n }\\n\\n \\n\\n impl Add for Time {\\n\\n type Output = Self;\\n\\n \\n\\n fn add(mut self, rhs: Self) -> Self { self += rhs; self }\\n\\n }\\n\\n \\n\\n impl AddAssign for Time {\\n\\n fn add_assign(&mut self, Time(rhs): Self) { self.0 += rhs }\\n\\n }\\n\\n \\n\\n impl Neg for Time {\\n\\n type Output = Self;\\n\\n \\n\\n fn neg(self) -> Self { Time(-self.0) }\\n\\n }\\n\\n \\n\",\n \"file_path\": \"physics/src/time.rs\",\n \"rank\": 9,\n \"score\": 72314.71691604701\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse crate::time::Time;\\n\\n\\n\\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\\n\\n world.add_resource(PhysicsDeltaTime::default());\\n\\n world.add_resource(PhysicsElapsed::default());\\n\\n}\\n\",\n \"file_path\": \"physics/src/resources.rs\",\n \"rank\": 10,\n \"score\": 72208.0609887217\n },\n {\n \"content\": \"\\n\\n/// The amount of time elapsed in the physics simulation.\\n\\npub struct PhysicsDeltaTime(pub Time);\\n\\n\\n\\nimpl Default for PhysicsDeltaTime {\\n\\n fn default() -> Self { PhysicsDeltaTime(Time::milliseconds(16)) }\\n\\n}\\n\\n\\n\\n/// The total elapsed time in the physics simulation.\\n\\npub struct PhysicsElapsed {\\n\\n pub previous: Time,\\n\\n pub current: Time,\\n\\n}\\n\\n\\n\\nimpl Default for PhysicsElapsed {\\n\\n fn default() -> Self { \\n\\n PhysicsElapsed {\\n\\n current: Time::ZERO,\\n\\n previous: Time::ZERO,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"physics/src/resources.rs\",\n \"rank\": 11,\n \"score\": 72206.34476560763\n },\n {\n \"content\": \"use crate::{\\n\\n resources::PhysicsElapsed,\\n\\n time::Time,\\n\\n};\\n\\n\\n\\npub type Vector = ::nalgebra::Vector2<f32>;\\n\\npub type Isometry = ::nalgebra::Isometry2<f32>;\\n\\npub type Translation = ::nalgebra::Translation2<f32>;\\n\\npub type Rotation = ::nalgebra::UnitComplex<f32>;\\n\\n\\n\\npub(crate) fn register_all(world: &mut World) {\\n\\n world.register::<Position>();\\n\\n world.register::<Velocity>();\\n\\n world.register::<Mass>();\\n\\n world.register::<ForceAccumulator>();\\n\\n}\\n\\n\\n\\n/// How position interpolation is handled.\\n\\n#[derive(Copy, Clone, Eq, PartialEq, Debug)]\\n\\npub enum PositionInterpolationMode {\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 12,\n \"score\": 72069.77138093178\n },\n {\n \"content\": \" pub fn physics_interpolation_factor(elapsed: Time, physics: &PhysicsElapsed) -> f32 {\\n\\n let since_physics = elapsed - physics.previous;\\n\\n let physics_step = physics.current - physics.previous;\\n\\n since_physics.as_seconds() / physics_step.as_seconds()\\n\\n }\\n\\n\\n\\n /// Copy current to previous to setup for the next iteration.\\n\\n pub(crate) fn step_previous(&mut self) {\\n\\n self.previous = self.current;\\n\\n }\\n\\n}\\n\\n\\n\\n/// Velocity of an object, used for Sympletic Euler integration.\\n\\npub struct Velocity {\\n\\n pub linear: Vector,\\n\\n pub angular: Rotation,\\n\\n}\\n\\n\\n\\nimpl Component for Velocity {\\n\\n type Storage = VecStorage<Self>;\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 13,\n \"score\": 72069.17127184257\n },\n {\n \"content\": \" /// Position is interpolated.\\n\\n Interpolated,\\n\\n /// Positions are not interpolated.\\n\\n Static,\\n\\n}\\n\\n\\n\\n/// The physics system position. Should usually only be updated during physics update.\\n\\n#[derive(Debug)]\\n\\npub struct Position {\\n\\n mode: PositionInterpolationMode,\\n\\n current: (Vector, Rotation),\\n\\n previous: (Vector, Rotation),\\n\\n}\\n\\n\\n\\nimpl Component for Position {\\n\\n type Storage = VecStorage<Self>;\\n\\n}\\n\\n\\n\\nimpl Position {\\n\\n /// Creates an interpolated position with the specified starting position and rotation.\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 14,\n \"score\": 72064.96130206906\n },\n {\n \"content\": \"\\n\\nimpl Component for Mass {\\n\\n type Storage = VecStorage<Self>;\\n\\n}\\n\\n\\n\\nimpl Default for Mass {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n linear: 1.,\\n\\n angular: 1.,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Accumulates forces applied to an object over the course of a frame.\\n\\npub struct ForceAccumulator {\\n\\n /// The linear force applied to an object.\\n\\n pub linear: Vector,\\n\\n /// The torque applied to an object.\\n\\n pub angular: Rotation,\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 15,\n \"score\": 72061.7686862466\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Component for ForceAccumulator {\\n\\n type Storage = VecStorage<Self>;\\n\\n}\\n\\n\\n\\nimpl ForceAccumulator {\\n\\n pub fn clear(&mut self) {\\n\\n *self = Default::default();\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for ForceAccumulator {\\n\\n /// Create an empty force accumulator.\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n linear: Vector::new(0., 0.),\\n\\n angular: Rotation::from_angle(0.),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 16,\n \"score\": 72060.56683022666\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Velocity {\\n\\n /// Create a new velocity component.\\n\\n pub fn new(linear: Vector, angular: f32) -> Self {\\n\\n Velocity {\\n\\n linear,\\n\\n angular: Rotation::from_angle(angular),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// The mass of an object.\\n\\n#[derive(Copy, Clone)]\\n\\npub struct Mass {\\n\\n /// Linear inertia of this object.\\n\\n pub linear: f32,\\n\\n /// Angular (moment of inertia) of this object.\\n\\n pub angular: f32,\\n\\n}\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 17,\n \"score\": 72060.56542429123\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::{\\n\\n Component,\\n\\n VecStorage,\\n\\n World,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 18,\n \"score\": 72058.67313510264\n },\n {\n \"content\": \" pub fn new(pos: Vector, rot: Rotation) -> Self {\\n\\n Self {\\n\\n mode: PositionInterpolationMode::Interpolated,\\n\\n current: (pos, rot),\\n\\n previous: (pos, rot),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Creates a position with the specified starting position and rotation, and the given\\n\\n /// interpolation mode.\\n\\n pub fn new_with_mode(pos: Vector, rot: Rotation, mode: PositionInterpolationMode) -> Self {\\n\\n Self {\\n\\n mode,\\n\\n current: (pos, rot),\\n\\n previous: (pos, rot),\\n\\n }\\n\\n }\\n\\n\\n\\n /// The position of the object.\\n\\n #[inline]\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 19,\n \"score\": 72058.0581138923\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn mode(&self) -> PositionInterpolationMode { self.mode }\\n\\n\\n\\n /// Sets the interpolation mode.\\n\\n #[inline]\\n\\n pub fn set_mode(&mut self, mode: PositionInterpolationMode) { self.mode = mode; }\\n\\n\\n\\n /// Interpolate from the previous position to the current position.\\n\\n pub fn interpolate(&self, factor: f32) -> (Vector, Rotation) {\\n\\n match self.mode {\\n\\n PositionInterpolationMode::Interpolated => {\\n\\n let pos = self.current.0 * factor + self.previous.0 * (1. - factor);\\n\\n let rotation = self.previous.1.rotation_to(&self.current.1).powf(factor);\\n\\n (pos, self.previous.1 * rotation)\\n\\n },\\n\\n PositionInterpolationMode::Static => self.current,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Calculate an interpolation factor from the previous physics timestep to now.\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 20,\n \"score\": 72056.42025460597\n },\n {\n \"content\": \" pub fn pos(&self) -> Vector { self.current.0 }\\n\\n\\n\\n /// Mutable access to the position of the object.\\n\\n #[inline]\\n\\n pub fn pos_mut(&mut self) -> &mut Vector { &mut self.current.0 }\\n\\n\\n\\n /// Sets the postion of the object.\\n\\n #[inline]\\n\\n pub fn set_pos(&mut self, p: Vector) { self.current.0 = p }\\n\\n\\n\\n /// Sets the position, clearing the previous position. This allows moving an interpolated\\n\\n /// position without interpolation for a single frame.\\n\\n #[inline]\\n\\n pub fn teleport_pos(&mut self, p: Vector) {\\n\\n self.current.0 = p;\\n\\n self.previous.0 = p;\\n\\n }\\n\\n\\n\\n /// The rotation of the object.\\n\\n #[inline]\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 21,\n \"score\": 72054.57277173927\n },\n {\n \"content\": \" pub fn rot(&self) -> Rotation { self.current.1 }\\n\\n\\n\\n /// Mutable access to the rotation of the object.\\n\\n #[inline]\\n\\n pub fn rot_mut(&mut self) -> &mut Rotation { &mut self.current.1 }\\n\\n\\n\\n /// Sets the rotation of the object.\\n\\n #[inline]\\n\\n pub fn set_rot(&mut self, r: Rotation) { self.current.1 = r; }\\n\\n\\n\\n\\n\\n /// Sets the rotation, clearing the previous rotation. This allows moving an interpolated\\n\\n /// rotation without interpolation for a single frame.\\n\\n #[inline]\\n\\n pub fn teleport_rot(&mut self, r: Rotation) {\\n\\n self.current.1 = r;\\n\\n self.previous.1 = r;\\n\\n }\\n\\n\\n\\n /// Gets the interpolation mode.\\n\",\n \"file_path\": \"physics/src/components.rs\",\n \"rank\": 22,\n \"score\": 72054.55921737239\n },\n {\n \"content\": \" WriteStorage,\\n\\n};\\n\\n\\n\\nuse crate::{\\n\\n components::{\\n\\n ForceAccumulator,\\n\\n Position,\\n\\n Mass,\\n\\n Velocity,\\n\\n },\\n\\n resources::PhysicsDeltaTime,\\n\\n};\\n\\n\\n\\n/// Copies current positions to previous positions to allow interpolation. Should run before each\\n\\n/// physics tick.\\n\\npub struct SetupNextPhysicsPosition;\\n\\n\\n\\nimpl<'a> System<'a> for SetupNextPhysicsPosition {\\n\\n type SystemData = WriteStorage<'a, Position>;\\n\\n\\n\",\n \"file_path\": \"physics/src/systems.rs\",\n \"rank\": 23,\n \"score\": 71849.4751597587\n },\n {\n \"content\": \"/// Integrates velocities, adding to the position, multiplied by PhysicsDeltaTime.\\n\\npub struct SympleticEulerVelocityStep;\\n\\nimpl<'a> System<'a> for SympleticEulerVelocityStep {\\n\\n type SystemData = (\\n\\n Read<'a, PhysicsDeltaTime>,\\n\\n WriteStorage<'a, Position>,\\n\\n ReadStorage<'a, Velocity>,\\n\\n );\\n\\n\\n\\n fn run(&mut self, (time, mut positions, velocities): Self::SystemData) {\\n\\n let dt = time.0.as_seconds();\\n\\n for (pos, vel) in (&mut positions, &velocities).join() {\\n\\n *pos.pos_mut() += vel.linear * dt;\\n\\n *pos.rot_mut() *= vel.angular.powf(dt);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"physics/src/systems.rs\",\n \"rank\": 24,\n \"score\": 71843.28384805149\n },\n {\n \"content\": \" fn run(&mut self, mut positions: Self::SystemData) {\\n\\n for pos in (&mut positions).join() {\\n\\n pos.step_previous();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct ClearForceAccumulators;\\n\\n\\n\\nimpl<'a> System<'a> for ClearForceAccumulators {\\n\\n type SystemData = WriteStorage<'a, ForceAccumulator>;\\n\\n\\n\\n fn run(&mut self, mut accumulators: Self::SystemData) {\\n\\n for acc in (&mut accumulators).join() {\\n\\n acc.clear();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Integrates forces, adding to the velocity, multiplied by PhysicsDeltaTime.\\n\",\n \"file_path\": \"physics/src/systems.rs\",\n \"rank\": 25,\n \"score\": 71842.79669281571\n },\n {\n \"content\": \"pub struct SympleticEulerForceStep;\\n\\nimpl<'a> System<'a> for SympleticEulerForceStep {\\n\\n type SystemData = (\\n\\n Read<'a, PhysicsDeltaTime>,\\n\\n Entities<'a>,\\n\\n WriteStorage<'a, Velocity>,\\n\\n ReadStorage<'a, Mass>,\\n\\n ReadStorage<'a, ForceAccumulator>,\\n\\n );\\n\\n\\n\\n fn run(&mut self, (time, entities, mut velocities, masses, forces): Self::SystemData) {\\n\\n let dt = time.0.as_seconds();\\n\\n for (vel, force, ent) in (&mut velocities, &forces, &*entities).join() {\\n\\n let mass = masses.get(ent).cloned().unwrap_or_default();\\n\\n vel.linear += (force.linear / mass.linear) * dt;\\n\\n vel.angular *= force.angular.powf(1./mass.angular).powf(dt);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"physics/src/systems.rs\",\n \"rank\": 26,\n \"score\": 71841.17323877284\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::{\\n\\n Entities,\\n\\n Join,\\n\\n Read,\\n\\n ReadStorage,\\n\\n System,\\n\",\n \"file_path\": \"physics/src/systems.rs\",\n \"rank\": 27,\n \"score\": 71832.98257059058\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse sfml::system::Time;\\n\\n\\n\\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\\n\\n world.add_resource(DeltaTime::default());\\n\\n world.add_resource(Elapsed::default());\\n\\n}\\n\",\n \"file_path\": \"src/engine/resources/time.rs\",\n \"rank\": 28,\n \"score\": 69999.3656921995\n },\n {\n \"content\": \"\\n\\n/// The time since the last update/fixed update.\\n\\npub struct DeltaTime(pub Time);\\n\\n\\n\\nimpl Default for DeltaTime {\\n\\n fn default() -> Self { DeltaTime(Time::ZERO) }\\n\\n}\\n\\n\\n\\n/// The total elapsed time since the simulation started.\\n\\npub struct Elapsed {\\n\\n pub previous: Time,\\n\\n pub current: Time,\\n\\n}\\n\\n\\n\\nimpl Default for Elapsed {\\n\\n fn default() -> Self { \\n\\n Elapsed {\\n\\n current: Time::ZERO,\\n\\n previous: Time::ZERO,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engine/resources/time.rs\",\n \"rank\": 29,\n \"score\": 69994.28485425544\n },\n {\n \"content\": \" use specs::RunNow;\\n\\n SpecializedSystemWrapper{\\n\\n system: self,\\n\\n special_data: Some(special_data),\\n\\n }.run_now(res);\\n\\n }\\n\\n\\n\\n fn setup(&mut self, special_data: T, res: &mut Resources) {\\n\\n self.setup_special(special_data, res);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/systems/specialized.rs\",\n \"rank\": 30,\n \"score\": 69685.47565335683\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::{Resources, System, SystemData};\\n\\n\\n\",\n \"file_path\": \"src/engine/systems/specialized.rs\",\n \"rank\": 31,\n \"score\": 69679.43634097007\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse sfml::graphics::View as SfView;\\n\\nuse sfml::system::Vector2f;\\n\\nuse specs::BitSet;\\n\\n\\n\\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\\n\\n world.add_resource(DrawLayers::default());\\n\",\n \"file_path\": \"src/engine/resources/draw.rs\",\n \"rank\": 32,\n \"score\": 69621.65705814528\n },\n {\n \"content\": \" world.add_resource(CurrentDrawLayer::default());\\n\\n world.add_resource(View::default());\\n\\n}\\n\\n\\n\\n/// Internal tracking of bitsets for which entities are on which layers.\\n\\n#[derive(Default)]\\n\\npub(crate) struct DrawLayers {\\n\\n /// Masks for each layer.\\n\\n pub(crate) masks: [BitSet; DrawLayers::NUM_LAYERS],\\n\\n /// Mask of values set in any layer.\\n\\n pub(crate) any_mask: BitSet,\\n\\n}\\n\\n\\n\\nimpl DrawLayers {\\n\\n /// Number of total layer masks.\\n\\n pub(crate) const NUM_LAYERS: usize = 10;\\n\\n}\\n\\n\\n\\n/// Which draw layer to read from for the current draw.\\n\\n#[derive(Default)]\\n\",\n \"file_path\": \"src/engine/resources/draw.rs\",\n \"rank\": 33,\n \"score\": 69619.68623023256\n },\n {\n \"content\": \"pub(crate) struct CurrentDrawLayer(usize);\\n\\n\\n\\nimpl CurrentDrawLayer {\\n\\n /// Get the current draw layer. Guaranteed to be <= DrawLayers::NUM_LAYERS.\\n\\n #[inline]\\n\\n pub(crate) fn layer(&self) -> usize { self.0 }\\n\\n\\n\\n /// Set the current draw layer. Must be <= DrawLayers::NUM_LAYERS.\\n\\n #[inline]\\n\\n pub(crate) fn set_layer(&mut self, layer: usize) {\\n\\n assert!(layer <= DrawLayers::NUM_LAYERS, \\\"layer out of range\\\");\\n\\n self.0 = layer;\\n\\n }\\n\\n}\\n\\n\\n\\npub struct View {\\n\\n pub center: Vector2f,\\n\\n pub size: Vector2f,\\n\\n pub rotation: f32,\\n\\n}\\n\",\n \"file_path\": \"src/engine/resources/draw.rs\",\n \"rank\": 34,\n \"score\": 69618.6651807378\n },\n {\n \"content\": \"\\n\\nimpl Default for View {\\n\\n fn default() -> Self { \\n\\n Self {\\n\\n center: Vector2f::new(0., 0.),\\n\\n size: Vector2f::new(1000., 1000.),\\n\\n rotation: 0.,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl View {\\n\\n pub(crate) fn copy_to(&self, view: &mut SfView) {\\n\\n view.set_center(self.center);\\n\\n view.set_size(self.size);\\n\\n view.set_rotation(self.rotation);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engine/resources/draw.rs\",\n \"rank\": 35,\n \"score\": 69615.32246938914\n },\n {\n \"content\": \" Component,\\n\\n FlaggedStorage,\\n\\n VecStorage,\\n\\n World,\\n\\n};\\n\\n\\n\\nuse crate::engine::resources::draw::DrawLayers;\\n\\n\\n\\npub(crate) fn register_all(world: &mut World) {\\n\\n world.register::<DrawLayer>();\\n\\n world.register::<DrawColor>();\\n\\n world.register::<DrawShape>();\\n\\n}\\n\\n\\n\\n/// What layer to draw an object on.\\n\\n#[derive(Debug)]\\n\\npub struct DrawLayer(u8);\\n\\n\\n\\nimpl Component for DrawLayer {\\n\\n type Storage = FlaggedStorage<Self, VecStorage<Self>>;\\n\",\n \"file_path\": \"src/engine/components/draw.rs\",\n \"rank\": 36,\n \"score\": 69494.1185458234\n },\n {\n \"content\": \" pub outline_thickness: f32,\\n\\n}\\n\\n\\n\\nimpl Component for DrawColor {\\n\\n type Storage = FlaggedStorage<Self, VecStorage<Self>>;\\n\\n}\\n\\n\\n\\nimpl DrawColor {\\n\\n pub(crate) fn copy_to<'a, T>(&self, shape: &mut T) where T: Shape<'a> {\\n\\n shape.set_fill_color(self.fill_color);\\n\\n shape.set_outline_color(self.outline_color);\\n\\n shape.set_outline_thickness(self.outline_thickness);\\n\\n }\\n\\n}\\n\\n\\n\\n/// A drawable shape.\\n\\n#[derive(Clone)]\\n\\npub struct DrawShape {\\n\\n pub shape_type: ShapeType,\\n\\n pub origin: Vector2f,\\n\",\n \"file_path\": \"src/engine/components/draw.rs\",\n \"rank\": 37,\n \"score\": 69487.40276777181\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// Properties specific to particular types of shapes.\\n\\n#[derive(Clone)]\\n\\npub enum ShapeType {\\n\\n Rect {\\n\\n size: Vector2f\\n\\n },\\n\\n Circle {\\n\\n radius: f32,\\n\\n point_count: u32,\\n\\n },\\n\\n Convex(Vec<Vector2f>),\\n\\n}\\n\\n\\n\\nimpl Component for DrawShape {\\n\\n type Storage = FlaggedStorage<Self, VecStorage<Self>>;\\n\\n}\\n\",\n \"file_path\": \"src/engine/components/draw.rs\",\n \"rank\": 38,\n \"score\": 69483.27396148353\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl DrawLayer {\\n\\n /// Set the layer. Must be less than `NUM_LAYERS`.\\n\\n #[inline]\\n\\n pub fn set_layer(&mut self, layer: u8) {\\n\\n assert!((layer as usize) < DrawLayers::NUM_LAYERS, \\\"layer out of range\\\");\\n\\n self.0 = layer;\\n\\n }\\n\\n\\n\\n /// Get the current draw layer.\\n\\n #[inline]\\n\\n pub fn layer(&self) -> u8 { self.0 }\\n\\n}\\n\\n\\n\\n/// Properties for basic shape renderers.\\n\\n#[derive(Debug)]\\n\\npub struct DrawColor {\\n\\n pub fill_color: Color,\\n\\n pub outline_color: Color,\\n\",\n \"file_path\": \"src/engine/components/draw.rs\",\n \"rank\": 39,\n \"score\": 69482.32061574666\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse sfml::graphics::{\\n\\n Color,\\n\\n Shape,\\n\\n};\\n\\nuse sfml::system::Vector2f;\\n\\nuse specs::{\\n\",\n \"file_path\": \"src/engine/components/draw.rs\",\n \"rank\": 40,\n \"score\": 69477.69041436646\n },\n {\n \"content\": \" RemovedFlag,\\n\\n};\\n\\n\\n\\nuse physics::{\\n\\n components::Position,\\n\\n resources::PhysicsElapsed,\\n\\n};\\n\\n\\n\\nuse crate::engine::{\\n\\n components::draw::{\\n\\n DrawColor,\\n\\n DrawLayer,\\n\\n DrawShape,\\n\\n ShapeType,\\n\\n },\\n\\n resources::{\\n\\n draw::{\\n\\n CurrentDrawLayer,\\n\\n DrawLayers,\\n\\n },\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 41,\n \"score\": 69275.3526027455\n },\n {\n \"content\": \" fn setup_special(&mut self, _: &'b mut Vec<Option<SfShape<'tex>>>, res: &mut Resources) {\\n\\n Self::SystemData::setup(res);\\n\\n let mut shape_storage: WriteStorage<DrawShape> = SystemData::fetch(&res);\\n\\n self.removed_shape_reader_id = Some(shape_storage.track_removed());\\n\\n self.modified_shape_reader_id = Some(shape_storage.track_modified());\\n\\n self.inserted_shape_reader_id = Some(shape_storage.track_inserted());\\n\\n\\n\\n let mut color_storage: WriteStorage<DrawColor> = SystemData::fetch(&res);\\n\\n self.modified_color_reader_id = Some(color_storage.track_modified());\\n\\n self.inserted_color_reader_id = Some(color_storage.track_inserted());\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Default)]\\n\\npub(crate) struct DrawDrawShapesSystem;\\n\\n\\n\\nimpl<'a, 'b, 'tex> \\n\\n SpecializedSystem<'a, (&'b mut RenderWindow, &'b mut Vec<Option<SfShape<'tex>>>)> \\n\\n for DrawDrawShapesSystem\\n\\n{\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 42,\n \"score\": 69271.95546332406\n },\n {\n \"content\": \"impl<'a, 'b, 'tex> SpecializedSystem<'a, &'b mut Vec<Option<SfShape<'tex>>>> \\n\\n for SyncDrawShapesSystem \\n\\n{\\n\\n type SystemData = (\\n\\n Entities<'a>,\\n\\n Read<'a, Elapsed>,\\n\\n Read<'a, PhysicsElapsed>,\\n\\n ReadStorage<'a, Position>,\\n\\n ReadStorage<'a, DrawShape>,\\n\\n ReadStorage<'a, DrawColor>,\\n\\n );\\n\\n\\n\\n fn run_special(\\n\\n &mut self, \\n\\n sf_shapes: &'b mut Vec<Option<SfShape<'tex>>>,\\n\\n (entities, elapsed, physics_elapsed, positions, shapes, colors): Self::SystemData,\\n\\n ) {\\n\\n self.dirty.clear();\\n\\n shapes.populate_removed(\\n\\n &mut self.removed_shape_reader_id.as_mut().unwrap(), \\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 43,\n \"score\": 69271.35715225709\n },\n {\n \"content\": \" time::Elapsed,\\n\\n },\\n\\n systems::specialized::SpecializedSystem,\\n\\n};\\n\\n\\n\\n/// Updates draw layers.\\n\\n#[derive(Default)]\\n\\npub(crate) struct DrawLayersUpdater {\\n\\n dirty: BitSet,\\n\\n removed_reader_id: Option<ReaderId<RemovedFlag>>,\\n\\n modified_reader_id: Option<ReaderId<ModifiedFlag>>,\\n\\n inserted_reader_id: Option<ReaderId<InsertedFlag>>,\\n\\n}\\n\\n\\n\\nimpl<'a> System<'a> for DrawLayersUpdater {\\n\\n type SystemData = (\\n\\n Write<'a, DrawLayers>,\\n\\n ReadStorage<'a, DrawLayer>,\\n\\n );\\n\\n\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 44,\n \"score\": 69268.24822028863\n },\n {\n \"content\": \" &mut self.inserted_color_reader_id.as_mut().unwrap(),\\n\\n &mut self.dirty,\\n\\n );\\n\\n colors.populate_modified(\\n\\n &mut self.modified_color_reader_id.as_mut().unwrap(),\\n\\n &mut self.dirty,\\n\\n );\\n\\n for (_, color, id) in (&shapes, &colors, &self.dirty).join() {\\n\\n sf_shapes[id as usize].as_mut().unwrap().apply_color(color);\\n\\n }\\n\\n\\n\\n let factor = Position::physics_interpolation_factor(elapsed.current, &physics_elapsed);\\n\\n for (entity, _, position) in (&*entities, &shapes, &positions).join() {\\n\\n let (pos, rot) = position.interpolate(factor);\\n\\n let draw_pos = Vector2f::new(pos.x, -pos.y);\\n\\n let draw_rot = -rot.angle().to_degrees();\\n\\n sf_shapes[entity.id() as usize].as_mut().unwrap().apply_position(draw_pos, draw_rot);\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 45,\n \"score\": 69268.16163721235\n },\n {\n \"content\": \" type SystemData = (\\n\\n Read<'a, DrawLayers>,\\n\\n Read<'a, CurrentDrawLayer>,\\n\\n ReadStorage<'a, DrawShape>,\\n\\n );\\n\\n\\n\\n fn run_special(\\n\\n &mut self, \\n\\n (window, sf_shapes): (&'b mut RenderWindow, &'b mut Vec<Option<SfShape>>),\\n\\n (layer_masks, current_draw_layer, shapes): Self::SystemData,\\n\\n ) {\\n\\n if current_draw_layer.layer() < DrawLayers::NUM_LAYERS {\\n\\n for (_, id) in (&shapes, &layer_masks.masks[current_draw_layer.layer()]).join() {\\n\\n sf_shapes[id as usize].as_mut().unwrap().draw(window);\\n\\n }\\n\\n } else {\\n\\n for (_, id) in (&shapes, !&layer_masks.any_mask).join() {\\n\\n sf_shapes[id as usize].as_mut().unwrap().draw(window);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 46,\n \"score\": 69266.59936163099\n },\n {\n \"content\": \" RenderTarget,\\n\\n Transformable,\\n\\n};\\n\\nuse sfml::system::Vector2f;\\n\\nuse specs::{\\n\\n BitSet,\\n\\n Entities,\\n\\n Join,\\n\\n Read,\\n\\n ReaderId,\\n\\n ReadStorage,\\n\\n Resources,\\n\\n System,\\n\\n SystemData,\\n\\n Write,\\n\\n WriteStorage,\\n\\n};\\n\\nuse specs::storage::{\\n\\n InsertedFlag,\\n\\n ModifiedFlag,\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 47,\n \"score\": 69265.83943647926\n },\n {\n \"content\": \" }\\n\\n layer_masks.masks[layer.layer() as usize].add(id);\\n\\n layer_masks.any_mask.add(id);\\n\\n }\\n\\n }\\n\\n\\n\\n fn setup(&mut self, res: &mut Resources) {\\n\\n Self::SystemData::setup(res);\\n\\n let mut storage: WriteStorage<DrawLayer> = SystemData::fetch(&res);\\n\\n self.removed_reader_id = Some(storage.track_removed());\\n\\n self.modified_reader_id = Some(storage.track_modified());\\n\\n self.inserted_reader_id = Some(storage.track_inserted());\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) enum SfShape<'tex> {\\n\\n Rect(RectangleShape<'tex>),\\n\\n Circle(CircleShape<'tex>),\\n\\n Convex(ConvexShape<'tex>),\\n\\n}\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 48,\n \"score\": 69265.74421318514\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn draw_to<D: Drawable>(drawable: &D, target: &mut RenderWindow) {\\n\\n target.draw(drawable);\\n\\n }\\n\\n}\\n\\n\\n\\n/// System to sync all SFML shapes from their corresponding components.\\n\\n#[derive(Default)]\\n\\npub(crate) struct SyncDrawShapesSystem {\\n\\n dirty: BitSet,\\n\\n removed_shape_reader_id: Option<ReaderId<RemovedFlag>>,\\n\\n modified_shape_reader_id: Option<ReaderId<ModifiedFlag>>,\\n\\n inserted_shape_reader_id: Option<ReaderId<InsertedFlag>>,\\n\\n\\n\\n inserted_color_reader_id: Option<ReaderId<InsertedFlag>>,\\n\\n modified_color_reader_id: Option<ReaderId<ModifiedFlag>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 49,\n \"score\": 69265.51835583082\n },\n {\n \"content\": \" sf_shapes[id as usize] = Some(SfShape::create_for(shape));\\n\\n } else {\\n\\n sf_shapes[id as usize].as_mut().unwrap().update_for(shape);\\n\\n }\\n\\n if let Some(color) = colors.get(entity) {\\n\\n sf_shapes[id as usize].as_mut().unwrap().apply_color(color);\\n\\n }\\n\\n }\\n\\n\\n\\n self.dirty.clear();\\n\\n shapes.populate_modified(\\n\\n &mut self.modified_shape_reader_id.as_mut().unwrap(), \\n\\n &mut self.dirty,\\n\\n );\\n\\n for (shape, id) in (&shapes, &self.dirty).join() {\\n\\n sf_shapes[id as usize].as_mut().unwrap().update_for(shape);\\n\\n }\\n\\n\\n\\n self.dirty.clear();\\n\\n colors.populate_inserted(\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 50,\n \"score\": 69259.95611098339\n },\n {\n \"content\": \" },\\n\\n (SfShape::Convex(convex), &ShapeType::Convex(ref points)) => {\\n\\n convex.set_point_count(points.len() as u32);\\n\\n for (i, point) in points.iter().cloned().enumerate() {\\n\\n convex.set_point(i as u32, point);\\n\\n }\\n\\n convex.set_origin(shape.origin);\\n\\n },\\n\\n (this, _) => *this = SfShape::create_for(shape),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Copy the given color properties to this shape.\\n\\n fn apply_color(&mut self, color: &DrawColor) {\\n\\n match self {\\n\\n SfShape::Rect(shape) => color.copy_to(shape),\\n\\n SfShape::Circle(shape) => color.copy_to(shape),\\n\\n SfShape::Convex(shape) => color.copy_to(shape),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 51,\n \"score\": 69258.20152098247\n },\n {\n \"content\": \"\\n\\n /// Sets the position of this drawable.\\n\\n fn apply_position(&mut self, pos: Vector2f, rot: f32) {\\n\\n match self {\\n\\n SfShape::Rect(shape) => SfShape::apply_position_to(shape, pos, rot),\\n\\n SfShape::Circle(shape) => SfShape::apply_position_to(shape, pos, rot),\\n\\n SfShape::Convex(shape) => SfShape::apply_position_to(shape, pos, rot),\\n\\n }\\n\\n }\\n\\n\\n\\n fn apply_position_to<T: Transformable>(trans: &mut T, pos: Vector2f, rot: f32) {\\n\\n trans.set_position(pos);\\n\\n trans.set_rotation(rot);\\n\\n }\\n\\n\\n\\n fn draw(&self, target: &mut RenderWindow) {\\n\\n match self {\\n\\n SfShape::Rect(shape) => SfShape::draw_to(shape, target),\\n\\n SfShape::Circle(shape) => SfShape::draw_to(shape, target),\\n\\n SfShape::Convex(shape) => SfShape::draw_to(shape, target),\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 52,\n \"score\": 69257.91641158312\n },\n {\n \"content\": \"\\n\\nimpl<'tex> SfShape<'tex> {\\n\\n /// Create an SfShape for a given DrawShape.\\n\\n fn create_for(shape: &DrawShape) -> Self {\\n\\n match shape.shape_type {\\n\\n ShapeType::Rect{size} => SfShape::Rect({\\n\\n let mut rect = RectangleShape::with_size(size);\\n\\n rect.set_origin(shape.origin);\\n\\n rect\\n\\n }),\\n\\n ShapeType::Circle{\\n\\n radius,\\n\\n point_count,\\n\\n } => SfShape::Circle({\\n\\n let mut circ = CircleShape::new(radius, point_count);\\n\\n circ.set_origin(shape.origin);\\n\\n circ\\n\\n }),\\n\\n ShapeType::Convex(ref points) => SfShape::Convex({\\n\\n let mut convex = ConvexShape::new(points.len() as u32);\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 53,\n \"score\": 69256.39800810591\n },\n {\n \"content\": \" &mut self.dirty,\\n\\n );\\n\\n for id in (&self.dirty).join() {\\n\\n if (id as usize) < sf_shapes.len() {\\n\\n sf_shapes[id as usize] = None;\\n\\n }\\n\\n }\\n\\n\\n\\n self.dirty.clear();\\n\\n shapes.populate_inserted(\\n\\n &mut self.inserted_shape_reader_id.as_mut().unwrap(), \\n\\n &mut self.dirty,\\n\\n );\\n\\n for (entity, shape, id) in (&*entities, &shapes, &self.dirty).join() {\\n\\n if (id as usize) >= sf_shapes.len() {\\n\\n let needed = ((id as usize) - sf_shapes.len()) + 1;\\n\\n sf_shapes.reserve(needed);\\n\\n sf_shapes.extend((0..needed).map(|_| None));\\n\\n }\\n\\n if sf_shapes[id as usize].is_none() {\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 54,\n \"score\": 69255.66771794697\n },\n {\n \"content\": \" fn run(&mut self, (mut layer_masks, layers): Self::SystemData) {\\n\\n // If a remove flag is set, remove the id from all numbered masks and add it to the \\\"none\\n\\n // set\\\" mask.\\n\\n self.dirty.clear();\\n\\n layers.populate_removed(&mut self.removed_reader_id.as_mut().unwrap(), &mut self.dirty);\\n\\n for id in (&self.dirty).join() {\\n\\n for mask in &mut layer_masks.masks[..] {\\n\\n mask.remove(id);\\n\\n }\\n\\n layer_masks.any_mask.remove(id);\\n\\n }\\n\\n\\n\\n // If inserted or modified, remove from all masks and add to the current mask.\\n\\n self.dirty.clear();\\n\\n layers.populate_inserted(&mut self.inserted_reader_id.as_mut().unwrap(), &mut self.dirty);\\n\\n layers.populate_modified(&mut self.modified_reader_id.as_mut().unwrap(), &mut self.dirty);\\n\\n\\n\\n for (layer, id) in (&layers, &self.dirty).join() {\\n\\n for mask in &mut layer_masks.masks[..] {\\n\\n mask.remove(id);\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 55,\n \"score\": 69255.01064036551\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse sfml::graphics::{\\n\\n CircleShape,\\n\\n ConvexShape,\\n\\n Drawable,\\n\\n RectangleShape,\\n\\n RenderWindow,\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 56,\n \"score\": 69254.3863796563\n },\n {\n \"content\": \" for (i, point) in points.iter().cloned().enumerate() {\\n\\n convex.set_point(i as u32, point);\\n\\n }\\n\\n convex.set_origin(shape.origin);\\n\\n convex\\n\\n }),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Update this shape if it's of the same type, or replace it with the correct type.\\n\\n fn update_for(&mut self, shape: &DrawShape) {\\n\\n match (self, &shape.shape_type) {\\n\\n (SfShape::Rect(rect), &ShapeType::Rect{size}) => {\\n\\n rect.set_size(size);\\n\\n rect.set_origin(shape.origin);\\n\\n },\\n\\n (SfShape::Circle(circ), &ShapeType::Circle{radius, point_count}) => {\\n\\n circ.set_radius(radius);\\n\\n circ.set_point_count(point_count);\\n\\n circ.set_origin(shape.origin);\\n\",\n \"file_path\": \"src/engine/systems/draw.rs\",\n \"rank\": 57,\n \"score\": 69253.43567759548\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\npub mod draw;\\n\\npub mod time;\\n\\n\\n\\npub(crate) fn add_default_resources(world: &mut ::specs::World) {\\n\\n time::add_default_resources(world);\\n\\n draw::add_default_resources(world);\\n\\n}\\n\",\n \"file_path\": \"src/engine/resources/mod.rs\",\n \"rank\": 58,\n \"score\": 68112.97121382189\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::World;\\n\\n\\n\\npub mod draw;\\n\\n\\n\\npub(crate) fn register_all(world: &mut World) {\\n\\n draw::register_all(world);\\n\\n}\\n\",\n \"file_path\": \"src/engine/components/mod.rs\",\n \"rank\": 59,\n \"score\": 67973.03773740162\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\npub mod draw;\\n\\npub mod specialized;\\n\",\n \"file_path\": \"src/engine/systems/mod.rs\",\n \"rank\": 60,\n \"score\": 67756.0663076776\n },\n {\n \"content\": \"struct StaticScreensaver {\\n\\n img: Image,\\n\\n}\\n\\n\\n\\nimpl Screensaver for StaticScreensaver {\\n\\n fn update(&mut self) {\\n\\n for Vector2u{x, y} in row_major_iterator(self.img.size()) {\\n\\n self.img.set_pixel(x, y, Color::rgb(rand::random(), rand::random(), rand::random()));\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw<T: RenderTarget>(&self, target: &mut T) {\\n\\n let tex = Texture::from_image(&self.img).unwrap();\\n\\n let sprite = Sprite::with_texture(&tex);\\n\\n\\n\\n target.draw(&sprite);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"saver_colorstatic/src/main.rs\",\n \"rank\": 61,\n \"score\": 54053.164445961345\n },\n {\n \"content\": \"/// A screensaver which can be run on an SFML RenderTarget.\\n\\npub trait Screensaver {\\n\\n /// Runs one \\\"tick\\\" in the screensaver, with the update happening at the specified time.\\n\\n fn update(&mut self);\\n\\n\\n\\n /// Draw the screensaver on the specified target.\\n\\n fn draw<T>(&self, target: &mut T) where T: RenderTarget;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 62,\n \"score\": 52651.21698585396\n },\n {\n \"content\": \"pub fn init() {\\n\\n if !INITIALIZED.swap(true, Ordering::AcqRel) {\\n\\n unsafe { signal(libc::SIGINT, sigint_handler) };\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sigint/src/lib.rs\",\n \"rank\": 63,\n \"score\": 51450.55959115332\n },\n {\n \"content\": \"/// Struct for serializing u64 in Sql, clamping at bounds.\\n\\nstruct SqlBoundedU64(u64);\\n\\n\\n\\nimpl ToSql for SqlBoundedU64 {\\n\\n fn to_sql(&self) -> Result<ToSqlOutput, SqlError> {\\n\\n if self.0 <= i64::max_value() as u64 {\\n\\n Ok(ToSqlOutput::Owned(SqlValue::Integer(self.0 as i64)))\\n\\n } else {\\n\\n Err(SqlError::ToSqlConversionFailure(\\n\\n format!(\\n\\n \\\"Value {} is too large for SQLite, max is {}\\\", self.0, i64::max_value(),\\n\\n ).into(),\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromSql for SqlBoundedU64 {\\n\\n fn column_result(value: SqlValueRef) -> Result<Self, FromSqlError> {\\n\\n match value {\\n\\n SqlValueRef::Integer(value) if value >= 0 => Ok(SqlBoundedU64(value as u64)),\\n\",\n \"file_path\": \"saver_genetic_orbits/src/storage/sqlite.rs\",\n \"rank\": 64,\n \"score\": 48327.25901622286\n },\n {\n \"content\": \"/// Struct for serializing u64 in Sql, wrapping out of range i64 values.\\n\\nstruct SqlWrappingU64(u64);\\n\\n\\n\\nimpl ToSql for SqlWrappingU64 {\\n\\n fn to_sql(&self) -> Result<ToSqlOutput, SqlError> {\\n\\n Ok(ToSqlOutput::Owned(SqlValue::Integer(self.0 as i64)))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromSql for SqlWrappingU64 {\\n\\n fn column_result(value: SqlValueRef) -> Result<Self, FromSqlError> {\\n\\n match value {\\n\\n SqlValueRef::Integer(value) => Ok(SqlWrappingU64(value as u64)),\\n\\n _ => Err(FromSqlError::InvalidType),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"saver_genetic_orbits/src/storage/sqlite.rs\",\n \"rank\": 65,\n \"score\": 48327.163239933376\n },\n {\n \"content\": \"pub fn received_sigint() -> bool {\\n\\n RECEIVED_SIGINT.load(Ordering::Relaxed)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sigint/src/lib.rs\",\n \"rank\": 66,\n \"score\": 47838.68454814669\n },\n {\n \"content\": \"/// A visitor that receives a node from an expression tree.\\n\\npub trait Visitor {\\n\\n /// Visit the given expression subtree, optionally replacing it.\\n\\n fn visit(&mut self, node: &Expression) -> Option<Expression>;\\n\\n}\\n\\n\\n\\nimpl<F> Visitor for F where F: FnMut(&Expression) -> Option<Expression> {\\n\\n fn visit(&mut self, node: &Expression) -> Option<Expression> {\\n\\n self(node)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Expression {\\n\\n /// Perform a postorder traversal of the expression tree, running the specified visitor on\\n\\n /// every node to transform it.\\n\\n fn transform_postorder<V: Visitor>(&mut self, visitor: &mut V) {\\n\\n // Traverse all children first.\\n\\n match self {\\n\\n Expression::BinaryOp(lhs, _, rhs) => {\\n\\n lhs.transform_postorder(visitor);\\n\\n rhs.transform_postorder(visitor);\\n\",\n \"file_path\": \"saver_genetic_orbits/src/statustracker/scoring_function/transforms.rs\",\n \"rank\": 67,\n \"score\": 46503.69038874919\n },\n {\n \"content\": \"pub fn run_saver<F, S>(create_saver: F) \\n\\nwhere F: FnOnce(Vector2u) -> S,\\n\\n S: Screensaver {\\n\\n sigint::init();\\n\\n\\n\\n let mut window = open_window();\\n\\n let mut saver = create_saver(window.size());\\n\\n\\n\\n while !sigint::received_sigint() {\\n\\n while let Some(_) = window.poll_event() {}\\n\\n\\n\\n saver.update();\\n\\n\\n\\n window.clear(Color::GREEN);\\n\\n saver.draw(&mut window);\\n\\n window.display();\\n\\n }\\n\\n info!(\\\"Shutting Down\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 68,\n \"score\": 41867.10038690735\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\npub mod components;\\n\\npub mod systems;\\n\\npub mod resources;\\n\\npub mod time;\\n\\n\\n\\n/// Register all components and default resources.\\n\",\n \"file_path\": \"physics/src/lib.rs\",\n \"rank\": 69,\n \"score\": 35986.426094679555\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::{SystemData, World};\\n\\n\\n\\npub(crate) fn add_default_resources(world: &mut World) {\\n\\n world.add_resource(SceneChange(None));\\n\\n}\\n\\n\\n\\n/// Builds a new scene after a previous one has been cleaned up.\\n\\npub(crate) trait SceneLoaderDispatcher {\\n\\n fn dispatch(&mut self, world: &mut World);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"scene_management/src/resources.rs\",\n \"rank\": 70,\n \"score\": 34949.37629784672\n },\n {\n \"content\": \" where T: for<'a> SceneLoader<'a> + Send + Sync + 'static\\n\\n {\\n\\n self.0 = Some(Box::new(scene_loader));\\n\\n }\\n\\n\\n\\n /// True if a scene change is scheduled for after the end of the current frame.\\n\\n pub fn is_scene_change_scheduled(&self) -> bool {\\n\\n self.0.is_some()\\n\\n }\\n\\n\\n\\n /// Cancels a scene change scheduled for after the end of the current frame.\\n\\n pub fn cancel_scene_change(&mut self) {\\n\\n self.0 = None;\\n\\n }\\n\\n\\n\\n /// Retrieves the pending scene changer, clearing it in the process. This is needed because the\\n\\n /// scene change resource cannot be borrowed when the scene loader is executed.\\n\\n pub(crate) fn take_scene_changer(&mut self) \\n\\n -> Option<Box<dyn SceneLoaderDispatcher + Send + Sync>>\\n\\n {\\n\\n self.0.take()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"scene_management/src/resources.rs\",\n \"rank\": 71,\n \"score\": 34940.51124646188\n },\n {\n \"content\": \"\\n\\n/// A component which marks an object as being part of the current \\\"Scene\\\", it will be removed when\\n\\n/// the scene changes.\\n\\n#[derive(Default)]\\n\\npub struct InScene;\\n\\nimpl Component for InScene { type Storage = NullStorage<Self>; }\\n\\n\\n\\n/// A component which marks an object as deleted. Will be cleaned up at the end of the current\\n\\n/// dispatcher run before the next call to maintain.\\n\\n/// This is useful because Entities.delete(ent) does not apply until the next call to maintain, but\\n\\n/// there's no way to query for deleted entities. If systems want to delete entities early and let\\n\\n/// other systems see that the entities are meant to be deleted before the next call to maintain,\\n\\n/// they can use this.\\n\\n#[derive(Default)]\\n\\npub struct Deleted;\\n\\nimpl Component for Deleted { type Storage = NullStorage<Self>; }\\n\",\n \"file_path\": \"scene_management/src/components.rs\",\n \"rank\": 72,\n \"score\": 34817.78577376029\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::{Component, NullStorage, World};\\n\\n\\n\\npub(crate) fn register_all(world: &mut World) {\\n\\n world.register::<InScene>();\\n\\n world.register::<Deleted>();\\n\\n}\\n\",\n \"file_path\": \"scene_management/src/components.rs\",\n \"rank\": 73,\n \"score\": 34813.041379570015\n },\n {\n \"content\": \"\\n\\nuse crate::components::{InScene, Deleted};\\n\\n\\n\\n/// Removes all entities in the current scene.\\n\\npub(crate) struct ClearCurrentScene;\\n\\nimpl<'a> System<'a> for ClearCurrentScene {\\n\\n type SystemData = (\\n\\n Entities<'a>,\\n\\n ReadStorage<'a, InScene>,\\n\\n );\\n\\n\\n\\n fn run(&mut self, (entities, in_scene): Self::SystemData) {\\n\\n for (entity, _) in (&*entities, &in_scene).join() {\\n\\n entities.delete(entity).unwrap();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Removes all entities that have the Deleted component. Can be added to a world to support\\n\\n/// deleting by adding the delete component (allowing other systems in the same dispatch run to\\n\",\n \"file_path\": \"scene_management/src/systems.rs\",\n \"rank\": 74,\n \"score\": 34603.835650432\n },\n {\n \"content\": \"/// determine that those entities are deleted).\\n\\npub struct DeleteSystem;\\n\\nimpl<'a> System<'a> for DeleteSystem {\\n\\n type SystemData = (\\n\\n Entities<'a>,\\n\\n ReadStorage<'a, Deleted>,\\n\\n );\\n\\n\\n\\n fn run(&mut self, (entities, deleted): Self::SystemData) {\\n\\n for (ent, _) in (&*entities, &deleted).join() {\\n\\n entities.delete(ent).unwrap();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"scene_management/src/systems.rs\",\n \"rank\": 75,\n \"score\": 34596.665956496276\n },\n {\n \"content\": \"// Copyright 2018 Google LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse specs::{\\n\\n Entities,\\n\\n Join,\\n\\n ReadStorage,\\n\\n System,\\n\\n};\\n\",\n \"file_path\": \"scene_management/src/systems.rs\",\n \"rank\": 76,\n \"score\": 34591.761374241374\n },\n {\n \"content\": \"/// Starts automatic background pruning of scenarios. Returns a handle that can be used to shutdown\\n\\n/// background pruning.\\n\\npub fn prune_scenarios<S>(interval: Duration, number_to_keep: u64, storage: S) -> ShutdownPrune \\n\\nwhere S: Storage + Send + 'static\\n\\n{\\n\\n let (send, recv) = mpsc::channel();\\n\\n let handle = thread::spawn(move || {\\n\\n let mut storage = storage;\\n\\n loop {\\n\\n match recv.recv() {\\n\\n Ok(Action::Tick) => {\\n\\n info!(\\\"Pruning scenarios\\\");\\n\\n match storage.keep_top_scenarios_by_score(number_to_keep) {\\n\\n Ok(num_pruned) => info!(\\\"Pruned {} scenarios\\\", num_pruned),\\n\\n Err(err) => error!(\\\"Falied to prune scenarios: {}\\\", err),\\n\\n }\\n\\n },\\n\\n Ok(Action::Shutdown) => {\\n\\n info!(\\\"Sending final prune and shutting down.\\\");\\n\\n match storage.keep_top_scenarios_by_score(number_to_keep) {\\n\\n Ok(num_pruned) => info!(\\\"Pruned {} scenarios\\\", num_pruned),\\n\\n Err(err) => error!(\\\"Falied to prune scenarios: {}\\\", err),\\n\",\n \"file_path\": \"saver_genetic_orbits/src/pruner.rs\",\n \"rank\": 96,\n \"score\": 33686.847505799386\n },\n {\n \"content\": \"/// Every `interval` send `value` into the given channel. Stops sending only when the channel is\\n\\n/// closed.\\n\\npub fn interval<T: Clone + Send + 'static>(interval: Duration, chan: Sender<T>, value: T) {\\n\\n thread::spawn(move || {\\n\\n loop {\\n\\n thread::sleep(interval);\\n\\n match chan.send(value.clone()) {\\n\\n Ok(()) => {},\\n\\n Err(_) => break,\\n\\n };\\n\\n }\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"saver_genetic_orbits/src/timer.rs\",\n \"rank\": 97,\n \"score\": 32287.61764569558\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[cfg(feature = \\\"graphical\\\")]\\n\\npub(crate) mod graphical_components {\\n\\n use rand::{Rng, distributions::{Distribution, Uniform}};\\n\\n use sfml::{graphics::Color, system::Vector2f};\\n\\n use specs::world::LazyBuilder;\\n\\n\\n\\n use xsecurelock_saver::engine::components::draw::{DrawColor, DrawShape, ShapeType};\\n\\n\\n\\n pub(super) fn add_graphical_components<'a, R: Rng>(\\n\\n radius: f32, rng: &mut R, builder: LazyBuilder<'a>,\\n\\n ) -> LazyBuilder<'a> {\\n\\n let color = generate_random_color(rng);\\n\\n builder.with(DrawColor {\\n\\n fill_color: color,\\n\\n outline_color: color,\\n\\n outline_thickness: 0.,\\n\\n })\\n\\n .with(DrawShape {\\n\",\n \"file_path\": \"saver_genetic_orbits/src/worldgenerator/mod.rs\",\n \"rank\": 98,\n \"score\": 30981.231145370915\n },\n {\n \"content\": \"\\n\\nmod scoring_function;\\n\\n\\n\\n#[cfg(feature = \\\"graphical\\\")]\\n\\nmod area_scaling {\\n\\n use specs::Read;\\n\\n use xsecurelock_saver::engine::resources::draw::View;\\n\\n\\n\\n pub(super) type AreaScalingData<'a> = Read<'a, View>;\\n\\n\\n\\n pub(super) fn get_aspect<'a>(view: &AreaScalingData<'a>) -> f32 {\\n\\n // x / y = w / w_0; w_0 * x / y = w\\n\\n view.size.x / view.size.y\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(not(feature = \\\"graphical\\\"))]\\n\\nmod area_scaling {\\n\\n pub(super) type AreaScalingData<'a> = ();\\n\\n\\n\",\n \"file_path\": \"saver_genetic_orbits/src/statustracker/mod.rs\",\n \"rank\": 99,\n \"score\": 30973.765835316488\n }\n]","isConversational":false}}},{"rowIdx":1989,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/clock_control/config.rs"},"repo_name":{"kind":"string","value":"reitermarkus/esp32-hal"},"commit":{"kind":"string","value":"95c7596c78a8e380b858d34f4f0ad1170a5b259a"},"file_code":{"kind":"string","value":"use super::Error;\nuse crate::prelude::*;\nuse core::fmt;\n\nuse super::{\n dfs, CPUSource, ClockControlConfig, FastRTCSource, SlowRTCSource, CLOCK_CONTROL,\n CLOCK_CONTROL_MUTEX,\n};\n\nimpl<'a> super::ClockControlConfig {\n \n \n\n \n pub fn cpu_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency }\n }\n\n \n pub fn apb_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().apb_frequency }\n }\n\n \n pub fn cpu_frequency_default(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency_default }\n }\n\n \n pub fn cpu_frequency_locked(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency_locked }\n }\n\n \n pub fn cpu_frequency_apb_locked(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency_apb_locked }\n }\n\n \n pub fn apb_frequency_apb_locked(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().apb_frequency_apb_locked }\n }\n\n \n pub fn is_ref_clock_stable(&self) -> bool {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().ref_clock_stable }\n }\n\n \n pub fn ref_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().ref_frequency }\n }\n\n \n pub fn slow_rtc_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().slow_rtc_frequency }\n }\n\n \n pub fn fast_rtc_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().fast_rtc_frequency }\n }\n\n \n pub fn apll_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().apll_frequency }\n }\n\n \n pub fn pll_d2_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().pll_d2_frequency }\n }\n\n \n pub fn xtal_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().xtal_frequency }\n }\n\n \n pub fn xtal32k_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().xtal32k_frequency }\n }\n\n \n pub fn pll_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().pll_frequency }\n }\n\n \n pub fn rtc8m_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().rtc8m_frequency }\n }\n\n \n pub fn rtc8md256_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().rtc8md256_frequency }\n }\n\n \n pub fn rtc_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().rtc_frequency }\n }\n\n \n pub fn cpu_source(&self) -> CPUSource {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_source }\n }\n\n \n pub fn slow_rtc_source(&self) -> SlowRTCSource {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().slow_rtc_source }\n }\n\n \n pub fn fast_rtc_source(&self) -> FastRTCSource {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().fast_rtc_source }\n }\n\n \n \n\n \n pub fn lock_cpu_frequency(&self) -> dfs::LockCPU {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_cpu_frequency() }\n }\n\n \n pub fn lock_apb_frequency(&self) -> dfs::LockAPB {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_apb_frequency() }\n }\n\n \n pub fn lock_awake(&self) -> dfs::LockAwake {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_awake() }\n }\n\n \n pub fn lock_plld2(&self) -> dfs::LockPllD2 {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_plld2() }\n }\n\n \n \n \n \n \n pub fn add_callback<F>(&self, f: &'static F) -> Result<(), Error>\n where\n F: Fn(),\n {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().add_callback(f) }\n }\n\n \n pub fn get_lock_count(&self) -> dfs::Locks {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().get_lock_count() }\n }\n\n \n\n \n pub unsafe fn park_core(&mut self, core: crate::Core) {\n (&CLOCK_CONTROL_MUTEX).lock(|_| {\n CLOCK_CONTROL.as_mut().unwrap().park_core(core);\n })\n }\n\n \n \n \n pub fn unpark_core(&mut self, core: crate::Core) {\n (&CLOCK_CONTROL_MUTEX)\n .lock(|_| unsafe { CLOCK_CONTROL.as_mut().unwrap().unpark_core(core) })\n }\n\n \n \n \n pub fn start_app_core(&mut self, entry: fn() -> !) -> Result<(), Error> {\n (&CLOCK_CONTROL_MUTEX)\n .lock(|_| unsafe { CLOCK_CONTROL.as_mut().unwrap().start_app_core(entry) })\n }\n\n \n\n \n \n \n \n pub fn rtc_tick_count(&self) -> TicksU64 {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().rtc_tick_count() }\n }\n\n \n \n \n \n pub fn rtc_nanoseconds(&self) -> NanoSecondsU64 {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().rtc_nanoseconds() }\n }\n}\n\nimpl fmt::Debug for ClockControlConfig {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().fmt(f) }\n }\n}\n"},"prefix":{"kind":"string","value":"use super::Error;\nuse crate::prelude::*;\nuse core::fmt;\n\nuse super::{\n dfs, CPUSource, ClockControlConfig, FastRTCSource, SlowRTCSource, CLOCK_CONTROL,\n CLOCK_CONTROL_MUTEX,\n};\n\nimpl<'a> super::ClockControlConfig {\n \n \n\n \n pub fn cpu_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency }\n }\n\n \n pub fn apb_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().apb_frequency }\n }\n\n \n pub fn cpu_frequency_default(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency_default }\n }\n\n \n pub fn cpu_frequency_locked(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency_locked }\n }\n\n \n pub fn cpu_frequency_apb_locked(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_frequency_apb_locked }\n }\n\n \n pub fn apb_frequency_apb_locked(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().apb_frequency_apb_locked }\n }\n\n \n pub fn is_ref_clock_stable(&self) -> bool {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().ref_clock_stable }\n }\n\n \n pub fn ref_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().ref_frequency }\n }\n\n \n pub fn slow_rtc_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().slow_rtc_frequency }\n }\n\n \n pub fn fast_rtc_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().fast_rtc_frequency }\n }\n\n \n pub fn apll_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().apll_frequency }\n }\n\n \n pub fn pll_d2_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().pll_d2_frequency }\n }\n\n \n pub fn xtal_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().xtal_frequency }\n }\n\n \n pub fn xtal32k_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().xtal32k_frequency }\n }\n\n \n pub fn pll_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().pll_frequency }\n }\n\n \n pub fn rtc8m_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().rtc8m_frequency }\n }\n\n \n pub fn rtc8md256_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().rtc8md256_frequency }\n }\n\n \n pub fn rtc_frequency(&self) -> Hertz {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().rtc_frequency }\n }\n\n \n pub fn cpu_source(&self) -> CPUSource {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().cpu_source }\n }\n\n \n pub fn slow_rtc_source(&self) -> SlowRTCSource {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().slow_rtc_source }\n }\n\n \n pub fn fast_rtc_source(&self) -> FastRTCSource {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().fast_rtc_source }\n }\n\n \n \n\n \n pub fn lock_cpu_frequency(&self) -> dfs::LockCPU {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_cpu_frequency() }\n }\n\n \n pub fn lock_apb_frequency(&self) -> dfs::LockAPB {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_apb_frequency() }\n }\n\n \n pub fn lock_awake(&self) -> dfs::LockAwake {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_awake() }\n }\n\n \n pub fn lock_plld2(&self) -> dfs::LockPllD2 {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().lock_plld2() }\n }\n\n \n \n \n \n \n pub fn add_callback<F>(&self, f: &'static F) -> Result<(), Error>\n "},"suffix":{"kind":"string","value":"{ CLOCK_CONTROL.as_mut().unwrap().rtc_nanoseconds() }\n }\n}\n\nimpl fmt::Debug for ClockControlConfig {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n unsafe { CLOCK_CONTROL.as_ref().unwrap().fmt(f) }\n }\n}\n"},"middle":{"kind":"string","value":" where\n F: Fn(),\n {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().add_callback(f) }\n }\n\n \n pub fn get_lock_count(&self) -> dfs::Locks {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().get_lock_count() }\n }\n\n \n\n \n pub unsafe fn park_core(&mut self, core: crate::Core) {\n (&CLOCK_CONTROL_MUTEX).lock(|_| {\n CLOCK_CONTROL.as_mut().unwrap().park_core(core);\n })\n }\n\n \n \n \n pub fn unpark_core(&mut self, core: crate::Core) {\n (&CLOCK_CONTROL_MUTEX)\n .lock(|_| unsafe { CLOCK_CONTROL.as_mut().unwrap().unpark_core(core) })\n }\n\n \n \n \n pub fn start_app_core(&mut self, entry: fn() -> !) -> Result<(), Error> {\n (&CLOCK_CONTROL_MUTEX)\n .lock(|_| unsafe { CLOCK_CONTROL.as_mut().unwrap().start_app_core(entry) })\n }\n\n \n\n \n \n \n \n pub fn rtc_tick_count(&self) -> TicksU64 {\n unsafe { CLOCK_CONTROL.as_mut().unwrap().rtc_tick_count() }\n }\n\n \n \n \n \n pub fn rtc_nanoseconds(&self) -> NanoSecondsU64 {\n unsafe "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#[ram]\n\npub fn enable(interrupt: Interrupt) -> Result<(), Error> {\n\n match interrupt_to_cpu_interrupt(interrupt) {\n\n Ok(cpu_interrupt) => {\n\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\n\n return Ok(());\n\n }\n\n Err(_) => enable_with_priority(crate::get_core(), interrupt, InterruptLevel(1)),\n\n }\n\n}\n\n\n\n/// Disable interrupt\n","file_path":"src/interrupt.rs","rank":0,"score":192054.05905088485},{"content":"#[ram]\n\npub fn disable(interrupt: Interrupt) -> Result<(), Error> {\n\n match interrupt_to_cpu_interrupt(interrupt) {\n\n Ok(cpu_interrupt) => {\n\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\n\n return Ok(());\n\n }\n\n Err(_) => enable_with_priority(crate::get_core(), interrupt, InterruptLevel(0)),\n\n }\n\n}\n\n\n\n/// Trigger a (cross-)core interrupt\n\n///\n\n/// Valid interrupts are FROM_CPU_INTR[0-3],\n\n/// INTERNAL_SOFTWARE_LEVEL_1_INTR and INTERNAL_SOFTWARE_LEVEL_3_INTR.\n","file_path":"src/interrupt.rs","rank":1,"score":192054.05905088485},{"content":"#[ram]\n\npub fn clear_software_interrupt(interrupt: Interrupt) -> Result<(), Error> {\n\n unsafe {\n\n match interrupt {\n\n FROM_CPU_INTR0 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_0\n\n .write(|w| w.cpu_intr_from_cpu_0().clear_bit()),\n\n FROM_CPU_INTR1 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_1\n\n .write(|w| w.cpu_intr_from_cpu_1().clear_bit()),\n\n FROM_CPU_INTR2 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_2\n\n .write(|w| w.cpu_intr_from_cpu_2().clear_bit()),\n\n FROM_CPU_INTR3 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_3\n\n .write(|w| w.cpu_intr_from_cpu_3().clear_bit()),\n\n INTERNAL_SOFTWARE_LEVEL_1_INTR | INTERNAL_SOFTWARE_LEVEL_3_INTR => {\n\n interrupt::clear(1 << interrupt_to_cpu_interrupt(interrupt)?.0)\n\n }\n\n\n\n _ => return Err(Error::InvalidInterrupt),\n\n }\n\n };\n\n Ok(())\n\n}\n","file_path":"src/interrupt.rs","rank":2,"score":183729.64733641598},{"content":"#[ram]\n\npub fn set_software_interrupt(interrupt: Interrupt) -> Result<(), Error> {\n\n unsafe {\n\n match interrupt {\n\n FROM_CPU_INTR0 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_0\n\n .write(|w| w.cpu_intr_from_cpu_0().set_bit()),\n\n FROM_CPU_INTR1 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_1\n\n .write(|w| w.cpu_intr_from_cpu_1().set_bit()),\n\n FROM_CPU_INTR2 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_2\n\n .write(|w| w.cpu_intr_from_cpu_2().set_bit()),\n\n FROM_CPU_INTR3 => (*DPORT::ptr())\n\n .cpu_intr_from_cpu_3\n\n .write(|w| w.cpu_intr_from_cpu_3().set_bit()),\n\n INTERNAL_SOFTWARE_LEVEL_1_INTR | INTERNAL_SOFTWARE_LEVEL_3_INTR => {\n\n interrupt::set(1 << interrupt_to_cpu_interrupt(interrupt)?.0)\n\n }\n\n\n\n _ => return Err(Error::InvalidInterrupt),\n\n }\n\n };\n\n Ok(())\n\n}\n\n\n\n/// Clear a (cross-)core interrupt\n\n///\n\n/// Valid interrupts are FROM_CPU_INTR[0-3],\n\n/// INTERNAL_SOFTWARE_LEVEL_1_INTR and INTERNAL_SOFTWARE_LEVEL_3_INTR.\n","file_path":"src/interrupt.rs","rank":3,"score":183729.64733641595},{"content":"#[ram]\n\nfn interrupt_to_cpu_interrupt(interrupt: target::Interrupt) -> Result<CPUInterrupt, Error> {\n\n match interrupt {\n\n target::Interrupt::INTERNAL_TIMER0_INTR => Ok(CPUInterrupt(6)),\n\n target::Interrupt::INTERNAL_SOFTWARE_LEVEL_1_INTR => Ok(CPUInterrupt(7)),\n\n target::Interrupt::INTERNAL_PROFILING_INTR => Ok(CPUInterrupt(11)),\n\n target::Interrupt::INTERNAL_TIMER1_INTR => Ok(CPUInterrupt(15)),\n\n target::Interrupt::INTERNAL_TIMER2_INTR => Ok(CPUInterrupt(16)),\n\n target::Interrupt::INTERNAL_SOFTWARE_LEVEL_3_INTR => Ok(CPUInterrupt(29)),\n\n _ => Err(Error::InvalidCPUInterrupt),\n\n }\n\n}\n\n\n","file_path":"src/interrupt.rs","rank":4,"score":128384.43938090441},{"content":"fn cpu_interrupt_to_interrupt(cpu_interrupt: CPUInterrupt) -> Result<target::Interrupt, Error> {\n\n #[ram]\n\n const CPU_INTERRUPT_TO_INTERRUPT: [Option<target::Interrupt>; 32] = [\n\n None,\n\n None,\n\n None,\n\n None,\n\n None,\n\n None,\n\n Some(target::Interrupt::INTERNAL_TIMER0_INTR),\n\n Some(target::Interrupt::INTERNAL_SOFTWARE_LEVEL_1_INTR),\n\n None,\n\n None,\n\n None,\n\n Some(target::Interrupt::INTERNAL_PROFILING_INTR),\n\n None,\n\n None,\n\n None,\n\n Some(target::Interrupt::INTERNAL_TIMER1_INTR),\n\n Some(target::Interrupt::INTERNAL_TIMER2_INTR),\n","file_path":"src/interrupt.rs","rank":5,"score":125934.51292517666},{"content":"#[ram]\n\npub fn enable_with_priority(\n\n core: crate::Core,\n\n interrupt: Interrupt,\n\n level: InterruptLevel,\n\n) -> Result<(), Error> {\n\n match interrupt_to_cpu_interrupt(interrupt) {\n\n Ok(cpu_interrupt) => {\n\n if core != crate::get_core() {\n\n return Err(Error::InvalidCore);\n\n }\n\n if level == InterruptLevel(0) {\n\n interrupt::disable_mask(1 << cpu_interrupt.0);\n\n return Ok(());\n\n } else if level == cpu_interrupt_to_level(cpu_interrupt) {\n\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\n\n return Ok(());\n\n } else {\n\n return Err(Error::InvalidInterruptLevel);\n\n }\n\n }\n","file_path":"src/interrupt.rs","rank":6,"score":112446.87560929784},{"content":"pub trait Frequency: Quantity + Into<Hertz> {}\n","file_path":"src/units.rs","rank":7,"score":106204.26039013712},{"content":"pub fn get_other_core() -> Core {\n\n match get_core() {\n\n Core::PRO => Core::APP,\n\n Core::APP => Core::PRO,\n\n }\n\n}\n","file_path":"src/lib.rs","rank":8,"score":105894.53500167752},{"content":"pub fn get_core() -> Core {\n\n match ((xtensa_lx6::get_processor_id() >> 13) & 1) != 0 {\n\n false => Core::PRO,\n\n true => Core::APP,\n\n }\n\n}\n\n\n","file_path":"src/lib.rs","rank":9,"score":105894.53500167752},{"content":"/// Get the size of the external RAM (also called PSRAM).\n\npub fn get_size() -> usize {\n\n unsafe { EXTERNAL_RAM_SIZE.assume_init().unwrap() }\n\n}\n\n\n\n/// Initialize external RAM\n\npub(super) unsafe fn init() {\n\n EXTERNAL_RAM_SIZE = core::mem::MaybeUninit::new(Some(calculate_external_ram_size()));\n\n\n\n if &_external_heap_start as *const u32 > (&_external_ram_start as *const u32).add(get_size()) {\n\n panic!(\"External RAM too small for data\");\n\n }\n\n xtensa_lx6_rt::zero_bss(&mut _external_bss_start, &mut _external_bss_end);\n\n}\n\n\n\n/// Calculate the size of external RAM by reading and writing at defined intervals while\n\n/// thrashing the cache in between.\n\n///\n\n/// TODO: should be replaced by reading the size via SPI\n\nunsafe fn calculate_external_ram_size() -> usize {\n\n let ram_start_addr: usize = &_external_ram_start as *const u32 as usize;\n","file_path":"src/external_ram.rs","rank":10,"score":103399.74703902833},{"content":"/// cycle accurate delay using the cycle counter register\n\npub fn delay(clocks: u32) {\n\n let start = get_cycle_count();\n\n loop {\n\n if get_cycle_count().wrapping_sub(start) >= clocks {\n\n break;\n\n }\n\n }\n\n}\n","file_path":"examples/blinky.rs","rank":11,"score":102642.29101886},{"content":"#[ram]\n\nfn interrupt_is_edge(interrupt: Interrupt) -> bool {\n\n [\n\n TG0_T0_EDGE_INTR,\n\n TG0_T1_EDGE_INTR,\n\n TG0_WDT_EDGE_INTR,\n\n TG0_LACT_EDGE_INTR,\n\n TG1_T0_EDGE_INTR,\n\n TG1_T1_EDGE_INTR,\n\n TG1_WDT_EDGE_INTR,\n\n TG1_LACT_EDGE_INTR,\n\n ]\n\n .contains(&interrupt)\n\n}\n\n\n","file_path":"src/interrupt.rs","rank":12,"score":101637.19818045264},{"content":"#[ram]\n\npub fn get_interrupt_status(core: Core) -> u128 {\n\n unsafe {\n\n match core {\n\n PRO => {\n\n ((*DPORT::ptr()).pro_intr_status_0.read().bits() as u128)\n\n | ((*DPORT::ptr()).pro_intr_status_1.read().bits() as u128) << 32\n\n | ((*DPORT::ptr()).pro_intr_status_2.read().bits() as u128) << 64\n\n }\n\n APP => {\n\n ((*DPORT::ptr()).app_intr_status_0.read().bits() as u128)\n\n | ((*DPORT::ptr()).app_intr_status_1.read().bits() as u128) << 32\n\n | ((*DPORT::ptr()).app_intr_status_2.read().bits() as u128) << 64\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// Map an interrupt to a CPU interrupt\n","file_path":"src/interrupt.rs","rank":13,"score":92906.78748064135},{"content":"/// Returns `true` if `attr.path` matches `name`\n\nfn eq(attr: &Attribute, name: &str) -> bool {\n\n attr.style == AttrStyle::Outer && attr.path.is_ident(name)\n\n}\n","file_path":"procmacros/src/lib.rs","rank":14,"score":91796.2438204885},{"content":"/// Extracts `static mut` vars from the beginning of the given statements\n\nfn extract_static_muts(\n\n stmts: impl IntoIterator<Item = Stmt>,\n\n) -> Result<(Vec<ItemStatic>, Vec<Stmt>), parse::Error> {\n\n let mut istmts = stmts.into_iter();\n\n\n\n let mut seen = HashSet::new();\n\n let mut statics = vec![];\n\n let mut stmts = vec![];\n\n while let Some(stmt) = istmts.next() {\n\n match stmt {\n\n Stmt::Item(Item::Static(var)) => {\n\n if var.mutability.is_some() {\n\n if seen.contains(&var.ident) {\n\n return Err(parse::Error::new(\n\n var.ident.span(),\n\n format!(\"the name `{}` is defined multiple times\", var.ident),\n\n ));\n\n }\n\n\n\n seen.insert(var.ident.clone());\n","file_path":"procmacros/src/lib.rs","rank":15,"score":86200.59131606453},{"content":"/// Function only available once clock if frozen\n\npub fn sleep<T: Into<NanoSeconds>>(time: T) {\n\n unsafe { CLOCK_CONTROL.as_ref().unwrap().delay(time) };\n\n}\n\n\n\nimpl ClockControl {\n\n /// Create new ClockControl structure\n\n pub fn new<T: Into<Hertz> + Copy>(\n\n rtc_control: RTCCNTL,\n\n apb_control: APB_CTRL,\n\n dport_control: crate::dport::ClockControl,\n\n xtal_frequency: T,\n\n ) -> Result<Self, Error> {\n\n let mut cc = ClockControl {\n\n rtc_control,\n\n apb_control,\n\n dport_control,\n\n\n\n cpu_frequency_default: CPU_FREQ_MIN_DEFAULT,\n\n cpu_source_default: CPU_SOURCE_DEFAULT_DEFAULT,\n\n cpu_frequency_locked: CPU_FREQ_MAX_DEFAULT,\n","file_path":"src/clock_control/mod.rs","rank":16,"score":84523.71583488732},{"content":"#[proc_macro_attribute]\n\npub fn interrupt(args: TokenStream, input: TokenStream) -> TokenStream {\n\n let mut f: ItemFn = syn::parse(input).expect(\"`#[interrupt]` must be applied to a function\");\n\n\n\n let attr_args = parse_macro_input!(args as AttributeArgs);\n\n\n\n if attr_args.len() > 1 {\n\n Span::call_site()\n\n .error(\"This attribute accepts zero or 1 arguments\")\n\n .emit();\n\n }\n\n\n\n let ident = f.sig.ident.clone();\n\n let mut ident_s = &ident.clone();\n\n\n\n if attr_args.len() == 1 {\n\n match &attr_args[0] {\n\n syn::NestedMeta::Meta(Path(x)) => {\n\n ident_s = x.get_ident().unwrap();\n\n }\n\n _ => {\n","file_path":"procmacros/src/lib.rs","rank":17,"score":81175.42246386231},{"content":"#[proc_macro_attribute]\n\npub fn ram(args: TokenStream, input: TokenStream) -> TokenStream {\n\n let attr_args = parse_macro_input!(args as AttributeArgs);\n\n\n\n let RamArgs {\n\n rtc_fast,\n\n rtc_slow,\n\n external,\n\n uninitialized,\n\n zeroed,\n\n } = match FromMeta::from_list(&attr_args) {\n\n Ok(v) => v,\n\n Err(e) => {\n\n return e.write_errors().into();\n\n }\n\n };\n\n\n\n if rtc_slow && rtc_fast {\n\n Span::call_site()\n\n .error(\"Only one of rtc_slow and rtc_fast is allowed\")\n\n .emit();\n","file_path":"procmacros/src/lib.rs","rank":18,"score":81175.42246386231},{"content":"pub trait FrequencyU64: Quantity + Into<HertzU64> {}\n","file_path":"src/units.rs","rank":19,"score":79793.48291413956},{"content":"fn check_attr_whitelist(attrs: &[Attribute], caller: WhiteListCaller) -> Result<(), TokenStream> {\n\n let whitelist = &[\n\n \"doc\",\n\n \"link_section\",\n\n \"cfg\",\n\n \"allow\",\n\n \"warn\",\n\n \"deny\",\n\n \"forbid\",\n\n \"cold\",\n\n \"ram\",\n\n ];\n\n\n\n 'o: for attr in attrs {\n\n for val in whitelist {\n\n if eq(&attr, &val) {\n\n continue 'o;\n\n }\n\n }\n\n\n","file_path":"procmacros/src/lib.rs","rank":20,"score":79235.27378657463},{"content":"#[alloc_error_handler]\n\nfn alloc_error_handler(layout: core::alloc::Layout) -> ! {\n\n panic!(\n\n \"Error allocating {} bytes of memory with alignment {}\",\n\n layout.size(),\n\n layout.align()\n\n );\n\n}\n","file_path":"examples/alloc.rs","rank":21,"score":72747.21606258978},{"content":"#[alloc_error_handler]\n\nfn alloc_error_handler(layout: core::alloc::Layout) -> ! {\n\n panic!(\n\n \"Error allocating {} bytes of memory with alignment {}\",\n\n layout.size(),\n\n layout.align()\n\n );\n\n}\n","file_path":"examples/mem.rs","rank":22,"score":72747.21606258978},{"content":"fn time(output: &mut dyn core::fmt::Write, text: &str, bytes: usize, f: &dyn Fn() -> ()) {\n\n let start = get_cycle_count();\n\n for _ in 0..REPEAT {\n\n f();\n\n }\n\n let end = get_cycle_count();\n\n\n\n let time = (end - start) as f32 / ClockControlConfig {}.cpu_frequency().0 as f32;\n\n writeln!(\n\n output,\n\n \"{:>40}: {:.3}s, {:.3}KB/s\",\n\n text,\n\n time,\n\n (bytes * REPEAT) as f32 / time / 1024.0\n\n )\n\n .unwrap();\n\n}\n\n\n\nunsafe fn time_memcpy(\n\n output: &mut dyn core::fmt::Write,\n","file_path":"examples/mem.rs","rank":23,"score":61874.18749697469},{"content":"/// Trait to split the DPORT peripheral into subsets\n\npub trait Split {\n\n fn split(self) -> (DPORT, ClockControl);\n\n}\n\n\n\nimpl Split for DPORT {\n\n /// function to split the DPORT peripheral into subsets\n\n fn split(self) -> (DPORT, ClockControl) {\n\n (self, ClockControl {})\n\n }\n\n}\n","file_path":"src/dport.rs","rank":24,"score":60749.46821301036},{"content":"fn main() {\n\n // Put the linker script somewhere the linker can find it\n\n let out = &PathBuf::from(env::var_os(\"OUT_DIR\").unwrap());\n\n File::create(out.join(\"memory.x\"))\n\n .unwrap()\n\n .write_all(include_bytes!(\"memory.x\"))\n\n .unwrap();\n\n\n\n File::create(out.join(\"alias.x\"))\n\n .unwrap()\n\n .write_all(if cfg!(feature = \"all_in_ram\") {\n\n include_bytes!(\"ram.x\")\n\n } else {\n\n include_bytes!(\"rom.x\")\n\n })\n\n .unwrap();\n\n\n\n println!(\"cargo:rustc-link-search={}\", out.display());\n\n\n\n // Only re-run the build script when memory.x is changed,\n\n // instead of when any part of the source code changes.\n\n println!(\"cargo:rerun-if-changed=memory.x\");\n\n}\n","file_path":"build.rs","rank":25,"score":60033.84794080211},{"content":"/// Extension trait to split a GPIO peripheral in independent pins and registers\n\npub trait GpioExt {\n\n /// The to split the GPIO into\n\n type Parts;\n\n\n\n /// Splits the GPIO block into independent pins and registers\n\n fn split(self) -> Self::Parts;\n\n}\n\n\n\n/// Input mode (type state)\n\npub struct Input<MODE> {\n\n _mode: PhantomData<MODE>,\n\n}\n\n\n\n/// Floating input (type state)\n\npub struct Floating;\n\n\n\n/// Pulled down input (type state)\n\npub struct PullDown;\n\n\n\n/// Pulled up input (type state)\n","file_path":"src/gpio.rs","rank":26,"score":59257.927779115686},{"content":"/// Get heap sizes\n\npub trait AllocatorSize {\n\n /// Get total heap size\n\n fn size(&self) -> usize;\n\n /// Get used heap size\n\n fn used(&self) -> usize;\n\n /// Get free heap size\n\n fn free(&self) -> usize;\n\n}\n\n\n\nunsafe trait GlobalAllocSize: GlobalAlloc + AllocatorSize {}\n\n\n\n#[derive(Copy, Clone)]\n\n#[doc(hidden)]\n\npub struct Allocator {\n\n allocator: &'static (dyn GlobalAllocSize + 'static),\n\n}\n\n\n\nunsafe impl Sync for Allocator {}\n\n\n\nimpl Allocator {\n","file_path":"src/alloc.rs","rank":27,"score":59257.927779115686},{"content":"#[entry]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timers on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // setup clocks & watchdog\n\n let mut clock_control = ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n","file_path":"examples/mem.rs","rank":28,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timer on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n\n .unwrap();\n","file_path":"examples/adc.rs","rank":29,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timer on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n\n .unwrap();\n","file_path":"examples/serial.rs","rank":30,"score":58281.79524794819},{"content":"#[entry]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().unwrap();\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n\n .unwrap();\n\n\n\n let (clkcntrl_config, mut watchdog_rtc) = clkcntrl.freeze().unwrap();\n\n let (mut timer0, mut timer1, mut timer2, mut watchdog0) = Timer::new(dp.TIMG0, clkcntrl_config);\n\n let (mut timer3, mut timer4, mut timer5, mut watchdog1) = Timer::new(dp.TIMG1, clkcntrl_config);\n\n\n\n watchdog_rtc.disable();\n\n watchdog0.disable();\n\n\n","file_path":"examples/timer.rs","rank":31,"score":58281.79524794819},{"content":"#[entry]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().unwrap();\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timers on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // setup clocks & watchdog\n\n let mut clock_control = ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n","file_path":"examples/exception.rs","rank":32,"score":58281.79524794819},{"content":"#[exception]\n\n#[ram]\n\nfn other_exception(\n\n cause: xtensa_lx6_rt::exception::ExceptionCause,\n\n frame: xtensa_lx6_rt::exception::Context,\n\n) {\n\n (&TX).lock(|tx| {\n\n let tx = tx.as_mut().unwrap();\n\n writeln!(tx, \"Exception {:?}, {:08x?}\", cause, frame).unwrap();\n\n });\n\n loop {}\n\n}\n\n\n","file_path":"examples/exception.rs","rank":33,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timer on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n\n .unwrap();\n","file_path":"examples/hall.rs","rank":34,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n let (_dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timer on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n\n .unwrap();\n","file_path":"examples/dac.rs","rank":35,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut rtccntl = dp.RTCCNTL;\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the wdt's on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n disable_rtc_wdt(&mut rtccntl);\n\n\n\n let pins = dp.GPIO.split();\n\n let mut led = pins.gpio2.into_open_drain_output();\n\n\n\n loop {\n\n led.set_high().unwrap();\n\n delay(CORE_HZ);\n\n led.set_low().unwrap();\n\n delay(CORE_HZ);\n\n }\n\n}\n\n\n","file_path":"examples/blinky.rs","rank":36,"score":58281.79524794819},{"content":"#[entry]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timers on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // setup clocks & watchdog\n\n let clock_control = ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n","file_path":"examples/ram.rs","rank":37,"score":58281.79524794819},{"content":"#[entry]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timers on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // setup clocks & watchdog\n\n let clock_control = ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n","file_path":"examples/alloc.rs","rank":38,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timers on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // setup clocks & watchdog\n\n let mut clock_control = ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n","file_path":"examples/rtccntl.rs","rank":39,"score":58281.79524794819},{"content":"#[no_mangle]\n\nfn main() -> ! {\n\n let dp = target::Peripherals::take().expect(\"Failed to obtain Peripherals\");\n\n\n\n let mut timg0 = dp.TIMG0;\n\n let mut timg1 = dp.TIMG1;\n\n\n\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\n\n // openocd disables the watchdog timers on halt\n\n // we will do it manually on startup\n\n disable_timg_wdts(&mut timg0, &mut timg1);\n\n\n\n let (mut dport, dport_clock_control) = dp.DPORT.split();\n\n\n\n // setup clocks & watchdog\n\n let mut clock_control = ClockControl::new(\n\n dp.RTCCNTL,\n\n dp.APB_CTRL,\n\n dport_clock_control,\n\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\n\n )\n","file_path":"examples/multicore.rs","rank":40,"score":58281.79524794819},{"content":"#[doc(hidden)]\n\npub trait TimerInst {}\n\n\n","file_path":"src/timer/mod.rs","rank":41,"score":57888.79339906647},{"content":"pub trait SensExt {\n\n fn split(self) -> AvailableAnalog;\n\n}\n\n\n\nimpl SensExt for SENS {\n\n fn split(self) -> AvailableAnalog {\n\n AvailableAnalog {\n\n adc1: ADC1 {\n\n _private: PhantomData,\n\n },\n\n adc2: ADC2 {\n\n _private: PhantomData,\n\n },\n\n dac1: DAC1 {\n\n _private: PhantomData,\n\n },\n\n dac2: DAC2 {\n\n _private: PhantomData,\n\n },\n\n }\n\n }\n\n}\n","file_path":"src/analog/mod.rs","rank":42,"score":57888.79339906647},{"content":"pub trait Pins<UART> {}\n","file_path":"src/serial.rs","rank":43,"score":57114.985337013204},{"content":"pub trait Quantity: Sized {}\n","file_path":"src/units.rs","rank":44,"score":57114.985337013204},{"content":"fn cpu1_start() -> ! {\n\n let mut x: u32 = 0;\n\n let mut prev_ccount = 0;\n\n\n\n (&TX).lock(|tx| {\n\n writeln!(\n\n tx.as_mut().unwrap(),\n\n \"Stack Pointer Core 1: {:08x?}\",\n\n get_stack_pointer()\n\n )\n\n .unwrap()\n\n });\n\n\n\n loop {\n\n let cycles = ClockControlConfig {}.cpu_frequency() / BLINK_HZ;\n\n let start = get_cycle_count();\n\n let mut loop_count = 0;\n\n while get_cycle_count().wrapping_sub(start) < cycles {\n\n loop_count += 1;\n\n }\n\n\n\n print_info(x, loop_count, &mut prev_ccount);\n\n x = x.wrapping_add(1);\n\n }\n\n}\n\n\n","file_path":"examples/multicore.rs","rank":45,"score":56686.38302763419},{"content":"#[interrupt]\n\nfn FROM_CPU_INTR3() {\n\n locked_print(\"FROM_CPU_INTR3\");\n\n clear_software_interrupt(Interrupt::FROM_CPU_INTR3).unwrap();\n\n}\n\n\n","file_path":"examples/exception.rs","rank":46,"score":56686.38302763419},{"content":"#[interrupt(INTERNAL_SOFTWARE_LEVEL_3_INTR)]\n\nfn software_level_3() {\n\n locked_print(\"INTERNAL_SOFTWARE_LEVEL_3_INTR\");\n\n clear_software_interrupt(Interrupt::FROM_CPU_INTR3).unwrap();\n\n}\n\n\n","file_path":"examples/exception.rs","rank":47,"score":56686.38302763419},{"content":"#[ram]\n\nfn map_interrupt(\n\n core: crate::Core,\n\n interrupt: Interrupt,\n\n cpu_interrupt: CPUInterrupt,\n\n) -> Result<(), Error> {\n\n if cpu_interrupt.0 >= 32 {\n\n return Err(Error::InvalidCPUInterrupt);\n\n }\n\n if interrupt.nr() >= Interrupt::INTERNAL_TIMER0_INTR.nr() {\n\n return Err(Error::InternalInterruptsCannotBeMapped);\n\n }\n\n unsafe {\n\n let base_reg = match core {\n\n crate::Core::PRO => (*DPORT::ptr()).pro_mac_intr_map.as_ptr(),\n\n crate::Core::APP => (*DPORT::ptr()).app_mac_intr_map.as_ptr(),\n\n };\n\n\n\n let reg = base_reg.add(interrupt.nr() as usize);\n\n *reg = cpu_interrupt.0 as u32;\n\n };\n","file_path":"src/interrupt.rs","rank":48,"score":56686.38302763419},{"content":"#[interrupt]\n\nfn FROM_CPU_INTR0() {\n\n locked_print(\"FROM_CPU_INTR0\");\n\n clear_software_interrupt(Interrupt::FROM_CPU_INTR0).unwrap();\n\n}\n\n\n","file_path":"examples/exception.rs","rank":49,"score":56686.38302763419},{"content":"#[interrupt]\n\nfn FROM_CPU_INTR2() {\n\n locked_print(\"FROM_CPU_INTR2\");\n\n clear_software_interrupt(Interrupt::FROM_CPU_INTR2).unwrap();\n\n}\n\n\n","file_path":"examples/exception.rs","rank":50,"score":56686.38302763419},{"content":"#[interrupt(INTERNAL_SOFTWARE_LEVEL_1_INTR)]\n\nfn random_name() {\n\n locked_print(\"INTERNAL_SOFTWARE_LEVEL_1_INTR\");\n\n clear_software_interrupt(Interrupt::FROM_CPU_INTR3).unwrap();\n\n}\n\n\n","file_path":"examples/exception.rs","rank":51,"score":56686.38302763419},{"content":"#[interrupt]\n\nfn FROM_CPU_INTR1() {\n\n locked_print(\"Start FROM_CPU_INTR1\");\n\n interrupt::set_software_interrupt(Interrupt::FROM_CPU_INTR0).unwrap();\n\n interrupt::set_software_interrupt(Interrupt::FROM_CPU_INTR2).unwrap();\n\n locked_print(\"End FROM_CPU_INTR1\");\n\n clear_software_interrupt(Interrupt::FROM_CPU_INTR1).unwrap();\n\n}\n\n\n","file_path":"examples/exception.rs","rank":52,"score":56686.38302763419},{"content":"pub trait PinRx<UART> {}\n\n\n\nimpl<UART, TX, RX> Pins<UART> for (TX, RX)\n\nwhere\n\n TX: PinTx<UART>,\n\n RX: PinRx<UART>,\n\n{\n\n}\n\n\n\n/// A filler type for when the Tx pin is unnecessary\n\npub struct NoTx;\n\n/// A filler type for when the Rx pin is unnecessary\n\npub struct NoRx;\n\n\n\nimpl PinTx<UART0> for NoTx {}\n\nimpl PinRx<UART0> for NoRx {}\n\nimpl PinTx<UART1> for NoTx {}\n\nimpl PinRx<UART1> for NoRx {}\n\nimpl PinTx<UART2> for NoTx {}\n\nimpl PinRx<UART2> for NoRx {}\n","file_path":"src/serial.rs","rank":53,"score":55745.85095696399},{"content":"pub trait PinTx<UART> {}\n","file_path":"src/serial.rs","rank":54,"score":55745.85095696399},{"content":"#[derive(Eq, PartialEq, Ord, PartialOrd, Clone, Copy, Hash, Default)]\n\nstruct CPUInterrupt(pub usize);\n\n\n","file_path":"src/interrupt.rs","rank":55,"score":55745.85095696399},{"content":"// TODO:\n\n// - check if all called function are in ram\n\n// - check if all used data is in ram\n\n// - check that no constants are use in the function (these cannot be forced to ram)\n\nfn check_ram_function(_func: &syn::ItemFn) {\n\n // eprintln!(\"{:?}\", func);\n\n}\n\n\n","file_path":"procmacros/src/lib.rs","rank":56,"score":54654.596820497194},{"content":"#[interrupt]\n\nfn TG1_WDT_EDGE_INTR() {\n\n locked_print(\" TG1_WDT_EDGE_INTR\");\n\n}\n\n\n","file_path":"examples/timer.rs","rank":57,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG1_T0_LEVEL_INTR() {\n\n locked_print(\" TG1_T0_LEVEL_INTR\");\n\n locked_clear(&TIMER3);\n\n}\n\n\n","file_path":"examples/timer.rs","rank":58,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG0_T0_LEVEL_INTR() {\n\n locked_print(\" TG0_T0_LEVEL_INTR\");\n\n locked_clear(&TIMER0);\n\n}\n\n\n","file_path":"examples/timer.rs","rank":59,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG1_WDT_LEVEL_INTR() {\n\n locked_print(\" TG1_WDT_LEVEL_INTR\");\n\n\n\n (&WATCHDOG1).lock(|watchdog1| {\n\n let watchdog1 = watchdog1.as_mut().unwrap();\n\n watchdog1.clear_interrupt();\n\n });\n\n}\n\n\n","file_path":"examples/timer.rs","rank":60,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG0_T0_EDGE_INTR() {\n\n locked_print(\" TG0_T0_EDGE_INTR\");\n\n}\n\n\n","file_path":"examples/timer.rs","rank":61,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG1_LACT_LEVEL_INTR() {\n\n locked_print(\" TG1_LACT_LEVEL_INTR\");\n\n locked_clear(&TIMER5);\n\n}\n\n\n","file_path":"examples/timer.rs","rank":62,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG1_T1_LEVEL_INTR() {\n\n locked_print(\" TG1_T1_LEVEL_INTR\");\n\n locked_clear(&TIMER4);\n\n}\n\n\n","file_path":"examples/timer.rs","rank":63,"score":53888.35004550296},{"content":"#[ram]\n\nfn interrupt_level_to_cpu_interrupt(\n\n interrupt_level: InterruptLevel,\n\n edge: bool,\n\n) -> Result<CPUInterrupt, Error> {\n\n #[ram]\n\n const INTERRUPT_LEVEL_TO_CPU_INTERRUPT_EDGE: [Option<CPUInterrupt>; 8] = [\n\n Some(CPUInterrupt(6)), // Disable (assign to internal interrupt)\n\n Some(CPUInterrupt(10)), // Level 1 edge triggered\n\n None, // Level 2 edge triggered not supported\n\n Some(CPUInterrupt(22)), // Level 3 edge triggered\n\n Some(CPUInterrupt(28)), // Level 4 edge triggered\n\n None, // Level 5 edge triggered not supported\n\n None, // Level 6 = Debug not supported for peripherals\n\n Some(CPUInterrupt(14)), // Level 7 = NMI edge triggered\n\n ];\n\n #[ram]\n\n const INTERRUPT_LEVEL_TO_CPU_INTERRUPT_LEVEL: [Option<CPUInterrupt>; 8] = [\n\n Some(CPUInterrupt(6)), // Disable (assign to internal interrupt)\n\n Some(CPUInterrupt(0)), // Level 1 level triggered\n\n Some(CPUInterrupt(19)), // Level 2 level triggered\n","file_path":"src/interrupt.rs","rank":64,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG0_LACT_EDGE_INTR() {\n\n locked_print(\" TG0_LACT_EDGE_INTR\");\n\n}\n\n\n","file_path":"examples/timer.rs","rank":65,"score":53888.35004550296},{"content":"#[interrupt]\n\nfn TG0_LACT_LEVEL_INTR() {\n\n locked_print(\" TG0_LACT_LEVEL_INTR\");\n\n locked_clear(&TIMER2);\n\n}\n\n\n","file_path":"examples/timer.rs","rank":66,"score":53888.35004550296},{"content":"pub trait Count: Quantity + Into<Ticks> {}\n\n\n","file_path":"src/units.rs","rank":67,"score":52373.0043691773},{"content":"pub trait Time: Quantity + Into<NanoSeconds> {}\n","file_path":"src/units.rs","rank":68,"score":51111.80175047503},{"content":"#[panic_handler]\n\nfn panic(_info: &PanicInfo) -> ! {\n\n loop {}\n\n}\n","file_path":"examples/dac.rs","rank":69,"score":50148.68404471354},{"content":"fn locked_print(str: &str) {\n\n (&TX).lock(|tx| {\n\n let tx = tx.as_mut().unwrap();\n\n\n\n writeln!(tx, \"{}\", str).unwrap();\n\n });\n\n}\n\n\n","file_path":"examples/timer.rs","rank":70,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(_info: &PanicInfo) -> ! {\n\n loop {}\n\n}\n","file_path":"examples/adc.rs","rank":71,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n loop {}\n\n}\n\n\n","file_path":"examples/alloc.rs","rank":72,"score":50148.68404471354},{"content":"fn locked_print(str: &str) {\n\n (&TX).lock(|tx| {\n\n let tx = tx.as_mut().unwrap();\n\n\n\n writeln!(\n\n tx,\n\n \" {}, Level: {}\",\n\n str,\n\n xtensa_lx6::interrupt::get_level()\n\n )\n\n .unwrap();\n\n });\n\n}\n\n\n","file_path":"examples/exception.rs","rank":73,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n loop {}\n\n}\n","file_path":"examples/ram.rs","rank":74,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n loop {}\n\n}\n","file_path":"examples/timer.rs","rank":75,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n // park the other core\n\n unsafe { ClockControlConfig {}.park_core(esp32_hal::get_other_core()) };\n\n\n\n // print panic message\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n\n\n // park this core\n\n unsafe { ClockControlConfig {}.park_core(esp32_hal::get_core()) };\n\n\n\n dprintln!(\"Not reached because core is parked.\");\n\n\n\n // this statement will not be reached, but is needed to make this a diverging function\n\n loop {}\n\n}\n","file_path":"examples/multicore.rs","rank":76,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(_info: &PanicInfo) -> ! {\n\n loop {}\n\n}\n","file_path":"examples/serial.rs","rank":77,"score":50148.68404471354},{"content":"#[ram]\n\n#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n loop {}\n\n}\n","file_path":"examples/exception.rs","rank":78,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n loop {}\n\n}\n","file_path":"examples/rtccntl.rs","rank":79,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(info: &PanicInfo) -> ! {\n\n dprintln!(\"\\n\\n*** {:?}\", info);\n\n loop {}\n\n}\n\n\n","file_path":"examples/mem.rs","rank":80,"score":50148.68404471354},{"content":"#[panic_handler]\n\nfn panic(_info: &PanicInfo) -> ! {\n\n loop {}\n\n}\n","file_path":"examples/hall.rs","rank":81,"score":50148.68404471354},{"content":"pub trait CountU64: Quantity + Into<TicksU64> {}\n\n\n\n/// defines and implements extension traits for quantities with units\n\nmacro_rules! define {\n\n ($primitive:ident, $trait:ident, $( ($type: ident, $quantity: ident, $unit: ident,\n\n $print_unit: literal), )+) => {\n\n $(\n\n #[derive(Eq, PartialEq, Ord, PartialOrd, Clone, Copy, Hash, Default)]\n\n pub struct $quantity(pub $primitive);\n\n\n\n impl Quantity for $quantity {}\n\n impl $type for $quantity {}\n\n )*\n\n\n\n pub trait $trait {\n\n $(\n\n #[allow(non_snake_case)]\n\n fn $unit(self) -> $quantity;\n\n )*\n\n }\n","file_path":"src/units.rs","rank":82,"score":49946.25213937096},{"content":"pub trait TimeU64: Quantity + Into<NanoSecondsU64> {}\n","file_path":"src/units.rs","rank":83,"score":48865.87124139223},{"content":"#[doc(hidden)]\n\npub trait TimerGroup: core::ops::Deref {}\n\nimpl TimerGroup for target::TIMG0 {}\n\nimpl TimerGroup for target::TIMG1 {}\n\n\n","file_path":"src/timer/mod.rs","rank":84,"score":48865.87124139223},{"content":"/// Timer trait\n\npub trait TimerWithInterrupt: CountDown + Periodic + Cancel {\n\n /// Starts listening for an [Event]\n\n fn listen(&mut self, event: Event);\n\n\n\n /// Stops listening for an [Event]\n\n fn unlisten(&mut self, event: Event);\n\n\n\n /// Clear interrupt once fired\n\n fn clear_interrupt(&mut self) -> &mut Self;\n\n}\n\n\n\nimpl<TIMG: TimerGroup> Timer<TIMG, Timer0> {\n\n /// Create new timer resources\n\n ///\n\n /// This function will create 2 timers and 1 watchdog for a timer group.\n\n /// It uses the clock_control_config for obtaining the clock configuration.\n\n ///\n\n /// *Note: time to clock tick conversions are done with the clock frequency when the\n\n /// [start](embedded_hal::timer::CountDown::start) function is called. The clock frequency is not locked.*\n\n pub fn new(\n","file_path":"src/timer/mod.rs","rank":85,"score":48865.87124139223},{"content":"fn attr_none_fn(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\n\n writeln!(\n\n uart,\n\n \"{:<40}: {:08x?}\",\n\n \"attr_none_fn\",\n\n get_program_counter()\n\n )\n\n .unwrap();\n\n}\n\n\n","file_path":"examples/ram.rs","rank":86,"score":45124.50364501008},{"content":"#[ram]\n\nfn attr_ram_fn(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\n\n writeln!(\n\n uart,\n\n \"{:<40}: {:08x?}\",\n\n \"attr_ram_fn\",\n\n get_program_counter()\n\n )\n\n .unwrap();\n\n}\n\n\n","file_path":"examples/ram.rs","rank":87,"score":45124.50364501008},{"content":"fn disable_rtc_wdt(rtccntl: &mut target::RTCCNTL) {\n\n /* Disables the RTCWDT */\n\n rtccntl\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n rtccntl.wdtconfig0.modify(|_, w| unsafe {\n\n w.wdt_stg0()\n\n .bits(0x0)\n\n .wdt_stg1()\n\n .bits(0x0)\n\n .wdt_stg2()\n\n .bits(0x0)\n\n .wdt_stg3()\n\n .bits(0x0)\n\n .wdt_flashboot_mod_en()\n\n .clear_bit()\n\n .wdt_en()\n\n .clear_bit()\n\n });\n\n rtccntl.wdtwprotect.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n","file_path":"examples/blinky.rs","rank":88,"score":44040.91623924911},{"content":"#[ram(rtc_slow)]\n\nfn attr_ram_fn_rtc_slow(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\n\n writeln!(\n\n uart,\n\n \"{:<40}: {:08x?}\",\n\n \"attr_ram_fn_rtc_slow\",\n\n get_program_counter()\n\n )\n\n .unwrap();\n\n}\n\n\n","file_path":"examples/ram.rs","rank":89,"score":43740.60556287508},{"content":"#[ram(rtc_fast)]\n\nfn attr_ram_fn_rtc_fast(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\n\n writeln!(\n\n uart,\n\n \"{:<40}: {:08x?}\",\n\n \"attr_ram_fn_rtc_fast\",\n\n get_program_counter()\n\n )\n\n .unwrap();\n\n}\n\n\n\nstatic ATTR_NONE_STATIC: [u8; 16] = *b\"ATTR_NONE_STATIC\";\n\n\n\nstatic mut ATTR_NONE_STATIC_MUT: [u8; 20] = *b\"ATTR_NONE_STATIC_MUT\";\n\n\n\nstatic ATTR_NONE_STATIC_BSS: [u8; 32] = [0; 32];\n\n\n\nstatic mut ATTR_NONE_STATIC_MUT_BSS: [u8; 32] = [0; 32];\n\n\n\n#[ram]\n\nstatic ATTR_RAM_STATIC: [u8; 15] = *b\"ATTR_RAM_STATIC\";\n","file_path":"examples/ram.rs","rank":90,"score":43740.60556287508},{"content":"#[ram]\n\nfn cpu_interrupt_to_level(cpu_interrupt: CPUInterrupt) -> InterruptLevel {\n\n #[ram]\n\n const CPU_INTERRUPT_TO_LEVEL: [usize; 32] = [\n\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 7, 3, 5, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 3, 4, 3,\n\n 4, 5,\n\n ];\n\n InterruptLevel(CPU_INTERRUPT_TO_LEVEL[cpu_interrupt.0 as usize])\n\n}\n\n\n\n#[ram]\n\nstatic mut INTERRUPT_LEVELS: [u128; 8] = [0u128; 8];\n\n\n\n#[ram]\n\nstatic INTERRUPT_LEVELS_MUTEX: CriticalSectionSpinLockMutex<bool> =\n\n CriticalSectionSpinLockMutex::new(false);\n\n\n\n#[xtensa_lx6_rt::interrupt(1)]\n\n#[ram]\n\nunsafe fn level_1_handler(level: u32) {\n\n handle_interrupts(level)\n","file_path":"src/interrupt.rs","rank":91,"score":43379.730872361324},{"content":"fn print_heap_info(output: &mut dyn core::fmt::Write) {\n\n writeln!(output).unwrap();\n\n print_single_heap_info(output, &GLOBAL_ALLOCATOR, \"Global\");\n\n print_single_heap_info(output, &DRAM_ALLOCATOR, \"DRAM\");\n\n print_single_heap_info(output, &IRAM_ALLOCATOR, \"IRAM\");\n\n #[cfg(feature = \"external_ram\")]\n\n print_single_heap_info(output, &EXTERNAL_ALLOCATOR, \"External RAM\");\n\n writeln!(output).unwrap();\n\n}\n\n\n\nconst WDT_WKEY_VALUE: u32 = 0x50D83AA1;\n\n\n","file_path":"examples/alloc.rs","rank":92,"score":40131.84667230105},{"content":"fn extract_cfgs(attrs: Vec<Attribute>) -> (Vec<Attribute>, Vec<Attribute>) {\n\n let mut cfgs = vec![];\n\n let mut not_cfgs = vec![];\n\n\n\n for attr in attrs {\n\n if eq(&attr, \"cfg\") {\n\n cfgs.push(attr);\n\n } else {\n\n not_cfgs.push(attr);\n\n }\n\n }\n\n\n\n (cfgs, not_cfgs)\n\n}\n\n\n","file_path":"procmacros/src/lib.rs","rank":93,"score":38447.66373143817},{"content":"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\n\n timg0\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n timg1\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n\n\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n","file_path":"examples/alloc.rs","rank":94,"score":36909.70007322758},{"content":"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\n\n timg0\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n timg1\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n\n\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n\n/// Basic panic handler - just loops\n","file_path":"examples/hall.rs","rank":95,"score":36909.70007322758},{"content":"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\n\n timg0\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n timg1\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n\n\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n\n/// Basic panic handler - just loops\n","file_path":"examples/serial.rs","rank":96,"score":36909.70007322758},{"content":"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\n\n timg0\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n timg1\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n\n\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n","file_path":"examples/blinky.rs","rank":97,"score":36909.70007322758},{"content":"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\n\n timg0\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n timg1\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n\n\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n\n/// Basic panic handler - just loops\n","file_path":"examples/adc.rs","rank":98,"score":36909.70007322758},{"content":"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\n\n timg0\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n timg1\n\n .wdtwprotect\n\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\n\n\n\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\n\n}\n\n\n\n/// Basic panic handler - just loops\n","file_path":"examples/dac.rs","rank":99,"score":36909.70007322758}],"string":"[\n {\n \"content\": \"#[ram]\\n\\npub fn enable(interrupt: Interrupt) -> Result<(), Error> {\\n\\n match interrupt_to_cpu_interrupt(interrupt) {\\n\\n Ok(cpu_interrupt) => {\\n\\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\\n\\n return Ok(());\\n\\n }\\n\\n Err(_) => enable_with_priority(crate::get_core(), interrupt, InterruptLevel(1)),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Disable interrupt\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 0,\n \"score\": 192054.05905088485\n },\n {\n \"content\": \"#[ram]\\n\\npub fn disable(interrupt: Interrupt) -> Result<(), Error> {\\n\\n match interrupt_to_cpu_interrupt(interrupt) {\\n\\n Ok(cpu_interrupt) => {\\n\\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\\n\\n return Ok(());\\n\\n }\\n\\n Err(_) => enable_with_priority(crate::get_core(), interrupt, InterruptLevel(0)),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Trigger a (cross-)core interrupt\\n\\n///\\n\\n/// Valid interrupts are FROM_CPU_INTR[0-3],\\n\\n/// INTERNAL_SOFTWARE_LEVEL_1_INTR and INTERNAL_SOFTWARE_LEVEL_3_INTR.\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 1,\n \"score\": 192054.05905088485\n },\n {\n \"content\": \"#[ram]\\n\\npub fn clear_software_interrupt(interrupt: Interrupt) -> Result<(), Error> {\\n\\n unsafe {\\n\\n match interrupt {\\n\\n FROM_CPU_INTR0 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_0\\n\\n .write(|w| w.cpu_intr_from_cpu_0().clear_bit()),\\n\\n FROM_CPU_INTR1 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_1\\n\\n .write(|w| w.cpu_intr_from_cpu_1().clear_bit()),\\n\\n FROM_CPU_INTR2 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_2\\n\\n .write(|w| w.cpu_intr_from_cpu_2().clear_bit()),\\n\\n FROM_CPU_INTR3 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_3\\n\\n .write(|w| w.cpu_intr_from_cpu_3().clear_bit()),\\n\\n INTERNAL_SOFTWARE_LEVEL_1_INTR | INTERNAL_SOFTWARE_LEVEL_3_INTR => {\\n\\n interrupt::clear(1 << interrupt_to_cpu_interrupt(interrupt)?.0)\\n\\n }\\n\\n\\n\\n _ => return Err(Error::InvalidInterrupt),\\n\\n }\\n\\n };\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 2,\n \"score\": 183729.64733641598\n },\n {\n \"content\": \"#[ram]\\n\\npub fn set_software_interrupt(interrupt: Interrupt) -> Result<(), Error> {\\n\\n unsafe {\\n\\n match interrupt {\\n\\n FROM_CPU_INTR0 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_0\\n\\n .write(|w| w.cpu_intr_from_cpu_0().set_bit()),\\n\\n FROM_CPU_INTR1 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_1\\n\\n .write(|w| w.cpu_intr_from_cpu_1().set_bit()),\\n\\n FROM_CPU_INTR2 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_2\\n\\n .write(|w| w.cpu_intr_from_cpu_2().set_bit()),\\n\\n FROM_CPU_INTR3 => (*DPORT::ptr())\\n\\n .cpu_intr_from_cpu_3\\n\\n .write(|w| w.cpu_intr_from_cpu_3().set_bit()),\\n\\n INTERNAL_SOFTWARE_LEVEL_1_INTR | INTERNAL_SOFTWARE_LEVEL_3_INTR => {\\n\\n interrupt::set(1 << interrupt_to_cpu_interrupt(interrupt)?.0)\\n\\n }\\n\\n\\n\\n _ => return Err(Error::InvalidInterrupt),\\n\\n }\\n\\n };\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// Clear a (cross-)core interrupt\\n\\n///\\n\\n/// Valid interrupts are FROM_CPU_INTR[0-3],\\n\\n/// INTERNAL_SOFTWARE_LEVEL_1_INTR and INTERNAL_SOFTWARE_LEVEL_3_INTR.\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 3,\n \"score\": 183729.64733641595\n },\n {\n \"content\": \"#[ram]\\n\\nfn interrupt_to_cpu_interrupt(interrupt: target::Interrupt) -> Result<CPUInterrupt, Error> {\\n\\n match interrupt {\\n\\n target::Interrupt::INTERNAL_TIMER0_INTR => Ok(CPUInterrupt(6)),\\n\\n target::Interrupt::INTERNAL_SOFTWARE_LEVEL_1_INTR => Ok(CPUInterrupt(7)),\\n\\n target::Interrupt::INTERNAL_PROFILING_INTR => Ok(CPUInterrupt(11)),\\n\\n target::Interrupt::INTERNAL_TIMER1_INTR => Ok(CPUInterrupt(15)),\\n\\n target::Interrupt::INTERNAL_TIMER2_INTR => Ok(CPUInterrupt(16)),\\n\\n target::Interrupt::INTERNAL_SOFTWARE_LEVEL_3_INTR => Ok(CPUInterrupt(29)),\\n\\n _ => Err(Error::InvalidCPUInterrupt),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 4,\n \"score\": 128384.43938090441\n },\n {\n \"content\": \"fn cpu_interrupt_to_interrupt(cpu_interrupt: CPUInterrupt) -> Result<target::Interrupt, Error> {\\n\\n #[ram]\\n\\n const CPU_INTERRUPT_TO_INTERRUPT: [Option<target::Interrupt>; 32] = [\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n Some(target::Interrupt::INTERNAL_TIMER0_INTR),\\n\\n Some(target::Interrupt::INTERNAL_SOFTWARE_LEVEL_1_INTR),\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n Some(target::Interrupt::INTERNAL_PROFILING_INTR),\\n\\n None,\\n\\n None,\\n\\n None,\\n\\n Some(target::Interrupt::INTERNAL_TIMER1_INTR),\\n\\n Some(target::Interrupt::INTERNAL_TIMER2_INTR),\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 5,\n \"score\": 125934.51292517666\n },\n {\n \"content\": \"#[ram]\\n\\npub fn enable_with_priority(\\n\\n core: crate::Core,\\n\\n interrupt: Interrupt,\\n\\n level: InterruptLevel,\\n\\n) -> Result<(), Error> {\\n\\n match interrupt_to_cpu_interrupt(interrupt) {\\n\\n Ok(cpu_interrupt) => {\\n\\n if core != crate::get_core() {\\n\\n return Err(Error::InvalidCore);\\n\\n }\\n\\n if level == InterruptLevel(0) {\\n\\n interrupt::disable_mask(1 << cpu_interrupt.0);\\n\\n return Ok(());\\n\\n } else if level == cpu_interrupt_to_level(cpu_interrupt) {\\n\\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\\n\\n return Ok(());\\n\\n } else {\\n\\n return Err(Error::InvalidInterruptLevel);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 6,\n \"score\": 112446.87560929784\n },\n {\n \"content\": \"pub trait Frequency: Quantity + Into<Hertz> {}\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 7,\n \"score\": 106204.26039013712\n },\n {\n \"content\": \"pub fn get_other_core() -> Core {\\n\\n match get_core() {\\n\\n Core::PRO => Core::APP,\\n\\n Core::APP => Core::PRO,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 8,\n \"score\": 105894.53500167752\n },\n {\n \"content\": \"pub fn get_core() -> Core {\\n\\n match ((xtensa_lx6::get_processor_id() >> 13) & 1) != 0 {\\n\\n false => Core::PRO,\\n\\n true => Core::APP,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 9,\n \"score\": 105894.53500167752\n },\n {\n \"content\": \"/// Get the size of the external RAM (also called PSRAM).\\n\\npub fn get_size() -> usize {\\n\\n unsafe { EXTERNAL_RAM_SIZE.assume_init().unwrap() }\\n\\n}\\n\\n\\n\\n/// Initialize external RAM\\n\\npub(super) unsafe fn init() {\\n\\n EXTERNAL_RAM_SIZE = core::mem::MaybeUninit::new(Some(calculate_external_ram_size()));\\n\\n\\n\\n if &_external_heap_start as *const u32 > (&_external_ram_start as *const u32).add(get_size()) {\\n\\n panic!(\\\"External RAM too small for data\\\");\\n\\n }\\n\\n xtensa_lx6_rt::zero_bss(&mut _external_bss_start, &mut _external_bss_end);\\n\\n}\\n\\n\\n\\n/// Calculate the size of external RAM by reading and writing at defined intervals while\\n\\n/// thrashing the cache in between.\\n\\n///\\n\\n/// TODO: should be replaced by reading the size via SPI\\n\\nunsafe fn calculate_external_ram_size() -> usize {\\n\\n let ram_start_addr: usize = &_external_ram_start as *const u32 as usize;\\n\",\n \"file_path\": \"src/external_ram.rs\",\n \"rank\": 10,\n \"score\": 103399.74703902833\n },\n {\n \"content\": \"/// cycle accurate delay using the cycle counter register\\n\\npub fn delay(clocks: u32) {\\n\\n let start = get_cycle_count();\\n\\n loop {\\n\\n if get_cycle_count().wrapping_sub(start) >= clocks {\\n\\n break;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/blinky.rs\",\n \"rank\": 11,\n \"score\": 102642.29101886\n },\n {\n \"content\": \"#[ram]\\n\\nfn interrupt_is_edge(interrupt: Interrupt) -> bool {\\n\\n [\\n\\n TG0_T0_EDGE_INTR,\\n\\n TG0_T1_EDGE_INTR,\\n\\n TG0_WDT_EDGE_INTR,\\n\\n TG0_LACT_EDGE_INTR,\\n\\n TG1_T0_EDGE_INTR,\\n\\n TG1_T1_EDGE_INTR,\\n\\n TG1_WDT_EDGE_INTR,\\n\\n TG1_LACT_EDGE_INTR,\\n\\n ]\\n\\n .contains(&interrupt)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 12,\n \"score\": 101637.19818045264\n },\n {\n \"content\": \"#[ram]\\n\\npub fn get_interrupt_status(core: Core) -> u128 {\\n\\n unsafe {\\n\\n match core {\\n\\n PRO => {\\n\\n ((*DPORT::ptr()).pro_intr_status_0.read().bits() as u128)\\n\\n | ((*DPORT::ptr()).pro_intr_status_1.read().bits() as u128) << 32\\n\\n | ((*DPORT::ptr()).pro_intr_status_2.read().bits() as u128) << 64\\n\\n }\\n\\n APP => {\\n\\n ((*DPORT::ptr()).app_intr_status_0.read().bits() as u128)\\n\\n | ((*DPORT::ptr()).app_intr_status_1.read().bits() as u128) << 32\\n\\n | ((*DPORT::ptr()).app_intr_status_2.read().bits() as u128) << 64\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Map an interrupt to a CPU interrupt\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 13,\n \"score\": 92906.78748064135\n },\n {\n \"content\": \"/// Returns `true` if `attr.path` matches `name`\\n\\nfn eq(attr: &Attribute, name: &str) -> bool {\\n\\n attr.style == AttrStyle::Outer && attr.path.is_ident(name)\\n\\n}\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 14,\n \"score\": 91796.2438204885\n },\n {\n \"content\": \"/// Extracts `static mut` vars from the beginning of the given statements\\n\\nfn extract_static_muts(\\n\\n stmts: impl IntoIterator<Item = Stmt>,\\n\\n) -> Result<(Vec<ItemStatic>, Vec<Stmt>), parse::Error> {\\n\\n let mut istmts = stmts.into_iter();\\n\\n\\n\\n let mut seen = HashSet::new();\\n\\n let mut statics = vec![];\\n\\n let mut stmts = vec![];\\n\\n while let Some(stmt) = istmts.next() {\\n\\n match stmt {\\n\\n Stmt::Item(Item::Static(var)) => {\\n\\n if var.mutability.is_some() {\\n\\n if seen.contains(&var.ident) {\\n\\n return Err(parse::Error::new(\\n\\n var.ident.span(),\\n\\n format!(\\\"the name `{}` is defined multiple times\\\", var.ident),\\n\\n ));\\n\\n }\\n\\n\\n\\n seen.insert(var.ident.clone());\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 15,\n \"score\": 86200.59131606453\n },\n {\n \"content\": \"/// Function only available once clock if frozen\\n\\npub fn sleep<T: Into<NanoSeconds>>(time: T) {\\n\\n unsafe { CLOCK_CONTROL.as_ref().unwrap().delay(time) };\\n\\n}\\n\\n\\n\\nimpl ClockControl {\\n\\n /// Create new ClockControl structure\\n\\n pub fn new<T: Into<Hertz> + Copy>(\\n\\n rtc_control: RTCCNTL,\\n\\n apb_control: APB_CTRL,\\n\\n dport_control: crate::dport::ClockControl,\\n\\n xtal_frequency: T,\\n\\n ) -> Result<Self, Error> {\\n\\n let mut cc = ClockControl {\\n\\n rtc_control,\\n\\n apb_control,\\n\\n dport_control,\\n\\n\\n\\n cpu_frequency_default: CPU_FREQ_MIN_DEFAULT,\\n\\n cpu_source_default: CPU_SOURCE_DEFAULT_DEFAULT,\\n\\n cpu_frequency_locked: CPU_FREQ_MAX_DEFAULT,\\n\",\n \"file_path\": \"src/clock_control/mod.rs\",\n \"rank\": 16,\n \"score\": 84523.71583488732\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn interrupt(args: TokenStream, input: TokenStream) -> TokenStream {\\n\\n let mut f: ItemFn = syn::parse(input).expect(\\\"`#[interrupt]` must be applied to a function\\\");\\n\\n\\n\\n let attr_args = parse_macro_input!(args as AttributeArgs);\\n\\n\\n\\n if attr_args.len() > 1 {\\n\\n Span::call_site()\\n\\n .error(\\\"This attribute accepts zero or 1 arguments\\\")\\n\\n .emit();\\n\\n }\\n\\n\\n\\n let ident = f.sig.ident.clone();\\n\\n let mut ident_s = &ident.clone();\\n\\n\\n\\n if attr_args.len() == 1 {\\n\\n match &attr_args[0] {\\n\\n syn::NestedMeta::Meta(Path(x)) => {\\n\\n ident_s = x.get_ident().unwrap();\\n\\n }\\n\\n _ => {\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 17,\n \"score\": 81175.42246386231\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn ram(args: TokenStream, input: TokenStream) -> TokenStream {\\n\\n let attr_args = parse_macro_input!(args as AttributeArgs);\\n\\n\\n\\n let RamArgs {\\n\\n rtc_fast,\\n\\n rtc_slow,\\n\\n external,\\n\\n uninitialized,\\n\\n zeroed,\\n\\n } = match FromMeta::from_list(&attr_args) {\\n\\n Ok(v) => v,\\n\\n Err(e) => {\\n\\n return e.write_errors().into();\\n\\n }\\n\\n };\\n\\n\\n\\n if rtc_slow && rtc_fast {\\n\\n Span::call_site()\\n\\n .error(\\\"Only one of rtc_slow and rtc_fast is allowed\\\")\\n\\n .emit();\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 18,\n \"score\": 81175.42246386231\n },\n {\n \"content\": \"pub trait FrequencyU64: Quantity + Into<HertzU64> {}\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 19,\n \"score\": 79793.48291413956\n },\n {\n \"content\": \"fn check_attr_whitelist(attrs: &[Attribute], caller: WhiteListCaller) -> Result<(), TokenStream> {\\n\\n let whitelist = &[\\n\\n \\\"doc\\\",\\n\\n \\\"link_section\\\",\\n\\n \\\"cfg\\\",\\n\\n \\\"allow\\\",\\n\\n \\\"warn\\\",\\n\\n \\\"deny\\\",\\n\\n \\\"forbid\\\",\\n\\n \\\"cold\\\",\\n\\n \\\"ram\\\",\\n\\n ];\\n\\n\\n\\n 'o: for attr in attrs {\\n\\n for val in whitelist {\\n\\n if eq(&attr, &val) {\\n\\n continue 'o;\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 20,\n \"score\": 79235.27378657463\n },\n {\n \"content\": \"#[alloc_error_handler]\\n\\nfn alloc_error_handler(layout: core::alloc::Layout) -> ! {\\n\\n panic!(\\n\\n \\\"Error allocating {} bytes of memory with alignment {}\\\",\\n\\n layout.size(),\\n\\n layout.align()\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"examples/alloc.rs\",\n \"rank\": 21,\n \"score\": 72747.21606258978\n },\n {\n \"content\": \"#[alloc_error_handler]\\n\\nfn alloc_error_handler(layout: core::alloc::Layout) -> ! {\\n\\n panic!(\\n\\n \\\"Error allocating {} bytes of memory with alignment {}\\\",\\n\\n layout.size(),\\n\\n layout.align()\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"examples/mem.rs\",\n \"rank\": 22,\n \"score\": 72747.21606258978\n },\n {\n \"content\": \"fn time(output: &mut dyn core::fmt::Write, text: &str, bytes: usize, f: &dyn Fn() -> ()) {\\n\\n let start = get_cycle_count();\\n\\n for _ in 0..REPEAT {\\n\\n f();\\n\\n }\\n\\n let end = get_cycle_count();\\n\\n\\n\\n let time = (end - start) as f32 / ClockControlConfig {}.cpu_frequency().0 as f32;\\n\\n writeln!(\\n\\n output,\\n\\n \\\"{:>40}: {:.3}s, {:.3}KB/s\\\",\\n\\n text,\\n\\n time,\\n\\n (bytes * REPEAT) as f32 / time / 1024.0\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\\nunsafe fn time_memcpy(\\n\\n output: &mut dyn core::fmt::Write,\\n\",\n \"file_path\": \"examples/mem.rs\",\n \"rank\": 23,\n \"score\": 61874.18749697469\n },\n {\n \"content\": \"/// Trait to split the DPORT peripheral into subsets\\n\\npub trait Split {\\n\\n fn split(self) -> (DPORT, ClockControl);\\n\\n}\\n\\n\\n\\nimpl Split for DPORT {\\n\\n /// function to split the DPORT peripheral into subsets\\n\\n fn split(self) -> (DPORT, ClockControl) {\\n\\n (self, ClockControl {})\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/dport.rs\",\n \"rank\": 24,\n \"score\": 60749.46821301036\n },\n {\n \"content\": \"fn main() {\\n\\n // Put the linker script somewhere the linker can find it\\n\\n let out = &PathBuf::from(env::var_os(\\\"OUT_DIR\\\").unwrap());\\n\\n File::create(out.join(\\\"memory.x\\\"))\\n\\n .unwrap()\\n\\n .write_all(include_bytes!(\\\"memory.x\\\"))\\n\\n .unwrap();\\n\\n\\n\\n File::create(out.join(\\\"alias.x\\\"))\\n\\n .unwrap()\\n\\n .write_all(if cfg!(feature = \\\"all_in_ram\\\") {\\n\\n include_bytes!(\\\"ram.x\\\")\\n\\n } else {\\n\\n include_bytes!(\\\"rom.x\\\")\\n\\n })\\n\\n .unwrap();\\n\\n\\n\\n println!(\\\"cargo:rustc-link-search={}\\\", out.display());\\n\\n\\n\\n // Only re-run the build script when memory.x is changed,\\n\\n // instead of when any part of the source code changes.\\n\\n println!(\\\"cargo:rerun-if-changed=memory.x\\\");\\n\\n}\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 25,\n \"score\": 60033.84794080211\n },\n {\n \"content\": \"/// Extension trait to split a GPIO peripheral in independent pins and registers\\n\\npub trait GpioExt {\\n\\n /// The to split the GPIO into\\n\\n type Parts;\\n\\n\\n\\n /// Splits the GPIO block into independent pins and registers\\n\\n fn split(self) -> Self::Parts;\\n\\n}\\n\\n\\n\\n/// Input mode (type state)\\n\\npub struct Input<MODE> {\\n\\n _mode: PhantomData<MODE>,\\n\\n}\\n\\n\\n\\n/// Floating input (type state)\\n\\npub struct Floating;\\n\\n\\n\\n/// Pulled down input (type state)\\n\\npub struct PullDown;\\n\\n\\n\\n/// Pulled up input (type state)\\n\",\n \"file_path\": \"src/gpio.rs\",\n \"rank\": 26,\n \"score\": 59257.927779115686\n },\n {\n \"content\": \"/// Get heap sizes\\n\\npub trait AllocatorSize {\\n\\n /// Get total heap size\\n\\n fn size(&self) -> usize;\\n\\n /// Get used heap size\\n\\n fn used(&self) -> usize;\\n\\n /// Get free heap size\\n\\n fn free(&self) -> usize;\\n\\n}\\n\\n\\n\\nunsafe trait GlobalAllocSize: GlobalAlloc + AllocatorSize {}\\n\\n\\n\\n#[derive(Copy, Clone)]\\n\\n#[doc(hidden)]\\n\\npub struct Allocator {\\n\\n allocator: &'static (dyn GlobalAllocSize + 'static),\\n\\n}\\n\\n\\n\\nunsafe impl Sync for Allocator {}\\n\\n\\n\\nimpl Allocator {\\n\",\n \"file_path\": \"src/alloc.rs\",\n \"rank\": 27,\n \"score\": 59257.927779115686\n },\n {\n \"content\": \"#[entry]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timers on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // setup clocks & watchdog\\n\\n let mut clock_control = ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\",\n \"file_path\": \"examples/mem.rs\",\n \"rank\": 28,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timer on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\\n .unwrap();\\n\",\n \"file_path\": \"examples/adc.rs\",\n \"rank\": 29,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timer on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\\n .unwrap();\\n\",\n \"file_path\": \"examples/serial.rs\",\n \"rank\": 30,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[entry]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().unwrap();\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let (clkcntrl_config, mut watchdog_rtc) = clkcntrl.freeze().unwrap();\\n\\n let (mut timer0, mut timer1, mut timer2, mut watchdog0) = Timer::new(dp.TIMG0, clkcntrl_config);\\n\\n let (mut timer3, mut timer4, mut timer5, mut watchdog1) = Timer::new(dp.TIMG1, clkcntrl_config);\\n\\n\\n\\n watchdog_rtc.disable();\\n\\n watchdog0.disable();\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 31,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[entry]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().unwrap();\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timers on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // setup clocks & watchdog\\n\\n let mut clock_control = ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 32,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[exception]\\n\\n#[ram]\\n\\nfn other_exception(\\n\\n cause: xtensa_lx6_rt::exception::ExceptionCause,\\n\\n frame: xtensa_lx6_rt::exception::Context,\\n\\n) {\\n\\n (&TX).lock(|tx| {\\n\\n let tx = tx.as_mut().unwrap();\\n\\n writeln!(tx, \\\"Exception {:?}, {:08x?}\\\", cause, frame).unwrap();\\n\\n });\\n\\n loop {}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 33,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timer on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\\n .unwrap();\\n\",\n \"file_path\": \"examples/hall.rs\",\n \"rank\": 34,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n let (_dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timer on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let clkcntrl = esp32_hal::clock_control::ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\\n .unwrap();\\n\",\n \"file_path\": \"examples/dac.rs\",\n \"rank\": 35,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut rtccntl = dp.RTCCNTL;\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the wdt's on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n disable_rtc_wdt(&mut rtccntl);\\n\\n\\n\\n let pins = dp.GPIO.split();\\n\\n let mut led = pins.gpio2.into_open_drain_output();\\n\\n\\n\\n loop {\\n\\n led.set_high().unwrap();\\n\\n delay(CORE_HZ);\\n\\n led.set_low().unwrap();\\n\\n delay(CORE_HZ);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/blinky.rs\",\n \"rank\": 36,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[entry]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timers on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // setup clocks & watchdog\\n\\n let clock_control = ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\",\n \"file_path\": \"examples/ram.rs\",\n \"rank\": 37,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[entry]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timers on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // setup clocks & watchdog\\n\\n let clock_control = ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\",\n \"file_path\": \"examples/alloc.rs\",\n \"rank\": 38,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timers on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // setup clocks & watchdog\\n\\n let mut clock_control = ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\",\n \"file_path\": \"examples/rtccntl.rs\",\n \"rank\": 39,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn main() -> ! {\\n\\n let dp = target::Peripherals::take().expect(\\\"Failed to obtain Peripherals\\\");\\n\\n\\n\\n let mut timg0 = dp.TIMG0;\\n\\n let mut timg1 = dp.TIMG1;\\n\\n\\n\\n // (https://github.com/espressif/openocd-esp32/blob/97ba3a6bb9eaa898d91df923bbedddfeaaaf28c9/src/target/esp32.c#L431)\\n\\n // openocd disables the watchdog timers on halt\\n\\n // we will do it manually on startup\\n\\n disable_timg_wdts(&mut timg0, &mut timg1);\\n\\n\\n\\n let (mut dport, dport_clock_control) = dp.DPORT.split();\\n\\n\\n\\n // setup clocks & watchdog\\n\\n let mut clock_control = ClockControl::new(\\n\\n dp.RTCCNTL,\\n\\n dp.APB_CTRL,\\n\\n dport_clock_control,\\n\\n esp32_hal::clock_control::XTAL_FREQUENCY_AUTO,\\n\\n )\\n\",\n \"file_path\": \"examples/multicore.rs\",\n \"rank\": 40,\n \"score\": 58281.79524794819\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait TimerInst {}\\n\\n\\n\",\n \"file_path\": \"src/timer/mod.rs\",\n \"rank\": 41,\n \"score\": 57888.79339906647\n },\n {\n \"content\": \"pub trait SensExt {\\n\\n fn split(self) -> AvailableAnalog;\\n\\n}\\n\\n\\n\\nimpl SensExt for SENS {\\n\\n fn split(self) -> AvailableAnalog {\\n\\n AvailableAnalog {\\n\\n adc1: ADC1 {\\n\\n _private: PhantomData,\\n\\n },\\n\\n adc2: ADC2 {\\n\\n _private: PhantomData,\\n\\n },\\n\\n dac1: DAC1 {\\n\\n _private: PhantomData,\\n\\n },\\n\\n dac2: DAC2 {\\n\\n _private: PhantomData,\\n\\n },\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/analog/mod.rs\",\n \"rank\": 42,\n \"score\": 57888.79339906647\n },\n {\n \"content\": \"pub trait Pins<UART> {}\\n\",\n \"file_path\": \"src/serial.rs\",\n \"rank\": 43,\n \"score\": 57114.985337013204\n },\n {\n \"content\": \"pub trait Quantity: Sized {}\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 44,\n \"score\": 57114.985337013204\n },\n {\n \"content\": \"fn cpu1_start() -> ! {\\n\\n let mut x: u32 = 0;\\n\\n let mut prev_ccount = 0;\\n\\n\\n\\n (&TX).lock(|tx| {\\n\\n writeln!(\\n\\n tx.as_mut().unwrap(),\\n\\n \\\"Stack Pointer Core 1: {:08x?}\\\",\\n\\n get_stack_pointer()\\n\\n )\\n\\n .unwrap()\\n\\n });\\n\\n\\n\\n loop {\\n\\n let cycles = ClockControlConfig {}.cpu_frequency() / BLINK_HZ;\\n\\n let start = get_cycle_count();\\n\\n let mut loop_count = 0;\\n\\n while get_cycle_count().wrapping_sub(start) < cycles {\\n\\n loop_count += 1;\\n\\n }\\n\\n\\n\\n print_info(x, loop_count, &mut prev_ccount);\\n\\n x = x.wrapping_add(1);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/multicore.rs\",\n \"rank\": 45,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn FROM_CPU_INTR3() {\\n\\n locked_print(\\\"FROM_CPU_INTR3\\\");\\n\\n clear_software_interrupt(Interrupt::FROM_CPU_INTR3).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 46,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[interrupt(INTERNAL_SOFTWARE_LEVEL_3_INTR)]\\n\\nfn software_level_3() {\\n\\n locked_print(\\\"INTERNAL_SOFTWARE_LEVEL_3_INTR\\\");\\n\\n clear_software_interrupt(Interrupt::FROM_CPU_INTR3).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 47,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[ram]\\n\\nfn map_interrupt(\\n\\n core: crate::Core,\\n\\n interrupt: Interrupt,\\n\\n cpu_interrupt: CPUInterrupt,\\n\\n) -> Result<(), Error> {\\n\\n if cpu_interrupt.0 >= 32 {\\n\\n return Err(Error::InvalidCPUInterrupt);\\n\\n }\\n\\n if interrupt.nr() >= Interrupt::INTERNAL_TIMER0_INTR.nr() {\\n\\n return Err(Error::InternalInterruptsCannotBeMapped);\\n\\n }\\n\\n unsafe {\\n\\n let base_reg = match core {\\n\\n crate::Core::PRO => (*DPORT::ptr()).pro_mac_intr_map.as_ptr(),\\n\\n crate::Core::APP => (*DPORT::ptr()).app_mac_intr_map.as_ptr(),\\n\\n };\\n\\n\\n\\n let reg = base_reg.add(interrupt.nr() as usize);\\n\\n *reg = cpu_interrupt.0 as u32;\\n\\n };\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 48,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn FROM_CPU_INTR0() {\\n\\n locked_print(\\\"FROM_CPU_INTR0\\\");\\n\\n clear_software_interrupt(Interrupt::FROM_CPU_INTR0).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 49,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn FROM_CPU_INTR2() {\\n\\n locked_print(\\\"FROM_CPU_INTR2\\\");\\n\\n clear_software_interrupt(Interrupt::FROM_CPU_INTR2).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 50,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[interrupt(INTERNAL_SOFTWARE_LEVEL_1_INTR)]\\n\\nfn random_name() {\\n\\n locked_print(\\\"INTERNAL_SOFTWARE_LEVEL_1_INTR\\\");\\n\\n clear_software_interrupt(Interrupt::FROM_CPU_INTR3).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 51,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn FROM_CPU_INTR1() {\\n\\n locked_print(\\\"Start FROM_CPU_INTR1\\\");\\n\\n interrupt::set_software_interrupt(Interrupt::FROM_CPU_INTR0).unwrap();\\n\\n interrupt::set_software_interrupt(Interrupt::FROM_CPU_INTR2).unwrap();\\n\\n locked_print(\\\"End FROM_CPU_INTR1\\\");\\n\\n clear_software_interrupt(Interrupt::FROM_CPU_INTR1).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 52,\n \"score\": 56686.38302763419\n },\n {\n \"content\": \"pub trait PinRx<UART> {}\\n\\n\\n\\nimpl<UART, TX, RX> Pins<UART> for (TX, RX)\\n\\nwhere\\n\\n TX: PinTx<UART>,\\n\\n RX: PinRx<UART>,\\n\\n{\\n\\n}\\n\\n\\n\\n/// A filler type for when the Tx pin is unnecessary\\n\\npub struct NoTx;\\n\\n/// A filler type for when the Rx pin is unnecessary\\n\\npub struct NoRx;\\n\\n\\n\\nimpl PinTx<UART0> for NoTx {}\\n\\nimpl PinRx<UART0> for NoRx {}\\n\\nimpl PinTx<UART1> for NoTx {}\\n\\nimpl PinRx<UART1> for NoRx {}\\n\\nimpl PinTx<UART2> for NoTx {}\\n\\nimpl PinRx<UART2> for NoRx {}\\n\",\n \"file_path\": \"src/serial.rs\",\n \"rank\": 53,\n \"score\": 55745.85095696399\n },\n {\n \"content\": \"pub trait PinTx<UART> {}\\n\",\n \"file_path\": \"src/serial.rs\",\n \"rank\": 54,\n \"score\": 55745.85095696399\n },\n {\n \"content\": \"#[derive(Eq, PartialEq, Ord, PartialOrd, Clone, Copy, Hash, Default)]\\n\\nstruct CPUInterrupt(pub usize);\\n\\n\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 55,\n \"score\": 55745.85095696399\n },\n {\n \"content\": \"// TODO:\\n\\n// - check if all called function are in ram\\n\\n// - check if all used data is in ram\\n\\n// - check that no constants are use in the function (these cannot be forced to ram)\\n\\nfn check_ram_function(_func: &syn::ItemFn) {\\n\\n // eprintln!(\\\"{:?}\\\", func);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 56,\n \"score\": 54654.596820497194\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG1_WDT_EDGE_INTR() {\\n\\n locked_print(\\\" TG1_WDT_EDGE_INTR\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 57,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG1_T0_LEVEL_INTR() {\\n\\n locked_print(\\\" TG1_T0_LEVEL_INTR\\\");\\n\\n locked_clear(&TIMER3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 58,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG0_T0_LEVEL_INTR() {\\n\\n locked_print(\\\" TG0_T0_LEVEL_INTR\\\");\\n\\n locked_clear(&TIMER0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 59,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG1_WDT_LEVEL_INTR() {\\n\\n locked_print(\\\" TG1_WDT_LEVEL_INTR\\\");\\n\\n\\n\\n (&WATCHDOG1).lock(|watchdog1| {\\n\\n let watchdog1 = watchdog1.as_mut().unwrap();\\n\\n watchdog1.clear_interrupt();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 60,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG0_T0_EDGE_INTR() {\\n\\n locked_print(\\\" TG0_T0_EDGE_INTR\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 61,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG1_LACT_LEVEL_INTR() {\\n\\n locked_print(\\\" TG1_LACT_LEVEL_INTR\\\");\\n\\n locked_clear(&TIMER5);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 62,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG1_T1_LEVEL_INTR() {\\n\\n locked_print(\\\" TG1_T1_LEVEL_INTR\\\");\\n\\n locked_clear(&TIMER4);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 63,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[ram]\\n\\nfn interrupt_level_to_cpu_interrupt(\\n\\n interrupt_level: InterruptLevel,\\n\\n edge: bool,\\n\\n) -> Result<CPUInterrupt, Error> {\\n\\n #[ram]\\n\\n const INTERRUPT_LEVEL_TO_CPU_INTERRUPT_EDGE: [Option<CPUInterrupt>; 8] = [\\n\\n Some(CPUInterrupt(6)), // Disable (assign to internal interrupt)\\n\\n Some(CPUInterrupt(10)), // Level 1 edge triggered\\n\\n None, // Level 2 edge triggered not supported\\n\\n Some(CPUInterrupt(22)), // Level 3 edge triggered\\n\\n Some(CPUInterrupt(28)), // Level 4 edge triggered\\n\\n None, // Level 5 edge triggered not supported\\n\\n None, // Level 6 = Debug not supported for peripherals\\n\\n Some(CPUInterrupt(14)), // Level 7 = NMI edge triggered\\n\\n ];\\n\\n #[ram]\\n\\n const INTERRUPT_LEVEL_TO_CPU_INTERRUPT_LEVEL: [Option<CPUInterrupt>; 8] = [\\n\\n Some(CPUInterrupt(6)), // Disable (assign to internal interrupt)\\n\\n Some(CPUInterrupt(0)), // Level 1 level triggered\\n\\n Some(CPUInterrupt(19)), // Level 2 level triggered\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 64,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG0_LACT_EDGE_INTR() {\\n\\n locked_print(\\\" TG0_LACT_EDGE_INTR\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 65,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"#[interrupt]\\n\\nfn TG0_LACT_LEVEL_INTR() {\\n\\n locked_print(\\\" TG0_LACT_LEVEL_INTR\\\");\\n\\n locked_clear(&TIMER2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 66,\n \"score\": 53888.35004550296\n },\n {\n \"content\": \"pub trait Count: Quantity + Into<Ticks> {}\\n\\n\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 67,\n \"score\": 52373.0043691773\n },\n {\n \"content\": \"pub trait Time: Quantity + Into<NanoSeconds> {}\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 68,\n \"score\": 51111.80175047503\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(_info: &PanicInfo) -> ! {\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/dac.rs\",\n \"rank\": 69,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"fn locked_print(str: &str) {\\n\\n (&TX).lock(|tx| {\\n\\n let tx = tx.as_mut().unwrap();\\n\\n\\n\\n writeln!(tx, \\\"{}\\\", str).unwrap();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 70,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(_info: &PanicInfo) -> ! {\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/adc.rs\",\n \"rank\": 71,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n loop {}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/alloc.rs\",\n \"rank\": 72,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"fn locked_print(str: &str) {\\n\\n (&TX).lock(|tx| {\\n\\n let tx = tx.as_mut().unwrap();\\n\\n\\n\\n writeln!(\\n\\n tx,\\n\\n \\\" {}, Level: {}\\\",\\n\\n str,\\n\\n xtensa_lx6::interrupt::get_level()\\n\\n )\\n\\n .unwrap();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 73,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/ram.rs\",\n \"rank\": 74,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/timer.rs\",\n \"rank\": 75,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n // park the other core\\n\\n unsafe { ClockControlConfig {}.park_core(esp32_hal::get_other_core()) };\\n\\n\\n\\n // print panic message\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n\\n\\n // park this core\\n\\n unsafe { ClockControlConfig {}.park_core(esp32_hal::get_core()) };\\n\\n\\n\\n dprintln!(\\\"Not reached because core is parked.\\\");\\n\\n\\n\\n // this statement will not be reached, but is needed to make this a diverging function\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/multicore.rs\",\n \"rank\": 76,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(_info: &PanicInfo) -> ! {\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/serial.rs\",\n \"rank\": 77,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[ram]\\n\\n#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/exception.rs\",\n \"rank\": 78,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/rtccntl.rs\",\n \"rank\": 79,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(info: &PanicInfo) -> ! {\\n\\n dprintln!(\\\"\\\\n\\\\n*** {:?}\\\", info);\\n\\n loop {}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mem.rs\",\n \"rank\": 80,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"#[panic_handler]\\n\\nfn panic(_info: &PanicInfo) -> ! {\\n\\n loop {}\\n\\n}\\n\",\n \"file_path\": \"examples/hall.rs\",\n \"rank\": 81,\n \"score\": 50148.68404471354\n },\n {\n \"content\": \"pub trait CountU64: Quantity + Into<TicksU64> {}\\n\\n\\n\\n/// defines and implements extension traits for quantities with units\\n\\nmacro_rules! define {\\n\\n ($primitive:ident, $trait:ident, $( ($type: ident, $quantity: ident, $unit: ident,\\n\\n $print_unit: literal), )+) => {\\n\\n $(\\n\\n #[derive(Eq, PartialEq, Ord, PartialOrd, Clone, Copy, Hash, Default)]\\n\\n pub struct $quantity(pub $primitive);\\n\\n\\n\\n impl Quantity for $quantity {}\\n\\n impl $type for $quantity {}\\n\\n )*\\n\\n\\n\\n pub trait $trait {\\n\\n $(\\n\\n #[allow(non_snake_case)]\\n\\n fn $unit(self) -> $quantity;\\n\\n )*\\n\\n }\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 82,\n \"score\": 49946.25213937096\n },\n {\n \"content\": \"pub trait TimeU64: Quantity + Into<NanoSecondsU64> {}\\n\",\n \"file_path\": \"src/units.rs\",\n \"rank\": 83,\n \"score\": 48865.87124139223\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait TimerGroup: core::ops::Deref {}\\n\\nimpl TimerGroup for target::TIMG0 {}\\n\\nimpl TimerGroup for target::TIMG1 {}\\n\\n\\n\",\n \"file_path\": \"src/timer/mod.rs\",\n \"rank\": 84,\n \"score\": 48865.87124139223\n },\n {\n \"content\": \"/// Timer trait\\n\\npub trait TimerWithInterrupt: CountDown + Periodic + Cancel {\\n\\n /// Starts listening for an [Event]\\n\\n fn listen(&mut self, event: Event);\\n\\n\\n\\n /// Stops listening for an [Event]\\n\\n fn unlisten(&mut self, event: Event);\\n\\n\\n\\n /// Clear interrupt once fired\\n\\n fn clear_interrupt(&mut self) -> &mut Self;\\n\\n}\\n\\n\\n\\nimpl<TIMG: TimerGroup> Timer<TIMG, Timer0> {\\n\\n /// Create new timer resources\\n\\n ///\\n\\n /// This function will create 2 timers and 1 watchdog for a timer group.\\n\\n /// It uses the clock_control_config for obtaining the clock configuration.\\n\\n ///\\n\\n /// *Note: time to clock tick conversions are done with the clock frequency when the\\n\\n /// [start](embedded_hal::timer::CountDown::start) function is called. The clock frequency is not locked.*\\n\\n pub fn new(\\n\",\n \"file_path\": \"src/timer/mod.rs\",\n \"rank\": 85,\n \"score\": 48865.87124139223\n },\n {\n \"content\": \"fn attr_none_fn(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\\n\\n writeln!(\\n\\n uart,\\n\\n \\\"{:<40}: {:08x?}\\\",\\n\\n \\\"attr_none_fn\\\",\\n\\n get_program_counter()\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ram.rs\",\n \"rank\": 86,\n \"score\": 45124.50364501008\n },\n {\n \"content\": \"#[ram]\\n\\nfn attr_ram_fn(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\\n\\n writeln!(\\n\\n uart,\\n\\n \\\"{:<40}: {:08x?}\\\",\\n\\n \\\"attr_ram_fn\\\",\\n\\n get_program_counter()\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ram.rs\",\n \"rank\": 87,\n \"score\": 45124.50364501008\n },\n {\n \"content\": \"fn disable_rtc_wdt(rtccntl: &mut target::RTCCNTL) {\\n\\n /* Disables the RTCWDT */\\n\\n rtccntl\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n rtccntl.wdtconfig0.modify(|_, w| unsafe {\\n\\n w.wdt_stg0()\\n\\n .bits(0x0)\\n\\n .wdt_stg1()\\n\\n .bits(0x0)\\n\\n .wdt_stg2()\\n\\n .bits(0x0)\\n\\n .wdt_stg3()\\n\\n .bits(0x0)\\n\\n .wdt_flashboot_mod_en()\\n\\n .clear_bit()\\n\\n .wdt_en()\\n\\n .clear_bit()\\n\\n });\\n\\n rtccntl.wdtwprotect.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/blinky.rs\",\n \"rank\": 88,\n \"score\": 44040.91623924911\n },\n {\n \"content\": \"#[ram(rtc_slow)]\\n\\nfn attr_ram_fn_rtc_slow(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\\n\\n writeln!(\\n\\n uart,\\n\\n \\\"{:<40}: {:08x?}\\\",\\n\\n \\\"attr_ram_fn_rtc_slow\\\",\\n\\n get_program_counter()\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ram.rs\",\n \"rank\": 89,\n \"score\": 43740.60556287508\n },\n {\n \"content\": \"#[ram(rtc_fast)]\\n\\nfn attr_ram_fn_rtc_fast(uart: &mut esp32_hal::serial::Serial<target::UART0, (NoTx, NoRx)>) {\\n\\n writeln!(\\n\\n uart,\\n\\n \\\"{:<40}: {:08x?}\\\",\\n\\n \\\"attr_ram_fn_rtc_fast\\\",\\n\\n get_program_counter()\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\\nstatic ATTR_NONE_STATIC: [u8; 16] = *b\\\"ATTR_NONE_STATIC\\\";\\n\\n\\n\\nstatic mut ATTR_NONE_STATIC_MUT: [u8; 20] = *b\\\"ATTR_NONE_STATIC_MUT\\\";\\n\\n\\n\\nstatic ATTR_NONE_STATIC_BSS: [u8; 32] = [0; 32];\\n\\n\\n\\nstatic mut ATTR_NONE_STATIC_MUT_BSS: [u8; 32] = [0; 32];\\n\\n\\n\\n#[ram]\\n\\nstatic ATTR_RAM_STATIC: [u8; 15] = *b\\\"ATTR_RAM_STATIC\\\";\\n\",\n \"file_path\": \"examples/ram.rs\",\n \"rank\": 90,\n \"score\": 43740.60556287508\n },\n {\n \"content\": \"#[ram]\\n\\nfn cpu_interrupt_to_level(cpu_interrupt: CPUInterrupt) -> InterruptLevel {\\n\\n #[ram]\\n\\n const CPU_INTERRUPT_TO_LEVEL: [usize; 32] = [\\n\\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 7, 3, 5, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 3, 4, 3,\\n\\n 4, 5,\\n\\n ];\\n\\n InterruptLevel(CPU_INTERRUPT_TO_LEVEL[cpu_interrupt.0 as usize])\\n\\n}\\n\\n\\n\\n#[ram]\\n\\nstatic mut INTERRUPT_LEVELS: [u128; 8] = [0u128; 8];\\n\\n\\n\\n#[ram]\\n\\nstatic INTERRUPT_LEVELS_MUTEX: CriticalSectionSpinLockMutex<bool> =\\n\\n CriticalSectionSpinLockMutex::new(false);\\n\\n\\n\\n#[xtensa_lx6_rt::interrupt(1)]\\n\\n#[ram]\\n\\nunsafe fn level_1_handler(level: u32) {\\n\\n handle_interrupts(level)\\n\",\n \"file_path\": \"src/interrupt.rs\",\n \"rank\": 91,\n \"score\": 43379.730872361324\n },\n {\n \"content\": \"fn print_heap_info(output: &mut dyn core::fmt::Write) {\\n\\n writeln!(output).unwrap();\\n\\n print_single_heap_info(output, &GLOBAL_ALLOCATOR, \\\"Global\\\");\\n\\n print_single_heap_info(output, &DRAM_ALLOCATOR, \\\"DRAM\\\");\\n\\n print_single_heap_info(output, &IRAM_ALLOCATOR, \\\"IRAM\\\");\\n\\n #[cfg(feature = \\\"external_ram\\\")]\\n\\n print_single_heap_info(output, &EXTERNAL_ALLOCATOR, \\\"External RAM\\\");\\n\\n writeln!(output).unwrap();\\n\\n}\\n\\n\\n\\nconst WDT_WKEY_VALUE: u32 = 0x50D83AA1;\\n\\n\\n\",\n \"file_path\": \"examples/alloc.rs\",\n \"rank\": 92,\n \"score\": 40131.84667230105\n },\n {\n \"content\": \"fn extract_cfgs(attrs: Vec<Attribute>) -> (Vec<Attribute>, Vec<Attribute>) {\\n\\n let mut cfgs = vec![];\\n\\n let mut not_cfgs = vec![];\\n\\n\\n\\n for attr in attrs {\\n\\n if eq(&attr, \\\"cfg\\\") {\\n\\n cfgs.push(attr);\\n\\n } else {\\n\\n not_cfgs.push(attr);\\n\\n }\\n\\n }\\n\\n\\n\\n (cfgs, not_cfgs)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"procmacros/src/lib.rs\",\n \"rank\": 93,\n \"score\": 38447.66373143817\n },\n {\n \"content\": \"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\\n\\n timg0\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n timg1\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n\\n\\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/alloc.rs\",\n \"rank\": 94,\n \"score\": 36909.70007322758\n },\n {\n \"content\": \"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\\n\\n timg0\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n timg1\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n\\n\\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\\n/// Basic panic handler - just loops\\n\",\n \"file_path\": \"examples/hall.rs\",\n \"rank\": 95,\n \"score\": 36909.70007322758\n },\n {\n \"content\": \"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\\n\\n timg0\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n timg1\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n\\n\\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\\n/// Basic panic handler - just loops\\n\",\n \"file_path\": \"examples/serial.rs\",\n \"rank\": 96,\n \"score\": 36909.70007322758\n },\n {\n \"content\": \"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\\n\\n timg0\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n timg1\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n\\n\\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/blinky.rs\",\n \"rank\": 97,\n \"score\": 36909.70007322758\n },\n {\n \"content\": \"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\\n\\n timg0\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n timg1\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n\\n\\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\\n/// Basic panic handler - just loops\\n\",\n \"file_path\": \"examples/adc.rs\",\n \"rank\": 98,\n \"score\": 36909.70007322758\n },\n {\n \"content\": \"fn disable_timg_wdts(timg0: &mut target::TIMG0, timg1: &mut target::TIMG1) {\\n\\n timg0\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n timg1\\n\\n .wdtwprotect\\n\\n .write(|w| unsafe { w.bits(WDT_WKEY_VALUE) });\\n\\n\\n\\n timg0.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n timg1.wdtconfig0.write(|w| unsafe { w.bits(0x0) });\\n\\n}\\n\\n\\n\\n/// Basic panic handler - just loops\\n\",\n \"file_path\": \"examples/dac.rs\",\n \"rank\": 99,\n \"score\": 36909.70007322758\n }\n]","isConversational":false}}},{"rowIdx":1990,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"gimli-rs/cpp_demangle"},"commit":{"kind":"string","value":"a8afba1db064469278c4530ad9bad28ec4d6c161"},"file_code":{"kind":"string","value":"\n\n#![deny(missing_docs)]\n#![deny(missing_debug_implementations)]\n#![deny(unsafe_code)]\n\n#![allow(unknown_lints)]\n#![allow(clippy::inline_always)]\n#![allow(clippy::redundant_field_names)]\n#![cfg_attr(all(not(feature = \"std\"), feature = \"alloc\"), no_std)]\n#![cfg_attr(all(not(feature = \"std\"), feature = \"alloc\"), feature(alloc))]\n\n#[macro_use]\nextern crate cfg_if;\n\ncfg_if! {\n if #[cfg(all(not(feature = \"std\"), feature = \"alloc\"))] {\n extern crate core as std;\n #[macro_use]\n extern crate alloc;\n mod imports {\n pub use alloc::boxed;\n pub use alloc::vec;\n pub use alloc::string;\n pub use alloc::borrow;\n pub use alloc::collections::btree_map;\n }\n } else {\n mod imports {\n pub use std::boxed;\n pub use std::vec;\n pub use std::string;\n pub use std::borrow;\n pub use std::collections::btree_map;\n }\n }\n}\n\nuse imports::*;\n\nuse string::String;\nuse vec::Vec;\n\n#[macro_use]\nmod logging;\n\npub mod ast;\npub mod error;\nmod index_str;\nmod subs;\n\nuse ast::{Demangle, Parse, ParseContext};\nuse error::{Error, Result};\nuse index_str::IndexStr;\nuse std::fmt;\nuse std::num::NonZeroU32;\n\n#[derive(Clone, Copy, Debug, Default)]\n#[repr(C)]\npub struct ParseOptions {\n recursion_limit: Option<NonZeroU32>,\n}\n\nimpl ParseOptions {\n \n \n \n \n \n pub fn recursion_limit(mut self, limit: u32) -> Self {\n self.recursion_limit = Some(NonZeroU32::new(limit).expect(\"Recursion limit must be > 0\"));\n self\n }\n}\n\n#[derive(Clone, Copy, Debug, Default)]\n#[repr(C)]\npub struct DemangleOptions {\n no_params: bool,\n no_return_type: bool,\n recursion_limit: Option<NonZeroU32>,\n}\n\nimpl DemangleOptions {\n \n pub fn new() -> Self {\n Default::default()\n }\n\n \n pub fn no_params(mut self) -> Self {\n self.no_params = true;\n self\n }\n\n \n pub fn no_return_type(mut self) -> Self {\n self.no_return_type = true;\n self\n }\n\n \n \n \n \n pub fn recursion_limit(mut self, limit: u32) -> Self {\n self.recursion_limit = Some(NonZeroU32::new(limit).expect(\"Recursion limit must be > 0\"));\n self\n }\n}\n\npub type OwnedSymbol = Symbol<Vec<u8>>;\n\npub type BorrowedSymbol<'a> = Symbol<&'a [u8]>;\n\n#[derive(Clone, Debug, PartialEq)]\npub struct Symbol<T> {\n raw: T,\n substitutions: subs::SubstitutionTable,\n parsed: ast::MangledName,\n}\n\nimpl<T> Symbol<T>\nwhere\n T: AsRef<[u8]>,\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 #[inline]\n pub fn new(raw: T) -> Result<Symbol<T>> {\n Self::new_with_options(raw, &Default::default())\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 new_with_options(raw: T, options: &ParseOptions) -> Result<Symbol<T>> {\n let mut substitutions = subs::SubstitutionTable::new();\n\n let parsed = {\n let ctx = ParseContext::new(*options);\n let input = IndexStr::new(raw.as_ref());\n\n let (parsed, tail) = ast::MangledName::parse(&ctx, &mut substitutions, input)?;\n debug_assert!(ctx.recursion_level() == 0);\n\n if tail.is_empty() {\n parsed\n } else {\n return Err(Error::UnexpectedText);\n }\n };\n\n let symbol = Symbol {\n raw: raw,\n substitutions: substitutions,\n parsed: parsed,\n };\n\n log!(\n \"Successfully parsed '{}' as\n\nAST = {:#?}\n\nsubstitutions = {:#?}\",\n String::from_utf8_lossy(symbol.raw.as_ref()),\n symbol.parsed,\n symbol.substitutions\n );\n\n Ok(symbol)\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[allow(clippy::trivially_copy_pass_by_ref)]\n pub fn demangle(&self, options: &DemangleOptions) -> ::std::result::Result<String, fmt::Error> {\n let mut out = String::new();\n {\n let mut ctx = ast::DemangleContext::new(\n &self.substitutions,\n self.raw.as_ref(),\n *options,\n &mut out,\n );\n self.parsed.demangle(&mut ctx, None)?;\n }\n\n Ok(out)\n }\n\n \n \n #[allow(clippy::trivially_copy_pass_by_ref)]\n pub fn structured_demangle<W: DemangleWrite>(\n &self,\n out: &mut W,\n options: &DemangleOptions,\n ) -> fmt::Result {\n let mut ctx =\n ast::DemangleContext::new(&self.substitutions, self.raw.as_ref(), *options, out);\n self.parsed.demangle(&mut ctx, None)\n }\n}\n\n#[derive(Clone, Copy, Debug, Eq, PartialEq, Ord, PartialOrd, Hash)]\npub enum DemangleNodeType {\n \n Prefix,\n \n TemplatePrefix,\n \n TemplateArgs,\n \n UnqualifiedName,\n \n TemplateParam,\n \n Decltype,\n \n DataMemberPrefix,\n \n NestedName,\n \n VirtualTable,\n \n \n __NonExhaustive,\n}\n\npub trait DemangleWrite {\n \n fn push_demangle_node(&mut self, _: DemangleNodeType) {}\n \n fn write_string(&mut self, s: &str) -> fmt::Result;\n \n \n fn pop_demangle_node(&mut self) {}\n}\n\nimpl<W: fmt::Write> DemangleWrite for W {\n fn write_string(&mut self, s: &str) -> fmt::Result {\n fmt::Write::write_str(self, s)\n }\n}\n\nimpl<'a, T> Symbol<&'a T>\nwhere\n T: AsRef<[u8]> + ?Sized,\n{\n \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 with_tail(input: &'a T) -> Result<(BorrowedSymbol<'a>, &'a [u8])> {\n Self::with_tail_and_options(input, &Default::default())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn with_tail_and_options(\n input: &'a T,\n options: &ParseOptions,\n ) -> Result<(BorrowedSymbol<'a>, &'a [u8])> {\n let mut substitutions = subs::SubstitutionTable::new();\n\n let ctx = ParseContext::new(*options);\n let idx_str = IndexStr::new(input.as_ref());\n let (parsed, tail) = ast::MangledName::parse(&ctx, &mut substitutions, idx_str)?;\n debug_assert!(ctx.recursion_level() == 0);\n\n let symbol = Symbol {\n raw: input.as_ref(),\n substitutions: substitutions,\n parsed: parsed,\n };\n\n log!(\n \"Successfully parsed '{}' as\n\nAST = {:#?}\n\nsubstitutions = {:#?}\",\n String::from_utf8_lossy(symbol.raw),\n symbol.parsed,\n symbol.substitutions\n );\n\n Ok((symbol, tail.into()))\n }\n}\n\nimpl<T> fmt::Display for Symbol<T>\nwhere\n T: AsRef<[u8]>,\n{\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n let mut out = String::new();\n {\n let options = DemangleOptions::default();\n let mut ctx = ast::DemangleContext::new(\n &self.substitutions,\n self.raw.as_ref(),\n options,\n &mut out,\n );\n self.parsed.demangle(&mut ctx, None).map_err(|err| {\n log!(\"Demangling error: {:#?}\", err);\n fmt::Error\n })?;\n }\n write!(f, \"{}\", &out)\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#![deny(missing_docs)]\n#![deny(missing_debug_implementations)]\n#![deny(unsafe_code)]\n\n#![allow(unknown_lints)]\n#![allow(clippy::inline_always)]\n#![allow(clippy::redundant_field_names)]\n#![cfg_attr(all(not(feature = \"std\"), feature = \"alloc\"), no_std)]\n#![cfg_attr(all(not(feature = \"std\"), feature = \"alloc\"), feature(alloc))]\n\n#[macro_use]\nextern crate cfg_if;\n\ncfg_if! {\n if #[cfg(all(not(feature = \"std\"), feature = \"alloc\"))] {\n extern crate core as std;\n #[macro_use]\n extern crate alloc;\n mod imports {\n pub use alloc::boxed;\n pub use alloc::vec;\n pub use alloc::string;\n pub use alloc::borrow;\n pub use alloc::collections::btree_map;\n }\n } else {\n mod imports {\n pub use std::boxed;\n pub use std::vec;\n pub use std::string;\n pub use std::borrow;\n pub use std::collections::btree_map;\n }\n }\n}\n\nuse imports::*;\n\nuse string::String;\nuse vec::Vec;\n\n#[macro_use]\nmod logging;\n\npub mod ast;\npub mod error;\nmod index_str;\nmod subs;\n\nuse ast::{Demangle, Parse, ParseContext};\nuse error::{Error, Result};\nuse index_str::IndexStr;\nuse std::fmt;\nuse std::num::NonZeroU32;\n\n#[derive(Clone, Copy, Debug, Default)]\n#[repr(C)]\npub struct ParseOptions {\n recursion_limit: Option<NonZeroU32>,\n}\n\nimpl ParseOptions {\n \n \n \n \n \n pub fn recursion_limit(mut self, limit: u32) -> Self {\n self.recursion_limit = Some(NonZeroU32::new(limit).expect(\"Recursion limit must be > 0\"));\n self\n }\n}\n\n#[derive(Clone, Copy, Debug, Default)]\n#[repr(C)]\npub struct DemangleOptions {\n no_params: bool,\n no_return_type: bool,\n recursion_limit: Option<NonZeroU32>,\n}\n\nimpl DemangleOptions {\n \n pub fn new() -> Self {\n Default::default()\n }\n\n \n pub fn no_params(mut self) -> Self {\n self.no_params = true;\n self\n }\n\n \n pub fn no_return_type(mut self) -> Self {\n self.no_return_type = true;\n self\n }\n\n \n \n \n \n pub fn recursion_limit(mut self, limit: u32) -> Self {\n self.recursion_limit = Some(NonZeroU32::new(limit).expect(\"Recursion limit must be > 0\"));\n self\n }\n}\n\npub type OwnedSymbol = Symbol<Vec<u8>>;\n\npub type BorrowedSymbol<'a> = Symbol<&'a [u8]>;\n\n#[derive(Clone, Debug, PartialEq)]\npub struct Symbol<T> {\n raw: T,\n substitutions: subs::SubstitutionTable,\n parsed: ast::MangledName,\n}\n\nimpl<T> Symbol<T>\nwhere\n T: AsRef<[u8]>,\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 #[inline]\n pub fn new(raw: T) -> Result<Symbol<T>> {\n Self::new_with_options(raw, &Default::default())\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 new_with_options(raw: T, options: &ParseOptions) -> Result<Symbol<T>> {\n let mut substitutions = subs::SubstitutionTable::new();\n\n let parsed = {\n let ctx = ParseContext::new(*options);\n let input = IndexStr::new(raw.as_ref());\n\n let (parsed, tail) = ast::MangledName::parse(&ctx, &mut substitutions, input)?;\n debug_assert!(ctx.recursion_level() == 0);\n\n "},"suffix":{"kind":"string","value":"\n };\n\n let symbol = Symbol {\n raw: raw,\n substitutions: substitutions,\n parsed: parsed,\n };\n\n log!(\n \"Successfully parsed '{}' as\n\nAST = {:#?}\n\nsubstitutions = {:#?}\",\n String::from_utf8_lossy(symbol.raw.as_ref()),\n symbol.parsed,\n symbol.substitutions\n );\n\n Ok(symbol)\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[allow(clippy::trivially_copy_pass_by_ref)]\n pub fn demangle(&self, options: &DemangleOptions) -> ::std::result::Result<String, fmt::Error> {\n let mut out = String::new();\n {\n let mut ctx = ast::DemangleContext::new(\n &self.substitutions,\n self.raw.as_ref(),\n *options,\n &mut out,\n );\n self.parsed.demangle(&mut ctx, None)?;\n }\n\n Ok(out)\n }\n\n \n \n #[allow(clippy::trivially_copy_pass_by_ref)]\n pub fn structured_demangle<W: DemangleWrite>(\n &self,\n out: &mut W,\n options: &DemangleOptions,\n ) -> fmt::Result {\n let mut ctx =\n ast::DemangleContext::new(&self.substitutions, self.raw.as_ref(), *options, out);\n self.parsed.demangle(&mut ctx, None)\n }\n}\n\n#[derive(Clone, Copy, Debug, Eq, PartialEq, Ord, PartialOrd, Hash)]\npub enum DemangleNodeType {\n \n Prefix,\n \n TemplatePrefix,\n \n TemplateArgs,\n \n UnqualifiedName,\n \n TemplateParam,\n \n Decltype,\n \n DataMemberPrefix,\n \n NestedName,\n \n VirtualTable,\n \n \n __NonExhaustive,\n}\n\npub trait DemangleWrite {\n \n fn push_demangle_node(&mut self, _: DemangleNodeType) {}\n \n fn write_string(&mut self, s: &str) -> fmt::Result;\n \n \n fn pop_demangle_node(&mut self) {}\n}\n\nimpl<W: fmt::Write> DemangleWrite for W {\n fn write_string(&mut self, s: &str) -> fmt::Result {\n fmt::Write::write_str(self, s)\n }\n}\n\nimpl<'a, T> Symbol<&'a T>\nwhere\n T: AsRef<[u8]> + ?Sized,\n{\n \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 with_tail(input: &'a T) -> Result<(BorrowedSymbol<'a>, &'a [u8])> {\n Self::with_tail_and_options(input, &Default::default())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn with_tail_and_options(\n input: &'a T,\n options: &ParseOptions,\n ) -> Result<(BorrowedSymbol<'a>, &'a [u8])> {\n let mut substitutions = subs::SubstitutionTable::new();\n\n let ctx = ParseContext::new(*options);\n let idx_str = IndexStr::new(input.as_ref());\n let (parsed, tail) = ast::MangledName::parse(&ctx, &mut substitutions, idx_str)?;\n debug_assert!(ctx.recursion_level() == 0);\n\n let symbol = Symbol {\n raw: input.as_ref(),\n substitutions: substitutions,\n parsed: parsed,\n };\n\n log!(\n \"Successfully parsed '{}' as\n\nAST = {:#?}\n\nsubstitutions = {:#?}\",\n String::from_utf8_lossy(symbol.raw),\n symbol.parsed,\n symbol.substitutions\n );\n\n Ok((symbol, tail.into()))\n }\n}\n\nimpl<T> fmt::Display for Symbol<T>\nwhere\n T: AsRef<[u8]>,\n{\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n let mut out = String::new();\n {\n let options = DemangleOptions::default();\n let mut ctx = ast::DemangleContext::new(\n &self.substitutions,\n self.raw.as_ref(),\n options,\n &mut out,\n );\n self.parsed.demangle(&mut ctx, None).map_err(|err| {\n log!(\"Demangling error: {:#?}\", err);\n fmt::Error\n })?;\n }\n write!(f, \"{}\", &out)\n }\n}\n"},"middle":{"kind":"string","value":"if tail.is_empty() {\n parsed\n } else {\n return Err(Error::UnexpectedText);\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"#[allow(unsafe_code)]\n\nfn parse_number(base: u32, allow_signed: bool, mut input: IndexStr) -> Result<(isize, IndexStr)> {\n\n if input.is_empty() {\n\n return Err(error::Error::UnexpectedEnd);\n\n }\n\n\n\n let num_is_negative = if allow_signed && input.as_ref()[0] == b'n' {\n\n input = input.range_from(1..);\n\n\n\n if input.is_empty() {\n\n return Err(error::Error::UnexpectedEnd);\n\n }\n\n\n\n true\n\n } else {\n\n false\n\n };\n\n\n\n let num_numeric = input\n\n .as_ref()\n\n .iter()\n","file_path":"src/ast.rs","rank":0,"score":106610.51204140321},{"content":"/// Print all the lines from the given `input` to `out`, with all mangled C++\n\n/// symbols replaced with their demangled form.\n\nfn demangle_all<R, W>(input: &mut R, out: &mut W, options: DemangleOptions) -> io::Result<()>\n\nwhere\n\n R: BufRead,\n\n W: Write,\n\n{\n\n let mut buf = vec![];\n\n\n\n while input.read_until(b'\\n', &mut buf)? > 0 {\n\n let nl = buf.ends_with(&[b'\\n']);\n\n if nl {\n\n buf.pop();\n\n }\n\n demangle_line(out, &buf[..], options)?;\n\n if nl {\n\n write!(out, \"\\n\")?;\n\n }\n\n buf.clear();\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"examples/cppfilt.rs","rank":1,"score":103260.6048222924},{"content":"/// Print the given `line` to `out`, with all mangled C++ symbols replaced with\n\n/// their demangled form.\n\nfn demangle_line<W>(out: &mut W, line: &[u8], options: DemangleOptions) -> io::Result<()>\n\nwhere\n\n W: Write,\n\n{\n\n let mut line = line;\n\n\n\n while let Some(idx) = find_mangled(line) {\n\n write!(out, \"{}\", String::from_utf8_lossy(&line[..idx]))?;\n\n\n\n if let Ok((sym, tail)) = BorrowedSymbol::with_tail(&line[idx..]) {\n\n let demangled = sym\n\n .demangle(&options)\n\n .map_err(|e| io::Error::new(io::ErrorKind::Other, e))?;\n\n write!(out, \"{}\", demangled)?;\n\n line = tail;\n\n } else {\n\n write!(out, \"_Z\")?;\n\n line = &line[2..];\n\n }\n\n }\n\n\n\n write!(out, \"{}\", String::from_utf8_lossy(line))\n\n}\n\n\n","file_path":"examples/cppfilt.rs","rank":2,"score":96711.84139914955},{"content":"#[inline]\n\nfn consume<'a>(expected: &[u8], input: IndexStr<'a>) -> Result<IndexStr<'a>> {\n\n match input.try_split_at(expected.len()) {\n\n Some((head, tail)) if head == expected => Ok(tail),\n\n Some(_) => Err(error::Error::UnexpectedText),\n\n None => Err(error::Error::UnexpectedEnd),\n\n }\n\n}\n\n\n","file_path":"src/ast.rs","rank":3,"score":94987.05861130016},{"content":"#[doc(hidden)]\n\npub trait Demangle<'subs, W>: fmt::Debug\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n /// Write the demangled form of this AST node to the given context.\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result;\n\n}\n\n\n\n/// Any AST node that can be printed as an inner type.\n\n///\n\n/// See the comments surrounding `DemangleContext::inner` for details.\n","file_path":"src/ast.rs","rank":4,"score":86732.5689477882},{"content":"struct AutoLogParse;\n\n\n\n#[cfg(feature = \"logging\")]\n\nthread_local! {\n\n static LOG_DEPTH: RefCell<usize> = RefCell::new(0);\n\n}\n\n\n\nimpl AutoLogParse {\n\n #[cfg(feature = \"logging\")]\n\n fn new(production: &'static str, input: IndexStr<'_>) -> AutoLogParse {\n\n LOG_DEPTH.with(|depth| {\n\n if *depth.borrow() == 0 {\n\n println!();\n\n }\n\n\n\n let indent: String = (0..*depth.borrow() * 4).map(|_| ' ').collect();\n\n log!(\n\n \"{}({} \\\"{}\\\" {}\",\n\n indent,\n\n production,\n","file_path":"src/ast.rs","rank":5,"score":80911.73240346611},{"content":"struct AutoLogDemangle;\n\n\n\nimpl AutoLogDemangle {\n\n #[cfg(feature = \"logging\")]\n\n fn new<P, W>(\n\n production: &P,\n\n ctx: &DemangleContext<W>,\n\n scope: Option<ArgScopeStack>,\n\n is_inner: bool,\n\n ) -> AutoLogDemangle\n\n where\n\n P: ?Sized + fmt::Debug,\n\n W: DemangleWrite,\n\n {\n\n LOG_DEPTH.with(|depth| {\n\n if *depth.borrow() == 0 {\n\n println!();\n\n }\n\n\n\n let indent: String = (0..*depth.borrow() * 4).map(|_| ' ').collect();\n","file_path":"src/ast.rs","rank":6,"score":80911.73240346611},{"content":"#[test]\n\nfn size_of_error() {\n\n use std::mem;\n\n assert_eq!(\n\n mem::size_of::<Error>(),\n\n 1,\n\n \"We should keep the size of our Error type in check\"\n\n );\n\n}\n\n\n\nimpl fmt::Display for Error {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match *self {\n\n Error::UnexpectedEnd => write!(f, \"mangled symbol ends abruptly\"),\n\n Error::UnexpectedText => write!(f, \"mangled symbol is not well-formed\"),\n\n Error::BadBackReference => write!(\n\n f,\n\n \"back reference that is out-of-bounds of the substitution table\"\n\n ),\n\n Error::BadTemplateArgReference => write!(\n\n f,\n","file_path":"src/error.rs","rank":7,"score":76237.16769493591},{"content":"/// Find the index of the first (potential) occurrence of a mangled C++ symbol\n\n/// in the given `haystack`.\n\nfn find_mangled(haystack: &[u8]) -> Option<usize> {\n\n if haystack.is_empty() {\n\n return None;\n\n }\n\n\n\n for i in 0..haystack.len() - 1 {\n\n if haystack[i] == b'_' {\n\n match (\n\n haystack[i + 1],\n\n haystack.get(i + 2),\n\n haystack.get(i + 3),\n\n haystack.get(i + 4),\n\n ) {\n\n (b'Z', _, _, _) | (b'_', Some(b'Z'), _, _) | (b'_', Some(b'_'), Some(b'Z'), _) => {\n\n return Some(i)\n\n }\n\n (b'_', Some(b'_'), Some(b'_'), Some(b'Z')) => return Some(i),\n\n _ => (),\n\n }\n\n }\n\n }\n\n\n\n None\n\n}\n\n\n","file_path":"examples/cppfilt.rs","rank":8,"score":75095.9965151663},{"content":"/// When formatting a mangled symbol's parsed AST as a demangled symbol, we need\n\n/// to resolve indirect references to template and function arguments with\n\n/// direct `TemplateArg` and `Type` references respectively.\n\n///\n\n/// Note that which set of arguments are implicitly referenced change as we\n\n/// enter and leave different functions' scope. One might usually use de Brujin\n\n/// indices to keep arguments within scopes separated from each other, but the\n\n/// Itanium C++ ABI does not allow us the luxury. AFAIK, when the ABI was first\n\n/// drafted, C++ did not have lambdas, and the issue did not come up at all\n\n/// since a function simply couldn't refer to the types of closed over\n\n/// variables.\n\n///\n\n/// This trait is implemented by anything that can potentially resolve arguments\n\n/// for us.\n\ntrait ArgScope<'me, 'ctx>: fmt::Debug {\n\n /// Get the current scope's leaf name.\n\n fn leaf_name(&'me self) -> Result<LeafName<'ctx>>;\n\n\n\n /// Get the current scope's `index`th template argument.\n\n fn get_template_arg(&'me self, index: usize)\n\n -> Result<(&'ctx TemplateArg, &'ctx TemplateArgs)>;\n\n\n\n /// Get the current scope's `index`th function argument's type.\n\n fn get_function_arg(&'me self, index: usize) -> Result<&'ctx Type>;\n\n}\n\n\n\n/// An `ArgScopeStack` represents the current function and template demangling\n\n/// scope we are within. As we enter new demangling scopes, we construct new\n\n/// `ArgScopeStack`s whose `prev` references point back to the old ones. These\n\n/// `ArgScopeStack`s are kept on the native stack, and as functions return, they\n\n/// go out of scope and we use the previous `ArgScopeStack`s again.\n\n#[derive(Copy, Clone, Debug)]\n\npub struct ArgScopeStack<'prev, 'subs>\n\nwhere\n\n 'subs: 'prev,\n\n{\n\n item: &'subs dyn ArgScope<'subs, 'subs>,\n\n in_arg: Option<(usize, &'subs TemplateArgs)>,\n\n prev: Option<&'prev ArgScopeStack<'prev, 'subs>>,\n\n}\n\n\n","file_path":"src/ast.rs","rank":9,"score":69999.09025573592},{"content":"fn get_crate_dir() -> io::Result<path::PathBuf> {\n\n Ok(path::PathBuf::from(\n\n env::var(\"CARGO_MANIFEST_DIR\")\n\n .map_err(|_| io::Error::new(io::ErrorKind::Other, \"no CARGO_MANIFEST_DIR\"))?,\n\n ))\n\n}\n\n\n","file_path":"build.rs","rank":10,"score":67900.22418698331},{"content":"#[doc(hidden)]\n\npub trait DemangleAsInner<'subs, W>: Demangle<'subs, W>\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n /// Write the inner demangling form of this AST node to the given context.\n\n fn demangle_as_inner<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n self.demangle(ctx, scope)\n\n }\n\n\n\n /// Cast this `DemangleAsInner` to a `Type`.\n\n fn downcast_to_type(&self) -> Option<&Type> {\n\n None\n\n }\n\n\n\n /// Cast this `DemangleAsInner` to a `FunctionType`.\n\n fn downcast_to_function_type(&self) -> Option<&FunctionType> {\n","file_path":"src/ast.rs","rank":11,"score":66157.2358381855},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct DemangleState {\n\n /// How deep in the demangling are we?\n\n pub recursion_level: u32,\n\n}\n\n\n","file_path":"src/ast.rs","rank":12,"score":58461.873349741974},{"content":"fn assert_demangles_as(mangled: &str, expected: &str, options: Option<DemangleOptions>) {\n\n let sym = cpp_demangle::BorrowedSymbol::new(mangled.as_bytes())\n\n .expect(\"should parse mangled symbol ok\");\n\n\n\n let actual = if let Some(o) = options {\n\n sym.demangle(&o).expect(\"should demangle ok\")\n\n } else {\n\n let mut actual = vec![];\n\n write!(&mut actual, \"{}\", sym).expect(\"should demangle symbol ok\");\n\n String::from_utf8(actual).expect(\"should demangle to valid utf-8\")\n\n };\n\n\n\n if expected != actual {\n\n println!();\n\n println!(\"Diff:\");\n\n println!(\"--- expected\");\n\n print!(\"+++ actual\");\n\n\n\n let mut last = None;\n\n for cmp in diff::chars(expected, &actual) {\n","file_path":"tests/tests.rs","rank":13,"score":56396.482091487655},{"content":"/// Read `tests/libiberty-demangle-expected`, parse its input mangled symbols,\n\n/// and expected output demangled symbols, and generate test cases for them.\n\n///\n\n/// We do not support all of the options that the libiberty demangler does,\n\n/// therefore we skip tests that use options we do not intend to\n\n/// support. Basically, we only support `--format=gnu-v3` (which is the System V\n\n/// C++ ABI), and none of the legacy C/C++ compiler formats, nor Java/D/etc\n\n/// language symbol mangling.\n\nfn generate_compatibility_tests_from_libiberty() -> io::Result<()> {\n\n let mut tests_dir = get_crate_dir()?;\n\n tests_dir.push(\"tests\");\n\n if !tests_dir.is_dir() {\n\n // We are in `cargo publish` and the `tests/` directory isn't included\n\n // in the distributed package.\n\n return Ok(());\n\n }\n\n\n\n println!(\"cargo:rerun-if-changed=tests/libiberty-demangle-expected\");\n\n\n\n let test_path = get_test_path(\"libiberty.rs\")?;\n\n let _ = fs::remove_file(&test_path);\n\n let mut test_file = fs::File::create(test_path)?;\n\n\n\n writeln!(\n\n &mut test_file,\n\n \"\n\nextern crate cpp_demangle;\n\nextern crate diff;\n","file_path":"build.rs","rank":14,"score":55879.74716560523},{"content":"/// When we first begin demangling, we haven't entered any function or template\n\n/// demangling scope and we don't have any useful `ArgScopeStack`. Therefore, we\n\n/// are never actually dealing with `ArgScopeStack` directly in practice, but\n\n/// always an `Option<ArgScopeStack>` instead. Nevertheless, we want to define\n\n/// useful methods on `Option<ArgScopeStack>`.\n\n///\n\n/// A custom \"extension\" trait with exactly one implementor: Rust's principled\n\n/// monkey patching!\n\ntrait ArgScopeStackExt<'prev, 'subs>: Copy {\n\n /// Push a new `ArgScope` onto this `ArgScopeStack` and return the new\n\n /// `ArgScopeStack` with the pushed resolver on top.\n\n fn push(\n\n &'prev self,\n\n item: &'subs dyn ArgScope<'subs, 'subs>,\n\n ) -> Option<ArgScopeStack<'prev, 'subs>>;\n\n}\n\n\n\nimpl<'prev, 'subs> ArgScopeStackExt<'prev, 'subs> for Option<ArgScopeStack<'prev, 'subs>> {\n\n fn push(\n\n &'prev self,\n\n item: &'subs dyn ArgScope<'subs, 'subs>,\n\n ) -> Option<ArgScopeStack<'prev, 'subs>> {\n\n log!(\"ArgScopeStack::push: {:?}\", item);\n\n Some(ArgScopeStack {\n\n prev: self.as_ref(),\n\n in_arg: None,\n\n item: item,\n\n })\n","file_path":"src/ast.rs","rank":15,"score":55767.239439887766},{"content":"/// The `<number>` production.\n\n///\n\n/// ```text\n\n/// <number> ::= [n] <non-negative decimal integer>\n\n/// ```\n\ntype Number = isize;\n\n\n\nimpl Parse for Number {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n _subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(isize, IndexStr<'b>)> {\n\n try_begin_parse!(\"Number\", ctx, input);\n\n parse_number(10, true, input)\n\n }\n\n}\n\n\n\n/// A <seq-id> production encoding a base-36 positive number.\n\n///\n\n/// ```text\n\n/// <seq-id> ::= <0-9A-Z>+\n\n/// ```\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\npub struct SeqId(usize);\n","file_path":"src/ast.rs","rank":16,"score":55728.14544576074},{"content":"fn get_crate_test_path(file_name: &str) -> io::Result<path::PathBuf> {\n\n let mut test_path = get_crate_dir()?;\n\n test_path.push(\"tests\");\n\n assert!(test_path.is_dir());\n\n test_path.push(file_name);\n\n Ok(test_path)\n\n}\n\n\n","file_path":"build.rs","rank":17,"score":55339.85983939213},{"content":"#[derive(Debug, Default, Clone, Copy)]\n\nstruct ParseContextState {\n\n // The current recursion level. Should always be less than or equal to the\n\n // maximum.\n\n recursion_level: u32,\n\n // Whether or not we are currently parsing a conversion operator.\n\n in_conversion: bool,\n\n}\n\n\n\n/// Common context needed when parsing.\n\n#[derive(Debug, Clone)]\n\npub struct ParseContext {\n\n // Maximum amount of recursive parsing calls we will allow. If this is too\n\n // large, we can blow the stack.\n\n max_recursion: u32,\n\n // Mutable state within the `ParseContext`.\n\n state: Cell<ParseContextState>,\n\n}\n\n\n\nimpl ParseContext {\n\n /// Construct a new `ParseContext`.\n","file_path":"src/ast.rs","rank":18,"score":55066.78033581306},{"content":"/// Generate tests that ensure that we don't panic when parsing and demangling\n\n/// the seed test cases that we pass to AFL.rs assert (including the failing\n\n/// test cases historically found by AFL.rs).\n\nfn generate_sanity_tests_from_afl_seeds() -> io::Result<()> {\n\n let mut in_dir = get_crate_dir()?;\n\n in_dir.push(\"in\");\n\n if !in_dir.is_dir() {\n\n // We are in `cargo publish` and the `in/` directory isn't included in\n\n // the distributed package.\n\n return Ok(());\n\n }\n\n\n\n let test_path = get_test_path(\"afl_seeds.rs\")?;\n\n let mut test_file = fs::File::create(test_path)?;\n\n\n\n writeln!(\n\n &mut test_file,\n\n \"\n\nextern crate cpp_demangle;\n\nuse std::fs;\n\nuse std::io::Read;\n\n\"\n\n )?;\n","file_path":"build.rs","rank":19,"score":53263.9748797856},{"content":"fn zero_or_more<'a, 'b, P>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n) -> Result<(Vec<P>, IndexStr<'b>)>\n\nwhere\n\n P: Parse,\n\n{\n\n let mut tail = input;\n\n let mut results = vec![];\n\n loop {\n\n if let Ok((parsed, tail_tail)) = P::parse(ctx, subs, tail) {\n\n results.push(parsed);\n\n tail = tail_tail;\n\n } else {\n\n return Ok((results, tail));\n\n }\n\n }\n\n}\n\n\n\n/// Parse a number with the given `base`. Do not allow negative numbers\n\n/// (prefixed with an 'n' instead of a '-') if `allow_signed` is false.\n","file_path":"src/ast.rs","rank":20,"score":53064.92418791747},{"content":"fn one_or_more<'a, 'b, P>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n) -> Result<(Vec<P>, IndexStr<'b>)>\n\nwhere\n\n P: Parse,\n\n{\n\n let (first, mut tail) = P::parse(ctx, subs, input)?;\n\n let mut results = vec![first];\n\n loop {\n\n if let Ok((parsed, tail_tail)) = P::parse(ctx, subs, tail) {\n\n results.push(parsed);\n\n tail = tail_tail;\n\n } else {\n\n return Ok((results, tail));\n\n }\n\n }\n\n}\n\n\n","file_path":"src/ast.rs","rank":21,"score":53064.92418791747},{"content":"/// An RAII type to automatically check the recursion level against the\n\n/// maximum. If the maximum has been crossed, return an error. Otherwise,\n\n/// increment the level upon construction, and decrement it upon destruction.\n\nstruct AutoParseDemangle<'a, 'b, W: 'a + DemangleWrite>(&'b mut DemangleContext<'a, W>);\n\n\n\nimpl<'a, 'b, W: 'a + DemangleWrite> AutoParseDemangle<'a, 'b, W> {\n\n #[inline]\n\n fn new(ctx: &'b mut DemangleContext<'a, W>) -> std::result::Result<Self, fmt::Error> {\n\n ctx.enter_recursion()?;\n\n Ok(AutoParseDemangle(ctx))\n\n }\n\n}\n\n\n\nimpl<'a, 'b, W: 'a + DemangleWrite> std::ops::Deref for AutoParseDemangle<'a, 'b, W> {\n\n type Target = DemangleContext<'a, W>;\n\n\n\n fn deref(&self) -> &Self::Target {\n\n self.0\n\n }\n\n}\n\n\n\nimpl<'a, 'b, W: 'a + DemangleWrite> std::ops::DerefMut for AutoParseDemangle<'a, 'b, W> {\n\n fn deref_mut(&mut self) -> &mut Self::Target {\n","file_path":"src/ast.rs","rank":22,"score":51771.99747803782},{"content":"#[doc(hidden)]\n\npub trait Parse: Sized {\n\n /// Parse the `Self` value from `input` and return it, updating the\n\n /// substitution table as needed.\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(Self, IndexStr<'b>)>;\n\n}\n\n\n","file_path":"src/ast.rs","rank":23,"score":50780.943196454566},{"content":"fn get_out_dir() -> io::Result<path::PathBuf> {\n\n Ok(path::PathBuf::from(env::var(\"OUT_DIR\").map_err(|_| {\n\n io::Error::new(io::ErrorKind::Other, \"no OUT_DIR\")\n\n })?))\n\n}\n\n\n","file_path":"build.rs","rank":24,"score":49990.148681640654},{"content":"/// An RAII type to automatically check the recursion level against the\n\n/// maximum. If the maximum has been crossed, return an error. Otherwise,\n\n/// increment the level upon construction, and decrement it upon destruction.\n\nstruct AutoParseRecursion<'a>(&'a ParseContext);\n\n\n\nimpl<'a> AutoParseRecursion<'a> {\n\n #[inline]\n\n fn new(ctx: &'a ParseContext) -> error::Result<AutoParseRecursion<'a>> {\n\n ctx.enter_recursion()?;\n\n Ok(AutoParseRecursion(ctx))\n\n }\n\n}\n\n\n\nimpl<'a> Drop for AutoParseRecursion<'a> {\n\n #[inline]\n\n fn drop(&mut self) {\n\n self.0.exit_recursion();\n\n }\n\n}\n\n\n\n/// A trait for anything that can be parsed from an `IndexStr` and return a\n\n/// `Result` of the parsed `Self` value and the rest of the `IndexStr` input\n\n/// that has not been consumed in parsing the `Self` value.\n\n///\n\n/// For AST types representing productions which have `<substitution>` as a\n\n/// possible right hand side, do not implement this trait directly. Instead,\n\n/// make a newtype over `usize`, parse either the `<substitution>` back\n\n/// reference or \"real\" value, insert the \"real\" value into the substitution\n\n/// table if needed, and *always* return the newtype index into the substitution\n\n/// table.\n","file_path":"src/ast.rs","rank":25,"score":48607.23393673239},{"content":"fn main() {\n\n println!(\"cargo:rerun-if-changed=build.rs\");\n\n\n\n generate_sanity_tests_from_afl_seeds()\n\n .expect(\"should generate sanity tests from AFL.rs seed test cases\");\n\n\n\n generate_compatibility_tests_from_libiberty()\n\n .expect(\"should generate compatibility tests from tests/libiberty-demangle-expected\");\n\n}\n","file_path":"build.rs","rank":26,"score":42093.75971219857},{"content":"fn get_test_path(file_name: &str) -> io::Result<path::PathBuf> {\n\n let mut test_path = get_out_dir()?;\n\n assert!(test_path.is_dir());\n\n test_path.push(file_name);\n\n Ok(test_path)\n\n}\n\n\n","file_path":"build.rs","rank":27,"score":40275.672495102},{"content":"fn main() {\n\n let matches = App::new(\"cppfilt\")\n\n .version(crate_version!())\n\n .author(crate_authors!())\n\n .about(\"A c++filt clone as an example of how to use the cpp_demangle crate!\")\n\n .arg(\n\n Arg::with_name(\"noparams\")\n\n .short(\"p\")\n\n .long(\"no-params\")\n\n .help(\"Do not display function arguments\"),\n\n )\n\n .arg(\n\n Arg::with_name(\"mangled_names\")\n\n .multiple(true)\n\n .value_delimiter(\" \"),\n\n )\n\n .get_matches();\n\n\n\n let stdin = io::stdin();\n\n let mut stdin = stdin.lock();\n","file_path":"examples/cppfilt.rs","rank":28,"score":39463.4211910264},{"content":"#[test]\n\nfn test_afl_seed_{}() {{\n\n let mut file = fs::File::open(\"{}\").unwrap();\n\n let mut contents = Vec::new();\n\n file.read_to_end(&mut contents).unwrap();\n\n let _ = cpp_demangle::Symbol::new(contents);\n\n assert!(true, \"did not panic when parsing\");\n\n}}\n\n\"#,\n\n file_name.to_string_lossy(),\n\n path.to_string_lossy()\n\n )?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"build.rs","rank":29,"score":37226.61937000838},{"content":" uint32_t recursion_limit;\n","file_path":"c_api/include/cpp_demangle.h","rank":30,"score":35303.4581306785},{"content":"#[test]\n\nfn libxul_symbols_demangle() {\n\n let mut total = 0;\n\n let mut num_parsed = 0;\n\n let mut num_demangled = 0;\n\n let mut num_match_libiberty = 0;\n\n\n\n let libxul_txt_file = fs::File::open(concat!(env!(\"CARGO_MANIFEST_DIR\"), \"/tests/libxul.txt\"))\n\n .expect(\"should open libxul.txt\");\n\n let mut libxul_txt_file = BufReader::new(libxul_txt_file);\n\n\n\n let log_file = fs::File::create(concat!(env!(\"CARGO_MANIFEST_DIR\"), \"/tests/libxul.log\"))\n\n .expect(\"should create log file\");\n\n let mut log_file = BufWriter::new(log_file);\n\n\n\n let mut line = Vec::new();\n\n let mut demangled = Vec::new();\n\n let mut libiberty_sym = Vec::new();\n\n\n\n let which_cppfilt = get_cppfilt();\n\n let mut cppfilt = process::Command::new(which_cppfilt)\n","file_path":"tests/libxul.rs","rank":31,"score":35301.18307128251},{"content":"#[test]\n\nfn test_libiberty_demangle_{}_() {{\n\n let mangled = br#\"{}\"#;\n\n let mangled_str = String::from_utf8_lossy(mangled).into_owned();\n\n println!(\"Parsing mangled symbol: {{}}\", mangled_str);\n\n\n\n let expected = r#\"{}\"#;\n\n\n\n let sym = match cpp_demangle::Symbol::new(&mangled[..]) {{\n\n Ok(sym) => sym,\n\n Err(_) if mangled_str == expected => return,\n\n Err(e) => panic!(\"Should parse mangled symbol {{}}\", e),\n\n }};\n\n\n\n let mut actual = String::new();\n\n if let Err(e) = write!(&mut actual, \"{{}}\", sym) {{\n\n panic!(\"Error while demangling '{{}}': {{}}\",\n\n mangled_str,\n\n e);\n\n }}\n\n\n","file_path":"build.rs","rank":32,"score":34481.157585963636},{"content":"#[test]\n\nfn test_stackoverflow_does_not_occur_issue_186() {\n\n assert_does_not_demangle(\"__ZNSt3__18__bind_rINS_4pairINS_12basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEE8cc_errorEEZN5stlab2v15asyncIZNSB_14serial_queue_tclIZN12_GLOBAL__N_114future_adaptorIN10redacteLib12ValueOrErrorIS7_EEZNK10cc_element17rendition_requestEmbE4$_14EEDaNS_6futureIT_EEOT0_EUlSO_E_JNSN_ISJ_EEEEESM_OSO_DpOT0_EUlSU_E_SS_JST_EEENSB_6futureINS_9result_ofIFNS_5decayISQ_E4typeEDpNS11_IT1_E4typeEEE4typeEvEESO_SR_DpOS14_EUlRST_E_JST_EEC1IS1F_JST_EvEESU_SX_\");\n\n}\n\n\n\ndemangles!(\n\n _ZN7mozilla6detail12ListenerImplINS_14AbstractThreadEZNS_20MediaEventSourceImplILNS_14ListenerPolicyE0EJNS_13TimedMetadataEEE15ConnectInternalIS2_NS_12MediaDecoderEMS8_FvOS5_EEENS_8EnableIfIXsr8TakeArgsIT1_EE5valueENS_18MediaEventListenerEE4TypeEPT_PT0_SD_EUlS9_E_JS5_EE17ApplyWithArgsImplISL_EENSC_IXsr8TakeArgsISH_EE5valueEvE4TypeERKSH_S9_,\n\n // This does not match llvm-cxxfilt\n\n \"mozilla::EnableIf<TakeArgs<mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1}>::value, void>::Type mozilla::detail::ListenerImpl<mozilla::AbstractThread, mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1}, mozilla::TimedMetadata>::ApplyWithArgsImpl<mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1}>(mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1} const&, mozilla::TimedMetadata&&)\"\n\n);\n\n\n\ndemangles!(\n\n _Z20instantiate_with_intI3FooET_IiEv,\n\n \"Foo<int> instantiate_with_int<Foo>()\"\n\n);\n\ndemangles!(_Z3fooISt6vectorIiEEvv, \"void foo<std::vector<int> >()\");\n\ndemangles!(__ZN3foo3barE3quxS0_, \"foo::bar(qux, qux)\");\n\ndemangles!(__ZN3foo3barE3quxS_, \"foo::bar(qux, foo)\");\n\n\n\ndemangles!(\n\n _ZN4funcI2TyEEN6ResultIT_EES3_,\n","file_path":"tests/tests.rs","rank":33,"score":33626.32915175456},{"content":"//! Custom `Error` and `Result` types for the `cpp_demangle` crate.\n\n\n\n#[cfg(feature = \"std\")]\n\nuse std::error;\n\nuse std::fmt;\n\n\n\n/// Errors that can occur while demangling a symbol.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub enum Error {\n\n /// The mangled symbol ends abruptly.\n\n UnexpectedEnd,\n\n\n\n /// The mangled symbol is not well-formed.\n\n UnexpectedText,\n\n\n\n /// Found a back reference that is out-of-bounds of the substitution\n\n /// table.\n\n BadBackReference,\n\n\n\n /// Found a reference to a template arg that is either out-of-bounds, or in\n","file_path":"src/error.rs","rank":35,"score":32694.183236243978},{"content":"#[cfg(feature = \"logging\")]\n\nmacro_rules! log {\n\n ( $fmt:expr ) => {\n\n println!($fmt);\n\n };\n\n ( $fmt:expr, $($x:tt)* ) => {\n\n println!($fmt, $($x)*);\n\n }\n\n}\n\n\n\n#[cfg(not(feature = \"logging\"))]\n\nmacro_rules! log {\n\n ( $fmt:expr ) => {};\n\n ( $fmt:expr, $($x:tt)* ) => {\n\n if false { let _ = format!($fmt, $($x)*); }\n\n };\n\n}\n","file_path":"src/logging.rs","rank":36,"score":32693.30010439536},{"content":" ),\n\n Error::TooMuchRecursion => {\n\n write!(f, \"encountered too much recursion when demangling symbol\")\n\n }\n\n }\n\n }\n\n}\n\n\n\n#[cfg(feature = \"std\")]\n\nimpl error::Error for Error {\n\n fn description(&self) -> &str {\n\n match *self {\n\n Error::UnexpectedEnd => \"mangled symbol ends abruptly\",\n\n Error::UnexpectedText => \"mangled symbol is not well-formed\",\n\n Error::BadBackReference => {\n\n \"back reference that is out-of-bounds of the substitution table\"\n\n }\n\n Error::BadTemplateArgReference => {\n\n \"reference to a template arg that is either out-of-bounds, or in a context \\\n\n without template args\"\n","file_path":"src/error.rs","rank":37,"score":32678.078797358077},{"content":" }\n\n Error::ForwardTemplateArgReference => {\n\n \"reference to a template arg from itself or a later template arg\"\n\n }\n\n Error::BadFunctionArgReference => {\n\n \"reference to a function arg that is either out-of-bounds, or in a context \\\n\n without function args\"\n\n }\n\n Error::BadLeafNameReference => {\n\n \"reference to a leaf name in a context where there is no current leaf name\"\n\n }\n\n Error::Overflow => {\n\n \"an overflow or underflow would occur when parsing an integer in a mangled symbol\"\n\n }\n\n Error::TooMuchRecursion => \"encountered too much recursion when demangling symbol\",\n\n }\n\n }\n\n}\n\n\n\n/// A demangling result of `T` or a `cpp_demangle::error::Error`.\n\npub type Result<T> = ::std::result::Result<T, Error>;\n","file_path":"src/error.rs","rank":38,"score":32676.396778901522},{"content":" \"reference to a template arg that is either out-of-bounds, or in a context \\\n\n without template args\"\n\n ),\n\n Error::ForwardTemplateArgReference => write!(\n\n f,\n\n \"reference to a template arg from itself or a later template arg\"\n\n ),\n\n Error::BadFunctionArgReference => write!(\n\n f,\n\n \"reference to a function arg that is either out-of-bounds, or in a context \\\n\n without function args\"\n\n ),\n\n Error::BadLeafNameReference => write!(\n\n f,\n\n \"reference to a leaf name in a context where there is no current leaf name\"\n\n ),\n\n Error::Overflow => write!(\n\n f,\n\n \"an overflow or underflow would occur when parsing an integer in a mangled \\\n\n symbol\"\n","file_path":"src/error.rs","rank":39,"score":32666.21376262476},{"content":" /// a context without template args.\n\n BadTemplateArgReference,\n\n\n\n /// Found a reference to a template arg from within the arg itself (or from\n\n /// within an earlier arg).\n\n ForwardTemplateArgReference,\n\n\n\n /// Found a reference to a function arg that is either out-of-bounds, or in\n\n /// a context without function args.\n\n BadFunctionArgReference,\n\n\n\n /// Found a reference to a leaf name in a context where there is no current\n\n /// leaf name.\n\n BadLeafNameReference,\n\n\n\n /// An overflow or underflow would occur when parsing an integer in a\n\n /// mangled symbol.\n\n Overflow,\n\n\n\n /// Encountered too much recursion when demangling symbol.\n\n TooMuchRecursion,\n\n}\n\n\n\n#[test]\n","file_path":"src/error.rs","rank":40,"score":32661.49072196717},{"content":"\n\n /// A `<template-template-param>` production.\n\n TemplateTemplateParam(ast::TemplateTemplateParam),\n\n\n\n /// An `<unresolved-type>` production.\n\n UnresolvedType(ast::UnresolvedType),\n\n\n\n /// A `<prefix>` production.\n\n Prefix(ast::Prefix),\n\n}\n\n\n\nimpl<'subs, W> ast::Demangle<'subs, W> for Substitutable\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut ast::DemangleContext<'subs, W>,\n\n scope: Option<ast::ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n","file_path":"src/subs.rs","rank":41,"score":32649.951081810384},{"content":" non_substitutions: Vec<Substitutable>,\n\n}\n\n\n\nimpl fmt::Debug for SubstitutionTable {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n f.pad(\"SubstitutionTable \")?;\n\n f.debug_map()\n\n .entries(self.substitutions.iter().enumerate())\n\n .finish()?;\n\n f.pad(\"non_substitutions \")?;\n\n f.debug_map()\n\n .entries(self.non_substitutions.iter().enumerate())\n\n .finish()\n\n }\n\n}\n\n\n\nimpl SubstitutionTable {\n\n /// Construct a new `SubstitutionTable`.\n\n pub fn new() -> SubstitutionTable {\n\n Default::default()\n","file_path":"src/subs.rs","rank":42,"score":32648.058003898364},{"content":"//! Types dealing with the substitutions table.\n\n\n\nuse super::DemangleWrite;\n\nuse ast;\n\nuse std::fmt;\n\nuse std::iter::FromIterator;\n\nuse std::ops::Deref;\n\nuse vec::Vec;\n\n\n\n/// An enumeration of all of the types that can end up in the substitution\n\n/// table.\n\n#[doc(hidden)]\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\n#[allow(clippy::large_enum_variant)]\n\npub enum Substitutable {\n\n /// An `<unscoped-template-name>` production.\n\n UnscopedTemplateName(ast::UnscopedTemplateName),\n\n\n\n /// A `<type>` production.\n\n Type(ast::Type),\n","file_path":"src/subs.rs","rank":43,"score":32646.698374675023},{"content":" pub fn contains(&self, idx: usize) -> bool {\n\n idx < self.substitutions.len()\n\n }\n\n\n\n /// Get the type referenced by the given handle, or None if there is no such\n\n /// entry, or there is an entry that is not a type.\n\n pub fn get_type(&self, handle: &ast::TypeHandle) -> Option<&ast::Type> {\n\n if let ast::TypeHandle::BackReference(idx) = *handle {\n\n self.substitutions.get(idx).and_then(|s| match *s {\n\n Substitutable::Type(ref ty) => Some(ty),\n\n _ => None,\n\n })\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n /// Remove the last entry from the substitutions table and return it, or\n\n /// `None` if the table is empty.\n\n pub fn pop(&mut self) -> Option<Substitutable> {\n","file_path":"src/subs.rs","rank":44,"score":32646.39836981994},{"content":" match *self {\n\n Substitutable::UnscopedTemplateName(ref name) => name.demangle(ctx, scope),\n\n Substitutable::Type(ref ty) => ty.demangle(ctx, scope),\n\n Substitutable::TemplateTemplateParam(ref ttp) => ttp.demangle(ctx, scope),\n\n Substitutable::UnresolvedType(ref ty) => ty.demangle(ctx, scope),\n\n Substitutable::Prefix(ref prefix) => prefix.demangle(ctx, scope),\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> ast::GetLeafName<'a> for Substitutable {\n\n fn get_leaf_name(&'a self, subs: &'a SubstitutionTable) -> Option<ast::LeafName<'a>> {\n\n match *self {\n\n Substitutable::UnscopedTemplateName(ref name) => name.get_leaf_name(subs),\n\n Substitutable::Prefix(ref prefix) => prefix.get_leaf_name(subs),\n\n Substitutable::Type(ref ty) => ty.get_leaf_name(subs),\n\n _ => None,\n\n }\n\n }\n\n}\n","file_path":"src/subs.rs","rank":45,"score":32643.117622880716},{"content":"\n\nimpl ast::IsCtorDtorConversion for Substitutable {\n\n fn is_ctor_dtor_conversion(&self, subs: &SubstitutionTable) -> bool {\n\n match *self {\n\n Substitutable::Prefix(ref prefix) => prefix.is_ctor_dtor_conversion(subs),\n\n _ => false,\n\n }\n\n }\n\n}\n\n\n\n/// The table of substitutable components that we have parsed thus far, and for\n\n/// which there are potential back-references.\n\n#[doc(hidden)]\n\n#[derive(Clone, Default, PartialEq, Eq)]\n\npub struct SubstitutionTable {\n\n substitutions: Vec<Substitutable>,\n\n // There are components which are typically candidates for substitution, but\n\n // in some particular circumstances are not. Instances of such components\n\n // which are not candidates for substitution end up in this part of the\n\n // table. See `<prefix>` parsing for further details.\n","file_path":"src/subs.rs","rank":46,"score":32640.59149956724},{"content":" log!(\"SubstitutionTable::pop @ {}: {:?}\", self.len(), self.last());\n\n self.substitutions.pop()\n\n }\n\n\n\n /// Get the `idx`th entity that is not a candidate for substitution. Panics\n\n /// if `idx` is out of bounds.\n\n pub fn non_substitution(&self, idx: usize) -> &Substitutable {\n\n &self.non_substitutions[idx]\n\n }\n\n\n\n /// Get the `idx`th entity that is not a candidate for substitution. Returns\n\n /// `None` if `idx` is out of bounds.\n\n pub fn get_non_substitution(&self, idx: usize) -> Option<&Substitutable> {\n\n self.non_substitutions.get(idx)\n\n }\n\n}\n\n\n\nimpl FromIterator<Substitutable> for SubstitutionTable {\n\n fn from_iter<I: IntoIterator<Item = Substitutable>>(iter: I) -> Self {\n\n SubstitutionTable {\n","file_path":"src/subs.rs","rank":47,"score":32638.432851458263},{"content":" }\n\n\n\n /// Insert a freshly-parsed substitutable component into the table and\n\n /// return the index at which it now lives.\n\n pub fn insert(&mut self, entity: Substitutable) -> usize {\n\n let idx = self.substitutions.len();\n\n log!(\"SubstitutionTable::insert @ {}: {:?}\", idx, entity);\n\n self.substitutions.push(entity);\n\n idx\n\n }\n\n\n\n /// Insert a an entity into the table that is not a candidate for\n\n /// substitution.\n\n pub fn insert_non_substitution(&mut self, entity: Substitutable) -> usize {\n\n let idx = self.non_substitutions.len();\n\n self.non_substitutions.push(entity);\n\n idx\n\n }\n\n\n\n /// Does this substitution table contain a component at the given index?\n","file_path":"src/subs.rs","rank":48,"score":32634.336695799782},{"content":" substitutions: Vec::from_iter(iter),\n\n non_substitutions: vec![],\n\n }\n\n }\n\n}\n\n\n\nimpl Deref for SubstitutionTable {\n\n type Target = [Substitutable];\n\n\n\n fn deref(&self) -> &Self::Target {\n\n &self.substitutions[..]\n\n }\n\n}\n","file_path":"src/subs.rs","rank":49,"score":32631.83116185195},{"content":"fn assert_does_not_parse(s: &str) {\n\n if let Ok(sym) = cpp_demangle::BorrowedSymbol::new(s.as_bytes()) {\n\n panic!(\"Unexpectedly parsed '{}' as '{}'\", s, sym);\n\n }\n\n}\n\n\n","file_path":"tests/tests.rs","rank":50,"score":31035.081733336232},{"content":"fn assert_does_not_demangle(s: &str) {\n\n match cpp_demangle::BorrowedSymbol::new(s.as_bytes()) {\n\n Ok(sym) => {\n\n if let Ok(d) = sym.demangle(&DemangleOptions::default()) {\n\n panic!(\"Unexpectedly demangled '{}' as '{}'\", s, d);\n\n }\n\n }\n\n Err(e) => {\n\n panic!(\"Failed to parse '{}': {}\", s, e);\n\n }\n\n }\n\n}\n\n\n\nmacro_rules! demangles {\n\n ( $mangled:ident , $demangled:expr ) => {\n\n demangles!($mangled, stringify!($mangled), $demangled);\n\n };\n\n ( $name:ident , $mangled:expr , $demangled:expr ) => {\n\n #[test]\n\n fn $name() {\n","file_path":"tests/tests.rs","rank":51,"score":31035.081733336232},{"content":"fn get_cppfilt() -> &'static str {\n\n if cfg!(not(target_os = \"macos\")) {\n\n return \"c++filt\";\n\n }\n\n\n\n // Prefer `gc++filt` (from the homebrew binutils package) since it is built\n\n // with a newer libiberty than the system `c++filt` (and maybe the system\n\n // `c++filt` will be backed by the LLVM demangler one day).\n\n match process::Command::new(\"gc++filt\").spawn() {\n\n Ok(mut child) => {\n\n child.kill().expect(\"should kill child\");\n\n child.wait().expect(\"should wait on child\");\n\n \"gc++filt\"\n\n }\n\n Err(_) => \"c++filt\",\n\n }\n\n}\n\n\n","file_path":"tests/libxul.rs","rank":52,"score":29360.22781380828},{"content":" P: Debug + Parse + PartialEq,\n\n S: AsRef<[Substitutable]>,\n\n I: AsRef<[u8]>,\n\n {\n\n let input = input.as_ref();\n\n let ctx = ParseContext::new(Default::default());\n\n let mut subs = SubstitutionTable::from_iter(subs.as_ref().iter().cloned());\n\n\n\n match P::parse(&ctx, &mut subs, IndexStr::from(input)) {\n\n Err(ref error) if *error == expected_error => {}\n\n Err(ref error) => {\n\n panic!(\n\n \"Parsing {:?} as {} produced an error of kind {:?}, but we expected kind {:?}\",\n\n String::from_utf8_lossy(input),\n\n production,\n\n error,\n\n expected_error\n\n );\n\n }\n\n Ok((value, tail)) => {\n","file_path":"src/ast.rs","rank":53,"score":24815.272250596714},{"content":"#[derive(Clone, Debug, PartialEq, Eq)]\n\npub struct DataMemberPrefix(SourceName);\n\n\n\nimpl Parse for DataMemberPrefix {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(DataMemberPrefix, IndexStr<'b>)> {\n\n try_begin_parse!(\"DataMemberPrefix\", ctx, input);\n\n\n\n let (name, tail) = SourceName::parse(ctx, subs, input)?;\n\n let tail = consume(b\"M\", tail)?;\n\n Ok((DataMemberPrefix(name), tail))\n\n }\n\n}\n\n\n\nimpl<'a> GetLeafName<'a> for DataMemberPrefix {\n\n #[inline]\n\n fn get_leaf_name(&'a self, _: &'a SubstitutionTable) -> Option<LeafName<'a>> {\n","file_path":"src/ast.rs","rank":54,"score":24814.494606021584},{"content":" subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(BareFunctionType, IndexStr<'b>)> {\n\n try_begin_parse!(\"BareFunctionType\", ctx, input);\n\n\n\n let (types, tail) = one_or_more::<TypeHandle>(ctx, subs, input)?;\n\n Ok((BareFunctionType(types), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for BareFunctionType\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n let ctx = try_begin_demangle!(self, ctx, scope);\n","file_path":"src/ast.rs","rank":55,"score":24814.21169932806},{"content":"/// The `<pointer-to-member-type>` production.\n\n///\n\n/// ```text\n\n/// <pointer-to-member-type> ::= M <class type> <member type>\n\n/// ```\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\npub struct PointerToMemberType(TypeHandle, TypeHandle);\n\n\n\nimpl Parse for PointerToMemberType {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(PointerToMemberType, IndexStr<'b>)> {\n\n try_begin_parse!(\"PointerToMemberType\", ctx, input);\n\n\n\n let tail = consume(b\"M\", input)?;\n\n let (ty1, tail) = TypeHandle::parse(ctx, subs, tail)?;\n\n let (ty2, tail) = TypeHandle::parse(ctx, subs, tail)?;\n\n Ok((PointerToMemberType(ty1, ty2), tail))\n","file_path":"src/ast.rs","rank":56,"score":24813.645554313614},{"content":" expected_tail: I2,\n\n expected_new_subs: S2,\n\n ) where\n\n P: Debug + Parse + PartialEq,\n\n S1: AsRef<[Substitutable]>,\n\n S2: AsRef<[Substitutable]>,\n\n I1: AsRef<[u8]>,\n\n I2: AsRef<[u8]>,\n\n {\n\n let ctx = ParseContext::new(Default::default());\n\n let input = input.as_ref();\n\n let expected_tail = expected_tail.as_ref();\n\n\n\n let expected_subs = SubstitutionTable::from_iter(\n\n subs.as_ref()\n\n .iter()\n\n .cloned()\n\n .chain(expected_new_subs.as_ref().iter().cloned()),\n\n );\n\n let mut subs = SubstitutionTable::from_iter(subs.as_ref().iter().cloned());\n","file_path":"src/ast.rs","rank":57,"score":24813.367080481614},{"content":" ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(FunctionType, IndexStr<'b>)> {\n\n try_begin_parse!(\"FunctionType\", ctx, input);\n\n\n\n let (cv_qualifiers, tail) =\n\n if let Ok((cv_qualifiers, tail)) = CvQualifiers::parse(ctx, subs, input) {\n\n (cv_qualifiers, tail)\n\n } else {\n\n (Default::default(), input)\n\n };\n\n\n\n let (transaction_safe, tail) = if let Ok(tail) = consume(b\"Dx\", tail) {\n\n (true, tail)\n\n } else {\n\n (false, tail)\n\n };\n\n\n\n let tail = consume(b\"F\", tail)?;\n","file_path":"src/ast.rs","rank":58,"score":24813.142258870514},{"content":"}\n\n\n\nimpl Parse for VectorType {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(VectorType, IndexStr<'b>)> {\n\n try_begin_parse!(\"VectorType\", ctx, input);\n\n\n\n let tail = consume(b\"Dv\", input)?;\n\n\n\n if let Ok((num, tail)) = parse_number(10, false, tail) {\n\n debug_assert!(num >= 0);\n\n let tail = consume(b\"_\", tail)?;\n\n let (ty, tail) = TypeHandle::parse(ctx, subs, tail)?;\n\n return Ok((VectorType::DimensionNumber(num as _, ty), tail));\n\n }\n\n\n\n let tail = consume(b\"_\", tail)?;\n","file_path":"src/ast.rs","rank":59,"score":24812.711271804725},{"content":" self.bytes_written += s.len();\n\n })\n\n }\n\n}\n\n\n\nimpl<'a, W> DemangleContext<'a, W>\n\nwhere\n\n W: 'a + DemangleWrite,\n\n{\n\n /// Construct a new `DemangleContext`.\n\n pub fn new(\n\n subs: &'a SubstitutionTable,\n\n input: &'a [u8],\n\n options: DemangleOptions,\n\n out: &'a mut W,\n\n ) -> DemangleContext<'a, W> {\n\n DemangleContext {\n\n subs: subs,\n\n max_recursion: options.recursion_limit.map(|v| v.get()).unwrap_or(128),\n\n inner: vec![],\n","file_path":"src/ast.rs","rank":60,"score":24811.895896926948},{"content":" _subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(UnnamedTypeName, IndexStr<'b>)> {\n\n try_begin_parse!(\"UnnamedTypeName\", ctx, input);\n\n\n\n let input = consume(b\"Ut\", input)?;\n\n let (number, input) = match parse_number(10, false, input) {\n\n Ok((number, input)) => (Some(number as _), input),\n\n Err(_) => (None, input),\n\n };\n\n let input = consume(b\"_\", input)?;\n\n Ok((UnnamedTypeName(number), input))\n\n }\n\n}\n\n\n\nimpl UnnamedTypeName {\n\n #[inline]\n\n fn starts_with(byte: u8) -> bool {\n\n byte == b'U'\n\n }\n","file_path":"src/ast.rs","rank":61,"score":24811.664218679965},{"content":" }\n\n}\n\n\n\nimpl Parse for TypeHandle {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(TypeHandle, IndexStr<'b>)> {\n\n try_begin_parse!(\"TypeHandle\", ctx, input);\n\n\n\n /// Insert the given type into the substitution table, and return a\n\n /// handle referencing the index in the table where it ended up.\n\n fn insert_and_return_handle<'a, 'b>(\n\n ty: Type,\n\n subs: &'a mut SubstitutionTable,\n\n tail: IndexStr<'b>,\n\n ) -> Result<(TypeHandle, IndexStr<'b>)> {\n\n let ty = Substitutable::Type(ty);\n\n let idx = subs.insert(ty);\n","file_path":"src/ast.rs","rank":62,"score":24811.212301713942},{"content":"/// <initializer> ::= pi <expression>* E # parenthesized initialization\n\n/// ```\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\npub struct Initializer(Vec<Expression>);\n\n\n\nimpl Parse for Initializer {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(Initializer, IndexStr<'b>)> {\n\n try_begin_parse!(\"Initializer\", ctx, input);\n\n\n\n let tail = consume(b\"pi\", input)?;\n\n let (exprs, tail) = zero_or_more::<Expression>(ctx, subs, tail)?;\n\n let tail = consume(b\"E\", tail)?;\n\n Ok((Initializer(exprs), tail))\n\n }\n\n}\n\n\n","file_path":"src/ast.rs","rank":63,"score":24810.93965366381},{"content":"impl Parse for LambdaSig {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(LambdaSig, IndexStr<'b>)> {\n\n try_begin_parse!(\"LambdaSig\", ctx, input);\n\n\n\n let (types, tail) = if let Ok(tail) = consume(b\"v\", input) {\n\n (vec![], tail)\n\n } else {\n\n one_or_more::<TypeHandle>(ctx, subs, input)?\n\n };\n\n Ok((LambdaSig(types), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for LambdaSig\n\nwhere\n\n W: 'subs + DemangleWrite,\n","file_path":"src/ast.rs","rank":64,"score":24810.72512497221},{"content":"//! Abstract syntax tree types for mangled symbols.\n\n\n\nuse super::{DemangleNodeType, DemangleOptions, DemangleWrite, ParseOptions};\n\nuse boxed::Box;\n\nuse error::{self, Result};\n\nuse index_str::IndexStr;\n\nuse std::cell::Cell;\n\n#[cfg(feature = \"logging\")]\n\nuse std::cell::RefCell;\n\nuse std::fmt::{self, Write};\n\nuse std::hash::{Hash, Hasher};\n\nuse std::mem;\n\nuse std::ops;\n\nuse std::ptr;\n\nuse string::String;\n\nuse subs::{Substitutable, SubstitutionTable};\n\nuse vec::Vec;\n\n\n","file_path":"src/ast.rs","rank":65,"score":24810.725574417444},{"content":"\n\nimpl Parse for CvQualifiers {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n _subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(CvQualifiers, IndexStr<'b>)> {\n\n try_begin_parse!(\"CvQualifiers\", ctx, input);\n\n\n\n let (restrict, tail) = if let Ok(tail) = consume(b\"r\", input) {\n\n (true, tail)\n\n } else {\n\n (false, input)\n\n };\n\n\n\n let (volatile, tail) = if let Ok(tail) = consume(b\"V\", tail) {\n\n (true, tail)\n\n } else {\n\n (false, tail)\n\n };\n","file_path":"src/ast.rs","rank":66,"score":24810.341101054466},{"content":" extra NonSubstitution(NonSubstitution),\n\n }\n\n}\n\n\n\nimpl Parse for PrefixHandle {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(PrefixHandle, IndexStr<'b>)> {\n\n try_begin_parse!(\"PrefixHandle\", ctx, input);\n\n\n\n #[inline]\n\n fn save(\n\n subs: &mut SubstitutionTable,\n\n prefix: Prefix,\n\n tail_tail: IndexStr<'_>,\n\n ) -> PrefixHandle {\n\n if let Some(b'E') = tail_tail.peek() {\n\n // An `E` means that we just finished parsing a `<nested-name>`\n","file_path":"src/ast.rs","rank":67,"score":24810.090639172002},{"content":"pub enum ArrayType {\n\n /// An array with a number-literal dimension.\n\n DimensionNumber(usize, TypeHandle),\n\n\n\n /// An array with an expression for its dimension.\n\n DimensionExpression(Expression, TypeHandle),\n\n\n\n /// An array with no dimension.\n\n NoDimension(TypeHandle),\n\n}\n\n\n\nimpl Parse for ArrayType {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(ArrayType, IndexStr<'b>)> {\n\n try_begin_parse!(\"ArrayType\", ctx, input);\n\n\n\n let tail = consume(b\"A\", input)?;\n","file_path":"src/ast.rs","rank":68,"score":24810.030123114877},{"content":"pub struct TemplateArgs(Vec<TemplateArg>);\n\n\n\nimpl Parse for TemplateArgs {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(TemplateArgs, IndexStr<'b>)> {\n\n try_begin_parse!(\"TemplateArgs\", ctx, input);\n\n\n\n let tail = consume(b\"I\", input)?;\n\n\n\n let (args, tail) = one_or_more::<TemplateArg>(ctx, subs, tail)?;\n\n let tail = consume(b\"E\", tail)?;\n\n Ok((TemplateArgs(args), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for TemplateArgs\n\nwhere\n","file_path":"src/ast.rs","rank":69,"score":24809.853729370734},{"content":"/// <source-name> ::= <positive length number> <identifier>\n\n/// ```\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\npub struct SourceName(Identifier);\n\n\n\nimpl Parse for SourceName {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(SourceName, IndexStr<'b>)> {\n\n try_begin_parse!(\"SourceName\", ctx, input);\n\n\n\n let (source_name_len, input) = parse_number(10, false, input)?;\n\n debug_assert!(source_name_len >= 0);\n\n if source_name_len == 0 {\n\n return Err(error::Error::UnexpectedText);\n\n }\n\n\n\n let (head, tail) = match input.try_split_at(source_name_len as _) {\n","file_path":"src/ast.rs","rank":70,"score":24809.77638528423},{"content":" end: usize,\n\n}\n\n\n\nimpl Parse for CloneTypeIdentifier {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n _subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(CloneTypeIdentifier, IndexStr<'b>)> {\n\n try_begin_parse!(\"CloneTypeIdentifier\", ctx, input);\n\n\n\n if input.is_empty() {\n\n return Err(error::Error::UnexpectedEnd);\n\n }\n\n\n\n let end = input\n\n .as_ref()\n\n .iter()\n\n .map(|&c| c as char)\n\n .take_while(|&c| c == '$' || c == '_' || c.is_digit(36))\n","file_path":"src/ast.rs","rank":71,"score":24809.74865030145},{"content":" (b't', tail) | (_, tail) => {\n\n let (base, tail) = Encoding::parse(ctx, subs, tail)?;\n\n Ok((SpecialName::TransactionClone(Box::new(base)), tail))\n\n }\n\n }\n\n }\n\n _ => Err(error::Error::UnexpectedText),\n\n }\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for SpecialName\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n","file_path":"src/ast.rs","rank":72,"score":24809.74063922428},{"content":"\n\nimpl Parse for NestedName {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(NestedName, IndexStr<'b>)> {\n\n try_begin_parse!(\"NestedName\", ctx, input);\n\n\n\n let tail = consume(b\"N\", input)?;\n\n\n\n let (cv_qualifiers, tail) = if let Ok((q, tail)) = CvQualifiers::parse(ctx, subs, tail) {\n\n (q, tail)\n\n } else {\n\n (Default::default(), tail)\n\n };\n\n\n\n let (ref_qualifier, tail) = if let Ok((r, tail)) = RefQualifier::parse(ctx, subs, tail) {\n\n (Some(r), tail)\n\n } else {\n","file_path":"src/ast.rs","rank":73,"score":24809.73470477918},{"content":" subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(Substitution, IndexStr<'b>)> {\n\n try_begin_parse!(\"Substitution\", ctx, input);\n\n\n\n if let Ok((well_known, tail)) = WellKnownComponent::parse(ctx, subs, input) {\n\n return Ok((Substitution::WellKnown(well_known), tail));\n\n }\n\n\n\n let tail = consume(b\"S\", input)?;\n\n let (idx, tail) = if let Ok((idx, tail)) = SeqId::parse(ctx, subs, tail) {\n\n (idx.0 + 1, tail)\n\n } else {\n\n (0, tail)\n\n };\n\n\n\n if !subs.contains(idx) {\n\n return Err(error::Error::BadBackReference);\n\n }\n\n\n","file_path":"src/ast.rs","rank":74,"score":24809.72192687848},{"content":"\n\nimpl Parse for FunctionParam {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(FunctionParam, IndexStr<'b>)> {\n\n try_begin_parse!(\"FunctionParam\", ctx, input);\n\n\n\n let tail = consume(b\"f\", input)?;\n\n if tail.is_empty() {\n\n return Err(error::Error::UnexpectedEnd);\n\n }\n\n\n\n let (scope, tail) = if let Ok(tail) = consume(b\"L\", tail) {\n\n parse_number(10, false, tail)?\n\n } else {\n\n (0, tail)\n\n };\n\n\n","file_path":"src/ast.rs","rank":75,"score":24809.62218689584},{"content":"\n\n /// A non-standard, vendor extension type.\n\n ///\n\n /// ```text\n\n /// <builtin-type> ::= u <source-name> # vendor extended type\n\n /// ```\n\n Extension(SourceName),\n\n}\n\n\n\nimpl Parse for BuiltinType {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(BuiltinType, IndexStr<'b>)> {\n\n try_begin_parse!(\"BuiltinType\", ctx, input);\n\n\n\n if let Ok((ty, tail)) = StandardBuiltinType::parse(ctx, subs, input) {\n\n return Ok((BuiltinType::Standard(ty), tail));\n\n }\n","file_path":"src/ast.rs","rank":76,"score":24809.40688364524},{"content":" LocalSourceName(SourceName, Option<Discriminator>),\n\n /// A generated name for an unnamed type.\n\n UnnamedType(UnnamedTypeName),\n\n /// An ABI tag.\n\n ABITag(TaggedName),\n\n /// A closure type name\n\n ClosureType(ClosureTypeName),\n\n}\n\n\n\nimpl Parse for UnqualifiedName {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(UnqualifiedName, IndexStr<'b>)> {\n\n try_begin_parse!(\"UnqualifiedName\", ctx, input);\n\n\n\n if let Ok((op, tail)) = OperatorName::parse(ctx, subs, input) {\n\n return Ok((UnqualifiedName::Operator(op), tail));\n\n }\n","file_path":"src/ast.rs","rank":77,"score":24809.35235584957},{"content":"pub struct TaggedName(SourceName);\n\n\n\nimpl Parse for TaggedName {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(TaggedName, IndexStr<'b>)> {\n\n try_begin_parse!(\"TaggedName\", ctx, input);\n\n\n\n let tail = consume(b\"B\", input)?;\n\n let (source_name, tail) = SourceName::parse(ctx, subs, tail)?;\n\n Ok((TaggedName(source_name), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for TaggedName\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n","file_path":"src/ast.rs","rank":78,"score":24809.33641191669},{"content":" pub fn new(options: ParseOptions) -> ParseContext {\n\n ParseContext {\n\n max_recursion: options.recursion_limit.map(|v| v.get()).unwrap_or(96),\n\n state: Cell::new(ParseContextState::default()),\n\n }\n\n }\n\n\n\n /// Get the current recursion level for this context.\n\n pub fn recursion_level(&self) -> u32 {\n\n self.state.get().recursion_level\n\n }\n\n\n\n #[inline]\n\n fn enter_recursion(&self) -> error::Result<()> {\n\n let mut state = self.state.get();\n\n let new_recursion_level = state.recursion_level + 1;\n\n\n\n if new_recursion_level >= self.max_recursion {\n\n log!(\"Hit too much recursion at level {}\", self.max_recursion);\n\n Err(error::Error::TooMuchRecursion)\n","file_path":"src/ast.rs","rank":79,"score":24809.177959056076},{"content":"\n\nimpl Parse for ClosureTypeName {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(ClosureTypeName, IndexStr<'b>)> {\n\n try_begin_parse!(\"ClosureTypeName\", ctx, input);\n\n\n\n let tail = consume(b\"Ul\", input)?;\n\n let (sig, tail) = LambdaSig::parse(ctx, subs, tail)?;\n\n let tail = consume(b\"E\", tail)?;\n\n let (num, tail) = if let Ok((num, tail)) = parse_number(10, false, tail) {\n\n (Some(num as _), tail)\n\n } else {\n\n (None, tail)\n\n };\n\n let tail = consume(b\"_\", tail)?;\n\n Ok((ClosureTypeName(sig, num), tail))\n\n }\n","file_path":"src/ast.rs","rank":80,"score":24809.088331504234},{"content":"\n\n let tail = consume(b\"u\", input)?;\n\n let (name, tail) = SourceName::parse(ctx, subs, tail)?;\n\n Ok((BuiltinType::Extension(name), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for BuiltinType\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n let ctx = try_begin_demangle!(self, ctx, scope);\n\n\n\n match *self {\n\n BuiltinType::Standard(ref ty) => ty.demangle(ctx, scope),\n","file_path":"src/ast.rs","rank":81,"score":24809.039443870013},{"content":"where\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle_as_leaf<'me, 'ctx>(\n\n &'me self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n ) -> fmt::Result {\n\n match *self {\n\n LeafName::SourceName(sn) => sn.demangle(ctx, None),\n\n LeafName::Closure(c) => c.demangle(ctx, None),\n\n LeafName::WellKnownComponent(wkc) => wkc.demangle_as_leaf(ctx),\n\n LeafName::UnnamedType(utn) => utn.demangle_as_leaf(ctx),\n\n }\n\n }\n\n}\n\n\n\n/// Determine whether this AST node is some kind (potentially namespaced) name\n\n/// and if so get its leaf name.\n\npub(crate) trait GetLeafName<'a> {\n\n fn get_leaf_name(&'a self, subs: &'a SubstitutionTable) -> Option<LeafName<'a>>;\n\n}\n\n\n\n/// Determine whether this AST node is a constructor, destructor, or conversion\n\n/// function.\n\npub(crate) trait IsCtorDtorConversion {\n\n fn is_ctor_dtor_conversion(&self, subs: &SubstitutionTable) -> bool;\n\n}\n\n\n","file_path":"src/ast.rs","rank":82,"score":24809.037503369007},{"content":" ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(NvOffset, IndexStr<'b>)> {\n\n try_begin_parse!(\"NvOffset\", ctx, input);\n\n\n\n Number::parse(ctx, subs, input).map(|(num, tail)| (NvOffset(num), tail))\n\n }\n\n}\n\n\n\n/// A virtual offset, as described by the <v-offset> production.\n\n///\n\n/// ```text\n\n/// <v-offset> ::= <offset number> _ <virtual offset number>\n\n/// ```\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\npub struct VOffset(isize, isize);\n\n\n\nimpl Parse for VOffset {\n\n fn parse<'a, 'b>(\n","file_path":"src/ast.rs","rank":83,"score":24808.97390623331},{"content":" Function(Name, BareFunctionType),\n\n\n\n /// An encoded static variable.\n\n Data(Name),\n\n\n\n /// A special encoding.\n\n Special(SpecialName),\n\n}\n\n\n\nimpl Parse for Encoding {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(Encoding, IndexStr<'b>)> {\n\n try_begin_parse!(\"Encoding\", ctx, input);\n\n\n\n if let Ok((name, tail)) = Name::parse(ctx, subs, input) {\n\n if let Ok((ty, tail)) = BareFunctionType::parse(ctx, subs, tail) {\n\n return Ok((Encoding::Function(name, ty), tail));\n","file_path":"src/ast.rs","rank":84,"score":24808.936428294757},{"content":"pub enum GlobalCtorDtor {\n\n /// A global constructor.\n\n Ctor(Box<MangledName>),\n\n /// A global destructor.\n\n Dtor(Box<MangledName>),\n\n}\n\n\n\nimpl Parse for GlobalCtorDtor {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(GlobalCtorDtor, IndexStr<'b>)> {\n\n try_begin_parse!(\"GlobalCtorDtor\", ctx, input);\n\n\n\n let tail = match input.next_or(error::Error::UnexpectedEnd)? {\n\n (b'_', t) | (b'.', t) | (b'$', t) => t,\n\n _ => return Err(error::Error::UnexpectedText),\n\n };\n\n\n","file_path":"src/ast.rs","rank":85,"score":24808.875164389567},{"content":" &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n FunctionArgSlice::new(&self.0[1..]).demangle(ctx, scope)\n\n }\n\n}\n\n\n\nimpl<'subs, W> DemangleAsInner<'subs, W> for FunctionArgListAndReturnType where\n\n W: 'subs + DemangleWrite\n\n{\n\n}\n\n\n\n/// Define a handle to a AST type that lives inside the substitution table. A\n\n/// handle is always either an index into the substitution table, or it is a\n\n/// reference to a \"well-known\" component.\n\n///\n\n/// This declares:\n\n///\n\n/// - The enum of either a back reference into the substitution table or a\n","file_path":"src/ast.rs","rank":86,"score":24808.75844174132},{"content":"\n\n if let Ok(tail) = consume(b\"St\", input) {\n\n let (name, tail) = UnqualifiedName::parse(ctx, subs, tail)?;\n\n return Ok((UnscopedName::Std(name), tail));\n\n }\n\n\n\n let (name, tail) = UnqualifiedName::parse(ctx, subs, input)?;\n\n Ok((UnscopedName::Unqualified(name), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for UnscopedName\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n","file_path":"src/ast.rs","rank":87,"score":24808.753441874713},{"content":" fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(DestructorName, IndexStr<'b>)> {\n\n try_begin_parse!(\"DestructorName\", ctx, input);\n\n\n\n if let Ok((ty, tail)) = UnresolvedTypeHandle::parse(ctx, subs, input) {\n\n return Ok((DestructorName::Unresolved(ty), tail));\n\n }\n\n\n\n let (name, tail) = SimpleId::parse(ctx, subs, input)?;\n\n Ok((DestructorName::Name(name), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for DestructorName\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n","file_path":"src/ast.rs","rank":88,"score":24808.749732616256},{"content":" fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n let ctx = try_begin_demangle!(self, ctx, scope);\n\n\n\n write!(ctx, \"[abi:\")?;\n\n self.0.demangle(ctx, scope)?;\n\n write!(ctx, \"]\")\n\n }\n\n}\n\n\n\nimpl TaggedName {\n\n #[inline]\n\n fn starts_with(byte: u8) -> bool {\n\n byte == b'B'\n\n }\n\n}\n\n\n","file_path":"src/ast.rs","rank":89,"score":24808.736630177827},{"content":"\n\n fn parse_internal<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n from_expr: bool,\n\n ) -> Result<(OperatorName, IndexStr<'b>)> {\n\n try_begin_parse!(\"OperatorName\", ctx, input);\n\n\n\n if let Ok((simple, tail)) = SimpleOperatorName::parse(ctx, subs, input) {\n\n return Ok((OperatorName::Simple(simple), tail));\n\n }\n\n\n\n if let Ok(tail) = consume(b\"cv\", input) {\n\n // If we came through the expression path, we're a cast. If not,\n\n // we're a conversion.\n\n let previously_in_conversion = ctx.set_in_conversion(!from_expr);\n\n let parse_result = TypeHandle::parse(ctx, subs, tail);\n\n ctx.set_in_conversion(previously_in_conversion);\n\n let (ty, tail) = parse_result?;\n","file_path":"src/ast.rs","rank":90,"score":24808.733614247325},{"content":" input: IndexStr<'b>,\n\n ) -> Result<(UnresolvedQualifierLevel, IndexStr<'b>)> {\n\n try_begin_parse!(\"UnresolvedQualifierLevel\", ctx, input);\n\n\n\n let (id, tail) = SimpleId::parse(ctx, subs, input)?;\n\n Ok((UnresolvedQualifierLevel(id), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for UnresolvedQualifierLevel\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n #[inline]\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n let ctx = try_begin_demangle!(self, ctx, scope);\n","file_path":"src/ast.rs","rank":91,"score":24808.63654094539},{"content":" ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(UnresolvedTypeHandle, IndexStr<'b>)> {\n\n try_begin_parse!(\"UnresolvedTypeHandle\", ctx, input);\n\n\n\n if let Ok((param, tail)) = TemplateParam::parse(ctx, subs, input) {\n\n let (args, tail) = if let Ok((args, tail)) = TemplateArgs::parse(ctx, subs, tail) {\n\n (Some(args), tail)\n\n } else {\n\n (None, tail)\n\n };\n\n let ty = UnresolvedType::Template(param, args);\n\n let ty = Substitutable::UnresolvedType(ty);\n\n let idx = subs.insert(ty);\n\n let handle = UnresolvedTypeHandle::BackReference(idx);\n\n return Ok((handle, tail));\n\n }\n\n\n\n if let Ok((decltype, tail)) = Decltype::parse(ctx, subs, input) {\n","file_path":"src/ast.rs","rank":92,"score":24808.475446228524},{"content":"/// ```text\n\n/// <unscoped-name> ::= <unqualified-name>\n\n/// ::= St <unqualified-name> # ::std::\n\n/// ```\n\n#[derive(Clone, Debug, PartialEq, Eq)]\n\npub enum UnscopedName {\n\n /// An unqualified name.\n\n Unqualified(UnqualifiedName),\n\n\n\n /// A name within the `std::` namespace.\n\n Std(UnqualifiedName),\n\n}\n\n\n\nimpl Parse for UnscopedName {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(UnscopedName, IndexStr<'b>)> {\n\n try_begin_parse!(\"UnscopedName\", ctx, input);\n","file_path":"src/ast.rs","rank":93,"score":24808.46133945733},{"content":" fn get_function_arg(&'a self, _: usize) -> Result<&'a Type> {\n\n Err(error::Error::BadFunctionArgReference)\n\n }\n\n}\n\n\n\nimpl<'subs, W> DemangleAsLeaf<'subs, W> for WellKnownComponent\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle_as_leaf<'me, 'ctx>(\n\n &'me self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n ) -> fmt::Result {\n\n match *self {\n\n WellKnownComponent::Std => {\n\n panic!(\"should never treat `WellKnownComponent::Std` as a leaf name\")\n\n }\n\n WellKnownComponent::StdAllocator => write!(ctx, \"allocator\"),\n\n WellKnownComponent::StdString1 => write!(ctx, \"basic_string\"),\n\n WellKnownComponent::StdString2 => write!(ctx, \"string\"),\n","file_path":"src/ast.rs","rank":94,"score":24808.449376602326},{"content":"\n\nimpl Parse for TemplateArg {\n\n fn parse<'a, 'b>(\n\n ctx: &'a ParseContext,\n\n subs: &'a mut SubstitutionTable,\n\n input: IndexStr<'b>,\n\n ) -> Result<(TemplateArg, IndexStr<'b>)> {\n\n try_begin_parse!(\"TemplateArg\", ctx, input);\n\n\n\n if let Ok(tail) = consume(b\"X\", input) {\n\n let (expr, tail) = Expression::parse(ctx, subs, tail)?;\n\n let tail = consume(b\"E\", tail)?;\n\n return Ok((TemplateArg::Expression(expr), tail));\n\n }\n\n\n\n if let Ok((expr, tail)) = ExprPrimary::parse(ctx, subs, input) {\n\n return Ok((TemplateArg::SimpleExpression(expr), tail));\n\n }\n\n\n\n if let Ok((ty, tail)) = TypeHandle::parse(ctx, subs, input) {\n","file_path":"src/ast.rs","rank":95,"score":24808.40049274833},{"content":" let tail = consume(b\"e\", tail)?;\n\n let (name, tail) = Name::parse(ctx, subs, tail)?;\n\n Ok((ClassEnumType::ElaboratedEnum(name), tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for ClassEnumType\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n let ctx = try_begin_demangle!(self, ctx, scope);\n\n\n\n match *self {\n\n ClassEnumType::Named(ref name) => name.demangle(ctx, scope),\n\n ClassEnumType::ElaboratedStruct(ref name) => {\n","file_path":"src/ast.rs","rank":96,"score":24808.386505524755},{"content":" Some(LeafName::SourceName(&self.0))\n\n }\n\n}\n\n\n\nimpl DataMemberPrefix {\n\n fn starts_with(byte: u8) -> bool {\n\n SourceName::starts_with(byte)\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for DataMemberPrefix\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n #[inline]\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n","file_path":"src/ast.rs","rank":97,"score":24808.150374823195},{"content":" transaction_safe: transaction_safe,\n\n extern_c: extern_c,\n\n bare: bare,\n\n ref_qualifier: ref_qualifier,\n\n };\n\n Ok((func_ty, tail))\n\n }\n\n}\n\n\n\nimpl<'subs, W> Demangle<'subs, W> for FunctionType\n\nwhere\n\n W: 'subs + DemangleWrite,\n\n{\n\n fn demangle<'prev, 'ctx>(\n\n &'subs self,\n\n ctx: &'ctx mut DemangleContext<'subs, W>,\n\n scope: Option<ArgScopeStack<'prev, 'subs>>,\n\n ) -> fmt::Result {\n\n let ctx = try_begin_demangle!(self, ctx, scope);\n\n\n","file_path":"src/ast.rs","rank":98,"score":24808.127821308786}],"string":"[\n {\n \"content\": \"#[allow(unsafe_code)]\\n\\nfn parse_number(base: u32, allow_signed: bool, mut input: IndexStr) -> Result<(isize, IndexStr)> {\\n\\n if input.is_empty() {\\n\\n return Err(error::Error::UnexpectedEnd);\\n\\n }\\n\\n\\n\\n let num_is_negative = if allow_signed && input.as_ref()[0] == b'n' {\\n\\n input = input.range_from(1..);\\n\\n\\n\\n if input.is_empty() {\\n\\n return Err(error::Error::UnexpectedEnd);\\n\\n }\\n\\n\\n\\n true\\n\\n } else {\\n\\n false\\n\\n };\\n\\n\\n\\n let num_numeric = input\\n\\n .as_ref()\\n\\n .iter()\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 0,\n \"score\": 106610.51204140321\n },\n {\n \"content\": \"/// Print all the lines from the given `input` to `out`, with all mangled C++\\n\\n/// symbols replaced with their demangled form.\\n\\nfn demangle_all<R, W>(input: &mut R, out: &mut W, options: DemangleOptions) -> io::Result<()>\\n\\nwhere\\n\\n R: BufRead,\\n\\n W: Write,\\n\\n{\\n\\n let mut buf = vec![];\\n\\n\\n\\n while input.read_until(b'\\\\n', &mut buf)? > 0 {\\n\\n let nl = buf.ends_with(&[b'\\\\n']);\\n\\n if nl {\\n\\n buf.pop();\\n\\n }\\n\\n demangle_line(out, &buf[..], options)?;\\n\\n if nl {\\n\\n write!(out, \\\"\\\\n\\\")?;\\n\\n }\\n\\n buf.clear();\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/cppfilt.rs\",\n \"rank\": 1,\n \"score\": 103260.6048222924\n },\n {\n \"content\": \"/// Print the given `line` to `out`, with all mangled C++ symbols replaced with\\n\\n/// their demangled form.\\n\\nfn demangle_line<W>(out: &mut W, line: &[u8], options: DemangleOptions) -> io::Result<()>\\n\\nwhere\\n\\n W: Write,\\n\\n{\\n\\n let mut line = line;\\n\\n\\n\\n while let Some(idx) = find_mangled(line) {\\n\\n write!(out, \\\"{}\\\", String::from_utf8_lossy(&line[..idx]))?;\\n\\n\\n\\n if let Ok((sym, tail)) = BorrowedSymbol::with_tail(&line[idx..]) {\\n\\n let demangled = sym\\n\\n .demangle(&options)\\n\\n .map_err(|e| io::Error::new(io::ErrorKind::Other, e))?;\\n\\n write!(out, \\\"{}\\\", demangled)?;\\n\\n line = tail;\\n\\n } else {\\n\\n write!(out, \\\"_Z\\\")?;\\n\\n line = &line[2..];\\n\\n }\\n\\n }\\n\\n\\n\\n write!(out, \\\"{}\\\", String::from_utf8_lossy(line))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/cppfilt.rs\",\n \"rank\": 2,\n \"score\": 96711.84139914955\n },\n {\n \"content\": \"#[inline]\\n\\nfn consume<'a>(expected: &[u8], input: IndexStr<'a>) -> Result<IndexStr<'a>> {\\n\\n match input.try_split_at(expected.len()) {\\n\\n Some((head, tail)) if head == expected => Ok(tail),\\n\\n Some(_) => Err(error::Error::UnexpectedText),\\n\\n None => Err(error::Error::UnexpectedEnd),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 3,\n \"score\": 94987.05861130016\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait Demangle<'subs, W>: fmt::Debug\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n /// Write the demangled form of this AST node to the given context.\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result;\\n\\n}\\n\\n\\n\\n/// Any AST node that can be printed as an inner type.\\n\\n///\\n\\n/// See the comments surrounding `DemangleContext::inner` for details.\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 4,\n \"score\": 86732.5689477882\n },\n {\n \"content\": \"struct AutoLogParse;\\n\\n\\n\\n#[cfg(feature = \\\"logging\\\")]\\n\\nthread_local! {\\n\\n static LOG_DEPTH: RefCell<usize> = RefCell::new(0);\\n\\n}\\n\\n\\n\\nimpl AutoLogParse {\\n\\n #[cfg(feature = \\\"logging\\\")]\\n\\n fn new(production: &'static str, input: IndexStr<'_>) -> AutoLogParse {\\n\\n LOG_DEPTH.with(|depth| {\\n\\n if *depth.borrow() == 0 {\\n\\n println!();\\n\\n }\\n\\n\\n\\n let indent: String = (0..*depth.borrow() * 4).map(|_| ' ').collect();\\n\\n log!(\\n\\n \\\"{}({} \\\\\\\"{}\\\\\\\" {}\\\",\\n\\n indent,\\n\\n production,\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 5,\n \"score\": 80911.73240346611\n },\n {\n \"content\": \"struct AutoLogDemangle;\\n\\n\\n\\nimpl AutoLogDemangle {\\n\\n #[cfg(feature = \\\"logging\\\")]\\n\\n fn new<P, W>(\\n\\n production: &P,\\n\\n ctx: &DemangleContext<W>,\\n\\n scope: Option<ArgScopeStack>,\\n\\n is_inner: bool,\\n\\n ) -> AutoLogDemangle\\n\\n where\\n\\n P: ?Sized + fmt::Debug,\\n\\n W: DemangleWrite,\\n\\n {\\n\\n LOG_DEPTH.with(|depth| {\\n\\n if *depth.borrow() == 0 {\\n\\n println!();\\n\\n }\\n\\n\\n\\n let indent: String = (0..*depth.borrow() * 4).map(|_| ' ').collect();\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 6,\n \"score\": 80911.73240346611\n },\n {\n \"content\": \"#[test]\\n\\nfn size_of_error() {\\n\\n use std::mem;\\n\\n assert_eq!(\\n\\n mem::size_of::<Error>(),\\n\\n 1,\\n\\n \\\"We should keep the size of our Error type in check\\\"\\n\\n );\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Error {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match *self {\\n\\n Error::UnexpectedEnd => write!(f, \\\"mangled symbol ends abruptly\\\"),\\n\\n Error::UnexpectedText => write!(f, \\\"mangled symbol is not well-formed\\\"),\\n\\n Error::BadBackReference => write!(\\n\\n f,\\n\\n \\\"back reference that is out-of-bounds of the substitution table\\\"\\n\\n ),\\n\\n Error::BadTemplateArgReference => write!(\\n\\n f,\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 7,\n \"score\": 76237.16769493591\n },\n {\n \"content\": \"/// Find the index of the first (potential) occurrence of a mangled C++ symbol\\n\\n/// in the given `haystack`.\\n\\nfn find_mangled(haystack: &[u8]) -> Option<usize> {\\n\\n if haystack.is_empty() {\\n\\n return None;\\n\\n }\\n\\n\\n\\n for i in 0..haystack.len() - 1 {\\n\\n if haystack[i] == b'_' {\\n\\n match (\\n\\n haystack[i + 1],\\n\\n haystack.get(i + 2),\\n\\n haystack.get(i + 3),\\n\\n haystack.get(i + 4),\\n\\n ) {\\n\\n (b'Z', _, _, _) | (b'_', Some(b'Z'), _, _) | (b'_', Some(b'_'), Some(b'Z'), _) => {\\n\\n return Some(i)\\n\\n }\\n\\n (b'_', Some(b'_'), Some(b'_'), Some(b'Z')) => return Some(i),\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/cppfilt.rs\",\n \"rank\": 8,\n \"score\": 75095.9965151663\n },\n {\n \"content\": \"/// When formatting a mangled symbol's parsed AST as a demangled symbol, we need\\n\\n/// to resolve indirect references to template and function arguments with\\n\\n/// direct `TemplateArg` and `Type` references respectively.\\n\\n///\\n\\n/// Note that which set of arguments are implicitly referenced change as we\\n\\n/// enter and leave different functions' scope. One might usually use de Brujin\\n\\n/// indices to keep arguments within scopes separated from each other, but the\\n\\n/// Itanium C++ ABI does not allow us the luxury. AFAIK, when the ABI was first\\n\\n/// drafted, C++ did not have lambdas, and the issue did not come up at all\\n\\n/// since a function simply couldn't refer to the types of closed over\\n\\n/// variables.\\n\\n///\\n\\n/// This trait is implemented by anything that can potentially resolve arguments\\n\\n/// for us.\\n\\ntrait ArgScope<'me, 'ctx>: fmt::Debug {\\n\\n /// Get the current scope's leaf name.\\n\\n fn leaf_name(&'me self) -> Result<LeafName<'ctx>>;\\n\\n\\n\\n /// Get the current scope's `index`th template argument.\\n\\n fn get_template_arg(&'me self, index: usize)\\n\\n -> Result<(&'ctx TemplateArg, &'ctx TemplateArgs)>;\\n\\n\\n\\n /// Get the current scope's `index`th function argument's type.\\n\\n fn get_function_arg(&'me self, index: usize) -> Result<&'ctx Type>;\\n\\n}\\n\\n\\n\\n/// An `ArgScopeStack` represents the current function and template demangling\\n\\n/// scope we are within. As we enter new demangling scopes, we construct new\\n\\n/// `ArgScopeStack`s whose `prev` references point back to the old ones. These\\n\\n/// `ArgScopeStack`s are kept on the native stack, and as functions return, they\\n\\n/// go out of scope and we use the previous `ArgScopeStack`s again.\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub struct ArgScopeStack<'prev, 'subs>\\n\\nwhere\\n\\n 'subs: 'prev,\\n\\n{\\n\\n item: &'subs dyn ArgScope<'subs, 'subs>,\\n\\n in_arg: Option<(usize, &'subs TemplateArgs)>,\\n\\n prev: Option<&'prev ArgScopeStack<'prev, 'subs>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 9,\n \"score\": 69999.09025573592\n },\n {\n \"content\": \"fn get_crate_dir() -> io::Result<path::PathBuf> {\\n\\n Ok(path::PathBuf::from(\\n\\n env::var(\\\"CARGO_MANIFEST_DIR\\\")\\n\\n .map_err(|_| io::Error::new(io::ErrorKind::Other, \\\"no CARGO_MANIFEST_DIR\\\"))?,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 10,\n \"score\": 67900.22418698331\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait DemangleAsInner<'subs, W>: Demangle<'subs, W>\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n /// Write the inner demangling form of this AST node to the given context.\\n\\n fn demangle_as_inner<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n self.demangle(ctx, scope)\\n\\n }\\n\\n\\n\\n /// Cast this `DemangleAsInner` to a `Type`.\\n\\n fn downcast_to_type(&self) -> Option<&Type> {\\n\\n None\\n\\n }\\n\\n\\n\\n /// Cast this `DemangleAsInner` to a `FunctionType`.\\n\\n fn downcast_to_function_type(&self) -> Option<&FunctionType> {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 11,\n \"score\": 66157.2358381855\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct DemangleState {\\n\\n /// How deep in the demangling are we?\\n\\n pub recursion_level: u32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 12,\n \"score\": 58461.873349741974\n },\n {\n \"content\": \"fn assert_demangles_as(mangled: &str, expected: &str, options: Option<DemangleOptions>) {\\n\\n let sym = cpp_demangle::BorrowedSymbol::new(mangled.as_bytes())\\n\\n .expect(\\\"should parse mangled symbol ok\\\");\\n\\n\\n\\n let actual = if let Some(o) = options {\\n\\n sym.demangle(&o).expect(\\\"should demangle ok\\\")\\n\\n } else {\\n\\n let mut actual = vec![];\\n\\n write!(&mut actual, \\\"{}\\\", sym).expect(\\\"should demangle symbol ok\\\");\\n\\n String::from_utf8(actual).expect(\\\"should demangle to valid utf-8\\\")\\n\\n };\\n\\n\\n\\n if expected != actual {\\n\\n println!();\\n\\n println!(\\\"Diff:\\\");\\n\\n println!(\\\"--- expected\\\");\\n\\n print!(\\\"+++ actual\\\");\\n\\n\\n\\n let mut last = None;\\n\\n for cmp in diff::chars(expected, &actual) {\\n\",\n \"file_path\": \"tests/tests.rs\",\n \"rank\": 13,\n \"score\": 56396.482091487655\n },\n {\n \"content\": \"/// Read `tests/libiberty-demangle-expected`, parse its input mangled symbols,\\n\\n/// and expected output demangled symbols, and generate test cases for them.\\n\\n///\\n\\n/// We do not support all of the options that the libiberty demangler does,\\n\\n/// therefore we skip tests that use options we do not intend to\\n\\n/// support. Basically, we only support `--format=gnu-v3` (which is the System V\\n\\n/// C++ ABI), and none of the legacy C/C++ compiler formats, nor Java/D/etc\\n\\n/// language symbol mangling.\\n\\nfn generate_compatibility_tests_from_libiberty() -> io::Result<()> {\\n\\n let mut tests_dir = get_crate_dir()?;\\n\\n tests_dir.push(\\\"tests\\\");\\n\\n if !tests_dir.is_dir() {\\n\\n // We are in `cargo publish` and the `tests/` directory isn't included\\n\\n // in the distributed package.\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n println!(\\\"cargo:rerun-if-changed=tests/libiberty-demangle-expected\\\");\\n\\n\\n\\n let test_path = get_test_path(\\\"libiberty.rs\\\")?;\\n\\n let _ = fs::remove_file(&test_path);\\n\\n let mut test_file = fs::File::create(test_path)?;\\n\\n\\n\\n writeln!(\\n\\n &mut test_file,\\n\\n \\\"\\n\\nextern crate cpp_demangle;\\n\\nextern crate diff;\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 14,\n \"score\": 55879.74716560523\n },\n {\n \"content\": \"/// When we first begin demangling, we haven't entered any function or template\\n\\n/// demangling scope and we don't have any useful `ArgScopeStack`. Therefore, we\\n\\n/// are never actually dealing with `ArgScopeStack` directly in practice, but\\n\\n/// always an `Option<ArgScopeStack>` instead. Nevertheless, we want to define\\n\\n/// useful methods on `Option<ArgScopeStack>`.\\n\\n///\\n\\n/// A custom \\\"extension\\\" trait with exactly one implementor: Rust's principled\\n\\n/// monkey patching!\\n\\ntrait ArgScopeStackExt<'prev, 'subs>: Copy {\\n\\n /// Push a new `ArgScope` onto this `ArgScopeStack` and return the new\\n\\n /// `ArgScopeStack` with the pushed resolver on top.\\n\\n fn push(\\n\\n &'prev self,\\n\\n item: &'subs dyn ArgScope<'subs, 'subs>,\\n\\n ) -> Option<ArgScopeStack<'prev, 'subs>>;\\n\\n}\\n\\n\\n\\nimpl<'prev, 'subs> ArgScopeStackExt<'prev, 'subs> for Option<ArgScopeStack<'prev, 'subs>> {\\n\\n fn push(\\n\\n &'prev self,\\n\\n item: &'subs dyn ArgScope<'subs, 'subs>,\\n\\n ) -> Option<ArgScopeStack<'prev, 'subs>> {\\n\\n log!(\\\"ArgScopeStack::push: {:?}\\\", item);\\n\\n Some(ArgScopeStack {\\n\\n prev: self.as_ref(),\\n\\n in_arg: None,\\n\\n item: item,\\n\\n })\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 15,\n \"score\": 55767.239439887766\n },\n {\n \"content\": \"/// The `<number>` production.\\n\\n///\\n\\n/// ```text\\n\\n/// <number> ::= [n] <non-negative decimal integer>\\n\\n/// ```\\n\\ntype Number = isize;\\n\\n\\n\\nimpl Parse for Number {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n _subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(isize, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"Number\\\", ctx, input);\\n\\n parse_number(10, true, input)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A <seq-id> production encoding a base-36 positive number.\\n\\n///\\n\\n/// ```text\\n\\n/// <seq-id> ::= <0-9A-Z>+\\n\\n/// ```\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub struct SeqId(usize);\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 16,\n \"score\": 55728.14544576074\n },\n {\n \"content\": \"fn get_crate_test_path(file_name: &str) -> io::Result<path::PathBuf> {\\n\\n let mut test_path = get_crate_dir()?;\\n\\n test_path.push(\\\"tests\\\");\\n\\n assert!(test_path.is_dir());\\n\\n test_path.push(file_name);\\n\\n Ok(test_path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 17,\n \"score\": 55339.85983939213\n },\n {\n \"content\": \"#[derive(Debug, Default, Clone, Copy)]\\n\\nstruct ParseContextState {\\n\\n // The current recursion level. Should always be less than or equal to the\\n\\n // maximum.\\n\\n recursion_level: u32,\\n\\n // Whether or not we are currently parsing a conversion operator.\\n\\n in_conversion: bool,\\n\\n}\\n\\n\\n\\n/// Common context needed when parsing.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ParseContext {\\n\\n // Maximum amount of recursive parsing calls we will allow. If this is too\\n\\n // large, we can blow the stack.\\n\\n max_recursion: u32,\\n\\n // Mutable state within the `ParseContext`.\\n\\n state: Cell<ParseContextState>,\\n\\n}\\n\\n\\n\\nimpl ParseContext {\\n\\n /// Construct a new `ParseContext`.\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 18,\n \"score\": 55066.78033581306\n },\n {\n \"content\": \"/// Generate tests that ensure that we don't panic when parsing and demangling\\n\\n/// the seed test cases that we pass to AFL.rs assert (including the failing\\n\\n/// test cases historically found by AFL.rs).\\n\\nfn generate_sanity_tests_from_afl_seeds() -> io::Result<()> {\\n\\n let mut in_dir = get_crate_dir()?;\\n\\n in_dir.push(\\\"in\\\");\\n\\n if !in_dir.is_dir() {\\n\\n // We are in `cargo publish` and the `in/` directory isn't included in\\n\\n // the distributed package.\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n let test_path = get_test_path(\\\"afl_seeds.rs\\\")?;\\n\\n let mut test_file = fs::File::create(test_path)?;\\n\\n\\n\\n writeln!(\\n\\n &mut test_file,\\n\\n \\\"\\n\\nextern crate cpp_demangle;\\n\\nuse std::fs;\\n\\nuse std::io::Read;\\n\\n\\\"\\n\\n )?;\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 19,\n \"score\": 53263.9748797856\n },\n {\n \"content\": \"fn zero_or_more<'a, 'b, P>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n) -> Result<(Vec<P>, IndexStr<'b>)>\\n\\nwhere\\n\\n P: Parse,\\n\\n{\\n\\n let mut tail = input;\\n\\n let mut results = vec![];\\n\\n loop {\\n\\n if let Ok((parsed, tail_tail)) = P::parse(ctx, subs, tail) {\\n\\n results.push(parsed);\\n\\n tail = tail_tail;\\n\\n } else {\\n\\n return Ok((results, tail));\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Parse a number with the given `base`. Do not allow negative numbers\\n\\n/// (prefixed with an 'n' instead of a '-') if `allow_signed` is false.\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 20,\n \"score\": 53064.92418791747\n },\n {\n \"content\": \"fn one_or_more<'a, 'b, P>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n) -> Result<(Vec<P>, IndexStr<'b>)>\\n\\nwhere\\n\\n P: Parse,\\n\\n{\\n\\n let (first, mut tail) = P::parse(ctx, subs, input)?;\\n\\n let mut results = vec![first];\\n\\n loop {\\n\\n if let Ok((parsed, tail_tail)) = P::parse(ctx, subs, tail) {\\n\\n results.push(parsed);\\n\\n tail = tail_tail;\\n\\n } else {\\n\\n return Ok((results, tail));\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 21,\n \"score\": 53064.92418791747\n },\n {\n \"content\": \"/// An RAII type to automatically check the recursion level against the\\n\\n/// maximum. If the maximum has been crossed, return an error. Otherwise,\\n\\n/// increment the level upon construction, and decrement it upon destruction.\\n\\nstruct AutoParseDemangle<'a, 'b, W: 'a + DemangleWrite>(&'b mut DemangleContext<'a, W>);\\n\\n\\n\\nimpl<'a, 'b, W: 'a + DemangleWrite> AutoParseDemangle<'a, 'b, W> {\\n\\n #[inline]\\n\\n fn new(ctx: &'b mut DemangleContext<'a, W>) -> std::result::Result<Self, fmt::Error> {\\n\\n ctx.enter_recursion()?;\\n\\n Ok(AutoParseDemangle(ctx))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, 'b, W: 'a + DemangleWrite> std::ops::Deref for AutoParseDemangle<'a, 'b, W> {\\n\\n type Target = DemangleContext<'a, W>;\\n\\n\\n\\n fn deref(&self) -> &Self::Target {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, 'b, W: 'a + DemangleWrite> std::ops::DerefMut for AutoParseDemangle<'a, 'b, W> {\\n\\n fn deref_mut(&mut self) -> &mut Self::Target {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 22,\n \"score\": 51771.99747803782\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub trait Parse: Sized {\\n\\n /// Parse the `Self` value from `input` and return it, updating the\\n\\n /// substitution table as needed.\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(Self, IndexStr<'b>)>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 23,\n \"score\": 50780.943196454566\n },\n {\n \"content\": \"fn get_out_dir() -> io::Result<path::PathBuf> {\\n\\n Ok(path::PathBuf::from(env::var(\\\"OUT_DIR\\\").map_err(|_| {\\n\\n io::Error::new(io::ErrorKind::Other, \\\"no OUT_DIR\\\")\\n\\n })?))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 24,\n \"score\": 49990.148681640654\n },\n {\n \"content\": \"/// An RAII type to automatically check the recursion level against the\\n\\n/// maximum. If the maximum has been crossed, return an error. Otherwise,\\n\\n/// increment the level upon construction, and decrement it upon destruction.\\n\\nstruct AutoParseRecursion<'a>(&'a ParseContext);\\n\\n\\n\\nimpl<'a> AutoParseRecursion<'a> {\\n\\n #[inline]\\n\\n fn new(ctx: &'a ParseContext) -> error::Result<AutoParseRecursion<'a>> {\\n\\n ctx.enter_recursion()?;\\n\\n Ok(AutoParseRecursion(ctx))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Drop for AutoParseRecursion<'a> {\\n\\n #[inline]\\n\\n fn drop(&mut self) {\\n\\n self.0.exit_recursion();\\n\\n }\\n\\n}\\n\\n\\n\\n/// A trait for anything that can be parsed from an `IndexStr` and return a\\n\\n/// `Result` of the parsed `Self` value and the rest of the `IndexStr` input\\n\\n/// that has not been consumed in parsing the `Self` value.\\n\\n///\\n\\n/// For AST types representing productions which have `<substitution>` as a\\n\\n/// possible right hand side, do not implement this trait directly. Instead,\\n\\n/// make a newtype over `usize`, parse either the `<substitution>` back\\n\\n/// reference or \\\"real\\\" value, insert the \\\"real\\\" value into the substitution\\n\\n/// table if needed, and *always* return the newtype index into the substitution\\n\\n/// table.\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 25,\n \"score\": 48607.23393673239\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"cargo:rerun-if-changed=build.rs\\\");\\n\\n\\n\\n generate_sanity_tests_from_afl_seeds()\\n\\n .expect(\\\"should generate sanity tests from AFL.rs seed test cases\\\");\\n\\n\\n\\n generate_compatibility_tests_from_libiberty()\\n\\n .expect(\\\"should generate compatibility tests from tests/libiberty-demangle-expected\\\");\\n\\n}\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 26,\n \"score\": 42093.75971219857\n },\n {\n \"content\": \"fn get_test_path(file_name: &str) -> io::Result<path::PathBuf> {\\n\\n let mut test_path = get_out_dir()?;\\n\\n assert!(test_path.is_dir());\\n\\n test_path.push(file_name);\\n\\n Ok(test_path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 27,\n \"score\": 40275.672495102\n },\n {\n \"content\": \"fn main() {\\n\\n let matches = App::new(\\\"cppfilt\\\")\\n\\n .version(crate_version!())\\n\\n .author(crate_authors!())\\n\\n .about(\\\"A c++filt clone as an example of how to use the cpp_demangle crate!\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"noparams\\\")\\n\\n .short(\\\"p\\\")\\n\\n .long(\\\"no-params\\\")\\n\\n .help(\\\"Do not display function arguments\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::with_name(\\\"mangled_names\\\")\\n\\n .multiple(true)\\n\\n .value_delimiter(\\\" \\\"),\\n\\n )\\n\\n .get_matches();\\n\\n\\n\\n let stdin = io::stdin();\\n\\n let mut stdin = stdin.lock();\\n\",\n \"file_path\": \"examples/cppfilt.rs\",\n \"rank\": 28,\n \"score\": 39463.4211910264\n },\n {\n \"content\": \"#[test]\\n\\nfn test_afl_seed_{}() {{\\n\\n let mut file = fs::File::open(\\\"{}\\\").unwrap();\\n\\n let mut contents = Vec::new();\\n\\n file.read_to_end(&mut contents).unwrap();\\n\\n let _ = cpp_demangle::Symbol::new(contents);\\n\\n assert!(true, \\\"did not panic when parsing\\\");\\n\\n}}\\n\\n\\\"#,\\n\\n file_name.to_string_lossy(),\\n\\n path.to_string_lossy()\\n\\n )?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 29,\n \"score\": 37226.61937000838\n },\n {\n \"content\": \" uint32_t recursion_limit;\\n\",\n \"file_path\": \"c_api/include/cpp_demangle.h\",\n \"rank\": 30,\n \"score\": 35303.4581306785\n },\n {\n \"content\": \"#[test]\\n\\nfn libxul_symbols_demangle() {\\n\\n let mut total = 0;\\n\\n let mut num_parsed = 0;\\n\\n let mut num_demangled = 0;\\n\\n let mut num_match_libiberty = 0;\\n\\n\\n\\n let libxul_txt_file = fs::File::open(concat!(env!(\\\"CARGO_MANIFEST_DIR\\\"), \\\"/tests/libxul.txt\\\"))\\n\\n .expect(\\\"should open libxul.txt\\\");\\n\\n let mut libxul_txt_file = BufReader::new(libxul_txt_file);\\n\\n\\n\\n let log_file = fs::File::create(concat!(env!(\\\"CARGO_MANIFEST_DIR\\\"), \\\"/tests/libxul.log\\\"))\\n\\n .expect(\\\"should create log file\\\");\\n\\n let mut log_file = BufWriter::new(log_file);\\n\\n\\n\\n let mut line = Vec::new();\\n\\n let mut demangled = Vec::new();\\n\\n let mut libiberty_sym = Vec::new();\\n\\n\\n\\n let which_cppfilt = get_cppfilt();\\n\\n let mut cppfilt = process::Command::new(which_cppfilt)\\n\",\n \"file_path\": \"tests/libxul.rs\",\n \"rank\": 31,\n \"score\": 35301.18307128251\n },\n {\n \"content\": \"#[test]\\n\\nfn test_libiberty_demangle_{}_() {{\\n\\n let mangled = br#\\\"{}\\\"#;\\n\\n let mangled_str = String::from_utf8_lossy(mangled).into_owned();\\n\\n println!(\\\"Parsing mangled symbol: {{}}\\\", mangled_str);\\n\\n\\n\\n let expected = r#\\\"{}\\\"#;\\n\\n\\n\\n let sym = match cpp_demangle::Symbol::new(&mangled[..]) {{\\n\\n Ok(sym) => sym,\\n\\n Err(_) if mangled_str == expected => return,\\n\\n Err(e) => panic!(\\\"Should parse mangled symbol {{}}\\\", e),\\n\\n }};\\n\\n\\n\\n let mut actual = String::new();\\n\\n if let Err(e) = write!(&mut actual, \\\"{{}}\\\", sym) {{\\n\\n panic!(\\\"Error while demangling '{{}}': {{}}\\\",\\n\\n mangled_str,\\n\\n e);\\n\\n }}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 32,\n \"score\": 34481.157585963636\n },\n {\n \"content\": \"#[test]\\n\\nfn test_stackoverflow_does_not_occur_issue_186() {\\n\\n assert_does_not_demangle(\\\"__ZNSt3__18__bind_rINS_4pairINS_12basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEE8cc_errorEEZN5stlab2v15asyncIZNSB_14serial_queue_tclIZN12_GLOBAL__N_114future_adaptorIN10redacteLib12ValueOrErrorIS7_EEZNK10cc_element17rendition_requestEmbE4$_14EEDaNS_6futureIT_EEOT0_EUlSO_E_JNSN_ISJ_EEEEESM_OSO_DpOT0_EUlSU_E_SS_JST_EEENSB_6futureINS_9result_ofIFNS_5decayISQ_E4typeEDpNS11_IT1_E4typeEEE4typeEvEESO_SR_DpOS14_EUlRST_E_JST_EEC1IS1F_JST_EvEESU_SX_\\\");\\n\\n}\\n\\n\\n\\ndemangles!(\\n\\n _ZN7mozilla6detail12ListenerImplINS_14AbstractThreadEZNS_20MediaEventSourceImplILNS_14ListenerPolicyE0EJNS_13TimedMetadataEEE15ConnectInternalIS2_NS_12MediaDecoderEMS8_FvOS5_EEENS_8EnableIfIXsr8TakeArgsIT1_EE5valueENS_18MediaEventListenerEE4TypeEPT_PT0_SD_EUlS9_E_JS5_EE17ApplyWithArgsImplISL_EENSC_IXsr8TakeArgsISH_EE5valueEvE4TypeERKSH_S9_,\\n\\n // This does not match llvm-cxxfilt\\n\\n \\\"mozilla::EnableIf<TakeArgs<mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1}>::value, void>::Type mozilla::detail::ListenerImpl<mozilla::AbstractThread, mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1}, mozilla::TimedMetadata>::ApplyWithArgsImpl<mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1}>(mozilla::EnableIf<TakeArgs<void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>::value, mozilla::MediaEventListener>::Type mozilla::MediaEventSourceImpl<(mozilla::ListenerPolicy)0, mozilla::TimedMetadata>::ConnectInternal<mozilla::AbstractThread, mozilla::MediaDecoder, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&)>(mozilla::AbstractThread*, mozilla::MediaDecoder*, void (mozilla::MediaDecoder::*)(mozilla::TimedMetadata&&))::{lambda(mozilla::TimedMetadata&&)#1} const&, mozilla::TimedMetadata&&)\\\"\\n\\n);\\n\\n\\n\\ndemangles!(\\n\\n _Z20instantiate_with_intI3FooET_IiEv,\\n\\n \\\"Foo<int> instantiate_with_int<Foo>()\\\"\\n\\n);\\n\\ndemangles!(_Z3fooISt6vectorIiEEvv, \\\"void foo<std::vector<int> >()\\\");\\n\\ndemangles!(__ZN3foo3barE3quxS0_, \\\"foo::bar(qux, qux)\\\");\\n\\ndemangles!(__ZN3foo3barE3quxS_, \\\"foo::bar(qux, foo)\\\");\\n\\n\\n\\ndemangles!(\\n\\n _ZN4funcI2TyEEN6ResultIT_EES3_,\\n\",\n \"file_path\": \"tests/tests.rs\",\n \"rank\": 33,\n \"score\": 33626.32915175456\n },\n {\n \"content\": \"//! Custom `Error` and `Result` types for the `cpp_demangle` crate.\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nuse std::error;\\n\\nuse std::fmt;\\n\\n\\n\\n/// Errors that can occur while demangling a symbol.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub enum Error {\\n\\n /// The mangled symbol ends abruptly.\\n\\n UnexpectedEnd,\\n\\n\\n\\n /// The mangled symbol is not well-formed.\\n\\n UnexpectedText,\\n\\n\\n\\n /// Found a back reference that is out-of-bounds of the substitution\\n\\n /// table.\\n\\n BadBackReference,\\n\\n\\n\\n /// Found a reference to a template arg that is either out-of-bounds, or in\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 35,\n \"score\": 32694.183236243978\n },\n {\n \"content\": \"#[cfg(feature = \\\"logging\\\")]\\n\\nmacro_rules! log {\\n\\n ( $fmt:expr ) => {\\n\\n println!($fmt);\\n\\n };\\n\\n ( $fmt:expr, $($x:tt)* ) => {\\n\\n println!($fmt, $($x)*);\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(not(feature = \\\"logging\\\"))]\\n\\nmacro_rules! log {\\n\\n ( $fmt:expr ) => {};\\n\\n ( $fmt:expr, $($x:tt)* ) => {\\n\\n if false { let _ = format!($fmt, $($x)*); }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"src/logging.rs\",\n \"rank\": 36,\n \"score\": 32693.30010439536\n },\n {\n \"content\": \" ),\\n\\n Error::TooMuchRecursion => {\\n\\n write!(f, \\\"encountered too much recursion when demangling symbol\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"std\\\")]\\n\\nimpl error::Error for Error {\\n\\n fn description(&self) -> &str {\\n\\n match *self {\\n\\n Error::UnexpectedEnd => \\\"mangled symbol ends abruptly\\\",\\n\\n Error::UnexpectedText => \\\"mangled symbol is not well-formed\\\",\\n\\n Error::BadBackReference => {\\n\\n \\\"back reference that is out-of-bounds of the substitution table\\\"\\n\\n }\\n\\n Error::BadTemplateArgReference => {\\n\\n \\\"reference to a template arg that is either out-of-bounds, or in a context \\\\\\n\\n without template args\\\"\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 37,\n \"score\": 32678.078797358077\n },\n {\n \"content\": \" }\\n\\n Error::ForwardTemplateArgReference => {\\n\\n \\\"reference to a template arg from itself or a later template arg\\\"\\n\\n }\\n\\n Error::BadFunctionArgReference => {\\n\\n \\\"reference to a function arg that is either out-of-bounds, or in a context \\\\\\n\\n without function args\\\"\\n\\n }\\n\\n Error::BadLeafNameReference => {\\n\\n \\\"reference to a leaf name in a context where there is no current leaf name\\\"\\n\\n }\\n\\n Error::Overflow => {\\n\\n \\\"an overflow or underflow would occur when parsing an integer in a mangled symbol\\\"\\n\\n }\\n\\n Error::TooMuchRecursion => \\\"encountered too much recursion when demangling symbol\\\",\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A demangling result of `T` or a `cpp_demangle::error::Error`.\\n\\npub type Result<T> = ::std::result::Result<T, Error>;\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 38,\n \"score\": 32676.396778901522\n },\n {\n \"content\": \" \\\"reference to a template arg that is either out-of-bounds, or in a context \\\\\\n\\n without template args\\\"\\n\\n ),\\n\\n Error::ForwardTemplateArgReference => write!(\\n\\n f,\\n\\n \\\"reference to a template arg from itself or a later template arg\\\"\\n\\n ),\\n\\n Error::BadFunctionArgReference => write!(\\n\\n f,\\n\\n \\\"reference to a function arg that is either out-of-bounds, or in a context \\\\\\n\\n without function args\\\"\\n\\n ),\\n\\n Error::BadLeafNameReference => write!(\\n\\n f,\\n\\n \\\"reference to a leaf name in a context where there is no current leaf name\\\"\\n\\n ),\\n\\n Error::Overflow => write!(\\n\\n f,\\n\\n \\\"an overflow or underflow would occur when parsing an integer in a mangled \\\\\\n\\n symbol\\\"\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 39,\n \"score\": 32666.21376262476\n },\n {\n \"content\": \" /// a context without template args.\\n\\n BadTemplateArgReference,\\n\\n\\n\\n /// Found a reference to a template arg from within the arg itself (or from\\n\\n /// within an earlier arg).\\n\\n ForwardTemplateArgReference,\\n\\n\\n\\n /// Found a reference to a function arg that is either out-of-bounds, or in\\n\\n /// a context without function args.\\n\\n BadFunctionArgReference,\\n\\n\\n\\n /// Found a reference to a leaf name in a context where there is no current\\n\\n /// leaf name.\\n\\n BadLeafNameReference,\\n\\n\\n\\n /// An overflow or underflow would occur when parsing an integer in a\\n\\n /// mangled symbol.\\n\\n Overflow,\\n\\n\\n\\n /// Encountered too much recursion when demangling symbol.\\n\\n TooMuchRecursion,\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 40,\n \"score\": 32661.49072196717\n },\n {\n \"content\": \"\\n\\n /// A `<template-template-param>` production.\\n\\n TemplateTemplateParam(ast::TemplateTemplateParam),\\n\\n\\n\\n /// An `<unresolved-type>` production.\\n\\n UnresolvedType(ast::UnresolvedType),\\n\\n\\n\\n /// A `<prefix>` production.\\n\\n Prefix(ast::Prefix),\\n\\n}\\n\\n\\n\\nimpl<'subs, W> ast::Demangle<'subs, W> for Substitutable\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut ast::DemangleContext<'subs, W>,\\n\\n scope: Option<ast::ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 41,\n \"score\": 32649.951081810384\n },\n {\n \"content\": \" non_substitutions: Vec<Substitutable>,\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for SubstitutionTable {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n f.pad(\\\"SubstitutionTable \\\")?;\\n\\n f.debug_map()\\n\\n .entries(self.substitutions.iter().enumerate())\\n\\n .finish()?;\\n\\n f.pad(\\\"non_substitutions \\\")?;\\n\\n f.debug_map()\\n\\n .entries(self.non_substitutions.iter().enumerate())\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SubstitutionTable {\\n\\n /// Construct a new `SubstitutionTable`.\\n\\n pub fn new() -> SubstitutionTable {\\n\\n Default::default()\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 42,\n \"score\": 32648.058003898364\n },\n {\n \"content\": \"//! Types dealing with the substitutions table.\\n\\n\\n\\nuse super::DemangleWrite;\\n\\nuse ast;\\n\\nuse std::fmt;\\n\\nuse std::iter::FromIterator;\\n\\nuse std::ops::Deref;\\n\\nuse vec::Vec;\\n\\n\\n\\n/// An enumeration of all of the types that can end up in the substitution\\n\\n/// table.\\n\\n#[doc(hidden)]\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\n#[allow(clippy::large_enum_variant)]\\n\\npub enum Substitutable {\\n\\n /// An `<unscoped-template-name>` production.\\n\\n UnscopedTemplateName(ast::UnscopedTemplateName),\\n\\n\\n\\n /// A `<type>` production.\\n\\n Type(ast::Type),\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 43,\n \"score\": 32646.698374675023\n },\n {\n \"content\": \" pub fn contains(&self, idx: usize) -> bool {\\n\\n idx < self.substitutions.len()\\n\\n }\\n\\n\\n\\n /// Get the type referenced by the given handle, or None if there is no such\\n\\n /// entry, or there is an entry that is not a type.\\n\\n pub fn get_type(&self, handle: &ast::TypeHandle) -> Option<&ast::Type> {\\n\\n if let ast::TypeHandle::BackReference(idx) = *handle {\\n\\n self.substitutions.get(idx).and_then(|s| match *s {\\n\\n Substitutable::Type(ref ty) => Some(ty),\\n\\n _ => None,\\n\\n })\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n /// Remove the last entry from the substitutions table and return it, or\\n\\n /// `None` if the table is empty.\\n\\n pub fn pop(&mut self) -> Option<Substitutable> {\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 44,\n \"score\": 32646.39836981994\n },\n {\n \"content\": \" match *self {\\n\\n Substitutable::UnscopedTemplateName(ref name) => name.demangle(ctx, scope),\\n\\n Substitutable::Type(ref ty) => ty.demangle(ctx, scope),\\n\\n Substitutable::TemplateTemplateParam(ref ttp) => ttp.demangle(ctx, scope),\\n\\n Substitutable::UnresolvedType(ref ty) => ty.demangle(ctx, scope),\\n\\n Substitutable::Prefix(ref prefix) => prefix.demangle(ctx, scope),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> ast::GetLeafName<'a> for Substitutable {\\n\\n fn get_leaf_name(&'a self, subs: &'a SubstitutionTable) -> Option<ast::LeafName<'a>> {\\n\\n match *self {\\n\\n Substitutable::UnscopedTemplateName(ref name) => name.get_leaf_name(subs),\\n\\n Substitutable::Prefix(ref prefix) => prefix.get_leaf_name(subs),\\n\\n Substitutable::Type(ref ty) => ty.get_leaf_name(subs),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 45,\n \"score\": 32643.117622880716\n },\n {\n \"content\": \"\\n\\nimpl ast::IsCtorDtorConversion for Substitutable {\\n\\n fn is_ctor_dtor_conversion(&self, subs: &SubstitutionTable) -> bool {\\n\\n match *self {\\n\\n Substitutable::Prefix(ref prefix) => prefix.is_ctor_dtor_conversion(subs),\\n\\n _ => false,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// The table of substitutable components that we have parsed thus far, and for\\n\\n/// which there are potential back-references.\\n\\n#[doc(hidden)]\\n\\n#[derive(Clone, Default, PartialEq, Eq)]\\n\\npub struct SubstitutionTable {\\n\\n substitutions: Vec<Substitutable>,\\n\\n // There are components which are typically candidates for substitution, but\\n\\n // in some particular circumstances are not. Instances of such components\\n\\n // which are not candidates for substitution end up in this part of the\\n\\n // table. See `<prefix>` parsing for further details.\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 46,\n \"score\": 32640.59149956724\n },\n {\n \"content\": \" log!(\\\"SubstitutionTable::pop @ {}: {:?}\\\", self.len(), self.last());\\n\\n self.substitutions.pop()\\n\\n }\\n\\n\\n\\n /// Get the `idx`th entity that is not a candidate for substitution. Panics\\n\\n /// if `idx` is out of bounds.\\n\\n pub fn non_substitution(&self, idx: usize) -> &Substitutable {\\n\\n &self.non_substitutions[idx]\\n\\n }\\n\\n\\n\\n /// Get the `idx`th entity that is not a candidate for substitution. Returns\\n\\n /// `None` if `idx` is out of bounds.\\n\\n pub fn get_non_substitution(&self, idx: usize) -> Option<&Substitutable> {\\n\\n self.non_substitutions.get(idx)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromIterator<Substitutable> for SubstitutionTable {\\n\\n fn from_iter<I: IntoIterator<Item = Substitutable>>(iter: I) -> Self {\\n\\n SubstitutionTable {\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 47,\n \"score\": 32638.432851458263\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Insert a freshly-parsed substitutable component into the table and\\n\\n /// return the index at which it now lives.\\n\\n pub fn insert(&mut self, entity: Substitutable) -> usize {\\n\\n let idx = self.substitutions.len();\\n\\n log!(\\\"SubstitutionTable::insert @ {}: {:?}\\\", idx, entity);\\n\\n self.substitutions.push(entity);\\n\\n idx\\n\\n }\\n\\n\\n\\n /// Insert a an entity into the table that is not a candidate for\\n\\n /// substitution.\\n\\n pub fn insert_non_substitution(&mut self, entity: Substitutable) -> usize {\\n\\n let idx = self.non_substitutions.len();\\n\\n self.non_substitutions.push(entity);\\n\\n idx\\n\\n }\\n\\n\\n\\n /// Does this substitution table contain a component at the given index?\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 48,\n \"score\": 32634.336695799782\n },\n {\n \"content\": \" substitutions: Vec::from_iter(iter),\\n\\n non_substitutions: vec![],\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Deref for SubstitutionTable {\\n\\n type Target = [Substitutable];\\n\\n\\n\\n fn deref(&self) -> &Self::Target {\\n\\n &self.substitutions[..]\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/subs.rs\",\n \"rank\": 49,\n \"score\": 32631.83116185195\n },\n {\n \"content\": \"fn assert_does_not_parse(s: &str) {\\n\\n if let Ok(sym) = cpp_demangle::BorrowedSymbol::new(s.as_bytes()) {\\n\\n panic!(\\\"Unexpectedly parsed '{}' as '{}'\\\", s, sym);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/tests.rs\",\n \"rank\": 50,\n \"score\": 31035.081733336232\n },\n {\n \"content\": \"fn assert_does_not_demangle(s: &str) {\\n\\n match cpp_demangle::BorrowedSymbol::new(s.as_bytes()) {\\n\\n Ok(sym) => {\\n\\n if let Ok(d) = sym.demangle(&DemangleOptions::default()) {\\n\\n panic!(\\\"Unexpectedly demangled '{}' as '{}'\\\", s, d);\\n\\n }\\n\\n }\\n\\n Err(e) => {\\n\\n panic!(\\\"Failed to parse '{}': {}\\\", s, e);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nmacro_rules! demangles {\\n\\n ( $mangled:ident , $demangled:expr ) => {\\n\\n demangles!($mangled, stringify!($mangled), $demangled);\\n\\n };\\n\\n ( $name:ident , $mangled:expr , $demangled:expr ) => {\\n\\n #[test]\\n\\n fn $name() {\\n\",\n \"file_path\": \"tests/tests.rs\",\n \"rank\": 51,\n \"score\": 31035.081733336232\n },\n {\n \"content\": \"fn get_cppfilt() -> &'static str {\\n\\n if cfg!(not(target_os = \\\"macos\\\")) {\\n\\n return \\\"c++filt\\\";\\n\\n }\\n\\n\\n\\n // Prefer `gc++filt` (from the homebrew binutils package) since it is built\\n\\n // with a newer libiberty than the system `c++filt` (and maybe the system\\n\\n // `c++filt` will be backed by the LLVM demangler one day).\\n\\n match process::Command::new(\\\"gc++filt\\\").spawn() {\\n\\n Ok(mut child) => {\\n\\n child.kill().expect(\\\"should kill child\\\");\\n\\n child.wait().expect(\\\"should wait on child\\\");\\n\\n \\\"gc++filt\\\"\\n\\n }\\n\\n Err(_) => \\\"c++filt\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/libxul.rs\",\n \"rank\": 52,\n \"score\": 29360.22781380828\n },\n {\n \"content\": \" P: Debug + Parse + PartialEq,\\n\\n S: AsRef<[Substitutable]>,\\n\\n I: AsRef<[u8]>,\\n\\n {\\n\\n let input = input.as_ref();\\n\\n let ctx = ParseContext::new(Default::default());\\n\\n let mut subs = SubstitutionTable::from_iter(subs.as_ref().iter().cloned());\\n\\n\\n\\n match P::parse(&ctx, &mut subs, IndexStr::from(input)) {\\n\\n Err(ref error) if *error == expected_error => {}\\n\\n Err(ref error) => {\\n\\n panic!(\\n\\n \\\"Parsing {:?} as {} produced an error of kind {:?}, but we expected kind {:?}\\\",\\n\\n String::from_utf8_lossy(input),\\n\\n production,\\n\\n error,\\n\\n expected_error\\n\\n );\\n\\n }\\n\\n Ok((value, tail)) => {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 53,\n \"score\": 24815.272250596714\n },\n {\n \"content\": \"#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub struct DataMemberPrefix(SourceName);\\n\\n\\n\\nimpl Parse for DataMemberPrefix {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(DataMemberPrefix, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"DataMemberPrefix\\\", ctx, input);\\n\\n\\n\\n let (name, tail) = SourceName::parse(ctx, subs, input)?;\\n\\n let tail = consume(b\\\"M\\\", tail)?;\\n\\n Ok((DataMemberPrefix(name), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> GetLeafName<'a> for DataMemberPrefix {\\n\\n #[inline]\\n\\n fn get_leaf_name(&'a self, _: &'a SubstitutionTable) -> Option<LeafName<'a>> {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 54,\n \"score\": 24814.494606021584\n },\n {\n \"content\": \" subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(BareFunctionType, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"BareFunctionType\\\", ctx, input);\\n\\n\\n\\n let (types, tail) = one_or_more::<TypeHandle>(ctx, subs, input)?;\\n\\n Ok((BareFunctionType(types), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for BareFunctionType\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n let ctx = try_begin_demangle!(self, ctx, scope);\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 55,\n \"score\": 24814.21169932806\n },\n {\n \"content\": \"/// The `<pointer-to-member-type>` production.\\n\\n///\\n\\n/// ```text\\n\\n/// <pointer-to-member-type> ::= M <class type> <member type>\\n\\n/// ```\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub struct PointerToMemberType(TypeHandle, TypeHandle);\\n\\n\\n\\nimpl Parse for PointerToMemberType {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(PointerToMemberType, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"PointerToMemberType\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"M\\\", input)?;\\n\\n let (ty1, tail) = TypeHandle::parse(ctx, subs, tail)?;\\n\\n let (ty2, tail) = TypeHandle::parse(ctx, subs, tail)?;\\n\\n Ok((PointerToMemberType(ty1, ty2), tail))\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 56,\n \"score\": 24813.645554313614\n },\n {\n \"content\": \" expected_tail: I2,\\n\\n expected_new_subs: S2,\\n\\n ) where\\n\\n P: Debug + Parse + PartialEq,\\n\\n S1: AsRef<[Substitutable]>,\\n\\n S2: AsRef<[Substitutable]>,\\n\\n I1: AsRef<[u8]>,\\n\\n I2: AsRef<[u8]>,\\n\\n {\\n\\n let ctx = ParseContext::new(Default::default());\\n\\n let input = input.as_ref();\\n\\n let expected_tail = expected_tail.as_ref();\\n\\n\\n\\n let expected_subs = SubstitutionTable::from_iter(\\n\\n subs.as_ref()\\n\\n .iter()\\n\\n .cloned()\\n\\n .chain(expected_new_subs.as_ref().iter().cloned()),\\n\\n );\\n\\n let mut subs = SubstitutionTable::from_iter(subs.as_ref().iter().cloned());\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 57,\n \"score\": 24813.367080481614\n },\n {\n \"content\": \" ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(FunctionType, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"FunctionType\\\", ctx, input);\\n\\n\\n\\n let (cv_qualifiers, tail) =\\n\\n if let Ok((cv_qualifiers, tail)) = CvQualifiers::parse(ctx, subs, input) {\\n\\n (cv_qualifiers, tail)\\n\\n } else {\\n\\n (Default::default(), input)\\n\\n };\\n\\n\\n\\n let (transaction_safe, tail) = if let Ok(tail) = consume(b\\\"Dx\\\", tail) {\\n\\n (true, tail)\\n\\n } else {\\n\\n (false, tail)\\n\\n };\\n\\n\\n\\n let tail = consume(b\\\"F\\\", tail)?;\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 58,\n \"score\": 24813.142258870514\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Parse for VectorType {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(VectorType, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"VectorType\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"Dv\\\", input)?;\\n\\n\\n\\n if let Ok((num, tail)) = parse_number(10, false, tail) {\\n\\n debug_assert!(num >= 0);\\n\\n let tail = consume(b\\\"_\\\", tail)?;\\n\\n let (ty, tail) = TypeHandle::parse(ctx, subs, tail)?;\\n\\n return Ok((VectorType::DimensionNumber(num as _, ty), tail));\\n\\n }\\n\\n\\n\\n let tail = consume(b\\\"_\\\", tail)?;\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 59,\n \"score\": 24812.711271804725\n },\n {\n \"content\": \" self.bytes_written += s.len();\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, W> DemangleContext<'a, W>\\n\\nwhere\\n\\n W: 'a + DemangleWrite,\\n\\n{\\n\\n /// Construct a new `DemangleContext`.\\n\\n pub fn new(\\n\\n subs: &'a SubstitutionTable,\\n\\n input: &'a [u8],\\n\\n options: DemangleOptions,\\n\\n out: &'a mut W,\\n\\n ) -> DemangleContext<'a, W> {\\n\\n DemangleContext {\\n\\n subs: subs,\\n\\n max_recursion: options.recursion_limit.map(|v| v.get()).unwrap_or(128),\\n\\n inner: vec![],\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 60,\n \"score\": 24811.895896926948\n },\n {\n \"content\": \" _subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(UnnamedTypeName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"UnnamedTypeName\\\", ctx, input);\\n\\n\\n\\n let input = consume(b\\\"Ut\\\", input)?;\\n\\n let (number, input) = match parse_number(10, false, input) {\\n\\n Ok((number, input)) => (Some(number as _), input),\\n\\n Err(_) => (None, input),\\n\\n };\\n\\n let input = consume(b\\\"_\\\", input)?;\\n\\n Ok((UnnamedTypeName(number), input))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl UnnamedTypeName {\\n\\n #[inline]\\n\\n fn starts_with(byte: u8) -> bool {\\n\\n byte == b'U'\\n\\n }\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 61,\n \"score\": 24811.664218679965\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl Parse for TypeHandle {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(TypeHandle, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"TypeHandle\\\", ctx, input);\\n\\n\\n\\n /// Insert the given type into the substitution table, and return a\\n\\n /// handle referencing the index in the table where it ended up.\\n\\n fn insert_and_return_handle<'a, 'b>(\\n\\n ty: Type,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n tail: IndexStr<'b>,\\n\\n ) -> Result<(TypeHandle, IndexStr<'b>)> {\\n\\n let ty = Substitutable::Type(ty);\\n\\n let idx = subs.insert(ty);\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 62,\n \"score\": 24811.212301713942\n },\n {\n \"content\": \"/// <initializer> ::= pi <expression>* E # parenthesized initialization\\n\\n/// ```\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub struct Initializer(Vec<Expression>);\\n\\n\\n\\nimpl Parse for Initializer {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(Initializer, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"Initializer\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"pi\\\", input)?;\\n\\n let (exprs, tail) = zero_or_more::<Expression>(ctx, subs, tail)?;\\n\\n let tail = consume(b\\\"E\\\", tail)?;\\n\\n Ok((Initializer(exprs), tail))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 63,\n \"score\": 24810.93965366381\n },\n {\n \"content\": \"impl Parse for LambdaSig {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(LambdaSig, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"LambdaSig\\\", ctx, input);\\n\\n\\n\\n let (types, tail) = if let Ok(tail) = consume(b\\\"v\\\", input) {\\n\\n (vec![], tail)\\n\\n } else {\\n\\n one_or_more::<TypeHandle>(ctx, subs, input)?\\n\\n };\\n\\n Ok((LambdaSig(types), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for LambdaSig\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 64,\n \"score\": 24810.72512497221\n },\n {\n \"content\": \"//! Abstract syntax tree types for mangled symbols.\\n\\n\\n\\nuse super::{DemangleNodeType, DemangleOptions, DemangleWrite, ParseOptions};\\n\\nuse boxed::Box;\\n\\nuse error::{self, Result};\\n\\nuse index_str::IndexStr;\\n\\nuse std::cell::Cell;\\n\\n#[cfg(feature = \\\"logging\\\")]\\n\\nuse std::cell::RefCell;\\n\\nuse std::fmt::{self, Write};\\n\\nuse std::hash::{Hash, Hasher};\\n\\nuse std::mem;\\n\\nuse std::ops;\\n\\nuse std::ptr;\\n\\nuse string::String;\\n\\nuse subs::{Substitutable, SubstitutionTable};\\n\\nuse vec::Vec;\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 65,\n \"score\": 24810.725574417444\n },\n {\n \"content\": \"\\n\\nimpl Parse for CvQualifiers {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n _subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(CvQualifiers, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"CvQualifiers\\\", ctx, input);\\n\\n\\n\\n let (restrict, tail) = if let Ok(tail) = consume(b\\\"r\\\", input) {\\n\\n (true, tail)\\n\\n } else {\\n\\n (false, input)\\n\\n };\\n\\n\\n\\n let (volatile, tail) = if let Ok(tail) = consume(b\\\"V\\\", tail) {\\n\\n (true, tail)\\n\\n } else {\\n\\n (false, tail)\\n\\n };\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 66,\n \"score\": 24810.341101054466\n },\n {\n \"content\": \" extra NonSubstitution(NonSubstitution),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Parse for PrefixHandle {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(PrefixHandle, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"PrefixHandle\\\", ctx, input);\\n\\n\\n\\n #[inline]\\n\\n fn save(\\n\\n subs: &mut SubstitutionTable,\\n\\n prefix: Prefix,\\n\\n tail_tail: IndexStr<'_>,\\n\\n ) -> PrefixHandle {\\n\\n if let Some(b'E') = tail_tail.peek() {\\n\\n // An `E` means that we just finished parsing a `<nested-name>`\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 67,\n \"score\": 24810.090639172002\n },\n {\n \"content\": \"pub enum ArrayType {\\n\\n /// An array with a number-literal dimension.\\n\\n DimensionNumber(usize, TypeHandle),\\n\\n\\n\\n /// An array with an expression for its dimension.\\n\\n DimensionExpression(Expression, TypeHandle),\\n\\n\\n\\n /// An array with no dimension.\\n\\n NoDimension(TypeHandle),\\n\\n}\\n\\n\\n\\nimpl Parse for ArrayType {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(ArrayType, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"ArrayType\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"A\\\", input)?;\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 68,\n \"score\": 24810.030123114877\n },\n {\n \"content\": \"pub struct TemplateArgs(Vec<TemplateArg>);\\n\\n\\n\\nimpl Parse for TemplateArgs {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(TemplateArgs, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"TemplateArgs\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"I\\\", input)?;\\n\\n\\n\\n let (args, tail) = one_or_more::<TemplateArg>(ctx, subs, tail)?;\\n\\n let tail = consume(b\\\"E\\\", tail)?;\\n\\n Ok((TemplateArgs(args), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for TemplateArgs\\n\\nwhere\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 69,\n \"score\": 24809.853729370734\n },\n {\n \"content\": \"/// <source-name> ::= <positive length number> <identifier>\\n\\n/// ```\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub struct SourceName(Identifier);\\n\\n\\n\\nimpl Parse for SourceName {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(SourceName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"SourceName\\\", ctx, input);\\n\\n\\n\\n let (source_name_len, input) = parse_number(10, false, input)?;\\n\\n debug_assert!(source_name_len >= 0);\\n\\n if source_name_len == 0 {\\n\\n return Err(error::Error::UnexpectedText);\\n\\n }\\n\\n\\n\\n let (head, tail) = match input.try_split_at(source_name_len as _) {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 70,\n \"score\": 24809.77638528423\n },\n {\n \"content\": \" end: usize,\\n\\n}\\n\\n\\n\\nimpl Parse for CloneTypeIdentifier {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n _subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(CloneTypeIdentifier, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"CloneTypeIdentifier\\\", ctx, input);\\n\\n\\n\\n if input.is_empty() {\\n\\n return Err(error::Error::UnexpectedEnd);\\n\\n }\\n\\n\\n\\n let end = input\\n\\n .as_ref()\\n\\n .iter()\\n\\n .map(|&c| c as char)\\n\\n .take_while(|&c| c == '$' || c == '_' || c.is_digit(36))\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 71,\n \"score\": 24809.74865030145\n },\n {\n \"content\": \" (b't', tail) | (_, tail) => {\\n\\n let (base, tail) = Encoding::parse(ctx, subs, tail)?;\\n\\n Ok((SpecialName::TransactionClone(Box::new(base)), tail))\\n\\n }\\n\\n }\\n\\n }\\n\\n _ => Err(error::Error::UnexpectedText),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for SpecialName\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 72,\n \"score\": 24809.74063922428\n },\n {\n \"content\": \"\\n\\nimpl Parse for NestedName {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(NestedName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"NestedName\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"N\\\", input)?;\\n\\n\\n\\n let (cv_qualifiers, tail) = if let Ok((q, tail)) = CvQualifiers::parse(ctx, subs, tail) {\\n\\n (q, tail)\\n\\n } else {\\n\\n (Default::default(), tail)\\n\\n };\\n\\n\\n\\n let (ref_qualifier, tail) = if let Ok((r, tail)) = RefQualifier::parse(ctx, subs, tail) {\\n\\n (Some(r), tail)\\n\\n } else {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 73,\n \"score\": 24809.73470477918\n },\n {\n \"content\": \" subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(Substitution, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"Substitution\\\", ctx, input);\\n\\n\\n\\n if let Ok((well_known, tail)) = WellKnownComponent::parse(ctx, subs, input) {\\n\\n return Ok((Substitution::WellKnown(well_known), tail));\\n\\n }\\n\\n\\n\\n let tail = consume(b\\\"S\\\", input)?;\\n\\n let (idx, tail) = if let Ok((idx, tail)) = SeqId::parse(ctx, subs, tail) {\\n\\n (idx.0 + 1, tail)\\n\\n } else {\\n\\n (0, tail)\\n\\n };\\n\\n\\n\\n if !subs.contains(idx) {\\n\\n return Err(error::Error::BadBackReference);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 74,\n \"score\": 24809.72192687848\n },\n {\n \"content\": \"\\n\\nimpl Parse for FunctionParam {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(FunctionParam, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"FunctionParam\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"f\\\", input)?;\\n\\n if tail.is_empty() {\\n\\n return Err(error::Error::UnexpectedEnd);\\n\\n }\\n\\n\\n\\n let (scope, tail) = if let Ok(tail) = consume(b\\\"L\\\", tail) {\\n\\n parse_number(10, false, tail)?\\n\\n } else {\\n\\n (0, tail)\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 75,\n \"score\": 24809.62218689584\n },\n {\n \"content\": \"\\n\\n /// A non-standard, vendor extension type.\\n\\n ///\\n\\n /// ```text\\n\\n /// <builtin-type> ::= u <source-name> # vendor extended type\\n\\n /// ```\\n\\n Extension(SourceName),\\n\\n}\\n\\n\\n\\nimpl Parse for BuiltinType {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(BuiltinType, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"BuiltinType\\\", ctx, input);\\n\\n\\n\\n if let Ok((ty, tail)) = StandardBuiltinType::parse(ctx, subs, input) {\\n\\n return Ok((BuiltinType::Standard(ty), tail));\\n\\n }\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 76,\n \"score\": 24809.40688364524\n },\n {\n \"content\": \" LocalSourceName(SourceName, Option<Discriminator>),\\n\\n /// A generated name for an unnamed type.\\n\\n UnnamedType(UnnamedTypeName),\\n\\n /// An ABI tag.\\n\\n ABITag(TaggedName),\\n\\n /// A closure type name\\n\\n ClosureType(ClosureTypeName),\\n\\n}\\n\\n\\n\\nimpl Parse for UnqualifiedName {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(UnqualifiedName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"UnqualifiedName\\\", ctx, input);\\n\\n\\n\\n if let Ok((op, tail)) = OperatorName::parse(ctx, subs, input) {\\n\\n return Ok((UnqualifiedName::Operator(op), tail));\\n\\n }\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 77,\n \"score\": 24809.35235584957\n },\n {\n \"content\": \"pub struct TaggedName(SourceName);\\n\\n\\n\\nimpl Parse for TaggedName {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(TaggedName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"TaggedName\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"B\\\", input)?;\\n\\n let (source_name, tail) = SourceName::parse(ctx, subs, tail)?;\\n\\n Ok((TaggedName(source_name), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for TaggedName\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 78,\n \"score\": 24809.33641191669\n },\n {\n \"content\": \" pub fn new(options: ParseOptions) -> ParseContext {\\n\\n ParseContext {\\n\\n max_recursion: options.recursion_limit.map(|v| v.get()).unwrap_or(96),\\n\\n state: Cell::new(ParseContextState::default()),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get the current recursion level for this context.\\n\\n pub fn recursion_level(&self) -> u32 {\\n\\n self.state.get().recursion_level\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn enter_recursion(&self) -> error::Result<()> {\\n\\n let mut state = self.state.get();\\n\\n let new_recursion_level = state.recursion_level + 1;\\n\\n\\n\\n if new_recursion_level >= self.max_recursion {\\n\\n log!(\\\"Hit too much recursion at level {}\\\", self.max_recursion);\\n\\n Err(error::Error::TooMuchRecursion)\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 79,\n \"score\": 24809.177959056076\n },\n {\n \"content\": \"\\n\\nimpl Parse for ClosureTypeName {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(ClosureTypeName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"ClosureTypeName\\\", ctx, input);\\n\\n\\n\\n let tail = consume(b\\\"Ul\\\", input)?;\\n\\n let (sig, tail) = LambdaSig::parse(ctx, subs, tail)?;\\n\\n let tail = consume(b\\\"E\\\", tail)?;\\n\\n let (num, tail) = if let Ok((num, tail)) = parse_number(10, false, tail) {\\n\\n (Some(num as _), tail)\\n\\n } else {\\n\\n (None, tail)\\n\\n };\\n\\n let tail = consume(b\\\"_\\\", tail)?;\\n\\n Ok((ClosureTypeName(sig, num), tail))\\n\\n }\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 80,\n \"score\": 24809.088331504234\n },\n {\n \"content\": \"\\n\\n let tail = consume(b\\\"u\\\", input)?;\\n\\n let (name, tail) = SourceName::parse(ctx, subs, tail)?;\\n\\n Ok((BuiltinType::Extension(name), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for BuiltinType\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n let ctx = try_begin_demangle!(self, ctx, scope);\\n\\n\\n\\n match *self {\\n\\n BuiltinType::Standard(ref ty) => ty.demangle(ctx, scope),\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 81,\n \"score\": 24809.039443870013\n },\n {\n \"content\": \"where\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle_as_leaf<'me, 'ctx>(\\n\\n &'me self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n ) -> fmt::Result {\\n\\n match *self {\\n\\n LeafName::SourceName(sn) => sn.demangle(ctx, None),\\n\\n LeafName::Closure(c) => c.demangle(ctx, None),\\n\\n LeafName::WellKnownComponent(wkc) => wkc.demangle_as_leaf(ctx),\\n\\n LeafName::UnnamedType(utn) => utn.demangle_as_leaf(ctx),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Determine whether this AST node is some kind (potentially namespaced) name\\n\\n/// and if so get its leaf name.\\n\\npub(crate) trait GetLeafName<'a> {\\n\\n fn get_leaf_name(&'a self, subs: &'a SubstitutionTable) -> Option<LeafName<'a>>;\\n\\n}\\n\\n\\n\\n/// Determine whether this AST node is a constructor, destructor, or conversion\\n\\n/// function.\\n\\npub(crate) trait IsCtorDtorConversion {\\n\\n fn is_ctor_dtor_conversion(&self, subs: &SubstitutionTable) -> bool;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 82,\n \"score\": 24809.037503369007\n },\n {\n \"content\": \" ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(NvOffset, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"NvOffset\\\", ctx, input);\\n\\n\\n\\n Number::parse(ctx, subs, input).map(|(num, tail)| (NvOffset(num), tail))\\n\\n }\\n\\n}\\n\\n\\n\\n/// A virtual offset, as described by the <v-offset> production.\\n\\n///\\n\\n/// ```text\\n\\n/// <v-offset> ::= <offset number> _ <virtual offset number>\\n\\n/// ```\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub struct VOffset(isize, isize);\\n\\n\\n\\nimpl Parse for VOffset {\\n\\n fn parse<'a, 'b>(\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 83,\n \"score\": 24808.97390623331\n },\n {\n \"content\": \" Function(Name, BareFunctionType),\\n\\n\\n\\n /// An encoded static variable.\\n\\n Data(Name),\\n\\n\\n\\n /// A special encoding.\\n\\n Special(SpecialName),\\n\\n}\\n\\n\\n\\nimpl Parse for Encoding {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(Encoding, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"Encoding\\\", ctx, input);\\n\\n\\n\\n if let Ok((name, tail)) = Name::parse(ctx, subs, input) {\\n\\n if let Ok((ty, tail)) = BareFunctionType::parse(ctx, subs, tail) {\\n\\n return Ok((Encoding::Function(name, ty), tail));\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 84,\n \"score\": 24808.936428294757\n },\n {\n \"content\": \"pub enum GlobalCtorDtor {\\n\\n /// A global constructor.\\n\\n Ctor(Box<MangledName>),\\n\\n /// A global destructor.\\n\\n Dtor(Box<MangledName>),\\n\\n}\\n\\n\\n\\nimpl Parse for GlobalCtorDtor {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(GlobalCtorDtor, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"GlobalCtorDtor\\\", ctx, input);\\n\\n\\n\\n let tail = match input.next_or(error::Error::UnexpectedEnd)? {\\n\\n (b'_', t) | (b'.', t) | (b'$', t) => t,\\n\\n _ => return Err(error::Error::UnexpectedText),\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 85,\n \"score\": 24808.875164389567\n },\n {\n \"content\": \" &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n FunctionArgSlice::new(&self.0[1..]).demangle(ctx, scope)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> DemangleAsInner<'subs, W> for FunctionArgListAndReturnType where\\n\\n W: 'subs + DemangleWrite\\n\\n{\\n\\n}\\n\\n\\n\\n/// Define a handle to a AST type that lives inside the substitution table. A\\n\\n/// handle is always either an index into the substitution table, or it is a\\n\\n/// reference to a \\\"well-known\\\" component.\\n\\n///\\n\\n/// This declares:\\n\\n///\\n\\n/// - The enum of either a back reference into the substitution table or a\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 86,\n \"score\": 24808.75844174132\n },\n {\n \"content\": \"\\n\\n if let Ok(tail) = consume(b\\\"St\\\", input) {\\n\\n let (name, tail) = UnqualifiedName::parse(ctx, subs, tail)?;\\n\\n return Ok((UnscopedName::Std(name), tail));\\n\\n }\\n\\n\\n\\n let (name, tail) = UnqualifiedName::parse(ctx, subs, input)?;\\n\\n Ok((UnscopedName::Unqualified(name), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for UnscopedName\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 87,\n \"score\": 24808.753441874713\n },\n {\n \"content\": \" fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(DestructorName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"DestructorName\\\", ctx, input);\\n\\n\\n\\n if let Ok((ty, tail)) = UnresolvedTypeHandle::parse(ctx, subs, input) {\\n\\n return Ok((DestructorName::Unresolved(ty), tail));\\n\\n }\\n\\n\\n\\n let (name, tail) = SimpleId::parse(ctx, subs, input)?;\\n\\n Ok((DestructorName::Name(name), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for DestructorName\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 88,\n \"score\": 24808.749732616256\n },\n {\n \"content\": \" fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n let ctx = try_begin_demangle!(self, ctx, scope);\\n\\n\\n\\n write!(ctx, \\\"[abi:\\\")?;\\n\\n self.0.demangle(ctx, scope)?;\\n\\n write!(ctx, \\\"]\\\")\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TaggedName {\\n\\n #[inline]\\n\\n fn starts_with(byte: u8) -> bool {\\n\\n byte == b'B'\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 89,\n \"score\": 24808.736630177827\n },\n {\n \"content\": \"\\n\\n fn parse_internal<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n from_expr: bool,\\n\\n ) -> Result<(OperatorName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"OperatorName\\\", ctx, input);\\n\\n\\n\\n if let Ok((simple, tail)) = SimpleOperatorName::parse(ctx, subs, input) {\\n\\n return Ok((OperatorName::Simple(simple), tail));\\n\\n }\\n\\n\\n\\n if let Ok(tail) = consume(b\\\"cv\\\", input) {\\n\\n // If we came through the expression path, we're a cast. If not,\\n\\n // we're a conversion.\\n\\n let previously_in_conversion = ctx.set_in_conversion(!from_expr);\\n\\n let parse_result = TypeHandle::parse(ctx, subs, tail);\\n\\n ctx.set_in_conversion(previously_in_conversion);\\n\\n let (ty, tail) = parse_result?;\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 90,\n \"score\": 24808.733614247325\n },\n {\n \"content\": \" input: IndexStr<'b>,\\n\\n ) -> Result<(UnresolvedQualifierLevel, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"UnresolvedQualifierLevel\\\", ctx, input);\\n\\n\\n\\n let (id, tail) = SimpleId::parse(ctx, subs, input)?;\\n\\n Ok((UnresolvedQualifierLevel(id), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for UnresolvedQualifierLevel\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n #[inline]\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n let ctx = try_begin_demangle!(self, ctx, scope);\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 91,\n \"score\": 24808.63654094539\n },\n {\n \"content\": \" ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(UnresolvedTypeHandle, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"UnresolvedTypeHandle\\\", ctx, input);\\n\\n\\n\\n if let Ok((param, tail)) = TemplateParam::parse(ctx, subs, input) {\\n\\n let (args, tail) = if let Ok((args, tail)) = TemplateArgs::parse(ctx, subs, tail) {\\n\\n (Some(args), tail)\\n\\n } else {\\n\\n (None, tail)\\n\\n };\\n\\n let ty = UnresolvedType::Template(param, args);\\n\\n let ty = Substitutable::UnresolvedType(ty);\\n\\n let idx = subs.insert(ty);\\n\\n let handle = UnresolvedTypeHandle::BackReference(idx);\\n\\n return Ok((handle, tail));\\n\\n }\\n\\n\\n\\n if let Ok((decltype, tail)) = Decltype::parse(ctx, subs, input) {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 92,\n \"score\": 24808.475446228524\n },\n {\n \"content\": \"/// ```text\\n\\n/// <unscoped-name> ::= <unqualified-name>\\n\\n/// ::= St <unqualified-name> # ::std::\\n\\n/// ```\\n\\n#[derive(Clone, Debug, PartialEq, Eq)]\\n\\npub enum UnscopedName {\\n\\n /// An unqualified name.\\n\\n Unqualified(UnqualifiedName),\\n\\n\\n\\n /// A name within the `std::` namespace.\\n\\n Std(UnqualifiedName),\\n\\n}\\n\\n\\n\\nimpl Parse for UnscopedName {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(UnscopedName, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"UnscopedName\\\", ctx, input);\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 93,\n \"score\": 24808.46133945733\n },\n {\n \"content\": \" fn get_function_arg(&'a self, _: usize) -> Result<&'a Type> {\\n\\n Err(error::Error::BadFunctionArgReference)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> DemangleAsLeaf<'subs, W> for WellKnownComponent\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle_as_leaf<'me, 'ctx>(\\n\\n &'me self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n ) -> fmt::Result {\\n\\n match *self {\\n\\n WellKnownComponent::Std => {\\n\\n panic!(\\\"should never treat `WellKnownComponent::Std` as a leaf name\\\")\\n\\n }\\n\\n WellKnownComponent::StdAllocator => write!(ctx, \\\"allocator\\\"),\\n\\n WellKnownComponent::StdString1 => write!(ctx, \\\"basic_string\\\"),\\n\\n WellKnownComponent::StdString2 => write!(ctx, \\\"string\\\"),\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 94,\n \"score\": 24808.449376602326\n },\n {\n \"content\": \"\\n\\nimpl Parse for TemplateArg {\\n\\n fn parse<'a, 'b>(\\n\\n ctx: &'a ParseContext,\\n\\n subs: &'a mut SubstitutionTable,\\n\\n input: IndexStr<'b>,\\n\\n ) -> Result<(TemplateArg, IndexStr<'b>)> {\\n\\n try_begin_parse!(\\\"TemplateArg\\\", ctx, input);\\n\\n\\n\\n if let Ok(tail) = consume(b\\\"X\\\", input) {\\n\\n let (expr, tail) = Expression::parse(ctx, subs, tail)?;\\n\\n let tail = consume(b\\\"E\\\", tail)?;\\n\\n return Ok((TemplateArg::Expression(expr), tail));\\n\\n }\\n\\n\\n\\n if let Ok((expr, tail)) = ExprPrimary::parse(ctx, subs, input) {\\n\\n return Ok((TemplateArg::SimpleExpression(expr), tail));\\n\\n }\\n\\n\\n\\n if let Ok((ty, tail)) = TypeHandle::parse(ctx, subs, input) {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 95,\n \"score\": 24808.40049274833\n },\n {\n \"content\": \" let tail = consume(b\\\"e\\\", tail)?;\\n\\n let (name, tail) = Name::parse(ctx, subs, tail)?;\\n\\n Ok((ClassEnumType::ElaboratedEnum(name), tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for ClassEnumType\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n let ctx = try_begin_demangle!(self, ctx, scope);\\n\\n\\n\\n match *self {\\n\\n ClassEnumType::Named(ref name) => name.demangle(ctx, scope),\\n\\n ClassEnumType::ElaboratedStruct(ref name) => {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 96,\n \"score\": 24808.386505524755\n },\n {\n \"content\": \" Some(LeafName::SourceName(&self.0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DataMemberPrefix {\\n\\n fn starts_with(byte: u8) -> bool {\\n\\n SourceName::starts_with(byte)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for DataMemberPrefix\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n #[inline]\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 97,\n \"score\": 24808.150374823195\n },\n {\n \"content\": \" transaction_safe: transaction_safe,\\n\\n extern_c: extern_c,\\n\\n bare: bare,\\n\\n ref_qualifier: ref_qualifier,\\n\\n };\\n\\n Ok((func_ty, tail))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'subs, W> Demangle<'subs, W> for FunctionType\\n\\nwhere\\n\\n W: 'subs + DemangleWrite,\\n\\n{\\n\\n fn demangle<'prev, 'ctx>(\\n\\n &'subs self,\\n\\n ctx: &'ctx mut DemangleContext<'subs, W>,\\n\\n scope: Option<ArgScopeStack<'prev, 'subs>>,\\n\\n ) -> fmt::Result {\\n\\n let ctx = try_begin_demangle!(self, ctx, scope);\\n\\n\\n\",\n \"file_path\": \"src/ast.rs\",\n \"rank\": 98,\n \"score\": 24808.127821308786\n }\n]","isConversational":false}}},{"rowIdx":1991,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"crates/nodes/src/logic_data.rs"},"repo_name":{"kind":"string","value":"gents83/NRG"},"commit":{"kind":"string","value":"62743a54ac873a8dea359f3816e24c189a323ebb"},"file_code":{"kind":"string","value":"use sabi_serialize::{Deserialize, Serialize, SerializeFile};\n\nuse crate::{LogicContext, LogicExecution, NodeExecutionType, NodeState, NodeTree, PinId};\n\n#[derive(Default, PartialEq, Eq, Hash, Clone)]\nstruct LinkInfo {\n node: usize,\n pin: PinId,\n}\n#[derive(Default, Clone)]\nstruct PinInfo {\n id: PinId,\n links: Vec<LinkInfo>,\n}\n#[derive(Default, Clone)]\nstruct NodeInfo {\n inputs: Vec<PinInfo>,\n outputs: Vec<PinInfo>,\n}\n\n#[derive(Default, Serialize, Deserialize, Clone)]\n#[serde(crate = \"sabi_serialize\")]\npub struct LogicData {\n #[serde(flatten)]\n tree: NodeTree,\n #[serde(skip)]\n active_nodes: Vec<LinkInfo>,\n #[serde(skip)]\n nodes_info: Vec<NodeInfo>,\n #[serde(skip)]\n execution_state: Vec<NodeState>,\n #[serde(skip)]\n context: LogicContext,\n}\n\nimpl SerializeFile for LogicData {\n fn extension() -> &'static str {\n \"logic\"\n }\n}\n\nimpl From<NodeTree> for LogicData {\n fn from(tree: NodeTree) -> Self {\n Self {\n tree,\n active_nodes: Vec::new(),\n nodes_info: Vec::new(),\n execution_state: Vec::new(),\n context: LogicContext::default(),\n }\n }\n}\n\nimpl LogicData {\n pub fn context(&self) -> &LogicContext {\n &self.context\n }\n pub fn context_mut(&mut self) -> &mut LogicContext {\n &mut self.context\n }\n pub fn is_initialized(&self) -> bool {\n !self.execution_state.is_empty()\n }\n pub fn init(&mut self) {\n let nodes = self.tree.nodes();\n nodes.iter().enumerate().for_each(|(node_index, n)| {\n if !n.node().has_input::<LogicExecution>() && n.node().has_output::<LogicExecution>() {\n self.active_nodes.push(LinkInfo {\n node: node_index,\n pin: PinId::invalid(),\n });\n }\n let mut node_info = NodeInfo::default();\n \n n.node().inputs().iter().for_each(|(id, _)| {\n let mut pin_info = PinInfo {\n id: id.clone(),\n ..Default::default()\n };\n let links = self.tree.get_links_to_pin(n.name(), id.name());\n links.iter().for_each(|l| {\n if let Some(from_node_index) = self.tree.find_node_index(l.from_node()) {\n if let Some((from_pin_id, _)) = nodes[from_node_index]\n .node()\n .outputs()\n .iter()\n .find(|(id, _)| id.name() == l.from_pin())\n {\n let link_info = LinkInfo {\n node: from_node_index,\n pin: from_pin_id.clone(),\n };\n pin_info.links.push(link_info);\n } else {\n eprintln!(\n \"Unable to find output pin {} of node {}\",\n l.from_pin(),\n nodes[from_node_index].name()\n );\n }\n }\n });\n node_info.inputs.push(pin_info);\n });\n \n n.node().outputs().iter().for_each(|(id, _)| {\n let mut pin_info = PinInfo {\n id: id.clone(),\n ..Default::default()\n };\n let links = self.tree.get_links_from_pin(n.name(), id.name());\n links.iter().for_each(|l| {\n if let Some(to_node_index) = self.tree.find_node_index(l.to_node()) {\n if let Some((to_pin_id, _)) = nodes[to_node_index]\n .node()\n .inputs()\n .iter()\n .find(|(id, _)| id.name() == l.to_pin())\n {\n let link_info = LinkInfo {\n node: to_node_index,\n pin: to_pin_id.clone(),\n };\n pin_info.links.push(link_info);\n } else {\n eprintln!(\n \"Unable to find input pin {} of node {}\",\n l.to_pin(),\n nodes[to_node_index].name()\n );\n }\n }\n });\n node_info.outputs.push(pin_info);\n });\n\n self.nodes_info.push(node_info);\n });\n self.execution_state.resize(nodes.len(), NodeState::Active);\n }\n\n pub fn execute(&mut self) {\n self.execute_active_nodes(self.active_nodes.clone());\n }\n\n fn execute_active_nodes(&mut self, mut nodes_to_execute: Vec<LinkInfo>) {\n if nodes_to_execute.is_empty() {\n return;\n }\n let mut new_nodes = Vec::new();\n nodes_to_execute.iter().for_each(|l| {\n let mut nodes = Self::execute_node(\n &mut self.tree,\n &self.context,\n l,\n &self.nodes_info,\n &mut self.execution_state,\n );\n new_nodes.append(&mut nodes);\n });\n nodes_to_execute.retain(|link_info| {\n let node_state = &self.execution_state[link_info.node];\n match node_state {\n NodeState::Active => true,\n NodeState::Running(_) => {\n if !self.active_nodes.contains(link_info) {\n self.active_nodes.push(link_info.clone());\n }\n false\n }\n NodeState::Executed(_) => false,\n }\n });\n new_nodes.iter().for_each(|l| {\n if self.execution_state[l.node] == NodeState::Active && !nodes_to_execute.contains(l) {\n nodes_to_execute.push(l.clone());\n }\n });\n self.active_nodes.retain(|l| {\n self.tree.nodes()[l.node].execytion_type() != NodeExecutionType::OneShot\n || self.tree.nodes()[l.node].execytion_type() == NodeExecutionType::Continuous\n });\n self.execute_active_nodes(nodes_to_execute);\n }\n\n fn execute_node(\n tree: &mut NodeTree,\n context: &LogicContext,\n link_info: &LinkInfo,\n nodes_info: &[NodeInfo],\n execution_state: &mut [NodeState],\n ) -> Vec<LinkInfo> {\n let mut new_nodes_to_execute = Vec::new();\n\n let info = &nodes_info[link_info.node];\n info.inputs.iter().for_each(|pin_info| {\n let node = tree.nodes_mut()[link_info.node].node();\n if node.is_input::<LogicExecution>(&pin_info.id) {\n return;\n }\n pin_info.links.iter().for_each(|l| {\n if execution_state[l.node] == NodeState::Active {\n let mut nodes =\n Self::execute_node(tree, context, l, nodes_info, execution_state);\n new_nodes_to_execute.append(&mut nodes);\n }\n\n let nodes = tree.nodes_mut();\n let (from_node, to_node) = if l.node < link_info.node {\n let (start, end) = nodes.split_at_mut(link_info.node);\n (start[l.node].node(), end[0].node_mut())\n } else {\n let (start, end) = nodes.split_at_mut(l.node);\n (end[0].node(), start[link_info.node].node_mut())\n };\n if let Some(input) = to_node.inputs_mut().get_mut(&pin_info.id) {\n input.copy_from(from_node, &l.pin);\n }\n });\n });\n let node = &mut tree.nodes_mut()[link_info.node];\n execution_state[link_info.node] = node.execute(&link_info.pin, context);\n\n match &execution_state[link_info.node] {\n NodeState::Executed(output_pins) | NodeState::Running(output_pins) => {\n if let Some(pins) = output_pins {\n pins.iter().for_each(|pin_id| {\n info.outputs.iter().for_each(|o| {\n if pin_id == &o.id {\n o.links.iter().for_each(|link_info| {\n new_nodes_to_execute.push(link_info.clone());\n });\n }\n });\n });\n }\n }\n _ => {}\n }\n\n new_nodes_to_execute\n }\n}\n"},"prefix":{"kind":"string","value":"use sabi_serialize::{Deserialize, Serialize, SerializeFile};\n\nuse crate::{LogicContext, LogicExecution, NodeExecutionType, NodeState, NodeTree, PinId};\n\n#[derive(Default, PartialEq, Eq, Hash, Clone)]\nstruct LinkInfo {\n node: usize,\n pin: PinId,\n}\n#[derive(Default, Clone)]\nstruct PinInfo {\n id: PinId,\n links: Vec<LinkInfo>,\n}\n#[derive(Default, Clone)]\nstruct NodeInfo {\n inputs: Vec<PinInfo>,\n outputs: Vec<PinInfo>,\n}\n\n#[derive(Default, Serialize, Deserialize, Clone)]\n#[serde(crate = \"sabi_serialize\")]\npub struct LogicData {\n #[serde(flatten)]\n tree: NodeTree,\n #[serde(skip)]\n active_nodes: Vec<LinkInfo>,\n #[serde(skip)]\n nodes_info: Vec<NodeInfo>,\n #[serde(skip)]\n execution_state: Vec<NodeState>,\n #[serde(skip)]\n context: LogicContext,\n}\n\nimpl SerializeFile for LogicData {\n fn extension() -> &'static str {\n \"logic\"\n }\n}\n\nimpl From<NodeTree> for LogicData {\n fn from(tree: NodeTree) -> Self {\n Self {\n tree,\n active_nodes: Vec::new(),\n nodes_info: Vec::new(),\n execution_state: Vec::new(),\n context: LogicContext::default(),\n }\n }\n}\n\nimpl LogicData {\n pub fn context(&self) -> &LogicContext {\n &self.context\n }\n pub fn context_mut(&mut self) -> &mut LogicContext {\n &mut self.context\n }\n pub fn is_initialized(&self) -> bool {\n !self.execution_state.is_empty()\n }\n pub fn init(&mut self) {\n let nodes = self.tree.nodes();\n nodes.iter().enumerate().for_each(|(node_index, n)| {\n if !n.node().has_input::<LogicExecution>() && n.node().has_output::<LogicExecution>() {\n self.active_nodes.push(LinkInfo {\n node: node_index,\n pin: PinId::invalid(),\n });\n }\n let mut node_info = NodeInfo::default();\n \n n.node().inputs().iter().for_each(|(id, _)| {\n let mut pin_info = PinInfo {\n id: id.clone(),\n ..Default::default()\n };\n let links = self.tree.get_links_to_pin(n.name(), id.name());\n links.iter().for_each(|l| {\n if let Some(from_node_index) = self.tree.find_node_index(l.from_node()) {\n if let Some((from_pin_id, _)) = nodes[from_node_index]\n .node()\n .outputs()\n .iter()\n .find(|(id, _)| id.name() == l.from_pin())\n {\n let link_info = LinkInfo {\n node: from_node_index,\n pin: from_pin_id.clone(),\n };\n pin_info.links.push(link_info);\n } else {\n eprintln!(\n \"Unable to find output pin {} of node {}\",\n l.from_pin(),\n nodes[from_node_index].name()\n );\n }\n }\n });\n node_info.inputs.push(pin_info);\n });\n \n n.node().outputs().iter().for_each(|(id, _)| {\n let mut pin_info = PinInfo {\n id: id.clone(),\n ..Default::default()\n };\n let links = self.tree.get_links_from_pin(n.name(), id.name());\n links.iter().for_each(|l| {\n if let Some(to_node_index) = self.tree.find_node_index(l.to_node()) {\n if let Some((to_pin_id, _)) = nodes[to_node_index]\n .node()\n .inputs()\n .iter()\n .find(|(id, _)| id.name() == l.to_pin())\n {\n let link_info = LinkInfo {\n node: to_node_index,\n pin: to_pin_id.clone(),\n };\n pin_info.links.push(link_info);\n } else {\n eprintln!(\n \"Unable to find input pin {} of node {}\",\n l.to_pin(),\n nodes[to_node_index].name()\n );\n }\n }\n });\n node_info.outputs.push(pin_info);\n });\n\n self.nodes_info.push(node_info);\n });\n self.execution_state.resize(nodes.len(), NodeState::Active);\n }\n\n pub fn execute(&mut self) {\n self.execute_active_nodes(self.active_nodes.clone());\n }\n\n fn execute_active_nodes(&mut self, mut nodes_to_execute: Vec<LinkInfo>) {\n if nodes_to_execute.is_empty() {\n return;\n }\n let mut new_nodes = Vec::new();\n nodes_to_execute.iter().for_each(|l| {\n let mut nodes = Self::execute_node(\n &mut self.tree,\n &self.context,\n l,\n &self.nodes_info,\n &mut self.execution_state,\n );\n new_nodes.append(&mut nodes);\n });\n nodes_to_execute.retain(|link_info| {\n let node_state = &self.execution_state[link_info.node];\n match node_state {\n NodeState::Active => true,\n NodeState::Running(_) => {\n if !self.active_nodes.contains(link_info) {\n self.active_nodes.push(link_info.clone());\n }\n false\n }\n NodeState::Executed(_) => false,\n }\n });\n new_nodes.iter().for_each(|l| {\n if self.execution_state[l.node] == NodeState::Active && !nodes_to_execute.contains(l) {\n nodes_to_execute.push(l.clone());\n }\n });\n self.active_nodes.retain(|l| {\n self.tree.nodes()[l.node].execytion_type() != NodeExecutionType::OneShot\n || self.tree.nodes()[l.node].execytion_type() == NodeExecutionType::Continuous\n });\n self.execute_active_nodes(nodes_to_execute);\n }\n\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"fn execute_node(\n tree: &mut NodeTree,\n context: &LogicContext,\n link_info: &LinkInfo,\n nodes_info: &[NodeInfo],\n execution_state: &mut [NodeState],\n ) -> Vec<LinkInfo> {\n let mut new_nodes_to_execute = Vec::new();\n\n let info = &nodes_info[link_info.node];\n info.inputs.iter().for_each(|pin_info| {\n let node = tree.nodes_mut()[link_info.node].node();\n if node.is_input::<LogicExecution>(&pin_info.id) {\n return;\n }\n pin_info.links.iter().for_each(|l| {\n if execution_state[l.node] == NodeState::Active {\n let mut nodes =\n Self::execute_node(tree, context, l, nodes_info, execution_state);\n new_nodes_to_execute.append(&mut nodes);\n }\n\n let nodes = tree.nodes_mut();\n let (from_node, to_node) = if l.node < link_info.node {\n let (start, end) = nodes.split_at_mut(link_info.node);\n (start[l.node].node(), end[0].node_mut())\n } else {\n let (start, end) = nodes.split_at_mut(l.node);\n (end[0].node(), start[link_info.node].node_mut())\n };\n if let Some(input) = to_node.inputs_mut().get_mut(&pin_info.id) {\n input.copy_from(from_node, &l.pin);\n }\n });\n });\n let node = &mut tree.nodes_mut()[link_info.node];\n execution_state[link_info.node] = node.execute(&link_info.pin, context);\n\n match &execution_state[link_info.node] {\n NodeState::Executed(output_pins) | NodeState::Running(output_pins) => {\n if let Some(pins) = output_pins {\n pins.iter().for_each(|pin_id| {\n info.outputs.iter().for_each(|o| {\n if pin_id == &o.id {\n o.links.iter().for_each(|link_info| {\n new_nodes_to_execute.push(link_info.clone());\n });\n }\n });\n });\n }\n }\n _ => {}\n }\n\n new_nodes_to_execute\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1992,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"components/resource_metering/src/recorder/cpu.rs"},"repo_name":{"kind":"string","value":"lroolle/tikv"},"commit":{"kind":"string","value":"f3f02d7fc6cf7e94abcf8cdb9b9ff52b110a72ba"},"file_code":{"kind":"string","value":"\n\nuse crate::localstorage::LocalStorage;\nuse crate::recorder::SubRecorder;\nuse crate::utils;\nuse crate::utils::Stat;\nuse crate::{RawRecord, RawRecords, SharedTagPtr};\n\nuse collections::HashMap;\nuse fail::fail_point;\nuse lazy_static::lazy_static;\n\nlazy_static! {\n static ref STAT_TASK_COUNT: prometheus::IntCounter = prometheus::register_int_counter!(\n \"tikv_req_cpu_stat_task_count\",\n \"Counter of stat_task call\"\n )\n .unwrap();\n}\n\n#[derive(Default)]\npub struct CpuRecorder {\n thread_stats: HashMap<usize, ThreadStat>,\n}\n\nimpl SubRecorder for CpuRecorder {\n fn tick(&mut self, records: &mut RawRecords, _: &mut HashMap<usize, LocalStorage>) {\n let records = &mut records.records;\n self.thread_stats.iter_mut().for_each(|(tid, thread_stat)| {\n let cur_tag = thread_stat.shared_ptr.take_clone();\n fail_point!(\n \"cpu-record-test-filter\",\n cur_tag.as_ref().map_or(false, |t| !t\n .infos\n .extra_attachment\n .starts_with(crate::TEST_TAG_PREFIX)),\n |_| {}\n );\n if let Some(cur_tag) = cur_tag {\n if let Ok(cur_stat) = utils::stat_task(utils::process_id(), *tid) {\n STAT_TASK_COUNT.inc();\n let last_stat = &thread_stat.stat;\n let last_cpu_tick = last_stat.utime.wrapping_add(last_stat.stime);\n let cur_cpu_tick = cur_stat.utime.wrapping_add(cur_stat.stime);\n let delta_ticks = cur_cpu_tick.wrapping_sub(last_cpu_tick);\n if delta_ticks > 0 {\n let delta_ms = delta_ticks * 1_000 / utils::clock_tick();\n let record = records.entry(cur_tag).or_insert_with(RawRecord::default);\n record.cpu_time += delta_ms as u32;\n }\n thread_stat.stat = cur_stat;\n }\n }\n });\n }\n\n fn cleanup(&mut self) {\n const THREAD_STAT_LEN_THRESHOLD: usize = 500;\n\n if self.thread_stats.capacity() > THREAD_STAT_LEN_THRESHOLD\n && self.thread_stats.len() < THREAD_STAT_LEN_THRESHOLD / 2\n {\n self.thread_stats.shrink_to(THREAD_STAT_LEN_THRESHOLD);\n }\n }\n\n fn reset(&mut self) {\n for (thread_id, stat) in &mut self.thread_stats {\n stat.stat = utils::stat_task(utils::process_id(), *thread_id).unwrap_or_default();\n }\n }\n\n fn thread_created(&mut self, id: usize, shared_ptr: SharedTagPtr) {\n self.thread_stats.insert(\n id,\n ThreadStat {\n shared_ptr,\n stat: Stat::default(),\n },\n );\n }\n}\n\nstruct ThreadStat {\n shared_ptr: SharedTagPtr,\n stat: Stat,\n}\n\n#[cfg(test)]\n#[cfg(not(target_os = \"linux\"))]\nmod tests {\n use super::*;\n\n #[test]\n fn test_record() {\n let mut recorder = CpuRecorder::default();\n let mut records = RawRecords::default();\n recorder.tick(&mut records, &mut HashMap::default());\n assert!(records.records.is_empty());\n }\n}\n\n#[cfg(test)]\n#[cfg(target_os = \"linux\")]\nmod tests {\n use super::*;\n use crate::{utils, RawRecords, TagInfos};\n use std::sync::atomic::AtomicPtr;\n use std::sync::Arc;\n\n fn heavy_job() -> u64 {\n let m: u64 = rand::random();\n let n: u64 = rand::random();\n let m = m ^ n;\n let n = m.wrapping_mul(n);\n let m = m.wrapping_add(n);\n let n = m & n;\n let m = m | n;\n m.wrapping_sub(n)\n }\n\n #[test]\n fn test_record() {\n let info = Arc::new(TagInfos {\n store_id: 0,\n region_id: 0,\n peer_id: 0,\n extra_attachment: b\"abc\".to_vec(),\n });\n let shared_ptr = SharedTagPtr {\n ptr: Arc::new(AtomicPtr::new(Arc::into_raw(info) as _)),\n };\n let mut recorder = CpuRecorder::default();\n recorder.thread_created(utils::thread_id(), shared_ptr);\n let thread_id = utils::thread_id();\n let prev_stat = &recorder.thread_stats.get(&thread_id).unwrap().stat;\n let prev_cpu_ticks = prev_stat.utime.wrapping_add(prev_stat.stime);\n loop {\n let stat = utils::stat_task(utils::process_id(), thread_id).unwrap();\n let cpu_ticks = stat.utime.wrapping_add(stat.stime);\n let delta_ms = cpu_ticks.wrapping_sub(prev_cpu_ticks) * 1_000 / utils::clock_tick();\n if delta_ms != 0 {\n break;\n }\n heavy_job();\n }\n let mut records = RawRecords::default();\n recorder.tick(&mut records, &mut HashMap::default());\n assert!(!records.records.is_empty());\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::localstorage::LocalStorage;\nuse crate::recorder::SubRecorder;\nuse crate::utils;\nuse crate::utils::Stat;\nuse crate::{RawRecord, RawRecords, SharedTagPtr};\n\nuse collections::HashMap;\nuse fail::fail_point;\nuse lazy_static::lazy_static;\n\nlazy_static! {\n static ref STAT_TASK_COUNT: prometheus::IntCounter = prometheus::register_int_counter!(\n \"tikv_req_cpu_stat_task_count\",\n \"Counter of stat_task call\"\n )\n .unwrap();\n}\n\n#[derive(Default)]\npub struct CpuRecorder {\n thread_stats: HashMap<usize, ThreadStat>,\n}\n\nimpl SubRecorder for CpuRecorder {\n fn tick(&mut self, records: &mut RawRecords, _: &mut HashMap<usize, LocalStorage>) {\n let records = &mut records.records;\n self.thread_stats.iter_mut().for_each(|(tid, thread_stat)| {\n let cur_tag = thread_stat.shared_ptr.take_clone();\n fail_point!(\n \"cpu-record-test-filter\",\n cur_tag.as_ref().map_or(false, |t| !t\n .infos\n .extra_attachment\n .starts_with(crate::TEST_TAG_PREFIX)),\n |_| {}\n );\n if let Some(cur_tag) = cur_tag {\n if let Ok(cur_stat) = utils::stat_task(utils::process_id(), *tid) {\n STAT_TASK_COUNT.inc();\n let last_stat = &thread_stat.stat;\n let last_cpu_tick = last_stat.utime.wrapping_add(last_stat.stime);\n let cur_cpu_tick = cur_stat.utime.wrapping_add(cur_stat.stime);\n let delta_ticks = cur_cpu_tick.wrapping_sub(last_cpu_tick);\n if delta_ticks > 0 {\n let delta_ms = delta_ticks * 1_000 / utils::clock_tick();\n let record = records.entry(cur_tag).or_insert_with(RawRecord::default);\n record.cpu_time += delta_ms as u32;\n }\n thread_stat.stat = cur_stat;\n }\n }\n });\n }\n\n fn cleanup(&mut self) {\n const THREAD_STAT_LEN_THRESHOLD: usize = 500;\n\n if self.thread_stats.capacity() > THREAD_STAT_LEN_THRESHOLD\n && self.thread_stats.len() < THREAD_STAT_LEN_THRESHOLD / 2\n {\n self.thread_stats.shrink_to(THREAD_STAT_LEN_THRESHOLD);\n }\n }\n\n fn reset(&mut self) {\n for (thread_id, stat) in &mut self.thread_stats {\n stat.stat = utils::stat_task(utils::process_id(), *thread_id).unwrap_or_default();\n }\n }\n\n fn thread_created(&mut self, id: usize, shared_ptr: SharedTagPtr) {\n self.thread_stats.insert(\n id,\n ThreadStat {\n shared_ptr,\n stat: Stat::default(),\n },\n );\n }\n}\n\nstruct ThreadStat {\n shared_ptr: SharedTagPtr,\n stat: Stat,\n}\n\n#[cfg(test)]\n#[cfg(not(target_os = \"linux\"))]\nmod tests {\n use super::*;\n\n #[test]\n fn test_record() {\n let mut recorder = CpuRecorder::default();\n let mut records = RawRecords::default();\n recorder.tick(&mut records, &mut HashMap::default());\n assert!(records.records.is_empty());\n }\n}\n\n#[cfg(test)]\n#[cfg(target_os = \"linux\")]\nmod tests {\n use super::*;\n use crate::{utils, RawRecords, TagInfos};\n use std::sync::atomic::AtomicPtr;\n use std::sync::Arc;\n\n "},"suffix":{"kind":"string","value":"\n\n #[test]\n fn test_record() {\n let info = Arc::new(TagInfos {\n store_id: 0,\n region_id: 0,\n peer_id: 0,\n extra_attachment: b\"abc\".to_vec(),\n });\n let shared_ptr = SharedTagPtr {\n ptr: Arc::new(AtomicPtr::new(Arc::into_raw(info) as _)),\n };\n let mut recorder = CpuRecorder::default();\n recorder.thread_created(utils::thread_id(), shared_ptr);\n let thread_id = utils::thread_id();\n let prev_stat = &recorder.thread_stats.get(&thread_id).unwrap().stat;\n let prev_cpu_ticks = prev_stat.utime.wrapping_add(prev_stat.stime);\n loop {\n let stat = utils::stat_task(utils::process_id(), thread_id).unwrap();\n let cpu_ticks = stat.utime.wrapping_add(stat.stime);\n let delta_ms = cpu_ticks.wrapping_sub(prev_cpu_ticks) * 1_000 / utils::clock_tick();\n if delta_ms != 0 {\n break;\n }\n heavy_job();\n }\n let mut records = RawRecords::default();\n recorder.tick(&mut records, &mut HashMap::default());\n assert!(!records.records.is_empty());\n }\n}\n"},"middle":{"kind":"string","value":"fn heavy_job() -> u64 {\n let m: u64 = rand::random();\n let n: u64 = rand::random();\n let m = m ^ n;\n let n = m.wrapping_mul(n);\n let m = m.wrapping_add(n);\n let n = m & n;\n let m = m | n;\n m.wrapping_sub(n)\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[cfg(target_os = \"linux\")]\n\npub fn stat_task(pid: usize, tid: usize) -> std::io::Result<Stat> {\n\n procinfo::pid::stat_task(pid as _, tid as _).map(Into::into)\n\n}\n\n\n\n/// Get the [Stat] of the thread (tid) in the process (pid).\n","file_path":"components/resource_metering/src/utils.rs","rank":0,"score":414871.6945349161},{"content":"#[cfg(not(target_os = \"linux\"))]\n\npub fn stat_task(_pid: usize, _tid: usize) -> std::io::Result<Stat> {\n\n Ok(Stat::default())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_thread_id() {\n\n let id = thread_id();\n\n assert_ne!(id, 0);\n\n std::thread::spawn(move || {\n\n // Two threads should have different ids.\n\n assert_ne!(thread_id(), id);\n\n })\n\n .join()\n\n .unwrap();\n\n }\n\n\n\n #[test]\n\n #[cfg(target_os = \"linux\")]\n\n fn test_thread_ids() {\n\n let ids = thread_ids();\n\n assert!(ids.is_some());\n\n assert!(!ids.unwrap().is_empty());\n\n }\n\n}\n","file_path":"components/resource_metering/src/utils.rs","rank":1,"score":383275.06008354435},{"content":"#[bench]\n\nfn _bench_check_requirement(_: &mut test::Bencher) {\n\n tikv_util::config::check_max_open_fds(4096).unwrap();\n\n}\n","file_path":"tests/benches/misc/mod.rs","rank":2,"score":381817.39426935423},{"content":"/// Connects std tests and custom test framework.\n\npub fn run_test_with_hook(cases: &[&TestDescAndFn], hook: impl TestHook + Send + Clone + 'static) {\n\n crate::setup_for_ci();\n\n let cases: Vec<_> = cases\n\n .iter()\n\n .map(|case| {\n\n let name = case.desc.name.as_slice().to_owned();\n\n let h = hook.clone();\n\n let f = match case.testfn {\n\n TestFn::StaticTestFn(f) => TestFn::DynTestFn(Box::new(move || {\n\n let _watcher = CaseLifeWatcher::new(name, h);\n\n f();\n\n })),\n\n TestFn::StaticBenchFn(f) => TestFn::DynTestFn(Box::new(move || {\n\n let _watcher = CaseLifeWatcher::new(name, h);\n\n bench::run_once(move |b| f(b));\n\n })),\n\n ref f => panic!(\"unexpected testfn {:?}\", f),\n\n };\n\n TestDescAndFn {\n\n desc: case.desc.clone(),\n\n testfn: f,\n\n }\n\n })\n\n .collect();\n\n let args = env::args().collect::<Vec<_>>();\n\n test_main(&args, cases, None)\n\n}\n\n\n\nthread_local!(static FS: RefCell<Option<fail::FailScenario<'static>>> = RefCell::new(None));\n\n\n","file_path":"components/test_util/src/runner.rs","rank":3,"score":377697.2278800625},{"content":"#[inline]\n\npub fn decode_u32(data: &mut BytesSlice<'_>) -> Result<u32> {\n\n read_num_bytes(mem::size_of::<u32>(), data, BigEndian::read_u32)\n\n}\n\n\n\n/// Decodes value encoded by `encode_u16` before.\n","file_path":"components/tikv_util/src/codec/number.rs","rank":4,"score":370661.96942442015},{"content":"#[inline]\n\npub fn decode_u32_le(data: &mut BytesSlice<'_>) -> Result<u32> {\n\n read_num_bytes(mem::size_of::<u32>(), data, LittleEndian::read_u32)\n\n}\n\n\n\n/// Decodes value encoded by `encode_i32_le` before.\n","file_path":"components/tikv_util/src/codec/number.rs","rank":5,"score":366728.13739186624},{"content":"#[cfg(not(target_os = \"linux\"))]\n\npub fn thread_id() -> usize {\n\n thread_id::get()\n\n}\n\n\n\n/// Get all thread id collections under the current process.\n","file_path":"components/resource_metering/src/utils.rs","rank":6,"score":346418.995189075},{"content":"/// Gets the value of `TIKV_BENCH_LEVEL`. The larger value it is, the more comprehensive benchmarks\n\n/// will be.\n\npub fn bench_level() -> usize {\n\n if let Ok(s) = std::env::var(\"TIKV_BENCH_LEVEL\") {\n\n s.parse::<usize>().unwrap()\n\n } else {\n\n 0\n\n }\n\n}\n\n\n","file_path":"tests/benches/coprocessor_executors/util/mod.rs","rank":7,"score":346011.7767523279},{"content":"/// A simple helper function to build the DAG handler.\n\npub fn build_dag_handler<TargetTxnStore: TxnStore + 'static>(\n\n executors: &[PbExecutor],\n\n ranges: &[KeyRange],\n\n store: &Store<RocksEngine>,\n\n) -> Box<dyn RequestHandler> {\n\n use tipb::DagRequest;\n\n\n\n let mut dag = DagRequest::default();\n\n dag.set_executors(executors.to_vec().into());\n\n\n\n tikv::coprocessor::dag::DagHandlerBuilder::new(\n\n black_box(dag),\n\n black_box(ranges.to_vec()),\n\n black_box(ToTxnStore::<TargetTxnStore>::to_store(store)),\n\n tikv_util::deadline::Deadline::from_now(std::time::Duration::from_secs(10)),\n\n 64,\n\n false,\n\n false,\n\n )\n\n .build()\n","file_path":"tests/benches/coprocessor_executors/util/mod.rs","rank":8,"score":343306.37623683567},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![];\n\n\n\n let mut rows_options = vec![5000];\n\n if crate::util::bench_level() >= 1 {\n\n rows_options.push(5);\n\n }\n\n if crate::util::bench_level() >= 2 {\n\n rows_options.push(1);\n\n }\n\n let bencher_options: Vec<Box<dyn util::TopNBencher<M>>> = vec![Box::new(util::BatchBencher)];\n\n\n\n for rows in &rows_options {\n\n for bencher in &bencher_options {\n\n inputs.push(Input {\n\n src_rows: *rows,\n\n bencher: bencher.box_clone(),\n","file_path":"tests/benches/coprocessor_executors/top_n/mod.rs","rank":9,"score":341143.2192473582},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![];\n\n\n\n let mut rows_options = vec![5000];\n\n if crate::util::bench_level() >= 1 {\n\n rows_options.push(5);\n\n }\n\n if crate::util::bench_level() >= 2 {\n\n rows_options.push(1);\n\n }\n\n let bencher_options: Vec<Box<dyn util::SelectionBencher<M>>> =\n\n vec![Box::new(util::BatchBencher)];\n\n\n\n for rows in &rows_options {\n\n for bencher in &bencher_options {\n\n inputs.push(Input {\n\n src_rows: *rows,\n","file_path":"tests/benches/coprocessor_executors/selection/mod.rs","rank":10,"score":341143.21924735815},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![];\n\n\n\n let mut rows_options = vec![5000];\n\n if crate::util::bench_level() >= 1 {\n\n rows_options.push(5);\n\n }\n\n if crate::util::bench_level() >= 2 {\n\n rows_options.push(1);\n\n }\n\n let mut bencher_options: Vec<Box<dyn util::IntegratedBencher<M>>> = vec![\n\n Box::new(util::DAGBencher::<RocksStore>::new(false)),\n\n Box::new(util::DAGBencher::<RocksStore>::new(true)),\n\n ];\n\n if crate::util::bench_level() >= 2 {\n\n let mut additional_inputs: Vec<Box<dyn util::IntegratedBencher<M>>> = vec\n\nfn write_log_msg(decorator: &mut dyn RecordDecorator, record: &Record<'_>) -> io::Result<()> {\n\n decorator.start_whitespace()?;\n\n write!(decorator, \" \")?;\n\n\n\n decorator.start_msg()?;\n\n write!(decorator, \"[\")?;\n\n let msg = format!(\"{}\", record.msg());\n\n formatter::write_escaped_str(decorator, &msg)?;\n\n write!(decorator, \"]\")?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"components/tikv_util/src/logger/mod.rs","rank":12,"score":336663.288518501},{"content":"/// Writes log header to decorator. See [log-header](https://github.com/tikv/rfcs/blob/master/text/2018-12-19-unified-log-format.md#log-header-section)\n\nfn write_log_header(decorator: &mut dyn RecordDecorator, record: &Record<'_>) -> io::Result<()> {\n\n decorator.start_timestamp()?;\n\n write!(\n\n decorator,\n\n \"[{}]\",\n\n chrono::Local::now().format(TIMESTAMP_FORMAT)\n\n )?;\n\n\n\n decorator.start_whitespace()?;\n\n write!(decorator, \" \")?;\n\n\n\n decorator.start_level()?;\n\n write!(decorator, \"[{}]\", get_unified_log_level(record.level()))?;\n\n\n\n decorator.start_whitespace()?;\n\n write!(decorator, \" \")?;\n\n\n\n // Writes source file info.\n\n decorator.start_msg()?; // There is no `start_file()` or `start_line()`.\n\n if let Some(path) = Path::new(record.file())\n","file_path":"components/tikv_util/src/logger/mod.rs","rank":13,"score":336663.288518501},{"content":"#[bench]\n\nfn bench_async_write(b: &mut test::Bencher) {\n\n let leader = util::new_peer(2, 3);\n\n let mut region = Region::default();\n\n region.set_id(1);\n\n region.set_start_key(vec![]);\n\n region.set_end_key(vec![]);\n\n region.mut_peers().push(leader.clone());\n\n region.mut_region_epoch().set_version(2);\n\n region.mut_region_epoch().set_conf_ver(5);\n\n let (_tmp, db) = new_engine();\n\n let kv = RaftKv::new(\n\n SyncBenchRouter::new(region.clone(), db.clone()),\n\n RocksEngine::from_db(db),\n\n );\n\n\n\n let mut ctx = Context::default();\n\n ctx.set_region_id(region.get_id());\n\n ctx.set_region_epoch(region.get_region_epoch().clone());\n\n ctx.set_peer(leader);\n\n b.iter(|| {\n","file_path":"tests/benches/misc/raftkv/mod.rs","rank":14,"score":336079.1372280927},{"content":"#[bench]\n\nfn bench_async_snapshot(b: &mut test::Bencher) {\n\n let leader = util::new_peer(2, 3);\n\n let mut region = Region::default();\n\n region.set_id(1);\n\n region.set_start_key(vec![]);\n\n region.set_end_key(vec![]);\n\n region.mut_peers().push(leader.clone());\n\n region.mut_region_epoch().set_version(2);\n\n region.mut_region_epoch().set_conf_ver(5);\n\n let (_tmp, db) = new_engine();\n\n let kv = RaftKv::new(\n\n SyncBenchRouter::new(region.clone(), db.clone()),\n\n RocksEngine::from_db(db),\n\n );\n\n\n\n let mut ctx = Context::default();\n\n ctx.set_region_id(region.get_id());\n\n ctx.set_region_epoch(region.get_region_epoch().clone());\n\n ctx.set_peer(leader);\n\n b.iter(|| {\n","file_path":"tests/benches/misc/raftkv/mod.rs","rank":15,"score":336079.1372280927},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![\n\n Input::new(util::BatchTableScanNext1024Bencher::<MemStore>::new()),\n\n Input::new(util::TableScanDAGBencher::<RocksStore>::new(false, ROWS)),\n\n Input::new(util::TableScanDAGBencher::<RocksStore>::new(true, ROWS)),\n\n ];\n\n if crate::util::bench_level() >= 2 {\n\n let mut additional_inputs = vec![\n\n Input::new(util::BatchTableScanNext1024Bencher::<RocksStore>::new()),\n\n Input::new(util::TableScanDAGBencher::<MemStore>::new(false, ROWS)),\n\n Input::new(util::TableScanDAGBencher::<MemStore>::new(true, ROWS)),\n\n ];\n\n inputs.append(&mut additional_inputs);\n\n }\n\n\n\n let mut cases = vec![\n\n BenchCase::new(\"table_scan_primary_key\", bench_table_scan_primary_key),\n","file_path":"tests/benches/coprocessor_executors/table_scan/mod.rs","rank":16,"score":335682.1449879195},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![];\n\n\n\n let mut rows_options = vec![5000];\n\n if crate::util::bench_level() >= 1 {\n\n rows_options.push(5);\n\n }\n\n if crate::util::bench_level() >= 2 {\n\n rows_options.push(1);\n\n }\n\n let bencher_options: Vec<Box<dyn util::HashAggrBencher<M>>> =\n\n vec![Box::new(util::BatchBencher)];\n\n\n\n for rows in &rows_options {\n\n for bencher in &bencher_options {\n\n inputs.push(Input {\n\n src_rows: *rows,\n","file_path":"tests/benches/coprocessor_executors/hash_aggr/mod.rs","rank":17,"score":335682.1449879195},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![\n\n Input::new(util::BatchIndexScanNext1024Bencher::<MemStore>::new()),\n\n Input::new(util::IndexScanDAGBencher::<RocksStore>::new(false, ROWS)),\n\n Input::new(util::IndexScanDAGBencher::<RocksStore>::new(true, ROWS)),\n\n ];\n\n if crate::util::bench_level() >= 2 {\n\n let mut additional_inputs = vec![\n\n Input::new(util::BatchIndexScanNext1024Bencher::<RocksStore>::new()),\n\n Input::new(util::IndexScanDAGBencher::<MemStore>::new(false, ROWS)),\n\n Input::new(util::IndexScanDAGBencher::<MemStore>::new(true, ROWS)),\n\n ];\n\n inputs.append(&mut additional_inputs);\n\n }\n\n\n\n let mut cases = vec![\n\n BenchCase::new(\"index_scan_primary_key\", bench_index_scan_primary_key),\n","file_path":"tests/benches/coprocessor_executors/index_scan/mod.rs","rank":18,"score":335682.1449879195},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![];\n\n\n\n let mut rows_options = vec![5000];\n\n if crate::util::bench_level() >= 1 {\n\n rows_options.push(5);\n\n }\n\n if crate::util::bench_level() >= 2 {\n\n rows_options.push(1);\n\n }\n\n let bencher_options: Vec<Box<dyn util::StreamAggrBencher<M>>> =\n\n vec![Box::new(util::BatchBencher)];\n\n\n\n for rows in &rows_options {\n\n for bencher in &bencher_options {\n\n inputs.push(Input {\n\n src_rows: *rows,\n","file_path":"tests/benches/coprocessor_executors/stream_aggr/mod.rs","rank":19,"score":335682.1449879195},{"content":"pub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n let mut inputs = vec![];\n\n\n\n let mut rows_options = vec![5000];\n\n if crate::util::bench_level() >= 1 {\n\n rows_options.push(5);\n\n }\n\n if crate::util::bench_level() >= 2 {\n\n rows_options.push(1);\n\n }\n\n let bencher_options: Vec<Box<dyn util::SimpleAggrBencher<M>>> =\n\n vec![Box::new(util::BatchBencher)];\n\n\n\n for rows in &rows_options {\n\n for bencher in &bencher_options {\n\n inputs.push(Input {\n\n src_rows: *rows,\n","file_path":"tests/benches/coprocessor_executors/simple_aggr/mod.rs","rank":20,"score":335682.1449879195},{"content":"pub fn test_rollback() {\n\n let (cluster, client, ctx) = must_new_and_configure_cluster_and_kv_client(|cluster| {\n\n cluster.cfg.raft_store.pd_store_heartbeat_tick_interval = ReadableDuration::millis(50);\n\n });\n\n let key = b\"key2\".to_vec();\n\n let store_id = 1;\n\n put(&cluster, &client, &ctx, store_id, key.clone());\n\n let start_ts = block_on(cluster.pd_client.get_tso()).unwrap();\n\n\n\n let mut rollback_req = BatchRollbackRequest::default();\n\n rollback_req.set_context(ctx.clone());\n\n rollback_req.start_version = start_ts.into_inner();\n\n rollback_req.set_keys(vec![key].into_iter().collect());\n\n let rollback_resp = client.kv_batch_rollback(&rollback_req).unwrap();\n\n assert!(\n\n !rollback_resp.has_region_error(),\n\n \"{:?}\",\n\n rollback_resp.get_region_error()\n\n );\n\n assert!(\n","file_path":"tests/integrations/raftstore/test_stats.rs","rank":21,"score":332228.2368281018},{"content":"#[bench]\n\nfn bench_async_snapshots_noop(b: &mut test::Bencher) {\n\n let (_dir, db) = new_engine();\n\n let snapshot = RocksSnapshot::new(Arc::clone(&db));\n\n let resp = ReadResponse {\n\n response: RaftCmdResponse::default(),\n\n snapshot: Some(RegionSnapshot::from_snapshot(\n\n Arc::new(snapshot),\n\n Arc::new(Region::default()),\n\n )),\n\n txn_extra_op: TxnExtraOp::Noop,\n\n };\n\n\n\n b.iter(|| {\n\n let cb1: EngineCallback<RegionSnapshot<RocksSnapshot>> = Box::new(\n\n move |(_, res): (CbContext, EngineResult<RegionSnapshot<RocksSnapshot>>)| {\n\n assert!(res.is_ok());\n\n },\n\n );\n\n let cb2: EngineCallback<CmdRes<RocksSnapshot>> = Box::new(\n\n move |(ctx, res): (CbContext, EngineResult<CmdRes<RocksSnapshot>>)| {\n","file_path":"tests/benches/misc/raftkv/mod.rs","rank":22,"score":331455.8732759777},{"content":"pub fn case_receiver_shutdown(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n test_suite.cfg_enabled(true);\n\n test_suite.cfg_max_resource_groups(5);\n\n test_suite.cfg_receiver_address(format!(\"127.0.0.1:{}\", port));\n\n\n\n // Workload\n\n // [req-{1..5} * 10, req-{6..10} * 1]\n\n let mut wl = iter::repeat(1..=5)\n\n .take(10)\n\n .flatten()\n\n .chain(6..=10)\n\n .map(|n| format!(\"req-{}\", n))\n\n .collect::<Vec<_>>();\n\n wl.shuffle(&mut rand::thread_rng());\n\n test_suite.setup_workload(wl);\n\n\n\n // | Receiver Alive |\n","file_path":"tests/integrations/resource_metering/test_receiver.rs","rank":23,"score":330150.3795590665},{"content":"pub fn case_precision(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n test_suite.cfg_report_receiver_interval(\"10s\");\n\n test_suite.cfg_enabled(true);\n\n test_suite.cfg_receiver_address(format!(\"127.0.0.1:{}\", port));\n\n\n\n // Workload\n\n // [req-1]\n\n test_suite.setup_workload(vec![\"req-1\"]);\n\n\n\n // | Precision |\n\n // | 1s |\n\n sleep(test_suite.get_current_cfg().report_receiver_interval.0 + ONE_SEC);\n\n let res = test_suite.fetch_reported_cpu_time();\n\n let (secs, _) = res.get(\"req-1\").unwrap();\n\n for (l, r) in secs.iter().zip({\n\n let mut next_secs = secs.iter();\n\n next_secs.next();\n","file_path":"tests/integrations/resource_metering/test_dynamic_config.rs","rank":24,"score":330150.3795590665},{"content":"pub fn case_receiver_blocking(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n test_suite.cfg_enabled(true);\n\n test_suite.cfg_max_resource_groups(5);\n\n test_suite.cfg_receiver_address(format!(\"127.0.0.1:{}\", port));\n\n\n\n // Workload\n\n // [req-{1..5} * 10, req-{6..10} * 1]\n\n let mut wl = iter::repeat(1..=5)\n\n .take(10)\n\n .flatten()\n\n .chain(6..=10)\n\n .map(|n| format!(\"req-{}\", n))\n\n .collect::<Vec<_>>();\n\n wl.shuffle(&mut rand::thread_rng());\n\n test_suite.setup_workload(wl);\n\n\n\n // | Block Receiver |\n","file_path":"tests/integrations/resource_metering/test_receiver.rs","rank":25,"score":330150.3795590665},{"content":"pub fn case_enable(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n\n\n // Workload\n\n // [req-1, req-2]\n\n test_suite.setup_workload(vec![\"req-1\", \"req-2\"]);\n\n\n\n // | Address | Enabled |\n\n // | x | o |\n\n test_suite.cfg_enabled(true);\n\n sleep(test_suite.get_current_cfg().report_receiver_interval.0 + ONE_SEC);\n\n assert!(test_suite.fetch_reported_cpu_time().is_empty());\n\n\n\n // Workload\n\n // []\n\n test_suite.cancel_workload();\n\n\n\n // | Address | Enabled |\n","file_path":"tests/integrations/resource_metering/test_dynamic_config.rs","rank":26,"score":330150.3795590665},{"content":"#[bench]\n\nfn bench_record_prefix_start_with(b: &mut Bencher) {\n\n let key: &[u8] = b\"_rabc\";\n\n b.iter(|| {\n\n let n = black_box(1000);\n\n (0..n).all(|_| black_box(key.starts_with(RECORD_PREFIX_SEP)))\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/coprocessor/codec/mod.rs","rank":27,"score":330060.16126065404},{"content":"fn test_region_info_accessor_impl(cluster: &mut Cluster<NodeCluster>, c: &RegionInfoAccessor) {\n\n for i in 0..9 {\n\n let k = format!(\"k{}\", i).into_bytes();\n\n let v = format!(\"v{}\", i).into_bytes();\n\n cluster.must_put(&k, &v);\n\n }\n\n\n\n let pd_client = Arc::clone(&cluster.pd_client);\n\n\n\n let init_regions = dump(c);\n\n check_region_ranges(&init_regions, &[(&b\"\"[..], &b\"\"[..])]);\n\n assert_eq!(init_regions[0].0, cluster.get_region(b\"k1\"));\n\n\n\n // Split\n\n {\n\n let r1 = cluster.get_region(b\"k1\");\n\n cluster.must_split(&r1, b\"k1\");\n\n let r2 = cluster.get_region(b\"k4\");\n\n cluster.must_split(&r2, b\"k4\");\n\n let r3 = cluster.get_region(b\"k2\");\n","file_path":"tests/integrations/raftstore/test_region_info_accessor.rs","rank":28,"score":328730.44684814196},{"content":"pub fn case_alter_receiver_addr(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n test_suite.cfg_enabled(true);\n\n test_suite.cfg_max_resource_groups(5);\n\n\n\n // Workload\n\n // [req-{1..5} * 10, req-{6..10} * 1]\n\n let mut wl = iter::repeat(1..=5)\n\n .take(10)\n\n .flatten()\n\n .chain(6..=10)\n\n .map(|n| format!(\"req-{}\", n))\n\n .collect::<Vec<_>>();\n\n wl.shuffle(&mut rand::thread_rng());\n\n test_suite.setup_workload(wl);\n\n\n\n // | Address | Enabled |\n\n // | x | o |\n","file_path":"tests/integrations/resource_metering/test_receiver.rs","rank":29,"score":326474.90077217575},{"content":"pub fn case_report_interval(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n test_suite.cfg_enabled(true);\n\n test_suite.cfg_receiver_address(format!(\"127.0.0.1:{}\", port));\n\n\n\n // Workload\n\n // [req-1, req-2]\n\n test_suite.setup_workload(vec![\"req-1\", \"req-2\"]);\n\n\n\n // | Report Interval |\n\n // | 15s |\n\n test_suite.cfg_report_receiver_interval(\"15s\");\n\n test_suite.flush_receiver();\n\n\n\n sleep(Duration::from_secs(5));\n\n assert!(test_suite.fetch_reported_cpu_time().is_empty());\n\n sleep(Duration::from_secs(5));\n\n assert!(test_suite.fetch_reported_cpu_time().is_empty());\n","file_path":"tests/integrations/resource_metering/test_dynamic_config.rs","rank":30,"score":326474.90077217575},{"content":"pub fn new_server_cluster(id: u64, count: usize) -> Cluster<ServerCluster> {\n\n let pd_client = Arc::new(TestPdClient::new(id, false));\n\n let sim = Arc::new(RwLock::new(ServerCluster::new(Arc::clone(&pd_client))));\n\n Cluster::new(id, count, sim, pd_client)\n\n}\n\n\n","file_path":"components/test_raftstore/src/server.rs","rank":31,"score":326460.49461396056},{"content":"pub fn new_node_cluster(id: u64, count: usize) -> Cluster<NodeCluster> {\n\n let pd_client = Arc::new(TestPdClient::new(id, false));\n\n let sim = Arc::new(RwLock::new(NodeCluster::new(Arc::clone(&pd_client))));\n\n Cluster::new(id, count, sim, pd_client)\n\n}\n\n\n","file_path":"components/test_raftstore/src/node.rs","rank":32,"score":326460.49461396056},{"content":"#[bench]\n\nfn bench_record_prefix_littleendian_check(b: &mut Bencher) {\n\n let key: &[u8] = b\"_rabc\";\n\n let prefix: u16 = LittleEndian::read_u16(RECORD_PREFIX_SEP);\n\n b.iter(|| {\n\n let n = black_box(1000);\n\n (0..n).all(|_| black_box(key.len() > 2 && LittleEndian::read_u16(key) == prefix))\n\n });\n\n}\n","file_path":"tests/benches/misc/coprocessor/codec/mod.rs","rank":33,"score":324335.4757464562},{"content":"#[bench]\n\nfn bench_record_prefix_equal_check(b: &mut Bencher) {\n\n let key: &[u8] = b\"_rabc\";\n\n b.iter(|| {\n\n let n = black_box(1000);\n\n (0..n).all(|_| {\n\n black_box(\n\n key.len() > 2 && key[0] == RECORD_PREFIX_SEP[0] && key[1] == RECORD_PREFIX_SEP[1],\n\n )\n\n })\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/coprocessor/codec/mod.rs","rank":34,"score":324335.4757464562},{"content":"#[bench]\n\nfn bench_record_prefix_bigendian_check(b: &mut Bencher) {\n\n let key: &[u8] = b\"_rabc\";\n\n let prefix: u16 = BigEndian::read_u16(RECORD_PREFIX_SEP);\n\n b.iter(|| {\n\n let n = black_box(1000);\n\n (0..n).all(|_| black_box(key.len() > 2 && BigEndian::read_u16(key) == prefix))\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/coprocessor/codec/mod.rs","rank":35,"score":324335.4757464562},{"content":"#[bench]\n\nfn bench_get_txn_commit_record_100(c: &mut test::Bencher) {\n\n bench_get_txn_commit_record(c, 100);\n\n}\n\n\n","file_path":"tests/benches/misc/storage/mvcc_reader.rs","rank":36,"score":323241.46433459676},{"content":"#[bench]\n\nfn bench_get_txn_commit_record_5(c: &mut test::Bencher) {\n\n bench_get_txn_commit_record(c, 5);\n\n}\n","file_path":"tests/benches/misc/storage/mvcc_reader.rs","rank":37,"score":323241.4643345968},{"content":"pub fn case_max_resource_groups(test_suite: &mut TestSuite) {\n\n test_suite.reset();\n\n let port = alloc_port();\n\n test_suite.start_receiver_at(port);\n\n test_suite.cfg_enabled(true);\n\n test_suite.cfg_receiver_address(format!(\"127.0.0.1:{}\", port));\n\n\n\n // Workload\n\n // [req-{1..3} * 10, req-{4..5} * 1]\n\n let mut wl = iter::repeat(1..=3)\n\n .take(10)\n\n .flatten()\n\n .chain(4..=5)\n\n .map(|n| format!(\"req-{}\", n))\n\n .collect::<Vec<_>>();\n\n wl.shuffle(&mut rand::thread_rng());\n\n test_suite.setup_workload(wl);\n\n\n\n // | Max Resource Groups |\n\n // | 5000 |\n","file_path":"tests/integrations/resource_metering/test_dynamic_config.rs","rank":38,"score":322937.2038631118},{"content":"type BenchFn<M, I> = Box<dyn Fn(&mut criterion::Bencher<M>, &I) + 'static>;\n\n\n","file_path":"tests/benches/coprocessor_executors/util/mod.rs","rank":39,"score":322321.54639155563},{"content":"pub fn init() {\n\n INIT.call_once(test_util::setup_for_ci);\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct ClientReceiver {\n\n receiver: Arc<Mutex<Option<ClientDuplexReceiver<ChangeDataEvent>>>>,\n\n}\n\n\n\nimpl ClientReceiver {\n\n pub fn replace(\n\n &self,\n\n rx: Option<ClientDuplexReceiver<ChangeDataEvent>>,\n\n ) -> Option<ClientDuplexReceiver<ChangeDataEvent>> {\n\n std::mem::replace(&mut *self.receiver.lock().unwrap(), rx)\n\n }\n\n}\n\n\n","file_path":"components/cdc/tests/mod.rs","rank":40,"score":321809.07625195873},{"content":"pub fn new_incompatible_node_cluster(id: u64, count: usize) -> Cluster<NodeCluster> {\n\n let pd_client = Arc::new(TestPdClient::new(id, true));\n\n let sim = Arc::new(RwLock::new(NodeCluster::new(Arc::clone(&pd_client))));\n\n Cluster::new(id, count, sim, pd_client)\n\n}\n","file_path":"components/test_raftstore/src/node.rs","rank":41,"score":321660.5211035974},{"content":"pub fn new_incompatible_server_cluster(id: u64, count: usize) -> Cluster<ServerCluster> {\n\n let pd_client = Arc::new(TestPdClient::new(id, true));\n\n let sim = Arc::new(RwLock::new(ServerCluster::new(Arc::clone(&pd_client))));\n\n Cluster::new(id, count, sim, pd_client)\n\n}\n\n\n","file_path":"components/test_raftstore/src/server.rs","rank":42,"score":321660.5211035974},{"content":"/// Creates a callback that is automatically called on drop if it's not called\n\n/// explicitly.\n\n///\n\n/// Note that leaking the callback can cause it to be never called but it\n\n/// rarely happens.\n\n///\n\n/// Also note that because `callback` and `arg_on_drop` may be called in the `drop`\n\n/// method, do not panic inside them or use `safe_panic` instead.\n\npub fn must_call<T: Send + 'static>(\n\n callback: impl FnOnce(T) + Send + 'static,\n\n arg_on_drop: impl FnOnce() -> T + Send + 'static,\n\n) -> Callback<T> {\n\n let mut must_call = MustCall {\n\n callback: Some(callback),\n\n arg_on_drop: Some(arg_on_drop),\n\n _phantom: PhantomData,\n\n };\n\n Box::new(move |arg: T| {\n\n let callback = must_call.callback.take().unwrap();\n\n callback(arg);\n\n })\n\n}\n\n\n\npub struct MustCall<T, C, A>\n\nwhere\n\n C: FnOnce(T),\n\n A: FnOnce() -> T,\n\n{\n","file_path":"components/tikv_util/src/callback.rs","rank":43,"score":320588.0573019332},{"content":"fn execute<M: criterion::measurement::Measurement + 'static>(c: &mut criterion::Criterion<M>) {\n\n util::fixture::bench(c);\n\n table_scan::bench(c);\n\n index_scan::bench(c);\n\n selection::bench(c);\n\n simple_aggr::bench(c);\n\n hash_aggr::bench(c);\n\n stream_aggr::bench(c);\n\n top_n::bench(c);\n\n integrated::bench(c);\n\n\n\n c.final_summary();\n\n}\n\n\n","file_path":"tests/benches/coprocessor_executors/mod.rs","rank":44,"score":319375.98837559967},{"content":"/// system_info collects system related information, e.g: kernel\n\npub fn system_info(collector: &mut Vec<ServerInfoItem>) {\n\n // sysctl\n\n let sysctl = get_sysctl_list();\n\n let mut pairs = vec![];\n\n for (key, val) in sysctl.into_iter() {\n\n let mut pair = ServerInfoPair::default();\n\n pair.set_key(key);\n\n pair.set_value(val);\n\n pairs.push(pair);\n\n }\n\n // Sort pairs by key to make result stable\n\n pairs.sort_by(|a, b| a.get_key().cmp(b.get_key()));\n\n let mut item = ServerInfoItem::default();\n\n item.set_tp(\"system\".to_string());\n\n item.set_name(\"sysctl\".to_string());\n\n item.set_pairs(pairs.into());\n\n collector.push(item);\n\n if let Some(item) = get_transparent_hugepage() {\n\n collector.push(item);\n\n }\n\n}\n\n\n","file_path":"src/server/service/diagnostics/sys.rs","rank":45,"score":316098.7753902153},{"content":"/// hardware_info collects CPU/Memory/Network/Disk hardware information\n\npub fn hardware_info(collector: &mut Vec<ServerInfoItem>) {\n\n cpu_hardware_info(collector);\n\n mem_hardware_info(collector);\n\n disk_hardware_info(collector);\n\n nic_hardware_info(collector);\n\n}\n\n\n","file_path":"src/server/service/diagnostics/sys.rs","rank":46,"score":316098.6401696672},{"content":"#[allow(dead_code)]\n\npub fn process_info(collector: &mut Vec<ServerInfoItem>) {\n\n let mut system = SYS_INFO.lock().unwrap();\n\n system.refresh_processes();\n\n let processes = system.get_processes();\n\n for (pid, p) in processes.iter() {\n\n if p.cmd().is_empty() {\n\n continue;\n\n }\n\n let mut pairs = vec![];\n\n let infos = vec![\n\n (\"executable\", format!(\"{:?}\", p.exe())),\n\n (\"cmd\", p.cmd().join(\" \")),\n\n (\"cwd\", format!(\"{:?}\", p.cwd())),\n\n (\"start-time\", p.start_time().to_string()),\n\n (\"memory\", p.memory().to_string()),\n\n (\"status\", p.status().to_string().to_owned()),\n\n (\"cpu-usage\", p.cpu_usage().to_string()),\n\n ];\n\n for (key, val) in infos.into_iter() {\n\n let mut pair = ServerInfoPair::default();\n","file_path":"src/server/service/diagnostics/sys.rs","rank":47,"score":316091.894835147},{"content":"pub fn init() {\n\n INIT.call_once(test_util::setup_for_ci);\n\n}\n\n\n\npub struct TestSuite {\n\n pub cluster: Cluster<ServerCluster>,\n\n pub endpoints: HashMap<u64, LazyWorker<Task<RocksSnapshot>>>,\n\n pub obs: HashMap<u64, Observer<RocksEngine>>,\n\n tikv_cli: HashMap<u64, TikvClient>,\n\n concurrency_managers: HashMap<u64, ConcurrencyManager>,\n\n\n\n env: Arc<Environment>,\n\n}\n\n\n\nimpl TestSuite {\n\n pub fn new(count: usize) -> Self {\n\n let mut cluster = new_server_cluster(1, count);\n\n // Increase the Raft tick interval to make this test case running reliably.\n\n configure_for_lease_read(&mut cluster, Some(100), None);\n\n Self::with_cluster(count, cluster)\n","file_path":"components/resolved_ts/tests/mod.rs","rank":48,"score":315656.5843919154},{"content":"#[rpn_fn(nullable, varg, min_args = 2, capture = [ctx])]\n\n#[inline]\n\npub fn least_time(mut ctx: &mut EvalContext, args: &[Option<BytesRef>]) -> Result<Option<Bytes>> {\n\n // Max datetime range defined at https://dev.mysql.com/doc/refman/8.0/en/datetime.html\n\n let mut least = Some(Time::parse_datetime(\n\n &mut ctx,\n\n \"9999-12-31 23:59:59\",\n\n 0,\n\n true,\n\n )?);\n\n for arg in args {\n\n match arg {\n\n Some(arg_val) => {\n\n let s = match str::from_utf8(arg_val) {\n\n Ok(s) => s,\n\n Err(err) => {\n\n return ctx\n\n .handle_invalid_time_error(Error::Encoding(err))\n\n .map(|_| Ok(None))?;\n\n }\n\n };\n\n match Time::parse_datetime(ctx, s, Time::parse_fsp(s), true) {\n","file_path":"components/tidb_query_expr/src/impl_compare.rs","rank":49,"score":314595.2569199774},{"content":"pub fn calc_data_crc32(data: &[u8]) -> u32 {\n\n let mut digest = crc32fast::Hasher::new();\n\n digest.update(data);\n\n digest.finalize()\n\n}\n\n\n","file_path":"components/test_sst_importer/src/lib.rs","rank":50,"score":310104.2533028495},{"content":"fn bench_writebatch_impl(b: &mut Bencher, batch_keys: usize) {\n\n let path = Builder::new()\n\n .prefix(\"/tmp/rocksdb_write_batch_bench\")\n\n .tempdir()\n\n .unwrap();\n\n let db = Arc::new(DB::open_default(path.path().to_str().unwrap()).unwrap());\n\n let key_count = 1 << 13;\n\n let round = key_count / batch_keys;\n\n b.iter(|| {\n\n writebatch(&db, round, batch_keys);\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/writebatch/bench_writebatch.rs","rank":51,"score":309953.5903375172},{"content":"#[allow(clippy::type_complexity)]\n\npub fn new_event_feed(\n\n client: &ChangeDataClient,\n\n) -> (\n\n ClientDuplexSender<ChangeDataRequest>,\n\n ClientReceiver,\n\n Box<dyn Fn(bool) -> ChangeDataEvent + Send>,\n\n) {\n\n let (req_tx, resp_rx) = client.event_feed().unwrap();\n\n let event_feed_wrap = Arc::new(Mutex::new(Some(resp_rx)));\n\n let event_feed_wrap_clone = event_feed_wrap.clone();\n\n\n\n let receive_event = move |keep_resolved_ts: bool| loop {\n\n let mut events;\n\n {\n\n let mut event_feed = event_feed_wrap_clone.lock().unwrap();\n\n events = event_feed.take();\n\n }\n\n let mut events_rx = if let Some(events_rx) = events.as_mut() {\n\n events_rx\n\n } else {\n","file_path":"components/cdc/tests/mod.rs","rank":52,"score":309821.91905239783},{"content":"/// `add` adds a and b and carry, stores the sum and new carry.\n\nfn add(a: u32, b: u32, carry: &mut u32, res: &mut u32) {\n\n let sum = a + b + *carry;\n\n if sum >= WORD_BASE {\n\n *res = sum - WORD_BASE;\n\n *carry = 1;\n\n } else {\n\n *res = sum;\n\n *carry = 0;\n\n }\n\n}\n\n\n","file_path":"components/tidb_query_datatype/src/codec/mysql/decimal.rs","rank":53,"score":308882.2735776366},{"content":"fn bench_get_txn_commit_record(b: &mut test::Bencher, n: u64) {\n\n let key = Key::from_raw(&table::encode_row_key(1, 0));\n\n let store = prepare_mvcc_data(&key, n);\n\n b.iter(|| {\n\n let mut mvcc_reader = SnapshotReader::new(\n\n 1.into(),\n\n store.get_engine().snapshot(Default::default()).unwrap(),\n\n true,\n\n );\n\n mvcc_reader\n\n .get_txn_commit_record(&key)\n\n .unwrap()\n\n .unwrap_single_record();\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/storage/mvcc_reader.rs","rank":54,"score":306859.9865887629},{"content":"/// Round each component.\n\n/// ```ignore\n\n/// let mut parts = [2019, 12, 1, 23, 59, 59, 1000000];\n\n/// round_components(&mut parts);\n\n/// assert_eq!([2019, 12, 2, 0, 0, 0, 0], parts);\n\n/// ```\n\n/// When year, month or day is zero, there can not have a carry.\n\n/// e.g.: `\"1998-11-00 23:59:59.999\" (fsp = 2, round = true)`, in `hms` it contains a carry,\n\n/// however, the `day` is 0, which is invalid in `MySQL`. When thoese cases encountered, return\n\n/// None.\n\nfn round_components(parts: &mut [u32]) -> Option<()> {\n\n debug_assert_eq!(parts.len(), 7);\n\n let modulus = [\n\n std::u32::MAX,\n\n 12,\n\n last_day_of_month(parts[0], parts[1]),\n\n // hms[.fraction]\n\n 24,\n\n 60,\n\n 60,\n\n 1_000_000,\n\n ];\n\n for i in (1..=6).rev() {\n\n let is_ymd = u32::from(i < 3);\n\n if parts[i] >= modulus[i] + is_ymd {\n\n parts[i] -= modulus[i];\n\n if i < 4 && parts[i - 1] == 0 || parts[i - 1] > modulus[i - 1] {\n\n return None;\n\n }\n\n parts[i - 1] += 1;\n\n }\n\n }\n\n Some(())\n\n}\n\n\n","file_path":"components/tidb_query_datatype/src/codec/mysql/time/mod.rs","rank":55,"score":303658.89264667383},{"content":"#[inline]\n\npub fn start(_name: impl AsRef<str>) -> bool {\n\n // Do nothing\n\n false\n\n}\n\n\n\n/// Stop profiling. Always returns false if `profiling` feature is not enabled.\n","file_path":"components/profiler/src/profiler_dummy.rs","rank":56,"score":303142.670867526},{"content":"#[inline]\n\npub fn start(name: impl AsRef<str>) -> bool {\n\n let mut profiler = ACTIVE_PROFILER.lock().unwrap();\n\n\n\n // Profiling in progress.\n\n if *profiler != Profiler::None {\n\n return false;\n\n }\n\n\n\n if valgrind_request::running_on_valgrind() != 0 {\n\n *profiler = Profiler::CallGrind;\n\n CallgrindClientRequest::start();\n\n } else {\n\n *profiler = Profiler::GPerfTools;\n\n gperftools::PROFILER\n\n .lock()\n\n .unwrap()\n\n .start(name.as_ref())\n\n .unwrap();\n\n }\n\n\n\n true\n\n}\n\n\n\n/// Stop profiling. Returns false if failed, i.e. there is no profiling in progress.\n\n///\n\n/// When `profiling` feature is not enabled, this function will do nothing and there is totally\n\n/// zero cost.\n","file_path":"components/profiler/src/profiler_unix.rs","rank":57,"score":303142.670867526},{"content":"#[inline]\n\npub fn read_slice<'a>(data: &mut BytesSlice<'a>, size: usize) -> Result<BytesSlice<'a>> {\n\n if data.len() >= size {\n\n let buf = &data[0..size];\n\n *data = &data[size..];\n\n Ok(buf)\n\n } else {\n\n Err(Error::unexpected_eof())\n\n }\n\n}\n\n\n\n#[derive(Debug, Error)]\n\npub enum Error {\n\n #[error(\"{0}\")]\n\n Io(#[from] io::Error),\n\n #[error(\"bad format key(length)\")]\n\n KeyLength,\n\n #[error(\"bad format key(padding)\")]\n\n KeyPadding,\n\n #[error(\"key not found\")]\n\n KeyNotFound,\n","file_path":"components/tikv_util/src/codec/mod.rs","rank":58,"score":300796.20176606777},{"content":"pub fn cpu_total(state: &pid::Stat) -> f64 {\n\n (state.utime + state.stime) as f64 / *CLK_TCK\n\n}\n\n\n","file_path":"components/tikv_util/src/metrics/threads_linux.rs","rank":59,"score":300381.2044091511},{"content":"pub fn offset_for_column(cols: &[ColumnInfo], col_id: i64) -> i64 {\n\n for (offset, column) in cols.iter().enumerate() {\n\n if column.get_column_id() == col_id {\n\n return offset as i64;\n\n }\n\n }\n\n 0_i64\n\n}\n","file_path":"components/test_coprocessor/src/util.rs","rank":60,"score":300016.5391853083},{"content":"#[cfg(not(target_os = \"linux\"))]\n\npub fn process_id() -> usize {\n\n std::process::id() as _\n\n}\n\n\n\n/// Gets the ID of the current thread.\n","file_path":"components/resource_metering/src/utils.rs","rank":61,"score":299944.5584556464},{"content":"// The `to_string()` function of `slog::Level` produces values like `erro` and `trce` instead of\n\n// the full words. This produces the full word.\n\npub fn get_string_by_level(lv: Level) -> &'static str {\n\n match lv {\n\n Level::Critical => \"critical\",\n\n Level::Error => \"error\",\n\n Level::Warning => \"warning\",\n\n Level::Debug => \"debug\",\n\n Level::Trace => \"trace\",\n\n Level::Info => \"info\",\n\n }\n\n}\n\n\n","file_path":"components/tikv_util/src/logger/mod.rs","rank":62,"score":299870.0178113303},{"content":"/// Gets the first encoded bytes' length in compactly encoded data.\n\n///\n\n/// Compact-encoding includes a VarInt encoded length prefix (1 ~ 9 bytes) and N bytes payload.\n\n/// This function gets the total bytes length of compact-encoded data, including the length prefix.\n\n///\n\n/// Note:\n\n/// - This function won't check whether the bytes are encoded correctly.\n\n/// - There can be multiple compact-encoded data, placed one by one. This function only returns\n\n/// the length of the first one.\n\npub fn encoded_compact_len(mut encoded: &[u8]) -> usize {\n\n let last_encoded = encoded.as_ptr() as usize;\n\n let total_len = encoded.len();\n\n let vn = match number::decode_var_i64(&mut encoded) {\n\n Ok(vn) => vn as usize,\n\n Err(e) => {\n\n debug!(\"failed to decode bytes' length: {:?}\", e);\n\n return total_len;\n\n }\n\n };\n\n vn + (encoded.as_ptr() as usize - last_encoded)\n\n}\n\n\n","file_path":"components/tikv_util/src/codec/bytes.rs","rank":63,"score":299737.448649558},{"content":"pub fn next_id() -> i64 {\n\n ID_GENERATOR.fetch_add(1, Ordering::Relaxed) as i64\n\n}\n\n\n","file_path":"components/test_coprocessor/src/util.rs","rank":64,"score":298754.2995382128},{"content":"#[rpn_fn(nullable, capture = [ctx])]\n\n#[inline]\n\npub fn password(ctx: &mut EvalContext, input: Option<BytesRef>) -> Result<Option<Bytes>> {\n\n ctx.warnings.append_warning(Error::Other(box_err!(\n\n \"Warning: Deprecated syntax PASSWORD\"\n\n )));\n\n match input {\n\n Some(bytes) => {\n\n if bytes.is_empty() {\n\n Ok(Some(Vec::new()))\n\n } else {\n\n let hash1 = hex_digest(MessageDigest::sha1(), bytes)?;\n\n let mut hash2 = hex_digest(MessageDigest::sha1(), hash1.as_slice())?;\n\n hash2.insert(0, b'*');\n\n Ok(Some(hash2))\n\n }\n\n }\n\n None => Ok(None),\n\n }\n\n}\n\n\n","file_path":"components/tidb_query_expr/src/impl_encryption.rs","rank":65,"score":295668.29397741146},{"content":"#[cfg(not(target_os = \"linux\"))]\n\npub fn record_global_memory_usage() {\n\n GLOBAL_MEMORY_USAGE.store(0, Ordering::Release);\n\n}\n\n\n","file_path":"components/tikv_util/src/sys/mod.rs","rank":66,"score":295142.77116024855},{"content":"fn test_simple_store_stats<T: Simulator>(cluster: &mut Cluster<T>) {\n\n let pd_client = Arc::clone(&cluster.pd_client);\n\n\n\n cluster.cfg.raft_store.pd_store_heartbeat_tick_interval = ReadableDuration::millis(20);\n\n cluster.run();\n\n\n\n // wait store reports stats.\n\n for _ in 0..100 {\n\n sleep_ms(20);\n\n\n\n if pd_client.get_store_stats(1).is_some() {\n\n break;\n\n }\n\n }\n\n\n\n let engine = cluster.get_engine(1);\n\n let raft_engine = cluster.get_raft_engine(1);\n\n raft_engine.flush(true).unwrap();\n\n engine.flush(true).unwrap();\n\n let last_stats = pd_client.get_store_stats(1).unwrap();\n","file_path":"tests/integrations/raftstore/test_stats.rs","rank":67,"score":294889.0152724751},{"content":"pub fn new_sst_meta(crc32: u32, length: u64) -> SstMeta {\n\n let mut m = SstMeta::default();\n\n m.set_uuid(Uuid::new_v4().as_bytes().to_vec());\n\n m.set_crc32(crc32);\n\n m.set_length(length);\n\n m\n\n}\n\n\n","file_path":"tests/integrations/import/util.rs","rank":68,"score":293572.27204507135},{"content":"/// `sub` subtracts rhs and carry from lhs, store the diff and new carry.\n\nfn sub(lhs: u32, rhs: u32, carry: &mut i32, res: &mut u32) {\n\n let diff = lhs as i32 - rhs as i32 - *carry;\n\n if diff < 0 {\n\n *carry = 1;\n\n *res = (diff + WORD_BASE as i32) as u32;\n\n } else {\n\n *carry = 0;\n\n *res = diff as u32;\n\n }\n\n}\n\n\n","file_path":"components/tidb_query_datatype/src/codec/mysql/decimal.rs","rank":69,"score":293305.8218927447},{"content":"/// `sub2` subtracts rhs and carry from lhs, stores the diff and new carry.\n\n/// the new carry may be 2.\n\nfn sub2(lhs: u32, rhs: u32, carry: &mut i32, res: &mut u32) {\n\n let mut diff = lhs as i32 - rhs as i32 - *carry;\n\n if diff < -(WORD_BASE as i32) {\n\n *carry = 2;\n\n diff += WORD_BASE as i32 + WORD_BASE as i32;\n\n } else if diff < 0 {\n\n *carry = 1;\n\n diff += WORD_BASE as i32;\n\n } else {\n\n *carry = 0;\n\n }\n\n *res = diff as u32;\n\n}\n\n\n","file_path":"components/tidb_query_datatype/src/codec/mysql/decimal.rs","rank":70,"score":293305.8218927447},{"content":"/// Checks whether our test utilities themselves are fast enough.\n\npub fn bench<M>(c: &mut criterion::Criterion<M>)\n\nwhere\n\n M: Measurement + 'static,\n\n{\n\n if crate::util::bench_level() >= 1 {\n\n c.bench_function(\n\n \"util_batch_fixture_executor_next_1024\",\n\n bench_util_batch_fixture_executor_next_1024::<M>,\n\n );\n\n }\n\n}\n","file_path":"tests/benches/coprocessor_executors/util/fixture.rs","rank":71,"score":292207.6011667974},{"content":"#[rpn_fn(nullable, capture = [ctx])]\n\n#[inline]\n\npub fn uncompressed_length(ctx: &mut EvalContext, arg: Option<BytesRef>) -> Result<Option<Int>> {\n\n use byteorder::{ByteOrder, LittleEndian};\n\n Ok(arg.as_ref().map(|s| {\n\n if s.is_empty() {\n\n 0\n\n } else if s.len() <= 4 {\n\n ctx.warnings.append_warning(Error::zlib_data_corrupted());\n\n 0\n\n } else {\n\n Int::from(LittleEndian::read_u32(&s[0..4]))\n\n }\n\n }))\n\n}\n\n\n","file_path":"components/tidb_query_expr/src/impl_encryption.rs","rank":72,"score":291579.91441567603},{"content":"#[rpn_fn(nullable, varg, min_args = 2, capture = [ctx])]\n\n#[inline]\n\npub fn greatest_time(ctx: &mut EvalContext, args: &[Option<BytesRef>]) -> Result<Option<Bytes>> {\n\n let mut greatest = None;\n\n for arg in args {\n\n match arg {\n\n Some(arg_val) => {\n\n let s = match str::from_utf8(arg_val) {\n\n Ok(s) => s,\n\n Err(err) => {\n\n return ctx\n\n .handle_invalid_time_error(Error::Encoding(err))\n\n .map(|_| Ok(None))?;\n\n }\n\n };\n\n match Time::parse_datetime(ctx, s, Time::parse_fsp(s), true) {\n\n Ok(t) => greatest = max(greatest, Some(t)),\n\n Err(_) => {\n\n return ctx\n\n .handle_invalid_time_error(Error::invalid_time_format(&s))\n\n .map(|_| Ok(None))?;\n\n }\n","file_path":"components/tidb_query_expr/src/impl_compare.rs","rank":73,"score":291579.70935657166},{"content":"pub fn memory_usage_reaches_high_water(usage: &mut u64) -> bool {\n\n fail_point!(\"memory_usage_reaches_high_water\", |_| true);\n\n *usage = get_global_memory_usage();\n\n *usage >= MEMORY_USAGE_HIGH_WATER.load(Ordering::Acquire)\n\n}\n\n\n","file_path":"components/tikv_util/src/sys/mod.rs","rank":74,"score":291094.1676107567},{"content":"fn create_file_info(id: u64, method: EncryptionMethod) -> FileInfo {\n\n FileInfo {\n\n key_id: id,\n\n method: compat(method),\n\n ..Default::default()\n\n }\n\n}\n","file_path":"tests/failpoints/cases/test_encryption.rs","rank":75,"score":291078.9968331639},{"content":"/// Calculates crc32 and decrypted size for a given reader.\n\npub fn calc_crc32_and_size<R: Read>(reader: &mut R) -> io::Result<(u32, u64)> {\n\n let mut digest = crc32fast::Hasher::new();\n\n let (mut buf, mut fsize) = (vec![0; DIGEST_BUFFER_SIZE], 0);\n\n loop {\n\n match reader.read(&mut buf[..]) {\n\n Ok(0) => {\n\n return Ok((digest.finalize(), fsize as u64));\n\n }\n\n Ok(n) => {\n\n digest.update(&buf[..n]);\n\n fsize += n;\n\n }\n\n Err(ref e) if e.kind() == ErrorKind::Interrupted => {}\n\n Err(err) => return Err(err),\n\n }\n\n }\n\n}\n\n\n","file_path":"components/file_system/src/lib.rs","rank":76,"score":290624.0277941283},{"content":"pub fn tls_collect_scan_details(cmd: &'static str, stats: &Statistics) {\n\n TLS_SCHED_METRICS.with(|m| {\n\n m.borrow_mut()\n\n .local_scan_details\n\n .entry(cmd)\n\n .or_insert_with(Default::default)\n\n .add(stats);\n\n });\n\n}\n\n\n","file_path":"src/storage/txn/sched_pool.rs","rank":77,"score":290378.6623965822},{"content":"pub fn find_peer_mut(region: &mut metapb::Region, store_id: u64) -> Option<&mut metapb::Peer> {\n\n region\n\n .mut_peers()\n\n .iter_mut()\n\n .find(|p| p.get_store_id() == store_id)\n\n}\n\n\n","file_path":"components/raftstore/src/store/util.rs","rank":78,"score":289317.0722964992},{"content":"/// `skip_n_datum_slices` skip `n` datum slices within `buf`\n\n/// and advances the buffer pointer.\n\n/// If the datum buffer contains less than `n` slices, an error will be returned.\n\npub fn skip_n(buf: &mut &[u8], n: usize) -> Result<()> {\n\n let origin = *buf;\n\n for i in 0..n {\n\n if buf.is_empty() {\n\n return Err(box_err!(\n\n \"The {}th slice are missing in the datum buffer: {}\",\n\n i,\n\n log_wrappers::Value::value(origin)\n\n ));\n\n }\n\n let (_, remaining) = split_datum(buf, false)?;\n\n *buf = remaining;\n\n }\n\n Ok(())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::codec::mysql::{Decimal, Duration, Time, MAX_FSP};\n","file_path":"components/tidb_query_datatype/src/codec/datum.rs","rank":79,"score":288885.04655769566},{"content":"pub fn bench_mvcc<E: Engine, F: EngineFactory<E>>(c: &mut Criterion, configs: &[BenchConfig<F>]) {\n\n let mut group = c.benchmark_group(\"mvcc\");\n\n for config in configs {\n\n group.bench_with_input(format!(\"prewrite/{:?}\", config), config, mvcc_prewrite);\n\n group.bench_with_input(format!(\"commit/{:?}\", config), config, mvcc_commit);\n\n group.bench_with_input(\n\n format!(\"rollback_prewrote/{:?}\", config),\n\n config,\n\n mvcc_rollback_prewrote,\n\n );\n\n group.bench_with_input(\n\n format!(\"rollback_conflict/{:?}\", config),\n\n config,\n\n mvcc_rollback_conflict,\n\n );\n\n group.bench_with_input(\n\n format!(\"rollback_non_prewrote/{:?}\", config),\n\n config,\n\n mvcc_rollback_non_prewrote,\n\n );\n","file_path":"tests/benches/hierarchy/mvcc/mod.rs","rank":80,"score":287944.7869017943},{"content":"pub fn bench_txn<E: Engine, F: EngineFactory<E>>(c: &mut Criterion, configs: &[BenchConfig<F>]) {\n\n let mut group = c.benchmark_group(\"txn\");\n\n for config in configs {\n\n group.bench_with_input(format!(\"prewrite/{:?}\", config), config, txn_prewrite);\n\n group.bench_with_input(format!(\"commit/{:?}\", config), config, txn_commit);\n\n group.bench_with_input(\n\n format!(\"rollback_prewrote/{:?}\", config),\n\n config,\n\n txn_rollback_prewrote,\n\n );\n\n group.bench_with_input(\n\n format!(\"rollback_conflict/{:?}\", config),\n\n config,\n\n txn_rollback_conflict,\n\n );\n\n group.bench_with_input(\n\n format!(\"rollback_non_prewrote/{:?}\", config),\n\n config,\n\n txn_rollback_non_prewrote,\n\n );\n\n }\n\n group.finish();\n\n}\n","file_path":"tests/benches/hierarchy/txn/mod.rs","rank":81,"score":287944.7869017943},{"content":"pub fn bench_engine<E: Engine, F: EngineFactory<E>>(c: &mut Criterion, configs: &[BenchConfig<F>]) {\n\n let mut group = c.benchmark_group(\"engine\");\n\n for config in configs {\n\n group.bench_with_input(\n\n format!(\"get(exclude snapshot)/{:?}\", config),\n\n config,\n\n bench_engine_get,\n\n );\n\n group.bench_with_input(format!(\"put/{:?}\", config), config, bench_engine_put);\n\n group.bench_with_input(\n\n format!(\"snapshot/{:?}\", config),\n\n config,\n\n bench_engine_snapshot,\n\n );\n\n }\n\n group.finish();\n\n}\n","file_path":"tests/benches/hierarchy/engine/mod.rs","rank":82,"score":287944.7869017943},{"content":"pub fn configure_for_merge<T: Simulator>(cluster: &mut Cluster<T>) {\n\n // Avoid log compaction which will prevent merge.\n\n cluster.cfg.raft_store.raft_log_gc_threshold = 1000;\n\n cluster.cfg.raft_store.raft_log_gc_count_limit = 1000;\n\n cluster.cfg.raft_store.raft_log_gc_size_limit = ReadableSize::mb(20);\n\n // Make merge check resume quickly.\n\n cluster.cfg.raft_store.merge_check_tick_interval = ReadableDuration::millis(100);\n\n // When isolated, follower relies on stale check tick to detect failure leader,\n\n // choose a smaller number to make it recover faster.\n\n cluster.cfg.raft_store.peer_stale_state_check_interval = ReadableDuration::millis(500);\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":83,"score":287834.2311538547},{"content":"pub fn configure_for_hibernate<T: Simulator>(cluster: &mut Cluster<T>) {\n\n // Uses long check interval to make leader keep sleeping during tests.\n\n cluster.cfg.raft_store.abnormal_leader_missing_duration = ReadableDuration::secs(20);\n\n cluster.cfg.raft_store.max_leader_missing_duration = ReadableDuration::secs(40);\n\n cluster.cfg.raft_store.peer_stale_state_check_interval = ReadableDuration::secs(10);\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":84,"score":287834.2311538547},{"content":"pub fn configure_for_encryption<T: Simulator>(cluster: &mut Cluster<T>) {\n\n let manifest_dir = Path::new(env!(\"CARGO_MANIFEST_DIR\"));\n\n let master_key_file = manifest_dir.join(\"src/master-key.data\");\n\n\n\n let cfg = &mut cluster.cfg.security.encryption;\n\n cfg.data_encryption_method = EncryptionMethod::Aes128Ctr;\n\n cfg.data_key_rotation_period = ReadableDuration(Duration::from_millis(100));\n\n cfg.master_key = MasterKeyConfig::File {\n\n config: FileConfig {\n\n path: master_key_file.to_str().unwrap().to_owned(),\n\n },\n\n }\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":85,"score":287834.2311538547},{"content":"pub fn configure_for_snapshot<T: Simulator>(cluster: &mut Cluster<T>) {\n\n // Truncate the log quickly so that we can force sending snapshot.\n\n cluster.cfg.raft_store.raft_log_gc_tick_interval = ReadableDuration::millis(20);\n\n cluster.cfg.raft_store.raft_log_gc_count_limit = 2;\n\n cluster.cfg.raft_store.merge_max_log_gap = 1;\n\n cluster.cfg.raft_store.snap_mgr_gc_tick_interval = ReadableDuration::millis(50);\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":86,"score":287834.2311538547},{"content":"fn counter_closure(counter: &Arc<AtomicUsize>) -> Message {\n\n let c = counter.clone();\n\n Message::Callback(Box::new(move |_: &Handler, _: &mut Runner| {\n\n c.fetch_add(1, Ordering::SeqCst);\n\n }))\n\n}\n\n\n","file_path":"components/batch-system/tests/cases/router.rs","rank":87,"score":287587.31382943527},{"content":"fn bench_dense_detect_with_cleanup(c: &mut Criterion) {\n\n let mut group = c.benchmark_group(\"bench_dense_detect_with_cleanup\");\n\n\n\n let ttls = vec![1, 3, 5, 10, 100, 500, 1_000, 3_000];\n\n for ttl in &ttls {\n\n let config = Config {\n\n n: 10,\n\n range: 1000,\n\n ttl: Duration::from_millis(*ttl),\n\n };\n\n group.bench_with_input(format!(\"{:?}\", &config), &config, bench_detect);\n\n }\n\n group.finish();\n\n}\n\n\n","file_path":"tests/benches/deadlock_detector/mod.rs","rank":88,"score":284280.445560234},{"content":"pub fn configure_for_request_snapshot<T: Simulator>(cluster: &mut Cluster<T>) {\n\n // We don't want to generate snapshots due to compact log.\n\n cluster.cfg.raft_store.raft_log_gc_threshold = 1000;\n\n cluster.cfg.raft_store.raft_log_gc_count_limit = 1000;\n\n cluster.cfg.raft_store.raft_log_gc_size_limit = ReadableSize::mb(20);\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":89,"score":283658.70272525965},{"content":"pub fn configure_for_transfer_leader<T: Simulator>(cluster: &mut Cluster<T>) {\n\n cluster.cfg.raft_store.raft_reject_transfer_leader_duration = ReadableDuration::secs(1);\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":90,"score":283658.70272525965},{"content":"pub fn configure_for_disable_titan<T: Simulator>(cluster: &mut Cluster<T>) {\n\n cluster.cfg.rocksdb.titan.enabled = false;\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":91,"score":283658.70272525965},{"content":"pub fn build_read_pool_for_test<E: Engine>(\n\n config: &CoprReadPoolConfig,\n\n engine: E,\n\n) -> Vec<FuturePool> {\n\n let configs: Vec<Config> = config.to_yatp_pool_configs();\n\n assert_eq!(configs.len(), 3);\n\n\n\n configs\n\n .into_iter()\n\n .map(|config| {\n\n let engine = Arc::new(Mutex::new(engine.clone()));\n\n YatpPoolBuilder::new(DefaultTicker::default())\n\n .config(config)\n\n .after_start(move || {\n\n set_tls_engine(engine.lock().unwrap().clone());\n\n set_io_type(IOType::ForegroundRead);\n\n })\n\n // Safety: we call `set_` and `destroy_` with the same engine type.\n\n .before_stop(|| unsafe { destroy_tls_engine::<E>() })\n\n .build_future_pool()\n\n })\n\n .collect()\n\n}\n","file_path":"src/coprocessor/readpool_impl.rs","rank":92,"score":282715.6320271391},{"content":"pub fn ignore_merge_target_integrity<T: Simulator>(cluster: &mut Cluster<T>) {\n\n cluster.cfg.raft_store.dev_assert = false;\n\n cluster.pd_client.ignore_merge_target_integrity();\n\n}\n\n\n","file_path":"components/test_raftstore/src/util.rs","rank":93,"score":279661.93639150594},{"content":"#[bench]\n\nfn bench_table_prefix_start_with(b: &mut Bencher) {\n\n let key: &[u8] = b\"tabc\";\n\n b.iter(|| {\n\n let n = black_box(1000);\n\n (0..n).all(|_| black_box(key.starts_with(TABLE_PREFIX)))\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/coprocessor/codec/mod.rs","rank":94,"score":279493.4647546955},{"content":"#[bench]\n\nfn bench_table_prefix_check(b: &mut Bencher) {\n\n let key: &[u8] = b\"tabc\";\n\n b.iter(|| {\n\n let n = black_box(1000);\n\n (0..n).all(|_| black_box(key.len() > 1 && key[0] == TABLE_PREFIX[0]))\n\n });\n\n}\n\n\n","file_path":"tests/benches/misc/coprocessor/codec/mod.rs","rank":95,"score":279493.4647546955},{"content":"fn bench_dense_detect_without_cleanup(c: &mut Criterion) {\n\n let mut group = c.benchmark_group(\"bench_dense_detect_without_cleanup\");\n\n\n\n let ranges = vec![\n\n 10,\n\n 100,\n\n 1_000,\n\n 10_000,\n\n 100_000,\n\n 1_000_000,\n\n 10_000_000,\n\n 100_000_000,\n\n ];\n\n for range in ranges {\n\n let config = Config {\n\n n: 10,\n\n range,\n\n ttl: Duration::from_secs(100000000),\n\n };\n\n group.bench_with_input(format!(\"{:?}\", &config), &config, bench_detect);\n\n }\n\n}\n\n\n","file_path":"tests/benches/deadlock_detector/mod.rs","rank":96,"score":279493.4647546955},{"content":"\n\n#[cfg(not(target_os = \"linux\"))]\n\npub use self::notlinux::{self_thread_inspector, Impl as ThreadInspectorImpl};\n\n\n\n#[cfg(target_os = \"linux\")]\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::io::Write;\n\n\n\n fn page_size() -> u64 {\n\n unsafe { libc::sysconf(libc::_SC_PAGE_SIZE) as u64 }\n\n }\n\n\n\n #[test]\n\n fn test_thread_inspector_io_stat() {\n\n let inspector = self_thread_inspector().unwrap();\n\n let io1 = inspector.io_stat().unwrap().unwrap();\n\n\n\n let mut f = tempfile::tempfile().unwrap();\n","file_path":"components/tikv_util/src/sys/inspector.rs","rank":97,"score":58.229628721758004},{"content":" pub fn set_remain(&mut self, remain: usize) {\n\n self.keep_remain = remain;\n\n }\n\n}\n\n\n\nimpl SoftLimitByCpu<RefCell<ThreadInfoStatistics>> {\n\n pub fn with_remain(remain: usize) -> Self {\n\n let total = SysQuota::cpu_cores_quota();\n\n let metrics = RefCell::new(ThreadInfoStatistics::new());\n\n Self {\n\n metrics,\n\n total_time: total,\n\n keep_remain: remain,\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod softlimit_test {\n\n use std::{\n","file_path":"components/backup/src/softlimit.rs","rank":98,"score":56.6264969602417}],"string":"[\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\npub fn stat_task(pid: usize, tid: usize) -> std::io::Result<Stat> {\\n\\n procinfo::pid::stat_task(pid as _, tid as _).map(Into::into)\\n\\n}\\n\\n\\n\\n/// Get the [Stat] of the thread (tid) in the process (pid).\\n\",\n \"file_path\": \"components/resource_metering/src/utils.rs\",\n \"rank\": 0,\n \"score\": 414871.6945349161\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub fn stat_task(_pid: usize, _tid: usize) -> std::io::Result<Stat> {\\n\\n Ok(Stat::default())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_thread_id() {\\n\\n let id = thread_id();\\n\\n assert_ne!(id, 0);\\n\\n std::thread::spawn(move || {\\n\\n // Two threads should have different ids.\\n\\n assert_ne!(thread_id(), id);\\n\\n })\\n\\n .join()\\n\\n .unwrap();\\n\\n }\\n\\n\\n\\n #[test]\\n\\n #[cfg(target_os = \\\"linux\\\")]\\n\\n fn test_thread_ids() {\\n\\n let ids = thread_ids();\\n\\n assert!(ids.is_some());\\n\\n assert!(!ids.unwrap().is_empty());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"components/resource_metering/src/utils.rs\",\n \"rank\": 1,\n \"score\": 383275.06008354435\n },\n {\n \"content\": \"#[bench]\\n\\nfn _bench_check_requirement(_: &mut test::Bencher) {\\n\\n tikv_util::config::check_max_open_fds(4096).unwrap();\\n\\n}\\n\",\n \"file_path\": \"tests/benches/misc/mod.rs\",\n \"rank\": 2,\n \"score\": 381817.39426935423\n },\n {\n \"content\": \"/// Connects std tests and custom test framework.\\n\\npub fn run_test_with_hook(cases: &[&TestDescAndFn], hook: impl TestHook + Send + Clone + 'static) {\\n\\n crate::setup_for_ci();\\n\\n let cases: Vec<_> = cases\\n\\n .iter()\\n\\n .map(|case| {\\n\\n let name = case.desc.name.as_slice().to_owned();\\n\\n let h = hook.clone();\\n\\n let f = match case.testfn {\\n\\n TestFn::StaticTestFn(f) => TestFn::DynTestFn(Box::new(move || {\\n\\n let _watcher = CaseLifeWatcher::new(name, h);\\n\\n f();\\n\\n })),\\n\\n TestFn::StaticBenchFn(f) => TestFn::DynTestFn(Box::new(move || {\\n\\n let _watcher = CaseLifeWatcher::new(name, h);\\n\\n bench::run_once(move |b| f(b));\\n\\n })),\\n\\n ref f => panic!(\\\"unexpected testfn {:?}\\\", f),\\n\\n };\\n\\n TestDescAndFn {\\n\\n desc: case.desc.clone(),\\n\\n testfn: f,\\n\\n }\\n\\n })\\n\\n .collect();\\n\\n let args = env::args().collect::<Vec<_>>();\\n\\n test_main(&args, cases, None)\\n\\n}\\n\\n\\n\\nthread_local!(static FS: RefCell<Option<fail::FailScenario<'static>>> = RefCell::new(None));\\n\\n\\n\",\n \"file_path\": \"components/test_util/src/runner.rs\",\n \"rank\": 3,\n \"score\": 377697.2278800625\n },\n {\n \"content\": \"#[inline]\\n\\npub fn decode_u32(data: &mut BytesSlice<'_>) -> Result<u32> {\\n\\n read_num_bytes(mem::size_of::<u32>(), data, BigEndian::read_u32)\\n\\n}\\n\\n\\n\\n/// Decodes value encoded by `encode_u16` before.\\n\",\n \"file_path\": \"components/tikv_util/src/codec/number.rs\",\n \"rank\": 4,\n \"score\": 370661.96942442015\n },\n {\n \"content\": \"#[inline]\\n\\npub fn decode_u32_le(data: &mut BytesSlice<'_>) -> Result<u32> {\\n\\n read_num_bytes(mem::size_of::<u32>(), data, LittleEndian::read_u32)\\n\\n}\\n\\n\\n\\n/// Decodes value encoded by `encode_i32_le` before.\\n\",\n \"file_path\": \"components/tikv_util/src/codec/number.rs\",\n \"rank\": 5,\n \"score\": 366728.13739186624\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub fn thread_id() -> usize {\\n\\n thread_id::get()\\n\\n}\\n\\n\\n\\n/// Get all thread id collections under the current process.\\n\",\n \"file_path\": \"components/resource_metering/src/utils.rs\",\n \"rank\": 6,\n \"score\": 346418.995189075\n },\n {\n \"content\": \"/// Gets the value of `TIKV_BENCH_LEVEL`. The larger value it is, the more comprehensive benchmarks\\n\\n/// will be.\\n\\npub fn bench_level() -> usize {\\n\\n if let Ok(s) = std::env::var(\\\"TIKV_BENCH_LEVEL\\\") {\\n\\n s.parse::<usize>().unwrap()\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/util/mod.rs\",\n \"rank\": 7,\n \"score\": 346011.7767523279\n },\n {\n \"content\": \"/// A simple helper function to build the DAG handler.\\n\\npub fn build_dag_handler<TargetTxnStore: TxnStore + 'static>(\\n\\n executors: &[PbExecutor],\\n\\n ranges: &[KeyRange],\\n\\n store: &Store<RocksEngine>,\\n\\n) -> Box<dyn RequestHandler> {\\n\\n use tipb::DagRequest;\\n\\n\\n\\n let mut dag = DagRequest::default();\\n\\n dag.set_executors(executors.to_vec().into());\\n\\n\\n\\n tikv::coprocessor::dag::DagHandlerBuilder::new(\\n\\n black_box(dag),\\n\\n black_box(ranges.to_vec()),\\n\\n black_box(ToTxnStore::<TargetTxnStore>::to_store(store)),\\n\\n tikv_util::deadline::Deadline::from_now(std::time::Duration::from_secs(10)),\\n\\n 64,\\n\\n false,\\n\\n false,\\n\\n )\\n\\n .build()\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/util/mod.rs\",\n \"rank\": 8,\n \"score\": 343306.37623683567\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![];\\n\\n\\n\\n let mut rows_options = vec![5000];\\n\\n if crate::util::bench_level() >= 1 {\\n\\n rows_options.push(5);\\n\\n }\\n\\n if crate::util::bench_level() >= 2 {\\n\\n rows_options.push(1);\\n\\n }\\n\\n let bencher_options: Vec<Box<dyn util::TopNBencher<M>>> = vec![Box::new(util::BatchBencher)];\\n\\n\\n\\n for rows in &rows_options {\\n\\n for bencher in &bencher_options {\\n\\n inputs.push(Input {\\n\\n src_rows: *rows,\\n\\n bencher: bencher.box_clone(),\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/top_n/mod.rs\",\n \"rank\": 9,\n \"score\": 341143.2192473582\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![];\\n\\n\\n\\n let mut rows_options = vec![5000];\\n\\n if crate::util::bench_level() >= 1 {\\n\\n rows_options.push(5);\\n\\n }\\n\\n if crate::util::bench_level() >= 2 {\\n\\n rows_options.push(1);\\n\\n }\\n\\n let bencher_options: Vec<Box<dyn util::SelectionBencher<M>>> =\\n\\n vec![Box::new(util::BatchBencher)];\\n\\n\\n\\n for rows in &rows_options {\\n\\n for bencher in &bencher_options {\\n\\n inputs.push(Input {\\n\\n src_rows: *rows,\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/selection/mod.rs\",\n \"rank\": 10,\n \"score\": 341143.21924735815\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![];\\n\\n\\n\\n let mut rows_options = vec![5000];\\n\\n if crate::util::bench_level() >= 1 {\\n\\n rows_options.push(5);\\n\\n }\\n\\n if crate::util::bench_level() >= 2 {\\n\\n rows_options.push(1);\\n\\n }\\n\\n let mut bencher_options: Vec<Box<dyn util::IntegratedBencher<M>>> = vec![\\n\\n Box::new(util::DAGBencher::<RocksStore>::new(false)),\\n\\n Box::new(util::DAGBencher::<RocksStore>::new(true)),\\n\\n ];\\n\\n if crate::util::bench_level() >= 2 {\\n\\n let mut additional_inputs: Vec<Box<dyn util::IntegratedBencher<M>>> = vec\\n\\nfn write_log_msg(decorator: &mut dyn RecordDecorator, record: &Record<'_>) -> io::Result<()> {\\n\\n decorator.start_whitespace()?;\\n\\n write!(decorator, \\\" \\\")?;\\n\\n\\n\\n decorator.start_msg()?;\\n\\n write!(decorator, \\\"[\\\")?;\\n\\n let msg = format!(\\\"{}\\\", record.msg());\\n\\n formatter::write_escaped_str(decorator, &msg)?;\\n\\n write!(decorator, \\\"]\\\")?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tikv_util/src/logger/mod.rs\",\n \"rank\": 12,\n \"score\": 336663.288518501\n },\n {\n \"content\": \"/// Writes log header to decorator. See [log-header](https://github.com/tikv/rfcs/blob/master/text/2018-12-19-unified-log-format.md#log-header-section)\\n\\nfn write_log_header(decorator: &mut dyn RecordDecorator, record: &Record<'_>) -> io::Result<()> {\\n\\n decorator.start_timestamp()?;\\n\\n write!(\\n\\n decorator,\\n\\n \\\"[{}]\\\",\\n\\n chrono::Local::now().format(TIMESTAMP_FORMAT)\\n\\n )?;\\n\\n\\n\\n decorator.start_whitespace()?;\\n\\n write!(decorator, \\\" \\\")?;\\n\\n\\n\\n decorator.start_level()?;\\n\\n write!(decorator, \\\"[{}]\\\", get_unified_log_level(record.level()))?;\\n\\n\\n\\n decorator.start_whitespace()?;\\n\\n write!(decorator, \\\" \\\")?;\\n\\n\\n\\n // Writes source file info.\\n\\n decorator.start_msg()?; // There is no `start_file()` or `start_line()`.\\n\\n if let Some(path) = Path::new(record.file())\\n\",\n \"file_path\": \"components/tikv_util/src/logger/mod.rs\",\n \"rank\": 13,\n \"score\": 336663.288518501\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_async_write(b: &mut test::Bencher) {\\n\\n let leader = util::new_peer(2, 3);\\n\\n let mut region = Region::default();\\n\\n region.set_id(1);\\n\\n region.set_start_key(vec![]);\\n\\n region.set_end_key(vec![]);\\n\\n region.mut_peers().push(leader.clone());\\n\\n region.mut_region_epoch().set_version(2);\\n\\n region.mut_region_epoch().set_conf_ver(5);\\n\\n let (_tmp, db) = new_engine();\\n\\n let kv = RaftKv::new(\\n\\n SyncBenchRouter::new(region.clone(), db.clone()),\\n\\n RocksEngine::from_db(db),\\n\\n );\\n\\n\\n\\n let mut ctx = Context::default();\\n\\n ctx.set_region_id(region.get_id());\\n\\n ctx.set_region_epoch(region.get_region_epoch().clone());\\n\\n ctx.set_peer(leader);\\n\\n b.iter(|| {\\n\",\n \"file_path\": \"tests/benches/misc/raftkv/mod.rs\",\n \"rank\": 14,\n \"score\": 336079.1372280927\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_async_snapshot(b: &mut test::Bencher) {\\n\\n let leader = util::new_peer(2, 3);\\n\\n let mut region = Region::default();\\n\\n region.set_id(1);\\n\\n region.set_start_key(vec![]);\\n\\n region.set_end_key(vec![]);\\n\\n region.mut_peers().push(leader.clone());\\n\\n region.mut_region_epoch().set_version(2);\\n\\n region.mut_region_epoch().set_conf_ver(5);\\n\\n let (_tmp, db) = new_engine();\\n\\n let kv = RaftKv::new(\\n\\n SyncBenchRouter::new(region.clone(), db.clone()),\\n\\n RocksEngine::from_db(db),\\n\\n );\\n\\n\\n\\n let mut ctx = Context::default();\\n\\n ctx.set_region_id(region.get_id());\\n\\n ctx.set_region_epoch(region.get_region_epoch().clone());\\n\\n ctx.set_peer(leader);\\n\\n b.iter(|| {\\n\",\n \"file_path\": \"tests/benches/misc/raftkv/mod.rs\",\n \"rank\": 15,\n \"score\": 336079.1372280927\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![\\n\\n Input::new(util::BatchTableScanNext1024Bencher::<MemStore>::new()),\\n\\n Input::new(util::TableScanDAGBencher::<RocksStore>::new(false, ROWS)),\\n\\n Input::new(util::TableScanDAGBencher::<RocksStore>::new(true, ROWS)),\\n\\n ];\\n\\n if crate::util::bench_level() >= 2 {\\n\\n let mut additional_inputs = vec![\\n\\n Input::new(util::BatchTableScanNext1024Bencher::<RocksStore>::new()),\\n\\n Input::new(util::TableScanDAGBencher::<MemStore>::new(false, ROWS)),\\n\\n Input::new(util::TableScanDAGBencher::<MemStore>::new(true, ROWS)),\\n\\n ];\\n\\n inputs.append(&mut additional_inputs);\\n\\n }\\n\\n\\n\\n let mut cases = vec![\\n\\n BenchCase::new(\\\"table_scan_primary_key\\\", bench_table_scan_primary_key),\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/table_scan/mod.rs\",\n \"rank\": 16,\n \"score\": 335682.1449879195\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![];\\n\\n\\n\\n let mut rows_options = vec![5000];\\n\\n if crate::util::bench_level() >= 1 {\\n\\n rows_options.push(5);\\n\\n }\\n\\n if crate::util::bench_level() >= 2 {\\n\\n rows_options.push(1);\\n\\n }\\n\\n let bencher_options: Vec<Box<dyn util::HashAggrBencher<M>>> =\\n\\n vec![Box::new(util::BatchBencher)];\\n\\n\\n\\n for rows in &rows_options {\\n\\n for bencher in &bencher_options {\\n\\n inputs.push(Input {\\n\\n src_rows: *rows,\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/hash_aggr/mod.rs\",\n \"rank\": 17,\n \"score\": 335682.1449879195\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![\\n\\n Input::new(util::BatchIndexScanNext1024Bencher::<MemStore>::new()),\\n\\n Input::new(util::IndexScanDAGBencher::<RocksStore>::new(false, ROWS)),\\n\\n Input::new(util::IndexScanDAGBencher::<RocksStore>::new(true, ROWS)),\\n\\n ];\\n\\n if crate::util::bench_level() >= 2 {\\n\\n let mut additional_inputs = vec![\\n\\n Input::new(util::BatchIndexScanNext1024Bencher::<RocksStore>::new()),\\n\\n Input::new(util::IndexScanDAGBencher::<MemStore>::new(false, ROWS)),\\n\\n Input::new(util::IndexScanDAGBencher::<MemStore>::new(true, ROWS)),\\n\\n ];\\n\\n inputs.append(&mut additional_inputs);\\n\\n }\\n\\n\\n\\n let mut cases = vec![\\n\\n BenchCase::new(\\\"index_scan_primary_key\\\", bench_index_scan_primary_key),\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/index_scan/mod.rs\",\n \"rank\": 18,\n \"score\": 335682.1449879195\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![];\\n\\n\\n\\n let mut rows_options = vec![5000];\\n\\n if crate::util::bench_level() >= 1 {\\n\\n rows_options.push(5);\\n\\n }\\n\\n if crate::util::bench_level() >= 2 {\\n\\n rows_options.push(1);\\n\\n }\\n\\n let bencher_options: Vec<Box<dyn util::StreamAggrBencher<M>>> =\\n\\n vec![Box::new(util::BatchBencher)];\\n\\n\\n\\n for rows in &rows_options {\\n\\n for bencher in &bencher_options {\\n\\n inputs.push(Input {\\n\\n src_rows: *rows,\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/stream_aggr/mod.rs\",\n \"rank\": 19,\n \"score\": 335682.1449879195\n },\n {\n \"content\": \"pub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n let mut inputs = vec![];\\n\\n\\n\\n let mut rows_options = vec![5000];\\n\\n if crate::util::bench_level() >= 1 {\\n\\n rows_options.push(5);\\n\\n }\\n\\n if crate::util::bench_level() >= 2 {\\n\\n rows_options.push(1);\\n\\n }\\n\\n let bencher_options: Vec<Box<dyn util::SimpleAggrBencher<M>>> =\\n\\n vec![Box::new(util::BatchBencher)];\\n\\n\\n\\n for rows in &rows_options {\\n\\n for bencher in &bencher_options {\\n\\n inputs.push(Input {\\n\\n src_rows: *rows,\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/simple_aggr/mod.rs\",\n \"rank\": 20,\n \"score\": 335682.1449879195\n },\n {\n \"content\": \"pub fn test_rollback() {\\n\\n let (cluster, client, ctx) = must_new_and_configure_cluster_and_kv_client(|cluster| {\\n\\n cluster.cfg.raft_store.pd_store_heartbeat_tick_interval = ReadableDuration::millis(50);\\n\\n });\\n\\n let key = b\\\"key2\\\".to_vec();\\n\\n let store_id = 1;\\n\\n put(&cluster, &client, &ctx, store_id, key.clone());\\n\\n let start_ts = block_on(cluster.pd_client.get_tso()).unwrap();\\n\\n\\n\\n let mut rollback_req = BatchRollbackRequest::default();\\n\\n rollback_req.set_context(ctx.clone());\\n\\n rollback_req.start_version = start_ts.into_inner();\\n\\n rollback_req.set_keys(vec![key].into_iter().collect());\\n\\n let rollback_resp = client.kv_batch_rollback(&rollback_req).unwrap();\\n\\n assert!(\\n\\n !rollback_resp.has_region_error(),\\n\\n \\\"{:?}\\\",\\n\\n rollback_resp.get_region_error()\\n\\n );\\n\\n assert!(\\n\",\n \"file_path\": \"tests/integrations/raftstore/test_stats.rs\",\n \"rank\": 21,\n \"score\": 332228.2368281018\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_async_snapshots_noop(b: &mut test::Bencher) {\\n\\n let (_dir, db) = new_engine();\\n\\n let snapshot = RocksSnapshot::new(Arc::clone(&db));\\n\\n let resp = ReadResponse {\\n\\n response: RaftCmdResponse::default(),\\n\\n snapshot: Some(RegionSnapshot::from_snapshot(\\n\\n Arc::new(snapshot),\\n\\n Arc::new(Region::default()),\\n\\n )),\\n\\n txn_extra_op: TxnExtraOp::Noop,\\n\\n };\\n\\n\\n\\n b.iter(|| {\\n\\n let cb1: EngineCallback<RegionSnapshot<RocksSnapshot>> = Box::new(\\n\\n move |(_, res): (CbContext, EngineResult<RegionSnapshot<RocksSnapshot>>)| {\\n\\n assert!(res.is_ok());\\n\\n },\\n\\n );\\n\\n let cb2: EngineCallback<CmdRes<RocksSnapshot>> = Box::new(\\n\\n move |(ctx, res): (CbContext, EngineResult<CmdRes<RocksSnapshot>>)| {\\n\",\n \"file_path\": \"tests/benches/misc/raftkv/mod.rs\",\n \"rank\": 22,\n \"score\": 331455.8732759777\n },\n {\n \"content\": \"pub fn case_receiver_shutdown(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n test_suite.cfg_enabled(true);\\n\\n test_suite.cfg_max_resource_groups(5);\\n\\n test_suite.cfg_receiver_address(format!(\\\"127.0.0.1:{}\\\", port));\\n\\n\\n\\n // Workload\\n\\n // [req-{1..5} * 10, req-{6..10} * 1]\\n\\n let mut wl = iter::repeat(1..=5)\\n\\n .take(10)\\n\\n .flatten()\\n\\n .chain(6..=10)\\n\\n .map(|n| format!(\\\"req-{}\\\", n))\\n\\n .collect::<Vec<_>>();\\n\\n wl.shuffle(&mut rand::thread_rng());\\n\\n test_suite.setup_workload(wl);\\n\\n\\n\\n // | Receiver Alive |\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_receiver.rs\",\n \"rank\": 23,\n \"score\": 330150.3795590665\n },\n {\n \"content\": \"pub fn case_precision(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n test_suite.cfg_report_receiver_interval(\\\"10s\\\");\\n\\n test_suite.cfg_enabled(true);\\n\\n test_suite.cfg_receiver_address(format!(\\\"127.0.0.1:{}\\\", port));\\n\\n\\n\\n // Workload\\n\\n // [req-1]\\n\\n test_suite.setup_workload(vec![\\\"req-1\\\"]);\\n\\n\\n\\n // | Precision |\\n\\n // | 1s |\\n\\n sleep(test_suite.get_current_cfg().report_receiver_interval.0 + ONE_SEC);\\n\\n let res = test_suite.fetch_reported_cpu_time();\\n\\n let (secs, _) = res.get(\\\"req-1\\\").unwrap();\\n\\n for (l, r) in secs.iter().zip({\\n\\n let mut next_secs = secs.iter();\\n\\n next_secs.next();\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_dynamic_config.rs\",\n \"rank\": 24,\n \"score\": 330150.3795590665\n },\n {\n \"content\": \"pub fn case_receiver_blocking(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n test_suite.cfg_enabled(true);\\n\\n test_suite.cfg_max_resource_groups(5);\\n\\n test_suite.cfg_receiver_address(format!(\\\"127.0.0.1:{}\\\", port));\\n\\n\\n\\n // Workload\\n\\n // [req-{1..5} * 10, req-{6..10} * 1]\\n\\n let mut wl = iter::repeat(1..=5)\\n\\n .take(10)\\n\\n .flatten()\\n\\n .chain(6..=10)\\n\\n .map(|n| format!(\\\"req-{}\\\", n))\\n\\n .collect::<Vec<_>>();\\n\\n wl.shuffle(&mut rand::thread_rng());\\n\\n test_suite.setup_workload(wl);\\n\\n\\n\\n // | Block Receiver |\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_receiver.rs\",\n \"rank\": 25,\n \"score\": 330150.3795590665\n },\n {\n \"content\": \"pub fn case_enable(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n\\n\\n // Workload\\n\\n // [req-1, req-2]\\n\\n test_suite.setup_workload(vec![\\\"req-1\\\", \\\"req-2\\\"]);\\n\\n\\n\\n // | Address | Enabled |\\n\\n // | x | o |\\n\\n test_suite.cfg_enabled(true);\\n\\n sleep(test_suite.get_current_cfg().report_receiver_interval.0 + ONE_SEC);\\n\\n assert!(test_suite.fetch_reported_cpu_time().is_empty());\\n\\n\\n\\n // Workload\\n\\n // []\\n\\n test_suite.cancel_workload();\\n\\n\\n\\n // | Address | Enabled |\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_dynamic_config.rs\",\n \"rank\": 26,\n \"score\": 330150.3795590665\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_record_prefix_start_with(b: &mut Bencher) {\\n\\n let key: &[u8] = b\\\"_rabc\\\";\\n\\n b.iter(|| {\\n\\n let n = black_box(1000);\\n\\n (0..n).all(|_| black_box(key.starts_with(RECORD_PREFIX_SEP)))\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/coprocessor/codec/mod.rs\",\n \"rank\": 27,\n \"score\": 330060.16126065404\n },\n {\n \"content\": \"fn test_region_info_accessor_impl(cluster: &mut Cluster<NodeCluster>, c: &RegionInfoAccessor) {\\n\\n for i in 0..9 {\\n\\n let k = format!(\\\"k{}\\\", i).into_bytes();\\n\\n let v = format!(\\\"v{}\\\", i).into_bytes();\\n\\n cluster.must_put(&k, &v);\\n\\n }\\n\\n\\n\\n let pd_client = Arc::clone(&cluster.pd_client);\\n\\n\\n\\n let init_regions = dump(c);\\n\\n check_region_ranges(&init_regions, &[(&b\\\"\\\"[..], &b\\\"\\\"[..])]);\\n\\n assert_eq!(init_regions[0].0, cluster.get_region(b\\\"k1\\\"));\\n\\n\\n\\n // Split\\n\\n {\\n\\n let r1 = cluster.get_region(b\\\"k1\\\");\\n\\n cluster.must_split(&r1, b\\\"k1\\\");\\n\\n let r2 = cluster.get_region(b\\\"k4\\\");\\n\\n cluster.must_split(&r2, b\\\"k4\\\");\\n\\n let r3 = cluster.get_region(b\\\"k2\\\");\\n\",\n \"file_path\": \"tests/integrations/raftstore/test_region_info_accessor.rs\",\n \"rank\": 28,\n \"score\": 328730.44684814196\n },\n {\n \"content\": \"pub fn case_alter_receiver_addr(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n test_suite.cfg_enabled(true);\\n\\n test_suite.cfg_max_resource_groups(5);\\n\\n\\n\\n // Workload\\n\\n // [req-{1..5} * 10, req-{6..10} * 1]\\n\\n let mut wl = iter::repeat(1..=5)\\n\\n .take(10)\\n\\n .flatten()\\n\\n .chain(6..=10)\\n\\n .map(|n| format!(\\\"req-{}\\\", n))\\n\\n .collect::<Vec<_>>();\\n\\n wl.shuffle(&mut rand::thread_rng());\\n\\n test_suite.setup_workload(wl);\\n\\n\\n\\n // | Address | Enabled |\\n\\n // | x | o |\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_receiver.rs\",\n \"rank\": 29,\n \"score\": 326474.90077217575\n },\n {\n \"content\": \"pub fn case_report_interval(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n test_suite.cfg_enabled(true);\\n\\n test_suite.cfg_receiver_address(format!(\\\"127.0.0.1:{}\\\", port));\\n\\n\\n\\n // Workload\\n\\n // [req-1, req-2]\\n\\n test_suite.setup_workload(vec![\\\"req-1\\\", \\\"req-2\\\"]);\\n\\n\\n\\n // | Report Interval |\\n\\n // | 15s |\\n\\n test_suite.cfg_report_receiver_interval(\\\"15s\\\");\\n\\n test_suite.flush_receiver();\\n\\n\\n\\n sleep(Duration::from_secs(5));\\n\\n assert!(test_suite.fetch_reported_cpu_time().is_empty());\\n\\n sleep(Duration::from_secs(5));\\n\\n assert!(test_suite.fetch_reported_cpu_time().is_empty());\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_dynamic_config.rs\",\n \"rank\": 30,\n \"score\": 326474.90077217575\n },\n {\n \"content\": \"pub fn new_server_cluster(id: u64, count: usize) -> Cluster<ServerCluster> {\\n\\n let pd_client = Arc::new(TestPdClient::new(id, false));\\n\\n let sim = Arc::new(RwLock::new(ServerCluster::new(Arc::clone(&pd_client))));\\n\\n Cluster::new(id, count, sim, pd_client)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/server.rs\",\n \"rank\": 31,\n \"score\": 326460.49461396056\n },\n {\n \"content\": \"pub fn new_node_cluster(id: u64, count: usize) -> Cluster<NodeCluster> {\\n\\n let pd_client = Arc::new(TestPdClient::new(id, false));\\n\\n let sim = Arc::new(RwLock::new(NodeCluster::new(Arc::clone(&pd_client))));\\n\\n Cluster::new(id, count, sim, pd_client)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/node.rs\",\n \"rank\": 32,\n \"score\": 326460.49461396056\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_record_prefix_littleendian_check(b: &mut Bencher) {\\n\\n let key: &[u8] = b\\\"_rabc\\\";\\n\\n let prefix: u16 = LittleEndian::read_u16(RECORD_PREFIX_SEP);\\n\\n b.iter(|| {\\n\\n let n = black_box(1000);\\n\\n (0..n).all(|_| black_box(key.len() > 2 && LittleEndian::read_u16(key) == prefix))\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"tests/benches/misc/coprocessor/codec/mod.rs\",\n \"rank\": 33,\n \"score\": 324335.4757464562\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_record_prefix_equal_check(b: &mut Bencher) {\\n\\n let key: &[u8] = b\\\"_rabc\\\";\\n\\n b.iter(|| {\\n\\n let n = black_box(1000);\\n\\n (0..n).all(|_| {\\n\\n black_box(\\n\\n key.len() > 2 && key[0] == RECORD_PREFIX_SEP[0] && key[1] == RECORD_PREFIX_SEP[1],\\n\\n )\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/coprocessor/codec/mod.rs\",\n \"rank\": 34,\n \"score\": 324335.4757464562\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_record_prefix_bigendian_check(b: &mut Bencher) {\\n\\n let key: &[u8] = b\\\"_rabc\\\";\\n\\n let prefix: u16 = BigEndian::read_u16(RECORD_PREFIX_SEP);\\n\\n b.iter(|| {\\n\\n let n = black_box(1000);\\n\\n (0..n).all(|_| black_box(key.len() > 2 && BigEndian::read_u16(key) == prefix))\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/coprocessor/codec/mod.rs\",\n \"rank\": 35,\n \"score\": 324335.4757464562\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_get_txn_commit_record_100(c: &mut test::Bencher) {\\n\\n bench_get_txn_commit_record(c, 100);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/storage/mvcc_reader.rs\",\n \"rank\": 36,\n \"score\": 323241.46433459676\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_get_txn_commit_record_5(c: &mut test::Bencher) {\\n\\n bench_get_txn_commit_record(c, 5);\\n\\n}\\n\",\n \"file_path\": \"tests/benches/misc/storage/mvcc_reader.rs\",\n \"rank\": 37,\n \"score\": 323241.4643345968\n },\n {\n \"content\": \"pub fn case_max_resource_groups(test_suite: &mut TestSuite) {\\n\\n test_suite.reset();\\n\\n let port = alloc_port();\\n\\n test_suite.start_receiver_at(port);\\n\\n test_suite.cfg_enabled(true);\\n\\n test_suite.cfg_receiver_address(format!(\\\"127.0.0.1:{}\\\", port));\\n\\n\\n\\n // Workload\\n\\n // [req-{1..3} * 10, req-{4..5} * 1]\\n\\n let mut wl = iter::repeat(1..=3)\\n\\n .take(10)\\n\\n .flatten()\\n\\n .chain(4..=5)\\n\\n .map(|n| format!(\\\"req-{}\\\", n))\\n\\n .collect::<Vec<_>>();\\n\\n wl.shuffle(&mut rand::thread_rng());\\n\\n test_suite.setup_workload(wl);\\n\\n\\n\\n // | Max Resource Groups |\\n\\n // | 5000 |\\n\",\n \"file_path\": \"tests/integrations/resource_metering/test_dynamic_config.rs\",\n \"rank\": 38,\n \"score\": 322937.2038631118\n },\n {\n \"content\": \"type BenchFn<M, I> = Box<dyn Fn(&mut criterion::Bencher<M>, &I) + 'static>;\\n\\n\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/util/mod.rs\",\n \"rank\": 39,\n \"score\": 322321.54639155563\n },\n {\n \"content\": \"pub fn init() {\\n\\n INIT.call_once(test_util::setup_for_ci);\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct ClientReceiver {\\n\\n receiver: Arc<Mutex<Option<ClientDuplexReceiver<ChangeDataEvent>>>>,\\n\\n}\\n\\n\\n\\nimpl ClientReceiver {\\n\\n pub fn replace(\\n\\n &self,\\n\\n rx: Option<ClientDuplexReceiver<ChangeDataEvent>>,\\n\\n ) -> Option<ClientDuplexReceiver<ChangeDataEvent>> {\\n\\n std::mem::replace(&mut *self.receiver.lock().unwrap(), rx)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/cdc/tests/mod.rs\",\n \"rank\": 40,\n \"score\": 321809.07625195873\n },\n {\n \"content\": \"pub fn new_incompatible_node_cluster(id: u64, count: usize) -> Cluster<NodeCluster> {\\n\\n let pd_client = Arc::new(TestPdClient::new(id, true));\\n\\n let sim = Arc::new(RwLock::new(NodeCluster::new(Arc::clone(&pd_client))));\\n\\n Cluster::new(id, count, sim, pd_client)\\n\\n}\\n\",\n \"file_path\": \"components/test_raftstore/src/node.rs\",\n \"rank\": 41,\n \"score\": 321660.5211035974\n },\n {\n \"content\": \"pub fn new_incompatible_server_cluster(id: u64, count: usize) -> Cluster<ServerCluster> {\\n\\n let pd_client = Arc::new(TestPdClient::new(id, true));\\n\\n let sim = Arc::new(RwLock::new(ServerCluster::new(Arc::clone(&pd_client))));\\n\\n Cluster::new(id, count, sim, pd_client)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/server.rs\",\n \"rank\": 42,\n \"score\": 321660.5211035974\n },\n {\n \"content\": \"/// Creates a callback that is automatically called on drop if it's not called\\n\\n/// explicitly.\\n\\n///\\n\\n/// Note that leaking the callback can cause it to be never called but it\\n\\n/// rarely happens.\\n\\n///\\n\\n/// Also note that because `callback` and `arg_on_drop` may be called in the `drop`\\n\\n/// method, do not panic inside them or use `safe_panic` instead.\\n\\npub fn must_call<T: Send + 'static>(\\n\\n callback: impl FnOnce(T) + Send + 'static,\\n\\n arg_on_drop: impl FnOnce() -> T + Send + 'static,\\n\\n) -> Callback<T> {\\n\\n let mut must_call = MustCall {\\n\\n callback: Some(callback),\\n\\n arg_on_drop: Some(arg_on_drop),\\n\\n _phantom: PhantomData,\\n\\n };\\n\\n Box::new(move |arg: T| {\\n\\n let callback = must_call.callback.take().unwrap();\\n\\n callback(arg);\\n\\n })\\n\\n}\\n\\n\\n\\npub struct MustCall<T, C, A>\\n\\nwhere\\n\\n C: FnOnce(T),\\n\\n A: FnOnce() -> T,\\n\\n{\\n\",\n \"file_path\": \"components/tikv_util/src/callback.rs\",\n \"rank\": 43,\n \"score\": 320588.0573019332\n },\n {\n \"content\": \"fn execute<M: criterion::measurement::Measurement + 'static>(c: &mut criterion::Criterion<M>) {\\n\\n util::fixture::bench(c);\\n\\n table_scan::bench(c);\\n\\n index_scan::bench(c);\\n\\n selection::bench(c);\\n\\n simple_aggr::bench(c);\\n\\n hash_aggr::bench(c);\\n\\n stream_aggr::bench(c);\\n\\n top_n::bench(c);\\n\\n integrated::bench(c);\\n\\n\\n\\n c.final_summary();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/mod.rs\",\n \"rank\": 44,\n \"score\": 319375.98837559967\n },\n {\n \"content\": \"/// system_info collects system related information, e.g: kernel\\n\\npub fn system_info(collector: &mut Vec<ServerInfoItem>) {\\n\\n // sysctl\\n\\n let sysctl = get_sysctl_list();\\n\\n let mut pairs = vec![];\\n\\n for (key, val) in sysctl.into_iter() {\\n\\n let mut pair = ServerInfoPair::default();\\n\\n pair.set_key(key);\\n\\n pair.set_value(val);\\n\\n pairs.push(pair);\\n\\n }\\n\\n // Sort pairs by key to make result stable\\n\\n pairs.sort_by(|a, b| a.get_key().cmp(b.get_key()));\\n\\n let mut item = ServerInfoItem::default();\\n\\n item.set_tp(\\\"system\\\".to_string());\\n\\n item.set_name(\\\"sysctl\\\".to_string());\\n\\n item.set_pairs(pairs.into());\\n\\n collector.push(item);\\n\\n if let Some(item) = get_transparent_hugepage() {\\n\\n collector.push(item);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/server/service/diagnostics/sys.rs\",\n \"rank\": 45,\n \"score\": 316098.7753902153\n },\n {\n \"content\": \"/// hardware_info collects CPU/Memory/Network/Disk hardware information\\n\\npub fn hardware_info(collector: &mut Vec<ServerInfoItem>) {\\n\\n cpu_hardware_info(collector);\\n\\n mem_hardware_info(collector);\\n\\n disk_hardware_info(collector);\\n\\n nic_hardware_info(collector);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/server/service/diagnostics/sys.rs\",\n \"rank\": 46,\n \"score\": 316098.6401696672\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn process_info(collector: &mut Vec<ServerInfoItem>) {\\n\\n let mut system = SYS_INFO.lock().unwrap();\\n\\n system.refresh_processes();\\n\\n let processes = system.get_processes();\\n\\n for (pid, p) in processes.iter() {\\n\\n if p.cmd().is_empty() {\\n\\n continue;\\n\\n }\\n\\n let mut pairs = vec![];\\n\\n let infos = vec![\\n\\n (\\\"executable\\\", format!(\\\"{:?}\\\", p.exe())),\\n\\n (\\\"cmd\\\", p.cmd().join(\\\" \\\")),\\n\\n (\\\"cwd\\\", format!(\\\"{:?}\\\", p.cwd())),\\n\\n (\\\"start-time\\\", p.start_time().to_string()),\\n\\n (\\\"memory\\\", p.memory().to_string()),\\n\\n (\\\"status\\\", p.status().to_string().to_owned()),\\n\\n (\\\"cpu-usage\\\", p.cpu_usage().to_string()),\\n\\n ];\\n\\n for (key, val) in infos.into_iter() {\\n\\n let mut pair = ServerInfoPair::default();\\n\",\n \"file_path\": \"src/server/service/diagnostics/sys.rs\",\n \"rank\": 47,\n \"score\": 316091.894835147\n },\n {\n \"content\": \"pub fn init() {\\n\\n INIT.call_once(test_util::setup_for_ci);\\n\\n}\\n\\n\\n\\npub struct TestSuite {\\n\\n pub cluster: Cluster<ServerCluster>,\\n\\n pub endpoints: HashMap<u64, LazyWorker<Task<RocksSnapshot>>>,\\n\\n pub obs: HashMap<u64, Observer<RocksEngine>>,\\n\\n tikv_cli: HashMap<u64, TikvClient>,\\n\\n concurrency_managers: HashMap<u64, ConcurrencyManager>,\\n\\n\\n\\n env: Arc<Environment>,\\n\\n}\\n\\n\\n\\nimpl TestSuite {\\n\\n pub fn new(count: usize) -> Self {\\n\\n let mut cluster = new_server_cluster(1, count);\\n\\n // Increase the Raft tick interval to make this test case running reliably.\\n\\n configure_for_lease_read(&mut cluster, Some(100), None);\\n\\n Self::with_cluster(count, cluster)\\n\",\n \"file_path\": \"components/resolved_ts/tests/mod.rs\",\n \"rank\": 48,\n \"score\": 315656.5843919154\n },\n {\n \"content\": \"#[rpn_fn(nullable, varg, min_args = 2, capture = [ctx])]\\n\\n#[inline]\\n\\npub fn least_time(mut ctx: &mut EvalContext, args: &[Option<BytesRef>]) -> Result<Option<Bytes>> {\\n\\n // Max datetime range defined at https://dev.mysql.com/doc/refman/8.0/en/datetime.html\\n\\n let mut least = Some(Time::parse_datetime(\\n\\n &mut ctx,\\n\\n \\\"9999-12-31 23:59:59\\\",\\n\\n 0,\\n\\n true,\\n\\n )?);\\n\\n for arg in args {\\n\\n match arg {\\n\\n Some(arg_val) => {\\n\\n let s = match str::from_utf8(arg_val) {\\n\\n Ok(s) => s,\\n\\n Err(err) => {\\n\\n return ctx\\n\\n .handle_invalid_time_error(Error::Encoding(err))\\n\\n .map(|_| Ok(None))?;\\n\\n }\\n\\n };\\n\\n match Time::parse_datetime(ctx, s, Time::parse_fsp(s), true) {\\n\",\n \"file_path\": \"components/tidb_query_expr/src/impl_compare.rs\",\n \"rank\": 49,\n \"score\": 314595.2569199774\n },\n {\n \"content\": \"pub fn calc_data_crc32(data: &[u8]) -> u32 {\\n\\n let mut digest = crc32fast::Hasher::new();\\n\\n digest.update(data);\\n\\n digest.finalize()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_sst_importer/src/lib.rs\",\n \"rank\": 50,\n \"score\": 310104.2533028495\n },\n {\n \"content\": \"fn bench_writebatch_impl(b: &mut Bencher, batch_keys: usize) {\\n\\n let path = Builder::new()\\n\\n .prefix(\\\"/tmp/rocksdb_write_batch_bench\\\")\\n\\n .tempdir()\\n\\n .unwrap();\\n\\n let db = Arc::new(DB::open_default(path.path().to_str().unwrap()).unwrap());\\n\\n let key_count = 1 << 13;\\n\\n let round = key_count / batch_keys;\\n\\n b.iter(|| {\\n\\n writebatch(&db, round, batch_keys);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/writebatch/bench_writebatch.rs\",\n \"rank\": 51,\n \"score\": 309953.5903375172\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\npub fn new_event_feed(\\n\\n client: &ChangeDataClient,\\n\\n) -> (\\n\\n ClientDuplexSender<ChangeDataRequest>,\\n\\n ClientReceiver,\\n\\n Box<dyn Fn(bool) -> ChangeDataEvent + Send>,\\n\\n) {\\n\\n let (req_tx, resp_rx) = client.event_feed().unwrap();\\n\\n let event_feed_wrap = Arc::new(Mutex::new(Some(resp_rx)));\\n\\n let event_feed_wrap_clone = event_feed_wrap.clone();\\n\\n\\n\\n let receive_event = move |keep_resolved_ts: bool| loop {\\n\\n let mut events;\\n\\n {\\n\\n let mut event_feed = event_feed_wrap_clone.lock().unwrap();\\n\\n events = event_feed.take();\\n\\n }\\n\\n let mut events_rx = if let Some(events_rx) = events.as_mut() {\\n\\n events_rx\\n\\n } else {\\n\",\n \"file_path\": \"components/cdc/tests/mod.rs\",\n \"rank\": 52,\n \"score\": 309821.91905239783\n },\n {\n \"content\": \"/// `add` adds a and b and carry, stores the sum and new carry.\\n\\nfn add(a: u32, b: u32, carry: &mut u32, res: &mut u32) {\\n\\n let sum = a + b + *carry;\\n\\n if sum >= WORD_BASE {\\n\\n *res = sum - WORD_BASE;\\n\\n *carry = 1;\\n\\n } else {\\n\\n *res = sum;\\n\\n *carry = 0;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tidb_query_datatype/src/codec/mysql/decimal.rs\",\n \"rank\": 53,\n \"score\": 308882.2735776366\n },\n {\n \"content\": \"fn bench_get_txn_commit_record(b: &mut test::Bencher, n: u64) {\\n\\n let key = Key::from_raw(&table::encode_row_key(1, 0));\\n\\n let store = prepare_mvcc_data(&key, n);\\n\\n b.iter(|| {\\n\\n let mut mvcc_reader = SnapshotReader::new(\\n\\n 1.into(),\\n\\n store.get_engine().snapshot(Default::default()).unwrap(),\\n\\n true,\\n\\n );\\n\\n mvcc_reader\\n\\n .get_txn_commit_record(&key)\\n\\n .unwrap()\\n\\n .unwrap_single_record();\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/storage/mvcc_reader.rs\",\n \"rank\": 54,\n \"score\": 306859.9865887629\n },\n {\n \"content\": \"/// Round each component.\\n\\n/// ```ignore\\n\\n/// let mut parts = [2019, 12, 1, 23, 59, 59, 1000000];\\n\\n/// round_components(&mut parts);\\n\\n/// assert_eq!([2019, 12, 2, 0, 0, 0, 0], parts);\\n\\n/// ```\\n\\n/// When year, month or day is zero, there can not have a carry.\\n\\n/// e.g.: `\\\"1998-11-00 23:59:59.999\\\" (fsp = 2, round = true)`, in `hms` it contains a carry,\\n\\n/// however, the `day` is 0, which is invalid in `MySQL`. When thoese cases encountered, return\\n\\n/// None.\\n\\nfn round_components(parts: &mut [u32]) -> Option<()> {\\n\\n debug_assert_eq!(parts.len(), 7);\\n\\n let modulus = [\\n\\n std::u32::MAX,\\n\\n 12,\\n\\n last_day_of_month(parts[0], parts[1]),\\n\\n // hms[.fraction]\\n\\n 24,\\n\\n 60,\\n\\n 60,\\n\\n 1_000_000,\\n\\n ];\\n\\n for i in (1..=6).rev() {\\n\\n let is_ymd = u32::from(i < 3);\\n\\n if parts[i] >= modulus[i] + is_ymd {\\n\\n parts[i] -= modulus[i];\\n\\n if i < 4 && parts[i - 1] == 0 || parts[i - 1] > modulus[i - 1] {\\n\\n return None;\\n\\n }\\n\\n parts[i - 1] += 1;\\n\\n }\\n\\n }\\n\\n Some(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tidb_query_datatype/src/codec/mysql/time/mod.rs\",\n \"rank\": 55,\n \"score\": 303658.89264667383\n },\n {\n \"content\": \"#[inline]\\n\\npub fn start(_name: impl AsRef<str>) -> bool {\\n\\n // Do nothing\\n\\n false\\n\\n}\\n\\n\\n\\n/// Stop profiling. Always returns false if `profiling` feature is not enabled.\\n\",\n \"file_path\": \"components/profiler/src/profiler_dummy.rs\",\n \"rank\": 56,\n \"score\": 303142.670867526\n },\n {\n \"content\": \"#[inline]\\n\\npub fn start(name: impl AsRef<str>) -> bool {\\n\\n let mut profiler = ACTIVE_PROFILER.lock().unwrap();\\n\\n\\n\\n // Profiling in progress.\\n\\n if *profiler != Profiler::None {\\n\\n return false;\\n\\n }\\n\\n\\n\\n if valgrind_request::running_on_valgrind() != 0 {\\n\\n *profiler = Profiler::CallGrind;\\n\\n CallgrindClientRequest::start();\\n\\n } else {\\n\\n *profiler = Profiler::GPerfTools;\\n\\n gperftools::PROFILER\\n\\n .lock()\\n\\n .unwrap()\\n\\n .start(name.as_ref())\\n\\n .unwrap();\\n\\n }\\n\\n\\n\\n true\\n\\n}\\n\\n\\n\\n/// Stop profiling. Returns false if failed, i.e. there is no profiling in progress.\\n\\n///\\n\\n/// When `profiling` feature is not enabled, this function will do nothing and there is totally\\n\\n/// zero cost.\\n\",\n \"file_path\": \"components/profiler/src/profiler_unix.rs\",\n \"rank\": 57,\n \"score\": 303142.670867526\n },\n {\n \"content\": \"#[inline]\\n\\npub fn read_slice<'a>(data: &mut BytesSlice<'a>, size: usize) -> Result<BytesSlice<'a>> {\\n\\n if data.len() >= size {\\n\\n let buf = &data[0..size];\\n\\n *data = &data[size..];\\n\\n Ok(buf)\\n\\n } else {\\n\\n Err(Error::unexpected_eof())\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Error)]\\n\\npub enum Error {\\n\\n #[error(\\\"{0}\\\")]\\n\\n Io(#[from] io::Error),\\n\\n #[error(\\\"bad format key(length)\\\")]\\n\\n KeyLength,\\n\\n #[error(\\\"bad format key(padding)\\\")]\\n\\n KeyPadding,\\n\\n #[error(\\\"key not found\\\")]\\n\\n KeyNotFound,\\n\",\n \"file_path\": \"components/tikv_util/src/codec/mod.rs\",\n \"rank\": 58,\n \"score\": 300796.20176606777\n },\n {\n \"content\": \"pub fn cpu_total(state: &pid::Stat) -> f64 {\\n\\n (state.utime + state.stime) as f64 / *CLK_TCK\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tikv_util/src/metrics/threads_linux.rs\",\n \"rank\": 59,\n \"score\": 300381.2044091511\n },\n {\n \"content\": \"pub fn offset_for_column(cols: &[ColumnInfo], col_id: i64) -> i64 {\\n\\n for (offset, column) in cols.iter().enumerate() {\\n\\n if column.get_column_id() == col_id {\\n\\n return offset as i64;\\n\\n }\\n\\n }\\n\\n 0_i64\\n\\n}\\n\",\n \"file_path\": \"components/test_coprocessor/src/util.rs\",\n \"rank\": 60,\n \"score\": 300016.5391853083\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub fn process_id() -> usize {\\n\\n std::process::id() as _\\n\\n}\\n\\n\\n\\n/// Gets the ID of the current thread.\\n\",\n \"file_path\": \"components/resource_metering/src/utils.rs\",\n \"rank\": 61,\n \"score\": 299944.5584556464\n },\n {\n \"content\": \"// The `to_string()` function of `slog::Level` produces values like `erro` and `trce` instead of\\n\\n// the full words. This produces the full word.\\n\\npub fn get_string_by_level(lv: Level) -> &'static str {\\n\\n match lv {\\n\\n Level::Critical => \\\"critical\\\",\\n\\n Level::Error => \\\"error\\\",\\n\\n Level::Warning => \\\"warning\\\",\\n\\n Level::Debug => \\\"debug\\\",\\n\\n Level::Trace => \\\"trace\\\",\\n\\n Level::Info => \\\"info\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tikv_util/src/logger/mod.rs\",\n \"rank\": 62,\n \"score\": 299870.0178113303\n },\n {\n \"content\": \"/// Gets the first encoded bytes' length in compactly encoded data.\\n\\n///\\n\\n/// Compact-encoding includes a VarInt encoded length prefix (1 ~ 9 bytes) and N bytes payload.\\n\\n/// This function gets the total bytes length of compact-encoded data, including the length prefix.\\n\\n///\\n\\n/// Note:\\n\\n/// - This function won't check whether the bytes are encoded correctly.\\n\\n/// - There can be multiple compact-encoded data, placed one by one. This function only returns\\n\\n/// the length of the first one.\\n\\npub fn encoded_compact_len(mut encoded: &[u8]) -> usize {\\n\\n let last_encoded = encoded.as_ptr() as usize;\\n\\n let total_len = encoded.len();\\n\\n let vn = match number::decode_var_i64(&mut encoded) {\\n\\n Ok(vn) => vn as usize,\\n\\n Err(e) => {\\n\\n debug!(\\\"failed to decode bytes' length: {:?}\\\", e);\\n\\n return total_len;\\n\\n }\\n\\n };\\n\\n vn + (encoded.as_ptr() as usize - last_encoded)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tikv_util/src/codec/bytes.rs\",\n \"rank\": 63,\n \"score\": 299737.448649558\n },\n {\n \"content\": \"pub fn next_id() -> i64 {\\n\\n ID_GENERATOR.fetch_add(1, Ordering::Relaxed) as i64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_coprocessor/src/util.rs\",\n \"rank\": 64,\n \"score\": 298754.2995382128\n },\n {\n \"content\": \"#[rpn_fn(nullable, capture = [ctx])]\\n\\n#[inline]\\n\\npub fn password(ctx: &mut EvalContext, input: Option<BytesRef>) -> Result<Option<Bytes>> {\\n\\n ctx.warnings.append_warning(Error::Other(box_err!(\\n\\n \\\"Warning: Deprecated syntax PASSWORD\\\"\\n\\n )));\\n\\n match input {\\n\\n Some(bytes) => {\\n\\n if bytes.is_empty() {\\n\\n Ok(Some(Vec::new()))\\n\\n } else {\\n\\n let hash1 = hex_digest(MessageDigest::sha1(), bytes)?;\\n\\n let mut hash2 = hex_digest(MessageDigest::sha1(), hash1.as_slice())?;\\n\\n hash2.insert(0, b'*');\\n\\n Ok(Some(hash2))\\n\\n }\\n\\n }\\n\\n None => Ok(None),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tidb_query_expr/src/impl_encryption.rs\",\n \"rank\": 65,\n \"score\": 295668.29397741146\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub fn record_global_memory_usage() {\\n\\n GLOBAL_MEMORY_USAGE.store(0, Ordering::Release);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tikv_util/src/sys/mod.rs\",\n \"rank\": 66,\n \"score\": 295142.77116024855\n },\n {\n \"content\": \"fn test_simple_store_stats<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n let pd_client = Arc::clone(&cluster.pd_client);\\n\\n\\n\\n cluster.cfg.raft_store.pd_store_heartbeat_tick_interval = ReadableDuration::millis(20);\\n\\n cluster.run();\\n\\n\\n\\n // wait store reports stats.\\n\\n for _ in 0..100 {\\n\\n sleep_ms(20);\\n\\n\\n\\n if pd_client.get_store_stats(1).is_some() {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n let engine = cluster.get_engine(1);\\n\\n let raft_engine = cluster.get_raft_engine(1);\\n\\n raft_engine.flush(true).unwrap();\\n\\n engine.flush(true).unwrap();\\n\\n let last_stats = pd_client.get_store_stats(1).unwrap();\\n\",\n \"file_path\": \"tests/integrations/raftstore/test_stats.rs\",\n \"rank\": 67,\n \"score\": 294889.0152724751\n },\n {\n \"content\": \"pub fn new_sst_meta(crc32: u32, length: u64) -> SstMeta {\\n\\n let mut m = SstMeta::default();\\n\\n m.set_uuid(Uuid::new_v4().as_bytes().to_vec());\\n\\n m.set_crc32(crc32);\\n\\n m.set_length(length);\\n\\n m\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integrations/import/util.rs\",\n \"rank\": 68,\n \"score\": 293572.27204507135\n },\n {\n \"content\": \"/// `sub` subtracts rhs and carry from lhs, store the diff and new carry.\\n\\nfn sub(lhs: u32, rhs: u32, carry: &mut i32, res: &mut u32) {\\n\\n let diff = lhs as i32 - rhs as i32 - *carry;\\n\\n if diff < 0 {\\n\\n *carry = 1;\\n\\n *res = (diff + WORD_BASE as i32) as u32;\\n\\n } else {\\n\\n *carry = 0;\\n\\n *res = diff as u32;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tidb_query_datatype/src/codec/mysql/decimal.rs\",\n \"rank\": 69,\n \"score\": 293305.8218927447\n },\n {\n \"content\": \"/// `sub2` subtracts rhs and carry from lhs, stores the diff and new carry.\\n\\n/// the new carry may be 2.\\n\\nfn sub2(lhs: u32, rhs: u32, carry: &mut i32, res: &mut u32) {\\n\\n let mut diff = lhs as i32 - rhs as i32 - *carry;\\n\\n if diff < -(WORD_BASE as i32) {\\n\\n *carry = 2;\\n\\n diff += WORD_BASE as i32 + WORD_BASE as i32;\\n\\n } else if diff < 0 {\\n\\n *carry = 1;\\n\\n diff += WORD_BASE as i32;\\n\\n } else {\\n\\n *carry = 0;\\n\\n }\\n\\n *res = diff as u32;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tidb_query_datatype/src/codec/mysql/decimal.rs\",\n \"rank\": 70,\n \"score\": 293305.8218927447\n },\n {\n \"content\": \"/// Checks whether our test utilities themselves are fast enough.\\n\\npub fn bench<M>(c: &mut criterion::Criterion<M>)\\n\\nwhere\\n\\n M: Measurement + 'static,\\n\\n{\\n\\n if crate::util::bench_level() >= 1 {\\n\\n c.bench_function(\\n\\n \\\"util_batch_fixture_executor_next_1024\\\",\\n\\n bench_util_batch_fixture_executor_next_1024::<M>,\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/benches/coprocessor_executors/util/fixture.rs\",\n \"rank\": 71,\n \"score\": 292207.6011667974\n },\n {\n \"content\": \"#[rpn_fn(nullable, capture = [ctx])]\\n\\n#[inline]\\n\\npub fn uncompressed_length(ctx: &mut EvalContext, arg: Option<BytesRef>) -> Result<Option<Int>> {\\n\\n use byteorder::{ByteOrder, LittleEndian};\\n\\n Ok(arg.as_ref().map(|s| {\\n\\n if s.is_empty() {\\n\\n 0\\n\\n } else if s.len() <= 4 {\\n\\n ctx.warnings.append_warning(Error::zlib_data_corrupted());\\n\\n 0\\n\\n } else {\\n\\n Int::from(LittleEndian::read_u32(&s[0..4]))\\n\\n }\\n\\n }))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tidb_query_expr/src/impl_encryption.rs\",\n \"rank\": 72,\n \"score\": 291579.91441567603\n },\n {\n \"content\": \"#[rpn_fn(nullable, varg, min_args = 2, capture = [ctx])]\\n\\n#[inline]\\n\\npub fn greatest_time(ctx: &mut EvalContext, args: &[Option<BytesRef>]) -> Result<Option<Bytes>> {\\n\\n let mut greatest = None;\\n\\n for arg in args {\\n\\n match arg {\\n\\n Some(arg_val) => {\\n\\n let s = match str::from_utf8(arg_val) {\\n\\n Ok(s) => s,\\n\\n Err(err) => {\\n\\n return ctx\\n\\n .handle_invalid_time_error(Error::Encoding(err))\\n\\n .map(|_| Ok(None))?;\\n\\n }\\n\\n };\\n\\n match Time::parse_datetime(ctx, s, Time::parse_fsp(s), true) {\\n\\n Ok(t) => greatest = max(greatest, Some(t)),\\n\\n Err(_) => {\\n\\n return ctx\\n\\n .handle_invalid_time_error(Error::invalid_time_format(&s))\\n\\n .map(|_| Ok(None))?;\\n\\n }\\n\",\n \"file_path\": \"components/tidb_query_expr/src/impl_compare.rs\",\n \"rank\": 73,\n \"score\": 291579.70935657166\n },\n {\n \"content\": \"pub fn memory_usage_reaches_high_water(usage: &mut u64) -> bool {\\n\\n fail_point!(\\\"memory_usage_reaches_high_water\\\", |_| true);\\n\\n *usage = get_global_memory_usage();\\n\\n *usage >= MEMORY_USAGE_HIGH_WATER.load(Ordering::Acquire)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/tikv_util/src/sys/mod.rs\",\n \"rank\": 74,\n \"score\": 291094.1676107567\n },\n {\n \"content\": \"fn create_file_info(id: u64, method: EncryptionMethod) -> FileInfo {\\n\\n FileInfo {\\n\\n key_id: id,\\n\\n method: compat(method),\\n\\n ..Default::default()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/failpoints/cases/test_encryption.rs\",\n \"rank\": 75,\n \"score\": 291078.9968331639\n },\n {\n \"content\": \"/// Calculates crc32 and decrypted size for a given reader.\\n\\npub fn calc_crc32_and_size<R: Read>(reader: &mut R) -> io::Result<(u32, u64)> {\\n\\n let mut digest = crc32fast::Hasher::new();\\n\\n let (mut buf, mut fsize) = (vec![0; DIGEST_BUFFER_SIZE], 0);\\n\\n loop {\\n\\n match reader.read(&mut buf[..]) {\\n\\n Ok(0) => {\\n\\n return Ok((digest.finalize(), fsize as u64));\\n\\n }\\n\\n Ok(n) => {\\n\\n digest.update(&buf[..n]);\\n\\n fsize += n;\\n\\n }\\n\\n Err(ref e) if e.kind() == ErrorKind::Interrupted => {}\\n\\n Err(err) => return Err(err),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/file_system/src/lib.rs\",\n \"rank\": 76,\n \"score\": 290624.0277941283\n },\n {\n \"content\": \"pub fn tls_collect_scan_details(cmd: &'static str, stats: &Statistics) {\\n\\n TLS_SCHED_METRICS.with(|m| {\\n\\n m.borrow_mut()\\n\\n .local_scan_details\\n\\n .entry(cmd)\\n\\n .or_insert_with(Default::default)\\n\\n .add(stats);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/storage/txn/sched_pool.rs\",\n \"rank\": 77,\n \"score\": 290378.6623965822\n },\n {\n \"content\": \"pub fn find_peer_mut(region: &mut metapb::Region, store_id: u64) -> Option<&mut metapb::Peer> {\\n\\n region\\n\\n .mut_peers()\\n\\n .iter_mut()\\n\\n .find(|p| p.get_store_id() == store_id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/raftstore/src/store/util.rs\",\n \"rank\": 78,\n \"score\": 289317.0722964992\n },\n {\n \"content\": \"/// `skip_n_datum_slices` skip `n` datum slices within `buf`\\n\\n/// and advances the buffer pointer.\\n\\n/// If the datum buffer contains less than `n` slices, an error will be returned.\\n\\npub fn skip_n(buf: &mut &[u8], n: usize) -> Result<()> {\\n\\n let origin = *buf;\\n\\n for i in 0..n {\\n\\n if buf.is_empty() {\\n\\n return Err(box_err!(\\n\\n \\\"The {}th slice are missing in the datum buffer: {}\\\",\\n\\n i,\\n\\n log_wrappers::Value::value(origin)\\n\\n ));\\n\\n }\\n\\n let (_, remaining) = split_datum(buf, false)?;\\n\\n *buf = remaining;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::codec::mysql::{Decimal, Duration, Time, MAX_FSP};\\n\",\n \"file_path\": \"components/tidb_query_datatype/src/codec/datum.rs\",\n \"rank\": 79,\n \"score\": 288885.04655769566\n },\n {\n \"content\": \"pub fn bench_mvcc<E: Engine, F: EngineFactory<E>>(c: &mut Criterion, configs: &[BenchConfig<F>]) {\\n\\n let mut group = c.benchmark_group(\\\"mvcc\\\");\\n\\n for config in configs {\\n\\n group.bench_with_input(format!(\\\"prewrite/{:?}\\\", config), config, mvcc_prewrite);\\n\\n group.bench_with_input(format!(\\\"commit/{:?}\\\", config), config, mvcc_commit);\\n\\n group.bench_with_input(\\n\\n format!(\\\"rollback_prewrote/{:?}\\\", config),\\n\\n config,\\n\\n mvcc_rollback_prewrote,\\n\\n );\\n\\n group.bench_with_input(\\n\\n format!(\\\"rollback_conflict/{:?}\\\", config),\\n\\n config,\\n\\n mvcc_rollback_conflict,\\n\\n );\\n\\n group.bench_with_input(\\n\\n format!(\\\"rollback_non_prewrote/{:?}\\\", config),\\n\\n config,\\n\\n mvcc_rollback_non_prewrote,\\n\\n );\\n\",\n \"file_path\": \"tests/benches/hierarchy/mvcc/mod.rs\",\n \"rank\": 80,\n \"score\": 287944.7869017943\n },\n {\n \"content\": \"pub fn bench_txn<E: Engine, F: EngineFactory<E>>(c: &mut Criterion, configs: &[BenchConfig<F>]) {\\n\\n let mut group = c.benchmark_group(\\\"txn\\\");\\n\\n for config in configs {\\n\\n group.bench_with_input(format!(\\\"prewrite/{:?}\\\", config), config, txn_prewrite);\\n\\n group.bench_with_input(format!(\\\"commit/{:?}\\\", config), config, txn_commit);\\n\\n group.bench_with_input(\\n\\n format!(\\\"rollback_prewrote/{:?}\\\", config),\\n\\n config,\\n\\n txn_rollback_prewrote,\\n\\n );\\n\\n group.bench_with_input(\\n\\n format!(\\\"rollback_conflict/{:?}\\\", config),\\n\\n config,\\n\\n txn_rollback_conflict,\\n\\n );\\n\\n group.bench_with_input(\\n\\n format!(\\\"rollback_non_prewrote/{:?}\\\", config),\\n\\n config,\\n\\n txn_rollback_non_prewrote,\\n\\n );\\n\\n }\\n\\n group.finish();\\n\\n}\\n\",\n \"file_path\": \"tests/benches/hierarchy/txn/mod.rs\",\n \"rank\": 81,\n \"score\": 287944.7869017943\n },\n {\n \"content\": \"pub fn bench_engine<E: Engine, F: EngineFactory<E>>(c: &mut Criterion, configs: &[BenchConfig<F>]) {\\n\\n let mut group = c.benchmark_group(\\\"engine\\\");\\n\\n for config in configs {\\n\\n group.bench_with_input(\\n\\n format!(\\\"get(exclude snapshot)/{:?}\\\", config),\\n\\n config,\\n\\n bench_engine_get,\\n\\n );\\n\\n group.bench_with_input(format!(\\\"put/{:?}\\\", config), config, bench_engine_put);\\n\\n group.bench_with_input(\\n\\n format!(\\\"snapshot/{:?}\\\", config),\\n\\n config,\\n\\n bench_engine_snapshot,\\n\\n );\\n\\n }\\n\\n group.finish();\\n\\n}\\n\",\n \"file_path\": \"tests/benches/hierarchy/engine/mod.rs\",\n \"rank\": 82,\n \"score\": 287944.7869017943\n },\n {\n \"content\": \"pub fn configure_for_merge<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n // Avoid log compaction which will prevent merge.\\n\\n cluster.cfg.raft_store.raft_log_gc_threshold = 1000;\\n\\n cluster.cfg.raft_store.raft_log_gc_count_limit = 1000;\\n\\n cluster.cfg.raft_store.raft_log_gc_size_limit = ReadableSize::mb(20);\\n\\n // Make merge check resume quickly.\\n\\n cluster.cfg.raft_store.merge_check_tick_interval = ReadableDuration::millis(100);\\n\\n // When isolated, follower relies on stale check tick to detect failure leader,\\n\\n // choose a smaller number to make it recover faster.\\n\\n cluster.cfg.raft_store.peer_stale_state_check_interval = ReadableDuration::millis(500);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 83,\n \"score\": 287834.2311538547\n },\n {\n \"content\": \"pub fn configure_for_hibernate<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n // Uses long check interval to make leader keep sleeping during tests.\\n\\n cluster.cfg.raft_store.abnormal_leader_missing_duration = ReadableDuration::secs(20);\\n\\n cluster.cfg.raft_store.max_leader_missing_duration = ReadableDuration::secs(40);\\n\\n cluster.cfg.raft_store.peer_stale_state_check_interval = ReadableDuration::secs(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 84,\n \"score\": 287834.2311538547\n },\n {\n \"content\": \"pub fn configure_for_encryption<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n let manifest_dir = Path::new(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n let master_key_file = manifest_dir.join(\\\"src/master-key.data\\\");\\n\\n\\n\\n let cfg = &mut cluster.cfg.security.encryption;\\n\\n cfg.data_encryption_method = EncryptionMethod::Aes128Ctr;\\n\\n cfg.data_key_rotation_period = ReadableDuration(Duration::from_millis(100));\\n\\n cfg.master_key = MasterKeyConfig::File {\\n\\n config: FileConfig {\\n\\n path: master_key_file.to_str().unwrap().to_owned(),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 85,\n \"score\": 287834.2311538547\n },\n {\n \"content\": \"pub fn configure_for_snapshot<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n // Truncate the log quickly so that we can force sending snapshot.\\n\\n cluster.cfg.raft_store.raft_log_gc_tick_interval = ReadableDuration::millis(20);\\n\\n cluster.cfg.raft_store.raft_log_gc_count_limit = 2;\\n\\n cluster.cfg.raft_store.merge_max_log_gap = 1;\\n\\n cluster.cfg.raft_store.snap_mgr_gc_tick_interval = ReadableDuration::millis(50);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 86,\n \"score\": 287834.2311538547\n },\n {\n \"content\": \"fn counter_closure(counter: &Arc<AtomicUsize>) -> Message {\\n\\n let c = counter.clone();\\n\\n Message::Callback(Box::new(move |_: &Handler, _: &mut Runner| {\\n\\n c.fetch_add(1, Ordering::SeqCst);\\n\\n }))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/batch-system/tests/cases/router.rs\",\n \"rank\": 87,\n \"score\": 287587.31382943527\n },\n {\n \"content\": \"fn bench_dense_detect_with_cleanup(c: &mut Criterion) {\\n\\n let mut group = c.benchmark_group(\\\"bench_dense_detect_with_cleanup\\\");\\n\\n\\n\\n let ttls = vec![1, 3, 5, 10, 100, 500, 1_000, 3_000];\\n\\n for ttl in &ttls {\\n\\n let config = Config {\\n\\n n: 10,\\n\\n range: 1000,\\n\\n ttl: Duration::from_millis(*ttl),\\n\\n };\\n\\n group.bench_with_input(format!(\\\"{:?}\\\", &config), &config, bench_detect);\\n\\n }\\n\\n group.finish();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/deadlock_detector/mod.rs\",\n \"rank\": 88,\n \"score\": 284280.445560234\n },\n {\n \"content\": \"pub fn configure_for_request_snapshot<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n // We don't want to generate snapshots due to compact log.\\n\\n cluster.cfg.raft_store.raft_log_gc_threshold = 1000;\\n\\n cluster.cfg.raft_store.raft_log_gc_count_limit = 1000;\\n\\n cluster.cfg.raft_store.raft_log_gc_size_limit = ReadableSize::mb(20);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 89,\n \"score\": 283658.70272525965\n },\n {\n \"content\": \"pub fn configure_for_transfer_leader<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n cluster.cfg.raft_store.raft_reject_transfer_leader_duration = ReadableDuration::secs(1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 90,\n \"score\": 283658.70272525965\n },\n {\n \"content\": \"pub fn configure_for_disable_titan<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n cluster.cfg.rocksdb.titan.enabled = false;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 91,\n \"score\": 283658.70272525965\n },\n {\n \"content\": \"pub fn build_read_pool_for_test<E: Engine>(\\n\\n config: &CoprReadPoolConfig,\\n\\n engine: E,\\n\\n) -> Vec<FuturePool> {\\n\\n let configs: Vec<Config> = config.to_yatp_pool_configs();\\n\\n assert_eq!(configs.len(), 3);\\n\\n\\n\\n configs\\n\\n .into_iter()\\n\\n .map(|config| {\\n\\n let engine = Arc::new(Mutex::new(engine.clone()));\\n\\n YatpPoolBuilder::new(DefaultTicker::default())\\n\\n .config(config)\\n\\n .after_start(move || {\\n\\n set_tls_engine(engine.lock().unwrap().clone());\\n\\n set_io_type(IOType::ForegroundRead);\\n\\n })\\n\\n // Safety: we call `set_` and `destroy_` with the same engine type.\\n\\n .before_stop(|| unsafe { destroy_tls_engine::<E>() })\\n\\n .build_future_pool()\\n\\n })\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"src/coprocessor/readpool_impl.rs\",\n \"rank\": 92,\n \"score\": 282715.6320271391\n },\n {\n \"content\": \"pub fn ignore_merge_target_integrity<T: Simulator>(cluster: &mut Cluster<T>) {\\n\\n cluster.cfg.raft_store.dev_assert = false;\\n\\n cluster.pd_client.ignore_merge_target_integrity();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"components/test_raftstore/src/util.rs\",\n \"rank\": 93,\n \"score\": 279661.93639150594\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_table_prefix_start_with(b: &mut Bencher) {\\n\\n let key: &[u8] = b\\\"tabc\\\";\\n\\n b.iter(|| {\\n\\n let n = black_box(1000);\\n\\n (0..n).all(|_| black_box(key.starts_with(TABLE_PREFIX)))\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/coprocessor/codec/mod.rs\",\n \"rank\": 94,\n \"score\": 279493.4647546955\n },\n {\n \"content\": \"#[bench]\\n\\nfn bench_table_prefix_check(b: &mut Bencher) {\\n\\n let key: &[u8] = b\\\"tabc\\\";\\n\\n b.iter(|| {\\n\\n let n = black_box(1000);\\n\\n (0..n).all(|_| black_box(key.len() > 1 && key[0] == TABLE_PREFIX[0]))\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/misc/coprocessor/codec/mod.rs\",\n \"rank\": 95,\n \"score\": 279493.4647546955\n },\n {\n \"content\": \"fn bench_dense_detect_without_cleanup(c: &mut Criterion) {\\n\\n let mut group = c.benchmark_group(\\\"bench_dense_detect_without_cleanup\\\");\\n\\n\\n\\n let ranges = vec![\\n\\n 10,\\n\\n 100,\\n\\n 1_000,\\n\\n 10_000,\\n\\n 100_000,\\n\\n 1_000_000,\\n\\n 10_000_000,\\n\\n 100_000_000,\\n\\n ];\\n\\n for range in ranges {\\n\\n let config = Config {\\n\\n n: 10,\\n\\n range,\\n\\n ttl: Duration::from_secs(100000000),\\n\\n };\\n\\n group.bench_with_input(format!(\\\"{:?}\\\", &config), &config, bench_detect);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/benches/deadlock_detector/mod.rs\",\n \"rank\": 96,\n \"score\": 279493.4647546955\n },\n {\n \"content\": \"\\n\\n#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub use self::notlinux::{self_thread_inspector, Impl as ThreadInspectorImpl};\\n\\n\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::io::Write;\\n\\n\\n\\n fn page_size() -> u64 {\\n\\n unsafe { libc::sysconf(libc::_SC_PAGE_SIZE) as u64 }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_thread_inspector_io_stat() {\\n\\n let inspector = self_thread_inspector().unwrap();\\n\\n let io1 = inspector.io_stat().unwrap().unwrap();\\n\\n\\n\\n let mut f = tempfile::tempfile().unwrap();\\n\",\n \"file_path\": \"components/tikv_util/src/sys/inspector.rs\",\n \"rank\": 97,\n \"score\": 58.229628721758004\n },\n {\n \"content\": \" pub fn set_remain(&mut self, remain: usize) {\\n\\n self.keep_remain = remain;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SoftLimitByCpu<RefCell<ThreadInfoStatistics>> {\\n\\n pub fn with_remain(remain: usize) -> Self {\\n\\n let total = SysQuota::cpu_cores_quota();\\n\\n let metrics = RefCell::new(ThreadInfoStatistics::new());\\n\\n Self {\\n\\n metrics,\\n\\n total_time: total,\\n\\n keep_remain: remain,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod softlimit_test {\\n\\n use std::{\\n\",\n \"file_path\": \"components/backup/src/softlimit.rs\",\n \"rank\": 98,\n \"score\": 56.6264969602417\n }\n]","isConversational":false}}},{"rowIdx":1993,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"alvr/experiments/graphics_tests/src/compositor/convert.rs"},"repo_name":{"kind":"string","value":"glegoo/ALVR"},"commit":{"kind":"string","value":"76d087fdb05f2035486626551c9ab9022ba645c6"},"file_code":{"kind":"string","value":"use super::{Compositor, Context, Swapchain, TextureType};\nuse alvr_common::prelude::*;\nuse ash::{extensions::khr, vk};\nuse openxr_sys as sys;\nuse std::{ffi::CStr, slice};\nuse wgpu::{\n DeviceDescriptor, Extent3d, Features, Texture, TextureDescriptor, TextureDimension,\n TextureFormat, TextureUsages,\n};\nuse wgpu_hal as hal;\n\npub const TARGET_VULKAN_VERSION: u32 = vk::make_api_version(1, 0, 0, 0);\n\npub fn get_vulkan_instance_extensions(\n entry: &ash::Entry,\n version: u32,\n) -> StrResult<Vec<&'static CStr>> {\n let mut flags = hal::InstanceFlags::empty();\n if cfg!(debug_assertions) {\n flags |= hal::InstanceFlags::VALIDATION;\n flags |= hal::InstanceFlags::DEBUG;\n }\n\n trace_err!(<hal::api::Vulkan as hal::Api>::Instance::required_extensions(entry, version, flags))\n}\n\npub fn create_vulkan_instance(\n entry: &ash::Entry,\n info: &vk::InstanceCreateInfo,\n) -> StrResult<ash::Instance> {\n let mut extensions_ptrs =\n get_vulkan_instance_extensions(entry, unsafe { (*info.p_application_info).api_version })?\n .iter()\n .map(|x| x.as_ptr())\n .collect::<Vec<_>>();\n\n extensions_ptrs.extend_from_slice(unsafe {\n slice::from_raw_parts(\n info.pp_enabled_extension_names,\n info.enabled_extension_count as _,\n )\n });\n\n unsafe {\n trace_err!(entry.create_instance(\n &vk::InstanceCreateInfo {\n enabled_extension_count: extensions_ptrs.len() as _,\n pp_enabled_extension_names: extensions_ptrs.as_ptr(),\n ..*info\n },\n None,\n ))\n }\n}\n\npub fn get_vulkan_graphics_device(\n instance: &ash::Instance,\n adapter_index: Option<usize>,\n) -> StrResult<vk::PhysicalDevice> {\n let mut physical_devices = unsafe { trace_err!(instance.enumerate_physical_devices())? };\n\n Ok(physical_devices.remove(adapter_index.unwrap_or(0)))\n}\n\npub fn get_vulkan_device_extensions(version: u32) -> Vec<&'static CStr> {\n let mut extensions = vec![khr::Swapchain::name()];\n\n if version < vk::API_VERSION_1_1 {\n extensions.push(vk::KhrMaintenance1Fn::name());\n extensions.push(vk::KhrMaintenance2Fn::name());\n }\n\n extensions\n}\n\npub fn create_vulkan_device(\n entry: &ash::Entry,\n version: u32,\n instance: &ash::Instance,\n physical_device: vk::PhysicalDevice,\n create_info: &vk::DeviceCreateInfo,\n) -> StrResult<ash::Device> {\n let mut extensions_ptrs = get_vulkan_device_extensions(version)\n .iter()\n .map(|x| x.as_ptr())\n .collect::<Vec<_>>();\n\n extensions_ptrs.extend_from_slice(unsafe {\n slice::from_raw_parts(\n create_info.pp_enabled_extension_names,\n create_info.enabled_extension_count as _,\n )\n });\n\n let mut features = if !create_info.p_enabled_features.is_null() {\n unsafe { *create_info.p_enabled_features }\n } else {\n vk::PhysicalDeviceFeatures::default()\n };\n features.robust_buffer_access = true as _;\n features.independent_blend = true as _;\n features.sample_rate_shading = true as _;\n\n unsafe {\n trace_err!(instance.create_device(\n physical_device,\n &vk::DeviceCreateInfo {\n enabled_extension_count: extensions_ptrs.len() as _,\n pp_enabled_extension_names: extensions_ptrs.as_ptr(),\n p_enabled_features: &features as *const _,\n ..*create_info\n },\n None\n ))\n }\n}\n\nimpl Context {\n \n \n \n pub fn from_vulkan(\n owned: bool, \n entry: ash::Entry,\n version: u32,\n vk_instance: ash::Instance,\n adapter_index: Option<usize>,\n vk_device: ash::Device,\n queue_family_index: u32,\n queue_index: u32,\n ) -> StrResult<Self> {\n let mut flags = hal::InstanceFlags::empty();\n if cfg!(debug_assertions) {\n flags |= hal::InstanceFlags::VALIDATION;\n flags |= hal::InstanceFlags::DEBUG;\n };\n\n let extensions = get_vulkan_instance_extensions(&entry, version)?;\n\n let instance = unsafe {\n trace_err!(<hal::api::Vulkan as hal::Api>::Instance::from_raw(\n entry,\n vk_instance.clone(),\n version,\n extensions,\n flags,\n owned.then(|| Box::new(()) as _)\n ))?\n };\n\n let physical_device = get_vulkan_graphics_device(&vk_instance, adapter_index)?;\n let exposed_adapter = trace_none!(instance.expose_adapter(physical_device))?;\n\n let open_device = unsafe {\n trace_err!(exposed_adapter.adapter.device_from_raw(\n vk_device,\n owned,\n &get_vulkan_device_extensions(version),\n queue_family_index,\n queue_index,\n ))?\n };\n\n #[cfg(not(target_os = \"macos\"))]\n {\n let instance = unsafe { wgpu::Instance::from_hal::<hal::api::Vulkan>(instance) };\n let adapter = unsafe { instance.create_adapter_from_hal(exposed_adapter) };\n let (device, queue) = unsafe {\n trace_err!(adapter.create_device_from_hal(\n open_device,\n &DeviceDescriptor {\n label: None,\n features: Features::PUSH_CONSTANTS,\n limits: adapter.limits(),\n },\n None,\n ))?\n };\n\n Ok(Self {\n instance,\n device,\n queue,\n })\n }\n\n #[cfg(target_os = \"macos\")]\n unimplemented!()\n }\n\n \n pub fn new(adapter_index: Option<usize>) -> StrResult<Self> {\n let entry = unsafe { trace_err!(ash::Entry::new())? };\n\n let vk_instance = trace_err!(create_vulkan_instance(\n &entry,\n &vk::InstanceCreateInfo::builder()\n .application_info(\n &vk::ApplicationInfo::builder().api_version(TARGET_VULKAN_VERSION)\n )\n .build()\n ))?;\n\n let physical_device = get_vulkan_graphics_device(&vk_instance, adapter_index)?;\n\n let queue_family_index = unsafe {\n vk_instance\n .get_physical_device_queue_family_properties(physical_device)\n .into_iter()\n .enumerate()\n .find_map(|(queue_family_index, info)| {\n if info.queue_flags.contains(vk::QueueFlags::GRAPHICS) {\n Some(queue_family_index as u32)\n } else {\n None\n }\n })\n .unwrap()\n };\n let queue_index = 0;\n\n let vk_device = trace_err!(create_vulkan_device(\n &entry,\n TARGET_VULKAN_VERSION,\n &vk_instance,\n physical_device,\n &vk::DeviceCreateInfo::builder().queue_create_infos(&[\n vk::DeviceQueueCreateInfo::builder()\n .queue_family_index(queue_family_index)\n .queue_priorities(&[1.0])\n .build()\n ])\n ))?;\n\n Self::from_vulkan(\n true,\n entry,\n TARGET_VULKAN_VERSION,\n vk_instance,\n adapter_index,\n vk_device,\n queue_family_index,\n queue_index,\n )\n }\n}\n\npub enum SwapchainCreateData {\n \n #[cfg(target_os = \"linux\")]\n External {\n images: Vec<vk::Image>,\n vk_usage: vk::ImageUsageFlags,\n vk_format: vk::Format,\n hal_usage: hal::TextureUses,\n },\n\n \n Count(Option<usize>),\n}\n\npub struct SwapchainCreateInfo {\n usage: sys::SwapchainUsageFlags,\n format: TextureFormat,\n sample_count: u32,\n width: u32,\n height: u32,\n texture_type: TextureType,\n mip_count: u32,\n}\n\nimpl Compositor {\n \n pub fn create_swapchain(\n &self,\n data: SwapchainCreateData,\n info: SwapchainCreateInfo,\n ) -> StrResult<Swapchain> {\n let wgpu_usage = {\n let mut wgpu_usage = TextureUsages::TEXTURE_BINDING; \n\n if info\n .usage\n .contains(sys::SwapchainUsageFlags::COLOR_ATTACHMENT)\n {\n wgpu_usage |= TextureUsages::RENDER_ATTACHMENT;\n }\n if info\n .usage\n .contains(sys::SwapchainUsageFlags::DEPTH_STENCIL_ATTACHMENT)\n {\n wgpu_usage |= TextureUsages::RENDER_ATTACHMENT;\n }\n if info.usage.contains(sys::SwapchainUsageFlags::TRANSFER_SRC) {\n wgpu_usage |= TextureUsages::COPY_SRC;\n }\n if info.usage.contains(sys::SwapchainUsageFlags::TRANSFER_DST) {\n wgpu_usage |= TextureUsages::COPY_DST;\n }\n\n \n \n \n \n \n \n\n wgpu_usage\n };\n\n let depth_or_array_layers = match info.texture_type {\n TextureType::D2 { array_size } => array_size,\n TextureType::Cubemap => 6,\n };\n\n let texture_descriptor = TextureDescriptor {\n label: None,\n size: Extent3d {\n width: info.width,\n height: info.height,\n depth_or_array_layers,\n },\n mip_level_count: info.mip_count,\n sample_count: info.sample_count,\n dimension: TextureDimension::D2,\n format: info.format,\n usage: wgpu_usage,\n };\n\n let textures = match data {\n #[cfg(target_os = \"linux\")]\n SwapchainCreateData::External {\n images,\n vk_usage,\n vk_format,\n hal_usage,\n } => images\n .into_iter()\n .map(|vk_image| {\n let hal_texture = unsafe {\n <hal::api::Vulkan as hal::Api>::Device::texture_from_raw(\n vk_image,\n &hal::TextureDescriptor {\n label: None,\n size: Extent3d {\n width,\n height,\n depth_or_array_layers: array_size,\n },\n mip_level_count: mip_count,\n sample_count,\n dimension: TextureDimension::D2,\n format,\n usage: hal_usage,\n memory_flags: hal::MemoryFlags::empty(),\n },\n None,\n )\n };\n\n unsafe {\n self.context\n .device\n .create_texture_from_hal::<hal::api::Vulkan>(\n hal_texture,\n &texture_descriptor,\n )\n }\n })\n .collect(),\n SwapchainCreateData::Count(count) => (0..count.unwrap_or(2))\n .map(|_| self.context.device.create_texture(&texture_descriptor))\n .collect(),\n };\n\n let array_size = match info.texture_type {\n TextureType::D2 { array_size } => array_size,\n TextureType::Cubemap => 1, \n };\n\n Ok(self.inner_create_swapchain(textures, array_size))\n }\n}\n\n#[cfg(not(target_os = \"macos\"))]\npub fn to_vulkan_images(textures: &[Texture]) -> Vec<vk::Image> {\n textures\n .iter()\n .map(|tex| unsafe {\n let hal_texture = tex.as_hal::<hal::api::Vulkan>();\n hal_texture.as_inner().unwrap().raw_handle()\n })\n .collect()\n}\n"},"prefix":{"kind":"string","value":"use super::{Compositor, Context, Swapchain, TextureType};\nuse alvr_common::prelude::*;\nuse ash::{extensions::khr, vk};\nuse openxr_sys as sys;\nuse std::{ffi::CStr, slice};\nuse wgpu::{\n DeviceDescriptor, Extent3d, Features, Texture, TextureDescriptor, TextureDimension,\n TextureFormat, TextureUsages,\n};\nuse wgpu_hal as hal;\n\npub const TARGET_VULKAN_VERSION: u32 = vk::make_api_version(1, 0, 0, 0);\n\npub fn get_vulkan_instance_extensions(\n entry: &ash::Entry,\n version: u32,\n) -> StrResult<Vec<&'static CStr>> {\n let mut flags = hal::InstanceFlags::empty();\n if cfg!(debug_assertions) {\n flags |= hal::InstanceFlags::VALIDATION;\n flags |= hal::InstanceFlags::DEBUG;\n }\n\n trace_err!(<hal::api::Vulkan as hal::Api>::Instance::required_extensions(entry, version, flags))\n}\n\npub fn create_vulkan_instance(\n entry: &ash::Entry,\n info: &vk::InstanceCreateInfo,\n) -> StrResult<ash::Instance> {\n let mut extensions_ptrs =\n get_vulkan_instance_extensions(entry, unsafe { (*info.p_application_info).api_version })?\n .iter()\n .map(|x| x.as_ptr())\n .collect::<Vec<_>>();\n\n extensions_ptrs.extend_from_slice(unsafe {\n slice::from_raw_parts(\n info.pp_enabled_extension_names,\n info.enabled_extension_count as _,\n )\n });\n\n unsafe {\n trace_err!(entry.create_instance(\n &vk::InstanceCreateInfo {\n enabled_extension_count: extensions_ptrs.len() as _,\n pp_enabled_extension_names: extensions_ptrs.as_ptr(),\n ..*info\n },\n None,\n ))\n }\n}\n\npub fn get_vulkan_graphics_device(\n instance: &ash::Instance,\n adapter_index: Option<usize>,\n) -> StrResult<vk::PhysicalDevice> {\n let mut physical_devices = unsafe { trace_err!(instance.enumerate_physical_devices())? };\n\n Ok(physical_devices.remove(adapter_index.unwrap_or(0)))\n}\n\npub fn get_vulkan_device_extensions(version: u32) -> Vec<&'static CStr> {\n let mut extensions = vec![khr::Swapchain::name()];\n\n if version < vk::API_VERSION_1_1 {\n extensions.push(vk::KhrMaintenance1Fn::name());\n extensions.push(vk::KhrMaintenance2Fn::name());\n }\n\n extensions\n}\n\npub fn create_vulkan_device(\n entry: &ash::Entry,\n version: u32,\n instance: &ash::Instance,\n physical_device: vk::PhysicalDevice,\n create_info: &vk::DeviceCreateInfo,\n) -> StrResult<ash::Device> {\n let mut extensions_ptrs = get_vulkan_device_extensions(version)\n .iter()\n .map(|x| x.as_ptr())\n .collect::<Vec<_>>();\n\n extensions_ptrs.extend_from_slice(unsafe {\n slice::from_raw_parts(\n create_info.pp_enabled_extension_names,\n create_info.enabled_extension_count as _,\n )\n });\n\n let mut features = if !create_info.p_enabled_features.is_null() {\n unsafe { *create_info.p_enabled_features }\n } else {\n vk::PhysicalDeviceFeatures::default()\n };\n features.robust_buffer_access = true as _;\n features.independent_blend = true as _;\n features.sample_rate_shading = true as _;\n\n unsafe {\n trace_err!(instance.create_device(\n physical_device,\n &vk::DeviceCreateInfo {\n enabled_extension_count: extensions_ptrs.len() as _,\n pp_enabled_extension_names: extensions_ptrs.as_ptr(),\n p_enabled_features: &features as *const _,\n ..*create_info\n },\n None\n ))\n }\n}\n\nimpl Context {\n \n \n \n "},"suffix":{"kind":"string","value":"\n\n \n pub fn new(adapter_index: Option<usize>) -> StrResult<Self> {\n let entry = unsafe { trace_err!(ash::Entry::new())? };\n\n let vk_instance = trace_err!(create_vulkan_instance(\n &entry,\n &vk::InstanceCreateInfo::builder()\n .application_info(\n &vk::ApplicationInfo::builder().api_version(TARGET_VULKAN_VERSION)\n )\n .build()\n ))?;\n\n let physical_device = get_vulkan_graphics_device(&vk_instance, adapter_index)?;\n\n let queue_family_index = unsafe {\n vk_instance\n .get_physical_device_queue_family_properties(physical_device)\n .into_iter()\n .enumerate()\n .find_map(|(queue_family_index, info)| {\n if info.queue_flags.contains(vk::QueueFlags::GRAPHICS) {\n Some(queue_family_index as u32)\n } else {\n None\n }\n })\n .unwrap()\n };\n let queue_index = 0;\n\n let vk_device = trace_err!(create_vulkan_device(\n &entry,\n TARGET_VULKAN_VERSION,\n &vk_instance,\n physical_device,\n &vk::DeviceCreateInfo::builder().queue_create_infos(&[\n vk::DeviceQueueCreateInfo::builder()\n .queue_family_index(queue_family_index)\n .queue_priorities(&[1.0])\n .build()\n ])\n ))?;\n\n Self::from_vulkan(\n true,\n entry,\n TARGET_VULKAN_VERSION,\n vk_instance,\n adapter_index,\n vk_device,\n queue_family_index,\n queue_index,\n )\n }\n}\n\npub enum SwapchainCreateData {\n \n #[cfg(target_os = \"linux\")]\n External {\n images: Vec<vk::Image>,\n vk_usage: vk::ImageUsageFlags,\n vk_format: vk::Format,\n hal_usage: hal::TextureUses,\n },\n\n \n Count(Option<usize>),\n}\n\npub struct SwapchainCreateInfo {\n usage: sys::SwapchainUsageFlags,\n format: TextureFormat,\n sample_count: u32,\n width: u32,\n height: u32,\n texture_type: TextureType,\n mip_count: u32,\n}\n\nimpl Compositor {\n \n pub fn create_swapchain(\n &self,\n data: SwapchainCreateData,\n info: SwapchainCreateInfo,\n ) -> StrResult<Swapchain> {\n let wgpu_usage = {\n let mut wgpu_usage = TextureUsages::TEXTURE_BINDING; \n\n if info\n .usage\n .contains(sys::SwapchainUsageFlags::COLOR_ATTACHMENT)\n {\n wgpu_usage |= TextureUsages::RENDER_ATTACHMENT;\n }\n if info\n .usage\n .contains(sys::SwapchainUsageFlags::DEPTH_STENCIL_ATTACHMENT)\n {\n wgpu_usage |= TextureUsages::RENDER_ATTACHMENT;\n }\n if info.usage.contains(sys::SwapchainUsageFlags::TRANSFER_SRC) {\n wgpu_usage |= TextureUsages::COPY_SRC;\n }\n if info.usage.contains(sys::SwapchainUsageFlags::TRANSFER_DST) {\n wgpu_usage |= TextureUsages::COPY_DST;\n }\n\n \n \n \n \n \n \n\n wgpu_usage\n };\n\n let depth_or_array_layers = match info.texture_type {\n TextureType::D2 { array_size } => array_size,\n TextureType::Cubemap => 6,\n };\n\n let texture_descriptor = TextureDescriptor {\n label: None,\n size: Extent3d {\n width: info.width,\n height: info.height,\n depth_or_array_layers,\n },\n mip_level_count: info.mip_count,\n sample_count: info.sample_count,\n dimension: TextureDimension::D2,\n format: info.format,\n usage: wgpu_usage,\n };\n\n let textures = match data {\n #[cfg(target_os = \"linux\")]\n SwapchainCreateData::External {\n images,\n vk_usage,\n vk_format,\n hal_usage,\n } => images\n .into_iter()\n .map(|vk_image| {\n let hal_texture = unsafe {\n <hal::api::Vulkan as hal::Api>::Device::texture_from_raw(\n vk_image,\n &hal::TextureDescriptor {\n label: None,\n size: Extent3d {\n width,\n height,\n depth_or_array_layers: array_size,\n },\n mip_level_count: mip_count,\n sample_count,\n dimension: TextureDimension::D2,\n format,\n usage: hal_usage,\n memory_flags: hal::MemoryFlags::empty(),\n },\n None,\n )\n };\n\n unsafe {\n self.context\n .device\n .create_texture_from_hal::<hal::api::Vulkan>(\n hal_texture,\n &texture_descriptor,\n )\n }\n })\n .collect(),\n SwapchainCreateData::Count(count) => (0..count.unwrap_or(2))\n .map(|_| self.context.device.create_texture(&texture_descriptor))\n .collect(),\n };\n\n let array_size = match info.texture_type {\n TextureType::D2 { array_size } => array_size,\n TextureType::Cubemap => 1, \n };\n\n Ok(self.inner_create_swapchain(textures, array_size))\n }\n}\n\n#[cfg(not(target_os = \"macos\"))]\npub fn to_vulkan_images(textures: &[Texture]) -> Vec<vk::Image> {\n textures\n .iter()\n .map(|tex| unsafe {\n let hal_texture = tex.as_hal::<hal::api::Vulkan>();\n hal_texture.as_inner().unwrap().raw_handle()\n })\n .collect()\n}\n"},"middle":{"kind":"string","value":"pub fn from_vulkan(\n owned: bool, \n entry: ash::Entry,\n version: u32,\n vk_instance: ash::Instance,\n adapter_index: Option<usize>,\n vk_device: ash::Device,\n queue_family_index: u32,\n queue_index: u32,\n ) -> StrResult<Self> {\n let mut flags = hal::InstanceFlags::empty();\n if cfg!(debug_assertions) {\n flags |= hal::InstanceFlags::VALIDATION;\n flags |= hal::InstanceFlags::DEBUG;\n };\n\n let extensions = get_vulkan_instance_extensions(&entry, version)?;\n\n let instance = unsafe {\n trace_err!(<hal::api::Vulkan as hal::Api>::Instance::from_raw(\n entry,\n vk_instance.clone(),\n version,\n extensions,\n flags,\n owned.then(|| Box::new(()) as _)\n ))?\n };\n\n let physical_device = get_vulkan_graphics_device(&vk_instance, adapter_index)?;\n let exposed_adapter = trace_none!(instance.expose_adapter(physical_device))?;\n\n let open_device = unsafe {\n trace_err!(exposed_adapter.adapter.device_from_raw(\n vk_device,\n owned,\n &get_vulkan_device_extensions(version),\n queue_family_index,\n queue_index,\n ))?\n };\n\n #[cfg(not(target_os = \"macos\"))]\n {\n let instance = unsafe { wgpu::Instance::from_hal::<hal::api::Vulkan>(instance) };\n let adapter = unsafe { instance.create_adapter_from_hal(exposed_adapter) };\n let (device, queue) = unsafe {\n trace_err!(adapter.create_device_from_hal(\n open_device,\n &DeviceDescriptor {\n label: None,\n features: Features::PUSH_CONSTANTS,\n limits: adapter.limits(),\n },\n None,\n ))?\n };\n\n Ok(Self {\n instance,\n device,\n queue,\n })\n }\n\n #[cfg(target_os = \"macos\")]\n unimplemented!()\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[cfg(target_os = \"macos\")]\n\npub fn get_screen_size() -> StrResult<(u32, u32)> {\n\n Ok((0, 0))\n\n}\n","file_path":"alvr/server/src/graphics_info.rs","rank":0,"score":257298.96087876664},{"content":"pub fn version() -> String {\n\n let manifest_path = packages_dir().join(\"common\").join(\"Cargo.toml\");\n\n println!(\"cargo:rerun-if-changed={}\", manifest_path.to_string_lossy());\n\n\n\n let manifest = fs::read_to_string(manifest_path).unwrap();\n\n let (_, version, _) = split_string(&manifest, \"version = \\\"\", '\\\"');\n\n\n\n version\n\n}\n\n\n","file_path":"alvr/xtask/src/version.rs","rank":1,"score":240856.36824349643},{"content":"// accept semver-compatible versions\n\n// Note: by not having to set the requirement manually, the major version is constrained to be\n\n// bumped when the packet layouts or some critical behaviour has changed.\n\npub fn is_version_compatible(other_version: &Version) -> bool {\n\n if other_version.pre != Prerelease::EMPTY\n\n || other_version.build != BuildMetadata::EMPTY\n\n || ALVR_VERSION.pre != Prerelease::EMPTY\n\n || ALVR_VERSION.build != BuildMetadata::EMPTY\n\n {\n\n *other_version == *ALVR_VERSION\n\n } else {\n\n other_version.major == ALVR_VERSION.major\n\n }\n\n}\n","file_path":"alvr/common/src/lib.rs","rank":4,"score":219467.88912240913},{"content":"// Due to the nature of immediate mode GUIs, the parent containers cannot conditionally render based\n\n// on the presence of the child container, so it is the child responsibility to format the container\n\npub fn container<R>(ui: &mut Ui, content: impl FnOnce(&mut Ui) -> R) -> R {\n\n ui.horizontal(|ui| {\n\n // Indentation\n\n ui.add_space(20_f32);\n\n\n\n content(ui)\n\n })\n\n .inner\n\n}\n\n\n","file_path":"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs","rank":5,"score":218722.87541870566},{"content":"fn get_slicing_layout(combined_size: (u32, u32), slice_count: usize) -> SlicingLayout {\n\n // only 1 or 2 slices are handled for now.\n\n // todo: port complete algorithm from zarik5/bridgevr-dev. It can also split vertically after\n\n // a certain slice count.\n\n if slice_count == 1 {\n\n SlicingLayout {\n\n slice_width: combined_size.0 as i32,\n\n slice_height: combined_size.1 as i32,\n\n columns: 1,\n\n }\n\n } else if slice_count == 2 {\n\n SlicingLayout {\n\n slice_width: combined_size.0 as i32 / 2,\n\n slice_height: combined_size.1 as i32,\n\n columns: 2,\n\n }\n\n } else {\n\n unimplemented!()\n\n }\n\n}\n\n\n","file_path":"alvr/experiments/graphics_tests/src/compositor/slicing.rs","rank":6,"score":201438.3457479465},{"content":"pub fn bump_version(maybe_version: Option<String>, is_nightly: bool) {\n\n let mut version = maybe_version.unwrap_or_else(version);\n\n\n\n if is_nightly {\n\n version = format!(\"{}+nightly.{}\", version, date_utc_yyyymmdd());\n\n }\n\n\n\n for dir_name in [\n\n \"audio\",\n\n \"client\",\n\n \"commands\",\n\n \"common\",\n\n \"filesystem\",\n\n \"launcher\",\n\n \"server\",\n\n \"session\",\n\n \"sockets\",\n\n \"vrcompositor-wrapper\",\n\n \"vulkan-layer\",\n\n \"xtask\",\n\n ] {\n\n bump_cargo_version(dir_name, &version);\n\n }\n\n bump_client_gradle_version(&version, is_nightly);\n\n bump_rpm_spec_version(&version, is_nightly);\n\n\n\n println!(\"Git tag:\\nv{}\", version);\n\n}\n","file_path":"alvr/xtask/src/version.rs","rank":9,"score":187001.29563533718},{"content":"pub fn switch(ui: &mut Ui, on: &mut bool) -> Response {\n\n let desired_size = ui.spacing().interact_size.y * egui::vec2(2.0, 1.0);\n\n let (rect, mut response) = ui.allocate_exact_size(desired_size, Sense::click());\n\n if response.clicked() {\n\n *on = !*on;\n\n response.mark_changed();\n\n }\n\n response.widget_info(|| WidgetInfo::selected(WidgetType::Checkbox, *on, \"\"));\n\n\n\n let how_on = ui.ctx().animate_bool(response.id, *on);\n\n let visuals = ui.style().interact_selectable(&response, *on);\n\n let rect = rect.expand(visuals.expansion);\n\n let radius = 0.5 * rect.height();\n\n ui.painter()\n\n .rect(rect, radius, visuals.bg_fill, visuals.bg_stroke);\n\n let circle_x = egui::lerp((rect.left() + radius)..=(rect.right() - radius), how_on);\n\n let center = egui::pos2(circle_x, rect.center().y);\n\n ui.painter()\n\n .circle(center, 0.75 * radius, visuals.bg_fill, visuals.fg_stroke);\n\n\n\n response\n\n}\n","file_path":"alvr/experiments/gui/src/dashboard/basic_components/switch.rs","rank":10,"score":182919.45346687204},{"content":"pub fn get_gpu_names() -> Vec<String> {\n\n let instance = wgpu::Instance::new(wgpu::Backends::PRIMARY);\n\n let adapters = instance.enumerate_adapters(wgpu::Backends::PRIMARY);\n\n\n\n adapters\n\n .into_iter()\n\n .map(|a| a.get_info().name)\n\n .collect::<Vec<_>>()\n\n}\n\n\n","file_path":"alvr/server/src/graphics_info.rs","rank":11,"score":180557.1695782548},{"content":"pub fn get_sample_rate(device: &AudioDevice) -> StrResult<u32> {\n\n let maybe_config_range = trace_err!(device.inner.supported_output_configs())?.next();\n\n let config = if let Some(config) = maybe_config_range {\n\n config\n\n } else {\n\n trace_none!(trace_err!(device.inner.supported_input_configs())?.next())?\n\n };\n\n\n\n // Assumption: device is in shared mode: this means that there is one and fixed sample rate,\n\n // format and channel count\n\n Ok(config.min_sample_rate().0)\n\n}\n\n\n\npub async fn record_audio_loop(\n\n device: AudioDevice,\n\n channels_count: u16,\n\n sample_rate: u32,\n\n #[cfg_attr(not(windows), allow(unused_variables))] mute: bool,\n\n mut sender: StreamSender<(), AUDIO>,\n\n) -> StrResult {\n","file_path":"alvr/audio/src/lib.rs","rank":12,"score":175072.71442853057},{"content":"// this will not kill the child process \"ALVR launcher\"\n\npub fn kill_steamvr() {\n\n let mut system = System::new_with_specifics(RefreshKind::new().with_processes());\n\n system.refresh_processes();\n\n\n\n // first kill vrmonitor, then kill vrserver if it is hung.\n\n\n\n for process in system.process_by_name(&afs::exec_fname(\"vrmonitor\")) {\n\n #[cfg(not(windows))]\n\n process.kill(sysinfo::Signal::Term);\n\n #[cfg(windows)]\n\n kill_process(process.pid());\n\n }\n\n\n\n thread::sleep(Duration::from_secs(1));\n\n\n\n for process in system.process_by_name(&afs::exec_fname(\"vrserver\")) {\n\n #[cfg(not(windows))]\n\n process.kill(sysinfo::Signal::Term);\n\n #[cfg(windows)]\n\n kill_process(process.pid());\n\n }\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":13,"score":159241.67555424006},{"content":"pub fn fix_steamvr() {\n\n // If ALVR driver does not start use a more destructive approach: delete openvrpaths.vrpath then recreate it\n\n if let Ok(path) = alvr_commands::openvr_source_file_path() {\n\n fs::remove_file(path).ok();\n\n\n\n maybe_launch_steamvr();\n\n thread::sleep(Duration::from_secs(5));\n\n kill_steamvr();\n\n thread::sleep(Duration::from_secs(5));\n\n }\n\n\n\n unblock_alvr_addon().ok();\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":14,"score":159241.67555424006},{"content":"pub fn build_server(\n\n is_release: bool,\n\n experiements: bool,\n\n fetch_crates: bool,\n\n bundle_ffmpeg: bool,\n\n root: Option<String>,\n\n) {\n\n // Always use CustomRoot for contructing the build directory. The actual runtime layout is respected\n\n let layout = Layout::new(&afs::server_build_dir());\n\n\n\n let build_type = if is_release { \"release\" } else { \"debug\" };\n\n let build_flag = if is_release { \"--release\" } else { \"\" };\n\n\n\n let mut server_features: Vec<&str> = vec![];\n\n let mut launcher_features: Vec<&str> = vec![];\n\n\n\n if bundle_ffmpeg {\n\n server_features.push(\"bundled_ffmpeg\");\n\n }\n\n if server_features.is_empty() {\n","file_path":"alvr/xtask/src/main.rs","rank":15,"score":159241.67555424006},{"content":"pub fn shutdown_runtime() {\n\n if let Some(window) = MAYBE_WINDOW.lock().take() {\n\n window.close();\n\n }\n\n\n\n SHUTDOWN_NOTIFIER.notify_waiters();\n\n\n\n if let Some(runtime) = MAYBE_RUNTIME.lock().take() {\n\n runtime.shutdown_background();\n\n // shutdown_background() is non blocking and it does not guarantee that every internal\n\n // thread is terminated in a timely manner. Using shutdown_background() instead of just\n\n // dropping the runtime has the benefit of giving SteamVR a chance to clean itself as\n\n // much as possible before the process is killed because of alvr_launcher timeout.\n\n }\n\n}\n\n\n","file_path":"alvr/server/src/lib.rs","rank":16,"score":159241.67555424006},{"content":"pub fn invoke_installer() {\n\n try_close_steamvr_gracefully();\n\n\n\n spawn_no_window(Command::new(afs::installer_path()).arg(\"-q\"));\n\n\n\n // delete crash_log.txt (take advantage of the occasion to do some routine cleaning)\n\n fs::remove_file(\n\n afs::filesystem_layout_from_launcher_exe(&env::current_exe().unwrap()).crash_log(),\n\n )\n\n .ok();\n\n}\n","file_path":"alvr/launcher/src/commands.rs","rank":17,"score":159241.67555424006},{"content":"pub fn restart_steamvr() {\n\n try_close_steamvr_gracefully();\n\n\n\n if logging::show_err(maybe_register_alvr_driver()).is_some() {\n\n maybe_launch_steamvr();\n\n }\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":18,"score":159241.67555424006},{"content":"// todo: use a custom widget\n\npub fn button_group_clicked(ui: &mut Ui, options: &[LocalizedId], selection: &mut String) -> bool {\n\n let mut clicked = false;\n\n for id in options {\n\n if ui\n\n .selectable_value(selection, (**id).clone(), &id.trans)\n\n .clicked()\n\n {\n\n *selection = (**id).to_owned();\n\n clicked = true;\n\n }\n\n }\n\n\n\n clicked\n\n}\n","file_path":"alvr/experiments/gui/src/dashboard/basic_components/button_group.rs","rank":19,"score":159097.75513158803},{"content":"pub fn align_to_32(size: (i32, i32)) -> (i32, i32) {\n\n (\n\n (size.0 as f32 / 32_f32).ceil() as i32 * 32,\n\n (size.1 as f32 / 32_f32).ceil() as i32 * 32,\n\n )\n\n}\n\n\n\npub enum AlignmentDirection {\n\n Input,\n\n Output,\n\n}\n\n\n\n// Merge k slices then split the result into n slices\n\n// Slices are assumed to be packed and unpacked by this same pass, following a particular layout\n\n// determined by the number of slices and the shape of the reconstructed frame.\n\npub struct SlicingPass {\n\n inputs: Vec<TextureView>,\n\n pipeline: RenderPipeline,\n\n bind_group: BindGroup,\n\n input_slicing_layout: SlicingLayout,\n","file_path":"alvr/experiments/graphics_tests/src/compositor/slicing.rs","rank":20,"score":158588.86499340297},{"content":"pub fn remove_build_dir() {\n\n let build_dir = afs::build_dir();\n\n fs::remove_dir_all(&build_dir).ok();\n\n}\n\n\n","file_path":"alvr/xtask/src/main.rs","rank":21,"score":156026.95611729805},{"content":"pub fn notify_application_update() {\n\n notify_shutdown_driver();\n\n\n\n alvr_commands::invoke_application_update(&FILESYSTEM_LAYOUT.launcher_exe()).ok();\n\n}\n\n\n\npub enum ClientListAction {\n\n AddIfMissing { display_name: String },\n\n TrustAndMaybeAddIp(Option<IpAddr>),\n\n RemoveIpOrEntry(Option<IpAddr>),\n\n}\n\n\n\npub async fn update_client_list(hostname: String, action: ClientListAction) {\n\n let mut client_connections = SESSION_MANAGER.lock().get().client_connections.clone();\n\n\n\n let maybe_client_entry = client_connections.entry(hostname);\n\n\n\n let mut updated = false;\n\n match action {\n\n ClientListAction::AddIfMissing { display_name } => {\n","file_path":"alvr/server/src/lib.rs","rank":22,"score":156026.95611729805},{"content":"pub fn notify_shutdown_driver() {\n\n thread::spawn(|| {\n\n RESTART_NOTIFIER.notify_waiters();\n\n\n\n // give time to the control loop to send the restart packet (not crucial)\n\n thread::sleep(Duration::from_millis(100));\n\n\n\n shutdown_runtime();\n\n\n\n unsafe { ShutdownSteamvr() };\n\n });\n\n}\n\n\n","file_path":"alvr/server/src/lib.rs","rank":23,"score":156026.95611729805},{"content":"// Avoid Oculus link popups when debugging the client\n\npub fn kill_oculus_processes() {\n\n command::run_without_shell(\n\n \"powershell\",\n\n &[\n\n \"Start-Process\",\n\n \"taskkill\",\n\n \"-ArgumentList\",\n\n \"\\\"/F /IM OVR* /T\\\"\",\n\n \"-Verb\",\n\n \"runAs\",\n\n ],\n\n )\n\n .unwrap();\n\n}\n\n\n","file_path":"alvr/xtask/src/main.rs","rank":24,"score":156026.95611729805},{"content":"pub fn maybe_launch_steamvr() {\n\n let mut system = System::new_with_specifics(RefreshKind::new().with_processes());\n\n system.refresh_processes();\n\n\n\n if system\n\n .process_by_name(&afs::exec_fname(\"vrserver\"))\n\n .is_empty()\n\n {\n\n #[cfg(windows)]\n\n spawn_no_window(Command::new(\"cmd\").args(&[\"/C\", \"start\", \"steam://rungameid/250820\"]));\n\n #[cfg(not(windows))]\n\n spawn_no_window(Command::new(\"steam\").args(&[\"steam://rungameid/250820\"]));\n\n }\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":25,"score":156026.95611729805},{"content":"pub fn init_logging() {\n\n #[cfg(target_os = \"android\")]\n\n android_logger::init_once(\n\n android_logger::Config::default()\n\n .with_tag(\"[ALVR NATIVE-RUST]\")\n\n .with_min_level(log::Level::Info),\n\n );\n\n\n\n alvr_common::logging::set_panic_hook();\n\n}\n","file_path":"alvr/client/src/logging_backend.rs","rank":26,"score":156026.95611729805},{"content":"pub fn notify_restart_driver() {\n\n notify_shutdown_driver();\n\n\n\n alvr_commands::restart_steamvr(&FILESYSTEM_LAYOUT.launcher_exe()).ok();\n\n}\n\n\n","file_path":"alvr/server/src/lib.rs","rank":27,"score":156026.95611729805},{"content":"pub fn set_panic_hook() {\n\n std::panic::set_hook(Box::new(|panic_info| {\n\n let message = panic_info\n\n .payload()\n\n .downcast_ref::<&str>()\n\n .unwrap_or(&\"Unavailable\");\n\n let err_str = format!(\n\n \"Message: {:?}\\nBacktrace:\\n{:?}\",\n\n message,\n\n backtrace::Backtrace::new()\n\n );\n\n\n\n log::error!(\"{}\", err_str);\n\n\n\n #[cfg(windows)]\n\n std::thread::spawn(move || {\n\n msgbox::create(\"ALVR panicked\", &err_str, msgbox::IconType::Error).ok();\n\n });\n\n }))\n\n}\n\n\n","file_path":"alvr/common/src/logging.rs","rank":28,"score":156026.95611729805},{"content":"#[inline]\n\npub fn get_next_frame_batch(\n\n sample_buffer: &mut VecDeque<f32>,\n\n channels_count: usize,\n\n batch_frames_count: usize,\n\n) -> Vec<f32> {\n\n if sample_buffer.len() / channels_count >= batch_frames_count {\n\n let mut batch = sample_buffer\n\n .drain(0..batch_frames_count * channels_count)\n\n .collect::<Vec<_>>();\n\n\n\n if sample_buffer.len() / channels_count < batch_frames_count {\n\n // Render fade-out. It is completely contained in the current batch\n\n for f in 0..batch_frames_count {\n\n let volume = 1. - f as f32 / batch_frames_count as f32;\n\n for c in 0..channels_count {\n\n batch[f * channels_count + c] *= volume;\n\n }\n\n }\n\n }\n\n // fade-ins and cross-fades are rendered in the receive loop directly inside sample_buffer.\n","file_path":"alvr/audio/src/lib.rs","rank":29,"score":152997.22454900946},{"content":" enum class FormatFeatureFlagBits : VkFormatFeatureFlags\n\n {\n\n eSampledImage = VK_FORMAT_FEATURE_SAMPLED_IMAGE_BIT,\n\n eStorageImage = VK_FORMAT_FEATURE_STORAGE_IMAGE_BIT,\n\n eStorageImageAtomic = VK_FORMAT_FEATURE_STORAGE_IMAGE_ATOMIC_BIT,\n\n eUniformTexelBuffer = VK_FORMAT_FEATURE_UNIFORM_TEXEL_BUFFER_BIT,\n\n eStorageTexelBuffer = VK_FORMAT_FEATURE_STORAGE_TEXEL_BUFFER_BIT,\n\n eStorageTexelBufferAtomic = VK_FORMAT_FEATURE_STORAGE_TEXEL_BUFFER_ATOMIC_BIT,\n\n eVertexBuffer = VK_FORMAT_FEATURE_VERTEX_BUFFER_BIT,\n\n eColorAttachment = VK_FORMAT_FEATURE_COLOR_ATTACHMENT_BIT,\n\n eColorAttachmentBlend = VK_FORMAT_FEATURE_COLOR_ATTACHMENT_BLEND_BIT,\n\n eDepthStencilAttachment = VK_FORMAT_FEATURE_DEPTH_STENCIL_ATTACHMENT_BIT,\n\n eBlitSrc = VK_FORMAT_FEATURE_BLIT_SRC_BIT,\n\n eBlitDst = VK_FORMAT_FEATURE_BLIT_DST_BIT,\n\n eSampledImageFilterLinear = VK_FORMAT_FEATURE_SAMPLED_IMAGE_FILTER_LINEAR_BIT,\n\n eTransferSrc = VK_FORMAT_FEATURE_TRANSFER_SRC_BIT,\n\n eTransferDst = VK_FORMAT_FEATURE_TRANSFER_DST_BIT,\n\n eMidpointChromaSamples = VK_FORMAT_FEATURE_MIDPOINT_CHROMA_SAMPLES_BIT,\n\n eSampledImageYcbcrConversionLinearFilter = VK_FORMAT_FEATURE_SAMPLED_IMAGE_YCBCR_CONVERSION_LINEAR_FILTER_BIT,\n\n eSampledImageYcbcrConversionSeparateReconstructionFilter = VK_FORMAT_FEATURE_SAMPLED_IMAGE_YCBCR_CONVERSION_SEPARATE_RECONSTRUCTION_FILTER_BIT,\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":30,"score":152430.37030454513},{"content":" enum class SubgroupFeatureFlagBits : VkSubgroupFeatureFlags\n\n {\n\n eBasic = VK_SUBGROUP_FEATURE_BASIC_BIT,\n\n eVote = VK_SUBGROUP_FEATURE_VOTE_BIT,\n\n eArithmetic = VK_SUBGROUP_FEATURE_ARITHMETIC_BIT,\n\n eBallot = VK_SUBGROUP_FEATURE_BALLOT_BIT,\n\n eShuffle = VK_SUBGROUP_FEATURE_SHUFFLE_BIT,\n\n eShuffleRelative = VK_SUBGROUP_FEATURE_SHUFFLE_RELATIVE_BIT,\n\n eClustered = VK_SUBGROUP_FEATURE_CLUSTERED_BIT,\n\n eQuad = VK_SUBGROUP_FEATURE_QUAD_BIT,\n\n ePartitionedNV = VK_SUBGROUP_FEATURE_PARTITIONED_BIT_NV};\n\n\n\n VULKAN_HPP_INLINE std::string to_string( SubgroupFeatureFlagBits value )\n\n {\n\n switch ( value )\n\n {\n\n case SubgroupFeatureFlagBits::eBasic : return \"Basic\";\n\n case SubgroupFeatureFlagBits::eVote : return \"Vote\";\n\n case SubgroupFeatureFlagBits::eArithmetic : return \"Arithmetic\";\n\n case SubgroupFeatureFlagBits::eBallot : return \"Ballot\";\n\n case SubgroupFeatureFlagBits::eShuffle : return \"Shuffle\";\n\n case SubgroupFeatureFlagBits::eShuffleRelative : return \"ShuffleRelative\";\n\n case SubgroupFeatureFlagBits::eClustered : return \"Clustered\";\n\n case SubgroupFeatureFlagBits::eQuad : return \"Quad\";\n\n case SubgroupFeatureFlagBits::ePartitionedNV : return \"PartitionedNV\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":31,"score":152430.37030454513},{"content":"pub fn modal(\n\n ui: &mut Ui,\n\n title: &str,\n\n content: impl FnOnce(&mut Ui, f32), // arg 2: available width\n\n do_not_show_again: Option<&mut bool>,\n\n visible: &mut bool,\n\n t: &SharedTranslation,\n\n) -> Option<ModalResponse> {\n\n let mut response = None;\n\n if *visible {\n\n Window::new(title)\n\n .collapsible(false)\n\n .resizable(false)\n\n .default_width(200_f32)\n\n .anchor(Align2::CENTER_CENTER, (0_f32, 0_f32))\n\n .show(ui.ctx(), |ui| {\n\n ui.vertical_centered_justified(|ui| {\n\n ui.add_space(10_f32);\n\n content(ui, ui.available_width() - 8_f32); // extra offset to avoid window resizing. todo: find origin\n\n ui.add_space(10_f32);\n","file_path":"alvr/experiments/gui/src/dashboard/basic_components/modal.rs","rank":32,"score":150136.9599979623},{"content":" enum class GeometryInstanceFlagBitsKHR : VkGeometryInstanceFlagsKHR\n\n {\n\n eTriangleFacingCullDisable = VK_GEOMETRY_INSTANCE_TRIANGLE_FACING_CULL_DISABLE_BIT_KHR,\n\n eTriangleFrontCounterclockwise = VK_GEOMETRY_INSTANCE_TRIANGLE_FRONT_COUNTERCLOCKWISE_BIT_KHR,\n\n eForceOpaque = VK_GEOMETRY_INSTANCE_FORCE_OPAQUE_BIT_KHR,\n\n eForceNoOpaque = VK_GEOMETRY_INSTANCE_FORCE_NO_OPAQUE_BIT_KHR,\n\n eTriangleCullDisable = VK_GEOMETRY_INSTANCE_TRIANGLE_CULL_DISABLE_BIT_NV};\n\n using GeometryInstanceFlagBitsNV = GeometryInstanceFlagBitsKHR;\n\n\n\n VULKAN_HPP_INLINE std::string to_string( GeometryInstanceFlagBitsKHR value )\n\n {\n\n switch ( value )\n\n {\n\n case GeometryInstanceFlagBitsKHR::eTriangleFacingCullDisable : return \"TriangleFacingCullDisable\";\n\n case GeometryInstanceFlagBitsKHR::eTriangleFrontCounterclockwise : return \"TriangleFrontCounterclockwise\";\n\n case GeometryInstanceFlagBitsKHR::eForceOpaque : return \"ForceOpaque\";\n\n case GeometryInstanceFlagBitsKHR::eForceNoOpaque : return \"ForceNoOpaque\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":34,"score":147270.0403577539},{"content":" enum class ExternalSemaphoreFeatureFlagBits : VkExternalSemaphoreFeatureFlags\n\n {\n\n eExportable = VK_EXTERNAL_SEMAPHORE_FEATURE_EXPORTABLE_BIT,\n\n eImportable = VK_EXTERNAL_SEMAPHORE_FEATURE_IMPORTABLE_BIT};\n\n using ExternalSemaphoreFeatureFlagBitsKHR = ExternalSemaphoreFeatureFlagBits;\n\n\n\n VULKAN_HPP_INLINE std::string to_string( ExternalSemaphoreFeatureFlagBits value )\n\n {\n\n switch ( value )\n\n {\n\n case ExternalSemaphoreFeatureFlagBits::eExportable : return \"Exportable\";\n\n case ExternalSemaphoreFeatureFlagBits::eImportable : return \"Importable\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":35,"score":147265.7034294076},{"content":" enum class ExternalFenceFeatureFlagBits : VkExternalFenceFeatureFlags\n\n {\n\n eExportable = VK_EXTERNAL_FENCE_FEATURE_EXPORTABLE_BIT,\n\n eImportable = VK_EXTERNAL_FENCE_FEATURE_IMPORTABLE_BIT};\n\n using ExternalFenceFeatureFlagBitsKHR = ExternalFenceFeatureFlagBits;\n\n\n\n VULKAN_HPP_INLINE std::string to_string( ExternalFenceFeatureFlagBits value )\n\n {\n\n switch ( value )\n\n {\n\n case ExternalFenceFeatureFlagBits::eExportable : return \"Exportable\";\n\n case ExternalFenceFeatureFlagBits::eImportable : return \"Importable\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":36,"score":147265.7034294076},{"content":" enum class PeerMemoryFeatureFlagBits : VkPeerMemoryFeatureFlags\n\n {\n\n eCopySrc = VK_PEER_MEMORY_FEATURE_COPY_SRC_BIT,\n\n eCopyDst = VK_PEER_MEMORY_FEATURE_COPY_DST_BIT,\n\n eGenericSrc = VK_PEER_MEMORY_FEATURE_GENERIC_SRC_BIT,\n\n eGenericDst = VK_PEER_MEMORY_FEATURE_GENERIC_DST_BIT};\n\n using PeerMemoryFeatureFlagBitsKHR = PeerMemoryFeatureFlagBits;\n\n\n\n VULKAN_HPP_INLINE std::string to_string( PeerMemoryFeatureFlagBits value )\n\n {\n\n switch ( value )\n\n {\n\n case PeerMemoryFeatureFlagBits::eCopySrc : return \"CopySrc\";\n\n case PeerMemoryFeatureFlagBits::eCopyDst : return \"CopyDst\";\n\n case PeerMemoryFeatureFlagBits::eGenericSrc : return \"GenericSrc\";\n\n case PeerMemoryFeatureFlagBits::eGenericDst : return \"GenericDst\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":37,"score":147265.7034294076},{"content":" enum class ExternalMemoryFeatureFlagBits : VkExternalMemoryFeatureFlags\n\n {\n\n eDedicatedOnly = VK_EXTERNAL_MEMORY_FEATURE_DEDICATED_ONLY_BIT,\n\n eExportable = VK_EXTERNAL_MEMORY_FEATURE_EXPORTABLE_BIT,\n\n eImportable = VK_EXTERNAL_MEMORY_FEATURE_IMPORTABLE_BIT};\n\n using ExternalMemoryFeatureFlagBitsKHR = ExternalMemoryFeatureFlagBits;\n\n\n\n VULKAN_HPP_INLINE std::string to_string( ExternalMemoryFeatureFlagBits value )\n\n {\n\n switch ( value )\n\n {\n\n case ExternalMemoryFeatureFlagBits::eDedicatedOnly : return \"DedicatedOnly\";\n\n case ExternalMemoryFeatureFlagBits::eExportable : return \"Exportable\";\n\n case ExternalMemoryFeatureFlagBits::eImportable : return \"Importable\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":38,"score":147265.7034294076},{"content":" enum class SwapchainCreateFlagBitsKHR : VkSwapchainCreateFlagsKHR\n\n {\n\n eSplitInstanceBindRegions = VK_SWAPCHAIN_CREATE_SPLIT_INSTANCE_BIND_REGIONS_BIT_KHR,\n\n eProtected = VK_SWAPCHAIN_CREATE_PROTECTED_BIT_KHR,\n\n eMutableFormat = VK_SWAPCHAIN_CREATE_MUTABLE_FORMAT_BIT_KHR};\n\n\n\n VULKAN_HPP_INLINE std::string to_string( SwapchainCreateFlagBitsKHR value )\n\n {\n\n switch ( value )\n\n {\n\n case SwapchainCreateFlagBitsKHR::eSplitInstanceBindRegions : return \"SplitInstanceBindRegions\";\n\n case SwapchainCreateFlagBitsKHR::eProtected : return \"Protected\";\n\n case SwapchainCreateFlagBitsKHR::eMutableFormat : return \"MutableFormat\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":39,"score":147251.67086973923},{"content":"pub fn is_steamvr_running() -> bool {\n\n let mut system = System::new_with_specifics(RefreshKind::new().with_processes());\n\n system.refresh_processes();\n\n\n\n !system\n\n .process_by_name(&afs::exec_fname(\"vrserver\"))\n\n .is_empty()\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":40,"score":147047.76809689926},{"content":"// Use this when there is no way of determining the current path. The reulting Layout paths will\n\n// be invalid, expect for the ones that disregard the relative path (for example the config dir) and\n\n// the ones that have been overridden.\n\npub fn filesystem_layout_from_invalid() -> Layout {\n\n LAYOUT.clone().unwrap_or_else(|| Layout::new(Path::new(\"\")))\n\n}\n","file_path":"alvr/filesystem/src/lib.rs","rank":42,"score":144023.999955199},{"content":"pub fn check_steamvr_installation() -> bool {\n\n alvr_commands::openvr_source_file_path().is_ok()\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":43,"score":144018.0365286107},{"content":"pub fn workspace_dir() -> PathBuf {\n\n Path::new(env!(\"CARGO_MANIFEST_DIR\")).join(\"../..\")\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":44,"score":144018.0365286107},{"content":"pub fn target_dir() -> PathBuf {\n\n Path::new(env!(\"OUT_DIR\")).join(\"../../../..\")\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":45,"score":144018.0365286107},{"content":"pub fn build_dir() -> PathBuf {\n\n workspace_dir().join(\"build\")\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":46,"score":144018.0365286107},{"content":"pub fn installer_path() -> PathBuf {\n\n env::temp_dir().join(exec_fname(\"alvr_installer\"))\n\n}\n\n\n\n// Layout of the ALVR installation. All paths are absolute\n\n#[derive(Clone)]\n\npub struct Layout {\n\n // directory containing the launcher executable\n\n pub executables_dir: PathBuf,\n\n // (linux only) directory where alvr_vulkan_layer.so is saved\n\n pub libraries_dir: PathBuf,\n\n // parent directory of resources like the dashboard and presets folders\n\n pub static_resources_dir: PathBuf,\n\n // directory for storing configuration files (session.json)\n\n pub config_dir: PathBuf,\n\n // directory for storing log\n\n pub log_dir: PathBuf,\n\n // directory to register in openVR driver path\n\n pub openvr_driver_root_dir: PathBuf,\n\n // (linux only) parent directory of the executable to wrap vrcompositor\n","file_path":"alvr/filesystem/src/lib.rs","rank":47,"score":144018.0365286107},{"content":"pub fn deps_dir() -> PathBuf {\n\n workspace_dir().join(\"deps\")\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":48,"score":144018.0365286107},{"content":"pub fn date_utc_yyyymmdd() -> String {\n\n let output = if cfg!(windows) {\n\n Command::new(\"powershell\")\n\n .arg(\"(Get-Date).ToUniversalTime().ToString(\\\"yyyy.MM.dd\\\")\")\n\n .output()\n\n .unwrap()\n\n } else {\n\n Command::new(\"date\")\n\n .args(&[\"-u\", \"+%Y.%m.%d\"])\n\n .output()\n\n .unwrap()\n\n };\n\n\n\n String::from_utf8_lossy(&output.stdout)\n\n .as_ref()\n\n .to_owned()\n\n .replace('\\r', \"\")\n\n .replace('\\n', \"\")\n\n}\n","file_path":"alvr/xtask/src/command.rs","rank":49,"score":144018.0365286107},{"content":" enum class ExternalMemoryFeatureFlagBitsNV : VkExternalMemoryFeatureFlagsNV\n\n {\n\n eDedicatedOnly = VK_EXTERNAL_MEMORY_FEATURE_DEDICATED_ONLY_BIT_NV,\n\n eExportable = VK_EXTERNAL_MEMORY_FEATURE_EXPORTABLE_BIT_NV,\n\n eImportable = VK_EXTERNAL_MEMORY_FEATURE_IMPORTABLE_BIT_NV};\n\n\n\n VULKAN_HPP_INLINE std::string to_string( ExternalMemoryFeatureFlagBitsNV value )\n\n {\n\n switch ( value )\n\n {\n\n case ExternalMemoryFeatureFlagBitsNV::eDedicatedOnly : return \"DedicatedOnly\";\n\n case ExternalMemoryFeatureFlagBitsNV::eExportable : return \"Exportable\";\n\n case ExternalMemoryFeatureFlagBitsNV::eImportable : return \"Importable\";\n\n default: return \"invalid ( \" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \" )\";\n\n }\n\n }\n\n\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp","rank":50,"score":142447.17606224772},{"content":"pub fn create_setting_container(\n\n schema: SchemaNode,\n\n session_fragment: json::Value,\n\n trans_path: &str,\n\n trans: &TranslationBundle,\n\n) -> Box<dyn SettingContainer> {\n\n match schema {\n\n SchemaNode::Section { entries } => {\n\n Box::new(Section::new(entries, session_fragment, trans_path, trans))\n\n }\n\n SchemaNode::Choice { default, variants } => Box::new(ChoiceContainer::new(\n\n variants,\n\n session_fragment,\n\n trans_path,\n\n trans,\n\n )),\n\n SchemaNode::Optional {\n\n default_set,\n\n content,\n\n } => Box::new(EmptyContainer),\n","file_path":"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs","rank":51,"score":142441.7884979411},{"content":"pub fn create_setting_control(\n\n schema: SchemaNode,\n\n session_fragment: json::Value,\n\n trans_path: &str,\n\n trans: &TranslationBundle,\n\n) -> Box<dyn SettingControl> {\n\n match schema {\n\n SchemaNode::Choice { default, variants } => Box::new(ChoiceControl::new(\n\n default,\n\n variants,\n\n session_fragment,\n\n trans_path,\n\n trans,\n\n )),\n\n SchemaNode::Optional {\n\n default_set,\n\n content,\n\n } => Box::new(EmptyControl),\n\n SchemaNode::Switch {\n\n default_enabled,\n","file_path":"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs","rank":52,"score":142441.7884979411},{"content":"pub fn split_string(source: &str, start_pattern: &str, end: char) -> (String, String, String) {\n\n let start_idx = source.find(start_pattern).unwrap() + start_pattern.len();\n\n let end_idx = start_idx + source[start_idx..].find(end).unwrap();\n\n\n\n (\n\n source[..start_idx].to_owned(),\n\n source[start_idx..end_idx].to_owned(),\n\n source[end_idx..].to_owned(),\n\n )\n\n}\n\n\n","file_path":"alvr/xtask/src/version.rs","rank":53,"score":142005.36995889703},{"content":"pub fn server_build_dir() -> PathBuf {\n\n let server_build_dir = if cfg!(windows) {\n\n \"alvr_server_windows\"\n\n } else if cfg!(target_os = \"linux\") {\n\n \"alvr_server_linux\"\n\n } else if cfg!(target_os = \"macos\") {\n\n \"alvr_server_macos\"\n\n } else {\n\n unimplemented!()\n\n };\n\n\n\n build_dir().join(server_build_dir)\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":54,"score":141157.7719775635},{"content":"pub fn unblock_alvr_addon() -> StrResult {\n\n let config_path = alvr_commands::steam_config_dir()?.join(\"steamvr.vrsettings\");\n\n\n\n let mut fields_ref: json::Map<String, json::Value> = trace_err!(json::from_str(&trace_err!(\n\n fs::read_to_string(&config_path)\n\n )?))?;\n\n\n\n fields_ref.remove(\"driver_alvr_server\");\n\n\n\n trace_err!(fs::write(\n\n config_path,\n\n trace_err!(json::to_string_pretty(&fields_ref))?\n\n ))?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":55,"score":141157.7719775635},{"content":"pub fn session_settings_default() -> SettingsDefault {\n\n SettingsDefault {\n\n video: VideoDescDefault {\n\n adapter_index: 0,\n\n preferred_fps: 72.,\n\n render_resolution: FrameSizeDefault {\n\n variant: FrameSizeDefaultVariant::Scale,\n\n Scale: 0.75,\n\n Absolute: FrameSizeAbsoluteDefault {\n\n width: 2880,\n\n height: 1600,\n\n },\n\n },\n\n recommended_target_resolution: FrameSizeDefault {\n\n variant: FrameSizeDefaultVariant::Scale,\n\n Scale: 0.75,\n\n Absolute: FrameSizeAbsoluteDefault {\n\n width: 2880,\n\n height: 1600,\n\n },\n","file_path":"alvr/session/src/settings.rs","rank":56,"score":141157.7719775635},{"content":"fn align32(value: f32) -> u32 {\n\n ((value / 32.).floor() * 32.) as u32\n\n}\n\n\n","file_path":"alvr/server/src/connection.rs","rank":57,"score":140819.4571580209},{"content":"fn gui() -> impl Widget<View> {\n\n ViewSwitcher::new(\n\n |view: &View, _| view.clone(),\n\n |view, _, _| match view {\n\n View::RequirementsCheck { steamvr } => Box::new(\n\n Flex::row()\n\n .with_default_spacer()\n\n .with_flex_child(\n\n Flex::column()\n\n .cross_axis_alignment(CrossAxisAlignment::Start)\n\n .with_flex_spacer(1.0)\n\n .with_child(\n\n Label::new(steamvr.clone())\n\n .with_line_break_mode(LineBreaking::WordWrap),\n\n )\n\n .with_default_spacer()\n\n .with_flex_spacer(1.5),\n\n FlexParams::new(1.0, None),\n\n )\n\n .with_default_spacer(),\n","file_path":"alvr/launcher/src/main.rs","rank":58,"score":140783.66042652068},{"content":"pub fn run_as_shell_in(workdir: &Path, shell: &str, shell_flag: &str, cmd: &str) -> StrResult {\n\n println!(\"\\n> {}\", cmd);\n\n\n\n let output = trace_err!(trace_err!(Command::new(shell)\n\n .args(&[shell_flag, cmd])\n\n .stdout(Stdio::inherit())\n\n .current_dir(workdir)\n\n .spawn())?\n\n .wait_with_output())?;\n\n\n\n if output.status.success() {\n\n Ok(())\n\n } else {\n\n fmt_e!(\n\n \"Command failed: {}\",\n\n String::from_utf8_lossy(&output.stderr)\n\n )\n\n }\n\n}\n\n\n","file_path":"alvr/xtask/src/command.rs","rank":59,"score":139097.15657065104},{"content":"pub fn maybe_register_alvr_driver() -> StrResult {\n\n let alvr_driver_dir = afs::filesystem_layout_from_launcher_exe(&env::current_exe().unwrap())\n\n .openvr_driver_root_dir;\n\n\n\n let driver_registered = alvr_commands::get_driver_dir_from_registered()\n\n .ok()\n\n .filter(|dir| *dir == alvr_driver_dir)\n\n .is_some();\n\n\n\n if !driver_registered {\n\n let paths_backup = match alvr_commands::get_registered_drivers() {\n\n Ok(paths) => paths,\n\n Err(e) => {\n\n return fmt_e!(\n\n \"{}\\n{}\\n\\n({})\",\n\n \"Failed to load registered drivers.\",\n\n \"Please reset the drivers installation with the apposite button on the launcher.\",\n\n e\n\n )\n\n }\n","file_path":"alvr/launcher/src/commands.rs","rank":60,"score":138453.14266082377},{"content":"pub fn tabs<R>(\n\n ui: &mut Ui,\n\n tabs: &[LocalizedId],\n\n selected_tab: &mut String,\n\n content: impl FnOnce(&mut Ui) -> R,\n\n right_slot: impl FnOnce(&mut Ui),\n\n) -> R {\n\n ui.with_layout(\n\n Layout::top_down(Align::LEFT).with_cross_justify(true),\n\n |ui| {\n\n ui.with_layout(Layout::left_to_right().with_cross_align(Align::TOP), |ui| {\n\n for id in tabs {\n\n ui.selectable_value(selected_tab, (**id).clone(), &id.trans);\n\n }\n\n\n\n ui.with_layout(\n\n Layout::right_to_left().with_cross_align(Align::TOP),\n\n right_slot,\n\n );\n\n });\n\n\n\n ui.separator();\n\n\n\n content(ui)\n\n },\n\n )\n\n .inner\n\n}\n","file_path":"alvr/experiments/gui/src/dashboard/basic_components/tabs.rs","rank":61,"score":138453.14266082377},{"content":"#[cfg(target_os = \"linux\")]\n\npub fn maybe_wrap_vrcompositor_launcher() -> StrResult {\n\n let steamvr_bin_dir = alvr_commands::steamvr_root_dir()?\n\n .join(\"bin\")\n\n .join(\"linux64\");\n\n let real_launcher_path = steamvr_bin_dir.join(\"vrcompositor.real\");\n\n let launcher_path = steamvr_bin_dir.join(\"vrcompositor\");\n\n\n\n // In case of SteamVR update, vrcompositor will be restored\n\n match fs::read_link(&launcher_path) {\n\n Err(_) => match fs::metadata(&launcher_path) {\n\n Err(_) => (), //file does not exist, do nothing\n\n Ok(_) => {\n\n trace_err!(fs::rename(&launcher_path, &real_launcher_path))?;\n\n }\n\n },\n\n Ok(_) => trace_err!(fs::remove_file(&launcher_path))?, // recreate the link\n\n };\n\n\n\n trace_err!(std::os::unix::fs::symlink(\n\n afs::filesystem_layout_from_launcher_exe(&env::current_exe().unwrap())\n\n .vrcompositor_wrapper(),\n\n &launcher_path\n\n ))?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":62,"score":138453.14266082377},{"content":"#[cfg(not(windows))]\n\nfn spawn_no_window(command: &mut Command) {\n\n command.spawn().ok();\n\n}\n\n\n","file_path":"alvr/launcher/src/commands.rs","rank":63,"score":137788.79075615987},{"content":"fn mbits_to_bytes(value: u64) -> u32 {\n\n (value * 1024 * 1024 / 8) as u32\n\n}\n\n\n","file_path":"alvr/server/src/connection.rs","rank":64,"score":137788.79075615987},{"content":"pub fn publish_client(is_nightly: bool) {\n\n build_client(!is_nightly, is_nightly, false);\n\n build_client(!is_nightly, is_nightly, true);\n\n}\n\n\n","file_path":"alvr/xtask/src/main.rs","rank":65,"score":137739.6644307641},{"content":"pub fn log_event(id: Event) {\n\n log::info!(\"#{}#\", serde_json::to_string(&id).unwrap());\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! fmt_e {\n\n ($($args:tt)+) => {\n\n Err(format!($($args)+))\n\n };\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! trace_str {\n\n () => {\n\n format!(\"At {}:{}\", file!(), line!())\n\n };\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! trace_err {\n","file_path":"alvr/common/src/logging.rs","rank":66,"score":137739.6644307641},{"content":"pub fn build_deps(target_os: &str) {\n\n if target_os == \"windows\" {\n\n command::run(\"cargo install wasm-pack\").unwrap();\n\n } else if target_os == \"android\" {\n\n command::run(\"rustup target add aarch64-linux-android\").unwrap();\n\n build_rust_android_gradle();\n\n } else {\n\n println!(\"Nothing to do for {}!\", target_os)\n\n }\n\n}\n","file_path":"alvr/xtask/src/dependencies.rs","rank":67,"score":134879.39987971686},{"content":" uint32_t version;\n","file_path":"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vk_layer.h","rank":68,"score":133935.14516548076},{"content":"fn bump_client_gradle_version(new_version: &str, is_nightly: bool) {\n\n let gradle_file_path = afs::workspace_dir()\n\n .join(\"alvr/client/android/app\")\n\n .join(\"build.gradle\");\n\n let file_content = fs::read_to_string(&gradle_file_path).unwrap();\n\n\n\n // Replace versionName\n\n let (file_start, _, file_end) = split_string(&file_content, \"versionName \\\"\", '\\\"');\n\n let file_content = format!(\"{}{}{}\", file_start, new_version, file_end);\n\n\n\n let file_content = if !is_nightly {\n\n // Replace versionCode\n\n let (file_start, old_version_code_string, file_end) =\n\n split_string(&file_content, \"versionCode \", '\\n');\n\n format!(\n\n \"{}{}{}\",\n\n file_start,\n\n old_version_code_string.parse::<usize>().unwrap() + 1,\n\n file_end\n\n )\n\n } else {\n\n file_content\n\n };\n\n\n\n fs::write(gradle_file_path, file_content).unwrap();\n\n}\n\n\n","file_path":"alvr/xtask/src/version.rs","rank":69,"score":132099.03405772668},{"content":"fn bump_rpm_spec_version(new_version: &str, is_nightly: bool) {\n\n let spec_path = afs::workspace_dir().join(\"packaging/rpm/alvr.spec\");\n\n let spec = fs::read_to_string(&spec_path).unwrap();\n\n\n\n // If there's a '-', split the version around it\n\n let (version_start, version_end) = {\n\n if new_version.contains('-') {\n\n let (_, tmp_start, mut tmp_end) = split_string(new_version, \"\", '-');\n\n tmp_end.remove(0);\n\n (\n\n tmp_start,\n\n if is_nightly {\n\n format!(\"0.0.1{}+nightly.{}\", tmp_end, date_utc_yyyymmdd())\n\n } else {\n\n format!(\"0.0.1{}\", tmp_end)\n\n },\n\n )\n\n } else {\n\n (new_version.to_string(), \"1.0.0\".to_string())\n\n }\n","file_path":"alvr/xtask/src/version.rs","rank":70,"score":132099.03405772668},{"content":"fn packages_dir() -> PathBuf {\n\n Path::new(env!(\"CARGO_MANIFEST_DIR\"))\n\n .parent()\n\n .unwrap()\n\n .into()\n\n}\n\n\n","file_path":"alvr/xtask/src/version.rs","rank":71,"score":130668.83097815543},{"content":"#[cfg(target_os = \"linux\")]\n\nfn do_ffmpeg_pkg_config(build: &mut cc::Build) {\n\n let ffmpeg_path = env::var(\"CARGO_MANIFEST_DIR\").unwrap() + \"/../../deps/linux/FFmpeg-n4.4/\";\n\n\n\n #[cfg(feature = \"bundled_ffmpeg\")]\n\n {\n\n for lib in vec![\"libavutil\", \"libavfilter\", \"libavcodec\", \"libswscale\"] {\n\n let path = ffmpeg_path.clone() + lib;\n\n env::set_var(\n\n \"PKG_CONFIG_PATH\",\n\n env::var(\"PKG_CONFIG_PATH\").map_or(path.clone(), |old| format!(\"{}:{}\", path, old)),\n\n );\n\n }\n\n }\n\n\n\n let pkg = pkg_config::Config::new()\n\n .cargo_metadata(cfg!(not(feature = \"bundled_ffmpeg\")))\n\n .to_owned();\n\n let avutil = pkg.probe(\"libavutil\").unwrap();\n\n let avfilter = pkg.probe(\"libavfilter\").unwrap();\n\n let avcodec = pkg.probe(\"libavcodec\").unwrap();\n","file_path":"alvr/server/build.rs","rank":72,"score":130288.54192611459},{"content":"pub fn zip(source: &Path) -> StrResult {\n\n if cfg!(windows) {\n\n run_without_shell(\n\n \"powershell\",\n\n &[\n\n \"Compress-Archive\",\n\n &source.to_string_lossy(),\n\n &format!(\"{}.zip\", source.to_string_lossy()),\n\n ],\n\n )\n\n } else {\n\n run_without_shell(\n\n \"zip\",\n\n &[\n\n \"-r\",\n\n &format!(\"{}.zip\", source.to_string_lossy()),\n\n &source.to_string_lossy(),\n\n ],\n\n )\n\n }\n\n}\n\n\n","file_path":"alvr/xtask/src/command.rs","rank":73,"score":130242.59511515737},{"content":"#[cfg(windows)]\n\npub fn exec_fname(name: &str) -> String {\n\n format!(\"{}.exe\", name)\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":74,"score":130242.59511515737},{"content":"pub fn run(cmd: &str) -> StrResult {\n\n run_in(&env::current_dir().unwrap(), cmd)\n\n}\n\n\n","file_path":"alvr/xtask/src/command.rs","rank":75,"score":130242.59511515737},{"content":"#[cfg(target_os = \"macos\")]\n\npub fn dynlib_fname(name: &str) -> String {\n\n format!(\"lib{}.dylib\", name)\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":76,"score":130242.59511515737},{"content":"fn bump_cargo_version(crate_dir_name: &str, new_version: &str) {\n\n let manifest_path = packages_dir().join(crate_dir_name).join(\"Cargo.toml\");\n\n\n\n let manifest = fs::read_to_string(&manifest_path).unwrap();\n\n\n\n let (file_start, _, file_end) = split_string(&manifest, \"version = \\\"\", '\\\"');\n\n let manifest = format!(\"{}{}{}\", file_start, new_version, file_end);\n\n\n\n fs::write(manifest_path, manifest).unwrap();\n\n}\n\n\n","file_path":"alvr/xtask/src/version.rs","rank":77,"score":130017.4058554035},{"content":"pub fn steam_config_dir() -> StrResult<PathBuf> {\n\n get_single_openvr_path(\"config\")\n\n}\n","file_path":"alvr/commands/src/openvrpaths.rs","rank":78,"score":129613.41008397835},{"content":"pub fn steamvr_root_dir() -> StrResult<PathBuf> {\n\n get_single_openvr_path(\"runtime\")\n\n}\n\n\n","file_path":"alvr/commands/src/openvrpaths.rs","rank":79,"score":129613.41008397835},{"content":"pub fn show_e<E: Display>(e: E) {\n\n show_e_block(e, false);\n\n}\n\n\n","file_path":"alvr/common/src/logging.rs","rank":80,"score":129538.24256519851},{"content":"pub fn show_w<W: Display>(w: W) {\n\n log::warn!(\"{}\", w);\n\n\n\n // GDK crashes because of initialization in multiple thread\n\n #[cfg(windows)]\n\n std::thread::spawn({\n\n let warn_string = w.to_string();\n\n move || {\n\n msgbox::create(\n\n \"ALVR encountered a non-fatal error\",\n\n &warn_string,\n\n msgbox::IconType::Info,\n\n )\n\n .ok();\n\n }\n\n });\n\n}\n\n\n","file_path":"alvr/common/src/logging.rs","rank":81,"score":129538.24256519851},{"content":"#[proc_macro_derive(SettingsSchema, attributes(schema))]\n\npub fn create_settings_schema_fn_and_default_ty(input: TokenStream) -> TokenStream {\n\n let input = syn::parse_macro_input!(input as DeriveInput);\n\n\n\n match schema(input) {\n\n Ok(tokens) => tokens.into(),\n\n Err(e) => e,\n\n }\n\n}\n","file_path":"alvr/settings-schema-derive/src/lib.rs","rank":82,"score":128748.52260943047},{"content":"pub fn set_game_output_audio_device_id(id: String) {\n\n set_property(\n\n vr::k_unTrackedDeviceIndex_Hmd,\n\n vr::Prop_Audio_DefaultPlaybackDeviceId_String,\n\n OpenvrPropValue::String(id),\n\n );\n\n}\n\n\n","file_path":"alvr/server/src/openvr.rs","rank":83,"score":127184.22837969572},{"content":"pub fn get_driver_dir() -> StrResult<PathBuf> {\n\n get_driver_dir_from_registered()\n\n .map_err(|e| format!(\"ALVR driver path not stored and not registered ({})\", e))\n\n}\n\n\n","file_path":"alvr/commands/src/openvr_drivers.rs","rank":84,"score":127184.22837969572},{"content":"pub fn openvr_source_file_path() -> StrResult<PathBuf> {\n\n let path = trace_none!(if cfg!(windows) {\n\n dirs::cache_dir()\n\n } else {\n\n dirs::config_dir()\n\n })?\n\n .join(\"openvr/openvrpaths.vrpath\");\n\n\n\n if path.exists() {\n\n Ok(path)\n\n } else {\n\n fmt_e!(\"{} does not exist\", path.to_string_lossy())\n\n }\n\n}\n\n\n\npub(crate) fn load_openvr_paths_json() -> StrResult<json::Value> {\n\n let file = trace_err!(File::open(openvr_source_file_path()?))?;\n\n\n\n let mut file_content_decoded = String::new();\n\n trace_err!(DecodeReaderBytes::new(&file).read_to_string(&mut file_content_decoded))?;\n","file_path":"alvr/commands/src/openvrpaths.rs","rank":85,"score":127184.22837969572},{"content":"pub fn set_headset_microphone_audio_device_id(id: String) {\n\n set_property(\n\n vr::k_unTrackedDeviceIndex_Hmd,\n\n vr::Prop_Audio_DefaultRecordingDeviceId_String,\n\n OpenvrPropValue::String(id),\n\n );\n\n}\n","file_path":"alvr/server/src/openvr.rs","rank":86,"score":127184.22837969572},{"content":"pub fn get_devices_list() -> StrResult<AudioDevicesList> {\n\n let host = cpal::default_host();\n\n\n\n let output = trace_err!(host.output_devices())?\n\n .filter_map(|d| d.name().ok())\n\n .collect::<Vec<_>>();\n\n let input = trace_err!(host.input_devices())?\n\n .filter_map(|d| d.name().ok())\n\n .collect::<Vec<_>>();\n\n\n\n Ok(AudioDevicesList { output, input })\n\n}\n\n\n\npub enum AudioDeviceType {\n\n Output,\n\n Input,\n\n\n\n // for the virtual microphone devices, input and output labels are swapped\n\n VirtualMicrophoneInput,\n\n VirtualMicrophoneOutput { matching_input_device_name: String },\n","file_path":"alvr/audio/src/lib.rs","rank":87,"score":127184.22837969572},{"content":"pub fn show_e_blocking<E: Display>(e: E) {\n\n show_e_block(e, true);\n\n}\n\n\n","file_path":"alvr/common/src/logging.rs","rank":88,"score":126677.9780141513},{"content":"// The path should include the executable file name\n\n// The path argument is used only if ALVR is built as portable\n\npub fn filesystem_layout_from_launcher_exe(path: &Path) -> Layout {\n\n LAYOUT.clone().unwrap_or_else(|| {\n\n let root = if cfg!(any(windows, target_os = \"macos\")) {\n\n path.parent().unwrap().to_owned()\n\n } else if cfg!(target_os = \"linux\") {\n\n // FHS path is expected\n\n path.parent().unwrap().parent().unwrap().to_owned()\n\n } else {\n\n unimplemented!()\n\n };\n\n\n\n Layout::new(&root)\n\n })\n\n}\n\n\n","file_path":"alvr/filesystem/src/lib.rs","rank":89,"score":124983.00598283297},{"content":"pub fn restart_steamvr(launcher_path: &Path) -> StrResult {\n\n invoke_launcher(launcher_path, \"--restart-steamvr\")\n\n}\n\n\n","file_path":"alvr/commands/src/launcher.rs","rank":90,"score":124976.60531941884},{"content":"pub fn build_ffmpeg_linux() -> std::path::PathBuf {\n\n // dependencies: build-essential pkg-config nasm libva-dev libdrm-dev libvulkan-dev libx264-dev libx265-dev\n\n\n\n let download_path = afs::deps_dir().join(\"linux\");\n\n let ffmpeg_path = download_path.join(\"FFmpeg-n4.4\");\n\n if !ffmpeg_path.exists() {\n\n download_and_extract_zip(\n\n \"https://codeload.github.com/FFmpeg/FFmpeg/zip/n4.4\",\n\n &download_path,\n\n );\n\n }\n\n\n\n bash_in(\n\n &ffmpeg_path,\n\n &format!(\n\n \"./configure {} {} {} {} {} {} {} {} {} {}\",\n\n \"--enable-gpl --enable-version3\",\n\n \"--disable-static --enable-shared\",\n\n \"--disable-programs\",\n\n \"--disable-doc\",\n","file_path":"alvr/xtask/src/dependencies.rs","rank":91,"score":124976.60531941884},{"content":"pub fn get_driver_dir_from_registered() -> StrResult<PathBuf> {\n\n for dir in get_registered_drivers()? {\n\n let maybe_driver_name = || -> StrResult<_> {\n\n let manifest_string =\n\n trace_err!(fs::read_to_string(dir.join(\"driver.vrdrivermanifest\")))?;\n\n let mut manifest_map = trace_err!(json::from_str::<HashMap<String, json::Value>>(\n\n &manifest_string\n\n ))?;\n\n\n\n trace_none!(manifest_map.remove(\"name\"))\n\n }();\n\n\n\n if maybe_driver_name == Ok(json::Value::String(\"alvr_server\".to_owned())) {\n\n return Ok(dir);\n\n }\n\n }\n\n fmt_e!(\"ALVR driver path not registered\")\n\n}\n\n\n","file_path":"alvr/commands/src/openvr_drivers.rs","rank":92,"score":124877.2511997872},{"content":"pub fn map_fragment<T: Serialize>(\n\n res: Option<SettingsResponse>,\n\n map: impl FnOnce(json::Value) -> T,\n\n) -> Option<SettingsResponse> {\n\n match res {\n\n Some(SettingsResponse::SessionFragment(fragment)) => {\n\n Some(super::into_fragment(map(fragment)))\n\n }\n\n res => res,\n\n }\n\n}\n\n\n\npub struct SettingsContext {\n\n pub advanced: bool,\n\n pub view_width: f32,\n\n pub t: Arc<SharedTranslation>,\n\n}\n\n\n","file_path":"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs","rank":93,"score":124877.2511997872},{"content":"// Errors:\n\n// 1: firewall rule is already set\n\n// 126: pkexec request dismissed\n\n// other: command failed\n\npub fn firewall_rules(add: bool) -> Result<(), i32> {\n\n let exit_status;\n\n\n\n if cfg!(target_os = \"linux\") {\n\n let action = if add { \"add\" } else { \"remove\" };\n\n // run as normal user since we use pkexec to sudo\n\n exit_status = Command::new(\"bash\")\n\n .arg(\"/usr/libexec/alvr/alvr_fw_config.sh\")\n\n .arg(action)\n\n .status()\n\n .map_err(|_| -1)?;\n\n } else {\n\n let script_path = env::temp_dir().join(\"alvr_firewall_rules.bat\");\n\n let firewall_rules_script_content = if add {\n\n format!(\n\n \"{}\\n{}\",\n\n netsh_add_rule_command_string(\n\n \"SteamVR ALVR vrserver\",\n\n &crate::steamvr_root_dir()\n\n .map_err(|_| -1)?\n","file_path":"alvr/commands/src/firewall.rs","rank":94,"score":123973.34869741155}],"string":"[\n {\n \"content\": \"#[cfg(target_os = \\\"macos\\\")]\\n\\npub fn get_screen_size() -> StrResult<(u32, u32)> {\\n\\n Ok((0, 0))\\n\\n}\\n\",\n \"file_path\": \"alvr/server/src/graphics_info.rs\",\n \"rank\": 0,\n \"score\": 257298.96087876664\n },\n {\n \"content\": \"pub fn version() -> String {\\n\\n let manifest_path = packages_dir().join(\\\"common\\\").join(\\\"Cargo.toml\\\");\\n\\n println!(\\\"cargo:rerun-if-changed={}\\\", manifest_path.to_string_lossy());\\n\\n\\n\\n let manifest = fs::read_to_string(manifest_path).unwrap();\\n\\n let (_, version, _) = split_string(&manifest, \\\"version = \\\\\\\"\\\", '\\\\\\\"');\\n\\n\\n\\n version\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 1,\n \"score\": 240856.36824349643\n },\n {\n \"content\": \"// accept semver-compatible versions\\n\\n// Note: by not having to set the requirement manually, the major version is constrained to be\\n\\n// bumped when the packet layouts or some critical behaviour has changed.\\n\\npub fn is_version_compatible(other_version: &Version) -> bool {\\n\\n if other_version.pre != Prerelease::EMPTY\\n\\n || other_version.build != BuildMetadata::EMPTY\\n\\n || ALVR_VERSION.pre != Prerelease::EMPTY\\n\\n || ALVR_VERSION.build != BuildMetadata::EMPTY\\n\\n {\\n\\n *other_version == *ALVR_VERSION\\n\\n } else {\\n\\n other_version.major == ALVR_VERSION.major\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"alvr/common/src/lib.rs\",\n \"rank\": 4,\n \"score\": 219467.88912240913\n },\n {\n \"content\": \"// Due to the nature of immediate mode GUIs, the parent containers cannot conditionally render based\\n\\n// on the presence of the child container, so it is the child responsibility to format the container\\n\\npub fn container<R>(ui: &mut Ui, content: impl FnOnce(&mut Ui) -> R) -> R {\\n\\n ui.horizontal(|ui| {\\n\\n // Indentation\\n\\n ui.add_space(20_f32);\\n\\n\\n\\n content(ui)\\n\\n })\\n\\n .inner\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs\",\n \"rank\": 5,\n \"score\": 218722.87541870566\n },\n {\n \"content\": \"fn get_slicing_layout(combined_size: (u32, u32), slice_count: usize) -> SlicingLayout {\\n\\n // only 1 or 2 slices are handled for now.\\n\\n // todo: port complete algorithm from zarik5/bridgevr-dev. It can also split vertically after\\n\\n // a certain slice count.\\n\\n if slice_count == 1 {\\n\\n SlicingLayout {\\n\\n slice_width: combined_size.0 as i32,\\n\\n slice_height: combined_size.1 as i32,\\n\\n columns: 1,\\n\\n }\\n\\n } else if slice_count == 2 {\\n\\n SlicingLayout {\\n\\n slice_width: combined_size.0 as i32 / 2,\\n\\n slice_height: combined_size.1 as i32,\\n\\n columns: 2,\\n\\n }\\n\\n } else {\\n\\n unimplemented!()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/experiments/graphics_tests/src/compositor/slicing.rs\",\n \"rank\": 6,\n \"score\": 201438.3457479465\n },\n {\n \"content\": \"pub fn bump_version(maybe_version: Option<String>, is_nightly: bool) {\\n\\n let mut version = maybe_version.unwrap_or_else(version);\\n\\n\\n\\n if is_nightly {\\n\\n version = format!(\\\"{}+nightly.{}\\\", version, date_utc_yyyymmdd());\\n\\n }\\n\\n\\n\\n for dir_name in [\\n\\n \\\"audio\\\",\\n\\n \\\"client\\\",\\n\\n \\\"commands\\\",\\n\\n \\\"common\\\",\\n\\n \\\"filesystem\\\",\\n\\n \\\"launcher\\\",\\n\\n \\\"server\\\",\\n\\n \\\"session\\\",\\n\\n \\\"sockets\\\",\\n\\n \\\"vrcompositor-wrapper\\\",\\n\\n \\\"vulkan-layer\\\",\\n\\n \\\"xtask\\\",\\n\\n ] {\\n\\n bump_cargo_version(dir_name, &version);\\n\\n }\\n\\n bump_client_gradle_version(&version, is_nightly);\\n\\n bump_rpm_spec_version(&version, is_nightly);\\n\\n\\n\\n println!(\\\"Git tag:\\\\nv{}\\\", version);\\n\\n}\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 9,\n \"score\": 187001.29563533718\n },\n {\n \"content\": \"pub fn switch(ui: &mut Ui, on: &mut bool) -> Response {\\n\\n let desired_size = ui.spacing().interact_size.y * egui::vec2(2.0, 1.0);\\n\\n let (rect, mut response) = ui.allocate_exact_size(desired_size, Sense::click());\\n\\n if response.clicked() {\\n\\n *on = !*on;\\n\\n response.mark_changed();\\n\\n }\\n\\n response.widget_info(|| WidgetInfo::selected(WidgetType::Checkbox, *on, \\\"\\\"));\\n\\n\\n\\n let how_on = ui.ctx().animate_bool(response.id, *on);\\n\\n let visuals = ui.style().interact_selectable(&response, *on);\\n\\n let rect = rect.expand(visuals.expansion);\\n\\n let radius = 0.5 * rect.height();\\n\\n ui.painter()\\n\\n .rect(rect, radius, visuals.bg_fill, visuals.bg_stroke);\\n\\n let circle_x = egui::lerp((rect.left() + radius)..=(rect.right() - radius), how_on);\\n\\n let center = egui::pos2(circle_x, rect.center().y);\\n\\n ui.painter()\\n\\n .circle(center, 0.75 * radius, visuals.bg_fill, visuals.fg_stroke);\\n\\n\\n\\n response\\n\\n}\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/basic_components/switch.rs\",\n \"rank\": 10,\n \"score\": 182919.45346687204\n },\n {\n \"content\": \"pub fn get_gpu_names() -> Vec<String> {\\n\\n let instance = wgpu::Instance::new(wgpu::Backends::PRIMARY);\\n\\n let adapters = instance.enumerate_adapters(wgpu::Backends::PRIMARY);\\n\\n\\n\\n adapters\\n\\n .into_iter()\\n\\n .map(|a| a.get_info().name)\\n\\n .collect::<Vec<_>>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/graphics_info.rs\",\n \"rank\": 11,\n \"score\": 180557.1695782548\n },\n {\n \"content\": \"pub fn get_sample_rate(device: &AudioDevice) -> StrResult<u32> {\\n\\n let maybe_config_range = trace_err!(device.inner.supported_output_configs())?.next();\\n\\n let config = if let Some(config) = maybe_config_range {\\n\\n config\\n\\n } else {\\n\\n trace_none!(trace_err!(device.inner.supported_input_configs())?.next())?\\n\\n };\\n\\n\\n\\n // Assumption: device is in shared mode: this means that there is one and fixed sample rate,\\n\\n // format and channel count\\n\\n Ok(config.min_sample_rate().0)\\n\\n}\\n\\n\\n\\npub async fn record_audio_loop(\\n\\n device: AudioDevice,\\n\\n channels_count: u16,\\n\\n sample_rate: u32,\\n\\n #[cfg_attr(not(windows), allow(unused_variables))] mute: bool,\\n\\n mut sender: StreamSender<(), AUDIO>,\\n\\n) -> StrResult {\\n\",\n \"file_path\": \"alvr/audio/src/lib.rs\",\n \"rank\": 12,\n \"score\": 175072.71442853057\n },\n {\n \"content\": \"// this will not kill the child process \\\"ALVR launcher\\\"\\n\\npub fn kill_steamvr() {\\n\\n let mut system = System::new_with_specifics(RefreshKind::new().with_processes());\\n\\n system.refresh_processes();\\n\\n\\n\\n // first kill vrmonitor, then kill vrserver if it is hung.\\n\\n\\n\\n for process in system.process_by_name(&afs::exec_fname(\\\"vrmonitor\\\")) {\\n\\n #[cfg(not(windows))]\\n\\n process.kill(sysinfo::Signal::Term);\\n\\n #[cfg(windows)]\\n\\n kill_process(process.pid());\\n\\n }\\n\\n\\n\\n thread::sleep(Duration::from_secs(1));\\n\\n\\n\\n for process in system.process_by_name(&afs::exec_fname(\\\"vrserver\\\")) {\\n\\n #[cfg(not(windows))]\\n\\n process.kill(sysinfo::Signal::Term);\\n\\n #[cfg(windows)]\\n\\n kill_process(process.pid());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 13,\n \"score\": 159241.67555424006\n },\n {\n \"content\": \"pub fn fix_steamvr() {\\n\\n // If ALVR driver does not start use a more destructive approach: delete openvrpaths.vrpath then recreate it\\n\\n if let Ok(path) = alvr_commands::openvr_source_file_path() {\\n\\n fs::remove_file(path).ok();\\n\\n\\n\\n maybe_launch_steamvr();\\n\\n thread::sleep(Duration::from_secs(5));\\n\\n kill_steamvr();\\n\\n thread::sleep(Duration::from_secs(5));\\n\\n }\\n\\n\\n\\n unblock_alvr_addon().ok();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 14,\n \"score\": 159241.67555424006\n },\n {\n \"content\": \"pub fn build_server(\\n\\n is_release: bool,\\n\\n experiements: bool,\\n\\n fetch_crates: bool,\\n\\n bundle_ffmpeg: bool,\\n\\n root: Option<String>,\\n\\n) {\\n\\n // Always use CustomRoot for contructing the build directory. The actual runtime layout is respected\\n\\n let layout = Layout::new(&afs::server_build_dir());\\n\\n\\n\\n let build_type = if is_release { \\\"release\\\" } else { \\\"debug\\\" };\\n\\n let build_flag = if is_release { \\\"--release\\\" } else { \\\"\\\" };\\n\\n\\n\\n let mut server_features: Vec<&str> = vec![];\\n\\n let mut launcher_features: Vec<&str> = vec![];\\n\\n\\n\\n if bundle_ffmpeg {\\n\\n server_features.push(\\\"bundled_ffmpeg\\\");\\n\\n }\\n\\n if server_features.is_empty() {\\n\",\n \"file_path\": \"alvr/xtask/src/main.rs\",\n \"rank\": 15,\n \"score\": 159241.67555424006\n },\n {\n \"content\": \"pub fn shutdown_runtime() {\\n\\n if let Some(window) = MAYBE_WINDOW.lock().take() {\\n\\n window.close();\\n\\n }\\n\\n\\n\\n SHUTDOWN_NOTIFIER.notify_waiters();\\n\\n\\n\\n if let Some(runtime) = MAYBE_RUNTIME.lock().take() {\\n\\n runtime.shutdown_background();\\n\\n // shutdown_background() is non blocking and it does not guarantee that every internal\\n\\n // thread is terminated in a timely manner. Using shutdown_background() instead of just\\n\\n // dropping the runtime has the benefit of giving SteamVR a chance to clean itself as\\n\\n // much as possible before the process is killed because of alvr_launcher timeout.\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/lib.rs\",\n \"rank\": 16,\n \"score\": 159241.67555424006\n },\n {\n \"content\": \"pub fn invoke_installer() {\\n\\n try_close_steamvr_gracefully();\\n\\n\\n\\n spawn_no_window(Command::new(afs::installer_path()).arg(\\\"-q\\\"));\\n\\n\\n\\n // delete crash_log.txt (take advantage of the occasion to do some routine cleaning)\\n\\n fs::remove_file(\\n\\n afs::filesystem_layout_from_launcher_exe(&env::current_exe().unwrap()).crash_log(),\\n\\n )\\n\\n .ok();\\n\\n}\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 17,\n \"score\": 159241.67555424006\n },\n {\n \"content\": \"pub fn restart_steamvr() {\\n\\n try_close_steamvr_gracefully();\\n\\n\\n\\n if logging::show_err(maybe_register_alvr_driver()).is_some() {\\n\\n maybe_launch_steamvr();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 18,\n \"score\": 159241.67555424006\n },\n {\n \"content\": \"// todo: use a custom widget\\n\\npub fn button_group_clicked(ui: &mut Ui, options: &[LocalizedId], selection: &mut String) -> bool {\\n\\n let mut clicked = false;\\n\\n for id in options {\\n\\n if ui\\n\\n .selectable_value(selection, (**id).clone(), &id.trans)\\n\\n .clicked()\\n\\n {\\n\\n *selection = (**id).to_owned();\\n\\n clicked = true;\\n\\n }\\n\\n }\\n\\n\\n\\n clicked\\n\\n}\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/basic_components/button_group.rs\",\n \"rank\": 19,\n \"score\": 159097.75513158803\n },\n {\n \"content\": \"pub fn align_to_32(size: (i32, i32)) -> (i32, i32) {\\n\\n (\\n\\n (size.0 as f32 / 32_f32).ceil() as i32 * 32,\\n\\n (size.1 as f32 / 32_f32).ceil() as i32 * 32,\\n\\n )\\n\\n}\\n\\n\\n\\npub enum AlignmentDirection {\\n\\n Input,\\n\\n Output,\\n\\n}\\n\\n\\n\\n// Merge k slices then split the result into n slices\\n\\n// Slices are assumed to be packed and unpacked by this same pass, following a particular layout\\n\\n// determined by the number of slices and the shape of the reconstructed frame.\\n\\npub struct SlicingPass {\\n\\n inputs: Vec<TextureView>,\\n\\n pipeline: RenderPipeline,\\n\\n bind_group: BindGroup,\\n\\n input_slicing_layout: SlicingLayout,\\n\",\n \"file_path\": \"alvr/experiments/graphics_tests/src/compositor/slicing.rs\",\n \"rank\": 20,\n \"score\": 158588.86499340297\n },\n {\n \"content\": \"pub fn remove_build_dir() {\\n\\n let build_dir = afs::build_dir();\\n\\n fs::remove_dir_all(&build_dir).ok();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/main.rs\",\n \"rank\": 21,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"pub fn notify_application_update() {\\n\\n notify_shutdown_driver();\\n\\n\\n\\n alvr_commands::invoke_application_update(&FILESYSTEM_LAYOUT.launcher_exe()).ok();\\n\\n}\\n\\n\\n\\npub enum ClientListAction {\\n\\n AddIfMissing { display_name: String },\\n\\n TrustAndMaybeAddIp(Option<IpAddr>),\\n\\n RemoveIpOrEntry(Option<IpAddr>),\\n\\n}\\n\\n\\n\\npub async fn update_client_list(hostname: String, action: ClientListAction) {\\n\\n let mut client_connections = SESSION_MANAGER.lock().get().client_connections.clone();\\n\\n\\n\\n let maybe_client_entry = client_connections.entry(hostname);\\n\\n\\n\\n let mut updated = false;\\n\\n match action {\\n\\n ClientListAction::AddIfMissing { display_name } => {\\n\",\n \"file_path\": \"alvr/server/src/lib.rs\",\n \"rank\": 22,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"pub fn notify_shutdown_driver() {\\n\\n thread::spawn(|| {\\n\\n RESTART_NOTIFIER.notify_waiters();\\n\\n\\n\\n // give time to the control loop to send the restart packet (not crucial)\\n\\n thread::sleep(Duration::from_millis(100));\\n\\n\\n\\n shutdown_runtime();\\n\\n\\n\\n unsafe { ShutdownSteamvr() };\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/lib.rs\",\n \"rank\": 23,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"// Avoid Oculus link popups when debugging the client\\n\\npub fn kill_oculus_processes() {\\n\\n command::run_without_shell(\\n\\n \\\"powershell\\\",\\n\\n &[\\n\\n \\\"Start-Process\\\",\\n\\n \\\"taskkill\\\",\\n\\n \\\"-ArgumentList\\\",\\n\\n \\\"\\\\\\\"/F /IM OVR* /T\\\\\\\"\\\",\\n\\n \\\"-Verb\\\",\\n\\n \\\"runAs\\\",\\n\\n ],\\n\\n )\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/main.rs\",\n \"rank\": 24,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"pub fn maybe_launch_steamvr() {\\n\\n let mut system = System::new_with_specifics(RefreshKind::new().with_processes());\\n\\n system.refresh_processes();\\n\\n\\n\\n if system\\n\\n .process_by_name(&afs::exec_fname(\\\"vrserver\\\"))\\n\\n .is_empty()\\n\\n {\\n\\n #[cfg(windows)]\\n\\n spawn_no_window(Command::new(\\\"cmd\\\").args(&[\\\"/C\\\", \\\"start\\\", \\\"steam://rungameid/250820\\\"]));\\n\\n #[cfg(not(windows))]\\n\\n spawn_no_window(Command::new(\\\"steam\\\").args(&[\\\"steam://rungameid/250820\\\"]));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 25,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"pub fn init_logging() {\\n\\n #[cfg(target_os = \\\"android\\\")]\\n\\n android_logger::init_once(\\n\\n android_logger::Config::default()\\n\\n .with_tag(\\\"[ALVR NATIVE-RUST]\\\")\\n\\n .with_min_level(log::Level::Info),\\n\\n );\\n\\n\\n\\n alvr_common::logging::set_panic_hook();\\n\\n}\\n\",\n \"file_path\": \"alvr/client/src/logging_backend.rs\",\n \"rank\": 26,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"pub fn notify_restart_driver() {\\n\\n notify_shutdown_driver();\\n\\n\\n\\n alvr_commands::restart_steamvr(&FILESYSTEM_LAYOUT.launcher_exe()).ok();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/lib.rs\",\n \"rank\": 27,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"pub fn set_panic_hook() {\\n\\n std::panic::set_hook(Box::new(|panic_info| {\\n\\n let message = panic_info\\n\\n .payload()\\n\\n .downcast_ref::<&str>()\\n\\n .unwrap_or(&\\\"Unavailable\\\");\\n\\n let err_str = format!(\\n\\n \\\"Message: {:?}\\\\nBacktrace:\\\\n{:?}\\\",\\n\\n message,\\n\\n backtrace::Backtrace::new()\\n\\n );\\n\\n\\n\\n log::error!(\\\"{}\\\", err_str);\\n\\n\\n\\n #[cfg(windows)]\\n\\n std::thread::spawn(move || {\\n\\n msgbox::create(\\\"ALVR panicked\\\", &err_str, msgbox::IconType::Error).ok();\\n\\n });\\n\\n }))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/common/src/logging.rs\",\n \"rank\": 28,\n \"score\": 156026.95611729805\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_next_frame_batch(\\n\\n sample_buffer: &mut VecDeque<f32>,\\n\\n channels_count: usize,\\n\\n batch_frames_count: usize,\\n\\n) -> Vec<f32> {\\n\\n if sample_buffer.len() / channels_count >= batch_frames_count {\\n\\n let mut batch = sample_buffer\\n\\n .drain(0..batch_frames_count * channels_count)\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n if sample_buffer.len() / channels_count < batch_frames_count {\\n\\n // Render fade-out. It is completely contained in the current batch\\n\\n for f in 0..batch_frames_count {\\n\\n let volume = 1. - f as f32 / batch_frames_count as f32;\\n\\n for c in 0..channels_count {\\n\\n batch[f * channels_count + c] *= volume;\\n\\n }\\n\\n }\\n\\n }\\n\\n // fade-ins and cross-fades are rendered in the receive loop directly inside sample_buffer.\\n\",\n \"file_path\": \"alvr/audio/src/lib.rs\",\n \"rank\": 29,\n \"score\": 152997.22454900946\n },\n {\n \"content\": \" enum class FormatFeatureFlagBits : VkFormatFeatureFlags\\n\\n {\\n\\n eSampledImage = VK_FORMAT_FEATURE_SAMPLED_IMAGE_BIT,\\n\\n eStorageImage = VK_FORMAT_FEATURE_STORAGE_IMAGE_BIT,\\n\\n eStorageImageAtomic = VK_FORMAT_FEATURE_STORAGE_IMAGE_ATOMIC_BIT,\\n\\n eUniformTexelBuffer = VK_FORMAT_FEATURE_UNIFORM_TEXEL_BUFFER_BIT,\\n\\n eStorageTexelBuffer = VK_FORMAT_FEATURE_STORAGE_TEXEL_BUFFER_BIT,\\n\\n eStorageTexelBufferAtomic = VK_FORMAT_FEATURE_STORAGE_TEXEL_BUFFER_ATOMIC_BIT,\\n\\n eVertexBuffer = VK_FORMAT_FEATURE_VERTEX_BUFFER_BIT,\\n\\n eColorAttachment = VK_FORMAT_FEATURE_COLOR_ATTACHMENT_BIT,\\n\\n eColorAttachmentBlend = VK_FORMAT_FEATURE_COLOR_ATTACHMENT_BLEND_BIT,\\n\\n eDepthStencilAttachment = VK_FORMAT_FEATURE_DEPTH_STENCIL_ATTACHMENT_BIT,\\n\\n eBlitSrc = VK_FORMAT_FEATURE_BLIT_SRC_BIT,\\n\\n eBlitDst = VK_FORMAT_FEATURE_BLIT_DST_BIT,\\n\\n eSampledImageFilterLinear = VK_FORMAT_FEATURE_SAMPLED_IMAGE_FILTER_LINEAR_BIT,\\n\\n eTransferSrc = VK_FORMAT_FEATURE_TRANSFER_SRC_BIT,\\n\\n eTransferDst = VK_FORMAT_FEATURE_TRANSFER_DST_BIT,\\n\\n eMidpointChromaSamples = VK_FORMAT_FEATURE_MIDPOINT_CHROMA_SAMPLES_BIT,\\n\\n eSampledImageYcbcrConversionLinearFilter = VK_FORMAT_FEATURE_SAMPLED_IMAGE_YCBCR_CONVERSION_LINEAR_FILTER_BIT,\\n\\n eSampledImageYcbcrConversionSeparateReconstructionFilter = VK_FORMAT_FEATURE_SAMPLED_IMAGE_YCBCR_CONVERSION_SEPARATE_RECONSTRUCTION_FILTER_BIT,\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 30,\n \"score\": 152430.37030454513\n },\n {\n \"content\": \" enum class SubgroupFeatureFlagBits : VkSubgroupFeatureFlags\\n\\n {\\n\\n eBasic = VK_SUBGROUP_FEATURE_BASIC_BIT,\\n\\n eVote = VK_SUBGROUP_FEATURE_VOTE_BIT,\\n\\n eArithmetic = VK_SUBGROUP_FEATURE_ARITHMETIC_BIT,\\n\\n eBallot = VK_SUBGROUP_FEATURE_BALLOT_BIT,\\n\\n eShuffle = VK_SUBGROUP_FEATURE_SHUFFLE_BIT,\\n\\n eShuffleRelative = VK_SUBGROUP_FEATURE_SHUFFLE_RELATIVE_BIT,\\n\\n eClustered = VK_SUBGROUP_FEATURE_CLUSTERED_BIT,\\n\\n eQuad = VK_SUBGROUP_FEATURE_QUAD_BIT,\\n\\n ePartitionedNV = VK_SUBGROUP_FEATURE_PARTITIONED_BIT_NV};\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( SubgroupFeatureFlagBits value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case SubgroupFeatureFlagBits::eBasic : return \\\"Basic\\\";\\n\\n case SubgroupFeatureFlagBits::eVote : return \\\"Vote\\\";\\n\\n case SubgroupFeatureFlagBits::eArithmetic : return \\\"Arithmetic\\\";\\n\\n case SubgroupFeatureFlagBits::eBallot : return \\\"Ballot\\\";\\n\\n case SubgroupFeatureFlagBits::eShuffle : return \\\"Shuffle\\\";\\n\\n case SubgroupFeatureFlagBits::eShuffleRelative : return \\\"ShuffleRelative\\\";\\n\\n case SubgroupFeatureFlagBits::eClustered : return \\\"Clustered\\\";\\n\\n case SubgroupFeatureFlagBits::eQuad : return \\\"Quad\\\";\\n\\n case SubgroupFeatureFlagBits::ePartitionedNV : return \\\"PartitionedNV\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 31,\n \"score\": 152430.37030454513\n },\n {\n \"content\": \"pub fn modal(\\n\\n ui: &mut Ui,\\n\\n title: &str,\\n\\n content: impl FnOnce(&mut Ui, f32), // arg 2: available width\\n\\n do_not_show_again: Option<&mut bool>,\\n\\n visible: &mut bool,\\n\\n t: &SharedTranslation,\\n\\n) -> Option<ModalResponse> {\\n\\n let mut response = None;\\n\\n if *visible {\\n\\n Window::new(title)\\n\\n .collapsible(false)\\n\\n .resizable(false)\\n\\n .default_width(200_f32)\\n\\n .anchor(Align2::CENTER_CENTER, (0_f32, 0_f32))\\n\\n .show(ui.ctx(), |ui| {\\n\\n ui.vertical_centered_justified(|ui| {\\n\\n ui.add_space(10_f32);\\n\\n content(ui, ui.available_width() - 8_f32); // extra offset to avoid window resizing. todo: find origin\\n\\n ui.add_space(10_f32);\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/basic_components/modal.rs\",\n \"rank\": 32,\n \"score\": 150136.9599979623\n },\n {\n \"content\": \" enum class GeometryInstanceFlagBitsKHR : VkGeometryInstanceFlagsKHR\\n\\n {\\n\\n eTriangleFacingCullDisable = VK_GEOMETRY_INSTANCE_TRIANGLE_FACING_CULL_DISABLE_BIT_KHR,\\n\\n eTriangleFrontCounterclockwise = VK_GEOMETRY_INSTANCE_TRIANGLE_FRONT_COUNTERCLOCKWISE_BIT_KHR,\\n\\n eForceOpaque = VK_GEOMETRY_INSTANCE_FORCE_OPAQUE_BIT_KHR,\\n\\n eForceNoOpaque = VK_GEOMETRY_INSTANCE_FORCE_NO_OPAQUE_BIT_KHR,\\n\\n eTriangleCullDisable = VK_GEOMETRY_INSTANCE_TRIANGLE_CULL_DISABLE_BIT_NV};\\n\\n using GeometryInstanceFlagBitsNV = GeometryInstanceFlagBitsKHR;\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( GeometryInstanceFlagBitsKHR value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case GeometryInstanceFlagBitsKHR::eTriangleFacingCullDisable : return \\\"TriangleFacingCullDisable\\\";\\n\\n case GeometryInstanceFlagBitsKHR::eTriangleFrontCounterclockwise : return \\\"TriangleFrontCounterclockwise\\\";\\n\\n case GeometryInstanceFlagBitsKHR::eForceOpaque : return \\\"ForceOpaque\\\";\\n\\n case GeometryInstanceFlagBitsKHR::eForceNoOpaque : return \\\"ForceNoOpaque\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 34,\n \"score\": 147270.0403577539\n },\n {\n \"content\": \" enum class ExternalSemaphoreFeatureFlagBits : VkExternalSemaphoreFeatureFlags\\n\\n {\\n\\n eExportable = VK_EXTERNAL_SEMAPHORE_FEATURE_EXPORTABLE_BIT,\\n\\n eImportable = VK_EXTERNAL_SEMAPHORE_FEATURE_IMPORTABLE_BIT};\\n\\n using ExternalSemaphoreFeatureFlagBitsKHR = ExternalSemaphoreFeatureFlagBits;\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( ExternalSemaphoreFeatureFlagBits value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case ExternalSemaphoreFeatureFlagBits::eExportable : return \\\"Exportable\\\";\\n\\n case ExternalSemaphoreFeatureFlagBits::eImportable : return \\\"Importable\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 35,\n \"score\": 147265.7034294076\n },\n {\n \"content\": \" enum class ExternalFenceFeatureFlagBits : VkExternalFenceFeatureFlags\\n\\n {\\n\\n eExportable = VK_EXTERNAL_FENCE_FEATURE_EXPORTABLE_BIT,\\n\\n eImportable = VK_EXTERNAL_FENCE_FEATURE_IMPORTABLE_BIT};\\n\\n using ExternalFenceFeatureFlagBitsKHR = ExternalFenceFeatureFlagBits;\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( ExternalFenceFeatureFlagBits value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case ExternalFenceFeatureFlagBits::eExportable : return \\\"Exportable\\\";\\n\\n case ExternalFenceFeatureFlagBits::eImportable : return \\\"Importable\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 36,\n \"score\": 147265.7034294076\n },\n {\n \"content\": \" enum class PeerMemoryFeatureFlagBits : VkPeerMemoryFeatureFlags\\n\\n {\\n\\n eCopySrc = VK_PEER_MEMORY_FEATURE_COPY_SRC_BIT,\\n\\n eCopyDst = VK_PEER_MEMORY_FEATURE_COPY_DST_BIT,\\n\\n eGenericSrc = VK_PEER_MEMORY_FEATURE_GENERIC_SRC_BIT,\\n\\n eGenericDst = VK_PEER_MEMORY_FEATURE_GENERIC_DST_BIT};\\n\\n using PeerMemoryFeatureFlagBitsKHR = PeerMemoryFeatureFlagBits;\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( PeerMemoryFeatureFlagBits value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case PeerMemoryFeatureFlagBits::eCopySrc : return \\\"CopySrc\\\";\\n\\n case PeerMemoryFeatureFlagBits::eCopyDst : return \\\"CopyDst\\\";\\n\\n case PeerMemoryFeatureFlagBits::eGenericSrc : return \\\"GenericSrc\\\";\\n\\n case PeerMemoryFeatureFlagBits::eGenericDst : return \\\"GenericDst\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 37,\n \"score\": 147265.7034294076\n },\n {\n \"content\": \" enum class ExternalMemoryFeatureFlagBits : VkExternalMemoryFeatureFlags\\n\\n {\\n\\n eDedicatedOnly = VK_EXTERNAL_MEMORY_FEATURE_DEDICATED_ONLY_BIT,\\n\\n eExportable = VK_EXTERNAL_MEMORY_FEATURE_EXPORTABLE_BIT,\\n\\n eImportable = VK_EXTERNAL_MEMORY_FEATURE_IMPORTABLE_BIT};\\n\\n using ExternalMemoryFeatureFlagBitsKHR = ExternalMemoryFeatureFlagBits;\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( ExternalMemoryFeatureFlagBits value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case ExternalMemoryFeatureFlagBits::eDedicatedOnly : return \\\"DedicatedOnly\\\";\\n\\n case ExternalMemoryFeatureFlagBits::eExportable : return \\\"Exportable\\\";\\n\\n case ExternalMemoryFeatureFlagBits::eImportable : return \\\"Importable\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 38,\n \"score\": 147265.7034294076\n },\n {\n \"content\": \" enum class SwapchainCreateFlagBitsKHR : VkSwapchainCreateFlagsKHR\\n\\n {\\n\\n eSplitInstanceBindRegions = VK_SWAPCHAIN_CREATE_SPLIT_INSTANCE_BIND_REGIONS_BIT_KHR,\\n\\n eProtected = VK_SWAPCHAIN_CREATE_PROTECTED_BIT_KHR,\\n\\n eMutableFormat = VK_SWAPCHAIN_CREATE_MUTABLE_FORMAT_BIT_KHR};\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( SwapchainCreateFlagBitsKHR value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case SwapchainCreateFlagBitsKHR::eSplitInstanceBindRegions : return \\\"SplitInstanceBindRegions\\\";\\n\\n case SwapchainCreateFlagBitsKHR::eProtected : return \\\"Protected\\\";\\n\\n case SwapchainCreateFlagBitsKHR::eMutableFormat : return \\\"MutableFormat\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 39,\n \"score\": 147251.67086973923\n },\n {\n \"content\": \"pub fn is_steamvr_running() -> bool {\\n\\n let mut system = System::new_with_specifics(RefreshKind::new().with_processes());\\n\\n system.refresh_processes();\\n\\n\\n\\n !system\\n\\n .process_by_name(&afs::exec_fname(\\\"vrserver\\\"))\\n\\n .is_empty()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 40,\n \"score\": 147047.76809689926\n },\n {\n \"content\": \"// Use this when there is no way of determining the current path. The reulting Layout paths will\\n\\n// be invalid, expect for the ones that disregard the relative path (for example the config dir) and\\n\\n// the ones that have been overridden.\\n\\npub fn filesystem_layout_from_invalid() -> Layout {\\n\\n LAYOUT.clone().unwrap_or_else(|| Layout::new(Path::new(\\\"\\\")))\\n\\n}\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 42,\n \"score\": 144023.999955199\n },\n {\n \"content\": \"pub fn check_steamvr_installation() -> bool {\\n\\n alvr_commands::openvr_source_file_path().is_ok()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 43,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \"pub fn workspace_dir() -> PathBuf {\\n\\n Path::new(env!(\\\"CARGO_MANIFEST_DIR\\\")).join(\\\"../..\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 44,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \"pub fn target_dir() -> PathBuf {\\n\\n Path::new(env!(\\\"OUT_DIR\\\")).join(\\\"../../../..\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 45,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \"pub fn build_dir() -> PathBuf {\\n\\n workspace_dir().join(\\\"build\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 46,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \"pub fn installer_path() -> PathBuf {\\n\\n env::temp_dir().join(exec_fname(\\\"alvr_installer\\\"))\\n\\n}\\n\\n\\n\\n// Layout of the ALVR installation. All paths are absolute\\n\\n#[derive(Clone)]\\n\\npub struct Layout {\\n\\n // directory containing the launcher executable\\n\\n pub executables_dir: PathBuf,\\n\\n // (linux only) directory where alvr_vulkan_layer.so is saved\\n\\n pub libraries_dir: PathBuf,\\n\\n // parent directory of resources like the dashboard and presets folders\\n\\n pub static_resources_dir: PathBuf,\\n\\n // directory for storing configuration files (session.json)\\n\\n pub config_dir: PathBuf,\\n\\n // directory for storing log\\n\\n pub log_dir: PathBuf,\\n\\n // directory to register in openVR driver path\\n\\n pub openvr_driver_root_dir: PathBuf,\\n\\n // (linux only) parent directory of the executable to wrap vrcompositor\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 47,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \"pub fn deps_dir() -> PathBuf {\\n\\n workspace_dir().join(\\\"deps\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 48,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \"pub fn date_utc_yyyymmdd() -> String {\\n\\n let output = if cfg!(windows) {\\n\\n Command::new(\\\"powershell\\\")\\n\\n .arg(\\\"(Get-Date).ToUniversalTime().ToString(\\\\\\\"yyyy.MM.dd\\\\\\\")\\\")\\n\\n .output()\\n\\n .unwrap()\\n\\n } else {\\n\\n Command::new(\\\"date\\\")\\n\\n .args(&[\\\"-u\\\", \\\"+%Y.%m.%d\\\"])\\n\\n .output()\\n\\n .unwrap()\\n\\n };\\n\\n\\n\\n String::from_utf8_lossy(&output.stdout)\\n\\n .as_ref()\\n\\n .to_owned()\\n\\n .replace('\\\\r', \\\"\\\")\\n\\n .replace('\\\\n', \\\"\\\")\\n\\n}\\n\",\n \"file_path\": \"alvr/xtask/src/command.rs\",\n \"rank\": 49,\n \"score\": 144018.0365286107\n },\n {\n \"content\": \" enum class ExternalMemoryFeatureFlagBitsNV : VkExternalMemoryFeatureFlagsNV\\n\\n {\\n\\n eDedicatedOnly = VK_EXTERNAL_MEMORY_FEATURE_DEDICATED_ONLY_BIT_NV,\\n\\n eExportable = VK_EXTERNAL_MEMORY_FEATURE_EXPORTABLE_BIT_NV,\\n\\n eImportable = VK_EXTERNAL_MEMORY_FEATURE_IMPORTABLE_BIT_NV};\\n\\n\\n\\n VULKAN_HPP_INLINE std::string to_string( ExternalMemoryFeatureFlagBitsNV value )\\n\\n {\\n\\n switch ( value )\\n\\n {\\n\\n case ExternalMemoryFeatureFlagBitsNV::eDedicatedOnly : return \\\"DedicatedOnly\\\";\\n\\n case ExternalMemoryFeatureFlagBitsNV::eExportable : return \\\"Exportable\\\";\\n\\n case ExternalMemoryFeatureFlagBitsNV::eImportable : return \\\"Importable\\\";\\n\\n default: return \\\"invalid ( \\\" + VULKAN_HPP_NAMESPACE::toHexString( static_cast<uint32_t>( value ) ) + \\\" )\\\";\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vulkan.hpp\",\n \"rank\": 50,\n \"score\": 142447.17606224772\n },\n {\n \"content\": \"pub fn create_setting_container(\\n\\n schema: SchemaNode,\\n\\n session_fragment: json::Value,\\n\\n trans_path: &str,\\n\\n trans: &TranslationBundle,\\n\\n) -> Box<dyn SettingContainer> {\\n\\n match schema {\\n\\n SchemaNode::Section { entries } => {\\n\\n Box::new(Section::new(entries, session_fragment, trans_path, trans))\\n\\n }\\n\\n SchemaNode::Choice { default, variants } => Box::new(ChoiceContainer::new(\\n\\n variants,\\n\\n session_fragment,\\n\\n trans_path,\\n\\n trans,\\n\\n )),\\n\\n SchemaNode::Optional {\\n\\n default_set,\\n\\n content,\\n\\n } => Box::new(EmptyContainer),\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs\",\n \"rank\": 51,\n \"score\": 142441.7884979411\n },\n {\n \"content\": \"pub fn create_setting_control(\\n\\n schema: SchemaNode,\\n\\n session_fragment: json::Value,\\n\\n trans_path: &str,\\n\\n trans: &TranslationBundle,\\n\\n) -> Box<dyn SettingControl> {\\n\\n match schema {\\n\\n SchemaNode::Choice { default, variants } => Box::new(ChoiceControl::new(\\n\\n default,\\n\\n variants,\\n\\n session_fragment,\\n\\n trans_path,\\n\\n trans,\\n\\n )),\\n\\n SchemaNode::Optional {\\n\\n default_set,\\n\\n content,\\n\\n } => Box::new(EmptyControl),\\n\\n SchemaNode::Switch {\\n\\n default_enabled,\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs\",\n \"rank\": 52,\n \"score\": 142441.7884979411\n },\n {\n \"content\": \"pub fn split_string(source: &str, start_pattern: &str, end: char) -> (String, String, String) {\\n\\n let start_idx = source.find(start_pattern).unwrap() + start_pattern.len();\\n\\n let end_idx = start_idx + source[start_idx..].find(end).unwrap();\\n\\n\\n\\n (\\n\\n source[..start_idx].to_owned(),\\n\\n source[start_idx..end_idx].to_owned(),\\n\\n source[end_idx..].to_owned(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 53,\n \"score\": 142005.36995889703\n },\n {\n \"content\": \"pub fn server_build_dir() -> PathBuf {\\n\\n let server_build_dir = if cfg!(windows) {\\n\\n \\\"alvr_server_windows\\\"\\n\\n } else if cfg!(target_os = \\\"linux\\\") {\\n\\n \\\"alvr_server_linux\\\"\\n\\n } else if cfg!(target_os = \\\"macos\\\") {\\n\\n \\\"alvr_server_macos\\\"\\n\\n } else {\\n\\n unimplemented!()\\n\\n };\\n\\n\\n\\n build_dir().join(server_build_dir)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 54,\n \"score\": 141157.7719775635\n },\n {\n \"content\": \"pub fn unblock_alvr_addon() -> StrResult {\\n\\n let config_path = alvr_commands::steam_config_dir()?.join(\\\"steamvr.vrsettings\\\");\\n\\n\\n\\n let mut fields_ref: json::Map<String, json::Value> = trace_err!(json::from_str(&trace_err!(\\n\\n fs::read_to_string(&config_path)\\n\\n )?))?;\\n\\n\\n\\n fields_ref.remove(\\\"driver_alvr_server\\\");\\n\\n\\n\\n trace_err!(fs::write(\\n\\n config_path,\\n\\n trace_err!(json::to_string_pretty(&fields_ref))?\\n\\n ))?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 55,\n \"score\": 141157.7719775635\n },\n {\n \"content\": \"pub fn session_settings_default() -> SettingsDefault {\\n\\n SettingsDefault {\\n\\n video: VideoDescDefault {\\n\\n adapter_index: 0,\\n\\n preferred_fps: 72.,\\n\\n render_resolution: FrameSizeDefault {\\n\\n variant: FrameSizeDefaultVariant::Scale,\\n\\n Scale: 0.75,\\n\\n Absolute: FrameSizeAbsoluteDefault {\\n\\n width: 2880,\\n\\n height: 1600,\\n\\n },\\n\\n },\\n\\n recommended_target_resolution: FrameSizeDefault {\\n\\n variant: FrameSizeDefaultVariant::Scale,\\n\\n Scale: 0.75,\\n\\n Absolute: FrameSizeAbsoluteDefault {\\n\\n width: 2880,\\n\\n height: 1600,\\n\\n },\\n\",\n \"file_path\": \"alvr/session/src/settings.rs\",\n \"rank\": 56,\n \"score\": 141157.7719775635\n },\n {\n \"content\": \"fn align32(value: f32) -> u32 {\\n\\n ((value / 32.).floor() * 32.) as u32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/connection.rs\",\n \"rank\": 57,\n \"score\": 140819.4571580209\n },\n {\n \"content\": \"fn gui() -> impl Widget<View> {\\n\\n ViewSwitcher::new(\\n\\n |view: &View, _| view.clone(),\\n\\n |view, _, _| match view {\\n\\n View::RequirementsCheck { steamvr } => Box::new(\\n\\n Flex::row()\\n\\n .with_default_spacer()\\n\\n .with_flex_child(\\n\\n Flex::column()\\n\\n .cross_axis_alignment(CrossAxisAlignment::Start)\\n\\n .with_flex_spacer(1.0)\\n\\n .with_child(\\n\\n Label::new(steamvr.clone())\\n\\n .with_line_break_mode(LineBreaking::WordWrap),\\n\\n )\\n\\n .with_default_spacer()\\n\\n .with_flex_spacer(1.5),\\n\\n FlexParams::new(1.0, None),\\n\\n )\\n\\n .with_default_spacer(),\\n\",\n \"file_path\": \"alvr/launcher/src/main.rs\",\n \"rank\": 58,\n \"score\": 140783.66042652068\n },\n {\n \"content\": \"pub fn run_as_shell_in(workdir: &Path, shell: &str, shell_flag: &str, cmd: &str) -> StrResult {\\n\\n println!(\\\"\\\\n> {}\\\", cmd);\\n\\n\\n\\n let output = trace_err!(trace_err!(Command::new(shell)\\n\\n .args(&[shell_flag, cmd])\\n\\n .stdout(Stdio::inherit())\\n\\n .current_dir(workdir)\\n\\n .spawn())?\\n\\n .wait_with_output())?;\\n\\n\\n\\n if output.status.success() {\\n\\n Ok(())\\n\\n } else {\\n\\n fmt_e!(\\n\\n \\\"Command failed: {}\\\",\\n\\n String::from_utf8_lossy(&output.stderr)\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/command.rs\",\n \"rank\": 59,\n \"score\": 139097.15657065104\n },\n {\n \"content\": \"pub fn maybe_register_alvr_driver() -> StrResult {\\n\\n let alvr_driver_dir = afs::filesystem_layout_from_launcher_exe(&env::current_exe().unwrap())\\n\\n .openvr_driver_root_dir;\\n\\n\\n\\n let driver_registered = alvr_commands::get_driver_dir_from_registered()\\n\\n .ok()\\n\\n .filter(|dir| *dir == alvr_driver_dir)\\n\\n .is_some();\\n\\n\\n\\n if !driver_registered {\\n\\n let paths_backup = match alvr_commands::get_registered_drivers() {\\n\\n Ok(paths) => paths,\\n\\n Err(e) => {\\n\\n return fmt_e!(\\n\\n \\\"{}\\\\n{}\\\\n\\\\n({})\\\",\\n\\n \\\"Failed to load registered drivers.\\\",\\n\\n \\\"Please reset the drivers installation with the apposite button on the launcher.\\\",\\n\\n e\\n\\n )\\n\\n }\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 60,\n \"score\": 138453.14266082377\n },\n {\n \"content\": \"pub fn tabs<R>(\\n\\n ui: &mut Ui,\\n\\n tabs: &[LocalizedId],\\n\\n selected_tab: &mut String,\\n\\n content: impl FnOnce(&mut Ui) -> R,\\n\\n right_slot: impl FnOnce(&mut Ui),\\n\\n) -> R {\\n\\n ui.with_layout(\\n\\n Layout::top_down(Align::LEFT).with_cross_justify(true),\\n\\n |ui| {\\n\\n ui.with_layout(Layout::left_to_right().with_cross_align(Align::TOP), |ui| {\\n\\n for id in tabs {\\n\\n ui.selectable_value(selected_tab, (**id).clone(), &id.trans);\\n\\n }\\n\\n\\n\\n ui.with_layout(\\n\\n Layout::right_to_left().with_cross_align(Align::TOP),\\n\\n right_slot,\\n\\n );\\n\\n });\\n\\n\\n\\n ui.separator();\\n\\n\\n\\n content(ui)\\n\\n },\\n\\n )\\n\\n .inner\\n\\n}\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/basic_components/tabs.rs\",\n \"rank\": 61,\n \"score\": 138453.14266082377\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\npub fn maybe_wrap_vrcompositor_launcher() -> StrResult {\\n\\n let steamvr_bin_dir = alvr_commands::steamvr_root_dir()?\\n\\n .join(\\\"bin\\\")\\n\\n .join(\\\"linux64\\\");\\n\\n let real_launcher_path = steamvr_bin_dir.join(\\\"vrcompositor.real\\\");\\n\\n let launcher_path = steamvr_bin_dir.join(\\\"vrcompositor\\\");\\n\\n\\n\\n // In case of SteamVR update, vrcompositor will be restored\\n\\n match fs::read_link(&launcher_path) {\\n\\n Err(_) => match fs::metadata(&launcher_path) {\\n\\n Err(_) => (), //file does not exist, do nothing\\n\\n Ok(_) => {\\n\\n trace_err!(fs::rename(&launcher_path, &real_launcher_path))?;\\n\\n }\\n\\n },\\n\\n Ok(_) => trace_err!(fs::remove_file(&launcher_path))?, // recreate the link\\n\\n };\\n\\n\\n\\n trace_err!(std::os::unix::fs::symlink(\\n\\n afs::filesystem_layout_from_launcher_exe(&env::current_exe().unwrap())\\n\\n .vrcompositor_wrapper(),\\n\\n &launcher_path\\n\\n ))?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 62,\n \"score\": 138453.14266082377\n },\n {\n \"content\": \"#[cfg(not(windows))]\\n\\nfn spawn_no_window(command: &mut Command) {\\n\\n command.spawn().ok();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/launcher/src/commands.rs\",\n \"rank\": 63,\n \"score\": 137788.79075615987\n },\n {\n \"content\": \"fn mbits_to_bytes(value: u64) -> u32 {\\n\\n (value * 1024 * 1024 / 8) as u32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/connection.rs\",\n \"rank\": 64,\n \"score\": 137788.79075615987\n },\n {\n \"content\": \"pub fn publish_client(is_nightly: bool) {\\n\\n build_client(!is_nightly, is_nightly, false);\\n\\n build_client(!is_nightly, is_nightly, true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/main.rs\",\n \"rank\": 65,\n \"score\": 137739.6644307641\n },\n {\n \"content\": \"pub fn log_event(id: Event) {\\n\\n log::info!(\\\"#{}#\\\", serde_json::to_string(&id).unwrap());\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! fmt_e {\\n\\n ($($args:tt)+) => {\\n\\n Err(format!($($args)+))\\n\\n };\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! trace_str {\\n\\n () => {\\n\\n format!(\\\"At {}:{}\\\", file!(), line!())\\n\\n };\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! trace_err {\\n\",\n \"file_path\": \"alvr/common/src/logging.rs\",\n \"rank\": 66,\n \"score\": 137739.6644307641\n },\n {\n \"content\": \"pub fn build_deps(target_os: &str) {\\n\\n if target_os == \\\"windows\\\" {\\n\\n command::run(\\\"cargo install wasm-pack\\\").unwrap();\\n\\n } else if target_os == \\\"android\\\" {\\n\\n command::run(\\\"rustup target add aarch64-linux-android\\\").unwrap();\\n\\n build_rust_android_gradle();\\n\\n } else {\\n\\n println!(\\\"Nothing to do for {}!\\\", target_os)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"alvr/xtask/src/dependencies.rs\",\n \"rank\": 67,\n \"score\": 134879.39987971686\n },\n {\n \"content\": \" uint32_t version;\\n\",\n \"file_path\": \"alvr/server/cpp/platform/win32/amf/include/core/vulkan/vk_layer.h\",\n \"rank\": 68,\n \"score\": 133935.14516548076\n },\n {\n \"content\": \"fn bump_client_gradle_version(new_version: &str, is_nightly: bool) {\\n\\n let gradle_file_path = afs::workspace_dir()\\n\\n .join(\\\"alvr/client/android/app\\\")\\n\\n .join(\\\"build.gradle\\\");\\n\\n let file_content = fs::read_to_string(&gradle_file_path).unwrap();\\n\\n\\n\\n // Replace versionName\\n\\n let (file_start, _, file_end) = split_string(&file_content, \\\"versionName \\\\\\\"\\\", '\\\\\\\"');\\n\\n let file_content = format!(\\\"{}{}{}\\\", file_start, new_version, file_end);\\n\\n\\n\\n let file_content = if !is_nightly {\\n\\n // Replace versionCode\\n\\n let (file_start, old_version_code_string, file_end) =\\n\\n split_string(&file_content, \\\"versionCode \\\", '\\\\n');\\n\\n format!(\\n\\n \\\"{}{}{}\\\",\\n\\n file_start,\\n\\n old_version_code_string.parse::<usize>().unwrap() + 1,\\n\\n file_end\\n\\n )\\n\\n } else {\\n\\n file_content\\n\\n };\\n\\n\\n\\n fs::write(gradle_file_path, file_content).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 69,\n \"score\": 132099.03405772668\n },\n {\n \"content\": \"fn bump_rpm_spec_version(new_version: &str, is_nightly: bool) {\\n\\n let spec_path = afs::workspace_dir().join(\\\"packaging/rpm/alvr.spec\\\");\\n\\n let spec = fs::read_to_string(&spec_path).unwrap();\\n\\n\\n\\n // If there's a '-', split the version around it\\n\\n let (version_start, version_end) = {\\n\\n if new_version.contains('-') {\\n\\n let (_, tmp_start, mut tmp_end) = split_string(new_version, \\\"\\\", '-');\\n\\n tmp_end.remove(0);\\n\\n (\\n\\n tmp_start,\\n\\n if is_nightly {\\n\\n format!(\\\"0.0.1{}+nightly.{}\\\", tmp_end, date_utc_yyyymmdd())\\n\\n } else {\\n\\n format!(\\\"0.0.1{}\\\", tmp_end)\\n\\n },\\n\\n )\\n\\n } else {\\n\\n (new_version.to_string(), \\\"1.0.0\\\".to_string())\\n\\n }\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 70,\n \"score\": 132099.03405772668\n },\n {\n \"content\": \"fn packages_dir() -> PathBuf {\\n\\n Path::new(env!(\\\"CARGO_MANIFEST_DIR\\\"))\\n\\n .parent()\\n\\n .unwrap()\\n\\n .into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 71,\n \"score\": 130668.83097815543\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\nfn do_ffmpeg_pkg_config(build: &mut cc::Build) {\\n\\n let ffmpeg_path = env::var(\\\"CARGO_MANIFEST_DIR\\\").unwrap() + \\\"/../../deps/linux/FFmpeg-n4.4/\\\";\\n\\n\\n\\n #[cfg(feature = \\\"bundled_ffmpeg\\\")]\\n\\n {\\n\\n for lib in vec![\\\"libavutil\\\", \\\"libavfilter\\\", \\\"libavcodec\\\", \\\"libswscale\\\"] {\\n\\n let path = ffmpeg_path.clone() + lib;\\n\\n env::set_var(\\n\\n \\\"PKG_CONFIG_PATH\\\",\\n\\n env::var(\\\"PKG_CONFIG_PATH\\\").map_or(path.clone(), |old| format!(\\\"{}:{}\\\", path, old)),\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n let pkg = pkg_config::Config::new()\\n\\n .cargo_metadata(cfg!(not(feature = \\\"bundled_ffmpeg\\\")))\\n\\n .to_owned();\\n\\n let avutil = pkg.probe(\\\"libavutil\\\").unwrap();\\n\\n let avfilter = pkg.probe(\\\"libavfilter\\\").unwrap();\\n\\n let avcodec = pkg.probe(\\\"libavcodec\\\").unwrap();\\n\",\n \"file_path\": \"alvr/server/build.rs\",\n \"rank\": 72,\n \"score\": 130288.54192611459\n },\n {\n \"content\": \"pub fn zip(source: &Path) -> StrResult {\\n\\n if cfg!(windows) {\\n\\n run_without_shell(\\n\\n \\\"powershell\\\",\\n\\n &[\\n\\n \\\"Compress-Archive\\\",\\n\\n &source.to_string_lossy(),\\n\\n &format!(\\\"{}.zip\\\", source.to_string_lossy()),\\n\\n ],\\n\\n )\\n\\n } else {\\n\\n run_without_shell(\\n\\n \\\"zip\\\",\\n\\n &[\\n\\n \\\"-r\\\",\\n\\n &format!(\\\"{}.zip\\\", source.to_string_lossy()),\\n\\n &source.to_string_lossy(),\\n\\n ],\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/command.rs\",\n \"rank\": 73,\n \"score\": 130242.59511515737\n },\n {\n \"content\": \"#[cfg(windows)]\\n\\npub fn exec_fname(name: &str) -> String {\\n\\n format!(\\\"{}.exe\\\", name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 74,\n \"score\": 130242.59511515737\n },\n {\n \"content\": \"pub fn run(cmd: &str) -> StrResult {\\n\\n run_in(&env::current_dir().unwrap(), cmd)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/command.rs\",\n \"rank\": 75,\n \"score\": 130242.59511515737\n },\n {\n \"content\": \"#[cfg(target_os = \\\"macos\\\")]\\n\\npub fn dynlib_fname(name: &str) -> String {\\n\\n format!(\\\"lib{}.dylib\\\", name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 76,\n \"score\": 130242.59511515737\n },\n {\n \"content\": \"fn bump_cargo_version(crate_dir_name: &str, new_version: &str) {\\n\\n let manifest_path = packages_dir().join(crate_dir_name).join(\\\"Cargo.toml\\\");\\n\\n\\n\\n let manifest = fs::read_to_string(&manifest_path).unwrap();\\n\\n\\n\\n let (file_start, _, file_end) = split_string(&manifest, \\\"version = \\\\\\\"\\\", '\\\\\\\"');\\n\\n let manifest = format!(\\\"{}{}{}\\\", file_start, new_version, file_end);\\n\\n\\n\\n fs::write(manifest_path, manifest).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/xtask/src/version.rs\",\n \"rank\": 77,\n \"score\": 130017.4058554035\n },\n {\n \"content\": \"pub fn steam_config_dir() -> StrResult<PathBuf> {\\n\\n get_single_openvr_path(\\\"config\\\")\\n\\n}\\n\",\n \"file_path\": \"alvr/commands/src/openvrpaths.rs\",\n \"rank\": 78,\n \"score\": 129613.41008397835\n },\n {\n \"content\": \"pub fn steamvr_root_dir() -> StrResult<PathBuf> {\\n\\n get_single_openvr_path(\\\"runtime\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/commands/src/openvrpaths.rs\",\n \"rank\": 79,\n \"score\": 129613.41008397835\n },\n {\n \"content\": \"pub fn show_e<E: Display>(e: E) {\\n\\n show_e_block(e, false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/common/src/logging.rs\",\n \"rank\": 80,\n \"score\": 129538.24256519851\n },\n {\n \"content\": \"pub fn show_w<W: Display>(w: W) {\\n\\n log::warn!(\\\"{}\\\", w);\\n\\n\\n\\n // GDK crashes because of initialization in multiple thread\\n\\n #[cfg(windows)]\\n\\n std::thread::spawn({\\n\\n let warn_string = w.to_string();\\n\\n move || {\\n\\n msgbox::create(\\n\\n \\\"ALVR encountered a non-fatal error\\\",\\n\\n &warn_string,\\n\\n msgbox::IconType::Info,\\n\\n )\\n\\n .ok();\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/common/src/logging.rs\",\n \"rank\": 81,\n \"score\": 129538.24256519851\n },\n {\n \"content\": \"#[proc_macro_derive(SettingsSchema, attributes(schema))]\\n\\npub fn create_settings_schema_fn_and_default_ty(input: TokenStream) -> TokenStream {\\n\\n let input = syn::parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n match schema(input) {\\n\\n Ok(tokens) => tokens.into(),\\n\\n Err(e) => e,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"alvr/settings-schema-derive/src/lib.rs\",\n \"rank\": 82,\n \"score\": 128748.52260943047\n },\n {\n \"content\": \"pub fn set_game_output_audio_device_id(id: String) {\\n\\n set_property(\\n\\n vr::k_unTrackedDeviceIndex_Hmd,\\n\\n vr::Prop_Audio_DefaultPlaybackDeviceId_String,\\n\\n OpenvrPropValue::String(id),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/server/src/openvr.rs\",\n \"rank\": 83,\n \"score\": 127184.22837969572\n },\n {\n \"content\": \"pub fn get_driver_dir() -> StrResult<PathBuf> {\\n\\n get_driver_dir_from_registered()\\n\\n .map_err(|e| format!(\\\"ALVR driver path not stored and not registered ({})\\\", e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/commands/src/openvr_drivers.rs\",\n \"rank\": 84,\n \"score\": 127184.22837969572\n },\n {\n \"content\": \"pub fn openvr_source_file_path() -> StrResult<PathBuf> {\\n\\n let path = trace_none!(if cfg!(windows) {\\n\\n dirs::cache_dir()\\n\\n } else {\\n\\n dirs::config_dir()\\n\\n })?\\n\\n .join(\\\"openvr/openvrpaths.vrpath\\\");\\n\\n\\n\\n if path.exists() {\\n\\n Ok(path)\\n\\n } else {\\n\\n fmt_e!(\\\"{} does not exist\\\", path.to_string_lossy())\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) fn load_openvr_paths_json() -> StrResult<json::Value> {\\n\\n let file = trace_err!(File::open(openvr_source_file_path()?))?;\\n\\n\\n\\n let mut file_content_decoded = String::new();\\n\\n trace_err!(DecodeReaderBytes::new(&file).read_to_string(&mut file_content_decoded))?;\\n\",\n \"file_path\": \"alvr/commands/src/openvrpaths.rs\",\n \"rank\": 85,\n \"score\": 127184.22837969572\n },\n {\n \"content\": \"pub fn set_headset_microphone_audio_device_id(id: String) {\\n\\n set_property(\\n\\n vr::k_unTrackedDeviceIndex_Hmd,\\n\\n vr::Prop_Audio_DefaultRecordingDeviceId_String,\\n\\n OpenvrPropValue::String(id),\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"alvr/server/src/openvr.rs\",\n \"rank\": 86,\n \"score\": 127184.22837969572\n },\n {\n \"content\": \"pub fn get_devices_list() -> StrResult<AudioDevicesList> {\\n\\n let host = cpal::default_host();\\n\\n\\n\\n let output = trace_err!(host.output_devices())?\\n\\n .filter_map(|d| d.name().ok())\\n\\n .collect::<Vec<_>>();\\n\\n let input = trace_err!(host.input_devices())?\\n\\n .filter_map(|d| d.name().ok())\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n Ok(AudioDevicesList { output, input })\\n\\n}\\n\\n\\n\\npub enum AudioDeviceType {\\n\\n Output,\\n\\n Input,\\n\\n\\n\\n // for the virtual microphone devices, input and output labels are swapped\\n\\n VirtualMicrophoneInput,\\n\\n VirtualMicrophoneOutput { matching_input_device_name: String },\\n\",\n \"file_path\": \"alvr/audio/src/lib.rs\",\n \"rank\": 87,\n \"score\": 127184.22837969572\n },\n {\n \"content\": \"pub fn show_e_blocking<E: Display>(e: E) {\\n\\n show_e_block(e, true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/common/src/logging.rs\",\n \"rank\": 88,\n \"score\": 126677.9780141513\n },\n {\n \"content\": \"// The path should include the executable file name\\n\\n// The path argument is used only if ALVR is built as portable\\n\\npub fn filesystem_layout_from_launcher_exe(path: &Path) -> Layout {\\n\\n LAYOUT.clone().unwrap_or_else(|| {\\n\\n let root = if cfg!(any(windows, target_os = \\\"macos\\\")) {\\n\\n path.parent().unwrap().to_owned()\\n\\n } else if cfg!(target_os = \\\"linux\\\") {\\n\\n // FHS path is expected\\n\\n path.parent().unwrap().parent().unwrap().to_owned()\\n\\n } else {\\n\\n unimplemented!()\\n\\n };\\n\\n\\n\\n Layout::new(&root)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/filesystem/src/lib.rs\",\n \"rank\": 89,\n \"score\": 124983.00598283297\n },\n {\n \"content\": \"pub fn restart_steamvr(launcher_path: &Path) -> StrResult {\\n\\n invoke_launcher(launcher_path, \\\"--restart-steamvr\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/commands/src/launcher.rs\",\n \"rank\": 90,\n \"score\": 124976.60531941884\n },\n {\n \"content\": \"pub fn build_ffmpeg_linux() -> std::path::PathBuf {\\n\\n // dependencies: build-essential pkg-config nasm libva-dev libdrm-dev libvulkan-dev libx264-dev libx265-dev\\n\\n\\n\\n let download_path = afs::deps_dir().join(\\\"linux\\\");\\n\\n let ffmpeg_path = download_path.join(\\\"FFmpeg-n4.4\\\");\\n\\n if !ffmpeg_path.exists() {\\n\\n download_and_extract_zip(\\n\\n \\\"https://codeload.github.com/FFmpeg/FFmpeg/zip/n4.4\\\",\\n\\n &download_path,\\n\\n );\\n\\n }\\n\\n\\n\\n bash_in(\\n\\n &ffmpeg_path,\\n\\n &format!(\\n\\n \\\"./configure {} {} {} {} {} {} {} {} {} {}\\\",\\n\\n \\\"--enable-gpl --enable-version3\\\",\\n\\n \\\"--disable-static --enable-shared\\\",\\n\\n \\\"--disable-programs\\\",\\n\\n \\\"--disable-doc\\\",\\n\",\n \"file_path\": \"alvr/xtask/src/dependencies.rs\",\n \"rank\": 91,\n \"score\": 124976.60531941884\n },\n {\n \"content\": \"pub fn get_driver_dir_from_registered() -> StrResult<PathBuf> {\\n\\n for dir in get_registered_drivers()? {\\n\\n let maybe_driver_name = || -> StrResult<_> {\\n\\n let manifest_string =\\n\\n trace_err!(fs::read_to_string(dir.join(\\\"driver.vrdrivermanifest\\\")))?;\\n\\n let mut manifest_map = trace_err!(json::from_str::<HashMap<String, json::Value>>(\\n\\n &manifest_string\\n\\n ))?;\\n\\n\\n\\n trace_none!(manifest_map.remove(\\\"name\\\"))\\n\\n }();\\n\\n\\n\\n if maybe_driver_name == Ok(json::Value::String(\\\"alvr_server\\\".to_owned())) {\\n\\n return Ok(dir);\\n\\n }\\n\\n }\\n\\n fmt_e!(\\\"ALVR driver path not registered\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/commands/src/openvr_drivers.rs\",\n \"rank\": 92,\n \"score\": 124877.2511997872\n },\n {\n \"content\": \"pub fn map_fragment<T: Serialize>(\\n\\n res: Option<SettingsResponse>,\\n\\n map: impl FnOnce(json::Value) -> T,\\n\\n) -> Option<SettingsResponse> {\\n\\n match res {\\n\\n Some(SettingsResponse::SessionFragment(fragment)) => {\\n\\n Some(super::into_fragment(map(fragment)))\\n\\n }\\n\\n res => res,\\n\\n }\\n\\n}\\n\\n\\n\\npub struct SettingsContext {\\n\\n pub advanced: bool,\\n\\n pub view_width: f32,\\n\\n pub t: Arc<SharedTranslation>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alvr/experiments/gui/src/dashboard/components/settings_controls/mod.rs\",\n \"rank\": 93,\n \"score\": 124877.2511997872\n },\n {\n \"content\": \"// Errors:\\n\\n// 1: firewall rule is already set\\n\\n// 126: pkexec request dismissed\\n\\n// other: command failed\\n\\npub fn firewall_rules(add: bool) -> Result<(), i32> {\\n\\n let exit_status;\\n\\n\\n\\n if cfg!(target_os = \\\"linux\\\") {\\n\\n let action = if add { \\\"add\\\" } else { \\\"remove\\\" };\\n\\n // run as normal user since we use pkexec to sudo\\n\\n exit_status = Command::new(\\\"bash\\\")\\n\\n .arg(\\\"/usr/libexec/alvr/alvr_fw_config.sh\\\")\\n\\n .arg(action)\\n\\n .status()\\n\\n .map_err(|_| -1)?;\\n\\n } else {\\n\\n let script_path = env::temp_dir().join(\\\"alvr_firewall_rules.bat\\\");\\n\\n let firewall_rules_script_content = if add {\\n\\n format!(\\n\\n \\\"{}\\\\n{}\\\",\\n\\n netsh_add_rule_command_string(\\n\\n \\\"SteamVR ALVR vrserver\\\",\\n\\n &crate::steamvr_root_dir()\\n\\n .map_err(|_| -1)?\\n\",\n \"file_path\": \"alvr/commands/src/firewall.rs\",\n \"rank\": 94,\n \"score\": 123973.34869741155\n }\n]","isConversational":false}}},{"rowIdx":1994,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"gtk/src/auto/text_tag_table.rs"},"repo_name":{"kind":"string","value":"pop-os/gtk-rs"},"commit":{"kind":"string","value":"0a0e50a2f5ea8f816c005bd8c3d145a5a9581d8c"},"file_code":{"kind":"string","value":"\n\nuse crate::Buildable;\nuse crate::TextTag;\nuse glib::object::Cast;\nuse glib::object::IsA;\nuse glib::signal::connect_raw;\nuse glib::signal::SignalHandlerId;\nuse glib::translate::*;\nuse std::boxed::Box as Box_;\nuse std::fmt;\nuse std::mem::transmute;\n\nglib::wrapper! {\n pub struct TextTagTable(Object<ffi::GtkTextTagTable, ffi::GtkTextTagTableClass>) @implements Buildable;\n\n match fn {\n get_type => || ffi::gtk_text_tag_table_get_type(),\n }\n}\n\nimpl TextTagTable {\n pub fn new() -> TextTagTable {\n assert_initialized_main_thread!();\n unsafe { from_glib_full(ffi::gtk_text_tag_table_new()) }\n }\n}\n\nimpl Default for TextTagTable {\n fn default() -> Self {\n Self::new()\n }\n}\n\npub const NONE_TEXT_TAG_TABLE: Option<&TextTagTable> = None;\n\npub trait TextTagTableExt: 'static {\n fn add<P: IsA<TextTag>>(&self, tag: &P) -> bool;\n\n fn foreach<P: FnMut(&TextTag)>(&self, func: P);\n\n fn get_size(&self) -> i32;\n\n fn lookup(&self, name: &str) -> Option<TextTag>;\n\n fn remove<P: IsA<TextTag>>(&self, tag: &P);\n\n fn connect_tag_added<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId;\n\n fn connect_tag_changed<F: Fn(&Self, &TextTag, bool) + 'static>(&self, f: F) -> SignalHandlerId;\n\n fn connect_tag_removed<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId;\n}\n\nimpl<O: IsA<TextTagTable>> TextTagTableExt for O {\n fn add<P: IsA<TextTag>>(&self, tag: &P) -> bool {\n unsafe {\n from_glib(ffi::gtk_text_tag_table_add(\n self.as_ref().to_glib_none().0,\n tag.as_ref().to_glib_none().0,\n ))\n }\n }\n\n fn foreach<P: FnMut(&TextTag)>(&self, func: P) {\n let func_data: P = func;\n unsafe extern \"C\" fn func_func<P: FnMut(&TextTag)>(\n tag: *mut ffi::GtkTextTag,\n data: glib::ffi::gpointer,\n ) {\n let tag = from_glib_borrow(tag);\n let callback: *mut P = data as *const _ as usize as *mut P;\n (*callback)(&tag);\n }\n let func = Some(func_func::<P> as _);\n let super_callback0: &P = &func_data;\n unsafe {\n ffi::gtk_text_tag_table_foreach(\n self.as_ref().to_glib_none().0,\n func,\n super_callback0 as *const _ as usize as *mut _,\n );\n }\n }\n\n fn get_size(&self) -> i32 {\n unsafe { ffi::gtk_text_tag_table_get_size(self.as_ref().to_glib_none().0) }\n }\n\n fn lookup(&self, name: &str) -> Option<TextTag> {\n unsafe {\n from_glib_none(ffi::gtk_text_tag_table_lookup(\n self.as_ref().to_glib_none().0,\n name.to_glib_none().0,\n ))\n }\n }\n\n fn remove<P: IsA<TextTag>>(&self, tag: &P) {\n unsafe {\n ffi::gtk_text_tag_table_remove(\n self.as_ref().to_glib_none().0,\n tag.as_ref().to_glib_none().0,\n );\n }\n }\n\n fn connect_tag_added<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId {\n unsafe extern \"C\" fn tag_added_trampoline<P, F: Fn(&P, &TextTag) + 'static>(\n this: *mut ffi::GtkTextTagTable,\n tag: *mut ffi::GtkTextTag,\n f: glib::ffi::gpointer,\n ) where\n P: IsA<TextTagTable>,\n {\n let f: &F = &*(f as *const F);\n f(\n &TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),\n &from_glib_borrow(tag),\n )\n }\n unsafe {\n let f: Box_<F> = Box_::new(f);\n connect_raw(\n self.as_ptr() as *mut _,\n b\"tag-added\\0\".as_ptr() as *const _,\n Some(transmute::<_, unsafe extern \"C\" fn()>(\n tag_added_trampoline::<Self, F> as *const (),\n )),\n Box_::into_raw(f),\n )\n }\n }\n\n fn connect_tag_changed<F: Fn(&Self, &TextTag, bool) + 'static>(&self, f: F) -> SignalHandlerId {\n unsafe extern \"C\" fn tag_changed_trampoline<P, F: Fn(&P, &TextTag, bool) + 'static>(\n this: *mut ffi::GtkTextTagTable,\n tag: *mut ffi::GtkTextTag,\n size_changed: glib::ffi::gboolean,\n f: glib::ffi::gpointer,\n ) where\n P: IsA<TextTagTable>,\n {\n let f: &F = &*(f as *const F);\n f(\n &TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),\n &from_glib_borrow(tag),\n from_glib(size_changed),\n )\n }\n unsafe {\n let f: Box_<F> = Box_::new(f);\n connect_raw(\n self.as_ptr() as *mut _,\n b\"tag-changed\\0\".as_ptr() as *const _,\n Some(transmute::<_, unsafe extern \"C\" fn()>(\n tag_changed_trampoline::<Self, F> as *const (),\n )),\n Box_::into_raw(f),\n )\n }\n }\n\n fn connect_tag_removed<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId {\n unsafe extern \"C\" fn tag_removed_trampoline<P, F: Fn(&P, &TextTag) + 'static>(\n this: *mut ffi::GtkTextTagTable,\n tag: *mut ffi::GtkTextTag,\n f: glib::ffi::gpointer,\n ) where\n P: IsA<TextTagTable>,\n {\n let f: &F = &*(f as *const F);\n f(\n &TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),\n &from_glib_borrow(tag),\n )\n }\n unsafe {\n let f: Box_<F> = Box_::new(f);\n connect_raw(\n self.as_ptr() as *mut _,\n b\"tag-removed\\0\".as_ptr() as *const _,\n Some(transmute::<_, unsafe extern \"C\" fn()>(\n tag_removed_trampoline::<Self, F> as *const (),\n )),\n Box_::into_raw(f),\n )\n }\n }\n}\n\nimpl fmt::Display for TextTagTable {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n f.write_str(\"TextTagTable\")\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::Buildable;\nuse crate::TextTag;\nuse glib::object::Cast;\nuse glib::object::IsA;\nuse glib::signal::connect_raw;\nuse glib::signal::SignalHandlerId;\nuse glib::translate::*;\nuse std::boxed::Box as Box_;\nuse std::fmt;\nuse std::mem::transmute;\n\nglib::wrapper! {\n pub struct TextTagTable(Object<ffi::GtkTextTagTable, ffi::GtkTextTagTableClass>) @implements Buildable;\n\n match fn {\n get_type => || ffi::gtk_text_tag_table_get_type(),\n }\n}\n\nimpl TextTagTable {\n pub fn new() -> TextTagTable {\n assert_initialized_main_thread!();\n unsafe { from_glib_full(ffi::gtk_text_tag_table_new()) }\n }\n}\n\nimpl Default for TextTagTable {\n fn default() -> Self {\n Self::new()\n }\n}\n\npub const NONE_TEXT_TAG_TABLE: Option<&TextTagTable> = None;\n\npub trait TextTagTableExt: 'static {\n fn add<P: IsA<TextTag>>(&self, tag: &P) -> bool;\n\n fn foreach<P: FnMut(&TextTag)>(&self, func: P);\n\n fn get_size(&self) -> i32;\n\n fn lookup(&self, name: &str) -> Option<TextTag>;\n\n fn remove<P: IsA<TextTag>>(&self, tag: &P);\n\n fn connect_tag_added<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId;\n\n fn connect_tag_changed<F: Fn(&Self, &TextTag, bool) + 'static>(&self, f: F) -> SignalHandlerId;\n\n fn connect_tag_removed<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId;\n}\n\nimpl<O: IsA<TextTagTable>> TextTagTableExt for O {\n fn add<P: IsA<TextTag>>(&self, tag: &P) -> bool {\n unsafe {\n from_glib(ffi::gtk_text_tag_table_add(\n self.as_ref().to_glib_none().0,\n tag.as_ref().to_glib_none().0,\n ))\n }\n }\n\n fn foreach<P: FnMut(&TextTag)>(&self, func: P) {\n let func_data: P = func;\n unsafe extern \"C\" fn func_func<P: FnMut(&TextTag)>(\n tag: *mut ffi::GtkTextTag,\n data: glib::ffi::gpointer,\n ) {\n let tag = from_glib_borrow(tag);\n let callback: *mut P = data as *const _ as usize as *mut P;\n (*callback)(&tag);\n }\n let func = Some(func_func::<P> as _);\n let super_callback0: &P = &func_data;\n unsafe {\n ffi::gtk_text_tag_table_foreach(\n self.as_ref().to_glib_none().0,\n func,\n super_callback0 as *const _ as usize as *mut _,\n );\n }\n }\n\n fn get_size(&self) -> i32 {\n unsafe { ffi::gtk_text_tag_table_get_size(self.as_ref().to_glib_none().0) }\n }\n\n fn lookup(&self, name: &str) -> Option<TextTag> {\n unsafe {\n from_glib_none(ffi::gtk_text_tag_table_lookup(\n self.as_ref().to_glib_none().0,\n name.to_glib_none().0,\n ))\n }\n }\n\n fn remove<P: IsA<TextTag>>(&self, tag: &P) {\n unsafe {\n ffi::gtk_text_tag_table_remove(\n self.as_ref().to_glib_none().0,\n tag.as_ref().to_glib_none().0,\n );\n }\n }\n\n fn connect_tag_added<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId {\n unsafe extern \"C\" fn tag_added_trampoline<P, F: Fn(&P, &TextTag) + 'static>(\n this: *mut ffi::GtkTextTagTable,\n tag: *mut ffi::GtkTextTag,\n f: glib::ffi::gpointer,\n ) where\n P: IsA<TextTagTable>,\n {\n let f: &F = &*(f as *const F);\n f(\n &TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),\n &from_glib_borrow(tag),\n )\n }\n unsafe {\n let f: Box_<F> = Box_::new(f);\n connect_raw(\n self.as_ptr() as *mut _,\n b\"tag-added\\0\".as_ptr() as *const _,\n Some(transmute::<_, unsafe extern \"C\" fn()>(\n tag_added_trampoline::<Self, F> as *const (),\n )),\n Box_::into_raw(f),\n )\n }\n }\n\n fn connect_tag_changed<F: Fn(&Self, &TextTag, bool) + 'static>(&self, f: F) -> SignalHandlerId {\n unsafe extern \"C\" fn tag_changed_trampoline<P, F: Fn(&P, &TextTag, bool) + 'static>(\n this: *mut ffi::GtkTextTagTable,\n tag: *mut ffi::GtkTextTag,\n size_changed: glib::ffi::gboolean,\n f: glib::ffi::gpointer,\n ) where\n P: IsA<TextTagTable>,\n {\n "},"suffix":{"kind":"string","value":"\n\n fn connect_tag_removed<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId {\n unsafe extern \"C\" fn tag_removed_trampoline<P, F: Fn(&P, &TextTag) + 'static>(\n this: *mut ffi::GtkTextTagTable,\n tag: *mut ffi::GtkTextTag,\n f: glib::ffi::gpointer,\n ) where\n P: IsA<TextTagTable>,\n {\n let f: &F = &*(f as *const F);\n f(\n &TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),\n &from_glib_borrow(tag),\n )\n }\n unsafe {\n let f: Box_<F> = Box_::new(f);\n connect_raw(\n self.as_ptr() as *mut _,\n b\"tag-removed\\0\".as_ptr() as *const _,\n Some(transmute::<_, unsafe extern \"C\" fn()>(\n tag_removed_trampoline::<Self, F> as *const (),\n )),\n Box_::into_raw(f),\n )\n }\n }\n}\n\nimpl fmt::Display for TextTagTable {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n f.write_str(\"TextTagTable\")\n }\n}\n"},"middle":{"kind":"string","value":"let f: &F = &*(f as *const F);\n f(\n &TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),\n &from_glib_borrow(tag),\n from_glib(size_changed),\n )\n }\n unsafe {\n let f: Box_<F> = Box_::new(f);\n connect_raw(\n self.as_ptr() as *mut _,\n b\"tag-changed\\0\".as_ptr() as *const _,\n Some(transmute::<_, unsafe extern \"C\" fn()>(\n tag_changed_trampoline::<Self, F> as *const (),\n )),\n Box_::into_raw(f),\n )\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// Adds a closure to be called by the main loop the return `Source` is attached to when it's idle.\n\n///\n\n/// `func` will be called repeatedly until it returns `Continue(false)`.\n\npub fn idle_source_new<F>(name: Option<&str>, priority: Priority, func: F) -> Source\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n let source = ffi::g_idle_source_new();\n\n ffi::g_source_set_callback(\n\n source,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n );\n\n ffi::g_source_set_priority(source, priority.to_glib());\n\n\n\n if let Some(name) = name {\n\n ffi::g_source_set_name(source, name.to_glib_none().0);\n\n }\n\n\n\n from_glib_full(source)\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":0,"score":467387.20000380033},{"content":"/// To set back the default print handler, use the [`unset_printerr_handler`] function.\n\npub fn set_printerr_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) {\n\n unsafe extern \"C\" fn func_func(string: *const libc::c_char) {\n\n if let Some(callback) = match *PRINTERR_HANDLER\n\n .lock()\n\n .expect(\"Failed to lock PRINTERR_HANDLER\")\n\n {\n\n Some(ref handler) => Some(Arc::clone(handler)),\n\n None => None,\n\n } {\n\n let string: Borrowed<GString> = from_glib_borrow(string);\n\n (*callback)(string.as_str())\n\n }\n\n }\n\n *PRINTERR_HANDLER\n\n .lock()\n\n .expect(\"Failed to lock PRINTERR_HANDLER to change callback\") = Some(Arc::new(func));\n\n unsafe { ffi::g_set_printerr_handler(Some(func_func as _)) };\n\n}\n\n\n","file_path":"glib/src/log.rs","rank":1,"score":464308.56255107734},{"content":"/// To set back the default print handler, use the [`unset_print_handler`] function.\n\npub fn set_print_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) {\n\n unsafe extern \"C\" fn func_func(string: *const libc::c_char) {\n\n if let Some(callback) = match *PRINT_HANDLER.lock().expect(\"Failed to lock PRINT_HANDLER\") {\n\n Some(ref handler) => Some(Arc::clone(handler)),\n\n None => None,\n\n } {\n\n let string: Borrowed<GString> = from_glib_borrow(string);\n\n (*callback)(string.as_str())\n\n }\n\n }\n\n *PRINT_HANDLER\n\n .lock()\n\n .expect(\"Failed to lock PRINT_HANDLER to change callback\") = Some(Arc::new(func));\n\n unsafe { ffi::g_set_print_handler(Some(func_func as _)) };\n\n}\n\n\n","file_path":"glib/src/log.rs","rank":2,"score":464308.5625510774},{"content":"fn into_raw_child_watch<F: FnMut(Pid, i32) + 'static>(func: F) -> gpointer {\n\n let func: Box<RefCell<F>> = Box::new(RefCell::new(func));\n\n Box::into_raw(func) as gpointer\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n\nunsafe extern \"C\" fn trampoline_unix_fd<F: FnMut(RawFd, IOCondition) -> Continue + 'static>(\n\n fd: i32,\n\n condition: ffi::GIOCondition,\n\n func: gpointer,\n\n) -> gboolean {\n\n let func: &RefCell<F> = &*(func as *const RefCell<F>);\n\n (&mut *func.borrow_mut())(fd, from_glib(condition)).to_glib()\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n\nunsafe extern \"C\" fn destroy_closure_unix_fd<F: FnMut(RawFd, IOCondition) -> Continue + 'static>(\n\n ptr: gpointer,\n\n) {\n\n Box::<RefCell<F>>::from_raw(ptr as *mut _);\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":3,"score":438675.6042279372},{"content":"pub fn is_canonical_pspec_name(name: &str) -> bool {\n\n name.as_bytes().iter().enumerate().all(|(i, c)| {\n\n i != 0 && (*c >= b'0' && *c <= b'9' || *c == b'-')\n\n || (*c >= b'A' && *c <= b'Z')\n\n || (*c >= b'a' && *c <= b'z')\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::env;\n\n use std::sync::Mutex;\n\n\n\n //Mutex to prevent run environment tests parallel\n\n static LOCK: once_cell::sync::Lazy<Mutex<()>> = once_cell::sync::Lazy::new(|| Mutex::new(()));\n\n\n\n const VAR_NAME: &str = \"function_environment_test\";\n\n\n\n fn check_getenv(val: &str) {\n\n let _data = LOCK.lock().unwrap();\n","file_path":"glib/src/utils.rs","rank":4,"score":429251.1223997088},{"content":"/// To set back the default print handler, use the [`log_unset_default_handler`] function.\n\npub fn log_set_default_handler<P: Fn(Option<&str>, LogLevel, &str) + Send + Sync + 'static>(\n\n log_func: P,\n\n) {\n\n unsafe extern \"C\" fn func_func(\n\n log_domain: *const libc::c_char,\n\n log_levels: ffi::GLogLevelFlags,\n\n message: *const libc::c_char,\n\n _user_data: ffi::gpointer,\n\n ) {\n\n if let Some(callback) = match *DEFAULT_HANDLER\n\n .lock()\n\n .expect(\"Failed to lock DEFAULT_HANDLER\")\n\n {\n\n Some(ref handler) => Some(Arc::clone(handler)),\n\n None => None,\n\n } {\n\n let log_domain: Borrowed<Option<GString>> = from_glib_borrow(log_domain);\n\n let message: Borrowed<GString> = from_glib_borrow(message);\n\n (*callback)(\n\n (*log_domain).as_deref(),\n","file_path":"glib/src/log.rs","rank":5,"score":417865.09301895904},{"content":"fn into_raw<F: FnMut() -> Continue + 'static>(func: F) -> gpointer {\n\n let func: Box<RefCell<F>> = Box::new(RefCell::new(func));\n\n Box::into_raw(func) as gpointer\n\n}\n\n\n\nunsafe extern \"C\" fn trampoline_child_watch<F: FnMut(Pid, i32) + 'static>(\n\n pid: ffi::GPid,\n\n status: i32,\n\n func: gpointer,\n\n) {\n\n let func: &RefCell<F> = &*(func as *const RefCell<F>);\n\n (&mut *func.borrow_mut())(Pid(pid), status)\n\n}\n\n\n\nunsafe extern \"C\" fn destroy_closure_child_watch<F: FnMut(Pid, i32) + 'static>(ptr: gpointer) {\n\n Box::<RefCell<F>>::from_raw(ptr as *mut _);\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":6,"score":392077.0130692315},{"content":"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\n\n///\n\n/// `func` will be called repeatedly every time `signum` is raised until it\n\n/// returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// In comparison to `unix_signal_add()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn unix_signal_add_once<F>(signum: i32, func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + Send + 'static,\n\n{\n\n unix_signal_add(signum, fnmut_callback_wrapper(func))\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n","file_path":"glib/src/source.rs","rank":7,"score":388204.7674042063},{"content":"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\n\n///\n\n/// `func` will be called repeatedly every time `signum` is raised until it\n\n/// returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\npub fn unix_signal_add<F>(signum: i32, func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n from_glib(ffi::g_unix_signal_add_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n signum,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n","file_path":"glib/src/source.rs","rank":8,"score":388198.8069245155},{"content":"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\n\n///\n\n/// `func` will be called repeatedly every time `signum` is raised until it\n\n/// returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `unix_signal_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\n///\n\n/// In comparison to `unix_signal_add_local()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn unix_signal_add_local_once<F>(signum: i32, func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + 'static,\n\n{\n\n unix_signal_add_local(signum, fnmut_callback_wrapper_local(func))\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n","file_path":"glib/src/source.rs","rank":9,"score":382811.73654869944},{"content":"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\n\n///\n\n/// `func` will be called repeatedly every time `signum` is raised until it\n\n/// returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `unix_signal_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\npub fn unix_signal_add_local<F>(signum: i32, func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + 'static,\n\n{\n\n unsafe {\n\n assert!(MainContext::default().is_owner());\n\n from_glib(ffi::g_unix_signal_add_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n signum,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n","file_path":"glib/src/source.rs","rank":10,"score":382807.02683624777},{"content":"pub fn dbus_is_name(string: &str) -> bool {\n\n unsafe { from_glib(ffi::g_dbus_is_name(string.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":11,"score":381805.65369735914},{"content":"#[cfg(any(feature = \"v2_46\", feature = \"dox\"))]\n\npub fn log_set_handler<P: Fn(Option<&str>, LogLevel, &str) + Send + Sync + 'static>(\n\n log_domain: Option<&str>,\n\n log_levels: LogLevels,\n\n fatal: bool,\n\n recursion: bool,\n\n log_func: P,\n\n) -> LogHandlerId {\n\n let log_func_data: Box_<P> = Box_::new(log_func);\n\n unsafe extern \"C\" fn log_func_func<\n\n P: Fn(Option<&str>, LogLevel, &str) + Send + Sync + 'static,\n\n >(\n\n log_domain: *const libc::c_char,\n\n log_level: ffi::GLogLevelFlags,\n\n message: *const libc::c_char,\n\n user_data: ffi::gpointer,\n\n ) {\n\n let log_domain: Borrowed<Option<GString>> = from_glib_borrow(log_domain);\n\n let message: Borrowed<GString> = from_glib_borrow(message);\n\n let callback: &P = &*(user_data as *mut _);\n\n (*callback)(\n","file_path":"glib/src/log.rs","rank":12,"score":379568.72017880017},{"content":"pub fn pattern_match_simple(pattern: &str, string: &str) -> bool {\n\n unsafe {\n\n from_glib(ffi::g_pattern_match_simple(\n\n pattern.to_glib_none().0,\n\n string.to_glib_none().0,\n\n ))\n\n }\n\n}\n\n\n\n//pub fn pattern_match_string(pspec: /*Ignored*/&mut PatternSpec, string: &str) -> bool {\n\n// unsafe { TODO: call ffi:g_pattern_match_string() }\n\n//}\n\n\n\n//pub fn pointer_bit_lock(address: /*Unimplemented*/Fundamental: Pointer, lock_bit: i32) {\n\n// unsafe { TODO: call ffi:g_pointer_bit_lock() }\n\n//}\n\n\n\n//pub fn pointer_bit_trylock(address: /*Unimplemented*/Fundamental: Pointer, lock_bit: i32) -> bool {\n\n// unsafe { TODO: call ffi:g_pointer_bit_trylock() }\n\n//}\n","file_path":"glib/src/auto/functions.rs","rank":13,"score":375560.47326837864},{"content":"pub fn dbus_is_unique_name(string: &str) -> bool {\n\n unsafe { from_glib(ffi::g_dbus_is_unique_name(string.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":14,"score":375134.01131869236},{"content":"pub fn dbus_is_member_name(string: &str) -> bool {\n\n unsafe { from_glib(ffi::g_dbus_is_member_name(string.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":15,"score":375134.0113186924},{"content":"pub fn dbus_is_interface_name(string: &str) -> bool {\n\n unsafe { from_glib(ffi::g_dbus_is_interface_name(string.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":16,"score":375134.0113186924},{"content":"pub fn assertion_message(domain: &str, file: &str, line: i32, func: &str, message: &str) {\n\n unsafe {\n\n ffi::g_assertion_message(\n\n domain.to_glib_none().0,\n\n file.to_glib_none().0,\n\n line,\n\n func.to_glib_none().0,\n\n message.to_glib_none().0,\n\n );\n\n }\n\n}\n\n\n\n//pub fn assertion_message_cmpnum(domain: &str, file: &str, line: i32, func: &str, expr: &str, arg1: /*Unknown conversion*//*Unimplemented*/Unsupported, cmp: &str, arg2: /*Unknown conversion*//*Unimplemented*/Unsupported, numtype: crate::Char) {\n\n// unsafe { TODO: call ffi:g_assertion_message_cmpnum() }\n\n//}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":17,"score":373897.040744136},{"content":"#[cfg(any(feature = \"v2_52\", feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(feature = \"v2_52\")))]\n\npub fn uuid_string_is_valid(str: &str) -> bool {\n\n unsafe { from_glib(ffi::g_uuid_string_is_valid(str.to_glib_none().0)) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":19,"score":354305.4319138087},{"content":"pub fn version() -> &'static str {\n\nif cfg!(feature = \"v3_24\") {\n\n \"3.24\"\n\n } else if cfg!(feature = \"v3_22\") {\n\n \"3.22\"\n\n } else if cfg!(feature = \"v3_20\") {\n\n \"3.20\"\n\n } else if cfg!(feature = \"v3_18\") {\n\n \"3.18\"\n\n } else if cfg!(feature = \"v3_16\") {\n\n \"3.16\"\n\n } else {\n\n \"3.14\"\n\n }\n\n}\n","file_path":"gdk/sys/build_version.rs","rank":20,"score":351571.80204725463},{"content":"#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n\nfn into_raw_unix_fd<F: FnMut(RawFd, IOCondition) -> Continue + 'static>(func: F) -> gpointer {\n\n let func: Box<RefCell<F>> = Box::new(RefCell::new(func));\n\n Box::into_raw(func) as gpointer\n\n}\n\n\n\n/// Transform a generic FnOnce into a closure that can be used as callback in various glib methods\n\n///\n\n/// The resulting function can only be called once and will panic otherwise. It will return `Continue(false)`\n\n/// in order to prevent being called twice.\n","file_path":"glib/src/source.rs","rank":21,"score":348722.8504318694},{"content":"/// Same as [`set_prgname()`].\n\n///\n\n/// [`set_prgname()`]: fn.set_prgname.html\n\npub fn set_program_name(name: Option<&str>) {\n\n set_prgname(name)\n\n}\n\n\n","file_path":"glib/src/utils.rs","rank":22,"score":345986.785777921},{"content":"pub fn quantize_line_geometry(thickness: &mut i32, position: &mut i32) {\n\n unsafe {\n\n ffi::pango_quantize_line_geometry(thickness, position);\n\n }\n\n}\n\n\n\n//#[cfg_attr(feature = \"v1_38\", deprecated)]\n\n//pub fn read_line(stream: /*Unimplemented*/Option<Fundamental: Pointer>, str: /*Ignored*/&mut glib::String) -> i32 {\n\n// unsafe { TODO: call ffi:pango_read_line() }\n\n//}\n\n\n\n//#[cfg_attr(feature = \"v1_38\", deprecated)]\n\n//pub fn scan_int(pos: /*Unimplemented*/glib::GString) -> Option<i32> {\n\n// unsafe { TODO: call ffi:pango_scan_int() }\n\n//}\n\n\n\n//#[cfg_attr(feature = \"v1_38\", deprecated)]\n\n//pub fn scan_string(pos: /*Unimplemented*/glib::GString, out: /*Ignored*/&mut glib::String) -> bool {\n\n// unsafe { TODO: call ffi:pango_scan_string() }\n\n//}\n\n\n\n//#[cfg_attr(feature = \"v1_38\", deprecated)]\n\n//pub fn scan_word(pos: /*Unimplemented*/glib::GString, out: /*Ignored*/&mut glib::String) -> bool {\n\n// unsafe { TODO: call ffi:pango_scan_word() }\n\n//}\n\n\n","file_path":"pango/src/auto/functions.rs","rank":23,"score":345741.81377748196},{"content":"pub fn get_version_string() -> &'static str {\n\n unsafe {\n\n let ptr = ffi::cairo_version_string();\n\n CStr::from_ptr(ptr)\n\n .to_str()\n\n .expect(\"invalid version string\")\n\n }\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Clone, Copy)]\n\npub struct Version {\n\n pub major: u8,\n\n pub minor: u8,\n\n pub micro: u8,\n\n}\n\n\n\nimpl Version {\n\n pub fn get_version() -> Version {\n\n let version = unsafe { ffi::cairo_version() };\n\n Version {\n","file_path":"cairo/src/utils.rs","rank":24,"score":345637.1078253882},{"content":"/// Adds a closure to be called by the default main loop when it's idle.\n\n///\n\n/// `func` will be called repeatedly until it returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// In comparison to `idle_add()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn idle_add_once<F>(func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + Send + 'static,\n\n{\n\n idle_add(fnmut_callback_wrapper(func))\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":25,"score":345288.44971861003},{"content":"/// Adds a closure to be called by the default main loop when it's idle.\n\n///\n\n/// `func` will be called repeatedly until it returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\npub fn idle_add<F>(func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n from_glib(ffi::g_idle_add_full(\n\n ffi::G_PRIORITY_DEFAULT_IDLE,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":26,"score":345282.252964029},{"content":"pub trait BuildableExt: 'static {\n\n fn add_child<P: IsA<Builder>, Q: IsA<glib::Object>>(\n\n &self,\n\n builder: &P,\n\n child: &Q,\n\n type_: Option<&str>,\n\n );\n\n\n\n fn construct_child<P: IsA<Builder>>(&self, builder: &P, name: &str) -> Option<glib::Object>;\n\n\n\n //fn custom_finished<P: IsA<Builder>, Q: IsA<glib::Object>>(&self, builder: &P, child: Option<&Q>, tagname: &str, data: /*Unimplemented*/Option<Fundamental: Pointer>);\n\n\n\n //fn custom_tag_end<P: IsA<Builder>, Q: IsA<glib::Object>>(&self, builder: &P, child: Option<&Q>, tagname: &str, data: /*Unimplemented*/Option<Fundamental: Pointer>);\n\n\n\n //fn custom_tag_start<P: IsA<Builder>, Q: IsA<glib::Object>>(&self, builder: &P, child: Option<&Q>, tagname: &str, parser: /*Ignored*/glib::MarkupParser, data: /*Unimplemented*/&mut Option<Fundamental: Pointer>) -> bool;\n\n\n\n fn get_internal_child<P: IsA<Builder>>(\n\n &self,\n\n builder: &P,\n\n childname: &str,\n","file_path":"gtk/src/auto/buildable.rs","rank":27,"score":343822.3408189542},{"content":"pub trait BuildableExtManual: 'static {\n\n fn get_buildable_name(&self) -> Option<String>;\n\n\n\n fn set_buildable_name(&self, name: &str);\n\n}\n\n\n\nimpl<O: IsA<Buildable>> BuildableExtManual for O {\n\n fn get_buildable_name(&self) -> Option<String> {\n\n unsafe { from_glib_none(ffi::gtk_buildable_get_name(self.as_ref().to_glib_none().0)) }\n\n }\n\n\n\n fn set_buildable_name(&self, name: &str) {\n\n unsafe {\n\n ffi::gtk_buildable_set_name(self.as_ref().to_glib_none().0, name.to_glib_none().0);\n\n }\n\n }\n\n}\n","file_path":"gtk/src/buildable.rs","rank":28,"score":343822.3408189543},{"content":"pub fn path_is_absolute<P: AsRef<std::path::Path>>(file_name: P) -> bool {\n\n unsafe { from_glib(ffi::g_path_is_absolute(file_name.as_ref().to_glib_none().0)) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":29,"score":340420.5389563604},{"content":"/// Adds a closure to be called by the default main loop when it's idle.\n\n///\n\n/// `func` will be called repeatedly until it returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `idle_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\n///\n\n/// In comparison to `idle_add_local()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn idle_add_local_once<F>(func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + 'static,\n\n{\n\n idle_add_local(fnmut_callback_wrapper_local(func))\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":30,"score":340368.66409136856},{"content":"/// Adds a closure to be called by the default main loop when it's idle.\n\n///\n\n/// `func` will be called repeatedly until it returns `Continue(false)`.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `idle_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\npub fn idle_add_local<F>(func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + 'static,\n\n{\n\n unsafe {\n\n assert!(MainContext::default().is_owner());\n\n from_glib(ffi::g_idle_add_full(\n\n ffi::G_PRIORITY_DEFAULT_IDLE,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":31,"score":340363.73723249964},{"content":"pub fn find_paragraph_boundary(text: &str) -> (i32, i32) {\n\n let length = text.len() as i32;\n\n unsafe {\n\n let mut paragraph_delimiter_index = mem::MaybeUninit::uninit();\n\n let mut next_paragraph_start = mem::MaybeUninit::uninit();\n\n ffi::pango_find_paragraph_boundary(\n\n text.to_glib_none().0,\n\n length,\n\n paragraph_delimiter_index.as_mut_ptr(),\n\n next_paragraph_start.as_mut_ptr(),\n\n );\n\n let paragraph_delimiter_index = paragraph_delimiter_index.assume_init();\n\n let next_paragraph_start = next_paragraph_start.assume_init();\n\n (paragraph_delimiter_index, next_paragraph_start)\n\n }\n\n}\n\n\n\n//pub fn get_log_attrs(text: &str, level: i32, language: &mut Language, log_attrs: /*Ignored*/&[&LogAttr]) {\n\n// unsafe { TODO: call ffi:pango_get_log_attrs() }\n\n//}\n\n\n","file_path":"pango/src/auto/functions.rs","rank":32,"score":340194.2611830549},{"content":"pub fn set_prgname(name: Option<&str>) {\n\n unsafe { ffi::g_set_prgname(name.to_glib_none().0) }\n\n}\n\n\n","file_path":"glib/src/utils.rs","rank":33,"score":335434.1823915996},{"content":"pub trait HyperlinkImplExt: 'static {\n\n fn get_hyperlink(&self) -> Option<Hyperlink>;\n\n}\n\n\n\nimpl<O: IsA<HyperlinkImpl>> HyperlinkImplExt for O {\n\n fn get_hyperlink(&self) -> Option<Hyperlink> {\n\n unsafe {\n\n from_glib_full(ffi::atk_hyperlink_impl_get_hyperlink(\n\n self.as_ref().to_glib_none().0,\n\n ))\n\n }\n\n }\n\n}\n\n\n\nimpl fmt::Display for HyperlinkImpl {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n f.write_str(\"HyperlinkImpl\")\n\n }\n\n}\n","file_path":"atk/src/auto/hyperlink_impl.rs","rank":34,"score":332690.6528661475},{"content":"pub trait TextTagExt: 'static {\n\n #[cfg(any(feature = \"v3_20\", feature = \"dox\"))]\n\n #[cfg_attr(feature = \"dox\", doc(cfg(feature = \"v3_20\")))]\n\n fn changed(&self, size_changed: bool);\n\n\n\n fn event<P: IsA<glib::Object>>(\n\n &self,\n\n event_object: &P,\n\n event: &gdk::Event,\n\n iter: &TextIter,\n\n ) -> bool;\n\n\n\n fn get_priority(&self) -> i32;\n\n\n\n fn set_priority(&self, priority: i32);\n\n\n\n fn get_property_accumulative_margin(&self) -> bool;\n\n\n\n fn set_property_accumulative_margin(&self, accumulative_margin: bool);\n\n\n","file_path":"gtk/src/auto/text_tag.rs","rank":35,"score":332627.82926307706},{"content":"pub fn content_type_is_a(type_: &str, supertype: &str) -> bool {\n\n unsafe {\n\n from_glib(ffi::g_content_type_is_a(\n\n type_.to_glib_none().0,\n\n supertype.to_glib_none().0,\n\n ))\n\n }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":36,"score":332011.60265022924},{"content":"pub fn dbus_is_address(string: &str) -> bool {\n\n unsafe { from_glib(ffi::g_dbus_is_address(string.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":37,"score":329764.75824010366},{"content":"pub fn dbus_is_guid(string: &str) -> bool {\n\n unsafe { from_glib(ffi::g_dbus_is_guid(string.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":38,"score":329764.75824010366},{"content":"pub fn content_type_guess(filename: Option<&str>, data: &[u8]) -> (glib::GString, bool) {\n\n let data_size = data.len() as usize;\n\n unsafe {\n\n let mut result_uncertain = mem::MaybeUninit::uninit();\n\n let ret = from_glib_full(ffi::g_content_type_guess(\n\n filename.to_glib_none().0,\n\n data.to_glib_none().0,\n\n data_size,\n\n result_uncertain.as_mut_ptr(),\n\n ));\n\n let result_uncertain = result_uncertain.assume_init();\n\n (ret, from_glib(result_uncertain))\n\n }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":39,"score":328328.6997512671},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to at regular\n\n/// intervals with millisecond granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` milliseconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\n\n/// precision is not necessary.\n\npub fn timeout_source_new<F>(\n\n interval: Duration,\n\n name: Option<&str>,\n\n priority: Priority,\n\n func: F,\n\n) -> Source\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n let source = ffi::g_timeout_source_new(interval.as_millis() as _);\n\n ffi::g_source_set_callback(\n\n source,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n );\n\n ffi::g_source_set_priority(source, priority.to_glib());\n\n\n\n if let Some(name) = name {\n\n ffi::g_source_set_name(source, name.to_glib_none().0);\n\n }\n\n\n\n from_glib_full(source)\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":40,"score":327924.69767764397},{"content":"pub fn drawable<F>(application: >k::Application, width: i32, height: i32, draw_fn: F)\n\nwhere\n\n F: Fn(&DrawingArea, &Context) -> Inhibit + 'static,\n\n{\n\n let window = gtk::ApplicationWindow::new(application);\n\n let drawing_area = Box::new(DrawingArea::new)();\n\n\n\n drawing_area.connect_draw(draw_fn);\n\n\n\n window.set_default_size(width, height);\n\n\n\n window.add(&drawing_area);\n\n window.show_all();\n\n}\n","file_path":"examples/cairo_test/main.rs","rank":41,"score":327826.6940282848},{"content":"pub fn content_type_equals(type1: &str, type2: &str) -> bool {\n\n unsafe {\n\n from_glib(ffi::g_content_type_equals(\n\n type1.to_glib_none().0,\n\n type2.to_glib_none().0,\n\n ))\n\n }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":42,"score":327316.0961552033},{"content":"pub fn content_type_is_unknown(type_: &str) -> bool {\n\n unsafe { from_glib(ffi::g_content_type_is_unknown(type_.to_glib_none().0)) }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":43,"score":324429.7572992379},{"content":"pub fn hostname_is_non_ascii(hostname: &str) -> bool {\n\n unsafe { from_glib(ffi::g_hostname_is_non_ascii(hostname.to_glib_none().0)) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":44,"score":324429.7572992379},{"content":"pub fn hostname_is_ascii_encoded(hostname: &str) -> bool {\n\n unsafe { from_glib(ffi::g_hostname_is_ascii_encoded(hostname.to_glib_none().0)) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":45,"score":324429.7572992379},{"content":"pub fn hostname_is_ip_address(hostname: &str) -> bool {\n\n unsafe { from_glib(ffi::g_hostname_is_ip_address(hostname.to_glib_none().0)) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":46,"score":324429.7572992379},{"content":"pub trait DataOutputStreamExt: 'static {\n\n fn get_byte_order(&self) -> DataStreamByteOrder;\n\n\n\n fn put_byte<P: IsA<Cancellable>>(\n\n &self,\n\n data: u8,\n\n cancellable: Option<&P>,\n\n ) -> Result<(), glib::Error>;\n\n\n\n fn put_int16<P: IsA<Cancellable>>(\n\n &self,\n\n data: i16,\n\n cancellable: Option<&P>,\n\n ) -> Result<(), glib::Error>;\n\n\n\n fn put_int32<P: IsA<Cancellable>>(\n\n &self,\n\n data: i32,\n\n cancellable: Option<&P>,\n\n ) -> Result<(), glib::Error>;\n","file_path":"gio/src/auto/data_output_stream.rs","rank":47,"score":322607.45531662385},{"content":"pub trait DataInputStreamExtManual: 'static {\n\n fn read_line<P: IsA<Cancellable>>(\n\n &self,\n\n cancellable: Option<&P>,\n\n ) -> Result<Vec<u8>, glib::Error>;\n\n\n\n fn read_line_async<\n\n P: IsA<Cancellable>,\n\n Q: FnOnce(Result<Vec<u8>, glib::Error>) + Send + 'static,\n\n >(\n\n &self,\n\n io_priority: glib::Priority,\n\n cancellable: Option<&P>,\n\n callback: Q,\n\n );\n\n\n\n fn read_line_async_future(\n\n &self,\n\n io_priority: glib::Priority,\n\n ) -> Pin<Box_<dyn std::future::Future<Output = Result<Vec<u8>, glib::Error>> + 'static>>;\n","file_path":"gio/src/data_input_stream.rs","rank":48,"score":322607.45531662385},{"content":"pub trait DataInputStreamExt: 'static {\n\n fn get_byte_order(&self) -> DataStreamByteOrder;\n\n\n\n fn get_newline_type(&self) -> DataStreamNewlineType;\n\n\n\n fn read_byte<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<u8, glib::Error>;\n\n\n\n fn read_int16<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<i16, glib::Error>;\n\n\n\n fn read_int32<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<i32, glib::Error>;\n\n\n\n fn read_int64<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<i64, glib::Error>;\n\n\n\n fn read_uint16<P: IsA<Cancellable>>(&self, cancellable: Option<&P>)\n\n -> Result<u16, glib::Error>;\n\n\n\n fn read_uint32<P: IsA<Cancellable>>(&self, cancellable: Option<&P>)\n\n -> Result<u32, glib::Error>;\n\n\n\n fn read_uint64<P: IsA<Cancellable>>(&self, cancellable: Option<&P>)\n","file_path":"gio/src/auto/data_input_stream.rs","rank":49,"score":322607.45531662385},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to whenever a\n\n/// UNIX file descriptor reaches the given IO condition.\n\n///\n\n/// `func` will be called repeatedly while the file descriptor matches the given IO condition\n\n/// until it returns `Continue(false)`.\n\npub fn unix_fd_source_new<F>(\n\n fd: RawFd,\n\n condition: IOCondition,\n\n name: Option<&str>,\n\n priority: Priority,\n\n func: F,\n\n) -> Source\n\nwhere\n\n F: FnMut(RawFd, IOCondition) -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n let source = ffi::g_unix_fd_source_new(fd, condition.to_glib());\n\n ffi::g_source_set_callback(\n\n source,\n\n Some(transmute::<\n\n _,\n\n unsafe extern \"C\" fn(ffi::gpointer) -> ffi::gboolean,\n\n >(trampoline_unix_fd::<F> as *const ())),\n\n into_raw_unix_fd(func),\n\n Some(destroy_closure_unix_fd::<F>),\n","file_path":"glib/src/source.rs","rank":50,"score":321992.86421958974},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to when a child\n\n/// process exits.\n\n///\n\n/// `func` will be called when `pid` exits\n\npub fn child_watch_source_new<F>(\n\n pid: Pid,\n\n name: Option<&str>,\n\n priority: Priority,\n\n func: F,\n\n) -> Source\n\nwhere\n\n F: FnMut(Pid, i32) + Send + 'static,\n\n{\n\n unsafe {\n\n let source = ffi::g_child_watch_source_new(pid.0);\n\n ffi::g_source_set_callback(\n\n source,\n\n Some(transmute::<\n\n _,\n\n unsafe extern \"C\" fn(ffi::gpointer) -> ffi::gboolean,\n\n >(trampoline_child_watch::<F> as *const ())),\n\n into_raw_child_watch(func),\n\n Some(destroy_closure_child_watch::<F>),\n\n );\n","file_path":"glib/src/source.rs","rank":51,"score":321987.5841255577},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to whenever a\n\n/// UNIX signal is raised.\n\n///\n\n/// `func` will be called repeatedly every time `signum` is raised until it\n\n/// returns `Continue(false)`.\n\npub fn unix_signal_source_new<F>(\n\n signum: i32,\n\n name: Option<&str>,\n\n priority: Priority,\n\n func: F,\n\n) -> Source\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n let source = ffi::g_unix_signal_source_new(signum);\n\n ffi::g_source_set_callback(\n\n source,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n );\n\n ffi::g_source_set_priority(source, priority.to_glib());\n\n\n\n if let Some(name) = name {\n\n ffi::g_source_set_name(source, name.to_glib_none().0);\n\n }\n\n\n\n from_glib_full(source)\n\n }\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n","file_path":"glib/src/source.rs","rank":52,"score":321987.22943737527},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to at regular\n\n/// intervals with second granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` seconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events.\n\npub fn timeout_source_new_seconds<F>(\n\n interval: u32,\n\n name: Option<&str>,\n\n priority: Priority,\n\n func: F,\n\n) -> Source\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n let source = ffi::g_timeout_source_new_seconds(interval);\n\n ffi::g_source_set_callback(\n\n source,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n );\n\n ffi::g_source_set_priority(source, priority.to_glib());\n\n\n\n if let Some(name) = name {\n\n ffi::g_source_set_name(source, name.to_glib_none().0);\n\n }\n\n\n\n from_glib_full(source)\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":53,"score":321986.9545554023},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with millisecond granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` milliseconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\n\n/// precision is not necessary.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// In comparison to `timeout_add()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn timeout_add_once<F>(interval: Duration, func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + Send + 'static,\n\n{\n\n timeout_add(interval, fnmut_callback_wrapper(func))\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":54,"score":320472.3461313201},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with millisecond granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` milliseconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\n\n/// precision is not necessary.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\npub fn timeout_add<F>(interval: Duration, func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n from_glib(ffi::g_timeout_add_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n interval.as_millis() as _,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":55,"score":320466.5497094765},{"content":"pub fn parse_stretch(str: &str, warn: bool) -> Option<Stretch> {\n\n unsafe {\n\n let mut stretch = mem::MaybeUninit::uninit();\n\n let ret = from_glib(ffi::pango_parse_stretch(\n\n str.to_glib_none().0,\n\n stretch.as_mut_ptr(),\n\n warn.to_glib(),\n\n ));\n\n let stretch = stretch.assume_init();\n\n if ret {\n\n Some(from_glib(stretch))\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n","file_path":"pango/src/auto/functions.rs","rank":56,"score":320221.1678215979},{"content":"pub fn parse_style(str: &str, warn: bool) -> Option<Style> {\n\n unsafe {\n\n let mut style = mem::MaybeUninit::uninit();\n\n let ret = from_glib(ffi::pango_parse_style(\n\n str.to_glib_none().0,\n\n style.as_mut_ptr(),\n\n warn.to_glib(),\n\n ));\n\n let style = style.assume_init();\n\n if ret {\n\n Some(from_glib(style))\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n","file_path":"pango/src/auto/functions.rs","rank":57,"score":320221.1678215979},{"content":"pub fn parse_weight(str: &str, warn: bool) -> Option<Weight> {\n\n unsafe {\n\n let mut weight = mem::MaybeUninit::uninit();\n\n let ret = from_glib(ffi::pango_parse_weight(\n\n str.to_glib_none().0,\n\n weight.as_mut_ptr(),\n\n warn.to_glib(),\n\n ));\n\n let weight = weight.assume_init();\n\n if ret {\n\n Some(from_glib(weight))\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n","file_path":"pango/src/auto/functions.rs","rank":58,"score":320221.1678215979},{"content":"pub fn parse_variant(str: &str, warn: bool) -> Option<Variant> {\n\n unsafe {\n\n let mut variant = mem::MaybeUninit::uninit();\n\n let ret = from_glib(ffi::pango_parse_variant(\n\n str.to_glib_none().0,\n\n variant.as_mut_ptr(),\n\n warn.to_glib(),\n\n ));\n\n let variant = variant.assume_init();\n\n if ret {\n\n Some(from_glib(variant))\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n","file_path":"pango/src/auto/functions.rs","rank":59,"score":320221.1678215979},{"content":"// rustdoc-stripper-ignore-next\n\n/// Call from build script to run `glib-compile-resources` to generate compiled gresources to embed\n\n/// in binary with [resources_register_include]. `target` is relative to `OUT_DIR`.\n\n///\n\n/// ```no_run\n\n/// gio::compile_resources(\n\n/// \"resources\",\n\n/// \"resources/resources.gresource.xml\",\n\n/// \"compiled.gresource\",\n\n/// );\n\n/// ```\n\npub fn compile_resources<P: AsRef<Path>>(source_dir: P, gresource: &str, target: &str) {\n\n let out_dir = env::var(\"OUT_DIR\").unwrap();\n\n\n\n let status = Command::new(\"glib-compile-resources\")\n\n .arg(\"--sourcedir\")\n\n .arg(source_dir.as_ref())\n\n .arg(\"--target\")\n\n .arg(&format!(\"{}/{}\", out_dir, target))\n\n .arg(gresource)\n\n .status()\n\n .unwrap();\n\n\n\n if !status.success() {\n\n panic!(\"glib-compile-resources failed with exit status {}\", status);\n\n }\n\n\n\n println!(\"cargo:rerun-if-changed={}\", gresource);\n\n let output = Command::new(\"glib-compile-resources\")\n\n .arg(\"--sourcedir\")\n\n .arg(source_dir.as_ref())\n","file_path":"gio/src/resource.rs","rank":60,"score":319413.0404860616},{"content":"pub fn content_type_can_be_executable(type_: &str) -> bool {\n\n unsafe {\n\n from_glib(ffi::g_content_type_can_be_executable(\n\n type_.to_glib_none().0,\n\n ))\n\n }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":61,"score":319361.94678127556},{"content":"#[cfg(any(feature = \"v2_52\", feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(feature = \"v2_52\")))]\n\npub fn content_type_is_mime_type(type_: &str, mime_type: &str) -> bool {\n\n unsafe {\n\n from_glib(ffi::g_content_type_is_mime_type(\n\n type_.to_glib_none().0,\n\n mime_type.to_glib_none().0,\n\n ))\n\n }\n\n}\n\n\n","file_path":"gio/src/auto/functions.rs","rank":62,"score":318533.28041921224},{"content":"pub fn set_application_name(application_name: &str) {\n\n unsafe {\n\n ffi::g_set_application_name(application_name.to_glib_none().0);\n\n }\n\n}\n\n\n\n//pub fn set_error(domain: Quark, code: i32, format: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs) -> Error {\n\n// unsafe { TODO: call ffi:g_set_error() }\n\n//}\n\n\n\n//pub fn set_print_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) -> Fn(&str) + 'static {\n\n// unsafe { TODO: call ffi:g_set_print_handler() }\n\n//}\n\n\n\n//pub fn set_printerr_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) -> Fn(&str) + 'static {\n\n// unsafe { TODO: call ffi:g_set_printerr_handler() }\n\n//}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":63,"score":317581.7280352667},{"content":"pub fn x11_get_default_screen() -> i32 {\n\n assert_initialized_main_thread!();\n\n unsafe { ffi::gdk_x11_get_default_screen() }\n\n}\n\n\n\n//#[cfg_attr(feature = \"v3_24\", deprecated)]\n\n//#[cfg(any(feature = \"v3_24_2\", feature = \"dox\"))]\n\n//#[cfg_attr(feature = \"dox\", doc(cfg(feature = \"v3_24_2\")))]\n\n//pub fn x11_get_parent_relative_pattern() -> /*Ignored*/Option<cairo::Pattern> {\n\n// unsafe { TODO: call ffi:gdk_x11_get_parent_relative_pattern() }\n\n//}\n\n\n","file_path":"gdkx11/src/auto/functions.rs","rank":64,"score":316350.0261160994},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with second granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` seconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// In comparison to `timeout_add_seconds()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn timeout_add_seconds_once<F>(interval: u32, func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + Send + 'static,\n\n{\n\n timeout_add_seconds(interval, fnmut_callback_wrapper(func))\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":65,"score":315983.9113775549},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with millisecond granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` milliseconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\n\n/// precision is not necessary.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `timeout_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\n///\n\n/// In comparison to `timeout_add_local()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn timeout_add_local_once<F>(interval: Duration, func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + 'static,\n\n{\n\n timeout_add_local(interval, fnmut_callback_wrapper_local(func))\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":66,"score":315982.68533643504},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with millisecond granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` milliseconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\n\n/// precision is not necessary.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `timeout_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\npub fn timeout_add_local<F>(interval: Duration, func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + 'static,\n\n{\n\n unsafe {\n\n assert!(MainContext::default().is_owner());\n\n from_glib(ffi::g_timeout_add_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n interval.as_millis() as _,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":67,"score":315978.1049487622},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with second granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` seconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\npub fn timeout_add_seconds<F>(interval: u32, func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + Send + 'static,\n\n{\n\n unsafe {\n\n from_glib(ffi::g_timeout_add_seconds_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n interval,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":68,"score":315978.0656839069},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to when a child\n\n/// process exits.\n\n///\n\n/// `func` will be called when `pid` exits\n\npub fn child_watch_add<F>(pid: Pid, func: F) -> SourceId\n\nwhere\n\n F: FnMut(Pid, i32) + Send + 'static,\n\n{\n\n unsafe {\n\n from_glib(ffi::g_child_watch_add_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n pid.0,\n\n Some(trampoline_child_watch::<F>),\n\n into_raw_child_watch(func),\n\n Some(destroy_closure_child_watch::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":69,"score":315972.209570295},{"content":"#[repr(C)]\n\nstruct ChannelSource<T, F: FnMut(T) -> Continue + 'static> {\n\n source: ffi::GSource,\n\n source_funcs: Option<Box<ffi::GSourceFuncs>>,\n\n channel: Option<Channel<T>>,\n\n callback: Option<ThreadGuard<F>>,\n\n}\n\n\n\nunsafe extern \"C\" fn dispatch<T, F: FnMut(T) -> Continue + 'static>(\n\n source: *mut ffi::GSource,\n\n callback: ffi::GSourceFunc,\n\n _user_data: ffi::gpointer,\n\n) -> ffi::gboolean {\n\n let source = &mut *(source as *mut ChannelSource<T, F>);\n\n assert!(callback.is_none());\n\n\n\n // Set ready-time to -1 so that we won't get called again before a new item is added\n\n // to the channel queue.\n\n ffi::g_source_set_ready_time(&mut source.source, -1);\n\n\n\n // Get a reference to the callback. This will panic if we're called from a different\n","file_path":"glib/src/main_context_channel.rs","rank":70,"score":315423.7760669853},{"content":"pub fn access<P: AsRef<std::path::Path>>(filename: P, mode: i32) -> i32 {\n\n unsafe { ffi::g_access(filename.as_ref().to_glib_none().0, mode) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":71,"score":314749.74195529125},{"content":"#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n\n#[cfg(any(feature = \"v2_56\", feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(feature = \"v2_56\")))]\n\npub fn unix_is_system_fs_type(fs_type: &str) -> bool {\n\n unsafe { from_glib(ffi::g_unix_is_system_fs_type(fs_type.to_glib_none().0)) }\n\n}\n","file_path":"gio/src/auto/functions.rs","rank":72,"score":314541.7446801306},{"content":"/// Overrides pointer constness.\n\n///\n\n/// Use when the C API need const pointer, but function with `IsA<T>` constraint,\n\n/// that usaly don't have const pointer conversion.\n\npub fn const_override<T>(ptr: *mut T) -> *const T {\n\n ptr as *const T\n\n}\n\n\n","file_path":"glib/src/translate.rs","rank":73,"score":312184.53459002904},{"content":"/// Overrides pointer mutability.\n\n///\n\n/// Use when the C API should be specifying a const pointer but doesn't.\n\npub fn mut_override<T>(ptr: *const T) -> *mut T {\n\n ptr as *mut T\n\n}\n\n\n","file_path":"glib/src/translate.rs","rank":74,"score":312181.5293943038},{"content":"pub fn mkstemp_full<P: AsRef<std::path::Path>>(tmpl: P, flags: i32, mode: i32) -> i32 {\n\n unsafe { ffi::g_mkstemp_full(tmpl.as_ref().to_glib_none().0, flags, mode) }\n\n}\n\n\n\n//pub fn nullify_pointer(nullify_location: /*Unimplemented*/Fundamental: Pointer) {\n\n// unsafe { TODO: call ffi:g_nullify_pointer() }\n\n//}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":75,"score":312030.2730618368},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with second granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` seconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `timeout_add_seconds()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\n///\n\n/// In comparison to `timeout_add_seconds_local()`, this only requires `func` to be\n\n/// `FnOnce`, and will automatically return `Continue(false)`.\n\npub fn timeout_add_seconds_local_once<F>(interval: u32, func: F) -> SourceId\n\nwhere\n\n F: FnOnce() + 'static,\n\n{\n\n timeout_add_seconds_local(interval, fnmut_callback_wrapper_local(func))\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":76,"score":311687.69439694774},{"content":"/// Adds a closure to be called by the default main loop at regular intervals\n\n/// with second granularity.\n\n///\n\n/// `func` will be called repeatedly every `interval` seconds until it\n\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\n\n/// be delayed by other events.\n\n///\n\n/// The default main loop almost always is the main loop of the main thread.\n\n/// Thus the closure is called on the main thread.\n\n///\n\n/// Different to `timeout_add_seconds()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\npub fn timeout_add_seconds_local<F>(interval: u32, func: F) -> SourceId\n\nwhere\n\n F: FnMut() -> Continue + 'static,\n\n{\n\n unsafe {\n\n assert!(MainContext::default().is_owner());\n\n from_glib(ffi::g_timeout_add_seconds_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n interval,\n\n Some(trampoline::<F>),\n\n into_raw(func),\n\n Some(destroy_closure::<F>),\n\n ))\n\n }\n\n}\n\n\n","file_path":"glib/src/source.rs","rank":77,"score":311683.0839278938},{"content":"/// Adds a closure to be called by the main loop the returned `Source` is attached to when a child\n\n/// process exits.\n\n///\n\n/// `func` will be called when `pid` exits\n\n///\n\n/// Different to `child_watch_add()`, this does not require `func` to be\n\n/// `Send` but can only be called from the thread that owns the main context.\n\n///\n\n/// This function panics if called from a different thread than the one that\n\n/// owns the main context.\n\npub fn child_watch_add_local<F>(pid: Pid, func: F) -> SourceId\n\nwhere\n\n F: FnMut(Pid, i32) + 'static,\n\n{\n\n unsafe {\n\n assert!(MainContext::default().is_owner());\n\n from_glib(ffi::g_child_watch_add_full(\n\n ffi::G_PRIORITY_DEFAULT,\n\n pid.0,\n\n Some(trampoline_child_watch::<F>),\n\n into_raw_child_watch(func),\n\n Some(destroy_closure_child_watch::<F>),\n\n ))\n\n }\n\n}\n\n\n\n#[cfg(any(unix, feature = \"dox\"))]\n\n#[cfg_attr(feature = \"dox\", doc(cfg(unix)))]\n","file_path":"glib/src/source.rs","rank":78,"score":311677.4307258952},{"content":"pub fn mkdir_with_parents<P: AsRef<std::path::Path>>(pathname: P, mode: i32) -> i32 {\n\n unsafe { ffi::g_mkdir_with_parents(pathname.as_ref().to_glib_none().0, mode) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":79,"score":310853.0340873386},{"content":"pub fn keyval_from_name(keyval_name: &str) -> u32 {\n\n assert_initialized_main_thread!();\n\n unsafe { ffi::gdk_keyval_from_name(keyval_name.to_glib_none().0) }\n\n}\n\n\n","file_path":"gdk/src/auto/functions.rs","rank":80,"score":309547.1801952714},{"content":"#[cfg_attr(feature = \"v3_20\", deprecated)]\n\npub fn test_text_set<P: IsA<Widget>>(widget: &P, string: &str) {\n\n skip_assert_initialized!();\n\n unsafe {\n\n ffi::gtk_test_text_set(widget.as_ref().to_glib_none().0, string.to_glib_none().0);\n\n }\n\n}\n\n\n","file_path":"gtk/src/auto/functions.rs","rank":81,"score":309413.0540219762},{"content":"pub fn mkstemp<P: AsRef<std::path::Path>>(tmpl: P) -> i32 {\n\n #[cfg(not(windows))]\n\n use ffi::g_mkstemp;\n\n #[cfg(windows)]\n\n use ffi::g_mkstemp_utf8 as g_mkstemp;\n\n\n\n unsafe { g_mkstemp(tmpl.as_ref().to_glib_none().0) }\n\n}\n\n\n","file_path":"glib/src/utils.rs","rank":82,"score":308415.2643473271},{"content":"pub fn setting_get(name: &str) -> Option<glib::Value> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n let mut value = glib::Value::uninitialized();\n\n let done: bool = from_glib(ffi::gdk_setting_get(\n\n name.to_glib_none().0,\n\n value.to_glib_none_mut().0,\n\n ));\n\n if done {\n\n Some(value)\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n","file_path":"gdk/src/functions.rs","rank":83,"score":307403.49840002967},{"content":"pub fn on_error_query(prg_name: &str) {\n\n unsafe {\n\n ffi::g_on_error_query(prg_name.to_glib_none().0);\n\n }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":84,"score":306568.92846972926},{"content":"///\n\n/// Translate to a pointer with a mutable borrow.\n\npub trait ToGlibPtrMut<'a, P: Copy> {\n\n type Storage;\n\n\n\n /// Transfer: none.\n\n ///\n\n /// The pointer in the `Stash` is only valid for the lifetime of the `Stash`.\n\n #[allow(clippy::wrong_self_convention)]\n\n fn to_glib_none_mut(&'a mut self) -> StashMut<P, Self>;\n\n}\n\n\n\nimpl<'a, P: Ptr, T: ToGlibPtr<'a, P>> ToGlibPtr<'a, P> for Option<T> {\n\n type Storage = Option<<T as ToGlibPtr<'a, P>>::Storage>;\n\n\n\n #[inline]\n\n fn to_glib_none(&'a self) -> Stash<'a, P, Option<T>> {\n\n self.as_ref()\n\n .map_or(Stash(Ptr::from::<()>(ptr::null_mut()), None), |s| {\n\n let s = s.to_glib_none();\n\n Stash(s.0, Some(s.1))\n\n })\n","file_path":"glib/src/translate.rs","rank":85,"score":304918.5748876495},{"content":"pub fn rmdir<P: AsRef<std::path::Path>>(filename: P) -> i32 {\n\n unsafe { ffi::g_rmdir(filename.as_ref().to_glib_none().0) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":86,"score":303926.73684504314},{"content":"pub fn unlink<P: AsRef<std::path::Path>>(filename: P) -> i32 {\n\n unsafe { ffi::g_unlink(filename.as_ref().to_glib_none().0) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":87,"score":303926.73684504314},{"content":"pub fn chdir<P: AsRef<std::path::Path>>(path: P) -> i32 {\n\n unsafe { ffi::g_chdir(path.as_ref().to_glib_none().0) }\n\n}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":88,"score":303926.73684504314},{"content":"#[cfg_attr(feature = \"v3_20\", deprecated)]\n\npub fn test_spin_button_click<P: IsA<SpinButton>>(spinner: &P, button: u32, upwards: bool) -> bool {\n\n skip_assert_initialized!();\n\n unsafe {\n\n from_glib(ffi::gtk_test_spin_button_click(\n\n spinner.as_ref().to_glib_none().0,\n\n button,\n\n upwards.to_glib(),\n\n ))\n\n }\n\n}\n\n\n","file_path":"gtk/src/auto/functions.rs","rank":89,"score":303441.11536195804},{"content":"fn delimiter_to_string(delimiter: Delimiter, open: bool) -> &'static str {\n\n match delimiter {\n\n Delimiter::Parenthesis => {\n\n if open {\n\n \"(\"\n\n } else {\n\n \")\"\n\n }\n\n }\n\n Delimiter::Brace => {\n\n if open {\n\n \"{\"\n\n } else {\n\n \"}\"\n\n }\n\n }\n\n Delimiter::Bracket => {\n\n if open {\n\n \"[\"\n\n } else {\n\n \"]\"\n\n }\n\n }\n\n Delimiter::None => \"\",\n\n }\n\n}\n\n\n","file_path":"glib-macros/src/clone.rs","rank":90,"score":303404.7099224103},{"content":"pub fn on_error_stack_trace(prg_name: &str) {\n\n unsafe {\n\n ffi::g_on_error_stack_trace(prg_name.to_glib_none().0);\n\n }\n\n}\n\n\n\n//pub fn parse_debug_string(string: Option<&str>, keys: /*Ignored*/&[&DebugKey]) -> u32 {\n\n// unsafe { TODO: call ffi:g_parse_debug_string() }\n\n//}\n\n\n","file_path":"glib/src/auto/functions.rs","rank":91,"score":301233.9955831235},{"content":"/// Translate from a pointer type which is annotated with `transfer none`.\n\n/// The resulting value is referenced at least once, by the bindings.\n\n///\n\n/// This is suitable for floating references, which become strong references.\n\n/// It is also suitable for acquiring non-gobject values, like `gchar*`.\n\n///\n\n/// <a name=\"safety_points\"></a>\n\n/// # Safety\n\n///\n\n/// The implementation of this trait should acquire a reference to the value\n\n/// in a way appropriate to the type,\n\n/// e.g. by increasing the reference count or copying.\n\n/// Values obtained using this trait must be properly released on `drop()`\n\n/// by the implementing type.\n\n///\n\n/// For more information, refer to module level documentation.\n\npub trait FromGlibPtrNone<P: Ptr>: Sized {\n\n /// # Safety\n\n ///\n\n /// See trait level [notes on safety](#safety_points)\n\n unsafe fn from_glib_none(ptr: P) -> Self;\n\n}\n\n\n","file_path":"glib/src/translate.rs","rank":92,"score":299326.9626917484},{"content":"pub fn propagate_event<P: IsA<Widget>>(widget: &P, event: &mut gdk::Event) {\n\n skip_assert_initialized!();\n\n unsafe {\n\n ffi::gtk_propagate_event(widget.as_ref().to_glib_none().0, event.to_glib_none_mut().0);\n\n }\n\n}\n\n\n","file_path":"gtk/src/auto/functions.rs","rank":93,"score":294617.45955583773},{"content":"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(shell_words::split(&value)?),\n\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\n\n Err(err) => Err(format!(\"{} {}\", name, err).into()),\n\n }\n\n}\n\n\n","file_path":"glib/sys/tests/abi.rs","rank":94,"score":291750.0316711452},{"content":"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(shell_words::split(&value)?),\n\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\n\n Err(err) => Err(format!(\"{} {}\", name, err).into()),\n\n }\n\n}\n\n\n","file_path":"gtk/sys/tests/abi.rs","rank":95,"score":291750.0316711452},{"content":"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(shell_words::split(&value)?),\n\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\n\n Err(err) => Err(format!(\"{} {}\", name, err).into()),\n\n }\n\n}\n\n\n","file_path":"gio/sys/tests/abi.rs","rank":96,"score":291750.0316711452},{"content":"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(shell_words::split(&value)?),\n\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\n\n Err(err) => Err(format!(\"{} {}\", name, err).into()),\n\n }\n\n}\n\n\n","file_path":"atk/sys/tests/abi.rs","rank":97,"score":291750.0316711451},{"content":"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(shell_words::split(&value)?),\n\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\n\n Err(err) => Err(format!(\"{} {}\", name, err).into()),\n\n }\n\n}\n\n\n","file_path":"graphene/sys/tests/abi.rs","rank":98,"score":291750.0316711451},{"content":"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\n\n match env::var(name) {\n\n Ok(value) => Ok(shell_words::split(&value)?),\n\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\n\n Err(err) => Err(format!(\"{} {}\", name, err).into()),\n\n }\n\n}\n\n\n","file_path":"gdk/sys/tests/abi.rs","rank":99,"score":291750.0316711452}],"string":"[\n {\n \"content\": \"/// Adds a closure to be called by the main loop the return `Source` is attached to when it's idle.\\n\\n///\\n\\n/// `func` will be called repeatedly until it returns `Continue(false)`.\\n\\npub fn idle_source_new<F>(name: Option<&str>, priority: Priority, func: F) -> Source\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n let source = ffi::g_idle_source_new();\\n\\n ffi::g_source_set_callback(\\n\\n source,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n );\\n\\n ffi::g_source_set_priority(source, priority.to_glib());\\n\\n\\n\\n if let Some(name) = name {\\n\\n ffi::g_source_set_name(source, name.to_glib_none().0);\\n\\n }\\n\\n\\n\\n from_glib_full(source)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 0,\n \"score\": 467387.20000380033\n },\n {\n \"content\": \"/// To set back the default print handler, use the [`unset_printerr_handler`] function.\\n\\npub fn set_printerr_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) {\\n\\n unsafe extern \\\"C\\\" fn func_func(string: *const libc::c_char) {\\n\\n if let Some(callback) = match *PRINTERR_HANDLER\\n\\n .lock()\\n\\n .expect(\\\"Failed to lock PRINTERR_HANDLER\\\")\\n\\n {\\n\\n Some(ref handler) => Some(Arc::clone(handler)),\\n\\n None => None,\\n\\n } {\\n\\n let string: Borrowed<GString> = from_glib_borrow(string);\\n\\n (*callback)(string.as_str())\\n\\n }\\n\\n }\\n\\n *PRINTERR_HANDLER\\n\\n .lock()\\n\\n .expect(\\\"Failed to lock PRINTERR_HANDLER to change callback\\\") = Some(Arc::new(func));\\n\\n unsafe { ffi::g_set_printerr_handler(Some(func_func as _)) };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/log.rs\",\n \"rank\": 1,\n \"score\": 464308.56255107734\n },\n {\n \"content\": \"/// To set back the default print handler, use the [`unset_print_handler`] function.\\n\\npub fn set_print_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) {\\n\\n unsafe extern \\\"C\\\" fn func_func(string: *const libc::c_char) {\\n\\n if let Some(callback) = match *PRINT_HANDLER.lock().expect(\\\"Failed to lock PRINT_HANDLER\\\") {\\n\\n Some(ref handler) => Some(Arc::clone(handler)),\\n\\n None => None,\\n\\n } {\\n\\n let string: Borrowed<GString> = from_glib_borrow(string);\\n\\n (*callback)(string.as_str())\\n\\n }\\n\\n }\\n\\n *PRINT_HANDLER\\n\\n .lock()\\n\\n .expect(\\\"Failed to lock PRINT_HANDLER to change callback\\\") = Some(Arc::new(func));\\n\\n unsafe { ffi::g_set_print_handler(Some(func_func as _)) };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/log.rs\",\n \"rank\": 2,\n \"score\": 464308.5625510774\n },\n {\n \"content\": \"fn into_raw_child_watch<F: FnMut(Pid, i32) + 'static>(func: F) -> gpointer {\\n\\n let func: Box<RefCell<F>> = Box::new(RefCell::new(func));\\n\\n Box::into_raw(func) as gpointer\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\\nunsafe extern \\\"C\\\" fn trampoline_unix_fd<F: FnMut(RawFd, IOCondition) -> Continue + 'static>(\\n\\n fd: i32,\\n\\n condition: ffi::GIOCondition,\\n\\n func: gpointer,\\n\\n) -> gboolean {\\n\\n let func: &RefCell<F> = &*(func as *const RefCell<F>);\\n\\n (&mut *func.borrow_mut())(fd, from_glib(condition)).to_glib()\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\\nunsafe extern \\\"C\\\" fn destroy_closure_unix_fd<F: FnMut(RawFd, IOCondition) -> Continue + 'static>(\\n\\n ptr: gpointer,\\n\\n) {\\n\\n Box::<RefCell<F>>::from_raw(ptr as *mut _);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 3,\n \"score\": 438675.6042279372\n },\n {\n \"content\": \"pub fn is_canonical_pspec_name(name: &str) -> bool {\\n\\n name.as_bytes().iter().enumerate().all(|(i, c)| {\\n\\n i != 0 && (*c >= b'0' && *c <= b'9' || *c == b'-')\\n\\n || (*c >= b'A' && *c <= b'Z')\\n\\n || (*c >= b'a' && *c <= b'z')\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::env;\\n\\n use std::sync::Mutex;\\n\\n\\n\\n //Mutex to prevent run environment tests parallel\\n\\n static LOCK: once_cell::sync::Lazy<Mutex<()>> = once_cell::sync::Lazy::new(|| Mutex::new(()));\\n\\n\\n\\n const VAR_NAME: &str = \\\"function_environment_test\\\";\\n\\n\\n\\n fn check_getenv(val: &str) {\\n\\n let _data = LOCK.lock().unwrap();\\n\",\n \"file_path\": \"glib/src/utils.rs\",\n \"rank\": 4,\n \"score\": 429251.1223997088\n },\n {\n \"content\": \"/// To set back the default print handler, use the [`log_unset_default_handler`] function.\\n\\npub fn log_set_default_handler<P: Fn(Option<&str>, LogLevel, &str) + Send + Sync + 'static>(\\n\\n log_func: P,\\n\\n) {\\n\\n unsafe extern \\\"C\\\" fn func_func(\\n\\n log_domain: *const libc::c_char,\\n\\n log_levels: ffi::GLogLevelFlags,\\n\\n message: *const libc::c_char,\\n\\n _user_data: ffi::gpointer,\\n\\n ) {\\n\\n if let Some(callback) = match *DEFAULT_HANDLER\\n\\n .lock()\\n\\n .expect(\\\"Failed to lock DEFAULT_HANDLER\\\")\\n\\n {\\n\\n Some(ref handler) => Some(Arc::clone(handler)),\\n\\n None => None,\\n\\n } {\\n\\n let log_domain: Borrowed<Option<GString>> = from_glib_borrow(log_domain);\\n\\n let message: Borrowed<GString> = from_glib_borrow(message);\\n\\n (*callback)(\\n\\n (*log_domain).as_deref(),\\n\",\n \"file_path\": \"glib/src/log.rs\",\n \"rank\": 5,\n \"score\": 417865.09301895904\n },\n {\n \"content\": \"fn into_raw<F: FnMut() -> Continue + 'static>(func: F) -> gpointer {\\n\\n let func: Box<RefCell<F>> = Box::new(RefCell::new(func));\\n\\n Box::into_raw(func) as gpointer\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn trampoline_child_watch<F: FnMut(Pid, i32) + 'static>(\\n\\n pid: ffi::GPid,\\n\\n status: i32,\\n\\n func: gpointer,\\n\\n) {\\n\\n let func: &RefCell<F> = &*(func as *const RefCell<F>);\\n\\n (&mut *func.borrow_mut())(Pid(pid), status)\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn destroy_closure_child_watch<F: FnMut(Pid, i32) + 'static>(ptr: gpointer) {\\n\\n Box::<RefCell<F>>::from_raw(ptr as *mut _);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 6,\n \"score\": 392077.0130692315\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\\n\\n///\\n\\n/// `func` will be called repeatedly every time `signum` is raised until it\\n\\n/// returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// In comparison to `unix_signal_add()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn unix_signal_add_once<F>(signum: i32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + Send + 'static,\\n\\n{\\n\\n unix_signal_add(signum, fnmut_callback_wrapper(func))\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 7,\n \"score\": 388204.7674042063\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\\n\\n///\\n\\n/// `func` will be called repeatedly every time `signum` is raised until it\\n\\n/// returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\npub fn unix_signal_add<F>(signum: i32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n from_glib(ffi::g_unix_signal_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n signum,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 8,\n \"score\": 388198.8069245155\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\\n\\n///\\n\\n/// `func` will be called repeatedly every time `signum` is raised until it\\n\\n/// returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `unix_signal_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\n///\\n\\n/// In comparison to `unix_signal_add_local()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn unix_signal_add_local_once<F>(signum: i32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + 'static,\\n\\n{\\n\\n unix_signal_add_local(signum, fnmut_callback_wrapper_local(func))\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 9,\n \"score\": 382811.73654869944\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop whenever a UNIX signal is raised.\\n\\n///\\n\\n/// `func` will be called repeatedly every time `signum` is raised until it\\n\\n/// returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `unix_signal_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\npub fn unix_signal_add_local<F>(signum: i32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + 'static,\\n\\n{\\n\\n unsafe {\\n\\n assert!(MainContext::default().is_owner());\\n\\n from_glib(ffi::g_unix_signal_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n signum,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 10,\n \"score\": 382807.02683624777\n },\n {\n \"content\": \"pub fn dbus_is_name(string: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_dbus_is_name(string.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 11,\n \"score\": 381805.65369735914\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v2_46\\\", feature = \\\"dox\\\"))]\\n\\npub fn log_set_handler<P: Fn(Option<&str>, LogLevel, &str) + Send + Sync + 'static>(\\n\\n log_domain: Option<&str>,\\n\\n log_levels: LogLevels,\\n\\n fatal: bool,\\n\\n recursion: bool,\\n\\n log_func: P,\\n\\n) -> LogHandlerId {\\n\\n let log_func_data: Box_<P> = Box_::new(log_func);\\n\\n unsafe extern \\\"C\\\" fn log_func_func<\\n\\n P: Fn(Option<&str>, LogLevel, &str) + Send + Sync + 'static,\\n\\n >(\\n\\n log_domain: *const libc::c_char,\\n\\n log_level: ffi::GLogLevelFlags,\\n\\n message: *const libc::c_char,\\n\\n user_data: ffi::gpointer,\\n\\n ) {\\n\\n let log_domain: Borrowed<Option<GString>> = from_glib_borrow(log_domain);\\n\\n let message: Borrowed<GString> = from_glib_borrow(message);\\n\\n let callback: &P = &*(user_data as *mut _);\\n\\n (*callback)(\\n\",\n \"file_path\": \"glib/src/log.rs\",\n \"rank\": 12,\n \"score\": 379568.72017880017\n },\n {\n \"content\": \"pub fn pattern_match_simple(pattern: &str, string: &str) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::g_pattern_match_simple(\\n\\n pattern.to_glib_none().0,\\n\\n string.to_glib_none().0,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n//pub fn pattern_match_string(pspec: /*Ignored*/&mut PatternSpec, string: &str) -> bool {\\n\\n// unsafe { TODO: call ffi:g_pattern_match_string() }\\n\\n//}\\n\\n\\n\\n//pub fn pointer_bit_lock(address: /*Unimplemented*/Fundamental: Pointer, lock_bit: i32) {\\n\\n// unsafe { TODO: call ffi:g_pointer_bit_lock() }\\n\\n//}\\n\\n\\n\\n//pub fn pointer_bit_trylock(address: /*Unimplemented*/Fundamental: Pointer, lock_bit: i32) -> bool {\\n\\n// unsafe { TODO: call ffi:g_pointer_bit_trylock() }\\n\\n//}\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 13,\n \"score\": 375560.47326837864\n },\n {\n \"content\": \"pub fn dbus_is_unique_name(string: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_dbus_is_unique_name(string.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 14,\n \"score\": 375134.01131869236\n },\n {\n \"content\": \"pub fn dbus_is_member_name(string: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_dbus_is_member_name(string.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 15,\n \"score\": 375134.0113186924\n },\n {\n \"content\": \"pub fn dbus_is_interface_name(string: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_dbus_is_interface_name(string.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 16,\n \"score\": 375134.0113186924\n },\n {\n \"content\": \"pub fn assertion_message(domain: &str, file: &str, line: i32, func: &str, message: &str) {\\n\\n unsafe {\\n\\n ffi::g_assertion_message(\\n\\n domain.to_glib_none().0,\\n\\n file.to_glib_none().0,\\n\\n line,\\n\\n func.to_glib_none().0,\\n\\n message.to_glib_none().0,\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\\n//pub fn assertion_message_cmpnum(domain: &str, file: &str, line: i32, func: &str, expr: &str, arg1: /*Unknown conversion*//*Unimplemented*/Unsupported, cmp: &str, arg2: /*Unknown conversion*//*Unimplemented*/Unsupported, numtype: crate::Char) {\\n\\n// unsafe { TODO: call ffi:g_assertion_message_cmpnum() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 17,\n \"score\": 373897.040744136\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v2_52\\\", feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(feature = \\\"v2_52\\\")))]\\n\\npub fn uuid_string_is_valid(str: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_uuid_string_is_valid(str.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 19,\n \"score\": 354305.4319138087\n },\n {\n \"content\": \"pub fn version() -> &'static str {\\n\\nif cfg!(feature = \\\"v3_24\\\") {\\n\\n \\\"3.24\\\"\\n\\n } else if cfg!(feature = \\\"v3_22\\\") {\\n\\n \\\"3.22\\\"\\n\\n } else if cfg!(feature = \\\"v3_20\\\") {\\n\\n \\\"3.20\\\"\\n\\n } else if cfg!(feature = \\\"v3_18\\\") {\\n\\n \\\"3.18\\\"\\n\\n } else if cfg!(feature = \\\"v3_16\\\") {\\n\\n \\\"3.16\\\"\\n\\n } else {\\n\\n \\\"3.14\\\"\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gdk/sys/build_version.rs\",\n \"rank\": 20,\n \"score\": 351571.80204725463\n },\n {\n \"content\": \"#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\\nfn into_raw_unix_fd<F: FnMut(RawFd, IOCondition) -> Continue + 'static>(func: F) -> gpointer {\\n\\n let func: Box<RefCell<F>> = Box::new(RefCell::new(func));\\n\\n Box::into_raw(func) as gpointer\\n\\n}\\n\\n\\n\\n/// Transform a generic FnOnce into a closure that can be used as callback in various glib methods\\n\\n///\\n\\n/// The resulting function can only be called once and will panic otherwise. It will return `Continue(false)`\\n\\n/// in order to prevent being called twice.\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 21,\n \"score\": 348722.8504318694\n },\n {\n \"content\": \"/// Same as [`set_prgname()`].\\n\\n///\\n\\n/// [`set_prgname()`]: fn.set_prgname.html\\n\\npub fn set_program_name(name: Option<&str>) {\\n\\n set_prgname(name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/utils.rs\",\n \"rank\": 22,\n \"score\": 345986.785777921\n },\n {\n \"content\": \"pub fn quantize_line_geometry(thickness: &mut i32, position: &mut i32) {\\n\\n unsafe {\\n\\n ffi::pango_quantize_line_geometry(thickness, position);\\n\\n }\\n\\n}\\n\\n\\n\\n//#[cfg_attr(feature = \\\"v1_38\\\", deprecated)]\\n\\n//pub fn read_line(stream: /*Unimplemented*/Option<Fundamental: Pointer>, str: /*Ignored*/&mut glib::String) -> i32 {\\n\\n// unsafe { TODO: call ffi:pango_read_line() }\\n\\n//}\\n\\n\\n\\n//#[cfg_attr(feature = \\\"v1_38\\\", deprecated)]\\n\\n//pub fn scan_int(pos: /*Unimplemented*/glib::GString) -> Option<i32> {\\n\\n// unsafe { TODO: call ffi:pango_scan_int() }\\n\\n//}\\n\\n\\n\\n//#[cfg_attr(feature = \\\"v1_38\\\", deprecated)]\\n\\n//pub fn scan_string(pos: /*Unimplemented*/glib::GString, out: /*Ignored*/&mut glib::String) -> bool {\\n\\n// unsafe { TODO: call ffi:pango_scan_string() }\\n\\n//}\\n\\n\\n\\n//#[cfg_attr(feature = \\\"v1_38\\\", deprecated)]\\n\\n//pub fn scan_word(pos: /*Unimplemented*/glib::GString, out: /*Ignored*/&mut glib::String) -> bool {\\n\\n// unsafe { TODO: call ffi:pango_scan_word() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"pango/src/auto/functions.rs\",\n \"rank\": 23,\n \"score\": 345741.81377748196\n },\n {\n \"content\": \"pub fn get_version_string() -> &'static str {\\n\\n unsafe {\\n\\n let ptr = ffi::cairo_version_string();\\n\\n CStr::from_ptr(ptr)\\n\\n .to_str()\\n\\n .expect(\\\"invalid version string\\\")\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Clone, Copy)]\\n\\npub struct Version {\\n\\n pub major: u8,\\n\\n pub minor: u8,\\n\\n pub micro: u8,\\n\\n}\\n\\n\\n\\nimpl Version {\\n\\n pub fn get_version() -> Version {\\n\\n let version = unsafe { ffi::cairo_version() };\\n\\n Version {\\n\",\n \"file_path\": \"cairo/src/utils.rs\",\n \"rank\": 24,\n \"score\": 345637.1078253882\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop when it's idle.\\n\\n///\\n\\n/// `func` will be called repeatedly until it returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// In comparison to `idle_add()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn idle_add_once<F>(func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + Send + 'static,\\n\\n{\\n\\n idle_add(fnmut_callback_wrapper(func))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 25,\n \"score\": 345288.44971861003\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop when it's idle.\\n\\n///\\n\\n/// `func` will be called repeatedly until it returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\npub fn idle_add<F>(func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n from_glib(ffi::g_idle_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT_IDLE,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 26,\n \"score\": 345282.252964029\n },\n {\n \"content\": \"pub trait BuildableExt: 'static {\\n\\n fn add_child<P: IsA<Builder>, Q: IsA<glib::Object>>(\\n\\n &self,\\n\\n builder: &P,\\n\\n child: &Q,\\n\\n type_: Option<&str>,\\n\\n );\\n\\n\\n\\n fn construct_child<P: IsA<Builder>>(&self, builder: &P, name: &str) -> Option<glib::Object>;\\n\\n\\n\\n //fn custom_finished<P: IsA<Builder>, Q: IsA<glib::Object>>(&self, builder: &P, child: Option<&Q>, tagname: &str, data: /*Unimplemented*/Option<Fundamental: Pointer>);\\n\\n\\n\\n //fn custom_tag_end<P: IsA<Builder>, Q: IsA<glib::Object>>(&self, builder: &P, child: Option<&Q>, tagname: &str, data: /*Unimplemented*/Option<Fundamental: Pointer>);\\n\\n\\n\\n //fn custom_tag_start<P: IsA<Builder>, Q: IsA<glib::Object>>(&self, builder: &P, child: Option<&Q>, tagname: &str, parser: /*Ignored*/glib::MarkupParser, data: /*Unimplemented*/&mut Option<Fundamental: Pointer>) -> bool;\\n\\n\\n\\n fn get_internal_child<P: IsA<Builder>>(\\n\\n &self,\\n\\n builder: &P,\\n\\n childname: &str,\\n\",\n \"file_path\": \"gtk/src/auto/buildable.rs\",\n \"rank\": 27,\n \"score\": 343822.3408189542\n },\n {\n \"content\": \"pub trait BuildableExtManual: 'static {\\n\\n fn get_buildable_name(&self) -> Option<String>;\\n\\n\\n\\n fn set_buildable_name(&self, name: &str);\\n\\n}\\n\\n\\n\\nimpl<O: IsA<Buildable>> BuildableExtManual for O {\\n\\n fn get_buildable_name(&self) -> Option<String> {\\n\\n unsafe { from_glib_none(ffi::gtk_buildable_get_name(self.as_ref().to_glib_none().0)) }\\n\\n }\\n\\n\\n\\n fn set_buildable_name(&self, name: &str) {\\n\\n unsafe {\\n\\n ffi::gtk_buildable_set_name(self.as_ref().to_glib_none().0, name.to_glib_none().0);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gtk/src/buildable.rs\",\n \"rank\": 28,\n \"score\": 343822.3408189543\n },\n {\n \"content\": \"pub fn path_is_absolute<P: AsRef<std::path::Path>>(file_name: P) -> bool {\\n\\n unsafe { from_glib(ffi::g_path_is_absolute(file_name.as_ref().to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 29,\n \"score\": 340420.5389563604\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop when it's idle.\\n\\n///\\n\\n/// `func` will be called repeatedly until it returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `idle_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\n///\\n\\n/// In comparison to `idle_add_local()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn idle_add_local_once<F>(func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + 'static,\\n\\n{\\n\\n idle_add_local(fnmut_callback_wrapper_local(func))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 30,\n \"score\": 340368.66409136856\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop when it's idle.\\n\\n///\\n\\n/// `func` will be called repeatedly until it returns `Continue(false)`.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `idle_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\npub fn idle_add_local<F>(func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + 'static,\\n\\n{\\n\\n unsafe {\\n\\n assert!(MainContext::default().is_owner());\\n\\n from_glib(ffi::g_idle_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT_IDLE,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 31,\n \"score\": 340363.73723249964\n },\n {\n \"content\": \"pub fn find_paragraph_boundary(text: &str) -> (i32, i32) {\\n\\n let length = text.len() as i32;\\n\\n unsafe {\\n\\n let mut paragraph_delimiter_index = mem::MaybeUninit::uninit();\\n\\n let mut next_paragraph_start = mem::MaybeUninit::uninit();\\n\\n ffi::pango_find_paragraph_boundary(\\n\\n text.to_glib_none().0,\\n\\n length,\\n\\n paragraph_delimiter_index.as_mut_ptr(),\\n\\n next_paragraph_start.as_mut_ptr(),\\n\\n );\\n\\n let paragraph_delimiter_index = paragraph_delimiter_index.assume_init();\\n\\n let next_paragraph_start = next_paragraph_start.assume_init();\\n\\n (paragraph_delimiter_index, next_paragraph_start)\\n\\n }\\n\\n}\\n\\n\\n\\n//pub fn get_log_attrs(text: &str, level: i32, language: &mut Language, log_attrs: /*Ignored*/&[&LogAttr]) {\\n\\n// unsafe { TODO: call ffi:pango_get_log_attrs() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"pango/src/auto/functions.rs\",\n \"rank\": 32,\n \"score\": 340194.2611830549\n },\n {\n \"content\": \"pub fn set_prgname(name: Option<&str>) {\\n\\n unsafe { ffi::g_set_prgname(name.to_glib_none().0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/utils.rs\",\n \"rank\": 33,\n \"score\": 335434.1823915996\n },\n {\n \"content\": \"pub trait HyperlinkImplExt: 'static {\\n\\n fn get_hyperlink(&self) -> Option<Hyperlink>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<HyperlinkImpl>> HyperlinkImplExt for O {\\n\\n fn get_hyperlink(&self) -> Option<Hyperlink> {\\n\\n unsafe {\\n\\n from_glib_full(ffi::atk_hyperlink_impl_get_hyperlink(\\n\\n self.as_ref().to_glib_none().0,\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for HyperlinkImpl {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n f.write_str(\\\"HyperlinkImpl\\\")\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"atk/src/auto/hyperlink_impl.rs\",\n \"rank\": 34,\n \"score\": 332690.6528661475\n },\n {\n \"content\": \"pub trait TextTagExt: 'static {\\n\\n #[cfg(any(feature = \\\"v3_20\\\", feature = \\\"dox\\\"))]\\n\\n #[cfg_attr(feature = \\\"dox\\\", doc(cfg(feature = \\\"v3_20\\\")))]\\n\\n fn changed(&self, size_changed: bool);\\n\\n\\n\\n fn event<P: IsA<glib::Object>>(\\n\\n &self,\\n\\n event_object: &P,\\n\\n event: &gdk::Event,\\n\\n iter: &TextIter,\\n\\n ) -> bool;\\n\\n\\n\\n fn get_priority(&self) -> i32;\\n\\n\\n\\n fn set_priority(&self, priority: i32);\\n\\n\\n\\n fn get_property_accumulative_margin(&self) -> bool;\\n\\n\\n\\n fn set_property_accumulative_margin(&self, accumulative_margin: bool);\\n\\n\\n\",\n \"file_path\": \"gtk/src/auto/text_tag.rs\",\n \"rank\": 35,\n \"score\": 332627.82926307706\n },\n {\n \"content\": \"pub fn content_type_is_a(type_: &str, supertype: &str) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::g_content_type_is_a(\\n\\n type_.to_glib_none().0,\\n\\n supertype.to_glib_none().0,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 36,\n \"score\": 332011.60265022924\n },\n {\n \"content\": \"pub fn dbus_is_address(string: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_dbus_is_address(string.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 37,\n \"score\": 329764.75824010366\n },\n {\n \"content\": \"pub fn dbus_is_guid(string: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_dbus_is_guid(string.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 38,\n \"score\": 329764.75824010366\n },\n {\n \"content\": \"pub fn content_type_guess(filename: Option<&str>, data: &[u8]) -> (glib::GString, bool) {\\n\\n let data_size = data.len() as usize;\\n\\n unsafe {\\n\\n let mut result_uncertain = mem::MaybeUninit::uninit();\\n\\n let ret = from_glib_full(ffi::g_content_type_guess(\\n\\n filename.to_glib_none().0,\\n\\n data.to_glib_none().0,\\n\\n data_size,\\n\\n result_uncertain.as_mut_ptr(),\\n\\n ));\\n\\n let result_uncertain = result_uncertain.assume_init();\\n\\n (ret, from_glib(result_uncertain))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 39,\n \"score\": 328328.6997512671\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to at regular\\n\\n/// intervals with millisecond granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` milliseconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\\n\\n/// precision is not necessary.\\n\\npub fn timeout_source_new<F>(\\n\\n interval: Duration,\\n\\n name: Option<&str>,\\n\\n priority: Priority,\\n\\n func: F,\\n\\n) -> Source\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n let source = ffi::g_timeout_source_new(interval.as_millis() as _);\\n\\n ffi::g_source_set_callback(\\n\\n source,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n );\\n\\n ffi::g_source_set_priority(source, priority.to_glib());\\n\\n\\n\\n if let Some(name) = name {\\n\\n ffi::g_source_set_name(source, name.to_glib_none().0);\\n\\n }\\n\\n\\n\\n from_glib_full(source)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 40,\n \"score\": 327924.69767764397\n },\n {\n \"content\": \"pub fn drawable<F>(application: >k::Application, width: i32, height: i32, draw_fn: F)\\n\\nwhere\\n\\n F: Fn(&DrawingArea, &Context) -> Inhibit + 'static,\\n\\n{\\n\\n let window = gtk::ApplicationWindow::new(application);\\n\\n let drawing_area = Box::new(DrawingArea::new)();\\n\\n\\n\\n drawing_area.connect_draw(draw_fn);\\n\\n\\n\\n window.set_default_size(width, height);\\n\\n\\n\\n window.add(&drawing_area);\\n\\n window.show_all();\\n\\n}\\n\",\n \"file_path\": \"examples/cairo_test/main.rs\",\n \"rank\": 41,\n \"score\": 327826.6940282848\n },\n {\n \"content\": \"pub fn content_type_equals(type1: &str, type2: &str) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::g_content_type_equals(\\n\\n type1.to_glib_none().0,\\n\\n type2.to_glib_none().0,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 42,\n \"score\": 327316.0961552033\n },\n {\n \"content\": \"pub fn content_type_is_unknown(type_: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_content_type_is_unknown(type_.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 43,\n \"score\": 324429.7572992379\n },\n {\n \"content\": \"pub fn hostname_is_non_ascii(hostname: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_hostname_is_non_ascii(hostname.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 44,\n \"score\": 324429.7572992379\n },\n {\n \"content\": \"pub fn hostname_is_ascii_encoded(hostname: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_hostname_is_ascii_encoded(hostname.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 45,\n \"score\": 324429.7572992379\n },\n {\n \"content\": \"pub fn hostname_is_ip_address(hostname: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_hostname_is_ip_address(hostname.to_glib_none().0)) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 46,\n \"score\": 324429.7572992379\n },\n {\n \"content\": \"pub trait DataOutputStreamExt: 'static {\\n\\n fn get_byte_order(&self) -> DataStreamByteOrder;\\n\\n\\n\\n fn put_byte<P: IsA<Cancellable>>(\\n\\n &self,\\n\\n data: u8,\\n\\n cancellable: Option<&P>,\\n\\n ) -> Result<(), glib::Error>;\\n\\n\\n\\n fn put_int16<P: IsA<Cancellable>>(\\n\\n &self,\\n\\n data: i16,\\n\\n cancellable: Option<&P>,\\n\\n ) -> Result<(), glib::Error>;\\n\\n\\n\\n fn put_int32<P: IsA<Cancellable>>(\\n\\n &self,\\n\\n data: i32,\\n\\n cancellable: Option<&P>,\\n\\n ) -> Result<(), glib::Error>;\\n\",\n \"file_path\": \"gio/src/auto/data_output_stream.rs\",\n \"rank\": 47,\n \"score\": 322607.45531662385\n },\n {\n \"content\": \"pub trait DataInputStreamExtManual: 'static {\\n\\n fn read_line<P: IsA<Cancellable>>(\\n\\n &self,\\n\\n cancellable: Option<&P>,\\n\\n ) -> Result<Vec<u8>, glib::Error>;\\n\\n\\n\\n fn read_line_async<\\n\\n P: IsA<Cancellable>,\\n\\n Q: FnOnce(Result<Vec<u8>, glib::Error>) + Send + 'static,\\n\\n >(\\n\\n &self,\\n\\n io_priority: glib::Priority,\\n\\n cancellable: Option<&P>,\\n\\n callback: Q,\\n\\n );\\n\\n\\n\\n fn read_line_async_future(\\n\\n &self,\\n\\n io_priority: glib::Priority,\\n\\n ) -> Pin<Box_<dyn std::future::Future<Output = Result<Vec<u8>, glib::Error>> + 'static>>;\\n\",\n \"file_path\": \"gio/src/data_input_stream.rs\",\n \"rank\": 48,\n \"score\": 322607.45531662385\n },\n {\n \"content\": \"pub trait DataInputStreamExt: 'static {\\n\\n fn get_byte_order(&self) -> DataStreamByteOrder;\\n\\n\\n\\n fn get_newline_type(&self) -> DataStreamNewlineType;\\n\\n\\n\\n fn read_byte<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<u8, glib::Error>;\\n\\n\\n\\n fn read_int16<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<i16, glib::Error>;\\n\\n\\n\\n fn read_int32<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<i32, glib::Error>;\\n\\n\\n\\n fn read_int64<P: IsA<Cancellable>>(&self, cancellable: Option<&P>) -> Result<i64, glib::Error>;\\n\\n\\n\\n fn read_uint16<P: IsA<Cancellable>>(&self, cancellable: Option<&P>)\\n\\n -> Result<u16, glib::Error>;\\n\\n\\n\\n fn read_uint32<P: IsA<Cancellable>>(&self, cancellable: Option<&P>)\\n\\n -> Result<u32, glib::Error>;\\n\\n\\n\\n fn read_uint64<P: IsA<Cancellable>>(&self, cancellable: Option<&P>)\\n\",\n \"file_path\": \"gio/src/auto/data_input_stream.rs\",\n \"rank\": 49,\n \"score\": 322607.45531662385\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to whenever a\\n\\n/// UNIX file descriptor reaches the given IO condition.\\n\\n///\\n\\n/// `func` will be called repeatedly while the file descriptor matches the given IO condition\\n\\n/// until it returns `Continue(false)`.\\n\\npub fn unix_fd_source_new<F>(\\n\\n fd: RawFd,\\n\\n condition: IOCondition,\\n\\n name: Option<&str>,\\n\\n priority: Priority,\\n\\n func: F,\\n\\n) -> Source\\n\\nwhere\\n\\n F: FnMut(RawFd, IOCondition) -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n let source = ffi::g_unix_fd_source_new(fd, condition.to_glib());\\n\\n ffi::g_source_set_callback(\\n\\n source,\\n\\n Some(transmute::<\\n\\n _,\\n\\n unsafe extern \\\"C\\\" fn(ffi::gpointer) -> ffi::gboolean,\\n\\n >(trampoline_unix_fd::<F> as *const ())),\\n\\n into_raw_unix_fd(func),\\n\\n Some(destroy_closure_unix_fd::<F>),\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 50,\n \"score\": 321992.86421958974\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to when a child\\n\\n/// process exits.\\n\\n///\\n\\n/// `func` will be called when `pid` exits\\n\\npub fn child_watch_source_new<F>(\\n\\n pid: Pid,\\n\\n name: Option<&str>,\\n\\n priority: Priority,\\n\\n func: F,\\n\\n) -> Source\\n\\nwhere\\n\\n F: FnMut(Pid, i32) + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n let source = ffi::g_child_watch_source_new(pid.0);\\n\\n ffi::g_source_set_callback(\\n\\n source,\\n\\n Some(transmute::<\\n\\n _,\\n\\n unsafe extern \\\"C\\\" fn(ffi::gpointer) -> ffi::gboolean,\\n\\n >(trampoline_child_watch::<F> as *const ())),\\n\\n into_raw_child_watch(func),\\n\\n Some(destroy_closure_child_watch::<F>),\\n\\n );\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 51,\n \"score\": 321987.5841255577\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to whenever a\\n\\n/// UNIX signal is raised.\\n\\n///\\n\\n/// `func` will be called repeatedly every time `signum` is raised until it\\n\\n/// returns `Continue(false)`.\\n\\npub fn unix_signal_source_new<F>(\\n\\n signum: i32,\\n\\n name: Option<&str>,\\n\\n priority: Priority,\\n\\n func: F,\\n\\n) -> Source\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n let source = ffi::g_unix_signal_source_new(signum);\\n\\n ffi::g_source_set_callback(\\n\\n source,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n );\\n\\n ffi::g_source_set_priority(source, priority.to_glib());\\n\\n\\n\\n if let Some(name) = name {\\n\\n ffi::g_source_set_name(source, name.to_glib_none().0);\\n\\n }\\n\\n\\n\\n from_glib_full(source)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 52,\n \"score\": 321987.22943737527\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to at regular\\n\\n/// intervals with second granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` seconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events.\\n\\npub fn timeout_source_new_seconds<F>(\\n\\n interval: u32,\\n\\n name: Option<&str>,\\n\\n priority: Priority,\\n\\n func: F,\\n\\n) -> Source\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n let source = ffi::g_timeout_source_new_seconds(interval);\\n\\n ffi::g_source_set_callback(\\n\\n source,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n );\\n\\n ffi::g_source_set_priority(source, priority.to_glib());\\n\\n\\n\\n if let Some(name) = name {\\n\\n ffi::g_source_set_name(source, name.to_glib_none().0);\\n\\n }\\n\\n\\n\\n from_glib_full(source)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 53,\n \"score\": 321986.9545554023\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with millisecond granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` milliseconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\\n\\n/// precision is not necessary.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// In comparison to `timeout_add()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn timeout_add_once<F>(interval: Duration, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + Send + 'static,\\n\\n{\\n\\n timeout_add(interval, fnmut_callback_wrapper(func))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 54,\n \"score\": 320472.3461313201\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with millisecond granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` milliseconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\\n\\n/// precision is not necessary.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\npub fn timeout_add<F>(interval: Duration, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n from_glib(ffi::g_timeout_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n interval.as_millis() as _,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 55,\n \"score\": 320466.5497094765\n },\n {\n \"content\": \"pub fn parse_stretch(str: &str, warn: bool) -> Option<Stretch> {\\n\\n unsafe {\\n\\n let mut stretch = mem::MaybeUninit::uninit();\\n\\n let ret = from_glib(ffi::pango_parse_stretch(\\n\\n str.to_glib_none().0,\\n\\n stretch.as_mut_ptr(),\\n\\n warn.to_glib(),\\n\\n ));\\n\\n let stretch = stretch.assume_init();\\n\\n if ret {\\n\\n Some(from_glib(stretch))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pango/src/auto/functions.rs\",\n \"rank\": 56,\n \"score\": 320221.1678215979\n },\n {\n \"content\": \"pub fn parse_style(str: &str, warn: bool) -> Option<Style> {\\n\\n unsafe {\\n\\n let mut style = mem::MaybeUninit::uninit();\\n\\n let ret = from_glib(ffi::pango_parse_style(\\n\\n str.to_glib_none().0,\\n\\n style.as_mut_ptr(),\\n\\n warn.to_glib(),\\n\\n ));\\n\\n let style = style.assume_init();\\n\\n if ret {\\n\\n Some(from_glib(style))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pango/src/auto/functions.rs\",\n \"rank\": 57,\n \"score\": 320221.1678215979\n },\n {\n \"content\": \"pub fn parse_weight(str: &str, warn: bool) -> Option<Weight> {\\n\\n unsafe {\\n\\n let mut weight = mem::MaybeUninit::uninit();\\n\\n let ret = from_glib(ffi::pango_parse_weight(\\n\\n str.to_glib_none().0,\\n\\n weight.as_mut_ptr(),\\n\\n warn.to_glib(),\\n\\n ));\\n\\n let weight = weight.assume_init();\\n\\n if ret {\\n\\n Some(from_glib(weight))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pango/src/auto/functions.rs\",\n \"rank\": 58,\n \"score\": 320221.1678215979\n },\n {\n \"content\": \"pub fn parse_variant(str: &str, warn: bool) -> Option<Variant> {\\n\\n unsafe {\\n\\n let mut variant = mem::MaybeUninit::uninit();\\n\\n let ret = from_glib(ffi::pango_parse_variant(\\n\\n str.to_glib_none().0,\\n\\n variant.as_mut_ptr(),\\n\\n warn.to_glib(),\\n\\n ));\\n\\n let variant = variant.assume_init();\\n\\n if ret {\\n\\n Some(from_glib(variant))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"pango/src/auto/functions.rs\",\n \"rank\": 59,\n \"score\": 320221.1678215979\n },\n {\n \"content\": \"// rustdoc-stripper-ignore-next\\n\\n/// Call from build script to run `glib-compile-resources` to generate compiled gresources to embed\\n\\n/// in binary with [resources_register_include]. `target` is relative to `OUT_DIR`.\\n\\n///\\n\\n/// ```no_run\\n\\n/// gio::compile_resources(\\n\\n/// \\\"resources\\\",\\n\\n/// \\\"resources/resources.gresource.xml\\\",\\n\\n/// \\\"compiled.gresource\\\",\\n\\n/// );\\n\\n/// ```\\n\\npub fn compile_resources<P: AsRef<Path>>(source_dir: P, gresource: &str, target: &str) {\\n\\n let out_dir = env::var(\\\"OUT_DIR\\\").unwrap();\\n\\n\\n\\n let status = Command::new(\\\"glib-compile-resources\\\")\\n\\n .arg(\\\"--sourcedir\\\")\\n\\n .arg(source_dir.as_ref())\\n\\n .arg(\\\"--target\\\")\\n\\n .arg(&format!(\\\"{}/{}\\\", out_dir, target))\\n\\n .arg(gresource)\\n\\n .status()\\n\\n .unwrap();\\n\\n\\n\\n if !status.success() {\\n\\n panic!(\\\"glib-compile-resources failed with exit status {}\\\", status);\\n\\n }\\n\\n\\n\\n println!(\\\"cargo:rerun-if-changed={}\\\", gresource);\\n\\n let output = Command::new(\\\"glib-compile-resources\\\")\\n\\n .arg(\\\"--sourcedir\\\")\\n\\n .arg(source_dir.as_ref())\\n\",\n \"file_path\": \"gio/src/resource.rs\",\n \"rank\": 60,\n \"score\": 319413.0404860616\n },\n {\n \"content\": \"pub fn content_type_can_be_executable(type_: &str) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::g_content_type_can_be_executable(\\n\\n type_.to_glib_none().0,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 61,\n \"score\": 319361.94678127556\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v2_52\\\", feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(feature = \\\"v2_52\\\")))]\\n\\npub fn content_type_is_mime_type(type_: &str, mime_type: &str) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::g_content_type_is_mime_type(\\n\\n type_.to_glib_none().0,\\n\\n mime_type.to_glib_none().0,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 62,\n \"score\": 318533.28041921224\n },\n {\n \"content\": \"pub fn set_application_name(application_name: &str) {\\n\\n unsafe {\\n\\n ffi::g_set_application_name(application_name.to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\\n//pub fn set_error(domain: Quark, code: i32, format: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs) -> Error {\\n\\n// unsafe { TODO: call ffi:g_set_error() }\\n\\n//}\\n\\n\\n\\n//pub fn set_print_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) -> Fn(&str) + 'static {\\n\\n// unsafe { TODO: call ffi:g_set_print_handler() }\\n\\n//}\\n\\n\\n\\n//pub fn set_printerr_handler<P: Fn(&str) + Send + Sync + 'static>(func: P) -> Fn(&str) + 'static {\\n\\n// unsafe { TODO: call ffi:g_set_printerr_handler() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 63,\n \"score\": 317581.7280352667\n },\n {\n \"content\": \"pub fn x11_get_default_screen() -> i32 {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe { ffi::gdk_x11_get_default_screen() }\\n\\n}\\n\\n\\n\\n//#[cfg_attr(feature = \\\"v3_24\\\", deprecated)]\\n\\n//#[cfg(any(feature = \\\"v3_24_2\\\", feature = \\\"dox\\\"))]\\n\\n//#[cfg_attr(feature = \\\"dox\\\", doc(cfg(feature = \\\"v3_24_2\\\")))]\\n\\n//pub fn x11_get_parent_relative_pattern() -> /*Ignored*/Option<cairo::Pattern> {\\n\\n// unsafe { TODO: call ffi:gdk_x11_get_parent_relative_pattern() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"gdkx11/src/auto/functions.rs\",\n \"rank\": 64,\n \"score\": 316350.0261160994\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with second granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` seconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// In comparison to `timeout_add_seconds()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn timeout_add_seconds_once<F>(interval: u32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + Send + 'static,\\n\\n{\\n\\n timeout_add_seconds(interval, fnmut_callback_wrapper(func))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 65,\n \"score\": 315983.9113775549\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with millisecond granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` milliseconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\\n\\n/// precision is not necessary.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `timeout_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\n///\\n\\n/// In comparison to `timeout_add_local()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn timeout_add_local_once<F>(interval: Duration, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + 'static,\\n\\n{\\n\\n timeout_add_local(interval, fnmut_callback_wrapper_local(func))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 66,\n \"score\": 315982.68533643504\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with millisecond granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` milliseconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events. Prefer `timeout_add_seconds` when millisecond\\n\\n/// precision is not necessary.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `timeout_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\npub fn timeout_add_local<F>(interval: Duration, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + 'static,\\n\\n{\\n\\n unsafe {\\n\\n assert!(MainContext::default().is_owner());\\n\\n from_glib(ffi::g_timeout_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n interval.as_millis() as _,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 67,\n \"score\": 315978.1049487622\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with second granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` seconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\npub fn timeout_add_seconds<F>(interval: u32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n from_glib(ffi::g_timeout_add_seconds_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n interval,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 68,\n \"score\": 315978.0656839069\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to when a child\\n\\n/// process exits.\\n\\n///\\n\\n/// `func` will be called when `pid` exits\\n\\npub fn child_watch_add<F>(pid: Pid, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut(Pid, i32) + Send + 'static,\\n\\n{\\n\\n unsafe {\\n\\n from_glib(ffi::g_child_watch_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n pid.0,\\n\\n Some(trampoline_child_watch::<F>),\\n\\n into_raw_child_watch(func),\\n\\n Some(destroy_closure_child_watch::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 69,\n \"score\": 315972.209570295\n },\n {\n \"content\": \"#[repr(C)]\\n\\nstruct ChannelSource<T, F: FnMut(T) -> Continue + 'static> {\\n\\n source: ffi::GSource,\\n\\n source_funcs: Option<Box<ffi::GSourceFuncs>>,\\n\\n channel: Option<Channel<T>>,\\n\\n callback: Option<ThreadGuard<F>>,\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn dispatch<T, F: FnMut(T) -> Continue + 'static>(\\n\\n source: *mut ffi::GSource,\\n\\n callback: ffi::GSourceFunc,\\n\\n _user_data: ffi::gpointer,\\n\\n) -> ffi::gboolean {\\n\\n let source = &mut *(source as *mut ChannelSource<T, F>);\\n\\n assert!(callback.is_none());\\n\\n\\n\\n // Set ready-time to -1 so that we won't get called again before a new item is added\\n\\n // to the channel queue.\\n\\n ffi::g_source_set_ready_time(&mut source.source, -1);\\n\\n\\n\\n // Get a reference to the callback. This will panic if we're called from a different\\n\",\n \"file_path\": \"glib/src/main_context_channel.rs\",\n \"rank\": 70,\n \"score\": 315423.7760669853\n },\n {\n \"content\": \"pub fn access<P: AsRef<std::path::Path>>(filename: P, mode: i32) -> i32 {\\n\\n unsafe { ffi::g_access(filename.as_ref().to_glib_none().0, mode) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 71,\n \"score\": 314749.74195529125\n },\n {\n \"content\": \"#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\\n#[cfg(any(feature = \\\"v2_56\\\", feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(feature = \\\"v2_56\\\")))]\\n\\npub fn unix_is_system_fs_type(fs_type: &str) -> bool {\\n\\n unsafe { from_glib(ffi::g_unix_is_system_fs_type(fs_type.to_glib_none().0)) }\\n\\n}\\n\",\n \"file_path\": \"gio/src/auto/functions.rs\",\n \"rank\": 72,\n \"score\": 314541.7446801306\n },\n {\n \"content\": \"/// Overrides pointer constness.\\n\\n///\\n\\n/// Use when the C API need const pointer, but function with `IsA<T>` constraint,\\n\\n/// that usaly don't have const pointer conversion.\\n\\npub fn const_override<T>(ptr: *mut T) -> *const T {\\n\\n ptr as *const T\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/translate.rs\",\n \"rank\": 73,\n \"score\": 312184.53459002904\n },\n {\n \"content\": \"/// Overrides pointer mutability.\\n\\n///\\n\\n/// Use when the C API should be specifying a const pointer but doesn't.\\n\\npub fn mut_override<T>(ptr: *const T) -> *mut T {\\n\\n ptr as *mut T\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/translate.rs\",\n \"rank\": 74,\n \"score\": 312181.5293943038\n },\n {\n \"content\": \"pub fn mkstemp_full<P: AsRef<std::path::Path>>(tmpl: P, flags: i32, mode: i32) -> i32 {\\n\\n unsafe { ffi::g_mkstemp_full(tmpl.as_ref().to_glib_none().0, flags, mode) }\\n\\n}\\n\\n\\n\\n//pub fn nullify_pointer(nullify_location: /*Unimplemented*/Fundamental: Pointer) {\\n\\n// unsafe { TODO: call ffi:g_nullify_pointer() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 75,\n \"score\": 312030.2730618368\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with second granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` seconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `timeout_add_seconds()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\n///\\n\\n/// In comparison to `timeout_add_seconds_local()`, this only requires `func` to be\\n\\n/// `FnOnce`, and will automatically return `Continue(false)`.\\n\\npub fn timeout_add_seconds_local_once<F>(interval: u32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnOnce() + 'static,\\n\\n{\\n\\n timeout_add_seconds_local(interval, fnmut_callback_wrapper_local(func))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 76,\n \"score\": 311687.69439694774\n },\n {\n \"content\": \"/// Adds a closure to be called by the default main loop at regular intervals\\n\\n/// with second granularity.\\n\\n///\\n\\n/// `func` will be called repeatedly every `interval` seconds until it\\n\\n/// returns `Continue(false)`. Precise timing is not guaranteed, the timeout may\\n\\n/// be delayed by other events.\\n\\n///\\n\\n/// The default main loop almost always is the main loop of the main thread.\\n\\n/// Thus the closure is called on the main thread.\\n\\n///\\n\\n/// Different to `timeout_add_seconds()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\npub fn timeout_add_seconds_local<F>(interval: u32, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut() -> Continue + 'static,\\n\\n{\\n\\n unsafe {\\n\\n assert!(MainContext::default().is_owner());\\n\\n from_glib(ffi::g_timeout_add_seconds_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n interval,\\n\\n Some(trampoline::<F>),\\n\\n into_raw(func),\\n\\n Some(destroy_closure::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 77,\n \"score\": 311683.0839278938\n },\n {\n \"content\": \"/// Adds a closure to be called by the main loop the returned `Source` is attached to when a child\\n\\n/// process exits.\\n\\n///\\n\\n/// `func` will be called when `pid` exits\\n\\n///\\n\\n/// Different to `child_watch_add()`, this does not require `func` to be\\n\\n/// `Send` but can only be called from the thread that owns the main context.\\n\\n///\\n\\n/// This function panics if called from a different thread than the one that\\n\\n/// owns the main context.\\n\\npub fn child_watch_add_local<F>(pid: Pid, func: F) -> SourceId\\n\\nwhere\\n\\n F: FnMut(Pid, i32) + 'static,\\n\\n{\\n\\n unsafe {\\n\\n assert!(MainContext::default().is_owner());\\n\\n from_glib(ffi::g_child_watch_add_full(\\n\\n ffi::G_PRIORITY_DEFAULT,\\n\\n pid.0,\\n\\n Some(trampoline_child_watch::<F>),\\n\\n into_raw_child_watch(func),\\n\\n Some(destroy_closure_child_watch::<F>),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(any(unix, feature = \\\"dox\\\"))]\\n\\n#[cfg_attr(feature = \\\"dox\\\", doc(cfg(unix)))]\\n\",\n \"file_path\": \"glib/src/source.rs\",\n \"rank\": 78,\n \"score\": 311677.4307258952\n },\n {\n \"content\": \"pub fn mkdir_with_parents<P: AsRef<std::path::Path>>(pathname: P, mode: i32) -> i32 {\\n\\n unsafe { ffi::g_mkdir_with_parents(pathname.as_ref().to_glib_none().0, mode) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 79,\n \"score\": 310853.0340873386\n },\n {\n \"content\": \"pub fn keyval_from_name(keyval_name: &str) -> u32 {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe { ffi::gdk_keyval_from_name(keyval_name.to_glib_none().0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gdk/src/auto/functions.rs\",\n \"rank\": 80,\n \"score\": 309547.1801952714\n },\n {\n \"content\": \"#[cfg_attr(feature = \\\"v3_20\\\", deprecated)]\\n\\npub fn test_text_set<P: IsA<Widget>>(widget: &P, string: &str) {\\n\\n skip_assert_initialized!();\\n\\n unsafe {\\n\\n ffi::gtk_test_text_set(widget.as_ref().to_glib_none().0, string.to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gtk/src/auto/functions.rs\",\n \"rank\": 81,\n \"score\": 309413.0540219762\n },\n {\n \"content\": \"pub fn mkstemp<P: AsRef<std::path::Path>>(tmpl: P) -> i32 {\\n\\n #[cfg(not(windows))]\\n\\n use ffi::g_mkstemp;\\n\\n #[cfg(windows)]\\n\\n use ffi::g_mkstemp_utf8 as g_mkstemp;\\n\\n\\n\\n unsafe { g_mkstemp(tmpl.as_ref().to_glib_none().0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/utils.rs\",\n \"rank\": 82,\n \"score\": 308415.2643473271\n },\n {\n \"content\": \"pub fn setting_get(name: &str) -> Option<glib::Value> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n let mut value = glib::Value::uninitialized();\\n\\n let done: bool = from_glib(ffi::gdk_setting_get(\\n\\n name.to_glib_none().0,\\n\\n value.to_glib_none_mut().0,\\n\\n ));\\n\\n if done {\\n\\n Some(value)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gdk/src/functions.rs\",\n \"rank\": 83,\n \"score\": 307403.49840002967\n },\n {\n \"content\": \"pub fn on_error_query(prg_name: &str) {\\n\\n unsafe {\\n\\n ffi::g_on_error_query(prg_name.to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 84,\n \"score\": 306568.92846972926\n },\n {\n \"content\": \"///\\n\\n/// Translate to a pointer with a mutable borrow.\\n\\npub trait ToGlibPtrMut<'a, P: Copy> {\\n\\n type Storage;\\n\\n\\n\\n /// Transfer: none.\\n\\n ///\\n\\n /// The pointer in the `Stash` is only valid for the lifetime of the `Stash`.\\n\\n #[allow(clippy::wrong_self_convention)]\\n\\n fn to_glib_none_mut(&'a mut self) -> StashMut<P, Self>;\\n\\n}\\n\\n\\n\\nimpl<'a, P: Ptr, T: ToGlibPtr<'a, P>> ToGlibPtr<'a, P> for Option<T> {\\n\\n type Storage = Option<<T as ToGlibPtr<'a, P>>::Storage>;\\n\\n\\n\\n #[inline]\\n\\n fn to_glib_none(&'a self) -> Stash<'a, P, Option<T>> {\\n\\n self.as_ref()\\n\\n .map_or(Stash(Ptr::from::<()>(ptr::null_mut()), None), |s| {\\n\\n let s = s.to_glib_none();\\n\\n Stash(s.0, Some(s.1))\\n\\n })\\n\",\n \"file_path\": \"glib/src/translate.rs\",\n \"rank\": 85,\n \"score\": 304918.5748876495\n },\n {\n \"content\": \"pub fn rmdir<P: AsRef<std::path::Path>>(filename: P) -> i32 {\\n\\n unsafe { ffi::g_rmdir(filename.as_ref().to_glib_none().0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 86,\n \"score\": 303926.73684504314\n },\n {\n \"content\": \"pub fn unlink<P: AsRef<std::path::Path>>(filename: P) -> i32 {\\n\\n unsafe { ffi::g_unlink(filename.as_ref().to_glib_none().0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 87,\n \"score\": 303926.73684504314\n },\n {\n \"content\": \"pub fn chdir<P: AsRef<std::path::Path>>(path: P) -> i32 {\\n\\n unsafe { ffi::g_chdir(path.as_ref().to_glib_none().0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 88,\n \"score\": 303926.73684504314\n },\n {\n \"content\": \"#[cfg_attr(feature = \\\"v3_20\\\", deprecated)]\\n\\npub fn test_spin_button_click<P: IsA<SpinButton>>(spinner: &P, button: u32, upwards: bool) -> bool {\\n\\n skip_assert_initialized!();\\n\\n unsafe {\\n\\n from_glib(ffi::gtk_test_spin_button_click(\\n\\n spinner.as_ref().to_glib_none().0,\\n\\n button,\\n\\n upwards.to_glib(),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gtk/src/auto/functions.rs\",\n \"rank\": 89,\n \"score\": 303441.11536195804\n },\n {\n \"content\": \"fn delimiter_to_string(delimiter: Delimiter, open: bool) -> &'static str {\\n\\n match delimiter {\\n\\n Delimiter::Parenthesis => {\\n\\n if open {\\n\\n \\\"(\\\"\\n\\n } else {\\n\\n \\\")\\\"\\n\\n }\\n\\n }\\n\\n Delimiter::Brace => {\\n\\n if open {\\n\\n \\\"{\\\"\\n\\n } else {\\n\\n \\\"}\\\"\\n\\n }\\n\\n }\\n\\n Delimiter::Bracket => {\\n\\n if open {\\n\\n \\\"[\\\"\\n\\n } else {\\n\\n \\\"]\\\"\\n\\n }\\n\\n }\\n\\n Delimiter::None => \\\"\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib-macros/src/clone.rs\",\n \"rank\": 90,\n \"score\": 303404.7099224103\n },\n {\n \"content\": \"pub fn on_error_stack_trace(prg_name: &str) {\\n\\n unsafe {\\n\\n ffi::g_on_error_stack_trace(prg_name.to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\\n//pub fn parse_debug_string(string: Option<&str>, keys: /*Ignored*/&[&DebugKey]) -> u32 {\\n\\n// unsafe { TODO: call ffi:g_parse_debug_string() }\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"glib/src/auto/functions.rs\",\n \"rank\": 91,\n \"score\": 301233.9955831235\n },\n {\n \"content\": \"/// Translate from a pointer type which is annotated with `transfer none`.\\n\\n/// The resulting value is referenced at least once, by the bindings.\\n\\n///\\n\\n/// This is suitable for floating references, which become strong references.\\n\\n/// It is also suitable for acquiring non-gobject values, like `gchar*`.\\n\\n///\\n\\n/// <a name=\\\"safety_points\\\"></a>\\n\\n/// # Safety\\n\\n///\\n\\n/// The implementation of this trait should acquire a reference to the value\\n\\n/// in a way appropriate to the type,\\n\\n/// e.g. by increasing the reference count or copying.\\n\\n/// Values obtained using this trait must be properly released on `drop()`\\n\\n/// by the implementing type.\\n\\n///\\n\\n/// For more information, refer to module level documentation.\\n\\npub trait FromGlibPtrNone<P: Ptr>: Sized {\\n\\n /// # Safety\\n\\n ///\\n\\n /// See trait level [notes on safety](#safety_points)\\n\\n unsafe fn from_glib_none(ptr: P) -> Self;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/src/translate.rs\",\n \"rank\": 92,\n \"score\": 299326.9626917484\n },\n {\n \"content\": \"pub fn propagate_event<P: IsA<Widget>>(widget: &P, event: &mut gdk::Event) {\\n\\n skip_assert_initialized!();\\n\\n unsafe {\\n\\n ffi::gtk_propagate_event(widget.as_ref().to_glib_none().0, event.to_glib_none_mut().0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gtk/src/auto/functions.rs\",\n \"rank\": 93,\n \"score\": 294617.45955583773\n },\n {\n \"content\": \"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(shell_words::split(&value)?),\\n\\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\\n\\n Err(err) => Err(format!(\\\"{} {}\\\", name, err).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"glib/sys/tests/abi.rs\",\n \"rank\": 94,\n \"score\": 291750.0316711452\n },\n {\n \"content\": \"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(shell_words::split(&value)?),\\n\\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\\n\\n Err(err) => Err(format!(\\\"{} {}\\\", name, err).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gtk/sys/tests/abi.rs\",\n \"rank\": 95,\n \"score\": 291750.0316711452\n },\n {\n \"content\": \"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(shell_words::split(&value)?),\\n\\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\\n\\n Err(err) => Err(format!(\\\"{} {}\\\", name, err).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gio/sys/tests/abi.rs\",\n \"rank\": 96,\n \"score\": 291750.0316711452\n },\n {\n \"content\": \"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(shell_words::split(&value)?),\\n\\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\\n\\n Err(err) => Err(format!(\\\"{} {}\\\", name, err).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"atk/sys/tests/abi.rs\",\n \"rank\": 97,\n \"score\": 291750.0316711451\n },\n {\n \"content\": \"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(shell_words::split(&value)?),\\n\\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\\n\\n Err(err) => Err(format!(\\\"{} {}\\\", name, err).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"graphene/sys/tests/abi.rs\",\n \"rank\": 98,\n \"score\": 291750.0316711451\n },\n {\n \"content\": \"fn get_var(name: &str, default: &str) -> Result<Vec<String>, Box<dyn Error>> {\\n\\n match env::var(name) {\\n\\n Ok(value) => Ok(shell_words::split(&value)?),\\n\\n Err(env::VarError::NotPresent) => Ok(shell_words::split(default)?),\\n\\n Err(err) => Err(format!(\\\"{} {}\\\", name, err).into()),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gdk/sys/tests/abi.rs\",\n \"rank\": 99,\n \"score\": 291750.0316711452\n }\n]","isConversational":false}}},{"rowIdx":1995,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"python/src/expression.rs"},"repo_name":{"kind":"string","value":"boaz-codota/ballista"},"commit":{"kind":"string","value":"75f5f79bdcf18ac897d9ab9e11035040d932fc5e"},"file_code":{"kind":"string","value":"/*\nA great deal of this files source code was pulled more or less verbatim from https://github.com/jorgecarleitao/datafusion-python/commit/688f0d23504704cfc2be3fca33e2707e964ea5bc\nwhich is dual liscensed as MIT or Apache-2.0.\n*/\n/*\nMIT License\n\nCopyright (c) 2020 Jorge Leitao\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*/\n\nuse pyo3::{\n basic::CompareOp, exceptions::PyException, prelude::*, types::PyTuple, PyNumberProtocol,\n PyObjectProtocol,\n};\n\nuse crate::util;\nuse datafusion::logical_plan;\nuse datafusion::logical_plan::Expr;\n\n#[pyclass(name = \"Expression\", module = \"ballista\")]\n#[derive(Debug, Clone)]\npub struct BPyExpr {\n pub(crate) expr: Expr,\n}\n\npub fn from_tuple(value: &PyTuple) -> PyResult<Vec<BPyExpr>> {\n value\n .iter()\n .map(|e| e.extract::<BPyExpr>())\n .collect::<PyResult<_>>()\n}\n\npub fn any_to_expression(any: &PyAny) -> PyResult<Expr> {\n if let Ok(expr) = any.extract::<BPyExpr>() {\n Ok(expr.expr)\n } else if let Ok(scalar_value) = any.extract::<crate::scalar::Scalar>() {\n Ok(Expr::Literal(scalar_value.scalar))\n } else {\n let type_name = util::object_class_name(any)\n .unwrap_or_else(|err| format!(\"<Could not get class name:{}>\", err));\n Err(PyException::new_err(format!(\n \"The rhs type {} could not be converted to an expression.\",\n &type_name\n )))\n }\n}\n\n#[pyproto]\nimpl PyNumberProtocol for BPyExpr {\n fn __add__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr + rhs_expr,\n })\n }\n\n fn __sub__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr - rhs_expr,\n })\n }\n\n fn __truediv__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr / rhs_expr,\n })\n }\n\n fn __mul__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr * rhs_expr,\n })\n }\n\n fn __and__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr.and(rhs_expr),\n })\n }\n\n fn __or__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr.or(rhs_expr),\n })\n }\n\n fn __invert__(&self) -> PyResult<BPyExpr> {\n Ok(BPyExpr {\n expr: self.expr.not(),\n })\n }\n}\n\n#[pyproto]\nimpl PyObjectProtocol for BPyExpr {\n fn __str__(&self) -> String {\n format!(\"{:?}\", self.expr)\n }\n\n fn __richcmp__(&self, other: &PyAny, op: CompareOp) -> PyResult<BPyExpr> {\n let other_expr = any_to_expression(other)?;\n Ok(match op {\n CompareOp::Lt => BPyExpr {\n expr: self.expr.lt(other_expr),\n },\n CompareOp::Le => BPyExpr {\n expr: self.expr.lt_eq(other_expr),\n },\n CompareOp::Eq => BPyExpr {\n expr: self.expr.eq(other_expr),\n },\n CompareOp::Ne => BPyExpr {\n expr: self.expr.not_eq(other_expr),\n },\n CompareOp::Gt => BPyExpr {\n expr: self.expr.gt(other_expr),\n },\n CompareOp::Ge => BPyExpr {\n expr: self.expr.gt_eq(other_expr),\n },\n })\n }\n}\n\n#[pymethods]\nimpl BPyExpr {\n #[new]\n fn new(expr: &PyAny) -> PyResult<BPyExpr> {\n let converted_expr = any_to_expression(expr)?;\n Ok(BPyExpr {\n expr: converted_expr,\n })\n }\n\n \n pub fn alias(&self, name: &str) -> PyResult<BPyExpr> {\n Ok(BPyExpr {\n expr: self.expr.alias(name),\n })\n }\n #[args(negated = \"false\")]\n pub fn between(&self, low: &PyAny, high: &PyAny, negated: bool) -> PyResult<BPyExpr> {\n let low_expr = any_to_expression(low)?;\n let high_expr = any_to_expression(high)?;\n\n Ok(BPyExpr {\n expr: Expr::Between {\n expr: Box::new(self.expr.clone()),\n low: Box::new(low_expr),\n high: Box::new(high_expr),\n negated,\n },\n })\n }\n}\nuse pyo3::PyCell;\n\n#[pyclass(module = \"ballista\", module = \"ballista\")]\n#[derive(Clone)]\n\npub struct CaseBuilder {\n case_expr: Option<logical_plan::Expr>,\n when_expr: Vec<logical_plan::Expr>,\n then_expr: Vec<logical_plan::Expr>,\n else_expr: Option<logical_plan::Expr>,\n \n \n built_expr: Option<BPyExpr>,\n}\n\n#[pymethods]\nimpl CaseBuilder {\n #[new]\n #[args(case_expr = \"None\")]\n pub fn new(case_expr: Option<BPyExpr>) -> Self {\n Self {\n case_expr: case_expr.map(|e| e.expr),\n when_expr: vec![],\n then_expr: vec![],\n else_expr: None,\n built_expr: None,\n }\n }\n \n \n pub fn when<'a>(\n slf: &'a PyCell<Self>,\n when: &PyAny,\n then: &PyAny,\n ) -> PyResult<&'a PyCell<Self>> {\n {\n let mut __self = slf.try_borrow_mut()?;\n let when_expr = any_to_expression(when)?;\n let then_expr = any_to_expression(then)?;\n __self.when_impl(when_expr, then_expr)?;\n }\n Ok(slf)\n }\n\n \n \n pub fn otherwise(&mut self, else_expr: &PyAny) -> PyResult<BPyExpr> {\n let other_size_expr = any_to_expression(else_expr)?;\n self.is_built_error()?;\n self.else_expr = Some(other_size_expr);\n self.private_build()\n }\n\n \n pub fn build(&mut self) -> PyResult<BPyExpr> {\n if self.is_built() {\n return Ok(self.built_expr.as_ref().unwrap().clone());\n }\n self.private_build()\n }\n\n #[getter]\n pub fn get_expr(&self) -> Option<BPyExpr> {\n self.built_expr.clone()\n }\n}\n\nimpl CaseBuilder {\n pub fn case(case_expr: Expr) -> Self {\n Self::new(Some(BPyExpr { expr: case_expr }))\n }\n\n pub fn when_impl(&mut self, when: Expr, then: Expr) -> PyResult<()> {\n self.is_built_error()?;\n self.when_expr.push(when);\n self.then_expr.push(then);\n Ok(())\n }\n\n fn is_built(&self) -> bool {\n self.built_expr.is_some()\n }\n\n fn is_built_error(&self) -> PyResult<()> {\n if self.is_built() {\n return Err(PyException::new_err(\"This case builder has already been used, use 'expr' attribute to access expression or create a new builder using case function\"));\n }\n Ok(())\n }\n \n fn private_build(&mut self) -> PyResult<BPyExpr> {\n let mut temp_case = None;\n if self.when_expr.is_empty() {\n return Err(PyException::new_err(\n \"The builder must have at least one when then clause added before building\",\n ));\n }\n std::mem::swap(&mut temp_case, &mut self.case_expr);\n let mut builder = match temp_case {\n Some(expr) => {\n logical_plan::case(expr).when(self.when_expr.remove(0), self.then_expr.remove(0))\n }\n None => logical_plan::when(self.when_expr.remove(0), self.then_expr.remove(0)),\n };\n let mut temp_when = vec![];\n let mut temp_then = vec![];\n\n std::mem::swap(&mut temp_when, &mut self.when_expr);\n std::mem::swap(&mut temp_then, &mut self.then_expr);\n for (when, then) in temp_when.into_iter().zip(temp_then.into_iter()) {\n builder = builder.when(when, then);\n }\n\n let mut temp_else = None;\n std::mem::swap(&mut temp_else, &mut self.else_expr);\n let build_result = match temp_else {\n Some(else_expr) => builder.otherwise(else_expr),\n None => builder.end(),\n }\n .map_err(util::wrap_err)?;\n self.built_expr = Some(BPyExpr { expr: build_result });\n return Ok(self.built_expr.as_ref().unwrap().clone());\n }\n}\n"},"prefix":{"kind":"string","value":"/*\nA great deal of this files source code was pulled more or less verbatim from https://github.com/jorgecarleitao/datafusion-python/commit/688f0d23504704cfc2be3fca33e2707e964ea5bc\nwhich is dual liscensed as MIT or Apache-2.0.\n*/\n/*\nMIT License\n\nCopyright (c) 2020 Jorge Leitao\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*/\n\nuse pyo3::{\n basic::CompareOp, exceptions::PyException, prelude::*, types::PyTuple, PyNumberProtocol,\n PyObjectProtocol,\n};\n\nuse crate::util;\nuse datafusion::logical_plan;\nuse datafusion::logical_plan::Expr;\n\n#[pyclass(name = \"Expression\", module = \"ballista\")]\n#[derive(Debug, Clone)]\npub struct BPyExpr {\n pub(crate) expr: Expr,\n}\n\npub fn from_tuple(value: &PyTuple) -> PyResult<Vec<BPyExpr>> {\n value\n .iter()\n .map(|e| e.extract::<BPyExpr>())\n .collect::<PyResult<_>>()\n}\n\npub fn any_to_expression(any: &PyAny) -> PyResult<Expr> {\n "},"suffix":{"kind":"string","value":"\n}\n\n#[pyproto]\nimpl PyNumberProtocol for BPyExpr {\n fn __add__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr + rhs_expr,\n })\n }\n\n fn __sub__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr - rhs_expr,\n })\n }\n\n fn __truediv__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr / rhs_expr,\n })\n }\n\n fn __mul__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr * rhs_expr,\n })\n }\n\n fn __and__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr.and(rhs_expr),\n })\n }\n\n fn __or__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {\n let rhs_expr = any_to_expression(rhs)?;\n Ok(BPyExpr {\n expr: lhs.expr.or(rhs_expr),\n })\n }\n\n fn __invert__(&self) -> PyResult<BPyExpr> {\n Ok(BPyExpr {\n expr: self.expr.not(),\n })\n }\n}\n\n#[pyproto]\nimpl PyObjectProtocol for BPyExpr {\n fn __str__(&self) -> String {\n format!(\"{:?}\", self.expr)\n }\n\n fn __richcmp__(&self, other: &PyAny, op: CompareOp) -> PyResult<BPyExpr> {\n let other_expr = any_to_expression(other)?;\n Ok(match op {\n CompareOp::Lt => BPyExpr {\n expr: self.expr.lt(other_expr),\n },\n CompareOp::Le => BPyExpr {\n expr: self.expr.lt_eq(other_expr),\n },\n CompareOp::Eq => BPyExpr {\n expr: self.expr.eq(other_expr),\n },\n CompareOp::Ne => BPyExpr {\n expr: self.expr.not_eq(other_expr),\n },\n CompareOp::Gt => BPyExpr {\n expr: self.expr.gt(other_expr),\n },\n CompareOp::Ge => BPyExpr {\n expr: self.expr.gt_eq(other_expr),\n },\n })\n }\n}\n\n#[pymethods]\nimpl BPyExpr {\n #[new]\n fn new(expr: &PyAny) -> PyResult<BPyExpr> {\n let converted_expr = any_to_expression(expr)?;\n Ok(BPyExpr {\n expr: converted_expr,\n })\n }\n\n \n pub fn alias(&self, name: &str) -> PyResult<BPyExpr> {\n Ok(BPyExpr {\n expr: self.expr.alias(name),\n })\n }\n #[args(negated = \"false\")]\n pub fn between(&self, low: &PyAny, high: &PyAny, negated: bool) -> PyResult<BPyExpr> {\n let low_expr = any_to_expression(low)?;\n let high_expr = any_to_expression(high)?;\n\n Ok(BPyExpr {\n expr: Expr::Between {\n expr: Box::new(self.expr.clone()),\n low: Box::new(low_expr),\n high: Box::new(high_expr),\n negated,\n },\n })\n }\n}\nuse pyo3::PyCell;\n\n#[pyclass(module = \"ballista\", module = \"ballista\")]\n#[derive(Clone)]\n\npub struct CaseBuilder {\n case_expr: Option<logical_plan::Expr>,\n when_expr: Vec<logical_plan::Expr>,\n then_expr: Vec<logical_plan::Expr>,\n else_expr: Option<logical_plan::Expr>,\n \n \n built_expr: Option<BPyExpr>,\n}\n\n#[pymethods]\nimpl CaseBuilder {\n #[new]\n #[args(case_expr = \"None\")]\n pub fn new(case_expr: Option<BPyExpr>) -> Self {\n Self {\n case_expr: case_expr.map(|e| e.expr),\n when_expr: vec![],\n then_expr: vec![],\n else_expr: None,\n built_expr: None,\n }\n }\n \n \n pub fn when<'a>(\n slf: &'a PyCell<Self>,\n when: &PyAny,\n then: &PyAny,\n ) -> PyResult<&'a PyCell<Self>> {\n {\n let mut __self = slf.try_borrow_mut()?;\n let when_expr = any_to_expression(when)?;\n let then_expr = any_to_expression(then)?;\n __self.when_impl(when_expr, then_expr)?;\n }\n Ok(slf)\n }\n\n \n \n pub fn otherwise(&mut self, else_expr: &PyAny) -> PyResult<BPyExpr> {\n let other_size_expr = any_to_expression(else_expr)?;\n self.is_built_error()?;\n self.else_expr = Some(other_size_expr);\n self.private_build()\n }\n\n \n pub fn build(&mut self) -> PyResult<BPyExpr> {\n if self.is_built() {\n return Ok(self.built_expr.as_ref().unwrap().clone());\n }\n self.private_build()\n }\n\n #[getter]\n pub fn get_expr(&self) -> Option<BPyExpr> {\n self.built_expr.clone()\n }\n}\n\nimpl CaseBuilder {\n pub fn case(case_expr: Expr) -> Self {\n Self::new(Some(BPyExpr { expr: case_expr }))\n }\n\n pub fn when_impl(&mut self, when: Expr, then: Expr) -> PyResult<()> {\n self.is_built_error()?;\n self.when_expr.push(when);\n self.then_expr.push(then);\n Ok(())\n }\n\n fn is_built(&self) -> bool {\n self.built_expr.is_some()\n }\n\n fn is_built_error(&self) -> PyResult<()> {\n if self.is_built() {\n return Err(PyException::new_err(\"This case builder has already been used, use 'expr' attribute to access expression or create a new builder using case function\"));\n }\n Ok(())\n }\n \n fn private_build(&mut self) -> PyResult<BPyExpr> {\n let mut temp_case = None;\n if self.when_expr.is_empty() {\n return Err(PyException::new_err(\n \"The builder must have at least one when then clause added before building\",\n ));\n }\n std::mem::swap(&mut temp_case, &mut self.case_expr);\n let mut builder = match temp_case {\n Some(expr) => {\n logical_plan::case(expr).when(self.when_expr.remove(0), self.then_expr.remove(0))\n }\n None => logical_plan::when(self.when_expr.remove(0), self.then_expr.remove(0)),\n };\n let mut temp_when = vec![];\n let mut temp_then = vec![];\n\n std::mem::swap(&mut temp_when, &mut self.when_expr);\n std::mem::swap(&mut temp_then, &mut self.then_expr);\n for (when, then) in temp_when.into_iter().zip(temp_then.into_iter()) {\n builder = builder.when(when, then);\n }\n\n let mut temp_else = None;\n std::mem::swap(&mut temp_else, &mut self.else_expr);\n let build_result = match temp_else {\n Some(else_expr) => builder.otherwise(else_expr),\n None => builder.end(),\n }\n .map_err(util::wrap_err)?;\n self.built_expr = Some(BPyExpr { expr: build_result });\n return Ok(self.built_expr.as_ref().unwrap().clone());\n }\n}\n"},"middle":{"kind":"string","value":"if let Ok(expr) = any.extract::<BPyExpr>() {\n Ok(expr.expr)\n } else if let Ok(scalar_value) = any.extract::<crate::scalar::Scalar>() {\n Ok(Expr::Literal(scalar_value.scalar))\n } else {\n let type_name = util::object_class_name(any)\n .unwrap_or_else(|err| format!(\"<Could not get class name:{}>\", err));\n Err(PyException::new_err(format!(\n \"The rhs type {} could not be converted to an expression.\",\n &type_name\n )))\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"#[pyfunction]\n\npub fn count(value: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::count(value.expr),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":0,"score":210292.79264307546},{"content":"#[pyfunction]\n\npub fn min(value: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::min(value.expr),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":1,"score":210292.7926430755},{"content":"#[pyfunction]\n\npub fn avg(value: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::avg(value.expr),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":2,"score":210292.79264307546},{"content":"#[pyfunction]\n\npub fn sum(value: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::sum(value.expr),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":3,"score":210292.7926430755},{"content":"#[pyfunction]\n\npub fn max(value: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::max(value.expr),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":4,"score":210292.7926430755},{"content":"#[pyfunction]\n\npub fn count_distinct(expr: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::count_distinct(expr.expr),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":7,"score":194675.7719643329},{"content":"#[pyfunction(expr = \"*\")]\n\npub fn concat(expr: &PyTuple) -> PyResult<BPyExpr> {\n\n let expressions: Vec<Expr> = util::transform_tuple_to_uniform_type(expr, |e: BPyExpr| e.expr)?;\n\n Ok(BPyExpr {\n\n expr: logical_plan::concat(expressions),\n\n })\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":8,"score":172475.52111632918},{"content":"pub fn format_expr(expr: &dyn PhysicalExpr) -> String {\n\n if let Some(e) = expr.as_any().downcast_ref::<Column>() {\n\n e.name().to_string()\n\n } else if let Some(e) = expr.as_any().downcast_ref::<Literal>() {\n\n e.to_string()\n\n } else if let Some(e) = expr.as_any().downcast_ref::<BinaryExpr>() {\n\n format!(\"{} {} {}\", e.left(), e.op(), e.right())\n\n } else {\n\n format!(\"{}\", expr)\n\n }\n\n}\n\n\n","file_path":"rust/lib/src/utils.rs","rank":9,"score":166327.74964252257},{"content":"#[pyfunction]\n\npub fn col(name: &str) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::col(name),\n\n }\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":10,"score":159057.54567988866},{"content":"pub fn format_agg_expr(expr: &dyn AggregateExpr) -> Result<String> {\n\n Ok(format!(\n\n \"{} {:?}\",\n\n expr.field()?.name(),\n\n expr.expressions()\n\n .iter()\n\n .map(|e| format_expr(e.as_ref()))\n\n .collect::<Vec<String>>()\n\n ))\n\n}\n\n\n","file_path":"rust/lib/src/utils.rs","rank":11,"score":157714.52200473487},{"content":"pub fn init(module: &PyModule) -> PyResult<()> {\n\n module.add_function(wrap_pyfunction!(col, module)?)?;\n\n module.add_function(wrap_pyfunction!(lit, module)?)?;\n\n module.add_function(wrap_pyfunction!(sum, module)?)?;\n\n module.add_function(wrap_pyfunction!(avg, module)?)?;\n\n module.add_function(wrap_pyfunction!(min, module)?)?;\n\n module.add_function(wrap_pyfunction!(max, module)?)?;\n\n module.add_function(wrap_pyfunction!(count, module)?)?;\n\n module.add_function(wrap_pyfunction!(count_distinct, module)?)?;\n\n module.add_function(wrap_pyfunction!(concat, module)?)?;\n\n module.add_function(wrap_pyfunction!(when, module)?)?;\n\n module.add_function(wrap_pyfunction!(case, module)?)?;\n\n module.add_function(wrap_pyfunction!(array, module)?)?;\n\n\n\n //All macro generated scalar functions\n\n module.add_function(wrap_pyfunction!(sqrt, module)?)?;\n\n module.add_function(wrap_pyfunction!(sin, module)?)?;\n\n module.add_function(wrap_pyfunction!(cos, module)?)?;\n\n module.add_function(wrap_pyfunction!(tan, module)?)?;\n\n module.add_function(wrap_pyfunction!(asin, module)?)?;\n","file_path":"python/src/functions.rs","rank":12,"score":154525.74426696653},{"content":"#[pyfunction(module = \"ballista\")]\n\npub fn lit(literal: &PyAny) -> PyResult<BPyExpr> {\n\n let literal_value = literal.extract::<Scalar>()?;\n\n Ok(BPyExpr {\n\n expr: Expr::Literal(literal_value.scalar),\n\n })\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":13,"score":148643.1686469689},{"content":"pub fn ballista_error(message: &str) -> BallistaError {\n\n BallistaError::General(message.to_owned())\n\n}\n\n\n\nimpl From<String> for BallistaError {\n\n fn from(e: String) -> Self {\n\n BallistaError::General(e)\n\n }\n\n}\n\n\n\nimpl From<ArrowError> for BallistaError {\n\n fn from(e: ArrowError) -> Self {\n\n BallistaError::ArrowError(e)\n\n }\n\n}\n\n\n\nimpl From<parser::ParserError> for BallistaError {\n\n fn from(e: parser::ParserError) -> Self {\n\n BallistaError::SqlError(e)\n\n }\n","file_path":"rust/lib/src/error.rs","rank":14,"score":147914.23310843625},{"content":"#[pyfunction(args = \"*\")]\n\npub fn array(args: &PyTuple) -> PyResult<BPyExpr> {\n\n let args: Vec<Expr> = util::transform_tuple_to_uniform_type(args, |e: BPyExpr| e.expr)?;\n\n Ok(BPyExpr {\n\n expr: logical_plan::array(args),\n\n })\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! unary_scalar_expr_pyfunction {\n\n ($FUNC:ident) => {\n\n #[pyfunction]\n\n pub fn $FUNC(e: BPyExpr) -> BPyExpr {\n\n use datafusion::logical_plan;\n\n BPyExpr {\n\n expr: logical_plan::$FUNC(e.expr),\n\n }\n\n }\n\n };\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":15,"score":146055.55337642715},{"content":"pub fn init(m: &PyModule) -> PyResult<()> {\n\n m.add_function(pyo3::wrap_pyfunction!(Date, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Decimal, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Duration, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Dictionary, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(FixedSizeBinary, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(FixedSizeList, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Interval, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(LargeList, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(List, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Struct, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Time, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Timestamp, m)?)?;\n\n m.add_function(pyo3::wrap_pyfunction!(Union, m)?)?;\n\n\n\n m.add_class::<BPyDataType>()?;\n\n m.add_class::<BPyTimeUnit>()?;\n\n m.add_class::<BPyIntervalUnit>()?;\n\n\n\n m.add(\n","file_path":"python/src/datatypes.rs","rank":16,"score":145968.975908459},{"content":"pub fn wrap_df(df: ballista::context::BallistaDataFrame) -> BPyDataFrame {\n\n BPyDataFrame { df }\n\n}\n\n\n\n#[pymethods]\n\nimpl BPyBallistaContext {\n\n #[new]\n\n #[args(host = \"\\\"localhost\\\"\", port = \"50051\", kwds = \"**\")]\n\n pub fn new(host: &str, port: u16, kwds: Option<&pyo3::types::PyDict>) -> PyResult<Self> {\n\n let settings = match kwds {\n\n Some(kwargs) => kwargs\n\n .iter()\n\n .map(|(py_key_obj, py_val_obj)| {\n\n let py_key = py_key_obj.str().map_err(|err| {\n\n pyo3::exceptions::PyTypeError::new_err(format!(\n\n \"kwargs keys must be convertible to a string using __str__: {}\",\n\n err.to_string()\n\n ))\n\n })?;\n\n let py_val = py_val_obj.str().map_err(|err| {\n","file_path":"python/src/context.rs","rank":17,"score":143607.47644401365},{"content":"#[pymodule]\n\nfn ballista(_py: Python, m: &PyModule) -> PyResult<()> {\n\n m.add_class::<context::BPyBallistaContext>()?;\n\n m.add_class::<expression::BPyExpr>()?;\n\n m.add_class::<dataframe::BPyDataFrame>()?;\n\n m.add_class::<expression::CaseBuilder>()?;\n\n m.add_class::<schema::BPySchema>()?;\n\n m.add_class::<field::BPyField>()?;\n\n m.add_class::<partition::BPyPartitioning>()?;\n\n m.add_class::<dfschema::BPyDFSchema>()?;\n\n\n\n crate::functions::init(m)?;\n\n datatypes::init(m)?;\n\n\n\n Ok(())\n\n}\n","file_path":"python/src/lib.rs","rank":18,"score":136989.47893222852},{"content":"#[pyfunction]\n\npub fn case(case: &PyAny) -> PyResult<expression::CaseBuilder> {\n\n let case_expr = expression::any_to_expression(case)?;\n\n Ok(expression::CaseBuilder::case(case_expr))\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":19,"score":131478.42607338773},{"content":"#[pyfunction]\n\npub fn when(when: &PyAny, then: &PyAny) -> PyResult<expression::CaseBuilder> {\n\n let mut builder = expression::CaseBuilder::new(None);\n\n //when method only fails when CaseBuilder has already built the expression so this is safe to unwrap\n\n let when_expr = expression::any_to_expression(when)?;\n\n let then_expr = expression::any_to_expression(then)?;\n\n builder.when_impl(when_expr, then_expr).unwrap();\n\n Ok(builder)\n\n}\n\n\n","file_path":"python/src/functions.rs","rank":20,"score":130150.0796322027},{"content":"pub fn print_version() {\n\n println!(\"Ballista version: {}\", BALLISTA_VERSION)\n\n}\n\n\n\npub mod client;\n\npub mod columnar_batch;\n\npub mod context;\n\npub mod error;\n\npub mod executor;\n\npub mod memory_stream;\n\npub mod prelude;\n\npub mod scheduler;\n\npub mod utils;\n\n\n\n#[cfg(test)]\n\npub mod test_utils;\n\n\n\n#[macro_use]\n\n\n\npub mod serde;\n","file_path":"rust/lib/src/lib.rs","rank":21,"score":128350.17354828728},{"content":"fn parse_required_expr(p: &Option<Box<protobuf::LogicalExprNode>>) -> Result<Expr, BallistaError> {\n\n match p {\n\n Some(expr) => expr.as_ref().try_into(),\n\n None => Err(proto_error(\"Missing required expression\")),\n\n }\n\n}\n\n\n","file_path":"rust/lib/src/serde/logical_plan/from_proto.rs","rank":22,"score":126397.3651367623},{"content":"struct BallistaError(ballista::error::BallistaError);\n\n\n\nimpl From<ballista::error::BallistaError> for BallistaError {\n\n fn from(err: ballista::error::BallistaError) -> Self {\n\n BallistaError(err)\n\n }\n\n}\n\n\n\nimpl From<BallistaError> for PyErr {\n\n fn from(err: BallistaError) -> PyErr {\n\n exceptions::PyException::new_err(err.0.to_string())\n\n }\n\n}\n\n\n\nimpl std::error::Error for BallistaError {}\n\nimpl std::fmt::Display for BallistaError {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n <ballista::error::BallistaError as std::fmt::Display>::fmt(&self.0, f)\n\n }\n\n}\n\n\n\nimpl std::fmt::Debug for BallistaError {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n <ballista::error::BallistaError as std::fmt::Debug>::fmt(&self.0, f)\n\n }\n\n}\n\n\n","file_path":"python/src/error.rs","rank":23,"score":125298.94820484435},{"content":"pub fn remove_unresolved_shuffles(\n\n stage: &dyn ExecutionPlan,\n\n partition_locations: &HashMap<usize, Vec<PartitionLocation>>,\n\n) -> Result<Arc<dyn ExecutionPlan>> {\n\n let mut new_children: Vec<Arc<dyn ExecutionPlan>> = vec![];\n\n for child in stage.children() {\n\n if let Some(unresolved_shuffle) = child.as_any().downcast_ref::<UnresolvedShuffleExec>() {\n\n let mut relevant_locations = vec![];\n\n for id in &unresolved_shuffle.query_stage_ids {\n\n relevant_locations.append(\n\n &mut partition_locations\n\n .get(id)\n\n .ok_or_else(|| {\n\n BallistaError::General(\n\n \"Missing partition location. Could not remove unresolved shuffles\"\n\n .to_owned(),\n\n )\n\n })?\n\n .clone(),\n\n );\n","file_path":"rust/lib/src/scheduler/planner.rs","rank":24,"score":124001.97000289432},{"content":"struct MergedRecordBatchStream {\n\n schema: SchemaRef,\n\n select_all: Pin<Box<SelectAll<SendableRecordBatchStream>>>,\n\n}\n\n\n\nimpl Stream for MergedRecordBatchStream {\n\n type Item = ArrowResult<RecordBatch>;\n\n\n\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {\n\n self.select_all.as_mut().poll_next(cx)\n\n }\n\n}\n\n\n\nimpl RecordBatchStream for MergedRecordBatchStream {\n\n fn schema(&self) -> SchemaRef {\n\n self.schema.clone()\n\n }\n\n}\n","file_path":"rust/lib/src/executor/collect.rs","rank":25,"score":105842.38107999698},{"content":"/// Convert a single RecordBatch into an iterator of FlightData (containing\n\n/// dictionaries and batches)\n\nfn create_flight_iter(\n\n batch: &RecordBatch,\n\n options: &IpcWriteOptions,\n\n) -> Box<dyn Iterator<Item = Result<FlightData, Status>>> {\n\n let (flight_dictionaries, flight_batch) =\n\n arrow_flight::utils::flight_data_from_arrow_batch(batch, &options);\n\n Box::new(\n\n flight_dictionaries\n\n .into_iter()\n\n .chain(std::iter::once(flight_batch))\n\n .map(Ok),\n\n )\n\n}\n\n\n\nasync fn stream_flight_data<T>(reader: FileReader<T>, tx: FlightDataSender) -> Result<(), Status>\n\nwhere\n\n T: Read + Seek,\n\n{\n\n let options = arrow::ipc::writer::IpcWriteOptions::default();\n\n let schema_flight_data =\n","file_path":"rust/lib/src/executor/flight_service.rs","rank":26,"score":104858.68086057172},{"content":"fn compile_expr(\n\n expr: &protobuf::LogicalExprNode,\n\n schema: &Schema,\n\n) -> Result<Arc<dyn PhysicalExpr>, BallistaError> {\n\n let df_planner = DefaultPhysicalPlanner::default();\n\n let state = ExecutionContextState {\n\n datasources: HashMap::new(),\n\n scalar_functions: HashMap::new(),\n\n var_provider: HashMap::new(),\n\n aggregate_functions: HashMap::new(),\n\n config: ExecutionConfig::new(),\n\n };\n\n let expr: Expr = expr.try_into()?;\n\n df_planner\n\n .create_physical_expr(&expr, schema, &state)\n\n .map_err(|e| BallistaError::General(format!(\"{:?}\", e)))\n\n}\n","file_path":"rust/lib/src/serde/physical_plan/from_proto.rs","rank":27,"score":104770.62150018888},{"content":"fn parse_optional_expr(\n\n p: &Option<Box<protobuf::LogicalExprNode>>,\n\n) -> Result<Option<Expr>, BallistaError> {\n\n match p {\n\n Some(expr) => expr.as_ref().try_into().map(Some),\n\n None => Ok(None),\n\n }\n\n}\n","file_path":"rust/lib/src/serde/logical_plan/from_proto.rs","rank":28,"score":102766.047347216},{"content":"fn try_parse_when_then_expr(\n\n when_expr: &Arc<dyn PhysicalExpr>,\n\n then_expr: &Arc<dyn PhysicalExpr>,\n\n) -> Result<protobuf::WhenThen, BallistaError> {\n\n Ok(protobuf::WhenThen {\n\n when_expr: Some(when_expr.clone().try_into()?),\n\n then_expr: Some(then_expr.clone().try_into()?),\n\n })\n\n}\n","file_path":"rust/lib/src/serde/physical_plan/to_proto.rs","rank":29,"score":102766.047347216},{"content":"pub fn any_to_datatype(any: &PyAny) -> PyResult<DataType> {\n\n if let Ok(datatype) = any.extract::<BPyDataType>() {\n\n Ok(datatype.datatype)\n\n } else if let Ok(datatype_str) = any.extract::<&str>() {\n\n Ok(match datatype_str {\n\n \"int8\" | \"i8\" => DataType::Int8,\n\n \"int16\" | \"i16\" => DataType::Int16,\n\n \"int32\" | \"int\" | \"i32\" => DataType::Int32,\n\n \"int64\" | \"i64\" => DataType::Int64,\n\n \"uint8\" | \"u8\" => DataType::UInt8,\n\n \"uint16\" | \"u16\" => DataType::UInt16,\n\n \"uint32\" | \"uint\" | \"u32\" => DataType::UInt32,\n\n \"uint64\" | \"u64\" => DataType::UInt64,\n\n \"str\" | \"utf8\" => DataType::Utf8,\n\n \"float32\" | \"f32\" => DataType::Float32,\n\n \"float\" | \"f64\" => DataType::Float64,\n\n \"bool\" => DataType::Boolean,\n\n \"date32\" => DataType::Date32,\n\n \"date64\" => DataType::Date64,\n\n _ => {\n","file_path":"python/src/datatypes.rs","rank":30,"score":102530.484368543},{"content":"pub fn get_tpch_schema(table: &str) -> Schema {\n\n // note that the schema intentionally uses signed integers so that any generated Parquet\n\n // files can also be used to benchmark tools that only support signed integers, such as\n\n // Apache Spark\n\n\n\n match table {\n\n \"part\" => Schema::new(vec![\n\n Field::new(\"p_partkey\", DataType::Int32, false),\n\n Field::new(\"p_name\", DataType::Utf8, false),\n\n Field::new(\"p_mfgr\", DataType::Utf8, false),\n\n Field::new(\"p_brand\", DataType::Utf8, false),\n\n Field::new(\"p_type\", DataType::Utf8, false),\n\n Field::new(\"p_size\", DataType::Int32, false),\n\n Field::new(\"p_container\", DataType::Utf8, false),\n\n Field::new(\"p_retailprice\", DataType::Float64, false),\n\n Field::new(\"p_comment\", DataType::Utf8, false),\n\n ]),\n\n\n\n \"supplier\" => Schema::new(vec![\n\n Field::new(\"s_suppkey\", DataType::Int32, false),\n","file_path":"rust/lib/src/test_utils.rs","rank":31,"score":102052.20630442858},{"content":"pub fn transform_tuple_to_uniform_type<'a, T: FromPyObject<'a>, U, F: Fn(T) -> U>(\n\n tuple: &'a PyTuple,\n\n transform: F,\n\n) -> PyResult<Vec<U>> {\n\n tuple\n\n .iter()\n\n .map(|tuple_item| Ok(transform(tuple_item.extract::<T>()?)))\n\n .collect::<Result<Vec<U>, PyErr>>()\n\n}\n\n\n","file_path":"python/src/util.rs","rank":32,"score":101752.54218540441},{"content":" @Override\n\n public Struct createStruct(String s, Object[] objects) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":33,"score":101482.06380207253},{"content":"//Does not typecheck lists\n\nfn typechecked_scalar_value_conversion(\n\n tested_type: &protobuf::scalar_value::Value,\n\n required_type: protobuf::PrimitiveScalarType,\n\n) -> Result<datafusion::scalar::ScalarValue, BallistaError> {\n\n use protobuf::scalar_value::Value;\n\n use protobuf::PrimitiveScalarType;\n\n Ok(match (tested_type, &required_type) {\n\n (Value::BoolValue(v), PrimitiveScalarType::Bool) => ScalarValue::Boolean(Some(*v)),\n\n (Value::Int8Value(v), PrimitiveScalarType::Int8) => ScalarValue::Int8(Some(*v as i8)),\n\n (Value::Int16Value(v), PrimitiveScalarType::Int16) => ScalarValue::Int16(Some(*v as i16)),\n\n (Value::Int32Value(v), PrimitiveScalarType::Int32) => ScalarValue::Int32(Some(*v)),\n\n (Value::Int64Value(v), PrimitiveScalarType::Int64) => ScalarValue::Int64(Some(*v)),\n\n (Value::Uint8Value(v), PrimitiveScalarType::Uint8) => ScalarValue::UInt8(Some(*v as u8)),\n\n (Value::Uint16Value(v), PrimitiveScalarType::Uint16) => {\n\n ScalarValue::UInt16(Some(*v as u16))\n\n }\n\n (Value::Uint32Value(v), PrimitiveScalarType::Uint32) => ScalarValue::UInt32(Some(*v)),\n\n (Value::Uint64Value(v), PrimitiveScalarType::Uint64) => ScalarValue::UInt64(Some(*v)),\n\n (Value::Float32Value(v), PrimitiveScalarType::Float32) => ScalarValue::Float32(Some(*v)),\n\n (Value::Float64Value(v), PrimitiveScalarType::Float64) => ScalarValue::Float64(Some(*v)),\n","file_path":"rust/lib/src/serde/logical_plan/from_proto.rs","rank":34,"score":100908.21043080458},{"content":"pub fn any_to_bpyfield(any: &PyAny) -> PyResult<BPyField> {\n\n let field: BPyField = if let Ok(native_field) = any.extract::<BPyField>() {\n\n native_field\n\n } else if let Ok(py_dict) = any.extract::<&PyDict>() {\n\n //Begin with extracting all required keys from dictionary\n\n let name = py_dict\n\n .get_item(\"name\")\n\n .ok_or_else(|| util::missing_key(\"name\", \"field dictionary\"))?;\n\n let datatype = py_dict\n\n .get_item(\"datatype\")\n\n .ok_or_else(|| util::missing_key(\"datatype\", \"field dictionary\"))?;\n\n //If nullable is not present then set nullable to false\n\n let nullable = match py_dict.get_item(\"nullable\") {\n\n Some(pyobj) => pyobj.extract::<bool>()?,\n\n None => false,\n\n };\n\n\n\n let dict_id = match py_dict.get_item(\"dict_id\") {\n\n Some(pyobj) => Some(pyobj.extract::<i64>()?),\n\n None => None,\n","file_path":"python/src/field.rs","rank":35,"score":100631.42883220284},{"content":"#[pyfunction(members = \"*\")]\n\nfn Struct(members: &PyTuple) -> PyResult<BPyDataType> {\n\n if members.is_empty() {\n\n return Err(PyException::new_err(\n\n \"To construct a Struct at least a single Field must be provided\",\n\n ));\n\n }\n\n let struct_members = members\n\n .iter()\n\n .map(|any| Ok(any.extract::<BPyField>()?.arrow_field))\n\n .collect::<PyResult<Vec<Field>>>()?;\n\n Ok(BPyDataType {\n\n datatype: DataType::Struct(struct_members),\n\n })\n\n}\n\n\n","file_path":"python/src/datatypes.rs","rank":36,"score":100601.73645680587},{"content":"pub fn wrap_kwarg_keytype_error(err: PyErr) -> PyErr {\n\n pyo3::exceptions::PyTypeError::new_err(format!(\n\n \"kwargs values must be convertible to a string using __str__: {}\",\n\n err.to_string()\n\n ))\n\n}\n","file_path":"python/src/error.rs","rank":37,"score":100336.56450382603},{"content":" @Override\n\n public Connection connect(String url, Properties properties) throws SQLException {\n\n logger.info(\"connect() url={}\", url);\n\n //TODO this needs much more work to parse full URLs but this is enough to get end to end tests running\n\n String c = url.substring(PREFIX.length());\n\n int i = c.indexOf(':');\n\n if (i == -1) {\n\n return new FlightConnection(c, 50051);\n\n } else {\n\n return new FlightConnection(c.substring(0,i), Integer.parseInt(c.substring(i + 1)));\n\n }\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/Driver.java","rank":38,"score":99874.53156904224},{"content":"fn create_proto_scalar<I, T: FnOnce(&I) -> protobuf::scalar_value::Value>(\n\n v: &Option<I>,\n\n null_arrow_type: protobuf::PrimitiveScalarType,\n\n constructor: T,\n\n) -> protobuf::ScalarValue {\n\n protobuf::ScalarValue {\n\n value: Some(v.as_ref().map(constructor).unwrap_or(\n\n protobuf::scalar_value::Value::NullValue(null_arrow_type as i32),\n\n )),\n\n }\n\n}\n\n\n\nimpl TryInto<protobuf::LogicalExprNode> for &Expr {\n\n type Error = BallistaError;\n\n\n\n fn try_into(self) -> Result<protobuf::LogicalExprNode, Self::Error> {\n\n use datafusion::scalar::ScalarValue;\n\n use protobuf::scalar_value::Value;\n\n match self {\n\n Expr::Column(name) => {\n","file_path":"rust/lib/src/serde/logical_plan/to_proto.rs","rank":39,"score":99740.03424731476},{"content":"pub fn object_class_name(ob: &PyAny) -> PyResult<String> {\n\n let qual_name = ob\n\n .getattr(\"__class__\")?\n\n .getattr(\"__qualname__\")?\n\n .extract::<&str>()?;\n\n let module_name = ob\n\n .getattr(\"__class__\")?\n\n .getattr(\"__module__\")?\n\n .extract::<&str>()?;\n\n Ok(format!(\"{}.{}\", module_name, qual_name))\n\n}\n","file_path":"python/src/util.rs","rank":40,"score":98827.57183097636},{"content":"pub fn to_py(batches: &[RecordBatch]) -> PyResult<PyObject> {\n\n let gil = pyo3::Python::acquire_gil();\n\n let py = gil.python();\n\n let pyarrow = PyModule::import(py, \"pyarrow\")?;\n\n let builtins = PyModule::import(py, \"builtins\")?;\n\n\n\n let mut py_batches = vec![];\n\n for batch in batches {\n\n py_batches.push(to_py_batch(batch, py, pyarrow)?);\n\n }\n\n let result = builtins.call1(\"list\", (py_batches,))?;\n\n Ok(PyObject::from(result))\n\n}\n\n\n","file_path":"python/src/dataframe.rs","rank":41,"score":98827.57183097636},{"content":"pub fn datafusion_test_context(path: &str) -> Result<ExecutionContext> {\n\n let mut ctx = ExecutionContext::new();\n\n for table in TPCH_TABLES {\n\n let schema = get_tpch_schema(table);\n\n let options = CsvReadOptions::new()\n\n .schema(&schema)\n\n .delimiter(b'|')\n\n .has_header(false)\n\n .file_extension(\".tbl\");\n\n let dir = format!(\"{}/{}\", path, table);\n\n ctx.register_csv(table, &dir, options)?;\n\n }\n\n Ok(ctx)\n\n}\n\n\n","file_path":"rust/lib/src/test_utils.rs","rank":42,"score":95478.18681457799},{"content":"pub fn missing_key(key_name: &str, from_name: &str) -> PyErr {\n\n PyException::new_err(format!(\n\n \"The required key {} was not present in {}.\",\n\n key_name, from_name\n\n ))\n\n}\n\n\n","file_path":"python/src/util.rs","rank":43,"score":94479.57535816792},{"content":"fn from_ballista_err(e: &crate::error::BallistaError) -> Status {\n\n Status::internal(format!(\"Ballista Error: {:?}\", e))\n\n}\n\n\n","file_path":"rust/lib/src/executor/flight_service.rs","rank":44,"score":90969.78631110275},{"content":"pub fn produce_diagram(filename: &str, stages: &[Arc<QueryStageExec>]) -> Result<()> {\n\n let write_file = File::create(filename)?;\n\n let mut w = BufWriter::new(&write_file);\n\n writeln!(w, \"digraph G {{\")?;\n\n\n\n // draw stages and entities\n\n for stage in stages {\n\n writeln!(w, \"\\tsubgraph cluster{} {{\", stage.stage_id)?;\n\n writeln!(w, \"\\t\\tlabel = \\\"Stage {}\\\";\", stage.stage_id)?;\n\n let mut id = AtomicUsize::new(0);\n\n build_exec_plan_diagram(&mut w, stage.child.as_ref(), stage.stage_id, &mut id, true)?;\n\n writeln!(w, \"\\t}}\")?;\n\n }\n\n\n\n // draw relationships\n\n for stage in stages {\n\n let mut id = AtomicUsize::new(0);\n\n build_exec_plan_diagram(&mut w, stage.child.as_ref(), stage.stage_id, &mut id, false)?;\n\n }\n\n\n\n write!(w, \"}}\")?;\n\n Ok(())\n\n}\n\n\n","file_path":"rust/lib/src/utils.rs","rank":45,"score":89098.731249609},{"content":"pub fn to_py_array(array: &ArrayRef, py: Python) -> PyResult<PyObject> {\n\n let (array_pointer, schema_pointer) = array.to_raw().map_err(crate::util::wrap_err)?;\n\n\n\n let pa = py.import(\"pyarrow\")?;\n\n\n\n let array = pa.getattr(\"Array\")?.call_method1(\n\n \"_import_from_c\",\n\n (\n\n array_pointer as Py_uintptr_t,\n\n schema_pointer as Py_uintptr_t,\n\n ),\n\n )?;\n\n Ok(array.to_object(py))\n\n}\n\n\n","file_path":"python/src/dataframe.rs","rank":46,"score":89098.731249609},{"content":"pub fn wrap_err<E: std::error::Error>(err: E) -> PyErr {\n\n PyException::new_err(err.to_string())\n\n}\n\n\n","file_path":"python/src/util.rs","rank":47,"score":88806.52928329752},{"content":"pub fn wrap_err<E: std::error::Error>(err: E) -> PyErr {\n\n PyException::new_err(err.to_string())\n\n}\n","file_path":"python/src/dataframe.rs","rank":48,"score":88806.52928329752},{"content":"pub fn format_plan(plan: &dyn ExecutionPlan, indent: usize) -> Result<String> {\n\n let operator_str = if let Some(exec) = plan.as_any().downcast_ref::<HashAggregateExec>() {\n\n format!(\n\n \"HashAggregateExec: groupBy={:?}, aggrExpr={:?}\",\n\n exec.group_expr()\n\n .iter()\n\n .map(|e| format_expr(e.0.as_ref()))\n\n .collect::<Vec<String>>(),\n\n exec.aggr_expr()\n\n .iter()\n\n .map(|e| format_agg_expr(e.as_ref()))\n\n .collect::<Result<Vec<String>>>()?\n\n )\n\n } else if let Some(exec) = plan.as_any().downcast_ref::<HashJoinExec>() {\n\n format!(\n\n \"HashJoinExec: joinType={:?}, on={:?}\",\n\n exec.join_type(),\n\n exec.on()\n\n )\n\n } else if let Some(exec) = plan.as_any().downcast_ref::<ParquetExec>() {\n","file_path":"rust/lib/src/utils.rs","rank":49,"score":87248.95704311691},{"content":"pub fn kwargs_to_string_map(kwargs: Option<&PyDict>) -> PyResult<HashMap<String, String>> {\n\n Ok(match kwargs {\n\n Some(kwargs) => kwargs\n\n .iter()\n\n .map(|(py_key_obj, py_val_obj)| {\n\n let py_key = py_key_obj.str().map_err(|err| {\n\n pyo3::exceptions::PyTypeError::new_err(format!(\n\n \"kwargs keys must be convertible to a string using str(): {}\",\n\n err.to_string()\n\n ))\n\n })?;\n\n let py_val = py_val_obj.str().map_err(|err| {\n\n pyo3::exceptions::PyTypeError::new_err(format!(\n\n \"kwargs values must be convertible to a string using str(): {}\",\n\n err.to_string()\n\n ))\n\n })?;\n\n Ok((py_key.to_str()?.to_owned(), py_val.to_str()?.to_owned()))\n\n })\n\n .collect::<Result<HashMap<String, String>, PyErr>>()?,\n\n None => HashMap::new(),\n\n })\n\n}\n\n\n","file_path":"python/src/util.rs","rank":50,"score":84341.9665117463},{"content":"pub fn tuple_to_uniform_type<'a, T: FromPyObject<'a>>(tuple: &'a PyTuple) -> PyResult<Vec<T>> {\n\n tuple\n\n .iter()\n\n .map(|tuple_item| tuple_item.extract::<T>())\n\n .collect::<Result<Vec<T>, PyErr>>()\n\n}\n\nuse pyo3::PyAny;\n","file_path":"python/src/util.rs","rank":51,"score":80189.67616011022},{"content":"fn from_proto_binary_op(op: &str) -> Result<Operator, BallistaError> {\n\n match op {\n\n \"And\" => Ok(Operator::And),\n\n \"Or\" => Ok(Operator::Or),\n\n \"Eq\" => Ok(Operator::Eq),\n\n \"NotEq\" => Ok(Operator::NotEq),\n\n \"LtEq\" => Ok(Operator::LtEq),\n\n \"Lt\" => Ok(Operator::Lt),\n\n \"Gt\" => Ok(Operator::Gt),\n\n \"GtEq\" => Ok(Operator::GtEq),\n\n \"Plus\" => Ok(Operator::Plus),\n\n \"Minus\" => Ok(Operator::Minus),\n\n \"Multiply\" => Ok(Operator::Multiply),\n\n \"Divide\" => Ok(Operator::Divide),\n\n \"Like\" => Ok(Operator::Like),\n\n other => Err(proto_error(format!(\n\n \"Unsupported binary operator '{:?}'\",\n\n other\n\n ))),\n\n }\n","file_path":"rust/lib/src/serde/logical_plan/from_proto.rs","rank":52,"score":75545.42649527274},{"content":"public class FlightConnection implements java.sql.Connection {\n\n\n\n protected final String host;\n\n protected final int port;\n\n\n\n public FlightConnection(String host, int port) {\n\n this.host = host;\n\n this.port = port;\n\n }\n\n\n\n @Override\n\n public FlightStatement createStatement() throws SQLException {\n\n return new FlightStatement(this);\n\n }\n\n\n\n @Override\n\n public FlightPreparedStatement prepareStatement(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public CallableStatement prepareCall(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public String nativeSQL(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public boolean getAutoCommit() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setAutoCommit(boolean b) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void commit() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void rollback() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void close() throws SQLException {\n\n\n\n }\n\n\n\n @Override\n\n public boolean isClosed() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public DatabaseMetaData getMetaData() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public boolean isReadOnly() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setReadOnly(boolean b) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public String getCatalog() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setCatalog(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public int getTransactionIsolation() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setTransactionIsolation(int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public SQLWarning getWarnings() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void clearWarnings() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightStatement createStatement(int i, int i1) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightPreparedStatement prepareStatement(String s, int i, int i1) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public CallableStatement prepareCall(String s, int i, int i1) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Map<String, Class<?>> getTypeMap() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setTypeMap(Map<String, Class<?>> map) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public int getHoldability() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setHoldability(int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Savepoint setSavepoint() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Savepoint setSavepoint(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void rollback(Savepoint savepoint) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void releaseSavepoint(Savepoint savepoint) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightStatement createStatement(int i, int i1, int i2) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightPreparedStatement prepareStatement(String s, int i, int i1, int i2) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public CallableStatement prepareCall(String s, int i, int i1, int i2) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightPreparedStatement prepareStatement(String s, int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightPreparedStatement prepareStatement(String s, int[] ints) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public FlightPreparedStatement prepareStatement(String s, String[] strings) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Clob createClob() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Blob createBlob() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public NClob createNClob() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public SQLXML createSQLXML() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public boolean isValid(int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setClientInfo(String s, String s1) throws SQLClientInfoException {\n\n throw new SQLClientInfoException();\n\n\n\n }\n\n\n\n @Override\n\n public String getClientInfo(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Properties getClientInfo() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setClientInfo(Properties properties) throws SQLClientInfoException {\n\n throw new SQLClientInfoException();\n\n }\n\n\n\n @Override\n\n public Array createArrayOf(String s, Object[] objects) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public Struct createStruct(String s, Object[] objects) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public String getSchema() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setSchema(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void abort(Executor executor) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public void setNetworkTimeout(Executor executor, int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public int getNetworkTimeout() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public <T> T unwrap(Class<T> aClass) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n\n\n\n @Override\n\n public boolean isWrapperFor(Class<?> aClass) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n\n }\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":53,"score":73398.84482712671},{"content":"#[pyfunction]\n\nfn Dictionary(key_type: BPyDataType, value_type: BPyDataType) -> BPyDataType {\n\n BPyDataType {\n\n datatype: DataType::Dictionary(Box::new(key_type.datatype), Box::new(value_type.datatype)),\n\n }\n\n}\n\n\n","file_path":"python/src/datatypes.rs","rank":54,"score":72795.76768157659},{"content":" @Override\n\n public boolean isWrapperFor(Class<?> aClass) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":55,"score":72059.52852754263},{"content":" @Override\n\n public void rollback(Savepoint savepoint) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":56,"score":72059.52852754263},{"content":" @Override\n\n public void abort(Executor executor) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":57,"score":72059.52852754263},{"content":" @Override\n\n public <T> T unwrap(Class<T> aClass) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":58,"score":72059.52852754263},{"content":" @Override\n\n public boolean isReadOnly() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":59,"score":72059.52852754263},{"content":" @Override\n\n public boolean isValid(int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":60,"score":72059.52852754263},{"content":" protected final String host;\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":61,"score":72059.52852754263},{"content":" @Override\n\n public void commit() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":62,"score":72059.52852754263},{"content":" protected final int port;\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":63,"score":72059.52852754263},{"content":" @Override\n\n public boolean isClosed() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":64,"score":72059.52852754263},{"content":" @Override\n\n public void close() throws SQLException {\n\n\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":65,"score":72059.52852754263},{"content":"class Module:\n\n def __init__(self, module_name:str, obj:typing.Any, type_stub: bool = False)->None:\n\n self.name = module_name\n\n self.functions: typing.Set[str] = set()\n\n self.submodules: typing.Dict[str,'Module'] = {}\n\n self.classes: typing.Dict[str, Class]={}\n\n self.attributes: typing.Set[str] = set()\n\n for name, data in inspect.getmembers(obj, ballista_noskip):\n\n is_private = name.startswith(\"_\")\n\n if is_private:\n\n continue\n\n\n\n data_is_function = is_function(data, type_stub=type_stub)\n\n data_is_class = is_class(data, type_stub=type_stub)\n\n if data_is_function and not data_is_class:\n\n self.add_function(name)\n\n elif data_is_class and not data_is_function:\n\n self.add_class(Class(name, data, type_stub=type_stub))\n\n elif inspect.ismodule(data):\n\n self.add_submodule(Module(name, data, type_stub=type_stub))\n\n else:\n\n self.add_attributes(name)\n\n #print(f\"TypeStub[{type_stub}: {self.attributes}\")\n\n\n\n\n\n def add_function(self, func_name: str)->None:\n\n if func_name in self.functions:\n\n raise Exception(f\"Module {self.name} already had a function named {func_name}\")\n\n self.functions.add(func_name)\n\n \n\n def add_submodule(self, module: 'Module')->None:\n\n if self.submodules.get(module.name) is not None:\n\n raise Exception(f\"Module {self.name} already had a submodule {module.name}\")\n\n self.submodules[module.name] = module\n\n\n\n def add_class(self, cls: Class)->None:\n\n if self.classes.get(cls.class_name) is not None:\n\n raise Exception(f\"Module {self.name} already had a class named {cls.class_name}\")\n\n self.classes[cls.class_name] = cls\n\n\n\n def add_attributes(self, attribute_name: str)->None:\n\n if attribute_name in self.attributes:\n\n raise Exception(f\"Module {self.name} already had a attribute/property named {attribute_name}\")\n\n self.attributes.add(attribute_name)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n def __str__(self, depth: int=0)->str:\n\n ntabs: typing.Callable[[int], str] = lambda n: \"\\t\"*n\n\n if len(self.classes) == 0:\n\n classes_str = \"{}classes: {{}}\\n\".format(ntabs(depth+1))\n\n else:\n\n classes_str = \"{}classes: {{\\n{} }}\\n\".format(ntabs(depth+1), \",\\n\".join(\"{}\".format(c.__str__(depth=depth+2)) for c in self.classes.values())) #type: ignore\n\n\n\n if len(self.attributes) == 0:\n\n attributes_str = \"{}attributes: []\\n\".format(ntabs(depth+1))\n\n else:\n\n attributes_str= \"{}attributes: [\\n{} ]\\n\".format(ntabs(depth+1), \",\\n\".join(\"{}{}\".format(ntabs(depth+2),a) for a in self.attributes) )\n\n if len(self.submodules) == 0:\n\n submodules_str = \"{}modules:[]\\n\".format(ntabs(depth+1))\n\n else:\n\n submodules_str =\"{}modules: [\\n{} ]\\n\".format(ntabs(depth+1), \",\\n\".join(\"{}\".format(m.__str__(depth=depth+2)) for m in self.submodules.values())) #type: ignore\n\n str_repr = f\"{ntabs(depth)}name:{self.name}\\n{classes_str}{attributes_str}{submodules_str}\"\n\n\n","file_path":"python/ci/check_stub_exhaustiveness.py","rank":66,"score":71393.5987562735},{"content":" def test_expr(self):\n\n positive_pressure: ballista.Expression = col(\"pressure\") > 100.0\n","file_path":"python/tests/test_simple.py","rank":67,"score":71330.83827240235},{"content":" @Override\n\n public String nativeSQL(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":68,"score":70774.37470086024},{"content":" @Override\n\n public void clearWarnings() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":69,"score":70774.37470086024},{"content":" @Override\n\n public FlightPreparedStatement prepareStatement(String s, String[] strings) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":70,"score":70774.37470086024},{"content":" @Override\n\n public void releaseSavepoint(Savepoint savepoint) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":71,"score":70774.37470086024},{"content":" @Override\n\n public void setReadOnly(boolean b) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":72,"score":70774.37470086024},{"content":" @Override\n\n public int getHoldability() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":73,"score":70774.37470086024},{"content":" @Override\n\n public String getSchema() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":74,"score":70774.37470086024},{"content":" @Override\n\n public SQLXML createSQLXML() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":75,"score":70774.37470086024},{"content":" @Override\n\n public CallableStatement prepareCall(String s, int i, int i1, int i2) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":76,"score":70774.37470086024},{"content":" @Override\n\n public SQLWarning getWarnings() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":77,"score":70774.37470086024},{"content":" @Override\n\n public void setCatalog(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":78,"score":70774.37470086024},{"content":" @Override\n\n public FlightStatement createStatement(int i, int i1, int i2) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":79,"score":70774.37470086024},{"content":" @Override\n\n public Blob createBlob() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":80,"score":70774.37470086024},{"content":" @Override\n\n public Savepoint setSavepoint(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":81,"score":70774.37470086024},{"content":" @Override\n\n public void setHoldability(int i) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":82,"score":70774.37470086024},{"content":" @Override\n\n public Array createArrayOf(String s, Object[] objects) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":83,"score":70774.37470086024},{"content":" @Override\n\n public void setSchema(String s) throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":84,"score":70774.37470086024},{"content":" @Override\n\n public String getCatalog() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":85,"score":70774.37470086024},{"content":" @Override\n\n public Clob createClob() throws SQLException {\n\n throw new SQLFeatureNotSupportedException();\n","file_path":"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java","rank":86,"score":70774.37470086024},{"content":"fn execute(\n\n stages: Vec<Arc<QueryStageExec>>,\n\n executors: Vec<ExecutorMeta>,\n\n) -> SendableExecutionPlan {\n\n Box::pin(async move {\n\n let mut partition_locations: HashMap<usize, Vec<PartitionLocation>> = HashMap::new();\n\n let mut result_partition_locations = vec![];\n\n for stage in &stages {\n\n debug!(\"execute() {}\", &format!(\"{:?}\", stage)[0..60]);\n\n let stage = remove_unresolved_shuffles(stage.as_ref(), &partition_locations)?;\n\n let stage = stage.as_any().downcast_ref::<QueryStageExec>().unwrap();\n\n result_partition_locations = execute_query_stage(\n\n &stage.job_id.clone(),\n\n stage.stage_id,\n\n stage.children()[0].clone(),\n\n executors.clone(),\n\n )\n\n .await?;\n\n partition_locations.insert(stage.stage_id, result_partition_locations.clone());\n\n }\n\n\n\n let shuffle_reader: Arc<dyn ExecutionPlan> = Arc::new(ShuffleReaderExec::try_new(\n\n result_partition_locations,\n\n stages.last().unwrap().schema(),\n\n )?);\n\n Ok(shuffle_reader)\n\n })\n\n}\n\n\n","file_path":"rust/lib/src/scheduler/planner.rs","rank":87,"score":69970.39385388917},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//! Ballista Prelude (common imports)\n\n\n\npub use crate::{\n\n client::BallistaClient,\n\n context::BallistaContext,\n\n error::{BallistaError, Result},\n\n};\n\n\n\npub use futures::StreamExt;\n","file_path":"rust/lib/src/prelude.rs","rank":90,"score":47.57668948305457},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//! This crate contains code generated from the Ballista Protocol Buffer Definition as well\n\n//! as convenience code for interacting with the generated code.\n\n\n\nuse std::{convert::TryInto, io::Cursor};\n\n\n\nuse crate::{error::BallistaError, serde::scheduler::Action as BallistaAction};\n","file_path":"rust/lib/src/serde/mod.rs","rank":91,"score":46.77850162172378},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//! Ballista Distributed Compute\n\n#![allow(unused_imports)]\n\npub const BALLISTA_VERSION: &str = env!(\"CARGO_PKG_VERSION\");\n\n\n","file_path":"rust/lib/src/lib.rs","rank":92,"score":44.30913591322717},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse std::convert::TryInto;\n\n\n\nuse crate::error::BallistaError;\n\nuse crate::scheduler::planner::PartitionLocation;\n\nuse crate::serde::protobuf;\n\nuse crate::serde::protobuf::action::ActionType;\n","file_path":"rust/lib/src/serde/scheduler/to_proto.rs","rank":93,"score":42.94755273988739},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//! Support for distributed schedulers, such as Kubernetes\n\n\n\npub mod execution_plans;\n\npub mod planner;\n\npub mod state;\n\n\n","file_path":"rust/lib/src/scheduler/mod.rs","rank":94,"score":42.48549259827602},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//! Distributed query execution\n\n//!\n\n//! This code is EXPERIMENTAL and still under development\n\n\n\nuse std::pin::Pin;\n\nuse std::sync::Arc;\n","file_path":"rust/lib/src/scheduler/planner.rs","rank":95,"score":42.21272540902669},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\nuse std::{collections::HashMap, convert::TryInto};\n\n\n\nuse crate::error::BallistaError;\n\nuse crate::scheduler::planner::PartitionLocation;\n\nuse crate::serde::protobuf;\n\nuse crate::serde::protobuf::action::ActionType;\n","file_path":"rust/lib/src/serde/scheduler/from_proto.rs","rank":96,"score":42.187730933601166},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\npub mod from_proto;\n\npub mod to_proto;\n\n\n\n#[cfg(test)]\n\n\n\nmod roundtrip_tests {\n","file_path":"rust/lib/src/serde/logical_plan/mod.rs","rank":97,"score":42.15851664056607},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//! Ballista error types\n\n\n\nuse std::{\n\n error::Error,\n\n fmt::{Display, Formatter},\n\n io, result,\n","file_path":"rust/lib/src/error.rs","rank":98,"score":42.027413757396765},{"content":"// Copyright 2020 Andy Grove\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n","file_path":"rust/lib/build.rs","rank":99,"score":41.819243889294995}],"string":"[\n {\n \"content\": \"#[pyfunction]\\n\\npub fn count(value: BPyExpr) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::count(value.expr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 0,\n \"score\": 210292.79264307546\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn min(value: BPyExpr) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::min(value.expr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 1,\n \"score\": 210292.7926430755\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn avg(value: BPyExpr) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::avg(value.expr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 2,\n \"score\": 210292.79264307546\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn sum(value: BPyExpr) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::sum(value.expr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 3,\n \"score\": 210292.7926430755\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn max(value: BPyExpr) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::max(value.expr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 4,\n \"score\": 210292.7926430755\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn count_distinct(expr: BPyExpr) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::count_distinct(expr.expr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 7,\n \"score\": 194675.7719643329\n },\n {\n \"content\": \"#[pyfunction(expr = \\\"*\\\")]\\n\\npub fn concat(expr: &PyTuple) -> PyResult<BPyExpr> {\\n\\n let expressions: Vec<Expr> = util::transform_tuple_to_uniform_type(expr, |e: BPyExpr| e.expr)?;\\n\\n Ok(BPyExpr {\\n\\n expr: logical_plan::concat(expressions),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 8,\n \"score\": 172475.52111632918\n },\n {\n \"content\": \"pub fn format_expr(expr: &dyn PhysicalExpr) -> String {\\n\\n if let Some(e) = expr.as_any().downcast_ref::<Column>() {\\n\\n e.name().to_string()\\n\\n } else if let Some(e) = expr.as_any().downcast_ref::<Literal>() {\\n\\n e.to_string()\\n\\n } else if let Some(e) = expr.as_any().downcast_ref::<BinaryExpr>() {\\n\\n format!(\\\"{} {} {}\\\", e.left(), e.op(), e.right())\\n\\n } else {\\n\\n format!(\\\"{}\\\", expr)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/utils.rs\",\n \"rank\": 9,\n \"score\": 166327.74964252257\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn col(name: &str) -> BPyExpr {\\n\\n BPyExpr {\\n\\n expr: logical_plan::col(name),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 10,\n \"score\": 159057.54567988866\n },\n {\n \"content\": \"pub fn format_agg_expr(expr: &dyn AggregateExpr) -> Result<String> {\\n\\n Ok(format!(\\n\\n \\\"{} {:?}\\\",\\n\\n expr.field()?.name(),\\n\\n expr.expressions()\\n\\n .iter()\\n\\n .map(|e| format_expr(e.as_ref()))\\n\\n .collect::<Vec<String>>()\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/utils.rs\",\n \"rank\": 11,\n \"score\": 157714.52200473487\n },\n {\n \"content\": \"pub fn init(module: &PyModule) -> PyResult<()> {\\n\\n module.add_function(wrap_pyfunction!(col, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(lit, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(sum, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(avg, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(min, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(max, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(count, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(count_distinct, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(concat, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(when, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(case, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(array, module)?)?;\\n\\n\\n\\n //All macro generated scalar functions\\n\\n module.add_function(wrap_pyfunction!(sqrt, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(sin, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(cos, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(tan, module)?)?;\\n\\n module.add_function(wrap_pyfunction!(asin, module)?)?;\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 12,\n \"score\": 154525.74426696653\n },\n {\n \"content\": \"#[pyfunction(module = \\\"ballista\\\")]\\n\\npub fn lit(literal: &PyAny) -> PyResult<BPyExpr> {\\n\\n let literal_value = literal.extract::<Scalar>()?;\\n\\n Ok(BPyExpr {\\n\\n expr: Expr::Literal(literal_value.scalar),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 13,\n \"score\": 148643.1686469689\n },\n {\n \"content\": \"pub fn ballista_error(message: &str) -> BallistaError {\\n\\n BallistaError::General(message.to_owned())\\n\\n}\\n\\n\\n\\nimpl From<String> for BallistaError {\\n\\n fn from(e: String) -> Self {\\n\\n BallistaError::General(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ArrowError> for BallistaError {\\n\\n fn from(e: ArrowError) -> Self {\\n\\n BallistaError::ArrowError(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<parser::ParserError> for BallistaError {\\n\\n fn from(e: parser::ParserError) -> Self {\\n\\n BallistaError::SqlError(e)\\n\\n }\\n\",\n \"file_path\": \"rust/lib/src/error.rs\",\n \"rank\": 14,\n \"score\": 147914.23310843625\n },\n {\n \"content\": \"#[pyfunction(args = \\\"*\\\")]\\n\\npub fn array(args: &PyTuple) -> PyResult<BPyExpr> {\\n\\n let args: Vec<Expr> = util::transform_tuple_to_uniform_type(args, |e: BPyExpr| e.expr)?;\\n\\n Ok(BPyExpr {\\n\\n expr: logical_plan::array(args),\\n\\n })\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! unary_scalar_expr_pyfunction {\\n\\n ($FUNC:ident) => {\\n\\n #[pyfunction]\\n\\n pub fn $FUNC(e: BPyExpr) -> BPyExpr {\\n\\n use datafusion::logical_plan;\\n\\n BPyExpr {\\n\\n expr: logical_plan::$FUNC(e.expr),\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 15,\n \"score\": 146055.55337642715\n },\n {\n \"content\": \"pub fn init(m: &PyModule) -> PyResult<()> {\\n\\n m.add_function(pyo3::wrap_pyfunction!(Date, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Decimal, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Duration, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Dictionary, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(FixedSizeBinary, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(FixedSizeList, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Interval, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(LargeList, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(List, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Struct, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Time, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Timestamp, m)?)?;\\n\\n m.add_function(pyo3::wrap_pyfunction!(Union, m)?)?;\\n\\n\\n\\n m.add_class::<BPyDataType>()?;\\n\\n m.add_class::<BPyTimeUnit>()?;\\n\\n m.add_class::<BPyIntervalUnit>()?;\\n\\n\\n\\n m.add(\\n\",\n \"file_path\": \"python/src/datatypes.rs\",\n \"rank\": 16,\n \"score\": 145968.975908459\n },\n {\n \"content\": \"pub fn wrap_df(df: ballista::context::BallistaDataFrame) -> BPyDataFrame {\\n\\n BPyDataFrame { df }\\n\\n}\\n\\n\\n\\n#[pymethods]\\n\\nimpl BPyBallistaContext {\\n\\n #[new]\\n\\n #[args(host = \\\"\\\\\\\"localhost\\\\\\\"\\\", port = \\\"50051\\\", kwds = \\\"**\\\")]\\n\\n pub fn new(host: &str, port: u16, kwds: Option<&pyo3::types::PyDict>) -> PyResult<Self> {\\n\\n let settings = match kwds {\\n\\n Some(kwargs) => kwargs\\n\\n .iter()\\n\\n .map(|(py_key_obj, py_val_obj)| {\\n\\n let py_key = py_key_obj.str().map_err(|err| {\\n\\n pyo3::exceptions::PyTypeError::new_err(format!(\\n\\n \\\"kwargs keys must be convertible to a string using __str__: {}\\\",\\n\\n err.to_string()\\n\\n ))\\n\\n })?;\\n\\n let py_val = py_val_obj.str().map_err(|err| {\\n\",\n \"file_path\": \"python/src/context.rs\",\n \"rank\": 17,\n \"score\": 143607.47644401365\n },\n {\n \"content\": \"#[pymodule]\\n\\nfn ballista(_py: Python, m: &PyModule) -> PyResult<()> {\\n\\n m.add_class::<context::BPyBallistaContext>()?;\\n\\n m.add_class::<expression::BPyExpr>()?;\\n\\n m.add_class::<dataframe::BPyDataFrame>()?;\\n\\n m.add_class::<expression::CaseBuilder>()?;\\n\\n m.add_class::<schema::BPySchema>()?;\\n\\n m.add_class::<field::BPyField>()?;\\n\\n m.add_class::<partition::BPyPartitioning>()?;\\n\\n m.add_class::<dfschema::BPyDFSchema>()?;\\n\\n\\n\\n crate::functions::init(m)?;\\n\\n datatypes::init(m)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"python/src/lib.rs\",\n \"rank\": 18,\n \"score\": 136989.47893222852\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn case(case: &PyAny) -> PyResult<expression::CaseBuilder> {\\n\\n let case_expr = expression::any_to_expression(case)?;\\n\\n Ok(expression::CaseBuilder::case(case_expr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 19,\n \"score\": 131478.42607338773\n },\n {\n \"content\": \"#[pyfunction]\\n\\npub fn when(when: &PyAny, then: &PyAny) -> PyResult<expression::CaseBuilder> {\\n\\n let mut builder = expression::CaseBuilder::new(None);\\n\\n //when method only fails when CaseBuilder has already built the expression so this is safe to unwrap\\n\\n let when_expr = expression::any_to_expression(when)?;\\n\\n let then_expr = expression::any_to_expression(then)?;\\n\\n builder.when_impl(when_expr, then_expr).unwrap();\\n\\n Ok(builder)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/functions.rs\",\n \"rank\": 20,\n \"score\": 130150.0796322027\n },\n {\n \"content\": \"pub fn print_version() {\\n\\n println!(\\\"Ballista version: {}\\\", BALLISTA_VERSION)\\n\\n}\\n\\n\\n\\npub mod client;\\n\\npub mod columnar_batch;\\n\\npub mod context;\\n\\npub mod error;\\n\\npub mod executor;\\n\\npub mod memory_stream;\\n\\npub mod prelude;\\n\\npub mod scheduler;\\n\\npub mod utils;\\n\\n\\n\\n#[cfg(test)]\\n\\npub mod test_utils;\\n\\n\\n\\n#[macro_use]\\n\\n\\n\\npub mod serde;\\n\",\n \"file_path\": \"rust/lib/src/lib.rs\",\n \"rank\": 21,\n \"score\": 128350.17354828728\n },\n {\n \"content\": \"fn parse_required_expr(p: &Option<Box<protobuf::LogicalExprNode>>) -> Result<Expr, BallistaError> {\\n\\n match p {\\n\\n Some(expr) => expr.as_ref().try_into(),\\n\\n None => Err(proto_error(\\\"Missing required expression\\\")),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/serde/logical_plan/from_proto.rs\",\n \"rank\": 22,\n \"score\": 126397.3651367623\n },\n {\n \"content\": \"struct BallistaError(ballista::error::BallistaError);\\n\\n\\n\\nimpl From<ballista::error::BallistaError> for BallistaError {\\n\\n fn from(err: ballista::error::BallistaError) -> Self {\\n\\n BallistaError(err)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<BallistaError> for PyErr {\\n\\n fn from(err: BallistaError) -> PyErr {\\n\\n exceptions::PyException::new_err(err.0.to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::error::Error for BallistaError {}\\n\\nimpl std::fmt::Display for BallistaError {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n <ballista::error::BallistaError as std::fmt::Display>::fmt(&self.0, f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::fmt::Debug for BallistaError {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n <ballista::error::BallistaError as std::fmt::Debug>::fmt(&self.0, f)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/error.rs\",\n \"rank\": 23,\n \"score\": 125298.94820484435\n },\n {\n \"content\": \"pub fn remove_unresolved_shuffles(\\n\\n stage: &dyn ExecutionPlan,\\n\\n partition_locations: &HashMap<usize, Vec<PartitionLocation>>,\\n\\n) -> Result<Arc<dyn ExecutionPlan>> {\\n\\n let mut new_children: Vec<Arc<dyn ExecutionPlan>> = vec![];\\n\\n for child in stage.children() {\\n\\n if let Some(unresolved_shuffle) = child.as_any().downcast_ref::<UnresolvedShuffleExec>() {\\n\\n let mut relevant_locations = vec![];\\n\\n for id in &unresolved_shuffle.query_stage_ids {\\n\\n relevant_locations.append(\\n\\n &mut partition_locations\\n\\n .get(id)\\n\\n .ok_or_else(|| {\\n\\n BallistaError::General(\\n\\n \\\"Missing partition location. Could not remove unresolved shuffles\\\"\\n\\n .to_owned(),\\n\\n )\\n\\n })?\\n\\n .clone(),\\n\\n );\\n\",\n \"file_path\": \"rust/lib/src/scheduler/planner.rs\",\n \"rank\": 24,\n \"score\": 124001.97000289432\n },\n {\n \"content\": \"struct MergedRecordBatchStream {\\n\\n schema: SchemaRef,\\n\\n select_all: Pin<Box<SelectAll<SendableRecordBatchStream>>>,\\n\\n}\\n\\n\\n\\nimpl Stream for MergedRecordBatchStream {\\n\\n type Item = ArrowResult<RecordBatch>;\\n\\n\\n\\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {\\n\\n self.select_all.as_mut().poll_next(cx)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl RecordBatchStream for MergedRecordBatchStream {\\n\\n fn schema(&self) -> SchemaRef {\\n\\n self.schema.clone()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/lib/src/executor/collect.rs\",\n \"rank\": 25,\n \"score\": 105842.38107999698\n },\n {\n \"content\": \"/// Convert a single RecordBatch into an iterator of FlightData (containing\\n\\n/// dictionaries and batches)\\n\\nfn create_flight_iter(\\n\\n batch: &RecordBatch,\\n\\n options: &IpcWriteOptions,\\n\\n) -> Box<dyn Iterator<Item = Result<FlightData, Status>>> {\\n\\n let (flight_dictionaries, flight_batch) =\\n\\n arrow_flight::utils::flight_data_from_arrow_batch(batch, &options);\\n\\n Box::new(\\n\\n flight_dictionaries\\n\\n .into_iter()\\n\\n .chain(std::iter::once(flight_batch))\\n\\n .map(Ok),\\n\\n )\\n\\n}\\n\\n\\n\\nasync fn stream_flight_data<T>(reader: FileReader<T>, tx: FlightDataSender) -> Result<(), Status>\\n\\nwhere\\n\\n T: Read + Seek,\\n\\n{\\n\\n let options = arrow::ipc::writer::IpcWriteOptions::default();\\n\\n let schema_flight_data =\\n\",\n \"file_path\": \"rust/lib/src/executor/flight_service.rs\",\n \"rank\": 26,\n \"score\": 104858.68086057172\n },\n {\n \"content\": \"fn compile_expr(\\n\\n expr: &protobuf::LogicalExprNode,\\n\\n schema: &Schema,\\n\\n) -> Result<Arc<dyn PhysicalExpr>, BallistaError> {\\n\\n let df_planner = DefaultPhysicalPlanner::default();\\n\\n let state = ExecutionContextState {\\n\\n datasources: HashMap::new(),\\n\\n scalar_functions: HashMap::new(),\\n\\n var_provider: HashMap::new(),\\n\\n aggregate_functions: HashMap::new(),\\n\\n config: ExecutionConfig::new(),\\n\\n };\\n\\n let expr: Expr = expr.try_into()?;\\n\\n df_planner\\n\\n .create_physical_expr(&expr, schema, &state)\\n\\n .map_err(|e| BallistaError::General(format!(\\\"{:?}\\\", e)))\\n\\n}\\n\",\n \"file_path\": \"rust/lib/src/serde/physical_plan/from_proto.rs\",\n \"rank\": 27,\n \"score\": 104770.62150018888\n },\n {\n \"content\": \"fn parse_optional_expr(\\n\\n p: &Option<Box<protobuf::LogicalExprNode>>,\\n\\n) -> Result<Option<Expr>, BallistaError> {\\n\\n match p {\\n\\n Some(expr) => expr.as_ref().try_into().map(Some),\\n\\n None => Ok(None),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/lib/src/serde/logical_plan/from_proto.rs\",\n \"rank\": 28,\n \"score\": 102766.047347216\n },\n {\n \"content\": \"fn try_parse_when_then_expr(\\n\\n when_expr: &Arc<dyn PhysicalExpr>,\\n\\n then_expr: &Arc<dyn PhysicalExpr>,\\n\\n) -> Result<protobuf::WhenThen, BallistaError> {\\n\\n Ok(protobuf::WhenThen {\\n\\n when_expr: Some(when_expr.clone().try_into()?),\\n\\n then_expr: Some(then_expr.clone().try_into()?),\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"rust/lib/src/serde/physical_plan/to_proto.rs\",\n \"rank\": 29,\n \"score\": 102766.047347216\n },\n {\n \"content\": \"pub fn any_to_datatype(any: &PyAny) -> PyResult<DataType> {\\n\\n if let Ok(datatype) = any.extract::<BPyDataType>() {\\n\\n Ok(datatype.datatype)\\n\\n } else if let Ok(datatype_str) = any.extract::<&str>() {\\n\\n Ok(match datatype_str {\\n\\n \\\"int8\\\" | \\\"i8\\\" => DataType::Int8,\\n\\n \\\"int16\\\" | \\\"i16\\\" => DataType::Int16,\\n\\n \\\"int32\\\" | \\\"int\\\" | \\\"i32\\\" => DataType::Int32,\\n\\n \\\"int64\\\" | \\\"i64\\\" => DataType::Int64,\\n\\n \\\"uint8\\\" | \\\"u8\\\" => DataType::UInt8,\\n\\n \\\"uint16\\\" | \\\"u16\\\" => DataType::UInt16,\\n\\n \\\"uint32\\\" | \\\"uint\\\" | \\\"u32\\\" => DataType::UInt32,\\n\\n \\\"uint64\\\" | \\\"u64\\\" => DataType::UInt64,\\n\\n \\\"str\\\" | \\\"utf8\\\" => DataType::Utf8,\\n\\n \\\"float32\\\" | \\\"f32\\\" => DataType::Float32,\\n\\n \\\"float\\\" | \\\"f64\\\" => DataType::Float64,\\n\\n \\\"bool\\\" => DataType::Boolean,\\n\\n \\\"date32\\\" => DataType::Date32,\\n\\n \\\"date64\\\" => DataType::Date64,\\n\\n _ => {\\n\",\n \"file_path\": \"python/src/datatypes.rs\",\n \"rank\": 30,\n \"score\": 102530.484368543\n },\n {\n \"content\": \"pub fn get_tpch_schema(table: &str) -> Schema {\\n\\n // note that the schema intentionally uses signed integers so that any generated Parquet\\n\\n // files can also be used to benchmark tools that only support signed integers, such as\\n\\n // Apache Spark\\n\\n\\n\\n match table {\\n\\n \\\"part\\\" => Schema::new(vec![\\n\\n Field::new(\\\"p_partkey\\\", DataType::Int32, false),\\n\\n Field::new(\\\"p_name\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_mfgr\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_brand\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_type\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_size\\\", DataType::Int32, false),\\n\\n Field::new(\\\"p_container\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_retailprice\\\", DataType::Float64, false),\\n\\n Field::new(\\\"p_comment\\\", DataType::Utf8, false),\\n\\n ]),\\n\\n\\n\\n \\\"supplier\\\" => Schema::new(vec![\\n\\n Field::new(\\\"s_suppkey\\\", DataType::Int32, false),\\n\",\n \"file_path\": \"rust/lib/src/test_utils.rs\",\n \"rank\": 31,\n \"score\": 102052.20630442858\n },\n {\n \"content\": \"pub fn transform_tuple_to_uniform_type<'a, T: FromPyObject<'a>, U, F: Fn(T) -> U>(\\n\\n tuple: &'a PyTuple,\\n\\n transform: F,\\n\\n) -> PyResult<Vec<U>> {\\n\\n tuple\\n\\n .iter()\\n\\n .map(|tuple_item| Ok(transform(tuple_item.extract::<T>()?)))\\n\\n .collect::<Result<Vec<U>, PyErr>>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/util.rs\",\n \"rank\": 32,\n \"score\": 101752.54218540441\n },\n {\n \"content\": \" @Override\\n\\n public Struct createStruct(String s, Object[] objects) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 33,\n \"score\": 101482.06380207253\n },\n {\n \"content\": \"//Does not typecheck lists\\n\\nfn typechecked_scalar_value_conversion(\\n\\n tested_type: &protobuf::scalar_value::Value,\\n\\n required_type: protobuf::PrimitiveScalarType,\\n\\n) -> Result<datafusion::scalar::ScalarValue, BallistaError> {\\n\\n use protobuf::scalar_value::Value;\\n\\n use protobuf::PrimitiveScalarType;\\n\\n Ok(match (tested_type, &required_type) {\\n\\n (Value::BoolValue(v), PrimitiveScalarType::Bool) => ScalarValue::Boolean(Some(*v)),\\n\\n (Value::Int8Value(v), PrimitiveScalarType::Int8) => ScalarValue::Int8(Some(*v as i8)),\\n\\n (Value::Int16Value(v), PrimitiveScalarType::Int16) => ScalarValue::Int16(Some(*v as i16)),\\n\\n (Value::Int32Value(v), PrimitiveScalarType::Int32) => ScalarValue::Int32(Some(*v)),\\n\\n (Value::Int64Value(v), PrimitiveScalarType::Int64) => ScalarValue::Int64(Some(*v)),\\n\\n (Value::Uint8Value(v), PrimitiveScalarType::Uint8) => ScalarValue::UInt8(Some(*v as u8)),\\n\\n (Value::Uint16Value(v), PrimitiveScalarType::Uint16) => {\\n\\n ScalarValue::UInt16(Some(*v as u16))\\n\\n }\\n\\n (Value::Uint32Value(v), PrimitiveScalarType::Uint32) => ScalarValue::UInt32(Some(*v)),\\n\\n (Value::Uint64Value(v), PrimitiveScalarType::Uint64) => ScalarValue::UInt64(Some(*v)),\\n\\n (Value::Float32Value(v), PrimitiveScalarType::Float32) => ScalarValue::Float32(Some(*v)),\\n\\n (Value::Float64Value(v), PrimitiveScalarType::Float64) => ScalarValue::Float64(Some(*v)),\\n\",\n \"file_path\": \"rust/lib/src/serde/logical_plan/from_proto.rs\",\n \"rank\": 34,\n \"score\": 100908.21043080458\n },\n {\n \"content\": \"pub fn any_to_bpyfield(any: &PyAny) -> PyResult<BPyField> {\\n\\n let field: BPyField = if let Ok(native_field) = any.extract::<BPyField>() {\\n\\n native_field\\n\\n } else if let Ok(py_dict) = any.extract::<&PyDict>() {\\n\\n //Begin with extracting all required keys from dictionary\\n\\n let name = py_dict\\n\\n .get_item(\\\"name\\\")\\n\\n .ok_or_else(|| util::missing_key(\\\"name\\\", \\\"field dictionary\\\"))?;\\n\\n let datatype = py_dict\\n\\n .get_item(\\\"datatype\\\")\\n\\n .ok_or_else(|| util::missing_key(\\\"datatype\\\", \\\"field dictionary\\\"))?;\\n\\n //If nullable is not present then set nullable to false\\n\\n let nullable = match py_dict.get_item(\\\"nullable\\\") {\\n\\n Some(pyobj) => pyobj.extract::<bool>()?,\\n\\n None => false,\\n\\n };\\n\\n\\n\\n let dict_id = match py_dict.get_item(\\\"dict_id\\\") {\\n\\n Some(pyobj) => Some(pyobj.extract::<i64>()?),\\n\\n None => None,\\n\",\n \"file_path\": \"python/src/field.rs\",\n \"rank\": 35,\n \"score\": 100631.42883220284\n },\n {\n \"content\": \"#[pyfunction(members = \\\"*\\\")]\\n\\nfn Struct(members: &PyTuple) -> PyResult<BPyDataType> {\\n\\n if members.is_empty() {\\n\\n return Err(PyException::new_err(\\n\\n \\\"To construct a Struct at least a single Field must be provided\\\",\\n\\n ));\\n\\n }\\n\\n let struct_members = members\\n\\n .iter()\\n\\n .map(|any| Ok(any.extract::<BPyField>()?.arrow_field))\\n\\n .collect::<PyResult<Vec<Field>>>()?;\\n\\n Ok(BPyDataType {\\n\\n datatype: DataType::Struct(struct_members),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/datatypes.rs\",\n \"rank\": 36,\n \"score\": 100601.73645680587\n },\n {\n \"content\": \"pub fn wrap_kwarg_keytype_error(err: PyErr) -> PyErr {\\n\\n pyo3::exceptions::PyTypeError::new_err(format!(\\n\\n \\\"kwargs values must be convertible to a string using __str__: {}\\\",\\n\\n err.to_string()\\n\\n ))\\n\\n}\\n\",\n \"file_path\": \"python/src/error.rs\",\n \"rank\": 37,\n \"score\": 100336.56450382603\n },\n {\n \"content\": \" @Override\\n\\n public Connection connect(String url, Properties properties) throws SQLException {\\n\\n logger.info(\\\"connect() url={}\\\", url);\\n\\n //TODO this needs much more work to parse full URLs but this is enough to get end to end tests running\\n\\n String c = url.substring(PREFIX.length());\\n\\n int i = c.indexOf(':');\\n\\n if (i == -1) {\\n\\n return new FlightConnection(c, 50051);\\n\\n } else {\\n\\n return new FlightConnection(c.substring(0,i), Integer.parseInt(c.substring(i + 1)));\\n\\n }\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/Driver.java\",\n \"rank\": 38,\n \"score\": 99874.53156904224\n },\n {\n \"content\": \"fn create_proto_scalar<I, T: FnOnce(&I) -> protobuf::scalar_value::Value>(\\n\\n v: &Option<I>,\\n\\n null_arrow_type: protobuf::PrimitiveScalarType,\\n\\n constructor: T,\\n\\n) -> protobuf::ScalarValue {\\n\\n protobuf::ScalarValue {\\n\\n value: Some(v.as_ref().map(constructor).unwrap_or(\\n\\n protobuf::scalar_value::Value::NullValue(null_arrow_type as i32),\\n\\n )),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryInto<protobuf::LogicalExprNode> for &Expr {\\n\\n type Error = BallistaError;\\n\\n\\n\\n fn try_into(self) -> Result<protobuf::LogicalExprNode, Self::Error> {\\n\\n use datafusion::scalar::ScalarValue;\\n\\n use protobuf::scalar_value::Value;\\n\\n match self {\\n\\n Expr::Column(name) => {\\n\",\n \"file_path\": \"rust/lib/src/serde/logical_plan/to_proto.rs\",\n \"rank\": 39,\n \"score\": 99740.03424731476\n },\n {\n \"content\": \"pub fn object_class_name(ob: &PyAny) -> PyResult<String> {\\n\\n let qual_name = ob\\n\\n .getattr(\\\"__class__\\\")?\\n\\n .getattr(\\\"__qualname__\\\")?\\n\\n .extract::<&str>()?;\\n\\n let module_name = ob\\n\\n .getattr(\\\"__class__\\\")?\\n\\n .getattr(\\\"__module__\\\")?\\n\\n .extract::<&str>()?;\\n\\n Ok(format!(\\\"{}.{}\\\", module_name, qual_name))\\n\\n}\\n\",\n \"file_path\": \"python/src/util.rs\",\n \"rank\": 40,\n \"score\": 98827.57183097636\n },\n {\n \"content\": \"pub fn to_py(batches: &[RecordBatch]) -> PyResult<PyObject> {\\n\\n let gil = pyo3::Python::acquire_gil();\\n\\n let py = gil.python();\\n\\n let pyarrow = PyModule::import(py, \\\"pyarrow\\\")?;\\n\\n let builtins = PyModule::import(py, \\\"builtins\\\")?;\\n\\n\\n\\n let mut py_batches = vec![];\\n\\n for batch in batches {\\n\\n py_batches.push(to_py_batch(batch, py, pyarrow)?);\\n\\n }\\n\\n let result = builtins.call1(\\\"list\\\", (py_batches,))?;\\n\\n Ok(PyObject::from(result))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/dataframe.rs\",\n \"rank\": 41,\n \"score\": 98827.57183097636\n },\n {\n \"content\": \"pub fn datafusion_test_context(path: &str) -> Result<ExecutionContext> {\\n\\n let mut ctx = ExecutionContext::new();\\n\\n for table in TPCH_TABLES {\\n\\n let schema = get_tpch_schema(table);\\n\\n let options = CsvReadOptions::new()\\n\\n .schema(&schema)\\n\\n .delimiter(b'|')\\n\\n .has_header(false)\\n\\n .file_extension(\\\".tbl\\\");\\n\\n let dir = format!(\\\"{}/{}\\\", path, table);\\n\\n ctx.register_csv(table, &dir, options)?;\\n\\n }\\n\\n Ok(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/test_utils.rs\",\n \"rank\": 42,\n \"score\": 95478.18681457799\n },\n {\n \"content\": \"pub fn missing_key(key_name: &str, from_name: &str) -> PyErr {\\n\\n PyException::new_err(format!(\\n\\n \\\"The required key {} was not present in {}.\\\",\\n\\n key_name, from_name\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/util.rs\",\n \"rank\": 43,\n \"score\": 94479.57535816792\n },\n {\n \"content\": \"fn from_ballista_err(e: &crate::error::BallistaError) -> Status {\\n\\n Status::internal(format!(\\\"Ballista Error: {:?}\\\", e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/executor/flight_service.rs\",\n \"rank\": 44,\n \"score\": 90969.78631110275\n },\n {\n \"content\": \"pub fn produce_diagram(filename: &str, stages: &[Arc<QueryStageExec>]) -> Result<()> {\\n\\n let write_file = File::create(filename)?;\\n\\n let mut w = BufWriter::new(&write_file);\\n\\n writeln!(w, \\\"digraph G {{\\\")?;\\n\\n\\n\\n // draw stages and entities\\n\\n for stage in stages {\\n\\n writeln!(w, \\\"\\\\tsubgraph cluster{} {{\\\", stage.stage_id)?;\\n\\n writeln!(w, \\\"\\\\t\\\\tlabel = \\\\\\\"Stage {}\\\\\\\";\\\", stage.stage_id)?;\\n\\n let mut id = AtomicUsize::new(0);\\n\\n build_exec_plan_diagram(&mut w, stage.child.as_ref(), stage.stage_id, &mut id, true)?;\\n\\n writeln!(w, \\\"\\\\t}}\\\")?;\\n\\n }\\n\\n\\n\\n // draw relationships\\n\\n for stage in stages {\\n\\n let mut id = AtomicUsize::new(0);\\n\\n build_exec_plan_diagram(&mut w, stage.child.as_ref(), stage.stage_id, &mut id, false)?;\\n\\n }\\n\\n\\n\\n write!(w, \\\"}}\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/utils.rs\",\n \"rank\": 45,\n \"score\": 89098.731249609\n },\n {\n \"content\": \"pub fn to_py_array(array: &ArrayRef, py: Python) -> PyResult<PyObject> {\\n\\n let (array_pointer, schema_pointer) = array.to_raw().map_err(crate::util::wrap_err)?;\\n\\n\\n\\n let pa = py.import(\\\"pyarrow\\\")?;\\n\\n\\n\\n let array = pa.getattr(\\\"Array\\\")?.call_method1(\\n\\n \\\"_import_from_c\\\",\\n\\n (\\n\\n array_pointer as Py_uintptr_t,\\n\\n schema_pointer as Py_uintptr_t,\\n\\n ),\\n\\n )?;\\n\\n Ok(array.to_object(py))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/dataframe.rs\",\n \"rank\": 46,\n \"score\": 89098.731249609\n },\n {\n \"content\": \"pub fn wrap_err<E: std::error::Error>(err: E) -> PyErr {\\n\\n PyException::new_err(err.to_string())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/util.rs\",\n \"rank\": 47,\n \"score\": 88806.52928329752\n },\n {\n \"content\": \"pub fn wrap_err<E: std::error::Error>(err: E) -> PyErr {\\n\\n PyException::new_err(err.to_string())\\n\\n}\\n\",\n \"file_path\": \"python/src/dataframe.rs\",\n \"rank\": 48,\n \"score\": 88806.52928329752\n },\n {\n \"content\": \"pub fn format_plan(plan: &dyn ExecutionPlan, indent: usize) -> Result<String> {\\n\\n let operator_str = if let Some(exec) = plan.as_any().downcast_ref::<HashAggregateExec>() {\\n\\n format!(\\n\\n \\\"HashAggregateExec: groupBy={:?}, aggrExpr={:?}\\\",\\n\\n exec.group_expr()\\n\\n .iter()\\n\\n .map(|e| format_expr(e.0.as_ref()))\\n\\n .collect::<Vec<String>>(),\\n\\n exec.aggr_expr()\\n\\n .iter()\\n\\n .map(|e| format_agg_expr(e.as_ref()))\\n\\n .collect::<Result<Vec<String>>>()?\\n\\n )\\n\\n } else if let Some(exec) = plan.as_any().downcast_ref::<HashJoinExec>() {\\n\\n format!(\\n\\n \\\"HashJoinExec: joinType={:?}, on={:?}\\\",\\n\\n exec.join_type(),\\n\\n exec.on()\\n\\n )\\n\\n } else if let Some(exec) = plan.as_any().downcast_ref::<ParquetExec>() {\\n\",\n \"file_path\": \"rust/lib/src/utils.rs\",\n \"rank\": 49,\n \"score\": 87248.95704311691\n },\n {\n \"content\": \"pub fn kwargs_to_string_map(kwargs: Option<&PyDict>) -> PyResult<HashMap<String, String>> {\\n\\n Ok(match kwargs {\\n\\n Some(kwargs) => kwargs\\n\\n .iter()\\n\\n .map(|(py_key_obj, py_val_obj)| {\\n\\n let py_key = py_key_obj.str().map_err(|err| {\\n\\n pyo3::exceptions::PyTypeError::new_err(format!(\\n\\n \\\"kwargs keys must be convertible to a string using str(): {}\\\",\\n\\n err.to_string()\\n\\n ))\\n\\n })?;\\n\\n let py_val = py_val_obj.str().map_err(|err| {\\n\\n pyo3::exceptions::PyTypeError::new_err(format!(\\n\\n \\\"kwargs values must be convertible to a string using str(): {}\\\",\\n\\n err.to_string()\\n\\n ))\\n\\n })?;\\n\\n Ok((py_key.to_str()?.to_owned(), py_val.to_str()?.to_owned()))\\n\\n })\\n\\n .collect::<Result<HashMap<String, String>, PyErr>>()?,\\n\\n None => HashMap::new(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/util.rs\",\n \"rank\": 50,\n \"score\": 84341.9665117463\n },\n {\n \"content\": \"pub fn tuple_to_uniform_type<'a, T: FromPyObject<'a>>(tuple: &'a PyTuple) -> PyResult<Vec<T>> {\\n\\n tuple\\n\\n .iter()\\n\\n .map(|tuple_item| tuple_item.extract::<T>())\\n\\n .collect::<Result<Vec<T>, PyErr>>()\\n\\n}\\n\\nuse pyo3::PyAny;\\n\",\n \"file_path\": \"python/src/util.rs\",\n \"rank\": 51,\n \"score\": 80189.67616011022\n },\n {\n \"content\": \"fn from_proto_binary_op(op: &str) -> Result<Operator, BallistaError> {\\n\\n match op {\\n\\n \\\"And\\\" => Ok(Operator::And),\\n\\n \\\"Or\\\" => Ok(Operator::Or),\\n\\n \\\"Eq\\\" => Ok(Operator::Eq),\\n\\n \\\"NotEq\\\" => Ok(Operator::NotEq),\\n\\n \\\"LtEq\\\" => Ok(Operator::LtEq),\\n\\n \\\"Lt\\\" => Ok(Operator::Lt),\\n\\n \\\"Gt\\\" => Ok(Operator::Gt),\\n\\n \\\"GtEq\\\" => Ok(Operator::GtEq),\\n\\n \\\"Plus\\\" => Ok(Operator::Plus),\\n\\n \\\"Minus\\\" => Ok(Operator::Minus),\\n\\n \\\"Multiply\\\" => Ok(Operator::Multiply),\\n\\n \\\"Divide\\\" => Ok(Operator::Divide),\\n\\n \\\"Like\\\" => Ok(Operator::Like),\\n\\n other => Err(proto_error(format!(\\n\\n \\\"Unsupported binary operator '{:?}'\\\",\\n\\n other\\n\\n ))),\\n\\n }\\n\",\n \"file_path\": \"rust/lib/src/serde/logical_plan/from_proto.rs\",\n \"rank\": 52,\n \"score\": 75545.42649527274\n },\n {\n \"content\": \"public class FlightConnection implements java.sql.Connection {\\n\\n\\n\\n protected final String host;\\n\\n protected final int port;\\n\\n\\n\\n public FlightConnection(String host, int port) {\\n\\n this.host = host;\\n\\n this.port = port;\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightStatement createStatement() throws SQLException {\\n\\n return new FlightStatement(this);\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightPreparedStatement prepareStatement(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public CallableStatement prepareCall(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public String nativeSQL(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public boolean getAutoCommit() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setAutoCommit(boolean b) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void commit() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void rollback() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void close() throws SQLException {\\n\\n\\n\\n }\\n\\n\\n\\n @Override\\n\\n public boolean isClosed() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public DatabaseMetaData getMetaData() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public boolean isReadOnly() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setReadOnly(boolean b) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public String getCatalog() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setCatalog(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public int getTransactionIsolation() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setTransactionIsolation(int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public SQLWarning getWarnings() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void clearWarnings() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightStatement createStatement(int i, int i1) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightPreparedStatement prepareStatement(String s, int i, int i1) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public CallableStatement prepareCall(String s, int i, int i1) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Map<String, Class<?>> getTypeMap() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setTypeMap(Map<String, Class<?>> map) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public int getHoldability() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setHoldability(int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Savepoint setSavepoint() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Savepoint setSavepoint(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void rollback(Savepoint savepoint) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void releaseSavepoint(Savepoint savepoint) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightStatement createStatement(int i, int i1, int i2) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightPreparedStatement prepareStatement(String s, int i, int i1, int i2) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public CallableStatement prepareCall(String s, int i, int i1, int i2) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightPreparedStatement prepareStatement(String s, int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightPreparedStatement prepareStatement(String s, int[] ints) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public FlightPreparedStatement prepareStatement(String s, String[] strings) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Clob createClob() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Blob createBlob() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public NClob createNClob() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public SQLXML createSQLXML() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public boolean isValid(int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setClientInfo(String s, String s1) throws SQLClientInfoException {\\n\\n throw new SQLClientInfoException();\\n\\n\\n\\n }\\n\\n\\n\\n @Override\\n\\n public String getClientInfo(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Properties getClientInfo() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setClientInfo(Properties properties) throws SQLClientInfoException {\\n\\n throw new SQLClientInfoException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Array createArrayOf(String s, Object[] objects) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public Struct createStruct(String s, Object[] objects) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public String getSchema() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setSchema(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void abort(Executor executor) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public void setNetworkTimeout(Executor executor, int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public int getNetworkTimeout() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public <T> T unwrap(Class<T> aClass) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\\n\\n\\n @Override\\n\\n public boolean isWrapperFor(Class<?> aClass) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\\n }\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 53,\n \"score\": 73398.84482712671\n },\n {\n \"content\": \"#[pyfunction]\\n\\nfn Dictionary(key_type: BPyDataType, value_type: BPyDataType) -> BPyDataType {\\n\\n BPyDataType {\\n\\n datatype: DataType::Dictionary(Box::new(key_type.datatype), Box::new(value_type.datatype)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"python/src/datatypes.rs\",\n \"rank\": 54,\n \"score\": 72795.76768157659\n },\n {\n \"content\": \" @Override\\n\\n public boolean isWrapperFor(Class<?> aClass) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 55,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public void rollback(Savepoint savepoint) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 56,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public void abort(Executor executor) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 57,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public <T> T unwrap(Class<T> aClass) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 58,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public boolean isReadOnly() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 59,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public boolean isValid(int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 60,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" protected final String host;\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 61,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public void commit() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 62,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" protected final int port;\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 63,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public boolean isClosed() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 64,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \" @Override\\n\\n public void close() throws SQLException {\\n\\n\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 65,\n \"score\": 72059.52852754263\n },\n {\n \"content\": \"class Module:\\n\\n def __init__(self, module_name:str, obj:typing.Any, type_stub: bool = False)->None:\\n\\n self.name = module_name\\n\\n self.functions: typing.Set[str] = set()\\n\\n self.submodules: typing.Dict[str,'Module'] = {}\\n\\n self.classes: typing.Dict[str, Class]={}\\n\\n self.attributes: typing.Set[str] = set()\\n\\n for name, data in inspect.getmembers(obj, ballista_noskip):\\n\\n is_private = name.startswith(\\\"_\\\")\\n\\n if is_private:\\n\\n continue\\n\\n\\n\\n data_is_function = is_function(data, type_stub=type_stub)\\n\\n data_is_class = is_class(data, type_stub=type_stub)\\n\\n if data_is_function and not data_is_class:\\n\\n self.add_function(name)\\n\\n elif data_is_class and not data_is_function:\\n\\n self.add_class(Class(name, data, type_stub=type_stub))\\n\\n elif inspect.ismodule(data):\\n\\n self.add_submodule(Module(name, data, type_stub=type_stub))\\n\\n else:\\n\\n self.add_attributes(name)\\n\\n #print(f\\\"TypeStub[{type_stub}: {self.attributes}\\\")\\n\\n\\n\\n\\n\\n def add_function(self, func_name: str)->None:\\n\\n if func_name in self.functions:\\n\\n raise Exception(f\\\"Module {self.name} already had a function named {func_name}\\\")\\n\\n self.functions.add(func_name)\\n\\n \\n\\n def add_submodule(self, module: 'Module')->None:\\n\\n if self.submodules.get(module.name) is not None:\\n\\n raise Exception(f\\\"Module {self.name} already had a submodule {module.name}\\\")\\n\\n self.submodules[module.name] = module\\n\\n\\n\\n def add_class(self, cls: Class)->None:\\n\\n if self.classes.get(cls.class_name) is not None:\\n\\n raise Exception(f\\\"Module {self.name} already had a class named {cls.class_name}\\\")\\n\\n self.classes[cls.class_name] = cls\\n\\n\\n\\n def add_attributes(self, attribute_name: str)->None:\\n\\n if attribute_name in self.attributes:\\n\\n raise Exception(f\\\"Module {self.name} already had a attribute/property named {attribute_name}\\\")\\n\\n self.attributes.add(attribute_name)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n \\n\\n def __str__(self, depth: int=0)->str:\\n\\n ntabs: typing.Callable[[int], str] = lambda n: \\\"\\\\t\\\"*n\\n\\n if len(self.classes) == 0:\\n\\n classes_str = \\\"{}classes: {{}}\\\\n\\\".format(ntabs(depth+1))\\n\\n else:\\n\\n classes_str = \\\"{}classes: {{\\\\n{} }}\\\\n\\\".format(ntabs(depth+1), \\\",\\\\n\\\".join(\\\"{}\\\".format(c.__str__(depth=depth+2)) for c in self.classes.values())) #type: ignore\\n\\n\\n\\n if len(self.attributes) == 0:\\n\\n attributes_str = \\\"{}attributes: []\\\\n\\\".format(ntabs(depth+1))\\n\\n else:\\n\\n attributes_str= \\\"{}attributes: [\\\\n{} ]\\\\n\\\".format(ntabs(depth+1), \\\",\\\\n\\\".join(\\\"{}{}\\\".format(ntabs(depth+2),a) for a in self.attributes) )\\n\\n if len(self.submodules) == 0:\\n\\n submodules_str = \\\"{}modules:[]\\\\n\\\".format(ntabs(depth+1))\\n\\n else:\\n\\n submodules_str =\\\"{}modules: [\\\\n{} ]\\\\n\\\".format(ntabs(depth+1), \\\",\\\\n\\\".join(\\\"{}\\\".format(m.__str__(depth=depth+2)) for m in self.submodules.values())) #type: ignore\\n\\n str_repr = f\\\"{ntabs(depth)}name:{self.name}\\\\n{classes_str}{attributes_str}{submodules_str}\\\"\\n\\n\\n\",\n \"file_path\": \"python/ci/check_stub_exhaustiveness.py\",\n \"rank\": 66,\n \"score\": 71393.5987562735\n },\n {\n \"content\": \" def test_expr(self):\\n\\n positive_pressure: ballista.Expression = col(\\\"pressure\\\") > 100.0\\n\",\n \"file_path\": \"python/tests/test_simple.py\",\n \"rank\": 67,\n \"score\": 71330.83827240235\n },\n {\n \"content\": \" @Override\\n\\n public String nativeSQL(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 68,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public void clearWarnings() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 69,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public FlightPreparedStatement prepareStatement(String s, String[] strings) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 70,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public void releaseSavepoint(Savepoint savepoint) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 71,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public void setReadOnly(boolean b) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 72,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public int getHoldability() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 73,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public String getSchema() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 74,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public SQLXML createSQLXML() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 75,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public CallableStatement prepareCall(String s, int i, int i1, int i2) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 76,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public SQLWarning getWarnings() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 77,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public void setCatalog(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 78,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public FlightStatement createStatement(int i, int i1, int i2) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 79,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public Blob createBlob() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 80,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public Savepoint setSavepoint(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 81,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public void setHoldability(int i) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 82,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public Array createArrayOf(String s, Object[] objects) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 83,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public void setSchema(String s) throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 84,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public String getCatalog() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 85,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \" @Override\\n\\n public Clob createClob() throws SQLException {\\n\\n throw new SQLFeatureNotSupportedException();\\n\",\n \"file_path\": \"jvm/jdbc/src/main/java/org/ballistacompute/jdbc/FlightConnection.java\",\n \"rank\": 86,\n \"score\": 70774.37470086024\n },\n {\n \"content\": \"fn execute(\\n\\n stages: Vec<Arc<QueryStageExec>>,\\n\\n executors: Vec<ExecutorMeta>,\\n\\n) -> SendableExecutionPlan {\\n\\n Box::pin(async move {\\n\\n let mut partition_locations: HashMap<usize, Vec<PartitionLocation>> = HashMap::new();\\n\\n let mut result_partition_locations = vec![];\\n\\n for stage in &stages {\\n\\n debug!(\\\"execute() {}\\\", &format!(\\\"{:?}\\\", stage)[0..60]);\\n\\n let stage = remove_unresolved_shuffles(stage.as_ref(), &partition_locations)?;\\n\\n let stage = stage.as_any().downcast_ref::<QueryStageExec>().unwrap();\\n\\n result_partition_locations = execute_query_stage(\\n\\n &stage.job_id.clone(),\\n\\n stage.stage_id,\\n\\n stage.children()[0].clone(),\\n\\n executors.clone(),\\n\\n )\\n\\n .await?;\\n\\n partition_locations.insert(stage.stage_id, result_partition_locations.clone());\\n\\n }\\n\\n\\n\\n let shuffle_reader: Arc<dyn ExecutionPlan> = Arc::new(ShuffleReaderExec::try_new(\\n\\n result_partition_locations,\\n\\n stages.last().unwrap().schema(),\\n\\n )?);\\n\\n Ok(shuffle_reader)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/scheduler/planner.rs\",\n \"rank\": 87,\n \"score\": 69970.39385388917\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//! Ballista Prelude (common imports)\\n\\n\\n\\npub use crate::{\\n\\n client::BallistaClient,\\n\\n context::BallistaContext,\\n\\n error::{BallistaError, Result},\\n\\n};\\n\\n\\n\\npub use futures::StreamExt;\\n\",\n \"file_path\": \"rust/lib/src/prelude.rs\",\n \"rank\": 90,\n \"score\": 47.57668948305457\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//! This crate contains code generated from the Ballista Protocol Buffer Definition as well\\n\\n//! as convenience code for interacting with the generated code.\\n\\n\\n\\nuse std::{convert::TryInto, io::Cursor};\\n\\n\\n\\nuse crate::{error::BallistaError, serde::scheduler::Action as BallistaAction};\\n\",\n \"file_path\": \"rust/lib/src/serde/mod.rs\",\n \"rank\": 91,\n \"score\": 46.77850162172378\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//! Ballista Distributed Compute\\n\\n#![allow(unused_imports)]\\n\\npub const BALLISTA_VERSION: &str = env!(\\\"CARGO_PKG_VERSION\\\");\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/lib.rs\",\n \"rank\": 92,\n \"score\": 44.30913591322717\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse std::convert::TryInto;\\n\\n\\n\\nuse crate::error::BallistaError;\\n\\nuse crate::scheduler::planner::PartitionLocation;\\n\\nuse crate::serde::protobuf;\\n\\nuse crate::serde::protobuf::action::ActionType;\\n\",\n \"file_path\": \"rust/lib/src/serde/scheduler/to_proto.rs\",\n \"rank\": 93,\n \"score\": 42.94755273988739\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//! Support for distributed schedulers, such as Kubernetes\\n\\n\\n\\npub mod execution_plans;\\n\\npub mod planner;\\n\\npub mod state;\\n\\n\\n\",\n \"file_path\": \"rust/lib/src/scheduler/mod.rs\",\n \"rank\": 94,\n \"score\": 42.48549259827602\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//! Distributed query execution\\n\\n//!\\n\\n//! This code is EXPERIMENTAL and still under development\\n\\n\\n\\nuse std::pin::Pin;\\n\\nuse std::sync::Arc;\\n\",\n \"file_path\": \"rust/lib/src/scheduler/planner.rs\",\n \"rank\": 95,\n \"score\": 42.21272540902669\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse std::{collections::HashMap, convert::TryInto};\\n\\n\\n\\nuse crate::error::BallistaError;\\n\\nuse crate::scheduler::planner::PartitionLocation;\\n\\nuse crate::serde::protobuf;\\n\\nuse crate::serde::protobuf::action::ActionType;\\n\",\n \"file_path\": \"rust/lib/src/serde/scheduler/from_proto.rs\",\n \"rank\": 96,\n \"score\": 42.187730933601166\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\npub mod from_proto;\\n\\npub mod to_proto;\\n\\n\\n\\n#[cfg(test)]\\n\\n\\n\\nmod roundtrip_tests {\\n\",\n \"file_path\": \"rust/lib/src/serde/logical_plan/mod.rs\",\n \"rank\": 97,\n \"score\": 42.15851664056607\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//! Ballista error types\\n\\n\\n\\nuse std::{\\n\\n error::Error,\\n\\n fmt::{Display, Formatter},\\n\\n io, result,\\n\",\n \"file_path\": \"rust/lib/src/error.rs\",\n \"rank\": 98,\n \"score\": 42.027413757396765\n },\n {\n \"content\": \"// Copyright 2020 Andy Grove\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\",\n \"file_path\": \"rust/lib/build.rs\",\n \"rank\": 99,\n \"score\": 41.819243889294995\n }\n]","isConversational":false}}},{"rowIdx":1996,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"zebra-chain/src/serialization/read_zcash.rs"},"repo_name":{"kind":"string","value":"ebfull/zebra"},"commit":{"kind":"string","value":"e61b5e50a2f00ebc6e16ac1de10031897acd71cc"},"file_code":{"kind":"string","value":"use std::io;\nuse std::net::{IpAddr, SocketAddr};\n\nuse byteorder::{BigEndian, LittleEndian, ReadBytesExt};\n\nuse super::SerializationError;\n\npub trait ReadZcashExt: io::Read {\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 #[inline]\n fn read_compactsize(&mut self) -> Result<u64, SerializationError> {\n use SerializationError::Parse;\n let flag_byte = self.read_u8()?;\n match flag_byte {\n n @ 0x00..=0xfc => Ok(n as u64),\n 0xfd => match self.read_u16::<LittleEndian>()? {\n n @ 0x0000_00fd..=0x0000_ffff => Ok(n as u64),\n _ => Err(Parse(\"non-canonical compactsize\")),\n },\n 0xfe => match self.read_u32::<LittleEndian>()? {\n n @ 0x0001_0000..=0xffff_ffff => Ok(n as u64),\n _ => Err(Parse(\"non-canonical compactsize\")),\n },\n 0xff => match self.read_u64::<LittleEndian>()? {\n n @ 0x1_0000_0000..=0xffff_ffff_ffff_ffff => Ok(n),\n _ => Err(Parse(\"non-canonical compactsize\")),\n },\n }\n }\n\n \n #[inline]\n fn read_ip_addr(&mut self) -> io::Result<IpAddr> {\n use std::net::{IpAddr::*, Ipv6Addr};\n\n let mut octets = [0u8; 16];\n self.read_exact(&mut octets)?;\n let v6_addr = Ipv6Addr::from(octets);\n\n match v6_addr.to_ipv4() {\n Some(v4_addr) => Ok(V4(v4_addr)),\n None => Ok(V6(v6_addr)),\n }\n }\n\n \n #[inline]\n fn read_socket_addr(&mut self) -> io::Result<SocketAddr> {\n let ip_addr = self.read_ip_addr()?;\n let port = self.read_u16::<BigEndian>()?;\n Ok(SocketAddr::new(ip_addr, port))\n }\n\n \n #[inline]\n fn read_string(&mut self) -> Result<String, SerializationError> {\n let len = self.read_compactsize()?;\n let mut buf = vec![0; len as usize];\n self.read_exact(&mut buf)?;\n String::from_utf8(buf).map_err(|_| SerializationError::Parse(\"invalid utf-8\"))\n }\n\n \n #[inline]\n fn read_4_bytes(&mut self) -> io::Result<[u8; 4]> {\n let mut bytes = [0; 4];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n\n \n #[inline]\n fn read_12_bytes(&mut self) -> io::Result<[u8; 12]> {\n let mut bytes = [0; 12];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n\n \n #[inline]\n fn read_32_bytes(&mut self) -> io::Result<[u8; 32]> {\n let mut bytes = [0; 32];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n\n \n #[inline]\n fn read_64_bytes(&mut self) -> io::Result<[u8; 64]> {\n let mut bytes = [0; 64];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n}\n\nimpl<R: io::Read + ?Sized> ReadZcashExt for R {}\n"},"prefix":{"kind":"string","value":"use std::io;\nuse std::net::{IpAddr, SocketAddr};\n\nuse byteorder::{BigEndian, LittleEndian, ReadBytesExt};\n\nuse super::SerializationError;\n\npub trait ReadZcashExt: io::Read {\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 #[inline]\n fn read_compactsize(&mut self) -> Result<u64, SerializationError> {\n use SerializationError::Parse;\n let flag_byte = self.read_u8()?;\n match flag_byte {\n n @ 0x00..=0xfc => Ok(n as u64),\n 0xfd => match self.read_u16::<LittleEndian>()? {\n n @ 0x0000_00fd..=0x0000_ffff => Ok(n as u64),\n _ => Err(Parse(\"non-canonical compactsize\")),\n },\n 0xfe => match self.read_u32::<LittleEndian>()? {\n n @ 0x0001_0000..=0xffff_ffff => Ok(n as u64),\n _ => Err(Parse(\"non-canonical compactsize\")),\n },\n 0xff => match self.read_u64::<LittleEndian>()? {\n n @ 0x1_0000_0000..=0xffff_ffff_ffff_ffff => Ok(n),\n _ => Err(Parse(\"non-canonical compactsize\")),\n },\n }\n }\n\n \n #[inline]\n fn read_ip_addr(&mut self) -> io::Result<IpAddr> {\n use std::net::{IpAddr::*, Ipv6Addr};\n\n let mut octets = [0u8; 16];\n self.read_exact(&mut octets)?;\n let v6_addr = Ipv6Addr::from(octets);\n\n match v6_addr.to_ipv4() {\n Some(v4_addr) => Ok(V4(v4_addr)),\n None => Ok(V6(v6_addr)),\n }\n }\n\n \n #[inline]\n fn read_socket_addr(&mut self) -> io::Result<SocketAddr> {\n let ip_addr = self.read_ip_addr()?;\n let port = self.read_u16::<BigEndian>()?;\n Ok(SocketAddr::new(ip_addr, port))\n }\n\n \n #[inline]\n fn read_st"},"suffix":{"kind":"string","value":"\n\n \n #[inline]\n fn read_4_bytes(&mut self) -> io::Result<[u8; 4]> {\n let mut bytes = [0; 4];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n\n \n #[inline]\n fn read_12_bytes(&mut self) -> io::Result<[u8; 12]> {\n let mut bytes = [0; 12];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n\n \n #[inline]\n fn read_32_bytes(&mut self) -> io::Result<[u8; 32]> {\n let mut bytes = [0; 32];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n\n \n #[inline]\n fn read_64_bytes(&mut self) -> io::Result<[u8; 64]> {\n let mut bytes = [0; 64];\n self.read_exact(&mut bytes)?;\n Ok(bytes)\n }\n}\n\nimpl<R: io::Read + ?Sized> ReadZcashExt for R {}\n"},"middle":{"kind":"string","value":"ring(&mut self) -> Result<String, SerializationError> {\n let len = self.read_compactsize()?;\n let mut buf = vec![0; len as usize];\n self.read_exact(&mut buf)?;\n String::from_utf8(buf).map_err(|_| SerializationError::Parse(\"invalid utf-8\"))\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"/// Check that if there are no Spends or Outputs, that valueBalance is also 0.\n\n///\n\n/// https://zips.z.cash/protocol/canopy.pdf#consensusfrombitcoin\n\npub fn shielded_balances_match(\n\n shielded_data: &ShieldedData,\n\n value_balance: Amount,\n\n) -> Result<(), TransactionError> {\n\n if (shielded_data.spends().count() + shielded_data.outputs().count() != 0)\n\n || i64::from(value_balance) == 0\n\n {\n\n Ok(())\n\n } else {\n\n Err(TransactionError::BadBalance)\n\n }\n\n}\n\n\n","file_path":"zebra-consensus/src/transaction/check.rs","rank":0,"score":179679.0377715845},{"content":"/// The divisor used for halvings.\n\n///\n\n/// `1 << Halving(height)`, as described in [protocol specification §7.7][7.7]\n\n///\n\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\n\npub fn halving_divisor(height: Height, network: Network) -> u64 {\n\n let blossom_height = Blossom\n\n .activation_height(network)\n\n .expect(\"blossom activation height should be available\");\n\n\n\n if height < SLOW_START_SHIFT {\n\n unreachable!(\n\n \"unsupported block height: callers should handle blocks below {:?}\",\n\n SLOW_START_SHIFT\n\n )\n\n } else if height < blossom_height {\n\n let scaled_pre_blossom_height = (height - SLOW_START_SHIFT) as u64;\n\n let halving_shift = scaled_pre_blossom_height / (PRE_BLOSSOM_HALVING_INTERVAL.0 as u64);\n\n 1 << halving_shift\n\n } else {\n\n let scaled_pre_blossom_height =\n\n (blossom_height - SLOW_START_SHIFT) as u64 * BLOSSOM_POW_TARGET_SPACING_RATIO;\n\n let post_blossom_height = (height - blossom_height) as u64;\n\n let halving_shift = (scaled_pre_blossom_height + post_blossom_height)\n\n / (POST_BLOSSOM_HALVING_INTERVAL.0 as u64);\n\n 1 << halving_shift\n\n }\n\n}\n\n\n","file_path":"zebra-consensus/src/block/subsidy/general.rs","rank":1,"score":167477.41815405432},{"content":"/// Generates a random scalar from the scalar field 𝔽_{r_𝕁}.\n\n///\n\n/// The prime order subgroup 𝕁^(r) is the order-r_𝕁 subgroup of 𝕁 that consists\n\n/// of the points whose order divides r. This function is useful when generating\n\n/// the uniform distribution on 𝔽_{r_𝕁} needed for Sapling commitment schemes'\n\n/// trapdoor generators.\n\n///\n\n/// https://zips.z.cash/protocol/protocol.pdf#jubjub\n\npub fn generate_trapdoor<T>(csprng: &mut T) -> jubjub::Fr\n\nwhere\n\n T: RngCore + CryptoRng,\n\n{\n\n let mut bytes = [0u8; 64];\n\n csprng.fill_bytes(&mut bytes);\n\n // Fr::from_bytes_wide() reduces the input modulo r via Fr::from_u512()\n\n jubjub::Fr::from_bytes_wide(&bytes)\n\n}\n","file_path":"zebra-chain/src/sapling/commitment/pedersen_hashes.rs","rank":2,"score":158961.34905929468},{"content":"/// A trait for defining constraints on `Amount`\n\npub trait Constraint {\n\n /// Returns the range of values that are valid under this constraint\n\n fn valid_range() -> RangeInclusive<i64>;\n\n\n\n /// Check if an input value is within the valid range\n\n fn validate(value: i64) -> Result<i64, Error> {\n\n let range = Self::valid_range();\n\n\n\n if !range.contains(&value) {\n\n Err(Error::Contains { range, value })\n\n } else {\n\n Ok(value)\n\n }\n\n }\n\n}\n\n\n\nimpl ZcashSerialize for Amount<NegativeAllowed> {\n\n fn zcash_serialize<W: std::io::Write>(&self, mut writer: W) -> Result<(), std::io::Error> {\n\n writer.write_i64::<LittleEndian>(self.0)\n\n }\n","file_path":"zebra-chain/src/amount.rs","rank":4,"score":150997.21627181285},{"content":"/// Mocks computation done during semantic validation\n\npub trait Prepare {\n\n fn prepare(self) -> PreparedBlock;\n\n}\n\n\n\nimpl Prepare for Arc<Block> {\n\n fn prepare(self) -> PreparedBlock {\n\n let block = self;\n\n let hash = block.hash();\n\n let height = block.coinbase_height().unwrap();\n\n let transaction_hashes = block.transactions.iter().map(|tx| tx.hash()).collect();\n\n let new_outputs = crate::utxo::new_outputs(&block);\n\n\n\n PreparedBlock {\n\n block,\n\n hash,\n\n height,\n\n new_outputs,\n\n transaction_hashes,\n\n }\n\n }\n\n}\n\n\n","file_path":"zebra-state/src/tests.rs","rank":5,"score":150991.62484954382},{"content":" pub trait Sealed {}\n\n impl Sealed for Bctv14Proof {}\n\n impl Sealed for Groth16Proof {}\n\n}\n","file_path":"zebra-chain/src/primitives/proofs.rs","rank":6,"score":148472.09560570936},{"content":"pub trait CommandExt {\n\n /// wrapper for `status` fn on `Command` that constructs informative error\n\n /// reports\n\n fn status2(&mut self) -> Result<TestStatus, Report>;\n\n\n\n /// wrapper for `output` fn on `Command` that constructs informative error\n\n /// reports\n\n fn output2(&mut self) -> Result<TestOutput<NoDir>, Report>;\n\n\n\n /// wrapper for `spawn` fn on `Command` that constructs informative error\n\n /// reports\n\n fn spawn2<T>(&mut self, dir: T) -> Result<TestChild<T>, Report>;\n\n}\n\n\n\nimpl CommandExt for Command {\n\n /// wrapper for `status` fn on `Command` that constructs informative error\n\n /// reports\n\n fn status2(&mut self) -> Result<TestStatus, Report> {\n\n let cmd = format!(\"{:?}\", self);\n\n let status = self.status();\n","file_path":"zebra-test/src/command.rs","rank":7,"score":148472.09560570936},{"content":"/// Extension trait for methods on `tempdir::TempDir` for using it as a test\n\n/// directory with an arbitrary command.\n\n///\n\n/// This trait is separate from `ZebradTestDirExt`, so that we can test\n\n/// `zebra_test::command` without running `zebrad`.\n\npub trait TestDirExt\n\nwhere\n\n Self: AsRef<Path> + Sized,\n\n{\n\n /// Spawn `cmd` with `args` as a child process in this test directory,\n\n /// potentially taking ownership of the tempdir for the duration of the\n\n /// child process.\n\n fn spawn_child_with_command(self, cmd: &str, args: &[&str]) -> Result<TestChild<Self>>;\n\n}\n\n\n\nimpl<T> TestDirExt for T\n\nwhere\n\n Self: AsRef<Path> + Sized,\n\n{\n\n fn spawn_child_with_command(self, cmd: &str, args: &[&str]) -> Result<TestChild<Self>> {\n\n let mut cmd = test_cmd(cmd, self.as_ref())?;\n\n\n\n Ok(cmd\n\n .args(args)\n\n .stdout(Stdio::piped())\n","file_path":"zebra-test/src/command.rs","rank":8,"score":146099.584949553},{"content":"/// Helper trait for constructing \"valid\" looking chains of blocks\n\npub trait FakeChainHelper {\n\n fn make_fake_child(&self) -> Arc<Block>;\n\n\n\n fn set_work(self, work: u128) -> Arc<Block>;\n\n}\n\n\n\nimpl FakeChainHelper for Arc<Block> {\n\n fn make_fake_child(&self) -> Arc<Block> {\n\n let parent_hash = self.hash();\n\n let mut child = Block::clone(self);\n\n let mut transactions = mem::take(&mut child.transactions);\n\n let mut tx = transactions.remove(0);\n\n\n\n let input = match Arc::make_mut(&mut tx) {\n\n Transaction::V1 { inputs, .. } => &mut inputs[0],\n\n Transaction::V2 { inputs, .. } => &mut inputs[0],\n\n Transaction::V3 { inputs, .. } => &mut inputs[0],\n\n Transaction::V4 { inputs, .. } => &mut inputs[0],\n\n };\n\n\n","file_path":"zebra-state/src/tests.rs","rank":9,"score":146094.93732292362},{"content":"/// Initialize globals for tests such as the tracing subscriber and panic / error\n\n/// reporting hooks\n\npub fn init() {\n\n INIT.call_once(|| {\n\n let fmt_layer = fmt::layer().with_target(false);\n\n // Use the RUST_LOG env var, or by default:\n\n // - warn for most tests, and\n\n // - for some modules, hide expected warn logs\n\n let filter_layer = EnvFilter::try_from_default_env().unwrap_or_else(|_| {\n\n EnvFilter::try_new(\"warn\")\n\n .unwrap()\n\n .add_directive(\"zebra_consensus=error\".parse().unwrap())\n\n });\n\n\n\n tracing_subscriber::registry()\n\n .with(filter_layer)\n\n .with(fmt_layer)\n\n .with(ErrorLayer::default())\n\n .init();\n\n\n\n color_eyre::config::HookBuilder::default()\n\n .add_frame_filter(Box::new(|frames| {\n","file_path":"zebra-test/src/lib.rs","rank":10,"score":145176.4983604153},{"content":"/// A marker trait used to abstract over BCTV14 or Groth16 proofs.\n\npub trait ZkSnarkProof:\n\n Copy\n\n + Clone\n\n + Debug\n\n + PartialEq\n\n + Eq\n\n + Serialize\n\n + DeserializeOwned\n\n + ZcashSerialize\n\n + ZcashDeserialize\n\n + private::Sealed\n\n{\n\n}\n\nimpl ZkSnarkProof for Bctv14Proof {}\n\nimpl ZkSnarkProof for Groth16Proof {}\n\n\n\nmod private {\n\n use super::*;\n\n\n","file_path":"zebra-chain/src/primitives/proofs.rs","rank":11,"score":143843.59272669425},{"content":"/// Helper for deserializing more succinctly via type inference\n\npub trait ZcashDeserializeInto {\n\n /// Deserialize based on type inference\n\n fn zcash_deserialize_into<T>(self) -> Result<T, SerializationError>\n\n where\n\n T: ZcashDeserialize;\n\n}\n\n\n\nimpl<R: io::Read> ZcashDeserializeInto for R {\n\n fn zcash_deserialize_into<T>(self) -> Result<T, SerializationError>\n\n where\n\n T: ZcashDeserialize,\n\n {\n\n T::zcash_deserialize(self)\n\n }\n\n}\n","file_path":"zebra-chain/src/serialization/zcash_deserialize.rs","rank":12,"score":143833.01784375135},{"content":"/// Add context to an error report\n\npub trait ContextFrom<S> {\n\n type Return;\n\n\n\n fn context_from(self, source: S) -> Self::Return;\n\n}\n\n\n\nimpl<C, T, E> ContextFrom<C> for Result<T, E>\n\nwhere\n\n E: Into<Report>,\n\n Report: ContextFrom<C, Return = Report>,\n\n{\n\n type Return = Result<T, Report>;\n\n\n\n fn context_from(self, source: C) -> Self::Return {\n\n self.map_err(|e| e.into())\n\n .map_err(|report| report.context_from(source))\n\n }\n\n}\n\n\n\nimpl ContextFrom<&TestStatus> for Report {\n","file_path":"zebra-test/src/command.rs","rank":13,"score":142964.8837292677},{"content":"/// Use the provided TCP connection to create a Zcash connection completely\n\n/// isolated from all other node state.\n\n///\n\n/// The connection pool returned by `init` should be used for all requests that\n\n/// don't require isolated state or use of an existing TCP connection. However,\n\n/// this low-level API is useful for custom network crawlers or Tor connections.\n\n///\n\n/// In addition to being completely isolated from all other node state, this\n\n/// method also aims to be minimally distinguishable from other clients.\n\n///\n\n/// Note that this method does not implement any timeout behavior, so callers may\n\n/// want to layer it with a timeout as appropriate for their application.\n\n///\n\n/// # Inputs\n\n///\n\n/// - `conn`: an existing TCP connection to use. Passing an existing TCP\n\n/// connection allows this method to be used with clearnet or Tor transports.\n\n///\n\n/// - `user_agent`: a valid BIP14 user-agent, e.g., the empty string.\n\n///\n\n/// # Bug\n\n///\n\n/// `connect_isolated` only works on `Mainnet`, see #1687.\n\npub fn connect_isolated(\n\n conn: TcpStream,\n\n user_agent: String,\n\n) -> impl Future<\n\n Output = Result<\n\n BoxService<Request, Response, Box<dyn std::error::Error + Send + Sync + 'static>>,\n\n Box<dyn std::error::Error + Send + Sync + 'static>,\n\n >,\n\n> {\n\n let handshake = peer::Handshake::builder()\n\n .with_config(Config::default())\n\n .with_inbound_service(tower::service_fn(|_req| async move {\n\n Ok::<Response, Box<dyn std::error::Error + Send + Sync + 'static>>(Response::Nil)\n\n }))\n\n .with_user_agent(user_agent)\n\n .finish()\n\n .expect(\"provided mandatory builder parameters\");\n\n\n\n // We can't get the remote addr from conn, because it might be a tcp\n\n // connection through a socks proxy, not directly to the remote. But it\n\n // doesn't seem like zcashd cares if we give a bogus one, and Zebra doesn't\n\n // touch it at all.\n\n let remote_addr = \"0.0.0.0:8233\".parse().unwrap();\n\n\n\n Oneshot::new(handshake, (conn, remote_addr)).map_ok(|client| BoxService::new(Wrapper(client)))\n\n}\n\n\n","file_path":"zebra-network/src/isolated.rs","rank":14,"score":142678.51441247523},{"content":"/// Sets the Zebra shutdown flag to `true`.\n\npub fn set_shutting_down() {\n\n IS_SHUTTING_DOWN.store(true, Ordering::SeqCst);\n\n}\n","file_path":"zebra-chain/src/shutdown.rs","rank":15,"score":142672.7842686008},{"content":"// Helper trait for defining the exact format used to interact with disk per\n\n// type.\n\npub trait IntoDisk {\n\n // The type used to compare a value as a key to other keys stored in a\n\n // database\n\n type Bytes: AsRef<[u8]>;\n\n\n\n // function to convert the current type to its disk format in `zs_get()`\n\n // without necessarily allocating a new IVec\n\n fn as_bytes(&self) -> Self::Bytes;\n\n}\n\n\n\nimpl<'a, T> IntoDisk for &'a T\n\nwhere\n\n T: IntoDisk,\n\n{\n\n type Bytes = T::Bytes;\n\n\n\n fn as_bytes(&self) -> Self::Bytes {\n\n T::as_bytes(*self)\n\n }\n\n}\n","file_path":"zebra-state/src/service/finalized_state/disk_format.rs","rank":16,"score":141703.11022942467},{"content":"/// Returns `Ok(())` if `hash` passes:\n\n/// - the target difficulty limit for `network` (PoWLimit), and\n\n/// - the difficulty filter,\n\n/// based on the fields in `header`.\n\n///\n\n/// If the block is invalid, returns an error containing `height` and `hash`.\n\npub fn difficulty_is_valid(\n\n header: &Header,\n\n network: Network,\n\n height: &Height,\n\n hash: &Hash,\n\n) -> Result<(), BlockError> {\n\n let difficulty_threshold = header\n\n .difficulty_threshold\n\n .to_expanded()\n\n .ok_or(BlockError::InvalidDifficulty(*height, *hash))?;\n\n\n\n // Note: the comparisons in this function are u256 integer comparisons, like\n\n // zcashd and bitcoin. Greater values represent *less* work.\n\n\n\n // The PowLimit check is part of `Threshold()` in the spec, but it doesn't\n\n // actually depend on any previous blocks.\n\n if difficulty_threshold > ExpandedDifficulty::target_difficulty_limit(network) {\n\n Err(BlockError::TargetDifficultyLimit(\n\n *height,\n\n *hash,\n","file_path":"zebra-consensus/src/block/check.rs","rank":17,"score":140305.1609736117},{"content":"/// Returns `Ok(())` if `header.time` is less than or equal to\n\n/// 2 hours in the future, according to the node's local clock (`now`).\n\n///\n\n/// This is a non-deterministic rule, as clocks vary over time, and\n\n/// between different nodes.\n\n///\n\n/// \"In addition, a full validator MUST NOT accept blocks with nTime\n\n/// more than two hours in the future according to its clock. This\n\n/// is not strictly a consensus rule because it is nondeterministic,\n\n/// and clock time varies between nodes. Also note that a block that\n\n/// is rejected by this rule at a given point in time may later be\n\n/// accepted.\" [§7.5][7.5]\n\n///\n\n/// [7.5]: https://zips.z.cash/protocol/protocol.pdf#blockheader\n\n///\n\n/// If the header time is invalid, returns an error containing `height` and `hash`.\n\npub fn time_is_valid_at(\n\n header: &Header,\n\n now: DateTime<Utc>,\n\n height: &Height,\n\n hash: &Hash,\n\n) -> Result<(), zebra_chain::block::BlockTimeError> {\n\n header.time_is_valid_at(now, height, hash)\n\n}\n\n\n","file_path":"zebra-consensus/src/block/check.rs","rank":18,"score":140305.1609736117},{"content":"/// Helper trait for retrieving values from rocksdb column familys with a consistently\n\n/// defined format\n\npub trait DiskDeserialize {\n\n /// Serialize the given key and use that to get and deserialize the\n\n /// corresponding value from a rocksdb column family, if it is present.\n\n fn zs_get<K, V>(&self, cf: &rocksdb::ColumnFamily, key: &K) -> Option<V>\n\n where\n\n K: IntoDisk,\n\n V: FromDisk;\n\n}\n\n\n\nimpl DiskDeserialize for rocksdb::DB {\n\n fn zs_get<K, V>(&self, cf: &rocksdb::ColumnFamily, key: &K) -> Option<V>\n\n where\n\n K: IntoDisk,\n\n V: FromDisk,\n\n {\n\n let key_bytes = key.as_bytes();\n\n\n\n // We use `get_pinned_cf` to avoid taking ownership of the serialized\n\n // format because we're going to deserialize it anyways, which avoids an\n\n // extra copy\n","file_path":"zebra-state/src/service/finalized_state/disk_format.rs","rank":19,"score":139665.50020741395},{"content":"/// Helper trait for inserting (Key, Value) pairs into rocksdb with a consistently\n\n/// defined format\n\npub trait DiskSerialize {\n\n /// Serialize and insert the given key and value into a rocksdb column family.\n\n fn zs_insert<K, V>(&mut self, cf: &rocksdb::ColumnFamily, key: K, value: V)\n\n where\n\n K: IntoDisk + Debug,\n\n V: IntoDisk;\n\n}\n\n\n\nimpl DiskSerialize for rocksdb::WriteBatch {\n\n fn zs_insert<K, V>(&mut self, cf: &rocksdb::ColumnFamily, key: K, value: V)\n\n where\n\n K: IntoDisk + Debug,\n\n V: IntoDisk,\n\n {\n\n let key_bytes = key.as_bytes();\n\n let value_bytes = value.as_bytes();\n\n self.put_cf(cf, key_bytes, value_bytes);\n\n }\n\n}\n\n\n","file_path":"zebra-state/src/service/finalized_state/disk_format.rs","rank":20,"score":139665.50020741395},{"content":"#[allow(dead_code)]\n\npub fn miner_subsidy(\n\n height: Height,\n\n network: Network,\n\n non_miner_reward: Option<Amount<NonNegative>>,\n\n) -> Result<Amount<NonNegative>, Error> {\n\n if let Some(non_miner_reward) = non_miner_reward {\n\n block_subsidy(height, network)? - non_miner_reward\n\n } else {\n\n block_subsidy(height, network)\n\n }\n\n}\n\n\n","file_path":"zebra-consensus/src/block/subsidy/general.rs","rank":21,"score":138062.82612103797},{"content":"/// Validate the JoinSplit binding signature.\n\n///\n\n/// https://zips.z.cash/protocol/canopy.pdf#sproutnonmalleability\n\n/// https://zips.z.cash/protocol/canopy.pdf#txnencodingandconsensus\n\npub fn validate_joinsplit_sig(\n\n joinsplit_data: &JoinSplitData<Groth16Proof>,\n\n sighash: &[u8],\n\n) -> Result<(), TransactionError> {\n\n ed25519::VerificationKey::try_from(joinsplit_data.pub_key)\n\n .and_then(|vk| vk.verify(&joinsplit_data.sig, sighash))\n\n .map_err(TransactionError::Ed25519)\n\n}\n\n\n","file_path":"zebra-consensus/src/transaction/check.rs","rank":22,"score":138062.82612103797},{"content":"/// Check Merkle root validity.\n\n///\n\n/// `transaction_hashes` is a precomputed list of transaction hashes.\n\npub fn merkle_root_validity(\n\n block: &Block,\n\n transaction_hashes: &[transaction::Hash],\n\n) -> Result<(), BlockError> {\n\n let merkle_root = transaction_hashes.iter().cloned().collect();\n\n\n\n if block.header.merkle_root != merkle_root {\n\n return Err(BlockError::BadMerkleRoot {\n\n actual: merkle_root,\n\n expected: block.header.merkle_root,\n\n });\n\n }\n\n\n\n // Bitcoin's transaction Merkle trees are malleable, allowing blocks with\n\n // duplicate transactions to have the same Merkle root as blocks without\n\n // duplicate transactions. Duplicate transactions should cause a block to be\n\n // rejected, as duplicate transactions imply that the block contains a\n\n // double-spend. As a defense-in-depth, however, we also check that there\n\n // are no duplicate transaction hashes, by collecting into a HashSet.\n\n use std::collections::HashSet;\n\n if transaction_hashes.len() != transaction_hashes.iter().collect::<HashSet<_>>().len() {\n\n return Err(BlockError::DuplicateTransaction);\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"zebra-consensus/src/block/check.rs","rank":23,"score":138062.82612103797},{"content":"/// Returns true if the application is shutting down.\n\n///\n\n/// Returns false otherwise.\n\npub fn is_shutting_down() -> bool {\n\n // ## Correctness:\n\n //\n\n // Since we're shutting down, and this is a one-time operation,\n\n // performance is not important. So we use the strongest memory\n\n // ordering.\n\n // https://doc.rust-lang.org/nomicon/atomics.html#sequentially-consistent\n\n IS_SHUTTING_DOWN.load(Ordering::SeqCst)\n\n}\n\n\n","file_path":"zebra-chain/src/shutdown.rs","rank":24,"score":137640.9803321608},{"content":"/// Consensus-critical serialization for Zcash.\n\n///\n\n/// This trait provides a generic serialization for consensus-critical\n\n/// formats, such as network messages, transactions, blocks, etc. It is intended\n\n/// for use only in consensus-critical contexts; in other contexts, such as\n\n/// internal storage, it would be preferable to use Serde.\n\npub trait ZcashSerialize: Sized {\n\n /// Write `self` to the given `writer` using the canonical format.\n\n ///\n\n /// This function has a `zcash_` prefix to alert the reader that the\n\n /// serialization in use is consensus-critical serialization, rather than\n\n /// some other kind of serialization.\n\n ///\n\n /// Notice that the error type is [`std::io::Error`]; this indicates that\n\n /// serialization MUST be infallible up to errors in the underlying writer.\n\n /// In other words, any type implementing `ZcashSerialize` must make illegal\n\n /// states unrepresentable.\n\n fn zcash_serialize<W: io::Write>(&self, writer: W) -> Result<(), io::Error>;\n\n\n\n /// Helper function to construct a vec to serialize the current struct into\n\n fn zcash_serialize_to_vec(&self) -> Result<Vec<u8>, io::Error> {\n\n let mut data = Vec::new();\n\n self.zcash_serialize(&mut data)?;\n\n Ok(data)\n\n }\n\n}\n","file_path":"zebra-chain/src/serialization/zcash_serialize.rs","rank":25,"score":136195.51442400322},{"content":"/// Consensus-critical serialization for Zcash.\n\n///\n\n/// This trait provides a generic deserialization for consensus-critical\n\n/// formats, such as network messages, transactions, blocks, etc. It is intended\n\n/// for use only in consensus-critical contexts; in other contexts, such as\n\n/// internal storage, it would be preferable to use Serde.\n\npub trait ZcashDeserialize: Sized {\n\n /// Try to read `self` from the given `reader`.\n\n ///\n\n /// This function has a `zcash_` prefix to alert the reader that the\n\n /// serialization in use is consensus-critical serialization, rather than\n\n /// some other kind of serialization.\n\n fn zcash_deserialize<R: io::Read>(reader: R) -> Result<Self, SerializationError>;\n\n}\n\n\n\nimpl<T: ZcashDeserialize> ZcashDeserialize for Vec<T> {\n\n fn zcash_deserialize<R: io::Read>(mut reader: R) -> Result<Self, SerializationError> {\n\n let len = reader.read_compactsize()?;\n\n // We're given len, so we could preallocate. But blindly preallocating\n\n // without a size bound can allow DOS attacks, and there's no way to\n\n // pass a size bound in a ZcashDeserialize impl, so instead we allocate\n\n // as we read from the reader. (The maximum block and transaction sizes\n\n // limit the eventual size of these allocations.)\n\n let mut vec = Vec::new();\n\n for _ in 0..len {\n\n vec.push(T::zcash_deserialize(&mut reader)?);\n\n }\n\n Ok(vec)\n\n }\n\n}\n\n\n","file_path":"zebra-chain/src/serialization/zcash_deserialize.rs","rank":26,"score":136195.51442400322},{"content":"/// Returns a list of outputs in `Transaction`, which have a value equal to `Amount`.\n\npub fn find_output_with_amount(\n\n transaction: &Transaction,\n\n amount: Amount<NonNegative>,\n\n) -> Vec<transparent::Output> {\n\n // TODO: shielded coinbase - Heartwood\n\n transaction\n\n .outputs()\n\n .iter()\n\n .filter(|o| o.value == amount)\n\n .cloned()\n\n .collect()\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use color_eyre::Report;\n\n\n\n #[test]\n\n fn halving_test() -> Result<(), Report> {\n","file_path":"zebra-consensus/src/block/subsidy/general.rs","rank":27,"score":135936.09115167888},{"content":"/// Helper type for retrieving types from the disk with the correct format.\n\n///\n\n/// The ivec should be correctly encoded by IntoDisk.\n\npub trait FromDisk: Sized {\n\n /// Function to convert the disk bytes back into the deserialized type.\n\n ///\n\n /// # Panics\n\n ///\n\n /// - if the input data doesn't deserialize correctly\n\n fn from_bytes(bytes: impl AsRef<[u8]>) -> Self;\n\n}\n\n\n\nimpl<T> FromDisk for Arc<T>\n\nwhere\n\n T: FromDisk,\n\n{\n\n fn from_bytes(bytes: impl AsRef<[u8]>) -> Self {\n\n Arc::new(T::from_bytes(bytes))\n\n }\n\n}\n\n\n\nimpl IntoDisk for Block {\n\n type Bytes = Vec<u8>;\n","file_path":"zebra-state/src/service/finalized_state/disk_format.rs","rank":28,"score":134153.02857075864},{"content":"/// Generate a block with no transactions (not even a coinbase transaction).\n\n///\n\n/// The generated block should fail validation.\n\npub fn block_no_transactions() -> Block {\n\n Block {\n\n header: block::Header::zcash_deserialize(&zebra_test::vectors::DUMMY_HEADER[..]).unwrap(),\n\n transactions: Vec::new(),\n\n }\n\n}\n\n\n\n/// Return a new `(chain_verifier, state_service)` using the hard-coded\n\n/// checkpoint list for `network`.\n\nasync fn verifiers_from_network(\n\n network: Network,\n\n) -> (\n\n impl Service<\n\n Arc<Block>,\n\n Response = block::Hash,\n\n Error = BoxError,\n\n Future = impl Future<Output = Result<block::Hash, BoxError>>,\n\n > + Send\n\n + Clone\n\n + 'static,\n","file_path":"zebra-consensus/src/chain/tests.rs","rank":29,"score":133031.02218459797},{"content":"/// Generate a block header\n\npub fn block_header() -> Header {\n\n Header::zcash_deserialize(&zebra_test::vectors::DUMMY_HEADER[..]).unwrap()\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/generate.rs","rank":30,"score":130904.28721523889},{"content":"/// Extends [`Write`] with methods for writing Zcash/Bitcoin types.\n\n///\n\n/// [`Write`]: https://doc.rust-lang.org/std/io/trait.Write.html\n\npub trait WriteZcashExt: io::Write {\n\n /// Writes a `u64` using the Bitcoin `CompactSize` encoding.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```rust\n\n /// use zebra_chain::serialization::WriteZcashExt;\n\n ///\n\n /// let mut buf = Vec::new();\n\n /// buf.write_compactsize(0x12).unwrap();\n\n /// assert_eq!(buf, b\"\\x12\");\n\n ///\n\n /// let mut buf = Vec::new();\n\n /// buf.write_compactsize(0xfd).unwrap();\n\n /// assert_eq!(buf, b\"\\xfd\\xfd\\x00\");\n\n ///\n\n /// let mut buf = Vec::new();\n\n /// buf.write_compactsize(0xaafd).unwrap();\n\n /// assert_eq!(buf, b\"\\xfd\\xfd\\xaa\");\n\n ///\n","file_path":"zebra-chain/src/serialization/write_zcash.rs","rank":31,"score":127632.46852485277},{"content":"/// Generate a block with multiple transactions just above limit\n\npub fn oversized_multi_transaction_block() -> Block {\n\n multi_transaction_block(true)\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/generate.rs","rank":32,"score":126963.6125931445},{"content":"/// Generate a block with one transaction and multiple inputs just below limit\n\npub fn large_single_transaction_block() -> Block {\n\n single_transaction_block(false)\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/generate.rs","rank":33,"score":126963.6125931445},{"content":"/// Generate a block with one transaction and multiple inputs just above limit\n\npub fn oversized_single_transaction_block() -> Block {\n\n single_transaction_block(true)\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/generate.rs","rank":34,"score":126963.6125931445},{"content":"/// Generate a block with multiple transactions just below limit\n\npub fn large_multi_transaction_block() -> Block {\n\n multi_transaction_block(false)\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/generate.rs","rank":35,"score":126963.6125931445},{"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<ZebradApp> {\n\n config::Reader::new(&APPLICATION)\n\n}\n\n\n\n/// Zebrad Application\n\n#[derive(Debug)]\n\npub struct ZebradApp {\n\n /// Application configuration.\n\n config: Option<ZebradConfig>,\n\n\n\n /// Application state.\n\n state: application::State<Self>,\n\n}\n\n\n\nimpl ZebradApp {\n\n /// Are standard output and standard error both connected to ttys?\n\n fn outputs_are_ttys() -> bool {\n\n atty::is(atty::Stream::Stdout) && atty::is(atty::Stream::Stderr)\n\n }\n\n\n","file_path":"zebrad/src/application.rs","rank":36,"score":123155.73114677425},{"content":"/// Obtain a read-only (multi-reader) lock on the application state.\n\n///\n\n/// Panics if the application state has not been initialized.\n\npub fn app_reader() -> application::lock::Reader<ZebradApp> {\n\n APPLICATION.read()\n\n}\n\n\n","file_path":"zebrad/src/application.rs","rank":37,"score":118089.37561378883},{"content":"/// Obtain an exclusive mutable lock on the application state.\n\npub fn app_writer() -> application::lock::Writer<ZebradApp> {\n\n APPLICATION.write()\n\n}\n\n\n","file_path":"zebrad/src/application.rs","rank":38,"score":118089.37561378883},{"content":"/// Returns the hash for the genesis block in `network`.\n\npub fn genesis_hash(network: Network) -> block::Hash {\n\n match network {\n\n // zcash-cli getblockhash 0\n\n Network::Mainnet => \"00040fe8ec8471911baa1db1266ea15dd06b4a8a5c453883c000b031973dce08\",\n\n // zcash-cli -testnet getblockhash 0\n\n Network::Testnet => \"05a60a92d99d85997cce3b87616c089f6124d7342af37106edc76126334a2c38\",\n\n }\n\n .parse()\n\n .expect(\"hard-coded hash parses\")\n\n}\n","file_path":"zebra-chain/src/parameters/genesis.rs","rank":39,"score":116168.55078427677},{"content":"pub fn panic_event_from<T>(msg: T) -> Event<'static>\n\nwhere\n\n T: ToString,\n\n{\n\n let exception = Exception {\n\n ty: \"panic\".into(),\n\n mechanism: Some(Mechanism {\n\n ty: \"panic\".into(),\n\n handled: Some(false),\n\n ..Default::default()\n\n }),\n\n value: Some(msg.to_string()),\n\n // Sentry does not handle panic = abort well yet, and when gibven this\n\n // stacktrace, it consists only of this line, making Sentry dedupe\n\n // events together by their stacetrace fingerprint incorrectly.\n\n //\n\n // stacktrace: current_stacktrace(),\n\n ..Default::default()\n\n };\n\n\n\n Event {\n\n exception: vec![exception].into(),\n\n level: sentry::Level::Fatal,\n\n ..Default::default()\n\n }\n\n}\n","file_path":"zebrad/src/sentry.rs","rank":40,"score":115447.96067211195},{"content":"/// Returns `Ok(())` if there is exactly one coinbase transaction in `Block`,\n\n/// and that coinbase transaction is the first transaction in the block.\n\n///\n\n/// \"The first (and only the first) transaction in a block is a coinbase\n\n/// transaction, which collects and spends any miner subsidy and transaction\n\n/// fees paid by transactions included in this block.\" [§3.10][3.10]\n\n///\n\n/// [3.10]: https://zips.z.cash/protocol/protocol.pdf#coinbasetransactions\n\npub fn coinbase_is_first(block: &Block) -> Result<(), BlockError> {\n\n let first = block\n\n .transactions\n\n .get(0)\n\n .ok_or(BlockError::NoTransactions)?;\n\n let mut rest = block.transactions.iter().skip(1);\n\n if !first.is_coinbase() {\n\n return Err(TransactionError::CoinbasePosition)?;\n\n }\n\n if rest.any(|tx| tx.contains_coinbase_input()) {\n\n return Err(TransactionError::CoinbaseInputFound)?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"zebra-consensus/src/block/check.rs","rank":41,"score":114339.64297199558},{"content":"/// Checks that the transaction has inputs and outputs.\n\n///\n\n/// More specifically:\n\n///\n\n/// * at least one of tx_in_count, nShieldedSpend, and nJoinSplit MUST be non-zero.\n\n/// * at least one of tx_out_count, nShieldedOutput, and nJoinSplit MUST be non-zero.\n\n///\n\n/// https://zips.z.cash/protocol/canopy.pdf#txnencodingandconsensus\n\npub fn has_inputs_and_outputs(tx: &Transaction) -> Result<(), TransactionError> {\n\n // The consensus rule is written in terms of numbers, but our transactions\n\n // hold enum'd data. Mixing pattern matching and numerical checks is risky,\n\n // so convert everything to counts and sum up.\n\n match tx {\n\n Transaction::V4 {\n\n inputs,\n\n outputs,\n\n joinsplit_data,\n\n shielded_data,\n\n ..\n\n } => {\n\n let tx_in_count = inputs.len();\n\n let tx_out_count = outputs.len();\n\n let n_joinsplit = joinsplit_data\n\n .as_ref()\n\n .map(|d| d.joinsplits().count())\n\n .unwrap_or(0);\n\n let n_shielded_spend = shielded_data\n\n .as_ref()\n","file_path":"zebra-consensus/src/transaction/check.rs","rank":42,"score":114339.64297199558},{"content":"/// Returns a random port number from the ephemeral port range.\n\n///\n\n/// Does not check if the port is already in use. It's impossible to do this\n\n/// check in a reliable, cross-platform way.\n\n///\n\n/// ## Usage\n\n///\n\n/// If you want a once-off random unallocated port, use\n\n/// `random_unallocated_port`. Don't use this function if you don't need\n\n/// to - it has a small risk of port conflcits.\n\n///\n\n/// Use this function when you need to use the same random port multiple\n\n/// times. For example: setting up both ends of a connection, or re-using\n\n/// the same port multiple times.\n\nfn random_known_port() -> u16 {\n\n // Use the intersection of the IANA ephemeral port range, and the Linux\n\n // ephemeral port range:\n\n // https://en.wikipedia.org/wiki/Ephemeral_port#Range\n\n rand::thread_rng().gen_range(49152, 60999)\n\n}\n\n\n\n/// Returns the \"magic\" port number that tells the operating system to\n\n/// choose a random unallocated port.\n\n///\n\n/// The OS chooses a different port each time it opens a connection or\n\n/// listener with this magic port number.\n\n///\n\n/// ## Usage\n\n///\n\n/// See the usage note for `random_known_port`.\n","file_path":"zebrad/tests/acceptance.rs","rank":43,"score":112785.29935429417},{"content":"#[allow(dead_code)]\n\nfn random_unallocated_port() -> u16 {\n\n 0\n\n}\n\n\n\n#[tokio::test]\n\nasync fn metrics_endpoint() -> Result<()> {\n\n use hyper::Client;\n\n\n\n zebra_test::init();\n\n\n\n // [Note on port conflict](#Note on port conflict)\n\n let port = random_known_port();\n\n let endpoint = format!(\"127.0.0.1:{}\", port);\n\n let url = format!(\"http://{}\", endpoint);\n\n\n\n // Write a configuration that has metrics endpoint_addr set\n\n let mut config = default_test_config()?;\n\n config.metrics.endpoint_addr = Some(endpoint.parse().unwrap());\n\n\n\n let dir = TempDir::new(\"zebrad_tests\")?.with_config(&mut config)?;\n","file_path":"zebrad/tests/acceptance.rs","rank":44,"score":112772.42746269662},{"content":"#[test]\n\nfn compact_zero() {\n\n zebra_test::init();\n\n\n\n let natural_zero = CompactDifficulty(0);\n\n assert_eq!(natural_zero.to_expanded(), None);\n\n assert_eq!(natural_zero.to_work(), None);\n\n\n\n // Small value zeroes\n\n let small_zero_1 = CompactDifficulty(1);\n\n assert_eq!(small_zero_1.to_expanded(), None);\n\n assert_eq!(small_zero_1.to_work(), None);\n\n let small_zero_max = CompactDifficulty(UNSIGNED_MANTISSA_MASK);\n\n assert_eq!(small_zero_max.to_expanded(), None);\n\n assert_eq!(small_zero_max.to_work(), None);\n\n\n\n // Special-cased zeroes, negative in the floating-point representation\n\n let sc_zero = CompactDifficulty(SIGN_BIT);\n\n assert_eq!(sc_zero.to_expanded(), None);\n\n assert_eq!(sc_zero.to_work(), None);\n\n let sc_zero_next = CompactDifficulty(SIGN_BIT + 1);\n","file_path":"zebra-chain/src/work/difficulty/tests/vectors.rs","rank":45,"score":110971.84184019027},{"content":"#[test]\n\nfn compact_extremes() {\n\n zebra_test::init();\n\n\n\n // Values equal to one\n\n let expanded_one = Some(ExpandedDifficulty(U256::one()));\n\n let work_one = None;\n\n\n\n let canonical_one = CompactDifficulty((1 << PRECISION) + (1 << 16));\n\n assert_eq!(canonical_one.to_expanded(), expanded_one);\n\n assert_eq!(\n\n canonical_one.to_expanded().unwrap().to_compact(),\n\n canonical_one\n\n );\n\n assert_eq!(canonical_one.to_work(), work_one);\n\n\n\n let another_one = CompactDifficulty(OFFSET as u32 * (1 << PRECISION) + 1);\n\n assert_eq!(another_one.to_expanded(), expanded_one);\n\n assert_eq!(\n\n another_one.to_expanded().unwrap().to_compact(),\n\n canonical_one\n","file_path":"zebra-chain/src/work/difficulty/tests/vectors.rs","rank":46,"score":110971.84184019027},{"content":"/// Check that a coinbase tx does not have any JoinSplit or Spend descriptions.\n\n///\n\n/// https://zips.z.cash/protocol/canopy.pdf#txnencodingandconsensus\n\npub fn coinbase_tx_no_joinsplit_or_spend(tx: &Transaction) -> Result<(), TransactionError> {\n\n if tx.is_coinbase() {\n\n match tx {\n\n // Check if there is any JoinSplitData.\n\n Transaction::V4 {\n\n joinsplit_data: Some(_),\n\n ..\n\n } => Err(TransactionError::CoinbaseHasJoinSplit),\n\n\n\n // The ShieldedData contains both Spends and Outputs, and Outputs\n\n // are allowed post-Heartwood, so we have to count Spends.\n\n Transaction::V4 {\n\n shielded_data: Some(shielded_data),\n\n ..\n\n } if shielded_data.spends().count() > 0 => Err(TransactionError::CoinbaseHasSpend),\n\n\n\n Transaction::V4 { .. } => Ok(()),\n\n\n\n Transaction::V1 { .. } | Transaction::V2 { .. } | Transaction::V3 { .. } => {\n\n unreachable!(\"tx version is checked first\")\n\n }\n\n }\n\n } else {\n\n Ok(())\n\n }\n\n}\n","file_path":"zebra-consensus/src/transaction/check.rs","rank":47,"score":110932.39264148785},{"content":"/// Returns `Ok(())` if the `EquihashSolution` is valid for `header`\n\npub fn equihash_solution_is_valid(header: &Header) -> Result<(), equihash::Error> {\n\n header.solution.check(&header)\n\n}\n\n\n","file_path":"zebra-consensus/src/block/check.rs","rank":48,"score":109954.79366477471},{"content":"/// Runs a command\n\npub fn test_cmd(command_path: &str, tempdir: &Path) -> Result<Command> {\n\n let mut cmd = Command::new(command_path);\n\n cmd.current_dir(tempdir);\n\n\n\n Ok(cmd)\n\n}\n\n\n","file_path":"zebra-test/src/command.rs","rank":49,"score":107642.70960847387},{"content":"#[test]\n\n#[spandoc::spandoc]\n\nfn compact_bitcoin_test_vectors() {\n\n zebra_test::init();\n\n\n\n // We use two spans, so we can diagnose conversion panics, and mismatching results\n\n for (compact, expected_expanded, expected_work) in COMPACT_DIFFICULTY_CASES.iter().cloned() {\n\n /// SPANDOC: Convert compact to expanded and work {?compact, ?expected_expanded, ?expected_work}\n\n {\n\n let expected_expanded = expected_expanded.map(U256::from).map(ExpandedDifficulty);\n\n let expected_work = expected_work.map(Work);\n\n\n\n let compact = CompactDifficulty(compact);\n\n let actual_expanded = compact.to_expanded();\n\n let actual_work = compact.to_work();\n\n let canonical_compact = actual_expanded.map(|e| e.to_compact());\n\n let round_trip_expanded = canonical_compact.map(|c| c.to_expanded());\n\n\n\n /// SPANDOC: Test that compact produces the expected expanded and work {?compact, ?expected_expanded, ?actual_expanded, ?expected_work, ?actual_work, ?canonical_compact, ?round_trip_expanded}\n\n {\n\n assert_eq!(actual_expanded, expected_expanded);\n\n if expected_expanded.is_some() {\n\n assert_eq!(round_trip_expanded.unwrap(), actual_expanded);\n\n }\n\n assert_eq!(actual_work, expected_work);\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// Test blocks using CompactDifficulty.\n","file_path":"zebra-chain/src/work/difficulty/tests/vectors.rs","rank":50,"score":106817.95517228471},{"content":"/// Get the heights of the blocks for constructing a block_locator list\n\npub fn block_locator_heights(tip_height: block::Height) -> Vec<block::Height> {\n\n // Stop at the reorg limit, or the genesis block.\n\n let min_locator_height = tip_height\n\n .0\n\n .saturating_sub(constants::MAX_BLOCK_REORG_HEIGHT);\n\n let locators = iter::successors(Some(1u32), |h| h.checked_mul(2))\n\n .flat_map(move |step| tip_height.0.checked_sub(step));\n\n let locators = iter::once(tip_height.0)\n\n .chain(locators)\n\n .take_while(move |&height| height > min_locator_height)\n\n .chain(iter::once(min_locator_height))\n\n .map(block::Height);\n\n\n\n let locators = locators.collect();\n\n tracing::info!(\n\n ?tip_height,\n\n ?min_locator_height,\n\n ?locators,\n\n \"created block locator\"\n\n );\n\n locators\n\n}\n","file_path":"zebra-state/src/util.rs","rank":51,"score":105978.89364351014},{"content":"/// Returns `Ok(())` if the block subsidy and miner fees in `block` are valid for `network`\n\n///\n\n/// [3.9]: https://zips.z.cash/protocol/protocol.pdf#subsidyconcepts\n\npub fn subsidy_is_valid(block: &Block, network: Network) -> Result<(), BlockError> {\n\n let height = block.coinbase_height().ok_or(SubsidyError::NoCoinbase)?;\n\n let coinbase = block.transactions.get(0).ok_or(SubsidyError::NoCoinbase)?;\n\n\n\n let halving_div = subsidy::general::halving_divisor(height, network);\n\n let canopy_activation_height = NetworkUpgrade::Canopy\n\n .activation_height(network)\n\n .expect(\"Canopy activation height is known\");\n\n\n\n // TODO: the sum of the coinbase transaction outputs must be less than or equal to the block subsidy plus transaction fees\n\n\n\n // Check founders reward and funding streams\n\n if height < SLOW_START_INTERVAL {\n\n unreachable!(\n\n \"unsupported block height: callers should handle blocks below {:?}\",\n\n SLOW_START_INTERVAL\n\n )\n\n } else if halving_div.count_ones() != 1 {\n\n unreachable!(\"invalid halving divisor: the halving divisor must be a non-zero power of two\")\n\n } else if height < canopy_activation_height {\n","file_path":"zebra-consensus/src/block/check.rs","rank":52,"score":105978.89364351014},{"content":"pub fn layer<S>(path_root: &Path) -> (impl Layer<S>, Grapher)\n\nwhere\n\n S: Subscriber + for<'span> LookupSpan<'span>,\n\n{\n\n let path = path_root.with_extension(\"folded\");\n\n let (layer, guard) = tracing_flame::FlameLayer::with_file(&path).unwrap();\n\n let layer = layer.with_empty_samples(false).with_threads_collapsed(true);\n\n let flamegrapher = Grapher { guard, path };\n\n (layer, flamegrapher)\n\n}\n\n\n\nimpl Grapher {\n\n pub fn write_flamegraph(&self) -> Result<(), Report> {\n\n self.guard.flush()?;\n\n let out_path = self.path.with_extension(\"svg\");\n\n let inf = File::open(&self.path)?;\n\n let reader = BufReader::new(inf);\n\n\n\n let out = File::create(out_path)?;\n\n let writer = BufWriter::new(out);\n\n\n\n let mut opts = inferno::flamegraph::Options::default();\n\n info!(\"writing flamegraph to disk...\");\n\n inferno::flamegraph::from_reader(&mut opts, reader, writer)?;\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"zebrad/src/components/tracing/flame.rs","rank":53,"score":103938.16342780777},{"content":"/// Initialize a state service from the provided [`Config`].\n\n///\n\n/// Each `network` has its own separate on-disk database.\n\n///\n\n/// To share access to the state, wrap the returned service in a `Buffer`. It's\n\n/// possible to construct multiple state services in the same application (as\n\n/// long as they, e.g., use different storage locations), but doing so is\n\n/// probably not what you want.\n\npub fn init(config: Config, network: Network) -> BoxService<Request, Response, BoxError> {\n\n BoxService::new(StateService::new(config, network))\n\n}\n","file_path":"zebra-state/src/service.rs","rank":54,"score":100538.34526246827},{"content":"/// `BlockSubsidy(height)` as described in [protocol specification §7.7][7.7]\n\n///\n\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\n\npub fn block_subsidy(height: Height, network: Network) -> Result<Amount<NonNegative>, Error> {\n\n let blossom_height = Blossom\n\n .activation_height(network)\n\n .expect(\"blossom activation height should be available\");\n\n let halving_div = halving_divisor(height, network);\n\n\n\n if height < SLOW_START_INTERVAL {\n\n unreachable!(\n\n \"unsupported block height: callers should handle blocks below {:?}\",\n\n SLOW_START_INTERVAL\n\n )\n\n } else if height < blossom_height {\n\n // this calculation is exact, because the halving divisor is 1 here\n\n Amount::try_from(MAX_BLOCK_SUBSIDY / halving_div)\n\n } else {\n\n let scaled_max_block_subsidy = MAX_BLOCK_SUBSIDY / BLOSSOM_POW_TARGET_SPACING_RATIO;\n\n // in future halvings, this calculation might not be exact\n\n // Amount division is implemented using integer division,\n\n // which truncates (rounds down) the result, as specified\n\n Amount::try_from(scaled_max_block_subsidy / halving_div)\n\n }\n\n}\n\n\n\n/// `MinerSubsidy(height)` as described in [protocol specification §7.7][7.7]\n\n///\n\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\n\n///\n\n/// `non_miner_reward` is the founders reward or funding stream value.\n\n/// If all the rewards for a block go to the miner, use `None`.\n","file_path":"zebra-consensus/src/block/subsidy/general.rs","rank":55,"score":97558.88380126149},{"content":"#[cfg(test)]\n\npub fn new_outputs(block: &block::Block) -> std::collections::HashMap<transparent::OutPoint, Utxo> {\n\n use std::collections::HashMap;\n\n\n\n let height = block.coinbase_height().expect(\"block has coinbase height\");\n\n\n\n let mut new_outputs = HashMap::default();\n\n for transaction in &block.transactions {\n\n let hash = transaction.hash();\n\n let from_coinbase = transaction.is_coinbase();\n\n for (index, output) in transaction.outputs().iter().cloned().enumerate() {\n\n let index = index as u32;\n\n new_outputs.insert(\n\n transparent::OutPoint { hash, index },\n\n Utxo {\n\n output,\n\n height,\n\n from_coinbase,\n\n },\n\n );\n\n }\n\n }\n\n\n\n new_outputs\n\n}\n","file_path":"zebra-state/src/utxo.rs","rank":56,"score":97390.11324436357},{"content":"/// `FoundersReward(height)` as described in [protocol specification §7.7][7.7]\n\n///\n\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\n\npub fn founders_reward(height: Height, network: Network) -> Result<Amount<NonNegative>, Error> {\n\n if halving_divisor(height, network) == 1 {\n\n // this calculation is exact, because the block subsidy is divisible by\n\n // the FOUNDERS_FRACTION_DIVISOR until long after the first halving\n\n block_subsidy(height, network)? / FOUNDERS_FRACTION_DIVISOR\n\n } else {\n\n Amount::try_from(0)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use color_eyre::Report;\n\n use zebra_chain::parameters::NetworkUpgrade::*;\n\n #[test]\n\n fn test_founders_reward() -> Result<(), Report> {\n\n zebra_test::init();\n\n\n\n let network = Network::Mainnet;\n","file_path":"zebra-consensus/src/block/subsidy/founders_reward.rs","rank":57,"score":96164.63421794423},{"content":"#[allow(non_snake_case)]\n\npub fn mixing_pedersen_hash(P: jubjub::ExtendedPoint, x: jubjub::Fr) -> jubjub::ExtendedPoint {\n\n const J: [u8; 8] = *b\"Zcash_J_\";\n\n\n\n P + find_group_hash(J, b\"\") * x\n\n}\n\n\n","file_path":"zebra-chain/src/sapling/commitment/pedersen_hashes.rs","rank":58,"score":94827.53214752828},{"content":"#[allow(non_snake_case)]\n\npub fn pedersen_hash(domain: [u8; 8], M: &BitVec<Lsb0, u8>) -> jubjub::Fq {\n\n jubjub::AffinePoint::from(pedersen_hash_to_point(domain, M)).get_u()\n\n}\n\n\n\n/// Mixing Pedersen Hash Function\n\n///\n\n/// Used to compute ρ from a note commitment and its position in the note\n\n/// commitment tree. It takes as input a Pedersen commitment P, and hashes it\n\n/// with another input x.\n\n///\n\n/// MixingPedersenHash(P, x) := P + [x]FindGroupHash^J^(r)(“Zcash_J_”, “”)\n\n///\n\n/// https://zips.z.cash/protocol/protocol.pdf#concretemixinghash\n","file_path":"zebra-chain/src/sapling/commitment/pedersen_hashes.rs","rank":59,"score":94540.72284962196},{"content":"/// Construct a 'windowed' Pedersen commitment by reusing a Pederson hash\n\n/// construction, and adding a randomized point on the Jubjub curve.\n\n///\n\n/// WindowedPedersenCommit_r (s) := \\\n\n/// PedersenHashToPoint(“Zcash_PH”, s) + [r]FindGroupHash^J^(r)(“Zcash_PH”, “r”)\n\n///\n\n/// https://zips.z.cash/protocol/protocol.pdf#concretewindowedcommit\n\npub fn windowed_pedersen_commitment(r: jubjub::Fr, s: &BitVec<Lsb0, u8>) -> jubjub::ExtendedPoint {\n\n const D: [u8; 8] = *b\"Zcash_PH\";\n\n\n\n pedersen_hash_to_point(D, &s) + find_group_hash(D, b\"r\") * r\n\n}\n\n\n","file_path":"zebra-chain/src/sapling/commitment/pedersen_hashes.rs","rank":60,"score":93203.62077920602},{"content":"fn write_coinbase_height<W: io::Write>(height: block::Height, mut w: W) -> Result<(), io::Error> {\n\n // We can't write this as a match statement on stable until exclusive range\n\n // guards are stabilized.\n\n // The Bitcoin encoding requires that the most significant byte is below 0x80,\n\n // so the ranges run up to 2^{n-1} rather than 2^n.\n\n if let 0 = height.0 {\n\n // Genesis block does not include height.\n\n } else if let h @ 1..=16 = height.0 {\n\n w.write_u8(0x50 + (h as u8))?;\n\n } else if let h @ 17..=127 = height.0 {\n\n w.write_u8(0x01)?;\n\n w.write_u8(h as u8)?;\n\n } else if let h @ 128..=32767 = height.0 {\n\n w.write_u8(0x02)?;\n\n w.write_u16::<LittleEndian>(h as u16)?;\n\n } else if let h @ 32768..=8_388_607 = height.0 {\n\n w.write_u8(0x03)?;\n\n w.write_u8(h as u8)?;\n\n w.write_u8((h >> 8) as u8)?;\n\n w.write_u8((h >> 16) as u8)?;\n","file_path":"zebra-chain/src/transparent/serialize.rs","rank":61,"score":92363.42406093364},{"content":"#[allow(non_snake_case)]\n\npub fn pedersen_hash_to_point(domain: [u8; 8], M: &BitVec<Lsb0, u8>) -> jubjub::ExtendedPoint {\n\n let mut result = jubjub::ExtendedPoint::identity();\n\n\n\n // Split M into n segments of 3 * c bits, where c = 63, padding the last\n\n // segment with zeros.\n\n //\n\n // This loop is 1-indexed per the math definitions in the spec.\n\n //\n\n // https://zips.z.cash/protocol/protocol.pdf#concretepedersenhash\n\n for (i, segment) in M\n\n .chunks(189)\n\n .enumerate()\n\n .map(|(i, segment)| (i + 1, segment))\n\n {\n\n result += I_i(domain, i as u32) * M_i(&segment);\n\n }\n\n\n\n result\n\n}\n\n\n\n/// Pedersen Hash Function\n\n///\n\n/// This is technically returning 255 (l_MerkleSapling) bits, not 256.\n\n///\n\n/// https://zips.z.cash/protocol/protocol.pdf#concretepedersenhash\n","file_path":"zebra-chain/src/sapling/commitment/pedersen_hashes.rs","rank":62,"score":91920.22323814643},{"content":"/// Extension trait for methods on `tempdir::TempDir` for using it as a test\n\n/// directory for `zebrad`.\n\ntrait ZebradTestDirExt\n\nwhere\n\n Self: AsRef<Path> + Sized,\n\n{\n\n /// Spawn `zebrad` with `args` as a child process in this test directory,\n\n /// potentially taking ownership of the tempdir for the duration of the\n\n /// child process.\n\n ///\n\n /// If there is a config in the test directory, pass it to `zebrad`.\n\n fn spawn_child(self, args: &[&str]) -> Result<TestChild<Self>>;\n\n\n\n /// Create a config file and use it for all subsequently spawned processes.\n\n /// Returns an error if the config already exists.\n\n ///\n\n /// If needed:\n\n /// - recursively create directories for the config and state\n\n /// - set `config.cache_dir` based on `self`\n\n fn with_config(self, config: &mut ZebradConfig) -> Result<Self>;\n\n\n\n /// Create a config file with the exact contents of `config`, and use it for\n","file_path":"zebrad/tests/acceptance.rs","rank":63,"score":78044.70651738113},{"content":"trait ToAddressWithNetwork {\n\n /// Convert `self` to an `Address`, given the current `network`.\n\n fn to_address(&self, network: Network) -> Address;\n\n}\n\n\n\nimpl ToAddressWithNetwork for Script {\n\n fn to_address(&self, network: Network) -> Address {\n\n Address::PayToScriptHash {\n\n network,\n\n script_hash: Address::hash_payload(&self.0[..]),\n\n }\n\n }\n\n}\n\n\n\nimpl ToAddressWithNetwork for PublicKey {\n\n fn to_address(&self, network: Network) -> Address {\n\n Address::PayToPublicKeyHash {\n\n network,\n\n pub_key_hash: Address::hash_payload(&self.serialize()[..]),\n\n }\n","file_path":"zebra-chain/src/transparent/address.rs","rank":64,"score":78034.4452655006},{"content":"fn main() {\n\n let mut flags = ConstantsFlags::empty();\n\n flags.toggle(ConstantsFlags::SHA_SHORT);\n\n\n\n // We want to use REBUILD_ON_HEAD_CHANGE here, but vergen assumes that the\n\n // git directory is in the crate directory, and Zebra uses a workspace.\n\n // See rustyhorde/vergen#15 and rustyhorde/vergen#21 for details.\n\n let result = generate_rebuild_key();\n\n if let Err(err) = result {\n\n eprintln!(\"Error generating 'cargo:rerun-if-changed': {:?}\", err);\n\n }\n\n\n\n // Generate the 'cargo:' key output\n\n generate_cargo_keys(flags).expect(\"Unable to generate the cargo keys!\");\n\n}\n\n\n","file_path":"zebrad/build.rs","rank":65,"score":77106.2985816294},{"content":"fn transaction_hashes(items: &'_ [InventoryHash]) -> impl Iterator<Item = transaction::Hash> + '_ {\n\n items.iter().filter_map(|item| {\n\n if let InventoryHash::Tx(hash) = item {\n\n Some(*hash)\n\n } else {\n\n None\n\n }\n\n })\n\n}\n\n\n","file_path":"zebra-network/src/peer/connection.rs","rank":66,"score":76222.49256634797},{"content":"fn block_hashes(items: &'_ [InventoryHash]) -> impl Iterator<Item = block::Hash> + '_ {\n\n items.iter().filter_map(|item| {\n\n if let InventoryHash::Block(hash) = item {\n\n Some(*hash)\n\n } else {\n\n None\n\n }\n\n })\n\n}\n","file_path":"zebra-network/src/peer/connection.rs","rank":67,"score":76222.49256634797},{"content":"/// Sync `network` until `zebrad` reaches `height`, and ensure that\n\n/// the output contains `stop_regex`. If `reuse_tempdir` is supplied,\n\n/// use it as the test's temporary directory.\n\n///\n\n/// If `stop_regex` is encountered before the process exits, kills the\n\n/// process, and mark the test as successful, even if `height` has not\n\n/// been reached.\n\n///\n\n/// On success, returns the associated `TempDir`. Returns an error if\n\n/// the child exits or `timeout` elapses before `regex` is found.\n\n///\n\n/// If your test environment does not have network access, skip\n\n/// this test by setting the `ZEBRA_SKIP_NETWORK_TESTS` env var.\n\nfn sync_until(\n\n height: Height,\n\n network: Network,\n\n stop_regex: &str,\n\n timeout: Duration,\n\n reuse_tempdir: Option<TempDir>,\n\n) -> Result<TempDir> {\n\n zebra_test::init();\n\n\n\n if env::var_os(\"ZEBRA_SKIP_NETWORK_TESTS\").is_some() {\n\n // This message is captured by the test runner, use\n\n // `cargo test -- --nocapture` to see it.\n\n eprintln!(\"Skipping network test because '$ZEBRA_SKIP_NETWORK_TESTS' is set.\");\n\n return testdir();\n\n }\n\n\n\n // Use a persistent state, so we can handle large syncs\n\n let mut config = persistent_test_config()?;\n\n // TODO: add convenience methods?\n\n config.network.network = network;\n","file_path":"zebrad/tests/acceptance.rs","rank":68,"score":75622.12339690303},{"content":" // Quick helper trait for making queued blocks with throw away channels\n\n trait IntoQueued {\n\n fn into_queued(self) -> QueuedBlock;\n\n }\n\n\n\n impl IntoQueued for Arc<Block> {\n\n fn into_queued(self) -> QueuedBlock {\n\n let (rsp_tx, _) = oneshot::channel();\n\n (self.prepare(), rsp_tx)\n\n }\n\n }\n\n\n\n #[test]\n\n fn dequeue_gives_right_children() -> Result<()> {\n\n zebra_test::init();\n\n\n\n let block1: Arc<Block> =\n\n zebra_test::vectors::BLOCK_MAINNET_419200_BYTES.zcash_deserialize_into()?;\n\n let child1: Arc<Block> =\n\n zebra_test::vectors::BLOCK_MAINNET_419201_BYTES.zcash_deserialize_into()?;\n\n let child2 = block1.make_fake_child();\n","file_path":"zebra-state/src/service/non_finalized_state/queued_blocks.rs","rank":69,"score":74646.17057690752},{"content":"#[cfg_attr(feature = \"test_sync_to_sapling_mainnet\", test)]\n\nfn sync_to_sapling_mainnet() {\n\n zebra_test::init();\n\n let network = Mainnet;\n\n create_cached_database(network).unwrap();\n\n}\n\n\n\n// Sync to the sapling activation height testnet and stop.\n","file_path":"zebrad/tests/acceptance.rs","rank":70,"score":72899.98261924185},{"content":"/// Compute an index of newly created transparent outputs, given a block and a\n\n/// list of precomputed transaction hashes.\n\nfn new_outputs(\n\n block: &Block,\n\n transaction_hashes: &[transaction::Hash],\n\n) -> Arc<HashMap<transparent::OutPoint, zs::Utxo>> {\n\n let mut new_outputs = HashMap::default();\n\n let height = block.coinbase_height().expect(\"block has coinbase height\");\n\n for (transaction, hash) in block\n\n .transactions\n\n .iter()\n\n .zip(transaction_hashes.iter().cloned())\n\n {\n\n let from_coinbase = transaction.is_coinbase();\n\n for (index, output) in transaction.outputs().iter().cloned().enumerate() {\n\n let index = index as u32;\n\n new_outputs.insert(\n\n transparent::OutPoint { hash, index },\n\n zs::Utxo {\n\n output,\n\n height,\n\n from_coinbase,\n\n },\n\n );\n\n }\n\n }\n\n\n\n Arc::new(new_outputs)\n\n}\n","file_path":"zebra-consensus/src/block.rs","rank":71,"score":72899.98261924185},{"content":"#[cfg_attr(feature = \"test_sync_to_sapling_testnet\", test)]\n\nfn sync_to_sapling_testnet() {\n\n zebra_test::init();\n\n let network = Testnet;\n\n create_cached_database(network).unwrap();\n\n}\n\n\n\n/// Test syncing 1200 blocks (3 checkpoints) past the last checkpoint on mainnet.\n\n///\n\n/// This assumes that the config'd state is already synced at or near Sapling\n\n/// activation on mainnet. If the state has already synced past Sapling\n\n/// activation by 1200 blocks, it will fail.\n","file_path":"zebrad/tests/acceptance.rs","rank":72,"score":72899.98261924185},{"content":"#[cfg_attr(feature = \"test_sync_past_sapling_mainnet\", test)]\n\nfn sync_past_sapling_mainnet() {\n\n zebra_test::init();\n\n let network = Mainnet;\n\n sync_past_sapling(network).unwrap();\n\n}\n\n\n\n/// Test syncing 1200 blocks (3 checkpoints) past the last checkpoint on testnet.\n\n///\n\n/// This assumes that the config'd state is already synced at or near Sapling\n\n/// activation on testnet. If the state has already synced past Sapling\n\n/// activation by 1200 blocks, it will fail.\n","file_path":"zebrad/tests/acceptance.rs","rank":73,"score":71654.5600450422},{"content":"#[cfg_attr(feature = \"test_sync_past_sapling_testnet\", test)]\n\nfn sync_past_sapling_testnet() {\n\n zebra_test::init();\n\n let network = Testnet;\n\n sync_past_sapling(network).unwrap();\n\n}\n\n\n","file_path":"zebrad/tests/acceptance.rs","rank":74,"score":71654.5600450422},{"content":"#[test]\n\nfn memo_fmt() {\n\n zebra_test::init();\n\n\n\n let memo = Memo(Box::new(\n\n *b\"thiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis \\\n\n iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis \\\n\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa \\\n\n veeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeryyyyyyyyyyyyyyyyyyyyyyyyyy \\\n\n looooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooong \\\n\n meeeeeeeeeeeeeeeeeeemooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo \\\n\n but it's just short enough\",\n\n ));\n\n\n\n assert_eq!(format!(\"{:?}\", memo),\n\n \"Memo(\\\"thiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa veeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeryyyyyyyyyyyyyyyyyyyyyyyyyy looooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooong meeeeeeeeeeeeeeeeeeemooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo but it\\\\\\'s just short enough\\\")\"\n\n );\n\n\n\n let mut some_bytes = [0u8; 512];\n\n some_bytes[0] = 0xF6;\n\n\n\n assert_eq!(format!(\"{:?}\", Memo(Box::new(some_bytes))),\n\n \"Memo(\\\"f600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\\\")\"\n\n );\n\n}\n\n\n","file_path":"zebra-chain/src/transaction/memo.rs","rank":75,"score":71654.5600450422},{"content":"#[test]\n\nfn memo_from_string() {\n\n zebra_test::init();\n\n\n\n let memo = Memo::try_from(\"foo bar baz\".as_ref()).unwrap();\n\n\n\n let mut bytes = [0; 512];\n\n bytes[0..11].copy_from_slice(&[102, 111, 111, 32, 98, 97, 114, 32, 98, 97, 122]);\n\n\n\n assert!(memo.0.iter().eq(bytes.iter()));\n\n}\n","file_path":"zebra-chain/src/transaction/memo.rs","rank":76,"score":71654.5600450422},{"content":"#[test]\n\nfn operator_tests() {\n\n zebra_test::init();\n\n\n\n assert_eq!(Some(Height(2)), Height(1) + Height(1));\n\n assert_eq!(None, Height::MAX + Height(1));\n\n // Bad heights aren't caught at compile-time or runtime, until we add or subtract\n\n assert_eq!(None, Height(Height::MAX_AS_U32 + 1) + Height(0));\n\n assert_eq!(None, Height(i32::MAX as u32) + Height(0));\n\n assert_eq!(None, Height(u32::MAX) + Height(0));\n\n\n\n assert_eq!(Some(Height(2)), Height(1) + 1);\n\n assert_eq!(None, Height::MAX + 1);\n\n // Adding negative numbers\n\n assert_eq!(Some(Height(1)), Height(2) + -1);\n\n assert_eq!(Some(Height(0)), Height(1) + -1);\n\n assert_eq!(None, Height(0) + -1);\n\n assert_eq!(Some(Height(Height::MAX_AS_U32 - 1)), Height::MAX + -1);\n\n // Bad heights aren't caught at compile-time or runtime, until we add or subtract\n\n // `+ 0` would also cause an error here, but it triggers a spurious clippy lint\n\n assert_eq!(None, Height(Height::MAX_AS_U32 + 1) + 1);\n","file_path":"zebra-chain/src/block/height.rs","rank":77,"score":71654.5600450422},{"content":"/// Returns `ValidateContextError::OrphanedBlock` if the height of the given\n\n/// block is less than or equal to the finalized tip height.\n\nfn block_is_not_orphaned(\n\n finalized_tip_height: block::Height,\n\n candidate_height: block::Height,\n\n) -> Result<(), ValidateContextError> {\n\n if candidate_height <= finalized_tip_height {\n\n Err(ValidateContextError::OrphanedBlock {\n\n candidate_height,\n\n finalized_tip_height,\n\n })\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"zebra-state/src/service/check.rs","rank":78,"score":71654.5600450422},{"content":"#[test]\n\nfn activation_bijective() {\n\n zebra_test::init();\n\n\n\n let mainnet_activations = NetworkUpgrade::activation_list(Mainnet);\n\n let mainnet_heights: HashSet<&block::Height> = mainnet_activations.keys().collect();\n\n assert_eq!(MAINNET_ACTIVATION_HEIGHTS.len(), mainnet_heights.len());\n\n\n\n let mainnet_nus: HashSet<&NetworkUpgrade> = mainnet_activations.values().collect();\n\n assert_eq!(MAINNET_ACTIVATION_HEIGHTS.len(), mainnet_nus.len());\n\n\n\n let testnet_activations = NetworkUpgrade::activation_list(Testnet);\n\n let testnet_heights: HashSet<&block::Height> = testnet_activations.keys().collect();\n\n assert_eq!(TESTNET_ACTIVATION_HEIGHTS.len(), testnet_heights.len());\n\n\n\n let testnet_nus: HashSet<&NetworkUpgrade> = testnet_activations.values().collect();\n\n assert_eq!(TESTNET_ACTIVATION_HEIGHTS.len(), testnet_nus.len());\n\n}\n\n\n","file_path":"zebra-chain/src/parameters/tests.rs","rank":79,"score":71654.5600450422},{"content":"/// Helper trait to organize inverse operations done on the `Chain` type. Used to\n\n/// overload the `update_chain_state_with` and `revert_chain_state_with` methods\n\n/// based on the type of the argument.\n\n///\n\n/// This trait was motivated by the length of the `push` and `pop_root` functions\n\n/// and fear that it would be easy to introduce bugs when updating them unless\n\n/// the code was reorganized to keep related operations adjacent to eachother.\n\ntrait UpdateWith<T> {\n\n /// Update `Chain` cumulative data members to add data that are derived from\n\n /// `T`\n\n fn update_chain_state_with(&mut self, _: &T);\n\n\n\n /// Update `Chain` cumulative data members to remove data that are derived\n\n /// from `T`\n\n fn revert_chain_state_with(&mut self, _: &T);\n\n}\n\n\n\nimpl UpdateWith<PreparedBlock> for Chain {\n\n fn update_chain_state_with(&mut self, prepared: &PreparedBlock) {\n\n let (block, hash, height, transaction_hashes) = (\n\n prepared.block.as_ref(),\n\n prepared.hash,\n\n prepared.height,\n\n &prepared.transaction_hashes,\n\n );\n\n\n\n // add hash to height_by_hash\n","file_path":"zebra-state/src/service/non_finalized_state/chain.rs","rank":80,"score":71248.98282590837},{"content":"/// Validate the time and `difficulty_threshold` from a candidate block's\n\n/// header.\n\n///\n\n/// Uses the `difficulty_adjustment` context for the block to:\n\n/// * check that the candidate block's time is within the valid range,\n\n/// based on the network and candidate height, and\n\n/// * check that the expected difficulty is equal to the block's\n\n/// `difficulty_threshold`.\n\n///\n\n/// These checks are performed together, because the time field is used to\n\n/// calculate the expected difficulty adjustment.\n\nfn difficulty_threshold_is_valid(\n\n difficulty_threshold: CompactDifficulty,\n\n difficulty_adjustment: AdjustedDifficulty,\n\n) -> Result<(), ValidateContextError> {\n\n // Check the block header time consensus rules from the Zcash specification\n\n let candidate_height = difficulty_adjustment.candidate_height();\n\n let candidate_time = difficulty_adjustment.candidate_time();\n\n let network = difficulty_adjustment.network();\n\n let median_time_past = difficulty_adjustment.median_time_past();\n\n let block_time_max =\n\n median_time_past + Duration::seconds(difficulty::BLOCK_MAX_TIME_SINCE_MEDIAN);\n\n if candidate_time <= median_time_past {\n\n Err(ValidateContextError::TimeTooEarly {\n\n candidate_time,\n\n median_time_past,\n\n })?\n\n }\n\n\n\n // The maximum time rule is only active on Testnet from a specific height\n\n if NetworkUpgrade::is_max_block_time_enforced(network, candidate_height)\n","file_path":"zebra-state/src/service/check.rs","rank":81,"score":70481.86033722859},{"content":"#[test]\n\nfn deserialize_blockheader() {\n\n zebra_test::init();\n\n\n\n // Includes the 32-byte nonce and 3-byte equihash length field.\n\n const BLOCK_HEADER_LENGTH: usize = crate::work::equihash::Solution::INPUT_LENGTH\n\n + 32\n\n + 3\n\n + crate::work::equihash::SOLUTION_SIZE;\n\n\n\n for block in zebra_test::vectors::BLOCKS.iter() {\n\n let header_bytes = &block[..BLOCK_HEADER_LENGTH];\n\n\n\n let _header = header_bytes\n\n .zcash_deserialize_into::<Header>()\n\n .expect(\"blockheader test vector should deserialize\");\n\n }\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/vectors.rs","rank":82,"score":70476.83311990302},{"content":"#[test]\n\nfn blockheaderhash_from_blockheader() {\n\n zebra_test::init();\n\n\n\n let blockheader = generate::block_header();\n\n\n\n let hash = Hash::from(&blockheader);\n\n\n\n assert_eq!(\n\n format!(\"{:?}\", hash),\n\n \"block::Hash(\\\"d1d6974bbe1d4d127c889119b2fc05724c67588dc72708839727586b8c2bc939\\\")\"\n\n );\n\n\n\n let mut bytes = Cursor::new(Vec::new());\n\n\n\n blockheader\n\n .zcash_serialize(&mut bytes)\n\n .expect(\"these bytes to serialize from a blockheader without issue\");\n\n\n\n bytes.set_position(0);\n\n let other_header = bytes\n\n .zcash_deserialize_into()\n\n .expect(\"these bytes to deserialize into a blockheader without issue\");\n\n\n\n assert_eq!(blockheader, other_header);\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/vectors.rs","rank":83,"score":70476.83311990302},{"content":"#[test]\n\nfn blockheaderhash_debug() {\n\n zebra_test::init();\n\n\n\n let preimage = b\"foo bar baz\";\n\n let mut sha_writer = sha256d::Writer::default();\n\n let _ = sha_writer.write_all(preimage);\n\n\n\n let hash = Hash(sha_writer.finish());\n\n\n\n assert_eq!(\n\n format!(\"{:?}\", hash),\n\n \"block::Hash(\\\"3166411bd5343e0b284a108f39a929fbbb62619784f8c6dafe520703b5b446bf\\\")\"\n\n );\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/vectors.rs","rank":84,"score":70476.83311990302},{"content":"#[test]\n\nfn deserialize_block() {\n\n zebra_test::init();\n\n\n\n // this one has a bad version field\n\n zebra_test::vectors::BLOCK_MAINNET_434873_BYTES\n\n .zcash_deserialize_into::<Block>()\n\n .expect(\"block test vector should deserialize\");\n\n\n\n for block_bytes in zebra_test::vectors::BLOCKS.iter() {\n\n let block = block_bytes\n\n .zcash_deserialize_into::<Block>()\n\n .expect(\"block is structurally valid\");\n\n\n\n let round_trip_bytes = block\n\n .zcash_serialize_to_vec()\n\n .expect(\"vec serialization is infallible\");\n\n\n\n assert_eq!(&round_trip_bytes[..], *block_bytes);\n\n }\n\n}\n\n\n","file_path":"zebra-chain/src/block/tests/vectors.rs","rank":85,"score":70476.83311990302},{"content":"#[test]\n\nfn branch_id_bijective() {\n\n zebra_test::init();\n\n\n\n let branch_id_list = NetworkUpgrade::branch_id_list();\n\n let nus: HashSet<&NetworkUpgrade> = branch_id_list.keys().collect();\n\n assert_eq!(CONSENSUS_BRANCH_IDS.len(), nus.len());\n\n\n\n let branch_ids: HashSet<&ConsensusBranchId> = branch_id_list.values().collect();\n\n assert_eq!(CONSENSUS_BRANCH_IDS.len(), branch_ids.len());\n\n}\n\n\n","file_path":"zebra-chain/src/parameters/tests.rs","rank":86,"score":70476.83311990302},{"content":"#[test]\n\nfn activation_extremes_mainnet() {\n\n zebra_test::init();\n\n activation_extremes(Mainnet)\n\n}\n\n\n","file_path":"zebra-chain/src/parameters/tests.rs","rank":87,"score":70476.83311990302},{"content":"#[test]\n\nfn activation_consistent_testnet() {\n\n zebra_test::init();\n\n activation_consistent(Testnet)\n\n}\n\n\n","file_path":"zebra-chain/src/parameters/tests.rs","rank":88,"score":70476.83311990302},{"content":"#[test]\n\nfn activation_extremes_testnet() {\n\n zebra_test::init();\n\n activation_extremes(Testnet)\n\n}\n\n\n","file_path":"zebra-chain/src/parameters/tests.rs","rank":89,"score":70476.83311990302},{"content":"#[test]\n\nfn round_trip_work_expanded() {\n\n zebra_test::init();\n\n\n\n proptest!(|(work_before in any::<Work>())| {\n\n let work: U256 = work_before.as_u128().into();\n\n let expanded = work_to_expanded(work);\n\n let work_after = Work::try_from(expanded).unwrap();\n\n prop_assert_eq!(work_before, work_after);\n\n });\n\n}\n\n\n\n/// Check that the block locator heights are sensible.\n","file_path":"zebra-state/src/tests.rs","rank":90,"score":70476.83311990302},{"content":"#[test]\n\nfn activation_consistent_mainnet() {\n\n zebra_test::init();\n\n activation_consistent(Mainnet)\n\n}\n\n\n","file_path":"zebra-chain/src/parameters/tests.rs","rank":91,"score":70476.83311990302},{"content":"#[test]\n\nfn minimum_difficulty_mainnet() {\n\n minimum_difficulty(Mainnet)\n\n}\n\n\n","file_path":"zebra-consensus/src/parameters/tests.rs","rank":92,"score":70476.83311990302},{"content":"#[test]\n\nfn test_block_locator_heights() {\n\n zebra_test::init();\n\n\n\n for (height, min_height) in BLOCK_LOCATOR_CASES.iter().cloned() {\n\n let locator = util::block_locator_heights(block::Height(height));\n\n\n\n assert!(!locator.is_empty(), \"locators must not be empty\");\n\n if (height - min_height) > 1 {\n\n assert!(\n\n locator.len() > 2,\n\n \"non-trivial locators must have some intermediate heights\"\n\n );\n\n }\n\n\n\n assert_eq!(\n\n locator[0],\n\n block::Height(height),\n\n \"locators must start with the tip height\"\n\n );\n\n\n","file_path":"zebra-state/src/tests.rs","rank":93,"score":70476.83311990302},{"content":"#[test]\n\nfn minimum_difficulty_testnet() {\n\n minimum_difficulty(Testnet)\n\n}\n\n\n","file_path":"zebra-consensus/src/parameters/tests.rs","rank":94,"score":70476.83311990302},{"content":"fn parse_coinbase_height(\n\n mut data: Vec<u8>,\n\n) -> Result<(block::Height, CoinbaseData), SerializationError> {\n\n use block::Height;\n\n match (data.get(0), data.len()) {\n\n // Blocks 1 through 16 inclusive encode block height with OP_N opcodes.\n\n (Some(op_n @ 0x51..=0x60), len) if len >= 1 => Ok((\n\n Height((op_n - 0x50) as u32),\n\n CoinbaseData(data.split_off(1)),\n\n )),\n\n // Blocks 17 through 128 exclusive encode block height with the `0x01` opcode.\n\n // The Bitcoin encoding requires that the most significant byte is below 0x80.\n\n (Some(0x01), len) if len >= 2 && data[1] < 0x80 => {\n\n Ok((Height(data[1] as u32), CoinbaseData(data.split_off(2))))\n\n }\n\n // Blocks 128 through 32768 exclusive encode block height with the `0x02` opcode.\n\n // The Bitcoin encoding requires that the most significant byte is below 0x80.\n\n (Some(0x02), len) if len >= 3 && data[2] < 0x80 => Ok((\n\n Height(data[1] as u32 + ((data[2] as u32) << 8)),\n\n CoinbaseData(data.split_off(3)),\n","file_path":"zebra-chain/src/transparent/serialize.rs","rank":95,"score":70476.83311990302},{"content":"#[test]\n\nfn help_no_args() -> Result<()> {\n\n zebra_test::init();\n\n\n\n let testdir = testdir()?.with_config(&mut default_test_config()?)?;\n\n\n\n let child = testdir.spawn_child(&[\"help\"])?;\n\n let output = child.wait_with_output()?;\n\n let output = output.assert_success()?;\n\n\n\n // First line haves the version\n\n output.stdout_contains(r\"zebrad [0-9].[0-9].[0-9]\")?;\n\n\n\n // Make sure we are in help by looking usage string\n\n output.stdout_contains(r\"USAGE:\")?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"zebrad/tests/acceptance.rs","rank":96,"score":70079.53676886884},{"content":"#[test]\n\nfn generate_no_args() -> Result<()> {\n\n zebra_test::init();\n\n\n\n let child = testdir()?\n\n .with_config(&mut default_test_config()?)?\n\n .spawn_child(&[\"generate\"])?;\n\n\n\n let output = child.wait_with_output()?;\n\n let output = output.assert_success()?;\n\n\n\n // First line\n\n output.stdout_contains(r\"# Default configuration for zebrad.\")?;\n\n\n\n Ok(())\n\n}\n\n\n\n/// Panics if `$pred` is false, with an error report containing:\n\n/// * context from `$source`, and\n\n/// * an optional wrapper error, using `$fmt_arg`+ as a format string and\n\n/// arguments.\n","file_path":"zebrad/tests/acceptance.rs","rank":97,"score":70079.53676886884},{"content":"#[test]\n\nfn help_args() -> Result<()> {\n\n zebra_test::init();\n\n\n\n let testdir = testdir()?;\n\n let testdir = &testdir;\n\n\n\n // The subcommand \"argument\" wasn't recognized.\n\n let child = testdir.spawn_child(&[\"help\", \"argument\"])?;\n\n let output = child.wait_with_output()?;\n\n output.assert_failure()?;\n\n\n\n // option `-f` does not accept an argument\n\n let child = testdir.spawn_child(&[\"help\", \"-f\"])?;\n\n let output = child.wait_with_output()?;\n\n output.assert_failure()?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"zebrad/tests/acceptance.rs","rank":98,"score":70079.53676886884},{"content":"#[test]\n\nfn generate_args() -> Result<()> {\n\n zebra_test::init();\n\n\n\n let testdir = testdir()?;\n\n let testdir = &testdir;\n\n\n\n // unexpected free argument `argument`\n\n let child = testdir.spawn_child(&[\"generate\", \"argument\"])?;\n\n let output = child.wait_with_output()?;\n\n output.assert_failure()?;\n\n\n\n // unrecognized option `-f`\n\n let child = testdir.spawn_child(&[\"generate\", \"-f\"])?;\n\n let output = child.wait_with_output()?;\n\n output.assert_failure()?;\n\n\n\n // missing argument to option `-o`\n\n let child = testdir.spawn_child(&[\"generate\", \"-o\"])?;\n\n let output = child.wait_with_output()?;\n\n output.assert_failure()?;\n","file_path":"zebrad/tests/acceptance.rs","rank":99,"score":70079.53676886884}],"string":"[\n {\n \"content\": \"/// Check that if there are no Spends or Outputs, that valueBalance is also 0.\\n\\n///\\n\\n/// https://zips.z.cash/protocol/canopy.pdf#consensusfrombitcoin\\n\\npub fn shielded_balances_match(\\n\\n shielded_data: &ShieldedData,\\n\\n value_balance: Amount,\\n\\n) -> Result<(), TransactionError> {\\n\\n if (shielded_data.spends().count() + shielded_data.outputs().count() != 0)\\n\\n || i64::from(value_balance) == 0\\n\\n {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(TransactionError::BadBalance)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/transaction/check.rs\",\n \"rank\": 0,\n \"score\": 179679.0377715845\n },\n {\n \"content\": \"/// The divisor used for halvings.\\n\\n///\\n\\n/// `1 << Halving(height)`, as described in [protocol specification §7.7][7.7]\\n\\n///\\n\\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\\n\\npub fn halving_divisor(height: Height, network: Network) -> u64 {\\n\\n let blossom_height = Blossom\\n\\n .activation_height(network)\\n\\n .expect(\\\"blossom activation height should be available\\\");\\n\\n\\n\\n if height < SLOW_START_SHIFT {\\n\\n unreachable!(\\n\\n \\\"unsupported block height: callers should handle blocks below {:?}\\\",\\n\\n SLOW_START_SHIFT\\n\\n )\\n\\n } else if height < blossom_height {\\n\\n let scaled_pre_blossom_height = (height - SLOW_START_SHIFT) as u64;\\n\\n let halving_shift = scaled_pre_blossom_height / (PRE_BLOSSOM_HALVING_INTERVAL.0 as u64);\\n\\n 1 << halving_shift\\n\\n } else {\\n\\n let scaled_pre_blossom_height =\\n\\n (blossom_height - SLOW_START_SHIFT) as u64 * BLOSSOM_POW_TARGET_SPACING_RATIO;\\n\\n let post_blossom_height = (height - blossom_height) as u64;\\n\\n let halving_shift = (scaled_pre_blossom_height + post_blossom_height)\\n\\n / (POST_BLOSSOM_HALVING_INTERVAL.0 as u64);\\n\\n 1 << halving_shift\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/block/subsidy/general.rs\",\n \"rank\": 1,\n \"score\": 167477.41815405432\n },\n {\n \"content\": \"/// Generates a random scalar from the scalar field 𝔽_{r_𝕁}.\\n\\n///\\n\\n/// The prime order subgroup 𝕁^(r) is the order-r_𝕁 subgroup of 𝕁 that consists\\n\\n/// of the points whose order divides r. This function is useful when generating\\n\\n/// the uniform distribution on 𝔽_{r_𝕁} needed for Sapling commitment schemes'\\n\\n/// trapdoor generators.\\n\\n///\\n\\n/// https://zips.z.cash/protocol/protocol.pdf#jubjub\\n\\npub fn generate_trapdoor<T>(csprng: &mut T) -> jubjub::Fr\\n\\nwhere\\n\\n T: RngCore + CryptoRng,\\n\\n{\\n\\n let mut bytes = [0u8; 64];\\n\\n csprng.fill_bytes(&mut bytes);\\n\\n // Fr::from_bytes_wide() reduces the input modulo r via Fr::from_u512()\\n\\n jubjub::Fr::from_bytes_wide(&bytes)\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/sapling/commitment/pedersen_hashes.rs\",\n \"rank\": 2,\n \"score\": 158961.34905929468\n },\n {\n \"content\": \"/// A trait for defining constraints on `Amount`\\n\\npub trait Constraint {\\n\\n /// Returns the range of values that are valid under this constraint\\n\\n fn valid_range() -> RangeInclusive<i64>;\\n\\n\\n\\n /// Check if an input value is within the valid range\\n\\n fn validate(value: i64) -> Result<i64, Error> {\\n\\n let range = Self::valid_range();\\n\\n\\n\\n if !range.contains(&value) {\\n\\n Err(Error::Contains { range, value })\\n\\n } else {\\n\\n Ok(value)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ZcashSerialize for Amount<NegativeAllowed> {\\n\\n fn zcash_serialize<W: std::io::Write>(&self, mut writer: W) -> Result<(), std::io::Error> {\\n\\n writer.write_i64::<LittleEndian>(self.0)\\n\\n }\\n\",\n \"file_path\": \"zebra-chain/src/amount.rs\",\n \"rank\": 4,\n \"score\": 150997.21627181285\n },\n {\n \"content\": \"/// Mocks computation done during semantic validation\\n\\npub trait Prepare {\\n\\n fn prepare(self) -> PreparedBlock;\\n\\n}\\n\\n\\n\\nimpl Prepare for Arc<Block> {\\n\\n fn prepare(self) -> PreparedBlock {\\n\\n let block = self;\\n\\n let hash = block.hash();\\n\\n let height = block.coinbase_height().unwrap();\\n\\n let transaction_hashes = block.transactions.iter().map(|tx| tx.hash()).collect();\\n\\n let new_outputs = crate::utxo::new_outputs(&block);\\n\\n\\n\\n PreparedBlock {\\n\\n block,\\n\\n hash,\\n\\n height,\\n\\n new_outputs,\\n\\n transaction_hashes,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-state/src/tests.rs\",\n \"rank\": 5,\n \"score\": 150991.62484954382\n },\n {\n \"content\": \" pub trait Sealed {}\\n\\n impl Sealed for Bctv14Proof {}\\n\\n impl Sealed for Groth16Proof {}\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/primitives/proofs.rs\",\n \"rank\": 6,\n \"score\": 148472.09560570936\n },\n {\n \"content\": \"pub trait CommandExt {\\n\\n /// wrapper for `status` fn on `Command` that constructs informative error\\n\\n /// reports\\n\\n fn status2(&mut self) -> Result<TestStatus, Report>;\\n\\n\\n\\n /// wrapper for `output` fn on `Command` that constructs informative error\\n\\n /// reports\\n\\n fn output2(&mut self) -> Result<TestOutput<NoDir>, Report>;\\n\\n\\n\\n /// wrapper for `spawn` fn on `Command` that constructs informative error\\n\\n /// reports\\n\\n fn spawn2<T>(&mut self, dir: T) -> Result<TestChild<T>, Report>;\\n\\n}\\n\\n\\n\\nimpl CommandExt for Command {\\n\\n /// wrapper for `status` fn on `Command` that constructs informative error\\n\\n /// reports\\n\\n fn status2(&mut self) -> Result<TestStatus, Report> {\\n\\n let cmd = format!(\\\"{:?}\\\", self);\\n\\n let status = self.status();\\n\",\n \"file_path\": \"zebra-test/src/command.rs\",\n \"rank\": 7,\n \"score\": 148472.09560570936\n },\n {\n \"content\": \"/// Extension trait for methods on `tempdir::TempDir` for using it as a test\\n\\n/// directory with an arbitrary command.\\n\\n///\\n\\n/// This trait is separate from `ZebradTestDirExt`, so that we can test\\n\\n/// `zebra_test::command` without running `zebrad`.\\n\\npub trait TestDirExt\\n\\nwhere\\n\\n Self: AsRef<Path> + Sized,\\n\\n{\\n\\n /// Spawn `cmd` with `args` as a child process in this test directory,\\n\\n /// potentially taking ownership of the tempdir for the duration of the\\n\\n /// child process.\\n\\n fn spawn_child_with_command(self, cmd: &str, args: &[&str]) -> Result<TestChild<Self>>;\\n\\n}\\n\\n\\n\\nimpl<T> TestDirExt for T\\n\\nwhere\\n\\n Self: AsRef<Path> + Sized,\\n\\n{\\n\\n fn spawn_child_with_command(self, cmd: &str, args: &[&str]) -> Result<TestChild<Self>> {\\n\\n let mut cmd = test_cmd(cmd, self.as_ref())?;\\n\\n\\n\\n Ok(cmd\\n\\n .args(args)\\n\\n .stdout(Stdio::piped())\\n\",\n \"file_path\": \"zebra-test/src/command.rs\",\n \"rank\": 8,\n \"score\": 146099.584949553\n },\n {\n \"content\": \"/// Helper trait for constructing \\\"valid\\\" looking chains of blocks\\n\\npub trait FakeChainHelper {\\n\\n fn make_fake_child(&self) -> Arc<Block>;\\n\\n\\n\\n fn set_work(self, work: u128) -> Arc<Block>;\\n\\n}\\n\\n\\n\\nimpl FakeChainHelper for Arc<Block> {\\n\\n fn make_fake_child(&self) -> Arc<Block> {\\n\\n let parent_hash = self.hash();\\n\\n let mut child = Block::clone(self);\\n\\n let mut transactions = mem::take(&mut child.transactions);\\n\\n let mut tx = transactions.remove(0);\\n\\n\\n\\n let input = match Arc::make_mut(&mut tx) {\\n\\n Transaction::V1 { inputs, .. } => &mut inputs[0],\\n\\n Transaction::V2 { inputs, .. } => &mut inputs[0],\\n\\n Transaction::V3 { inputs, .. } => &mut inputs[0],\\n\\n Transaction::V4 { inputs, .. } => &mut inputs[0],\\n\\n };\\n\\n\\n\",\n \"file_path\": \"zebra-state/src/tests.rs\",\n \"rank\": 9,\n \"score\": 146094.93732292362\n },\n {\n \"content\": \"/// Initialize globals for tests such as the tracing subscriber and panic / error\\n\\n/// reporting hooks\\n\\npub fn init() {\\n\\n INIT.call_once(|| {\\n\\n let fmt_layer = fmt::layer().with_target(false);\\n\\n // Use the RUST_LOG env var, or by default:\\n\\n // - warn for most tests, and\\n\\n // - for some modules, hide expected warn logs\\n\\n let filter_layer = EnvFilter::try_from_default_env().unwrap_or_else(|_| {\\n\\n EnvFilter::try_new(\\\"warn\\\")\\n\\n .unwrap()\\n\\n .add_directive(\\\"zebra_consensus=error\\\".parse().unwrap())\\n\\n });\\n\\n\\n\\n tracing_subscriber::registry()\\n\\n .with(filter_layer)\\n\\n .with(fmt_layer)\\n\\n .with(ErrorLayer::default())\\n\\n .init();\\n\\n\\n\\n color_eyre::config::HookBuilder::default()\\n\\n .add_frame_filter(Box::new(|frames| {\\n\",\n \"file_path\": \"zebra-test/src/lib.rs\",\n \"rank\": 10,\n \"score\": 145176.4983604153\n },\n {\n \"content\": \"/// A marker trait used to abstract over BCTV14 or Groth16 proofs.\\n\\npub trait ZkSnarkProof:\\n\\n Copy\\n\\n + Clone\\n\\n + Debug\\n\\n + PartialEq\\n\\n + Eq\\n\\n + Serialize\\n\\n + DeserializeOwned\\n\\n + ZcashSerialize\\n\\n + ZcashDeserialize\\n\\n + private::Sealed\\n\\n{\\n\\n}\\n\\nimpl ZkSnarkProof for Bctv14Proof {}\\n\\nimpl ZkSnarkProof for Groth16Proof {}\\n\\n\\n\\nmod private {\\n\\n use super::*;\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/primitives/proofs.rs\",\n \"rank\": 11,\n \"score\": 143843.59272669425\n },\n {\n \"content\": \"/// Helper for deserializing more succinctly via type inference\\n\\npub trait ZcashDeserializeInto {\\n\\n /// Deserialize based on type inference\\n\\n fn zcash_deserialize_into<T>(self) -> Result<T, SerializationError>\\n\\n where\\n\\n T: ZcashDeserialize;\\n\\n}\\n\\n\\n\\nimpl<R: io::Read> ZcashDeserializeInto for R {\\n\\n fn zcash_deserialize_into<T>(self) -> Result<T, SerializationError>\\n\\n where\\n\\n T: ZcashDeserialize,\\n\\n {\\n\\n T::zcash_deserialize(self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/serialization/zcash_deserialize.rs\",\n \"rank\": 12,\n \"score\": 143833.01784375135\n },\n {\n \"content\": \"/// Add context to an error report\\n\\npub trait ContextFrom<S> {\\n\\n type Return;\\n\\n\\n\\n fn context_from(self, source: S) -> Self::Return;\\n\\n}\\n\\n\\n\\nimpl<C, T, E> ContextFrom<C> for Result<T, E>\\n\\nwhere\\n\\n E: Into<Report>,\\n\\n Report: ContextFrom<C, Return = Report>,\\n\\n{\\n\\n type Return = Result<T, Report>;\\n\\n\\n\\n fn context_from(self, source: C) -> Self::Return {\\n\\n self.map_err(|e| e.into())\\n\\n .map_err(|report| report.context_from(source))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ContextFrom<&TestStatus> for Report {\\n\",\n \"file_path\": \"zebra-test/src/command.rs\",\n \"rank\": 13,\n \"score\": 142964.8837292677\n },\n {\n \"content\": \"/// Use the provided TCP connection to create a Zcash connection completely\\n\\n/// isolated from all other node state.\\n\\n///\\n\\n/// The connection pool returned by `init` should be used for all requests that\\n\\n/// don't require isolated state or use of an existing TCP connection. However,\\n\\n/// this low-level API is useful for custom network crawlers or Tor connections.\\n\\n///\\n\\n/// In addition to being completely isolated from all other node state, this\\n\\n/// method also aims to be minimally distinguishable from other clients.\\n\\n///\\n\\n/// Note that this method does not implement any timeout behavior, so callers may\\n\\n/// want to layer it with a timeout as appropriate for their application.\\n\\n///\\n\\n/// # Inputs\\n\\n///\\n\\n/// - `conn`: an existing TCP connection to use. Passing an existing TCP\\n\\n/// connection allows this method to be used with clearnet or Tor transports.\\n\\n///\\n\\n/// - `user_agent`: a valid BIP14 user-agent, e.g., the empty string.\\n\\n///\\n\\n/// # Bug\\n\\n///\\n\\n/// `connect_isolated` only works on `Mainnet`, see #1687.\\n\\npub fn connect_isolated(\\n\\n conn: TcpStream,\\n\\n user_agent: String,\\n\\n) -> impl Future<\\n\\n Output = Result<\\n\\n BoxService<Request, Response, Box<dyn std::error::Error + Send + Sync + 'static>>,\\n\\n Box<dyn std::error::Error + Send + Sync + 'static>,\\n\\n >,\\n\\n> {\\n\\n let handshake = peer::Handshake::builder()\\n\\n .with_config(Config::default())\\n\\n .with_inbound_service(tower::service_fn(|_req| async move {\\n\\n Ok::<Response, Box<dyn std::error::Error + Send + Sync + 'static>>(Response::Nil)\\n\\n }))\\n\\n .with_user_agent(user_agent)\\n\\n .finish()\\n\\n .expect(\\\"provided mandatory builder parameters\\\");\\n\\n\\n\\n // We can't get the remote addr from conn, because it might be a tcp\\n\\n // connection through a socks proxy, not directly to the remote. But it\\n\\n // doesn't seem like zcashd cares if we give a bogus one, and Zebra doesn't\\n\\n // touch it at all.\\n\\n let remote_addr = \\\"0.0.0.0:8233\\\".parse().unwrap();\\n\\n\\n\\n Oneshot::new(handshake, (conn, remote_addr)).map_ok(|client| BoxService::new(Wrapper(client)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-network/src/isolated.rs\",\n \"rank\": 14,\n \"score\": 142678.51441247523\n },\n {\n \"content\": \"/// Sets the Zebra shutdown flag to `true`.\\n\\npub fn set_shutting_down() {\\n\\n IS_SHUTTING_DOWN.store(true, Ordering::SeqCst);\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/shutdown.rs\",\n \"rank\": 15,\n \"score\": 142672.7842686008\n },\n {\n \"content\": \"// Helper trait for defining the exact format used to interact with disk per\\n\\n// type.\\n\\npub trait IntoDisk {\\n\\n // The type used to compare a value as a key to other keys stored in a\\n\\n // database\\n\\n type Bytes: AsRef<[u8]>;\\n\\n\\n\\n // function to convert the current type to its disk format in `zs_get()`\\n\\n // without necessarily allocating a new IVec\\n\\n fn as_bytes(&self) -> Self::Bytes;\\n\\n}\\n\\n\\n\\nimpl<'a, T> IntoDisk for &'a T\\n\\nwhere\\n\\n T: IntoDisk,\\n\\n{\\n\\n type Bytes = T::Bytes;\\n\\n\\n\\n fn as_bytes(&self) -> Self::Bytes {\\n\\n T::as_bytes(*self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"zebra-state/src/service/finalized_state/disk_format.rs\",\n \"rank\": 16,\n \"score\": 141703.11022942467\n },\n {\n \"content\": \"/// Returns `Ok(())` if `hash` passes:\\n\\n/// - the target difficulty limit for `network` (PoWLimit), and\\n\\n/// - the difficulty filter,\\n\\n/// based on the fields in `header`.\\n\\n///\\n\\n/// If the block is invalid, returns an error containing `height` and `hash`.\\n\\npub fn difficulty_is_valid(\\n\\n header: &Header,\\n\\n network: Network,\\n\\n height: &Height,\\n\\n hash: &Hash,\\n\\n) -> Result<(), BlockError> {\\n\\n let difficulty_threshold = header\\n\\n .difficulty_threshold\\n\\n .to_expanded()\\n\\n .ok_or(BlockError::InvalidDifficulty(*height, *hash))?;\\n\\n\\n\\n // Note: the comparisons in this function are u256 integer comparisons, like\\n\\n // zcashd and bitcoin. Greater values represent *less* work.\\n\\n\\n\\n // The PowLimit check is part of `Threshold()` in the spec, but it doesn't\\n\\n // actually depend on any previous blocks.\\n\\n if difficulty_threshold > ExpandedDifficulty::target_difficulty_limit(network) {\\n\\n Err(BlockError::TargetDifficultyLimit(\\n\\n *height,\\n\\n *hash,\\n\",\n \"file_path\": \"zebra-consensus/src/block/check.rs\",\n \"rank\": 17,\n \"score\": 140305.1609736117\n },\n {\n \"content\": \"/// Returns `Ok(())` if `header.time` is less than or equal to\\n\\n/// 2 hours in the future, according to the node's local clock (`now`).\\n\\n///\\n\\n/// This is a non-deterministic rule, as clocks vary over time, and\\n\\n/// between different nodes.\\n\\n///\\n\\n/// \\\"In addition, a full validator MUST NOT accept blocks with nTime\\n\\n/// more than two hours in the future according to its clock. This\\n\\n/// is not strictly a consensus rule because it is nondeterministic,\\n\\n/// and clock time varies between nodes. Also note that a block that\\n\\n/// is rejected by this rule at a given point in time may later be\\n\\n/// accepted.\\\" [§7.5][7.5]\\n\\n///\\n\\n/// [7.5]: https://zips.z.cash/protocol/protocol.pdf#blockheader\\n\\n///\\n\\n/// If the header time is invalid, returns an error containing `height` and `hash`.\\n\\npub fn time_is_valid_at(\\n\\n header: &Header,\\n\\n now: DateTime<Utc>,\\n\\n height: &Height,\\n\\n hash: &Hash,\\n\\n) -> Result<(), zebra_chain::block::BlockTimeError> {\\n\\n header.time_is_valid_at(now, height, hash)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/block/check.rs\",\n \"rank\": 18,\n \"score\": 140305.1609736117\n },\n {\n \"content\": \"/// Helper trait for retrieving values from rocksdb column familys with a consistently\\n\\n/// defined format\\n\\npub trait DiskDeserialize {\\n\\n /// Serialize the given key and use that to get and deserialize the\\n\\n /// corresponding value from a rocksdb column family, if it is present.\\n\\n fn zs_get<K, V>(&self, cf: &rocksdb::ColumnFamily, key: &K) -> Option<V>\\n\\n where\\n\\n K: IntoDisk,\\n\\n V: FromDisk;\\n\\n}\\n\\n\\n\\nimpl DiskDeserialize for rocksdb::DB {\\n\\n fn zs_get<K, V>(&self, cf: &rocksdb::ColumnFamily, key: &K) -> Option<V>\\n\\n where\\n\\n K: IntoDisk,\\n\\n V: FromDisk,\\n\\n {\\n\\n let key_bytes = key.as_bytes();\\n\\n\\n\\n // We use `get_pinned_cf` to avoid taking ownership of the serialized\\n\\n // format because we're going to deserialize it anyways, which avoids an\\n\\n // extra copy\\n\",\n \"file_path\": \"zebra-state/src/service/finalized_state/disk_format.rs\",\n \"rank\": 19,\n \"score\": 139665.50020741395\n },\n {\n \"content\": \"/// Helper trait for inserting (Key, Value) pairs into rocksdb with a consistently\\n\\n/// defined format\\n\\npub trait DiskSerialize {\\n\\n /// Serialize and insert the given key and value into a rocksdb column family.\\n\\n fn zs_insert<K, V>(&mut self, cf: &rocksdb::ColumnFamily, key: K, value: V)\\n\\n where\\n\\n K: IntoDisk + Debug,\\n\\n V: IntoDisk;\\n\\n}\\n\\n\\n\\nimpl DiskSerialize for rocksdb::WriteBatch {\\n\\n fn zs_insert<K, V>(&mut self, cf: &rocksdb::ColumnFamily, key: K, value: V)\\n\\n where\\n\\n K: IntoDisk + Debug,\\n\\n V: IntoDisk,\\n\\n {\\n\\n let key_bytes = key.as_bytes();\\n\\n let value_bytes = value.as_bytes();\\n\\n self.put_cf(cf, key_bytes, value_bytes);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-state/src/service/finalized_state/disk_format.rs\",\n \"rank\": 20,\n \"score\": 139665.50020741395\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn miner_subsidy(\\n\\n height: Height,\\n\\n network: Network,\\n\\n non_miner_reward: Option<Amount<NonNegative>>,\\n\\n) -> Result<Amount<NonNegative>, Error> {\\n\\n if let Some(non_miner_reward) = non_miner_reward {\\n\\n block_subsidy(height, network)? - non_miner_reward\\n\\n } else {\\n\\n block_subsidy(height, network)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/block/subsidy/general.rs\",\n \"rank\": 21,\n \"score\": 138062.82612103797\n },\n {\n \"content\": \"/// Validate the JoinSplit binding signature.\\n\\n///\\n\\n/// https://zips.z.cash/protocol/canopy.pdf#sproutnonmalleability\\n\\n/// https://zips.z.cash/protocol/canopy.pdf#txnencodingandconsensus\\n\\npub fn validate_joinsplit_sig(\\n\\n joinsplit_data: &JoinSplitData<Groth16Proof>,\\n\\n sighash: &[u8],\\n\\n) -> Result<(), TransactionError> {\\n\\n ed25519::VerificationKey::try_from(joinsplit_data.pub_key)\\n\\n .and_then(|vk| vk.verify(&joinsplit_data.sig, sighash))\\n\\n .map_err(TransactionError::Ed25519)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/transaction/check.rs\",\n \"rank\": 22,\n \"score\": 138062.82612103797\n },\n {\n \"content\": \"/// Check Merkle root validity.\\n\\n///\\n\\n/// `transaction_hashes` is a precomputed list of transaction hashes.\\n\\npub fn merkle_root_validity(\\n\\n block: &Block,\\n\\n transaction_hashes: &[transaction::Hash],\\n\\n) -> Result<(), BlockError> {\\n\\n let merkle_root = transaction_hashes.iter().cloned().collect();\\n\\n\\n\\n if block.header.merkle_root != merkle_root {\\n\\n return Err(BlockError::BadMerkleRoot {\\n\\n actual: merkle_root,\\n\\n expected: block.header.merkle_root,\\n\\n });\\n\\n }\\n\\n\\n\\n // Bitcoin's transaction Merkle trees are malleable, allowing blocks with\\n\\n // duplicate transactions to have the same Merkle root as blocks without\\n\\n // duplicate transactions. Duplicate transactions should cause a block to be\\n\\n // rejected, as duplicate transactions imply that the block contains a\\n\\n // double-spend. As a defense-in-depth, however, we also check that there\\n\\n // are no duplicate transaction hashes, by collecting into a HashSet.\\n\\n use std::collections::HashSet;\\n\\n if transaction_hashes.len() != transaction_hashes.iter().collect::<HashSet<_>>().len() {\\n\\n return Err(BlockError::DuplicateTransaction);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"zebra-consensus/src/block/check.rs\",\n \"rank\": 23,\n \"score\": 138062.82612103797\n },\n {\n \"content\": \"/// Returns true if the application is shutting down.\\n\\n///\\n\\n/// Returns false otherwise.\\n\\npub fn is_shutting_down() -> bool {\\n\\n // ## Correctness:\\n\\n //\\n\\n // Since we're shutting down, and this is a one-time operation,\\n\\n // performance is not important. So we use the strongest memory\\n\\n // ordering.\\n\\n // https://doc.rust-lang.org/nomicon/atomics.html#sequentially-consistent\\n\\n IS_SHUTTING_DOWN.load(Ordering::SeqCst)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/shutdown.rs\",\n \"rank\": 24,\n \"score\": 137640.9803321608\n },\n {\n \"content\": \"/// Consensus-critical serialization for Zcash.\\n\\n///\\n\\n/// This trait provides a generic serialization for consensus-critical\\n\\n/// formats, such as network messages, transactions, blocks, etc. It is intended\\n\\n/// for use only in consensus-critical contexts; in other contexts, such as\\n\\n/// internal storage, it would be preferable to use Serde.\\n\\npub trait ZcashSerialize: Sized {\\n\\n /// Write `self` to the given `writer` using the canonical format.\\n\\n ///\\n\\n /// This function has a `zcash_` prefix to alert the reader that the\\n\\n /// serialization in use is consensus-critical serialization, rather than\\n\\n /// some other kind of serialization.\\n\\n ///\\n\\n /// Notice that the error type is [`std::io::Error`]; this indicates that\\n\\n /// serialization MUST be infallible up to errors in the underlying writer.\\n\\n /// In other words, any type implementing `ZcashSerialize` must make illegal\\n\\n /// states unrepresentable.\\n\\n fn zcash_serialize<W: io::Write>(&self, writer: W) -> Result<(), io::Error>;\\n\\n\\n\\n /// Helper function to construct a vec to serialize the current struct into\\n\\n fn zcash_serialize_to_vec(&self) -> Result<Vec<u8>, io::Error> {\\n\\n let mut data = Vec::new();\\n\\n self.zcash_serialize(&mut data)?;\\n\\n Ok(data)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/serialization/zcash_serialize.rs\",\n \"rank\": 25,\n \"score\": 136195.51442400322\n },\n {\n \"content\": \"/// Consensus-critical serialization for Zcash.\\n\\n///\\n\\n/// This trait provides a generic deserialization for consensus-critical\\n\\n/// formats, such as network messages, transactions, blocks, etc. It is intended\\n\\n/// for use only in consensus-critical contexts; in other contexts, such as\\n\\n/// internal storage, it would be preferable to use Serde.\\n\\npub trait ZcashDeserialize: Sized {\\n\\n /// Try to read `self` from the given `reader`.\\n\\n ///\\n\\n /// This function has a `zcash_` prefix to alert the reader that the\\n\\n /// serialization in use is consensus-critical serialization, rather than\\n\\n /// some other kind of serialization.\\n\\n fn zcash_deserialize<R: io::Read>(reader: R) -> Result<Self, SerializationError>;\\n\\n}\\n\\n\\n\\nimpl<T: ZcashDeserialize> ZcashDeserialize for Vec<T> {\\n\\n fn zcash_deserialize<R: io::Read>(mut reader: R) -> Result<Self, SerializationError> {\\n\\n let len = reader.read_compactsize()?;\\n\\n // We're given len, so we could preallocate. But blindly preallocating\\n\\n // without a size bound can allow DOS attacks, and there's no way to\\n\\n // pass a size bound in a ZcashDeserialize impl, so instead we allocate\\n\\n // as we read from the reader. (The maximum block and transaction sizes\\n\\n // limit the eventual size of these allocations.)\\n\\n let mut vec = Vec::new();\\n\\n for _ in 0..len {\\n\\n vec.push(T::zcash_deserialize(&mut reader)?);\\n\\n }\\n\\n Ok(vec)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/serialization/zcash_deserialize.rs\",\n \"rank\": 26,\n \"score\": 136195.51442400322\n },\n {\n \"content\": \"/// Returns a list of outputs in `Transaction`, which have a value equal to `Amount`.\\n\\npub fn find_output_with_amount(\\n\\n transaction: &Transaction,\\n\\n amount: Amount<NonNegative>,\\n\\n) -> Vec<transparent::Output> {\\n\\n // TODO: shielded coinbase - Heartwood\\n\\n transaction\\n\\n .outputs()\\n\\n .iter()\\n\\n .filter(|o| o.value == amount)\\n\\n .cloned()\\n\\n .collect()\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use color_eyre::Report;\\n\\n\\n\\n #[test]\\n\\n fn halving_test() -> Result<(), Report> {\\n\",\n \"file_path\": \"zebra-consensus/src/block/subsidy/general.rs\",\n \"rank\": 27,\n \"score\": 135936.09115167888\n },\n {\n \"content\": \"/// Helper type for retrieving types from the disk with the correct format.\\n\\n///\\n\\n/// The ivec should be correctly encoded by IntoDisk.\\n\\npub trait FromDisk: Sized {\\n\\n /// Function to convert the disk bytes back into the deserialized type.\\n\\n ///\\n\\n /// # Panics\\n\\n ///\\n\\n /// - if the input data doesn't deserialize correctly\\n\\n fn from_bytes(bytes: impl AsRef<[u8]>) -> Self;\\n\\n}\\n\\n\\n\\nimpl<T> FromDisk for Arc<T>\\n\\nwhere\\n\\n T: FromDisk,\\n\\n{\\n\\n fn from_bytes(bytes: impl AsRef<[u8]>) -> Self {\\n\\n Arc::new(T::from_bytes(bytes))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl IntoDisk for Block {\\n\\n type Bytes = Vec<u8>;\\n\",\n \"file_path\": \"zebra-state/src/service/finalized_state/disk_format.rs\",\n \"rank\": 28,\n \"score\": 134153.02857075864\n },\n {\n \"content\": \"/// Generate a block with no transactions (not even a coinbase transaction).\\n\\n///\\n\\n/// The generated block should fail validation.\\n\\npub fn block_no_transactions() -> Block {\\n\\n Block {\\n\\n header: block::Header::zcash_deserialize(&zebra_test::vectors::DUMMY_HEADER[..]).unwrap(),\\n\\n transactions: Vec::new(),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Return a new `(chain_verifier, state_service)` using the hard-coded\\n\\n/// checkpoint list for `network`.\\n\\nasync fn verifiers_from_network(\\n\\n network: Network,\\n\\n) -> (\\n\\n impl Service<\\n\\n Arc<Block>,\\n\\n Response = block::Hash,\\n\\n Error = BoxError,\\n\\n Future = impl Future<Output = Result<block::Hash, BoxError>>,\\n\\n > + Send\\n\\n + Clone\\n\\n + 'static,\\n\",\n \"file_path\": \"zebra-consensus/src/chain/tests.rs\",\n \"rank\": 29,\n \"score\": 133031.02218459797\n },\n {\n \"content\": \"/// Generate a block header\\n\\npub fn block_header() -> Header {\\n\\n Header::zcash_deserialize(&zebra_test::vectors::DUMMY_HEADER[..]).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/generate.rs\",\n \"rank\": 30,\n \"score\": 130904.28721523889\n },\n {\n \"content\": \"/// Extends [`Write`] with methods for writing Zcash/Bitcoin types.\\n\\n///\\n\\n/// [`Write`]: https://doc.rust-lang.org/std/io/trait.Write.html\\n\\npub trait WriteZcashExt: io::Write {\\n\\n /// Writes a `u64` using the Bitcoin `CompactSize` encoding.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```rust\\n\\n /// use zebra_chain::serialization::WriteZcashExt;\\n\\n ///\\n\\n /// let mut buf = Vec::new();\\n\\n /// buf.write_compactsize(0x12).unwrap();\\n\\n /// assert_eq!(buf, b\\\"\\\\x12\\\");\\n\\n ///\\n\\n /// let mut buf = Vec::new();\\n\\n /// buf.write_compactsize(0xfd).unwrap();\\n\\n /// assert_eq!(buf, b\\\"\\\\xfd\\\\xfd\\\\x00\\\");\\n\\n ///\\n\\n /// let mut buf = Vec::new();\\n\\n /// buf.write_compactsize(0xaafd).unwrap();\\n\\n /// assert_eq!(buf, b\\\"\\\\xfd\\\\xfd\\\\xaa\\\");\\n\\n ///\\n\",\n \"file_path\": \"zebra-chain/src/serialization/write_zcash.rs\",\n \"rank\": 31,\n \"score\": 127632.46852485277\n },\n {\n \"content\": \"/// Generate a block with multiple transactions just above limit\\n\\npub fn oversized_multi_transaction_block() -> Block {\\n\\n multi_transaction_block(true)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/generate.rs\",\n \"rank\": 32,\n \"score\": 126963.6125931445\n },\n {\n \"content\": \"/// Generate a block with one transaction and multiple inputs just below limit\\n\\npub fn large_single_transaction_block() -> Block {\\n\\n single_transaction_block(false)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/generate.rs\",\n \"rank\": 33,\n \"score\": 126963.6125931445\n },\n {\n \"content\": \"/// Generate a block with one transaction and multiple inputs just above limit\\n\\npub fn oversized_single_transaction_block() -> Block {\\n\\n single_transaction_block(true)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/generate.rs\",\n \"rank\": 34,\n \"score\": 126963.6125931445\n },\n {\n \"content\": \"/// Generate a block with multiple transactions just below limit\\n\\npub fn large_multi_transaction_block() -> Block {\\n\\n multi_transaction_block(false)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/generate.rs\",\n \"rank\": 35,\n \"score\": 126963.6125931445\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<ZebradApp> {\\n\\n config::Reader::new(&APPLICATION)\\n\\n}\\n\\n\\n\\n/// Zebrad Application\\n\\n#[derive(Debug)]\\n\\npub struct ZebradApp {\\n\\n /// Application configuration.\\n\\n config: Option<ZebradConfig>,\\n\\n\\n\\n /// Application state.\\n\\n state: application::State<Self>,\\n\\n}\\n\\n\\n\\nimpl ZebradApp {\\n\\n /// Are standard output and standard error both connected to ttys?\\n\\n fn outputs_are_ttys() -> bool {\\n\\n atty::is(atty::Stream::Stdout) && atty::is(atty::Stream::Stderr)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"zebrad/src/application.rs\",\n \"rank\": 36,\n \"score\": 123155.73114677425\n },\n {\n \"content\": \"/// Obtain a read-only (multi-reader) lock on the application state.\\n\\n///\\n\\n/// Panics if the application state has not been initialized.\\n\\npub fn app_reader() -> application::lock::Reader<ZebradApp> {\\n\\n APPLICATION.read()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebrad/src/application.rs\",\n \"rank\": 37,\n \"score\": 118089.37561378883\n },\n {\n \"content\": \"/// Obtain an exclusive mutable lock on the application state.\\n\\npub fn app_writer() -> application::lock::Writer<ZebradApp> {\\n\\n APPLICATION.write()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebrad/src/application.rs\",\n \"rank\": 38,\n \"score\": 118089.37561378883\n },\n {\n \"content\": \"/// Returns the hash for the genesis block in `network`.\\n\\npub fn genesis_hash(network: Network) -> block::Hash {\\n\\n match network {\\n\\n // zcash-cli getblockhash 0\\n\\n Network::Mainnet => \\\"00040fe8ec8471911baa1db1266ea15dd06b4a8a5c453883c000b031973dce08\\\",\\n\\n // zcash-cli -testnet getblockhash 0\\n\\n Network::Testnet => \\\"05a60a92d99d85997cce3b87616c089f6124d7342af37106edc76126334a2c38\\\",\\n\\n }\\n\\n .parse()\\n\\n .expect(\\\"hard-coded hash parses\\\")\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/parameters/genesis.rs\",\n \"rank\": 39,\n \"score\": 116168.55078427677\n },\n {\n \"content\": \"pub fn panic_event_from<T>(msg: T) -> Event<'static>\\n\\nwhere\\n\\n T: ToString,\\n\\n{\\n\\n let exception = Exception {\\n\\n ty: \\\"panic\\\".into(),\\n\\n mechanism: Some(Mechanism {\\n\\n ty: \\\"panic\\\".into(),\\n\\n handled: Some(false),\\n\\n ..Default::default()\\n\\n }),\\n\\n value: Some(msg.to_string()),\\n\\n // Sentry does not handle panic = abort well yet, and when gibven this\\n\\n // stacktrace, it consists only of this line, making Sentry dedupe\\n\\n // events together by their stacetrace fingerprint incorrectly.\\n\\n //\\n\\n // stacktrace: current_stacktrace(),\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n Event {\\n\\n exception: vec![exception].into(),\\n\\n level: sentry::Level::Fatal,\\n\\n ..Default::default()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"zebrad/src/sentry.rs\",\n \"rank\": 40,\n \"score\": 115447.96067211195\n },\n {\n \"content\": \"/// Returns `Ok(())` if there is exactly one coinbase transaction in `Block`,\\n\\n/// and that coinbase transaction is the first transaction in the block.\\n\\n///\\n\\n/// \\\"The first (and only the first) transaction in a block is a coinbase\\n\\n/// transaction, which collects and spends any miner subsidy and transaction\\n\\n/// fees paid by transactions included in this block.\\\" [§3.10][3.10]\\n\\n///\\n\\n/// [3.10]: https://zips.z.cash/protocol/protocol.pdf#coinbasetransactions\\n\\npub fn coinbase_is_first(block: &Block) -> Result<(), BlockError> {\\n\\n let first = block\\n\\n .transactions\\n\\n .get(0)\\n\\n .ok_or(BlockError::NoTransactions)?;\\n\\n let mut rest = block.transactions.iter().skip(1);\\n\\n if !first.is_coinbase() {\\n\\n return Err(TransactionError::CoinbasePosition)?;\\n\\n }\\n\\n if rest.any(|tx| tx.contains_coinbase_input()) {\\n\\n return Err(TransactionError::CoinbaseInputFound)?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/block/check.rs\",\n \"rank\": 41,\n \"score\": 114339.64297199558\n },\n {\n \"content\": \"/// Checks that the transaction has inputs and outputs.\\n\\n///\\n\\n/// More specifically:\\n\\n///\\n\\n/// * at least one of tx_in_count, nShieldedSpend, and nJoinSplit MUST be non-zero.\\n\\n/// * at least one of tx_out_count, nShieldedOutput, and nJoinSplit MUST be non-zero.\\n\\n///\\n\\n/// https://zips.z.cash/protocol/canopy.pdf#txnencodingandconsensus\\n\\npub fn has_inputs_and_outputs(tx: &Transaction) -> Result<(), TransactionError> {\\n\\n // The consensus rule is written in terms of numbers, but our transactions\\n\\n // hold enum'd data. Mixing pattern matching and numerical checks is risky,\\n\\n // so convert everything to counts and sum up.\\n\\n match tx {\\n\\n Transaction::V4 {\\n\\n inputs,\\n\\n outputs,\\n\\n joinsplit_data,\\n\\n shielded_data,\\n\\n ..\\n\\n } => {\\n\\n let tx_in_count = inputs.len();\\n\\n let tx_out_count = outputs.len();\\n\\n let n_joinsplit = joinsplit_data\\n\\n .as_ref()\\n\\n .map(|d| d.joinsplits().count())\\n\\n .unwrap_or(0);\\n\\n let n_shielded_spend = shielded_data\\n\\n .as_ref()\\n\",\n \"file_path\": \"zebra-consensus/src/transaction/check.rs\",\n \"rank\": 42,\n \"score\": 114339.64297199558\n },\n {\n \"content\": \"/// Returns a random port number from the ephemeral port range.\\n\\n///\\n\\n/// Does not check if the port is already in use. It's impossible to do this\\n\\n/// check in a reliable, cross-platform way.\\n\\n///\\n\\n/// ## Usage\\n\\n///\\n\\n/// If you want a once-off random unallocated port, use\\n\\n/// `random_unallocated_port`. Don't use this function if you don't need\\n\\n/// to - it has a small risk of port conflcits.\\n\\n///\\n\\n/// Use this function when you need to use the same random port multiple\\n\\n/// times. For example: setting up both ends of a connection, or re-using\\n\\n/// the same port multiple times.\\n\\nfn random_known_port() -> u16 {\\n\\n // Use the intersection of the IANA ephemeral port range, and the Linux\\n\\n // ephemeral port range:\\n\\n // https://en.wikipedia.org/wiki/Ephemeral_port#Range\\n\\n rand::thread_rng().gen_range(49152, 60999)\\n\\n}\\n\\n\\n\\n/// Returns the \\\"magic\\\" port number that tells the operating system to\\n\\n/// choose a random unallocated port.\\n\\n///\\n\\n/// The OS chooses a different port each time it opens a connection or\\n\\n/// listener with this magic port number.\\n\\n///\\n\\n/// ## Usage\\n\\n///\\n\\n/// See the usage note for `random_known_port`.\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 43,\n \"score\": 112785.29935429417\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn random_unallocated_port() -> u16 {\\n\\n 0\\n\\n}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn metrics_endpoint() -> Result<()> {\\n\\n use hyper::Client;\\n\\n\\n\\n zebra_test::init();\\n\\n\\n\\n // [Note on port conflict](#Note on port conflict)\\n\\n let port = random_known_port();\\n\\n let endpoint = format!(\\\"127.0.0.1:{}\\\", port);\\n\\n let url = format!(\\\"http://{}\\\", endpoint);\\n\\n\\n\\n // Write a configuration that has metrics endpoint_addr set\\n\\n let mut config = default_test_config()?;\\n\\n config.metrics.endpoint_addr = Some(endpoint.parse().unwrap());\\n\\n\\n\\n let dir = TempDir::new(\\\"zebrad_tests\\\")?.with_config(&mut config)?;\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 44,\n \"score\": 112772.42746269662\n },\n {\n \"content\": \"#[test]\\n\\nfn compact_zero() {\\n\\n zebra_test::init();\\n\\n\\n\\n let natural_zero = CompactDifficulty(0);\\n\\n assert_eq!(natural_zero.to_expanded(), None);\\n\\n assert_eq!(natural_zero.to_work(), None);\\n\\n\\n\\n // Small value zeroes\\n\\n let small_zero_1 = CompactDifficulty(1);\\n\\n assert_eq!(small_zero_1.to_expanded(), None);\\n\\n assert_eq!(small_zero_1.to_work(), None);\\n\\n let small_zero_max = CompactDifficulty(UNSIGNED_MANTISSA_MASK);\\n\\n assert_eq!(small_zero_max.to_expanded(), None);\\n\\n assert_eq!(small_zero_max.to_work(), None);\\n\\n\\n\\n // Special-cased zeroes, negative in the floating-point representation\\n\\n let sc_zero = CompactDifficulty(SIGN_BIT);\\n\\n assert_eq!(sc_zero.to_expanded(), None);\\n\\n assert_eq!(sc_zero.to_work(), None);\\n\\n let sc_zero_next = CompactDifficulty(SIGN_BIT + 1);\\n\",\n \"file_path\": \"zebra-chain/src/work/difficulty/tests/vectors.rs\",\n \"rank\": 45,\n \"score\": 110971.84184019027\n },\n {\n \"content\": \"#[test]\\n\\nfn compact_extremes() {\\n\\n zebra_test::init();\\n\\n\\n\\n // Values equal to one\\n\\n let expanded_one = Some(ExpandedDifficulty(U256::one()));\\n\\n let work_one = None;\\n\\n\\n\\n let canonical_one = CompactDifficulty((1 << PRECISION) + (1 << 16));\\n\\n assert_eq!(canonical_one.to_expanded(), expanded_one);\\n\\n assert_eq!(\\n\\n canonical_one.to_expanded().unwrap().to_compact(),\\n\\n canonical_one\\n\\n );\\n\\n assert_eq!(canonical_one.to_work(), work_one);\\n\\n\\n\\n let another_one = CompactDifficulty(OFFSET as u32 * (1 << PRECISION) + 1);\\n\\n assert_eq!(another_one.to_expanded(), expanded_one);\\n\\n assert_eq!(\\n\\n another_one.to_expanded().unwrap().to_compact(),\\n\\n canonical_one\\n\",\n \"file_path\": \"zebra-chain/src/work/difficulty/tests/vectors.rs\",\n \"rank\": 46,\n \"score\": 110971.84184019027\n },\n {\n \"content\": \"/// Check that a coinbase tx does not have any JoinSplit or Spend descriptions.\\n\\n///\\n\\n/// https://zips.z.cash/protocol/canopy.pdf#txnencodingandconsensus\\n\\npub fn coinbase_tx_no_joinsplit_or_spend(tx: &Transaction) -> Result<(), TransactionError> {\\n\\n if tx.is_coinbase() {\\n\\n match tx {\\n\\n // Check if there is any JoinSplitData.\\n\\n Transaction::V4 {\\n\\n joinsplit_data: Some(_),\\n\\n ..\\n\\n } => Err(TransactionError::CoinbaseHasJoinSplit),\\n\\n\\n\\n // The ShieldedData contains both Spends and Outputs, and Outputs\\n\\n // are allowed post-Heartwood, so we have to count Spends.\\n\\n Transaction::V4 {\\n\\n shielded_data: Some(shielded_data),\\n\\n ..\\n\\n } if shielded_data.spends().count() > 0 => Err(TransactionError::CoinbaseHasSpend),\\n\\n\\n\\n Transaction::V4 { .. } => Ok(()),\\n\\n\\n\\n Transaction::V1 { .. } | Transaction::V2 { .. } | Transaction::V3 { .. } => {\\n\\n unreachable!(\\\"tx version is checked first\\\")\\n\\n }\\n\\n }\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"zebra-consensus/src/transaction/check.rs\",\n \"rank\": 47,\n \"score\": 110932.39264148785\n },\n {\n \"content\": \"/// Returns `Ok(())` if the `EquihashSolution` is valid for `header`\\n\\npub fn equihash_solution_is_valid(header: &Header) -> Result<(), equihash::Error> {\\n\\n header.solution.check(&header)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/block/check.rs\",\n \"rank\": 48,\n \"score\": 109954.79366477471\n },\n {\n \"content\": \"/// Runs a command\\n\\npub fn test_cmd(command_path: &str, tempdir: &Path) -> Result<Command> {\\n\\n let mut cmd = Command::new(command_path);\\n\\n cmd.current_dir(tempdir);\\n\\n\\n\\n Ok(cmd)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-test/src/command.rs\",\n \"rank\": 49,\n \"score\": 107642.70960847387\n },\n {\n \"content\": \"#[test]\\n\\n#[spandoc::spandoc]\\n\\nfn compact_bitcoin_test_vectors() {\\n\\n zebra_test::init();\\n\\n\\n\\n // We use two spans, so we can diagnose conversion panics, and mismatching results\\n\\n for (compact, expected_expanded, expected_work) in COMPACT_DIFFICULTY_CASES.iter().cloned() {\\n\\n /// SPANDOC: Convert compact to expanded and work {?compact, ?expected_expanded, ?expected_work}\\n\\n {\\n\\n let expected_expanded = expected_expanded.map(U256::from).map(ExpandedDifficulty);\\n\\n let expected_work = expected_work.map(Work);\\n\\n\\n\\n let compact = CompactDifficulty(compact);\\n\\n let actual_expanded = compact.to_expanded();\\n\\n let actual_work = compact.to_work();\\n\\n let canonical_compact = actual_expanded.map(|e| e.to_compact());\\n\\n let round_trip_expanded = canonical_compact.map(|c| c.to_expanded());\\n\\n\\n\\n /// SPANDOC: Test that compact produces the expected expanded and work {?compact, ?expected_expanded, ?actual_expanded, ?expected_work, ?actual_work, ?canonical_compact, ?round_trip_expanded}\\n\\n {\\n\\n assert_eq!(actual_expanded, expected_expanded);\\n\\n if expected_expanded.is_some() {\\n\\n assert_eq!(round_trip_expanded.unwrap(), actual_expanded);\\n\\n }\\n\\n assert_eq!(actual_work, expected_work);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Test blocks using CompactDifficulty.\\n\",\n \"file_path\": \"zebra-chain/src/work/difficulty/tests/vectors.rs\",\n \"rank\": 50,\n \"score\": 106817.95517228471\n },\n {\n \"content\": \"/// Get the heights of the blocks for constructing a block_locator list\\n\\npub fn block_locator_heights(tip_height: block::Height) -> Vec<block::Height> {\\n\\n // Stop at the reorg limit, or the genesis block.\\n\\n let min_locator_height = tip_height\\n\\n .0\\n\\n .saturating_sub(constants::MAX_BLOCK_REORG_HEIGHT);\\n\\n let locators = iter::successors(Some(1u32), |h| h.checked_mul(2))\\n\\n .flat_map(move |step| tip_height.0.checked_sub(step));\\n\\n let locators = iter::once(tip_height.0)\\n\\n .chain(locators)\\n\\n .take_while(move |&height| height > min_locator_height)\\n\\n .chain(iter::once(min_locator_height))\\n\\n .map(block::Height);\\n\\n\\n\\n let locators = locators.collect();\\n\\n tracing::info!(\\n\\n ?tip_height,\\n\\n ?min_locator_height,\\n\\n ?locators,\\n\\n \\\"created block locator\\\"\\n\\n );\\n\\n locators\\n\\n}\\n\",\n \"file_path\": \"zebra-state/src/util.rs\",\n \"rank\": 51,\n \"score\": 105978.89364351014\n },\n {\n \"content\": \"/// Returns `Ok(())` if the block subsidy and miner fees in `block` are valid for `network`\\n\\n///\\n\\n/// [3.9]: https://zips.z.cash/protocol/protocol.pdf#subsidyconcepts\\n\\npub fn subsidy_is_valid(block: &Block, network: Network) -> Result<(), BlockError> {\\n\\n let height = block.coinbase_height().ok_or(SubsidyError::NoCoinbase)?;\\n\\n let coinbase = block.transactions.get(0).ok_or(SubsidyError::NoCoinbase)?;\\n\\n\\n\\n let halving_div = subsidy::general::halving_divisor(height, network);\\n\\n let canopy_activation_height = NetworkUpgrade::Canopy\\n\\n .activation_height(network)\\n\\n .expect(\\\"Canopy activation height is known\\\");\\n\\n\\n\\n // TODO: the sum of the coinbase transaction outputs must be less than or equal to the block subsidy plus transaction fees\\n\\n\\n\\n // Check founders reward and funding streams\\n\\n if height < SLOW_START_INTERVAL {\\n\\n unreachable!(\\n\\n \\\"unsupported block height: callers should handle blocks below {:?}\\\",\\n\\n SLOW_START_INTERVAL\\n\\n )\\n\\n } else if halving_div.count_ones() != 1 {\\n\\n unreachable!(\\\"invalid halving divisor: the halving divisor must be a non-zero power of two\\\")\\n\\n } else if height < canopy_activation_height {\\n\",\n \"file_path\": \"zebra-consensus/src/block/check.rs\",\n \"rank\": 52,\n \"score\": 105978.89364351014\n },\n {\n \"content\": \"pub fn layer<S>(path_root: &Path) -> (impl Layer<S>, Grapher)\\n\\nwhere\\n\\n S: Subscriber + for<'span> LookupSpan<'span>,\\n\\n{\\n\\n let path = path_root.with_extension(\\\"folded\\\");\\n\\n let (layer, guard) = tracing_flame::FlameLayer::with_file(&path).unwrap();\\n\\n let layer = layer.with_empty_samples(false).with_threads_collapsed(true);\\n\\n let flamegrapher = Grapher { guard, path };\\n\\n (layer, flamegrapher)\\n\\n}\\n\\n\\n\\nimpl Grapher {\\n\\n pub fn write_flamegraph(&self) -> Result<(), Report> {\\n\\n self.guard.flush()?;\\n\\n let out_path = self.path.with_extension(\\\"svg\\\");\\n\\n let inf = File::open(&self.path)?;\\n\\n let reader = BufReader::new(inf);\\n\\n\\n\\n let out = File::create(out_path)?;\\n\\n let writer = BufWriter::new(out);\\n\\n\\n\\n let mut opts = inferno::flamegraph::Options::default();\\n\\n info!(\\\"writing flamegraph to disk...\\\");\\n\\n inferno::flamegraph::from_reader(&mut opts, reader, writer)?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"zebrad/src/components/tracing/flame.rs\",\n \"rank\": 53,\n \"score\": 103938.16342780777\n },\n {\n \"content\": \"/// Initialize a state service from the provided [`Config`].\\n\\n///\\n\\n/// Each `network` has its own separate on-disk database.\\n\\n///\\n\\n/// To share access to the state, wrap the returned service in a `Buffer`. It's\\n\\n/// possible to construct multiple state services in the same application (as\\n\\n/// long as they, e.g., use different storage locations), but doing so is\\n\\n/// probably not what you want.\\n\\npub fn init(config: Config, network: Network) -> BoxService<Request, Response, BoxError> {\\n\\n BoxService::new(StateService::new(config, network))\\n\\n}\\n\",\n \"file_path\": \"zebra-state/src/service.rs\",\n \"rank\": 54,\n \"score\": 100538.34526246827\n },\n {\n \"content\": \"/// `BlockSubsidy(height)` as described in [protocol specification §7.7][7.7]\\n\\n///\\n\\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\\n\\npub fn block_subsidy(height: Height, network: Network) -> Result<Amount<NonNegative>, Error> {\\n\\n let blossom_height = Blossom\\n\\n .activation_height(network)\\n\\n .expect(\\\"blossom activation height should be available\\\");\\n\\n let halving_div = halving_divisor(height, network);\\n\\n\\n\\n if height < SLOW_START_INTERVAL {\\n\\n unreachable!(\\n\\n \\\"unsupported block height: callers should handle blocks below {:?}\\\",\\n\\n SLOW_START_INTERVAL\\n\\n )\\n\\n } else if height < blossom_height {\\n\\n // this calculation is exact, because the halving divisor is 1 here\\n\\n Amount::try_from(MAX_BLOCK_SUBSIDY / halving_div)\\n\\n } else {\\n\\n let scaled_max_block_subsidy = MAX_BLOCK_SUBSIDY / BLOSSOM_POW_TARGET_SPACING_RATIO;\\n\\n // in future halvings, this calculation might not be exact\\n\\n // Amount division is implemented using integer division,\\n\\n // which truncates (rounds down) the result, as specified\\n\\n Amount::try_from(scaled_max_block_subsidy / halving_div)\\n\\n }\\n\\n}\\n\\n\\n\\n/// `MinerSubsidy(height)` as described in [protocol specification §7.7][7.7]\\n\\n///\\n\\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\\n\\n///\\n\\n/// `non_miner_reward` is the founders reward or funding stream value.\\n\\n/// If all the rewards for a block go to the miner, use `None`.\\n\",\n \"file_path\": \"zebra-consensus/src/block/subsidy/general.rs\",\n \"rank\": 55,\n \"score\": 97558.88380126149\n },\n {\n \"content\": \"#[cfg(test)]\\n\\npub fn new_outputs(block: &block::Block) -> std::collections::HashMap<transparent::OutPoint, Utxo> {\\n\\n use std::collections::HashMap;\\n\\n\\n\\n let height = block.coinbase_height().expect(\\\"block has coinbase height\\\");\\n\\n\\n\\n let mut new_outputs = HashMap::default();\\n\\n for transaction in &block.transactions {\\n\\n let hash = transaction.hash();\\n\\n let from_coinbase = transaction.is_coinbase();\\n\\n for (index, output) in transaction.outputs().iter().cloned().enumerate() {\\n\\n let index = index as u32;\\n\\n new_outputs.insert(\\n\\n transparent::OutPoint { hash, index },\\n\\n Utxo {\\n\\n output,\\n\\n height,\\n\\n from_coinbase,\\n\\n },\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n new_outputs\\n\\n}\\n\",\n \"file_path\": \"zebra-state/src/utxo.rs\",\n \"rank\": 56,\n \"score\": 97390.11324436357\n },\n {\n \"content\": \"/// `FoundersReward(height)` as described in [protocol specification §7.7][7.7]\\n\\n///\\n\\n/// [7.7]: https://zips.z.cash/protocol/protocol.pdf#subsidies\\n\\npub fn founders_reward(height: Height, network: Network) -> Result<Amount<NonNegative>, Error> {\\n\\n if halving_divisor(height, network) == 1 {\\n\\n // this calculation is exact, because the block subsidy is divisible by\\n\\n // the FOUNDERS_FRACTION_DIVISOR until long after the first halving\\n\\n block_subsidy(height, network)? / FOUNDERS_FRACTION_DIVISOR\\n\\n } else {\\n\\n Amount::try_from(0)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use color_eyre::Report;\\n\\n use zebra_chain::parameters::NetworkUpgrade::*;\\n\\n #[test]\\n\\n fn test_founders_reward() -> Result<(), Report> {\\n\\n zebra_test::init();\\n\\n\\n\\n let network = Network::Mainnet;\\n\",\n \"file_path\": \"zebra-consensus/src/block/subsidy/founders_reward.rs\",\n \"rank\": 57,\n \"score\": 96164.63421794423\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn mixing_pedersen_hash(P: jubjub::ExtendedPoint, x: jubjub::Fr) -> jubjub::ExtendedPoint {\\n\\n const J: [u8; 8] = *b\\\"Zcash_J_\\\";\\n\\n\\n\\n P + find_group_hash(J, b\\\"\\\") * x\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/sapling/commitment/pedersen_hashes.rs\",\n \"rank\": 58,\n \"score\": 94827.53214752828\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn pedersen_hash(domain: [u8; 8], M: &BitVec<Lsb0, u8>) -> jubjub::Fq {\\n\\n jubjub::AffinePoint::from(pedersen_hash_to_point(domain, M)).get_u()\\n\\n}\\n\\n\\n\\n/// Mixing Pedersen Hash Function\\n\\n///\\n\\n/// Used to compute ρ from a note commitment and its position in the note\\n\\n/// commitment tree. It takes as input a Pedersen commitment P, and hashes it\\n\\n/// with another input x.\\n\\n///\\n\\n/// MixingPedersenHash(P, x) := P + [x]FindGroupHash^J^(r)(“Zcash_J_”, “”)\\n\\n///\\n\\n/// https://zips.z.cash/protocol/protocol.pdf#concretemixinghash\\n\",\n \"file_path\": \"zebra-chain/src/sapling/commitment/pedersen_hashes.rs\",\n \"rank\": 59,\n \"score\": 94540.72284962196\n },\n {\n \"content\": \"/// Construct a 'windowed' Pedersen commitment by reusing a Pederson hash\\n\\n/// construction, and adding a randomized point on the Jubjub curve.\\n\\n///\\n\\n/// WindowedPedersenCommit_r (s) := \\\\\\n\\n/// PedersenHashToPoint(“Zcash_PH”, s) + [r]FindGroupHash^J^(r)(“Zcash_PH”, “r”)\\n\\n///\\n\\n/// https://zips.z.cash/protocol/protocol.pdf#concretewindowedcommit\\n\\npub fn windowed_pedersen_commitment(r: jubjub::Fr, s: &BitVec<Lsb0, u8>) -> jubjub::ExtendedPoint {\\n\\n const D: [u8; 8] = *b\\\"Zcash_PH\\\";\\n\\n\\n\\n pedersen_hash_to_point(D, &s) + find_group_hash(D, b\\\"r\\\") * r\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/sapling/commitment/pedersen_hashes.rs\",\n \"rank\": 60,\n \"score\": 93203.62077920602\n },\n {\n \"content\": \"fn write_coinbase_height<W: io::Write>(height: block::Height, mut w: W) -> Result<(), io::Error> {\\n\\n // We can't write this as a match statement on stable until exclusive range\\n\\n // guards are stabilized.\\n\\n // The Bitcoin encoding requires that the most significant byte is below 0x80,\\n\\n // so the ranges run up to 2^{n-1} rather than 2^n.\\n\\n if let 0 = height.0 {\\n\\n // Genesis block does not include height.\\n\\n } else if let h @ 1..=16 = height.0 {\\n\\n w.write_u8(0x50 + (h as u8))?;\\n\\n } else if let h @ 17..=127 = height.0 {\\n\\n w.write_u8(0x01)?;\\n\\n w.write_u8(h as u8)?;\\n\\n } else if let h @ 128..=32767 = height.0 {\\n\\n w.write_u8(0x02)?;\\n\\n w.write_u16::<LittleEndian>(h as u16)?;\\n\\n } else if let h @ 32768..=8_388_607 = height.0 {\\n\\n w.write_u8(0x03)?;\\n\\n w.write_u8(h as u8)?;\\n\\n w.write_u8((h >> 8) as u8)?;\\n\\n w.write_u8((h >> 16) as u8)?;\\n\",\n \"file_path\": \"zebra-chain/src/transparent/serialize.rs\",\n \"rank\": 61,\n \"score\": 92363.42406093364\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn pedersen_hash_to_point(domain: [u8; 8], M: &BitVec<Lsb0, u8>) -> jubjub::ExtendedPoint {\\n\\n let mut result = jubjub::ExtendedPoint::identity();\\n\\n\\n\\n // Split M into n segments of 3 * c bits, where c = 63, padding the last\\n\\n // segment with zeros.\\n\\n //\\n\\n // This loop is 1-indexed per the math definitions in the spec.\\n\\n //\\n\\n // https://zips.z.cash/protocol/protocol.pdf#concretepedersenhash\\n\\n for (i, segment) in M\\n\\n .chunks(189)\\n\\n .enumerate()\\n\\n .map(|(i, segment)| (i + 1, segment))\\n\\n {\\n\\n result += I_i(domain, i as u32) * M_i(&segment);\\n\\n }\\n\\n\\n\\n result\\n\\n}\\n\\n\\n\\n/// Pedersen Hash Function\\n\\n///\\n\\n/// This is technically returning 255 (l_MerkleSapling) bits, not 256.\\n\\n///\\n\\n/// https://zips.z.cash/protocol/protocol.pdf#concretepedersenhash\\n\",\n \"file_path\": \"zebra-chain/src/sapling/commitment/pedersen_hashes.rs\",\n \"rank\": 62,\n \"score\": 91920.22323814643\n },\n {\n \"content\": \"/// Extension trait for methods on `tempdir::TempDir` for using it as a test\\n\\n/// directory for `zebrad`.\\n\\ntrait ZebradTestDirExt\\n\\nwhere\\n\\n Self: AsRef<Path> + Sized,\\n\\n{\\n\\n /// Spawn `zebrad` with `args` as a child process in this test directory,\\n\\n /// potentially taking ownership of the tempdir for the duration of the\\n\\n /// child process.\\n\\n ///\\n\\n /// If there is a config in the test directory, pass it to `zebrad`.\\n\\n fn spawn_child(self, args: &[&str]) -> Result<TestChild<Self>>;\\n\\n\\n\\n /// Create a config file and use it for all subsequently spawned processes.\\n\\n /// Returns an error if the config already exists.\\n\\n ///\\n\\n /// If needed:\\n\\n /// - recursively create directories for the config and state\\n\\n /// - set `config.cache_dir` based on `self`\\n\\n fn with_config(self, config: &mut ZebradConfig) -> Result<Self>;\\n\\n\\n\\n /// Create a config file with the exact contents of `config`, and use it for\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 63,\n \"score\": 78044.70651738113\n },\n {\n \"content\": \"trait ToAddressWithNetwork {\\n\\n /// Convert `self` to an `Address`, given the current `network`.\\n\\n fn to_address(&self, network: Network) -> Address;\\n\\n}\\n\\n\\n\\nimpl ToAddressWithNetwork for Script {\\n\\n fn to_address(&self, network: Network) -> Address {\\n\\n Address::PayToScriptHash {\\n\\n network,\\n\\n script_hash: Address::hash_payload(&self.0[..]),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ToAddressWithNetwork for PublicKey {\\n\\n fn to_address(&self, network: Network) -> Address {\\n\\n Address::PayToPublicKeyHash {\\n\\n network,\\n\\n pub_key_hash: Address::hash_payload(&self.serialize()[..]),\\n\\n }\\n\",\n \"file_path\": \"zebra-chain/src/transparent/address.rs\",\n \"rank\": 64,\n \"score\": 78034.4452655006\n },\n {\n \"content\": \"fn main() {\\n\\n let mut flags = ConstantsFlags::empty();\\n\\n flags.toggle(ConstantsFlags::SHA_SHORT);\\n\\n\\n\\n // We want to use REBUILD_ON_HEAD_CHANGE here, but vergen assumes that the\\n\\n // git directory is in the crate directory, and Zebra uses a workspace.\\n\\n // See rustyhorde/vergen#15 and rustyhorde/vergen#21 for details.\\n\\n let result = generate_rebuild_key();\\n\\n if let Err(err) = result {\\n\\n eprintln!(\\\"Error generating 'cargo:rerun-if-changed': {:?}\\\", err);\\n\\n }\\n\\n\\n\\n // Generate the 'cargo:' key output\\n\\n generate_cargo_keys(flags).expect(\\\"Unable to generate the cargo keys!\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebrad/build.rs\",\n \"rank\": 65,\n \"score\": 77106.2985816294\n },\n {\n \"content\": \"fn transaction_hashes(items: &'_ [InventoryHash]) -> impl Iterator<Item = transaction::Hash> + '_ {\\n\\n items.iter().filter_map(|item| {\\n\\n if let InventoryHash::Tx(hash) = item {\\n\\n Some(*hash)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-network/src/peer/connection.rs\",\n \"rank\": 66,\n \"score\": 76222.49256634797\n },\n {\n \"content\": \"fn block_hashes(items: &'_ [InventoryHash]) -> impl Iterator<Item = block::Hash> + '_ {\\n\\n items.iter().filter_map(|item| {\\n\\n if let InventoryHash::Block(hash) = item {\\n\\n Some(*hash)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"zebra-network/src/peer/connection.rs\",\n \"rank\": 67,\n \"score\": 76222.49256634797\n },\n {\n \"content\": \"/// Sync `network` until `zebrad` reaches `height`, and ensure that\\n\\n/// the output contains `stop_regex`. If `reuse_tempdir` is supplied,\\n\\n/// use it as the test's temporary directory.\\n\\n///\\n\\n/// If `stop_regex` is encountered before the process exits, kills the\\n\\n/// process, and mark the test as successful, even if `height` has not\\n\\n/// been reached.\\n\\n///\\n\\n/// On success, returns the associated `TempDir`. Returns an error if\\n\\n/// the child exits or `timeout` elapses before `regex` is found.\\n\\n///\\n\\n/// If your test environment does not have network access, skip\\n\\n/// this test by setting the `ZEBRA_SKIP_NETWORK_TESTS` env var.\\n\\nfn sync_until(\\n\\n height: Height,\\n\\n network: Network,\\n\\n stop_regex: &str,\\n\\n timeout: Duration,\\n\\n reuse_tempdir: Option<TempDir>,\\n\\n) -> Result<TempDir> {\\n\\n zebra_test::init();\\n\\n\\n\\n if env::var_os(\\\"ZEBRA_SKIP_NETWORK_TESTS\\\").is_some() {\\n\\n // This message is captured by the test runner, use\\n\\n // `cargo test -- --nocapture` to see it.\\n\\n eprintln!(\\\"Skipping network test because '$ZEBRA_SKIP_NETWORK_TESTS' is set.\\\");\\n\\n return testdir();\\n\\n }\\n\\n\\n\\n // Use a persistent state, so we can handle large syncs\\n\\n let mut config = persistent_test_config()?;\\n\\n // TODO: add convenience methods?\\n\\n config.network.network = network;\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 68,\n \"score\": 75622.12339690303\n },\n {\n \"content\": \" // Quick helper trait for making queued blocks with throw away channels\\n\\n trait IntoQueued {\\n\\n fn into_queued(self) -> QueuedBlock;\\n\\n }\\n\\n\\n\\n impl IntoQueued for Arc<Block> {\\n\\n fn into_queued(self) -> QueuedBlock {\\n\\n let (rsp_tx, _) = oneshot::channel();\\n\\n (self.prepare(), rsp_tx)\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn dequeue_gives_right_children() -> Result<()> {\\n\\n zebra_test::init();\\n\\n\\n\\n let block1: Arc<Block> =\\n\\n zebra_test::vectors::BLOCK_MAINNET_419200_BYTES.zcash_deserialize_into()?;\\n\\n let child1: Arc<Block> =\\n\\n zebra_test::vectors::BLOCK_MAINNET_419201_BYTES.zcash_deserialize_into()?;\\n\\n let child2 = block1.make_fake_child();\\n\",\n \"file_path\": \"zebra-state/src/service/non_finalized_state/queued_blocks.rs\",\n \"rank\": 69,\n \"score\": 74646.17057690752\n },\n {\n \"content\": \"#[cfg_attr(feature = \\\"test_sync_to_sapling_mainnet\\\", test)]\\n\\nfn sync_to_sapling_mainnet() {\\n\\n zebra_test::init();\\n\\n let network = Mainnet;\\n\\n create_cached_database(network).unwrap();\\n\\n}\\n\\n\\n\\n// Sync to the sapling activation height testnet and stop.\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 70,\n \"score\": 72899.98261924185\n },\n {\n \"content\": \"/// Compute an index of newly created transparent outputs, given a block and a\\n\\n/// list of precomputed transaction hashes.\\n\\nfn new_outputs(\\n\\n block: &Block,\\n\\n transaction_hashes: &[transaction::Hash],\\n\\n) -> Arc<HashMap<transparent::OutPoint, zs::Utxo>> {\\n\\n let mut new_outputs = HashMap::default();\\n\\n let height = block.coinbase_height().expect(\\\"block has coinbase height\\\");\\n\\n for (transaction, hash) in block\\n\\n .transactions\\n\\n .iter()\\n\\n .zip(transaction_hashes.iter().cloned())\\n\\n {\\n\\n let from_coinbase = transaction.is_coinbase();\\n\\n for (index, output) in transaction.outputs().iter().cloned().enumerate() {\\n\\n let index = index as u32;\\n\\n new_outputs.insert(\\n\\n transparent::OutPoint { hash, index },\\n\\n zs::Utxo {\\n\\n output,\\n\\n height,\\n\\n from_coinbase,\\n\\n },\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n Arc::new(new_outputs)\\n\\n}\\n\",\n \"file_path\": \"zebra-consensus/src/block.rs\",\n \"rank\": 71,\n \"score\": 72899.98261924185\n },\n {\n \"content\": \"#[cfg_attr(feature = \\\"test_sync_to_sapling_testnet\\\", test)]\\n\\nfn sync_to_sapling_testnet() {\\n\\n zebra_test::init();\\n\\n let network = Testnet;\\n\\n create_cached_database(network).unwrap();\\n\\n}\\n\\n\\n\\n/// Test syncing 1200 blocks (3 checkpoints) past the last checkpoint on mainnet.\\n\\n///\\n\\n/// This assumes that the config'd state is already synced at or near Sapling\\n\\n/// activation on mainnet. If the state has already synced past Sapling\\n\\n/// activation by 1200 blocks, it will fail.\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 72,\n \"score\": 72899.98261924185\n },\n {\n \"content\": \"#[cfg_attr(feature = \\\"test_sync_past_sapling_mainnet\\\", test)]\\n\\nfn sync_past_sapling_mainnet() {\\n\\n zebra_test::init();\\n\\n let network = Mainnet;\\n\\n sync_past_sapling(network).unwrap();\\n\\n}\\n\\n\\n\\n/// Test syncing 1200 blocks (3 checkpoints) past the last checkpoint on testnet.\\n\\n///\\n\\n/// This assumes that the config'd state is already synced at or near Sapling\\n\\n/// activation on testnet. If the state has already synced past Sapling\\n\\n/// activation by 1200 blocks, it will fail.\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 73,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"#[cfg_attr(feature = \\\"test_sync_past_sapling_testnet\\\", test)]\\n\\nfn sync_past_sapling_testnet() {\\n\\n zebra_test::init();\\n\\n let network = Testnet;\\n\\n sync_past_sapling(network).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 74,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"#[test]\\n\\nfn memo_fmt() {\\n\\n zebra_test::init();\\n\\n\\n\\n let memo = Memo(Box::new(\\n\\n *b\\\"thiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis \\\\\\n\\n iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis \\\\\\n\\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa \\\\\\n\\n veeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeryyyyyyyyyyyyyyyyyyyyyyyyyy \\\\\\n\\n looooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooong \\\\\\n\\n meeeeeeeeeeeeeeeeeeemooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo \\\\\\n\\n but it's just short enough\\\",\\n\\n ));\\n\\n\\n\\n assert_eq!(format!(\\\"{:?}\\\", memo),\\n\\n \\\"Memo(\\\\\\\"thiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiis aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa veeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeryyyyyyyyyyyyyyyyyyyyyyyyyy looooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooong meeeeeeeeeeeeeeeeeeemooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo but it\\\\\\\\\\\\'s just short enough\\\\\\\")\\\"\\n\\n );\\n\\n\\n\\n let mut some_bytes = [0u8; 512];\\n\\n some_bytes[0] = 0xF6;\\n\\n\\n\\n assert_eq!(format!(\\\"{:?}\\\", Memo(Box::new(some_bytes))),\\n\\n \\\"Memo(\\\\\\\"f600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\\\\\\\")\\\"\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/transaction/memo.rs\",\n \"rank\": 75,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"#[test]\\n\\nfn memo_from_string() {\\n\\n zebra_test::init();\\n\\n\\n\\n let memo = Memo::try_from(\\\"foo bar baz\\\".as_ref()).unwrap();\\n\\n\\n\\n let mut bytes = [0; 512];\\n\\n bytes[0..11].copy_from_slice(&[102, 111, 111, 32, 98, 97, 114, 32, 98, 97, 122]);\\n\\n\\n\\n assert!(memo.0.iter().eq(bytes.iter()));\\n\\n}\\n\",\n \"file_path\": \"zebra-chain/src/transaction/memo.rs\",\n \"rank\": 76,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"#[test]\\n\\nfn operator_tests() {\\n\\n zebra_test::init();\\n\\n\\n\\n assert_eq!(Some(Height(2)), Height(1) + Height(1));\\n\\n assert_eq!(None, Height::MAX + Height(1));\\n\\n // Bad heights aren't caught at compile-time or runtime, until we add or subtract\\n\\n assert_eq!(None, Height(Height::MAX_AS_U32 + 1) + Height(0));\\n\\n assert_eq!(None, Height(i32::MAX as u32) + Height(0));\\n\\n assert_eq!(None, Height(u32::MAX) + Height(0));\\n\\n\\n\\n assert_eq!(Some(Height(2)), Height(1) + 1);\\n\\n assert_eq!(None, Height::MAX + 1);\\n\\n // Adding negative numbers\\n\\n assert_eq!(Some(Height(1)), Height(2) + -1);\\n\\n assert_eq!(Some(Height(0)), Height(1) + -1);\\n\\n assert_eq!(None, Height(0) + -1);\\n\\n assert_eq!(Some(Height(Height::MAX_AS_U32 - 1)), Height::MAX + -1);\\n\\n // Bad heights aren't caught at compile-time or runtime, until we add or subtract\\n\\n // `+ 0` would also cause an error here, but it triggers a spurious clippy lint\\n\\n assert_eq!(None, Height(Height::MAX_AS_U32 + 1) + 1);\\n\",\n \"file_path\": \"zebra-chain/src/block/height.rs\",\n \"rank\": 77,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"/// Returns `ValidateContextError::OrphanedBlock` if the height of the given\\n\\n/// block is less than or equal to the finalized tip height.\\n\\nfn block_is_not_orphaned(\\n\\n finalized_tip_height: block::Height,\\n\\n candidate_height: block::Height,\\n\\n) -> Result<(), ValidateContextError> {\\n\\n if candidate_height <= finalized_tip_height {\\n\\n Err(ValidateContextError::OrphanedBlock {\\n\\n candidate_height,\\n\\n finalized_tip_height,\\n\\n })\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-state/src/service/check.rs\",\n \"rank\": 78,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"#[test]\\n\\nfn activation_bijective() {\\n\\n zebra_test::init();\\n\\n\\n\\n let mainnet_activations = NetworkUpgrade::activation_list(Mainnet);\\n\\n let mainnet_heights: HashSet<&block::Height> = mainnet_activations.keys().collect();\\n\\n assert_eq!(MAINNET_ACTIVATION_HEIGHTS.len(), mainnet_heights.len());\\n\\n\\n\\n let mainnet_nus: HashSet<&NetworkUpgrade> = mainnet_activations.values().collect();\\n\\n assert_eq!(MAINNET_ACTIVATION_HEIGHTS.len(), mainnet_nus.len());\\n\\n\\n\\n let testnet_activations = NetworkUpgrade::activation_list(Testnet);\\n\\n let testnet_heights: HashSet<&block::Height> = testnet_activations.keys().collect();\\n\\n assert_eq!(TESTNET_ACTIVATION_HEIGHTS.len(), testnet_heights.len());\\n\\n\\n\\n let testnet_nus: HashSet<&NetworkUpgrade> = testnet_activations.values().collect();\\n\\n assert_eq!(TESTNET_ACTIVATION_HEIGHTS.len(), testnet_nus.len());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/parameters/tests.rs\",\n \"rank\": 79,\n \"score\": 71654.5600450422\n },\n {\n \"content\": \"/// Helper trait to organize inverse operations done on the `Chain` type. Used to\\n\\n/// overload the `update_chain_state_with` and `revert_chain_state_with` methods\\n\\n/// based on the type of the argument.\\n\\n///\\n\\n/// This trait was motivated by the length of the `push` and `pop_root` functions\\n\\n/// and fear that it would be easy to introduce bugs when updating them unless\\n\\n/// the code was reorganized to keep related operations adjacent to eachother.\\n\\ntrait UpdateWith<T> {\\n\\n /// Update `Chain` cumulative data members to add data that are derived from\\n\\n /// `T`\\n\\n fn update_chain_state_with(&mut self, _: &T);\\n\\n\\n\\n /// Update `Chain` cumulative data members to remove data that are derived\\n\\n /// from `T`\\n\\n fn revert_chain_state_with(&mut self, _: &T);\\n\\n}\\n\\n\\n\\nimpl UpdateWith<PreparedBlock> for Chain {\\n\\n fn update_chain_state_with(&mut self, prepared: &PreparedBlock) {\\n\\n let (block, hash, height, transaction_hashes) = (\\n\\n prepared.block.as_ref(),\\n\\n prepared.hash,\\n\\n prepared.height,\\n\\n &prepared.transaction_hashes,\\n\\n );\\n\\n\\n\\n // add hash to height_by_hash\\n\",\n \"file_path\": \"zebra-state/src/service/non_finalized_state/chain.rs\",\n \"rank\": 80,\n \"score\": 71248.98282590837\n },\n {\n \"content\": \"/// Validate the time and `difficulty_threshold` from a candidate block's\\n\\n/// header.\\n\\n///\\n\\n/// Uses the `difficulty_adjustment` context for the block to:\\n\\n/// * check that the candidate block's time is within the valid range,\\n\\n/// based on the network and candidate height, and\\n\\n/// * check that the expected difficulty is equal to the block's\\n\\n/// `difficulty_threshold`.\\n\\n///\\n\\n/// These checks are performed together, because the time field is used to\\n\\n/// calculate the expected difficulty adjustment.\\n\\nfn difficulty_threshold_is_valid(\\n\\n difficulty_threshold: CompactDifficulty,\\n\\n difficulty_adjustment: AdjustedDifficulty,\\n\\n) -> Result<(), ValidateContextError> {\\n\\n // Check the block header time consensus rules from the Zcash specification\\n\\n let candidate_height = difficulty_adjustment.candidate_height();\\n\\n let candidate_time = difficulty_adjustment.candidate_time();\\n\\n let network = difficulty_adjustment.network();\\n\\n let median_time_past = difficulty_adjustment.median_time_past();\\n\\n let block_time_max =\\n\\n median_time_past + Duration::seconds(difficulty::BLOCK_MAX_TIME_SINCE_MEDIAN);\\n\\n if candidate_time <= median_time_past {\\n\\n Err(ValidateContextError::TimeTooEarly {\\n\\n candidate_time,\\n\\n median_time_past,\\n\\n })?\\n\\n }\\n\\n\\n\\n // The maximum time rule is only active on Testnet from a specific height\\n\\n if NetworkUpgrade::is_max_block_time_enforced(network, candidate_height)\\n\",\n \"file_path\": \"zebra-state/src/service/check.rs\",\n \"rank\": 81,\n \"score\": 70481.86033722859\n },\n {\n \"content\": \"#[test]\\n\\nfn deserialize_blockheader() {\\n\\n zebra_test::init();\\n\\n\\n\\n // Includes the 32-byte nonce and 3-byte equihash length field.\\n\\n const BLOCK_HEADER_LENGTH: usize = crate::work::equihash::Solution::INPUT_LENGTH\\n\\n + 32\\n\\n + 3\\n\\n + crate::work::equihash::SOLUTION_SIZE;\\n\\n\\n\\n for block in zebra_test::vectors::BLOCKS.iter() {\\n\\n let header_bytes = &block[..BLOCK_HEADER_LENGTH];\\n\\n\\n\\n let _header = header_bytes\\n\\n .zcash_deserialize_into::<Header>()\\n\\n .expect(\\\"blockheader test vector should deserialize\\\");\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/vectors.rs\",\n \"rank\": 82,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn blockheaderhash_from_blockheader() {\\n\\n zebra_test::init();\\n\\n\\n\\n let blockheader = generate::block_header();\\n\\n\\n\\n let hash = Hash::from(&blockheader);\\n\\n\\n\\n assert_eq!(\\n\\n format!(\\\"{:?}\\\", hash),\\n\\n \\\"block::Hash(\\\\\\\"d1d6974bbe1d4d127c889119b2fc05724c67588dc72708839727586b8c2bc939\\\\\\\")\\\"\\n\\n );\\n\\n\\n\\n let mut bytes = Cursor::new(Vec::new());\\n\\n\\n\\n blockheader\\n\\n .zcash_serialize(&mut bytes)\\n\\n .expect(\\\"these bytes to serialize from a blockheader without issue\\\");\\n\\n\\n\\n bytes.set_position(0);\\n\\n let other_header = bytes\\n\\n .zcash_deserialize_into()\\n\\n .expect(\\\"these bytes to deserialize into a blockheader without issue\\\");\\n\\n\\n\\n assert_eq!(blockheader, other_header);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/vectors.rs\",\n \"rank\": 83,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn blockheaderhash_debug() {\\n\\n zebra_test::init();\\n\\n\\n\\n let preimage = b\\\"foo bar baz\\\";\\n\\n let mut sha_writer = sha256d::Writer::default();\\n\\n let _ = sha_writer.write_all(preimage);\\n\\n\\n\\n let hash = Hash(sha_writer.finish());\\n\\n\\n\\n assert_eq!(\\n\\n format!(\\\"{:?}\\\", hash),\\n\\n \\\"block::Hash(\\\\\\\"3166411bd5343e0b284a108f39a929fbbb62619784f8c6dafe520703b5b446bf\\\\\\\")\\\"\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/vectors.rs\",\n \"rank\": 84,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn deserialize_block() {\\n\\n zebra_test::init();\\n\\n\\n\\n // this one has a bad version field\\n\\n zebra_test::vectors::BLOCK_MAINNET_434873_BYTES\\n\\n .zcash_deserialize_into::<Block>()\\n\\n .expect(\\\"block test vector should deserialize\\\");\\n\\n\\n\\n for block_bytes in zebra_test::vectors::BLOCKS.iter() {\\n\\n let block = block_bytes\\n\\n .zcash_deserialize_into::<Block>()\\n\\n .expect(\\\"block is structurally valid\\\");\\n\\n\\n\\n let round_trip_bytes = block\\n\\n .zcash_serialize_to_vec()\\n\\n .expect(\\\"vec serialization is infallible\\\");\\n\\n\\n\\n assert_eq!(&round_trip_bytes[..], *block_bytes);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/block/tests/vectors.rs\",\n \"rank\": 85,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn branch_id_bijective() {\\n\\n zebra_test::init();\\n\\n\\n\\n let branch_id_list = NetworkUpgrade::branch_id_list();\\n\\n let nus: HashSet<&NetworkUpgrade> = branch_id_list.keys().collect();\\n\\n assert_eq!(CONSENSUS_BRANCH_IDS.len(), nus.len());\\n\\n\\n\\n let branch_ids: HashSet<&ConsensusBranchId> = branch_id_list.values().collect();\\n\\n assert_eq!(CONSENSUS_BRANCH_IDS.len(), branch_ids.len());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/parameters/tests.rs\",\n \"rank\": 86,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn activation_extremes_mainnet() {\\n\\n zebra_test::init();\\n\\n activation_extremes(Mainnet)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/parameters/tests.rs\",\n \"rank\": 87,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn activation_consistent_testnet() {\\n\\n zebra_test::init();\\n\\n activation_consistent(Testnet)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/parameters/tests.rs\",\n \"rank\": 88,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn activation_extremes_testnet() {\\n\\n zebra_test::init();\\n\\n activation_extremes(Testnet)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/parameters/tests.rs\",\n \"rank\": 89,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn round_trip_work_expanded() {\\n\\n zebra_test::init();\\n\\n\\n\\n proptest!(|(work_before in any::<Work>())| {\\n\\n let work: U256 = work_before.as_u128().into();\\n\\n let expanded = work_to_expanded(work);\\n\\n let work_after = Work::try_from(expanded).unwrap();\\n\\n prop_assert_eq!(work_before, work_after);\\n\\n });\\n\\n}\\n\\n\\n\\n/// Check that the block locator heights are sensible.\\n\",\n \"file_path\": \"zebra-state/src/tests.rs\",\n \"rank\": 90,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn activation_consistent_mainnet() {\\n\\n zebra_test::init();\\n\\n activation_consistent(Mainnet)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-chain/src/parameters/tests.rs\",\n \"rank\": 91,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn minimum_difficulty_mainnet() {\\n\\n minimum_difficulty(Mainnet)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/parameters/tests.rs\",\n \"rank\": 92,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn test_block_locator_heights() {\\n\\n zebra_test::init();\\n\\n\\n\\n for (height, min_height) in BLOCK_LOCATOR_CASES.iter().cloned() {\\n\\n let locator = util::block_locator_heights(block::Height(height));\\n\\n\\n\\n assert!(!locator.is_empty(), \\\"locators must not be empty\\\");\\n\\n if (height - min_height) > 1 {\\n\\n assert!(\\n\\n locator.len() > 2,\\n\\n \\\"non-trivial locators must have some intermediate heights\\\"\\n\\n );\\n\\n }\\n\\n\\n\\n assert_eq!(\\n\\n locator[0],\\n\\n block::Height(height),\\n\\n \\\"locators must start with the tip height\\\"\\n\\n );\\n\\n\\n\",\n \"file_path\": \"zebra-state/src/tests.rs\",\n \"rank\": 93,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn minimum_difficulty_testnet() {\\n\\n minimum_difficulty(Testnet)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebra-consensus/src/parameters/tests.rs\",\n \"rank\": 94,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"fn parse_coinbase_height(\\n\\n mut data: Vec<u8>,\\n\\n) -> Result<(block::Height, CoinbaseData), SerializationError> {\\n\\n use block::Height;\\n\\n match (data.get(0), data.len()) {\\n\\n // Blocks 1 through 16 inclusive encode block height with OP_N opcodes.\\n\\n (Some(op_n @ 0x51..=0x60), len) if len >= 1 => Ok((\\n\\n Height((op_n - 0x50) as u32),\\n\\n CoinbaseData(data.split_off(1)),\\n\\n )),\\n\\n // Blocks 17 through 128 exclusive encode block height with the `0x01` opcode.\\n\\n // The Bitcoin encoding requires that the most significant byte is below 0x80.\\n\\n (Some(0x01), len) if len >= 2 && data[1] < 0x80 => {\\n\\n Ok((Height(data[1] as u32), CoinbaseData(data.split_off(2))))\\n\\n }\\n\\n // Blocks 128 through 32768 exclusive encode block height with the `0x02` opcode.\\n\\n // The Bitcoin encoding requires that the most significant byte is below 0x80.\\n\\n (Some(0x02), len) if len >= 3 && data[2] < 0x80 => Ok((\\n\\n Height(data[1] as u32 + ((data[2] as u32) << 8)),\\n\\n CoinbaseData(data.split_off(3)),\\n\",\n \"file_path\": \"zebra-chain/src/transparent/serialize.rs\",\n \"rank\": 95,\n \"score\": 70476.83311990302\n },\n {\n \"content\": \"#[test]\\n\\nfn help_no_args() -> Result<()> {\\n\\n zebra_test::init();\\n\\n\\n\\n let testdir = testdir()?.with_config(&mut default_test_config()?)?;\\n\\n\\n\\n let child = testdir.spawn_child(&[\\\"help\\\"])?;\\n\\n let output = child.wait_with_output()?;\\n\\n let output = output.assert_success()?;\\n\\n\\n\\n // First line haves the version\\n\\n output.stdout_contains(r\\\"zebrad [0-9].[0-9].[0-9]\\\")?;\\n\\n\\n\\n // Make sure we are in help by looking usage string\\n\\n output.stdout_contains(r\\\"USAGE:\\\")?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 96,\n \"score\": 70079.53676886884\n },\n {\n \"content\": \"#[test]\\n\\nfn generate_no_args() -> Result<()> {\\n\\n zebra_test::init();\\n\\n\\n\\n let child = testdir()?\\n\\n .with_config(&mut default_test_config()?)?\\n\\n .spawn_child(&[\\\"generate\\\"])?;\\n\\n\\n\\n let output = child.wait_with_output()?;\\n\\n let output = output.assert_success()?;\\n\\n\\n\\n // First line\\n\\n output.stdout_contains(r\\\"# Default configuration for zebrad.\\\")?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// Panics if `$pred` is false, with an error report containing:\\n\\n/// * context from `$source`, and\\n\\n/// * an optional wrapper error, using `$fmt_arg`+ as a format string and\\n\\n/// arguments.\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 97,\n \"score\": 70079.53676886884\n },\n {\n \"content\": \"#[test]\\n\\nfn help_args() -> Result<()> {\\n\\n zebra_test::init();\\n\\n\\n\\n let testdir = testdir()?;\\n\\n let testdir = &testdir;\\n\\n\\n\\n // The subcommand \\\"argument\\\" wasn't recognized.\\n\\n let child = testdir.spawn_child(&[\\\"help\\\", \\\"argument\\\"])?;\\n\\n let output = child.wait_with_output()?;\\n\\n output.assert_failure()?;\\n\\n\\n\\n // option `-f` does not accept an argument\\n\\n let child = testdir.spawn_child(&[\\\"help\\\", \\\"-f\\\"])?;\\n\\n let output = child.wait_with_output()?;\\n\\n output.assert_failure()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 98,\n \"score\": 70079.53676886884\n },\n {\n \"content\": \"#[test]\\n\\nfn generate_args() -> Result<()> {\\n\\n zebra_test::init();\\n\\n\\n\\n let testdir = testdir()?;\\n\\n let testdir = &testdir;\\n\\n\\n\\n // unexpected free argument `argument`\\n\\n let child = testdir.spawn_child(&[\\\"generate\\\", \\\"argument\\\"])?;\\n\\n let output = child.wait_with_output()?;\\n\\n output.assert_failure()?;\\n\\n\\n\\n // unrecognized option `-f`\\n\\n let child = testdir.spawn_child(&[\\\"generate\\\", \\\"-f\\\"])?;\\n\\n let output = child.wait_with_output()?;\\n\\n output.assert_failure()?;\\n\\n\\n\\n // missing argument to option `-o`\\n\\n let child = testdir.spawn_child(&[\\\"generate\\\", \\\"-o\\\"])?;\\n\\n let output = child.wait_with_output()?;\\n\\n output.assert_failure()?;\\n\",\n \"file_path\": \"zebrad/tests/acceptance.rs\",\n \"rank\": 99,\n \"score\": 70079.53676886884\n }\n]","isConversational":false}}},{"rowIdx":1997,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/de/mod.rs"},"repo_name":{"kind":"string","value":"RoccoDev/bson-rust"},"commit":{"kind":"string","value":"9781781212056c619464be8444a27587c7dc5de9"},"file_code":{"kind":"string","value":"\n\nmod error;\nmod raw;\nmod serde;\n\npub use self::{\n error::{Error, Result},\n serde::Deserializer,\n};\n\nuse std::io::Read;\n\nuse crate::{\n bson::{Array, Binary, Bson, DbPointer, Document, JavaScriptCodeWithScope, Regex, Timestamp},\n oid::{self, ObjectId},\n ser::write_i32,\n spec::{self, BinarySubtype},\n Decimal128,\n};\n\nuse ::serde::{\n de::{DeserializeOwned, Error as _, Unexpected},\n Deserialize,\n};\n\npub(crate) use self::serde::BsonVisitor;\n\npub(crate) const MAX_BSON_SIZE: i32 = 16 * 1024 * 1024;\npub(crate) const MIN_BSON_DOCUMENT_SIZE: i32 = 4 + 1; \npub(crate) const MIN_BSON_STRING_SIZE: i32 = 4 + 1; \npub(crate) const MIN_CODE_WITH_SCOPE_SIZE: i32 = 4 + MIN_BSON_STRING_SIZE + MIN_BSON_DOCUMENT_SIZE;\n\npub(crate) fn ensure_read_exactly<F, R>(\n reader: &mut R,\n length: usize,\n error_message: &str,\n func: F,\n) -> Result<()>\nwhere\n F: FnOnce(&mut std::io::Cursor<Vec<u8>>) -> Result<()>,\n R: Read + ?Sized,\n{\n let mut buf = vec![0u8; length];\n reader.read_exact(&mut buf)?;\n let mut cursor = std::io::Cursor::new(buf);\n\n func(&mut cursor)?;\n\n if cursor.position() != length as u64 {\n return Err(Error::invalid_length(length, &error_message));\n }\n Ok(())\n}\n\npub(crate) fn read_string<R: Read + ?Sized>(reader: &mut R, utf8_lossy: bool) -> Result<String> {\n let len = read_i32(reader)?;\n\n \n if len < 1 {\n return Err(Error::invalid_length(\n len as usize,\n &\"UTF-8 string must have at least 1 byte\",\n ));\n }\n\n let s = if utf8_lossy {\n let mut buf = Vec::with_capacity(len as usize - 1);\n reader.take(len as u64 - 1).read_to_end(&mut buf)?;\n String::from_utf8_lossy(&buf).to_string()\n } else {\n let mut s = String::with_capacity(len as usize - 1);\n reader.take(len as u64 - 1).read_to_string(&mut s)?;\n s\n };\n\n \n if read_u8(reader)? != 0 {\n return Err(Error::invalid_length(\n len as usize,\n &\"contents of string longer than provided length\",\n ));\n }\n\n Ok(s)\n}\n\npub(crate) fn read_bool<R: Read>(mut reader: R) -> Result<bool> {\n let val = read_u8(&mut reader)?;\n if val > 1 {\n return Err(Error::invalid_value(\n Unexpected::Unsigned(val as u64),\n &\"boolean must be stored as 0 or 1\",\n ));\n }\n\n Ok(val != 0)\n}\n\nfn read_cstring<R: Read + ?Sized>(reader: &mut R) -> Result<String> {\n let mut v = Vec::new();\n\n loop {\n let c = read_u8(reader)?;\n if c == 0 {\n break;\n }\n v.push(c);\n }\n\n Ok(String::from_utf8(v)?)\n}\n\n#[inline]\npub(crate) fn read_u8<R: Read + ?Sized>(reader: &mut R) -> Result<u8> {\n let mut buf = [0; 1];\n reader.read_exact(&mut buf)?;\n Ok(u8::from_le_bytes(buf))\n}\n\n#[inline]\npub(crate) fn read_i32<R: Read + ?Sized>(reader: &mut R) -> Result<i32> {\n let mut buf = [0; 4];\n reader.read_exact(&mut buf)?;\n Ok(i32::from_le_bytes(buf))\n}\n\n#[inline]\npub(crate) fn read_i64<R: Read + ?Sized>(reader: &mut R) -> Result<i64> {\n let mut buf = [0; 8];\n reader.read_exact(&mut buf)?;\n Ok(i64::from_le_bytes(buf))\n}\n\n#[inline]\nfn read_f64<R: Read + ?Sized>(reader: &mut R) -> Result<f64> {\n let mut buf = [0; 8];\n reader.read_exact(&mut buf)?;\n Ok(f64::from_le_bytes(buf))\n}\n\n#[inline]\nfn read_f128<R: Read + ?Sized>(reader: &mut R) -> Result<Decimal128> {\n let mut buf = [0u8; 128 / 8];\n reader.read_exact(&mut buf)?;\n Ok(Decimal128 { bytes: buf })\n}\n\nfn deserialize_array<R: Read + ?Sized>(reader: &mut R, utf8_lossy: bool) -> Result<Array> {\n let mut arr = Array::new();\n let length = read_i32(reader)?;\n\n if !(MIN_BSON_DOCUMENT_SIZE..=MAX_BSON_SIZE).contains(&length) {\n return Err(Error::invalid_length(\n length as usize,\n &format!(\n \"array length must be between {} and {}\",\n MIN_BSON_DOCUMENT_SIZE, MAX_BSON_SIZE\n )\n .as_str(),\n ));\n }\n\n ensure_read_exactly(\n reader,\n (length as usize) - 4,\n \"array length longer than contents\",\n |cursor| {\n loop {\n let tag = read_u8(cursor)?;\n if tag == 0 {\n break;\n }\n\n let (_, val) = deserialize_bson_kvp(cursor, tag, utf8_lossy)?;\n arr.push(val)\n }\n Ok(())\n },\n )?;\n\n Ok(arr)\n}\n\npub(crate) fn deserialize_bson_kvp<R: Read + ?Sized>(\n reader: &mut R,\n tag: u8,\n utf8_lossy: bool,\n) -> Result<(String, Bson)> {\n use spec::ElementType;\n let key = read_cstring(reader)?;\n\n let val = match ElementType::from(tag) {\n Some(ElementType::Double) => Bson::Double(read_f64(reader)?),\n Some(ElementType::String) => read_string(reader, utf8_lossy).map(Bson::String)?,\n Some(ElementType::EmbeddedDocument) => Document::from_reader(reader).map(Bson::Document)?,\n Some(ElementType::Array) => deserialize_array(reader, utf8_lossy).map(Bson::Array)?,\n Some(ElementType::Binary) => Bson::Binary(Binary::from_reader(reader)?),\n Some(ElementType::ObjectId) => {\n let mut objid = [0; 12];\n for x in &mut objid {\n *x = read_u8(reader)?;\n }\n Bson::ObjectId(oid::ObjectId::from_bytes(objid))\n }\n Some(ElementType::Boolean) => Bson::Boolean(read_bool(reader)?),\n Some(ElementType::Null) => Bson::Null,\n Some(ElementType::RegularExpression) => {\n Bson::RegularExpression(Regex::from_reader(reader)?)\n }\n Some(ElementType::JavaScriptCode) => {\n read_string(reader, utf8_lossy).map(Bson::JavaScriptCode)?\n }\n Some(ElementType::JavaScriptCodeWithScope) => {\n Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope::from_reader(reader, utf8_lossy)?)\n }\n Some(ElementType::Int32) => read_i32(reader).map(Bson::Int32)?,\n Some(ElementType::Int64) => read_i64(reader).map(Bson::Int64)?,\n Some(ElementType::Timestamp) => Bson::Timestamp(Timestamp::from_reader(reader)?),\n Some(ElementType::DateTime) => {\n \n let time = read_i64(reader)?;\n Bson::DateTime(crate::DateTime::from_millis(time))\n }\n Some(ElementType::Symbol) => read_string(reader, utf8_lossy).map(Bson::Symbol)?,\n Some(ElementType::Decimal128) => read_f128(reader).map(Bson::Decimal128)?,\n Some(ElementType::Undefined) => Bson::Undefined,\n Some(ElementType::DbPointer) => Bson::DbPointer(DbPointer::from_reader(reader)?),\n Some(ElementType::MaxKey) => Bson::MaxKey,\n Some(ElementType::MinKey) => Bson::MinKey,\n None => {\n return Err(Error::UnrecognizedDocumentElementType {\n key,\n element_type: tag,\n })\n }\n };\n\n Ok((key, val))\n}\n\nimpl Binary {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let len = read_i32(&mut reader)?;\n if !(0..=MAX_BSON_SIZE).contains(&len) {\n return Err(Error::invalid_length(\n len as usize,\n &format!(\"binary length must be between 0 and {}\", MAX_BSON_SIZE).as_str(),\n ));\n }\n let subtype = BinarySubtype::from(read_u8(&mut reader)?);\n Self::from_reader_with_len_and_payload(reader, len, subtype)\n }\n\n pub(crate) fn from_reader_with_len_and_payload<R: Read>(\n mut reader: R,\n mut len: i32,\n subtype: BinarySubtype,\n ) -> Result<Self> {\n if !(0..=MAX_BSON_SIZE).contains(&len) {\n return Err(Error::invalid_length(\n len as usize,\n &format!(\"binary length must be between 0 and {}\", MAX_BSON_SIZE).as_str(),\n ));\n }\n\n \n if let BinarySubtype::BinaryOld = subtype {\n let data_len = read_i32(&mut reader)?;\n\n if !(0..=(MAX_BSON_SIZE - 4)).contains(&data_len) {\n return Err(Error::invalid_length(\n data_len as usize,\n &format!(\"0x02 length must be between 0 and {}\", MAX_BSON_SIZE - 4).as_str(),\n ));\n }\n\n if data_len + 4 != len {\n return Err(Error::invalid_length(\n data_len as usize,\n &\"0x02 length did not match top level binary length\",\n ));\n }\n\n len -= 4;\n }\n\n let mut bytes = Vec::with_capacity(len as usize);\n\n reader.take(len as u64).read_to_end(&mut bytes)?;\n Ok(Binary { subtype, bytes })\n }\n}\n\nimpl DbPointer {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let ns = read_string(&mut reader, false)?;\n let oid = ObjectId::from_reader(&mut reader)?;\n Ok(DbPointer {\n namespace: ns,\n id: oid,\n })\n }\n}\n\nimpl Regex {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let pattern = read_cstring(&mut reader)?;\n let options = read_cstring(&mut reader)?;\n\n Ok(Regex { pattern, options })\n }\n}\n\nimpl Timestamp {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n read_i64(&mut reader).map(Timestamp::from_le_i64)\n }\n}\n\nimpl ObjectId {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let mut buf = [0u8; 12];\n reader.read_exact(&mut buf)?;\n Ok(Self::from_bytes(buf))\n }\n}\n\nimpl JavaScriptCodeWithScope {\n pub(crate) fn from_reader<R: Read>(mut reader: R, utf8_lossy: bool) -> Result<Self> {\n let length = read_i32(&mut reader)?;\n if length < MIN_CODE_WITH_SCOPE_SIZE {\n return Err(Error::invalid_length(\n length as usize,\n &format!(\n \"code with scope length must be at least {}\",\n MIN_CODE_WITH_SCOPE_SIZE\n )\n .as_str(),\n ));\n } else if length > MAX_BSON_SIZE {\n return Err(Error::invalid_length(\n length as usize,\n &\"code with scope length too large\",\n ));\n }\n\n let mut buf = vec![0u8; (length - 4) as usize];\n reader.read_exact(&mut buf)?;\n\n let mut slice = buf.as_slice();\n let code = read_string(&mut slice, utf8_lossy)?;\n let scope = Document::from_reader(&mut slice)?;\n Ok(JavaScriptCodeWithScope { code, scope })\n }\n}\n\npub fn from_bson<T>(bson: Bson) -> Result<T>\nwhere\n T: DeserializeOwned,\n{\n let de = Deserializer::new(bson);\n Deserialize::deserialize(de)\n}\n\npub fn from_document<T>(doc: Document) -> Result<T>\nwhere\n T: DeserializeOwned,\n{\n from_bson(Bson::Document(doc))\n}\n\nfn reader_to_vec<R: Read>(mut reader: R) -> Result<Vec<u8>> {\n let length = read_i32(&mut reader)?;\n\n if length < MIN_BSON_DOCUMENT_SIZE {\n return Err(Error::custom(\"document size too small\"));\n }\n\n let mut bytes = Vec::with_capacity(length as usize);\n write_i32(&mut bytes, length).map_err(Error::custom)?;\n\n reader.take(length as u64 - 4).read_to_end(&mut bytes)?;\n Ok(bytes)\n}\n\npub fn from_reader<R, T>(reader: R) -> Result<T>\nwhere\n T: DeserializeOwned,\n R: Read,\n{\n let bytes = reader_to_vec(reader)?;\n from_slice(bytes.as_slice())\n}\n\npub fn from_reader_utf8_lossy<R, T>(reader: R) -> Result<T>\nwhere\n T: DeserializeOwned,\n R: Read,\n{\n let bytes = reader_to_vec(reader)?;\n from_slice_utf8_lossy(bytes.as_slice())\n}\n\npub fn from_slice<'de, T>(bytes: &'de [u8]) -> Result<T>\nwhere\n T: Deserialize<'de>,\n{\n let mut deserializer = raw::Deserializer::new(bytes, false);\n T::deserialize(&mut deserializer)\n}\n\npub fn from_slice_utf8_lossy<'de, T>(bytes: &'de [u8]) -> Result<T>\nwhere\n T: Deserialize<'de>,\n{\n let mut deserializer = raw::Deserializer::new(bytes, true);\n T::deserialize(&mut deserializer)\n}\n"},"prefix":{"kind":"string","value":"\n\nmod error;\nmod raw;\nmod serde;\n\npub use self::{\n error::{Error, Result},\n serde::Deserializer,\n};\n\nuse std::io::Read;\n\nuse crate::{\n bson::{Array, Binary, Bson, DbPointer, Document, JavaScriptCodeWithScope, Regex, Timestamp},\n oid::{self, ObjectId},\n ser::write_i32,\n spec::{self, BinarySubtype},\n Decimal128,\n};\n\nuse ::serde::{\n de::{DeserializeOwned, Error as _, Unexpected},\n Deserialize,\n};\n\npub(crate) use self::serde::BsonVisitor;\n\npub(crate) const MAX_BSON_SIZE: i32 = 16 * 1024 * 1024;\npub(crate) const MIN_BSON_DOCUMENT_SIZE: i32 = 4 + 1; \npub(crate) const MIN_BSON_STRING_SIZE: i32 = 4 + 1; \npub(crate) const MIN_CODE_WITH_SCOPE_SIZE: i32 = 4 + MIN_BSON_STRING_SIZE + MIN_BSON_DOCUMENT_SIZE;\n\npub(crate) fn ensure_read_exactly<F, R>(\n reader: &mut R,\n length: usize,\n error_message: &str,\n func: F,\n) -> Result<()>\nwhere\n F: FnOnce(&mut std::io::Cursor<Vec<u8>>) -> Result<()>,\n R: Read + ?Sized,\n{\n let mut buf = vec![0u8; length];\n reader.read_exact(&mut buf)?;\n let mut cursor = std::io::Cursor::new(buf);\n\n func(&mut cursor)?;\n\n if cursor.position() != length as u64 {\n return Err(Error::invalid_length(length, &error_message));\n }\n Ok(())\n}\n\npub(crate) fn read_string<R: Read + ?Sized>(reader: &mut R, utf8_lossy: bool) -> Result<String> {\n let len = read_i32(reader)?;\n\n \n if len < 1 {\n return Err(Error::invalid_length(\n len as usize,\n &\"UTF-8 string must have at least 1 byte\",\n ));\n }\n\n let s = if utf8_lossy {\n let mut buf = Vec::with_capacity(len as usize - 1);\n reader.take(len as u64 - 1).read_to_end(&mut buf)?;\n String::from_utf8_lossy(&buf).to_string()\n } else {\n let mut s = String::with_capacity(len as usize - 1);\n reader.take(len as u64 - 1).read_to_string(&mut s)?;\n s\n };\n\n \n if read_u8(reader)? != 0 {\n return Err(Error::invalid_length(\n len as usize,\n &\"contents of string longer than provided length\",\n ));\n }\n\n Ok(s)\n}\n\npub(crate) fn read_bool<R: Read>(mut reader: R) -> Result<bool> {\n let val = read_u8(&mut reader)?;\n if val > 1 {\n return Err(Error::invalid_value(\n Unexpected::Unsigned(val as u64),\n &\"boolean must be stored as 0 or 1\",\n ));\n }\n\n Ok(val != 0)\n}\n\nfn read_cstring<R: Read + ?Sized>(reader: &mut R) -> Result<String> {\n let mut v = Vec::new();\n\n loop {\n let c = read_u8(reader)?;\n if c == 0 {\n break;\n }\n v.push(c);\n }\n\n Ok(String::from_utf8(v)?)\n}\n\n#[inline]\npub(crate) fn read_u8<R: Read + ?Sized>(reader: &mut R) -> Result<u8> {\n let mut buf = [0; 1];\n reader.read_exact(&mut buf)?;\n Ok(u8::from_le_bytes(buf))\n}\n\n#[inline]\npub(crate) fn read_i32<R: Read + ?Sized>(reader: &mut R) -> Result<i32> {\n let mut buf = [0; 4];\n reader.read_exact(&mut buf)?;\n Ok(i32::from_le_bytes(buf))\n}\n\n#[inline]\npub(crate) fn read_i64<R: Read + ?Sized>(reader: &mut R) -> Result<i64> {\n let mut buf = [0; 8];\n reader.read_exact(&mut buf)?;\n Ok(i64::from_le_bytes(buf))\n}\n\n#[inline]\nfn read_f64<R: Read + ?Sized>(reader: &mut R) -> Result<f64> {\n let mut buf = [0; 8];\n reader.read_exact(&mut buf)?;\n Ok(f64::from_le_bytes(buf))\n}\n\n#[inline]\nfn read_f128<R: Read + ?Sized>(reader: &mut R) -> Result<Decimal128> {\n let mut buf = [0u8; 128 / 8];\n reader.read_exact(&mut buf)?;\n Ok(Decimal128 { bytes: buf })\n}\n\nfn deserialize_array<R: Read + ?Sized>(reader: &mut R, utf8_lossy: bool) -> Result<Array> {\n let mut arr = Array::new();\n let length = read_i32(reader)?;\n\n if !(MIN_BSON_DOCUMENT_SIZE..=MAX_BSON_SIZE).contains(&length) {\n return Err(Error::invalid_length(\n length as usize,\n &format!(\n \"array length must be between {} and {}\",\n MIN_BSON_DOCUMENT_SIZE, MAX_BSON_SIZE\n )\n .as_str(),\n ));\n }\n\n ensure_read_exactly(\n reader,\n (length as usize) - 4,\n \"array length longer than contents\",\n |cursor| {\n loop {\n let tag = read_u8(cursor)?;\n if tag == 0 {\n "},"suffix":{"kind":"string","value":"\n\npub(crate) fn deserialize_bson_kvp<R: Read + ?Sized>(\n reader: &mut R,\n tag: u8,\n utf8_lossy: bool,\n) -> Result<(String, Bson)> {\n use spec::ElementType;\n let key = read_cstring(reader)?;\n\n let val = match ElementType::from(tag) {\n Some(ElementType::Double) => Bson::Double(read_f64(reader)?),\n Some(ElementType::String) => read_string(reader, utf8_lossy).map(Bson::String)?,\n Some(ElementType::EmbeddedDocument) => Document::from_reader(reader).map(Bson::Document)?,\n Some(ElementType::Array) => deserialize_array(reader, utf8_lossy).map(Bson::Array)?,\n Some(ElementType::Binary) => Bson::Binary(Binary::from_reader(reader)?),\n Some(ElementType::ObjectId) => {\n let mut objid = [0; 12];\n for x in &mut objid {\n *x = read_u8(reader)?;\n }\n Bson::ObjectId(oid::ObjectId::from_bytes(objid))\n }\n Some(ElementType::Boolean) => Bson::Boolean(read_bool(reader)?),\n Some(ElementType::Null) => Bson::Null,\n Some(ElementType::RegularExpression) => {\n Bson::RegularExpression(Regex::from_reader(reader)?)\n }\n Some(ElementType::JavaScriptCode) => {\n read_string(reader, utf8_lossy).map(Bson::JavaScriptCode)?\n }\n Some(ElementType::JavaScriptCodeWithScope) => {\n Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope::from_reader(reader, utf8_lossy)?)\n }\n Some(ElementType::Int32) => read_i32(reader).map(Bson::Int32)?,\n Some(ElementType::Int64) => read_i64(reader).map(Bson::Int64)?,\n Some(ElementType::Timestamp) => Bson::Timestamp(Timestamp::from_reader(reader)?),\n Some(ElementType::DateTime) => {\n \n let time = read_i64(reader)?;\n Bson::DateTime(crate::DateTime::from_millis(time))\n }\n Some(ElementType::Symbol) => read_string(reader, utf8_lossy).map(Bson::Symbol)?,\n Some(ElementType::Decimal128) => read_f128(reader).map(Bson::Decimal128)?,\n Some(ElementType::Undefined) => Bson::Undefined,\n Some(ElementType::DbPointer) => Bson::DbPointer(DbPointer::from_reader(reader)?),\n Some(ElementType::MaxKey) => Bson::MaxKey,\n Some(ElementType::MinKey) => Bson::MinKey,\n None => {\n return Err(Error::UnrecognizedDocumentElementType {\n key,\n element_type: tag,\n })\n }\n };\n\n Ok((key, val))\n}\n\nimpl Binary {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let len = read_i32(&mut reader)?;\n if !(0..=MAX_BSON_SIZE).contains(&len) {\n return Err(Error::invalid_length(\n len as usize,\n &format!(\"binary length must be between 0 and {}\", MAX_BSON_SIZE).as_str(),\n ));\n }\n let subtype = BinarySubtype::from(read_u8(&mut reader)?);\n Self::from_reader_with_len_and_payload(reader, len, subtype)\n }\n\n pub(crate) fn from_reader_with_len_and_payload<R: Read>(\n mut reader: R,\n mut len: i32,\n subtype: BinarySubtype,\n ) -> Result<Self> {\n if !(0..=MAX_BSON_SIZE).contains(&len) {\n return Err(Error::invalid_length(\n len as usize,\n &format!(\"binary length must be between 0 and {}\", MAX_BSON_SIZE).as_str(),\n ));\n }\n\n \n if let BinarySubtype::BinaryOld = subtype {\n let data_len = read_i32(&mut reader)?;\n\n if !(0..=(MAX_BSON_SIZE - 4)).contains(&data_len) {\n return Err(Error::invalid_length(\n data_len as usize,\n &format!(\"0x02 length must be between 0 and {}\", MAX_BSON_SIZE - 4).as_str(),\n ));\n }\n\n if data_len + 4 != len {\n return Err(Error::invalid_length(\n data_len as usize,\n &\"0x02 length did not match top level binary length\",\n ));\n }\n\n len -= 4;\n }\n\n let mut bytes = Vec::with_capacity(len as usize);\n\n reader.take(len as u64).read_to_end(&mut bytes)?;\n Ok(Binary { subtype, bytes })\n }\n}\n\nimpl DbPointer {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let ns = read_string(&mut reader, false)?;\n let oid = ObjectId::from_reader(&mut reader)?;\n Ok(DbPointer {\n namespace: ns,\n id: oid,\n })\n }\n}\n\nimpl Regex {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let pattern = read_cstring(&mut reader)?;\n let options = read_cstring(&mut reader)?;\n\n Ok(Regex { pattern, options })\n }\n}\n\nimpl Timestamp {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n read_i64(&mut reader).map(Timestamp::from_le_i64)\n }\n}\n\nimpl ObjectId {\n pub(crate) fn from_reader<R: Read>(mut reader: R) -> Result<Self> {\n let mut buf = [0u8; 12];\n reader.read_exact(&mut buf)?;\n Ok(Self::from_bytes(buf))\n }\n}\n\nimpl JavaScriptCodeWithScope {\n pub(crate) fn from_reader<R: Read>(mut reader: R, utf8_lossy: bool) -> Result<Self> {\n let length = read_i32(&mut reader)?;\n if length < MIN_CODE_WITH_SCOPE_SIZE {\n return Err(Error::invalid_length(\n length as usize,\n &format!(\n \"code with scope length must be at least {}\",\n MIN_CODE_WITH_SCOPE_SIZE\n )\n .as_str(),\n ));\n } else if length > MAX_BSON_SIZE {\n return Err(Error::invalid_length(\n length as usize,\n &\"code with scope length too large\",\n ));\n }\n\n let mut buf = vec![0u8; (length - 4) as usize];\n reader.read_exact(&mut buf)?;\n\n let mut slice = buf.as_slice();\n let code = read_string(&mut slice, utf8_lossy)?;\n let scope = Document::from_reader(&mut slice)?;\n Ok(JavaScriptCodeWithScope { code, scope })\n }\n}\n\npub fn from_bson<T>(bson: Bson) -> Result<T>\nwhere\n T: DeserializeOwned,\n{\n let de = Deserializer::new(bson);\n Deserialize::deserialize(de)\n}\n\npub fn from_document<T>(doc: Document) -> Result<T>\nwhere\n T: DeserializeOwned,\n{\n from_bson(Bson::Document(doc))\n}\n\nfn reader_to_vec<R: Read>(mut reader: R) -> Result<Vec<u8>> {\n let length = read_i32(&mut reader)?;\n\n if length < MIN_BSON_DOCUMENT_SIZE {\n return Err(Error::custom(\"document size too small\"));\n }\n\n let mut bytes = Vec::with_capacity(length as usize);\n write_i32(&mut bytes, length).map_err(Error::custom)?;\n\n reader.take(length as u64 - 4).read_to_end(&mut bytes)?;\n Ok(bytes)\n}\n\npub fn from_reader<R, T>(reader: R) -> Result<T>\nwhere\n T: DeserializeOwned,\n R: Read,\n{\n let bytes = reader_to_vec(reader)?;\n from_slice(bytes.as_slice())\n}\n\npub fn from_reader_utf8_lossy<R, T>(reader: R) -> Result<T>\nwhere\n T: DeserializeOwned,\n R: Read,\n{\n let bytes = reader_to_vec(reader)?;\n from_slice_utf8_lossy(bytes.as_slice())\n}\n\npub fn from_slice<'de, T>(bytes: &'de [u8]) -> Result<T>\nwhere\n T: Deserialize<'de>,\n{\n let mut deserializer = raw::Deserializer::new(bytes, false);\n T::deserialize(&mut deserializer)\n}\n\npub fn from_slice_utf8_lossy<'de, T>(bytes: &'de [u8]) -> Result<T>\nwhere\n T: Deserialize<'de>,\n{\n let mut deserializer = raw::Deserializer::new(bytes, true);\n T::deserialize(&mut deserializer)\n}\n"},"middle":{"kind":"string","value":"break;\n }\n\n let (_, val) = deserialize_bson_kvp(cursor, tag, utf8_lossy)?;\n arr.push(val)\n }\n Ok(())\n },\n )?;\n\n Ok(arr)\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// Attempts to serialize a u64 as an i32. Errors if an exact conversion is not possible.\n\npub fn serialize_u64_as_i32<S: Serializer>(val: &u64, serializer: S) -> Result<S::Ok, S::Error> {\n\n match i32::try_from(*val) {\n\n Ok(val) => serializer.serialize_i32(val),\n\n Err(_) => Err(ser::Error::custom(format!(\"cannot convert {} to i32\", val))),\n\n }\n\n}\n\n\n","file_path":"src/serde_helpers.rs","rank":5,"score":317124.7941050074},{"content":"fn read_lenencoded(buf: &[u8]) -> Result<&str> {\n\n let length = i32_from_slice(&buf[..4])?;\n\n let end = checked_add(usize_try_from_i32(length)?, 4)?;\n\n\n\n if end < MIN_BSON_STRING_SIZE as usize {\n\n return Err(Error::new_without_key(ErrorKind::MalformedValue {\n\n message: format!(\n\n \"BSON length encoded string needs to be at least {} bytes, instead got {}\",\n\n MIN_BSON_STRING_SIZE, end\n\n ),\n\n }));\n\n }\n\n\n\n if buf.len() < end {\n\n return Err(Error::new_without_key(ErrorKind::MalformedValue {\n\n message: format!(\n\n \"expected buffer to contain at least {} bytes, but it only has {}\",\n\n end,\n\n buf.len()\n\n ),\n","file_path":"src/raw/mod.rs","rank":7,"score":299642.04692874756},{"content":"fn read_nullterminated(buf: &[u8]) -> Result<&str> {\n\n let mut splits = buf.splitn(2, |x| *x == 0);\n\n let value = splits.next().ok_or_else(|| {\n\n Error::new_without_key(ErrorKind::MalformedValue {\n\n message: \"no value\".into(),\n\n })\n\n })?;\n\n if splits.next().is_some() {\n\n Ok(try_to_str(value)?)\n\n } else {\n\n Err(Error::new_without_key(ErrorKind::MalformedValue {\n\n message: \"expected null terminator\".into(),\n\n }))\n\n }\n\n}\n\n\n","file_path":"src/raw/mod.rs","rank":8,"score":299642.04692874756},{"content":"/// Attempts to serialize a u64 as an i64. Errors if an exact conversion is not possible.\n\npub fn serialize_u64_as_i64<S: Serializer>(val: &u64, serializer: S) -> Result<S::Ok, S::Error> {\n\n match i64::try_from(*val) {\n\n Ok(val) => serializer.serialize_i64(val),\n\n Err(_) => Err(ser::Error::custom(format!(\"cannot convert {} to i64\", val))),\n\n }\n\n}\n\n\n","file_path":"src/serde_helpers.rs","rank":9,"score":292733.50286923087},{"content":"fn serialize_array<W: Write + ?Sized>(writer: &mut W, arr: &[Bson]) -> Result<()> {\n\n let mut buf = Vec::new();\n\n for (key, val) in arr.iter().enumerate() {\n\n serialize_bson(&mut buf, &key.to_string(), val)?;\n\n }\n\n\n\n write_i32(\n\n writer,\n\n (buf.len() + mem::size_of::<i32>() + mem::size_of::<u8>()) as i32,\n\n )?;\n\n writer.write_all(&buf)?;\n\n writer.write_all(b\"\\0\")?;\n\n Ok(())\n\n}\n\n\n\npub(crate) fn serialize_bson<W: Write + ?Sized>(\n\n writer: &mut W,\n\n key: &str,\n\n val: &Bson,\n\n) -> Result<()> {\n","file_path":"src/ser/mod.rs","rank":11,"score":287960.2111828432},{"content":"/// Given a u8 slice, return an i32 calculated from the first four bytes in\n\n/// little endian order.\n\nfn i32_from_slice(val: &[u8]) -> Result<i32> {\n\n let arr = val\n\n .get(0..4)\n\n .and_then(|s| s.try_into().ok())\n\n .ok_or_else(|| {\n\n Error::new_without_key(ErrorKind::MalformedValue {\n\n message: format!(\"expected 4 bytes to read i32, instead got {}\", val.len()),\n\n })\n\n })?;\n\n Ok(i32::from_le_bytes(arr))\n\n}\n\n\n","file_path":"src/raw/mod.rs","rank":12,"score":279075.11421344883},{"content":"fn usize_try_from_i32(i: i32) -> Result<usize> {\n\n usize::try_from(i).map_err(|e| {\n\n Error::new_without_key(ErrorKind::MalformedValue {\n\n message: e.to_string(),\n\n })\n\n })\n\n}\n\n\n","file_path":"src/raw/mod.rs","rank":13,"score":268757.71319332195},{"content":"/// Attempts to serialize a u32 as an i32. Errors if an exact conversion is not possible.\n\npub fn serialize_u32_as_i32<S: Serializer>(val: &u32, serializer: S) -> Result<S::Ok, S::Error> {\n\n match i32::try_from(*val) {\n\n Ok(val) => serializer.serialize_i32(val),\n\n Err(_) => Err(ser::Error::custom(format!(\"cannot convert {} to i32\", val))),\n\n }\n\n}\n\n\n","file_path":"src/serde_helpers.rs","rank":14,"score":267813.79246200505},{"content":"/// Encode a `T` Serializable into a BSON `Value`.\n\npub fn to_bson<T: ?Sized>(value: &T) -> Result<Bson>\n\nwhere\n\n T: Serialize,\n\n{\n\n let ser = Serializer::new();\n\n value.serialize(ser)\n\n}\n\n\n","file_path":"src/ser/mod.rs","rank":15,"score":252190.06062011834},{"content":"/// Encode a `T` Serializable into a BSON `Document`.\n\npub fn to_document<T: ?Sized>(value: &T) -> Result<Document>\n\nwhere\n\n T: Serialize,\n\n{\n\n match to_bson(value)? {\n\n Bson::Document(doc) => Ok(doc),\n\n bson => Err(Error::SerializationError {\n\n message: format!(\n\n \"Could not be serialized to Document, got {:?} instead\",\n\n bson.element_type()\n\n ),\n\n }),\n\n }\n\n}\n\n\n\n/// Serialize the given `T` as a BSON byte vector.\n","file_path":"src/ser/mod.rs","rank":16,"score":252119.62373865576},{"content":"fn write_string<W: Write + ?Sized>(writer: &mut W, s: &str) -> Result<()> {\n\n writer.write_all(&(s.len() as i32 + 1).to_le_bytes())?;\n\n writer.write_all(s.as_bytes())?;\n\n writer.write_all(b\"\\0\")?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/ser/mod.rs","rank":17,"score":251257.55377019825},{"content":"/// Serializes a u32 as an i64.\n\npub fn serialize_u32_as_i64<S: Serializer>(val: &u32, serializer: S) -> Result<S::Ok, S::Error> {\n\n serializer.serialize_i64(*val as i64)\n\n}\n\n\n","file_path":"src/serde_helpers.rs","rank":19,"score":243418.1144903599},{"content":"fn to_bytes(doc: &crate::Document) -> Vec<u8> {\n\n let mut docbytes = Vec::new();\n\n doc.to_writer(&mut docbytes).unwrap();\n\n docbytes\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":20,"score":235160.5928211086},{"content":"fn try_to_str(data: &[u8]) -> Result<&str> {\n\n std::str::from_utf8(data).map_err(|e| Error::new_without_key(ErrorKind::Utf8EncodingError(e)))\n\n}\n\n\n","file_path":"src/raw/mod.rs","rank":22,"score":225052.5051557566},{"content":"fn write_cstring<W: Write + ?Sized>(writer: &mut W, s: &str) -> Result<()> {\n\n if s.contains('\\0') {\n\n return Err(Error::InvalidCString(s.into()));\n\n }\n\n writer.write_all(s.as_bytes())?;\n\n writer.write_all(b\"\\0\")?;\n\n Ok(())\n\n}\n\n\n\n#[inline]\n\npub(crate) fn write_i32<W: Write + ?Sized>(writer: &mut W, val: i32) -> Result<()> {\n\n writer\n\n .write_all(&val.to_le_bytes())\n\n .map(|_| ())\n\n .map_err(From::from)\n\n}\n\n\n","file_path":"src/ser/mod.rs","rank":23,"score":223156.53833628318},{"content":"#[inline]\n\nfn write_i64<W: Write + ?Sized>(writer: &mut W, val: i64) -> Result<()> {\n\n writer\n\n .write_all(&val.to_le_bytes())\n\n .map(|_| ())\n\n .map_err(From::from)\n\n}\n\n\n","file_path":"src/ser/mod.rs","rank":24,"score":218146.89534711005},{"content":"#[inline]\n\nfn write_f64<W: Write + ?Sized>(writer: &mut W, val: f64) -> Result<()> {\n\n writer\n\n .write_all(&val.to_le_bytes())\n\n .map(|_| ())\n\n .map_err(From::from)\n\n}\n\n\n","file_path":"src/ser/mod.rs","rank":25,"score":218146.89534711005},{"content":"/// Given a u8 slice, return an i32 calculated from the first four bytes in\n\n/// little endian order.\n\nfn f64_from_slice(val: &[u8]) -> Result<f64> {\n\n let arr = val\n\n .get(0..8)\n\n .and_then(|s| s.try_into().ok())\n\n .ok_or_else(|| {\n\n Error::new_without_key(ErrorKind::MalformedValue {\n\n message: format!(\"expected 8 bytes to read double, instead got {}\", val.len()),\n\n })\n\n })?;\n\n Ok(f64::from_le_bytes(arr))\n\n}\n\n\n","file_path":"src/raw/mod.rs","rank":26,"score":213523.62128841132},{"content":"/// Given an u8 slice, return an i64 calculated from the first 8 bytes in\n\n/// little endian order.\n\nfn i64_from_slice(val: &[u8]) -> Result<i64> {\n\n let arr = val\n\n .get(0..8)\n\n .and_then(|s| s.try_into().ok())\n\n .ok_or_else(|| {\n\n Error::new_without_key(ErrorKind::MalformedValue {\n\n message: format!(\"expected 8 bytes to read i64, instead got {}\", val.len()),\n\n })\n\n })?;\n\n Ok(i64::from_le_bytes(arr))\n\n}\n\n\n","file_path":"src/raw/mod.rs","rank":27,"score":213519.36755820632},{"content":"fn convert_unsigned_to_signed<E>(value: u64) -> Result<Bson, E>\n\nwhere\n\n E: Error,\n\n{\n\n if let Ok(int32) = i32::try_from(value) {\n\n Ok(Bson::Int32(int32))\n\n } else if let Ok(int64) = i64::try_from(value) {\n\n Ok(Bson::Int64(int64))\n\n } else {\n\n Err(Error::custom(format!(\n\n \"cannot represent {} as a signed number\",\n\n value\n\n )))\n\n }\n\n}\n\n\n\n/// Serde Deserializer\n\npub struct Deserializer {\n\n value: Option<Bson>,\n\n}\n","file_path":"src/de/serde.rs","rank":28,"score":210361.1919644024},{"content":"#[inline]\n\nfn write_binary<W: Write>(mut writer: W, bytes: &[u8], subtype: BinarySubtype) -> Result<()> {\n\n let len = if let BinarySubtype::BinaryOld = subtype {\n\n bytes.len() + 4\n\n } else {\n\n bytes.len()\n\n };\n\n\n\n if len > MAX_BSON_SIZE as usize {\n\n return Err(Error::custom(format!(\n\n \"binary length {} exceeded maximum size\",\n\n bytes.len()\n\n )));\n\n }\n\n\n\n write_i32(&mut writer, len as i32)?;\n\n writer.write_all(&[subtype.into()])?;\n\n\n\n if let BinarySubtype::BinaryOld = subtype {\n\n write_i32(&mut writer, len as i32 - 4)?;\n\n };\n\n\n\n writer.write_all(bytes).map_err(From::from)\n\n}\n\n\n","file_path":"src/ser/mod.rs","rank":30,"score":202746.50092619093},{"content":"#[test]\n\nfn regex() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"regex\": Bson::RegularExpression(Regex { pattern: String::from(r\"end\\s*$\"), options: String::from(\"i\")}),\n\n }).unwrap();\n\n let regex = rawdoc\n\n .get(\"regex\")\n\n .expect(\"error finding key regex\")\n\n .expect(\"no key regex\")\n\n .as_regex()\n\n .expect(\"was not regex\");\n\n assert_eq!(regex.pattern, r\"end\\s*$\");\n\n assert_eq!(regex.options, \"i\");\n\n}\n","file_path":"src/raw/test/mod.rs","rank":31,"score":197371.05057857506},{"content":"#[test]\n\nfn boolean() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"boolean\": true,\n\n })\n\n .unwrap();\n\n\n\n let boolean = rawdoc\n\n .get(\"boolean\")\n\n .expect(\"error finding key boolean\")\n\n .expect(\"no key boolean\")\n\n .as_bool()\n\n .expect(\"result was not boolean\");\n\n\n\n assert!(boolean);\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":32,"score":197349.30041926814},{"content":"#[test]\n\nfn timestamp() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"timestamp\": Bson::Timestamp(Timestamp { time: 3542578, increment: 7 }),\n\n })\n\n .unwrap();\n\n let ts = rawdoc\n\n .get(\"timestamp\")\n\n .expect(\"error finding key timestamp\")\n\n .expect(\"no key timestamp\")\n\n .as_timestamp()\n\n .expect(\"was not a timestamp\");\n\n\n\n assert_eq!(ts.increment, 7);\n\n assert_eq!(ts.time, 3542578);\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":33,"score":197333.62056577043},{"content":"#[test]\n\nfn string() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\"string\": \"hello\"}).unwrap();\n\n\n\n assert_eq!(\n\n rawdoc\n\n .get(\"string\")\n\n .expect(\"error finding key string\")\n\n .expect(\"no key string\")\n\n .as_str()\n\n .expect(\"result was not a string\"),\n\n \"hello\",\n\n );\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":34,"score":197260.5207764741},{"content":"#[test]\n\nfn array() {\n\n let rawdoc = RawDocumentBuf::from_document(\n\n &doc! { \"array\": [\"binary\", \"serialized\", \"object\", \"notation\"]},\n\n )\n\n .unwrap();\n\n\n\n let array = rawdoc\n\n .get(\"array\")\n\n .expect(\"error finding key array\")\n\n .expect(\"no key array\")\n\n .as_array()\n\n .expect(\"result was not an array\");\n\n assert_eq!(array.get_str(0), Ok(\"binary\"));\n\n assert_eq!(array.get_str(3), Ok(\"notation\"));\n\n assert_eq!(\n\n array.get_str(4).unwrap_err().kind,\n\n ValueAccessErrorKind::NotPresent\n\n );\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":35,"score":197204.2044454901},{"content":"#[test]\n\nfn document() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\"document\": {}}).unwrap();\n\n\n\n let doc = rawdoc\n\n .get(\"document\")\n\n .expect(\"error finding key document\")\n\n .expect(\"no key document\")\n\n .as_document()\n\n .expect(\"result was not a document\");\n\n assert_eq!(doc.as_bytes(), [5u8, 0, 0, 0, 0].as_ref()); // Empty document\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":36,"score":196502.63379949162},{"content":"#[test]\n\nfn string_from_document() {\n\n let docbytes = to_bytes(&doc! {\n\n \"this\": \"first\",\n\n \"that\": \"second\",\n\n \"something\": \"else\",\n\n });\n\n let rawdoc = RawDocument::new(&docbytes).unwrap();\n\n assert_eq!(\n\n rawdoc.get(\"that\").unwrap().unwrap().as_str().unwrap(),\n\n \"second\",\n\n );\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":37,"score":194527.9890561763},{"content":"fn checked_add(lhs: usize, rhs: usize) -> Result<usize> {\n\n lhs.checked_add(rhs).ok_or_else(|| {\n\n Error::new_without_key(ErrorKind::MalformedValue {\n\n message: \"attempted to add with overflow\".to_string(),\n\n })\n\n })\n\n}\n","file_path":"src/raw/mod.rs","rank":38,"score":194412.71206478684},{"content":"/// Verifies the following:\n\n/// - deserializing a `T` from `expected_doc` produces `expected_value`\n\n/// - deserializing a `T` from the raw BSON version of `expected_doc` produces `expected_value`\n\n/// - deserializing a `Document` from the raw BSON version of `expected_doc` produces `expected_doc`\n\nfn run_deserialize_test<T>(expected_value: &T, expected_doc: &Document, description: &str)\n\nwhere\n\n T: DeserializeOwned + PartialEq + std::fmt::Debug,\n\n{\n\n let mut expected_bytes = Vec::new();\n\n expected_doc\n\n .to_writer(&mut expected_bytes)\n\n .expect(description);\n\n\n\n assert_eq!(\n\n &bson::from_document::<T>(expected_doc.clone()).expect(description),\n\n expected_value,\n\n \"{}\",\n\n description\n\n );\n\n assert_eq!(\n\n &bson::from_reader::<_, T>(expected_bytes.as_slice()).expect(description),\n\n expected_value,\n\n \"{}\",\n\n description\n\n );\n\n assert_eq!(\n\n &bson::from_reader::<_, Document>(expected_bytes.as_slice()).expect(description),\n\n expected_doc,\n\n \"{}\",\n\n description\n\n );\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":40,"score":176139.87736129016},{"content":"#[test]\n\nfn array() {\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n a: Vec<i32>,\n\n }\n\n\n\n let v = Foo {\n\n a: vec![1, 2, 3, 4],\n\n };\n\n let doc = doc! {\n\n \"a\": [1, 2, 3, 4],\n\n };\n\n run_test(&v, &doc, \"array\");\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":41,"score":165912.94781494976},{"content":"#[test]\n\nfn binary() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"binary\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1u8, 2, 3] }\n\n })\n\n .unwrap();\n\n let binary: bson::RawBinary<'_> = rawdoc\n\n .get(\"binary\")\n\n .expect(\"error finding key binary\")\n\n .expect(\"no key binary\")\n\n .as_binary()\n\n .expect(\"result was not a binary object\");\n\n assert_eq!(binary.subtype, BinarySubtype::Generic);\n\n assert_eq!(binary.bytes, &[1, 2, 3]);\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":42,"score":165003.58901780075},{"content":"#[inline]\n\npub fn to_vec<T>(value: &T) -> Result<Vec<u8>>\n\nwhere\n\n T: Serialize,\n\n{\n\n let mut serializer = raw::Serializer::new();\n\n value.serialize(&mut serializer)?;\n\n Ok(serializer.into_vec())\n\n}\n","file_path":"src/ser/mod.rs","rank":43,"score":163705.8986459294},{"content":"#[test]\n\nfn application_deserialize_error() {\n\n #[derive(PartialEq, Debug)]\n\n struct Range10(usize);\n\n impl<'de> Deserialize<'de> for Range10 {\n\n fn deserialize<D: serde::Deserializer<'de>>(d: D) -> Result<Range10, D::Error> {\n\n let x: usize = Deserialize::deserialize(d)?;\n\n if x > 10 {\n\n Err(serde::de::Error::invalid_value(\n\n Unexpected::Unsigned(x as u64),\n\n &\"more than 10\",\n\n ))\n\n } else {\n\n Ok(Range10(x))\n\n }\n\n }\n\n }\n\n let d_good = Deserializer::new(Bson::Int64(5));\n\n let d_bad1 = Deserializer::new(Bson::String(\"not an isize\".to_string()));\n\n let d_bad2 = Deserializer::new(Bson::Int64(11));\n\n\n\n assert_eq!(\n\n Range10(5),\n\n Deserialize::deserialize(d_good).expect(\"deserialization should succeed\")\n\n );\n\n\n\n Range10::deserialize(d_bad1).expect_err(\"deserialization from string should fail\");\n\n Range10::deserialize(d_bad2).expect_err(\"deserialization from 11 should fail\");\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":44,"score":160344.03236501318},{"content":"#[test]\n\nfn into_bson_conversion() {\n\n let docbytes = to_bytes(&doc! {\n\n \"f64\": 2.5,\n\n \"string\": \"hello\",\n\n \"document\": {},\n\n \"array\": [\"binary\", \"serialized\", \"object\", \"notation\"],\n\n \"object_id\": ObjectId::from_bytes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]),\n\n \"binary\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1u8, 2, 3] },\n\n \"boolean\": false,\n\n });\n\n let rawbson = RawBson::Document(RawDocument::new(docbytes.as_slice()).unwrap());\n\n let b: Bson = rawbson.try_into().expect(\"invalid bson\");\n\n let doc = b.as_document().expect(\"not a document\");\n\n assert_eq!(*doc.get(\"f64\").expect(\"f64 not found\"), Bson::Double(2.5));\n\n assert_eq!(\n\n *doc.get(\"string\").expect(\"string not found\"),\n\n Bson::String(String::from(\"hello\"))\n\n );\n\n assert_eq!(\n\n *doc.get(\"document\").expect(\"document not found\"),\n","file_path":"src/raw/test/mod.rs","rank":45,"score":158753.18367854963},{"content":"#[test]\n\nfn document_iteration() {\n\n let doc = doc! {\n\n \"f64\": 2.5,\n\n \"string\": \"hello\",\n\n \"document\": {},\n\n \"array\": [\"binary\", \"serialized\", \"object\", \"notation\"],\n\n \"binary\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1u8, 2, 3] },\n\n \"object_id\": ObjectId::from_bytes([1, 2, 3, 4, 5,6,7,8,9,10, 11,12]),\n\n \"boolean\": true,\n\n \"datetime\": DateTime::now(),\n\n \"null\": Bson::Null,\n\n \"regex\": Bson::RegularExpression(Regex { pattern: String::from(r\"end\\s*$\"), options: String::from(\"i\")}),\n\n \"javascript\": Bson::JavaScriptCode(String::from(\"console.log(console);\")),\n\n \"symbol\": Bson::Symbol(String::from(\"artist-formerly-known-as\")),\n\n \"javascript_with_scope\": Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope{ code: String::from(\"console.log(msg);\"), scope: doc!{\"ok\": true}}),\n\n \"int32\": 23i32,\n\n \"timestamp\": Bson::Timestamp(Timestamp { time: 3542578, increment: 0 }),\n\n \"int64\": 46i64,\n\n \"end\": \"END\",\n\n };\n","file_path":"src/raw/test/mod.rs","rank":46,"score":158712.78181275353},{"content":"#[test]\n\nfn nested_document() {\n\n let docbytes = to_bytes(&doc! {\n\n \"outer\": {\n\n \"inner\": \"surprise\",\n\n \"i64\": 6_i64,\n\n },\n\n });\n\n let rawdoc = RawDocument::new(&docbytes).unwrap();\n\n let subdoc = rawdoc\n\n .get(\"outer\")\n\n .expect(\"get doc result\")\n\n .expect(\"get doc option\")\n\n .as_document()\n\n .expect(\"as doc\");\n\n assert_eq!(\n\n subdoc\n\n .get(\"inner\")\n\n .expect(\"get str result\")\n\n .expect(\"get str option\")\n\n .as_str()\n","file_path":"src/raw/test/mod.rs","rank":47,"score":158712.78181275353},{"content":"/// Serializes an [`ObjectId`] as a hex string.\n\npub fn serialize_object_id_as_hex_string<S: Serializer>(\n\n val: &ObjectId,\n\n serializer: S,\n\n) -> Result<S::Ok, S::Error> {\n\n val.to_hex().serialize(serializer)\n\n}\n\n\n\n/// Contains functions to serialize a u32 as an f64 (BSON double) and deserialize a\n\n/// u32 from an f64 (BSON double).\n\n///\n\n/// ```rust\n\n/// # use serde::{Serialize, Deserialize};\n\n/// # use bson::serde_helpers::u32_as_f64;\n\n/// #[derive(Serialize, Deserialize)]\n\n/// struct FileInfo {\n\n/// #[serde(with = \"u32_as_f64\")]\n\n/// pub size_bytes: u32,\n\n/// }\n\n/// ```\n\npub mod u32_as_f64 {\n","file_path":"src/serde_helpers.rs","rank":48,"score":156038.08718922042},{"content":"#[test]\n\nfn test_serialize_deserialize_utf8_string() {\n\n let _guard = LOCK.run_concurrently();\n\n let src = \"test你好吗\".to_owned();\n\n let dst = vec![\n\n 28, 0, 0, 0, 2, 107, 101, 121, 0, 14, 0, 0, 0, 116, 101, 115, 116, 228, 189, 160, 229, 165,\n\n 189, 229, 144, 151, 0, 0,\n\n ];\n\n\n\n let doc = doc! { \"key\": src };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n assert_eq!(buf, dst);\n\n\n\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(deserialized, doc);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":49,"score":154049.04746385562},{"content":"#[test]\n\nfn test_deserialize_invalid_array_length() {\n\n let _guard = LOCK.run_concurrently();\n\n let buffer = b\"\\n\\x00\\x00\\x00\\x04\\x00\\x00\\x00\\x00\\x00\";\n\n Document::from_reader(&mut std::io::Cursor::new(buffer))\n\n .expect_err(\"expected deserialization to fail\");\n\n}\n\n\n\n/// [RUST-713](https://jira.mongodb.org/browse/RUST-713)\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":50,"score":154023.34188052823},{"content":"/// Verifies the following:\n\n/// - round trip `expected_value` through `Document`:\n\n/// - serializing the `expected_value` to a `Document` matches the `expected_doc`\n\n/// - deserializing from the serialized document produces `expected_value`\n\n/// - round trip through raw BSON:\n\n/// - deserializing a `T` from the raw BSON version of `expected_doc` produces `expected_value`\n\n/// - deserializing a `Document` from the raw BSON version of `expected_doc` produces\n\n/// `expected_doc`\n\n/// - `bson::to_writer` and `Document::to_writer` produce the same result given the same input\n\nfn run_test<T>(expected_value: &T, expected_doc: &Document, description: &str)\n\nwhere\n\n T: Serialize + DeserializeOwned + PartialEq + std::fmt::Debug,\n\n{\n\n let mut expected_bytes = Vec::new();\n\n expected_doc\n\n .to_writer(&mut expected_bytes)\n\n .expect(description);\n\n\n\n let expected_bytes_serde = bson::to_vec(&expected_value).expect(description);\n\n assert_eq!(expected_bytes_serde, expected_bytes, \"{}\", description);\n\n\n\n let expected_bytes_from_doc_serde = bson::to_vec(&expected_doc).expect(description);\n\n assert_eq!(\n\n expected_bytes_from_doc_serde, expected_bytes,\n\n \"{}\",\n\n description\n\n );\n\n\n\n let serialized_doc = bson::to_document(&expected_value).expect(description);\n","file_path":"serde-tests/test.rs","rank":51,"score":152937.20079662482},{"content":"#[test]\n\nfn test_deserialize_invalid_utf8_string_issue64() {\n\n let _guard = LOCK.run_concurrently();\n\n let buffer = b\"\\x13\\x00\\x00\\x00\\x02\\x01\\x00\\x00\\x00\\x00\\x00\\x00\\x00foo\\x00\\x13\\x05\\x00\\x00\\x00\";\n\n\n\n assert!(Document::from_reader(&mut Cursor::new(buffer)).is_err());\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":52,"score":150079.46084869784},{"content":"#[test]\n\nfn test_deserialize_invalid_old_binary_length() {\n\n let _guard = LOCK.run_concurrently();\n\n let buffer = b\"\\x0F\\x00\\x00\\x00\\x05\\x00\\x00\\x00\\x00\\x00\\x02\\xFC\\xFF\\xFF\\xFF\";\n\n Document::from_reader(&mut std::io::Cursor::new(buffer))\n\n .expect_err(\"expected deserialization to fail\");\n\n\n\n let buffer = b\".\\x00\\x00\\x00\\x05\\x01\\x00\\x00\\x00\\x00\\x00\\x02\\xfc\\xff\\xff\\xff\\xff\\xff\\xff\\xff\\x00\\x00*\\x00h\\x0e\\x10++\\x00h\\x0e++\\x00\\x00\\t\\x00\\x00\\x00\\x00\\x00*\\x0e\\x10++\";\n\n Document::from_reader(&mut std::io::Cursor::new(buffer))\n\n .expect_err(\"expected deserialization to fail\");\n\n}\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":53,"score":150059.64434786295},{"content":"struct Decimal128Deserializer(Decimal128);\n\n\n\nimpl<'de> serde::de::Deserializer<'de> for Decimal128Deserializer {\n\n type Error = Error;\n\n\n\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value>\n\n where\n\n V: serde::de::Visitor<'de>,\n\n {\n\n visitor.visit_bytes(&self.0.bytes)\n\n }\n\n\n\n serde::forward_to_deserialize_any! {\n\n bool u8 u16 u32 u64 i8 i16 i32 i64 f32 f64 char str string seq\n\n bytes byte_buf map struct option unit newtype_struct\n\n ignored_any unit_struct tuple_struct tuple enum identifier\n\n }\n\n}\n\n\n","file_path":"src/de/raw.rs","rank":54,"score":145432.7539427409},{"content":"#[test]\n\nfn test_encode_decode_utf8_string_invalid() {\n\n let bytes = b\"\\x80\\xae\".to_vec();\n\n let src = unsafe { String::from_utf8_unchecked(bytes) };\n\n\n\n let doc = doc! { \"key\": src };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n let expected = doc! { \"key\": \"��\" };\n\n let decoded = Document::from_reader_utf8_lossy(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(decoded, expected);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":55,"score":138551.01244173554},{"content":"#[test]\n\nfn test_serde_bytes() {\n\n let _guard = LOCK.run_concurrently();\n\n #[derive(Serialize, Deserialize, Debug, Eq, PartialEq)]\n\n pub struct Foo {\n\n #[serde(with = \"serde_bytes\")]\n\n data: Vec<u8>,\n\n }\n\n\n\n let x = Foo {\n\n data: b\"12345abcde\".to_vec(),\n\n };\n\n\n\n let b = to_bson(&x).unwrap();\n\n assert_eq!(\n\n b.as_document().unwrap(),\n\n &doc! {\"data\": Bson::Binary(Binary { subtype: BinarySubtype::Generic, bytes: b\"12345abcde\".to_vec() })}\n\n );\n\n\n\n let f = from_bson::<Foo>(b).unwrap();\n\n assert_eq!(x, f);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":56,"score":135532.93425735508},{"content":"#[test]\n\nfn table_array() {\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n a: Vec<Bar>,\n\n }\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Bar {\n\n a: i32,\n\n }\n\n\n\n let v = Foo {\n\n a: vec![Bar { a: 1 }, Bar { a: 2 }],\n\n };\n\n let doc = doc! {\n\n \"a\": [{ \"a\": 1 }, { \"a\": 2 }]\n\n };\n\n run_test(&v, &doc, \"table_array\");\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":57,"score":129066.78056574118},{"content":"#[test]\n\nfn default_array() {\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n #[serde(default)]\n\n a: Vec<Bar>,\n\n }\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Bar;\n\n\n\n let v = Foo { a: vec![] };\n\n let doc = doc! {};\n\n run_deserialize_test(&v, &doc, \"default_array\");\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":58,"score":129066.78056574118},{"content":"#[test]\n\nfn null_array() {\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n a: Option<Vec<Bar>>,\n\n }\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Bar;\n\n\n\n let v = Foo { a: None };\n\n let doc = doc! {};\n\n run_deserialize_test(&v, &doc, \"null_array\");\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":59,"score":129066.78056574118},{"content":"#[test]\n\nfn empty_array() {\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n a: Option<Vec<Bar>>,\n\n }\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Bar;\n\n\n\n let v = Foo { a: Some(vec![]) };\n\n let doc = doc! {\n\n \"a\": []\n\n };\n\n run_deserialize_test(&v, &doc, \"empty_array\");\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":60,"score":129066.78056574118},{"content":"#[test]\n\nfn missing_errors() {\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n bar: i32,\n\n }\n\n\n\n let doc = doc! {};\n\n\n\n bson::from_document::<Foo>(doc.clone()).unwrap_err();\n\n\n\n let mut bytes = Vec::new();\n\n doc.to_writer(&mut bytes).unwrap();\n\n\n\n bson::from_reader::<_, Foo>(bytes.as_slice()).unwrap_err();\n\n}\n\n\n","file_path":"serde-tests/test.rs","rank":61,"score":129041.58497535517},{"content":"#[test]\n\nfn symbol() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"symbol\": Bson::Symbol(String::from(\"artist-formerly-known-as\")),\n\n })\n\n .unwrap();\n\n\n\n let symbol = rawdoc\n\n .get(\"symbol\")\n\n .expect(\"error finding key symbol\")\n\n .expect(\"no key symbol\")\n\n .as_symbol()\n\n .expect(\"was not symbol\");\n\n assert_eq!(symbol, \"artist-formerly-known-as\");\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":62,"score":127776.5338055752},{"content":"#[test]\n\nfn int64() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"int64\": 46i64,\n\n })\n\n .unwrap();\n\n let int64 = rawdoc\n\n .get(\"int64\")\n\n .expect(\"error finding key int64\")\n\n .expect(\"no key int64\")\n\n .as_i64()\n\n .expect(\"was not int64\");\n\n assert_eq!(int64, 46i64);\n\n}\n","file_path":"src/raw/test/mod.rs","rank":63,"score":127776.5338055752},{"content":"#[test]\n\nfn int32() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"int32\": 23i32,\n\n })\n\n .unwrap();\n\n let int32 = rawdoc\n\n .get(\"int32\")\n\n .expect(\"error finding key int32\")\n\n .expect(\"no key int32\")\n\n .as_i32()\n\n .expect(\"was not int32\");\n\n assert_eq!(int32, 23i32);\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":64,"score":127776.5338055752},{"content":"#[test]\n\nfn javascript() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"javascript\": Bson::JavaScriptCode(String::from(\"console.log(console);\")),\n\n })\n\n .unwrap();\n\n let js = rawdoc\n\n .get(\"javascript\")\n\n .expect(\"error finding key javascript\")\n\n .expect(\"no key javascript\")\n\n .as_javascript()\n\n .expect(\"was not javascript\");\n\n assert_eq!(js, \"console.log(console);\");\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":65,"score":127776.5338055752},{"content":"#[test]\n\nfn f64() {\n\n #![allow(clippy::float_cmp)]\n\n\n\n let rawdoc = RawDocumentBuf::from_document(&doc! { \"f64\": 2.5 }).unwrap();\n\n assert_eq!(\n\n rawdoc\n\n .get(\"f64\")\n\n .expect(\"error finding key f64\")\n\n .expect(\"no key f64\")\n\n .as_f64()\n\n .expect(\"result was not a f64\"),\n\n 2.5,\n\n );\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":66,"score":127776.5338055752},{"content":"#[test]\n\nfn null() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"null\": null,\n\n })\n\n .unwrap();\n\n let () = rawdoc\n\n .get(\"null\")\n\n .expect(\"error finding key null\")\n\n .expect(\"no key null\")\n\n .as_null()\n\n .expect(\"was not null\");\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":67,"score":127776.5338055752},{"content":"#[test]\n\nfn iterate() {\n\n let docbytes = to_bytes(&doc! {\n\n \"apples\": \"oranges\",\n\n \"peanut butter\": \"chocolate\",\n\n \"easy as\": {\"do\": 1, \"re\": 2, \"mi\": 3},\n\n });\n\n let rawdoc = RawDocument::new(&docbytes).expect(\"malformed bson document\");\n\n let mut dociter = rawdoc.into_iter();\n\n let next = dociter.next().expect(\"no result\").expect(\"invalid bson\");\n\n assert_eq!(next.0, \"apples\");\n\n assert_eq!(next.1.as_str().expect(\"result was not a str\"), \"oranges\");\n\n let next = dociter.next().expect(\"no result\").expect(\"invalid bson\");\n\n assert_eq!(next.0, \"peanut butter\");\n\n assert_eq!(next.1.as_str().expect(\"result was not a str\"), \"chocolate\");\n\n let next = dociter.next().expect(\"no result\").expect(\"invalid bson\");\n\n assert_eq!(next.0, \"easy as\");\n\n let _doc = next.1.as_document().expect(\"result was a not a document\");\n\n let next = dociter.next();\n\n assert!(next.is_none());\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":68,"score":127776.5338055752},{"content":"#[test]\n\nfn datetime() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"boolean\": true,\n\n \"datetime\": DateTime::from_chrono(Utc.ymd(2000,10,31).and_hms(12, 30, 45)),\n\n })\n\n .unwrap();\n\n let datetime = rawdoc\n\n .get(\"datetime\")\n\n .expect(\"error finding key datetime\")\n\n .expect(\"no key datetime\")\n\n .as_datetime()\n\n .expect(\"result was not datetime\");\n\n assert_eq!(datetime.to_rfc3339(), \"2000-10-31T12:30:45Z\");\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":69,"score":127776.5338055752},{"content":"#[test]\n\nfn test_serialize_deserialize_boolean() {\n\n let _guard = LOCK.run_concurrently();\n\n let src = true;\n\n let dst = vec![11, 0, 0, 0, 8, 107, 101, 121, 0, 1, 0];\n\n\n\n let doc = doc! { \"key\": src };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n assert_eq!(buf, dst);\n\n\n\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(deserialized, doc);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":70,"score":126246.69905635175},{"content":"#[test]\n\nfn test_serialize_deserialize_i32() {\n\n let _guard = LOCK.run_concurrently();\n\n let src = 100i32;\n\n let dst = vec![14, 0, 0, 0, 16, 107, 101, 121, 0, 100, 0, 0, 0, 0];\n\n\n\n let doc = doc! { \"key\": src };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n assert_eq!(buf, dst);\n\n\n\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(deserialized, doc);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":71,"score":126235.84724711187},{"content":"#[test]\n\nfn test_serialize_deserialize_decimal128() {\n\n let _guard = LOCK.run_concurrently();\n\n let val = Bson::Decimal128(Decimal128 {\n\n bytes: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 34],\n\n });\n\n let dst = vec![\n\n 26, 0, 0, 0, 19, 107, 101, 121, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 34, 0,\n\n ];\n\n\n\n let doc = doc! { \"key\": val };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n assert_eq!(buf, dst);\n\n\n\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(deserialized, doc);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":72,"score":126235.84724711187},{"content":"#[test]\n\nfn test_serialize_deserialize_timestamp() {\n\n let _guard = LOCK.run_concurrently();\n\n let src = Bson::Timestamp(Timestamp {\n\n time: 0,\n\n increment: 100,\n\n });\n\n let dst = vec![\n\n 18, 0, 0, 0, 17, 107, 101, 121, 0, 100, 0, 0, 0, 0, 0, 0, 0, 0,\n\n ];\n\n\n\n let doc = doc! { \"key\": src };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n assert_eq!(buf, dst);\n\n\n\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(deserialized, doc);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":73,"score":126209.06917930511},{"content":"#[test]\n\nfn test_serialize_deserialize_array() {\n\n let _guard = LOCK.run_concurrently();\n\n let src = vec![Bson::Double(1.01), Bson::String(\"xyz\".to_owned())];\n\n let dst = vec![\n\n 37, 0, 0, 0, 4, 107, 101, 121, 0, 27, 0, 0, 0, 1, 48, 0, 41, 92, 143, 194, 245, 40, 240,\n\n 63, 2, 49, 0, 4, 0, 0, 0, 120, 121, 122, 0, 0, 0,\n\n ];\n\n\n\n let doc = doc! { \"key\": src };\n\n\n\n let mut buf = Vec::new();\n\n doc.to_writer(&mut buf).unwrap();\n\n\n\n assert_eq!(buf, dst);\n\n\n\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n assert_eq!(deserialized, doc);\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":74,"score":126144.59928861225},{"content":"#[test]\n\nfn test_serialize_deserialize_document() {\n\n let _guard = LOCK.run_concurrently();\n\n\n\n #[derive(Debug, Deserialize, Serialize, PartialEq)]\n\n struct Point {\n\n x: i32,\n\n y: i32,\n\n }\n\n let src = Point { x: 1, y: 2 };\n\n\n\n let doc = to_document(&src).unwrap();\n\n assert_eq!(doc, doc! { \"x\": 1, \"y\": 2 });\n\n\n\n let point: Point = from_document(doc).unwrap();\n\n assert_eq!(src, point);\n\n\n\n #[derive(Debug, Deserialize, Serialize, PartialEq)]\n\n struct Line {\n\n p1: Point,\n\n p2: Point,\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":75,"score":125607.7102313983},{"content":"#[test]\n\nfn timestamp_ordering() {\n\n let _guard = LOCK.run_concurrently();\n\n let ts1 = Timestamp {\n\n time: 0,\n\n increment: 1,\n\n };\n\n let ts2 = Timestamp {\n\n time: 0,\n\n increment: 2,\n\n };\n\n let ts3 = Timestamp {\n\n time: 1,\n\n increment: 0,\n\n };\n\n assert!(ts1 < ts2);\n\n assert!(ts1 < ts3);\n\n assert!(ts2 < ts3);\n\n}\n\n\n","file_path":"src/tests/modules/bson.rs","rank":76,"score":125573.15322231976},{"content":"#[test]\n\nfn arr() {\n\n let _guard = LOCK.run_concurrently();\n\n let obj = Bson::Array(vec![\n\n Bson::Int32(0),\n\n Bson::Int32(1),\n\n Bson::Int32(2),\n\n Bson::Int32(3),\n\n ]);\n\n let arr: Vec<i32> = from_bson(obj.clone()).unwrap();\n\n assert_eq!(arr, vec![0i32, 1i32, 2i32, 3i32]);\n\n\n\n let deser: Bson = to_bson(&arr).unwrap();\n\n assert_eq!(deser, obj);\n\n}\n\n\n","file_path":"src/tests/modules/ser.rs","rank":77,"score":125525.67201150142},{"content":"#[test]\n\nfn boolean() {\n\n let _guard = LOCK.run_concurrently();\n\n let obj = Bson::Boolean(true);\n\n let b: bool = from_bson(obj.clone()).unwrap();\n\n assert!(b);\n\n\n\n let deser: Bson = to_bson(&b).unwrap();\n\n assert_eq!(deser, obj);\n\n}\n\n\n","file_path":"src/tests/modules/ser.rs","rank":78,"score":125519.1797743224},{"content":"#[test]\n\nfn string() {\n\n let _guard = LOCK.run_concurrently();\n\n let obj = Bson::String(\"avocado\".to_owned());\n\n let s: String = from_bson(obj.clone()).unwrap();\n\n assert_eq!(s, \"avocado\");\n\n\n\n let deser: Bson = to_bson(&s).unwrap();\n\n assert_eq!(obj, deser);\n\n}\n\n\n","file_path":"src/tests/modules/ser.rs","rank":79,"score":125430.4001315284},{"content":"#[test]\n\nfn document_default() {\n\n let _guard = LOCK.run_concurrently();\n\n let doc1 = Document::default();\n\n assert_eq!(doc1.keys().count(), 0);\n\n assert_eq!(doc1, Document::new());\n\n}\n\n\n","file_path":"src/tests/modules/bson.rs","rank":80,"score":124901.04444259244},{"content":"#[test]\n\nfn test_de_regex() {\n\n let _guard = LOCK.run_concurrently();\n\n use bson::Regex;\n\n\n\n #[derive(Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n regex: Regex,\n\n }\n\n\n\n let regex = Regex {\n\n pattern: \"12\".into(),\n\n options: \"01\".into(),\n\n };\n\n\n\n let foo: Foo = from_bson(Bson::Document(doc! {\n\n \"regex\": Bson::RegularExpression(regex.clone()),\n\n }))\n\n .unwrap();\n\n\n\n assert_eq!(foo.regex, regex);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":81,"score":124899.40089391646},{"content":"#[test]\n\nfn test_ser_regex() {\n\n let _guard = LOCK.run_concurrently();\n\n use bson::Regex;\n\n\n\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\n\n struct Foo {\n\n regex: Regex,\n\n }\n\n\n\n let regex = Regex {\n\n pattern: \"12\".into(),\n\n options: \"01\".into(),\n\n };\n\n\n\n let foo = Foo {\n\n regex: regex.clone(),\n\n };\n\n\n\n let x = to_bson(&foo).unwrap();\n\n assert_eq!(\n\n x.as_document().unwrap(),\n\n &doc! { \"regex\": Bson::RegularExpression(regex) }\n\n );\n\n\n\n let xfoo: Foo = from_bson(x).unwrap();\n\n assert_eq!(xfoo, foo);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":82,"score":124899.40089391646},{"content":"#[test]\n\nfn test_byte_vec() {\n\n let _guard = LOCK.run_concurrently();\n\n #[derive(Serialize, Debug, Eq, PartialEq)]\n\n pub struct AuthChallenge<'a> {\n\n #[serde(with = \"serde_bytes\")]\n\n pub challenge: &'a [u8],\n\n }\n\n\n\n let x = AuthChallenge {\n\n challenge: b\"18762b98b7c34c25bf9dc3154e4a5ca3\",\n\n };\n\n\n\n let b = to_bson(&x).unwrap();\n\n assert_eq!(\n\n b,\n\n Bson::Document(\n\n doc! { \"challenge\": (Bson::Binary(Binary { subtype: BinarySubtype::Generic, bytes: x.challenge.to_vec() }))}\n\n )\n\n );\n\n\n\n // let mut buf = Vec::new();\n\n // b.as_document().unwrap().to_writer(&mut buf).unwrap();\n\n\n\n // let xb = Document::from_reader(&mut Cursor::new(buf)).unwrap();\n\n // assert_eq!(b.as_document().unwrap(), &xb);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":83,"score":124875.39424294567},{"content":"#[test]\n\nfn test_timestamp_helpers() {\n\n let _guard = LOCK.run_concurrently();\n\n\n\n #[derive(Deserialize, Serialize)]\n\n struct A {\n\n #[serde(with = \"u32_as_timestamp\")]\n\n pub time: u32,\n\n }\n\n\n\n let time = 12345;\n\n let a = A { time };\n\n let doc = to_document(&a).unwrap();\n\n let timestamp = doc.get_timestamp(\"time\").unwrap();\n\n assert_eq!(timestamp.time, time);\n\n assert_eq!(timestamp.increment, 0);\n\n let a: A = from_document(doc).unwrap();\n\n assert_eq!(a.time, time);\n\n\n\n #[derive(Deserialize, Serialize)]\n\n struct B {\n","file_path":"src/tests/serde.rs","rank":84,"score":124863.43876044312},{"content":"#[test]\n\nfn test_ser_timestamp() {\n\n let _guard = LOCK.run_concurrently();\n\n use bson::Timestamp;\n\n\n\n #[derive(Serialize, Deserialize, Eq, PartialEq, Debug)]\n\n struct Foo {\n\n ts: Timestamp,\n\n }\n\n\n\n let foo = Foo {\n\n ts: Timestamp {\n\n time: 12,\n\n increment: 10,\n\n },\n\n };\n\n\n\n let x = to_bson(&foo).unwrap();\n\n assert_eq!(\n\n x.as_document().unwrap(),\n\n &doc! { \"ts\": Bson::Timestamp(Timestamp { time: 0x0000_000C, increment: 0x0000_000A }) }\n\n );\n\n\n\n let xfoo: Foo = from_bson(x).unwrap();\n\n assert_eq!(xfoo, foo);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":85,"score":124863.43876044312},{"content":"#[test]\n\nfn test_de_timestamp() {\n\n let _guard = LOCK.run_concurrently();\n\n use bson::Timestamp;\n\n\n\n #[derive(Deserialize, Eq, PartialEq, Debug)]\n\n struct Foo {\n\n ts: Timestamp,\n\n }\n\n\n\n let foo: Foo = from_bson(Bson::Document(doc! {\n\n \"ts\": Bson::Timestamp(Timestamp { time: 0x0000_000C, increment: 0x0000_000A }),\n\n }))\n\n .unwrap();\n\n\n\n assert_eq!(\n\n foo.ts,\n\n Timestamp {\n\n time: 12,\n\n increment: 10\n\n }\n\n );\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":86,"score":124863.43876044312},{"content":"#[test]\n\nfn oid_as_hex_string() {\n\n let _guard = LOCK.run_concurrently();\n\n\n\n #[derive(Serialize)]\n\n struct Foo {\n\n #[serde(serialize_with = \"serialize_object_id_as_hex_string\")]\n\n oid: ObjectId,\n\n }\n\n\n\n let oid = ObjectId::new();\n\n let foo = Foo { oid };\n\n let doc = to_document(&foo).unwrap();\n\n assert_eq!(doc.get_str(\"oid\").unwrap(), oid.to_hex());\n\n}\n","file_path":"src/tests/serde.rs","rank":87,"score":124845.49178601397},{"content":"#[test]\n\nfn rawdoc_to_doc() {\n\n let docbytes = to_bytes(&doc! {\n\n \"f64\": 2.5,\n\n \"string\": \"hello\",\n\n \"document\": {},\n\n \"array\": [\"binary\", \"serialized\", \"object\", \"notation\"],\n\n \"binary\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1, 2, 3] },\n\n \"object_id\": ObjectId::from_bytes([1, 2, 3, 4, 5,6,7,8,9,10, 11,12]),\n\n \"boolean\": true,\n\n \"datetime\": DateTime::now(),\n\n \"null\": Bson::Null,\n\n \"regex\": Bson::RegularExpression(Regex { pattern: String::from(r\"end\\s*$\"), options: String::from(\"i\")}),\n\n \"javascript\": Bson::JavaScriptCode(String::from(\"console.log(console);\")),\n\n \"symbol\": Bson::Symbol(String::from(\"artist-formerly-known-as\")),\n\n \"javascript_with_scope\": Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope{ code: String::from(\"console.log(msg);\"), scope: doc!{\"ok\": true}}),\n\n \"int32\": 23i32,\n\n \"timestamp\": Bson::Timestamp(Timestamp { time: 3542578, increment: 0 }),\n\n \"int64\": 46i64,\n\n \"end\": \"END\",\n\n });\n","file_path":"src/raw/test/mod.rs","rank":88,"score":123551.73637462893},{"content":"#[test]\n\nfn object_id() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"object_id\": ObjectId::from_bytes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]),\n\n })\n\n .unwrap();\n\n let oid = rawdoc\n\n .get(\"object_id\")\n\n .expect(\"error finding key object_id\")\n\n .expect(\"no key object_id\")\n\n .as_object_id()\n\n .expect(\"result was not an object id\");\n\n assert_eq!(oid.to_hex(), \"0102030405060708090a0b0c\");\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":89,"score":123551.73637462893},{"content":"#[test]\n\nfn javascript_with_scope() {\n\n let rawdoc = RawDocumentBuf::from_document(&doc! {\n\n \"javascript_with_scope\": Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope {\n\n code: String::from(\"console.log(msg);\"),\n\n scope: doc! { \"ok\": true }\n\n }),\n\n })\n\n .unwrap();\n\n let js_with_scope = rawdoc\n\n .get(\"javascript_with_scope\")\n\n .expect(\"error finding key javascript_with_scope\")\n\n .expect(\"no key javascript_with_scope\")\n\n .as_javascript_with_scope()\n\n .expect(\"was not javascript with scope\");\n\n assert_eq!(js_with_scope.code(), \"console.log(msg);\");\n\n let (scope_key, scope_value_bson) = js_with_scope\n\n .scope()\n\n .into_iter()\n\n .next()\n\n .expect(\"no next value in scope\")\n\n .expect(\"invalid element\");\n\n assert_eq!(scope_key, \"ok\");\n\n let scope_value = scope_value_bson.as_bool().expect(\"not a boolean\");\n\n assert!(scope_value);\n\n}\n\n\n","file_path":"src/raw/test/mod.rs","rank":90,"score":123551.73637462893},{"content":"#[test]\n\nfn byte_string_oid() {\n\n let _guard = LOCK.run_concurrently();\n\n let s = \"541b1a00e8a23afa832b218e\";\n\n let oid_res = ObjectId::parse_str(s);\n\n assert!(oid_res.is_ok());\n\n let oid = oid_res.unwrap();\n\n let bytes: [u8; 12] = [\n\n 0x54u8, 0x1Bu8, 0x1Au8, 0x00u8, 0xE8u8, 0xA2u8, 0x3Au8, 0xFAu8, 0x83u8, 0x2Bu8, 0x21u8,\n\n 0x8Eu8,\n\n ];\n\n\n\n assert_eq!(bytes, oid.bytes());\n\n assert_eq!(s, oid.to_string());\n\n}\n\n\n","file_path":"src/tests/modules/oid.rs","rank":91,"score":122193.03718921932},{"content":"#[test]\n\nfn test_de_oid_string() {\n\n let _guard = LOCK.run_concurrently();\n\n\n\n #[derive(Debug, Deserialize)]\n\n struct Foo {\n\n pub oid: ObjectId,\n\n }\n\n\n\n let foo: Foo = serde_json::from_str(\"{ \\\"oid\\\": \\\"507f1f77bcf86cd799439011\\\" }\").unwrap();\n\n let oid = ObjectId::parse_str(\"507f1f77bcf86cd799439011\").unwrap();\n\n assert_eq!(foo.oid, oid);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":92,"score":120890.73235071982},{"content":"#[test]\n\nfn test_binary_generic_roundtrip() {\n\n let _guard = LOCK.run_concurrently();\n\n #[derive(Serialize, Deserialize, Debug, PartialEq)]\n\n pub struct Foo {\n\n data: Bson,\n\n }\n\n\n\n let x = Foo {\n\n data: Bson::Binary(Binary {\n\n subtype: BinarySubtype::Generic,\n\n bytes: b\"12345abcde\".to_vec(),\n\n }),\n\n };\n\n\n\n let b = to_bson(&x).unwrap();\n\n assert_eq!(\n\n b.as_document().unwrap(),\n\n &doc! {\"data\": Bson::Binary(Binary { subtype: BinarySubtype::Generic, bytes: b\"12345abcde\".to_vec() })}\n\n );\n\n\n\n let f = from_bson::<Foo>(b).unwrap();\n\n assert_eq!(x, f);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":93,"score":120844.47438501054},{"content":"#[test]\n\nfn cstring_null_bytes_error() {\n\n let _guard = LOCK.run_concurrently();\n\n\n\n let doc = doc! { \"\\0\": \"a\" };\n\n verify_doc(doc);\n\n\n\n let doc = doc! { \"a\": { \"\\0\": \"b\" } };\n\n verify_doc(doc);\n\n\n\n let regex = doc! { \"regex\": Regex { pattern: \"\\0\".into(), options: \"a\".into() } };\n\n verify_doc(regex);\n\n\n\n let regex = doc! { \"regex\": Regex { pattern: \"a\".into(), options: \"\\0\".into() } };\n\n verify_doc(regex);\n\n\n\n fn verify_doc(doc: Document) {\n\n let mut vec = Vec::new();\n\n assert!(matches!(\n\n doc.to_writer(&mut vec).unwrap_err(),\n\n ser::Error::InvalidCString(_)\n\n ));\n\n assert!(matches!(\n\n to_vec(&doc).unwrap_err(),\n\n ser::Error::InvalidCString(_)\n\n ));\n\n }\n\n}\n","file_path":"src/tests/modules/ser.rs","rank":94,"score":118405.92598838717},{"content":"#[test]\n\nfn test_illegal_size() {\n\n let _guard = LOCK.run_concurrently();\n\n let buffer = [\n\n 0x06, 0xcc, 0xf9, 0x0a, 0x05, 0x00, 0x00, 0x03, 0x00, 0xff, 0xff,\n\n ];\n\n assert!(Document::from_reader(&mut Cursor::new(&buffer[..])).is_err());\n\n}\n\n\n","file_path":"src/tests/modules/serializer_deserializer.rs","rank":95,"score":118235.35188894108},{"content":"#[test]\n\nfn test_display_regex_type() {\n\n let x = Regex {\n\n pattern: String::from(\"pattern\"),\n\n options: String::from(\"options\"),\n\n };\n\n let output = \"/pattern/options\";\n\n assert_eq!(format!(\"{}\", x), output);\n\n assert_eq!(format!(\"{}\", Bson::from(x)), output);\n\n}\n\n\n","file_path":"src/tests/modules/bson.rs","rank":96,"score":117931.68432646662},{"content":"#[test]\n\nfn test_display_timestamp_type() {\n\n let x = Timestamp {\n\n time: 100,\n\n increment: 200,\n\n };\n\n let output = \"Timestamp(100, 200)\";\n\n assert_eq!(format!(\"{}\", x), output);\n\n assert_eq!(format!(\"{}\", Bson::from(x)), output);\n\n}\n\n\n","file_path":"src/tests/modules/bson.rs","rank":97,"score":117898.33767985336},{"content":"#[test]\n\nfn test_display_binary_type() {\n\n let encoded_bytes = \"aGVsbG8gd29ybGQ=\";\n\n let bytes = base64::decode(encoded_bytes).unwrap();\n\n let x = Binary {\n\n subtype: BinarySubtype::Generic,\n\n bytes,\n\n };\n\n let output = format!(\"Binary(0x0, {})\", encoded_bytes);\n\n assert_eq!(format!(\"{}\", x), output);\n\n assert_eq!(format!(\"{}\", Bson::from(x)), output);\n\n}\n\n\n","file_path":"src/tests/modules/bson.rs","rank":98,"score":117837.12014941969},{"content":"#[test]\n\nfn test_binary_non_generic_roundtrip() {\n\n let _guard = LOCK.run_concurrently();\n\n #[derive(Serialize, Deserialize, Debug, PartialEq)]\n\n pub struct Foo {\n\n data: Bson,\n\n }\n\n\n\n let x = Foo {\n\n data: Bson::Binary(Binary {\n\n subtype: BinarySubtype::BinaryOld,\n\n bytes: b\"12345abcde\".to_vec(),\n\n }),\n\n };\n\n\n\n let b = to_bson(&x).unwrap();\n\n assert_eq!(\n\n b.as_document().unwrap(),\n\n &doc! {\"data\": Bson::Binary(Binary { subtype: BinarySubtype::BinaryOld, bytes: b\"12345abcde\".to_vec() })}\n\n );\n\n\n\n let f = from_bson::<Foo>(b).unwrap();\n\n assert_eq!(x, f);\n\n}\n\n\n","file_path":"src/tests/serde.rs","rank":99,"score":117179.02244856826}],"string":"[\n {\n \"content\": \"/// Attempts to serialize a u64 as an i32. Errors if an exact conversion is not possible.\\n\\npub fn serialize_u64_as_i32<S: Serializer>(val: &u64, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n match i32::try_from(*val) {\\n\\n Ok(val) => serializer.serialize_i32(val),\\n\\n Err(_) => Err(ser::Error::custom(format!(\\\"cannot convert {} to i32\\\", val))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/serde_helpers.rs\",\n \"rank\": 5,\n \"score\": 317124.7941050074\n },\n {\n \"content\": \"fn read_lenencoded(buf: &[u8]) -> Result<&str> {\\n\\n let length = i32_from_slice(&buf[..4])?;\\n\\n let end = checked_add(usize_try_from_i32(length)?, 4)?;\\n\\n\\n\\n if end < MIN_BSON_STRING_SIZE as usize {\\n\\n return Err(Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: format!(\\n\\n \\\"BSON length encoded string needs to be at least {} bytes, instead got {}\\\",\\n\\n MIN_BSON_STRING_SIZE, end\\n\\n ),\\n\\n }));\\n\\n }\\n\\n\\n\\n if buf.len() < end {\\n\\n return Err(Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: format!(\\n\\n \\\"expected buffer to contain at least {} bytes, but it only has {}\\\",\\n\\n end,\\n\\n buf.len()\\n\\n ),\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 7,\n \"score\": 299642.04692874756\n },\n {\n \"content\": \"fn read_nullterminated(buf: &[u8]) -> Result<&str> {\\n\\n let mut splits = buf.splitn(2, |x| *x == 0);\\n\\n let value = splits.next().ok_or_else(|| {\\n\\n Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: \\\"no value\\\".into(),\\n\\n })\\n\\n })?;\\n\\n if splits.next().is_some() {\\n\\n Ok(try_to_str(value)?)\\n\\n } else {\\n\\n Err(Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: \\\"expected null terminator\\\".into(),\\n\\n }))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 8,\n \"score\": 299642.04692874756\n },\n {\n \"content\": \"/// Attempts to serialize a u64 as an i64. Errors if an exact conversion is not possible.\\n\\npub fn serialize_u64_as_i64<S: Serializer>(val: &u64, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n match i64::try_from(*val) {\\n\\n Ok(val) => serializer.serialize_i64(val),\\n\\n Err(_) => Err(ser::Error::custom(format!(\\\"cannot convert {} to i64\\\", val))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/serde_helpers.rs\",\n \"rank\": 9,\n \"score\": 292733.50286923087\n },\n {\n \"content\": \"fn serialize_array<W: Write + ?Sized>(writer: &mut W, arr: &[Bson]) -> Result<()> {\\n\\n let mut buf = Vec::new();\\n\\n for (key, val) in arr.iter().enumerate() {\\n\\n serialize_bson(&mut buf, &key.to_string(), val)?;\\n\\n }\\n\\n\\n\\n write_i32(\\n\\n writer,\\n\\n (buf.len() + mem::size_of::<i32>() + mem::size_of::<u8>()) as i32,\\n\\n )?;\\n\\n writer.write_all(&buf)?;\\n\\n writer.write_all(b\\\"\\\\0\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\npub(crate) fn serialize_bson<W: Write + ?Sized>(\\n\\n writer: &mut W,\\n\\n key: &str,\\n\\n val: &Bson,\\n\\n) -> Result<()> {\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 11,\n \"score\": 287960.2111828432\n },\n {\n \"content\": \"/// Given a u8 slice, return an i32 calculated from the first four bytes in\\n\\n/// little endian order.\\n\\nfn i32_from_slice(val: &[u8]) -> Result<i32> {\\n\\n let arr = val\\n\\n .get(0..4)\\n\\n .and_then(|s| s.try_into().ok())\\n\\n .ok_or_else(|| {\\n\\n Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: format!(\\\"expected 4 bytes to read i32, instead got {}\\\", val.len()),\\n\\n })\\n\\n })?;\\n\\n Ok(i32::from_le_bytes(arr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 12,\n \"score\": 279075.11421344883\n },\n {\n \"content\": \"fn usize_try_from_i32(i: i32) -> Result<usize> {\\n\\n usize::try_from(i).map_err(|e| {\\n\\n Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: e.to_string(),\\n\\n })\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 13,\n \"score\": 268757.71319332195\n },\n {\n \"content\": \"/// Attempts to serialize a u32 as an i32. Errors if an exact conversion is not possible.\\n\\npub fn serialize_u32_as_i32<S: Serializer>(val: &u32, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n match i32::try_from(*val) {\\n\\n Ok(val) => serializer.serialize_i32(val),\\n\\n Err(_) => Err(ser::Error::custom(format!(\\\"cannot convert {} to i32\\\", val))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/serde_helpers.rs\",\n \"rank\": 14,\n \"score\": 267813.79246200505\n },\n {\n \"content\": \"/// Encode a `T` Serializable into a BSON `Value`.\\n\\npub fn to_bson<T: ?Sized>(value: &T) -> Result<Bson>\\n\\nwhere\\n\\n T: Serialize,\\n\\n{\\n\\n let ser = Serializer::new();\\n\\n value.serialize(ser)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 15,\n \"score\": 252190.06062011834\n },\n {\n \"content\": \"/// Encode a `T` Serializable into a BSON `Document`.\\n\\npub fn to_document<T: ?Sized>(value: &T) -> Result<Document>\\n\\nwhere\\n\\n T: Serialize,\\n\\n{\\n\\n match to_bson(value)? {\\n\\n Bson::Document(doc) => Ok(doc),\\n\\n bson => Err(Error::SerializationError {\\n\\n message: format!(\\n\\n \\\"Could not be serialized to Document, got {:?} instead\\\",\\n\\n bson.element_type()\\n\\n ),\\n\\n }),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Serialize the given `T` as a BSON byte vector.\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 16,\n \"score\": 252119.62373865576\n },\n {\n \"content\": \"fn write_string<W: Write + ?Sized>(writer: &mut W, s: &str) -> Result<()> {\\n\\n writer.write_all(&(s.len() as i32 + 1).to_le_bytes())?;\\n\\n writer.write_all(s.as_bytes())?;\\n\\n writer.write_all(b\\\"\\\\0\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 17,\n \"score\": 251257.55377019825\n },\n {\n \"content\": \"/// Serializes a u32 as an i64.\\n\\npub fn serialize_u32_as_i64<S: Serializer>(val: &u32, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n serializer.serialize_i64(*val as i64)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/serde_helpers.rs\",\n \"rank\": 19,\n \"score\": 243418.1144903599\n },\n {\n \"content\": \"fn to_bytes(doc: &crate::Document) -> Vec<u8> {\\n\\n let mut docbytes = Vec::new();\\n\\n doc.to_writer(&mut docbytes).unwrap();\\n\\n docbytes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 20,\n \"score\": 235160.5928211086\n },\n {\n \"content\": \"fn try_to_str(data: &[u8]) -> Result<&str> {\\n\\n std::str::from_utf8(data).map_err(|e| Error::new_without_key(ErrorKind::Utf8EncodingError(e)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 22,\n \"score\": 225052.5051557566\n },\n {\n \"content\": \"fn write_cstring<W: Write + ?Sized>(writer: &mut W, s: &str) -> Result<()> {\\n\\n if s.contains('\\\\0') {\\n\\n return Err(Error::InvalidCString(s.into()));\\n\\n }\\n\\n writer.write_all(s.as_bytes())?;\\n\\n writer.write_all(b\\\"\\\\0\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[inline]\\n\\npub(crate) fn write_i32<W: Write + ?Sized>(writer: &mut W, val: i32) -> Result<()> {\\n\\n writer\\n\\n .write_all(&val.to_le_bytes())\\n\\n .map(|_| ())\\n\\n .map_err(From::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 23,\n \"score\": 223156.53833628318\n },\n {\n \"content\": \"#[inline]\\n\\nfn write_i64<W: Write + ?Sized>(writer: &mut W, val: i64) -> Result<()> {\\n\\n writer\\n\\n .write_all(&val.to_le_bytes())\\n\\n .map(|_| ())\\n\\n .map_err(From::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 24,\n \"score\": 218146.89534711005\n },\n {\n \"content\": \"#[inline]\\n\\nfn write_f64<W: Write + ?Sized>(writer: &mut W, val: f64) -> Result<()> {\\n\\n writer\\n\\n .write_all(&val.to_le_bytes())\\n\\n .map(|_| ())\\n\\n .map_err(From::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 25,\n \"score\": 218146.89534711005\n },\n {\n \"content\": \"/// Given a u8 slice, return an i32 calculated from the first four bytes in\\n\\n/// little endian order.\\n\\nfn f64_from_slice(val: &[u8]) -> Result<f64> {\\n\\n let arr = val\\n\\n .get(0..8)\\n\\n .and_then(|s| s.try_into().ok())\\n\\n .ok_or_else(|| {\\n\\n Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: format!(\\\"expected 8 bytes to read double, instead got {}\\\", val.len()),\\n\\n })\\n\\n })?;\\n\\n Ok(f64::from_le_bytes(arr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 26,\n \"score\": 213523.62128841132\n },\n {\n \"content\": \"/// Given an u8 slice, return an i64 calculated from the first 8 bytes in\\n\\n/// little endian order.\\n\\nfn i64_from_slice(val: &[u8]) -> Result<i64> {\\n\\n let arr = val\\n\\n .get(0..8)\\n\\n .and_then(|s| s.try_into().ok())\\n\\n .ok_or_else(|| {\\n\\n Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: format!(\\\"expected 8 bytes to read i64, instead got {}\\\", val.len()),\\n\\n })\\n\\n })?;\\n\\n Ok(i64::from_le_bytes(arr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 27,\n \"score\": 213519.36755820632\n },\n {\n \"content\": \"fn convert_unsigned_to_signed<E>(value: u64) -> Result<Bson, E>\\n\\nwhere\\n\\n E: Error,\\n\\n{\\n\\n if let Ok(int32) = i32::try_from(value) {\\n\\n Ok(Bson::Int32(int32))\\n\\n } else if let Ok(int64) = i64::try_from(value) {\\n\\n Ok(Bson::Int64(int64))\\n\\n } else {\\n\\n Err(Error::custom(format!(\\n\\n \\\"cannot represent {} as a signed number\\\",\\n\\n value\\n\\n )))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Serde Deserializer\\n\\npub struct Deserializer {\\n\\n value: Option<Bson>,\\n\\n}\\n\",\n \"file_path\": \"src/de/serde.rs\",\n \"rank\": 28,\n \"score\": 210361.1919644024\n },\n {\n \"content\": \"#[inline]\\n\\nfn write_binary<W: Write>(mut writer: W, bytes: &[u8], subtype: BinarySubtype) -> Result<()> {\\n\\n let len = if let BinarySubtype::BinaryOld = subtype {\\n\\n bytes.len() + 4\\n\\n } else {\\n\\n bytes.len()\\n\\n };\\n\\n\\n\\n if len > MAX_BSON_SIZE as usize {\\n\\n return Err(Error::custom(format!(\\n\\n \\\"binary length {} exceeded maximum size\\\",\\n\\n bytes.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n write_i32(&mut writer, len as i32)?;\\n\\n writer.write_all(&[subtype.into()])?;\\n\\n\\n\\n if let BinarySubtype::BinaryOld = subtype {\\n\\n write_i32(&mut writer, len as i32 - 4)?;\\n\\n };\\n\\n\\n\\n writer.write_all(bytes).map_err(From::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 30,\n \"score\": 202746.50092619093\n },\n {\n \"content\": \"#[test]\\n\\nfn regex() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"regex\\\": Bson::RegularExpression(Regex { pattern: String::from(r\\\"end\\\\s*$\\\"), options: String::from(\\\"i\\\")}),\\n\\n }).unwrap();\\n\\n let regex = rawdoc\\n\\n .get(\\\"regex\\\")\\n\\n .expect(\\\"error finding key regex\\\")\\n\\n .expect(\\\"no key regex\\\")\\n\\n .as_regex()\\n\\n .expect(\\\"was not regex\\\");\\n\\n assert_eq!(regex.pattern, r\\\"end\\\\s*$\\\");\\n\\n assert_eq!(regex.options, \\\"i\\\");\\n\\n}\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 31,\n \"score\": 197371.05057857506\n },\n {\n \"content\": \"#[test]\\n\\nfn boolean() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"boolean\\\": true,\\n\\n })\\n\\n .unwrap();\\n\\n\\n\\n let boolean = rawdoc\\n\\n .get(\\\"boolean\\\")\\n\\n .expect(\\\"error finding key boolean\\\")\\n\\n .expect(\\\"no key boolean\\\")\\n\\n .as_bool()\\n\\n .expect(\\\"result was not boolean\\\");\\n\\n\\n\\n assert!(boolean);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 32,\n \"score\": 197349.30041926814\n },\n {\n \"content\": \"#[test]\\n\\nfn timestamp() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"timestamp\\\": Bson::Timestamp(Timestamp { time: 3542578, increment: 7 }),\\n\\n })\\n\\n .unwrap();\\n\\n let ts = rawdoc\\n\\n .get(\\\"timestamp\\\")\\n\\n .expect(\\\"error finding key timestamp\\\")\\n\\n .expect(\\\"no key timestamp\\\")\\n\\n .as_timestamp()\\n\\n .expect(\\\"was not a timestamp\\\");\\n\\n\\n\\n assert_eq!(ts.increment, 7);\\n\\n assert_eq!(ts.time, 3542578);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 33,\n \"score\": 197333.62056577043\n },\n {\n \"content\": \"#[test]\\n\\nfn string() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\\"string\\\": \\\"hello\\\"}).unwrap();\\n\\n\\n\\n assert_eq!(\\n\\n rawdoc\\n\\n .get(\\\"string\\\")\\n\\n .expect(\\\"error finding key string\\\")\\n\\n .expect(\\\"no key string\\\")\\n\\n .as_str()\\n\\n .expect(\\\"result was not a string\\\"),\\n\\n \\\"hello\\\",\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 34,\n \"score\": 197260.5207764741\n },\n {\n \"content\": \"#[test]\\n\\nfn array() {\\n\\n let rawdoc = RawDocumentBuf::from_document(\\n\\n &doc! { \\\"array\\\": [\\\"binary\\\", \\\"serialized\\\", \\\"object\\\", \\\"notation\\\"]},\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n let array = rawdoc\\n\\n .get(\\\"array\\\")\\n\\n .expect(\\\"error finding key array\\\")\\n\\n .expect(\\\"no key array\\\")\\n\\n .as_array()\\n\\n .expect(\\\"result was not an array\\\");\\n\\n assert_eq!(array.get_str(0), Ok(\\\"binary\\\"));\\n\\n assert_eq!(array.get_str(3), Ok(\\\"notation\\\"));\\n\\n assert_eq!(\\n\\n array.get_str(4).unwrap_err().kind,\\n\\n ValueAccessErrorKind::NotPresent\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 35,\n \"score\": 197204.2044454901\n },\n {\n \"content\": \"#[test]\\n\\nfn document() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\\"document\\\": {}}).unwrap();\\n\\n\\n\\n let doc = rawdoc\\n\\n .get(\\\"document\\\")\\n\\n .expect(\\\"error finding key document\\\")\\n\\n .expect(\\\"no key document\\\")\\n\\n .as_document()\\n\\n .expect(\\\"result was not a document\\\");\\n\\n assert_eq!(doc.as_bytes(), [5u8, 0, 0, 0, 0].as_ref()); // Empty document\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 36,\n \"score\": 196502.63379949162\n },\n {\n \"content\": \"#[test]\\n\\nfn string_from_document() {\\n\\n let docbytes = to_bytes(&doc! {\\n\\n \\\"this\\\": \\\"first\\\",\\n\\n \\\"that\\\": \\\"second\\\",\\n\\n \\\"something\\\": \\\"else\\\",\\n\\n });\\n\\n let rawdoc = RawDocument::new(&docbytes).unwrap();\\n\\n assert_eq!(\\n\\n rawdoc.get(\\\"that\\\").unwrap().unwrap().as_str().unwrap(),\\n\\n \\\"second\\\",\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 37,\n \"score\": 194527.9890561763\n },\n {\n \"content\": \"fn checked_add(lhs: usize, rhs: usize) -> Result<usize> {\\n\\n lhs.checked_add(rhs).ok_or_else(|| {\\n\\n Error::new_without_key(ErrorKind::MalformedValue {\\n\\n message: \\\"attempted to add with overflow\\\".to_string(),\\n\\n })\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/raw/mod.rs\",\n \"rank\": 38,\n \"score\": 194412.71206478684\n },\n {\n \"content\": \"/// Verifies the following:\\n\\n/// - deserializing a `T` from `expected_doc` produces `expected_value`\\n\\n/// - deserializing a `T` from the raw BSON version of `expected_doc` produces `expected_value`\\n\\n/// - deserializing a `Document` from the raw BSON version of `expected_doc` produces `expected_doc`\\n\\nfn run_deserialize_test<T>(expected_value: &T, expected_doc: &Document, description: &str)\\n\\nwhere\\n\\n T: DeserializeOwned + PartialEq + std::fmt::Debug,\\n\\n{\\n\\n let mut expected_bytes = Vec::new();\\n\\n expected_doc\\n\\n .to_writer(&mut expected_bytes)\\n\\n .expect(description);\\n\\n\\n\\n assert_eq!(\\n\\n &bson::from_document::<T>(expected_doc.clone()).expect(description),\\n\\n expected_value,\\n\\n \\\"{}\\\",\\n\\n description\\n\\n );\\n\\n assert_eq!(\\n\\n &bson::from_reader::<_, T>(expected_bytes.as_slice()).expect(description),\\n\\n expected_value,\\n\\n \\\"{}\\\",\\n\\n description\\n\\n );\\n\\n assert_eq!(\\n\\n &bson::from_reader::<_, Document>(expected_bytes.as_slice()).expect(description),\\n\\n expected_doc,\\n\\n \\\"{}\\\",\\n\\n description\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 40,\n \"score\": 176139.87736129016\n },\n {\n \"content\": \"#[test]\\n\\nfn array() {\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n a: Vec<i32>,\\n\\n }\\n\\n\\n\\n let v = Foo {\\n\\n a: vec![1, 2, 3, 4],\\n\\n };\\n\\n let doc = doc! {\\n\\n \\\"a\\\": [1, 2, 3, 4],\\n\\n };\\n\\n run_test(&v, &doc, \\\"array\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 41,\n \"score\": 165912.94781494976\n },\n {\n \"content\": \"#[test]\\n\\nfn binary() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"binary\\\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1u8, 2, 3] }\\n\\n })\\n\\n .unwrap();\\n\\n let binary: bson::RawBinary<'_> = rawdoc\\n\\n .get(\\\"binary\\\")\\n\\n .expect(\\\"error finding key binary\\\")\\n\\n .expect(\\\"no key binary\\\")\\n\\n .as_binary()\\n\\n .expect(\\\"result was not a binary object\\\");\\n\\n assert_eq!(binary.subtype, BinarySubtype::Generic);\\n\\n assert_eq!(binary.bytes, &[1, 2, 3]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 42,\n \"score\": 165003.58901780075\n },\n {\n \"content\": \"#[inline]\\n\\npub fn to_vec<T>(value: &T) -> Result<Vec<u8>>\\n\\nwhere\\n\\n T: Serialize,\\n\\n{\\n\\n let mut serializer = raw::Serializer::new();\\n\\n value.serialize(&mut serializer)?;\\n\\n Ok(serializer.into_vec())\\n\\n}\\n\",\n \"file_path\": \"src/ser/mod.rs\",\n \"rank\": 43,\n \"score\": 163705.8986459294\n },\n {\n \"content\": \"#[test]\\n\\nfn application_deserialize_error() {\\n\\n #[derive(PartialEq, Debug)]\\n\\n struct Range10(usize);\\n\\n impl<'de> Deserialize<'de> for Range10 {\\n\\n fn deserialize<D: serde::Deserializer<'de>>(d: D) -> Result<Range10, D::Error> {\\n\\n let x: usize = Deserialize::deserialize(d)?;\\n\\n if x > 10 {\\n\\n Err(serde::de::Error::invalid_value(\\n\\n Unexpected::Unsigned(x as u64),\\n\\n &\\\"more than 10\\\",\\n\\n ))\\n\\n } else {\\n\\n Ok(Range10(x))\\n\\n }\\n\\n }\\n\\n }\\n\\n let d_good = Deserializer::new(Bson::Int64(5));\\n\\n let d_bad1 = Deserializer::new(Bson::String(\\\"not an isize\\\".to_string()));\\n\\n let d_bad2 = Deserializer::new(Bson::Int64(11));\\n\\n\\n\\n assert_eq!(\\n\\n Range10(5),\\n\\n Deserialize::deserialize(d_good).expect(\\\"deserialization should succeed\\\")\\n\\n );\\n\\n\\n\\n Range10::deserialize(d_bad1).expect_err(\\\"deserialization from string should fail\\\");\\n\\n Range10::deserialize(d_bad2).expect_err(\\\"deserialization from 11 should fail\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 44,\n \"score\": 160344.03236501318\n },\n {\n \"content\": \"#[test]\\n\\nfn into_bson_conversion() {\\n\\n let docbytes = to_bytes(&doc! {\\n\\n \\\"f64\\\": 2.5,\\n\\n \\\"string\\\": \\\"hello\\\",\\n\\n \\\"document\\\": {},\\n\\n \\\"array\\\": [\\\"binary\\\", \\\"serialized\\\", \\\"object\\\", \\\"notation\\\"],\\n\\n \\\"object_id\\\": ObjectId::from_bytes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]),\\n\\n \\\"binary\\\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1u8, 2, 3] },\\n\\n \\\"boolean\\\": false,\\n\\n });\\n\\n let rawbson = RawBson::Document(RawDocument::new(docbytes.as_slice()).unwrap());\\n\\n let b: Bson = rawbson.try_into().expect(\\\"invalid bson\\\");\\n\\n let doc = b.as_document().expect(\\\"not a document\\\");\\n\\n assert_eq!(*doc.get(\\\"f64\\\").expect(\\\"f64 not found\\\"), Bson::Double(2.5));\\n\\n assert_eq!(\\n\\n *doc.get(\\\"string\\\").expect(\\\"string not found\\\"),\\n\\n Bson::String(String::from(\\\"hello\\\"))\\n\\n );\\n\\n assert_eq!(\\n\\n *doc.get(\\\"document\\\").expect(\\\"document not found\\\"),\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 45,\n \"score\": 158753.18367854963\n },\n {\n \"content\": \"#[test]\\n\\nfn document_iteration() {\\n\\n let doc = doc! {\\n\\n \\\"f64\\\": 2.5,\\n\\n \\\"string\\\": \\\"hello\\\",\\n\\n \\\"document\\\": {},\\n\\n \\\"array\\\": [\\\"binary\\\", \\\"serialized\\\", \\\"object\\\", \\\"notation\\\"],\\n\\n \\\"binary\\\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1u8, 2, 3] },\\n\\n \\\"object_id\\\": ObjectId::from_bytes([1, 2, 3, 4, 5,6,7,8,9,10, 11,12]),\\n\\n \\\"boolean\\\": true,\\n\\n \\\"datetime\\\": DateTime::now(),\\n\\n \\\"null\\\": Bson::Null,\\n\\n \\\"regex\\\": Bson::RegularExpression(Regex { pattern: String::from(r\\\"end\\\\s*$\\\"), options: String::from(\\\"i\\\")}),\\n\\n \\\"javascript\\\": Bson::JavaScriptCode(String::from(\\\"console.log(console);\\\")),\\n\\n \\\"symbol\\\": Bson::Symbol(String::from(\\\"artist-formerly-known-as\\\")),\\n\\n \\\"javascript_with_scope\\\": Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope{ code: String::from(\\\"console.log(msg);\\\"), scope: doc!{\\\"ok\\\": true}}),\\n\\n \\\"int32\\\": 23i32,\\n\\n \\\"timestamp\\\": Bson::Timestamp(Timestamp { time: 3542578, increment: 0 }),\\n\\n \\\"int64\\\": 46i64,\\n\\n \\\"end\\\": \\\"END\\\",\\n\\n };\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 46,\n \"score\": 158712.78181275353\n },\n {\n \"content\": \"#[test]\\n\\nfn nested_document() {\\n\\n let docbytes = to_bytes(&doc! {\\n\\n \\\"outer\\\": {\\n\\n \\\"inner\\\": \\\"surprise\\\",\\n\\n \\\"i64\\\": 6_i64,\\n\\n },\\n\\n });\\n\\n let rawdoc = RawDocument::new(&docbytes).unwrap();\\n\\n let subdoc = rawdoc\\n\\n .get(\\\"outer\\\")\\n\\n .expect(\\\"get doc result\\\")\\n\\n .expect(\\\"get doc option\\\")\\n\\n .as_document()\\n\\n .expect(\\\"as doc\\\");\\n\\n assert_eq!(\\n\\n subdoc\\n\\n .get(\\\"inner\\\")\\n\\n .expect(\\\"get str result\\\")\\n\\n .expect(\\\"get str option\\\")\\n\\n .as_str()\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 47,\n \"score\": 158712.78181275353\n },\n {\n \"content\": \"/// Serializes an [`ObjectId`] as a hex string.\\n\\npub fn serialize_object_id_as_hex_string<S: Serializer>(\\n\\n val: &ObjectId,\\n\\n serializer: S,\\n\\n) -> Result<S::Ok, S::Error> {\\n\\n val.to_hex().serialize(serializer)\\n\\n}\\n\\n\\n\\n/// Contains functions to serialize a u32 as an f64 (BSON double) and deserialize a\\n\\n/// u32 from an f64 (BSON double).\\n\\n///\\n\\n/// ```rust\\n\\n/// # use serde::{Serialize, Deserialize};\\n\\n/// # use bson::serde_helpers::u32_as_f64;\\n\\n/// #[derive(Serialize, Deserialize)]\\n\\n/// struct FileInfo {\\n\\n/// #[serde(with = \\\"u32_as_f64\\\")]\\n\\n/// pub size_bytes: u32,\\n\\n/// }\\n\\n/// ```\\n\\npub mod u32_as_f64 {\\n\",\n \"file_path\": \"src/serde_helpers.rs\",\n \"rank\": 48,\n \"score\": 156038.08718922042\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_utf8_string() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let src = \\\"test你好吗\\\".to_owned();\\n\\n let dst = vec![\\n\\n 28, 0, 0, 0, 2, 107, 101, 121, 0, 14, 0, 0, 0, 116, 101, 115, 116, 228, 189, 160, 229, 165,\\n\\n 189, 229, 144, 151, 0, 0,\\n\\n ];\\n\\n\\n\\n let doc = doc! { \\\"key\\\": src };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n assert_eq!(buf, dst);\\n\\n\\n\\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(deserialized, doc);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 49,\n \"score\": 154049.04746385562\n },\n {\n \"content\": \"#[test]\\n\\nfn test_deserialize_invalid_array_length() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let buffer = b\\\"\\\\n\\\\x00\\\\x00\\\\x00\\\\x04\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00\\\";\\n\\n Document::from_reader(&mut std::io::Cursor::new(buffer))\\n\\n .expect_err(\\\"expected deserialization to fail\\\");\\n\\n}\\n\\n\\n\\n/// [RUST-713](https://jira.mongodb.org/browse/RUST-713)\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 50,\n \"score\": 154023.34188052823\n },\n {\n \"content\": \"/// Verifies the following:\\n\\n/// - round trip `expected_value` through `Document`:\\n\\n/// - serializing the `expected_value` to a `Document` matches the `expected_doc`\\n\\n/// - deserializing from the serialized document produces `expected_value`\\n\\n/// - round trip through raw BSON:\\n\\n/// - deserializing a `T` from the raw BSON version of `expected_doc` produces `expected_value`\\n\\n/// - deserializing a `Document` from the raw BSON version of `expected_doc` produces\\n\\n/// `expected_doc`\\n\\n/// - `bson::to_writer` and `Document::to_writer` produce the same result given the same input\\n\\nfn run_test<T>(expected_value: &T, expected_doc: &Document, description: &str)\\n\\nwhere\\n\\n T: Serialize + DeserializeOwned + PartialEq + std::fmt::Debug,\\n\\n{\\n\\n let mut expected_bytes = Vec::new();\\n\\n expected_doc\\n\\n .to_writer(&mut expected_bytes)\\n\\n .expect(description);\\n\\n\\n\\n let expected_bytes_serde = bson::to_vec(&expected_value).expect(description);\\n\\n assert_eq!(expected_bytes_serde, expected_bytes, \\\"{}\\\", description);\\n\\n\\n\\n let expected_bytes_from_doc_serde = bson::to_vec(&expected_doc).expect(description);\\n\\n assert_eq!(\\n\\n expected_bytes_from_doc_serde, expected_bytes,\\n\\n \\\"{}\\\",\\n\\n description\\n\\n );\\n\\n\\n\\n let serialized_doc = bson::to_document(&expected_value).expect(description);\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 51,\n \"score\": 152937.20079662482\n },\n {\n \"content\": \"#[test]\\n\\nfn test_deserialize_invalid_utf8_string_issue64() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let buffer = b\\\"\\\\x13\\\\x00\\\\x00\\\\x00\\\\x02\\\\x01\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00foo\\\\x00\\\\x13\\\\x05\\\\x00\\\\x00\\\\x00\\\";\\n\\n\\n\\n assert!(Document::from_reader(&mut Cursor::new(buffer)).is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 52,\n \"score\": 150079.46084869784\n },\n {\n \"content\": \"#[test]\\n\\nfn test_deserialize_invalid_old_binary_length() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let buffer = b\\\"\\\\x0F\\\\x00\\\\x00\\\\x00\\\\x05\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00\\\\x02\\\\xFC\\\\xFF\\\\xFF\\\\xFF\\\";\\n\\n Document::from_reader(&mut std::io::Cursor::new(buffer))\\n\\n .expect_err(\\\"expected deserialization to fail\\\");\\n\\n\\n\\n let buffer = b\\\".\\\\x00\\\\x00\\\\x00\\\\x05\\\\x01\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00\\\\x02\\\\xfc\\\\xff\\\\xff\\\\xff\\\\xff\\\\xff\\\\xff\\\\xff\\\\x00\\\\x00*\\\\x00h\\\\x0e\\\\x10++\\\\x00h\\\\x0e++\\\\x00\\\\x00\\\\t\\\\x00\\\\x00\\\\x00\\\\x00\\\\x00*\\\\x0e\\\\x10++\\\";\\n\\n Document::from_reader(&mut std::io::Cursor::new(buffer))\\n\\n .expect_err(\\\"expected deserialization to fail\\\");\\n\\n}\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 53,\n \"score\": 150059.64434786295\n },\n {\n \"content\": \"struct Decimal128Deserializer(Decimal128);\\n\\n\\n\\nimpl<'de> serde::de::Deserializer<'de> for Decimal128Deserializer {\\n\\n type Error = Error;\\n\\n\\n\\n fn deserialize_any<V>(self, visitor: V) -> Result<V::Value>\\n\\n where\\n\\n V: serde::de::Visitor<'de>,\\n\\n {\\n\\n visitor.visit_bytes(&self.0.bytes)\\n\\n }\\n\\n\\n\\n serde::forward_to_deserialize_any! {\\n\\n bool u8 u16 u32 u64 i8 i16 i32 i64 f32 f64 char str string seq\\n\\n bytes byte_buf map struct option unit newtype_struct\\n\\n ignored_any unit_struct tuple_struct tuple enum identifier\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/de/raw.rs\",\n \"rank\": 54,\n \"score\": 145432.7539427409\n },\n {\n \"content\": \"#[test]\\n\\nfn test_encode_decode_utf8_string_invalid() {\\n\\n let bytes = b\\\"\\\\x80\\\\xae\\\".to_vec();\\n\\n let src = unsafe { String::from_utf8_unchecked(bytes) };\\n\\n\\n\\n let doc = doc! { \\\"key\\\": src };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n let expected = doc! { \\\"key\\\": \\\"��\\\" };\\n\\n let decoded = Document::from_reader_utf8_lossy(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(decoded, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 55,\n \"score\": 138551.01244173554\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serde_bytes() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n #[derive(Serialize, Deserialize, Debug, Eq, PartialEq)]\\n\\n pub struct Foo {\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n data: Vec<u8>,\\n\\n }\\n\\n\\n\\n let x = Foo {\\n\\n data: b\\\"12345abcde\\\".to_vec(),\\n\\n };\\n\\n\\n\\n let b = to_bson(&x).unwrap();\\n\\n assert_eq!(\\n\\n b.as_document().unwrap(),\\n\\n &doc! {\\\"data\\\": Bson::Binary(Binary { subtype: BinarySubtype::Generic, bytes: b\\\"12345abcde\\\".to_vec() })}\\n\\n );\\n\\n\\n\\n let f = from_bson::<Foo>(b).unwrap();\\n\\n assert_eq!(x, f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 56,\n \"score\": 135532.93425735508\n },\n {\n \"content\": \"#[test]\\n\\nfn table_array() {\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n a: Vec<Bar>,\\n\\n }\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Bar {\\n\\n a: i32,\\n\\n }\\n\\n\\n\\n let v = Foo {\\n\\n a: vec![Bar { a: 1 }, Bar { a: 2 }],\\n\\n };\\n\\n let doc = doc! {\\n\\n \\\"a\\\": [{ \\\"a\\\": 1 }, { \\\"a\\\": 2 }]\\n\\n };\\n\\n run_test(&v, &doc, \\\"table_array\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 57,\n \"score\": 129066.78056574118\n },\n {\n \"content\": \"#[test]\\n\\nfn default_array() {\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n #[serde(default)]\\n\\n a: Vec<Bar>,\\n\\n }\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Bar;\\n\\n\\n\\n let v = Foo { a: vec![] };\\n\\n let doc = doc! {};\\n\\n run_deserialize_test(&v, &doc, \\\"default_array\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 58,\n \"score\": 129066.78056574118\n },\n {\n \"content\": \"#[test]\\n\\nfn null_array() {\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n a: Option<Vec<Bar>>,\\n\\n }\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Bar;\\n\\n\\n\\n let v = Foo { a: None };\\n\\n let doc = doc! {};\\n\\n run_deserialize_test(&v, &doc, \\\"null_array\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 59,\n \"score\": 129066.78056574118\n },\n {\n \"content\": \"#[test]\\n\\nfn empty_array() {\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n a: Option<Vec<Bar>>,\\n\\n }\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Bar;\\n\\n\\n\\n let v = Foo { a: Some(vec![]) };\\n\\n let doc = doc! {\\n\\n \\\"a\\\": []\\n\\n };\\n\\n run_deserialize_test(&v, &doc, \\\"empty_array\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 60,\n \"score\": 129066.78056574118\n },\n {\n \"content\": \"#[test]\\n\\nfn missing_errors() {\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n bar: i32,\\n\\n }\\n\\n\\n\\n let doc = doc! {};\\n\\n\\n\\n bson::from_document::<Foo>(doc.clone()).unwrap_err();\\n\\n\\n\\n let mut bytes = Vec::new();\\n\\n doc.to_writer(&mut bytes).unwrap();\\n\\n\\n\\n bson::from_reader::<_, Foo>(bytes.as_slice()).unwrap_err();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"serde-tests/test.rs\",\n \"rank\": 61,\n \"score\": 129041.58497535517\n },\n {\n \"content\": \"#[test]\\n\\nfn symbol() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"symbol\\\": Bson::Symbol(String::from(\\\"artist-formerly-known-as\\\")),\\n\\n })\\n\\n .unwrap();\\n\\n\\n\\n let symbol = rawdoc\\n\\n .get(\\\"symbol\\\")\\n\\n .expect(\\\"error finding key symbol\\\")\\n\\n .expect(\\\"no key symbol\\\")\\n\\n .as_symbol()\\n\\n .expect(\\\"was not symbol\\\");\\n\\n assert_eq!(symbol, \\\"artist-formerly-known-as\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 62,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn int64() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"int64\\\": 46i64,\\n\\n })\\n\\n .unwrap();\\n\\n let int64 = rawdoc\\n\\n .get(\\\"int64\\\")\\n\\n .expect(\\\"error finding key int64\\\")\\n\\n .expect(\\\"no key int64\\\")\\n\\n .as_i64()\\n\\n .expect(\\\"was not int64\\\");\\n\\n assert_eq!(int64, 46i64);\\n\\n}\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 63,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn int32() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"int32\\\": 23i32,\\n\\n })\\n\\n .unwrap();\\n\\n let int32 = rawdoc\\n\\n .get(\\\"int32\\\")\\n\\n .expect(\\\"error finding key int32\\\")\\n\\n .expect(\\\"no key int32\\\")\\n\\n .as_i32()\\n\\n .expect(\\\"was not int32\\\");\\n\\n assert_eq!(int32, 23i32);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 64,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn javascript() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"javascript\\\": Bson::JavaScriptCode(String::from(\\\"console.log(console);\\\")),\\n\\n })\\n\\n .unwrap();\\n\\n let js = rawdoc\\n\\n .get(\\\"javascript\\\")\\n\\n .expect(\\\"error finding key javascript\\\")\\n\\n .expect(\\\"no key javascript\\\")\\n\\n .as_javascript()\\n\\n .expect(\\\"was not javascript\\\");\\n\\n assert_eq!(js, \\\"console.log(console);\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 65,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn f64() {\\n\\n #![allow(clippy::float_cmp)]\\n\\n\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! { \\\"f64\\\": 2.5 }).unwrap();\\n\\n assert_eq!(\\n\\n rawdoc\\n\\n .get(\\\"f64\\\")\\n\\n .expect(\\\"error finding key f64\\\")\\n\\n .expect(\\\"no key f64\\\")\\n\\n .as_f64()\\n\\n .expect(\\\"result was not a f64\\\"),\\n\\n 2.5,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 66,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn null() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"null\\\": null,\\n\\n })\\n\\n .unwrap();\\n\\n let () = rawdoc\\n\\n .get(\\\"null\\\")\\n\\n .expect(\\\"error finding key null\\\")\\n\\n .expect(\\\"no key null\\\")\\n\\n .as_null()\\n\\n .expect(\\\"was not null\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 67,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn iterate() {\\n\\n let docbytes = to_bytes(&doc! {\\n\\n \\\"apples\\\": \\\"oranges\\\",\\n\\n \\\"peanut butter\\\": \\\"chocolate\\\",\\n\\n \\\"easy as\\\": {\\\"do\\\": 1, \\\"re\\\": 2, \\\"mi\\\": 3},\\n\\n });\\n\\n let rawdoc = RawDocument::new(&docbytes).expect(\\\"malformed bson document\\\");\\n\\n let mut dociter = rawdoc.into_iter();\\n\\n let next = dociter.next().expect(\\\"no result\\\").expect(\\\"invalid bson\\\");\\n\\n assert_eq!(next.0, \\\"apples\\\");\\n\\n assert_eq!(next.1.as_str().expect(\\\"result was not a str\\\"), \\\"oranges\\\");\\n\\n let next = dociter.next().expect(\\\"no result\\\").expect(\\\"invalid bson\\\");\\n\\n assert_eq!(next.0, \\\"peanut butter\\\");\\n\\n assert_eq!(next.1.as_str().expect(\\\"result was not a str\\\"), \\\"chocolate\\\");\\n\\n let next = dociter.next().expect(\\\"no result\\\").expect(\\\"invalid bson\\\");\\n\\n assert_eq!(next.0, \\\"easy as\\\");\\n\\n let _doc = next.1.as_document().expect(\\\"result was a not a document\\\");\\n\\n let next = dociter.next();\\n\\n assert!(next.is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 68,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn datetime() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"boolean\\\": true,\\n\\n \\\"datetime\\\": DateTime::from_chrono(Utc.ymd(2000,10,31).and_hms(12, 30, 45)),\\n\\n })\\n\\n .unwrap();\\n\\n let datetime = rawdoc\\n\\n .get(\\\"datetime\\\")\\n\\n .expect(\\\"error finding key datetime\\\")\\n\\n .expect(\\\"no key datetime\\\")\\n\\n .as_datetime()\\n\\n .expect(\\\"result was not datetime\\\");\\n\\n assert_eq!(datetime.to_rfc3339(), \\\"2000-10-31T12:30:45Z\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 69,\n \"score\": 127776.5338055752\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_boolean() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let src = true;\\n\\n let dst = vec![11, 0, 0, 0, 8, 107, 101, 121, 0, 1, 0];\\n\\n\\n\\n let doc = doc! { \\\"key\\\": src };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n assert_eq!(buf, dst);\\n\\n\\n\\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(deserialized, doc);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 70,\n \"score\": 126246.69905635175\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_i32() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let src = 100i32;\\n\\n let dst = vec![14, 0, 0, 0, 16, 107, 101, 121, 0, 100, 0, 0, 0, 0];\\n\\n\\n\\n let doc = doc! { \\\"key\\\": src };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n assert_eq!(buf, dst);\\n\\n\\n\\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(deserialized, doc);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 71,\n \"score\": 126235.84724711187\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_decimal128() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let val = Bson::Decimal128(Decimal128 {\\n\\n bytes: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 34],\\n\\n });\\n\\n let dst = vec![\\n\\n 26, 0, 0, 0, 19, 107, 101, 121, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 34, 0,\\n\\n ];\\n\\n\\n\\n let doc = doc! { \\\"key\\\": val };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n assert_eq!(buf, dst);\\n\\n\\n\\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(deserialized, doc);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 72,\n \"score\": 126235.84724711187\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_timestamp() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let src = Bson::Timestamp(Timestamp {\\n\\n time: 0,\\n\\n increment: 100,\\n\\n });\\n\\n let dst = vec![\\n\\n 18, 0, 0, 0, 17, 107, 101, 121, 0, 100, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\n ];\\n\\n\\n\\n let doc = doc! { \\\"key\\\": src };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n assert_eq!(buf, dst);\\n\\n\\n\\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(deserialized, doc);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 73,\n \"score\": 126209.06917930511\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_array() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let src = vec![Bson::Double(1.01), Bson::String(\\\"xyz\\\".to_owned())];\\n\\n let dst = vec![\\n\\n 37, 0, 0, 0, 4, 107, 101, 121, 0, 27, 0, 0, 0, 1, 48, 0, 41, 92, 143, 194, 245, 40, 240,\\n\\n 63, 2, 49, 0, 4, 0, 0, 0, 120, 121, 122, 0, 0, 0,\\n\\n ];\\n\\n\\n\\n let doc = doc! { \\\"key\\\": src };\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n doc.to_writer(&mut buf).unwrap();\\n\\n\\n\\n assert_eq!(buf, dst);\\n\\n\\n\\n let deserialized = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n assert_eq!(deserialized, doc);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 74,\n \"score\": 126144.59928861225\n },\n {\n \"content\": \"#[test]\\n\\nfn test_serialize_deserialize_document() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n\\n\\n #[derive(Debug, Deserialize, Serialize, PartialEq)]\\n\\n struct Point {\\n\\n x: i32,\\n\\n y: i32,\\n\\n }\\n\\n let src = Point { x: 1, y: 2 };\\n\\n\\n\\n let doc = to_document(&src).unwrap();\\n\\n assert_eq!(doc, doc! { \\\"x\\\": 1, \\\"y\\\": 2 });\\n\\n\\n\\n let point: Point = from_document(doc).unwrap();\\n\\n assert_eq!(src, point);\\n\\n\\n\\n #[derive(Debug, Deserialize, Serialize, PartialEq)]\\n\\n struct Line {\\n\\n p1: Point,\\n\\n p2: Point,\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 75,\n \"score\": 125607.7102313983\n },\n {\n \"content\": \"#[test]\\n\\nfn timestamp_ordering() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let ts1 = Timestamp {\\n\\n time: 0,\\n\\n increment: 1,\\n\\n };\\n\\n let ts2 = Timestamp {\\n\\n time: 0,\\n\\n increment: 2,\\n\\n };\\n\\n let ts3 = Timestamp {\\n\\n time: 1,\\n\\n increment: 0,\\n\\n };\\n\\n assert!(ts1 < ts2);\\n\\n assert!(ts1 < ts3);\\n\\n assert!(ts2 < ts3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/bson.rs\",\n \"rank\": 76,\n \"score\": 125573.15322231976\n },\n {\n \"content\": \"#[test]\\n\\nfn arr() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let obj = Bson::Array(vec![\\n\\n Bson::Int32(0),\\n\\n Bson::Int32(1),\\n\\n Bson::Int32(2),\\n\\n Bson::Int32(3),\\n\\n ]);\\n\\n let arr: Vec<i32> = from_bson(obj.clone()).unwrap();\\n\\n assert_eq!(arr, vec![0i32, 1i32, 2i32, 3i32]);\\n\\n\\n\\n let deser: Bson = to_bson(&arr).unwrap();\\n\\n assert_eq!(deser, obj);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/ser.rs\",\n \"rank\": 77,\n \"score\": 125525.67201150142\n },\n {\n \"content\": \"#[test]\\n\\nfn boolean() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let obj = Bson::Boolean(true);\\n\\n let b: bool = from_bson(obj.clone()).unwrap();\\n\\n assert!(b);\\n\\n\\n\\n let deser: Bson = to_bson(&b).unwrap();\\n\\n assert_eq!(deser, obj);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/ser.rs\",\n \"rank\": 78,\n \"score\": 125519.1797743224\n },\n {\n \"content\": \"#[test]\\n\\nfn string() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let obj = Bson::String(\\\"avocado\\\".to_owned());\\n\\n let s: String = from_bson(obj.clone()).unwrap();\\n\\n assert_eq!(s, \\\"avocado\\\");\\n\\n\\n\\n let deser: Bson = to_bson(&s).unwrap();\\n\\n assert_eq!(obj, deser);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/ser.rs\",\n \"rank\": 79,\n \"score\": 125430.4001315284\n },\n {\n \"content\": \"#[test]\\n\\nfn document_default() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let doc1 = Document::default();\\n\\n assert_eq!(doc1.keys().count(), 0);\\n\\n assert_eq!(doc1, Document::new());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/bson.rs\",\n \"rank\": 80,\n \"score\": 124901.04444259244\n },\n {\n \"content\": \"#[test]\\n\\nfn test_de_regex() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n use bson::Regex;\\n\\n\\n\\n #[derive(Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n regex: Regex,\\n\\n }\\n\\n\\n\\n let regex = Regex {\\n\\n pattern: \\\"12\\\".into(),\\n\\n options: \\\"01\\\".into(),\\n\\n };\\n\\n\\n\\n let foo: Foo = from_bson(Bson::Document(doc! {\\n\\n \\\"regex\\\": Bson::RegularExpression(regex.clone()),\\n\\n }))\\n\\n .unwrap();\\n\\n\\n\\n assert_eq!(foo.regex, regex);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 81,\n \"score\": 124899.40089391646\n },\n {\n \"content\": \"#[test]\\n\\nfn test_ser_regex() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n use bson::Regex;\\n\\n\\n\\n #[derive(Serialize, Deserialize, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n regex: Regex,\\n\\n }\\n\\n\\n\\n let regex = Regex {\\n\\n pattern: \\\"12\\\".into(),\\n\\n options: \\\"01\\\".into(),\\n\\n };\\n\\n\\n\\n let foo = Foo {\\n\\n regex: regex.clone(),\\n\\n };\\n\\n\\n\\n let x = to_bson(&foo).unwrap();\\n\\n assert_eq!(\\n\\n x.as_document().unwrap(),\\n\\n &doc! { \\\"regex\\\": Bson::RegularExpression(regex) }\\n\\n );\\n\\n\\n\\n let xfoo: Foo = from_bson(x).unwrap();\\n\\n assert_eq!(xfoo, foo);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 82,\n \"score\": 124899.40089391646\n },\n {\n \"content\": \"#[test]\\n\\nfn test_byte_vec() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n #[derive(Serialize, Debug, Eq, PartialEq)]\\n\\n pub struct AuthChallenge<'a> {\\n\\n #[serde(with = \\\"serde_bytes\\\")]\\n\\n pub challenge: &'a [u8],\\n\\n }\\n\\n\\n\\n let x = AuthChallenge {\\n\\n challenge: b\\\"18762b98b7c34c25bf9dc3154e4a5ca3\\\",\\n\\n };\\n\\n\\n\\n let b = to_bson(&x).unwrap();\\n\\n assert_eq!(\\n\\n b,\\n\\n Bson::Document(\\n\\n doc! { \\\"challenge\\\": (Bson::Binary(Binary { subtype: BinarySubtype::Generic, bytes: x.challenge.to_vec() }))}\\n\\n )\\n\\n );\\n\\n\\n\\n // let mut buf = Vec::new();\\n\\n // b.as_document().unwrap().to_writer(&mut buf).unwrap();\\n\\n\\n\\n // let xb = Document::from_reader(&mut Cursor::new(buf)).unwrap();\\n\\n // assert_eq!(b.as_document().unwrap(), &xb);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 83,\n \"score\": 124875.39424294567\n },\n {\n \"content\": \"#[test]\\n\\nfn test_timestamp_helpers() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n\\n\\n #[derive(Deserialize, Serialize)]\\n\\n struct A {\\n\\n #[serde(with = \\\"u32_as_timestamp\\\")]\\n\\n pub time: u32,\\n\\n }\\n\\n\\n\\n let time = 12345;\\n\\n let a = A { time };\\n\\n let doc = to_document(&a).unwrap();\\n\\n let timestamp = doc.get_timestamp(\\\"time\\\").unwrap();\\n\\n assert_eq!(timestamp.time, time);\\n\\n assert_eq!(timestamp.increment, 0);\\n\\n let a: A = from_document(doc).unwrap();\\n\\n assert_eq!(a.time, time);\\n\\n\\n\\n #[derive(Deserialize, Serialize)]\\n\\n struct B {\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 84,\n \"score\": 124863.43876044312\n },\n {\n \"content\": \"#[test]\\n\\nfn test_ser_timestamp() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n use bson::Timestamp;\\n\\n\\n\\n #[derive(Serialize, Deserialize, Eq, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n ts: Timestamp,\\n\\n }\\n\\n\\n\\n let foo = Foo {\\n\\n ts: Timestamp {\\n\\n time: 12,\\n\\n increment: 10,\\n\\n },\\n\\n };\\n\\n\\n\\n let x = to_bson(&foo).unwrap();\\n\\n assert_eq!(\\n\\n x.as_document().unwrap(),\\n\\n &doc! { \\\"ts\\\": Bson::Timestamp(Timestamp { time: 0x0000_000C, increment: 0x0000_000A }) }\\n\\n );\\n\\n\\n\\n let xfoo: Foo = from_bson(x).unwrap();\\n\\n assert_eq!(xfoo, foo);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 85,\n \"score\": 124863.43876044312\n },\n {\n \"content\": \"#[test]\\n\\nfn test_de_timestamp() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n use bson::Timestamp;\\n\\n\\n\\n #[derive(Deserialize, Eq, PartialEq, Debug)]\\n\\n struct Foo {\\n\\n ts: Timestamp,\\n\\n }\\n\\n\\n\\n let foo: Foo = from_bson(Bson::Document(doc! {\\n\\n \\\"ts\\\": Bson::Timestamp(Timestamp { time: 0x0000_000C, increment: 0x0000_000A }),\\n\\n }))\\n\\n .unwrap();\\n\\n\\n\\n assert_eq!(\\n\\n foo.ts,\\n\\n Timestamp {\\n\\n time: 12,\\n\\n increment: 10\\n\\n }\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 86,\n \"score\": 124863.43876044312\n },\n {\n \"content\": \"#[test]\\n\\nfn oid_as_hex_string() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n\\n\\n #[derive(Serialize)]\\n\\n struct Foo {\\n\\n #[serde(serialize_with = \\\"serialize_object_id_as_hex_string\\\")]\\n\\n oid: ObjectId,\\n\\n }\\n\\n\\n\\n let oid = ObjectId::new();\\n\\n let foo = Foo { oid };\\n\\n let doc = to_document(&foo).unwrap();\\n\\n assert_eq!(doc.get_str(\\\"oid\\\").unwrap(), oid.to_hex());\\n\\n}\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 87,\n \"score\": 124845.49178601397\n },\n {\n \"content\": \"#[test]\\n\\nfn rawdoc_to_doc() {\\n\\n let docbytes = to_bytes(&doc! {\\n\\n \\\"f64\\\": 2.5,\\n\\n \\\"string\\\": \\\"hello\\\",\\n\\n \\\"document\\\": {},\\n\\n \\\"array\\\": [\\\"binary\\\", \\\"serialized\\\", \\\"object\\\", \\\"notation\\\"],\\n\\n \\\"binary\\\": Binary { subtype: BinarySubtype::Generic, bytes: vec![1, 2, 3] },\\n\\n \\\"object_id\\\": ObjectId::from_bytes([1, 2, 3, 4, 5,6,7,8,9,10, 11,12]),\\n\\n \\\"boolean\\\": true,\\n\\n \\\"datetime\\\": DateTime::now(),\\n\\n \\\"null\\\": Bson::Null,\\n\\n \\\"regex\\\": Bson::RegularExpression(Regex { pattern: String::from(r\\\"end\\\\s*$\\\"), options: String::from(\\\"i\\\")}),\\n\\n \\\"javascript\\\": Bson::JavaScriptCode(String::from(\\\"console.log(console);\\\")),\\n\\n \\\"symbol\\\": Bson::Symbol(String::from(\\\"artist-formerly-known-as\\\")),\\n\\n \\\"javascript_with_scope\\\": Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope{ code: String::from(\\\"console.log(msg);\\\"), scope: doc!{\\\"ok\\\": true}}),\\n\\n \\\"int32\\\": 23i32,\\n\\n \\\"timestamp\\\": Bson::Timestamp(Timestamp { time: 3542578, increment: 0 }),\\n\\n \\\"int64\\\": 46i64,\\n\\n \\\"end\\\": \\\"END\\\",\\n\\n });\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 88,\n \"score\": 123551.73637462893\n },\n {\n \"content\": \"#[test]\\n\\nfn object_id() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"object_id\\\": ObjectId::from_bytes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]),\\n\\n })\\n\\n .unwrap();\\n\\n let oid = rawdoc\\n\\n .get(\\\"object_id\\\")\\n\\n .expect(\\\"error finding key object_id\\\")\\n\\n .expect(\\\"no key object_id\\\")\\n\\n .as_object_id()\\n\\n .expect(\\\"result was not an object id\\\");\\n\\n assert_eq!(oid.to_hex(), \\\"0102030405060708090a0b0c\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 89,\n \"score\": 123551.73637462893\n },\n {\n \"content\": \"#[test]\\n\\nfn javascript_with_scope() {\\n\\n let rawdoc = RawDocumentBuf::from_document(&doc! {\\n\\n \\\"javascript_with_scope\\\": Bson::JavaScriptCodeWithScope(JavaScriptCodeWithScope {\\n\\n code: String::from(\\\"console.log(msg);\\\"),\\n\\n scope: doc! { \\\"ok\\\": true }\\n\\n }),\\n\\n })\\n\\n .unwrap();\\n\\n let js_with_scope = rawdoc\\n\\n .get(\\\"javascript_with_scope\\\")\\n\\n .expect(\\\"error finding key javascript_with_scope\\\")\\n\\n .expect(\\\"no key javascript_with_scope\\\")\\n\\n .as_javascript_with_scope()\\n\\n .expect(\\\"was not javascript with scope\\\");\\n\\n assert_eq!(js_with_scope.code(), \\\"console.log(msg);\\\");\\n\\n let (scope_key, scope_value_bson) = js_with_scope\\n\\n .scope()\\n\\n .into_iter()\\n\\n .next()\\n\\n .expect(\\\"no next value in scope\\\")\\n\\n .expect(\\\"invalid element\\\");\\n\\n assert_eq!(scope_key, \\\"ok\\\");\\n\\n let scope_value = scope_value_bson.as_bool().expect(\\\"not a boolean\\\");\\n\\n assert!(scope_value);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/raw/test/mod.rs\",\n \"rank\": 90,\n \"score\": 123551.73637462893\n },\n {\n \"content\": \"#[test]\\n\\nfn byte_string_oid() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let s = \\\"541b1a00e8a23afa832b218e\\\";\\n\\n let oid_res = ObjectId::parse_str(s);\\n\\n assert!(oid_res.is_ok());\\n\\n let oid = oid_res.unwrap();\\n\\n let bytes: [u8; 12] = [\\n\\n 0x54u8, 0x1Bu8, 0x1Au8, 0x00u8, 0xE8u8, 0xA2u8, 0x3Au8, 0xFAu8, 0x83u8, 0x2Bu8, 0x21u8,\\n\\n 0x8Eu8,\\n\\n ];\\n\\n\\n\\n assert_eq!(bytes, oid.bytes());\\n\\n assert_eq!(s, oid.to_string());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/oid.rs\",\n \"rank\": 91,\n \"score\": 122193.03718921932\n },\n {\n \"content\": \"#[test]\\n\\nfn test_de_oid_string() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n\\n\\n #[derive(Debug, Deserialize)]\\n\\n struct Foo {\\n\\n pub oid: ObjectId,\\n\\n }\\n\\n\\n\\n let foo: Foo = serde_json::from_str(\\\"{ \\\\\\\"oid\\\\\\\": \\\\\\\"507f1f77bcf86cd799439011\\\\\\\" }\\\").unwrap();\\n\\n let oid = ObjectId::parse_str(\\\"507f1f77bcf86cd799439011\\\").unwrap();\\n\\n assert_eq!(foo.oid, oid);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 92,\n \"score\": 120890.73235071982\n },\n {\n \"content\": \"#[test]\\n\\nfn test_binary_generic_roundtrip() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n #[derive(Serialize, Deserialize, Debug, PartialEq)]\\n\\n pub struct Foo {\\n\\n data: Bson,\\n\\n }\\n\\n\\n\\n let x = Foo {\\n\\n data: Bson::Binary(Binary {\\n\\n subtype: BinarySubtype::Generic,\\n\\n bytes: b\\\"12345abcde\\\".to_vec(),\\n\\n }),\\n\\n };\\n\\n\\n\\n let b = to_bson(&x).unwrap();\\n\\n assert_eq!(\\n\\n b.as_document().unwrap(),\\n\\n &doc! {\\\"data\\\": Bson::Binary(Binary { subtype: BinarySubtype::Generic, bytes: b\\\"12345abcde\\\".to_vec() })}\\n\\n );\\n\\n\\n\\n let f = from_bson::<Foo>(b).unwrap();\\n\\n assert_eq!(x, f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 93,\n \"score\": 120844.47438501054\n },\n {\n \"content\": \"#[test]\\n\\nfn cstring_null_bytes_error() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n\\n\\n let doc = doc! { \\\"\\\\0\\\": \\\"a\\\" };\\n\\n verify_doc(doc);\\n\\n\\n\\n let doc = doc! { \\\"a\\\": { \\\"\\\\0\\\": \\\"b\\\" } };\\n\\n verify_doc(doc);\\n\\n\\n\\n let regex = doc! { \\\"regex\\\": Regex { pattern: \\\"\\\\0\\\".into(), options: \\\"a\\\".into() } };\\n\\n verify_doc(regex);\\n\\n\\n\\n let regex = doc! { \\\"regex\\\": Regex { pattern: \\\"a\\\".into(), options: \\\"\\\\0\\\".into() } };\\n\\n verify_doc(regex);\\n\\n\\n\\n fn verify_doc(doc: Document) {\\n\\n let mut vec = Vec::new();\\n\\n assert!(matches!(\\n\\n doc.to_writer(&mut vec).unwrap_err(),\\n\\n ser::Error::InvalidCString(_)\\n\\n ));\\n\\n assert!(matches!(\\n\\n to_vec(&doc).unwrap_err(),\\n\\n ser::Error::InvalidCString(_)\\n\\n ));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tests/modules/ser.rs\",\n \"rank\": 94,\n \"score\": 118405.92598838717\n },\n {\n \"content\": \"#[test]\\n\\nfn test_illegal_size() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n let buffer = [\\n\\n 0x06, 0xcc, 0xf9, 0x0a, 0x05, 0x00, 0x00, 0x03, 0x00, 0xff, 0xff,\\n\\n ];\\n\\n assert!(Document::from_reader(&mut Cursor::new(&buffer[..])).is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/serializer_deserializer.rs\",\n \"rank\": 95,\n \"score\": 118235.35188894108\n },\n {\n \"content\": \"#[test]\\n\\nfn test_display_regex_type() {\\n\\n let x = Regex {\\n\\n pattern: String::from(\\\"pattern\\\"),\\n\\n options: String::from(\\\"options\\\"),\\n\\n };\\n\\n let output = \\\"/pattern/options\\\";\\n\\n assert_eq!(format!(\\\"{}\\\", x), output);\\n\\n assert_eq!(format!(\\\"{}\\\", Bson::from(x)), output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/bson.rs\",\n \"rank\": 96,\n \"score\": 117931.68432646662\n },\n {\n \"content\": \"#[test]\\n\\nfn test_display_timestamp_type() {\\n\\n let x = Timestamp {\\n\\n time: 100,\\n\\n increment: 200,\\n\\n };\\n\\n let output = \\\"Timestamp(100, 200)\\\";\\n\\n assert_eq!(format!(\\\"{}\\\", x), output);\\n\\n assert_eq!(format!(\\\"{}\\\", Bson::from(x)), output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/bson.rs\",\n \"rank\": 97,\n \"score\": 117898.33767985336\n },\n {\n \"content\": \"#[test]\\n\\nfn test_display_binary_type() {\\n\\n let encoded_bytes = \\\"aGVsbG8gd29ybGQ=\\\";\\n\\n let bytes = base64::decode(encoded_bytes).unwrap();\\n\\n let x = Binary {\\n\\n subtype: BinarySubtype::Generic,\\n\\n bytes,\\n\\n };\\n\\n let output = format!(\\\"Binary(0x0, {})\\\", encoded_bytes);\\n\\n assert_eq!(format!(\\\"{}\\\", x), output);\\n\\n assert_eq!(format!(\\\"{}\\\", Bson::from(x)), output);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/modules/bson.rs\",\n \"rank\": 98,\n \"score\": 117837.12014941969\n },\n {\n \"content\": \"#[test]\\n\\nfn test_binary_non_generic_roundtrip() {\\n\\n let _guard = LOCK.run_concurrently();\\n\\n #[derive(Serialize, Deserialize, Debug, PartialEq)]\\n\\n pub struct Foo {\\n\\n data: Bson,\\n\\n }\\n\\n\\n\\n let x = Foo {\\n\\n data: Bson::Binary(Binary {\\n\\n subtype: BinarySubtype::BinaryOld,\\n\\n bytes: b\\\"12345abcde\\\".to_vec(),\\n\\n }),\\n\\n };\\n\\n\\n\\n let b = to_bson(&x).unwrap();\\n\\n assert_eq!(\\n\\n b.as_document().unwrap(),\\n\\n &doc! {\\\"data\\\": Bson::Binary(Binary { subtype: BinarySubtype::BinaryOld, bytes: b\\\"12345abcde\\\".to_vec() })}\\n\\n );\\n\\n\\n\\n let f = from_bson::<Foo>(b).unwrap();\\n\\n assert_eq!(x, f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/serde.rs\",\n \"rank\": 99,\n \"score\": 117179.02244856826\n }\n]","isConversational":false}}},{"rowIdx":1998,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/shared/crossterm.rs"},"repo_name":{"kind":"string","value":"jojolepro/crossterm"},"commit":{"kind":"string","value":"f4d2ab4feb520e687540e8917793f4fb32f0fe34"},"file_code":{"kind":"string","value":"\n\nuse super::super::cursor;\nuse super::super::style;\nuse super::super::terminal::terminal;\nuse Context;\n\nuse std::fmt::Display;\nuse std::mem;\nuse std::rc::Rc;\nuse std::sync::Arc;\nuse std::convert::From;\n\npub struct Crossterm {\n context: Rc<Context>\n}\n\nimpl From<Rc<Context>> for Crossterm\n{\n fn from(context: Rc<Context>) -> Self {\n return Crossterm {\n context: context\n }\n }\n}\n\nimpl Crossterm {\n pub fn new() -> Crossterm {\n return Crossterm { context: Context::new() };\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn terminal(&self) -> terminal::Terminal\n {\n return terminal::Terminal::new(self.context.clone());\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn cursor(&self) -> cursor::TerminalCursor\n {\n return cursor::TerminalCursor::new(self.context.clone())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn color(&self) -> style::TerminalColor\n {\n return style::TerminalColor::new(self.context.clone());\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 paint<'a, D: Display>(&'a self, value: D) -> style::StyledObject<D> {\n self.terminal().paint(value)\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn write<D: Display>(&self, value: D)\n {\n self.terminal().write(value)\n }\n\n \n pub fn context(&self) -> Rc<Context> {\n self.context.clone()\n }\n}"},"prefix":{"kind":"string","value":"\n\nuse super::super::cursor;\nuse super::super::style;\nuse super::super::terminal::terminal;\nuse Context;\n\nuse std::fmt::Display;\nuse std::mem;\nuse std::rc::Rc;\nuse std::sync::Arc;\nuse std::convert::From;\n\npub struct Crossterm {\n context: Rc<Context>\n}\n\nimpl From<Rc<Context>> for Crossterm\n{\n fn from(context: Rc<Context>) -> Self {\n return Crossterm {\n context: context\n }\n }\n}\n\nimpl Crossterm {\n pub fn new() -> Crossterm {\n return Crossterm { context: Context::new() };\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn terminal(&self) -> terminal::Terminal\n {\n return terminal::Terminal::new(self.context.clone());\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn cursor(&self) -> cursor::TerminalCursor\n {\n return cursor::TerminalCursor::new(self.context.clone())\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn color(&self) -> style::TerminalColor\n {\n return style::TerminalColor::new(self.context.clone());\n "},"suffix":{"kind":"string","value":" paint<'a, D: Display>(&'a self, value: D) -> style::StyledObject<D> {\n self.terminal().paint(value)\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn write<D: Display>(&self, value: D)\n {\n self.terminal().write(value)\n }\n\n \n pub fn context(&self) -> Rc<Context> {\n self.context.clone()\n }\n}"},"middle":{"kind":"string","value":" }\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"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// print wait screen on alternate screen, then swich back.\n\npub fn print_wait_screen_on_alternate_window(context: Rc<Context>) {\n\n // create scope. If this scope ends the screen will be switched back to mainscreen.\n\n // because `AlternateScreen` switches back to main screen when switching back.\n\n {\n\n // create new alternate screen instance and switch to the alternate screen.\n\n let mut screen = AlternateScreen::from(context.clone());\n\n\n\n write!(screen, \"test\");\n\n println!();\n\n // Print the wait screen.\n\n print_wait_screen(context.clone());\n\n }\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/alternate_screen.rs","rank":0,"score":193786.54031265096},{"content":"/// paint text with colors using `Crossterm` | demonstration.\n\npub fn use_crossterm_paint()\n\n{\n\n let crossterm = Crossterm::new();\n\n crossterm.paint(\"Black on BLUE\").with(Color::Black).on(Color::Blue);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/crossterm_type/mod.rs","rank":1,"score":179534.8036702217},{"content":"/// write text to terminal using `Crossterm` | demonstration.\n\npub fn use_crossterm_write()\n\n{\n\n let crossterm = Crossterm::new();\n\n crossterm.write(\"some text \\nsome text on new line\");\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/crossterm_type/mod.rs","rank":2,"score":179534.80367022177},{"content":"/// use the `Crossterm` to get an instance to the terminal module | demonstration.\n\npub fn use_crossterm_terminal()\n\n{\n\n let crossterm = Crossterm::new();\n\n let mut terminal = crossterm.terminal();\n\n terminal.clear(ClearType::All);\n\n terminal.set_size(40,40);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/crossterm_type/mod.rs","rank":3,"score":179534.70097085967},{"content":"/// use the `Crossterm` to get an instance to the color module | demonstration.\n\npub fn use_crossterm_color()\n\n{\n\n let crossterm = Crossterm::new();\n\n let mut color = crossterm.color();\n\n color.set_bg(Color::Red);\n\n color.set_fg(Color::Green);\n\n}\n\n\n\nuse crossterm::terminal::ClearType;\n\n\n","file_path":"examples/Crossterm 0.3.0/crossterm_type/mod.rs","rank":4,"score":179534.70097085967},{"content":"/// use the `Crossterm` to get an instance to the cursor module | demonstration.\n\npub fn use_crossterm_cursor()\n\n{\n\n let crossterm = Crossterm::new();\n\n let mut cursor = crossterm.cursor();\n\n cursor.goto(5,5).print(\"test\");\n\n}\n\n\n\nuse crossterm::style::Color;\n\n\n","file_path":"examples/Crossterm 0.3.0/crossterm_type/mod.rs","rank":5,"score":179534.70097085962},{"content":"/// Clear all lines from cursor position X:4, Y:7 up | demonstration\n\npub fn clear_until_new_line()\n\n{\n\n let term = Terminal::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n cursor::cursor(&term).goto(4,20);\n\n\n\n // Clear all the cells until next line.\n\n terminal.clear(ClearType::UntilNewLine);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":6,"score":170100.841729499},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_until_new_line()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,4);\n\n\n\n // Clear all the cells until next line.\n\n terminal.clear(ClearType::UntilNewLine);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":7,"score":170100.841729499},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_until_new_line()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,7);\n\n\n\n // Clear all the cells until next line.\n\n terminal.clear(ClearType::UntilNewLine);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":8,"score":170100.841729499},{"content":"/// Clear all lines from cursor position X:4, Y:7 up | demonstration\n\npub fn clear_until_new_line() {\n\n let context = Context::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n cursor::cursor(&context).goto(4, 20);\n\n\n\n // Clear all the cells until next line.\n\n terminal.clear(ClearType::UntilNewLine);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":9,"score":170100.841729499},{"content":"/// Get an Terminal implementation whereon terminal related actions can be performed.\n\n///\n\n/// Check `/examples/version/terminal` in the libary for more spesific examples.\n\n///\n\n/// #Example\n\n///\n\n/// ```rust\n\n///\n\n/// extern crate crossterm;\n\n/// use crossterm::terminal;\n\n/// use crossterm::Context;\n\n///\n\n/// let context = Context::new();\n\n///\n\n/// let mut term = terminal::terminal(&context);\n\n///\n\n/// // scroll down by 5 lines\n\n/// let size = term.scroll_down(5);\n\n///\n\n/// ```\n\n///\n\npub fn terminal(context: &Rc<Context>) -> Box<Terminal> {\n\n Box::from(Terminal::new(context.clone()))\n\n}\n","file_path":"src/terminal/terminal.rs","rank":10,"score":169013.39993971726},{"content":"/// Get an TerminalCursor implementation whereon cursor related actions can be performed.\n\n///\n\n/// Check `/examples/version/cursor` in the libary for more spesific examples.\n\n///\n\n/// #Example\n\n///\n\n/// ```rust\n\n///\n\n/// extern crate crossterm;\n\n/// use self::crossterm::Context;\n\n/// use self::crossterm::cursor;\n\n///\n\n/// let context = Context::new();\n\n///\n\n/// // Get cursor and goto pos X: 5, Y: 10\n\n/// let mut cursor = cursor::cursor(&context);\n\n/// cursor.goto(5,10);\n\n///\n\n/// cursor.show();\n\n/// cursor.hide();\n\n/// cursor.blink();\n\n/// cursor.move_left(2);\n\n///\n\n/// //Or you can do it in one line.\n\n/// cursor::cursor(&context).goto(5,10);\n\n///\n\n/// ```\n\npub fn cursor(context: &Rc<Context>) -> Box<TerminalCursor> {\n\n Box::from(TerminalCursor::new(context.clone()))\n\n}","file_path":"src/cursor/cursor.rs","rank":11,"score":166953.56663885867},{"content":"/// Get an Color implementation whereon color related actions can be performed.\n\n///\n\n/// Check `/examples/version/color` in the library for more specific examples.\n\n///\n\npub fn color(context: &Rc<Context>) -> Box<TerminalColor> {\n\n Box::from(TerminalColor::new(context.clone()))\n\n}\n","file_path":"src/style/color/color.rs","rank":12,"score":164957.33622092637},{"content":"/// Get the current cursor position.\n\npub fn pos(context: Rc<Context>) -> (u16, u16) {\n\n use std::io::{Read, Write};\n\n\n\n let mut command_id = NoncanonicalModeCommand::new(&context.state_manager);\n\n\n\n CommandManager::execute(context.clone(), command_id);\n\n\n\n // This code is original written by term_cursor credits to them.\n\n use std::io;\n\n let mut std = io::stdout();\n\n // Write command\n\n std.write(b\"\\x1B[6n\");\n\n std.flush();\n\n\n\n // Read back result\n\n let mut buf = [0u8; 2];\n\n // Expect `ESC[`\n\n io::stdin().read_exact(&mut buf);\n\n if buf[0] != 0x1B || buf[1] as char != '[' {\n\n return (0, 0);\n","file_path":"src/kernel/unix_kernel/terminal.rs","rank":13,"score":164957.33622092637},{"content":"/// Get the cursor position based on the current platform.\n\npub fn get_cursor_position(context: Rc<Context>) -> (u16, u16) {\n\n #[cfg(unix)]\n\n return pos(context.clone());\n\n\n\n #[cfg(windows)]\n\n return pos(&context.screen_manager);\n\n}\n\n\n","file_path":"src/shared/functions.rs","rank":14,"score":164957.33622092637},{"content":"pub fn clear_entire_screen(csbi: CONSOLE_SCREEN_BUFFER_INFO, context: &Rc<Context>) {\n\n // position x at start\n\n let x = 0;\n\n // position y at start\n\n let y = 0;\n\n\n\n // location where to start clearing\n\n let start_location = COORD {\n\n X: x as i16,\n\n Y: y as i16,\n\n };\n\n // get sum cells before cursor\n\n\n\n let cells_to_write = csbi.dwSize.X as u32 * csbi.dwSize.Y as u32;\n\n\n\n clear(start_location, cells_to_write, &context.screen_manager);\n\n\n\n // put the cursor back at (0, 0)\n\n cursor(&context).goto(0, 0);\n\n}\n\n\n","file_path":"src/terminal/winapi_terminal.rs","rank":15,"score":157775.24047435226},{"content":"fn print_wait_screen(context: Rc<Context>) {\n\n let mut terminal = terminal::terminal(&context);\n\n terminal.clear(ClearType::All);\n\n\n\n let mut cursor = cursor(&context);\n\n cursor.goto(0, 0);\n\n cursor.hide();\n\n\n\n terminal.write(\n\n \"Welcome to the wait screen.\\n\\\n\n Please wait a few seconds until we arrive back at the main screen.\\n\\\n\n Progress: \",\n\n );\n\n\n\n // print some progress example.\n\n for i in 1..5 {\n\n // print the current counter at the line of `Seconds to Go: {counter}`\n\n cursor\n\n .goto(10, 2)\n\n .print(terminal.paint(format!(\"{} of the 5 items processed\", i)).with(Color::Red).on(Color::Blue));\n\n\n\n // 1 second delay\n\n thread::sleep(time::Duration::from_secs(1));\n\n }\n\n\n\n stdout().flush();\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/alternate_screen.rs","rank":16,"score":154654.17910188844},{"content":"// raw screen is not working correctly currently\n\nfn print_wait_screen(context: Rc<Context>) {\n\n terminal::terminal(&context).clear(ClearType::All);\n\n\n\n let mut cursor = cursor(&context);\n\n cursor.goto(0, 0).print(\"Welcome to the wait screen.\");\n\n cursor\n\n .goto(0, 1)\n\n .print(\"Please wait a few seconds until we arrive back at the main screen.\");\n\n cursor.goto(0, 2).print(\"Progress: \");\n\n\n\n // print some progress example.\n\n for i in 1..5 {\n\n // print the current counter at the line of `Seconds to Go: {counter}`\n\n cursor\n\n .goto(10, 2)\n\n .print(format!(\"{} of the 5 items processed\", i));\n\n\n\n // 1 second delay\n\n thread::sleep(time::Duration::from_secs(1));\n\n }\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/raw_mode.rs","rank":17,"score":154654.17910188844},{"content":"pub fn clear_until_line(pos: (u16, u16), csbi: CONSOLE_SCREEN_BUFFER_INFO, context: &Rc<Context>) {\n\n let (x, y) = pos;\n\n\n\n // location where to start clearing\n\n let start_location = COORD {\n\n X: x as i16,\n\n Y: y as i16,\n\n };\n\n // get sum cells before cursor\n\n let cells_to_write = (csbi.dwSize.X - x as i16) as u32;\n\n\n\n clear(start_location, cells_to_write, &context.screen_manager);\n\n\n\n // put the cursor back at original cursor position\n\n cursor(&context).goto(x, y);\n\n}\n\n\n","file_path":"src/terminal/winapi_terminal.rs","rank":18,"score":148312.54421712674},{"content":"/// Switch to alternate screen using the `Context` of `Crossterm` | demonstration.\n\npub fn create_alternate_screen_from_crossterm()\n\n{\n\n use crossterm::screen::*;\n\n use std::convert::From;\n\n\n\n let crossterm = Crossterm::new();\n\n\n\n {\n\n // move into alternate screen\n\n let alternate_screen = AlternateScreen::from(crossterm.context());\n\n\n\n // this will move the cursor and print `some text` on the alternate screen.\n\n crossterm.cursor().goto(10, 10).print(\"Some text\");\n\n } // <- alternate screen ends here an will be switched back to main screen.\n\n\n\n // print \"Some other text\" on the mainscreen at x: 0, y: 10\n\n crossterm.cursor().goto(0,10).print(\"Some other text\");\n\n}","file_path":"examples/Crossterm 0.3.0/crossterm_type/mod.rs","rank":19,"score":143152.625381494},{"content":"/// Move the cursor 3 up | demonstration.\n\npub fn move_up() {\n\n let context = Context::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n\n\n // Move the cursor to position 3 times to the up in the terminal\n\n cursor.move_up(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":20,"score":139874.44869152125},{"content":"/// Scroll down 10 lines | demonstration.\n\npub fn scroll_up()\n\n{\n\n let term = Terminal::new();\n\n\n\n print_test_data();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n // Scroll up 10 lines.\n\n terminal.scroll_up(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":21,"score":139874.44869152122},{"content":"// scroll down 10 lines\n\npub fn scroll_up()\n\n{\n\n print_test_data();\n\n \n\n // Get terminal \n\n let mut terminal = get();\n\n // Scroll up 10 lines.\n\n terminal.scroll_up(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":22,"score":139874.44869152125},{"content":"/// Move the cursor 3 down | demonstration.\n\npub fn move_down()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the down in the terminal\n\n cursor.move_down(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":23,"score":139874.44869152122},{"content":"/// Scroll down 10 lines | demonstration.\n\npub fn scroll_down() {\n\n let context = Context::new();\n\n\n\n print_test_data();\n\n\n\n\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n // Scroll down 10 lines.\n\n terminal.scroll_down(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":24,"score":139874.44869152122},{"content":"/// Move the cursor 3 up | demonstration.\n\npub fn move_up()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the up in the terminal\n\n cursor.move_up(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/cursor/mod.rs","rank":25,"score":139874.44869152122},{"content":"/// Set the cursor to position X: 10, Y: 5 in the terminal.\n\npub fn goto() {\n\n let context = Context::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10, 5);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":26,"score":139874.44869152125},{"content":"/// Print character at X: 10 Y: 5 | demonstration.\n\npub fn print()\n\n{\n\n // To print an some displayable content on an certain position. \n\n \n\n // Get the cursor\n\n let mut cursor = get();\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10,5);\n\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\n\n print!(\"@\");\n\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first. \n\n use std;\n\n use std::io::Write;\n\n std::io::stdout().flush();\n\n \n\n /* Because the above method is a little to mutch code, \n\n you can use the `print()` method for printing an value at an certain position in the terminal.\n\n \n\n Crossterm provides method chaining so that the above points can be inlined.\n\n */\n","file_path":"examples/Crossterm 0.1.0/cursor/mod.rs","rank":27,"score":139874.44869152122},{"content":"/// Move the cursor 3 up | demonstration.\n\npub fn move_up()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the up in the terminal\n\n cursor.move_up(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":28,"score":139874.44869152122},{"content":"// scroll down 10 lines\n\npub fn scroll_down()\n\n{\n\n print_test_data();\n\n // Get terminal \n\n let mut terminal = get();\n\n // Scroll down 10 lines.\n\n let terminal_size = terminal.scroll_down(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":29,"score":139874.44869152125},{"content":"/// Set the cursor to position X: 10, Y: 5 in the terminal.\n\npub fn goto()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10,5); \n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":30,"score":139874.44869152125},{"content":"/// Scroll down 10 lines | demonstration.\n\npub fn scroll_up() {\n\n let context = Context::new();\n\n\n\n print_test_data();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n // Scroll up 10 lines.\n\n terminal.scroll_up(5);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":31,"score":139874.44869152122},{"content":"/// exit the current proccess.\n\npub fn exit() {\n\n let context = Context::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n // Get terminal size\n\n terminal.exit();\n\n}\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":32,"score":139874.44869152122},{"content":"/// get the cursor position\n\npub fn pos() {\n\n let context = Context::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // get the cursor position.\n\n let (x, y) = cursor.pos();\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":33,"score":139874.44869152125},{"content":"/// Scroll down 10 lines | demonstration.\n\npub fn scroll_down()\n\n{\n\n let term = Terminal::new();\n\n\n\n print_test_data();\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n // Scroll down 10 lines.\n\n terminal.scroll_down(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":34,"score":139874.44869152122},{"content":"/// Set the cursor to position X: 10, Y: 5 in the terminal.\n\npub fn goto()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10,5); \n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/cursor/mod.rs","rank":35,"score":139874.44869152125},{"content":"/// Move the cursor 3 down | demonstration.\n\npub fn move_down()\n\n{\n\n let context = Terminal::new();\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the down in the terminal\n\n cursor.move_down(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":36,"score":139874.44869152122},{"content":"/// Print character at X: 10 Y: 5 | demonstration.\n\npub fn print()\n\n{\n\n // To print an some displayable content on an certain position. \n\n \n\n // Get the cursor\n\n let mut cursor = get();\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10,5);\n\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\n\n print!(\"@\");\n\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first. \n\n use std;\n\n use std::io::Write;\n\n std::io::stdout().flush();\n\n \n\n /* Because the above method is a little to mutch code, \n\n you can use the `print()` method for printing an value at an certain position in the terminal.\n\n \n\n Crossterm provides method chaining so that the above points can be inlined.\n\n */\n\n \n\n get().goto(10,5).print(\"@\"); \n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":37,"score":139874.44869152122},{"content":"/// Print character at X: 10 Y: 5 | demonstration.\n\npub fn print() {\n\n let context = Context::new();\n\n\n\n // To print an some displayable content on an certain position.\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10, 5);\n\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\n\n print!(\"@\");\n\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first.\n\n use std;\n\n use std::io::Write;\n\n std::io::stdout().flush();\n\n\n\n /* Because the above method is a little to much code,\n\n you can use the `print()` method for printing an value at an certain position in the terminal.\n\n \n\n Crossterm provides method chaining so that the above points can be inlined.\n\n */\n\n\n\n cursor.goto(10, 5).print(\"@\");\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":38,"score":139874.44869152125},{"content":"/// Print character at X: 10 Y: 5 | demonstration.\n\npub fn print()\n\n{\n\n let context = Terminal::new();\n\n // To print an some displayable content on an certain position. \n\n \n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10,5);\n\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\n\n print!(\"@\");\n\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first. \n\n use std;\n\n use std::io::Write;\n\n std::io::stdout().flush();\n\n \n\n /* Because the above method is a little to much code,\n\n you can use the `print()` method for printing an value at an certain position in the terminal.\n\n \n\n Crossterm provides method chaining so that the above points can be inlined.\n\n */\n\n\n\n cursor.goto(10,5).print(\"@\");\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":39,"score":139874.44869152122},{"content":"/// Set the cursor to position X: 10, Y: 5 in the terminal.\n\npub fn goto()\n\n{\n\n let context = Terminal::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Set the cursor to position X: 10, Y: 5 in the terminal\n\n cursor.goto(10,5); \n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":40,"score":139874.44869152125},{"content":"/// Move the cursor 3 up | demonstration.\n\npub fn move_up()\n\n{\n\n let context = Terminal::new();\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the up in the terminal\n\n cursor.move_up(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":41,"score":139874.44869152122},{"content":"// scroll down 10 lines\n\npub fn scroll_up()\n\n{\n\n print_test_data();\n\n \n\n // Get terminal \n\n let mut terminal = get();\n\n // Scroll up 10 lines.\n\n let terminal_size = terminal.scroll_up(10);\n\n}\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":42,"score":139874.44869152125},{"content":"/// Move the cursor 3 down | demonstration.\n\npub fn move_down() {\n\n let context = Context::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the down in the terminal\n\n cursor.move_down(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":43,"score":139874.44869152125},{"content":"/// Move the cursor 3 down | demonstration.\n\npub fn move_down()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the down in the terminal\n\n cursor.move_down(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/cursor/mod.rs","rank":44,"score":139874.44869152122},{"content":"// scroll down 10 lines\n\npub fn scroll_down()\n\n{\n\n print_test_data();\n\n // Get terminal \n\n let mut terminal = get();\n\n // Scroll down 10 lines.\n\n terminal.scroll_down(10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":45,"score":139874.44869152125},{"content":"/// Move the cursor 3 to the right | demonstration.\n\npub fn move_right()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the right in the terminal\n\n cursor.move_right(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":46,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_from_cursor_up()\n\n{\n\n let term = Terminal::new();\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n cursor::cursor(&term).goto(4,4);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorUp);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":47,"score":137296.35814801208},{"content":"/// Resize the terminal to X: 10, Y: 10 | demonstration.\n\npub fn resize_terminal() {\n\n let context = Context::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n\n\n // Get terminal size\n\n terminal.set_size(10, 10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":48,"score":137296.35814801208},{"content":"/// Clear all lines in terminal | demonstration\n\npub fn clear_all_lines() {\n\n let context = Context::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n\n\n print_test_data();\n\n\n\n // Clear all lines in terminal;\n\n terminal.clear(ClearType::All);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":49,"score":137296.35814801208},{"content":"/// print some red font | demonstration.\n\npub fn paint_foreground()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red font\");\n\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\n\n styledobject = styledobject.with(Color::Red);\n\n // Print the object to the console and see the result. \n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red font\").with(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":50,"score":137296.35814801208},{"content":"// Resize the terminal to X: 10, Y: 10\n\npub fn resize_terminal()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n // Get terminal size\n\n terminal.set_size(1,1);\n\n}\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":51,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the right | demonstration.\n\npub fn move_right()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the right in the terminal\n\n cursor.move_right(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/cursor/mod.rs","rank":52,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the right | demonstration.\n\npub fn move_right()\n\n{\n\n let context = Terminal::new();\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the right in the terminal\n\n cursor.move_right(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":53,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_from_cursor_up()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,8);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorUp);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":54,"score":137296.35814801208},{"content":"/// print some font on red background | demonstration.\n\npub fn paint_background() {\n\n let context = Context::new();\n\n let terminal = terminal::terminal(&context);\n\n\n\n // Pass an string to the `paint()` method with you want to paint.\n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = terminal.paint(\"Red background color\");\n\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\n\n styledobject = styledobject.on(Color::Red);\n\n // Print the object to the console and check see the result\n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", terminal.paint(\"Red background color\").on(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/color/mod.rs","rank":55,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_from_cursor_up()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,8);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorUp);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":56,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\n\npub fn clear_from_cursor_down()\n\n{\n\n let term = Terminal::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n cursor::cursor(&term).goto(4,8);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorDown);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":57,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\n\npub fn clear_from_cursor_down()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,8);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorDown);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":58,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\n\npub fn clear_from_cursor_down() {\n\n let context = Context::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n cursor::cursor(&context).goto(4, 8);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorDown);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":59,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\n\npub fn clear_from_cursor_down()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,8);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorDown);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":60,"score":137296.35814801208},{"content":"/// print some font on red background | demonstration.\n\npub fn paint_background()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red background color\");\n\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\n\n styledobject = styledobject.on(Color::Red);\n\n // Print the object to the console and check see the result \n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red background color\").on(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":61,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the left | demonstration.\n\npub fn move_left() {\n\n let context = Context::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the left in the terminal\n\n cursor.move_left(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":62,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the left | demonstration.\n\npub fn move_left()\n\n{\n\n let context = Terminal::new();\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the left in the terminal\n\n cursor.move_left(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":63,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the left | demonstration.\n\npub fn move_left()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the left in the terminal\n\n cursor.move_left(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":64,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the left | demonstration.\n\npub fn move_left()\n\n{\n\n // Get the cursor\n\n let mut cursor = get();\n\n // Move the cursor to position 3 times to the left in the terminal\n\n cursor.move_left(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/cursor/mod.rs","rank":65,"score":137296.35814801208},{"content":"/// Clear all lines in terminal | demonstration\n\npub fn clear_all_lines()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n \n\n print_test_data();\n\n \n\n // Clear all lines in terminal;\n\n terminal.clear(ClearType::All);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":66,"score":137296.35814801208},{"content":"/// Hide cursor display | demonstration.\n\npub fn hide_cursor() {\n\n let context = Context::new();\n\n\n\n let cursor = cursor(&context);\n\n cursor.hide();\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":67,"score":137296.35814801208},{"content":"/// Resize the terminal to X: 10, Y: 10 | demonstration.\n\npub fn resize_terminal()\n\n{\n\n let term = Terminal::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n // Get terminal size\n\n terminal.set_size(10,10);\n\n}\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":68,"score":137296.35814801208},{"content":"/// Move the cursor 3 to the right | demonstration.\n\npub fn move_right() {\n\n let context = Context::new();\n\n\n\n // Get the cursor\n\n let mut cursor = cursor(&context);\n\n // Move the cursor to position 3 times to the right in the terminal\n\n cursor.move_right(3);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":69,"score":137296.35814801208},{"content":"/// Show cursor display | demonstration.\n\npub fn show_cursor() {\n\n let context = Context::new();\n\n\n\n let cursor = cursor(&context);\n\n cursor.show();\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":70,"score":137296.35814801208},{"content":"/// print some red font | demonstration.\n\npub fn paint_foreground() {\n\n let context = Context::new();\n\n let terminal = terminal::terminal(&context);\n\n\n\n // Pass an string to the `paint()` method with you want to paint.\n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = terminal.paint(\"Red font\");\n\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\n\n styledobject = styledobject.with(Color::Red);\n\n // Print the object to the console and see the result.\n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", terminal.paint(\"Red font\").with(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/color/mod.rs","rank":71,"score":137296.35814801208},{"content":"/// print some red font | demonstration.\n\npub fn paint_foreground()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red font\");\n\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\n\n styledobject = styledobject.with(Color::Red);\n\n // Print the object to the console and see the result. \n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red font\").with(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/color/mod.rs","rank":72,"score":137296.35814801208},{"content":"/// print some font on red background | demonstration.\n\npub fn paint_background()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red background color\");\n\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\n\n styledobject = styledobject.on(Color::Red);\n\n // Print the object to the console and check see the result \n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red background color\").on(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":73,"score":137296.35814801208},{"content":"/// print some font on red background | demonstration.\n\npub fn paint_background()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red background color\");\n\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\n\n styledobject = styledobject.on(Color::Blue);\n\n // Print the object to the console and check see the result \n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red background color\").on(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/color/mod.rs","rank":74,"score":137296.35814801208},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_from_cursor_up() {\n\n let context = Context::new();\n\n\n\n // Get terminal\n\n let mut terminal = terminal(&context);\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n cursor::cursor(&context).goto(4, 4);\n\n\n\n // Clear all cells from current cursor position down.\n\n terminal.clear(ClearType::FromCursorUp);\n\n}\n\n\n","file_path":"examples/Crossterm 0.3.0/terminal/terminal.rs","rank":75,"score":137296.35814801208},{"content":"/// Show cursor display, only works on certain terminals.| demonstration\n\npub fn blink_cursor() {\n\n let context = Context::new();\n\n\n\n let cursor = cursor(&context);\n\n cursor.blink(false);\n\n cursor.blink(false);\n\n}\n","file_path":"examples/Crossterm 0.3.0/cursor/mod.rs","rank":76,"score":137296.35814801208},{"content":"/// Clear all lines in terminal | demonstration\n\npub fn clear_all_lines()\n\n{\n\n let term = Terminal::new();\n\n // Get terminal\n\n let mut terminal = terminal(&term);\n\n\n\n print_test_data();\n\n\n\n // Clear all lines in terminal;\n\n terminal.clear(ClearType::All);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/terminal/terminal.rs","rank":77,"score":137296.35814801208},{"content":"/// Clear all lines in terminal | demonstration\n\npub fn clear_all_lines()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n \n\n print_test_data();\n\n \n\n // Clear all lines in terminal;\n\n terminal.clear(ClearType::All);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":78,"score":137296.35814801208},{"content":"/// print some red font | demonstration.\n\npub fn paint_foreground()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red font\");\n\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\n\n styledobject = styledobject.with(Color::Red);\n\n // Print the object to the console and see the result. \n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red font\").with(Color::Red));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":79,"score":137296.35814801208},{"content":"/// Set the terminal size to width 10, height: 10.\n\npub fn set_terminal_size()\n\n{\n\n let mut terminal = get();\n\n\n\n terminal.set_size(10,10);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":80,"score":134845.79890142137},{"content":"#[cfg(unix)]\n\npub fn print_font_with_attributes()\n\n{\n\n println!(\"{}\", paint(\"Normal text\"));\n\n println!(\"{}\", paint(\"Bold text\").bold());\n\n println!(\"{}\", paint(\"Italic text\").italic());\n\n println!(\"{}\", paint(\"Slow blinking text\").slow_blink());\n\n println!(\"{}\", paint(\"Rapid blinking text\").rapid_blink());\n\n println!(\"{}\", paint(\"Hidden text\").hidden());\n\n println!(\"{}\", paint(\"Underlined text\").underlined());\n\n println!(\"{}\", paint(\"Reversed color\").reverse());\n\n println!(\"{}\", paint(\"Dim text color\").dim());\n\n println!(\"{}\", paint(\"Crossed out font\").crossed_out());\n\n}\n\n\n\n/// Print all supported rgb colors | demonstration.\n","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":81,"score":134845.79890142137},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_current_line()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,4);\n\n\n\n // Clear current line cells.\n\n terminal.clear(ClearType::CurrentLine);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":82,"score":134845.79890142137},{"content":"/// print font with fore- background color | demonstration.\n\npub fn paint_foreground_and_background()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red font on blue background color\");\n\n /* Foreground color: \n\n Call the method `with()` on the object given by `paint()`\n\n Pass in an Color from the Color enum.\n\n */\n\n styledobject = styledobject.with(Color::Red);\n\n /* Background color: \n\n Call the method `on()` on the object given by `paint()`\n\n Pass in an Color from the Color enum.\n\n */\n\n styledobject = styledobject.on(Color::Blue);\n\n // Print the object to the console and see the result.\n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red font on blue background color\").with(Color::Red).on(Color::Blue));\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/color/mod.rs","rank":83,"score":134845.79890142137},{"content":"pub fn print_terminal_size()\n\n{\n\n // Get terminal \n\n let mut terminal = get();\n\n // Get terminal size\n\n let terminal_size = terminal.terminal_size().unwrap();\n\n // Print results\n\n print!(\"X: {}, y: {}\", terminal_size.0, terminal_size.1);\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/terminal/mod.rs","rank":84,"score":134845.79890142137},{"content":"/// Print all available foreground colors | demonstration.\n\npub fn print_all_foreground_colors()\n\n{\n\n println!(\"Black : \\t {}\", paint(\"■\").with(Color::Black));\n\n println!(\"Red : \\t\\t {}\", paint(\"■\").with(Color::Red));\n\n println!(\"Dark Red: \\t {}\", paint(\"■\").with(Color::DarkRed));\n\n println!(\"Green : \\t {}\", paint(\"■\").with(Color::Green));\n\n println!(\"Dark Green : \\t {}\", paint(\"■\").with(Color::DarkGreen));\n\n println!(\"Yellow : \\t {}\", paint(\"■\").with(Color::Yellow));\n\n println!(\"Dark Yellow : \\t {}\", paint(\"■\").with(Color::DarkYellow));\n\n println!(\"Blue : \\t\\t {}\", paint(\"■\").with(Color::Blue));\n\n println!(\"Dark Blue : \\t {}\", paint(\"■\").with(Color::DarkBlue));\n\n println!(\"Magenta : \\t {}\", paint(\"■\").with(Color::Magenta));\n\n println!(\"Dark Magenta : \\t {}\", paint(\"■\").with(Color::DarkMagenta));\n\n println!(\"Cyan : \\t\\t {}\", paint(\"■\").with(Color::Cyan));\n\n println!(\"Dark Cyan : \\t {}\", paint(\"■\").with(Color::DarkCyan));\n\n println!(\"Grey : \\t\\t {}\", paint(\"■\").with(Color::Grey));\n\n println!(\"White : \\t {}\", paint(\"■\").with(Color::White));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":85,"score":134845.79890142137},{"content":"#[cfg(unix)]\n\npub fn print_font_with_attributes()\n\n{\n\n println!(\"{}\", paint(\"Normal text\"));\n\n println!(\"{}\", paint(\"Bold text\").bold());\n\n println!(\"{}\", paint(\"Italic text\").italic());\n\n println!(\"{}\", paint(\"Slow blinking text\").slow_blink());\n\n println!(\"{}\", paint(\"Rapid blinking text\").rapid_blink());\n\n println!(\"{}\", paint(\"Hidden text\").hidden());\n\n println!(\"{}\", paint(\"Underlined text\").underlined());\n\n println!(\"{}\", paint(\"Reversed color\").reverse());\n\n println!(\"{}\", paint(\"Dim text color\").dim());\n\n println!(\"{}\", paint(\"Crossed out font\").crossed_out());\n\n}\n\n\n\n/// Print all supported rgb colors \n","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":86,"score":134845.79890142137},{"content":"#[cfg(unix)]#[cfg(unix)]\n\npub fn print_supported_colors()\n\n{ \n\n let count = crossterm::crossterm_style::get().get_available_color_count().unwrap();\n\n\n\n for i in 0..count\n\n {\n\n println!(\"{}\", paint(format!(\"Color: {}\",i)).with(Color::AnsiValue(i as u8)));\n\n\n\n }\n\n}","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":87,"score":134845.79890142137},{"content":"/// Print all available foreground colors | demonstration.\n\npub fn print_all_foreground_colors()\n\n{\n\n println!(\"Black : \\t {}\", paint(\"■\").with(Color::Black));\n\n println!(\"Red : \\t\\t {}\", paint(\"■\").with(Color::Red));\n\n println!(\"Dark Red: \\t {}\", paint(\"■\").with(Color::DarkRed));\n\n println!(\"Green : \\t {}\", paint(\"■\").with(Color::Green));\n\n println!(\"Dark Green : \\t {}\", paint(\"■\").with(Color::DarkGreen));\n\n println!(\"Yellow : \\t {}\", paint(\"■\").with(Color::Yellow));\n\n println!(\"Dark Yellow : \\t {}\", paint(\"■\").with(Color::DarkYellow));\n\n println!(\"Blue : \\t\\t {}\", paint(\"■\").with(Color::Blue));\n\n println!(\"Dark Blue : \\t {}\", paint(\"■\").with(Color::DarkBlue));\n\n println!(\"Magenta : \\t {}\", paint(\"■\").with(Color::Magenta));\n\n println!(\"Dark Magenta : \\t {}\", paint(\"■\").with(Color::DarkMagenta));\n\n println!(\"Cyan : \\t\\t {}\", paint(\"■\").with(Color::Cyan));\n\n println!(\"Dark Cyan : \\t {}\", paint(\"■\").with(Color::DarkCyan));\n\n println!(\"Grey : \\t\\t {}\", paint(\"■\").with(Color::Grey));\n\n println!(\"White : \\t {}\", paint(\"■\").with(Color::White));\n\n}\n\n\n","file_path":"examples/Crossterm 0.1.0/color/mod.rs","rank":88,"score":134845.79890142137},{"content":"#[cfg(unix)]\n\npub fn print_supported_colors()\n\n{ \n\n let count = crossterm::style::color().get_available_color_count().unwrap();\n\n\n\n for i in 0..count\n\n {\n\n println!(\"{}\", paint(format!(\"Color: {}\",i)).with(Color::AnsiValue(i as u8)));\n\n }\n\n}","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":89,"score":134845.79890142137},{"content":"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\n\npub fn clear_current_line()\n\n{\n\n // Get terminal\n\n let mut terminal = get();\n\n\n\n print_test_data();\n\n\n\n // Set terminal cursor position (see example for more info).\n\n crossterm_cursor::get().goto(4,4);\n\n\n\n // Clear current line cells.\n\n terminal.clear(ClearType::CurrentLine);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":90,"score":134845.79890142137},{"content":"/// Save and reset cursor position.\n\npub fn safe_and_reset_position()\n\n{\n\n let mut cursor = get();\n\n \n\n // Goto X: 5 Y: 5\n\n cursor.goto(5,5);\n\n // Safe cursor position: X: 5 Y: 5\n\n cursor.safe_position();\n\n // Goto X: 5 Y: 20\n\n cursor.goto(5,20);\n\n // Print at X: 5 Y: 20.\n\n print!(\"Yea!\");\n\n // Reset back to X: 5 Y: 5.\n\n cursor.reset_position();\n\n // Print Back at X: 5 Y: 5.\n\n print!(\"Back\");\n\n\n\n println!()\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/cursor/mod.rs","rank":91,"score":134845.79890142137},{"content":"/// Print all available foreground colors | demonstration.\n\npub fn print_all_background_colors()\n\n{\n\n println!(\"Black : \\t {}\", paint(\" \").on(Color::Black));\n\n println!(\"Red : \\t\\t {}\", paint(\" \").on(Color::Red));\n\n println!(\"Dark Red: \\t {}\", paint(\" \").on(Color::DarkRed));\n\n println!(\"Green : \\t {}\", paint(\" \").on(Color::Green));\n\n println!(\"Dark Green : \\t {}\", paint(\" \").on(Color::DarkGreen));\n\n println!(\"Yellow : \\t {}\", paint(\" \").on(Color::Yellow));\n\n println!(\"Dark Yellow : \\t {}\", paint(\" \").on(Color::DarkYellow));\n\n println!(\"Blue : \\t\\t {}\", paint(\" \").on(Color::Blue));\n\n println!(\"Dark Blue : \\t {}\", paint(\" \").on(Color::DarkBlue));\n\n println!(\"Magenta : \\t {}\", paint(\" \").on(Color::Magenta));\n\n println!(\"Dark Magenta : \\t {}\", paint(\" \").on(Color::DarkMagenta));\n\n println!(\"Cyan : \\t\\t {}\", paint(\" \").on(Color::Cyan));\n\n println!(\"Dark Cyan : \\t {}\", paint(\" \").on(Color::DarkCyan));\n\n println!(\"Grey : \\t\\t {}\", paint(\" \").on(Color::Grey));\n\n println!(\"White : \\t {}\", paint(\" \").on(Color::White));\n\n}","file_path":"examples/Crossterm 0.1.0/color/mod.rs","rank":92,"score":134845.79890142137},{"content":"/// print font with fore- background color | demonstration.\n\npub fn paint_foreground_and_background()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red font on blue background color\");\n\n /* Foreground color: \n\n Call the method `with()` on the object given by `paint()`\n\n Pass in an Color from the Color enum.\n\n */\n\n styledobject = styledobject.with(Color::Red);\n\n /* Background color: \n\n Call the method `on()` on the object given by `paint()`\n\n Pass in an Color from the Color enum.\n\n */\n\n styledobject = styledobject.on(Color::Blue);\n\n // Print the object to the console and see the result.\n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red font on blue background color\").with(Color::Red).on(Color::Blue));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":93,"score":134845.79890142137},{"content":"/// print font with fore- background color | demonstration.\n\npub fn paint_foreground_and_background()\n\n{ \n\n // Pass an string to the `paint()` method with you want to paint. \n\n // This will give you an object back wits can be styled and displayed.\n\n let mut styledobject = paint(\"Red font on blue background color\");\n\n /* Foreground color: \n\n Call the method `with()` on the object given by `paint()`\n\n Pass in an Color from the Color enum.\n\n */\n\n styledobject = styledobject.with(Color::Red);\n\n /* Background color: \n\n Call the method `on()` on the object given by `paint()`\n\n Pass in an Color from the Color enum.\n\n */\n\n styledobject = styledobject.on(Color::Blue);\n\n // Print the object to the console and see the result.\n\n println!(\"{}\", styledobject);\n\n\n\n // Crossterm provides method chaining so that the above points can be inlined.\n\n println!(\"{}\", paint(\"Red font on blue background color\").with(Color::Red).on(Color::Blue));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":94,"score":134845.79890142137},{"content":"pub fn print_terminal_size()\n\n{\n\n // Get terminal \n\n let mut terminal = get();\n\n // Get terminal size\n\n let terminal_size = terminal.terminal_size().unwrap();\n\n // Print results\n\n print!(\"X: {}, y: {}\", terminal_size.0, terminal_size.1);\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.0/terminal/mod.rs","rank":95,"score":134845.79890142137},{"content":"/// Print all available foreground colors | demonstration.\n\npub fn print_all_background_colors()\n\n{\n\n println!(\"Black : \\t {}\", paint(\" \").on(Color::Black));\n\n println!(\"Red : \\t\\t {}\", paint(\" \").on(Color::Red));\n\n println!(\"Dark Red: \\t {}\", paint(\" \").on(Color::DarkRed));\n\n println!(\"Green : \\t {}\", paint(\" \").on(Color::Green));\n\n println!(\"Dark Green : \\t {}\", paint(\" \").on(Color::DarkGreen));\n\n println!(\"Yellow : \\t {}\", paint(\" \").on(Color::Yellow));\n\n println!(\"Dark Yellow : \\t {}\", paint(\" \").on(Color::DarkYellow));\n\n println!(\"Blue : \\t\\t {}\", paint(\" \").on(Color::Blue));\n\n println!(\"Dark Blue : \\t {}\", paint(\" \").on(Color::DarkBlue));\n\n println!(\"Magenta : \\t {}\", paint(\" \").on(Color::Magenta));\n\n println!(\"Dark Magenta : \\t {}\", paint(\" \").on(Color::DarkMagenta));\n\n println!(\"Cyan : \\t\\t {}\", paint(\" \").on(Color::Cyan));\n\n println!(\"Dark Cyan : \\t {}\", paint(\" \").on(Color::DarkCyan));\n\n println!(\"Grey : \\t\\t {}\", paint(\" \").on(Color::Grey));\n\n println!(\"White : \\t {}\", paint(\" \").on(Color::White));\n\n #[cfg(unix)]\n\n println!(\"RGB (10,10,10): \\t {}\", paint(\" \").on(Color::Rgb {r: 10, g: 10, b: 10}));\n\n #[cfg(unix)]\n\n println!(\"RGB (10,10,10): \\t {}\", paint(\" \").on(Color::AnsiValue(50)));\n\n}\n\n\n\n/// Print font with all available attributes. Note that this can only be used at unix systems and that some are not supported widely | demonstration..\n","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":96,"score":134845.79890142137},{"content":"/// Print all available foreground colors | demonstration.\n\npub fn print_all_background_colors()\n\n{\n\n println!(\"Black : \\t {}\", paint(\" \").on(Color::Black));\n\n println!(\"Red : \\t\\t {}\", paint(\" \").on(Color::Red));\n\n println!(\"Dark Red: \\t {}\", paint(\" \").on(Color::DarkRed));\n\n println!(\"Green : \\t {}\", paint(\" \").on(Color::Green));\n\n println!(\"Dark Green : \\t {}\", paint(\" \").on(Color::DarkGreen));\n\n println!(\"Yellow : \\t {}\", paint(\" \").on(Color::Yellow));\n\n println!(\"Dark Yellow : \\t {}\", paint(\" \").on(Color::DarkYellow));\n\n println!(\"Blue : \\t\\t {}\", paint(\" \").on(Color::Blue));\n\n println!(\"Dark Blue : \\t {}\", paint(\" \").on(Color::DarkBlue));\n\n println!(\"Magenta : \\t {}\", paint(\" \").on(Color::Magenta));\n\n println!(\"Dark Magenta : \\t {}\", paint(\" \").on(Color::DarkMagenta));\n\n println!(\"Cyan : \\t\\t {}\", paint(\" \").on(Color::Cyan));\n\n println!(\"Dark Cyan : \\t {}\", paint(\" \").on(Color::DarkCyan));\n\n println!(\"Grey : \\t\\t {}\", paint(\" \").on(Color::Grey));\n\n println!(\"White : \\t {}\", paint(\" \").on(Color::White));\n\n #[cfg(unix)]\n\n println!(\"RGB (10,10,10): \\t {}\", paint(\" \").on(Color::Rgb {r: 10, g: 10, b: 10}));\n\n #[cfg(unix)]\n\n println!(\"RGB (10,10,10): \\t {}\", paint(\" \").on(Color::AnsiValue(50)));\n\n}\n\n\n\n/// Print font with all available attributes. Note that this can only be used at unix systems and that some are not supported widely.\n","file_path":"examples/Crossterm 0.2.0/color/mod.rs","rank":97,"score":134845.79890142137},{"content":"/// Print all available foreground colors | demonstration.\n\npub fn print_all_foreground_colors()\n\n{\n\n println!(\"Black : \\t {}\", paint(\"■\").with(Color::Black));\n\n println!(\"Red : \\t\\t {}\", paint(\"■\").with(Color::Red));\n\n println!(\"Dark Red: \\t {}\", paint(\"■\").with(Color::DarkRed));\n\n println!(\"Green : \\t {}\", paint(\"■\").with(Color::Green));\n\n println!(\"Dark Green : \\t {}\", paint(\"■\").with(Color::DarkGreen));\n\n println!(\"Yellow : \\t {}\", paint(\"■\").with(Color::Yellow));\n\n println!(\"Dark Yellow : \\t {}\", paint(\"■\").with(Color::DarkYellow));\n\n println!(\"Blue : \\t\\t {}\", paint(\"■\").with(Color::Blue));\n\n println!(\"Dark Blue : \\t {}\", paint(\"■\").with(Color::DarkBlue));\n\n println!(\"Magenta : \\t {}\", paint(\"■\").with(Color::Magenta));\n\n println!(\"Dark Magenta : \\t {}\", paint(\"■\").with(Color::DarkMagenta));\n\n println!(\"Cyan : \\t\\t {}\", paint(\"■\").with(Color::Cyan));\n\n println!(\"Dark Cyan : \\t {}\", paint(\"■\").with(Color::DarkCyan));\n\n println!(\"Grey : \\t\\t {}\", paint(\"■\").with(Color::Grey));\n\n println!(\"White : \\t {}\", paint(\"■\").with(Color::White));\n\n}\n\n\n","file_path":"examples/Crossterm 0.2.1/color/mod.rs","rank":98,"score":134845.79890142137},{"content":"/// Save and reset cursor position | demonstration..\n\npub fn safe_and_reset_position()\n\n{\n\n let context = Terminal::new();\n\n let mut cursor = cursor(&context);\n\n \n\n // Goto X: 5 Y: 5\n\n cursor.goto(5,5);\n\n // Safe cursor position: X: 5 Y: 5\n\n cursor.save_position();\n\n // Goto X: 5 Y: 20\n\n cursor.goto(5,20);\n\n // Print at X: 5 Y: 20.\n\n println!(\"Yea!\");\n\n // Reset back to X: 5 Y: 5.\n\n cursor.reset_position();\n\n // Print Back at X: 5 Y: 5.\n\n println!(\"Back\");\n\n\n\n println!()\n\n}\n","file_path":"examples/Crossterm 0.2.1/cursor/mod.rs","rank":99,"score":134845.79890142137}],"string":"[\n {\n \"content\": \"/// print wait screen on alternate screen, then swich back.\\n\\npub fn print_wait_screen_on_alternate_window(context: Rc<Context>) {\\n\\n // create scope. If this scope ends the screen will be switched back to mainscreen.\\n\\n // because `AlternateScreen` switches back to main screen when switching back.\\n\\n {\\n\\n // create new alternate screen instance and switch to the alternate screen.\\n\\n let mut screen = AlternateScreen::from(context.clone());\\n\\n\\n\\n write!(screen, \\\"test\\\");\\n\\n println!();\\n\\n // Print the wait screen.\\n\\n print_wait_screen(context.clone());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/alternate_screen.rs\",\n \"rank\": 0,\n \"score\": 193786.54031265096\n },\n {\n \"content\": \"/// paint text with colors using `Crossterm` | demonstration.\\n\\npub fn use_crossterm_paint()\\n\\n{\\n\\n let crossterm = Crossterm::new();\\n\\n crossterm.paint(\\\"Black on BLUE\\\").with(Color::Black).on(Color::Blue);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/crossterm_type/mod.rs\",\n \"rank\": 1,\n \"score\": 179534.8036702217\n },\n {\n \"content\": \"/// write text to terminal using `Crossterm` | demonstration.\\n\\npub fn use_crossterm_write()\\n\\n{\\n\\n let crossterm = Crossterm::new();\\n\\n crossterm.write(\\\"some text \\\\nsome text on new line\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/crossterm_type/mod.rs\",\n \"rank\": 2,\n \"score\": 179534.80367022177\n },\n {\n \"content\": \"/// use the `Crossterm` to get an instance to the terminal module | demonstration.\\n\\npub fn use_crossterm_terminal()\\n\\n{\\n\\n let crossterm = Crossterm::new();\\n\\n let mut terminal = crossterm.terminal();\\n\\n terminal.clear(ClearType::All);\\n\\n terminal.set_size(40,40);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/crossterm_type/mod.rs\",\n \"rank\": 3,\n \"score\": 179534.70097085967\n },\n {\n \"content\": \"/// use the `Crossterm` to get an instance to the color module | demonstration.\\n\\npub fn use_crossterm_color()\\n\\n{\\n\\n let crossterm = Crossterm::new();\\n\\n let mut color = crossterm.color();\\n\\n color.set_bg(Color::Red);\\n\\n color.set_fg(Color::Green);\\n\\n}\\n\\n\\n\\nuse crossterm::terminal::ClearType;\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/crossterm_type/mod.rs\",\n \"rank\": 4,\n \"score\": 179534.70097085967\n },\n {\n \"content\": \"/// use the `Crossterm` to get an instance to the cursor module | demonstration.\\n\\npub fn use_crossterm_cursor()\\n\\n{\\n\\n let crossterm = Crossterm::new();\\n\\n let mut cursor = crossterm.cursor();\\n\\n cursor.goto(5,5).print(\\\"test\\\");\\n\\n}\\n\\n\\n\\nuse crossterm::style::Color;\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/crossterm_type/mod.rs\",\n \"rank\": 5,\n \"score\": 179534.70097085962\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:7 up | demonstration\\n\\npub fn clear_until_new_line()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n cursor::cursor(&term).goto(4,20);\\n\\n\\n\\n // Clear all the cells until next line.\\n\\n terminal.clear(ClearType::UntilNewLine);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 6,\n \"score\": 170100.841729499\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_until_new_line()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,4);\\n\\n\\n\\n // Clear all the cells until next line.\\n\\n terminal.clear(ClearType::UntilNewLine);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 7,\n \"score\": 170100.841729499\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_until_new_line()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,7);\\n\\n\\n\\n // Clear all the cells until next line.\\n\\n terminal.clear(ClearType::UntilNewLine);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 8,\n \"score\": 170100.841729499\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:7 up | demonstration\\n\\npub fn clear_until_new_line() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n cursor::cursor(&context).goto(4, 20);\\n\\n\\n\\n // Clear all the cells until next line.\\n\\n terminal.clear(ClearType::UntilNewLine);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 9,\n \"score\": 170100.841729499\n },\n {\n \"content\": \"/// Get an Terminal implementation whereon terminal related actions can be performed.\\n\\n///\\n\\n/// Check `/examples/version/terminal` in the libary for more spesific examples.\\n\\n///\\n\\n/// #Example\\n\\n///\\n\\n/// ```rust\\n\\n///\\n\\n/// extern crate crossterm;\\n\\n/// use crossterm::terminal;\\n\\n/// use crossterm::Context;\\n\\n///\\n\\n/// let context = Context::new();\\n\\n///\\n\\n/// let mut term = terminal::terminal(&context);\\n\\n///\\n\\n/// // scroll down by 5 lines\\n\\n/// let size = term.scroll_down(5);\\n\\n///\\n\\n/// ```\\n\\n///\\n\\npub fn terminal(context: &Rc<Context>) -> Box<Terminal> {\\n\\n Box::from(Terminal::new(context.clone()))\\n\\n}\\n\",\n \"file_path\": \"src/terminal/terminal.rs\",\n \"rank\": 10,\n \"score\": 169013.39993971726\n },\n {\n \"content\": \"/// Get an TerminalCursor implementation whereon cursor related actions can be performed.\\n\\n///\\n\\n/// Check `/examples/version/cursor` in the libary for more spesific examples.\\n\\n///\\n\\n/// #Example\\n\\n///\\n\\n/// ```rust\\n\\n///\\n\\n/// extern crate crossterm;\\n\\n/// use self::crossterm::Context;\\n\\n/// use self::crossterm::cursor;\\n\\n///\\n\\n/// let context = Context::new();\\n\\n///\\n\\n/// // Get cursor and goto pos X: 5, Y: 10\\n\\n/// let mut cursor = cursor::cursor(&context);\\n\\n/// cursor.goto(5,10);\\n\\n///\\n\\n/// cursor.show();\\n\\n/// cursor.hide();\\n\\n/// cursor.blink();\\n\\n/// cursor.move_left(2);\\n\\n///\\n\\n/// //Or you can do it in one line.\\n\\n/// cursor::cursor(&context).goto(5,10);\\n\\n///\\n\\n/// ```\\n\\npub fn cursor(context: &Rc<Context>) -> Box<TerminalCursor> {\\n\\n Box::from(TerminalCursor::new(context.clone()))\\n\\n}\",\n \"file_path\": \"src/cursor/cursor.rs\",\n \"rank\": 11,\n \"score\": 166953.56663885867\n },\n {\n \"content\": \"/// Get an Color implementation whereon color related actions can be performed.\\n\\n///\\n\\n/// Check `/examples/version/color` in the library for more specific examples.\\n\\n///\\n\\npub fn color(context: &Rc<Context>) -> Box<TerminalColor> {\\n\\n Box::from(TerminalColor::new(context.clone()))\\n\\n}\\n\",\n \"file_path\": \"src/style/color/color.rs\",\n \"rank\": 12,\n \"score\": 164957.33622092637\n },\n {\n \"content\": \"/// Get the current cursor position.\\n\\npub fn pos(context: Rc<Context>) -> (u16, u16) {\\n\\n use std::io::{Read, Write};\\n\\n\\n\\n let mut command_id = NoncanonicalModeCommand::new(&context.state_manager);\\n\\n\\n\\n CommandManager::execute(context.clone(), command_id);\\n\\n\\n\\n // This code is original written by term_cursor credits to them.\\n\\n use std::io;\\n\\n let mut std = io::stdout();\\n\\n // Write command\\n\\n std.write(b\\\"\\\\x1B[6n\\\");\\n\\n std.flush();\\n\\n\\n\\n // Read back result\\n\\n let mut buf = [0u8; 2];\\n\\n // Expect `ESC[`\\n\\n io::stdin().read_exact(&mut buf);\\n\\n if buf[0] != 0x1B || buf[1] as char != '[' {\\n\\n return (0, 0);\\n\",\n \"file_path\": \"src/kernel/unix_kernel/terminal.rs\",\n \"rank\": 13,\n \"score\": 164957.33622092637\n },\n {\n \"content\": \"/// Get the cursor position based on the current platform.\\n\\npub fn get_cursor_position(context: Rc<Context>) -> (u16, u16) {\\n\\n #[cfg(unix)]\\n\\n return pos(context.clone());\\n\\n\\n\\n #[cfg(windows)]\\n\\n return pos(&context.screen_manager);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared/functions.rs\",\n \"rank\": 14,\n \"score\": 164957.33622092637\n },\n {\n \"content\": \"pub fn clear_entire_screen(csbi: CONSOLE_SCREEN_BUFFER_INFO, context: &Rc<Context>) {\\n\\n // position x at start\\n\\n let x = 0;\\n\\n // position y at start\\n\\n let y = 0;\\n\\n\\n\\n // location where to start clearing\\n\\n let start_location = COORD {\\n\\n X: x as i16,\\n\\n Y: y as i16,\\n\\n };\\n\\n // get sum cells before cursor\\n\\n\\n\\n let cells_to_write = csbi.dwSize.X as u32 * csbi.dwSize.Y as u32;\\n\\n\\n\\n clear(start_location, cells_to_write, &context.screen_manager);\\n\\n\\n\\n // put the cursor back at (0, 0)\\n\\n cursor(&context).goto(0, 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/terminal/winapi_terminal.rs\",\n \"rank\": 15,\n \"score\": 157775.24047435226\n },\n {\n \"content\": \"fn print_wait_screen(context: Rc<Context>) {\\n\\n let mut terminal = terminal::terminal(&context);\\n\\n terminal.clear(ClearType::All);\\n\\n\\n\\n let mut cursor = cursor(&context);\\n\\n cursor.goto(0, 0);\\n\\n cursor.hide();\\n\\n\\n\\n terminal.write(\\n\\n \\\"Welcome to the wait screen.\\\\n\\\\\\n\\n Please wait a few seconds until we arrive back at the main screen.\\\\n\\\\\\n\\n Progress: \\\",\\n\\n );\\n\\n\\n\\n // print some progress example.\\n\\n for i in 1..5 {\\n\\n // print the current counter at the line of `Seconds to Go: {counter}`\\n\\n cursor\\n\\n .goto(10, 2)\\n\\n .print(terminal.paint(format!(\\\"{} of the 5 items processed\\\", i)).with(Color::Red).on(Color::Blue));\\n\\n\\n\\n // 1 second delay\\n\\n thread::sleep(time::Duration::from_secs(1));\\n\\n }\\n\\n\\n\\n stdout().flush();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/alternate_screen.rs\",\n \"rank\": 16,\n \"score\": 154654.17910188844\n },\n {\n \"content\": \"// raw screen is not working correctly currently\\n\\nfn print_wait_screen(context: Rc<Context>) {\\n\\n terminal::terminal(&context).clear(ClearType::All);\\n\\n\\n\\n let mut cursor = cursor(&context);\\n\\n cursor.goto(0, 0).print(\\\"Welcome to the wait screen.\\\");\\n\\n cursor\\n\\n .goto(0, 1)\\n\\n .print(\\\"Please wait a few seconds until we arrive back at the main screen.\\\");\\n\\n cursor.goto(0, 2).print(\\\"Progress: \\\");\\n\\n\\n\\n // print some progress example.\\n\\n for i in 1..5 {\\n\\n // print the current counter at the line of `Seconds to Go: {counter}`\\n\\n cursor\\n\\n .goto(10, 2)\\n\\n .print(format!(\\\"{} of the 5 items processed\\\", i));\\n\\n\\n\\n // 1 second delay\\n\\n thread::sleep(time::Duration::from_secs(1));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/raw_mode.rs\",\n \"rank\": 17,\n \"score\": 154654.17910188844\n },\n {\n \"content\": \"pub fn clear_until_line(pos: (u16, u16), csbi: CONSOLE_SCREEN_BUFFER_INFO, context: &Rc<Context>) {\\n\\n let (x, y) = pos;\\n\\n\\n\\n // location where to start clearing\\n\\n let start_location = COORD {\\n\\n X: x as i16,\\n\\n Y: y as i16,\\n\\n };\\n\\n // get sum cells before cursor\\n\\n let cells_to_write = (csbi.dwSize.X - x as i16) as u32;\\n\\n\\n\\n clear(start_location, cells_to_write, &context.screen_manager);\\n\\n\\n\\n // put the cursor back at original cursor position\\n\\n cursor(&context).goto(x, y);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/terminal/winapi_terminal.rs\",\n \"rank\": 18,\n \"score\": 148312.54421712674\n },\n {\n \"content\": \"/// Switch to alternate screen using the `Context` of `Crossterm` | demonstration.\\n\\npub fn create_alternate_screen_from_crossterm()\\n\\n{\\n\\n use crossterm::screen::*;\\n\\n use std::convert::From;\\n\\n\\n\\n let crossterm = Crossterm::new();\\n\\n\\n\\n {\\n\\n // move into alternate screen\\n\\n let alternate_screen = AlternateScreen::from(crossterm.context());\\n\\n\\n\\n // this will move the cursor and print `some text` on the alternate screen.\\n\\n crossterm.cursor().goto(10, 10).print(\\\"Some text\\\");\\n\\n } // <- alternate screen ends here an will be switched back to main screen.\\n\\n\\n\\n // print \\\"Some other text\\\" on the mainscreen at x: 0, y: 10\\n\\n crossterm.cursor().goto(0,10).print(\\\"Some other text\\\");\\n\\n}\",\n \"file_path\": \"examples/Crossterm 0.3.0/crossterm_type/mod.rs\",\n \"rank\": 19,\n \"score\": 143152.625381494\n },\n {\n \"content\": \"/// Move the cursor 3 up | demonstration.\\n\\npub fn move_up() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n\\n\\n // Move the cursor to position 3 times to the up in the terminal\\n\\n cursor.move_up(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 20,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Scroll down 10 lines | demonstration.\\n\\npub fn scroll_up()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n // Scroll up 10 lines.\\n\\n terminal.scroll_up(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 21,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"// scroll down 10 lines\\n\\npub fn scroll_up()\\n\\n{\\n\\n print_test_data();\\n\\n \\n\\n // Get terminal \\n\\n let mut terminal = get();\\n\\n // Scroll up 10 lines.\\n\\n terminal.scroll_up(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 22,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Move the cursor 3 down | demonstration.\\n\\npub fn move_down()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the down in the terminal\\n\\n cursor.move_down(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 23,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Scroll down 10 lines | demonstration.\\n\\npub fn scroll_down() {\\n\\n let context = Context::new();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n // Scroll down 10 lines.\\n\\n terminal.scroll_down(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 24,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Move the cursor 3 up | demonstration.\\n\\npub fn move_up()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the up in the terminal\\n\\n cursor.move_up(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/cursor/mod.rs\",\n \"rank\": 25,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Set the cursor to position X: 10, Y: 5 in the terminal.\\n\\npub fn goto() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10, 5);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 26,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Print character at X: 10 Y: 5 | demonstration.\\n\\npub fn print()\\n\\n{\\n\\n // To print an some displayable content on an certain position. \\n\\n \\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10,5);\\n\\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\\n\\n print!(\\\"@\\\");\\n\\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first. \\n\\n use std;\\n\\n use std::io::Write;\\n\\n std::io::stdout().flush();\\n\\n \\n\\n /* Because the above method is a little to mutch code, \\n\\n you can use the `print()` method for printing an value at an certain position in the terminal.\\n\\n \\n\\n Crossterm provides method chaining so that the above points can be inlined.\\n\\n */\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/cursor/mod.rs\",\n \"rank\": 27,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Move the cursor 3 up | demonstration.\\n\\npub fn move_up()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the up in the terminal\\n\\n cursor.move_up(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 28,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"// scroll down 10 lines\\n\\npub fn scroll_down()\\n\\n{\\n\\n print_test_data();\\n\\n // Get terminal \\n\\n let mut terminal = get();\\n\\n // Scroll down 10 lines.\\n\\n let terminal_size = terminal.scroll_down(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 29,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Set the cursor to position X: 10, Y: 5 in the terminal.\\n\\npub fn goto()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10,5); \\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 30,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Scroll down 10 lines | demonstration.\\n\\npub fn scroll_up() {\\n\\n let context = Context::new();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n // Scroll up 10 lines.\\n\\n terminal.scroll_up(5);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 31,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// exit the current proccess.\\n\\npub fn exit() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n // Get terminal size\\n\\n terminal.exit();\\n\\n}\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 32,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// get the cursor position\\n\\npub fn pos() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // get the cursor position.\\n\\n let (x, y) = cursor.pos();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 33,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Scroll down 10 lines | demonstration.\\n\\npub fn scroll_down()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n\\n\\n print_test_data();\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n // Scroll down 10 lines.\\n\\n terminal.scroll_down(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 34,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Set the cursor to position X: 10, Y: 5 in the terminal.\\n\\npub fn goto()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10,5); \\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/cursor/mod.rs\",\n \"rank\": 35,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Move the cursor 3 down | demonstration.\\n\\npub fn move_down()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the down in the terminal\\n\\n cursor.move_down(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 36,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Print character at X: 10 Y: 5 | demonstration.\\n\\npub fn print()\\n\\n{\\n\\n // To print an some displayable content on an certain position. \\n\\n \\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10,5);\\n\\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\\n\\n print!(\\\"@\\\");\\n\\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first. \\n\\n use std;\\n\\n use std::io::Write;\\n\\n std::io::stdout().flush();\\n\\n \\n\\n /* Because the above method is a little to mutch code, \\n\\n you can use the `print()` method for printing an value at an certain position in the terminal.\\n\\n \\n\\n Crossterm provides method chaining so that the above points can be inlined.\\n\\n */\\n\\n \\n\\n get().goto(10,5).print(\\\"@\\\"); \\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 37,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Print character at X: 10 Y: 5 | demonstration.\\n\\npub fn print() {\\n\\n let context = Context::new();\\n\\n\\n\\n // To print an some displayable content on an certain position.\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10, 5);\\n\\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\\n\\n print!(\\\"@\\\");\\n\\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first.\\n\\n use std;\\n\\n use std::io::Write;\\n\\n std::io::stdout().flush();\\n\\n\\n\\n /* Because the above method is a little to much code,\\n\\n you can use the `print()` method for printing an value at an certain position in the terminal.\\n\\n \\n\\n Crossterm provides method chaining so that the above points can be inlined.\\n\\n */\\n\\n\\n\\n cursor.goto(10, 5).print(\\\"@\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 38,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Print character at X: 10 Y: 5 | demonstration.\\n\\npub fn print()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n // To print an some displayable content on an certain position. \\n\\n \\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10,5);\\n\\n // Print the @ symbol at position X: 10, Y: 5 in the terminal\\n\\n print!(\\\"@\\\");\\n\\n // Rust is line buffered inorder to print at an certain position we need to clear the buffer first. \\n\\n use std;\\n\\n use std::io::Write;\\n\\n std::io::stdout().flush();\\n\\n \\n\\n /* Because the above method is a little to much code,\\n\\n you can use the `print()` method for printing an value at an certain position in the terminal.\\n\\n \\n\\n Crossterm provides method chaining so that the above points can be inlined.\\n\\n */\\n\\n\\n\\n cursor.goto(10,5).print(\\\"@\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 39,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"/// Set the cursor to position X: 10, Y: 5 in the terminal.\\n\\npub fn goto()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Set the cursor to position X: 10, Y: 5 in the terminal\\n\\n cursor.goto(10,5); \\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 40,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Move the cursor 3 up | demonstration.\\n\\npub fn move_up()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the up in the terminal\\n\\n cursor.move_up(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 41,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"// scroll down 10 lines\\n\\npub fn scroll_up()\\n\\n{\\n\\n print_test_data();\\n\\n \\n\\n // Get terminal \\n\\n let mut terminal = get();\\n\\n // Scroll up 10 lines.\\n\\n let terminal_size = terminal.scroll_up(10);\\n\\n}\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 42,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Move the cursor 3 down | demonstration.\\n\\npub fn move_down() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the down in the terminal\\n\\n cursor.move_down(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 43,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Move the cursor 3 down | demonstration.\\n\\npub fn move_down()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the down in the terminal\\n\\n cursor.move_down(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/cursor/mod.rs\",\n \"rank\": 44,\n \"score\": 139874.44869152122\n },\n {\n \"content\": \"// scroll down 10 lines\\n\\npub fn scroll_down()\\n\\n{\\n\\n print_test_data();\\n\\n // Get terminal \\n\\n let mut terminal = get();\\n\\n // Scroll down 10 lines.\\n\\n terminal.scroll_down(10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 45,\n \"score\": 139874.44869152125\n },\n {\n \"content\": \"/// Move the cursor 3 to the right | demonstration.\\n\\npub fn move_right()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the right in the terminal\\n\\n cursor.move_right(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 46,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_from_cursor_up()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n cursor::cursor(&term).goto(4,4);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorUp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 47,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Resize the terminal to X: 10, Y: 10 | demonstration.\\n\\npub fn resize_terminal() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n\\n\\n // Get terminal size\\n\\n terminal.set_size(10, 10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 48,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines in terminal | demonstration\\n\\npub fn clear_all_lines() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Clear all lines in terminal;\\n\\n terminal.clear(ClearType::All);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 49,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some red font | demonstration.\\n\\npub fn paint_foreground()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red font\\\");\\n\\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n // Print the object to the console and see the result. \\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red font\\\").with(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 50,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"// Resize the terminal to X: 10, Y: 10\\n\\npub fn resize_terminal()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n // Get terminal size\\n\\n terminal.set_size(1,1);\\n\\n}\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 51,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the right | demonstration.\\n\\npub fn move_right()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the right in the terminal\\n\\n cursor.move_right(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/cursor/mod.rs\",\n \"rank\": 52,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the right | demonstration.\\n\\npub fn move_right()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the right in the terminal\\n\\n cursor.move_right(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 53,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_from_cursor_up()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,8);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorUp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 54,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some font on red background | demonstration.\\n\\npub fn paint_background() {\\n\\n let context = Context::new();\\n\\n let terminal = terminal::terminal(&context);\\n\\n\\n\\n // Pass an string to the `paint()` method with you want to paint.\\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = terminal.paint(\\\"Red background color\\\");\\n\\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\\n\\n styledobject = styledobject.on(Color::Red);\\n\\n // Print the object to the console and check see the result\\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", terminal.paint(\\\"Red background color\\\").on(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/color/mod.rs\",\n \"rank\": 55,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_from_cursor_up()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,8);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorUp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 56,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\\n\\npub fn clear_from_cursor_down()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n cursor::cursor(&term).goto(4,8);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorDown);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 57,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\\n\\npub fn clear_from_cursor_down()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,8);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorDown);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 58,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\\n\\npub fn clear_from_cursor_down() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n cursor::cursor(&context).goto(4, 8);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorDown);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 59,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 down | demonstration\\n\\npub fn clear_from_cursor_down()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,8);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorDown);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 60,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some font on red background | demonstration.\\n\\npub fn paint_background()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red background color\\\");\\n\\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\\n\\n styledobject = styledobject.on(Color::Red);\\n\\n // Print the object to the console and check see the result \\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red background color\\\").on(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 61,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the left | demonstration.\\n\\npub fn move_left() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the left in the terminal\\n\\n cursor.move_left(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 62,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the left | demonstration.\\n\\npub fn move_left()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the left in the terminal\\n\\n cursor.move_left(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 63,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the left | demonstration.\\n\\npub fn move_left()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the left in the terminal\\n\\n cursor.move_left(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 64,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the left | demonstration.\\n\\npub fn move_left()\\n\\n{\\n\\n // Get the cursor\\n\\n let mut cursor = get();\\n\\n // Move the cursor to position 3 times to the left in the terminal\\n\\n cursor.move_left(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/cursor/mod.rs\",\n \"rank\": 65,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines in terminal | demonstration\\n\\npub fn clear_all_lines()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n \\n\\n print_test_data();\\n\\n \\n\\n // Clear all lines in terminal;\\n\\n terminal.clear(ClearType::All);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 66,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Hide cursor display | demonstration.\\n\\npub fn hide_cursor() {\\n\\n let context = Context::new();\\n\\n\\n\\n let cursor = cursor(&context);\\n\\n cursor.hide();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 67,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Resize the terminal to X: 10, Y: 10 | demonstration.\\n\\npub fn resize_terminal()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n // Get terminal size\\n\\n terminal.set_size(10,10);\\n\\n}\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 68,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Move the cursor 3 to the right | demonstration.\\n\\npub fn move_right() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get the cursor\\n\\n let mut cursor = cursor(&context);\\n\\n // Move the cursor to position 3 times to the right in the terminal\\n\\n cursor.move_right(3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 69,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Show cursor display | demonstration.\\n\\npub fn show_cursor() {\\n\\n let context = Context::new();\\n\\n\\n\\n let cursor = cursor(&context);\\n\\n cursor.show();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 70,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some red font | demonstration.\\n\\npub fn paint_foreground() {\\n\\n let context = Context::new();\\n\\n let terminal = terminal::terminal(&context);\\n\\n\\n\\n // Pass an string to the `paint()` method with you want to paint.\\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = terminal.paint(\\\"Red font\\\");\\n\\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n // Print the object to the console and see the result.\\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", terminal.paint(\\\"Red font\\\").with(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/color/mod.rs\",\n \"rank\": 71,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some red font | demonstration.\\n\\npub fn paint_foreground()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red font\\\");\\n\\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n // Print the object to the console and see the result. \\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red font\\\").with(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/color/mod.rs\",\n \"rank\": 72,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some font on red background | demonstration.\\n\\npub fn paint_background()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red background color\\\");\\n\\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\\n\\n styledobject = styledobject.on(Color::Red);\\n\\n // Print the object to the console and check see the result \\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red background color\\\").on(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 73,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some font on red background | demonstration.\\n\\npub fn paint_background()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red background color\\\");\\n\\n // Call the method `on()` on the object given by `paint()` and pass in an Color from the Color enum.\\n\\n styledobject = styledobject.on(Color::Blue);\\n\\n // Print the object to the console and check see the result \\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red background color\\\").on(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/color/mod.rs\",\n \"rank\": 74,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_from_cursor_up() {\\n\\n let context = Context::new();\\n\\n\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&context);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n cursor::cursor(&context).goto(4, 4);\\n\\n\\n\\n // Clear all cells from current cursor position down.\\n\\n terminal.clear(ClearType::FromCursorUp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/terminal/terminal.rs\",\n \"rank\": 75,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Show cursor display, only works on certain terminals.| demonstration\\n\\npub fn blink_cursor() {\\n\\n let context = Context::new();\\n\\n\\n\\n let cursor = cursor(&context);\\n\\n cursor.blink(false);\\n\\n cursor.blink(false);\\n\\n}\\n\",\n \"file_path\": \"examples/Crossterm 0.3.0/cursor/mod.rs\",\n \"rank\": 76,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines in terminal | demonstration\\n\\npub fn clear_all_lines()\\n\\n{\\n\\n let term = Terminal::new();\\n\\n // Get terminal\\n\\n let mut terminal = terminal(&term);\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Clear all lines in terminal;\\n\\n terminal.clear(ClearType::All);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/terminal/terminal.rs\",\n \"rank\": 77,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Clear all lines in terminal | demonstration\\n\\npub fn clear_all_lines()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n \\n\\n print_test_data();\\n\\n \\n\\n // Clear all lines in terminal;\\n\\n terminal.clear(ClearType::All);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 78,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// print some red font | demonstration.\\n\\npub fn paint_foreground()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red font\\\");\\n\\n // Call the method `with()` on the object given by `paint()` and pass in any Color from the Color enum.\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n // Print the object to the console and see the result. \\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red font\\\").with(Color::Red));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 79,\n \"score\": 137296.35814801208\n },\n {\n \"content\": \"/// Set the terminal size to width 10, height: 10.\\n\\npub fn set_terminal_size()\\n\\n{\\n\\n let mut terminal = get();\\n\\n\\n\\n terminal.set_size(10,10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 80,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"#[cfg(unix)]\\n\\npub fn print_font_with_attributes()\\n\\n{\\n\\n println!(\\\"{}\\\", paint(\\\"Normal text\\\"));\\n\\n println!(\\\"{}\\\", paint(\\\"Bold text\\\").bold());\\n\\n println!(\\\"{}\\\", paint(\\\"Italic text\\\").italic());\\n\\n println!(\\\"{}\\\", paint(\\\"Slow blinking text\\\").slow_blink());\\n\\n println!(\\\"{}\\\", paint(\\\"Rapid blinking text\\\").rapid_blink());\\n\\n println!(\\\"{}\\\", paint(\\\"Hidden text\\\").hidden());\\n\\n println!(\\\"{}\\\", paint(\\\"Underlined text\\\").underlined());\\n\\n println!(\\\"{}\\\", paint(\\\"Reversed color\\\").reverse());\\n\\n println!(\\\"{}\\\", paint(\\\"Dim text color\\\").dim());\\n\\n println!(\\\"{}\\\", paint(\\\"Crossed out font\\\").crossed_out());\\n\\n}\\n\\n\\n\\n/// Print all supported rgb colors | demonstration.\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 81,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_current_line()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,4);\\n\\n\\n\\n // Clear current line cells.\\n\\n terminal.clear(ClearType::CurrentLine);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 82,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// print font with fore- background color | demonstration.\\n\\npub fn paint_foreground_and_background()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red font on blue background color\\\");\\n\\n /* Foreground color: \\n\\n Call the method `with()` on the object given by `paint()`\\n\\n Pass in an Color from the Color enum.\\n\\n */\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n /* Background color: \\n\\n Call the method `on()` on the object given by `paint()`\\n\\n Pass in an Color from the Color enum.\\n\\n */\\n\\n styledobject = styledobject.on(Color::Blue);\\n\\n // Print the object to the console and see the result.\\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red font on blue background color\\\").with(Color::Red).on(Color::Blue));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/color/mod.rs\",\n \"rank\": 83,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"pub fn print_terminal_size()\\n\\n{\\n\\n // Get terminal \\n\\n let mut terminal = get();\\n\\n // Get terminal size\\n\\n let terminal_size = terminal.terminal_size().unwrap();\\n\\n // Print results\\n\\n print!(\\\"X: {}, y: {}\\\", terminal_size.0, terminal_size.1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/terminal/mod.rs\",\n \"rank\": 84,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Print all available foreground colors | demonstration.\\n\\npub fn print_all_foreground_colors()\\n\\n{\\n\\n println!(\\\"Black : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Black));\\n\\n println!(\\\"Red : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Red));\\n\\n println!(\\\"Dark Red: \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkRed));\\n\\n println!(\\\"Green : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Green));\\n\\n println!(\\\"Dark Green : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkGreen));\\n\\n println!(\\\"Yellow : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Yellow));\\n\\n println!(\\\"Dark Yellow : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkYellow));\\n\\n println!(\\\"Blue : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Blue));\\n\\n println!(\\\"Dark Blue : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkBlue));\\n\\n println!(\\\"Magenta : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Magenta));\\n\\n println!(\\\"Dark Magenta : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkMagenta));\\n\\n println!(\\\"Cyan : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Cyan));\\n\\n println!(\\\"Dark Cyan : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkCyan));\\n\\n println!(\\\"Grey : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Grey));\\n\\n println!(\\\"White : \\\\t {}\\\", paint(\\\"■\\\").with(Color::White));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 85,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"#[cfg(unix)]\\n\\npub fn print_font_with_attributes()\\n\\n{\\n\\n println!(\\\"{}\\\", paint(\\\"Normal text\\\"));\\n\\n println!(\\\"{}\\\", paint(\\\"Bold text\\\").bold());\\n\\n println!(\\\"{}\\\", paint(\\\"Italic text\\\").italic());\\n\\n println!(\\\"{}\\\", paint(\\\"Slow blinking text\\\").slow_blink());\\n\\n println!(\\\"{}\\\", paint(\\\"Rapid blinking text\\\").rapid_blink());\\n\\n println!(\\\"{}\\\", paint(\\\"Hidden text\\\").hidden());\\n\\n println!(\\\"{}\\\", paint(\\\"Underlined text\\\").underlined());\\n\\n println!(\\\"{}\\\", paint(\\\"Reversed color\\\").reverse());\\n\\n println!(\\\"{}\\\", paint(\\\"Dim text color\\\").dim());\\n\\n println!(\\\"{}\\\", paint(\\\"Crossed out font\\\").crossed_out());\\n\\n}\\n\\n\\n\\n/// Print all supported rgb colors \\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 86,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"#[cfg(unix)]#[cfg(unix)]\\n\\npub fn print_supported_colors()\\n\\n{ \\n\\n let count = crossterm::crossterm_style::get().get_available_color_count().unwrap();\\n\\n\\n\\n for i in 0..count\\n\\n {\\n\\n println!(\\\"{}\\\", paint(format!(\\\"Color: {}\\\",i)).with(Color::AnsiValue(i as u8)));\\n\\n\\n\\n }\\n\\n}\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 87,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Print all available foreground colors | demonstration.\\n\\npub fn print_all_foreground_colors()\\n\\n{\\n\\n println!(\\\"Black : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Black));\\n\\n println!(\\\"Red : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Red));\\n\\n println!(\\\"Dark Red: \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkRed));\\n\\n println!(\\\"Green : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Green));\\n\\n println!(\\\"Dark Green : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkGreen));\\n\\n println!(\\\"Yellow : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Yellow));\\n\\n println!(\\\"Dark Yellow : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkYellow));\\n\\n println!(\\\"Blue : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Blue));\\n\\n println!(\\\"Dark Blue : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkBlue));\\n\\n println!(\\\"Magenta : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Magenta));\\n\\n println!(\\\"Dark Magenta : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkMagenta));\\n\\n println!(\\\"Cyan : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Cyan));\\n\\n println!(\\\"Dark Cyan : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkCyan));\\n\\n println!(\\\"Grey : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Grey));\\n\\n println!(\\\"White : \\\\t {}\\\", paint(\\\"■\\\").with(Color::White));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.1.0/color/mod.rs\",\n \"rank\": 88,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"#[cfg(unix)]\\n\\npub fn print_supported_colors()\\n\\n{ \\n\\n let count = crossterm::style::color().get_available_color_count().unwrap();\\n\\n\\n\\n for i in 0..count\\n\\n {\\n\\n println!(\\\"{}\\\", paint(format!(\\\"Color: {}\\\",i)).with(Color::AnsiValue(i as u8)));\\n\\n }\\n\\n}\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 89,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Clear all lines from cursor position X:4, Y:4 up | demonstration\\n\\npub fn clear_current_line()\\n\\n{\\n\\n // Get terminal\\n\\n let mut terminal = get();\\n\\n\\n\\n print_test_data();\\n\\n\\n\\n // Set terminal cursor position (see example for more info).\\n\\n crossterm_cursor::get().goto(4,4);\\n\\n\\n\\n // Clear current line cells.\\n\\n terminal.clear(ClearType::CurrentLine);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 90,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Save and reset cursor position.\\n\\npub fn safe_and_reset_position()\\n\\n{\\n\\n let mut cursor = get();\\n\\n \\n\\n // Goto X: 5 Y: 5\\n\\n cursor.goto(5,5);\\n\\n // Safe cursor position: X: 5 Y: 5\\n\\n cursor.safe_position();\\n\\n // Goto X: 5 Y: 20\\n\\n cursor.goto(5,20);\\n\\n // Print at X: 5 Y: 20.\\n\\n print!(\\\"Yea!\\\");\\n\\n // Reset back to X: 5 Y: 5.\\n\\n cursor.reset_position();\\n\\n // Print Back at X: 5 Y: 5.\\n\\n print!(\\\"Back\\\");\\n\\n\\n\\n println!()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/cursor/mod.rs\",\n \"rank\": 91,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Print all available foreground colors | demonstration.\\n\\npub fn print_all_background_colors()\\n\\n{\\n\\n println!(\\\"Black : \\\\t {}\\\", paint(\\\" \\\").on(Color::Black));\\n\\n println!(\\\"Red : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Red));\\n\\n println!(\\\"Dark Red: \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkRed));\\n\\n println!(\\\"Green : \\\\t {}\\\", paint(\\\" \\\").on(Color::Green));\\n\\n println!(\\\"Dark Green : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkGreen));\\n\\n println!(\\\"Yellow : \\\\t {}\\\", paint(\\\" \\\").on(Color::Yellow));\\n\\n println!(\\\"Dark Yellow : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkYellow));\\n\\n println!(\\\"Blue : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Blue));\\n\\n println!(\\\"Dark Blue : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkBlue));\\n\\n println!(\\\"Magenta : \\\\t {}\\\", paint(\\\" \\\").on(Color::Magenta));\\n\\n println!(\\\"Dark Magenta : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkMagenta));\\n\\n println!(\\\"Cyan : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Cyan));\\n\\n println!(\\\"Dark Cyan : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkCyan));\\n\\n println!(\\\"Grey : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Grey));\\n\\n println!(\\\"White : \\\\t {}\\\", paint(\\\" \\\").on(Color::White));\\n\\n}\",\n \"file_path\": \"examples/Crossterm 0.1.0/color/mod.rs\",\n \"rank\": 92,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// print font with fore- background color | demonstration.\\n\\npub fn paint_foreground_and_background()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red font on blue background color\\\");\\n\\n /* Foreground color: \\n\\n Call the method `with()` on the object given by `paint()`\\n\\n Pass in an Color from the Color enum.\\n\\n */\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n /* Background color: \\n\\n Call the method `on()` on the object given by `paint()`\\n\\n Pass in an Color from the Color enum.\\n\\n */\\n\\n styledobject = styledobject.on(Color::Blue);\\n\\n // Print the object to the console and see the result.\\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red font on blue background color\\\").with(Color::Red).on(Color::Blue));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 93,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// print font with fore- background color | demonstration.\\n\\npub fn paint_foreground_and_background()\\n\\n{ \\n\\n // Pass an string to the `paint()` method with you want to paint. \\n\\n // This will give you an object back wits can be styled and displayed.\\n\\n let mut styledobject = paint(\\\"Red font on blue background color\\\");\\n\\n /* Foreground color: \\n\\n Call the method `with()` on the object given by `paint()`\\n\\n Pass in an Color from the Color enum.\\n\\n */\\n\\n styledobject = styledobject.with(Color::Red);\\n\\n /* Background color: \\n\\n Call the method `on()` on the object given by `paint()`\\n\\n Pass in an Color from the Color enum.\\n\\n */\\n\\n styledobject = styledobject.on(Color::Blue);\\n\\n // Print the object to the console and see the result.\\n\\n println!(\\\"{}\\\", styledobject);\\n\\n\\n\\n // Crossterm provides method chaining so that the above points can be inlined.\\n\\n println!(\\\"{}\\\", paint(\\\"Red font on blue background color\\\").with(Color::Red).on(Color::Blue));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 94,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"pub fn print_terminal_size()\\n\\n{\\n\\n // Get terminal \\n\\n let mut terminal = get();\\n\\n // Get terminal size\\n\\n let terminal_size = terminal.terminal_size().unwrap();\\n\\n // Print results\\n\\n print!(\\\"X: {}, y: {}\\\", terminal_size.0, terminal_size.1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/terminal/mod.rs\",\n \"rank\": 95,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Print all available foreground colors | demonstration.\\n\\npub fn print_all_background_colors()\\n\\n{\\n\\n println!(\\\"Black : \\\\t {}\\\", paint(\\\" \\\").on(Color::Black));\\n\\n println!(\\\"Red : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Red));\\n\\n println!(\\\"Dark Red: \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkRed));\\n\\n println!(\\\"Green : \\\\t {}\\\", paint(\\\" \\\").on(Color::Green));\\n\\n println!(\\\"Dark Green : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkGreen));\\n\\n println!(\\\"Yellow : \\\\t {}\\\", paint(\\\" \\\").on(Color::Yellow));\\n\\n println!(\\\"Dark Yellow : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkYellow));\\n\\n println!(\\\"Blue : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Blue));\\n\\n println!(\\\"Dark Blue : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkBlue));\\n\\n println!(\\\"Magenta : \\\\t {}\\\", paint(\\\" \\\").on(Color::Magenta));\\n\\n println!(\\\"Dark Magenta : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkMagenta));\\n\\n println!(\\\"Cyan : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Cyan));\\n\\n println!(\\\"Dark Cyan : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkCyan));\\n\\n println!(\\\"Grey : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Grey));\\n\\n println!(\\\"White : \\\\t {}\\\", paint(\\\" \\\").on(Color::White));\\n\\n #[cfg(unix)]\\n\\n println!(\\\"RGB (10,10,10): \\\\t {}\\\", paint(\\\" \\\").on(Color::Rgb {r: 10, g: 10, b: 10}));\\n\\n #[cfg(unix)]\\n\\n println!(\\\"RGB (10,10,10): \\\\t {}\\\", paint(\\\" \\\").on(Color::AnsiValue(50)));\\n\\n}\\n\\n\\n\\n/// Print font with all available attributes. Note that this can only be used at unix systems and that some are not supported widely | demonstration..\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 96,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Print all available foreground colors | demonstration.\\n\\npub fn print_all_background_colors()\\n\\n{\\n\\n println!(\\\"Black : \\\\t {}\\\", paint(\\\" \\\").on(Color::Black));\\n\\n println!(\\\"Red : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Red));\\n\\n println!(\\\"Dark Red: \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkRed));\\n\\n println!(\\\"Green : \\\\t {}\\\", paint(\\\" \\\").on(Color::Green));\\n\\n println!(\\\"Dark Green : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkGreen));\\n\\n println!(\\\"Yellow : \\\\t {}\\\", paint(\\\" \\\").on(Color::Yellow));\\n\\n println!(\\\"Dark Yellow : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkYellow));\\n\\n println!(\\\"Blue : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Blue));\\n\\n println!(\\\"Dark Blue : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkBlue));\\n\\n println!(\\\"Magenta : \\\\t {}\\\", paint(\\\" \\\").on(Color::Magenta));\\n\\n println!(\\\"Dark Magenta : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkMagenta));\\n\\n println!(\\\"Cyan : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Cyan));\\n\\n println!(\\\"Dark Cyan : \\\\t {}\\\", paint(\\\" \\\").on(Color::DarkCyan));\\n\\n println!(\\\"Grey : \\\\t\\\\t {}\\\", paint(\\\" \\\").on(Color::Grey));\\n\\n println!(\\\"White : \\\\t {}\\\", paint(\\\" \\\").on(Color::White));\\n\\n #[cfg(unix)]\\n\\n println!(\\\"RGB (10,10,10): \\\\t {}\\\", paint(\\\" \\\").on(Color::Rgb {r: 10, g: 10, b: 10}));\\n\\n #[cfg(unix)]\\n\\n println!(\\\"RGB (10,10,10): \\\\t {}\\\", paint(\\\" \\\").on(Color::AnsiValue(50)));\\n\\n}\\n\\n\\n\\n/// Print font with all available attributes. Note that this can only be used at unix systems and that some are not supported widely.\\n\",\n \"file_path\": \"examples/Crossterm 0.2.0/color/mod.rs\",\n \"rank\": 97,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Print all available foreground colors | demonstration.\\n\\npub fn print_all_foreground_colors()\\n\\n{\\n\\n println!(\\\"Black : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Black));\\n\\n println!(\\\"Red : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Red));\\n\\n println!(\\\"Dark Red: \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkRed));\\n\\n println!(\\\"Green : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Green));\\n\\n println!(\\\"Dark Green : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkGreen));\\n\\n println!(\\\"Yellow : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Yellow));\\n\\n println!(\\\"Dark Yellow : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkYellow));\\n\\n println!(\\\"Blue : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Blue));\\n\\n println!(\\\"Dark Blue : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkBlue));\\n\\n println!(\\\"Magenta : \\\\t {}\\\", paint(\\\"■\\\").with(Color::Magenta));\\n\\n println!(\\\"Dark Magenta : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkMagenta));\\n\\n println!(\\\"Cyan : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Cyan));\\n\\n println!(\\\"Dark Cyan : \\\\t {}\\\", paint(\\\"■\\\").with(Color::DarkCyan));\\n\\n println!(\\\"Grey : \\\\t\\\\t {}\\\", paint(\\\"■\\\").with(Color::Grey));\\n\\n println!(\\\"White : \\\\t {}\\\", paint(\\\"■\\\").with(Color::White));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/color/mod.rs\",\n \"rank\": 98,\n \"score\": 134845.79890142137\n },\n {\n \"content\": \"/// Save and reset cursor position | demonstration..\\n\\npub fn safe_and_reset_position()\\n\\n{\\n\\n let context = Terminal::new();\\n\\n let mut cursor = cursor(&context);\\n\\n \\n\\n // Goto X: 5 Y: 5\\n\\n cursor.goto(5,5);\\n\\n // Safe cursor position: X: 5 Y: 5\\n\\n cursor.save_position();\\n\\n // Goto X: 5 Y: 20\\n\\n cursor.goto(5,20);\\n\\n // Print at X: 5 Y: 20.\\n\\n println!(\\\"Yea!\\\");\\n\\n // Reset back to X: 5 Y: 5.\\n\\n cursor.reset_position();\\n\\n // Print Back at X: 5 Y: 5.\\n\\n println!(\\\"Back\\\");\\n\\n\\n\\n println!()\\n\\n}\\n\",\n \"file_path\": \"examples/Crossterm 0.2.1/cursor/mod.rs\",\n \"rank\": 99,\n \"score\": 134845.79890142137\n }\n]","isConversational":false}}},{"rowIdx":1999,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"nrf-softdevice/src/flash.rs"},"repo_name":{"kind":"string","value":"timokroeger/nrf-softdevice"},"commit":{"kind":"string","value":"6a01c4ceb7d1f1d9fc06e74e9a264037ac1159c5"},"file_code":{"kind":"string","value":"use core::future::Future;\nuse core::marker::PhantomData;\nuse core::sync::atomic::{AtomicBool, Ordering};\nuse embassy::traits::flash::Error as FlashError;\n\nuse crate::raw;\nuse crate::util::{DropBomb, Signal};\nuse crate::{RawError, Softdevice};\n\npub struct Flash {\n \n _private: PhantomData<*mut ()>,\n}\n\nstatic FLASH_TAKEN: AtomicBool = AtomicBool::new(false);\n\nimpl Flash {\n const PAGE_SIZE: usize = 4096;\n\n \n \n \n \n \n pub fn take(_sd: &Softdevice) -> Flash {\n if FLASH_TAKEN\n .compare_exchange(false, true, Ordering::AcqRel, Ordering::Acquire)\n .is_err()\n {\n panic!(\"nrf_softdevice::Softdevice::take_flash() called multiple times.\")\n }\n\n Flash {\n _private: PhantomData,\n }\n }\n}\n\nstatic SIGNAL: Signal<Result<(), FlashError>> = Signal::new();\n\npub(crate) fn on_flash_success() {\n SIGNAL.signal(Ok(()))\n}\n\npub(crate) fn on_flash_error() {\n SIGNAL.signal(Err(FlashError::Failed))\n}\n\nimpl embassy::traits::flash::Flash for Flash {\n type ReadFuture<'a> = impl Future<Output = Result<(), FlashError>> + 'a;\n type WriteFuture<'a> = impl Future<Output = Result<(), FlashError>> + 'a;\n type ErasePageFuture<'a> = impl Future<Output = Result<(), FlashError>> + 'a;\n\n fn read<'a>(&'a mut self, address: usize, data: &'a mut [u8]) -> Self::ReadFuture<'a> {\n async move {\n \n \n\n data.copy_from_slice(unsafe {\n core::slice::from_raw_parts(address as *const u8, data.len())\n });\n\n Ok(())\n }\n }\n\n fn write<'a>(&'a mut self, address: usize, data: &'a [u8]) -> Self::WriteFuture<'a> {\n async move {\n let data_ptr = data.as_ptr();\n let data_len = data.len() as u32;\n\n if address % 4 != 0 {\n return Err(FlashError::AddressMisaligned);\n }\n if (data_ptr as u32) % 4 != 0 || data_len % 4 != 0 {\n return Err(FlashError::BufferMisaligned);\n }\n\n \n let words_ptr = data_ptr as *const u32;\n let words_len = data_len / 4;\n\n let bomb = DropBomb::new();\n let ret = unsafe { raw::sd_flash_write(address as _, words_ptr, words_len) };\n let ret = match RawError::convert(ret) {\n Ok(()) => SIGNAL.wait().await,\n Err(_e) => {\n warn!(\"sd_flash_write err {:?}\", _e);\n Err(FlashError::Failed)\n }\n };\n\n bomb.defuse();\n ret\n }\n }\n\n fn erase<'a>(&'a mut self, address: usize) -> Self::ErasePageFuture<'a> {\n async move {\n if address % Self::PAGE_SIZE != 0 {\n return Err(FlashError::AddressMisaligned);\n }\n\n let page_number = address / Self::PAGE_SIZE;\n\n let bomb = DropBomb::new();\n let ret = unsafe { raw::sd_flash_page_erase(page_number as u32) };\n let ret = match RawError::convert(ret) {\n Ok(()) => SIGNAL.wait().await,\n Err(_e) => {\n warn!(\"sd_flash_page_erase err {:?}\", _e);\n Err(FlashError::Failed)\n }\n };\n\n bomb.defuse();\n ret\n }\n }\n\n fn size(&self) -> usize {\n 256 * 4096\n }\n\n fn read_size(&self) -> usize {\n 1\n }\n\n fn write_size(&self) -> usize {\n 4\n }\n\n fn erase_size(&self) -> usize {\n 4096\n }\n}\n"},"prefix":{"kind":"string","value":"use core::future::Future;\nuse core::marker::PhantomData;\nuse core::sync::atomic::{AtomicBool, Ordering};\nuse embassy::traits::flash::Error as FlashError;\n\nuse crate::raw;\nuse crate::util::{DropBomb, Signal};\nuse crate::{RawError, Softdevice};\n\npub struct Flash {\n \n _private: PhantomData<*mut ()>,\n}\n\nstatic FLASH_TAKEN: AtomicBool = AtomicBool::new(false);\n\nimpl Flash {\n const PAGE_SIZE: usize = 4096;\n\n \n \n \n \n \n pub fn take(_sd: &Softdevice) -> Flash {\n if FLASH_TAKEN\n .compare_exchange(false, true, Order"},"suffix":{"kind":"string","value":"a.as_ptr();\n let data_len = data.len() as u32;\n\n if address % 4 != 0 {\n return Err(FlashError::AddressMisaligned);\n }\n if (data_ptr as u32) % 4 != 0 || data_len % 4 != 0 {\n return Err(FlashError::BufferMisaligned);\n }\n\n \n let words_ptr = data_ptr as *const u32;\n let words_len = data_len / 4;\n\n let bomb = DropBomb::new();\n let ret = unsafe { raw::sd_flash_write(address as _, words_ptr, words_len) };\n let ret = match RawError::convert(ret) {\n Ok(()) => SIGNAL.wait().await,\n Err(_e) => {\n warn!(\"sd_flash_write err {:?}\", _e);\n Err(FlashError::Failed)\n }\n };\n\n bomb.defuse();\n ret\n }\n }\n\n fn erase<'a>(&'a mut self, address: usize) -> Self::ErasePageFuture<'a> {\n async move {\n if address % Self::PAGE_SIZE != 0 {\n return Err(FlashError::AddressMisaligned);\n }\n\n let page_number = address / Self::PAGE_SIZE;\n\n let bomb = DropBomb::new();\n let ret = unsafe { raw::sd_flash_page_erase(page_number as u32) };\n let ret = match RawError::convert(ret) {\n Ok(()) => SIGNAL.wait().await,\n Err(_e) => {\n warn!(\"sd_flash_page_erase err {:?}\", _e);\n Err(FlashError::Failed)\n }\n };\n\n bomb.defuse();\n ret\n }\n }\n\n fn size(&self) -> usize {\n 256 * 4096\n }\n\n fn read_size(&self) -> usize {\n 1\n }\n\n fn write_size(&self) -> usize {\n 4\n }\n\n fn erase_size(&self) -> usize {\n 4096\n }\n}\n"},"middle":{"kind":"string","value":"ing::AcqRel, Ordering::Acquire)\n .is_err()\n {\n panic!(\"nrf_softdevice::Softdevice::take_flash() called multiple times.\")\n }\n\n Flash {\n _private: PhantomData,\n }\n }\n}\n\nstatic SIGNAL: Signal<Result<(), FlashError>> = Signal::new();\n\npub(crate) fn on_flash_success() {\n SIGNAL.signal(Ok(()))\n}\n\npub(crate) fn on_flash_error() {\n SIGNAL.signal(Err(FlashError::Failed))\n}\n\nimpl embassy::traits::flash::Flash for Flash {\n type ReadFuture<'a> = impl Future<Output = Result<(), FlashError>> + 'a;\n type WriteFuture<'a> = impl Future<Output = Result<(), FlashError>> + 'a;\n type ErasePageFuture<'a> = impl Future<Output = Result<(), FlashError>> + 'a;\n\n fn read<'a>(&'a mut self, address: usize, data: &'a mut [u8]) -> Self::ReadFuture<'a> {\n async move {\n \n \n\n data.copy_from_slice(unsafe {\n core::slice::from_raw_parts(address as *const u8, data.len())\n });\n\n Ok(())\n }\n }\n\n fn write<'a>(&'a mut self, address: usize, data: &'a [u8]) -> Self::WriteFuture<'a> {\n async move {\n let data_ptr = dat"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn gen_bindings(\n\n tmp_dir: &PathBuf,\n\n src_dir: &PathBuf,\n\n dst: &PathBuf,\n\n mut f: impl FnMut(String) -> String,\n\n) {\n\n let mut wrapper = String::new();\n\n\n\n for entry in WalkDir::new(src_dir)\n\n .follow_links(true)\n\n .into_iter()\n\n .filter_map(|e| e.ok())\n\n {\n\n let _f_name = entry.path().to_string_lossy();\n\n if entry.file_type().is_file() {\n\n if entry.file_name().to_string_lossy() == \"nrf_nvic.h\" {\n\n continue;\n\n }\n\n\n\n let data = fs::read_to_string(entry.path()).unwrap();\n","file_path":"nrf-softdevice-gen/src/main.rs","rank":0,"score":170181.4076460192},{"content":"/// This will fail if an indication is already in progress\n\npub fn indicate_value(\n\n conn: &Connection,\n\n handle: u16,\n\n val: &[u8],\n\n) -> Result<(), IndicateValueError> {\n\n let conn_handle = conn.with_state(|state| state.check_connected())?;\n\n\n\n let mut len: u16 = val.len() as _;\n\n let params = raw::ble_gatts_hvx_params_t {\n\n handle,\n\n type_: raw::BLE_GATT_HVX_INDICATION as u8,\n\n offset: 0,\n\n p_data: val.as_ptr() as _,\n\n p_len: &mut len,\n\n };\n\n let ret = unsafe { raw::sd_ble_gatts_hvx(conn_handle, ¶ms) };\n\n RawError::convert(ret)?;\n\n\n\n Ok(())\n\n}\n","file_path":"nrf-softdevice/src/ble/gatt_server.rs","rank":1,"score":167974.44711971324},{"content":"pub fn try_write_without_response(\n\n conn: &Connection,\n\n handle: u16,\n\n buf: &[u8],\n\n) -> Result<(), TryWriteError> {\n\n let conn_handle = conn.with_state(|state| state.check_connected())?;\n\n\n\n assert!(buf.len() <= u16::MAX as usize);\n\n let params = raw::ble_gattc_write_params_t {\n\n write_op: raw::BLE_GATT_OP_WRITE_CMD as u8,\n\n flags: 0,\n\n handle,\n\n p_value: buf.as_ptr(),\n\n len: buf.len() as u16,\n\n offset: 0,\n\n };\n\n\n\n let ret = unsafe { raw::sd_ble_gattc_write(conn_handle, ¶ms) };\n\n match RawError::convert(ret) {\n\n Err(RawError::Resources) => Err(TryWriteError::BufferFull),\n","file_path":"nrf-softdevice/src/ble/gatt_client.rs","rank":2,"score":163827.65160015525},{"content":"pub fn get_value(_sd: &Softdevice, handle: u16, buf: &mut [u8]) -> Result<usize, GetValueError> {\n\n let mut value = raw::ble_gatts_value_t {\n\n p_value: buf.as_mut_ptr(),\n\n len: buf.len() as _,\n\n offset: 0,\n\n };\n\n let ret = unsafe {\n\n raw::sd_ble_gatts_value_get(raw::BLE_CONN_HANDLE_INVALID as u16, handle, &mut value)\n\n };\n\n RawError::convert(ret)?;\n\n\n\n if value.len as usize > buf.len() {\n\n return Err(GetValueError::Truncated);\n\n }\n\n\n\n Ok(value.len as _)\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\n\n#[cfg_attr(feature = \"defmt\", derive(defmt::Format))]\n","file_path":"nrf-softdevice/src/ble/gatt_server.rs","rank":3,"score":149357.73479287088},{"content":"struct CriticalSection;\n\ncritical_section::custom_impl!(CriticalSection);\n\n\n\nunsafe impl critical_section::Impl for CriticalSection {\n\n unsafe fn acquire() -> u8 {\n\n let nvic = &*NVIC::ptr();\n\n let nested_cs = CS_FLAG.load(Ordering::SeqCst);\n\n\n\n if !nested_cs {\n\n raw_critical_section(|| {\n\n CS_FLAG.store(true, Ordering::Relaxed);\n\n\n\n // Store the state of irqs.\n\n CS_MASK = nvic.icer[0].read();\n\n\n\n // Disable only not-reserved irqs.\n\n nvic.icer[0].write(!RESERVED_IRQS);\n\n });\n\n }\n\n\n","file_path":"nrf-softdevice/src/critical_section_impl.rs","rank":4,"score":145195.97183402212},{"content":"pub fn get_address(_sd: &Softdevice) -> Address {\n\n unsafe {\n\n let mut addr: raw::ble_gap_addr_t = mem::zeroed();\n\n let ret = raw::sd_ble_gap_addr_get(&mut addr);\n\n unwrap!(RawError::convert(ret), \"sd_ble_gap_addr_get\");\n\n Address::from_raw(addr)\n\n }\n\n}\n\n\n","file_path":"nrf-softdevice/src/ble/mod.rs","rank":5,"score":143428.6816769865},{"content":"fn on_user_mem_release(_ble_evt: *const raw::ble_evt_t) {\n\n trace!(\"on_user_mem_release\");\n\n}\n","file_path":"nrf-softdevice/src/ble/common.rs","rank":6,"score":137837.25508474058},{"content":"fn on_user_mem_request(_ble_evt: *const raw::ble_evt_t) {\n\n trace!(\"on_user_mem_request\");\n\n}\n","file_path":"nrf-softdevice/src/ble/common.rs","rank":7,"score":137837.25508474058},{"content":"pub fn set_address(_sd: &Softdevice, addr: &Address) {\n\n unsafe {\n\n let addr = addr.into_raw();\n\n let ret = raw::sd_ble_gap_addr_set(&addr);\n\n unwrap!(RawError::convert(ret), \"sd_ble_gap_addr_set\");\n\n }\n\n}\n","file_path":"nrf-softdevice/src/ble/mod.rs","rank":8,"score":137247.5029404512},{"content":"struct WaitFuture<'a, T> {\n\n signal: &'a Signal<T>,\n\n}\n\n\n\nimpl<'a, T: Send> Future for WaitFuture<'a, T> {\n\n type Output = T;\n\n\n\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<T> {\n\n unsafe {\n\n cortex_m::interrupt::free(|_| {\n\n let state = &mut *self.signal.state.get();\n\n match state {\n\n State::None => {\n\n *state = State::Waiting(cx.waker().clone());\n\n Poll::Pending\n\n }\n\n State::Waiting(w) if w.will_wake(cx.waker()) => Poll::Pending,\n\n State::Waiting(_) => panic!(\"waker overflow\"),\n\n State::Signaled(_) => match mem::replace(state, State::None) {\n\n State::Signaled(res) => Poll::Ready(res),\n\n _ => unreachable!(),\n\n },\n\n }\n\n })\n\n }\n\n }\n\n}\n","file_path":"nrf-softdevice/src/util/signal.rs","rank":9,"score":134814.41362903753},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":10,"score":130567.24995010582},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":11,"score":130567.24995010582},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":12,"score":130567.24995010582},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":13,"score":130567.24995010582},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":14,"score":130567.24995010582},{"content":"fn index_by_handle(conn_handle: u16) -> &'static Cell<Option<u8>> {\n\n unsafe { &INDEX_BY_HANDLE[conn_handle as usize] }\n\n}\n","file_path":"nrf-softdevice/src/ble/connection.rs","rank":15,"score":130104.29820291008},{"content":"/// Get temperature reading in Celsius\n\n///\n\n/// Note this blocks for ~50us\n\npub fn temperature_celsius(_sd: &Softdevice) -> Result<I30F2, TempError> {\n\n let mut temp: i32 = 0;\n\n let ret = unsafe { raw::sd_temp_get(&mut temp) };\n\n RawError::convert(ret)?;\n\n Ok(I30F2::from_bits(temp))\n\n}\n","file_path":"nrf-softdevice/src/temperature.rs","rank":16,"score":130068.74125258872},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":17,"score":127158.72000604431},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":18,"score":127158.72000604431},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":19,"score":127158.72000604431},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":20,"score":127158.72000604431},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":21,"score":127158.72000604431},{"content":"#[proc_macro_attribute]\n\npub fn gatt_server(_args: TokenStream, item: TokenStream) -> TokenStream {\n\n let mut struc = syn::parse_macro_input!(item as syn::ItemStruct);\n\n\n\n let struct_fields = match &mut struc.fields {\n\n syn::Fields::Named(n) => n,\n\n _ => {\n\n struc\n\n .ident\n\n .span()\n\n .unwrap()\n\n .error(\"gatt_server structs must have named fields, not tuples.\")\n\n .emit();\n\n return TokenStream::new();\n\n }\n\n };\n\n let fields = struct_fields\n\n .named\n\n .iter()\n\n .cloned()\n\n .collect::<Vec<syn::Field>>();\n","file_path":"nrf-softdevice-macro/src/lib.rs","rank":22,"score":126660.14978410889},{"content":"#[proc_macro_attribute]\n\npub fn gatt_service(args: TokenStream, item: TokenStream) -> TokenStream {\n\n let args = syn::parse_macro_input!(args as syn::AttributeArgs);\n\n let mut struc = syn::parse_macro_input!(item as syn::ItemStruct);\n\n\n\n let args = match ServiceArgs::from_list(&args) {\n\n Ok(v) => v,\n\n Err(e) => {\n\n return e.write_errors().into();\n\n }\n\n };\n\n\n\n let mut chars = Vec::new();\n\n\n\n let struct_fields = match &mut struc.fields {\n\n syn::Fields::Named(n) => n,\n\n _ => {\n\n struc\n\n .ident\n\n .span()\n\n .unwrap()\n","file_path":"nrf-softdevice-macro/src/lib.rs","rank":23,"score":126660.14978410889},{"content":"#[proc_macro_attribute]\n\npub fn gatt_client(args: TokenStream, item: TokenStream) -> TokenStream {\n\n let args = syn::parse_macro_input!(args as syn::AttributeArgs);\n\n let mut struc = syn::parse_macro_input!(item as syn::ItemStruct);\n\n\n\n let args = match ServiceArgs::from_list(&args) {\n\n Ok(v) => v,\n\n Err(e) => {\n\n return e.write_errors().into();\n\n }\n\n };\n\n\n\n let mut chars = Vec::new();\n\n\n\n let struct_fields = match &mut struc.fields {\n\n syn::Fields::Named(n) => n,\n\n _ => {\n\n struc\n\n .ident\n\n .span()\n\n .unwrap()\n","file_path":"nrf-softdevice-macro/src/lib.rs","rank":24,"score":126660.14978410889},{"content":"fn allocate_index<T>(f: impl FnOnce(u8, &mut ConnectionState) -> T) -> Result<T, OutOfConnsError> {\n\n unsafe {\n\n for (i, s) in STATES.iter().enumerate() {\n\n let state = &mut *s.get();\n\n if state.refcount == 0 && state.conn_handle.is_none() {\n\n return Ok(f(i as u8, state));\n\n }\n\n }\n\n Err(OutOfConnsError)\n\n }\n\n}\n\n\n\n// conn_handle -> index mapping. Used to make stuff go faster\n\nconst INDEX_NONE: Cell<Option<u8>> = Cell::new(None);\n\nstatic mut INDEX_BY_HANDLE: [Cell<Option<u8>>; CONNS_MAX] = [INDEX_NONE; CONNS_MAX];\n\n\n","file_path":"nrf-softdevice/src/ble/connection.rs","rank":25,"score":125311.61893603088},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":26,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":27,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":28,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":29,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":30,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":31,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":32,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":33,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":34,"score":123991.19772611704},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\n\n ),\n\n 4usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":35,"score":123991.19772611704},{"content":"/// Get cryptographically-securerandom bytes.\n\npub fn random_bytes(_sd: &Softdevice, buf: &mut [u8]) -> Result<(), RandomError> {\n\n if buf.len() > u8::MAX as usize {\n\n return Err(RandomError::BufferTooBig);\n\n }\n\n\n\n let ret = unsafe { raw::sd_rand_application_vector_get(buf[..].as_mut_ptr(), buf.len() as u8) };\n\n match RawError::convert(ret) {\n\n Ok(()) => Ok(()),\n\n Err(RawError::SocRandNotEnoughValues) => Err(RandomError::NotEnoughEntropy),\n\n Err(e) => Err(e.into()),\n\n }\n\n}\n","file_path":"nrf-softdevice/src/random.rs","rank":36,"score":122877.26364579838},{"content":"pub fn register<S: Server>(sd: &Softdevice) -> Result<S, RegisterError> {\n\n S::register(sd)\n\n}\n\n\n","file_path":"nrf-softdevice/src/ble/gatt_server.rs","rank":37,"score":121204.78150112252},{"content":"pub fn register_service<S: Service>(_sd: &Softdevice) -> Result<S, RegisterError> {\n\n let uuid = S::uuid();\n\n let mut service_handle: u16 = 0;\n\n let ret = unsafe {\n\n raw::sd_ble_gatts_service_add(\n\n raw::BLE_GATTS_SRVC_TYPE_PRIMARY as u8,\n\n uuid.as_raw_ptr(),\n\n &mut service_handle as _,\n\n )\n\n };\n\n RawError::convert(ret)?;\n\n\n\n S::register(service_handle, |char, initial_value| {\n\n let mut cccd_attr_md: raw::ble_gatts_attr_md_t = unsafe { mem::zeroed() };\n\n cccd_attr_md.read_perm = raw::ble_gap_conn_sec_mode_t {\n\n _bitfield_1: raw::ble_gap_conn_sec_mode_t::new_bitfield_1(1, 1),\n\n };\n\n cccd_attr_md.write_perm = raw::ble_gap_conn_sec_mode_t {\n\n _bitfield_1: raw::ble_gap_conn_sec_mode_t::new_bitfield_1(1, 1),\n\n };\n","file_path":"nrf-softdevice/src/ble/gatt_server.rs","rank":38,"score":119592.49164209625},{"content":"pub fn set_value(_sd: &Softdevice, handle: u16, val: &[u8]) -> Result<(), SetValueError> {\n\n let mut value = raw::ble_gatts_value_t {\n\n p_value: val.as_ptr() as _,\n\n len: val.len() as _,\n\n offset: 0,\n\n };\n\n let ret = unsafe {\n\n raw::sd_ble_gatts_value_set(raw::BLE_CONN_HANDLE_INVALID as u16, handle, &mut value)\n\n };\n\n RawError::convert(ret)?;\n\n\n\n Ok(())\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\n\n#[cfg_attr(feature = \"defmt\", derive(defmt::Format))]\n\npub enum NotifyValueError {\n\n Disconnected,\n\n Raw(RawError),\n\n}\n","file_path":"nrf-softdevice/src/ble/gatt_server.rs","rank":39,"score":114369.21208366963},{"content":"/// Multiple notifications can be queued. Will fail when the queue is full.\n\npub fn notify_value(conn: &Connection, handle: u16, val: &[u8]) -> Result<(), NotifyValueError> {\n\n let conn_handle = conn.with_state(|state| state.check_connected())?;\n\n\n\n let mut len: u16 = val.len() as _;\n\n let params = raw::ble_gatts_hvx_params_t {\n\n handle,\n\n type_: raw::BLE_GATT_HVX_NOTIFICATION as u8,\n\n offset: 0,\n\n p_data: val.as_ptr() as _,\n\n p_len: &mut len,\n\n };\n\n let ret = unsafe { raw::sd_ble_gatts_hvx(conn_handle, ¶ms) };\n\n RawError::convert(ret)?;\n\n\n\n Ok(())\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\n\n#[cfg_attr(feature = \"defmt\", derive(defmt::Format))]\n\npub enum IndicateValueError {\n","file_path":"nrf-softdevice/src/ble/gatt_server.rs","rank":40,"score":114369.21208366963},{"content":"fn main() {\n\n // Put `memory.x` in our output directory and ensure it's\n\n // on the linker search path.\n\n let out = &PathBuf::from(env::var_os(\"OUT_DIR\").unwrap());\n\n File::create(out.join(\"memory.x\"))\n\n .unwrap()\n\n .write_all(include_bytes!(\"memory.x\"))\n\n .unwrap();\n\n println!(\"cargo:rustc-link-search={}\", out.display());\n\n\n\n // By default, Cargo will re-run a build script whenever\n\n // any file in the project changes. By specifying `memory.x`\n\n // here, we ensure the build script is only re-run when\n\n // `memory.x` is changed.\n\n println!(\"cargo:rerun-if-changed=memory.x\");\n\n\n\n println!(\"cargo:rustc-link-arg-bins=--nmagic\");\n\n println!(\"cargo:rustc-link-arg-bins=-Tlink.x\");\n\n println!(\"cargo:rustc-link-arg-bins=-Tdefmt.x\");\n\n}\n","file_path":"examples/build.rs","rank":41,"score":95890.43423180413},{"content":"#[derive(Debug)]\n\nstruct Characteristic {\n\n name: String,\n\n ty: syn::Type,\n\n args: CharacteristicArgs,\n\n span: Span,\n\n vis: syn::Visibility,\n\n}\n\n\n","file_path":"nrf-softdevice-macro/src/lib.rs","rank":42,"score":94633.16399057483},{"content":"#[derive(Debug, FromMeta)]\n\nstruct ServiceArgs {\n\n uuid: Uuid,\n\n}\n","file_path":"nrf-softdevice-macro/src/lib.rs","rank":43,"score":93419.42663022527},{"content":"#[derive(Debug, FromMeta)]\n\nstruct CharacteristicArgs {\n\n uuid: Uuid,\n\n #[darling(default)]\n\n read: bool,\n\n #[darling(default)]\n\n write: bool,\n\n #[darling(default)]\n\n notify: bool,\n\n #[darling(default)]\n\n indicate: bool,\n\n}\n\n\n","file_path":"nrf-softdevice-macro/src/lib.rs","rank":44,"score":93419.42663022527},{"content":"#[defmt::global_logger]\n\nstruct Logger;\n\n\n\n/// Global logger lock.\n\nstatic TAKEN: AtomicBool = AtomicBool::new(false);\n\nstatic INTERRUPTS_TOKEN: AtomicU8 = AtomicU8::new(0);\n\nstatic mut ENCODER: defmt::Encoder = defmt::Encoder::new();\n\n\n\nunsafe impl defmt::Logger for Logger {\n\n fn acquire() {\n\n let token = unsafe { critical_section::acquire() };\n\n\n\n if !TAKEN.load(Ordering::Relaxed) {\n\n // no need for CAS because interrupts are disabled\n\n TAKEN.store(true, Ordering::Relaxed);\n\n\n\n INTERRUPTS_TOKEN.store(token, Ordering::Relaxed);\n\n\n\n // safety: accessing the `static mut` is OK because we have disabled interrupts.\n\n unsafe { ENCODER.start_frame(do_write) }\n\n } else {\n","file_path":"nrf-softdevice-defmt-rtt/src/lib.rs","rank":45,"score":93419.42663022527},{"content":"#[repr(C)]\n\nstruct Header {\n\n id: [u8; 16],\n\n max_up_channels: usize,\n\n max_down_channels: usize,\n\n up_channel: Channel,\n\n}\n\n\n\nconst MODE_MASK: usize = 0b11;\n\n/// Block the application if the RTT buffer is full, wait for the host to read data.\n\nconst MODE_BLOCK_IF_FULL: usize = 2;\n\n/// Don't block if the RTT buffer is full. Truncate data to output as much as fits.\n\nconst MODE_NON_BLOCKING_TRIM: usize = 1;\n\n\n\n// TODO make configurable\n\n// NOTE use a power of 2 for best performance\n\nconst SIZE: usize = 1024;\n\n\n\n// make sure we only get shared references to the header/channel (avoid UB)\n\n/// # Safety\n\n/// `Channel` API is not re-entrant; this handle should not be held from different execution\n","file_path":"nrf-softdevice-defmt-rtt/src/lib.rs","rank":46,"score":93419.42663022527},{"content":"fn main() {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n let src_dir = PathBuf::from(&args[1]);\n\n let dst_path = PathBuf::from(&args[2]);\n\n\n\n let tmp_dir = PathBuf::from(\"./tmp\");\n\n let tmp_bindings_path = tmp_dir.join(\"bindings.rs\");\n\n\n\n let _ = fs::remove_dir_all(&tmp_dir);\n\n fs::create_dir_all(&tmp_dir).unwrap();\n\n\n\n gen_bindings(&tmp_dir, &src_dir, &tmp_bindings_path, |data| {\n\n let re = Regex::new(r\"SVCALL\\((?P<svc>[A-Za-z0-9_]+),\\s*(?P<ret>[A-Za-z0-9_]+),\\s*(?P<name>[A-Za-z0-9_]+)\\((?P<args>.*)\\)\\);\").unwrap();\n\n re.replace_all(&data, \"uint32_t __svc_$name = $svc;\").into()\n\n });\n\n\n\n let mut svc_nums = HashMap::new();\n\n\n\n let data = fs::read_to_string(&tmp_bindings_path).unwrap();\n","file_path":"nrf-softdevice-gen/src/main.rs","rank":47,"score":91964.55743749501},{"content":"fn assert_thread_mode() {\n\n assert!(\n\n cortex_m::peripheral::SCB::vect_active()\n\n == cortex_m::peripheral::scb::VectActive::ThreadMode,\n\n \"portals are not usable from interrupts\"\n\n );\n\n}\n\n\n\nimpl<T> Portal<T> {\n\n pub const fn new() -> Self {\n\n Self {\n\n state: UnsafeCell::new(State::None),\n\n }\n\n }\n\n\n\n pub fn call(&self, val: T) -> bool {\n\n assert_thread_mode();\n\n\n\n // safety: this runs from thread mode\n\n unsafe {\n","file_path":"nrf-softdevice/src/util/portal.rs","rank":48,"score":89628.30017086875},{"content":"pub trait Try {\n\n type Ok;\n\n type Error;\n\n fn into_result(self) -> Result<Self::Ok, Self::Error>;\n\n}\n\n\n\nimpl<T> Try for Option<T> {\n\n type Ok = T;\n\n type Error = NoneError;\n\n\n\n #[inline]\n\n fn into_result(self) -> Result<T, NoneError> {\n\n self.ok_or(NoneError)\n\n }\n\n}\n\n\n\nimpl<T, E> Try for Result<T, E> {\n\n type Ok = T;\n\n type Error = E;\n\n\n\n #[inline]\n\n fn into_result(self) -> Self {\n\n self\n\n }\n\n}\n","file_path":"nrf-softdevice/src/fmt.rs","rank":49,"score":88629.852360945},{"content":"#[test]\n\nfn bindgen_test_layout_ble_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_evt_t>(),\n\n 48usize,\n\n concat!(\"Size of: \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_evt_t),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":50,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_cfg_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_cfg_t>(),\n\n 12usize,\n\n concat!(\"Size of: \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_cfg_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_cfg_t),\n\n \"::\",\n\n stringify!(conn_cfg)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":51,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_version_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_version_t>(),\n\n 6usize,\n\n concat!(\"Size of: \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_version_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_version_t),\n\n \"::\",\n\n stringify!(version_number)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":52,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_evt_t>(),\n\n 44usize,\n\n concat!(\"Size of: \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_evt_t),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":53,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid_t>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":54,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_opt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_opt_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_opt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_opt_t),\n\n \"::\",\n\n stringify!(common_opt)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":55,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_data_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_data_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_data_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_data_t),\n\n \"::\",\n\n stringify!(p_data)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":56,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid128_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid128_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid128_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid128_t),\n\n \"::\",\n\n stringify!(uuid128)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":57,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_version_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_version_t>(),\n\n 6usize,\n\n concat!(\"Size of: \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_version_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_version_t),\n\n \"::\",\n\n stringify!(version_number)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":58,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_opt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_opt_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_opt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_opt_t),\n\n \"::\",\n\n stringify!(common_opt)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":59,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_version_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_version_t>(),\n\n 6usize,\n\n concat!(\"Size of: \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_version_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_version_t),\n\n \"::\",\n\n stringify!(version_number)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":60,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid_t>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":61,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_data_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_data_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_data_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_data_t),\n\n \"::\",\n\n stringify!(p_data)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":62,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_data_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_data_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_data_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_data_t),\n\n \"::\",\n\n stringify!(p_data)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":63,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_opt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_opt_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_opt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_opt_t),\n\n \"::\",\n\n stringify!(common_opt)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":64,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_cfg_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_cfg_t>(),\n\n 12usize,\n\n concat!(\"Size of: \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_cfg_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_cfg_t),\n\n \"::\",\n\n stringify!(conn_cfg)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":65,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_data_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_data_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_data_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_data_t),\n\n \"::\",\n\n stringify!(p_data)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":66,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_opt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_opt_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_opt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_opt_t),\n\n \"::\",\n\n stringify!(common_opt)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":67,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_cfg_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_cfg_t>(),\n\n 12usize,\n\n concat!(\"Size of: \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_cfg_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_cfg_t),\n\n \"::\",\n\n stringify!(conn_cfg)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":68,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_opt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_opt_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_opt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_opt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_opt_t),\n\n \"::\",\n\n stringify!(common_opt)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":69,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid_t>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":70,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_evt_t>(),\n\n 48usize,\n\n concat!(\"Size of: \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_evt_t),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":71,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_version_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_version_t>(),\n\n 6usize,\n\n concat!(\"Size of: \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_version_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_version_t),\n\n \"::\",\n\n stringify!(version_number)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":72,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_evt_t>(),\n\n 48usize,\n\n concat!(\"Size of: \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_evt_t),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":73,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_data_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_data_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_data_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_data_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_data_t),\n\n \"::\",\n\n stringify!(p_data)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":74,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_cfg_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_cfg_t>(),\n\n 12usize,\n\n concat!(\"Size of: \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_cfg_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_cfg_t),\n\n \"::\",\n\n stringify!(conn_cfg)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":75,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid128_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid128_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid128_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid128_t),\n\n \"::\",\n\n stringify!(uuid128)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":76,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_cfg_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_cfg_t>(),\n\n 12usize,\n\n concat!(\"Size of: \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_cfg_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_cfg_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_cfg_t),\n\n \"::\",\n\n stringify!(conn_cfg)\n\n )\n","file_path":"nrf-softdevice-s122/src/bindings.rs","rank":77,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid_t>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":78,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid128_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid128_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid128_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid128_t),\n\n \"::\",\n\n stringify!(uuid128)\n\n )\n","file_path":"nrf-softdevice-s113/src/bindings.rs","rank":79,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_evt_t>(),\n\n 44usize,\n\n concat!(\"Size of: \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_evt_t),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":80,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid_t>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":81,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid128_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid128_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid128_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid128_t),\n\n \"::\",\n\n stringify!(uuid128)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":82,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_version_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_version_t>(),\n\n 6usize,\n\n concat!(\"Size of: \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_version_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_version_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_version_t),\n\n \"::\",\n\n stringify!(version_number)\n\n )\n","file_path":"nrf-softdevice-s140/src/bindings.rs","rank":83,"score":87484.4410230175},{"content":"#[test]\n\nfn bindgen_test_layout_ble_uuid128_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_uuid128_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_uuid128_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_uuid128_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_uuid128_t),\n\n \"::\",\n\n stringify!(uuid128)\n\n )\n","file_path":"nrf-softdevice-s112/src/bindings.rs","rank":84,"score":87484.4410230175},{"content":"struct RawAdvertisement<'a> {\n\n kind: u8,\n\n adv_data: Option<&'a [u8]>,\n\n scan_data: Option<&'a [u8]>,\n\n}\n\n\n\n/// Connectable advertisement types, which can accept connections from interested Central devices.\n\npub enum ConnectableAdvertisement<'a> {\n\n ScannableUndirected {\n\n adv_data: &'a [u8],\n\n scan_data: &'a [u8],\n\n },\n\n NonscannableDirected {\n\n scan_data: &'a [u8],\n\n },\n\n NonscannableDirectedHighDuty {\n\n scan_data: &'a [u8],\n\n },\n\n #[cfg(any(feature = \"s132\", feature = \"s140\"))]\n\n ExtendedNonscannableUndirected {\n","file_path":"nrf-softdevice/src/ble/peripheral.rs","rank":85,"score":87450.5347940551},{"content":"#[test]\n\nfn bindgen_test_layout_nrf_radio_request_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<nrf_radio_request_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(nrf_radio_request_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<nrf_radio_request_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(nrf_radio_request_t))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::core::ptr::null::<nrf_radio_request_t>())).request_type as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(nrf_radio_request_t),\n\n \"::\",\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":86,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gattc_desc_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gattc_desc_t>(),\n\n 6usize,\n\n concat!(\"Size of: \", stringify!(ble_gattc_desc_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gattc_desc_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_gattc_desc_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gattc_desc_t>())).handle as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gattc_desc_t),\n\n \"::\",\n\n stringify!(handle)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":87,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gap_irk_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gap_irk_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_gap_irk_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gap_irk_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_gap_irk_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gap_irk_t>())).irk as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gap_irk_t),\n\n \"::\",\n\n stringify!(irk)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":88,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gattc_include_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gattc_include_t>(),\n\n 10usize,\n\n concat!(\"Size of: \", stringify!(ble_gattc_include_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gattc_include_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_gattc_include_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gattc_include_t>())).handle as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gattc_include_t),\n\n \"::\",\n\n stringify!(handle)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":89,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gattc_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gattc_evt_t>(),\n\n 14usize,\n\n concat!(\"Size of: \", stringify!(ble_gattc_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gattc_evt_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_gattc_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gattc_evt_t>())).conn_handle as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gattc_evt_t),\n\n \"::\",\n\n stringify!(conn_handle)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":90,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gap_addr_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gap_addr_t>(),\n\n 7usize,\n\n concat!(\"Size of: \", stringify!(ble_gap_addr_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gap_addr_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_gap_addr_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gap_addr_t>())).addr as *const _ as usize },\n\n 1usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gap_addr_t),\n\n \"::\",\n\n stringify!(addr)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":91,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gap_cfg_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gap_cfg_t>(),\n\n 12usize,\n\n concat!(\"Size of: \", stringify!(ble_gap_cfg_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gap_cfg_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_gap_cfg_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gap_cfg_t>())).role_count_cfg as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gap_cfg_t),\n\n \"::\",\n\n stringify!(role_count_cfg)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":92,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gap_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gap_evt_t>(),\n\n 44usize,\n\n concat!(\"Size of: \", stringify!(ble_gap_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gap_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_gap_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gap_evt_t>())).conn_handle as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gap_evt_t),\n\n \"::\",\n\n stringify!(conn_handle)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":93,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_l2cap_evt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_l2cap_evt_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(ble_l2cap_evt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_l2cap_evt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_l2cap_evt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_l2cap_evt_t>())).conn_handle as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_l2cap_evt_t),\n\n \"::\",\n\n stringify!(conn_handle)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":94,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_sd_mbr_command_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<sd_mbr_command_t>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(sd_mbr_command_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<sd_mbr_command_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(sd_mbr_command_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<sd_mbr_command_t>())).command as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(sd_mbr_command_t),\n\n \"::\",\n\n stringify!(command)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":95,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gap_phys_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gap_phys_t>(),\n\n 2usize,\n\n concat!(\"Size of: \", stringify!(ble_gap_phys_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gap_phys_t>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(ble_gap_phys_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gap_phys_t>())).tx_phys as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gap_phys_t),\n\n \"::\",\n\n stringify!(tx_phys)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":96,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gattc_service_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gattc_service_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_gattc_service_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gattc_service_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_gattc_service_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gattc_service_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gattc_service_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":97,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gap_opt_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gap_opt_t>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(ble_gap_opt_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gap_opt_t>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(ble_gap_opt_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gap_opt_t>())).ch_map as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gap_opt_t),\n\n \"::\",\n\n stringify!(ch_map)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":98,"score":86477.38342016209},{"content":"#[test]\n\nfn bindgen_test_layout_ble_gattc_char_t() {\n\n assert_eq!(\n\n ::core::mem::size_of::<ble_gattc_char_t>(),\n\n 10usize,\n\n concat!(\"Size of: \", stringify!(ble_gattc_char_t))\n\n );\n\n assert_eq!(\n\n ::core::mem::align_of::<ble_gattc_char_t>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(ble_gattc_char_t))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::core::ptr::null::<ble_gattc_char_t>())).uuid as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(ble_gattc_char_t),\n\n \"::\",\n\n stringify!(uuid)\n\n )\n","file_path":"nrf-softdevice-s132/src/bindings.rs","rank":99,"score":86477.38342016209}],"string":"[\n {\n \"content\": \"pub fn gen_bindings(\\n\\n tmp_dir: &PathBuf,\\n\\n src_dir: &PathBuf,\\n\\n dst: &PathBuf,\\n\\n mut f: impl FnMut(String) -> String,\\n\\n) {\\n\\n let mut wrapper = String::new();\\n\\n\\n\\n for entry in WalkDir::new(src_dir)\\n\\n .follow_links(true)\\n\\n .into_iter()\\n\\n .filter_map(|e| e.ok())\\n\\n {\\n\\n let _f_name = entry.path().to_string_lossy();\\n\\n if entry.file_type().is_file() {\\n\\n if entry.file_name().to_string_lossy() == \\\"nrf_nvic.h\\\" {\\n\\n continue;\\n\\n }\\n\\n\\n\\n let data = fs::read_to_string(entry.path()).unwrap();\\n\",\n \"file_path\": \"nrf-softdevice-gen/src/main.rs\",\n \"rank\": 0,\n \"score\": 170181.4076460192\n },\n {\n \"content\": \"/// This will fail if an indication is already in progress\\n\\npub fn indicate_value(\\n\\n conn: &Connection,\\n\\n handle: u16,\\n\\n val: &[u8],\\n\\n) -> Result<(), IndicateValueError> {\\n\\n let conn_handle = conn.with_state(|state| state.check_connected())?;\\n\\n\\n\\n let mut len: u16 = val.len() as _;\\n\\n let params = raw::ble_gatts_hvx_params_t {\\n\\n handle,\\n\\n type_: raw::BLE_GATT_HVX_INDICATION as u8,\\n\\n offset: 0,\\n\\n p_data: val.as_ptr() as _,\\n\\n p_len: &mut len,\\n\\n };\\n\\n let ret = unsafe { raw::sd_ble_gatts_hvx(conn_handle, ¶ms) };\\n\\n RawError::convert(ret)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_server.rs\",\n \"rank\": 1,\n \"score\": 167974.44711971324\n },\n {\n \"content\": \"pub fn try_write_without_response(\\n\\n conn: &Connection,\\n\\n handle: u16,\\n\\n buf: &[u8],\\n\\n) -> Result<(), TryWriteError> {\\n\\n let conn_handle = conn.with_state(|state| state.check_connected())?;\\n\\n\\n\\n assert!(buf.len() <= u16::MAX as usize);\\n\\n let params = raw::ble_gattc_write_params_t {\\n\\n write_op: raw::BLE_GATT_OP_WRITE_CMD as u8,\\n\\n flags: 0,\\n\\n handle,\\n\\n p_value: buf.as_ptr(),\\n\\n len: buf.len() as u16,\\n\\n offset: 0,\\n\\n };\\n\\n\\n\\n let ret = unsafe { raw::sd_ble_gattc_write(conn_handle, ¶ms) };\\n\\n match RawError::convert(ret) {\\n\\n Err(RawError::Resources) => Err(TryWriteError::BufferFull),\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_client.rs\",\n \"rank\": 2,\n \"score\": 163827.65160015525\n },\n {\n \"content\": \"pub fn get_value(_sd: &Softdevice, handle: u16, buf: &mut [u8]) -> Result<usize, GetValueError> {\\n\\n let mut value = raw::ble_gatts_value_t {\\n\\n p_value: buf.as_mut_ptr(),\\n\\n len: buf.len() as _,\\n\\n offset: 0,\\n\\n };\\n\\n let ret = unsafe {\\n\\n raw::sd_ble_gatts_value_get(raw::BLE_CONN_HANDLE_INVALID as u16, handle, &mut value)\\n\\n };\\n\\n RawError::convert(ret)?;\\n\\n\\n\\n if value.len as usize > buf.len() {\\n\\n return Err(GetValueError::Truncated);\\n\\n }\\n\\n\\n\\n Ok(value.len as _)\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\\n\\n#[cfg_attr(feature = \\\"defmt\\\", derive(defmt::Format))]\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_server.rs\",\n \"rank\": 3,\n \"score\": 149357.73479287088\n },\n {\n \"content\": \"struct CriticalSection;\\n\\ncritical_section::custom_impl!(CriticalSection);\\n\\n\\n\\nunsafe impl critical_section::Impl for CriticalSection {\\n\\n unsafe fn acquire() -> u8 {\\n\\n let nvic = &*NVIC::ptr();\\n\\n let nested_cs = CS_FLAG.load(Ordering::SeqCst);\\n\\n\\n\\n if !nested_cs {\\n\\n raw_critical_section(|| {\\n\\n CS_FLAG.store(true, Ordering::Relaxed);\\n\\n\\n\\n // Store the state of irqs.\\n\\n CS_MASK = nvic.icer[0].read();\\n\\n\\n\\n // Disable only not-reserved irqs.\\n\\n nvic.icer[0].write(!RESERVED_IRQS);\\n\\n });\\n\\n }\\n\\n\\n\",\n \"file_path\": \"nrf-softdevice/src/critical_section_impl.rs\",\n \"rank\": 4,\n \"score\": 145195.97183402212\n },\n {\n \"content\": \"pub fn get_address(_sd: &Softdevice) -> Address {\\n\\n unsafe {\\n\\n let mut addr: raw::ble_gap_addr_t = mem::zeroed();\\n\\n let ret = raw::sd_ble_gap_addr_get(&mut addr);\\n\\n unwrap!(RawError::convert(ret), \\\"sd_ble_gap_addr_get\\\");\\n\\n Address::from_raw(addr)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/mod.rs\",\n \"rank\": 5,\n \"score\": 143428.6816769865\n },\n {\n \"content\": \"fn on_user_mem_release(_ble_evt: *const raw::ble_evt_t) {\\n\\n trace!(\\\"on_user_mem_release\\\");\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/common.rs\",\n \"rank\": 6,\n \"score\": 137837.25508474058\n },\n {\n \"content\": \"fn on_user_mem_request(_ble_evt: *const raw::ble_evt_t) {\\n\\n trace!(\\\"on_user_mem_request\\\");\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/common.rs\",\n \"rank\": 7,\n \"score\": 137837.25508474058\n },\n {\n \"content\": \"pub fn set_address(_sd: &Softdevice, addr: &Address) {\\n\\n unsafe {\\n\\n let addr = addr.into_raw();\\n\\n let ret = raw::sd_ble_gap_addr_set(&addr);\\n\\n unwrap!(RawError::convert(ret), \\\"sd_ble_gap_addr_set\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/mod.rs\",\n \"rank\": 8,\n \"score\": 137247.5029404512\n },\n {\n \"content\": \"struct WaitFuture<'a, T> {\\n\\n signal: &'a Signal<T>,\\n\\n}\\n\\n\\n\\nimpl<'a, T: Send> Future for WaitFuture<'a, T> {\\n\\n type Output = T;\\n\\n\\n\\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<T> {\\n\\n unsafe {\\n\\n cortex_m::interrupt::free(|_| {\\n\\n let state = &mut *self.signal.state.get();\\n\\n match state {\\n\\n State::None => {\\n\\n *state = State::Waiting(cx.waker().clone());\\n\\n Poll::Pending\\n\\n }\\n\\n State::Waiting(w) if w.will_wake(cx.waker()) => Poll::Pending,\\n\\n State::Waiting(_) => panic!(\\\"waker overflow\\\"),\\n\\n State::Signaled(_) => match mem::replace(state, State::None) {\\n\\n State::Signaled(res) => Poll::Ready(res),\\n\\n _ => unreachable!(),\\n\\n },\\n\\n }\\n\\n })\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/util/signal.rs\",\n \"rank\": 9,\n \"score\": 134814.41362903753\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 10,\n \"score\": 130567.24995010582\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 11,\n \"score\": 130567.24995010582\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 12,\n \"score\": 130567.24995010582\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 13,\n \"score\": 130567.24995010582\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t>())).callback_action\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 14,\n \"score\": 130567.24995010582\n },\n {\n \"content\": \"fn index_by_handle(conn_handle: u16) -> &'static Cell<Option<u8>> {\\n\\n unsafe { &INDEX_BY_HANDLE[conn_handle as usize] }\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/connection.rs\",\n \"rank\": 15,\n \"score\": 130104.29820291008\n },\n {\n \"content\": \"/// Get temperature reading in Celsius\\n\\n///\\n\\n/// Note this blocks for ~50us\\n\\npub fn temperature_celsius(_sd: &Softdevice) -> Result<I30F2, TempError> {\\n\\n let mut temp: i32 = 0;\\n\\n let ret = unsafe { raw::sd_temp_get(&mut temp) };\\n\\n RawError::convert(ret)?;\\n\\n Ok(I30F2::from_bits(temp))\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/temperature.rs\",\n \"rank\": 16,\n \"score\": 130068.74125258872\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 17,\n \"score\": 127158.72000604431\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 18,\n \"score\": 127158.72000604431\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 19,\n \"score\": 127158.72000604431\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 20,\n \"score\": 127158.72000604431\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1>()))\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 21,\n \"score\": 127158.72000604431\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn gatt_server(_args: TokenStream, item: TokenStream) -> TokenStream {\\n\\n let mut struc = syn::parse_macro_input!(item as syn::ItemStruct);\\n\\n\\n\\n let struct_fields = match &mut struc.fields {\\n\\n syn::Fields::Named(n) => n,\\n\\n _ => {\\n\\n struc\\n\\n .ident\\n\\n .span()\\n\\n .unwrap()\\n\\n .error(\\\"gatt_server structs must have named fields, not tuples.\\\")\\n\\n .emit();\\n\\n return TokenStream::new();\\n\\n }\\n\\n };\\n\\n let fields = struct_fields\\n\\n .named\\n\\n .iter()\\n\\n .cloned()\\n\\n .collect::<Vec<syn::Field>>();\\n\",\n \"file_path\": \"nrf-softdevice-macro/src/lib.rs\",\n \"rank\": 22,\n \"score\": 126660.14978410889\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn gatt_service(args: TokenStream, item: TokenStream) -> TokenStream {\\n\\n let args = syn::parse_macro_input!(args as syn::AttributeArgs);\\n\\n let mut struc = syn::parse_macro_input!(item as syn::ItemStruct);\\n\\n\\n\\n let args = match ServiceArgs::from_list(&args) {\\n\\n Ok(v) => v,\\n\\n Err(e) => {\\n\\n return e.write_errors().into();\\n\\n }\\n\\n };\\n\\n\\n\\n let mut chars = Vec::new();\\n\\n\\n\\n let struct_fields = match &mut struc.fields {\\n\\n syn::Fields::Named(n) => n,\\n\\n _ => {\\n\\n struc\\n\\n .ident\\n\\n .span()\\n\\n .unwrap()\\n\",\n \"file_path\": \"nrf-softdevice-macro/src/lib.rs\",\n \"rank\": 23,\n \"score\": 126660.14978410889\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn gatt_client(args: TokenStream, item: TokenStream) -> TokenStream {\\n\\n let args = syn::parse_macro_input!(args as syn::AttributeArgs);\\n\\n let mut struc = syn::parse_macro_input!(item as syn::ItemStruct);\\n\\n\\n\\n let args = match ServiceArgs::from_list(&args) {\\n\\n Ok(v) => v,\\n\\n Err(e) => {\\n\\n return e.write_errors().into();\\n\\n }\\n\\n };\\n\\n\\n\\n let mut chars = Vec::new();\\n\\n\\n\\n let struct_fields = match &mut struc.fields {\\n\\n syn::Fields::Named(n) => n,\\n\\n _ => {\\n\\n struc\\n\\n .ident\\n\\n .span()\\n\\n .unwrap()\\n\",\n \"file_path\": \"nrf-softdevice-macro/src/lib.rs\",\n \"rank\": 24,\n \"score\": 126660.14978410889\n },\n {\n \"content\": \"fn allocate_index<T>(f: impl FnOnce(u8, &mut ConnectionState) -> T) -> Result<T, OutOfConnsError> {\\n\\n unsafe {\\n\\n for (i, s) in STATES.iter().enumerate() {\\n\\n let state = &mut *s.get();\\n\\n if state.refcount == 0 && state.conn_handle.is_none() {\\n\\n return Ok(f(i as u8, state));\\n\\n }\\n\\n }\\n\\n Err(OutOfConnsError)\\n\\n }\\n\\n}\\n\\n\\n\\n// conn_handle -> index mapping. Used to make stuff go faster\\n\\nconst INDEX_NONE: Cell<Option<u8>> = Cell::new(None);\\n\\nstatic mut INDEX_BY_HANDLE: [Cell<Option<u8>>; CONNS_MAX] = [INDEX_NONE; CONNS_MAX];\\n\\n\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/connection.rs\",\n \"rank\": 25,\n \"score\": 125311.61893603088\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 26,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 27,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 28,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 29,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 30,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 31,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 32,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 33,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 34,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2>(\\n\\n ),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(nrf_radio_signal_callback_return_param_t__bindgen_ty_1__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 35,\n \"score\": 123991.19772611704\n },\n {\n \"content\": \"/// Get cryptographically-securerandom bytes.\\n\\npub fn random_bytes(_sd: &Softdevice, buf: &mut [u8]) -> Result<(), RandomError> {\\n\\n if buf.len() > u8::MAX as usize {\\n\\n return Err(RandomError::BufferTooBig);\\n\\n }\\n\\n\\n\\n let ret = unsafe { raw::sd_rand_application_vector_get(buf[..].as_mut_ptr(), buf.len() as u8) };\\n\\n match RawError::convert(ret) {\\n\\n Ok(()) => Ok(()),\\n\\n Err(RawError::SocRandNotEnoughValues) => Err(RandomError::NotEnoughEntropy),\\n\\n Err(e) => Err(e.into()),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/random.rs\",\n \"rank\": 36,\n \"score\": 122877.26364579838\n },\n {\n \"content\": \"pub fn register<S: Server>(sd: &Softdevice) -> Result<S, RegisterError> {\\n\\n S::register(sd)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_server.rs\",\n \"rank\": 37,\n \"score\": 121204.78150112252\n },\n {\n \"content\": \"pub fn register_service<S: Service>(_sd: &Softdevice) -> Result<S, RegisterError> {\\n\\n let uuid = S::uuid();\\n\\n let mut service_handle: u16 = 0;\\n\\n let ret = unsafe {\\n\\n raw::sd_ble_gatts_service_add(\\n\\n raw::BLE_GATTS_SRVC_TYPE_PRIMARY as u8,\\n\\n uuid.as_raw_ptr(),\\n\\n &mut service_handle as _,\\n\\n )\\n\\n };\\n\\n RawError::convert(ret)?;\\n\\n\\n\\n S::register(service_handle, |char, initial_value| {\\n\\n let mut cccd_attr_md: raw::ble_gatts_attr_md_t = unsafe { mem::zeroed() };\\n\\n cccd_attr_md.read_perm = raw::ble_gap_conn_sec_mode_t {\\n\\n _bitfield_1: raw::ble_gap_conn_sec_mode_t::new_bitfield_1(1, 1),\\n\\n };\\n\\n cccd_attr_md.write_perm = raw::ble_gap_conn_sec_mode_t {\\n\\n _bitfield_1: raw::ble_gap_conn_sec_mode_t::new_bitfield_1(1, 1),\\n\\n };\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_server.rs\",\n \"rank\": 38,\n \"score\": 119592.49164209625\n },\n {\n \"content\": \"pub fn set_value(_sd: &Softdevice, handle: u16, val: &[u8]) -> Result<(), SetValueError> {\\n\\n let mut value = raw::ble_gatts_value_t {\\n\\n p_value: val.as_ptr() as _,\\n\\n len: val.len() as _,\\n\\n offset: 0,\\n\\n };\\n\\n let ret = unsafe {\\n\\n raw::sd_ble_gatts_value_set(raw::BLE_CONN_HANDLE_INVALID as u16, handle, &mut value)\\n\\n };\\n\\n RawError::convert(ret)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\\n\\n#[cfg_attr(feature = \\\"defmt\\\", derive(defmt::Format))]\\n\\npub enum NotifyValueError {\\n\\n Disconnected,\\n\\n Raw(RawError),\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_server.rs\",\n \"rank\": 39,\n \"score\": 114369.21208366963\n },\n {\n \"content\": \"/// Multiple notifications can be queued. Will fail when the queue is full.\\n\\npub fn notify_value(conn: &Connection, handle: u16, val: &[u8]) -> Result<(), NotifyValueError> {\\n\\n let conn_handle = conn.with_state(|state| state.check_connected())?;\\n\\n\\n\\n let mut len: u16 = val.len() as _;\\n\\n let params = raw::ble_gatts_hvx_params_t {\\n\\n handle,\\n\\n type_: raw::BLE_GATT_HVX_NOTIFICATION as u8,\\n\\n offset: 0,\\n\\n p_data: val.as_ptr() as _,\\n\\n p_len: &mut len,\\n\\n };\\n\\n let ret = unsafe { raw::sd_ble_gatts_hvx(conn_handle, ¶ms) };\\n\\n RawError::convert(ret)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\\n\\n#[cfg_attr(feature = \\\"defmt\\\", derive(defmt::Format))]\\n\\npub enum IndicateValueError {\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/gatt_server.rs\",\n \"rank\": 40,\n \"score\": 114369.21208366963\n },\n {\n \"content\": \"fn main() {\\n\\n // Put `memory.x` in our output directory and ensure it's\\n\\n // on the linker search path.\\n\\n let out = &PathBuf::from(env::var_os(\\\"OUT_DIR\\\").unwrap());\\n\\n File::create(out.join(\\\"memory.x\\\"))\\n\\n .unwrap()\\n\\n .write_all(include_bytes!(\\\"memory.x\\\"))\\n\\n .unwrap();\\n\\n println!(\\\"cargo:rustc-link-search={}\\\", out.display());\\n\\n\\n\\n // By default, Cargo will re-run a build script whenever\\n\\n // any file in the project changes. By specifying `memory.x`\\n\\n // here, we ensure the build script is only re-run when\\n\\n // `memory.x` is changed.\\n\\n println!(\\\"cargo:rerun-if-changed=memory.x\\\");\\n\\n\\n\\n println!(\\\"cargo:rustc-link-arg-bins=--nmagic\\\");\\n\\n println!(\\\"cargo:rustc-link-arg-bins=-Tlink.x\\\");\\n\\n println!(\\\"cargo:rustc-link-arg-bins=-Tdefmt.x\\\");\\n\\n}\\n\",\n \"file_path\": \"examples/build.rs\",\n \"rank\": 41,\n \"score\": 95890.43423180413\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Characteristic {\\n\\n name: String,\\n\\n ty: syn::Type,\\n\\n args: CharacteristicArgs,\\n\\n span: Span,\\n\\n vis: syn::Visibility,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"nrf-softdevice-macro/src/lib.rs\",\n \"rank\": 42,\n \"score\": 94633.16399057483\n },\n {\n \"content\": \"#[derive(Debug, FromMeta)]\\n\\nstruct ServiceArgs {\\n\\n uuid: Uuid,\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice-macro/src/lib.rs\",\n \"rank\": 43,\n \"score\": 93419.42663022527\n },\n {\n \"content\": \"#[derive(Debug, FromMeta)]\\n\\nstruct CharacteristicArgs {\\n\\n uuid: Uuid,\\n\\n #[darling(default)]\\n\\n read: bool,\\n\\n #[darling(default)]\\n\\n write: bool,\\n\\n #[darling(default)]\\n\\n notify: bool,\\n\\n #[darling(default)]\\n\\n indicate: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"nrf-softdevice-macro/src/lib.rs\",\n \"rank\": 44,\n \"score\": 93419.42663022527\n },\n {\n \"content\": \"#[defmt::global_logger]\\n\\nstruct Logger;\\n\\n\\n\\n/// Global logger lock.\\n\\nstatic TAKEN: AtomicBool = AtomicBool::new(false);\\n\\nstatic INTERRUPTS_TOKEN: AtomicU8 = AtomicU8::new(0);\\n\\nstatic mut ENCODER: defmt::Encoder = defmt::Encoder::new();\\n\\n\\n\\nunsafe impl defmt::Logger for Logger {\\n\\n fn acquire() {\\n\\n let token = unsafe { critical_section::acquire() };\\n\\n\\n\\n if !TAKEN.load(Ordering::Relaxed) {\\n\\n // no need for CAS because interrupts are disabled\\n\\n TAKEN.store(true, Ordering::Relaxed);\\n\\n\\n\\n INTERRUPTS_TOKEN.store(token, Ordering::Relaxed);\\n\\n\\n\\n // safety: accessing the `static mut` is OK because we have disabled interrupts.\\n\\n unsafe { ENCODER.start_frame(do_write) }\\n\\n } else {\\n\",\n \"file_path\": \"nrf-softdevice-defmt-rtt/src/lib.rs\",\n \"rank\": 45,\n \"score\": 93419.42663022527\n },\n {\n \"content\": \"#[repr(C)]\\n\\nstruct Header {\\n\\n id: [u8; 16],\\n\\n max_up_channels: usize,\\n\\n max_down_channels: usize,\\n\\n up_channel: Channel,\\n\\n}\\n\\n\\n\\nconst MODE_MASK: usize = 0b11;\\n\\n/// Block the application if the RTT buffer is full, wait for the host to read data.\\n\\nconst MODE_BLOCK_IF_FULL: usize = 2;\\n\\n/// Don't block if the RTT buffer is full. Truncate data to output as much as fits.\\n\\nconst MODE_NON_BLOCKING_TRIM: usize = 1;\\n\\n\\n\\n// TODO make configurable\\n\\n// NOTE use a power of 2 for best performance\\n\\nconst SIZE: usize = 1024;\\n\\n\\n\\n// make sure we only get shared references to the header/channel (avoid UB)\\n\\n/// # Safety\\n\\n/// `Channel` API is not re-entrant; this handle should not be held from different execution\\n\",\n \"file_path\": \"nrf-softdevice-defmt-rtt/src/lib.rs\",\n \"rank\": 46,\n \"score\": 93419.42663022527\n },\n {\n \"content\": \"fn main() {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n let src_dir = PathBuf::from(&args[1]);\\n\\n let dst_path = PathBuf::from(&args[2]);\\n\\n\\n\\n let tmp_dir = PathBuf::from(\\\"./tmp\\\");\\n\\n let tmp_bindings_path = tmp_dir.join(\\\"bindings.rs\\\");\\n\\n\\n\\n let _ = fs::remove_dir_all(&tmp_dir);\\n\\n fs::create_dir_all(&tmp_dir).unwrap();\\n\\n\\n\\n gen_bindings(&tmp_dir, &src_dir, &tmp_bindings_path, |data| {\\n\\n let re = Regex::new(r\\\"SVCALL\\\\((?P<svc>[A-Za-z0-9_]+),\\\\s*(?P<ret>[A-Za-z0-9_]+),\\\\s*(?P<name>[A-Za-z0-9_]+)\\\\((?P<args>.*)\\\\)\\\\);\\\").unwrap();\\n\\n re.replace_all(&data, \\\"uint32_t __svc_$name = $svc;\\\").into()\\n\\n });\\n\\n\\n\\n let mut svc_nums = HashMap::new();\\n\\n\\n\\n let data = fs::read_to_string(&tmp_bindings_path).unwrap();\\n\",\n \"file_path\": \"nrf-softdevice-gen/src/main.rs\",\n \"rank\": 47,\n \"score\": 91964.55743749501\n },\n {\n \"content\": \"fn assert_thread_mode() {\\n\\n assert!(\\n\\n cortex_m::peripheral::SCB::vect_active()\\n\\n == cortex_m::peripheral::scb::VectActive::ThreadMode,\\n\\n \\\"portals are not usable from interrupts\\\"\\n\\n );\\n\\n}\\n\\n\\n\\nimpl<T> Portal<T> {\\n\\n pub const fn new() -> Self {\\n\\n Self {\\n\\n state: UnsafeCell::new(State::None),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn call(&self, val: T) -> bool {\\n\\n assert_thread_mode();\\n\\n\\n\\n // safety: this runs from thread mode\\n\\n unsafe {\\n\",\n \"file_path\": \"nrf-softdevice/src/util/portal.rs\",\n \"rank\": 48,\n \"score\": 89628.30017086875\n },\n {\n \"content\": \"pub trait Try {\\n\\n type Ok;\\n\\n type Error;\\n\\n fn into_result(self) -> Result<Self::Ok, Self::Error>;\\n\\n}\\n\\n\\n\\nimpl<T> Try for Option<T> {\\n\\n type Ok = T;\\n\\n type Error = NoneError;\\n\\n\\n\\n #[inline]\\n\\n fn into_result(self) -> Result<T, NoneError> {\\n\\n self.ok_or(NoneError)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, E> Try for Result<T, E> {\\n\\n type Ok = T;\\n\\n type Error = E;\\n\\n\\n\\n #[inline]\\n\\n fn into_result(self) -> Self {\\n\\n self\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"nrf-softdevice/src/fmt.rs\",\n \"rank\": 49,\n \"score\": 88629.852360945\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_evt_t>(),\\n\\n 48usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 50,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_cfg_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_cfg_t>(),\\n\\n 12usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_cfg_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_cfg_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_cfg)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 51,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_version_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_version_t>(),\\n\\n 6usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_version_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_version_t),\\n\\n \\\"::\\\",\\n\\n stringify!(version_number)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 52,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_evt_t>(),\\n\\n 44usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 53,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 54,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_opt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_opt_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_opt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_opt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(common_opt)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 55,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_data_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_data_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_data_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_data_t),\\n\\n \\\"::\\\",\\n\\n stringify!(p_data)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 56,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid128_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid128_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid128_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid128_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid128)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 57,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_version_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_version_t>(),\\n\\n 6usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_version_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_version_t),\\n\\n \\\"::\\\",\\n\\n stringify!(version_number)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 58,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_opt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_opt_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_opt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_opt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(common_opt)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 59,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_version_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_version_t>(),\\n\\n 6usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_version_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_version_t),\\n\\n \\\"::\\\",\\n\\n stringify!(version_number)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 60,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 61,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_data_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_data_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_data_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_data_t),\\n\\n \\\"::\\\",\\n\\n stringify!(p_data)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 62,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_data_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_data_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_data_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_data_t),\\n\\n \\\"::\\\",\\n\\n stringify!(p_data)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 63,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_opt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_opt_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_opt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_opt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(common_opt)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 64,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_cfg_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_cfg_t>(),\\n\\n 12usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_cfg_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_cfg_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_cfg)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 65,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_data_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_data_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_data_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_data_t),\\n\\n \\\"::\\\",\\n\\n stringify!(p_data)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 66,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_opt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_opt_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_opt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_opt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(common_opt)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 67,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_cfg_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_cfg_t>(),\\n\\n 12usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_cfg_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_cfg_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_cfg)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 68,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_opt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_opt_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_opt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_opt_t>())).common_opt as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_opt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(common_opt)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 69,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 70,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_evt_t>(),\\n\\n 48usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 71,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_version_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_version_t>(),\\n\\n 6usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_version_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_version_t),\\n\\n \\\"::\\\",\\n\\n stringify!(version_number)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 72,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_evt_t>(),\\n\\n 48usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 73,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_data_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_data_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_data_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_data_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_data_t>())).p_data as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_data_t),\\n\\n \\\"::\\\",\\n\\n stringify!(p_data)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 74,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_cfg_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_cfg_t>(),\\n\\n 12usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_cfg_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_cfg_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_cfg)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 75,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid128_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid128_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid128_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid128_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid128)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 76,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_cfg_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_cfg_t>(),\\n\\n 12usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_cfg_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_cfg_t>())).conn_cfg as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_cfg_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_cfg)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s122/src/bindings.rs\",\n \"rank\": 77,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 78,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid128_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid128_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid128_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid128_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid128)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s113/src/bindings.rs\",\n \"rank\": 79,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_evt_t>(),\\n\\n 44usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_evt_t>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 80,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 81,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid128_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid128_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid128_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid128_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid128)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 82,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_version_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_version_t>(),\\n\\n 6usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_version_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_version_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_version_t>())).version_number as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_version_t),\\n\\n \\\"::\\\",\\n\\n stringify!(version_number)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s140/src/bindings.rs\",\n \"rank\": 83,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_uuid128_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_uuid128_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_uuid128_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_uuid128_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_uuid128_t>())).uuid128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_uuid128_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid128)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s112/src/bindings.rs\",\n \"rank\": 84,\n \"score\": 87484.4410230175\n },\n {\n \"content\": \"struct RawAdvertisement<'a> {\\n\\n kind: u8,\\n\\n adv_data: Option<&'a [u8]>,\\n\\n scan_data: Option<&'a [u8]>,\\n\\n}\\n\\n\\n\\n/// Connectable advertisement types, which can accept connections from interested Central devices.\\n\\npub enum ConnectableAdvertisement<'a> {\\n\\n ScannableUndirected {\\n\\n adv_data: &'a [u8],\\n\\n scan_data: &'a [u8],\\n\\n },\\n\\n NonscannableDirected {\\n\\n scan_data: &'a [u8],\\n\\n },\\n\\n NonscannableDirectedHighDuty {\\n\\n scan_data: &'a [u8],\\n\\n },\\n\\n #[cfg(any(feature = \\\"s132\\\", feature = \\\"s140\\\"))]\\n\\n ExtendedNonscannableUndirected {\\n\",\n \"file_path\": \"nrf-softdevice/src/ble/peripheral.rs\",\n \"rank\": 85,\n \"score\": 87450.5347940551\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_nrf_radio_request_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<nrf_radio_request_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(nrf_radio_request_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<nrf_radio_request_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(nrf_radio_request_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::core::ptr::null::<nrf_radio_request_t>())).request_type as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(nrf_radio_request_t),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 86,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gattc_desc_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gattc_desc_t>(),\\n\\n 6usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gattc_desc_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gattc_desc_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gattc_desc_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gattc_desc_t>())).handle as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gattc_desc_t),\\n\\n \\\"::\\\",\\n\\n stringify!(handle)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 87,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gap_irk_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gap_irk_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gap_irk_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gap_irk_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gap_irk_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gap_irk_t>())).irk as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gap_irk_t),\\n\\n \\\"::\\\",\\n\\n stringify!(irk)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 88,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gattc_include_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gattc_include_t>(),\\n\\n 10usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gattc_include_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gattc_include_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gattc_include_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gattc_include_t>())).handle as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gattc_include_t),\\n\\n \\\"::\\\",\\n\\n stringify!(handle)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 89,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gattc_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gattc_evt_t>(),\\n\\n 14usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gattc_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gattc_evt_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gattc_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gattc_evt_t>())).conn_handle as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gattc_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_handle)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 90,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gap_addr_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gap_addr_t>(),\\n\\n 7usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gap_addr_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gap_addr_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gap_addr_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gap_addr_t>())).addr as *const _ as usize },\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gap_addr_t),\\n\\n \\\"::\\\",\\n\\n stringify!(addr)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 91,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gap_cfg_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gap_cfg_t>(),\\n\\n 12usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gap_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gap_cfg_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gap_cfg_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gap_cfg_t>())).role_count_cfg as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gap_cfg_t),\\n\\n \\\"::\\\",\\n\\n stringify!(role_count_cfg)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 92,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gap_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gap_evt_t>(),\\n\\n 44usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gap_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gap_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gap_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gap_evt_t>())).conn_handle as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gap_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_handle)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 93,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_l2cap_evt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_l2cap_evt_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_l2cap_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_l2cap_evt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_l2cap_evt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_l2cap_evt_t>())).conn_handle as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_l2cap_evt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(conn_handle)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 94,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_sd_mbr_command_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<sd_mbr_command_t>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(sd_mbr_command_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<sd_mbr_command_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(sd_mbr_command_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<sd_mbr_command_t>())).command as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(sd_mbr_command_t),\\n\\n \\\"::\\\",\\n\\n stringify!(command)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 95,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gap_phys_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gap_phys_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gap_phys_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gap_phys_t>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gap_phys_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gap_phys_t>())).tx_phys as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gap_phys_t),\\n\\n \\\"::\\\",\\n\\n stringify!(tx_phys)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 96,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gattc_service_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gattc_service_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gattc_service_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gattc_service_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gattc_service_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gattc_service_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gattc_service_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 97,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gap_opt_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gap_opt_t>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gap_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gap_opt_t>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gap_opt_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gap_opt_t>())).ch_map as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gap_opt_t),\\n\\n \\\"::\\\",\\n\\n stringify!(ch_map)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 98,\n \"score\": 86477.38342016209\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_ble_gattc_char_t() {\\n\\n assert_eq!(\\n\\n ::core::mem::size_of::<ble_gattc_char_t>(),\\n\\n 10usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(ble_gattc_char_t))\\n\\n );\\n\\n assert_eq!(\\n\\n ::core::mem::align_of::<ble_gattc_char_t>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(ble_gattc_char_t))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::core::ptr::null::<ble_gattc_char_t>())).uuid as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(ble_gattc_char_t),\\n\\n \\\"::\\\",\\n\\n stringify!(uuid)\\n\\n )\\n\",\n \"file_path\": \"nrf-softdevice-s132/src/bindings.rs\",\n \"rank\": 99,\n \"score\": 86477.38342016209\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":19,"numItemsPerPage":100,"numTotalItems":13489,"offset":1900,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTc1NTEwMiwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3Nzk3NTg3MDIsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.5jnGs_sFMdV1OYuRhFWNkWPhiInHJfPg34Ensbf_Oc6HRoIK7XVIElD9cUM8VIeJr1Y9eaoKgBvIVaHbKzdsCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":13489,"numBytesParquet":605686331}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
lang stringclasses 3
values | file_path stringlengths 5 150 | repo_name stringlengths 6 110 | commit stringlengths 40 40 | file_code stringlengths 1.52k 18.9k | prefix stringlengths 82 16.5k | suffix stringlengths 0 15.1k | middle stringlengths 121 8.18k | strategy stringclasses 8
values | context_items listlengths 0 100 |
|---|---|---|---|---|---|---|---|---|---|
Rust | src/an_ok_binary_tree/src/lib.rs | shen-jinhao/Rust-With-Linked-Lists | 924b6fe896192d1e3fc4757080027ae12baad28a | use an_ok_stack::List as Stack;
use an_unsafe_queue::List as Queue;
use std::fmt::Debug;
#[derive(Clone)]
pub struct BinaryTree<T> {
root: Link<T>,
}
type Link<T> = Option<Box<Node<T>>>;
#[derive(Eq, PartialEq, Clone)]
struct Node<T> {
elem: T,
left: Link<T>,
right: Link<T>,
}
impl<T> Node<T> {
... | use an_ok_stack::List as Stack;
use an_unsafe_queue::List as Queue;
use std::fmt::Debug;
#[derive(Clone)]
pub struct BinaryTree<T> {
root: Link<T>,
}
type Link<T> = Option<Box<Node<T>>>;
#[derive(Eq, PartialEq, Clone)]
struct Node<T> {
elem: T,
left: Link<T>,
right: Link<T>,
}
impl<T> Node< | ());
}
let mut flag = true;
while !queue.is_empty() {
let head = queue.pop().unwrap();
if head.left.is_some() {
if !flag {
return false;
}
queue.push(head.left.as_ref().unwrap());
}
... | T> {
pub fn new(elem: T) -> Self {
Self {
elem,
left: None,
right: None,
}
}
}
impl<T: Debug + PartialEq + Clone> BinaryTree<T> {
pub fn new(val: &[T], invalid: T) -> Self {
let mut index: usize = 0;
Self {
root: Self::cre... | random | [
{
"content": "struct Node {\n\n elem: i32,\n\n next: Link,\n\n}\n\n\n",
"file_path": "src/a_bad_stack/src/lib.rs",
"rank": 0,
"score": 126590.78467837354
},
{
"content": "struct Node<T> {\n\n elem: T,\n\n next: Link<T>,\n\n}\n\n\n\nimpl<T> List<T> {\n\n pub fn new() -> Self {\... |
Rust | server/prisma-rs/query-engine/native-bridge/src/error.rs | otrebu/prisma | 298be5c919119847bb8d102d6b16672edd06b2c5 | use crate::protobuf;
use connector::error::{ConnectorError, NodeSelectorInfo};
use failure::{Error, Fail};
use prisma_models::DomainError;
use prost::DecodeError;
use serde_json;
#[derive(Debug, Fail)]
pub enum BridgeError {
#[fail(display = "Error in connector.")]
ConnectorError(ConnectorError),
#[fail(di... | use crate::protobuf;
use connector::error::{ConnectorError, NodeSelectorInfo};
use failure::{Error, Fail};
use prisma_models::DomainError;
use prost::DecodeError;
use serde_json;
#[derive(Debug, Fail)]
pub enum BridgeError {
#[fail(display = "Error in connector.")]
ConnectorError(ConnectorError),
#[fail(di... |
protobuf::prisma::error::Value::NodeNotFoundForWhere(node_selector)
}
BridgeError::ConnectorError(ConnectorError::NodesNotConnected {
relation_name,
parent_name,
parent_where,
child_name,
child_whe... | let node_selector = protobuf::prisma::NodeSelector {
model_name: info.model,
field_name: info.field,
value: info.value.into(),
}; | assignment_statement | [
{
"content": "pub fn parse_and_validate(input: &str) -> dml::Schema {\n\n let ast = datamodel::parser::parse(&String::from(input)).expect(\"Unable to parse datamodel.\");\n\n let validator = datamodel::validator::Validator::new();\n\n validator.validate(&ast).expect(\"Validation error\")\n\n}\n",
"... |
Rust | main/src/devices/stepper.rs | Alexander89/Stepper-Feedback-Driver | 4e698750d75d79ec77b9845374cc9ebf741c4422 | use atsamd_hal::{
delay::Delay,
gpio::v2::{Pin, PushPullOutput, PA04, PA10, PA11},
prelude::_atsamd_hal_embedded_hal_digital_v2_OutputPin,
};
use embedded_hal::digital::v2::PinState;
use utils::time::{Microseconds, U32Ext};
use crate::settings::{DT_MIN_U32, STEPS_PER_RESOLUTION_I16, STEPS_PER_RESOLUTION_I1... | use atsamd_hal::{
delay::Delay,
gpio::v2::{Pin, PushPullOutput, PA04, PA10, PA11},
prelude::_atsamd_hal_embedded_hal_digital_v2_OutputPin,
};
use embedded_hal::digital::v2::PinState;
use utils::time::{Microseconds, U32Ext};
use crate::settings::{DT_MIN_U32, STEPS_PER_RESOLUTION_I16, STEPS_PER_RESOLUTION_I1... |
self.filtered_dt_per_step = ((self.filtered_dt_per_step + dt_per_step) / 2).min(DT_MIN_U32);
let stuck = motor_dt.0 < self.filtered_dt_per_step - 1280;
let dif = self.current_step - self.real_step;
match dif.abs() {
1 => {
... | let dt_per_step = if dif == 0 {
DT_MIN_U32
} else {
(dt.0 / dif.abs() as u32).min(DT_MIN_U32)
}; | assignment_statement | [
{
"content": "fn enabled_changed(state: bool) {\n\n unsafe { HARDWARE.as_mut() }.map(|hw| {\n\n if state {\n\n hw.stepper_enable();\n\n hw.led1.on()\n\n } else {\n\n hw.stepper_disable();\n\n hw.led1.off()\n\n }\n\n });\n\n}\n",
"file_pa... |
Rust | fruity_core/fruity_ecs/src/entity/entity_query/serialized/mod.rs | DoYouRockBaby/fruity_game_engine | 299a8fe641efb142a551640f6d1aa4868e1ad670 | use crate::entity::archetype::Archetype;
use crate::entity::archetype::ArchetypeArcRwLock;
use crate::entity::entity_query::serialized::params::With;
use crate::entity::entity_query::serialized::params::WithEnabled;
use crate::entity::entity_query::serialized::params::WithEntity;
use crate::entity::entity_query::serial... | use crate::entity::archetype::Archetype;
use crate::entity::archetype::ArchetypeArcRwLock;
use crate::entity::entity_query::serialized::params::With;
use crate::entity::entity_query::serialized::params::WithEnabled;
use crate::entity::entity_query::serialized::params::WithEntity;
use crate::entity::entity_query::serial... |
fn get_field_infos(&self) -> Vec<FieldInfo> {
vec![]
}
}
| fn get_method_infos(&self) -> Vec<MethodInfo> {
vec![
MethodInfo {
name: "with_entity".to_string(),
call: MethodCaller::Mut(Arc::new(|this, _args| {
let this = cast_introspect_mut::<SerializedQuery>(this);
this.with_entity();
... | function_block-full_function | [
{
"content": "pub fn use_global<'a, T: Send + Sync + 'static>() -> &'a mut T {\n\n let mut globals = GLOBALS.lock();\n\n let globals = globals.get_mut(&TypeId::of::<T>()).unwrap().deref_mut();\n\n let result = globals.downcast_mut::<T>().unwrap();\n\n\n\n // TODO: Try to find a way to remove that\n\... |
Rust | src/beatmap/mod.rs | LunarCoffee/osurate | 06684a4ddef5a579903e794245d98cea5d9883c8 | use std::io::BufRead;
pub use crate::beatmap::parser::ParseError;
use crate::beatmap::parser::Parser;
mod parser;
#[derive(Clone, Debug)]
pub struct Beatmap {
pub general_info: GeneralInfo,
pub editor_info: EditorInfo,
pub metadata: Metadata,
pub difficulty: DifficultyInfo,
pub events: Events,
... | use std::io::BufRead;
pub use crate::beatmap::parser::ParseError;
use crate::beatmap::parser::Parser;
mod parser;
#[derive(Clone, Debug)]
pub struct Beatmap {
pub general_info: GeneralInfo,
pub editor_info: EditorInfo,
pub metadata: Metadata,
pub difficulty: DifficultyInfo,
pub events: Events,
... |
pub fn into_string(self) -> String {
format!(
"osu file format v14\n\n{}\n{}\n{}\n{}\n{}\n[TimingPoints]\n{}\n\n{}\n[HitObjects]\n{}",
self.general_info.into_string(),
self.editor_info.into_string(),
self.metadata.into_string(),
self.difficu... | pub fn change_rate(&mut self, rate: f64) -> bool {
let transform_f64 = |n| n / rate + 75.;
let transform = |n| transform_f64(n as f64) as i32;
let preview = self.general_info.preview_time;
self.general_info.preview_time = if preview >= 0 { transform(preview) } else { p... | function_block-full_function | [
{
"content": "// Stretches the audio associated with the given `map` by a factor of `rate`, updating metadata.\n\npub fn stretch_beatmap_audio(map: &mut Beatmap, dir: &Path, rate: f64) -> Result<()> {\n\n let old_path = dir.join(&map.general_info.audio_file);\n\n let old_audio = File::open(&old_path).or(E... |
Rust | all-is-cubes/benches/space_bench.rs | kpreid/all-is-cubes | 81e0fb8fbd5a0557f0f9002085f4160bce37174a |
use criterion::{
black_box, criterion_group, criterion_main, BatchSize, BenchmarkId, Criterion, Throughput,
};
use all_is_cubes::content::make_some_blocks;
use all_is_cubes::space::{Grid, Space, SpaceTransaction};
use all_is_cubes::transaction::Transaction;
pub fn space_bulk_mutation(c: &mut Criterion) {
le... |
use criterion::{
black_box, criterion_group, criterion_main, BatchSize, BenchmarkId, Criterion, Throughput,
};
use all_is_cubes::content::make_some_blocks;
use all_is_cubes::space::{Grid, Space, SpaceTransaction};
use all_is_cubes::transac | function(
BenchmarkId::new("fill_uniform() entire space", &size_description),
|b| {
let [block] = make_some_blocks();
b.iter_batched(
|| Space::empty(grid),
|mut space| {
space.fill_uniform(space.grid... | tion::Transaction;
pub fn space_bulk_mutation(c: &mut Criterion) {
let mut group = c.benchmark_group("space-bulk-mutation");
for &mutation_size in &[1, 4, 64] {
let grid = Grid::new([0, 0, 0], [mutation_size, mutation_size, mutation_size]);
let bigger_grid = grid.multiply(2);
let size_... | random | [] |
Rust | Katalon_OrangeHRMS/Object Repository/Header_Menu/Performance/a_Manage Reviews.rs | girishbhangale416/Katalon_Docker | a3f8ada90afac9e0b71454366ca93ff8a09dffe4 | <?xml version="1.0" encoding="UTF-8"?>
<WebElementEntity>
<description></description>
<name>a_Manage Reviews</name>
<tag></tag>
<elementGuidId>a9d86c40-dd16-4349-9cf7-4fb26ece97a5</elementGuidId>
<selectorCollection>
<entry>
<key>XPATH</key>
<value>
</entry>
</selectorCol... | <?xml version="1.0" encoding="UTF-8"?>
<WebElementEntity>
<description></description>
<name>a_Manage Reviews</name>
<tag></tag>
<elementGuidId>a9d86c40-dd16-4349-9cf7-4fb26ece97a5</elementGuidId>
<selectorCollection>
<entry>
<key>XPATH</key>
<value>
</entry>
</selectorCol... | ondition>equals</matchCondition>
<name>xpath:neighbor</name>
<type>Main</type>
<value>(.
</webElementXpaths>
<webElementXpaths>
<isSelected>false</isSelected>
<matchCondition>equals</matchCondition>
<name>xpath:href</name>
<type>Main</type>
<value>(
</webElementX... | >tag</name>
<type>Main</type>
<value>a</value>
</webElementProperties>
<webElementProperties>
<isSelected>true</isSelected>
<matchCondition>equals</matchCondition>
<name>href</name>
<type>Main</type>
<value>#</value>
</webElementProperties>
<webElementProperties>
... | random | [
{
"content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n\n<WebElementEntity>\n\n <description></description>\n\n <name>input_Middle Name_middleName</name>\n\n <tag></tag>\n\n <elementGuidId>a02d298f-e2ee-48f3-8efe-dc1f9953b202</elementGuidId>\n\n <selectorCollection>\n\n <entry>\n\n <ke... |
Rust | unsafe_collection/src/bytes/uninit.rs | HFQR/xitca-web | ee2d4fa9e88b2be149c9ca3454bc14d90f8f9ca2 | use std::{io::IoSlice, mem::MaybeUninit};
use bytes_crate::{buf::Chain, Buf, Bytes};
use crate::uninit;
use super::buf_list::{BufList, EitherBuf};
mod sealed {
pub trait Sealed {}
}
pub trait ChunkVectoredUninit: sealed::Sealed {
unsafe fn chunks_vectored_uninit<'a>(&'a s... | use std::{io::IoSlice, mem::MaybeUninit};
use bytes_crate::{buf::Chain, Buf, Bytes};
use crate::uninit;
use super::buf_list::{BufList, EitherBuf};
mod sealed {
pub trait Sealed {}
}
pub trait ChunkVectoredUninit: sealed::Sealed {
unsafe fn chunks_vectored_uninit<'a>(&'a s... |
}
impl<L, R> sealed::Sealed for EitherBuf<L, R>
where
L: ChunkVectoredUninit,
R: ChunkVectoredUninit,
{
}
impl<L, R> ChunkVectoredUninit for EitherBuf<L, R>
where
L: ChunkVectoredUninit,
R: ChunkVectoredUninit,
{
unsafe fn chunks_vectored_uninit<'a>(&'a self, dst: &mut [MaybeUninit... | f,
dst: &'s mut [MaybeUninit<IoSlice<'a>>],
) -> &'s mut [IoSlice<'a>] {
unsafe {
let len = self.chunks_vectored_uninit(dst);
uninit::slice_assume_init_mut(&mut dst[..len])
}
} | function_block-function_prefixed | [
{
"content": " pub trait Sealed {}\n\n}\n\n\n\nimpl<T> sealed::Sealed for &mut [MaybeUninit<T>] {}\n\n\n",
"file_path": "unsafe_collection/src/uninit.rs",
"rank": 2,
"score": 266279.3679360628
},
{
"content": "/// Trait for safely initialize an unit slice.\n\npub trait PartialInit: sealed... |
Rust | mayastor/tests/reconfigure.rs | gahag/MayaStor | 0a2f01b04d75203e5ec19b3037703ee8967ec9e7 | #![feature(async_await)]
#![allow(clippy::cognitive_complexity)]
use mayastor::{
bdev::{
nexus::nexus_bdev::{nexus_create, nexus_lookup},
Bdev,
},
descriptor::Descriptor,
mayastor_start,
spdk_stop,
};
use std::process::Command;
static DISKNAME1: &str = "/tmp/disk1.img";
static BDEV... | #![feature(async_await)]
#![allow(clippy::cognitive_complexity)]
use mayastor::{
bdev::{
nexus::nexus_bdev::{nexus_create, nexus_lookup},
Bdev,
},
descriptor::Descriptor,
mayastor_start,
spdk_stop,
};
use std::process::Command;
static DISKNAME1: &str = "/tmp/disk1.img";
static BDEV... | let stats1 = first.stats().await.unwrap();
let stats2 = second.stats().await.unwrap();
assert_eq!(stats1.num_write_ops, stats2.num_write_ops);
}
async fn works() {
let child1 = BDEVNAME1.to_string();
let child2 = BDEVNAME2.to_string();
let children = vec![child1.clone(), child2.clone()];
n... | ert_eq!(rc, 0);
let output = Command::new("rm")
.args(&["-rf", DISKNAME1, DISKNAME2])
.output()
.expect("failed delete test file");
assert_eq!(output.status.success(), true);
}
fn buf_compare(first: &[u8], second: &[u8]) {
for i in 0 .. first.len() {
assert_eq!(first[i], s... | random | [
{
"content": "/// lookup a bdev by its name or one of its alias\n\npub fn bdev_lookup_by_name(name: &str) -> Option<Bdev> {\n\n let name = std::ffi::CString::new(name.to_string()).unwrap();\n\n unsafe {\n\n let b = spdk_sys::spdk_bdev_get_by_name(name.as_ptr());\n\n if b.is_null() {\n\n ... |
Rust | src/main.rs | falzberger/ddlog_bench | 261fc5598353c648708088eb3b36d1e2082fd869 | use clap::{App, Arg, ArgMatches};
use csv::{ReaderBuilder, StringRecord};
use ordered_float::OrderedFloat;
use std::fs::File;
use std::io::prelude::*;
use query_ddlog::api::HDDlog;
use query_ddlog::relid2name;
use query_ddlog::typedefs::*;
use query_ddlog::Relations;
use differential_datalog::ddval::{DDValConvert, DD... | use clap::{App, Arg, ArgMatches};
use csv::{ReaderBuilder, StringRecord};
use ordered_float::OrderedFloat;
use std::fs::File;
use std::io::prelude::*;
use query_ddlog::api::HDDlog;
use query_ddlog::relid2name;
use query_ddlog::typedefs::*;
use query_ddlog::Relations;
use differential_datalog::ddval::{DDValConvert, DD... |
fn main() -> Result<(), String> {
let matches = get_cli_arg_matches();
println!("Instantiating DDlog program...");
let start = std::time::Instant::now();
let (hddlog, init_state) = HDDlog::run(1, false)?;
println!(
"Instantiating program took {} µs",
... | fn get_cli_arg_matches<'a>() -> ArgMatches<'a> {
App::new("DDlog Benchmark CLI")
.arg(
Arg::with_name("input")
.short("i")
.help("Specifies a CSV input file for a relation. We expect CSVs to have headers.")
.takes_value(true)
.numbe... | function_block-full_function | [
{
"content": "def to_entity_str(entity_id: int):\n",
"file_path": "generator.py",
"rank": 7,
"score": 12004.358802751458
},
{
"content": "# Differential Datalog Benchmarks\n\n\n\nThis repository contains some simple benchmarks based on artificially generated datasets for\n\nthe [Differential... |
Rust | src/main.rs | caperaven/svg-to-js | 07a2f5962d878d183c4aac2fd5e75f91e78982cc | mod path_to_path;
extern crate lyon;
extern crate glob;
use std::env;
use glob::glob;
use std::fs;
use lyon::tessellation::{FillOptions, FillTessellator, StrokeTessellator, StrokeOptions};
use lyon::path::math::{Point};
use lyon::path::Path;
use lyon::tessellation::geometry_builder::{VertexBuffers, simple_builder};
... | mod path_to_path;
extern crate lyon;
extern crate glob;
use std::env;
use glob::glob;
use std::fs;
use lyon::tessellation::{FillOptions, FillTessellator, StrokeTessellator, StrokeOptions};
use lyon::path::math::{Point};
use lyon::path::Path;
use lyon::tessellation::geometry_builder::{VertexBuffers, simple_builder};
... | fn main() {
let (files, target_folder) = get_svg_in_folder();
for entry in files {
match entry {
Ok(path) => {
let file_name = format!("{}", path.display());
let (fill_buffer, _stroke_buffer) = process_file(&file_name);
save_buffer(&file_name... | function_block-full_function | [] | |
Rust | utils/test-env/src/utils.rs | hboshnak/casper-nft-cep47 | 09b40b0caf4cfc6f73d1e5f7d5b9c868228f7621 | use std::path::PathBuf;
use casper_engine_test_support::{
DeployItemBuilder, ExecuteRequestBuilder, InMemoryWasmTestBuilder, ARG_AMOUNT,
DEFAULT_ACCOUNT_ADDR, DEFAULT_PAYMENT,
};
use casper_execution_engine::core::engine_state::ExecuteRequest;
use casper_types::{
account::AccountHash, bytesrepr::FromBytes,... | use std::path::PathBuf;
use casper_engine_test_support::{
DeployItemBuilder, ExecuteRequestBuilder, InMemoryWasmTestBuilder, ARG_AMOUNT,
DEFAULT_ACCOUNT_ADDR, DEFAULT_PAYMENT,
};
use casper_execution_engine::core::engine_state::ExecuteRequest;
use casper_types::{
account::AccountHash, bytesrepr::FromBytes,... | let named_keys = match &stored_value {
StoredValue::Account(account) => account.named_keys(),
StoredValue::Contract(contract) => contract.named_keys(),
_ => {
return Err(
"Provided base key is nether an accou... | function_block-function_prefix_line | [
{
"content": "pub fn key_and_value_to_str<T: CLTyped + ToBytes>(key: &Key, value: &T) -> String {\n\n let mut bytes_a = key.to_bytes().unwrap_or_revert();\n\n let mut bytes_b = value.to_bytes().unwrap_or_revert();\n\n\n\n bytes_a.append(&mut bytes_b);\n\n\n\n let bytes = runtime::blake2b(bytes_a);\n... | |
Rust | src/main.rs | rcarmo/rrss2imap | 1fff615262bcf5f98ae74bfacec6f902f732b9de |
extern crate structopt;
#[macro_use]
extern crate log;
extern crate serde;
#[macro_use]
extern crate serde_derive;
extern crate serde_json;
extern crate flexi_logger;
extern crate treexml;
extern crate chrono;
extern crate rfc822_sanitizer;
extern crate unidecode;
extern crate tera;
#[macro_use]
exter... |
extern crate structopt;
#[macro_use]
extern crate log;
extern crate serde;
#[macro_use]
extern crate serde_derive;
extern crate serde_json;
extern crate flexi_logger;
extern crate treexml;
extern crate chrono;
extern crate rfc822_sanitizer;
extern crate unidecode;
extern crate tera;
#[macro_use]
exter... | flexi_logger::colored_with_thread, })
.start()
.unwrap_or_else(|e| panic!("Logger initialization failed with {}", e));
openssl_probe::init_ssl_cert_env_vars();
let store_path = store::find_store();
let store_result = store::Store::load(&store_path);
match store_result {
... | function_block-function_prefix_line | [
{
"content": "fn group_feeds(to_store: &Store) -> HashMap<String, Vec<Feed>> {\n\n to_store.feeds.iter().fold(HashMap::new(), |mut map, feed| {\n\n let feed = feed.clone();\n\n let folder = feed.config.get_folder(&to_store.settings.config);\n\n if !map.contains_key(&folder) {\n\n ... | |
Rust | src/loading/util.rs | zmbush/budgetron | 3403a020abbea635e156d2245226120ee87843c6 |
use {
crate::loading::{
alliant,
generic::{Genericize, Transaction},
logix, mint,
},
budgetronlib::error::{BResult, BudgetError},
csv::Reader,
log::info,
serde::de::DeserializeOwned,
std::{
cmp::min,
fmt::Display,
fs::File,
io::{self,... |
use {
crate::loading::{
alliant,
generic::{Genericize, Transaction},
logix, mint,
},
budgetronlib::error::{BResu | read(buf),
Source::Stdin(ref mut source) => {
if source.loc >= source.buf.len() {
let ret = source.stdin.read(buf);
if let Ok(size) = ret {
source.buf.extend_from_slice(&buf[..size]);
source.loc += size;
... | lt, BudgetError},
csv::Reader,
log::info,
serde::de::DeserializeOwned,
std::{
cmp::min,
fmt::Display,
fs::File,
io::{self, Read, Seek, Stdin, StdinLock},
path::Path,
},
};
fn from_reader<TransactionType, R>(file: &mut R) -> BResult<Vec<Transaction>>
where
... | random | [
{
"content": "CREATE TABLE transactions (\n\n id SERIAL PRIMARY KEY,\n\n date DATE NOT NULL,\n\n person VARCHAR NOT NULL,\n\n description VARCHAR NOT NULL,\n\n original_description VARCHAR,\n\n amount DOUBLE PRECISION NOT NULL,\n\n transaction_type VARCHAR NOT NULL,\n\n category VARCHAR NOT NULL,\n\n o... |
Rust | guacamole-runner/src/map.rs | EllenNyan/guacamole-runner | aa17fdaf763e415ff9531e42ae946b503f9cbfb9 | use crate::{
shipyard::{
*,
},
consts::{
*,
},
tetra::{
math::{
Vec3,
Vec2,
},
graphics::{
Color,
},
},
};
use vermarine_lib::{
rendering::{
draw_buffer::{
DrawBuffer,
DrawCom... | use crate::{
shipyard::{
*,
},
consts::{
*,
},
tetra::{
math::{
Vec3,
Vec2,
},
graphics::{
Color,
},
},
};
use vermarine_lib::{
rendering::{
draw_buffer::{
DrawBuffer,
DrawCom... |
pub fn render_hex_map(mut draw_buffer: UniqueViewMut<DrawBuffer>, drawables: NonSendSync<UniqueViewMut<Drawables>>, mut map: UniqueViewMut<HexMap>) {
draw_buffer.new_command_pool(true);
let command_pool = draw_buffer.get_command_pool();
let (q, r) = map.pixel_to_hex_raw(Vec2::zero(), 0.);
let startx... | mut qi = q.round() as i32;
let mut ri = r.round() as i32;
let mut si = s.round() as i32;
let q_diff = f64::abs(qi as f64 - q as f64);
let r_diff = f64::abs(ri as f64 - r as f64);
let s_diff = f64::abs(si as f64 - s as f64);
if q_diff > r_diff && q_diff > s_diff {
qi = -ri - si;
} e... | function_block-function_prefixed | [
{
"content": "pub fn player_height_visualiser(player: View<Player>, height: View<Height>, mut sprite: ViewMut<Sprite>) {\n\n let (_, height, sprite) = (&player, &height, &mut sprite).iter().next().unwrap();\n\n let mut percent = height.0 / START_HEIGHT;\n\n percent *= percent;\n\n let start = 1.;\n\... |
Rust | src/grammar/grammar.rs | zuyumi/compiler-course-helper | 093b0d37073703d8e87e29e140a7bec29008c93b | use std::collections::{HashMap, HashSet};
#[derive(Debug, Clone)]
pub struct NonTerminal {
pub index: usize,
pub name: String,
pub first: HashSet<usize>,
pub follow: HashSet<usize>,
pub nullable: bool,
pub productions: Vec<Vec<usize>>,
}
impl NonTerminal {
pub fn new(index: usize, name: St... | use std::collections::{HashMap, HashSet};
#[derive(Debug, Clone)]
pub struct NonTerminal {
pub index: usize,
pub name: String,
pub first: HashSet<usize>,
pub follow: HashSet<usize>,
pub nullable: bool,
pub productions: Vec<Vec<usize>>,
}
impl NonTerminal {
pub fn new(index: usize, name: St... |
}
| pub fn production_to_vec_str(&self, production: &Vec<usize>) -> Vec<&str> {
production
.iter()
.map(|idx| self.get_symbol_name(*idx))
.collect()
} | function_block-full_function | [
{
"content": "#[wasm_bindgen]\n\npub fn wasm_grammar_to_output(json: &str) -> String {\n\n let args: WasmArgs = serde_json::from_str(json).unwrap();\n\n let result = grammar_to_output(&args.grammar, &args.actions, &args.outputs);\n\n serde_json::to_string(&result).unwrap()\n\n}\n\n\n\n#[derive(Clone, C... |
Rust | src/services/paste.rs | zeroqn/pastebin-actix | 269693f99be1d9a7cc010bf7e4392f61909659b8 | use std::time::SystemTime;
use actix::prelude::*;
use diesel::{self, prelude::*};
use crate::common::error::ServerError;
use crate::models::{
executor::DatabaseExecutor as DbExecutor,
paste::{NewPaste, Paste},
};
pub struct CreatePasteMsg {
pub title: String,
pub body: String,
pub created_at: Sys... | use std::time::SystemTime;
use actix::prelude::*;
use diesel::{self, prelude::*};
use crate::common::error::ServerError;
use crate::models::{
executor::DatabaseExecutor as DbExecutor,
paste::{NewPaste, Paste},
};
pub struct CreatePasteMsg {
pub title: String,
pub body: String,
pub created_at: Sys... |
}
pub struct DelPasteByIdMsg {
pub id: i64,
}
impl Message for DelPasteByIdMsg {
type Result = Result<usize, ServerError>;
}
impl Handler<DelPasteByIdMsg> for DbExecutor {
type Result = Result<usize, ServerError>;
fn handle(&mut self, msg: DelPasteByIdMsg, _: &mut Self::Context) -> Self::Result {
... | fn handle(&mut self, msg: GetPasteListMsg, _: &mut Self::Context) -> Self::Result {
use crate::models::schema::pastes::dsl::*;
let mut query = pastes.into_boxed();
if let Some(title_pat) = msg.title_pat {
query = query.filter(title.ilike(title_pat.to_owned() + "%"));
}
... | function_block-full_function | [
{
"content": "pub fn get_paste_list(\n\n (req, conds): (HttpRequest<State>, Query<GetPasteListConds>),\n\n) -> FutureJsonResponse {\n\n let db_chan = req.state().db_chan.clone();\n\n let created_at = conds\n\n .cmp_created_at\n\n .to_owned()\n\n .map_or(Ok(None), |cmp_created_at| {... |
Rust | day-21/src/main.rs | Shriram-Balaji/rust-advent-of-code-2020 | a1002a2f50d12eff744f7cb0db1f7271b9020c3a | #[macro_use]
extern crate lazy_static;
use regex::Regex;
use std::{
collections::{BTreeMap, HashMap, HashSet},
env, fs,
};
#[derive(Debug)]
struct Food<'a> {
ingredients: HashSet<&'a str>,
allergens: Vec<&'a str>,
}
fn process_food(food: &str) -> Food {
lazy_static! {
static ref FOOD_REGEX... | #[macro_use]
extern crate lazy_static;
use regex::Regex;
use std::{
collections::{BTreeMap, HashMap, HashSet},
env, fs,
};
#[derive(Debug)]
struct Food<'a> {
ingredients: HashSet<&'a str>,
allergens: Vec<&'a str>,
}
fn process_food(food: &str) -> Food {
lazy_static! {
static ref FOOD_REGEX... |
}
| fn should_process_food_items_list() {
let input = r#"mxmxvkd kfcds sqjhc nhms (contains dairy, fish)
trh fvjkl sbzzf mxmxvkd (contains dairy)
sqjhc fvjkl (contains soy)
sqjhc mxmxvkd sbzzf (contains fish)"#;
process_food_items(input);
} | function_block-full_function | [
{
"content": "fn process(input: &str) -> (u64, Vec<&str>) {\n\n let notes: Vec<&str> = input.split('\\n').collect();\n\n let timestamp = notes[0].parse::<u64>().expect(\"Invalid timestamp\");\n\n let bus_ids: Vec<&str> = notes[1].split(',').collect();\n\n (timestamp, bus_ids)\n\n}\n\n\n",
"file_... |
Rust | src/macos/aarch64/vcpu.rs | RWTH-OS/uhyve | 14e8ea129a82910c13e5a12b7893cd1badb5f380 | #![allow(non_snake_case)]
#![allow(clippy::identity_op)]
use crate::aarch64::{
mair, tcr_size, MT_DEVICE_nGnRE, MT_DEVICE_nGnRnE, MT_DEVICE_GRE, MT_NORMAL, MT_NORMAL_NC, PSR,
TCR_FLAGS, TCR_TG1_4K, VA_BITS,
};
use crate::consts::*;
use crate::vm::HypervisorResult;
use crate::vm::SysExit;
use crate::vm::VcpuStopReaso... | #![allow(non_snake_case)]
#![allow(clippy::identity_op)]
use crate::aarch64::{
mair, tcr_size, MT_DEVICE_nGnRE, MT_DEVICE_nGnRnE, MT_DEVICE_GRE, MT_NORMAL, MT_NORMAL_NC, PSR,
TCR_FLAGS, TCR_TG1_4K, VA_BITS,
};
use crate::consts::*;
use crate::vm::HypervisorResult;
use crate::vm::SysExit;
use crate::vm::VcpuStopReaso... |
}
impl VirtualCPU for UhyveCPU {
fn init(&mut self, entry_point: u64) -> HypervisorResult<()> {
debug!("Initialize VirtualCPU");
/* pstate = all interrupts masked */
let pstate: PSR = PSR::D_BIT | PSR::A_BIT | PSR::I_BIT | PSR::F_BIT | PSR::MODE_EL1H;
self.vcpu.write_register(Register::CPSR, pstate.bits())?... | pub fn new(id: u32, kernel_path: PathBuf, args: Vec<OsString>, vm_start: usize) -> UhyveCPU {
Self {
id,
kernel_path,
args,
vcpu: xhypervisor::VirtualCpu::new().unwrap(),
vm_start,
}
} | function_block-full_function | [
{
"content": "/// Uses Cargo to build a kernel in the `tests/test-kernels` directory.\n\n/// Returns a path to the build binary.\n\npub fn build_hermit_bin(kernel: impl AsRef<Path>) -> PathBuf {\n\n\tlet kernel = kernel.as_ref();\n\n\tprintln!(\"Building Kernel {}\", kernel.display());\n\n\tlet kernel_src_path ... |
Rust | gcode/src/words.rs | Michael-F-Bryan/gcode-rs | 3cfd2fe1787fcd234bf135bbc7250aa1b5b67ca6 | use crate::{
lexer::{Lexer, Token, TokenType},
Comment, Span,
};
use core::fmt::{self, Display, Formatter};
#[derive(Debug, Copy, Clone, PartialEq)]
#[cfg_attr(
feature = "serde-1",
derive(serde_derive::Serialize, serde_derive::Deserialize)
)]
#[repr(C)]
pub struct Word {
pub letter: char,
... | use crate::{
lexer::{Lexer, Token, TokenType},
Comment, Span,
};
use core::fmt::{self, Display, Formatter};
#[derive(Debug, Copy, Clone, PartialEq)]
#[cfg_attr(
feature = "serde-1",
derive(serde_derive::Serialize, serde_derive::Deserialize)
)]
#[repr(C)]
pub struct Word {
pub letter: char,
... | () {
let mut words =
WordsOrComments::new(Lexer::new("(this is a comment) 3.14"));
let got = words.next().unwrap();
let comment = "(this is a comment)";
let expected = Atom::Comment(Comment {
value: comment,
span: Span {
start: 0,
... | fn next(&mut self) -> Option<Self::Item> {
while let Some(token) = self.tokens.next() {
let Token { kind, value, span } = token;
match kind {
TokenType::Unknown => return Some(Atom::Unknown(token)),
TokenType::Comment => {
return Some... | random | [
{
"content": "/// Parse each [`GCode`] in some text, ignoring any errors that may occur or\n\n/// [`Comment`]s that are found.\n\n///\n\n/// This function is probably what you are looking for if you just want to read\n\n/// the [`GCode`] commands in a program. If more detailed information is needed,\n\n/// have... |
Rust | src/lib.rs | JIghtuse/rs-release | e96f2441c02ed1d54ee939856fca87c9bc2b7459 |
#![deny(missing_docs)]
use std::collections::HashMap;
use std::convert::From;
use std::error::Error;
use std::fmt;
use std::fs::File;
use std::io::{BufReader, BufRead};
use std::path::Path;
use std::borrow::Cow;
const PATHS: [&'static str; 2] = ["/etc/os-release", "/usr/lib/os-release"];
const QUOTES: [&'static str... |
#![deny(missing_docs)]
use std::collections::HashMap;
use std::convert::From;
use std::error::Error;
use std::fmt;
use std::fs::File;
use std::io::{BufReader, BufRead};
use std::path::Path;
use std::borrow::Cow;
const PATHS: [&'static str; 2] = ["/etc/os-release", "/usr/lib/os-release"];
const QUOTES: [&'static str... |
fn extract_variable_and_value(s: &str) -> Result<(Cow<'static, str>, String)> {
if let Some(equal) = s.chars().position(|c| c == '=') {
let var = &s[..equal];
let var = var.trim();
let val = &s[equal + 1..];
let val = trim_quotes(val.trim()).to_string();
if let Some(key) =... | fn trim_quotes(s: &str) -> &str {
if QUOTES.iter().any(|q| s.starts_with(q) && s.ends_with(q)) {
&s[1..s.len() - 1]
} else {
s
}
} | function_block-full_function | [
{
"content": "#[derive(Debug)]\n\nenum Error {\n\n UnknownOs,\n\n ReadError,\n\n}\n\n\n",
"file_path": "examples/who_eats_my_hard_drive.rs",
"rank": 5,
"score": 70185.70182749387
},
{
"content": "fn get_os_id() -> Result<String, Error> {\n\n match rs_release::get_os_release() {\n\n ... |
Rust | crates/tm4c129x/src/emac0/vlantg.rs | m-labs/ti2svd | 30145706b658136c35c90290701de3f02a4b8ef2 | #[doc = "Reader of register VLANTG"]
pub type R = crate::R<u32, super::VLANTG>;
#[doc = "Writer for register VLANTG"]
pub type W = crate::W<u32, super::VLANTG>;
#[doc = "Register VLANTG `reset()`'s with value 0"]
impl crate::ResetValue for super::VLANTG {
type Type = u32;
#[inline(always)]
fn reset_value() ... | #[doc = "Reader of register VLANTG"]
pub type R = crate::R<u32, super::VLANTG>;
#[doc = "Writer for register VLANTG"]
pub type W = crate::W<u32, super::VLANTG>;
#[doc = "Register VLANTG `reset()`'s with value 0"]
impl crate::ResetValue for super::VLANTG {
type Type = u32;
#[inline(always)]
fn reset_value() ... | elf) -> ETV_R {
ETV_R::new(((self.bits >> 16) & 0x01) != 0)
}
#[doc = "Bit 17 - VLAN Tag Inverse Match Enable"]
#[inline(always)]
pub fn vtim(&self) -> VTIM_R {
VTIM_R::new(((self.bits >> 17) & 0x01) != 0)
}
#[doc = "Bit 18 - Enable S-VLAN"]
#[inline(always)]
pub fn esvl(... | s)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 18)) | (((value as u32) & 0x01) << 18);
self.w
}
}
#[doc = "Reader of... | 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 | crates/core/src/graph/mod.rs | rustatian/rock | 664825fe85b3649de669d5e498f64267c7676e79 | #![warn(missing_debug_implementations)]
#![allow(dead_code)]
use crate::profile::line::Line;
use crate::profile::Profile;
use crate::profile::{self};
use std::{collections::HashMap, vec};
use std::{
hash::{Hash, Hasher},
path::PathBuf,
};
#[cfg(target_os = "windows")]
const SEPARATOR: &str = "\\";
#[cfg(tar... | #![warn(missing_debug_implementations)]
#![allow(dead_code)]
use crate::profile::line::Line;
use crate::profile::Profile;
use crate::profile::{self};
use std::{collections::HashMap, vec};
use std::{
hash::{Hash, Hasher},
path::PathBuf,
};
#[cfg(target_os = "windows")]
const SEPARATOR: &str = "\\";
#[cfg(tar... |
fn create_nodes<T: Fn(&[i64]) -> i64, U: Fn(i64, String) -> String>(
prof: &Profile,
o: Options<T, U>,
) -> Option<(Nodes, HashMap<u64, Nodes>)> {
let mut locations: HashMap<u64, Nodes> = HashMap::new();
let nm = NodeMap::new();
for l in prof.location.iter() {
... | fn init_graph<T: Fn(&[i64]) -> i64, U: Fn(i64, String) -> String>(
&self,
prof: Profile,
o: Options<T, U>,
) -> Self {
Graph { nodes: vec![] }
} | function_block-full_function | [
{
"content": "#[inline]\n\n#[allow(unused_assignments)]\n\npub fn decode_field(buf: &mut Buffer, data: &mut Vec<u8>) -> Result<Vec<u8>, RockError> {\n\n let result = decode_varint(data);\n\n match result {\n\n Ok(varint) => {\n\n // decode\n\n // 90 -> 1011010\n\n /... |
Rust | src/args.rs | anthraxx/dfrs | ea645d6a9d36510005a08dc6729884e1171cc068 | #![allow(clippy::use_self)]
use structopt::clap::{AppSettings, Shell};
use structopt::StructOpt;
use std::io::stdout;
use anyhow::Result;
use lazy_static::lazy_static;
use std::path::PathBuf;
use strum::VariantNames;
use strum_macros::{EnumString, EnumVariantNames, ToString};
#[derive(Debug, StructOpt)]
#[structopt(... | #![allow(clippy::use_self)]
use structopt::clap::{AppSettings, Shell};
use structopt::StructOpt;
use std::io::stdout;
use anyhow::Result;
use lazy_static::lazy_static;
use std::path::PathBuf;
use strum::VariantNames;
use strum_macros::{EnumString, EnumVariantNames, ToString};
#[derive(Debug, StructOpt)]
#[structopt(... | ble_values=&Shell::variants())]
pub shell: Shell,
}
pub fn gen_completions(args: &Completions) -> Result<()> {
Args::clap().gen_completions_to("dfrs", args.shell, &mut stdout());
Ok(())
}
| atch self {
Self::Base10 => 1000_f64,
Self::Base2 => 1024_f64,
}
}
}
#[derive(Debug, StructOpt, ToString, EnumString, EnumVariantNames)]
#[strum(serialize_all = "snake_case")]
pub enum ColumnType {
Filesystem,
Type,
Bar,
Used,
UsedPercentage,
Available,
A... | random | [
{
"content": "pub fn parse_mounts(f: File) -> Result<Vec<Mount>> {\n\n BufReader::new(f)\n\n .lines()\n\n .map(|line| {\n\n parse_mount_line(&line?)\n\n .context(\"Failed to parse mount line\")\n\n .map_err(Error::from)\n\n })\n\n .collect:... |
Rust | rust/k210-shared/src/soc/sysctl/pll_compute.rs | egcd32/k210-sdk-stuff | ab95e18ba81e011f721237472b1f5434506fd7fb | use core::convert::TryInto;
use libm::F64Ext;
/** PLL configuration */
#[derive(Debug, PartialEq, Eq)]
pub struct Params {
pub clkr: u8,
pub clkf: u8,
pub clkod: u8,
pub bwadj: u8,
}
/* constants for PLL frequency computation */
const VCO_MIN: f64 = 3.5e+08;
const VCO_MAX: f64 = 1.75e+09;
const REF_MI... | use core::convert::TryInto;
use libm::F64Ext;
/** PLL configuration */
#[derive(Debug, PartialEq, Eq)]
pub struct Params {
pub clkr: u8,
pub clkf: u8,
pub clkod: u8,
pub bwadj: u8,
}
/* constants for PLL frequency computation */
const VCO_MIN: f64 = 3.5e+08;
const VCO_MAX: f64 = 1.75e+09;
const REF_MI... |
}
| fn test_ompute_params() {
/* check against output of C implementation */
assert_eq!(compute_params(26_000_000, 1_500_000_000), Some(Params { clkr: 0, clkf: 57, clkod: 0, bwadj: 57 }));
assert_eq!(compute_params(26_000_000, 1_000_000_000), Some(Params { clkr: 0, clkf: 37, clkod: 0, bwadj: 37 }));... | function_block-full_function | [
{
"content": "pub fn set_bit(inval: u32, bit: u8, state: bool) -> u32 {\n\n if state {\n\n inval | (1 << u32::from(bit))\n\n } else {\n\n inval & !(1 << u32::from(bit))\n\n }\n\n}\n\n\n",
"file_path": "rust/k210-shared/src/soc/utils.rs",
"rank": 1,
"score": 305117.4159386919
... |
Rust | src/support/mod.rs | Twinklebear/tobj_viewer | c6f59993eb4bf0a7b1262602fec17884ec48c1f3 | #![allow(dead_code)]
extern crate clock_ticks;
extern crate tobj;
use glium::vertex::VertexBufferAny;
use glium::{self, Display};
use std::f32;
use std::path::Path;
use std::thread;
use std::time::{Duration, Instant};
pub mod camera;
pub enum Action {
Stop,
Continue,
}
pub fn start_loop<F>(mut callback: F)... | #![allow(dead_code)]
extern crate clock_ticks;
extern crate tobj;
use glium::vertex::VertexBufferAny;
use glium::{self, Display};
use std::f32;
use std::path::Path;
use std::thread;
use std::time::{Duration, Instant};
pub mod camera;
pub enum Action {
Stop,
Continue,
}
pub fn start_loop<F>(mut callback: F)... | f32::powf(max_pos[1] - min_pos[1], 2.0)
+ f32::powf(max_pos[2] - min_pos[2], 2.0);
let scale = f32::sqrt(diagonal_len / current_len);
println!("Model scaled by {} to fit", scale);
(
glium::vertex::VertexBuffer::new(display, &vertex_data)
.unwrap()
.into_vertex_buffer_... | function_block-function_prefix_line | [
{
"content": "fn show_test_window<'a>(ui: &Ui<'a>, state: &mut State, opened: &mut bool) {\n\n if state.show_app_metrics {\n\n ui.show_metrics_window(&mut state.show_app_metrics);\n\n }\n\n if state.show_app_main_menu_bar { show_example_app_main_menu_bar(ui, state) }\n\n if state.show_app_aut... | |
Rust | src/ast/pp_visitor.rs | ffwff/iro | 2e92ab30bee7f3ab9036726e383edd8ec788fdd9 | use crate::ast::*;
use crate::compiler::sources;
use bit_set::BitSet;
use std::path::PathBuf;
pub struct PreprocessState {
imported: BitSet<u32>,
total_imported_statements: Vec<NodeBox>,
prelude: Option<PathBuf>,
}
impl PreprocessState {
pub fn new(prelude: Option<PathBuf>) -> Self {
Self {
... | use crate::ast::*;
use crate::compiler::sources;
use bit_set::BitSet;
use std::path::PathBuf;
pub struct PreprocessState {
imported: BitSet<u32>,
total_imported_statements: Vec<NodeBox>,
prelude: Option<PathBuf>,
}
impl PreprocessState {
pub fn new(prelude: Option<PathBuf>) -> Self {
Self {
... |
}
impl<'a> Visitor for PreprocessVisitor<'a> {
fn visit_program(&mut self, n: &mut Program) -> VisitorResult {
for node in &n.exprs {
Self::ungenerate_retvar(node);
node.visit(self)?;
}
if self.file == 0 {
if let Some(state_cell) = self.state {
... | fn import(&mut self, working_path: PathBuf) -> VisitorResult {
if let Some(mut state) = self.state.as_ref().map(|x| x.borrow_mut()) {
let sources = &mut self.sources;
let (index, _) = sources
.read(&working_path)
.map_err(|error| compiler::Error::io_error... | function_block-full_function | [
{
"content": "pub fn mangle_string(source: &str, dest: &mut String) {\n\n for ch in source.chars() {\n\n assert!((0x20..0x7e).contains(&(ch as _)));\n\n dest.push(ch);\n\n }\n\n}\n\n\n",
"file_path": "src/codegen/mangler.rs",
"rank": 0,
"score": 158156.51224327856
},
{
"c... |
Rust | contracts/pylon/gov/src/executions/mod.rs | kyscott18/interest_split | e24541f6ecfb228ab1397a1f058bb45149c413a9 | use cosmwasm_std::{
from_binary, to_binary, CanonicalAddr, CosmosMsg, Decimal, DepsMut, Env, MessageInfo, Order,
Response, Uint128, WasmMsg,
};
use cosmwasm_storage::{ReadonlyBucket, ReadonlySingleton};
use cw20::Cw20ReceiveMsg;
use pylon_token::gov_msg::{
AirdropMsg, Cw20HookMsg, ExecuteMsg, InstantiateMsg... | use cosmwasm_std::{
from_binary, to_binary, CanonicalAddr, CosmosMsg, Decimal, DepsMut, Env, MessageInfo, Order,
Response, Uint128, WasmMsg,
};
use cosmwasm_storage::{ReadonlyBucket, ReadonlySingleton};
use cw20::Cw20ReceiveMsg;
use pylon_token::gov_msg::{
AirdropMsg, Cw20HookMsg, ExecuteMsg, InstantiateMsg... | pub fn migrate(deps: DepsMut, _env: Env, msg: MigrateMsg) -> ExecuteResult {
match msg {
MigrateMsg::State {} => {
let state: LegacyState = ReadonlySingleton::new(deps.storage, b"state")
.load()
.unwrap();
State::save(
deps.storage,
... | function_block-full_function | [
{
"content": "pub fn claim(deps: DepsMut, env: Env, info: MessageInfo, sender: Option<String>) -> ExecuteResult {\n\n let sender = sender\n\n .map(|x| deps.api.addr_validate(x.as_str()).unwrap())\n\n .unwrap_or(info.sender);\n\n\n\n let state = State::load(deps.storage).unwrap();\n\n let ... | |
Rust | src/util/conversions.rs | paigereeves/mmtk-core | d45c5155d3f20bdc4f667c3b08a78f641507966c | use crate::util::constants::*;
use crate::util::heap::layout::vm_layout_constants::*;
use crate::util::Address;
/* Alignment */
pub fn is_address_aligned(addr: Address) -> bool {
addr.is_aligned_to(BYTES_IN_ADDRESS)
}
pub fn page_align_down(address: Address) -> Address {
address.align_down(BYTES_IN_PAGE)
}
... | use crate::util::constants::*;
use crate::util::heap::layout::vm_layout_constants::*;
use crate::util::Address;
/* Alignment */
pub fn is_address_aligned(addr: Address) -> bool {
addr.is_aligned_to(BYTES_IN_ADDRESS)
}
pub fn page_align_down(ad | o_chunk_index(addr: Address) -> usize {
addr >> LOG_BYTES_IN_CHUNK
}
pub fn chunk_index_to_address(chunk: usize) -> Address {
unsafe { Address::from_usize(chunk << LOG_BYTES_IN_CHUNK) }
}
pub const fn raw_align_up(val: usize, align: usize) -> usize {
val.wrapping_add(align).wrapping_sub(1) & !align.w... | dress: Address) -> Address {
address.align_down(BYTES_IN_PAGE)
}
pub fn is_page_aligned(address: Address) -> bool {
address.is_aligned_to(BYTES_IN_PAGE)
}
pub const fn chunk_align_up(addr: Address) -> Address {
addr.align_up(BYTES_IN_CHUNK)
}
pub const fn chunk_align_down(addr: Address) -> Address {
... | random | [
{
"content": "/// Is the address in the mapped memory? The runtime can use this function to check\n\n/// if an address is mapped by MMTk. Note that this is different than is_mapped_object().\n\n/// For malloc spaces, MMTk does not map those addresses (malloc does the mmap), so\n\n/// this function will return f... |
Rust | src/threaded.rs | jneem/dfa-runner | b3e926f79274e0254ecc61c86ec7d8b9874948b9 |
use Engine;
use prefix::{Prefix, PrefixSearcher};
use program::{Program, Instructions};
use std::mem;
use std::cell::RefCell;
use std::ops::DerefMut;
#[derive(Clone, Debug, PartialEq)]
struct Thread {
state: usize,
start_idx: usize,
}
#[derive(Clone, Debug, PartialEq)]
struct Threads {
threads: Vec<Thre... |
use Engine;
use prefix::{Prefix, PrefixSearcher};
use program::{Program, Instructions};
use std::mem;
use std::cell::RefCell;
use std::ops::DerefMut;
#[derive(Clone, Debug, PartialEq)]
struct Thread {
state: usize,
start_idx: usize,
}
#[derive(Clone, Debug, PartialEq)]
struct Threads {
threads: Vec<Thre... | _bytes();
let mut searcher = self.prefix.make_searcher(s);
self.shortest_match_from_searcher(s, &mut *searcher)
}
fn clone_box(&self) -> Box<Engine> {
Box::new(self.clone())
}
}
| ads.cur.threads[i].state;
let start_idx = threads.cur.threads[i].start_idx;
threads.cur.states[state] = 0;
let (next_state, accept) = self.prog.step(state, &input[pos..]);
if let Some(bytes_ago) = accept {
let acc_idx = start_idx.saturating_sub(byte... | random | [
{
"content": "fn loop_searcher<'i, 'lo>(loop_while: &'lo [bool], input: &'i [u8])\n\n-> SimpleSearcher<'i, LoopWhile<'lo>> {\n\n SimpleSearcher {\n\n skip_fn: LoopWhile(loop_while),\n\n input: input,\n\n pos: 0,\n\n }\n\n}\n\n\n\nimpl<'a, Sk: SkipFn> PrefixSearcher for SimpleSearcher<... |
Rust | src/graph/stage/source/refreshable.rs | dmrolfs/proctor | 9b2fac5e80e4a8874906a85302af7b34b4433f46 | use std::fmt::{self, Debug};
use std::future::Future;
use async_trait::async_trait;
use cast_trait_object::dyn_upcast;
use tokio::sync::mpsc;
use crate::graph::shape::SourceShape;
use crate::graph::{stage, Outlet, Port, Stage, PORT_DATA};
use crate::{AppData, ProctorResult, SharedString};
pub struct RefreshableSourc... | use std::fmt::{self, Debug};
use std::future::Future;
use async_trait::async_trait;
use cast_trait_object::dyn_upcast;
use tokio::sync::mpsc;
use crate::graph::shape::SourceShape;
use crate::graph::{stage, Outlet, Port, Stage, PORT_DATA};
use crate::{AppData, ProctorResult, SharedString};
pub struct RefreshableSourc... |
async fn close(mut self: Box<Self>) -> ProctorResult<()> {
tracing::info!("closing refreshable source outlet.");
self.outlet.close().await;
Ok(())
}
}
impl<Ctrl, Out, A, F> Debug for RefreshableSource<Ctrl, Out, A, F>
where
A: Fn(Option<Ctrl>) -> F,
F: Future<Output = Option<O... | async fn run(&mut self) -> ProctorResult<()> {
let mut done = false;
let op = &self.action;
let operation = op(None);
tokio::pin!(operation);
let outlet = &self.outlet;
let rx = &mut self.rx_control;
loop {
let _timer = stage::start_stage_eval_time(... | function_block-full_function | [
{
"content": "#[dyn_upcast]\n\n#[async_trait]\n\npub trait Stage: fmt::Debug + Send + Sync {\n\n fn name(&self) -> SharedString;\n\n async fn check(&self) -> ProctorResult<()>;\n\n async fn run(&mut self) -> ProctorResult<()>;\n\n async fn close(self: Box<Self>) -> ProctorResult<()>;\n\n}\n\n\n",
... |
Rust | logpack-derive/src/encode_derive.rs | da-x/logpack | 4c95c05a415a94d41ff562cde38d77b3e55516c1 | use std::collections::HashSet;
use proc_macro2::{TokenStream as Tokens, Span};
use syn::{Data, DeriveInput, Fields, DataEnum, Ident};
use quote::quote;
pub fn derive(input: &DeriveInput) -> Tokens {
let name = &input.ident;
let generics = super::add_trait_bounds(
input.generics.clone(),
&HashS... | use std::collections::HashSet;
use proc_macro2::{TokenStream as Tokens, Span};
use syn::{Data, DeriveInput, Fields, DataEnum, Ident};
use quote::quote;
pub fn derive(input: &DeriveInput) -> Tokens {
let name = &input.ident;
let generics = super::add_trait_bounds(
input.generics.clone(),
&HashS... |
fn encoder_for_struct_kind(fields: Option<&[&syn::Field]>, named: bool, sizer: bool) -> Tokens {
let unit = fields.is_none();
let fields: Vec<_> = fields.unwrap_or(&[]).iter()
.enumerate().map(|(i, f)| FieldExt::new(f, i, named)).collect();
if unit {
if sizer {
quote![ 0 ]
... | t;
let prefix = if sizer {
quote! {}
} else {
quote! {
let idx : #idx_type = #idx as #idx_type;
idx.logpack_encode(_buf)?;
}
};
idx += 1;
match v.fields {
... | function_block-function_prefixed | [
{
"content": "fn bintype_for_enum(data_enum: &DataEnum) -> Tokens {\n\n let impls = data_enum.variants.iter().map(|v| {\n\n let fields = bintype_for_struct(&v.fields);\n\n let ident = &v.ident;\n\n quote! { (stringify!(#ident), #fields) }\n\n });\n\n\n\n quote!(vec![#(#impls),*])\n... |
Rust | src/main.rs | icefoxen/otter | 518de550ea792ce1c16f7cf353b8dd97bcd4ff57 | extern crate pencil;
#[macro_use]
extern crate log;
extern crate env_logger;
extern crate hoedown;
extern crate git2;
use std::collections::BTreeMap;
use std::fs;
use std::io;
use std::io::Read;
use pencil::helpers;
use pencil::{Pencil, Request, Response, PencilResult, PencilError};
use pencil::http_errors;
use git2... | extern crate pencil;
#[macro_use]
extern crate log;
extern crate env_logger;
extern crate hoedown;
extern crate git2;
use std::collections::BTreeMap;
use std::fs;
use std::io;
use std::io::Read;
use pencil::helpers;
use pencil::{Pencil, Request, Response, PencilResult, PencilError};
use pencil::http_errors;
use git2... | ::from(contents.as_bytes());
let mut html = hoedown::Html::new(hoedown::renderer::html::Flags::empty(), 0);
let buffer = html.render(&md);
let rendered_markdown = buffer.to_str().unwrap();
let mut ctx = BTreeMap::new();
ctx.insert("pagename".to_string(), page.to_string());
... | let page = request.view_args.get("page").unwrap();
let contents = load_page_file(page)?;
let md = hoedown::Markdown | function_block-random_span | [
{
"content": "pub fn clone(repo_url: &str, into_directory: &str) -> Result<String, Error> {\n\n let output = try!(Command::new(\"git\")\n\n .arg(\"clone\")\n\n .arg(repo_url)\n\n .arg(into_directory)\n\n .outp... |
Rust | sw/linalg/src/im4.rs | yupferris/xenowing | 0762908cba96bdd695c9af07f494bf34736b3288 | use crate::fixed::*;
use crate::iv4::*;
use trig::*;
use core::ops::{Mul, MulAssign};
#[derive(Clone, Copy)]
pub struct Im4<const FRACT_BITS: u32> {
pub columns: [Iv4<FRACT_BITS>; 4],
}
impl<const FRACT_BITS: u32> Im4<FRACT_BITS> {
pub fn identity() -> Self {
Self {
columns: [
... | use crate::fixed::*;
use crate::iv4::*;
use trig::*;
use core::ops::{Mul, MulAssign};
#[derive(Clone, Copy)]
pub struct Im4<const FRACT_BITS: u32> {
pub columns: [Iv4<FRACT_BITS>; 4],
}
impl<const FRACT_BITS: u32> Im4<FRACT_BITS> {
pub fn identity() -> Self {
Self {
columns: [
... | (
rows[0].dot(other.columns[0]),
rows[1].dot(other.columns[0]),
rows[2].dot(other.columns[0]),
rows[3].dot(other.columns[0]),
),
Iv4::new(
rows[0].dot(other.columns[1]),
... | [
Iv4::new(2.0 / (right - left), 0.0, 0.0, 0.0),
Iv4::new(0.0, 2.0 / (top - bottom), 0.0, 0.0),
Iv4::new(0.0, 0.0, -2.0 / (z_far - z_near), 0.0),
Iv4::new(tx, ty, tz, 1.0),
]
}
}
pub fn perspective(fov_degrees: f32, aspect: f32... | random | [
{
"content": "pub fn sin(x: f32) -> f32 {\n\n let phase_scale = 1.0 / core::f32::consts::TAU;\n\n let phase = x * phase_scale;\n\n let phase = phase - unsafe { intrinsics::floorf32(phase) };\n\n let phase_with_offset = phase + 1.0;\n\n let bits = phase_with_offset.to_bits();\n\n const NUM_SIGN... |
Rust | memscanner/src/signature/mod.rs | garlond/memscanner | dcc322a6c83133dcc494472933b6be410ca46583 | mod parser;
use super::MemReader;
use failure::{format_err, Error};
#[derive(Clone, Debug, PartialEq, Eq)]
enum Match {
Any,
Position,
Literal(u8),
}
#[derive(Clone, Debug, PartialEq, Eq)]
enum Op {
Asm(Vec<Match>),
Ptr(i32),
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Signature {
op... | mod parser;
use super::MemReader;
use failure::{format_err, Error};
#[derive(Clone, Debug, PartialEq, Eq)]
enum Match {
Any,
Position,
Literal(u8),
}
#[derive(Clone, Debug, PartialEq, Eq)]
enum Op {
Asm(Vec<Match>),
Ptr(i32),
}
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Signature {
op... |
}
| fn single_lea() {
#[rustfmt::skip]
let mem = TestMemReader {
mem: vec![
0xff, 0xff, 0xff, 0xff, 0x00, 0x11, 0x22, 0x33,
0x04, 0x00, 0x00, 0x00, 0x44, 0x55, 0x66, 0x77,
0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff,
],
s... | function_block-full_function | [
{
"content": "fn parse_position(input: &str) -> IResult<&str, Match> {\n\n value(Match::Position, tag(\"^^\"))(input)\n\n}\n\n\n",
"file_path": "memscanner/src/signature/parser.rs",
"rank": 6,
"score": 111181.45690729145
},
{
"content": "fn parse_i32(input: &str) -> IResult<&str, i32> {\n... |
Rust | src/utils.rs | ruoshui-git/mks66-w11_animation | 2324fb210b1b88c44e712d7a5a9790b975223069 | use std::fs::File;
use std::path::Path;
use indicatif::ProgressStyle;
use crate::{
canvas::Canvas,
light::{self, LightProps},
};
pub(crate) fn create_file(filepath: &str) -> File {
let path = Path::new(filepath);
let display = path.display();
match File::create(&path) {
Err(why) => panic... | use std::fs::File;
use std::path::Path;
use indicatif::ProgressStyle;
use crate::{
canvas::Canvas,
light::{self, LightProps},
};
pub(crate) fn create_file(filepath: &str) -> File {
let path = Path::new(filepath);
let display = path.display();
match File::create(&path) {
Err(why) => panic... | ])
}
| img.render_ndc_edges_n1to1(m, color);
} else {
img.render_edge_matrix(m, color);
}
display_ppm(&img);
}
pub(crate) fn display_polygon_matrix(m: &Matrix, ndc: bool) {
let mut img = PPMImg::with_bg(500, 500, 225, RGB::BLACK);
if ndc {
unimplemented!("Displaying polygon matrix in... | random | [
{
"content": "// generate transformation matrices\n\n/// Generate a translation matrix with (dx, dy, dz)\n\npub fn mv(dx: f64, dy: f64, dz: f64) -> Matrix {\n\n let mut m = Matrix::ident(4);\n\n\n\n m.set(3, 0, dx);\n\n m.set(3, 1, dy);\n\n m.set(3, 2, dz);\n\n m\n\n}\n\n\n",
"file_path": "sr... |
Rust | src/cluster/cluster.rs | MilesBreslin/Chunky-Bits | 2338a32b9fd8fbae75173c4e667b4b509128dad3 | use std::{
convert::TryInto,
path::Path,
};
use futures::stream::Stream;
use serde::{
Deserialize,
Serialize,
};
use tokio::{
io,
io::AsyncRead,
};
use crate::{
cluster::{
ClusterNodes,
ClusterProfile,
ClusterProfiles,
Destination,
DestinationInner,
... | use std::{
convert::TryInto,
path::Path,
};
use futures::stream::Stream;
use serde::{
Deserialize,
Serialize,
};
use tokio::{
io,
io::AsyncRead,
};
use crate::{
cluster::{
ClusterNodes,
ClusterProfile,
ClusterProfiles,
Destination,
DestinationInner,
... | parity_chunks(profile.get_parity_chunks())
.write(reader)
.await;
match result {
Ok(mut file_ref) => {
file_ref.content_type = content_type;
self.metadata.write(path, &file_ref).await.unwrap();
(reporter.profile().await, Ok(()))... | fn from_location(
location: impl TryInto<Location, Error = impl Into<LocationParseError>>,
) -> Result<Cluster, MetadataReadError> {
MetadataFormat::Yaml.from_location(location).await
}
pub fn get_file_writer(&self, profile: &ClusterProfile) -> FileWriteBuilder<Destination> {
let de... | random | [
{
"content": "#[derive(Serialize, Deserialize)]\n\nstruct MetadataGitSerde {\n\n #[serde(default)]\n\n pub format: MetadataFormat,\n\n pub path: PathBuf,\n\n}\n\n\n\nimpl From<MetadataGitSerde> for MetadataGit {\n\n fn from(meta: MetadataGitSerde) -> Self {\n\n let MetadataGitSerde { format, ... |
Rust | azul-layout/src/style.rs | dignifiedquire/azul | de204bf2770286866c4da5d049827e04dab22347 |
use crate::geometry::{Offsets, Size};
use crate::number::Number;
use azul_css::PixelValue;
#[derive(Copy, Clone, PartialEq, Debug)]
pub enum AlignItems {
FlexStart,
FlexEnd,
Center,
Baseline,
Stretch,
}
impl Default for AlignItems {
fn default() -> AlignItems {
AlignItems::Stretch
... |
use crate::geometry::{Offsets, Size};
use crate::number::Number;
use azul_css::PixelValue;
#[derive(Copy, Clone, PartialEq, Debug)]
pub enum AlignItems {
FlexStart,
FlexEnd,
Center,
Baseline,
Stretch,
}
impl Default for AlignItems {
fn default() -> AlignItems {
AlignItems::Stretch
... |
pub(crate) fn cross_margin_end(&self, direction: FlexDirection) -> Dimension {
match direction {
FlexDirection::Row | FlexDirection::RowReverse => self.margin.bottom,
FlexDirection::Column | FlexDirection::ColumnReverse => self.margin.right,
}
}
pub(crate) fn align... | pub(crate) fn cross_margin_start(&self, direction: FlexDirection) -> Dimension {
match direction {
FlexDirection::Row | FlexDirection::RowReverse => self.margin.top,
FlexDirection::Column | FlexDirection::ColumnReverse => self.margin.left,
}
} | function_block-full_function | [
{
"content": "/// For a given line number (**NOTE: 0-indexed!**), calculates the Y\n\n/// position of the bottom left corner\n\npub fn get_line_y_position(line_number: usize, font_size_px: f32, line_height_px: f32) -> f32 {\n\n ((font_size_px + line_height_px) * line_number as f32) + font_size_px\n\n}\n\n\n"... |
Rust | polars/polars-arrow/src/builder.rs | Spirans/polars | 7774f419fdbf79bc4c4ec3bd6f0f72d87b32a70c | use crate::bit_util;
use crate::vec::AlignedVec;
pub use arrow::array::LargeStringBuilder;
use arrow::array::{
ArrayBuilder, ArrayData, ArrayRef, BooleanArray, LargeStringArray, PrimitiveArray,
};
use arrow::buffer::{Buffer, MutableBuffer};
use arrow::datatypes::{ArrowPrimitiveType, DataType};
use std::any::Any;
us... | use crate::bit_util;
use crate::vec::AlignedVec;
pub use arrow::array::LargeStringBuilder;
use arrow::array::{
ArrayBuilder, ArrayData, ArrayRef, BooleanArray, LargeStringArray, PrimitiveArray,
};
use arrow::buffer::{Buffer, MutableBuffer};
use arrow::datatypes::{ArrowPrimitiveType, DataType};
use std::any::Any;
us... | extend_from_slice(values);
self.offsets.extend_from_slice(offsets);
}
#[inline]
pub fn append_value(&mut self, value: &str) {
self.values.extend_from_slice(value.as_bytes());
self.offsets.push(self.values.len() as i64);
}
pub fn finish(&mut self) -> LargeStringArray {
... | y(&self) -> bool {
self.values_builder.is_empty()
}
fn finish(&mut self) -> ArrayRef {
Arc::new(self.finish())
}
}
pub struct PrimitiveArrayBuilder<T>
where
T: ArrowPrimitiveType,
T::Native: Default,
{
values: AlignedVec<T::Native>,
bitmap_builder: BooleanBufferBuilder... | random | [
{
"content": "#[inline]\n\npub fn slice_offsets(offset: i64, length: usize, array_len: usize) -> (usize, usize) {\n\n let abs_offset = offset.abs() as usize;\n\n\n\n // The offset counted from the start of the array\n\n // negative index\n\n if offset < 0 {\n\n if abs_offset <= array_len {\n\... |
Rust | crates/holochain/tests/authored_test/mod.rs | MCYBA/holochain | 74a9ac250285d38985fad9d41de3955646549606 | use std::convert::TryFrom;
use std::convert::TryInto;
use std::time::Duration;
use holo_hash::AnyDhtHash;
use holo_hash::EntryHash;
use holochain_state::prelude::fresh_reader_test;
use holochain_wasm_test_utils::TestWasm;
use holochain_zome_types::Entry;
use holochain::test_utils::conductor_setup::ConductorTestData;
... | use std::convert::TryFrom;
use std::convert::TryInto;
use std::time::Duration;
use holo_hash::AnyDhtHash;
use holo_hash::EntryHash;
use holochain_state::prelude::fresh_reader_test;
use holochain_wasm_test_utils::TestWasm;
use holochain_zome_types::Entry;
use holochain::test_utils::conductor_setup::ConductorTestData;
... | .await;
let triggers = handle.get_cell_triggers(&alice_call_data.cell_id).unwrap();
triggers.publish_dht_ops.trigger();
fresh_reader_test(alice_call_data.authored_env.clone(), |txn| {
let basis: AnyDhtHash = entry_hash.clone().into();
let has_authored_entry: bool = txn
... | estData::two_agents(zomes, true).await;
let handle = conductor_test.handle();
let alice_call_data = conductor_test.alice_call_data();
let bob_call_data = conductor_test.bob_call_data().unwrap();
let entry = Post("Hi there".into());
let entry_hash = EntryHash::with_data_sync(&Entry::try_from(entry.c... | random | [
{
"content": "fn consistency(bench: &mut Criterion) {\n\n observability::test_run().ok();\n\n let mut group = bench.benchmark_group(\"consistency\");\n\n group.sample_size(\n\n std::env::var_os(\"BENCH_SAMPLE_SIZE\")\n\n .and_then(|s| s.to_string_lossy().parse::<usize>().ok())\n\n ... |
Rust | src/soft_f32/soft_f32_add.rs | Inokinoki/softfpu-rs | 152f71f131d5d38a4112bf5d2e2c2975af2c1e15 | use super::util::{
f32_shift_right_jam,
f32_norm_round_and_pack,
f32_round_and_pack,
f32_pack_raw, f32_pack,
f32_propagate_nan,
f32_sign, f32_exp, f32_frac,
};
use crate::soft_f32::f32_sub;
pub fn f32_add(a: u32, b: u32) -> u32 {
let mut a_sign = f32_sign(a);
let mut b_sign = f32_... | use super::util::{
f32_shift_right_jam,
f32_norm_round_and_pack,
f32_round_and_pack,
f32_pack_raw, f32_pack,
f32_propagate_nan,
f32_sign, f32_exp, f32_frac,
};
use crate::soft_f32::f32_sub;
pub fn f32_add(a: u32, b: u32) -> u32 {
let mut a_sign = f32_sign(a);
let mut b_sign = f32_... |
}
| fn test_f32_add_inf_nan() {
assert_eq!(crate::soft_f32::f32_add(0x7F800000, 0x3F800000), 0x7F800000);
assert_eq!(crate::soft_f32::f32_add(0xFF800000, 0x3F800000), 0xFF800000);
assert_eq!(crate::soft_f32::f32_is_nan(crate::soft_f32::f32_add(0xFF800000, 0x7F800000)), t... | function_block-full_function | [
{
"content": "pub fn f32_div(a: u32, b: u32) -> u32 {\n\n // Sign\n\n let mut a_sign = f32_sign(a);\n\n let mut b_sign = f32_sign(b);\n\n let mut r_sign = a_sign ^ b_sign;\n\n\n\n // Exp\n\n let mut a_exp = f32_exp(a);\n\n let mut b_exp = f32_exp(b);\n\n let mut r_exp;\n\n\n\n // Frac... |
Rust | third_party/rust_crates/vendor/tokio-executor/src/park.rs | casey/fuchsia | 2b965e9a1e8f2ea346db540f3611a5be16bb4d6b |
use std::marker::PhantomData;
use std::rc::Rc;
use std::sync::Arc;
use std::time::Duration;
use crossbeam_utils::sync::{Parker, Unparker};
pub trait Park {
type Unpark: Unpark;
type Error;
fn unpark(&self) -> Self::Unpark;
... |
use std::marker::PhantomData;
use std::rc::Rc;
use std::sync::Arc;
use std::time::Duration;
use crossbeam_utils::sync::{Parker, Unparker};
pub trait Park {
type Unpark: Unpark;
type Error;
fn unpark(&self) -> Self::Unpark;
... |
}
impl Park for ParkThread {
type Unpark = UnparkThread;
type Error = ParkError;
fn unpark(&self) -> Self::Unpark {
let inner = self.with_current(|inner| inner.unparker().clone());
UnparkThread { inner }
}
fn park(&mut self) -> Result<(), Self::Error> {
self.with_current(... | fn with_current<F, R>(&self, f: F) -> R
where
F: FnOnce(&Parker) -> R,
{
CURRENT_PARKER.with(|inner| f(inner))
} | function_block-function_prefix_line | [] |
Rust | src/db.rs | lovesh/merkle_trees | 0db6b68bbfb219d584a96d503e2d6e4e4c7147a6 | use crate::errors::{MerkleTreeError, MerkleTreeErrorKind};
use num_bigint::BigUint;
use std::collections::HashMap;
use std::iter::FromIterator;
pub trait HashValueDb<H, V: Clone> {
fn put(&mut self, hash: H, value: V) -> Result<(), MerkleTreeError>;
fn get(&self, hash: &H) -> Result<V, MerkleTreeError>;
}
#[... | use crate::errors::{MerkleTreeError, MerkleTreeErrorKind};
use num_bigint::BigUint;
use std::collections::HashMap;
use std::iter::FromIterator;
pub trait HashValueDb<H, V: Clone> {
fn put(&mut self, hash: H, value: V) -> Result<(), MerkleTreeError>;
fn get(&self, hash: &H) -> Result<V, MerkleTreeError>;
}
#[... |
}
impl<T: Clone> InMemoryBigUintHashDb<T> {
pub fn new() -> Self {
let db = HashMap::<Vec<u8>, T>::new();
Self { db }
}
}
#[cfg(test)]
pub mod unqlite_db {
use super::{HashValueDb, MerkleTreeError, MerkleTreeErrorKind};
extern crate unqlite;
use unqlite::{Config, Cursor, UnQ... | fn get(&self, hash: &BigUint) -> Result<V, MerkleTreeError> {
let b = hash.to_bytes_be();
match self.db.get(&b) {
Some(val) => Ok(val.clone()),
None => Err(MerkleTreeErrorKind::HashNotFoundInDB { hash: b }.into()),
}
} | function_block-full_function | [
{
"content": "/// Interface for the database used to store the leaf and node hashes\n\npub trait HashDb<H> {\n\n /// The database stores all leaves\n\n fn add_leaf(&mut self, leaf_hash: H) -> Result<(), MerkleTreeError>;\n\n\n\n /// The database stores roots of all full subtrees of the datbase\n\n f... |
Rust | crates/volta-core/src/tool/node/resolve.rs | gregjopa/volta | 18f6b061d9fe5205010291f586518b93533a2f6f |
use std::fs::File;
use std::io::Write;
use std::str::FromStr;
use std::time::{Duration, SystemTime};
use super::super::registry_fetch_error;
use super::metadata::{NodeEntry, NodeIndex, RawNodeIndex};
use crate::error::{Context, ErrorKind, Fallible};
use crate::fs::{create_staging_file, read_file};
use crate::hook::T... |
use std::fs::File;
use std::io::Write;
use std::str::FromStr;
use std::time::{Duration, SystemTime};
use super::super::registry_fetch_error;
use super::metadata::{NodeEntry, NodeIndex, RawNodeIndex};
use crate::error::{Context, ErrorKind, Fallible};
use crate::fs::{create_staging_file, read_file};
use crate::hook::T... | let index: NodeIndex = resolve_node_versions(url)?.into();
let mut entries = index.entries.into_iter();
Ok(entries
.find(predicate)
.map(|NodeEntry { version, .. }| version))
}
fn read_cached_opt(url: &str) -> Fallible<Option<RawNodeIndex>> {
let expiry_file = volta_home()?.node_index_ex... | o::SERVER_URL)
}
} else {
fn public_node_version_index() -> String {
"https://nodejs.org/dist/index.json".to_string()
}
}
}
pub fn resolve(matching: VersionSpec, session: &mut Session) -> Fallible<Version> {
let hooks = session.hooks()?.node();
match matchin... | random | [
{
"content": "fn resolve_semver_legacy(matching: VersionReq, url: String) -> Fallible<Version> {\n\n let spinner = progress_spinner(&format!(\"Fetching public registry: {}\", url));\n\n let releases: RawYarnIndex = attohttpc::get(&url)\n\n .send()\n\n .and_then(Response::error_for_status)\n\... |
Rust | ethers-solc/src/hh.rs | alxiong/ethers-rs | 133c32d64a53a8ae38e0c8c8a10753e423127782 |
use crate::{
artifacts::{
Bytecode, BytecodeObject, CompactContract, CompactContractBytecode, Contract,
ContractBytecode, DeployedBytecode, LosslessAbi, Offsets,
},
ArtifactOutput,
};
use serde::{Deserialize, Serialize};
use std::collections::btree_map::BTreeMap;
const HH_ARTIFACT_VERSION... |
use crate::{
artifacts::{
Bytecode, BytecodeObject, CompactContract, CompactContractBytecode, Contract,
ContractBytecode, DeployedBytecode, LosslessAbi, Offsets,
},
ArtifactOutput,
};
use serde::{Deserialize, Serialize};
use std::collections::btree_map::BTreeMap;
const HH_ARTIFACT_VERSION... |
}
#[cfg(test)]
mod tests {
use super::*;
use crate::Artifact;
#[test]
fn can_parse_hh_artifact() {
let s = include_str!("../test-data/hh-greeter-artifact.json");
let artifact = serde_json::from_str::<HardhatArtifact>(s).unwrap();
let compact = artifact.into_compact_contract();... | fn contract_to_artifact(&self, file: &str, name: &str, contract: Contract) -> Self::Artifact {
let (bytecode, link_references, deployed_bytecode, deployed_link_references) =
if let Some(evm) = contract.evm {
let (deployed_bytecode, deployed_link_references) =
if l... | function_block-full_function | [
{
"content": "/// Strips the identifier of field declaration from the input and returns it\n\nfn strip_field_identifier(input: &mut &str) -> Result<String> {\n\n let mut iter = input.trim_end().rsplitn(2, is_whitespace);\n\n let name = iter\n\n .next()\n\n .ok_or_else(|| format_err!(\"Expect... |
Rust | language/bytecode-verifier/src/abstract_state.rs | meenxio/libra | da94f03225f93709f18d614a72337e41ba54b3fd |
use crate::{
absint::{AbstractDomain, JoinResult},
borrow_graph::BorrowGraph,
nonce::Nonce,
};
use mirai_annotations::{checked_postcondition, checked_precondition, checked_verify};
use std::collections::{BTreeMap, BTreeSet};
use vm::{
file_format::{
CompiledModule, FieldDefinitionIndex, Kind, ... |
use crate::{
absint::{AbstractDomain, JoinResult},
borrow_graph::BorrowGraph,
nonce::Nonce,
};
use mirai_annotations::{checked_postcondition, checked_precondition, checked_verify};
use std::collections::{BTreeMap, BTreeSet};
use vm::{
file_format::{
CompiledModule, FieldDefinitionIndex, Kind, ... |
fn split_locals(
locals: &BTreeMap<LocalIndex, TypedAbstractValue>,
values: &mut BTreeMap<LocalIndex, Kind>,
references: &mut BTreeMap<LocalIndex, Nonce>,
) {
for (idx, abs_type) in locals {
match abs_type.value {
AbstractValue::Reference(nonce) => {... | state1.locals.keys().any(|idx| {
state1.locals[idx].value.is_value()
&& state1.is_local_borrowed(*idx)
&& !state2.locals.contains_key(idx)
})
} | function_block-function_prefix_line | [
{
"content": "/// Get the StructTag for a StructDefinition defined in a published module.\n\npub fn resource_storage_key(module: &impl ModuleAccess, idx: StructDefinitionIndex) -> StructTag {\n\n let resource = module.struct_def_at(idx);\n\n let res_handle = module.struct_handle_at(resource.struct_handle)... |
Rust | dynomite/src/ext.rs | sbruton/dynomite | 0f3e5a045a0bbd6fd5ae6b1f83c66ccbb0ac6376 |
use crate::dynamodb::{
AttributeValue, BackupSummary, DynamoDb, ListBackupsError, ListBackupsInput, ListTablesError,
ListTablesInput, QueryError, QueryInput, ScanError, ScanInput,
};
use futures::{stream, Stream, TryStreamExt};
#[cfg(feature = "default")]
use rusoto_core_default::RusotoError;
#[cfg(feature = ... |
use crate::dynamodb::{
AttributeValue, BackupSummary, DynamoDb, ListBackupsError, ListBackupsInput, ListTablesError,
ListTablesInput, QueryError, QueryInput, ScanError, ScanInput,
};
use futures::{stream, Stream, TryStreamExt};
#[cfg(feature = "default")]
use rusoto_core_default::RusotoError;
#[cfg(feature = ... | ;
Ok(Some((
stream::iter(resp.items.unwrap_or_default().into_iter().map(Ok)),
next_state,
)))
}
},
)
.try_flatten(),
)
}
}
| match resp.last_evaluated_key.filter(|next| !next.is_empty()) {
Some(next) => PageState::Next(Some(next), input),
_ => PageState::End,
} | if_condition | [
{
"content": "#[proc_macro_error::proc_macro_error]\n\n#[proc_macro_derive(Attributes, attributes(dynomite))]\n\npub fn derive_attributes(input: TokenStream) -> TokenStream {\n\n let ast = syn::parse_macro_input!(input);\n\n\n\n let gen = match expand_attributes(ast) {\n\n Ok(g) => g,\n\n Er... |
Rust | language/bytecode-verifier/src/control_flow.rs | GreyHyphen/dijets | 8c94c5c079fd025929dbd0455fc0e76d62e418c2 |
use move_binary_format::{
errors::{PartialVMError, PartialVMResult},
file_format::{Bytecode, CodeOffset, CodeUnit, FunctionDefinitionIndex},
};
use move_core_types::vm_status::StatusCode;
use std::{collections::HashSet, convert::TryInto};
pub fn verify(
current_function_opt: Option<FunctionDefinitionInde... |
use move_binary_format::{
errors::{PartialVMError, PartialVMResult},
file_format::{Bytecode, CodeOffset, CodeUnit, FunctionDefinitionIndex},
};
use move_core_types::vm_status::StatusCode;
use std::{collections::HashSet, convert::TryInto};
pub fn verify(
current_function_opt: Option<FunctionDefinitionInde... | Err(context.error(StatusCode::INVALID_LOOP_BREAK, i))
}
_ => Ok(()),
}
}
_ => Ok(()),
}
})
}
fn check_no_loop_splits(context: &ControlFlowVerifier, labels: &[Label]) -> PartialVMResult<()> {
let is_break = |loop_s... | op_stack, i, instr| {
match instr {
Bytecode::Branch(j) | Bytecode::BrTrue(j) | Bytecode::BrFalse(j) if *j > i => {
match loop_stack.last() {
Some((_cur_loop, last_continue))
if j > last_continue && *j != last_continue + 1 =>
... | function_block-random_span | [
{
"content": "fn remap_branch_offsets(code: &mut Vec<Bytecode>, fake_to_actual: &HashMap<u16, u16>) {\n\n for instr in code {\n\n match instr {\n\n Bytecode::BrTrue(offset) | Bytecode::BrFalse(offset) | Bytecode::Branch(offset) => {\n\n *offset = fake_to_actual[offset]\n\n ... |
Rust | src/systems/collision.rs | Jazarro/evoli | fe817899c4381bc98b294ae124f12301a711c664 | use amethyst::renderer::{debug_drawing::DebugLinesComponent, palette::Srgba};
use amethyst::shrev::{EventChannel, ReaderId};
use amethyst::{core::math::Point3, core::Transform, ecs::prelude::*};
use log::info;
use std::f32;
#[cfg(feature = "profiler")]
use thread_profiler::profile_scope;
use crate::components::collide... | use amethyst::renderer::{debug_drawing::DebugLinesComponent, palette::Srgba};
use amethyst::shrev::{EventChannel, ReaderId};
use amethyst::{core::math::Point3, core::Transform, ecs::prelude::*};
use log::info;
use std::f32;
#[cfg(feature = "profiler")]
use thread_profiler::profile_scope;
use crate::components::collide... | if pos.y > bounds.top {
local.translation_mut().y = bounds.top;
} else if pos.y < bounds.bottom {
local.translation_mut().y = bounds.bottom;
}
}
}
}
#[derive(Debug, Clone)]
pub struct CollisionEvent {
pub entity_a: Entity,
pub entity_b: En... | al.translation().clone();
if pos.x > bounds.right {
local.translation_mut().x = bounds.right;
} else if pos.x < bounds.left {
local.translation_mut().x = bounds.left;
}
| function_block-random_span | [
{
"content": "// Once the prefabs are loaded, this function is called to update the ekeys in the CreaturePrefabs struct.\n\n// We use the Named component of the entity to determine which key to use.\n\npub fn update_prefabs(world: &mut World) {\n\n let updated_prefabs = {\n\n let creature_prefabs = wo... |
Rust | src/operation/aggregate/change_stream.rs | moy2010/mongo-rust-driver | dc085119dac3943773115bf4a0f923d17156dd06 | use crate::{
bson::{doc, Document},
change_stream::{event::ResumeToken, ChangeStreamData, WatchArgs},
cmap::{Command, RawCommandResponse, StreamDescription},
cursor::CursorSpecification,
error::Result,
operation::{append_options, Operation, Retryability},
options::{ChangeStreamOptions, Selec... | use crate::{
bson::{doc, Document},
change_stream::{event::ResumeToken, ChangeStreamData, WatchArgs},
cmap::{Command, RawCommandResponse, StreamDescription},
cursor::CursorSpecification,
error::Result,
operation::{append_options, Operation, Retryability},
options::{ChangeStreamOptions, Selec... |
fn handle_response(
&self,
response: RawCommandResponse,
description: &StreamDescription,
) -> Result<Self::O> {
let op_time = response
.raw_body()
.get("operationTime")?
.and_then(bson::RawBsonRef::as_timestamp);
let spec = self.inne... | fn extract_at_cluster_time(
&self,
response: &bson::RawDocument,
) -> Result<Option<bson::Timestamp>> {
self.inner.extract_at_cluster_time(response)
} | function_block-full_function | [
{
"content": "fn build_test(db_name: &str, mut list_collections: ListCollections, mut expected_body: Document) {\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 asser... |
Rust | sync/src/synchronizer/headers_process.rs | Taem42/ckb | 9d43dee13a350fe75f62b75915c3c932f129a3f5 | use crate::block_status::BlockStatus;
use crate::synchronizer::Synchronizer;
use crate::types::{ActiveChain, SyncShared};
use crate::{Status, StatusCode, MAX_HEADERS_LEN};
use ckb_error::{Error, ErrorKind};
use ckb_logger::{debug, log_enabled, warn, Level};
use ckb_network::{CKBProtocolContext, PeerIndex};
use ckb_trai... | use crate::block_status::BlockStatus;
use crate::synchronizer::Synchronizer;
use crate::types::{ActiveChain, SyncShared};
use crate::{Status, StatusCode, MAX_HEADERS_LEN};
use ckb_error::{Error, ErrorKind};
use ckb_logger::{debug, log_enabled, warn, Level};
use ckb_network::{CKBProtocolContext, PeerIndex};
use ckb_trai... | .nc
.disconnect(self.peer, "useless outbound peer in IBD")
{
return StatusCode::Network.with_context(format!("Disconnect error: {:?}", err));
}
}
Status::ok()
}
}
#[derive(Clone)]
pub struct HeaderAcceptor<'a, V: Verifier> {
head... | N {
shared.state().misbehavior(self.peer, 20);
warn!("HeadersProcess is_oversize");
return Status::ok();
}
if headers.is_empty() {
self.synchronizer
.peers()
.state
.write()
.get... | random | [
{
"content": "pub fn inherit_block(shared: &Shared, parent_hash: &Byte32) -> BlockBuilder {\n\n let snapshot = shared.snapshot();\n\n let parent = snapshot.get_block(parent_hash).unwrap();\n\n let parent_epoch = snapshot.get_block_epoch(parent_hash).unwrap();\n\n let parent_number = parent.header().... |
Rust | src/linux/mod.rs | 8176135/InputBot | e54b3a04cccbcdead0141a42688d2cf7e89fd6d4 | use crate::{common::*, linux::inputs::*, public::*};
use input::{
event::{
keyboard::{
KeyState, {KeyboardEvent, KeyboardEventTrait},
},
pointer::{ButtonState, PointerEvent::*},
Event::{self, *},
},
Libinput, LibinputInterface,
};
use nix::{
fcntl::{open, OFla... | use crate::{common::*, linux::inputs::*, public::*};
use input::{
event::{
keyboard::{
KeyState, {KeyboardEvent, KeyboardEventTrait},
},
pointer::{ButtonState, PointerEvent::*},
Event::{self, *},
},
Libinput, LibinputInterface,
};
use nix::{
fcntl::{open, OFla... | &LibinputInterfaceRaw.seat())
.unwrap();
while !MOUSE_BINDS.lock().unwrap().is_empty() || !KEYBD_BINDS.lock().unwrap().is_empty() {
libinput_context.dispatch().unwrap();
while let Some(event) = libinput_context.next() {
handle_input_event(event);
}
sleep(Duration:... | ss(self) {
let mut device = FAKE_DEVICE.lock().unwrap();
device
.write(0x01, key_to_scan_code(self), 1)
.unwrap();
device.synchronize().unwrap();
}
pub fn release(self) {
let mut device = FAKE_DEVICE.lock().unwrap();
device
.write(0x... | random | [
{
"content": "pub fn handle_input_events() {\n\n if !MOUSE_BINDS.lock().unwrap().is_empty() {\n\n set_hook(WH_MOUSE_LL, &*MOUSE_HHOOK, mouse_proc);\n\n };\n\n if !KEYBD_BINDS.lock().unwrap().is_empty() {\n\n set_hook(WH_KEYBOARD_LL, &*KEYBD_HHOOK, keybd_proc);\n\n };\n\n let mut msg... |
Rust | src/wayland/output/xdg.rs | rano-oss/smithay | a06e8b231e305cda37f68c63f872d468d673d598 |
use std::{
ops::Deref as _,
sync::{Arc, Mutex},
};
use slog::{o, trace};
use wayland_protocols::unstable::xdg_output::v1::server::{
zxdg_output_manager_v1::{self, ZxdgOutputManagerV1},
zxdg_output_v1::ZxdgOutputV1,
};
use wayland_server::{protocol::wl_output::WlOutput, Display, Filter, Global, Main};... |
use std::{
ops::Deref as _,
sync::{Arc, Mutex},
};
use slog::{o, trace};
use wayland_protocols::unstable::xdg_output::v1::server::{
zxdg_output_manager_v1::{self, ZxdgOutputManagerV1},
zxdg_output_v1::ZxdgOutputV1,
};
use wayland_server::{protocol::wl_output::WlOutput, Display, Filter, Global, Main};... | L: Into<Option<::slog::Logger>>,
{
let log = crate::slog_or_fallback(logger).new(o!("smithay_module" => "xdg_output_handler"));
display.create_global(
3,
Filter::new(move |(manager, _version): (Main<ZxdgOutputManagerV1>, _), _, _| {
let log = log.clone();
manager.quick_a... | function_block-function_prefix_line | [
{
"content": "/// Initialize a tablet manager global.\n\npub fn init_tablet_manager_global(display: &mut Display) -> Global<ZwpTabletManagerV2> {\n\n display.create_global::<ZwpTabletManagerV2, _>(\n\n MANAGER_VERSION,\n\n Filter::new(\n\n move |(manager, _version): (Main<ZwpTabletMa... | |
Rust | src/list.rs | mantono/giss | 867d2143196e631a875207684c5be45abb3feae7 | use crate::search::{GraphQLQuery, SearchIssues, SearchQuery, Type};
use crate::{
api::ApiError,
cfg::Config,
issue::{Issue, Root},
project::Project,
sort::Sorting,
AppErr,
};
use crate::{user::Username, Target};
use core::fmt;
use std::{
sync::mpsc::{SendError, SyncSender},
time::Instant... | use crate::search::{GraphQLQuery, SearchIssues, SearchQuery, Type};
use crate::{
api::ApiError,
cfg::Config,
issue::{Issue, Root},
project::Project,
sort::Sorting,
AppErr,
};
use crate::{user::Username, Target};
use core::fmt;
use std::{
sync::mpsc::{SendError, SyncSender},
time::Instant... |
impl From<SendError<Issue>> for AppErr {
fn from(_: SendError<Issue>) -> Self {
AppErr::ChannelError
}
}
impl From<ApiError> for AppErr {
fn from(err: ApiError) -> Self {
log::error!("{:?}", err);
match err {
ApiError::NoResponse(_) => AppErr::ApiError,
Api... | fn create_query(kind: Type, user: &Option<String>, targets: &[Target], config: &FilterConfig) -> SearchIssues {
let assignee: Option<String> = match config.assigned_only {
false => None,
true => match kind {
Type::Issue | Type::PullRequest => user.clone(),
Type::ReviewRequest... | function_block-full_function | [
{
"content": "fn save_username(token: &str, username: &str) -> Result<(), std::io::Error> {\n\n let token_hash: String = hash_token(token);\n\n let mut path: PathBuf = get_users_dir();\n\n std::fs::create_dir_all(&path)?;\n\n path.push(token_hash);\n\n let mut file: File = File::create(&path)?;\n... |
Rust | osm2lanes/src/transform/tags_to_lanes/counts.rs | a-b-street/osm2lanes | e24d9762dc50f8d83b57f0a0737e2626823133a4 | use super::{Infer, Oneway};
use crate::locale::Locale;
use crate::tag::{Highway, TagKey, Tags};
use crate::transform::tags_to_lanes::modes::BusLaneCount;
use crate::transform::{RoadWarnings, TagsToLanesMsg};
#[derive(Debug)]
pub enum Counts {
One,
Directional {
forward: Infer<usize>,
backward:... | use super::{Infer, Oneway};
use crate::locale::Locale;
use crate::tag::{Highway, TagKey, Tags};
use crate::transform::tags_to_lanes::modes::BusLaneCount;
use crate::transform::{RoadWarnings, TagsToLanesMsg};
#[derive(Debug)]
pub enum Counts {
One,
Directional {
forward: Infer<usize>,
backward:... | l / 2),
centre_turn_lane,
}
} else {
let remaining_lanes = l - both_ways - bus.forward - bus.backward;
if remaining_lanes % 2 != 0 {
warnings.push(... | "lanes:both_ways",
"lanes:backward",
])));
}
if let Some(total) = lanes.total {
let forward = total - both_ways - bus.backward;
let result = Self::Dire... | random | [
{
"content": "fn set_cycleway(lanes: &[Lane], tags: &mut Tags, oneway: bool) -> Result<(), LanesToTagsMsg> {\n\n let left_cycle_lane: Option<Direction> = lanes\n\n .iter()\n\n .take_while(|lane| !lane.is_motor())\n\n .find(|lane| lane.is_bicycle())\n\n .and_then(Lane::direction);\... |
Rust | src/options.rs | sunsided/realsense-rust | 6908a3d6ca172b8d7f388c10434b1800ceefafbe | use crate::{
common::*,
error::{ErrorChecker, Result as RsResult},
kind::Rs2Option,
};
pub trait ToOptions {
fn to_options(&self) -> RsResult<HashMap<Rs2Option, OptionHandle>> {
let options_ptr = self.get_options_ptr();
unsafe {
let list_ptr = {
let mut check... | use crate::{
common::*,
error::{ErrorChecker, Result as RsResult},
kind::Rs2Option,
};
pub trait ToOptions {
fn to_options(&self) -> RsResult<HashMap<Rs2Option, OptionHandle>> {
let options_ptr = self.get_options_ptr();
unsafe {
let list_ptr = {
let mut check... | let mut checker = ErrorChecker::new();
let val = realsense_sys::rs2_is_option_read_only(
self.ptr.as_ptr(),
self.option as realsense_sys::rs2_option,
checker.inner_mut_ptr(),
);
checker.check()?;
Ok(val != 0)
... | n =
realsense_sys::rs2_get_options_list_size(list_ptr, checker.inner_mut_ptr());
checker.check()?;
len
};
let handles = (0..len)
.map(|index| {
let mut checker = ErrorChecker::new();
let ... | random | [
{
"content": "#[cfg(all(feature = \"with-image\", feature = \"with-nalgebra\"))]\n\nfn main() -> Result<()> {\n\n example::main()\n\n}\n\n\n",
"file_path": "examples/capture_images.rs",
"rank": 1,
"score": 91129.60982840325
},
{
"content": "fn main() -> Result<()> {\n\n println!(\"Look... |
Rust | src/main.rs | mbaumfalk/scheme | a00669a59d127d24b7bab87c5abe369f7a2a8ddf | extern crate nom;
use nom::{
branch::alt,
bytes::streaming::{tag, take_until, take_while1},
character::streaming::{
anychar, char, digit1, hex_digit1, line_ending, multispace0, none_of, oct_digit1,
},
combinator::opt,
error::{Error, ErrorKind::Char},
multi::{many0, many1},
sequen... | extern crate nom;
use nom::{
branch::alt,
bytes::streaming::{tag, take_until, take_while1},
character::streaming::{
anychar, char, digit1, hex_digit1, line_ending, multispace0, none_of, oct_digit1,
},
combinator::opt,
error::{Error, ErrorKind::Char},
multi::{many0, many1},
sequen... |
}
fn lisptoken(input: &str) -> IResult<&str, char> {
none_of("'()# \"\r\n")(input)
}
fn cons(input: &str) -> IResult<&str, LispData> {
let (input, _) = char('(')(input)?;
let (input, _) = multispace0(input)?;
let (input, middle) = many0(terminated(lisp_data, multispace0))(input)?;
let (input, dot... | a, b) => {
write!(f, "({}", a)?;
write_cdr(&b, f)?;
write!(f, ")")
}
}
} | function_block-function_prefixed | [] |
Rust | day-12/src/main.rs | kecors/AoC-2018 | dd213e9087639ace4788c94daa4a85fedc635162 | use pom::parser::*;
use pom::Error;
use std::collections::HashMap;
use std::collections::VecDeque;
use std::io::{stdin, Read};
#[derive(Debug)]
struct Pot {
number: i32,
plant: bool,
}
#[derive(Debug)]
struct Note {
neighbors: Vec<bool>,
next_generation: bool,
}
#[derive(Debug)]
struct Engine {
p... | use pom::parser::*;
use pom::Error;
use std::collections::HashMap;
use std::collections::VecDeque;
use std::io::{stdin, Read};
#[derive(Debug)]
struct Pot {
number: i32,
plant: bool,
}
#[derive(Debug)]
struct Note {
neighbors: Vec<bool>,
next_generation: bool,
}
#[derive(Debug)]
struct Engine {
p... | engine_p2.next_generation();
println!("[{}] sum = {}", x, engine_p2.sum());
engine_p2.display();
println!();
}
println!("patterns = {:#?}", patterns);
let part2: u64 = (50_000_000_000 - 158) * 86 + 16002;
println!(
"Part 2: After fifty billion generations, the sum of the... | number: front_number - x,
plant: false,
});
self.pots.push_back(Pot {
number: back_number + x,
plant: false,
});
}
let mut new_pots = VecDeque::new();
for j in 0..self.pots.len(... | random | [
{
"content": "fn number<'a>() -> Parser<'a, u8, i32> {\n\n let integer = (one_of(b\"123456789\") - one_of(b\"0123456789\").repeat(0..)) | sym(b'0');\n\n let number = sym(b'-').opt() + integer;\n\n number\n\n .collect()\n\n .convert(str::from_utf8)\n\n .convert(|s| i32::from_str_rad... |
Rust | ruma-events/tests/pdu.rs | ignatenkobrain/ruma | 1c47963befcf241f1dbd0e9ad12ab3dfd7ef54cc | #![cfg(not(feature = "unstable-pre-spec"))]
use std::{
collections::BTreeMap,
time::{Duration, SystemTime},
};
use ruma_events::{
pdu::{EventHash, Pdu, RoomV1Pdu, RoomV3Pdu},
EventType,
};
use ruma_identifiers::{event_id, room_id, server_name, server_signing_key_id, user_id};
use serde_json::{from_val... | #![cfg(not(feature = "unstable-pre-spec"))]
use std::{
collections::BTreeMap,
time::{Duration, SystemTime},
};
use ruma_events::{
pdu::{EventHash, Pdu, RoomV1Pdu, RoomV3Pdu},
EventType,
};
use ruma_identifiers::{event_id, room_id, server_name, server_signing_key_id, user_id};
use serde_json::{from_val... | rg")),
unsigned,
hashes: EventHash { sha256: "1233543bABACDEF".into() },
signatures,
};
let pdu_stub = Pdu::RoomV3Pdu(v3_pdu);
let json = json!({
"room_id": "!n8f893n9:example.com",
"sender": "@sender:example.com",
"origin": "matrix.org",
"origin_serve... | 2_u32.into(),
auth_events: vec![(
event_id!("$someauthevent:matrix.org"),
EventHash { sha256: "21389CFEDABC".into() },
)],
redacts: Some(event_id!("$9654:matrix.org")),
unsigned,
hashes: EventHash { sha256: "1233543bABACDEF".into() },
signatures,
... | random | [
{
"content": "fn aliases_event_with_prev_content() -> JsonValue {\n\n json!({\n\n \"content\": {\n\n \"aliases\": [ \"#somewhere:localhost\" ]\n\n },\n\n \"event_id\": \"$h29iv0s8:example.com\",\n\n \"origin_server_ts\": 1,\n\n \"prev_content\": {\n\n ... |
Rust | src/graphics/shader.rs | mooman219/glpaly | 7731c705614ee2de8bc8685dc28361caa050a0af | use crate::graphics::{
graphics, resource, std140::Std140Struct, Buffer, DrawMode, Texture, Uniform, VertexDescriptor,
};
use crate::{App, Context};
use alloc::format;
use core::iter::IntoIterator;
use core::marker::PhantomData;
pub trait ShaderDescriptor<const TEXTURES: usize> {
const VERTEX_SHADER: &'static ... | use crate::graphics::{
graphics, resource, std140::Std140Struct, Buffer, DrawMode, Texture, Uniform, VertexDescriptor,
};
use crate::{App, Context};
use alloc::format;
use core::iter::IntoIterator;
use core::marker::PhantomData;
pub trait ShaderDescriptor<const TEXTURES: usize> {
const VERTEX_SHADER: &'static ... |
fn draw_instanced<'a, Item, Iter>(
&self,
mode: DrawMode,
uniform: &Uniform<T::VertexUniformType>,
textures: [&Texture; TEXTURES],
buffers: Iter,
count: i32,
) where
Item: AsRef<Buffer<T::VertexDescriptor>> + ... | let instancing = T::VertexDescriptor::INSTANCING;
if instancing.is_instanced() {
self.draw_instanced(mode, uniform, textures, buffers, instancing.count);
} else {
self.draw_non_instanced(mode, uniform, textures, buffers);
}
} | function_block-function_prefix_line | [
{
"content": "/// Type that holds all of your application state and handles events.\n\npub trait App: 'static + Sized {\n\n /// Function to create the app from a context.\n\n /// # Arguments\n\n ///\n\n /// * `ctx` - The engine context. This can be used to call various API functions.\n\n fn new(_... |
Rust | src/find.rs | jqnatividad/csvlens | 5d9f82e4e17145f0df324dfff39b29a257aab6bd | use crate::csv;
use anyhow::Result;
use regex::Regex;
use std::cmp::min;
use std::sync::{Arc, Mutex, MutexGuard};
use std::thread::{self};
use std::time::Instant;
pub struct Finder {
internal: Arc<Mutex<FinderInternalState>>,
cursor: Option<usize>,
row_hint: usize,
target: Regex,
}
#[derive(Clone, Deb... | use crate::csv;
use anyhow::Result;
use regex::Regex;
use std::cmp::min;
use std::sync::{Arc, Mutex, MutexGuard};
use std::thread::{self};
use std::time::Instant;
pub struct Finder {
internal: Arc<Mutex<FinderInternalState>>,
cursor: Option<usize>,
row_hint: usize,
target: Regex,
}
#[derive(Clone, Deb... |
pub fn prev(&mut self) -> Option<FoundRecord> {
let m_guard = self.internal.lock().unwrap();
if let Some(n) = self.cursor {
self.cursor = Some(n.saturating_sub(1));
} else {
let count = m_guard.count;
if count > 0 {
self.cursor = Some(m_g... | let m_guard = self.internal.lock().unwrap();
let count = m_guard.count;
if let Some(n) = self.cursor {
if n + 1 < count {
self.cursor = Some(n + 1);
}
} else if count > 0 {
self.cursor = Some(m_guard.next_from(self.row_hint));
}
... | function_block-function_prefix_line | [
{
"content": "struct ReaderInternalState {\n\n total_line_number: Option<usize>,\n\n total_line_number_approx: Option<usize>,\n\n pos_table: Vec<Position>,\n\n done: bool,\n\n}\n\n\n\nimpl ReaderInternalState {\n\n fn init_internal(config: Arc<CsvConfig>) -> (Arc<Mutex<ReaderInternalState>>, Join... |
Rust | arrow/src/buffer/ops.rs | zhaox1n/arrow-rs | d2cec2ccef6adf92754883bd58a7fdd4858c02a9 |
#[cfg(feature = "simd")]
use crate::util::bit_util;
#[cfg(feature = "simd")]
use packed_simd::u8x64;
#[cfg(feature = "avx512")]
use crate::arch::avx512::*;
use crate::util::bit_util::ceil;
#[cfg(any(feature = "simd", feature = "avx512"))]
use std::borrow::BorrowMut;
use super::{Buffer, MutableBuffer};
#[cfg(featur... |
#[cfg(feature = "simd")]
use crate::util::bit_util;
#[cfg(feature = "simd")]
use packed_simd::u8x64;
#[cfg(feature = "avx512")]
use crate::arch::avx512::*;
use crate::util::bit_util::ceil;
#[cfg(any(feature = "simd", feature = "avx512"))]
use std::borrow::BorrowMut;
use super::{Buffer, MutableBuffer};
#[cfg(featur... |
#[cfg(all(target_arch = "x86_64", feature = "avx512"))]
pub fn buffer_bin_and(
left: &Buffer,
left_offset_in_bits: usize,
right: &Buffer,
right_offset_in_bits: usize,
len_in_bits: usize,
) -> Buffer {
if left_offset_in_bits % 8 == 0
&& right_offset_in_bits % 8 == 0
&& len_in_bi... | pub fn bitwise_unary_op_helper<F>(
left: &Buffer,
offset_in_bits: usize,
len_in_bits: usize,
op: F,
) -> Buffer
where
F: Fn(u64) -> u64,
{
let mut result =
MutableBuffer::new(ceil(len_in_bits, 8)).with_bitset(len_in_bits / 64 * 8, false);
let left_chunks = left.bit_chunks(offse... | function_block-full_function | [
{
"content": "fn bench_buffer_and(left: &Buffer, right: &Buffer) {\n\n criterion::black_box((left & right).unwrap());\n\n}\n\n\n",
"file_path": "arrow/benches/buffer_bit_ops.rs",
"rank": 2,
"score": 380009.3854061781
},
{
"content": "fn bench_buffer_or(left: &Buffer, right: &Buffer) {\n\n... |
Rust | sdk/program/src/entrypoint_deprecated.rs | rob-ti/SAFE | 315d06c27d3923472ef8f94f04be4bfe762dd91a |
extern crate alloc;
use crate::{account_info::AccountInfo, program_error::ProgramError, pubkey::Pubkey};
use alloc::vec::Vec;
use std::{
cell::RefCell,
mem::size_of,
rc::Rc,
result::Result as ResultGeneric,
slice::{from_raw_parts, from_raw_parts_mut},
};
pub type ProgramResult = ResultGeneri... |
extern crate alloc;
use crate::{account_info::AccountInfo, program_error::ProgramError, pubkey::Pubkey};
use alloc::vec::Vec;
use std::{
cell::RefCell,
mem::size_of,
rc::Rc,
result::Result as ResultGeneric,
slice::{from_raw_parts, from_raw_parts_mut},
};
pub type ProgramResult = ResultGeneri... | let mut accounts = Vec::with_capacity(num_accounts);
for _ in 0..num_accounts {
let dup_info = *(input.add(offset) as *const u8);
offset += size_of::<u8>();
if dup_info == std::u8::MAX {
#[allow(clippy::cast_ptr_alignment)]
let is_signer = *(input.add(offset) as *cons... | function_block-function_prefix_line | [
{
"content": "/// Create `AccountInfo`s\n\npub fn create_account_infos(accounts: &mut [(Pubkey, Account)]) -> Vec<AccountInfo> {\n\n accounts.iter_mut().map(Into::into).collect()\n\n}\n\n\n",
"file_path": "sdk/src/account.rs",
"rank": 0,
"score": 425486.5331603654
},
{
"content": "pub fn ... | |
Rust | src/config.rs | AmaranthineCodices/whimsy | e46684a0e66277a18694324268e8635cdc22f054 | use std::default::Default;
use std::path::{Path, PathBuf};
use crate::keybind;
lazy_static::lazy_static! {
pub static ref DEFAULT_CONFIG_PATH: PathBuf = {
let mut cfg_dir = dirs::config_dir().expect("Could not find user configuration directory.");
cfg_dir.push("whimsy");
cfg_dir.push("whim... | use std::default::Default;
use std::path::{Path, PathBuf};
use crate::keybind;
lazy_static::lazy_static! {
pub static ref DEFAULT_CONFIG_PATH: PathBuf = {
let mut cfg_dir = dirs::config_dir().expect("Could not find user configuration directory.");
cfg_dir.push("whimsy");
cfg_dir.push("whim... |
}
pub fn read_config_from_file(path: &dyn AsRef<Path>) -> Result<Option<Config>, ConfigReadError> {
if !path.as_ref().exists() {
return Ok(None);
}
let config_string = std::fs::read_to_string(path).map_err(|e| ConfigReadError::IoError(e))?;
serde_yaml::from_str(&config_string).map_err(|e| Con... | fn default() -> Self {
Config {
directives: ConfigDirectives::default(),
bindings: vec![
Binding {
key: keybind::Key::Left,
modifiers: vec![keybind::Modifier::Super, keybind::Modifier::Shift],
action: Action::Pus... | function_block-full_function | [
{
"content": "fn modifier_to_flag_code(modifier: &Modifier) -> isize {\n\n match modifier {\n\n Modifier::Control => winuser::MOD_CONTROL,\n\n Modifier::Alt => winuser::MOD_ALT,\n\n Modifier::Shift => winuser::MOD_SHIFT,\n\n Modifier::Super => winuser::MOD_WIN,\n\n }\n\n}\n\n\n... |
Rust | src/codegen.rs | tamaroning/ironcc | c75f6dfc300ee44154cd68b5d7f3801bfeb40279 | extern crate llvm_sys as llvm;
use self::llvm::core::*;
use self::llvm::prelude::*;
use crate::node;
use crate::types;
/*
use self::llvm::execution_engine;
use self::llvm::target::*;
use llvm::execution_engine::LLVMCreateExecutionEngineForModule;
use llvm::execution_engine::LLVMDisposeExecutionEngine;
use llvm::executi... | extern crate llvm_sys as llvm;
use self::llvm::core::*;
use self::llvm::prelude::*;
use crate::node;
use crate::types;
/*
use self::llvm::execution_engine;
use self::llvm::target::*;
use llvm::execution_engine::LLVMCreateExecutionEngineForModule;
use llvm::execution_engine::LLVMDisposeExecutionEngine;
use llvm::executi... |
pub unsafe fn gen_load(&mut self, ast: &AST) -> Option<(LLVMValueRef, Option<Type>)> {
match ast {
AST::Variable(ref name) => {
let (val, ty) = self.gen(ast).unwrap();
let ty = ty.unwrap();
let ret = LLVMBuildLoad(self.builder, val, cstr... | cstr("ne").as_ptr(),
),
BinaryOps::Lt => LLVMBuildICmp(
self.builder,
llvm::LLVMIntPredicate::LLVMIntSLT,
*lhs_val,
*rhs_val,
cstr("lt").as_ptr(),
),
BinaryOps::Le => LLVMBuildICmp(
... | function_block-function_prefix_line | [
{
"content": "pub fn error(line: u32, msg: &str) {\n\n println!(\" Error: line:{} {}\", line, msg);\n\n process::exit(-1);\n\n}",
"file_path": "src/error.rs",
"rank": 0,
"score": 81268.38232700378
},
{
"content": "pub fn run(filepath: String, tokens: Vec<Token>) -> Vec<AST> {\n\n le... |
Rust | day07/src/main.rs | pkusensei/adventofcode2020 | 116b462afa8f5d05d221d312644a7b870954fc92 | use std::{collections::HashMap, str::FromStr};
fn main() {
let input = tools::read_input("input.txt").unwrap();
let rules = parse_rules(&input);
println!("To Shiny gold: {}", count_shiny_gold(&rules));
println!(
"Shiny gold contains: {}",
count_contained(&rules, "shiny gold") - 1
)
... | use std::{collections::HashMap, str::FromStr};
fn main() {
let input = tools::read_input("input.txt").unwrap();
let rules = parse_rules(&input);
println!("To Shiny gold: {}", count_shiny_gold(&rules));
println!(
"Shiny gold contains: {}",
count_contained(&rules, "shiny gold") - 1
)
... | s);
assert_eq!(126, count_contained(&rules, "shiny gold") - 1);
}
}
}
| ontain 2 dark orange bags.
dark orange bags contain 2 dark yellow bags.
dark yellow bags contain 2 dark green bags.
dark green bags contain 2 dark blue bags.
dark blue bags contain 2 dark violet bags.
dark violet bags contain no other bags."#
.split('\n')
... | function_block-random_span | [
{
"content": "fn group_answers(lines: &[String]) -> Vec<Vec<&str>> {\n\n let mut groups = vec![];\n\n let mut one_group = vec![];\n\n for line in lines {\n\n if line.trim().is_empty() {\n\n groups.push(one_group.clone());\n\n one_group.clear()\n\n } else {\n\n ... |
Rust | azure_sdk_cosmos/src/resource_quota.rs | guywaldman/azure-sdk-for-rust | 638d0322d1f397be253b609963cc1961324bdf04 | use crate::errors::TokenParsingError;
#[derive(Debug, Clone, PartialEq, PartialOrd)]
pub enum ResourceQuota {
Databases(u64),
StoredProcedures(u64),
Collections(u64),
DocumentSize(u64),
DocumentsSize(u64),
DocumentsCount(i64),
CollectionSize(u64),
Users(u64),
Permissions(u64),
T... | use crate::errors::TokenParsingError;
#[derive(Debug, Clone, PartialEq, PartialOrd)]
pub enum ResourceQuota {
Databases(u64),
StoredProcedures(u64),
Collections(u64),
DocumentSize(u64),
DocumentsSize(u64),
DocumentsCount(i64),
CollectionSize(u64),
Users(u64),
Permissions(u64),
T... |
}
| fn parse_resource_quota() {
let resource_quota = resource_quotas_from_str("storedProcedures=25;").unwrap();
assert_eq!(resource_quota, vec![ResourceQuota::StoredProcedures(25)]);
let resource_quota = resource_quotas_from_str(
"databases=100;collections=5000;users=500000;permissions=... | function_block-full_function | [
{
"content": "pub fn with_azure_sas(account: &str, sas_token: &str) -> KeyClient {\n\n let client = hyper::Client::builder().build(HttpsConnector::new());\n\n let params = get_sas_token_parms(sas_token);\n\n\n\n KeyClient::new(\n\n account.to_owned(),\n\n String::new(),\n\n Some(pa... |
Rust | eir-fmm/src/entry_functions.rs | ein-lang/eir | 70d59589efeb1f6a7e881abb28ce7aebb862018f | use super::error::CompileError;
use crate::{closures, expressions, reference_count, types};
use std::collections::HashMap;
const CLOSURE_NAME: &str = "_closure";
pub fn compile(
module_builder: &fmm::build::ModuleBuilder,
definition: &eir::ir::Definition,
variables: &HashMap<String, fmm::build::TypedExpre... | use super::error::CompileError;
use crate::{closures, expressions, reference_count, types};
use std::collections::HashMap;
const CLOSURE_NAME: &str = "_closure";
pub fn compile(
module_builder: &fmm::build::ModuleBuilder,
definition: &eir::ir::Definition,
variables: &HashMap<String, fmm::build::TypedExpre... |
},
)?;
Ok(instruction_builder.unreachable())
},
types::compile(definition.result_type(), types),
fmm::types::CallingConvention::Source,
fmm::ir::Linkage::Internal,
)
}
fn compile_normal_thunk_entry(
module_builder: &fmm::build::ModuleBui... | Ok(instruction_builder.return_(
instruction_builder.call(
instruction_builder.atomic_load(
compile_entry_function_pointer(definition, types)?,
fmm::ir::AtomicOrdering::Acquire,
... | call_expression | [
{
"content": "fn infer_in_let(let_: &Let, variables: &HashMap<String, Type>) -> Let {\n\n Let::new(\n\n let_.name(),\n\n let_.type_().clone(),\n\n infer_in_expression(let_.bound_expression(), variables),\n\n infer_in_expression(\n\n let_.expression(),\n\n &va... |
Rust | src/kgen/src/ast/functions/mod.rs | capra314cabra/kaprino | 7b4ce32631194955e9a9cd4e206edadbc5110da4 | use inkwell::types::BasicTypeEnum;
use inkwell::types::FunctionType;
use inkwell::values::FunctionValue;
use crate::ast::CodeGen;
use crate::ast::functions::expr_function::ExprFunction;
use crate::ast::functions::external_function::ExternalFunction;
use crate::ast::functions::statement_function::StatementFunction;
use ... | use inkwell::types::BasicTypeEnum;
use inkwell::types::FunctionType;
use inkwell::values::FunctionValue;
use crate::ast::CodeGen;
use crate::ast::functions::expr_function::ExprFunction;
use crate::ast::functions::external_function::ExternalFunction;
use crate::ast::functions::statement_function::StatementFunction;
use ... |
fn get_func_type<'ctx>(&self, gen: &CodeGen<'ctx>, pos: FilePosition) -> Result<FunctionType<'ctx>, ErrorToken> {
let arg_types = self.get_arg_types(gen, pos.clone())?;
let ret_type = self.get_ret_type(gen, pos)?;
let ret_type = match ret_type {
BasicTypeEnum::A... | ere used in declaration of return value of the function named {}.",
self.get_info().name
)
))?;
Ok(ret_type.get_type(gen))
} | function_block-function_prefixed | [
{
"content": "///\n\n/// Execute a function Just In Time.\n\n///\n\npub fn execute_function(text: &str, func_name: &str, arg: u32) -> Result<u32, ()> {\n\n type TestFunc = unsafe extern \"C\" fn(u32) -> u32;\n\n\n\n let context = &Context::create();\n\n let gen = CodeGen::new(context, \"test\");\n\n\n\... |
Rust | async-coap/src/message/write.rs | Luro02/rust-async-coap | 6a7b592a23de0c9d86ca399bf40ecfbf0bff6e62 |
use super::*;
pub trait MessageWrite: OptionInsert {
fn set_msg_type(&mut self, tt: MsgType);
fn set_msg_id(&mut self, msg_id: MsgId);
fn set_msg_code(&mut self, code: MsgCode);
fn set_msg_token(&mut self, token: MsgToken);
... |
use super::*;
pub trait MessageWrite: OptionInsert {
fn set_msg_type(&mut self, tt: MsgType);
fn set_msg_id(&mut self, msg_id: MsgId);
fn set_msg_code(&mut self, code: MsgCode);
fn set_msg_token(&mut self, token: MsgToken);
... | Ok(())
}
fn write_char(&mut self, c: char) -> Result<(), core::fmt::Error> {
self.append_payload_char(c)?;
Ok(())
}
}
impl<'a> std::io::Write for dyn MessageWrite + 'a {
fn write(&mut self, buf: &[u8]) -> Result<usize, std::io::Error> {
self.append_payload_bytes(buf)
... | .as_bytes())
}
fn append_payload_u8(&mut self, b: u8) -> Result<(), Error> {
self.append_payload_bytes(&[b])
}
fn append_payload_char(&mut self, c: char) -> Result<(), Error> {
self.append_payload_string(c.encode_utf8(&mut [0; 4]))
}
fn ... | random | [
{
"content": "/// Extension trait for option iterators that provide additional convenient accessors.\n\npub trait OptionIteratorExt<'a>: Iterator<Item = Result<(OptionNumber, &'a [u8]), Error>> {\n\n /// Moves the iterator forward until it finds a matching key or the\n\n /// spot where it should have been... |
Rust | src/client.rs | shichaoyuan/mini-redis | cefca5377af54520904c55764d16fc7c0a291902 |
use crate::cmd::{Get, Publish, Set, Subscribe, Unsubscribe};
use crate::{Connection, Frame};
use async_stream::try_stream;
use bytes::Bytes;
use std::io::{Error, ErrorKind};
use std::time::Duration;
use tokio::net::{TcpStream, ToSocketAddrs};
use tokio::stream::Stream;
use tracing::{debug, instrument};
pub struct C... |
use crate::cmd::{Get, Publish, Set, Subscribe, Unsubscribe};
use crate::{Connection, Frame};
use async_stream::try_stream;
use bytes::Bytes;
use std::io::{Error, ErrorKind};
use std::time::Duration;
use tokio::net::{TcpStream, ToSocketAddrs};
use tokio::stream::Stream;
use tracing::{debug, instrument};
pub struct C... |
#[instrument(skip(self))]
pub async fn unsubscribe(&mut self, channels: &[String]) -> crate::Result<()> {
let frame = Unsubscribe::new(&channels).into_frame();
debug!(request = ?frame);
self.client.connection.write_frame(&frame).await?;
... | t?;
self.subscribed_channels
.extend(channels.iter().map(Clone::clone));
Ok(())
} | function_block-function_prefixed | [
{
"content": "/// Creates a message informing the client about a new message on a channel that\n\n/// the client subscribes to.\n\nfn make_message_frame(channel_name: String, msg: Bytes) -> Frame {\n\n let mut response = Frame::array();\n\n response.push_bulk(Bytes::from_static(b\"message\"));\n\n resp... |
Rust | crates/nomination/src/lib.rs | gregdhill/interbtc | 88e53a7d46c437fdd58ef232973388469186ecf9 |
#![deny(warnings)]
#![cfg_attr(test, feature(proc_macro_hygiene))]
#![cfg_attr(not(feature = "std"), no_std)]
#[cfg(test)]
mod mock;
#[cfg(test)]
mod tests;
mod ext;
mod types;
mod default_weights;
use ext::vault_registry::{DefaultVault, SlashingError, TryDepositCollateral, TryWithdrawCollateral};
use frame_supp... |
#![deny(warnings)]
#![cfg_attr(test, feature(proc_macro_hygiene))]
#![cfg_attr(not(feature = "std"), no_std)]
#[cfg(test)]
mod mock;
#[cfg(test)]
mod tests;
mod ext;
mod types;
mod default_weights;
use ext::vault_registry::{DefaultVault, SlashingError, TryDepositCollateral, TryWithdrawCollateral};
use frame_supp... |
pub fn _opt_in_to_nomination(vault_id: &T::AccountId) -> DispatchResult {
ensure!(Self::is_nomination_enabled(), Error::<T>::VaultNominationDisabled);
ensure!(
ext::vault_registry::vault_exists::<T>(&vault_id),
Error::<T>::VaultNotFound
);
... | e!(
new_nominated_collateral <= Self::get_max_nominatable_collateral(vault_backing_collateral)?,
Error::<T>::DepositViolatesMaxNominationRatio
);
ext::fee::withdraw_all_vault_rewards::<T>(&vault_id)?;
Self::deposit_pool_stake::<<T as pallet::Config>::Va... | function_block-function_prefixed | [
{
"content": "pub fn origin_of(account_id: AccountId) -> <Runtime as frame_system::Config>::Origin {\n\n <Runtime as frame_system::Config>::Origin::signed(account_id)\n\n}\n\n\n",
"file_path": "parachain/runtime/tests/mock/mod.rs",
"rank": 0,
"score": 354341.9938808502
},
{
"content": "pu... |
Rust | adafruit-feather-nrf52840-express/examples/feather-express-listener.rs | blueluna/nrf52840-dk-experiments | bbe34a24b9002f9f446e949d7b8013d2e8dae484 | #![no_main]
#![no_std]
use panic_itm as _;
use cortex_m::{iprintln, peripheral::ITM};
use rtic::app;
use bbqueue::{self, BBBuffer};
use nrf52840_hal::{clocks, gpio, uarte};
use nrf52840_pac as pac;
use psila_nrf52::radio::{Radio, MAX_PACKET_LENGHT};
const PACKET_BUFFER_SIZE: usize = 2048;
static PKT_BUFFER: BB... | #![no_main]
#![no_std]
use panic_itm as _;
use cortex_m::{iprintln, peripheral::ITM};
use rtic::app;
use bbqueue::{self, BBBuffer};
use nrf52840_hal::{clocks, gpio, uarte};
use nrf52840_pac as pac;
use psila_nrf52::radio::{Radio, MAX_PACKET_LENGHT};
const PACKET_BUFFER_SIZE: usize = 2048;
static PKT_BUFFER: BB... |
let mut buffer = [0u8; MAX_PACKET_LENGHT];
let _ = radio.receive(&mut buffer);
}
}
}
#[idle(resources = [rx_consumer, uart, itm])]
fn idle(cx: idle::Context) -> ! {
let mut host_packet = [0u8; MAX_PACKET_LENGHT * 2];
let queue =... | = cx.resources.rx_producer;
match queue.grant_exact(MAX_PACKET_LENGHT) {
Ok(mut grant) => {
if grant.buf().len() < MAX_PACKET_LENGHT {
grant.commit(0);
} else {
if let Ok(packet_len) = radio.receive_slice(grant.buf()) {
... | function_block-random_span | [
{
"content": "fn clear(slice: &mut [u8]) {\n\n for v in slice.iter_mut() {\n\n *v = 0;\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum EncryptDecrypt {\n\n /// Encryp operation\n\n Encrypt = 0,\n\n /// Decryp operation\n\n Decrypt = 1,\n\n}\n\n\n\n/// Block cipher key t... |
Rust | src/elastic/src/types/string/macros.rs | reinfer/elastic | 78191a70d3774295ba66e1cf35f72e216e9fbf2a | macro_rules! impl_string_type {
($wrapper_ty:ident, $mapping_ty:ident, $field_type:ident) => {
impl<TMapping> $field_type<TMapping> for $wrapper_ty<TMapping> where TMapping: $mapping_ty {}
impl_mapping_type!(String, $wrapper_ty, $mapping_ty);
impl<'a, TMapping> From<$wrapper_ty<TMapping>> ... | macro_rules! impl_string_type {
($wrapper_ty:ident, $mapping_ty:ident, $field_type:ident) => {
impl<TMapping> $field_type<TMapping> for $wrapper_ty<TMapping> where TMapping: $mapping_ty {}
impl_mapping_type!(String, $wrapper_ty, $mapping_ty);
impl<'a, TMapping> From<$wrapper_ty<TMapping>> ... | orrow::Cow<'a, str>
where
TMapping: $mapping_ty,
{
fn from(wrapper: &'a $wrapper_ty<TMapping>) -> Self {
wrapper.as_ref().into()
}
}
impl<'a, TMapping> From<&'a $wrapper_ty<TMapping>> for &'a str
where
TMapping: $ma... | _ty<TMapping>) -> Self {
wrapper.value
}
}
impl<'a, TMapping> From<&'a $wrapper_ty<TMapping>> for std::b | random | [
{
"content": "fn dedup_urls(endpoint: (String, Endpoint)) -> (String, Endpoint) {\n\n let (name, mut endpoint) = endpoint;\n\n\n\n let mut deduped_paths = BTreeMap::new();\n\n\n\n for path in endpoint.url.paths {\n\n let key = path.params().join(\"\");\n\n\n\n deduped_paths.insert(key, pa... |
Rust | examples/src/bin/orientable_subclass.rs | elmarco/gtk4-rs | a1f7bcc611584c542308bd062ceda0103f96a69a | use std::cell::RefCell;
use std::env;
use gtk::glib;
use gtk::prelude::*;
use gtk::subclass::prelude::ObjectSubclass;
mod imp {
use super::*;
use gtk::{glib::translate::ToGlib, subclass::prelude::*};
#[derive(Debug)]
pub struct CustomOrientable {
first_label: RefCell<Option<gtk::Widget>>,
... | use std::cell::RefCell;
use std::env;
use gtk::glib;
use gtk::prelude::*;
use gtk::subclass::prelude::ObjectSubclass;
mod imp {
use super::*;
use gtk::{glib::translate::ToGlib, subclass::prelude::*};
#[derive(Debug)]
pub struct CustomOrientable {
first_label: RefCell<Option<gtk::Widget>>,
... | bx.append(&orientable);
bx.append(&button);
bx.set_margin_top(18);
bx.set_margin_bottom(18);
bx.set_margin_start(18);
bx.set_margin_end(18);
window.set_child(Some(&bx));
window.show();
});
application.run(&env::args().collect::<Vec<_>>());
}
| button.connect_clicked(glib::clone!(@weak orientable => move |_| {
match orientable.get_orientation() {
gtk::Orientation::Horizontal => orientable.set_orientation(gtk::Orientation::Vertical),
gtk::Orientation::Vertical => orientable.set_orientation(gtk::Orientation::Horizo... | function_block-random_span | [
{
"content": "pub trait ApplicationWindowImpl: WindowImpl + 'static {}\n\n\n\nunsafe impl<T: ApplicationWindowImpl> IsSubclassable<T> for ApplicationWindow {\n\n fn class_init(class: &mut glib::Class<Self>) {\n\n <Window as IsSubclassable<T>>::class_init(class);\n\n }\n\n\n\n fn instance_init(in... |
Rust | packages/vm/src/middleware/deterministic.rs | slave5vw/cosmwasm | 220e39c8977eb0f0391a429c146872ad59b16426 | use wasmer::wasmparser::Operator;
use wasmer::{
FunctionMiddleware, LocalFunctionIndex, MiddlewareError, MiddlewareReaderState,
ModuleMiddleware,
};
#[derive(Debug)]
pub struct Deterministic {}
impl Deterministic {
pub fn new() -> Self {
Self {}
}
}
impl ModuleMiddleware for Deterministic {
... | use wasmer::wasmparser::Operator;
use wasmer::{
FunctionMiddleware, LocalFunctionIndex, MiddlewareError, MiddlewareReaderState,
ModuleMiddleware,
};
#[derive(Debug)]
pub struct Deterministic {}
impl Deterministic {
pub fn new() -> Self {
Self {}
}
}
impl ModuleMiddleware for Deterministic {
... |
let deterministic = Arc::new(Deterministic::new());
let mut compiler_config = Cranelift::default();
compiler_config.push_middleware(deterministic);
let store = Store::new(&JIT::new(compiler_config).engine());
let result = Module::new(&store, &wasm);
assert!(result.is_ok... | let wasm = wat::parse_str(
r#"
(module
(func (export "sum") (param i32 i32) (result i32)
get_local 0
get_local 1
i32.add
))
"#,
)
.unwrap(); | assignment_statement | [
{
"content": "pub fn config(storage: &mut dyn Storage) -> Singleton<State> {\n\n singleton(storage, CONFIG_KEY)\n\n}\n\n\n",
"file_path": "contracts/reflect/src/state.rs",
"rank": 0,
"score": 281227.80228281906
},
{
"content": "#[entry_point]\n\npub fn init(deps: DepsMut, _env: Env, info:... |
Rust | strum_macros/src/macros/enum_iter.rs | orenbenkiki/strum | d5f660a3737ca0db3a5d8384a772e2b92e4ec0ed | use proc_macro2::{Span, TokenStream};
use quote::quote;
use syn::{Data, DeriveInput, Fields, Ident};
use crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};
pub fn enum_iter_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {
let name = &ast.ident;
let gen = &ast.generics;
l... | use proc_macro2::{Span, TokenStream};
use quote::quote;
use syn::{Data, DeriveInput, Fields, Ident};
use crate::helpers::{non_enum_error, HasStrumVariantProperties, HasTypeProperties};
| pub fn enum_iter_inner(ast: &DeriveInput) -> syn::Result<TokenStream> {
let name = &ast.ident;
let gen = &ast.generics;
let (impl_generics, ty_generics, where_clause) = gen.split_for_impl();
let vis = &ast.vis;
let type_properties = ast.get_type_properties()?;
let strum_module_path = type_proper... | function_block-full_function | [
{
"content": "struct Prop(Ident, LitStr);\n\n\n\nimpl Parse for Prop {\n\n fn parse(input: ParseStream) -> syn::Result<Self> {\n\n use syn::ext::IdentExt;\n\n\n\n let k = Ident::parse_any(input)?;\n\n let _: Token![=] = input.parse()?;\n\n let v = input.parse()?;\n\n\n\n Ok... | |
Rust | cargo-spatial/src/download.rs | randomPoison/spatialos-sdk-rs | 6a0149a21a7de40fd4ff127820d6f04f87173454 |
#[cfg(target_os = "linux")]
pub use self::linux::*;
#[cfg(target_os = "macos")]
pub use self::macos::*;
#[cfg(target_os = "windows")]
pub use self::windows::*;
use crate::{config::Config, opt::DownloadSdk};
use log::*;
use reqwest::get;
use std::fs::File;
use std::io::copy;
use std::{
fs,
path::{Path, PathBuf... |
#[cfg(target_os = "linux")]
pub use self::linux::*;
#[cfg(target_os = "macos")]
pub use self::macos::*;
#[cfg(target_os = "windows")]
pub use self::windows::*;
use crate::{config::Config, opt::DownloadSdk};
use log::*;
use reqwest::get;
use std::fs::File;
use std::io::copy;
use std::{
fs,
path::{Path, PathBuf... |
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
enum SpatialPackageSource {
WorkerSdk(SpatialWorkerSdkPackage),
Tools(SpatialToolsPackage),
Schema(SpatialSchemaPackage),
}
impl SpatialPackageSource {
fn package_name(self) -> Vec<&'static str> {
match self {
SpatialPackageSour... | ative_target_directory(self) -> &'static str {
match self {
SpatialSchemaPackage::StandardLibrary => "std-lib",
SpatialSchemaPackage::ExhaustiveTestSchema => "test-schema",
}
} | function_block-function_prefixed | [
{
"content": "/// Formats an key-value pair into an argument string.\n\npub fn format_arg<S: AsRef<OsStr>>(prefix: &str, value: S) -> OsString {\n\n let mut arg = OsString::from(format!(\"--{}=\", prefix));\n\n arg.push(value.as_ref());\n\n arg\n\n}\n",
"file_path": "cargo-spatial/src/lib.rs",
... |
Rust | rg3d-ui/src/check_box.rs | vigdail/rg3d | b65bfdab350f8c1d48bcc288a8449cc74653ef51 | use crate::grid::{Column, GridBuilder, Row};
use crate::message::MessageDirection;
use crate::vector_image::{Primitive, VectorImageBuilder};
use crate::{
border::BorderBuilder,
brush::Brush,
core::{color::Color, pool::Handle},
message::{CheckBoxMessage, UiMessage, UiMessageData, WidgetMessage},
widg... | use crate::grid::{Column, GridBuilder, Row};
use crate::message::MessageDirection;
use crate::vector_image::{Primitive, VectorImageBuilder};
use crate::{
border::BorderBuilder,
brush::Brush,
core::{color::Color, pool::Handle},
message::{CheckBoxMessage, UiMessage, UiMessageData, WidgetMessage},
widg... |
}
#[cfg(test)]
mod test {
use crate::{
check_box::CheckBoxBuilder,
core::algebra::Vector2,
message::{CheckBoxMessage, MessageDirection},
widget::WidgetBuilder,
UserInterface,
};
#[test]
fn check_box() {
let mut ui = UserInterface::new(Vector2::new(1000.... | pub fn build(self, ctx: &mut BuildContext) -> Handle<UiNode> {
let check_mark = self.check_mark.unwrap_or_else(|| {
VectorImageBuilder::new(
WidgetBuilder::new()
.with_vertical_alignment(VerticalAlignment::Center)
.with_horizontal_alignment(Hor... | function_block-full_function | [
{
"content": "pub fn make_default_anchor(ctx: &mut BuildContext, row: usize, column: usize) -> Handle<UiNode> {\n\n let default_anchor_size = 30.0;\n\n BorderBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(default_anchor_size)\n\n .with_height(default_anchor_size)\n\n ... |
Rust | src/resource/model.rs | Jytesh/rg3d | 5cc1017f9a9b3e5d461fbb6247675bf0df4d6d00 | #![warn(missing_docs)]
use crate::{
animation::Animation,
core::{
pool::Handle,
visitor::{Visit, VisitError, VisitResult, Visitor},
},
engine::resource_manager::ResourceManager,
resource::{
fbx::{self, error::FbxError},
Resource, ResourceData,
},
scene::{node... | #![warn(missing_docs)]
use crate::{
animation::Animation,
core::{
pool::Handle,
visitor::{Visit, VisitError, VisitResult, Visitor},
},
engine::resource_manager::ResourceManager,
resource::{
fbx::{self, error::FbxError},
Resource, ResourceData,
},
scene::{node... | xtension = path
.as_ref()
.extension()
.unwrap_or_default()
.to_string_lossy()
.as_ref()
.to_lowercase();
let (scene, mapping) = match extension.as_ref() {
"fbx" => {
let mut scene = Scene::new();
... | ata = self.data_ref();
let (root, old_to_new) = data.scene.graph.copy_node(
data.scene.graph.get_root(),
&mut dest_scene.graph,
&mut |_, _| true,
);
dest_scene.graph[root].is_resource_instance_root = true;
let mut stack = vec![root];
... | random | [
{
"content": "/// Tries to load and convert FBX from given path.\n\n///\n\n/// Normally you should never use this method, use resource manager to load models.\n\npub fn load_to_scene<P: AsRef<Path>>(\n\n scene: &mut Scene,\n\n resource_manager: ResourceManager,\n\n path: P,\n\n) -> Result<(), FbxError>... |
Rust | packages/sycamore-macro/src/component/mod.rs | alsuren/sycamore | df16d18ad29933316aa666185e7e2dd7002eb662 | use proc_macro2::TokenStream;
use quote::{quote, ToTokens};
use syn::parse::{Parse, ParseStream};
use syn::{
Attribute, Block, FnArg, GenericParam, Generics, Ident, Item, ItemFn, Result, ReturnType, Type,
Visibility,
};
pub struct ComponentFunctionName {
pub component_name: Ident,
pub generics: Generic... | use proc_macro2::TokenStream;
use quote::{quote, ToTokens};
use syn::parse::{Parse, ParseStream};
use syn::{
Attribute, Block, FnArg, GenericParam, Generics, Ident, Item, ItemFn, Result, ReturnType, Type,
Visibility,
};
pub struct ComponentFunctionName {
pub component_name: Ident,
pub generics: Generic... | pub fn component_impl(
attr: ComponentFunctionName,
component: ComponentFunction,
) -> Result<TokenStream> {
let ComponentFunctionName {
component_name,
generics: generic_node_ty,
} = attr;
let component_name_str = component_name.to_string();
let generic_node_ty = generic_node_t... | function_block-full_function | [
{
"content": "pub fn route_impl(input: DeriveInput) -> syn::Result<TokenStream> {\n\n let mut quoted = TokenStream::new();\n\n let mut err_quoted = TokenStream::new();\n\n let mut has_error_handler = false;\n\n\n\n match &input.data {\n\n syn::Data::Enum(de) => {\n\n let ty_name = ... | |
Rust | starky/src/constraint_consumer.rs | mfaulk/plonky2 | 2cedd1b02a718d19115560647ba1f741eab83260 | use std::marker::PhantomData;
use plonky2::field::extension_field::Extendable;
use plonky2::field::packed_field::PackedField;
use plonky2::hash::hash_types::RichField;
use plonky2::iop::ext_target::ExtensionTarget;
use plonky2::iop::target::Target;
use plonky2::plonk::circuit_builder::CircuitBuilder;
pub struct Const... | use std::marker::PhantomData;
use plonky2::field::extension_field::Extendable;
use plonky2::field::packed_field::PackedField;
use plonky2::hash::hash_types::RichField;
use plonky2::iop::ext_target::ExtensionTarget;
use plonky2::iop::target::Target;
use plonky2::plonk::circuit_builder::CircuitBuilder;
pub struct Const... |
pub fn constraint_first_row(&mut self, constraint: P) {
self.constraint(constraint * self.lagrange_basis_first);
}
pub fn constraint_last_row(&mut self, constraint: P) {
self.constraint(constraint * self.lagrange_basis_last);
}
}
pub struct RecursiveConstraintCons... | onstraint(&mut self, constraint: P) {
for (&alpha, acc) in self.alphas.iter().zip(&mut self.constraint_accs) {
*acc *= alpha;
*acc += constraint;
}
} | function_block-function_prefixed | [] |
Rust | starchart/src/action/result.rs | starlite-project/starchart | c0f8cd6774596d45bf9a603aa3a37aa5dcde5d3a | use std::{
fmt::{Debug, Display, Formatter, Result as FmtResult},
hint::unreachable_unchecked,
iter::FromIterator,
};
use crate::Entry;
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[must_use = "an ActionResult should be asserted"]
pub enum ActionResult<R> {
Create,
SingleRead(... | use std::{
fmt::{Debug, Display, Formatter, Result as FmtResult},
hint::unreachable_unchecked,
iter::FromIterator,
};
use crate::Entry;
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
#[must_use = "an ActionResult should be asserted"]
pub enum ActionResult<R> {
Create,
SingleRead(... |
#[track_caller]
#[inline]
pub fn unwrap_multi_read<I: FromIterator<R>>(self) -> I {
if let Self::MultiRead(v) = self {
v.into_iter().collect()
} else {
panic!("called `ActionResult::multi_read` on a `{}` value", self)
}
}
pub unsafe fn unwrap_multi_read_unchecked<I: FromI... | pub unsafe fn unwrap_single_read_unchecked(self) -> Option<R> {
debug_assert!(self.is_single_read());
if let Self::SingleRead(v) = self {
v
} else {
unreachable_unchecked()
}
} | function_block-full_function | [
{
"content": "#[cfg(not(feature = \"metadata\"))]\n\npub fn is_metadata(_: &str) -> bool {\n\n\tfalse\n\n}\n\n\n\npub unsafe trait InnerUnwrap<T> {\n\n\tunsafe fn inner_unwrap(self) -> T;\n\n}\n\n\n\n#[cfg(not(has_unwrap_unchecked))]\n\nunsafe impl<T> InnerUnwrap<T> for Option<T> {\n\n\t#[inline]\n\n\t#[track_c... |
Rust | src/connectivity/bluetooth/profiles/bt-hfp-audio-gateway/src/peer/procedure/nrec.rs | fabio-d/fuchsia-stardock | e57f5d1cf015fe2294fc2a5aea704842294318d2 |
use super::{Procedure, ProcedureError, ProcedureMarker, ProcedureRequest};
use crate::peer::{service_level_connection::SlcState, slc_request::SlcRequest, update::AgUpdate};
use at_commands as at;
#[derive(Debug, PartialEq, Clone, Copy)]
enum State {
Start,
SetRequest,
Terminated,
}
impl ... |
use super::{Procedure, ProcedureError, ProcedureMarker, ProcedureRequest};
use crate::peer::{service_level_connection::SlcState, slc_request::SlcRequest, update::AgUpdate};
use at_commands as at;
#[derive(Debug, PartialEq, Clone, Copy)]
enum State {
Start,
SetRequest,
Terminated,
}
impl ... | eRequest::Error(ProcedureError::UnexpectedAg(_))
);
}
#[test]
fn updates_produce_expected_requests() {
let mut proc = NrecProcedure::new();
let mut state = SlcState::default();
let req = proc.hf_update(at::Command::Nrec { nrec: true }, &mut state);
let update = matc... | ,
ProcedureRequest::Error(ProcedureError::UnexpectedHf(_))
);
}
#[test]
fn unexpected_ag_update_returns_error() {
let mut proc = NrecProcedure::new();
let mut state = SlcState::default();
let random_ag = AgUpdate::ThreeWaySupport;
assert_matches!... | random | [] |
Rust | src/sstable/writer.rs | ikatson/rust-sstb | 8f2996d4e330dd1e98a16154e5bb38c6f7b81576 |
use std::convert::TryFrom;
use std::fs::File;
use std::io::BufWriter;
use std::io::{Seek, SeekFrom, Write};
use std::path::Path;
use bincode;
use bloomfilter::Bloom;
use super::compress_ctx_writer::*;
use super::compression;
use super::ondisk_format::*;
use super::options::*;
use super::poswriter::PosWriter;
use su... |
use std::convert::TryFrom;
use std::fs::File;
use std::io::BufWriter;
use std::io::{Seek, SeekFrom, Write};
use std::path::Path;
use bincode;
use bloomfilter::Bloom;
use super::compress_ctx_writer::*;
use super::compression;
use super::ondisk_format::*;
use super::options::*;
use super::poswriter::PosWriter;
use su... |
}
impl RawSSTableWriter for SSTableWriterV2 {
#[allow(clippy::collapsible_if)]
fn set(&mut self, key: &[u8], value: &[u8]) -> Result<()> {
let approx_msg_len = key.len() + 5 + value.len();
if self.meta.items == 0 {
self.sparse_index.push((key.to_owned(),... | pub fn finish(self) -> Result<()> {
match self {
SSTableWriterV2 {
file,
mut meta,
meta_start,
data_start,
sparse_index,
bloom,
..
} => {
let mut writer = file.... | function_block-full_function | [
{
"content": "/// Find the key in the chunk by scanning sequentially.\n\n///\n\n/// This assumes the chunk was fetched from disk and has V1 ondisk format.\n\n///\n\n/// Returns the start and end index of the value.\n\n///\n\n/// TODO: this probably belongs in \"ondisk\" for version V1.\n\npub fn find_value_offs... |
Rust | fifteen_min/src/isochrone.rs | balbok0/abstreet | 3af15fefdb2772c83864c08724318418da8190a9 | use std::collections::{HashMap, HashSet};
use abstutil::MultiMap;
use geom::{Duration, Polygon};
use map_gui::tools::Grid;
use map_model::{
connectivity, AmenityType, BuildingID, BuildingType, LaneType, Map, Path, PathConstraints,
PathRequest,
};
use widgetry::{Color, Drawable, EventCtx, GeomBatch};
use crate... | use std::collections::{HashMap, HashSet};
use abstutil::MultiMap;
use geom::{Duration, Polygon};
use map_gui::tools::Grid;
use map_model::{
connectivity, AmenityType, BuildingID, BuildingType, LaneType, Map, Path, PathConstraints,
PathRequest,
};
use widgetry::{Color, Drawable, EventCtx, GeomBatch};
use crate... |
pub fn path_to(&self, map: &Map, to: BuildingID) -> Option<Path> {
if !self.time_to_reach_building.contains_key(&to) {
return None;
}
let req = PathRequest::between_buildings(
map,
self.start,
to,
match self.options {
... | pub fn new(ctx: &mut EventCtx, app: &App, start: BuildingID, options: Options) -> Isochrone {
let time_to_reach_building = options.clone().time_to_reach_building(&app.map, start);
let mut amenities_reachable = MultiMap::new();
let mut population = 0;
let mut all_roads = HashSet::new();
... | function_block-full_function | [
{
"content": "pub fn pathfind(req: PathRequest, params: &RoutingParams, map: &Map) -> Option<(Path, Duration)> {\n\n if req.constraints == PathConstraints::Pedestrian {\n\n pathfind_walking(req, map)\n\n } else {\n\n let graph = build_graph_for_vehicles(map, req.constraints);\n\n calc... |
Rust | src/objects/mod.rs | hinton-lang/hinton | 796ae395ce45240676875b7ddeddb9b5e54016b2 | use crate::built_in::{NativeBoundMethod, NativeFn};
use crate::core::chunk::Chunk;
use crate::objects::class_obj::*;
use crate::objects::dictionary_obj::*;
use crate::objects::iter_obj::IterObject;
use std::cell::RefCell;
use std::fmt;
use std::fmt::Formatter;
use std::rc::Rc;
pub mod class_obj;
pub mod dictionary_obj... | use crate::built_in::{NativeBoundMethod, NativeFn};
use crate::core::chunk::Chunk;
use crate::objects::class_obj::*;
use crate::objects::dictionary_obj::*;
use crate::objects::iter_obj::IterObject;
use std::cell::RefCell;
use std::fmt;
use std::fmt::Formatter;
use std::rc::Rc;
pub mod class_obj;
pub mod dictionary_obj... |
}
#[derive(Clone)]
pub enum UpValRef {
Open(usize),
Closed(Object),
}
impl UpValRef {
pub fn is_open_at(&self, index: usize) -> bool {
match self {
UpValRef::Closed(_) => false,
UpValRef::Open(i) => *i == index,
}
}
}
#[derive(Clone)]
pub enum Object {
Array(Rc<RefCe... | pub fn into_bound_method(self, c: Rc<RefCell<InstanceObject>>) -> Object {
Object::BoundMethod(BoundMethod {
receiver: c,
method: self,
})
} | function_block-full_function | [
{
"content": "#[cfg(feature = \"show_bytecode\")]\n\npub fn disassemble_func_scope(chunk: &Chunk, natives: &[String], primitives: &[String], name: &str) {\n\n // prints this chunk's name\n\n println!(\"==== {} ====\", name);\n\n\n\n let mut current_line = 0;\n\n\n\n let mut idx = 0;\n\n while idx < ch... |
Rust | crates/eww/src/script_var_handler.rs | RianFuro/eww | e1558965ff45f72c35b7aeed15774381f32e0165 | use std::collections::HashMap;
use crate::{
app,
config::{create_script_var_failed_warn, script_var},
};
use anyhow::*;
use app::DaemonCommand;
use eww_shared_util::VarName;
use nix::{
sys::signal,
unistd::{setpgid, Pid},
};
use simplexpr::dynval::DynVal;
use tokio::{
io::{AsyncBufReadExt, BufRead... | use std::collections::HashMap;
use crate::{
app,
config::{create_script_var_failed_warn, script_var},
};
use anyhow::*;
use app::DaemonCommand;
use eww_shared_util::VarName;
use nix::{
sys::signal,
unistd::{setpgid, Pid},
};
use simplexpr::dynval::DynVal;
use tokio::{
io::{AsyncBufReadExt, BufRead... |
pub fn stop_for_variable(&self, name: VarName) {
crate::print_result_err!(
"while forwarding instruction to script-var handler",
self.msg_send.send(ScriptVarHandlerMsg::Stop(name)),
);
}
pub fn stop_all(&self) {
crate::print_result_err!(
... | pub fn add(&self, script_var: ScriptVarDefinition) {
crate::print_result_err!(
"while forwarding instruction to script-var handler",
self.msg_send.send(ScriptVarHandlerMsg::AddVar(script_var))
);
} | function_block-function_prefix_line | [
{
"content": "pub fn initial_value(var: &ScriptVarDefinition) -> Result<DynVal> {\n\n match var {\n\n ScriptVarDefinition::Poll(x) => match &x.initial_value {\n\n Some(value) => Ok(value.clone()),\n\n None => match &x.command {\n\n VarSource::Function(f) => f()\n\n... |
Rust | src/engine/mod.rs | mersinvald/xsecurelock-saver-rs | e4c064918271a165657e52c4a22d20eb383e9e6a |
use std::sync::Arc;
use rayon::ThreadPoolBuilder;
use sfml::graphics::{
Color,
RenderTarget,
RenderWindow,
View as SfView,
};
use sfml::system::{Clock, SfBox, Time, Vector2f};
use specs::{Component, System};
use shred::Resource;
use physics::{
self,
resources::{PhysicsDeltaTime, PhysicsElaps... |
use std::sync::Arc;
use rayon::ThreadPoolBuilder;
use sfml::graphics::{
Color,
RenderTarget,
RenderWindow,
View as SfView,
};
use sfml::system::{Clock, SfBox, Time, Vector2f};
use specs::{Component, System};
use shred::Resource;
use physics::{
self,
resources::{PhysicsDeltaTime, PhysicsElaps... |
pub fn with_update_sys<S>(mut self, sys: S, name: &str, dep: &[&str]) -> Self
where S: for<'c> System<'c> + Send + 'a
{
self.add_update_sys(sys, name, dep);
self
}
pub fn add_update_sys<S>(&mut self, sys: S, name: &str, dep: &[&str])
where S: for<... | pub fn new() -> Self {
let thread_pool = Arc::new(ThreadPoolBuilder::new().build().unwrap());
Self {
world: {
let mut world = ::specs::World::new();
physics::register(&mut world);
scene_management::register(&mut world);
componen... | function_block-full_function | [
{
"content": "pub trait SpecializedSystem<'a, T> {\n\n type SystemData: SystemData<'a>;\n\n\n\n fn run_special(&mut self, specialized: T, data: Self::SystemData);\n\n\n\n fn setup_special(&mut self, _specialized: T, res: &mut Resources) {\n\n Self::SystemData::setup(res);\n\n }\n\n}\n\n\n\npu... |
Rust | src/clock_control/config.rs | reitermarkus/esp32-hal | 95c7596c78a8e380b858d34f4f0ad1170a5b259a | use super::Error;
use crate::prelude::*;
use core::fmt;
use super::{
dfs, CPUSource, ClockControlConfig, FastRTCSource, SlowRTCSource, CLOCK_CONTROL,
CLOCK_CONTROL_MUTEX,
};
impl<'a> super::ClockControlConfig {
pub fn cpu_frequency(&self) -> Hertz {
unsafe { CLOCK_CONTROL.as_ref().... | use super::Error;
use crate::prelude::*;
use core::fmt;
use super::{
dfs, CPUSource, ClockControlConfig, FastRTCSource, SlowRTCSource, CLOCK_CONTROL,
CLOCK_CONTROL_MUTEX,
};
impl<'a> super::ClockControlConfig {
pub fn cpu_frequency(&self) -> Hertz {
unsafe { CLOCK_CONTROL.as_ref().... | { CLOCK_CONTROL.as_mut().unwrap().rtc_nanoseconds() }
}
}
impl fmt::Debug for ClockControlConfig {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
unsafe { CLOCK_CONTROL.as_ref().unwrap().fmt(f) }
}
}
| where
F: Fn(),
{
unsafe { CLOCK_CONTROL.as_mut().unwrap().add_callback(f) }
}
pub fn get_lock_count(&self) -> dfs::Locks {
unsafe { CLOCK_CONTROL.as_mut().unwrap().get_lock_count() }
}
pub unsafe fn park_core(&mut self, core: crate::Core) {
(&CLOCK... | random | [
{
"content": "#[ram]\n\npub fn enable(interrupt: Interrupt) -> Result<(), Error> {\n\n match interrupt_to_cpu_interrupt(interrupt) {\n\n Ok(cpu_interrupt) => {\n\n unsafe { interrupt::enable_mask(1 << cpu_interrupt.0) };\n\n return Ok(());\n\n }\n\n Err(_) => enable... |
Rust | src/lib.rs | gimli-rs/cpp_demangle | a8afba1db064469278c4530ad9bad28ec4d6c161 |
#![deny(missing_docs)]
#![deny(missing_debug_implementations)]
#![deny(unsafe_code)]
#![allow(unknown_lints)]
#![allow(clippy::inline_always)]
#![allow(clippy::redundant_field_names)]
#![cfg_attr(all(not(feature = "std"), feature = "alloc"), no_std)]
#![cfg_attr(all(not(feature = "std"), feature = "alloc"), feature(... |
#![deny(missing_docs)]
#![deny(missing_debug_implementations)]
#![deny(unsafe_code)]
#![allow(unknown_lints)]
#![allow(clippy::inline_always)]
#![allow(clippy::redundant_field_names)]
#![cfg_attr(all(not(feature = "std"), feature = "alloc"), no_std)]
#![cfg_attr(all(not(feature = "std"), feature = "alloc"), feature(... |
};
let symbol = Symbol {
raw: raw,
substitutions: substitutions,
parsed: parsed,
};
log!(
"Successfully parsed '{}' as
AST = {:#?}
substitutions = {:#?}",
String::from_utf8_lossy(symbol.raw.as_ref()),
symbol.par... | if tail.is_empty() {
parsed
} else {
return Err(Error::UnexpectedText);
} | if_condition | [
{
"content": "#[allow(unsafe_code)]\n\nfn parse_number(base: u32, allow_signed: bool, mut input: IndexStr) -> Result<(isize, IndexStr)> {\n\n if input.is_empty() {\n\n return Err(error::Error::UnexpectedEnd);\n\n }\n\n\n\n let num_is_negative = if allow_signed && input.as_ref()[0] == b'n' {\n\n ... |
Rust | crates/nodes/src/logic_data.rs | gents83/NRG | 62743a54ac873a8dea359f3816e24c189a323ebb | use sabi_serialize::{Deserialize, Serialize, SerializeFile};
use crate::{LogicContext, LogicExecution, NodeExecutionType, NodeState, NodeTree, PinId};
#[derive(Default, PartialEq, Eq, Hash, Clone)]
struct LinkInfo {
node: usize,
pin: PinId,
}
#[derive(Default, Clone)]
struct PinInfo {
id: PinId,
links... | use sabi_serialize::{Deserialize, Serialize, SerializeFile};
use crate::{LogicContext, LogicExecution, NodeExecutionType, NodeState, NodeTree, PinId};
#[derive(Default, PartialEq, Eq, Hash, Clone)]
struct LinkInfo {
node: usize,
pin: PinId,
}
#[derive(Default, Clone)]
struct PinInfo {
id: PinId,
links... |
}
| fn execute_node(
tree: &mut NodeTree,
context: &LogicContext,
link_info: &LinkInfo,
nodes_info: &[NodeInfo],
execution_state: &mut [NodeState],
) -> Vec<LinkInfo> {
let mut new_nodes_to_execute = Vec::new();
let info = &nodes_info[link_info.node];
inf... | function_block-full_function | [] |
Rust | components/resource_metering/src/recorder/cpu.rs | lroolle/tikv | f3f02d7fc6cf7e94abcf8cdb9b9ff52b110a72ba |
use crate::localstorage::LocalStorage;
use crate::recorder::SubRecorder;
use crate::utils;
use crate::utils::Stat;
use crate::{RawRecord, RawRecords, SharedTagPtr};
use collections::HashMap;
use fail::fail_point;
use lazy_static::lazy_static;
lazy_static! {
static ref STAT_TASK_COUNT: prometheus::IntCounter = p... |
use crate::localstorage::LocalStorage;
use crate::recorder::SubRecorder;
use crate::utils;
use crate::utils::Stat;
use crate::{RawRecord, RawRecords, SharedTagPtr};
use collections::HashMap;
use fail::fail_point;
use lazy_static::lazy_static;
lazy_static! {
static ref STAT_TASK_COUNT: prometheus::IntCounter = p... |
#[test]
fn test_record() {
let info = Arc::new(TagInfos {
store_id: 0,
region_id: 0,
peer_id: 0,
extra_attachment: b"abc".to_vec(),
});
let shared_ptr = SharedTagPtr {
ptr: Arc::new(AtomicPtr::new(Arc::into_raw(info) as _)),
... | fn heavy_job() -> u64 {
let m: u64 = rand::random();
let n: u64 = rand::random();
let m = m ^ n;
let n = m.wrapping_mul(n);
let m = m.wrapping_add(n);
let n = m & n;
let m = m | n;
m.wrapping_sub(n)
} | function_block-full_function | [
{
"content": "#[cfg(target_os = \"linux\")]\n\npub fn stat_task(pid: usize, tid: usize) -> std::io::Result<Stat> {\n\n procinfo::pid::stat_task(pid as _, tid as _).map(Into::into)\n\n}\n\n\n\n/// Get the [Stat] of the thread (tid) in the process (pid).\n",
"file_path": "components/resource_metering/src/u... |
Rust | alvr/experiments/graphics_tests/src/compositor/convert.rs | glegoo/ALVR | 76d087fdb05f2035486626551c9ab9022ba645c6 | use super::{Compositor, Context, Swapchain, TextureType};
use alvr_common::prelude::*;
use ash::{extensions::khr, vk};
use openxr_sys as sys;
use std::{ffi::CStr, slice};
use wgpu::{
DeviceDescriptor, Extent3d, Features, Texture, TextureDescriptor, TextureDimension,
TextureFormat, TextureUsages,
};
use wgpu_hal... | use super::{Compositor, Context, Swapchain, TextureType};
use alvr_common::prelude::*;
use ash::{extensions::khr, vk};
use openxr_sys as sys;
use std::{ffi::CStr, slice};
use wgpu::{
DeviceDescriptor, Extent3d, Features, Texture, TextureDescriptor, TextureDimension,
TextureFormat, TextureUsages,
};
use wgpu_hal... |
pub fn new(adapter_index: Option<usize>) -> StrResult<Self> {
let entry = unsafe { trace_err!(ash::Entry::new())? };
let vk_instance = trace_err!(create_vulkan_instance(
&entry,
&vk::InstanceCreateInfo::builder()
.application_info(
... | pub fn from_vulkan(
owned: bool,
entry: ash::Entry,
version: u32,
vk_instance: ash::Instance,
adapter_index: Option<usize>,
vk_device: ash::Device,
queue_family_index: u32,
queue_index: u32,
) -> StrResult<Self> {
let mut flags = hal::Instance... | function_block-full_function | [
{
"content": "#[cfg(target_os = \"macos\")]\n\npub fn get_screen_size() -> StrResult<(u32, u32)> {\n\n Ok((0, 0))\n\n}\n",
"file_path": "alvr/server/src/graphics_info.rs",
"rank": 0,
"score": 257298.96087876664
},
{
"content": "pub fn version() -> String {\n\n let manifest_path = packa... |
Rust | gtk/src/auto/text_tag_table.rs | pop-os/gtk-rs | 0a0e50a2f5ea8f816c005bd8c3d145a5a9581d8c |
use crate::Buildable;
use crate::TextTag;
use glib::object::Cast;
use glib::object::IsA;
use glib::signal::connect_raw;
use glib::signal::SignalHandlerId;
use glib::translate::*;
use std::boxed::Box as Box_;
use std::fmt;
use std::mem::transmute;
glib::wrapper! {
pub struct TextTagTable(Object<ffi::GtkTextTagTab... |
use crate::Buildable;
use crate::TextTag;
use glib::object::Cast;
use glib::object::IsA;
use glib::signal::connect_raw;
use glib::signal::SignalHandlerId;
use glib::translate::*;
use std::boxed::Box as Box_;
use std::fmt;
use std::mem::transmute;
glib::wrapper! {
pub struct TextTagTable(Object<ffi::GtkTextTagTab... |
fn connect_tag_removed<F: Fn(&Self, &TextTag) + 'static>(&self, f: F) -> SignalHandlerId {
unsafe extern "C" fn tag_removed_trampoline<P, F: Fn(&P, &TextTag) + 'static>(
this: *mut ffi::GtkTextTagTable,
tag: *mut ffi::GtkTextTag,
f: glib::ffi::gpointer,
) where
... | let f: &F = &*(f as *const F);
f(
&TextTagTable::from_glib_borrow(this).unsafe_cast_ref(),
&from_glib_borrow(tag),
from_glib(size_changed),
)
}
unsafe {
let f: Box_<F> = Box_::new(f);
connect_raw(
... | function_block-function_prefix_line | [
{
"content": "/// Adds a closure to be called by the main loop the return `Source` is attached to when it's idle.\n\n///\n\n/// `func` will be called repeatedly until it returns `Continue(false)`.\n\npub fn idle_source_new<F>(name: Option<&str>, priority: Priority, func: F) -> Source\n\nwhere\n\n F: FnMut() ... |
Rust | python/src/expression.rs | boaz-codota/ballista | 75f5f79bdcf18ac897d9ab9e11035040d932fc5e | /*
A great deal of this files source code was pulled more or less verbatim from https://github.com/jorgecarleitao/datafusion-python/commit/688f0d23504704cfc2be3fca33e2707e964ea5bc
which is dual liscensed as MIT or Apache-2.0.
*/
/*
MIT License
Copyright (c) 2020 Jorge Leitao
Permission is hereby granted, free of char... | /*
A great deal of this files source code was pulled more or less verbatim from https://github.com/jorgecarleitao/datafusion-python/commit/688f0d23504704cfc2be3fca33e2707e964ea5bc
which is dual liscensed as MIT or Apache-2.0.
*/
/*
MIT License
Copyright (c) 2020 Jorge Leitao
Permission is hereby granted, free of char... |
}
#[pyproto]
impl PyNumberProtocol for BPyExpr {
fn __add__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {
let rhs_expr = any_to_expression(rhs)?;
Ok(BPyExpr {
expr: lhs.expr + rhs_expr,
})
}
fn __sub__(lhs: BPyExpr, rhs: &PyAny) -> PyResult<BPyExpr> {
let r... | if let Ok(expr) = any.extract::<BPyExpr>() {
Ok(expr.expr)
} else if let Ok(scalar_value) = any.extract::<crate::scalar::Scalar>() {
Ok(Expr::Literal(scalar_value.scalar))
} else {
let type_name = util::object_class_name(any)
.unwrap_or_else(|err| format!("<Could not get clas... | if_condition | [
{
"content": "#[pyfunction]\n\npub fn count(value: BPyExpr) -> BPyExpr {\n\n BPyExpr {\n\n expr: logical_plan::count(value.expr),\n\n }\n\n}\n\n\n",
"file_path": "python/src/functions.rs",
"rank": 0,
"score": 210292.79264307546
},
{
"content": "#[pyfunction]\n\npub fn min(value:... |
Rust | zebra-chain/src/serialization/read_zcash.rs | ebfull/zebra | e61b5e50a2f00ebc6e16ac1de10031897acd71cc | use std::io;
use std::net::{IpAddr, SocketAddr};
use byteorder::{BigEndian, LittleEndian, ReadBytesExt};
use super::SerializationError;
pub trait ReadZcashExt: io::Read {
... | use std::io;
use std::net::{IpAddr, SocketAddr};
use byteorder::{BigEndian, LittleEndian, ReadBytesExt};
use super::SerializationError;
pub trait ReadZcashExt: io::Read {
... |
#[inline]
fn read_4_bytes(&mut self) -> io::Result<[u8; 4]> {
let mut bytes = [0; 4];
self.read_exact(&mut bytes)?;
Ok(bytes)
}
#[inline]
fn read_12_bytes(&mut self) -> io::Result<[u8; 12]> {
let mut bytes = [0; 12];
self.read_exact(&mut bytes)?;
... | ring(&mut self) -> Result<String, SerializationError> {
let len = self.read_compactsize()?;
let mut buf = vec![0; len as usize];
self.read_exact(&mut buf)?;
String::from_utf8(buf).map_err(|_| SerializationError::Parse("invalid utf-8"))
} | function_block-function_prefixed | [
{
"content": "/// Check that if there are no Spends or Outputs, that valueBalance is also 0.\n\n///\n\n/// https://zips.z.cash/protocol/canopy.pdf#consensusfrombitcoin\n\npub fn shielded_balances_match(\n\n shielded_data: &ShieldedData,\n\n value_balance: Amount,\n\n) -> Result<(), TransactionError> {\n\n... |
Rust | src/de/mod.rs | RoccoDev/bson-rust | 9781781212056c619464be8444a27587c7dc5de9 |
mod error;
mod raw;
mod serde;
pub use self::{
error::{Error, Result},
serde::Deserializer,
};
use std::io::Read;
use crate::{
bson::{Array, Binary, Bson, DbPointer, Document, JavaScriptCodeWithScope, Regex, Timestamp},
oid::{self, ObjectId},
ser::write_i32,
spec::{self, BinarySubtype},
... |
mod error;
mod raw;
mod serde;
pub use self::{
error::{Error, Result},
serde::Deserializer,
};
use std::io::Read;
use crate::{
bson::{Array, Binary, Bson, DbPointer, Document, JavaScriptCodeWithScope, Regex, Timestamp},
oid::{self, ObjectId},
ser::write_i32,
spec::{self, BinarySubtype},
... |
pub(crate) fn deserialize_bson_kvp<R: Read + ?Sized>(
reader: &mut R,
tag: u8,
utf8_lossy: bool,
) -> Result<(String, Bson)> {
use spec::ElementType;
let key = read_cstring(reader)?;
let val = match ElementType::from(tag) {
Some(ElementType::Double) => Bson::Double(read_f64(reader)?),... | break;
}
let (_, val) = deserialize_bson_kvp(cursor, tag, utf8_lossy)?;
arr.push(val)
}
Ok(())
},
)?;
Ok(arr)
} | function_block-function_prefix_line | [
{
"content": "/// Attempts to serialize a u64 as an i32. Errors if an exact conversion is not possible.\n\npub fn serialize_u64_as_i32<S: Serializer>(val: &u64, serializer: S) -> Result<S::Ok, S::Error> {\n\n match i32::try_from(*val) {\n\n Ok(val) => serializer.serialize_i32(val),\n\n Err(_) =... |
Rust | src/shared/crossterm.rs | jojolepro/crossterm | f4d2ab4feb520e687540e8917793f4fb32f0fe34 |
use super::super::cursor;
use super::super::style;
use super::super::terminal::terminal;
use Context;
use std::fmt::Display;
use std::mem;
use std::rc::Rc;
use std::sync::Arc;
use std::convert::From;
pub struct Crossterm {
context: Rc<Context>
}
impl From<Rc<Context>> for Crossterm
{
fn from(context: Rc<Co... |
use super::super::cursor;
use super::super::style;
use super::super::terminal::terminal;
use Context;
use std::fmt::Display;
use std::mem;
use std::rc::Rc;
use std::sync::Arc;
use std::convert::From;
pub struct Crossterm {
context: Rc<Context>
}
impl From<Rc<Context>> for Crossterm
{
fn from(context: Rc<Co... | paint<'a, D: Display>(&'a self, value: D) -> style::StyledObject<D> {
self.terminal().paint(value)
}
pub fn write<D: Display>(&self, value: D)
{
self.terminal().write(value)
}
pub fn context(&self) -> Rc<Context... | }
pub fn | random | [
{
"content": "/// print wait screen on alternate screen, then swich back.\n\npub fn print_wait_screen_on_alternate_window(context: Rc<Context>) {\n\n // create scope. If this scope ends the screen will be switched back to mainscreen.\n\n // because `AlternateScreen` switches back to main screen when switc... |
Rust | nrf-softdevice/src/flash.rs | timokroeger/nrf-softdevice | 6a01c4ceb7d1f1d9fc06e74e9a264037ac1159c5 | use core::future::Future;
use core::marker::PhantomData;
use core::sync::atomic::{AtomicBool, Ordering};
use embassy::traits::flash::Error as FlashError;
use crate::raw;
use crate::util::{DropBomb, Signal};
use crate::{RawError, Softdevice};
pub struct Flash {
_private: PhantomData<*mut ()>,
}
static FLASH_... | use core::future::Future;
use core::marker::PhantomData;
use core::sync::atomic::{AtomicBool, Ordering};
use embassy::traits::flash::Error as FlashError;
use crate::raw;
use crate::util::{DropBomb, Signal};
use crate::{RawError, Softdevice};
pub struct Flash {
_private: PhantomData<*mut ()>,
}
static FLASH_... | a.as_ptr();
let data_len = data.len() as u32;
if address % 4 != 0 {
return Err(FlashError::AddressMisaligned);
}
if (data_ptr as u32) % 4 != 0 || data_len % 4 != 0 {
return Err(FlashError::BufferMisaligned);
}
... | ing::AcqRel, Ordering::Acquire)
.is_err()
{
panic!("nrf_softdevice::Softdevice::take_flash() called multiple times.")
}
Flash {
_private: PhantomData,
}
}
}
static SIGNAL: Signal<Result<(), FlashError>> = Signal::new();
pub(crate) fn on_flash_su... | random | [
{
"content": "pub fn gen_bindings(\n\n tmp_dir: &PathBuf,\n\n src_dir: &PathBuf,\n\n dst: &PathBuf,\n\n mut f: impl FnMut(String) -> String,\n\n) {\n\n let mut wrapper = String::new();\n\n\n\n for entry in WalkDir::new(src_dir)\n\n .follow_links(true)\n\n .into_iter()\n\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.